= 2 && tile === 0) {\\n if (equallen([at, bt, ct], \\\"X\\\") === 2 && equallen([at, bt, ct], \\\"O\\\") === 0) {\\n if (at === \\\"none\\\") {\\n tile = tileArray[0];\\n } else if (bt === \\\"none\\\") {\\n tile = tileArray[1];\\n } else if (ct === \\\"none\\\") {\\n tile = tileArray[2];\\n }\\n } else if (equallen([dt, et, ft], \\\"X\\\") === 2 && equallen([dt, et, ft], \\\"O\\\") === 0) {\\n if (dt === \\\"none\\\") {\\n tile = tileArray[3];\\n } else if (et === \\\"none\\\") {\\n tile = tileArray[4];\\n } else if (ft === \\\"none\\\") {\\n tile = tileArray[5];\\n }\\n } else if (equallen([gt, ht, it], \\\"X\\\") === 2 && equallen([gt, ht, it], \\\"O\\\") === 0) {\\n if (gt === \\\"none\\\") {\\n tile = tileArray[6];\\n } else if (ht === \\\"none\\\") {\\n tile = tileArray[7];\\n } else if (it === \\\"none\\\") {\\n tile = tileArray[8];\\n }\\n } else if (equallen([at, dt, gt], \\\"X\\\") === 2 && equallen([at, dt, gt], \\\"O\\\") === 0) {\\n if (at === \\\"none\\\") {\\n tile = tileArray[0];\\n } else if (dt === \\\"none\\\") {\\n tile = tileArray[3];\\n } else if (gt === \\\"none\\\") {\\n tile = tileArray[6];\\n }\\n } else if (equallen([bt, et, ht], \\\"X\\\") === 2 && equallen([bt, et, ht], \\\"O\\\") === 0) {\\n if (bt === \\\"none\\\") {\\n tile = tileArray[1];\\n } else if (et === \\\"none\\\") {\\n tile = tileArray[4];\\n } else if (ht === \\\"none\\\") {\\n tile = tileArray[7];\\n }\\n } else if (equallen([ct, ft, it], \\\"X\\\") === 2 && equallen([ct, ft, it], \\\"O\\\") === 0) {\\n if (ct === \\\"none\\\") {\\n tile = tileArray[2];\\n } else if (ft === \\\"none\\\") {\\n tile = tileArray[5];\\n } else if (it === \\\"none\\\") {\\n tile = tileArray[8];\\n }\\n } else if (equallen([at, et, it], \\\"X\\\") === 2 && equallen([at, et, it], \\\"O\\\") === 0) {\\n if (at === \\\"none\\\") {\\n tile = tileArray[0];\\n } else if (et === \\\"none\\\") {\\n tile = tileArray[4];\\n } else if (it === \\\"none\\\") {\\n tile = tileArray[8];\\n }\\n } else if (equallen([ct, et, gt], \\\"X\\\") === 2 && equallen([ct, et, gt], \\\"O\\\") === 0) {\\n if (ct === \\\"none\\\") {\\n tile = tileArray[2];\\n } else if (et === \\\"none\\\") {\\n tile = tileArray[4];\\n } else if (gt === \\\"none\\\") {\\n tile = tileArray[6];\\n }\\n }\\n }\\n\\n //Other options in case the above are not fulfilled\\n //Controls the course of play over the game\\n if (tile === 0) {\\n switch (9 - available.length) {\\n case 1:\\n //If the center is taken, it plays randomly in the corner\\n //Otherwise, it takes the center\\n if (et === \\\"X\\\") {\\n tile = tileArray[choice([0, 2, 6, 8])];\\n } else {\\n tile = tileArray[4];\\n }\\n break;\\n\\n case 3:\\n if (et === \\\"X\\\" && (equalanyof([at, ct, gt, it], \\\"O\\\"))) {\\n /*To counter the strategy of\\n O - -\\n - X -\\n X - -\\n\\n O - -\\n - X -\\n - - X\\n and related strategies*/\\n if (at === \\\"X\\\") {\\n if (it === \\\"none\\\") {\\n tile = tileArray[8];\\n } else {\\n tile = tileArray[choice([2, 6])];\\n }\\n } else if (ct === \\\"X\\\") {\\n if (gt === \\\"none\\\") {\\n tile = tileArray[6];\\n } else {\\n tile = tileArray[choice([0, 8])];\\n }\\n } else if (gt === \\\"X\\\") {\\n if (ct === \\\"none\\\") {\\n tile = tileArray[2];\\n } else {\\n tile = tileArray[choice([0, 8])];\\n }\\n } else if (it === \\\"X\\\") {\\n if (at === \\\"none\\\") {\\n tile = tileArray[0];\\n } else {\\n tile = tileArray[choice([2, 6])];\\n }\\n }\\n } else {\\n tile = choice(tileArray);\\n }\\n break;\\n }\\n }\\n\\n //Generates a random number if it could cause an error\\n if (tile.state != \\\"none\\\") {\\n tile = choice(available);\\n }\\n\\n //Draws the selection\\n tile.state = game.opp;\\n tile.draw();\\n checkCondition();\\n game.turn = \\\"Player\\\";\\n }\\n }\\n\\n //Click handler\\n document.onclick = event => {\\n let pos = getMousePos(event);\\n\\n switch (game.state) {\\n case \\\"start\\\":\\n //Checks if the button was clicked\\n if (isBetween(pos.x, width / 3.2, width / (16 / 11)) && isBetween(pos.y, width / 2, width / 1.6)) {\\n game.state = \\\"game\\\"\\n\\n //Draws the setup for the game\\n ctx.fillStyle = \\\"rgb(225, 225, 225)\\\";\\n ctx.fillRect(0, 0, 400, 400);\\n\\n //Draws the lines\\n ctx.fillStyle = \\\"rgb(200, 200, 200)\\\";\\n ctx.fillRect(blockSize - lineSize / 2, 0, lineSize, width);\\n ctx.fillRect(blockSize * 2 - lineSize / 2, 0, lineSize, width);\\n ctx.fillRect(0, blockSize - lineSize / 2, width, lineSize);\\n ctx.fillRect(0, blockSize * 2 - lineSize / 2, width, lineSize);\\n }\\n break;\\n\\n case \\\"game\\\":\\n if (game.turn === \\\"Player\\\") {\\n //Goes through the tile array, checking if the click occurred there\\n tileArray.forEach(tile => {\\n if (isBetween(pos.x, tile.x, tile.x + blockSize) && isBetween(pos.y, tile.y, tile.y + blockSize)) {\\n if (available.indexOf(tile) != -1) {\\n tile.state = game.player;\\n tile.draw();\\n checkCondition();\\n game.turn = \\\"Opponent\\\";\\n oppTurn();\\n }\\n }\\n });\\n }\\n break;\\n }\\n\\n }\\n </script>\\n</body>\\n\\n</html>\\n\",\n \"language\": \"JavaScript\"\n },\n {\n \"code\": \"// Board\\nconst topLeft = 1;\\nconst topMid = 2;\\nconst topRight = 3;\\nconst midLeft = 4;\\nconst center = 5;\\nconst midRight = 6;\\nconst botLeft = 7;\\nconst botMid = 8;\\nconst botRight = 9;\\nconst tiles = [\\n topLeft, topMid, topRight,\\n midLeft, center, midRight,\\n botLeft, botMid, botRight\\n];\\nconst corners = [\\n topLeft, topRight,\\n botLeft, botRight\\n];\\nconst sides = [\\n topMid,\\n midLeft, midRight,\\n botMid\\n];\\nconst winningCombos = [\\n [topLeft, topMid, topRight],\\n [midLeft, center, midRight],\\n [botLeft, botMid, botRight],\\n [topLeft, midLeft, botLeft],\\n [topMid, center, botMid],\\n [topRight, midRight, botRight],\\n [topLeft, center, botRight],\\n [topRight, center, botLeft],\\n];\\nconst board = new Map();\\n\\n// Utility\\nconst reset = () => tiles.forEach(e => board.set(e, ' '));\\nconst repeat = (s, n) => Array(n).fill(s).join('');\\nconst fromBoard = e => board.get(e);\\nconst notSpace = e => e !== ' ';\\nconst occupied = e => notSpace(fromBoard(e));\\nconst isAvailable = e => !occupied(e);\\nconst notString = s => e => fromBoard(e) !== s;\\nconst containsOnly = s => a => a.filter(occupied).map(fromBoard).join('') === s;\\nconst chooseRandom = a => a[Math.floor(Math.random() * a.length)];\\nconst legalPlays = () => tiles.filter(isAvailable);\\nconst legalCorners = () => corners.filter(isAvailable);\\nconst legalSides = () => sides.filter(isAvailable);\\nconst opponent = s => s === 'X' ? 'O' : 'X';\\nconst hasElements = a => a.length > 0;\\nconst compose = (...fns) => (...x) => fns.reduce((a, b) => c => a(b(c)))(...x);\\nconst isDef = t => t !== undefined;\\nconst flatten = a => a.reduce((p, c) => [...p, ...c], []);\\n\\nconst findShared = a => [...flatten(a).reduce((p, c) =>\\n p.has(c) ? p.set(c, [...p.get(c), c]) : p.set(c, [c]),\\n new Map()).values()].filter(e => e.length > 1).map(e => e[0]);\\n\\nconst wrap = (f, s, p = 9) => n => {\\n if (isDef(n) || legalPlays().length > p) {\\n return n;\\n }\\n const r = f(n);\\n if (isDef(r)) {\\n console.log(`${s}: ${r}`);\\n }\\n return r;\\n};\\n\\nconst drawBoard = () => console.log(`\\n ${[fromBoard(topLeft), fromBoard(topMid), fromBoard(topRight)].join('|')}\\n -+-+-\\n ${[fromBoard(midLeft), fromBoard(center), fromBoard(midRight)].join('|')}\\n -+-+-\\n ${[fromBoard(botLeft), fromBoard(botMid), fromBoard(botRight)].join('|')}\\n`);\\n\\nconst win = s => () => {\\n if (winningCombos.find(containsOnly(repeat(s, 3)))) {\\n console.log(`${s} wins!`);\\n reset()\\n } else if (hasElements(legalPlays())) {\\n console.log(`${opponent(s)}s turn:`);\\n } else {\\n console.log('Draw!');\\n reset();\\n }\\n};\\n\\nconst play = s => n => occupied(n) ? console.log('Illegal') : board.set(n, s);\\n\\n\\n// Available strategy steps\\nconst attack = (s, t = 2) => () => {\\n const m = winningCombos.filter(containsOnly(repeat(s, t)));\\n if (hasElements(m)) {\\n return chooseRandom(chooseRandom(m).filter(notString(s)))\\n }\\n};\\n\\nconst fork = (s, isDefence = false) => () => {\\n let result;\\n const p = winningCombos.filter(containsOnly(s));\\n const forks = findShared(p).filter(isAvailable);\\n\\n // On defence, when there is only one fork, play it, else choose a\\n // two-in-a row attack to force the opponent to not execute the fork.\\n if (forks.length > 1 && isDefence) {\\n const me = opponent(s);\\n const twoInRowCombos = winningCombos.filter(containsOnly(repeat(me, 1)));\\n const chooseFrom = twoInRowCombos.reduce((p, a) => {\\n const avail = a.filter(isAvailable);\\n avail.forEach((e, i) => {\\n board.set(e, me).set(i ? avail[i - 1] : avail[i + 1], opponent(me));\\n winningCombos.filter(containsOnly(repeat(s, 2))).length < 2\\n ? p.push(e)\\n : undefined;\\n });\\n avail.forEach(e => board.set(e, ' '));\\n return p;\\n }, []);\\n result = hasElements(chooseFrom)\\n ? chooseRandom(chooseFrom)\\n : attack(opponent(s), 1)()\\n }\\n return result || chooseRandom(forks);\\n};\\n\\nconst defend = (s, t = 2) => attack(opponent(s), t);\\n\\nconst defendFork = s => fork(opponent(s), true);\\n\\nconst chooseCenter = () => isAvailable(center) ? center : undefined;\\n\\nconst chooseCorner = () => chooseRandom(legalCorners());\\n\\nconst chooseSide = () => chooseRandom(legalSides());\\n\\nconst randLegal = () => chooseRandom(legalPlays());\\n\\n// Implemented strategy\\nconst playToWin = s => compose(\\n win(s),\\n drawBoard,\\n play(s),\\n wrap(randLegal, 'Chose random'),\\n wrap(chooseSide, 'Chose random side', 8),\\n wrap(chooseCorner, 'Chose random corner', 8),\\n wrap(chooseCenter, 'Chose center', 7),\\n wrap(defendFork(s), 'Defended fork'),\\n wrap(fork(s), 'Forked'),\\n wrap(defend(s), 'Defended'),\\n wrap(attack(s), 'Attacked')\\n);\\n\\n// Prep players\\nconst O = n => playToWin('O')(n);\\nconst X = n => playToWin('X')(n);\\n\\n// Begin\\nreset();\\nconsole.log(\\\"Let's begin...\\\");\\ndrawBoard();\\nconsole.log('X Begins: Enter a number from 1 - 9');\\n\\n// Manage user input.\\nconst standard_input = process.stdin;\\nconst overLog = s => {\\n process.stdout.moveCursor(0, -9);\\n process.stdout.cursorTo(0);\\n process.stdout.clearScreenDown();\\n process.stdout.write(s);\\n};\\nstandard_input.setEncoding('utf-8');\\nstandard_input.on('data', (data) => {\\n if (data === '\\\\n') {\\n overLog('O: ');\\n O();\\n } else {\\n overLog(`X: Plays ${data}`);\\n X(Number(data));\\n }\\n});\\n\",\n \"language\": \"JavaScript\"\n },\n {\n \"code\": \"const winningpositions = [[1, 2, 3], [4, 5, 6], [7, 8, 9], [1, 4, 7],\\n [2, 5, 8], [3, 6, 9],[1, 5, 9], [7, 5, 3]]\\n\\nfunction haswon(brd, xoro)\\n marked = findall(x -> x == xoro, brd)\\n for pos in winningpositions\\n if length(pos) <= length(marked) && pos == sort(marked)[1:3]\\n return true\\n end\\n end\\n false\\nend\\n\\nfunction readcharwithprompt(prompt, expected)\\n ret = '*'\\n while !(ret in expected)\\n print(\\\"\\\\n\\\", prompt, \\\" -> \\\")\\n ret = lowercase(chomp(readline()))[1]\\n end\\n ret\\nend\\n\\navailablemoves(brd) = findall(x -> x == ' ', brd)\\ncornersopen(brd) = [x for x in [1, 3, 7, 9] if brd[x] == ' ']\\nint2char(x) = Char(x + UInt8('0'))\\nchar2int(x) = UInt8(x) - UInt8('0')\\ngetyn(query) = readcharwithprompt(query, ['y', 'n'])\\ngettheirmove(brd) = char2int(readcharwithprompt(\\\"Your move(1-9)\\\", int2char.(availablemoves(brd))))\\n\\nfunction findwin(brd, xoro)\\n tmpbrd = deepcopy(brd)\\n for mv in availablemoves(tmpbrd)\\n tmpbrd[mv] = xoro\\n if haswon(tmpbrd, xoro)\\n return mv\\n end\\n tmpbrd[mv] = ' '\\n end\\n return nothing\\nend\\n\\nfunction choosemove(brd, mychar, theirchar)\\n if all(x -> x == ' ', brd)\\n brd[rand(cornersopen(brd))] = mychar # corner trap if starting game\\n elseif availablemoves(brd) == [] # no more moves\\n println(\\\"Game is over. It was a draw.\\\")\\n exit(0)\\n elseif (x = findwin(brd, mychar)) != nothing || (x = findwin(brd, theirchar)) != nothing\\n brd[x] = mychar # win if possible, block their win otherwise if their win is possible\\n elseif brd[5] == ' '\\n brd[5] = mychar # take center if open and not doing corner trap\\n elseif (corners = cornersopen(brd)) != []\\n brd[rand(corners)] = mychar # choose a corner over a side middle move\\n else\\n brd[rand(availablemoves(brd))] = mychar # random otherwise\\n end\\nend\\n\\nfunction display(brd)\\n println(\\\"+-----------+\\\")\\n println(\\\"| \\\", brd[1], \\\" | \\\", brd[2], \\\" | \\\", brd[3], \\\" |\\\")\\n println(\\\"| \\\", brd[4], \\\" | \\\", brd[5], \\\" | \\\", brd[6], \\\" |\\\")\\n println(\\\"| \\\", brd[7], \\\" | \\\", brd[8], \\\" | \\\", brd[9], \\\" |\\\")\\n println(\\\"+-----------+\\\")\\nend\\n\\nfunction tictactoe()\\n board = fill(' ', 9)\\n println(\\\"Board move grid:\\\\n 1 2 3\\\\n 4 5 6\\\\n 7 8 9\\\")\\n yn = getyn(\\\"Would you like to move first (y/n)?\\\")\\n if yn == 'y'\\n mychar = 'O'\\n theirchar = 'X'\\n board[gettheirmove(board)] = theirchar\\n else\\n mychar = 'X'\\n theirchar = 'O'\\n end\\n while true\\n choosemove(board, mychar, theirchar)\\n println(\\\"Computer has moved.\\\")\\n display(board)\\n if haswon(board, mychar)\\n println(\\\"Game over. Computer wins!\\\")\\n exit(0)\\n elseif availablemoves(board) == []\\n break\\n end\\n board[gettheirmove(board)] = theirchar\\n println(\\\"Player has moved.\\\")\\n display(board)\\n if haswon(board, theirchar)\\n println(\\\"Game over. Player wins!\\\")\\n exit(0)\\n elseif availablemoves(board) == []\\n break\\n end\\n end\\n println(\\\"Game over. It was a draw.\\\")\\nend\\n\\ntictactoe()\\n\",\n \"language\": \"Julia\"\n },\n {\n \"code\": \"import std/os/readline\\n\\nfun member(x: a, xs: list<a>, compare: (a, a) -> bool) : bool\\n match xs\\n Nil -> False\\n Cons(y, ys) -> x.compare(y) || member(x, ys,compare)\\n\\nfun member(xs: list<a>, x: a, compare: (a, a) -> bool) : bool\\n x.member(xs, compare)\\n\\n\\nstruct coord\\n x: int\\n y: int\\n\\nfun show(c: coord) : string {\\n \\\"(\\\" ++ c.x.show() ++ \\\", \\\" ++ c.y.show() ++ \\\")\\\"\\n}\\n\\n\\nfun (==)(c1: coord, c2: coord) : bool\\n c1.x == c2.x && c1.y == c2.y\\n\\n\\neffect ctl eject(): a\\n\\n\\nfun parse(str : string, moves : list<coord>) : <console, exn|_e>coord\\n match str.list()\\n Cons('0', Cons(' ', Cons('0', Nil))) -> Coord(0,0)\\n Cons('0', Cons(' ', Cons('1', Nil))) -> Coord(0,1)\\n Cons('0', Cons(' ', Cons('2', Nil))) -> Coord(0,2)\\n Cons('1', Cons(' ', Cons('0', Nil))) -> Coord(1,0)\\n Cons('1', Cons(' ', Cons('1', Nil))) -> Coord(1,1)\\n Cons('1', Cons(' ', Cons('2', Nil))) -> Coord(1,2)\\n Cons('2', Cons(' ', Cons('0', Nil))) -> Coord(2,0)\\n Cons('2', Cons(' ', Cons('1', Nil))) -> Coord(2,1)\\n Cons('2', Cons(' ', Cons('2', Nil))) -> Coord(2,2)\\n Cons('0', Cons(',', Cons('0', Nil))) -> Coord(0,0)\\n Cons('0', Cons(',', Cons('1', Nil))) -> Coord(0,1)\\n Cons('0', Cons(',', Cons('2', Nil))) -> Coord(0,2)\\n Cons('1', Cons(',', Cons('0', Nil))) -> Coord(1,0)\\n Cons('1', Cons(',', Cons('1', Nil))) -> Coord(1,1)\\n Cons('1', Cons(',', Cons('2', Nil))) -> Coord(1,2)\\n Cons('2', Cons(',', Cons('0', Nil))) -> Coord(2,0)\\n Cons('2', Cons(',', Cons('1', Nil))) -> Coord(2,1)\\n Cons('2', Cons(',', Cons('2', Nil))) -> Coord(2,2)\\n Cons('q', Nil) -> eject()\\n _ ->\\n println(\\\"Invalid move, please try again\\\")\\n gen_move(moves)\\n\\nfun gen_move(moves : list<coord>) : <console, exn|_e> coord\\n val move : coord = parse(readline(), moves)\\n\\n if moves.any() fn (c : coord) { c == move } then {\\n println(\\\"Invalid move, please try again\\\")\\n gen_move(moves)\\n } else {\\n move\\n }\\n\\nfun create-board() : list<list<char>> {\\n [['.','.','.'],['.','.','.'],['.','.','.']]\\n}\\n\\nfun show(grid: list<list<char>>) : string\\n var line := 0\\n grid.foldl(\\\" 0 1 2\\\\n\\\") fn(acc, row: list<char>)\\n\\n val out = row.foldl(acc ++ line.show() ++ \\\" \\\") fn(acc, col: char)\\n acc ++ col.string() ++ \\\" \\\"\\n ++ \\\"\\\\n\\\"\\n line := line + 1\\n out\\n\\n\\n\\nfun get_board_position(board : list<list<char>>, coord : coord) : maybe<char> {\\n match board[coord.y] {\\n Nothing -> Nothing\\n Just(row) -> row[coord.x]\\n }\\n}\\n\\nfun mark_board(board: list<list<char>>,coord: coord, mark: char): maybe<list<list<char>>>\\n val new_row: maybe<list<char>> = match board[coord.y]\\n Nothing -> Nothing\\n Just(row) -> Just(row.take(coord.x) ++ mark.Cons(row.drop(coord.x + 1)))\\n\\n match new_row\\n Nothing -> Nothing\\n Just(row) -> Just(board.take(coord.y) ++ row.Cons(board.drop(coord.y + 1)))\\n\\n\\neffect ctl not_full() : ()\\n\\nfun check_full(board: list<list<char>>) : bool\\n fun helper()\\n var full := True\\n board.foreach() fn(row)\\n if '.'.member(row) fn (a, b) a == b then {\\n not_full()\\n }\\n full\\n\\n with ctl not_full() False\\n helper()\\n\\nfun check_win(board: list<list<char>>, mark: char) : <div, exn|_e>bool\\n\\n var win := False\\n var i := 0\\n while {i < 3} {\\n if board.get_board_position(Coord(i,0)).unwrap() == mark && board.get_board_position(Coord(i,1)).unwrap() == mark && board.get_board_position(Coord(i,2)).unwrap() == mark then {\\n win := True\\n }\\n if board.get_board_position(Coord(0,i)).unwrap() == mark && board.get_board_position(Coord(1,i)).unwrap() == mark && board.get_board_position(Coord(2,i)).unwrap() == mark then {\\n win := True\\n }\\n i := i + 1\\n }\\n if board.get_board_position(Coord(0,0)).unwrap() == mark && board.get_board_position(Coord(1,1)).unwrap() == mark && board.get_board_position(Coord(2,2)).unwrap() == mark then {\\n win := True\\n }\\n if board.get_board_position(Coord(0,2)).unwrap() == mark && board.get_board_position(Coord(1,1)).unwrap() == mark && board.get_board_position(Coord(2,0)).unwrap() == mark then {\\n win := True\\n }\\n\\n win\\n\\n\\n\\nfun human_logic(board: list<list<char>>, moves: list<coord>, mark: char, other_mark: char) : <console,div,exn|_e> coord\\n gen_move(moves)\\n\\n\\nfun ai_logic(board: list<list<char>>, moves: list<coord>, mark: char, other_mark: char)\\n board.gen_ai_move(moves,mark, other_mark)\\n\\n\\nstruct move\\n move : coord\\n score: int\\n\\nfun (==)(m1 : move, m2 : move) : bool {\\n m1.move == m2.move && m1.score == m2.score\\n}\\n\\nfun eval_board(board : list<list<char>>, mark: char, other-mark : char) {\\n if board.check_win(mark) then {\\n 10\\n }\\n elif board.check_win(other-mark) then {\\n -10\\n }\\n else {\\n 0\\n }\\n}\\n\\nfun maximum-move(a : move, b : move) : move {\\n if a.score > b.score then {\\n a\\n }\\n else {\\n b\\n }\\n}\\n\\n\\nfun gen_ai_move(board : list<list<char>>, moves : list<coord>, mark : char, other-mark : char) {\\n val best_move : move = Move(Coord(-1,-1), -1000)\\n [0,1,2].foldl(best_move) fn (bstMove : move, i : int) {\\n [0,1,2].foldl(bstMove) fn (bstMve : move, j : int) {\\n if Coord(i,j).member(moves) fn (a,b) {a == b} then {\\n bstMve\\n }\\n else {\\n val new_board : list<list<char>> = board.mark_board(Coord(i,j), mark).unwrap()\\n val new-max = maximum-move(bstMve, Move(Coord(i,j), new_board.minimax(moves ++ [Coord(i,j)], 0, False, mark, other-mark)))\\n new-max\\n }\\n }\\n }.move\\n}\\n\\nfun unwrap(x: maybe<a>): <exn> a\\n match x\\n Just(a) -> a\\n Nothing -> throw(\\\"value was Nothing\\\")\\n\\n// A basic implementation of Minimax\\n// This uses brace style to show that it is possible\\nfun minimax(board : list<list<char>>, moves: list<coord>, depth : int, isMaximizingPlayer : bool, mark : char, other-mark : char) : <div,exn|_e> int {\\n val score : int = board.eval_board(mark, other-mark)\\n if score == 10 then {\\n score\\n }\\n elif score == -10 then {\\n score\\n }\\n elif board.check_full() then {\\n 0\\n }\\n else {\\n if isMaximizingPlayer then {\\n val bestVal: int = -1000\\n [0,1,2].foldl(bestVal) fn (bstVal : int, i : int) {\\n [0,1,2].foldl(bstVal) fn (bstVl : int, j : int) {\\n if Coord(i,j).member(moves) fn(a, b) {a == b} then {\\n bstVl\\n }\\n else {\\n val new_board : list<list<char>> = board.mark_board(Coord(i,j), mark).unwrap()\\n val value : int = new_board.minimax(moves ++ [Coord(i,j)], depth + 1, !isMaximizingPlayer, mark, other-mark)\\n max(bstVl, value)\\n }\\n }\\n }\\n }\\n else {\\n val bestVal: int = 1000\\n [0,1,2].foldl(bestVal) fn (bstVal : int, i : int) {\\n [0,1,2].foldl(bstVal) fn (bstVl : int, j : int) {\\n if Coord(i,j).member(moves) fn(a,b) {a == b} then {\\n bstVl\\n }\\n else {\\n val new_board : list<list<char>> = board.mark_board(Coord(i,j), other-mark).unwrap()\\n val value : int = new_board.minimax(moves ++ [Coord(i,j)], depth + 1, !isMaximizingPlayer, mark, other-mark)\\n min(bstVl, value)\\n }\\n }\\n }\\n }\\n }\\n}\\n\\n// The main business logic of the entire game\\n// This function checks if there is a draw or a win\\nfun play_game()\\n val board = get_board()\\n\\n if board.check_full() then\\n println(\\\"Draw!\\\")\\n println(\\\"Final board:\\\")\\n board.show().println\\n else\\n \\\"Next Turn:\\\".println\\n board.show().println\\n val current_mark = get_current_mark()\\n val other_mark = get_other_mark()\\n play_turn(current_mark, other_mark)\\n val new_board = get_board()\\n\\n if new_board.check_win(current_mark) then\\n println(\\\"Player \\\" ++ current_mark.show() ++ \\\" wins!\\\")\\n println(\\\"Final board:\\\")\\n new_board.show().println\\n else\\n flip()\\n play_game()\\n\\n\\neffect human_turn\\n fun play_human_turn(pair: (list<list<char>>, list<coord>), marks: (char, char)) : coord\\neffect ai_turn\\n fun play_ai_turn(pair: (list<list<char>>, list<coord>), marks: (char, char)) : coord\\n\\neffect player1\\n fun player1_turn(pair: (list<list<char>>, list<coord>), marks: (char, char)) : coord\\n fun get_player1_mark() : char\\neffect player2\\n fun player2_turn(pair: (list<list<char>>, list<coord>), marks: (char, char)) : coord\\n fun get_player2_mark() : char\\n\\n\\neffect turn\\n // Changes the current player to a different one\\n fun flip() : ()\\n // Calls the appropriate code for the current player\\n fun play_turn(mark: char, other_mark: char) : ()\\n // Gets the symbol of the active player\\n fun get_current_mark(): char\\n // Gets the symbol of the inactive player\\n fun get_other_mark(): char\\n // This allows us to access the board\\n fun get_board() : list<list<char>>\\n // This allows us to access the moves that have been made\\n fun get_moves(): list<coord>\\n\\n\\n\\ntype player\\n Human\\n AI\\n\\ntype players\\n One\\n Two\\n\\n// This function encapsulates the state of the entire game\\n// Think of it as calling a method on an object but with pure functions\\nfun initialize_and_start_game(game_type: int)\\n var current_player := One\\n var current_board := create-board()\\n var all_moves := []\\n\\n var player1 := Human\\n var player2 := AI\\n\\n match game_type\\n 1 -> {\\n player1 := Human\\n player2 := Human\\n }\\n 2 -> {\\n player1 := Human\\n player2 := AI\\n }\\n 3 -> {\\n player1 := AI\\n player2 := AI\\n }\\n _ -> throw(\\\"invalid game type\\\")\\n\\n\\n with handler\\n ctl eject()\\n println(\\\"Have a nice day.\\\")\\n with fun play_human_turn(pair: (list<list<char>>, list<coord>), marks: (char, char))\\n human_logic(pair.fst,pair.snd,marks.fst,marks.snd)\\n with fun play_ai_turn(pair: (list<list<char>>, list<coord>), marks: (char, char))\\n ai_logic(pair.fst,pair.snd,marks.fst,marks.snd)\\n with handler\\n fun player1_turn(pair: (list<list<char>>, list<coord>), marks: (char, char))\\n match player1\\n Human -> play_human_turn(pair, marks)\\n AI -> play_ai_turn(pair, marks)\\n fun get_player1_mark()\\n 'X'\\n with handler\\n fun player2_turn(pair: (list<list<char>>, list<coord>), marks: (char, char))\\n match player2\\n Human -> play_human_turn(pair, marks)\\n AI -> play_ai_turn(pair, marks)\\n fun get_player2_mark()\\n 'O'\\n with handler\\n return(x) ()\\n fun flip()\\n match current_player\\n One -> current_player := Two\\n Two -> current_player := One\\n fun play_turn(mark: char, other_mark: char)\\n match current_player\\n One -> {\\n val coord = player1_turn((current_board, all_moves), (mark, other_mark))\\n current_board := mark_board(current_board,coord,get_player1_mark()).unwrap\\n\\n all_moves := Cons(coord, all_moves)\\n ()\\n }\\n Two -> {\\n val coord = player2_turn((current_board, all_moves), (mark, other_mark))\\n\\n current_board := mark_board(current_board,coord,get_player2_mark()).unwrap\\n\\n all_moves := Cons(coord, all_moves)\\n ()\\n }\\n fun get_current_mark() match current_player\\n One -> get_player1_mark()\\n Two -> get_player2_mark()\\n fun get_other_mark() match current_player\\n Two -> get_player1_mark()\\n One -> get_player2_mark()\\n fun get_board() current_board\\n fun get_moves() all_moves\\n play_game()\\n\\n\\n\\nfun prompt_game_type()\\n match readline().list()\\n Cons('1', Nil) -> 1\\n Cons('2', Nil) -> 2\\n Cons('3', Nil) -> 3\\n _ ->\\n println(\\\"Invalid game mode, please try again\\\")\\n prompt_game_type()\\n\\n\\nfun main ()\\n println(\\\"Welcome to Tic Tac Toe!\\\")\\n println(\\\"Please select a game mode:\\\")\\n println(\\\"1. Two player\\\")\\n println(\\\"2. One player\\\")\\n println(\\\"3. Zero player\\\")\\n println(\\\"Enter the number of the game mode you want to play\\\")\\n\\n val game_type = prompt_game_type()\\n\\n \\\"Enter your input as 'x y' or 'x,y' when selecting a spot\\\".println\\n\\n initialize_and_start_game(game_type)\\n\",\n \"language\": \"Koka\"\n },\n {\n \"code\": \"// version 1.1.51\\n\\nimport java.util.Random\\n\\nval r = Random()\\nval b = Array(3) { IntArray(3) } // board -> 0: blank; -1: computer; 1: human\\n\\nvar bestI = 0\\nvar bestJ = 0\\n\\nfun checkWinner(): Int {\\n for (i in 0..2) {\\n if (b[i][0] != 0 && b[i][1] == b[i][0] && b[i][2] == b[i][0]) return b[i][0]\\n if (b[0][i] != 0 && b[1][i] == b[0][i] && b[2][i] == b[0][i]) return b[0][i]\\n }\\n if (b[1][1] == 0) return 0\\n if (b[1][1] == b[0][0] && b[2][2] == b[0][0]) return b[0][0]\\n if (b[1][1] == b[2][0] && b[0][2] == b[1][1]) return b[1][1]\\n return 0\\n}\\n\\nfun showBoard() {\\n val t = \\\"X O\\\"\\n for (i in 0..2) {\\n for (j in 0..2) print(\\\"${t[b[i][j] + 1]} \\\")\\n println()\\n }\\n println(\\\"-----\\\")\\n}\\n\\nfun testMove(value: Int, depth: Int): Int {\\n var best = -1\\n var changed = 0\\n var score = checkWinner()\\n if (score != 0) return if (score == value) 1 else -1\\n for (i in 0..2) {\\n for (j in 0..2) {\\n if (b[i][j] != 0) continue\\n b[i][j] = value\\n changed = value\\n score = -testMove(-value, depth + 1)\\n b[i][j] = 0\\n if (score <= best) continue\\n if (depth == 0) {\\n bestI = i\\n bestJ = j\\n }\\n best = score\\n }\\n }\\n return if (changed != 0) best else 0\\n}\\n\\nfun game(user: Boolean): String {\\n var u = user\\n for (i in 0..2) b[i].fill(0)\\n print(\\\"Board postions are numbered so:\\\\n1 2 3\\\\n4 5 6\\\\n7 8 9\\\\n\\\")\\n print(\\\"You have O, I have X.\\\\n\\\\n\\\")\\n\\n for (k in 0..8) {\\n while (u) {\\n var move: Int?\\n do {\\n print(\\\"Your move: \\\")\\n move = readLine()!!.toIntOrNull()\\n }\\n while (move != null && move !in 1..9)\\n move = move!! - 1\\n val i = move / 3\\n val j = move % 3\\n if (b[i][j] != 0) continue\\n b[i][j] = 1\\n break\\n }\\n if (!u) {\\n if (k == 0) { // randomize if computer opens, less boring\\n bestI = r.nextInt(Int.MAX_VALUE) % 3\\n bestJ = r.nextInt(Int.MAX_VALUE) % 3\\n }\\n else testMove(-1, 0)\\n b[bestI][bestJ] = -1\\n val myMove = bestI * 3 + bestJ + 1\\n println(\\\"My move: $myMove\\\")\\n }\\n showBoard()\\n val win = checkWinner()\\n if (win != 0) return (if (win == 1) \\\"You win\\\" else \\\"I win\\\") + \\\".\\\\n\\\\n\\\"\\n u = !u\\n }\\n return \\\"A draw.\\\\n\\\\n\\\"\\n}\\n\\nfun main(args: Array<String>) {\\n var user = false\\n while (true) {\\n user = !user\\n print(game(user))\\n var yn: String\\n do {\\n print(\\\"Play again y/n: \\\")\\n yn = readLine()!!.toLowerCase()\\n }\\n while (yn != \\\"y\\\" && yn != \\\"n\\\")\\n if (yn != \\\"y\\\") return\\n println()\\n }\\n}\\n\",\n \"language\": \"Kotlin\"\n },\n {\n \"code\": \"[\\nsession_start('user')\\nsession_addvar('user', 'matrix')\\nsession_addvar('user', 'winrecord')\\nsession_addvar('user', 'turn')\\nvar(matrix)->isNotA(::array) ? var(matrix = array('-','-','-','-','-','-','-','-','-'))\\nvar(winrecord)->isNotA(::array) ? var(winrecord = array)\\nvar(turn)->isNotA(::string) ? var(turn = 'x')\\n\\nif(web_request->params->asStaticArray >> 'reset') => {\\n\\t$matrix = array('-','-','-','-','-','-','-','-','-')\\n\\t$turn = 'x'\\n}\\n\\nwith i in web_request->params->asStaticArray do => {\\n\\tif(#i->name->beginswith('p')) => {\\n\\t\\tlocal(num = #i->name->asCopy)\\n\\t\\t#num->removeLeading('p')\\n\\t\\t#num = integer(#num)\\n\\t\\t#num > 0 && $matrix->get(#num) == '-' ? $matrix->get(#num) = #i->value\\n\\t\\t$turn == 'o' ? $turn = 'x' | $turn = 'o'\\n\\t}\\n}\\n\\nlocal(\\n\\tistie \\t= false,\\n\\twinner\\t= 'noone',\\n\\tclear\\t= false\\n)\\n\\n// determine if we have a winner\\nif($matrix->find('-')->size < 9) => {\\n\\tlocal(winners = array('123','456','789','147','258','369','159','357'))\\n\\tloop(8) => {\\n\\t\\tlocal(xscore = 0,oscore = 0,use = #winners->get(loop_count))\\n\\t\\twith v in #use->values do => {\\n\\t\\t\\t$matrix->findposition('x') >> integer(#v) ? #xscore++\\n\\t\\t\\t$matrix->findposition('o') >> integer(#v) ? #oscore++\\n\\t\\t}\\n\\t\\tif(#xscore == 3) => {\\n\\t\\t\\t#winner = 'x'\\n\\t\\t\\t$winrecord->insert('x')\\n\\t\\t\\t#clear = true\\n\\t\\t\\tloop_abort\\n\\t\\t}\\n\\t\\tif(#oscore == 3) => {\\n\\t\\t\\t#winner = 'o'\\n\\t\\t\\t$winrecord->insert('o')\\n\\t\\t\\t#clear = true\\n\\t\\t\\tloop_abort\\n\\t\\t}\\n\\t\\t\\n\\t}\\n\\t\\n}\\n// determine if tie\\nif(not $matrix->find('-')->size && #winner == 'noone') => {\\n\\t#istie = true\\n\\t#winner = 'tie'\\n\\t$winrecord->insert('tie')\\n\\t#clear = true\\n}\\n]\\n<form action=\\\"?\\\" method=\\\"post\\\">\\n <table>\\n <tr>\\n [loop(3) => {^]<td><button name=\\\"p[loop_count]\\\" value=\\\"[$turn]\\\"[\\n $matrix->get(loop_count) != '-' || #winner != 'noone' ? ' disabled=\\\"disabled\\\"'\\n ]>[$matrix->get(loop_count) != '-' ? $matrix->get(loop_count) | ' ']</button></td>[^}]\\n </tr>\\n <tr>\\n [loop(-from=4,-to=6) => {^]<td><button name=\\\"p[loop_count]\\\" value=\\\"[$turn]\\\"[\\n $matrix->get(loop_count) != '-' || #winner != 'noone' ? ' disabled=\\\"disabled\\\"'\\n ]>[$matrix->get(loop_count) != '-' ? $matrix->get(loop_count) | ' ']</button></td>[^}]\\n </tr>\\n <tr>\\n [loop(-from=7,-to=9) => {^]<td><button name=\\\"p[loop_count]\\\" value=\\\"[$turn]\\\"[\\n $matrix->get(loop_count) != '-' || #winner != 'noone' ? ' disabled=\\\"disabled\\\"'\\n ]>[$matrix->get(loop_count) != '-' ? $matrix->get(loop_count) | ' ']</button></td>[^}]\\n </tr>\\n </table>\\n</form>\\n[if(#istie && #winner == 'tie')]\\n<p><b>It's a tie!</b></p>\\n[else(#winner != 'noone')]\\n<p>[#winner->uppercase&] won! Congratulations.</p>\\n[else]<math>Insert formula here</math>\\n<p>It is now [$turn]'s turn!</p>\\n[/if]\\n<p><a href=\\\"?reset\\\">Reset</a></p>\\n[if($winrecord->size)]<p>Win record: [$winrecord->join(', ')]</p>[/if]\\n[if(#clear == true) => {\\n\\t$matrix = array('-','-','-','-','-','-','-','-','-')\\n\\t$turn = 'x'\\n}]\\n\",\n \"language\": \"Lasso\"\n },\n {\n \"code\": \"global $ -- object representing simple framework\\nglobal gBoard -- current board image\\nglobal gBoardTemplate -- empty board image\\nglobal gHumanChip -- cross image\\nglobal gComputerChip -- circle image\\nglobal gM -- 3x3 matrix storing game state: 0=free cell, 1=human cell, -1=computer cell\\nglobal gStep -- index of current move (1..9)\\nglobal gGameOverFlag -- TRUE if current game is over\\n\\n----------------------------------------\\n-- Entry point\\n----------------------------------------\\non startMovie\\n\\n -- libs\\n $.import(\\\"sprite\\\")\\n\\n -- window properties\\n _movie.stage.title = \\\"Tic-Tac-Toe\\\"\\n _movie.stage.rect = rect(0, 0, 224, 310)\\n _movie.centerStage = TRUE\\n\\n -- load images from filesystem\\n m = new(#bitmap)\\n m.importFileInto($.@(\\\"resources/cross.bmp\\\"), [#trimWhiteSpace:FALSE])\\n gHumanChip = m.image\\n\\n m = new(#bitmap)\\n m.importFileInto($.@(\\\"resources/circle.bmp\\\"), [#trimWhiteSpace:FALSE])\\n gComputerChip = m.image\\n\\n -- create GUI\\n m = new(#bitmap)\\n m.importFileInto($.@(\\\"resources/board.bmp\\\"))\\n m.regpoint = point(0, 0)\\n s = $.sprite.make(m, [#loc:point(20, 20)], TRUE)\\n s.addListener(#mouseDown, _movie, #humanMove)\\n\\n gBoard = m.image\\n gBoardTemplate = gBoard.duplicate()\\n\\n m = $.sprite.newMember(#button, [#text:\\\"New Game (Human starts)\\\", #fontstyle:\\\"bold\\\", #rect:rect(0, 0, 180, 0)])\\n s = $.sprite.make(m, [#loc:point(20, 220)], TRUE)\\n s.addListener(#mouseDown, _movie, #newGame, 1)\\n\\n m = $.sprite.newMember(#button, [#text:\\\"New Game (Computer starts)\\\", #fontstyle:\\\"bold\\\", #rect:rect(0, 0, 180, 0)])\\n s = $.sprite.make(m, [#loc:point(20, 250)], TRUE)\\n s.addListener(#mouseDown, _movie, #newGame, -1)\\n\\n m = $.sprite.newMember(#field, [#name:\\\"feedback\\\", #editable:FALSE, #fontstyle:\\\"bold\\\", #alignment:\\\"center\\\",\\\\\\n #border:0, #color:rgb(255, 0, 0), #rect:rect(0, 0, 180, 0)])\\n s = $.sprite.make(m, [#loc:point(20, 280)], TRUE)\\n\\n newGame(1)\\n\\n -- show the application window\\n _movie.updateStage()\\n _movie.stage.visible = TRUE\\nend\\n\\n----------------------------------------\\n-- Starts a new game\\n----------------------------------------\\non newGame (whoStarts)\\n -- reset board\\n gBoard.copyPixels(gBoardTemplate, gBoardTemplate.rect, gBoardTemplate.rect)\\n -- clear feedback\\n member(\\\"feedback\\\").text = \\\"\\\"\\n -- reset states\\n gM = [[0, 0, 0], [0, 0, 0], [0, 0, 0]]\\n gStep = 0\\n gGameOverFlag = FALSE\\n if whoStarts=-1 then computerMove()\\nend\\n\\n----------------------------------------\\n-- Handles a human move (mouse click)\\n----------------------------------------\\non humanMove ()\\n if gGameOverFlag then return\\n -- find cell for mouse position\\n p = _mouse.clickLoc - sprite(1).loc\\n if p.locH mod 60<4 or p.locV mod 60<4 then return\\n p = p / 60\\n x = p[1] + 1\\n y = p[2] + 1\\n if gM[x][y] then return -- ignore illegal moves\\n gM[x][y] = 1\\n -- update cell image\\n p = p * 60\\n gBoard.copyPixels(gHumanChip, gHumanChip.rect.offset(4+p[1], 4+p[2]), gHumanChip.rect)\\n -- proceed (unless game over)\\n gStep = gStep + 1\\n if not checkHumanMove(x, y) then computerMove()\\nend\\n\\n----------------------------------------\\n-- Checks if human has won or game ended with draw\\n----------------------------------------\\non checkHumanMove (x, y)\\n if sum([gM[x][1], gM[x][2], gM[x][3]])=3 then return gameOver(1, [[x, 1], [x, 2], [x, 3]])\\n if sum([gM[1][y], gM[2][y], gM[3][y]])=3 then return gameOver(1, [[1, y], [2, y], [3, y]])\\n if x=y and sum([gM[1][1], gM[2][2], gM[3][3]])=3 then return gameOver(1, [[1, 1], [2, 2], [3, 3]])\\n if x+y=4 and sum([gM[1][3], gM[2][2], gM[3][1]])=3 then return gameOver(1, [[1, 3], [2, 2], [3, 1]])\\n if gStep=9 then return gameOver(0)\\n return FALSE\\nend\\n\\n----------------------------------------\\n-- Checks if selecting specified empty cell makes computer or human win\\n----------------------------------------\\non checkCellWins (x, y, who)\\n wins = who*2\\n if sum([gM[1][y], gM[2][y], gM[3][y]]) = wins then return [[1, y], [2, y], [3, y]]\\n if sum([gM[x][1], gM[x][2], gM[x][3]]) = wins then return [[x, 1], [x, 2], [x, 3]]\\n if x=y and sum([gM[1][1], gM[2][2], gM[3][3]]) = wins then return [[1, 1], [2, 2], [3, 3]]\\n if x+y=4 and sum([gM[1][3], gM[2][2], gM[3][1]]) = wins then return [[1, 3], [2, 2], [3, 1]]\\n return FALSE\\nend\\n\\n----------------------------------------\\n-- Handles game over\\n----------------------------------------\\non gameOver (winner, cells)\\n gGameOverFlag = TRUE\\n if winner = 0 then\\n member(\\\"feedback\\\").text = \\\"It's a draw!\\\"\\n else\\n -- hilite winning line with yellow\\n img = image(56, 56, 32)\\n img.fill(img.rect, rgb(255, 255, 0))\\n repeat with c in cells\\n x = (c[1]-1)*60 + 4\\n y = (c[2]-1)*60 + 4\\n gBoard.copyPixels(img, img.rect.offset(x, y), img.rect, [#ink:#darkest])\\n end repeat\\n member(\\\"feedback\\\").text = [\\\"Human\\\", \\\"Computer\\\"][1+(winner=-1)] & \\\" has won!\\\"\\n end if\\n return TRUE\\nend\\n\\n----------------------------------------\\n-- Calculates next computer move\\n----------------------------------------\\non computerMove ()\\n gStep = gStep + 1\\n\\n -- move 1: select center\\n if gStep=1 then return doComputerMove(2, 2)\\n\\n -- move 2 (human started)\\n if gStep=2 then\\n if gM[2][2]=1 then\\n -- if center, select arbitrary corner\\n return doComputerMove(1, 1)\\n else\\n -- otherwise select center\\n return doComputerMove(2, 2)\\n end if\\n end if\\n\\n -- move 3 (computer started)\\n if gStep=3 then\\n -- if corner, select diagonally opposite corner\\n if gM[1][1]=1 then return doComputerMove(3, 3)\\n if gM[3][3]=1 then return doComputerMove(1, 1)\\n if gM[1][3]=1 then return doComputerMove(3, 1)\\n return doComputerMove(1, 1) -- top left corner as default\\n end if\\n\\n -- get free cells\\n free = []\\n repeat with x = 1 to 3\\n repeat with y = 1 to 3\\n if gM[x][y]=0 then free.add([x, y])\\n end repeat\\n end repeat\\n\\n -- check if computer can win now\\n repeat with c in free\\n res = checkCellWins(c[1], c[2], -1)\\n if res<>FALSE then\\n doComputerMove(c[1], c[2])\\n return gameOver(-1, res)\\n end if\\n end repeat\\n\\n -- check if human could win with next move (if yes, prevent it)\\n repeat with c in free\\n res = checkCellWins(c[1], c[2], 1)\\n if res<>FALSE then return doComputerMove(c[1], c[2], TRUE)\\n end repeat\\n\\n -- move 4 (human started): prevent \\\"double mills\\\"\\n if gStep=4 then\\n if gM[2][2]=1 and (gM[1][1]=1 or gM[3][3]=1) then return doComputerMove(3, 1)\\n if gM[2][2]=1 and (gM[1][3]=1 or gM[3][1]=1) then return doComputerMove(1, 1)\\n if gM[2][3]+gM[3][2]=2 then return doComputerMove(3, 3)\\n if gM[1][2]+gM[2][3]=2 then return doComputerMove(1, 3)\\n if gM[1][2]+gM[2][1]=2 then return doComputerMove(1, 1)\\n if gM[2][1]+gM[3][2]=2 then return doComputerMove(3, 1)\\n if (gM[1][3]+gM[3][1]=2) or (gM[1][1]+gM[3][3]=2) then return doComputerMove(2, 1)\\n end if\\n\\n -- move 5 (computer started): try to create a \\\"double mill\\\"\\n if gStep=5 then\\n repeat with x = 1 to 3\\n col = [gM[x][1], gM[x][2], gM[x][3]]\\n if not (sum(col)=-1 and max(col)=0) then next repeat\\n repeat with y = 1 to 3\\n row = [gM[1][y], gM[2][y], gM[3][y]]\\n if not (sum(row)=-1 and max(row)=0 and gM[x][y]=0) then next repeat\\n return doComputerMove(x, y)\\n end repeat\\n end repeat\\n end if\\n\\n -- otherwise use first free cell\\n c = free[1]\\n doComputerMove(c[1], c[2])\\nend\\n\\n----------------------------------------\\n-- Updates state matrix and cell image\\n----------------------------------------\\non doComputerMove (x, y, checkDraw)\\n gM[x][y] = -1\\n gBoard.copyPixels(gComputerChip, gComputerChip.rect.offset(4+(x-1)*60, 4+(y-1)*60), gComputerChip.rect)\\n if checkDraw and gStep=9 then gameOver(0)\\nend\\n\\n----------------------------------------\\n--\\n----------------------------------------\\non sum (aLine)\\n return aLine[1]+aLine[2]+aLine[3]\\nend\\n\",\n \"language\": \"Lingo\"\n },\n {\n \"code\": \"#!/usr/bin/env luajit\\nffi=require\\\"ffi\\\"\\nlocal function printf(fmt,...) io.write(string.format(fmt, ...)) end\\nlocal board=\\\"123456789\\\" -- board\\nlocal pval={1, -1} -- player 1=1 2=-1 for negamax\\nlocal pnum={} for k,v in ipairs(pval) do pnum[v]=k end\\nlocal symbol={'X','O'} -- default symbols X and O\\nlocal isymbol={} for k,v in pairs(symbol) do isymbol[v]=pval[k] end\\nmath.randomseed(os.time()^5*os.clock()) -- time-seed the random gen\\nlocal random=math.random\\n-- usage of ffi variables give 20% speed\\nffi.cdef[[\\n\\ttypedef struct{\\n\\t\\tchar value;\\n\\t\\tchar flag;\\n\\t\\tint depth;\\n\\t}cData;\\n]]\\n-- draw the \\\"board\\\" in the way the numpad is organized\\nlocal function draw(board)\\n\\tfor i=7,1,-3 do\\n\\t\\tprint(board:sub(i,i+2))\\n\\tend\\nend\\n-- pattern for win situations\\nlocal check={\\\"(.)...%1...%1\\\",\\\"..(.).%1.%1..\\\",\\n\\t\\\"(.)%1%1......\\\",\\\"...(.)%1%1...\\\",\\\"......(.)%1%1\\\",\\n\\t\\\"(.)..%1..%1..\\\",\\\".(.)..%1..%1.\\\",\\\"..(.)..%1..%1\\\",\\n}\\n-- calculate a win situation for which player or draw\\nlocal function win(b)\\n\\tlocal sub\\n\\tfor i=1,#check do\\n\\t\\tsub=b:match(check[i])\\n\\t\\tif sub then break end\\n\\tend\\n\\tsub=isymbol[sub]\\n\\treturn sub or 0\\nend\\n-- input only validate moves of not yet filled positions\\nlocal function input(b,player)\\n\\tchar=symbol[pnum[player]]\\n\\tlocal inp\\n\\trepeat\\n\\t\\tprintf(\\\"Player %d (\\\\\\\"%s\\\\\\\") move: \\\",pnum[player],char)\\n\\t\\tinp=tonumber(io.read()) or 0\\n\\tuntil inp>=1 and inp<=9 and b:find(inp)\\n\\tb=b:gsub(inp,char)\\n\\treturn b,inp\\nend\\n-- ask how many human or AI players\\nlocal function playerselect()\\n\\tlocal ai={}\\n\\tlocal yn\\n\\tfor i=1,2 do\\n\\t\\trepeat\\n\\t\\t\\tprintf(\\\"Player %d human (Y/n)? \\\", i) yn=io.read():lower()\\n\\t\\tuntil yn:match(\\\"[yn]\\\") or yn==''\\n\\t\\tif yn=='n' then\\n\\t\\t\\tai[pval[i]]=true\\n\\t\\t\\tprintf(\\\"Player %d is AI\\\\n\\\", i)\\n\\t\\telse\\n\\t\\t\\tprintf(\\\"Player %d is human\\\\n\\\", i)\\n\\t\\tend\\n\\tend\\n\\treturn ai\\nend\\nlocal function endgame()\\n\\trepeat\\n\\t\\tprintf(\\\"\\\\nEnd game? (y/n)? \\\", i) yn=io.read():lower()\\n\\tuntil yn:match(\\\"[yn]\\\")\\n\\tif yn=='n' then\\n\\t\\treturn false\\n\\telse\\n\\t\\tprintf(\\\"\\\\nGOOD BYE PROFESSOR FALKEN.\\\\n\\\\nA STRANGE GAME.\\\\nTHE ONLY WINNING MOVE IS\\\\nNOT TO PLAY.\\\\n\\\\nHOW ABOUT A NICE GAME OF CHESS?\\\\n\\\")\\n\\t\\treturn true\\n\\tend\\nend\\n-- AI Routine\\nlocal function shuffle(t)\\n\\tfor i=#t,1,-1 do\\n\\t\\tlocal rnd=random(i)\\n\\t\\tt[i], t[rnd] = t[rnd], t[i]\\n\\tend\\n\\treturn t\\nend\\n-- move generator\\nlocal function genmove(node, color)\\n\\treturn coroutine.wrap(function()\\n\\t\\tlocal moves={}\\n\\t\\tfor m in node:gmatch(\\\"%d\\\") do\\n\\t\\t\\tmoves[#moves+1]=m\\n\\t\\tend\\n\\t\\tshuffle(moves) -- to make it more interesting\\n\\t\\tfor _,m in ipairs(moves) do\\n\\t\\t\\tlocal child=node:gsub(m,symbol[pnum[color]])\\n\\t\\t\\tcoroutine.yield(child, m)\\n\\t\\tend\\n\\tend)\\nend\\n--[[\\nNegamax with alpha-beta pruning and table caching\\n]]\\nlocal cache={}\\nlocal best, aimove, tDepth\\nlocal LOWERB,EXACT,UPPERB=-1,0,1 -- has somebody an idea how to make them real constants?\\nlocal function negamax(node, depth, color, α, β)\\n\\tcolor=color or 1\\n\\tα=α or -math.huge\\n\\tβ=β or math.huge\\n\\t-- check for cached node\\n\\tlocal αOrg=α\\n\\tlocal cData=cache[node]\\n\\tif cData and cData.depth>=depth and depth~=tDepth then\\n\\t\\tif cData.flag==EXACT then\\n\\t\\t\\treturn cData.value\\n\\t\\telseif cData.flag==LOWERB then\\n\\t\\t\\tα=math.max(α,cData.value)\\n\\t\\telseif cData.flag==UPPERB then\\n\\t\\t\\tβ=math.min(β,cData.value)\\n\\t\\tend\\n\\t\\tif α>=β then\\n\\t\\t\\treturn cData.value\\n\\t\\tend\\n\\tend\\n\\n\\tlocal winner=win(node)\\n\\tif depth==0 or winner~=0 then\\n\\t\\treturn winner*color\\n\\tend\\n\\tlocal value=-math.huge\\n\\tfor child,move in genmove(node, color) do\\n\\t\\tvalue=math.max(value, -negamax(child, depth-1, -color, -β, -α))\\n\\t\\tif value>α then\\n\\t\\t\\tα=value\\n\\t\\t\\tif depth==tDepth then\\n\\t\\t\\t\\tbest=child\\n\\t\\t\\t\\taimove=move\\n\\t\\t\\tend\\n\\t\\tend\\n\\t\\tif α>=β then break end\\n\\tend\\n\\t-- cache known data\\n\\t--cData={} -- if you want Lua tables instead of ffi you can switch the two lines here, costs 20% speed\\n\\tcData=ffi.new(\\\"cData\\\")\\n\\tcData.value=value\\n\\tif value<=αOrg then\\n\\t\\tcData.flag=UPPERB\\n\\telseif value>=β then\\n\\t\\tcData.flag=LOWERB\\n\\telse\\n\\t\\tcData.flag=EXACT\\n\\tend\\n\\tcData.depth=depth\\n\\tcache[node]=cData\\n\\treturn α\\nend\\n-- MAIN\\ndo\\n\\tlocal winner,value\\n\\tlocal score={[-1]=0, [0]=0, [1]=0}\\n\\trepeat\\n\\t\\tprint(\\\"\\\\n TIC-TAC-TOE\\\\n\\\")\\n\\t\\tlocal aiplayer=playerselect()\\n\\t\\tlocal player=1\\n\\t\\tboard=\\\"123456789\\\"\\n\\t\\tfor i=1,#board do\\n\\t\\t\\tdraw(board)\\n\\t\\t\\ttDepth=10-i\\n\\t\\t\\tif aiplayer[player] then\\n\\t\\t\\t\\tnegamax(board, tDepth, player, -math.huge, math.huge)\\n\\t\\t\\t\\tboard=best\\n\\t\\t\\t\\tprintf(\\\"AI %d moves %s\\\\n\\\", pnum[player], aimove)\\n\\t\\t\\telse\\n\\t\\t\\t\\tboard=input(board,player)\\n\\t\\t\\tend\\n\\t\\t\\twinner=win(board)\\n\\t\\t\\tif winner~=0 then break end\\n\\t\\t\\tplayer=-player\\n\\t\\tend\\n\\t\\tscore[winner]=score[winner]+1\\n\\t\\tif winner and winner~=0 then\\n\\t\\t\\tprintf(\\\"*** Player %d (%s) has won\\\\n\\\", pnum[winner], symbol[pnum[winner]])\\n\\t\\telse\\n\\t\\t\\tprintf(\\\"*** No winner\\\\n\\\")\\n\\t\\tend\\n\\t\\tprintf(\\\"Score Player 1: %d Player 2: %d Draw: %d\\\\n\\\",score[1],score[-1],score[0])\\n\\t\\tdraw(board)\\n\\tuntil endgame()\\nend\\n\",\n \"language\": \"Lua\"\n },\n {\n \"code\": \"Module Tic.Tac.Toe {\\n Dim Board$(1 to 3, 1 to 3)=\\\" \\\"\\n WinGame=False\\n p=Board$()\\n RandomPosition=lambda -> {\\n =(random(1,3), random(1,3))\\n }\\n\\n BoardItemEmpty=Lambda p (x, y) -> {\\n =Array$(p, x, y)=\\\" \\\"\\n }\\n BoardSetItem=Lambda p (x, y, w$) -> {\\n link p to a$()\\n a$(x, y)=w$\\n }\\n T=9\\n R=0\\n C=0\\n Repeat {\\n Print \\\"Computer Move:\\\"\\n CompMove()\\n T--\\n DrawBoard()\\n CheckWin()\\n if WinGame Then Print \\\"Computer Win\\\": Exit\\n if T=0 then exit\\n Repeat {\\n GetRowCol(\\\"Input Row\\\", &R)\\n GetRowCol(\\\"Input Column\\\", &C)\\n If BoardItemEmpty(R,C) then call boardsetitem(R,C,\\\"O\\\") : exit\\n } Always\\n T--\\n DrawBoard()\\n CheckWin()\\n if WinGame Then Print \\\"You Win\\\": Exit\\n } until T=0 or WinGame\\n Sub DrawBoard()\\n Print \\\"R/C 1 2 3\\\"\\n Print \\\" 1) \\\"; Board$(1,1);\\\"|\\\";Board$(1,2);\\\"|\\\";Board$(1,3)\\n Print \\\" -+-+-\\\"\\n Print \\\" 2) \\\"; Board$(2,1);\\\"|\\\";Board$(2,2);\\\"|\\\";Board$(2,3)\\n Print \\\" -+-+-\\\"\\n Print \\\" 3) \\\"; Board$(3,1);\\\"|\\\";Board$(3,2);\\\"|\\\";Board$(3,3)\\n End Sub\\n Sub CheckWin()\\n WinGame=false\\n local i,j,three$\\n For i=1 to 3\\n three$=\\\"\\\"\\n For j=1 to 3 : three$+=Board$(i,j) : Next j\\n CheckThree()\\n three$=\\\"\\\"\\n For j=1 to 3 : three$+=Board$(j,i) :Next j\\n CheckThree()\\n Next i\\n three$=\\\"\\\"\\n For i=1 to 3 : three$+=Board$(i,i): Next i\\n CheckThree()\\n three$=\\\"\\\"\\n For i=1 to 3:three$+=Board$(i,4-i): Next i\\n CheckThree()\\n End Sub\\n Sub CheckThree()\\n if instr(three$,\\\" \\\")=0 then WinGame=WinGame or Filter$(three$, left$(three$,1))=\\\"\\\"\\n End Sub\\n Sub CompMove()\\n if T<9 and Board$(2,2)=\\\" \\\" then {\\n call boardsetitem(2,2,\\\"X\\\")\\n } Else {\\n local i=3, j=3, found=false\\n if T<=6 then {\\n CompThink(\\\"X\\\",\\\"X\\\")\\n }\\n let i=3, j=3\\n If Not found And T<6 then {\\n CompThink(\\\"O\\\",\\\"X\\\")\\n }\\n If not found then {\\n Repeat {\\n comp=RandomPosition()\\n If BoardItemEmpty(!comp) then call boardsetitem(!comp, \\\"X\\\") : exit\\n } Always\\n }\\n }\\n End Sub\\n Sub CompThink(Bad$, Good$)\\n While i>0 {\\n j=3\\n While j>0 {\\n if Board$(i,j)=\\\" \\\" then {\\n Board$(i,j)=Bad$\\n CheckWin()\\n if WinGame then {\\n Board$(i,j)=Good$:i=0:j=0: found=true\\n } Else Board$(i,j)=\\\" \\\"\\n }\\n j--\\n }\\n i--\\n }\\n\\n End Sub\\n Sub GetRowCol(What$, &W)\\n Print What$;\\\":\\\";\\n Repeat {\\n W=Val(\\\"0\\\"+Key$)\\n } until W>=1 and W<=3\\n Print Str$(W,\\\"\\\")\\n End Sub\\n}\\nTic.Tac.Toe\\n\",\n \"language\": \"M2000-Interpreter\"\n },\n {\n \"code\": \"DynamicModule[{board = ConstantArray[0, {3, 3}], text = \\\"Playing...\\\",\\n first, rows =\\n Join[#, Transpose@#, {Diagonal@#, Diagonal@Reverse@#}] &},\\n Column@{Graphics[{Thickness[.02],\\n Table[With[{i = i, j = j},\\n Button[{White, Rectangle[{i, j} - 1, {i, j}], Black,\\n Dynamic[Switch[board[[i, j]], 0, Black, 1,\\n Circle[{i, j} - .5, .3], -1,\\n Line[{{{i, j} - .2, {i, j} - .8}, {{i - .2,\\n j - .8}, {i - .8, j - .2}}}]]]},\\n Which[text != \\\"Playing...\\\", board = ConstantArray[0, {3, 3}];\\n text = \\\"Playing...\\\", board[[i, j]] == 0,\\n If[board == ConstantArray[0, {3, 3}],\\n first = {i,\\n j} /. {{2, 2} -> 1, {1 | 3, 1 | 3} -> 2, _ -> 3}];\\n board[[i, j]] = 1;\\n FinishDynamic[];\\n Which[MemberQ[rows[board], {1, 1, 1}], text = \\\"You win.\\\",\\n FreeQ[board, 0], text = \\\"Draw.\\\", True,\\n board[[Sequence @@\\n SortBy[Select[Tuples[{Range@3, Range@3}],\\n board[[Sequence @@ #]] ==\\n 0 &], -Total[\\n Sort /@\\n rows[ReplacePart[\\n board, # -> -1]] /. {{-1, -1, -1} ->\\n 512, {-1, 1, 1} -> 64, {-1, -1, 0} ->\\n 8, {0, 1, 1} -> -1, {_, _, _} -> 0}] -\\n Switch[#, {2, 2}, 1, {1 | 3, 1 | 3},\\n If[first == 2, -1, 0], _,\\n If[first == 2, 0, -1]] &][[1]]]] = -1;\\n Which[MemberQ[rows[board], {-1, -1, -1}],\\n text = \\\"You lost.\\\", FreeQ[board, 0],\\n text = \\\"Draw.\\\"]]]]], {i, 1, 3}, {j, 1, 3}], Thickness[.01],\\n Line[{{{1, 0}, {1, 3}}, {{2, 0}, {2, 3}}, {{0, 1}, {3, 1}}, {{0,\\n 2}, {3, 2}}}]}], Dynamic@text}]\\n\",\n \"language\": \"Mathematica\"\n },\n {\n \"code\": \"function TicTacToe\\n\\n % Set up the board (one for each player)\\n boards = false(3, 3, 2); % Players' pieces\\n rep = [' 1 | 4 | 7' ; ' 2 | 5 | 8' ; ' 3 | 6 | 9'];\\n\\n % Prompt user with options\\n fprintf('Welcome to Tic-Tac-Toe!\\\\n')\\n nHumans = str2double(input('Enter the number of human players: ', 's'));\\n if isnan(nHumans) || ceil(nHumans) ~= nHumans || nHumans < 1 || nHumans > 2\\n nHumans = 0;\\n pHuman = false(2, 1);\\n elseif nHumans == 1\\n humanFirst = input('Would the human like to go first (Y/N)? ', 's');\\n if length(humanFirst) == 1 && lower(humanFirst) == 'n'\\n pHuman = [false ; true];\\n else\\n pHuman = [true ; false];\\n end\\n else\\n pHuman = true(2, 1);\\n end\\n if any('o' == input('Should Player 1 use X or O? ', 's'))\\n marks = 'OX';\\n else\\n marks = 'XO';\\n end\\n fprintf('So Player 1 is %shuman and %cs and Player 2 is %shuman and %cs.\\\\n', ...\\n char('not '.*~pHuman(1)), marks(1), char('not '.*~pHuman(2)), marks(2))\\n if nHumans > 0\\n fprintf('Select the space to mark by entering the space number.\\\\n')\\n fprintf('No entry will quit the game.\\\\n')\\n end\\n\\n % Play game\\n gameOver = false;\\n turn = 1;\\n while ~gameOver\\n fprintf('\\\\n')\\n disp(rep)\\n fprintf('\\\\n')\\n if pHuman(turn)\\n [move, isValid, isQuit] = GetMoveFromPlayer(turn, boards);\\n gameOver = isQuit;\\n else\\n move = GetMoveFromComputer(turn, boards);\\n fprintf('Player %d chooses %d\\\\n', turn, move)\\n isValid = true;\\n isQuit = false;\\n end\\n if isValid && ~isQuit\\n [r, c] = ind2sub([3 3], move);\\n boards(r, c, turn) = true;\\n rep(r, 4*c) = marks(turn);\\n if CheckWin(boards(:, :, turn))\\n gameOver = true;\\n fprintf('\\\\n')\\n disp(rep)\\n fprintf('\\\\nPlayer %d wins!\\\\n', turn)\\n elseif CheckDraw(boards)\\n gameOver = true;\\n fprintf('\\\\n')\\n disp(rep)\\n fprintf('\\\\nCat''s game!\\\\n')\\n end\\n turn = ~(turn-1)+1;\\n end\\n end\\nend\\n\\nfunction [move, isValid, isQuit] = GetMoveFromPlayer(pNum, boards)\\n% move - 1-9 indicating move position, 0 if invalid move\\n% isValid - logical indicating if move was valid, true if quitting\\n% isQuit - logical indicating if player wishes to quit game\\n p1 = boards(:, :, 1);\\n p2 = boards(:, :, 2);\\n moveStr = input(sprintf('Player %d: ', pNum), 's');\\n if isempty(moveStr)\\n fprintf('Play again soon!\\\\n')\\n move = 0;\\n isValid = true;\\n isQuit = true;\\n else\\n move = str2double(moveStr);\\n isQuit = false;\\n if isnan(move) || move < 1 || move > 9 || p1(move) || p2(move)\\n fprintf('%s is an invalid move.\\\\n', moveStr)\\n isQuit = 0;\\n isValid = false;\\n else\\n isValid = true;\\n end\\n end\\nend\\n\\nfunction move = GetMoveFromComputer(pNum, boards)\\n% pNum - 1-2 player number\\n% boards - 3x3x2 logical array where pBoards(:,:,1) is player 1's marks\\n% Assumes that it is possible to make a move\\n if ~any(boards(:)) % Play in the corner for first move\\n move = 1;\\n else % Use Newell and Simon's \\\"rules to win\\\"\\n pMe = boards(:, :, pNum);\\n pThem = boards(:, :, ~(pNum-1)+1);\\n possMoves = find(~(pMe | pThem)).';\\n\\n % Look for a winning move\\n move = FindWin(pMe, possMoves);\\n if move\\n return\\n end\\n\\n % Look to block opponent from winning\\n move = FindWin(pThem, possMoves);\\n if move\\n return\\n end\\n\\n % Look to create a fork (two non-blocked lines of two)\\n for m = possMoves\\n newPMe = pMe;\\n newPMe(m) = true;\\n if CheckFork(newPMe, pThem)\\n move = m;\\n return\\n end\\n end\\n\\n % Look to make two in a row so long as it doesn't force opponent to fork\\n notGoodMoves = false(size(possMoves));\\n for m = possMoves\\n newPMe = pMe;\\n newPMe(m) = true;\\n if CheckPair(newPMe, pThem)\\n nextPossMoves = possMoves;\\n nextPossMoves(nextPossMoves == m) = [];\\n theirMove = FindWin(newPMe, nextPossMoves);\\n newPThem = pThem;\\n newPThem(theirMove) = true;\\n if ~CheckFork(newPThem, newPMe)\\n move = m;\\n return\\n else\\n notGoodMoves(possMoves == m) = true;\\n end\\n end\\n end\\n possMoves(notGoodMoves) = [];\\n\\n % Play the center if available\\n if any(possMoves == 5)\\n move = 5;\\n \\treturn\\n end\\n\\n % Play the opposite corner of the opponent's piece if available\\n corners = [1 3 7 9];\\n move = intersect(possMoves, ...\\n corners(~(pMe(corners) | pThem(corners)) & pThem(fliplr(corners))));\\n if ~isempty(move)\\n move = move(1);\\n return\\n end\\n\\n % Play an empty corner if available\\n move = intersect(possMoves, corners);\\n if move\\n move = move(1);\\n return\\n end\\n\\n % Play an empty side if available\\n sides = [2 4 6 8];\\n move = intersect(possMoves, sides);\\n if move\\n move = move(1);\\n return\\n end\\n\\n % No good moves, so move randomly\\n possMoves = find(~(pMe | pThem));\\n move = possMoves(randi(length(possMoves)));\\n end\\nend\\n\\nfunction move = FindWin(board, possMoves)\\n% board - 3x3 logical representing one player's pieces\\n% move - integer indicating position to move to win, or 0 if no winning move\\n for m = possMoves\\n newPMe = board;\\n newPMe(m) = true;\\n if CheckWin(newPMe)\\n move = m;\\n return\\n end\\n end\\n move = 0;\\nend\\n\\nfunction win = CheckWin(board)\\n% board - 3x3 logical representing one player's pieces\\n% win - logical indicating if that player has a winning board\\n win = any(all(board)) || any(all(board, 2)) || ...\\n all(diag(board)) || all(diag(fliplr(board)));\\nend\\n\\nfunction fork = CheckFork(p1, p2)\\n% fork - logical indicating if player 1 has created a fork unblocked by player 2\\n fork = sum([sum(p1)-sum(p2) (sum(p1, 2)-sum(p2, 2)).' ...\\n sum(diag(p1))-sum(diag(p2)) ...\\n sum(diag(fliplr(p1)))-sum(diag(fliplr(p2)))] == 2) > 1;\\nend\\n\\nfunction pair = CheckPair(p1, p2)\\n% pair - logical indicating if player 1 has two in a line unblocked by player 2\\n pair = any([sum(p1)-sum(p2) (sum(p1, 2)-sum(p2, 2)).' ...\\n sum(diag(p1))-sum(diag(p2)) ...\\n sum(diag(fliplr(p1)))-sum(diag(fliplr(p2)))] == 2);\\nend\\n\\nfunction draw = CheckDraw(boards)\\n% boards - 3x3x2 logical representation of all players' pieces\\n draw = all(all(boards(:, :, 1) | boards(:, :, 2)));\\nend\\n\",\n \"language\": \"MATLAB\"\n },\n {\n \"code\": \"place1 = 1\\nplace2 = 2\\nplace3 = 3\\nplace4 = 4\\nplace5 = 5\\nplace6 = 6\\nplace7 = 7\\nplace8 = 8\\nplace9 = 9\\nsymbol1 = \\\"X\\\"\\nsymbol2 = \\\"O\\\"\\nreset:\\nTextWindow.Clear()\\nTextWindow.Write(place1 + \\\" \\\")\\nTextWindow.Write(place2 + \\\" \\\")\\nTextWindow.WriteLine(place3 + \\\" \\\")\\nTextWindow.Write(place4 + \\\" \\\")\\nTextWindow.Write(place5 + \\\" \\\")\\nTextWindow.WriteLine(place6 + \\\" \\\")\\nTextWindow.Write(place7 + \\\" \\\")\\nTextWindow.Write(place8 + \\\" \\\")\\nTextWindow.WriteLine(place9 + \\\" \\\")\\nTextWindow.WriteLine(\\\"Where would you like to go to (choose a number from 1 to 9 and press enter)?\\\")\\nn = TextWindow.Read()\\nIf n = 1 then\\n If place1 = symbol1 or place1 = symbol2 then\\n Goto ai\\n Else\\n place1 = symbol1\\n EndIf\\nElseIf n = 2 then\\n If place2 = symbol1 or place2 = symbol2 then\\n Goto ai\\n Else\\n place2 = symbol1\\n EndIf\\nElseIf n = 3 then\\n If place3 = symbol1 or place3 = symbol2 then\\n Goto ai\\n Else\\n place3 = symbol1\\n EndIf\\nElseIf n = 4 then\\n If place4 = symbol1 or place4 = symbol2 then\\n Goto ai\\n Else\\n place4 = symbol1\\n EndIf\\nElseIf n = 5 then\\n If place5 = symbol1 or place5 = symbol2 then\\n Goto ai\\n Else\\n place5 = symbol1\\n EndIf\\nElseIf n = 6 then\\n If place6 = symbol1 or place6 = symbol2 then\\n Goto ai\\n Else\\n place6 = symbol1\\n EndIf\\nElseIf n = 7 then\\n If place8 = symbol1 or place7 = symbol2 then\\n Goto ai\\n Else\\n place7 = symbol1\\n EndIf\\nElseIf n = 8 then\\n If place8 = symbol1 or place8 = symbol2 then\\n Goto ai\\n Else\\n place8 = symbol1\\n EndIf\\nElseIf n = 9 then\\n If place9 = symbol1 or place9 = symbol2 then\\n Goto ai\\n Else\\n place9 = symbol1\\n EndIf\\nEndIf\\nGoto ai\\nai:\\nn = Math.GetRandomNumber(9)\\nIf n = 1 then\\n If place1 = symbol1 or place1 = symbol2 then\\n Goto ai\\n Else\\n place1 = symbol2\\n EndIf\\nElseIf n = 2 then\\n If place2 = symbol1 or place2 = symbol2 then\\n Goto ai\\n Else\\n place2 = symbol2\\n EndIf\\nElseIf n = 3 then\\n If place3 = symbol1 or place3 = symbol2 then\\n Goto ai\\n Else\\n place3 = symbol2\\n EndIf\\nElseIf n = 4 then\\n If place4 = symbol1 or place4 = symbol2 then\\n Goto ai\\n Else\\n place4 = symbol2\\n EndIf\\nElseIf n = 5 then\\n If place5 = symbol1 or place5 = symbol2 then\\n Goto ai\\n Else\\n place5 = symbol2\\n EndIf\\nElseIf n = 6 then\\n If place6 = symbol1 or place6 = symbol2 then\\n Goto ai\\n Else\\n place6 = symbol2\\n EndIf\\nElseIf n = 7 then\\n If place7 = symbol1 or place7 = symbol2 then\\n Goto ai\\n Else\\n place7 = symbol2\\n EndIf\\nElseIf n = 8 then\\n If place8 = symbol1 or place8 = symbol2 then\\n Goto ai\\n Else\\n place8 = symbol2\\n EndIf\\nElseIf n = 9 then\\n If place9 = symbol1 or place9 = symbol2 then\\n Goto ai\\n Else\\n place9 = symbol2\\n EndIf\\nEndIf\\nIf place1 = symbol1 and place2 = symbol1 and place3 = symbol1 or place4 = symbol1 and place5 = symbol1 and place6 = symbol1 or place7 = symbol1 and place8 = symbol1 and place9 = symbol1 or place1 = symbol1 and place4 = symbol1 and place7 = symbol1 or place2 = symbol1 and place5 = symbol1 and place8 = symbol1 or place3 = symbol1 and place6 = symbol1 and place9 = symbol1 or place1 = symbol1 and place5 = symbol1 and place9 = symbol1 or place3 = symbol1 and place5 = symbol1 and place7 = symbol1 then\\n TextWindow.WriteLine(\\\"Player 1 (\\\" + symbol1 + \\\") wins!\\\")\\nElseIf place1 = symbol2 and place2 = symbol2 and place3 = symbol2 or place4 = symbol2 and place5 = symbol2 and place6 = symbol2 or place7 = symbol2 and place8 = symbol2 and place9 = symbol2 or place1 = symbol2 and place4 = symbol2 and place7 = symbol2 or place2 = symbol2 and place5 = symbol2 and place8 = symbol2 or place3 = symbol2 and place6 = symbol2 and place9 = symbol2 or place1 = symbol2 and place5 = symbol2 and place8 = symbol2 or place3 = symbol2 and place5 = symbol2 and place7 = symbol2 then\\n TextWindow.WriteLine(\\\"Player 2 (\\\" + symbol2 + \\\") wins!\\\")\\nElse\\n Goto reset\\nEndIf\\n\",\n \"language\": \"Microsoft-Small-Basic\"\n },\n {\n \"code\": \"alias ttt {\\n if ($2 isin %ttt) || (!%ttt) {\\n var %ttt~ = $remove($iif(%ttt,%ttt,1 2 3 4 5 6 7 8 9),$2,X,O)\\n var %ttt~~ = $replace($iif(%ttt,%ttt,1 2 3 4 5 6 7 8 9),$2,X)\\n set %ttt $replace(%ttt~~,$iif(($regex(%ttt~~,/(?:O . . (?:(?:. O .|O) . . (\\\\d)|(?:. (\\\\d) .|(\\\\d)) . . O)|(\\\\d) . . (?:. O .|O) . . O|. . (?:O . (?:O . (\\\\d)|(\\\\d) . O)|(\\\\d) . O . O) . .)/)) || ($regex(%ttt~~,/^(?:. . . )*(?:O (?:O (\\\\d)|(\\\\d) O)|(\\\\d) O O)(?: . . .)*$/)),$regml(1),$iif(($regex(%ttt~~,/(?:X . . (?:(?:. X .|X) . . (\\\\d)|(?:. (\\\\d) .|(\\\\d)) . . X)|(\\\\d) . . (?:. X .|X) . . X|. . (?:X . (?:X . (\\\\d)|(\\\\d) . X)|(\\\\d) . X . X) . .)/)) || ($regex(%ttt~~,/^(?:. . . )*(?:X (?:X (\\\\d)|(\\\\d) X)|(\\\\d) X X)(?: . . .)*$/)),$regml(1),$iif($remove(%ttt~,2,4,6,8,$chr(32)),$iif((5 isin $remove(%ttt~,2,4,6,8)) && ($rand(0,$numtok($v2,32)) == 0),5,$gettok($remove(%ttt~,2,4,6,8),$rand(1,$numtok($remove(%ttt~,2,4,6,8),32)),32)),$gettok(%ttt~,$rand(1,$numtok(%ttt~,32)),32)))),O)\\n tokenize 32 %ttt\\n if ($regex(%ttt,/(?:X . . (?:X|. X .) . . X|. . X . X . X . .)/)) || ($regex(%ttt,/^(?:. . . )*X X X(?: . . .)*$/)) {\\n echo -ag $me Wins\\n tokenize 32 %ttt~~\\n unset %ttt\\n }\\n elseif ($regex(%ttt,/(?:O . . (?:O|. O .) . . O|. . O . O . O . .)/)) || ($regex(%ttt,/^(?:. . . )*O O O(?: . . .)*$/)) {\\n echo -ag $me Loses\\n unset %ttt\\n }\\n elseif (!$regex(%ttt,/\\\\d/)) {\\n echo -ag Draw\\n unset %ttt\\n }\\n echo -ag � $+ $iif($1 isnum,$chr(32),$1) $+ $chr(124) $+ $iif($2 isnum,$chr(32),$2) $+ $chr(124) $+ $iif($3 isnum, ,$3)\\n echo -ag � $+ $iif($4 isnum,$chr(32),$4) $+ $chr(124) $+ $iif($5 isnum,$chr(32),$5) $+ $chr(124) $+ $iif($6 isnum, ,$6)\\n echo -ag � $+ $iif($7 isnum,$chr(32),$7) $+ $chr(124) $+ $iif($8 isnum,$chr(32),$8) $+ $chr(124) $+ $iif($9 isnum, ,$9)\\n }\\n else {\\n echo -ag Place Taken\\n tokenize 32 %ttt\\n echo -ag � $+ $iif($1 isnum,$chr(32),$1) $+ $chr(124) $+ $iif($2 isnum,$chr(32),$2) $+ $chr(124) $+ $iif($3 isnum, ,$3)\\n echo -ag � $+ $iif($4 isnum,$chr(32),$4) $+ $chr(124) $+ $iif($5 isnum,$chr(32),$5) $+ $chr(124) $+ $iif($6 isnum, ,$6)\\n echo -ag � $+ $iif($7 isnum,$chr(32),$7) $+ $chr(124) $+ $iif($8 isnum,$chr(32),$8) $+ $chr(124) $+ $iif($9 isnum, ,$9)\\n }\\n}\\n\",\n \"language\": \"MIRC-Scripting-Language\"\n },\n {\n \"code\": \"import options, random, sequtils, strutils\\n\\ntype\\n Board = array[1..9, char]\\n Score = (char, array[3, int])\\n\\nconst NoChoice = 0\\n\\nvar board: Board = ['1', '2', '3', '4', '5', '6', '7', '8', '9']\\n\\nconst Wins = [[1, 2, 3], [4, 5, 6], [7, 8, 9],\\n [1, 4, 7], [2, 5, 8], [3, 6, 9],\\n [1, 5, 9], [3, 5, 7]]\\n\\ntemplate toIndex(ch: char): int =\\n ## Convert a character to an index in board.\\n ord(ch) - ord('0')\\n\\nproc print(board: Board) =\\n for i in [1, 4, 7]:\\n echo board[i..(i + 2)].join(\\\" \\\")\\n\\nproc score(board: Board): Option[Score] =\\n for w in Wins:\\n let b = board[w[0]]\\n if b in \\\"XO\\\" and w.allIt(board[it] == b):\\n return some (b, w)\\n result = none(Score)\\n\\nproc finished(board: Board): bool =\\n board.allIt(it in \\\"XO\\\")\\n\\nproc space(board: Board): seq[char] =\\n for b in board:\\n if b notin \\\"XO\\\":\\n result.add b\\n\\nproc myTurn(board: var Board; xo: char): char =\\n let options = board.space()\\n result = options.sample()\\n board[result.toIndex] = xo\\n\\nproc myBetterTurn(board: var Board; xo: char): int =\\n let ox = if xo == 'X': 'O' else: 'X'\\n var oneBlock = NoChoice\\n let options = board.space.mapIt(it.toIndex)\\n block search:\\n for choice in options:\\n var brd = board\\n brd[choice] = xo\\n if brd.score.isSome:\\n result = choice\\n break search\\n if oneBlock == NoChoice:\\n brd[choice] = ox\\n if brd.score.isSome:\\n oneBlock = choice\\n result = if oneBlock != NoChoice: oneBlock else: options.sample()\\n board[result] = xo\\n\\nproc yourTurn(board: var Board; xo: char): int =\\n let options = board.space()\\n var choice: char\\n while true:\\n stdout.write \\\"\\\\nPut your $# in any of these positions: $# \\\".format(xo, options.join())\\n let input = stdin.readLine().strip()\\n if input.len == 1 and input[0] in options:\\n choice = input[0]\\n break\\n echo \\\"Whoops I don't understand the input\\\"\\n result = choice.toIndex\\n board[result] = xo\\n\\nproc me(board: var Board; xo: char): Option[Score] =\\n board.print()\\n echo \\\"\\\\nI go at \\\", board.myBetterTurn(xo)\\n result = board.score()\\n\\nproc you(board: var Board; xo: char): Option[Score] =\\n board.print()\\n echo \\\"\\\\nYou went at \\\", board.yourTurn(xo)\\n result = board.score()\\n\\nproc play() =\\n while not board.finished():\\n let score = board.me('X')\\n if score.isSome:\\n board.print()\\n let (winner, line) = score.get()\\n echo \\\"\\\\n$# wins along ($#).\\\".format(winner, line.join(\\\", \\\"))\\n return\\n if not board.finished():\\n let score = board.you('O')\\n if score.isSome:\\n board.print()\\n let (winner, line) = score.get()\\n echo \\\"\\\\n$# wins along ($#).\\\".format(winner, line.join(\\\", \\\"))\\n return\\n echo \\\"\\\\nA draw.\\\"\\n\\necho \\\"Tic-tac-toe game player.\\\"\\necho \\\"Input the index of where you wish to place your mark at your turn.\\\"\\nrandomize()\\nplay()\\n\",\n \"language\": \"Nim\"\n },\n {\n \"code\": \"class TicTacToe {\\n @board : Char[,];\\n @cpu_opening : Bool;\\n\\n enum Status {\\n INVALID_MOVE,\\n PLAYING,\\n QUIT,\\n TIE,\\n CPU_WIN,\\n PLAYER_WIN\\n }\\n\\n consts Weights {\\n MIN := -1000,\\n MAX := 1000\\n }\\n\\n function : Main(args : String[]) ~ Nil {\\n cpu_score := 0;\\n player_score := 0;\\n\\n for(i :=0; i < 5; i += 1;) {\\n game := TicTacToe->New();\\n result := game->Play();\\n\\n if(result = Status->PLAYER_WIN) {\\n player_score += 1;\\n \\\"\\\\n=> Player Wins!\\\"->PrintLine();\\n }\\n else if(result = Status->CPU_WIN) {\\n cpu_score += 1;\\n \\\"\\\\n=> CPU Wins!\\\"->PrintLine();\\n }\\n else if(result = Status->TIE) {\\n \\\"\\\\n=> Tie.\\\"->PrintLine();\\n }\\n else {\\n break;\\n };\\n };\\n\\n \\\"\\\\nHuman={$player_score}, CPU={$cpu_score}\\\"->PrintLine();\\n }\\n\\n New() {\\n @board := Char->New[3, 3];\\n for(index := 0; index < 9; index += 1;) {\\n j := index / 3;\\n i := index % 3;\\n @board[i, j] := '1' + index;\\n };\\n\\n @cpu_opening := true;\\n }\\n\\n method : Play() ~ Status {\\n players_turn := Int->Random(1) = 1 ? true : false;\\n\\n if(players_turn) {\\n @cpu_opening := false;\\n \\\"\\\\n*** NEW (Player) ***\\\\n\\\"->PrintLine();\\n Draw();\\n }\\n else {\\n \\\"\\\\n*** NEW (CPU) ***\\\\n\\\"->PrintLine();\\n };\\n\\n playing := true;\\n do {\\n status : Status;\\n\\n if(players_turn) {\\n status := PlayerMove();\\n players_turn := false;\\n }\\n else {\\n status := CpuMove();\\n players_turn := true;\\n };\\n\\n if(players_turn) {\\n Draw();\\n };\\n\\n select(status) {\\n label Status->INVALID_MOVE: {\\n \\\"\\\\n=> Invalid Move\\\"->PrintLine();\\n }\\n\\n label Status->PLAYER_WIN: {\\n return Status->PLAYER_WIN;\\n }\\n\\n label Status->CPU_WIN: {\\n return Status->CPU_WIN;\\n }\\n\\n label Status->TIE: {\\n return Status->TIE;\\n }\\n\\n label Status->QUIT: {\\n playing := false;\\n }\\n };\\n }\\n while(playing);\\n\\n return Status->QUIT;\\n }\\n\\n method : PlayerMove() ~ Status {\\n move := System.IO.Console->ReadString();\\n if(move->Size() = 0) {\\n return Status->INVALID_MOVE;\\n };\\n\\n option := move->Get(0);\\n if(option = 'q') {\\n return Status->QUIT;\\n };\\n\\n if(LegalMove(option, 'X')) {\\n if(IsWinner(@board, 'X')) {\\n return Status->PLAYER_WIN;\\n }\\n else if(IsTied()) {\\n return Status->TIE;\\n }\\n else {\\n return Status->PLAYING;\\n };\\n }\\n else {\\n return Status->INVALID_MOVE;\\n };\\n }\\n\\n method : CpuMove() ~ Status {\\n if(@cpu_opening) {\\n select(Int->Random(2)) {\\n label 0: {\\n @board[0, 0] := 'O';\\n }\\n\\n label 1: {\\n @board[1, 1] := 'O';\\n }\\n\\n label 2: {\\n @board[2, 2] := 'O';\\n }\\n };\\n @cpu_opening := false;\\n }\\n else {\\n BestCpuMove(CopyBoard());\\n };\\n\\n if(IsWinner(@board, 'O')) {\\n return Status->CPU_WIN;\\n }\\n else if(IsTied()) {\\n return Status->TIE;\\n }\\n else {\\n return Status->PLAYING;\\n };\\n }\\n\\n method : Minimax(board : Char[,], depth : Int, is_max : Bool, alpha : Int, beta : Int) ~ Int {\\n score := EvaluateMove(board);\\n if(score = 10 | score = -10) {\\n return score;\\n };\\n\\n if(IsTied()) {\\n return 0;\\n };\\n\\n if(is_max) {\\n best := Weights->MIN;\\n for(i := 0; i < 3; i += 1;) {\\n for(j := 0; j < 3; j += 1;) {\\n if(board[i,j] <> 'X' & board[i,j] <>'O') {\\n test := board[i,j];\\n board[i,j] := 'O';\\n best := Int->Max(best, Minimax(board, depth + 1, false, alpha, beta));\\n alpha := Int->Max(alpha, best);\\n board[i,j] := test;\\n\\n if(beta <= alpha) {\\n return best;\\n };\\n };\\n };\\n };\\n\\n return best;\\n }\\n else {\\n best := Weights->MAX;\\n for(i := 0; i < 3; i += 1;) {\\n for(j := 0; j < 3; j += 1;) {\\n if(board[i,j] <> 'X' & board[i,j] <>'O') {\\n test := board[i,j];\\n board[i,j] := 'X';\\n best := Int->Min(best, Minimax(board, depth + 1, true, alpha, beta));\\n beta := Int->Min(beta, best);\\n board[i,j] := test;\\n\\n if(beta <= alpha) {\\n return best;\\n };\\n };\\n };\\n };\\n\\n return best;\\n };\\n }\\n\\n method : BestCpuMove(board : Char[,]) ~ Nil {\\n best := Weights->MIN; # empty\\n best_i := -1;\\n best_j := -1;\\n\\n for(i := 0; i < 3; i += 1;) {\\n for(j := 0; j < 3; j += 1;) {\\n if(board[i,j] <> 'X' & board[i,j] <> 'O') {\\n test := board[i,j];\\n board[i,j] := 'O';\\n move := Int->Max(best, Minimax(board, 0, false, Weights->MIN, Weights->MAX));\\n board[i,j] := test;\\n\\n if(move > best) {\\n best_i := i;\\n best_j := j;\\n best := move;\\n };\\n };\\n };\\n };\\n\\n @board[best_i, best_j] := 'O';\\n }\\n\\n method : EvaluateMove(board : Char[,]) ~ Int {\\n if(IsWinner(board, 'O')) {\\n return 10;\\n }\\n else if(IsWinner(board, 'X')) {\\n return -10;\\n }\\n else {\\n return 0;\\n };\\n }\\n\\n method : CopyBoard() ~ Char[,] {\\n board := Char->New[3, 3];\\n\\n for(i := 0; i < 3; i += 1;) {\\n for(j := 0; j < 3; j += 1;) {\\n board[i,j] := @board[i,j];\\n };\\n };\\n\\n return board;\\n }\\n\\n method : LegalMove(move : Char, player: Char) ~ Bool {\\n if(move >= '1' & move <= '9') {\\n index := (move - '1')->As(Int);\\n j := index / 3; i := index % 3;\\n\\n if(@board[i, j] = 'X' | @board[i, j] = 'O') {\\n return false;\\n };\\n\\n @board[i, j] := player;\\n return true;\\n }\\n else {\\n return false;\\n };\\n }\\n\\n method : IsWinner(board : Char[,], player : Char) ~ Bool {\\n # --- diagonal ---\\n check := 0;\\n for(i := 0; i < 3; i += 1;) {\\n if(board[i, i] = player) {\\n check += 1;\\n };\\n };\\n\\n if(check = 3) {\\n return true;\\n };\\n\\n check := 0;\\n j := 2;\\n for(i := 0; i < 3; i += 1;) {\\n if(board[i, j] = player) {\\n check += 1;\\n };\\n j -= 1;\\n };\\n\\n if(check = 3) {\\n return true;\\n };\\n\\n # --- vertical ---\\n for(i := 0; i < 3; i += 1;) {\\n check := 0;\\n for(j := 0; j < 3; j += 1;) {\\n if(board[i, j] = player) {\\n check += 1;\\n };\\n };\\n\\n if(check = 3) {\\n return true;\\n };\\n };\\n\\n # --- horizontal ---\\n for(j := 0; j < 3; j += 1;) {\\n check := 0;\\n for(i := 0; i < 3; i += 1;) {\\n if(board[i, j] = player) {\\n check += 1;\\n };\\n };\\n\\n if(check = 3) {\\n return true;\\n };\\n };\\n\\n return false;\\n }\\n\\n method : IsTied() ~ Bool {\\n for(i := 0; i < 3; i += 1;) {\\n for(j := 0; j < 3; j += 1;) {\\n if(@board[i, j] <> 'X' & @board[i, j] <> 'O') {\\n return false;\\n };\\n };\\n };\\n\\n return true;\\n }\\n\\n method : Draw() ~ Nil {\\n a1 := @board[0, 0]; a2 := @board[1, 0]; a3 := @board[2, 0];\\n b1 := @board[0, 1]; b2 := @board[1, 1]; b3 := @board[2, 1];\\n c1 := @board[0, 2]; c2 := @board[1, 2]; c3 := @board[2, 2];\\n\\n \\\"===========\\\"->PrintLine();\\n \\\" {$a1} | {$a2} | {$a3} \\\"->PrintLine();\\n \\\"---|---|---\\\"->PrintLine();\\n \\\" {$b1} | {$b2} | {$b3} \\\"->PrintLine();\\n \\\"---|---|---\\\"->PrintLine();\\n \\\" {$c1} | {$c2} | {$c3} \\\"->PrintLine();\\n \\\"===========\\\\n\\\"->PrintLine();\\n }\\n}\\n\",\n \"language\": \"Objeck\"\n },\n {\n \"code\": \"program Tic(Input, Output);\\n\\ntype\\n Contents = (Unassigned, Human, Computer);\\nvar\\n BestI, BestJ: integer; { best solution a depth of zero in the search }\\n B: array[0..2, 0..2] of Contents; {zero based so modulus works later}\\n Player: Contents;\\n\\n procedure DisplayBoard;\\n var\\n I, J: integer;\\n T: array [Contents] of char;\\n begin\\n T[Unassigned] := ' ';\\n T[Human] := 'O';\\n T[Computer] := 'X';\\n for I := 0 to 2 do\\n begin\\n for J := 0 to 2 do\\n begin\\n Write(T[B[I, J]]);\\n if J <> 2 then\\n Write(' | ');\\n end;\\n WriteLn;\\n if I < 2 then\\n WriteLn('---------');\\n end;\\n WriteLn;\\n WriteLn;\\n end;\\n\\n function SwapPlayer(Player: Contents): Contents;\\n begin\\n if Player = Computer then\\n SwapPlayer := Human\\n else\\n SwapPlayer := Computer;\\n end;\\n\\n function CheckWinner: Contents;\\n var\\n I: integer;\\n begin\\n CheckWinner := Unassigned; { no winner yet }\\n for I := 0 to 2 do\\n begin\\n { first horizontal solution }\\n if (CheckWinner = Unassigned) and (B[I, 0] <> Unassigned) and\\n (B[I, 1] = B[I, 0]) and (B[I, 2] = B[I, 0]) then\\n CheckWinner := B[I, 0]\\n else\\n { now vertical solution }\\n if (CheckWinner = Unassigned) and (B[0, I] <> Unassigned) and\\n (B[1, I] = B[0, I]) and (B[2, I] = B[0, I]) then\\n CheckWinner := B[0, I];\\n end;\\n { now check the paths of the two cross line slants that share the middle position }\\n if (CheckWinner = Unassigned) and (B[1, 1] <> Unassigned) then\\n begin\\n if (B[1, 1] = B[0, 0]) and (B[2, 2] = B[0, 0]) then\\n CheckWinner := B[0, 0]\\n else if (B[1, 1] = B[2, 0]) and (B[0, 2] = B[1, 1]) then\\n CheckWinner := B[1, 1];\\n end;\\n end;\\n\\n { Basic strategy test - is this te best solution we have seen }\\n function SaveBest(CurScore, CurBest: Contents): boolean;\\n begin\\n if CurScore = CurBest then\\n SaveBest := False\\n else if (CurScore = Unassigned) and (CurBest = Human) then\\n SaveBest := False\\n else if (CurScore = Computer) and ((CurBest = Unassigned) or\\n (CurBest = Human)) then\\n SaveBest := False\\n else\\n SaveBest := True;\\n end;\\n\\n\\n { Basic strategy - recursive depth first search of possible moves\\n if computer can win save it, otherwise block if need be, else do deeper.\\n At each level modify the board for the next call, but clean up as go back up,\\n by remembering the modified position on the call stack. }\\n function TestMove(Val: Contents; Depth: integer): Contents;\\n var\\n I, J: integer;\\n Score, Best, Changed: Contents;\\n begin\\n Best := Computer;\\n Changed := Unassigned;\\n Score := CheckWinner;\\n if Score <> Unassigned then\\n begin\\n if Score = Val then\\n TestMove := Human\\n else\\n TestMove := Computer;\\n end\\n else\\n begin\\n for I := 0 to 2 do\\n for J := 0 to 2 do\\n begin\\n if B[I, J] = Unassigned then\\n begin\\n Changed := Val;\\n B[I, J] := Val;\\n { the value for now and try wioth the other player }\\n Score := TestMove(SwapPlayer(Val), Depth + 1);\\n if Score <> Unassigned then\\n Score := SwapPlayer(Score);\\n B[I, J] := Unassigned;\\n if SaveBest(Score, Best) then\\n begin\\n if Depth = 0 then\\n begin { top level, so remember actual position }\\n BestI := I;\\n BestJ := J;\\n end;\\n Best := Score;\\n end;\\n end;\\n end;\\n if Changed <> Unassigned then\\n TestMove := Best\\n else\\n TestMove := Unassigned;\\n end;\\n end;\\n\\n function PlayGame(Whom: Contents): string;\\n var\\n I, J, K, Move: integer;\\n Win: Contents;\\n begin\\n Win := Unassigned;\\n for I := 0 to 2 do\\n for J := 0 to 2 do\\n B[I, J] := Unassigned;\\n WriteLn('The board positions are numbered as follows:');\\n WriteLn('1 | 2 | 3');\\n WriteLn('---------');\\n WriteLn('4 | 5 | 6');\\n WriteLn('---------');\\n WriteLn('7 | 8 | 9');\\n WriteLn('You have O, I have X.');\\n WriteLn;\\n K := 1;\\n repeat {rather a for loop but can not have two actions or early termination in Pascal}\\n if Whom = Human then\\n begin\\n repeat\\n Write('Your move: ');\\n ReadLn(Move);\\n if (Move < 1) or (Move > 9) then\\n WriteLn('Opps: enter a number between 1 - 9.');\\n Dec(Move);\\n {humans do 1 -9, but the computer wants 0-8 for modulus to work}\\n I := Move div 3; { convert from range to corridinated of the array }\\n J := Move mod 3;\\n if B[I, J] <> Unassigned then\\n WriteLn('Opps: move ', Move + 1, ' was already done.')\\n until (Move >= 0) and (Move <= 8) and (B[I, J] = Unassigned);\\n B[I, J] := Human;\\n end;\\n if Whom = Computer then\\n begin\\n { randomize if computer opens, so its not always the same game }\\n if K = 1 then\\n begin\\n BestI := Random(3);\\n BestJ := Random(3);\\n end\\n else\\n Win := TestMove(Computer, 0);\\n B[BestI, BestJ] := Computer;\\n WriteLn('My move: ', BestI * 3 + BestJ + 1);\\n end;\\n DisplayBoard;\\n Win := CheckWinner;\\n if Win <> Unassigned then\\n begin\\n if Win = Human then\\n PlayGame := 'You win.'\\n else\\n PlayGame := 'I win.';\\n end\\n else\\n begin\\n Inc(K); { \\\"for\\\" loop counter actions }\\n Whom := SwapPlayer(Whom);\\n end;\\n until (Win <> Unassigned) or (K > 9);\\n if Win = Unassigned then\\n PlayGame := 'A draw.';\\n end;\\n\\nbegin\\n Randomize;\\n Player := Human;\\n while True do\\n begin\\n WriteLn(PlayGame(Player));\\n WriteLn;\\n Player := SwapPlayer(Player);\\n end\\nend.\\n\",\n \"language\": \"Pascal\"\n },\n {\n \"code\": \"use warnings;\\nuse strict;\\n\\nmy $initial = join \\\",\\\", qw(abc def ghi);\\nmy %reverse = qw(X O O X);\\n\\n# In list context, returns best move,\\n# In scalar context, returns the score of best move.\\nmy %cache;\\nsub best_move {\\n\\tmy ($b, $me) = @_;\\n\\tif( exists $cache{$b,$me,wantarray} ) {\\n\\t\\treturn $cache{$b,$me,wantarray};\\n\\t} elsif( my $s = score( $b, $me ) ) {\\n\\t\\treturn $cache{$b,$me,wantarray} = (wantarray ? undef : $s);\\n\\t}\\n\\tmy $him = $reverse{$me};\\n\\tmy ($best, @best) = (-999);\\n\\tfor my $m (moves($b)) {\\n\\t\\t(my $with_m = $b) =~ s/$m/$me/ or die;\\n\\t\\t# The || operator supplies scalar context to best_move(...)\\n\\t\\tmy $s = -(score($with_m, $him) || best_move($with_m, $him));\\n\\t\\tif( $s > $best ) {\\n\\t\\t\\t($best, @best) = ($s, $m);\\n\\t\\t} elsif( $s == $best ) {\\n\\t\\t\\tpush @best, $m;\\n\\t\\t}\\n\\t}\\n\\t$cache{$b,$me,wantarray} = wantarray ? $best[rand @best] : $best;\\n}\\n\\nmy $winner = q[([XOxo])(?:\\\\1\\\\1|...\\\\1...\\\\1|..\\\\1..\\\\1|....\\\\1....\\\\1)];\\nsub score {\\n\\tmy ($b, $me) = @_;\\n\\t$b =~ m/$winner/o or return 0;\\n\\treturn $1 eq $me ? +1 : -1;\\n}\\n\\nsub moves {\\n\\tmy ($b) = @_;\\n\\t$b =~ /([^xoXO,\\\\n])/g;\\n}\\n\\nsub print_board {\\n\\tmy ($b) = @_;\\n\\t$b =~ s/\\\\B/|/g;\\n\\t$b =~ s/,/\\\\n-+-+-\\\\n/g;\\n\\tprint $b, \\\"\\\\n\\\";\\n}\\n\\nsub prompt {\\n\\tmy ($b, $color) = @_;\\n\\tmy @moves = moves($b);\\n\\tunless( @moves ) {\\n\\t\\treturn;\\n\\t}\\n\\twhile( 1 ) {\\n\\t\\tprint \\\"Place your $color on one of [@moves]: \\\";\\n\\t\\tdefined(my $m = <>) or return;\\n\\t\\tchomp($m);\\n\\t\\treturn $m if grep $m eq $_, @moves;\\n\\t}\\n}\\n\\nmy @players = (\\n\\t{ whose => \\\"your\\\", name => \\\"You\\\",\\n\\t verb => \\\"You place\\\", get_move => \\\\&prompt },\\n\\t{ whose => \\\"the computer's\\\", name => \\\"Computer\\\",\\n\\t verb => \\\"The computer places\\\", get_move => \\\\&best_move },\\n);\\nmy $whose_turn = int rand 2;\\n\\nmy $color = \\\"X\\\";\\nmy $b = $initial;\\n\\nwhile( 1 ) {\\n\\tmy $p = $players[$whose_turn];\\n\\tprint_board($b);\\n\\tprint \\\"It is $p->{whose} turn.\\\\n\\\";\\n\\t# The parens around $m supply list context to the right side\\n\\t# or the = operator, which causes sub best_move to return the\\n\\t# best move, rather than the score of the best move.\\n\\tmy ( $m ) = $p->{get_move}->($b, $color);\\n\\tif( $m ) {\\n\\t\\tprint \\\"$p->{verb} an $color at $m\\\\n\\\";\\n\\t\\t$b =~ s/$m/$color/;\\n\\t\\tmy $s = score($b, $color) or next;\\n\\t\\tprint_board($b);\\n\\t\\tprint \\\"$p->{name} \\\", $s > 0 ? \\\"won!\\\\n\\\" : \\\"lost!\\\\n\\\";\\n\\t} else {\\n\\t\\tprint \\\"$p->{name} cannot move.\\\\n\\\";\\n\\t}\\n\\tprint \\\"Game over.\\\\nNew Game...\\\\n\\\";\\n\\t($b, $color, $whose_turn) = ($initial, \\\"X\\\", int rand 2);\\n\\tredo;\\n} continue {\\n\\t$color = $reverse{$color};\\n\\t$whose_turn = !$whose_turn;\\n}\\n\",\n \"language\": \"Perl\"\n },\n {\n \"code\": \"#!/usr/bin/perl\\n\\nuse strict;\\nuse warnings;\\nuse Tk;\\nuse List::Util qw( shuffle );\\n\\nmy $win = qr/(?| ^(\\\\w)...\\\\1...\\\\1 | ^..(\\\\w).\\\\1.\\\\1 # diagonals\\n | ^(?:...)*?(\\\\w)\\\\1\\\\1 | (\\\\w)..\\\\1..\\\\1 )/x; # row or column\\nmy (%cache, $message, $game);\\n\\nmy $mw = MainWindow->new( -title => 'TicTacToe' );\\n$mw->geometry('+1000+300');\\n$mw->Label(-textvariable => \\\\$message, -font => 'courierbold 16',\\n )->pack(-fill => 'x');\\nmy $grid = $mw->Frame( -borderwidth => 5, -relief => 'ridge' )->pack;\\n$mw->Button(-text => $_->[0], -command => $_->[1],\\n )->pack(-side => 'left', -fill => 'x', -expand => 1) for\\n ['Restart X first' => sub { restart(1) }],\\n ['Restart O first' => sub { restart(0) }],\\n [ 'Exit' => sub { $mw->destroy }];\\nmy @cells = map { my $me = $_;\\n $grid->Button( -command => sub { person($me) },\\n -width => 1, -height => 1, -font => 'courierbold 40',\\n )->grid(-row => int $_ / 3, -column => $_ % 3)\\n } 0 .. 8;\\n\\nrestart(1);\\n\\nMainLoop;\\n\\nsub show { $cells[$_]->configure(-text => substr $game, $_, 1) for 0 .. 8 }\\n\\nsub person\\n {\\n $message =~ /O's turn/ or return;\\n pos($game) = shift();\\n if( $game =~ s/\\\\G /O/ )\\n {\\n $message = $game =~ $win ? \\\"O Wins\\\" :\\n $game !~ / / ? \\\"Draw\\\" : do {\\n $game = move( $game, 'X' )->[1];\\n $game =~ $win ? 'X Wins' :\\n $game !~ / / ? 'Draw' : \\\"O's turn to move\\\"\\n };\\n show;\\n }\\n }\\n\\nsub restart\\n {\\n %cache = ();\\n $game = shift() ? move( ' ' x 9, 'X' )->[1] : ' ' x 9;\\n show;\\n $message = \\\"O's turn to move\\\";\\n }\\n\\nsub move\\n {\\n (local $_, my $who, my @moves) = @_;\\n /$win/ and return [ 2 * ($1 eq 'X'), $_ ];\\n / / or return [ 1, $_ ];\\n $cache{$_ . $who} //= do\\n {\\n while( / /g )\\n {\\n my $move = \\\"$`$who$'\\\";\\n push @moves, [ move($move, $who ^ 'X' ^ 'O')->[0], $move ];\\n }\\n (sort {$a->[0] <=> $b->[0]} shuffle @moves)[ -($who eq 'X') ]\\n };\\n }\\n\",\n \"language\": \"Perl\"\n },\n {\n \"code\": \"(phixonline)-->\\n <span style=\\\"color: #000080;font-style:italic;\\\">--\\n -- demo\\\\rosetta\\\\Tic_tac_toe.exw\\n --</span>\\n <span style=\\\"color: #008080;\\\">with</span> <span style=\\\"color: #008080;\\\">javascript_semantics</span>\\n <span style=\\\"color: #008080;\\\">include</span> <span style=\\\"color: #000000;\\\">pGUI</span><span style=\\\"color: #0000FF;\\\">.</span><span style=\\\"color: #000000;\\\">e</span>\\n <span style=\\\"color: #008080;\\\">constant</span> <span style=\\\"color: #000000;\\\">title</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #008000;\\\">\\\"Tic Tac Toe\\\"</span>\\n <span style=\\\"color: #004080;\\\">sequence</span> <span style=\\\"color: #000000;\\\">board</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: #000000;\\\">9</span><span style=\\\"color: #0000FF;\\\">)</span> <span style=\\\"color: #000080;font-style:italic;\\\">-- {' '/'X'/'O'}</span>\\n <span style=\\\"color: #004080;\\\">bool</span> <span style=\\\"color: #000000;\\\">human</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #004600;\\\">false</span> <span style=\\\"color: #000080;font-style:italic;\\\">-- (flipped in new_game)</span>\\n <span style=\\\"color: #004080;\\\">bool</span> <span style=\\\"color: #000000;\\\">game_over</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #004600;\\\">false</span>\\n <span style=\\\"color: #008080;\\\">constant</span> <span style=\\\"color: #000000;\\\">play_dumb</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #004600;\\\">false</span>\\n <span style=\\\"color: #004080;\\\">Ihandle</span> <span style=\\\"color: #000000;\\\">dlg</span>\\n\\n <span style=\\\"color: #000080;font-style:italic;\\\">-- saved in redraw_cb() for check_position():</span>\\n <span style=\\\"color: #004080;\\\">integer</span> <span style=\\\"color: #000000;\\\">cw</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">ch</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000080;font-style:italic;\\\">-- board centre</span>\\n <span style=\\\"color: #000000;\\\">d</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000080;font-style:italic;\\\">-- tile spacing</span>\\n <span style=\\\"color: #000000;\\\">h</span> <span style=\\\"color: #000080;font-style:italic;\\\">-- tile size/radius</span>\\n\\n <span style=\\\"color: #008080;\\\">function</span> <span style=\\\"color: #000000;\\\">redraw_cb</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #004080;\\\">Ihandle</span> <span style=\\\"color: #000000;\\\">ih</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #004080;\\\">integer</span> <span style=\\\"color: #000080;font-style:italic;\\\">/*posx*/</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000080;font-style:italic;\\\">/*posy*/</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #0000FF;\\\">{</span><span style=\\\"color: #000000;\\\">cw</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">ch</span><span style=\\\"color: #0000FF;\\\">}</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">IupGetIntInt</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">ih</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #008000;\\\">\\\"DRAWSIZE\\\"</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #000000;\\\">d</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">floor</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #7060A8;\\\">min</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">cw</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">ch</span><span style=\\\"color: #0000FF;\\\">)/</span><span style=\\\"color: #000000;\\\">8</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #000000;\\\">h</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">floor</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;\\\">3</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #000000;\\\">cw</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">floor</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">cw</span><span style=\\\"color: #0000FF;\\\">/</span><span style=\\\"color: #000000;\\\">2</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #000000;\\\">ch</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">floor</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">ch</span><span style=\\\"color: #0000FF;\\\">/</span><span style=\\\"color: #000000;\\\">2</span><span style=\\\"color: #0000FF;\\\">)</span>\\n\\n <span style=\\\"color: #7060A8;\\\">IupGLMakeCurrent</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">ih</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #004080;\\\">cdCanvas</span> <span style=\\\"color: #000000;\\\">cddbuffer</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">IupGetAttributePtr</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">ih</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #008000;\\\">\\\"DBUFFER\\\"</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #7060A8;\\\">cdCanvasActivate</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">cddbuffer</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #7060A8;\\\">cdCanvasClear</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">cddbuffer</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #7060A8;\\\">cdCanvasSetForeground</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">cddbuffer</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #004600;\\\">CD_BLUE</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #7060A8;\\\">cdCanvasSetLineWidth</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">cddbuffer</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">10</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #004080;\\\">integer</span> <span style=\\\"color: #000000;\\\">d3</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">3</span><span style=\\\"color: #0000FF;\\\">*</span><span style=\\\"color: #000000;\\\">d</span>\\n <span style=\\\"color: #7060A8;\\\">cdCanvasLine</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">cddbuffer</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">cw</span><span style=\\\"color: #0000FF;\\\">-</span><span style=\\\"color: #000000;\\\">d</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">ch</span><span style=\\\"color: #0000FF;\\\">-</span><span style=\\\"color: #000000;\\\">d3</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">cw</span><span style=\\\"color: #0000FF;\\\">-</span><span style=\\\"color: #000000;\\\">d</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">ch</span><span style=\\\"color: #0000FF;\\\">+</span><span style=\\\"color: #000000;\\\">d3</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #7060A8;\\\">cdCanvasLine</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">cddbuffer</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">cw</span><span style=\\\"color: #0000FF;\\\">+</span><span style=\\\"color: #000000;\\\">d</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">ch</span><span style=\\\"color: #0000FF;\\\">-</span><span style=\\\"color: #000000;\\\">d3</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">cw</span><span style=\\\"color: #0000FF;\\\">+</span><span style=\\\"color: #000000;\\\">d</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">ch</span><span style=\\\"color: #0000FF;\\\">+</span><span style=\\\"color: #000000;\\\">d3</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #7060A8;\\\">cdCanvasLine</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">cddbuffer</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">cw</span><span style=\\\"color: #0000FF;\\\">-</span><span style=\\\"color: #000000;\\\">d3</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">ch</span><span style=\\\"color: #0000FF;\\\">-</span><span style=\\\"color: #000000;\\\">d</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">cw</span><span style=\\\"color: #0000FF;\\\">+</span><span style=\\\"color: #000000;\\\">d3</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">ch</span><span style=\\\"color: #0000FF;\\\">-</span><span style=\\\"color: #000000;\\\">d</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #7060A8;\\\">cdCanvasLine</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">cddbuffer</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">cw</span><span style=\\\"color: #0000FF;\\\">-</span><span style=\\\"color: #000000;\\\">d3</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">ch</span><span style=\\\"color: #0000FF;\\\">+</span><span style=\\\"color: #000000;\\\">d</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">cw</span><span style=\\\"color: #0000FF;\\\">+</span><span style=\\\"color: #000000;\\\">d3</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">ch</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;\\\">pdx</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">1</span>\\n <span style=\\\"color: #008080;\\\">for</span> <span style=\\\"color: #000000;\\\">y</span><span style=\\\"color: #0000FF;\\\">=+</span><span style=\\\"color: #000000;\\\">1</span> <span style=\\\"color: #008080;\\\">to</span> <span style=\\\"color: #0000FF;\\\">-</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;\\\">my</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">ch</span><span style=\\\"color: #0000FF;\\\">+</span><span style=\\\"color: #000000;\\\">y</span><span style=\\\"color: #0000FF;\\\">*</span><span style=\\\"color: #000000;\\\">2</span><span style=\\\"color: #0000FF;\\\">*</span><span style=\\\"color: #000000;\\\">d</span>\\n <span style=\\\"color: #008080;\\\">for</span> <span style=\\\"color: #000000;\\\">x</span><span style=\\\"color: #0000FF;\\\">=-</span><span style=\\\"color: #000000;\\\">1</span> <span style=\\\"color: #008080;\\\">to</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;\\\">mx</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">cw</span><span style=\\\"color: #0000FF;\\\">+</span><span style=\\\"color: #000000;\\\">x</span><span style=\\\"color: #0000FF;\\\">*</span><span style=\\\"color: #000000;\\\">2</span><span style=\\\"color: #0000FF;\\\">*</span><span style=\\\"color: #000000;\\\">d</span>\\n <span style=\\\"color: #004080;\\\">integer</span> <span style=\\\"color: #000000;\\\">mark</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">board</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">pdx</span><span style=\\\"color: #0000FF;\\\">]</span>\\n <span style=\\\"color: #008080;\\\">if</span> <span style=\\\"color: #000000;\\\">mark</span><span style=\\\"color: #0000FF;\\\">=</span><span style=\\\"color: #008000;\\\">'X'</span> <span style=\\\"color: #008080;\\\">then</span>\\n <span style=\\\"color: #7060A8;\\\">cdCanvasLine</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">cddbuffer</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">mx</span><span style=\\\"color: #0000FF;\\\">-</span><span style=\\\"color: #000000;\\\">h</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">my</span><span style=\\\"color: #0000FF;\\\">-</span><span style=\\\"color: #000000;\\\">h</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">mx</span><span style=\\\"color: #0000FF;\\\">+</span><span style=\\\"color: #000000;\\\">h</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">my</span><span style=\\\"color: #0000FF;\\\">+</span><span style=\\\"color: #000000;\\\">h</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #7060A8;\\\">cdCanvasLine</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">cddbuffer</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">mx</span><span style=\\\"color: #0000FF;\\\">-</span><span style=\\\"color: #000000;\\\">h</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">my</span><span style=\\\"color: #0000FF;\\\">+</span><span style=\\\"color: #000000;\\\">h</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">mx</span><span style=\\\"color: #0000FF;\\\">+</span><span style=\\\"color: #000000;\\\">h</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">my</span><span style=\\\"color: #0000FF;\\\">-</span><span style=\\\"color: #000000;\\\">h</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #008080;\\\">elsif</span> <span style=\\\"color: #000000;\\\">mark</span><span style=\\\"color: #0000FF;\\\">=</span><span style=\\\"color: #008000;\\\">'O'</span> <span style=\\\"color: #008080;\\\">then</span>\\n <span style=\\\"color: #7060A8;\\\">cdCanvasCircle</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">cddbuffer</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">mx</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">my</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">2</span><span style=\\\"color: #0000FF;\\\">*</span><span style=\\\"color: #000000;\\\">h</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">if</span>\\n <span style=\\\"color: #000000;\\\">pdx</span> <span style=\\\"color: #0000FF;\\\">+=</span> <span style=\\\"color: #000000;\\\">1</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;\\\">cdCanvasFlush</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">cddbuffer</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #008080;\\\">return</span> <span style=\\\"color: #004600;\\\">IUP_DEFAULT</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;\\\">map_cb</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #004080;\\\">Ihandle</span> <span style=\\\"color: #000000;\\\">canvas</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #7060A8;\\\">IupGLMakeCurrent</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">canvas</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #004080;\\\">cdCanvas</span> <span style=\\\"color: #000000;\\\">cddbuffer</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;\\\">cddbuffer</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">cdCreateCanvas</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #004600;\\\">CD_IUP</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">canvas</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #008080;\\\">else</span>\\n <span style=\\\"color: #004080;\\\">atom</span> <span style=\\\"color: #000000;\\\">res</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">IupGetDouble</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #004600;\\\">NULL</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #008000;\\\">\\\"SCREENDPI\\\"</span><span style=\\\"color: #0000FF;\\\">)/</span><span style=\\\"color: #000000;\\\">25.4</span>\\n <span style=\\\"color: #000000;\\\">cddbuffer</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">cdCreateCanvas</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #004600;\\\">CD_GL</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #008000;\\\">\\\"10x10 %g\\\"</span><span style=\\\"color: #0000FF;\\\">,</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: #7060A8;\\\">IupSetAttributePtr</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">canvas</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #008000;\\\">\\\"DBUFFER\\\"</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">cddbuffer</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #7060A8;\\\">cdCanvasSetBackground</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">cddbuffer</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #004600;\\\">CD_PARCHMENT</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #008080;\\\">return</span> <span style=\\\"color: #004600;\\\">IUP_DEFAULT</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;\\\">canvas_resize_cb</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #004080;\\\">Ihandle</span> <span style=\\\"color: #000000;\\\">canvas</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #004080;\\\">cdCanvas</span> <span style=\\\"color: #000000;\\\">cddbuffer</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">IupGetAttributePtr</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">canvas</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #008000;\\\">\\\"DBUFFER\\\"</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #004080;\\\">integer</span> <span style=\\\"color: #0000FF;\\\">{</span><span style=\\\"color: #000000;\\\">canvas_width</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">canvas_height</span><span style=\\\"color: #0000FF;\\\">}</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">IupGetIntInt</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">canvas</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #008000;\\\">\\\"DRAWSIZE\\\"</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #004080;\\\">atom</span> <span style=\\\"color: #000000;\\\">res</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">IupGetDouble</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #004600;\\\">NULL</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #008000;\\\">\\\"SCREENDPI\\\"</span><span style=\\\"color: #0000FF;\\\">)/</span><span style=\\\"color: #000000;\\\">25.4</span>\\n <span style=\\\"color: #7060A8;\\\">cdCanvasSetAttribute</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">cddbuffer</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #008000;\\\">\\\"SIZE\\\"</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #008000;\\\">\\\"%dx%d %g\\\"</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #0000FF;\\\">{</span><span style=\\\"color: #000000;\\\">canvas_width</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">canvas_height</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: #004600;\\\">IUP_DEFAULT</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;\\\">wins</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;\\\">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: #000000;\\\">5</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><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;\\\">4</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">7</span><span style=\\\"color: #0000FF;\\\">},{</span><span style=\\\"color: #000000;\\\">2</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;\\\">3</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">6</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;\\\">5</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">9</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: #000000;\\\">7</span><span style=\\\"color: #0000FF;\\\">}}</span>\\n\\n <span style=\\\"color: #008080;\\\">function</span> <span style=\\\"color: #000000;\\\">check_winner</span><span style=\\\"color: #0000FF;\\\">()</span>\\n <span style=\\\"color: #008080;\\\">for</span> <span style=\\\"color: #000000;\\\">w</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;\\\">wins</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;\\\">i</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">j</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;\\\">wins</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">w</span><span style=\\\"color: #0000FF;\\\">],</span>\\n <span style=\\\"color: #000000;\\\">mark</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">board</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;\\\">mark</span><span style=\\\"color: #0000FF;\\\">!=</span><span style=\\\"color: #008000;\\\">' '</span> <span style=\\\"color: #008080;\\\">and</span> <span style=\\\"color: #000000;\\\">mark</span><span style=\\\"color: #0000FF;\\\">=</span><span style=\\\"color: #000000;\\\">board</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">j</span><span style=\\\"color: #0000FF;\\\">]</span> <span style=\\\"color: #008080;\\\">and</span> <span style=\\\"color: #000000;\\\">mark</span><span style=\\\"color: #0000FF;\\\">=</span><span style=\\\"color: #000000;\\\">board</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">k</span><span style=\\\"color: #0000FF;\\\">]</span> <span style=\\\"color: #008080;\\\">then</span>\\n <span style=\\\"color: #008080;\\\">return</span> <span style=\\\"color: #000000;\\\">mark</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;\\\">0</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">function</span>\\n\\n <span style=\\\"color: #004080;\\\">integer</span> <span style=\\\"color: #000000;\\\">best_i</span>\\n\\n <span style=\\\"color: #008080;\\\">function</span> <span style=\\\"color: #000000;\\\">test_move</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #004080;\\\">integer</span> <span style=\\\"color: #000000;\\\">mark</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">depth</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #004080;\\\">integer</span> <span style=\\\"color: #000000;\\\">score</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">check_winner</span><span style=\\\"color: #0000FF;\\\">(),</span>\\n <span style=\\\"color: #000000;\\\">best</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;\\\">changed</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">0</span>\\n <span style=\\\"color: #008080;\\\">if</span> <span style=\\\"color: #000000;\\\">score</span><span style=\\\"color: #0000FF;\\\">!=</span><span style=\\\"color: #000000;\\\">0</span> <span style=\\\"color: #008080;\\\">then</span> <span style=\\\"color: #008080;\\\">return</span> <span style=\\\"color: #008080;\\\">iff</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">score</span><span style=\\\"color: #0000FF;\\\">=</span><span style=\\\"color: #000000;\\\">mark</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: #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;\\\">1</span> <span style=\\\"color: #008080;\\\">to</span> <span style=\\\"color: #000000;\\\">9</span> <span style=\\\"color: #008080;\\\">do</span>\\n <span style=\\\"color: #008080;\\\">if</span> <span style=\\\"color: #000000;\\\">board</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: #008080;\\\">then</span>\\n <span style=\\\"color: #000000;\\\">changed</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">mark</span>\\n <span style=\\\"color: #000000;\\\">board</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;\\\">mark</span>\\n <span style=\\\"color: #000000;\\\">score</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #0000FF;\\\">-</span><span style=\\\"color: #000000;\\\">test_move</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #008000;\\\">'O'</span><span style=\\\"color: #0000FF;\\\">+</span><span style=\\\"color: #008000;\\\">'X'</span><span style=\\\"color: #0000FF;\\\">-</span><span style=\\\"color: #000000;\\\">mark</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">depth</span> <span style=\\\"color: #0000FF;\\\">+</span> <span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #000000;\\\">board</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: #008000;\\\">' '</span>\\n <span style=\\\"color: #008080;\\\">if</span> <span style=\\\"color: #000000;\\\">score</span><span style=\\\"color: #0000FF;\\\">></span><span style=\\\"color: #000000;\\\">best</span> <span style=\\\"color: #008080;\\\">then</span>\\n <span style=\\\"color: #008080;\\\">if</span> <span style=\\\"color: #000000;\\\">depth</span><span style=\\\"color: #0000FF;\\\">=</span><span style=\\\"color: #000000;\\\">0</span> <span style=\\\"color: #008080;\\\">then</span>\\n <span style=\\\"color: #000000;\\\">best_i</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: #000000;\\\">best</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">score</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;\\\">for</span>\\n <span style=\\\"color: #008080;\\\">return</span> <span style=\\\"color: #008080;\\\">iff</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">changed</span><span style=\\\"color: #0000FF;\\\">!=</span><span style=\\\"color: #000000;\\\">0</span><span style=\\\"color: #0000FF;\\\">?</span><span style=\\\"color: #000000;\\\">best</span><span style=\\\"color: #0000FF;\\\">:</span><span style=\\\"color: #000000;\\\">0</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;\\\">procedure</span> <span style=\\\"color: #000000;\\\">check_game_over</span><span style=\\\"color: #0000FF;\\\">()</span>\\n <span style=\\\"color: #004080;\\\">integer</span> <span style=\\\"color: #000000;\\\">win</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">check_winner</span><span style=\\\"color: #0000FF;\\\">()</span>\\n <span style=\\\"color: #008080;\\\">if</span> <span style=\\\"color: #000000;\\\">win</span> <span style=\\\"color: #008080;\\\">or</span> <span style=\\\"color: #008080;\\\">not</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;\\\">board</span><span style=\\\"color: #0000FF;\\\">)</span> <span style=\\\"color: #008080;\\\">then</span>\\n <span style=\\\"color: #004080;\\\">string</span> <span style=\\\"color: #000000;\\\">winner</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #008080;\\\">iff</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">win</span><span style=\\\"color: #0000FF;\\\">=</span><span style=\\\"color: #008000;\\\">'O'</span><span style=\\\"color: #0000FF;\\\">?</span><span style=\\\"color: #008000;\\\">\\\"You win!\\\"</span><span style=\\\"color: #0000FF;\\\">,</span>\\n <span style=\\\"color: #008080;\\\">iff</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">win</span><span style=\\\"color: #0000FF;\\\">=</span><span style=\\\"color: #008000;\\\">'X'</span><span style=\\\"color: #0000FF;\\\">?</span><span style=\\\"color: #008000;\\\">\\\"Computer wins\\\"</span>\\n <span style=\\\"color: #0000FF;\\\">:</span><span style=\\\"color: #008000;\\\">\\\"Draw\\\"</span><span style=\\\"color: #0000FF;\\\">))</span>\\n <span style=\\\"color: #7060A8;\\\">IupSetStrAttribute</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">dlg</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #008000;\\\">\\\"TITLE\\\"</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #008000;\\\">\\\"%s - %s\\\"</span><span style=\\\"color: #0000FF;\\\">,{</span><span style=\\\"color: #000000;\\\">title</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">winner</span><span style=\\\"color: #0000FF;\\\">})</span>\\n <span style=\\\"color: #000000;\\\">game_over</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #004600;\\\">true</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;\\\">procedure</span> <span style=\\\"color: #000000;\\\">play_move</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #004080;\\\">integer</span> <span style=\\\"color: #000000;\\\">move</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #008080;\\\">if</span> <span style=\\\"color: #000000;\\\">move</span> <span style=\\\"color: #008080;\\\">then</span>\\n <span style=\\\"color: #7060A8;\\\">assert</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">board</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">move</span><span style=\\\"color: #0000FF;\\\">]=</span><span style=\\\"color: #008000;\\\">' '</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #000000;\\\">board</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">move</span><span style=\\\"color: #0000FF;\\\">]</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #008000;\\\">'O'</span>\\n <span style=\\\"color: #000000;\\\">check_game_over</span><span style=\\\"color: #0000FF;\\\">()</span>\\n <span style=\\\"color: #008080;\\\">if</span> <span style=\\\"color: #008080;\\\">not</span> <span style=\\\"color: #000000;\\\">game_over</span> <span style=\\\"color: #008080;\\\">then</span>\\n <span style=\\\"color: #000000;\\\">human</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #004600;\\\">false</span>\\n <span style=\\\"color: #008080;\\\">if</span> <span style=\\\"color: #000000;\\\">play_dumb</span> <span style=\\\"color: #008080;\\\">then</span>\\n <span style=\\\"color: #004080;\\\">sequence</span> <span style=\\\"color: #000000;\\\">s</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">find_all</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #008000;\\\">' '</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">board</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #000000;\\\">best_i</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">s</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;\\\">s</span><span style=\\\"color: #0000FF;\\\">))]</span>\\n <span style=\\\"color: #008080;\\\">else</span>\\n <span style=\\\"color: #0000FF;\\\">{}</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">test_move</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #008000;\\\">'X'</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">0</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #7060A8;\\\">assert</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">board</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">best_i</span><span style=\\\"color: #0000FF;\\\">]=</span><span style=\\\"color: #008000;\\\">' '</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">if</span>\\n <span style=\\\"color: #000000;\\\">board</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">best_i</span><span style=\\\"color: #0000FF;\\\">]</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #008000;\\\">'X'</span>\\n <span style=\\\"color: #000000;\\\">check_game_over</span><span style=\\\"color: #0000FF;\\\">()</span>\\n <span style=\\\"color: #000000;\\\">human</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #008080;\\\">not</span> <span style=\\\"color: #000000;\\\">game_over</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;\\\">procedure</span> <span style=\\\"color: #000000;\\\">new_game</span><span style=\\\"color: #0000FF;\\\">()</span>\\n <span style=\\\"color: #000000;\\\">board</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: #000000;\\\">9</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #000000;\\\">human</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #008080;\\\">not</span> <span style=\\\"color: #000000;\\\">human</span>\\n <span style=\\\"color: #008080;\\\">if</span> <span style=\\\"color: #008080;\\\">not</span> <span style=\\\"color: #000000;\\\">human</span> <span style=\\\"color: #008080;\\\">then</span>\\n <span style=\\\"color: #000000;\\\">board</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #7060A8;\\\">rand</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: #008000;\\\">'X'</span>\\n <span style=\\\"color: #000000;\\\">human</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #004600;\\\">true</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;\\\">function</span> <span style=\\\"color: #000000;\\\">check_position</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #004080;\\\">integer</span> <span style=\\\"color: #000000;\\\">px</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">py</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #000080;font-style:italic;\\\">--\\n -- check if x,y is on a legal move.\\n -- uses ch,cw,d,h as saved by redraw_cb().\\n --</span>\\n <span style=\\\"color: #004080;\\\">integer</span> <span style=\\\"color: #000000;\\\">pdx</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">1</span>\\n <span style=\\\"color: #008080;\\\">for</span> <span style=\\\"color: #000000;\\\">y</span><span style=\\\"color: #0000FF;\\\">=-</span><span style=\\\"color: #000000;\\\">1</span> <span style=\\\"color: #008080;\\\">to</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;\\\">my</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">ch</span><span style=\\\"color: #0000FF;\\\">+</span><span style=\\\"color: #000000;\\\">y</span><span style=\\\"color: #0000FF;\\\">*</span><span style=\\\"color: #000000;\\\">2</span><span style=\\\"color: #0000FF;\\\">*</span><span style=\\\"color: #000000;\\\">d</span>\\n <span style=\\\"color: #008080;\\\">for</span> <span style=\\\"color: #000000;\\\">x</span><span style=\\\"color: #0000FF;\\\">=-</span><span style=\\\"color: #000000;\\\">1</span> <span style=\\\"color: #008080;\\\">to</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;\\\">mx</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">cw</span><span style=\\\"color: #0000FF;\\\">+</span><span style=\\\"color: #000000;\\\">x</span><span style=\\\"color: #0000FF;\\\">*</span><span style=\\\"color: #000000;\\\">2</span><span style=\\\"color: #0000FF;\\\">*</span><span style=\\\"color: #000000;\\\">d</span>\\n <span style=\\\"color: #008080;\\\">if</span> <span style=\\\"color: #000000;\\\">px</span><span style=\\\"color: #0000FF;\\\">>=</span><span style=\\\"color: #000000;\\\">mx</span><span style=\\\"color: #0000FF;\\\">-</span><span style=\\\"color: #000000;\\\">h</span> <span style=\\\"color: #008080;\\\">and</span> <span style=\\\"color: #000000;\\\">px</span><span style=\\\"color: #0000FF;\\\"><=</span><span style=\\\"color: #000000;\\\">mx</span><span style=\\\"color: #0000FF;\\\">+</span><span style=\\\"color: #000000;\\\">h</span>\\n <span style=\\\"color: #008080;\\\">and</span> <span style=\\\"color: #000000;\\\">py</span><span style=\\\"color: #0000FF;\\\">>=</span><span style=\\\"color: #000000;\\\">my</span><span style=\\\"color: #0000FF;\\\">-</span><span style=\\\"color: #000000;\\\">h</span> <span style=\\\"color: #008080;\\\">and</span> <span style=\\\"color: #000000;\\\">py</span><span style=\\\"color: #0000FF;\\\"><=</span><span style=\\\"color: #000000;\\\">my</span><span style=\\\"color: #0000FF;\\\">+</span><span style=\\\"color: #000000;\\\">h</span> <span style=\\\"color: #008080;\\\">then</span>\\n <span style=\\\"color: #004080;\\\">integer</span> <span style=\\\"color: #000000;\\\">mark</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">board</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">pdx</span><span style=\\\"color: #0000FF;\\\">]</span>\\n <span style=\\\"color: #008080;\\\">return</span> <span style=\\\"color: #008080;\\\">iff</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">mark</span><span style=\\\"color: #0000FF;\\\">==</span><span style=\\\"color: #008000;\\\">' '</span><span style=\\\"color: #0000FF;\\\">?</span><span style=\\\"color: #000000;\\\">pdx</span><span style=\\\"color: #0000FF;\\\">:</span><span style=\\\"color: #000000;\\\">0</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">if</span>\\n <span style=\\\"color: #000000;\\\">pdx</span> <span style=\\\"color: #0000FF;\\\">+=</span> <span style=\\\"color: #000000;\\\">1</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: #008080;\\\">return</span> <span style=\\\"color: #000000;\\\">0</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;\\\">button_cb</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #004080;\\\">Ihandle</span> <span style=\\\"color: #000080;font-style:italic;\\\">/*canvas*/</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #004080;\\\">integer</span> <span style=\\\"color: #000000;\\\">button</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">pressed</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">x</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">y</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #004080;\\\">atom</span> <span style=\\\"color: #000080;font-style:italic;\\\">/*pStatus*/</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #008080;\\\">if</span> <span style=\\\"color: #000000;\\\">button</span><span style=\\\"color: #0000FF;\\\">=</span><span style=\\\"color: #004600;\\\">IUP_BUTTON1</span> <span style=\\\"color: #008080;\\\">and</span> <span style=\\\"color: #008080;\\\">not</span> <span style=\\\"color: #000000;\\\">pressed</span> <span style=\\\"color: #008080;\\\">then</span> <span style=\\\"color: #000080;font-style:italic;\\\">-- (left button released)</span>\\n <span style=\\\"color: #008080;\\\">if</span> <span style=\\\"color: #000000;\\\">game_over</span> <span style=\\\"color: #008080;\\\">then</span>\\n <span style=\\\"color: #000000;\\\">game_over</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #004600;\\\">false</span>\\n <span style=\\\"color: #000000;\\\">new_game</span><span style=\\\"color: #0000FF;\\\">()</span>\\n <span style=\\\"color: #008080;\\\">else</span>\\n <span style=\\\"color: #000000;\\\">play_move</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">check_position</span><span style=\\\"color: #0000FF;\\\">(</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: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">if</span>\\n <span style=\\\"color: #7060A8;\\\">IupRedraw</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">dlg</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: #004600;\\\">IUP_CONTINUE</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;\\\">exit_cb</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #004080;\\\">Ihandle</span> <span style=\\\"color: #000080;font-style:italic;\\\">/*ih*/</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #008080;\\\">return</span> <span style=\\\"color: #004600;\\\">IUP_CLOSE</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;\\\">help_text</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #008000;\\\">\\\"\\\"\\\"\\n Tic Tac Toe, also known as Noughts and Crosses.\\n\\n The aim is to get three Os (or Xs) in a row.\\n\\n Human(O) plays first, as does loser. After a draw first player alternates.\\n Computer(X) plays a random move first, to make it more interesting.\\n Setting the constant play_dumb to true disables the internal AI.\\n\\n Once a game is over click anywhere on the board to start a new game.\\n \\\"\\\"\\\"</span>\\n\\n <span style=\\\"color: #008080;\\\">function</span> <span style=\\\"color: #000000;\\\">help_cb</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #004080;\\\">Ihandln</span> <span style=\\\"color: #000080;font-style:italic;\\\">/*ih*/</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #7060A8;\\\">IupMessage</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">title</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">help_text</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #008080;\\\">return</span> <span style=\\\"color: #004600;\\\">IUP_DEFAULT</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">function</span>\\n\\n <span style=\\\"color: #000080;font-style:italic;\\\">-- Other possible keys:\\n -- Q - quit (end program) [==X?]\\n -- C - concede (start new game)</span>\\n <span style=\\\"color: #008080;\\\">function</span> <span style=\\\"color: #000000;\\\">key_cb</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #004080;\\\">Ihandle</span> <span style=\\\"color: #000080;font-style:italic;\\\">/*dlg*/</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #004080;\\\">atom</span> <span style=\\\"color: #000000;\\\">c</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: #004600;\\\">K_ESC</span> <span style=\\\"color: #008080;\\\">then</span> <span style=\\\"color: #008080;\\\">return</span> <span style=\\\"color: #004600;\\\">IUP_CLOSE</span> <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">if</span>\\n <span style=\\\"color: #008080;\\\">if</span> <span style=\\\"color: #000000;\\\">c</span><span style=\\\"color: #0000FF;\\\">=</span><span style=\\\"color: #004600;\\\">K_F1</span> <span style=\\\"color: #008080;\\\">then</span> <span style=\\\"color: #008080;\\\">return</span> <span style=\\\"color: #000000;\\\">help_cb</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #004600;\\\">NULL</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: #004600;\\\">IUP_CONTINUE</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;\\\">main</span><span style=\\\"color: #0000FF;\\\">()</span>\\n <span style=\\\"color: #7060A8;\\\">IupOpen</span><span style=\\\"color: #0000FF;\\\">()</span>\\n <span style=\\\"color: #004080;\\\">Ihandle</span> <span style=\\\"color: #000000;\\\">canvas</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">IupGLCanvas</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #008000;\\\">\\\"RASTERSIZE=800x800\\\"</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #000000;\\\">dlg</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">IupDialog</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">canvas</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #008000;\\\">`TITLE=\\\"%s\\\",MINSIZE=245x180`</span><span style=\\\"color: #0000FF;\\\">,{</span><span style=\\\"color: #000000;\\\">title</span><span style=\\\"color: #0000FF;\\\">})</span>\\n <span style=\\\"color: #7060A8;\\\">IupSetCallbacks</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">canvas</span><span style=\\\"color: #0000FF;\\\">,{</span><span style=\\\"color: #008000;\\\">\\\"MAP_CB\\\"</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #7060A8;\\\">Icallback</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #008000;\\\">\\\"map_cb\\\"</span><span style=\\\"color: #0000FF;\\\">),</span>\\n <span style=\\\"color: #008000;\\\">\\\"ACTION\\\"</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #7060A8;\\\">Icallback</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #008000;\\\">\\\"redraw_cb\\\"</span><span style=\\\"color: #0000FF;\\\">),</span>\\n <span style=\\\"color: #008000;\\\">\\\"RESIZE_CB\\\"</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #7060A8;\\\">Icallback</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #008000;\\\">\\\"canvas_resize_cb\\\"</span><span style=\\\"color: #0000FF;\\\">),</span>\\n <span style=\\\"color: #008000;\\\">\\\"BUTTON_CB\\\"</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #7060A8;\\\">Icallback</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #008000;\\\">\\\"button_cb\\\"</span><span style=\\\"color: #0000FF;\\\">)})</span>\\n <span style=\\\"color: #7060A8;\\\">IupSetCallback</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">dlg</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #008000;\\\">\\\"KEY_CB\\\"</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #7060A8;\\\">Icallback</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #008000;\\\">\\\"key_cb\\\"</span><span style=\\\"color: #0000FF;\\\">))</span>\\n <span style=\\\"color: #7060A8;\\\">IupSetAttributeHandle</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #004600;\\\">NULL</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #008000;\\\">\\\"PARENTDIALOG\\\"</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">dlg</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #000000;\\\">new_game</span><span style=\\\"color: #0000FF;\\\">()</span>\\n <span style=\\\"color: #7060A8;\\\">IupShow</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">dlg</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #7060A8;\\\">IupSetAttribute</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">canvas</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #008000;\\\">\\\"RASTERSIZE\\\"</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: #7060A8;\\\">platform</span><span style=\\\"color: #0000FF;\\\">()!=</span><span style=\\\"color: #004600;\\\">JS</span> <span style=\\\"color: #008080;\\\">then</span>\\n <span style=\\\"color: #7060A8;\\\">IupMainLoop</span><span style=\\\"color: #0000FF;\\\">()</span>\\n <span style=\\\"color: #7060A8;\\\">IupClose</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;\\\">procedure</span>\\n\\n <span style=\\\"color: #000000;\\\">main</span><span style=\\\"color: #0000FF;\\\">()</span>\\n<!--\\n\",\n \"language\": \"Phix\"\n },\n {\n \"code\": \"<?php\\nconst BOARD_NUM = 9;\\nconst ROW_NUM = 3;\\n$EMPTY_BOARD_STR = str_repeat('.', BOARD_NUM);\\n\\nfunction isGameOver($board, $pin) {\\n\\t$pat =\\n\\t\\t'/X{3}|' . //Horz\\n\\t\\t'X..X..X..|' . //Vert Left\\n\\t\\t'.X..X..X.|' . //Vert Middle\\n\\t\\t'..X..X..X|' . //Vert Right\\n\\t\\t'..X.X.X..|' . //Diag TL->BR\\n\\t\\t'X...X...X|' . //Diag TR->BL\\n\\t\\t'[^\\\\.]{9}/i'; //Cat's game\\n\\tif ($pin == 'O') $pat = str_replace('X', 'O', $pat);\\n\\treturn preg_match($pat, $board);\\n}\\n\\n//Start\\n$boardStr = isset($_GET['b'])? $_GET['b'] : $EMPTY_BOARD_STR;\\n$turn = substr_count($boardStr, '.')%2==0? 'O' : 'X';\\n$oppTurn = $turn == 'X'? 'O' : 'X';\\n$gameOver = isGameOver($boardStr, $oppTurn);\\n\\n//Display board\\necho '<style>';\\necho 'td {width: 200px; height: 200px; text-align: center; }';\\necho '.pin {font-size:72pt; text-decoration:none; color: black}';\\necho '.pin.X {color:red}';\\necho '.pin.O {color:blue}';\\necho '</style>';\\necho '<table border=\\\"1\\\">';\\n$p = 0;\\nfor ($r = 0; $r < ROW_NUM; $r++) {\\n\\techo '<tr>';\\n\\tfor ($c = 0; $c < ROW_NUM; $c++) {\\n\\t\\t$pin = $boardStr[$p];\\n\\t\\t\\n\\t\\techo '<td>';\\t\\t\\n\\t\\tif ($gameOver || $pin != '.') echo '<span class=\\\"pin ', $pin, '\\\">', $pin, '</span>'; //Occupied\\n\\t\\telse { //Available\\n\\t\\t\\t$boardDelta = $boardStr;\\n\\t\\t\\t$boardDelta[$p] = $turn;\\t\\t\\n\\t\\t\\techo '<a class=\\\"pin ', $pin, '\\\" href=\\\"?b=', $boardDelta, '\\\">';\\n\\t\\t\\techo $boardStr[$p];\\n\\t\\t\\techo '</a>';\\n\\t\\t}\\n\\t\\t\\n\\t\\techo '</td>';\\t\\n\\t\\t$p++;\\n\\t}\\n\\techo '</tr>';\\n\\techo '<input type=\\\"hidden\\\" name=\\\"b\\\" value=\\\"', $boardStr, '\\\"/>';\\n}\\necho '</table>';\\necho '<a href=\\\"?b=', $EMPTY_BOARD_STR, '\\\">Reset</a>';\\nif ($gameOver) echo '<h1>Game Over!</h1>';\\n\",\n \"language\": \"PHP\"\n },\n {\n \"code\": \"(load \\\"@lib/simul.l\\\") # for 'game' function\\n\\n(de display ()\\n (for Y (3 2 1)\\n (prinl \\\" +---+---+---+\\\")\\n (prin \\\" \\\" Y)\\n (for X (1 2 3)\\n (prin \\\" | \\\" (or (get *Board X Y) \\\" \\\")) )\\n (prinl \\\" |\\\") )\\n (prinl \\\" +---+---+---+\\\")\\n (prinl \\\" a b c\\\") )\\n\\n(de find3 (P)\\n (find\\n '((X Y DX DY)\\n (do 3\\n (NIL (= P (get *Board X Y)))\\n (inc 'X DX)\\n (inc 'Y DY)\\n T ) )\\n (1 1 1 1 2 3 1 1)\\n (1 2 3 1 1 1 1 3)\\n (1 1 1 0 0 0 1 1)\\n (0 0 0 1 1 1 1 -1) ) )\\n\\n(de myMove ()\\n (when\\n (game NIL 8\\n '((Flg) # Moves\\n (unless (find3 (or (not Flg) 0))\\n (make\\n (for (X . L) *Board\\n (for (Y . P) L\\n (unless P\\n (link\\n (cons\\n (cons X Y (or Flg 0))\\n (list X Y) ) ) ) ) ) ) ) )\\n '((Mov) # Move\\n (set (nth *Board (car Mov) (cadr Mov)) (cddr Mov)) )\\n '((Flg) # Cost\\n (if (find3 (or Flg 0)) -100 0) ) )\\n (let Mov (caadr @)\\n (set (nth *Board (car Mov) (cadr Mov)) 0) )\\n (display) ) )\\n\\n(de yourMove (X Y)\\n (and\\n (sym? X)\\n (>= 3 (setq X (- (char X) 96)) 1)\\n (num? Y)\\n (>= 3 Y 1)\\n (not (get *Board X Y))\\n (set (nth *Board X Y) T)\\n (display) ) )\\n\\n(de main ()\\n (setq *Board (make (do 3 (link (need 3)))))\\n (display) )\\n\\n(de go Args\\n (cond\\n ((not (yourMove (car Args) (cadr Args)))\\n \\\"Illegal move!\\\" )\\n ((find3 T) \\\"Congratulation, you won!\\\")\\n ((not (myMove)) \\\"No moves\\\")\\n ((find3 0) \\\"Sorry, you lost!\\\") ) )\\n\",\n \"language\": \"PicoLisp\"\n },\n {\n \"code\": \"%!PS\\n%\\n% Play Tic-Tac-Toe against your printer\\n% 2024-04 Nicolas Seriot https://github.com/nst/PSTicTacToe\\n%\\n% On GhostScript:\\n% gs -DNOSAFER -dBATCH -dNOPAUSE -sDEVICE=pdfwrite -sOutputFile=\\\"%d.pdf\\\" ttt.ps\\n%\\n% On a real PostScript printer:\\n% cat ttt.ps - | nc 192.168.2.10 9100\\n\\n<</PageSize[595 842]>>setpagedevice/Courier findfont 48 scalefont setfont/b\\n(.........)def/f{/n 0 def b{46 eq{/n n 1 add def}if}forall n}def/w{/c exch def\\n[(O)(X)]{/p exch def[[0 1 2][3 4 5][6 7 8][0 3 6][1 4 7][2 5 8][0 4 8][2 4 6]]{\\n/t exch def/o true def t{/pos exch def/o c pos 1 getinterval p eq o and def}\\nforall o{exit}if}forall o{exit}if}forall o}def/g{/s exch def/m null def f 0 eq{\\n/m(TIE)def}if b w{/m(XXXXXXX WINS)def m 0 s putinterval}if()= 0 3 6{b exch 3\\ngetinterval =}for()= m null ne{m =}if 4 setlinewidth 200 700 moveto 200 400\\nlineto 300 700 moveto 300 400 lineto 100 600 moveto 400 600 lineto 100 500\\nmoveto 400 500 lineto stroke 0 1 b length 1 sub{/i exch def b i 1 getinterval\\n(.)ne{gsave 0 0 moveto 100 i 3 mod 100 mul add 35 add 700 i 3 idiv 100 mul sub\\n65 sub moveto b i 1 getinterval show grestore}if}for m null ne{100 300 moveto m\\nshow}if showpage m null ne{quit}if}def{/d false def 0 1 8{/i exch def/e b dup\\nlength string cvs def e i 1 getinterval(.)eq{[(X)(O)]{/p exch def e i p\\nputinterval e w{b i(X)putinterval/d true def exit}if}forall}if d{exit}if}for d\\nnot{/x rand f mod def/c 0 def 0 1 b length 1 sub{/i exch def b i 1 getinterval\\n(.)eq{c x eq{b i(X)putinterval exit}if/c c 1 add def}if}for}if(PRINTER)g b{\\n(human turn (1-9) >)print flush(%lineedit)(r)file( )readline pop dup length\\n0 gt{0 1 getinterval}{pop( )}ifelse/o exch def(123456789)o search{pop pop pop b\\no cvi 1 sub 1 getinterval(.)eq{o cvi 1 sub exit}if}{pop}ifelse(bad input) ==}\\nloop(O)putinterval(HUMAN )g}loop\\n\",\n \"language\": \"PostScript\"\n },\n {\n \"code\": \":- use_module('min-max.pl').\\n\\n:-dynamic box/2.\\n:- dynamic tic_tac_toe_window/1.\\n\\n% Computer begins.\\ntic-tac-toe(computer) :-\\n\\tV is random(9),\\n\\tTTT = [_,_,_,_,_,_ ,_,_,_],\\n\\tnth0(V, TTT, o),\\n\\tdisplay_tic_tac_toe(TTT).\\n\\n% Player begins\\ntic-tac-toe(me) :-\\n\\tTTT = [_,_,_,_,_,_ ,_,_,_],\\n\\tdisplay_tic_tac_toe(TTT).\\n\\n\\ndisplay_tic_tac_toe(TTT) :-\\n\\tretractall(box(_,_)),\\n\\tretractall(tic_tac_toe_window(_)),\\n\\tnew(D, window('Tic-tac-Toe')),\\n\\tsend(D, size, size(170,170)),\\n\\tX = 10, Y = 10,\\n\\tdisplay(D, X, Y, 0, TTT),\\n\\tassert(tic_tac_toe_window(D)),\\n\\tsend(D, open).\\n\\ndisplay(_, _, _, _, []).\\n\\ndisplay(D, X, Y, N, [A,B,C|R]) :-\\n\\tdisplay_line(D, X, Y, N, [A,B,C]),\\n\\tY1 is Y+50,\\n\\tN3 is N+3,\\n\\tdisplay(D, X, Y1, N3, R).\\n\\n\\ndisplay_line(_, _, _, _, []).\\ndisplay_line(D, X, Y, N, [C|R]) :-\\n\\t( nonvar(C)-> C1 = C; C1 = ' '),\\n\\tnew(B, tic_tac_toe_box(C1)),\\n\\tassertz(box(N, B)),\\n\\tsend(D, display, B, point(X, Y)),\\n\\tX1 is X + 50,\\n\\tN1 is N+1,\\n\\tdisplay_line(D, X1, Y, N1, R).\\n\\n\\n\\n% class tic_tac_toe_box\\n% display an 'x' when the player clicks\\n% display an 'o' when the computer plays\\n:- pce_begin_class(tic_tac_toe_box, box, \\\"Graphical window with text\\\").\\n\\nvariable(mess, any, both, \\\"text to display\\\").\\n\\ninitialise(P, Lbl) :->\\n\\tsend(P, send_super, initialise),\\n\\tsend(P, slot, mess, Lbl),\\n\\tWS = 50, HS = 50,\\n\\tsend(P, size, size(WS,HS)),\\n\\tsend(P, recogniser,\\n\\t handler_group(new(click_gesture(left,\\n\\t\\t\\t\\t\\t '',\\n\\t\\t\\t\\t\\t single,\\n\\t\\t\\t\\t\\t message(@receiver, my_click))))).\\n\\n% the box is clicked\\nmy_click(B) :->\\n\\tsend(B, set_val, x),\\n\\tsend(@prolog, play).\\n\\n% only works when the box is \\\"free\\\"\\nset_val(B, Val) :->\\n\\tget(B, slot, mess, ' '),\\n\\tsend(B, slot, mess, Val),\\n\\tsend(B, redraw),\\n\\tsend(B, flush).\\n\\n\\n% redefined method to display custom graphical objects.\\n'_redraw_area'(P, A:area) :->\\n\\tsend(P, send_super, '_redraw_area', A),\\n\\t%we display the text\\n\\tget(P, slot, mess, Lbl),\\n\\tnew(Str1, string(Lbl)),\\n\\tget_object(P, area, area(X,Y,W,H)),\\n\\tsend(P, draw_box, X, Y, W, H),\\n\\tsend(P, draw_text, Str1,\\n\\t\\tfont(times, normal, 30),\\n\\t\\tX, Y, W, H, center, center).\\n\\n:- pce_end_class.\\n\\nplay :-\\n\\tnumlist(0, 8, L),\\n\\tmaplist(init, L, TTT),\\n\\tfinished(x, TTT, Val),\\n\\t( Val = 2 -> send(@display, inform,'You win !'),\\n\\t tic_tac_toe_window(D),\\n\\t\\t send(D, destroy)\\n\\t; (\\tVal = 1 -> send(@display, inform,'Draw !'),\\n\\t tic_tac_toe_window(D),\\n\\t\\t send(D, destroy)\\n\\t ;\\tnext_move(TTT, TT1),\\n\\t\\tmaplist(display, L, TT1),\\n\\t\\tfinished(o, TT1, V),\\n\\t\\t( V = 2 -> send(@display, inform,'I win !'),\\n\\t\\t\\t tic_tac_toe_window(D),\\n\\t\\t send(D, destroy)\\n\\t\\t; (\\tV = 1 -> send(@display, inform,'Draw !'),\\n\\t\\t tic_tac_toe_window(D),\\n\\t\\t\\t send(D, destroy)\\n\\t\\t ;\\ttrue)))).\\n\\n\\n% use minmax to compute the next move\\nnext_move(TTT, TT1) :-\\n\\tminimax(o, 0, 1024, TTT, _V1- TT1).\\n\\n\\n% we display the new board\\ndisplay(I, V) :-\\n\\tnonvar(V),\\n\\tbox(I, V1),\\n\\tsend(V1, set_val, V).\\n\\ndisplay(_I, _V).\\n\\n% we create the board for minmax\\ninit(I, V) :-\\n\\tbox(I, V1),\\n\\tget(V1, slot, mess, V),\\n\\tV \\\\= ' '.\\n\\ninit(_I, _V).\\n\\n% winning position for the player P ?\\nwinned(P, [A1, A2, A3, A4, A5, A6, A7, A8, A9]) :-\\n (is_winning_line(P, [A1, A2, A3]);\\n\\tis_winning_line(P, [A4, A5, A6]);\\n\\tis_winning_line(P, [A7, A8, A9]);\\n\\tis_winning_line(P, [A1, A4, A7]);\\n\\tis_winning_line(P, [A2 ,A5, A8]);\\n\\tis_winning_line(P, [A3, A6, A9]);\\n\\tis_winning_line(P, [A1, A5, A9]);\\n\\tis_winning_line(P, [A3, A5, A7])).\\n\\n\\nis_winning_line(P, [A, B, C]) :-\\n\\tnonvar(A), A = P,\\n\\tnonvar(B), B = P,\\n\\tnonvar(C), C = P.\\n\\n% Winning position for the player\\neval(Player, Deep, TTT, V) :-\\n\\twinned(Player, TTT),\\n\\t( Player = o -> V is 1000 - 50 * Deep; V is -1000+ 50 * Deep).\\n\\n% Loosing position for the player\\neval(Player, Deep, TTT, V) :-\\n\\tselect(Player, [o,x], [Player1]),\\n\\twinned(Player1, TTT),\\n\\t( Player = x -> V is 1000 - 50 * Deep; V is -1000+ 50 * Deep).\\n\\n% Draw position\\neval(_Player, _Deep, TTT, 0) :-\\n\\tinclude(var, TTT, []).\\n\\n\\n% we fetch the free positions of the board\\npossible_move(TTT, LMove) :-\\n\\tnew(C, chain),\\n\\tforall(between(0,8, I),\\n\\t ( nth0(I, TTT, X),\\n\\t\\t ( var(X) -> send(C, append, I); true))),\\n\\tchain_list(C, LMove).\\n\\n% we create the new position when the player P clicks\\n% the box \\\"N\\\"\\nassign_move(P, TTT, N, TT1) :-\\n\\tcopy_term(TTT, TT1),\\n\\tnth0(N, TT1, P).\\n\\n% We fetch all the possible boards obtained from board TTT\\n% for the player P\\nget_next(Player, Deep, TTT, Player1, Deep1, L):-\\n\\tpossible_move(TTT, LMove),\\n\\tselect(Player, [o,x], [Player1]),\\n\\tDeep1 is Deep + 1,\\n\\tmaplist(assign_move(Player, TTT), LMove, L).\\n\\n\\n% The game is over ?\\n% Player P wins\\nfinished(P, TTT, 2) :-\\n\\twinned(P, TTT).\\n\\n% Draw\\nfinished(_P, TTT, 1) :-\\n\\tinclude(var, TTT, []).\\n\\n% the game is not over\\nfinished(_P, _TTT, 0) .\\n\\n% minmax must knows when the computer plays\\n% (o for ordinateur in French)\\ncomputer(o).\\n\",\n \"language\": \"Prolog\"\n },\n {\n \"code\": \":- module('min-max.pl', [minimax/5]).\\n\\n% minimax(Player, Deep, MaxDeep, B, V-B)\\n% @arg1 : current player at this level\\n% @arg2 : current level of recursion\\n% @arg3 : max level of recursion (in this version of the game no use : set to 1024 !)\\n% @arg4 : current board\\n% @arg5 : B is the evaluation of the board, the result is V-B to know the new board\\n\\n% Here we get an evaluation\\nminimax(Player, Deep, MaxDeep, B, V-B) :-\\n\\t( eval(Player, Deep, B, V) -> true\\n\\t; % in this version of the game this second division always fails\\n\\t( Deep > MaxDeep -> V is random(1000) - 1000)).\\n\\n% here we must compute all the possible moves to know the evaluation of the board\\nminimax(Player, Deep, MaxDeep, B, V) :-\\n\\tget_next(Player, Deep, B, Player1, Deep1, L),\\n\\tmaplist(minimax(Player1, Deep1, MaxDeep), L, LV),\\n\\tmaplist(lie, L, LV, TLV),\\n\\tsort(TLV, SLVTmp),\\n\\t( computer(Player) -> reverse(SLVTmp, SLV); SLV = SLVTmp),\\n\\tSLV = [V | _R].\\n\\n\\nlie(TTT, V-_, V-TTT).\\n\",\n \"language\": \"Prolog\"\n },\n {\n \"code\": \"'''\\n Tic-tac-toe game player.\\n Input the index of where you wish to place your mark at your turn.\\n'''\\n\\nimport random\\n\\nboard = list('123456789')\\nwins = ((0,1,2), (3,4,5), (6,7,8),\\n (0,3,6), (1,4,7), (2,5,8),\\n (0,4,8), (2,4,6))\\n\\ndef printboard():\\n print('\\\\n'.join(' '.join(board[x:x+3]) for x in(0,3,6)))\\n\\ndef score():\\n for w in wins:\\n b = board[w[0]]\\n if b in 'XO' and all (board[i] == b for i in w):\\n return b, [i+1 for i in w]\\n return None, None\\n\\ndef finished():\\n return all (b in 'XO' for b in board)\\n\\ndef space():\\n return [ b for b in board if b not in 'XO']\\n\\ndef my_turn(xo):\\n options = space()\\n choice = random.choice(options)\\n board[int(choice)-1] = xo\\n return choice\\n\\ndef your_turn(xo):\\n options = space()\\n while True:\\n choice = input(\\\" Put your %s in any of these positions: %s \\\"\\n % (xo, ''.join(options))).strip()\\n if choice in options:\\n break\\n print( \\\"Whoops I don't understand the input\\\" )\\n board[int(choice)-1] = xo\\n return choice\\n\\ndef me(xo='X'):\\n printboard()\\n print('I go at', my_turn(xo))\\n return score()\\n assert not s[0], \\\"\\\\n%s wins across %s\\\" % s\\n\\ndef you(xo='O'):\\n printboard()\\n # Call my_turn(xo) below for it to play itself\\n print('You went at', your_turn(xo))\\n return score()\\n assert not s[0], \\\"\\\\n%s wins across %s\\\" % s\\n\\n\\nprint(__doc__)\\nwhile not finished():\\n s = me('X')\\n if s[0]:\\n printboard()\\n print(\\\"\\\\n%s wins across %s\\\" % s)\\n break\\n if not finished():\\n s = you('O')\\n if s[0]:\\n printboard()\\n print(\\\"\\\\n%s wins across %s\\\" % s)\\n break\\nelse:\\n print('\\\\nA draw')\\n\",\n \"language\": \"Python\"\n },\n {\n \"code\": \"'''\\n Tic-tac-toe game player.\\n Input the index of where you wish to place your mark at your turn.\\n'''\\n\\nimport random\\n\\nboard = list('123456789')\\nwins = ((0,1,2), (3,4,5), (6,7,8),\\n (0,3,6), (1,4,7), (2,5,8),\\n (0,4,8), (2,4,6))\\n\\ndef printboard():\\n print('\\\\n-+-+-\\\\n'.join('|'.join(board[x:x+3]) for x in(0,3,6)))\\n\\ndef score(board=board):\\n for w in wins:\\n b = board[w[0]]\\n if b in 'XO' and all (board[i] == b for i in w):\\n return b, [i+1 for i in w]\\n return None\\n\\ndef finished():\\n return all (b in 'XO' for b in board)\\n\\ndef space(board=board):\\n return [ b for b in board if b not in 'XO']\\n\\ndef my_turn(xo, board):\\n options = space()\\n choice = random.choice(options)\\n board[int(choice)-1] = xo\\n return choice\\n\\ndef my_better_turn(xo, board):\\n 'Will return a next winning move or block your winning move if possible'\\n ox = 'O' if xo =='X' else 'X'\\n oneblock = None\\n options = [int(s)-1 for s in space(board)]\\n for choice in options:\\n brd = board[:]\\n brd[choice] = xo\\n if score(brd):\\n break\\n if oneblock is None:\\n brd[choice] = ox\\n if score(brd):\\n oneblock = choice\\n else:\\n choice = oneblock if oneblock is not None else random.choice(options)\\n board[choice] = xo\\n return choice+1\\n\\ndef your_turn(xo, board):\\n options = space()\\n while True:\\n choice = input(\\\"\\\\nPut your %s in any of these positions: %s \\\"\\n % (xo, ''.join(options))).strip()\\n if choice in options:\\n break\\n print( \\\"Whoops I don't understand the input\\\" )\\n board[int(choice)-1] = xo\\n return choice\\n\\ndef me(xo='X'):\\n printboard()\\n print('\\\\nI go at', my_better_turn(xo, board))\\n return score()\\n\\ndef you(xo='O'):\\n printboard()\\n # Call my_turn(xo, board) below for it to play itself\\n print('\\\\nYou went at', your_turn(xo, board))\\n return score()\\n\\n\\nprint(__doc__)\\nwhile not finished():\\n s = me('X')\\n if s:\\n printboard()\\n print(\\\"\\\\n%s wins along %s\\\" % s)\\n break\\n if not finished():\\n s = you('O')\\n if s:\\n printboard()\\n print(\\\"\\\\n%s wins along %s\\\" % s)\\n break\\nelse:\\n print('\\\\nA draw')\\n\",\n \"language\": \"Python\"\n },\n {\n \"code\": \"' Tic-tac-toe\\n\\nDECLARE FUNCTION Win% (Piece AS STRING)\\nDECLARE FUNCTION SpacesFilled% ()\\nDECLARE SUB ClearBoard ()\\nDECLARE SUB DisplayNumberedBoard ()\\nDECLARE SUB DisplayPiecedBoard ()\\nDECLARE FUNCTION Evaluate% (Me AS STRING, Him AS STRING)\\n\\nDIM SHARED Board(8) AS STRING * 1, BestMove AS INTEGER\\nDIM SHARED WinPos(7, 2) AS INTEGER\\nDIM SHARED MyPiece AS STRING, HisPiece AS STRING\\n\\nFOR I = 0 TO 7\\n FOR J = 0 TO 2\\n READ WinPos(I, J)\\n NEXT J\\nNEXT I\\n' Winning positions\\nDATA 0, 1, 2, 3, 4, 5, 6, 7, 8, 0, 3, 6, 1, 4, 7, 2, 5, 8, 0, 4, 8, 2, 4, 6\\nMyWinsCnt = 0: HisWinsCnt = 0: DrawsCnt = 0\\nCompFirst = -1 ' It be reversed, so human goes first\\nCLS\\nPRINT\\nPRINT \\\" TIC-TAC-TOE\\\"\\nPRINT\\nPRINT \\\"In this version, X always goes first.\\\"\\nPRINT \\\"The board is numbered:\\\"\\nDO\\n CompFirst = NOT CompFirst ' reverse who goes first\\n MovesCnt = 0\\n PRINT\\n DisplayNumberedBoard\\n PRINT\\n IF CompFirst THEN PRINT \\\"I go first.\\\" ELSE PRINT \\\"You go first. \\\";\\n ClearBoard\\n IF CompFirst THEN MyPiece = \\\"X\\\": HisPiece = \\\"O\\\" ELSE MyPiece = \\\"O\\\": HisPiece = \\\"X\\\"\\n ' -1: human; 1: computer; 0: nobody\\n IF CompFirst THEN Mover = 1 ELSE Mover = -1\\n WHILE Mover <> 0\\n SELECT CASE Mover\\n CASE 1\\n IF MovesCnt = 0 THEN\\n BestMove = INT(RND * 9)\\n ELSEIF MovesCnt = 1 THEN\\n IF Board(4) <> \\\" \\\" THEN BestMove = INT(RND * 2) * 6 + INT(RND * 2) * 2 ELSE BestMove = 4\\n ELSE\\n T = Evaluate(MyPiece, HisPiece)\\n END IF\\n Board(BestMove) = MyPiece\\n MovesCnt = MovesCnt + 1\\n PRINT\\n CALL DisplayPiecedBoard\\n PRINT\\n IF Win(MyPiece) THEN\\n MyWinsCnt = MyWinsCnt + 1\\n PRINT \\\"I win!\\\"\\n Mover = 0\\n ELSEIF SpacesFilled THEN\\n DrawsCnt = DrawsCnt + 1\\n PRINT \\\"It's a draw. Thank you.\\\"\\n Mover = 0\\n ELSE\\n Mover = -1\\n END IF\\n CASE -1\\n DO\\n INPUT \\\"Where do you move? \\\", I\\n IF I < 1 OR I > 9 THEN\\n PRINT \\\"Illegal! \\\";\\n ELSEIF Board(I - 1) <> \\\" \\\" THEN\\n PRINT \\\"Place already occupied. \\\";\\n ELSE\\n EXIT DO\\n END IF\\n LOOP\\n Board(I - 1) = HisPiece\\n MovesCnt = MovesCnt + 1\\n PRINT\\n CALL DisplayPiecedBoard\\n PRINT\\n IF Win(HisPiece) THEN\\n HisWinsCnt = HisWinsCnt + 1\\n PRINT \\\"You beat me! Good game.\\\"\\n Mover = 0\\n ELSEIF SpacesFilled THEN\\n DrawsCnt = DrawsCnt + 1\\n PRINT \\\"It's a draw. Thank you.\\\"\\n Mover = 0\\n ELSE\\n Mover = 1\\n END IF\\n END SELECT\\n WEND\\n PRINT\\n INPUT \\\"Another game (y/n)? \\\", Answ$\\nLOOP UNTIL UCASE$(Answ$) <> \\\"Y\\\"\\nPRINT\\nPRINT \\\"Final score:\\\"\\nPRINT \\\"You won\\\", HisWinsCnt; \\\"game\\\";\\nIF HisWinsCnt <> 1 THEN PRINT \\\"s\\\";\\nPRINT \\\".\\\"\\nPRINT \\\"I won\\\", MyWinsCnt; \\\"game\\\";\\nIF MyWinsCnt <> 1 THEN PRINT \\\"s\\\";\\nPRINT \\\".\\\"\\nPRINT \\\"We tied\\\", DrawsCnt; \\\"game\\\";\\nIF DrawsCnt <> 1 THEN PRINT \\\"s\\\";\\nPRINT \\\".\\\"\\nPRINT \\\"See you later!\\\"\\nEND\\n\\nSUB ClearBoard\\n FOR I = 0 TO 8: Board(I) = \\\" \\\": NEXT I\\nEND SUB\\n\\nSUB DisplayNumberedBoard\\n FOR I = 0 TO 8 STEP 3\\n PRINT I + 1; \\\"|\\\"; I + 2; \\\"|\\\"; I + 3\\n IF I <> 6 THEN PRINT \\\"---+---+---\\\"\\n NEXT I\\nEND SUB\\n\\nSUB DisplayPiecedBoard\\n FOR I = 0 TO 8 STEP 3\\n PRINT \\\" \\\"; Board(I); \\\" | \\\"; Board(I + 1); \\\" | \\\"; Board(I + 2)\\n IF I <> 6 THEN PRINT \\\"---+---+---\\\"\\n NEXT I\\nEND SUB\\n\\nFUNCTION Evaluate% (Me AS STRING, Him AS STRING)\\n ' Recursive algorithm\\n IF Win(Me) THEN Evaluate = 1: EXIT FUNCTION\\n IF Win(Him) THEN Evaluate = -1: EXIT FUNCTION\\n IF SpacesFilled THEN Evaluate = 0: EXIT FUNCTION\\n LoseFlag = 1\\n FOR I = 0 TO 8\\n IF Board(I) = \\\" \\\" THEN\\n Board(I) = Me ' Try the move.\\n V = Evaluate(Him, Me)\\n Board(I) = \\\" \\\" ' Restore the empty space.\\n IF V = -1 THEN BestMove = I: Evaluate = 1: EXIT FUNCTION\\n IF V = 0 THEN LoseFlag = 0: SafeMove = I\\n END IF\\n NEXT\\n BestMove = SafeMove\\n Evaluate = -LoseFlag\\nEND FUNCTION\\n\\nFUNCTION SpacesFilled%\\n FOR I = 0 TO 8\\n IF Board(I) = \\\" \\\" THEN SpacesFilled = 0: EXIT FUNCTION\\n NEXT I\\n SpacesFilled = -1\\nEND FUNCTION\\n\\nFUNCTION Win% (Piece AS STRING)\\n FOR I = 0 TO 7\\n IF Board(WinPos(I, 0)) = Piece AND Board(WinPos(I, 1)) = Piece AND Board(WinPos(I, 2)) = Piece THEN Win = -1: EXIT FUNCTION\\n NEXT I\\n Win = 0\\nEND FUNCTION\\n\",\n \"language\": \"QuickBASIC\"\n },\n {\n \"code\": \"rm(list=ls())\\nlibrary(RColorBrewer)\\n\\n\\n# Create tic.tac.toe function.\\n\\n\\ntic.tac.toe <- function(name=\\\"Name\\\", mode=0, type=0){\\n\\n place.na <<- matrix(1:9, 3, 3)\\n value <<- matrix(-3, 3, 3)\\n k <<- 1 ; r <<- 0\\n\\n\\n # Make game board.\\n\\n\\n image(1:3, 1:3, matrix(sample(9), 3, 3), asp=c(1, 1),\\n xaxt=\\\"n\\\", yaxt=\\\"n\\\", xlab=\\\"\\\", ylab=\\\"\\\", frame=F, col=brewer.pal(9, \\\"Set3\\\"))\\n segments(c(0.5,0.5,1.5,2.5), c(2.5,1.5,0.5,0.5),\\n c(3.5,3.5,1.5,2.5), c(2.5,1.5,3.5,3.5), lwd=8, col=gray(0.3))\\n segments(c(0.5,0.5,0.5,3.5), c(0.52,3.47,0.5,0.5),\\n c(3.5,3.5,0.5,3.5), c(0.52,3.47,3.5,3.5), lwd=8, col=gray(0.3))\\n\\n\\n # Allow player to choose between a human v. human, human v. random AI, or human vs. smart AI.\\n\\n if(mode==0) title(list(paste(name, \\\"'s Tic-Tac-Toe !\\\"), cex=2),\\n \\\"2P : Human v.s. Human\\\", font.sub=2, cex.sub=2)\\n if(mode==1) title(list(paste(name, \\\"'s Tic-Tac-Toe !\\\"), cex=2),\\n \\\"1P : Human v.s. AI (Easy)\\\", font.sub=2, cex.sub=2)\\n if(mode==2) title(list(paste(name, \\\"'s Tic-Tac-Toe !\\\"), cex=2),\\n \\\"1P : Human v.s. AI (Hard)\\\", font.sub=2, cex.sub=2)\\n\\n\\n # Dole out symbols.\\n\\n if(type==0){symbol <- \\\"O\\\" ; symbol.op <- \\\"X\\\"}\\n if(type==1){symbol <- \\\"X\\\" ; symbol.op <- \\\"O\\\"}\\n out <- list(name=name, mode=mode, type=type, symbol=symbol, symbol.op=symbol.op)\\n}\\n\\n# Checks if the game has ended.\\n\\nisGameOver <- function(){\\n\\n for(i in 1:3){\\n total.1 <- 0 ; total.2 <- 0\\n for(j in 1:3){\\n total.1 <- total.1 + value[i, j]\\n total.2 <- total.2 + value[j, i]\\n }\\n if(total.1==0 | total.2==0 | total.1==3 | total.2==3){\\n break\\n }\\n }\\n total.3 <- value[1, 1] + value[2, 2] + value[3, 3]\\n total.4 <- value[1, 3] + value[2, 2] + value[3, 1]\\n\\n if(total.1==0 | total.2==0 | total.3==0 | total.4==0 | total.1==3 | total.2==3 | total.3==3 | total.4==3){\\n place.na[!is.na(place.na)] <<- NA\\n if(total.1==0 | total.2==0 | total.3==0 | total.4==0){\\n title(sub=list(\\\"You Won ?! That's a first!\\\", col=\\\"red\\\", font=2, cex=2.5), line=2)\\n }else{\\n title(sub=list(\\\"You Don't Get Tired of Losing ?!\\\", col=\\\"darkblue\\\", font=2, cex=2.5), line=2)\\n }\\n }\\n\\n if(all(is.na(place.na))){\\n if(total.1==0 | total.2==0 | total.3==0 | total.4==0 | total.1==3 | total.2==3 | total.3==3 | total.4==3){\\n if(total.1==0 | total.2==0 | total.3==0 | total.4==0){\\n title(sub=list(\\\"You Won ! Pigs Must Be Flying!\\\", col=\\\"orange\\\", font=2, cex=2.5), line=2)\\n }else{\\n title(sub=list(\\\"You Lost ... Once Again !\\\", col=\\\"darkblue\\\", font=2, cex=2.5), line=2)\\n }\\n }else{\\n title(sub=list(\\\"A measly tie! Try Again\\\", col=\\\"blue\\\", font=2, cex=2.5), line=2)\\n }\\n }\\n}\\n\\n\\n# AI attack function\\n\\n\\nattack <- function(){\\n ### Identify rows and columns\\n for(i in 1:3){\\n total.1 <- 0 ; total.2 <- 0\\n for(j in 1:3){\\n total.1 <- total.1 + value[i, j]\\n total.2 <- total.2 + value[j, i]\\n }\\n if(total.1==-1 | total.2==-1){\\n break\\n }\\n }\\n total.3 <- value[1, 1] + value[2, 2] + value[3, 3]\\n total.4 <- value[1, 3] + value[2, 2] + value[3, 1]\\n\\n if(total.1==-1){\\n text(i, which(value[i,]!=1), symbol.op, cex=6, font=2)\\n place.na[i, which(value[i,]!=1)] <<- NA\\n value[i, which(value[i,]!=1)] <<- 1\\n }else if(total.2==-1){\\n text(which(value[,i]!=1), i, symbol.op, cex=6, font=2)\\n place.na[which(value[,i]!=1), i] <<- NA\\n value[which(value[,i]!=1), i] <<- 1\\n }else if(total.3==-1){\\n r.1 <- which(c(value[1, 1], value[2, 2], value[3, 3])!=1)\\n text(r.1, r.1, symbol.op, cex=6, font=2)\\n place.na[r.1, r.1] <<- NA\\n value[r.1, r.1] <<- 1\\n }else if(total.4==-1){\\n r.2 <- which(c(value[1, 3], value[2, 2], value[3, 1])!=1)\\n text(r.2, -r.2+4, symbol.op, cex=6, font=2)\\n place.na[r.2, -r.2+4] <<- NA\\n value[r.2, -r.2+4] <<- 1\\n }\\n}\\n\\n\\n# AI defense function\\n\\n\\ndefend <- function(){\\n\\n for(i in 1:3){\\n total.1 <- 0 ; total.2 <- 0\\n for(j in 1:3){\\n total.1 <- total.1 + value[i, j]\\n total.2 <- total.2 + value[j, i]\\n }\\n if(total.1==-3 | total.2==-3){\\n break\\n }\\n }\\n total.3 <- value[1, 1] + value[2, 2] + value[3, 3]\\n total.4 <- value[1, 3] + value[2, 2] + value[3, 1]\\n\\n if(total.1==-3){\\n text(i, which(value[i,]!=0), symbol.op, cex=6, font=2)\\n place.na[i, which(value[i,]!=0)] <<- NA\\n value[i, which(value[i,]!=0)] <<- 1\\n }else if(total.2==-3){\\n text(which(value[,i]!=0), i, symbol.op, cex=6, font=2)\\n place.na[which(value[,i]!=0), i] <<- NA\\n value[which(value[,i]!=0), i] <<- 1\\n }else if(total.3==-3){\\n r.1 <- which(c(value[1, 1], value[2, 2], value[3, 3])!=0)\\n text(r.1, r.1, symbol.op, cex=6, font=2)\\n place.na[r.1, r.1] <<- NA\\n value[r.1, r.1] <<- 1\\n }else if(total.4==-3){\\n r.2 <- which(c(value[1, 3], value[2, 2], value[3, 1])!=0)\\n text(r.2, -r.2+4, symbol.op, cex=6, font=2)\\n place.na[r.2, -r.2+4] <<- NA\\n value[r.2, -r.2+4] <<- 1\\n }else{\\n rn <- sample(place.na[!is.na(place.na)], 1)\\n text(rn-3*rn%/%3.5, rn%/%3.5+1, symbol.op, cex=6, font=2)\\n place.na[rn-3*rn%/%3.5, rn%/%3.5+1] <<- NA\\n value[rn-3*rn%/%3.5, rn%/%3.5+1] <<- 1\\n }\\n}\\n\\n\\n# Allow aim in program.\\n\\n\\naim <- function(x, y, tic.tac.toe=ttt){\\n\\n mode <- tic.tac.toe$mode\\n symbol <<- tic.tac.toe$symbol\\n symbol.op <<- tic.tac.toe$symbol.op\\n x <<- x ; y <<- y\\n\\n\\n # Mode 0, Two Players\\n\\n\\n if(mode==0){\\n turn <- rep(c(0, 1), length.out=9)\\n if(is.na(place.na[x, y])){\\n cat(\\\"This square is taken !\\\")\\n }else{\\n\\n if(turn[k]==0){\\n text(x, y, symbol, cex=6, font=2)\\n place.na[x, y] <<- NA\\n value[x, y] <<- 0\\n }\\n if(turn[k]==1){\\n text(x, y, symbol.op, cex=6, font=2)\\n place.na[x, y] <<- NA\\n value[x, y] <<- 1\\n }\\n k <<- k + 1\\n }\\n }\\n\\n\\n # Mode 1, Random AI\\n\\n\\n if(mode==1){\\n if(is.na(place.na[x, y])){\\n cat(\\\"This square had been chosen !\\\")\\n }else{\\n text(x, y, symbol, cex=6, font=2)\\n place.na[x, y] <<- NA\\n value[x, y] <<- 0\\n isGameOver()\\n\\n for(i in 1:3){\\n total.1 <- 0 ; total.2 <- 0\\n for(j in 1:3){\\n total.1 <- total.1 + value[i, j]\\n total.2 <- total.2 + value[j, i]\\n }\\n if(total.1==-1 | total.2==-1){\\n break\\n }\\n }\\n total.3 <- value[1, 1] + value[2, 2] + value[3, 3]\\n total.4 <- value[1, 3] + value[2, 2] + value[3, 1]\\n\\n if(all(is.na(place.na))){\\n isGameOver()\\n }else if(total.1==-1 | total.2==-1 | total.3==-1 | total.4==-1){\\n attack()\\n }else{\\n defend()\\n }\\n }\\n }\\n\\n\\n\\n # Mode 2, Hard AI\\n\\n\\n if(mode==2){\\n\\n if(is.na(place.na[x, y])){\\n cat(\\\"This square is taken!\\\")\\n }else{\\n\\n\\n # AI First Turn\\n\\n\\n if(sum(is.na(place.na))==0){\\n\\n text(x, y, symbol, cex=6, font=2)\\n place.na[x, y] <<- NA\\n value[x, y] <<- 0\\n\\n if(is.na(place.na[2, 2])==F){\\n text(2, 2, symbol.op, cex=6, font=2)\\n place.na[2, 2] <<- NA\\n value[2, 2] <<- 1\\n }else{\\n corner.1 <- sample(c(1, 3), 1) ; corner.2 <- sample(c(1, 3), 1)\\n text(corner.1, corner.2, symbol.op, cex=6, font=2)\\n place.na[corner.1, corner.2] <<- NA\\n value[corner.1, corner.2] <<- 1\\n }\\n\\n\\n # AI Second Turn\\n\\n\\n }else if(sum(is.na(place.na))==2){\\n text(x, y, symbol, cex=6, font=2)\\n place.na[x, y] <<- NA\\n value[x, y] <<- 0\\n\\n for(i in 1:3){\\n total.1 <- 0 ; total.2 <- 0\\n for(j in 1:3){\\n total.1 <- total.1 + value[i, j]\\n total.2 <- total.2 + value[j, i]\\n }\\n if(total.1==-3 | total.2==-3){\\n break\\n }\\n }\\n total.3 <- value[1, 1] + value[2, 2] + value[3, 3]\\n total.4 <- value[1, 3] + value[2, 2] + value[3, 1]\\n\\n if(total.1==-3 | total.2==-3 | total.3==-3 | total.4==-3){\\n defend()\\n }else{\\n total.1 <- value[2, 1] + value[2, 2] + value[2, 3]\\n total.2 <- value[1, 2] + value[2, 2] + value[3, 2]\\n total.3 <- value[1, 1] + value[2, 2] + value[3, 3]\\n total.4 <- value[1, 3] + value[2, 2] + value[3, 1]\\n if(total.1==1 | total.2==1 | total.3==1 | total.4==1){\\n if((value[2, 2]==1 & total.3==1) | (value[2, 2]==1 & total.4==1)){\\n vector.side <- c(place.na[2, 1], place.na[1, 2], place.na[3, 2], place.na[2, 3])\\n rn <- sample(vector.side[!is.na(vector.side)], 1)\\n text(rn-3*rn%/%3.5, rn%/%3.5+1, symbol.op, cex=6, font=2)\\n place.na[rn-3*rn%/%3.5, rn%/%3.5+1] <<- NA\\n value[rn-3*rn%/%3.5, rn%/%3.5+1] <<- 1\\n }else{\\n matrix.cor <- place.na[c(1, 3), c(1, 3)]\\n rn <- sample(matrix.cor[!is.na(matrix.cor)], 1)\\n text(rn-3*rn%/%3.5, rn%/%3.5+1, symbol.op, cex=6, font=2)\\n place.na[rn-3*rn%/%3.5, rn%/%3.5+1] <<- NA\\n value[rn-3*rn%/%3.5, rn%/%3.5+1] <<- 1\\n }\\n }else{\\n if((x==1 & y==2) | (x==3 & y==2)){\\n rn <- sample(c(1, 3), 1)\\n text(x, rn, symbol.op, cex=6, font=2)\\n place.na[x, rn] <<- NA\\n value[x, rn] <<- 1\\n }else if((x==2 & y==3) | (x==2 & y==1)){\\n rn <- sample(c(1, 3), 1)\\n text(rn, y, symbol.op, cex=6, font=2)\\n place.na[rn, y] <<- NA\\n value[rn, y] <<- 1\\n }else if((x==1 & y==1) | (x==1 & y==3) | (x==3 & y==1) | (x==3 & y==3)){\\n text(-x+4, -y+4, symbol.op, cex=6, font=2)\\n place.na[-x+4, -y+4] <<- NA\\n value[-x+4, -y+4] <<- 1\\n }\\n }\\n }\\n\\n\\n # AI Other Turn\\n\\n\\n }else{\\n text(x, y, symbol, cex=6, font=2)\\n place.na[x, y] <<- NA\\n value[x, y] <<- 0\\n isGameOver()\\n\\n for(i in 1:3){\\n total.1 <- 0 ; total.2 <- 0\\n for(j in 1:3){\\n total.1 <- total.1 + value[i, j]\\n total.2 <- total.2 + value[j, i]\\n }\\n if(total.1==-1 | total.2==-1){\\n break\\n }\\n }\\n total.3 <- value[1, 1] + value[2, 2] + value[3, 3]\\n total.4 <- value[1, 3] + value[2, 2] + value[3, 1]\\n\\n if(all(is.na(place.na))){\\n isGameOver()\\n }else if(total.1==-1 | total.2==-1 | total.3==-1 | total.4==-1){\\n attack()\\n }else{\\n defend()\\n }\\n }\\n }\\n }\\n isGameOver()\\n}\\n\\n\\n# Allow users to click on program.\\n\\n\\nclick <- function(tic.tac.toe=ttt){\\n name <- tic.tac.toe$name\\n mode <- tic.tac.toe$mode\\n type <- tic.tac.toe$type\\n\\n while(length(place.na)==9){\\n mouse.at <- locator(n = 1, type = \\\"n\\\")\\n #cat(mouse.at$x,\\\"\\\\t\\\", mouse.at$y, \\\"\\\\n\\\")\\n x.at <- round(mouse.at$x)\\n y.at <- round(mouse.at$y)\\n #cat(x.at,\\\"\\\\t\\\", y.at, \\\"\\\\n\\\")\\n if(all(is.na(place.na))){\\n ttt <<- tic.tac.toe(name, mode, type)\\n }else if(x.at > 3.5 | x.at < 0.5 | y.at > 3.5 | y.at < 0.5){\\n r <<- r + 1\\n title(sub=list(\\\"Click outside:Quit / inside:Restart\\\", col=\\\"deeppink\\\", font=2, cex=2), line=2)\\n if(r==2){\\n dev.off()\\n break\\n }\\n }else{\\n if(r==1){\\n ttt <<- tic.tac.toe(name, mode, type)\\n }else{\\n aim(x.at, y.at)\\n }\\n }\\n }\\n}\\n\\n\\n# Play the game\\n\\n\\nstart <- function(name=\\\"Name\\\", mode=0, type=0){\\n x11()\\n ttt <<- tic.tac.toe(name, mode, type)\\n click()\\n}\\n\\n#start(\\\"name\\\", \\\"mode\\\" = 0 - 2, type = 0,1)\\n\",\n \"language\": \"R\"\n },\n {\n \"code\": \"#lang lazy\\n(provide minimax)\\n\\n(define (minimax tree)\\n (! (let minimax ([node tree] [α -inf.0] [β +inf.0] [max-player #f])\\n (cond\\n [(number? node) node]\\n [(empty? node) 0.0]\\n [max-player\\n (let next ([x node] [α α])\\n (if (or (empty? x) (<= β α))\\n α\\n (next (cdr x)\\n (max α (minimax (car x) α β (not max-player))))))]\\n [else\\n (let next ([x node] [β β])\\n (if (or (empty? x) (<= β α))\\n β\\n (next (cdr x)\\n (min β (minimax (car x) α β (not max-player))))))]))))\\n\",\n \"language\": \"Racket\"\n },\n {\n \"code\": \"#lang lazy\\n(require racket/class\\n \\\"minimax.rkt\\\"\\n (only-in racket/list shuffle argmax))\\n\\n(provide game%\\n interactive-player\\n define-partners)\\n\\n;;--------------------------------------------------------------------\\n;; Class representing the logics and optimal strategy\\n;; for a zero-sum game with perfect information.\\n(define game%\\n (class object%\\n (super-new)\\n\\n ;; virtual methods which set up the game rules\\n (init-field my-win? ; State -> Bool\\n my-loss? ; State -> Bool\\n draw-game? ; State -> Bool\\n my-move ; State Move -> State\\n opponent-move ; State Move -> State\\n possible-moves ; State -> (list Move)\\n show-state) ; State -> Any\\n\\n ;; optimal-move :: State -> Move\\n ;; Choses the optimal move.\\n ;; If several equivalent moves exist -- choses one randomly.\\n (define/public ((optimal-move look-ahead) S)\\n (! (argmax (λ (m) (! (minimax (game-tree S m look-ahead))))\\n (shuffle (possible-moves S)))))\\n\\n ;; game-tree :: State -> (Move -> (Treeof Real))\\n (define (game-tree S m look-ahead)\\n (let new-ply ([moves (cycle opponent-move my-move)]\\n [i 1]\\n [s (my-move S m)])\\n (cond\\n [(my-win? s) (/ 1 i)] ; more close wins and loses\\n [(my-loss? s) (/ -1 i)] ; have bigger weights\\n [(draw-game? s) 0]\\n [(>= i look-ahead) (/ 1 i)]\\n [else (map (λ (x) (new-ply (cdr moves) (+ 1 i) ((car moves) s x)))\\n (possible-moves s))])))\\n\\n ;; make-move :: State (State -> Move) -> (Move State Symbol)\\n (define/public (make-move S move)\\n (cond\\n [(my-loss? S) (values '() S 'loss)]\\n [(draw-game? S) (values '() S 'draw)]\\n [else (let* ([m* (! (move S))]\\n [S* (my-move S m*)])\\n (cond\\n [(my-win? S*) (values m* S* 'win)]\\n [(draw-game? S*) (values m* S* 'draw)]\\n [else (values m* S* 'next)]))]))))\\n\\n;;--------------------------------------------------------------------\\n;; Mixin representing an interactive game player.\\n;; The parameter `game` defines a game which is played.\\n(define (interactive-player game)\\n (class game\\n (super-new)\\n\\n (inherit-field show-state)\\n (inherit make-move optimal-move)\\n\\n (init-field name\\n [look-ahead 4]\\n [opponent 'undefined]\\n [move-method (optimal-move look-ahead)])\\n\\n (define/public (your-turn S)\\n (define-values (m S* status) (make-move S move-method))\\n (! (printf \\\"\\\\n~a makes move ~a\\\\n\\\" name m))\\n (! (show-state S*))\\n (! (case status\\n ['stop (displayln \\\"The game was interrupted.\\\")]\\n ['win (printf \\\"~a wins!\\\" name)]\\n ['loss (printf \\\"~a wins!\\\" name)]\\n ['draw (printf \\\"Draw!\\\")]\\n [else (send opponent your-turn S*)])))))\\n\\n\\n;;--------------------------------------------------------------------\\n;; a simple macro for initialization of game partners\\n(define-syntax-rule\\n (define-partners game (A #:win A-wins #:move A-move)\\n (B #:win B-wins #:move B-move))\\n (begin\\n (define A (class game\\n (super-new\\n [my-win? A-wins]\\n [my-loss? B-wins]\\n [my-move A-move]\\n [opponent-move B-move])))\\n (define B (class game\\n (super-new\\n [my-win? B-wins]\\n [my-loss? A-wins]\\n [my-move B-move]\\n [opponent-move A-move])))))\\n\\n;;--------------------------------------------------------------------\\n;; the main procedure which initiates the game\\n(define (start-game p1 p2 initial-state)\\n (set-field! opponent p1 p2)\\n (set-field! opponent p2 p1)\\n (send p1 your-turn initial-state))\\n\",\n \"language\": \"Racket\"\n },\n {\n \"code\": \"#lang racket\\n\\n(require \\\"game.rkt\\\"\\n racket/set\\n lazy/force)\\n\\n;;--------------------------------------------------------------------\\n;; Tick-tack-toe game implementation\\n\\n;; the structure representing a board\\n(struct board (x o))\\n\\n;; sets of X's and O's\\n(define xs board-x)\\n(define os board-o)\\n\\n(define empty-board (board (set) (set)))\\n\\n(define all-cells\\n (set '(1 1) '(1 2) '(1 3)\\n '(2 1) '(2 2) '(2 3)\\n '(3 1) '(3 2) '(3 3)))\\n\\n(define (free-cells b)\\n (set-subtract all-cells (xs b) (os b)))\\n\\n(define winning-positions\\n (list (set '(1 1) '(2 2) '(3 3))\\n (set '(1 3) '(2 2) '(3 1))\\n (set '(1 1) '(1 2) '(1 3))\\n (set '(2 1) '(2 2) '(2 3))\\n (set '(3 1) '(3 2) '(3 3))\\n (set '(1 1) '(2 1) '(3 1))\\n (set '(1 2) '(2 2) '(3 2))\\n (set '(1 3) '(2 3) '(3 3))))\\n\\n;; a predicate for winning state on the board\\n(define ((wins? s) b)\\n (ormap (curryr subset? (s b)) winning-positions))\\n\\n;; player moves\\n(define (x-move b m) (board (set-add (xs b) m) (os b)))\\n(define (o-move b m) (board (xs b) (set-add (os b) m)))\\n\\n;; textual representation of the board\\n(define (show-board b)\\n (for ([i '(3 2 1)])\\n (printf \\\"~a \\\" i)\\n (for ([j '(1 2 3)])\\n (display (cond\\n [(set-member? (os b) (list j i)) \\\"|o\\\"]\\n [(set-member? (xs b) (list j i)) \\\"|x\\\"]\\n [else \\\"| \\\"])))\\n (display \\\"|\\\\n\\\"))\\n (display \\\" 1 2 3 \\\"))\\n\\n;;--------------------------------------------------------------------\\n;; The definition of the game\\n;; general properties\\n(define tic-tac%\\n (class game%\\n (super-new\\n [draw-game? (compose set-empty? free-cells)]\\n [possible-moves (compose set->list free-cells)]\\n [show-state show-board])))\\n\\n;; players\\n(define-partners tic-tac%\\n (x% #:win (wins? xs) #:move x-move)\\n (o% #:win (wins? os) #:move o-move))\\n\\n;; Computer players\\n(define player-A (new (interactive-player x%) [name \\\"A\\\"] [look-ahead 6]))\\n\\n(define player-B (new (interactive-player o%) [name \\\"B\\\"] [look-ahead 6]))\\n\\n; The interactive user\\n(define User\\n (new (interactive-player x%)\\n [name \\\"User\\\"]\\n [move-method\\n (λ (b) (let make-move ([m (read)])\\n (match m\\n ['q (exit)]\\n [(list (or 1 2 3) (or 1 2 3)) m]\\n [else (make-move (read))])))]))\\n\\n;; The dummy player plays randomly\\n(define Dummy\\n (new (interactive-player o%) [name \\\"Dummy\\\"] [look-ahead 0]))\\n\",\n \"language\": \"Racket\"\n },\n {\n \"code\": \"#lang racket\\n\\n(require \\\"game.rkt\\\"\\n lazy/force)\\n\\n;;--------------------------------------------------------------------\\n;; The definition of the game\\n\\n(define initial-state '(3 5 7))\\n\\n(define (move s m) (map - s m))\\n\\n(define (win? s) (= 1 (apply + s)))\\n\\n(define (show-state s) (displayln (map (λ (n) (make-list n '●)) s)))\\n\\n(define (possible-moves S)\\n (append-map\\n (λ (heap n)\\n (map (λ (x) (map (curry * x) heap))\\n (range 1 (+ 1 (min 3 n)))))\\n '((1 0 0) (0 1 0) (0 0 1)) S))\\n\\n(define Nim% (class game%\\n (super-new\\n [draw-game? (const #f)]\\n [possible-moves possible-moves]\\n [show-state show-state])))\\n\\n(define-partners Nim%\\n (first% #:win win? #:move move)\\n (second% #:win win? #:move move))\\n\\n;; players\\n(define player-A\\n (new (interactive-player first%) [name \\\"A\\\"] [look-ahead 4]))\\n\\n(define player-B\\n (new (interactive-player second%) [name \\\"B\\\"] [look-ahead 4]))\\n\",\n \"language\": \"Racket\"\n },\n {\n \"code\": \"my @board = 1..9;\\nmy @winning-positions = [0..2], [3..5], [6..8], [0,3,6], [1,4,7], [2,5,8],\\n\\t[0,4,8], [6,4,2];\\n\\nsub get-winner() {\\n\\tfor @winning-positions {\\n return (@board[|$_][0], $_) if [eq] @board[|$_];\\n\\t}\\n}\\n\\nsub free-indexes() {\\n\\t@board.keys.grep: { @board[$_] eq any(1..9) }\\n}\\n\\nsub ai-move() {\\n\\tgiven free-indexes.pick {\\n\\t\\t@board[$_] = 'o';\\n\\t\\tsay \\\"I go at: { $_ + 1 }\\\\n\\\";\\n\\t}\\n}\\n\\nsub print-board() {\\n print \\\"\\\\e[2J\\\";\\n say @board.map({ \\\"$^a | $^b | $^c\\\" }).join(\\\"\\\\n--+---+--\\\\n\\\"), \\\"\\\\n\\\";\\n}\\n\\nsub human-move() {\\n\\tmy $pos = prompt \\\"Choose one of { (free-indexes() »+» 1).join(\\\",\\\") }: \\\";\\n\\tif $pos eq any(free-indexes() »+» 1) {\\n\\t\\t@board[$pos - 1] = 'x';\\n\\t} else {\\n\\t\\tsay \\\"Sorry, you want to put your 'x' where?\\\";\\n\\t\\thuman-move();\\n\\t}\\n}\\n\\nfor flat (&ai-move, &human-move) xx * {\\n\\tprint-board;\\n last if get-winner() or not free-indexes;\\n .();\\n}\\n\\nif get-winner() -> ($player, $across) {\\n\\tsay \\\"$player wins across [\\\", ($across »+» 1).join(\\\", \\\"), \\\"].\\\";\\n} else {\\n\\tsay \\\"How boring, a draw!\\\";\\n}\\n\",\n \"language\": \"Raku\"\n },\n {\n \"code\": \"' Tic-tac-toe\\n' Console application\\n\\nDECLARE FUNCTION Win (Piece AS STRING) AS INTEGER\\nDECLARE FUNCTION SpacesFilled () AS INTEGER\\nDECLARE SUB ClearBoard ()\\nDECLARE SUB DisplayNumberedBoard ()\\nDECLARE SUB DisplayPiecedBoard ()\\nDECLARE FUNCTION Evaluate (Me AS STRING, Him AS STRING) AS INTEGER\\n\\nDIM Board(8) AS STRING * 1, BestMove AS INTEGER\\nDIM WinPos(7, 2) AS INTEGER\\nDIM MyPiece AS STRING, HisPiece AS STRING\\n\\nFOR I = 0 TO 7\\n FOR J = 0 TO 2\\n READ WinPos(I, J)\\n NEXT J\\nNEXT I\\n' Winning positions\\nDATA 0, 1, 2, 3, 4, 5, 6, 7, 8, 0, 3, 6, 1, 4, 7, 2, 5, 8, 0, 4, 8, 2, 4, 6\\nMyWinsCnt = 0: HisWinsCnt = 0: DrawsCnt = 0\\nCompFirst = -1 ' It be reversed, so human goes first\\nCLS\\nPRINT\\nPRINT \\\" TIC-TAC-TOE\\\"\\nPRINT\\nPRINT \\\"In this version, X always goes first.\\\"\\nPRINT \\\"The board is numbered:\\\"\\nDO\\n CompFirst = NOT CompFirst ' reverse who goes first\\n MovesCnt = 0\\n PRINT\\n DisplayNumberedBoard\\n PRINT\\n PRINT IIF(CompFirst, \\\"I go first.\\\", \\\"You go first.\\\")\\n ClearBoard\\n IF CompFirst THEN MyPiece = \\\"X\\\": HisPiece = \\\"O\\\" ELSE MyPiece = \\\"O\\\": HisPiece = \\\"X\\\"\\n ' -1: human; 1: computer; 0: nobody\\n Mover = IIF(CompFirst, 1, -1)\\n WHILE Mover <> 0\\n SELECT CASE Mover\\n CASE 1\\n IF MovesCnt = 0 THEN\\n BestMove = INT(RND * 9)\\n ELSEIF MovesCnt = 1 THEN\\n BestMove = IIF(Board(4) <> \\\" \\\", INT(RND * 2) * 6 + INT(RND * 2) * 2, 4)\\n ELSE\\n T = Evaluate(MyPiece, HisPiece)\\n END IF\\n Board(BestMove) = MyPiece\\n INC(MovesCnt)\\n PRINT\\n CALL DisplayPiecedBoard\\n PRINT\\n IF Win(MyPiece) THEN\\n INC(MyWinsCnt)\\n PRINT \\\"I win!\\\"\\n Mover = 0\\n ELSEIF SpacesFilled THEN\\n INC(DrawsCnt)\\n PRINT \\\"It's a draw. Thank you.\\\"\\n Mover = 0\\n ELSE\\n Mover = -1\\n END IF\\n CASE -1\\n DO\\n INPUT \\\"Where do you move? \\\",I\\n IF I < 1 OR I > 9 THEN\\n PRINT \\\"Illegal! \\\";\\n ELSEIF Board(I - 1) <> \\\" \\\" THEN\\n PRINT \\\"Place already occupied. \\\";\\n ELSE\\n EXIT DO\\n END IF\\n LOOP\\n Board(I - 1) = HisPiece\\n INC(MovesCnt)\\n PRINT\\n CALL DisplayPiecedBoard\\n PRINT\\n IF Win(HisPiece) THEN\\n INC(HisWinsCnt)\\n PRINT \\\"You beat me! Good game.\\\"\\n Mover = 0\\n ELSEIF SpacesFilled THEN\\n INC(DrawsCnt)\\n PRINT \\\"It's a draw. Thank you.\\\"\\n Mover = 0\\n ELSE\\n Mover = 1\\n END IF\\n END SELECT\\n WEND\\n PRINT\\n INPUT \\\"Another game (y/n)? \\\", Answ$\\nLOOP UNTIL UCASE$(Answ$) <> \\\"Y\\\"\\nPRINT\\nPRINT \\\"Final score:\\\"\\nPRINT \\\"You won \\\"; HisWinsCnt; \\\" game\\\"; IIF(HisWinsCnt <> 1, \\\"s.\\\", \\\".\\\")\\nPRINT \\\"I won \\\"; MyWinsCnt; \\\" game\\\"; IIF(MyWinsCnt <> 1, \\\"s.\\\", \\\".\\\")\\nPRINT \\\"We tied \\\"; DrawsCnt; \\\" game\\\"; IIF(DrawsCnt <> 1, \\\"s.\\\", \\\".\\\")\\nPRINT \\\"See you later!\\\"\\nEND\\n\\nSUB ClearBoard\\n FOR I = 0 TO 8: Board(I) = \\\" \\\": NEXT I\\nEND SUB\\n\\nSUB DisplayNumberedBoard\\n FOR I = 0 TO 8 STEP 3\\n PRINT \\\" \\\"; I + 1; \\\" | \\\"; I + 2; \\\" | \\\"; I + 3\\n IF I <> 6 THEN PRINT \\\"---+---+---\\\"\\n NEXT I\\nEND SUB\\n\\nSUB DisplayPiecedBoard\\n FOR I = 0 TO 8 STEP 3\\n PRINT \\\" \\\"; Board(I); \\\" | \\\"; Board(I + 1); \\\" | \\\"; Board(I + 2)\\n IF I <> 6 THEN PRINT \\\"---+---+---\\\"\\n NEXT I\\nEND SUB\\n\\nFUNCTION Evaluate (Me AS STRING, Him AS STRING)\\n ' Recursive algorithm\\n DIM I AS INTEGER, SafeMove AS INTEGER, V AS INTEGER, LoseFlag AS INTEGER\\n IF Win(Me) THEN Evaluate = 1: EXIT FUNCTION\\n IF Win(Him) THEN Evaluate = -1: EXIT FUNCTION\\n IF SpacesFilled THEN Evaluate = 0: EXIT FUNCTION\\n LoseFlag = 1\\n I = 0\\n WHILE I <= 8\\n IF Board(I) = \\\" \\\" THEN\\n Board(I) = Me ' Try the move.\\n V = Evaluate(Him, Me)\\n Board(I) = \\\" \\\" ' Restore the empty space.\\n IF V = -1 THEN BestMove = I: Evaluate = 1: EXIT FUNCTION\\n IF V = 0 THEN LoseFlag = 0: SafeMove = I\\n END IF\\n INC(I)\\n WEND\\n BestMove = SafeMove\\n Evaluate = -LoseFlag\\nEND FUNCTION\\n\\nFUNCTION SpacesFilled\\n FOR I = 0 TO 8\\n IF Board(I) = \\\" \\\" THEN SpacesFilled = 0: EXIT FUNCTION\\n NEXT I\\n SpacesFilled = -1\\nEND FUNCTION\\n\\nFUNCTION Win (Piece AS STRING)\\n FOR I = 0 TO 7\\n IF Board(WinPos(I, 0)) = Piece AND Board(WinPos(I, 1)) = Piece AND Board(WinPos(I, 2)) = Piece THEN Win = -1: EXIT FUNCTION\\n NEXT I\\n Win = 0\\nEND FUNCTION\\n\",\n \"language\": \"RapidQ\"\n },\n {\n \"code\": \"/*REXX program plays (with a human) the tic─tac─toe game on an NxN grid. */\\n$= copies('─', 9) /*eyecatcher for error messages, prompt*/\\noops = $ '***error*** ' /*literal for when an error happens. */\\nsingle = '│─┼'; jam= \\\"║\\\"; bar= '═'; junc= \\\"╬\\\"; dbl=jam || bar || junc\\nsw = linesize() - 1 /*obtain width of the terminal (less 1)*/\\nparse arg N hm cm .,@. /*obtain optional arguments from the CL*/\\nif N=='' | N==\\\",\\\" then N=3; oN=N /*N not specified? Then use default.*/\\n N = abs(N) /*if N < 0. then computer goes first. */\\n NN = N*N /*calculate the square of N. */\\nmiddle = NN % 2 + N % 2 /* \\\" \\\" middle \\\" the grid. */\\nif N<2 then do; say oops 'tic─tac─toe grid is too small: ' N; exit 13; end\\npad= left('', sw % NN) /*display padding: 6x6 in 80 columns.*/\\nif hm=='' then hm= \\\"X\\\"; /*define the marker for a human. */\\nif cm=='' then cm= \\\"O\\\" /* \\\" \\\" \\\" \\\" the computer. */\\n hm= aChar(hm, 'human') /*determine if the marker is legitimate*/\\n cm= aChar(cm, 'computer') /* \\\" \\\" \\\" \\\" \\\" \\\" */\\nparse upper value hm cm with uh uc /*use uppercase values is markers: X x*/\\nif uh==uc then cm= word('O X', 1 + (uh==\\\"O\\\") ) /*The human wants Hal's marker? Swap. */\\nif oN<0 then call Hmove middle /*Hal moves first? Then choose middling*/\\n else call showGrid /*showGrid also checks for wins & draws*/\\n\\n/*tic─tac─toe game───►*/ do forever /*'til the cows come home (or QUIT). */\\n/*tic─tac─toe game───►*/ call CBLF /*process carbon─based lifeform's move.*/\\n/*tic─tac─toe game───►*/ call Hal /*determine Hal's (the computer) move.*/\\n/*tic─tac─toe game───►*/ end /*forever*/ /*showGrid subroutine does wins & draws*/\\n/*──────────────────────────────────────────────────────────────────────────────────────*/\\naChar: parse arg x,whoseX; L=length(x) /*process markers.*/\\n if L==1 then return testB( x ) /*1 char, as is. */\\n if L==2 & datatype(x, 'X') then return testB( x2c(x) ) /*2 chars, hex. */\\n if L==3 & datatype(x, 'W') & , /*3 chars, decimal*/\\n x>=0 & x<256 then return testB( d2c(x) ) /*···and in range.*/\\n say oops 'illegal character or character code for' whoseX \\\"marker: \\\" x\\n exit 13 /*stick a fork in it, we're all done. */\\n/*──────────────────────────────────────────────────────────────────────────────────────*/\\nCBLF: prompt='Please enter a cell number to place your next marker ['hm\\\"] (or Quit):\\\"\\n\\n do forever; say $ prompt\\n parse pull x 1 ux 1 ox; upper ux /*get versions of answer; uppercase ux*/\\n if datatype(ox, 'W') then ox=ox / 1 /*normalize cell number: +0007 ───► 7 */\\n /*(division by unity normalizes a num.)*/\\n select /*perform some validations of X (cell#)*/\\n when abbrev('QUIT',ux,1) then call tell 'quitting.'\\n when x='' then iterate /*Nada? Try again.*/\\n when words(x)\\\\==1 then say oops \\\"too many\\\" cell# 'specified:' x\\n when \\\\datatype(x, 'N') then say oops \\\"cell number isn't numeric: \\\" x\\n when \\\\datatype(x, 'W') then say oops \\\"cell number isn't an integer: \\\" x\\n when x=0 then say oops \\\"cell number can't be zero: \\\" x\\n when x<0 then say oops \\\"cell number can't be negative: \\\" x\\n when x>NN then say oops \\\"cell number can't exceed \\\" NN\\n when @.ox\\\\=='' then say oops \\\"cell number is already occupied: \\\" x\\n otherwise leave /*forever*/\\n end /*select*/\\n\\n end /*forever*/\\n /* [↓] OX is a normalized version of X*/\\n @.ox= hm /*place a marker for the human (CLBF). */\\n call showGrid /*and display the tic─tac─toe grid. */\\n return\\n/*──────────────────────────────────────────────────────────────────────────────────────*/\\nHal: select /*Hal tries various moves. */\\n when win(cm, N-1) then call Hmove , ec /*is this the winning move?*/\\n when win(hm, N-1) then call Hmove , ec /* \\\" \\\" a blocking \\\" */\\n when @.middle== '' then call Hmove middle /*pick the center cell. */\\n when @.N.N == '' then call Hmove , N N /*bottom right corner cell.*/\\n when @.N.1 == '' then call Hmove , N 1 /* \\\" left \\\" \\\" */\\n when @.1.N == '' then call Hmove , 1 N /* top right \\\" \\\" */\\n when @.1.1 == '' then call Hmove , 1 1 /* \\\" left \\\" \\\" */\\n otherwise call Hmove , ac /*pick a blank cell in grid*/\\n end /*select*/\\n return\\n/*──────────────────────────────────────────────────────────────────────────────────────*/\\nHmove: parse arg Hplace,dr dc; if Hplace=='' then Hplace = (dr - 1)*N + dc\\n @.Hplace= cm /*place computer's marker. */\\n say; say $ 'computer places a marker ['cm\\\"] at cell number \\\" Hplace\\n call showGrid\\n return\\n/*──────────────────────────────────────────────────────────────────────────────────────*/\\nshowGrid: _= 0; cW= 5; cH= 3; open= 0 /*cell width, cell height.*/\\n do r=1 for N /*construct array of cells.*/\\n do c=1 for N; _= _ + 1; @.r.c= @._; open= open | @._==''\\n end /*c*/\\n end /*r*/ /* [↑] OPEN≡a cell is open*/\\n say /* [↑] create grid coörds.*/\\n z= 0; do j=1 for N /* [↓] show grids&markers.*/\\n do t=1 for cH; _=; __= /*MK is a marker in a cell.*/\\n do k=1 for N; if t==2 then z= z + 1; mk=; c#=\\n if t==2 then do; mk= @.z; c#= z /*c# is cell number*/\\n end\\n _= _ || jam || center(mk, cW)\\n __= __ || jam || center(c#, cW)\\n end /*k*/\\n say pad substr(_, 2) pad translate( substr(__, 2), single, dbl)\\n end /*t*/ /* [↑] show a line*/\\n if j==N then leave\\n _=\\n do b=1 for N; _= _ || junc || copies(bar, cW)\\n end /*b*/ /* [↑] a grid part*/\\n say pad substr(_, 2) pad translate( substr(_, 2), single, dbl)\\n end /*j*/\\n say\\n if win(hm) then call tell 'You ('hm\\\") won\\\"copies('!',random(1, 5) )\\n if win(cm) then call tell 'The computer ('cm\\\") won.\\\"\\n if \\\\open then call tell 'This tic─tac─toe game is a draw (a cat scratch).'\\n return\\n/*──────────────────────────────────────────────────────────────────────────────────────*/\\ntell: do 4; say; end; say center(' 'arg(1)\\\" \\\", sw, '─'); do 5; say; end; exit\\n/*──────────────────────────────────────────────────────────────────────────────────────*/\\ntestB: parse arg bx; if bx\\\\==' ' then return bx /*test if the marker isn't a blank.*/\\n say oops 'character code for' whoseX \\\"marker can't be a blank.\\\"\\n exit 13 /*stick a fork in it, we're all done. */\\n/*──────────────────────────────────────────────────────────────────────────────────────*/\\nwin: parse arg wm,w; if w=='' then w= N /* [↓] see if there is a win. */\\n ac= /* [↓] EC ≡ means Empty Cell. */\\n do r=1 for N; _= 0; ec= /*see if any rows are a winner*/\\n do c=1 for N; _= _ + (@.r.c==wm) /*count the # of markers in col*/\\n if @.r.c=='' then ec= r c /*Cell empty? Then remember it*/\\n end /*c*/ /* [↓] AC≡means available cell*/\\n if ec\\\\=='' then ac=ec /*Found an empty? Then use it.*/\\n if _==N | (_>=w & ec\\\\=='') then return 1==1 /*a winner has been determined.*/\\n end /*r*/ /*w=N-1? Checking for near win*/\\n\\n do c=1 for N; _= 0; ec= /*see if any cols are a winner*/\\n do r=1 for N; _= _ + (@.r.c==wm) /*count the # of markers in row*/\\n if @.r.c=='' then ec= r c /*Cell empty? Then remember it*/\\n end /*r*/\\n if ec\\\\=='' then ac= ec /*Found an empty? Then remember*/\\n if _==N | (_>=w & ec\\\\=='') then return 1==1 /*a winner has been determined.*/\\n end /*c*/\\n _= 0; ec= /*EC≡location of an empty cell.*/\\n do d=1 for N; _= _ + (@.d.d==wm) /*A winning descending diag. ? */\\n if @.d.d=='' then ec= d d /*Empty cell? Then note cell #*/\\n end /*d*/\\n\\n if _==N | (_>=w & ec\\\\=='') then return 1==1 /*a winner has been determined.*/\\n _= 0; r= 1\\n do c=N for N by -1; _=_ + (@.r.c==wm) /*A winning ascending diagonal?*/\\n if @.r.c=='' then ec= r c /*Empty cell? Then note cell #*/\\n r= r + 1 /*bump the counter for the rows*/\\n end /*c*/\\n\\n if _==N | (_>=w & ec\\\\=='') then return 1==1 /*a winner has been determined.*/\\n return 0==1 /*no winner \\\" \\\" \\\" */\\n\",\n \"language\": \"REXX\"\n },\n {\n \"code\": \"Load \\\"guilib.ring\\\"\\n\\n#Provide a list to save each button status in numeric readable format\\n#0=nothing 1=X 2=O\\nlst=[]\\n\\n#Provide onScreen button status and style\\nbtns=[]\\n\\n#Define who has the turn\\nisXTurn=true\\n\\n\\n app=new qApp\\n {\\n\\n frmMain=new qMainWindow()\\n\\t\\t{\\n\\t\\t\\tsetWindowTitle(\\\"TicTacToe!\\\")\\n\\t\\t\\tresize(300,320)\\n\\t\\t\\tmove(200,200)\\n\\t\\t\\t//buttons\\n\\t\\t\\tpos=0\\n\\t\\t\\tfor y=0 to 2\\n\\t\\t\\t\\tfor x=0 to 2\\n\\t\\t\\t\\t//Creating Buttons on the screen\\n\\t\\t\\t\\t\\tpos++\\n\\t\\t\\t\\t\\tAdd(lst,0)\\n\\t\\t\\t\\t\\tAdd(btns,new qPushButton(frmMain)\\n\\t\\t\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\t\\t\\tsetGeometry(x*100,y*100,100,100)\\n\\t\\t\\t\\t\\t\\t\\tsetText(\\\"-\\\")\\n\\t\\t\\t\\t\\t\\t\\tsetclickevent(\\\"Disp(\\\" + pos +\\\")\\\")\\n\\t\\t\\t\\t\\t\\t\\tsetstylesheet(\\\"font-size:24pt ; font: bold ; color:yellow ; background-color: green\\\")\\n\\t\\t\\t\\t\\t\\t})\\n\\t\\t\\t\\tnext\\n next\\n\\t\\t\\t//StatusBar\\n\\t\\t\\tstatus=new qStatusBar(frmMain)\\n\\t\\t\\t{\\n showMessage(\\\"Ready\\\",0)\\n }\\n\\t\\t\\tsetwindowflags(Qt_dialog)\\n\\t\\t\\tsetStatusbar(status)\\n\\t\\t\\tshow()\\n }\\n\\t\\texec()\\n\\t}\\n\\n//Restart the game by re init buttons status\\nfunc reStart\\n for i=1 to 9\\n lst[i]=0\\n btns[i].setText(\\\"-\\\")\\n next\\nisXTurn=true\\n\\nfunc Disp x\\n if isXTurn=true and lst[x]=0\\n\\t\\tbtns[x].setText(\\\"X\\\")\\n\\t\\tlst[x]=1\\n\\t\\tisXTurn=false\\n\\tbut isXTurn=false and lst[x]=0\\n btns[x].setText(\\\"O\\\")\\n lst[x]=2\\n isXTurn=true\\n ok\\n\\n\\twinner = CheckWinner()\\n\\t#if there is no Winner and still there is ability to winner\\n\\t#continue playing.\\n\\tif winner<1 return ok\\n\\n\\t//Who is the winner!\\n switch winner\\n on 1\\n new qMessagebox(frmMain)\\n {\\n\\t\\t\\t\\tSetWindowTitle(\\\"We have a winner!\\\")\\n SetText(\\\"Good job X you won!\\\")\\n show()\\n }\\n on 2\\n\\t\\t\\tnew qMessagebox(frmMain)\\n {\\n\\t\\t\\t\\tSetWindowTitle(\\\"We have a winner!\\\")\\n SetText(\\\"Good job O you won!\\\")\\n show()\\n }\\n on 3\\n new qMessagebox(frmMain)\\n {\\n SetWindowTitle(\\\"Oh no it's a tie\\\")\\n SetText(\\\"Oh no it's a tie!\\\")\\n show()\\n }\\n off\\n reStart()\\n\\nfunc CheckWinner\\n //vertical check\\n for v=1 to 9 step 3\\n if lst[v]!=0 and lst[v+1]!=0 and lst[v+2]!=0\\n\\t\\t\\t\\tif lst[v]=lst[v+1] and lst[v+1]=lst[v+2]\\n return lst[v]\\n ok\\n ok\\n next\\n //horzintal\\n for h=1 to 3\\n if lst[h]!=0 and lst[h+3]!=0 and lst[h+6]!=0\\n if lst[h]=lst[h+3] and lst[h+3]=lst[h+6]\\n return lst[h]\\n ok\\n ok\\n next\\n //Cross\\n if lst[1]!=0 and lst[5]!=0 and lst[9]!=0\\n if lst[1]=lst[5] and lst[5]=lst[9] return lst[1] ok\\n ok\\n if lst[3]!=0 and lst[5]!=0 and lst[7]!=0\\n if lst[3]=lst[5] and lst[5]=lst[7] return lst[3] ok\\n ok\\n //tie\\n tie=true\\n for i=1 to 9\\n if lst[i]=0 tie=false exit ok\\n next\\n if tie=true return 3 ok return 0\\n\",\n \"language\": \"Ring\"\n },\n {\n \"code\": \"module TicTacToe\\n LINES = [[1,2,3],[4,5,6],[7,8,9],[1,4,7],[2,5,8],[3,6,9],[1,5,9],[3,5,7]]\\n\\n class Game\\n def initialize(player_1_class, player_2_class)\\n @board = Array.new(10) # we ignore index 0 for convenience\\n\\n @current_player_id = 0\\n @players = [player_1_class.new(self, \\\"X\\\"), player_2_class.new(self, \\\"O\\\")]\\n puts \\\"#{current_player} goes first.\\\"\\n end\\n attr_reader :board, :current_player_id\\n\\n def play\\n loop do\\n place_player_marker(current_player)\\n\\n if player_has_won?(current_player)\\n puts \\\"#{current_player} wins!\\\"\\n print_board\\n return\\n elsif board_full?\\n puts \\\"It's a draw.\\\"\\n print_board\\n return\\n end\\n\\n switch_players!\\n end\\n end\\n\\n def free_positions\\n (1..9).select {|position| @board[position].nil?}\\n end\\n\\n def place_player_marker(player)\\n position = player.select_position!\\n puts \\\"#{player} selects #{player.marker} position #{position}\\\"\\n @board[position] = player.marker\\n end\\n\\n def player_has_won?(player)\\n LINES.any? do |line|\\n line.all? {|position| @board[position] == player.marker}\\n end\\n end\\n\\n def board_full?\\n free_positions.empty?\\n end\\n\\n def other_player_id\\n 1 - @current_player_id\\n end\\n\\n def switch_players!\\n @current_player_id = other_player_id\\n end\\n\\n def current_player\\n @players[current_player_id]\\n end\\n\\n def opponent\\n @players[other_player_id]\\n end\\n\\n def turn_num\\n 10 - free_positions.size\\n end\\n\\n def print_board\\n col_separator, row_separator = \\\" | \\\", \\\"--+---+--\\\"\\n label_for_position = lambda{|position| @board[position] ? @board[position] : position}\\n\\n row_for_display = lambda{|row| row.map(&label_for_position).join(col_separator)}\\n row_positions = [[1,2,3], [4,5,6], [7,8,9]]\\n rows_for_display = row_positions.map(&row_for_display)\\n puts rows_for_display.join(\\\"\\\\n\\\" + row_separator + \\\"\\\\n\\\")\\n end\\n end\\n\\n class Player\\n def initialize(game, marker)\\n @game = game\\n @marker = marker\\n end\\n attr_reader :marker\\n end\\n\\n class HumanPlayer < Player\\n def select_position!\\n @game.print_board\\n loop do\\n print \\\"Select your #{marker} position: \\\"\\n selection = gets.to_i\\n return selection if @game.free_positions.include?(selection)\\n puts \\\"Position #{selection} is not available. Try again.\\\"\\n end\\n end\\n\\n def to_s\\n \\\"Human\\\"\\n end\\n end\\n\\n class ComputerPlayer < Player\\n DEBUG = false # edit this line if necessary\\n\\n def group_positions_by_markers(line)\\n markers = line.group_by {|position| @game.board[position]}\\n markers.default = []\\n markers\\n end\\n\\n def select_position!\\n opponent_marker = @game.opponent.marker\\n\\n winning_or_blocking_position = look_for_winning_or_blocking_position(opponent_marker)\\n return winning_or_blocking_position if winning_or_blocking_position\\n\\n if corner_trap_defense_needed?\\n return corner_trap_defense_position(opponent_marker)\\n end\\n\\n # could make this smarter by sometimes doing corner trap offense\\n\\n return random_prioritized_position\\n end\\n\\n def look_for_winning_or_blocking_position(opponent_marker)\\n for line in LINES\\n markers = group_positions_by_markers(line)\\n next if markers[nil].length != 1\\n if markers[self.marker].length == 2\\n log_debug \\\"winning on line #{line.join}\\\"\\n return markers[nil].first\\n elsif markers[opponent_marker].length == 2\\n log_debug \\\"could block on line #{line.join}\\\"\\n blocking_position = markers[nil].first\\n end\\n end\\n if blocking_position\\n log_debug \\\"blocking at #{blocking_position}\\\"\\n return blocking_position\\n end\\n end\\n\\n def corner_trap_defense_needed?\\n corner_positions = [1, 3, 7, 9]\\n opponent_chose_a_corner = corner_positions.any?{|pos| @game.board[pos] != nil}\\n return @game.turn_num == 2 && opponent_chose_a_corner\\n end\\n\\n def corner_trap_defense_position(opponent_marker)\\n # if you respond in the center or the opposite corner, the opponent can force you to lose\\n log_debug \\\"defending against corner start by playing adjacent\\\"\\n # playing in an adjacent corner could also be safe, but would require more logic later on\\n opponent_position = @game.board.find_index {|marker| marker == opponent_marker}\\n safe_responses = {1=>[2,4], 3=>[2,6], 7=>[4,8], 9=>[6,8]}\\n return safe_responses[opponent_position].sample\\n end\\n\\n def random_prioritized_position\\n log_debug \\\"picking random position, favoring center and then corners\\\"\\n ([5] + [1,3,7,9].shuffle + [2,4,6,8].shuffle).find do |pos|\\n @game.free_positions.include?(pos)\\n end\\n end\\n\\n def log_debug(message)\\n puts \\\"#{self}: #{message}\\\" if DEBUG\\n end\\n\\n def to_s\\n \\\"Computer#{@game.current_player_id}\\\"\\n end\\n end\\nend\\n\\ninclude TicTacToe\\n\\nGame.new(ComputerPlayer, ComputerPlayer).play\\nputs\\nplayers_with_human = [HumanPlayer, ComputerPlayer].shuffle\\nGame.new(*players_with_human).play\\n\",\n \"language\": \"Ruby\"\n },\n {\n \"code\": \"' ---------------------------\\n' TIC TAC TOE\\n' ---------------------------\\nwinBox$ = \\\"123 456 789 159 147 258 369 357\\\"\\nboxPos$ = \\\"123 231 456 564 789 897 159 591 357 753 132 465 798 174 285 396 159 471 582 693 147 258 369 195 375\\\"\\nai$ = \\\"519628374\\\"\\nox$ = \\\"OX\\\"\\n[newGame]\\nfor i = 1 to 9\\n box$(i) = \\\"\\\"\\nnext i\\ngoto [shoTic]\\n\\n[loop]\\nfor j = 1 to 2\\n tic$ = mid$(ox$,j,1)\\n for i = 1 to 25\\n b$\\t= word$(boxPos$,i,\\\" \\\")\\n b1\\t= val(mid$(b$,1,1))\\n b2\\t= val(mid$(b$,2,1))\\n b3\\t= val(mid$(b$,3,1))\\n if box$(b1) = tic$ AND box$(b2) = tic$ AND box$(b3) = \\\"\\\" then\\n box$(b3) = \\\"O\\\"\\n goto [shoTic]\\n end if\\n next i\\nnext j\\nif box$(1) = \\\"O\\\" AND box$(5) = \\\"X\\\" and box$(9) = \\\"X\\\" then\\n if box$(3) = \\\"\\\" then\\n box$(3) = \\\"O\\\"\\n goto [shoTic]\\n end if\\n if box$(7) = \\\"\\\" then\\n box$(7) = \\\"O\\\"\\n goto [shoTic]\\n end if\\nend if\\nfor i = 1 to 9\\n b1 = val(mid$(ai$,i,1))\\n if box$(b1) = \\\"\\\" then\\n box$(b1) = \\\"O\\\"\\n exit for\\n end if\\nnext i\\n\\n[shoTic]\\ncls\\n' ----------------------------------------\\n' show tic tac toe screen\\n' ----------------------------------------\\nhtml \\\"<table border=1 width=300px height=225px><TR>\\\"\\nfor i = 1 to 9\\n html \\\"<td align=center width=33%><h1>\\\"\\n if box$(i) <> \\\"\\\" then\\n html box$(i)\\n else\\n button #box, \\\" \\\";box$(i);\\\" \\\", [doTic]\\n #box setkey(str$(i))\\n end if\\n if i mod 3 = 0 then html \\\"</tr><tr>\\\"\\nnext i\\nhtml \\\"</table>\\\"\\ngosub [checkWin]\\nwait\\n\\n[doTic]\\nbox$(val(EventKey$)) = \\\"X\\\"\\nturn = 1\\ngosub [checkWin]\\ngoto [loop]\\n\\n' --- check for a winner ----------\\n[checkWin]\\nfor i = 1 to 8\\n b$ = word$(winBox$,i,\\\" \\\")\\n b1 = val(mid$(b$,1,1))\\n b2 = val(mid$(b$,2,1))\\n b3 = val(mid$(b$,3,1))\\n if box$(b1) = \\\"O\\\" and box$(b2) = \\\"O\\\" and box$(b3) = \\\"O\\\" then\\n print \\\"You Lose!\\\"\\n goto [playAgain]\\n end if\\n if box$(b1) = \\\"X\\\" and box$(b2) = \\\"X\\\" and box$(b3) = \\\"X\\\" then\\n print \\\"You Win!\\\"\\n goto [playAgain]\\n end if\\nnext i\\n\\nmoveCount = 0\\nfor i = 1 to 9\\n if box$(i) <> \\\"\\\" then moveCount = moveCount + 1\\nnext i\\nif moveCount = 9 then\\n print \\\"Draw!\\\"\\n goto [playAgain]\\nend if\\nRETURN\\n\\n[playAgain]\\ninput \\\"Play again (y/n)\\\";p$\\nif upper$(p$) = \\\"Y\\\" then goto [newGame]\\nend\\n\",\n \"language\": \"Run-BASIC\"\n },\n {\n \"code\": \" REM Tic-tac-toe for Tiny BASIC\\n REM\\n REM Released as public domain by Damian Gareth Walker, 2019\\n REM Created: 21-Sep-2019\\n\\n REM --- Variables\\n REM A - first square in line examined\\n REM B - second square in line examined\\n REM C - third square in line examined\\n REM D - player whose pieces to count\\n REM E - number of DREM s pieces on a line\\n REM F - first square of line to examine\\n REM G - game winner\\n REM H - which side the human takes\\n REM I - increment for line to examine\\n REM L - line to examine\\n REM M - where to move (various uses)\\n REM N - piece found in a square\\n REM P - player currently playing\\n REM Q - square to examine\\n REM R-Z - contents of the board\\n\\n REM --- Main Program\\n GOSUB 40\\n GOSUB 60\\n GOSUB 80\\n END\\n\\n REM --- Subroutine to initialise the game\\n REM Outputs: H - Human play order\\n REM P - Whose turn it is\\n 40 PRINT \\\"Tic tac toe. Board positions are:\\\"\\n PRINT \\\" 1 2 3\\\"\\n PRINT \\\" 4 5 6\\\"\\n PRINT \\\" 7 8 9\\\"\\n PRINT \\\"Play first or second (1/2)?\\\"\\n INPUT H\\n IF H<1 THEN GOTO 40\\n IF H>2 THEN GOTO 40\\n LET P=1\\n RETURN\\n\\n REM --- Subroutine to take turns\\n REM Inputs: H - who is the human\\n REM P - whose turn it is\\n REM Outputs: G - who won the game\\n 60 IF P=H THEN GOSUB 100\\n IF P<>H THEN GOSUB 120\\n GOSUB 200\\n IF G>0 THEN RETURN\\n LET P=3-P\\n IF R=0 THEN GOTO 60\\n IF S=0 THEN GOTO 60\\n IF T=0 THEN GOTO 60\\n IF U=0 THEN GOTO 60\\n IF V=0 THEN GOTO 60\\n IF W=0 THEN GOTO 60\\n IF X=0 THEN GOTO 60\\n IF Y=0 THEN GOTO 60\\n IF Z=0 THEN GOTO 60\\n RETURN\\n\\n REM --- Victory\\n REM Inputs: H - which side was the human\\n REM P - player who won\\n 80 IF G=H THEN PRINT \\\"You win!\\\"\\n IF G<>0 THEN IF G<>H THEN PRINT \\\"Computer wins\\\"\\n IF G=0 THEN PRINT \\\"A draw\\\"\\n RETURN\\n\\n REM --- Subroutine to allow the player to move\\n REM Inputs: P - player number\\n REM Outputs: M - where the player wishes to move\\n100 PRINT \\\"Move? \\\"\\n INPUT Q\\n IF Q<1 THEN GOTO 100\\n IF Q>9 THEN GOTO 100\\n GOSUB 220\\n IF N<>0 THEN GOTO 100\\n LET M=Q\\n GOSUB 240\\n RETURN\\n\\n REM --- Subroutine to make the computerREM s move\\n REM Inputs: P - player number\\n REM Outputs: M - the move chosen\\n120 LET M=0\\n LET D=3-H\\n GOSUB 145\\n IF M>0 THEN GOTO 135\\n LET D=H\\n GOSUB 145\\n IF M=0 THEN IF V=0 THEN LET M=5\\n IF M=0 THEN IF R=0 THEN LET M=1\\n IF M=0 THEN IF T=0 THEN LET M=3\\n IF M=0 THEN IF X=0 THEN LET M=7\\n IF M=0 THEN IF Z=0 THEN LET M=9\\n IF M=0 THEN IF S=0 THEN LET M=2\\n IF M=0 THEN IF U=0 THEN LET M=4\\n IF M=0 THEN IF Y=0 THEN LET M=8\\n IF M=0 THEN IF W=0 THEN LET M=6\\n135 GOSUB 240\\n PRINT \\\"Computer move \\\",M\\n RETURN\\n\\n REM --- Identify moves to win or avoid a loss\\n REM Inputs: D - player whose pieces weREM re counting\\n REM Changes: E - number of pieces on line being scanned\\n REM F - first square in winning line\\n REM I - increment of winning line\\n REM L - line being scanned (counter)\\n145 LET L=1\\n146 GOSUB 170\\n IF E<2 THEN GOTO 152\\n IF A=0 THEN LET M=F\\n IF B=0 THEN LET M=F+I\\n IF C=0 THEN LET M=F+I+I\\n IF M>0 THEN RETURN\\n152 LET L=L+1\\n IF L<9 THEN GOTO 146\\n RETURN\\n\\n REM --- Count a playerREM s pieces on a line\\n REM Inputs: D - player whose pieces weREM re counting\\n REM L - line number\\n REM Changes: F - first square on the line\\n REM I - increment of the line\\n REM Q - individual squares to examine\\n REM Outputs: A - contents of first square\\n REM B - contents of second square\\n REM C - contents of third square\\n REM E - number of the playerREM s pieces\\n170 IF L>3 THEN GOTO 174\\n LET F=3*L-2\\n LET I=1\\n GOTO 180\\n174 IF L>6 THEN GOTO 178\\n LET F=L-3\\n LET I=3\\n GOTO 180\\n178 LET F=1+2*(L-7)\\n LET I=4-2*(L-7)\\n180 LET E=0\\n LET Q=F\\n GOSUB 220\\n LET A=N\\n IF N=D THEN LET E=E+1\\n LET Q=Q+I\\n GOSUB 220\\n LET B=N\\n IF N=D THEN LET E=E+1\\n LET Q=Q+I\\n GOSUB 220\\n LET C=N\\n IF N=D THEN LET E=E+1\\n RETURN\\n\\n REM --- Subroutine to check for a win\\n REM Inputs: R-Z - board squares\\n REM Outputs: G - the winning player (0 for neither)\\n200 LET G=0\\n IF R>0 THEN IF R=S THEN IF S=T THEN LET G=R\\n IF U>0 THEN IF U=V THEN IF V=W THEN LET G=U\\n IF X>0 THEN IF X=Y THEN IF Y=Z THEN LET G=X\\n IF R>0 THEN IF R=U THEN IF U=X THEN LET G=R\\n IF S>0 THEN IF S=V THEN IF V=Y THEN LET G=S\\n IF T>0 THEN IF T=W THEN IF W=Z THEN LET G=T\\n IF R>0 THEN IF R=V THEN IF V=Z THEN LET G=R\\n IF T>0 THEN IF T=V THEN IF V=X THEN LET G=T\\n RETURN\\n\\n REM --- Subroutine to see what piece is in a square\\n REM Inputs: Q - the square to check\\n REM R-Z - the contents of the squares\\n REM Outputs: N - the piece in that square\\n220 LET N=0\\n IF Q=1 THEN LET N=R\\n IF Q=2 THEN LET N=S\\n IF Q=3 THEN LET N=T\\n IF Q=4 THEN LET N=U\\n IF Q=5 THEN LET N=V\\n IF Q=6 THEN LET N=W\\n IF Q=7 THEN LET N=X\\n IF Q=8 THEN LET N=Y\\n IF Q=9 THEN LET N=Z\\n RETURN\\n\\n REM --- Subroutine to put a piece in a square\\n REM Inputs: P - the player whose piece should be placed\\n REM M - the square to put the piece in\\n REM Changes: R-Z - the contents of the squares\\n240 IF M=1 THEN LET R=P\\n IF M=2 THEN LET S=P\\n IF M=3 THEN LET T=P\\n IF M=4 THEN LET U=P\\n IF M=5 THEN LET V=P\\n IF M=6 THEN LET W=P\\n IF M=7 THEN LET X=P\\n IF M=8 THEN LET Y=P\\n IF M=9 THEN LET Z=P\\n RETURN\\n\",\n \"language\": \"Run-BASIC\"\n },\n {\n \"code\": \"use GameState::{ComputerWin, Draw, PlayerWin, Playing};\\n\\nuse rand::prelude::*;\\n\\n#[derive(PartialEq, Debug)]\\nenum GameState {\\n PlayerWin,\\n ComputerWin,\\n Draw,\\n Playing,\\n}\\n\\ntype Board = [[char; 3]; 3];\\n\\nfn main() {\\n let mut rng = StdRng::from_entropy();\\n\\n let mut board: Board = [['1', '2', '3'], ['4', '5', '6'], ['7', '8', '9']];\\n\\n draw_board(board);\\n loop {\\n player_turn(&mut board);\\n if check_win(board) != Playing {\\n break;\\n }\\n computer_turn(&mut rng, &mut board);\\n if check_win(board) != Playing {\\n break;\\n }\\n draw_board(board);\\n }\\n\\n draw_board(board);\\n let announcement = match check_win(board) {\\n PlayerWin => \\\"The Player has won!\\\",\\n ComputerWin => \\\"The Computer has won!\\\",\\n Draw => \\\"Draw!\\\",\\n Playing => unreachable!(),\\n };\\n println!(\\\"{}\\\", announcement);\\n}\\n\\nfn is_empty(cell: &char) -> bool {\\n *cell != 'X' && *cell != 'O'\\n}\\n\\nfn check_win(board: Board) -> GameState {\\n // check for win\\n for (i, row) in board.iter().enumerate() {\\n if row[0] == row[1] && row[0] == row[2] {\\n return which_win(row[0]);\\n } else if board[0][i] == board[1][i] && board[0][i] == board[2][i] {\\n return which_win(board[0][i]);\\n }\\n }\\n if board[0][0] == board[1][1] && board[0][0] == board[2][2] {\\n return which_win(board[0][0]);\\n } else if board[0][2] == board[1][1] && board[0][2] == board[2][0] {\\n return which_win(board[0][2]);\\n }\\n\\n // check if it's not a draw\\n let is_draw = board.iter().flatten().any(is_empty);\\n if is_draw {\\n Playing\\n } else {\\n Draw\\n }\\n}\\n\\nfn which_win(s: char) -> GameState {\\n match s {\\n 'X' => PlayerWin,\\n 'O' => ComputerWin,\\n _ => unreachable!(),\\n }\\n}\\n\\nfn player_turn(board: &mut Board) {\\n use std::io;\\n\\n println!(\\\"Player, enter your field of choice!: \\\");\\n let mut ln = String::new();\\n io::stdin()\\n .read_line(&mut ln)\\n .expect(\\\"Failed to read stdin\\\");\\n let choice = ln.trim().parse::<usize>().expect(\\\"Failed to parse input\\\");\\n let row = (choice - 1) / 3;\\n let col = (choice - 1) % 3;\\n\\n if board[row][col] == 'X' || board[row][col] == 'O' {\\n println!(\\\"Someone already took this field!\\\");\\n player_turn(board);\\n } else {\\n board[row][col] = 'X';\\n }\\n}\\n\\nfn computer_turn<R: Rng>(rng: &mut R, board: &mut Board) {\\n let possible_choices: Vec<_> = board\\n .iter()\\n .flatten()\\n .enumerate()\\n .filter(|&(_, c)| is_empty(c))\\n .map(|(i, _)| i)\\n .collect();\\n\\n let choice = possible_choices.choose(rng).unwrap();\\n println!(\\\"Computer chose: {}\\\", choice);\\n let row = choice / 3;\\n let col = choice % 3;\\n board[row][col] = 'O';\\n}\\n\\nfn draw_board(board: Board) {\\n for row in &board {\\n println!(\\\"{} {} {}\\\", row[0], row[1], row[2]);\\n }\\n}\\n\",\n \"language\": \"Rust\"\n },\n {\n \"code\": \"package object tictactoe {\\n val Human = 'X'\\n val Computer = 'O'\\n val BaseBoard = ('1' to '9').toList\\n val WinnerLines = List((0,1,2), (3,4,5), (6,7,8), (0,3,6), (1,4,7), (2,5,8), (0,4,8), (2,4,6))\\n val randomGen = new util.Random(System.currentTimeMillis)\\n}\\n\\npackage tictactoe {\\n\\nclass Board(aBoard : List[Char] = BaseBoard) {\\n\\n def availableMoves = aBoard.filter(c => c != Human && c != Computer)\\n\\n def availableMovesIdxs = for ((c,i) <- aBoard.zipWithIndex if c != Human && c != Computer) yield i\\n\\n def computerPlays = new Board(aBoard.updated(availableMovesIdxs(randomGen.nextInt(availableMovesIdxs.length)), Computer))\\n\\n def humanPlays(move : Char) = new Board(aBoard.updated(aBoard.indexOf(move), Human))\\n\\n def isDraw = aBoard.forall(c => c == Human || c == Computer)\\n\\n def isWinner(winner : Char) =\\n WinnerLines.exists{case (i,j,k) => aBoard(i) == winner && aBoard(j) == winner && aBoard(k) == winner}\\n\\n def isOver = isWinner(Computer) || isWinner(Human) || isDraw\\n\\n def print {\\n aBoard.grouped(3).foreach(row => println(row(0) + \\\" \\\" + row(1) + \\\" \\\" + row(2)))\\n }\\n\\n def printOverMessage {\\n if (isWinner(Human)) println(\\\"You win.\\\")\\n else if (isWinner(Computer)) println(\\\"Computer wins.\\\")\\n else if (isDraw) println(\\\"It's a draw.\\\")\\n else println(\\\"Not over yet, or something went wrong.\\\")\\n }\\n\\n}\\n\\n\\nobject TicTacToe extends App {\\n\\n def play(board : Board, turn : Char) {\\n\\n // Reads a char from input until it is one of\\n // the available moves in the current board\\n def readValidMove() : Char = {\\n print(\\\"Choose a move: \\\")\\n val validMoves = board.availableMoves\\n val move = readChar\\n if (validMoves.contains(move)) {\\n move\\n } else {\\n println(\\\"Invalid move. Choose another one in \\\" + validMoves)\\n readValidMove()\\n }\\n }\\n\\n\\n board.print\\n\\n if (board.isOver) {\\n board.printOverMessage\\n return\\n }\\n\\n if (turn == Human) { // Human plays\\n val nextBoard = board.humanPlays(readValidMove)\\n play(nextBoard, Computer)\\n } else { // Computer plays\\n println(\\\"Computer plays: \\\")\\n val nextBoard = board.computerPlays\\n play(nextBoard, Human)\\n }\\n }\\n\\n play(new Board(),Human)\\n\\n}\\n\\n}\\n\",\n \"language\": \"Scala\"\n },\n {\n \"code\": \"function [] = startGame()\\n //Board size and marks\\n N = 3;\\n marks = [\\\"X\\\" \\\"O\\\"];\\n\\n //Creating empty board\\n board = string(zeros(N,N));\\n for i = 1:(N*N)\\n board(i) = \\\"\\\";\\n end\\n\\n //Initialising players\\n clc();\\n players= [%F %F];\\n players = playerSetup(marks);\\n\\n //Console header\\n header = [strsplit(marks(1)+\\\" is ----\\\")';...\\n strsplit(marks(2)+\\\" is ----\\\")'];\\n for i = 1:2\\n if players(i) then\\n header(i,6:10) = strsplit(\\\"P\\\"+string(i)+\\\". \\\");\\n else\\n header(i,6:10) = strsplit(\\\"COMP.\\\");\\n end\\n end\\n\\n //Game loop\\n sleep(1000);\\n win_flag = %F;\\n count = 0;\\n while count<N*N\\n //Clear console, and print header and board\\n clc();\\n printf(\\\"%s\\\\n %s\\\\n\\\",strcat(header(1,:)),strcat(header(2,:)));\\n dispBoard(board);\\n\\n //Find which player should move\\n player_n = modulo(count,2) + 1;\\n\\n if players(player_n) == %T then\\n //Human plays\\n pos = [];\\n valid_move = %F;\\n disp(marks(player_n)+\\\"''s turn.\\\");\\n while valid_move ~= %T\\n [pos,valid_move] = readHumanMove(board);\\n if ~valid_move then\\n disp(\\\"You should input a valid cell number.\\\");\\n end\\n end\\n\\n if valid_move then\\n board = updateBoard(board,pos,marks(player_n));\\n else\\n error(\\\"Invalid move.\\\");\\n end\\n else\\n //Computer plays\\n disp(\\\"Computer is playing.\\\");\\n board = ComputerMove(board,marks(player_n),marks);\\n sleep(800);\\n end\\n\\n //Count number of movements\\n count = count + 1;\\n\\n //Check if the game has finished\\n [win_flag,winning_mark] = detectWin(board)\\n if win_flag then\\n break\\n end\\n end\\n\\n //Clear screen at the end of game\\n clc();\\n disp(\\\"Game finished:\\\");\\n dispBoard(board);\\n\\n //Print results\\n if win_flag then\\n disp(winning_mark+\\\" won!\\\");\\n else\\n disp(\\\"It''s a tie.\\\");\\n end\\n\\n //Play again?\\n play_again = \\\"\\\";\\n while play_again ~= \\\"Y\\\" & play_again ~= \\\"N\\\"\\n play_again = input(\\\"Would you like to play again? (Y/N)\\\",\\\"s\\\");\\n play_again = strsplit(play_again);\\n play_again = convstr(play_again(1),\\\"u\\\");\\n\\n if play_again ~= \\\"Y\\\" & play_again ~= \\\"N\\\" then\\n disp(\\\"Invalid answer.\\\");\\n end\\n end\\n\\n if play_again == \\\"Y\\\" then\\n startGame();\\n else\\n disp(\\\"Quit game.\\\");\\n end\\nendfunction\\n\\nfunction players = playerSetup(marks)\\n //Determines who plays which mark\\n players = [%F %F]; //True for human, Flase for computer\\n\\n printf(\\\"\\\\n%s always starts.\\\\n\\\",marks(1));\\n for i = 1:2\\n user_input = \\\"\\\";\\n while user_input ~= \\\"Y\\\" & user_input ~= \\\"N\\\"\\n user_input = input(\\\"Would you like to play as \\\"+marks(i)+\\\"? (Y/N)\\\",\\\"s\\\");\\n user_input = strsplit(user_input);\\n user_input = convstr(user_input(1),\\\"u\\\");\\n\\n if user_input ~= \\\"Y\\\" & user_input ~= \\\"N\\\" then\\n disp(\\\"Invalid answer.\\\");\\n end\\n end\\n\\n //Print choice\\n if user_input == \\\"Y\\\" then\\n players(i) = %T;\\n printf(\\\"%s shall be player %d (P%d).\\\\n\\\\n\\\",marks(i),i,i);\\n else\\n printf(\\\"%s shall be the computer (COMP).\\\\n\\\\n\\\",marks(i));\\n end\\n end\\nendfunction\\n\\nfunction [] = dispBoard(board)\\n //Print ASCII board on console\\n\\n //Get board marks\\n marks = [\\\" \\\" \\\" \\\"];\\n mark_inds = find(board ~= \\\"\\\");\\n if mark_inds ~= [] then\\n marks(1) = board(mark_inds(1));\\n mark_inds = find( (board ~= \\\"\\\") & (board ~= marks(1)) );\\n if mark_inds ~= [] then\\n marks(2) = board(mark_inds(1));\\n end\\n end\\n\\n //Transpose to display for humans\\n //[compatibility with readHumanMove()]\\n disp_board = board';\\n\\n rows = 3*size(board,'r');\\n cols = 4*size(board,'c');\\n ascii_board = string(zeros(rows, cols));\\n\\n mark_1=[...\\n strsplit(\\\" |\\\")';...\\n strsplit(\\\" \\\"+marks(1)+\\\" |\\\")';...\\n strsplit(\\\"___|\\\")'];\\n\\n mark_2=[...\\n strsplit(\\\" |\\\")';...\\n strsplit(\\\" \\\"+marks(2)+\\\" |\\\")';...\\n strsplit(\\\"___|\\\")'];\\n\\n Blank_mark=[...\\n strsplit(\\\" |\\\")';...\\n strsplit(\\\" |\\\")';...\\n strsplit(\\\"___|\\\")'];\\n\\n for r = ([1:size(board,'r')] - 1 )\\n for c = ([1:size(board,'c')] - 1)\\n if disp_board(r+1,c+1) == marks(1) then\\n ascii_board((r*3 + 1):((r+1)*3),...\\n (c*4 + 1):((c+1)*4)) = mark_1;\\n elseif disp_board(r+1,c+1) == marks(2) then\\n ascii_board((r*3 + 1):((r+1)*3),...\\n (c*4 + 1):((c+1)*4)) = mark_2;\\n else\\n ascii_board((r*3 + 1):((r+1)*3),...\\n (c*4 + 1):((c+1)*4)) = Blank_mark;\\n end\\n end\\n end\\n\\n for i = 1:cols\\n if modulo(i,4)>0 then\\n ascii_board(rows,i) = \\\" \\\";\\n end\\n end\\n\\n for i = 1:rows\\n ascii_board(i,cols) = \\\" \\\";\\n end\\n\\n printf(\\\"\\\\n\\\");\\n for i = 1:size(ascii_board,'r')\\n printf(\\\"%s\\\\n\\\",strcat(ascii_board(i,:)))\\n end\\nendfunction\\n\\nfunction moves_board = availableMoves(board)\\n //Find empty cells on the board\\n moves_board = board;\\n\\n for i = 1:(size(board,'r')*size(board,'c'))\\n if board(i) == \\\"\\\" then\\n moves_board(i) = string(i);\\n else\\n moves_board(i) = \\\"_\\\";\\n end\\n end\\nendfunction\\n\\nfunction varargout = readHumanMove(board)\\n //Read human input\\n printf(\\\"\\\\nAvailable cells:\\\");\\n moves_board = availableMoves(board);\\n disp(moves_board');\\n\\n x = input(\\\"\\\\nEnter a move (0 to quit game): \\\");\\n\\n valid = %F;\\n pos = 0;\\n total = size(moves_board,'r') * size(moves_board,'c');\\n\\n //Check if it is a valid move\\n if x == 0 then\\n disp(\\\"Quit game.\\\")\\n abort\\n elseif (x>=1 & x<=total) then\\n if (moves_board(x) == string(x)) then\\n valid = %T;\\n pos = x;\\n end\\n end\\n\\n varargout = list(pos,valid);\\nendfunction\\n\\nfunction varargout = updateBoard(board,pos,player)\\n //Add move to the board\\n if board(pos) ~= \\\"\\\" then\\n error('Error: Invalid move.');\\n end\\n\\n board(pos) = player\\n\\n varargout = list(board);\\nendfunction\\n\\nfunction varargout = detectWin(board)\\n //Detect if there is a winner or not\\n win_flag = %F;\\n winner = \\\"\\\";\\n\\n //Get board marks\\n marks = [\\\"\\\" \\\"\\\"];\\n mark_inds = find(board ~= \\\"\\\");\\n marks(1) = board(mark_inds(1))\\n mark_inds = find( (board ~= \\\"\\\") & (board ~= marks(1)) );\\n marks(2) = board(mark_inds(1));\\n\\n //If there is a minimum number of moves, check if there is a winner\\n n_moves = find(~(board == \\\"\\\"));\\n n_moves = length(n_moves)\\n\\n if n_moves >= size(board,'r') then\\n board_X = (board == marks(1));\\n board_O = (board == marks(2));\\n\\n for i = 1:size(board,'r')\\n //Check rows\\n if find(~board_X(i,:)) == [] then\\n win_flag = %T;\\n winner = marks(1);\\n break\\n end\\n if find(~board_O(i,:)) == [] then\\n win_flag = %T;\\n winner = marks(2);\\n break\\n end\\n\\n //Check columns\\n if find(~board_X(:,i)) == [] then\\n win_flag = %T;\\n winner = marks(1);\\n break\\n end\\n if find(~board_O(:,i)) == [] then\\n win_flag = %T;\\n winner = marks(2);\\n break\\n end\\n end\\n\\n //Check diagonal\\n if ~win_flag then\\n if find(~diag(board_X)) == [] then\\n win_flag = %T;\\n winner = marks(1);\\n elseif find(~diag(board_O)) == [] then\\n win_flag = %T;\\n winner = marks(2);\\n end\\n end\\n\\n //Check anti-diagonal\\n if ~win_flag then\\n board_X = board_X(:,$:-1:1);\\n board_O = board_O(:,$:-1:1);\\n\\n if find(~diag(board_X)) == [] then\\n win_flag = %T;\\n winner = marks(1);\\n elseif find(~diag(board_O)) == [] then\\n win_flag = %T;\\n winner = marks(2);\\n end\\n end\\n end\\n\\n varargout = list(win_flag,winner)\\nendfunction\\n\\nfunction threat_pos = findThreat(board,player)\\n //Returns a list of moves that can finish the game\\n\\n //Available moves\\n move_inds = find(~( availableMoves(board) == \\\"_\\\" ));\\n\\n //If there is a minimum number of moves, check if there is a threat\\n threat_pos = [];\\n if (size(board,'r')*size(board,'c')) - length(move_inds) >...\\n (size(board,'r') - 1) then\\n for i = 1:length(move_inds)\\n temp_board = updateBoard(board,move_inds(i),player);\\n [win_flag,winner] = detectWin(temp_board);\\n if win_flag & winner == player then\\n threat_pos = [threat_pos move_inds(i)];\\n end\\n end\\n end\\nendfunction\\n\\nfunction varargout = ComputerMove(board,mark,all_marks)\\n //Atomatically add a move to the board with no human input\\n\\n //Find winning moves moves\\n move_inds = findThreat(board,mark);\\n\\n //If there are no winning moves, find opponent's winning moves\\n //to block opponent's victory\\n if move_inds == [] then\\n if mark == all_marks(1) then\\n opponent = all_marks(2);\\n elseif mark == all_marks(2) then\\n opponent = all_marks(1);\\n end\\n\\n move_inds = findThreat(board,opponent);\\n end\\n\\n //If there are no winning moves or threats, find all possible moves\\n if move_inds == [] then\\n move_inds = find(~( availableMoves(board) == \\\"_\\\" ));\\n end\\n\\n //Choose a random move among the selected possible moves\\n pos = grand(1,\\\"prm\\\",move_inds);\\n pos = pos(1);\\n\\n //Update board by adding a new mark\\n board(pos) = mark;\\n\\n varargout = list(board);\\nendfunction\\n\\nstartGame()\\n\",\n \"language\": \"Scilab\"\n },\n {\n \"code\": \"--Setup\\ndrop table if exists board;\\ncreate table board (p char, r integer, c integer);\\ninsert into board values('.', 0, 0),('.', 0, 1),('.', 0, 2),('.', 1, 0),('.', 1, 1),('.', 1, 2),('.', 2, 0),('.', 2, 1),('.', 2, 2);\\n\\n\\n-- Use a trigger for move events\\ndrop trigger if exists after_moved;\\ncreate trigger after_moved after update on board for each row when new.p <> '.' and new.p <> 'O'\\nbegin\\n\\n -- Verify move is valid\\n select\\n case\\n when (select v from msg) like '%Wins!' then raise(ABORT, 'The game is already over.')\\n when (select old.p from board where rowid = rid) <> '.' then raise(ABORT, 'That position has already been taken. Please choose an available position.')\\n when new.p <> 'X' then raise(ABORT, 'Please place an ''X''')\\n end\\n from (\\n select rowid rid from board\\n where p = new.p\\n except\\n select p from board where p = old.p\\n );\\n\\n\\n -- Check for game over\\n update msg set v = (\\n select\\n case\\n when max(num) >= 3 then 'X Wins!'\\n when (select count(*) from board where p = '.') = 0 then 'Cat Wins!'\\n else 'Move made'\\n end\\n from ( -- Is Game Over\\n select count(*) num from board where p = 'X' group by r union -- Horz\\n select count(*) num from board where p = 'X' group by c union -- Vert\\n select count(*) num from board where p = 'X' and r = c union -- Diag TL->BR\\n select count(*) num from board where p = 'X' and (2-r) = c -- Diag TR->BL\\n )\\n );\\n\\n\\n --Have computer player make a random move\\n update board set p = 'O'\\n where rowid = (select rid from (select max(rnd),rid from (select rowid rid, random() rnd from board where p = '.')))\\n and (select v from msg) not like '%Wins!';\\n --NOTE: SQLite doesn't allow update order by in triggers, otherwise we could just use this beautiful line:\\n -- update board set p = 'O' where p = '.' order by random() limit 1;\\n\\n --Check to see if the computer player won\\n update msg set v = (\\n select\\n case\\n when max(num) >= 3 then 'O Wins!'\\n else v\\n end\\n from ( -- Is Game Over\\n select count(*) num from board where p = 'O' group by r union -- Horz\\n select count(*) num from board where p = 'O' group by c union -- Vert\\n select count(*) num from board where p = 'O' and r = c union -- Diag TL->BR\\n select count(*) num from board where p = 'O' and (2-r) = c -- Diag TR->BL\\n )\\n );\\n\\n\\nend;\\n\\n-- UI to display the logical board as a grid\\ndrop view if exists ui;\\ncreate view ui as\\nselect case when p = '.' then col0.rowid else p end c0, c1, c2\\nfrom board as col0\\njoin (select case when p = '.' then board.rowid else p end c1, r from board where c = 1) as col1 on col0.r = col1.r\\njoin (select case when p = '.' then board.rowid else p end c2, r from board where c = 2) as col2 on col0.r = col2.r\\nwhere c = 0;\\n\\ndrop table if exists msg;\\ncreate table msg (v text);\\ninsert into msg values('');\\n\\n-- Readme\\nselect * from ui;\\n.print \\\"Use this to play:\\\"\\n.print \\\"->update board set p = 'X' where rowid = ?; select * from ui; select * from msg;\\\"'\\n\",\n \"language\": \"SQL\"\n },\n {\n \"code\": \"import Darwin\\n\\nenum Token : CustomStringConvertible {\\n\\tcase cross, circle\\n\\t\\n\\tfunc matches(tokens: [Token?]) -> Bool {\\n\\t\\tfor token in tokens {\\n\\t\\t\\tguard let t = token, t == self else {\\n\\t\\t\\t\\treturn false\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\treturn true\\n\\t}\\n\\t\\n\\tfunc emptyCell(in tokens: [Token?]) -> Int? {\\n\\t\\tif tokens[0] == nil\\n\\t\\t&& tokens[1] == self\\n\\t\\t&& tokens[2] == self {\\n\\t\\t\\treturn 0\\n\\t\\t} else\\n\\t\\tif tokens[0] == self\\n\\t\\t&& tokens[1] == nil\\n\\t\\t&& tokens[2] == self {\\n\\t\\t\\treturn 1\\n\\t\\t} else\\n\\t\\tif tokens[0] == self\\n\\t\\t&& tokens[1] == self\\n\\t\\t&& tokens[2] == nil {\\n\\t\\t\\treturn 2\\n\\t\\t}\\n\\t\\treturn nil\\n\\t}\\n\\t\\n\\tvar description: String {\\n\\t\\tswitch self {\\n\\t\\t\\tcase .cross: return \\\"x\\\"\\n\\t\\t\\tcase .circle: return \\\"o\\\"\\n\\t\\t}\\n\\t}\\n}\\n\\nstruct Board {\\n\\tvar cells: [Token?] = [nil, nil, nil, nil, nil, nil, nil, nil, nil]\\n\\t\\n\\tfunc cells(atCol col: Int) -> [Token?] {\\n\\t\\treturn [cells[col], cells[col + 3], cells[col + 6]]\\n\\t}\\n\\t\\n\\tfunc cells(atRow row: Int) -> [Token?] {\\n\\t\\treturn [cells[row * 3], cells[row * 3 + 1], cells[row * 3 + 2]]\\n\\t}\\n\\t\\n\\tfunc cellsTopLeft() -> [Token?] {\\n\\t\\treturn [cells[0], cells[4], cells[8]]\\n\\t}\\n\\t\\n\\tfunc cellsBottomLeft() -> [Token?] {\\n\\t\\treturn [cells[6], cells[4], cells[2]]\\n\\t}\\n\\t\\n\\tfunc winner() -> Token? {\\n\\t\\tlet r0 = cells(atRow: 0)\\n\\t\\tlet r1 = cells(atRow: 1)\\n\\t\\tlet r2 = cells(atRow: 2)\\n\\t\\tlet c0 = cells(atCol: 0)\\n\\t\\tlet c1 = cells(atCol: 1)\\n\\t\\tlet c2 = cells(atCol: 2)\\n\\t\\tlet tl = cellsTopLeft()\\n\\t\\tlet bl = cellsBottomLeft()\\n\\t\\t\\n\\t\\tif Token.cross.matches(tokens: r0)\\n\\t\\t|| Token.cross.matches(tokens: r1)\\n\\t\\t|| Token.cross.matches(tokens: r2)\\n\\t\\t|| Token.cross.matches(tokens: c0)\\n\\t\\t|| Token.cross.matches(tokens: c1)\\n\\t\\t|| Token.cross.matches(tokens: c2)\\n\\t\\t|| Token.cross.matches(tokens: tl)\\n\\t\\t|| Token.cross.matches(tokens: bl) {\\n\\t\\t\\treturn .cross\\n\\t\\t} else\\n\\t\\tif Token.circle.matches(tokens: r0)\\n\\t\\t|| Token.circle.matches(tokens: r1)\\n\\t\\t|| Token.circle.matches(tokens: r2)\\n\\t\\t|| Token.circle.matches(tokens: c0)\\n\\t\\t|| Token.circle.matches(tokens: c1)\\n\\t\\t|| Token.circle.matches(tokens: c2)\\n\\t\\t|| Token.circle.matches(tokens: tl)\\n\\t\\t|| Token.circle.matches(tokens: bl) {\\n\\t\\t\\treturn .circle\\n\\t\\t}\\n\\t\\treturn nil\\n\\t}\\n\\t\\n\\tfunc atCapacity() -> Bool {\\n\\t\\treturn cells.filter { $0 == nil }.count == 0\\n\\t}\\n\\t\\n\\tmutating func play(token: Token, at location: Int) {\\n\\t\\tcells[location] = token\\n\\t}\\n\\t\\n\\tfunc findBestLocation(for player: Token) -> Int? {\\n\\t\\tlet r0 = cells(atRow: 0)\\n\\t\\tlet r1 = cells(atRow: 1)\\n\\t\\tlet r2 = cells(atRow: 2)\\n\\t\\tlet c0 = cells(atCol: 0)\\n\\t\\tlet c1 = cells(atCol: 1)\\n\\t\\tlet c2 = cells(atCol: 2)\\n\\t\\tlet tl = cellsTopLeft()\\n\\t\\tlet bl = cellsBottomLeft()\\n\\t\\t\\n\\t\\tif let cell = player.emptyCell(in: r0) {\\n\\t\\t\\treturn cell\\n\\t\\t} else if let cell = player.emptyCell(in: r1) {\\n\\t\\t\\treturn cell + 3\\n\\t\\t} else if let cell = player.emptyCell(in: r2) {\\n\\t\\t\\treturn cell + 6\\n\\t\\t} else if let cell = player.emptyCell(in: c0) {\\n\\t\\t\\treturn cell * 3\\n\\t\\t} else if let cell = player.emptyCell(in: c1) {\\n\\t\\t\\treturn cell * 3 + 1\\n\\t\\t} else if let cell = player.emptyCell(in: c2) {\\n\\t\\t\\treturn cell * 3 + 2\\n\\t\\t} else if let cell = player.emptyCell(in: tl) {\\n\\t\\t\\treturn cell == 0 ? 0 : (cell == 1 ? 4 : 8)\\n\\t\\t} else if let cell = player.emptyCell(in: bl) {\\n\\t\\t\\treturn cell == 0 ? 6 : (cell == 1 ? 4 : 2)\\n\\t\\t}\\n\\t\\treturn nil\\n\\t}\\n\\t\\n\\tfunc findMove() -> Int {\\n\\t\\tlet empties = cells.enumerated().filter { $0.1 == nil }\\n\\t\\tlet r = Int(arc4random()) % empties.count\\n\\t\\treturn empties[r].0\\n\\t}\\n}\\n\\nextension Board : CustomStringConvertible {\\n\\tvar description: String {\\n\\t\\tvar result = \\\"\\\\n---------------\\\\n\\\"\\n\\t\\tfor (idx, cell) in cells.enumerated() {\\n\\t\\t\\tif let cell = cell {\\n\\t\\t\\t\\tresult += \\\"| \\\\(cell) |\\\"\\n\\t\\t\\t} else {\\n\\t\\t\\t\\tresult += \\\"| \\\\(idx) |\\\"\\n\\t\\t\\t}\\n\\t\\t\\t\\n\\t\\t\\tif (idx + 1) % 3 == 0 {\\n\\t\\t\\t\\tresult += \\\"\\\\n---------------\\\\n\\\"\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\treturn result\\n\\t}\\n}\\n\\nwhile true {\\n\\tvar board = Board()\\n\\tprint(\\\"Who do you want to play as ('o' or 'x'): \\\", separator: \\\"\\\", terminator: \\\"\\\")\\n\\tlet answer = readLine()?.characters.first ?? \\\"x\\\"\\n\\t\\n\\tvar player: Token = answer == \\\"x\\\" ? .cross : .circle\\n\\tvar pc: Token = player == .cross ? .circle : .cross\\n\\t\\n\\tprint(board)\\n\\t\\n\\twhile true {\\n\\t\\tprint(\\\"Choose cell to play on: \\\", separator: \\\"\\\", terminator: \\\"\\\")\\n\\t\\tvar pos = Int(readLine() ?? \\\"0\\\") ?? 0\\n\\t\\twhile !board.atCapacity() && board.cells[pos] != nil {\\n\\t\\t\\tprint(\\\"Invalid move. Choose cell to play on: \\\", separator: \\\"\\\", terminator: \\\"\\\")\\n\\t\\t\\tpos = Int(readLine() ?? \\\"0\\\") ?? 0\\n\\t\\t}\\n\\t\\t\\n\\t\\tif board.atCapacity() {\\n\\t\\t\\tprint(\\\"Draw\\\")\\n\\t\\t\\tbreak\\n\\t\\t}\\n\\t\\t\\n\\t\\tboard.play(token: player, at: pos)\\n\\t\\tprint(board)\\n\\t\\t\\n\\t\\tif let winner = board.winner() {\\n\\t\\t\\tprint(\\\"winner is \\\\(winner)\\\")\\n\\t\\t\\tbreak\\n\\t\\t} else if board.atCapacity() {\\n\\t\\t\\tprint(\\\"Draw\\\")\\n\\t\\t\\tbreak\\n\\t\\t}\\n\\t\\t\\n\\t\\tif let win = board.findBestLocation(for: pc) {\\n\\t\\t\\tboard.play(token: pc, at: win)\\n\\t\\t} else if let def = board.findBestLocation(for: player) {\\n\\t\\t\\tboard.play(token: pc, at: def)\\n\\t\\t} else {\\n\\t\\t\\tboard.play(token: pc, at: board.findMove())\\n\\t\\t}\\n\\t\\t\\n\\t\\tprint(board)\\n\\t\\t\\n\\t\\tif let winner = board.winner() {\\n\\t\\t\\tprint(\\\"winner is \\\\(winner)\\\")\\n\\t\\t\\tbreak\\n\\t\\t}\\n\\t}\\n}\\n\",\n \"language\": \"Swift\"\n },\n {\n \"code\": \"processor Tic-Tac-Toe\\n @: [position´1..position´9];\\n\\n source isWonOrDone\\n [$@Tic-Tac-Toe(1..3) -> #, $@Tic-Tac-Toe(4..6) -> #, $@Tic-Tac-Toe(7..9) -> #,\\n $@Tic-Tac-Toe(1..9:3) -> #, $@Tic-Tac-Toe(2..9:3) -> #, $@Tic-Tac-Toe(3..9:3) -> #,\\n $@Tic-Tac-Toe([1,5,9]) -> #, $@Tic-Tac-Toe([3,5,7]) -> #\\n ] -> \\\\(\\n when <=[]?($@Tic-Tac-Toe <~[<position>]>)> do 'draw' !\\n when <~=[]> do $(1) !\\n \\\\) !\\n when <[<mark>+ VOID]?($ <[<=$(first)>+ VOID]>)> do '$(first); wins!'!\\n end isWonOrDone\\n\\n source validMoves\\n $@Tic-Tac-Toe -> \\\\[i](<position> $ !\\\\) !\\n end validMoves\\n\\n templates move\\n when <?($@Tic-Tac-Toe($.position::raw) <position>)> do @Tic-Tac-Toe($.position::raw): $.mark;\\n $ !\\n otherwise\\n 'Incorrect move$#10;' -> !OUT::write\\n end move\\n\\n source showString\\n '$:1..9:3 -> '$#10;$@Tic-Tac-Toe($..$+2)...;';$#10;' !\\n end showString\\nend Tic-Tac-Toe\\n\\ncomposer toInt\\n <INT>\\nend toInt\\n\\nsource play\\n def board: $Tic-Tac-Toe;\\n @: mark´'X';\\n templates getMove\\n [] -> #\\n when <=[]> do\\n $board::showString -> !OUT::write\\n '$@play; to move $board::validMoves;:$#10;' -> !OUT::write\\n [{mark: $@play, position: $IN::readline -> toInt} -> board::move] -> #\\n otherwise\\n $(1) !\\n end getMove\\n\\n $getMove -> #\\n when <{}> do\\n '$.mark; played $.position;$#10;' -> !OUT::write\\n @: $@ -> \\\\(<=mark´'X'> mark´'O'! <=mark´'O'> mark´'X' !\\\\);\\n [$board::isWonOrDone] -> \\\\(\\n when <=[]> do $getMove!\\n otherwise '$(1);$#10;' -> !OUT::write\\n \\\\) -> #\\nend play\\n\\n$play -> !VOID\\n\",\n \"language\": \"Tailspin\"\n },\n {\n \"code\": \"package require Tcl 8.6\\n\\n# This code splits the players from the core game engine\\noo::class create TicTacToe {\\n variable board player letter who\\n constructor {player1class player2class} {\\n\\tset board {1 2 3 4 5 6 7 8 9}\\n\\tset player(0) [$player1class new [self] [set letter(0) \\\"X\\\"]]\\n\\tset player(1) [$player2class new [self] [set letter(1) \\\"O\\\"]]\\n\\tset who 0\\n }\\n\\n method PrintBoard {} {\\n\\tlassign $board a1 b1 c1 a2 b2 c2 a3 b3 c3\\n\\tputs [format \\\" %s | %s | %s\\\" $a1 $b1 $c1]\\n\\tputs \\\"---+---+---\\\"\\n\\tputs [format \\\" %s | %s | %s\\\" $a2 $b2 $c2]\\n\\tputs \\\"---+---+---\\\"\\n\\tputs [format \\\" %s | %s | %s\\\" $a3 $b3 $c3]\\n }\\n\\n method WinForSomeone {} {\\n\\tforeach w {\\n\\t {0 1 2} {3 4 5} {6 7 8} {0 3 6} {1 4 7} {2 5 8} {0 4 8} {2 4 6}\\n\\t} {\\n\\t set b [lindex $board [lindex $w 0]]\\n\\t if {$b ni \\\"X O\\\"} continue\\n\\t foreach i $w {if {[lindex $board $i] ne $b} break}\\n\\t if {[lindex $board $i] eq $b} {\\n\\t\\tforeach p $w {lappend w1 [expr {$p+1}]}\\n\\t\\treturn [list $b $w1]\\n\\t }\\n\\t}\\n\\treturn \\\"\\\"\\n }\\n\\n method status {} {\\n\\treturn $board\\n }\\n\\n method IsDraw {} {\\n\\tforeach b $board {if {[string is digit $b]} {return false}}\\n\\treturn true\\n }\\n\\n method legalMoves {} {\\n\\tforeach b $board {if {[string is digit $b]} {lappend legal $b}}\\n\\treturn $legal\\n }\\n\\n method DoATurn {} {\\n\\tset legal [my legalMoves]\\n\\tmy PrintBoard\\n\\twhile 1 {\\n\\t set move [$player($who) turn]\\n\\t if {$move in $legal} break\\n\\t puts \\\"Illegal move!\\\"\\n\\t}\\n\\tlset board [expr {$move - 1}] $letter($who)\\n\\t$player($who) describeMove $move\\n\\tset who [expr {1 - $who}]\\n\\treturn [my WinForSomeone]\\n }\\n\\n method game {} {\\n puts \\\" Tic-tac-toe game player.\\n Input the index of where you wish to place your mark at your turn.\\\\n\\\"\\n\\twhile {![my IsDraw]} {\\n\\t set winner [my DoATurn]\\n\\t if {$winner eq \\\"\\\"} continue\\n\\t lassign $winner winLetter winSites\\n\\t my PrintBoard\\n\\t puts \\\"\\\\n$winLetter wins across \\\\[[join $winSites {, }]\\\\]\\\"\\n\\t return $winLetter\\n\\t}\\n\\tputs \\\"\\\\nA draw\\\"\\n }\\n}\\n\\n# Stupid robotic player\\noo::class create RandomRoboPlayer {\\n variable g\\n constructor {game letter} {\\n\\tset g $game\\n }\\n method turn {} {\\n\\tset legal [$g legalMoves]\\n\\treturn [lindex $legal [expr {int(rand()*[llength $legal])}]]\\n }\\n method describeMove {move} {\\n\\tputs \\\"I go at $move\\\"\\n }\\n}\\n\\n# Interactive human player delegate\\noo::class create HumanPlayer {\\n variable g char\\n constructor {game letter} {\\n\\tset g $game\\n\\tset char $letter\\n }\\n method turn {} {\\n\\tset legal [$g legalMoves]\\n\\tputs \\\">>> Put your $char in any of these positions: [join $legal {}]\\\"\\n\\twhile 1 {\\n\\t puts -nonewline \\\">>> \\\"\\n\\t flush stdout\\n\\t gets stdin number\\n\\t if {$number in $legal} break\\n\\t puts \\\">>> Whoops I don't understand the input!\\\"\\n\\t}\\n\\treturn $number\\n }\\n method describeMove {move} {\\n\\tputs \\\"You went at $move\\\"\\n }\\n}\\n\\n# Assemble the pieces\\nset ttt [TicTacToe new HumanPlayer RandomRoboPlayer]\\n$ttt game\\n\",\n \"language\": \"Tcl\"\n },\n {\n \"code\": \"#!/usr/bin/env bash\\n# play tic-tac-toe\\nmain() {\\n local play_again=1\\n while (( play_again )); do\\n local board=(1 2 3 4 5 6 7 8 9) tokens=(X O)\\n show_board \\\"${board[@]}\\\"\\n # player colors: computer is red, human is green\\n local computer=31 human=32\\n if (( RANDOM % 2 )); then\\n players=(computer human)\\n colors=($computer $human)\\n printf 'I go first!\\\\n'\\n else\\n players=(human computer)\\n colors=($human $computer)\\n printf 'You go first!\\\\n'\\n fi\\n local token winner\\n local -i turn=0\\n while ! winner=$(winner \\\"${board[@]}\\\"); do\\n token=${tokens[turn%2]}\\n case \\\"${players[turn%2]}\\\" in\\n human) board=($(human_turn \\\"$token\\\" \\\"${board[@]}\\\"));;\\n computer) board=($(computer_turn \\\"$token\\\" \\\"${board[@]}\\\"));;\\n *) printf 'Unknown player \\\"%s\\\"\\\\n' \\\"${players[turn%2]}\\\"; exit 1;;\\n esac\\n show_board \\\"${board[@]}\\\" | sed -e \\\"s/${tokens[0]}/\\\"$'\\\\e['\\\"${colors[0]}\\\"$'m&\\\\e[0m/g' \\\\\\n -e \\\"s/${tokens[1]}/\\\"$'\\\\e['\\\"${colors[1]}\\\"$'m&\\\\e[0m/g'\\n\\n (( turn=turn+1 ))\\n done\\n case \\\"$winner${players[0]}\\\" in\\n Ohuman|Xcomputer) printf 'I win!\\\\n';;\\n Xhuman|Ocomputer) printf 'You win!\\\\n';;\\n cat*) printf 'The cat wins!\\\\n';;\\n esac\\n yorn 'Play again'\\n play_again=$(( ! $? ))\\n done\\n}\\n\\nshow_board() {\\n printf '\\\\n'\\n printf '%s %s %s\\\\n' \\\"$@\\\"\\n printf '\\\\n'\\n}\\n\\nwinner() {\\n local board=(\\\"$@\\\") i j k\\n local lines=(\\\"0 1 2\\\" \\\"0 3 6\\\" \\\"0 4 8\\\" \\\"1 4 7\\\"\\n \\\"2 4 6\\\" \\\"2 5 8\\\" \\\"3 4 5\\\" \\\"6 7 8\\\")\\n local line i j k\\n for line in \\\"${lines[@]}\\\"; do\\n read i j k <<<\\\"$line\\\"\\n local token=${board[i]}\\n if [[ \\\"${board[j]}\\\" == $token && \\\"${board[k]}\\\" == $token ]]; then\\n printf '%s\\\\n' \\\"$token\\\"\\n return 0\\n fi\\n done\\n case \\\"${board[*]}\\\" in\\n *[1-9]*) return 1;;\\n *) printf 'cat\\\\n'; return 0;;\\n esac\\n}\\n\\nhuman_turn() {\\n local token=$1\\n shift\\n local board=(\\\"$@\\\")\\n local n=0\\n while (( n < 1 || n > 9 )) || [[ \\\"${board[n-1]}\\\" != $n ]]; do\\n printf 'Enter space number: ' \\\"$n\\\" \\\"${board[n-1]}\\\" >/dev/tty\\n read n </dev/tty >/dev/tty 2>&1\\n done\\n board[n-1]=$token\\n printf '%s\\\\n' \\\"${board[@]}\\\"\\n}\\n\\ncomputer_turn() {\\n local token=$1\\n shift\\n local board=(\\\"$@\\\")\\n local i=0 blanks=() choice\\n for (( i=0; i<9; ++i )); do\\n if [[ \\\"${board[i]}\\\" == [1-9] ]]; then\\n blanks+=(\\\"$i\\\")\\n fi\\n done\\n choice=${blanks[RANDOM % ${#blanks[@]}]}\\n board[choice]=$token\\n printf '%s\\\\n' \\\"${board[@]}\\\"\\n}\\n\\nyorn() {\\n local yorn=\\n while [[ $yorn != [Yy]* && $yorn != [Nn]* ]]; do\\n printf '%s? ' \\\"$*\\\"\\n read yorn\\n done\\n [[ $yorn == [Yy]* ]]\\n}\\n\\nmain \\\"$@\\\"\\n\",\n \"language\": \"UNIX-Shell\"\n },\n {\n \"code\": \"import rand\\nimport os\\n\\n__global (\\n\\tb = [3][3]int{}\\n\\tbest_i = 0\\n\\tbest_j = 0\\n)\\n\\nfn main() {\\n\\tmut user := false\\n\\tmut yn :=''\\n\\tfor {\\n\\t\\tuser = !user\\n\\t\\tprint(game(user))\\n\\t\\tfor (yn != \\\"y\\\" ) && (yn != \\\"n\\\") {\\n\\t\\t\\tyn = os.input('Play again y/n: ').str().to_lower()\\n\\t\\t}\\n\\t\\tif yn != \\\"y\\\" {exit(0)} else {yn =''}\\n\\t\\tprintln('')\\n\\t}\\n}\\n\\nfn game(user bool) string {\\n\\tmut u := user\\n\\tmut move, mut my_move, mut i, mut j, mut win := 0, 0, 0, 0, 0\\n\\tfor k in 0..3 {\\n\\t\\tfor l in 0..3 {\\n\\t\\t\\tif b[k][l] != 0 {b[k][l] = 0}\\n\\t\\t}\\n\\t}\\n\\tprint(\\\"Board postions are numbered so:\\\\n1 2 3\\\\n4 5 6\\\\n7 8 9\\\\n\\\")\\n\\tprint(\\\"You have O, I have X.\\\\n\\\\n\\\")\\t\\n\\tfor k in 1..9 {\\n\\t\\tif u {\\n\\t\\t\\tfor move !in [1,2,3,4,5,6,7,8,9] {\\n \\t\\t\\t\\tmove = os.input('your move: ').int()\\n\\t\\t\\t}\\n\\t\\t\\tmove--\\n\\t\\t\\ti = move / 3\\n\\t\\t\\tj = move % 3\\t\\t\\n\\t\\t\\tif b[i][j] != 0 {continue}\\n\\t\\t\\tb[i][j] = 1\\n\\t\\t\\tmove = 0\\n\\t\\t}\\n\\t\\tif !u {\\n\\t\\t\\tif k == 1 {\\n\\t\\t\\t\\tbest_i = (rand.int_in_range(1, 9) or {exit(1)}) % 3\\n\\t\\t\\t\\tbest_j = (rand.int_in_range(1, 9) or {exit(1)}) % 3\\n\\t\\t\\t}\\n\\t\\t\\telse {test_move(-1, 0)}\\n\\t\\t\\tb[best_i][best_j] = -1\\n\\t\\t\\tmy_move = best_i * 3 + best_j + 1\\n\\t\\t\\tprintln(\\\"My move: $my_move\\\")\\n\\t\\t}\\n\\t\\tshow_board()\\n\\t\\twin = check_winner()\\n\\t\\tprintln(\\\"win res: $win\\\")\\n\\t\\tif win != 0 {\\n\\t\\t\\tif win == 1 {return \\\"You win\\\" + \\\".\\\\n\\\\n\\\"}\\n\\t\\t\\telse {return \\\"I win\\\" + \\\".\\\\n\\\\n\\\"}\\n\\t\\t}\\n\\t\\tu = !u\\n\\t}\\n\\treturn \\\"A draw.\\\\n\\\\n\\\"\\n}\\n\\nfn check_winner() int {\\n\\tfor i in 0..3 {\\n\\t\\tif b[i][0] != 0 && b[i][1] == b[i][0] && b[i][2] == b[i][0] {return b[i][0]}\\n\\t\\tif b[0][i] != 0 && b[1][i] == b[0][i] && b[2][i] == b[0][i] {return b[0][i]}\\n\\t}\\n\\tif b[1][1] == 0 {return 0}\\n\\tif b[1][1] == b[0][0] && b[2][2] == b[0][0] {return b[0][0]}\\n\\tif b[1][1] == b[2][0] && b[0][2] == b[1][1] {return b[1][1]}\\n\\treturn 0\\n}\\n\\nfn show_board() {\\n\\tmut t := \\\"X O\\\"\\n\\tfor i in 0..3 {\\n\\t\\tfor j in 0..3 {\\n\\t\\t\\tprint(\\\"${t[b[i][j] + 1].ascii_str()} \\\")\\n\\t\\t}\\n\\t\\tprintln('')\\n\\t}\\n\\tprintln(\\\"-----\\\")\\n}\\n\\nfn test_move(value int, depth int) int {\\n\\tmut best := -1\\n\\tmut changed := 0\\n\\tmut score := check_winner()\\n\\tif score != 0 {\\n\\t\\tif score == value {return 1} else {return -1}\\n\\t}\\n\\tfor i in 0..3 {\\n\\t\\tfor j in 0..3 {\\n\\t\\t\\tif b[i][j] != 0 {continue}\\n\\t\\t\\tb[i][j] = value\\n\\t\\t\\tchanged = value\\n\\t\\t\\tscore = -test_move(-value, depth + 1)\\n\\t\\t\\tb[i][j] = 0\\n\\t\\t\\tif score <= best {continue}\\n\\t\\t\\tif depth == 0 {\\n\\t\\t\\t\\tbest_i = i\\n\\t\\t\\t\\tbest_j = j\\n\\t\\t\\t}\\n\\t\\t\\tbest = score\\n\\t\\t}\\n\\t}\\n\\tif changed != 0 {return best}\\n\\treturn 0\\n}\\n\",\n \"language\": \"V-(Vlang)\"\n },\n {\n \"code\": \"Option Explicit\\n\\nPrivate Lines(1 To 3, 1 To 3) As String\\nPrivate Nb As Byte, player As Byte\\nPrivate GameWin As Boolean, GameOver As Boolean\\n\\nSub Main_TicTacToe()\\nDim p As String\\n\\n InitLines\\n printLines Nb\\n Do\\n p = WhoPlay\\n Debug.Print p & \\\" play\\\"\\n If p = \\\"Human\\\" Then\\n Call HumanPlay\\n GameWin = IsWinner(\\\"X\\\")\\n Else\\n Call ComputerPlay\\n GameWin = IsWinner(\\\"O\\\")\\n End If\\n If Not GameWin Then GameOver = IsEnd\\n Loop Until GameWin Or GameOver\\n If Not GameOver Then\\n Debug.Print p & \\\" Win !\\\"\\n Else\\n Debug.Print \\\"Game Over!\\\"\\n End If\\nEnd Sub\\n\\nSub InitLines(Optional S As String)\\nDim i As Byte, j As Byte\\n Nb = 0: player = 0\\n For i = LBound(Lines, 1) To UBound(Lines, 1)\\n For j = LBound(Lines, 2) To UBound(Lines, 2)\\n Lines(i, j) = \\\"#\\\"\\n Next j\\n Next i\\nEnd Sub\\n\\nSub printLines(Nb As Byte)\\nDim i As Byte, j As Byte, strT As String\\n Debug.Print \\\"Loop \\\" & Nb\\n For i = LBound(Lines, 1) To UBound(Lines, 1)\\n For j = LBound(Lines, 2) To UBound(Lines, 2)\\n strT = strT & Lines(i, j)\\n Next j\\n Debug.Print strT\\n strT = vbNullString\\n Next i\\nEnd Sub\\n\\nFunction WhoPlay(Optional S As String) As String\\n If player = 0 Then\\n player = 1\\n WhoPlay = \\\"Human\\\"\\n Else\\n player = 0\\n WhoPlay = \\\"Computer\\\"\\n End If\\nEnd Function\\n\\nSub HumanPlay(Optional S As String)\\nDim L As Byte, C As Byte, GoodPlay As Boolean\\n\\n Do\\n L = Application.InputBox(\\\"Choose the row\\\", \\\"Numeric only\\\", Type:=1)\\n If L > 0 And L < 4 Then\\n C = Application.InputBox(\\\"Choose the column\\\", \\\"Numeric only\\\", Type:=1)\\n If C > 0 And C < 4 Then\\n If Lines(L, C) = \\\"#\\\" And Not Lines(L, C) = \\\"X\\\" And Not Lines(L, C) = \\\"O\\\" Then\\n Lines(L, C) = \\\"X\\\"\\n Nb = Nb + 1\\n printLines Nb\\n GoodPlay = True\\n End If\\n End If\\n End If\\n Loop Until GoodPlay\\nEnd Sub\\n\\nSub ComputerPlay(Optional S As String)\\nDim L As Byte, C As Byte, GoodPlay As Boolean\\n\\n Randomize Timer\\n Do\\n L = Int((Rnd * 3) + 1)\\n C = Int((Rnd * 3) + 1)\\n If Lines(L, C) = \\\"#\\\" And Not Lines(L, C) = \\\"X\\\" And Not Lines(L, C) = \\\"O\\\" Then\\n Lines(L, C) = \\\"O\\\"\\n Nb = Nb + 1\\n printLines Nb\\n GoodPlay = True\\n End If\\n Loop Until GoodPlay\\nEnd Sub\\n\\nFunction IsWinner(S As String) As Boolean\\nDim i As Byte, j As Byte, Ch As String, strTL As String, strTC As String\\n\\n Ch = String(UBound(Lines, 1), S)\\n 'check lines & columns\\n For i = LBound(Lines, 1) To UBound(Lines, 1)\\n For j = LBound(Lines, 2) To UBound(Lines, 2)\\n strTL = strTL & Lines(i, j)\\n strTC = strTC & Lines(j, i)\\n Next j\\n If strTL = Ch Or strTC = Ch Then IsWinner = True: Exit For\\n strTL = vbNullString: strTC = vbNullString\\n Next i\\n 'check diagonales\\n strTL = Lines(1, 1) & Lines(2, 2) & Lines(3, 3)\\n strTC = Lines(1, 3) & Lines(2, 2) & Lines(3, 1)\\n If strTL = Ch Or strTC = Ch Then IsWinner = True\\nEnd Function\\n\\nFunction IsEnd() As Boolean\\nDim i As Byte, j As Byte\\n\\n For i = LBound(Lines, 1) To UBound(Lines, 1)\\n For j = LBound(Lines, 2) To UBound(Lines, 2)\\n If Lines(i, j) = \\\"#\\\" Then Exit Function\\n Next j\\n Next i\\n IsEnd = True\\nEnd Function\\n\",\n \"language\": \"VBA\"\n },\n {\n \"code\": \"import \\\"random\\\" for Random\\nimport \\\"./ioutil\\\" for Input\\n\\nvar r = Random.new()\\nvar b = List.filled(3, null)\\nfor (i in 0..2) b[i] = List.filled(3, 0) // board -> 0: blank; -1: computer; 1: human\\n\\nvar bestI = 0\\nvar bestJ = 0\\n\\nvar checkWinner = Fn.new {\\n for (i in 0..2) {\\n if (b[i][0] != 0 && b[i][1] == b[i][0] && b[i][2] == b[i][0]) return b[i][0]\\n if (b[0][i] != 0 && b[1][i] == b[0][i] && b[2][i] == b[0][i]) return b[0][i]\\n }\\n if (b[1][1] == 0) return 0\\n if (b[1][1] == b[0][0] && b[2][2] == b[0][0]) return b[0][0]\\n if (b[1][1] == b[2][0] && b[0][2] == b[1][1]) return b[1][1]\\n return 0\\n}\\n\\nvar showBoard = Fn.new {\\n var t = \\\"X O\\\"\\n for (i in 0..2) {\\n for (j in 0..2) System.write(\\\"%(t[b[i][j] + 1]) \\\")\\n System.print()\\n }\\n System.print(\\\"-----\\\")\\n}\\n\\nvar testMove // recursive\\ntestMove = Fn.new { |value, depth|\\n var best = -1\\n var changed = 0\\n var score = checkWinner.call()\\n if (score != 0) return (score == value) ? 1 : -1\\n for (i in 0..2) {\\n for (j in 0..2) {\\n if (b[i][j] == 0) {\\n b[i][j] = value\\n changed = value\\n score = -testMove.call(-value, depth + 1)\\n b[i][j] = 0\\n if (score > best) {\\n if (depth == 0) {\\n bestI = i\\n bestJ = j\\n }\\n best = score\\n }\\n }\\n }\\n }\\n return (changed != 0) ? best : 0\\n}\\n\\nvar game = Fn.new { |u|\\n for (i in 0..2) {\\n for (j in 0..2) b[i][j] = 0\\n }\\n System.print(\\\"Board postions are numbered so:\\\\n1 2 3\\\\n4 5 6\\\\n7 8 9\\\")\\n System.print(\\\"You have O, I have X.\\\\n\\\")\\n\\n for (k in 0..8) {\\n while (u) {\\n var move = Input.integer(\\\"Your move: \\\", 1, 9) - 1\\n var i = (move/3).floor\\n var j = move % 3\\n if (b[i][j] == 0) {\\n b[i][j] = 1\\n break\\n }\\n }\\n if (!u) {\\n if (k == 0) { // randomize if computer opens, less boring\\n bestI = r.int(1e6) % 3\\n bestJ = r.int(1e6) % 3\\n } else {\\n testMove.call(-1, 0)\\n }\\n b[bestI][bestJ] = -1\\n var myMove = bestI * 3 + bestJ + 1\\n System.print(\\\"My move: %(myMove)\\\")\\n }\\n showBoard.call()\\n var win = checkWinner.call()\\n if (win != 0) return ((win == 1) ? \\\"You win\\\" : \\\"I win\\\") + \\\".\\\\n\\\\n\\\"\\n u = !u\\n }\\n return \\\"A draw.\\\\n\\\\n\\\"\\n}\\n\\nvar user = false\\nwhile (true) {\\n user = !user\\n System.write(game.call(user))\\n var yn = Input.option(\\\"Play again y/n: \\\", \\\"yYnN\\\")\\n if (yn == \\\"n\\\" || yn == \\\"N\\\") return\\n System.print()\\n}\\n\",\n \"language\": \"Wren\"\n },\n {\n \"code\": \"\\\\The computer marks its moves with an \\\"O\\\" and the player uses an \\\"X\\\". The\\n\\\\ numeric keypad is used to make the player's move.\\n\\\\\\n\\\\ 7 | 8 | 9\\n\\\\ ---+---+---\\n\\\\ 4 | 5 | 6\\n\\\\ ---+---+---\\n\\\\ 1 | 2 | 3\\n\\\\\\n\\\\The player always goes first, but the 0 key is used to skip a move. Thus\\n\\\\ it can be used to let the computer play first. Esc terminates program.\\n\\ninc c:\\\\cxpl\\\\codes; \\\\intrinsic routine declarations\\ndef X0=16, Y0=10; \\\\coordinates of character in upper-left square\\nint I0,\\n PMove, \\\\player's move (^0..^9)\\n Key; \\\\keystroke\\nint X, O; \\\\bit arrays for player and computer\\n \\\\ bit 0 corresponds to playing square 1, etc.\\n\\n\\nproc HLine(X, Y); \\\\Draw a horizontal line\\nint X, Y;\\nint I;\\n[Cursor(X, Y);\\nfor I:= 0 to 10 do ChOut(0, ^Ä);\\n]; \\\\HLine\\n\\n\\nproc VLine(X, Y); \\\\Draw a vertical line over the above horizontal line\\nint X, Y;\\nint I;\\n[for I:= 0 to 4 do\\n [Cursor(X, Y+I);\\n ChOut(0, if I&1 then ^Å else ^³);\\n ];\\n]; \\\\VLine\\n\\n\\nfunc Won(p); \\\\Return 'true' if player P has won\\nint P;\\nint T, I;\\n[T:= [$007, $038, $1C0, $049, $092, $124, $111, $054];\\nfor I:= 0 to 7 do \\\\check if player matches a bit pattern for 3 in a row\\n if (P & T(I)) = T(I) then return true;\\nreturn false;\\n]; \\\\Won\\n\\n\\nfunc Cats; \\\\Return 'true' if no more moves available (Cat's game)\\n[if (X ! O) = $1FF then \\\\all bit positions played\\n [Cursor(17, 20);\\n Text(0, \\\"A draw!\\\");\\n return true;\\n ];\\nreturn false;\\n]; \\\\Cats\\n\\n\\nproc DoMove(P, M, Ch); \\\\Make move in player's bit array and display it\\nint P, \\\\address of player's bit array\\n M, \\\\index 0..8 where bit is placed\\n Ch;\\nint I, X, Y;\\n[P(0):= P(0) ! 1<<M; \\\\make move\\n\\nI:= M / 3; \\\\display move\\nX:= Rem(0) * 4;\\nY:= (2-I) * 2;\\nCursor(X+X0, Y+Y0);\\nChOut(0, Ch);\\n]; \\\\DoMove\\n\\n\\nfunc Try(P); \\\\Return the value of the best node for player P\\nint P; \\\\address of player's bit array\\nint P1, I, I0, V, V0;\\n[P1:= if P = addr X then addr O else addr X;\\n\\nif Won(P1(0)) then return -1;\\nif (X ! O) = $1FF then return 0;\\n\\nV0:= -1; \\\\assume the worst\\nfor I:= 0 to 8 do \\\\for all of the squares...\\n if ((O!X) & 1<<I) = 0 then \\\\if square is unused\\n [P(0):= P(0) ! 1<<I; \\\\make tenative move\\n V:= -(extend(Try(P1))); \\\\get value\\n if V > V0 then \\\\save best value\\n [V0:= V; I0:= I];\\n P(0):= P(0) & ~(1<<I); \\\\undo tenative move\\n ];\\nreturn V0 & $FF ! I0<<8;\\n]; \\\\Try\\n\\n\\nproc PlayGame; \\\\Play one game\\n[ChOut(0, $0C\\\\FF\\\\); \\\\clear screen with a form feed\\nHLine(X0-1, Y0+1); \\\\draw grid (#)\\nHLine(X0-1, Y0+3);\\nVLine(X0+2, Y0);\\nVLine(X0+6, Y0);\\n\\nX:= 0; O:= 0; \\\\initialize player's bit arrays to empty\\nloop [loop [PMove:= ChIn(1); \\\\GET PLAYER'S MOVE (X)\\n if PMove = $1B\\\\Esc\\\\ then\\n [SetVid(3); exit]; \\\\restore display and end program\\n if PMove = ^0 then quit;\\n if PMove>=^1 & PMove<=^9 & \\\\check for legal move\\n ((X!O) & 1<<(PMove-^1)) = 0 then quit;\\n ChOut(0, 7\\\\Bel\\\\); \\\\beep the dude\\n ];\\n if PMove # ^0 then\\n [DoMove(addr X, PMove-^1, ^X);\\n if Won(X) then\\n [Cursor(17, 20);\\n Text(0, \\\"X wins!\\\");\\n quit;\\n ];\\n ];\\n if Cats then quit;\\n\\n I0:= Try(addr O) >>8; \\\\GET COMPUTER'S MOVE (O)\\n DoMove(addr O, I0, ^O); \\\\do best move\\n if Won(O) then\\n [Cursor(17, 20);\\n Text(0, \\\"O wins!\\\");\\n quit;\\n ];\\n if Cats then quit;\\n ];\\n]; \\\\PlayGame\\n\\n\\nint CpuReg;\\n[SetVid(1); \\\\set 40x25 text mode\\nCpuReg:= GetReg; \\\\turn off annoying flashing cursor\\nCpuReg(0):= $0100; \\\\ with BIOS interrupt 10h, function 01h\\nCpuReg(2):= $2000; \\\\set cursor type to disappear\\nSoftInt($10);\\nloop [PlayGame;\\n Key:= ChIn(1); \\\\keep playing games until Esc key is hit\\n if Key = $1B\\\\Esc\\\\ then\\n [SetVid(3); exit]; \\\\clear screen & restore normal text mode\\n ];\\n]\\n\",\n \"language\": \"XPL0\"\n },\n {\n \"code\": \"5 REM Adaptation to Yabasic of the program published in Tim Hartnell's book \\\"Artificial Intelligence: Concepts and Programs\\\", with some minor modifications. 6/2018.\\n10 REM TICTAC\\n15 INPUT \\\"English (0), Spanish (other key): \\\" IDIOMA : IF NOT IDIOMA THEN RESTORE 2020 ELSE RESTORE 2010 END IF\\n20 GOSUB 1180: REM INICIALIZACION\\n30 REM *** REQUISITOS PREVIOS AL JUEGO ***\\n40 FOR J = 1 TO 9\\n50 A(J) = 32\\n60 NEXT J\\n70 FOR J = 1 TO 5\\n80 D(J) = 0\\n90 NEXT J\\n100 CCONTADOR = 0\\n110 R$ = \\\"\\\"\\n120 GOSUB 1070: REM IMPRESION DEL TABLERO\\n130 REM ** CICLO PRINCIPAL **\\n140 GOSUB 540: REM MOVIMIENTO DEL ORDENADOR\\n150 GOSUB 1070: REM IMPRESION DEL TABLERO\\n160 GOSUB 870: REM COMPRUEBA LA VICTORIA\\n170 IF R$ <> \\\"\\\" GOTO 240\\n180 GOSUB 980: REM SE ACEPTA EL MOVIMIENTO DE LA PERSONA\\n190 GOSUB 1070: REM IMPRESION DEL TABLERO\\n200 GOSUB 870: REM COMPRUEBA LA VICTORIA\\n210 IF R$ = \\\"\\\" GOTO 140\\n220 REM ** FIN DEL CICLO PRINCIPAL **\\n230 REM *****************************\\n240 REM FIN DEL JUEGO\\n250 GOSUB 1070: REM IMPRESION DEL TABLERO\\n260 PRINT: PRINT\\n270 IF R$ = \\\"G\\\" PRINT MENSAJE$(1): BANDERA = -1\\n280 IF R$ = \\\"P\\\" PRINT MENSAJE$(2): BANDERA = 1\\n290 IF R$ = \\\"D\\\" PRINT MENSAJE$(3): GOTO 430\\n300 REM ACTUALIZACION DE LA BASE DE DATOS\\n310 FOR B = 1 TO 5\\n320 FOR J = 2 TO 9\\n330 IF M(J) = D(B) GOSUB 370\\n340 NEXT J\\n350 NEXT B\\n360 GOTO 430\\n370 REM ** REORDENACION DE LOS ELEMENTOS DE LA MATRIZ M **\\n380 TEMP = M(J + BANDERA)\\n390 M(J + BANDERA) = M(J)\\n400 M(J) = TEMP\\n410 J = 9\\n420 RETURN\\n430 PRINT: PRINT\\n440 PRINT MENSAJE$(4)\\n450 PRINT: PRINT\\n460 FOR J = 1 TO 9\\n470 PRINT M(J), \\\" \\\";\\n480 NEXT J\\n490 PRINT: PRINT\\n500 PRINT MENSAJE$(5)\\n510 INPUT A$\\n520 GOTO 30\\n530 REM ************************\\n540 REM MOVIMIENTO DEL ORDENADOR\\n550 P = ASC(\\\"O\\\")\\n560 X = 0\\n570 J = 1\\n580 IF A(W(J)) = A(W(J + 1)) AND A(W(J + 2)) = 32 AND A(W(J)) = P X = W(J + 2): GOTO 750\\n590 IF A(W(J)) = A(W(J + 2)) AND A(W(J + 1)) = 32 AND A(W(J)) = P X = W(J + 1): GOTO 750\\n600 IF A(W(J + 1)) = A(W(J + 2)) AND A(W(J)) = 32 AND A(W(J + 1)) = P X = W(J): GOTO 750\\n610 IF J < 21 J = J + 3: GOTO 580\\n620 IF P = ASC(\\\"O\\\") P = ASC(\\\"X\\\"): GOTO 570\\n630 REM ** SI NO SE GANA SE BUSCA UN MOVIMIENTO DE BLOQUEO **\\n640 REM * ENTONCES SE USA LA SIGUIENTE SECCION *\\n650 J = 1\\n660 IF A(M(J)) = 32 X = M(J): GOTO 750\\n670 IF J < 10 J = J + 1: GOTO 660\\n680 H = 0\\n690 H = H + 1\\n700 X = INT(RAN(1) * 9): IF A(X) = 32 GOTO 750\\n710 IF H < 100 GOTO 690\\n720 R$ = \\\"D\\\": REM ES SIMPLEMENTE UN DIBUJO\\n730 RETURN\\n740 REM *********************\\n750 REM REALIZA EL MOVIMIENTO\\n760 A(X) = ASC(\\\"O\\\")\\n770 CCONTADOR = CCONTADOR + 1\\n780 D(CCONTADOR) = X\\n790 BANDERA = 0\\n800 FOR J = 1 TO 9\\n810 IF A(J) = 32 BANDERA = 1\\n820 NEXT J\\n830 IF BANDERA = 0 AND R$ = \\\"\\\" R$ = \\\"D\\\"\\n840 REM SI TODAS LAS CASILLAS ESTAN LLENAS Y R$ ESTA VACIO, ENTONCES ES SIMPLEMENTE UN DIBUJO\\n850 RETURN\\n860 REM *********************\\n870 REM COMPRUEBA LA VICTORIA\\n880 J = 1\\n890 IF A(W(J)) = 32 J = J + 3\\n900 IF J > 23 RETURN\\n910 IF A(W(J)) = A(W(J + 1)) AND A(W(J)) = A(W(J + 2)) GOTO 940\\n920 IF J < 22 J = J + 3: GOTO 890\\n930 RETURN\\n940 IF A(W(J)) = ASC(\\\"O\\\") R$ = \\\"G\\\": REM EL ORDENADOR GANA\\n950 IF A(W(J)) = ASC(\\\"X\\\") R$ = \\\"P\\\": REM EL ORDENADOR PIERDE\\n960 RETURN\\n970 REM ************************\\n980 REM MOVIMIENTO DE LA PERSONA\\n990 PRINT: PRINT\\n1000 PRINT MENSAJE$(6)\\n1010 PRINT MENSAJE$(7); : INPUT MOVIMIENTO\\n1020 IF MOVIMIENTO < 1 OR MOVIMIENTO > 9 GOTO 1010\\n1030 IF A(MOVIMIENTO) <> 32 GOTO 1010\\n1040 A(MOVIMIENTO) = ASC(\\\"X\\\")\\n1050 RETURN\\n1060 REM *********************\\n1070 REM IMPRESION DEL TABLERO\\n1080 CLEAR SCREEN\\n1090 PRINT: PRINT: PRINT\\n1100 PRINT \\\" 1 : 2 : 3 \\\", CHR$(A(1)), \\\" : \\\", CHR$(A(2)), \\\" : \\\", CHR$(A(3))\\n1110 PRINT \\\"----------- ------------\\\"\\n1120 PRINT \\\" 4 : 5 : 6 \\\", CHR$(A(4)), \\\" : \\\", CHR$(A(5)), \\\" : \\\", CHR$(A(6))\\n1130 PRINT \\\"----------- ------------\\\"\\n1140 PRINT \\\" 7 : 8 : 9 \\\", CHR$(A(7)), \\\" : \\\", CHR$(A(8)), \\\" : \\\", CHR$(A(9))\\n1150 PRINT\\n1160 RETURN\\n1170 REM **************\\n1180 REM INICIALIZACION\\n1190 CLEAR SCREEN\\n1200 DIM A(9) : REM TABLERO\\n1210 DIM M(10) : REM ACCESO A LA BASE DE DATOS\\n1220 DIM W(24) : REM DATOS DE VICTORIA O BLOQUEO\\n1230 DIM D(5) : REM ACCESO AL MOVIMIENTO EN EL JUEGO ACTUAL\\n1235 DIM MENSAJE$(1) : READ M$ : N = TOKEN(M$,MENSAJE$(),\\\",\\\") : RESTORE\\n1240 REM DATOS DE VICTORIA O BLOQUEO\\n1250 FOR J = 1 TO 24\\n1260 READ W(J)\\n1270 NEXT J\\n1280 DATA 1, 2, 3, 4, 5, 6, 7, 8, 9\\n1290 DATA 1, 4, 7, 2, 5, 8, 3, 6, 9\\n1300 DATA 1, 5, 9, 3, 5, 7\\n1310 REM BASE INICIAL DE DATOS\\n1320 FOR J = 1 TO 10\\n1330 READ M(J)\\n1340 NEXT J\\n1350 DATA 2, 6, 8, 4, 7, 3, 1, 9, 5, 2\\n1360 RETURN\\n2000 REM MENSAJES EN ESPAÑOL\\n2010 DATA \\\"YO GANO,TU GANAS,ES SIMPLEMENTE UN DIBUJO,ESTA ES MI PRIORIDAD ACTUALIZADA,PULSE LA TECLA <RETURN> PARA CONTINUAR,REALICE SU MOVIMIENTO,MOVIMIENTO: \\\"\\n2020 DATA \\\"I WIN,YOU WIN,IT'S JUST A DRAWING,THIS IS MY PRIORITY UPDATE,PRESS <RETURN> TO CONTINUE,TO MAKE YOUR MOVE,MOVEMENT: \\\"\\n\",\n \"language\": \"Yabasic\"\n }\n]","isConversational":false},"task_name":{"kind":"string","value":"Tic-tac-toe"}}},{"rowIdx":1760,"cells":{"solutions":{"kind":"list like","value":[{"code":"---\ncategory:\n- Simple\nfrom: http://rosettacode.org/wiki/Tokenize_a_string\nnote: String manipulation\n","language":"00-META"},{"code":"Separate the string \"Hello,How,Are,You,Today\" by commas into an array (or list) so that each element of it stores a different word. \n\nDisplay the words to the 'user', in the simplest manner possible, separated by a period. \n\nTo simplify, you may display a trailing period.\n\n\n{{Template:Strings}}\n<br><br>\n\n","language":"00-TASK"},{"code":"V text = ‘Hello,How,Are,You,Today’\nV tokens = text.split(‘,’)\nprint(tokens.join(‘.’))\n","language":"11l"},{"code":"* Tokenize a string - 08/06/2018\nTOKSTR CSECT\n USING TOKSTR,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 MVC N,=A(1) n=1\n LA R7,1 i1=1\n LA R6,1 i=1\n DO WHILE=(C,R6,LE,LENS) do i=1 to length(s);\n LA R4,S-1 @s-1\n AR R4,R6 +i\n MVC C,0(R4) c=substr(s,i,1)\n IF CLI,C,EQ,C',' THEN if c=',' then do\n BAL R14,TOK call tok\n LR R2,R8 i2\n SR R2,R7 i2-i1\n LA R2,1(R2) i2-i1+1\n L R1,N n\n SLA R1,1 *2\n STH R2,TALEN-2(R1) talen(n)=i2-i1+1\n L R2,N n\n LA R2,1(R2) n+1\n ST R2,N n=n+1\n LA R7,1(R6) i1=i+1\n ENDIF , endif\n LA R6,1(R6) i++\n ENDDO , enddo i\n BAL R14,TOK call tok\n LR R2,R8 i2\n SR R2,R7 i2-i1\n LA R2,1(R2) i2-i1+1\n L R1,N n\n SLA R1,1 *2\n STH R2,TALEN-2(R1) talen(n)=i2-i1+1\n LA R11,PG pgi=@pg\n LA R6,1 i=1\n DO WHILE=(C,R6,LE,N) do i=1 to n\n LR R1,R6 i\n SLA R1,1 *2\n LH R10,TALEN-2(R1) l=talen(i)\n LR R1,R6 i\n SLA R1,3 *8\n LA R4,TABLE-8(R1) @table(i)\n LR R2,R10 l\n BCTR R2,0 ~\n EX R2,MVCX output table(i) length(l)\n AR R11,R10 pgi=pgi+l\n IF C,R6,NE,N THEN if i^=n then\n MVC 0(1,R11),=C'.' output '.'\n LA R11,1(R11) pgi=pgi+1\n ENDIF , endif\n LA R6,1(R6) i++\n ENDDO , enddo i\n XPRNT PG,L'PG print\n L R13,4(0,R13) restore previous savearea pointer\n RETURN (14,12),RC=0 restore registers from calling sav\nTOK LR R5,R6 i <--\n BCTR R5,0 i-1 |\n LR R8,R5 i2=i-1\n SR R5,R7 i2-i1\n LA R5,1(R5) l=i2-i1+1 source length\n L R1,N n\n SLA R1,3 *8\n LA R2,TABLE-8(R1) @table(n)\n LA R4,S-1 @s-1\n AR R4,R7 @s+i1-1\n LA R3,8 target length\n MVCL R2,R4 table(n)=substr(s,i1,i2-i1+1) |\n BR R14 End TOK subroutine <--\nMVCX MVC 0(0,R11),0(R4) output table(i)\nS DC CL80'Hello,How,Are,You,Today' <== input string ==\nLENS DC F'23' length(s) <==\nTABLE DC 8CL8' ' table(8)\nTALEN DC 8H'0' talen(8)\nC DS CL1 char\nN DS F number of tokens\nPG DC CL80' ' buffer\n YREGS\n END TOKSTR\n","language":"360-Assembly"},{"code":"puts:\tequ\t9\n\torg\t100h\n\tjmp\tdemo\n\t;;;\tSplit the string at DE by the character in C.\n\t;;;\tStore pointers to the beginning of the elements starting at HL\n\t;;;\tThe amount of elements is returned in B.\nsplit:\tmvi\tb,0\t\t; Amount of elements\nsloop:\tmov\tm,e\t\t; Store pointer at [HL]\n\tinx\th\n\tmov\tm,d\n\tinx\th\n\tinr\tb\t\t; Increment counter\nsscan:\tldax\td\t\t; Get current character\n\tinx\td\n\tcpi\t'$'\t\t; Done?\n\trz\t\t\t; Then stop\n\tcmp\tc\t\t; Place to split?\n\tjnz\tsscan\t\t; If not, keep going\n\tdcx\td\n\tmvi\ta,'$'\t\t; End the string here\n\tstax\td\n\tinx\td\n\tjmp\tsloop\t\t; Next part\n\t;;;\tTest on the string given in the task\ndemo:\tlxi\th,parts\t\t; Parts array\n\tlxi\td,hello\t\t; String\n\tmvi\tc,','\n\tcall \tsplit\t\t; Split the string\n\tlxi\th,parts\t\t; Print each part\nloop:\tmov\te,m\t\t; Load pointer into DE\n\tinx\th\n\tmov\td,m\n\tinx\th\n\tpush\th\t\t; Keep the array pointer\n\tpush\tb\t\t; And the counter\n\tmvi\tc,puts \t\t; Print the string\n\tcall\t5\n\tlxi\td,period\t; And a period\n\tmvi\tc,puts\n\tcall \t5\n\tpop \tb\t\t; Restore the counter\n\tpop \th\t\t; Restore the array pointer\n\tdcr\tb \t\t; One fewer string left\n\tjnz \tloop\n\tret\nperiod:\tdb\t'. $'\nhello:\tdb\t'Hello,How,Are,You,Today$'\nparts:\tequ\t$\n","language":"8080-Assembly"},{"code":"\tcpu\t8086\n\torg\t100h\nsection\t.text\n\tjmp\tdemo\n\t;;;\tSplit the string at DS:SI on the character in DL.\n\t;;;\tStore pointers to strings starting at ES:DI.\n\t;;;\tThe amount of strings is returned in CX.\nsplit:\txor\tcx,cx\t\t; Zero out counter\n.loop:\tmov\tax,si\t\t; Store pointer to current location\n\tstosw\n\tinc\tcx\t\t; Increment counter\n.scan:\tlodsb\t\t\t; Get byte\n\tcmp\tal,'$'\t\t; End of string?\n\tje\t.done\n\tcmp\tal,dl\t\t; Character to split on?\n\tjne\t.scan\n\tmov\t[si-1],byte '$'\t; Terminate string\n\tjmp\t.loop\n.done:\tret\n\t;;;\tTest on the string given in the task\ndemo:\tmov\tsi,hello\t; String to split\n\tmov\tdi,parts\t; Place to store pointers\n\tmov\tdl,','\t\t; Character to split string on\n\tcall\tsplit\n\t;;;\tPrint the resulting strings, and periods\n\tmov\tsi,parts\t; Array of string pointers\nprint:\tlodsw\t\t\t; Load next pointer\n\tmov\tdx,ax\t\t; Print string using DOS\n\tmov\tah,9\n\tint\t21h\n\tmov\tdx,period\t; Then print a period\n\tint\t21h\n\tloop\tprint\t\t; Loop while there are strings\n\tret\nsection .data\nperiod:\tdb\t'. $'\nhello:\tdb\t'Hello,How,Are,You,Today$'\nsection\t.bss\nparts:\tresw\t10\n","language":"8086-Assembly"},{"code":"/* ARM assembly AARCH64 Raspberry PI 3B */\n/* program strTokenize64.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 NBPOSTESECLAT, 20\n\n/*******************************************/\n/* Initialized data */\n/*******************************************/\n.data\nszMessFinal: .asciz \"Words are : \\n\"\n\nszString: .asciz \"Hello,How,Are,You,Today\"\nszMessError: .asciz \"Error tokenize !!\\n\"\nszCarriageReturn: .asciz \"\\n\"\n/*******************************************/\n/* UnInitialized data */\n/*******************************************/\n.bss\n/*******************************************/\n/* code section */\n/*******************************************/\n.text\n.global main\nmain:\n ldr x0,qAdrszString // string address\n mov x1,',' // separator\n bl stTokenize\n cmp x0,-1 // error ?\n beq 99f\n mov x2,x0 // table address\n ldr x0,qAdrszMessFinal // display message\n bl affichageMess\n ldr x4,[x2] // number of areas\n add x2,x2,8 // first area\n mov x3,0 // loop counter\n mov x0,x2\n1: // display loop\n ldr x0,[x2,x3, lsl 3] // address area\n bl affichageMess\n ldr x0,qAdrszCarriageReturn // display carriage return\n bl affichageMess\n add x3,x3,1 // counter + 1\n cmp x3,x4 // end ?\n blt 1b // no -> loop\n\n b 100f\n99: // display error message\n ldr x0,qAdrszMessError\n bl affichageMess\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\nqAdrszString: .quad szString\n//qAdrszFinalString: .quad szFinalString\nqAdrszMessFinal: .quad szMessFinal\nqAdrszMessError: .quad szMessError\nqAdrszCarriageReturn: .quad szCarriageReturn\n\n/*******************************************************************/\t\n/* Separate string by separator into an array */\n/* areas are store on the heap Linux */\n/*******************************************************************/\t\n/* x0 contains string address */\n/* x1 contains separator character (, or . or : ) */\n/* x0 returns table address with first item = number areas */\n/* and other items contains pointer of each string */\nstTokenize:\n stp x1,lr,[sp,-16]! // save registers\n mov x16,x0\n mov x9,x1 // save separator\n mov x14,0\n1: // compute length string for place reservation on the heap\n ldrb w12,[x0,x14]\n cbz x12, 2f\n add x14,x14,1\n b 1b\n2:\n ldr x12,qTailleTable\n add x15,x12,x14\n and x15,x15,0xFFFFFFFFFFFFFFF0\n add x15,x15,16 // align word on the heap\n // place reservation on the heap\n mov x0,0 // heap address\n mov x8,BRK // call system linux 'brk'\n svc 0 // call system\n cmp x0,-1 // error call system\n beq 100f\n mov x14,x0 // save address heap begin = begin array\n add x0,x0,x15 // reserve x15 byte on the heap\n mov x8,BRK // call system linux 'brk'\n svc 0\n cmp x0,-1\n beq 100f\n // string copy on the heap\n add x13,x14,x12 // behind the array\n mov x0,x16\n mov x1,x13\n3: // loop copy string\n ldrb w12,[x0],1 // read one byte and increment pointer one byte\n strb w12,[x1],1 // store one byte and increment pointer one byte\n cbnz x12,3b // end of string ? no -> loop\n\n mov x0,#0\n str x0,[x14]\n str x13,[x14,8]\n mov x12,#1 // areas counter\n4: // loop load string character\n ldrb w0,[x13]\n cbz x0,5f // end string\n cmp x0,x9 // separator ?\n cinc x13,x13,ne // no -> next location\n bne 4b // and loop\n strb wzr,[x13] // store zero final of string\n add x13,x13,1 // next character\n add x12,x12,1 // areas counter + 1\n str x13,[x14,x12, lsl #3] // store address area in the table at index x2\n b 4b // and loop\n\n5:\n str x12,[x14] // store number areas\n mov x0,x14 // returns array address\n100:\n ldp x1,lr,[sp],16 // restaur 2 registers\n ret // return to address lr x30\nqTailleTable: .quad 8 * NBPOSTESECLAT\n\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":"(defun split-at (xs delim)\n (if (or (endp xs) (eql (first xs) delim))\n (mv nil (rest xs))\n (mv-let (before after)\n (split-at (rest xs) delim)\n (mv (cons (first xs) before) after))))\n\n(defun split (xs delim)\n (if (endp xs)\n nil\n (mv-let (before after)\n (split-at xs delim)\n (cons before (split after delim)))))\n\n(defun css->strs (css)\n (if (endp css)\n nil\n (cons (coerce (first css) 'string)\n (css->strs (rest css)))))\n\n(defun split-str (str delim)\n (css->strs (split (coerce str 'list) delim)))\n\n(defun print-with (strs delim)\n (if (endp strs)\n (cw \"~%\")\n (progn$ (cw (first strs))\n (cw (coerce (list delim) 'string))\n (print-with (rest strs) delim))))\n","language":"ACL2"},{"code":"CARD EndProg ;required for ALLOCATE.ACT\n\nINCLUDE \"D2:ALLOCATE.ACT\" ;from the Action! Tool Kit. You must type 'SET EndProg=*' from the monitor after compiling, but before running this program!\n\nDEFINE PTR=\"CARD\"\n\nBYTE FUNC Split(CHAR ARRAY s CHAR c PTR ARRAY items)\n BYTE i,count,start,len\n CHAR ARRAY item\n\n IF s(0)=0 THEN RETURN (0) FI\n\n i=1 count=0\n WHILE i<s(0)\n DO\n start=i\n WHILE i<=s(0) AND s(i)#c\n DO\n i==+1\n OD\n len=i-start\n item=Alloc(len+1)\n SCopyS(item,s,start,i-1)\n items(count)=item\n count==+1\n i==+1\n OD\nRETURN (count)\n\nPROC Join(PTR ARRAY items BYTE count CHAR c CHAR ARRAY s)\n BYTE i,pos\n CHAR POINTER srcPtr,dstPtr\n CHAR ARRAY item\n\n s(0)=0\n IF count=0 THEN RETURN FI\n\n pos=1\n FOR i=0 TO count-1\n DO\n item=items(i)\n srcPtr=item+1\n dstPtr=s+pos\n MoveBlock(dstPtr,srcPtr,item(0))\n pos==+item(0)\n IF i<count-1 THEN\n s(pos)='.\n pos==+1\n FI\n OD\n s(0)=pos-1\nRETURN\n\nPROC Clear(PTR ARRAY items BYTE POINTER count)\n BYTE i\n CHAR ARRAY item\n\n IF count^=0 THEN RETURN FI\n\n FOR i=0 TO count^-1\n DO\n item=items(i)\n Free(item,item(0)+1)\n OD\n count^=0\nRETURN\n\nPROC Main()\n CHAR ARRAY s=\"Hello,How,Are,You,Today\"\n CHAR ARRAY r(256)\n PTR ARRAY items(100)\n BYTE i,count\n\n Put(125) PutE() ;clear screen\n\n AllocInit(0)\n count=Split(s,',,items)\n Join(items,count,'.,r)\n\n PrintF(\"Input:%E\"\"%S\"\"%E%E\",s)\n PrintE(\"Split:\")\n FOR i=0 TO count-1\n DO\n PrintF(\"\"\"%S\"\"\",items(i))\n IF i<count-1 THEN\n Print(\", \")\n ELSE\n PutE() PutE()\n FI\n OD\n PrintF(\"Join:%E\"\"%S\"\"%E\",r)\n\n Clear(items,@count)\nRETURN\n","language":"Action-"},{"code":"var hello:String = \"Hello,How,Are,You,Today\";\nvar tokens:Array = hello.split(\",\");\ntrace(tokens.join(\".\"));\n\n// Or as a one-liner\ntrace(\"Hello,How,Are,You,Today\".split(\",\").join(\".\"));\n","language":"ActionScript"},{"code":"with Ada.Text_IO, Ada.Containers.Indefinite_Vectors, Ada.Strings.Fixed, Ada.Strings.Maps;\nuse Ada.Text_IO, Ada.Containers, Ada.Strings, Ada.Strings.Fixed, Ada.Strings.Maps;\n\nprocedure Tokenize is\n package String_Vectors is new Indefinite_Vectors (Positive, String);\n use String_Vectors;\n Input : String := \"Hello,How,Are,You,Today\";\n Start : Positive := Input'First;\n Finish : Natural := 0;\n Output : Vector := Empty_Vector;\nbegin\n while Start <= Input'Last loop\n Find_Token (Input, To_Set (','), Start, Outside, Start, Finish);\n exit when Start > Finish;\n Output.Append (Input (Start .. Finish));\n Start := Finish + 1;\n end loop;\n for S of Output loop\n Put (S & \".\");\n end loop;\nend Tokenize;\n","language":"Ada"},{"code":"main:(\n\n OP +:= = (REF FLEX[]STRING in out, STRING item)VOID:(\n [LWB in out: UPB in out+1]STRING new;\n new[LWB in out: UPB in out]:=in out;\n new[UPB new]:=item;\n in out := new\n );\n\n PROC string split = (REF STRING beetles, STRING substr)[]STRING:(\n \"\"\" Split beetles where substr is found \"\"\";\n FLEX[1:0]STRING out;\n INT start := 1, pos;\n WHILE string in string(substr, pos, beetles[start:]) DO\n out +:= STRING(beetles[start:start+pos-2]);\n start +:= pos + UPB substr - 1\n OD;\n IF start > LWB beetles THEN\n out +:= STRING(beetles[start:])\n FI;\n out\n );\n\n PROC char split = (REF STRING beetles, STRING chars)[]STRING: (\n \"\"\" Split beetles where character is found in chars \"\"\";\n FLEX[1:0]STRING out;\n FILE beetlef;\n associate(beetlef, beetles); # associate a FILE handle with a STRING #\n make term(beetlef, chars); # make term: assign CSV string terminator #\n\n PROC raise logical file end = (REF FILE f)BOOL: except logical file end;\n on logical file end(beetlef, raise logical file end);\n\n STRING solo;\n DO\n getf(beetlef, ($g$, solo));\n out+:=solo;\n getf(beetlef, ($x$)) # skip CHAR separator #\n OD;\n except logical file end:\n SKIP;\n out\n );\n\n STRING beetles := \"John Lennon, Paul McCartney, George Harrison, Ringo Starr\";\n\n printf(($g\".\"$, string split(beetles, \", \"),$l$));\n printf(($g\".\"$, char split(beetles, \", \"),$l$))\n)\n","language":"ALGOL-68"},{"code":"#include <hopper.h>\n\n#proto splitdate(_DATETIME_)\n#proto splitnumber(_N_)\n#proto split(_S_,_T_)\n\nmain:\n\n s=\"this string will be separated into parts with space token separator\"\n\n aS=0,let( aS :=_split(s,\" \"))\n\n {\",\"}toksep // set a new token separator\n {\"String: \",s}\n {\"\\nArray:\\n\",aS},\n {\"\\nSize=\"}size(aS),println // \"size\" return an array: {dims,#rows,#cols,#pages}\n\n {\"\\nOriginal number: \",-125.489922},println\n w=0,let(w:=_split number(-125.489922) )\n {\"Integer part: \"}[1]get(w) // get first element from array \"w\"\n {\"\\nDecimal part: \"}[2]get(w),println // get second element from array \"w\"\n\n {\"\\nDate by DATENOW(TODAY) macro: \"},print\n dt=0, let( dt :=_splitdate(datenow(TODAY);!puts)) // \"!\" keep first element from stack\n {\"\\nDate: \"}[1]get(dt)\n {\"\\nTime: \"}[2]get(dt),println\n\nexit(0)\n\n.locals\nsplitdate(_DATETIME_)\n _SEP_=0,gettoksep,mov(_SEP_) // \"gettoksep\" return actual token separator\n {\",\"}toksep, // set a new token separator\n _NEWARRAY_={}\n {1},$( _DATETIME_ ),\n {2},$( _DATETIME_ ),pushall(_NEWARRAY_)\n {_SEP_}toksep // restore ols token separator\n {_NEWARRAY_}\nback\n\nsplitnumber(_X_)\n part_int=0,part_dec=0,\n {_X_},!trunc,mov(part_int),\n minus(part_int), !sign,mul\n xtostr,mov(part_dec), part_dec+=2, // \"part_dec+=2\", delete \"0.\" from \"part_dec\"\n {part_dec}xtonum,mov(part_dec)\n _NEWARRAY_={},{part_int,part_dec},pushall(_NEWARRAY_)\n {_NEWARRAY_}\nback\n\nsplit(_S_,_T_)\n _NEWARRAY_={},_VAR1_=0,_SEP_=0,gettoksep,mov(_SEP_)\n {_T_}toksep,totaltoken(_S_),\n mov(_VAR1_), // for total tokens\n _VAR2_=1, // for real position of tokens into the string\n ___SPLIT_ITER:\n {_VAR2_}$( _S_ ),push(_NEWARRAY_)\n ++_VAR2_,--_VAR1_\n { _VAR1_ },jnz(___SPLIT_ITER) // jump to \"___SPLIT_ITER\" if \"_VAR1_\" is not zero.\n clear(_VAR2_),clear(_VAR1_)\n {_SEP_}toksep\n {_NEWARRAY_}\nback\n","language":"Amazing-Hopper"},{"code":" '.',⍨¨ ','(≠⊆⊢)'abc,123,X' ⍝ [1] Do the split: ','(≠⊆⊢)'abc,123,X'; [2] append the periods: '.',⍨¨\n abc. 123. X. ⍝ 3 strings (char vectors), each with a period at the end.\n","language":"APL"},{"code":"on run\n intercalate(\".\", splitOn(\",\", \"Hello,How,Are,You,Today\"))\nend run\n\n\n-- splitOn :: String -> String -> [String]\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-- intercalate :: String -> [String] -> String\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","language":"AppleScript"},{"code":"set my text item delimiters to \",\"\nset tokens to the text items of \"Hello,How,Are,You,Today\"\n\nset my text item delimiters to \".\"\nlog tokens as text\n","language":"AppleScript"},{"code":"100 T$ = \"HELLO,HOW,ARE,YOU,TODAY\"\n110 GOSUB 200\"TOKENIZE\n120 FOR I = 1 TO N\n130 PRINT A$(I) \".\" ;\n140 NEXT\n150 PRINT\n160 END\n\n200 IF N = 0 THEN DIM A$(256)\n210 N = 1\n220 A$(N) = \"\n230 FOR TI = 1 TO LEN(T$)\n240 C$ = MID$(T$, TI, 1)\n250 T = C$ = \",\"\n260 IF T THEN C$ = \"\n270 N = N + T\n280 IF T THEN A$(N) = C$\n290 A$(N) = A$(N) + C$\n300 NEXT TI\n310 RETURN\n","language":"Applesoft-BASIC"},{"code":"/* ARM assembly Raspberry PI */\n/* program strTokenize.s */\n\n/* Constantes */\n.equ STDOUT, 1 @ Linux output console\n.equ EXIT, 1 @ Linux syscall\n.equ WRITE, 4 @ Linux syscall\n\n.equ NBPOSTESECLAT, 20\n\n/* Initialized data */\n.data\nszMessFinal: .asciz \"Words are : \\n\"\n\nszString: .asciz \"Hello,How,Are,You,Today\"\nszMessError: .asciz \"Error tokenize !!\\n\"\nszCarriageReturn: .asciz \"\\n\"\n\n/* UnInitialized data */\n.bss\n\n/* code section */\n.text\n.global main\nmain:\n ldr r0,iAdrszString @ string address\n mov r1,#',' @ separator\n bl stTokenize\n cmp r0,#-1 @ error ?\n beq 99f\n mov r2,r0 @ table address\n ldr r0,iAdrszMessFinal @ display message\n bl affichageMess\n ldr r4,[r2] @ number of areas\n add r2,#4 @ first area\n mov r3,#0 @ loop counter\n1: @ display loop\n ldr r0,[r2,r3, lsl #2] @ address area\n bl affichageMess\n ldr r0,iAdrszCarriageReturn @ display carriage return\n bl affichageMess\n add r3,#1 @ counter + 1\n cmp r3,r4 @ end ?\n blt 1b @ no -> loop\n\n b 100f\n99: @ display error message\n ldr r0,iAdrszMessError\n bl affichageMess\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\niAdrszString: .int szString\niAdrszFinalString: .int szFinalString\niAdrszMessFinal: .int szMessFinal\niAdrszMessError: .int szMessError\niAdrszCarriageReturn: .int szCarriageReturn\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 systeme\n pop {r0,r1,r2,r7,lr} @ restaur des 2 registres\n bx lr @ return\n/*******************************************************************/\t\n/* Separate string by separator into an array */\n/* areas are store on the heap Linux */\n/*******************************************************************/\t\n/* r0 contains string address */\n/* r1 contains separator character (, or . or : ) */\n/* r0 returns table address with first item = number areas */\n/* and other items contains pointer of each string */\nstTokenize:\n push {r1-r8,lr} @ save des registres\n mov r6,r0\n mov r8,r1 @ save separator\n bl strLength @ length string for place reservation on the heap\n mov r4,r0\n ldr r5,iTailleTable\n add r5,r0\n and r5,#0xFFFFFFFC\n add r5,#4 @ align word on the heap\n @ place reservation on the heap\n mov r0,#0 @ heap address\n mov r7, #0x2D @ call system linux 'brk'\n svc #0 @ call system\n cmp r0,#-1 @ error call system\n beq 100f\n mov r3,r0 @ save address heap begin\n add r0,r5 @ reserve r5 byte on the heap\n mov r7, #0x2D @ call system linux 'brk'\n svc #0\n cmp r0,#-1\n beq 100f\n @ string copy on the heap\n mov r0,r6\n mov r1,r3\n1: @ loop copy string\n ldrb r2,[r0],#1 @ read one byte and increment pointer one byte\n strb r2,[r1],#1 @ store one byte and increment pointer one byte\n cmp r2,#0 @ end of string ?\n bne 1b @ no -> loop\n\n add r4,r3 @ r4 contains address table begin\n mov r0,#0\n str r0,[r4]\n str r3,[r4,#4]\n mov r2,#1 @ areas counter\n2: @ loop load string character\n ldrb r0,[r3]\n cmp r0,#0\n beq 3f @ end string\n cmp r0,r8 @ separator ?\n addne r3,#1 @ no -> next location\n bne 2b @ and loop\n mov r0,#0 @ store zero final of string\n strb r0,[r3]\n add r3,#1 @ next character\n add r2,#1 @ areas counter + 1\n str r3,[r4,r2, lsl #2] @ store address area in the table at index r2\n b 2b @ and loop\n\n3:\n str r2,[r4] @ returns number areas\n mov r0,r4\n100:\n pop {r1-r8,lr}\n bx lr\niTailleTable: .int 4 * NBPOSTESECLAT\n/***************************************************/\n/* calcul size string */\n/***************************************************/\n/* r0 string address */\n/* r0 returns size string */\nstrLength:\n push {r1,r2,lr}\n mov r1,#0 @ init counter\n1:\n ldrb r2,[r0,r1] @ load byte of string index r1\n cmp r2,#0 @ end string ?\n addne r1,#1 @ no -> +1 counter\n bne 1b @ and loop\n\n100:\n mov r0,r1\n pop {r1,r2,lr}\n bx lr\n","language":"ARM-Assembly"},{"code":"str: \"Hello,How,Are,You,Today\"\n\nprint join.with:\".\" split.by:\",\" str\n","language":"Arturo"},{"code":"let text = 'Hello,How,Are,You,Today'\nlet tokens = text.split(||,||)\nprint tokens.join(with: '.')\n","language":"Astro"},{"code":"string := \"Hello,How,Are,You,Today\"\nstringsplit, string, string, `,\nloop, % string0\n{\nmsgbox % string%A_Index%\n}\n","language":"AutoHotkey"},{"code":"BEGIN {\n s = \"Hello,How,Are,You,Today\"\n split(s, arr, \",\")\n for(i=1; i < length(arr); i++) {\n printf arr[i] \".\"\n }\n print\n}\n","language":"AWK"},{"code":"BEGIN { FS = \",\" }\n{\n for(i=1; i <= NF; i++) printf $i \".\";\n print \"\"\n}\n","language":"AWK"},{"code":"OPTION BASE 1\n\nstring$ = \"Hello,How,Are,You,Today\"\n\n' Tokenize a string into an array\nSPLIT string$ BY \",\" TO array$\n\n' Print array elements with new delimiter\nPRINT COIL$(i, UBOUND(array$), array$[i], \".\")\n\n' Or simply replace the delimiter\nPRINT DELIM$(string$, \",\", \".\")\n","language":"BaCon"},{"code":"instring$ = \"Hello,How,Are,You,Today\"\n\ntokens$ = explode(instring$,\",\")\nfor i = 0 to tokens$[?]-1\n\tprint tokens$[i]; \".\";\nnext i\nend\n","language":"BASIC256"},{"code":"@echo off\nsetlocal enabledelayedexpansion\ncall :tokenize %1 res\necho %res%\ngoto :eof\n\n:tokenize\nset str=%~1\n:loop\nfor %%i in (%str%) do set %2=!%2!.%%i\nset %2=!%2:~1!\ngoto :eof\n","language":"Batch-File"},{"code":" INSTALL @lib$+\"STRINGLIB\"\n\n text$ = \"Hello,How,Are,You,Today\"\n n% = FN_split(text$, \",\", array$())\n FOR i% = 0 TO n%-1\n PRINT array$(i%) \".\" ;\n NEXT\n PRINT\n","language":"BBC-BASIC"},{"code":"Split ← (+`׬)⊸-∘= ⊔ ⊢\n\n∾⟜'.'⊸∾´ ',' Split \"Hello,How,Are,You,Today\"\n","language":"BQN"},{"code":"( \"Hello,How,Are,You,Today\":?String\n& :?ReverseList\n& whl\n ' ( @(!String:?element \",\" ?String)\n & !element !ReverseList:?ReverseList\n )\n& !String:?List\n& whl\n ' ( !ReverseList:%?element ?ReverseList\n & (!element.!List):?List\n )\n& out$!List\n)\n","language":"Bracmat"},{"code":"( get$(\"Hello,How,Are,You,Today\",MEM):?CommaseparatedList\n& :?ReverseList\n& whl\n ' ( !CommaseparatedList:(?element,?CommaseparatedList)\n & !element !ReverseList:?ReverseList\n )\n& !CommaseparatedList:?List\n& whl\n ' ( !ReverseList:%?element ?ReverseList\n & (!element.!List):?List\n )\n& out$!List\n)\n","language":"Bracmat"},{"code":"#include<string.h>\n#include<stdio.h>\n#include<stdlib.h>\n\nint main(void)\n{\n\tchar *a[5];\n\tconst char *s=\"Hello,How,Are,You,Today\";\n\tint n=0, nn;\n\n\tchar *ds=strdup(s);\n\n\ta[n]=strtok(ds, \",\");\n\twhile(a[n] && n<4) a[++n]=strtok(NULL, \",\");\n\n\tfor(nn=0; nn<=n; ++nn) printf(\"%s.\", a[nn]);\n\tputchar('\\n');\n\n\tfree(ds);\n\n\treturn 0;\n}\n","language":"C"},{"code":"#include<stdio.h>\n\ntypedef void (*callbackfunc)(const char *);\n\nvoid doprint(const char *s) {\n\tprintf(\"%s.\", s);\n}\n\nvoid tokenize(char *s, char delim, callbackfunc cb) {\n\tchar *olds = s;\n\tchar olddelim = delim;\n\twhile(olddelim && *s) {\n\t\twhile(*s && (delim != *s)) s++;\n\t\t*s ^= olddelim = *s; // olddelim = *s; *s = 0;\n\t\tcb(olds);\n\t\t*s++ ^= olddelim; // *s = olddelim; s++;\n\t\tolds = s;\n\t}\n}\n\nint main(void)\n{\n char array[] = \"Hello,How,Are,You,Today\";\n\ttokenize(array, ',', doprint);\n\treturn 0;\n}\n","language":"C"},{"code":"#include <string>\n#include <sstream>\n#include <vector>\n#include <iterator>\n#include <iostream>\n#include <algorithm>\nint main()\n{\n std::string s = \"Hello,How,Are,You,Today\";\n std::vector<std::string> v;\n std::istringstream buf(s);\n for(std::string token; getline(buf, token, ','); )\n v.push_back(token);\n copy(v.begin(), v.end(), std::ostream_iterator<std::string>(std::cout, \".\"));\n std::cout << '\\n';\n}\n","language":"C++"},{"code":"#include <string>\n#include <locale>\n#include <sstream>\n#include <vector>\n#include <iterator>\n#include <iostream>\n#include <algorithm>\nstruct comma_ws : std::ctype<char> {\n static const mask* make_table() {\n static std::vector<mask> v(classic_table(), classic_table() + table_size);\n v[','] |= space; // comma will be classified as whitespace\n return &v[0];\n }\n comma_ws(std::size_t refs = 0) : ctype<char>(make_table(), false, refs) {}\n};\nint main()\n{\n std::string s = \"Hello,How,Are,You,Today\";\n std::istringstream buf(s);\n buf.imbue(std::locale(buf.getloc(), new comma_ws));\n std::istream_iterator<std::string> beg(buf), end;\n std::vector<std::string> v(beg, end);\n copy(v.begin(), v.end(), std::ostream_iterator<std::string>(std::cout, \".\"));\n std::cout << '\\n';\n}\n","language":"C++"},{"code":"#include <string>\n#include <vector>\n#include <iterator>\n#include <algorithm>\n#include <iostream>\n#include <boost/tokenizer.hpp>\nint main()\n{\n std::string s = \"Hello,How,Are,You,Today\";\n boost::tokenizer<> tok(s);\n std::vector<std::string> v(tok.begin(), tok.end());\n copy(v.begin(), v.end(), std::ostream_iterator<std::string>(std::cout, \".\"))\n std::cout << '\\n';\n}\n","language":"C++"},{"code":"#include <string>\n#include <ranges>\n#include <iostream>\nint main() {\n std::string s = \"Hello,How,Are,You,Today\";\n s = s // Assign the final string back to the string variable\n | std::views::split(',') // Produce a range of the comma separated words\n | std::views::join_with('.') // Concatenate the words into a single range of characters\n | std::ranges::to<std::string>(); // Convert the range of characters into a regular string\n std::cout << s;\n}\n","language":"C++"},{"code":"string str = \"Hello,How,Are,You,Today\";\n// or Regex.Split ( \"Hello,How,Are,You,Today\", \",\" );\n// (Regex is in System.Text.RegularExpressions namespace)\nstring[] strings = str.Split(',');\nConsole.WriteLine(String.Join(\".\", strings));\n","language":"C-sharp"},{"code":"shared void tokenizeAString() {\n\tvalue input = \"Hello,How,Are,You,Today\";\n\tvalue tokens = input.split(','.equals);\n\tprint(\".\".join(tokens));\n}\n","language":"Ceylon"},{"code":"bundle agent main\n{\n reports:\n \"${with}\" with => join(\".\", splitstring(\"Hello,How,Are,You,Today\", \",\", 99));\n}\n","language":"CFEngine"},{"code":"(apply str (interpose \".\" (.split #\",\" \"Hello,How,Are,You,Today\")))\n","language":"Clojure"},{"code":"(clojure.string/join \".\" (clojure.string/split \"Hello,How,Are,You,Today\" #\",\"))\n","language":"Clojure"},{"code":"% This iterator splits the string on a given character,\n% and returns each substring in order.\ntokenize = iter (s: string, c: char) yields (string)\n while ~string$empty(s) do\n next: int := string$indexc(c, s)\n if next = 0 then\n yield(s)\n break\n else\n yield(string$substr(s, 1, next-1))\n s := string$rest(s, next+1)\n end\n end\nend tokenize\n\nstart_up = proc ()\n po: stream := stream$primary_output()\n str: string := \"Hello,How,Are,You,Today\"\n\n for part: string in tokenize(str, ',') do\n stream$putl(po, part || \".\")\n end\nend start_up\n","language":"CLU"},{"code":" identification division.\n program-id. tokenize.\n\n environment division.\n configuration section.\n repository.\n function all intrinsic.\n\n data division.\n working-storage section.\n 01 period constant as \".\".\n 01 cmma constant as \",\".\n\n 01 start-with.\n 05 value \"Hello,How,Are,You,Today\".\n\n 01 items.\n 05 item pic x(6) occurs 5 times.\n\n procedure division.\n tokenize-main.\n unstring start-with delimited by cmma\n into item(1) item(2) item(3) item(4) item(5)\n\n display trim(item(1)) period trim(item(2)) period\n trim(item(3)) period trim(item(4)) period\n trim(item(5))\n\n goback.\n end program tokenize.\n","language":"COBOL"},{"code":"arr = \"Hello,How,Are,You,Today\".split \",\"\nconsole.log arr.join \".\"\n","language":"CoffeeScript"},{"code":"<cfoutput>\n <cfset wordListTag = \"Hello,How,Are,You,Today\">\n #Replace( wordListTag, \",\", \".\", \"all\" )#\n</cfoutput>\n","language":"ColdFusion"},{"code":"<cfscript>\n wordList = \"Hello,How,Are,You,Today\";\n splitList = replace( wordList, \",\", \".\", \"all\" );\n writeOutput( splitList );\n</cfscript>\n","language":"ColdFusion"},{"code":"10 REM TOKENIZE A STRING ... ROSETTACODE.ORG\n20 T$ = \"HELLO,HOW,ARE,YOU,TODAY\"\n30 GOSUB 200, TOKENIZE\n40 FOR I = 1 TO N\n50 PRINT A$(I) \".\" ;\n60 NEXT\n70 PRINT\n80 END\n200 IF N = 0 THEN DIM A$(256)\n210 N = 1\n220 A$(N) = \"\"\n230 FOR L = 1 TO LEN(T$)\n240 C$ = MID$(T$, L, 1)\n250 IF C$<>\",\" THEN A$(N) = A$(N) + C$: GOTO 270\n260 N = N + 1\n270 NEXT L\n280 RETURN\n","language":"Commodore-BASIC"},{"code":"(defun comma-split (string)\n (loop for start = 0 then (1+ finish)\n for finish = (position #\\, string :start start)\n collecting (subseq string start finish)\n until (null finish)))\n\n(defun write-with-periods (strings)\n (format t \"~{~A~^.~}\" strings))\n","language":"Common-Lisp"},{"code":"include \"cowgol.coh\";\ninclude \"strings.coh\";\n\n# Tokenize a string. Note: the string is modified in place.\nsub tokenize(sep: uint8, str: [uint8], out: [[uint8]]): (length: intptr) is\n length := 0;\n loop\n [out] := str;\n out := @next out;\n length := length + 1;\n while [str] != 0 and [str] != sep loop\n str := @next str;\n end loop;\n if [str] == sep then\n [str] := 0;\n str := @next str;\n else\n break;\n end if;\n end loop;\nend sub;\n\n# The string\nvar string: [uint8] := \"Hello,How,Are,You,Today\";\n\n# Make a mutable copy\nvar buf: uint8[64];\nCopyString(string, &buf[0]);\n\n# Tokenize the copy\nvar parts: [uint8][64];\nvar length := tokenize(',', &buf[0], &parts[0]) as @indexof parts;\n\n# Print each string\nvar i: @indexof parts := 0;\nwhile i < length loop\n print(parts[i]);\n print(\".\\n\");\n i := i + 1;\nend loop;\n","language":"Cowgol"},{"code":"puts \"Hello,How,Are,You,Today\".split(',').join('.')\n","language":"Crystal"},{"code":"void main() {\n import std.stdio, std.string;\n\n \"Hello,How,Are,You,Today\".split(',').join('.').writeln;\n}\n","language":"D"},{"code":"program Tokenize_a_string;\n\n{$APPTYPE CONSOLE}\n\nuses\n System.SysUtils;\n\nvar\n Words: TArray<string>;\n\nbegin\n Words := 'Hello,How,Are,You,Today'.Split([',']);\n Writeln(string.Join(#10, Words));\n\n Readln;\nend.\n","language":"Delphi"},{"code":"program TokenizeString;\n\n{$APPTYPE CONSOLE}\n\nuses\n Classes;\n\nvar\n tmp: TStringList;\n i: Integer;\n\nbegin\n\n // Instantiate TStringList class\n tmp := TStringList.Create;\n try\n { Use the TStringList's CommaText property to get/set\n all the strings in a single comma-delimited string }\n tmp.CommaText := 'Hello,How,Are,You,Today';\n\n { Now loop through the TStringList and display each\n token on the console }\n for i := 0 to Pred(tmp.Count) do\n Writeln(tmp[i]);\n\n finally\n tmp.Free;\n end;\n\n Readln;\n\nend.\n","language":"Delphi"},{"code":"Hello\nHow\nAre\nYou\nToday\n","language":"Delphi"},{"code":"\"Hello,How,Are,You,Today\" \",\" split \".\" join pl\n","language":"Dt"},{"code":"var str = \"Hello,How,Are,You,Today\"\nvar strings = str.Split(',')\nprint(values: strings, separator: \".\")\n","language":"Dyalect"},{"code":"\".\".rjoin(\"Hello,How,Are,You,Today\".split(\",\"))\n","language":"E"},{"code":"s$ = \"Hello,How,Are,You,Today\"\na$[] = strsplit s$ \",\"\nfor s$ in a$[]\n write s$ & \".\"\n.\n","language":"EasyLang"},{"code":"import system'routines;\nimport extensions;\n\npublic program()\n{\n auto string := \"Hello,How,Are,You,Today\";\n\n string.splitBy(\",\").forEach::(s)\n {\n console.print(s,\".\")\n }\n}\n","language":"Elena"},{"code":"tokens = String.split(\"Hello,How,Are,You,Today\", \",\")\nIO.puts Enum.join(tokens, \".\")\n","language":"Elixir"},{"code":"text value = \"Hello,How,Are,You,Today\"\nList tokens = value.split(\",\")\nwriteLine(tokens.join(\".\"))\n# single line version\nwriteLine(\"Hello,How,Are,You,Today\".split(\",\").join(\".\"))\n","language":"EMal"},{"code":"-module(tok).\n-export([start/0]).\n\nstart() ->\n Lst = string:tokens(\"Hello,How,Are,You,Today\",\",\"),\n io:fwrite(\"~s~n\", [string:join(Lst,\".\")]),\n ok.\n","language":"Erlang"},{"code":"function split(sequence s, integer c)\n sequence out\n integer first, delim\n out = {}\n first = 1\n while first<=length(s) do\n delim = find_from(c,s,first)\n if delim = 0 then\n delim = length(s)+1\n end if\n out = append(out,s[first..delim-1])\n first = delim + 1\n end while\n return out\nend function\n\nsequence s\ns = split(\"Hello,How,Are,You,Today\", ',')\n\nfor i = 1 to length(s) do\n puts(1, s[i] & ',')\nend for\n","language":"Euphoria"},{"code":"System.String.Join(\".\", \"Hello,How,Are,You,Today\".Split(','))\n","language":"F-Sharp"},{"code":"\"Hello,How,Are,You,Today\" \",\" split \".\" join print\n","language":"Factor"},{"code":"/* created by Aykayayciti Earl Lamont Montgomery\nApril 9th, 2018 */\n\na = []\na = strSplit(\"Hello,How,Are,You,Today\", \",\")\nindex = 0\nstart = 0\nb = \"\"\nfor index in [ start : len(a)-1 : 1 ]\n\tb = b + a[index] + \".\"\nend\n\n> b\n","language":"Falcon"},{"code":"class Main\n{\n public static Void main ()\n {\n str := \"Hello,How,Are,You,Today\"\n words := str.split(',')\n words.each |Str word|\n {\n echo (\"${word}. \")\n }\n }\n}\n","language":"Fantom"},{"code":"(fn string.split [self sep]\n (let [pattern (string.format \"([^%s]+)\" sep)\n fields {}]\n (self:gsub pattern (fn [c] (tset fields (+ 1 (length fields)) c)))\n fields))\n\n(let [str \"Hello,How,Are,You,Today\"]\n (print (table.concat (str:split \",\") \".\")))\n","language":"Fennel"},{"code":": split ( str len separator len -- tokens count )\n here >r 2swap\n begin\n 2dup 2, \\ save this token ( addr len )\n 2over search \\ find next separator\n while\n dup negate here 2 cells - +! \\ adjust last token length\n 2over nip /string \\ start next search past separator\n repeat\n 2drop 2drop\n r> here over - ( tokens length )\n dup negate allot \\ reclaim dictionary\n 2 cells / ; \\ turn byte length into token count\n\n: .tokens ( tokens count -- )\n 1 ?do dup 2@ type .\" .\" cell+ cell+ loop 2@ type ;\n\ns\" Hello,How,Are,You,Today\" s\" ,\" split .tokens \\ Hello.How.Are.You.Today\n","language":"Forth"},{"code":"PROGRAM Example\n\n CHARACTER(23) :: str = \"Hello,How,Are,You,Today\"\n CHARACTER(5) :: word(5)\n INTEGER :: pos1 = 1, pos2, n = 0, i\n\n DO\n pos2 = INDEX(str(pos1:), \",\")\n IF (pos2 == 0) THEN\n n = n + 1\n word(n) = str(pos1:)\n EXIT\n END IF\n n = n + 1\n word(n) = str(pos1:pos1+pos2-2)\n pos1 = pos2+pos1\n END DO\n\n DO i = 1, n\n WRITE(*,\"(2A)\", ADVANCE=\"NO\") TRIM(word(i)), \".\"\n END DO\n\nEND PROGRAM Example\n","language":"Fortran"},{"code":"sub tokenize( instring as string, tokens() as string, sep as string )\n redim tokens(0 to 0) as string\n dim as string*1 ch\n dim as uinteger t=0\n for i as uinteger = 1 to len(instring)\n ch = mid(instring,i,1)\n if ch = sep then\n t = t + 1\n redim preserve tokens(0 to t)\n else\n tokens(t) = tokens(t) + ch\n end if\n next i\n return\nend sub\n\ndim as string instring = \"Hello,How,Are,You,Today\"\nredim as string tokens(-1)\ntokenize( instring, tokens(), \",\" )\nfor i as uinteger = 0 to ubound(tokens)\n print tokens(i);\".\";\nnext i\n","language":"FreeBASIC"},{"code":"println[join[\".\", split[\",\", \"Hello,How,Are,You,Today\"]]]\n","language":"Frink"},{"code":"window 1, @\"Tokenize a string\"\n\nvoid local fn DoIt\n CFStringRef string = @\"Hello,How,Are,You,Today\"\n CFArrayRef tokens = fn StringComponentsSeparatedByString( string, @\",\" )\n print fn ArrayComponentsJoinedByString( tokens, @\".\" )\nend fn\n\nfn DoIt\n\nHandleEvents\n","language":"FutureBasic"},{"code":"Public Sub Main()\nDim sString As String[] = Split(\"Hello,How,Are,You,Today\")\n\nPrint sString.Join(\".\")\n\nEnd\n","language":"Gambas"},{"code":"SplitString(\"Hello,How,Are,You,Today\", \",\");\n# [ \"Hello\", \"How\", \"Are\", \"You\", \"Today\" ]\n\nJoinStringsWithSeparator(last, \".\");\n# \"Hello.How.Are.You.Today\"\n","language":"GAP"},{"code":"[indent=4]\n\ninit\n str:string = \"Hello,How,Are,You,Today\"\n words:array of string[] = str.split(\",\")\n joined:string = string.joinv(\".\", words)\n print joined\n","language":"Genie"},{"code":"package main\n\nimport (\n \"fmt\"\n \"strings\"\n)\n\nfunc main() {\n s := \"Hello,How,Are,You,Today\"\n fmt.Println(strings.Join(strings.Split(s, \",\"), \".\"))\n}\n","language":"Go"},{"code":"println 'Hello,How,Are,You,Today'.split(',').join('.')\n","language":"Groovy"},{"code":"{-# OPTIONS_GHC -XOverloadedStrings #-}\nimport Data.Text (splitOn,intercalate)\nimport qualified Data.Text.IO as T (putStrLn)\n\nmain = T.putStrLn . intercalate \".\" $ splitOn \",\" \"Hello,How,Are,You,Today\"\n","language":"Haskell"},{"code":"splitBy :: (a -> Bool) -> [a] -> [[a]]\nsplitBy _ [] = []\nsplitBy f list = first : splitBy f (dropWhile f rest) where\n (first, rest) = break f list\n\nsplitRegex :: Regex -> String -> [String]\n\njoinWith :: [a] -> [[a]] -> [a]\njoinWith d xs = concat $ List.intersperse d xs\n-- \"concat $ intersperse\" can be replaced with \"intercalate\" from the Data.List in GHC 6.8 and later\n\nputStrLn $ joinWith \".\" $ splitBy (== ',') $ \"Hello,How,Are,You,Today\"\n\n-- using regular expression to split:\nimport Text.Regex\nputStrLn $ joinWith \".\" $ splitRegex (mkRegex \",\") $ \"Hello,How,Are,You,Today\"\n","language":"Haskell"},{"code":"*Main> mapM_ putStrLn $ takeWhile (not.null) $ unfoldr (Just . second(drop 1). break (==',')) \"Hello,How,Are,You,Today\"\nHello\nHow\nAre\nYou\nToday\n","language":"Haskell"},{"code":"CHARACTER string=\"Hello,How,Are,You,Today\", list\n\nnWords = INDEX(string, ',', 256) + 1\nmaxWordLength = LEN(string) - 2*nWords\nALLOCATE(list, nWords*maxWordLength)\n\nDO i = 1, nWords\n EDIT(Text=string, SePaRators=',', item=i, WordEnd, CoPyto=CHAR(i, maxWordLength, list))\nENDDO\n\nDO i = 1, nWords\n WRITE(APPend) TRIM(CHAR(i, maxWordLength, list)), '.'\nENDDO\n","language":"HicEst"},{"code":"procedure main()\n A := []\n \"Hello,How,Are,You,Today\" ? {\n while put(A, 1(tab(upto(',')),=\",\"))\n put(A,tab(0))\n }\n every writes(!A,\".\")\n write()\nend\n","language":"Icon"},{"code":"import util\n\nprocedure main()\n A := stringToList(\"Hello,How,Are,You,Today\", ',')\n every writes(!A,\".\")\n write()\nend\n","language":"Icon"},{"code":"\"Hello,How,Are,You,Today\" split(\",\") join(\".\") println\n","language":"Io"},{"code":" s=: 'Hello,How,Are,You,Today'\n ] t=: <;._1 ',',s\n+-----+---+---+---+-----+\n|Hello|How|Are|You|Today|\n+-----+---+---+---+-----+\n ; t,&.>'.'\nHello.How.Are.You.Today.\n\n '.' (I.','=s)}s NB. two steps combined\nHello.How.Are.You.Today\n","language":"J"},{"code":" require 'strings'\n ',' splitstring s\n+-----+---+---+---+-----+\n|Hello|How|Are|You|Today|\n+-----+---+---+---+-----+\n\n '.' joinstring ',' splitstring s\nHello.How.Are.You.Today\n","language":"J"},{"code":" '\"'([ ,~ ,) '\",\"' joinstring ',' splitstring s\n\"Hello\",\"How\",\"Are\",\"You\",\"Today\"\n","language":"J"},{"code":" rplc&',.' s\nHello.How.Are.You.Today\n","language":"J"},{"code":" fn;._2 string,','\n","language":"J"},{"code":" fn ((;._2)(@(,&','))) string\n","language":"J"},{"code":"String toTokenize = \"Hello,How,Are,You,Today\";\nSystem.out.println(String.join(\".\", toTokenize.split(\",\")));\n","language":"Java"},{"code":"String toTokenize = \"Hello,How,Are,You,Today\";\n\nString words[] = toTokenize.split(\",\");//splits on one comma, multiple commas yield multiple splits\n //toTokenize.split(\",+\") if you want to ignore empty fields\nfor(int i=0; i<words.length; i++) {\n System.out.print(words[i] + \".\");\n}\n","language":"Java"},{"code":"String toTokenize = \"Hello,How,Are,You,Today\";\n\nStringTokenizer tokenizer = new StringTokenizer(toTokenize, \",\");\nwhile(tokenizer.hasMoreTokens()) {\n System.out.print(tokenizer.nextToken() + \".\");\n}\n","language":"Java"},{"code":"console.log(\n \"Hello,How,Are,You,Today\"\n .split(\",\")\n .join(\".\")\n);\n","language":"JavaScript"},{"code":"const Tokeniser = (function () {\n\tconst numberRegex = /-?(\\d+\\.d+|\\d+\\.|\\.\\d+|\\d+)((e|E)(\\+|-)?\\d+)?/g;\n\treturn {\n\t\tsettings: {\n\t\t\toperators: [\"<\", \">\", \"=\", \"+\", \"-\", \"*\", \"/\", \"?\", \"!\"],\n\t\t\tseparators: [\",\", \".\", \";\", \":\", \" \", \"\\t\", \"\\n\"],\n\t\t\tgroupers: [\"(\", \")\", \"[\", \"]\", \"{\", \"}\", '\"', '\"', \"'\", \"'\"],\n\t\t\tkeepWhiteSpacesAsTokens: false,\n\t\t\ttrimTokens: true\n\t\t},\n\t\tisNumber: function (value) {\n\t\t\tif (typeof value === \"number\") {\n\t\t\t\treturn true;\n\t\t\t} else if (typeof value === \"string\") {\n\t\t\t\treturn numberRegex.test(value);\n\t\t\t}\n\t\t\treturn false;\n\t\t},\n\t\tcloseGrouper: function (grouper) {\n\t\t\tif (this.settings.groupers.includes(grouper)) {\n\t\t\t\treturn this.settings.groupers[this.settings.groupers.indexOf(grouper) + 1];\n\t\t\t}\n\t\t\treturn null;\n\t\t},\n\t\ttokenType: function (char) {\n\t\t\tif (this.settings.operators.includes(char)) {\n\t\t\t\treturn \"operator\";\n\t\t\t} else if (this.settings.separators.includes(char)) {\n\t\t\t\treturn \"separator\";\n\t\t\t} else if (this.settings.groupers.includes(char)) {\n\t\t\t\treturn \"grouper\";\n\t\t\t}\n\t\t\treturn \"other\";\n\t\t},\n\t\tparseString: function (str) {\n\t\t\tif (typeof str !== \"string\") {\n\t\t\t\tif (str === null) {\n\t\t\t\t\treturn \"null\";\n\t\t\t\t} if (typeof str === \"object\") {\n\t\t\t\t\tstr = JSON.stringify(str);\n\t\t\t\t} else {\n\t\t\t\t\tstr = str.toString();\n\t\t\t\t}\n\t\t\t}\n\t\t\tlet tokens = [], _tempToken = \"\";\n\t\t\tfor (let i = 0; i < str.length; i++) {\n\t\t\t\tif (this.tokenType(_tempToken) !== this.tokenType(str[i]) || this.tokenType(str[i]) === \"separator\") {\n\t\t\t\t\tif (_tempToken.trim() !== \"\") {\n\t\t\t\t\t\ttokens.push(this.settings.trimTokens ? _tempToken.trim() : _tempToken);\n\t\t\t\t\t} else if (this.settings.keepWhiteSpacesAsTokens) {\n\t\t\t\t\t\ttokens.push(_tempToken);\n\t\t\t\t\t}\n\t\t\t\t\t_tempToken = str[i];\n\t\t\t\t\tif (this.tokenType(_tempToken) === \"separator\") {\n\t\t\t\t\t\tif (_tempToken.trim() !== \"\") {\n\t\t\t\t\t\t\ttokens.push(this.settings.trimTokens ? _tempToken.trim() : _tempToken);\n\t\t\t\t\t\t} else if (this.settings.keepWhiteSpacesAsTokens) {\n\t\t\t\t\t\t\ttokens.push(_tempToken);\n\t\t\t\t\t\t}\n\t\t\t\t\t\t_tempToken = \"\";\n\t\t\t\t\t}\n\t\t\t\t} else {\n\t\t\t\t\t_tempToken += str[i];\n\t\t\t\t}\n\t\t\t}\n\t\t\tif (_tempToken.trim() !== \"\") {\n\t\t\t\ttokens.push(this.settings.trimTokens ? _tempToken.trim() : _tempToken);\n\t\t\t} else if (this.settings.keepWhiteSpacesAsTokens) {\n\t\t\t\ttokens.push(_tempToken);\n\t\t\t}\n\t\t\treturn tokens.filter((token) => token !== \"\");\n\t\t}\n\t};\n})();\n","language":"JavaScript"},{"code":"Tokeniser.parseString(\"Hello,How,Are,You,Today\");\n\n// -> ['Hello', ',', 'How', ',', 'Are', ',', 'You', ',', 'Today']\n","language":"JavaScript"},{"code":"split(\",\") | join(\".\")\n","language":"Jq"},{"code":"$ jq -r 'split(\",\") | join(\".\")'\n\"Hello,How,Are,You,Today\"\nHello.How.Are.You.Today\n","language":"Jq"},{"code":"puts('Hello,How,Are,You,Today'.split(',').join('.'))\n","language":"Jsish"},{"code":"s = \"Hello,How,Are,You,Today\"\na = split(s, \",\")\nt = join(a, \".\")\n\nprintln(\"The string \\\"\", s, \"\\\"\")\nprintln(\"Splits into \", a)\nprintln(\"Reconstitutes to \\\"\", t, \"\\\"\")\n","language":"Julia"},{"code":"words: \",\" \\: \"Hello,How,Are,You,Today\"\n\".\" /: words\n","language":"K"},{"code":"\",\"\\\"Hello,How,Are,You,Today\"\n(\"Hello\"\n \"How\"\n \"Are\"\n \"You\"\n \"Today\")\n","language":"K"},{"code":"( \"Hello,How,Are,You,Today\" \",\" ) split len [ get print \".\" print ] for\n\nnl \"End \" input\n","language":"Klingphix"},{"code":"fun main(args: Array<String>) {\n val input = \"Hello,How,Are,You,Today\"\n println(input.split(',').joinToString(\".\"))\n}\n","language":"Kotlin"},{"code":"#!/bin/ksh\n\n# Tokenize a string\n\n#\t# Variables:\n#\nstring=\"Hello,How,Are,You,Today\"\ninputdelim=\\,\t\t# a comma\noutputdelim=\\.\t\t# a period\n\n#\t# Functions:\n#\n#\t# Function _tokenize(str, indelim, outdelim)\n#\nfunction _tokenize {\n\ttypeset _str ; _str=\"$1\"\n\ttypeset _ind ; _ind=\"$2\"\n\ttypeset _outd ; _outd=\"$3\"\n\t\n\twhile [[ ${_str} != ${_str/${_ind}/${_outd}} ]]; do\n\t\t_str=${_str/${_ind}/${_outd}}\n\tdone\n\n\techo \"${_str}\"\n}\n\n ######\n# main #\n ######\n\n _tokenize \"${string}\" \"${inputdelim}\" \"${outputdelim}\"\n","language":"Ksh"},{"code":"{S.replace , by . in Hello,How,Are,You,Today}.\n-> Hello.How.Are.You.Today.\n","language":"Lambdatalk"},{"code":"$str = Hello,How,Are,You,Today\nfn.println(fn.join(\\., fn.split($str, \\,)))\n","language":"Lang"},{"code":"'Hello,How,Are,You,Today ', split '. join .\n","language":"Lang5"},{"code":"DATA:\nexplode/words is text vector\nexplode/index is number\nexplode/string is text\nexplode/length is number\nexplode/stringlength is number\nexplode/current-token is text\nexplode/char is text\nexplode/separator is text\ni is number\n\nPROCEDURE:\n# Ask for a sentence\ndisplay \"Enter a sentence: \"\naccept explode/string\n\n# Declare explode Subprocedure\n# Splits a text into a text vector by a certain delimiter\n# Input parameters:\n# - explode/string: the string to explode (destroyed)\n# - explode/separator: the character used to separate the string (preserved)\n# Output parameters:\n# - explode/words: vector of splitted words\n# - explode/length: length of explode/words\nsub-procedure explode\n join explode/string and explode/separator in explode/string\n store length of explode/string in explode/stringlength\n store 0 in explode/index\n store 0 in explode/length\n store \"\" in explode/current-token\n while explode/index is less than explode/stringlength do\n get character at explode/index from explode/string in explode/char\n if explode/char is equal to explode/separator then\n store explode/current-token in explode/words:explode/length\n add explode/length and 1 in explode/length\n store \"\" in explode/current-token\n else\n join explode/current-token and explode/char in explode/current-token\n end if\n add explode/index and 1 in explode/index\n repeat\n subtract 1 from explode/length in explode/length\nend sub-procedure\n\n# Separate the entered string\nstore \" \" in explode/separator\ncall sub-procedure explode\nwhile i is less than or equal to explode/length do\n display explode/words:i crlf\n add 1 and i in i\nrepeat\n","language":"LDPL"},{"code":"> (set split (string:tokens \"Hello,How,Are,You,Today\" \",\"))\n(\"Hello\" \"How\" \"Are\" \"You\" \"Today\")\n> (string:join split \".\")\n\"Hello.How.Are.You.Today\"\n","language":"LFE"},{"code":"'Note that Liberty Basic's array usage can reach element #10 before having to DIM the array\nFor i = 0 To 4\n array$(i) = Word$(\"Hello,How,Are,You,Today\", (i + 1), \",\")\n array$ = array$ + array$(i) + \".\"\nNext i\n\nPrint Left$(array$, (Len(array$) - 1))\n","language":"Liberty-BASIC"},{"code":"input = \"Hello,How,Are,You,Today\"\n_player.itemDelimiter = \",\"\noutput = \"\"\nrepeat with i = 1 to input.item.count\n put input.item[i]&\".\" after output\nend repeat\ndelete the last char of output\nput output\n-- \"Hello.How.Are.You.Today\"\n","language":"Lingo"},{"code":"to split :str :sep\n output parse map [ifelse ? = :sep [\"| |] [?]] :str\nend\n","language":"Logo"},{"code":"to split :str :by [:acc []] [:w \"||]\n if empty? :str [output lput :w :acc]\n ifelse equal? first :str :by ~\n [output (split butfirst :str :by lput :w :acc)] ~\n [output (split butfirst :str :by :acc lput first :str :w)]\nend\n","language":"Logo"},{"code":"? show split \"Hello,How,Are,You,Today \",\n[Hello How Are You Today]\n","language":"Logo"},{"code":":- object(spliting).\n\n :- public(convert/2).\n :- mode(convert(+atom, -atom), one).\n\n convert(StringIn, StringOut) :-\n atom_chars(StringIn, CharactersIn),\n phrase(split(',', Tokens), CharactersIn),\n phrase(split('.', Tokens), CharactersOut),\n atom_chars(StringOut, CharactersOut).\n\n split(Separator, [t([Character| Characters])| Tokens]) -->\n [Character], {Character \\== Separator}, split(Separator, [t(Characters)| Tokens]).\n split(Separator, [t([])| Tokens]) -->\n [Separator], split(Separator, Tokens).\n split(_, [t([])]) -->\n [].\n % the look-ahead in the next rule prevents adding a spurious separator at the end\n split(_, []), [Character] -->\n [Character].\n\n:- end_object.\n","language":"Logtalk"},{"code":"function string:split (sep)\n local sep, fields = sep or \":\", {}\n local pattern = string.format(\"([^%s]+)\", sep)\n self:gsub(pattern, function(c) fields[#fields+1] = c end)\n return fields\nend\n\nlocal str = \"Hello,How,Are,You,Today\"\nprint(table.concat(str:split(\",\"), \".\"))\n","language":"Lua"},{"code":"Module CheckIt {\n\tFunction Tokenize$(s){\n\t\t\\\\ letter$ pop a string from stack of values\n\t\t\\\\ shift 2 swap top two values on stack of values\n\t\tfold1=lambda m=1 ->{\n\t\t\tshift 2 :if m=1 then m=0:drop: push letter$ else push letter$+\".\"+letter$\n\t\t}\n\t\t=s#fold$(fold1)\n\t}\n\tPrint Tokenize$(piece$(\"Hello,How,Are,You,Today\",\",\")) =\"Hello.How.Are.You.Today\" ' true\n}\nCheckit\n","language":"M2000-Interpreter"},{"code":"define(`s',`Hello,How,Are,You,Today')\ndefine(`set',`define(`$1[$2]',`$3')')\ndefine(`get',`defn($1[$2])')\ndefine(`n',0)\ndefine(`fill',\n `set(a,n,$1)`'define(`n',incr(n))`'ifelse(eval($#>1),1,`fill(shift($@))')')\nfill(s)\ndefine(`j',0)\ndefine(`show',\n `ifelse(eval(j<n),1,`get(a,j).`'define(`j',incr(j))`'show')')\nshow\n","language":"M4"},{"code":"StringTools:-Join(StringTools:-Split(\"Hello,How,Are,You,Today\", \",\"),\".\");\n","language":"Maple"},{"code":"StringJoin@StringSplit[\"Hello,How,Are,You,Today\", \",\" -> \".\"]\n","language":"Mathematica"},{"code":"s=strsplit('Hello,How,Are,You,Today',',')\nfprintf(1,'%s.',s{:})\n","language":"MATLAB"},{"code":"l: split(\"Hello,How,Are,You,Today\", \",\")$\nprintf(true, \"~{~a~^.~}~%\", l)$\n","language":"Maxima"},{"code":"split(\"Hello,How,Are,You,Today\",\",\")$\nsimplode(%,\".\");\n","language":"Maxima"},{"code":"output = \"\"\nfor word in (filterString \"Hello,How,Are,You,Today\" \",\") do\n(\n output += (word + \".\")\n)\nformat \"%\\n\" output\n","language":"MAXScript"},{"code":":- module string_tokenize.\n:- interface.\n\n:- import_module io.\n:- pred main(io::di, io::uo) is det.\n\n:- implementation.\n:- import_module list, string.\n\nmain(!IO) :-\n Tokens = string.split_at_char((','), \"Hello,How,Are,You,Today\"),\n io.write_list(Tokens, \".\", io.write_string, !IO),\n io.nl(!IO).\n","language":"Mercury"},{"code":"\"Hello,How,Are,You,Today\" \",\" split \".\" join print\n","language":"Min"},{"code":"tokens = \"Hello,How,Are,You,Today\".split(\",\")\nprint tokens.join(\".\")\n","language":"MiniScript"},{"code":"sep\tIS\t','\nEOS\tIS\t0\nNL\tIS\t10\n\n// main registers\np\tIS\t$255\ntp\tGREG\nc\tGREG\nt\tGREG\n\n\tLOC\tData_Segment\n\tGREG\t@\nText\tBYTE\t\"Hello,How,Are,You,Today\",EOS\ntoken\tBYTE\t0\neot\tIS\t@+255\n\n\tLOC\t#100\t% main () {\nMain\tLDA\tp,Text\t\t%\n\tLDA\ttp,token\t% initialize pointers\n2H\tLDBU\tc,p\t\t% DO get char\n\tBZ\tc,5F\t\t% break if char == EOS\n\tCMP\tt,c,sep\t\t% if char != sep then\n\tPBNZ\tt,3F\t\t% store char\n\tSET\tt,NL\t\t% terminate token with NL,EOS\n\tSTBU\tt,tp\n\tSET\tt,EOS\n\tINCL\ttp,1\n\tSTBU\tt,tp\n\tJMP\t4F\t\t% continue\n\n3H\tSTBU\tc,tp\t\t% store char\n4H\tINCL\ttp,1\t\t% update pointers\n\tINCL\tp,1\n\tJMP\t2B\t\t% LOOP\n\n5H\tSET\tt,NL\t\t% terminate last token and buffer\n\tSTBU\tt,tp\n\tSET\tt,EOS\n\tINCL\ttp,1\n\tSTBU\tt,tp\n% next part is not really necessary\n% program runs only once\n%\tINCL\ttp,1\t\t% terminate buffer\n%\tSTBU\tt,tp\n\n\tLDA\ttp,token\t% reset token pointer\n\t\t\t\t% REPEAT\n2H\tADD\tp,tp,0\t\t% start of token\n\tTRAP\t0,Fputs,StdOut\t% output token\n\tADD\ttp,tp,p\n\tINCL\ttp,1\t\t% step to next token\n\tLDBU\tt,tp\n\tPBNZ\tt,2B\t\t% UNTIL EOB(uffer)\n\tTRAP\t0,Halt,0\n","language":"MMIX"},{"code":"MODULE Tokenize EXPORTS Main;\n\nIMPORT IO, TextConv;\n\nTYPE Texts = REF ARRAY OF TEXT;\n\nVAR tokens: Texts;\n string := \"Hello,How,Are,You,Today\";\n sep := SET OF CHAR {','};\n\nBEGIN\n tokens := NEW(Texts, TextConv.ExplodedSize(string, sep));\n TextConv.Explode(string, tokens^, sep);\n FOR i := FIRST(tokens^) TO LAST(tokens^) DO\n IO.Put(tokens[i] & \".\");\n END;\n IO.Put(\"\\n\");\nEND Tokenize.\n","language":"Modula-3"},{"code":"TOKENS\n NEW I,J,INP\n SET INP=\"Hello,how,are,you,today\"\n NEW I FOR I=1:1:$LENGTH(INP,\",\") SET INP(I)=$PIECE(INP,\",\",I)\n NEW J FOR J=1:1:I WRITE INP(J) WRITE:J'=I \".\"\n KILL I,J,INP // Kill is optional. \"New\" variables automatically are killed on \"Quit\"\n QUIT\n","language":"MUMPS"},{"code":"for word in \"Hello,How,Are,You,Today\".split(\",\")\n print word + \".\"\nend\n","language":"Nanoquery"},{"code":"using System;\nusing System.Console;\nusing Nemerle.Utility.NString;\n\nmodule Tokenize\n{\n Main() : void\n {\n def cswords = \"Hello,How,Are,You,Today\";\n WriteLine(Concat(\".\", $[s | s in cswords.Split(',')]));\n // Split() produces an array while Concat() consumes a list\n // a quick in place list comprehension takes care of that\n }\n}\n","language":"Nemerle"},{"code":"/*NetRexx program *****************************************************\n* 20.08.2012 Walter Pachl derived from REXX Version 3\n**********************************************************************/\n sss='Hello,How,Are,You,Today'\n Say 'input string='sss\n Say ''\n Say 'Words in the string:'\n ss =sss.translate(' ',',')\n Loop i=1 To ss.words()\n Say ss.word(i)'.'\n End\n Say 'End-of-list.'\n","language":"NetRexx"},{"code":"(print (join (parse \"Hello,How,Are,You,Today\" \",\") \".\"))\n","language":"NewLISP"},{"code":" s := 'Hello,How,Are,You,Today'\n+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+\n|H|e|l|l|o|,|H|o|w|,|A|r|e|,|Y|o|u|,|T|o|d|a|y|\n+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+\n","language":"Nial"},{"code":" t := s eachall = `, cut s\n+-----------+-------+-------+-------+-----------+\n|+-+-+-+-+-+|+-+-+-+|+-+-+-+|+-+-+-+|+-+-+-+-+-+|\n||H|e|l|l|o|||H|o|w|||A|r|e|||Y|o|u|||T|o|d|a|y||\n|+-+-+-+-+-+|+-+-+-+|+-+-+-+|+-+-+-+|+-+-+-+-+-+|\n+-----------+-------+-------+-------+-----------+\n","language":"Nial"},{"code":" u := front content (cart t `.)\n+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+\n|H|e|l|l|o|.|H|o|w|.|A|r|e|.|Y|o|u|.|T|o|d|a|y|\n+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+\n","language":"Nial"},{"code":" s:='Hello,How,Are,You,Today'\nHello,How,Are,You,Today\n t:= s eachall = `, cut s\n+-----+---+---+---+-----+\n|Hello|How|Are|You|Today|\n+-----+---+---+---+-----+\n u:=front content (cart t `.)\n\nHello.How.Are.You.Today\n","language":"Nial"},{"code":"front content (cart (s eachall = `, cut s) `.)\n","language":"Nial"},{"code":"import strutils\n\nlet text = \"Hello,How,Are,You,Today\"\nlet tokens = text.split(',')\necho tokens.join(\".\")\n","language":"Nim"},{"code":"class Parse {\n function : Main(args : String[]) ~ Nil {\n tokens := \"Hello,How,Are,You,Today\"->Split(\",\");\n each(i : tokens) {\n tokens[i]->PrintLine();\n };\n }\n}\n","language":"Objeck"},{"code":"NSString *text = @\"Hello,How,Are,You,Today\";\nNSArray *tokens = [text componentsSeparatedByString:@\",\"];\nNSString *result = [tokens componentsJoinedByString:@\".\"];\nNSLog(result);\n","language":"Objective-C"},{"code":"let words = String.split_on_char ',' \"Hello,How,Are,You,Today\" in\nString.concat \".\" words\n","language":"OCaml"},{"code":"let split_on_char sep s =\n let r = ref [] in\n let j = ref (String.length s) in\n for i = String.length s - 1 downto 0 do\n if s.[i] = sep then begin\n r := String.sub s (i + 1) (!j - i - 1) :: !r;\n j := i\n end\n done;\n String.sub s 0 !j :: !r\n","language":"OCaml"},{"code":"\"Hello,How,Are,You,Today\" wordsWith(',') println\n","language":"Oforth"},{"code":"text='Hello,How,Are,You,Today'\ndo while text \\= ''\n parse var text word1 ',' text\n call charout 'STDOUT:',word1'.'\nend\n","language":"OoRexx"},{"code":"FUNCTION tokenizeString RETURNS CHAR (\n i_c AS CHAR\n):\n\n DEF VAR ii AS INT.\n DEF VAR carray AS CHAR EXTENT.\n DEF VAR cresult AS CHAR.\n\n EXTENT( carray ) = NUM-ENTRIES( i_c ).\n\n DO ii = 1 TO NUM-ENTRIES( i_c ):\n carray[ ii ] = ENTRY( ii, i_c ).\n END.\n\n DO ii = 1 TO EXTENT( carray ).\n cresult = cresult + \".\" + carray[ ii ].\n END.\n RETURN SUBSTRING( cresult, 2 ).\n\nEND FUNCTION. /* tokenizeString */\n\nMESSAGE\n tokenizeString( \"Hello,How,Are,You,Today\" )\nVIEW-AS ALERT-BOX.\n","language":"OpenEdge-Progress"},{"code":"for T in {String.tokens \"Hello,How,Are,You,Today\" &,} do\n {System.printInfo T#\".\"}\nend\n","language":"Oz"},{"code":"\\\\ Tokenize a string str according to 1 character delimiter d. Return a list of tokens.\n\\\\ Using ssubstr() from http://rosettacode.org/wiki/Substring#PARI.2FGP\n\\\\ tokenize() 3/5/16 aev\ntokenize(str,d)={\nmy(str=Str(str,d),vt=Vecsmall(str),d1=sasc(d),Lr=List(),sn=#str,v1,p1=1);\nfor(i=p1,sn, v1=vt[i]; if(v1==d1, listput(Lr,ssubstr(str,p1,i-p1)); p1=i+1));\nreturn(Lr);\n}\n\n{\n\\\\ TEST\nprint(\" *** Testing tokenize from Version #1:\");\nprint(\"1.\", tokenize(\"Hello,How,Are,You,Today\",\",\"));\n\\\\ BOTH 2 & 3 are NOT OK!!\nprint(\"2.\",tokenize(\"Hello,How,Are,You,Today,\",\",\"));\nprint(\"3.\",tokenize(\",Hello,,How,Are,You,Today\",\",\"));\n}\n","language":"PARI-GP"},{"code":"\\\\ Tokenize a string str according to 1 character delimiter d. Return a list of tokens.\n\\\\ Using ssubstr() from http://rosettacode.org/wiki/Substring#PARI.2FGP\n\\\\ stok() 3/5/16 aev\nstok(str,d)={\nmy(d1c=ssubstr(d,1,1),str=Str(str,d1c),vt=Vecsmall(str),d1=sasc(d1c),\n Lr=List(),sn=#str,v1,p1=1,vo=32);\nif(sn==1, return(List(\"\"))); if(vt[sn-1]==d1,sn--);\nfor(i=1,sn, v1=vt[i];\n if(v1!=d1, vo=v1; next);\n if(vo==d1||i==1, listput(Lr,\"\"); p1=i+1; vo=v1; next);\n if(i-p1>0, listput(Lr,ssubstr(str,p1,i-p1)); p1=i+1);\n vo=v1;\n );\nreturn(Lr);\n}\n\n{\n\\\\ TEST\nprint(\" *** Testing stok from Version #2:\");\n\\\\ pp - positional parameter(s)\nprint(\"1. 5 pp: \", stok(\"Hello,How,Are,You,Today\",\",\"));\nprint(\"2. 5 pp: \", stok(\"Hello,How,Are,You,Today,\",\",\"));\nprint(\"3. 9 pp: \", stok(\",,Hello,,,How,Are,You,Today\",\",\"));\nprint(\"4. 6 pp: \", stok(\",,,,,,\",\",\"));\nprint(\"5. 1 pp: \", stok(\",\",\",\"));\nprint(\"6. 1 pp: \", stok(\"Hello-o-o??\",\",\"));\nprint(\"7. 0 pp: \", stok(\"\",\",\"));\n}\n","language":"PARI-GP"},{"code":"program TokenizeString;\n\n{$mode objfpc}{$H+}\n\nuses\n SysUtils, Classes;\nconst\n TestString = 'Hello,How,Are,You,Today';\nvar\n Tokens: TStringList;\n I: Integer;\nbegin\n // Uses FCL facilities, \"harder\" algorithm not implemented\n Tokens := TStringList.Create;\n try\n Tokens.Delimiter := ',';\n Tokens.DelimitedText := TestString;\n Tokens.Delimiter := '.'; // For example\n // To standard Output\n WriteLn(Format('Tokenize from: \"%s\"', [TestString]));\n WriteLn(Format('to: \"%s\"',[Tokens.DelimitedText]));\n finally\n Tokens.Free;\n end;\nend.\n","language":"Pascal"},{"code":"print join('.', split /,/, 'Hello,How,Are,You,Today'), \"\\n\";\n","language":"Perl"},{"code":"echo \"Hello,How,Are,You,Today\" | perl -aplF/,/ -e '$\" = \".\"; $_ = \"@F\";'\n","language":"Perl"},{"code":"BEGIN { $/ = \"\\n\"; $\\ = \"\\n\"; }\nLINE: while (defined($_ = <ARGV>)) {\n chomp $_;\n our(@F) = split(/,/, $_, 0);\n $\" = '.';\n $_ = \"@F\";\n}\ncontinue {\n die \"-p destination: $!\\n\" unless print $_;\n}\n","language":"Perl"},{"code":"(phixonline)-->\n <span style=\"color: #0000FF;\">?</span><span style=\"color: #7060A8;\">join</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #7060A8;\">split</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #008000;\">\"Hello,How,Are,You,Today\"</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<!--\n","language":"Phix"},{"code":"/# \"Hello,How,Are,You,Today\" \",\" \".\" subst print #/\n\"Hello,How,Are,You,Today\" \",\" \" \" subst split len for get print \".\" print endfor\n","language":"Phixmonti"},{"code":"<?php\n$str = 'Hello,How,Are,You,Today';\necho implode('.', explode(',', $str));\n?>\n","language":"PHP"},{"code":"import util.\n\ngo =>\n S = \"Hello,How,Are,You,Today\",\n T = S.split(\",\"),\n println(T),\n T.join(\".\").println(),\n\n % As a one liner:\n S.split(\",\").join(\".\").println().\n","language":"Picat"},{"code":"(mapcar pack\n (split (chop \"Hello,How,Are,You,Today\") \",\") )\n","language":"PicoLisp"},{"code":"(\"Hello,How,Are,You,Today\" / \",\") * \".\";\n","language":"Pike"},{"code":"tok: Proc Options(main);\ndeclare s character (100) initial ('Hello,How,Are,You,Today');\ndeclare n fixed binary (31);\n\nn = tally(s, ',')+1;\n\nbegin;\n declare table(n) character (50) varying;\n declare c character (1);\n declare (i, k) fixed binary (31);\n\n table = ''; k = 1;\n do i = 1 to length(s);\n c = substr(s, i, 1);\n if c = ',' then k = k + 1;\n else table(k) = table(k) || c;\n end;\n\n /* display the table */\n table = table || '.';\n put skip list (string(table));\nend;\nend;\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/* SPLIT A STRING ON CHARACTER 'SEP'.\n THE 'PARTS' ARRAY WILL CONTAIN POINTERS TO THE START OF EACH ELEMENT.\n THE AMOUNT OF PARTS IS RETURNED.\n*/\nTOKENIZE: PROCEDURE (SEP, STR, PARTS) ADDRESS;\n DECLARE SEP BYTE, (STR, PARTS) ADDRESS;\n DECLARE (N, P BASED PARTS) ADDRESS;\n DECLARE CH BASED STR BYTE;\n N = 0;\nLOOP:\n P(N) = STR;\n N = N + 1;\n DO WHILE CH <> '$' AND CH <> SEP;\n STR = STR + 1;\n END;\n IF CH = '$' THEN RETURN N;\n CH = '$';\n STR = STR + 1;\n GO TO LOOP;\nEND TOKENIZE;\n\n/* TEST ON THE GIVEN INPUT */\nDECLARE HELLO (24) BYTE INITIAL ('HELLO,HOW,ARE,YOU,TODAY$');\nDECLARE PARTS (10) ADDRESS;\nDECLARE (I, LEN) ADDRESS;\n\nLEN = TOKENIZE(',', .HELLO, .PARTS);\nDO I = 0 TO LEN-1;\n CALL PRINT(PARTS(I));\n CALL PRINT(.'. $');\nEND;\n\nCALL EXIT;\nEOF;\n","language":"PL-M"},{"code":"To run:\nStart up.\nSplit \"Hello,How,Are,You,Today\" into some string things given the comma byte.\nJoin the string things with the period byte giving a string.\nDestroy the string things.\nWrite the string on the console.\nWait for the escape key.\nShut down.\n\nTo join some string things with a byte giving a string:\nGet a string thing from the string things.\nLoop.\nIf the string thing is nil, exit.\nAppend the string thing's string to the string.\nIf the string thing's next is not nil, append the byte to the string.\nPut the string thing's next into the string thing.\nRepeat.\n","language":"Plain-English"},{"code":";;; Make a list of strings from a string using space as separator\nlvars list;\nsysparse_string('the cat sat on the mat') -> list;\n;;; print the list of strings\nlist =>\n** [the cat sat on the mat]\n","language":"Pop11"},{"code":"lvars list;\nsysparse_string('one 1 two 2 three 3 four 4', true) -> list;\n;;; print the list of strings and numbers\nlist =>\n** [one 1 two 2 three 3 four 4]\n;;; check that first item is a string and second an integer\nisstring(list(1))=>\n** <true>\nisinteger(list(2))=>\n** <true>\n","language":"Pop11"},{"code":";;; Make pop-11 print strings with quotes\ntrue -> pop_pr_quotes;\n;;;\n;;; Create a string of tokens using comma as token separator\nlvars str='Hello,How,Are,You,Today';\n;;;\n;;; Make a list of strings by applying sys_parse_string\n;;; to str, using the character `,` as separator (the default\n;;; separator, if none is provided, is the space character).\nlvars strings;\n[% sys_parse_string(str, `,`) %] -> strings;\n;;;\n;;; print the list of strings\nstrings =>\n** ['Hello' 'How' 'Are' 'You' 'Today']\n","language":"Pop11"},{"code":"{% sys_parse_string(str, `,`) %} -> strings;\n;;; print the vector\nstrings =>\n** {'Hello' 'How' 'Are' 'You' 'Today'}\n","language":"Pop11"},{"code":"lvars numbers;\n{% sys_parse_string('100 101 102 103 99.9 99.999', strnumber) %} -> numbers;\n;;; the result is a vector containing integers and floats,\n;;; which can be printed thus:\nnumbers =>\n** {100 101 102 103 99.9 99.999}\n","language":"Pop11"},{"code":";;; Declare and initialize variables\nlvars str='Hello,How,Are,You,Today';\n;;; Iterate over string\nlvars ls = [], i, j = 1;\nfor i from 1 to length(str) do\n ;;; If comma\n if str(i) = `,` then\n ;;; Prepend word (substring) to list\n cons(substring(j, i - j, str), ls) -> ls;\n i + 1 -> j;\n endif;\nendfor;\n;;; Prepend final word (if needed)\nif j <= length(str) then\n cons(substring(j, length(str) - j + 1, str), ls) -> ls;\nendif;\n;;; Reverse the list\nrev(ls) -> ls;\n","language":"Pop11"},{"code":";;; Put list elements and lenght on the stack\ndestlist(ls);\n;;; Build a vector from them\nlvars ar = consvector();\n;;; Display in a loop, putting trailing period\nfor i from 1 to length(ar) do\n printf(ar(i), '%s.');\nendfor;\nprintf('\\n');\n","language":"Pop11"},{"code":"for i in ls do\n printf(i, '%s.');\nendfor;\n","language":"Pop11"},{"code":"FUNCTION PBMAIN () AS LONG\n DIM parseMe AS STRING\n parseMe = \"Hello,How,Are,You,Today\"\n\n REDIM parsed(PARSECOUNT(parseMe) - 1) AS STRING\n PARSE parseMe, parsed() 'comma is default delimiter\n\n DIM L0 AS LONG, outP AS STRING\n outP = parsed(0)\n FOR L0 = 1 TO UBOUND(parsed) 'could reuse parsecount instead of ubound\n outP = outP & \".\" & parsed(L0)\n NEXT\n\n MSGBOX outP\nEND FUNCTION\n","language":"PowerBASIC"},{"code":"$words = \"Hello,How,Are,You,Today\".Split(',')\n[string]::Join('.', $words)\n","language":"PowerShell"},{"code":"$words = \"Hello,How,Are,You,Today\" -split ','\n$words -join '.'\n","language":"PowerShell"},{"code":"\"Hello,How,Are,You,Today\", \",,Hello,,Goodbye,,\" | ForEach-Object {($_.Split(',',[StringSplitOptions]::RemoveEmptyEntries)) -join \".\"}\n","language":"PowerShell"},{"code":"splitup(Sep,[token(B)|BL]) --> splitup(Sep,B,BL).\nsplitup(Sep,[A|AL],B) --> [A], {\\+ [A] = Sep }, splitup(Sep,AL,B).\nsplitup(Sep,[],[B|BL]) --> Sep, splitup(Sep,B,BL).\nsplitup(_Sep,[],[]) --> [].\nstart :-\n phrase(splitup(\",\",Tokens),\"Hello,How,Are,You,Today\"),\n phrase(splitup(\".\",Tokens),Backtogether),\n string_to_list(ABack,Backtogether),\n writeln(ABack).\n","language":"Prolog"},{"code":"?- split_string(\"Hello,How,Are,You,Today\", \",\", \"\", Split),\n| atomics_to_string(Split, \".\", PeriodSeparated),\n| writeln(PeriodSeparated).\nHello.How.Are.You.Today\n","language":"Prolog"},{"code":"NewList MyStrings.s()\n\nFor i=1 To 5\n AddElement(MyStrings())\n MyStrings()=StringField(\"Hello,How,Are,You,Today\",i,\",\")\nNext i\n\nForEach MyStrings()\n Print(MyStrings()+\".\")\nNext\n","language":"PureBasic"},{"code":"Print(ReplaceString(\"Hello,How,Are,You,Today\",\",\",\".\"))\n","language":"PureBasic"},{"code":"text = \"Hello,How,Are,You,Today\"\ntokens = text.split(',')\nprint ('.'.join(tokens))\n","language":"Python"},{"code":"print ('.'.join('Hello,How,Are,You,Today'.split(',')))\n","language":"Python"},{"code":"words: \",\" vs \"Hello,How,Are,You,Today\"\n\".\" sv words\n","language":"Q"},{"code":"a$ = \"Hello,How,Are,You,Today\" ' | Initialize original string.\nFOR na = 1 TO LEN(a$) ' | Start loop to count number of commas.\n IF MID$(a$, na, 1) = \",\" THEN nc = nc + 1 ' | For each comma, increment nc.\nNEXT ' | End of loop.\nDIM t$(nc) ' | Dim t$ array with total number of commas (nc). Array base is 0.\nFOR nb = 1 TO LEN(a$) ' | Start loop to find each word.\n c$ = MID$(a$, nb, 1) ' | Look at each character in the string.\n IF c$ = \",\" THEN ' | If the character is a comma, increase the t$ array for the next word.\n t = t + 1 ' | t = token word count. Starts at 0 because array base is 0.\n ELSE ' | Or...\n t$(t) = t$(t) + c$ ' | Add each character to the current token (t$) word.\n END IF ' | End of decision tree.\nNEXT ' | End of loop.\nFOR nd = 0 TO t ' | Start loop to create final desired output.\n tf$ = tf$ + t$(nd) + \".\" ' | Add each token word from t$ followed by a period to the final tf$.\nNEXT ' | End of loop.\nPRINT LEFT$(tf$, LEN(tf$) - 1) ' | Print all but the last period of tf$.\nEND ' | Program end.\n","language":"QB64"},{"code":"a$ = \"Hello,How,Are,You,Today\" ' | Initialize original string.\nDIM t$(LEN(a$) / 2) ' | Create an overestimated sized array.\nFOR nd = 1 TO LEN(a$) ' | Start loop to find each comma.\n IF MID$(a$, nd, 1) = \",\" THEN ' | If a comma is found...\n tc = tc + 1 ' | Increment tc for each found comma.\n t$(tc) = word$(a$, tc, \",\") ' | Assign tc word to t$(tc) array.\n END IF ' | End decision tree.\nNEXT ' | End loop.\nt$(tc + 1) = word$(a$, tc + 1, \",\") ' | Assign last word to next array position.\nft$ = t$(1) ' | Start final return string ft$ with first array value.\nFOR ne = 2 TO tc + 1 ' | Start loop to add periods and array values.\n ft$ = ft$ + \".\" + t$(ne) ' | Concatenate a period with subsequent array values.\nNEXT ' | End loop.\nPRINT ft$ ' | Print final return string ft$.\n\nFUNCTION word$ (inSTG$, inDEC, inPRM$) ' | word$ function accepts original string, word number, and separator.\n inSTG$ = inSTG$ + inPRM$ ' | Add a separator to the end of the original string.\n FOR na = 1 TO LEN(inSTG$) ' | Start loop to count total number of separators.\n IF MID$(inSTG$, na, 1) = inPRM$ THEN nc = nc + 1 ' | If separator found, increment nc.\n NEXT ' | End loop.\n IF inDEC > nc THEN word$ = \"\": GOTO DONE ' | If requested word number (inDEC) is greater than total words (nc), bail.\n FOR nd = 1 TO inDEC ' | Start loop to find requested numbered word.\n last = st ' | Remember the position of the last separator.\n st = INSTR(last + 1, inSTG$, inPRM$) ' | Find the next separator.\n NEXT ' | End loop.\n word$ = MID$(inSTG$, last + 1, st - last - 1) ' | Return requested word.\n DONE: ' | Label for bail destination of word count error check.\nEND FUNCTION ' | End of function.\n","language":"QB64"},{"code":"DIM parseMe AS STRING\nparseMe = \"Hello,How,Are,You,Today\"\n\nDIM tmpLng1 AS INTEGER, tmpLng2 AS INTEGER, parsedCount AS INTEGER\ntmpLng2 = 1\nparsedCount = -1\n\n'count number of tokens\nDO\n tmpLng1 = INSTR(tmpLng2, parseMe, \",\")\n IF tmpLng1 THEN\n parsedCount = parsedCount + 1\n tmpLng2 = tmpLng1 + 1\n ELSE\n IF tmpLng2 < (LEN(parseMe) + 1) THEN parsedCount = parsedCount + 1\n EXIT DO\n END IF\nLOOP\n\nIF parsedCount > -1 THEN\n REDIM parsed(parsedCount) AS STRING\n tmpLng2 = 1\n parsedCount = -1\n\n 'parse\n DO\n tmpLng1 = INSTR(tmpLng2, parseMe, \",\")\n IF tmpLng1 THEN\n parsedCount = parsedCount + 1\n parsed(parsedCount) = MID$(parseMe, tmpLng2, tmpLng1 - tmpLng2)\n tmpLng2 = tmpLng1 + 1\n ELSE\n IF tmpLng2 < (LEN(parseMe) + 1) THEN\n parsedCount = parsedCount + 1\n parsed(parsedCount) = MID$(parseMe, tmpLng2)\n END IF\n EXIT DO\n END IF\n LOOP\n\n PRINT parsed(0);\n FOR L0 = 1 TO parsedCount\n PRINT \".\"; parsed(L0);\n NEXT\nEND IF\n","language":"QBasic"},{"code":" [ [] [] rot\n witheach\n [ dup char , = iff\n [ drop nested join [] ]\n else join ]\n nested join ] is tokenise ( $ --> [ )\n\n [ witheach [ echo$ say \".\" ] ] is display ( [ --> )\n\n $ \"Hello,How,Are,You,Today\" tokenise display\n","language":"Quackery"},{"code":"text <- \"Hello,How,Are,You,Today\"\njunk <- strsplit(text, split=\",\")\nprint(paste(unlist(junk), collapse=\".\"))\n","language":"R"},{"code":"paste(unlist(strsplit(text, split=\",\")), collapse=\".\")\n","language":"R"},{"code":"#lang racket\n(string-join (string-split \"Hello,How,Are,You,Today\" \",\") \".\")\n;; -> \"Hello.How.Are.You.Today\"\n","language":"Racket"},{"code":"'Hello,How,Are,You,Today'.split(',').join('.').say;\n","language":"Raku"},{"code":"say join '.', split ',', 'Hello,How,Are,You,Today';\n","language":"Raku"},{"code":"'Hello,How,Are,You,Today' ',' split '.' join print\n","language":"Raven"},{"code":"print [\"Original:\" original: \"Hello,How,Are,You,Today\"]\ntokens: parse original \",\"\ndotted: \"\" repeat i tokens [append dotted rejoin [i \".\"]]\nprint [\"Dotted: \" dotted]\n","language":"REBOL"},{"code":"str: \"Hello,How,Are,You,Today\"\n>> tokens: split str \",\"\n>> probe tokens\n[\"Hello\" \"How\" \"Are\" \"You\" \"Today\"]\n\n>> periods: replace/all form tokens \" \" \".\" ;The word FORM converts the list series to a string removing quotes.\n>> print periods ;then REPLACE/ALL spaces with period\nHello.How.Are.You.Today\n","language":"Red"},{"code":"{{\n : char ( -$ ) \" \" ;\n : tokenize ( $-$$ )\n @char ^strings'splitAtChar withLength 1- over + 0 swap ! tempString ;\n : action ( $- )\n keepString ^buffer'add ;\n---reveal---\n : split ( $cb- )\n ^buffer'set !char\n char ^strings'append\n [ tokenize action dup 1 <> ] while drop\n ^buffer'get drop ;\n}}\n","language":"Retro"},{"code":"create strings 100 allot\n\"Hello,How,Are,You,Today\" ', strings split\n","language":"Retro"},{"code":"strings [ @ \"%s.\" puts ] ^types'STRING each@\n","language":"Retro"},{"code":"/*REXX program separates a string of comma─delimited words, and echoes them ──► terminal*/\noriginal = 'Hello,How,Are,You,Today' /*some words separated by commas (,). */\nsay 'The input string:' original /*display original string ──► terminal.*/\nnew= original /*make a copy of the string. */\n do #=1 until new=='' /*keep processing until NEW is empty.*/\n parse var new @.# ',' new /*parse words delineated by a comma (,)*/\n end /*#*/ /* [↑] the new array is named @. */\nsay /* NEW is destructively parsed. [↑] */\nsay center(' Words in the string ', 40, \"═\") /*display a nice header for the list. */\n do j=1 for # /*display all the words (one per line),*/\n say @.j || left(., j\\==#) /*maybe append a period (.) to a word. */\n end /*j*/ /* [↑] don't append a period if last. */\nsay center(' End─of─list ', 40, \"═\") /*display a (EOL) trailer for the list.*/\n","language":"REXX"},{"code":"/*REXX program to separate a string of comma-delimited words and echo */\nsss='Hello,How,Are,You,Today'\nsay 'input string='sss\nsay ''\nsay 'Words in the string:'\nss =translate(sss,' ',',')\ndot='.'\nDo i=1 To words(ss)\n If i=words(ss) Then dot=''\n say word(ss,i)dot\n End\nsay 'End-of-list.'\n","language":"REXX"},{"code":"see substr(\"Hello,How,Are,You,Today\", \",\", \".\")\n","language":"Ring"},{"code":"puts \"Hello,How,Are,You,Today\".split(',').join('.')\n","language":"Ruby"},{"code":"text$ = \"Hello,How,Are,You,Today\"\nFOR i = 1 to 5\n textArray$(i) = word$(text$,i,\",\")\n print textArray$(i);\" \";\nNEXT\n","language":"Run-BASIC"},{"code":"fn main() {\n let s = \"Hello,How,Are,You,Today\";\n let tokens: Vec<&str> = s.split(\",\").collect();\n println!(\"{}\", tokens.join(\".\"));\n}\n","language":"Rust"},{"code":"variable a = strchop(\"Hello,How,Are,You,Today\", ',', 0);\nprint(strjoin(a, \".\"));\n","language":"S-lang"},{"code":"println(\"Hello,How,Are,You,Today\" split \",\" mkString \".\")\n","language":"Scala"},{"code":"(use-modules (ice-9 regex))\n(define s \"Hello,How,Are,You,Today\")\n(define words (map match:substring (list-matches \"[^,]+\" s)))\n\n(do ((n 0 (+ n 1))) ((= n (length words)))\n (display (list-ref words n))\n (if (< n (- (length words) 1))\n (display \".\")))\n","language":"Scheme"},{"code":"(define s \"Hello,How,Are,You,Today\")\n(define words (string-tokenize s (char-set-complement (char-set #\\,))))\n(define t (string-join words \".\"))\n","language":"Scheme"},{"code":"(print\n (string-join\n (string-split \"Hello,How,Are,You,Today\" #\\,)\n \".\"))\n","language":"Scheme"},{"code":"var array string: tokens is 0 times \"\";\n\ntokens := split(\"Hello,How,Are,You,Today\", \",\");\n","language":"Seed7"},{"code":"| s = 'Hello,How,Are,You,Today' |\n((s splitOn: ',') joinUsing: '.') printLine.\n","language":"Self"},{"code":"'Hello,How,Are,You,Today'.split(',').join('.').say;\n","language":"Sidef"},{"code":"BEGIN\n\n CLASS TEXTARRAY(N); INTEGER N;\n BEGIN\n TEXT ARRAY ARR(1:N);\n END TEXTARRAY;\n\n REF(TEXTARRAY) PROCEDURE SPLIT(T,DELIM); TEXT T; CHARACTER DELIM;\n BEGIN\n INTEGER N, I, LPOS;\n REF(TEXTARRAY) A;\n\n N := 1;\n T.SETPOS(1);\n WHILE T.MORE DO\n IF T.GETCHAR = DELIM THEN\n N := N+1;\n A :- NEW TEXTARRAY(N);\n\n I := 0;\n LPOS := 1;\n T.SETPOS(LPOS);\n WHILE T.MORE DO\n IF T.GETCHAR = DELIM THEN\n BEGIN\n I := I+1;\n A.ARR(I) :- T.SUB(LPOS,T.POS-LPOS-1);\n LPOS := T.POS;\n END;\n I := I+1;\n A.ARR(I) :- T.SUB(LPOS,T.LENGTH-LPOS+1);\n SPLIT :- A;\n END SPLIT;\n\n BEGIN\n TEXT S;\n REF(TEXTARRAY) TA;\n INTEGER I;\n\n S :- \"HELLO,HOW,ARE,YOU,TODAY\";\n TA :- SPLIT(S,',');\n FOR I := 1 STEP 1 UNTIL TA.N DO\n BEGIN\n OUTTEXT(TA.ARR(I));\n OUTCHAR('.');\n END;\n OUTIMAGE;\n END;\n\nEND.\n","language":"Simula"},{"code":"('Hello,How,Are,You,Today' splitWith: $,) join &separator: '.'.\n","language":"Slate"},{"code":"(display\n (list->string\n (string->list\n \"Hello,How,Are,You,Today\"\n \",\")\n \".\"))\n","language":"Slope"},{"code":"|array |\narray := 'Hello,How,Are,You,Today' subStrings: $,.\narray fold: [:concatenation :string | concatenation, '.', string ]\n","language":"Smalltalk"},{"code":"('Hello,How,Are,You,Today' subStrings: $,) join: '.'\n","language":"Smalltalk"},{"code":"|array |\narray := 'Hello,How,Are,You,Today' subStrings: $,.\narray inject: '' into: [:concatenation :string | concatenation, string, '.' ]\n","language":"Smalltalk"},{"code":" define('split(chs,str)i,j,t,w2') :(split_end)\nsplit t = table()\nsp1 str pos(0) (break(chs) | rem) $ t<i = i + 1>\n+ span(chs) (break(chs) | '') . w2 = w2 :s(sp1)\n* t<i> = differ(str,'') str ;* Uncomment for CSnobol\n split = array(i)\nsp2 split<j = j + 1> = t<j> :s(sp2)f(return)\nsplit_end\n\n define('join(ch,a)i,') :(join_end)\njoin join = join a<i = i + 1>\n join = join ?a<i + 1> ch :s(join)f(return)\njoin_end\n\n* # Test and display\n output = join('.',split(',','Hello,How,Are,You,Today'))\nend\n","language":"SNOBOL4"},{"code":"val splitter = String.tokens (fn c => c = #\",\");\nval main = (String.concatWith \".\") o splitter;\n","language":"Standard-ML"},{"code":"- main \"Hello,How,Are,You,Today\"\nval it = \"Hello.How.Are.You.Today\" : string\n","language":"Standard-ML"},{"code":"let text = \"Hello,How,Are,You,Today\"\nlet tokens = text.components(separatedBy: \",\") // for single or multi-character separator\nprint(tokens)\nlet result = tokens.joined(separator: \".\")\nprint(result)\n","language":"Swift"},{"code":"let text = \"Hello,How,Are,You,Today\"\nlet tokens = text.characters.split(\",\").map{String($0)} // for single-character separator\nprint(tokens)\nlet result = tokens.joinWithSeparator(\".\")\nprint(result)\n","language":"Swift"},{"code":"let text = \"Hello,How,Are,You,Today\"\nlet tokens = split(text, { $0 == \",\" }) // for single-character separator\nprintln(tokens)\nlet result = \".\".join(tokens)\nprintln(result)\n","language":"Swift"},{"code":"import Foundation\n\nlet text = \"Hello,How,Are,You,Today\"\nlet tokens = text.componentsSeparatedByString(\",\")\nprint(tokens)\n","language":"Swift"},{"code":"split $string \",\"\n","language":"Tcl"},{"code":"join $list \".\"\n","language":"Tcl"},{"code":"puts [join [split \"Hello,How,Are,You,Today\" \",\"] \".\"]\n","language":"Tcl"},{"code":"puts [join [set words [split \"Hello,How,Are,You,Today\" \",\"]] \".\"]\n","language":"Tcl"},{"code":"#lang transd\n\nMainModule: {\n_start: (lambda locals: s \"Hello,How,Are,You,Today\"\n (textout (join (split s \",\") \".\"))\n)\n}\n","language":"Transd"},{"code":"$$ MODE TUSCRIPT\nSET string=\"Hello,How,Are,You,Today\"\nSET string=SPLIT (string,\":,:\")\nSET string=JOIN (string,\".\")\n","language":"TUSCRIPT"},{"code":"@(next :list \"Hello,How,Are,You,Today\")\n@(coll)@{token /[^,]+/}@(end)\n@(output)\n@(rep)@token.@(last)@token@(end)\n@(end)\n","language":"TXR"},{"code":"@(next :list \"Hello,How,Are,You,Today\")\n@(coll)@(maybe)@token,@(or)@token@(end)@(end)\n@(output)\n@(rep)@token.@(last)@token@(end)\n@(end)\n","language":"TXR"},{"code":"txr -p '(cat-str (split-str \"Hello,How,Are,You,Today\" \",\") \".\")'\nHello.How.Are.You.Today\n","language":"TXR"},{"code":"string='Hello,How,Are,You,Today'\n\n(IFS=,\n printf '%s.' $string\n echo)\n","language":"UNIX-Shell"},{"code":"#! /bin/bash\nstripchar-l ()\n#removes the specified character from the left side of the string\n#USAGE: stripchar \"stuff\" \"s\" --> tuff\n{\n string=\"$1\";\n string=${string#\"$2\"};\n\n echo \"$string\"\n}\n\njoin ()\n#join a string of characters on a specified delimiter\n#USAGE: join \"1;2;3;4\" \";\" \",\" --> 1,2,3,4\n{\n local result=\"\";\n local list=\"$1\";\n OLDIFS=\"$IFS\";\n local IFS=${2-\" \"};\n local output_field_seperator=${3-\" \"};\n\n for element in $list;\n do\n result=\"$result$output_field_seperator$element\";\n done;\n\n result=\"`stripchar-l \"$result\" \"$output_field_seperator\"`\";\n echo \"$result\";\n IFS=\"$OLDIFS\"\n}\n\nsplit ()\n{\n#split a string of characters on a specified delimiter\n#USAGE: split \"1;2;3;4\" \";\" --> 1 2 3 4\t\n local list=\"$1\";\n local input_field_seperator=${2-\" \"};\n local output_field_seperator=\" \";\n\n #defined in terms of join\n join \"$list\" \"$input_field_seperator\" \"$output_field_seperator\"\n}\n\nstrtokenize ()\n{\n#splits up a string of characters into tokens,\n#based on a user supplied delimiter\n#USAGE:strtokenize \"1;2;3;4\" \";\" \":\" --> 1:2:3:4\n local list=\"$1\";\n\tlocal input_delimiter=${2-\" \"};\n\tlocal output_delimiter=${3-\" \"};\n\tlocal contains_a_space=\" \"; #added to highlight the use\n #of \" \" as an argument to join\t\n\n #splits it input then joins it with a user supplied delimiter\n join \"$( split \"$list\" \"$input_delimiter\" )\" \\\n \"$contains_a_space\" \"$output_delimiter\";\n}\n","language":"UNIX-Shell"},{"code":" strtokenize \"Hello,How,Are,You,Today\" \",\" \".\"\n Hello.How.Are.You.Today\n","language":"UNIX-Shell"},{"code":"string1=\"Hello,How,Are,You,Today\"\nelements_quantity=$(echo $string1|tr \",\" \"\\n\"|wc -l)\n\npresent_element=1\nwhile [ $present_element -le $elements_quantity ];do\necho $string1|cut -d \",\" -f $present_element|tr -d \"\\n\"\nif [ $present_element -lt $elements_quantity ];then echo -n \".\";fi\npresent_element=$(expr $present_element + 1)\ndone\necho\n\n# or to cheat\necho \"Hello,How,Are,You,Today\"|tr \",\" \".\"\n","language":"UNIX-Shell"},{"code":"token() {\n (IFS=, read -r A B; echo \"$A\".; test -n \"$B\" && (echo \"$B\" | token))\n}\n\necho \"Hello,How,Are,You\" | token\n","language":"UnixPipes"},{"code":"decl string text\nset text \"Hello,How,Are,You,Today\"\ndecl string<> tokens\nset tokens (split text \",\")\nfor (decl int i) (< i (size tokens)) (inc i)\n out tokens<i> \".\" console\nend for\nout endl console\n","language":"Ursa"},{"code":"#import std\n\ntoken_list = sep`, 'Hello,How,Are,You,Today'\n\n#cast %s\n\nmain = mat`. token_list\n","language":"Ursala"},{"code":"// Tokenize a string, in V (Vlang)\n// Tectonics: v run tokenize-a-string.v\nmodule main\n\n// starts here\npub fn main() {\n println(\"Hello,How,Are,You,Today\".split(',').join('.'))\n}\n","language":"V-(Vlang)"},{"code":"void main() {\n string s = \"Hello,How,Are,You,Today\";\n print(@\"$(string.joinv(\".\", s.split(\",\")))\");\n}\n","language":"Vala"},{"code":"Sub Main()\nDim temp() As String\n temp = Tokenize(\"Hello,How,Are,You,Today\", \",\")\n Display temp, Space(5)\nEnd Sub\n\nPrivate Function Tokenize(strS As String, sep As String) As String()\n Tokenize = Split(strS, sep)\nEnd Function\n\nPrivate Sub Display(arr() As String, sep As String)\n Debug.Print Join(arr, sep)\nEnd Sub\n","language":"VBA"},{"code":"s = \"Hello,How,Are,You,Today\"\nWScript.StdOut.Write Join(Split(s,\",\"),\".\")\n","language":"VBScript"},{"code":"Buf_Switch(Buf_Free)\nIns_Text(\"Hello,How,Are,You,Today\")\n\n// Split the text into text registers 10, 11, ...\nBOF\n#1 = 9\nRepeat(ALL) {\n #1++\n #2 = Cur_Pos\n Search(\",\", ADVANCE+ERRBREAK)\n Reg_Copy_Block(#1, #2, Cur_Pos-1)\n}\nReg_Copy_Block(#1, #2, EOB_Pos)\n\n// Display the list\nfor (#3 = 10; #3 <= #1; #3++) {\n Reg_Type(#3) Message(\".\")\n}\n\nBuf_Quit(OK)\n","language":"Vedit-macro-language"},{"code":"Sub Main()\n Dim parseMe As String, parsed As Variant\n parseMe = \"Hello,How,Are,You,Today\"\n\n parsed = Split(parseMe, \",\")\n\n Dim L0 As Long, outP As String\n outP = parsed(0)\n For L0 = 1 To UBound(parsed)\n outP = outP & \".\" & parsed(L0)\n Next\n\n MsgBox outP\nEnd Sub\n","language":"Visual-Basic"},{"code":"@join \".\" @split \",\" \"Hello,How,Are,You,Today\"\n","language":"Wortel"},{"code":"var s = \"Hello,How,Are,You,Today\"\nvar t = s.split(\",\").join(\".\") + \".\"\nSystem.print(t)\n","language":"Wren"},{"code":"string-join(tokenize(\"Hello,How,Are,You,Today\", \",\"), \".\")\n","language":"XPath-2.0"},{"code":"string 0;\ninclude c:\\cxpl\\codes;\nint I, J, K, Char;\nchar String, Array(5,6); \\5 words and 5 maximum chars + terminating 0\n\n[String:= \"Hello,How,Are,You,Today\";\nI:= 0; K:= 0;\nrepeat J:= 0;\n loop [Char:= String(I);\n I:= I+1;\n if Char=^, or Char=0 then quit;\n Array(K,J):= Char;\n J:= J+1;\n ];\n Array(K,J):= 0; \\terminate word\n K:= K+1; \\next word in array\nuntil K>=5;\nfor K:= 4 downto 0 do [Text(0, addr Array(K,0)); ChOut(0, ^.)];\nCrLf(0);\n]\n","language":"XPL0"},{"code":"dim s$(1)\n\nn = token(\"Hello. How are you today?\", s$(), \".? \")\n\nfor i = 1 to n\n\tprint s$(i);\n\tif i < n print \".\";\nnext\nprint\n","language":"Yabasic"},{"code":"const std = @import(\"std\");\npub fn main() void {\n const string = \"Hello,How,Are,You,Today\";\n var tokens = std.mem.split(u8, string, \",\");\n std.debug.print(\"{s}\", .{tokens.next().?});\n while (tokens.next()) |token| {\n std.debug.print(\".{s}\", .{token});\n }\n}\n","language":"Zig"},{"code":"\"Hello,How,Are,You,Today\".split(\",\").concat(\".\").println();\nHello.How.Are.You.Today\n","language":"Zkl"},{"code":"program: tokenize_a_string\n input: \"Hello,How,Are,You,Today\"\n output: \"Hello.How.Are.You.Today\"\n","language":"Zoea"}],"string":"[\n {\n \"code\": \"---\\ncategory:\\n- Simple\\nfrom: http://rosettacode.org/wiki/Tokenize_a_string\\nnote: String manipulation\\n\",\n \"language\": \"00-META\"\n },\n {\n \"code\": \"Separate the string \\\"Hello,How,Are,You,Today\\\" by commas into an array (or list) so that each element of it stores a different word. \\n\\nDisplay the words to the 'user', in the simplest manner possible, separated by a period. \\n\\nTo simplify, you may display a trailing period.\\n\\n\\n{{Template:Strings}}\\n<br><br>\\n\\n\",\n \"language\": \"00-TASK\"\n },\n {\n \"code\": \"V text = ‘Hello,How,Are,You,Today’\\nV tokens = text.split(‘,’)\\nprint(tokens.join(‘.’))\\n\",\n \"language\": \"11l\"\n },\n {\n \"code\": \"* Tokenize a string - 08/06/2018\\nTOKSTR CSECT\\n USING TOKSTR,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 MVC N,=A(1) n=1\\n LA R7,1 i1=1\\n LA R6,1 i=1\\n DO WHILE=(C,R6,LE,LENS) do i=1 to length(s);\\n LA R4,S-1 @s-1\\n AR R4,R6 +i\\n MVC C,0(R4) c=substr(s,i,1)\\n IF CLI,C,EQ,C',' THEN if c=',' then do\\n BAL R14,TOK call tok\\n LR R2,R8 i2\\n SR R2,R7 i2-i1\\n LA R2,1(R2) i2-i1+1\\n L R1,N n\\n SLA R1,1 *2\\n STH R2,TALEN-2(R1) talen(n)=i2-i1+1\\n L R2,N n\\n LA R2,1(R2) n+1\\n ST R2,N n=n+1\\n LA R7,1(R6) i1=i+1\\n ENDIF , endif\\n LA R6,1(R6) i++\\n ENDDO , enddo i\\n BAL R14,TOK call tok\\n LR R2,R8 i2\\n SR R2,R7 i2-i1\\n LA R2,1(R2) i2-i1+1\\n L R1,N n\\n SLA R1,1 *2\\n STH R2,TALEN-2(R1) talen(n)=i2-i1+1\\n LA R11,PG pgi=@pg\\n LA R6,1 i=1\\n DO WHILE=(C,R6,LE,N) do i=1 to n\\n LR R1,R6 i\\n SLA R1,1 *2\\n LH R10,TALEN-2(R1) l=talen(i)\\n LR R1,R6 i\\n SLA R1,3 *8\\n LA R4,TABLE-8(R1) @table(i)\\n LR R2,R10 l\\n BCTR R2,0 ~\\n EX R2,MVCX output table(i) length(l)\\n AR R11,R10 pgi=pgi+l\\n IF C,R6,NE,N THEN if i^=n then\\n MVC 0(1,R11),=C'.' output '.'\\n LA R11,1(R11) pgi=pgi+1\\n ENDIF , endif\\n LA R6,1(R6) i++\\n ENDDO , enddo i\\n XPRNT PG,L'PG print\\n L R13,4(0,R13) restore previous savearea pointer\\n RETURN (14,12),RC=0 restore registers from calling sav\\nTOK LR R5,R6 i <--\\n BCTR R5,0 i-1 |\\n LR R8,R5 i2=i-1\\n SR R5,R7 i2-i1\\n LA R5,1(R5) l=i2-i1+1 source length\\n L R1,N n\\n SLA R1,3 *8\\n LA R2,TABLE-8(R1) @table(n)\\n LA R4,S-1 @s-1\\n AR R4,R7 @s+i1-1\\n LA R3,8 target length\\n MVCL R2,R4 table(n)=substr(s,i1,i2-i1+1) |\\n BR R14 End TOK subroutine <--\\nMVCX MVC 0(0,R11),0(R4) output table(i)\\nS DC CL80'Hello,How,Are,You,Today' <== input string ==\\nLENS DC F'23' length(s) <==\\nTABLE DC 8CL8' ' table(8)\\nTALEN DC 8H'0' talen(8)\\nC DS CL1 char\\nN DS F number of tokens\\nPG DC CL80' ' buffer\\n YREGS\\n END TOKSTR\\n\",\n \"language\": \"360-Assembly\"\n },\n {\n \"code\": \"puts:\\tequ\\t9\\n\\torg\\t100h\\n\\tjmp\\tdemo\\n\\t;;;\\tSplit the string at DE by the character in C.\\n\\t;;;\\tStore pointers to the beginning of the elements starting at HL\\n\\t;;;\\tThe amount of elements is returned in B.\\nsplit:\\tmvi\\tb,0\\t\\t; Amount of elements\\nsloop:\\tmov\\tm,e\\t\\t; Store pointer at [HL]\\n\\tinx\\th\\n\\tmov\\tm,d\\n\\tinx\\th\\n\\tinr\\tb\\t\\t; Increment counter\\nsscan:\\tldax\\td\\t\\t; Get current character\\n\\tinx\\td\\n\\tcpi\\t'$'\\t\\t; Done?\\n\\trz\\t\\t\\t; Then stop\\n\\tcmp\\tc\\t\\t; Place to split?\\n\\tjnz\\tsscan\\t\\t; If not, keep going\\n\\tdcx\\td\\n\\tmvi\\ta,'$'\\t\\t; End the string here\\n\\tstax\\td\\n\\tinx\\td\\n\\tjmp\\tsloop\\t\\t; Next part\\n\\t;;;\\tTest on the string given in the task\\ndemo:\\tlxi\\th,parts\\t\\t; Parts array\\n\\tlxi\\td,hello\\t\\t; String\\n\\tmvi\\tc,','\\n\\tcall \\tsplit\\t\\t; Split the string\\n\\tlxi\\th,parts\\t\\t; Print each part\\nloop:\\tmov\\te,m\\t\\t; Load pointer into DE\\n\\tinx\\th\\n\\tmov\\td,m\\n\\tinx\\th\\n\\tpush\\th\\t\\t; Keep the array pointer\\n\\tpush\\tb\\t\\t; And the counter\\n\\tmvi\\tc,puts \\t\\t; Print the string\\n\\tcall\\t5\\n\\tlxi\\td,period\\t; And a period\\n\\tmvi\\tc,puts\\n\\tcall \\t5\\n\\tpop \\tb\\t\\t; Restore the counter\\n\\tpop \\th\\t\\t; Restore the array pointer\\n\\tdcr\\tb \\t\\t; One fewer string left\\n\\tjnz \\tloop\\n\\tret\\nperiod:\\tdb\\t'. $'\\nhello:\\tdb\\t'Hello,How,Are,You,Today$'\\nparts:\\tequ\\t$\\n\",\n \"language\": \"8080-Assembly\"\n },\n {\n \"code\": \"\\tcpu\\t8086\\n\\torg\\t100h\\nsection\\t.text\\n\\tjmp\\tdemo\\n\\t;;;\\tSplit the string at DS:SI on the character in DL.\\n\\t;;;\\tStore pointers to strings starting at ES:DI.\\n\\t;;;\\tThe amount of strings is returned in CX.\\nsplit:\\txor\\tcx,cx\\t\\t; Zero out counter\\n.loop:\\tmov\\tax,si\\t\\t; Store pointer to current location\\n\\tstosw\\n\\tinc\\tcx\\t\\t; Increment counter\\n.scan:\\tlodsb\\t\\t\\t; Get byte\\n\\tcmp\\tal,'$'\\t\\t; End of string?\\n\\tje\\t.done\\n\\tcmp\\tal,dl\\t\\t; Character to split on?\\n\\tjne\\t.scan\\n\\tmov\\t[si-1],byte '$'\\t; Terminate string\\n\\tjmp\\t.loop\\n.done:\\tret\\n\\t;;;\\tTest on the string given in the task\\ndemo:\\tmov\\tsi,hello\\t; String to split\\n\\tmov\\tdi,parts\\t; Place to store pointers\\n\\tmov\\tdl,','\\t\\t; Character to split string on\\n\\tcall\\tsplit\\n\\t;;;\\tPrint the resulting strings, and periods\\n\\tmov\\tsi,parts\\t; Array of string pointers\\nprint:\\tlodsw\\t\\t\\t; Load next pointer\\n\\tmov\\tdx,ax\\t\\t; Print string using DOS\\n\\tmov\\tah,9\\n\\tint\\t21h\\n\\tmov\\tdx,period\\t; Then print a period\\n\\tint\\t21h\\n\\tloop\\tprint\\t\\t; Loop while there are strings\\n\\tret\\nsection .data\\nperiod:\\tdb\\t'. $'\\nhello:\\tdb\\t'Hello,How,Are,You,Today$'\\nsection\\t.bss\\nparts:\\tresw\\t10\\n\",\n \"language\": \"8086-Assembly\"\n },\n {\n \"code\": \"/* ARM assembly AARCH64 Raspberry PI 3B */\\n/* program strTokenize64.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 NBPOSTESECLAT, 20\\n\\n/*******************************************/\\n/* Initialized data */\\n/*******************************************/\\n.data\\nszMessFinal: .asciz \\\"Words are : \\\\n\\\"\\n\\nszString: .asciz \\\"Hello,How,Are,You,Today\\\"\\nszMessError: .asciz \\\"Error tokenize !!\\\\n\\\"\\nszCarriageReturn: .asciz \\\"\\\\n\\\"\\n/*******************************************/\\n/* UnInitialized data */\\n/*******************************************/\\n.bss\\n/*******************************************/\\n/* code section */\\n/*******************************************/\\n.text\\n.global main\\nmain:\\n ldr x0,qAdrszString // string address\\n mov x1,',' // separator\\n bl stTokenize\\n cmp x0,-1 // error ?\\n beq 99f\\n mov x2,x0 // table address\\n ldr x0,qAdrszMessFinal // display message\\n bl affichageMess\\n ldr x4,[x2] // number of areas\\n add x2,x2,8 // first area\\n mov x3,0 // loop counter\\n mov x0,x2\\n1: // display loop\\n ldr x0,[x2,x3, lsl 3] // address area\\n bl affichageMess\\n ldr x0,qAdrszCarriageReturn // display carriage return\\n bl affichageMess\\n add x3,x3,1 // counter + 1\\n cmp x3,x4 // end ?\\n blt 1b // no -> loop\\n\\n b 100f\\n99: // display error message\\n ldr x0,qAdrszMessError\\n bl affichageMess\\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\\nqAdrszString: .quad szString\\n//qAdrszFinalString: .quad szFinalString\\nqAdrszMessFinal: .quad szMessFinal\\nqAdrszMessError: .quad szMessError\\nqAdrszCarriageReturn: .quad szCarriageReturn\\n\\n/*******************************************************************/\\t\\n/* Separate string by separator into an array */\\n/* areas are store on the heap Linux */\\n/*******************************************************************/\\t\\n/* x0 contains string address */\\n/* x1 contains separator character (, or . or : ) */\\n/* x0 returns table address with first item = number areas */\\n/* and other items contains pointer of each string */\\nstTokenize:\\n stp x1,lr,[sp,-16]! // save registers\\n mov x16,x0\\n mov x9,x1 // save separator\\n mov x14,0\\n1: // compute length string for place reservation on the heap\\n ldrb w12,[x0,x14]\\n cbz x12, 2f\\n add x14,x14,1\\n b 1b\\n2:\\n ldr x12,qTailleTable\\n add x15,x12,x14\\n and x15,x15,0xFFFFFFFFFFFFFFF0\\n add x15,x15,16 // align word on the heap\\n // place reservation on the heap\\n mov x0,0 // heap address\\n mov x8,BRK // call system linux 'brk'\\n svc 0 // call system\\n cmp x0,-1 // error call system\\n beq 100f\\n mov x14,x0 // save address heap begin = begin array\\n add x0,x0,x15 // reserve x15 byte on the heap\\n mov x8,BRK // call system linux 'brk'\\n svc 0\\n cmp x0,-1\\n beq 100f\\n // string copy on the heap\\n add x13,x14,x12 // behind the array\\n mov x0,x16\\n mov x1,x13\\n3: // loop copy string\\n ldrb w12,[x0],1 // read one byte and increment pointer one byte\\n strb w12,[x1],1 // store one byte and increment pointer one byte\\n cbnz x12,3b // end of string ? no -> loop\\n\\n mov x0,#0\\n str x0,[x14]\\n str x13,[x14,8]\\n mov x12,#1 // areas counter\\n4: // loop load string character\\n ldrb w0,[x13]\\n cbz x0,5f // end string\\n cmp x0,x9 // separator ?\\n cinc x13,x13,ne // no -> next location\\n bne 4b // and loop\\n strb wzr,[x13] // store zero final of string\\n add x13,x13,1 // next character\\n add x12,x12,1 // areas counter + 1\\n str x13,[x14,x12, lsl #3] // store address area in the table at index x2\\n b 4b // and loop\\n\\n5:\\n str x12,[x14] // store number areas\\n mov x0,x14 // returns array address\\n100:\\n ldp x1,lr,[sp],16 // restaur 2 registers\\n ret // return to address lr x30\\nqTailleTable: .quad 8 * NBPOSTESECLAT\\n\\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\": \"(defun split-at (xs delim)\\n (if (or (endp xs) (eql (first xs) delim))\\n (mv nil (rest xs))\\n (mv-let (before after)\\n (split-at (rest xs) delim)\\n (mv (cons (first xs) before) after))))\\n\\n(defun split (xs delim)\\n (if (endp xs)\\n nil\\n (mv-let (before after)\\n (split-at xs delim)\\n (cons before (split after delim)))))\\n\\n(defun css->strs (css)\\n (if (endp css)\\n nil\\n (cons (coerce (first css) 'string)\\n (css->strs (rest css)))))\\n\\n(defun split-str (str delim)\\n (css->strs (split (coerce str 'list) delim)))\\n\\n(defun print-with (strs delim)\\n (if (endp strs)\\n (cw \\\"~%\\\")\\n (progn$ (cw (first strs))\\n (cw (coerce (list delim) 'string))\\n (print-with (rest strs) delim))))\\n\",\n \"language\": \"ACL2\"\n },\n {\n \"code\": \"CARD EndProg ;required for ALLOCATE.ACT\\n\\nINCLUDE \\\"D2:ALLOCATE.ACT\\\" ;from the Action! Tool Kit. You must type 'SET EndProg=*' from the monitor after compiling, but before running this program!\\n\\nDEFINE PTR=\\\"CARD\\\"\\n\\nBYTE FUNC Split(CHAR ARRAY s CHAR c PTR ARRAY items)\\n BYTE i,count,start,len\\n CHAR ARRAY item\\n\\n IF s(0)=0 THEN RETURN (0) FI\\n\\n i=1 count=0\\n WHILE i<s(0)\\n DO\\n start=i\\n WHILE i<=s(0) AND s(i)#c\\n DO\\n i==+1\\n OD\\n len=i-start\\n item=Alloc(len+1)\\n SCopyS(item,s,start,i-1)\\n items(count)=item\\n count==+1\\n i==+1\\n OD\\nRETURN (count)\\n\\nPROC Join(PTR ARRAY items BYTE count CHAR c CHAR ARRAY s)\\n BYTE i,pos\\n CHAR POINTER srcPtr,dstPtr\\n CHAR ARRAY item\\n\\n s(0)=0\\n IF count=0 THEN RETURN FI\\n\\n pos=1\\n FOR i=0 TO count-1\\n DO\\n item=items(i)\\n srcPtr=item+1\\n dstPtr=s+pos\\n MoveBlock(dstPtr,srcPtr,item(0))\\n pos==+item(0)\\n IF i<count-1 THEN\\n s(pos)='.\\n pos==+1\\n FI\\n OD\\n s(0)=pos-1\\nRETURN\\n\\nPROC Clear(PTR ARRAY items BYTE POINTER count)\\n BYTE i\\n CHAR ARRAY item\\n\\n IF count^=0 THEN RETURN FI\\n\\n FOR i=0 TO count^-1\\n DO\\n item=items(i)\\n Free(item,item(0)+1)\\n OD\\n count^=0\\nRETURN\\n\\nPROC Main()\\n CHAR ARRAY s=\\\"Hello,How,Are,You,Today\\\"\\n CHAR ARRAY r(256)\\n PTR ARRAY items(100)\\n BYTE i,count\\n\\n Put(125) PutE() ;clear screen\\n\\n AllocInit(0)\\n count=Split(s,',,items)\\n Join(items,count,'.,r)\\n\\n PrintF(\\\"Input:%E\\\"\\\"%S\\\"\\\"%E%E\\\",s)\\n PrintE(\\\"Split:\\\")\\n FOR i=0 TO count-1\\n DO\\n PrintF(\\\"\\\"\\\"%S\\\"\\\"\\\",items(i))\\n IF i<count-1 THEN\\n Print(\\\", \\\")\\n ELSE\\n PutE() PutE()\\n FI\\n OD\\n PrintF(\\\"Join:%E\\\"\\\"%S\\\"\\\"%E\\\",r)\\n\\n Clear(items,@count)\\nRETURN\\n\",\n \"language\": \"Action-\"\n },\n {\n \"code\": \"var hello:String = \\\"Hello,How,Are,You,Today\\\";\\nvar tokens:Array = hello.split(\\\",\\\");\\ntrace(tokens.join(\\\".\\\"));\\n\\n// Or as a one-liner\\ntrace(\\\"Hello,How,Are,You,Today\\\".split(\\\",\\\").join(\\\".\\\"));\\n\",\n \"language\": \"ActionScript\"\n },\n {\n \"code\": \"with Ada.Text_IO, Ada.Containers.Indefinite_Vectors, Ada.Strings.Fixed, Ada.Strings.Maps;\\nuse Ada.Text_IO, Ada.Containers, Ada.Strings, Ada.Strings.Fixed, Ada.Strings.Maps;\\n\\nprocedure Tokenize is\\n package String_Vectors is new Indefinite_Vectors (Positive, String);\\n use String_Vectors;\\n Input : String := \\\"Hello,How,Are,You,Today\\\";\\n Start : Positive := Input'First;\\n Finish : Natural := 0;\\n Output : Vector := Empty_Vector;\\nbegin\\n while Start <= Input'Last loop\\n Find_Token (Input, To_Set (','), Start, Outside, Start, Finish);\\n exit when Start > Finish;\\n Output.Append (Input (Start .. Finish));\\n Start := Finish + 1;\\n end loop;\\n for S of Output loop\\n Put (S & \\\".\\\");\\n end loop;\\nend Tokenize;\\n\",\n \"language\": \"Ada\"\n },\n {\n \"code\": \"main:(\\n\\n OP +:= = (REF FLEX[]STRING in out, STRING item)VOID:(\\n [LWB in out: UPB in out+1]STRING new;\\n new[LWB in out: UPB in out]:=in out;\\n new[UPB new]:=item;\\n in out := new\\n );\\n\\n PROC string split = (REF STRING beetles, STRING substr)[]STRING:(\\n \\\"\\\"\\\" Split beetles where substr is found \\\"\\\"\\\";\\n FLEX[1:0]STRING out;\\n INT start := 1, pos;\\n WHILE string in string(substr, pos, beetles[start:]) DO\\n out +:= STRING(beetles[start:start+pos-2]);\\n start +:= pos + UPB substr - 1\\n OD;\\n IF start > LWB beetles THEN\\n out +:= STRING(beetles[start:])\\n FI;\\n out\\n );\\n\\n PROC char split = (REF STRING beetles, STRING chars)[]STRING: (\\n \\\"\\\"\\\" Split beetles where character is found in chars \\\"\\\"\\\";\\n FLEX[1:0]STRING out;\\n FILE beetlef;\\n associate(beetlef, beetles); # associate a FILE handle with a STRING #\\n make term(beetlef, chars); # make term: assign CSV string terminator #\\n\\n PROC raise logical file end = (REF FILE f)BOOL: except logical file end;\\n on logical file end(beetlef, raise logical file end);\\n\\n STRING solo;\\n DO\\n getf(beetlef, ($g$, solo));\\n out+:=solo;\\n getf(beetlef, ($x$)) # skip CHAR separator #\\n OD;\\n except logical file end:\\n SKIP;\\n out\\n );\\n\\n STRING beetles := \\\"John Lennon, Paul McCartney, George Harrison, Ringo Starr\\\";\\n\\n printf(($g\\\".\\\"$, string split(beetles, \\\", \\\"),$l$));\\n printf(($g\\\".\\\"$, char split(beetles, \\\", \\\"),$l$))\\n)\\n\",\n \"language\": \"ALGOL-68\"\n },\n {\n \"code\": \"#include <hopper.h>\\n\\n#proto splitdate(_DATETIME_)\\n#proto splitnumber(_N_)\\n#proto split(_S_,_T_)\\n\\nmain:\\n\\n s=\\\"this string will be separated into parts with space token separator\\\"\\n\\n aS=0,let( aS :=_split(s,\\\" \\\"))\\n\\n {\\\",\\\"}toksep // set a new token separator\\n {\\\"String: \\\",s}\\n {\\\"\\\\nArray:\\\\n\\\",aS},\\n {\\\"\\\\nSize=\\\"}size(aS),println // \\\"size\\\" return an array: {dims,#rows,#cols,#pages}\\n\\n {\\\"\\\\nOriginal number: \\\",-125.489922},println\\n w=0,let(w:=_split number(-125.489922) )\\n {\\\"Integer part: \\\"}[1]get(w) // get first element from array \\\"w\\\"\\n {\\\"\\\\nDecimal part: \\\"}[2]get(w),println // get second element from array \\\"w\\\"\\n\\n {\\\"\\\\nDate by DATENOW(TODAY) macro: \\\"},print\\n dt=0, let( dt :=_splitdate(datenow(TODAY);!puts)) // \\\"!\\\" keep first element from stack\\n {\\\"\\\\nDate: \\\"}[1]get(dt)\\n {\\\"\\\\nTime: \\\"}[2]get(dt),println\\n\\nexit(0)\\n\\n.locals\\nsplitdate(_DATETIME_)\\n _SEP_=0,gettoksep,mov(_SEP_) // \\\"gettoksep\\\" return actual token separator\\n {\\\",\\\"}toksep, // set a new token separator\\n _NEWARRAY_={}\\n {1},$( _DATETIME_ ),\\n {2},$( _DATETIME_ ),pushall(_NEWARRAY_)\\n {_SEP_}toksep // restore ols token separator\\n {_NEWARRAY_}\\nback\\n\\nsplitnumber(_X_)\\n part_int=0,part_dec=0,\\n {_X_},!trunc,mov(part_int),\\n minus(part_int), !sign,mul\\n xtostr,mov(part_dec), part_dec+=2, // \\\"part_dec+=2\\\", delete \\\"0.\\\" from \\\"part_dec\\\"\\n {part_dec}xtonum,mov(part_dec)\\n _NEWARRAY_={},{part_int,part_dec},pushall(_NEWARRAY_)\\n {_NEWARRAY_}\\nback\\n\\nsplit(_S_,_T_)\\n _NEWARRAY_={},_VAR1_=0,_SEP_=0,gettoksep,mov(_SEP_)\\n {_T_}toksep,totaltoken(_S_),\\n mov(_VAR1_), // for total tokens\\n _VAR2_=1, // for real position of tokens into the string\\n ___SPLIT_ITER:\\n {_VAR2_}$( _S_ ),push(_NEWARRAY_)\\n ++_VAR2_,--_VAR1_\\n { _VAR1_ },jnz(___SPLIT_ITER) // jump to \\\"___SPLIT_ITER\\\" if \\\"_VAR1_\\\" is not zero.\\n clear(_VAR2_),clear(_VAR1_)\\n {_SEP_}toksep\\n {_NEWARRAY_}\\nback\\n\",\n \"language\": \"Amazing-Hopper\"\n },\n {\n \"code\": \" '.',⍨¨ ','(≠⊆⊢)'abc,123,X' ⍝ [1] Do the split: ','(≠⊆⊢)'abc,123,X'; [2] append the periods: '.',⍨¨\\n abc. 123. X. ⍝ 3 strings (char vectors), each with a period at the end.\\n\",\n \"language\": \"APL\"\n },\n {\n \"code\": \"on run\\n intercalate(\\\".\\\", splitOn(\\\",\\\", \\\"Hello,How,Are,You,Today\\\"))\\nend run\\n\\n\\n-- splitOn :: String -> String -> [String]\\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-- intercalate :: String -> [String] -> String\\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 \"language\": \"AppleScript\"\n },\n {\n \"code\": \"set my text item delimiters to \\\",\\\"\\nset tokens to the text items of \\\"Hello,How,Are,You,Today\\\"\\n\\nset my text item delimiters to \\\".\\\"\\nlog tokens as text\\n\",\n \"language\": \"AppleScript\"\n },\n {\n \"code\": \"100 T$ = \\\"HELLO,HOW,ARE,YOU,TODAY\\\"\\n110 GOSUB 200\\\"TOKENIZE\\n120 FOR I = 1 TO N\\n130 PRINT A$(I) \\\".\\\" ;\\n140 NEXT\\n150 PRINT\\n160 END\\n\\n200 IF N = 0 THEN DIM A$(256)\\n210 N = 1\\n220 A$(N) = \\\"\\n230 FOR TI = 1 TO LEN(T$)\\n240 C$ = MID$(T$, TI, 1)\\n250 T = C$ = \\\",\\\"\\n260 IF T THEN C$ = \\\"\\n270 N = N + T\\n280 IF T THEN A$(N) = C$\\n290 A$(N) = A$(N) + C$\\n300 NEXT TI\\n310 RETURN\\n\",\n \"language\": \"Applesoft-BASIC\"\n },\n {\n \"code\": \"/* ARM assembly Raspberry PI */\\n/* program strTokenize.s */\\n\\n/* Constantes */\\n.equ STDOUT, 1 @ Linux output console\\n.equ EXIT, 1 @ Linux syscall\\n.equ WRITE, 4 @ Linux syscall\\n\\n.equ NBPOSTESECLAT, 20\\n\\n/* Initialized data */\\n.data\\nszMessFinal: .asciz \\\"Words are : \\\\n\\\"\\n\\nszString: .asciz \\\"Hello,How,Are,You,Today\\\"\\nszMessError: .asciz \\\"Error tokenize !!\\\\n\\\"\\nszCarriageReturn: .asciz \\\"\\\\n\\\"\\n\\n/* UnInitialized data */\\n.bss\\n\\n/* code section */\\n.text\\n.global main\\nmain:\\n ldr r0,iAdrszString @ string address\\n mov r1,#',' @ separator\\n bl stTokenize\\n cmp r0,#-1 @ error ?\\n beq 99f\\n mov r2,r0 @ table address\\n ldr r0,iAdrszMessFinal @ display message\\n bl affichageMess\\n ldr r4,[r2] @ number of areas\\n add r2,#4 @ first area\\n mov r3,#0 @ loop counter\\n1: @ display loop\\n ldr r0,[r2,r3, lsl #2] @ address area\\n bl affichageMess\\n ldr r0,iAdrszCarriageReturn @ display carriage return\\n bl affichageMess\\n add r3,#1 @ counter + 1\\n cmp r3,r4 @ end ?\\n blt 1b @ no -> loop\\n\\n b 100f\\n99: @ display error message\\n ldr r0,iAdrszMessError\\n bl affichageMess\\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\\niAdrszString: .int szString\\niAdrszFinalString: .int szFinalString\\niAdrszMessFinal: .int szMessFinal\\niAdrszMessError: .int szMessError\\niAdrszCarriageReturn: .int szCarriageReturn\\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 systeme\\n pop {r0,r1,r2,r7,lr} @ restaur des 2 registres\\n bx lr @ return\\n/*******************************************************************/\\t\\n/* Separate string by separator into an array */\\n/* areas are store on the heap Linux */\\n/*******************************************************************/\\t\\n/* r0 contains string address */\\n/* r1 contains separator character (, or . or : ) */\\n/* r0 returns table address with first item = number areas */\\n/* and other items contains pointer of each string */\\nstTokenize:\\n push {r1-r8,lr} @ save des registres\\n mov r6,r0\\n mov r8,r1 @ save separator\\n bl strLength @ length string for place reservation on the heap\\n mov r4,r0\\n ldr r5,iTailleTable\\n add r5,r0\\n and r5,#0xFFFFFFFC\\n add r5,#4 @ align word on the heap\\n @ place reservation on the heap\\n mov r0,#0 @ heap address\\n mov r7, #0x2D @ call system linux 'brk'\\n svc #0 @ call system\\n cmp r0,#-1 @ error call system\\n beq 100f\\n mov r3,r0 @ save address heap begin\\n add r0,r5 @ reserve r5 byte on the heap\\n mov r7, #0x2D @ call system linux 'brk'\\n svc #0\\n cmp r0,#-1\\n beq 100f\\n @ string copy on the heap\\n mov r0,r6\\n mov r1,r3\\n1: @ loop copy string\\n ldrb r2,[r0],#1 @ read one byte and increment pointer one byte\\n strb r2,[r1],#1 @ store one byte and increment pointer one byte\\n cmp r2,#0 @ end of string ?\\n bne 1b @ no -> loop\\n\\n add r4,r3 @ r4 contains address table begin\\n mov r0,#0\\n str r0,[r4]\\n str r3,[r4,#4]\\n mov r2,#1 @ areas counter\\n2: @ loop load string character\\n ldrb r0,[r3]\\n cmp r0,#0\\n beq 3f @ end string\\n cmp r0,r8 @ separator ?\\n addne r3,#1 @ no -> next location\\n bne 2b @ and loop\\n mov r0,#0 @ store zero final of string\\n strb r0,[r3]\\n add r3,#1 @ next character\\n add r2,#1 @ areas counter + 1\\n str r3,[r4,r2, lsl #2] @ store address area in the table at index r2\\n b 2b @ and loop\\n\\n3:\\n str r2,[r4] @ returns number areas\\n mov r0,r4\\n100:\\n pop {r1-r8,lr}\\n bx lr\\niTailleTable: .int 4 * NBPOSTESECLAT\\n/***************************************************/\\n/* calcul size string */\\n/***************************************************/\\n/* r0 string address */\\n/* r0 returns size string */\\nstrLength:\\n push {r1,r2,lr}\\n mov r1,#0 @ init counter\\n1:\\n ldrb r2,[r0,r1] @ load byte of string index r1\\n cmp r2,#0 @ end string ?\\n addne r1,#1 @ no -> +1 counter\\n bne 1b @ and loop\\n\\n100:\\n mov r0,r1\\n pop {r1,r2,lr}\\n bx lr\\n\",\n \"language\": \"ARM-Assembly\"\n },\n {\n \"code\": \"str: \\\"Hello,How,Are,You,Today\\\"\\n\\nprint join.with:\\\".\\\" split.by:\\\",\\\" str\\n\",\n \"language\": \"Arturo\"\n },\n {\n \"code\": \"let text = 'Hello,How,Are,You,Today'\\nlet tokens = text.split(||,||)\\nprint tokens.join(with: '.')\\n\",\n \"language\": \"Astro\"\n },\n {\n \"code\": \"string := \\\"Hello,How,Are,You,Today\\\"\\nstringsplit, string, string, `,\\nloop, % string0\\n{\\nmsgbox % string%A_Index%\\n}\\n\",\n \"language\": \"AutoHotkey\"\n },\n {\n \"code\": \"BEGIN {\\n s = \\\"Hello,How,Are,You,Today\\\"\\n split(s, arr, \\\",\\\")\\n for(i=1; i < length(arr); i++) {\\n printf arr[i] \\\".\\\"\\n }\\n print\\n}\\n\",\n \"language\": \"AWK\"\n },\n {\n \"code\": \"BEGIN { FS = \\\",\\\" }\\n{\\n for(i=1; i <= NF; i++) printf $i \\\".\\\";\\n print \\\"\\\"\\n}\\n\",\n \"language\": \"AWK\"\n },\n {\n \"code\": \"OPTION BASE 1\\n\\nstring$ = \\\"Hello,How,Are,You,Today\\\"\\n\\n' Tokenize a string into an array\\nSPLIT string$ BY \\\",\\\" TO array$\\n\\n' Print array elements with new delimiter\\nPRINT COIL$(i, UBOUND(array$), array$[i], \\\".\\\")\\n\\n' Or simply replace the delimiter\\nPRINT DELIM$(string$, \\\",\\\", \\\".\\\")\\n\",\n \"language\": \"BaCon\"\n },\n {\n \"code\": \"instring$ = \\\"Hello,How,Are,You,Today\\\"\\n\\ntokens$ = explode(instring$,\\\",\\\")\\nfor i = 0 to tokens$[?]-1\\n\\tprint tokens$[i]; \\\".\\\";\\nnext i\\nend\\n\",\n \"language\": \"BASIC256\"\n },\n {\n \"code\": \"@echo off\\nsetlocal enabledelayedexpansion\\ncall :tokenize %1 res\\necho %res%\\ngoto :eof\\n\\n:tokenize\\nset str=%~1\\n:loop\\nfor %%i in (%str%) do set %2=!%2!.%%i\\nset %2=!%2:~1!\\ngoto :eof\\n\",\n \"language\": \"Batch-File\"\n },\n {\n \"code\": \" INSTALL @lib$+\\\"STRINGLIB\\\"\\n\\n text$ = \\\"Hello,How,Are,You,Today\\\"\\n n% = FN_split(text$, \\\",\\\", array$())\\n FOR i% = 0 TO n%-1\\n PRINT array$(i%) \\\".\\\" ;\\n NEXT\\n PRINT\\n\",\n \"language\": \"BBC-BASIC\"\n },\n {\n \"code\": \"Split ← (+`׬)⊸-∘= ⊔ ⊢\\n\\n∾⟜'.'⊸∾´ ',' Split \\\"Hello,How,Are,You,Today\\\"\\n\",\n \"language\": \"BQN\"\n },\n {\n \"code\": \"( \\\"Hello,How,Are,You,Today\\\":?String\\n& :?ReverseList\\n& whl\\n ' ( @(!String:?element \\\",\\\" ?String)\\n & !element !ReverseList:?ReverseList\\n )\\n& !String:?List\\n& whl\\n ' ( !ReverseList:%?element ?ReverseList\\n & (!element.!List):?List\\n )\\n& out$!List\\n)\\n\",\n \"language\": \"Bracmat\"\n },\n {\n \"code\": \"( get$(\\\"Hello,How,Are,You,Today\\\",MEM):?CommaseparatedList\\n& :?ReverseList\\n& whl\\n ' ( !CommaseparatedList:(?element,?CommaseparatedList)\\n & !element !ReverseList:?ReverseList\\n )\\n& !CommaseparatedList:?List\\n& whl\\n ' ( !ReverseList:%?element ?ReverseList\\n & (!element.!List):?List\\n )\\n& out$!List\\n)\\n\",\n \"language\": \"Bracmat\"\n },\n {\n \"code\": \"#include<string.h>\\n#include<stdio.h>\\n#include<stdlib.h>\\n\\nint main(void)\\n{\\n\\tchar *a[5];\\n\\tconst char *s=\\\"Hello,How,Are,You,Today\\\";\\n\\tint n=0, nn;\\n\\n\\tchar *ds=strdup(s);\\n\\n\\ta[n]=strtok(ds, \\\",\\\");\\n\\twhile(a[n] && n<4) a[++n]=strtok(NULL, \\\",\\\");\\n\\n\\tfor(nn=0; nn<=n; ++nn) printf(\\\"%s.\\\", a[nn]);\\n\\tputchar('\\\\n');\\n\\n\\tfree(ds);\\n\\n\\treturn 0;\\n}\\n\",\n \"language\": \"C\"\n },\n {\n \"code\": \"#include<stdio.h>\\n\\ntypedef void (*callbackfunc)(const char *);\\n\\nvoid doprint(const char *s) {\\n\\tprintf(\\\"%s.\\\", s);\\n}\\n\\nvoid tokenize(char *s, char delim, callbackfunc cb) {\\n\\tchar *olds = s;\\n\\tchar olddelim = delim;\\n\\twhile(olddelim && *s) {\\n\\t\\twhile(*s && (delim != *s)) s++;\\n\\t\\t*s ^= olddelim = *s; // olddelim = *s; *s = 0;\\n\\t\\tcb(olds);\\n\\t\\t*s++ ^= olddelim; // *s = olddelim; s++;\\n\\t\\tolds = s;\\n\\t}\\n}\\n\\nint main(void)\\n{\\n char array[] = \\\"Hello,How,Are,You,Today\\\";\\n\\ttokenize(array, ',', doprint);\\n\\treturn 0;\\n}\\n\",\n \"language\": \"C\"\n },\n {\n \"code\": \"#include <string>\\n#include <sstream>\\n#include <vector>\\n#include <iterator>\\n#include <iostream>\\n#include <algorithm>\\nint main()\\n{\\n std::string s = \\\"Hello,How,Are,You,Today\\\";\\n std::vector<std::string> v;\\n std::istringstream buf(s);\\n for(std::string token; getline(buf, token, ','); )\\n v.push_back(token);\\n copy(v.begin(), v.end(), std::ostream_iterator<std::string>(std::cout, \\\".\\\"));\\n std::cout << '\\\\n';\\n}\\n\",\n \"language\": \"C++\"\n },\n {\n \"code\": \"#include <string>\\n#include <locale>\\n#include <sstream>\\n#include <vector>\\n#include <iterator>\\n#include <iostream>\\n#include <algorithm>\\nstruct comma_ws : std::ctype<char> {\\n static const mask* make_table() {\\n static std::vector<mask> v(classic_table(), classic_table() + table_size);\\n v[','] |= space; // comma will be classified as whitespace\\n return &v[0];\\n }\\n comma_ws(std::size_t refs = 0) : ctype<char>(make_table(), false, refs) {}\\n};\\nint main()\\n{\\n std::string s = \\\"Hello,How,Are,You,Today\\\";\\n std::istringstream buf(s);\\n buf.imbue(std::locale(buf.getloc(), new comma_ws));\\n std::istream_iterator<std::string> beg(buf), end;\\n std::vector<std::string> v(beg, end);\\n copy(v.begin(), v.end(), std::ostream_iterator<std::string>(std::cout, \\\".\\\"));\\n std::cout << '\\\\n';\\n}\\n\",\n \"language\": \"C++\"\n },\n {\n \"code\": \"#include <string>\\n#include <vector>\\n#include <iterator>\\n#include <algorithm>\\n#include <iostream>\\n#include <boost/tokenizer.hpp>\\nint main()\\n{\\n std::string s = \\\"Hello,How,Are,You,Today\\\";\\n boost::tokenizer<> tok(s);\\n std::vector<std::string> v(tok.begin(), tok.end());\\n copy(v.begin(), v.end(), std::ostream_iterator<std::string>(std::cout, \\\".\\\"))\\n std::cout << '\\\\n';\\n}\\n\",\n \"language\": \"C++\"\n },\n {\n \"code\": \"#include <string>\\n#include <ranges>\\n#include <iostream>\\nint main() {\\n std::string s = \\\"Hello,How,Are,You,Today\\\";\\n s = s // Assign the final string back to the string variable\\n | std::views::split(',') // Produce a range of the comma separated words\\n | std::views::join_with('.') // Concatenate the words into a single range of characters\\n | std::ranges::to<std::string>(); // Convert the range of characters into a regular string\\n std::cout << s;\\n}\\n\",\n \"language\": \"C++\"\n },\n {\n \"code\": \"string str = \\\"Hello,How,Are,You,Today\\\";\\n// or Regex.Split ( \\\"Hello,How,Are,You,Today\\\", \\\",\\\" );\\n// (Regex is in System.Text.RegularExpressions namespace)\\nstring[] strings = str.Split(',');\\nConsole.WriteLine(String.Join(\\\".\\\", strings));\\n\",\n \"language\": \"C-sharp\"\n },\n {\n \"code\": \"shared void tokenizeAString() {\\n\\tvalue input = \\\"Hello,How,Are,You,Today\\\";\\n\\tvalue tokens = input.split(','.equals);\\n\\tprint(\\\".\\\".join(tokens));\\n}\\n\",\n \"language\": \"Ceylon\"\n },\n {\n \"code\": \"bundle agent main\\n{\\n reports:\\n \\\"${with}\\\" with => join(\\\".\\\", splitstring(\\\"Hello,How,Are,You,Today\\\", \\\",\\\", 99));\\n}\\n\",\n \"language\": \"CFEngine\"\n },\n {\n \"code\": \"(apply str (interpose \\\".\\\" (.split #\\\",\\\" \\\"Hello,How,Are,You,Today\\\")))\\n\",\n \"language\": \"Clojure\"\n },\n {\n \"code\": \"(clojure.string/join \\\".\\\" (clojure.string/split \\\"Hello,How,Are,You,Today\\\" #\\\",\\\"))\\n\",\n \"language\": \"Clojure\"\n },\n {\n \"code\": \"% This iterator splits the string on a given character,\\n% and returns each substring in order.\\ntokenize = iter (s: string, c: char) yields (string)\\n while ~string$empty(s) do\\n next: int := string$indexc(c, s)\\n if next = 0 then\\n yield(s)\\n break\\n else\\n yield(string$substr(s, 1, next-1))\\n s := string$rest(s, next+1)\\n end\\n end\\nend tokenize\\n\\nstart_up = proc ()\\n po: stream := stream$primary_output()\\n str: string := \\\"Hello,How,Are,You,Today\\\"\\n\\n for part: string in tokenize(str, ',') do\\n stream$putl(po, part || \\\".\\\")\\n end\\nend start_up\\n\",\n \"language\": \"CLU\"\n },\n {\n \"code\": \" identification division.\\n program-id. tokenize.\\n\\n environment division.\\n configuration section.\\n repository.\\n function all intrinsic.\\n\\n data division.\\n working-storage section.\\n 01 period constant as \\\".\\\".\\n 01 cmma constant as \\\",\\\".\\n\\n 01 start-with.\\n 05 value \\\"Hello,How,Are,You,Today\\\".\\n\\n 01 items.\\n 05 item pic x(6) occurs 5 times.\\n\\n procedure division.\\n tokenize-main.\\n unstring start-with delimited by cmma\\n into item(1) item(2) item(3) item(4) item(5)\\n\\n display trim(item(1)) period trim(item(2)) period\\n trim(item(3)) period trim(item(4)) period\\n trim(item(5))\\n\\n goback.\\n end program tokenize.\\n\",\n \"language\": \"COBOL\"\n },\n {\n \"code\": \"arr = \\\"Hello,How,Are,You,Today\\\".split \\\",\\\"\\nconsole.log arr.join \\\".\\\"\\n\",\n \"language\": \"CoffeeScript\"\n },\n {\n \"code\": \"<cfoutput>\\n <cfset wordListTag = \\\"Hello,How,Are,You,Today\\\">\\n #Replace( wordListTag, \\\",\\\", \\\".\\\", \\\"all\\\" )#\\n</cfoutput>\\n\",\n \"language\": \"ColdFusion\"\n },\n {\n \"code\": \"<cfscript>\\n wordList = \\\"Hello,How,Are,You,Today\\\";\\n splitList = replace( wordList, \\\",\\\", \\\".\\\", \\\"all\\\" );\\n writeOutput( splitList );\\n</cfscript>\\n\",\n \"language\": \"ColdFusion\"\n },\n {\n \"code\": \"10 REM TOKENIZE A STRING ... ROSETTACODE.ORG\\n20 T$ = \\\"HELLO,HOW,ARE,YOU,TODAY\\\"\\n30 GOSUB 200, TOKENIZE\\n40 FOR I = 1 TO N\\n50 PRINT A$(I) \\\".\\\" ;\\n60 NEXT\\n70 PRINT\\n80 END\\n200 IF N = 0 THEN DIM A$(256)\\n210 N = 1\\n220 A$(N) = \\\"\\\"\\n230 FOR L = 1 TO LEN(T$)\\n240 C$ = MID$(T$, L, 1)\\n250 IF C$<>\\\",\\\" THEN A$(N) = A$(N) + C$: GOTO 270\\n260 N = N + 1\\n270 NEXT L\\n280 RETURN\\n\",\n \"language\": \"Commodore-BASIC\"\n },\n {\n \"code\": \"(defun comma-split (string)\\n (loop for start = 0 then (1+ finish)\\n for finish = (position #\\\\, string :start start)\\n collecting (subseq string start finish)\\n until (null finish)))\\n\\n(defun write-with-periods (strings)\\n (format t \\\"~{~A~^.~}\\\" strings))\\n\",\n \"language\": \"Common-Lisp\"\n },\n {\n \"code\": \"include \\\"cowgol.coh\\\";\\ninclude \\\"strings.coh\\\";\\n\\n# Tokenize a string. Note: the string is modified in place.\\nsub tokenize(sep: uint8, str: [uint8], out: [[uint8]]): (length: intptr) is\\n length := 0;\\n loop\\n [out] := str;\\n out := @next out;\\n length := length + 1;\\n while [str] != 0 and [str] != sep loop\\n str := @next str;\\n end loop;\\n if [str] == sep then\\n [str] := 0;\\n str := @next str;\\n else\\n break;\\n end if;\\n end loop;\\nend sub;\\n\\n# The string\\nvar string: [uint8] := \\\"Hello,How,Are,You,Today\\\";\\n\\n# Make a mutable copy\\nvar buf: uint8[64];\\nCopyString(string, &buf[0]);\\n\\n# Tokenize the copy\\nvar parts: [uint8][64];\\nvar length := tokenize(',', &buf[0], &parts[0]) as @indexof parts;\\n\\n# Print each string\\nvar i: @indexof parts := 0;\\nwhile i < length loop\\n print(parts[i]);\\n print(\\\".\\\\n\\\");\\n i := i + 1;\\nend loop;\\n\",\n \"language\": \"Cowgol\"\n },\n {\n \"code\": \"puts \\\"Hello,How,Are,You,Today\\\".split(',').join('.')\\n\",\n \"language\": \"Crystal\"\n },\n {\n \"code\": \"void main() {\\n import std.stdio, std.string;\\n\\n \\\"Hello,How,Are,You,Today\\\".split(',').join('.').writeln;\\n}\\n\",\n \"language\": \"D\"\n },\n {\n \"code\": \"program Tokenize_a_string;\\n\\n{$APPTYPE CONSOLE}\\n\\nuses\\n System.SysUtils;\\n\\nvar\\n Words: TArray<string>;\\n\\nbegin\\n Words := 'Hello,How,Are,You,Today'.Split([',']);\\n Writeln(string.Join(#10, Words));\\n\\n Readln;\\nend.\\n\",\n \"language\": \"Delphi\"\n },\n {\n \"code\": \"program TokenizeString;\\n\\n{$APPTYPE CONSOLE}\\n\\nuses\\n Classes;\\n\\nvar\\n tmp: TStringList;\\n i: Integer;\\n\\nbegin\\n\\n // Instantiate TStringList class\\n tmp := TStringList.Create;\\n try\\n { Use the TStringList's CommaText property to get/set\\n all the strings in a single comma-delimited string }\\n tmp.CommaText := 'Hello,How,Are,You,Today';\\n\\n { Now loop through the TStringList and display each\\n token on the console }\\n for i := 0 to Pred(tmp.Count) do\\n Writeln(tmp[i]);\\n\\n finally\\n tmp.Free;\\n end;\\n\\n Readln;\\n\\nend.\\n\",\n \"language\": \"Delphi\"\n },\n {\n \"code\": \"Hello\\nHow\\nAre\\nYou\\nToday\\n\",\n \"language\": \"Delphi\"\n },\n {\n \"code\": \"\\\"Hello,How,Are,You,Today\\\" \\\",\\\" split \\\".\\\" join pl\\n\",\n \"language\": \"Dt\"\n },\n {\n \"code\": \"var str = \\\"Hello,How,Are,You,Today\\\"\\nvar strings = str.Split(',')\\nprint(values: strings, separator: \\\".\\\")\\n\",\n \"language\": \"Dyalect\"\n },\n {\n \"code\": \"\\\".\\\".rjoin(\\\"Hello,How,Are,You,Today\\\".split(\\\",\\\"))\\n\",\n \"language\": \"E\"\n },\n {\n \"code\": \"s$ = \\\"Hello,How,Are,You,Today\\\"\\na$[] = strsplit s$ \\\",\\\"\\nfor s$ in a$[]\\n write s$ & \\\".\\\"\\n.\\n\",\n \"language\": \"EasyLang\"\n },\n {\n \"code\": \"import system'routines;\\nimport extensions;\\n\\npublic program()\\n{\\n auto string := \\\"Hello,How,Are,You,Today\\\";\\n\\n string.splitBy(\\\",\\\").forEach::(s)\\n {\\n console.print(s,\\\".\\\")\\n }\\n}\\n\",\n \"language\": \"Elena\"\n },\n {\n \"code\": \"tokens = String.split(\\\"Hello,How,Are,You,Today\\\", \\\",\\\")\\nIO.puts Enum.join(tokens, \\\".\\\")\\n\",\n \"language\": \"Elixir\"\n },\n {\n \"code\": \"text value = \\\"Hello,How,Are,You,Today\\\"\\nList tokens = value.split(\\\",\\\")\\nwriteLine(tokens.join(\\\".\\\"))\\n# single line version\\nwriteLine(\\\"Hello,How,Are,You,Today\\\".split(\\\",\\\").join(\\\".\\\"))\\n\",\n \"language\": \"EMal\"\n },\n {\n \"code\": \"-module(tok).\\n-export([start/0]).\\n\\nstart() ->\\n Lst = string:tokens(\\\"Hello,How,Are,You,Today\\\",\\\",\\\"),\\n io:fwrite(\\\"~s~n\\\", [string:join(Lst,\\\".\\\")]),\\n ok.\\n\",\n \"language\": \"Erlang\"\n },\n {\n \"code\": \"function split(sequence s, integer c)\\n sequence out\\n integer first, delim\\n out = {}\\n first = 1\\n while first<=length(s) do\\n delim = find_from(c,s,first)\\n if delim = 0 then\\n delim = length(s)+1\\n end if\\n out = append(out,s[first..delim-1])\\n first = delim + 1\\n end while\\n return out\\nend function\\n\\nsequence s\\ns = split(\\\"Hello,How,Are,You,Today\\\", ',')\\n\\nfor i = 1 to length(s) do\\n puts(1, s[i] & ',')\\nend for\\n\",\n \"language\": \"Euphoria\"\n },\n {\n \"code\": \"System.String.Join(\\\".\\\", \\\"Hello,How,Are,You,Today\\\".Split(','))\\n\",\n \"language\": \"F-Sharp\"\n },\n {\n \"code\": \"\\\"Hello,How,Are,You,Today\\\" \\\",\\\" split \\\".\\\" join print\\n\",\n \"language\": \"Factor\"\n },\n {\n \"code\": \"/* created by Aykayayciti Earl Lamont Montgomery\\nApril 9th, 2018 */\\n\\na = []\\na = strSplit(\\\"Hello,How,Are,You,Today\\\", \\\",\\\")\\nindex = 0\\nstart = 0\\nb = \\\"\\\"\\nfor index in [ start : len(a)-1 : 1 ]\\n\\tb = b + a[index] + \\\".\\\"\\nend\\n\\n> b\\n\",\n \"language\": \"Falcon\"\n },\n {\n \"code\": \"class Main\\n{\\n public static Void main ()\\n {\\n str := \\\"Hello,How,Are,You,Today\\\"\\n words := str.split(',')\\n words.each |Str word|\\n {\\n echo (\\\"${word}. \\\")\\n }\\n }\\n}\\n\",\n \"language\": \"Fantom\"\n },\n {\n \"code\": \"(fn string.split [self sep]\\n (let [pattern (string.format \\\"([^%s]+)\\\" sep)\\n fields {}]\\n (self:gsub pattern (fn [c] (tset fields (+ 1 (length fields)) c)))\\n fields))\\n\\n(let [str \\\"Hello,How,Are,You,Today\\\"]\\n (print (table.concat (str:split \\\",\\\") \\\".\\\")))\\n\",\n \"language\": \"Fennel\"\n },\n {\n \"code\": \": split ( str len separator len -- tokens count )\\n here >r 2swap\\n begin\\n 2dup 2, \\\\ save this token ( addr len )\\n 2over search \\\\ find next separator\\n while\\n dup negate here 2 cells - +! \\\\ adjust last token length\\n 2over nip /string \\\\ start next search past separator\\n repeat\\n 2drop 2drop\\n r> here over - ( tokens length )\\n dup negate allot \\\\ reclaim dictionary\\n 2 cells / ; \\\\ turn byte length into token count\\n\\n: .tokens ( tokens count -- )\\n 1 ?do dup 2@ type .\\\" .\\\" cell+ cell+ loop 2@ type ;\\n\\ns\\\" Hello,How,Are,You,Today\\\" s\\\" ,\\\" split .tokens \\\\ Hello.How.Are.You.Today\\n\",\n \"language\": \"Forth\"\n },\n {\n \"code\": \"PROGRAM Example\\n\\n CHARACTER(23) :: str = \\\"Hello,How,Are,You,Today\\\"\\n CHARACTER(5) :: word(5)\\n INTEGER :: pos1 = 1, pos2, n = 0, i\\n\\n DO\\n pos2 = INDEX(str(pos1:), \\\",\\\")\\n IF (pos2 == 0) THEN\\n n = n + 1\\n word(n) = str(pos1:)\\n EXIT\\n END IF\\n n = n + 1\\n word(n) = str(pos1:pos1+pos2-2)\\n pos1 = pos2+pos1\\n END DO\\n\\n DO i = 1, n\\n WRITE(*,\\\"(2A)\\\", ADVANCE=\\\"NO\\\") TRIM(word(i)), \\\".\\\"\\n END DO\\n\\nEND PROGRAM Example\\n\",\n \"language\": \"Fortran\"\n },\n {\n \"code\": \"sub tokenize( instring as string, tokens() as string, sep as string )\\n redim tokens(0 to 0) as string\\n dim as string*1 ch\\n dim as uinteger t=0\\n for i as uinteger = 1 to len(instring)\\n ch = mid(instring,i,1)\\n if ch = sep then\\n t = t + 1\\n redim preserve tokens(0 to t)\\n else\\n tokens(t) = tokens(t) + ch\\n end if\\n next i\\n return\\nend sub\\n\\ndim as string instring = \\\"Hello,How,Are,You,Today\\\"\\nredim as string tokens(-1)\\ntokenize( instring, tokens(), \\\",\\\" )\\nfor i as uinteger = 0 to ubound(tokens)\\n print tokens(i);\\\".\\\";\\nnext i\\n\",\n \"language\": \"FreeBASIC\"\n },\n {\n \"code\": \"println[join[\\\".\\\", split[\\\",\\\", \\\"Hello,How,Are,You,Today\\\"]]]\\n\",\n \"language\": \"Frink\"\n },\n {\n \"code\": \"window 1, @\\\"Tokenize a string\\\"\\n\\nvoid local fn DoIt\\n CFStringRef string = @\\\"Hello,How,Are,You,Today\\\"\\n CFArrayRef tokens = fn StringComponentsSeparatedByString( string, @\\\",\\\" )\\n print fn ArrayComponentsJoinedByString( tokens, @\\\".\\\" )\\nend fn\\n\\nfn DoIt\\n\\nHandleEvents\\n\",\n \"language\": \"FutureBasic\"\n },\n {\n \"code\": \"Public Sub Main()\\nDim sString As String[] = Split(\\\"Hello,How,Are,You,Today\\\")\\n\\nPrint sString.Join(\\\".\\\")\\n\\nEnd\\n\",\n \"language\": \"Gambas\"\n },\n {\n \"code\": \"SplitString(\\\"Hello,How,Are,You,Today\\\", \\\",\\\");\\n# [ \\\"Hello\\\", \\\"How\\\", \\\"Are\\\", \\\"You\\\", \\\"Today\\\" ]\\n\\nJoinStringsWithSeparator(last, \\\".\\\");\\n# \\\"Hello.How.Are.You.Today\\\"\\n\",\n \"language\": \"GAP\"\n },\n {\n \"code\": \"[indent=4]\\n\\ninit\\n str:string = \\\"Hello,How,Are,You,Today\\\"\\n words:array of string[] = str.split(\\\",\\\")\\n joined:string = string.joinv(\\\".\\\", words)\\n print joined\\n\",\n \"language\": \"Genie\"\n },\n {\n \"code\": \"package main\\n\\nimport (\\n \\\"fmt\\\"\\n \\\"strings\\\"\\n)\\n\\nfunc main() {\\n s := \\\"Hello,How,Are,You,Today\\\"\\n fmt.Println(strings.Join(strings.Split(s, \\\",\\\"), \\\".\\\"))\\n}\\n\",\n \"language\": \"Go\"\n },\n {\n \"code\": \"println 'Hello,How,Are,You,Today'.split(',').join('.')\\n\",\n \"language\": \"Groovy\"\n },\n {\n \"code\": \"{-# OPTIONS_GHC -XOverloadedStrings #-}\\nimport Data.Text (splitOn,intercalate)\\nimport qualified Data.Text.IO as T (putStrLn)\\n\\nmain = T.putStrLn . intercalate \\\".\\\" $ splitOn \\\",\\\" \\\"Hello,How,Are,You,Today\\\"\\n\",\n \"language\": \"Haskell\"\n },\n {\n \"code\": \"splitBy :: (a -> Bool) -> [a] -> [[a]]\\nsplitBy _ [] = []\\nsplitBy f list = first : splitBy f (dropWhile f rest) where\\n (first, rest) = break f list\\n\\nsplitRegex :: Regex -> String -> [String]\\n\\njoinWith :: [a] -> [[a]] -> [a]\\njoinWith d xs = concat $ List.intersperse d xs\\n-- \\\"concat $ intersperse\\\" can be replaced with \\\"intercalate\\\" from the Data.List in GHC 6.8 and later\\n\\nputStrLn $ joinWith \\\".\\\" $ splitBy (== ',') $ \\\"Hello,How,Are,You,Today\\\"\\n\\n-- using regular expression to split:\\nimport Text.Regex\\nputStrLn $ joinWith \\\".\\\" $ splitRegex (mkRegex \\\",\\\") $ \\\"Hello,How,Are,You,Today\\\"\\n\",\n \"language\": \"Haskell\"\n },\n {\n \"code\": \"*Main> mapM_ putStrLn $ takeWhile (not.null) $ unfoldr (Just . second(drop 1). break (==',')) \\\"Hello,How,Are,You,Today\\\"\\nHello\\nHow\\nAre\\nYou\\nToday\\n\",\n \"language\": \"Haskell\"\n },\n {\n \"code\": \"CHARACTER string=\\\"Hello,How,Are,You,Today\\\", list\\n\\nnWords = INDEX(string, ',', 256) + 1\\nmaxWordLength = LEN(string) - 2*nWords\\nALLOCATE(list, nWords*maxWordLength)\\n\\nDO i = 1, nWords\\n EDIT(Text=string, SePaRators=',', item=i, WordEnd, CoPyto=CHAR(i, maxWordLength, list))\\nENDDO\\n\\nDO i = 1, nWords\\n WRITE(APPend) TRIM(CHAR(i, maxWordLength, list)), '.'\\nENDDO\\n\",\n \"language\": \"HicEst\"\n },\n {\n \"code\": \"procedure main()\\n A := []\\n \\\"Hello,How,Are,You,Today\\\" ? {\\n while put(A, 1(tab(upto(',')),=\\\",\\\"))\\n put(A,tab(0))\\n }\\n every writes(!A,\\\".\\\")\\n write()\\nend\\n\",\n \"language\": \"Icon\"\n },\n {\n \"code\": \"import util\\n\\nprocedure main()\\n A := stringToList(\\\"Hello,How,Are,You,Today\\\", ',')\\n every writes(!A,\\\".\\\")\\n write()\\nend\\n\",\n \"language\": \"Icon\"\n },\n {\n \"code\": \"\\\"Hello,How,Are,You,Today\\\" split(\\\",\\\") join(\\\".\\\") println\\n\",\n \"language\": \"Io\"\n },\n {\n \"code\": \" s=: 'Hello,How,Are,You,Today'\\n ] t=: <;._1 ',',s\\n+-----+---+---+---+-----+\\n|Hello|How|Are|You|Today|\\n+-----+---+---+---+-----+\\n ; t,&.>'.'\\nHello.How.Are.You.Today.\\n\\n '.' (I.','=s)}s NB. two steps combined\\nHello.How.Are.You.Today\\n\",\n \"language\": \"J\"\n },\n {\n \"code\": \" require 'strings'\\n ',' splitstring s\\n+-----+---+---+---+-----+\\n|Hello|How|Are|You|Today|\\n+-----+---+---+---+-----+\\n\\n '.' joinstring ',' splitstring s\\nHello.How.Are.You.Today\\n\",\n \"language\": \"J\"\n },\n {\n \"code\": \" '\\\"'([ ,~ ,) '\\\",\\\"' joinstring ',' splitstring s\\n\\\"Hello\\\",\\\"How\\\",\\\"Are\\\",\\\"You\\\",\\\"Today\\\"\\n\",\n \"language\": \"J\"\n },\n {\n \"code\": \" rplc&',.' s\\nHello.How.Are.You.Today\\n\",\n \"language\": \"J\"\n },\n {\n \"code\": \" fn;._2 string,','\\n\",\n \"language\": \"J\"\n },\n {\n \"code\": \" fn ((;._2)(@(,&','))) string\\n\",\n \"language\": \"J\"\n },\n {\n \"code\": \"String toTokenize = \\\"Hello,How,Are,You,Today\\\";\\nSystem.out.println(String.join(\\\".\\\", toTokenize.split(\\\",\\\")));\\n\",\n \"language\": \"Java\"\n },\n {\n \"code\": \"String toTokenize = \\\"Hello,How,Are,You,Today\\\";\\n\\nString words[] = toTokenize.split(\\\",\\\");//splits on one comma, multiple commas yield multiple splits\\n //toTokenize.split(\\\",+\\\") if you want to ignore empty fields\\nfor(int i=0; i<words.length; i++) {\\n System.out.print(words[i] + \\\".\\\");\\n}\\n\",\n \"language\": \"Java\"\n },\n {\n \"code\": \"String toTokenize = \\\"Hello,How,Are,You,Today\\\";\\n\\nStringTokenizer tokenizer = new StringTokenizer(toTokenize, \\\",\\\");\\nwhile(tokenizer.hasMoreTokens()) {\\n System.out.print(tokenizer.nextToken() + \\\".\\\");\\n}\\n\",\n \"language\": \"Java\"\n },\n {\n \"code\": \"console.log(\\n \\\"Hello,How,Are,You,Today\\\"\\n .split(\\\",\\\")\\n .join(\\\".\\\")\\n);\\n\",\n \"language\": \"JavaScript\"\n },\n {\n \"code\": \"const Tokeniser = (function () {\\n\\tconst numberRegex = /-?(\\\\d+\\\\.d+|\\\\d+\\\\.|\\\\.\\\\d+|\\\\d+)((e|E)(\\\\+|-)?\\\\d+)?/g;\\n\\treturn {\\n\\t\\tsettings: {\\n\\t\\t\\toperators: [\\\"<\\\", \\\">\\\", \\\"=\\\", \\\"+\\\", \\\"-\\\", \\\"*\\\", \\\"/\\\", \\\"?\\\", \\\"!\\\"],\\n\\t\\t\\tseparators: [\\\",\\\", \\\".\\\", \\\";\\\", \\\":\\\", \\\" \\\", \\\"\\\\t\\\", \\\"\\\\n\\\"],\\n\\t\\t\\tgroupers: [\\\"(\\\", \\\")\\\", \\\"[\\\", \\\"]\\\", \\\"{\\\", \\\"}\\\", '\\\"', '\\\"', \\\"'\\\", \\\"'\\\"],\\n\\t\\t\\tkeepWhiteSpacesAsTokens: false,\\n\\t\\t\\ttrimTokens: true\\n\\t\\t},\\n\\t\\tisNumber: function (value) {\\n\\t\\t\\tif (typeof value === \\\"number\\\") {\\n\\t\\t\\t\\treturn true;\\n\\t\\t\\t} else if (typeof value === \\\"string\\\") {\\n\\t\\t\\t\\treturn numberRegex.test(value);\\n\\t\\t\\t}\\n\\t\\t\\treturn false;\\n\\t\\t},\\n\\t\\tcloseGrouper: function (grouper) {\\n\\t\\t\\tif (this.settings.groupers.includes(grouper)) {\\n\\t\\t\\t\\treturn this.settings.groupers[this.settings.groupers.indexOf(grouper) + 1];\\n\\t\\t\\t}\\n\\t\\t\\treturn null;\\n\\t\\t},\\n\\t\\ttokenType: function (char) {\\n\\t\\t\\tif (this.settings.operators.includes(char)) {\\n\\t\\t\\t\\treturn \\\"operator\\\";\\n\\t\\t\\t} else if (this.settings.separators.includes(char)) {\\n\\t\\t\\t\\treturn \\\"separator\\\";\\n\\t\\t\\t} else if (this.settings.groupers.includes(char)) {\\n\\t\\t\\t\\treturn \\\"grouper\\\";\\n\\t\\t\\t}\\n\\t\\t\\treturn \\\"other\\\";\\n\\t\\t},\\n\\t\\tparseString: function (str) {\\n\\t\\t\\tif (typeof str !== \\\"string\\\") {\\n\\t\\t\\t\\tif (str === null) {\\n\\t\\t\\t\\t\\treturn \\\"null\\\";\\n\\t\\t\\t\\t} if (typeof str === \\\"object\\\") {\\n\\t\\t\\t\\t\\tstr = JSON.stringify(str);\\n\\t\\t\\t\\t} else {\\n\\t\\t\\t\\t\\tstr = str.toString();\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\tlet tokens = [], _tempToken = \\\"\\\";\\n\\t\\t\\tfor (let i = 0; i < str.length; i++) {\\n\\t\\t\\t\\tif (this.tokenType(_tempToken) !== this.tokenType(str[i]) || this.tokenType(str[i]) === \\\"separator\\\") {\\n\\t\\t\\t\\t\\tif (_tempToken.trim() !== \\\"\\\") {\\n\\t\\t\\t\\t\\t\\ttokens.push(this.settings.trimTokens ? _tempToken.trim() : _tempToken);\\n\\t\\t\\t\\t\\t} else if (this.settings.keepWhiteSpacesAsTokens) {\\n\\t\\t\\t\\t\\t\\ttokens.push(_tempToken);\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t_tempToken = str[i];\\n\\t\\t\\t\\t\\tif (this.tokenType(_tempToken) === \\\"separator\\\") {\\n\\t\\t\\t\\t\\t\\tif (_tempToken.trim() !== \\\"\\\") {\\n\\t\\t\\t\\t\\t\\t\\ttokens.push(this.settings.trimTokens ? _tempToken.trim() : _tempToken);\\n\\t\\t\\t\\t\\t\\t} else if (this.settings.keepWhiteSpacesAsTokens) {\\n\\t\\t\\t\\t\\t\\t\\ttokens.push(_tempToken);\\n\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\t_tempToken = \\\"\\\";\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t} else {\\n\\t\\t\\t\\t\\t_tempToken += str[i];\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\tif (_tempToken.trim() !== \\\"\\\") {\\n\\t\\t\\t\\ttokens.push(this.settings.trimTokens ? _tempToken.trim() : _tempToken);\\n\\t\\t\\t} else if (this.settings.keepWhiteSpacesAsTokens) {\\n\\t\\t\\t\\ttokens.push(_tempToken);\\n\\t\\t\\t}\\n\\t\\t\\treturn tokens.filter((token) => token !== \\\"\\\");\\n\\t\\t}\\n\\t};\\n})();\\n\",\n \"language\": \"JavaScript\"\n },\n {\n \"code\": \"Tokeniser.parseString(\\\"Hello,How,Are,You,Today\\\");\\n\\n// -> ['Hello', ',', 'How', ',', 'Are', ',', 'You', ',', 'Today']\\n\",\n \"language\": \"JavaScript\"\n },\n {\n \"code\": \"split(\\\",\\\") | join(\\\".\\\")\\n\",\n \"language\": \"Jq\"\n },\n {\n \"code\": \"$ jq -r 'split(\\\",\\\") | join(\\\".\\\")'\\n\\\"Hello,How,Are,You,Today\\\"\\nHello.How.Are.You.Today\\n\",\n \"language\": \"Jq\"\n },\n {\n \"code\": \"puts('Hello,How,Are,You,Today'.split(',').join('.'))\\n\",\n \"language\": \"Jsish\"\n },\n {\n \"code\": \"s = \\\"Hello,How,Are,You,Today\\\"\\na = split(s, \\\",\\\")\\nt = join(a, \\\".\\\")\\n\\nprintln(\\\"The string \\\\\\\"\\\", s, \\\"\\\\\\\"\\\")\\nprintln(\\\"Splits into \\\", a)\\nprintln(\\\"Reconstitutes to \\\\\\\"\\\", t, \\\"\\\\\\\"\\\")\\n\",\n \"language\": \"Julia\"\n },\n {\n \"code\": \"words: \\\",\\\" \\\\: \\\"Hello,How,Are,You,Today\\\"\\n\\\".\\\" /: words\\n\",\n \"language\": \"K\"\n },\n {\n \"code\": \"\\\",\\\"\\\\\\\"Hello,How,Are,You,Today\\\"\\n(\\\"Hello\\\"\\n \\\"How\\\"\\n \\\"Are\\\"\\n \\\"You\\\"\\n \\\"Today\\\")\\n\",\n \"language\": \"K\"\n },\n {\n \"code\": \"( \\\"Hello,How,Are,You,Today\\\" \\\",\\\" ) split len [ get print \\\".\\\" print ] for\\n\\nnl \\\"End \\\" input\\n\",\n \"language\": \"Klingphix\"\n },\n {\n \"code\": \"fun main(args: Array<String>) {\\n val input = \\\"Hello,How,Are,You,Today\\\"\\n println(input.split(',').joinToString(\\\".\\\"))\\n}\\n\",\n \"language\": \"Kotlin\"\n },\n {\n \"code\": \"#!/bin/ksh\\n\\n# Tokenize a string\\n\\n#\\t# Variables:\\n#\\nstring=\\\"Hello,How,Are,You,Today\\\"\\ninputdelim=\\\\,\\t\\t# a comma\\noutputdelim=\\\\.\\t\\t# a period\\n\\n#\\t# Functions:\\n#\\n#\\t# Function _tokenize(str, indelim, outdelim)\\n#\\nfunction _tokenize {\\n\\ttypeset _str ; _str=\\\"$1\\\"\\n\\ttypeset _ind ; _ind=\\\"$2\\\"\\n\\ttypeset _outd ; _outd=\\\"$3\\\"\\n\\t\\n\\twhile [[ ${_str} != ${_str/${_ind}/${_outd}} ]]; do\\n\\t\\t_str=${_str/${_ind}/${_outd}}\\n\\tdone\\n\\n\\techo \\\"${_str}\\\"\\n}\\n\\n ######\\n# main #\\n ######\\n\\n _tokenize \\\"${string}\\\" \\\"${inputdelim}\\\" \\\"${outputdelim}\\\"\\n\",\n \"language\": \"Ksh\"\n },\n {\n \"code\": \"{S.replace , by . in Hello,How,Are,You,Today}.\\n-> Hello.How.Are.You.Today.\\n\",\n \"language\": \"Lambdatalk\"\n },\n {\n \"code\": \"$str = Hello,How,Are,You,Today\\nfn.println(fn.join(\\\\., fn.split($str, \\\\,)))\\n\",\n \"language\": \"Lang\"\n },\n {\n \"code\": \"'Hello,How,Are,You,Today ', split '. join .\\n\",\n \"language\": \"Lang5\"\n },\n {\n \"code\": \"DATA:\\nexplode/words is text vector\\nexplode/index is number\\nexplode/string is text\\nexplode/length is number\\nexplode/stringlength is number\\nexplode/current-token is text\\nexplode/char is text\\nexplode/separator is text\\ni is number\\n\\nPROCEDURE:\\n# Ask for a sentence\\ndisplay \\\"Enter a sentence: \\\"\\naccept explode/string\\n\\n# Declare explode Subprocedure\\n# Splits a text into a text vector by a certain delimiter\\n# Input parameters:\\n# - explode/string: the string to explode (destroyed)\\n# - explode/separator: the character used to separate the string (preserved)\\n# Output parameters:\\n# - explode/words: vector of splitted words\\n# - explode/length: length of explode/words\\nsub-procedure explode\\n join explode/string and explode/separator in explode/string\\n store length of explode/string in explode/stringlength\\n store 0 in explode/index\\n store 0 in explode/length\\n store \\\"\\\" in explode/current-token\\n while explode/index is less than explode/stringlength do\\n get character at explode/index from explode/string in explode/char\\n if explode/char is equal to explode/separator then\\n store explode/current-token in explode/words:explode/length\\n add explode/length and 1 in explode/length\\n store \\\"\\\" in explode/current-token\\n else\\n join explode/current-token and explode/char in explode/current-token\\n end if\\n add explode/index and 1 in explode/index\\n repeat\\n subtract 1 from explode/length in explode/length\\nend sub-procedure\\n\\n# Separate the entered string\\nstore \\\" \\\" in explode/separator\\ncall sub-procedure explode\\nwhile i is less than or equal to explode/length do\\n display explode/words:i crlf\\n add 1 and i in i\\nrepeat\\n\",\n \"language\": \"LDPL\"\n },\n {\n \"code\": \"> (set split (string:tokens \\\"Hello,How,Are,You,Today\\\" \\\",\\\"))\\n(\\\"Hello\\\" \\\"How\\\" \\\"Are\\\" \\\"You\\\" \\\"Today\\\")\\n> (string:join split \\\".\\\")\\n\\\"Hello.How.Are.You.Today\\\"\\n\",\n \"language\": \"LFE\"\n },\n {\n \"code\": \"'Note that Liberty Basic's array usage can reach element #10 before having to DIM the array\\nFor i = 0 To 4\\n array$(i) = Word$(\\\"Hello,How,Are,You,Today\\\", (i + 1), \\\",\\\")\\n array$ = array$ + array$(i) + \\\".\\\"\\nNext i\\n\\nPrint Left$(array$, (Len(array$) - 1))\\n\",\n \"language\": \"Liberty-BASIC\"\n },\n {\n \"code\": \"input = \\\"Hello,How,Are,You,Today\\\"\\n_player.itemDelimiter = \\\",\\\"\\noutput = \\\"\\\"\\nrepeat with i = 1 to input.item.count\\n put input.item[i]&\\\".\\\" after output\\nend repeat\\ndelete the last char of output\\nput output\\n-- \\\"Hello.How.Are.You.Today\\\"\\n\",\n \"language\": \"Lingo\"\n },\n {\n \"code\": \"to split :str :sep\\n output parse map [ifelse ? = :sep [\\\"| |] [?]] :str\\nend\\n\",\n \"language\": \"Logo\"\n },\n {\n \"code\": \"to split :str :by [:acc []] [:w \\\"||]\\n if empty? :str [output lput :w :acc]\\n ifelse equal? first :str :by ~\\n [output (split butfirst :str :by lput :w :acc)] ~\\n [output (split butfirst :str :by :acc lput first :str :w)]\\nend\\n\",\n \"language\": \"Logo\"\n },\n {\n \"code\": \"? show split \\\"Hello,How,Are,You,Today \\\",\\n[Hello How Are You Today]\\n\",\n \"language\": \"Logo\"\n },\n {\n \"code\": \":- object(spliting).\\n\\n :- public(convert/2).\\n :- mode(convert(+atom, -atom), one).\\n\\n convert(StringIn, StringOut) :-\\n atom_chars(StringIn, CharactersIn),\\n phrase(split(',', Tokens), CharactersIn),\\n phrase(split('.', Tokens), CharactersOut),\\n atom_chars(StringOut, CharactersOut).\\n\\n split(Separator, [t([Character| Characters])| Tokens]) -->\\n [Character], {Character \\\\== Separator}, split(Separator, [t(Characters)| Tokens]).\\n split(Separator, [t([])| Tokens]) -->\\n [Separator], split(Separator, Tokens).\\n split(_, [t([])]) -->\\n [].\\n % the look-ahead in the next rule prevents adding a spurious separator at the end\\n split(_, []), [Character] -->\\n [Character].\\n\\n:- end_object.\\n\",\n \"language\": \"Logtalk\"\n },\n {\n \"code\": \"function string:split (sep)\\n local sep, fields = sep or \\\":\\\", {}\\n local pattern = string.format(\\\"([^%s]+)\\\", sep)\\n self:gsub(pattern, function(c) fields[#fields+1] = c end)\\n return fields\\nend\\n\\nlocal str = \\\"Hello,How,Are,You,Today\\\"\\nprint(table.concat(str:split(\\\",\\\"), \\\".\\\"))\\n\",\n \"language\": \"Lua\"\n },\n {\n \"code\": \"Module CheckIt {\\n\\tFunction Tokenize$(s){\\n\\t\\t\\\\\\\\ letter$ pop a string from stack of values\\n\\t\\t\\\\\\\\ shift 2 swap top two values on stack of values\\n\\t\\tfold1=lambda m=1 ->{\\n\\t\\t\\tshift 2 :if m=1 then m=0:drop: push letter$ else push letter$+\\\".\\\"+letter$\\n\\t\\t}\\n\\t\\t=s#fold$(fold1)\\n\\t}\\n\\tPrint Tokenize$(piece$(\\\"Hello,How,Are,You,Today\\\",\\\",\\\")) =\\\"Hello.How.Are.You.Today\\\" ' true\\n}\\nCheckit\\n\",\n \"language\": \"M2000-Interpreter\"\n },\n {\n \"code\": \"define(`s',`Hello,How,Are,You,Today')\\ndefine(`set',`define(`$1[$2]',`$3')')\\ndefine(`get',`defn($1[$2])')\\ndefine(`n',0)\\ndefine(`fill',\\n `set(a,n,$1)`'define(`n',incr(n))`'ifelse(eval($#>1),1,`fill(shift($@))')')\\nfill(s)\\ndefine(`j',0)\\ndefine(`show',\\n `ifelse(eval(j<n),1,`get(a,j).`'define(`j',incr(j))`'show')')\\nshow\\n\",\n \"language\": \"M4\"\n },\n {\n \"code\": \"StringTools:-Join(StringTools:-Split(\\\"Hello,How,Are,You,Today\\\", \\\",\\\"),\\\".\\\");\\n\",\n \"language\": \"Maple\"\n },\n {\n \"code\": \"StringJoin@StringSplit[\\\"Hello,How,Are,You,Today\\\", \\\",\\\" -> \\\".\\\"]\\n\",\n \"language\": \"Mathematica\"\n },\n {\n \"code\": \"s=strsplit('Hello,How,Are,You,Today',',')\\nfprintf(1,'%s.',s{:})\\n\",\n \"language\": \"MATLAB\"\n },\n {\n \"code\": \"l: split(\\\"Hello,How,Are,You,Today\\\", \\\",\\\")$\\nprintf(true, \\\"~{~a~^.~}~%\\\", l)$\\n\",\n \"language\": \"Maxima\"\n },\n {\n \"code\": \"split(\\\"Hello,How,Are,You,Today\\\",\\\",\\\")$\\nsimplode(%,\\\".\\\");\\n\",\n \"language\": \"Maxima\"\n },\n {\n \"code\": \"output = \\\"\\\"\\nfor word in (filterString \\\"Hello,How,Are,You,Today\\\" \\\",\\\") do\\n(\\n output += (word + \\\".\\\")\\n)\\nformat \\\"%\\\\n\\\" output\\n\",\n \"language\": \"MAXScript\"\n },\n {\n \"code\": \":- module string_tokenize.\\n:- interface.\\n\\n:- import_module io.\\n:- pred main(io::di, io::uo) is det.\\n\\n:- implementation.\\n:- import_module list, string.\\n\\nmain(!IO) :-\\n Tokens = string.split_at_char((','), \\\"Hello,How,Are,You,Today\\\"),\\n io.write_list(Tokens, \\\".\\\", io.write_string, !IO),\\n io.nl(!IO).\\n\",\n \"language\": \"Mercury\"\n },\n {\n \"code\": \"\\\"Hello,How,Are,You,Today\\\" \\\",\\\" split \\\".\\\" join print\\n\",\n \"language\": \"Min\"\n },\n {\n \"code\": \"tokens = \\\"Hello,How,Are,You,Today\\\".split(\\\",\\\")\\nprint tokens.join(\\\".\\\")\\n\",\n \"language\": \"MiniScript\"\n },\n {\n \"code\": \"sep\\tIS\\t','\\nEOS\\tIS\\t0\\nNL\\tIS\\t10\\n\\n// main registers\\np\\tIS\\t$255\\ntp\\tGREG\\nc\\tGREG\\nt\\tGREG\\n\\n\\tLOC\\tData_Segment\\n\\tGREG\\t@\\nText\\tBYTE\\t\\\"Hello,How,Are,You,Today\\\",EOS\\ntoken\\tBYTE\\t0\\neot\\tIS\\t@+255\\n\\n\\tLOC\\t#100\\t% main () {\\nMain\\tLDA\\tp,Text\\t\\t%\\n\\tLDA\\ttp,token\\t% initialize pointers\\n2H\\tLDBU\\tc,p\\t\\t% DO get char\\n\\tBZ\\tc,5F\\t\\t% break if char == EOS\\n\\tCMP\\tt,c,sep\\t\\t% if char != sep then\\n\\tPBNZ\\tt,3F\\t\\t% store char\\n\\tSET\\tt,NL\\t\\t% terminate token with NL,EOS\\n\\tSTBU\\tt,tp\\n\\tSET\\tt,EOS\\n\\tINCL\\ttp,1\\n\\tSTBU\\tt,tp\\n\\tJMP\\t4F\\t\\t% continue\\n\\n3H\\tSTBU\\tc,tp\\t\\t% store char\\n4H\\tINCL\\ttp,1\\t\\t% update pointers\\n\\tINCL\\tp,1\\n\\tJMP\\t2B\\t\\t% LOOP\\n\\n5H\\tSET\\tt,NL\\t\\t% terminate last token and buffer\\n\\tSTBU\\tt,tp\\n\\tSET\\tt,EOS\\n\\tINCL\\ttp,1\\n\\tSTBU\\tt,tp\\n% next part is not really necessary\\n% program runs only once\\n%\\tINCL\\ttp,1\\t\\t% terminate buffer\\n%\\tSTBU\\tt,tp\\n\\n\\tLDA\\ttp,token\\t% reset token pointer\\n\\t\\t\\t\\t% REPEAT\\n2H\\tADD\\tp,tp,0\\t\\t% start of token\\n\\tTRAP\\t0,Fputs,StdOut\\t% output token\\n\\tADD\\ttp,tp,p\\n\\tINCL\\ttp,1\\t\\t% step to next token\\n\\tLDBU\\tt,tp\\n\\tPBNZ\\tt,2B\\t\\t% UNTIL EOB(uffer)\\n\\tTRAP\\t0,Halt,0\\n\",\n \"language\": \"MMIX\"\n },\n {\n \"code\": \"MODULE Tokenize EXPORTS Main;\\n\\nIMPORT IO, TextConv;\\n\\nTYPE Texts = REF ARRAY OF TEXT;\\n\\nVAR tokens: Texts;\\n string := \\\"Hello,How,Are,You,Today\\\";\\n sep := SET OF CHAR {','};\\n\\nBEGIN\\n tokens := NEW(Texts, TextConv.ExplodedSize(string, sep));\\n TextConv.Explode(string, tokens^, sep);\\n FOR i := FIRST(tokens^) TO LAST(tokens^) DO\\n IO.Put(tokens[i] & \\\".\\\");\\n END;\\n IO.Put(\\\"\\\\n\\\");\\nEND Tokenize.\\n\",\n \"language\": \"Modula-3\"\n },\n {\n \"code\": \"TOKENS\\n NEW I,J,INP\\n SET INP=\\\"Hello,how,are,you,today\\\"\\n NEW I FOR I=1:1:$LENGTH(INP,\\\",\\\") SET INP(I)=$PIECE(INP,\\\",\\\",I)\\n NEW J FOR J=1:1:I WRITE INP(J) WRITE:J'=I \\\".\\\"\\n KILL I,J,INP // Kill is optional. \\\"New\\\" variables automatically are killed on \\\"Quit\\\"\\n QUIT\\n\",\n \"language\": \"MUMPS\"\n },\n {\n \"code\": \"for word in \\\"Hello,How,Are,You,Today\\\".split(\\\",\\\")\\n print word + \\\".\\\"\\nend\\n\",\n \"language\": \"Nanoquery\"\n },\n {\n \"code\": \"using System;\\nusing System.Console;\\nusing Nemerle.Utility.NString;\\n\\nmodule Tokenize\\n{\\n Main() : void\\n {\\n def cswords = \\\"Hello,How,Are,You,Today\\\";\\n WriteLine(Concat(\\\".\\\", $[s | s in cswords.Split(',')]));\\n // Split() produces an array while Concat() consumes a list\\n // a quick in place list comprehension takes care of that\\n }\\n}\\n\",\n \"language\": \"Nemerle\"\n },\n {\n \"code\": \"/*NetRexx program *****************************************************\\n* 20.08.2012 Walter Pachl derived from REXX Version 3\\n**********************************************************************/\\n sss='Hello,How,Are,You,Today'\\n Say 'input string='sss\\n Say ''\\n Say 'Words in the string:'\\n ss =sss.translate(' ',',')\\n Loop i=1 To ss.words()\\n Say ss.word(i)'.'\\n End\\n Say 'End-of-list.'\\n\",\n \"language\": \"NetRexx\"\n },\n {\n \"code\": \"(print (join (parse \\\"Hello,How,Are,You,Today\\\" \\\",\\\") \\\".\\\"))\\n\",\n \"language\": \"NewLISP\"\n },\n {\n \"code\": \" s := 'Hello,How,Are,You,Today'\\n+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+\\n|H|e|l|l|o|,|H|o|w|,|A|r|e|,|Y|o|u|,|T|o|d|a|y|\\n+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+\\n\",\n \"language\": \"Nial\"\n },\n {\n \"code\": \" t := s eachall = `, cut s\\n+-----------+-------+-------+-------+-----------+\\n|+-+-+-+-+-+|+-+-+-+|+-+-+-+|+-+-+-+|+-+-+-+-+-+|\\n||H|e|l|l|o|||H|o|w|||A|r|e|||Y|o|u|||T|o|d|a|y||\\n|+-+-+-+-+-+|+-+-+-+|+-+-+-+|+-+-+-+|+-+-+-+-+-+|\\n+-----------+-------+-------+-------+-----------+\\n\",\n \"language\": \"Nial\"\n },\n {\n \"code\": \" u := front content (cart t `.)\\n+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+\\n|H|e|l|l|o|.|H|o|w|.|A|r|e|.|Y|o|u|.|T|o|d|a|y|\\n+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+\\n\",\n \"language\": \"Nial\"\n },\n {\n \"code\": \" s:='Hello,How,Are,You,Today'\\nHello,How,Are,You,Today\\n t:= s eachall = `, cut s\\n+-----+---+---+---+-----+\\n|Hello|How|Are|You|Today|\\n+-----+---+---+---+-----+\\n u:=front content (cart t `.)\\n\\nHello.How.Are.You.Today\\n\",\n \"language\": \"Nial\"\n },\n {\n \"code\": \"front content (cart (s eachall = `, cut s) `.)\\n\",\n \"language\": \"Nial\"\n },\n {\n \"code\": \"import strutils\\n\\nlet text = \\\"Hello,How,Are,You,Today\\\"\\nlet tokens = text.split(',')\\necho tokens.join(\\\".\\\")\\n\",\n \"language\": \"Nim\"\n },\n {\n \"code\": \"class Parse {\\n function : Main(args : String[]) ~ Nil {\\n tokens := \\\"Hello,How,Are,You,Today\\\"->Split(\\\",\\\");\\n each(i : tokens) {\\n tokens[i]->PrintLine();\\n };\\n }\\n}\\n\",\n \"language\": \"Objeck\"\n },\n {\n \"code\": \"NSString *text = @\\\"Hello,How,Are,You,Today\\\";\\nNSArray *tokens = [text componentsSeparatedByString:@\\\",\\\"];\\nNSString *result = [tokens componentsJoinedByString:@\\\".\\\"];\\nNSLog(result);\\n\",\n \"language\": \"Objective-C\"\n },\n {\n \"code\": \"let words = String.split_on_char ',' \\\"Hello,How,Are,You,Today\\\" in\\nString.concat \\\".\\\" words\\n\",\n \"language\": \"OCaml\"\n },\n {\n \"code\": \"let split_on_char sep s =\\n let r = ref [] in\\n let j = ref (String.length s) in\\n for i = String.length s - 1 downto 0 do\\n if s.[i] = sep then begin\\n r := String.sub s (i + 1) (!j - i - 1) :: !r;\\n j := i\\n end\\n done;\\n String.sub s 0 !j :: !r\\n\",\n \"language\": \"OCaml\"\n },\n {\n \"code\": \"\\\"Hello,How,Are,You,Today\\\" wordsWith(',') println\\n\",\n \"language\": \"Oforth\"\n },\n {\n \"code\": \"text='Hello,How,Are,You,Today'\\ndo while text \\\\= ''\\n parse var text word1 ',' text\\n call charout 'STDOUT:',word1'.'\\nend\\n\",\n \"language\": \"OoRexx\"\n },\n {\n \"code\": \"FUNCTION tokenizeString RETURNS CHAR (\\n i_c AS CHAR\\n):\\n\\n DEF VAR ii AS INT.\\n DEF VAR carray AS CHAR EXTENT.\\n DEF VAR cresult AS CHAR.\\n\\n EXTENT( carray ) = NUM-ENTRIES( i_c ).\\n\\n DO ii = 1 TO NUM-ENTRIES( i_c ):\\n carray[ ii ] = ENTRY( ii, i_c ).\\n END.\\n\\n DO ii = 1 TO EXTENT( carray ).\\n cresult = cresult + \\\".\\\" + carray[ ii ].\\n END.\\n RETURN SUBSTRING( cresult, 2 ).\\n\\nEND FUNCTION. /* tokenizeString */\\n\\nMESSAGE\\n tokenizeString( \\\"Hello,How,Are,You,Today\\\" )\\nVIEW-AS ALERT-BOX.\\n\",\n \"language\": \"OpenEdge-Progress\"\n },\n {\n \"code\": \"for T in {String.tokens \\\"Hello,How,Are,You,Today\\\" &,} do\\n {System.printInfo T#\\\".\\\"}\\nend\\n\",\n \"language\": \"Oz\"\n },\n {\n \"code\": \"\\\\\\\\ Tokenize a string str according to 1 character delimiter d. Return a list of tokens.\\n\\\\\\\\ Using ssubstr() from http://rosettacode.org/wiki/Substring#PARI.2FGP\\n\\\\\\\\ tokenize() 3/5/16 aev\\ntokenize(str,d)={\\nmy(str=Str(str,d),vt=Vecsmall(str),d1=sasc(d),Lr=List(),sn=#str,v1,p1=1);\\nfor(i=p1,sn, v1=vt[i]; if(v1==d1, listput(Lr,ssubstr(str,p1,i-p1)); p1=i+1));\\nreturn(Lr);\\n}\\n\\n{\\n\\\\\\\\ TEST\\nprint(\\\" *** Testing tokenize from Version #1:\\\");\\nprint(\\\"1.\\\", tokenize(\\\"Hello,How,Are,You,Today\\\",\\\",\\\"));\\n\\\\\\\\ BOTH 2 & 3 are NOT OK!!\\nprint(\\\"2.\\\",tokenize(\\\"Hello,How,Are,You,Today,\\\",\\\",\\\"));\\nprint(\\\"3.\\\",tokenize(\\\",Hello,,How,Are,You,Today\\\",\\\",\\\"));\\n}\\n\",\n \"language\": \"PARI-GP\"\n },\n {\n \"code\": \"\\\\\\\\ Tokenize a string str according to 1 character delimiter d. Return a list of tokens.\\n\\\\\\\\ Using ssubstr() from http://rosettacode.org/wiki/Substring#PARI.2FGP\\n\\\\\\\\ stok() 3/5/16 aev\\nstok(str,d)={\\nmy(d1c=ssubstr(d,1,1),str=Str(str,d1c),vt=Vecsmall(str),d1=sasc(d1c),\\n Lr=List(),sn=#str,v1,p1=1,vo=32);\\nif(sn==1, return(List(\\\"\\\"))); if(vt[sn-1]==d1,sn--);\\nfor(i=1,sn, v1=vt[i];\\n if(v1!=d1, vo=v1; next);\\n if(vo==d1||i==1, listput(Lr,\\\"\\\"); p1=i+1; vo=v1; next);\\n if(i-p1>0, listput(Lr,ssubstr(str,p1,i-p1)); p1=i+1);\\n vo=v1;\\n );\\nreturn(Lr);\\n}\\n\\n{\\n\\\\\\\\ TEST\\nprint(\\\" *** Testing stok from Version #2:\\\");\\n\\\\\\\\ pp - positional parameter(s)\\nprint(\\\"1. 5 pp: \\\", stok(\\\"Hello,How,Are,You,Today\\\",\\\",\\\"));\\nprint(\\\"2. 5 pp: \\\", stok(\\\"Hello,How,Are,You,Today,\\\",\\\",\\\"));\\nprint(\\\"3. 9 pp: \\\", stok(\\\",,Hello,,,How,Are,You,Today\\\",\\\",\\\"));\\nprint(\\\"4. 6 pp: \\\", stok(\\\",,,,,,\\\",\\\",\\\"));\\nprint(\\\"5. 1 pp: \\\", stok(\\\",\\\",\\\",\\\"));\\nprint(\\\"6. 1 pp: \\\", stok(\\\"Hello-o-o??\\\",\\\",\\\"));\\nprint(\\\"7. 0 pp: \\\", stok(\\\"\\\",\\\",\\\"));\\n}\\n\",\n \"language\": \"PARI-GP\"\n },\n {\n \"code\": \"program TokenizeString;\\n\\n{$mode objfpc}{$H+}\\n\\nuses\\n SysUtils, Classes;\\nconst\\n TestString = 'Hello,How,Are,You,Today';\\nvar\\n Tokens: TStringList;\\n I: Integer;\\nbegin\\n // Uses FCL facilities, \\\"harder\\\" algorithm not implemented\\n Tokens := TStringList.Create;\\n try\\n Tokens.Delimiter := ',';\\n Tokens.DelimitedText := TestString;\\n Tokens.Delimiter := '.'; // For example\\n // To standard Output\\n WriteLn(Format('Tokenize from: \\\"%s\\\"', [TestString]));\\n WriteLn(Format('to: \\\"%s\\\"',[Tokens.DelimitedText]));\\n finally\\n Tokens.Free;\\n end;\\nend.\\n\",\n \"language\": \"Pascal\"\n },\n {\n \"code\": \"print join('.', split /,/, 'Hello,How,Are,You,Today'), \\\"\\\\n\\\";\\n\",\n \"language\": \"Perl\"\n },\n {\n \"code\": \"echo \\\"Hello,How,Are,You,Today\\\" | perl -aplF/,/ -e '$\\\" = \\\".\\\"; $_ = \\\"@F\\\";'\\n\",\n \"language\": \"Perl\"\n },\n {\n \"code\": \"BEGIN { $/ = \\\"\\\\n\\\"; $\\\\ = \\\"\\\\n\\\"; }\\nLINE: while (defined($_ = <ARGV>)) {\\n chomp $_;\\n our(@F) = split(/,/, $_, 0);\\n $\\\" = '.';\\n $_ = \\\"@F\\\";\\n}\\ncontinue {\\n die \\\"-p destination: $!\\\\n\\\" unless print $_;\\n}\\n\",\n \"language\": \"Perl\"\n },\n {\n \"code\": \"(phixonline)-->\\n <span style=\\\"color: #0000FF;\\\">?</span><span style=\\\"color: #7060A8;\\\">join</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #7060A8;\\\">split</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #008000;\\\">\\\"Hello,How,Are,You,Today\\\"</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<!--\\n\",\n \"language\": \"Phix\"\n },\n {\n \"code\": \"/# \\\"Hello,How,Are,You,Today\\\" \\\",\\\" \\\".\\\" subst print #/\\n\\\"Hello,How,Are,You,Today\\\" \\\",\\\" \\\" \\\" subst split len for get print \\\".\\\" print endfor\\n\",\n \"language\": \"Phixmonti\"\n },\n {\n \"code\": \"<?php\\n$str = 'Hello,How,Are,You,Today';\\necho implode('.', explode(',', $str));\\n?>\\n\",\n \"language\": \"PHP\"\n },\n {\n \"code\": \"import util.\\n\\ngo =>\\n S = \\\"Hello,How,Are,You,Today\\\",\\n T = S.split(\\\",\\\"),\\n println(T),\\n T.join(\\\".\\\").println(),\\n\\n % As a one liner:\\n S.split(\\\",\\\").join(\\\".\\\").println().\\n\",\n \"language\": \"Picat\"\n },\n {\n \"code\": \"(mapcar pack\\n (split (chop \\\"Hello,How,Are,You,Today\\\") \\\",\\\") )\\n\",\n \"language\": \"PicoLisp\"\n },\n {\n \"code\": \"(\\\"Hello,How,Are,You,Today\\\" / \\\",\\\") * \\\".\\\";\\n\",\n \"language\": \"Pike\"\n },\n {\n \"code\": \"tok: Proc Options(main);\\ndeclare s character (100) initial ('Hello,How,Are,You,Today');\\ndeclare n fixed binary (31);\\n\\nn = tally(s, ',')+1;\\n\\nbegin;\\n declare table(n) character (50) varying;\\n declare c character (1);\\n declare (i, k) fixed binary (31);\\n\\n table = ''; k = 1;\\n do i = 1 to length(s);\\n c = substr(s, i, 1);\\n if c = ',' then k = k + 1;\\n else table(k) = table(k) || c;\\n end;\\n\\n /* display the table */\\n table = table || '.';\\n put skip list (string(table));\\nend;\\nend;\\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/* SPLIT A STRING ON CHARACTER 'SEP'.\\n THE 'PARTS' ARRAY WILL CONTAIN POINTERS TO THE START OF EACH ELEMENT.\\n THE AMOUNT OF PARTS IS RETURNED.\\n*/\\nTOKENIZE: PROCEDURE (SEP, STR, PARTS) ADDRESS;\\n DECLARE SEP BYTE, (STR, PARTS) ADDRESS;\\n DECLARE (N, P BASED PARTS) ADDRESS;\\n DECLARE CH BASED STR BYTE;\\n N = 0;\\nLOOP:\\n P(N) = STR;\\n N = N + 1;\\n DO WHILE CH <> '$' AND CH <> SEP;\\n STR = STR + 1;\\n END;\\n IF CH = '$' THEN RETURN N;\\n CH = '$';\\n STR = STR + 1;\\n GO TO LOOP;\\nEND TOKENIZE;\\n\\n/* TEST ON THE GIVEN INPUT */\\nDECLARE HELLO (24) BYTE INITIAL ('HELLO,HOW,ARE,YOU,TODAY$');\\nDECLARE PARTS (10) ADDRESS;\\nDECLARE (I, LEN) ADDRESS;\\n\\nLEN = TOKENIZE(',', .HELLO, .PARTS);\\nDO I = 0 TO LEN-1;\\n CALL PRINT(PARTS(I));\\n CALL PRINT(.'. $');\\nEND;\\n\\nCALL EXIT;\\nEOF;\\n\",\n \"language\": \"PL-M\"\n },\n {\n \"code\": \"To run:\\nStart up.\\nSplit \\\"Hello,How,Are,You,Today\\\" into some string things given the comma byte.\\nJoin the string things with the period byte giving a string.\\nDestroy the string things.\\nWrite the string on the console.\\nWait for the escape key.\\nShut down.\\n\\nTo join some string things with a byte giving a string:\\nGet a string thing from the string things.\\nLoop.\\nIf the string thing is nil, exit.\\nAppend the string thing's string to the string.\\nIf the string thing's next is not nil, append the byte to the string.\\nPut the string thing's next into the string thing.\\nRepeat.\\n\",\n \"language\": \"Plain-English\"\n },\n {\n \"code\": \";;; Make a list of strings from a string using space as separator\\nlvars list;\\nsysparse_string('the cat sat on the mat') -> list;\\n;;; print the list of strings\\nlist =>\\n** [the cat sat on the mat]\\n\",\n \"language\": \"Pop11\"\n },\n {\n \"code\": \"lvars list;\\nsysparse_string('one 1 two 2 three 3 four 4', true) -> list;\\n;;; print the list of strings and numbers\\nlist =>\\n** [one 1 two 2 three 3 four 4]\\n;;; check that first item is a string and second an integer\\nisstring(list(1))=>\\n** <true>\\nisinteger(list(2))=>\\n** <true>\\n\",\n \"language\": \"Pop11\"\n },\n {\n \"code\": \";;; Make pop-11 print strings with quotes\\ntrue -> pop_pr_quotes;\\n;;;\\n;;; Create a string of tokens using comma as token separator\\nlvars str='Hello,How,Are,You,Today';\\n;;;\\n;;; Make a list of strings by applying sys_parse_string\\n;;; to str, using the character `,` as separator (the default\\n;;; separator, if none is provided, is the space character).\\nlvars strings;\\n[% sys_parse_string(str, `,`) %] -> strings;\\n;;;\\n;;; print the list of strings\\nstrings =>\\n** ['Hello' 'How' 'Are' 'You' 'Today']\\n\",\n \"language\": \"Pop11\"\n },\n {\n \"code\": \"{% sys_parse_string(str, `,`) %} -> strings;\\n;;; print the vector\\nstrings =>\\n** {'Hello' 'How' 'Are' 'You' 'Today'}\\n\",\n \"language\": \"Pop11\"\n },\n {\n \"code\": \"lvars numbers;\\n{% sys_parse_string('100 101 102 103 99.9 99.999', strnumber) %} -> numbers;\\n;;; the result is a vector containing integers and floats,\\n;;; which can be printed thus:\\nnumbers =>\\n** {100 101 102 103 99.9 99.999}\\n\",\n \"language\": \"Pop11\"\n },\n {\n \"code\": \";;; Declare and initialize variables\\nlvars str='Hello,How,Are,You,Today';\\n;;; Iterate over string\\nlvars ls = [], i, j = 1;\\nfor i from 1 to length(str) do\\n ;;; If comma\\n if str(i) = `,` then\\n ;;; Prepend word (substring) to list\\n cons(substring(j, i - j, str), ls) -> ls;\\n i + 1 -> j;\\n endif;\\nendfor;\\n;;; Prepend final word (if needed)\\nif j <= length(str) then\\n cons(substring(j, length(str) - j + 1, str), ls) -> ls;\\nendif;\\n;;; Reverse the list\\nrev(ls) -> ls;\\n\",\n \"language\": \"Pop11\"\n },\n {\n \"code\": \";;; Put list elements and lenght on the stack\\ndestlist(ls);\\n;;; Build a vector from them\\nlvars ar = consvector();\\n;;; Display in a loop, putting trailing period\\nfor i from 1 to length(ar) do\\n printf(ar(i), '%s.');\\nendfor;\\nprintf('\\\\n');\\n\",\n \"language\": \"Pop11\"\n },\n {\n \"code\": \"for i in ls do\\n printf(i, '%s.');\\nendfor;\\n\",\n \"language\": \"Pop11\"\n },\n {\n \"code\": \"FUNCTION PBMAIN () AS LONG\\n DIM parseMe AS STRING\\n parseMe = \\\"Hello,How,Are,You,Today\\\"\\n\\n REDIM parsed(PARSECOUNT(parseMe) - 1) AS STRING\\n PARSE parseMe, parsed() 'comma is default delimiter\\n\\n DIM L0 AS LONG, outP AS STRING\\n outP = parsed(0)\\n FOR L0 = 1 TO UBOUND(parsed) 'could reuse parsecount instead of ubound\\n outP = outP & \\\".\\\" & parsed(L0)\\n NEXT\\n\\n MSGBOX outP\\nEND FUNCTION\\n\",\n \"language\": \"PowerBASIC\"\n },\n {\n \"code\": \"$words = \\\"Hello,How,Are,You,Today\\\".Split(',')\\n[string]::Join('.', $words)\\n\",\n \"language\": \"PowerShell\"\n },\n {\n \"code\": \"$words = \\\"Hello,How,Are,You,Today\\\" -split ','\\n$words -join '.'\\n\",\n \"language\": \"PowerShell\"\n },\n {\n \"code\": \"\\\"Hello,How,Are,You,Today\\\", \\\",,Hello,,Goodbye,,\\\" | ForEach-Object {($_.Split(',',[StringSplitOptions]::RemoveEmptyEntries)) -join \\\".\\\"}\\n\",\n \"language\": \"PowerShell\"\n },\n {\n \"code\": \"splitup(Sep,[token(B)|BL]) --> splitup(Sep,B,BL).\\nsplitup(Sep,[A|AL],B) --> [A], {\\\\+ [A] = Sep }, splitup(Sep,AL,B).\\nsplitup(Sep,[],[B|BL]) --> Sep, splitup(Sep,B,BL).\\nsplitup(_Sep,[],[]) --> [].\\nstart :-\\n phrase(splitup(\\\",\\\",Tokens),\\\"Hello,How,Are,You,Today\\\"),\\n phrase(splitup(\\\".\\\",Tokens),Backtogether),\\n string_to_list(ABack,Backtogether),\\n writeln(ABack).\\n\",\n \"language\": \"Prolog\"\n },\n {\n \"code\": \"?- split_string(\\\"Hello,How,Are,You,Today\\\", \\\",\\\", \\\"\\\", Split),\\n| atomics_to_string(Split, \\\".\\\", PeriodSeparated),\\n| writeln(PeriodSeparated).\\nHello.How.Are.You.Today\\n\",\n \"language\": \"Prolog\"\n },\n {\n \"code\": \"NewList MyStrings.s()\\n\\nFor i=1 To 5\\n AddElement(MyStrings())\\n MyStrings()=StringField(\\\"Hello,How,Are,You,Today\\\",i,\\\",\\\")\\nNext i\\n\\nForEach MyStrings()\\n Print(MyStrings()+\\\".\\\")\\nNext\\n\",\n \"language\": \"PureBasic\"\n },\n {\n \"code\": \"Print(ReplaceString(\\\"Hello,How,Are,You,Today\\\",\\\",\\\",\\\".\\\"))\\n\",\n \"language\": \"PureBasic\"\n },\n {\n \"code\": \"text = \\\"Hello,How,Are,You,Today\\\"\\ntokens = text.split(',')\\nprint ('.'.join(tokens))\\n\",\n \"language\": \"Python\"\n },\n {\n \"code\": \"print ('.'.join('Hello,How,Are,You,Today'.split(',')))\\n\",\n \"language\": \"Python\"\n },\n {\n \"code\": \"words: \\\",\\\" vs \\\"Hello,How,Are,You,Today\\\"\\n\\\".\\\" sv words\\n\",\n \"language\": \"Q\"\n },\n {\n \"code\": \"a$ = \\\"Hello,How,Are,You,Today\\\" ' | Initialize original string.\\nFOR na = 1 TO LEN(a$) ' | Start loop to count number of commas.\\n IF MID$(a$, na, 1) = \\\",\\\" THEN nc = nc + 1 ' | For each comma, increment nc.\\nNEXT ' | End of loop.\\nDIM t$(nc) ' | Dim t$ array with total number of commas (nc). Array base is 0.\\nFOR nb = 1 TO LEN(a$) ' | Start loop to find each word.\\n c$ = MID$(a$, nb, 1) ' | Look at each character in the string.\\n IF c$ = \\\",\\\" THEN ' | If the character is a comma, increase the t$ array for the next word.\\n t = t + 1 ' | t = token word count. Starts at 0 because array base is 0.\\n ELSE ' | Or...\\n t$(t) = t$(t) + c$ ' | Add each character to the current token (t$) word.\\n END IF ' | End of decision tree.\\nNEXT ' | End of loop.\\nFOR nd = 0 TO t ' | Start loop to create final desired output.\\n tf$ = tf$ + t$(nd) + \\\".\\\" ' | Add each token word from t$ followed by a period to the final tf$.\\nNEXT ' | End of loop.\\nPRINT LEFT$(tf$, LEN(tf$) - 1) ' | Print all but the last period of tf$.\\nEND ' | Program end.\\n\",\n \"language\": \"QB64\"\n },\n {\n \"code\": \"a$ = \\\"Hello,How,Are,You,Today\\\" ' | Initialize original string.\\nDIM t$(LEN(a$) / 2) ' | Create an overestimated sized array.\\nFOR nd = 1 TO LEN(a$) ' | Start loop to find each comma.\\n IF MID$(a$, nd, 1) = \\\",\\\" THEN ' | If a comma is found...\\n tc = tc + 1 ' | Increment tc for each found comma.\\n t$(tc) = word$(a$, tc, \\\",\\\") ' | Assign tc word to t$(tc) array.\\n END IF ' | End decision tree.\\nNEXT ' | End loop.\\nt$(tc + 1) = word$(a$, tc + 1, \\\",\\\") ' | Assign last word to next array position.\\nft$ = t$(1) ' | Start final return string ft$ with first array value.\\nFOR ne = 2 TO tc + 1 ' | Start loop to add periods and array values.\\n ft$ = ft$ + \\\".\\\" + t$(ne) ' | Concatenate a period with subsequent array values.\\nNEXT ' | End loop.\\nPRINT ft$ ' | Print final return string ft$.\\n\\nFUNCTION word$ (inSTG$, inDEC, inPRM$) ' | word$ function accepts original string, word number, and separator.\\n inSTG$ = inSTG$ + inPRM$ ' | Add a separator to the end of the original string.\\n FOR na = 1 TO LEN(inSTG$) ' | Start loop to count total number of separators.\\n IF MID$(inSTG$, na, 1) = inPRM$ THEN nc = nc + 1 ' | If separator found, increment nc.\\n NEXT ' | End loop.\\n IF inDEC > nc THEN word$ = \\\"\\\": GOTO DONE ' | If requested word number (inDEC) is greater than total words (nc), bail.\\n FOR nd = 1 TO inDEC ' | Start loop to find requested numbered word.\\n last = st ' | Remember the position of the last separator.\\n st = INSTR(last + 1, inSTG$, inPRM$) ' | Find the next separator.\\n NEXT ' | End loop.\\n word$ = MID$(inSTG$, last + 1, st - last - 1) ' | Return requested word.\\n DONE: ' | Label for bail destination of word count error check.\\nEND FUNCTION ' | End of function.\\n\",\n \"language\": \"QB64\"\n },\n {\n \"code\": \"DIM parseMe AS STRING\\nparseMe = \\\"Hello,How,Are,You,Today\\\"\\n\\nDIM tmpLng1 AS INTEGER, tmpLng2 AS INTEGER, parsedCount AS INTEGER\\ntmpLng2 = 1\\nparsedCount = -1\\n\\n'count number of tokens\\nDO\\n tmpLng1 = INSTR(tmpLng2, parseMe, \\\",\\\")\\n IF tmpLng1 THEN\\n parsedCount = parsedCount + 1\\n tmpLng2 = tmpLng1 + 1\\n ELSE\\n IF tmpLng2 < (LEN(parseMe) + 1) THEN parsedCount = parsedCount + 1\\n EXIT DO\\n END IF\\nLOOP\\n\\nIF parsedCount > -1 THEN\\n REDIM parsed(parsedCount) AS STRING\\n tmpLng2 = 1\\n parsedCount = -1\\n\\n 'parse\\n DO\\n tmpLng1 = INSTR(tmpLng2, parseMe, \\\",\\\")\\n IF tmpLng1 THEN\\n parsedCount = parsedCount + 1\\n parsed(parsedCount) = MID$(parseMe, tmpLng2, tmpLng1 - tmpLng2)\\n tmpLng2 = tmpLng1 + 1\\n ELSE\\n IF tmpLng2 < (LEN(parseMe) + 1) THEN\\n parsedCount = parsedCount + 1\\n parsed(parsedCount) = MID$(parseMe, tmpLng2)\\n END IF\\n EXIT DO\\n END IF\\n LOOP\\n\\n PRINT parsed(0);\\n FOR L0 = 1 TO parsedCount\\n PRINT \\\".\\\"; parsed(L0);\\n NEXT\\nEND IF\\n\",\n \"language\": \"QBasic\"\n },\n {\n \"code\": \" [ [] [] rot\\n witheach\\n [ dup char , = iff\\n [ drop nested join [] ]\\n else join ]\\n nested join ] is tokenise ( $ --> [ )\\n\\n [ witheach [ echo$ say \\\".\\\" ] ] is display ( [ --> )\\n\\n $ \\\"Hello,How,Are,You,Today\\\" tokenise display\\n\",\n \"language\": \"Quackery\"\n },\n {\n \"code\": \"text <- \\\"Hello,How,Are,You,Today\\\"\\njunk <- strsplit(text, split=\\\",\\\")\\nprint(paste(unlist(junk), collapse=\\\".\\\"))\\n\",\n \"language\": \"R\"\n },\n {\n \"code\": \"paste(unlist(strsplit(text, split=\\\",\\\")), collapse=\\\".\\\")\\n\",\n \"language\": \"R\"\n },\n {\n \"code\": \"#lang racket\\n(string-join (string-split \\\"Hello,How,Are,You,Today\\\" \\\",\\\") \\\".\\\")\\n;; -> \\\"Hello.How.Are.You.Today\\\"\\n\",\n \"language\": \"Racket\"\n },\n {\n \"code\": \"'Hello,How,Are,You,Today'.split(',').join('.').say;\\n\",\n \"language\": \"Raku\"\n },\n {\n \"code\": \"say join '.', split ',', 'Hello,How,Are,You,Today';\\n\",\n \"language\": \"Raku\"\n },\n {\n \"code\": \"'Hello,How,Are,You,Today' ',' split '.' join print\\n\",\n \"language\": \"Raven\"\n },\n {\n \"code\": \"print [\\\"Original:\\\" original: \\\"Hello,How,Are,You,Today\\\"]\\ntokens: parse original \\\",\\\"\\ndotted: \\\"\\\" repeat i tokens [append dotted rejoin [i \\\".\\\"]]\\nprint [\\\"Dotted: \\\" dotted]\\n\",\n \"language\": \"REBOL\"\n },\n {\n \"code\": \"str: \\\"Hello,How,Are,You,Today\\\"\\n>> tokens: split str \\\",\\\"\\n>> probe tokens\\n[\\\"Hello\\\" \\\"How\\\" \\\"Are\\\" \\\"You\\\" \\\"Today\\\"]\\n\\n>> periods: replace/all form tokens \\\" \\\" \\\".\\\" ;The word FORM converts the list series to a string removing quotes.\\n>> print periods ;then REPLACE/ALL spaces with period\\nHello.How.Are.You.Today\\n\",\n \"language\": \"Red\"\n },\n {\n \"code\": \"{{\\n : char ( -$ ) \\\" \\\" ;\\n : tokenize ( $-$$ )\\n @char ^strings'splitAtChar withLength 1- over + 0 swap ! tempString ;\\n : action ( $- )\\n keepString ^buffer'add ;\\n---reveal---\\n : split ( $cb- )\\n ^buffer'set !char\\n char ^strings'append\\n [ tokenize action dup 1 <> ] while drop\\n ^buffer'get drop ;\\n}}\\n\",\n \"language\": \"Retro\"\n },\n {\n \"code\": \"create strings 100 allot\\n\\\"Hello,How,Are,You,Today\\\" ', strings split\\n\",\n \"language\": \"Retro\"\n },\n {\n \"code\": \"strings [ @ \\\"%s.\\\" puts ] ^types'STRING each@\\n\",\n \"language\": \"Retro\"\n },\n {\n \"code\": \"/*REXX program separates a string of comma─delimited words, and echoes them ──► terminal*/\\noriginal = 'Hello,How,Are,You,Today' /*some words separated by commas (,). */\\nsay 'The input string:' original /*display original string ──► terminal.*/\\nnew= original /*make a copy of the string. */\\n do #=1 until new=='' /*keep processing until NEW is empty.*/\\n parse var new @.# ',' new /*parse words delineated by a comma (,)*/\\n end /*#*/ /* [↑] the new array is named @. */\\nsay /* NEW is destructively parsed. [↑] */\\nsay center(' Words in the string ', 40, \\\"═\\\") /*display a nice header for the list. */\\n do j=1 for # /*display all the words (one per line),*/\\n say @.j || left(., j\\\\==#) /*maybe append a period (.) to a word. */\\n end /*j*/ /* [↑] don't append a period if last. */\\nsay center(' End─of─list ', 40, \\\"═\\\") /*display a (EOL) trailer for the list.*/\\n\",\n \"language\": \"REXX\"\n },\n {\n \"code\": \"/*REXX program to separate a string of comma-delimited words and echo */\\nsss='Hello,How,Are,You,Today'\\nsay 'input string='sss\\nsay ''\\nsay 'Words in the string:'\\nss =translate(sss,' ',',')\\ndot='.'\\nDo i=1 To words(ss)\\n If i=words(ss) Then dot=''\\n say word(ss,i)dot\\n End\\nsay 'End-of-list.'\\n\",\n \"language\": \"REXX\"\n },\n {\n \"code\": \"see substr(\\\"Hello,How,Are,You,Today\\\", \\\",\\\", \\\".\\\")\\n\",\n \"language\": \"Ring\"\n },\n {\n \"code\": \"puts \\\"Hello,How,Are,You,Today\\\".split(',').join('.')\\n\",\n \"language\": \"Ruby\"\n },\n {\n \"code\": \"text$ = \\\"Hello,How,Are,You,Today\\\"\\nFOR i = 1 to 5\\n textArray$(i) = word$(text$,i,\\\",\\\")\\n print textArray$(i);\\\" \\\";\\nNEXT\\n\",\n \"language\": \"Run-BASIC\"\n },\n {\n \"code\": \"fn main() {\\n let s = \\\"Hello,How,Are,You,Today\\\";\\n let tokens: Vec<&str> = s.split(\\\",\\\").collect();\\n println!(\\\"{}\\\", tokens.join(\\\".\\\"));\\n}\\n\",\n \"language\": \"Rust\"\n },\n {\n \"code\": \"variable a = strchop(\\\"Hello,How,Are,You,Today\\\", ',', 0);\\nprint(strjoin(a, \\\".\\\"));\\n\",\n \"language\": \"S-lang\"\n },\n {\n \"code\": \"println(\\\"Hello,How,Are,You,Today\\\" split \\\",\\\" mkString \\\".\\\")\\n\",\n \"language\": \"Scala\"\n },\n {\n \"code\": \"(use-modules (ice-9 regex))\\n(define s \\\"Hello,How,Are,You,Today\\\")\\n(define words (map match:substring (list-matches \\\"[^,]+\\\" s)))\\n\\n(do ((n 0 (+ n 1))) ((= n (length words)))\\n (display (list-ref words n))\\n (if (< n (- (length words) 1))\\n (display \\\".\\\")))\\n\",\n \"language\": \"Scheme\"\n },\n {\n \"code\": \"(define s \\\"Hello,How,Are,You,Today\\\")\\n(define words (string-tokenize s (char-set-complement (char-set #\\\\,))))\\n(define t (string-join words \\\".\\\"))\\n\",\n \"language\": \"Scheme\"\n },\n {\n \"code\": \"(print\\n (string-join\\n (string-split \\\"Hello,How,Are,You,Today\\\" #\\\\,)\\n \\\".\\\"))\\n\",\n \"language\": \"Scheme\"\n },\n {\n \"code\": \"var array string: tokens is 0 times \\\"\\\";\\n\\ntokens := split(\\\"Hello,How,Are,You,Today\\\", \\\",\\\");\\n\",\n \"language\": \"Seed7\"\n },\n {\n \"code\": \"| s = 'Hello,How,Are,You,Today' |\\n((s splitOn: ',') joinUsing: '.') printLine.\\n\",\n \"language\": \"Self\"\n },\n {\n \"code\": \"'Hello,How,Are,You,Today'.split(',').join('.').say;\\n\",\n \"language\": \"Sidef\"\n },\n {\n \"code\": \"BEGIN\\n\\n CLASS TEXTARRAY(N); INTEGER N;\\n BEGIN\\n TEXT ARRAY ARR(1:N);\\n END TEXTARRAY;\\n\\n REF(TEXTARRAY) PROCEDURE SPLIT(T,DELIM); TEXT T; CHARACTER DELIM;\\n BEGIN\\n INTEGER N, I, LPOS;\\n REF(TEXTARRAY) A;\\n\\n N := 1;\\n T.SETPOS(1);\\n WHILE T.MORE DO\\n IF T.GETCHAR = DELIM THEN\\n N := N+1;\\n A :- NEW TEXTARRAY(N);\\n\\n I := 0;\\n LPOS := 1;\\n T.SETPOS(LPOS);\\n WHILE T.MORE DO\\n IF T.GETCHAR = DELIM THEN\\n BEGIN\\n I := I+1;\\n A.ARR(I) :- T.SUB(LPOS,T.POS-LPOS-1);\\n LPOS := T.POS;\\n END;\\n I := I+1;\\n A.ARR(I) :- T.SUB(LPOS,T.LENGTH-LPOS+1);\\n SPLIT :- A;\\n END SPLIT;\\n\\n BEGIN\\n TEXT S;\\n REF(TEXTARRAY) TA;\\n INTEGER I;\\n\\n S :- \\\"HELLO,HOW,ARE,YOU,TODAY\\\";\\n TA :- SPLIT(S,',');\\n FOR I := 1 STEP 1 UNTIL TA.N DO\\n BEGIN\\n OUTTEXT(TA.ARR(I));\\n OUTCHAR('.');\\n END;\\n OUTIMAGE;\\n END;\\n\\nEND.\\n\",\n \"language\": \"Simula\"\n },\n {\n \"code\": \"('Hello,How,Are,You,Today' splitWith: $,) join &separator: '.'.\\n\",\n \"language\": \"Slate\"\n },\n {\n \"code\": \"(display\\n (list->string\\n (string->list\\n \\\"Hello,How,Are,You,Today\\\"\\n \\\",\\\")\\n \\\".\\\"))\\n\",\n \"language\": \"Slope\"\n },\n {\n \"code\": \"|array |\\narray := 'Hello,How,Are,You,Today' subStrings: $,.\\narray fold: [:concatenation :string | concatenation, '.', string ]\\n\",\n \"language\": \"Smalltalk\"\n },\n {\n \"code\": \"('Hello,How,Are,You,Today' subStrings: $,) join: '.'\\n\",\n \"language\": \"Smalltalk\"\n },\n {\n \"code\": \"|array |\\narray := 'Hello,How,Are,You,Today' subStrings: $,.\\narray inject: '' into: [:concatenation :string | concatenation, string, '.' ]\\n\",\n \"language\": \"Smalltalk\"\n },\n {\n \"code\": \" define('split(chs,str)i,j,t,w2') :(split_end)\\nsplit t = table()\\nsp1 str pos(0) (break(chs) | rem) $ t<i = i + 1>\\n+ span(chs) (break(chs) | '') . w2 = w2 :s(sp1)\\n* t<i> = differ(str,'') str ;* Uncomment for CSnobol\\n split = array(i)\\nsp2 split<j = j + 1> = t<j> :s(sp2)f(return)\\nsplit_end\\n\\n define('join(ch,a)i,') :(join_end)\\njoin join = join a<i = i + 1>\\n join = join ?a<i + 1> ch :s(join)f(return)\\njoin_end\\n\\n* # Test and display\\n output = join('.',split(',','Hello,How,Are,You,Today'))\\nend\\n\",\n \"language\": \"SNOBOL4\"\n },\n {\n \"code\": \"val splitter = String.tokens (fn c => c = #\\\",\\\");\\nval main = (String.concatWith \\\".\\\") o splitter;\\n\",\n \"language\": \"Standard-ML\"\n },\n {\n \"code\": \"- main \\\"Hello,How,Are,You,Today\\\"\\nval it = \\\"Hello.How.Are.You.Today\\\" : string\\n\",\n \"language\": \"Standard-ML\"\n },\n {\n \"code\": \"let text = \\\"Hello,How,Are,You,Today\\\"\\nlet tokens = text.components(separatedBy: \\\",\\\") // for single or multi-character separator\\nprint(tokens)\\nlet result = tokens.joined(separator: \\\".\\\")\\nprint(result)\\n\",\n \"language\": \"Swift\"\n },\n {\n \"code\": \"let text = \\\"Hello,How,Are,You,Today\\\"\\nlet tokens = text.characters.split(\\\",\\\").map{String($0)} // for single-character separator\\nprint(tokens)\\nlet result = tokens.joinWithSeparator(\\\".\\\")\\nprint(result)\\n\",\n \"language\": \"Swift\"\n },\n {\n \"code\": \"let text = \\\"Hello,How,Are,You,Today\\\"\\nlet tokens = split(text, { $0 == \\\",\\\" }) // for single-character separator\\nprintln(tokens)\\nlet result = \\\".\\\".join(tokens)\\nprintln(result)\\n\",\n \"language\": \"Swift\"\n },\n {\n \"code\": \"import Foundation\\n\\nlet text = \\\"Hello,How,Are,You,Today\\\"\\nlet tokens = text.componentsSeparatedByString(\\\",\\\")\\nprint(tokens)\\n\",\n \"language\": \"Swift\"\n },\n {\n \"code\": \"split $string \\\",\\\"\\n\",\n \"language\": \"Tcl\"\n },\n {\n \"code\": \"join $list \\\".\\\"\\n\",\n \"language\": \"Tcl\"\n },\n {\n \"code\": \"puts [join [split \\\"Hello,How,Are,You,Today\\\" \\\",\\\"] \\\".\\\"]\\n\",\n \"language\": \"Tcl\"\n },\n {\n \"code\": \"puts [join [set words [split \\\"Hello,How,Are,You,Today\\\" \\\",\\\"]] \\\".\\\"]\\n\",\n \"language\": \"Tcl\"\n },\n {\n \"code\": \"#lang transd\\n\\nMainModule: {\\n_start: (lambda locals: s \\\"Hello,How,Are,You,Today\\\"\\n (textout (join (split s \\\",\\\") \\\".\\\"))\\n)\\n}\\n\",\n \"language\": \"Transd\"\n },\n {\n \"code\": \"$$ MODE TUSCRIPT\\nSET string=\\\"Hello,How,Are,You,Today\\\"\\nSET string=SPLIT (string,\\\":,:\\\")\\nSET string=JOIN (string,\\\".\\\")\\n\",\n \"language\": \"TUSCRIPT\"\n },\n {\n \"code\": \"@(next :list \\\"Hello,How,Are,You,Today\\\")\\n@(coll)@{token /[^,]+/}@(end)\\n@(output)\\n@(rep)@token.@(last)@token@(end)\\n@(end)\\n\",\n \"language\": \"TXR\"\n },\n {\n \"code\": \"@(next :list \\\"Hello,How,Are,You,Today\\\")\\n@(coll)@(maybe)@token,@(or)@token@(end)@(end)\\n@(output)\\n@(rep)@token.@(last)@token@(end)\\n@(end)\\n\",\n \"language\": \"TXR\"\n },\n {\n \"code\": \"txr -p '(cat-str (split-str \\\"Hello,How,Are,You,Today\\\" \\\",\\\") \\\".\\\")'\\nHello.How.Are.You.Today\\n\",\n \"language\": \"TXR\"\n },\n {\n \"code\": \"string='Hello,How,Are,You,Today'\\n\\n(IFS=,\\n printf '%s.' $string\\n echo)\\n\",\n \"language\": \"UNIX-Shell\"\n },\n {\n \"code\": \"#! /bin/bash\\nstripchar-l ()\\n#removes the specified character from the left side of the string\\n#USAGE: stripchar \\\"stuff\\\" \\\"s\\\" --> tuff\\n{\\n string=\\\"$1\\\";\\n string=${string#\\\"$2\\\"};\\n\\n echo \\\"$string\\\"\\n}\\n\\njoin ()\\n#join a string of characters on a specified delimiter\\n#USAGE: join \\\"1;2;3;4\\\" \\\";\\\" \\\",\\\" --> 1,2,3,4\\n{\\n local result=\\\"\\\";\\n local list=\\\"$1\\\";\\n OLDIFS=\\\"$IFS\\\";\\n local IFS=${2-\\\" \\\"};\\n local output_field_seperator=${3-\\\" \\\"};\\n\\n for element in $list;\\n do\\n result=\\\"$result$output_field_seperator$element\\\";\\n done;\\n\\n result=\\\"`stripchar-l \\\"$result\\\" \\\"$output_field_seperator\\\"`\\\";\\n echo \\\"$result\\\";\\n IFS=\\\"$OLDIFS\\\"\\n}\\n\\nsplit ()\\n{\\n#split a string of characters on a specified delimiter\\n#USAGE: split \\\"1;2;3;4\\\" \\\";\\\" --> 1 2 3 4\\t\\n local list=\\\"$1\\\";\\n local input_field_seperator=${2-\\\" \\\"};\\n local output_field_seperator=\\\" \\\";\\n\\n #defined in terms of join\\n join \\\"$list\\\" \\\"$input_field_seperator\\\" \\\"$output_field_seperator\\\"\\n}\\n\\nstrtokenize ()\\n{\\n#splits up a string of characters into tokens,\\n#based on a user supplied delimiter\\n#USAGE:strtokenize \\\"1;2;3;4\\\" \\\";\\\" \\\":\\\" --> 1:2:3:4\\n local list=\\\"$1\\\";\\n\\tlocal input_delimiter=${2-\\\" \\\"};\\n\\tlocal output_delimiter=${3-\\\" \\\"};\\n\\tlocal contains_a_space=\\\" \\\"; #added to highlight the use\\n #of \\\" \\\" as an argument to join\\t\\n\\n #splits it input then joins it with a user supplied delimiter\\n join \\\"$( split \\\"$list\\\" \\\"$input_delimiter\\\" )\\\" \\\\\\n \\\"$contains_a_space\\\" \\\"$output_delimiter\\\";\\n}\\n\",\n \"language\": \"UNIX-Shell\"\n },\n {\n \"code\": \" strtokenize \\\"Hello,How,Are,You,Today\\\" \\\",\\\" \\\".\\\"\\n Hello.How.Are.You.Today\\n\",\n \"language\": \"UNIX-Shell\"\n },\n {\n \"code\": \"string1=\\\"Hello,How,Are,You,Today\\\"\\nelements_quantity=$(echo $string1|tr \\\",\\\" \\\"\\\\n\\\"|wc -l)\\n\\npresent_element=1\\nwhile [ $present_element -le $elements_quantity ];do\\necho $string1|cut -d \\\",\\\" -f $present_element|tr -d \\\"\\\\n\\\"\\nif [ $present_element -lt $elements_quantity ];then echo -n \\\".\\\";fi\\npresent_element=$(expr $present_element + 1)\\ndone\\necho\\n\\n# or to cheat\\necho \\\"Hello,How,Are,You,Today\\\"|tr \\\",\\\" \\\".\\\"\\n\",\n \"language\": \"UNIX-Shell\"\n },\n {\n \"code\": \"token() {\\n (IFS=, read -r A B; echo \\\"$A\\\".; test -n \\\"$B\\\" && (echo \\\"$B\\\" | token))\\n}\\n\\necho \\\"Hello,How,Are,You\\\" | token\\n\",\n \"language\": \"UnixPipes\"\n },\n {\n \"code\": \"decl string text\\nset text \\\"Hello,How,Are,You,Today\\\"\\ndecl string<> tokens\\nset tokens (split text \\\",\\\")\\nfor (decl int i) (< i (size tokens)) (inc i)\\n out tokens<i> \\\".\\\" console\\nend for\\nout endl console\\n\",\n \"language\": \"Ursa\"\n },\n {\n \"code\": \"#import std\\n\\ntoken_list = sep`, 'Hello,How,Are,You,Today'\\n\\n#cast %s\\n\\nmain = mat`. token_list\\n\",\n \"language\": \"Ursala\"\n },\n {\n \"code\": \"// Tokenize a string, in V (Vlang)\\n// Tectonics: v run tokenize-a-string.v\\nmodule main\\n\\n// starts here\\npub fn main() {\\n println(\\\"Hello,How,Are,You,Today\\\".split(',').join('.'))\\n}\\n\",\n \"language\": \"V-(Vlang)\"\n },\n {\n \"code\": \"void main() {\\n string s = \\\"Hello,How,Are,You,Today\\\";\\n print(@\\\"$(string.joinv(\\\".\\\", s.split(\\\",\\\")))\\\");\\n}\\n\",\n \"language\": \"Vala\"\n },\n {\n \"code\": \"Sub Main()\\nDim temp() As String\\n temp = Tokenize(\\\"Hello,How,Are,You,Today\\\", \\\",\\\")\\n Display temp, Space(5)\\nEnd Sub\\n\\nPrivate Function Tokenize(strS As String, sep As String) As String()\\n Tokenize = Split(strS, sep)\\nEnd Function\\n\\nPrivate Sub Display(arr() As String, sep As String)\\n Debug.Print Join(arr, sep)\\nEnd Sub\\n\",\n \"language\": \"VBA\"\n },\n {\n \"code\": \"s = \\\"Hello,How,Are,You,Today\\\"\\nWScript.StdOut.Write Join(Split(s,\\\",\\\"),\\\".\\\")\\n\",\n \"language\": \"VBScript\"\n },\n {\n \"code\": \"Buf_Switch(Buf_Free)\\nIns_Text(\\\"Hello,How,Are,You,Today\\\")\\n\\n// Split the text into text registers 10, 11, ...\\nBOF\\n#1 = 9\\nRepeat(ALL) {\\n #1++\\n #2 = Cur_Pos\\n Search(\\\",\\\", ADVANCE+ERRBREAK)\\n Reg_Copy_Block(#1, #2, Cur_Pos-1)\\n}\\nReg_Copy_Block(#1, #2, EOB_Pos)\\n\\n// Display the list\\nfor (#3 = 10; #3 <= #1; #3++) {\\n Reg_Type(#3) Message(\\\".\\\")\\n}\\n\\nBuf_Quit(OK)\\n\",\n \"language\": \"Vedit-macro-language\"\n },\n {\n \"code\": \"Sub Main()\\n Dim parseMe As String, parsed As Variant\\n parseMe = \\\"Hello,How,Are,You,Today\\\"\\n\\n parsed = Split(parseMe, \\\",\\\")\\n\\n Dim L0 As Long, outP As String\\n outP = parsed(0)\\n For L0 = 1 To UBound(parsed)\\n outP = outP & \\\".\\\" & parsed(L0)\\n Next\\n\\n MsgBox outP\\nEnd Sub\\n\",\n \"language\": \"Visual-Basic\"\n },\n {\n \"code\": \"@join \\\".\\\" @split \\\",\\\" \\\"Hello,How,Are,You,Today\\\"\\n\",\n \"language\": \"Wortel\"\n },\n {\n \"code\": \"var s = \\\"Hello,How,Are,You,Today\\\"\\nvar t = s.split(\\\",\\\").join(\\\".\\\") + \\\".\\\"\\nSystem.print(t)\\n\",\n \"language\": \"Wren\"\n },\n {\n \"code\": \"string-join(tokenize(\\\"Hello,How,Are,You,Today\\\", \\\",\\\"), \\\".\\\")\\n\",\n \"language\": \"XPath-2.0\"\n },\n {\n \"code\": \"string 0;\\ninclude c:\\\\cxpl\\\\codes;\\nint I, J, K, Char;\\nchar String, Array(5,6); \\\\5 words and 5 maximum chars + terminating 0\\n\\n[String:= \\\"Hello,How,Are,You,Today\\\";\\nI:= 0; K:= 0;\\nrepeat J:= 0;\\n loop [Char:= String(I);\\n I:= I+1;\\n if Char=^, or Char=0 then quit;\\n Array(K,J):= Char;\\n J:= J+1;\\n ];\\n Array(K,J):= 0; \\\\terminate word\\n K:= K+1; \\\\next word in array\\nuntil K>=5;\\nfor K:= 4 downto 0 do [Text(0, addr Array(K,0)); ChOut(0, ^.)];\\nCrLf(0);\\n]\\n\",\n \"language\": \"XPL0\"\n },\n {\n \"code\": \"dim s$(1)\\n\\nn = token(\\\"Hello. How are you today?\\\", s$(), \\\".? \\\")\\n\\nfor i = 1 to n\\n\\tprint s$(i);\\n\\tif i < n print \\\".\\\";\\nnext\\nprint\\n\",\n \"language\": \"Yabasic\"\n },\n {\n \"code\": \"const std = @import(\\\"std\\\");\\npub fn main() void {\\n const string = \\\"Hello,How,Are,You,Today\\\";\\n var tokens = std.mem.split(u8, string, \\\",\\\");\\n std.debug.print(\\\"{s}\\\", .{tokens.next().?});\\n while (tokens.next()) |token| {\\n std.debug.print(\\\".{s}\\\", .{token});\\n }\\n}\\n\",\n \"language\": \"Zig\"\n },\n {\n \"code\": \"\\\"Hello,How,Are,You,Today\\\".split(\\\",\\\").concat(\\\".\\\").println();\\nHello.How.Are.You.Today\\n\",\n \"language\": \"Zkl\"\n },\n {\n \"code\": \"program: tokenize_a_string\\n input: \\\"Hello,How,Are,You,Today\\\"\\n output: \\\"Hello.How.Are.You.Today\\\"\\n\",\n \"language\": \"Zoea\"\n }\n]","isConversational":false},"task_name":{"kind":"string","value":"Tokenize-a-string"}}},{"rowIdx":1761,"cells":{"solutions":{"kind":"list like","value":[{"code":"---\nfrom: http://rosettacode.org/wiki/Tokenize_a_string_with_escaping\nnote: String manipulation\n","language":"00-META"},{"code":"{{task heading}}\nWrite a function or program that can split a string at each non-escaped occurrence of a separator character.\n\nIt should accept three input parameters:\n:::* The <b>string</b>\n:::* The <b>separator character</b>\n:::* The <b>escape character</b>\n\n<br>\nIt should output a list of strings.\n\n{{task heading|Details}}\n\nRules for splitting:\n* The fields that were separated by the separators, become the elements of the output list.\n* Empty fields should be preserved, even at the start and end.\n\n<br>\nRules for escaping:\n* \"Escaped\" means preceded by an occurrence of the escape character that is not already escaped itself.\n* When the escape character precedes a character that has no special meaning, it still counts as an escape (but does not do anything special).\n* Each occurrence of the escape character that was used to escape something, should '''not''' become part of the output.\n\n\n{{task heading|Test case}}\nDemonstrate that your function satisfies the following test-case:\n{| class=\"wikitable\"\n|-\n! Input\n! Output\n|-\n| style=\"vertical-align:top\" |\n{| style=\"border-collapse:collapse; border:none\" border=\"0\"\n|-\n| style=\"border:none; text-align:right\" | string:\n| style=\"border:none\" | <pre style=\"display:inline;padding:0.1em;margin:0.3em;\">one^|uno||three^^^^|four^^^|^cuatro|</pre>\n|-\n| style=\"border:none; text-align:right\" | separator character:\n| style=\"border:none\" | <pre style=\"display:inline;padding:0.1em;margin:0.3em;\">|</pre>\n|-\n| style=\"border:none; text-align:right\" | escape character:\n| style=\"border:none\" | <pre style=\"display:inline;padding:0.1em;margin:0.3em;\">^</pre>\n|}\n|\n{| style=\"border-collapse:collapse; border:none\" border=\"0\"\n|-\n| style=\"border:none\" | <pre style=\"display:inline;padding:0.1em;margin:0.3em;\">one|uno</pre>\n|-\n| style=\"border:none\" | <pre style=\"display:inline;padding:0.1em;margin:0.3em;\"></pre>\n|-\n| style=\"border:none\" | <pre style=\"display:inline;padding:0.1em;margin:0.3em;\">three^^</pre>\n|-\n| style=\"border:none\" | <pre style=\"display:inline;padding:0.1em;margin:0.3em;\">four^|cuatro</pre>\n|-\n| style=\"border:none\" | <pre style=\"display:inline;padding:0.1em;margin:0.3em;\"></pre>\n|}\n|}\n\n(Print the output list in any format you like, as long as it is it easy to see what the fields are.)\n\n{{Template:Strings}}\n<br><br>\n\n","language":"00-TASK"},{"code":"F token_with_escape(a, escape = ‘^’, separator = ‘|’)\n [String] result\n V token = ‘’\n V state = 0\n L(c) a\n I state == 0\n I c == escape\n state = 1\n E I c == separator\n result.append(token)\n token = ‘’\n E\n token ‘’= c\n E I state == 1\n token ‘’= c\n state = 0\n result.append(token)\n R result\n\nprint(token_with_escape(‘one^|uno||three^^^^|four^^^|^cuatro|’).map(s -> ‘'’s‘'’).join(‘, ’))\n","language":"11l"},{"code":"\torg\t100h\n\tjmp\tdemo\n\t;;;\tRoutine to split a 0-terminated string\n\t;;;\tInput: B=separator, C=escape, HL=string pointer.\n\t;;;\tOutput: DE=end of list of strings\n\t;;;\tThe split strings are stored in place.\nsplit:\tmov\td,h\t; Set DE = output pointer\n\tmov\te,l\nsnext:\tmov\ta,m\t; Get current input character\n\tinx\th\t; Advance input pointer\n\tstax\td\t; Write character at output pointer\n\tana\ta\t; If zero, we are done\n\trz\n\tcmp\tc\t; Is it the escape character?\n\tjz\tsesc\n\tcmp\tb\t; Is it the separator character?\n\tjz\tssep\n\tinx\td\t; Otherwise, advance output pointer,\n\tjmp\tsnext\t; and get the next character\nsesc:\tmov\ta,m\t; Store the escaped character without\n\tinx\th\t; checking for anything except zero.\n\tstax\td\n\tinx\td\n\tana\ta\t; Zero is still end of string\n\trz\n\tjmp\tsnext\nssep:\txra \ta\t; End of string, write zero terminator\n\tstax\td\n\tinx\td\n\tjmp\tsnext\n\t;;;\tUse the routine to split the test-case string\ndemo:\tmvi\tb,'|'\t; Separator character\n\tmvi\tc,'^'\t; Escape character\n\tlxi\th,test\t; Pointer to test string\n\tcall\tsplit\n\t;;;\tPrint each string on its own line\n\tlxi\th,test\nstr:\tcall\tputs\t; Print string\n\tcall\tcmp16\t; Are we there yet?\n\tjnc\tstr\t; If not, print the next string\n\tret\n\t;;;\t16-bit compare\ncmp16:\tmov\ta,d\n\tcmp\th\n\trnz\n\tmov\ta,e\n\tcmp\tl\n\tret\n\t;;;\tPrint zero-terminated string with newline\nputs:\tpush\td\t; Keep DE registers\n\tpush\th\t; Keep pointer\n\tlxi \td,pfx\t; Print prefix\n\tmvi\tc,9\n\tcall\t5\n\tpop\th\t; Restore pointer\nploop:\tmov\te,m\t; Get current character\n\tpush\th\t; Keep pointer\n\tmvi\tc,2\t; CP/M print character\n\tcall\t5\n\tpop\th\t; Restore pointer\n\tmov\ta,m\t; Is character zero?\n\tora\ta\n\tinx\th\t; Increment pointer\n\tjnz\tploop\t; If not, there are more characters\n\tpush\th\t; Keep pointer\n\tlxi\td,nl\t; Write newline\n\tmvi\tc,9\t; CP/M print string\n\tcall\t5\n\tpop\th\n\tpop\td\t; Restore DE registers\n\tret\npfx:\tdb\t'> $'\t; Prefix to make the output more obvious\nnl:\tdb\t13,10,'$'\ntest:\tdb\t'one^|uno||three^^^^|four^^^|^cuatro|',0\n","language":"8080-Assembly"},{"code":"DEFINE PTR=\"CARD\"\n\nTYPE Tokens=[\n PTR buf ;BYTE ARRAY\n PTR arr ;CARD ARRAY\n PTR endPtr\n BYTE count]\n\nPROC Init(Tokens POINTER t BYTE ARRAY b PTR ARRAY a)\n t.buf=b\n t.arr=a\n t.endPtr=b\n t.count=0\nRETURN\n\nPROC AddToken(Tokens POINTER t CHAR ARRAY s)\n PTR ARRAY a\n CHAR ARRAY tmp\n\n a=t.arr\n tmp=t.endPtr\n SCopy(tmp,s)\n a(t.count)=tmp\n t.count==+1\n t.endPtr=t.endPtr+s(0)+1\nRETURN\n\nPROC PrintTokens(Tokens POINTER t)\n BYTE i\n PTR ARRAY a\n\n a=t.arr\n FOR i=0 TO t.count-1\n DO\n PrintF(\"\"\"%S\"\"%E\",a(i))\n OD\nRETURN\n\nPROC Append(CHAR ARRAY s CHAR c)\n s(0)==+1\n s(s(0))=c\nRETURN\n\nPROC Tokenize(CHAR ARRAY s CHAR sep,esc Tokens POINTER res)\n BYTE ARRAY b(200)\n PTR ARRAY a(20)\n CHAR ARRAY tmp(255)\n BYTE i,isEsc\n CHAR c\n\n Init(res,b,a)\n isEsc=0\n tmp(0)=0\n FOR i=1 TO s(0)\n DO\n c=s(i)\n IF isEsc THEN\n isEsc=0\n Append(tmp,c)\n ELSE\n IF c=esc THEN\n isEsc=1\n ELSEIF c=sep THEN\n AddToken(res,tmp)\n tmp(0)=0\n ELSE\n Append(tmp,c)\n FI\n FI\n OD\n AddToken(res,tmp)\nRETURN\n\nPROC Main()\n Tokens t\n\n Tokenize(\"one^|uno||three^^^^|four^^^|^cuatro|\",'|,'^,t)\n PrintTokens(t)\nRETURN\n","language":"Action-"},{"code":"with Ada.Text_Io;\nwith Ada.Containers.Indefinite_Vectors;\nwith Ada.Strings.Unbounded;\n\nprocedure Tokenize is\n\n package String_Vectors is\n new Ada.Containers.Indefinite_Vectors (Positive, String);\n use String_Vectors;\n\n function Split (Text : String;\n Separator : Character := '|';\n Escape : Character := '^') return Vector\n is\n use Ada.Strings.Unbounded;\n Result : Vector;\n Escaped : Boolean := False;\n Accu : Unbounded_String;\n begin\n\n for Char of Text loop\n\n case Escaped is\n\n when False =>\n if Char = Escape then\n Escaped := True;\n elsif Char = Separator then\n Append (Result, To_String (Accu));\n Accu := Null_Unbounded_String;\n else\n Append (Accu, Char);\n end if;\n\n when True =>\n Append (Accu, Char);\n Escaped := False;\n\n end case;\n\n end loop;\n Append (Result, To_String (Accu));\n\n return Result;\n end Split;\n\n procedure Put_Vector (List : Vector) is\n use Ada.Text_Io;\n begin\n for Element of List loop\n Put (\"'\"); Put (Element); Put (\"'\"); New_Line;\n end loop;\n end Put_Vector;\n\nbegin\n Put_Vector (Split (\"one^|uno||three^^^^|four^^^|^cuatro|\"));\nend Tokenize;\n","language":"Ada"},{"code":"BEGIN\n # returns s parsed according to delimiter and escape #\n PROC parse with escapes = ( STRING s, CHAR delimiter, escape )[]STRING:\n IF ( UPB s - LWB s ) + 1 < 1 THEN\n # empty string #\n [ 1 : 0 ]STRING empty array;\n empty array\n ELSE\n # at least one character #\n # allow for a string composed entirely of delimiter characters #\n [ 1 : ( UPB s - LWB s ) + 3 ]STRING result;\n INT r pos := 1;\n INT s pos := LWB s;\n result[ r pos ] := \"\";\n WHILE s pos <= UPB s DO\n CHAR c = s[ s pos ];\n IF c = delimiter THEN\n # start a new element #\n result[ r pos +:= 1 ] := \"\"\n ELIF c = escape THEN\n # use the next character even if it is an escape #\n s pos +:= 1;\n IF s pos < UPB s THEN\n # the escape is not the last character #\n result[ r pos ] +:= s[ s pos ]\n FI\n ELSE\n # normal character #\n result[ r pos ] +:= c\n FI;\n s pos +:= 1\n OD;\n result[ 1 : r pos ]\n FI; # parse with escapes #\n # task test case #\n []STRING tokens = parse with escapes( \"one^|uno||three^^^^|four^^^|^cuatro|\", \"|\", \"^\" );\n FOR t pos FROM LWB tokens TO UPB tokens DO print( ( \"[\", tokens[ t pos ], \"]\", newline ) ) OD\nEND\n","language":"ALGOL-68"},{"code":"------------------ TOKENIZE WITH ESCAPING ----------------\n\n-- tokenize :: String -> Character -> Character -> [String]\non tokenize(str, delimChar, chrEsc)\n\n script charParse\n -- Record: {esc:Bool, token:String, tokens:[String]}\n -- charParse :: Record -> Character -> Record\n on |λ|(a, x)\n set blnEsc to esc of a\n set blnEscChar to ((not blnEsc) and (x = chrEsc))\n\n if ((not blnEsc) and (x = delimChar)) then\n set k to \"\"\n set ks to (tokens of a) & token of a\n else\n set k to (token of a) & cond(blnEscChar, \"\", x)\n set ks to tokens of (a)\n end if\n\n {esc:blnEscChar, token:k, tokens:ks}\n end |λ|\n end script\n\n set recParse to foldl(charParse, ¬\n {esc:false, token:\"\", tokens:[]}, splitOn(\"\", str))\n\n tokens of recParse & token of recParse\nend tokenize\n\n\n--------------------------- TEST -------------------------\non run\n script numberedLine\n on |λ|(a, s)\n set iLine to lineNum of a\n {lineNum:iLine + 1, report:report of a & iLine & \":\" & tab & s & linefeed}\n end |λ|\n end script\n\n report of foldl(numberedLine, {lineNum:1, report:\"\"}, ¬\n tokenize(\"one^|uno||three^^^^|four^^^|^cuatro|\", \"|\", \"^\"))\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-- 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-- splitOn :: String -> String -> [String]\non splitOn(pat, src)\n set {dlm, my text item delimiters} to ¬\n {my text item delimiters, pat}\n set xs to text items of src\n set my text item delimiters to dlm\n return xs\nend splitOn\n\n\n-- cond :: Bool -> a -> a -> a\non cond(bool, f, g)\n if bool then\n f\n else\n g\n end if\nend cond\n","language":"AppleScript"},{"code":"tokenize: function [s sep esc][\n\tescaping: 0\n\n\tloop 0..(size s)-1 [i][\n\t\tchr: get split s i\n\n\t\tif? escaping=1 [\n\t\t\tprints chr\n\t\t\tescaping: 0\n\t\t]\n\t\telse [\n\t\t\tcase [chr]\n\t\t\t\twhen? [=sep] [print \"\"]\n\t\t\t\twhen? [=esc] [escaping: 1]\n\t\t\t\telse [prints chr]\n\t\t]\n\t]\n\tprint \"\"\n]\n\nstr: \"one^|uno||three^^^^|four^^^|^cuatro|\"\ntokenize str \"|\" \"^\"\n","language":"Arturo"},{"code":"Tokenize(s,d,e){\n\tfor i,v in x:=StrSplit(StrReplace(StrReplace(StrReplace(s,e e,Chr(0xFFFE)),e d,Chr(0xFFFF)),e),d)\n\t\tx[i]:=StrReplace(StrReplace(v,Chr(0xFFFE),e),Chr(0xFFFF),d)\n\treturn x\n}\n","language":"AutoHotkey"},{"code":"str := \"one^|uno||three^^^^|four^^^|^cuatro|\"\nfor i, v in Tokenize(str, \"|\", \"^\")\n\toutput .= i \" : \" v \"`n\"\nMsgBox % output\n","language":"AutoHotkey"},{"code":"REM >tokenizer\nPROC_tokenize(\"one^|uno||three^^^^|four^^^|^cuatro|\", \"|\", \"^\")\nEND\n:\nDEF PROC_tokenize(src$, sep$, esc$)\nLOCAL field%, char$, escaping%, i%\nfield% = 1\nescaping% = FALSE\nPRINT field%; \" \";\nFOR i% = 1 TO LEN src$\n char$ = MID$(src$, i%, 1)\n IF escaping% THEN\n PRINT char$;\n escaping% = FALSE\n ELSE\n CASE char$ OF\n WHEN sep$\n PRINT\n field% += 1\n PRINT field%; \" \";\n WHEN esc$\n escaping% = TRUE\n OTHERWISE\n PRINT char$;\n ENDCASE\n ENDIF\nNEXT\nPRINT\nENDPROC\n","language":"BBC-BASIC"},{"code":"str ← \"one^|uno||three^^^^|four^^^|^cuatro|\"\nSplit ← ((⊢-˜+`׬)∘=⊔⊢)\nSplitE ← {\n esc ← <`'^'=𝕩\n rem ← »esc\n spl ← (¬rem)∧'|'=𝕩\n 𝕩⊔˜(⊢-(esc∨spl)×1⊸+)+`spl\n}\n\n•Show SplitE str\n","language":"BQN"},{"code":"⟨ \"one|uno\" ⟨⟩ \"three^^\" \"four^|cuatro\" ⟩\n","language":"BQN"},{"code":"#include <stdlib.h>\n#include <stdio.h>\n\n#define STR_DEMO \"one^|uno||three^^^^|four^^^|^cuatro|\"\n#define SEP '|'\n#define ESC '^'\n\ntypedef char* Str; /* just for an easier reading */\n\n/* ===> FUNCTION PROTOTYPES <================================================ */\nunsigned int ElQ( const char *s, char sep, char esc );\nStr *Tokenize( char *s, char sep, char esc, unsigned int *q );\n\n/*==============================================================================\nMain function.\nJust passes a copy of the STR_DEMO string to the tokenization function and shows\nthe results.\n==============================================================================*/\n\nint main() {\n char s[] = STR_DEMO;\n unsigned int i, q;\n\n Str *list = Tokenize( s, SEP, ESC, &q );\n\n if( list != NULL ) {\n printf( \"\\n Original string: %s\\n\\n\", STR_DEMO );\n printf( \" %d tokens:\\n\\n\", q );\n\n for( i=0; i<q; ++i )\n printf( \" %4d. %s\\n\", i+1, list[i] );\n\n free( list );\n }\n\n return 0;\n}\n\n/*==============================================================================\n\"ElQ\" stands for \"Elements Quantity\". Counts the amount of valid element in the\nstring s, according to the separator character provided in sep and the escape\ncharacter provided in esc.\n==============================================================================*/\n\nunsigned int ElQ( const char *s, char sep, char esc ) {\n unsigned int q, e;\n const char *p;\n\n for( e=0, q=1, p=s; *p; ++p ) {\n if( *p == esc )\n e = !e;\n else if( *p == sep )\n q += !e;\n else e = 0;\n }\n\n return q;\n}\n\n/*==============================================================================\nThe actual tokenization function.\nAllocates as much dynamic memory as needed to contain the pointers to the\ntokenized portions of the string passed as the \"s\" parameter, then looks for the\nseparators characters sep, paying attention to the occurrences of the escape\ncharacter provided in esc. When a valid separator is found, the function swaps\nit with a '\\0' terminator character and stores the pointer to the next string\ninto the array of pointers in dynamic memory. On output, the value of *q is the\nnumber of pointers in the array. The caller is responsible for deallocating with\nfree() the returned array of pointers when it is no longer needed.\nIn case of failure, NULL is returned.\n==============================================================================*/\n\nStr *Tokenize( char *s, char sep, char esc, unsigned int *q ) {\n Str *list = NULL;\n\n *q = ElQ( s, sep, esc );\n list = malloc( *q * sizeof(Str) );\n\n if( list != NULL ) {\n unsigned int e, i;\n char *p;\n\n i = 0;\n list[i++] = s;\n\n for( e=0, p=s; *p; ++p ) {\n if( *p == esc ) {\n e = !e;\n }\n else if( *p == sep && !e ) {\n list[i++] = p+1;\n *p = '\\0';\n }\n else {\n e = 0;\n }\n }\n }\n\n return list;\n}\n","language":"C"},{"code":"#include <iostream>\n#include <stdexcept>\n#include <string>\n#include <vector>\n\nusing namespace std;\n\nvector<string> tokenize(const string& input, char seperator, char escape) {\n vector<string> output;\n string token;\n\n bool inEsc = false;\n for (char ch : input) {\n if (inEsc) {\n inEsc = false;\n } else if (ch == escape) {\n inEsc = true;\n continue;\n } else if (ch == seperator) {\n output.push_back(token);\n token = \"\";\n continue;\n }\n token += ch;\n }\n if (inEsc)\n throw new invalid_argument(\"Invalid terminal escape\");\n\n output.push_back(token);\n return output;\n}\n\nint main() {\n string sample = \"one^|uno||three^^^^|four^^^|^cuatro|\";\n\n cout << sample << endl;\n cout << '[';\n for (auto t : tokenize(sample, '|', '^')) {\n cout << '\"' << t << \"\\\", \";\n }\n cout << ']' << endl;\n\n return 0;\n}\n","language":"C++"},{"code":"using System;\nusing System.Text;\nusing System.Collections.Generic;\n\npublic class TokenizeAStringWithEscaping\n{\n public static void Main() {\n string testcase = \"one^|uno||three^^^^|four^^^|^cuatro|\";\n foreach (var token in testcase.Tokenize(separator: '|', escape: '^')) {\n Console.WriteLine(\": \" + token); //Adding a : so we can see empty lines\n }\n }\n}\n\npublic static class Extensions\n{\n public static IEnumerable<string> Tokenize(this string input, char separator, char escape) {\n if (input == null) yield break;\n var buffer = new StringBuilder();\n bool escaping = false;\n foreach (char c in input) {\n if (escaping) {\n buffer.Append(c);\n escaping = false;\n } else if (c == escape) {\n escaping = true;\n } else if (c == separator) {\n yield return buffer.Flush();\n } else {\n buffer.Append(c);\n }\n }\n if (buffer.Length > 0 || input[input.Length-1] == separator) yield return buffer.Flush();\n }\n\n public static string Flush(this StringBuilder stringBuilder) {\n string result = stringBuilder.ToString();\n stringBuilder.Clear();\n return result;\n }\n}\n","language":"C-sharp"},{"code":"tokenize = iter (sep, esc: char, s: string) yields (string)\n escape: bool := false\n part: array[char] := array[char]$[]\n for c: char in string$chars(s) do\n if escape then\n escape := false\n array[char]$addh(part,c)\n elseif c=esc then\n escape := true\n elseif c=sep then\n yield(string$ac2s(part))\n part := array[char]$[]\n else\n array[char]$addh(part,c)\n end\n end\n yield(string$ac2s(part))\nend tokenize\n\nstart_up = proc ()\n po: stream := stream$primary_output()\n testcase: string := \"one^|uno||three^^^^|four^^^|^quatro|\"\n\n for part: string in tokenize('|', '^', testcase) do\n stream$putl(po, \"\\\"\" || part || \"\\\"\")\n end\nend start_up\n","language":"CLU"},{"code":" >>SOURCE FORMAT FREE\nidentification division.\nprogram-id. 'tokenizewithescaping'.\nenvironment division.\nconfiguration section.\nrepository.\n function all intrinsic.\ndata division.\nworking-storage section.\n\n01 escape-char pic x value '^'.\n01 separator-char pic x value '|'.\n01 reference-string pic x(64) value\n 'one^|uno||three^^^^|four^^^|^cuatro|'.\n\n01 input-string pic x(64).\n01 c pic 99.\n01 escaped pic x.\n\n01 t pic 99.\n01 t-max pic 99.\n01 t-lim pic 99 value 32.\n01 token-entry occurs 32.\n 03 token-len pic 99.\n 03 token pic x(16).\n\n01 l pic 99.\n01 l-lim pic 99 value 16.\n\n01 error-found pic x.\n\nprocedure division.\nstart-tokenize-with-escaping.\n\n move reference-string to input-string\n perform tokenize\n\n move 'token' to input-string\n perform tokenize\n\n move '^^^^^^^^' to input-string\n perform tokenize\n\n move '||||||||' to input-string\n perform tokenize\n\n move all 'token' to input-string\n perform tokenize\n\n move all 't|' to input-string\n perform tokenize\n\n move spaces to input-string\n perform tokenize\n\n display space\n\n stop run\n .\ntokenize.\n display space\n display 'string:'\n display input-string\n\n move 'N' to escaped error-found\n move 1 to t-max\n initialize token-entry(t-max)\n move 0 to l\n\n perform varying c from 1 by 1 until\n c > length(input-string)\n or input-string(c:) = spaces\n\n evaluate escaped also input-string(c:1)\n when 'N' also escape-char\n move 'Y' to escaped\n when 'N' also separator-char\n perform increment-t-max\n if error-found = 'Y'\n exit paragraph\n end-if\n when 'N' also any\n perform move-c\n if error-found = 'Y'\n exit paragraph\n end-if\n when 'Y' also any\n perform move-c\n if error-found = 'Y'\n exit paragraph\n end-if\n move 'N' to escaped\n end-evaluate\n\n end-perform\n if l > 0\n move l to token-len(t-max)\n end-if\n\n if c = 1\n display 'no tokens'\n else\n display 'tokens:'\n perform varying t from 1 by 1 until t > t-max\n if token-len(t) > 0\n display t ': ' token-len(t) space token(t)\n else\n display t ': ' token-len(t)\n end-if\n end-perform\n end-if\n .\nincrement-t-max.\n if t-max >= t-lim\n display 'error: at ' c ' number of tokens exceeds ' t-lim\n move 'Y' to error-found\n else\n move l to token-len(t-max)\n add 1 to t-max\n initialize token-entry(t-max)\n move 0 to l\n move 'N' to error-found\n end-if\n .\nmove-c.\n if l >= l-lim\n display 'error: at ' c ' token length exceeds ' l-lim\n move 'Y' to error-found\n else\n add 1 to l\n move input-string(c:1) to token(t-max)(l:1)\n move 'N' to error-found\n end-if\n .\nend program 'tokenizewithescaping'.\n","language":"COBOL"},{"code":"(defun split (input separator escape)\n (flet ((make-string-buffer ()\n (make-array 0 :element-type 'character :adjustable t :fill-pointer t)))\n (loop with token = (make-string-buffer)\n with result = nil\n with to-be-escaped = nil\n for ch across input\n do (cond (to-be-escaped\n (vector-push-extend ch token)\n (setf to-be-escaped nil))\n ((char= ch escape)\n (setf to-be-escaped t))\n ((char= ch separator)\n (push token result)\n (setf token (make-string-buffer)))\n (t\n (vector-push-extend ch token)))\n finally (push token result)\n (return (nreverse result)))))\n\n(defun main ()\n (dolist (token (split \"one^|uno||three^^^^|four^^^|^cuatro|\" #\\| #\\^))\n (format t \"'~A'~%\" token)))\n","language":"Common-Lisp"},{"code":"import std.stdio;\n\nvoid main() {\n string sample = \"one^|uno||three^^^^|four^^^|^cuatro|\";\n\n writeln(sample);\n writeln(tokenizeString(sample, '|', '^'));\n}\n\nauto tokenizeString(string source, char seperator, char escape) {\n import std.array : appender;\n import std.exception : enforce;\n\n auto output = appender!(string[]);\n auto token = appender!(char[]);\n\n bool inEsc;\n foreach(ch; source) {\n if (inEsc) {\n inEsc = false;\n } else if (ch == escape) {\n inEsc = true;\n continue;\n } else if (ch == seperator) {\n output.put(token.data.idup);\n token.clear();\n continue;\n }\n token.put(ch);\n }\n enforce(!inEsc, \"Invalid terminal escape\");\n\n output.put(token.data.idup);\n return output.data;\n}\n","language":"D"},{"code":"func String.Tokenize(separator, escape) {\n var buffer = []\n var escaping = false\n for c in this {\n if escaping {\n buffer.Add(c)\n escaping = false\n } else if c == escape {\n escaping = true\n } else if c == separator {\n yield buffer.Flush();\n } else {\n buffer.Add(c);\n }\n }\n\n if buffer.Length() > 0 || this[this.Length() - 1] == separator {\n yield buffer.Flush()\n }\n}\n\nfunc Array.Flush() {\n var str = String.Concat(values: this)\n this.Clear()\n str\n}\n\nlet testcase = \"one^|uno||three^^^^|four^^^|^cuatro|\";\nfor token in testcase.Tokenize(separator: '|', escape: '^') {\n print(\": \\(token)\")\n}\n","language":"Dyalect"},{"code":"import extensions;\nimport extensions'routines;\nimport system'collections;\nimport system'routines;\nimport system'text;\n\nextension op : String\n{\n tokenize(separator,escape)\n {\n auto buffer := new TextBuilder();\n auto list := new ArrayList();\n\n bool escaping := false;\n self.forEach::(ch)\n {\n if (escaping)\n {\n buffer.write(ch);\n escaping := false\n }\n else if (ch == escape)\n {\n escaping := true\n }\n else if (ch == separator)\n {\n list.append(buffer.Value);\n buffer.clear()\n }\n else\n {\n buffer.write(ch)\n }\n };\n\n ^ list\n }\n}\n\nconst string testcase = \"one^|uno||three^^^^|four^^^|^cuatro|\";\n\npublic program()\n{\n testcase.tokenize(\"|\", \"^\").forEach(printingLn)\n}\n","language":"Elena"},{"code":"open System\nopen System.Text.RegularExpressions\n\n(*\n .NET regexes have unlimited look-behind, so we can look for separators\n which are preceeded by an even number of (or no) escape characters\n*)\nlet split esc sep s =\n Regex.Split (\n s,\n String.Format(\"(?<=(?:\\b|[^{0}])(?:{0}{0})*){1}\", Regex.Escape(esc), Regex.Escape(sep))\n )\n\nlet unescape esc s =\n Regex.Replace(\n s,\n Regex.Escape(esc) + \"(.)\",\n \"$1\"\n )\n\n[<EntryPoint>]\nlet main argv =\n let (esc, sep) = (\"^\", \"|\")\n \"one^|uno||three^^^^|four^^^|^cuatro|\"\n |> split esc sep\n |> Seq.map (unescape esc)\n |> Seq.iter (fun s -> printfn \"'%s'\" s)\n 0\n","language":"F-Sharp"},{"code":"USING: accessors kernel lists literals namespaces\nparser-combinators prettyprint sequences strings ;\n\nSYMBOLS: esc sep ;\n\n: set-chars ( m n -- ) [ sep set ] [ esc set ] bi* ;\n: escape ( -- parser ) esc get 1token ;\n: escaped ( -- parser ) escape any-char-parser &> ;\n: separator ( -- parser ) sep get 1token ;\n\n: character ( -- parser )\n ${ esc get sep get } [ member? not ] curry satisfy ;\n\n: my-token ( -- parser ) escaped character <|> <*> ;\n\n: token-list ( -- parser )\n my-token separator list-of [ [ >string ] map ] <@ ;\n\n: tokenize ( str sep-char esc-char -- seq )\n set-chars token-list parse car parsed>> ;\n\n\"one^|uno||three^^^^|four^^^|^cuatro|\"\nCHAR: | CHAR: ^ tokenize .\n","language":"Factor"},{"code":"variable\t 'src\nvariable\t #src\nvariable offset\n\n: advance 1 offset +! ;\n: chr@ offset @ 'src @ + c@ ;\n: nextchr advance chr@ ;\n: bound offset @ #src @ u< ;\n: separator? dup [char] | = if drop cr else emit then ;\n: escape? dup [char] ^ = if drop nextchr emit else separator? then ;\n: tokenize 0 offset ! begin bound while nextchr escape? repeat ;\n\n\\ Test of function\nHere 'src ! ,\" one^|uno||three^^^^|four^^^|^cuatro|\" here 'src @ - #src !\npage\ncr .\" #### start ####\" cr tokenize cr .\" #### End ####\" cr\n","language":"Forth"},{"code":" SUBROUTINE SPLIT(TEXT,SEP,ESC)\t!Identifies and prints tokens from within a text.\n CHARACTER*(*) TEXT\t!To be scanned.\n CHARACTER*(1) SEP\t!The only separator for tokens.\n CHARACTER*(1) ESC\t!Miscegnator.\n CHARACTER*(LEN(TEXT)) TOKEN\t!Surely sufficient space.\n INTEGER N\t!Counts the tokens as they're found.\n INTEGER I\t!Steps through the text.\n INTEGER L\t!Length of the token so far accumulated.\n LOGICAL ESCAPING\t!Miscegnatory state.\n N = 0\t\t!No tokens so far.\n L = 0\t\t!Nor any text for the first.\n ESCAPING = .FALSE.\t!And the state is good.\n DO I = 1,LEN(TEXT)\t!Step through the text.\n IF (ESCAPING) THEN\t!Are we in a mess?\n L = L + 1\t\t\t!Yes. An ESC character had been seen.\n TOKEN(L:L) = TEXT(I:I)\t!So, whatever follows is taken as itself.\n ESCAPING = .FALSE.\t\t!There are no specially-recognised names.\n ELSE\t\t\t!Otherwise, we're in text to inspect.\n IF (TEXT(I:I).EQ.ESC) THEN\t!So, is it a troublemaker?\n ESCAPING = .TRUE.\t\t\t!Yes! Trouble is to follow.\n ELSE IF (TEXT(I:I).EQ.SEP) THEN\t!If instead a separator,\n CALL SPLOT\t\t\t\t!Then the token up to it is complete.\n ELSE\t\t\t!Otherwise, a simple constituent character.\n L = L + 1\t\t\t\t!So, count it in.\n TOKEN(L:L) = TEXT(I:I)\t\t!And copy it in.\n END IF\t\t\t!So much for grist.\n END IF\t\t!So much for that character.\n END DO\t\t\t!On to the next.\nCompletes on end-of-text with L > 0, or, if the last character had been SEP, a null token is deemed to be following.\n CALL SPLOT\t!Tail end.\n CONTAINS\t!Save on having two copies of this code.\n SUBROUTINE SPLOT\t!Show the token and scrub.\n N = N + 1\t\t\t!Another one.\n WRITE (6,1) N,TOKEN(1:L)\t!Reveal.\n 1 FORMAT (\"Token \",I0,\" >\",A,\"<\")!Fancy layout.\n L = 0\t\t\t\t!Prepare for a fresh token.\n END SUBROUTINE SPLOT\t!A brief life.\n END SUBROUTINE SPLIT\t!And then oblivion.\n\n PROGRAM POKE\n\n CALL SPLIT(\"one^|uno||three^^^^|four^^^|^cuatro|\",\"|\",\"^\")\n\n END\n","language":"Fortran"},{"code":"Sub tokenize(cadena As String, separador As String, escape As String)\n Dim As Integer campo = 1\n Dim As Boolean escapando = false\n Dim As String char\n Print \"\"; campo; \" \";\n\n For i As Integer = 1 To Len(cadena)\n char = Mid(cadena, i, 1)\n If escapando Then\n Print char;\n escapando = false\n Else\n Select Case char\n Case separador\n Print\n campo += 1\n Print \"\"; campo; \" \";\n Case escape\n escapando = true\n Case Else\n Print char;\n End Select\n End If\n Next i\n Print\nEnd Sub\n\ntokenize(\"one^|uno||three^^^^|four^^^|^cuatro|\", \"|\", \"^\")\nSleep\n","language":"FreeBASIC"},{"code":"package main\n\nimport (\n\t\"errors\"\n\t\"fmt\"\n)\n\nfunc TokenizeString(s string, sep, escape rune) (tokens []string, err error) {\n\tvar runes []rune\n\tinEscape := false\n\tfor _, r := range s {\n\t\tswitch {\n\t\tcase inEscape:\n\t\t\tinEscape = false\n\t\t\tfallthrough\n\t\tdefault:\n\t\t\trunes = append(runes, r)\n\t\tcase r == escape:\n\t\t\tinEscape = true\n\t\tcase r == sep:\n\t\t\ttokens = append(tokens, string(runes))\n\t\t\trunes = runes[:0]\n\t\t}\n\t}\n\ttokens = append(tokens, string(runes))\n\tif inEscape {\n\t\terr = errors.New(\"invalid terminal escape\")\n\t}\n\treturn tokens, err\n}\n\nfunc main() {\n\tconst sample = \"one^|uno||three^^^^|four^^^|^cuatro|\"\n\tconst separator = '|'\n\tconst escape = '^'\n\n\tfmt.Printf(\"Input: %q\\n\", sample)\n\ttokens, err := TokenizeString(sample, separator, escape)\n\tif err != nil {\n\t\tfmt.Println(\"error:\", err)\n\t} else {\n\t\tfmt.Printf(\"Tokens: %q\\n\", tokens)\n\t}\n}\n","language":"Go"},{"code":"splitEsc :: (Foldable t1, Eq t) => t -> t -> t1 t -> [[t]]\nsplitEsc sep esc = reverse . map reverse . snd . foldl process (0, [[]])\n where process (st, r:rs) ch\n | st == 0 && ch == esc = (1, r:rs)\n | st == 0 && ch == sep = (0, []:r:rs)\n | st == 1 && sep == esc && ch /= sep = (0, [ch]:r:rs)\n | otherwise = (0, (ch:r):rs)\n","language":"Haskell"},{"code":"{-#Language LambdaCase #-}\nimport Conduit\n\nsplitEscC :: (Monad m, Eq t) => t -> t -> Conduit t m [t]\nsplitEscC sep esc = mapOutput reverse $ go True []\n where\n go notEsc b = await >>= \\case\n Nothing -> yield b\n Just ch | notEsc && ch == esc -> go False b\n | notEsc && ch == sep -> yield b >> go True []\n | otherwise -> go True (ch:b)\n","language":"Haskell"},{"code":"main = runConduit $\n yieldMany \"one^|uno||three^^^^|four^^^|^cuatro|\"\n .| splitEscC '|' '^'\n .| mapM_C print\n","language":"Haskell"},{"code":"import Data.Bool (bool)\n\n------------------ TOKENIZE WITH ESCAPING ----------------\n\ntokenize :: Char -> Char -> String -> [String]\ntokenize delim esc str =\n reverse $\n reverse <$> (token : list)\n where\n (token, list, _) =\n foldr\n ( \\x (aToken, aList, aEsc) ->\n let literal = not aEsc\n isEsc = literal && (x == esc)\n in bool\n ( bool (x : aToken) aToken isEsc,\n aList,\n isEsc\n )\n ([], aToken : aList, isEsc)\n (literal && x == delim)\n )\n ([], [], False)\n (reverse str)\n\n--------------------------- TEST -------------------------\nmain :: IO ()\nmain =\n mapM_ print $\n tokenize\n '|'\n '^'\n \"one^|uno||three^^^^|four^^^|^cuatro|\"\n","language":"Haskell"},{"code":"tokenize1=: tokenize =: '^|'&$: :(4 : 0)\n 'ESC SEP' =. x\n STATE =. 0\n RESULT =. 0 $ a:\n TOKEN =. ''\n for_C. y do.\n if. STATE do.\n TOKEN =. TOKEN , C\n STATE =. 0\n else.\n if. C = ESC do.\n STATE =. 1\n elseif. C = SEP do.\n RESULT =. RESULT , < TOKEN\n TOKEN =. ''\n elseif. do.\n TOKEN =. TOKEN , C\n end.\n end.\n end.\n RESULT =. RESULT , < TOKEN\n)\n","language":"J"},{"code":"tokenize2=: tokenize=:3 :0\n '^|' tokenize2 y NB. task default escape and separator\n:\n 'ESC SEP'=. x\n E=. 18 b./\\.&.|.ESC=y NB. escape positions\n S=. (SEP=y)>_1}.0,E NB. separator positions\n K=. -.E+.S NB. keep positions\n T=. (#y){. 1,}.S NB. token beginnings\n (T<;.1 K)#&.>T<;.1 y\n)\n","language":"J"},{"code":" '^|' tokenize 'one^|uno||three^^^^|four^^^|^cuatro|'\n┌───────┬┬───────┬────────────┬┐\n│one|uno││three^^│four^|cuatro││\n└───────┴┴───────┴────────────┴┘\n","language":"J"},{"code":"charTokens =: (0;(3 2 2$(2 1 1 1 2 2 1 2 1 0 1 0));<<'^')&;: NB. sequential machine\nsplitTokens =: ((<,'|')&= <;._1 ])@:((<,'|'),])\nremoveExtra =: (}.^:(1<#)) L:0\ntokenize3=: tokenize=: ; each @: (removeExtra @: splitTokens @: charTokens)\n","language":"J"},{"code":" t=: 'one^|uno||three^^^^|four^^^|^cuatro|'\n\n tokenize t\n┌───────┬┬───────┬────────────┬┐\n│one|uno││three^^│four^|cuatro││\n└───────┴┴───────┴────────────┴┘\n\n $tokenize t\n5\n","language":"J"},{"code":" txt=: 1e5$'one^|uno||three^^^^|four^^^|^cuatro|'\n\n (%\"1 <./) timespacex every 'tokenize1 txt';'tokenize2 txt';'tokenize3 txt'\n132.856 1\n 1 7.73534\n8.29568 19.9766\n","language":"J"},{"code":"import java.util.*;\n\npublic class TokenizeStringWithEscaping {\n\n public static void main(String[] args) {\n String sample = \"one^|uno||three^^^^|four^^^|^cuatro|\";\n char separator = '|';\n char escape = '^';\n\n System.out.println(sample);\n try {\n System.out.println(tokenizeString(sample, separator, escape));\n } catch (Exception e) {\n System.out.println(e);\n }\n }\n\n public static List<String> tokenizeString(String s, char sep, char escape)\n throws Exception {\n List<String> tokens = new ArrayList<>();\n StringBuilder sb = new StringBuilder();\n\n boolean inEscape = false;\n for (char c : s.toCharArray()) {\n if (inEscape) {\n inEscape = false;\n } else if (c == escape) {\n inEscape = true;\n continue;\n } else if (c == sep) {\n tokens.add(sb.toString());\n sb.setLength(0);\n continue;\n }\n sb.append(c);\n }\n if (inEscape)\n throw new Exception(\"Invalid terminal escape\");\n\n tokens.add(sb.toString());\n\n return tokens;\n }\n}\n","language":"Java"},{"code":"function tokenize(s, esc, sep) {\n\tfor (var a=[], t='', i=0, e=s.length; i<e; i+=1) {\n\t\tvar c = s.charAt(i)\n\t\tif (c == esc) t+=s.charAt(++i)\n\t\telse if (c != sep) t+=c\n\t\telse a.push(t), t=''\t\t\n\t}\n\ta.push(t)\n\treturn a\n}\n\nvar s = 'one^|uno||three^^^^|four^^^|^cuatro|'\ndocument.write(s, '<br>')\t\nfor (var a=tokenize(s,'^','|'), i=0; i<a.length; i+=1) document.write(i, ': ', a[i], '<br>')\n","language":"JavaScript"},{"code":"(function () {\n 'use strict';\n\n // tokenize :: String -> Character -> Character -> [String]\n function tokenize(str, charDelim, charEsc) {\n var dctParse = str.split('')\n .reduce(function (a, x) {\n\n var blnEsc = a.esc,\n blnBreak = !blnEsc && x === charDelim,\n blnEscChar = !blnEsc && x === charEsc;\n\n return {\n esc: blnEscChar,\n token: blnBreak ? '' : (\n a.token + (blnEscChar ? '' : x)\n ),\n list: a.list.concat(blnBreak ? a.token : [])\n };\n }, {\n esc: false,\n token: '',\n list: []\n });\n\n return dctParse.list.concat(\n dctParse.token\n );\n }\n\n return tokenize(\n 'one^|uno||three^^^^|four^^^|^cuatro|',\n '|','^'\n )\n .join('\\n');\n\n})();\n","language":"JavaScript"},{"code":"((() => {\n\n // tokenize :: String -> Character -> Character -> [String]\n const tokenize = (charDelim, charEsc, str) => {\n const [token, list, _] = str.split('')\n .reduce(([aToken, aList, aEsc], x) => {\n const\n blnBreak = !aEsc && x === charDelim,\n blnEscChar = !aEsc && x === charEsc;\n\n return [\n blnBreak ? '' : (\n aToken + (blnEscChar ? '' : x)\n ),\n aList.concat(blnBreak ? aToken : []),\n blnEscChar\n ];\n }, ['', [], false]);\n\n return list.concat(token);\n };\n\n // splitEsc :: String -> [String]\n const splitEsc = str => tokenize('|', '^', str);\n\n\n // TEST\n // show :: a -> String\n const show = x => JSON.stringify(x, null, 2);\n\n return splitEsc(\n 'one^|uno||three^^^^|four^^^|^cuatro|',\n )\n .map(show)\n .join('\\n');\n}))();\n","language":"JavaScript"},{"code":"(() => {\n 'use strict';\n\n // ------ TOKENIZATION OF A STRING WITH ESCAPES ------\n\n // tokenizedWithEscapes :: Char -> Char ->\n // String -> [String]\n const tokenizedWithEscapes = esc =>\n // A list of tokens in a given string,\n // where the separator character is sep\n // and any character may be escaped by\n // a preceding esc character.\n sep => compose(\n concatMap(fst),\n parse(\n sepBy(\n takeWhileEscP(esc)(\n constant(true)\n )(\n ne(sep)\n )\n )(char(sep))\n )\n );\n\n // ---------------------- TEST -----------------------\n // main :: IO ()\n const main = () =>\n JSON.stringify(\n tokenizedWithEscapes('^')('|')(\n 'one^|uno||three^^^^|four^^^|^cuatro|'\n ),\n null, 2\n );\n // -->\n // [\n // \"one|uno\",\n // \"\",\n // \"three^^\",\n // \"four^|cuatro\",\n // \"\"\n // ]\n\n // ----------- GENERIC PARSER COMBINATORS ------------\n\n // Parser :: String -> [(a, String)] -> Parser a\n const Parser = f =>\n // A function lifted into a Parser object.\n ({\n type: 'Parser',\n parser: f\n });\n\n\n // altP (<|>) :: Parser a -> Parser a -> Parser a\n const altP = p =>\n // p, or q if p doesn't match.\n q => Parser(s => {\n const xs = parse(p)(s);\n return 0 < xs.length ? (\n xs\n ) : parse(q)(s);\n });\n\n\n // anyChar :: () -> Parser Char\n const anyChar = () =>\n // A single character.\n Parser(\n s => 0 < s.length ? [\n Tuple(s[0])(\n s.slice(1)\n )\n ] : []\n );\n\n\n // apP <*> :: Parser (a -> b) -> Parser a -> Parser b\n const apP = pf =>\n // A new parser obtained by the application\n // of a Parser-wrapped function,\n // to a Parser-wrapped value.\n p => Parser(\n s => parse(pf)(s).flatMap(\n vr => parse(\n fmapP(vr[0])(p)\n )(vr[1])\n )\n );\n\n\n // bindP (>>=) :: Parser a ->\n // (a -> Parser b) -> Parser b\n const bindP = p =>\n // A new parser obtained by the application of\n // a function to a Parser-wrapped value.\n // The function must enrich its output, lifting it\n // into a new Parser.\n // Allows for the nesting of parsers.\n f => Parser(\n s => parse(p)(s).flatMap(\n tpl => parse(f(tpl[0]))(tpl[1])\n )\n );\n\n\n // char :: Char -> Parser Char\n const char = x =>\n // A particular single character.\n satisfy(c => x == c);\n\n\n // fmapP :: (a -> b) -> Parser a -> Parser b\n const fmapP = f =>\n // A new parser derived by the structure-preserving\n // application of f to the value in p.\n p => Parser(\n s => parse(p)(s).flatMap(\n first(f)\n )\n );\n\n\n // liftA2P :: (a -> b -> c) ->\n // Parser a -> Parser b -> Parser c\n const liftA2P = op =>\n // The binary function op, lifted\n // to a function over two parsers.\n p => apP(fmapP(op)(p));\n\n\n // many :: Parser a -> Parser [a]\n const many = p => {\n // Zero or more instances of p.\n // Lifts a parser for a simple type of value\n // to a parser for a list of such values.\n const some_p = p =>\n liftA2P(\n x => xs => [x].concat(xs)\n )(p)(many(p));\n return Parser(\n s => parse(\n 0 < s.length ? (\n altP(some_p(p))(pureP(''))\n ) : pureP('')\n )(s)\n );\n };\n\n\n // parse :: Parser a -> String -> [(a, String)]\n const parse = p =>\n // The result of parsing a string with p.\n p.parser;\n\n\n // pureP :: a -> Parser a\n const pureP = x =>\n // The value x lifted, unchanged,\n // into the Parser monad.\n Parser(s => [Tuple(x)(s)]);\n\n\n // satisfy :: (Char -> Bool) -> Parser Char\n const satisfy = test =>\n // Any character for which the\n // given predicate returns true.\n Parser(\n s => 0 < s.length ? (\n test(s[0]) ? [\n Tuple(s[0])(s.slice(1))\n ] : []\n ) : []\n );\n\n\n // sepBy :: Parser a -> Parser b -> Parser [a]\n const sepBy = p =>\n // Zero or more occurrences of p, as\n // separated by (discarded) instances of sep.\n sep => altP(\n sepBy1(p)(sep)\n )(\n pureP([])\n );\n\n\n // sepBy1 :: Parser a -> Parser b -> Parser [a]\n const sepBy1 = p =>\n // One or more occurrences of p, as\n // separated by (discarded) instances of sep.\n sep => bindP(\n p\n )(x => bindP(\n many(\n thenP(sep)(\n bindP(p)(pureP)\n )\n )\n )(xs => pureP([x].concat(xs))));\n\n\n // takeWhileEscP :: Char -> (Char -> Bool) ->\n // (Char -> Bool) -> Parser Text\n const takeWhileEscP = esc =>\n escTest => test => {\n // Longest prefix, including any escaped\n // characters, in which escTest returns\n // true for all escaped characters, and\n // test returns true for all other chars.\n const plain = takeWhileP(\n c => (esc !== c) && test(c)\n );\n const escaped = thenBindP(\n char(esc)\n )(\n anyChar()\n )(x => bindP(\n plain\n )(\n compose(pureP, cons(x))\n ));\n return bindP(\n plain\n )(x => bindP(\n many(escaped)\n )(xs => pureP(concat([x].concat(xs)))));\n };\n\n\n // takeWhileP :: (Char -> Bool) -> Parser String\n const takeWhileP = p =>\n // The largest prefix in which p is\n // true over all the characters.\n Parser(\n compose(\n pureList,\n first(concat),\n span(p)\n )\n );\n\n\n // thenBindP :: Parser a -> Parser b ->\n // (b -> Parser c) Parser c\n const thenBindP = o =>\n // A combination of thenP and bindP in which a\n // preliminary parser consumes text and discards\n // its output, before any output of a subsequent\n // parser is bound.\n p => f => Parser(\n s => parse(o)(s).flatMap(\n vr => parse(p)(vr[1]).flatMap(\n tpl => parse(f(tpl[0]))(tpl[1])\n )\n )\n );\n\n\n // thenP (>>) :: Parser a -> Parser b -> Parser b\n const thenP = o =>\n // A composite parser in which o just consumes text\n // and then p consumes more and returns a value.\n p => Parser(\n s => parse(o)(s).flatMap(\n vr => parse(p)(vr[1])\n )\n );\n\n\n // --------------------- GENERIC ---------------------\n\n // Tuple (,) :: a -> b -> (a, b)\n const Tuple = a =>\n b => ({\n type: 'Tuple',\n '0': a,\n '1': b,\n length: 2\n });\n\n\n // compose (<<<) :: (b -> c) -> (a -> b) -> a -> c\n const compose = (...fs) =>\n // A function defined by the right-to-left\n // composition of all the functions in fs.\n fs.reduce(\n (f, g) => x => f(g(x)),\n x => x\n );\n\n\n // concat :: [[a]] -> [a]\n // concat :: [String] -> String\n const concat = xs => (\n ys => 0 < ys.length ? (\n ys.every(Array.isArray) ? (\n []\n ) : ''\n ).concat(...ys) : ys\n )(list(xs));\n\n\n // concatMap :: (a -> [b]) -> [a] -> [b]\n const concatMap = f =>\n // List monad bind operator.\n xs => xs.flatMap(f);\n\n\n // cons :: a -> [a] -> [a]\n const cons = x =>\n // A list constructed from the item x,\n // followed by the existing list xs.\n xs => Array.isArray(xs) ? (\n [x].concat(xs)\n ) : 'GeneratorFunction' !== xs\n .constructor.constructor.name ? (\n x + xs\n ) : ( // cons(x)(Generator)\n function* () {\n yield x;\n let nxt = xs.next();\n while (!nxt.done) {\n yield nxt.value;\n nxt = xs.next();\n }\n }\n )();\n\n\n // constant :: a -> b -> a\n const constant = k =>\n _ => k;\n\n\n // first :: (a -> b) -> ((a, c) -> (b, c))\n const first = f =>\n // A simple function lifted to one which applies\n // to a tuple, transforming only its first item.\n xy => Tuple(f(xy[0]))(\n xy[1]\n );\n\n\n // fst :: (a, b) -> a\n const fst = tpl =>\n // First member of a pair.\n tpl[0];\n\n\n // list :: StringOrArrayLike b => b -> [a]\n const list = xs =>\n // xs itself, if it is an Array,\n // or an Array derived from xs.\n Array.isArray(xs) ? (\n xs\n ) : Array.from(xs || []);\n\n\n // map :: (a -> b) -> [a] -> [b]\n const map = f =>\n // The list obtained by applying f\n // to each element of xs.\n // (The image of xs under f).\n xs => [...xs].map(f);\n\n\n // ne :: a -> a -> Bool\n const ne = a =>\n b => a !== b;\n\n\n // pureList :: a -> [a]\n const pureList = x => [x];\n\n\n // span p xs is equivalent to (takeWhile p xs, dropWhile p xs)\n // span :: (a -> Bool) -> [a] -> ([a], [a])\n const span = p =>\n // Longest prefix of xs consisting of elements which\n // all satisfy p, tupled with the remainder of xs.\n xs => {\n const\n ys = 'string' !== typeof xs ? (\n list(xs)\n ) : xs,\n iLast = ys.length - 1;\n return splitAt(\n until(\n i => iLast < i || !p(ys[i])\n )(i => 1 + i)(0)\n )(ys);\n };\n\n\n // splitAt :: Int -> [a] -> ([a], [a])\n const splitAt = n =>\n xs => Tuple(xs.slice(0, n))(\n xs.slice(n)\n );\n\n\n // unlines :: [String] -> String\n const unlines = xs =>\n // A single string formed by the intercalation\n // of a list of strings with the newline character.\n xs.join('\\n');\n\n\n // until :: (a -> Bool) -> (a -> a) -> a -> a\n const until = p =>\n 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":"# Tokenize the input using the string \"escape\" as the prefix escape string\ndef tokenize(separator; escape):\n\n # Helper functions:\n # mapper/1 is like map/1, but for each element, $e, in the input array,\n # if $e is an array, then it is inserted,\n # otherwise the elements of ($e|f) are inserted.\n def mapper(f): reduce .[] as $e\n ( [];\n if ($e|type) == \"array\" then . + [$e] else . + ($e | f) end ) ;\n\n # interpolate x\n def interpolate(x):\n reduce .[] as $i ([]; . + [$i, x]) | .[0:-1];\n\n def splitstring(s; twixt):\n if type == \"string\" then split(s) | interpolate(twixt)\n else .\n end;\n\n # concatenate sequences of non-null elements:\n def reform:\n reduce .[] as $x ([];\n if $x == null and .[-1] == null then .[0:-1] + [\"\", null]\n elif $x == null then . + [null]\n elif .[-1] == null then .[0:-1] + [$x]\n else .[0:-1] + [ .[-1] + $x ]\n end)\n | if .[-1] == null then .[-1] = \"\" else . end;\n\n splitstring(escape + escape; [escape])\n | mapper( splitstring( escape + separator; [separator]) )\n | mapper( splitstring( separator; null ) )\n | map( if type == \"string\" then split(escape) else . end)\n | flatten\n | reform ;\n","language":"Jq"},{"code":"\"one^|uno||three^^^^|four^^^|^cuatro|\" | tokenize(\"|\"; \"^\")\n","language":"Jq"},{"code":"$ jq -n -f tokenize.jq\n[\n \"one|uno\",\n \"\",\n \"three^^\",\n \"four^|cuatro\",\n \"\"\n]\n","language":"Jq"},{"code":"function tokenize2(s::AbstractString, sep::Char, esc::Char)\n SPE = \"\\ufffe\"\n SPF = \"\\uffff\"\n s = replace(s, \"$esc$esc\", SPE) |>\n s -> replace(s, \"$esc$sep\", SPF) |>\n s -> last(s) == esc ? string(replace(s[1:end-1], esc, \"\"), esc) : replace(s, esc, \"\")\n return map(split(s, sep)) do token\n token = replace(token, SPE, esc)\n return replace(token, SPF, sep)\n end\nend\n\n@show tokenize2(\"one^|uno||three^^^^|four^^^|^cuatro|\", '|', '^')\n","language":"Julia"},{"code":"// version 1.1.3\n\nconst val SPE = \"\\ufffe\" // unused unicode char in Specials block\nconst val SPF = \"\\uffff\" // ditto\n\nfun tokenize(str: String, sep: Char, esc: Char): List<String> {\n var s = str.replace(\"$esc$esc\", SPE).replace(\"$esc$sep\", SPF)\n s = if (s.last() == esc) // i.e. 'esc' not escaping anything\n s.dropLast(1).replace(\"$esc\", \"\") + esc\n else\n s.replace(\"$esc\", \"\")\n return s.split(sep).map { it.replace(SPE, \"$esc\").replace(SPF, \"$sep\") }\n}\n\nfun main(args: Array<String>) {\n var str = \"one^|uno||three^^^^|four^^^|^cuatro|\"\n val sep = '|'\n val esc = '^'\n val items = tokenize(str, sep, esc)\n for (item in items) println(if (item.isEmpty()) \"(empty)\" else item)\n}\n","language":"Kotlin"},{"code":"-- in some movie script\n\non tokenize (str, sep, esc)\n l = []\n _player.itemDelimiter = sep\n cnt = str.item.count\n repeat with i = 1 to cnt\n prev = l.getLast() -- can be VOID\n if _trailEscCount(prev, esc) mod 2 then\n l[l.count] = prev.char[1..prev.length-1]&sep&str.item[i]\n else\n l.add(str.item[i])\n end if\n end repeat\n -- remove escape characters from tokens\n cnt = l.count\n repeat with i = 1 to cnt\n l[i] = _removeEsc(l[i], esc)\n end repeat\n return l\nend\n\n-- counts number of trailing escape characters\non _trailEscCount (str, esc)\n n = 0\n repeat with i = str.length down to 1\n if str.char[i]=esc then n=n+1\n else exit repeat\n end repeat\n return n\nend\n\n-- could be implemented more efficiently by using offset()\non _removeEsc (str, esc)\n cnt = str.length-1\n repeat with i = 1 to cnt\n if str.char[i]=esc then\n delete char i of str\n cnt = cnt-1\n end if\n end repeat\n return str\nend\n","language":"Lingo"},{"code":"str = \"one^|uno||three^^^^|four^^^|^cuatro|\"\nsep = \"|\"\nesc = \"^\"\nput tokenize(str, sep, esc)\n-- [\"one|uno\", \"\", \"three^^\", \"four^|cuatro\", \"\"]\n","language":"Lingo"},{"code":"function tokenise (str, sep, esc)\n local strList, word, escaped, ch = {}, \"\", false\n for pos = 1, #str do\n ch = str:sub(pos, pos)\n if ch == esc then\n if escaped then\n word = word .. ch\n escaped = false\n else\n escaped = true\n end\n elseif ch == sep then\n if escaped then\n word = word .. ch\n escaped = false\n else\n table.insert(strList, word)\n word = \"\"\n end\n else\n escaped = false\n word = word .. ch\n end\n end\n table.insert(strList, word)\n return strList\nend\n\nlocal testStr = \"one^|uno||three^^^^|four^^^|^cuatro|\"\nlocal testSep, testEsc = \"|\", \"^\"\nfor k, v in pairs(tokenise(testStr, testSep, testEsc)) do\n print(k, v)\nend\n","language":"Lua"},{"code":"ClearAll[Tokenize]\nTokenize[str_String, escape_String : \"^\", sep_String : \"|\"] :=\n Module[{results = {}, token = \"\", state = 0, a},\n a = Characters[str];\n Do[\n If[state == 0,\n Switch[c,\n escape,\n state = 1\n ,\n sep,\n AppendTo[results, token];\n token = \"\";\n ,\n _,\n token = token <> c;\n ]\n ,\n If[state == 1,\n token = token <> c;\n state = 0;\n ]\n ]\n\n ,\n {c, a}\n ];\n AppendTo[results, token];\n results\n ]\nTokenize[\"one^|uno||three^^^^|four^^^|^cuatro|\"]\n","language":"Mathematica"},{"code":"import streams\n\nproc tokenize(s: Stream, sep: static[char] = '|', esc: static[char] = '^'): seq[string] =\n var buff = \"\"\n while not s.atEnd():\n let c = s.readChar\n case c\n of sep:\n result.add buff\n buff = \"\"\n of esc:\n buff.add s.readChar\n else:\n buff.add c\n result.add buff\n\nfor i, s in tokenize(newStringStream \"one^|uno||three^^^^|four^^^|^cuatro|\"):\n echo i, \":\", s\n","language":"Nim"},{"code":"let split_with_escaping ~esc ~sep s =\n let len = String.length s in\n let buf = Buffer.create 16 in\n let rec loop i =\n if i = len then [Buffer.contents buf]\n else if s.[i] = esc && i + 1 < len then begin\n Buffer.add_char buf s.[i + 1];\n loop (i + 2)\n end else if s.[i] = sep then begin\n let s = Buffer.contents buf in\n Buffer.clear buf;\n s :: loop (i + 1)\n end else begin\n Buffer.add_char buf s.[i];\n loop (i + 1)\n end\n in\n loop 0\n","language":"OCaml"},{"code":"let res = split_with_escaping ~esc:'^' ~sep:'|' \"one^|uno||three^^^^|four^^^|^cuatro|\";;\nval res : string list = [\"one|uno\"; \"\"; \"three^^\"; \"four^|cuatro\"; \"\"]\n","language":"OCaml"},{"code":"sub tokenize {\n my ($string, $sep, $esc) = (shift, quotemeta shift, quotemeta shift);\n\n my @fields = split /$esc . (*SKIP)(*FAIL) | $sep/sx, $string, -1;\n return map { s/$esc(.)/$1/gsr } @fields;\n}\n","language":"Perl"},{"code":" my @fields = $string =~ /\\G (?:^ | $sep) \\K (?: [^$sep$esc] | $esc .)*/gsx;\n","language":"Perl"},{"code":"print \"'$_'\\n\" for tokenize(\"one^|uno||three^^^^|four^^^|^cuatro|\", '|', '^');\n","language":"Perl"},{"code":"(phixonline)-->\n <span style=\"color: #008080;\">function</span> <span style=\"color: #000000;\">tokenize</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;\">integer</span> <span style=\"color: #000000;\">sep</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #004080;\">integer</span> <span style=\"color: #000000;\">esc</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #004080;\">sequence</span> <span style=\"color: #000000;\">ret</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #0000FF;\">{}</span>\n <span style=\"color: #004080;\">string</span> <span style=\"color: #000000;\">word</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #008000;\">\"\"</span>\n <span style=\"color: #004080;\">integer</span> <span style=\"color: #000000;\">skip</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">0</span>\n\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;\">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;\">integer</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: #008080;\">if</span> <span style=\"color: #000000;\">skip</span> <span style=\"color: #008080;\">then</span>\n <span style=\"color: #000000;\">word</span> <span style=\"color: #0000FF;\">&=</span> <span style=\"color: #000000;\">si</span>\n <span style=\"color: #000000;\">skip</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">0</span>\n <span style=\"color: #008080;\">elsif</span> <span style=\"color: #000000;\">si</span><span style=\"color: #0000FF;\">=</span><span style=\"color: #000000;\">esc</span> <span style=\"color: #008080;\">then</span>\n <span style=\"color: #000000;\">skip</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">1</span>\n <span style=\"color: #008080;\">elsif</span> <span style=\"color: #000000;\">si</span><span style=\"color: #0000FF;\">=</span><span style=\"color: #000000;\">sep</span> <span style=\"color: #008080;\">then</span>\n <span style=\"color: #000000;\">ret</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">append</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">ret</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">word</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #000000;\">word</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #008000;\">\"\"</span>\n <span style=\"color: #008080;\">else</span>\n <span style=\"color: #000000;\">word</span> <span style=\"color: #0000FF;\">&=</span> <span style=\"color: #000000;\">si</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;\">ret</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">append</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">ret</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">word</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;\">ret</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;\">tokenize</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #008000;\">\"one^|uno||three^^^^|four^^^|^cuatro|\"</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<!--\n","language":"Phix"},{"code":"(de tokenize (Str Sep Esc)\n (split\n (make\n (for (L (chop Str) L)\n (let C (pop 'L)\n (cond\n ((= C Esc) (link (pop 'L)))\n ((= C Sep) (link 0))\n (T (link C)) ) ) ) )\n 0 ) )\n","language":"PicoLisp"},{"code":"(for (I . S) (tokenize \"one\\^|uno||three\\^\\^\\^\\^|four\\^\\^\\^|\\^cuatro|\" \"|\" \"\\^\")\n (prinl I \": \" S) )\n","language":"PicoLisp"},{"code":"function Split-String ([string]$String, [char]$Separator, [char]$Escape)\n{\n if ($String -notmatch \"\\$Separator|\\$Escape\") {return $String}\n\n [bool]$escaping = $false\n [string]$output = \"\"\n\n for ($i = 0; $i -lt $String.Length; $i++)\n {\n [char]$character = $String.Substring($i,1)\n\n if ($escaping)\n {\n $output += $character\n $escaping = $false\n }\n else\n {\n switch ($character)\n {\n {$_ -eq $Separator} {$output; $output = \"\"; break}\n {$_ -eq $Escape} {$escaping = $true ; break}\n Default {$output += $character}\n }\n }\n }\n\n if ($String[-1] -eq $Separator) {[String]::Empty}\n}\n","language":"PowerShell"},{"code":"Split-String \"one^|uno||three^^^^|four^^^|^cuatro|\" -Separator \"|\" -Escape \"^\" | ForEach-Object `\n -Begin {$n = 0} `\n -Process {$n+= 1; \"{0}: {1}\" -f $n, $_}\n","language":"PowerShell"},{"code":"def token_with_escape(a, escape = '^', separator = '|'):\n '''\n Issue python -m doctest thisfile.py to run the doctests.\n\n >>> print(token_with_escape('one^|uno||three^^^^|four^^^|^cuatro|'))\n ['one|uno', '', 'three^^', 'four^|cuatro', '']\n '''\n result = []\n token = ''\n state = 0\n for c in a:\n if state == 0:\n if c == escape:\n state = 1\n elif c == separator:\n result.append(token)\n token = ''\n else:\n token += c\n elif state == 1:\n token += c\n state = 0\n result.append(token)\n return result\n","language":"Python"},{"code":"'''Tokenize a string with escaping'''\n\nfrom functools import reduce\n\n\n# tokenize :: Char -> Char -> String -> [String]\ndef tokenize(delim):\n '''A list of the tokens in a string, given\n a delimiting char and an escape char.\n '''\n def go(esc, s):\n def chop(a, x):\n tkn, xs, escaped = a\n literal = not escaped\n isEsc = literal and (esc == x)\n return ([], [tkn] + xs, isEsc) if (\n literal and (delim == x)\n ) else (tkn if isEsc else [x] + tkn, xs, isEsc)\n\n tkn, xs, _ = reduce(chop, list(s), ([], [], False))\n\n return list(reversed(\n [''.join(reversed(x)) for x in [tkn] + xs]\n ))\n return lambda esc: lambda s: go(esc, s)\n\n\n# --------------------------TEST---------------------------\n# main :: IO ()\ndef main():\n '''Test'''\n\n print(\n tokenize('|')('^')(\n \"one^|uno||three^^^^|four^^^|^cuatro|\"\n )\n )\n\n\n# MAIN ---\nif __name__ == '__main__':\n main()\n","language":"Python"},{"code":"import re\n\nSTRING = 'one^|uno||three^^^^|four^^^|^cuatro|'\n\ndef tokenize(string=STRING, escape='^', separator='|'):\n\n escape, separator = map(re.escape, (escape, separator))\n\n tokens = ['']\n\n def start_new_token(scanner, substring):\n tokens.append('')\n\n def add_escaped_char(scanner, substring):\n char = substring[1]\n tokens[-1] += char\n\n def add_substring(scanner, substring):\n tokens[-1] += substring\n\n re.Scanner([\n # an escape followed by a character produces that character\n (fr'{escape}.', add_escaped_char),\n\n # when encountering a separator not preceded by an escape,\n # start a new token\n (fr'{separator}', start_new_token),\n\n # a sequence of regular characters (i.e. not escape or separator)\n # is just appended to the token\n (fr'[^{escape}{separator}]+', add_substring),\n ]).scan(string)\n\n return tokens\n\n\nif __name__ == '__main__':\n print(list(tokenize()))\n","language":"Python"},{"code":"import re\n\nSTRING = 'one^|uno||three^^^^|four^^^|^cuatro|'\n\ndef tokenize(string=STRING, escape='^', separator='|'):\n\n re_escape, re_separator = map(re.escape, (escape, separator))\n\n # token regex\n regex = re.compile(fr'''\n # lookbehind: a token must be preceded by a separator\n # (note that `(?<=^|{re_separator})` doesn't work in Python)\n (?<={re_separator})\n\n # a token consists either of an escape sequence,\n # or a regular (non-escape, non-separator) character,\n # repeated arbitrarily many times (even zero)\n (?:{re_escape}.|[^{re_escape}{re_separator}])*\n ''',\n flags=re.VERBOSE\n )\n\n # since each token must start with a separator,\n # we must add an extra separator at the beginning of input\n preprocessed_string = separator + string\n\n for almost_token in regex.findall(preprocessed_string):\n # now get rid of escape characters: '^^' -> '^' etc.\n token = re.sub(fr'{re_escape}(.)', r'\\1', almost_token)\n yield token\n\nif __name__ == '__main__':\n print(list(tokenize()))\n","language":"Python"},{"code":"#lang racket/base\n(require racket/match)\n\n;; Returns a tokenising function based on sep and esc\n(define ((tokenise-with-escape sep esc) str)\n (define tsil->string (compose list->string reverse))\n (define (inr rem l-acc acc)\n (match rem\n ['() (if (and (null? acc) (null? l-acc)) null (reverse (cons (tsil->string l-acc) acc)))]\n [(list (== sep) tl ...) (inr tl null (cons (tsil->string l-acc) acc))]\n [(list (== esc) c tl ...) (inr tl (cons c l-acc) acc)]\n [(list c tl ...) (inr tl (cons c l-acc) acc)]))\n (inr (string->list str) null null))\n\n;; This is the tokeniser that matches the parameters in the task\n(define task-tokeniser (tokenise-with-escape #\\| #\\^))\n\n(define (report-input-output str)\n (printf \"Input: ~s~%Output: ~s~%~%\" str (task-tokeniser str)))\n\n(report-input-output \"one^|uno||three^^^^|four^^^|^cuatro|\")\n(report-input-output \"\")\n(report-input-output \"|\")\n(report-input-output \"^\")\n(report-input-output \".\")\n","language":"Racket"},{"code":"sub tokenize ($string, :$sep!, :$esc!) {\n return $string.match(/([ <!before $sep | $esc> . | $esc . ]*)+ % $sep/)\\\n .[0].map(*.subst: /$esc )> ./, '', :g);\n}\n\nsay \"'$_'\" for tokenize 'one^|uno||three^^^^|four^^^|^cuatro|', sep => '|', esc => '^';\n","language":"Raku"},{"code":"/*REXX program demonstrates tokenizing and displaying a string with escaping sequences. */\n str = 'one^|uno||three^^^^|four^^^|^cuatro|' /*the character string to be tokenized.*/\n esc = '^' /* \" escape character to be used. */\n sep = '|' /* \" separator \" \" \" \" */\n out = /* \" output string (so far). */\neMode = 0 /*a flag, escape is in progress. */\n\n do j=1 for length(str); _=substr(str, j, 1) /*parse a single character at a time. */\n if eMode then do; out=out || _; eMode=0; iterate; end /*are we in escape mode? */\n if _==esc then do; eMode=1; iterate; end /*is it an escape char ? */\n if _==sep then do; call show; iterate; end /* \" \" a separator char?*/\n out=out || _ /*append the character. */\n end /*j*/\n\nif out\\=='' | _==sep then call show /*handle a residual str or a separator.*/\nexit /*stick a fork in it, we're all done. */\n/*──────────────────────────────────────────────────────────────────────────────────────*/\nshow: say '[length'right(length(out),4)\"]\" out; out=; return\n","language":"REXX"},{"code":"/*REXX program demonstrates tokenizing and displaying a string with escaping sequences. */\n str = 'one^|uno||three^^^^|four^^^|^cuatro|' /*the character string to be tokenized.*/\n esc = '^' /* \" escape character to be used. */\n sep = '|' /* \" separator \" \" \" \" */\n $ = /* \" output string (so far). */\neMode = 0 /*a flag, escape is in progress. */\nsay ' output len output' /*title verbiage used for the output.*/\nsay '──────────── ────────────────────' /* \" separator \" \" \" \" */\n\n do j=1 for length(str); _=substr(str, j, 1) /*parse a single character at a time. */\n select\n when eMode then do; $=$ || _; eMode=0; end /*are we in in escape mode? */\n when _==esc then eMode=1 /*is it an escape character? */\n when _==sep then do; call show; end /* \" \" a separator character? */\n otherwise $=$ || _ /*append the single character. */\n end /*select*/\n end /*j*/\n\nif $\\=='' | _==sep then call show /*handle a residual str or a separator.*/\nsay '──────────── ────────────────────' /*the foot separator for the output. */\nsay ' ····^····1····^····2' /*show the top part of the scale.*/\nsay ' {scale} 12345678901234567890' /* \" \" bottom \" \" \" \" */\nexit /*stick a fork in it, we're all done. */\n/*──────────────────────────────────────────────────────────────────────────────────────*/\nshow: say '[length'right(length($),4)\"]\" $; $=; return\n","language":"REXX"},{"code":"tokenize(\"one^|uno||three^^^^|four^^^|^cuatro|\", \"|\", \"^\")\n\nfunc tokenize(src, sep, esc)\nfield = 1\nescaping = false\nsee \"\" + field + \" \"\nfor i = 1 to len(src)\n char = substr(src, i, 1)\n if escaping\n see char\n escaping = false\n else\n switch char\n on sep\n see nl\n field = field + 1\n see \"\" + field + \" \"\n on esc\n escaping = true\n other\n see char\n off\n ok\nnext\nsee nl\n","language":"Ring"},{"code":"def tokenize(string, sep, esc)\n sep = Regexp.escape(sep)\n esc = Regexp.escape(esc)\n string.scan(/\\G (?:^ | #{sep}) (?: [^#{sep}#{esc}] | #{esc} .)*/x).collect do |m|\n m.gsub(/#{esc}(.)/, '\\1').gsub(/^#{sep}/, '')\n end\nend\n\np tokenize('one^|uno||three^^^^|four^^^|^cuatro|', '|', '^')\n","language":"Ruby"},{"code":"const SEPARATOR: char = '|';\nconst ESCAPE: char = '^';\nconst STRING: &str = \"one^|uno||three^^^^|four^^^|^cuatro|\";\n\nfn tokenize(string: &str) -> Vec<String> {\n let mut token = String::new();\n let mut tokens: Vec<String> = Vec::new();\n let mut chars = string.chars();\n while let Some(ch) = chars.next() {\n match ch {\n SEPARATOR => {\n tokens.push(token);\n token = String::new();\n },\n ESCAPE => {\n if let Some(next) = chars.next() {\n token.push(next);\n }\n },\n _ => token.push(ch),\n }\n }\n tokens.push(token);\n tokens\n}\n\nfn main() {\n println!(\"{:#?}\", tokenize(STRING));\n}\n","language":"Rust"},{"code":"object TokenizeStringWithEscaping0 extends App {\n\n val (markerSpE,markerSpF) = (\"\\ufffe\" , \"\\uffff\")\n\n def tokenize(str: String, sep: String, esc: String): Array[String] = {\n\n val s0 = str.replace( esc + esc, markerSpE).replace(esc + sep, markerSpF)\n val s = if (s0.last.toString == esc) s0.replace(esc, \"\") + esc else s0.replace(esc, \"\")\n s.split(sep.head).map (_.replace(markerSpE, esc).replace(markerSpF, sep))\n }\n\n def str = \"one^|uno||three^^^^|four^^^|^cuatro|\"\n\n tokenize(str, \"|\", \"^\").foreach(it => println(if (it.isEmpty) \"<empty token>\" else it))\n}\n","language":"Scala"},{"code":"import scala.annotation.tailrec\n\nobject TokenizeStringWithEscaping1 extends App {\n\n def tokenize(str: String, sep: String, esc: String): Seq[String] = {\n @tailrec\n def loop(accu: Seq[String], s: String): Seq[String] = {\n def append2StringInList(char: String): Seq[String] =\n accu.init :+ (accu.last + char)\n\n s.length match {\n case 0 => accu\n case 1 => if (s.head.toString == sep) accu :+ \"\" else append2StringInList(s)\n case _ => (s.head.toString, s.tail.head.toString) match {\n case c@((`esc`, `sep`) | (`esc`, `esc`)) => loop(append2StringInList(c._2), s.tail.tail)\n case (`sep`, _) => loop(accu :+ \"\", s.tail)\n case (`esc`, _) => loop(accu, s.tail)\n case (sub, _) => loop(append2StringInList(sub.head.toString), s.tail)\n }\n }\n }\n\n loop(Seq(\"\"), str)\n }\n\n def str = \"one^|uno||three^^^^|four^^^|^cuatro|\"\n\n tokenize(str, \"|\", \"^\")\n .foreach(it =>\n println(\n f\"[length:${it.length}%3d] ${if (it.isEmpty) \"<empty token>\" else it}\"))\n}\n","language":"Scala"},{"code":"func tokenize(string, sep, esc) {\n var fields = string.split(\n Regex(esc.escape + '.(*SKIP)(*FAIL)|' + sep.escape, 's'), -1\n )\n fields.map{.gsub(Regex(esc.escape + '(.)'), {|s1| s1 }) }\n}\n\ntokenize(\"one^|uno||three^^^^|four^^^|^cuatro|\", '|', '^').each { |str|\n say str.dump\n}\n","language":"Sidef"},{"code":"SIMSET\nBEGIN\n\n LINK CLASS ITEM(TXT); TEXT TXT;;\n\n REF(HEAD) PROCEDURE SPLIT(TXT, SEP, ESC); TEXT TXT; CHARACTER SEP, ESC;\n BEGIN\n REF(HEAD) PARTS;\n CHARACTER CH;\n TEXT PART;\n\n PART :- BLANKS(TXT.LENGTH);\n PARTS :- NEW HEAD;\n TXT.SETPOS(1);\n WHILE TXT.MORE DO BEGIN\n CH := TXT.GETCHAR;\n IF CH = ESC THEN BEGIN\n IF TXT.MORE THEN BEGIN\n CH := TXT.GETCHAR;\n PART.PUTCHAR(CH);\n END ELSE BEGIN\n ERROR(\"SPLIT: ESCAPE CHAR AT END OF STRING\");\n END;\n END ELSE IF CH = SEP THEN BEGIN\n NEW ITEM(COPY(PART.SUB(1,PART.POS-1))).INTO(PARTS);\n PART.SETPOS(1);\n END ELSE BEGIN\n PART.PUTCHAR(CH);\n END;\n END;\n NEW ITEM(COPY(PART.SUB(1,PART.POS-1))).INTO(PARTS);\n\n SPLIT :- PARTS;\n END SPLIT;\n\n TEXT EXAMPLE;\n REF(HEAD) RESULT;\n REF(ITEM) PART;\n INTEGER NO;\n\n FOR EXAMPLE :- \"ONE^|UNO||THREE^^^^|FOUR^^^|^CUATRO|\" DO\n BEGIN\n OUTTEXT(\"INPUT: '\");\n OUTTEXT(EXAMPLE);\n OUTTEXT(\"'\");\n OUTIMAGE;\n RESULT :- SPLIT(EXAMPLE, '|', '^');\n PART :- RESULT.FIRST;\n NO := 0;\n WHILE PART =/= NONE DO\n BEGIN\n NO := NO + 1;\n OUTTEXT(\"PART\");\n OUTINT(NO, 0);\n OUTTEXT(\": '\");\n OUTTEXT(PART.TXT);\n OUTTEXT(\"'\");\n OUTIMAGE;\n PART :- PART.SUC;\n END;\n END;\n\nEND.\n","language":"Simula"},{"code":"* Program: tokenize_with_escape.sbl\n* To run: sbl tokenize_with_escape.sbl\n* Description: Tokenize a string with escaping\n* Comment: Tested using the Spitbol for Linux version of SNOBOL4\n\n\tlf = substr(&alphabet,11,1) ;* New line or line feed\n\n\n* Function tokenize will break parts out of a string, which are\n* separated by c, which defaults to a comma, into\n* an array. Parameter kp=1 to keep null parts, which is the default,\n* and 0 to discard.\n\tdefine('tokenize(s,c,kp)tokenizepat,part,t,i,j')\n\t:(tokenize_end)\ntokenize\n\tc = (ident(c) ',', substr(c,1,1)) :f(freturn)\n\tkp = (ident(kp) 1, eq(kp,0) 0, 1) :f(freturn)\n\tt = table()\n\ttokenizepat = breakx(c) . part c | (len(1) rem) . part\n\ts ? eq(kp,1) rtab(1) c = s c\ntokenize1\n\ts ? tokenizepat = \"\" :f(tokenize2)\n\tt[i = eq(kp,0) differ(part) i + 1] = part\n\tt[i = eq(kp,1) i + 1] = part\n\t:(tokenize1)\ntokenize2\n\ttokenize = array(i) :f(errr)\n\tj = 0\ntokenize3\ttokenize[j = lt(j,i) j + 1] = t[j] :s(tokenize3)\n\t:(return)\ntokenize_end\n\n\n* Function tokcan will a normalize a string by applying separator and escape\n* rules to string ts. Parameter sep is the separator, while esc is the escape\n* character. Parameter tesc is the new separator character to substitute for\n* parameter sep. It defaults to a comma, \",\".\n\tdefine('tokcan(ts,sep,esc,tesc)tpat,part1,part2,notany') :(tokcan_end)\ntokcan\n\ttesc = (ident(tesc) ',', substr(tesc,1,1))\n\ttpat = (breakx(sep esc) . part1\n+\t\t(sep | esc sep | esc esc | (esc len(1) . notany)) . part2\n+\t\t)\n+\t\t| (len(1) rem) . part1\n\ntokcan1\n\tts ? tpat = :f(tokcan2)\n\tpart2 = (leq(part2,sep) tesc\n+\t\t,leq(part2,esc sep) sep\n+\t\t,leq(part2,esc esc) esc\n+\t\t,differ(notany) leq(part2,esc notany) notany\n+\t\t)\n\ttokcan = (ident(tokcan) \"\", tokcan) part1 part2\n\t:(tokcan1)\ntokcan2\n\t:(return)\ntokcan_end\n\n\n\ttest_string = \"one^|uno||three^^^^|four^^^|^cuatro|\"\n\tsep = \"|\"\n\tesc = \"^\"\n\n\thline = tokcan(test_string,sep,esc) :f(err)\n\n\n\toutput = \" Input: \" test_string lf\n\toutput = \"Output1: \" hline lf\n\n\toutput = \"Output2: \"\n\ttokenized = tokenize(hline,\",\")\n\np1\toutput = \"'\" tokenized[z = z + 1] \"'\" :s(p1)\n\nEND\n","language":"SNOBOL4"},{"code":"extension String {\n func tokenize(separator: Character, escape: Character) -> [String] {\n var token = \"\"\n var tokens = [String]()\n var chars = makeIterator()\n\n while let char = chars.next() {\n switch char {\n case separator:\n tokens.append(token)\n token = \"\"\n case escape:\n if let next = chars.next() {\n token.append(next)\n }\n case _:\n token.append(char)\n }\n }\n\n tokens.append(token)\n\n return tokens\n }\n}\n\nprint(\"one^|uno||three^^^^|four^^^|^cuatro|\".tokenize(separator: \"|\", escape: \"^\"))\n","language":"Swift"},{"code":"oo::class create tokens {\n constructor {s} {\n puts [coroutine Next my Iter $s]\n oo::objdefine [self] forward next Next\n }\n method Iter {s} {\n yield [info coroutine]\n for {set i 0} {$i < [string length $s]} {incr i} {\n yield [string index $s $i]\n }\n return -code break\n }\n}\n\nproc tokenize {s {sep |} {escape ^}} {\n set part \"\"\n set parts \"\"\n set iter [tokens new $s]\n while {1} {\n set c [$iter next]\n if {$c eq $escape} {\n append part [$iter next]\n } elseif {$c eq $sep} {\n lappend parts $part\n set part \"\"\n } else {\n append part $c\n }\n }\n lappend parts $part\n return $parts\n}\n\nputs [tokenize one^|uno||three^^^^|four^^^|^cuatro| | ^]\n","language":"Tcl"},{"code":"prog: char(sep) *\n char(esc) *\nstr: smark\ntoken: forw/outp\n ( [ch==esc?] char(ch) any(!<<>>) token\n | [ch==sep?] char(ch) outp str\n | any(!<<>>) token );\noutp: parse(( scopy = { <\"> 1 <\"> * } ));\nforw: peek/chkeof;\npeek: [ch=0] char(ch) fail;\nchkeof: ( [ch?] succ | fail );\n\nch: 0;\nsep: 0;\nesc: 0;\n","language":"TMG"},{"code":"fn tokenize_string(s string, sep u8, escape u8) ?[]string {\n mut tokens := []string{}\n\tmut runes := []u8{}\n\tmut in_escape := false\n\tfor r in s {\n\t\tif in_escape {\n\t\t\tin_escape = false\n\t\t runes << r\n } else if r == escape {\n\t\t\tin_escape = true\n } else if r == sep {\n\t\t\ttokens << runes.bytestr()\n\t\t\trunes = runes[..0]\n\t\t} else {\n runes << r\n }\n\t}\n\ttokens << runes.bytestr()\n\tif in_escape {\n\t\treturn error(\"invalid terminal escape\")\n\t}\n\treturn tokens\n}\n\nconst sample = \"one^|uno||three^^^^|four^^^|^cuatro|\"\nconst separator = `|`\nconst escape = `^`\nfn main() {\n\tprintln(\"Input: $sample\")\n\ttokens := tokenize_string(sample, separator, escape)?\n\tprintln(\"Tokens: $tokens\")\n}\n","language":"V-(Vlang)"},{"code":"Private Function tokenize(s As String, sep As String, esc As String) As Collection\n Dim ret As New Collection\n Dim this As String\n Dim skip As Boolean\n\n If Len(s) <> 0 Then\n For i = 1 To Len(s)\n si = Mid(s, i, 1)\n If skip Then\n this = this & si\n skip = False\n Else\n If si = esc Then\n skip = True\n Else\n If si = sep Then\n ret.Add this\n this = \"\"\n Else\n this = this & si\n End If\n End If\n End If\n Next i\n ret.Add this\n End If\n Set tokenize = ret\nEnd Function\n\nPublic Sub main()\n Dim out As Collection\n Set out = tokenize(\"one^|uno||three^^^^|four^^^|^cuatro|\", \"|\", \"^\")\n Dim outstring() As String\n ReDim outstring(out.Count - 1)\n For i = 0 To out.Count - 1\n outstring(i) = out(i + 1)\n Next i\n Debug.Print Join(outstring, \", \")\nEnd Sub\n","language":"VBA"},{"code":"var SPE = \"\\ufffe\" // unused unicode character in Specials block\nvar SPF = \"\\uffff\" // ditto\n\nvar tokenize = Fn.new { |str, sep, esc|\n str = str.replace(esc + esc, SPE).replace(esc + sep, SPF)\n str = (str[-1] == esc) ? str[0...-1].replace(esc, \"\") + esc : str.replace(esc, \"\")\n return str.split(sep).map { |s| s.replace(SPE, esc).replace(SPF, sep) }.toList\n}\n\nvar str = \"one^|uno||three^^^^|four^^^|^cuatro|\"\nvar sep = \"|\"\nvar esc = \"^\"\nvar items = tokenize.call(str, sep, esc)\nfor (item in items) System.print((item == \"\") ? \"(empty)\" : item)\n","language":"Wren"},{"code":"fcn tokenize(str,sep,esc){\n sink:=Sink(String);\n foreach c in (str){\n switch(c){\n case(esc){ sink.write(__cWalker.next()); } // error if ^EoS\n\t case(sep){ sink.write(\"\\xff\"); }\n\t else { sink.write(c) }\n }\n }\n sink.close().split(\"\\xff\");\n}\n","language":"Zkl"},{"code":"fcn tokenize(str,sep,esc){\n sink:=Sink(String);\n foreach c in (str){ sink.write( (c==esc and __cWalker.next()) or (c==sep and \"\\xff\") or c ) }\n sink.close().split(\"\\xff\");\n}\n","language":"Zkl"},{"code":"tokenize(\"one^|uno||three^^^^|four^^^|^cuatro|\", \"|\",\"^\").println();\n","language":"Zkl"}],"string":"[\n {\n \"code\": \"---\\nfrom: http://rosettacode.org/wiki/Tokenize_a_string_with_escaping\\nnote: String manipulation\\n\",\n \"language\": \"00-META\"\n },\n {\n \"code\": \"{{task heading}}\\nWrite a function or program that can split a string at each non-escaped occurrence of a separator character.\\n\\nIt should accept three input parameters:\\n:::* The <b>string</b>\\n:::* The <b>separator character</b>\\n:::* The <b>escape character</b>\\n\\n<br>\\nIt should output a list of strings.\\n\\n{{task heading|Details}}\\n\\nRules for splitting:\\n* The fields that were separated by the separators, become the elements of the output list.\\n* Empty fields should be preserved, even at the start and end.\\n\\n<br>\\nRules for escaping:\\n* \\\"Escaped\\\" means preceded by an occurrence of the escape character that is not already escaped itself.\\n* When the escape character precedes a character that has no special meaning, it still counts as an escape (but does not do anything special).\\n* Each occurrence of the escape character that was used to escape something, should '''not''' become part of the output.\\n\\n\\n{{task heading|Test case}}\\nDemonstrate that your function satisfies the following test-case:\\n{| class=\\\"wikitable\\\"\\n|-\\n! Input\\n! Output\\n|-\\n| style=\\\"vertical-align:top\\\" |\\n{| style=\\\"border-collapse:collapse; border:none\\\" border=\\\"0\\\"\\n|-\\n| style=\\\"border:none; text-align:right\\\" | string:\\n| style=\\\"border:none\\\" | <pre style=\\\"display:inline;padding:0.1em;margin:0.3em;\\\">one^|uno||three^^^^|four^^^|^cuatro|</pre>\\n|-\\n| style=\\\"border:none; text-align:right\\\" | separator character:\\n| style=\\\"border:none\\\" | <pre style=\\\"display:inline;padding:0.1em;margin:0.3em;\\\">|</pre>\\n|-\\n| style=\\\"border:none; text-align:right\\\" | escape character:\\n| style=\\\"border:none\\\" | <pre style=\\\"display:inline;padding:0.1em;margin:0.3em;\\\">^</pre>\\n|}\\n|\\n{| style=\\\"border-collapse:collapse; border:none\\\" border=\\\"0\\\"\\n|-\\n| style=\\\"border:none\\\" | <pre style=\\\"display:inline;padding:0.1em;margin:0.3em;\\\">one|uno</pre>\\n|-\\n| style=\\\"border:none\\\" | <pre style=\\\"display:inline;padding:0.1em;margin:0.3em;\\\"></pre>\\n|-\\n| style=\\\"border:none\\\" | <pre style=\\\"display:inline;padding:0.1em;margin:0.3em;\\\">three^^</pre>\\n|-\\n| style=\\\"border:none\\\" | <pre style=\\\"display:inline;padding:0.1em;margin:0.3em;\\\">four^|cuatro</pre>\\n|-\\n| style=\\\"border:none\\\" | <pre style=\\\"display:inline;padding:0.1em;margin:0.3em;\\\"></pre>\\n|}\\n|}\\n\\n(Print the output list in any format you like, as long as it is it easy to see what the fields are.)\\n\\n{{Template:Strings}}\\n<br><br>\\n\\n\",\n \"language\": \"00-TASK\"\n },\n {\n \"code\": \"F token_with_escape(a, escape = ‘^’, separator = ‘|’)\\n [String] result\\n V token = ‘’\\n V state = 0\\n L(c) a\\n I state == 0\\n I c == escape\\n state = 1\\n E I c == separator\\n result.append(token)\\n token = ‘’\\n E\\n token ‘’= c\\n E I state == 1\\n token ‘’= c\\n state = 0\\n result.append(token)\\n R result\\n\\nprint(token_with_escape(‘one^|uno||three^^^^|four^^^|^cuatro|’).map(s -> ‘'’s‘'’).join(‘, ’))\\n\",\n \"language\": \"11l\"\n },\n {\n \"code\": \"\\torg\\t100h\\n\\tjmp\\tdemo\\n\\t;;;\\tRoutine to split a 0-terminated string\\n\\t;;;\\tInput: B=separator, C=escape, HL=string pointer.\\n\\t;;;\\tOutput: DE=end of list of strings\\n\\t;;;\\tThe split strings are stored in place.\\nsplit:\\tmov\\td,h\\t; Set DE = output pointer\\n\\tmov\\te,l\\nsnext:\\tmov\\ta,m\\t; Get current input character\\n\\tinx\\th\\t; Advance input pointer\\n\\tstax\\td\\t; Write character at output pointer\\n\\tana\\ta\\t; If zero, we are done\\n\\trz\\n\\tcmp\\tc\\t; Is it the escape character?\\n\\tjz\\tsesc\\n\\tcmp\\tb\\t; Is it the separator character?\\n\\tjz\\tssep\\n\\tinx\\td\\t; Otherwise, advance output pointer,\\n\\tjmp\\tsnext\\t; and get the next character\\nsesc:\\tmov\\ta,m\\t; Store the escaped character without\\n\\tinx\\th\\t; checking for anything except zero.\\n\\tstax\\td\\n\\tinx\\td\\n\\tana\\ta\\t; Zero is still end of string\\n\\trz\\n\\tjmp\\tsnext\\nssep:\\txra \\ta\\t; End of string, write zero terminator\\n\\tstax\\td\\n\\tinx\\td\\n\\tjmp\\tsnext\\n\\t;;;\\tUse the routine to split the test-case string\\ndemo:\\tmvi\\tb,'|'\\t; Separator character\\n\\tmvi\\tc,'^'\\t; Escape character\\n\\tlxi\\th,test\\t; Pointer to test string\\n\\tcall\\tsplit\\n\\t;;;\\tPrint each string on its own line\\n\\tlxi\\th,test\\nstr:\\tcall\\tputs\\t; Print string\\n\\tcall\\tcmp16\\t; Are we there yet?\\n\\tjnc\\tstr\\t; If not, print the next string\\n\\tret\\n\\t;;;\\t16-bit compare\\ncmp16:\\tmov\\ta,d\\n\\tcmp\\th\\n\\trnz\\n\\tmov\\ta,e\\n\\tcmp\\tl\\n\\tret\\n\\t;;;\\tPrint zero-terminated string with newline\\nputs:\\tpush\\td\\t; Keep DE registers\\n\\tpush\\th\\t; Keep pointer\\n\\tlxi \\td,pfx\\t; Print prefix\\n\\tmvi\\tc,9\\n\\tcall\\t5\\n\\tpop\\th\\t; Restore pointer\\nploop:\\tmov\\te,m\\t; Get current character\\n\\tpush\\th\\t; Keep pointer\\n\\tmvi\\tc,2\\t; CP/M print character\\n\\tcall\\t5\\n\\tpop\\th\\t; Restore pointer\\n\\tmov\\ta,m\\t; Is character zero?\\n\\tora\\ta\\n\\tinx\\th\\t; Increment pointer\\n\\tjnz\\tploop\\t; If not, there are more characters\\n\\tpush\\th\\t; Keep pointer\\n\\tlxi\\td,nl\\t; Write newline\\n\\tmvi\\tc,9\\t; CP/M print string\\n\\tcall\\t5\\n\\tpop\\th\\n\\tpop\\td\\t; Restore DE registers\\n\\tret\\npfx:\\tdb\\t'> $'\\t; Prefix to make the output more obvious\\nnl:\\tdb\\t13,10,'$'\\ntest:\\tdb\\t'one^|uno||three^^^^|four^^^|^cuatro|',0\\n\",\n \"language\": \"8080-Assembly\"\n },\n {\n \"code\": \"DEFINE PTR=\\\"CARD\\\"\\n\\nTYPE Tokens=[\\n PTR buf ;BYTE ARRAY\\n PTR arr ;CARD ARRAY\\n PTR endPtr\\n BYTE count]\\n\\nPROC Init(Tokens POINTER t BYTE ARRAY b PTR ARRAY a)\\n t.buf=b\\n t.arr=a\\n t.endPtr=b\\n t.count=0\\nRETURN\\n\\nPROC AddToken(Tokens POINTER t CHAR ARRAY s)\\n PTR ARRAY a\\n CHAR ARRAY tmp\\n\\n a=t.arr\\n tmp=t.endPtr\\n SCopy(tmp,s)\\n a(t.count)=tmp\\n t.count==+1\\n t.endPtr=t.endPtr+s(0)+1\\nRETURN\\n\\nPROC PrintTokens(Tokens POINTER t)\\n BYTE i\\n PTR ARRAY a\\n\\n a=t.arr\\n FOR i=0 TO t.count-1\\n DO\\n PrintF(\\\"\\\"\\\"%S\\\"\\\"%E\\\",a(i))\\n OD\\nRETURN\\n\\nPROC Append(CHAR ARRAY s CHAR c)\\n s(0)==+1\\n s(s(0))=c\\nRETURN\\n\\nPROC Tokenize(CHAR ARRAY s CHAR sep,esc Tokens POINTER res)\\n BYTE ARRAY b(200)\\n PTR ARRAY a(20)\\n CHAR ARRAY tmp(255)\\n BYTE i,isEsc\\n CHAR c\\n\\n Init(res,b,a)\\n isEsc=0\\n tmp(0)=0\\n FOR i=1 TO s(0)\\n DO\\n c=s(i)\\n IF isEsc THEN\\n isEsc=0\\n Append(tmp,c)\\n ELSE\\n IF c=esc THEN\\n isEsc=1\\n ELSEIF c=sep THEN\\n AddToken(res,tmp)\\n tmp(0)=0\\n ELSE\\n Append(tmp,c)\\n FI\\n FI\\n OD\\n AddToken(res,tmp)\\nRETURN\\n\\nPROC Main()\\n Tokens t\\n\\n Tokenize(\\\"one^|uno||three^^^^|four^^^|^cuatro|\\\",'|,'^,t)\\n PrintTokens(t)\\nRETURN\\n\",\n \"language\": \"Action-\"\n },\n {\n \"code\": \"with Ada.Text_Io;\\nwith Ada.Containers.Indefinite_Vectors;\\nwith Ada.Strings.Unbounded;\\n\\nprocedure Tokenize is\\n\\n package String_Vectors is\\n new Ada.Containers.Indefinite_Vectors (Positive, String);\\n use String_Vectors;\\n\\n function Split (Text : String;\\n Separator : Character := '|';\\n Escape : Character := '^') return Vector\\n is\\n use Ada.Strings.Unbounded;\\n Result : Vector;\\n Escaped : Boolean := False;\\n Accu : Unbounded_String;\\n begin\\n\\n for Char of Text loop\\n\\n case Escaped is\\n\\n when False =>\\n if Char = Escape then\\n Escaped := True;\\n elsif Char = Separator then\\n Append (Result, To_String (Accu));\\n Accu := Null_Unbounded_String;\\n else\\n Append (Accu, Char);\\n end if;\\n\\n when True =>\\n Append (Accu, Char);\\n Escaped := False;\\n\\n end case;\\n\\n end loop;\\n Append (Result, To_String (Accu));\\n\\n return Result;\\n end Split;\\n\\n procedure Put_Vector (List : Vector) is\\n use Ada.Text_Io;\\n begin\\n for Element of List loop\\n Put (\\\"'\\\"); Put (Element); Put (\\\"'\\\"); New_Line;\\n end loop;\\n end Put_Vector;\\n\\nbegin\\n Put_Vector (Split (\\\"one^|uno||three^^^^|four^^^|^cuatro|\\\"));\\nend Tokenize;\\n\",\n \"language\": \"Ada\"\n },\n {\n \"code\": \"BEGIN\\n # returns s parsed according to delimiter and escape #\\n PROC parse with escapes = ( STRING s, CHAR delimiter, escape )[]STRING:\\n IF ( UPB s - LWB s ) + 1 < 1 THEN\\n # empty string #\\n [ 1 : 0 ]STRING empty array;\\n empty array\\n ELSE\\n # at least one character #\\n # allow for a string composed entirely of delimiter characters #\\n [ 1 : ( UPB s - LWB s ) + 3 ]STRING result;\\n INT r pos := 1;\\n INT s pos := LWB s;\\n result[ r pos ] := \\\"\\\";\\n WHILE s pos <= UPB s DO\\n CHAR c = s[ s pos ];\\n IF c = delimiter THEN\\n # start a new element #\\n result[ r pos +:= 1 ] := \\\"\\\"\\n ELIF c = escape THEN\\n # use the next character even if it is an escape #\\n s pos +:= 1;\\n IF s pos < UPB s THEN\\n # the escape is not the last character #\\n result[ r pos ] +:= s[ s pos ]\\n FI\\n ELSE\\n # normal character #\\n result[ r pos ] +:= c\\n FI;\\n s pos +:= 1\\n OD;\\n result[ 1 : r pos ]\\n FI; # parse with escapes #\\n # task test case #\\n []STRING tokens = parse with escapes( \\\"one^|uno||three^^^^|four^^^|^cuatro|\\\", \\\"|\\\", \\\"^\\\" );\\n FOR t pos FROM LWB tokens TO UPB tokens DO print( ( \\\"[\\\", tokens[ t pos ], \\\"]\\\", newline ) ) OD\\nEND\\n\",\n \"language\": \"ALGOL-68\"\n },\n {\n \"code\": \"------------------ TOKENIZE WITH ESCAPING ----------------\\n\\n-- tokenize :: String -> Character -> Character -> [String]\\non tokenize(str, delimChar, chrEsc)\\n\\n script charParse\\n -- Record: {esc:Bool, token:String, tokens:[String]}\\n -- charParse :: Record -> Character -> Record\\n on |λ|(a, x)\\n set blnEsc to esc of a\\n set blnEscChar to ((not blnEsc) and (x = chrEsc))\\n\\n if ((not blnEsc) and (x = delimChar)) then\\n set k to \\\"\\\"\\n set ks to (tokens of a) & token of a\\n else\\n set k to (token of a) & cond(blnEscChar, \\\"\\\", x)\\n set ks to tokens of (a)\\n end if\\n\\n {esc:blnEscChar, token:k, tokens:ks}\\n end |λ|\\n end script\\n\\n set recParse to foldl(charParse, ¬\\n {esc:false, token:\\\"\\\", tokens:[]}, splitOn(\\\"\\\", str))\\n\\n tokens of recParse & token of recParse\\nend tokenize\\n\\n\\n--------------------------- TEST -------------------------\\non run\\n script numberedLine\\n on |λ|(a, s)\\n set iLine to lineNum of a\\n {lineNum:iLine + 1, report:report of a & iLine & \\\":\\\" & tab & s & linefeed}\\n end |λ|\\n end script\\n\\n report of foldl(numberedLine, {lineNum:1, report:\\\"\\\"}, ¬\\n tokenize(\\\"one^|uno||three^^^^|four^^^|^cuatro|\\\", \\\"|\\\", \\\"^\\\"))\\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-- 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-- splitOn :: String -> String -> [String]\\non splitOn(pat, src)\\n set {dlm, my text item delimiters} to ¬\\n {my text item delimiters, pat}\\n set xs to text items of src\\n set my text item delimiters to dlm\\n return xs\\nend splitOn\\n\\n\\n-- cond :: Bool -> a -> a -> a\\non cond(bool, f, g)\\n if bool then\\n f\\n else\\n g\\n end if\\nend cond\\n\",\n \"language\": \"AppleScript\"\n },\n {\n \"code\": \"tokenize: function [s sep esc][\\n\\tescaping: 0\\n\\n\\tloop 0..(size s)-1 [i][\\n\\t\\tchr: get split s i\\n\\n\\t\\tif? escaping=1 [\\n\\t\\t\\tprints chr\\n\\t\\t\\tescaping: 0\\n\\t\\t]\\n\\t\\telse [\\n\\t\\t\\tcase [chr]\\n\\t\\t\\t\\twhen? [=sep] [print \\\"\\\"]\\n\\t\\t\\t\\twhen? [=esc] [escaping: 1]\\n\\t\\t\\t\\telse [prints chr]\\n\\t\\t]\\n\\t]\\n\\tprint \\\"\\\"\\n]\\n\\nstr: \\\"one^|uno||three^^^^|four^^^|^cuatro|\\\"\\ntokenize str \\\"|\\\" \\\"^\\\"\\n\",\n \"language\": \"Arturo\"\n },\n {\n \"code\": \"Tokenize(s,d,e){\\n\\tfor i,v in x:=StrSplit(StrReplace(StrReplace(StrReplace(s,e e,Chr(0xFFFE)),e d,Chr(0xFFFF)),e),d)\\n\\t\\tx[i]:=StrReplace(StrReplace(v,Chr(0xFFFE),e),Chr(0xFFFF),d)\\n\\treturn x\\n}\\n\",\n \"language\": \"AutoHotkey\"\n },\n {\n \"code\": \"str := \\\"one^|uno||three^^^^|four^^^|^cuatro|\\\"\\nfor i, v in Tokenize(str, \\\"|\\\", \\\"^\\\")\\n\\toutput .= i \\\" : \\\" v \\\"`n\\\"\\nMsgBox % output\\n\",\n \"language\": \"AutoHotkey\"\n },\n {\n \"code\": \"REM >tokenizer\\nPROC_tokenize(\\\"one^|uno||three^^^^|four^^^|^cuatro|\\\", \\\"|\\\", \\\"^\\\")\\nEND\\n:\\nDEF PROC_tokenize(src$, sep$, esc$)\\nLOCAL field%, char$, escaping%, i%\\nfield% = 1\\nescaping% = FALSE\\nPRINT field%; \\\" \\\";\\nFOR i% = 1 TO LEN src$\\n char$ = MID$(src$, i%, 1)\\n IF escaping% THEN\\n PRINT char$;\\n escaping% = FALSE\\n ELSE\\n CASE char$ OF\\n WHEN sep$\\n PRINT\\n field% += 1\\n PRINT field%; \\\" \\\";\\n WHEN esc$\\n escaping% = TRUE\\n OTHERWISE\\n PRINT char$;\\n ENDCASE\\n ENDIF\\nNEXT\\nPRINT\\nENDPROC\\n\",\n \"language\": \"BBC-BASIC\"\n },\n {\n \"code\": \"str ← \\\"one^|uno||three^^^^|four^^^|^cuatro|\\\"\\nSplit ← ((⊢-˜+`׬)∘=⊔⊢)\\nSplitE ← {\\n esc ← <`'^'=𝕩\\n rem ← »esc\\n spl ← (¬rem)∧'|'=𝕩\\n 𝕩⊔˜(⊢-(esc∨spl)×1⊸+)+`spl\\n}\\n\\n•Show SplitE str\\n\",\n \"language\": \"BQN\"\n },\n {\n \"code\": \"⟨ \\\"one|uno\\\" ⟨⟩ \\\"three^^\\\" \\\"four^|cuatro\\\" ⟩\\n\",\n \"language\": \"BQN\"\n },\n {\n \"code\": \"#include <stdlib.h>\\n#include <stdio.h>\\n\\n#define STR_DEMO \\\"one^|uno||three^^^^|four^^^|^cuatro|\\\"\\n#define SEP '|'\\n#define ESC '^'\\n\\ntypedef char* Str; /* just for an easier reading */\\n\\n/* ===> FUNCTION PROTOTYPES <================================================ */\\nunsigned int ElQ( const char *s, char sep, char esc );\\nStr *Tokenize( char *s, char sep, char esc, unsigned int *q );\\n\\n/*==============================================================================\\nMain function.\\nJust passes a copy of the STR_DEMO string to the tokenization function and shows\\nthe results.\\n==============================================================================*/\\n\\nint main() {\\n char s[] = STR_DEMO;\\n unsigned int i, q;\\n\\n Str *list = Tokenize( s, SEP, ESC, &q );\\n\\n if( list != NULL ) {\\n printf( \\\"\\\\n Original string: %s\\\\n\\\\n\\\", STR_DEMO );\\n printf( \\\" %d tokens:\\\\n\\\\n\\\", q );\\n\\n for( i=0; i<q; ++i )\\n printf( \\\" %4d. %s\\\\n\\\", i+1, list[i] );\\n\\n free( list );\\n }\\n\\n return 0;\\n}\\n\\n/*==============================================================================\\n\\\"ElQ\\\" stands for \\\"Elements Quantity\\\". Counts the amount of valid element in the\\nstring s, according to the separator character provided in sep and the escape\\ncharacter provided in esc.\\n==============================================================================*/\\n\\nunsigned int ElQ( const char *s, char sep, char esc ) {\\n unsigned int q, e;\\n const char *p;\\n\\n for( e=0, q=1, p=s; *p; ++p ) {\\n if( *p == esc )\\n e = !e;\\n else if( *p == sep )\\n q += !e;\\n else e = 0;\\n }\\n\\n return q;\\n}\\n\\n/*==============================================================================\\nThe actual tokenization function.\\nAllocates as much dynamic memory as needed to contain the pointers to the\\ntokenized portions of the string passed as the \\\"s\\\" parameter, then looks for the\\nseparators characters sep, paying attention to the occurrences of the escape\\ncharacter provided in esc. When a valid separator is found, the function swaps\\nit with a '\\\\0' terminator character and stores the pointer to the next string\\ninto the array of pointers in dynamic memory. On output, the value of *q is the\\nnumber of pointers in the array. The caller is responsible for deallocating with\\nfree() the returned array of pointers when it is no longer needed.\\nIn case of failure, NULL is returned.\\n==============================================================================*/\\n\\nStr *Tokenize( char *s, char sep, char esc, unsigned int *q ) {\\n Str *list = NULL;\\n\\n *q = ElQ( s, sep, esc );\\n list = malloc( *q * sizeof(Str) );\\n\\n if( list != NULL ) {\\n unsigned int e, i;\\n char *p;\\n\\n i = 0;\\n list[i++] = s;\\n\\n for( e=0, p=s; *p; ++p ) {\\n if( *p == esc ) {\\n e = !e;\\n }\\n else if( *p == sep && !e ) {\\n list[i++] = p+1;\\n *p = '\\\\0';\\n }\\n else {\\n e = 0;\\n }\\n }\\n }\\n\\n return list;\\n}\\n\",\n \"language\": \"C\"\n },\n {\n \"code\": \"#include <iostream>\\n#include <stdexcept>\\n#include <string>\\n#include <vector>\\n\\nusing namespace std;\\n\\nvector<string> tokenize(const string& input, char seperator, char escape) {\\n vector<string> output;\\n string token;\\n\\n bool inEsc = false;\\n for (char ch : input) {\\n if (inEsc) {\\n inEsc = false;\\n } else if (ch == escape) {\\n inEsc = true;\\n continue;\\n } else if (ch == seperator) {\\n output.push_back(token);\\n token = \\\"\\\";\\n continue;\\n }\\n token += ch;\\n }\\n if (inEsc)\\n throw new invalid_argument(\\\"Invalid terminal escape\\\");\\n\\n output.push_back(token);\\n return output;\\n}\\n\\nint main() {\\n string sample = \\\"one^|uno||three^^^^|four^^^|^cuatro|\\\";\\n\\n cout << sample << endl;\\n cout << '[';\\n for (auto t : tokenize(sample, '|', '^')) {\\n cout << '\\\"' << t << \\\"\\\\\\\", \\\";\\n }\\n cout << ']' << endl;\\n\\n return 0;\\n}\\n\",\n \"language\": \"C++\"\n },\n {\n \"code\": \"using System;\\nusing System.Text;\\nusing System.Collections.Generic;\\n\\npublic class TokenizeAStringWithEscaping\\n{\\n public static void Main() {\\n string testcase = \\\"one^|uno||three^^^^|four^^^|^cuatro|\\\";\\n foreach (var token in testcase.Tokenize(separator: '|', escape: '^')) {\\n Console.WriteLine(\\\": \\\" + token); //Adding a : so we can see empty lines\\n }\\n }\\n}\\n\\npublic static class Extensions\\n{\\n public static IEnumerable<string> Tokenize(this string input, char separator, char escape) {\\n if (input == null) yield break;\\n var buffer = new StringBuilder();\\n bool escaping = false;\\n foreach (char c in input) {\\n if (escaping) {\\n buffer.Append(c);\\n escaping = false;\\n } else if (c == escape) {\\n escaping = true;\\n } else if (c == separator) {\\n yield return buffer.Flush();\\n } else {\\n buffer.Append(c);\\n }\\n }\\n if (buffer.Length > 0 || input[input.Length-1] == separator) yield return buffer.Flush();\\n }\\n\\n public static string Flush(this StringBuilder stringBuilder) {\\n string result = stringBuilder.ToString();\\n stringBuilder.Clear();\\n return result;\\n }\\n}\\n\",\n \"language\": \"C-sharp\"\n },\n {\n \"code\": \"tokenize = iter (sep, esc: char, s: string) yields (string)\\n escape: bool := false\\n part: array[char] := array[char]$[]\\n for c: char in string$chars(s) do\\n if escape then\\n escape := false\\n array[char]$addh(part,c)\\n elseif c=esc then\\n escape := true\\n elseif c=sep then\\n yield(string$ac2s(part))\\n part := array[char]$[]\\n else\\n array[char]$addh(part,c)\\n end\\n end\\n yield(string$ac2s(part))\\nend tokenize\\n\\nstart_up = proc ()\\n po: stream := stream$primary_output()\\n testcase: string := \\\"one^|uno||three^^^^|four^^^|^quatro|\\\"\\n\\n for part: string in tokenize('|', '^', testcase) do\\n stream$putl(po, \\\"\\\\\\\"\\\" || part || \\\"\\\\\\\"\\\")\\n end\\nend start_up\\n\",\n \"language\": \"CLU\"\n },\n {\n \"code\": \" >>SOURCE FORMAT FREE\\nidentification division.\\nprogram-id. 'tokenizewithescaping'.\\nenvironment division.\\nconfiguration section.\\nrepository.\\n function all intrinsic.\\ndata division.\\nworking-storage section.\\n\\n01 escape-char pic x value '^'.\\n01 separator-char pic x value '|'.\\n01 reference-string pic x(64) value\\n 'one^|uno||three^^^^|four^^^|^cuatro|'.\\n\\n01 input-string pic x(64).\\n01 c pic 99.\\n01 escaped pic x.\\n\\n01 t pic 99.\\n01 t-max pic 99.\\n01 t-lim pic 99 value 32.\\n01 token-entry occurs 32.\\n 03 token-len pic 99.\\n 03 token pic x(16).\\n\\n01 l pic 99.\\n01 l-lim pic 99 value 16.\\n\\n01 error-found pic x.\\n\\nprocedure division.\\nstart-tokenize-with-escaping.\\n\\n move reference-string to input-string\\n perform tokenize\\n\\n move 'token' to input-string\\n perform tokenize\\n\\n move '^^^^^^^^' to input-string\\n perform tokenize\\n\\n move '||||||||' to input-string\\n perform tokenize\\n\\n move all 'token' to input-string\\n perform tokenize\\n\\n move all 't|' to input-string\\n perform tokenize\\n\\n move spaces to input-string\\n perform tokenize\\n\\n display space\\n\\n stop run\\n .\\ntokenize.\\n display space\\n display 'string:'\\n display input-string\\n\\n move 'N' to escaped error-found\\n move 1 to t-max\\n initialize token-entry(t-max)\\n move 0 to l\\n\\n perform varying c from 1 by 1 until\\n c > length(input-string)\\n or input-string(c:) = spaces\\n\\n evaluate escaped also input-string(c:1)\\n when 'N' also escape-char\\n move 'Y' to escaped\\n when 'N' also separator-char\\n perform increment-t-max\\n if error-found = 'Y'\\n exit paragraph\\n end-if\\n when 'N' also any\\n perform move-c\\n if error-found = 'Y'\\n exit paragraph\\n end-if\\n when 'Y' also any\\n perform move-c\\n if error-found = 'Y'\\n exit paragraph\\n end-if\\n move 'N' to escaped\\n end-evaluate\\n\\n end-perform\\n if l > 0\\n move l to token-len(t-max)\\n end-if\\n\\n if c = 1\\n display 'no tokens'\\n else\\n display 'tokens:'\\n perform varying t from 1 by 1 until t > t-max\\n if token-len(t) > 0\\n display t ': ' token-len(t) space token(t)\\n else\\n display t ': ' token-len(t)\\n end-if\\n end-perform\\n end-if\\n .\\nincrement-t-max.\\n if t-max >= t-lim\\n display 'error: at ' c ' number of tokens exceeds ' t-lim\\n move 'Y' to error-found\\n else\\n move l to token-len(t-max)\\n add 1 to t-max\\n initialize token-entry(t-max)\\n move 0 to l\\n move 'N' to error-found\\n end-if\\n .\\nmove-c.\\n if l >= l-lim\\n display 'error: at ' c ' token length exceeds ' l-lim\\n move 'Y' to error-found\\n else\\n add 1 to l\\n move input-string(c:1) to token(t-max)(l:1)\\n move 'N' to error-found\\n end-if\\n .\\nend program 'tokenizewithescaping'.\\n\",\n \"language\": \"COBOL\"\n },\n {\n \"code\": \"(defun split (input separator escape)\\n (flet ((make-string-buffer ()\\n (make-array 0 :element-type 'character :adjustable t :fill-pointer t)))\\n (loop with token = (make-string-buffer)\\n with result = nil\\n with to-be-escaped = nil\\n for ch across input\\n do (cond (to-be-escaped\\n (vector-push-extend ch token)\\n (setf to-be-escaped nil))\\n ((char= ch escape)\\n (setf to-be-escaped t))\\n ((char= ch separator)\\n (push token result)\\n (setf token (make-string-buffer)))\\n (t\\n (vector-push-extend ch token)))\\n finally (push token result)\\n (return (nreverse result)))))\\n\\n(defun main ()\\n (dolist (token (split \\\"one^|uno||three^^^^|four^^^|^cuatro|\\\" #\\\\| #\\\\^))\\n (format t \\\"'~A'~%\\\" token)))\\n\",\n \"language\": \"Common-Lisp\"\n },\n {\n \"code\": \"import std.stdio;\\n\\nvoid main() {\\n string sample = \\\"one^|uno||three^^^^|four^^^|^cuatro|\\\";\\n\\n writeln(sample);\\n writeln(tokenizeString(sample, '|', '^'));\\n}\\n\\nauto tokenizeString(string source, char seperator, char escape) {\\n import std.array : appender;\\n import std.exception : enforce;\\n\\n auto output = appender!(string[]);\\n auto token = appender!(char[]);\\n\\n bool inEsc;\\n foreach(ch; source) {\\n if (inEsc) {\\n inEsc = false;\\n } else if (ch == escape) {\\n inEsc = true;\\n continue;\\n } else if (ch == seperator) {\\n output.put(token.data.idup);\\n token.clear();\\n continue;\\n }\\n token.put(ch);\\n }\\n enforce(!inEsc, \\\"Invalid terminal escape\\\");\\n\\n output.put(token.data.idup);\\n return output.data;\\n}\\n\",\n \"language\": \"D\"\n },\n {\n \"code\": \"func String.Tokenize(separator, escape) {\\n var buffer = []\\n var escaping = false\\n for c in this {\\n if escaping {\\n buffer.Add(c)\\n escaping = false\\n } else if c == escape {\\n escaping = true\\n } else if c == separator {\\n yield buffer.Flush();\\n } else {\\n buffer.Add(c);\\n }\\n }\\n\\n if buffer.Length() > 0 || this[this.Length() - 1] == separator {\\n yield buffer.Flush()\\n }\\n}\\n\\nfunc Array.Flush() {\\n var str = String.Concat(values: this)\\n this.Clear()\\n str\\n}\\n\\nlet testcase = \\\"one^|uno||three^^^^|four^^^|^cuatro|\\\";\\nfor token in testcase.Tokenize(separator: '|', escape: '^') {\\n print(\\\": \\\\(token)\\\")\\n}\\n\",\n \"language\": \"Dyalect\"\n },\n {\n \"code\": \"import extensions;\\nimport extensions'routines;\\nimport system'collections;\\nimport system'routines;\\nimport system'text;\\n\\nextension op : String\\n{\\n tokenize(separator,escape)\\n {\\n auto buffer := new TextBuilder();\\n auto list := new ArrayList();\\n\\n bool escaping := false;\\n self.forEach::(ch)\\n {\\n if (escaping)\\n {\\n buffer.write(ch);\\n escaping := false\\n }\\n else if (ch == escape)\\n {\\n escaping := true\\n }\\n else if (ch == separator)\\n {\\n list.append(buffer.Value);\\n buffer.clear()\\n }\\n else\\n {\\n buffer.write(ch)\\n }\\n };\\n\\n ^ list\\n }\\n}\\n\\nconst string testcase = \\\"one^|uno||three^^^^|four^^^|^cuatro|\\\";\\n\\npublic program()\\n{\\n testcase.tokenize(\\\"|\\\", \\\"^\\\").forEach(printingLn)\\n}\\n\",\n \"language\": \"Elena\"\n },\n {\n \"code\": \"open System\\nopen System.Text.RegularExpressions\\n\\n(*\\n .NET regexes have unlimited look-behind, so we can look for separators\\n which are preceeded by an even number of (or no) escape characters\\n*)\\nlet split esc sep s =\\n Regex.Split (\\n s,\\n String.Format(\\\"(?<=(?:\\\\b|[^{0}])(?:{0}{0})*){1}\\\", Regex.Escape(esc), Regex.Escape(sep))\\n )\\n\\nlet unescape esc s =\\n Regex.Replace(\\n s,\\n Regex.Escape(esc) + \\\"(.)\\\",\\n \\\"$1\\\"\\n )\\n\\n[<EntryPoint>]\\nlet main argv =\\n let (esc, sep) = (\\\"^\\\", \\\"|\\\")\\n \\\"one^|uno||three^^^^|four^^^|^cuatro|\\\"\\n |> split esc sep\\n |> Seq.map (unescape esc)\\n |> Seq.iter (fun s -> printfn \\\"'%s'\\\" s)\\n 0\\n\",\n \"language\": \"F-Sharp\"\n },\n {\n \"code\": \"USING: accessors kernel lists literals namespaces\\nparser-combinators prettyprint sequences strings ;\\n\\nSYMBOLS: esc sep ;\\n\\n: set-chars ( m n -- ) [ sep set ] [ esc set ] bi* ;\\n: escape ( -- parser ) esc get 1token ;\\n: escaped ( -- parser ) escape any-char-parser &> ;\\n: separator ( -- parser ) sep get 1token ;\\n\\n: character ( -- parser )\\n ${ esc get sep get } [ member? not ] curry satisfy ;\\n\\n: my-token ( -- parser ) escaped character <|> <*> ;\\n\\n: token-list ( -- parser )\\n my-token separator list-of [ [ >string ] map ] <@ ;\\n\\n: tokenize ( str sep-char esc-char -- seq )\\n set-chars token-list parse car parsed>> ;\\n\\n\\\"one^|uno||three^^^^|four^^^|^cuatro|\\\"\\nCHAR: | CHAR: ^ tokenize .\\n\",\n \"language\": \"Factor\"\n },\n {\n \"code\": \"variable\\t 'src\\nvariable\\t #src\\nvariable offset\\n\\n: advance 1 offset +! ;\\n: chr@ offset @ 'src @ + c@ ;\\n: nextchr advance chr@ ;\\n: bound offset @ #src @ u< ;\\n: separator? dup [char] | = if drop cr else emit then ;\\n: escape? dup [char] ^ = if drop nextchr emit else separator? then ;\\n: tokenize 0 offset ! begin bound while nextchr escape? repeat ;\\n\\n\\\\ Test of function\\nHere 'src ! ,\\\" one^|uno||three^^^^|four^^^|^cuatro|\\\" here 'src @ - #src !\\npage\\ncr .\\\" #### start ####\\\" cr tokenize cr .\\\" #### End ####\\\" cr\\n\",\n \"language\": \"Forth\"\n },\n {\n \"code\": \" SUBROUTINE SPLIT(TEXT,SEP,ESC)\\t!Identifies and prints tokens from within a text.\\n CHARACTER*(*) TEXT\\t!To be scanned.\\n CHARACTER*(1) SEP\\t!The only separator for tokens.\\n CHARACTER*(1) ESC\\t!Miscegnator.\\n CHARACTER*(LEN(TEXT)) TOKEN\\t!Surely sufficient space.\\n INTEGER N\\t!Counts the tokens as they're found.\\n INTEGER I\\t!Steps through the text.\\n INTEGER L\\t!Length of the token so far accumulated.\\n LOGICAL ESCAPING\\t!Miscegnatory state.\\n N = 0\\t\\t!No tokens so far.\\n L = 0\\t\\t!Nor any text for the first.\\n ESCAPING = .FALSE.\\t!And the state is good.\\n DO I = 1,LEN(TEXT)\\t!Step through the text.\\n IF (ESCAPING) THEN\\t!Are we in a mess?\\n L = L + 1\\t\\t\\t!Yes. An ESC character had been seen.\\n TOKEN(L:L) = TEXT(I:I)\\t!So, whatever follows is taken as itself.\\n ESCAPING = .FALSE.\\t\\t!There are no specially-recognised names.\\n ELSE\\t\\t\\t!Otherwise, we're in text to inspect.\\n IF (TEXT(I:I).EQ.ESC) THEN\\t!So, is it a troublemaker?\\n ESCAPING = .TRUE.\\t\\t\\t!Yes! Trouble is to follow.\\n ELSE IF (TEXT(I:I).EQ.SEP) THEN\\t!If instead a separator,\\n CALL SPLOT\\t\\t\\t\\t!Then the token up to it is complete.\\n ELSE\\t\\t\\t!Otherwise, a simple constituent character.\\n L = L + 1\\t\\t\\t\\t!So, count it in.\\n TOKEN(L:L) = TEXT(I:I)\\t\\t!And copy it in.\\n END IF\\t\\t\\t!So much for grist.\\n END IF\\t\\t!So much for that character.\\n END DO\\t\\t\\t!On to the next.\\nCompletes on end-of-text with L > 0, or, if the last character had been SEP, a null token is deemed to be following.\\n CALL SPLOT\\t!Tail end.\\n CONTAINS\\t!Save on having two copies of this code.\\n SUBROUTINE SPLOT\\t!Show the token and scrub.\\n N = N + 1\\t\\t\\t!Another one.\\n WRITE (6,1) N,TOKEN(1:L)\\t!Reveal.\\n 1 FORMAT (\\\"Token \\\",I0,\\\" >\\\",A,\\\"<\\\")!Fancy layout.\\n L = 0\\t\\t\\t\\t!Prepare for a fresh token.\\n END SUBROUTINE SPLOT\\t!A brief life.\\n END SUBROUTINE SPLIT\\t!And then oblivion.\\n\\n PROGRAM POKE\\n\\n CALL SPLIT(\\\"one^|uno||three^^^^|four^^^|^cuatro|\\\",\\\"|\\\",\\\"^\\\")\\n\\n END\\n\",\n \"language\": \"Fortran\"\n },\n {\n \"code\": \"Sub tokenize(cadena As String, separador As String, escape As String)\\n Dim As Integer campo = 1\\n Dim As Boolean escapando = false\\n Dim As String char\\n Print \\\"\\\"; campo; \\\" \\\";\\n\\n For i As Integer = 1 To Len(cadena)\\n char = Mid(cadena, i, 1)\\n If escapando Then\\n Print char;\\n escapando = false\\n Else\\n Select Case char\\n Case separador\\n Print\\n campo += 1\\n Print \\\"\\\"; campo; \\\" \\\";\\n Case escape\\n escapando = true\\n Case Else\\n Print char;\\n End Select\\n End If\\n Next i\\n Print\\nEnd Sub\\n\\ntokenize(\\\"one^|uno||three^^^^|four^^^|^cuatro|\\\", \\\"|\\\", \\\"^\\\")\\nSleep\\n\",\n \"language\": \"FreeBASIC\"\n },\n {\n \"code\": \"package main\\n\\nimport (\\n\\t\\\"errors\\\"\\n\\t\\\"fmt\\\"\\n)\\n\\nfunc TokenizeString(s string, sep, escape rune) (tokens []string, err error) {\\n\\tvar runes []rune\\n\\tinEscape := false\\n\\tfor _, r := range s {\\n\\t\\tswitch {\\n\\t\\tcase inEscape:\\n\\t\\t\\tinEscape = false\\n\\t\\t\\tfallthrough\\n\\t\\tdefault:\\n\\t\\t\\trunes = append(runes, r)\\n\\t\\tcase r == escape:\\n\\t\\t\\tinEscape = true\\n\\t\\tcase r == sep:\\n\\t\\t\\ttokens = append(tokens, string(runes))\\n\\t\\t\\trunes = runes[:0]\\n\\t\\t}\\n\\t}\\n\\ttokens = append(tokens, string(runes))\\n\\tif inEscape {\\n\\t\\terr = errors.New(\\\"invalid terminal escape\\\")\\n\\t}\\n\\treturn tokens, err\\n}\\n\\nfunc main() {\\n\\tconst sample = \\\"one^|uno||three^^^^|four^^^|^cuatro|\\\"\\n\\tconst separator = '|'\\n\\tconst escape = '^'\\n\\n\\tfmt.Printf(\\\"Input: %q\\\\n\\\", sample)\\n\\ttokens, err := TokenizeString(sample, separator, escape)\\n\\tif err != nil {\\n\\t\\tfmt.Println(\\\"error:\\\", err)\\n\\t} else {\\n\\t\\tfmt.Printf(\\\"Tokens: %q\\\\n\\\", tokens)\\n\\t}\\n}\\n\",\n \"language\": \"Go\"\n },\n {\n \"code\": \"splitEsc :: (Foldable t1, Eq t) => t -> t -> t1 t -> [[t]]\\nsplitEsc sep esc = reverse . map reverse . snd . foldl process (0, [[]])\\n where process (st, r:rs) ch\\n | st == 0 && ch == esc = (1, r:rs)\\n | st == 0 && ch == sep = (0, []:r:rs)\\n | st == 1 && sep == esc && ch /= sep = (0, [ch]:r:rs)\\n | otherwise = (0, (ch:r):rs)\\n\",\n \"language\": \"Haskell\"\n },\n {\n \"code\": \"{-#Language LambdaCase #-}\\nimport Conduit\\n\\nsplitEscC :: (Monad m, Eq t) => t -> t -> Conduit t m [t]\\nsplitEscC sep esc = mapOutput reverse $ go True []\\n where\\n go notEsc b = await >>= \\\\case\\n Nothing -> yield b\\n Just ch | notEsc && ch == esc -> go False b\\n | notEsc && ch == sep -> yield b >> go True []\\n | otherwise -> go True (ch:b)\\n\",\n \"language\": \"Haskell\"\n },\n {\n \"code\": \"main = runConduit $\\n yieldMany \\\"one^|uno||three^^^^|four^^^|^cuatro|\\\"\\n .| splitEscC '|' '^'\\n .| mapM_C print\\n\",\n \"language\": \"Haskell\"\n },\n {\n \"code\": \"import Data.Bool (bool)\\n\\n------------------ TOKENIZE WITH ESCAPING ----------------\\n\\ntokenize :: Char -> Char -> String -> [String]\\ntokenize delim esc str =\\n reverse $\\n reverse <$> (token : list)\\n where\\n (token, list, _) =\\n foldr\\n ( \\\\x (aToken, aList, aEsc) ->\\n let literal = not aEsc\\n isEsc = literal && (x == esc)\\n in bool\\n ( bool (x : aToken) aToken isEsc,\\n aList,\\n isEsc\\n )\\n ([], aToken : aList, isEsc)\\n (literal && x == delim)\\n )\\n ([], [], False)\\n (reverse str)\\n\\n--------------------------- TEST -------------------------\\nmain :: IO ()\\nmain =\\n mapM_ print $\\n tokenize\\n '|'\\n '^'\\n \\\"one^|uno||three^^^^|four^^^|^cuatro|\\\"\\n\",\n \"language\": \"Haskell\"\n },\n {\n \"code\": \"tokenize1=: tokenize =: '^|'&$: :(4 : 0)\\n 'ESC SEP' =. x\\n STATE =. 0\\n RESULT =. 0 $ a:\\n TOKEN =. ''\\n for_C. y do.\\n if. STATE do.\\n TOKEN =. TOKEN , C\\n STATE =. 0\\n else.\\n if. C = ESC do.\\n STATE =. 1\\n elseif. C = SEP do.\\n RESULT =. RESULT , < TOKEN\\n TOKEN =. ''\\n elseif. do.\\n TOKEN =. TOKEN , C\\n end.\\n end.\\n end.\\n RESULT =. RESULT , < TOKEN\\n)\\n\",\n \"language\": \"J\"\n },\n {\n \"code\": \"tokenize2=: tokenize=:3 :0\\n '^|' tokenize2 y NB. task default escape and separator\\n:\\n 'ESC SEP'=. x\\n E=. 18 b./\\\\.&.|.ESC=y NB. escape positions\\n S=. (SEP=y)>_1}.0,E NB. separator positions\\n K=. -.E+.S NB. keep positions\\n T=. (#y){. 1,}.S NB. token beginnings\\n (T<;.1 K)#&.>T<;.1 y\\n)\\n\",\n \"language\": \"J\"\n },\n {\n \"code\": \" '^|' tokenize 'one^|uno||three^^^^|four^^^|^cuatro|'\\n┌───────┬┬───────┬────────────┬┐\\n│one|uno││three^^│four^|cuatro││\\n└───────┴┴───────┴────────────┴┘\\n\",\n \"language\": \"J\"\n },\n {\n \"code\": \"charTokens =: (0;(3 2 2$(2 1 1 1 2 2 1 2 1 0 1 0));<<'^')&;: NB. sequential machine\\nsplitTokens =: ((<,'|')&= <;._1 ])@:((<,'|'),])\\nremoveExtra =: (}.^:(1<#)) L:0\\ntokenize3=: tokenize=: ; each @: (removeExtra @: splitTokens @: charTokens)\\n\",\n \"language\": \"J\"\n },\n {\n \"code\": \" t=: 'one^|uno||three^^^^|four^^^|^cuatro|'\\n\\n tokenize t\\n┌───────┬┬───────┬────────────┬┐\\n│one|uno││three^^│four^|cuatro││\\n└───────┴┴───────┴────────────┴┘\\n\\n $tokenize t\\n5\\n\",\n \"language\": \"J\"\n },\n {\n \"code\": \" txt=: 1e5$'one^|uno||three^^^^|four^^^|^cuatro|'\\n\\n (%\\\"1 <./) timespacex every 'tokenize1 txt';'tokenize2 txt';'tokenize3 txt'\\n132.856 1\\n 1 7.73534\\n8.29568 19.9766\\n\",\n \"language\": \"J\"\n },\n {\n \"code\": \"import java.util.*;\\n\\npublic class TokenizeStringWithEscaping {\\n\\n public static void main(String[] args) {\\n String sample = \\\"one^|uno||three^^^^|four^^^|^cuatro|\\\";\\n char separator = '|';\\n char escape = '^';\\n\\n System.out.println(sample);\\n try {\\n System.out.println(tokenizeString(sample, separator, escape));\\n } catch (Exception e) {\\n System.out.println(e);\\n }\\n }\\n\\n public static List<String> tokenizeString(String s, char sep, char escape)\\n throws Exception {\\n List<String> tokens = new ArrayList<>();\\n StringBuilder sb = new StringBuilder();\\n\\n boolean inEscape = false;\\n for (char c : s.toCharArray()) {\\n if (inEscape) {\\n inEscape = false;\\n } else if (c == escape) {\\n inEscape = true;\\n continue;\\n } else if (c == sep) {\\n tokens.add(sb.toString());\\n sb.setLength(0);\\n continue;\\n }\\n sb.append(c);\\n }\\n if (inEscape)\\n throw new Exception(\\\"Invalid terminal escape\\\");\\n\\n tokens.add(sb.toString());\\n\\n return tokens;\\n }\\n}\\n\",\n \"language\": \"Java\"\n },\n {\n \"code\": \"function tokenize(s, esc, sep) {\\n\\tfor (var a=[], t='', i=0, e=s.length; i<e; i+=1) {\\n\\t\\tvar c = s.charAt(i)\\n\\t\\tif (c == esc) t+=s.charAt(++i)\\n\\t\\telse if (c != sep) t+=c\\n\\t\\telse a.push(t), t=''\\t\\t\\n\\t}\\n\\ta.push(t)\\n\\treturn a\\n}\\n\\nvar s = 'one^|uno||three^^^^|four^^^|^cuatro|'\\ndocument.write(s, '<br>')\\t\\nfor (var a=tokenize(s,'^','|'), i=0; i<a.length; i+=1) document.write(i, ': ', a[i], '<br>')\\n\",\n \"language\": \"JavaScript\"\n },\n {\n \"code\": \"(function () {\\n 'use strict';\\n\\n // tokenize :: String -> Character -> Character -> [String]\\n function tokenize(str, charDelim, charEsc) {\\n var dctParse = str.split('')\\n .reduce(function (a, x) {\\n\\n var blnEsc = a.esc,\\n blnBreak = !blnEsc && x === charDelim,\\n blnEscChar = !blnEsc && x === charEsc;\\n\\n return {\\n esc: blnEscChar,\\n token: blnBreak ? '' : (\\n a.token + (blnEscChar ? '' : x)\\n ),\\n list: a.list.concat(blnBreak ? a.token : [])\\n };\\n }, {\\n esc: false,\\n token: '',\\n list: []\\n });\\n\\n return dctParse.list.concat(\\n dctParse.token\\n );\\n }\\n\\n return tokenize(\\n 'one^|uno||three^^^^|four^^^|^cuatro|',\\n '|','^'\\n )\\n .join('\\\\n');\\n\\n})();\\n\",\n \"language\": \"JavaScript\"\n },\n {\n \"code\": \"((() => {\\n\\n // tokenize :: String -> Character -> Character -> [String]\\n const tokenize = (charDelim, charEsc, str) => {\\n const [token, list, _] = str.split('')\\n .reduce(([aToken, aList, aEsc], x) => {\\n const\\n blnBreak = !aEsc && x === charDelim,\\n blnEscChar = !aEsc && x === charEsc;\\n\\n return [\\n blnBreak ? '' : (\\n aToken + (blnEscChar ? '' : x)\\n ),\\n aList.concat(blnBreak ? aToken : []),\\n blnEscChar\\n ];\\n }, ['', [], false]);\\n\\n return list.concat(token);\\n };\\n\\n // splitEsc :: String -> [String]\\n const splitEsc = str => tokenize('|', '^', str);\\n\\n\\n // TEST\\n // show :: a -> String\\n const show = x => JSON.stringify(x, null, 2);\\n\\n return splitEsc(\\n 'one^|uno||three^^^^|four^^^|^cuatro|',\\n )\\n .map(show)\\n .join('\\\\n');\\n}))();\\n\",\n \"language\": \"JavaScript\"\n },\n {\n \"code\": \"(() => {\\n 'use strict';\\n\\n // ------ TOKENIZATION OF A STRING WITH ESCAPES ------\\n\\n // tokenizedWithEscapes :: Char -> Char ->\\n // String -> [String]\\n const tokenizedWithEscapes = esc =>\\n // A list of tokens in a given string,\\n // where the separator character is sep\\n // and any character may be escaped by\\n // a preceding esc character.\\n sep => compose(\\n concatMap(fst),\\n parse(\\n sepBy(\\n takeWhileEscP(esc)(\\n constant(true)\\n )(\\n ne(sep)\\n )\\n )(char(sep))\\n )\\n );\\n\\n // ---------------------- TEST -----------------------\\n // main :: IO ()\\n const main = () =>\\n JSON.stringify(\\n tokenizedWithEscapes('^')('|')(\\n 'one^|uno||three^^^^|four^^^|^cuatro|'\\n ),\\n null, 2\\n );\\n // -->\\n // [\\n // \\\"one|uno\\\",\\n // \\\"\\\",\\n // \\\"three^^\\\",\\n // \\\"four^|cuatro\\\",\\n // \\\"\\\"\\n // ]\\n\\n // ----------- GENERIC PARSER COMBINATORS ------------\\n\\n // Parser :: String -> [(a, String)] -> Parser a\\n const Parser = f =>\\n // A function lifted into a Parser object.\\n ({\\n type: 'Parser',\\n parser: f\\n });\\n\\n\\n // altP (<|>) :: Parser a -> Parser a -> Parser a\\n const altP = p =>\\n // p, or q if p doesn't match.\\n q => Parser(s => {\\n const xs = parse(p)(s);\\n return 0 < xs.length ? (\\n xs\\n ) : parse(q)(s);\\n });\\n\\n\\n // anyChar :: () -> Parser Char\\n const anyChar = () =>\\n // A single character.\\n Parser(\\n s => 0 < s.length ? [\\n Tuple(s[0])(\\n s.slice(1)\\n )\\n ] : []\\n );\\n\\n\\n // apP <*> :: Parser (a -> b) -> Parser a -> Parser b\\n const apP = pf =>\\n // A new parser obtained by the application\\n // of a Parser-wrapped function,\\n // to a Parser-wrapped value.\\n p => Parser(\\n s => parse(pf)(s).flatMap(\\n vr => parse(\\n fmapP(vr[0])(p)\\n )(vr[1])\\n )\\n );\\n\\n\\n // bindP (>>=) :: Parser a ->\\n // (a -> Parser b) -> Parser b\\n const bindP = p =>\\n // A new parser obtained by the application of\\n // a function to a Parser-wrapped value.\\n // The function must enrich its output, lifting it\\n // into a new Parser.\\n // Allows for the nesting of parsers.\\n f => Parser(\\n s => parse(p)(s).flatMap(\\n tpl => parse(f(tpl[0]))(tpl[1])\\n )\\n );\\n\\n\\n // char :: Char -> Parser Char\\n const char = x =>\\n // A particular single character.\\n satisfy(c => x == c);\\n\\n\\n // fmapP :: (a -> b) -> Parser a -> Parser b\\n const fmapP = f =>\\n // A new parser derived by the structure-preserving\\n // application of f to the value in p.\\n p => Parser(\\n s => parse(p)(s).flatMap(\\n first(f)\\n )\\n );\\n\\n\\n // liftA2P :: (a -> b -> c) ->\\n // Parser a -> Parser b -> Parser c\\n const liftA2P = op =>\\n // The binary function op, lifted\\n // to a function over two parsers.\\n p => apP(fmapP(op)(p));\\n\\n\\n // many :: Parser a -> Parser [a]\\n const many = p => {\\n // Zero or more instances of p.\\n // Lifts a parser for a simple type of value\\n // to a parser for a list of such values.\\n const some_p = p =>\\n liftA2P(\\n x => xs => [x].concat(xs)\\n )(p)(many(p));\\n return Parser(\\n s => parse(\\n 0 < s.length ? (\\n altP(some_p(p))(pureP(''))\\n ) : pureP('')\\n )(s)\\n );\\n };\\n\\n\\n // parse :: Parser a -> String -> [(a, String)]\\n const parse = p =>\\n // The result of parsing a string with p.\\n p.parser;\\n\\n\\n // pureP :: a -> Parser a\\n const pureP = x =>\\n // The value x lifted, unchanged,\\n // into the Parser monad.\\n Parser(s => [Tuple(x)(s)]);\\n\\n\\n // satisfy :: (Char -> Bool) -> Parser Char\\n const satisfy = test =>\\n // Any character for which the\\n // given predicate returns true.\\n Parser(\\n s => 0 < s.length ? (\\n test(s[0]) ? [\\n Tuple(s[0])(s.slice(1))\\n ] : []\\n ) : []\\n );\\n\\n\\n // sepBy :: Parser a -> Parser b -> Parser [a]\\n const sepBy = p =>\\n // Zero or more occurrences of p, as\\n // separated by (discarded) instances of sep.\\n sep => altP(\\n sepBy1(p)(sep)\\n )(\\n pureP([])\\n );\\n\\n\\n // sepBy1 :: Parser a -> Parser b -> Parser [a]\\n const sepBy1 = p =>\\n // One or more occurrences of p, as\\n // separated by (discarded) instances of sep.\\n sep => bindP(\\n p\\n )(x => bindP(\\n many(\\n thenP(sep)(\\n bindP(p)(pureP)\\n )\\n )\\n )(xs => pureP([x].concat(xs))));\\n\\n\\n // takeWhileEscP :: Char -> (Char -> Bool) ->\\n // (Char -> Bool) -> Parser Text\\n const takeWhileEscP = esc =>\\n escTest => test => {\\n // Longest prefix, including any escaped\\n // characters, in which escTest returns\\n // true for all escaped characters, and\\n // test returns true for all other chars.\\n const plain = takeWhileP(\\n c => (esc !== c) && test(c)\\n );\\n const escaped = thenBindP(\\n char(esc)\\n )(\\n anyChar()\\n )(x => bindP(\\n plain\\n )(\\n compose(pureP, cons(x))\\n ));\\n return bindP(\\n plain\\n )(x => bindP(\\n many(escaped)\\n )(xs => pureP(concat([x].concat(xs)))));\\n };\\n\\n\\n // takeWhileP :: (Char -> Bool) -> Parser String\\n const takeWhileP = p =>\\n // The largest prefix in which p is\\n // true over all the characters.\\n Parser(\\n compose(\\n pureList,\\n first(concat),\\n span(p)\\n )\\n );\\n\\n\\n // thenBindP :: Parser a -> Parser b ->\\n // (b -> Parser c) Parser c\\n const thenBindP = o =>\\n // A combination of thenP and bindP in which a\\n // preliminary parser consumes text and discards\\n // its output, before any output of a subsequent\\n // parser is bound.\\n p => f => Parser(\\n s => parse(o)(s).flatMap(\\n vr => parse(p)(vr[1]).flatMap(\\n tpl => parse(f(tpl[0]))(tpl[1])\\n )\\n )\\n );\\n\\n\\n // thenP (>>) :: Parser a -> Parser b -> Parser b\\n const thenP = o =>\\n // A composite parser in which o just consumes text\\n // and then p consumes more and returns a value.\\n p => Parser(\\n s => parse(o)(s).flatMap(\\n vr => parse(p)(vr[1])\\n )\\n );\\n\\n\\n // --------------------- GENERIC ---------------------\\n\\n // Tuple (,) :: a -> b -> (a, b)\\n const Tuple = a =>\\n b => ({\\n type: 'Tuple',\\n '0': a,\\n '1': b,\\n length: 2\\n });\\n\\n\\n // compose (<<<) :: (b -> c) -> (a -> b) -> a -> c\\n const compose = (...fs) =>\\n // A function defined by the right-to-left\\n // composition of all the functions in fs.\\n fs.reduce(\\n (f, g) => x => f(g(x)),\\n x => x\\n );\\n\\n\\n // concat :: [[a]] -> [a]\\n // concat :: [String] -> String\\n const concat = xs => (\\n ys => 0 < ys.length ? (\\n ys.every(Array.isArray) ? (\\n []\\n ) : ''\\n ).concat(...ys) : ys\\n )(list(xs));\\n\\n\\n // concatMap :: (a -> [b]) -> [a] -> [b]\\n const concatMap = f =>\\n // List monad bind operator.\\n xs => xs.flatMap(f);\\n\\n\\n // cons :: a -> [a] -> [a]\\n const cons = x =>\\n // A list constructed from the item x,\\n // followed by the existing list xs.\\n xs => Array.isArray(xs) ? (\\n [x].concat(xs)\\n ) : 'GeneratorFunction' !== xs\\n .constructor.constructor.name ? (\\n x + xs\\n ) : ( // cons(x)(Generator)\\n function* () {\\n yield x;\\n let nxt = xs.next();\\n while (!nxt.done) {\\n yield nxt.value;\\n nxt = xs.next();\\n }\\n }\\n )();\\n\\n\\n // constant :: a -> b -> a\\n const constant = k =>\\n _ => k;\\n\\n\\n // first :: (a -> b) -> ((a, c) -> (b, c))\\n const first = f =>\\n // A simple function lifted to one which applies\\n // to a tuple, transforming only its first item.\\n xy => Tuple(f(xy[0]))(\\n xy[1]\\n );\\n\\n\\n // fst :: (a, b) -> a\\n const fst = tpl =>\\n // First member of a pair.\\n tpl[0];\\n\\n\\n // list :: StringOrArrayLike b => b -> [a]\\n const list = xs =>\\n // xs itself, if it is an Array,\\n // or an Array derived from xs.\\n Array.isArray(xs) ? (\\n xs\\n ) : Array.from(xs || []);\\n\\n\\n // map :: (a -> b) -> [a] -> [b]\\n const map = f =>\\n // The list obtained by applying f\\n // to each element of xs.\\n // (The image of xs under f).\\n xs => [...xs].map(f);\\n\\n\\n // ne :: a -> a -> Bool\\n const ne = a =>\\n b => a !== b;\\n\\n\\n // pureList :: a -> [a]\\n const pureList = x => [x];\\n\\n\\n // span p xs is equivalent to (takeWhile p xs, dropWhile p xs)\\n // span :: (a -> Bool) -> [a] -> ([a], [a])\\n const span = p =>\\n // Longest prefix of xs consisting of elements which\\n // all satisfy p, tupled with the remainder of xs.\\n xs => {\\n const\\n ys = 'string' !== typeof xs ? (\\n list(xs)\\n ) : xs,\\n iLast = ys.length - 1;\\n return splitAt(\\n until(\\n i => iLast < i || !p(ys[i])\\n )(i => 1 + i)(0)\\n )(ys);\\n };\\n\\n\\n // splitAt :: Int -> [a] -> ([a], [a])\\n const splitAt = n =>\\n xs => Tuple(xs.slice(0, n))(\\n xs.slice(n)\\n );\\n\\n\\n // unlines :: [String] -> String\\n const unlines = xs =>\\n // A single string formed by the intercalation\\n // of a list of strings with the newline character.\\n xs.join('\\\\n');\\n\\n\\n // until :: (a -> Bool) -> (a -> a) -> a -> a\\n const until = p =>\\n 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\": \"# Tokenize the input using the string \\\"escape\\\" as the prefix escape string\\ndef tokenize(separator; escape):\\n\\n # Helper functions:\\n # mapper/1 is like map/1, but for each element, $e, in the input array,\\n # if $e is an array, then it is inserted,\\n # otherwise the elements of ($e|f) are inserted.\\n def mapper(f): reduce .[] as $e\\n ( [];\\n if ($e|type) == \\\"array\\\" then . + [$e] else . + ($e | f) end ) ;\\n\\n # interpolate x\\n def interpolate(x):\\n reduce .[] as $i ([]; . + [$i, x]) | .[0:-1];\\n\\n def splitstring(s; twixt):\\n if type == \\\"string\\\" then split(s) | interpolate(twixt)\\n else .\\n end;\\n\\n # concatenate sequences of non-null elements:\\n def reform:\\n reduce .[] as $x ([];\\n if $x == null and .[-1] == null then .[0:-1] + [\\\"\\\", null]\\n elif $x == null then . + [null]\\n elif .[-1] == null then .[0:-1] + [$x]\\n else .[0:-1] + [ .[-1] + $x ]\\n end)\\n | if .[-1] == null then .[-1] = \\\"\\\" else . end;\\n\\n splitstring(escape + escape; [escape])\\n | mapper( splitstring( escape + separator; [separator]) )\\n | mapper( splitstring( separator; null ) )\\n | map( if type == \\\"string\\\" then split(escape) else . end)\\n | flatten\\n | reform ;\\n\",\n \"language\": \"Jq\"\n },\n {\n \"code\": \"\\\"one^|uno||three^^^^|four^^^|^cuatro|\\\" | tokenize(\\\"|\\\"; \\\"^\\\")\\n\",\n \"language\": \"Jq\"\n },\n {\n \"code\": \"$ jq -n -f tokenize.jq\\n[\\n \\\"one|uno\\\",\\n \\\"\\\",\\n \\\"three^^\\\",\\n \\\"four^|cuatro\\\",\\n \\\"\\\"\\n]\\n\",\n \"language\": \"Jq\"\n },\n {\n \"code\": \"function tokenize2(s::AbstractString, sep::Char, esc::Char)\\n SPE = \\\"\\\\ufffe\\\"\\n SPF = \\\"\\\\uffff\\\"\\n s = replace(s, \\\"$esc$esc\\\", SPE) |>\\n s -> replace(s, \\\"$esc$sep\\\", SPF) |>\\n s -> last(s) == esc ? string(replace(s[1:end-1], esc, \\\"\\\"), esc) : replace(s, esc, \\\"\\\")\\n return map(split(s, sep)) do token\\n token = replace(token, SPE, esc)\\n return replace(token, SPF, sep)\\n end\\nend\\n\\n@show tokenize2(\\\"one^|uno||three^^^^|four^^^|^cuatro|\\\", '|', '^')\\n\",\n \"language\": \"Julia\"\n },\n {\n \"code\": \"// version 1.1.3\\n\\nconst val SPE = \\\"\\\\ufffe\\\" // unused unicode char in Specials block\\nconst val SPF = \\\"\\\\uffff\\\" // ditto\\n\\nfun tokenize(str: String, sep: Char, esc: Char): List<String> {\\n var s = str.replace(\\\"$esc$esc\\\", SPE).replace(\\\"$esc$sep\\\", SPF)\\n s = if (s.last() == esc) // i.e. 'esc' not escaping anything\\n s.dropLast(1).replace(\\\"$esc\\\", \\\"\\\") + esc\\n else\\n s.replace(\\\"$esc\\\", \\\"\\\")\\n return s.split(sep).map { it.replace(SPE, \\\"$esc\\\").replace(SPF, \\\"$sep\\\") }\\n}\\n\\nfun main(args: Array<String>) {\\n var str = \\\"one^|uno||three^^^^|four^^^|^cuatro|\\\"\\n val sep = '|'\\n val esc = '^'\\n val items = tokenize(str, sep, esc)\\n for (item in items) println(if (item.isEmpty()) \\\"(empty)\\\" else item)\\n}\\n\",\n \"language\": \"Kotlin\"\n },\n {\n \"code\": \"-- in some movie script\\n\\non tokenize (str, sep, esc)\\n l = []\\n _player.itemDelimiter = sep\\n cnt = str.item.count\\n repeat with i = 1 to cnt\\n prev = l.getLast() -- can be VOID\\n if _trailEscCount(prev, esc) mod 2 then\\n l[l.count] = prev.char[1..prev.length-1]&sep&str.item[i]\\n else\\n l.add(str.item[i])\\n end if\\n end repeat\\n -- remove escape characters from tokens\\n cnt = l.count\\n repeat with i = 1 to cnt\\n l[i] = _removeEsc(l[i], esc)\\n end repeat\\n return l\\nend\\n\\n-- counts number of trailing escape characters\\non _trailEscCount (str, esc)\\n n = 0\\n repeat with i = str.length down to 1\\n if str.char[i]=esc then n=n+1\\n else exit repeat\\n end repeat\\n return n\\nend\\n\\n-- could be implemented more efficiently by using offset()\\non _removeEsc (str, esc)\\n cnt = str.length-1\\n repeat with i = 1 to cnt\\n if str.char[i]=esc then\\n delete char i of str\\n cnt = cnt-1\\n end if\\n end repeat\\n return str\\nend\\n\",\n \"language\": \"Lingo\"\n },\n {\n \"code\": \"str = \\\"one^|uno||three^^^^|four^^^|^cuatro|\\\"\\nsep = \\\"|\\\"\\nesc = \\\"^\\\"\\nput tokenize(str, sep, esc)\\n-- [\\\"one|uno\\\", \\\"\\\", \\\"three^^\\\", \\\"four^|cuatro\\\", \\\"\\\"]\\n\",\n \"language\": \"Lingo\"\n },\n {\n \"code\": \"function tokenise (str, sep, esc)\\n local strList, word, escaped, ch = {}, \\\"\\\", false\\n for pos = 1, #str do\\n ch = str:sub(pos, pos)\\n if ch == esc then\\n if escaped then\\n word = word .. ch\\n escaped = false\\n else\\n escaped = true\\n end\\n elseif ch == sep then\\n if escaped then\\n word = word .. ch\\n escaped = false\\n else\\n table.insert(strList, word)\\n word = \\\"\\\"\\n end\\n else\\n escaped = false\\n word = word .. ch\\n end\\n end\\n table.insert(strList, word)\\n return strList\\nend\\n\\nlocal testStr = \\\"one^|uno||three^^^^|four^^^|^cuatro|\\\"\\nlocal testSep, testEsc = \\\"|\\\", \\\"^\\\"\\nfor k, v in pairs(tokenise(testStr, testSep, testEsc)) do\\n print(k, v)\\nend\\n\",\n \"language\": \"Lua\"\n },\n {\n \"code\": \"ClearAll[Tokenize]\\nTokenize[str_String, escape_String : \\\"^\\\", sep_String : \\\"|\\\"] :=\\n Module[{results = {}, token = \\\"\\\", state = 0, a},\\n a = Characters[str];\\n Do[\\n If[state == 0,\\n Switch[c,\\n escape,\\n state = 1\\n ,\\n sep,\\n AppendTo[results, token];\\n token = \\\"\\\";\\n ,\\n _,\\n token = token <> c;\\n ]\\n ,\\n If[state == 1,\\n token = token <> c;\\n state = 0;\\n ]\\n ]\\n\\n ,\\n {c, a}\\n ];\\n AppendTo[results, token];\\n results\\n ]\\nTokenize[\\\"one^|uno||three^^^^|four^^^|^cuatro|\\\"]\\n\",\n \"language\": \"Mathematica\"\n },\n {\n \"code\": \"import streams\\n\\nproc tokenize(s: Stream, sep: static[char] = '|', esc: static[char] = '^'): seq[string] =\\n var buff = \\\"\\\"\\n while not s.atEnd():\\n let c = s.readChar\\n case c\\n of sep:\\n result.add buff\\n buff = \\\"\\\"\\n of esc:\\n buff.add s.readChar\\n else:\\n buff.add c\\n result.add buff\\n\\nfor i, s in tokenize(newStringStream \\\"one^|uno||three^^^^|four^^^|^cuatro|\\\"):\\n echo i, \\\":\\\", s\\n\",\n \"language\": \"Nim\"\n },\n {\n \"code\": \"let split_with_escaping ~esc ~sep s =\\n let len = String.length s in\\n let buf = Buffer.create 16 in\\n let rec loop i =\\n if i = len then [Buffer.contents buf]\\n else if s.[i] = esc && i + 1 < len then begin\\n Buffer.add_char buf s.[i + 1];\\n loop (i + 2)\\n end else if s.[i] = sep then begin\\n let s = Buffer.contents buf in\\n Buffer.clear buf;\\n s :: loop (i + 1)\\n end else begin\\n Buffer.add_char buf s.[i];\\n loop (i + 1)\\n end\\n in\\n loop 0\\n\",\n \"language\": \"OCaml\"\n },\n {\n \"code\": \"let res = split_with_escaping ~esc:'^' ~sep:'|' \\\"one^|uno||three^^^^|four^^^|^cuatro|\\\";;\\nval res : string list = [\\\"one|uno\\\"; \\\"\\\"; \\\"three^^\\\"; \\\"four^|cuatro\\\"; \\\"\\\"]\\n\",\n \"language\": \"OCaml\"\n },\n {\n \"code\": \"sub tokenize {\\n my ($string, $sep, $esc) = (shift, quotemeta shift, quotemeta shift);\\n\\n my @fields = split /$esc . (*SKIP)(*FAIL) | $sep/sx, $string, -1;\\n return map { s/$esc(.)/$1/gsr } @fields;\\n}\\n\",\n \"language\": \"Perl\"\n },\n {\n \"code\": \" my @fields = $string =~ /\\\\G (?:^ | $sep) \\\\K (?: [^$sep$esc] | $esc .)*/gsx;\\n\",\n \"language\": \"Perl\"\n },\n {\n \"code\": \"print \\\"'$_'\\\\n\\\" for tokenize(\\\"one^|uno||three^^^^|four^^^|^cuatro|\\\", '|', '^');\\n\",\n \"language\": \"Perl\"\n },\n {\n \"code\": \"(phixonline)-->\\n <span style=\\\"color: #008080;\\\">function</span> <span style=\\\"color: #000000;\\\">tokenize</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;\\\">integer</span> <span style=\\\"color: #000000;\\\">sep</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #004080;\\\">integer</span> <span style=\\\"color: #000000;\\\">esc</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #004080;\\\">sequence</span> <span style=\\\"color: #000000;\\\">ret</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #0000FF;\\\">{}</span>\\n <span style=\\\"color: #004080;\\\">string</span> <span style=\\\"color: #000000;\\\">word</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #008000;\\\">\\\"\\\"</span>\\n <span style=\\\"color: #004080;\\\">integer</span> <span style=\\\"color: #000000;\\\">skip</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">0</span>\\n\\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;\\\">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;\\\">integer</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: #008080;\\\">if</span> <span style=\\\"color: #000000;\\\">skip</span> <span style=\\\"color: #008080;\\\">then</span>\\n <span style=\\\"color: #000000;\\\">word</span> <span style=\\\"color: #0000FF;\\\">&=</span> <span style=\\\"color: #000000;\\\">si</span>\\n <span style=\\\"color: #000000;\\\">skip</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">0</span>\\n <span style=\\\"color: #008080;\\\">elsif</span> <span style=\\\"color: #000000;\\\">si</span><span style=\\\"color: #0000FF;\\\">=</span><span style=\\\"color: #000000;\\\">esc</span> <span style=\\\"color: #008080;\\\">then</span>\\n <span style=\\\"color: #000000;\\\">skip</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">1</span>\\n <span style=\\\"color: #008080;\\\">elsif</span> <span style=\\\"color: #000000;\\\">si</span><span style=\\\"color: #0000FF;\\\">=</span><span style=\\\"color: #000000;\\\">sep</span> <span style=\\\"color: #008080;\\\">then</span>\\n <span style=\\\"color: #000000;\\\">ret</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">append</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">ret</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">word</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #000000;\\\">word</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #008000;\\\">\\\"\\\"</span>\\n <span style=\\\"color: #008080;\\\">else</span>\\n <span style=\\\"color: #000000;\\\">word</span> <span style=\\\"color: #0000FF;\\\">&=</span> <span style=\\\"color: #000000;\\\">si</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;\\\">ret</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">append</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">ret</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">word</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;\\\">ret</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;\\\">tokenize</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #008000;\\\">\\\"one^|uno||three^^^^|four^^^|^cuatro|\\\"</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<!--\\n\",\n \"language\": \"Phix\"\n },\n {\n \"code\": \"(de tokenize (Str Sep Esc)\\n (split\\n (make\\n (for (L (chop Str) L)\\n (let C (pop 'L)\\n (cond\\n ((= C Esc) (link (pop 'L)))\\n ((= C Sep) (link 0))\\n (T (link C)) ) ) ) )\\n 0 ) )\\n\",\n \"language\": \"PicoLisp\"\n },\n {\n \"code\": \"(for (I . S) (tokenize \\\"one\\\\^|uno||three\\\\^\\\\^\\\\^\\\\^|four\\\\^\\\\^\\\\^|\\\\^cuatro|\\\" \\\"|\\\" \\\"\\\\^\\\")\\n (prinl I \\\": \\\" S) )\\n\",\n \"language\": \"PicoLisp\"\n },\n {\n \"code\": \"function Split-String ([string]$String, [char]$Separator, [char]$Escape)\\n{\\n if ($String -notmatch \\\"\\\\$Separator|\\\\$Escape\\\") {return $String}\\n\\n [bool]$escaping = $false\\n [string]$output = \\\"\\\"\\n\\n for ($i = 0; $i -lt $String.Length; $i++)\\n {\\n [char]$character = $String.Substring($i,1)\\n\\n if ($escaping)\\n {\\n $output += $character\\n $escaping = $false\\n }\\n else\\n {\\n switch ($character)\\n {\\n {$_ -eq $Separator} {$output; $output = \\\"\\\"; break}\\n {$_ -eq $Escape} {$escaping = $true ; break}\\n Default {$output += $character}\\n }\\n }\\n }\\n\\n if ($String[-1] -eq $Separator) {[String]::Empty}\\n}\\n\",\n \"language\": \"PowerShell\"\n },\n {\n \"code\": \"Split-String \\\"one^|uno||three^^^^|four^^^|^cuatro|\\\" -Separator \\\"|\\\" -Escape \\\"^\\\" | ForEach-Object `\\n -Begin {$n = 0} `\\n -Process {$n+= 1; \\\"{0}: {1}\\\" -f $n, $_}\\n\",\n \"language\": \"PowerShell\"\n },\n {\n \"code\": \"def token_with_escape(a, escape = '^', separator = '|'):\\n '''\\n Issue python -m doctest thisfile.py to run the doctests.\\n\\n >>> print(token_with_escape('one^|uno||three^^^^|four^^^|^cuatro|'))\\n ['one|uno', '', 'three^^', 'four^|cuatro', '']\\n '''\\n result = []\\n token = ''\\n state = 0\\n for c in a:\\n if state == 0:\\n if c == escape:\\n state = 1\\n elif c == separator:\\n result.append(token)\\n token = ''\\n else:\\n token += c\\n elif state == 1:\\n token += c\\n state = 0\\n result.append(token)\\n return result\\n\",\n \"language\": \"Python\"\n },\n {\n \"code\": \"'''Tokenize a string with escaping'''\\n\\nfrom functools import reduce\\n\\n\\n# tokenize :: Char -> Char -> String -> [String]\\ndef tokenize(delim):\\n '''A list of the tokens in a string, given\\n a delimiting char and an escape char.\\n '''\\n def go(esc, s):\\n def chop(a, x):\\n tkn, xs, escaped = a\\n literal = not escaped\\n isEsc = literal and (esc == x)\\n return ([], [tkn] + xs, isEsc) if (\\n literal and (delim == x)\\n ) else (tkn if isEsc else [x] + tkn, xs, isEsc)\\n\\n tkn, xs, _ = reduce(chop, list(s), ([], [], False))\\n\\n return list(reversed(\\n [''.join(reversed(x)) for x in [tkn] + xs]\\n ))\\n return lambda esc: lambda s: go(esc, s)\\n\\n\\n# --------------------------TEST---------------------------\\n# main :: IO ()\\ndef main():\\n '''Test'''\\n\\n print(\\n tokenize('|')('^')(\\n \\\"one^|uno||three^^^^|four^^^|^cuatro|\\\"\\n )\\n )\\n\\n\\n# MAIN ---\\nif __name__ == '__main__':\\n main()\\n\",\n \"language\": \"Python\"\n },\n {\n \"code\": \"import re\\n\\nSTRING = 'one^|uno||three^^^^|four^^^|^cuatro|'\\n\\ndef tokenize(string=STRING, escape='^', separator='|'):\\n\\n escape, separator = map(re.escape, (escape, separator))\\n\\n tokens = ['']\\n\\n def start_new_token(scanner, substring):\\n tokens.append('')\\n\\n def add_escaped_char(scanner, substring):\\n char = substring[1]\\n tokens[-1] += char\\n\\n def add_substring(scanner, substring):\\n tokens[-1] += substring\\n\\n re.Scanner([\\n # an escape followed by a character produces that character\\n (fr'{escape}.', add_escaped_char),\\n\\n # when encountering a separator not preceded by an escape,\\n # start a new token\\n (fr'{separator}', start_new_token),\\n\\n # a sequence of regular characters (i.e. not escape or separator)\\n # is just appended to the token\\n (fr'[^{escape}{separator}]+', add_substring),\\n ]).scan(string)\\n\\n return tokens\\n\\n\\nif __name__ == '__main__':\\n print(list(tokenize()))\\n\",\n \"language\": \"Python\"\n },\n {\n \"code\": \"import re\\n\\nSTRING = 'one^|uno||three^^^^|four^^^|^cuatro|'\\n\\ndef tokenize(string=STRING, escape='^', separator='|'):\\n\\n re_escape, re_separator = map(re.escape, (escape, separator))\\n\\n # token regex\\n regex = re.compile(fr'''\\n # lookbehind: a token must be preceded by a separator\\n # (note that `(?<=^|{re_separator})` doesn't work in Python)\\n (?<={re_separator})\\n\\n # a token consists either of an escape sequence,\\n # or a regular (non-escape, non-separator) character,\\n # repeated arbitrarily many times (even zero)\\n (?:{re_escape}.|[^{re_escape}{re_separator}])*\\n ''',\\n flags=re.VERBOSE\\n )\\n\\n # since each token must start with a separator,\\n # we must add an extra separator at the beginning of input\\n preprocessed_string = separator + string\\n\\n for almost_token in regex.findall(preprocessed_string):\\n # now get rid of escape characters: '^^' -> '^' etc.\\n token = re.sub(fr'{re_escape}(.)', r'\\\\1', almost_token)\\n yield token\\n\\nif __name__ == '__main__':\\n print(list(tokenize()))\\n\",\n \"language\": \"Python\"\n },\n {\n \"code\": \"#lang racket/base\\n(require racket/match)\\n\\n;; Returns a tokenising function based on sep and esc\\n(define ((tokenise-with-escape sep esc) str)\\n (define tsil->string (compose list->string reverse))\\n (define (inr rem l-acc acc)\\n (match rem\\n ['() (if (and (null? acc) (null? l-acc)) null (reverse (cons (tsil->string l-acc) acc)))]\\n [(list (== sep) tl ...) (inr tl null (cons (tsil->string l-acc) acc))]\\n [(list (== esc) c tl ...) (inr tl (cons c l-acc) acc)]\\n [(list c tl ...) (inr tl (cons c l-acc) acc)]))\\n (inr (string->list str) null null))\\n\\n;; This is the tokeniser that matches the parameters in the task\\n(define task-tokeniser (tokenise-with-escape #\\\\| #\\\\^))\\n\\n(define (report-input-output str)\\n (printf \\\"Input: ~s~%Output: ~s~%~%\\\" str (task-tokeniser str)))\\n\\n(report-input-output \\\"one^|uno||three^^^^|four^^^|^cuatro|\\\")\\n(report-input-output \\\"\\\")\\n(report-input-output \\\"|\\\")\\n(report-input-output \\\"^\\\")\\n(report-input-output \\\".\\\")\\n\",\n \"language\": \"Racket\"\n },\n {\n \"code\": \"sub tokenize ($string, :$sep!, :$esc!) {\\n return $string.match(/([ <!before $sep | $esc> . | $esc . ]*)+ % $sep/)\\\\\\n .[0].map(*.subst: /$esc )> ./, '', :g);\\n}\\n\\nsay \\\"'$_'\\\" for tokenize 'one^|uno||three^^^^|four^^^|^cuatro|', sep => '|', esc => '^';\\n\",\n \"language\": \"Raku\"\n },\n {\n \"code\": \"/*REXX program demonstrates tokenizing and displaying a string with escaping sequences. */\\n str = 'one^|uno||three^^^^|four^^^|^cuatro|' /*the character string to be tokenized.*/\\n esc = '^' /* \\\" escape character to be used. */\\n sep = '|' /* \\\" separator \\\" \\\" \\\" \\\" */\\n out = /* \\\" output string (so far). */\\neMode = 0 /*a flag, escape is in progress. */\\n\\n do j=1 for length(str); _=substr(str, j, 1) /*parse a single character at a time. */\\n if eMode then do; out=out || _; eMode=0; iterate; end /*are we in escape mode? */\\n if _==esc then do; eMode=1; iterate; end /*is it an escape char ? */\\n if _==sep then do; call show; iterate; end /* \\\" \\\" a separator char?*/\\n out=out || _ /*append the character. */\\n end /*j*/\\n\\nif out\\\\=='' | _==sep then call show /*handle a residual str or a separator.*/\\nexit /*stick a fork in it, we're all done. */\\n/*──────────────────────────────────────────────────────────────────────────────────────*/\\nshow: say '[length'right(length(out),4)\\\"]\\\" out; out=; return\\n\",\n \"language\": \"REXX\"\n },\n {\n \"code\": \"/*REXX program demonstrates tokenizing and displaying a string with escaping sequences. */\\n str = 'one^|uno||three^^^^|four^^^|^cuatro|' /*the character string to be tokenized.*/\\n esc = '^' /* \\\" escape character to be used. */\\n sep = '|' /* \\\" separator \\\" \\\" \\\" \\\" */\\n $ = /* \\\" output string (so far). */\\neMode = 0 /*a flag, escape is in progress. */\\nsay ' output len output' /*title verbiage used for the output.*/\\nsay '──────────── ────────────────────' /* \\\" separator \\\" \\\" \\\" \\\" */\\n\\n do j=1 for length(str); _=substr(str, j, 1) /*parse a single character at a time. */\\n select\\n when eMode then do; $=$ || _; eMode=0; end /*are we in in escape mode? */\\n when _==esc then eMode=1 /*is it an escape character? */\\n when _==sep then do; call show; end /* \\\" \\\" a separator character? */\\n otherwise $=$ || _ /*append the single character. */\\n end /*select*/\\n end /*j*/\\n\\nif $\\\\=='' | _==sep then call show /*handle a residual str or a separator.*/\\nsay '──────────── ────────────────────' /*the foot separator for the output. */\\nsay ' ····^····1····^····2' /*show the top part of the scale.*/\\nsay ' {scale} 12345678901234567890' /* \\\" \\\" bottom \\\" \\\" \\\" \\\" */\\nexit /*stick a fork in it, we're all done. */\\n/*──────────────────────────────────────────────────────────────────────────────────────*/\\nshow: say '[length'right(length($),4)\\\"]\\\" $; $=; return\\n\",\n \"language\": \"REXX\"\n },\n {\n \"code\": \"tokenize(\\\"one^|uno||three^^^^|four^^^|^cuatro|\\\", \\\"|\\\", \\\"^\\\")\\n\\nfunc tokenize(src, sep, esc)\\nfield = 1\\nescaping = false\\nsee \\\"\\\" + field + \\\" \\\"\\nfor i = 1 to len(src)\\n char = substr(src, i, 1)\\n if escaping\\n see char\\n escaping = false\\n else\\n switch char\\n on sep\\n see nl\\n field = field + 1\\n see \\\"\\\" + field + \\\" \\\"\\n on esc\\n escaping = true\\n other\\n see char\\n off\\n ok\\nnext\\nsee nl\\n\",\n \"language\": \"Ring\"\n },\n {\n \"code\": \"def tokenize(string, sep, esc)\\n sep = Regexp.escape(sep)\\n esc = Regexp.escape(esc)\\n string.scan(/\\\\G (?:^ | #{sep}) (?: [^#{sep}#{esc}] | #{esc} .)*/x).collect do |m|\\n m.gsub(/#{esc}(.)/, '\\\\1').gsub(/^#{sep}/, '')\\n end\\nend\\n\\np tokenize('one^|uno||three^^^^|four^^^|^cuatro|', '|', '^')\\n\",\n \"language\": \"Ruby\"\n },\n {\n \"code\": \"const SEPARATOR: char = '|';\\nconst ESCAPE: char = '^';\\nconst STRING: &str = \\\"one^|uno||three^^^^|four^^^|^cuatro|\\\";\\n\\nfn tokenize(string: &str) -> Vec<String> {\\n let mut token = String::new();\\n let mut tokens: Vec<String> = Vec::new();\\n let mut chars = string.chars();\\n while let Some(ch) = chars.next() {\\n match ch {\\n SEPARATOR => {\\n tokens.push(token);\\n token = String::new();\\n },\\n ESCAPE => {\\n if let Some(next) = chars.next() {\\n token.push(next);\\n }\\n },\\n _ => token.push(ch),\\n }\\n }\\n tokens.push(token);\\n tokens\\n}\\n\\nfn main() {\\n println!(\\\"{:#?}\\\", tokenize(STRING));\\n}\\n\",\n \"language\": \"Rust\"\n },\n {\n \"code\": \"object TokenizeStringWithEscaping0 extends App {\\n\\n val (markerSpE,markerSpF) = (\\\"\\\\ufffe\\\" , \\\"\\\\uffff\\\")\\n\\n def tokenize(str: String, sep: String, esc: String): Array[String] = {\\n\\n val s0 = str.replace( esc + esc, markerSpE).replace(esc + sep, markerSpF)\\n val s = if (s0.last.toString == esc) s0.replace(esc, \\\"\\\") + esc else s0.replace(esc, \\\"\\\")\\n s.split(sep.head).map (_.replace(markerSpE, esc).replace(markerSpF, sep))\\n }\\n\\n def str = \\\"one^|uno||three^^^^|four^^^|^cuatro|\\\"\\n\\n tokenize(str, \\\"|\\\", \\\"^\\\").foreach(it => println(if (it.isEmpty) \\\"<empty token>\\\" else it))\\n}\\n\",\n \"language\": \"Scala\"\n },\n {\n \"code\": \"import scala.annotation.tailrec\\n\\nobject TokenizeStringWithEscaping1 extends App {\\n\\n def tokenize(str: String, sep: String, esc: String): Seq[String] = {\\n @tailrec\\n def loop(accu: Seq[String], s: String): Seq[String] = {\\n def append2StringInList(char: String): Seq[String] =\\n accu.init :+ (accu.last + char)\\n\\n s.length match {\\n case 0 => accu\\n case 1 => if (s.head.toString == sep) accu :+ \\\"\\\" else append2StringInList(s)\\n case _ => (s.head.toString, s.tail.head.toString) match {\\n case c@((`esc`, `sep`) | (`esc`, `esc`)) => loop(append2StringInList(c._2), s.tail.tail)\\n case (`sep`, _) => loop(accu :+ \\\"\\\", s.tail)\\n case (`esc`, _) => loop(accu, s.tail)\\n case (sub, _) => loop(append2StringInList(sub.head.toString), s.tail)\\n }\\n }\\n }\\n\\n loop(Seq(\\\"\\\"), str)\\n }\\n\\n def str = \\\"one^|uno||three^^^^|four^^^|^cuatro|\\\"\\n\\n tokenize(str, \\\"|\\\", \\\"^\\\")\\n .foreach(it =>\\n println(\\n f\\\"[length:${it.length}%3d] ${if (it.isEmpty) \\\"<empty token>\\\" else it}\\\"))\\n}\\n\",\n \"language\": \"Scala\"\n },\n {\n \"code\": \"func tokenize(string, sep, esc) {\\n var fields = string.split(\\n Regex(esc.escape + '.(*SKIP)(*FAIL)|' + sep.escape, 's'), -1\\n )\\n fields.map{.gsub(Regex(esc.escape + '(.)'), {|s1| s1 }) }\\n}\\n\\ntokenize(\\\"one^|uno||three^^^^|four^^^|^cuatro|\\\", '|', '^').each { |str|\\n say str.dump\\n}\\n\",\n \"language\": \"Sidef\"\n },\n {\n \"code\": \"SIMSET\\nBEGIN\\n\\n LINK CLASS ITEM(TXT); TEXT TXT;;\\n\\n REF(HEAD) PROCEDURE SPLIT(TXT, SEP, ESC); TEXT TXT; CHARACTER SEP, ESC;\\n BEGIN\\n REF(HEAD) PARTS;\\n CHARACTER CH;\\n TEXT PART;\\n\\n PART :- BLANKS(TXT.LENGTH);\\n PARTS :- NEW HEAD;\\n TXT.SETPOS(1);\\n WHILE TXT.MORE DO BEGIN\\n CH := TXT.GETCHAR;\\n IF CH = ESC THEN BEGIN\\n IF TXT.MORE THEN BEGIN\\n CH := TXT.GETCHAR;\\n PART.PUTCHAR(CH);\\n END ELSE BEGIN\\n ERROR(\\\"SPLIT: ESCAPE CHAR AT END OF STRING\\\");\\n END;\\n END ELSE IF CH = SEP THEN BEGIN\\n NEW ITEM(COPY(PART.SUB(1,PART.POS-1))).INTO(PARTS);\\n PART.SETPOS(1);\\n END ELSE BEGIN\\n PART.PUTCHAR(CH);\\n END;\\n END;\\n NEW ITEM(COPY(PART.SUB(1,PART.POS-1))).INTO(PARTS);\\n\\n SPLIT :- PARTS;\\n END SPLIT;\\n\\n TEXT EXAMPLE;\\n REF(HEAD) RESULT;\\n REF(ITEM) PART;\\n INTEGER NO;\\n\\n FOR EXAMPLE :- \\\"ONE^|UNO||THREE^^^^|FOUR^^^|^CUATRO|\\\" DO\\n BEGIN\\n OUTTEXT(\\\"INPUT: '\\\");\\n OUTTEXT(EXAMPLE);\\n OUTTEXT(\\\"'\\\");\\n OUTIMAGE;\\n RESULT :- SPLIT(EXAMPLE, '|', '^');\\n PART :- RESULT.FIRST;\\n NO := 0;\\n WHILE PART =/= NONE DO\\n BEGIN\\n NO := NO + 1;\\n OUTTEXT(\\\"PART\\\");\\n OUTINT(NO, 0);\\n OUTTEXT(\\\": '\\\");\\n OUTTEXT(PART.TXT);\\n OUTTEXT(\\\"'\\\");\\n OUTIMAGE;\\n PART :- PART.SUC;\\n END;\\n END;\\n\\nEND.\\n\",\n \"language\": \"Simula\"\n },\n {\n \"code\": \"* Program: tokenize_with_escape.sbl\\n* To run: sbl tokenize_with_escape.sbl\\n* Description: Tokenize a string with escaping\\n* Comment: Tested using the Spitbol for Linux version of SNOBOL4\\n\\n\\tlf = substr(&alphabet,11,1) ;* New line or line feed\\n\\n\\n* Function tokenize will break parts out of a string, which are\\n* separated by c, which defaults to a comma, into\\n* an array. Parameter kp=1 to keep null parts, which is the default,\\n* and 0 to discard.\\n\\tdefine('tokenize(s,c,kp)tokenizepat,part,t,i,j')\\n\\t:(tokenize_end)\\ntokenize\\n\\tc = (ident(c) ',', substr(c,1,1)) :f(freturn)\\n\\tkp = (ident(kp) 1, eq(kp,0) 0, 1) :f(freturn)\\n\\tt = table()\\n\\ttokenizepat = breakx(c) . part c | (len(1) rem) . part\\n\\ts ? eq(kp,1) rtab(1) c = s c\\ntokenize1\\n\\ts ? tokenizepat = \\\"\\\" :f(tokenize2)\\n\\tt[i = eq(kp,0) differ(part) i + 1] = part\\n\\tt[i = eq(kp,1) i + 1] = part\\n\\t:(tokenize1)\\ntokenize2\\n\\ttokenize = array(i) :f(errr)\\n\\tj = 0\\ntokenize3\\ttokenize[j = lt(j,i) j + 1] = t[j] :s(tokenize3)\\n\\t:(return)\\ntokenize_end\\n\\n\\n* Function tokcan will a normalize a string by applying separator and escape\\n* rules to string ts. Parameter sep is the separator, while esc is the escape\\n* character. Parameter tesc is the new separator character to substitute for\\n* parameter sep. It defaults to a comma, \\\",\\\".\\n\\tdefine('tokcan(ts,sep,esc,tesc)tpat,part1,part2,notany') :(tokcan_end)\\ntokcan\\n\\ttesc = (ident(tesc) ',', substr(tesc,1,1))\\n\\ttpat = (breakx(sep esc) . part1\\n+\\t\\t(sep | esc sep | esc esc | (esc len(1) . notany)) . part2\\n+\\t\\t)\\n+\\t\\t| (len(1) rem) . part1\\n\\ntokcan1\\n\\tts ? tpat = :f(tokcan2)\\n\\tpart2 = (leq(part2,sep) tesc\\n+\\t\\t,leq(part2,esc sep) sep\\n+\\t\\t,leq(part2,esc esc) esc\\n+\\t\\t,differ(notany) leq(part2,esc notany) notany\\n+\\t\\t)\\n\\ttokcan = (ident(tokcan) \\\"\\\", tokcan) part1 part2\\n\\t:(tokcan1)\\ntokcan2\\n\\t:(return)\\ntokcan_end\\n\\n\\n\\ttest_string = \\\"one^|uno||three^^^^|four^^^|^cuatro|\\\"\\n\\tsep = \\\"|\\\"\\n\\tesc = \\\"^\\\"\\n\\n\\thline = tokcan(test_string,sep,esc) :f(err)\\n\\n\\n\\toutput = \\\" Input: \\\" test_string lf\\n\\toutput = \\\"Output1: \\\" hline lf\\n\\n\\toutput = \\\"Output2: \\\"\\n\\ttokenized = tokenize(hline,\\\",\\\")\\n\\np1\\toutput = \\\"'\\\" tokenized[z = z + 1] \\\"'\\\" :s(p1)\\n\\nEND\\n\",\n \"language\": \"SNOBOL4\"\n },\n {\n \"code\": \"extension String {\\n func tokenize(separator: Character, escape: Character) -> [String] {\\n var token = \\\"\\\"\\n var tokens = [String]()\\n var chars = makeIterator()\\n\\n while let char = chars.next() {\\n switch char {\\n case separator:\\n tokens.append(token)\\n token = \\\"\\\"\\n case escape:\\n if let next = chars.next() {\\n token.append(next)\\n }\\n case _:\\n token.append(char)\\n }\\n }\\n\\n tokens.append(token)\\n\\n return tokens\\n }\\n}\\n\\nprint(\\\"one^|uno||three^^^^|four^^^|^cuatro|\\\".tokenize(separator: \\\"|\\\", escape: \\\"^\\\"))\\n\",\n \"language\": \"Swift\"\n },\n {\n \"code\": \"oo::class create tokens {\\n constructor {s} {\\n puts [coroutine Next my Iter $s]\\n oo::objdefine [self] forward next Next\\n }\\n method Iter {s} {\\n yield [info coroutine]\\n for {set i 0} {$i < [string length $s]} {incr i} {\\n yield [string index $s $i]\\n }\\n return -code break\\n }\\n}\\n\\nproc tokenize {s {sep |} {escape ^}} {\\n set part \\\"\\\"\\n set parts \\\"\\\"\\n set iter [tokens new $s]\\n while {1} {\\n set c [$iter next]\\n if {$c eq $escape} {\\n append part [$iter next]\\n } elseif {$c eq $sep} {\\n lappend parts $part\\n set part \\\"\\\"\\n } else {\\n append part $c\\n }\\n }\\n lappend parts $part\\n return $parts\\n}\\n\\nputs [tokenize one^|uno||three^^^^|four^^^|^cuatro| | ^]\\n\",\n \"language\": \"Tcl\"\n },\n {\n \"code\": \"prog: char(sep) *\\n char(esc) *\\nstr: smark\\ntoken: forw/outp\\n ( [ch==esc?] char(ch) any(!<<>>) token\\n | [ch==sep?] char(ch) outp str\\n | any(!<<>>) token );\\noutp: parse(( scopy = { <\\\"> 1 <\\\"> * } ));\\nforw: peek/chkeof;\\npeek: [ch=0] char(ch) fail;\\nchkeof: ( [ch?] succ | fail );\\n\\nch: 0;\\nsep: 0;\\nesc: 0;\\n\",\n \"language\": \"TMG\"\n },\n {\n \"code\": \"fn tokenize_string(s string, sep u8, escape u8) ?[]string {\\n mut tokens := []string{}\\n\\tmut runes := []u8{}\\n\\tmut in_escape := false\\n\\tfor r in s {\\n\\t\\tif in_escape {\\n\\t\\t\\tin_escape = false\\n\\t\\t runes << r\\n } else if r == escape {\\n\\t\\t\\tin_escape = true\\n } else if r == sep {\\n\\t\\t\\ttokens << runes.bytestr()\\n\\t\\t\\trunes = runes[..0]\\n\\t\\t} else {\\n runes << r\\n }\\n\\t}\\n\\ttokens << runes.bytestr()\\n\\tif in_escape {\\n\\t\\treturn error(\\\"invalid terminal escape\\\")\\n\\t}\\n\\treturn tokens\\n}\\n\\nconst sample = \\\"one^|uno||three^^^^|four^^^|^cuatro|\\\"\\nconst separator = `|`\\nconst escape = `^`\\nfn main() {\\n\\tprintln(\\\"Input: $sample\\\")\\n\\ttokens := tokenize_string(sample, separator, escape)?\\n\\tprintln(\\\"Tokens: $tokens\\\")\\n}\\n\",\n \"language\": \"V-(Vlang)\"\n },\n {\n \"code\": \"Private Function tokenize(s As String, sep As String, esc As String) As Collection\\n Dim ret As New Collection\\n Dim this As String\\n Dim skip As Boolean\\n\\n If Len(s) <> 0 Then\\n For i = 1 To Len(s)\\n si = Mid(s, i, 1)\\n If skip Then\\n this = this & si\\n skip = False\\n Else\\n If si = esc Then\\n skip = True\\n Else\\n If si = sep Then\\n ret.Add this\\n this = \\\"\\\"\\n Else\\n this = this & si\\n End If\\n End If\\n End If\\n Next i\\n ret.Add this\\n End If\\n Set tokenize = ret\\nEnd Function\\n\\nPublic Sub main()\\n Dim out As Collection\\n Set out = tokenize(\\\"one^|uno||three^^^^|four^^^|^cuatro|\\\", \\\"|\\\", \\\"^\\\")\\n Dim outstring() As String\\n ReDim outstring(out.Count - 1)\\n For i = 0 To out.Count - 1\\n outstring(i) = out(i + 1)\\n Next i\\n Debug.Print Join(outstring, \\\", \\\")\\nEnd Sub\\n\",\n \"language\": \"VBA\"\n },\n {\n \"code\": \"var SPE = \\\"\\\\ufffe\\\" // unused unicode character in Specials block\\nvar SPF = \\\"\\\\uffff\\\" // ditto\\n\\nvar tokenize = Fn.new { |str, sep, esc|\\n str = str.replace(esc + esc, SPE).replace(esc + sep, SPF)\\n str = (str[-1] == esc) ? str[0...-1].replace(esc, \\\"\\\") + esc : str.replace(esc, \\\"\\\")\\n return str.split(sep).map { |s| s.replace(SPE, esc).replace(SPF, sep) }.toList\\n}\\n\\nvar str = \\\"one^|uno||three^^^^|four^^^|^cuatro|\\\"\\nvar sep = \\\"|\\\"\\nvar esc = \\\"^\\\"\\nvar items = tokenize.call(str, sep, esc)\\nfor (item in items) System.print((item == \\\"\\\") ? \\\"(empty)\\\" : item)\\n\",\n \"language\": \"Wren\"\n },\n {\n \"code\": \"fcn tokenize(str,sep,esc){\\n sink:=Sink(String);\\n foreach c in (str){\\n switch(c){\\n case(esc){ sink.write(__cWalker.next()); } // error if ^EoS\\n\\t case(sep){ sink.write(\\\"\\\\xff\\\"); }\\n\\t else { sink.write(c) }\\n }\\n }\\n sink.close().split(\\\"\\\\xff\\\");\\n}\\n\",\n \"language\": \"Zkl\"\n },\n {\n \"code\": \"fcn tokenize(str,sep,esc){\\n sink:=Sink(String);\\n foreach c in (str){ sink.write( (c==esc and __cWalker.next()) or (c==sep and \\\"\\\\xff\\\") or c ) }\\n sink.close().split(\\\"\\\\xff\\\");\\n}\\n\",\n \"language\": \"Zkl\"\n },\n {\n \"code\": \"tokenize(\\\"one^|uno||three^^^^|four^^^|^cuatro|\\\", \\\"|\\\",\\\"^\\\").println();\\n\",\n \"language\": \"Zkl\"\n }\n]","isConversational":false},"task_name":{"kind":"string","value":"Tokenize-a-string-with-escaping"}}},{"rowIdx":1762,"cells":{"solutions":{"kind":"list like","value":[{"code":"---\nfrom: http://rosettacode.org/wiki/Tonelli-Shanks_algorithm\n","language":"00-META"},{"code":"In computational number theory, the [[wp:Tonelli–Shanks algorithm|Tonelli–Shanks algorithm]] is a technique for solving for '''x''' in a congruence of the form:\n<big>\n:: x<sup>2</sup> ≡ n (mod p)\n</big>\nwhere '''n''' is an integer which is a quadratic residue (mod p), '''p''' is an odd prime, and '''x,n ∈ F<sub>p</sub>''' where F<sub>p</sub> = {0, 1, ..., p - 1}.\n\nIt is used in [https://en.wikipedia.org/wiki/Rabin_cryptosystem cryptography] techniques.\n\n\nTo apply the algorithm, we need the Legendre symbol:\n\nThe Legendre symbol '''(a | p)''' denotes the value of a<sup>(p-1)/2</sup> (mod p).\n* '''(a | p) ≡ 1''' if '''a''' is a square (mod p)\n* '''(a | p) ≡ -1''' if '''a''' is not a square (mod p)\n* '''(a | p) ≡ 0''' if '''a''' ≡ 0 (mod p) \n\n\n;Algorithm pseudo-code:\n<big>\nAll ≡ are taken to mean (mod p) unless stated otherwise.\n\n* Input: '''p''' an odd prime, and an integer '''n''' .\n* Step 0: Check that '''n''' is indeed a square: (n | p) must be ≡ 1 .\n* Step 1: By factoring out powers of 2 from p - 1, find '''q''' and '''s''' such that p - 1 = q2<sup>s</sup> with '''q''' odd .\n** If p ≡ 3 (mod 4) (i.e. s = 1), output the two solutions r ≡ ± n<sup>(p+1)/4</sup> .\n* Step 2: Select a non-square '''z''' such that (z | p) ≡ -1 and set c ≡ z<sup>q</sup> .\n* Step 3: Set r ≡ n<sup>(q+1)/2</sup>, t ≡ n<sup>q</sup>, m = s .\n* Step 4: Loop the following:\n** If t ≡ 1, output '''r''' and '''p - r''' .\n** Otherwise find, by repeated squaring, the lowest '''i''', 0 < i < m , such that t<sup>2<sup>i</sup></sup> ≡ 1 .\n** Let b ≡ c<sup>2<sup>(m - i - 1)</sup></sup>, and set r ≡ rb, t ≡ tb<sup>2</sup>, c ≡ b<sup>2</sup> and m = i .\n</big>\n\n\n;Task:\nImplement the above algorithm. \n\nFind solutions (if any) for \n* n = 10 p = 13\n* n = 56 p = 101\n* n = 1030 p = 10009\n* n = 1032 p = 10009\n* n = 44402 p = 100049 \n\n;Extra credit:\n* n = 665820697 p = 1000000009 \n* n = 881398088036 p = 1000000000039 \n* n = 41660815127637347468140745042827704103445750172002 p = 10^50 + 577 \t\n\n\n;See also:\n* [[Modular exponentiation]]\n* [[Cipolla's algorithm]]\n<br><br>\n","language":"00-TASK"},{"code":"F legendre(a, p)\n R pow(a, (p - 1) I/ 2, p)\n\nF tonelli(n, p)\n assert(legendre(n, p) == 1, ‘not a square (mod p)’)\n V q = p - 1\n V s = 0\n L q % 2 == 0\n q I/= 2\n s++\n I s == 1\n R pow(n, (p + 1) I/ 4, p)\n V z = 2\n L\n I p - 1 == legendre(z, p)\n L.break\n z++\n V c = pow(z, q, p)\n V r = pow(n, (q + 1) I/ 2, p)\n V t = pow(n, q, p)\n V m = s\n V t2 = BigInt(0)\n L (t - 1) % p != 0\n t2 = (t * t) % p\n V i = 1\n L(ii) 1 .< m\n I (t2 - 1) % p == 0\n i = ii\n L.break\n t2 = (t2 * t2) % p\n V b = pow(c, Int64(1 << (m - i - 1)), p)\n r = (r * b) % p\n c = (b * b) % p\n t = (t * c) % p\n m = i\n R r\n\nV ttest = [(BigInt(10), BigInt(13)), (BigInt(56), BigInt(101)), (BigInt(1030), BigInt(10009)), (BigInt(44402), BigInt(100049)),\n (BigInt(665820697), BigInt(1000000009)), (BigInt(881398088036), BigInt(1000000000039)),\n (BigInt(‘41660815127637347468140745042827704103445750172002’), BigInt(10) ^ 50 + 577)]\nL(n, p) ttest\n V r = tonelli(n, p)\n assert((r * r - n) % p == 0)\n print(‘n = #. p = #.’.format(n, p))\n print(\"\\t roots : #. #.\".format(r, p - r))\n","language":"11l"},{"code":"/* ARM assembly AARCH64 Raspberry PI 3B or android 64 bits */\n/* program tonshan64.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/*******************************************/\n/* Initialized data */\n/*******************************************/\n.data\nszMessStartPgm: .asciz \"Program 64 bits start \\n\"\nszMessEndPgm: .asciz \"Program normal end.\\n\"\nszMessError: .asciz \"\\033[31mError !!!\\n\"\nszMessErrGen: .asciz \"Error end program.\\n\"\nszMessOverflow: .asciz \"Overflow function modulo.\\n\"\nszMessNoSolution: .asciz \"No solution.\\n\"\nszCarriageReturn: .asciz \"\\n\"\n\n/* datas message display */\nszMessEntry: .asciz \"Number : @ modulo : @ ==> \"\nszMessResult: .asciz \"Racine 1 : @ Racine 2 : @ \\n\"\n\n\nqNumberN: .quad 44402\nqNumberP: .quad 100049\n/*******************************************/\n/* UnInitialized data */\n/*******************************************/\n.bss\n.align 4\nsZoneConv: .skip 24\n/*******************************************/\n/* code section */\n/*******************************************/\n.text\n.global main\nmain: // program start\n ldr x0,qAdrszMessStartPgm // display start message\n bl affichageMess\n\n mov x0,10\n mov x1,13\n bl displayEntry\n bl computeTonSha\n bl displayResult\n\n mov x0,56\n mov x1,101\n bl displayEntry\n bl computeTonSha\n bl displayResult\n\n mov x0,1030\n mov x1,10009\n bl displayEntry\n bl computeTonSha\n bl displayResult\n\n mov x0,1032\n mov x1,10009\n bl displayEntry\n bl computeTonSha\n bcs 1f\n bl displayResult\n1:\n ldr x4,qAdrqNumberN\n ldr x0,[x4]\n ldr x4,qAdrqNumberP\n ldr x1,[x4]\n bl displayEntry\n bl computeTonSha\n bl displayResult\n\n ldr x0,qAdrszMessEndPgm // display end message\n bl affichageMess\n b 100f\n99: // display error message\n ldr x0,qAdrszMessError\n bl affichageMess\n100: // standard end of the program\n mov x0, #0 // return code\n mov x8, #EXIT // request to exit program\n svc 0 // perform system call\nqAdrszMessStartPgm: .quad szMessStartPgm\nqAdrszMessEndPgm: .quad szMessEndPgm\nqAdrszMessError: .quad szMessError\nqAdrszMessNoSolution: .quad szMessNoSolution\nqAdrszCarriageReturn: .quad szCarriageReturn\nqAdrqNumberN: .quad qNumberN\nqAdrqNumberP: .quad qNumberP\n\nqAdrszMessResult: .quad szMessResult\nqAdrsZoneConv: .quad sZoneConv\n\n/******************************************************************/\n/* algorithm Tonelli–Shanks */\n/******************************************************************/\n/* x0 contains number */\n/* x1 contains modulus */\n/* x0 return root 1 */\n/* x1 return root 2 */\ncomputeTonSha:\n stp x10,lr,[sp,-16]! // save registres\n stp x2,x3,[sp,-16]! // save registres\n stp x4,x5,[sp,-16]! // save registres\n stp x6,x7,[sp,-16]! // save registres\n stp x8,x9,[sp,-16]! // save registres\n stp x11,x12,[sp,-16]! // save registres\n mov x9,x0 // save number\n mov x10,x1 // save modulo p\n mov x2,x10\n sub x1,x2,1\n lsr x1,x1,1\n bl moduloPuR64\n bcs 100f // error ?\n cmp x0,#1\n bne 20f\n sub x5,x10,1\n mov x6,#1 // s\n1:\n lsr x5,x5,#1 // div by 2\n tst x5,1 // even ?\n cinc x6,x6,eq // yes count\n beq 1b // and loop\n // x5 = q\n cmp x6,#1 // s = 1 ?\n bne 3f\n add x1,x10,1 // compute root 1\n lsr x1,x1,#2 // p + 1 / 4\n mov x0,x9 // n\n mov x2,x10 // p\n bl moduloPuR64\n bcs 100f // error ?\n neg x1,x0 // compute root 2 = - root 1\n b 100f // and end\n3:\n mov x7,#3 // z\n4:\n mov x0,x7\n mov x2,x10 // p\n sub x1,x2,1\n lsr x1,x1,1 // power = p - 1 / 2\n bl moduloPuR64\n bcs 100f // error ?\n cmp x0,#1\n cinc x7,x7,eq // si égal à 1\n cinc x7,x7,eq\n beq 4b\n cmp x0,0\n cinc x7,x7,eq // si egal à 0\n cinc x7,x7,eq\n beq 4b\n mov x0,x7 // z\n mov x1,x5 // q\n mov x2,x10 // p\n bl moduloPuR64\n bcs 100f // error ?\n mov x12,x0 // c = z pow q mod p\n\n add x1,x5,1 // = q +1\n lsr x1,x1,1 // div 2\n mov x0,x9 // n\n mov x2,x10 // p\n bl moduloPuR64\n mov x4,x0 // r = n puis (q+1)/2 mod p\n\n mov x0,x9 // n\n mov x1,x5 // = q\n mov x2,x10 // p\n bl moduloPuR64\n bcs 100f // error ?\n mov x5,x0 // reuse r5 = t = n pow q mod p\n\n8: // begin loop\n cmp x5,1\n beq 10f\n mov x0,x5 // t\n mov x1,x6 // m\n mov x2,x10 // p\n bl searchI // search i for t puis 2 puis i = 1 mod p\n cmp x0,-1 // not find -> no solution\n beq 20f\n mov x9,x0 // i\n sub x8,x6,x0 // compute b\n sub x8,x8,1 // m - i - 1\n mov x1,1\n lsl x1,x1,x8\n mov x0,x12\n mov x2,x10 // p\n bl moduloPuR64\n bcs 100f // error ?\n mov x7,x0 // b = c puis 2 puis 2 puis m-i-1 à verifier\n\n mul x0,x7,x4 // r = r * b mod p\n umulh x1,x7,x4\n mov x2,x10\n bl divisionReg128U\n mov x4,x3 // r mod p\n mul x0,x7,x7\n umulh x1,x7,x7\n mov x2,x10\n bl divisionReg128U\n mov x12,x3 // c mod p\n\n mul x0,x5,x12\n umulh x1,x5,x12\n mov x2,x10\n bl divisionReg128U\n mov x5,x3 // t mod p\n\n mov x6,x9 // m = i\n b 8b\n9:\n\n10:\n mov x0,x4 // x0 return root 1\n sub x1,x10,x0 // x1 return root 2\n cmn x0,0 // carry à zero roots ok\n b 100f\n20:\n ldr x0,qAdrszMessNoSolution\n bl affichageMess\n\n mov x0,0\n mov x1,0\n cmp x0,0 // carry to 1 No solution\n100:\n ldp x11,x12,[sp],16\n ldp x8,x9,[sp],16\n ldp x6,x7,[sp],16\n ldp x4,x5,[sp],16\n ldp x2,x3,[sp],16\n ldp x10,lr,[sp],16 // restaur des 2 registres\n ret // retour adresse lr x30\n\n/******************************************************************/\n/* search i */\n/******************************************************************/\n// x0 contains t\n// x1 contains maxi\n// x2 contains modulo\nsearchI:\n stp x1,lr,[sp,-16]! // save registres\n stp x2,x3,[sp,-16]! // save registres\n stp x4,x5,[sp,-16]! // save registres\n stp x6,x7,[sp,-16]! // save registres\n mov x4,x0 // t\n mov x6,x1 // m\n mov x3,1 // i\n1:\n mov x5,1\n lsl x5,x5,x3 // compute 2 power i\n\n mov x0,x4\n mov x1,x5\n bl moduloPuR64 // compute t pow 2 pow i mod p\n cmp x0,1 // = 1 ?\n beq 3f // yes it is ok\n add x3,x3,1 // next i\n cmp x3,x6\n blt 1b // loop\n mov x0,-1 // not find\n b 100f\n3:\n mov x0,x3 // return i\n100:\n ldp x6,x7,[sp],16\n ldp x4,x5,[sp],16\n ldp x2,x3,[sp],16\n ldp x1,lr,[sp],16 // restaur des 2 registres\n ret // retour adresse lr x30\n/******************************************************************/\n/* display numbers */\n/******************************************************************/\n/* x0 contains number */\n/* x1 contains modulo */\ndisplayEntry:\n stp x0,lr,[sp,-16]! // save registres\n stp x1,x2,[sp,-16]! // save registres\n mov x2,x1 // root 2\n ldr x1,qAdrsZoneConv // convert root 1 in r0\n bl conversion10S // convert ascii string\n ldr x0,qAdrszMessEntry\n ldr x1,qAdrsZoneConv\n bl strInsertAtCharInc // and put in message\n mov x3,x0\n mov x0,x2 // racine 2\n ldr x1,qAdrsZoneConv\n bl conversion10S // convert ascii string\n mov x0,x3\n ldr x1,qAdrsZoneConv\n bl strInsertAtCharInc // and put in message\n bl affichageMess\n100:\n ldp x1,x2,[sp],16\n ldp x0,lr,[sp],16 // restaur des 2 registres\n ret // retour adresse lr x30\nqAdrszMessEntry: .quad szMessEntry\n/******************************************************************/\n/* display roots */\n/******************************************************************/\n/* x0 contains root 1 */\n/* x1 contains root 2 */\ndisplayResult:\n stp x1,lr,[sp,-16]! // save registres\n stp x2,x3,[sp,-16]! // save registres\n mov x2,x1 // root 2\n ldr x1,qAdrsZoneConv // convert root 1 in r0\n bl conversion10S // convert ascii string\n ldr x0,qAdrszMessResult\n ldr x1,qAdrsZoneConv\n bl strInsertAtCharInc // and put in message\n mov x3,x0\n mov x0,x2 // racine 2\n ldr x1,qAdrsZoneConv\n bl conversion10S // convert ascii string\n mov x0,x3\n ldr x1,qAdrsZoneConv\n bl strInsertAtCharInc // and put in message\n bl affichageMess\n100:\n ldp x2,x3,[sp],16\n ldp x1,lr,[sp],16 // restaur des 2 registres\n ret // retour adresse lr x30\n/**************************************************************/\n/********************************************************/\n/* Calcul modulo de b puissance e modulo m */\n/* Exemple 4 puissance 13 modulo 497 = 445 */\n/********************************************************/\n/* x0 nombre */\n/* x1 exposant */\n/* x2 modulo */\nmoduloPuR64:\n stp x1,lr,[sp,-16]! // save registres\n stp x3,x4,[sp,-16]! // save registres\n stp x5,x6,[sp,-16]! // save registres\n stp x7,x8,[sp,-16]! // save registres\n stp x9,x10,[sp,-16]! // save registres\n cbz x0,100f\n cbz x1,100f\n mov x8,x0\n mov x7,x1\n mov x6,1 // resultat\n udiv x4,x8,x2\n msub x9,x4,x2,x8 // contient le reste\n1:\n tst x7,1\n beq 2f\n mul x4,x9,x6\n umulh x5,x9,x6\n mov x6,x4\n mov x0,x6\n mov x1,x5\n bl divisionReg128U\n cbnz x1,99f // overflow\n mov x6,x3\n2:\n mul x8,x9,x9\n umulh x5,x9,x9\n mov x0,x8\n mov x1,x5\n bl divisionReg128U\n cbnz x1,99f // overflow\n mov x9,x3\n lsr x7,x7,1\n cbnz x7,1b\n cmn x0,0 // carry à zero pas d'erreur\n mov x0,x6 // result\n b 100f\n99:\n ldr x0,qAdrszMessOverflow\n bl affichageMess\n cmp x0,0 // carry à un car erreur\n mov x0,-1 // code erreur\n\n100:\n ldp x9,x10,[sp],16 // restaur des 2 registres\n ldp x7,x8,[sp],16 // restaur des 2 registres\n ldp x5,x6,[sp],16 // restaur des 2 registres\n ldp x3,x4,[sp],16 // restaur des 2 registres\n ldp x1,lr,[sp],16 // restaur des 2 registres\n ret // retour adresse lr x30\nqAdrszMessOverflow: .quad szMessOverflow\n/***************************************************/\n/* division d un nombre de 128 bits par un nombre de 64 bits */\n/***************************************************/\n/* x0 contient partie basse dividende */\n/* x1 contient partie haute dividente */\n/* x2 contient le diviseur */\n/* x0 retourne partie basse quotient */\n/* x1 retourne partie haute quotient */\n/* x3 retourne le reste */\ndivisionReg128U:\n stp x6,lr,[sp,-16]! // save registres\n stp x4,x5,[sp,-16]! // save registres\n mov x5,#0 // raz du reste R\n mov x3,#128 // compteur de boucle\n mov x4,#0 // dernier bit\n1:\n lsl x5,x5,#1 // on decale le reste de 1\n tst x1,1<<63 // test du bit le plus à gauche\n lsl x1,x1,#1 // on decale la partie haute du quotient de 1\n beq 2f\n orr x5,x5,#1 // et on le pousse dans le reste R\n2:\n tst x0,1<<63\n lsl x0,x0,#1 // puis on decale la partie basse\n beq 3f\n orr x1,x1,#1 // et on pousse le bit de gauche dans la partie haute\n3:\n orr x0,x0,x4 // position du dernier bit du quotient\n mov x4,#0 // raz du bit\n cmp x5,x2\n blt 4f\n sub x5,x5,x2 // on enleve le diviseur du reste\n mov x4,#1 // dernier bit à 1\n4:\n // et boucle\n subs x3,x3,#1\n bgt 1b\n lsl x1,x1,#1 // on decale le quotient de 1\n tst x0,1<<63\n lsl x0,x0,#1 // puis on decale la partie basse\n beq 5f\n orr x1,x1,#1\n5:\n orr x0,x0,x4 // position du dernier bit du quotient\n mov x3,x5\n100:\n ldp x4,x5,[sp],16 // restaur des 2 registres\n ldp x6,lr,[sp],16 // restaur des 2 registres\n ret // retour adresse lr x30\n\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":"/* ARM assembly Raspberry PI or android 32 bits */\n/* program tonshan.s */\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/* for constantes see task include a file in arm assembly */\n/************************************/\n/* Constantes */\n/************************************/\n.include \"../constantes.inc\"\n\n/*******************************************/\n/* Initialized data */\n/*******************************************/\n.data\nszMessStartPgm: .asciz \"Program 32 bits start \\n\"\nszMessEndPgm: .asciz \"Program normal end.\\n\"\nszMessError: .asciz \"\\033[31mError !!!\\n\"\nszMessErrGen: .asciz \"Error end program.\\n\"\nszMessOverflow: .asciz \"Overflow function modulo.\\n\"\nszMessNoSolution: .asciz \"No solution.\\n\"\nszCarriageReturn: .asciz \"\\n\"\n\n/* datas message display */\nszMessEntry: .asciz \"Number : @ modulo : @ ==> \"\nszMessResult: .asciz \"Racine 1 : @ Racine 2 : @ \\n\"\n\niNumberN: .int 1030\niNumberP: .int 10009\n\niNumberN1: .int 1032\niNumberP1: .int 10009\n\niNumberN2: .int 44402\niNumberP2: .int 100049\n\n/*******************************************/\n/* UnInitialized data */\n/*******************************************/\n.bss\n.align 4\nsZoneConv: .skip 24\n/*******************************************/\n/* code section */\n/*******************************************/\n.text\n.global main\nmain: // program start\n ldr r0,iAdrszMessStartPgm // display start message\n bl affichageMess\n\n mov r0,#10\n mov r1,#13\n bl displayEntry // display entry number\n bl computeTonSha // compute roots\n bl displayResult // display roots\n\n mov r0,#56\n mov r1,#101\n bl displayEntry\n bl computeTonSha\n bl displayResult\n\n\n ldr r4,iAdriNumberN\n ldr r0,[r4]\n ldr r4,iAdriNumberP\n ldr r1,[r4]\n bl displayEntry\n bl computeTonSha\n bl displayResult\n\n ldr r4,iAdriNumberN1\n ldr r0,[r4]\n ldr r4,iAdriNumberP1\n ldr r1,[r4]\n bl displayEntry\n bl computeTonSha\n bcs 1f\n bl displayResult\n1:\n ldr r4,iAdriNumberN2\n ldr r0,[r4]\n ldr r4,iAdriNumberP2\n ldr r1,[r4]\n bl displayEntry\n bl computeTonSha\n bl displayResult\n\n ldr r0,iAdrszMessEndPgm // display end message\n bl affichageMess\n b 100f\n99: // display error message\n ldr r0,iAdrszMessError\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\niAdrszMessStartPgm: .int szMessStartPgm\niAdrszMessEndPgm: .int szMessEndPgm\niAdrszMessError: .int szMessError\niAdrszMessNoSolution: .int szMessNoSolution\niAdrszCarriageReturn: .int szCarriageReturn\niAdriNumberN: .int iNumberN\niAdriNumberP: .int iNumberP\niAdriNumberN1: .int iNumberN1\niAdriNumberP1: .int iNumberP1\niAdriNumberN2: .int iNumberN2\niAdriNumberP2: .int iNumberP2\n\niAdrszMessResult: .int szMessResult\niAdrsZoneConv: .int sZoneConv\n\n/******************************************************************/\n/* algorithm Tonelli–Shanks */\n/******************************************************************/\n/* r0 contains number */\n/* r1 contains modulus */\n/* r0 return root 1 */\n/* r1 return root 2 */\ncomputeTonSha:\n push {r2-r12,lr}\n\n mov r9,r0 // save number\n mov r10,r1 // save modulo p\n mov r2,r10\n sub r1,r2,#1\n lsr r1,r1,#1\n bl moduloPuR32\n cmp r0,#1\n bne 20f\n sub r5,r10,#1\n mov r6,#1 // s\n1:\n lsr r5,r5,#1 // div by 2\n tst r5,#1 // even ?\n addeq r6,#1\n beq 1b // and loop\n // r5 = q\n cmp r6,#1 // s = 1 ?\n bne 3f\n add r1,r10,#1 // compute root 1\n lsr r1,r1,#2 // p + 1 / 4\n mov r0,r9 // n\n mov r2,r10 // p\n bl moduloPuR32\n neg r1,r0 // compute root 2 = - root 1\n b 100f // and end\n3:\n mov r7,#3 // z\n4:\n mov r0,r7\n mov r2,r10 // p\n sub r1,r2,#1\n lsr r1,r1,#1 // power = p - 1 / 2\n bl moduloPuR32\n cmp r0,#1\n addeq r7,#2\n beq 4b\n cmp r0,#0\n addeq r7,#2\n beq 4b\n mov r0,r7 // z\n mov r1,r5 // q\n mov r2,r10 // p\n bl moduloPuR32\n mov r12,r0 // c = z pow q mod p\n\n add r1,r5,#1 // = q +1\n lsr r1,r1,#1 // div 2\n mov r0,r9 // n\n mov r2,r10 // p\n bl moduloPuR32\n mov r4,r0 // r = n puis (q+1)/2 mod p\n\n mov r0,r9 // n\n mov r1,r5 // = q\n mov r2,r10 // p\n bl moduloPuR32\n mov r5,r0 // reuse r5 = t = n pow q mod p\n\n8: // begin loop\n cmp r5,#1\n beq 10f\n mov r0,r5 // t\n mov r1,r6 // m\n mov r2,r10 // p\n bl searchI // search i for t puis 2 puis i = 1 mod p\n cmp r0,#-1 // not find -> no solution\n beq 20f\n mov r9,r0 // i\n sub r8,r6,r0 // compute b\n sub r8,r8,#1 // m - i - 1\n mov r1,#1\n lsl r1,r1,r8\n mov r0,r12\n mov r2,r10 // p\n bl moduloPuR32\n mov r7,r0 // b = c puis 2 puis 2 puis m-i-1 à verifier\n\n umull r0,r1,r7,r4 // r = r * b mod p\n mov r2,r10\n bl division32R\n mov r4,r2 // r mod p\n umull r0,r1,r7,r7\n mov r2,r10\n bl division32R\n mov r12,r2 // c mod p\n\n umull r0,r1,r5,r12\n mov r2,r10\n bl division32R\n mov r5,r2 // t mod p\n\n mov r6,r9 // m = i\n b 8b\n9:\n\n10:\n mov r0,r4 // r0 return root 1\n sub r1,r10,r0 // r1 return root 2\n cmn r0,#0 // carry à zero roots ok\n b 100f\n20:\n ldr r0,iAdrszMessNoSolution\n bl affichageMess\n\n mov r0,#0\n mov r1,#0\n cmp r0,#0 // carry to 1 No solution\n100:\n pop {r2-r12,lr} // restaur registers\n bx lr // return\n/******************************************************************/\n/* search i */\n/******************************************************************/\n// r0 contains t\n// r1 contains maxi\n// r2 contains modulo\n// r0 return i\nsearchI:\n push {r1-r6,lr}\n\n mov r4,r0 // t\n mov r6,r1 // m\n mov r3,#1 // i\n1:\n mov r5,#1\n lsl r5,r5,r3 // compute 2 power i\n\n mov r0,r4\n mov r1,r5\n bl moduloPuR32 // compute t pow 2 pow i mod p\n cmp r0,#1 // = 1 ?\n beq 3f // yes it is ok\n add r3,r3,#1 // next i\n cmp r3,r6\n blt 1b // loop\n mov r0,#-1 // not find\n b 100f\n3:\n mov r0,r3 // return i\n100:\n pop {r1-r6,lr} // restaur registers\n bx lr // return\n/******************************************************************/\n/* display numbers */\n/******************************************************************/\n/* r0 contains number */\n/* r1 contains modulo */\ndisplayEntry:\n push {r0-r3,lr}\n mov r2,r1 // root 2\n ldr r1,iAdrsZoneConv // convert root 1 in r0\n bl conversion10S // convert ascii string\n ldr r0,iAdrszMessEntry\n ldr r1,iAdrsZoneConv\n bl strInsertAtCharInc // and put in message\n mov r3,r0\n mov r0,r2 // racine 2\n ldr r1,iAdrsZoneConv\n bl conversion10S // convert ascii string\n mov r0,r3\n ldr r1,iAdrsZoneConv\n bl strInsertAtCharInc // and put in message\n bl affichageMess\n100:\n pop {r0-r3,lr} // restaur registers\n bx lr // return\niAdrszMessEntry: .int szMessEntry\n/******************************************************************/\n/* display roots */\n/******************************************************************/\n/* r0 contains root 1 */\n/* r1 contains root 2 */\ndisplayResult:\n push {r1-r3,lr}\n mov r2,r1 // root 2\n ldr r1,iAdrsZoneConv // convert root 1 in r0\n bl conversion10S // convert ascii string\n ldr r0,iAdrszMessResult\n ldr r1,iAdrsZoneConv\n bl strInsertAtCharInc // and put in message\n mov r3,r0\n mov r0,r2 // racine 2\n ldr r1,iAdrsZoneConv\n bl conversion10S // convert ascii string\n mov r0,r3\n ldr r1,iAdrsZoneConv\n bl strInsertAtCharInc // and put in message\n bl affichageMess\n100:\n\n pop {r1-r3,lr} // restaur registers\n bx lr // return\n/********************************************************/\n/* Calcul modulo de b puissance e modulo m */\n/* Exemple 4 puissance 13 modulo 497 = 445 */\n/* */\n/********************************************************/\n/* r0 nombre */\n/* r1 exposant */\n/* r2 modulo */\n/* r0 return result */\nmoduloPuR32:\n push {r1-r7,lr} @ save registers\n cmp r0,#0 @ verif <> zero\n beq 90f\n cmp r1,#0 @ verif <> zero\n moveq r0,#0\n beq 90f\n cmp r2,#0 @ verif <> zero\n moveq r0,#0\n beq 90f @\n1:\n mov r4,r2 @ save modulo\n mov r5,r1 @ save exposant\n mov r6,r0 @ save base\n mov r3,#1 @ start result\n\n mov r1,#0 @ division de r0,r1 par r2\n bl division32R\n mov r6,r2 @ base <- remainder\n2:\n tst r5,#1 @ exposant even or odd\n beq 3f\n umull r0,r1,r6,r3\n mov r2,r4\n bl division32R\n mov r3,r2 @ result <- remainder\n3:\n umull r0,r1,r6,r6\n mov r2,r4\n bl division32R\n mov r6,r2 @ base <- remainder\n\n lsr r5,#1 @ left shift 1 bit\n cmp r5,#0 @ end ?\n bne 2b\n mov r0,r3\n90:\n cmn r0,#0 @ no error\n100: @ fin standard de la fonction\n pop {r1-r7,lr} @ restaur des registres\n bx lr @ retour de la fonction en utilisant lr\n\n/***************************************************/\n/* division number 64 bits in 2 registers by number 32 bits */\n/***************************************************/\n/* r0 contains lower part dividende */\n/* r1 contains upper part dividende */\n/* r2 contains divisor */\n/* r0 return lower part quotient */\n/* r1 return upper part quotient */\n/* r2 return remainder */\ndivision32R:\n push {r3-r9,lr} @ save registers\n mov r6,#0 @ init upper upper part remainder !!\n mov r7,r1 @ init upper part remainder with upper part dividende\n mov r8,r0 @ init lower part remainder with lower part dividende\n mov r9,#0 @ upper part quotient\n mov r4,#0 @ lower part quotient\n mov r5,#32 @ bits number\n1: @ begin loop\n lsl r6,#1 @ shift upper upper part remainder\n lsls r7,#1 @ shift upper part remainder\n orrcs r6,#1\n lsls r8,#1 @ shift lower part remainder\n orrcs r7,#1\n lsls r4,#1 @ shift lower part quotient\n lsl r9,#1 @ shift upper part quotient\n orrcs r9,#1\n @ divisor sustract upper part remainder\n subs r7,r2\n sbcs r6,#0 @ and substract carry\n bmi 2f @ négative ?\n\n @ positive or equal\n orr r4,#1 @ 1 -> right bit quotient\n b 3f\n2: @ negative\n orr r4,#0 @ 0 -> right bit quotient\n adds r7,r2 @ and restaur remainder\n adc r6,#0\n3:\n subs r5,#1 @ decrement bit size\n bgt 1b @ end ?\n mov r0,r4 @ lower part quotient\n mov r1,r9 @ upper part quotient\n mov r2,r7 @ remainder\n100: @ function end\n pop {r3-r9,lr} @ restaur registers\n bx lr\n/***************************************************/\n/* ROUTINES INCLUDE */\n/***************************************************/\n.include \"../affichage.inc\"\n","language":"ARM-Assembly"},{"code":"#include <stdbool.h>\n#include <stdint.h>\n#include <stdio.h>\n\nuint64_t modpow(uint64_t a, uint64_t b, uint64_t n) {\n uint64_t x = 1, y = a;\n while (b > 0) {\n if (b % 2 == 1) {\n x = (x * y) % n; // multiplying with base\n }\n y = (y * y) % n; // squaring the base\n b /= 2;\n }\n return x % n;\n}\n\nstruct Solution {\n uint64_t root1, root2;\n bool exists;\n};\n\nstruct Solution makeSolution(uint64_t root1, uint64_t root2, bool exists) {\n struct Solution sol;\n sol.root1 = root1;\n sol.root2 = root2;\n sol.exists = exists;\n return sol;\n}\n\nstruct Solution ts(uint64_t n, uint64_t p) {\n uint64_t q = p - 1;\n uint64_t ss = 0;\n uint64_t z = 2;\n uint64_t c, r, t, m;\n\n if (modpow(n, (p - 1) / 2, p) != 1) {\n return makeSolution(0, 0, false);\n }\n\n while ((q & 1) == 0) {\n ss += 1;\n q >>= 1;\n }\n\n if (ss == 1) {\n uint64_t r1 = modpow(n, (p + 1) / 4, p);\n return makeSolution(r1, p - r1, true);\n }\n\n while (modpow(z, (p - 1) / 2, p) != p - 1) {\n z++;\n }\n\n c = modpow(z, q, p);\n r = modpow(n, (q + 1) / 2, p);\n t = modpow(n, q, p);\n m = ss;\n\n while (true) {\n uint64_t i = 0, zz = t;\n uint64_t b = c, e;\n if (t == 1) {\n return makeSolution(r, p - r, true);\n }\n while (zz != 1 && i < (m - 1)) {\n zz = zz * zz % p;\n i++;\n }\n e = m - i - 1;\n while (e > 0) {\n b = b * b % p;\n e--;\n }\n r = r * b % p;\n c = b * b % p;\n t = t * c % p;\n m = i;\n }\n}\n\nvoid test(uint64_t n, uint64_t p) {\n struct Solution sol = ts(n, p);\n printf(\"n = %llu\\n\", n);\n printf(\"p = %llu\\n\", p);\n if (sol.exists) {\n printf(\"root1 = %llu\\n\", sol.root1);\n printf(\"root2 = %llu\\n\", sol.root2);\n } else {\n printf(\"No solution exists\\n\");\n }\n printf(\"\\n\");\n}\n\nint main() {\n test(10, 13);\n test(56, 101);\n test(1030, 10009);\n test(1032, 10009);\n test(44402, 100049);\n\n return 0;\n}\n","language":"C"},{"code":"// return (a * b) % mod, avoiding overflow errors while doing modular multiplication.\nstatic unsigned multiplication_modulo(unsigned a, unsigned b, const unsigned mod) {\n\tunsigned res = 0, tmp;\n\tfor (b %= mod; a; a & 1 ? b >= mod - res ? res -= mod : 0, res += b : 0, a >>= 1, (tmp = b) >= mod - b ? tmp -= mod : 0, b += tmp);\n\treturn res % mod;\n}\n\n// return (n ^ exp) % mod\nstatic unsigned mod_pow(unsigned n, unsigned exp, const unsigned mod) {\n\tunsigned res = 1;\n\tfor (n %= mod; exp; exp & 1 ? res = multiplication_modulo(res, n, mod) : 0, n = multiplication_modulo(n, n, mod), exp >>= 1);\n\treturn res;\n}\n\nstatic unsigned tonelli_shanks_1(const unsigned n, const unsigned mod) {\n\t// return root such that (root * root) % mod congruent to n % mod.\n\t// return 0 if no solution to the congruence exists.\n\t// mod is assumed odd prime.\n\tconst unsigned a = n % mod;\n\tunsigned res, b, c, d, e, f, g, h;\n\tif (mod_pow(a, (mod - 1) >> 1, mod) != 1)\n\t\tres = 0;\n\telse\n\t\tswitch (mod & 7) {\n\t\t\tcase 3 : case 7 :\n\t\t\t\tres = mod_pow(a, (mod + 1) >> 2, mod);\n\t\t\t\tbreak;\n\t\t\tcase 5 :\n\t\t\t\tres = mod_pow(a, (mod + 3) >> 3, mod);\n\t\t\t\tif (multiplication_modulo(res, res, mod) != a){\n\t\t\t\t\tb = mod_pow(2, (mod - 1) >> 2, mod);\n\t\t\t\t\tres = multiplication_modulo(res, b, mod);\n\t\t\t\t}\n\t\t\t\tbreak;\n\t\t\tdefault :\n\t\t\t\tif (a == 1)\n\t\t\t\t\tres = 1;\n\t\t\t\telse {\n\t\t\t\t\tfor (c = mod - 1, d = 2; d < mod && mod_pow(d, c >> 1, mod) != c; ++d);\n\t\t\t\t\tfor (e = 0; !(c & 1); ++e, c >>= 1);\n\t\t\t\t\tf = mod_pow(a, c, mod);\n\t\t\t\t\tb = mod_pow(d, c, mod);\n\t\t\t\t\tfor (h = 0, g = 0; h < e; h++) {\n\t\t\t\t\t\td = mod_pow(b, g, mod);\n\t\t\t\t\t\td = multiplication_modulo(d, f, mod);\n\t\t\t\t\t\td = mod_pow(d, 1 << (e - 1 - h), mod);\n\t\t\t\t\t\tif (d == mod - 1)\n\t\t\t\t\t\t\tg += 1 << h;\n\t\t\t\t\t}\n\t\t\t\t\tf = mod_pow(a, (c + 1) >> 1, mod);\n\t\t\t\t\tb = mod_pow(b, g >> 1, mod);\n\t\t\t\t\tres = multiplication_modulo(f, b, mod);\n\t\t\t\t}\n\t\t}\n\treturn res;\n}\n\n// return root such that (root * root) % mod congruent to n % mod.\n// return 0 (the default value of a) if no solution to the congruence exists.\nstatic unsigned tonelli_shanks_2(unsigned n, const unsigned mod) {\n\tunsigned a = 0, b = mod - 1, c, d = b, e = 0, f = 2, g;\n\tif (mod_pow(n, b >> 1, mod) == 1) {\n\t\tfor (; !(d & 1); ++e, d >>= 1);\n\t\tif (e == 1)\n\t\t\ta = mod_pow(n, (mod + 1) >> 2, mod);\n\t\telse {\n\t\t\tfor (; b != mod_pow(f, b >> 1, mod); ++f);\n\t\t\tfor (b = mod_pow(f, d, mod), a = mod_pow(n, (d + 1) >> 1, mod), c = mod_pow(n, d, mod), g = e; c != 1; g = d) {\n\t\t\t\tfor (d = 0, e = c, --g; e != 1 && d < g; ++d)\n\t\t\t\t\te = multiplication_modulo(e, e, mod);\n\t\t\t\tfor (f = b, n = g - d; n--;)\n\t\t\t\t\tf = multiplication_modulo(f, f, mod);\n\t\t\t\ta = multiplication_modulo(a, f, mod);\n\t\t\t\tb = multiplication_modulo(f, f, mod);\n\t\t\t\tc = multiplication_modulo(c, b, mod);\n\t\t\t}\n\t\t}\n\t}\n\treturn a;\n}\n\n#include <assert.h>\nint main() {\n\tunsigned n, mod, root ; /* root_2 = mod - root */\n\n\tn = 27875, mod = 26371, root = tonelli_shanks_1(n, mod);\n\tassert(root == 14320); // 14320 * 14320 mod 26371 = 1504 and 1504 = 27875 mod 26371\n\n\tn = 1111111111, mod = 1111111121, root = tonelli_shanks_1(n, mod);\n\tassert(root == 88664850);\n\n\tn = 5258, mod = 3851, root = tonelli_shanks_1(n, mod);\n\tassert(root == 0); // no solution to the congruence exists.\n}\n","language":"C"},{"code":"#include <cstdint>\n#include <iostream>\n#include <vector>\n\nstruct Pair {\n\tuint64_t n;\n\tuint64_t p;\n};\n\nstruct Solution {\n\tuint64_t root1;\n\tuint64_t root2;\n\tbool is_square;\n};\n\nuint64_t multiply_modulus(uint64_t a, uint64_t b, const uint64_t& modulus) {\n a %= modulus; b %= modulus;\n if ( b < a ) {\n \tuint64_t temp = a; a = b; b = temp;\n }\n\n uint64_t result = 0;\n while ( a > 0 ) {\n if ( a % 2 == 1 ) {\n \tresult = ( result + b ) % modulus;\n };\n b = ( b << 1 ) % modulus;\n a >>= 1;\n }\n return result;\n}\n\nuint64_t power_modulus(uint64_t base, uint64_t exponent, const uint64_t& modulus) {\n\tif ( modulus == 1 ) {\n\t\treturn 0;\n\t}\n\n\tbase %= modulus;\n\tuint64_t result = 1;\n\twhile ( exponent > 0 ) {\n\t\tif ( ( exponent & 1 ) == 1 ) {\n\t\t\tresult = multiply_modulus(result, base, modulus);\n\t\t}\n\t\tbase = multiply_modulus(base, base, modulus);\n\t\texponent >>= 1;\n\t}\n\treturn result;\n}\n\nuint64_t legendre(const uint64_t& a, const uint64_t& p) {\n return power_modulus(a, ( p - 1 ) / 2, p);\n}\n\nSolution tonelli_shanks(const uint64_t& n, const uint64_t& p) {\n\tif ( legendre(n, p) != 1 ) {\n\t\treturn Solution(0, 0, false);\n\t}\n\n\t// Factor out powers of 2 from p - 1\n uint64_t q = p - 1;\n uint64_t s = 0;\n while ( q % 2 == 0 ) {\n q /= 2;\n s += 1;\n }\n\n if ( s == 1 ) {\n\t uint64_t result = power_modulus(n, ( p + 1 ) / 4, p);\n\t return Solution(result, p - result, true);\n }\n\n // Find a non-square z such as ( z | p ) = -1\n uint64_t z = 2;\n\twhile ( legendre(z, p) != p - 1 ) {\n\t\tz += 1;\n }\n\n uint64_t c = power_modulus(z, q, p);\n uint64_t t = power_modulus(n, q, p);\n uint64_t m = s;\n uint64_t result = power_modulus(n, ( q + 1 ) >> 1, p);\n\n while ( t != 1 ) {\n uint64_t i = 1;\n z = multiply_modulus(t, t, p);\n while ( z != 1 && i < m - 1 ) {\n i += 1;\n z = multiply_modulus(z, z, p);\n }\n uint64_t b = power_modulus(c, 1 << ( m - i - 1 ), p);\n c = multiply_modulus(b, b, p);\n t = multiply_modulus(t, c, p);\n m = i;\n result = multiply_modulus(result, b, p);\n }\n return Solution(result, p - result, true);\n}\n\nint main() {\n\tconst std::vector<Pair> tests = { Pair(10, 13), Pair(56, 101), Pair(1030, 1009), Pair(1032, 1009),\n\t\tPair(44402, 100049), Pair(665820697, 1000000009), Pair(881398088036, 1000000000039) };\n\n\tfor ( const Pair& test : tests ) {\n\t\tSolution solution = tonelli_shanks(test.n, test.p);\n\t\tstd::cout << \"n = \" << test.n << \", p = \" << test.p;\n\t\tif ( solution.is_square == true ) {\n\t\t\tstd::cout << \" has solutions: \" << solution.root1 << \" and \" << solution.root2 << std::endl << std::endl;\n\t\t} else {\n\t\t\tstd::cout << \" has no solutions because n is not a square modulo p\" << std::endl << std::endl;\n\t\t}\n\t}\n}\n","language":"C++"},{"code":"using System;\nusing System.Collections.Generic;\nusing System.Numerics;\n\nnamespace TonelliShanks {\n class Solution {\n private readonly BigInteger root1, root2;\n private readonly bool exists;\n\n public Solution(BigInteger root1, BigInteger root2, bool exists) {\n this.root1 = root1;\n this.root2 = root2;\n this.exists = exists;\n }\n\n public BigInteger Root1() {\n return root1;\n }\n\n public BigInteger Root2() {\n return root2;\n }\n\n public bool Exists() {\n return exists;\n }\n }\n\n class Program {\n static Solution Ts(BigInteger n, BigInteger p) {\n if (BigInteger.ModPow(n, (p - 1) / 2, p) != 1) {\n return new Solution(0, 0, false);\n }\n\n BigInteger q = p - 1;\n BigInteger ss = 0;\n while ((q & 1) == 0) {\n ss = ss + 1;\n q = q >> 1;\n }\n\n if (ss == 1) {\n BigInteger r1 = BigInteger.ModPow(n, (p + 1) / 4, p);\n return new Solution(r1, p - r1, true);\n }\n\n BigInteger z = 2;\n while (BigInteger.ModPow(z, (p - 1) / 2, p) != p - 1) {\n z = z + 1;\n }\n BigInteger c = BigInteger.ModPow(z, q, p);\n BigInteger r = BigInteger.ModPow(n, (q + 1) / 2, p);\n BigInteger t = BigInteger.ModPow(n, q, p);\n BigInteger m = ss;\n\n while (true) {\n if (t == 1) {\n return new Solution(r, p - r, true);\n }\n BigInteger i = 0;\n BigInteger zz = t;\n while (zz != 1 && i < (m - 1)) {\n zz = zz * zz % p;\n i = i + 1;\n }\n BigInteger b = c;\n BigInteger e = m - i - 1;\n while (e > 0) {\n b = b * b % p;\n e = e - 1;\n }\n r = r * b % p;\n c = b * b % p;\n t = t * c % p;\n m = i;\n }\n }\n\n static void Main(string[] args) {\n List<Tuple<long, long>> pairs = new List<Tuple<long, long>>() {\n new Tuple<long, long>(10, 13),\n new Tuple<long, long>(56, 101),\n new Tuple<long, long>(1030, 10009),\n new Tuple<long, long>(1032, 10009),\n new Tuple<long, long>(44402, 100049),\n new Tuple<long, long>(665820697, 1000000009),\n new Tuple<long, long>(881398088036, 1000000000039),\n };\n\n foreach (var pair in pairs) {\n Solution sol = Ts(pair.Item1, pair.Item2);\n Console.WriteLine(\"n = {0}\", pair.Item1);\n Console.WriteLine(\"p = {0}\", pair.Item2);\n if (sol.Exists()) {\n Console.WriteLine(\"root1 = {0}\", sol.Root1());\n Console.WriteLine(\"root2 = {0}\", sol.Root2());\n } else {\n Console.WriteLine(\"No solution exists\");\n }\n Console.WriteLine();\n }\n\n BigInteger bn = BigInteger.Parse(\"41660815127637347468140745042827704103445750172002\");\n BigInteger bp = BigInteger.Pow(10, 50) + 577;\n Solution bsol = Ts(bn, bp);\n Console.WriteLine(\"n = {0}\", bn);\n Console.WriteLine(\"p = {0}\", bp);\n if (bsol.Exists()) {\n Console.WriteLine(\"root1 = {0}\", bsol.Root1());\n Console.WriteLine(\"root2 = {0}\", bsol.Root2());\n } else {\n Console.WriteLine(\"No solution exists\");\n }\n }\n }\n}\n","language":"C-sharp"},{"code":"(defn find-first\n \" Finds first element of collection that satisifies predicate function pred \"\n [pred coll]\n (first (filter pred coll)))\n\n(defn modpow\n \" b^e mod m (using Java which solves some cases the pure clojure method has to be modified to tackle--i.e. with large b & e and\n calculation simplications when gcd(b, m) == 1 and gcd(e, m) == 1) \"\n [b e m]\n (.modPow (biginteger b) (biginteger e) (biginteger m)))\n\n(defn legendre [a p]\n (modpow a (quot (dec p) 2) p)\n)\n\n(defn tonelli [n p]\n \" Following Wikipedia https://en.wikipedia.org/wiki/Tonelli%E2%80%93Shanks_algorithm \"\n (assert (= (legendre n p) 1) \"not a square (mod p)\")\n (loop [q (dec p) ; Step 1 in Wikipedia\n s 0]\n (if (zero? (rem q 2))\n (recur (quot q 2) (inc s))\n (if (= s 1)\n (modpow n (quot (inc p) 4) p)\n (let [z (find-first #(= (dec p) (legendre % p)) (range 2 p))] ; Step 2 in Wikipedia\n (loop [\n M s\n c (modpow z q p)\n t (modpow n q p)\n R (modpow n (quot (inc q) 2) p)]\n (if (= t 1)\n R\n (let [i (long (find-first #(= 1 (modpow t (bit-shift-left 1 %) p)) (range 1 M))) ; Step 3\n b (modpow c (bit-shift-left 1 (- M i 1)) p)\n M i\n c (modpow b 2 p)\n t (rem (* t c) p)\n R (rem (* R b) p)]\n (recur M c t R)\n )\n )\n )\n )\n )\n )\n )\n )\n\n\n; Testing--using Python examples\n(doseq [[n p] [[10, 13], [56, 101], [1030, 10009], [44402, 100049],\n [665820697, 1000000009], [881398088036, 1000000000039],\n [41660815127637347468140745042827704103445750172002, 100000000000000000000000000000000000000000000000577]]\n :let [r (tonelli n p)]]\n (println (format \"n: %5d p: %d \\n\\troots: %5d %5d\" (biginteger n) (biginteger p) (biginteger r) (biginteger (- p r)))))\n","language":"Clojure"},{"code":"import std.bigint;\nimport std.stdio;\nimport std.typecons;\n\nalias Pair = Tuple!(long, \"n\", long, \"p\");\n\nenum BIGZERO = BigInt(\"0\");\nenum BIGONE = BigInt(\"1\");\nenum BIGTWO = BigInt(\"2\");\nenum BIGTEN = BigInt(\"10\");\n\nstruct Solution {\n BigInt root1, root2;\n bool exists;\n}\n\n/// https://en.wikipedia.org/wiki/Modular_exponentiation#Right-to-left_binary_method\nBigInt modPow(BigInt b, BigInt e, BigInt n) {\n if (n == 1) return BIGZERO;\n BigInt result = 1;\n b = b % n;\n while (e > 0) {\n if (e % 2 == 1) {\n result = (result * b) % n;\n }\n e >>= 1;\n b = (b*b) % n;\n }\n return result;\n}\n\nSolution ts(long n, long p) {\n return ts(BigInt(n), BigInt(p));\n}\n\nSolution ts(BigInt n, BigInt p) {\n auto powMod(BigInt a, BigInt e) {\n return a.modPow(e, p);\n }\n\n auto ls(BigInt a) {\n return powMod(a, (p-1)/2);\n }\n\n if (ls(n) != 1) return Solution(BIGZERO, BIGZERO, false);\n auto q = p - 1;\n auto ss = BIGZERO;\n while ((q & 1) == 0) {\n ss = ss + 1;\n q = q >> 1;\n }\n\n if (ss == BIGONE) {\n auto r1 = powMod(n, (p + 1) / 4);\n return Solution(r1, p - r1, true);\n }\n\n auto z = BIGTWO;\n while (ls(z) != p - 1) z = z + 1;\n auto c = powMod(z, q);\n auto r = powMod(n, (q + 1) / 2);\n auto t = powMod(n, q);\n auto m = ss;\n\n while (true) {\n if (t == 1) return Solution(r, p - r, true);\n auto i = BIGZERO;\n auto zz = t;\n while (zz != 1 && i < m - 1) {\n zz = zz * zz % p;\n i = i + 1;\n }\n auto b = c;\n auto e = m - i - 1;\n while (e > 0) {\n b = b * b % p;\n e = e - 1;\n }\n r = r * b % p;\n c = b * b % p;\n t = t * c % p;\n m = i;\n }\n}\n\nvoid main() {\n auto pairs = [\n Pair( 10L, 13L),\n Pair( 56L, 101L),\n Pair( 1_030L, 10_009L),\n Pair( 1_032L, 10_009L),\n Pair( 44_402L, 100_049L),\n Pair( 665_820_697L, 1_000_000_009L),\n Pair(881_398_088_036L, 1_000_000_000_039L),\n ];\n\n foreach (pair; pairs) {\n auto sol = ts(pair.n, pair.p);\n\n writeln(\"n = \", pair.n);\n writeln(\"p = \", pair.p);\n if (sol.exists) {\n writeln(\"root1 = \", sol.root1);\n writeln(\"root2 = \", sol.root2);\n }\n else writeln(\"No solution exists\");\n writeln();\n }\n\n auto bn = BigInt(\"41660815127637347468140745042827704103445750172002\");\n auto bp = BIGTEN ^^ 50 + 577L;\n auto sol = ts(bn, bp);\n writeln(\"n = \", bn);\n writeln(\"p = \", bp);\n if (sol.exists) {\n writeln(\"root1 = \", sol.root1);\n writeln(\"root2 = \", sol.root2);\n }\n else writeln(\"No solution exists\");\n}\n","language":"D"},{"code":"(require 'bigint)\n;; test equality mod p\n(define-syntax-rule (mod= a b p)\n\t (zero? (% (- a b) p)))\n;; assign mod p\n(define-syntax-rule (mod:≡ s v p)\n\t(set! s (% v p)))\n\n(define (Legendre a p)\n\t (powmod a (/ (1- p) 2) p))\n\n(define (Tonelli n p)\n (unless (= 1 (Legendre n p)) (error \"not a square (mod p)\" (list n p)))\n (define q (1- p))\n (define s 0)\n\t(while (even? q)\n\t\t(/= q 2)\n\t\t(++ s))\n\t(if (= s 1) (powmod n (/ (1+ p) 4) p)\n\t(begin\n\t(define z\n\t\t(for ((z (in-range 2 p)))\n\t\t #:break (= (1- p) (Legendre z p)) => z ))\n\n\t(define c (powmod z q p))\n\t(define r (powmod n (/ (1+ q) 2) p))\n\t(define t (powmod n q p))\n\t(define m s)\n\t(define t2 0)\n\t(while #t\n\t\t#:break (mod= 1 t p) => r\n\t\t(mod:≡ t2 (* t t) p)\n\t\t(define i\n\t\t\t(for ((i (in-range 1 m)))\n\t\t\t\t#:break (mod= t2 1 p) => i\n\t\t\t\t(mod:≡ t2 (* t2 t2) p)))\n\t\t(define b (powmod c (expt 2 (- m i 1)) p))\n\t\t(mod:≡ r (* r b) p)\n\t\t(mod:≡ c (* b b) p)\n\t\t(mod:≡ t (* t c) p)\n\t\t(set! m i)))))\n","language":"EchoLisp"},{"code":"' version 11-04-2017\n' compile with: fbc -s console\n' maximum for p is 17 digits to be on the save side\n\n' TRUE/FALSE are built-in constants since FreeBASIC 1.04\n' But we have to define them for older versions.\n#Ifndef TRUE\n #Define FALSE 0\n #Define TRUE Not FALSE\n#EndIf\n\nFunction mul_mod(a As ULongInt, b As ULongInt, modulus As ULongInt) As ULongInt\n ' returns a * b mod modulus\n Dim As ULongInt x, y = a Mod modulus\n\n While b > 0\n If (b And 1) = 1 Then\n x = (x + y) Mod modulus\n End If\n y = (y Shl 1) Mod modulus\n b = b Shr 1\n Wend\n\n Return x\n\nEnd Function\n\nFunction pow_mod(b As ULongInt, power As ULongInt, modulus As ULongInt) As ULongInt\n ' returns b ^ power mod modulus\n Dim As ULongInt x = 1\n\n While power > 0\n If (power And 1) = 1 Then\n ' x = (x * b) Mod modulus\n x = mul_mod(x, b, modulus)\n End If\n ' b = (b * b) Mod modulus\n b = mul_mod(b, b, modulus)\n power = power Shr 1\n Wend\n\n Return x\n\nEnd Function\n\nFunction Isprime(n As ULongInt, k As Long) As Long\n ' miller-rabin prime test\n If n > 9223372036854775808ull Then ' limit 2^63, pow_mod/mul_mod can't handle bigger numbers\n Print \"number is to big, program will end\"\n Sleep\n End\n End If\n\n ' 2 is a prime, if n is smaller then 2 or n is even then n = composite\n If n = 2 Then Return TRUE\n If (n < 2) OrElse ((n And 1) = 0) Then Return FALSE\n\n Dim As ULongInt a, x, n_one = n - 1, d = n_one\n Dim As UInteger s\n\n While (d And 1) = 0\n d = d Shr 1\n s = s + 1\n Wend\n\n While k > 0\n k = k - 1\n a = Int(Rnd * (n -2)) +2 ' 2 <= a < n\n x = pow_mod(a, d, n)\n If (x = 1) Or (x = n_one) Then Continue While\n For r As Integer = 1 To s -1\n x = pow_mod(x, 2, n)\n If x = 1 Then Return FALSE\n If x = n_one Then Continue While\n Next\n If x <> n_one Then Return FALSE\n Wend\n Return TRUE\n\nEnd Function\n\nFunction legendre_symbol (a As LongInt, p As LongInt) As LongInt\n\n Dim As LongInt x = pow_mod(a, ((p -1) \\ 2), p)\n If p -1 = x Then\n Return x - p\n Else\n Return x\n End If\n\nEnd Function\n\n' ------=< MAIN >=------\n\nDim As LongInt b, c, i, k, m, n, p, q, r, s, t, z\n\nFor k = 1 To 7\n Read n, p\n Print \"Find solution for n =\"; n; \" and p =\";p\n\n If legendre_symbol(n, p) <> 1 Then\n Print n;\" is not a quadratic residue\"\n Print\n Continue For\n End If\n\n If p = 2 OrElse Isprime(p, 15) = FALSE Then\n Print p;\" is not a odd prime\"\n Print\n Continue For\n End If\n\n s = 0 : q = p -1\n Do\n s += 1\n q \\= 2\n Loop Until (q And 1) = 1\n\n If s = 1 And (p Mod 4) = 3 Then\n r = pow_mod(n, ((p +1) \\ 4), p)\n Print \"Solution found:\"; r; \" and\"; p - r\n Print\n Continue For\n End If\n\n z = 1\n Do\n z += 1\n Loop Until legendre_symbol(z, p) = -1\n c = pow_mod(z, q, p)\n r = pow_mod(n, (q +1) \\ 2, p)\n t = pow_mod(n, q, p)\n m = s\n\n Do\n i = 0\n If (t Mod p) = 1 Then\n Print \"Solution found:\"; r; \" and\"; p - r\n Print\n Continue For\n End If\n\n Do\n i += 1\n If i >= m Then Continue For\n Loop Until pow_mod(t, 2 ^ i, p) = 1\n b = pow_mod(c, (2 ^ (m - i -1)), p)\n r = mul_mod(r, b, p)\n c = mul_mod(b, b, p)\n t = mul_mod(t, c, p)' t = t * b ^ 2\n m = i\n Loop\n\nNext\n\nData 10, 13, 56, 101, 1030, 10009, 1032, 10009, 44402, 100049\nData 665820697, 1000000009, 881398088036, 1000000000039\n\n' empty keyboard buffer\nWhile InKey <> \"\" : Wend\nPrint : Print \"hit any key to end program\"\nSleep\nEnd\n","language":"FreeBASIC"},{"code":"' version 12-04-2017\n' compile with: fbc -s console\n\n#Include Once \"gmp.bi\"\n\nData \"10\", \"13\", \"56\", \"101\", \"1030\", \"10009\", \"1032\", \"10009\"\nData \"44402\", \"100049\", \"665820697\", \"1000000009\"\nData \"881398088036\", \"1000000000039\"\nData \"41660815127637347468140745042827704103445750172002\" ' p = 10^50 + 577\n\n' ------=< MAIN >=------\n\nDim As uLong k\nDim As ZString Ptr zstr\nDim As String n_str, p_str\n\nDim As Mpz_ptr b, c, i, m, n, p, q, r, s, t, z, tmp\nb = Allocate(Len(__Mpz_struct)) : Mpz_init(b)\nc = Allocate(Len(__Mpz_struct)) : Mpz_init(c)\ni = Allocate(Len(__Mpz_struct)) : Mpz_init(i)\nm = Allocate(Len(__Mpz_struct)) : Mpz_init(m)\nn = Allocate(Len(__Mpz_struct)) : Mpz_init(n)\np = Allocate(Len(__Mpz_struct)) : Mpz_init(p)\nq = Allocate(Len(__Mpz_struct)) : Mpz_init(q)\nr = Allocate(Len(__Mpz_struct)) : Mpz_init(r)\ns = Allocate(Len(__Mpz_struct)) : Mpz_init(s)\nt = Allocate(Len(__Mpz_struct)) : Mpz_init(t)\nz = Allocate(Len(__Mpz_struct)) : Mpz_init(z)\ntmp = Allocate(Len(__Mpz_struct)) : Mpz_init(tmp)\n\nFor k = 1 To 8\n Read n_str\n Mpz_set_str(n, n_str, 10)\n If k < 8 Then\n Read p_str\n Mpz_set_str(p, p_str, 10)\n Else\n p_str = \"10^50 + 577\"\n Mpz_set_str(p, \"1\" + String(50, \"0\"), 10)\n Mpz_add_ui(p, p, 577)\n End If\n\n Print \"Find solution for n = \"; n_str; \" and p = \"; p_str\n\n If Mpz_legendre(n, p) <> 1 Then\n Print n_str; \" is not a quadratic residue\"\n Print\n Continue For\n End If\n\n If Mpz_tstbit(p, 0) = 0 OrElse Mpz_probab_prime_p(p, 20) = 0 Then\n Print p_str; \"is not a odd prime\"\n Print\n Continue For\n End If\n\n Mpz_set_ui(s, 0) : Mpz_set(q, p) : Mpz_sub_ui(q, q, 1) ' q = p -1\n Do\n Mpz_add_ui(s, s, 1)\n Mpz_fdiv_q_2exp(q, q, 1)\n Loop Until Mpz_tstbit(q, 0) = 1\n\n If Mpz_cmp_ui(s, 1) = 0 Then\n If Mpz_tstbit(p, 1) = 1 Then\n Mpz_add_ui(tmp, p, 1)\n Mpz_fdiv_q_2exp(tmp, tmp, 2) ' tmp = p +1 \\ 4\n Mpz_powm(r, n, tmp, p)\n zstr = Mpz_get_str(0, 10, r)\n Print \"Solution found: \"; *zstr;\n Mpz_sub(r, p, r)\n zstr = Mpz_get_str(0, 10, r)\n Print \" and \"; *zstr\n Print\n Continue For\n End If\n End If\n\n Mpz_set_ui(z, 1)\n Do\n Mpz_add_ui(z, z, 1)\n Loop Until Mpz_legendre(z, p) = -1\n Mpz_powm(c, z, q, p)\n Mpz_add_ui(tmp, q, 1)\n Mpz_fdiv_q_2exp(tmp, tmp, 1)\n Mpz_powm(r, n, tmp, p)\n Mpz_powm(t, n, q, p)\n Mpz_set(m, s)\n\n Do\n Mpz_set_ui(i, 0)\n Mpz_mod(tmp, t, p)\n If Mpz_cmp_ui(tmp, 1) = 0 Then\n zstr = Mpz_get_str(0, 10, r)\n Print \"Solution found: \"; *zstr;\n Mpz_sub(r, p, r)\n zstr = Mpz_get_str(0, 10, r)\n Print \" and \"; *zstr\n Print\n Continue For\n End If\n\n Mpz_set_ui(q, 1)\n Do\n Mpz_add_ui(i, i, 1)\n If Mpz_cmp(i, m) >= 0 Then\n Continue For\n end if\n Mpz_mul_ui(q, q, 2) ' q = 2^i\n Mpz_powm(tmp, t, q, p)\n Loop Until Mpz_cmp_ui(tmp, 1) = 0\n\n Mpz_set_ui(q, 2)\n Mpz_sub(tmp, m, i) : Mpz_sub_ui(tmp, tmp, 1) : Mpz_powm(tmp, q, tmp, p)\n Mpz_powm(b, c, tmp, p)\n Mpz_mul(r, r, b) : Mpz_mod(r, r, p)\n Mpz_mul(tmp, b, b) : Mpz_mod(c, tmp, p)\n Mpz_mul(tmp, t, c) : Mpz_mod(t, tmp, p)\n Mpz_set(m, i)\n Loop\n\nNext\n\nMpz_clear(b) : Mpz_clear(c) : Mpz_clear(i) : Mpz_clear(m)\nMpz_clear(n) : Mpz_clear(p) : Mpz_clear(q) : Mpz_clear(r)\nMpz_clear(s) : Mpz_clear(t) : Mpz_clear(z) : Mpz_clear(tmp)\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\n// Arguments n, p as described in WP\n// If Legendre symbol != 1, ok return is false. Otherwise ok return is true,\n// R1 is WP return value R and for convenience R2 is p-R1.\nfunc ts(n, p int) (R1, R2 int, ok bool) {\n // a^e mod p\n powModP := func(a, e int) int {\n s := 1\n for ; e > 0; e-- {\n s = s * a % p\n }\n return s\n }\n // Legendre symbol, returns 1, 0, or -1 mod p -- that's 1, 0, or p-1.\n ls := func(a int) int {\n return powModP(a, (p-1)/2)\n }\n // argument validation\n if ls(n) != 1 {\n return 0, 0, false\n }\n // WP step 1, factor out powers two.\n // variables Q, S named as at WP.\n Q := p - 1\n S := 0\n for Q&1 == 0 {\n S++\n Q >>= 1\n }\n // WP step 1, direct solution\n if S == 1 {\n R1 = powModP(n, (p+1)/4)\n return R1, p - R1, true\n }\n // WP step 2, select z, assign c\n z := 2\n for ; ls(z) != p-1; z++ {\n }\n c := powModP(z, Q)\n // WP step 3, assign R, t, M\n R := powModP(n, (Q+1)/2)\n t := powModP(n, Q)\n M := S\n // WP step 4, loop\n for {\n // WP step 4.1, termination condition\n if t == 1 {\n return R, p - R, true\n }\n // WP step 4.2, find lowest i...\n i := 0\n for z := t; z != 1 && i < M-1; {\n z = z * z % p\n i++\n }\n // WP step 4.3, using a variable b, assign new values of R, t, c, M\n b := c\n for e := M - i - 1; e > 0; e-- {\n b = b * b % p\n }\n R = R * b % p\n c = b * b % p // more convenient to compute c before t\n t = t * c % p\n M = i\n }\n}\n\nfunc main() {\n fmt.Println(ts(10, 13))\n fmt.Println(ts(56, 101))\n fmt.Println(ts(1030, 10009))\n fmt.Println(ts(1032, 10009))\n fmt.Println(ts(44402, 100049))\n}\n","language":"Go"},{"code":"package main\n\nimport (\n \"fmt\"\n \"math/big\"\n)\n\nfunc ts(n, p big.Int) (R1, R2 big.Int, ok bool) {\n if big.Jacobi(&n, &p) != 1 {\n return\n }\n var one, Q big.Int\n one.SetInt64(1)\n Q.Sub(&p, &one)\n S := 0\n for Q.Bit(0) == 0 {\n S++\n Q.Rsh(&Q, 1)\n }\n if S == 1 {\n R1.Exp(&n, R1.Rsh(R1.Add(&p, &one), 2), &p)\n R2.Sub(&p, &R1)\n return R1, R2, true\n }\n var z, c big.Int\n for z.SetInt64(2); big.Jacobi(&z, &p) != -1; z.Add(&z, &one) {\n }\n c.Exp(&z, &Q, &p)\n var R, t big.Int\n R.Exp(&n, R.Rsh(R.Add(&Q, &one), 1), &p)\n t.Exp(&n, &Q, &p)\n M := S\n for {\n if t.Cmp(&one) == 0 {\n R2.Sub(&p, &R)\n return R, R2, true\n }\n i := 0\n // reuse z as a scratch variable\n for z.Set(&t); z.Cmp(&one) != 0 && i < M-1; {\n z.Mod(z.Mul(&z, &z), &p)\n i++\n }\n // and instead of a new scratch variable b, continue using z\n z.Set(&c)\n for e := M - i - 1; e > 0; e-- {\n z.Mod(z.Mul(&z, &z), &p)\n }\n R.Mod(R.Mul(&R, &z), &p)\n c.Mod(c.Mul(&z, &z), &p)\n t.Mod(t.Mul(&t, &c), &p)\n M = i\n }\n}\n\nfunc main() {\n var n, p big.Int\n n.SetInt64(665820697)\n p.SetInt64(1000000009)\n R1, R2, ok := ts(n, p)\n fmt.Println(&R1, &R2, ok)\n\n n.SetInt64(881398088036)\n p.SetInt64(1000000000039)\n R1, R2, ok = ts(n, p)\n fmt.Println(&R1, &R2, ok)\n n.SetString(\"41660815127637347468140745042827704103445750172002\", 10)\n p.SetString(\"100000000000000000000000000000000000000000000000577\", 10)\n R1, R2, ok = ts(n, p)\n fmt.Println(&R1)\n fmt.Println(&R2)\n}\n","language":"Go"},{"code":"package main\n\nimport (\n \"fmt\"\n \"math/big\"\n)\n\nfunc main() {\n var n, p, R1, R2 big.Int\n n.SetInt64(665820697)\n p.SetInt64(1000000009)\n R1.ModSqrt(&n, &p)\n R2.Sub(&p, &R1)\n fmt.Println(&R1, &R2)\n\n n.SetInt64(881398088036)\n p.SetInt64(1000000000039)\n R1.ModSqrt(&n, &p)\n R2.Sub(&p, &R1)\n fmt.Println(&R1, &R2)\n\n n.SetString(\"41660815127637347468140745042827704103445750172002\", 10)\n p.SetString(\"100000000000000000000000000000000000000000000000577\", 10)\n R1.ModSqrt(&n, &p)\n R2.Sub(&p, &R1)\n fmt.Println(&R1)\n fmt.Println(&R2)\n}\n","language":"Go"},{"code":"import Data.List (genericTake, genericLength)\nimport Data.Bits (shiftR)\n\npowMod :: Integer -> Integer -> Integer -> Integer\npowMod m b e = go b e 1\n where\n go b e r\n | e == 0 = r\n | odd e = go ((b*b) `mod` m) (e `div` 2) ((r*b) `mod` m)\n | even e = go ((b*b) `mod` m) (e `div` 2) r\n\nlegendre :: Integer -> Integer -> Integer\nlegendre a p = powMod p a ((p - 1) `div` 2)\n\ntonelli :: Integer -> Integer -> Maybe (Integer, Integer)\ntonelli n p | legendre n p /= 1 = Nothing\ntonelli n p =\n let s = length $ takeWhile even $ iterate (`div` 2) (p-1)\n q = shiftR (p-1) s\n in if s == 1\n then let r = powMod p n ((p+1) `div` 4)\n in Just (r, p - r)\n else let z = (2 +) . genericLength\n $ takeWhile (\\i -> p - 1 /= legendre i p)\n $ [2..p-1]\n in loop s\n ( powMod p z q )\n ( powMod p n $ (q+1) `div` 2 )\n ( powMod p n q )\n where\n loop m c r t\n | (t - 1) `mod` p == 0 = Just (r, p - r)\n | otherwise =\n let i = (1 +) . genericLength . genericTake (m - 2)\n $ takeWhile (\\t2 -> (t2 - 1) `mod` p /= 0)\n $ iterate (\\t2 -> (t2*t2) `mod` p)\n $ (t*t) `mod` p\n b = powMod p c (2^(m - i - 1))\n r' = (r*b) `mod` p\n c' = (b*b) `mod` p\n t' = (t*c') `mod` p\n in loop i c' r' t'\n","language":"Haskell"},{"code":"leg=: dyad define\n x (y&|)@^ (y-1)%2\n)\n\ntosh=:dyad define\n assert. 1=1 p: y [ 'y must be prime'\n assert. 1=x leg y [ 'x must be square mod y'\n pow=. y&|@^\n if. 1=m=. {.1 q: y-1 do.\n r=. x pow (y+1)%4\n else.\n z=. 1x while. 1>: z leg y do. z=.z+1 end.\n c=. z pow q=. (y-1)%2^m\n r=. x pow (q+1)%2\n t=. x pow q\n while. t~:1 do.\n n=. t\n i=. 0\n whilst. 1~:n do.\n n=. n pow 2\n i=. i+1\n end.\n r=. y|r*b=. c pow 2^m-i+1\n m=. i\n t=. y|t*c=. b pow 2\n end.\n end.\n y|(,-)r\n)\n","language":"J"},{"code":" 10 tosh 13\n7 6\n 56 tosh 101\n37 64\n 1030 tosh 10009\n1632 8377\n 1032 tosh 10009\n|assertion failure: tosh\n| 1=x leg y['x must be square mod y'\n 44402 tosh 100049\n30468 69581\n 665820697x tosh 1000000009x\n378633312 621366697\n 881398088036 tosh 1000000000039x\n791399408049 208600591990\n 41660815127637347468140745042827704103445750172002x tosh (10^50x)+577\n32102985369940620849741983987300038903725266634508 67897014630059379150258016012699961096274733366069\n","language":"J"},{"code":"import java.math.BigInteger;\nimport java.util.List;\nimport java.util.Map;\nimport java.util.function.BiFunction;\nimport java.util.function.Function;\n\npublic class TonelliShanks {\n private static final BigInteger ZERO = BigInteger.ZERO;\n private static final BigInteger ONE = BigInteger.ONE;\n private static final BigInteger TEN = BigInteger.TEN;\n private static final BigInteger TWO = BigInteger.valueOf(2);\n private static final BigInteger FOUR = BigInteger.valueOf(4);\n\n private static class Solution {\n private BigInteger root1;\n private BigInteger root2;\n private boolean exists;\n\n Solution(BigInteger root1, BigInteger root2, boolean exists) {\n this.root1 = root1;\n this.root2 = root2;\n this.exists = exists;\n }\n }\n\n private static Solution ts(Long n, Long p) {\n return ts(BigInteger.valueOf(n), BigInteger.valueOf(p));\n }\n\n private static Solution ts(BigInteger n, BigInteger p) {\n BiFunction<BigInteger, BigInteger, BigInteger> powModP = (BigInteger a, BigInteger e) -> a.modPow(e, p);\n Function<BigInteger, BigInteger> ls = (BigInteger a) -> powModP.apply(a, p.subtract(ONE).divide(TWO));\n\n if (!ls.apply(n).equals(ONE)) return new Solution(ZERO, ZERO, false);\n\n BigInteger q = p.subtract(ONE);\n BigInteger ss = ZERO;\n while (q.and(ONE).equals(ZERO)) {\n ss = ss.add(ONE);\n q = q.shiftRight(1);\n }\n\n if (ss.equals(ONE)) {\n BigInteger r1 = powModP.apply(n, p.add(ONE).divide(FOUR));\n return new Solution(r1, p.subtract(r1), true);\n }\n\n BigInteger z = TWO;\n while (!ls.apply(z).equals(p.subtract(ONE))) z = z.add(ONE);\n BigInteger c = powModP.apply(z, q);\n BigInteger r = powModP.apply(n, q.add(ONE).divide(TWO));\n BigInteger t = powModP.apply(n, q);\n BigInteger m = ss;\n\n while (true) {\n if (t.equals(ONE)) return new Solution(r, p.subtract(r), true);\n BigInteger i = ZERO;\n BigInteger zz = t;\n while (!zz.equals(BigInteger.ONE) && i.compareTo(m.subtract(ONE)) < 0) {\n zz = zz.multiply(zz).mod(p);\n i = i.add(ONE);\n }\n BigInteger b = c;\n BigInteger e = m.subtract(i).subtract(ONE);\n while (e.compareTo(ZERO) > 0) {\n b = b.multiply(b).mod(p);\n e = e.subtract(ONE);\n }\n r = r.multiply(b).mod(p);\n c = b.multiply(b).mod(p);\n t = t.multiply(c).mod(p);\n m = i;\n }\n }\n\n public static void main(String[] args) {\n List<Map.Entry<Long, Long>> pairs = List.of(\n Map.entry(10L, 13L),\n Map.entry(56L, 101L),\n Map.entry(1030L, 10009L),\n Map.entry(1032L, 10009L),\n Map.entry(44402L, 100049L),\n Map.entry(665820697L, 1000000009L),\n Map.entry(881398088036L, 1000000000039L)\n );\n\n for (Map.Entry<Long, Long> pair : pairs) {\n Solution sol = ts(pair.getKey(), pair.getValue());\n System.out.printf(\"n = %s\\n\", pair.getKey());\n System.out.printf(\"p = %s\\n\", pair.getValue());\n if (sol.exists) {\n System.out.printf(\"root1 = %s\\n\", sol.root1);\n System.out.printf(\"root2 = %s\\n\", sol.root2);\n } else {\n System.out.println(\"No solution exists\");\n }\n System.out.println();\n }\n\n BigInteger bn = new BigInteger(\"41660815127637347468140745042827704103445750172002\");\n BigInteger bp = TEN.pow(50).add(BigInteger.valueOf(577));\n Solution sol = ts(bn, bp);\n System.out.printf(\"n = %s\\n\", bn);\n System.out.printf(\"p = %s\\n\", bp);\n if (sol.exists) {\n System.out.printf(\"root1 = %s\\n\", sol.root1);\n System.out.printf(\"root2 = %s\\n\", sol.root2);\n } else {\n System.out.println(\"No solution exists\");\n }\n }\n}\n","language":"Java"},{"code":"include \"rc-modular-exponentiation\"; # see remark above\n\n# 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):\n . as $i\n | ($i % $j) as $mod\n | ($i - $mod) / $j ;\n\ndef Solution(a;b;c):\n {\"root1\": a, \"root2\": b, \"exists\": c};\n\n# pretty print a Solution\ndef pp:\n if .exists\n then \"root1 = \\(.root1)\",\n \"root2 = \\(.root2)\"\n else \"No solution exists\"\n end;\n\n# Tonelli-Shanks\ndef ts($n; $p):\n def powModP($a; $e): $a | modPow($e; $p);\n\n def ls($a): powModP($a; ($p - 1) | idivide(2));\n\n if ls($n) != 1 then Solution(0; 0; false)\n else { q: ($p - 1), ss: 0}\n | until (.q % 2 != 0;\n .ss += 1\n | .q |= idivide(2) )\n | if .ss == 1\n then powModP(n; ($p+1) | idivide(4)) as $r1\n | Solution($r1; $p - $r1; true)\n else .z = 2\n | until ( ls(.z) == ($p - 1); .z += 1 )\n | .c = powModP(.z; .q)\n | .r = powModP($n; (.q+1) | idivide(2))\n | .t = powModP($n; .q)\n | .m = .ss\n | until (.emit;\n if .t == 1 then .emit = Solution(.r; $p - .r; true)\n else .i = 0\n | .zz = .t\n | until (.zz == 1 or .i >= (.m - 1);\n .zz = (.zz * .zz) % p\n | .i += 1 )\n | .b = .c\n | .e = .m - (1 + .i)\n | until (.e <= 0;\n .b = (.b * .b) % $p\n | .e += -1 )\n | .r = (.r * .b) % $p\n | .c = (.b * .b) % $p\n | .t = (.t * .c) % $p\n | .m = .i\n\t end )\n | .emit\n end\n end;\n\ndef pairs: [\n [10, 13], [56, 101], [1030, 10009], [1032, 10009], [44402, 100049],\n [665820697, 1000000009], [881398088036, 1000000000039]\n];\n\ndef task:\n pairs[] as [$n, $p]\n | ts($n; $p) as $sol\n | \"n = \\($n)\",\n \"p = \\($p)\",\n ($sol | pp),\n \"\";\n\ndef task2:\n def bn: 41660815127637347468140745042827704103445750172002;\n def bp: (10 | power(50)) + 577;\n ts(bn; bp) as $bsol\n | \"n = \\(bn)\",\n \"p = \\(bp)\",\n ( $bsol | pp );\n\ntask, task2\n","language":"Jq"},{"code":"module TonelliShanks\n\nlegendre(a, p) = powermod(a, (p - 1) ÷ 2, p)\n\nfunction solve(n::T, p::T) where T <: Union{Int, Int128, BigInt}\n legendre(n, p) != 1 && throw(ArgumentError(\"$n not a square (mod $p)\"))\n local q::T = p - one(p)\n local s::T = 0\n while iszero(q % 2)\n q ÷= 2\n s += one(s)\n end\n if s == one(s)\n r = powermod(n, (p + 1) >> 2, p)\n return r, p - r\n end\n local z::T\n for z in 2:(p - 1)\n p - 1 == legendre(z, p) && break\n end\n local c::T = powermod(z, q, p)\n local r::T = powermod(n, (q + 1) >> 1, p)\n local t::T = powermod(n, q, p)\n local m::T = s\n local t2::T = zero(p)\n while !iszero((t - 1) % p)\n t2 = (t * t) % p\n local i::T\n for i in Base.OneTo(m)\n iszero((t2 - 1) % p) && break\n t2 = (t2 * t2) % p\n end\n b = powermod(c, 1 << (m - i - 1), p)\n r = (r * b) % p\n c = (b * b) % p\n t = (t * c) % p\n m = i\n end\n return r, p - r\nend\n\nend # module TonelliShanks\n","language":"Julia"},{"code":"@show TonelliShanks.solve(10, 13)\n@show TonelliShanks.solve(56, 101)\n@show TonelliShanks.solve(1030, 10009)\n@show TonelliShanks.solve(44402, 100049)\n@show TonelliShanks.solve(665820697, 1000000009)\n@show TonelliShanks.solve(881398088036, 1000000000039)\n@show TonelliShanks.solve(41660815127637347468140745042827704103445750172002, big\"10\" ^ 50 + 577)\n","language":"Julia"},{"code":"// version 1.1.3\n\nimport java.math.BigInteger\n\ndata class Solution(val root1: BigInteger, val root2: BigInteger, val exists: Boolean)\n\nval bigZero = BigInteger.ZERO\nval bigOne = BigInteger.ONE\nval bigTwo = BigInteger.valueOf(2L)\nval bigFour = BigInteger.valueOf(4L)\nval bigTen = BigInteger.TEN\n\nfun ts(n: Long, p: Long) = ts(BigInteger.valueOf(n), BigInteger.valueOf(p))\n\nfun ts(n: BigInteger, p: BigInteger): Solution {\n\n fun powModP(a: BigInteger, e: BigInteger) = a.modPow(e, p)\n\n fun ls(a: BigInteger) = powModP(a, (p - bigOne) / bigTwo)\n\n if (ls(n) != bigOne) return Solution(bigZero, bigZero, false)\n var q = p - bigOne\n var ss = bigZero\n while (q.and(bigOne) == bigZero) {\n ss = ss + bigOne\n q = q.shiftRight(1)\n }\n\n if (ss == bigOne) {\n val r1 = powModP(n, (p + bigOne) / bigFour)\n return Solution(r1, p - r1, true)\n }\n\n var z = bigTwo\n while (ls(z) != p - bigOne) z = z + bigOne\n var c = powModP(z, q)\n var r = powModP(n, (q + bigOne) / bigTwo)\n var t = powModP(n, q)\n var m = ss\n\n while (true) {\n if (t == bigOne) return Solution(r, p - r, true)\n var i = bigZero\n var zz = t\n while (zz != bigOne && i < m - bigOne) {\n zz = zz * zz % p\n i = i + bigOne\n }\n var b = c\n var e = m - i - bigOne\n while (e > bigZero) {\n b = b * b % p\n e = e - bigOne\n }\n r = r * b % p\n c = b * b % p\n t = t * c % p\n m = i\n }\n}\n\nfun main(args: Array<String>) {\n val pairs = listOf<Pair<Long, Long>>(\n 10L to 13L,\n 56L to 101L,\n 1030L to 10009L,\n 1032L to 10009L,\n 44402L to 100049L,\n 665820697L to 1000000009L,\n 881398088036L to 1000000000039L\n )\n\n for (pair in pairs) {\n val (n, p) = pair\n val (root1, root2, exists) = ts(n, p)\n println(\"n = $n\")\n println(\"p = $p\")\n if (exists) {\n println(\"root1 = $root1\")\n println(\"root2 = $root2\")\n }\n else println(\"No solution exists\")\n println()\n }\n\n val bn = BigInteger(\"41660815127637347468140745042827704103445750172002\")\n val bp = bigTen.pow(50) + BigInteger.valueOf(577L)\n val (broot1, broot2, bexists) = ts(bn, bp)\n println(\"n = $bn\")\n println(\"p = $bp\")\n if (bexists) {\n println(\"root1 = $broot1\")\n println(\"root2 = $broot2\")\n }\n else println(\"No solution exists\")\n}\n","language":"Kotlin"},{"code":"proc pow*[T: SomeInteger](x, n, p: T): T =\n var t = x mod p\n var e = n\n result = 1\n while e > 0:\n if (e and 1) == 1:\n result = result * t mod p\n t = t * t mod p\n e = e shr 1\n\nproc legendre*[T: SomeInteger](a, p: T): T = pow(a, (p-1) shr 1, p)\n\nproc tonelliShanks*[T: SomeInteger](n, p: T): T =\n # Check that n is indeed a square.\n if legendre(n, p) != 1:\n raise newException(ValueError, \"Not a square\")\n\n # Factor out power of 2 from p-1.\n var q = p - 1\n var s = 0\n while (q and 1) == 0:\n s += 1\n q = q shr 1\n\n if s == 1:\n return pow(n, (p+1) shr 2, p)\n\n # Select a non-square z such as (z | p) = -1.\n var z = 2\n while legendre(z, p) != p - 1:\n z += 1\n\n var\n c = pow(z, q, p)\n t = pow(n, q, p)\n m = s\n result = pow(n, (q+1) shr 1, p)\n while t != 1:\n var\n i = 1\n z = t * t mod p\n while z != 1 and i < m-1:\n i += 1\n z = z * z mod p\n\n var b = pow(c, 1 shl (m-i-1), p)\n c = b * b mod p\n t = t * c mod p\n m = i\n result = result * b mod p\n\nwhen isMainModule:\n proc run(n, p: SomeInteger) =\n try:\n let r = tonelliShanks(n, p)\n echo r, \" \", p-r\n except ValueError:\n echo getCurrentExceptionMsg()\n\n run(10, 13)\n run(56, 101)\n run(1030, 10009)\n run(1032, 10009)\n run(44402, 100049)\n run(665820697, 1000000009)\n","language":"Nim"},{"code":"let tonelli n p =\n let open Z in\n let two = ~$2 in\n let pp = pred p in\n let pph = pred p / two in\n let pow_mod_p a e = powm a e p in\n let legendre_p a = pow_mod_p a pph in\n\n if legendre_p n <> one then None\n else\n let s = trailing_zeros pp in\n if s = 1 then\n let r = pow_mod_p n (succ p / ~$4) in\n Some (r, p - r)\n else\n let q = pp asr s in\n let z =\n let rec find_non_square z =\n if legendre_p z = pp then z else find_non_square (succ z)\n in\n find_non_square two\n in\n let rec loop c r t m =\n if t = one then (r, p - r)\n else\n let mp = pred m in\n let rec find_i n i =\n if n = one || i >= mp then i else find_i (n * n mod p) (succ i)\n in\n let rec exp_pow2 b e =\n if e <= zero then b else exp_pow2 (b * b mod p) (pred e)\n in\n let i = find_i t zero in\n let b = exp_pow2 c (mp - i) in\n let c = b * b mod p in\n loop c (r * b mod p) (t * c mod p) i\n in\n Some\n (loop (pow_mod_p z q) (pow_mod_p n (succ q / two)) (pow_mod_p n q) ~$s)\n\nlet () =\n let open Z in\n [\n (~$9, ~$11);\n (~$10, ~$13);\n (~$56, ~$101);\n (~$1030, ~$10009);\n (~$1032, ~$10009);\n (~$44402, ~$100049);\n (~$665820697, ~$1000000009);\n (~$881398088036, ~$1000000000039);\n ( of_string \"41660815127637347468140745042827704103445750172002\",\n pow ~$10 50 + ~$577 );\n ]\n |> List.iter (fun (n, p) ->\n Printf.printf \"n = %s\\np = %s\\n%!\" (to_string n) (to_string p);\n match tonelli n p with\n | Some (r1, r2) ->\n Printf.printf \"root1 = %s\\nroot2 = %s\\n\\n%!\" (to_string r1)\n (to_string r2)\n | None -> print_endline \"No solution exists\\n\")\n","language":"OCaml"},{"code":"use bigint;\nuse ntheory qw(is_prime powmod kronecker);\n\nsub tonelli_shanks {\n my($n,$p) = @_;\n return if kronecker($n,$p) <= 0;\n my $Q = $p - 1;\n my $S = 0;\n $Q >>= 1 and $S++ while 0 == $Q%2;\n return powmod($n,int(($p+1)/4), $p) if $S == 1;\n\n my $c;\n for $n (2..$p) {\n next if kronecker($n,$p) >= 0;\n $c = powmod($n, $Q, $p);\n last;\n }\n\n my $R = powmod($n, ($Q+1) >> 1, $p ); # ?\n my $t = powmod($n, $Q, $p );\n while (($t-1) % $p) {\n my $b;\n my $t2 = $t**2 % $p;\n for (1 .. $S) {\n if (0 == ($t2-1)%$p) {\n $b = powmod($c, 1 << ($S-1-$_), $p);\n $S = $_;\n last;\n }\n $t2 = $t2**2 % $p;\n }\n $R = ($R * $b) % $p;\n $c = $b**2 % $p;\n $t = ($t * $c) % $p;\n }\n $R;\n}\n\nmy @tests = (\n (10, 13),\n (56, 101),\n (1030, 10009),\n (1032, 10009),\n (44402, 100049),\n (665820697, 1000000009),\n (881398088036, 1000000000039),\n);\n\nwhile (@tests) {\n $n = shift @tests;\n $p = shift @tests;\n my $t = tonelli_shanks($n, $p);\n if (!$t or ($t**2 - $n) % $p) {\n printf \"No solution for (%d, %d)\\n\", $n, $p;\n } else {\n printf \"Roots of %d are (%d, %d) mod %d\\n\", $n, $t, $p-$t, $p;\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;\">include</span> <span style=\"color: #004080;\">mpfr</span><span style=\"color: #0000FF;\">.</span><span style=\"color: #000000;\">e</span>\n\n <span style=\"color: #008080;\">function</span> <span style=\"color: #000000;\">ts</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #004080;\">string</span> <span style=\"color: #000000;\">ns</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">ps</span><span style=\"color: #0000FF;\">)</span>\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: #000000;\">ns</span><span style=\"color: #0000FF;\">),</span>\n <span style=\"color: #000000;\">p</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">mpz_init</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">ps</span><span style=\"color: #0000FF;\">),</span>\n <span style=\"color: #000000;\">t</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">mpz_init</span><span style=\"color: #0000FF;\">(),</span>\n <span style=\"color: #000000;\">r</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">mpz_init</span><span style=\"color: #0000FF;\">(),</span>\n <span style=\"color: #000000;\">pm1</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">mpz_init</span><span style=\"color: #0000FF;\">(),</span>\n <span style=\"color: #000000;\">pm2</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">mpz_init</span><span style=\"color: #0000FF;\">()</span>\n <span style=\"color: #7060A8;\">mpz_sub_ui</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">pm1</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">p</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">)</span> <span style=\"color: #000080;font-style:italic;\">-- pm1 = p-1</span>\n <span style=\"color: #7060A8;\">mpz_fdiv_q_2exp</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">pm2</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">pm1</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">)</span> <span style=\"color: #000080;font-style:italic;\">-- pm2 = pm1/2</span>\n <span style=\"color: #7060A8;\">mpz_powm</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><span style=\"color: #000000;\">pm2</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">p</span><span style=\"color: #0000FF;\">)</span> <span style=\"color: #000080;font-style:italic;\">-- t = mod(n^pm2,p)</span>\n <span style=\"color: #008080;\">if</span> <span style=\"color: #7060A8;\">mpz_cmp_si</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;\">0</span> <span style=\"color: #008080;\">then</span>\n <span style=\"color: #008080;\">return</span> <span style=\"color: #008000;\">\"No solution exists\"</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">if</span>\n <span style=\"color: #004080;\">mpz</span> <span style=\"color: #000000;\">q</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">mpz_init_set</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">pm1</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #004080;\">integer</span> <span style=\"color: #000000;\">ss</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">0</span>\n <span style=\"color: #008080;\">while</span> <span style=\"color: #7060A8;\">mpz_even</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">q</span><span style=\"color: #0000FF;\">)</span> <span style=\"color: #008080;\">do</span>\n <span style=\"color: #000000;\">ss</span> <span style=\"color: #0000FF;\">+=</span> <span style=\"color: #000000;\">1</span>\n <span style=\"color: #7060A8;\">mpz_fdiv_q_2exp</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">q</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">q</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">)</span> <span style=\"color: #000080;font-style:italic;\">-- q/=2</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;\">ss</span><span style=\"color: #0000FF;\">=</span><span style=\"color: #000000;\">1</span> <span style=\"color: #008080;\">then</span>\n <span style=\"color: #7060A8;\">mpz_add_ui</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">t</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">p</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #7060A8;\">mpz_fdiv_q_2exp</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;\">2</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #7060A8;\">mpz_powm</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">r</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">n</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">t</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">p</span><span style=\"color: #0000FF;\">)</span> <span style=\"color: #000080;font-style:italic;\">-- r = mod(n^((p+1)/4),p)</span>\n <span style=\"color: #008080;\">else</span>\n <span style=\"color: #004080;\">mpz</span> <span style=\"color: #000000;\">z</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">mpz_init</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">2</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: #7060A8;\">mpz_powm</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">t</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">z</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">pm2</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">p</span><span style=\"color: #0000FF;\">)</span> <span style=\"color: #000080;font-style:italic;\">-- t = mod(z^pm2,p)</span>\n <span style=\"color: #008080;\">if</span> <span style=\"color: #7060A8;\">mpz_cmp</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">t</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">pm1</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: #7060A8;\">mpz_add_ui</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">z</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">z</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">)</span> <span style=\"color: #000080;font-style:italic;\">-- z+= 1</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">while</span>\n <span style=\"color: #004080;\">mpz</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: #000000;\">zz</span><span style=\"color: #0000FF;\">}</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">mpz_inits</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">3</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #7060A8;\">mpz_powm</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: #000000;\">q</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">p</span><span style=\"color: #0000FF;\">)</span> <span style=\"color: #000080;font-style:italic;\">-- c = mod(z^q,p)</span>\n <span style=\"color: #7060A8;\">mpz_add_ui</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">t</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">q</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #7060A8;\">mpz_fdiv_q_2exp</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;\">1</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #7060A8;\">mpz_powm</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">r</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">n</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">t</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">p</span><span style=\"color: #0000FF;\">)</span> <span style=\"color: #000080;font-style:italic;\">-- r = mod(n^((q+1)/2),p)</span>\n <span style=\"color: #7060A8;\">mpz_powm</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><span style=\"color: #000000;\">q</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">p</span><span style=\"color: #0000FF;\">)</span> <span style=\"color: #000080;font-style:italic;\">-- t = mod(n^q,p)</span>\n <span style=\"color: #004080;\">integer</span> <span style=\"color: #000000;\">m</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">ss</span>\n <span style=\"color: #008080;\">while</span> <span style=\"color: #7060A8;\">mpz_cmp_si</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: #008080;\">do</span> <span style=\"color: #000080;font-style:italic;\">-- t!=1</span>\n <span style=\"color: #004080;\">integer</span> <span style=\"color: #000000;\">i</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">0</span>\n <span style=\"color: #7060A8;\">mpz_set</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">zz</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">t</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #008080;\">while</span> <span style=\"color: #7060A8;\">mpz_cmp_si</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">zz</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: #008080;\">and</span> <span style=\"color: #000000;\">i</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: #008080;\">do</span>\n <span style=\"color: #7060A8;\">mpz_powm_ui</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">zz</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">zz</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">2</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">p</span><span style=\"color: #0000FF;\">)</span> <span style=\"color: #000080;font-style:italic;\">-- zz = mod(zz^2,p)</span>\n <span style=\"color: #000000;\">i</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;\">mpz_set</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>\n <span style=\"color: #004080;\">integer</span> <span style=\"color: #000000;\">e</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">m</span><span style=\"color: #0000FF;\">-</span><span style=\"color: #000000;\">i</span><span style=\"color: #0000FF;\">-</span><span style=\"color: #000000;\">1</span>\n <span style=\"color: #008080;\">while</span> <span style=\"color: #000000;\">e</span><span style=\"color: #0000FF;\">></span><span style=\"color: #000000;\">0</span> <span style=\"color: #008080;\">do</span>\n <span style=\"color: #7060A8;\">mpz_powm_ui</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><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">p</span><span style=\"color: #0000FF;\">)</span> <span style=\"color: #000080;font-style:italic;\">-- b = mod(b^2,p)</span>\n <span style=\"color: #000000;\">e</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;\">mpz_mul</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">r</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">r</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">b</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #7060A8;\">mpz_mod</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">r</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">r</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">p</span><span style=\"color: #0000FF;\">)</span> <span style=\"color: #000080;font-style:italic;\">-- r = mod(r*b,p)</span>\n <span style=\"color: #7060A8;\">mpz_powm_ui</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;\">2</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">p</span><span style=\"color: #0000FF;\">)</span> <span style=\"color: #000080;font-style:italic;\">-- c = mod(b^2,p)</span>\n <span style=\"color: #7060A8;\">mpz_mul</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;\">c</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #7060A8;\">mpz_mod</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;\">p</span><span style=\"color: #0000FF;\">)</span> <span style=\"color: #000080;font-style:italic;\">-- t = mod(t*c,p)</span>\n <span style=\"color: #000000;\">m</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">i</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: #7060A8;\">mpz_sub</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">p</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">p</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">r</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #008080;\">return</span> <span style=\"color: #7060A8;\">mpz_get_str</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">r</span><span style=\"color: #0000FF;\">)&</span><span style=\"color: #008000;\">\" and \"</span><span style=\"color: #0000FF;\">&</span><span style=\"color: #7060A8;\">mpz_get_str</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">p</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;\">tests</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #0000FF;\">{{</span><span style=\"color: #008000;\">\"10\"</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #008000;\">\"13\"</span><span style=\"color: #0000FF;\">},</span>\n <span style=\"color: #0000FF;\">{</span><span style=\"color: #008000;\">\"56\"</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #008000;\">\"101\"</span><span style=\"color: #0000FF;\">},</span>\n <span style=\"color: #0000FF;\">{</span><span style=\"color: #008000;\">\"1030\"</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #008000;\">\"10009\"</span><span style=\"color: #0000FF;\">},</span>\n <span style=\"color: #0000FF;\">{</span><span style=\"color: #008000;\">\"1032\"</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #008000;\">\"10009\"</span><span style=\"color: #0000FF;\">},</span>\n <span style=\"color: #0000FF;\">{</span><span style=\"color: #008000;\">\"44402\"</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #008000;\">\"100049\"</span><span style=\"color: #0000FF;\">},</span>\n <span style=\"color: #0000FF;\">{</span><span style=\"color: #008000;\">\"665820697\"</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #008000;\">\"1000000009\"</span><span style=\"color: #0000FF;\">},</span>\n <span style=\"color: #0000FF;\">{</span><span style=\"color: #008000;\">\"881398088036\"</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #008000;\">\"1000000000039\"</span><span style=\"color: #0000FF;\">},</span>\n <span style=\"color: #0000FF;\">{</span><span style=\"color: #008000;\">\"41660815127637347468140745042827704103445750172002\"</span><span style=\"color: #0000FF;\">,</span>\n <span style=\"color: #7060A8;\">sprintf</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #008000;\">\"1%s577\"</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #7060A8;\">repeat</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #008000;\">'0'</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">47</span><span style=\"color: #0000FF;\">))}}</span> <span style=\"color: #000080;font-style:italic;\">-- 10^50+577</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: #004080;\">string</span> <span style=\"color: #0000FF;\">{</span><span style=\"color: #000000;\">p1</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">p2</span><span style=\"color: #0000FF;\">}</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: #7060A8;\">printf</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #008000;\">\"For n = %s and p = %s, %s\\n\"</span><span style=\"color: #0000FF;\">,{</span><span style=\"color: #000000;\">p1</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">p2</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">ts</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">p1</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">p2</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 @lib/rsa.l\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(de legendre (N P)\n (**Mod N (/ (dec P) 2) P) )\n(de ts (N P)\n (and\n (=1 (legendre N P))\n (let\n (Q (dec P)\n S 0\n Z 0\n C 0\n R 0\n D 0\n M 0\n B 0\n I 0 )\n (until (bit? 1 Q)\n (setq Q (>> 1 Q))\n (inc 'S) )\n (if (=1 S)\n (list\n (setq @@ (**Mod N (/ (inc P) 4) P))\n (- P @@) )\n (setq Z 2)\n (until (= (legendre Z P) (dec P))\n (inc 'Z) )\n (setq\n C (**Mod Z Q P)\n R (**Mod N (/ (inc Q) 2) P)\n D (**Mod N Q P)\n M S )\n (until (=1 D)\n (zero I)\n (for\n (Z\n D\n (and (<> Z 1) (< I (dec M)))\n (setq Z (% (* Z Z) P)) )\n (inc 'I) )\n (setq B C)\n (for\n (Z\n (- M I 1)\n (> Z 0) (dec Z) )\n (setq B (% (* B B) P)) )\n (setq\n R (% (* R B) P)\n C (% (* B B) P)\n D (% (* D C) P)\n M I ) )\n (list R (- P R)) ) ) ) )\n\n(println (ts 10 13))\n(println (ts 56 101))\n(println (ts 1030 10009))\n(println (ts 1032 10009))\n(println (ts 44402 100049))\n(println (ts 665820697 1000000009))\n(println (ts 881398088036 1000000000039))\n(println (ts 41660815127637347468140745042827704103445750172002 (+ (** 10 50) 577)))\n","language":"PicoLisp"},{"code":"Function Invoke-ModuloExponentiation ([BigInt]$Base, [BigInt]$Exponent, $Modulo) {\n $Result = 1\n $Base = $Base % $Modulo\n If ($Base -eq 0) {return 0}\n\n While ($Exponent -gt 0) {\n If (($Exponent -band 1) -eq 1) {$Result = ($Result * $Base) % $Modulo}\n $Exponent = $Exponent -shr 1\n $Base = ($Base * $Base) % $Modulo\n }\n return ($Result % $Modulo)\n}\n\nFunction Get-Legendre ([BigInt]$Integer, [BigInt]$Prime) {\n return (Invoke-ModuloExponentiation -Base $Integer -Exponent (($Prime - 1) / 2) -Modulo $Prime)\n}\n\nFunction Invoke-TonelliShanks ([BigInt]$Integer, [BigInt]$Prime) {\n If ((Get-Legendre $Integer $Prime) -ne 1) {throw \"$Integer not a square (mod $Prime)\"}\n [bigint]$q = $Prime - 1\n $s = 0\n While (($q % 2) -eq 0) {\n $q = $q / 2\n $s++\n }\n If ($s -eq 1) {\n return (Invoke-ModuloExponentiation $Integer -Exponent (($Prime + 1) / 4) -Modulo $Prime)\n }\n For ($z = 2; [Bigint]::Compare($z, $Prime) -lt 0; $z++) {\n If ([BigInt]::Compare(($Prime - 1), (Get-Legendre $z $Prime)) -eq 0) {\n break\n }\n }\n $c = Invoke-ModuloExponentiation -Base $z -Exponent $q -Modulo $Prime\n $r = Invoke-ModuloExponentiation -Base $Integer -Exponent (($q + 1) / 2) -Modulo $Prime\n $t = Invoke-ModuloExponentiation -Base $Integer -Exponent $q -Modulo $Prime\n $m = $s\n $t2 = 0\n\n While ((($t - 1) % $Prime) -ne 0) {\n $t2 = $t * $t % $Prime\n Foreach ($i in (1..$m)) {\n If ((($t2 -1) % $Prime) -eq 0) {\n break\n }\n $t2 = Invoke-ModuloExponentiation -Base $t2 -Exponent 2 -Modulo $Prime\n }\n $b = Invoke-ModuloExponentiation -Base $c -Exponent ([Math]::Pow(2, ($m - $i - 1))) -Modulo $Prime\n $r = ($r * $b) % $Prime\n $c = ($b * $b) % $Prime\n $t = ($t * $c) % $Prime\n $m = $i\n }\n return $r\n}\n\n$TonelliTests = @(\n @{Integer = [BigInt]::Parse('10'); Prime = [BigInt]::Parse('13')},\n @{Integer = [BigInt]::Parse('56'); Prime = [BigInt]::Parse('101')},\n @{Integer = [BigInt]::Parse('1030'); Prime = [BigInt]::Parse('10009')},\n @{Integer = [BigInt]::Parse('44402'); Prime = [BigInt]::Parse('100049')},\n @{Integer = [BigInt]::Parse('665820697'); Prime = [BigInt]::Parse('1000000009')},\n @{Integer = [BigInt]::Parse('881398088036'); Prime = [BigInt]::Parse('1000000000039')},\n @{Integer = [BigInt]::Parse('41660815127637347468140745042827704103445750172002'); Prime = [BigInt]::Parse('100000000000000000000000000000000000000000000000577')}\n)\n\n$TonelliTests | Foreach-Object {\n $Result = Invoke-TonelliShanks @_\n [PSCustomObject]@{\n n = $_['Integer']\n p = $_['Prime']\n Roots = @($Result, ($_['Prime'] - $Result))\n }\n} | Format-List\n","language":"PowerShell"},{"code":"def legendre(a, p):\n return pow(a, (p - 1) // 2, p)\n\ndef tonelli(n, p):\n assert legendre(n, p) == 1, \"not a square (mod p)\"\n q = p - 1\n s = 0\n while q % 2 == 0:\n q //= 2\n s += 1\n if s == 1:\n return pow(n, (p + 1) // 4, p)\n for z in range(2, p):\n if p - 1 == legendre(z, p):\n break\n c = pow(z, q, p)\n r = pow(n, (q + 1) // 2, p)\n t = pow(n, q, p)\n m = s\n t2 = 0\n while (t - 1) % p != 0:\n t2 = (t * t) % p\n for i in range(1, m):\n if (t2 - 1) % p == 0:\n break\n t2 = (t2 * t2) % p\n b = pow(c, 1 << (m - i - 1), p)\n r = (r * b) % p\n c = (b * b) % p\n t = (t * c) % p\n m = i\n return r\n\nif __name__ == '__main__':\n ttest = [(10, 13), (56, 101), (1030, 10009), (44402, 100049),\n\t (665820697, 1000000009), (881398088036, 1000000000039),\n (41660815127637347468140745042827704103445750172002, 10**50 + 577)]\n for n, p in ttest:\n r = tonelli(n, p)\n assert (r * r - n) % p == 0\n print(\"n = %d p = %d\" % (n, p))\n print(\"\\t roots : %d %d\" % (r, p - r))\n","language":"Python"},{"code":"#lang racket\n\n(require math/number-theory)\n\n(define (Legendre a p)\n (modexpt a (quotient (sub1 p) 2)))\n\n(define (Tonelli n p (err (λ (n p) (error \"not a square (mod p)\" (list n p)))))\n (with-modulus p\n (unless (= 1 (Legendre n p)) (err n p))\n\n (define-values (q s)\n (let even?-q-loop ((q (sub1 p)) (s 0))\n (if (even? q)\n (even?-q-loop (quotient q 2) (add1 s))\n (values q s))))\n\n (cond\n [(= s 1)\n (modexpt n (/ (add1 p) 4))]\n [else\n (define z (for/first ((z (in-range 2 p)) #:when (= (sub1 p) (Legendre z p))) z))\n (let loop ((c (modexpt z q))\n (r (modexpt n (quotient (add1 q) 2)))\n (t (modexpt n q))\n (m s))\n (cond\n [(mod= 1 t)\n r]\n [else\n (define-values (t2 m′) (for/fold ((t2 (modsqr t)) (i 1))\n ((j (in-range 1 m)) #:final (mod= t2 1))\n (values (modsqr t2) j)))\n (define b (modexpt c (expt 2 (- m m′ 1))))\n (define c′ (modsqr b))\n (loop c′ (mod* r b) (mod* t c′) m′)]))])))\n\n(module+ test\n (require rackunit)\n\n (define ttest\n `((10 13)\n (56 101)\n (1030 10009)\n (44402 100049)\n (665820697 1000000009)\n (881398088036 1000000000039)\n (41660815127637347468140745042827704103445750172002\n ,(+ #e1e50 577))))\n\n (define (task ttest)\n (for ((test ttest))\n (define n (first test))\n (define p (second test))\n (define r (Tonelli n p))\n (printf \"n = ~a p = ~a~% roots : ~a ~a~%\" n p r (- p r))))\n\n (task ttest)\n\n (check-exn exn:fail? (λ () (Tonelli 1032 1009))))\n","language":"Racket"},{"code":"# Legendre operator (𝑛│𝑝)\nsub infix:<│> (Int \\𝑛, Int \\𝑝 where 𝑝.is-prime && (𝑝 != 2)) {\n given 𝑛.expmod( (𝑝-1) div 2, 𝑝 ) {\n when 0 { 0 }\n when 1 { 1 }\n default { -1 }\n }\n}\n\nsub tonelli-shanks ( \\𝑛, \\𝑝 where (𝑛│𝑝) > 0 ) {\n my $𝑄 = 𝑝 - 1;\n my $𝑆 = 0;\n $𝑄 +>= 1 and $𝑆++ while $𝑄 %% 2;\n return 𝑛.expmod((𝑝+1) div 4, 𝑝) if $𝑆 == 1;\n my $𝑐 = ((2..𝑝).first: (*│𝑝) < 0).expmod($𝑄, 𝑝);\n my $𝑅 = 𝑛.expmod( ($𝑄+1) +> 1, 𝑝 );\n my $𝑡 = 𝑛.expmod( $𝑄, 𝑝 );\n while ($𝑡-1) % 𝑝 {\n my $b;\n my $𝑡2 = $𝑡² % 𝑝;\n for 1 .. $𝑆 {\n if ($𝑡2-1) %% 𝑝 {\n $b = $𝑐.expmod(1 +< ($𝑆-1-$_), 𝑝);\n $𝑆 = $_;\n last;\n }\n $𝑡2 = $𝑡2² % 𝑝;\n }\n $𝑅 = ($𝑅 * $b) % 𝑝;\n $𝑐 = $b² % 𝑝;\n $𝑡 = ($𝑡 * $𝑐) % 𝑝;\n }\n $𝑅;\n}\n\nmy @tests = (\n (10, 13),\n (56, 101),\n (1030, 10009),\n (1032, 10009),\n (44402, 100049),\n (665820697, 1000000009),\n (881398088036, 1000000000039),\n (41660815127637347468140745042827704103445750172002,\n 100000000000000000000000000000000000000000000000577)\n);\n\n for @tests -> ($n, $p) {\n try my $t = tonelli-shanks($n, $p);\n say \"No solution for ({$n}, {$p}).\" and next if !$t or ($t² - $n) % $p;\n say \"Roots of $n are ($t, {$p-$t}) mod $p\";\n}\n","language":"Raku"},{"code":"/* REXX (required by some interpreters) */\nNumeric Digits 1000000\nttest ='[(10, 13), (56, 101), (1030, 10009), (44402, 100049)]'\nDo While pos('(',ttest)>0\n Parse Var ttest '(' n ',' p ')' ttest\n r = tonelli(n, p)\n Say \"n =\" n \"p =\" p\n Say \" roots :\" r (p - r)\n End\nExit\n\nlegendre: Procedure\n Parse Arg a, p\n return pow(a, (p - 1) % 2, p)\n\ntonelli: Procedure\n Parse Arg n, p\n q = p - 1\n s = 0\n Do while q // 2 == 0\n q = q % 2\n s = s+1\n End\n if s == 1 Then\n return pow(n, (p + 1) % 4, p)\n Do z=2 To p\n if p - 1 == legendre(z, p) Then\n Leave\n End\n c = pow(z, q, p)\n r = pow(n, (q + 1) / 2, p)\n t = pow(n, q, p)\n m = s\n t2 = 0\n Do while (t - 1) // p <> 0\n t2 = (t * t) // p\n Do i=1 To m\n if (t2 - 1) // p == 0 Then\n Leave\n t2 = (t2 * t2) // p\n End\n y=2**(m - i - 1)\n b = pow(c, y, p)\n If b=10008 Then Trace ?R\n r = (r * b) // p\n c = (b * b) // p\n t = (t * c) // p\n m = i\n End\n return r\npow: Procedure\n Parse Arg x,y,z\n If y>0 Then\n p=x**y\n Else p=x\n If z>'' Then\n p=p//z\n Return p\n","language":"REXX"},{"code":"func tonelli(n, p) {\n legendre(n, p) == 1 || die \"not a square (mod p)\"\n var q = p-1\n var s = valuation(q, 2)\n s == 1 ? return(powmod(n, (p + 1) >> 2, p)) : (q >>= s)\n var c = powmod(2 ..^ p -> first {|z| legendre(z, p) == -1}, q, p)\n var r = powmod(n, (q + 1) >> 1, p)\n var t = powmod(n, q, p)\n var m = s\n var t2 = 0\n while (!p.divides(t - 1)) {\n t2 = ((t * t) % p)\n var b\n for i in (1 ..^ m) {\n if (p.divides(t2 - 1)) {\n b = powmod(c, 1 << (m - i - 1), p)\n m = i\n break\n }\n t2 = ((t2 * t2) % p)\n }\n\n r = ((r * b) % p)\n c = ((b * b) % p)\n t = ((t * c) % p)\n }\n return r\n}\n\nvar tests = [\n [10, 13], [56, 101], [1030, 10009], [44402, 100049],\n [665820697, 1000000009], [881398088036, 1000000000039],\n [41660815127637347468140745042827704103445750172002, 10**50 + 577],\n]\n\nfor n,p in tests {\n var r = tonelli(n, p)\n assert((r*r - n) % p == 0)\n say \"Roots of #{n} are (#{r}, #{p-r}) mod #{p}\"\n}\n","language":"Sidef"},{"code":"Imports System.Numerics\n\nModule Module1\n\n Class Solution\n ReadOnly root1 As BigInteger\n ReadOnly root2 As BigInteger\n ReadOnly exists As Boolean\n\n Sub New(r1 As BigInteger, r2 As BigInteger, e As Boolean)\n root1 = r1\n root2 = r2\n exists = e\n End Sub\n\n Public Function GetRoot1() As BigInteger\n Return root1\n End Function\n\n Public Function GetRoot2() As BigInteger\n Return root2\n End Function\n\n Public Function GetExists() As Boolean\n Return exists\n End Function\n End Class\n\n Function Ts(n As BigInteger, p As BigInteger) As Solution\n If BigInteger.ModPow(n, (p - 1) / 2, p) <> 1 Then\n Return New Solution(0, 0, False)\n End If\n\n Dim q As BigInteger = p - 1\n Dim ss = BigInteger.Zero\n While (q Mod 2) = 0\n ss += 1\n q >>= 1\n End While\n\n If ss = 1 Then\n Dim r1 = BigInteger.ModPow(n, (p + 1) / 4, p)\n Return New Solution(r1, p - r1, True)\n End If\n\n Dim z As BigInteger = 2\n While BigInteger.ModPow(z, (p - 1) / 2, p) <> p - 1\n z += 1\n End While\n Dim c = BigInteger.ModPow(z, q, p)\n Dim r = BigInteger.ModPow(n, (q + 1) / 2, p)\n Dim t = BigInteger.ModPow(n, q, p)\n Dim m = ss\n\n Do\n If t = 1 Then\n Return New Solution(r, p - r, True)\n End If\n Dim i = BigInteger.Zero\n Dim zz = t\n While zz <> 1 AndAlso i < (m - 1)\n zz = zz * zz Mod p\n i += 1\n End While\n Dim b = c\n Dim e = m - i - 1\n While e > 0\n b = b * b Mod p\n e = e - 1\n End While\n r = r * b Mod p\n c = b * b Mod p\n t = t * c Mod p\n m = i\n Loop\n End Function\n\n Sub Main()\n Dim pairs = New List(Of Tuple(Of Long, Long)) From {\n New Tuple(Of Long, Long)(10, 13),\n New Tuple(Of Long, Long)(56, 101),\n New Tuple(Of Long, Long)(1030, 10009),\n New Tuple(Of Long, Long)(1032, 10009),\n New Tuple(Of Long, Long)(44402, 100049),\n New Tuple(Of Long, Long)(665820697, 1000000009),\n New Tuple(Of Long, Long)(881398088036, 1000000000039)\n }\n\n For Each pair In pairs\n Dim sol = Ts(pair.Item1, pair.Item2)\n Console.WriteLine(\"n = {0}\", pair.Item1)\n Console.WriteLine(\"p = {0}\", pair.Item2)\n If sol.GetExists() Then\n Console.WriteLine(\"root1 = {0}\", sol.GetRoot1())\n Console.WriteLine(\"root2 = {0}\", sol.GetRoot2())\n Else\n Console.WriteLine(\"No solution exists\")\n End If\n Console.WriteLine()\n Next\n\n Dim bn = BigInteger.Parse(\"41660815127637347468140745042827704103445750172002\")\n Dim bp = BigInteger.Pow(10, 50) + 577\n Dim bsol = Ts(bn, bp)\n Console.WriteLine(\"n = {0}\", bn)\n Console.WriteLine(\"p = {0}\", bp)\n If bsol.GetExists() Then\n Console.WriteLine(\"root1 = {0}\", bsol.GetRoot1())\n Console.WriteLine(\"root2 = {0}\", bsol.GetRoot2())\n Else\n Console.WriteLine(\"No solution exists\")\n End If\n End Sub\n\nEnd Module\n","language":"Visual-Basic-.NET"},{"code":"import \"./dynamic\" for Tuple\nimport \"./big\" for BigInt\n\nvar Solution = Tuple.create(\"Solution\", [\"root1\", \"root2\", \"exists\"])\n\nvar ts = Fn.new { |n, p|\n if (n is Num) n = BigInt.new(n)\n if (p is Num) p = BigInt.new(p)\n\n var powModP = Fn.new { |a, e| a.modPow(e, p) }\n\n var ls = Fn.new { |a| powModP.call(a, p.dec / BigInt.two) }\n\n if (ls.call(n) != BigInt.one) return Solution.new(BigInt.zero, BigInt.zero, false)\n var q = p.dec\n var ss = BigInt.zero\n while (q & BigInt.one == BigInt.zero) {\n ss = ss.inc\n q = q >> 1\n }\n if (ss == BigInt.one) {\n var r1 = powModP.call(n, p.inc / BigInt.four)\n return Solution.new(r1, p - r1, true)\n }\n var z = BigInt.two\n while (ls.call(z) != p.dec) z = z.inc\n var c = powModP.call(z, q)\n var r = powModP.call(n, q.inc/BigInt.two)\n var t = powModP.call(n, q)\n var m = ss\n while (true) {\n if (t == BigInt.one) return Solution.new(r, p - r, true)\n var i = BigInt.zero\n var zz = t\n while (zz != BigInt.one && i < m.dec) {\n zz = zz * zz % p\n i = i.inc\n }\n var b = c\n var e = m - i.inc\n while (e > BigInt.zero) {\n b = b * b % p\n e = e.dec\n }\n r = r * b % p\n c = b * b % p\n t = t * c % p\n m = i\n }\n}\n\nvar pairs = [\n [10, 13], [56, 101], [1030, 10009], [1032, 10009], [44402, 100049],\n [665820697, 1000000009], [881398088036, 1000000000039]\n]\n\nfor (pair in pairs) {\n var n = pair[0]\n var p = pair[1]\n var sol = ts.call(n, p)\n System.print(\"n = %(n)\")\n System.print(\"p = %(p)\")\n if (sol.exists) {\n System.print(\"root1 = %(sol.root1)\")\n System.print(\"root2 = %(sol.root2)\")\n } else {\n System.print(\"No solution exists\")\n }\n System.print()\n}\n\nvar bn = BigInt.new(\"41660815127637347468140745042827704103445750172002\")\nvar bp = BigInt.ten.pow(50) + BigInt.new(577)\nvar bsol = ts.call(bn, bp)\nSystem.print(\"n = %(bn)\")\nSystem.print(\"p = %(bp)\")\nif (bsol.exists) {\n System.print(\"root1 = %(bsol.root1)\")\n System.print(\"root2 = %(bsol.root2)\")\n} else {\n System.print(\"No solution exists\")\n}\n","language":"Wren"},{"code":"var BN=Import(\"zklBigNum\");\nfcn modEq(a,b,p) { (a-b)%p==0 }\nfcn legendre(a,p){ a.powm((p - 1)/2,p) }\n\nfcn tonelli(n,p){ //(BigInt,Int|BigInt)\n _assert_(legendre(n,p)==1, \"not a square (mod p)\"+vm.arglist);\n q,s:=p-1,0;\n while(q.isEven){ q/=2; s+=1; }\n if(s==1) return(n.powm((p+1)/4,p));\n z:=[BN(2)..p].filter1('wrap(z){ legendre(z,p)==(p-1) });\n c,r,t,m,t2:=z.powm(q,p), n.powm((q+1)/2,p), n.powm(q,p), s, 0;\n while(not modEq(t,1,p)){\n t2=(t*t)%p;\n i:=1; while(not modEq(t2,1,p)){ i+=1; t2=(t2*t2)%p; } // assert(i<m)\n b:=c.powm(BN(1).shiftLeft(m-i-1), p);\n r,c,t,m = (r*b)%p, (b*b)%p, (t*c)%p, i;\n }\n r\n}\n","language":"Zkl"},{"code":"ttest:=T(T(10,13), T(56,101), T(1030,10009), T(44402,100049),\n T(665820697,1000000009), T(881398088036,1000000000039),\n T(\"41660815127637347468140745042827704103445750172002\", BN(10).pow(50) + 577),\n T(1032,10009) );\nforeach n,p in (ttest){ n=BN(n);\n r:=tonelli(n,p);\n assert((r*r-n)%p == 0,\"(r*r-n)%p == 0 : %s,%s,%s-->%s\".fmt(r,n,p,(r*r-n)%p));\n println(\"n=%d p=%d\".fmt(n,p));\n println(\" roots: %d %d\".fmt(r, p-r));\n}\n","language":"Zkl"}],"string":"[\n {\n \"code\": \"---\\nfrom: http://rosettacode.org/wiki/Tonelli-Shanks_algorithm\\n\",\n \"language\": \"00-META\"\n },\n {\n \"code\": \"In computational number theory, the [[wp:Tonelli–Shanks algorithm|Tonelli–Shanks algorithm]] is a technique for solving for '''x''' in a congruence of the form:\\n<big>\\n:: x<sup>2</sup> ≡ n (mod p)\\n</big>\\nwhere '''n''' is an integer which is a quadratic residue (mod p), '''p''' is an odd prime, and '''x,n ∈ F<sub>p</sub>''' where F<sub>p</sub> = {0, 1, ..., p - 1}.\\n\\nIt is used in [https://en.wikipedia.org/wiki/Rabin_cryptosystem cryptography] techniques.\\n\\n\\nTo apply the algorithm, we need the Legendre symbol:\\n\\nThe Legendre symbol '''(a | p)''' denotes the value of a<sup>(p-1)/2</sup> (mod p).\\n* '''(a | p) ≡ 1''' if '''a''' is a square (mod p)\\n* '''(a | p) ≡ -1''' if '''a''' is not a square (mod p)\\n* '''(a | p) ≡ 0''' if '''a''' ≡ 0 (mod p) \\n\\n\\n;Algorithm pseudo-code:\\n<big>\\nAll ≡ are taken to mean (mod p) unless stated otherwise.\\n\\n* Input: '''p''' an odd prime, and an integer '''n''' .\\n* Step 0: Check that '''n''' is indeed a square: (n | p) must be ≡ 1 .\\n* Step 1: By factoring out powers of 2 from p - 1, find '''q''' and '''s''' such that p - 1 = q2<sup>s</sup> with '''q''' odd .\\n** If p ≡ 3 (mod 4) (i.e. s = 1), output the two solutions r ≡ ± n<sup>(p+1)/4</sup> .\\n* Step 2: Select a non-square '''z''' such that (z | p) ≡ -1 and set c ≡ z<sup>q</sup> .\\n* Step 3: Set r ≡ n<sup>(q+1)/2</sup>, t ≡ n<sup>q</sup>, m = s .\\n* Step 4: Loop the following:\\n** If t ≡ 1, output '''r''' and '''p - r''' .\\n** Otherwise find, by repeated squaring, the lowest '''i''', 0 < i < m , such that t<sup>2<sup>i</sup></sup> ≡ 1 .\\n** Let b ≡ c<sup>2<sup>(m - i - 1)</sup></sup>, and set r ≡ rb, t ≡ tb<sup>2</sup>, c ≡ b<sup>2</sup> and m = i .\\n</big>\\n\\n\\n;Task:\\nImplement the above algorithm. \\n\\nFind solutions (if any) for \\n* n = 10 p = 13\\n* n = 56 p = 101\\n* n = 1030 p = 10009\\n* n = 1032 p = 10009\\n* n = 44402 p = 100049 \\n\\n;Extra credit:\\n* n = 665820697 p = 1000000009 \\n* n = 881398088036 p = 1000000000039 \\n* n = 41660815127637347468140745042827704103445750172002 p = 10^50 + 577 \\t\\n\\n\\n;See also:\\n* [[Modular exponentiation]]\\n* [[Cipolla's algorithm]]\\n<br><br>\\n\",\n \"language\": \"00-TASK\"\n },\n {\n \"code\": \"F legendre(a, p)\\n R pow(a, (p - 1) I/ 2, p)\\n\\nF tonelli(n, p)\\n assert(legendre(n, p) == 1, ‘not a square (mod p)’)\\n V q = p - 1\\n V s = 0\\n L q % 2 == 0\\n q I/= 2\\n s++\\n I s == 1\\n R pow(n, (p + 1) I/ 4, p)\\n V z = 2\\n L\\n I p - 1 == legendre(z, p)\\n L.break\\n z++\\n V c = pow(z, q, p)\\n V r = pow(n, (q + 1) I/ 2, p)\\n V t = pow(n, q, p)\\n V m = s\\n V t2 = BigInt(0)\\n L (t - 1) % p != 0\\n t2 = (t * t) % p\\n V i = 1\\n L(ii) 1 .< m\\n I (t2 - 1) % p == 0\\n i = ii\\n L.break\\n t2 = (t2 * t2) % p\\n V b = pow(c, Int64(1 << (m - i - 1)), p)\\n r = (r * b) % p\\n c = (b * b) % p\\n t = (t * c) % p\\n m = i\\n R r\\n\\nV ttest = [(BigInt(10), BigInt(13)), (BigInt(56), BigInt(101)), (BigInt(1030), BigInt(10009)), (BigInt(44402), BigInt(100049)),\\n (BigInt(665820697), BigInt(1000000009)), (BigInt(881398088036), BigInt(1000000000039)),\\n (BigInt(‘41660815127637347468140745042827704103445750172002’), BigInt(10) ^ 50 + 577)]\\nL(n, p) ttest\\n V r = tonelli(n, p)\\n assert((r * r - n) % p == 0)\\n print(‘n = #. p = #.’.format(n, p))\\n print(\\\"\\\\t roots : #. #.\\\".format(r, p - r))\\n\",\n \"language\": \"11l\"\n },\n {\n \"code\": \"/* ARM assembly AARCH64 Raspberry PI 3B or android 64 bits */\\n/* program tonshan64.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/*******************************************/\\n/* Initialized data */\\n/*******************************************/\\n.data\\nszMessStartPgm: .asciz \\\"Program 64 bits start \\\\n\\\"\\nszMessEndPgm: .asciz \\\"Program normal end.\\\\n\\\"\\nszMessError: .asciz \\\"\\\\033[31mError !!!\\\\n\\\"\\nszMessErrGen: .asciz \\\"Error end program.\\\\n\\\"\\nszMessOverflow: .asciz \\\"Overflow function modulo.\\\\n\\\"\\nszMessNoSolution: .asciz \\\"No solution.\\\\n\\\"\\nszCarriageReturn: .asciz \\\"\\\\n\\\"\\n\\n/* datas message display */\\nszMessEntry: .asciz \\\"Number : @ modulo : @ ==> \\\"\\nszMessResult: .asciz \\\"Racine 1 : @ Racine 2 : @ \\\\n\\\"\\n\\n\\nqNumberN: .quad 44402\\nqNumberP: .quad 100049\\n/*******************************************/\\n/* UnInitialized data */\\n/*******************************************/\\n.bss\\n.align 4\\nsZoneConv: .skip 24\\n/*******************************************/\\n/* code section */\\n/*******************************************/\\n.text\\n.global main\\nmain: // program start\\n ldr x0,qAdrszMessStartPgm // display start message\\n bl affichageMess\\n\\n mov x0,10\\n mov x1,13\\n bl displayEntry\\n bl computeTonSha\\n bl displayResult\\n\\n mov x0,56\\n mov x1,101\\n bl displayEntry\\n bl computeTonSha\\n bl displayResult\\n\\n mov x0,1030\\n mov x1,10009\\n bl displayEntry\\n bl computeTonSha\\n bl displayResult\\n\\n mov x0,1032\\n mov x1,10009\\n bl displayEntry\\n bl computeTonSha\\n bcs 1f\\n bl displayResult\\n1:\\n ldr x4,qAdrqNumberN\\n ldr x0,[x4]\\n ldr x4,qAdrqNumberP\\n ldr x1,[x4]\\n bl displayEntry\\n bl computeTonSha\\n bl displayResult\\n\\n ldr x0,qAdrszMessEndPgm // display end message\\n bl affichageMess\\n b 100f\\n99: // display error message\\n ldr x0,qAdrszMessError\\n bl affichageMess\\n100: // standard end of the program\\n mov x0, #0 // return code\\n mov x8, #EXIT // request to exit program\\n svc 0 // perform system call\\nqAdrszMessStartPgm: .quad szMessStartPgm\\nqAdrszMessEndPgm: .quad szMessEndPgm\\nqAdrszMessError: .quad szMessError\\nqAdrszMessNoSolution: .quad szMessNoSolution\\nqAdrszCarriageReturn: .quad szCarriageReturn\\nqAdrqNumberN: .quad qNumberN\\nqAdrqNumberP: .quad qNumberP\\n\\nqAdrszMessResult: .quad szMessResult\\nqAdrsZoneConv: .quad sZoneConv\\n\\n/******************************************************************/\\n/* algorithm Tonelli–Shanks */\\n/******************************************************************/\\n/* x0 contains number */\\n/* x1 contains modulus */\\n/* x0 return root 1 */\\n/* x1 return root 2 */\\ncomputeTonSha:\\n stp x10,lr,[sp,-16]! // save registres\\n stp x2,x3,[sp,-16]! // save registres\\n stp x4,x5,[sp,-16]! // save registres\\n stp x6,x7,[sp,-16]! // save registres\\n stp x8,x9,[sp,-16]! // save registres\\n stp x11,x12,[sp,-16]! // save registres\\n mov x9,x0 // save number\\n mov x10,x1 // save modulo p\\n mov x2,x10\\n sub x1,x2,1\\n lsr x1,x1,1\\n bl moduloPuR64\\n bcs 100f // error ?\\n cmp x0,#1\\n bne 20f\\n sub x5,x10,1\\n mov x6,#1 // s\\n1:\\n lsr x5,x5,#1 // div by 2\\n tst x5,1 // even ?\\n cinc x6,x6,eq // yes count\\n beq 1b // and loop\\n // x5 = q\\n cmp x6,#1 // s = 1 ?\\n bne 3f\\n add x1,x10,1 // compute root 1\\n lsr x1,x1,#2 // p + 1 / 4\\n mov x0,x9 // n\\n mov x2,x10 // p\\n bl moduloPuR64\\n bcs 100f // error ?\\n neg x1,x0 // compute root 2 = - root 1\\n b 100f // and end\\n3:\\n mov x7,#3 // z\\n4:\\n mov x0,x7\\n mov x2,x10 // p\\n sub x1,x2,1\\n lsr x1,x1,1 // power = p - 1 / 2\\n bl moduloPuR64\\n bcs 100f // error ?\\n cmp x0,#1\\n cinc x7,x7,eq // si égal à 1\\n cinc x7,x7,eq\\n beq 4b\\n cmp x0,0\\n cinc x7,x7,eq // si egal à 0\\n cinc x7,x7,eq\\n beq 4b\\n mov x0,x7 // z\\n mov x1,x5 // q\\n mov x2,x10 // p\\n bl moduloPuR64\\n bcs 100f // error ?\\n mov x12,x0 // c = z pow q mod p\\n\\n add x1,x5,1 // = q +1\\n lsr x1,x1,1 // div 2\\n mov x0,x9 // n\\n mov x2,x10 // p\\n bl moduloPuR64\\n mov x4,x0 // r = n puis (q+1)/2 mod p\\n\\n mov x0,x9 // n\\n mov x1,x5 // = q\\n mov x2,x10 // p\\n bl moduloPuR64\\n bcs 100f // error ?\\n mov x5,x0 // reuse r5 = t = n pow q mod p\\n\\n8: // begin loop\\n cmp x5,1\\n beq 10f\\n mov x0,x5 // t\\n mov x1,x6 // m\\n mov x2,x10 // p\\n bl searchI // search i for t puis 2 puis i = 1 mod p\\n cmp x0,-1 // not find -> no solution\\n beq 20f\\n mov x9,x0 // i\\n sub x8,x6,x0 // compute b\\n sub x8,x8,1 // m - i - 1\\n mov x1,1\\n lsl x1,x1,x8\\n mov x0,x12\\n mov x2,x10 // p\\n bl moduloPuR64\\n bcs 100f // error ?\\n mov x7,x0 // b = c puis 2 puis 2 puis m-i-1 à verifier\\n\\n mul x0,x7,x4 // r = r * b mod p\\n umulh x1,x7,x4\\n mov x2,x10\\n bl divisionReg128U\\n mov x4,x3 // r mod p\\n mul x0,x7,x7\\n umulh x1,x7,x7\\n mov x2,x10\\n bl divisionReg128U\\n mov x12,x3 // c mod p\\n\\n mul x0,x5,x12\\n umulh x1,x5,x12\\n mov x2,x10\\n bl divisionReg128U\\n mov x5,x3 // t mod p\\n\\n mov x6,x9 // m = i\\n b 8b\\n9:\\n\\n10:\\n mov x0,x4 // x0 return root 1\\n sub x1,x10,x0 // x1 return root 2\\n cmn x0,0 // carry à zero roots ok\\n b 100f\\n20:\\n ldr x0,qAdrszMessNoSolution\\n bl affichageMess\\n\\n mov x0,0\\n mov x1,0\\n cmp x0,0 // carry to 1 No solution\\n100:\\n ldp x11,x12,[sp],16\\n ldp x8,x9,[sp],16\\n ldp x6,x7,[sp],16\\n ldp x4,x5,[sp],16\\n ldp x2,x3,[sp],16\\n ldp x10,lr,[sp],16 // restaur des 2 registres\\n ret // retour adresse lr x30\\n\\n/******************************************************************/\\n/* search i */\\n/******************************************************************/\\n// x0 contains t\\n// x1 contains maxi\\n// x2 contains modulo\\nsearchI:\\n stp x1,lr,[sp,-16]! // save registres\\n stp x2,x3,[sp,-16]! // save registres\\n stp x4,x5,[sp,-16]! // save registres\\n stp x6,x7,[sp,-16]! // save registres\\n mov x4,x0 // t\\n mov x6,x1 // m\\n mov x3,1 // i\\n1:\\n mov x5,1\\n lsl x5,x5,x3 // compute 2 power i\\n\\n mov x0,x4\\n mov x1,x5\\n bl moduloPuR64 // compute t pow 2 pow i mod p\\n cmp x0,1 // = 1 ?\\n beq 3f // yes it is ok\\n add x3,x3,1 // next i\\n cmp x3,x6\\n blt 1b // loop\\n mov x0,-1 // not find\\n b 100f\\n3:\\n mov x0,x3 // return i\\n100:\\n ldp x6,x7,[sp],16\\n ldp x4,x5,[sp],16\\n ldp x2,x3,[sp],16\\n ldp x1,lr,[sp],16 // restaur des 2 registres\\n ret // retour adresse lr x30\\n/******************************************************************/\\n/* display numbers */\\n/******************************************************************/\\n/* x0 contains number */\\n/* x1 contains modulo */\\ndisplayEntry:\\n stp x0,lr,[sp,-16]! // save registres\\n stp x1,x2,[sp,-16]! // save registres\\n mov x2,x1 // root 2\\n ldr x1,qAdrsZoneConv // convert root 1 in r0\\n bl conversion10S // convert ascii string\\n ldr x0,qAdrszMessEntry\\n ldr x1,qAdrsZoneConv\\n bl strInsertAtCharInc // and put in message\\n mov x3,x0\\n mov x0,x2 // racine 2\\n ldr x1,qAdrsZoneConv\\n bl conversion10S // convert ascii string\\n mov x0,x3\\n ldr x1,qAdrsZoneConv\\n bl strInsertAtCharInc // and put in message\\n bl affichageMess\\n100:\\n ldp x1,x2,[sp],16\\n ldp x0,lr,[sp],16 // restaur des 2 registres\\n ret // retour adresse lr x30\\nqAdrszMessEntry: .quad szMessEntry\\n/******************************************************************/\\n/* display roots */\\n/******************************************************************/\\n/* x0 contains root 1 */\\n/* x1 contains root 2 */\\ndisplayResult:\\n stp x1,lr,[sp,-16]! // save registres\\n stp x2,x3,[sp,-16]! // save registres\\n mov x2,x1 // root 2\\n ldr x1,qAdrsZoneConv // convert root 1 in r0\\n bl conversion10S // convert ascii string\\n ldr x0,qAdrszMessResult\\n ldr x1,qAdrsZoneConv\\n bl strInsertAtCharInc // and put in message\\n mov x3,x0\\n mov x0,x2 // racine 2\\n ldr x1,qAdrsZoneConv\\n bl conversion10S // convert ascii string\\n mov x0,x3\\n ldr x1,qAdrsZoneConv\\n bl strInsertAtCharInc // and put in message\\n bl affichageMess\\n100:\\n ldp x2,x3,[sp],16\\n ldp x1,lr,[sp],16 // restaur des 2 registres\\n ret // retour adresse lr x30\\n/**************************************************************/\\n/********************************************************/\\n/* Calcul modulo de b puissance e modulo m */\\n/* Exemple 4 puissance 13 modulo 497 = 445 */\\n/********************************************************/\\n/* x0 nombre */\\n/* x1 exposant */\\n/* x2 modulo */\\nmoduloPuR64:\\n stp x1,lr,[sp,-16]! // save registres\\n stp x3,x4,[sp,-16]! // save registres\\n stp x5,x6,[sp,-16]! // save registres\\n stp x7,x8,[sp,-16]! // save registres\\n stp x9,x10,[sp,-16]! // save registres\\n cbz x0,100f\\n cbz x1,100f\\n mov x8,x0\\n mov x7,x1\\n mov x6,1 // resultat\\n udiv x4,x8,x2\\n msub x9,x4,x2,x8 // contient le reste\\n1:\\n tst x7,1\\n beq 2f\\n mul x4,x9,x6\\n umulh x5,x9,x6\\n mov x6,x4\\n mov x0,x6\\n mov x1,x5\\n bl divisionReg128U\\n cbnz x1,99f // overflow\\n mov x6,x3\\n2:\\n mul x8,x9,x9\\n umulh x5,x9,x9\\n mov x0,x8\\n mov x1,x5\\n bl divisionReg128U\\n cbnz x1,99f // overflow\\n mov x9,x3\\n lsr x7,x7,1\\n cbnz x7,1b\\n cmn x0,0 // carry à zero pas d'erreur\\n mov x0,x6 // result\\n b 100f\\n99:\\n ldr x0,qAdrszMessOverflow\\n bl affichageMess\\n cmp x0,0 // carry à un car erreur\\n mov x0,-1 // code erreur\\n\\n100:\\n ldp x9,x10,[sp],16 // restaur des 2 registres\\n ldp x7,x8,[sp],16 // restaur des 2 registres\\n ldp x5,x6,[sp],16 // restaur des 2 registres\\n ldp x3,x4,[sp],16 // restaur des 2 registres\\n ldp x1,lr,[sp],16 // restaur des 2 registres\\n ret // retour adresse lr x30\\nqAdrszMessOverflow: .quad szMessOverflow\\n/***************************************************/\\n/* division d un nombre de 128 bits par un nombre de 64 bits */\\n/***************************************************/\\n/* x0 contient partie basse dividende */\\n/* x1 contient partie haute dividente */\\n/* x2 contient le diviseur */\\n/* x0 retourne partie basse quotient */\\n/* x1 retourne partie haute quotient */\\n/* x3 retourne le reste */\\ndivisionReg128U:\\n stp x6,lr,[sp,-16]! // save registres\\n stp x4,x5,[sp,-16]! // save registres\\n mov x5,#0 // raz du reste R\\n mov x3,#128 // compteur de boucle\\n mov x4,#0 // dernier bit\\n1:\\n lsl x5,x5,#1 // on decale le reste de 1\\n tst x1,1<<63 // test du bit le plus à gauche\\n lsl x1,x1,#1 // on decale la partie haute du quotient de 1\\n beq 2f\\n orr x5,x5,#1 // et on le pousse dans le reste R\\n2:\\n tst x0,1<<63\\n lsl x0,x0,#1 // puis on decale la partie basse\\n beq 3f\\n orr x1,x1,#1 // et on pousse le bit de gauche dans la partie haute\\n3:\\n orr x0,x0,x4 // position du dernier bit du quotient\\n mov x4,#0 // raz du bit\\n cmp x5,x2\\n blt 4f\\n sub x5,x5,x2 // on enleve le diviseur du reste\\n mov x4,#1 // dernier bit à 1\\n4:\\n // et boucle\\n subs x3,x3,#1\\n bgt 1b\\n lsl x1,x1,#1 // on decale le quotient de 1\\n tst x0,1<<63\\n lsl x0,x0,#1 // puis on decale la partie basse\\n beq 5f\\n orr x1,x1,#1\\n5:\\n orr x0,x0,x4 // position du dernier bit du quotient\\n mov x3,x5\\n100:\\n ldp x4,x5,[sp],16 // restaur des 2 registres\\n ldp x6,lr,[sp],16 // restaur des 2 registres\\n ret // retour adresse lr x30\\n\\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\": \"/* ARM assembly Raspberry PI or android 32 bits */\\n/* program tonshan.s */\\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/* for constantes see task include a file in arm assembly */\\n/************************************/\\n/* Constantes */\\n/************************************/\\n.include \\\"../constantes.inc\\\"\\n\\n/*******************************************/\\n/* Initialized data */\\n/*******************************************/\\n.data\\nszMessStartPgm: .asciz \\\"Program 32 bits start \\\\n\\\"\\nszMessEndPgm: .asciz \\\"Program normal end.\\\\n\\\"\\nszMessError: .asciz \\\"\\\\033[31mError !!!\\\\n\\\"\\nszMessErrGen: .asciz \\\"Error end program.\\\\n\\\"\\nszMessOverflow: .asciz \\\"Overflow function modulo.\\\\n\\\"\\nszMessNoSolution: .asciz \\\"No solution.\\\\n\\\"\\nszCarriageReturn: .asciz \\\"\\\\n\\\"\\n\\n/* datas message display */\\nszMessEntry: .asciz \\\"Number : @ modulo : @ ==> \\\"\\nszMessResult: .asciz \\\"Racine 1 : @ Racine 2 : @ \\\\n\\\"\\n\\niNumberN: .int 1030\\niNumberP: .int 10009\\n\\niNumberN1: .int 1032\\niNumberP1: .int 10009\\n\\niNumberN2: .int 44402\\niNumberP2: .int 100049\\n\\n/*******************************************/\\n/* UnInitialized data */\\n/*******************************************/\\n.bss\\n.align 4\\nsZoneConv: .skip 24\\n/*******************************************/\\n/* code section */\\n/*******************************************/\\n.text\\n.global main\\nmain: // program start\\n ldr r0,iAdrszMessStartPgm // display start message\\n bl affichageMess\\n\\n mov r0,#10\\n mov r1,#13\\n bl displayEntry // display entry number\\n bl computeTonSha // compute roots\\n bl displayResult // display roots\\n\\n mov r0,#56\\n mov r1,#101\\n bl displayEntry\\n bl computeTonSha\\n bl displayResult\\n\\n\\n ldr r4,iAdriNumberN\\n ldr r0,[r4]\\n ldr r4,iAdriNumberP\\n ldr r1,[r4]\\n bl displayEntry\\n bl computeTonSha\\n bl displayResult\\n\\n ldr r4,iAdriNumberN1\\n ldr r0,[r4]\\n ldr r4,iAdriNumberP1\\n ldr r1,[r4]\\n bl displayEntry\\n bl computeTonSha\\n bcs 1f\\n bl displayResult\\n1:\\n ldr r4,iAdriNumberN2\\n ldr r0,[r4]\\n ldr r4,iAdriNumberP2\\n ldr r1,[r4]\\n bl displayEntry\\n bl computeTonSha\\n bl displayResult\\n\\n ldr r0,iAdrszMessEndPgm // display end message\\n bl affichageMess\\n b 100f\\n99: // display error message\\n ldr r0,iAdrszMessError\\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\\niAdrszMessStartPgm: .int szMessStartPgm\\niAdrszMessEndPgm: .int szMessEndPgm\\niAdrszMessError: .int szMessError\\niAdrszMessNoSolution: .int szMessNoSolution\\niAdrszCarriageReturn: .int szCarriageReturn\\niAdriNumberN: .int iNumberN\\niAdriNumberP: .int iNumberP\\niAdriNumberN1: .int iNumberN1\\niAdriNumberP1: .int iNumberP1\\niAdriNumberN2: .int iNumberN2\\niAdriNumberP2: .int iNumberP2\\n\\niAdrszMessResult: .int szMessResult\\niAdrsZoneConv: .int sZoneConv\\n\\n/******************************************************************/\\n/* algorithm Tonelli–Shanks */\\n/******************************************************************/\\n/* r0 contains number */\\n/* r1 contains modulus */\\n/* r0 return root 1 */\\n/* r1 return root 2 */\\ncomputeTonSha:\\n push {r2-r12,lr}\\n\\n mov r9,r0 // save number\\n mov r10,r1 // save modulo p\\n mov r2,r10\\n sub r1,r2,#1\\n lsr r1,r1,#1\\n bl moduloPuR32\\n cmp r0,#1\\n bne 20f\\n sub r5,r10,#1\\n mov r6,#1 // s\\n1:\\n lsr r5,r5,#1 // div by 2\\n tst r5,#1 // even ?\\n addeq r6,#1\\n beq 1b // and loop\\n // r5 = q\\n cmp r6,#1 // s = 1 ?\\n bne 3f\\n add r1,r10,#1 // compute root 1\\n lsr r1,r1,#2 // p + 1 / 4\\n mov r0,r9 // n\\n mov r2,r10 // p\\n bl moduloPuR32\\n neg r1,r0 // compute root 2 = - root 1\\n b 100f // and end\\n3:\\n mov r7,#3 // z\\n4:\\n mov r0,r7\\n mov r2,r10 // p\\n sub r1,r2,#1\\n lsr r1,r1,#1 // power = p - 1 / 2\\n bl moduloPuR32\\n cmp r0,#1\\n addeq r7,#2\\n beq 4b\\n cmp r0,#0\\n addeq r7,#2\\n beq 4b\\n mov r0,r7 // z\\n mov r1,r5 // q\\n mov r2,r10 // p\\n bl moduloPuR32\\n mov r12,r0 // c = z pow q mod p\\n\\n add r1,r5,#1 // = q +1\\n lsr r1,r1,#1 // div 2\\n mov r0,r9 // n\\n mov r2,r10 // p\\n bl moduloPuR32\\n mov r4,r0 // r = n puis (q+1)/2 mod p\\n\\n mov r0,r9 // n\\n mov r1,r5 // = q\\n mov r2,r10 // p\\n bl moduloPuR32\\n mov r5,r0 // reuse r5 = t = n pow q mod p\\n\\n8: // begin loop\\n cmp r5,#1\\n beq 10f\\n mov r0,r5 // t\\n mov r1,r6 // m\\n mov r2,r10 // p\\n bl searchI // search i for t puis 2 puis i = 1 mod p\\n cmp r0,#-1 // not find -> no solution\\n beq 20f\\n mov r9,r0 // i\\n sub r8,r6,r0 // compute b\\n sub r8,r8,#1 // m - i - 1\\n mov r1,#1\\n lsl r1,r1,r8\\n mov r0,r12\\n mov r2,r10 // p\\n bl moduloPuR32\\n mov r7,r0 // b = c puis 2 puis 2 puis m-i-1 à verifier\\n\\n umull r0,r1,r7,r4 // r = r * b mod p\\n mov r2,r10\\n bl division32R\\n mov r4,r2 // r mod p\\n umull r0,r1,r7,r7\\n mov r2,r10\\n bl division32R\\n mov r12,r2 // c mod p\\n\\n umull r0,r1,r5,r12\\n mov r2,r10\\n bl division32R\\n mov r5,r2 // t mod p\\n\\n mov r6,r9 // m = i\\n b 8b\\n9:\\n\\n10:\\n mov r0,r4 // r0 return root 1\\n sub r1,r10,r0 // r1 return root 2\\n cmn r0,#0 // carry à zero roots ok\\n b 100f\\n20:\\n ldr r0,iAdrszMessNoSolution\\n bl affichageMess\\n\\n mov r0,#0\\n mov r1,#0\\n cmp r0,#0 // carry to 1 No solution\\n100:\\n pop {r2-r12,lr} // restaur registers\\n bx lr // return\\n/******************************************************************/\\n/* search i */\\n/******************************************************************/\\n// r0 contains t\\n// r1 contains maxi\\n// r2 contains modulo\\n// r0 return i\\nsearchI:\\n push {r1-r6,lr}\\n\\n mov r4,r0 // t\\n mov r6,r1 // m\\n mov r3,#1 // i\\n1:\\n mov r5,#1\\n lsl r5,r5,r3 // compute 2 power i\\n\\n mov r0,r4\\n mov r1,r5\\n bl moduloPuR32 // compute t pow 2 pow i mod p\\n cmp r0,#1 // = 1 ?\\n beq 3f // yes it is ok\\n add r3,r3,#1 // next i\\n cmp r3,r6\\n blt 1b // loop\\n mov r0,#-1 // not find\\n b 100f\\n3:\\n mov r0,r3 // return i\\n100:\\n pop {r1-r6,lr} // restaur registers\\n bx lr // return\\n/******************************************************************/\\n/* display numbers */\\n/******************************************************************/\\n/* r0 contains number */\\n/* r1 contains modulo */\\ndisplayEntry:\\n push {r0-r3,lr}\\n mov r2,r1 // root 2\\n ldr r1,iAdrsZoneConv // convert root 1 in r0\\n bl conversion10S // convert ascii string\\n ldr r0,iAdrszMessEntry\\n ldr r1,iAdrsZoneConv\\n bl strInsertAtCharInc // and put in message\\n mov r3,r0\\n mov r0,r2 // racine 2\\n ldr r1,iAdrsZoneConv\\n bl conversion10S // convert ascii string\\n mov r0,r3\\n ldr r1,iAdrsZoneConv\\n bl strInsertAtCharInc // and put in message\\n bl affichageMess\\n100:\\n pop {r0-r3,lr} // restaur registers\\n bx lr // return\\niAdrszMessEntry: .int szMessEntry\\n/******************************************************************/\\n/* display roots */\\n/******************************************************************/\\n/* r0 contains root 1 */\\n/* r1 contains root 2 */\\ndisplayResult:\\n push {r1-r3,lr}\\n mov r2,r1 // root 2\\n ldr r1,iAdrsZoneConv // convert root 1 in r0\\n bl conversion10S // convert ascii string\\n ldr r0,iAdrszMessResult\\n ldr r1,iAdrsZoneConv\\n bl strInsertAtCharInc // and put in message\\n mov r3,r0\\n mov r0,r2 // racine 2\\n ldr r1,iAdrsZoneConv\\n bl conversion10S // convert ascii string\\n mov r0,r3\\n ldr r1,iAdrsZoneConv\\n bl strInsertAtCharInc // and put in message\\n bl affichageMess\\n100:\\n\\n pop {r1-r3,lr} // restaur registers\\n bx lr // return\\n/********************************************************/\\n/* Calcul modulo de b puissance e modulo m */\\n/* Exemple 4 puissance 13 modulo 497 = 445 */\\n/* */\\n/********************************************************/\\n/* r0 nombre */\\n/* r1 exposant */\\n/* r2 modulo */\\n/* r0 return result */\\nmoduloPuR32:\\n push {r1-r7,lr} @ save registers\\n cmp r0,#0 @ verif <> zero\\n beq 90f\\n cmp r1,#0 @ verif <> zero\\n moveq r0,#0\\n beq 90f\\n cmp r2,#0 @ verif <> zero\\n moveq r0,#0\\n beq 90f @\\n1:\\n mov r4,r2 @ save modulo\\n mov r5,r1 @ save exposant\\n mov r6,r0 @ save base\\n mov r3,#1 @ start result\\n\\n mov r1,#0 @ division de r0,r1 par r2\\n bl division32R\\n mov r6,r2 @ base <- remainder\\n2:\\n tst r5,#1 @ exposant even or odd\\n beq 3f\\n umull r0,r1,r6,r3\\n mov r2,r4\\n bl division32R\\n mov r3,r2 @ result <- remainder\\n3:\\n umull r0,r1,r6,r6\\n mov r2,r4\\n bl division32R\\n mov r6,r2 @ base <- remainder\\n\\n lsr r5,#1 @ left shift 1 bit\\n cmp r5,#0 @ end ?\\n bne 2b\\n mov r0,r3\\n90:\\n cmn r0,#0 @ no error\\n100: @ fin standard de la fonction\\n pop {r1-r7,lr} @ restaur des registres\\n bx lr @ retour de la fonction en utilisant lr\\n\\n/***************************************************/\\n/* division number 64 bits in 2 registers by number 32 bits */\\n/***************************************************/\\n/* r0 contains lower part dividende */\\n/* r1 contains upper part dividende */\\n/* r2 contains divisor */\\n/* r0 return lower part quotient */\\n/* r1 return upper part quotient */\\n/* r2 return remainder */\\ndivision32R:\\n push {r3-r9,lr} @ save registers\\n mov r6,#0 @ init upper upper part remainder !!\\n mov r7,r1 @ init upper part remainder with upper part dividende\\n mov r8,r0 @ init lower part remainder with lower part dividende\\n mov r9,#0 @ upper part quotient\\n mov r4,#0 @ lower part quotient\\n mov r5,#32 @ bits number\\n1: @ begin loop\\n lsl r6,#1 @ shift upper upper part remainder\\n lsls r7,#1 @ shift upper part remainder\\n orrcs r6,#1\\n lsls r8,#1 @ shift lower part remainder\\n orrcs r7,#1\\n lsls r4,#1 @ shift lower part quotient\\n lsl r9,#1 @ shift upper part quotient\\n orrcs r9,#1\\n @ divisor sustract upper part remainder\\n subs r7,r2\\n sbcs r6,#0 @ and substract carry\\n bmi 2f @ négative ?\\n\\n @ positive or equal\\n orr r4,#1 @ 1 -> right bit quotient\\n b 3f\\n2: @ negative\\n orr r4,#0 @ 0 -> right bit quotient\\n adds r7,r2 @ and restaur remainder\\n adc r6,#0\\n3:\\n subs r5,#1 @ decrement bit size\\n bgt 1b @ end ?\\n mov r0,r4 @ lower part quotient\\n mov r1,r9 @ upper part quotient\\n mov r2,r7 @ remainder\\n100: @ function end\\n pop {r3-r9,lr} @ restaur registers\\n bx lr\\n/***************************************************/\\n/* ROUTINES INCLUDE */\\n/***************************************************/\\n.include \\\"../affichage.inc\\\"\\n\",\n \"language\": \"ARM-Assembly\"\n },\n {\n \"code\": \"#include <stdbool.h>\\n#include <stdint.h>\\n#include <stdio.h>\\n\\nuint64_t modpow(uint64_t a, uint64_t b, uint64_t n) {\\n uint64_t x = 1, y = a;\\n while (b > 0) {\\n if (b % 2 == 1) {\\n x = (x * y) % n; // multiplying with base\\n }\\n y = (y * y) % n; // squaring the base\\n b /= 2;\\n }\\n return x % n;\\n}\\n\\nstruct Solution {\\n uint64_t root1, root2;\\n bool exists;\\n};\\n\\nstruct Solution makeSolution(uint64_t root1, uint64_t root2, bool exists) {\\n struct Solution sol;\\n sol.root1 = root1;\\n sol.root2 = root2;\\n sol.exists = exists;\\n return sol;\\n}\\n\\nstruct Solution ts(uint64_t n, uint64_t p) {\\n uint64_t q = p - 1;\\n uint64_t ss = 0;\\n uint64_t z = 2;\\n uint64_t c, r, t, m;\\n\\n if (modpow(n, (p - 1) / 2, p) != 1) {\\n return makeSolution(0, 0, false);\\n }\\n\\n while ((q & 1) == 0) {\\n ss += 1;\\n q >>= 1;\\n }\\n\\n if (ss == 1) {\\n uint64_t r1 = modpow(n, (p + 1) / 4, p);\\n return makeSolution(r1, p - r1, true);\\n }\\n\\n while (modpow(z, (p - 1) / 2, p) != p - 1) {\\n z++;\\n }\\n\\n c = modpow(z, q, p);\\n r = modpow(n, (q + 1) / 2, p);\\n t = modpow(n, q, p);\\n m = ss;\\n\\n while (true) {\\n uint64_t i = 0, zz = t;\\n uint64_t b = c, e;\\n if (t == 1) {\\n return makeSolution(r, p - r, true);\\n }\\n while (zz != 1 && i < (m - 1)) {\\n zz = zz * zz % p;\\n i++;\\n }\\n e = m - i - 1;\\n while (e > 0) {\\n b = b * b % p;\\n e--;\\n }\\n r = r * b % p;\\n c = b * b % p;\\n t = t * c % p;\\n m = i;\\n }\\n}\\n\\nvoid test(uint64_t n, uint64_t p) {\\n struct Solution sol = ts(n, p);\\n printf(\\\"n = %llu\\\\n\\\", n);\\n printf(\\\"p = %llu\\\\n\\\", p);\\n if (sol.exists) {\\n printf(\\\"root1 = %llu\\\\n\\\", sol.root1);\\n printf(\\\"root2 = %llu\\\\n\\\", sol.root2);\\n } else {\\n printf(\\\"No solution exists\\\\n\\\");\\n }\\n printf(\\\"\\\\n\\\");\\n}\\n\\nint main() {\\n test(10, 13);\\n test(56, 101);\\n test(1030, 10009);\\n test(1032, 10009);\\n test(44402, 100049);\\n\\n return 0;\\n}\\n\",\n \"language\": \"C\"\n },\n {\n \"code\": \"// return (a * b) % mod, avoiding overflow errors while doing modular multiplication.\\nstatic unsigned multiplication_modulo(unsigned a, unsigned b, const unsigned mod) {\\n\\tunsigned res = 0, tmp;\\n\\tfor (b %= mod; a; a & 1 ? b >= mod - res ? res -= mod : 0, res += b : 0, a >>= 1, (tmp = b) >= mod - b ? tmp -= mod : 0, b += tmp);\\n\\treturn res % mod;\\n}\\n\\n// return (n ^ exp) % mod\\nstatic unsigned mod_pow(unsigned n, unsigned exp, const unsigned mod) {\\n\\tunsigned res = 1;\\n\\tfor (n %= mod; exp; exp & 1 ? res = multiplication_modulo(res, n, mod) : 0, n = multiplication_modulo(n, n, mod), exp >>= 1);\\n\\treturn res;\\n}\\n\\nstatic unsigned tonelli_shanks_1(const unsigned n, const unsigned mod) {\\n\\t// return root such that (root * root) % mod congruent to n % mod.\\n\\t// return 0 if no solution to the congruence exists.\\n\\t// mod is assumed odd prime.\\n\\tconst unsigned a = n % mod;\\n\\tunsigned res, b, c, d, e, f, g, h;\\n\\tif (mod_pow(a, (mod - 1) >> 1, mod) != 1)\\n\\t\\tres = 0;\\n\\telse\\n\\t\\tswitch (mod & 7) {\\n\\t\\t\\tcase 3 : case 7 :\\n\\t\\t\\t\\tres = mod_pow(a, (mod + 1) >> 2, mod);\\n\\t\\t\\t\\tbreak;\\n\\t\\t\\tcase 5 :\\n\\t\\t\\t\\tres = mod_pow(a, (mod + 3) >> 3, mod);\\n\\t\\t\\t\\tif (multiplication_modulo(res, res, mod) != a){\\n\\t\\t\\t\\t\\tb = mod_pow(2, (mod - 1) >> 2, mod);\\n\\t\\t\\t\\t\\tres = multiplication_modulo(res, b, mod);\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tbreak;\\n\\t\\t\\tdefault :\\n\\t\\t\\t\\tif (a == 1)\\n\\t\\t\\t\\t\\tres = 1;\\n\\t\\t\\t\\telse {\\n\\t\\t\\t\\t\\tfor (c = mod - 1, d = 2; d < mod && mod_pow(d, c >> 1, mod) != c; ++d);\\n\\t\\t\\t\\t\\tfor (e = 0; !(c & 1); ++e, c >>= 1);\\n\\t\\t\\t\\t\\tf = mod_pow(a, c, mod);\\n\\t\\t\\t\\t\\tb = mod_pow(d, c, mod);\\n\\t\\t\\t\\t\\tfor (h = 0, g = 0; h < e; h++) {\\n\\t\\t\\t\\t\\t\\td = mod_pow(b, g, mod);\\n\\t\\t\\t\\t\\t\\td = multiplication_modulo(d, f, mod);\\n\\t\\t\\t\\t\\t\\td = mod_pow(d, 1 << (e - 1 - h), mod);\\n\\t\\t\\t\\t\\t\\tif (d == mod - 1)\\n\\t\\t\\t\\t\\t\\t\\tg += 1 << h;\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\tf = mod_pow(a, (c + 1) >> 1, mod);\\n\\t\\t\\t\\t\\tb = mod_pow(b, g >> 1, mod);\\n\\t\\t\\t\\t\\tres = multiplication_modulo(f, b, mod);\\n\\t\\t\\t\\t}\\n\\t\\t}\\n\\treturn res;\\n}\\n\\n// return root such that (root * root) % mod congruent to n % mod.\\n// return 0 (the default value of a) if no solution to the congruence exists.\\nstatic unsigned tonelli_shanks_2(unsigned n, const unsigned mod) {\\n\\tunsigned a = 0, b = mod - 1, c, d = b, e = 0, f = 2, g;\\n\\tif (mod_pow(n, b >> 1, mod) == 1) {\\n\\t\\tfor (; !(d & 1); ++e, d >>= 1);\\n\\t\\tif (e == 1)\\n\\t\\t\\ta = mod_pow(n, (mod + 1) >> 2, mod);\\n\\t\\telse {\\n\\t\\t\\tfor (; b != mod_pow(f, b >> 1, mod); ++f);\\n\\t\\t\\tfor (b = mod_pow(f, d, mod), a = mod_pow(n, (d + 1) >> 1, mod), c = mod_pow(n, d, mod), g = e; c != 1; g = d) {\\n\\t\\t\\t\\tfor (d = 0, e = c, --g; e != 1 && d < g; ++d)\\n\\t\\t\\t\\t\\te = multiplication_modulo(e, e, mod);\\n\\t\\t\\t\\tfor (f = b, n = g - d; n--;)\\n\\t\\t\\t\\t\\tf = multiplication_modulo(f, f, mod);\\n\\t\\t\\t\\ta = multiplication_modulo(a, f, mod);\\n\\t\\t\\t\\tb = multiplication_modulo(f, f, mod);\\n\\t\\t\\t\\tc = multiplication_modulo(c, b, mod);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\treturn a;\\n}\\n\\n#include <assert.h>\\nint main() {\\n\\tunsigned n, mod, root ; /* root_2 = mod - root */\\n\\n\\tn = 27875, mod = 26371, root = tonelli_shanks_1(n, mod);\\n\\tassert(root == 14320); // 14320 * 14320 mod 26371 = 1504 and 1504 = 27875 mod 26371\\n\\n\\tn = 1111111111, mod = 1111111121, root = tonelli_shanks_1(n, mod);\\n\\tassert(root == 88664850);\\n\\n\\tn = 5258, mod = 3851, root = tonelli_shanks_1(n, mod);\\n\\tassert(root == 0); // no solution to the congruence exists.\\n}\\n\",\n \"language\": \"C\"\n },\n {\n \"code\": \"#include <cstdint>\\n#include <iostream>\\n#include <vector>\\n\\nstruct Pair {\\n\\tuint64_t n;\\n\\tuint64_t p;\\n};\\n\\nstruct Solution {\\n\\tuint64_t root1;\\n\\tuint64_t root2;\\n\\tbool is_square;\\n};\\n\\nuint64_t multiply_modulus(uint64_t a, uint64_t b, const uint64_t& modulus) {\\n a %= modulus; b %= modulus;\\n if ( b < a ) {\\n \\tuint64_t temp = a; a = b; b = temp;\\n }\\n\\n uint64_t result = 0;\\n while ( a > 0 ) {\\n if ( a % 2 == 1 ) {\\n \\tresult = ( result + b ) % modulus;\\n };\\n b = ( b << 1 ) % modulus;\\n a >>= 1;\\n }\\n return result;\\n}\\n\\nuint64_t power_modulus(uint64_t base, uint64_t exponent, const uint64_t& modulus) {\\n\\tif ( modulus == 1 ) {\\n\\t\\treturn 0;\\n\\t}\\n\\n\\tbase %= modulus;\\n\\tuint64_t result = 1;\\n\\twhile ( exponent > 0 ) {\\n\\t\\tif ( ( exponent & 1 ) == 1 ) {\\n\\t\\t\\tresult = multiply_modulus(result, base, modulus);\\n\\t\\t}\\n\\t\\tbase = multiply_modulus(base, base, modulus);\\n\\t\\texponent >>= 1;\\n\\t}\\n\\treturn result;\\n}\\n\\nuint64_t legendre(const uint64_t& a, const uint64_t& p) {\\n return power_modulus(a, ( p - 1 ) / 2, p);\\n}\\n\\nSolution tonelli_shanks(const uint64_t& n, const uint64_t& p) {\\n\\tif ( legendre(n, p) != 1 ) {\\n\\t\\treturn Solution(0, 0, false);\\n\\t}\\n\\n\\t// Factor out powers of 2 from p - 1\\n uint64_t q = p - 1;\\n uint64_t s = 0;\\n while ( q % 2 == 0 ) {\\n q /= 2;\\n s += 1;\\n }\\n\\n if ( s == 1 ) {\\n\\t uint64_t result = power_modulus(n, ( p + 1 ) / 4, p);\\n\\t return Solution(result, p - result, true);\\n }\\n\\n // Find a non-square z such as ( z | p ) = -1\\n uint64_t z = 2;\\n\\twhile ( legendre(z, p) != p - 1 ) {\\n\\t\\tz += 1;\\n }\\n\\n uint64_t c = power_modulus(z, q, p);\\n uint64_t t = power_modulus(n, q, p);\\n uint64_t m = s;\\n uint64_t result = power_modulus(n, ( q + 1 ) >> 1, p);\\n\\n while ( t != 1 ) {\\n uint64_t i = 1;\\n z = multiply_modulus(t, t, p);\\n while ( z != 1 && i < m - 1 ) {\\n i += 1;\\n z = multiply_modulus(z, z, p);\\n }\\n uint64_t b = power_modulus(c, 1 << ( m - i - 1 ), p);\\n c = multiply_modulus(b, b, p);\\n t = multiply_modulus(t, c, p);\\n m = i;\\n result = multiply_modulus(result, b, p);\\n }\\n return Solution(result, p - result, true);\\n}\\n\\nint main() {\\n\\tconst std::vector<Pair> tests = { Pair(10, 13), Pair(56, 101), Pair(1030, 1009), Pair(1032, 1009),\\n\\t\\tPair(44402, 100049), Pair(665820697, 1000000009), Pair(881398088036, 1000000000039) };\\n\\n\\tfor ( const Pair& test : tests ) {\\n\\t\\tSolution solution = tonelli_shanks(test.n, test.p);\\n\\t\\tstd::cout << \\\"n = \\\" << test.n << \\\", p = \\\" << test.p;\\n\\t\\tif ( solution.is_square == true ) {\\n\\t\\t\\tstd::cout << \\\" has solutions: \\\" << solution.root1 << \\\" and \\\" << solution.root2 << std::endl << std::endl;\\n\\t\\t} else {\\n\\t\\t\\tstd::cout << \\\" has no solutions because n is not a square modulo p\\\" << std::endl << std::endl;\\n\\t\\t}\\n\\t}\\n}\\n\",\n \"language\": \"C++\"\n },\n {\n \"code\": \"using System;\\nusing System.Collections.Generic;\\nusing System.Numerics;\\n\\nnamespace TonelliShanks {\\n class Solution {\\n private readonly BigInteger root1, root2;\\n private readonly bool exists;\\n\\n public Solution(BigInteger root1, BigInteger root2, bool exists) {\\n this.root1 = root1;\\n this.root2 = root2;\\n this.exists = exists;\\n }\\n\\n public BigInteger Root1() {\\n return root1;\\n }\\n\\n public BigInteger Root2() {\\n return root2;\\n }\\n\\n public bool Exists() {\\n return exists;\\n }\\n }\\n\\n class Program {\\n static Solution Ts(BigInteger n, BigInteger p) {\\n if (BigInteger.ModPow(n, (p - 1) / 2, p) != 1) {\\n return new Solution(0, 0, false);\\n }\\n\\n BigInteger q = p - 1;\\n BigInteger ss = 0;\\n while ((q & 1) == 0) {\\n ss = ss + 1;\\n q = q >> 1;\\n }\\n\\n if (ss == 1) {\\n BigInteger r1 = BigInteger.ModPow(n, (p + 1) / 4, p);\\n return new Solution(r1, p - r1, true);\\n }\\n\\n BigInteger z = 2;\\n while (BigInteger.ModPow(z, (p - 1) / 2, p) != p - 1) {\\n z = z + 1;\\n }\\n BigInteger c = BigInteger.ModPow(z, q, p);\\n BigInteger r = BigInteger.ModPow(n, (q + 1) / 2, p);\\n BigInteger t = BigInteger.ModPow(n, q, p);\\n BigInteger m = ss;\\n\\n while (true) {\\n if (t == 1) {\\n return new Solution(r, p - r, true);\\n }\\n BigInteger i = 0;\\n BigInteger zz = t;\\n while (zz != 1 && i < (m - 1)) {\\n zz = zz * zz % p;\\n i = i + 1;\\n }\\n BigInteger b = c;\\n BigInteger e = m - i - 1;\\n while (e > 0) {\\n b = b * b % p;\\n e = e - 1;\\n }\\n r = r * b % p;\\n c = b * b % p;\\n t = t * c % p;\\n m = i;\\n }\\n }\\n\\n static void Main(string[] args) {\\n List<Tuple<long, long>> pairs = new List<Tuple<long, long>>() {\\n new Tuple<long, long>(10, 13),\\n new Tuple<long, long>(56, 101),\\n new Tuple<long, long>(1030, 10009),\\n new Tuple<long, long>(1032, 10009),\\n new Tuple<long, long>(44402, 100049),\\n new Tuple<long, long>(665820697, 1000000009),\\n new Tuple<long, long>(881398088036, 1000000000039),\\n };\\n\\n foreach (var pair in pairs) {\\n Solution sol = Ts(pair.Item1, pair.Item2);\\n Console.WriteLine(\\\"n = {0}\\\", pair.Item1);\\n Console.WriteLine(\\\"p = {0}\\\", pair.Item2);\\n if (sol.Exists()) {\\n Console.WriteLine(\\\"root1 = {0}\\\", sol.Root1());\\n Console.WriteLine(\\\"root2 = {0}\\\", sol.Root2());\\n } else {\\n Console.WriteLine(\\\"No solution exists\\\");\\n }\\n Console.WriteLine();\\n }\\n\\n BigInteger bn = BigInteger.Parse(\\\"41660815127637347468140745042827704103445750172002\\\");\\n BigInteger bp = BigInteger.Pow(10, 50) + 577;\\n Solution bsol = Ts(bn, bp);\\n Console.WriteLine(\\\"n = {0}\\\", bn);\\n Console.WriteLine(\\\"p = {0}\\\", bp);\\n if (bsol.Exists()) {\\n Console.WriteLine(\\\"root1 = {0}\\\", bsol.Root1());\\n Console.WriteLine(\\\"root2 = {0}\\\", bsol.Root2());\\n } else {\\n Console.WriteLine(\\\"No solution exists\\\");\\n }\\n }\\n }\\n}\\n\",\n \"language\": \"C-sharp\"\n },\n {\n \"code\": \"(defn find-first\\n \\\" Finds first element of collection that satisifies predicate function pred \\\"\\n [pred coll]\\n (first (filter pred coll)))\\n\\n(defn modpow\\n \\\" b^e mod m (using Java which solves some cases the pure clojure method has to be modified to tackle--i.e. with large b & e and\\n calculation simplications when gcd(b, m) == 1 and gcd(e, m) == 1) \\\"\\n [b e m]\\n (.modPow (biginteger b) (biginteger e) (biginteger m)))\\n\\n(defn legendre [a p]\\n (modpow a (quot (dec p) 2) p)\\n)\\n\\n(defn tonelli [n p]\\n \\\" Following Wikipedia https://en.wikipedia.org/wiki/Tonelli%E2%80%93Shanks_algorithm \\\"\\n (assert (= (legendre n p) 1) \\\"not a square (mod p)\\\")\\n (loop [q (dec p) ; Step 1 in Wikipedia\\n s 0]\\n (if (zero? (rem q 2))\\n (recur (quot q 2) (inc s))\\n (if (= s 1)\\n (modpow n (quot (inc p) 4) p)\\n (let [z (find-first #(= (dec p) (legendre % p)) (range 2 p))] ; Step 2 in Wikipedia\\n (loop [\\n M s\\n c (modpow z q p)\\n t (modpow n q p)\\n R (modpow n (quot (inc q) 2) p)]\\n (if (= t 1)\\n R\\n (let [i (long (find-first #(= 1 (modpow t (bit-shift-left 1 %) p)) (range 1 M))) ; Step 3\\n b (modpow c (bit-shift-left 1 (- M i 1)) p)\\n M i\\n c (modpow b 2 p)\\n t (rem (* t c) p)\\n R (rem (* R b) p)]\\n (recur M c t R)\\n )\\n )\\n )\\n )\\n )\\n )\\n )\\n )\\n\\n\\n; Testing--using Python examples\\n(doseq [[n p] [[10, 13], [56, 101], [1030, 10009], [44402, 100049],\\n [665820697, 1000000009], [881398088036, 1000000000039],\\n [41660815127637347468140745042827704103445750172002, 100000000000000000000000000000000000000000000000577]]\\n :let [r (tonelli n p)]]\\n (println (format \\\"n: %5d p: %d \\\\n\\\\troots: %5d %5d\\\" (biginteger n) (biginteger p) (biginteger r) (biginteger (- p r)))))\\n\",\n \"language\": \"Clojure\"\n },\n {\n \"code\": \"import std.bigint;\\nimport std.stdio;\\nimport std.typecons;\\n\\nalias Pair = Tuple!(long, \\\"n\\\", long, \\\"p\\\");\\n\\nenum BIGZERO = BigInt(\\\"0\\\");\\nenum BIGONE = BigInt(\\\"1\\\");\\nenum BIGTWO = BigInt(\\\"2\\\");\\nenum BIGTEN = BigInt(\\\"10\\\");\\n\\nstruct Solution {\\n BigInt root1, root2;\\n bool exists;\\n}\\n\\n/// https://en.wikipedia.org/wiki/Modular_exponentiation#Right-to-left_binary_method\\nBigInt modPow(BigInt b, BigInt e, BigInt n) {\\n if (n == 1) return BIGZERO;\\n BigInt result = 1;\\n b = b % n;\\n while (e > 0) {\\n if (e % 2 == 1) {\\n result = (result * b) % n;\\n }\\n e >>= 1;\\n b = (b*b) % n;\\n }\\n return result;\\n}\\n\\nSolution ts(long n, long p) {\\n return ts(BigInt(n), BigInt(p));\\n}\\n\\nSolution ts(BigInt n, BigInt p) {\\n auto powMod(BigInt a, BigInt e) {\\n return a.modPow(e, p);\\n }\\n\\n auto ls(BigInt a) {\\n return powMod(a, (p-1)/2);\\n }\\n\\n if (ls(n) != 1) return Solution(BIGZERO, BIGZERO, false);\\n auto q = p - 1;\\n auto ss = BIGZERO;\\n while ((q & 1) == 0) {\\n ss = ss + 1;\\n q = q >> 1;\\n }\\n\\n if (ss == BIGONE) {\\n auto r1 = powMod(n, (p + 1) / 4);\\n return Solution(r1, p - r1, true);\\n }\\n\\n auto z = BIGTWO;\\n while (ls(z) != p - 1) z = z + 1;\\n auto c = powMod(z, q);\\n auto r = powMod(n, (q + 1) / 2);\\n auto t = powMod(n, q);\\n auto m = ss;\\n\\n while (true) {\\n if (t == 1) return Solution(r, p - r, true);\\n auto i = BIGZERO;\\n auto zz = t;\\n while (zz != 1 && i < m - 1) {\\n zz = zz * zz % p;\\n i = i + 1;\\n }\\n auto b = c;\\n auto e = m - i - 1;\\n while (e > 0) {\\n b = b * b % p;\\n e = e - 1;\\n }\\n r = r * b % p;\\n c = b * b % p;\\n t = t * c % p;\\n m = i;\\n }\\n}\\n\\nvoid main() {\\n auto pairs = [\\n Pair( 10L, 13L),\\n Pair( 56L, 101L),\\n Pair( 1_030L, 10_009L),\\n Pair( 1_032L, 10_009L),\\n Pair( 44_402L, 100_049L),\\n Pair( 665_820_697L, 1_000_000_009L),\\n Pair(881_398_088_036L, 1_000_000_000_039L),\\n ];\\n\\n foreach (pair; pairs) {\\n auto sol = ts(pair.n, pair.p);\\n\\n writeln(\\\"n = \\\", pair.n);\\n writeln(\\\"p = \\\", pair.p);\\n if (sol.exists) {\\n writeln(\\\"root1 = \\\", sol.root1);\\n writeln(\\\"root2 = \\\", sol.root2);\\n }\\n else writeln(\\\"No solution exists\\\");\\n writeln();\\n }\\n\\n auto bn = BigInt(\\\"41660815127637347468140745042827704103445750172002\\\");\\n auto bp = BIGTEN ^^ 50 + 577L;\\n auto sol = ts(bn, bp);\\n writeln(\\\"n = \\\", bn);\\n writeln(\\\"p = \\\", bp);\\n if (sol.exists) {\\n writeln(\\\"root1 = \\\", sol.root1);\\n writeln(\\\"root2 = \\\", sol.root2);\\n }\\n else writeln(\\\"No solution exists\\\");\\n}\\n\",\n \"language\": \"D\"\n },\n {\n \"code\": \"(require 'bigint)\\n;; test equality mod p\\n(define-syntax-rule (mod= a b p)\\n\\t (zero? (% (- a b) p)))\\n;; assign mod p\\n(define-syntax-rule (mod:≡ s v p)\\n\\t(set! s (% v p)))\\n\\n(define (Legendre a p)\\n\\t (powmod a (/ (1- p) 2) p))\\n\\n(define (Tonelli n p)\\n (unless (= 1 (Legendre n p)) (error \\\"not a square (mod p)\\\" (list n p)))\\n (define q (1- p))\\n (define s 0)\\n\\t(while (even? q)\\n\\t\\t(/= q 2)\\n\\t\\t(++ s))\\n\\t(if (= s 1) (powmod n (/ (1+ p) 4) p)\\n\\t(begin\\n\\t(define z\\n\\t\\t(for ((z (in-range 2 p)))\\n\\t\\t #:break (= (1- p) (Legendre z p)) => z ))\\n\\n\\t(define c (powmod z q p))\\n\\t(define r (powmod n (/ (1+ q) 2) p))\\n\\t(define t (powmod n q p))\\n\\t(define m s)\\n\\t(define t2 0)\\n\\t(while #t\\n\\t\\t#:break (mod= 1 t p) => r\\n\\t\\t(mod:≡ t2 (* t t) p)\\n\\t\\t(define i\\n\\t\\t\\t(for ((i (in-range 1 m)))\\n\\t\\t\\t\\t#:break (mod= t2 1 p) => i\\n\\t\\t\\t\\t(mod:≡ t2 (* t2 t2) p)))\\n\\t\\t(define b (powmod c (expt 2 (- m i 1)) p))\\n\\t\\t(mod:≡ r (* r b) p)\\n\\t\\t(mod:≡ c (* b b) p)\\n\\t\\t(mod:≡ t (* t c) p)\\n\\t\\t(set! m i)))))\\n\",\n \"language\": \"EchoLisp\"\n },\n {\n \"code\": \"' version 11-04-2017\\n' compile with: fbc -s console\\n' maximum for p is 17 digits to be on the save side\\n\\n' TRUE/FALSE are built-in constants since FreeBASIC 1.04\\n' But we have to define them for older versions.\\n#Ifndef TRUE\\n #Define FALSE 0\\n #Define TRUE Not FALSE\\n#EndIf\\n\\nFunction mul_mod(a As ULongInt, b As ULongInt, modulus As ULongInt) As ULongInt\\n ' returns a * b mod modulus\\n Dim As ULongInt x, y = a Mod modulus\\n\\n While b > 0\\n If (b And 1) = 1 Then\\n x = (x + y) Mod modulus\\n End If\\n y = (y Shl 1) Mod modulus\\n b = b Shr 1\\n Wend\\n\\n Return x\\n\\nEnd Function\\n\\nFunction pow_mod(b As ULongInt, power As ULongInt, modulus As ULongInt) As ULongInt\\n ' returns b ^ power mod modulus\\n Dim As ULongInt x = 1\\n\\n While power > 0\\n If (power And 1) = 1 Then\\n ' x = (x * b) Mod modulus\\n x = mul_mod(x, b, modulus)\\n End If\\n ' b = (b * b) Mod modulus\\n b = mul_mod(b, b, modulus)\\n power = power Shr 1\\n Wend\\n\\n Return x\\n\\nEnd Function\\n\\nFunction Isprime(n As ULongInt, k As Long) As Long\\n ' miller-rabin prime test\\n If n > 9223372036854775808ull Then ' limit 2^63, pow_mod/mul_mod can't handle bigger numbers\\n Print \\\"number is to big, program will end\\\"\\n Sleep\\n End\\n End If\\n\\n ' 2 is a prime, if n is smaller then 2 or n is even then n = composite\\n If n = 2 Then Return TRUE\\n If (n < 2) OrElse ((n And 1) = 0) Then Return FALSE\\n\\n Dim As ULongInt a, x, n_one = n - 1, d = n_one\\n Dim As UInteger s\\n\\n While (d And 1) = 0\\n d = d Shr 1\\n s = s + 1\\n Wend\\n\\n While k > 0\\n k = k - 1\\n a = Int(Rnd * (n -2)) +2 ' 2 <= a < n\\n x = pow_mod(a, d, n)\\n If (x = 1) Or (x = n_one) Then Continue While\\n For r As Integer = 1 To s -1\\n x = pow_mod(x, 2, n)\\n If x = 1 Then Return FALSE\\n If x = n_one Then Continue While\\n Next\\n If x <> n_one Then Return FALSE\\n Wend\\n Return TRUE\\n\\nEnd Function\\n\\nFunction legendre_symbol (a As LongInt, p As LongInt) As LongInt\\n\\n Dim As LongInt x = pow_mod(a, ((p -1) \\\\ 2), p)\\n If p -1 = x Then\\n Return x - p\\n Else\\n Return x\\n End If\\n\\nEnd Function\\n\\n' ------=< MAIN >=------\\n\\nDim As LongInt b, c, i, k, m, n, p, q, r, s, t, z\\n\\nFor k = 1 To 7\\n Read n, p\\n Print \\\"Find solution for n =\\\"; n; \\\" and p =\\\";p\\n\\n If legendre_symbol(n, p) <> 1 Then\\n Print n;\\\" is not a quadratic residue\\\"\\n Print\\n Continue For\\n End If\\n\\n If p = 2 OrElse Isprime(p, 15) = FALSE Then\\n Print p;\\\" is not a odd prime\\\"\\n Print\\n Continue For\\n End If\\n\\n s = 0 : q = p -1\\n Do\\n s += 1\\n q \\\\= 2\\n Loop Until (q And 1) = 1\\n\\n If s = 1 And (p Mod 4) = 3 Then\\n r = pow_mod(n, ((p +1) \\\\ 4), p)\\n Print \\\"Solution found:\\\"; r; \\\" and\\\"; p - r\\n Print\\n Continue For\\n End If\\n\\n z = 1\\n Do\\n z += 1\\n Loop Until legendre_symbol(z, p) = -1\\n c = pow_mod(z, q, p)\\n r = pow_mod(n, (q +1) \\\\ 2, p)\\n t = pow_mod(n, q, p)\\n m = s\\n\\n Do\\n i = 0\\n If (t Mod p) = 1 Then\\n Print \\\"Solution found:\\\"; r; \\\" and\\\"; p - r\\n Print\\n Continue For\\n End If\\n\\n Do\\n i += 1\\n If i >= m Then Continue For\\n Loop Until pow_mod(t, 2 ^ i, p) = 1\\n b = pow_mod(c, (2 ^ (m - i -1)), p)\\n r = mul_mod(r, b, p)\\n c = mul_mod(b, b, p)\\n t = mul_mod(t, c, p)' t = t * b ^ 2\\n m = i\\n Loop\\n\\nNext\\n\\nData 10, 13, 56, 101, 1030, 10009, 1032, 10009, 44402, 100049\\nData 665820697, 1000000009, 881398088036, 1000000000039\\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\": \"' version 12-04-2017\\n' compile with: fbc -s console\\n\\n#Include Once \\\"gmp.bi\\\"\\n\\nData \\\"10\\\", \\\"13\\\", \\\"56\\\", \\\"101\\\", \\\"1030\\\", \\\"10009\\\", \\\"1032\\\", \\\"10009\\\"\\nData \\\"44402\\\", \\\"100049\\\", \\\"665820697\\\", \\\"1000000009\\\"\\nData \\\"881398088036\\\", \\\"1000000000039\\\"\\nData \\\"41660815127637347468140745042827704103445750172002\\\" ' p = 10^50 + 577\\n\\n' ------=< MAIN >=------\\n\\nDim As uLong k\\nDim As ZString Ptr zstr\\nDim As String n_str, p_str\\n\\nDim As Mpz_ptr b, c, i, m, n, p, q, r, s, t, z, tmp\\nb = Allocate(Len(__Mpz_struct)) : Mpz_init(b)\\nc = Allocate(Len(__Mpz_struct)) : Mpz_init(c)\\ni = Allocate(Len(__Mpz_struct)) : Mpz_init(i)\\nm = Allocate(Len(__Mpz_struct)) : Mpz_init(m)\\nn = Allocate(Len(__Mpz_struct)) : Mpz_init(n)\\np = Allocate(Len(__Mpz_struct)) : Mpz_init(p)\\nq = Allocate(Len(__Mpz_struct)) : Mpz_init(q)\\nr = Allocate(Len(__Mpz_struct)) : Mpz_init(r)\\ns = Allocate(Len(__Mpz_struct)) : Mpz_init(s)\\nt = Allocate(Len(__Mpz_struct)) : Mpz_init(t)\\nz = Allocate(Len(__Mpz_struct)) : Mpz_init(z)\\ntmp = Allocate(Len(__Mpz_struct)) : Mpz_init(tmp)\\n\\nFor k = 1 To 8\\n Read n_str\\n Mpz_set_str(n, n_str, 10)\\n If k < 8 Then\\n Read p_str\\n Mpz_set_str(p, p_str, 10)\\n Else\\n p_str = \\\"10^50 + 577\\\"\\n Mpz_set_str(p, \\\"1\\\" + String(50, \\\"0\\\"), 10)\\n Mpz_add_ui(p, p, 577)\\n End If\\n\\n Print \\\"Find solution for n = \\\"; n_str; \\\" and p = \\\"; p_str\\n\\n If Mpz_legendre(n, p) <> 1 Then\\n Print n_str; \\\" is not a quadratic residue\\\"\\n Print\\n Continue For\\n End If\\n\\n If Mpz_tstbit(p, 0) = 0 OrElse Mpz_probab_prime_p(p, 20) = 0 Then\\n Print p_str; \\\"is not a odd prime\\\"\\n Print\\n Continue For\\n End If\\n\\n Mpz_set_ui(s, 0) : Mpz_set(q, p) : Mpz_sub_ui(q, q, 1) ' q = p -1\\n Do\\n Mpz_add_ui(s, s, 1)\\n Mpz_fdiv_q_2exp(q, q, 1)\\n Loop Until Mpz_tstbit(q, 0) = 1\\n\\n If Mpz_cmp_ui(s, 1) = 0 Then\\n If Mpz_tstbit(p, 1) = 1 Then\\n Mpz_add_ui(tmp, p, 1)\\n Mpz_fdiv_q_2exp(tmp, tmp, 2) ' tmp = p +1 \\\\ 4\\n Mpz_powm(r, n, tmp, p)\\n zstr = Mpz_get_str(0, 10, r)\\n Print \\\"Solution found: \\\"; *zstr;\\n Mpz_sub(r, p, r)\\n zstr = Mpz_get_str(0, 10, r)\\n Print \\\" and \\\"; *zstr\\n Print\\n Continue For\\n End If\\n End If\\n\\n Mpz_set_ui(z, 1)\\n Do\\n Mpz_add_ui(z, z, 1)\\n Loop Until Mpz_legendre(z, p) = -1\\n Mpz_powm(c, z, q, p)\\n Mpz_add_ui(tmp, q, 1)\\n Mpz_fdiv_q_2exp(tmp, tmp, 1)\\n Mpz_powm(r, n, tmp, p)\\n Mpz_powm(t, n, q, p)\\n Mpz_set(m, s)\\n\\n Do\\n Mpz_set_ui(i, 0)\\n Mpz_mod(tmp, t, p)\\n If Mpz_cmp_ui(tmp, 1) = 0 Then\\n zstr = Mpz_get_str(0, 10, r)\\n Print \\\"Solution found: \\\"; *zstr;\\n Mpz_sub(r, p, r)\\n zstr = Mpz_get_str(0, 10, r)\\n Print \\\" and \\\"; *zstr\\n Print\\n Continue For\\n End If\\n\\n Mpz_set_ui(q, 1)\\n Do\\n Mpz_add_ui(i, i, 1)\\n If Mpz_cmp(i, m) >= 0 Then\\n Continue For\\n end if\\n Mpz_mul_ui(q, q, 2) ' q = 2^i\\n Mpz_powm(tmp, t, q, p)\\n Loop Until Mpz_cmp_ui(tmp, 1) = 0\\n\\n Mpz_set_ui(q, 2)\\n Mpz_sub(tmp, m, i) : Mpz_sub_ui(tmp, tmp, 1) : Mpz_powm(tmp, q, tmp, p)\\n Mpz_powm(b, c, tmp, p)\\n Mpz_mul(r, r, b) : Mpz_mod(r, r, p)\\n Mpz_mul(tmp, b, b) : Mpz_mod(c, tmp, p)\\n Mpz_mul(tmp, t, c) : Mpz_mod(t, tmp, p)\\n Mpz_set(m, i)\\n Loop\\n\\nNext\\n\\nMpz_clear(b) : Mpz_clear(c) : Mpz_clear(i) : Mpz_clear(m)\\nMpz_clear(n) : Mpz_clear(p) : Mpz_clear(q) : Mpz_clear(r)\\nMpz_clear(s) : Mpz_clear(t) : Mpz_clear(z) : Mpz_clear(tmp)\\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\\n// Arguments n, p as described in WP\\n// If Legendre symbol != 1, ok return is false. Otherwise ok return is true,\\n// R1 is WP return value R and for convenience R2 is p-R1.\\nfunc ts(n, p int) (R1, R2 int, ok bool) {\\n // a^e mod p\\n powModP := func(a, e int) int {\\n s := 1\\n for ; e > 0; e-- {\\n s = s * a % p\\n }\\n return s\\n }\\n // Legendre symbol, returns 1, 0, or -1 mod p -- that's 1, 0, or p-1.\\n ls := func(a int) int {\\n return powModP(a, (p-1)/2)\\n }\\n // argument validation\\n if ls(n) != 1 {\\n return 0, 0, false\\n }\\n // WP step 1, factor out powers two.\\n // variables Q, S named as at WP.\\n Q := p - 1\\n S := 0\\n for Q&1 == 0 {\\n S++\\n Q >>= 1\\n }\\n // WP step 1, direct solution\\n if S == 1 {\\n R1 = powModP(n, (p+1)/4)\\n return R1, p - R1, true\\n }\\n // WP step 2, select z, assign c\\n z := 2\\n for ; ls(z) != p-1; z++ {\\n }\\n c := powModP(z, Q)\\n // WP step 3, assign R, t, M\\n R := powModP(n, (Q+1)/2)\\n t := powModP(n, Q)\\n M := S\\n // WP step 4, loop\\n for {\\n // WP step 4.1, termination condition\\n if t == 1 {\\n return R, p - R, true\\n }\\n // WP step 4.2, find lowest i...\\n i := 0\\n for z := t; z != 1 && i < M-1; {\\n z = z * z % p\\n i++\\n }\\n // WP step 4.3, using a variable b, assign new values of R, t, c, M\\n b := c\\n for e := M - i - 1; e > 0; e-- {\\n b = b * b % p\\n }\\n R = R * b % p\\n c = b * b % p // more convenient to compute c before t\\n t = t * c % p\\n M = i\\n }\\n}\\n\\nfunc main() {\\n fmt.Println(ts(10, 13))\\n fmt.Println(ts(56, 101))\\n fmt.Println(ts(1030, 10009))\\n fmt.Println(ts(1032, 10009))\\n fmt.Println(ts(44402, 100049))\\n}\\n\",\n \"language\": \"Go\"\n },\n {\n \"code\": \"package main\\n\\nimport (\\n \\\"fmt\\\"\\n \\\"math/big\\\"\\n)\\n\\nfunc ts(n, p big.Int) (R1, R2 big.Int, ok bool) {\\n if big.Jacobi(&n, &p) != 1 {\\n return\\n }\\n var one, Q big.Int\\n one.SetInt64(1)\\n Q.Sub(&p, &one)\\n S := 0\\n for Q.Bit(0) == 0 {\\n S++\\n Q.Rsh(&Q, 1)\\n }\\n if S == 1 {\\n R1.Exp(&n, R1.Rsh(R1.Add(&p, &one), 2), &p)\\n R2.Sub(&p, &R1)\\n return R1, R2, true\\n }\\n var z, c big.Int\\n for z.SetInt64(2); big.Jacobi(&z, &p) != -1; z.Add(&z, &one) {\\n }\\n c.Exp(&z, &Q, &p)\\n var R, t big.Int\\n R.Exp(&n, R.Rsh(R.Add(&Q, &one), 1), &p)\\n t.Exp(&n, &Q, &p)\\n M := S\\n for {\\n if t.Cmp(&one) == 0 {\\n R2.Sub(&p, &R)\\n return R, R2, true\\n }\\n i := 0\\n // reuse z as a scratch variable\\n for z.Set(&t); z.Cmp(&one) != 0 && i < M-1; {\\n z.Mod(z.Mul(&z, &z), &p)\\n i++\\n }\\n // and instead of a new scratch variable b, continue using z\\n z.Set(&c)\\n for e := M - i - 1; e > 0; e-- {\\n z.Mod(z.Mul(&z, &z), &p)\\n }\\n R.Mod(R.Mul(&R, &z), &p)\\n c.Mod(c.Mul(&z, &z), &p)\\n t.Mod(t.Mul(&t, &c), &p)\\n M = i\\n }\\n}\\n\\nfunc main() {\\n var n, p big.Int\\n n.SetInt64(665820697)\\n p.SetInt64(1000000009)\\n R1, R2, ok := ts(n, p)\\n fmt.Println(&R1, &R2, ok)\\n\\n n.SetInt64(881398088036)\\n p.SetInt64(1000000000039)\\n R1, R2, ok = ts(n, p)\\n fmt.Println(&R1, &R2, ok)\\n n.SetString(\\\"41660815127637347468140745042827704103445750172002\\\", 10)\\n p.SetString(\\\"100000000000000000000000000000000000000000000000577\\\", 10)\\n R1, R2, ok = ts(n, p)\\n fmt.Println(&R1)\\n fmt.Println(&R2)\\n}\\n\",\n \"language\": \"Go\"\n },\n {\n \"code\": \"package main\\n\\nimport (\\n \\\"fmt\\\"\\n \\\"math/big\\\"\\n)\\n\\nfunc main() {\\n var n, p, R1, R2 big.Int\\n n.SetInt64(665820697)\\n p.SetInt64(1000000009)\\n R1.ModSqrt(&n, &p)\\n R2.Sub(&p, &R1)\\n fmt.Println(&R1, &R2)\\n\\n n.SetInt64(881398088036)\\n p.SetInt64(1000000000039)\\n R1.ModSqrt(&n, &p)\\n R2.Sub(&p, &R1)\\n fmt.Println(&R1, &R2)\\n\\n n.SetString(\\\"41660815127637347468140745042827704103445750172002\\\", 10)\\n p.SetString(\\\"100000000000000000000000000000000000000000000000577\\\", 10)\\n R1.ModSqrt(&n, &p)\\n R2.Sub(&p, &R1)\\n fmt.Println(&R1)\\n fmt.Println(&R2)\\n}\\n\",\n \"language\": \"Go\"\n },\n {\n \"code\": \"import Data.List (genericTake, genericLength)\\nimport Data.Bits (shiftR)\\n\\npowMod :: Integer -> Integer -> Integer -> Integer\\npowMod m b e = go b e 1\\n where\\n go b e r\\n | e == 0 = r\\n | odd e = go ((b*b) `mod` m) (e `div` 2) ((r*b) `mod` m)\\n | even e = go ((b*b) `mod` m) (e `div` 2) r\\n\\nlegendre :: Integer -> Integer -> Integer\\nlegendre a p = powMod p a ((p - 1) `div` 2)\\n\\ntonelli :: Integer -> Integer -> Maybe (Integer, Integer)\\ntonelli n p | legendre n p /= 1 = Nothing\\ntonelli n p =\\n let s = length $ takeWhile even $ iterate (`div` 2) (p-1)\\n q = shiftR (p-1) s\\n in if s == 1\\n then let r = powMod p n ((p+1) `div` 4)\\n in Just (r, p - r)\\n else let z = (2 +) . genericLength\\n $ takeWhile (\\\\i -> p - 1 /= legendre i p)\\n $ [2..p-1]\\n in loop s\\n ( powMod p z q )\\n ( powMod p n $ (q+1) `div` 2 )\\n ( powMod p n q )\\n where\\n loop m c r t\\n | (t - 1) `mod` p == 0 = Just (r, p - r)\\n | otherwise =\\n let i = (1 +) . genericLength . genericTake (m - 2)\\n $ takeWhile (\\\\t2 -> (t2 - 1) `mod` p /= 0)\\n $ iterate (\\\\t2 -> (t2*t2) `mod` p)\\n $ (t*t) `mod` p\\n b = powMod p c (2^(m - i - 1))\\n r' = (r*b) `mod` p\\n c' = (b*b) `mod` p\\n t' = (t*c') `mod` p\\n in loop i c' r' t'\\n\",\n \"language\": \"Haskell\"\n },\n {\n \"code\": \"leg=: dyad define\\n x (y&|)@^ (y-1)%2\\n)\\n\\ntosh=:dyad define\\n assert. 1=1 p: y [ 'y must be prime'\\n assert. 1=x leg y [ 'x must be square mod y'\\n pow=. y&|@^\\n if. 1=m=. {.1 q: y-1 do.\\n r=. x pow (y+1)%4\\n else.\\n z=. 1x while. 1>: z leg y do. z=.z+1 end.\\n c=. z pow q=. (y-1)%2^m\\n r=. x pow (q+1)%2\\n t=. x pow q\\n while. t~:1 do.\\n n=. t\\n i=. 0\\n whilst. 1~:n do.\\n n=. n pow 2\\n i=. i+1\\n end.\\n r=. y|r*b=. c pow 2^m-i+1\\n m=. i\\n t=. y|t*c=. b pow 2\\n end.\\n end.\\n y|(,-)r\\n)\\n\",\n \"language\": \"J\"\n },\n {\n \"code\": \" 10 tosh 13\\n7 6\\n 56 tosh 101\\n37 64\\n 1030 tosh 10009\\n1632 8377\\n 1032 tosh 10009\\n|assertion failure: tosh\\n| 1=x leg y['x must be square mod y'\\n 44402 tosh 100049\\n30468 69581\\n 665820697x tosh 1000000009x\\n378633312 621366697\\n 881398088036 tosh 1000000000039x\\n791399408049 208600591990\\n 41660815127637347468140745042827704103445750172002x tosh (10^50x)+577\\n32102985369940620849741983987300038903725266634508 67897014630059379150258016012699961096274733366069\\n\",\n \"language\": \"J\"\n },\n {\n \"code\": \"import java.math.BigInteger;\\nimport java.util.List;\\nimport java.util.Map;\\nimport java.util.function.BiFunction;\\nimport java.util.function.Function;\\n\\npublic class TonelliShanks {\\n private static final BigInteger ZERO = BigInteger.ZERO;\\n private static final BigInteger ONE = BigInteger.ONE;\\n private static final BigInteger TEN = BigInteger.TEN;\\n private static final BigInteger TWO = BigInteger.valueOf(2);\\n private static final BigInteger FOUR = BigInteger.valueOf(4);\\n\\n private static class Solution {\\n private BigInteger root1;\\n private BigInteger root2;\\n private boolean exists;\\n\\n Solution(BigInteger root1, BigInteger root2, boolean exists) {\\n this.root1 = root1;\\n this.root2 = root2;\\n this.exists = exists;\\n }\\n }\\n\\n private static Solution ts(Long n, Long p) {\\n return ts(BigInteger.valueOf(n), BigInteger.valueOf(p));\\n }\\n\\n private static Solution ts(BigInteger n, BigInteger p) {\\n BiFunction<BigInteger, BigInteger, BigInteger> powModP = (BigInteger a, BigInteger e) -> a.modPow(e, p);\\n Function<BigInteger, BigInteger> ls = (BigInteger a) -> powModP.apply(a, p.subtract(ONE).divide(TWO));\\n\\n if (!ls.apply(n).equals(ONE)) return new Solution(ZERO, ZERO, false);\\n\\n BigInteger q = p.subtract(ONE);\\n BigInteger ss = ZERO;\\n while (q.and(ONE).equals(ZERO)) {\\n ss = ss.add(ONE);\\n q = q.shiftRight(1);\\n }\\n\\n if (ss.equals(ONE)) {\\n BigInteger r1 = powModP.apply(n, p.add(ONE).divide(FOUR));\\n return new Solution(r1, p.subtract(r1), true);\\n }\\n\\n BigInteger z = TWO;\\n while (!ls.apply(z).equals(p.subtract(ONE))) z = z.add(ONE);\\n BigInteger c = powModP.apply(z, q);\\n BigInteger r = powModP.apply(n, q.add(ONE).divide(TWO));\\n BigInteger t = powModP.apply(n, q);\\n BigInteger m = ss;\\n\\n while (true) {\\n if (t.equals(ONE)) return new Solution(r, p.subtract(r), true);\\n BigInteger i = ZERO;\\n BigInteger zz = t;\\n while (!zz.equals(BigInteger.ONE) && i.compareTo(m.subtract(ONE)) < 0) {\\n zz = zz.multiply(zz).mod(p);\\n i = i.add(ONE);\\n }\\n BigInteger b = c;\\n BigInteger e = m.subtract(i).subtract(ONE);\\n while (e.compareTo(ZERO) > 0) {\\n b = b.multiply(b).mod(p);\\n e = e.subtract(ONE);\\n }\\n r = r.multiply(b).mod(p);\\n c = b.multiply(b).mod(p);\\n t = t.multiply(c).mod(p);\\n m = i;\\n }\\n }\\n\\n public static void main(String[] args) {\\n List<Map.Entry<Long, Long>> pairs = List.of(\\n Map.entry(10L, 13L),\\n Map.entry(56L, 101L),\\n Map.entry(1030L, 10009L),\\n Map.entry(1032L, 10009L),\\n Map.entry(44402L, 100049L),\\n Map.entry(665820697L, 1000000009L),\\n Map.entry(881398088036L, 1000000000039L)\\n );\\n\\n for (Map.Entry<Long, Long> pair : pairs) {\\n Solution sol = ts(pair.getKey(), pair.getValue());\\n System.out.printf(\\\"n = %s\\\\n\\\", pair.getKey());\\n System.out.printf(\\\"p = %s\\\\n\\\", pair.getValue());\\n if (sol.exists) {\\n System.out.printf(\\\"root1 = %s\\\\n\\\", sol.root1);\\n System.out.printf(\\\"root2 = %s\\\\n\\\", sol.root2);\\n } else {\\n System.out.println(\\\"No solution exists\\\");\\n }\\n System.out.println();\\n }\\n\\n BigInteger bn = new BigInteger(\\\"41660815127637347468140745042827704103445750172002\\\");\\n BigInteger bp = TEN.pow(50).add(BigInteger.valueOf(577));\\n Solution sol = ts(bn, bp);\\n System.out.printf(\\\"n = %s\\\\n\\\", bn);\\n System.out.printf(\\\"p = %s\\\\n\\\", bp);\\n if (sol.exists) {\\n System.out.printf(\\\"root1 = %s\\\\n\\\", sol.root1);\\n System.out.printf(\\\"root2 = %s\\\\n\\\", sol.root2);\\n } else {\\n System.out.println(\\\"No solution exists\\\");\\n }\\n }\\n}\\n\",\n \"language\": \"Java\"\n },\n {\n \"code\": \"include \\\"rc-modular-exponentiation\\\"; # see remark above\\n\\n# 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):\\n . as $i\\n | ($i % $j) as $mod\\n | ($i - $mod) / $j ;\\n\\ndef Solution(a;b;c):\\n {\\\"root1\\\": a, \\\"root2\\\": b, \\\"exists\\\": c};\\n\\n# pretty print a Solution\\ndef pp:\\n if .exists\\n then \\\"root1 = \\\\(.root1)\\\",\\n \\\"root2 = \\\\(.root2)\\\"\\n else \\\"No solution exists\\\"\\n end;\\n\\n# Tonelli-Shanks\\ndef ts($n; $p):\\n def powModP($a; $e): $a | modPow($e; $p);\\n\\n def ls($a): powModP($a; ($p - 1) | idivide(2));\\n\\n if ls($n) != 1 then Solution(0; 0; false)\\n else { q: ($p - 1), ss: 0}\\n | until (.q % 2 != 0;\\n .ss += 1\\n | .q |= idivide(2) )\\n | if .ss == 1\\n then powModP(n; ($p+1) | idivide(4)) as $r1\\n | Solution($r1; $p - $r1; true)\\n else .z = 2\\n | until ( ls(.z) == ($p - 1); .z += 1 )\\n | .c = powModP(.z; .q)\\n | .r = powModP($n; (.q+1) | idivide(2))\\n | .t = powModP($n; .q)\\n | .m = .ss\\n | until (.emit;\\n if .t == 1 then .emit = Solution(.r; $p - .r; true)\\n else .i = 0\\n | .zz = .t\\n | until (.zz == 1 or .i >= (.m - 1);\\n .zz = (.zz * .zz) % p\\n | .i += 1 )\\n | .b = .c\\n | .e = .m - (1 + .i)\\n | until (.e <= 0;\\n .b = (.b * .b) % $p\\n | .e += -1 )\\n | .r = (.r * .b) % $p\\n | .c = (.b * .b) % $p\\n | .t = (.t * .c) % $p\\n | .m = .i\\n\\t end )\\n | .emit\\n end\\n end;\\n\\ndef pairs: [\\n [10, 13], [56, 101], [1030, 10009], [1032, 10009], [44402, 100049],\\n [665820697, 1000000009], [881398088036, 1000000000039]\\n];\\n\\ndef task:\\n pairs[] as [$n, $p]\\n | ts($n; $p) as $sol\\n | \\\"n = \\\\($n)\\\",\\n \\\"p = \\\\($p)\\\",\\n ($sol | pp),\\n \\\"\\\";\\n\\ndef task2:\\n def bn: 41660815127637347468140745042827704103445750172002;\\n def bp: (10 | power(50)) + 577;\\n ts(bn; bp) as $bsol\\n | \\\"n = \\\\(bn)\\\",\\n \\\"p = \\\\(bp)\\\",\\n ( $bsol | pp );\\n\\ntask, task2\\n\",\n \"language\": \"Jq\"\n },\n {\n \"code\": \"module TonelliShanks\\n\\nlegendre(a, p) = powermod(a, (p - 1) ÷ 2, p)\\n\\nfunction solve(n::T, p::T) where T <: Union{Int, Int128, BigInt}\\n legendre(n, p) != 1 && throw(ArgumentError(\\\"$n not a square (mod $p)\\\"))\\n local q::T = p - one(p)\\n local s::T = 0\\n while iszero(q % 2)\\n q ÷= 2\\n s += one(s)\\n end\\n if s == one(s)\\n r = powermod(n, (p + 1) >> 2, p)\\n return r, p - r\\n end\\n local z::T\\n for z in 2:(p - 1)\\n p - 1 == legendre(z, p) && break\\n end\\n local c::T = powermod(z, q, p)\\n local r::T = powermod(n, (q + 1) >> 1, p)\\n local t::T = powermod(n, q, p)\\n local m::T = s\\n local t2::T = zero(p)\\n while !iszero((t - 1) % p)\\n t2 = (t * t) % p\\n local i::T\\n for i in Base.OneTo(m)\\n iszero((t2 - 1) % p) && break\\n t2 = (t2 * t2) % p\\n end\\n b = powermod(c, 1 << (m - i - 1), p)\\n r = (r * b) % p\\n c = (b * b) % p\\n t = (t * c) % p\\n m = i\\n end\\n return r, p - r\\nend\\n\\nend # module TonelliShanks\\n\",\n \"language\": \"Julia\"\n },\n {\n \"code\": \"@show TonelliShanks.solve(10, 13)\\n@show TonelliShanks.solve(56, 101)\\n@show TonelliShanks.solve(1030, 10009)\\n@show TonelliShanks.solve(44402, 100049)\\n@show TonelliShanks.solve(665820697, 1000000009)\\n@show TonelliShanks.solve(881398088036, 1000000000039)\\n@show TonelliShanks.solve(41660815127637347468140745042827704103445750172002, big\\\"10\\\" ^ 50 + 577)\\n\",\n \"language\": \"Julia\"\n },\n {\n \"code\": \"// version 1.1.3\\n\\nimport java.math.BigInteger\\n\\ndata class Solution(val root1: BigInteger, val root2: BigInteger, val exists: Boolean)\\n\\nval bigZero = BigInteger.ZERO\\nval bigOne = BigInteger.ONE\\nval bigTwo = BigInteger.valueOf(2L)\\nval bigFour = BigInteger.valueOf(4L)\\nval bigTen = BigInteger.TEN\\n\\nfun ts(n: Long, p: Long) = ts(BigInteger.valueOf(n), BigInteger.valueOf(p))\\n\\nfun ts(n: BigInteger, p: BigInteger): Solution {\\n\\n fun powModP(a: BigInteger, e: BigInteger) = a.modPow(e, p)\\n\\n fun ls(a: BigInteger) = powModP(a, (p - bigOne) / bigTwo)\\n\\n if (ls(n) != bigOne) return Solution(bigZero, bigZero, false)\\n var q = p - bigOne\\n var ss = bigZero\\n while (q.and(bigOne) == bigZero) {\\n ss = ss + bigOne\\n q = q.shiftRight(1)\\n }\\n\\n if (ss == bigOne) {\\n val r1 = powModP(n, (p + bigOne) / bigFour)\\n return Solution(r1, p - r1, true)\\n }\\n\\n var z = bigTwo\\n while (ls(z) != p - bigOne) z = z + bigOne\\n var c = powModP(z, q)\\n var r = powModP(n, (q + bigOne) / bigTwo)\\n var t = powModP(n, q)\\n var m = ss\\n\\n while (true) {\\n if (t == bigOne) return Solution(r, p - r, true)\\n var i = bigZero\\n var zz = t\\n while (zz != bigOne && i < m - bigOne) {\\n zz = zz * zz % p\\n i = i + bigOne\\n }\\n var b = c\\n var e = m - i - bigOne\\n while (e > bigZero) {\\n b = b * b % p\\n e = e - bigOne\\n }\\n r = r * b % p\\n c = b * b % p\\n t = t * c % p\\n m = i\\n }\\n}\\n\\nfun main(args: Array<String>) {\\n val pairs = listOf<Pair<Long, Long>>(\\n 10L to 13L,\\n 56L to 101L,\\n 1030L to 10009L,\\n 1032L to 10009L,\\n 44402L to 100049L,\\n 665820697L to 1000000009L,\\n 881398088036L to 1000000000039L\\n )\\n\\n for (pair in pairs) {\\n val (n, p) = pair\\n val (root1, root2, exists) = ts(n, p)\\n println(\\\"n = $n\\\")\\n println(\\\"p = $p\\\")\\n if (exists) {\\n println(\\\"root1 = $root1\\\")\\n println(\\\"root2 = $root2\\\")\\n }\\n else println(\\\"No solution exists\\\")\\n println()\\n }\\n\\n val bn = BigInteger(\\\"41660815127637347468140745042827704103445750172002\\\")\\n val bp = bigTen.pow(50) + BigInteger.valueOf(577L)\\n val (broot1, broot2, bexists) = ts(bn, bp)\\n println(\\\"n = $bn\\\")\\n println(\\\"p = $bp\\\")\\n if (bexists) {\\n println(\\\"root1 = $broot1\\\")\\n println(\\\"root2 = $broot2\\\")\\n }\\n else println(\\\"No solution exists\\\")\\n}\\n\",\n \"language\": \"Kotlin\"\n },\n {\n \"code\": \"proc pow*[T: SomeInteger](x, n, p: T): T =\\n var t = x mod p\\n var e = n\\n result = 1\\n while e > 0:\\n if (e and 1) == 1:\\n result = result * t mod p\\n t = t * t mod p\\n e = e shr 1\\n\\nproc legendre*[T: SomeInteger](a, p: T): T = pow(a, (p-1) shr 1, p)\\n\\nproc tonelliShanks*[T: SomeInteger](n, p: T): T =\\n # Check that n is indeed a square.\\n if legendre(n, p) != 1:\\n raise newException(ValueError, \\\"Not a square\\\")\\n\\n # Factor out power of 2 from p-1.\\n var q = p - 1\\n var s = 0\\n while (q and 1) == 0:\\n s += 1\\n q = q shr 1\\n\\n if s == 1:\\n return pow(n, (p+1) shr 2, p)\\n\\n # Select a non-square z such as (z | p) = -1.\\n var z = 2\\n while legendre(z, p) != p - 1:\\n z += 1\\n\\n var\\n c = pow(z, q, p)\\n t = pow(n, q, p)\\n m = s\\n result = pow(n, (q+1) shr 1, p)\\n while t != 1:\\n var\\n i = 1\\n z = t * t mod p\\n while z != 1 and i < m-1:\\n i += 1\\n z = z * z mod p\\n\\n var b = pow(c, 1 shl (m-i-1), p)\\n c = b * b mod p\\n t = t * c mod p\\n m = i\\n result = result * b mod p\\n\\nwhen isMainModule:\\n proc run(n, p: SomeInteger) =\\n try:\\n let r = tonelliShanks(n, p)\\n echo r, \\\" \\\", p-r\\n except ValueError:\\n echo getCurrentExceptionMsg()\\n\\n run(10, 13)\\n run(56, 101)\\n run(1030, 10009)\\n run(1032, 10009)\\n run(44402, 100049)\\n run(665820697, 1000000009)\\n\",\n \"language\": \"Nim\"\n },\n {\n \"code\": \"let tonelli n p =\\n let open Z in\\n let two = ~$2 in\\n let pp = pred p in\\n let pph = pred p / two in\\n let pow_mod_p a e = powm a e p in\\n let legendre_p a = pow_mod_p a pph in\\n\\n if legendre_p n <> one then None\\n else\\n let s = trailing_zeros pp in\\n if s = 1 then\\n let r = pow_mod_p n (succ p / ~$4) in\\n Some (r, p - r)\\n else\\n let q = pp asr s in\\n let z =\\n let rec find_non_square z =\\n if legendre_p z = pp then z else find_non_square (succ z)\\n in\\n find_non_square two\\n in\\n let rec loop c r t m =\\n if t = one then (r, p - r)\\n else\\n let mp = pred m in\\n let rec find_i n i =\\n if n = one || i >= mp then i else find_i (n * n mod p) (succ i)\\n in\\n let rec exp_pow2 b e =\\n if e <= zero then b else exp_pow2 (b * b mod p) (pred e)\\n in\\n let i = find_i t zero in\\n let b = exp_pow2 c (mp - i) in\\n let c = b * b mod p in\\n loop c (r * b mod p) (t * c mod p) i\\n in\\n Some\\n (loop (pow_mod_p z q) (pow_mod_p n (succ q / two)) (pow_mod_p n q) ~$s)\\n\\nlet () =\\n let open Z in\\n [\\n (~$9, ~$11);\\n (~$10, ~$13);\\n (~$56, ~$101);\\n (~$1030, ~$10009);\\n (~$1032, ~$10009);\\n (~$44402, ~$100049);\\n (~$665820697, ~$1000000009);\\n (~$881398088036, ~$1000000000039);\\n ( of_string \\\"41660815127637347468140745042827704103445750172002\\\",\\n pow ~$10 50 + ~$577 );\\n ]\\n |> List.iter (fun (n, p) ->\\n Printf.printf \\\"n = %s\\\\np = %s\\\\n%!\\\" (to_string n) (to_string p);\\n match tonelli n p with\\n | Some (r1, r2) ->\\n Printf.printf \\\"root1 = %s\\\\nroot2 = %s\\\\n\\\\n%!\\\" (to_string r1)\\n (to_string r2)\\n | None -> print_endline \\\"No solution exists\\\\n\\\")\\n\",\n \"language\": \"OCaml\"\n },\n {\n \"code\": \"use bigint;\\nuse ntheory qw(is_prime powmod kronecker);\\n\\nsub tonelli_shanks {\\n my($n,$p) = @_;\\n return if kronecker($n,$p) <= 0;\\n my $Q = $p - 1;\\n my $S = 0;\\n $Q >>= 1 and $S++ while 0 == $Q%2;\\n return powmod($n,int(($p+1)/4), $p) if $S == 1;\\n\\n my $c;\\n for $n (2..$p) {\\n next if kronecker($n,$p) >= 0;\\n $c = powmod($n, $Q, $p);\\n last;\\n }\\n\\n my $R = powmod($n, ($Q+1) >> 1, $p ); # ?\\n my $t = powmod($n, $Q, $p );\\n while (($t-1) % $p) {\\n my $b;\\n my $t2 = $t**2 % $p;\\n for (1 .. $S) {\\n if (0 == ($t2-1)%$p) {\\n $b = powmod($c, 1 << ($S-1-$_), $p);\\n $S = $_;\\n last;\\n }\\n $t2 = $t2**2 % $p;\\n }\\n $R = ($R * $b) % $p;\\n $c = $b**2 % $p;\\n $t = ($t * $c) % $p;\\n }\\n $R;\\n}\\n\\nmy @tests = (\\n (10, 13),\\n (56, 101),\\n (1030, 10009),\\n (1032, 10009),\\n (44402, 100049),\\n (665820697, 1000000009),\\n (881398088036, 1000000000039),\\n);\\n\\nwhile (@tests) {\\n $n = shift @tests;\\n $p = shift @tests;\\n my $t = tonelli_shanks($n, $p);\\n if (!$t or ($t**2 - $n) % $p) {\\n printf \\\"No solution for (%d, %d)\\\\n\\\", $n, $p;\\n } else {\\n printf \\\"Roots of %d are (%d, %d) mod %d\\\\n\\\", $n, $t, $p-$t, $p;\\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;\\\">include</span> <span style=\\\"color: #004080;\\\">mpfr</span><span style=\\\"color: #0000FF;\\\">.</span><span style=\\\"color: #000000;\\\">e</span>\\n\\n <span style=\\\"color: #008080;\\\">function</span> <span style=\\\"color: #000000;\\\">ts</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #004080;\\\">string</span> <span style=\\\"color: #000000;\\\">ns</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">ps</span><span style=\\\"color: #0000FF;\\\">)</span>\\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: #000000;\\\">ns</span><span style=\\\"color: #0000FF;\\\">),</span>\\n <span style=\\\"color: #000000;\\\">p</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">mpz_init</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">ps</span><span style=\\\"color: #0000FF;\\\">),</span>\\n <span style=\\\"color: #000000;\\\">t</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">mpz_init</span><span style=\\\"color: #0000FF;\\\">(),</span>\\n <span style=\\\"color: #000000;\\\">r</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">mpz_init</span><span style=\\\"color: #0000FF;\\\">(),</span>\\n <span style=\\\"color: #000000;\\\">pm1</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">mpz_init</span><span style=\\\"color: #0000FF;\\\">(),</span>\\n <span style=\\\"color: #000000;\\\">pm2</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">mpz_init</span><span style=\\\"color: #0000FF;\\\">()</span>\\n <span style=\\\"color: #7060A8;\\\">mpz_sub_ui</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">pm1</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">p</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">)</span> <span style=\\\"color: #000080;font-style:italic;\\\">-- pm1 = p-1</span>\\n <span style=\\\"color: #7060A8;\\\">mpz_fdiv_q_2exp</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">pm2</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">pm1</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">)</span> <span style=\\\"color: #000080;font-style:italic;\\\">-- pm2 = pm1/2</span>\\n <span style=\\\"color: #7060A8;\\\">mpz_powm</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><span style=\\\"color: #000000;\\\">pm2</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">p</span><span style=\\\"color: #0000FF;\\\">)</span> <span style=\\\"color: #000080;font-style:italic;\\\">-- t = mod(n^pm2,p)</span>\\n <span style=\\\"color: #008080;\\\">if</span> <span style=\\\"color: #7060A8;\\\">mpz_cmp_si</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;\\\">0</span> <span style=\\\"color: #008080;\\\">then</span>\\n <span style=\\\"color: #008080;\\\">return</span> <span style=\\\"color: #008000;\\\">\\\"No solution exists\\\"</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">if</span>\\n <span style=\\\"color: #004080;\\\">mpz</span> <span style=\\\"color: #000000;\\\">q</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">mpz_init_set</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">pm1</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #004080;\\\">integer</span> <span style=\\\"color: #000000;\\\">ss</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">0</span>\\n <span style=\\\"color: #008080;\\\">while</span> <span style=\\\"color: #7060A8;\\\">mpz_even</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">q</span><span style=\\\"color: #0000FF;\\\">)</span> <span style=\\\"color: #008080;\\\">do</span>\\n <span style=\\\"color: #000000;\\\">ss</span> <span style=\\\"color: #0000FF;\\\">+=</span> <span style=\\\"color: #000000;\\\">1</span>\\n <span style=\\\"color: #7060A8;\\\">mpz_fdiv_q_2exp</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">q</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">q</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">)</span> <span style=\\\"color: #000080;font-style:italic;\\\">-- q/=2</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;\\\">ss</span><span style=\\\"color: #0000FF;\\\">=</span><span style=\\\"color: #000000;\\\">1</span> <span style=\\\"color: #008080;\\\">then</span>\\n <span style=\\\"color: #7060A8;\\\">mpz_add_ui</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">t</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">p</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #7060A8;\\\">mpz_fdiv_q_2exp</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;\\\">2</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #7060A8;\\\">mpz_powm</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">r</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">n</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">t</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">p</span><span style=\\\"color: #0000FF;\\\">)</span> <span style=\\\"color: #000080;font-style:italic;\\\">-- r = mod(n^((p+1)/4),p)</span>\\n <span style=\\\"color: #008080;\\\">else</span>\\n <span style=\\\"color: #004080;\\\">mpz</span> <span style=\\\"color: #000000;\\\">z</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">mpz_init</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">2</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: #7060A8;\\\">mpz_powm</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">t</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">z</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">pm2</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">p</span><span style=\\\"color: #0000FF;\\\">)</span> <span style=\\\"color: #000080;font-style:italic;\\\">-- t = mod(z^pm2,p)</span>\\n <span style=\\\"color: #008080;\\\">if</span> <span style=\\\"color: #7060A8;\\\">mpz_cmp</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">t</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">pm1</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: #7060A8;\\\">mpz_add_ui</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">z</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">z</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">)</span> <span style=\\\"color: #000080;font-style:italic;\\\">-- z+= 1</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">while</span>\\n <span style=\\\"color: #004080;\\\">mpz</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: #000000;\\\">zz</span><span style=\\\"color: #0000FF;\\\">}</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">mpz_inits</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">3</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #7060A8;\\\">mpz_powm</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: #000000;\\\">q</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">p</span><span style=\\\"color: #0000FF;\\\">)</span> <span style=\\\"color: #000080;font-style:italic;\\\">-- c = mod(z^q,p)</span>\\n <span style=\\\"color: #7060A8;\\\">mpz_add_ui</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">t</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">q</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #7060A8;\\\">mpz_fdiv_q_2exp</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;\\\">1</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #7060A8;\\\">mpz_powm</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">r</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">n</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">t</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">p</span><span style=\\\"color: #0000FF;\\\">)</span> <span style=\\\"color: #000080;font-style:italic;\\\">-- r = mod(n^((q+1)/2),p)</span>\\n <span style=\\\"color: #7060A8;\\\">mpz_powm</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><span style=\\\"color: #000000;\\\">q</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">p</span><span style=\\\"color: #0000FF;\\\">)</span> <span style=\\\"color: #000080;font-style:italic;\\\">-- t = mod(n^q,p)</span>\\n <span style=\\\"color: #004080;\\\">integer</span> <span style=\\\"color: #000000;\\\">m</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">ss</span>\\n <span style=\\\"color: #008080;\\\">while</span> <span style=\\\"color: #7060A8;\\\">mpz_cmp_si</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: #008080;\\\">do</span> <span style=\\\"color: #000080;font-style:italic;\\\">-- t!=1</span>\\n <span style=\\\"color: #004080;\\\">integer</span> <span style=\\\"color: #000000;\\\">i</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">0</span>\\n <span style=\\\"color: #7060A8;\\\">mpz_set</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">zz</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">t</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #008080;\\\">while</span> <span style=\\\"color: #7060A8;\\\">mpz_cmp_si</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">zz</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: #008080;\\\">and</span> <span style=\\\"color: #000000;\\\">i</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: #008080;\\\">do</span>\\n <span style=\\\"color: #7060A8;\\\">mpz_powm_ui</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">zz</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">zz</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">2</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">p</span><span style=\\\"color: #0000FF;\\\">)</span> <span style=\\\"color: #000080;font-style:italic;\\\">-- zz = mod(zz^2,p)</span>\\n <span style=\\\"color: #000000;\\\">i</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;\\\">mpz_set</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>\\n <span style=\\\"color: #004080;\\\">integer</span> <span style=\\\"color: #000000;\\\">e</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">m</span><span style=\\\"color: #0000FF;\\\">-</span><span style=\\\"color: #000000;\\\">i</span><span style=\\\"color: #0000FF;\\\">-</span><span style=\\\"color: #000000;\\\">1</span>\\n <span style=\\\"color: #008080;\\\">while</span> <span style=\\\"color: #000000;\\\">e</span><span style=\\\"color: #0000FF;\\\">></span><span style=\\\"color: #000000;\\\">0</span> <span style=\\\"color: #008080;\\\">do</span>\\n <span style=\\\"color: #7060A8;\\\">mpz_powm_ui</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><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">p</span><span style=\\\"color: #0000FF;\\\">)</span> <span style=\\\"color: #000080;font-style:italic;\\\">-- b = mod(b^2,p)</span>\\n <span style=\\\"color: #000000;\\\">e</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;\\\">mpz_mul</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">r</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">r</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">b</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #7060A8;\\\">mpz_mod</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">r</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">r</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">p</span><span style=\\\"color: #0000FF;\\\">)</span> <span style=\\\"color: #000080;font-style:italic;\\\">-- r = mod(r*b,p)</span>\\n <span style=\\\"color: #7060A8;\\\">mpz_powm_ui</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;\\\">2</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">p</span><span style=\\\"color: #0000FF;\\\">)</span> <span style=\\\"color: #000080;font-style:italic;\\\">-- c = mod(b^2,p)</span>\\n <span style=\\\"color: #7060A8;\\\">mpz_mul</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;\\\">c</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #7060A8;\\\">mpz_mod</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;\\\">p</span><span style=\\\"color: #0000FF;\\\">)</span> <span style=\\\"color: #000080;font-style:italic;\\\">-- t = mod(t*c,p)</span>\\n <span style=\\\"color: #000000;\\\">m</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">i</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: #7060A8;\\\">mpz_sub</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">p</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">p</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">r</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #008080;\\\">return</span> <span style=\\\"color: #7060A8;\\\">mpz_get_str</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">r</span><span style=\\\"color: #0000FF;\\\">)&</span><span style=\\\"color: #008000;\\\">\\\" and \\\"</span><span style=\\\"color: #0000FF;\\\">&</span><span style=\\\"color: #7060A8;\\\">mpz_get_str</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">p</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;\\\">tests</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #0000FF;\\\">{{</span><span style=\\\"color: #008000;\\\">\\\"10\\\"</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #008000;\\\">\\\"13\\\"</span><span style=\\\"color: #0000FF;\\\">},</span>\\n <span style=\\\"color: #0000FF;\\\">{</span><span style=\\\"color: #008000;\\\">\\\"56\\\"</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #008000;\\\">\\\"101\\\"</span><span style=\\\"color: #0000FF;\\\">},</span>\\n <span style=\\\"color: #0000FF;\\\">{</span><span style=\\\"color: #008000;\\\">\\\"1030\\\"</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #008000;\\\">\\\"10009\\\"</span><span style=\\\"color: #0000FF;\\\">},</span>\\n <span style=\\\"color: #0000FF;\\\">{</span><span style=\\\"color: #008000;\\\">\\\"1032\\\"</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #008000;\\\">\\\"10009\\\"</span><span style=\\\"color: #0000FF;\\\">},</span>\\n <span style=\\\"color: #0000FF;\\\">{</span><span style=\\\"color: #008000;\\\">\\\"44402\\\"</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #008000;\\\">\\\"100049\\\"</span><span style=\\\"color: #0000FF;\\\">},</span>\\n <span style=\\\"color: #0000FF;\\\">{</span><span style=\\\"color: #008000;\\\">\\\"665820697\\\"</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #008000;\\\">\\\"1000000009\\\"</span><span style=\\\"color: #0000FF;\\\">},</span>\\n <span style=\\\"color: #0000FF;\\\">{</span><span style=\\\"color: #008000;\\\">\\\"881398088036\\\"</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #008000;\\\">\\\"1000000000039\\\"</span><span style=\\\"color: #0000FF;\\\">},</span>\\n <span style=\\\"color: #0000FF;\\\">{</span><span style=\\\"color: #008000;\\\">\\\"41660815127637347468140745042827704103445750172002\\\"</span><span style=\\\"color: #0000FF;\\\">,</span>\\n <span style=\\\"color: #7060A8;\\\">sprintf</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #008000;\\\">\\\"1%s577\\\"</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #7060A8;\\\">repeat</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #008000;\\\">'0'</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">47</span><span style=\\\"color: #0000FF;\\\">))}}</span> <span style=\\\"color: #000080;font-style:italic;\\\">-- 10^50+577</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: #004080;\\\">string</span> <span style=\\\"color: #0000FF;\\\">{</span><span style=\\\"color: #000000;\\\">p1</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">p2</span><span style=\\\"color: #0000FF;\\\">}</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: #7060A8;\\\">printf</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #008000;\\\">\\\"For n = %s and p = %s, %s\\\\n\\\"</span><span style=\\\"color: #0000FF;\\\">,{</span><span style=\\\"color: #000000;\\\">p1</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">p2</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">ts</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">p1</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">p2</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 @lib/rsa.l\\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(de legendre (N P)\\n (**Mod N (/ (dec P) 2) P) )\\n(de ts (N P)\\n (and\\n (=1 (legendre N P))\\n (let\\n (Q (dec P)\\n S 0\\n Z 0\\n C 0\\n R 0\\n D 0\\n M 0\\n B 0\\n I 0 )\\n (until (bit? 1 Q)\\n (setq Q (>> 1 Q))\\n (inc 'S) )\\n (if (=1 S)\\n (list\\n (setq @@ (**Mod N (/ (inc P) 4) P))\\n (- P @@) )\\n (setq Z 2)\\n (until (= (legendre Z P) (dec P))\\n (inc 'Z) )\\n (setq\\n C (**Mod Z Q P)\\n R (**Mod N (/ (inc Q) 2) P)\\n D (**Mod N Q P)\\n M S )\\n (until (=1 D)\\n (zero I)\\n (for\\n (Z\\n D\\n (and (<> Z 1) (< I (dec M)))\\n (setq Z (% (* Z Z) P)) )\\n (inc 'I) )\\n (setq B C)\\n (for\\n (Z\\n (- M I 1)\\n (> Z 0) (dec Z) )\\n (setq B (% (* B B) P)) )\\n (setq\\n R (% (* R B) P)\\n C (% (* B B) P)\\n D (% (* D C) P)\\n M I ) )\\n (list R (- P R)) ) ) ) )\\n\\n(println (ts 10 13))\\n(println (ts 56 101))\\n(println (ts 1030 10009))\\n(println (ts 1032 10009))\\n(println (ts 44402 100049))\\n(println (ts 665820697 1000000009))\\n(println (ts 881398088036 1000000000039))\\n(println (ts 41660815127637347468140745042827704103445750172002 (+ (** 10 50) 577)))\\n\",\n \"language\": \"PicoLisp\"\n },\n {\n \"code\": \"Function Invoke-ModuloExponentiation ([BigInt]$Base, [BigInt]$Exponent, $Modulo) {\\n $Result = 1\\n $Base = $Base % $Modulo\\n If ($Base -eq 0) {return 0}\\n\\n While ($Exponent -gt 0) {\\n If (($Exponent -band 1) -eq 1) {$Result = ($Result * $Base) % $Modulo}\\n $Exponent = $Exponent -shr 1\\n $Base = ($Base * $Base) % $Modulo\\n }\\n return ($Result % $Modulo)\\n}\\n\\nFunction Get-Legendre ([BigInt]$Integer, [BigInt]$Prime) {\\n return (Invoke-ModuloExponentiation -Base $Integer -Exponent (($Prime - 1) / 2) -Modulo $Prime)\\n}\\n\\nFunction Invoke-TonelliShanks ([BigInt]$Integer, [BigInt]$Prime) {\\n If ((Get-Legendre $Integer $Prime) -ne 1) {throw \\\"$Integer not a square (mod $Prime)\\\"}\\n [bigint]$q = $Prime - 1\\n $s = 0\\n While (($q % 2) -eq 0) {\\n $q = $q / 2\\n $s++\\n }\\n If ($s -eq 1) {\\n return (Invoke-ModuloExponentiation $Integer -Exponent (($Prime + 1) / 4) -Modulo $Prime)\\n }\\n For ($z = 2; [Bigint]::Compare($z, $Prime) -lt 0; $z++) {\\n If ([BigInt]::Compare(($Prime - 1), (Get-Legendre $z $Prime)) -eq 0) {\\n break\\n }\\n }\\n $c = Invoke-ModuloExponentiation -Base $z -Exponent $q -Modulo $Prime\\n $r = Invoke-ModuloExponentiation -Base $Integer -Exponent (($q + 1) / 2) -Modulo $Prime\\n $t = Invoke-ModuloExponentiation -Base $Integer -Exponent $q -Modulo $Prime\\n $m = $s\\n $t2 = 0\\n\\n While ((($t - 1) % $Prime) -ne 0) {\\n $t2 = $t * $t % $Prime\\n Foreach ($i in (1..$m)) {\\n If ((($t2 -1) % $Prime) -eq 0) {\\n break\\n }\\n $t2 = Invoke-ModuloExponentiation -Base $t2 -Exponent 2 -Modulo $Prime\\n }\\n $b = Invoke-ModuloExponentiation -Base $c -Exponent ([Math]::Pow(2, ($m - $i - 1))) -Modulo $Prime\\n $r = ($r * $b) % $Prime\\n $c = ($b * $b) % $Prime\\n $t = ($t * $c) % $Prime\\n $m = $i\\n }\\n return $r\\n}\\n\\n$TonelliTests = @(\\n @{Integer = [BigInt]::Parse('10'); Prime = [BigInt]::Parse('13')},\\n @{Integer = [BigInt]::Parse('56'); Prime = [BigInt]::Parse('101')},\\n @{Integer = [BigInt]::Parse('1030'); Prime = [BigInt]::Parse('10009')},\\n @{Integer = [BigInt]::Parse('44402'); Prime = [BigInt]::Parse('100049')},\\n @{Integer = [BigInt]::Parse('665820697'); Prime = [BigInt]::Parse('1000000009')},\\n @{Integer = [BigInt]::Parse('881398088036'); Prime = [BigInt]::Parse('1000000000039')},\\n @{Integer = [BigInt]::Parse('41660815127637347468140745042827704103445750172002'); Prime = [BigInt]::Parse('100000000000000000000000000000000000000000000000577')}\\n)\\n\\n$TonelliTests | Foreach-Object {\\n $Result = Invoke-TonelliShanks @_\\n [PSCustomObject]@{\\n n = $_['Integer']\\n p = $_['Prime']\\n Roots = @($Result, ($_['Prime'] - $Result))\\n }\\n} | Format-List\\n\",\n \"language\": \"PowerShell\"\n },\n {\n \"code\": \"def legendre(a, p):\\n return pow(a, (p - 1) // 2, p)\\n\\ndef tonelli(n, p):\\n assert legendre(n, p) == 1, \\\"not a square (mod p)\\\"\\n q = p - 1\\n s = 0\\n while q % 2 == 0:\\n q //= 2\\n s += 1\\n if s == 1:\\n return pow(n, (p + 1) // 4, p)\\n for z in range(2, p):\\n if p - 1 == legendre(z, p):\\n break\\n c = pow(z, q, p)\\n r = pow(n, (q + 1) // 2, p)\\n t = pow(n, q, p)\\n m = s\\n t2 = 0\\n while (t - 1) % p != 0:\\n t2 = (t * t) % p\\n for i in range(1, m):\\n if (t2 - 1) % p == 0:\\n break\\n t2 = (t2 * t2) % p\\n b = pow(c, 1 << (m - i - 1), p)\\n r = (r * b) % p\\n c = (b * b) % p\\n t = (t * c) % p\\n m = i\\n return r\\n\\nif __name__ == '__main__':\\n ttest = [(10, 13), (56, 101), (1030, 10009), (44402, 100049),\\n\\t (665820697, 1000000009), (881398088036, 1000000000039),\\n (41660815127637347468140745042827704103445750172002, 10**50 + 577)]\\n for n, p in ttest:\\n r = tonelli(n, p)\\n assert (r * r - n) % p == 0\\n print(\\\"n = %d p = %d\\\" % (n, p))\\n print(\\\"\\\\t roots : %d %d\\\" % (r, p - r))\\n\",\n \"language\": \"Python\"\n },\n {\n \"code\": \"#lang racket\\n\\n(require math/number-theory)\\n\\n(define (Legendre a p)\\n (modexpt a (quotient (sub1 p) 2)))\\n\\n(define (Tonelli n p (err (λ (n p) (error \\\"not a square (mod p)\\\" (list n p)))))\\n (with-modulus p\\n (unless (= 1 (Legendre n p)) (err n p))\\n\\n (define-values (q s)\\n (let even?-q-loop ((q (sub1 p)) (s 0))\\n (if (even? q)\\n (even?-q-loop (quotient q 2) (add1 s))\\n (values q s))))\\n\\n (cond\\n [(= s 1)\\n (modexpt n (/ (add1 p) 4))]\\n [else\\n (define z (for/first ((z (in-range 2 p)) #:when (= (sub1 p) (Legendre z p))) z))\\n (let loop ((c (modexpt z q))\\n (r (modexpt n (quotient (add1 q) 2)))\\n (t (modexpt n q))\\n (m s))\\n (cond\\n [(mod= 1 t)\\n r]\\n [else\\n (define-values (t2 m′) (for/fold ((t2 (modsqr t)) (i 1))\\n ((j (in-range 1 m)) #:final (mod= t2 1))\\n (values (modsqr t2) j)))\\n (define b (modexpt c (expt 2 (- m m′ 1))))\\n (define c′ (modsqr b))\\n (loop c′ (mod* r b) (mod* t c′) m′)]))])))\\n\\n(module+ test\\n (require rackunit)\\n\\n (define ttest\\n `((10 13)\\n (56 101)\\n (1030 10009)\\n (44402 100049)\\n (665820697 1000000009)\\n (881398088036 1000000000039)\\n (41660815127637347468140745042827704103445750172002\\n ,(+ #e1e50 577))))\\n\\n (define (task ttest)\\n (for ((test ttest))\\n (define n (first test))\\n (define p (second test))\\n (define r (Tonelli n p))\\n (printf \\\"n = ~a p = ~a~% roots : ~a ~a~%\\\" n p r (- p r))))\\n\\n (task ttest)\\n\\n (check-exn exn:fail? (λ () (Tonelli 1032 1009))))\\n\",\n \"language\": \"Racket\"\n },\n {\n \"code\": \"# Legendre operator (𝑛│𝑝)\\nsub infix:<│> (Int \\\\𝑛, Int \\\\𝑝 where 𝑝.is-prime && (𝑝 != 2)) {\\n given 𝑛.expmod( (𝑝-1) div 2, 𝑝 ) {\\n when 0 { 0 }\\n when 1 { 1 }\\n default { -1 }\\n }\\n}\\n\\nsub tonelli-shanks ( \\\\𝑛, \\\\𝑝 where (𝑛│𝑝) > 0 ) {\\n my $𝑄 = 𝑝 - 1;\\n my $𝑆 = 0;\\n $𝑄 +>= 1 and $𝑆++ while $𝑄 %% 2;\\n return 𝑛.expmod((𝑝+1) div 4, 𝑝) if $𝑆 == 1;\\n my $𝑐 = ((2..𝑝).first: (*│𝑝) < 0).expmod($𝑄, 𝑝);\\n my $𝑅 = 𝑛.expmod( ($𝑄+1) +> 1, 𝑝 );\\n my $𝑡 = 𝑛.expmod( $𝑄, 𝑝 );\\n while ($𝑡-1) % 𝑝 {\\n my $b;\\n my $𝑡2 = $𝑡² % 𝑝;\\n for 1 .. $𝑆 {\\n if ($𝑡2-1) %% 𝑝 {\\n $b = $𝑐.expmod(1 +< ($𝑆-1-$_), 𝑝);\\n $𝑆 = $_;\\n last;\\n }\\n $𝑡2 = $𝑡2² % 𝑝;\\n }\\n $𝑅 = ($𝑅 * $b) % 𝑝;\\n $𝑐 = $b² % 𝑝;\\n $𝑡 = ($𝑡 * $𝑐) % 𝑝;\\n }\\n $𝑅;\\n}\\n\\nmy @tests = (\\n (10, 13),\\n (56, 101),\\n (1030, 10009),\\n (1032, 10009),\\n (44402, 100049),\\n (665820697, 1000000009),\\n (881398088036, 1000000000039),\\n (41660815127637347468140745042827704103445750172002,\\n 100000000000000000000000000000000000000000000000577)\\n);\\n\\n for @tests -> ($n, $p) {\\n try my $t = tonelli-shanks($n, $p);\\n say \\\"No solution for ({$n}, {$p}).\\\" and next if !$t or ($t² - $n) % $p;\\n say \\\"Roots of $n are ($t, {$p-$t}) mod $p\\\";\\n}\\n\",\n \"language\": \"Raku\"\n },\n {\n \"code\": \"/* REXX (required by some interpreters) */\\nNumeric Digits 1000000\\nttest ='[(10, 13), (56, 101), (1030, 10009), (44402, 100049)]'\\nDo While pos('(',ttest)>0\\n Parse Var ttest '(' n ',' p ')' ttest\\n r = tonelli(n, p)\\n Say \\\"n =\\\" n \\\"p =\\\" p\\n Say \\\" roots :\\\" r (p - r)\\n End\\nExit\\n\\nlegendre: Procedure\\n Parse Arg a, p\\n return pow(a, (p - 1) % 2, p)\\n\\ntonelli: Procedure\\n Parse Arg n, p\\n q = p - 1\\n s = 0\\n Do while q // 2 == 0\\n q = q % 2\\n s = s+1\\n End\\n if s == 1 Then\\n return pow(n, (p + 1) % 4, p)\\n Do z=2 To p\\n if p - 1 == legendre(z, p) Then\\n Leave\\n End\\n c = pow(z, q, p)\\n r = pow(n, (q + 1) / 2, p)\\n t = pow(n, q, p)\\n m = s\\n t2 = 0\\n Do while (t - 1) // p <> 0\\n t2 = (t * t) // p\\n Do i=1 To m\\n if (t2 - 1) // p == 0 Then\\n Leave\\n t2 = (t2 * t2) // p\\n End\\n y=2**(m - i - 1)\\n b = pow(c, y, p)\\n If b=10008 Then Trace ?R\\n r = (r * b) // p\\n c = (b * b) // p\\n t = (t * c) // p\\n m = i\\n End\\n return r\\npow: Procedure\\n Parse Arg x,y,z\\n If y>0 Then\\n p=x**y\\n Else p=x\\n If z>'' Then\\n p=p//z\\n Return p\\n\",\n \"language\": \"REXX\"\n },\n {\n \"code\": \"func tonelli(n, p) {\\n legendre(n, p) == 1 || die \\\"not a square (mod p)\\\"\\n var q = p-1\\n var s = valuation(q, 2)\\n s == 1 ? return(powmod(n, (p + 1) >> 2, p)) : (q >>= s)\\n var c = powmod(2 ..^ p -> first {|z| legendre(z, p) == -1}, q, p)\\n var r = powmod(n, (q + 1) >> 1, p)\\n var t = powmod(n, q, p)\\n var m = s\\n var t2 = 0\\n while (!p.divides(t - 1)) {\\n t2 = ((t * t) % p)\\n var b\\n for i in (1 ..^ m) {\\n if (p.divides(t2 - 1)) {\\n b = powmod(c, 1 << (m - i - 1), p)\\n m = i\\n break\\n }\\n t2 = ((t2 * t2) % p)\\n }\\n\\n r = ((r * b) % p)\\n c = ((b * b) % p)\\n t = ((t * c) % p)\\n }\\n return r\\n}\\n\\nvar tests = [\\n [10, 13], [56, 101], [1030, 10009], [44402, 100049],\\n [665820697, 1000000009], [881398088036, 1000000000039],\\n [41660815127637347468140745042827704103445750172002, 10**50 + 577],\\n]\\n\\nfor n,p in tests {\\n var r = tonelli(n, p)\\n assert((r*r - n) % p == 0)\\n say \\\"Roots of #{n} are (#{r}, #{p-r}) mod #{p}\\\"\\n}\\n\",\n \"language\": \"Sidef\"\n },\n {\n \"code\": \"Imports System.Numerics\\n\\nModule Module1\\n\\n Class Solution\\n ReadOnly root1 As BigInteger\\n ReadOnly root2 As BigInteger\\n ReadOnly exists As Boolean\\n\\n Sub New(r1 As BigInteger, r2 As BigInteger, e As Boolean)\\n root1 = r1\\n root2 = r2\\n exists = e\\n End Sub\\n\\n Public Function GetRoot1() As BigInteger\\n Return root1\\n End Function\\n\\n Public Function GetRoot2() As BigInteger\\n Return root2\\n End Function\\n\\n Public Function GetExists() As Boolean\\n Return exists\\n End Function\\n End Class\\n\\n Function Ts(n As BigInteger, p As BigInteger) As Solution\\n If BigInteger.ModPow(n, (p - 1) / 2, p) <> 1 Then\\n Return New Solution(0, 0, False)\\n End If\\n\\n Dim q As BigInteger = p - 1\\n Dim ss = BigInteger.Zero\\n While (q Mod 2) = 0\\n ss += 1\\n q >>= 1\\n End While\\n\\n If ss = 1 Then\\n Dim r1 = BigInteger.ModPow(n, (p + 1) / 4, p)\\n Return New Solution(r1, p - r1, True)\\n End If\\n\\n Dim z As BigInteger = 2\\n While BigInteger.ModPow(z, (p - 1) / 2, p) <> p - 1\\n z += 1\\n End While\\n Dim c = BigInteger.ModPow(z, q, p)\\n Dim r = BigInteger.ModPow(n, (q + 1) / 2, p)\\n Dim t = BigInteger.ModPow(n, q, p)\\n Dim m = ss\\n\\n Do\\n If t = 1 Then\\n Return New Solution(r, p - r, True)\\n End If\\n Dim i = BigInteger.Zero\\n Dim zz = t\\n While zz <> 1 AndAlso i < (m - 1)\\n zz = zz * zz Mod p\\n i += 1\\n End While\\n Dim b = c\\n Dim e = m - i - 1\\n While e > 0\\n b = b * b Mod p\\n e = e - 1\\n End While\\n r = r * b Mod p\\n c = b * b Mod p\\n t = t * c Mod p\\n m = i\\n Loop\\n End Function\\n\\n Sub Main()\\n Dim pairs = New List(Of Tuple(Of Long, Long)) From {\\n New Tuple(Of Long, Long)(10, 13),\\n New Tuple(Of Long, Long)(56, 101),\\n New Tuple(Of Long, Long)(1030, 10009),\\n New Tuple(Of Long, Long)(1032, 10009),\\n New Tuple(Of Long, Long)(44402, 100049),\\n New Tuple(Of Long, Long)(665820697, 1000000009),\\n New Tuple(Of Long, Long)(881398088036, 1000000000039)\\n }\\n\\n For Each pair In pairs\\n Dim sol = Ts(pair.Item1, pair.Item2)\\n Console.WriteLine(\\\"n = {0}\\\", pair.Item1)\\n Console.WriteLine(\\\"p = {0}\\\", pair.Item2)\\n If sol.GetExists() Then\\n Console.WriteLine(\\\"root1 = {0}\\\", sol.GetRoot1())\\n Console.WriteLine(\\\"root2 = {0}\\\", sol.GetRoot2())\\n Else\\n Console.WriteLine(\\\"No solution exists\\\")\\n End If\\n Console.WriteLine()\\n Next\\n\\n Dim bn = BigInteger.Parse(\\\"41660815127637347468140745042827704103445750172002\\\")\\n Dim bp = BigInteger.Pow(10, 50) + 577\\n Dim bsol = Ts(bn, bp)\\n Console.WriteLine(\\\"n = {0}\\\", bn)\\n Console.WriteLine(\\\"p = {0}\\\", bp)\\n If bsol.GetExists() Then\\n Console.WriteLine(\\\"root1 = {0}\\\", bsol.GetRoot1())\\n Console.WriteLine(\\\"root2 = {0}\\\", bsol.GetRoot2())\\n Else\\n Console.WriteLine(\\\"No solution exists\\\")\\n End If\\n End Sub\\n\\nEnd Module\\n\",\n \"language\": \"Visual-Basic-.NET\"\n },\n {\n \"code\": \"import \\\"./dynamic\\\" for Tuple\\nimport \\\"./big\\\" for BigInt\\n\\nvar Solution = Tuple.create(\\\"Solution\\\", [\\\"root1\\\", \\\"root2\\\", \\\"exists\\\"])\\n\\nvar ts = Fn.new { |n, p|\\n if (n is Num) n = BigInt.new(n)\\n if (p is Num) p = BigInt.new(p)\\n\\n var powModP = Fn.new { |a, e| a.modPow(e, p) }\\n\\n var ls = Fn.new { |a| powModP.call(a, p.dec / BigInt.two) }\\n\\n if (ls.call(n) != BigInt.one) return Solution.new(BigInt.zero, BigInt.zero, false)\\n var q = p.dec\\n var ss = BigInt.zero\\n while (q & BigInt.one == BigInt.zero) {\\n ss = ss.inc\\n q = q >> 1\\n }\\n if (ss == BigInt.one) {\\n var r1 = powModP.call(n, p.inc / BigInt.four)\\n return Solution.new(r1, p - r1, true)\\n }\\n var z = BigInt.two\\n while (ls.call(z) != p.dec) z = z.inc\\n var c = powModP.call(z, q)\\n var r = powModP.call(n, q.inc/BigInt.two)\\n var t = powModP.call(n, q)\\n var m = ss\\n while (true) {\\n if (t == BigInt.one) return Solution.new(r, p - r, true)\\n var i = BigInt.zero\\n var zz = t\\n while (zz != BigInt.one && i < m.dec) {\\n zz = zz * zz % p\\n i = i.inc\\n }\\n var b = c\\n var e = m - i.inc\\n while (e > BigInt.zero) {\\n b = b * b % p\\n e = e.dec\\n }\\n r = r * b % p\\n c = b * b % p\\n t = t * c % p\\n m = i\\n }\\n}\\n\\nvar pairs = [\\n [10, 13], [56, 101], [1030, 10009], [1032, 10009], [44402, 100049],\\n [665820697, 1000000009], [881398088036, 1000000000039]\\n]\\n\\nfor (pair in pairs) {\\n var n = pair[0]\\n var p = pair[1]\\n var sol = ts.call(n, p)\\n System.print(\\\"n = %(n)\\\")\\n System.print(\\\"p = %(p)\\\")\\n if (sol.exists) {\\n System.print(\\\"root1 = %(sol.root1)\\\")\\n System.print(\\\"root2 = %(sol.root2)\\\")\\n } else {\\n System.print(\\\"No solution exists\\\")\\n }\\n System.print()\\n}\\n\\nvar bn = BigInt.new(\\\"41660815127637347468140745042827704103445750172002\\\")\\nvar bp = BigInt.ten.pow(50) + BigInt.new(577)\\nvar bsol = ts.call(bn, bp)\\nSystem.print(\\\"n = %(bn)\\\")\\nSystem.print(\\\"p = %(bp)\\\")\\nif (bsol.exists) {\\n System.print(\\\"root1 = %(bsol.root1)\\\")\\n System.print(\\\"root2 = %(bsol.root2)\\\")\\n} else {\\n System.print(\\\"No solution exists\\\")\\n}\\n\",\n \"language\": \"Wren\"\n },\n {\n \"code\": \"var BN=Import(\\\"zklBigNum\\\");\\nfcn modEq(a,b,p) { (a-b)%p==0 }\\nfcn legendre(a,p){ a.powm((p - 1)/2,p) }\\n\\nfcn tonelli(n,p){ //(BigInt,Int|BigInt)\\n _assert_(legendre(n,p)==1, \\\"not a square (mod p)\\\"+vm.arglist);\\n q,s:=p-1,0;\\n while(q.isEven){ q/=2; s+=1; }\\n if(s==1) return(n.powm((p+1)/4,p));\\n z:=[BN(2)..p].filter1('wrap(z){ legendre(z,p)==(p-1) });\\n c,r,t,m,t2:=z.powm(q,p), n.powm((q+1)/2,p), n.powm(q,p), s, 0;\\n while(not modEq(t,1,p)){\\n t2=(t*t)%p;\\n i:=1; while(not modEq(t2,1,p)){ i+=1; t2=(t2*t2)%p; } // assert(i<m)\\n b:=c.powm(BN(1).shiftLeft(m-i-1), p);\\n r,c,t,m = (r*b)%p, (b*b)%p, (t*c)%p, i;\\n }\\n r\\n}\\n\",\n \"language\": \"Zkl\"\n },\n {\n \"code\": \"ttest:=T(T(10,13), T(56,101), T(1030,10009), T(44402,100049),\\n T(665820697,1000000009), T(881398088036,1000000000039),\\n T(\\\"41660815127637347468140745042827704103445750172002\\\", BN(10).pow(50) + 577),\\n T(1032,10009) );\\nforeach n,p in (ttest){ n=BN(n);\\n r:=tonelli(n,p);\\n assert((r*r-n)%p == 0,\\\"(r*r-n)%p == 0 : %s,%s,%s-->%s\\\".fmt(r,n,p,(r*r-n)%p));\\n println(\\\"n=%d p=%d\\\".fmt(n,p));\\n println(\\\" roots: %d %d\\\".fmt(r, p-r));\\n}\\n\",\n \"language\": \"Zkl\"\n }\n]","isConversational":false},"task_name":{"kind":"string","value":"Tonelli-Shanks-algorithm"}}},{"rowIdx":1763,"cells":{"solutions":{"kind":"list like","value":[{"code":"---\nfrom: http://rosettacode.org/wiki/Topic_variable\n","language":"00-META"},{"code":"Several programming languages offer syntax shortcuts to deal with the notion of \"current\" or \"topic\" variable.\n\nA topic variable is a [[Special variables|special variable]] with a very short name which can also often be omitted.\n\nDemonstrate the utilization and behaviour of the topic variable within the language and explain or demonstrate how the topic variable behaves under different levels of nesting or scope, if this applies, within the language.\n\nFor instance you can (but you don't have to) show how the topic variable can be used by assigning the number <math>3</math> to it and then computing its square and square root.\n<br><br>\n\n","language":"00-TASK"},{"code":"on run\n 1 + 2\n\n ap({square, squareRoot}, {result})\n\n --> {9, 1.732050807569}\nend run\n\n\n-- square :: Num a => a -> a\non square(x)\n x * x\nend square\n\n-- squareRoot :: Num a, Float b => a -> b\non squareRoot(x)\n x ^ 0.5\nend squareRoot\n\n\n-- GENERIC FUNCTIONS ----------------------------------------------------------\n\n-- A list of functions applied to a list of arguments\n-- (<*> | ap) :: [(a -> b)] -> [a] -> [b]\non ap(fs, xs)\n set lst to {}\n repeat with f in fs\n tell mReturn(contents of f)\n repeat with x in xs\n set end of lst to |λ|(contents of x)\n end repeat\n end tell\n end repeat\n return lst\nend ap\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":"on run\n script\n -- The given function applied to the value 3\n on |λ|(f)\n mReturn(f)'s |λ|(3)\n end |λ|\n end script\n\n -- Here, 'result' is bound to the script above\n map(result, {square, squareRoot})\n\n --> {9, 1.732050807569}\nend run\n\n\n-- square :: Num a => a -> a\non square(x)\n x * x\nend square\n\n-- squareRoot :: Num a, Float b => a -> b\non squareRoot(x)\n x ^ 0.5\nend squareRoot\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-- 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":"3\nDisp *3▶Dec,i\n","language":"Axe"},{"code":"function Sum (x, y)\n Sum = x + y # using name of function\nend function\n\nfunction SumR (x, y)\n return x + y # using Return keyword which always returns immediately\nend function\n\nprint Sum (1, 2)\nprint SumR(2, 3)\n","language":"BASIC256"},{"code":"user=> 3\n3\nuser=> (Math/pow *1 2)\n9.0\nuser=> (Math/pow *2 0.5)\n1.7320508075688772\n","language":"Clojure"},{"code":": myloop 11 1 do i . loop cr ; myloop\n","language":"Forth"},{"code":": ^2 dup * ;\n: sqrt 0 tuck ?do 1+ dup 2* 1+ +loop ;\n: topic >r r@ ^2 . r@ sqrt . r> drop ;\n\n23 topic\n","language":"Forth"},{"code":"' FB 1.05.0 Win64\n\n' Three different ways of returning a value from a function\n\nFunction Sum (x As Integer, y As Integer) As Integer\n Sum = x + y '' using name of function\nEnd Function\n\nFunction Sum2 (x As Integer, y As Integer) As Integer\n Function = x + y '' using Function keyword\nEnd Function\n\nFunction Sum3 (x As Integer, y As Integer) As Integer\n Return x + y '' using Return keyword which always returns immediately\nEnd Function\n\nPrint Sum (1, 2)\nPrint Sum2(2, 3)\nPrint Sum3(3, 4)\nSleep\n","language":"FreeBASIC"},{"code":"package main\n\nimport (\n \"math\"\n \"os\"\n \"strconv\"\n \"text/template\"\n)\n\nfunc sqr(x string) string {\n f, err := strconv.ParseFloat(x, 64)\n if err != nil {\n return \"NA\"\n }\n return strconv.FormatFloat(f*f, 'f', -1, 64)\n}\n\nfunc sqrt(x string) string {\n f, err := strconv.ParseFloat(x, 64)\n if err != nil {\n return \"NA\"\n }\n return strconv.FormatFloat(math.Sqrt(f), 'f', -1, 64)\n}\n\nfunc main() {\n f := template.FuncMap{\"sqr\": sqr, \"sqrt\": sqrt}\n t := template.Must(template.New(\"\").Funcs(f).Parse(`. = {{.}}\nsquare: {{sqr .}}\nsquare root: {{sqrt .}}\n`))\n t.Execute(os.Stdout, \"3\")\n}\n","language":"Go"},{"code":"Prelude> [1..10]\n[1,2,3,4,5,6,7,8,9,10]\nPrelude> map (^2) it\n[1,4,9,16,25,36,49,64,81,100]\n","language":"Haskell"},{"code":" example=: *:, %: NB. *: is square, %: is square root\n example 3\n9 1.73205\n","language":"J"},{"code":" Example=: verb def '(*: y), (%: y)'\n Example 3\n9 1.73205\n","language":"J"},{"code":" (*:, %:) 3\n9 1.73205\n","language":"J"},{"code":"julia> 3\n3\njulia> ans * ans, ans - 1\n(9, 2)\n","language":"Julia"},{"code":"// version 1.1.2\n\nfun main(args: Array<String>) {\n 3.let {\n println(it)\n println(it * it)\n println(Math.sqrt(it.toDouble()))\n }\n}\n","language":"Kotlin"},{"code":"for _ in 1..10:\n echo \"Hello World!\"\n","language":"Nim"},{"code":"import sequtils\nlet x = [1, 2, 3, 4, 5]\nlet y = x.mapIt(it * it)\necho y # @[1, 4, 9, 16, 25]\n","language":"Nim"},{"code":"3 dup sq swap sqrt\n","language":"Oforth"},{"code":"3\n[sqrt(%),%^2]\n","language":"PARI-GP"},{"code":"print sqrt . \" \" for (4, 16, 64)\n","language":"Perl"},{"code":"for (1..2) {\n print \"outer $_:\\n\";\n local $_;\n for (1..3) {\n print \" inner $_,\";\n }\n print \" fini\\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: #004080;\">object</span> <span style=\"color: #000000;\">_</span>\n <span style=\"color: #000000;\">_</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">3</span>\n <span style=\"color: #0000FF;\">?</span><span style=\"color: #000000;\">_</span>\n <span style=\"color: #0000FF;\">?</span><span style=\"color: #000000;\">_</span><span style=\"color: #0000FF;\">*</span><span style=\"color: #000000;\">_</span>\n<!--\n","language":"Phix"},{"code":"PicoLisp sets the value of the variable (symbol) '@' to the result of\nconditional and controlling expressions in flow- and logic-functions (cond, if,\nand, when, while, etc.).\n\nWithin a function or method '@' behaves like a local variable, i.e. its value is\nautomatically saved upon function entry and restored at exit.\n\nFor example, to read the current input channel until EOF, and print the square\nof every item which is a number:\n","language":"PicoLisp"},{"code":"(while (read)\n (when (num? @)\n (println (* @ @)) ) )\nabc # Not a number\n7 # Number\n49 # -> print square\nxyz # Not a number\n3 # Number\n9 # -> print square\n","language":"PicoLisp"},{"code":"65..67 | ForEach-Object {$_ * 2} # Multiply the numbers by 2\n65..67 | ForEach-Object {[char]$_ } # ASCII values of the numbers\n","language":"PowerShell"},{"code":"65..67 | Where-Object {$_ % 2}\n","language":"PowerShell"},{"code":"65..70 | Format-Wide {$_} -Column 3 -Force\n","language":"PowerShell"},{"code":">>> 3\n3\n>>> _*_, _**0.5\n(9, 1.7320508075688772)\n>>>\n","language":"Python"},{"code":"#lang racket\n\n(module topic1 racket\n ;; define $ as a \"parameter\", but make it look like a plain identifier\n (provide $ (rename-out [$if if] [$#%app #%app]))\n (define current-value (make-parameter #f))\n (define-syntax $\n (syntax-id-rules (set!)\n [(_ x ...) ((current-value) x ...)]\n [(set! _ val) (current-value val)]\n [_ (current-value)]))\n ;; make an `if' form that binds it to the condition result\n (define-syntax-rule ($if C T E)\n (parameterize ([current-value C])\n (if $ T E)))\n ;; function application with []s uses the topic variable for the first arg\n (define-syntax ($#%app stx)\n (syntax-case stx ()\n [(_ f x y ...) (equal? #\\[ (syntax-property stx 'paren-shape))\n #'(parameterize ([current-value x]) (f y ...))]\n [(_ f x ...) #'(f x ...)])))\n\n(module topic2 racket\n ;; better variant: define `$' as a syntax parameter, which is adjusted to an\n ;; actual local binding; make it work in `if', and have a function definition\n ;; form that binds it to the actual arguments\n (provide $ (rename-out [$if if]) defun)\n (require racket/stxparam)\n (define-syntax-parameter $ (λ(stx) (raise-syntax-error '$ \"not in scope\")))\n (define-syntax-rule ($if C T E)\n (let ([c C]) (syntax-parameterize ([$ (make-rename-transformer #'c)])\n (if c T E))))\n (define-syntax-rule (defun name body ...)\n (define (name arg)\n (syntax-parameterize ([$ (make-rename-transformer #'arg)])\n body ...)))\n )\n\n(module sample1 racket\n (require (submod \"..\" topic1))\n (if (memq 2 '(1 2 3)) (cadr $) 'missing)\n ;; => 3\n (define (foo) (list (sqrt $) (* $ $)))\n [foo 9]\n ;; => '(3 81)\n )\n(require 'sample1)\n\n(module sample2 racket\n (require (submod \"..\" topic2))\n (if (memq 2 '(1 2 3)) (cadr $) 'missing)\n ;; => 3\n (defun foo (list (sqrt $) (* $ $)))\n (foo 9)\n ;; => '(3 81)\n )\n(require 'sample2)\n","language":"Racket"},{"code":"$_ = 'Outside';\nfor <3 5 7 10> {\n print $_;\n .³.map: { say join \"\\t\", '', $_, .², .sqrt, .log(2), OUTER::<$_>, UNIT::<$_> }\n}\n","language":"Raku"},{"code":"/*REXX program shows something close to a \"topic variable\" (for functions/subroutines).*/\nparse arg N /*obtain a variable from the cmd line. */\ncall squareIt N /*invoke a function to square da number*/\nsay result ' ◄───' /*display returned value from the func.*/\nexit 0 /*stick a fork in it, we're all done. */\n/*──────────────────────────────────────────────────────────────────────────────────────*/\nsquareIt: return arg(1) ** 2 /*return the square of passed argument.*/\n","language":"REXX"},{"code":"see \"sum1 = \" + sum1(1,2) + nl\nsee \"sum2 = \" + sum2(2,3) + nl\n\nfunc sum1 (x, y)\n sum = x + y\n return sum\n\nfunc sum2 (x, y)\n return x + y\n","language":"Ring"},{"code":"while DATA.gets # assigns to $_ (local scope)\n print # If no arguments are given, prints $_\nend\n__END__\nThis is line one\nThis is line two\nThis is line three\n","language":"Ruby"},{"code":"DATA.gets\np [$_.to_i ** 2, Math.sqrt($_.to_i)] #=> [9, 1.7320508075688772]\n__END__\n3\n","language":"Ruby"},{"code":"object TopicVar extends App {\n class SuperString(val org: String){\n def it(): Unit = println(org)\n }\n\n new SuperString(\"FvdB\"){it()}\n new SuperString(\"FvdB\"){println(org)}\n\n Seq(1).foreach {println}\n Seq(2).foreach {println(_)}\n Seq(4).foreach { it => println(it)}\n Seq(8).foreach { it => println(it + it)}\n}\n","language":"Scala"},{"code":"say [9,16,25].map {.sqrt}; # prints: [3, 4, 5]\n","language":"Sidef"},{"code":"- 3.0;\nval it = 3.0 : real\n- it * it;\nval it = 9.0 : real\n- Math.sqrt it;\nval it = 3.0 : real\n-\n","language":"Standard-ML"},{"code":"3 -> \\($-1! $+1!\\) -> $*$ -> [$-1..$+1] -> '$;\n' -> !OUT::write\n","language":"Tailspin"},{"code":"multiply 3 4 # We assume this user defined function has been previously defined\necho $? # This will output 12, but $? will now be zero indicating a successful echo\n","language":"UNIX-Shell"},{"code":"var T // global scope\n\nvar doSomethingWithT = Fn.new { [T * T, T.sqrt] }\n\nT = 3\nSystem.print(doSomethingWithT.call())\n","language":"Wren"},{"code":"a,_,c:=List(1,2,3,4,5,6) //-->a=1, c=3, here _ is used as \"ignore\"\n3.0 : _.sqrt() : println(_) //-->\"1.73205\", _ (and :) is used to \"explode\" a computation\n // as syntactic sugar\n1.0 + 2 : _.sqrt() : _.pow(4) // no variables used, the compiler \"implodes\" the computation\n // --> 9\n","language":"Zkl"}],"string":"[\n {\n \"code\": \"---\\nfrom: http://rosettacode.org/wiki/Topic_variable\\n\",\n \"language\": \"00-META\"\n },\n {\n \"code\": \"Several programming languages offer syntax shortcuts to deal with the notion of \\\"current\\\" or \\\"topic\\\" variable.\\n\\nA topic variable is a [[Special variables|special variable]] with a very short name which can also often be omitted.\\n\\nDemonstrate the utilization and behaviour of the topic variable within the language and explain or demonstrate how the topic variable behaves under different levels of nesting or scope, if this applies, within the language.\\n\\nFor instance you can (but you don't have to) show how the topic variable can be used by assigning the number <math>3</math> to it and then computing its square and square root.\\n<br><br>\\n\\n\",\n \"language\": \"00-TASK\"\n },\n {\n \"code\": \"on run\\n 1 + 2\\n\\n ap({square, squareRoot}, {result})\\n\\n --> {9, 1.732050807569}\\nend run\\n\\n\\n-- square :: Num a => a -> a\\non square(x)\\n x * x\\nend square\\n\\n-- squareRoot :: Num a, Float b => a -> b\\non squareRoot(x)\\n x ^ 0.5\\nend squareRoot\\n\\n\\n-- GENERIC FUNCTIONS ----------------------------------------------------------\\n\\n-- A list of functions applied to a list of arguments\\n-- (<*> | ap) :: [(a -> b)] -> [a] -> [b]\\non ap(fs, xs)\\n set lst to {}\\n repeat with f in fs\\n tell mReturn(contents of f)\\n repeat with x in xs\\n set end of lst to |λ|(contents of x)\\n end repeat\\n end tell\\n end repeat\\n return lst\\nend ap\\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\": \"on run\\n script\\n -- The given function applied to the value 3\\n on |λ|(f)\\n mReturn(f)'s |λ|(3)\\n end |λ|\\n end script\\n\\n -- Here, 'result' is bound to the script above\\n map(result, {square, squareRoot})\\n\\n --> {9, 1.732050807569}\\nend run\\n\\n\\n-- square :: Num a => a -> a\\non square(x)\\n x * x\\nend square\\n\\n-- squareRoot :: Num a, Float b => a -> b\\non squareRoot(x)\\n x ^ 0.5\\nend squareRoot\\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-- 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\": \"3\\nDisp *3▶Dec,i\\n\",\n \"language\": \"Axe\"\n },\n {\n \"code\": \"function Sum (x, y)\\n Sum = x + y # using name of function\\nend function\\n\\nfunction SumR (x, y)\\n return x + y # using Return keyword which always returns immediately\\nend function\\n\\nprint Sum (1, 2)\\nprint SumR(2, 3)\\n\",\n \"language\": \"BASIC256\"\n },\n {\n \"code\": \"user=> 3\\n3\\nuser=> (Math/pow *1 2)\\n9.0\\nuser=> (Math/pow *2 0.5)\\n1.7320508075688772\\n\",\n \"language\": \"Clojure\"\n },\n {\n \"code\": \": myloop 11 1 do i . loop cr ; myloop\\n\",\n \"language\": \"Forth\"\n },\n {\n \"code\": \": ^2 dup * ;\\n: sqrt 0 tuck ?do 1+ dup 2* 1+ +loop ;\\n: topic >r r@ ^2 . r@ sqrt . r> drop ;\\n\\n23 topic\\n\",\n \"language\": \"Forth\"\n },\n {\n \"code\": \"' FB 1.05.0 Win64\\n\\n' Three different ways of returning a value from a function\\n\\nFunction Sum (x As Integer, y As Integer) As Integer\\n Sum = x + y '' using name of function\\nEnd Function\\n\\nFunction Sum2 (x As Integer, y As Integer) As Integer\\n Function = x + y '' using Function keyword\\nEnd Function\\n\\nFunction Sum3 (x As Integer, y As Integer) As Integer\\n Return x + y '' using Return keyword which always returns immediately\\nEnd Function\\n\\nPrint Sum (1, 2)\\nPrint Sum2(2, 3)\\nPrint Sum3(3, 4)\\nSleep\\n\",\n \"language\": \"FreeBASIC\"\n },\n {\n \"code\": \"package main\\n\\nimport (\\n \\\"math\\\"\\n \\\"os\\\"\\n \\\"strconv\\\"\\n \\\"text/template\\\"\\n)\\n\\nfunc sqr(x string) string {\\n f, err := strconv.ParseFloat(x, 64)\\n if err != nil {\\n return \\\"NA\\\"\\n }\\n return strconv.FormatFloat(f*f, 'f', -1, 64)\\n}\\n\\nfunc sqrt(x string) string {\\n f, err := strconv.ParseFloat(x, 64)\\n if err != nil {\\n return \\\"NA\\\"\\n }\\n return strconv.FormatFloat(math.Sqrt(f), 'f', -1, 64)\\n}\\n\\nfunc main() {\\n f := template.FuncMap{\\\"sqr\\\": sqr, \\\"sqrt\\\": sqrt}\\n t := template.Must(template.New(\\\"\\\").Funcs(f).Parse(`. = {{.}}\\nsquare: {{sqr .}}\\nsquare root: {{sqrt .}}\\n`))\\n t.Execute(os.Stdout, \\\"3\\\")\\n}\\n\",\n \"language\": \"Go\"\n },\n {\n \"code\": \"Prelude> [1..10]\\n[1,2,3,4,5,6,7,8,9,10]\\nPrelude> map (^2) it\\n[1,4,9,16,25,36,49,64,81,100]\\n\",\n \"language\": \"Haskell\"\n },\n {\n \"code\": \" example=: *:, %: NB. *: is square, %: is square root\\n example 3\\n9 1.73205\\n\",\n \"language\": \"J\"\n },\n {\n \"code\": \" Example=: verb def '(*: y), (%: y)'\\n Example 3\\n9 1.73205\\n\",\n \"language\": \"J\"\n },\n {\n \"code\": \" (*:, %:) 3\\n9 1.73205\\n\",\n \"language\": \"J\"\n },\n {\n \"code\": \"julia> 3\\n3\\njulia> ans * ans, ans - 1\\n(9, 2)\\n\",\n \"language\": \"Julia\"\n },\n {\n \"code\": \"// version 1.1.2\\n\\nfun main(args: Array<String>) {\\n 3.let {\\n println(it)\\n println(it * it)\\n println(Math.sqrt(it.toDouble()))\\n }\\n}\\n\",\n \"language\": \"Kotlin\"\n },\n {\n \"code\": \"for _ in 1..10:\\n echo \\\"Hello World!\\\"\\n\",\n \"language\": \"Nim\"\n },\n {\n \"code\": \"import sequtils\\nlet x = [1, 2, 3, 4, 5]\\nlet y = x.mapIt(it * it)\\necho y # @[1, 4, 9, 16, 25]\\n\",\n \"language\": \"Nim\"\n },\n {\n \"code\": \"3 dup sq swap sqrt\\n\",\n \"language\": \"Oforth\"\n },\n {\n \"code\": \"3\\n[sqrt(%),%^2]\\n\",\n \"language\": \"PARI-GP\"\n },\n {\n \"code\": \"print sqrt . \\\" \\\" for (4, 16, 64)\\n\",\n \"language\": \"Perl\"\n },\n {\n \"code\": \"for (1..2) {\\n print \\\"outer $_:\\\\n\\\";\\n local $_;\\n for (1..3) {\\n print \\\" inner $_,\\\";\\n }\\n print \\\" fini\\\\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: #004080;\\\">object</span> <span style=\\\"color: #000000;\\\">_</span>\\n <span style=\\\"color: #000000;\\\">_</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">3</span>\\n <span style=\\\"color: #0000FF;\\\">?</span><span style=\\\"color: #000000;\\\">_</span>\\n <span style=\\\"color: #0000FF;\\\">?</span><span style=\\\"color: #000000;\\\">_</span><span style=\\\"color: #0000FF;\\\">*</span><span style=\\\"color: #000000;\\\">_</span>\\n<!--\\n\",\n \"language\": \"Phix\"\n },\n {\n \"code\": \"PicoLisp sets the value of the variable (symbol) '@' to the result of\\nconditional and controlling expressions in flow- and logic-functions (cond, if,\\nand, when, while, etc.).\\n\\nWithin a function or method '@' behaves like a local variable, i.e. its value is\\nautomatically saved upon function entry and restored at exit.\\n\\nFor example, to read the current input channel until EOF, and print the square\\nof every item which is a number:\\n\",\n \"language\": \"PicoLisp\"\n },\n {\n \"code\": \"(while (read)\\n (when (num? @)\\n (println (* @ @)) ) )\\nabc # Not a number\\n7 # Number\\n49 # -> print square\\nxyz # Not a number\\n3 # Number\\n9 # -> print square\\n\",\n \"language\": \"PicoLisp\"\n },\n {\n \"code\": \"65..67 | ForEach-Object {$_ * 2} # Multiply the numbers by 2\\n65..67 | ForEach-Object {[char]$_ } # ASCII values of the numbers\\n\",\n \"language\": \"PowerShell\"\n },\n {\n \"code\": \"65..67 | Where-Object {$_ % 2}\\n\",\n \"language\": \"PowerShell\"\n },\n {\n \"code\": \"65..70 | Format-Wide {$_} -Column 3 -Force\\n\",\n \"language\": \"PowerShell\"\n },\n {\n \"code\": \">>> 3\\n3\\n>>> _*_, _**0.5\\n(9, 1.7320508075688772)\\n>>>\\n\",\n \"language\": \"Python\"\n },\n {\n \"code\": \"#lang racket\\n\\n(module topic1 racket\\n ;; define $ as a \\\"parameter\\\", but make it look like a plain identifier\\n (provide $ (rename-out [$if if] [$#%app #%app]))\\n (define current-value (make-parameter #f))\\n (define-syntax $\\n (syntax-id-rules (set!)\\n [(_ x ...) ((current-value) x ...)]\\n [(set! _ val) (current-value val)]\\n [_ (current-value)]))\\n ;; make an `if' form that binds it to the condition result\\n (define-syntax-rule ($if C T E)\\n (parameterize ([current-value C])\\n (if $ T E)))\\n ;; function application with []s uses the topic variable for the first arg\\n (define-syntax ($#%app stx)\\n (syntax-case stx ()\\n [(_ f x y ...) (equal? #\\\\[ (syntax-property stx 'paren-shape))\\n #'(parameterize ([current-value x]) (f y ...))]\\n [(_ f x ...) #'(f x ...)])))\\n\\n(module topic2 racket\\n ;; better variant: define `$' as a syntax parameter, which is adjusted to an\\n ;; actual local binding; make it work in `if', and have a function definition\\n ;; form that binds it to the actual arguments\\n (provide $ (rename-out [$if if]) defun)\\n (require racket/stxparam)\\n (define-syntax-parameter $ (λ(stx) (raise-syntax-error '$ \\\"not in scope\\\")))\\n (define-syntax-rule ($if C T E)\\n (let ([c C]) (syntax-parameterize ([$ (make-rename-transformer #'c)])\\n (if c T E))))\\n (define-syntax-rule (defun name body ...)\\n (define (name arg)\\n (syntax-parameterize ([$ (make-rename-transformer #'arg)])\\n body ...)))\\n )\\n\\n(module sample1 racket\\n (require (submod \\\"..\\\" topic1))\\n (if (memq 2 '(1 2 3)) (cadr $) 'missing)\\n ;; => 3\\n (define (foo) (list (sqrt $) (* $ $)))\\n [foo 9]\\n ;; => '(3 81)\\n )\\n(require 'sample1)\\n\\n(module sample2 racket\\n (require (submod \\\"..\\\" topic2))\\n (if (memq 2 '(1 2 3)) (cadr $) 'missing)\\n ;; => 3\\n (defun foo (list (sqrt $) (* $ $)))\\n (foo 9)\\n ;; => '(3 81)\\n )\\n(require 'sample2)\\n\",\n \"language\": \"Racket\"\n },\n {\n \"code\": \"$_ = 'Outside';\\nfor <3 5 7 10> {\\n print $_;\\n .³.map: { say join \\\"\\\\t\\\", '', $_, .², .sqrt, .log(2), OUTER::<$_>, UNIT::<$_> }\\n}\\n\",\n \"language\": \"Raku\"\n },\n {\n \"code\": \"/*REXX program shows something close to a \\\"topic variable\\\" (for functions/subroutines).*/\\nparse arg N /*obtain a variable from the cmd line. */\\ncall squareIt N /*invoke a function to square da number*/\\nsay result ' ◄───' /*display returned value from the func.*/\\nexit 0 /*stick a fork in it, we're all done. */\\n/*──────────────────────────────────────────────────────────────────────────────────────*/\\nsquareIt: return arg(1) ** 2 /*return the square of passed argument.*/\\n\",\n \"language\": \"REXX\"\n },\n {\n \"code\": \"see \\\"sum1 = \\\" + sum1(1,2) + nl\\nsee \\\"sum2 = \\\" + sum2(2,3) + nl\\n\\nfunc sum1 (x, y)\\n sum = x + y\\n return sum\\n\\nfunc sum2 (x, y)\\n return x + y\\n\",\n \"language\": \"Ring\"\n },\n {\n \"code\": \"while DATA.gets # assigns to $_ (local scope)\\n print # If no arguments are given, prints $_\\nend\\n__END__\\nThis is line one\\nThis is line two\\nThis is line three\\n\",\n \"language\": \"Ruby\"\n },\n {\n \"code\": \"DATA.gets\\np [$_.to_i ** 2, Math.sqrt($_.to_i)] #=> [9, 1.7320508075688772]\\n__END__\\n3\\n\",\n \"language\": \"Ruby\"\n },\n {\n \"code\": \"object TopicVar extends App {\\n class SuperString(val org: String){\\n def it(): Unit = println(org)\\n }\\n\\n new SuperString(\\\"FvdB\\\"){it()}\\n new SuperString(\\\"FvdB\\\"){println(org)}\\n\\n Seq(1).foreach {println}\\n Seq(2).foreach {println(_)}\\n Seq(4).foreach { it => println(it)}\\n Seq(8).foreach { it => println(it + it)}\\n}\\n\",\n \"language\": \"Scala\"\n },\n {\n \"code\": \"say [9,16,25].map {.sqrt}; # prints: [3, 4, 5]\\n\",\n \"language\": \"Sidef\"\n },\n {\n \"code\": \"- 3.0;\\nval it = 3.0 : real\\n- it * it;\\nval it = 9.0 : real\\n- Math.sqrt it;\\nval it = 3.0 : real\\n-\\n\",\n \"language\": \"Standard-ML\"\n },\n {\n \"code\": \"3 -> \\\\($-1! $+1!\\\\) -> $*$ -> [$-1..$+1] -> '$;\\n' -> !OUT::write\\n\",\n \"language\": \"Tailspin\"\n },\n {\n \"code\": \"multiply 3 4 # We assume this user defined function has been previously defined\\necho $? # This will output 12, but $? will now be zero indicating a successful echo\\n\",\n \"language\": \"UNIX-Shell\"\n },\n {\n \"code\": \"var T // global scope\\n\\nvar doSomethingWithT = Fn.new { [T * T, T.sqrt] }\\n\\nT = 3\\nSystem.print(doSomethingWithT.call())\\n\",\n \"language\": \"Wren\"\n },\n {\n \"code\": \"a,_,c:=List(1,2,3,4,5,6) //-->a=1, c=3, here _ is used as \\\"ignore\\\"\\n3.0 : _.sqrt() : println(_) //-->\\\"1.73205\\\", _ (and :) is used to \\\"explode\\\" a computation\\n // as syntactic sugar\\n1.0 + 2 : _.sqrt() : _.pow(4) // no variables used, the compiler \\\"implodes\\\" the computation\\n // --> 9\\n\",\n \"language\": \"Zkl\"\n }\n]","isConversational":false},"task_name":{"kind":"string","value":"Topic-variable"}}},{"rowIdx":1764,"cells":{"solutions":{"kind":"list like","value":[{"code":"---\ncategory:\n- Sorting\nfrom: http://rosettacode.org/wiki/Topological_sort\nnote: Sorting Algorithms\n","language":"00-META"},{"code":"{{Sorting Algorithm}}\n\n\nGiven a mapping between items, and items they depend on, a [[wp:Topological sorting|topological sort]] orders items so that no item precedes an item it depends upon. \n\nThe compiling of a library in the [[wp:VHDL|VHDL]] language has the constraint that a library must be compiled after any library it depends on. \n\nA tool exists that extracts library dependencies. \n\n\n;Task:\nWrite a function that will return a valid compile order of VHDL libraries from their dependencies.\n\n* Assume library names are single words. \n* Items mentioned as only dependents, (sic), have no dependents of their own, but their order of compiling must be given.\n* Any self dependencies should be ignored. \n* Any un-orderable dependencies should be flagged.\n\n<br>\nUse the following data as an example:\n<pre>\nLIBRARY LIBRARY DEPENDENCIES\n======= ====================\ndes_system_lib std synopsys std_cell_lib des_system_lib dw02 dw01 ramlib ieee\ndw01 ieee dw01 dware gtech\ndw02 ieee dw02 dware\ndw03 std synopsys dware dw03 dw02 dw01 ieee gtech\ndw04 dw04 ieee dw01 dware gtech\ndw05 dw05 ieee dware\ndw06 dw06 ieee dware\ndw07 ieee dware\ndware ieee dware\ngtech ieee gtech\nramlib std ieee\nstd_cell_lib ieee std_cell_lib\nsynopsys\n</pre>\n\n<br>\n<small>Note: the above data would be un-orderable if, for example, <code>dw04</code> is added to the list of dependencies of <code>dw01</code>.</small>\n\n\n;C.f.:\n:* [[Topological sort/Extracted top item]].\n\n<br>\nThere are two popular algorithms for topological sorting:\n:* Kahn's 1962 topological sort <ref> [[wp: topological sorting]] </ref> \n:* depth-first search <ref> [[wp: topological sorting]] </ref> <ref> Jason Sachs\n[http://www.embeddedrelated.com/showarticle/799.php \"Ten little algorithms, part 4: topological sort\"] </ref>\n<br><br>\n\n","language":"00-TASK"},{"code":"V data = [\n ‘des_system_lib’ = Set(‘std synopsys std_cell_lib des_system_lib dw02 dw01 ramlib ieee’.split(‘ ’)),\n ‘dw01’ = Set(‘ieee dw01 dware gtech’.split(‘ ’)),\n ‘dw02’ = Set(‘ieee dw02 dware’.split(‘ ’)),\n ‘dw03’ = Set(‘std synopsys dware dw03 dw02 dw01 ieee gtech’.split(‘ ’)),\n ‘dw04’ = Set(‘dw04 ieee dw01 dware gtech’.split(‘ ’)),\n ‘dw05’ = Set(‘dw05 ieee dware’.split(‘ ’)),\n ‘dw06’ = Set(‘dw06 ieee dware’.split(‘ ’)),\n ‘dw07’ = Set(‘ieee dware’.split(‘ ’)),\n ‘dware’ = Set(‘ieee dware’.split(‘ ’)),\n ‘gtech’ = Set(‘ieee gtech’.split(‘ ’)),\n ‘ramlib’ = Set(‘std ieee’.split(‘ ’)),\n ‘std_cell_lib’ = Set(‘ieee std_cell_lib’.split(‘ ’)),\n ‘synopsys’ = Set[String]()\n]\n\nF toposort2(&data)\n L(k, v) data\n v.discard(k)\n\n Set[String] extra_items_in_deps\n L(v) data.values()\n extra_items_in_deps.update(v)\n extra_items_in_deps = extra_items_in_deps - Set(data.keys())\n\n L(item) extra_items_in_deps\n data[item] = Set[String]()\n\n [String] r\n L\n Set[String] ordered\n L(item, dep) data\n I dep.empty\n ordered.add(item)\n I ordered.empty\n L.break\n\n r.append(sorted(Array(ordered)).join(‘ ’))\n\n [String = Set[String]] new_data\n L(item, dep) data\n I item !C ordered\n new_data[item] = dep - ordered\n data = move(new_data)\n\n assert(data.empty, ‘A cyclic dependency exists’)\n R r\n\nprint(toposort2(&data).join(\"\\n\"))\n","language":"11l"},{"code":"with Ada.Containers.Vectors; use Ada.Containers;\n\npackage Digraphs is\n\n type Node_Idx_With_Null is new Natural;\n subtype Node_Index is Node_Idx_With_Null range 1 .. Node_Idx_With_Null'Last;\n -- a Node_Index is a number from 1, 2, 3, ... and the representative of a node\n\n type Graph_Type is tagged private;\n\n -- make sure Node is in Graph (possibly without connections)\n procedure Add_Node\n (Graph: in out Graph_Type'Class; Node: Node_Index);\n\n -- insert an edge From->To into Graph; do nothing if already there\n procedure Add_Connection\n (Graph: in out Graph_Type'Class; From, To: Node_Index);\n\n -- get the largest Node_Index used in any Add_Node or Add_Connection op.\n -- iterate over all nodes of Graph: \"for I in 1 .. Graph.Node_Count loop ...\"\n function Node_Count(Graph: Graph_Type) return Node_Idx_With_Null;\n\n -- remove an edge From->To from Fraph; do nothing if not there\n -- Graph.Node_Count is not changed\n procedure Del_Connection\n (Graph: in out Graph_Type'Class; From, To: Node_Index);\n\n -- check if an edge From->to exists in Graph\n function Connected\n (Graph: Graph_Type; From, To: Node_Index) return Boolean;\n\n -- data structure to store a list of nodes\n package Node_Vec is new Vectors(Positive, Node_Index);\n\n -- get a list of all nodes From->Somewhere in Graph\n function All_Connections\n (Graph: Graph_Type; From: Node_Index) return Node_Vec.Vector;\n\n Graph_Is_Cyclic: exception;\n\n -- a depth-first search to find a topological sorting of the nodes\n -- raises Graph_Is_Cyclic if no topological sorting is possible\n function Top_Sort\n (Graph: Graph_Type) return Node_Vec.Vector;\n\nprivate\n\n package Conn_Vec is new Vectors(Node_Index, Node_Vec.Vector, Node_Vec.\"=\");\n\n type Graph_Type is new Conn_Vec.Vector with null record;\n\nend Digraphs;\n","language":"Ada"},{"code":"package body Digraphs is\n\n function Node_Count(Graph: Graph_Type) return Node_Idx_With_Null is\n begin\n return Node_Idx_With_Null(Graph.Length);\n end Node_Count;\n\n procedure Add_Node(Graph: in out Graph_Type'Class; Node: Node_Index) is\n begin\n for I in Node_Index range Graph.Node_Count+1 .. Node loop\n Graph.Append(Node_Vec.Empty_Vector);\n end loop;\n end Add_Node;\n\n procedure Add_Connection\n (Graph: in out Graph_Type'Class; From, To: Node_Index) is\n begin\n Graph.Add_Node(Node_Index'Max(From, To));\n declare\n Connection_List: Node_Vec.Vector := Graph.Element(From);\n begin\n for I in Connection_List.First_Index .. Connection_List.Last_Index loop\n if Connection_List.Element(I) >= To then\n if Connection_List.Element(I) = To then\n return; -- if To is already there, don't add it a second time\n else -- I is the first index with Element(I)>To, insert To here\n Connection_List.Insert(Before => I, New_Item => To);\n Graph.Replace_Element(From, Connection_List);\n return;\n end if;\n end if;\n end loop;\n -- there was no I with no Element(I) > To, so insert To at the end\n Connection_List.Append(To);\n Graph.Replace_Element(From, Connection_List);\n return;\n end;\n end Add_Connection;\n\n procedure Del_Connection\n (Graph: in out Graph_Type'Class; From, To: Node_Index) is\n Connection_List: Node_Vec.Vector := Graph.Element(From);\n begin\n for I in Connection_List.First_Index .. Connection_List.Last_Index loop\n if Connection_List.Element(I) = To then\n Connection_List.Delete(I);\n Graph.Replace_Element(From, Connection_List);\n return; -- we are done\n end if;\n end loop;\n end Del_Connection;\n\n function Connected\n (Graph: Graph_Type; From, To: Node_Index) return Boolean is\n Connection_List: Node_Vec.Vector renames Graph.Element(From);\n begin\n for I in Connection_List.First_Index .. Connection_List.Last_Index loop\n if Connection_List.Element(I) = To then\n return True;\n end if;\n end loop;\n return False;\n end Connected;\n\n function All_Connections\n (Graph: Graph_Type; From: Node_Index) return Node_Vec.Vector is\n begin\n return Graph.Element(From);\n end All_Connections;\n\n function Top_Sort\n (Graph: Graph_Type) return Node_Vec.Vector is\n\n Result: Node_Vec.Vector;\n Visited: array(1 .. Graph.Node_Count) of Boolean := (others => False);\n Active: array(1 .. Graph.Node_Count) of Boolean := (others => False);\n\n procedure Visit(Node: Node_Index) is\n begin\n if not Visited(Node) then\n Visited(Node) := True;\n Active(Node) := True;\n declare\n Cons: Node_Vec.Vector := All_Connections(Graph, Node);\n begin\n for Idx in Cons.First_Index .. Cons.Last_Index loop\n Visit(Cons.Element(Idx));\n end loop;\n end;\n Active(Node) := False;\n Result.Append(Node);\n else\n if Active(Node) then\n raise Constraint_Error with \"Graph is Cyclic\";\n end if;\n end if;\n end Visit;\n\n begin\n for Some_Node in Visited'Range loop\n Visit(Some_Node);\n end loop;\n return Result;\n end Top_Sort;\n\nend Digraphs;\n","language":"Ada"},{"code":"private with Ada.Containers.Indefinite_Vectors;\n\ngeneric\n type Index_Type_With_Null is new Natural;\npackage Set_Of_Names is\n subtype Index_Type is Index_Type_With_Null\n range 1 .. Index_Type_With_Null'Last;\n -- manage a set of strings;\n -- each string in the set is assigned a unique index of type Index_Type\n\n type Set is tagged private;\n\n -- inserts Name into Names; do nothing if already there;\n procedure Add(Names: in out Set; Name: String);\n\n -- Same operation, additionally emiting Index=Names.Idx(Name)\n procedure Add(Names: in out Set; Name: String; Index: out Index_Type);\n\n -- remove Name from Names; do nothing if not found\n -- the removal may change the index of other strings in Names\n procedure Sub(Names: in out Set; Name: String);\n\n -- returns the unique index of Name in Set; or 0 if Name is not there\n function Idx(Names: Set; Name: String) return Index_Type_With_Null;\n\n -- returns the unique name of Index;\n function Name(Names: Set; Index: Index_Type) return String;\n\n -- first index, last index and total number of names in set\n -- to iterate over Names, use \"for I in Names.Start .. Names.Stop loop ...\n function Start(Names: Set) return Index_Type;\n function Stop(Names: Set) return Index_Type_With_Null;\n function Size(Names: Set) return Index_Type_With_Null;\n\nprivate\n\n package Vecs is new Ada.Containers.Indefinite_Vectors\n (Index_Type => Index_Type, Element_Type => String);\n\n type Set is new Vecs.Vector with null record;\n\nend Set_Of_Names;\n","language":"Ada"},{"code":"package body Set_Of_Names is\n\n use type Ada.Containers.Count_Type, Vecs.Cursor;\n\n function Start(Names: Set) return Index_Type is\n begin\n if Names.Length = 0 then\n return 1;\n else\n return Names.First_Index;\n end if;\n end Start;\n\n function Stop(Names: Set) return Index_Type_With_Null is\n begin\n if Names.Length=0 then\n return 0;\n else\n return Names.Last_Index;\n end if;\n end Stop;\n\n function Size(Names: Set) return Index_Type_With_Null is\n begin\n return Index_Type_With_Null(Names.Length);\n end Size;\n\n procedure Add(Names: in out Set; Name: String; Index: out Index_Type) is\n I: Index_Type_With_Null := Names.Idx(Name);\n begin\n if I = 0 then -- Name is not yet in Set\n Names.Append(Name);\n Index := Names.Stop;\n else\n Index := I;\n end if;\n end Add;\n\n procedure Add(Names: in out Set; Name: String) is\n I: Index_Type;\n begin\n Names.Add(Name, I);\n end Add;\n\n procedure Sub(Names: in out Set; Name: String) is\n I: Index_Type_With_Null := Names.Idx(Name);\n begin\n if I /= 0 then -- Name is in set\n Names.Delete(I);\n end if;\n end Sub;\n\n function Idx(Names: Set; Name: String) return Index_Type_With_Null is\n begin\n for I in Names.First_Index .. Names.Last_Index loop\n if Names.Element(I) = Name then\n return I;\n end if;\n end loop;\n return 0;\n end Idx;\n\n function Name(Names: Set; Index: Index_Type) return String is\n begin\n return Names.Element(Index);\n end Name;\n\nend Set_Of_Names;\n","language":"Ada"},{"code":"with Ada.Text_IO, Digraphs, Set_Of_Names, Ada.Command_Line;\n\nprocedure Toposort is\n\n -- shortcuts for package names, intantiation of generic package\n package TIO renames Ada.Text_IO;\n package DG renames Digraphs;\n package SN is new Set_Of_Names(DG.Node_Idx_With_Null);\n\n -- reat the graph from the file with the given Filename\n procedure Read(Filename: String; G: out DG.Graph_Type; N: out SN.Set) is\n\n -- finds the first word in S(Start .. S'Last), delimited by spaces\n procedure Find_Token(S: String; Start: Positive;\n First: out Positive; Last: out Natural) is\n\n begin\n First := Start;\n while First <= S'Last and then S(First)= ' ' loop\n First := First + 1;\n end loop;\n Last := First-1;\n while Last < S'Last and then S(Last+1) /= ' ' loop\n Last := Last + 1;\n end loop;\n end Find_Token;\n\n File: TIO.File_Type;\n begin\n TIO.Open(File, TIO.In_File, Filename);\n TIO.Skip_Line(File, 2);\n -- the first two lines contain header and \"===...===\"\n while not TIO.End_Of_File(File) loop\n declare\n Line: String := TIO.Get_Line(File);\n First: Positive;\n Last: Natural;\n To, From: DG.Node_Index;\n begin\n Find_Token(Line, Line'First, First, Last);\n if Last >= First then\n N.Add(Line(First .. Last), From);\n G.Add_Node(From);\n loop\n Find_Token(Line, Last+1, First, Last);\n exit when Last < First;\n N.Add(Line(First .. Last), To);\n G.Add_Connection(From, To);\n end loop;\n end if;\n end;\n end loop;\n TIO.Close(File);\n end Read;\n\n Graph: DG.Graph_Type;\n Names: SN.Set;\n\nbegin\n Read(Ada.Command_Line.Argument(1), Graph, Names);\n\n -- eliminat self-cycles\n for Start in 1 .. Graph.Node_Count loop\n Graph.Del_Connection(Start, Start);\n end loop;\n\n -- perform the topological sort and output the result\n declare\n Result: DG.Node_Vec.Vector;\n begin\n Result := Graph.Top_Sort;\n for Index in Result.First_Index .. Result.Last_Index loop\n TIO.Put(Names.Name(Result.Element(Index)));\n if Index < Result.Last_Index then\n TIO.Put(\" -> \");\n end if;\n end loop;\n TIO.New_Line;\n exception\n when DG.Graph_Is_Cyclic =>\n TIO.Put_Line(\"There is no topological sorting -- the Graph is cyclic!\");\n end;\nend Toposort;\n","language":"Ada"},{"code":"(*------------------------------------------------------------------*)\n(* The Rosetta Code topological sort task. *)\n(*------------------------------------------------------------------*)\n\n#include \"share/atspre_staload.hats\"\nstaload UN = \"prelude/SATS/unsafe.sats\"\n\n(* Macros for list construction. *)\n#define NIL list_nil ()\n#define :: list_cons\n\n(*------------------------------------------------------------------*)\n(* A shorthand for list reversal. This could also have been written as\n a macro. *)\n\nfn {a : t@ype}\nrev {n : int}\n (lst : list (INV(a), n))\n :<!wrt> list (a, n) =\n (* The list_reverse template function returns a linear list. Convert\n that result to a \"regular\" list. *)\n list_vt2t (list_reverse<a> lst)\n\n(*------------------------------------------------------------------*)\n(* Some shorthands for string operations. These are written as\n macros. *)\n\nmacdef substr (s, i, n) =\n (* string_make_substring returns a linear strnptr, but we want a\n \"regular\" string. *)\n strnptr2string (string_make_substring (,(s), ,(i), ,(n)))\n\nmacdef copystr (s) =\n (* string0 copy returns a linear strptr, but we want a \"regular\"\n string. *)\n strptr2string (string0_copy (,(s)))\n\n(*------------------------------------------------------------------*)\n\nlocal\n\n (* A boolean type for setting marks, and a vector of those. *)\n typedef _mark_t = [b : nat | b <= 1] uint8 b\n typedef _marksvec_t (n : int) = arrayref (_mark_t, n)\n\n (* Some type casts that seem not to be implemented in the\n prelude. *)\n implement g1int2uint<intknd, uint8knd> i = $UN.cast i\n implement g1uint2int<uint8knd, intknd> i = $UN.cast i\n\nin\n\n abstype marks (n : int)\n assume marks n = _marksvec_t n\n\n fn marks_make_elt\n {n : nat}\n {b : int | b == 0 || b == 1}\n (n : size_t n,\n b : int b)\n :<!wrt> _marksvec_t n =\n arrayref_make_elt (n, g1i2u b)\n\n fn\n marks_set_at\n {n : int}\n {i : nat | i < n}\n {b : int | b == 0 || b == 1}\n (vec : _marksvec_t n,\n i : size_t i,\n b : int b)\n :<!refwrt> void =\n vec[i] := g1i2u b\n\n fn\n marks_get_at\n {n : int}\n {i : nat | i < n}\n (vec : _marksvec_t n,\n i : size_t i)\n :<!ref> [b : int | b == 0 || b == 1]\n int b =\n g1u2i vec[i]\n\n fn\n marks_setall\n {n : int}\n {b : int | b == 0 || b == 1}\n (vec : _marksvec_t n,\n n : size_t n,\n b : int b)\n :<!refwrt> void =\n let\n prval () = lemma_arrayref_param vec\n var i : [i : nat | i <= n] size_t i\n in\n for* {i : nat | i <= n}\n .<n - i>.\n (i : size_t i) =>\n (i := i2sz 0; i <> n; i := succ i)\n vec[i] := g1i2u b\n end\n\n overload [] with marks_set_at of 100\n overload [] with marks_get_at of 100\n overload setall with marks_setall of 100\n\nend\n\n(*------------------------------------------------------------------*)\n(* Reading dependencies from a file. The format is kept very simple,\n because this is not a task about parsing. (Though I have written\n an S-expression parser in ATS, and there is JSON support in the\n ATS contributions package.) *)\n\n(* The format of a dependencies description. The second and later\n entries of each sublist forms the list of dependencies of the first\n entry. Thus this is a kind of association list. *)\ntypedef depdesc (n : int) = list (List1 String1, n)\ntypedef depdesc = [n : nat] depdesc n\n\ntypedef char_skipper =\n {n : int}\n {i : nat | i <= n}\n (string n,\n size_t n,\n size_t i) -<cloref> (* A closure. *)\n [j : int | i <= j; j <= n]\n size_t j\n\nfn\nmake_char_skipper\n (match : char -<> bool)\n :<> char_skipper =\n let\n fun\n skipper {n : int}\n {i : nat | i <= n}\n .<n - i>.\n (s : string n,\n n : size_t n,\n i : size_t i)\n :<cloref> [j : int | i <= j; j <= n]\n size_t j =\n if i = n then\n i\n else if ~match s[i] then\n i\n else\n skipper (s, n, succ i)\n in\n skipper (* Return a closure. *)\n end\n\nval skip_spaces = make_char_skipper (lam c => isspace c)\nval skip_ident =\n make_char_skipper (lam c => (~isspace c) * (c <> ';'))\n\nfn is_end_of_list (c : char) :<> bool = (c = ';')\n\nfn\nread_row {n : int}\n {i : nat | i <= n}\n (text : string n,\n n : size_t n,\n i : size_t i)\n :<!wrt> [j : int | i <= j; j <= n]\n @(List0 String1, size_t j) =\n let\n fun\n loop {i : nat | i <= n}\n .<n - i>.\n (row : List0 String1,\n i : size_t i)\n :<!wrt> [j : int | i <= j; j <= n]\n @(List0 String1, size_t j) =\n let\n val i = skip_spaces (text, n, i)\n in\n if i = n then\n @(rev row, i)\n else if is_end_of_list text[i] then\n @(rev row, succ i)\n else\n let\n val j = skip_ident (text, n, i)\n val () = $effmask_exn assertloc (i < j)\n val nodename = substr (text, i, j - i)\n in\n loop (nodename :: row, j)\n end\n end\n in\n loop (NIL, i)\n end\n\nfn\nread_desc {n : int}\n {i : nat | i <= n}\n (text : string n,\n n : size_t n,\n i : size_t i)\n :<!wrt> [j : int | i <= j; j <= n]\n @(depdesc, size_t j) =\n let\n fun\n loop {i : nat | i <= n}\n .<n - i>.\n (desc : depdesc,\n i : size_t i)\n :<!wrt> [j : int | i <= j; j <= n]\n @(depdesc, size_t j) =\n let\n val i = skip_spaces (text, n, i)\n in\n if i = n then\n @(rev desc, i)\n else if is_end_of_list text[i] then\n @(rev desc, succ i)\n else\n let\n val @(row, j) = read_row (text, n, i)\n val () = $effmask_exn assertloc (i < j)\n in\n if length row = 0 then\n loop (desc, j)\n else\n loop (row :: desc, j)\n end\n end\n in\n loop (NIL, i)\n end\n\nfn\nread_to_string ()\n : String =\n (* This simple implementation reads input only up to a certain\n size. *)\n let\n #define BUFSIZE 8296\n var buf = @[char][BUFSIZE] ('\\0')\n var c : int = $extfcall (int, \"getchar\")\n var i : Size_t = i2sz 0\n in\n while ((0 <= c) * (i < pred (i2sz BUFSIZE)))\n begin\n buf[i] := int2char0 c;\n i := succ i;\n c := $extfcall (int, \"getchar\")\n end;\n copystr ($UN.cast{string} (addr@ buf))\n end\n\nfn\nread_depdesc ()\n : depdesc =\n let\n val text = read_to_string ()\n prval () = lemma_string_param text\n val n = strlen text\n val @(desc, _) = read_desc (text, n, i2sz 0)\n in\n desc\n end\n\n(*------------------------------------------------------------------*)\n(* Conversion of a dependencies description to the internal\n representation for a topological sort. *)\n\n(* An ordered list of the node names. *)\ntypedef nodenames (n : int) = list (String1, n)\n\n(* A more efficient representation for nodes: integers in 0..n-1. *)\ntypedef nodenum (n : int) = [num : nat | num <= n - 1] size_t num\n\n(* A collection of directed edges. Edges go from the nodenum that is\n represented by the array index, to each of the nodenums listed in\n the corresponding array entry. *)\ntypedef edges (n : int) = arrayref (List0 (nodenum n), n)\n\n(* An internal representation of data for a topological sort. *)\ntypedef topodata (n : int) =\n '{\n n = size_t n, (* The number of nodes. *)\n edges = edges n, (* Directed edges. *)\n tempmarks = marks n, (* Temporary marks. *)\n permmarks = marks n (* Permanent marks. *)\n }\n\nfn\ncollect_nodenames\n (desc : depdesc)\n :<!wrt> [n : nat]\n @(nodenames n,\n size_t n) =\n let\n fun\n collect_row\n {m : nat}\n {n0 : nat}\n .<m>.\n (row : list (String1, m),\n names : &nodenames n0 >> nodenames n1,\n n : &size_t n0 >> size_t n1)\n :<!wrt> #[n1 : int | n0 <= n1]\n void =\n case+ row of\n | NIL => ()\n | head :: tail =>\n let\n implement list_find$pred<String1> s = (s = head)\n in\n case+ list_find_opt<String1> names of\n | ~ None_vt () =>\n begin\n names := head :: names;\n n := succ n;\n collect_row (tail, names, n)\n end\n | ~ Some_vt _ => collect_row (tail, names, n)\n end\n\n fun\n collect {m : nat}\n {n0 : nat}\n .<m>.\n (desc : list (List1 String1, m),\n names : &nodenames n0 >> nodenames n1,\n n : &size_t n0 >> size_t n1)\n :<!wrt> #[n1 : int | n0 <= n1]\n void =\n case+ desc of\n | NIL => ()\n | head :: tail =>\n begin\n collect_row (head, names, n);\n collect (tail, names, n)\n end\n\n var names : List0 String1 = NIL\n var n : Size_t = i2sz 0\n in\n collect (desc, names, n);\n @(rev names, n)\n end\n\nfn\nnodename_number\n {n : int}\n (nodenames : nodenames n,\n name : String1)\n :<> Option (nodenum n) =\n let\n fun\n loop {i : nat | i <= n}\n .<n - i>.\n (names : nodenames (n - i),\n i : size_t i)\n :<> Option (nodenum n) =\n case+ names of\n | NIL => None ()\n | head :: tail =>\n if head = name then\n Some i\n else\n loop (tail, succ i)\n\n prval () = lemma_list_param nodenames\n in\n loop (nodenames, i2sz 0)\n end\n\nfn\nadd_edge {n : int}\n (edges : edges n,\n from : nodenum n,\n to : nodenum n)\n :<!refwrt> void =\n (* This implementation does not store duplicate edges. *)\n let\n val old_edges = edges[from]\n implement list_find$pred<nodenum n> s = (s = to)\n in\n case+ list_find_opt<nodenum n> old_edges of\n | ~ None_vt () => edges[from] := to :: old_edges\n | ~ Some_vt _ => ()\n end\n\nfn\nfill_edges\n {n : int}\n {m : int}\n (edges : edges n,\n n : size_t n,\n desc : depdesc m,\n nodenames : nodenames n)\n :<!refwrt> void =\n let\n prval () = lemma_list_param desc\n prval () = lemma_list_param nodenames\n\n fn\n clear_edges ()\n :<!refwrt> void =\n let\n var i : [i : nat | i <= n] size_t i\n in\n for* {i : nat | i <= n}\n .<n - i>.\n (i : size_t i) =>\n (i := i2sz 0; i <> n; i := succ i)\n edges[i] := NIL\n end\n\n fun\n fill_from_desc_entry\n {m1 : nat}\n .<m1>.\n (headnum : nodenum n,\n lst : list (String1, m1))\n :<!refwrt> void =\n case+ lst of\n | NIL => ()\n | name :: tail =>\n let\n val- Some num = nodename_number (nodenames, name)\n in\n if num <> headnum then\n add_edge {n} (edges, num, headnum);\n fill_from_desc_entry (headnum, tail)\n end\n\n fun\n fill_from_desc\n {m2 : nat}\n .<m2>.\n (lst : list (List1 String1, m2))\n :<!refwrt> void =\n case+ lst of\n | NIL => ()\n | list_entry :: tail =>\n let\n val+ headname :: desc_entry = list_entry\n val- Some headnum = nodename_number (nodenames, headname)\n in\n fill_from_desc_entry (headnum, desc_entry);\n fill_from_desc tail\n end\n in\n clear_edges ();\n fill_from_desc desc\n end\n\nfn\ntopodata_make\n (desc : depdesc)\n :<!refwrt> [n : nat]\n @(topodata n,\n nodenames n) =\n let\n val @(nodenames, n) = collect_nodenames desc\n prval () = lemma_g1uint_param n\n prval [n : int] EQINT () = eqint_make_guint n\n\n val edges = arrayref_make_elt<List0 (nodenum n)> (n, NIL)\n val () = fill_edges {n} (edges, n, desc, nodenames)\n\n val tempmarks = marks_make_elt (n, 0)\n and permmarks = marks_make_elt (n, 0)\n\n val topo =\n '{\n n = n,\n edges = edges,\n tempmarks = tempmarks,\n permmarks = permmarks\n }\n in\n @(topo, nodenames)\n end\n\n(*------------------------------------------------------------------*)\n(*\n\n Topological sort by depth-first search. See\n https://en.wikipedia.org/w/index.php?title=Topological_sorting&oldid=1092588874#Depth-first_search\n\n*)\n\n(* What return values are made from. *)\ndatatype toporesult (a : t@ype, n : int) =\n| {0 <= n}\n Topo_SUCCESS (a, n) of list (a, n)\n| Topo_CYCLE (a, n) of List1 a\ntypedef toporesult (a : t@ype) = [n : int] toporesult (a, n)\n\nfn\nfind_unmarked_node\n {n : int}\n (topo : topodata n)\n :<!ref> Option (nodenum n) =\n let\n val n = topo.n\n and permmarks = topo.permmarks\n\n prval () = lemma_g1uint_param n\n\n fun\n loop {i : nat | i <= n}\n .<n - i>.\n (i : size_t i)\n :<!ref> Option (nodenum n) =\n if i = n then\n None ()\n else if permmarks[i] = 0 then\n Some i\n else\n loop (succ i)\n in\n loop (i2sz 0)\n end\n\nfun\nvisit {n : int}\n (topo : topodata n,\n nodenum : nodenum n,\n accum : List0 (nodenum n),\n path : List0 (nodenum n))\n : toporesult (nodenum n) =\n (* Probably it is cumbersome to include a proof this routine\n terminates. Thus I will not try to write one. *)\n let\n val n = topo.n\n and edges = topo.edges\n and tempmarks = topo.tempmarks\n and permmarks = topo.permmarks\n in\n if permmarks[nodenum] = 1 then\n Topo_SUCCESS accum\n else if tempmarks[nodenum] = 1 then\n let\n val () = assertloc (isneqz path)\n in\n Topo_CYCLE path\n end\n else\n let\n fun\n recursive_visits\n {k : nat}\n .<k>.\n (topo : topodata n,\n to_visit : list (nodenum n, k),\n accum : List0 (nodenum n),\n path : List0 (nodenum n))\n : toporesult (nodenum n) =\n case+ to_visit of\n | NIL => Topo_SUCCESS accum\n | node_to_visit :: tail =>\n begin\n case+ visit (topo, node_to_visit, accum, path) of\n | Topo_SUCCESS accum1 =>\n recursive_visits (topo, tail, accum1, path)\n | other => other\n end\n in\n tempmarks[nodenum] := 1;\n case+ recursive_visits (topo, edges[nodenum], accum,\n nodenum :: path) of\n | Topo_SUCCESS accum1 =>\n begin\n tempmarks[nodenum] := 0;\n permmarks[nodenum] := 1;\n Topo_SUCCESS (nodenum :: accum1)\n end\n | other => other\n end\n end\n\nfn\ntopological_sort\n {n : int}\n (topo : topodata n)\n : toporesult (nodenum n, n) =\n let\n prval () = lemma_arrayref_param (topo.edges)\n\n fun\n sort (accum : List0 (nodenum n))\n : toporesult (nodenum n, n) =\n case+ find_unmarked_node topo of\n | None () =>\n let\n prval () = lemma_list_param accum\n val () = assertloc (i2sz (length accum) = topo.n)\n in\n Topo_SUCCESS accum\n end\n | Some nodenum =>\n begin\n case+ visit (topo, nodenum, accum, NIL) of\n | Topo_SUCCESS accum1 => sort accum1\n | Topo_CYCLE cycle => Topo_CYCLE cycle\n end\n\n val () = setall (topo.tempmarks, topo.n, 0)\n and () = setall (topo.permmarks, topo.n, 0)\n\n val accum = sort NIL\n\n val () = setall (topo.tempmarks, topo.n, 0)\n and () = setall (topo.permmarks, topo.n, 0)\n in\n accum\n end\n\n(*------------------------------------------------------------------*)\n(* The function asked for in the task. *)\n\nfn\nfind_a_valid_order\n (desc : depdesc)\n : toporesult String1 =\n let\n val @(topo, nodenames) = topodata_make desc\n\n prval [n : int] EQINT () = eqint_make_guint (topo.n)\n\n val nodenames_array =\n arrayref_make_list<String1> (sz2i (topo.n), nodenames)\n\n implement\n list_map$fopr<nodenum n><String1> i =\n nodenames_array[i]\n\n (* A shorthand for mapping from nodenum to string. *)\n macdef map (lst) =\n list_vt2t (list_map<nodenum n><String1> ,(lst))\n in\n case+ topological_sort topo of\n | Topo_SUCCESS valid_order => Topo_SUCCESS (map valid_order)\n | Topo_CYCLE cycle => Topo_CYCLE (map cycle)\n end\n\n(*------------------------------------------------------------------*)\n\nimplement\nmain0 (argc, argv) =\n let\n val desc = read_depdesc ()\n in\n case+ find_a_valid_order desc of\n | Topo_SUCCESS valid_order =>\n println! (valid_order : List0 string)\n | Topo_CYCLE cycle =>\n let\n val last = list_last cycle\n val cycl = rev (last :: cycle)\n in\n println! (\"COMPILATION CYCLE: \", cycl : List0 string)\n end\n end\n\n(*------------------------------------------------------------------*)\n","language":"ATS"},{"code":"( (\"des_system_lib\".std synopsys \"std_cell_lib\" \"des_system_lib\" dw02 dw01 ramlib ieee)\n (dw01.ieee dw01 dware gtech)\n (dw02.ieee dw02 dware)\n (dw03.std synopsys dware dw03 dw02 dw01 ieee gtech)\n (dw04.dw04 ieee dw01 dware gtech)\n (dw05.dw05 ieee dware)\n (dw06.dw06 ieee dware)\n (dw07.ieee dware)\n (dware.ieee dware)\n (gtech.ieee gtech)\n (ramlib.std ieee)\n (\"std_cell_lib\".ieee \"std_cell_lib\")\n (synopsys.)\n (cycle-11.cycle-12)\n (cycle-12.cycle-11)\n (cycle-21.dw01 cycle-22 dw02 dw03)\n (cycle-22.cycle-21 dw01 dw04)\n : ?libdeps\n& :?indeps\n& ( toposort\n = A Z res module dependants todo done\n . !arg:(?todo.?done)\n & ( areDone\n =\n . !arg:\n | !arg\n : ( %@\n : [%( !module+!done+!indeps:?+(? !sjt ?)+?\n | ~(!libdeps:? (!sjt.?) ?)\n & !sjt !indeps:?indeps\n )\n )\n ?arg\n & areDone$!arg\n )\n & ( !todo\n : ?A\n (?module.?dependants&areDone$!dependants)\n ( ?Z\n & toposort$(!A !Z.!done !module):?res\n )\n & !res\n | (!todo.!done)\n )\n )\n& toposort$(!libdeps.):(?cycles.?res)\n& out$(\"\ncompile order:\" !indeps !res \"\\ncycles:\" !cycles)\n);\n","language":"Bracmat"},{"code":"#include <stdio.h>\n#include <stdlib.h>\n#include <string.h>\n#include <ctype.h>\n\nchar input[] =\n\t\"des_system_lib std synopsys std_cell_lib des_system_lib dw02 dw01 ramlib ieee\\n\"\n\t\"dw01 ieee dw01 dware gtech\\n\"\n\t\"dw02 ieee dw02 dware\\n\"\n\t\"dw03 std synopsys dware dw03 dw02 dw01 ieee gtech\\n\"\n\t\"dw04 dw04 ieee dw01 dware gtech\\n\"\n\t\"dw05 dw05 ieee dware\\n\"\n\t\"dw06 dw06 ieee dware\\n\"\n\t\"dw07 ieee dware\\n\"\n\t\"dware ieee dware\\n\"\n\t\"gtech ieee gtech\\n\"\n\t\"ramlib std ieee\\n\"\n\t\"std_cell_lib ieee std_cell_lib\\n\"\n\t\"synopsys\\n\"\n\t\"cycle_11\t cycle_12\\n\"\n\t\"cycle_12\t cycle_11\\n\"\n\t\"cycle_21\t dw01 cycle_22 dw02 dw03\\n\"\n\t\"cycle_22\t cycle_21 dw01 dw04\";\n\ntypedef struct item_t item_t, *item;\nstruct item_t { const char *name; int *deps, n_deps, idx, depth; };\n\nint get_item(item *list, int *len, const char *name)\n{\n\tint i;\n\titem lst = *list;\n\n\tfor (i = 0; i < *len; i++)\n\t\tif (!strcmp(lst[i].name, name)) return i;\n\n\tlst = *list = realloc(lst, ++*len * sizeof(item_t));\n\ti = *len - 1;\n\tmemset(lst + i, 0, sizeof(item_t));\n\tlst[i].idx = i;\n\tlst[i].name = name;\n\treturn i;\n}\n\nvoid add_dep(item it, int i)\n{\n\tif (it->idx == i) return;\n\tit->deps = realloc(it->deps, (it->n_deps + 1) * sizeof(int));\n\tit->deps[it->n_deps++] = i;\n}\n\nint parse_input(item *ret)\n{\n\tint n_items = 0;\n\tint i, parent, idx;\n\titem list = 0;\n\n\tchar *s, *e, *word, *we;\n\tfor (s = input; ; s = 0) {\n\t\tif (!(s = strtok_r(s, \"\\n\", &e))) break;\n\n\t\tfor (i = 0, word = s; ; i++, word = 0) {\n\t\t\tif (!(word = strtok_r(word, \" \\t\", &we))) break;\n\t\t\tidx = get_item(&list, &n_items, word);\n\n\t\t\tif (!i) parent = idx;\n\t\t\telse add_dep(list + parent, idx);\n\t\t}\n\t}\n\n\t*ret = list;\n\treturn n_items;\n}\n\n/* recursively resolve compile order; negative means loop */\nint get_depth(item list, int idx, int bad)\n{\n\tint max, i, t;\n\n\tif (!list[idx].deps)\n\t\treturn list[idx].depth = 1;\n\n\tif ((t = list[idx].depth) < 0) return t;\n\n\tlist[idx].depth = bad;\n\tfor (max = i = 0; i < list[idx].n_deps; i++) {\n\t\tif ((t = get_depth(list, list[idx].deps[i], bad)) < 0) {\n\t\t\tmax = t;\n\t\t\tbreak;\n\t\t}\n\t\tif (max < t + 1) max = t + 1;\n\t}\n\treturn list[idx].depth = max;\n}\n\nint main()\n{\n\tint i, j, n, bad = -1, max, min;\n\titem items;\n\tn = parse_input(&items);\n\n\tfor (i = 0; i < n; i++)\n\t\tif (!items[i].depth && get_depth(items, i, bad) < 0) bad--;\n\n\tfor (i = 0, max = min = 0; i < n; i++) {\n\t\tif (items[i].depth > max) max = items[i].depth;\n\t\tif (items[i].depth < min) min = items[i].depth;\n\t}\n\n\tprintf(\"Compile order:\\n\");\n\tfor (i = min; i <= max; i++) {\n\t\tif (!i) continue;\n\n\t\tif (i < 0) printf(\" [unorderable]\");\n\t\telse\t printf(\"%d:\", i);\n\n\t\tfor (j = 0; j < n || !putchar('\\n'); j++)\n\t\t\tif (items[j].depth == i)\n\t\t\t\tprintf(\" %s\", items[j].name);\n\t}\n\n\treturn 0;\n}\n","language":"C"},{"code":"Compile order:\n [unorderable] cycle_21 cycle_22\n [unorderable] cycle_11 cycle_12\n1: std synopsys ieee\n2: std_cell_lib ramlib dware gtech\n3: dw02 dw01 dw05 dw06 dw07\n4: des_system_lib dw03 dw04\n","language":"C"},{"code":"#include <map>\n#include <set>\n\ntemplate<typename Goal>\nclass topological_sorter {\nprotected:\n struct relations {\n std::size_t dependencies;\n std::set<Goal> dependents;\n };\n std::map<Goal, relations> map;\npublic:\n void add_goal(Goal const &goal) {\n map[goal];\n }\n void add_dependency(Goal const &goal, Goal const &dependency) {\n if (dependency == goal)\n return;\n auto &dependents = map[dependency].dependents;\n if (dependents.find(goal) == dependents.end()) {\n dependents.insert(goal);\n ++map[goal].dependencies;\n }\n }\n template<typename Container>\n void add_dependencies(Goal const &goal, Container const &dependencies) {\n for (auto const &dependency : dependencies)\n add_dependency(goal, dependency);\n }\n template<typename ResultContainer, typename CyclicContainer>\n void destructive_sort(ResultContainer &sorted, CyclicContainer &unsortable) {\n sorted.clear();\n unsortable.clear();\n for (auto const &lookup : map) {\n auto const &goal = lookup.first;\n auto const &relations = lookup.second;\n if (relations.dependencies == 0)\n sorted.push_back(goal);\n }\n for (std::size_t index = 0; index < sorted.size(); ++index)\n for (auto const &goal : map[sorted[index]].dependents)\n if (--map[goal].dependencies == 0)\n sorted.push_back(goal);\n for (auto const &lookup : map) {\n auto const &goal = lookup.first;\n auto const &relations = lookup.second;\n if (relations.dependencies != 0)\n unsortable.push_back(goal);\n }\n }\n template<typename ResultContainer, typename CyclicContainer>\n void sort(ResultContainer &sorted, CyclicContainer &unsortable) {\n topological_sorter<Goal> temporary = *this;\n temporary.destructive_sort(sorted, unsortable);\n }\n void clear() {\n map.clear();\n }\n};\n\n/*\n Example usage with text strings\n */\n\n#include <fstream>\n#include <sstream>\n#include <iostream>\n#include <string>\n#include <vector>\n\nusing namespace std;\n\nvoid display_heading(string const &message) {\n cout << endl << \"~ \" << message << \" ~\" << endl;\n}\nvoid display_results(string const &input) {\n topological_sorter<string> sorter;\n vector<string> sorted, unsortable;\n stringstream lines(input);\n string line;\n while (getline(lines, line)) {\n stringstream buffer(line);\n string goal, dependency;\n buffer >> goal;\n sorter.add_goal(goal);\n while (buffer >> dependency)\n sorter.add_dependency(goal, dependency);\n }\n sorter.destructive_sort(sorted, unsortable);\n if (sorted.size() == 0)\n display_heading(\"Error: no independent variables found!\");\n else {\n display_heading(\"Result\");\n for (auto const &goal : sorted)\n cout << goal << endl;\n }\n if (unsortable.size() != 0) {\n display_heading(\"Error: cyclic dependencies detected!\");\n for (auto const &goal : unsortable)\n cout << goal << endl;\n }\n}\nint main(int argc, char **argv) {\n if (argc == 1) {\n string example = \"des_system_lib std synopsys std_cell_lib des_system_lib dw02 dw01 ramlib ieee\\n\"\n \"dw01 ieee dw01 dware gtech\\n\"\n \"dw02 ieee dw02 dware\\n\"\n \"dw03 std synopsys dware dw03 dw02 dw01 ieee gtech\\n\"\n \"dw04 dw04 ieee dw01 dware gtech\\n\"\n \"dw05 dw05 ieee dware\\n\"\n \"dw06 dw06 ieee dware\\n\"\n \"dw07 ieee dware\\n\"\n \"dware ieee dware\\n\"\n \"gtech ieee gtech\\n\"\n \"ramlib std ieee\\n\"\n \"std_cell_lib ieee std_cell_lib\\n\"\n \"synopsys\\n\"\n \"cycle_11 cycle_12\\n\"\n \"cycle_12 cycle_11\\n\"\n \"cycle_21 dw01 cycle_22 dw02 dw03\\n\"\n \"cycle_22 cycle_21 dw01 dw04\";\n display_heading(\"Example: each line starts with a goal followed by it's dependencies\");\n cout << example << endl;\n display_results(example);\n display_heading(\"Enter lines of data (press enter when finished)\");\n string line, data;\n while (getline(cin, line) && !line.empty())\n data += line + '\\n';\n if (!data.empty())\n display_results(data);\n } else\n while (*(++argv)) {\n ifstream file(*argv);\n typedef istreambuf_iterator<char> iterator;\n display_results(string(iterator(file), iterator()));\n }\n}\n","language":"C++"},{"code":"#include <unordered_map>\n#include <unordered_set>\n#include <vector>\n\ntemplate <typename ValueType>\nclass topological_sorter\n{\npublic:\n using value_type = ValueType;\n\nprotected:\n struct relations\n {\n std::size_t dependencies { 0 };\n std::unordered_set<value_type> dependents {};\n };\n\n std::unordered_map<value_type, relations> _map {};\n\npublic:\n void add(const value_type &object)\n {\n _map.try_emplace(object, relations {});\n }\n\n void add(const value_type &object, const value_type &dependency)\n {\n if (dependency == object) return;\n\n auto &dependents = _map[dependency].dependents;\n\n if (dependents.find(object) == std::end(dependents))\n {\n dependents.insert(object);\n\n ++_map[object].dependencies;\n }\n }\n\n template <typename Container>\n void add(const value_type &object, const Container &dependencies)\n {\n for (auto const &dependency : dependencies) add(object, dependency);\n }\n\n void add(const value_type &object, const std::initializer_list<value_type> &dependencies)\n {\n add<std::initializer_list<value_type>>(object, dependencies);\n }\n\n template<typename... Args>\n void add(const value_type &object, const Args&... dependencies)\n {\n (add(object, dependencies), ...);\n }\n\n auto sort()\n {\n std::vector<value_type> sorted, cycled;\n auto map { _map };\n\n for (const auto &[object, relations] : map) if (!relations.dependencies) sorted.emplace_back(object);\n\n for (decltype(std::size(sorted)) idx = 0; idx < std::size(sorted); ++idx)\n for (auto const& object : map[sorted[idx]].dependents)\n if (!--map[object].dependencies) sorted.emplace_back(object);\n\n for (const auto &[object, relations] : map) if (relations.dependencies) cycled.emplace_back(std::move(object));\n\n return std::pair(std::move(sorted), std::move(cycled));\n }\n\n void clear()\n {\n _map.clear();\n }\n};\n\n/*\n\tExample usage with shared_ptr to class\n*/\n#include <iostream>\n#include <memory>\n\nint main()\n{\n using namespace std::string_literals;\n\n struct task\n {\n std::string message;\n\n task(const std::string &v) : message { v } {}\n ~task() { std::cout << message[0] << \" - destroyed\" << std::endl; }\n };\n\n using task_ptr = std::shared_ptr<task>;\n\n std::vector<task_ptr> tasks\n {\n // defining simple tasks\n std::make_shared<task>(\"A - depends on B and C\"s), //0\n std::make_shared<task>(\"B - depends on none\"s), //1\n std::make_shared<task>(\"C - depends on D and E\"s), //2\n std::make_shared<task>(\"D - depends on none\"s), //3\n std::make_shared<task>(\"E - depends on F, G and H\"s), //4\n std::make_shared<task>(\"F - depends on I\"s), //5\n std::make_shared<task>(\"G - depends on none\"s), //6\n std::make_shared<task>(\"H - depends on none\"s), //7\n std::make_shared<task>(\"I - depends on none\"s), //8\n };\n\n topological_sorter<task_ptr> resolver;\n\n // now setting relations between them as described above\n resolver.add(tasks[0], { tasks[1], tasks[2] });\n //resolver.add(tasks[1]); // no need for this since the task was already mentioned as a dependency\n resolver.add(tasks[2], { tasks[3], tasks[4] });\n //resolver.add(tasks[3]); // no need for this since the task was already mentioned as a dependency\n resolver.add(tasks[4], tasks[5], tasks[6], tasks[7]); // using templated add with fold expression\n resolver.add(tasks[5], tasks[8]);\n //resolver.add(tasks[6]); // no need for this since the task was already mentioned as a dependency\n //resolver.add(tasks[7]); // no need for this since the task was already mentioned as a dependency\n\n //resolver.add(tasks[3], tasks[0]); // uncomment this line to test cycled dependency\n\n const auto &[sorted, cycled] = resolver.sort();\n\n if (std::empty(cycled))\n {\n for (auto const& d: sorted)\n std::cout << d->message << std::endl;\n }\n else\n {\n std::cout << \"Cycled dependencies detected: \";\n\n for (auto const& d: cycled)\n std::cout << d->message[0] << \" \";\n\n std::cout << std::endl;\n }\n\n //tasks.clear(); // uncomment this line to destroy all tasks in sorted order.\n\n std::cout << \"exiting...\" << std::endl;\n\n return 0;\n}\n","language":"C++"},{"code":"I - depends on none\nH - depends on none\nG - depends on none\nD - depends on none\nB - depends on none\nF - depends on I\nE - depends on F, G and H\nC - depends on D and E\nA - depends on B and C\nexiting...\nA - destroyed\nB - destroyed\nC - destroyed\nD - destroyed\nE - destroyed\nF - destroyed\nG - destroyed\nH - destroyed\nI - destroyed\n","language":"C++"},{"code":"Cycled dependencies detected: A D C\nexiting...\nA - destroyed\nB - destroyed\nC - destroyed\nD - destroyed\nE - destroyed\nF - destroyed\nG - destroyed\nH - destroyed\nI - destroyed\n","language":"C++"},{"code":"namespace Algorithms\n{\n using System;\n using System.Collections.Generic;\n using System.Linq;\n\n public class TopologicalSorter<ValueType>\n {\n private class Relations\n {\n public int Dependencies = 0;\n public HashSet<ValueType> Dependents = new HashSet<ValueType>();\n }\n\n private Dictionary<ValueType, Relations> _map = new Dictionary<ValueType, Relations>();\n\n public void Add(ValueType obj)\n {\n if (!_map.ContainsKey(obj)) _map.Add(obj, new Relations());\n }\n\n public void Add(ValueType obj, ValueType dependency)\n {\n if (dependency.Equals(obj)) return;\n\n if (!_map.ContainsKey(dependency)) _map.Add(dependency, new Relations());\n\n var dependents = _map[dependency].Dependents;\n\n if (!dependents.Contains(obj))\n {\n dependents.Add(obj);\n\n if (!_map.ContainsKey(obj)) _map.Add(obj, new Relations());\n\n ++_map[obj].Dependencies;\n }\n }\n\n public void Add(ValueType obj, IEnumerable<ValueType> dependencies)\n {\n foreach (var dependency in dependencies) Add(obj, dependency);\n }\n\n public void Add(ValueType obj, params ValueType[] dependencies)\n {\n Add(obj, dependencies as IEnumerable<ValueType>);\n }\n\n public Tuple<IEnumerable<ValueType>, IEnumerable<ValueType>> Sort()\n {\n List<ValueType> sorted = new List<ValueType>(), cycled = new List<ValueType>();\n var map = _map.ToDictionary(kvp => kvp.Key, kvp => kvp.Value);\n\n sorted.AddRange(map.Where(kvp => kvp.Value.Dependencies == 0).Select(kvp => kvp.Key));\n\n for (int idx = 0; idx < sorted.Count; ++idx) sorted.AddRange(map[sorted[idx]].Dependents.Where(k => --map[k].Dependencies == 0));\n\n cycled.AddRange(map.Where(kvp => kvp.Value.Dependencies != 0).Select(kvp => kvp.Key));\n\n return new Tuple<IEnumerable<ValueType>, IEnumerable<ValueType>>(sorted, cycled);\n }\n\n public void Clear()\n {\n _map.Clear();\n }\n }\n\n}\n\n/*\n\tExample usage with Task object\n*/\n\nnamespace ExampleApplication\n{\n using Algorithms;\n using System;\n using System.Collections.Generic;\n using System.Linq;\n\n public class Task\n {\n public string Message;\n }\n\n class Program\n {\n static void Main(string[] args)\n {\n List<Task> tasks = new List<Task>\n {\n new Task{ Message = \"A - depends on B and C\" }, //0\n new Task{ Message = \"B - depends on none\" }, //1\n new Task{ Message = \"C - depends on D and E\" }, //2\n new Task{ Message = \"D - depends on none\" }, //3\n new Task{ Message = \"E - depends on F, G and H\" }, //4\n new Task{ Message = \"F - depends on I\" }, //5\n new Task{ Message = \"G - depends on none\" }, //6\n new Task{ Message = \"H - depends on none\" }, //7\n new Task{ Message = \"I - depends on none\" }, //8\n };\n\n TopologicalSorter<Task> resolver = new TopologicalSorter<Task>();\n\n // now setting relations between them as described above\n resolver.Add(tasks[0], new[] { tasks[1], tasks[2] });\n //resolver.Add(tasks[1]); // no need for this since the task was already mentioned as a dependency\n resolver.Add(tasks[2], new[] { tasks[3], tasks[4] });\n //resolver.Add(tasks[3]); // no need for this since the task was already mentioned as a dependency\n resolver.Add(tasks[4], tasks[5], tasks[6], tasks[7]);\n resolver.Add(tasks[5], tasks[8]);\n //resolver.Add(tasks[6]); // no need for this since the task was already mentioned as a dependency\n //resolver.Add(tasks[7]); // no need for this since the task was already mentioned as a dependency\n\n //resolver.Add(tasks[3], tasks[0]); // uncomment this line to test cycled dependency\n\n var result = resolver.Sort();\n var sorted = result.Item1;\n var cycled = result.Item2;\n\n if (!cycled.Any())\n {\n foreach (var d in sorted) Console.WriteLine(d.Message);\n }\n else\n {\n Console.Write(\"Cycled dependencies detected: \");\n\n foreach (var d in cycled) Console.Write($\"{d.Message[0]} \");\n\n Console.WriteLine();\n }\n\n Console.WriteLine(\"exiting...\");\n }\n }\n}\n","language":"C-sharp"},{"code":"B - depends on none\nD - depends on none\nG - depends on none\nH - depends on none\nI - depends on none\nF - depends on I\nE - depends on F, G and H\nC - depends on D and E\nA - depends on B and C\nexiting...\n","language":"C-sharp"},{"code":"Cycled dependencies detected: A C D\nexiting...\n","language":"C-sharp"},{"code":"(use 'clojure.set)\n(use 'clojure.contrib.seq-utils)\n\n(defn dep\n \"Constructs a single-key dependence, represented as a map from\n item to a set of items, ensuring that item is not in the set.\"\n [item items]\n {item (difference (set items) (list item))})\n\n(defn empty-dep\n \"Constructs a single-key dependence from item to an empty set.\"\n [item]\n (dep item '()))\n\n(defn pair-dep\n \"Invokes dep after destructuring item and items from the argument.\"\n [[item items]]\n (dep item items))\n\n(defn default-deps\n \"Constructs a default dependence map taking every item\n in the argument to an empty set\"\n [items]\n (apply merge-with union (map empty-dep (flatten items))))\n\n(defn declared-deps\n \"Constructs a dependence map from a list containaining\n alternating items and list of their predecessor items.\"\n [items]\n (apply merge-with union (map pair-dep (partition 2 items))))\n\n(defn deps\n \"Constructs a full dependence map containing both explicitly\n represented dependences and default empty dependences for\n items without explicit predecessors.\"\n [items]\n (merge (default-deps items) (declared-deps items)))\n\n(defn no-dep-items\n \"Returns all keys from the argument which have no (i.e. empty) dependences.\"\n [deps]\n (filter #(empty? (deps %)) (keys deps)))\n\n(defn remove-items\n \"Returns a dependence map with the specified items removed from keys\n and from all dependence sets of remaining keys.\"\n [deps items]\n (let [items-to-remove (set items)\n remaining-keys (difference (set (keys deps)) items-to-remove)\n remaining-deps (fn [x] (dep x (difference (deps x) items-to-remove)))]\n (apply merge (map remaining-deps remaining-keys))))\n\n(defn topo-sort-deps\n \"Given a dependence map, returns either a list of items in which each item\n follows all of its predecessors, or a string showing the items among which\n there is a cyclic dependence preventing a linear order.\"\n [deps]\n (loop [remaining-deps deps\n result '()]\n (if (empty? remaining-deps)\n (reverse result)\n (let [ready-items (no-dep-items remaining-deps)]\n (if (empty? ready-items)\n (str \"ERROR: cycles remain among \" (keys remaining-deps))\n (recur (remove-items remaining-deps ready-items)\n (concat ready-items result)))))))\n\n(defn topo-sort\n \"Given a list of alternating items and predecessor lists, constructs a\n full dependence map and then applies topo-sort-deps to that map.\"\n [items]\n (topo-sort-deps (deps items)))\n","language":"Clojure"},{"code":"(def good-sample\n '(:des_system_lib (:std :synopsys :std_cell_lib :des_system_lib :dw02 :dw01 :ramlib :ieee)\n :dw01 (:ieee :dw01 :dware :gtech)\n :dw02 (:ieee :dw02 :dware)\n :dw03 (:std :synopsys :dware :dw03 :dw02 :dw01 :ieee :gtech)\n :dw04 (:dw04 :ieee :dw01 :dware :gtech)\n :dw05 (:dw05 :ieee :dware)\n :dw06 (:dw06 :ieee :dware)\n :dw07 (:ieee :dware)\n :dware (:ieee :dware)\n :gtech (:ieee :gtech)\n :ramlib (:std :ieee)\n :std_cell_lib (:ieee :std_cell_lib)\n :synopsys ()))\n\n(def cyclic-dependence\n '(:dw01 (:dw04)))\n\n(def bad-sample\n (concat cyclic-dependence good-sample))\n","language":"Clojure"},{"code":"Clojure 1.1.0\n1:1 user=> #<Namespace topo>\n1:2 topo=> (topo-sort good-sample)\n(:std :synopsys :ieee :gtech :ramlib :dware :std_cell_lib :dw07 :dw06 :dw05 :dw01 :dw02 :des_system_lib :dw03 :dw04)\n1:3 topo=> (topo-sort bad-sample)\n\"ERROR: cycles remain among (:dw01 :dw04 :dw03 :des_system_lib)\"\n","language":"Clojure"},{"code":"toposort = (targets) ->\n # targets is hash of sets, where keys are parent nodes and\n # where values are sets that contain nodes that must precede the parent\n\n # Start by identifying obviously independent nodes\n independents = []\n do ->\n for k of targets\n if targets[k].cnt == 0\n delete targets[k]\n independents.push k\n\n # Note reverse dependencies for theoretical O(M+N) efficiency.\n reverse_deps = []\n do ->\n for k of targets\n for child of targets[k].v\n reverse_deps[child] ?= []\n reverse_deps[child].push k\n\n # Now be greedy--start with independent nodes, then start\n # breaking dependencies, and keep going as long as we still\n # have independent nodes left.\n result = []\n while independents.length > 0\n k = independents.pop()\n result.push k\n for parent in reverse_deps[k] or []\n set_remove targets[parent], k\n if targets[parent].cnt == 0\n independents.push parent\n delete targets[parent]\n\n # Show unresolvable dependencies\n for k of targets\n console.log \"WARNING: node #{k} is part of cyclical dependency\"\n result\n\nparse_deps = ->\n # parse string data, remove self-deps, and fill in gaps\n #\n # e.g. this would transform {a: \"a b c\", d: \"e\"} to this:\n # a: set(b, c)\n # b: set()\n # c: set()\n # d: set(e)\n # e: set()\n targets = {}\n deps = set()\n for k, v of data\n targets[k] = set()\n children = v.split(' ')\n for child in children\n continue if child == ''\n set_add targets[k], child unless child == k\n set_add deps, child\n\n # make sure even leaf nodes are in targets\n for dep of deps.v\n if dep not of targets\n targets[dep] = set()\n targets\n\nset = ->\n cnt: 0\n v: {}\n\nset_add = (s, e) ->\n return if s.v[e]\n s.cnt += 1\n s.v[e] = true\n\nset_remove = (s, e) ->\n return if !s.v[e]\n s.cnt -= 1\n delete s.v[e]\n\ndata =\n des_system_lib: \"std synopsys std_cell_lib des_system_lib dw02 dw01 ramlib ieee\"\n dw01: \"ieee dw01 dware gtech\"\n dw02: \"ieee dw02 dware\"\n dw03: \"std synopsys dware dw03 dw02 dw01 ieee gtech\"\n dw04: \"dw04 ieee dw01 dware gtech\"\n dw05: \"dw05 ieee dware\"\n dw06: \"dw06 ieee dware\"\n dw07: \"ieee dware\"\n dware: \"ieee dware\"\n gtech: \"ieee gtech\"\n ramlib: \"std ieee\"\n std_cell_lib: \"ieee std_cell_lib\"\n synopsys: \"\"\n\n\ntargets = parse_deps()\nconsole.log toposort targets\n","language":"CoffeeScript"},{"code":"(defun topological-sort (graph &key (test 'eql))\n \"Graph is an association list whose keys are objects and whose\nvalues are lists of objects on which the corresponding key depends.\nTest is used to compare elements, and should be a suitable test for\nhash-tables. Topological-sort returns two values. The first is a\nlist of objects sorted toplogically. The second is a boolean\nindicating whether all of the objects in the input graph are present\nin the topological ordering (i.e., the first value).\"\n (let ((entries (make-hash-table :test test)))\n (flet ((entry (vertex)\n \"Return the entry for vertex. Each entry is a cons whose\n car is the number of outstanding dependencies of vertex\n and whose cdr is a list of dependants of vertex.\"\n (multiple-value-bind (entry presentp) (gethash vertex entries)\n (if presentp entry\n (setf (gethash vertex entries) (cons 0 '()))))))\n ;; populate entries initially\n (dolist (vertex graph)\n (destructuring-bind (vertex &rest dependencies) vertex\n (let ((ventry (entry vertex)))\n (dolist (dependency dependencies)\n (let ((dentry (entry dependency)))\n (unless (funcall test dependency vertex)\n (incf (car ventry))\n (push vertex (cdr dentry))))))))\n ;; L is the list of sorted elements, and S the set of vertices\n ;; with no outstanding dependencies.\n (let ((L '())\n (S (loop for entry being each hash-value of entries\n using (hash-key vertex)\n when (zerop (car entry)) collect vertex)))\n ;; Until there are no vertices with no outstanding dependencies,\n ;; process vertices from S, adding them to L.\n (do* () ((endp S))\n (let* ((v (pop S)) (ventry (entry v)))\n (remhash v entries)\n (dolist (dependant (cdr ventry) (push v L))\n (when (zerop (decf (car (entry dependant))))\n (push dependant S)))))\n ;; return (1) the list of sorted items, (2) whether all items\n ;; were sorted, and (3) if there were unsorted vertices, the\n ;; hash table mapping these vertices to their dependants\n (let ((all-sorted-p (zerop (hash-table-count entries))))\n (values (nreverse L)\n all-sorted-p\n (unless all-sorted-p\n entries)))))))\n","language":"Common-Lisp"},{"code":"> (defparameter *dependency-graph*\n '((des-system-lib std synopsys std-cell-lib des-system-lib dw02 dw01 ramlib ieee)\n (dw01 ieee dw01 dware gtech)\n (dw02 ieee dw02 dware)\n (dw03 std synopsys dware dw03 dw02 dw01 ieee gtech)\n (dw04 dw04 ieee dw01 dware gtech)\n (dw05 dw05 ieee dware)\n (dw06 dw06 ieee dware)\n (dw07 ieee dware)\n (dware ieee dware)\n (gtech ieee gtech)\n (ramlib std ieee)\n (std-cell-lib ieee std-cell-lib)\n (synopsys)))\n*DEPENDENCY-GRAPH*\n\n> (topological-sort *dependency-graph*)\n(IEEE DWARE DW02 DW05 DW06 DW07 GTECH DW01 DW04 STD-CELL-LIB SYNOPSYS STD DW03 RAMLIB DES-SYSTEM-LIB)\nT\nNIL\n","language":"Common-Lisp"},{"code":"> (defparameter *dependency-graph*\n '((des-system-lib std synopsys std-cell-lib des-system-lib dw02 dw01 ramlib ieee)\n (dw01 ieee dw01 dw04 dware gtech)\n (dw02 ieee dw02 dware)\n (dw03 std synopsys dware dw03 dw02 dw01 ieee gtech)\n (dw04 dw04 ieee dw01 dware gtech)\n (dw05 dw05 ieee dware)\n (dw06 dw06 ieee dware)\n (dw07 ieee dware)\n (dware ieee dware)\n (gtech ieee gtech)\n (ramlib std ieee)\n (std-cell-lib ieee std-cell-lib)\n (synopsys)))\n*DEPENDENCY-GRAPH*\n\n> (topological-sort *dependency-graph*)\n(IEEE DWARE DW02 DW05 DW06 DW07 GTECH STD-CELL-LIB SYNOPSYS STD RAMLIB)\nNIL\n#<EQL Hash Table{4} 200C9023>\n\n> (describe (third /))\n\n#<EQL Hash Table{4} 200C9023> is a HASH-TABLE\nDW01 (1 DW04 DW03 DES-SYSTEM-LIB)\nDW04 (1 DW01)\nDW03 (1)\nDES-SYSTEM-LIB (1)\n","language":"Common-Lisp"},{"code":"def dfs_topo_visit(n, g, tmp, permanent, l)\n if permanent.includes?(n)\n return\n elsif tmp.includes?(n)\n raise \"unorderable: circular dependency detected involving '#{n}'\"\n end\n tmp.add(n)\n\n g[n].each { |m|\n dfs_topo_visit(m, g, tmp, permanent, l)\n }\n\n tmp.delete(n)\n permanent.add(n)\n l.insert(0, n)\nend\n\n\ndef dfs_topo_sort(g)\n tmp = Set(String).new\n permanent = Set(String).new\n l = Array(String).new\n\n while true\n keys = g.keys.to_set - permanent\n if keys.empty?\n break\n end\n\n n = keys.first\n dfs_topo_visit(n, g, tmp, permanent, l)\n end\n\n return l\nend\n\n\ndef build_graph(deps)\n g = {} of String => Set(String)\n deps.split(\"\\n\").each { |line|\n line_split = line.strip.split\n line_split.each { |dep|\n unless g.has_key?(dep)\n g[dep] = Set(String).new\n end\n unless line_split[0] == dep\n g[dep].add(line_split[0])\n end\n }\n }\n return g\nend\n\n\ndata = \"des_system_lib std synopsys std_cell_lib des_system_lib dw02 dw01 ramlib ieee\ndw01 ieee dw01 dware gtech\ndw02 ieee dw02 dware\ndw03 std synopsys dware dw03 dw02 dw01 ieee gtech\ndw04 dw04 ieee dw01 dware gtech\ndw05 dw05 ieee dware\ndw06 dw06 ieee dware\ndw07 ieee dware\ndware ieee dware\ngtech ieee gtech\nramlib std ieee\nstd_cell_lib ieee std_cell_lib\nsynopsys\"\n\ncircular_deps = \"\\ncyc01 cyc02\n cyc02 cyc01\"\n\nputs dfs_topo_sort(build_graph(data)).join(\" -> \")\nputs \"\"\nputs dfs_topo_sort(build_graph(data + circular_deps)).join(\" -> \")\n","language":"Crystal"},{"code":"import std.stdio, std.string, std.algorithm, std.range;\n\nfinal class ArgumentException : Exception {\n this(string text) pure nothrow @safe /*@nogc*/ {\n super(text);\n }\n}\n\nalias TDependencies = string[][string];\n\nstring[][] topoSort(TDependencies d) pure /*nothrow @safe*/ {\n foreach (immutable k, v; d)\n d[k] = v.sort().uniq.filter!(s => s != k).array;\n foreach (immutable s; d.byValue.join.sort().uniq)\n if (s !in d)\n d[s] = [];\n\n string[][] sorted;\n while (true) {\n string[] ordered;\n\n foreach (immutable item, const dep; d)\n if (dep.empty)\n ordered ~= item;\n if (!ordered.empty)\n sorted ~= ordered.sort().release;\n else\n break;\n\n TDependencies dd;\n foreach (immutable item, const dep; d)\n if (!ordered.canFind(item))\n dd[item] = dep.dup.filter!(s => !ordered.canFind(s)).array;\n d = dd;\n }\n\n //if (!d.empty)\n if (d.length > 0)\n throw new ArgumentException(format(\n \"A cyclic dependency exists amongst:\\n%s\", d));\n\n return sorted;\n}\n\nvoid main() {\n immutable data =\n\"des_system_lib std synopsys std_cell_lib des_system_lib dw02 dw01 ramlib ieee\ndw01 ieee dw01 dware gtech\ndw02 ieee dw02 dware\ndw03 std synopsys dware dw03 dw02 dw01 ieee gtech\ndw04 dw04 ieee dw01 dware gtech\ndw05 dw05 ieee dware\ndw06 dw06 ieee dware\ndw07 ieee dware\ndware ieee dware\ngtech ieee gtech\nramlib std ieee\nstd_cell_lib ieee std_cell_lib\nsynopsys\";\n\n TDependencies deps;\n foreach (immutable line; data.splitLines)\n deps[line.split[0]] = line.split[1 .. $];\n\n auto depw = deps.dup;\n foreach (immutable idx, const subOrder; depw.topoSort)\n writefln(\"#%d : %s\", idx + 1, subOrder);\n\n writeln;\n depw = deps.dup;\n depw[\"dw01\"] ~= \"dw04\";\n foreach (const subOrder; depw.topoSort) // Should throw.\n subOrder.writeln;\n}\n","language":"D"},{"code":"def makeQueue := <elib:vat.makeQueue>\n\ndef topoSort(data :Map[any, Set[any]]) {\n # Tables of nodes and edges\n def forwardEdges := [].asMap().diverge()\n def reverseCount := [].asMap().diverge()\n\n def init(node) {\n reverseCount[node] := 0\n forwardEdges[node] := [].asSet().diverge()\n }\n for node => deps in data {\n init(node)\n for dep in deps { init(dep) }\n }\n\n # 'data' holds the dependencies. Compute the other direction.\n for node => deps in data {\n for dep ? (dep != node) in deps {\n forwardEdges[dep].addElement(node)\n reverseCount[node] += 1\n }\n }\n\n # Queue containing all elements that have no (initial or remaining) incoming edges\n def ready := makeQueue()\n for node => ==0 in reverseCount {\n ready.enqueue(node)\n }\n\n var result := []\n\n while (ready.optDequeue() =~ node :notNull) {\n result with= node\n for next in forwardEdges[node] {\n # Decrease count of incoming edges and enqueue if none\n if ((reverseCount[next] -= 1).isZero()) {\n ready.enqueue(next)\n }\n }\n forwardEdges.removeKey(node)\n }\n\n if (forwardEdges.size().aboveZero()) {\n throw(`Topological sort failed: $forwardEdges remains`)\n }\n\n return result\n}\n","language":"E"},{"code":"pragma.enable(\"accumulator\")\n\ndef dataText := \"\\\ndes_system_lib std synopsys std_cell_lib des_system_lib dw02 dw01 ramlib ieee\ndw01 ieee dw01 dware gtech\ndw02 ieee dw02 dware\ndw03 std synopsys dware dw03 dw02 dw01 ieee gtech\ndw04 dw04 ieee dw01 dware gtech\ndw05 dw05 ieee dware\ndw06 dw06 ieee dware\ndw07 ieee dware\ndware ieee dware\ngtech ieee gtech\nramlib std ieee\nstd_cell_lib ieee std_cell_lib\nsynopsys\\\n\"\n\ndef data := accum [].asMap() for rx`(@item.{17})(@deps.*)` in dataText.split(\"\\n\") { _.with(item.trim(), deps.split(\" \").asSet()) }\n\nprintln(topoSort(data))\n","language":"E"},{"code":"(define dependencies\n'((des_system_lib std synopsys std_cell_lib des_system_lib dw02 dw01 ramlib ieee)\n(dw01 ieee dw01 dware gtech) ;; bad graph add dw04\n(dw02 ieee dw02 dware )\n(dw03 std synopsys dware dw03 dw02 dw01 ieee gtech)\n(dw04 dw04 ieee dw01 dware gtech)\n(dw05 dw05 ieee dware)\n(dw06 dw06 ieee dware)\n(dw07 ieee dware)\n(dware ieee dware)\n(gtech ieee gtech)\n(ramlib std ieee )\n(std_cell_lib ieee std_cell_lib)\n(synopsys )))\n\n\n;; build dependency graph\n;; a depends on b\n;; add arc (arrow) a --> b\n(lib 'graph.lib)\n(define (a->b g a b)\n\t\t(unless (equal? a b)\n\t\t(graph-make-arc g (graph-make-vertex g a) (graph-make-vertex g b))))\n\n(define (add-dependencies g dep-list)\n(for* ((dep dep-list) (b (rest dep))) (a->b g b (first dep))))\n","language":"EchoLisp"},{"code":";; topological sort\n;;\n;; Complexity O (# of vertices + # of edges)\n\n(define (t-sort g)\n\t(stack 'Z) ; vertices of d°(0)\n\t(stack 'S) ; ordered result\n\n;; mark all vertices with their in-degree = # of incoming arcs\n;; push all vertices u such as d°(u) = 0\n\t(for ((u g)) (mark u (graph-vertex-indegree g u))\n\t (when (zero? (mark? u)) (push 'Z u)))\n\t\n;pop a d°(0) vertex u - add it to result\n;decrement in-degree of all v vertices u->v\n; if d°(v) = 0, push it\n\n(while (not (stack-empty? 'Z))\n \t\t\t(let (( u (pop 'Z)))\n \t\t\t(push 'S u)\n\t\t\t (for ((v (graph-vertex-out g u)))\n\t\t\t\t (mark v (1- (mark? v)))\n\t\t\t\t (when (zero? (mark? v)) (push 'Z v)))))\n\t\t\t\t\n;; finish\n\t\t (writeln 't-sort (map vertex-label (stack->list 'S)))\n\t\t\n;; check no one remaining\n\t\t(for ((u g))\n\t\t(unless (zero? (mark? u))\n\t\t(error \" ♻️ t-sort:cyclic\" (map vertex-label (graph-cycle g))))))\n","language":"EchoLisp"},{"code":"(define g (make-graph \"VHDL\"))\n(add-dependencies g dependencies)\n(graph-print g)\n\n(t-sort g)\n→ t-sort (std synopsys ieee dware dw02 dw05 dw06 dw07 gtech dw01 dw03 dw04 ramlib\n std_cell_lib des_system_lib)\n\n;; Error case\n;; add dw01 -> dw04\n(t-sort g)\nt-sort (std synopsys ieee dware dw02 dw05 dw06 dw07 gtech ramlib std_cell_lib)\n⛔️ error: ♻️ t-sort:cyclic (dw04 dw01)\t\n","language":"EchoLisp"},{"code":"defmodule Topological do\n def sort(library) do\n g = :digraph.new\n Enum.each(library, fn {l,deps} ->\n :digraph.add_vertex(g,l) # noop if library already added\n Enum.each(deps, fn d -> add_dependency(g,l,d) end)\n end)\n if t = :digraph_utils.topsort(g) do\n print_path(t)\n else\n IO.puts \"Unsortable contains circular dependencies:\"\n Enum.each(:digraph.vertices(g), fn v ->\n if vs = :digraph.get_short_cycle(g,v), do: print_path(vs)\n end)\n end\n end\n\n defp print_path(l), do: IO.puts Enum.join(l, \" -> \")\n\n defp add_dependency(_g,l,l), do: :ok\n defp add_dependency(g,l,d) do\n :digraph.add_vertex(g,d) # noop if dependency already added\n :digraph.add_edge(g,d,l) # Dependencies represented as an edge d -> l\n end\nend\n\nlibraries = [\n des_system_lib: ~w[std synopsys std_cell_lib des_system_lib dw02 dw01 ramlib ieee]a,\n dw01: ~w[ieee dw01 dware gtech]a,\n dw02: ~w[ieee dw02 dware]a,\n dw03: ~w[std synopsys dware dw03 dw02 dw01 ieee gtech]a,\n dw04: ~w[dw04 ieee dw01 dware gtech]a,\n dw05: ~w[dw05 ieee dware]a,\n dw06: ~w[dw06 ieee dware]a,\n dw07: ~w[ieee dware]a,\n dware: ~w[ieee dware]a,\n gtech: ~w[ieee gtech]a,\n ramlib: ~w[std ieee]a,\n std_cell_lib: ~w[ieee std_cell_lib]a,\n synopsys: []\n]\nTopological.sort(libraries)\n\nIO.puts \"\"\nbad_libraries = Keyword.update!(libraries, :dw01, &[:dw04 | &1])\nTopological.sort(bad_libraries)\n","language":"Elixir"},{"code":"-module(topological_sort).\n-compile(export_all).\n\n-define(LIBRARIES,\n [{des_system_lib, [std, synopsys, std_cell_lib, des_system_lib, dw02, dw01, ramlib, ieee]},\n {dw01, [ieee, dw01, dware, gtech]},\n {dw02, [ieee, dw02, dware]},\n {dw03, [std, synopsys, dware, dw03, dw02, dw01, ieee, gtech]},\n {dw04, [dw04, ieee, dw01, dware, gtech]},\n {dw05, [dw05, ieee, dware]},\n {dw06, [dw06, ieee, dware]},\n {dw07, [ieee, dware]},\n {dware, [ieee, dware]},\n {gtech, [ieee, gtech]},\n {ramlib, [std, ieee]},\n {std_cell_lib, [ieee, std_cell_lib]},\n {synopsys, []}]).\n\n-define(BAD_LIBRARIES,\n [{des_system_lib, [std, synopsys, std_cell_lib, des_system_lib, dw02, dw01, ramlib, ieee]},\n {dw01, [ieee, dw01, dw04, dware, gtech]},\n {dw02, [ieee, dw02, dware]},\n {dw03, [std, synopsys, dware, dw03, dw02, dw01, ieee, gtech]},\n {dw04, [dw04, ieee, dw01, dware, gtech]},\n {dw05, [dw05, ieee, dware]},\n {dw06, [dw06, ieee, dware]},\n {dw07, [ieee, dware]},\n {dware, [ieee, dware]},\n {gtech, [ieee, gtech]},\n {ramlib, [std, ieee]},\n {std_cell_lib, [ieee, std_cell_lib]},\n {synopsys, []}]).\n\nmain() ->\n top_sort(?LIBRARIES),\n top_sort(?BAD_LIBRARIES).\n\ntop_sort(Library) ->\n G = digraph:new(),\n lists:foreach(fun ({L,Deps}) ->\n digraph:add_vertex(G,L), % noop if library already added\n lists:foreach(fun (D) ->\n add_dependency(G,L,D)\n end, Deps)\n end, Library),\n T = digraph_utils:topsort(G),\n case T of\n false ->\n io:format(\"Unsortable contains circular dependencies:~n\",[]),\n lists:foreach(fun (V) ->\n case digraph:get_short_cycle(G,V) of\n false ->\n ok;\n Vs ->\n print_path(Vs)\n end\n end, digraph:vertices(G));\n _ ->\n print_path(T)\n end.\n\nprint_path(L) ->\n lists:foreach(fun (V) -> io:format(\"~s -> \",[V]) end,\n lists:sublist(L,length(L)-1)),\n io:format(\"~s~n\",[lists:last(L)]).\n\nadd_dependency(_G,_L,_L) ->\n ok;\nadd_dependency(G,L,D) ->\n digraph:add_vertex(G,D), % noop if dependency already added\n digraph:add_edge(G,D,L). % Dependencies represented as an edge D -> L\n","language":"Erlang"},{"code":"62> topological_sort:main().\nsynopsys -> std -> ieee -> dware -> dw02 -> dw05 -> ramlib -> std_cell_lib -> dw06 -> dw07 -> gtech -> dw01 -> des_system_lib -> dw03 -> dw04\nUnsortable contains circular dependencies:\ndw04 -> dw01 -> dw04\ndw01 -> dw04 -> dw01\nok\n","language":"Erlang"},{"code":"variable nodes 0 nodes ! \\ linked list of nodes\n\n: node. ( body -- )\n body> >name name>string type ;\n\n: nodeps ( body -- )\n \\ the word referenced by body has no (more) dependencies to resolve\n ['] drop over ! node. space ;\n\n: processing ( body1 ... bodyn body -- body1 ... bodyn )\n \\ the word referenced by body is in the middle of resolving dependencies\n 2dup <> if \\ unless it is a self-reference (see task description)\n\t['] drop over !\n\t.\" (cycle: \" dup node. >r 1 begin \\ print the cycle\n\t dup pick dup r@ <> while\n\t\tspace node. 1+ repeat\n\t.\" ) \" 2drop r>\n\tthen drop ;\n\n: >processing ( body -- body )\n ['] processing over ! ;\n\n: node ( \"name\" -- )\n \\ define node \"name\" and initialize it to having no dependences\n create\n ['] nodeps , \\ on definition, a node has no dependencies\n nodes @ , lastxt nodes ! \\ linked list of nodes\n does> ( -- )\n dup @ execute ; \\ perform xt associated with node\n\n: define-nodes ( \"names\" <newline> -- )\n \\ define all the names that don't exist yet as nodes\n begin\n\tparse-name dup while\n\t 2dup find-name 0= if\n\t\t2dup nextname node then\n\t 2drop repeat\n 2drop ;\n\n: deps ( \"name\" \"deps\" <newline> -- )\n \\ name is after deps. Implementation: Define missing nodes, then\n \\ define a colon definition for\n >in @ define-nodes >in !\n ' :noname ]] >processing [[ source >in @ /string evaluate ]] nodeps ; [[\n swap >body ! 0 parse 2drop ;\n\n: all-nodes ( -- )\n \\ call all nodes, and they then print their dependences and themselves\n nodes begin\n\t@ dup while\n\t dup execute\n\t >body cell+ repeat\n drop ;\n\ndeps des_system_lib std synopsys std_cell_lib des_system_lib dw02 dw01 ramlib ieee\ndeps dw01 ieee dw01 dware gtech\ndeps dw02 ieee dw02 dware\ndeps dw03 std synopsys dware dw03 dw02 dw01 ieee gtech\ndeps dw04 dw04 ieee dw01 dware gtech\ndeps dw05 dw05 ieee dware\ndeps dw06 dw06 ieee dware\ndeps dw07 ieee dware\ndeps dware ieee dware\ndeps gtech ieee gtech\ndeps ramlib std ieee\ndeps std_cell_lib ieee std_cell_lib\ndeps synopsys\n\\ to test the cycle recognition (overwrites dependences for dw1 above)\ndeps dw01 ieee dw01 dware gtech dw04\n\nall-nodes\n","language":"Forth"},{"code":" SUBROUTINE TSORT(NL,ND,IDEP,IORD,IPOS,NO)\n IMPLICIT NONE\n INTEGER NL,ND,NO,IDEP(ND,2),IORD(NL),IPOS(NL),I,J,K,IL,IR,IPL,IPR\n DO 10 I=1,NL\n IORD(I)=I\n 10 IPOS(I)=I\n K=1\n 20 J=K\n K=NL+1\n DO 30 I=1,ND\n IL=IDEP(I,1)\n IR=IDEP(I,2)\n IPL=IPOS(IL)\n IPR=IPOS(IR)\n IF(IL.EQ.IR .OR. IPL.GE.K .OR. IPL.LT.J .OR. IPR.LT.J) GO TO 30\n K=K-1\n IPOS(IORD(K))=IPL\n IPOS(IL)=K\n IORD(IPL)=IORD(K)\n IORD(K)=IL\n 30 CONTINUE\n IF(K.GT.J) GO TO 20\n NO=J-1\n END\n","language":"Fortran"},{"code":" PROGRAM EX_TSORT\n IMPLICIT NONE\n INTEGER NL,ND,NC,NO,IDEP,IORD,IPOS,ICODE,I,J,IL,IR\n PARAMETER(NL=15,ND=44,NC=69)\n CHARACTER*(20) LABEL\n DIMENSION IDEP(ND,2),LABEL(NL),IORD(NL),IPOS(NL),ICODE(NC)\n DATA LABEL/'DES_SYSTEM_LIB','DW01','DW02','DW03','DW04','DW05',\n 1 'DW06','DW07','DWARE','GTECH','RAMLIB','STD_CELL_LIB','SYNOPSYS',\n 2 'STD','IEEE'/\n DATA ICODE/1,14,13,12,1,3,2,11,15,0,2,15,2,9,10,0,3,15,3,9,0,4,14,\n 213,9,4,3,2,15,10,0,5,5,15,2,9,10,0,6,6,15,9,0,7,7,15,9,0,8,15,9,0,\n 39,15,9,0,10,15,10,0,11,14,15,0,12,15,12,0,0/\n\nC DECODE DEPENDENCIES AND BUILD IDEP ARRAY\n I=0\n J=0\n 10 I=I+1\n IL=ICODE(I)\n IF(IL.EQ.0) GO TO 30\n 20 I=I+1\n IR=ICODE(I)\n IF(IR.EQ.0) GO TO 10\n J=J+1\n IDEP(J,1)=IL\n IDEP(J,2)=IR\n GO TO 20\n 30 CONTINUE\n\nC SORT LIBRARIES ACCORDING TO DEPENDENCIES (TOPOLOGICAL SORT)\n CALL TSORT(NL,ND,IDEP,IORD,IPOS,NO)\n\n PRINT*,'COMPILE ORDER'\n DO 40 I=1,NO\n 40 PRINT*,LABEL(IORD(I))\n PRINT*,'UNORDERED LIBRARIES'\n DO 50 I=NO+1,NL\n 50 PRINT*,LABEL(IORD(I))\n END\n","language":"Fortran"},{"code":"subroutine tsort(nl,nd,idep,iord,no)\n\n implicit none\n\n integer,intent(in) :: nl\n integer,intent(in) :: nd\n integer,dimension(nd,2),intent(in) :: idep\n integer,dimension(nl),intent(out) :: iord\n integer,intent(out) :: no\n\n integer :: i,j,k,il,ir,ipl,ipr,ipos(nl)\n\n do i=1,nl\n iord(i)=i\n ipos(i)=i\n end do\n k=1\n do\n j=k\n k=nl+1\n do i=1,nd\n il=idep(i,1)\n ir=idep(i,2)\n ipl=ipos(il)\n ipr=ipos(ir)\n if (il==ir .or. ipl>=k .or. ipl<j .or. ipr<j) cycle\n k=k-1\n ipos(iord(k))=ipl\n ipos(il)=k\n iord(ipl)=iord(k)\n iord(k)=il\n end do\n if (k<=j) exit\n end do\n no=j-1\n\nend subroutine tsort\n","language":"Fortran"},{"code":"def topsort( graph ) =\n val L = seq()\n val S = seq()\n val g = dict( graph )\n\n for (v, es) <- g\n g(v) = seq( es )\n\n for (v, es) <- g if es.isEmpty()\n S.append( v )\n\n while not S.isEmpty()\n val n = S.remove( 0 )\n L.append( n )\n\n for (m, es) <- g if n in es\n if (es -= n).isEmpty()\n S.append( m )\n\n for (v, es) <- g\n if not es.isEmpty()\n return None\n\n Some( L.toList() )\n\ndependencies = '''\n des_system_lib std synopsys std_cell_lib des_system_lib dw02 dw01 ramlib ieee\n dw01 ieee dw01 dware gtech\n dw02 ieee dw02 dware\n dw03 std synopsys dware dw03 dw02 dw01 ieee gtech\n dw04 dw04 ieee dw01 dware gtech\n dw05 dw05 ieee dware\n dw06 dw06 ieee dware\n dw07 ieee dware\n dware ieee dware\n gtech ieee gtech\n ramlib std ieee\n std_cell_lib ieee std_cell_lib\n synopsys\n '''\n\n// convert dependencies data into a directed graph\ngraph = dict()\ndeps = set()\n\nfor l <- WrappedString( dependencies ).lines() if l.trim() != ''\n case list(l.trim().split('\\\\s+')) of\n [a] -> graph(a) = []\n h:t ->\n d = set( t )\n d -= h // remove self dependencies\n graph(h) = d\n deps ++= t\n\n// add graph vertices for dependencies not appearing in left column\nfor e <- deps if e not in graph\n graph(e) = []\n\ncase topsort( graph ) of\n None -> println( 'un-orderable' )\n Some( ordering ) -> println( ordering )\n","language":"FunL"},{"code":"package main\n\nimport (\n \"fmt\"\n \"strings\"\n)\n\nvar data = `\nLIBRARY LIBRARY DEPENDENCIES\n======= ====================\ndes_system_lib std synopsys std_cell_lib des_system_lib dw02 dw01 ramlib ieee\ndw01 ieee dw01 dware gtech\ndw02 ieee dw02 dware\ndw03 std synopsys dware dw03 dw02 dw01 ieee gtech\ndw04 dw04 ieee dw01 dware gtech\ndw05 dw05 ieee dware\ndw06 dw06 ieee dware\ndw07 ieee dware\ndware ieee dware\ngtech ieee gtech\nramlib std ieee\nstd_cell_lib ieee std_cell_lib\nsynopsys `\n\nfunc main() {\n g, in, err := parseLibComp(data)\n if err != nil {\n fmt.Println(err)\n return\n }\n order, cyclic := topSortKahn(g, in)\n if cyclic != nil {\n fmt.Println(\"Cyclic:\", cyclic)\n return\n }\n fmt.Println(\"Order:\", order)\n}\n\ntype graph map[string][]string\ntype inDegree map[string]int\n\n// parseLibComp parses the text format of the task and returns a graph\n// representation and a list of the in-degrees of each node. The returned graph\n// represents compile order rather than dependency order. That is, for each map\n// map key n, the map elements are libraries that depend on n being compiled\n// first.\nfunc parseLibComp(data string) (g graph, in inDegree, err error) {\n // small sanity check on input\n lines := strings.Split(data, \"\\n\")\n if len(lines) < 3 || !strings.HasPrefix(lines[2], \"=\") {\n return nil, nil, fmt.Errorf(\"data format\")\n }\n // toss header lines\n lines = lines[3:]\n // scan and interpret input, build graph\n g = graph{}\n in = inDegree{}\n for _, line := range lines {\n libs := strings.Fields(line)\n if len(libs) == 0 {\n continue // allow blank lines\n }\n lib := libs[0]\n g[lib] = g[lib]\n for _, dep := range libs[1:] {\n in[dep] = in[dep]\n if dep == lib {\n continue // ignore self dependencies\n }\n successors := g[dep]\n for i := 0; ; i++ {\n if i == len(successors) {\n g[dep] = append(successors, lib)\n in[lib]++\n break\n }\n if dep == successors[i] {\n break // ignore duplicate dependencies\n }\n }\n }\n }\n return g, in, nil\n}\n\n// General purpose topological sort, not specific to the application of\n// library dependencies. Adapted from Wikipedia pseudo code, one main\n// difference here is that this function does not consume the input graph.\n// WP refers to incoming edges, but does not really need them fully represented.\n// A count of incoming edges, or the in-degree of each node is enough. Also,\n// WP stops at cycle detection and doesn't output information about the cycle.\n// A little extra code at the end of this function recovers the cyclic nodes.\nfunc topSortKahn(g graph, in inDegree) (order, cyclic []string) {\n var L, S []string\n // rem for \"remaining edges,\" this function makes a local copy of the\n // in-degrees and consumes that instead of consuming an input.\n rem := inDegree{}\n for n, d := range in {\n if d == 0 {\n // accumulate \"set of all nodes with no incoming edges\"\n S = append(S, n)\n } else {\n // initialize rem from in-degree\n rem[n] = d\n }\n }\n for len(S) > 0 {\n last := len(S) - 1 // \"remove a node n from S\"\n n := S[last]\n S = S[:last]\n L = append(L, n) // \"add n to tail of L\"\n for _, m := range g[n] {\n // WP pseudo code reads \"for each node m...\" but it means for each\n // node m *remaining in the graph.* We consume rem rather than\n // the graph, so \"remaining in the graph\" for us means rem[m] > 0.\n if rem[m] > 0 {\n rem[m]-- // \"remove edge from the graph\"\n if rem[m] == 0 { // if \"m has no other incoming edges\"\n S = append(S, m) // \"insert m into S\"\n }\n }\n }\n }\n // \"If graph has edges,\" for us means a value in rem is > 0.\n for c, in := range rem {\n if in > 0 {\n // recover cyclic nodes\n for _, nb := range g[c] {\n if rem[nb] > 0 {\n cyclic = append(cyclic, c)\n break\n }\n }\n }\n }\n if len(cyclic) > 0 {\n return nil, cyclic\n }\n return L, nil\n}\n","language":"Go"},{"code":"// General purpose topological sort, not specific to the application of\n// library dependencies. Also adapted from Wikipedia pseudo code.\nfunc topSortDFS(g graph) (order, cyclic []string) {\n L := make([]string, len(g))\n i := len(L)\n temp := map[string]bool{}\n perm := map[string]bool{}\n var cycleFound bool\n var cycleStart string\n var visit func(string)\n visit = func(n string) {\n switch {\n case temp[n]:\n cycleFound = true\n cycleStart = n\n return\n case perm[n]:\n return\n }\n temp[n] = true\n for _, m := range g[n] {\n visit(m)\n if cycleFound {\n if cycleStart > \"\" {\n cyclic = append(cyclic, n)\n if n == cycleStart {\n cycleStart = \"\"\n }\n }\n return\n }\n }\n delete(temp, n)\n perm[n] = true\n i--\n L[i] = n\n }\n for n := range g {\n if perm[n] {\n continue\n }\n visit(n)\n if cycleFound {\n return nil, cyclic\n }\n }\n return L, nil\n}\n","language":"Go"},{"code":"import Data.List ((\\\\), elemIndex, intersect, nub)\nimport Data.Bifunctor (bimap, first)\n\ncombs 0 _ = [[]]\ncombs _ [] = []\ncombs k (x:xs) = ((x :) <$> combs (k - 1) xs) ++ combs k xs\n\ndepLibs :: [(String, String)]\ndepLibs =\n [ ( \"des_system_lib\"\n , \"std synopsys std_cell_lib des_system_lib dw02 dw01 ramlib ieee\")\n , (\"dw01\", \"ieee dw01 dware gtech\")\n , (\"dw02\", \"ieee dw02 dware\")\n , (\"dw03\", \"std synopsys dware dw03 dw02 dw01 ieee gtech\")\n , (\"dw04\", \"dw04 ieee dw01 dware gtech\")\n , (\"dw05\", \"dw05 ieee dware\")\n , (\"dw06\", \"dw06 ieee dware\")\n , (\"dw07\", \"ieee dware\")\n , (\"dware\", \"ieee dware\")\n , (\"gtech\", \"ieee gtech\")\n , (\"ramlib\", \"std ieee\")\n , (\"std_cell_lib\", \"ieee std_cell_lib\")\n , (\"synopsys\", [])\n ]\n\ntoposort :: [(String, String)] -> [String]\ntoposort xs\n | (not . null) cycleDetect =\n error $ \"Dependency cycle detected for libs \" ++ show cycleDetect\n | otherwise = foldl makePrecede [] dB\n where\n dB = (\\(x, y) -> (x, y \\\\ x)) . bimap return words <$> xs\n makePrecede ts ([x], xs) =\n nub $\n case elemIndex x ts of\n Just i -> uncurry (++) $ first (++ xs) $ splitAt i ts\n _ -> ts ++ xs ++ [x]\n cycleDetect =\n filter ((> 1) . length) $\n (\\[(a, as), (b, bs)] -> (a `intersect` bs) ++ (b `intersect` as)) <$>\n combs 2 dB\n\nmain :: IO ()\nmain = print $ toposort depLibs\n","language":"Haskell"},{"code":"*Main> toposort depLibs\n[\"std\",\"synopsys\",\"ieee\",\"std_cell_lib\",\"dware\",\"dw02\",\"gtech\",\"dw01\",\"ramlib\",\"des_system_lib\",\"dw03\",\"dw04\",\"dw05\",\"dw06\",\"dw07\"]\n\n*Main> toposort $ (\\(xs,(k,ks):ys) -> xs++ (k,ks++\" dw04\"):ys) $ splitAt 1 depLibs\n*** Exception: Dependency cycle detected for libs [[\"dw01\",\"dw04\"]]\n","language":"Haskell"},{"code":"import Algorithms as algo;\nimport Text as text;\n\nclass DirectedGraph {\n\t_adjecentVertices = {};\n\tadd_vertex( vertex_ ) {\n\t\t_adjecentVertices[vertex_] = [];\n\t}\n\tadd_edge( from_, to_ ) {\n\t\t_adjecentVertices[from_].push( to_ );\n\t}\n\tadjecent_vertices( vertex_ ) {\n\t\treturn ( vertex_ ∈ _adjecentVertices ? _adjecentVertices.get( vertex_ ) : [] );\n\t}\n}\n\nclass DepthFirstSearch {\n\t_visited = set();\n\t_postOrder = [];\n\t_cycleDetector = set();\n\trun( graph_, start_ ) {\n\t\t_cycleDetector.insert( start_ );\n\t\t_visited.insert( start_ );\n\t\tfor ( vertex : graph_.adjecent_vertices( start_ ) ) {\n\t\t\tif ( vertex == start_ ) {\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t\tif ( vertex ∈ _cycleDetector ) {\n\t\t\t\tthrow Exception( \"A cycle involving vertices {} found!\".format( _cycleDetector ) );\n\t\t\t}\n\t\t\tif ( vertex ∉ _visited ) {\n\t\t\t\trun( graph_, vertex );\n\t\t\t}\n\t\t}\n\t\t_postOrder.push( start_ );\n\t\t_cycleDetector.erase( start_ );\n\t}\n\ttopological_sort( graph_ ) {\n\t\tfor ( vertex : graph_._adjecentVertices ) {\n\t\t\tif ( vertex ∉ _visited ) {\n\t\t\t\trun( graph_, vertex );\n\t\t\t}\n\t\t}\n\t\treturn ( _postOrder );\n\t}\n}\n\nmain() {\n\trawdata =\n\t\t\"des_system_lib | std synopsys std_cell_lib des_system_lib dw02 dw01 ramlib ieee\\n\"\n\t\t\"dw01 | ieee dw01 dware gtech\\n\"\n\t\t\"dw02 | ieee dw02 dware\\n\"\n\t\t\"dw03 | std synopsys dware dw03 dw02 dw01 ieee gtech\\n\"\n\t\t\"dw04 | dw04 ieee dw01 dware gtech\\n\"\n\t\t\"dw05 | dw05 ieee dware\\n\"\n\t\t\"dw06 | dw06 ieee dware\\n\"\n\t\t\"dw07 | ieee dware\\n\"\n\t\t\"dware | ieee dware\\n\"\n\t\t\"gtech | ieee gtech\\n\"\n\t\t\"ramlib | std ieee\\n\"\n\t\t\"std_cell_lib | ieee std_cell_lib\\n\"\n\t\t\"synopsys |\\n\";\n\tdg = DirectedGraph();\n\tfor ( l : algo.filter( text.split( rawdata, \"\\n\" ), @( x ) { size( x ) > 0; } ) ) {\n\t\tdef = algo.materialize( algo.map( text.split( l, \"|\" ), string.strip ), list );\n\t\tdg.add_vertex( def[0] );\n\t\tfor ( n : algo.filter( algo.map( text.split( def[1], \" \" ), string.strip ), @( x ) { size( x ) > 0; } ) ) {\n\t\t\tdg.add_edge( def[0], n );\n\t\t}\n\t}\n\tdfs = DepthFirstSearch();\n\tprint( \"{}\\n\".format( dfs.topological_sort( dg ) ) );\n}\n","language":"Huginn"},{"code":"record graph(nodes,arcs)\nglobal ex_name, in_name\n\nprocedure main()\n show(tsort(getgraph()))\nend\n\nprocedure tsort(g)\n t := \"\"\n while (n := g.nodes -- pnodes(g)) ~== \"\" do {\n t ||:= \"(\"||n||\")\"\n g := delete(g,n)\n }\n if g.nodes == '' then return t\n write(\"graph contains the cycle:\")\n write(\"\\t\",genpath(fn := !g.nodes,fn,g))\nend\n\n## pnodes(g) -- return the predecessor nodes of g\n# (those that have an arc from them)\nprocedure pnodes(g)\n static labels, fromnodes\n initial {\n labels := &ucase\n fromnodes := 'ACEGIKMOQSUWY'\n }\n return cset(select(g.arcs,labels, fromnodes))\nend\n\n## select(s,image,object) - efficient node selection\nprocedure select(s,image,object)\n slen := *s\n ilen := *image\n return if slen <= ilen then map(object[1+:slen/2],image[1+:slen],s)\n else map(object,image,s[1+:ilen]) || select(s[1+ilen:0],image,object)\nend\n\n## delete(g,x) -- deletes all nodes in x from graph g\n# note that arcs must be deleted as well\nprocedure delete(g,x)\n t := \"\"\n g.arcs ? while arc := move(2) do if not upto(x,arc) then t ||:= arc\n return graph(g.nodes--x,t)\nend\n\n\n## getgraph() -- read and construct a graph\n# graph is described via sets of arcs, as in:\n#\n# from to1 to2 to3\n#\n# external names are converted to single character names for efficiency\n# self-referential arcs are ignored\nprocedure getgraph()\n static labels\n initial labels := &cset\n ex_name := table()\n in_name := table()\n count := 0\n arcstr := \"\"\n nodes := ''\n every line := !&input do {\n nextWord := create genWords(line)\n if nfrom := @nextWord then {\n /in_name[nfrom] := &cset[count +:= 1]\n /ex_name[in_name[nfrom]] := nfrom\n nodes ++:= in_name[nfrom]\n while nto := @nextWord do {\n if nfrom ~== nto then {\n /in_name[nto] := &cset[count +:= 1]\n /ex_name[in_name[nto]] := nto\n nodes ++:= in_name[nto]\n arcstr ||:= in_name[nfrom] || in_name[nto]\n }\n }\n }\n }\n return graph(nodes,arcstr)\nend\n\n# generate all 'words' in string\nprocedure genWords(s)\n static wchars\n initial wchars := &cset -- ' \\t'\n s ? while tab(upto(wchars))\\1 do suspend tab(many(wchars))\\1\nend\n\n## show(t) - return the external names (in order) for the nodes in t\n# Each output line contains names that are independent of each other\nprocedure show(t)\n line := \"\"\n every n := !t do\n case n of {\n \"(\" : line ||:= \"\\n\\t(\"\n \")\" : line[-1] := \")\"\n default : line ||:= ex_name[n] || \" \"\n }\n write(line)\nend\n\n## genpath(f,t,g) -- generate paths from f to t in g\nprocedure genpath(f,t,g, seen)\n /seen := ''\n seen ++:= f\n sn := nnodes(f,g)\n if t ** sn == t then return ex_name[f] || \" -> \" || ex_name[t]\n suspend ex_name[f] || \" -> \" || genpath(!(sn --seen),t,g,seen)\nend\n\n## nnodes(f,g) -- compute all nodes that could follow f in g\nprocedure nnodes(f,g)\n t := ''\n g.arcs ? while arc := move(2) do if arc[1] == f then t ++:= arc[2]\n return t\nend\n","language":"Icon"},{"code":"dependencySort=: monad define\n parsed=. <@;:;._2 y\n names=. {.&>parsed\n depends=. (> =@i.@#) names e.S:1 parsed\n depends=. (+. +./ .*.~)^:_ depends\n assert.-.1 e. (<0 1)|:depends\n (-.&names ~.;parsed),names /: +/\"1 depends\n)\n","language":"J"},{"code":" >dependencySort dependencies\n std\n ieee\n dware\n gtech\n ramlib\n std_cell_lib\n synopsys\n dw02\n dw05\n dw06\n dw07\n dw01\n dw04\n dw03\n des_system_lib\n","language":"J"},{"code":" dependencySort dependencies,'dw01 dw04',LF\n|assertion failure: dependencySort\n| -.1 e.(<0 1)|:depends\n","language":"J"},{"code":"depSort=: monad define\n parsed=. <@;:;._2 y\n names=. {.&>parsed\n depends=. (-.L:0\"_1 #,.i.@#) names i.L:1 parsed\n depends=. (~.@,&.> ;@:{L:0 1~)^:_ depends\n assert.-.1 e. (i.@# e.S:0\"0 ])depends\n (-.&names ~.;parsed),names /: #@> depends\n)\n","language":"J"},{"code":"import java.util.*;\n\npublic class TopologicalSort {\n\n public static void main(String[] args) {\n String s = \"std, ieee, des_system_lib, dw01, dw02, dw03, dw04, dw05,\"\n + \"dw06, dw07, dware, gtech, ramlib, std_cell_lib, synopsys\";\n\n Graph g = new Graph(s, new int[][]{\n {2, 0}, {2, 14}, {2, 13}, {2, 4}, {2, 3}, {2, 12}, {2, 1},\n {3, 1}, {3, 10}, {3, 11},\n {4, 1}, {4, 10},\n {5, 0}, {5, 14}, {5, 10}, {5, 4}, {5, 3}, {5, 1}, {5, 11},\n {6, 1}, {6, 3}, {6, 10}, {6, 11},\n {7, 1}, {7, 10},\n {8, 1}, {8, 10},\n {9, 1}, {9, 10},\n {10, 1},\n {11, 1},\n {12, 0}, {12, 1},\n {13, 1}\n });\n\n System.out.println(\"Topologically sorted order: \");\n System.out.println(g.topoSort());\n }\n}\n\nclass Graph {\n String[] vertices;\n boolean[][] adjacency;\n int numVertices;\n\n public Graph(String s, int[][] edges) {\n vertices = s.split(\",\");\n numVertices = vertices.length;\n adjacency = new boolean[numVertices][numVertices];\n\n for (int[] edge : edges)\n adjacency[edge[0]][edge[1]] = true;\n }\n\n List<String> topoSort() {\n List<String> result = new ArrayList<>();\n List<Integer> todo = new LinkedList<>();\n\n for (int i = 0; i < numVertices; i++)\n todo.add(i);\n\n try {\n outer:\n while (!todo.isEmpty()) {\n for (Integer r : todo) {\n if (!hasDependency(r, todo)) {\n todo.remove(r);\n result.add(vertices[r]);\n // no need to worry about concurrent modification\n continue outer;\n }\n }\n throw new Exception(\"Graph has cycles\");\n }\n } catch (Exception e) {\n System.out.println(e);\n return null;\n }\n return result;\n }\n\n boolean hasDependency(Integer r, List<Integer> todo) {\n for (Integer c : todo) {\n if (adjacency[r][c])\n return true;\n }\n return false;\n }\n}\n","language":"Java"},{"code":"const libs =\n `des_system_lib std synopsys std_cell_lib des_system_lib dw02 dw01 ramlib ieee\n dw01 ieee dw01 dware gtech\n dw02 ieee dw02 dware\n dw03 std synopsys dware dw03 dw02 dw01 ieee gtech\n dw04 dw04 ieee dw01 dware gtech\n dw05 dw05 ieee dware\n dw06 dw06 ieee dware\n dw07 ieee dware\n dware ieee dware\n gtech ieee gtech\n ramlib std ieee\n std_cell_lib ieee std_cell_lib\n synopsys`;\n\n// A map of the input data, with the keys as the packages, and the values as\n// and array of packages on which it depends.\nconst D = libs\n .split('\\n')\n .map(e => e.split(' ').filter(e => e != ''))\n .reduce((p, c) =>\n p.set(c[0], c.filter((e, i) => i > 0 && e !== c[0] ? e : null)), new Map());\n[].concat(...D.values()).forEach(e => {\n D.set(e, D.get(e) || [])\n});\n\n// The above map rotated so that it represents a DAG of the form\n// Map {\n// A => [ A, B, C],\n// B => [C],\n// C => []\n// }\n// where each key represents a node, and the array contains the edges.\nconst G = [...D.keys()].reduce((p, c) =>\n p.set(\n c,\n [...D.keys()].filter(e => D.get(e).includes(c))),\n new Map()\n);\n\n// An array of leaf nodes; nodes with 0 in degrees.\nconst Q = [...D.keys()].filter(e => D.get(e).length == 0);\n\n// The result array.\nconst S = [];\nwhile (Q.length) {\n const u = Q.pop();\n S.push(u);\n G.get(u).forEach(v => {\n D.set(v, D.get(v).filter(e => e !== u));\n if (D.get(v).length == 0) {\n Q.push(v);\n }\n });\n}\n\nconsole.log('Solution:', S);\n","language":"JavaScript"},{"code":"Solution: [\n 'ieee',\n 'std_cell_lib',\n 'gtech',\n 'dware',\n 'dw07',\n 'dw06',\n 'dw05',\n 'dw02',\n 'dw01',\n 'dw04',\n 'std',\n 'ramlib',\n 'synopsys',\n 'dw03',\n 'des_system_lib' ]\n","language":"JavaScript"},{"code":"# independent/0 emits an array of the dependencies that have no dependencies\n# Input: an object representing a normalized dependency graph\ndef independent:\n . as $G\n | reduce keys[] as $key\n ([];\n . + ((reduce $G[$key][] as $node\n ([];\n if ($G[$node] == null or ($G[$node]|length)==0) then . + [$node]\n else .\n end ))))\n | unique;\n\n# normalize/0 eliminates self-dependencies in the input dependency graph.\n# Input: an object representing a dependency graph.\ndef normalize:\n . as $G\n | reduce keys[] as $key\n ($G;\n .[$key] as $nodes\n | if $nodes and ($nodes|index($key)) then .[$key] = $nodes - [$key] else . end);\n\n\n# minus/1 removes all the items in ary from each of the values in the input object\n# Input: an object representing a dependency graph\ndef minus(ary):\n . as $G | with_entries(.value -= ary);\n\n# tsort/0 emits the topologically sorted nodes of the input,\n# in \">\" order.\n# Input is assumed to be an object representing a dependency\n# graph and need not be normalized.\ndef tsort:\n # _sort: input: [L, Graph], where L is the tsort so far\n def _tsort:\n\n def done: [.[]] | all( length==0 );\n\n .[0] as $L | .[1] as $G\n | if ($G|done) then $L + (($G|keys) - $L)\n else\n ($G|independent) as $I\n | if (($I|length) == 0)\n then error(\"the dependency graph is cyclic: \\($G)\")\n else [ ($L + $I), ($G|minus($I))] | _tsort\n end\n end;\n\n normalize | [[], .] | _tsort ;\n\ntsort\n","language":"Jq"},{"code":"{\"des_system_lib\": [ \"std\", \"synopsys\", \"std_cell_lib\", \"des_system_lib\", \"dw02\", \"dw01\", \"ramlib\", \"ieee\"],\n \"dw01\": [ \"ieee\", \"dw01\", \"dware\", \"gtech\"],\n \"dw02\": [ \"ieee\", \"dw02\", \"dware\"],\n \"dw03\": [ \"std\", \"synopsys\", \"dware\", \"dw03\", \"dw02\", \"dw01\", \"ieee\", \"gtech\"],\n \"dw04\": [ \"dw04\", \"ieee\", \"dw01\", \"dware\", \"gtech\"],\n \"dw05\": [ \"dw05\", \"ieee\", \"dware\"],\n \"dw06\": [ \"dw06\", \"ieee\", \"dware\"],\n \"dw07\": [ \"ieee\", \"dware\"],\n \"dware\": [ \"ieee\", \"dware\"],\n \"gtech\": [ \"ieee\", \"gtech\"],\n \"ramlib\": [ \"std\", \"ieee\"],\n \"std_cell_lib\": [ \"ieee\", \"std_cell_lib\"],\n \"synopsys\": []\n}\n","language":"Jq"},{"code":"$ jq -c -f tsort.jq tsort.json\n[\"ieee\",\"std\",\"synopsys\",\"dware\",\"gtech\",\"ramlib\",\"std_cell_lib\",\"dw01\",\"dw02\",\"des_system_lib\",\"dw03\",\"dw04\",\"dw05\",\"dw06\",\"dw07\"]\n","language":"Jq"},{"code":"function toposort(data::Dict{T,Set{T}}) where T\n data = copy(data)\n for (k, v) in data\n delete!(v, k)\n end\n extraitems = setdiff(reduce(∪, values(data)), keys(data))\n for item in extraitems\n data[item] = Set{T}()\n end\n rst = Vector{T}()\n while true\n ordered = Set(item for (item, dep) in data if isempty(dep))\n if isempty(ordered) break end\n append!(rst, ordered)\n data = Dict{T,Set{T}}(item => setdiff(dep, ordered) for (item, dep) in data if item ∉ ordered)\n end\n @assert isempty(data) \"a cyclic dependency exists amongst $(keys(data))\"\n return rst\nend\n\ndata = Dict{String,Set{String}}(\n \"des_system_lib\" => Set(split(\"std synopsys std_cell_lib des_system_lib dw02 dw01 ramlib ieee\")),\n \"dw01\" => Set(split(\"ieee dw01 dware gtech\")),\n \"dw02\" => Set(split(\"ieee dw02 dware\")),\n \"dw03\" => Set(split(\"std synopsys dware dw03 dw02 dw01 ieee gtech\")),\n \"dw04\" => Set(split(\"dw04 ieee dw01 dware gtech\")),\n \"dw05\" => Set(split(\"dw05 ieee dware\")),\n \"dw06\" => Set(split(\"dw06 ieee dware\")),\n \"dw07\" => Set(split(\"ieee dware\")),\n \"dware\" => Set(split(\"ieee dware\")),\n \"gtech\" => Set(split(\"ieee gtech\")),\n \"ramlib\" => Set(split(\"std ieee\")),\n \"std_cell_lib\" => Set(split(\"ieee std_cell_lib\")),\n \"synopsys\" => Set(),\n )\n\nprintln(\"# Topologically sorted:\\n - \", join(toposort(data), \"\\n - \"))\n","language":"Julia"},{"code":"// version 1.1.51\n\nval s = \"std, ieee, des_system_lib, dw01, dw02, dw03, dw04, dw05, \" +\n \"dw06, dw07, dware, gtech, ramlib, std_cell_lib, synopsys\"\n\nval deps = mutableListOf(\n 2 to 0, 2 to 14, 2 to 13, 2 to 4, 2 to 3, 2 to 12, 2 to 1,\n 3 to 1, 3 to 10, 3 to 11,\n 4 to 1, 4 to 10,\n 5 to 0, 5 to 14, 5 to 10, 5 to 4, 5 to 3, 5 to 1, 5 to 11,\n 6 to 1, 6 to 3, 6 to 10, 6 to 11,\n 7 to 1, 7 to 10,\n 8 to 1, 8 to 10,\n 9 to 1, 9 to 10,\n 10 to 1,\n 11 to 1,\n 12 to 0, 12 to 1,\n 13 to 1\n)\n\nclass Graph(s: String, edges: List<Pair<Int,Int>>) {\n\n val vertices = s.split(\", \")\n val numVertices = vertices.size\n val adjacency = List(numVertices) { BooleanArray(numVertices) }\n\n init {\n for (edge in edges) adjacency[edge.first][edge.second] = true\n }\n\n fun hasDependency(r: Int, todo: List<Int>): Boolean {\n return todo.any { adjacency[r][it] }\n }\n\n fun topoSort(): List<String>? {\n val result = mutableListOf<String>()\n val todo = MutableList<Int>(numVertices) { it }\n try {\n outer@ while(!todo.isEmpty()) {\n for ((i, r) in todo.withIndex()) {\n if (!hasDependency(r, todo)) {\n todo.removeAt(i)\n result.add(vertices[r])\n continue@outer\n }\n }\n throw Exception(\"Graph has cycles\")\n }\n }\n catch (e: Exception) {\n println(e)\n return null\n }\n return result\n }\n}\n\nfun main(args: Array<String>) {\n val g = Graph(s, deps)\n println(\"Topologically sorted order:\")\n println(g.topoSort())\n println()\n // now insert 3 to 6 at index 10 of deps\n deps.add(10, 3 to 6)\n val g2 = Graph(s, deps)\n println(\"Following the addition of dw04 to the dependencies of dw01:\")\n println(g2.topoSort())\n}\n","language":"Kotlin"},{"code":"val graph = mapOf(\n \"des_system_lib\" to \"std synopsys std_cell_lib des_system_lib dw02 dw01 ramlib ieee\".split(\" \").toSet(),\n \"dw01\" to \"ieee dw01 dware gtech\".split(\" \").toSet(),\n \"dw02\" to \"ieee dw02 dware\".split(\" \").toSet(),\n \"dw03\" to \"std synopsys dware dw03 dw02 dw01 ieee gtech\".split(\" \").toSet(),\n \"dw04\" to \"dw04 ieee dw01 dware gtech\".split(\" \").toSet(),\n \"dw05\" to \"dw05 ieee dware\".split(\" \").toSet(),\n \"dw06\" to \"dw06 ieee dware\".split(\" \").toSet(),\n \"dw07\" to \"ieee dware\".split(\" \").toSet(),\n \"dware\" to \"ieee dware\".split(\" \").toSet(),\n \"gtech\" to \"ieee gtech\".split(\" \").toSet(),\n \"ramlib\" to \"std ieee\".split(\" \").toSet(),\n \"std_cell_lib\" to \"ieee std_cell_lib\".split(\" \").toSet(),\n \"synopsys\" to setOf()\n)\n\nfun toposort( graph: Map<String,Set<String>> ): List<List<String>> {\n var data = graph.map { (k,v) -> k to v.toMutableSet() }.toMap().toMutableMap()\n\n // ignore self dependancies\n data = data.map { (k,v) -> v.remove(k); k to v }.toMap().toMutableMap()\n\n val extraItemsInDeps = data.values.reduce { a,b -> a.union( b ).toMutableSet() } - data.keys.toSet()\n\n data.putAll( extraItemsInDeps.map { it to mutableSetOf<String>() }.toMap() )\n\n val res = mutableListOf<List<String>>()\n mainloop@ while( true ) {\n innerloop@ while( true ) {\n val ordered = data.filter{ (_,v) -> v.isEmpty() }.map { (k,_) -> k }\n if( ordered.isEmpty() )\n break@innerloop\n\n res.add( ordered )\n data = data.filter { (k,_) -> !ordered.contains(k) }.map { (k,v) -> v.removeAll(ordered); k to v }.toMap().toMutableMap()\n }\n\n if( data.isNotEmpty() )\n throw Exception( \"A cyclic dependency exists amongst: ${data.toList().joinToString { \",\" }}\" )\n else\n break@mainloop\n }\n\n return res\n}\n\n\nfun main( args: Array<String> ) {\n val result = toposort( graph )\n println( \"sorted dependencies:[\\n${result.joinToString( \",\\n\")}\\n]\" )\n}\n","language":"Kotlin"},{"code":"Module testthis {\n\t\\\\ empty stack\n\tFlush\n\tinventory LL\n\tappend LL, \"des_system_lib\":=(List:=\"std\", \"synopsys\", \"std_cell_lib\", \"des_system_lib\", \"dw02\", \"dw01\", \"ramlib\", \"ieee\")\nREM\tappend LL, \"dw01\":=(List:=\"dw04\",\"ieee\", \"dw01\", \"dware\", \"gtech\")\n\tappend LL, \"dw01\":=(List:=\"ieee\", \"dw01\", \"dware\", \"gtech\")\n\tappend LL, \"dw02\":=(List:=\"ieee\", \"dw02\", \"dware\")\n\tappend LL, \"dw03\":=(List:=\"std\", \"synopsys\", \"dware\", \"dw03\", \"dw02\", \"dw01\", \"ieee\", \"gtech\")\n\tappend LL, \"dw04\":=(List:= \"ieee\", \"dw01\", \"dware\", \"gtech\")\n\tappend LL, \"dw05\":=(List:=\"dw05\", \"ieee\", \"dware\")\n\tappend LL, \"dw06\":=(List:=\"dw06\", \"ieee\", \"dware\")\n\tappend LL, \"dw07\":=(List:=\"ieee\", \"dware\")\n\tappend LL, \"dware\":=(List:=\"ieee\", \"dware\")\n\tappend LL, \"gtech\":=(List:=\"ieee\", \"gtech\")\n\tappend LL, \"ramlib\":=(List:=\"std\", \"ieee\")\n\tappend LL, \"std_cell_lib\":=(List:=\"ieee\", \"std_cell_lib\")\n\tappend LL, \"synopsys\":=List\n\t\\\\ inventory itmes may have keys/items or keys.\n\t\\\\ here we have keys so keys return as item also\n\t\\\\ when we place an item in a key (an empty string) ...\n\t\\\\ we mark the item to not return the key but an empty string\n\tinventory final\n\tmm=each(LL)\n\twhile mm\n\t\tk$=eval$(mm!)\n\t\tm=eval(mm)\n\t\tmmm=each(m)\n\t\tWhile mmm\n\t\t\tk1$=eval$(mmm!)\n\t\t\tif not exist(LL, k1$) then\n\t\t\t\tif not exist(final, k1$) then append final, k1$\n\t\t\t\treturn m, k1$:=\"\" \\\\ mark that item\n\t\t\telse\n\t\t\t\tmmmm=Eval(LL)\n\t\t\t\tif len(mmmm)=0 then\n\t\t\t\t\tif not exist(final, k1$) then append final, k1$\n\t\t\t\t\treturn m, k1$:=\"\" \\\\ mark that item\n\t\t\t\tend if\n\t\t\tend if\n\t\tend while\n\tend while\n\tmm=each(LL)\n\twhile mm\n\t\t\\\\ using eval$(mm!) we read the key as string\n\t\tk$=eval$(mm!)\n\t\tif exist(final, k$) then continue\n\t\tm=eval(mm)\n\t\tmmm=each(m)\n\t\tWhile mmm\n\t\t\t\\\\ we read the item, if no item exist we get the key\n\t\t\tk1$=eval$(mmm)\n\t\t\tif k1$=\"\" then continue\n\t\t\tif exist(final, k1$) then continue\n\t\t\tdata k1$ \\\\ push to end to stack\n\t\tend while\n\t\twhile not empty\n\t\t\tread k1$\n\t\t\tif exist(final, k1$) then continue\n\t\t\tm=LL(k1$)\n\t\t\tmmm=each(m)\n\t\t\tdelthis=0\n\t\t\tWhile mmm\n\t\t\t\tk2$=eval$(mmm)\n\t\t\t\tif k2$=\"\" then continue\n\t\t\t\tif k1$=k2$ then continue\n\t\t\t\tif exist(final, k2$) then continue\n\t\t\t\tpush k2$ \\\\ push to top of stack\n\t\t\t\treturn m, k2$:=\"\"\n\t\t\t\tdelthis++\n\t\t\tend while\n\t\t\tif delthis=0 then\n\t\t\t\tif not exist(final, k1$) then\n\t\t\t\t\tmmm=each(m)\n\t\t\t\t\tWhile mmm\n\t\t\t\t\t\tk2$=eval$(mmm!)\n\t\t\t\t\t\tif k2$=k1$ then continue\n\t\t\t\t\t\tif exist(final, k2$) Else\n\t\t\t\t\t\t\tPrint \"unsorted:\";k1$, k2$\n\t\t\t\t\t\tend if\n\t\t\t\t\tend while\n\t\t\t \t\tappend final, k1$ : Return LL, k1$:=List\n\t\t\t\tend if\n\t\t\tend if\n\t\tend while\n\t\tif not exist(final, k$) then append final, k$\n\tend while\n\tdocument doc$\n\tret=each(final,1, -2)\n\twhile ret\n\t\tdoc$=eval$(ret)+\" -> \"\n\tend while\n\tdoc$=final$(len(final)-1!)\n\tReport doc$\n\tclipboard doc$\n}\ntestthis\n","language":"M2000-Interpreter"},{"code":"TopologicalSort[\n Graph[Flatten[# /. {l_, ld_} :>\n Map[# -> l &,\n DeleteCases[ld, l]]]]] /. {_TopologicalSort -> $Failed} &@\n {{\"des_system_lib\", {\"std\", \"synopsys\", \"std_cell_lib\",\n \"des_system_lib\", \"dw02\", \"dw01\", \"ramlib\", \"ieee\"}},\n {\"dw01\", {\"ieee\", \"dw01\", \"dware\", \"gtech\"}},\n {\"dw02\", {\"ieee\", \"dw02\", \"dware\"}},\n {\"dw03\", {\"std\", \"synopsys\", \"dware\", \"dw03\", \"dw02\", \"dw01\",\n \"ieee\", \"gtech\"}},\n {\"dw04\", {\"dw04\", \"ieee\", \"dw01\", \"dware\", \"gtech\"}},\n {\"dw05\", {\"dw05\", \"ieee\", \"dware\"}},\n {\"dw06\", {\"dw06\", \"ieee\", \"dware\"}},\n {\"dw07\", {\"ieee\", \"dware\"}},\n {\"dware\", {\"ieee\", \"dware\"}},\n {\"gtech\", {\"ieee\", \"gtech\"}},\n {\"ramlib\", {\"std\", \"ieee\"}},\n {\"std_cell_lib\", {\"ieee\", \"std_cell_lib\"}},\n {\"synopsys\", {}}}\n","language":"Mathematica"},{"code":":- module topological_sort.\n\n:- interface.\n\n:- import_module io.\n:- pred main(io::di,io::uo) is det.\n\n\n:- implementation.\n:- import_module string, solutions, list, set, require.\n\n:- pred min_element(set(T),pred(T,T),T).\n:- mode min_element(in,pred(in,in) is semidet,out) is nondet.\nmin_element(_,_,_):-fail.\nmin_element(S,P,X):-\n member(X,S),\n filter((pred(Y::in) is semidet :- P(Y,X)),S,LowerThanX),\n is_empty(LowerThanX).\n\n\n\n:- pred topological_sort(set(T),pred(T,T),list(T),list(T)).\n:- mode topological_sort(in,(pred((ground >> ground), (ground >> ground)) is semidet),in,out) is nondet.\n:- pred topological_sort(set(T),pred(T,T),list(T)).\n:- mode topological_sort(in,(pred((ground >> ground), (ground >> ground)) is semidet),out) is nondet.\n\ntopological_sort(S,P,Ac,L) :-\n (\n\tis_empty(S) -> L is Ac\n ; solutions(\n\t pred(X::out) is nondet:-\n\t\tmin_element(S,P,X)\n\t , Solutions\n\t),\n\t(\n\t is_empty(Solutions) -> error(\"No solution detected.\\n\")\n\t; delete_list(Solutions,S,Sprime),\n\t append(Solutions,Ac,AcPrime),\n\t topological_sort(Sprime,P,AcPrime,L)\n\t)\n ).\n\ntopological_sort(S,P,L) :- topological_sort(S,P,[],L).\n\n\n:- pred distribute(list(T)::in,{T,list(T)}::out) is det.\ndistribute([],_):-error(\"Error in distribute\").\ndistribute([H|T],Z) :- Z = {H,T}.\n\n:- pred db_compare({string,list(string)}::in,{string,list(string)}::in) is semidet.\ndb_compare({X1,L1},{X2,_}) :- not(X1=X2),list.member(X2,L1).\n\n\nmain(!IO) :-\n Input = [\n\"des_system_lib std synopsys std_cell_lib des_system_lib dw02 dw01 ramlib ieee\",\n\"dw01 ieee dw01 dware gtech\",\n\"dw02 ieee dw02 dware\",\n\"dw03 std synopsys dware dw03 dw02 dw01 ieee gtech\",\n\"dw04 dw04 ieee dw01 dware gtech\",\n\"dw05 dw05 ieee dware\",\n\"dw06 dw06 ieee dware\",\n\"dw07 ieee dware\",\n\"dware ieee dware\",\n\"gtech ieee gtech\",\n\"ramlib std ieee\",\n\"std_cell_lib ieee std_cell_lib\",\n\"synopsys\"],\n Words=list.map(string.words,Input),\n list.map(distribute,Words,Db),\n solutions(pred(X::out) is nondet :- topological_sort(set.from_list(Db),db_compare,X),SortedWordLists),\n list.map(\n\t pred({X,Y}::in,Z::out) is det:- X=Z,\n\t list.det_head(SortedWordLists),\n\t CompileOrder),\n print(CompileOrder,!IO).\n","language":"Mercury"},{"code":"import sequtils, strutils, sets, tables, sugar\n\ntype StringSet = HashSet[string]\n\n\nproc topSort(data: var OrderedTable[string, StringSet]) =\n ## Topologically sort the data in place.\n\n var ranks: Table[string, Natural] # Maps the keys to a rank.\n\n # Remove self dependencies.\n for key, values in data.mpairs:\n values.excl key\n\n # Add extra items (i.e items present in values but not in keys).\n for values in toSeq(data.values):\n for value in values:\n if value notin data:\n data[value] = initHashSet[string]()\n\n # Find ranks.\n var deps = data # Working copy of the table.\n var rank = 0\n while deps.len > 0:\n\n # Find a key with an empty dependency set.\n var keyToRemove: string\n for key, values in deps.pairs:\n if values.card == 0:\n keyToRemove = key\n break\n if keyToRemove.len == 0:\n # Not found: there is a cycle.\n raise newException(ValueError, \"Unorderable items found: \" & toSeq(deps.keys).join(\", \"))\n\n # Assign a rank to the key and remove it from keys and values.\n ranks[keyToRemove] = rank\n inc rank\n deps.del keyToRemove\n for k, v in deps.mpairs:\n v.excl keyToRemove\n\n # Sort the original data according to the ranks.\n data.sort((x, y) => cmp(ranks[x[0]], ranks[y[0]]))\n\n\nwhen isMainModule:\n\n const Data = {\"des_system_lib\": [\"std\", \"synopsys\", \"std_cell_lib\",\n \"des_system_lib\", \"dw02\", \"dw01\",\n \"ramlib\", \"ieee\"].toHashSet,\n \"dw01\": [\"ieee\", \"dw01\", \"dware\", \"gtech\"].toHashSet,\n \"dw02\": [\"ieee\", \"dw02\", \"dware\"].toHashSet,\n \"dw03\": [\"std\", \"synopsys\", \"dware\", \"dw03\",\n \"dw02\", \"dw01\", \"ieee\", \"gtech\"].toHashSet,\n \"dw04\": [\"dw04\", \"ieee\", \"dw01\", \"dware\", \"gtech\"].toHashSet,\n \"dw05\": [\"dw05\", \"ieee\", \"dware\"].toHashSet,\n \"dw06\": [\"dw06\", \"ieee\", \"dware\"].toHashSet,\n \"dw07\": [\"ieee\", \"dware\"].toHashSet,\n \"dware\": [\"ieee\", \"dware\"].toHashSet,\n \"gtech\": [\"ieee\", \"gtech\"].toHashSet,\n \"ramlib\": [\"std\", \"ieee\"].toHashSet,\n \"std_cell_lib\": [\"ieee\", \"std_cell_lib\"].toHashSet,\n \"synopsys\": initHashSet[string]()}.toOrderedTable\n\n # Process the original data (without cycle).\n echo \"Data without cycle. Order after sorting:\"\n var data = Data\n try:\n data.topSort()\n for key in data.keys: echo key\n except ValueError:\n echo getCurrentExceptionMsg()\n\n # Process the modified data (with a cycle).\n echo \"\\nData with a cycle:\"\n data = Data\n data[\"dw01\"].incl \"dw04\"\n try:\n data.topSort()\n for key in data.keys: echo key\n except ValueError:\n echo getCurrentExceptionMsg()\n","language":"Nim"},{"code":"program topologicalsortrosetta;\n\n{*\nTopological sorter to parse e.g. dependencies.\nWritten for FreePascal 2.4.x/2.5.1. Probably works in Delphi, but you'd have to\nchange some units.\n*}\n{$IFDEF FPC}\n// FreePascal-specific setup\n{$mode objfpc}\nuses {$IFDEF UNIX}\n cwstring, {* widestring support for unix *} {$IFDEF UseCThreads}\n cthreads, {$ENDIF UseCThreads} {$ENDIF UNIX}\n Classes,\n SysUtils;\n{$ENDIF}\n\ntype\n RNodeIndex = record\n NodeName: WideString; //Name of the node\n //Index: integer; //Index number used in DepGraph. For now, we can distill the index from the array index. If we want to use a TList or similar, we'd need an index property\n Order: integer; //Order when sorted\n end;\n\n RDepGraph = record\n Node: integer; //Refers to Index in NodeIndex\n DependsOn: integer; //The Node depends on this other Node.\n end;\n\n { TTopologicalSort }\n\n TTopologicalSort = class(TObject)\n private\n Nodes: array of RNodeIndex;\n DependencyGraph: array of RDepGraph;\n FCanBeSorted: boolean;\n function SearchNode(NodeName: WideString): integer;\n function SearchIndex(NodeID: integer): WideString;\n function DepFromNodeID(NodeID: integer): integer;\n function DepFromDepID(DepID: integer): integer;\n function DepFromNodeIDDepID(NodeID, DepID: integer): integer;\n procedure DelDependency(const Index: integer);\n public\n constructor Create;\n destructor Destroy; override;\n procedure SortOrder(var Output: TStringList);\n procedure AddNode(NodeName: WideString);\n procedure AddDependency(NodeName, DependsOn: WideString);\n procedure AddNodeDependencies(NodeAndDependencies: TStringList);\n //Each string has node, and the nodes it depends on. This allows insertion of an entire dependency graph at once\n //procedure DelNode(NodeName: Widestring);\n procedure DelDependency(NodeName, DependsOn: WideString);\n\n property CanBeSorted: boolean read FCanBeSorted;\n\n end;\n\nconst\n INVALID = -1;\n // index not found for index search functions, no sort order defined, or record invalid/deleted\n\n function TTopologicalSort.SearchNode(NodeName: WideString): integer;\n var\n Counter: integer;\n begin\n // Return -1 if node not found. If node found, return index in array\n Result := INVALID;\n for Counter := 0 to High(Nodes) do\n begin\n if Nodes[Counter].NodeName = NodeName then\n begin\n Result := Counter;\n break;\n end;\n end;\n end;\n\n function TTopologicalSort.SearchIndex(NodeID: integer): WideString;\n //Look up name for the index\n begin\n if (NodeID > 0) and (NodeID <= High(Nodes)) then\n begin\n Result := Nodes[NodeID].NodeName;\n end\n else\n begin\n Result := 'ERROR'; //something's fishy, this shouldn't happen\n end;\n end;\n\n function TTopologicalSort.DepFromNodeID(NodeID: integer): integer;\n // Look for Node index number in the dependency graph\n // and return the first node found. If nothing found, return -1\n var\n Counter: integer;\n begin\n Result := INVALID;\n for Counter := 0 to High(DependencyGraph) do\n begin\n if DependencyGraph[Counter].Node = NodeID then\n begin\n Result := Counter;\n break;\n end;\n end;\n end;\n\n function TTopologicalSort.DepFromDepID(DepID: integer): integer;\n // Look for dependency index number in the dependency graph\n // and return the index for the first one found. If nothing found, return -1\n var\n Counter: integer;\n begin\n Result := INVALID;\n for Counter := 0 to High(DependencyGraph) do\n begin\n if DependencyGraph[Counter].DependsOn = DepID then\n begin\n Result := Counter;\n break;\n end;\n end;\n end;\n\n function TTopologicalSort.DepFromNodeIDDepID(NodeID, DepID: integer): integer;\n // Shows index for the dependency from NodeID on DepID, or INVALID if not found\n var\n Counter: integer;\n begin\n Result := INVALID;\n for Counter := 0 to High(DependencyGraph) do\n begin\n if DependencyGraph[Counter].Node = NodeID then\n if DependencyGraph[Counter].DependsOn = DepID then\n begin\n Result := Counter;\n break;\n end;\n end;\n end;\n\n procedure TTopologicalSort.DelDependency(const Index: integer);\n // Removes dependency from array.\n // Is fastest when the dependency is near the top of the array\n // as we're copying the remaining elements.\n var\n Counter: integer;\n OriginalLength: integer;\n begin\n OriginalLength := Length(DependencyGraph);\n if Index = OriginalLength - 1 then\n begin\n SetLength(DependencyGraph, OriginalLength - 1);\n end;\n if Index < OriginalLength - 1 then\n begin\n for Counter := Index to OriginalLength - 2 do\n begin\n DependencyGraph[Counter] := DependencyGraph[Counter + 1];\n end;\n SetLength(DependencyGraph, OriginalLength - 1);\n end;\n if Index > OriginalLength - 1 then\n begin\n // This could happen when deleting on an empty array:\n raise Exception.Create('Tried to delete index ' + IntToStr(Index) +\n ' while the maximum index was ' + IntToStr(OriginalLength - 1));\n end;\n end;\n\n constructor TTopologicalSort.Create;\n begin\n inherited Create;\n end;\n\n destructor TTopologicalSort.Destroy;\n begin\n // Clear up data just to make sure:\n Finalize(DependencyGraph);\n Finalize(Nodes);\n inherited;\n end;\n\n procedure TTopologicalSort.SortOrder(var Output: TStringList);\n var\n Counter: integer;\n NodeCounter: integer;\n OutputSortOrder: integer;\n DidSomething: boolean; //used to detect cycles (circular references)\n Node: integer;\n begin\n OutputSortOrder := 0;\n DidSomething := True; // prime the loop below\n FCanBeSorted := True; //hope for the best.\n while (DidSomething = True) do\n begin\n // 1. Find all nodes (now) without dependencies, output them first and remove the dependencies:\n // 1.1 Nodes that are not present in the dependency graph at all:\n for Counter := 0 to High(Nodes) do\n begin\n if DepFromNodeID(Counter) = INVALID then\n begin\n if DepFromDepID(Counter) = INVALID then\n begin\n // Node doesn't occur in either side of the dependency graph, so it has sort order 0:\n DidSomething := True;\n if (Nodes[Counter].Order = INVALID) or\n (Nodes[Counter].Order > OutputSortOrder) then\n begin\n // Enter sort order if the node doesn't have a lower valid order already.\n Nodes[Counter].Order := OutputSortOrder;\n end;\n end; //Invalid Dep\n end; //Invalid Node\n end; //Count\n // Done with the first batch, so we can increase the sort order:\n OutputSortOrder := OutputSortOrder + 1;\n // 1.2 Nodes that are only present on the right hand side of the dep graph:\n DidSomething := False;\n // reverse order so we can delete dependencies without passing upper array\n for Counter := High(DependencyGraph) downto 0 do\n begin\n Node := DependencyGraph[Counter].DependsOn; //the depended node\n if (DepFromNodeID(Node) = INVALID) then\n begin\n DidSomething := True;\n //Delete dependency so we don't hit it again:\n DelDependency(Counter);\n if (Nodes[Node].Order = INVALID) or (Nodes[Node].Order > OutputSortOrder) then\n begin\n // Enter sort order if the node doesn't have a lower valid order already.\n Nodes[Node].Order := OutputSortOrder;\n end;\n end;\n OutputSortOrder := OutputSortOrder + 1; //next iteration\n end;\n // 2. Go back to 1 until we can't do more work, and do some bookkeeping:\n OutputSortOrder := OutputSortOrder + 1;\n end; //outer loop for 1 to 2\n OutputSortOrder := OutputSortOrder - 1; //fix unused last loop.\n\n // 2. If we have dependencies left, we have a cycle; exit.\n if (High(DependencyGraph) > 0) then\n begin\n FCanBeSorted := False; //indicate we have a cycle\n Output.Add('Cycle (circular dependency) detected, cannot sort further. Dependencies left:');\n for Counter := 0 to High(DependencyGraph) do\n begin\n Output.Add(SearchIndex(DependencyGraph[Counter].Node) +\n ' depends on: ' + SearchIndex(DependencyGraph[Counter].DependsOn));\n end;\n end\n else\n begin\n // No cycle:\n // Now parse results, if we have them\n for Counter := 0 to OutputSortOrder do\n begin\n for NodeCounter := 0 to High(Nodes) do\n begin\n if Nodes[NodeCounter].Order = Counter then\n begin\n Output.Add(Nodes[NodeCounter].NodeName);\n end;\n end; //output each result\n end; //order iteration\n end; //cycle detection\n end;\n\n procedure TTopologicalSort.AddNode(NodeName: WideString);\n var\n NodesNewLength: integer;\n begin\n // Adds node; make sure we don't add duplicate entries\n if SearchNode(NodeName) = INVALID then\n begin\n NodesNewLength := Length(Nodes) + 1;\n SetLength(Nodes, NodesNewLength);\n Nodes[NodesNewLength - 1].NodeName := NodeName; //Arrays are 0 based\n //Nodes[NodesNewLength -1].Index := //If we change the object to a tlist or something, we already have an index property\n Nodes[NodesNewLength - 1].Order := INVALID; //default value\n end;\n end;\n\n procedure TTopologicalSort.AddDependency(NodeName, DependsOn: WideString);\n begin\n // Make sure both nodes in the dependency exist as a node\n if SearchNode(NodeName) = INVALID then\n begin\n Self.AddNode(NodeName);\n end;\n if SearchNode(DependsOn) = INVALID then\n begin\n Self.AddNode(DependsOn);\n end;\n // Add the dependency, only if we don't depend on ourselves:\n if NodeName <> DependsOn then\n begin\n SetLength(DependencyGraph, Length(DependencyGraph) + 1);\n DependencyGraph[High(DependencyGraph)].Node := SearchNode(NodeName);\n DependencyGraph[High(DependencyGraph)].DependsOn := SearchNode(DependsOn);\n end;\n end;\n\n procedure TTopologicalSort.AddNodeDependencies(NodeAndDependencies: TStringList);\n // Takes a stringlist containing a list of strings. Each string contains node names\n // separated by spaces. The first node depends on the others. It is permissible to have\n // only one node name, which doesn't depend on anything.\n // This procedure will add the dependencies and the nodes in one go.\n var\n Deplist: TStringList;\n StringCounter: integer;\n NodeCounter: integer;\n begin\n if Assigned(NodeAndDependencies) then\n begin\n DepList := TStringList.Create;\n try\n for StringCounter := 0 to NodeAndDependencies.Count - 1 do\n begin\n // For each string in the argument: split into names, and process:\n DepList.Delimiter := ' '; //use space to separate the entries\n DepList.StrictDelimiter := False; //allows us to ignore double spaces in input.\n DepList.DelimitedText := NodeAndDependencies[StringCounter];\n for NodeCounter := 0 to DepList.Count - 1 do\n begin\n if NodeCounter = 0 then\n begin\n // Add the first node, which might be the only one.\n Self.AddNode(Deplist[0]);\n end;\n\n if NodeCounter > 0 then\n begin\n // Only add dependency from the second item onwards\n // The AddDependency code will automatically add Deplist[0] to the Nodes, if required\n Self.AddDependency(DepList[0], DepList[NodeCounter]);\n end;\n end;\n end;\n finally\n DepList.Free;\n end;\n end;\n end;\n\n procedure TTopologicalSort.DelDependency(NodeName, DependsOn: WideString);\n // Delete the record.\n var\n NodeID: integer;\n DependsID: integer;\n Dependency: integer;\n begin\n NodeID := Self.SearchNode(NodeName);\n DependsID := Self.SearchNode(DependsOn);\n if (NodeID <> INVALID) and (DependsID <> INVALID) then\n begin\n // Look up dependency and delete it.\n Dependency := Self.DepFromNodeIDDepID(NodeID, DependsID);\n if (Dependency <> INVALID) then\n begin\n Self.DelDependency(Dependency);\n end;\n end;\n end;\n\n // Main program:\nvar\n InputList: TStringList; //Lines of dependencies\n TopSort: TTopologicalSort; //Topological sort object\n OutputList: TStringList; //Sorted dependencies\n Counter: integer;\nbegin\n\n //Actual sort\n InputList := TStringList.Create;\n // Add rosetta code sample input separated by at least one space in the lines\n InputList.Add(\n 'des_system_lib std synopsys std_cell_lib des_system_lib dw02 dw01 ramlib ieee');\n InputList.Add('dw01 ieee dw01 dware gtech');\n InputList.Add('dw02 ieee dw02 dware');\n InputList.Add('dw03 std synopsys dware dw03 dw02 dw01 ieee gtech');\n InputList.Add('dw04 dw04 ieee dw01 dware gtech');\n InputList.Add('dw05 dw05 ieee dware');\n InputList.Add('dw06 dw06 ieee dware');\n InputList.Add('dw07 ieee dware');\n InputList.Add('dware ieee dware');\n InputList.Add('gtech ieee gtech');\n InputList.Add('ramlib std ieee');\n InputList.Add('std_cell_lib ieee std_cell_lib');\n InputList.Add('synopsys');\n TopSort := TTopologicalSort.Create;\n OutputList := TStringList.Create;\n try\n TopSort.AddNodeDependencies(InputList); //read in nodes\n TopSort.SortOrder(OutputList); //perform the sort\n for Counter := 0 to OutputList.Count - 1 do\n begin\n writeln(OutputList[Counter]);\n end;\n except\n on E: Exception do\n begin\n Writeln(stderr, 'Error: ', DateTimeToStr(Now),\n ': Error sorting. Technical details: ',\n E.ClassName, '/', E.Message);\n end;\n end; //try\n OutputList.Free;\n TopSort.Free;\n InputList.Free;\nend.\n","language":"Object-Pascal"},{"code":"let dep_libs = [\n (\"des_system_lib\", [\"std\"; \"synopsys\"; \"std_cell_lib\"; \"des_system_lib\"; \"dw02\"; \"dw01\"; \"ramlib\"; \"ieee\"]);\n (\"dw01\", (*\"dw04\"::*)[\"ieee\"; \"dw01\"; \"dware\"; \"gtech\"]);\n (\"dw02\", [\"ieee\"; \"dw02\"; \"dware\"]);\n (\"dw03\", [\"std\"; \"synopsys\"; \"dware\"; \"dw03\"; \"dw02\"; \"dw01\"; \"ieee\"; \"gtech\"]);\n (\"dw04\", [\"dw04\"; \"ieee\"; \"dw01\"; \"dware\"; \"gtech\"]);\n (\"dw05\", [\"dw05\"; \"ieee\"; \"dware\"]);\n (\"dw06\", [\"dw06\"; \"ieee\"; \"dware\"]);\n (\"dw07\", [\"ieee\"; \"dware\"]);\n (\"dware\", [\"ieee\"; \"dware\"]);\n (\"gtech\", [\"ieee\"; \"gtech\"]);\n (\"ramlib\", [\"std\"; \"ieee\"]);\n (\"std_cell_lib\", [\"ieee\"; \"std_cell_lib\"]);\n (\"synopsys\", []);\n]\n\nlet dep_libs =\n let f (lib, deps) = (* remove self dependency *)\n (lib,\n List.filter (fun d -> d <> lib) deps) in\n List.map f dep_libs\n\nlet rev_unique =\n List.fold_left (fun acc x -> if List.mem x acc then acc else x::acc) []\n\nlet libs = (* list items, each being unique *)\n rev_unique (List.flatten(List.map (fun (lib, deps) -> lib::deps) dep_libs))\n\nlet get_deps lib =\n try (List.assoc lib dep_libs)\n with Not_found -> []\n\nlet res =\n let rec aux acc later todo progress =\n match todo, later with\n | [], [] -> (List.rev acc)\n | [], _ ->\n if progress\n then aux acc [] later false\n else invalid_arg \"un-orderable data\"\n | x::xs, _ ->\n let deps = get_deps x in\n let ok = List.for_all (fun dep -> List.mem dep acc) deps in\n if ok\n then aux (x::acc) later xs true\n else aux acc (x::later) xs progress\n in\n let starts, todo = List.partition (fun lib -> get_deps lib = []) libs in\n aux starts [] todo false\n\nlet () =\n print_string \"result: \\n \";\n print_endline (String.concat \", \" res);\n;;\n","language":"OCaml"},{"code":"'TOPOLOGICAL SORT\n\nuses parseutil 'getword() lenw\nuses console\n\nstring dat=\"\nLIBRARY LIBRARY DEPENDENCIES\n======= ====================\ndes_system_lib std synopsys std_cell_lib des_system_lib dw02 dw01 ramlib ieee\ndw01 ieee dw01 dware gtech\ndw02 ieee dw02 dware\ndw03 std synopsys dware dw03 dw02 dw01 ieee gtech\ndw04 dw04 ieee dw01 dware gtech\ndw05 dw05 ieee dware\ndw06 dw06 ieee dware\ndw07 ieee dware\ndware ieee dware\ngtech ieee gtech\nramlib std ieee\nstd_cell_lib ieee std_cell_lib\nsynopsys\n\"\ngosub Dims\ngosub CaptureData\ngosub GetSystemLibs\ngosub RemoveSelfReference\ngosub OrderByDependency\ngosub DisplayResults\nend\n\n/*RESULTS:\n libraries in dependency order\n -----------------------------\n std\n ieee\n dware\n gtech\n ramlib\n std_cell_lib\n synopsys\n dw01\n dw02\n des_system_lib\n dw03\n dw04\n dw05\n dw06\n dw07\n<<\n\n remainder:\n ----------\n <<\n*/\n\n\n\nDims:\n=====\n'VARIABLES\nint p 'width of first column\nint h 'length of each line\nint i 'iterator / counter\nint j 'main iterator\nint b 'table char offset\nint e 'end of each line\nint bd 'each offset of dependencises line\nint le 'length of each lib name\nint lend 'size of table\nint k 'character indexer\nint m 'iterator\nint n 'iterator\nint cw 'presence flag\nint lw 'length of keyword\nint a 'iinstr result\nint dc 'new lib list indexer / counter\nstring wr 'keyword\nstring wn 'keyword\n'--arrays--\nstring datl[64] 'list of lib names\nstring datd[64] 'lists of lib dependencies\nstring datn[64] 'new list in dependency ordert\nret\n\n\nCaptureData:\n============\ndat=lcase dat\n'GET HEADING POSITION\np=instr dat,\"library depend\"\np-=3 'crlf -1\n'REMOVE HEADING\nh=instr 3,dat,cr\nh+=2\nh=instr h,dat,cr 'to remove underlines\n'print h cr\nh+=2\ndat=mid dat,h\n'print dat \"<\" cr\nb=1\n'PREPARE DATA\nlend=len dat\ndo\n i++\n datl[i]=rtrim(mid(dat,b,p))\n le=len datl[i]\n e=instr b+le,dat,cr\n bd=b+p\n datd[i]=\" \"+mid(dat,bd,e-bd)+\" \"\n 'print datl[i] \",\" datd[i] cr\n b=e+2\n if b>lend-2\n exit do\n endif\nloop\nret\n\nGetSystemLibs:\n==============\n'SCAN DEPENDENCIES\n'GET SYSTEM LIBS NOT LISTED\nfor j=1 to i\n k=1\n do\n wr=getword datd[j],k\n if not wr\n exit do\n endif\n cw=0\n for m=1 to i\n if wr=datl[m] 'on lib list\n cw=m\n endif\n next\n if cw=0 'lib not on library list\n 'add wr to new lib list\n dc++ : datn[dc]=wr\n 'remove lib names from dependency lists\n gosub BlankOutNames\n endif\n loop\nnext 'j group of dependencies\nret\n\n\nRemoveSelfReference:\n====================\n'REMOVE SELF REFERENCE + NO DEPENDENCIES\nfor j=1 to i\n wr=\" \"+datl[j]+\" \"\n lw=len(wr)\n a=instr(datd[j],wr)\n if a\n mid(datd[j],a,space(lw)) 'blank out self\n endif\n gosub RemoveLibFromLists\nnext\nret\n'\nOrderByDependency:\n==================\n'\nfor j=1 to i\n if datl[j]\n gosub RemoveLibFromLists\n if cw then j=0 'repeat cycle\n endif\nnext\nret\n'\nDisplayResults:\n===============\nprint cr cr\nprint \"libraries in dependency order\" cr\nprint \"-----------------------------\" cr\nfor j=1 to dc\n print datn[j] cr\nnext\nprint \"<<\" cr cr\nprint \"remainder:\" cr\nprint \"----------\" cr\nfor j=1 to i\n if datl[j]\n print datl[j] \" , \" datd[j] cr\n endif\nnext\nprint \"<<\" cr\n\npause\nend\n\nRemoveLibFromLists:\n===================\ncw=0\nk=1 : wr=getword datd[j],k\nif lenw=0\n dc++ : datn[dc]=datl[j] 'add to new lib list\n datl[j]=\"\" : datd[j]=\"\" 'eliminate frecord rom further checks\n gosub BlankOutNames 'eliminate all lib references from table\n cw=1 'flag alteration\nendif\nret\n\nBlankOutNames:\n==============\nwn=\" \"+datn[dc]+\" \" 'add word boundaries\nlw=len wn\nfor n=1 to i\n if datd[n]\n a=instr(datd[n],wn)\n if a\n mid datd[n],a,space(lw) 'blank out\n endif\n endif\nnext\nret\n","language":"OxygenBasic"},{"code":"declare\n Deps = unit(\n des_system_lib: [std synopsys std_cell_lib des_system_lib\n dw02 dw01 ramlib ieee]\n dw01: [ieee dw01 dware gtech]\n dw02: [ieee dw02 dware]\n dw03: [std synopsys dware dw03 dw02 dw01 ieee gtech]\n dw04: [dw04 ieee dw01 dware gtech]\n dw05: [dw05 ieee dware]\n dw06: [dw06 ieee dware]\n dw07: [ieee dware]\n dware: [ieee dware]\n gtech: [ieee gtech]\n ramlib: [std ieee]\n std_cell_lib: [ieee std_cell_lib]\n synopsys:nil\n )\n\n %% Describe possible solutions\n proc {TopologicalOrder Solution}\n FullDeps = {Complete Deps}\n in\n %% The solution is a record that maps library names\n %% to finite domain variables.\n %% The smaller the value, the earlier it must be compiled\n Solution = {FD.record sol {Arity FullDeps} 1#{Width FullDeps}}\n %% for every lib on the left side\n {Record.forAllInd FullDeps\n proc {$ LibName Dependants}\n %% ... and every dependant on the right side\n for Dependant in Dependants do\n %% propagate compilation order\n if Dependant \\= LibName then\n Solution.LibName >: Solution.Dependant\n end\n end\n end\n }\n %% enumerate solutions\n {FD.distribute naive Solution}\n end\n\n %% adds empty list of dependencies for libs that only occur on the right side\n fun {Complete Dep}\n AllLibs = {Nub {Record.foldL Dep Append nil}}\n in\n {Adjoin\n {List.toRecord unit {Map AllLibs fun {$ L} L#nil end}}\n Dep}\n end\n\n %% removes duplicates\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\n %% print grouped by parallelizable jobs\n proc {PrintSolution Sol}\n for I in 1..{Record.foldL Sol Value.max 1} do\n for Lib in {Arity {Record.filter Sol fun {$ X} X == I end}} do\n {System.printInfo Lib#\" \"}\n end\n {System.printInfo \"\\n\"}\n end\n end\n\n fun {GetOrderedLibs Sol}\n {Map\n {Sort {Record.toListInd Sol} CompareSecond}\n SelectFirst}\n end\n fun {CompareSecond A B} A.2 < B.2 end\n fun {SelectFirst X} X.1 end\nin\n case {SearchOne TopologicalOrder}\n of nil then {System.showInfo \"Un-orderable.\"}\n [] [Sol] then\n {System.showInfo \"A possible topological ordering: \"}\n {ForAll {GetOrderedLibs Sol} System.showInfo}\n\n {System.showInfo \"\\nBONUS - grouped by parallelizable compile jobs:\"}\n {PrintSolution Sol}\n end\n","language":"Oz"},{"code":"program ToposortTask;\n{$mode delphi}\nuses\n SysUtils, Generics.Collections;\n\ntype\n TAdjList = class\n InList, // incoming arcs\n OutList: THashSet<string>; // outcoming arcs\n constructor Create;\n destructor Destroy; override;\n end;\n\n TDigraph = class(TObjectDictionary<string, TAdjList>)\n procedure AddNode(const s: string);\n procedure AddArc(const s, t: string);\n function AdjList(const s: string): TAdjList;\n { returns True and the sorted sequence of nodes in aOutSeq if is acyclic,\n otherwise returns False and nil; uses Kahn's algorithm }\n function TryToposort(out aOutSeq: TStringArray): Boolean;\n end;\n\n\nconstructor TAdjList.Create;\nbegin\n InList := THashSet<string>.Create;\n OutList := THashSet<string>.Create;\nend;\n\ndestructor TAdjList.Destroy;\nbegin\n InList.Free;\n OutList.Free;\n inherited;\nend;\n\nprocedure TDigraph.AddNode(const s: string);\nbegin\n if not ContainsKey(s) then\n Add(s, TAdjList.Create);\nend;\n\nprocedure TDigraph.AddArc(const s, t: string);\nbegin\n AddNode(s);\n AddNode(t);\n if s <> t then begin\n Items[s].OutList.Add(t);\n Items[t].InList.Add(s);\n end;\nend;\n\nfunction TDigraph.AdjList(const s: string): TAdjList;\nbegin\n if not TryGetValue(s, Result) then\n Result := nil;\nend;\n\nfunction TDigraph.TryToposort(out aOutSeq: TStringArray): Boolean;\nvar\n q: TQueue<string>;\n p: TPair<string, TAdjList>;\n Node, ToRemove: string;\n Counter: SizeInt;\nbegin\n q := TQueue<string>.Create;\n SetLength(aOutSeq, Count);\n Counter := Pred(Count);\n for p in Self do\n if p.Value.InList.Count = 0 then\n q.Enqueue(p.Key);\n while q.Count > 0 do begin\n ToRemove := q.Dequeue;\n for Node in Items[ToRemove].OutList do\n with Items[Node] do begin\n InList.Remove(ToRemove);\n if InList.Count = 0 then\n q.Enqueue(Node);\n end;\n Remove(ToRemove);\n aOutSeq[Counter] := ToRemove;\n Dec(Counter);\n end;\n q.Free;\n Result := Count = 0;\n if not Result then\n aOutSeq := nil;\nend;\n\n{ expects text separated by line breaks }\nfunction ParseRawData(const aData: string): TDigraph;\nvar\n Line, Curr, Node: string;\n FirstTerm: Boolean;\nbegin\n Result := TDigraph.Create([doOwnsValues]);\n for Line in aData.Split([LineEnding], TStringSplitOptions.ExcludeEmpty) do begin\n FirstTerm := True;\n for Curr in Line.Split([' '], TStringSplitOptions.ExcludeEmpty) do\n if FirstTerm then begin\n Node := Curr;\n Result.AddNode(Curr);\n FirstTerm := False;\n end else\n Result.AddArc(Node, Curr);\n end;\nend;\n\nprocedure TrySort(const aData: string);\nvar\n g: TDigraph;\n Sorted: TStringArray;\nbegin\n g := ParseRawData(aData);\n if g.TryToposort(Sorted) then\n WriteLn('success: ', LineEnding, string.Join(', ', Sorted))\n else\n WriteLn('circular dependency detected');\n g.Free;\nend;\n\nconst\n ExampleData =\n 'des_system_lib std synopsys std_cell_lib des_system_lib dw02 dw01 ramlib ieee' + LineEnding +\n 'dw01 ieee dw01 dware gtech' + LineEnding +\n 'dw02 ieee dw02 dware' + LineEnding +\n 'dw03 std synopsys dware dw03 dw02 dw01 ieee gtech' + LineEnding +\n 'dw04 dw04 ieee dw01 dware gtech' + LineEnding +\n 'dw05 dw05 ieee dware' + LineEnding +\n 'dw06 dw06 ieee dware' + LineEnding +\n 'dw07 ieee dware' + LineEnding +\n 'dware ieee dware' + LineEnding +\n 'gtech ieee gtech' + LineEnding +\n 'ramlib std ieee' + LineEnding +\n 'std_cell_lib ieee std_cell_lib' + LineEnding +\n 'synopsys';\nvar\n Temp: TStringArray;\n\nbegin\n TrySort(ExampleData);\n WriteLn;\n //let's add a circular dependency\n Temp := ExampleData.Split([LineEnding], TStringSplitOptions.ExcludeEmpty);\n Temp[1] := Temp[1] + ' dw04';\n TrySort(string.Join(LineEnding, Temp));\nend.\n","language":"Pascal"},{"code":"program ToposortTask;\n{$mode delphi}\nuses\n SysUtils, Generics.Collections;\n\ntype\n TDigraph = class(TObjectDictionary<string, THashSet<string>>)\n procedure AddNode(const s: string);\n procedure AddArc(const s, t: string);\n function AdjList(const s: string): THashSet<string>;\n { returns True and the sorted sequence of nodes in aOutSeq if is acyclic,\n otherwise returns False and the first found cycle; uses DFS }\n function TryToposort(out aOutSeq: TStringArray): Boolean;\n end;\n\nprocedure TDigraph.AddNode(const s: string);\nbegin\n if not ContainsKey(s) then\n Add(s, THashSet<string>.Create);\nend;\n\nprocedure TDigraph.AddArc(const s, t: string);\nbegin\n AddNode(s);\n AddNode(t);\n if s <> t then\n Items[s].Add(t);\nend;\n\nfunction TDigraph.AdjList(const s: string): THashSet<string>;\nbegin\n if not TryGetValue(s, Result) then\n Result := nil;\nend;\n\nfunction TDigraph.TryToposort(out aOutSeq: TStringArray): Boolean;\nvar\n Parents: TDictionary<string, string>;// stores the traversal tree as pairs (Node, its predecessor)\n procedure ExtractCycle(const BackPoint: string; Prev: string);\n begin // just walk backwards through the traversal tree, starting from Prev until BackPoint is encountered\n with TList<string>.Create do begin\n Add(Prev);\n repeat\n Prev := Parents[Prev];\n Add(Prev);\n until Prev = BackPoint;\n Add(Items[0]);\n Reverse; //this is required since we moved backwards through the tree\n aOutSeq := ToArray;\n Free;\n end\n end;\nvar\n Visited, // set of already visited nodes\n Closed: THashSet<string>;// set of nodes whose subtree traversal is complete\n Counter: SizeInt = 0;\n function Dfs(const aNode: string): Boolean;// True means successful sorting,\n var // False - found cycle\n Next: string;\n begin\n Visited.Add(aNode);\n for Next in AdjList(aNode) do\n if not Visited.Contains(Next) then begin\n Parents.Add(Next, aNode);\n if not Dfs(Next) then exit(False);\n end else\n if not Closed.Contains(Next) then begin//back edge found(i.e. cycle)\n ExtractCycle(Next, aNode);\n exit(False);\n end;\n Closed.Add(aNode);\n aOutSeq[Counter] := aNode;\n Inc(Counter);\n Result := True;\n end;\nvar\n Node: string;\nbegin\n SetLength(aOutSeq, Count);\n Visited := THashSet<string>.Create;\n Closed := THashSet<string>.Create;\n Parents := TDictionary<string, string>.Create;\n Result := True;\n for Node in Keys do\n if not Visited.Contains(Node) then\n if not Dfs(Node) then begin\n Result := False;\n break;\n end;\n Visited.Free;\n Closed.Free;\n Parents.Free;\nend;\n\n{ expects text separated by line breaks }\nfunction ParseRawData(const aData: string): TDigraph;\nvar\n Line, Curr, Node: string;\n FirstTerm: Boolean;\nbegin\n Result := TDigraph.Create([doOwnsValues]);\n for Line in aData.Split([LineEnding], TStringSplitOptions.ExcludeEmpty) do begin\n FirstTerm := True;\n for Curr in Line.Split([' '], TStringSplitOptions.ExcludeEmpty) do\n if FirstTerm then begin\n Node := Curr;\n Result.AddNode(Curr);\n FirstTerm := False;\n end else\n Result.AddArc(Node, Curr);\n end;\nend;\n\nprocedure TrySort(const aData: string);\nvar\n g: TDigraph;\n Sorted: TStringArray;\nbegin\n g := ParseRawData(aData);\n if g.TryToposort(Sorted) then\n WriteLn('success: ', LineEnding, string.Join(', ', Sorted))\n else\n WriteLn('circular dependency: ', LineEnding, string.Join('->', Sorted));\n g.Free;\nend;\n\nconst\n ExampleData =\n 'des_system_lib std synopsys std_cell_lib des_system_lib dw02 dw01 ramlib ieee' + LineEnding +\n 'dw01 ieee dw01 dware gtech' + LineEnding +\n 'dw02 ieee dw02 dware' + LineEnding +\n 'dw03 std synopsys dware dw03 dw02 dw01 ieee gtech' + LineEnding +\n 'dw04 dw04 ieee dw01 dware gtech' + LineEnding +\n 'dw05 dw05 ieee dware' + LineEnding +\n 'dw06 dw06 ieee dware' + LineEnding +\n 'dw07 ieee dware' + LineEnding +\n 'dware ieee dware' + LineEnding +\n 'gtech ieee gtech' + LineEnding +\n 'ramlib std ieee' + LineEnding +\n 'std_cell_lib ieee std_cell_lib' + LineEnding +\n 'synopsys';\nvar\n Temp: TStringArray;\n\nbegin\n TrySort(ExampleData);\n WriteLn;\n //let's add a circular dependency\n Temp := ExampleData.Split([LineEnding], TStringSplitOptions.ExcludeEmpty);\n Temp[1] := Temp[1] + ' dw07';\n Temp[7] := Temp[7] + ' dw03';\n TrySort(string.Join(LineEnding, Temp));\nend.\n","language":"Pascal"},{"code":"sub print_topo_sort {\n my %deps = @_;\n\n my %ba;\n while ( my ( $before, $afters_aref ) = each %deps ) {\n for my $after ( @{ $afters_aref } ) {\n $ba{$before}{$after} = 1 if $before ne $after;\n $ba{$after} ||= {};\n }\n }\n\n while ( my @afters = sort grep { ! %{ $ba{$_} } } keys %ba ) {\n print \"@afters\\n\";\n delete @ba{@afters};\n delete @{$_}{@afters} for values %ba;\n }\n\n print !!%ba ? \"Cycle found! \". join( ' ', sort keys %ba ). \"\\n\" : \"---\\n\";\n}\n\nmy %deps = (\n des_system_lib => [qw( std synopsys std_cell_lib des_system_lib dw02\n dw01 ramlib ieee )],\n dw01 => [qw( ieee dw01 dware gtech )],\n dw02 => [qw( ieee dw02 dware )],\n dw03 => [qw( std synopsys dware dw03 dw02 dw01 ieee gtech )],\n dw04 => [qw( dw04 ieee dw01 dware gtech )],\n dw05 => [qw( dw05 ieee dware )],\n dw06 => [qw( dw06 ieee dware )],\n dw07 => [qw( ieee dware )],\n dware => [qw( ieee dware )],\n gtech => [qw( ieee gtech )],\n ramlib => [qw( std ieee )],\n std_cell_lib => [qw( ieee std_cell_lib )],\n synopsys => [qw( )],\n);\nprint_topo_sort(%deps);\npush @{ $deps{'dw01'} }, 'dw04'; # Add unresolvable dependency\nprint_topo_sort(%deps);\n","language":"Perl"},{"code":"(phixonline)-->\n <span style=\"color: #004080;\">sequence</span> <span style=\"color: #000000;\">names</span>\n <span style=\"color: #008080;\">enum</span> <span style=\"color: #000000;\">RANK</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">NAME</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">DEP</span> <span style=\"color: #000080;font-style:italic;\">-- content of names\n -- rank is 1 for items to compile first, then 2, etc,\n -- or 0 if cyclic dependencies prevent compilation.\n -- name is handy, and makes the result order alphabetic!\n -- dep is a list of dependencies (indexes to other names)</span>\n\n <span style=\"color: #008080;\">function</span> <span style=\"color: #000000;\">add_dependency</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #004080;\">string</span> <span style=\"color: #000000;\">name</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: #000000;\">name</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #7060A8;\">vslice</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">names</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">NAME</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;\">names</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">append</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">names</span><span style=\"color: #0000FF;\">,{</span><span style=\"color: #000000;\">0</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">name</span><span style=\"color: #0000FF;\">,{}})</span>\n <span style=\"color: #000000;\">k</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">length</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">names</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;\">k</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;\">topsort</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #004080;\">string</span> <span style=\"color: #000000;\">input</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #000000;\">names</span> <span style=\"color: #0000FF;\">=</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;\">input</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: #004080;\">sequence</span> <span style=\"color: #000000;\">line</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: #000000;\">dependencies</span> <span style=\"color: #0000FF;\">=</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;\">add_dependency</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">line</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;\">j</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;\">line</span><span style=\"color: #0000FF;\">)</span> <span style=\"color: #008080;\">do</span>\n <span style=\"color: #004080;\">integer</span> <span style=\"color: #000000;\">l</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">add_dependency</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">line</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">j</span><span style=\"color: #0000FF;\">])</span>\n <span style=\"color: #008080;\">if</span> <span style=\"color: #000000;\">l</span><span style=\"color: #0000FF;\">!=</span><span style=\"color: #000000;\">k</span> <span style=\"color: #008080;\">then</span> <span style=\"color: #000080;font-style:italic;\">-- ignore self-references</span>\n <span style=\"color: #000000;\">dependencies</span> <span style=\"color: #0000FF;\">&=</span> <span style=\"color: #000000;\">l</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;\">names</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">k</span><span style=\"color: #0000FF;\">][</span><span style=\"color: #000000;\">DEP</span><span style=\"color: #0000FF;\">]</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">dependencies</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">for</span>\n\n <span style=\"color: #000080;font-style:italic;\">-- Now populate names[RANK] iteratively:</span>\n <span style=\"color: #004080;\">bool</span> <span style=\"color: #000000;\">more</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #004600;\">true</span>\n <span style=\"color: #004080;\">integer</span> <span style=\"color: #000000;\">rank</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">0</span>\n <span style=\"color: #008080;\">while</span> <span style=\"color: #000000;\">more</span> <span style=\"color: #008080;\">do</span>\n <span style=\"color: #000000;\">more</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #004600;\">false</span>\n <span style=\"color: #000000;\">rank</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;\">names</span><span style=\"color: #0000FF;\">)</span> <span style=\"color: #008080;\">do</span>\n <span style=\"color: #008080;\">if</span> <span style=\"color: #000000;\">names</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">i</span><span style=\"color: #0000FF;\">][</span><span style=\"color: #000000;\">RANK</span><span style=\"color: #0000FF;\">]=</span><span style=\"color: #000000;\">0</span> <span style=\"color: #008080;\">then</span>\n <span style=\"color: #004080;\">bool</span> <span style=\"color: #000000;\">ok</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #004600;\">true</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;\">names</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">i</span><span style=\"color: #0000FF;\">][</span><span style=\"color: #000000;\">DEP</span><span style=\"color: #0000FF;\">])</span> <span style=\"color: #008080;\">do</span>\n <span style=\"color: #004080;\">integer</span> <span style=\"color: #000000;\">ji</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">names</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">i</span><span style=\"color: #0000FF;\">][</span><span style=\"color: #000000;\">DEP</span><span style=\"color: #0000FF;\">][</span><span style=\"color: #000000;\">j</span><span style=\"color: #0000FF;\">],</span>\n <span style=\"color: #000000;\">nr</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">names</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">ji</span><span style=\"color: #0000FF;\">][</span><span style=\"color: #000000;\">RANK</span><span style=\"color: #0000FF;\">]</span>\n <span style=\"color: #008080;\">if</span> <span style=\"color: #000000;\">nr</span><span style=\"color: #0000FF;\">=</span><span style=\"color: #000000;\">0</span> <span style=\"color: #008080;\">or</span> <span style=\"color: #000000;\">nr</span><span style=\"color: #0000FF;\">=</span><span style=\"color: #000000;\">rank</span> <span style=\"color: #008080;\">then</span>\n <span style=\"color: #000080;font-style:italic;\">-- not yet compiled, or same pass</span>\n <span style=\"color: #000000;\">ok</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #004600;\">false</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: #008080;\">if</span> <span style=\"color: #000000;\">ok</span> <span style=\"color: #008080;\">then</span>\n <span style=\"color: #000000;\">names</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">i</span><span style=\"color: #0000FF;\">][</span><span style=\"color: #000000;\">RANK</span><span style=\"color: #0000FF;\">]</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">rank</span>\n <span style=\"color: #000000;\">more</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #004600;\">true</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;\">for</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">while</span>\n\n <span style=\"color: #000000;\">names</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">sort</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">names</span><span style=\"color: #0000FF;\">)</span> <span style=\"color: #000080;font-style:italic;\">-- (ie by [RANK=1] then [NAME=2])</span>\n <span style=\"color: #004080;\">integer</span> <span style=\"color: #000000;\">prank</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">names</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">][</span><span style=\"color: #000000;\">RANK</span><span style=\"color: #0000FF;\">]</span>\n <span style=\"color: #008080;\">if</span> <span style=\"color: #000000;\">prank</span><span style=\"color: #0000FF;\">=</span><span style=\"color: #000000;\">0</span> <span style=\"color: #008080;\">then</span> <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;\">\"** CYCLIC **:\"</span><span style=\"color: #0000FF;\">)</span> <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;\">1</span> <span style=\"color: #008080;\">to</span> <span style=\"color: #7060A8;\">length</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">names</span><span style=\"color: #0000FF;\">)</span> <span style=\"color: #008080;\">do</span>\n <span style=\"color: #000000;\">rank</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">names</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">i</span><span style=\"color: #0000FF;\">][</span><span style=\"color: #000000;\">RANK</span><span style=\"color: #0000FF;\">]</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>\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: #008080;\">iff</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">rank</span><span style=\"color: #0000FF;\">=</span><span style=\"color: #000000;\">prank</span><span style=\"color: #0000FF;\">?</span><span style=\"color: #008000;\">\" \"</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;\">if</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;\">names</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">i</span><span style=\"color: #0000FF;\">][</span><span style=\"color: #000000;\">NAME</span><span style=\"color: #0000FF;\">])</span>\n <span style=\"color: #000000;\">prank</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">rank</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;\">procedure</span>\n\n <span style=\"color: #008080;\">constant</span> <span style=\"color: #000000;\">input</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #008000;\">\"\"\"\n des_system_lib std synopsys std_cell_lib des_system_lib dw02 dw01 ramlib ieee\n dw01 ieee dw01 dware gtech\n dw02 ieee dw02 dware\n dw03 std synopsys dware dw03 dw02 dw01 ieee gtech\n dw04 dw04 ieee dw01 dware gtech\n dw05 dw05 ieee dware\n dw06 dw06 ieee dware\n dw07 ieee dware\n dware ieee dware\n gtech ieee gtech\n ramlib std ieee\n std_cell_lib ieee std_cell_lib\n synopsys\"\"\"</span>\n\n <span style=\"color: #000000;\">topsort</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">input</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;\">\"\\nbad input:\\n\"</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #000000;\">topsort</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">input</span><span style=\"color: #0000FF;\">&</span><span style=\"color: #008000;\">\"\\ndw01 dw04\"</span><span style=\"color: #0000FF;\">)</span>\n<!--\n","language":"Phix"},{"code":"topological_sort(Precedences, Sorted) =>\n\n Edges = [K=V : [K,V] in Precedences],\n Nodes = (domain(Edges) ++ range(Edges)).remove_dups(),\n Sorted1 = [],\n while (member(X,Nodes), not membchk(X,range(Edges)))\n Sorted1 := Sorted1 ++ [X],\n Nodes := Nodes.delete(X),\n Edges := Edges.delete_key(X)\n end,\n % detect and remove a cycle\n if Nodes.length > 0 then\n println(\"\\nThe graph is cyclic. Here's the detected cycle.\"),\n println(nodes_in_cycle=Nodes),\n println(edges_in_cycle=Edges),\n Sorted = [without_cycle=Sorted1,cycle=Nodes]\n else\n Sorted = Sorted1\n end,\n nl.\n\n% domain are the keys in L\ndomain(L) = [K : K=_V in L].\n\n% range are the values of L\nrange(L) = [V : _K=V in L].\n\n% deletes all pairs in L where a key is X\n% (this is lessf on a multi-map in GNU SETL)\ndelete_key(L,X) = [K=V : K=V in L, K!=X].\n","language":"Picat"},{"code":"main =>\n deps(1,Deps),\n Prec=[],\n foreach(Lib=Dep in Deps)\n Prec := Prec ++ [[D,Lib] : D in Dep, D != Lib]\n end,\n topological_sort(Prec,Sort),\n println(Sort),\n nl.\n\n% Dependencies\ndeps(1,Deps) =>\n Deps = [\n des_system_lib=[std,synopsys,std_cell_lib,des_system_lib,dw02,dw01,ramlib,ieee],\n dw01=[ieee,dw01,dware,gtech],\n dw02=[ieee,dw02,dware],\n dw03=[std,synopsys,dware,dw03,dw02,dw01,ieee,gtech],\n dw04=[dw04,ieee,dw01,dware,gtech],\n dw05=[dw05,ieee,dware],\n dw06=[dw06,ieee,dware],\n dw07=[ieee,dware],\n dware=[ieee,dware],\n gtech=[ieee,gtech],\n ramlib=[std,ieee],\n std_cell_lib=[ieee,std_cell_lib],\n synopsys=[]\n ].\n","language":"Picat"},{"code":"main =>\n deps(with_cycle,Deps),\n Prec=[],\n foreach(Lib=Dep in Deps)\n Prec := Prec ++ [[D,Lib] : D in Dep, D != Lib]\n end,\n topological_sort(Prec,Sort),\n println(Sort),\n nl.\n\ndeps(with_cycle,Deps) =>\n Deps = [\n des_system_lib=[std,synopsys,std_cell_lib,des_system_lib,dw02,dw01,ramlib,ieee],\n % dw01=[ieee,dw01,dware,gtech], % orig\n dw01=[ieee,dw01,dware,gtech,dw04], % make a cycle\n dw02=[ieee,dw02,dware],\n dw03=[std,synopsys,dware,dw03,dw02,dw01,ieee,gtech],\n dw04=[dw04,ieee,dw01,dware,gtech],\n dw05=[dw05,ieee,dware],\n dw06=[dw06,ieee,dware],\n dw07=[ieee,dware],\n dware=[ieee,dware],\n gtech=[ieee,gtech],\n ramlib=[std,ieee],\n std_cell_lib=[ieee,std_cell_lib],\n synopsys=[],\n % And some other cycles\n cycle_1=[cycle_2],\n cycle_2=[cycle_1],\n cycle_3=[dw01,cycle_4,dw02,daw03],\n cycle_4=[cycle_3,dw01,dw04]\n ].\n","language":"Picat"},{"code":"(de sortDependencies (Lst)\n (setq Lst # Build a flat list\n (uniq\n (mapcan\n '((L)\n (put (car L) 'dep (cdr L)) # Store dependencies in 'dep' properties\n (copy L) )\n (mapcar uniq Lst) ) ) ) # without self-dependencies\n (make\n (while Lst\n (ifn (find '((This) (not (: dep))) Lst) # Found non-depending lib?\n (quit \"Can't resolve dependencies\" Lst)\n (del (link @) 'Lst) # Yes: Store in result\n (for This Lst # and remove from 'dep's\n (=: dep (delete @ (: dep))) ) ) ) ) )\n","language":"PicoLisp"},{"code":"#Input Data\n$a=@\"\ndes_system_lib std synopsys std_cell_lib des_system_lib dw02 dw01 ramlib ieee\ndw01 ieee dw01 dware gtech\ndw02 ieee dw02 dware\ndw03 std synopsys dware dw03 dw02 dw01 ieee gtech\ndw04 dw04 ieee dw01 dware gtech\ndw05 dw05 ieee dware\ndw06 dw06 ieee dware\ndw07 ieee dware\ndware ieee dware\ngtech ieee gtech\nramlib std ieee\nstd_cell_lib ieee std_cell_lib\nsynopsys\n\"@\n#Convert to Object[]\n$c = switch ( $a.split([char] 10) ) {\n $_ {\n $b=$_.split(' ')\n New-Object PSObject -Property @{\n Library = $b[0]\n \"Library Dependencies\" = @( $( $b[1..($b.length-1)] | Where-Object { $_ -match '\\w' } ) )\n }\n }\n}\n#Add pure dependencies\n$c | ForEach-Object {\n $_.\"Library Dependencies\" | Where-Object {\n $d=$_\n $(:andl foreach($i in $c) {\n if($d -match $i.Library) {\n $false\n break andl\n }\n }) -eq $null\n } | ForEach-Object {\n $c+=New-Object PSObject -Property @{\n Library=$_\n \"Library Dependencies\"=@()\n }\n }\n}\n#Associate with a dependency value\n##Initial Dependency Value\n$d = $c | Sort Library | Select-Object Library,\"Library Dependencies\",@{\n Name=\"Dep Value\"\n Expression={\n 1\n }\n}\n##Modify Dependency Value, perform check for incorrect dependency\n##Dep Value is determined by a parent child relationship, if a library is a parent, all libraries dependant on it are children\nfor( $i=0; $i -lt $d.count; $i++ ) {\n $errmsg=\"\"\n foreach( $j in ( 0..( $d.count - 1 ) | Where-Object { $_ -ne $i } ) ) {\n #Foreach other Child Library where this is a dependency, increase the Dep Value of the Child\n if( $( :orl foreach( $k in $d[$j].\"Library Dependencies\" ) {\n if( $k -match $d[$i].Library ) {\n foreach( $n in $d[$i].\"Library Dependencies\" ) {\n if( $n -match $d[$j].Library ) {\n $errmsg=\"Error Cyclic Dependency {0}<->{1}\" -f $d[$i].Library, $d[$j].Library\n break\n }\n }\n $true\n break orl\n }\n } ) ) {\n #If the child has already been processed, increase the Dep Value of its children\n if( $j -lt $i ) {\n foreach( $l in ( 0..( $d.count - 1 ) | Where-Object { $_ -ne $j } ) ) {\n if( $( :orl2 foreach( $m in $d[$l].\"Library Dependencies\" ) {\n if( $m -match $d[$j].Library ) {\n $true\n break orl2\n }\n } ) ) {\n $d[$l].\"Dep Value\"+=$d[$i].\"Dep Value\"\n }\n }\n }\n $d[$j].\"Dep Value\"+=$d[$i].\"Dep Value\"\n }\n if( $errmsg -ne \"\" ) {\n $errmsg\n $d=$null\n break\n }\n }\n}\n#Sort and Display\nif( $d ) {\n $d | Sort \"Dep Value\",Library | ForEach-Object {\n \"{0,-14} LIBRARY DEPENDENCIES`n{1,-14} ====================\" -f \"LIBRARY\", \"=======\"\n } {\n \"{0,-14} $($_.\"Library Dependencies\")\" -f $_.Library\n }\n}\n","language":"PowerShell"},{"code":"#EndOfDataMarker$ = \"::EndOfData::\"\nDataSection\n ;\"LIBRARY: [LIBRARY_DEPENDENCY_1 LIBRARY_DEPENDENCY_2 ... LIBRARY_DEPENDENCY_N]\n Data.s \"des_system_lib: [std synopsys std_cell_lib des_system_lib dw02 dw01 ramlib ieee]\"\n Data.s \"dw01: [ieee dw01 dware gtech]\"\n ;Data.s \"dw01: [ieee dw01 dware gtech dw04]\" ;comment the previous line and uncomment this one for cyclic dependency\n Data.s \"dw02: [ieee dw02 dware]\"\n Data.s \"dw03: [std synopsys dware dw03 dw02 dw01 ieee gtech]\"\n Data.s \"dw04: [dw04 ieee dw01 dware gtech]\"\n Data.s \"dw05: [dw05 ieee dware]\"\n Data.s \"dw06: [dw06 ieee dware]\"\n Data.s \"dw07: [ieee dware]\"\n Data.s \"dware: [ieee dware]\"\n Data.s \"gtech: [ieee gtech]\"\n Data.s \"ramlib: [std ieee]\"\n Data.s \"std_cell_lib: [ieee std_cell_lib]\"\n Data.s \"synopsys: nil\"\n Data.s #EndOfDataMarker$\nEndDataSection\n\nStructure DAG_node\n Value.s\n forRemoval.i ;flag marks elements that should be removed the next time they are accessed\n List dependencies.s()\nEndStructure\n\nIf Not OpenConsole()\n MessageRequester(\"Error\",\"Unable to open console\")\n End\nEndIf\n\n;// initialize Directed Acyclic Graph //\nDefine i, itemData.s, firstBracketPos\nNewList DAG.DAG_node()\nRepeat\n Read.s itemData\n itemData = Trim(itemData)\n If itemData <> #EndOfDataMarker$\n AddElement(DAG())\n ;add library\n DAG()\\Value = Trim(Left(itemData, FindString(itemData, \":\", 1) - 1))\n ;parse library dependencies\n firstBracketPos = FindString(itemData, \"[\", 1)\n If firstBracketPos\n itemData = Trim(Mid(itemData, firstBracketPos + 1, FindString(itemData, \"]\", 1) - firstBracketPos - 1))\n For i = (CountString(itemData, \" \") + 1) To 1 Step -1\n AddElement(DAG()\\dependencies())\n DAG()\\dependencies() = StringField(itemData, i, \" \")\n Next\n EndIf\n EndIf\nUntil itemData = #EndOfDataMarker$\n\n;// process DAG //\n;create DAG entry for nodes listed in dependencies but without their own entry\nNewMap libraries()\nForEach DAG()\n ForEach DAG()\\dependencies()\n libraries(DAG()\\dependencies()) = #True\n If DAG()\\dependencies() = DAG()\\Value\n DeleteElement(DAG()\\dependencies()) ;remove self-dependencies\n EndIf\n Next\nNext\n\nForEach DAG()\n If FindMapElement(libraries(),DAG()\\Value)\n DeleteMapElement(libraries(),DAG()\\Value)\n EndIf\nNext\n\nResetList(DAG())\nForEach libraries()\n AddElement(DAG())\n DAG()\\Value = MapKey(libraries())\nNext\nClearMap(libraries())\n\n;process DAG() repeatedly until no changes occur\nNewList compileOrder.s()\nRepeat\n noChangesMade = #True\n ForEach DAG()\n If DAG()\\forRemoval\n DeleteElement(DAG())\n Else\n ;remove dependencies that have been placed in the compileOrder\n ForEach DAG()\\dependencies()\n If FindMapElement(libraries(),DAG()\\dependencies())\n DeleteElement(DAG()\\dependencies())\n EndIf\n Next\n ;add DAG() entry to compileOrder if it has no more dependencies\n If ListSize(DAG()\\dependencies()) = 0\n AddElement(compileOrder())\n compileOrder() = DAG()\\Value\n libraries(DAG()\\Value) = #True ;mark the library for removal as a dependency\n DAG()\\forRemoval = #True\n noChangesMade = #False\n EndIf\n EndIf\n Next\nUntil noChangesMade\n\nIf ListSize(DAG())\n PrintN(\"Cyclic dependencies detected in:\" + #CRLF$)\n ForEach DAG()\n PrintN(\" \" + DAG()\\Value)\n Next\nElse\n PrintN(\"Compile order:\" + #CRLF$)\n ForEach compileOrder()\n PrintN(\" \" + compileOrder())\n Next\nEndIf\n\nPrint(#CRLF$ + #CRLF$ + \"Press ENTER to exit\")\nInput()\nCloseConsole()\n","language":"PureBasic"},{"code":"try:\n from functools import reduce\nexcept:\n pass\n\ndata = {\n 'des_system_lib': set('std synopsys std_cell_lib des_system_lib dw02 dw01 ramlib ieee'.split()),\n 'dw01': set('ieee dw01 dware gtech'.split()),\n 'dw02': set('ieee dw02 dware'.split()),\n 'dw03': set('std synopsys dware dw03 dw02 dw01 ieee gtech'.split()),\n 'dw04': set('dw04 ieee dw01 dware gtech'.split()),\n 'dw05': set('dw05 ieee dware'.split()),\n 'dw06': set('dw06 ieee dware'.split()),\n 'dw07': set('ieee dware'.split()),\n 'dware': set('ieee dware'.split()),\n 'gtech': set('ieee gtech'.split()),\n 'ramlib': set('std ieee'.split()),\n 'std_cell_lib': set('ieee std_cell_lib'.split()),\n 'synopsys': set(),\n }\n\ndef toposort2(data):\n for k, v in data.items():\n v.discard(k) # Ignore self dependencies\n extra_items_in_deps = reduce(set.union, data.values()) - set(data.keys())\n data.update({item:set() for item in extra_items_in_deps})\n while True:\n ordered = set(item for item,dep in data.items() if not dep)\n if not ordered:\n break\n yield ' '.join(sorted(ordered))\n data = {item: (dep - ordered) for item,dep in data.items()\n if item not in ordered}\n assert not data, \"A cyclic dependency exists amongst %r\" % data\n\nprint ('\\n'.join( toposort2(data) ))\n","language":"Python"},{"code":"from graphlib import TopologicalSorter\n\n# LIBRARY mapped_to LIBRARY DEPENDENCIES\ndata = {\n 'des_system_lib': set('std synopsys std_cell_lib des_system_lib dw02 dw01 ramlib ieee'.split()),\n 'dw01': set('ieee dw01 dware gtech'.split()),\n 'dw02': set('ieee dw02 dware'.split()),\n 'dw03': set('std synopsys dware dw03 dw02 dw01 ieee gtech'.split()),\n 'dw04': set('dw04 ieee dw01 dware gtech'.split()),\n 'dw05': set('dw05 ieee dware'.split()),\n 'dw06': set('dw06 ieee dware'.split()),\n 'dw07': set('ieee dware'.split()),\n 'dware': set('ieee dware'.split()),\n 'gtech': set('ieee gtech'.split()),\n 'ramlib': set('std ieee'.split()),\n 'std_cell_lib': set('ieee std_cell_lib'.split()),\n 'synopsys': set(),\n }\n# Ignore self dependencies\nfor k, v in data.items():\n v.discard(k)\n\nts = TopologicalSorter(data)\nprint(tuple(ts.static_order()))\n","language":"Python"},{"code":"deps <- list(\n\"des_system_lib\" = c(\"std\", \"synopsys\", \"std_cell_lib\", \"des_system_lib\", \"dw02\", \"dw01\", \"ramlib\", \"ieee\"),\n\"dw01\" = c(\"ieee\", \"dw01\", \"dware\", \"gtech\", \"dw04\"),\n\"dw02\" = c(\"ieee\", \"dw02\", \"dware\"),\n\"dw03\" = c(\"std\", \"synopsys\", \"dware\", \"dw03\", \"dw02\", \"dw01\", \"ieee\", \"gtech\"),\n\"dw04\" = c(\"dw04\", \"ieee\", \"dw01\", \"dware\", \"gtech\"),\n\"dw05\" = c(\"dw05\", \"ieee\", \"dware\"),\n\"dw06\" = c(\"dw06\", \"ieee\", \"dware\"),\n\"dw07\" = c(\"ieee\", \"dware\"),\n\"dware\" = c(\"ieee\", \"dware\"),\n\"gtech\" = c(\"ieee\", \"gtech\"),\n\"ramlib\" = c(\"std\", \"ieee\"),\n\"std_cell_lib\" = c(\"ieee\", \"std_cell_lib\"),\n\"synopsys\" = c())\n","language":"R"},{"code":"tsort <- function(deps) {\n\tnm <- names(deps)\n\tlibs <- union(as.vector(unlist(deps)), nm)\n\t\n\ts <- c()\n\t# first libs that depend on nothing\n\tfor(x in libs) {\n\t\tif(!(x %in% nm)) {\n\t\t\ts <- c(s, x)\n\t\t}\n\t}\n\t\n\tk <- 1\n\twhile(k > 0) {\n\t\tk <- 0\n\t\tfor(x in setdiff(nm, s)) {\n\t\t\tr <- c(s, x)\n\t\t\tif(length(setdiff(deps[[x]], r)) == 0) {\n\t\t\t\ts <- r\n\t\t\t\tk <- 1\n\t\t\t}\n\t\t}\n\t}\n\t\n\tif(length(s) < length(libs)) {\n\t\tv <- setdiff(libs, s)\n\t\tstop(sprintf(\"Unorderable items :\\n%s\", paste(\"\", v, sep=\"\", collapse=\"\\n\")))\n\t}\n\t\n\ts\n}\n","language":"R"},{"code":"tsort(deps)\n# [1] \"std\" \"ieee\" \"dware\" \"gtech\" \"ramlib\"\n# [6] \"std_cell_lib\" \"synopsys\" \"dw01\" \"dw02\" \"dw03\"\n#[11] \"dw04\" \"dw05\" \"dw06\" \"dw07\" \"des_system_lib\"\n","language":"R"},{"code":"Unorderable items :\ndes_system_lib\ndw01\ndw04\ndw03\n","language":"R"},{"code":"#lang racket\n\n(define G\n (make-hash\n '((des_system_lib . (std synopsys std_cell_lib des_system_lib dw02\n dw01 ramlib ieee))\n (dw01 . (ieee dw01 dware gtech))\n (dw02 . (ieee dw02 dware))\n (dw03 . (std synopsys dware dw03 dw02 dw01 ieee gtech))\n (dw04 . (dw04 ieee dw01 dware gtech))\n (dw05 . (dw05 ieee dware))\n (dw06 . (dw06 ieee dware))\n (dw07 . (ieee dware))\n (dware . (ieee dware))\n (gtech . (ieee gtech))\n (ramlib . (std ieee))\n (std_cell_lib . (ieee std_cell_lib))\n (synopsys . ()))))\n\n(define (clean G)\n (define G* (hash-copy G))\n (for ([(from tos) G])\n ; remove self dependencies\n (hash-set! G* from (remove from tos))\n ; make sure all nodes are present in the ht\n (for ([to tos]) (hash-update! G* to (λ(_)_) '())))\n G*)\n\n(define (incoming G)\n (define in (make-hash))\n (for* ([(from tos) G] [to tos])\n (hash-update! in to (λ(fs) (cons from fs)) '()))\n in)\n\n(define (nodes G) (hash-keys G))\n(define (out G n) (hash-ref G n '()))\n(define (remove! G n m) (hash-set! G n (remove m (out G n))))\n\n(define (topo-sort G)\n (define n (length (nodes G)))\n (define in (incoming G))\n (define (no-incoming? n) (empty? (hash-ref in n '())))\n (let loop ([L '()] [S (list->set (filter no-incoming? (nodes G)))])\n (cond [(set-empty? S)\n (if (= (length L) n)\n L\n (error 'topo-sort (~a \"cycle detected\" G)))]\n [else\n (define n (set-first S))\n (define S\\n (set-rest S))\n (for ([m (out G n)])\n (remove! G n m)\n (remove! in m n)\n (when (no-incoming? m)\n (set! S\\n (set-add S\\n m))))\n (loop (cons n L) S\\n)])))\n\n(topo-sort (clean G))\n","language":"Racket"},{"code":"'(synopsys ieee dware gtech std_cell_lib std ramlib dw07 dw06 dw05 dw01 dw04 dw02 dw03 des_system_lib)\n","language":"Racket"},{"code":"sub print_topo_sort ( %deps ) {\n my %ba;\n for %deps.kv -> $before, @afters {\n for @afters -> $after {\n %ba{$before}{$after} = 1 if $before ne $after;\n %ba{$after} //= {};\n }\n }\n\n while %ba.grep( not *.value )».key -> @afters {\n say ~@afters.sort;\n %ba{@afters}:delete;\n for %ba.values { .{@afters}:delete }\n }\n\n say %ba ?? \"Cycle found! {%ba.keys.sort}\" !! '---';\n}\n\nmy %deps =\n des_system_lib => < std synopsys std_cell_lib des_system_lib dw02\n dw01 ramlib ieee >,\n dw01 => < ieee dw01 dware gtech >,\n dw02 => < ieee dw02 dware >,\n dw03 => < std synopsys dware dw03 dw02 dw01 ieee gtech >,\n dw04 => < dw04 ieee dw01 dware gtech >,\n dw05 => < dw05 ieee dware >,\n dw06 => < dw06 ieee dware >,\n dw07 => < ieee dware >,\n dware => < ieee dware >,\n gtech => < ieee gtech >,\n ramlib => < std ieee >,\n std_cell_lib => < ieee std_cell_lib >,\n synopsys => < >;\n\nprint_topo_sort(%deps);\n%deps<dw01> = <ieee dw01 dware gtech dw04>; # Add unresolvable dependency\nprint_topo_sort(%deps);\n","language":"Raku"},{"code":"/*REXX pgm does a topological sort (orders such that no item precedes a dependent item).*/\niDep.= 0; iPos.= 0; iOrd.= 0 /*initialize some stemmed arrays to 0.*/\n nL= 15; nd= 44; nc= 69 /* \" \" \"parms\" and indices.*/\nlabel= 'DES_SYSTEM_LIB DW01 DW02 DW03 DW04 DW05 DW06 DW07' ,\n 'DWARE GTECH RAMLIB STD_CELL_LIB SYNOPSYS STD IEEE'\niCode= 1 14 13 12 1 3 2 11 15 0 2 15 2 9 10 0 3 15 3 9 0 4 14 213 9 4 3 2 15 10 0 5 5 15 ,\n 2 9 10 0 6 6 15 9 0 7 7 15 9 0 8 15 9 0 39 15 9 0 10 15 10 0 11 14 15 0 12 15 12 0 0\nj= 0\n do i=1\n iL= word(iCode, i); if iL==0 then leave\n do forever; i= i+1\n iR= word(iCode, i); if iR==0 then leave\n j= j+1; iDep.j.1= iL\n iDep.j.2= iR\n end /*forever*/\n end /*i*/\ncall tSort\nsay '═══compile order═══'\n@= 'libraries found.)'\n#=0; do o=nO by -1 for nO; #= #+1; say word(label, iOrd.o)\n end /*o*/; if #==0 then #= 'no'\nsay ' ('# @; say\nsay '═══unordered libraries═══'\n#=0; do u=nO+1 to nL; #= #+1; say word(label, iOrd.u)\n end /*u*/; if #==0 then #= 'no'\nsay ' ('# \"unordered\" @\nexit /*stick a fork in it, we're all done. */\n/*──────────────────────────────────────────────────────────────────────────────────────*/\ntSort: procedure expose iDep. iOrd. iPos. nd nL nO\n do i=1 for nL; iOrd.i= i; iPos.i= i\n end /*i*/\n k= 1\n do until k<=j; j = k; k= nL+1\n do i=1 for nd; iL = iDep.i.1; iR= iPos.iL\n ipL= iPos.iL; ipR= iPos.iR\n if iL==iR | ipL>.k | ipL<j | ipR<j then iterate\n k= k-1\n _= iOrd.k; iPos._ = ipL\n iPos.iL= k\n iOrd.ipL= iOrd.k; iOrd.k = iL\n end /*i*/\n end /*until*/\n nO= j-1; return\n","language":"REXX"},{"code":"require 'tsort'\nclass Hash\n include TSort\n alias tsort_each_node each_key\n def tsort_each_child(node, &block)\n fetch(node).each(&block)\n end\nend\n\ndepends = {}\nDATA.each do |line|\n key, *libs = line.split\n depends[key] = libs\n libs.each {|lib| depends[lib] ||= []}\nend\n\nbegin\n p depends.tsort\n depends[\"dw01\"] << \"dw04\"\n p depends.tsort\nrescue TSort::Cyclic => e\n puts \"\\ncycle detected: #{e}\"\nend\n\n__END__\ndes_system_lib std synopsys std_cell_lib des_system_lib dw02 dw01 ramlib ieee\ndw01 ieee dw01 dware gtech\ndw02 ieee dw02 dware\ndw03 std synopsys dware dw03 dw02 dw01 ieee gtech\ndw04 dw04 ieee dw01 dware gtech\ndw05 dw05 ieee dware\ndw06 dw06 ieee dware\ndw07 ieee dware\ndware ieee dware\ngtech ieee gtech\nramlib std ieee\nstd_cell_lib ieee std_cell_lib\nsynopsys\n","language":"Ruby"},{"code":"use std::boxed::Box;\nuse std::collections::{HashMap, HashSet};\n\n#[derive(Debug, PartialEq, Eq, Hash)]\nstruct Library<'a> {\n name: &'a str,\n children: Vec<&'a str>,\n num_parents: usize,\n}\n\nfn build_libraries(input: Vec<&str>) -> HashMap<&str, Box<Library>> {\n let mut libraries: HashMap<&str, Box<Library>> = HashMap::new();\n\n for input_line in input {\n let line_split = input_line.split_whitespace().collect::<Vec<&str>>();\n let name = line_split.get(0).unwrap();\n let mut num_parents: usize = 0;\n for parent in line_split.iter().skip(1) {\n if parent == name {\n continue;\n }\n if !libraries.contains_key(parent) {\n libraries.insert(\n parent,\n Box::new(Library {\n name: parent,\n children: vec![name],\n num_parents: 0,\n }),\n );\n } else {\n libraries.get_mut(parent).unwrap().children.push(name);\n }\n num_parents += 1;\n }\n\n if !libraries.contains_key(name) {\n libraries.insert(\n name,\n Box::new(Library {\n name,\n children: Vec::new(),\n num_parents,\n }),\n );\n } else {\n libraries.get_mut(name).unwrap().num_parents = num_parents;\n }\n }\n libraries\n}\n\nfn topological_sort<'a>(\n mut libraries: HashMap<&'a str, Box<Library<'a>>>,\n) -> Result<Vec<&'a str>, String> {\n let mut needs_processing = libraries\n .iter()\n .map(|(k, _v)| k.clone())\n .collect::<HashSet<&str>>();\n let mut options: Vec<&str> = libraries\n .iter()\n .filter(|(_k, v)| v.num_parents == 0)\n .map(|(k, _v)| *k)\n .collect();\n let mut sorted: Vec<&str> = Vec::new();\n while !options.is_empty() {\n let cur = options.pop().unwrap();\n for children in libraries\n .get_mut(cur)\n .unwrap()\n .children\n .drain(0..)\n .collect::<Vec<&str>>()\n {\n let child = libraries.get_mut(children).unwrap();\n child.num_parents -= 1;\n if child.num_parents == 0 {\n options.push(child.name)\n }\n }\n sorted.push(cur);\n needs_processing.remove(cur);\n }\n match needs_processing.is_empty() {\n true => Ok(sorted),\n false => Err(format!(\"Cycle detected among {:?}\", needs_processing)),\n }\n}\n\nfn main() {\n let input: Vec<&str> = vec![\n \"des_system_lib std synopsys std_cell_lib des_system_lib dw02 dw01 ramlib ieee\\n\",\n \"dw01 ieee dw01 dware gtech dw04\\n\",\n \"dw02 ieee dw02 dware\\n\",\n \"dw03 std synopsys dware dw03 dw02 dw01 ieee gtech\\n\",\n \"dw04 dw04 ieee dw01 dware gtech\\n\",\n \"dw05 dw05 ieee dware\\n\",\n \"dw06 dw06 ieee dware\\n\",\n \"dw07 ieee dware\\n\",\n \"dware ieee dware\\n\",\n \"gtech ieee gtech\\n\",\n \"ramlib std ieee\\n\",\n \"std_cell_lib ieee std_cell_lib\\n\",\n \"synopsys\\n\",\n ];\n\n let libraries = build_libraries(input);\n match topological_sort(libraries) {\n Ok(sorted) => println!(\"{:?}\", sorted),\n Err(msg) => println!(\"{:?}\", msg),\n }\n}\n","language":"Rust"},{"code":"(import (chezscheme))\n(import (srfi srfi-1))\n\n\n(define (remove-self-dependency pair)\n (let ((key (car pair))\n (value (cdr pair)))\n (cons key (remq key value))))w\n\n(define (remove-self-dependencies alist)\n (map remove-self-dependency alist))\n\n(define (add-missing-items dependencies)\n (let loop ((items (delete-duplicates (append-map cdr dependencies) eq?))\n (out dependencies))\n (if (null? items)\n out\n (let ((item (car items)))\n (if (assq item out)\n (loop (cdr items) out)\n (loop (cdr items) (cons (cons item '()) out)))))))\n\n(define (lift dependencies batch)\n (let loop ((dependencies dependencies)\n (out '()))\n (if (null? dependencies)\n out\n (let ((key (caar dependencies))\n (value (cdar dependencies)))\n (if (null? value)\n (loop (cdr dependencies) out)\n (loop (cdr dependencies)\n (cons (cons key (lset-difference eq? value batch))\n out)))))))\n\n(define (topological-sort dependencies)\n (let* ((dependencies (remove-self-dependencies dependencies))\n (dependencies (add-missing-items dependencies)))\n (let loop ((out '())\n (dependencies dependencies))\n (if (null? dependencies)\n (reverse out)\n (let ((batch (map car (filter (lambda (pair) (null? (cdr pair))) dependencies))))\n (if (null? batch)\n #f\n (loop (cons batch out) (lift dependencies batch))))))))\n\n\n(define example\n '((des_system_lib . (std synopsys std_cell_lib des_system_lib dw02\n dw01 ramlib ieee))\n (dw01 . (ieee dw01 dware gtech))\n (dw02 . (ieee dw02 dware))\n (dw03 . (std synopsys dware dw03 dw02 dw01 ieee gtech))\n (dw04 . (dw04 ieee dw01 dware gtech))\n (dw05 . (dw05 ieee dware))\n (dw06 . (dw06 ieee dware))\n (dw07 . (ieee dware))\n (dware . (ieee dware))\n (gtech . (ieee gtech))\n (ramlib . (std ieee))\n (std_cell_lib . (ieee std_cell_lib))\n (synopsys . ())))\n\n(write (topological-sort example))\n\n\n(define unsortable\n '((des_system_lib . (std synopsys std_cell_lib des_system_lib dw02\n dw01 ramlib ieee))\n (dw01 . (ieee dw01 dware gtech dw04))\n (dw02 . (ieee dw02 dware))\n (dw03 . (std synopsys dware dw03 dw02 dw01 ieee gtech))\n (dw04 . (dw04 ieee dw01 dware gtech))\n (dw05 . (dw05 ieee dware))\n (dw06 . (dw06 ieee dware))\n (dw07 . (ieee dware))\n (dware . (ieee dware))\n (gtech . (ieee gtech))\n (ramlib . (std ieee))\n (std_cell_lib . (ieee std_cell_lib))\n (synopsys . ())))\n\n(newline)\n(write (topological-sort unsortable))\n","language":"Scheme"},{"code":"func print_topo_sort (deps) {\n var ba = Hash.new;\n deps.each { |before, afters|\n afters.each { |after|\n if (before != after) {\n ba{before}{after} = 1;\n };\n ba{after} \\\\= Hash.new;\n }\n };\n\n loop {\n var afters = ba.keys.grep {|k| ba{k}.values.len == 0 }.sort;\n afters.len || break;\n say afters.join(\" \");\n ba.delete(afters...);\n ba.values.each { |v| v.delete(afters...) };\n };\n\n say (ba.len ? \"Cicle found! #{ba.keys.sort}\" : \"---\");\n}\n\nvar deps = Hash.new(\n des_system_lib => < std synopsys std_cell_lib des_system_lib dw02\n dw01 ramlib ieee >,\n dw01 => < ieee dw01 dware gtech >,\n dw02 => < ieee dw02 dware >,\n dw03 => < std synopsys dware dw03 dw02 dw01 ieee gtech >,\n dw04 => < dw04 ieee dw01 dware gtech >,\n dw05 => < dw05 ieee dware >,\n dw06 => < dw06 ieee dware >,\n dw07 => < ieee dware >,\n dware => < ieee dware >,\n gtech => < ieee gtech >,\n ramlib => < std ieee >,\n std_cell_lib => < ieee std_cell_lib >,\n synopsys => < >\n);\n\nprint_topo_sort(deps);\ndeps{:dw01}.append('dw04'); # Add unresolvable dependency\nprint_topo_sort(deps);\n","language":"Sidef"},{"code":"let libs = [\n (\"des_system_lib\", [\"std\", \"synopsys\", \"std_cell_lib\", \"des_system_lib\", \"dw02\", \"dw01\", \"ramlib\", \"ieee\"]),\n (\"dw01\", [\"ieee\", \"dw01\", \"dware\", \"gtech\"]),\n (\"dw02\", [\"ieee\", \"dw02\", \"dware\"]),\n (\"dw03\", [\"std\", \"synopsys\", \"dware\", \"dw03\", \"dw02\", \"dw01\", \"ieee\", \"gtech\"]),\n (\"dw04\", [\"dw04\", \"ieee\", \"dw01\", \"dware\", \"gtech\"]),\n (\"dw05\", [\"dw05\", \"ieee\", \"dware\"]),\n (\"dw06\", [\"dw06\", \"ieee\", \"dware\"]),\n (\"dw07\", [\"ieee\", \"dware\"]),\n (\"dware\", [\"ieee\", \"dware\"]),\n (\"gtech\", [\"ieee\", \"gtech\"]),\n (\"ramlib\", [\"std\", \"ieee\"]),\n (\"std_cell_lib\", [\"ieee\", \"std_cell_lib\"]),\n (\"synopsys\", [])\n]\n\nstruct Library {\n var name: String\n var children: [String]\n var numParents: Int\n}\n\nfunc buildLibraries(_ input: [(String, [String])]) -> [String: Library] {\n var libraries = [String: Library]()\n\n for (name, parents) in input {\n var numParents = 0\n\n for parent in parents where parent != name {\n numParents += 1\n\n libraries[parent, default: Library(name: parent, children: [], numParents: 0)].children.append(name)\n }\n\n libraries[name, default: Library(name: name, children: [], numParents: numParents)].numParents = numParents\n }\n\n return libraries\n}\n\nfunc topologicalSort(libs: [String: Library]) -> [String]? {\n var libs = libs\n var needsProcessing = Set(libs.keys)\n var options = libs.compactMap({ $0.value.numParents == 0 ? $0.key : nil })\n var sorted = [String]()\n\n while let cur = options.popLast() {\n for children in libs[cur]?.children ?? [] {\n libs[children]?.numParents -= 1\n\n if libs[children]?.numParents == 0 {\n options.append(libs[children]!.name)\n }\n }\n\n libs[cur]?.children.removeAll()\n\n sorted.append(cur)\n needsProcessing.remove(cur)\n }\n\n guard needsProcessing.isEmpty else {\n return nil\n }\n\n return sorted\n}\n\nprint(topologicalSort(libs: buildLibraries(libs))!)\n","language":"Swift"},{"code":"data node <'.+'>, from <node>, to <node>\n\ntemplates topologicalSort\n @: [];\n {V: {|$.v..., $.e({node: §.to})...|} , E: {|$.e... -> \\(<{from: <~=$.to>}> $! \\)|}} -> #\n when <{V: <?($::count <=0>)>}> $@!\n otherwise\n def independent: ($.V notMatching $.E({node: §.from}));\n [$independent... -> $.node] -> ..|@: $;\n {V: ($.V notMatching $independent), E: ($.E notMatching $independent({to: §.node}))}\n -> \\(<?($independent::count <1..>)> $! \\) -> #\nend topologicalSort\n\ncomposer lines\n [<line>+]\n rule line: <'[^\\n]*'> (<'\\n'>)\nend lines\n\ntemplates collectDeps\n @: { v: [], e: []};\n composer depRecord\n (<WS>? def node: <~WS>; <WS>? <dep>* <WS>? $node -> ..|@collectDeps.v: {node: $};)\n rule dep: (<~WS> -> ..|@collectDeps.e: {from: node´$node, to: node´$}; <WS>?)\n end depRecord\n $(3..last)... -> !depRecord\n $@!\nend collectDeps\n\n'LIBRARY LIBRARY DEPENDENCIES\n ======= ====================\n des_system_lib std synopsys std_cell_lib des_system_lib dw02 dw01 ramlib ieee\n dw01 ieee dw01 dware gtech\n dw02 ieee dw02 dware\n dw03 std synopsys dware dw03 dw02 dw01 ieee gtech\n dw04 dw04 ieee dw01 dware gtech\n dw05 dw05 ieee dware\n dw06 dw06 ieee dware\n dw07 ieee dware\n dware ieee dware\n gtech ieee gtech\n ramlib std ieee\n std_cell_lib ieee std_cell_lib\n synopsys\n' -> lines -> collectDeps -> topologicalSort -> !OUT::write\n","language":"Tailspin"},{"code":"package require Tcl 8.5\nproc topsort {data} {\n # Clean the data\n dict for {node depends} $data {\n\tif {[set i [lsearch -exact $depends $node]] >= 0} {\n\t set depends [lreplace $depends $i $i]\n\t dict set data $node $depends\n\t}\n\tforeach node $depends {dict lappend data $node}\n }\n # Do the sort\n set sorted {}\n while 1 {\n\t# Find available nodes\n\tset avail [dict keys [dict filter $data value {}]]\n\tif {![llength $avail]} {\n\t if {[dict size $data]} {\n\t\terror \"graph is cyclic, possibly involving nodes \\\"[dict keys $data]\\\"\"\n\t }\n\t return $sorted\n\t}\n\t# Note that the lsort is only necessary for making the results more like other langs\n\tlappend sorted {*}[lsort $avail]\n # Remove from working copy of graph\n\tdict for {node depends} $data {\n\t foreach n $avail {\n\t\tif {[set i [lsearch -exact $depends $n]] >= 0} {\n\t\t set depends [lreplace $depends $i $i]\n\t\t dict set data $node $depends\n\t\t}\n\t }\n\t}\n\tforeach node $avail {\n\t dict unset data $node\n\t}\n }\n}\n","language":"Tcl"},{"code":"set inputData {\n des_system_lib\tstd synopsys std_cell_lib des_system_lib dw02 dw01 ramlib ieee\n dw01\t\tieee dw01 dware gtech\n dw02\t\tieee dw02 dware\n dw03\t\tstd synopsys dware dw03 dw02 dw01 ieee gtech\n dw04\t\tdw04 ieee dw01 dware gtech\n dw05\t\tdw05 ieee dware\n dw06\t\tdw06 ieee dware\n dw07\t\tieee dware\n dware\t\tieee dware\n gtech\t\tieee gtech\n ramlib\t\tstd ieee\n std_cell_lib\tieee std_cell_lib\n synopsys\n}\nforeach line [split $inputData \\n] {\n if {[string trim $line] eq \"\"} continue\n dict set parsedData [lindex $line 0] [lrange $line 1 end]\n}\nputs [topsort $parsedData]\n","language":"Tcl"},{"code":"record graph(nodes,arcs)\n\nprocedure main()\n show(tsort(getgraph()))\nend\n\nprocedure tsort(g)\n t := []\n while *(n := g.nodes -- pnodes(g)) > 0 do {\n every put(p := [], !n)\n put(t, p)\n g := delete(g,n)\n }\n if *g.nodes = 0 then return t\n write(\"graph contains the cycle:\")\n write(\"\\t\",genpath(fn := !g.nodes,fn,g))\nend\n\nprocedure pnodes(g)\n cp := create !g.arcs\n every insert(p := set(), |1(@cp,@cp))\n return p\nend\n\nprocedure delete(g,x)\n arcs := []\n cp := create !g.arcs\n while (f := @cp, t := @cp) do {\n if !x == (f|t) then next\n every put(arcs,f|t)\n }\n return graph(g.nodes--x, arcs)\nend\n\nprocedure getgraph()\n arcs := []\n nodes := set()\n every line := !&input do {\n nextWord := create genWords(line)\n if nfrom := @nextWord then {\n insert(nodes, nfrom)\n while nto := @nextWord do {\n if nfrom ~== nto then {\n insert(nodes, nto)\n every put(arcs, nfrom | nto)\n }\n }\n }\n }\n return graph(nodes,arcs)\nend\n\nprocedure genWords(s)\n static wchars\n initial wchars := &cset -- ' \\t'\n s ? while tab(upto(wchars))\\1 do suspend tab(many(wchars))\\1\nend\n\nprocedure show(t)\n line := \"\"\n every n := !t do\n case type(n) of {\n \"list\" : line ||:= \"\\n\\t(\"||toString(n)||\")\"\n default : line ||:= \" \"||n\n }\n write(line)\nend\n\nprocedure toString(n)\n every (s := \"\") ||:= !n || \" \"\n return s[1:-1] | s\nend\n\nprocedure genpath(f,t,g, seen)\n /seen := set()\n insert(seen, f)\n sn := nnodes(f,g)\n if member(sn, t) then return f || \" -> \" || t\n suspend f || \" -> \" || genpath(!(sn--seen),t,g,seen)\nend\n\nprocedure nnodes(f,g)\n t := set()\n cp := create !g.arcs\n while (af := @cp, at := @cp) do if af == f then insert(t, at)\n return t\nend\n","language":"Unicon"},{"code":"$ awk '{ for (i = 1; i <= NF; i++) print $i, $1 }' <<! | tsort\n> des_system_lib std synopsys std_cell_lib des_system_lib dw02 dw01 ramlib ieee\n> dw01 ieee dw01 dware gtech\n> dw02 ieee dw02 dware\n> dw03 std synopsys dware dw03 dw02 dw01 ieee gtech\n> dw04 dw04 ieee dw01 dware gtech\n> dw05 dw05 ieee dware\n> dw06 dw06 ieee dware\n> dw07 ieee dware\n> dware ieee dware\n> gtech ieee gtech\n> ramlib std ieee\n> std_cell_lib ieee std_cell_lib\n> synopsys\n> !\nieee\ndware\ndw02\ndw05\ndw06\ndw07\ngtech\ndw01\ndw04\nstd_cell_lib\nsynopsys\nstd\ndw03\nramlib\ndes_system_lib\n","language":"UNIX-Shell"},{"code":"tsort = ~&nmnNCjA*imSLs2nSjiNCSPT; @NiX ^=lxPrnSPX ^(~&rlPlT,~&rnPrmPljA*D@r)^|/~& ~&m!=rnSPlX\n","language":"Ursala"},{"code":"#import std\n\ndependence_table = -[\n\nLIBRARY LIBRARY DEPENDENCIES\n======= ====================\ndes_system_lib std synopsys std_cell_lib des_system_lib dw02 dw01 ramlib ieee\ndw01 ieee dw01 dware gtech\ndw02 ieee dw02 dware\ndw03 std synopsys dware dw03 dw02 dw01 ieee gtech\ndw04 dw04 ieee dw01 dware gtech\ndw05 dw05 ieee dware\ndw06 dw06 ieee dware\ndw07 ieee dware\ndware ieee dware\ngtech ieee gtech\nramlib std ieee\nstd_cell_lib ieee std_cell_lib\nsynopsys ]-\n\nparse = ~&htA*FS+ sep` *tttt\n\n#show+\n\nmain = <.~&l,@r ~&i&& 'unorderable: '--> mat` ~~ tsort parse dependence_table\n","language":"Ursala"},{"code":"class topological\n\tdim dictDependencies\n\tdim dictReported\n\tdim depth\n\t\n\tsub class_initialize\n\t\tset dictDependencies = createobject(\"Scripting.Dictionary\")\n\t\tset dictReported = createobject(\"Scripting.Dictionary\")\n\t\tdepth = 0\n\tend sub\n\t\n\tsub reset\n\t\tdictReported.removeall\n\tend sub\n\t\n\tproperty let dependencies( s )\n\t\t'assuming token tab token-list newline\n\t\tdim i, j ,k\n\t\tdim aList\n\t\tdim dep\n\t\tdim a1\n\t\taList = Split( s, vbNewLine )\n\t\t'~ remove empty lines at end\n\t\tdo while aList( UBound( aList ) ) = vbnullstring\n\t\t\tredim preserve aList( UBound( aList ) - 1 )\n\t\tloop\n\n\t\tfor i = lbound( aList ) to ubound( aList )\n\t\t\taList( i ) = Split( aList( i ), vbTab, 2 )\n\t\t\ta1 = Split( aList( i )( 1 ), \" \" )\n\t\t\tk = 0\n\t\t\tfor j = lbound( a1) to ubound(a1)\n\t\t\t\tif a1(j) <> aList(i)(0) then\n\t\t\t\t\ta1(k) = a1(j)\n\t\t\t\t\tk = k + 1\n\t\t\t\tend if\n\t\t\tnext\n\t\t\tredim preserve a1(k-1)\n\t\t\taList(i)(1) = a1\n\t\tnext\n\t\tfor i = lbound( aList ) to ubound( aList )\n\t\t\tdep = aList(i)(0)\n\t\t\tif not dictDependencies.Exists( dep ) then\n\t\t\t\tdictDependencies.add dep, aList(i)(1)\n\t\t\tend if\n\t\tnext\n\t\t\n\tend property\n\t\n\tsub resolve( s )\n\t\tdim i\n\t\tdim deps\n\t\t'~ wscript.echo string(depth,\"!\"),s\n\t\tdepth = depth + 1\n\t\tif dictDependencies.Exists(s) then\n\t\t\tdeps = dictDependencies(s)\n\t\t\tfor i = lbound(deps) to ubound(deps)\n\t\t\t\tresolve deps(i)\n\t\t\tnext\n\t\tend if\n\t\tif not seen(s) then\n\t\t\twscript.echo s\n\t\t\tsee s\n\t\tend if\n\t\tdepth = depth - 1\n\tend sub\n\n\tfunction seen( key )\n\t\tseen = dictReported.Exists( key )\n\tend function\n\t\n\tsub see( key )\n\t\tdictReported.add key, \"\"\n\tend sub\n\t\n\tproperty get keys\n\t\tkeys = dictDependencies.keys\n\tend property\nend class\n","language":"VBScript"},{"code":"dim toposort\nset toposort = new topological\ntoposort.dependencies = \"des_system_lib\tstd synopsys std_cell_lib des_system_lib dw02 dw01 ramlib ieee\" & vbNewLine & _\n\t\"dw01\tieee dw01 dware gtech\" & vbNewLine & _\n\t\"dw02\tieee dw02 dware\" & vbNewLine & _\n\t\"dw03\tstd synopsys dware dw03 dw02 dw01 ieee gtech\" & vbNewLine & _\n\t\"dw04\tdw04 ieee dw01 dware gtech\" & vbNewLine & _\n\t\"dw05\tdw05 ieee dware\" & vbNewLine & _\n\t\"dw06\tdw06 ieee dware\" & vbNewLine & _\n\t\"dw07\tieee dware\" & vbNewLine & _\n\t\"dware\tieee dware\" & vbNewLine & _\n\t\"gtech\tieee gtech\" & vbNewLine & _\n\t\"ramlib\tstd ieee\" & vbNewLine & _\n\t\"std_cell_lib\tieee std_cell_lib\" & vbNewLine & _\n\t\"synopsys\t\"\n\ndim k\nfor each k in toposort.keys\n\twscript.echo \"----- \" & k\n\ttoposort.resolve k\n\twscript.echo \"-----\"\n\ttoposort.reset\nnext\n","language":"VBScript"},{"code":"' Adapted from:\n' http://tawani.blogspot.com/2009/02/topological-sorting-and-cyclic.html\n' added/changed:\n' - conversion to VB.Net (.Net 2 framework)\n' - added Rosetta Code dependency format parsing\n' - check & removal of self-dependencies before sorting\nModule Program\n\tSub Main()\n\t\tDim Fields As New List(Of Field)()\n\t\t' You can also add Dependson using code like:\n\t\t' .DependsOn = New String() {\"ieee\", \"dw01\", \"dware\"} _\n\n\t\tfields.Add(New Field() With { _\n\t\t\t.Name = \"des_system_lib\", _\n\t\t\t.DependsOn = Split(\"std synopsys std_cell_lib des_system_lib dw02 dw01 ramlib ieee\", \" \") _\n\t\t})\n\t\tfields.Add(New Field() With { _\n\t\t\t.Name = \"dw01\", _\n\t\t\t.DependsOn = Split(\"ieee dw01 dware gtech\", \" \") _\n\t\t})\n\t\tfields.Add(New Field() With { _\n\t\t\t.Name = \"dw02\", _\n\t\t\t.DependsOn = Split(\"ieee dw02 dware\", \" \") _\n\t\t})\n\t\tfields.Add(New Field() With { _\n\t\t\t.Name = \"dw03\", _\n\t\t\t.DependsOn = Split(\"std synopsys dware dw03 dw02 dw01 ieee gtech\", \" \") _\t\t\t\n\t\t})\n\t\tfields.Add(New Field() With { _\n\t\t\t.Name = \"dw04\", _\n\t\t\t.DependsOn = Split(\"dw04 ieee dw01 dware gtech\", \" \") _\t\t\t\n\t\t})\n\t\tfields.Add(New Field() With { _\n\t\t\t.Name = \"dw05\", _\n\t\t\t.DependsOn = Split(\"dw05 ieee dware\", \" \") _\n\t\t})\n\t\tfields.Add(New Field() With { _\n\t\t\t.Name = \"dw06\", _\n\t\t\t.DependsOn = Split(\"dw06 ieee dware\", \" \") _\t\t\t\n\t\t})\n\t\tfields.Add(New Field() With { _\n\t\t\t.Name = \"dw07\", _\n\t\t\t.DependsOn = Split(\"ieee dware\", \" \") _\t\t\t\n\t\t})\n\t\tfields.Add(New Field() With { _\n\t\t\t.Name = \"dware\", _\n\t\t\t.DependsOn = Split(\"ieee dware\", \" \") _\n\t\t})\n\t\tfields.Add(New Field() With { _\n\t\t\t.Name = \"gtech\", _\n\t\t\t.DependsOn = Split(\"ieee gtech\", \" \") _\t\t\t\n\t\t})\n\t\tfields.Add(New Field() With { _\n\t\t\t.Name = \"ramlib\", _\n\t\t\t.DependsOn = Split(\"std ieee\", \" \") _\t\t\t\n\t\t})\n\t\tfields.Add(New Field() With { _\n\t\t\t.Name = \"std_cell_lib\", _\n\t\t\t.DependsOn = Split(\"ieee std_cell_lib\", \" \") _\t\t\t\n\t\t})\n\t\tfields.Add(New Field() With { _\n\t\t\t.Name = \"synopsys\" _\n\t\t})\t\t\n\t\tConsole.WriteLine(\"Input:\")\n\t\tFor Each ThisField As field In fields\n\t\t\tConsole.WriteLine(ThisField.Name)\n\t\t\tIf ThisField.DependsOn IsNot Nothing Then\n\t\t\t\tFor Each item As String In ThisField.DependsOn\n\t\t\t\t\tConsole.WriteLine(\" -{0}\", item)\n\t\t\t\tNext\n\t\t\tEnd If\n\t\tNext\n\n\t\tConsole.WriteLine(vbLf & \"...Sorting...\" & vbLf)\n\n\t\tDim sortOrder As Integer() = getTopologicalSortOrder(fields)\n\n\t\tFor i As Integer = 0 To sortOrder.Length - 1\n\t\t\tDim field = fields(sortOrder(i))\n\t\t\tConsole.WriteLine(field.Name)\n\t\t\t' Write up dependencies, too:\n\t\t\t'If field.DependsOn IsNot Nothing Then\n\t\t\t'\tFor Each item As String In field.DependsOn\n\t\t\t'\t\tConsole.WriteLine(\" -{0}\", item)\n\t\t\t'\tNext\n\t\t\t'End If\n\t\tNext\n\t\tConsole.Write(\"Press any key to continue . . . \")\n\t\tConsole.ReadKey(True)\n\tEnd Sub\n\t\n\tPrivate Sub CheckDependencies (ByRef Fields As List(Of Field))\n\t\t' Make sure all objects we depend on are part of the field list\n\t\t' themselves, as there may be dependencies that are not specified as fields themselves.\n\t\t' Remove dependencies on fields themselves.Y\t\t\t\n\t\tDim AField As Field, ADependency As String\n\t\t\n\t\tFor i As Integer = Fields.Count - 1 To 0 Step -1\n\t\t\tAField=fields(i)\n\t\t\tIf AField.DependsOn IsNot Nothing then\n\t\t\t\tFor j As Integer = 0 To Ubound(AField.DependsOn)\n\t\t\t\t\tADependency = Afield.DependsOn(j)\n\t\t\t\t\t' We ignore fields that depends on themselves:\n\t\t\t\t\tIf AField.Name <> ADependency then\n\t\t\t\t\t\tIf ListContainsVertex(fields, ADependency) = False Then\n\t\t\t\t\t\t\t' Add the dependent object to the field list, as it\n\t\t\t\t\t\t\t' needs to be there, without any dependencies\n\t\t\t\t\t\t\tFields.Add(New Field() With { _\n\t\t\t\t\t\t\t\t.Name = ADependency _\n\t\t\t\t\t\t\t})\n\t\t\t\t\t\tEnd If\n\t\t\t\t\tEnd If\n\t\t\t\tNext j\n\t\t\tEnd If\n\t\tNext i\t\n\tEnd Sub\n\t\n\tPrivate Sub RemoveSelfDependencies (ByRef Fields As List(Of Field))\n\t\t' Make sure our fields don't depend on themselves.\n\t\t' If they do, remove the dependency.\n\t\tDim InitialUbound as Integer\n\t\tFor Each AField As Field In Fields\t\t\t\n\t\t\tIf AField.DependsOn IsNot Nothing Then\n\t\t\t\tInitialUbound = Ubound(AField.DependsOn)\n\t\t\t\tFor i As Integer = InitialUbound to 0 Step - 1\n\t\t\t\t\tIf Afield.DependsOn(i) = Afield.Name Then\n\t\t\t\t\t\t' This field depends on itself, so remove\n\t\t\t\t\t\tFor j as Integer = i To UBound(AField.DependsOn)-1\n\t\t\t\t\t\t\tAfield.DependsOn(j)=Afield.DependsOn(j+1)\n\t\t\t\t\t\tNext\n\t\t\t\t\t\tReDim Preserve Afield.DependsOn(UBound(Afield.DependsOn)-1)\n\t\t\t\t\tEnd If\n\t\t\t\tNext\n\t\t\tEnd If\t\t\t\n\t\tNext\n\tEnd Sub\t\n\t\t\t\n\tPrivate Function ListContainsVertex(Fields As List(Of Field), VertexName As String) As Boolean\n\t' Check to see if the list of Fields already contains a vertext called VertexName\n\tDim Found As Boolean = False\n\t\tFor i As Integer = 0 To fields.Count - 1\n\t\t\tIf Fields(i).Name = VertexName Then\n\t\t\t\tFound = True\n\t\t\t\tExit For\n\t\t\tEnd If\n\t\tNext\n\t\tReturn Found\n\tEnd Function\n\n\tPrivate Function getTopologicalSortOrder(ByRef Fields As List(Of Field)) As Integer()\n\t\t' Gets sort order. Will also add required dependencies to\n\t\t' Fields.\n\t\t\n\t\t' Make sure we don't have dependencies on ourselves.\n\t\t' We'll just get rid of them.\n\t\tRemoveSelfDependencies(Fields)\n\t\t\n\t\t'First check depencies, add them to Fields if required:\n\t\tCheckDependencies(Fields)\n\t\t' Now we have the correct Fields list, so we can proceed:\n\t\tDim g As New TopologicalSorter(fields.Count)\n\t\tDim _indexes As New Dictionary(Of String, Integer)(fields.count)\n\n\t\t'add vertex names to our lookup dictionaey\n\t\tFor i As Integer = 0 To fields.Count - 1\n\t\t\t_indexes(fields(i).Name.ToLower()) = g.AddVertex(i)\n\t\tNext\n\n\t\t'add edges\n\t\tFor i As Integer = 0 To fields.Count - 1\n\t\t\tIf fields(i).DependsOn IsNot Nothing Then\n\t\t\t\tFor j As Integer = 0 To fields(i).DependsOn.Length - 1\n\t\t\t\t\tg.AddEdge(i, _indexes(fields(i).DependsOn(j).ToLower()))\n\t\t\t\tNext\n\t\t\tEnd If\n\t\tNext\n\n\t\tDim result As Integer() = g.Sort()\n\t\tReturn result\n\tEnd Function\n\n\tPrivate Class Field\n\t\tPublic Property Name() As String\n\t\t\tGet\n\t\t\t\tReturn m_Name\n\t\t\tEnd Get\n\t\t\tSet\n\t\t\t\tm_Name = Value\n\t\t\tEnd Set\n\t\tEnd Property\n\t\tPrivate m_Name As String\n\t\tPublic Property DependsOn() As String()\n\t\t\tGet\n\t\t\t\tReturn m_DependsOn\n\t\t\tEnd Get\n\t\t\tSet\n\t\t\t\tm_DependsOn = Value\n\t\t\tEnd Set\n\t\tEnd Property\n\t\tPrivate m_DependsOn As String()\n\tEnd Class\nEnd Module\nClass TopologicalSorter\n\t''source adapted from:\n\t''http://tawani.blogspot.com/2009/02/topological-sorting-and-cyclic.html\n\t''which was adapted from:\n\t''http://www.java2s.com/Code/Java/Collections-Data-Structure/Topologicalsorting.htm\n\t#Region \"- Private Members -\"\n\n\tPrivate ReadOnly _vertices As Integer()\n\t' list of vertices\n\tPrivate ReadOnly _matrix As Integer(,)\n\t' adjacency matrix\n\tPrivate _numVerts As Integer\n\t' current number of vertices\n\tPrivate ReadOnly _sortedArray As Integer()\n\t' Sorted vertex labels\n\n\t#End Region\n\n\t#Region \"- CTors -\"\n\n\tPublic Sub New(size As Integer)\n\t\t_vertices = New Integer(size - 1) {}\n\t\t_matrix = New Integer(size - 1, size - 1) {}\n\t\t_numVerts = 0\n\t\tFor i As Integer = 0 To size - 1\n\t\t\tFor j As Integer = 0 To size - 1\n\t\t\t\t_matrix(i, j) = 0\n\t\t\tNext\n\t\tNext\n\t\t\t' sorted vert labels\n\t\t_sortedArray = New Integer(size - 1) {}\n\tEnd Sub\n\n\t#End Region\n\n\t#Region \"- Public Methods -\"\n\n\tPublic Function AddVertex(vertex As Integer) As Integer\n\t\t_vertices(System.Threading.Interlocked.Increment(_numVerts)-1) = vertex\n\t\tReturn _numVerts - 1\n\tEnd Function\n\n\tPublic Sub AddEdge(start As Integer, [end] As Integer)\n\t\t_matrix(start, [end]) = 1\n\tEnd Sub\n\n\tPublic Function Sort() As Integer()\n\t' Topological sort\n\t\tWhile _numVerts > 0\n\t\t\t' while vertices remain,\n\t\t\t' get a vertex with no successors, or -1\n\t\t\tDim currentVertex As Integer = noSuccessors()\n\t\t\tIf currentVertex = -1 Then\n\t\t\t\t' must be a cycle\n\t\t\t\tThrow New Exception(\"Graph has cycles\")\n\t\t\tEnd If\n\n\t\t\t' insert vertex label in sorted array (start at end)\n\t\t\t_sortedArray(_numVerts - 1) = _vertices(currentVertex)\n\n\t\t\t\t' delete vertex\n\t\t\tdeleteVertex(currentVertex)\n\t\tEnd While\n\n\t\t' vertices all gone; return sortedArray\n\t\tReturn _sortedArray\n\tEnd Function\n\n\t#End Region\n\n\t#Region \"- Private Helper Methods -\"\n\n\t' returns vert with no successors (or -1 if no such verts)\n\tPrivate Function noSuccessors() As Integer\n\t\tFor row As Integer = 0 To _numVerts - 1\n\t\t\tDim isEdge As Boolean = False\n\t\t\t' edge from row to column in adjMat\n\t\t\tFor col As Integer = 0 To _numVerts - 1\n\t\t\t\tIf _matrix(row, col) > 0 Then\n\t\t\t\t\t' if edge to another,\n\t\t\t\t\tisEdge = True\n\t\t\t\t\t\t' this vertex has a successor try another\n\t\t\t\t\tExit For\n\t\t\t\tEnd If\n\t\t\tNext\n\t\t\tIf Not isEdge Then\n\t\t\t\t' if no edges, has no successors\n\t\t\t\tReturn row\n\t\t\tEnd If\n\t\tNext\n\t\tReturn -1\n\t\t' no\n\tEnd Function\n\n\tPrivate Sub deleteVertex(delVert As Integer)\n\t\t' if not last vertex, delete from vertexList\n\t\tIf delVert <> _numVerts - 1 Then\n\t\t\tFor j As Integer = delVert To _numVerts - 2\n\t\t\t\t_vertices(j) = _vertices(j + 1)\n\t\t\tNext\n\n\t\t\tFor row As Integer = delVert To _numVerts - 2\n\t\t\t\tmoveRowUp(row, _numVerts)\n\t\t\tNext\n\n\t\t\tFor col As Integer = delVert To _numVerts - 2\n\t\t\t\tmoveColLeft(col, _numVerts - 1)\n\t\t\tNext\n\t\tEnd If\n\t\t_numVerts -= 1\n\t\t' one less vertex\n\tEnd Sub\n\n\tPrivate Sub moveRowUp(row As Integer, length As Integer)\n\t\tFor col As Integer = 0 To length - 1\n\t\t\t_matrix(row, col) = _matrix(row + 1, col)\n\t\tNext\n\tEnd Sub\n\n\tPrivate Sub moveColLeft(col As Integer, length As Integer)\n\t\tFor row As Integer = 0 To length - 1\n\t\t\t_matrix(row, col) = _matrix(row, col + 1)\n\t\tNext\n\tEnd Sub\n\n\t#End Region\nEnd Class\n","language":"Visual-Basic-.NET"},{"code":"class Graph {\n construct new(s, edges) {\n _vertices = s.split(\", \")\n var n = _vertices.count\n _adjacency = List.filled(n, null)\n for (i in 0...n) _adjacency[i] = List.filled(n, false)\n for (edge in edges) _adjacency[edge[0]][edge[1]] = true\n }\n\n hasDependency(r, todo) {\n for (c in todo) if (_adjacency[r][c]) return true\n return false\n }\n\n topoSort() {\n var res = []\n var todo = List.filled(_vertices.count, 0)\n for (i in 0...todo.count) todo[i] = i\n while (!todo.isEmpty) {\n var outer = false\n var i = 0\n for (r in todo) {\n if (!hasDependency(r, todo)) {\n todo.removeAt(i)\n res.add(_vertices[r])\n outer = true\n break\n }\n i = i + 1\n }\n if (!outer) {\n System.print(\"Graph has cycles\")\n return \"\"\n }\n }\n return res\n }\n}\n\nvar s = \"std, ieee, des_system_lib, dw01, dw02, dw03, dw04, dw05, \" +\n \"dw06, dw07, dware, gtech, ramlib, std_cell_lib, synopsys\"\n\nvar deps = [\n [2, 0], [2, 14], [2, 13], [2, 4], [2, 3], [2, 12], [2, 1],\n [3, 1], [3, 10], [3, 11],\n [4, 1], [4, 10],\n [5, 0], [5, 14], [5, 10], [5, 4], [5, 3], [5, 1], [5, 11],\n [6, 1], [6, 3], [6, 10], [6, 11],\n [7, 1], [7, 10],\n [8, 1], [8, 10],\n [9, 1], [9, 10],\n [10, 1],\n [11, 1],\n [12, 0], [12, 1],\n [13, 1]\n]\n\nvar g = Graph.new(s, deps)\nSystem.print(\"Topologically sorted order:\")\nSystem.print(g.topoSort())\nSystem.print()\n// now insert [3, 6] at index 10 of deps\ndeps.insert(10, [3, 6])\nvar g2 = Graph.new(s, deps)\nSystem.print(\"Following the addition of dw04 to the dependencies of dw01:\")\nSystem.print(g2.topoSort())\n","language":"Wren"},{"code":"fcn topoSort(data){ // data is L( L(root,L(leaves)),...)\n allDs:=data.pump(List,fcn(rds){ T(Void.Write,Void.Write,rds[1]) }).copy();\n roots:=Dictionary(data); // dictionary of root:leaves\n L:=List();\n S:=data.pump(List,'wrap([(r,_)]){ if(allDs.holds(r)) Void.Skip else r }).copy();\n while(S){ //while S is non-empty do\n (n:=S.pop()) : L.append(_); //remove a node n from S, add n to tail of L\n foreach m in (ds:=roots.find(n,List)){ //node m with an edge e from n to m\n\t allDs.del(allDs.index(m));\n\t if (Void==allDs.find(m)) S.append(m); //m has no other incoming edges\n } roots.del(n); // remove edge e from the graph\n }\n if(roots) throw(Exception.ValueError(\"Cycle: \"+roots.keys));\n L\n}\n","language":"Zkl"},{"code":"data:=T(\n \"des_system_lib\", \"std synopsys std_cell_lib des_system_lib dw02 dw01 ramlib ieee\",\n \"dw01\", \"ieee dw01 dware gtech\",\n \"dw02\", \"ieee dw02 dware\",\n \"dw03\", \"std synopsys dware dw03 dw02 dw01 ieee gtech\",\n \"dw04\", \"dw04 ieee dw01 dware gtech\",\n \"dw05\", \"dw05 ieee dware\",\n \"dw06\", \"dw06 ieee dware\",\n \"dw07\", \"ieee dware\",\n \"dware\", \"ieee dware\",\n \"gtech\", \"ieee gtech\",\n \"ramlib\", \"std ieee\",\n \"std_cell_lib\", \"ieee std_cell_lib\",\n \"synopsys\", \"\",\n);\ndata=data.pump(List,Void.Read,fcn(r,ds){\n T( r, ds.replace(r,\"\").strip().split().copy() ) // leaves writable 'cause they will be\n});\ntopoSort(data).println();\n","language":"Zkl"}],"string":"[\n {\n \"code\": \"---\\ncategory:\\n- Sorting\\nfrom: http://rosettacode.org/wiki/Topological_sort\\nnote: Sorting Algorithms\\n\",\n \"language\": \"00-META\"\n },\n {\n \"code\": \"{{Sorting Algorithm}}\\n\\n\\nGiven a mapping between items, and items they depend on, a [[wp:Topological sorting|topological sort]] orders items so that no item precedes an item it depends upon. \\n\\nThe compiling of a library in the [[wp:VHDL|VHDL]] language has the constraint that a library must be compiled after any library it depends on. \\n\\nA tool exists that extracts library dependencies. \\n\\n\\n;Task:\\nWrite a function that will return a valid compile order of VHDL libraries from their dependencies.\\n\\n* Assume library names are single words. \\n* Items mentioned as only dependents, (sic), have no dependents of their own, but their order of compiling must be given.\\n* Any self dependencies should be ignored. \\n* Any un-orderable dependencies should be flagged.\\n\\n<br>\\nUse the following data as an example:\\n<pre>\\nLIBRARY LIBRARY DEPENDENCIES\\n======= ====================\\ndes_system_lib std synopsys std_cell_lib des_system_lib dw02 dw01 ramlib ieee\\ndw01 ieee dw01 dware gtech\\ndw02 ieee dw02 dware\\ndw03 std synopsys dware dw03 dw02 dw01 ieee gtech\\ndw04 dw04 ieee dw01 dware gtech\\ndw05 dw05 ieee dware\\ndw06 dw06 ieee dware\\ndw07 ieee dware\\ndware ieee dware\\ngtech ieee gtech\\nramlib std ieee\\nstd_cell_lib ieee std_cell_lib\\nsynopsys\\n</pre>\\n\\n<br>\\n<small>Note: the above data would be un-orderable if, for example, <code>dw04</code> is added to the list of dependencies of <code>dw01</code>.</small>\\n\\n\\n;C.f.:\\n:* [[Topological sort/Extracted top item]].\\n\\n<br>\\nThere are two popular algorithms for topological sorting:\\n:* Kahn's 1962 topological sort <ref> [[wp: topological sorting]] </ref> \\n:* depth-first search <ref> [[wp: topological sorting]] </ref> <ref> Jason Sachs\\n[http://www.embeddedrelated.com/showarticle/799.php \\\"Ten little algorithms, part 4: topological sort\\\"] </ref>\\n<br><br>\\n\\n\",\n \"language\": \"00-TASK\"\n },\n {\n \"code\": \"V data = [\\n ‘des_system_lib’ = Set(‘std synopsys std_cell_lib des_system_lib dw02 dw01 ramlib ieee’.split(‘ ’)),\\n ‘dw01’ = Set(‘ieee dw01 dware gtech’.split(‘ ’)),\\n ‘dw02’ = Set(‘ieee dw02 dware’.split(‘ ’)),\\n ‘dw03’ = Set(‘std synopsys dware dw03 dw02 dw01 ieee gtech’.split(‘ ’)),\\n ‘dw04’ = Set(‘dw04 ieee dw01 dware gtech’.split(‘ ’)),\\n ‘dw05’ = Set(‘dw05 ieee dware’.split(‘ ’)),\\n ‘dw06’ = Set(‘dw06 ieee dware’.split(‘ ’)),\\n ‘dw07’ = Set(‘ieee dware’.split(‘ ’)),\\n ‘dware’ = Set(‘ieee dware’.split(‘ ’)),\\n ‘gtech’ = Set(‘ieee gtech’.split(‘ ’)),\\n ‘ramlib’ = Set(‘std ieee’.split(‘ ’)),\\n ‘std_cell_lib’ = Set(‘ieee std_cell_lib’.split(‘ ’)),\\n ‘synopsys’ = Set[String]()\\n]\\n\\nF toposort2(&data)\\n L(k, v) data\\n v.discard(k)\\n\\n Set[String] extra_items_in_deps\\n L(v) data.values()\\n extra_items_in_deps.update(v)\\n extra_items_in_deps = extra_items_in_deps - Set(data.keys())\\n\\n L(item) extra_items_in_deps\\n data[item] = Set[String]()\\n\\n [String] r\\n L\\n Set[String] ordered\\n L(item, dep) data\\n I dep.empty\\n ordered.add(item)\\n I ordered.empty\\n L.break\\n\\n r.append(sorted(Array(ordered)).join(‘ ’))\\n\\n [String = Set[String]] new_data\\n L(item, dep) data\\n I item !C ordered\\n new_data[item] = dep - ordered\\n data = move(new_data)\\n\\n assert(data.empty, ‘A cyclic dependency exists’)\\n R r\\n\\nprint(toposort2(&data).join(\\\"\\\\n\\\"))\\n\",\n \"language\": \"11l\"\n },\n {\n \"code\": \"with Ada.Containers.Vectors; use Ada.Containers;\\n\\npackage Digraphs is\\n\\n type Node_Idx_With_Null is new Natural;\\n subtype Node_Index is Node_Idx_With_Null range 1 .. Node_Idx_With_Null'Last;\\n -- a Node_Index is a number from 1, 2, 3, ... and the representative of a node\\n\\n type Graph_Type is tagged private;\\n\\n -- make sure Node is in Graph (possibly without connections)\\n procedure Add_Node\\n (Graph: in out Graph_Type'Class; Node: Node_Index);\\n\\n -- insert an edge From->To into Graph; do nothing if already there\\n procedure Add_Connection\\n (Graph: in out Graph_Type'Class; From, To: Node_Index);\\n\\n -- get the largest Node_Index used in any Add_Node or Add_Connection op.\\n -- iterate over all nodes of Graph: \\\"for I in 1 .. Graph.Node_Count loop ...\\\"\\n function Node_Count(Graph: Graph_Type) return Node_Idx_With_Null;\\n\\n -- remove an edge From->To from Fraph; do nothing if not there\\n -- Graph.Node_Count is not changed\\n procedure Del_Connection\\n (Graph: in out Graph_Type'Class; From, To: Node_Index);\\n\\n -- check if an edge From->to exists in Graph\\n function Connected\\n (Graph: Graph_Type; From, To: Node_Index) return Boolean;\\n\\n -- data structure to store a list of nodes\\n package Node_Vec is new Vectors(Positive, Node_Index);\\n\\n -- get a list of all nodes From->Somewhere in Graph\\n function All_Connections\\n (Graph: Graph_Type; From: Node_Index) return Node_Vec.Vector;\\n\\n Graph_Is_Cyclic: exception;\\n\\n -- a depth-first search to find a topological sorting of the nodes\\n -- raises Graph_Is_Cyclic if no topological sorting is possible\\n function Top_Sort\\n (Graph: Graph_Type) return Node_Vec.Vector;\\n\\nprivate\\n\\n package Conn_Vec is new Vectors(Node_Index, Node_Vec.Vector, Node_Vec.\\\"=\\\");\\n\\n type Graph_Type is new Conn_Vec.Vector with null record;\\n\\nend Digraphs;\\n\",\n \"language\": \"Ada\"\n },\n {\n \"code\": \"package body Digraphs is\\n\\n function Node_Count(Graph: Graph_Type) return Node_Idx_With_Null is\\n begin\\n return Node_Idx_With_Null(Graph.Length);\\n end Node_Count;\\n\\n procedure Add_Node(Graph: in out Graph_Type'Class; Node: Node_Index) is\\n begin\\n for I in Node_Index range Graph.Node_Count+1 .. Node loop\\n Graph.Append(Node_Vec.Empty_Vector);\\n end loop;\\n end Add_Node;\\n\\n procedure Add_Connection\\n (Graph: in out Graph_Type'Class; From, To: Node_Index) is\\n begin\\n Graph.Add_Node(Node_Index'Max(From, To));\\n declare\\n Connection_List: Node_Vec.Vector := Graph.Element(From);\\n begin\\n for I in Connection_List.First_Index .. Connection_List.Last_Index loop\\n if Connection_List.Element(I) >= To then\\n if Connection_List.Element(I) = To then\\n return; -- if To is already there, don't add it a second time\\n else -- I is the first index with Element(I)>To, insert To here\\n Connection_List.Insert(Before => I, New_Item => To);\\n Graph.Replace_Element(From, Connection_List);\\n return;\\n end if;\\n end if;\\n end loop;\\n -- there was no I with no Element(I) > To, so insert To at the end\\n Connection_List.Append(To);\\n Graph.Replace_Element(From, Connection_List);\\n return;\\n end;\\n end Add_Connection;\\n\\n procedure Del_Connection\\n (Graph: in out Graph_Type'Class; From, To: Node_Index) is\\n Connection_List: Node_Vec.Vector := Graph.Element(From);\\n begin\\n for I in Connection_List.First_Index .. Connection_List.Last_Index loop\\n if Connection_List.Element(I) = To then\\n Connection_List.Delete(I);\\n Graph.Replace_Element(From, Connection_List);\\n return; -- we are done\\n end if;\\n end loop;\\n end Del_Connection;\\n\\n function Connected\\n (Graph: Graph_Type; From, To: Node_Index) return Boolean is\\n Connection_List: Node_Vec.Vector renames Graph.Element(From);\\n begin\\n for I in Connection_List.First_Index .. Connection_List.Last_Index loop\\n if Connection_List.Element(I) = To then\\n return True;\\n end if;\\n end loop;\\n return False;\\n end Connected;\\n\\n function All_Connections\\n (Graph: Graph_Type; From: Node_Index) return Node_Vec.Vector is\\n begin\\n return Graph.Element(From);\\n end All_Connections;\\n\\n function Top_Sort\\n (Graph: Graph_Type) return Node_Vec.Vector is\\n\\n Result: Node_Vec.Vector;\\n Visited: array(1 .. Graph.Node_Count) of Boolean := (others => False);\\n Active: array(1 .. Graph.Node_Count) of Boolean := (others => False);\\n\\n procedure Visit(Node: Node_Index) is\\n begin\\n if not Visited(Node) then\\n Visited(Node) := True;\\n Active(Node) := True;\\n declare\\n Cons: Node_Vec.Vector := All_Connections(Graph, Node);\\n begin\\n for Idx in Cons.First_Index .. Cons.Last_Index loop\\n Visit(Cons.Element(Idx));\\n end loop;\\n end;\\n Active(Node) := False;\\n Result.Append(Node);\\n else\\n if Active(Node) then\\n raise Constraint_Error with \\\"Graph is Cyclic\\\";\\n end if;\\n end if;\\n end Visit;\\n\\n begin\\n for Some_Node in Visited'Range loop\\n Visit(Some_Node);\\n end loop;\\n return Result;\\n end Top_Sort;\\n\\nend Digraphs;\\n\",\n \"language\": \"Ada\"\n },\n {\n \"code\": \"private with Ada.Containers.Indefinite_Vectors;\\n\\ngeneric\\n type Index_Type_With_Null is new Natural;\\npackage Set_Of_Names is\\n subtype Index_Type is Index_Type_With_Null\\n range 1 .. Index_Type_With_Null'Last;\\n -- manage a set of strings;\\n -- each string in the set is assigned a unique index of type Index_Type\\n\\n type Set is tagged private;\\n\\n -- inserts Name into Names; do nothing if already there;\\n procedure Add(Names: in out Set; Name: String);\\n\\n -- Same operation, additionally emiting Index=Names.Idx(Name)\\n procedure Add(Names: in out Set; Name: String; Index: out Index_Type);\\n\\n -- remove Name from Names; do nothing if not found\\n -- the removal may change the index of other strings in Names\\n procedure Sub(Names: in out Set; Name: String);\\n\\n -- returns the unique index of Name in Set; or 0 if Name is not there\\n function Idx(Names: Set; Name: String) return Index_Type_With_Null;\\n\\n -- returns the unique name of Index;\\n function Name(Names: Set; Index: Index_Type) return String;\\n\\n -- first index, last index and total number of names in set\\n -- to iterate over Names, use \\\"for I in Names.Start .. Names.Stop loop ...\\n function Start(Names: Set) return Index_Type;\\n function Stop(Names: Set) return Index_Type_With_Null;\\n function Size(Names: Set) return Index_Type_With_Null;\\n\\nprivate\\n\\n package Vecs is new Ada.Containers.Indefinite_Vectors\\n (Index_Type => Index_Type, Element_Type => String);\\n\\n type Set is new Vecs.Vector with null record;\\n\\nend Set_Of_Names;\\n\",\n \"language\": \"Ada\"\n },\n {\n \"code\": \"package body Set_Of_Names is\\n\\n use type Ada.Containers.Count_Type, Vecs.Cursor;\\n\\n function Start(Names: Set) return Index_Type is\\n begin\\n if Names.Length = 0 then\\n return 1;\\n else\\n return Names.First_Index;\\n end if;\\n end Start;\\n\\n function Stop(Names: Set) return Index_Type_With_Null is\\n begin\\n if Names.Length=0 then\\n return 0;\\n else\\n return Names.Last_Index;\\n end if;\\n end Stop;\\n\\n function Size(Names: Set) return Index_Type_With_Null is\\n begin\\n return Index_Type_With_Null(Names.Length);\\n end Size;\\n\\n procedure Add(Names: in out Set; Name: String; Index: out Index_Type) is\\n I: Index_Type_With_Null := Names.Idx(Name);\\n begin\\n if I = 0 then -- Name is not yet in Set\\n Names.Append(Name);\\n Index := Names.Stop;\\n else\\n Index := I;\\n end if;\\n end Add;\\n\\n procedure Add(Names: in out Set; Name: String) is\\n I: Index_Type;\\n begin\\n Names.Add(Name, I);\\n end Add;\\n\\n procedure Sub(Names: in out Set; Name: String) is\\n I: Index_Type_With_Null := Names.Idx(Name);\\n begin\\n if I /= 0 then -- Name is in set\\n Names.Delete(I);\\n end if;\\n end Sub;\\n\\n function Idx(Names: Set; Name: String) return Index_Type_With_Null is\\n begin\\n for I in Names.First_Index .. Names.Last_Index loop\\n if Names.Element(I) = Name then\\n return I;\\n end if;\\n end loop;\\n return 0;\\n end Idx;\\n\\n function Name(Names: Set; Index: Index_Type) return String is\\n begin\\n return Names.Element(Index);\\n end Name;\\n\\nend Set_Of_Names;\\n\",\n \"language\": \"Ada\"\n },\n {\n \"code\": \"with Ada.Text_IO, Digraphs, Set_Of_Names, Ada.Command_Line;\\n\\nprocedure Toposort is\\n\\n -- shortcuts for package names, intantiation of generic package\\n package TIO renames Ada.Text_IO;\\n package DG renames Digraphs;\\n package SN is new Set_Of_Names(DG.Node_Idx_With_Null);\\n\\n -- reat the graph from the file with the given Filename\\n procedure Read(Filename: String; G: out DG.Graph_Type; N: out SN.Set) is\\n\\n -- finds the first word in S(Start .. S'Last), delimited by spaces\\n procedure Find_Token(S: String; Start: Positive;\\n First: out Positive; Last: out Natural) is\\n\\n begin\\n First := Start;\\n while First <= S'Last and then S(First)= ' ' loop\\n First := First + 1;\\n end loop;\\n Last := First-1;\\n while Last < S'Last and then S(Last+1) /= ' ' loop\\n Last := Last + 1;\\n end loop;\\n end Find_Token;\\n\\n File: TIO.File_Type;\\n begin\\n TIO.Open(File, TIO.In_File, Filename);\\n TIO.Skip_Line(File, 2);\\n -- the first two lines contain header and \\\"===...===\\\"\\n while not TIO.End_Of_File(File) loop\\n declare\\n Line: String := TIO.Get_Line(File);\\n First: Positive;\\n Last: Natural;\\n To, From: DG.Node_Index;\\n begin\\n Find_Token(Line, Line'First, First, Last);\\n if Last >= First then\\n N.Add(Line(First .. Last), From);\\n G.Add_Node(From);\\n loop\\n Find_Token(Line, Last+1, First, Last);\\n exit when Last < First;\\n N.Add(Line(First .. Last), To);\\n G.Add_Connection(From, To);\\n end loop;\\n end if;\\n end;\\n end loop;\\n TIO.Close(File);\\n end Read;\\n\\n Graph: DG.Graph_Type;\\n Names: SN.Set;\\n\\nbegin\\n Read(Ada.Command_Line.Argument(1), Graph, Names);\\n\\n -- eliminat self-cycles\\n for Start in 1 .. Graph.Node_Count loop\\n Graph.Del_Connection(Start, Start);\\n end loop;\\n\\n -- perform the topological sort and output the result\\n declare\\n Result: DG.Node_Vec.Vector;\\n begin\\n Result := Graph.Top_Sort;\\n for Index in Result.First_Index .. Result.Last_Index loop\\n TIO.Put(Names.Name(Result.Element(Index)));\\n if Index < Result.Last_Index then\\n TIO.Put(\\\" -> \\\");\\n end if;\\n end loop;\\n TIO.New_Line;\\n exception\\n when DG.Graph_Is_Cyclic =>\\n TIO.Put_Line(\\\"There is no topological sorting -- the Graph is cyclic!\\\");\\n end;\\nend Toposort;\\n\",\n \"language\": \"Ada\"\n },\n {\n \"code\": \"(*------------------------------------------------------------------*)\\n(* The Rosetta Code topological sort task. *)\\n(*------------------------------------------------------------------*)\\n\\n#include \\\"share/atspre_staload.hats\\\"\\nstaload UN = \\\"prelude/SATS/unsafe.sats\\\"\\n\\n(* Macros for list construction. *)\\n#define NIL list_nil ()\\n#define :: list_cons\\n\\n(*------------------------------------------------------------------*)\\n(* A shorthand for list reversal. This could also have been written as\\n a macro. *)\\n\\nfn {a : t@ype}\\nrev {n : int}\\n (lst : list (INV(a), n))\\n :<!wrt> list (a, n) =\\n (* The list_reverse template function returns a linear list. Convert\\n that result to a \\\"regular\\\" list. *)\\n list_vt2t (list_reverse<a> lst)\\n\\n(*------------------------------------------------------------------*)\\n(* Some shorthands for string operations. These are written as\\n macros. *)\\n\\nmacdef substr (s, i, n) =\\n (* string_make_substring returns a linear strnptr, but we want a\\n \\\"regular\\\" string. *)\\n strnptr2string (string_make_substring (,(s), ,(i), ,(n)))\\n\\nmacdef copystr (s) =\\n (* string0 copy returns a linear strptr, but we want a \\\"regular\\\"\\n string. *)\\n strptr2string (string0_copy (,(s)))\\n\\n(*------------------------------------------------------------------*)\\n\\nlocal\\n\\n (* A boolean type for setting marks, and a vector of those. *)\\n typedef _mark_t = [b : nat | b <= 1] uint8 b\\n typedef _marksvec_t (n : int) = arrayref (_mark_t, n)\\n\\n (* Some type casts that seem not to be implemented in the\\n prelude. *)\\n implement g1int2uint<intknd, uint8knd> i = $UN.cast i\\n implement g1uint2int<uint8knd, intknd> i = $UN.cast i\\n\\nin\\n\\n abstype marks (n : int)\\n assume marks n = _marksvec_t n\\n\\n fn marks_make_elt\\n {n : nat}\\n {b : int | b == 0 || b == 1}\\n (n : size_t n,\\n b : int b)\\n :<!wrt> _marksvec_t n =\\n arrayref_make_elt (n, g1i2u b)\\n\\n fn\\n marks_set_at\\n {n : int}\\n {i : nat | i < n}\\n {b : int | b == 0 || b == 1}\\n (vec : _marksvec_t n,\\n i : size_t i,\\n b : int b)\\n :<!refwrt> void =\\n vec[i] := g1i2u b\\n\\n fn\\n marks_get_at\\n {n : int}\\n {i : nat | i < n}\\n (vec : _marksvec_t n,\\n i : size_t i)\\n :<!ref> [b : int | b == 0 || b == 1]\\n int b =\\n g1u2i vec[i]\\n\\n fn\\n marks_setall\\n {n : int}\\n {b : int | b == 0 || b == 1}\\n (vec : _marksvec_t n,\\n n : size_t n,\\n b : int b)\\n :<!refwrt> void =\\n let\\n prval () = lemma_arrayref_param vec\\n var i : [i : nat | i <= n] size_t i\\n in\\n for* {i : nat | i <= n}\\n .<n - i>.\\n (i : size_t i) =>\\n (i := i2sz 0; i <> n; i := succ i)\\n vec[i] := g1i2u b\\n end\\n\\n overload [] with marks_set_at of 100\\n overload [] with marks_get_at of 100\\n overload setall with marks_setall of 100\\n\\nend\\n\\n(*------------------------------------------------------------------*)\\n(* Reading dependencies from a file. The format is kept very simple,\\n because this is not a task about parsing. (Though I have written\\n an S-expression parser in ATS, and there is JSON support in the\\n ATS contributions package.) *)\\n\\n(* The format of a dependencies description. The second and later\\n entries of each sublist forms the list of dependencies of the first\\n entry. Thus this is a kind of association list. *)\\ntypedef depdesc (n : int) = list (List1 String1, n)\\ntypedef depdesc = [n : nat] depdesc n\\n\\ntypedef char_skipper =\\n {n : int}\\n {i : nat | i <= n}\\n (string n,\\n size_t n,\\n size_t i) -<cloref> (* A closure. *)\\n [j : int | i <= j; j <= n]\\n size_t j\\n\\nfn\\nmake_char_skipper\\n (match : char -<> bool)\\n :<> char_skipper =\\n let\\n fun\\n skipper {n : int}\\n {i : nat | i <= n}\\n .<n - i>.\\n (s : string n,\\n n : size_t n,\\n i : size_t i)\\n :<cloref> [j : int | i <= j; j <= n]\\n size_t j =\\n if i = n then\\n i\\n else if ~match s[i] then\\n i\\n else\\n skipper (s, n, succ i)\\n in\\n skipper (* Return a closure. *)\\n end\\n\\nval skip_spaces = make_char_skipper (lam c => isspace c)\\nval skip_ident =\\n make_char_skipper (lam c => (~isspace c) * (c <> ';'))\\n\\nfn is_end_of_list (c : char) :<> bool = (c = ';')\\n\\nfn\\nread_row {n : int}\\n {i : nat | i <= n}\\n (text : string n,\\n n : size_t n,\\n i : size_t i)\\n :<!wrt> [j : int | i <= j; j <= n]\\n @(List0 String1, size_t j) =\\n let\\n fun\\n loop {i : nat | i <= n}\\n .<n - i>.\\n (row : List0 String1,\\n i : size_t i)\\n :<!wrt> [j : int | i <= j; j <= n]\\n @(List0 String1, size_t j) =\\n let\\n val i = skip_spaces (text, n, i)\\n in\\n if i = n then\\n @(rev row, i)\\n else if is_end_of_list text[i] then\\n @(rev row, succ i)\\n else\\n let\\n val j = skip_ident (text, n, i)\\n val () = $effmask_exn assertloc (i < j)\\n val nodename = substr (text, i, j - i)\\n in\\n loop (nodename :: row, j)\\n end\\n end\\n in\\n loop (NIL, i)\\n end\\n\\nfn\\nread_desc {n : int}\\n {i : nat | i <= n}\\n (text : string n,\\n n : size_t n,\\n i : size_t i)\\n :<!wrt> [j : int | i <= j; j <= n]\\n @(depdesc, size_t j) =\\n let\\n fun\\n loop {i : nat | i <= n}\\n .<n - i>.\\n (desc : depdesc,\\n i : size_t i)\\n :<!wrt> [j : int | i <= j; j <= n]\\n @(depdesc, size_t j) =\\n let\\n val i = skip_spaces (text, n, i)\\n in\\n if i = n then\\n @(rev desc, i)\\n else if is_end_of_list text[i] then\\n @(rev desc, succ i)\\n else\\n let\\n val @(row, j) = read_row (text, n, i)\\n val () = $effmask_exn assertloc (i < j)\\n in\\n if length row = 0 then\\n loop (desc, j)\\n else\\n loop (row :: desc, j)\\n end\\n end\\n in\\n loop (NIL, i)\\n end\\n\\nfn\\nread_to_string ()\\n : String =\\n (* This simple implementation reads input only up to a certain\\n size. *)\\n let\\n #define BUFSIZE 8296\\n var buf = @[char][BUFSIZE] ('\\\\0')\\n var c : int = $extfcall (int, \\\"getchar\\\")\\n var i : Size_t = i2sz 0\\n in\\n while ((0 <= c) * (i < pred (i2sz BUFSIZE)))\\n begin\\n buf[i] := int2char0 c;\\n i := succ i;\\n c := $extfcall (int, \\\"getchar\\\")\\n end;\\n copystr ($UN.cast{string} (addr@ buf))\\n end\\n\\nfn\\nread_depdesc ()\\n : depdesc =\\n let\\n val text = read_to_string ()\\n prval () = lemma_string_param text\\n val n = strlen text\\n val @(desc, _) = read_desc (text, n, i2sz 0)\\n in\\n desc\\n end\\n\\n(*------------------------------------------------------------------*)\\n(* Conversion of a dependencies description to the internal\\n representation for a topological sort. *)\\n\\n(* An ordered list of the node names. *)\\ntypedef nodenames (n : int) = list (String1, n)\\n\\n(* A more efficient representation for nodes: integers in 0..n-1. *)\\ntypedef nodenum (n : int) = [num : nat | num <= n - 1] size_t num\\n\\n(* A collection of directed edges. Edges go from the nodenum that is\\n represented by the array index, to each of the nodenums listed in\\n the corresponding array entry. *)\\ntypedef edges (n : int) = arrayref (List0 (nodenum n), n)\\n\\n(* An internal representation of data for a topological sort. *)\\ntypedef topodata (n : int) =\\n '{\\n n = size_t n, (* The number of nodes. *)\\n edges = edges n, (* Directed edges. *)\\n tempmarks = marks n, (* Temporary marks. *)\\n permmarks = marks n (* Permanent marks. *)\\n }\\n\\nfn\\ncollect_nodenames\\n (desc : depdesc)\\n :<!wrt> [n : nat]\\n @(nodenames n,\\n size_t n) =\\n let\\n fun\\n collect_row\\n {m : nat}\\n {n0 : nat}\\n .<m>.\\n (row : list (String1, m),\\n names : &nodenames n0 >> nodenames n1,\\n n : &size_t n0 >> size_t n1)\\n :<!wrt> #[n1 : int | n0 <= n1]\\n void =\\n case+ row of\\n | NIL => ()\\n | head :: tail =>\\n let\\n implement list_find$pred<String1> s = (s = head)\\n in\\n case+ list_find_opt<String1> names of\\n | ~ None_vt () =>\\n begin\\n names := head :: names;\\n n := succ n;\\n collect_row (tail, names, n)\\n end\\n | ~ Some_vt _ => collect_row (tail, names, n)\\n end\\n\\n fun\\n collect {m : nat}\\n {n0 : nat}\\n .<m>.\\n (desc : list (List1 String1, m),\\n names : &nodenames n0 >> nodenames n1,\\n n : &size_t n0 >> size_t n1)\\n :<!wrt> #[n1 : int | n0 <= n1]\\n void =\\n case+ desc of\\n | NIL => ()\\n | head :: tail =>\\n begin\\n collect_row (head, names, n);\\n collect (tail, names, n)\\n end\\n\\n var names : List0 String1 = NIL\\n var n : Size_t = i2sz 0\\n in\\n collect (desc, names, n);\\n @(rev names, n)\\n end\\n\\nfn\\nnodename_number\\n {n : int}\\n (nodenames : nodenames n,\\n name : String1)\\n :<> Option (nodenum n) =\\n let\\n fun\\n loop {i : nat | i <= n}\\n .<n - i>.\\n (names : nodenames (n - i),\\n i : size_t i)\\n :<> Option (nodenum n) =\\n case+ names of\\n | NIL => None ()\\n | head :: tail =>\\n if head = name then\\n Some i\\n else\\n loop (tail, succ i)\\n\\n prval () = lemma_list_param nodenames\\n in\\n loop (nodenames, i2sz 0)\\n end\\n\\nfn\\nadd_edge {n : int}\\n (edges : edges n,\\n from : nodenum n,\\n to : nodenum n)\\n :<!refwrt> void =\\n (* This implementation does not store duplicate edges. *)\\n let\\n val old_edges = edges[from]\\n implement list_find$pred<nodenum n> s = (s = to)\\n in\\n case+ list_find_opt<nodenum n> old_edges of\\n | ~ None_vt () => edges[from] := to :: old_edges\\n | ~ Some_vt _ => ()\\n end\\n\\nfn\\nfill_edges\\n {n : int}\\n {m : int}\\n (edges : edges n,\\n n : size_t n,\\n desc : depdesc m,\\n nodenames : nodenames n)\\n :<!refwrt> void =\\n let\\n prval () = lemma_list_param desc\\n prval () = lemma_list_param nodenames\\n\\n fn\\n clear_edges ()\\n :<!refwrt> void =\\n let\\n var i : [i : nat | i <= n] size_t i\\n in\\n for* {i : nat | i <= n}\\n .<n - i>.\\n (i : size_t i) =>\\n (i := i2sz 0; i <> n; i := succ i)\\n edges[i] := NIL\\n end\\n\\n fun\\n fill_from_desc_entry\\n {m1 : nat}\\n .<m1>.\\n (headnum : nodenum n,\\n lst : list (String1, m1))\\n :<!refwrt> void =\\n case+ lst of\\n | NIL => ()\\n | name :: tail =>\\n let\\n val- Some num = nodename_number (nodenames, name)\\n in\\n if num <> headnum then\\n add_edge {n} (edges, num, headnum);\\n fill_from_desc_entry (headnum, tail)\\n end\\n\\n fun\\n fill_from_desc\\n {m2 : nat}\\n .<m2>.\\n (lst : list (List1 String1, m2))\\n :<!refwrt> void =\\n case+ lst of\\n | NIL => ()\\n | list_entry :: tail =>\\n let\\n val+ headname :: desc_entry = list_entry\\n val- Some headnum = nodename_number (nodenames, headname)\\n in\\n fill_from_desc_entry (headnum, desc_entry);\\n fill_from_desc tail\\n end\\n in\\n clear_edges ();\\n fill_from_desc desc\\n end\\n\\nfn\\ntopodata_make\\n (desc : depdesc)\\n :<!refwrt> [n : nat]\\n @(topodata n,\\n nodenames n) =\\n let\\n val @(nodenames, n) = collect_nodenames desc\\n prval () = lemma_g1uint_param n\\n prval [n : int] EQINT () = eqint_make_guint n\\n\\n val edges = arrayref_make_elt<List0 (nodenum n)> (n, NIL)\\n val () = fill_edges {n} (edges, n, desc, nodenames)\\n\\n val tempmarks = marks_make_elt (n, 0)\\n and permmarks = marks_make_elt (n, 0)\\n\\n val topo =\\n '{\\n n = n,\\n edges = edges,\\n tempmarks = tempmarks,\\n permmarks = permmarks\\n }\\n in\\n @(topo, nodenames)\\n end\\n\\n(*------------------------------------------------------------------*)\\n(*\\n\\n Topological sort by depth-first search. See\\n https://en.wikipedia.org/w/index.php?title=Topological_sorting&oldid=1092588874#Depth-first_search\\n\\n*)\\n\\n(* What return values are made from. *)\\ndatatype toporesult (a : t@ype, n : int) =\\n| {0 <= n}\\n Topo_SUCCESS (a, n) of list (a, n)\\n| Topo_CYCLE (a, n) of List1 a\\ntypedef toporesult (a : t@ype) = [n : int] toporesult (a, n)\\n\\nfn\\nfind_unmarked_node\\n {n : int}\\n (topo : topodata n)\\n :<!ref> Option (nodenum n) =\\n let\\n val n = topo.n\\n and permmarks = topo.permmarks\\n\\n prval () = lemma_g1uint_param n\\n\\n fun\\n loop {i : nat | i <= n}\\n .<n - i>.\\n (i : size_t i)\\n :<!ref> Option (nodenum n) =\\n if i = n then\\n None ()\\n else if permmarks[i] = 0 then\\n Some i\\n else\\n loop (succ i)\\n in\\n loop (i2sz 0)\\n end\\n\\nfun\\nvisit {n : int}\\n (topo : topodata n,\\n nodenum : nodenum n,\\n accum : List0 (nodenum n),\\n path : List0 (nodenum n))\\n : toporesult (nodenum n) =\\n (* Probably it is cumbersome to include a proof this routine\\n terminates. Thus I will not try to write one. *)\\n let\\n val n = topo.n\\n and edges = topo.edges\\n and tempmarks = topo.tempmarks\\n and permmarks = topo.permmarks\\n in\\n if permmarks[nodenum] = 1 then\\n Topo_SUCCESS accum\\n else if tempmarks[nodenum] = 1 then\\n let\\n val () = assertloc (isneqz path)\\n in\\n Topo_CYCLE path\\n end\\n else\\n let\\n fun\\n recursive_visits\\n {k : nat}\\n .<k>.\\n (topo : topodata n,\\n to_visit : list (nodenum n, k),\\n accum : List0 (nodenum n),\\n path : List0 (nodenum n))\\n : toporesult (nodenum n) =\\n case+ to_visit of\\n | NIL => Topo_SUCCESS accum\\n | node_to_visit :: tail =>\\n begin\\n case+ visit (topo, node_to_visit, accum, path) of\\n | Topo_SUCCESS accum1 =>\\n recursive_visits (topo, tail, accum1, path)\\n | other => other\\n end\\n in\\n tempmarks[nodenum] := 1;\\n case+ recursive_visits (topo, edges[nodenum], accum,\\n nodenum :: path) of\\n | Topo_SUCCESS accum1 =>\\n begin\\n tempmarks[nodenum] := 0;\\n permmarks[nodenum] := 1;\\n Topo_SUCCESS (nodenum :: accum1)\\n end\\n | other => other\\n end\\n end\\n\\nfn\\ntopological_sort\\n {n : int}\\n (topo : topodata n)\\n : toporesult (nodenum n, n) =\\n let\\n prval () = lemma_arrayref_param (topo.edges)\\n\\n fun\\n sort (accum : List0 (nodenum n))\\n : toporesult (nodenum n, n) =\\n case+ find_unmarked_node topo of\\n | None () =>\\n let\\n prval () = lemma_list_param accum\\n val () = assertloc (i2sz (length accum) = topo.n)\\n in\\n Topo_SUCCESS accum\\n end\\n | Some nodenum =>\\n begin\\n case+ visit (topo, nodenum, accum, NIL) of\\n | Topo_SUCCESS accum1 => sort accum1\\n | Topo_CYCLE cycle => Topo_CYCLE cycle\\n end\\n\\n val () = setall (topo.tempmarks, topo.n, 0)\\n and () = setall (topo.permmarks, topo.n, 0)\\n\\n val accum = sort NIL\\n\\n val () = setall (topo.tempmarks, topo.n, 0)\\n and () = setall (topo.permmarks, topo.n, 0)\\n in\\n accum\\n end\\n\\n(*------------------------------------------------------------------*)\\n(* The function asked for in the task. *)\\n\\nfn\\nfind_a_valid_order\\n (desc : depdesc)\\n : toporesult String1 =\\n let\\n val @(topo, nodenames) = topodata_make desc\\n\\n prval [n : int] EQINT () = eqint_make_guint (topo.n)\\n\\n val nodenames_array =\\n arrayref_make_list<String1> (sz2i (topo.n), nodenames)\\n\\n implement\\n list_map$fopr<nodenum n><String1> i =\\n nodenames_array[i]\\n\\n (* A shorthand for mapping from nodenum to string. *)\\n macdef map (lst) =\\n list_vt2t (list_map<nodenum n><String1> ,(lst))\\n in\\n case+ topological_sort topo of\\n | Topo_SUCCESS valid_order => Topo_SUCCESS (map valid_order)\\n | Topo_CYCLE cycle => Topo_CYCLE (map cycle)\\n end\\n\\n(*------------------------------------------------------------------*)\\n\\nimplement\\nmain0 (argc, argv) =\\n let\\n val desc = read_depdesc ()\\n in\\n case+ find_a_valid_order desc of\\n | Topo_SUCCESS valid_order =>\\n println! (valid_order : List0 string)\\n | Topo_CYCLE cycle =>\\n let\\n val last = list_last cycle\\n val cycl = rev (last :: cycle)\\n in\\n println! (\\\"COMPILATION CYCLE: \\\", cycl : List0 string)\\n end\\n end\\n\\n(*------------------------------------------------------------------*)\\n\",\n \"language\": \"ATS\"\n },\n {\n \"code\": \"( (\\\"des_system_lib\\\".std synopsys \\\"std_cell_lib\\\" \\\"des_system_lib\\\" dw02 dw01 ramlib ieee)\\n (dw01.ieee dw01 dware gtech)\\n (dw02.ieee dw02 dware)\\n (dw03.std synopsys dware dw03 dw02 dw01 ieee gtech)\\n (dw04.dw04 ieee dw01 dware gtech)\\n (dw05.dw05 ieee dware)\\n (dw06.dw06 ieee dware)\\n (dw07.ieee dware)\\n (dware.ieee dware)\\n (gtech.ieee gtech)\\n (ramlib.std ieee)\\n (\\\"std_cell_lib\\\".ieee \\\"std_cell_lib\\\")\\n (synopsys.)\\n (cycle-11.cycle-12)\\n (cycle-12.cycle-11)\\n (cycle-21.dw01 cycle-22 dw02 dw03)\\n (cycle-22.cycle-21 dw01 dw04)\\n : ?libdeps\\n& :?indeps\\n& ( toposort\\n = A Z res module dependants todo done\\n . !arg:(?todo.?done)\\n & ( areDone\\n =\\n . !arg:\\n | !arg\\n : ( %@\\n : [%( !module+!done+!indeps:?+(? !sjt ?)+?\\n | ~(!libdeps:? (!sjt.?) ?)\\n & !sjt !indeps:?indeps\\n )\\n )\\n ?arg\\n & areDone$!arg\\n )\\n & ( !todo\\n : ?A\\n (?module.?dependants&areDone$!dependants)\\n ( ?Z\\n & toposort$(!A !Z.!done !module):?res\\n )\\n & !res\\n | (!todo.!done)\\n )\\n )\\n& toposort$(!libdeps.):(?cycles.?res)\\n& out$(\\\"\\ncompile order:\\\" !indeps !res \\\"\\\\ncycles:\\\" !cycles)\\n);\\n\",\n \"language\": \"Bracmat\"\n },\n {\n \"code\": \"#include <stdio.h>\\n#include <stdlib.h>\\n#include <string.h>\\n#include <ctype.h>\\n\\nchar input[] =\\n\\t\\\"des_system_lib std synopsys std_cell_lib des_system_lib dw02 dw01 ramlib ieee\\\\n\\\"\\n\\t\\\"dw01 ieee dw01 dware gtech\\\\n\\\"\\n\\t\\\"dw02 ieee dw02 dware\\\\n\\\"\\n\\t\\\"dw03 std synopsys dware dw03 dw02 dw01 ieee gtech\\\\n\\\"\\n\\t\\\"dw04 dw04 ieee dw01 dware gtech\\\\n\\\"\\n\\t\\\"dw05 dw05 ieee dware\\\\n\\\"\\n\\t\\\"dw06 dw06 ieee dware\\\\n\\\"\\n\\t\\\"dw07 ieee dware\\\\n\\\"\\n\\t\\\"dware ieee dware\\\\n\\\"\\n\\t\\\"gtech ieee gtech\\\\n\\\"\\n\\t\\\"ramlib std ieee\\\\n\\\"\\n\\t\\\"std_cell_lib ieee std_cell_lib\\\\n\\\"\\n\\t\\\"synopsys\\\\n\\\"\\n\\t\\\"cycle_11\\t cycle_12\\\\n\\\"\\n\\t\\\"cycle_12\\t cycle_11\\\\n\\\"\\n\\t\\\"cycle_21\\t dw01 cycle_22 dw02 dw03\\\\n\\\"\\n\\t\\\"cycle_22\\t cycle_21 dw01 dw04\\\";\\n\\ntypedef struct item_t item_t, *item;\\nstruct item_t { const char *name; int *deps, n_deps, idx, depth; };\\n\\nint get_item(item *list, int *len, const char *name)\\n{\\n\\tint i;\\n\\titem lst = *list;\\n\\n\\tfor (i = 0; i < *len; i++)\\n\\t\\tif (!strcmp(lst[i].name, name)) return i;\\n\\n\\tlst = *list = realloc(lst, ++*len * sizeof(item_t));\\n\\ti = *len - 1;\\n\\tmemset(lst + i, 0, sizeof(item_t));\\n\\tlst[i].idx = i;\\n\\tlst[i].name = name;\\n\\treturn i;\\n}\\n\\nvoid add_dep(item it, int i)\\n{\\n\\tif (it->idx == i) return;\\n\\tit->deps = realloc(it->deps, (it->n_deps + 1) * sizeof(int));\\n\\tit->deps[it->n_deps++] = i;\\n}\\n\\nint parse_input(item *ret)\\n{\\n\\tint n_items = 0;\\n\\tint i, parent, idx;\\n\\titem list = 0;\\n\\n\\tchar *s, *e, *word, *we;\\n\\tfor (s = input; ; s = 0) {\\n\\t\\tif (!(s = strtok_r(s, \\\"\\\\n\\\", &e))) break;\\n\\n\\t\\tfor (i = 0, word = s; ; i++, word = 0) {\\n\\t\\t\\tif (!(word = strtok_r(word, \\\" \\\\t\\\", &we))) break;\\n\\t\\t\\tidx = get_item(&list, &n_items, word);\\n\\n\\t\\t\\tif (!i) parent = idx;\\n\\t\\t\\telse add_dep(list + parent, idx);\\n\\t\\t}\\n\\t}\\n\\n\\t*ret = list;\\n\\treturn n_items;\\n}\\n\\n/* recursively resolve compile order; negative means loop */\\nint get_depth(item list, int idx, int bad)\\n{\\n\\tint max, i, t;\\n\\n\\tif (!list[idx].deps)\\n\\t\\treturn list[idx].depth = 1;\\n\\n\\tif ((t = list[idx].depth) < 0) return t;\\n\\n\\tlist[idx].depth = bad;\\n\\tfor (max = i = 0; i < list[idx].n_deps; i++) {\\n\\t\\tif ((t = get_depth(list, list[idx].deps[i], bad)) < 0) {\\n\\t\\t\\tmax = t;\\n\\t\\t\\tbreak;\\n\\t\\t}\\n\\t\\tif (max < t + 1) max = t + 1;\\n\\t}\\n\\treturn list[idx].depth = max;\\n}\\n\\nint main()\\n{\\n\\tint i, j, n, bad = -1, max, min;\\n\\titem items;\\n\\tn = parse_input(&items);\\n\\n\\tfor (i = 0; i < n; i++)\\n\\t\\tif (!items[i].depth && get_depth(items, i, bad) < 0) bad--;\\n\\n\\tfor (i = 0, max = min = 0; i < n; i++) {\\n\\t\\tif (items[i].depth > max) max = items[i].depth;\\n\\t\\tif (items[i].depth < min) min = items[i].depth;\\n\\t}\\n\\n\\tprintf(\\\"Compile order:\\\\n\\\");\\n\\tfor (i = min; i <= max; i++) {\\n\\t\\tif (!i) continue;\\n\\n\\t\\tif (i < 0) printf(\\\" [unorderable]\\\");\\n\\t\\telse\\t printf(\\\"%d:\\\", i);\\n\\n\\t\\tfor (j = 0; j < n || !putchar('\\\\n'); j++)\\n\\t\\t\\tif (items[j].depth == i)\\n\\t\\t\\t\\tprintf(\\\" %s\\\", items[j].name);\\n\\t}\\n\\n\\treturn 0;\\n}\\n\",\n \"language\": \"C\"\n },\n {\n \"code\": \"Compile order:\\n [unorderable] cycle_21 cycle_22\\n [unorderable] cycle_11 cycle_12\\n1: std synopsys ieee\\n2: std_cell_lib ramlib dware gtech\\n3: dw02 dw01 dw05 dw06 dw07\\n4: des_system_lib dw03 dw04\\n\",\n \"language\": \"C\"\n },\n {\n \"code\": \"#include <map>\\n#include <set>\\n\\ntemplate<typename Goal>\\nclass topological_sorter {\\nprotected:\\n struct relations {\\n std::size_t dependencies;\\n std::set<Goal> dependents;\\n };\\n std::map<Goal, relations> map;\\npublic:\\n void add_goal(Goal const &goal) {\\n map[goal];\\n }\\n void add_dependency(Goal const &goal, Goal const &dependency) {\\n if (dependency == goal)\\n return;\\n auto &dependents = map[dependency].dependents;\\n if (dependents.find(goal) == dependents.end()) {\\n dependents.insert(goal);\\n ++map[goal].dependencies;\\n }\\n }\\n template<typename Container>\\n void add_dependencies(Goal const &goal, Container const &dependencies) {\\n for (auto const &dependency : dependencies)\\n add_dependency(goal, dependency);\\n }\\n template<typename ResultContainer, typename CyclicContainer>\\n void destructive_sort(ResultContainer &sorted, CyclicContainer &unsortable) {\\n sorted.clear();\\n unsortable.clear();\\n for (auto const &lookup : map) {\\n auto const &goal = lookup.first;\\n auto const &relations = lookup.second;\\n if (relations.dependencies == 0)\\n sorted.push_back(goal);\\n }\\n for (std::size_t index = 0; index < sorted.size(); ++index)\\n for (auto const &goal : map[sorted[index]].dependents)\\n if (--map[goal].dependencies == 0)\\n sorted.push_back(goal);\\n for (auto const &lookup : map) {\\n auto const &goal = lookup.first;\\n auto const &relations = lookup.second;\\n if (relations.dependencies != 0)\\n unsortable.push_back(goal);\\n }\\n }\\n template<typename ResultContainer, typename CyclicContainer>\\n void sort(ResultContainer &sorted, CyclicContainer &unsortable) {\\n topological_sorter<Goal> temporary = *this;\\n temporary.destructive_sort(sorted, unsortable);\\n }\\n void clear() {\\n map.clear();\\n }\\n};\\n\\n/*\\n Example usage with text strings\\n */\\n\\n#include <fstream>\\n#include <sstream>\\n#include <iostream>\\n#include <string>\\n#include <vector>\\n\\nusing namespace std;\\n\\nvoid display_heading(string const &message) {\\n cout << endl << \\\"~ \\\" << message << \\\" ~\\\" << endl;\\n}\\nvoid display_results(string const &input) {\\n topological_sorter<string> sorter;\\n vector<string> sorted, unsortable;\\n stringstream lines(input);\\n string line;\\n while (getline(lines, line)) {\\n stringstream buffer(line);\\n string goal, dependency;\\n buffer >> goal;\\n sorter.add_goal(goal);\\n while (buffer >> dependency)\\n sorter.add_dependency(goal, dependency);\\n }\\n sorter.destructive_sort(sorted, unsortable);\\n if (sorted.size() == 0)\\n display_heading(\\\"Error: no independent variables found!\\\");\\n else {\\n display_heading(\\\"Result\\\");\\n for (auto const &goal : sorted)\\n cout << goal << endl;\\n }\\n if (unsortable.size() != 0) {\\n display_heading(\\\"Error: cyclic dependencies detected!\\\");\\n for (auto const &goal : unsortable)\\n cout << goal << endl;\\n }\\n}\\nint main(int argc, char **argv) {\\n if (argc == 1) {\\n string example = \\\"des_system_lib std synopsys std_cell_lib des_system_lib dw02 dw01 ramlib ieee\\\\n\\\"\\n \\\"dw01 ieee dw01 dware gtech\\\\n\\\"\\n \\\"dw02 ieee dw02 dware\\\\n\\\"\\n \\\"dw03 std synopsys dware dw03 dw02 dw01 ieee gtech\\\\n\\\"\\n \\\"dw04 dw04 ieee dw01 dware gtech\\\\n\\\"\\n \\\"dw05 dw05 ieee dware\\\\n\\\"\\n \\\"dw06 dw06 ieee dware\\\\n\\\"\\n \\\"dw07 ieee dware\\\\n\\\"\\n \\\"dware ieee dware\\\\n\\\"\\n \\\"gtech ieee gtech\\\\n\\\"\\n \\\"ramlib std ieee\\\\n\\\"\\n \\\"std_cell_lib ieee std_cell_lib\\\\n\\\"\\n \\\"synopsys\\\\n\\\"\\n \\\"cycle_11 cycle_12\\\\n\\\"\\n \\\"cycle_12 cycle_11\\\\n\\\"\\n \\\"cycle_21 dw01 cycle_22 dw02 dw03\\\\n\\\"\\n \\\"cycle_22 cycle_21 dw01 dw04\\\";\\n display_heading(\\\"Example: each line starts with a goal followed by it's dependencies\\\");\\n cout << example << endl;\\n display_results(example);\\n display_heading(\\\"Enter lines of data (press enter when finished)\\\");\\n string line, data;\\n while (getline(cin, line) && !line.empty())\\n data += line + '\\\\n';\\n if (!data.empty())\\n display_results(data);\\n } else\\n while (*(++argv)) {\\n ifstream file(*argv);\\n typedef istreambuf_iterator<char> iterator;\\n display_results(string(iterator(file), iterator()));\\n }\\n}\\n\",\n \"language\": \"C++\"\n },\n {\n \"code\": \"#include <unordered_map>\\n#include <unordered_set>\\n#include <vector>\\n\\ntemplate <typename ValueType>\\nclass topological_sorter\\n{\\npublic:\\n using value_type = ValueType;\\n\\nprotected:\\n struct relations\\n {\\n std::size_t dependencies { 0 };\\n std::unordered_set<value_type> dependents {};\\n };\\n\\n std::unordered_map<value_type, relations> _map {};\\n\\npublic:\\n void add(const value_type &object)\\n {\\n _map.try_emplace(object, relations {});\\n }\\n\\n void add(const value_type &object, const value_type &dependency)\\n {\\n if (dependency == object) return;\\n\\n auto &dependents = _map[dependency].dependents;\\n\\n if (dependents.find(object) == std::end(dependents))\\n {\\n dependents.insert(object);\\n\\n ++_map[object].dependencies;\\n }\\n }\\n\\n template <typename Container>\\n void add(const value_type &object, const Container &dependencies)\\n {\\n for (auto const &dependency : dependencies) add(object, dependency);\\n }\\n\\n void add(const value_type &object, const std::initializer_list<value_type> &dependencies)\\n {\\n add<std::initializer_list<value_type>>(object, dependencies);\\n }\\n\\n template<typename... Args>\\n void add(const value_type &object, const Args&... dependencies)\\n {\\n (add(object, dependencies), ...);\\n }\\n\\n auto sort()\\n {\\n std::vector<value_type> sorted, cycled;\\n auto map { _map };\\n\\n for (const auto &[object, relations] : map) if (!relations.dependencies) sorted.emplace_back(object);\\n\\n for (decltype(std::size(sorted)) idx = 0; idx < std::size(sorted); ++idx)\\n for (auto const& object : map[sorted[idx]].dependents)\\n if (!--map[object].dependencies) sorted.emplace_back(object);\\n\\n for (const auto &[object, relations] : map) if (relations.dependencies) cycled.emplace_back(std::move(object));\\n\\n return std::pair(std::move(sorted), std::move(cycled));\\n }\\n\\n void clear()\\n {\\n _map.clear();\\n }\\n};\\n\\n/*\\n\\tExample usage with shared_ptr to class\\n*/\\n#include <iostream>\\n#include <memory>\\n\\nint main()\\n{\\n using namespace std::string_literals;\\n\\n struct task\\n {\\n std::string message;\\n\\n task(const std::string &v) : message { v } {}\\n ~task() { std::cout << message[0] << \\\" - destroyed\\\" << std::endl; }\\n };\\n\\n using task_ptr = std::shared_ptr<task>;\\n\\n std::vector<task_ptr> tasks\\n {\\n // defining simple tasks\\n std::make_shared<task>(\\\"A - depends on B and C\\\"s), //0\\n std::make_shared<task>(\\\"B - depends on none\\\"s), //1\\n std::make_shared<task>(\\\"C - depends on D and E\\\"s), //2\\n std::make_shared<task>(\\\"D - depends on none\\\"s), //3\\n std::make_shared<task>(\\\"E - depends on F, G and H\\\"s), //4\\n std::make_shared<task>(\\\"F - depends on I\\\"s), //5\\n std::make_shared<task>(\\\"G - depends on none\\\"s), //6\\n std::make_shared<task>(\\\"H - depends on none\\\"s), //7\\n std::make_shared<task>(\\\"I - depends on none\\\"s), //8\\n };\\n\\n topological_sorter<task_ptr> resolver;\\n\\n // now setting relations between them as described above\\n resolver.add(tasks[0], { tasks[1], tasks[2] });\\n //resolver.add(tasks[1]); // no need for this since the task was already mentioned as a dependency\\n resolver.add(tasks[2], { tasks[3], tasks[4] });\\n //resolver.add(tasks[3]); // no need for this since the task was already mentioned as a dependency\\n resolver.add(tasks[4], tasks[5], tasks[6], tasks[7]); // using templated add with fold expression\\n resolver.add(tasks[5], tasks[8]);\\n //resolver.add(tasks[6]); // no need for this since the task was already mentioned as a dependency\\n //resolver.add(tasks[7]); // no need for this since the task was already mentioned as a dependency\\n\\n //resolver.add(tasks[3], tasks[0]); // uncomment this line to test cycled dependency\\n\\n const auto &[sorted, cycled] = resolver.sort();\\n\\n if (std::empty(cycled))\\n {\\n for (auto const& d: sorted)\\n std::cout << d->message << std::endl;\\n }\\n else\\n {\\n std::cout << \\\"Cycled dependencies detected: \\\";\\n\\n for (auto const& d: cycled)\\n std::cout << d->message[0] << \\\" \\\";\\n\\n std::cout << std::endl;\\n }\\n\\n //tasks.clear(); // uncomment this line to destroy all tasks in sorted order.\\n\\n std::cout << \\\"exiting...\\\" << std::endl;\\n\\n return 0;\\n}\\n\",\n \"language\": \"C++\"\n },\n {\n \"code\": \"I - depends on none\\nH - depends on none\\nG - depends on none\\nD - depends on none\\nB - depends on none\\nF - depends on I\\nE - depends on F, G and H\\nC - depends on D and E\\nA - depends on B and C\\nexiting...\\nA - destroyed\\nB - destroyed\\nC - destroyed\\nD - destroyed\\nE - destroyed\\nF - destroyed\\nG - destroyed\\nH - destroyed\\nI - destroyed\\n\",\n \"language\": \"C++\"\n },\n {\n \"code\": \"Cycled dependencies detected: A D C\\nexiting...\\nA - destroyed\\nB - destroyed\\nC - destroyed\\nD - destroyed\\nE - destroyed\\nF - destroyed\\nG - destroyed\\nH - destroyed\\nI - destroyed\\n\",\n \"language\": \"C++\"\n },\n {\n \"code\": \"namespace Algorithms\\n{\\n using System;\\n using System.Collections.Generic;\\n using System.Linq;\\n\\n public class TopologicalSorter<ValueType>\\n {\\n private class Relations\\n {\\n public int Dependencies = 0;\\n public HashSet<ValueType> Dependents = new HashSet<ValueType>();\\n }\\n\\n private Dictionary<ValueType, Relations> _map = new Dictionary<ValueType, Relations>();\\n\\n public void Add(ValueType obj)\\n {\\n if (!_map.ContainsKey(obj)) _map.Add(obj, new Relations());\\n }\\n\\n public void Add(ValueType obj, ValueType dependency)\\n {\\n if (dependency.Equals(obj)) return;\\n\\n if (!_map.ContainsKey(dependency)) _map.Add(dependency, new Relations());\\n\\n var dependents = _map[dependency].Dependents;\\n\\n if (!dependents.Contains(obj))\\n {\\n dependents.Add(obj);\\n\\n if (!_map.ContainsKey(obj)) _map.Add(obj, new Relations());\\n\\n ++_map[obj].Dependencies;\\n }\\n }\\n\\n public void Add(ValueType obj, IEnumerable<ValueType> dependencies)\\n {\\n foreach (var dependency in dependencies) Add(obj, dependency);\\n }\\n\\n public void Add(ValueType obj, params ValueType[] dependencies)\\n {\\n Add(obj, dependencies as IEnumerable<ValueType>);\\n }\\n\\n public Tuple<IEnumerable<ValueType>, IEnumerable<ValueType>> Sort()\\n {\\n List<ValueType> sorted = new List<ValueType>(), cycled = new List<ValueType>();\\n var map = _map.ToDictionary(kvp => kvp.Key, kvp => kvp.Value);\\n\\n sorted.AddRange(map.Where(kvp => kvp.Value.Dependencies == 0).Select(kvp => kvp.Key));\\n\\n for (int idx = 0; idx < sorted.Count; ++idx) sorted.AddRange(map[sorted[idx]].Dependents.Where(k => --map[k].Dependencies == 0));\\n\\n cycled.AddRange(map.Where(kvp => kvp.Value.Dependencies != 0).Select(kvp => kvp.Key));\\n\\n return new Tuple<IEnumerable<ValueType>, IEnumerable<ValueType>>(sorted, cycled);\\n }\\n\\n public void Clear()\\n {\\n _map.Clear();\\n }\\n }\\n\\n}\\n\\n/*\\n\\tExample usage with Task object\\n*/\\n\\nnamespace ExampleApplication\\n{\\n using Algorithms;\\n using System;\\n using System.Collections.Generic;\\n using System.Linq;\\n\\n public class Task\\n {\\n public string Message;\\n }\\n\\n class Program\\n {\\n static void Main(string[] args)\\n {\\n List<Task> tasks = new List<Task>\\n {\\n new Task{ Message = \\\"A - depends on B and C\\\" }, //0\\n new Task{ Message = \\\"B - depends on none\\\" }, //1\\n new Task{ Message = \\\"C - depends on D and E\\\" }, //2\\n new Task{ Message = \\\"D - depends on none\\\" }, //3\\n new Task{ Message = \\\"E - depends on F, G and H\\\" }, //4\\n new Task{ Message = \\\"F - depends on I\\\" }, //5\\n new Task{ Message = \\\"G - depends on none\\\" }, //6\\n new Task{ Message = \\\"H - depends on none\\\" }, //7\\n new Task{ Message = \\\"I - depends on none\\\" }, //8\\n };\\n\\n TopologicalSorter<Task> resolver = new TopologicalSorter<Task>();\\n\\n // now setting relations between them as described above\\n resolver.Add(tasks[0], new[] { tasks[1], tasks[2] });\\n //resolver.Add(tasks[1]); // no need for this since the task was already mentioned as a dependency\\n resolver.Add(tasks[2], new[] { tasks[3], tasks[4] });\\n //resolver.Add(tasks[3]); // no need for this since the task was already mentioned as a dependency\\n resolver.Add(tasks[4], tasks[5], tasks[6], tasks[7]);\\n resolver.Add(tasks[5], tasks[8]);\\n //resolver.Add(tasks[6]); // no need for this since the task was already mentioned as a dependency\\n //resolver.Add(tasks[7]); // no need for this since the task was already mentioned as a dependency\\n\\n //resolver.Add(tasks[3], tasks[0]); // uncomment this line to test cycled dependency\\n\\n var result = resolver.Sort();\\n var sorted = result.Item1;\\n var cycled = result.Item2;\\n\\n if (!cycled.Any())\\n {\\n foreach (var d in sorted) Console.WriteLine(d.Message);\\n }\\n else\\n {\\n Console.Write(\\\"Cycled dependencies detected: \\\");\\n\\n foreach (var d in cycled) Console.Write($\\\"{d.Message[0]} \\\");\\n\\n Console.WriteLine();\\n }\\n\\n Console.WriteLine(\\\"exiting...\\\");\\n }\\n }\\n}\\n\",\n \"language\": \"C-sharp\"\n },\n {\n \"code\": \"B - depends on none\\nD - depends on none\\nG - depends on none\\nH - depends on none\\nI - depends on none\\nF - depends on I\\nE - depends on F, G and H\\nC - depends on D and E\\nA - depends on B and C\\nexiting...\\n\",\n \"language\": \"C-sharp\"\n },\n {\n \"code\": \"Cycled dependencies detected: A C D\\nexiting...\\n\",\n \"language\": \"C-sharp\"\n },\n {\n \"code\": \"(use 'clojure.set)\\n(use 'clojure.contrib.seq-utils)\\n\\n(defn dep\\n \\\"Constructs a single-key dependence, represented as a map from\\n item to a set of items, ensuring that item is not in the set.\\\"\\n [item items]\\n {item (difference (set items) (list item))})\\n\\n(defn empty-dep\\n \\\"Constructs a single-key dependence from item to an empty set.\\\"\\n [item]\\n (dep item '()))\\n\\n(defn pair-dep\\n \\\"Invokes dep after destructuring item and items from the argument.\\\"\\n [[item items]]\\n (dep item items))\\n\\n(defn default-deps\\n \\\"Constructs a default dependence map taking every item\\n in the argument to an empty set\\\"\\n [items]\\n (apply merge-with union (map empty-dep (flatten items))))\\n\\n(defn declared-deps\\n \\\"Constructs a dependence map from a list containaining\\n alternating items and list of their predecessor items.\\\"\\n [items]\\n (apply merge-with union (map pair-dep (partition 2 items))))\\n\\n(defn deps\\n \\\"Constructs a full dependence map containing both explicitly\\n represented dependences and default empty dependences for\\n items without explicit predecessors.\\\"\\n [items]\\n (merge (default-deps items) (declared-deps items)))\\n\\n(defn no-dep-items\\n \\\"Returns all keys from the argument which have no (i.e. empty) dependences.\\\"\\n [deps]\\n (filter #(empty? (deps %)) (keys deps)))\\n\\n(defn remove-items\\n \\\"Returns a dependence map with the specified items removed from keys\\n and from all dependence sets of remaining keys.\\\"\\n [deps items]\\n (let [items-to-remove (set items)\\n remaining-keys (difference (set (keys deps)) items-to-remove)\\n remaining-deps (fn [x] (dep x (difference (deps x) items-to-remove)))]\\n (apply merge (map remaining-deps remaining-keys))))\\n\\n(defn topo-sort-deps\\n \\\"Given a dependence map, returns either a list of items in which each item\\n follows all of its predecessors, or a string showing the items among which\\n there is a cyclic dependence preventing a linear order.\\\"\\n [deps]\\n (loop [remaining-deps deps\\n result '()]\\n (if (empty? remaining-deps)\\n (reverse result)\\n (let [ready-items (no-dep-items remaining-deps)]\\n (if (empty? ready-items)\\n (str \\\"ERROR: cycles remain among \\\" (keys remaining-deps))\\n (recur (remove-items remaining-deps ready-items)\\n (concat ready-items result)))))))\\n\\n(defn topo-sort\\n \\\"Given a list of alternating items and predecessor lists, constructs a\\n full dependence map and then applies topo-sort-deps to that map.\\\"\\n [items]\\n (topo-sort-deps (deps items)))\\n\",\n \"language\": \"Clojure\"\n },\n {\n \"code\": \"(def good-sample\\n '(:des_system_lib (:std :synopsys :std_cell_lib :des_system_lib :dw02 :dw01 :ramlib :ieee)\\n :dw01 (:ieee :dw01 :dware :gtech)\\n :dw02 (:ieee :dw02 :dware)\\n :dw03 (:std :synopsys :dware :dw03 :dw02 :dw01 :ieee :gtech)\\n :dw04 (:dw04 :ieee :dw01 :dware :gtech)\\n :dw05 (:dw05 :ieee :dware)\\n :dw06 (:dw06 :ieee :dware)\\n :dw07 (:ieee :dware)\\n :dware (:ieee :dware)\\n :gtech (:ieee :gtech)\\n :ramlib (:std :ieee)\\n :std_cell_lib (:ieee :std_cell_lib)\\n :synopsys ()))\\n\\n(def cyclic-dependence\\n '(:dw01 (:dw04)))\\n\\n(def bad-sample\\n (concat cyclic-dependence good-sample))\\n\",\n \"language\": \"Clojure\"\n },\n {\n \"code\": \"Clojure 1.1.0\\n1:1 user=> #<Namespace topo>\\n1:2 topo=> (topo-sort good-sample)\\n(:std :synopsys :ieee :gtech :ramlib :dware :std_cell_lib :dw07 :dw06 :dw05 :dw01 :dw02 :des_system_lib :dw03 :dw04)\\n1:3 topo=> (topo-sort bad-sample)\\n\\\"ERROR: cycles remain among (:dw01 :dw04 :dw03 :des_system_lib)\\\"\\n\",\n \"language\": \"Clojure\"\n },\n {\n \"code\": \"toposort = (targets) ->\\n # targets is hash of sets, where keys are parent nodes and\\n # where values are sets that contain nodes that must precede the parent\\n\\n # Start by identifying obviously independent nodes\\n independents = []\\n do ->\\n for k of targets\\n if targets[k].cnt == 0\\n delete targets[k]\\n independents.push k\\n\\n # Note reverse dependencies for theoretical O(M+N) efficiency.\\n reverse_deps = []\\n do ->\\n for k of targets\\n for child of targets[k].v\\n reverse_deps[child] ?= []\\n reverse_deps[child].push k\\n\\n # Now be greedy--start with independent nodes, then start\\n # breaking dependencies, and keep going as long as we still\\n # have independent nodes left.\\n result = []\\n while independents.length > 0\\n k = independents.pop()\\n result.push k\\n for parent in reverse_deps[k] or []\\n set_remove targets[parent], k\\n if targets[parent].cnt == 0\\n independents.push parent\\n delete targets[parent]\\n\\n # Show unresolvable dependencies\\n for k of targets\\n console.log \\\"WARNING: node #{k} is part of cyclical dependency\\\"\\n result\\n\\nparse_deps = ->\\n # parse string data, remove self-deps, and fill in gaps\\n #\\n # e.g. this would transform {a: \\\"a b c\\\", d: \\\"e\\\"} to this:\\n # a: set(b, c)\\n # b: set()\\n # c: set()\\n # d: set(e)\\n # e: set()\\n targets = {}\\n deps = set()\\n for k, v of data\\n targets[k] = set()\\n children = v.split(' ')\\n for child in children\\n continue if child == ''\\n set_add targets[k], child unless child == k\\n set_add deps, child\\n\\n # make sure even leaf nodes are in targets\\n for dep of deps.v\\n if dep not of targets\\n targets[dep] = set()\\n targets\\n\\nset = ->\\n cnt: 0\\n v: {}\\n\\nset_add = (s, e) ->\\n return if s.v[e]\\n s.cnt += 1\\n s.v[e] = true\\n\\nset_remove = (s, e) ->\\n return if !s.v[e]\\n s.cnt -= 1\\n delete s.v[e]\\n\\ndata =\\n des_system_lib: \\\"std synopsys std_cell_lib des_system_lib dw02 dw01 ramlib ieee\\\"\\n dw01: \\\"ieee dw01 dware gtech\\\"\\n dw02: \\\"ieee dw02 dware\\\"\\n dw03: \\\"std synopsys dware dw03 dw02 dw01 ieee gtech\\\"\\n dw04: \\\"dw04 ieee dw01 dware gtech\\\"\\n dw05: \\\"dw05 ieee dware\\\"\\n dw06: \\\"dw06 ieee dware\\\"\\n dw07: \\\"ieee dware\\\"\\n dware: \\\"ieee dware\\\"\\n gtech: \\\"ieee gtech\\\"\\n ramlib: \\\"std ieee\\\"\\n std_cell_lib: \\\"ieee std_cell_lib\\\"\\n synopsys: \\\"\\\"\\n\\n\\ntargets = parse_deps()\\nconsole.log toposort targets\\n\",\n \"language\": \"CoffeeScript\"\n },\n {\n \"code\": \"(defun topological-sort (graph &key (test 'eql))\\n \\\"Graph is an association list whose keys are objects and whose\\nvalues are lists of objects on which the corresponding key depends.\\nTest is used to compare elements, and should be a suitable test for\\nhash-tables. Topological-sort returns two values. The first is a\\nlist of objects sorted toplogically. The second is a boolean\\nindicating whether all of the objects in the input graph are present\\nin the topological ordering (i.e., the first value).\\\"\\n (let ((entries (make-hash-table :test test)))\\n (flet ((entry (vertex)\\n \\\"Return the entry for vertex. Each entry is a cons whose\\n car is the number of outstanding dependencies of vertex\\n and whose cdr is a list of dependants of vertex.\\\"\\n (multiple-value-bind (entry presentp) (gethash vertex entries)\\n (if presentp entry\\n (setf (gethash vertex entries) (cons 0 '()))))))\\n ;; populate entries initially\\n (dolist (vertex graph)\\n (destructuring-bind (vertex &rest dependencies) vertex\\n (let ((ventry (entry vertex)))\\n (dolist (dependency dependencies)\\n (let ((dentry (entry dependency)))\\n (unless (funcall test dependency vertex)\\n (incf (car ventry))\\n (push vertex (cdr dentry))))))))\\n ;; L is the list of sorted elements, and S the set of vertices\\n ;; with no outstanding dependencies.\\n (let ((L '())\\n (S (loop for entry being each hash-value of entries\\n using (hash-key vertex)\\n when (zerop (car entry)) collect vertex)))\\n ;; Until there are no vertices with no outstanding dependencies,\\n ;; process vertices from S, adding them to L.\\n (do* () ((endp S))\\n (let* ((v (pop S)) (ventry (entry v)))\\n (remhash v entries)\\n (dolist (dependant (cdr ventry) (push v L))\\n (when (zerop (decf (car (entry dependant))))\\n (push dependant S)))))\\n ;; return (1) the list of sorted items, (2) whether all items\\n ;; were sorted, and (3) if there were unsorted vertices, the\\n ;; hash table mapping these vertices to their dependants\\n (let ((all-sorted-p (zerop (hash-table-count entries))))\\n (values (nreverse L)\\n all-sorted-p\\n (unless all-sorted-p\\n entries)))))))\\n\",\n \"language\": \"Common-Lisp\"\n },\n {\n \"code\": \"> (defparameter *dependency-graph*\\n '((des-system-lib std synopsys std-cell-lib des-system-lib dw02 dw01 ramlib ieee)\\n (dw01 ieee dw01 dware gtech)\\n (dw02 ieee dw02 dware)\\n (dw03 std synopsys dware dw03 dw02 dw01 ieee gtech)\\n (dw04 dw04 ieee dw01 dware gtech)\\n (dw05 dw05 ieee dware)\\n (dw06 dw06 ieee dware)\\n (dw07 ieee dware)\\n (dware ieee dware)\\n (gtech ieee gtech)\\n (ramlib std ieee)\\n (std-cell-lib ieee std-cell-lib)\\n (synopsys)))\\n*DEPENDENCY-GRAPH*\\n\\n> (topological-sort *dependency-graph*)\\n(IEEE DWARE DW02 DW05 DW06 DW07 GTECH DW01 DW04 STD-CELL-LIB SYNOPSYS STD DW03 RAMLIB DES-SYSTEM-LIB)\\nT\\nNIL\\n\",\n \"language\": \"Common-Lisp\"\n },\n {\n \"code\": \"> (defparameter *dependency-graph*\\n '((des-system-lib std synopsys std-cell-lib des-system-lib dw02 dw01 ramlib ieee)\\n (dw01 ieee dw01 dw04 dware gtech)\\n (dw02 ieee dw02 dware)\\n (dw03 std synopsys dware dw03 dw02 dw01 ieee gtech)\\n (dw04 dw04 ieee dw01 dware gtech)\\n (dw05 dw05 ieee dware)\\n (dw06 dw06 ieee dware)\\n (dw07 ieee dware)\\n (dware ieee dware)\\n (gtech ieee gtech)\\n (ramlib std ieee)\\n (std-cell-lib ieee std-cell-lib)\\n (synopsys)))\\n*DEPENDENCY-GRAPH*\\n\\n> (topological-sort *dependency-graph*)\\n(IEEE DWARE DW02 DW05 DW06 DW07 GTECH STD-CELL-LIB SYNOPSYS STD RAMLIB)\\nNIL\\n#<EQL Hash Table{4} 200C9023>\\n\\n> (describe (third /))\\n\\n#<EQL Hash Table{4} 200C9023> is a HASH-TABLE\\nDW01 (1 DW04 DW03 DES-SYSTEM-LIB)\\nDW04 (1 DW01)\\nDW03 (1)\\nDES-SYSTEM-LIB (1)\\n\",\n \"language\": \"Common-Lisp\"\n },\n {\n \"code\": \"def dfs_topo_visit(n, g, tmp, permanent, l)\\n if permanent.includes?(n)\\n return\\n elsif tmp.includes?(n)\\n raise \\\"unorderable: circular dependency detected involving '#{n}'\\\"\\n end\\n tmp.add(n)\\n\\n g[n].each { |m|\\n dfs_topo_visit(m, g, tmp, permanent, l)\\n }\\n\\n tmp.delete(n)\\n permanent.add(n)\\n l.insert(0, n)\\nend\\n\\n\\ndef dfs_topo_sort(g)\\n tmp = Set(String).new\\n permanent = Set(String).new\\n l = Array(String).new\\n\\n while true\\n keys = g.keys.to_set - permanent\\n if keys.empty?\\n break\\n end\\n\\n n = keys.first\\n dfs_topo_visit(n, g, tmp, permanent, l)\\n end\\n\\n return l\\nend\\n\\n\\ndef build_graph(deps)\\n g = {} of String => Set(String)\\n deps.split(\\\"\\\\n\\\").each { |line|\\n line_split = line.strip.split\\n line_split.each { |dep|\\n unless g.has_key?(dep)\\n g[dep] = Set(String).new\\n end\\n unless line_split[0] == dep\\n g[dep].add(line_split[0])\\n end\\n }\\n }\\n return g\\nend\\n\\n\\ndata = \\\"des_system_lib std synopsys std_cell_lib des_system_lib dw02 dw01 ramlib ieee\\ndw01 ieee dw01 dware gtech\\ndw02 ieee dw02 dware\\ndw03 std synopsys dware dw03 dw02 dw01 ieee gtech\\ndw04 dw04 ieee dw01 dware gtech\\ndw05 dw05 ieee dware\\ndw06 dw06 ieee dware\\ndw07 ieee dware\\ndware ieee dware\\ngtech ieee gtech\\nramlib std ieee\\nstd_cell_lib ieee std_cell_lib\\nsynopsys\\\"\\n\\ncircular_deps = \\\"\\\\ncyc01 cyc02\\n cyc02 cyc01\\\"\\n\\nputs dfs_topo_sort(build_graph(data)).join(\\\" -> \\\")\\nputs \\\"\\\"\\nputs dfs_topo_sort(build_graph(data + circular_deps)).join(\\\" -> \\\")\\n\",\n \"language\": \"Crystal\"\n },\n {\n \"code\": \"import std.stdio, std.string, std.algorithm, std.range;\\n\\nfinal class ArgumentException : Exception {\\n this(string text) pure nothrow @safe /*@nogc*/ {\\n super(text);\\n }\\n}\\n\\nalias TDependencies = string[][string];\\n\\nstring[][] topoSort(TDependencies d) pure /*nothrow @safe*/ {\\n foreach (immutable k, v; d)\\n d[k] = v.sort().uniq.filter!(s => s != k).array;\\n foreach (immutable s; d.byValue.join.sort().uniq)\\n if (s !in d)\\n d[s] = [];\\n\\n string[][] sorted;\\n while (true) {\\n string[] ordered;\\n\\n foreach (immutable item, const dep; d)\\n if (dep.empty)\\n ordered ~= item;\\n if (!ordered.empty)\\n sorted ~= ordered.sort().release;\\n else\\n break;\\n\\n TDependencies dd;\\n foreach (immutable item, const dep; d)\\n if (!ordered.canFind(item))\\n dd[item] = dep.dup.filter!(s => !ordered.canFind(s)).array;\\n d = dd;\\n }\\n\\n //if (!d.empty)\\n if (d.length > 0)\\n throw new ArgumentException(format(\\n \\\"A cyclic dependency exists amongst:\\\\n%s\\\", d));\\n\\n return sorted;\\n}\\n\\nvoid main() {\\n immutable data =\\n\\\"des_system_lib std synopsys std_cell_lib des_system_lib dw02 dw01 ramlib ieee\\ndw01 ieee dw01 dware gtech\\ndw02 ieee dw02 dware\\ndw03 std synopsys dware dw03 dw02 dw01 ieee gtech\\ndw04 dw04 ieee dw01 dware gtech\\ndw05 dw05 ieee dware\\ndw06 dw06 ieee dware\\ndw07 ieee dware\\ndware ieee dware\\ngtech ieee gtech\\nramlib std ieee\\nstd_cell_lib ieee std_cell_lib\\nsynopsys\\\";\\n\\n TDependencies deps;\\n foreach (immutable line; data.splitLines)\\n deps[line.split[0]] = line.split[1 .. $];\\n\\n auto depw = deps.dup;\\n foreach (immutable idx, const subOrder; depw.topoSort)\\n writefln(\\\"#%d : %s\\\", idx + 1, subOrder);\\n\\n writeln;\\n depw = deps.dup;\\n depw[\\\"dw01\\\"] ~= \\\"dw04\\\";\\n foreach (const subOrder; depw.topoSort) // Should throw.\\n subOrder.writeln;\\n}\\n\",\n \"language\": \"D\"\n },\n {\n \"code\": \"def makeQueue := <elib:vat.makeQueue>\\n\\ndef topoSort(data :Map[any, Set[any]]) {\\n # Tables of nodes and edges\\n def forwardEdges := [].asMap().diverge()\\n def reverseCount := [].asMap().diverge()\\n\\n def init(node) {\\n reverseCount[node] := 0\\n forwardEdges[node] := [].asSet().diverge()\\n }\\n for node => deps in data {\\n init(node)\\n for dep in deps { init(dep) }\\n }\\n\\n # 'data' holds the dependencies. Compute the other direction.\\n for node => deps in data {\\n for dep ? (dep != node) in deps {\\n forwardEdges[dep].addElement(node)\\n reverseCount[node] += 1\\n }\\n }\\n\\n # Queue containing all elements that have no (initial or remaining) incoming edges\\n def ready := makeQueue()\\n for node => ==0 in reverseCount {\\n ready.enqueue(node)\\n }\\n\\n var result := []\\n\\n while (ready.optDequeue() =~ node :notNull) {\\n result with= node\\n for next in forwardEdges[node] {\\n # Decrease count of incoming edges and enqueue if none\\n if ((reverseCount[next] -= 1).isZero()) {\\n ready.enqueue(next)\\n }\\n }\\n forwardEdges.removeKey(node)\\n }\\n\\n if (forwardEdges.size().aboveZero()) {\\n throw(`Topological sort failed: $forwardEdges remains`)\\n }\\n\\n return result\\n}\\n\",\n \"language\": \"E\"\n },\n {\n \"code\": \"pragma.enable(\\\"accumulator\\\")\\n\\ndef dataText := \\\"\\\\\\ndes_system_lib std synopsys std_cell_lib des_system_lib dw02 dw01 ramlib ieee\\ndw01 ieee dw01 dware gtech\\ndw02 ieee dw02 dware\\ndw03 std synopsys dware dw03 dw02 dw01 ieee gtech\\ndw04 dw04 ieee dw01 dware gtech\\ndw05 dw05 ieee dware\\ndw06 dw06 ieee dware\\ndw07 ieee dware\\ndware ieee dware\\ngtech ieee gtech\\nramlib std ieee\\nstd_cell_lib ieee std_cell_lib\\nsynopsys\\\\\\n\\\"\\n\\ndef data := accum [].asMap() for rx`(@item.{17})(@deps.*)` in dataText.split(\\\"\\\\n\\\") { _.with(item.trim(), deps.split(\\\" \\\").asSet()) }\\n\\nprintln(topoSort(data))\\n\",\n \"language\": \"E\"\n },\n {\n \"code\": \"(define dependencies\\n'((des_system_lib std synopsys std_cell_lib des_system_lib dw02 dw01 ramlib ieee)\\n(dw01 ieee dw01 dware gtech) ;; bad graph add dw04\\n(dw02 ieee dw02 dware )\\n(dw03 std synopsys dware dw03 dw02 dw01 ieee gtech)\\n(dw04 dw04 ieee dw01 dware gtech)\\n(dw05 dw05 ieee dware)\\n(dw06 dw06 ieee dware)\\n(dw07 ieee dware)\\n(dware ieee dware)\\n(gtech ieee gtech)\\n(ramlib std ieee )\\n(std_cell_lib ieee std_cell_lib)\\n(synopsys )))\\n\\n\\n;; build dependency graph\\n;; a depends on b\\n;; add arc (arrow) a --> b\\n(lib 'graph.lib)\\n(define (a->b g a b)\\n\\t\\t(unless (equal? a b)\\n\\t\\t(graph-make-arc g (graph-make-vertex g a) (graph-make-vertex g b))))\\n\\n(define (add-dependencies g dep-list)\\n(for* ((dep dep-list) (b (rest dep))) (a->b g b (first dep))))\\n\",\n \"language\": \"EchoLisp\"\n },\n {\n \"code\": \";; topological sort\\n;;\\n;; Complexity O (# of vertices + # of edges)\\n\\n(define (t-sort g)\\n\\t(stack 'Z) ; vertices of d°(0)\\n\\t(stack 'S) ; ordered result\\n\\n;; mark all vertices with their in-degree = # of incoming arcs\\n;; push all vertices u such as d°(u) = 0\\n\\t(for ((u g)) (mark u (graph-vertex-indegree g u))\\n\\t (when (zero? (mark? u)) (push 'Z u)))\\n\\t\\n;pop a d°(0) vertex u - add it to result\\n;decrement in-degree of all v vertices u->v\\n; if d°(v) = 0, push it\\n\\n(while (not (stack-empty? 'Z))\\n \\t\\t\\t(let (( u (pop 'Z)))\\n \\t\\t\\t(push 'S u)\\n\\t\\t\\t (for ((v (graph-vertex-out g u)))\\n\\t\\t\\t\\t (mark v (1- (mark? v)))\\n\\t\\t\\t\\t (when (zero? (mark? v)) (push 'Z v)))))\\n\\t\\t\\t\\t\\n;; finish\\n\\t\\t (writeln 't-sort (map vertex-label (stack->list 'S)))\\n\\t\\t\\n;; check no one remaining\\n\\t\\t(for ((u g))\\n\\t\\t(unless (zero? (mark? u))\\n\\t\\t(error \\\" ♻️ t-sort:cyclic\\\" (map vertex-label (graph-cycle g))))))\\n\",\n \"language\": \"EchoLisp\"\n },\n {\n \"code\": \"(define g (make-graph \\\"VHDL\\\"))\\n(add-dependencies g dependencies)\\n(graph-print g)\\n\\n(t-sort g)\\n→ t-sort (std synopsys ieee dware dw02 dw05 dw06 dw07 gtech dw01 dw03 dw04 ramlib\\n std_cell_lib des_system_lib)\\n\\n;; Error case\\n;; add dw01 -> dw04\\n(t-sort g)\\nt-sort (std synopsys ieee dware dw02 dw05 dw06 dw07 gtech ramlib std_cell_lib)\\n⛔️ error: ♻️ t-sort:cyclic (dw04 dw01)\\t\\n\",\n \"language\": \"EchoLisp\"\n },\n {\n \"code\": \"defmodule Topological do\\n def sort(library) do\\n g = :digraph.new\\n Enum.each(library, fn {l,deps} ->\\n :digraph.add_vertex(g,l) # noop if library already added\\n Enum.each(deps, fn d -> add_dependency(g,l,d) end)\\n end)\\n if t = :digraph_utils.topsort(g) do\\n print_path(t)\\n else\\n IO.puts \\\"Unsortable contains circular dependencies:\\\"\\n Enum.each(:digraph.vertices(g), fn v ->\\n if vs = :digraph.get_short_cycle(g,v), do: print_path(vs)\\n end)\\n end\\n end\\n\\n defp print_path(l), do: IO.puts Enum.join(l, \\\" -> \\\")\\n\\n defp add_dependency(_g,l,l), do: :ok\\n defp add_dependency(g,l,d) do\\n :digraph.add_vertex(g,d) # noop if dependency already added\\n :digraph.add_edge(g,d,l) # Dependencies represented as an edge d -> l\\n end\\nend\\n\\nlibraries = [\\n des_system_lib: ~w[std synopsys std_cell_lib des_system_lib dw02 dw01 ramlib ieee]a,\\n dw01: ~w[ieee dw01 dware gtech]a,\\n dw02: ~w[ieee dw02 dware]a,\\n dw03: ~w[std synopsys dware dw03 dw02 dw01 ieee gtech]a,\\n dw04: ~w[dw04 ieee dw01 dware gtech]a,\\n dw05: ~w[dw05 ieee dware]a,\\n dw06: ~w[dw06 ieee dware]a,\\n dw07: ~w[ieee dware]a,\\n dware: ~w[ieee dware]a,\\n gtech: ~w[ieee gtech]a,\\n ramlib: ~w[std ieee]a,\\n std_cell_lib: ~w[ieee std_cell_lib]a,\\n synopsys: []\\n]\\nTopological.sort(libraries)\\n\\nIO.puts \\\"\\\"\\nbad_libraries = Keyword.update!(libraries, :dw01, &[:dw04 | &1])\\nTopological.sort(bad_libraries)\\n\",\n \"language\": \"Elixir\"\n },\n {\n \"code\": \"-module(topological_sort).\\n-compile(export_all).\\n\\n-define(LIBRARIES,\\n [{des_system_lib, [std, synopsys, std_cell_lib, des_system_lib, dw02, dw01, ramlib, ieee]},\\n {dw01, [ieee, dw01, dware, gtech]},\\n {dw02, [ieee, dw02, dware]},\\n {dw03, [std, synopsys, dware, dw03, dw02, dw01, ieee, gtech]},\\n {dw04, [dw04, ieee, dw01, dware, gtech]},\\n {dw05, [dw05, ieee, dware]},\\n {dw06, [dw06, ieee, dware]},\\n {dw07, [ieee, dware]},\\n {dware, [ieee, dware]},\\n {gtech, [ieee, gtech]},\\n {ramlib, [std, ieee]},\\n {std_cell_lib, [ieee, std_cell_lib]},\\n {synopsys, []}]).\\n\\n-define(BAD_LIBRARIES,\\n [{des_system_lib, [std, synopsys, std_cell_lib, des_system_lib, dw02, dw01, ramlib, ieee]},\\n {dw01, [ieee, dw01, dw04, dware, gtech]},\\n {dw02, [ieee, dw02, dware]},\\n {dw03, [std, synopsys, dware, dw03, dw02, dw01, ieee, gtech]},\\n {dw04, [dw04, ieee, dw01, dware, gtech]},\\n {dw05, [dw05, ieee, dware]},\\n {dw06, [dw06, ieee, dware]},\\n {dw07, [ieee, dware]},\\n {dware, [ieee, dware]},\\n {gtech, [ieee, gtech]},\\n {ramlib, [std, ieee]},\\n {std_cell_lib, [ieee, std_cell_lib]},\\n {synopsys, []}]).\\n\\nmain() ->\\n top_sort(?LIBRARIES),\\n top_sort(?BAD_LIBRARIES).\\n\\ntop_sort(Library) ->\\n G = digraph:new(),\\n lists:foreach(fun ({L,Deps}) ->\\n digraph:add_vertex(G,L), % noop if library already added\\n lists:foreach(fun (D) ->\\n add_dependency(G,L,D)\\n end, Deps)\\n end, Library),\\n T = digraph_utils:topsort(G),\\n case T of\\n false ->\\n io:format(\\\"Unsortable contains circular dependencies:~n\\\",[]),\\n lists:foreach(fun (V) ->\\n case digraph:get_short_cycle(G,V) of\\n false ->\\n ok;\\n Vs ->\\n print_path(Vs)\\n end\\n end, digraph:vertices(G));\\n _ ->\\n print_path(T)\\n end.\\n\\nprint_path(L) ->\\n lists:foreach(fun (V) -> io:format(\\\"~s -> \\\",[V]) end,\\n lists:sublist(L,length(L)-1)),\\n io:format(\\\"~s~n\\\",[lists:last(L)]).\\n\\nadd_dependency(_G,_L,_L) ->\\n ok;\\nadd_dependency(G,L,D) ->\\n digraph:add_vertex(G,D), % noop if dependency already added\\n digraph:add_edge(G,D,L). % Dependencies represented as an edge D -> L\\n\",\n \"language\": \"Erlang\"\n },\n {\n \"code\": \"62> topological_sort:main().\\nsynopsys -> std -> ieee -> dware -> dw02 -> dw05 -> ramlib -> std_cell_lib -> dw06 -> dw07 -> gtech -> dw01 -> des_system_lib -> dw03 -> dw04\\nUnsortable contains circular dependencies:\\ndw04 -> dw01 -> dw04\\ndw01 -> dw04 -> dw01\\nok\\n\",\n \"language\": \"Erlang\"\n },\n {\n \"code\": \"variable nodes 0 nodes ! \\\\ linked list of nodes\\n\\n: node. ( body -- )\\n body> >name name>string type ;\\n\\n: nodeps ( body -- )\\n \\\\ the word referenced by body has no (more) dependencies to resolve\\n ['] drop over ! node. space ;\\n\\n: processing ( body1 ... bodyn body -- body1 ... bodyn )\\n \\\\ the word referenced by body is in the middle of resolving dependencies\\n 2dup <> if \\\\ unless it is a self-reference (see task description)\\n\\t['] drop over !\\n\\t.\\\" (cycle: \\\" dup node. >r 1 begin \\\\ print the cycle\\n\\t dup pick dup r@ <> while\\n\\t\\tspace node. 1+ repeat\\n\\t.\\\" ) \\\" 2drop r>\\n\\tthen drop ;\\n\\n: >processing ( body -- body )\\n ['] processing over ! ;\\n\\n: node ( \\\"name\\\" -- )\\n \\\\ define node \\\"name\\\" and initialize it to having no dependences\\n create\\n ['] nodeps , \\\\ on definition, a node has no dependencies\\n nodes @ , lastxt nodes ! \\\\ linked list of nodes\\n does> ( -- )\\n dup @ execute ; \\\\ perform xt associated with node\\n\\n: define-nodes ( \\\"names\\\" <newline> -- )\\n \\\\ define all the names that don't exist yet as nodes\\n begin\\n\\tparse-name dup while\\n\\t 2dup find-name 0= if\\n\\t\\t2dup nextname node then\\n\\t 2drop repeat\\n 2drop ;\\n\\n: deps ( \\\"name\\\" \\\"deps\\\" <newline> -- )\\n \\\\ name is after deps. Implementation: Define missing nodes, then\\n \\\\ define a colon definition for\\n >in @ define-nodes >in !\\n ' :noname ]] >processing [[ source >in @ /string evaluate ]] nodeps ; [[\\n swap >body ! 0 parse 2drop ;\\n\\n: all-nodes ( -- )\\n \\\\ call all nodes, and they then print their dependences and themselves\\n nodes begin\\n\\t@ dup while\\n\\t dup execute\\n\\t >body cell+ repeat\\n drop ;\\n\\ndeps des_system_lib std synopsys std_cell_lib des_system_lib dw02 dw01 ramlib ieee\\ndeps dw01 ieee dw01 dware gtech\\ndeps dw02 ieee dw02 dware\\ndeps dw03 std synopsys dware dw03 dw02 dw01 ieee gtech\\ndeps dw04 dw04 ieee dw01 dware gtech\\ndeps dw05 dw05 ieee dware\\ndeps dw06 dw06 ieee dware\\ndeps dw07 ieee dware\\ndeps dware ieee dware\\ndeps gtech ieee gtech\\ndeps ramlib std ieee\\ndeps std_cell_lib ieee std_cell_lib\\ndeps synopsys\\n\\\\ to test the cycle recognition (overwrites dependences for dw1 above)\\ndeps dw01 ieee dw01 dware gtech dw04\\n\\nall-nodes\\n\",\n \"language\": \"Forth\"\n },\n {\n \"code\": \" SUBROUTINE TSORT(NL,ND,IDEP,IORD,IPOS,NO)\\n IMPLICIT NONE\\n INTEGER NL,ND,NO,IDEP(ND,2),IORD(NL),IPOS(NL),I,J,K,IL,IR,IPL,IPR\\n DO 10 I=1,NL\\n IORD(I)=I\\n 10 IPOS(I)=I\\n K=1\\n 20 J=K\\n K=NL+1\\n DO 30 I=1,ND\\n IL=IDEP(I,1)\\n IR=IDEP(I,2)\\n IPL=IPOS(IL)\\n IPR=IPOS(IR)\\n IF(IL.EQ.IR .OR. IPL.GE.K .OR. IPL.LT.J .OR. IPR.LT.J) GO TO 30\\n K=K-1\\n IPOS(IORD(K))=IPL\\n IPOS(IL)=K\\n IORD(IPL)=IORD(K)\\n IORD(K)=IL\\n 30 CONTINUE\\n IF(K.GT.J) GO TO 20\\n NO=J-1\\n END\\n\",\n \"language\": \"Fortran\"\n },\n {\n \"code\": \" PROGRAM EX_TSORT\\n IMPLICIT NONE\\n INTEGER NL,ND,NC,NO,IDEP,IORD,IPOS,ICODE,I,J,IL,IR\\n PARAMETER(NL=15,ND=44,NC=69)\\n CHARACTER*(20) LABEL\\n DIMENSION IDEP(ND,2),LABEL(NL),IORD(NL),IPOS(NL),ICODE(NC)\\n DATA LABEL/'DES_SYSTEM_LIB','DW01','DW02','DW03','DW04','DW05',\\n 1 'DW06','DW07','DWARE','GTECH','RAMLIB','STD_CELL_LIB','SYNOPSYS',\\n 2 'STD','IEEE'/\\n DATA ICODE/1,14,13,12,1,3,2,11,15,0,2,15,2,9,10,0,3,15,3,9,0,4,14,\\n 213,9,4,3,2,15,10,0,5,5,15,2,9,10,0,6,6,15,9,0,7,7,15,9,0,8,15,9,0,\\n 39,15,9,0,10,15,10,0,11,14,15,0,12,15,12,0,0/\\n\\nC DECODE DEPENDENCIES AND BUILD IDEP ARRAY\\n I=0\\n J=0\\n 10 I=I+1\\n IL=ICODE(I)\\n IF(IL.EQ.0) GO TO 30\\n 20 I=I+1\\n IR=ICODE(I)\\n IF(IR.EQ.0) GO TO 10\\n J=J+1\\n IDEP(J,1)=IL\\n IDEP(J,2)=IR\\n GO TO 20\\n 30 CONTINUE\\n\\nC SORT LIBRARIES ACCORDING TO DEPENDENCIES (TOPOLOGICAL SORT)\\n CALL TSORT(NL,ND,IDEP,IORD,IPOS,NO)\\n\\n PRINT*,'COMPILE ORDER'\\n DO 40 I=1,NO\\n 40 PRINT*,LABEL(IORD(I))\\n PRINT*,'UNORDERED LIBRARIES'\\n DO 50 I=NO+1,NL\\n 50 PRINT*,LABEL(IORD(I))\\n END\\n\",\n \"language\": \"Fortran\"\n },\n {\n \"code\": \"subroutine tsort(nl,nd,idep,iord,no)\\n\\n implicit none\\n\\n integer,intent(in) :: nl\\n integer,intent(in) :: nd\\n integer,dimension(nd,2),intent(in) :: idep\\n integer,dimension(nl),intent(out) :: iord\\n integer,intent(out) :: no\\n\\n integer :: i,j,k,il,ir,ipl,ipr,ipos(nl)\\n\\n do i=1,nl\\n iord(i)=i\\n ipos(i)=i\\n end do\\n k=1\\n do\\n j=k\\n k=nl+1\\n do i=1,nd\\n il=idep(i,1)\\n ir=idep(i,2)\\n ipl=ipos(il)\\n ipr=ipos(ir)\\n if (il==ir .or. ipl>=k .or. ipl<j .or. ipr<j) cycle\\n k=k-1\\n ipos(iord(k))=ipl\\n ipos(il)=k\\n iord(ipl)=iord(k)\\n iord(k)=il\\n end do\\n if (k<=j) exit\\n end do\\n no=j-1\\n\\nend subroutine tsort\\n\",\n \"language\": \"Fortran\"\n },\n {\n \"code\": \"def topsort( graph ) =\\n val L = seq()\\n val S = seq()\\n val g = dict( graph )\\n\\n for (v, es) <- g\\n g(v) = seq( es )\\n\\n for (v, es) <- g if es.isEmpty()\\n S.append( v )\\n\\n while not S.isEmpty()\\n val n = S.remove( 0 )\\n L.append( n )\\n\\n for (m, es) <- g if n in es\\n if (es -= n).isEmpty()\\n S.append( m )\\n\\n for (v, es) <- g\\n if not es.isEmpty()\\n return None\\n\\n Some( L.toList() )\\n\\ndependencies = '''\\n des_system_lib std synopsys std_cell_lib des_system_lib dw02 dw01 ramlib ieee\\n dw01 ieee dw01 dware gtech\\n dw02 ieee dw02 dware\\n dw03 std synopsys dware dw03 dw02 dw01 ieee gtech\\n dw04 dw04 ieee dw01 dware gtech\\n dw05 dw05 ieee dware\\n dw06 dw06 ieee dware\\n dw07 ieee dware\\n dware ieee dware\\n gtech ieee gtech\\n ramlib std ieee\\n std_cell_lib ieee std_cell_lib\\n synopsys\\n '''\\n\\n// convert dependencies data into a directed graph\\ngraph = dict()\\ndeps = set()\\n\\nfor l <- WrappedString( dependencies ).lines() if l.trim() != ''\\n case list(l.trim().split('\\\\\\\\s+')) of\\n [a] -> graph(a) = []\\n h:t ->\\n d = set( t )\\n d -= h // remove self dependencies\\n graph(h) = d\\n deps ++= t\\n\\n// add graph vertices for dependencies not appearing in left column\\nfor e <- deps if e not in graph\\n graph(e) = []\\n\\ncase topsort( graph ) of\\n None -> println( 'un-orderable' )\\n Some( ordering ) -> println( ordering )\\n\",\n \"language\": \"FunL\"\n },\n {\n \"code\": \"package main\\n\\nimport (\\n \\\"fmt\\\"\\n \\\"strings\\\"\\n)\\n\\nvar data = `\\nLIBRARY LIBRARY DEPENDENCIES\\n======= ====================\\ndes_system_lib std synopsys std_cell_lib des_system_lib dw02 dw01 ramlib ieee\\ndw01 ieee dw01 dware gtech\\ndw02 ieee dw02 dware\\ndw03 std synopsys dware dw03 dw02 dw01 ieee gtech\\ndw04 dw04 ieee dw01 dware gtech\\ndw05 dw05 ieee dware\\ndw06 dw06 ieee dware\\ndw07 ieee dware\\ndware ieee dware\\ngtech ieee gtech\\nramlib std ieee\\nstd_cell_lib ieee std_cell_lib\\nsynopsys `\\n\\nfunc main() {\\n g, in, err := parseLibComp(data)\\n if err != nil {\\n fmt.Println(err)\\n return\\n }\\n order, cyclic := topSortKahn(g, in)\\n if cyclic != nil {\\n fmt.Println(\\\"Cyclic:\\\", cyclic)\\n return\\n }\\n fmt.Println(\\\"Order:\\\", order)\\n}\\n\\ntype graph map[string][]string\\ntype inDegree map[string]int\\n\\n// parseLibComp parses the text format of the task and returns a graph\\n// representation and a list of the in-degrees of each node. The returned graph\\n// represents compile order rather than dependency order. That is, for each map\\n// map key n, the map elements are libraries that depend on n being compiled\\n// first.\\nfunc parseLibComp(data string) (g graph, in inDegree, err error) {\\n // small sanity check on input\\n lines := strings.Split(data, \\\"\\\\n\\\")\\n if len(lines) < 3 || !strings.HasPrefix(lines[2], \\\"=\\\") {\\n return nil, nil, fmt.Errorf(\\\"data format\\\")\\n }\\n // toss header lines\\n lines = lines[3:]\\n // scan and interpret input, build graph\\n g = graph{}\\n in = inDegree{}\\n for _, line := range lines {\\n libs := strings.Fields(line)\\n if len(libs) == 0 {\\n continue // allow blank lines\\n }\\n lib := libs[0]\\n g[lib] = g[lib]\\n for _, dep := range libs[1:] {\\n in[dep] = in[dep]\\n if dep == lib {\\n continue // ignore self dependencies\\n }\\n successors := g[dep]\\n for i := 0; ; i++ {\\n if i == len(successors) {\\n g[dep] = append(successors, lib)\\n in[lib]++\\n break\\n }\\n if dep == successors[i] {\\n break // ignore duplicate dependencies\\n }\\n }\\n }\\n }\\n return g, in, nil\\n}\\n\\n// General purpose topological sort, not specific to the application of\\n// library dependencies. Adapted from Wikipedia pseudo code, one main\\n// difference here is that this function does not consume the input graph.\\n// WP refers to incoming edges, but does not really need them fully represented.\\n// A count of incoming edges, or the in-degree of each node is enough. Also,\\n// WP stops at cycle detection and doesn't output information about the cycle.\\n// A little extra code at the end of this function recovers the cyclic nodes.\\nfunc topSortKahn(g graph, in inDegree) (order, cyclic []string) {\\n var L, S []string\\n // rem for \\\"remaining edges,\\\" this function makes a local copy of the\\n // in-degrees and consumes that instead of consuming an input.\\n rem := inDegree{}\\n for n, d := range in {\\n if d == 0 {\\n // accumulate \\\"set of all nodes with no incoming edges\\\"\\n S = append(S, n)\\n } else {\\n // initialize rem from in-degree\\n rem[n] = d\\n }\\n }\\n for len(S) > 0 {\\n last := len(S) - 1 // \\\"remove a node n from S\\\"\\n n := S[last]\\n S = S[:last]\\n L = append(L, n) // \\\"add n to tail of L\\\"\\n for _, m := range g[n] {\\n // WP pseudo code reads \\\"for each node m...\\\" but it means for each\\n // node m *remaining in the graph.* We consume rem rather than\\n // the graph, so \\\"remaining in the graph\\\" for us means rem[m] > 0.\\n if rem[m] > 0 {\\n rem[m]-- // \\\"remove edge from the graph\\\"\\n if rem[m] == 0 { // if \\\"m has no other incoming edges\\\"\\n S = append(S, m) // \\\"insert m into S\\\"\\n }\\n }\\n }\\n }\\n // \\\"If graph has edges,\\\" for us means a value in rem is > 0.\\n for c, in := range rem {\\n if in > 0 {\\n // recover cyclic nodes\\n for _, nb := range g[c] {\\n if rem[nb] > 0 {\\n cyclic = append(cyclic, c)\\n break\\n }\\n }\\n }\\n }\\n if len(cyclic) > 0 {\\n return nil, cyclic\\n }\\n return L, nil\\n}\\n\",\n \"language\": \"Go\"\n },\n {\n \"code\": \"// General purpose topological sort, not specific to the application of\\n// library dependencies. Also adapted from Wikipedia pseudo code.\\nfunc topSortDFS(g graph) (order, cyclic []string) {\\n L := make([]string, len(g))\\n i := len(L)\\n temp := map[string]bool{}\\n perm := map[string]bool{}\\n var cycleFound bool\\n var cycleStart string\\n var visit func(string)\\n visit = func(n string) {\\n switch {\\n case temp[n]:\\n cycleFound = true\\n cycleStart = n\\n return\\n case perm[n]:\\n return\\n }\\n temp[n] = true\\n for _, m := range g[n] {\\n visit(m)\\n if cycleFound {\\n if cycleStart > \\\"\\\" {\\n cyclic = append(cyclic, n)\\n if n == cycleStart {\\n cycleStart = \\\"\\\"\\n }\\n }\\n return\\n }\\n }\\n delete(temp, n)\\n perm[n] = true\\n i--\\n L[i] = n\\n }\\n for n := range g {\\n if perm[n] {\\n continue\\n }\\n visit(n)\\n if cycleFound {\\n return nil, cyclic\\n }\\n }\\n return L, nil\\n}\\n\",\n \"language\": \"Go\"\n },\n {\n \"code\": \"import Data.List ((\\\\\\\\), elemIndex, intersect, nub)\\nimport Data.Bifunctor (bimap, first)\\n\\ncombs 0 _ = [[]]\\ncombs _ [] = []\\ncombs k (x:xs) = ((x :) <$> combs (k - 1) xs) ++ combs k xs\\n\\ndepLibs :: [(String, String)]\\ndepLibs =\\n [ ( \\\"des_system_lib\\\"\\n , \\\"std synopsys std_cell_lib des_system_lib dw02 dw01 ramlib ieee\\\")\\n , (\\\"dw01\\\", \\\"ieee dw01 dware gtech\\\")\\n , (\\\"dw02\\\", \\\"ieee dw02 dware\\\")\\n , (\\\"dw03\\\", \\\"std synopsys dware dw03 dw02 dw01 ieee gtech\\\")\\n , (\\\"dw04\\\", \\\"dw04 ieee dw01 dware gtech\\\")\\n , (\\\"dw05\\\", \\\"dw05 ieee dware\\\")\\n , (\\\"dw06\\\", \\\"dw06 ieee dware\\\")\\n , (\\\"dw07\\\", \\\"ieee dware\\\")\\n , (\\\"dware\\\", \\\"ieee dware\\\")\\n , (\\\"gtech\\\", \\\"ieee gtech\\\")\\n , (\\\"ramlib\\\", \\\"std ieee\\\")\\n , (\\\"std_cell_lib\\\", \\\"ieee std_cell_lib\\\")\\n , (\\\"synopsys\\\", [])\\n ]\\n\\ntoposort :: [(String, String)] -> [String]\\ntoposort xs\\n | (not . null) cycleDetect =\\n error $ \\\"Dependency cycle detected for libs \\\" ++ show cycleDetect\\n | otherwise = foldl makePrecede [] dB\\n where\\n dB = (\\\\(x, y) -> (x, y \\\\\\\\ x)) . bimap return words <$> xs\\n makePrecede ts ([x], xs) =\\n nub $\\n case elemIndex x ts of\\n Just i -> uncurry (++) $ first (++ xs) $ splitAt i ts\\n _ -> ts ++ xs ++ [x]\\n cycleDetect =\\n filter ((> 1) . length) $\\n (\\\\[(a, as), (b, bs)] -> (a `intersect` bs) ++ (b `intersect` as)) <$>\\n combs 2 dB\\n\\nmain :: IO ()\\nmain = print $ toposort depLibs\\n\",\n \"language\": \"Haskell\"\n },\n {\n \"code\": \"*Main> toposort depLibs\\n[\\\"std\\\",\\\"synopsys\\\",\\\"ieee\\\",\\\"std_cell_lib\\\",\\\"dware\\\",\\\"dw02\\\",\\\"gtech\\\",\\\"dw01\\\",\\\"ramlib\\\",\\\"des_system_lib\\\",\\\"dw03\\\",\\\"dw04\\\",\\\"dw05\\\",\\\"dw06\\\",\\\"dw07\\\"]\\n\\n*Main> toposort $ (\\\\(xs,(k,ks):ys) -> xs++ (k,ks++\\\" dw04\\\"):ys) $ splitAt 1 depLibs\\n*** Exception: Dependency cycle detected for libs [[\\\"dw01\\\",\\\"dw04\\\"]]\\n\",\n \"language\": \"Haskell\"\n },\n {\n \"code\": \"import Algorithms as algo;\\nimport Text as text;\\n\\nclass DirectedGraph {\\n\\t_adjecentVertices = {};\\n\\tadd_vertex( vertex_ ) {\\n\\t\\t_adjecentVertices[vertex_] = [];\\n\\t}\\n\\tadd_edge( from_, to_ ) {\\n\\t\\t_adjecentVertices[from_].push( to_ );\\n\\t}\\n\\tadjecent_vertices( vertex_ ) {\\n\\t\\treturn ( vertex_ ∈ _adjecentVertices ? _adjecentVertices.get( vertex_ ) : [] );\\n\\t}\\n}\\n\\nclass DepthFirstSearch {\\n\\t_visited = set();\\n\\t_postOrder = [];\\n\\t_cycleDetector = set();\\n\\trun( graph_, start_ ) {\\n\\t\\t_cycleDetector.insert( start_ );\\n\\t\\t_visited.insert( start_ );\\n\\t\\tfor ( vertex : graph_.adjecent_vertices( start_ ) ) {\\n\\t\\t\\tif ( vertex == start_ ) {\\n\\t\\t\\t\\tcontinue;\\n\\t\\t\\t}\\n\\t\\t\\tif ( vertex ∈ _cycleDetector ) {\\n\\t\\t\\t\\tthrow Exception( \\\"A cycle involving vertices {} found!\\\".format( _cycleDetector ) );\\n\\t\\t\\t}\\n\\t\\t\\tif ( vertex ∉ _visited ) {\\n\\t\\t\\t\\trun( graph_, vertex );\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\t_postOrder.push( start_ );\\n\\t\\t_cycleDetector.erase( start_ );\\n\\t}\\n\\ttopological_sort( graph_ ) {\\n\\t\\tfor ( vertex : graph_._adjecentVertices ) {\\n\\t\\t\\tif ( vertex ∉ _visited ) {\\n\\t\\t\\t\\trun( graph_, vertex );\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\treturn ( _postOrder );\\n\\t}\\n}\\n\\nmain() {\\n\\trawdata =\\n\\t\\t\\\"des_system_lib | std synopsys std_cell_lib des_system_lib dw02 dw01 ramlib ieee\\\\n\\\"\\n\\t\\t\\\"dw01 | ieee dw01 dware gtech\\\\n\\\"\\n\\t\\t\\\"dw02 | ieee dw02 dware\\\\n\\\"\\n\\t\\t\\\"dw03 | std synopsys dware dw03 dw02 dw01 ieee gtech\\\\n\\\"\\n\\t\\t\\\"dw04 | dw04 ieee dw01 dware gtech\\\\n\\\"\\n\\t\\t\\\"dw05 | dw05 ieee dware\\\\n\\\"\\n\\t\\t\\\"dw06 | dw06 ieee dware\\\\n\\\"\\n\\t\\t\\\"dw07 | ieee dware\\\\n\\\"\\n\\t\\t\\\"dware | ieee dware\\\\n\\\"\\n\\t\\t\\\"gtech | ieee gtech\\\\n\\\"\\n\\t\\t\\\"ramlib | std ieee\\\\n\\\"\\n\\t\\t\\\"std_cell_lib | ieee std_cell_lib\\\\n\\\"\\n\\t\\t\\\"synopsys |\\\\n\\\";\\n\\tdg = DirectedGraph();\\n\\tfor ( l : algo.filter( text.split( rawdata, \\\"\\\\n\\\" ), @( x ) { size( x ) > 0; } ) ) {\\n\\t\\tdef = algo.materialize( algo.map( text.split( l, \\\"|\\\" ), string.strip ), list );\\n\\t\\tdg.add_vertex( def[0] );\\n\\t\\tfor ( n : algo.filter( algo.map( text.split( def[1], \\\" \\\" ), string.strip ), @( x ) { size( x ) > 0; } ) ) {\\n\\t\\t\\tdg.add_edge( def[0], n );\\n\\t\\t}\\n\\t}\\n\\tdfs = DepthFirstSearch();\\n\\tprint( \\\"{}\\\\n\\\".format( dfs.topological_sort( dg ) ) );\\n}\\n\",\n \"language\": \"Huginn\"\n },\n {\n \"code\": \"record graph(nodes,arcs)\\nglobal ex_name, in_name\\n\\nprocedure main()\\n show(tsort(getgraph()))\\nend\\n\\nprocedure tsort(g)\\n t := \\\"\\\"\\n while (n := g.nodes -- pnodes(g)) ~== \\\"\\\" do {\\n t ||:= \\\"(\\\"||n||\\\")\\\"\\n g := delete(g,n)\\n }\\n if g.nodes == '' then return t\\n write(\\\"graph contains the cycle:\\\")\\n write(\\\"\\\\t\\\",genpath(fn := !g.nodes,fn,g))\\nend\\n\\n## pnodes(g) -- return the predecessor nodes of g\\n# (those that have an arc from them)\\nprocedure pnodes(g)\\n static labels, fromnodes\\n initial {\\n labels := &ucase\\n fromnodes := 'ACEGIKMOQSUWY'\\n }\\n return cset(select(g.arcs,labels, fromnodes))\\nend\\n\\n## select(s,image,object) - efficient node selection\\nprocedure select(s,image,object)\\n slen := *s\\n ilen := *image\\n return if slen <= ilen then map(object[1+:slen/2],image[1+:slen],s)\\n else map(object,image,s[1+:ilen]) || select(s[1+ilen:0],image,object)\\nend\\n\\n## delete(g,x) -- deletes all nodes in x from graph g\\n# note that arcs must be deleted as well\\nprocedure delete(g,x)\\n t := \\\"\\\"\\n g.arcs ? while arc := move(2) do if not upto(x,arc) then t ||:= arc\\n return graph(g.nodes--x,t)\\nend\\n\\n\\n## getgraph() -- read and construct a graph\\n# graph is described via sets of arcs, as in:\\n#\\n# from to1 to2 to3\\n#\\n# external names are converted to single character names for efficiency\\n# self-referential arcs are ignored\\nprocedure getgraph()\\n static labels\\n initial labels := &cset\\n ex_name := table()\\n in_name := table()\\n count := 0\\n arcstr := \\\"\\\"\\n nodes := ''\\n every line := !&input do {\\n nextWord := create genWords(line)\\n if nfrom := @nextWord then {\\n /in_name[nfrom] := &cset[count +:= 1]\\n /ex_name[in_name[nfrom]] := nfrom\\n nodes ++:= in_name[nfrom]\\n while nto := @nextWord do {\\n if nfrom ~== nto then {\\n /in_name[nto] := &cset[count +:= 1]\\n /ex_name[in_name[nto]] := nto\\n nodes ++:= in_name[nto]\\n arcstr ||:= in_name[nfrom] || in_name[nto]\\n }\\n }\\n }\\n }\\n return graph(nodes,arcstr)\\nend\\n\\n# generate all 'words' in string\\nprocedure genWords(s)\\n static wchars\\n initial wchars := &cset -- ' \\\\t'\\n s ? while tab(upto(wchars))\\\\1 do suspend tab(many(wchars))\\\\1\\nend\\n\\n## show(t) - return the external names (in order) for the nodes in t\\n# Each output line contains names that are independent of each other\\nprocedure show(t)\\n line := \\\"\\\"\\n every n := !t do\\n case n of {\\n \\\"(\\\" : line ||:= \\\"\\\\n\\\\t(\\\"\\n \\\")\\\" : line[-1] := \\\")\\\"\\n default : line ||:= ex_name[n] || \\\" \\\"\\n }\\n write(line)\\nend\\n\\n## genpath(f,t,g) -- generate paths from f to t in g\\nprocedure genpath(f,t,g, seen)\\n /seen := ''\\n seen ++:= f\\n sn := nnodes(f,g)\\n if t ** sn == t then return ex_name[f] || \\\" -> \\\" || ex_name[t]\\n suspend ex_name[f] || \\\" -> \\\" || genpath(!(sn --seen),t,g,seen)\\nend\\n\\n## nnodes(f,g) -- compute all nodes that could follow f in g\\nprocedure nnodes(f,g)\\n t := ''\\n g.arcs ? while arc := move(2) do if arc[1] == f then t ++:= arc[2]\\n return t\\nend\\n\",\n \"language\": \"Icon\"\n },\n {\n \"code\": \"dependencySort=: monad define\\n parsed=. <@;:;._2 y\\n names=. {.&>parsed\\n depends=. (> =@i.@#) names e.S:1 parsed\\n depends=. (+. +./ .*.~)^:_ depends\\n assert.-.1 e. (<0 1)|:depends\\n (-.&names ~.;parsed),names /: +/\\\"1 depends\\n)\\n\",\n \"language\": \"J\"\n },\n {\n \"code\": \" >dependencySort dependencies\\n std\\n ieee\\n dware\\n gtech\\n ramlib\\n std_cell_lib\\n synopsys\\n dw02\\n dw05\\n dw06\\n dw07\\n dw01\\n dw04\\n dw03\\n des_system_lib\\n\",\n \"language\": \"J\"\n },\n {\n \"code\": \" dependencySort dependencies,'dw01 dw04',LF\\n|assertion failure: dependencySort\\n| -.1 e.(<0 1)|:depends\\n\",\n \"language\": \"J\"\n },\n {\n \"code\": \"depSort=: monad define\\n parsed=. <@;:;._2 y\\n names=. {.&>parsed\\n depends=. (-.L:0\\\"_1 #,.i.@#) names i.L:1 parsed\\n depends=. (~.@,&.> ;@:{L:0 1~)^:_ depends\\n assert.-.1 e. (i.@# e.S:0\\\"0 ])depends\\n (-.&names ~.;parsed),names /: #@> depends\\n)\\n\",\n \"language\": \"J\"\n },\n {\n \"code\": \"import java.util.*;\\n\\npublic class TopologicalSort {\\n\\n public static void main(String[] args) {\\n String s = \\\"std, ieee, des_system_lib, dw01, dw02, dw03, dw04, dw05,\\\"\\n + \\\"dw06, dw07, dware, gtech, ramlib, std_cell_lib, synopsys\\\";\\n\\n Graph g = new Graph(s, new int[][]{\\n {2, 0}, {2, 14}, {2, 13}, {2, 4}, {2, 3}, {2, 12}, {2, 1},\\n {3, 1}, {3, 10}, {3, 11},\\n {4, 1}, {4, 10},\\n {5, 0}, {5, 14}, {5, 10}, {5, 4}, {5, 3}, {5, 1}, {5, 11},\\n {6, 1}, {6, 3}, {6, 10}, {6, 11},\\n {7, 1}, {7, 10},\\n {8, 1}, {8, 10},\\n {9, 1}, {9, 10},\\n {10, 1},\\n {11, 1},\\n {12, 0}, {12, 1},\\n {13, 1}\\n });\\n\\n System.out.println(\\\"Topologically sorted order: \\\");\\n System.out.println(g.topoSort());\\n }\\n}\\n\\nclass Graph {\\n String[] vertices;\\n boolean[][] adjacency;\\n int numVertices;\\n\\n public Graph(String s, int[][] edges) {\\n vertices = s.split(\\\",\\\");\\n numVertices = vertices.length;\\n adjacency = new boolean[numVertices][numVertices];\\n\\n for (int[] edge : edges)\\n adjacency[edge[0]][edge[1]] = true;\\n }\\n\\n List<String> topoSort() {\\n List<String> result = new ArrayList<>();\\n List<Integer> todo = new LinkedList<>();\\n\\n for (int i = 0; i < numVertices; i++)\\n todo.add(i);\\n\\n try {\\n outer:\\n while (!todo.isEmpty()) {\\n for (Integer r : todo) {\\n if (!hasDependency(r, todo)) {\\n todo.remove(r);\\n result.add(vertices[r]);\\n // no need to worry about concurrent modification\\n continue outer;\\n }\\n }\\n throw new Exception(\\\"Graph has cycles\\\");\\n }\\n } catch (Exception e) {\\n System.out.println(e);\\n return null;\\n }\\n return result;\\n }\\n\\n boolean hasDependency(Integer r, List<Integer> todo) {\\n for (Integer c : todo) {\\n if (adjacency[r][c])\\n return true;\\n }\\n return false;\\n }\\n}\\n\",\n \"language\": \"Java\"\n },\n {\n \"code\": \"const libs =\\n `des_system_lib std synopsys std_cell_lib des_system_lib dw02 dw01 ramlib ieee\\n dw01 ieee dw01 dware gtech\\n dw02 ieee dw02 dware\\n dw03 std synopsys dware dw03 dw02 dw01 ieee gtech\\n dw04 dw04 ieee dw01 dware gtech\\n dw05 dw05 ieee dware\\n dw06 dw06 ieee dware\\n dw07 ieee dware\\n dware ieee dware\\n gtech ieee gtech\\n ramlib std ieee\\n std_cell_lib ieee std_cell_lib\\n synopsys`;\\n\\n// A map of the input data, with the keys as the packages, and the values as\\n// and array of packages on which it depends.\\nconst D = libs\\n .split('\\\\n')\\n .map(e => e.split(' ').filter(e => e != ''))\\n .reduce((p, c) =>\\n p.set(c[0], c.filter((e, i) => i > 0 && e !== c[0] ? e : null)), new Map());\\n[].concat(...D.values()).forEach(e => {\\n D.set(e, D.get(e) || [])\\n});\\n\\n// The above map rotated so that it represents a DAG of the form\\n// Map {\\n// A => [ A, B, C],\\n// B => [C],\\n// C => []\\n// }\\n// where each key represents a node, and the array contains the edges.\\nconst G = [...D.keys()].reduce((p, c) =>\\n p.set(\\n c,\\n [...D.keys()].filter(e => D.get(e).includes(c))),\\n new Map()\\n);\\n\\n// An array of leaf nodes; nodes with 0 in degrees.\\nconst Q = [...D.keys()].filter(e => D.get(e).length == 0);\\n\\n// The result array.\\nconst S = [];\\nwhile (Q.length) {\\n const u = Q.pop();\\n S.push(u);\\n G.get(u).forEach(v => {\\n D.set(v, D.get(v).filter(e => e !== u));\\n if (D.get(v).length == 0) {\\n Q.push(v);\\n }\\n });\\n}\\n\\nconsole.log('Solution:', S);\\n\",\n \"language\": \"JavaScript\"\n },\n {\n \"code\": \"Solution: [\\n 'ieee',\\n 'std_cell_lib',\\n 'gtech',\\n 'dware',\\n 'dw07',\\n 'dw06',\\n 'dw05',\\n 'dw02',\\n 'dw01',\\n 'dw04',\\n 'std',\\n 'ramlib',\\n 'synopsys',\\n 'dw03',\\n 'des_system_lib' ]\\n\",\n \"language\": \"JavaScript\"\n },\n {\n \"code\": \"# independent/0 emits an array of the dependencies that have no dependencies\\n# Input: an object representing a normalized dependency graph\\ndef independent:\\n . as $G\\n | reduce keys[] as $key\\n ([];\\n . + ((reduce $G[$key][] as $node\\n ([];\\n if ($G[$node] == null or ($G[$node]|length)==0) then . + [$node]\\n else .\\n end ))))\\n | unique;\\n\\n# normalize/0 eliminates self-dependencies in the input dependency graph.\\n# Input: an object representing a dependency graph.\\ndef normalize:\\n . as $G\\n | reduce keys[] as $key\\n ($G;\\n .[$key] as $nodes\\n | if $nodes and ($nodes|index($key)) then .[$key] = $nodes - [$key] else . end);\\n\\n\\n# minus/1 removes all the items in ary from each of the values in the input object\\n# Input: an object representing a dependency graph\\ndef minus(ary):\\n . as $G | with_entries(.value -= ary);\\n\\n# tsort/0 emits the topologically sorted nodes of the input,\\n# in \\\">\\\" order.\\n# Input is assumed to be an object representing a dependency\\n# graph and need not be normalized.\\ndef tsort:\\n # _sort: input: [L, Graph], where L is the tsort so far\\n def _tsort:\\n\\n def done: [.[]] | all( length==0 );\\n\\n .[0] as $L | .[1] as $G\\n | if ($G|done) then $L + (($G|keys) - $L)\\n else\\n ($G|independent) as $I\\n | if (($I|length) == 0)\\n then error(\\\"the dependency graph is cyclic: \\\\($G)\\\")\\n else [ ($L + $I), ($G|minus($I))] | _tsort\\n end\\n end;\\n\\n normalize | [[], .] | _tsort ;\\n\\ntsort\\n\",\n \"language\": \"Jq\"\n },\n {\n \"code\": \"{\\\"des_system_lib\\\": [ \\\"std\\\", \\\"synopsys\\\", \\\"std_cell_lib\\\", \\\"des_system_lib\\\", \\\"dw02\\\", \\\"dw01\\\", \\\"ramlib\\\", \\\"ieee\\\"],\\n \\\"dw01\\\": [ \\\"ieee\\\", \\\"dw01\\\", \\\"dware\\\", \\\"gtech\\\"],\\n \\\"dw02\\\": [ \\\"ieee\\\", \\\"dw02\\\", \\\"dware\\\"],\\n \\\"dw03\\\": [ \\\"std\\\", \\\"synopsys\\\", \\\"dware\\\", \\\"dw03\\\", \\\"dw02\\\", \\\"dw01\\\", \\\"ieee\\\", \\\"gtech\\\"],\\n \\\"dw04\\\": [ \\\"dw04\\\", \\\"ieee\\\", \\\"dw01\\\", \\\"dware\\\", \\\"gtech\\\"],\\n \\\"dw05\\\": [ \\\"dw05\\\", \\\"ieee\\\", \\\"dware\\\"],\\n \\\"dw06\\\": [ \\\"dw06\\\", \\\"ieee\\\", \\\"dware\\\"],\\n \\\"dw07\\\": [ \\\"ieee\\\", \\\"dware\\\"],\\n \\\"dware\\\": [ \\\"ieee\\\", \\\"dware\\\"],\\n \\\"gtech\\\": [ \\\"ieee\\\", \\\"gtech\\\"],\\n \\\"ramlib\\\": [ \\\"std\\\", \\\"ieee\\\"],\\n \\\"std_cell_lib\\\": [ \\\"ieee\\\", \\\"std_cell_lib\\\"],\\n \\\"synopsys\\\": []\\n}\\n\",\n \"language\": \"Jq\"\n },\n {\n \"code\": \"$ jq -c -f tsort.jq tsort.json\\n[\\\"ieee\\\",\\\"std\\\",\\\"synopsys\\\",\\\"dware\\\",\\\"gtech\\\",\\\"ramlib\\\",\\\"std_cell_lib\\\",\\\"dw01\\\",\\\"dw02\\\",\\\"des_system_lib\\\",\\\"dw03\\\",\\\"dw04\\\",\\\"dw05\\\",\\\"dw06\\\",\\\"dw07\\\"]\\n\",\n \"language\": \"Jq\"\n },\n {\n \"code\": \"function toposort(data::Dict{T,Set{T}}) where T\\n data = copy(data)\\n for (k, v) in data\\n delete!(v, k)\\n end\\n extraitems = setdiff(reduce(∪, values(data)), keys(data))\\n for item in extraitems\\n data[item] = Set{T}()\\n end\\n rst = Vector{T}()\\n while true\\n ordered = Set(item for (item, dep) in data if isempty(dep))\\n if isempty(ordered) break end\\n append!(rst, ordered)\\n data = Dict{T,Set{T}}(item => setdiff(dep, ordered) for (item, dep) in data if item ∉ ordered)\\n end\\n @assert isempty(data) \\\"a cyclic dependency exists amongst $(keys(data))\\\"\\n return rst\\nend\\n\\ndata = Dict{String,Set{String}}(\\n \\\"des_system_lib\\\" => Set(split(\\\"std synopsys std_cell_lib des_system_lib dw02 dw01 ramlib ieee\\\")),\\n \\\"dw01\\\" => Set(split(\\\"ieee dw01 dware gtech\\\")),\\n \\\"dw02\\\" => Set(split(\\\"ieee dw02 dware\\\")),\\n \\\"dw03\\\" => Set(split(\\\"std synopsys dware dw03 dw02 dw01 ieee gtech\\\")),\\n \\\"dw04\\\" => Set(split(\\\"dw04 ieee dw01 dware gtech\\\")),\\n \\\"dw05\\\" => Set(split(\\\"dw05 ieee dware\\\")),\\n \\\"dw06\\\" => Set(split(\\\"dw06 ieee dware\\\")),\\n \\\"dw07\\\" => Set(split(\\\"ieee dware\\\")),\\n \\\"dware\\\" => Set(split(\\\"ieee dware\\\")),\\n \\\"gtech\\\" => Set(split(\\\"ieee gtech\\\")),\\n \\\"ramlib\\\" => Set(split(\\\"std ieee\\\")),\\n \\\"std_cell_lib\\\" => Set(split(\\\"ieee std_cell_lib\\\")),\\n \\\"synopsys\\\" => Set(),\\n )\\n\\nprintln(\\\"# Topologically sorted:\\\\n - \\\", join(toposort(data), \\\"\\\\n - \\\"))\\n\",\n \"language\": \"Julia\"\n },\n {\n \"code\": \"// version 1.1.51\\n\\nval s = \\\"std, ieee, des_system_lib, dw01, dw02, dw03, dw04, dw05, \\\" +\\n \\\"dw06, dw07, dware, gtech, ramlib, std_cell_lib, synopsys\\\"\\n\\nval deps = mutableListOf(\\n 2 to 0, 2 to 14, 2 to 13, 2 to 4, 2 to 3, 2 to 12, 2 to 1,\\n 3 to 1, 3 to 10, 3 to 11,\\n 4 to 1, 4 to 10,\\n 5 to 0, 5 to 14, 5 to 10, 5 to 4, 5 to 3, 5 to 1, 5 to 11,\\n 6 to 1, 6 to 3, 6 to 10, 6 to 11,\\n 7 to 1, 7 to 10,\\n 8 to 1, 8 to 10,\\n 9 to 1, 9 to 10,\\n 10 to 1,\\n 11 to 1,\\n 12 to 0, 12 to 1,\\n 13 to 1\\n)\\n\\nclass Graph(s: String, edges: List<Pair<Int,Int>>) {\\n\\n val vertices = s.split(\\\", \\\")\\n val numVertices = vertices.size\\n val adjacency = List(numVertices) { BooleanArray(numVertices) }\\n\\n init {\\n for (edge in edges) adjacency[edge.first][edge.second] = true\\n }\\n\\n fun hasDependency(r: Int, todo: List<Int>): Boolean {\\n return todo.any { adjacency[r][it] }\\n }\\n\\n fun topoSort(): List<String>? {\\n val result = mutableListOf<String>()\\n val todo = MutableList<Int>(numVertices) { it }\\n try {\\n outer@ while(!todo.isEmpty()) {\\n for ((i, r) in todo.withIndex()) {\\n if (!hasDependency(r, todo)) {\\n todo.removeAt(i)\\n result.add(vertices[r])\\n continue@outer\\n }\\n }\\n throw Exception(\\\"Graph has cycles\\\")\\n }\\n }\\n catch (e: Exception) {\\n println(e)\\n return null\\n }\\n return result\\n }\\n}\\n\\nfun main(args: Array<String>) {\\n val g = Graph(s, deps)\\n println(\\\"Topologically sorted order:\\\")\\n println(g.topoSort())\\n println()\\n // now insert 3 to 6 at index 10 of deps\\n deps.add(10, 3 to 6)\\n val g2 = Graph(s, deps)\\n println(\\\"Following the addition of dw04 to the dependencies of dw01:\\\")\\n println(g2.topoSort())\\n}\\n\",\n \"language\": \"Kotlin\"\n },\n {\n \"code\": \"val graph = mapOf(\\n \\\"des_system_lib\\\" to \\\"std synopsys std_cell_lib des_system_lib dw02 dw01 ramlib ieee\\\".split(\\\" \\\").toSet(),\\n \\\"dw01\\\" to \\\"ieee dw01 dware gtech\\\".split(\\\" \\\").toSet(),\\n \\\"dw02\\\" to \\\"ieee dw02 dware\\\".split(\\\" \\\").toSet(),\\n \\\"dw03\\\" to \\\"std synopsys dware dw03 dw02 dw01 ieee gtech\\\".split(\\\" \\\").toSet(),\\n \\\"dw04\\\" to \\\"dw04 ieee dw01 dware gtech\\\".split(\\\" \\\").toSet(),\\n \\\"dw05\\\" to \\\"dw05 ieee dware\\\".split(\\\" \\\").toSet(),\\n \\\"dw06\\\" to \\\"dw06 ieee dware\\\".split(\\\" \\\").toSet(),\\n \\\"dw07\\\" to \\\"ieee dware\\\".split(\\\" \\\").toSet(),\\n \\\"dware\\\" to \\\"ieee dware\\\".split(\\\" \\\").toSet(),\\n \\\"gtech\\\" to \\\"ieee gtech\\\".split(\\\" \\\").toSet(),\\n \\\"ramlib\\\" to \\\"std ieee\\\".split(\\\" \\\").toSet(),\\n \\\"std_cell_lib\\\" to \\\"ieee std_cell_lib\\\".split(\\\" \\\").toSet(),\\n \\\"synopsys\\\" to setOf()\\n)\\n\\nfun toposort( graph: Map<String,Set<String>> ): List<List<String>> {\\n var data = graph.map { (k,v) -> k to v.toMutableSet() }.toMap().toMutableMap()\\n\\n // ignore self dependancies\\n data = data.map { (k,v) -> v.remove(k); k to v }.toMap().toMutableMap()\\n\\n val extraItemsInDeps = data.values.reduce { a,b -> a.union( b ).toMutableSet() } - data.keys.toSet()\\n\\n data.putAll( extraItemsInDeps.map { it to mutableSetOf<String>() }.toMap() )\\n\\n val res = mutableListOf<List<String>>()\\n mainloop@ while( true ) {\\n innerloop@ while( true ) {\\n val ordered = data.filter{ (_,v) -> v.isEmpty() }.map { (k,_) -> k }\\n if( ordered.isEmpty() )\\n break@innerloop\\n\\n res.add( ordered )\\n data = data.filter { (k,_) -> !ordered.contains(k) }.map { (k,v) -> v.removeAll(ordered); k to v }.toMap().toMutableMap()\\n }\\n\\n if( data.isNotEmpty() )\\n throw Exception( \\\"A cyclic dependency exists amongst: ${data.toList().joinToString { \\\",\\\" }}\\\" )\\n else\\n break@mainloop\\n }\\n\\n return res\\n}\\n\\n\\nfun main( args: Array<String> ) {\\n val result = toposort( graph )\\n println( \\\"sorted dependencies:[\\\\n${result.joinToString( \\\",\\\\n\\\")}\\\\n]\\\" )\\n}\\n\",\n \"language\": \"Kotlin\"\n },\n {\n \"code\": \"Module testthis {\\n\\t\\\\\\\\ empty stack\\n\\tFlush\\n\\tinventory LL\\n\\tappend LL, \\\"des_system_lib\\\":=(List:=\\\"std\\\", \\\"synopsys\\\", \\\"std_cell_lib\\\", \\\"des_system_lib\\\", \\\"dw02\\\", \\\"dw01\\\", \\\"ramlib\\\", \\\"ieee\\\")\\nREM\\tappend LL, \\\"dw01\\\":=(List:=\\\"dw04\\\",\\\"ieee\\\", \\\"dw01\\\", \\\"dware\\\", \\\"gtech\\\")\\n\\tappend LL, \\\"dw01\\\":=(List:=\\\"ieee\\\", \\\"dw01\\\", \\\"dware\\\", \\\"gtech\\\")\\n\\tappend LL, \\\"dw02\\\":=(List:=\\\"ieee\\\", \\\"dw02\\\", \\\"dware\\\")\\n\\tappend LL, \\\"dw03\\\":=(List:=\\\"std\\\", \\\"synopsys\\\", \\\"dware\\\", \\\"dw03\\\", \\\"dw02\\\", \\\"dw01\\\", \\\"ieee\\\", \\\"gtech\\\")\\n\\tappend LL, \\\"dw04\\\":=(List:= \\\"ieee\\\", \\\"dw01\\\", \\\"dware\\\", \\\"gtech\\\")\\n\\tappend LL, \\\"dw05\\\":=(List:=\\\"dw05\\\", \\\"ieee\\\", \\\"dware\\\")\\n\\tappend LL, \\\"dw06\\\":=(List:=\\\"dw06\\\", \\\"ieee\\\", \\\"dware\\\")\\n\\tappend LL, \\\"dw07\\\":=(List:=\\\"ieee\\\", \\\"dware\\\")\\n\\tappend LL, \\\"dware\\\":=(List:=\\\"ieee\\\", \\\"dware\\\")\\n\\tappend LL, \\\"gtech\\\":=(List:=\\\"ieee\\\", \\\"gtech\\\")\\n\\tappend LL, \\\"ramlib\\\":=(List:=\\\"std\\\", \\\"ieee\\\")\\n\\tappend LL, \\\"std_cell_lib\\\":=(List:=\\\"ieee\\\", \\\"std_cell_lib\\\")\\n\\tappend LL, \\\"synopsys\\\":=List\\n\\t\\\\\\\\ inventory itmes may have keys/items or keys.\\n\\t\\\\\\\\ here we have keys so keys return as item also\\n\\t\\\\\\\\ when we place an item in a key (an empty string) ...\\n\\t\\\\\\\\ we mark the item to not return the key but an empty string\\n\\tinventory final\\n\\tmm=each(LL)\\n\\twhile mm\\n\\t\\tk$=eval$(mm!)\\n\\t\\tm=eval(mm)\\n\\t\\tmmm=each(m)\\n\\t\\tWhile mmm\\n\\t\\t\\tk1$=eval$(mmm!)\\n\\t\\t\\tif not exist(LL, k1$) then\\n\\t\\t\\t\\tif not exist(final, k1$) then append final, k1$\\n\\t\\t\\t\\treturn m, k1$:=\\\"\\\" \\\\\\\\ mark that item\\n\\t\\t\\telse\\n\\t\\t\\t\\tmmmm=Eval(LL)\\n\\t\\t\\t\\tif len(mmmm)=0 then\\n\\t\\t\\t\\t\\tif not exist(final, k1$) then append final, k1$\\n\\t\\t\\t\\t\\treturn m, k1$:=\\\"\\\" \\\\\\\\ mark that item\\n\\t\\t\\t\\tend if\\n\\t\\t\\tend if\\n\\t\\tend while\\n\\tend while\\n\\tmm=each(LL)\\n\\twhile mm\\n\\t\\t\\\\\\\\ using eval$(mm!) we read the key as string\\n\\t\\tk$=eval$(mm!)\\n\\t\\tif exist(final, k$) then continue\\n\\t\\tm=eval(mm)\\n\\t\\tmmm=each(m)\\n\\t\\tWhile mmm\\n\\t\\t\\t\\\\\\\\ we read the item, if no item exist we get the key\\n\\t\\t\\tk1$=eval$(mmm)\\n\\t\\t\\tif k1$=\\\"\\\" then continue\\n\\t\\t\\tif exist(final, k1$) then continue\\n\\t\\t\\tdata k1$ \\\\\\\\ push to end to stack\\n\\t\\tend while\\n\\t\\twhile not empty\\n\\t\\t\\tread k1$\\n\\t\\t\\tif exist(final, k1$) then continue\\n\\t\\t\\tm=LL(k1$)\\n\\t\\t\\tmmm=each(m)\\n\\t\\t\\tdelthis=0\\n\\t\\t\\tWhile mmm\\n\\t\\t\\t\\tk2$=eval$(mmm)\\n\\t\\t\\t\\tif k2$=\\\"\\\" then continue\\n\\t\\t\\t\\tif k1$=k2$ then continue\\n\\t\\t\\t\\tif exist(final, k2$) then continue\\n\\t\\t\\t\\tpush k2$ \\\\\\\\ push to top of stack\\n\\t\\t\\t\\treturn m, k2$:=\\\"\\\"\\n\\t\\t\\t\\tdelthis++\\n\\t\\t\\tend while\\n\\t\\t\\tif delthis=0 then\\n\\t\\t\\t\\tif not exist(final, k1$) then\\n\\t\\t\\t\\t\\tmmm=each(m)\\n\\t\\t\\t\\t\\tWhile mmm\\n\\t\\t\\t\\t\\t\\tk2$=eval$(mmm!)\\n\\t\\t\\t\\t\\t\\tif k2$=k1$ then continue\\n\\t\\t\\t\\t\\t\\tif exist(final, k2$) Else\\n\\t\\t\\t\\t\\t\\t\\tPrint \\\"unsorted:\\\";k1$, k2$\\n\\t\\t\\t\\t\\t\\tend if\\n\\t\\t\\t\\t\\tend while\\n\\t\\t\\t \\t\\tappend final, k1$ : Return LL, k1$:=List\\n\\t\\t\\t\\tend if\\n\\t\\t\\tend if\\n\\t\\tend while\\n\\t\\tif not exist(final, k$) then append final, k$\\n\\tend while\\n\\tdocument doc$\\n\\tret=each(final,1, -2)\\n\\twhile ret\\n\\t\\tdoc$=eval$(ret)+\\\" -> \\\"\\n\\tend while\\n\\tdoc$=final$(len(final)-1!)\\n\\tReport doc$\\n\\tclipboard doc$\\n}\\ntestthis\\n\",\n \"language\": \"M2000-Interpreter\"\n },\n {\n \"code\": \"TopologicalSort[\\n Graph[Flatten[# /. {l_, ld_} :>\\n Map[# -> l &,\\n DeleteCases[ld, l]]]]] /. {_TopologicalSort -> $Failed} &@\\n {{\\\"des_system_lib\\\", {\\\"std\\\", \\\"synopsys\\\", \\\"std_cell_lib\\\",\\n \\\"des_system_lib\\\", \\\"dw02\\\", \\\"dw01\\\", \\\"ramlib\\\", \\\"ieee\\\"}},\\n {\\\"dw01\\\", {\\\"ieee\\\", \\\"dw01\\\", \\\"dware\\\", \\\"gtech\\\"}},\\n {\\\"dw02\\\", {\\\"ieee\\\", \\\"dw02\\\", \\\"dware\\\"}},\\n {\\\"dw03\\\", {\\\"std\\\", \\\"synopsys\\\", \\\"dware\\\", \\\"dw03\\\", \\\"dw02\\\", \\\"dw01\\\",\\n \\\"ieee\\\", \\\"gtech\\\"}},\\n {\\\"dw04\\\", {\\\"dw04\\\", \\\"ieee\\\", \\\"dw01\\\", \\\"dware\\\", \\\"gtech\\\"}},\\n {\\\"dw05\\\", {\\\"dw05\\\", \\\"ieee\\\", \\\"dware\\\"}},\\n {\\\"dw06\\\", {\\\"dw06\\\", \\\"ieee\\\", \\\"dware\\\"}},\\n {\\\"dw07\\\", {\\\"ieee\\\", \\\"dware\\\"}},\\n {\\\"dware\\\", {\\\"ieee\\\", \\\"dware\\\"}},\\n {\\\"gtech\\\", {\\\"ieee\\\", \\\"gtech\\\"}},\\n {\\\"ramlib\\\", {\\\"std\\\", \\\"ieee\\\"}},\\n {\\\"std_cell_lib\\\", {\\\"ieee\\\", \\\"std_cell_lib\\\"}},\\n {\\\"synopsys\\\", {}}}\\n\",\n \"language\": \"Mathematica\"\n },\n {\n \"code\": \":- module topological_sort.\\n\\n:- interface.\\n\\n:- import_module io.\\n:- pred main(io::di,io::uo) is det.\\n\\n\\n:- implementation.\\n:- import_module string, solutions, list, set, require.\\n\\n:- pred min_element(set(T),pred(T,T),T).\\n:- mode min_element(in,pred(in,in) is semidet,out) is nondet.\\nmin_element(_,_,_):-fail.\\nmin_element(S,P,X):-\\n member(X,S),\\n filter((pred(Y::in) is semidet :- P(Y,X)),S,LowerThanX),\\n is_empty(LowerThanX).\\n\\n\\n\\n:- pred topological_sort(set(T),pred(T,T),list(T),list(T)).\\n:- mode topological_sort(in,(pred((ground >> ground), (ground >> ground)) is semidet),in,out) is nondet.\\n:- pred topological_sort(set(T),pred(T,T),list(T)).\\n:- mode topological_sort(in,(pred((ground >> ground), (ground >> ground)) is semidet),out) is nondet.\\n\\ntopological_sort(S,P,Ac,L) :-\\n (\\n\\tis_empty(S) -> L is Ac\\n ; solutions(\\n\\t pred(X::out) is nondet:-\\n\\t\\tmin_element(S,P,X)\\n\\t , Solutions\\n\\t),\\n\\t(\\n\\t is_empty(Solutions) -> error(\\\"No solution detected.\\\\n\\\")\\n\\t; delete_list(Solutions,S,Sprime),\\n\\t append(Solutions,Ac,AcPrime),\\n\\t topological_sort(Sprime,P,AcPrime,L)\\n\\t)\\n ).\\n\\ntopological_sort(S,P,L) :- topological_sort(S,P,[],L).\\n\\n\\n:- pred distribute(list(T)::in,{T,list(T)}::out) is det.\\ndistribute([],_):-error(\\\"Error in distribute\\\").\\ndistribute([H|T],Z) :- Z = {H,T}.\\n\\n:- pred db_compare({string,list(string)}::in,{string,list(string)}::in) is semidet.\\ndb_compare({X1,L1},{X2,_}) :- not(X1=X2),list.member(X2,L1).\\n\\n\\nmain(!IO) :-\\n Input = [\\n\\\"des_system_lib std synopsys std_cell_lib des_system_lib dw02 dw01 ramlib ieee\\\",\\n\\\"dw01 ieee dw01 dware gtech\\\",\\n\\\"dw02 ieee dw02 dware\\\",\\n\\\"dw03 std synopsys dware dw03 dw02 dw01 ieee gtech\\\",\\n\\\"dw04 dw04 ieee dw01 dware gtech\\\",\\n\\\"dw05 dw05 ieee dware\\\",\\n\\\"dw06 dw06 ieee dware\\\",\\n\\\"dw07 ieee dware\\\",\\n\\\"dware ieee dware\\\",\\n\\\"gtech ieee gtech\\\",\\n\\\"ramlib std ieee\\\",\\n\\\"std_cell_lib ieee std_cell_lib\\\",\\n\\\"synopsys\\\"],\\n Words=list.map(string.words,Input),\\n list.map(distribute,Words,Db),\\n solutions(pred(X::out) is nondet :- topological_sort(set.from_list(Db),db_compare,X),SortedWordLists),\\n list.map(\\n\\t pred({X,Y}::in,Z::out) is det:- X=Z,\\n\\t list.det_head(SortedWordLists),\\n\\t CompileOrder),\\n print(CompileOrder,!IO).\\n\",\n \"language\": \"Mercury\"\n },\n {\n \"code\": \"import sequtils, strutils, sets, tables, sugar\\n\\ntype StringSet = HashSet[string]\\n\\n\\nproc topSort(data: var OrderedTable[string, StringSet]) =\\n ## Topologically sort the data in place.\\n\\n var ranks: Table[string, Natural] # Maps the keys to a rank.\\n\\n # Remove self dependencies.\\n for key, values in data.mpairs:\\n values.excl key\\n\\n # Add extra items (i.e items present in values but not in keys).\\n for values in toSeq(data.values):\\n for value in values:\\n if value notin data:\\n data[value] = initHashSet[string]()\\n\\n # Find ranks.\\n var deps = data # Working copy of the table.\\n var rank = 0\\n while deps.len > 0:\\n\\n # Find a key with an empty dependency set.\\n var keyToRemove: string\\n for key, values in deps.pairs:\\n if values.card == 0:\\n keyToRemove = key\\n break\\n if keyToRemove.len == 0:\\n # Not found: there is a cycle.\\n raise newException(ValueError, \\\"Unorderable items found: \\\" & toSeq(deps.keys).join(\\\", \\\"))\\n\\n # Assign a rank to the key and remove it from keys and values.\\n ranks[keyToRemove] = rank\\n inc rank\\n deps.del keyToRemove\\n for k, v in deps.mpairs:\\n v.excl keyToRemove\\n\\n # Sort the original data according to the ranks.\\n data.sort((x, y) => cmp(ranks[x[0]], ranks[y[0]]))\\n\\n\\nwhen isMainModule:\\n\\n const Data = {\\\"des_system_lib\\\": [\\\"std\\\", \\\"synopsys\\\", \\\"std_cell_lib\\\",\\n \\\"des_system_lib\\\", \\\"dw02\\\", \\\"dw01\\\",\\n \\\"ramlib\\\", \\\"ieee\\\"].toHashSet,\\n \\\"dw01\\\": [\\\"ieee\\\", \\\"dw01\\\", \\\"dware\\\", \\\"gtech\\\"].toHashSet,\\n \\\"dw02\\\": [\\\"ieee\\\", \\\"dw02\\\", \\\"dware\\\"].toHashSet,\\n \\\"dw03\\\": [\\\"std\\\", \\\"synopsys\\\", \\\"dware\\\", \\\"dw03\\\",\\n \\\"dw02\\\", \\\"dw01\\\", \\\"ieee\\\", \\\"gtech\\\"].toHashSet,\\n \\\"dw04\\\": [\\\"dw04\\\", \\\"ieee\\\", \\\"dw01\\\", \\\"dware\\\", \\\"gtech\\\"].toHashSet,\\n \\\"dw05\\\": [\\\"dw05\\\", \\\"ieee\\\", \\\"dware\\\"].toHashSet,\\n \\\"dw06\\\": [\\\"dw06\\\", \\\"ieee\\\", \\\"dware\\\"].toHashSet,\\n \\\"dw07\\\": [\\\"ieee\\\", \\\"dware\\\"].toHashSet,\\n \\\"dware\\\": [\\\"ieee\\\", \\\"dware\\\"].toHashSet,\\n \\\"gtech\\\": [\\\"ieee\\\", \\\"gtech\\\"].toHashSet,\\n \\\"ramlib\\\": [\\\"std\\\", \\\"ieee\\\"].toHashSet,\\n \\\"std_cell_lib\\\": [\\\"ieee\\\", \\\"std_cell_lib\\\"].toHashSet,\\n \\\"synopsys\\\": initHashSet[string]()}.toOrderedTable\\n\\n # Process the original data (without cycle).\\n echo \\\"Data without cycle. Order after sorting:\\\"\\n var data = Data\\n try:\\n data.topSort()\\n for key in data.keys: echo key\\n except ValueError:\\n echo getCurrentExceptionMsg()\\n\\n # Process the modified data (with a cycle).\\n echo \\\"\\\\nData with a cycle:\\\"\\n data = Data\\n data[\\\"dw01\\\"].incl \\\"dw04\\\"\\n try:\\n data.topSort()\\n for key in data.keys: echo key\\n except ValueError:\\n echo getCurrentExceptionMsg()\\n\",\n \"language\": \"Nim\"\n },\n {\n \"code\": \"program topologicalsortrosetta;\\n\\n{*\\nTopological sorter to parse e.g. dependencies.\\nWritten for FreePascal 2.4.x/2.5.1. Probably works in Delphi, but you'd have to\\nchange some units.\\n*}\\n{$IFDEF FPC}\\n// FreePascal-specific setup\\n{$mode objfpc}\\nuses {$IFDEF UNIX}\\n cwstring, {* widestring support for unix *} {$IFDEF UseCThreads}\\n cthreads, {$ENDIF UseCThreads} {$ENDIF UNIX}\\n Classes,\\n SysUtils;\\n{$ENDIF}\\n\\ntype\\n RNodeIndex = record\\n NodeName: WideString; //Name of the node\\n //Index: integer; //Index number used in DepGraph. For now, we can distill the index from the array index. If we want to use a TList or similar, we'd need an index property\\n Order: integer; //Order when sorted\\n end;\\n\\n RDepGraph = record\\n Node: integer; //Refers to Index in NodeIndex\\n DependsOn: integer; //The Node depends on this other Node.\\n end;\\n\\n { TTopologicalSort }\\n\\n TTopologicalSort = class(TObject)\\n private\\n Nodes: array of RNodeIndex;\\n DependencyGraph: array of RDepGraph;\\n FCanBeSorted: boolean;\\n function SearchNode(NodeName: WideString): integer;\\n function SearchIndex(NodeID: integer): WideString;\\n function DepFromNodeID(NodeID: integer): integer;\\n function DepFromDepID(DepID: integer): integer;\\n function DepFromNodeIDDepID(NodeID, DepID: integer): integer;\\n procedure DelDependency(const Index: integer);\\n public\\n constructor Create;\\n destructor Destroy; override;\\n procedure SortOrder(var Output: TStringList);\\n procedure AddNode(NodeName: WideString);\\n procedure AddDependency(NodeName, DependsOn: WideString);\\n procedure AddNodeDependencies(NodeAndDependencies: TStringList);\\n //Each string has node, and the nodes it depends on. This allows insertion of an entire dependency graph at once\\n //procedure DelNode(NodeName: Widestring);\\n procedure DelDependency(NodeName, DependsOn: WideString);\\n\\n property CanBeSorted: boolean read FCanBeSorted;\\n\\n end;\\n\\nconst\\n INVALID = -1;\\n // index not found for index search functions, no sort order defined, or record invalid/deleted\\n\\n function TTopologicalSort.SearchNode(NodeName: WideString): integer;\\n var\\n Counter: integer;\\n begin\\n // Return -1 if node not found. If node found, return index in array\\n Result := INVALID;\\n for Counter := 0 to High(Nodes) do\\n begin\\n if Nodes[Counter].NodeName = NodeName then\\n begin\\n Result := Counter;\\n break;\\n end;\\n end;\\n end;\\n\\n function TTopologicalSort.SearchIndex(NodeID: integer): WideString;\\n //Look up name for the index\\n begin\\n if (NodeID > 0) and (NodeID <= High(Nodes)) then\\n begin\\n Result := Nodes[NodeID].NodeName;\\n end\\n else\\n begin\\n Result := 'ERROR'; //something's fishy, this shouldn't happen\\n end;\\n end;\\n\\n function TTopologicalSort.DepFromNodeID(NodeID: integer): integer;\\n // Look for Node index number in the dependency graph\\n // and return the first node found. If nothing found, return -1\\n var\\n Counter: integer;\\n begin\\n Result := INVALID;\\n for Counter := 0 to High(DependencyGraph) do\\n begin\\n if DependencyGraph[Counter].Node = NodeID then\\n begin\\n Result := Counter;\\n break;\\n end;\\n end;\\n end;\\n\\n function TTopologicalSort.DepFromDepID(DepID: integer): integer;\\n // Look for dependency index number in the dependency graph\\n // and return the index for the first one found. If nothing found, return -1\\n var\\n Counter: integer;\\n begin\\n Result := INVALID;\\n for Counter := 0 to High(DependencyGraph) do\\n begin\\n if DependencyGraph[Counter].DependsOn = DepID then\\n begin\\n Result := Counter;\\n break;\\n end;\\n end;\\n end;\\n\\n function TTopologicalSort.DepFromNodeIDDepID(NodeID, DepID: integer): integer;\\n // Shows index for the dependency from NodeID on DepID, or INVALID if not found\\n var\\n Counter: integer;\\n begin\\n Result := INVALID;\\n for Counter := 0 to High(DependencyGraph) do\\n begin\\n if DependencyGraph[Counter].Node = NodeID then\\n if DependencyGraph[Counter].DependsOn = DepID then\\n begin\\n Result := Counter;\\n break;\\n end;\\n end;\\n end;\\n\\n procedure TTopologicalSort.DelDependency(const Index: integer);\\n // Removes dependency from array.\\n // Is fastest when the dependency is near the top of the array\\n // as we're copying the remaining elements.\\n var\\n Counter: integer;\\n OriginalLength: integer;\\n begin\\n OriginalLength := Length(DependencyGraph);\\n if Index = OriginalLength - 1 then\\n begin\\n SetLength(DependencyGraph, OriginalLength - 1);\\n end;\\n if Index < OriginalLength - 1 then\\n begin\\n for Counter := Index to OriginalLength - 2 do\\n begin\\n DependencyGraph[Counter] := DependencyGraph[Counter + 1];\\n end;\\n SetLength(DependencyGraph, OriginalLength - 1);\\n end;\\n if Index > OriginalLength - 1 then\\n begin\\n // This could happen when deleting on an empty array:\\n raise Exception.Create('Tried to delete index ' + IntToStr(Index) +\\n ' while the maximum index was ' + IntToStr(OriginalLength - 1));\\n end;\\n end;\\n\\n constructor TTopologicalSort.Create;\\n begin\\n inherited Create;\\n end;\\n\\n destructor TTopologicalSort.Destroy;\\n begin\\n // Clear up data just to make sure:\\n Finalize(DependencyGraph);\\n Finalize(Nodes);\\n inherited;\\n end;\\n\\n procedure TTopologicalSort.SortOrder(var Output: TStringList);\\n var\\n Counter: integer;\\n NodeCounter: integer;\\n OutputSortOrder: integer;\\n DidSomething: boolean; //used to detect cycles (circular references)\\n Node: integer;\\n begin\\n OutputSortOrder := 0;\\n DidSomething := True; // prime the loop below\\n FCanBeSorted := True; //hope for the best.\\n while (DidSomething = True) do\\n begin\\n // 1. Find all nodes (now) without dependencies, output them first and remove the dependencies:\\n // 1.1 Nodes that are not present in the dependency graph at all:\\n for Counter := 0 to High(Nodes) do\\n begin\\n if DepFromNodeID(Counter) = INVALID then\\n begin\\n if DepFromDepID(Counter) = INVALID then\\n begin\\n // Node doesn't occur in either side of the dependency graph, so it has sort order 0:\\n DidSomething := True;\\n if (Nodes[Counter].Order = INVALID) or\\n (Nodes[Counter].Order > OutputSortOrder) then\\n begin\\n // Enter sort order if the node doesn't have a lower valid order already.\\n Nodes[Counter].Order := OutputSortOrder;\\n end;\\n end; //Invalid Dep\\n end; //Invalid Node\\n end; //Count\\n // Done with the first batch, so we can increase the sort order:\\n OutputSortOrder := OutputSortOrder + 1;\\n // 1.2 Nodes that are only present on the right hand side of the dep graph:\\n DidSomething := False;\\n // reverse order so we can delete dependencies without passing upper array\\n for Counter := High(DependencyGraph) downto 0 do\\n begin\\n Node := DependencyGraph[Counter].DependsOn; //the depended node\\n if (DepFromNodeID(Node) = INVALID) then\\n begin\\n DidSomething := True;\\n //Delete dependency so we don't hit it again:\\n DelDependency(Counter);\\n if (Nodes[Node].Order = INVALID) or (Nodes[Node].Order > OutputSortOrder) then\\n begin\\n // Enter sort order if the node doesn't have a lower valid order already.\\n Nodes[Node].Order := OutputSortOrder;\\n end;\\n end;\\n OutputSortOrder := OutputSortOrder + 1; //next iteration\\n end;\\n // 2. Go back to 1 until we can't do more work, and do some bookkeeping:\\n OutputSortOrder := OutputSortOrder + 1;\\n end; //outer loop for 1 to 2\\n OutputSortOrder := OutputSortOrder - 1; //fix unused last loop.\\n\\n // 2. If we have dependencies left, we have a cycle; exit.\\n if (High(DependencyGraph) > 0) then\\n begin\\n FCanBeSorted := False; //indicate we have a cycle\\n Output.Add('Cycle (circular dependency) detected, cannot sort further. Dependencies left:');\\n for Counter := 0 to High(DependencyGraph) do\\n begin\\n Output.Add(SearchIndex(DependencyGraph[Counter].Node) +\\n ' depends on: ' + SearchIndex(DependencyGraph[Counter].DependsOn));\\n end;\\n end\\n else\\n begin\\n // No cycle:\\n // Now parse results, if we have them\\n for Counter := 0 to OutputSortOrder do\\n begin\\n for NodeCounter := 0 to High(Nodes) do\\n begin\\n if Nodes[NodeCounter].Order = Counter then\\n begin\\n Output.Add(Nodes[NodeCounter].NodeName);\\n end;\\n end; //output each result\\n end; //order iteration\\n end; //cycle detection\\n end;\\n\\n procedure TTopologicalSort.AddNode(NodeName: WideString);\\n var\\n NodesNewLength: integer;\\n begin\\n // Adds node; make sure we don't add duplicate entries\\n if SearchNode(NodeName) = INVALID then\\n begin\\n NodesNewLength := Length(Nodes) + 1;\\n SetLength(Nodes, NodesNewLength);\\n Nodes[NodesNewLength - 1].NodeName := NodeName; //Arrays are 0 based\\n //Nodes[NodesNewLength -1].Index := //If we change the object to a tlist or something, we already have an index property\\n Nodes[NodesNewLength - 1].Order := INVALID; //default value\\n end;\\n end;\\n\\n procedure TTopologicalSort.AddDependency(NodeName, DependsOn: WideString);\\n begin\\n // Make sure both nodes in the dependency exist as a node\\n if SearchNode(NodeName) = INVALID then\\n begin\\n Self.AddNode(NodeName);\\n end;\\n if SearchNode(DependsOn) = INVALID then\\n begin\\n Self.AddNode(DependsOn);\\n end;\\n // Add the dependency, only if we don't depend on ourselves:\\n if NodeName <> DependsOn then\\n begin\\n SetLength(DependencyGraph, Length(DependencyGraph) + 1);\\n DependencyGraph[High(DependencyGraph)].Node := SearchNode(NodeName);\\n DependencyGraph[High(DependencyGraph)].DependsOn := SearchNode(DependsOn);\\n end;\\n end;\\n\\n procedure TTopologicalSort.AddNodeDependencies(NodeAndDependencies: TStringList);\\n // Takes a stringlist containing a list of strings. Each string contains node names\\n // separated by spaces. The first node depends on the others. It is permissible to have\\n // only one node name, which doesn't depend on anything.\\n // This procedure will add the dependencies and the nodes in one go.\\n var\\n Deplist: TStringList;\\n StringCounter: integer;\\n NodeCounter: integer;\\n begin\\n if Assigned(NodeAndDependencies) then\\n begin\\n DepList := TStringList.Create;\\n try\\n for StringCounter := 0 to NodeAndDependencies.Count - 1 do\\n begin\\n // For each string in the argument: split into names, and process:\\n DepList.Delimiter := ' '; //use space to separate the entries\\n DepList.StrictDelimiter := False; //allows us to ignore double spaces in input.\\n DepList.DelimitedText := NodeAndDependencies[StringCounter];\\n for NodeCounter := 0 to DepList.Count - 1 do\\n begin\\n if NodeCounter = 0 then\\n begin\\n // Add the first node, which might be the only one.\\n Self.AddNode(Deplist[0]);\\n end;\\n\\n if NodeCounter > 0 then\\n begin\\n // Only add dependency from the second item onwards\\n // The AddDependency code will automatically add Deplist[0] to the Nodes, if required\\n Self.AddDependency(DepList[0], DepList[NodeCounter]);\\n end;\\n end;\\n end;\\n finally\\n DepList.Free;\\n end;\\n end;\\n end;\\n\\n procedure TTopologicalSort.DelDependency(NodeName, DependsOn: WideString);\\n // Delete the record.\\n var\\n NodeID: integer;\\n DependsID: integer;\\n Dependency: integer;\\n begin\\n NodeID := Self.SearchNode(NodeName);\\n DependsID := Self.SearchNode(DependsOn);\\n if (NodeID <> INVALID) and (DependsID <> INVALID) then\\n begin\\n // Look up dependency and delete it.\\n Dependency := Self.DepFromNodeIDDepID(NodeID, DependsID);\\n if (Dependency <> INVALID) then\\n begin\\n Self.DelDependency(Dependency);\\n end;\\n end;\\n end;\\n\\n // Main program:\\nvar\\n InputList: TStringList; //Lines of dependencies\\n TopSort: TTopologicalSort; //Topological sort object\\n OutputList: TStringList; //Sorted dependencies\\n Counter: integer;\\nbegin\\n\\n //Actual sort\\n InputList := TStringList.Create;\\n // Add rosetta code sample input separated by at least one space in the lines\\n InputList.Add(\\n 'des_system_lib std synopsys std_cell_lib des_system_lib dw02 dw01 ramlib ieee');\\n InputList.Add('dw01 ieee dw01 dware gtech');\\n InputList.Add('dw02 ieee dw02 dware');\\n InputList.Add('dw03 std synopsys dware dw03 dw02 dw01 ieee gtech');\\n InputList.Add('dw04 dw04 ieee dw01 dware gtech');\\n InputList.Add('dw05 dw05 ieee dware');\\n InputList.Add('dw06 dw06 ieee dware');\\n InputList.Add('dw07 ieee dware');\\n InputList.Add('dware ieee dware');\\n InputList.Add('gtech ieee gtech');\\n InputList.Add('ramlib std ieee');\\n InputList.Add('std_cell_lib ieee std_cell_lib');\\n InputList.Add('synopsys');\\n TopSort := TTopologicalSort.Create;\\n OutputList := TStringList.Create;\\n try\\n TopSort.AddNodeDependencies(InputList); //read in nodes\\n TopSort.SortOrder(OutputList); //perform the sort\\n for Counter := 0 to OutputList.Count - 1 do\\n begin\\n writeln(OutputList[Counter]);\\n end;\\n except\\n on E: Exception do\\n begin\\n Writeln(stderr, 'Error: ', DateTimeToStr(Now),\\n ': Error sorting. Technical details: ',\\n E.ClassName, '/', E.Message);\\n end;\\n end; //try\\n OutputList.Free;\\n TopSort.Free;\\n InputList.Free;\\nend.\\n\",\n \"language\": \"Object-Pascal\"\n },\n {\n \"code\": \"let dep_libs = [\\n (\\\"des_system_lib\\\", [\\\"std\\\"; \\\"synopsys\\\"; \\\"std_cell_lib\\\"; \\\"des_system_lib\\\"; \\\"dw02\\\"; \\\"dw01\\\"; \\\"ramlib\\\"; \\\"ieee\\\"]);\\n (\\\"dw01\\\", (*\\\"dw04\\\"::*)[\\\"ieee\\\"; \\\"dw01\\\"; \\\"dware\\\"; \\\"gtech\\\"]);\\n (\\\"dw02\\\", [\\\"ieee\\\"; \\\"dw02\\\"; \\\"dware\\\"]);\\n (\\\"dw03\\\", [\\\"std\\\"; \\\"synopsys\\\"; \\\"dware\\\"; \\\"dw03\\\"; \\\"dw02\\\"; \\\"dw01\\\"; \\\"ieee\\\"; \\\"gtech\\\"]);\\n (\\\"dw04\\\", [\\\"dw04\\\"; \\\"ieee\\\"; \\\"dw01\\\"; \\\"dware\\\"; \\\"gtech\\\"]);\\n (\\\"dw05\\\", [\\\"dw05\\\"; \\\"ieee\\\"; \\\"dware\\\"]);\\n (\\\"dw06\\\", [\\\"dw06\\\"; \\\"ieee\\\"; \\\"dware\\\"]);\\n (\\\"dw07\\\", [\\\"ieee\\\"; \\\"dware\\\"]);\\n (\\\"dware\\\", [\\\"ieee\\\"; \\\"dware\\\"]);\\n (\\\"gtech\\\", [\\\"ieee\\\"; \\\"gtech\\\"]);\\n (\\\"ramlib\\\", [\\\"std\\\"; \\\"ieee\\\"]);\\n (\\\"std_cell_lib\\\", [\\\"ieee\\\"; \\\"std_cell_lib\\\"]);\\n (\\\"synopsys\\\", []);\\n]\\n\\nlet dep_libs =\\n let f (lib, deps) = (* remove self dependency *)\\n (lib,\\n List.filter (fun d -> d <> lib) deps) in\\n List.map f dep_libs\\n\\nlet rev_unique =\\n List.fold_left (fun acc x -> if List.mem x acc then acc else x::acc) []\\n\\nlet libs = (* list items, each being unique *)\\n rev_unique (List.flatten(List.map (fun (lib, deps) -> lib::deps) dep_libs))\\n\\nlet get_deps lib =\\n try (List.assoc lib dep_libs)\\n with Not_found -> []\\n\\nlet res =\\n let rec aux acc later todo progress =\\n match todo, later with\\n | [], [] -> (List.rev acc)\\n | [], _ ->\\n if progress\\n then aux acc [] later false\\n else invalid_arg \\\"un-orderable data\\\"\\n | x::xs, _ ->\\n let deps = get_deps x in\\n let ok = List.for_all (fun dep -> List.mem dep acc) deps in\\n if ok\\n then aux (x::acc) later xs true\\n else aux acc (x::later) xs progress\\n in\\n let starts, todo = List.partition (fun lib -> get_deps lib = []) libs in\\n aux starts [] todo false\\n\\nlet () =\\n print_string \\\"result: \\\\n \\\";\\n print_endline (String.concat \\\", \\\" res);\\n;;\\n\",\n \"language\": \"OCaml\"\n },\n {\n \"code\": \"'TOPOLOGICAL SORT\\n\\nuses parseutil 'getword() lenw\\nuses console\\n\\nstring dat=\\\"\\nLIBRARY LIBRARY DEPENDENCIES\\n======= ====================\\ndes_system_lib std synopsys std_cell_lib des_system_lib dw02 dw01 ramlib ieee\\ndw01 ieee dw01 dware gtech\\ndw02 ieee dw02 dware\\ndw03 std synopsys dware dw03 dw02 dw01 ieee gtech\\ndw04 dw04 ieee dw01 dware gtech\\ndw05 dw05 ieee dware\\ndw06 dw06 ieee dware\\ndw07 ieee dware\\ndware ieee dware\\ngtech ieee gtech\\nramlib std ieee\\nstd_cell_lib ieee std_cell_lib\\nsynopsys\\n\\\"\\ngosub Dims\\ngosub CaptureData\\ngosub GetSystemLibs\\ngosub RemoveSelfReference\\ngosub OrderByDependency\\ngosub DisplayResults\\nend\\n\\n/*RESULTS:\\n libraries in dependency order\\n -----------------------------\\n std\\n ieee\\n dware\\n gtech\\n ramlib\\n std_cell_lib\\n synopsys\\n dw01\\n dw02\\n des_system_lib\\n dw03\\n dw04\\n dw05\\n dw06\\n dw07\\n<<\\n\\n remainder:\\n ----------\\n <<\\n*/\\n\\n\\n\\nDims:\\n=====\\n'VARIABLES\\nint p 'width of first column\\nint h 'length of each line\\nint i 'iterator / counter\\nint j 'main iterator\\nint b 'table char offset\\nint e 'end of each line\\nint bd 'each offset of dependencises line\\nint le 'length of each lib name\\nint lend 'size of table\\nint k 'character indexer\\nint m 'iterator\\nint n 'iterator\\nint cw 'presence flag\\nint lw 'length of keyword\\nint a 'iinstr result\\nint dc 'new lib list indexer / counter\\nstring wr 'keyword\\nstring wn 'keyword\\n'--arrays--\\nstring datl[64] 'list of lib names\\nstring datd[64] 'lists of lib dependencies\\nstring datn[64] 'new list in dependency ordert\\nret\\n\\n\\nCaptureData:\\n============\\ndat=lcase dat\\n'GET HEADING POSITION\\np=instr dat,\\\"library depend\\\"\\np-=3 'crlf -1\\n'REMOVE HEADING\\nh=instr 3,dat,cr\\nh+=2\\nh=instr h,dat,cr 'to remove underlines\\n'print h cr\\nh+=2\\ndat=mid dat,h\\n'print dat \\\"<\\\" cr\\nb=1\\n'PREPARE DATA\\nlend=len dat\\ndo\\n i++\\n datl[i]=rtrim(mid(dat,b,p))\\n le=len datl[i]\\n e=instr b+le,dat,cr\\n bd=b+p\\n datd[i]=\\\" \\\"+mid(dat,bd,e-bd)+\\\" \\\"\\n 'print datl[i] \\\",\\\" datd[i] cr\\n b=e+2\\n if b>lend-2\\n exit do\\n endif\\nloop\\nret\\n\\nGetSystemLibs:\\n==============\\n'SCAN DEPENDENCIES\\n'GET SYSTEM LIBS NOT LISTED\\nfor j=1 to i\\n k=1\\n do\\n wr=getword datd[j],k\\n if not wr\\n exit do\\n endif\\n cw=0\\n for m=1 to i\\n if wr=datl[m] 'on lib list\\n cw=m\\n endif\\n next\\n if cw=0 'lib not on library list\\n 'add wr to new lib list\\n dc++ : datn[dc]=wr\\n 'remove lib names from dependency lists\\n gosub BlankOutNames\\n endif\\n loop\\nnext 'j group of dependencies\\nret\\n\\n\\nRemoveSelfReference:\\n====================\\n'REMOVE SELF REFERENCE + NO DEPENDENCIES\\nfor j=1 to i\\n wr=\\\" \\\"+datl[j]+\\\" \\\"\\n lw=len(wr)\\n a=instr(datd[j],wr)\\n if a\\n mid(datd[j],a,space(lw)) 'blank out self\\n endif\\n gosub RemoveLibFromLists\\nnext\\nret\\n'\\nOrderByDependency:\\n==================\\n'\\nfor j=1 to i\\n if datl[j]\\n gosub RemoveLibFromLists\\n if cw then j=0 'repeat cycle\\n endif\\nnext\\nret\\n'\\nDisplayResults:\\n===============\\nprint cr cr\\nprint \\\"libraries in dependency order\\\" cr\\nprint \\\"-----------------------------\\\" cr\\nfor j=1 to dc\\n print datn[j] cr\\nnext\\nprint \\\"<<\\\" cr cr\\nprint \\\"remainder:\\\" cr\\nprint \\\"----------\\\" cr\\nfor j=1 to i\\n if datl[j]\\n print datl[j] \\\" , \\\" datd[j] cr\\n endif\\nnext\\nprint \\\"<<\\\" cr\\n\\npause\\nend\\n\\nRemoveLibFromLists:\\n===================\\ncw=0\\nk=1 : wr=getword datd[j],k\\nif lenw=0\\n dc++ : datn[dc]=datl[j] 'add to new lib list\\n datl[j]=\\\"\\\" : datd[j]=\\\"\\\" 'eliminate frecord rom further checks\\n gosub BlankOutNames 'eliminate all lib references from table\\n cw=1 'flag alteration\\nendif\\nret\\n\\nBlankOutNames:\\n==============\\nwn=\\\" \\\"+datn[dc]+\\\" \\\" 'add word boundaries\\nlw=len wn\\nfor n=1 to i\\n if datd[n]\\n a=instr(datd[n],wn)\\n if a\\n mid datd[n],a,space(lw) 'blank out\\n endif\\n endif\\nnext\\nret\\n\",\n \"language\": \"OxygenBasic\"\n },\n {\n \"code\": \"declare\\n Deps = unit(\\n des_system_lib: [std synopsys std_cell_lib des_system_lib\\n dw02 dw01 ramlib ieee]\\n dw01: [ieee dw01 dware gtech]\\n dw02: [ieee dw02 dware]\\n dw03: [std synopsys dware dw03 dw02 dw01 ieee gtech]\\n dw04: [dw04 ieee dw01 dware gtech]\\n dw05: [dw05 ieee dware]\\n dw06: [dw06 ieee dware]\\n dw07: [ieee dware]\\n dware: [ieee dware]\\n gtech: [ieee gtech]\\n ramlib: [std ieee]\\n std_cell_lib: [ieee std_cell_lib]\\n synopsys:nil\\n )\\n\\n %% Describe possible solutions\\n proc {TopologicalOrder Solution}\\n FullDeps = {Complete Deps}\\n in\\n %% The solution is a record that maps library names\\n %% to finite domain variables.\\n %% The smaller the value, the earlier it must be compiled\\n Solution = {FD.record sol {Arity FullDeps} 1#{Width FullDeps}}\\n %% for every lib on the left side\\n {Record.forAllInd FullDeps\\n proc {$ LibName Dependants}\\n %% ... and every dependant on the right side\\n for Dependant in Dependants do\\n %% propagate compilation order\\n if Dependant \\\\= LibName then\\n Solution.LibName >: Solution.Dependant\\n end\\n end\\n end\\n }\\n %% enumerate solutions\\n {FD.distribute naive Solution}\\n end\\n\\n %% adds empty list of dependencies for libs that only occur on the right side\\n fun {Complete Dep}\\n AllLibs = {Nub {Record.foldL Dep Append nil}}\\n in\\n {Adjoin\\n {List.toRecord unit {Map AllLibs fun {$ L} L#nil end}}\\n Dep}\\n end\\n\\n %% removes duplicates\\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\\n %% print grouped by parallelizable jobs\\n proc {PrintSolution Sol}\\n for I in 1..{Record.foldL Sol Value.max 1} do\\n for Lib in {Arity {Record.filter Sol fun {$ X} X == I end}} do\\n {System.printInfo Lib#\\\" \\\"}\\n end\\n {System.printInfo \\\"\\\\n\\\"}\\n end\\n end\\n\\n fun {GetOrderedLibs Sol}\\n {Map\\n {Sort {Record.toListInd Sol} CompareSecond}\\n SelectFirst}\\n end\\n fun {CompareSecond A B} A.2 < B.2 end\\n fun {SelectFirst X} X.1 end\\nin\\n case {SearchOne TopologicalOrder}\\n of nil then {System.showInfo \\\"Un-orderable.\\\"}\\n [] [Sol] then\\n {System.showInfo \\\"A possible topological ordering: \\\"}\\n {ForAll {GetOrderedLibs Sol} System.showInfo}\\n\\n {System.showInfo \\\"\\\\nBONUS - grouped by parallelizable compile jobs:\\\"}\\n {PrintSolution Sol}\\n end\\n\",\n \"language\": \"Oz\"\n },\n {\n \"code\": \"program ToposortTask;\\n{$mode delphi}\\nuses\\n SysUtils, Generics.Collections;\\n\\ntype\\n TAdjList = class\\n InList, // incoming arcs\\n OutList: THashSet<string>; // outcoming arcs\\n constructor Create;\\n destructor Destroy; override;\\n end;\\n\\n TDigraph = class(TObjectDictionary<string, TAdjList>)\\n procedure AddNode(const s: string);\\n procedure AddArc(const s, t: string);\\n function AdjList(const s: string): TAdjList;\\n { returns True and the sorted sequence of nodes in aOutSeq if is acyclic,\\n otherwise returns False and nil; uses Kahn's algorithm }\\n function TryToposort(out aOutSeq: TStringArray): Boolean;\\n end;\\n\\n\\nconstructor TAdjList.Create;\\nbegin\\n InList := THashSet<string>.Create;\\n OutList := THashSet<string>.Create;\\nend;\\n\\ndestructor TAdjList.Destroy;\\nbegin\\n InList.Free;\\n OutList.Free;\\n inherited;\\nend;\\n\\nprocedure TDigraph.AddNode(const s: string);\\nbegin\\n if not ContainsKey(s) then\\n Add(s, TAdjList.Create);\\nend;\\n\\nprocedure TDigraph.AddArc(const s, t: string);\\nbegin\\n AddNode(s);\\n AddNode(t);\\n if s <> t then begin\\n Items[s].OutList.Add(t);\\n Items[t].InList.Add(s);\\n end;\\nend;\\n\\nfunction TDigraph.AdjList(const s: string): TAdjList;\\nbegin\\n if not TryGetValue(s, Result) then\\n Result := nil;\\nend;\\n\\nfunction TDigraph.TryToposort(out aOutSeq: TStringArray): Boolean;\\nvar\\n q: TQueue<string>;\\n p: TPair<string, TAdjList>;\\n Node, ToRemove: string;\\n Counter: SizeInt;\\nbegin\\n q := TQueue<string>.Create;\\n SetLength(aOutSeq, Count);\\n Counter := Pred(Count);\\n for p in Self do\\n if p.Value.InList.Count = 0 then\\n q.Enqueue(p.Key);\\n while q.Count > 0 do begin\\n ToRemove := q.Dequeue;\\n for Node in Items[ToRemove].OutList do\\n with Items[Node] do begin\\n InList.Remove(ToRemove);\\n if InList.Count = 0 then\\n q.Enqueue(Node);\\n end;\\n Remove(ToRemove);\\n aOutSeq[Counter] := ToRemove;\\n Dec(Counter);\\n end;\\n q.Free;\\n Result := Count = 0;\\n if not Result then\\n aOutSeq := nil;\\nend;\\n\\n{ expects text separated by line breaks }\\nfunction ParseRawData(const aData: string): TDigraph;\\nvar\\n Line, Curr, Node: string;\\n FirstTerm: Boolean;\\nbegin\\n Result := TDigraph.Create([doOwnsValues]);\\n for Line in aData.Split([LineEnding], TStringSplitOptions.ExcludeEmpty) do begin\\n FirstTerm := True;\\n for Curr in Line.Split([' '], TStringSplitOptions.ExcludeEmpty) do\\n if FirstTerm then begin\\n Node := Curr;\\n Result.AddNode(Curr);\\n FirstTerm := False;\\n end else\\n Result.AddArc(Node, Curr);\\n end;\\nend;\\n\\nprocedure TrySort(const aData: string);\\nvar\\n g: TDigraph;\\n Sorted: TStringArray;\\nbegin\\n g := ParseRawData(aData);\\n if g.TryToposort(Sorted) then\\n WriteLn('success: ', LineEnding, string.Join(', ', Sorted))\\n else\\n WriteLn('circular dependency detected');\\n g.Free;\\nend;\\n\\nconst\\n ExampleData =\\n 'des_system_lib std synopsys std_cell_lib des_system_lib dw02 dw01 ramlib ieee' + LineEnding +\\n 'dw01 ieee dw01 dware gtech' + LineEnding +\\n 'dw02 ieee dw02 dware' + LineEnding +\\n 'dw03 std synopsys dware dw03 dw02 dw01 ieee gtech' + LineEnding +\\n 'dw04 dw04 ieee dw01 dware gtech' + LineEnding +\\n 'dw05 dw05 ieee dware' + LineEnding +\\n 'dw06 dw06 ieee dware' + LineEnding +\\n 'dw07 ieee dware' + LineEnding +\\n 'dware ieee dware' + LineEnding +\\n 'gtech ieee gtech' + LineEnding +\\n 'ramlib std ieee' + LineEnding +\\n 'std_cell_lib ieee std_cell_lib' + LineEnding +\\n 'synopsys';\\nvar\\n Temp: TStringArray;\\n\\nbegin\\n TrySort(ExampleData);\\n WriteLn;\\n //let's add a circular dependency\\n Temp := ExampleData.Split([LineEnding], TStringSplitOptions.ExcludeEmpty);\\n Temp[1] := Temp[1] + ' dw04';\\n TrySort(string.Join(LineEnding, Temp));\\nend.\\n\",\n \"language\": \"Pascal\"\n },\n {\n \"code\": \"program ToposortTask;\\n{$mode delphi}\\nuses\\n SysUtils, Generics.Collections;\\n\\ntype\\n TDigraph = class(TObjectDictionary<string, THashSet<string>>)\\n procedure AddNode(const s: string);\\n procedure AddArc(const s, t: string);\\n function AdjList(const s: string): THashSet<string>;\\n { returns True and the sorted sequence of nodes in aOutSeq if is acyclic,\\n otherwise returns False and the first found cycle; uses DFS }\\n function TryToposort(out aOutSeq: TStringArray): Boolean;\\n end;\\n\\nprocedure TDigraph.AddNode(const s: string);\\nbegin\\n if not ContainsKey(s) then\\n Add(s, THashSet<string>.Create);\\nend;\\n\\nprocedure TDigraph.AddArc(const s, t: string);\\nbegin\\n AddNode(s);\\n AddNode(t);\\n if s <> t then\\n Items[s].Add(t);\\nend;\\n\\nfunction TDigraph.AdjList(const s: string): THashSet<string>;\\nbegin\\n if not TryGetValue(s, Result) then\\n Result := nil;\\nend;\\n\\nfunction TDigraph.TryToposort(out aOutSeq: TStringArray): Boolean;\\nvar\\n Parents: TDictionary<string, string>;// stores the traversal tree as pairs (Node, its predecessor)\\n procedure ExtractCycle(const BackPoint: string; Prev: string);\\n begin // just walk backwards through the traversal tree, starting from Prev until BackPoint is encountered\\n with TList<string>.Create do begin\\n Add(Prev);\\n repeat\\n Prev := Parents[Prev];\\n Add(Prev);\\n until Prev = BackPoint;\\n Add(Items[0]);\\n Reverse; //this is required since we moved backwards through the tree\\n aOutSeq := ToArray;\\n Free;\\n end\\n end;\\nvar\\n Visited, // set of already visited nodes\\n Closed: THashSet<string>;// set of nodes whose subtree traversal is complete\\n Counter: SizeInt = 0;\\n function Dfs(const aNode: string): Boolean;// True means successful sorting,\\n var // False - found cycle\\n Next: string;\\n begin\\n Visited.Add(aNode);\\n for Next in AdjList(aNode) do\\n if not Visited.Contains(Next) then begin\\n Parents.Add(Next, aNode);\\n if not Dfs(Next) then exit(False);\\n end else\\n if not Closed.Contains(Next) then begin//back edge found(i.e. cycle)\\n ExtractCycle(Next, aNode);\\n exit(False);\\n end;\\n Closed.Add(aNode);\\n aOutSeq[Counter] := aNode;\\n Inc(Counter);\\n Result := True;\\n end;\\nvar\\n Node: string;\\nbegin\\n SetLength(aOutSeq, Count);\\n Visited := THashSet<string>.Create;\\n Closed := THashSet<string>.Create;\\n Parents := TDictionary<string, string>.Create;\\n Result := True;\\n for Node in Keys do\\n if not Visited.Contains(Node) then\\n if not Dfs(Node) then begin\\n Result := False;\\n break;\\n end;\\n Visited.Free;\\n Closed.Free;\\n Parents.Free;\\nend;\\n\\n{ expects text separated by line breaks }\\nfunction ParseRawData(const aData: string): TDigraph;\\nvar\\n Line, Curr, Node: string;\\n FirstTerm: Boolean;\\nbegin\\n Result := TDigraph.Create([doOwnsValues]);\\n for Line in aData.Split([LineEnding], TStringSplitOptions.ExcludeEmpty) do begin\\n FirstTerm := True;\\n for Curr in Line.Split([' '], TStringSplitOptions.ExcludeEmpty) do\\n if FirstTerm then begin\\n Node := Curr;\\n Result.AddNode(Curr);\\n FirstTerm := False;\\n end else\\n Result.AddArc(Node, Curr);\\n end;\\nend;\\n\\nprocedure TrySort(const aData: string);\\nvar\\n g: TDigraph;\\n Sorted: TStringArray;\\nbegin\\n g := ParseRawData(aData);\\n if g.TryToposort(Sorted) then\\n WriteLn('success: ', LineEnding, string.Join(', ', Sorted))\\n else\\n WriteLn('circular dependency: ', LineEnding, string.Join('->', Sorted));\\n g.Free;\\nend;\\n\\nconst\\n ExampleData =\\n 'des_system_lib std synopsys std_cell_lib des_system_lib dw02 dw01 ramlib ieee' + LineEnding +\\n 'dw01 ieee dw01 dware gtech' + LineEnding +\\n 'dw02 ieee dw02 dware' + LineEnding +\\n 'dw03 std synopsys dware dw03 dw02 dw01 ieee gtech' + LineEnding +\\n 'dw04 dw04 ieee dw01 dware gtech' + LineEnding +\\n 'dw05 dw05 ieee dware' + LineEnding +\\n 'dw06 dw06 ieee dware' + LineEnding +\\n 'dw07 ieee dware' + LineEnding +\\n 'dware ieee dware' + LineEnding +\\n 'gtech ieee gtech' + LineEnding +\\n 'ramlib std ieee' + LineEnding +\\n 'std_cell_lib ieee std_cell_lib' + LineEnding +\\n 'synopsys';\\nvar\\n Temp: TStringArray;\\n\\nbegin\\n TrySort(ExampleData);\\n WriteLn;\\n //let's add a circular dependency\\n Temp := ExampleData.Split([LineEnding], TStringSplitOptions.ExcludeEmpty);\\n Temp[1] := Temp[1] + ' dw07';\\n Temp[7] := Temp[7] + ' dw03';\\n TrySort(string.Join(LineEnding, Temp));\\nend.\\n\",\n \"language\": \"Pascal\"\n },\n {\n \"code\": \"sub print_topo_sort {\\n my %deps = @_;\\n\\n my %ba;\\n while ( my ( $before, $afters_aref ) = each %deps ) {\\n for my $after ( @{ $afters_aref } ) {\\n $ba{$before}{$after} = 1 if $before ne $after;\\n $ba{$after} ||= {};\\n }\\n }\\n\\n while ( my @afters = sort grep { ! %{ $ba{$_} } } keys %ba ) {\\n print \\\"@afters\\\\n\\\";\\n delete @ba{@afters};\\n delete @{$_}{@afters} for values %ba;\\n }\\n\\n print !!%ba ? \\\"Cycle found! \\\". join( ' ', sort keys %ba ). \\\"\\\\n\\\" : \\\"---\\\\n\\\";\\n}\\n\\nmy %deps = (\\n des_system_lib => [qw( std synopsys std_cell_lib des_system_lib dw02\\n dw01 ramlib ieee )],\\n dw01 => [qw( ieee dw01 dware gtech )],\\n dw02 => [qw( ieee dw02 dware )],\\n dw03 => [qw( std synopsys dware dw03 dw02 dw01 ieee gtech )],\\n dw04 => [qw( dw04 ieee dw01 dware gtech )],\\n dw05 => [qw( dw05 ieee dware )],\\n dw06 => [qw( dw06 ieee dware )],\\n dw07 => [qw( ieee dware )],\\n dware => [qw( ieee dware )],\\n gtech => [qw( ieee gtech )],\\n ramlib => [qw( std ieee )],\\n std_cell_lib => [qw( ieee std_cell_lib )],\\n synopsys => [qw( )],\\n);\\nprint_topo_sort(%deps);\\npush @{ $deps{'dw01'} }, 'dw04'; # Add unresolvable dependency\\nprint_topo_sort(%deps);\\n\",\n \"language\": \"Perl\"\n },\n {\n \"code\": \"(phixonline)-->\\n <span style=\\\"color: #004080;\\\">sequence</span> <span style=\\\"color: #000000;\\\">names</span>\\n <span style=\\\"color: #008080;\\\">enum</span> <span style=\\\"color: #000000;\\\">RANK</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">NAME</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">DEP</span> <span style=\\\"color: #000080;font-style:italic;\\\">-- content of names\\n -- rank is 1 for items to compile first, then 2, etc,\\n -- or 0 if cyclic dependencies prevent compilation.\\n -- name is handy, and makes the result order alphabetic!\\n -- dep is a list of dependencies (indexes to other names)</span>\\n\\n <span style=\\\"color: #008080;\\\">function</span> <span style=\\\"color: #000000;\\\">add_dependency</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #004080;\\\">string</span> <span style=\\\"color: #000000;\\\">name</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: #000000;\\\">name</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #7060A8;\\\">vslice</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">names</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">NAME</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;\\\">names</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">append</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">names</span><span style=\\\"color: #0000FF;\\\">,{</span><span style=\\\"color: #000000;\\\">0</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">name</span><span style=\\\"color: #0000FF;\\\">,{}})</span>\\n <span style=\\\"color: #000000;\\\">k</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">length</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">names</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;\\\">k</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;\\\">topsort</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #004080;\\\">string</span> <span style=\\\"color: #000000;\\\">input</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #000000;\\\">names</span> <span style=\\\"color: #0000FF;\\\">=</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;\\\">input</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: #004080;\\\">sequence</span> <span style=\\\"color: #000000;\\\">line</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: #000000;\\\">dependencies</span> <span style=\\\"color: #0000FF;\\\">=</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;\\\">add_dependency</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">line</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;\\\">j</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;\\\">line</span><span style=\\\"color: #0000FF;\\\">)</span> <span style=\\\"color: #008080;\\\">do</span>\\n <span style=\\\"color: #004080;\\\">integer</span> <span style=\\\"color: #000000;\\\">l</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">add_dependency</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">line</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">j</span><span style=\\\"color: #0000FF;\\\">])</span>\\n <span style=\\\"color: #008080;\\\">if</span> <span style=\\\"color: #000000;\\\">l</span><span style=\\\"color: #0000FF;\\\">!=</span><span style=\\\"color: #000000;\\\">k</span> <span style=\\\"color: #008080;\\\">then</span> <span style=\\\"color: #000080;font-style:italic;\\\">-- ignore self-references</span>\\n <span style=\\\"color: #000000;\\\">dependencies</span> <span style=\\\"color: #0000FF;\\\">&=</span> <span style=\\\"color: #000000;\\\">l</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;\\\">names</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">k</span><span style=\\\"color: #0000FF;\\\">][</span><span style=\\\"color: #000000;\\\">DEP</span><span style=\\\"color: #0000FF;\\\">]</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">dependencies</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">for</span>\\n\\n <span style=\\\"color: #000080;font-style:italic;\\\">-- Now populate names[RANK] iteratively:</span>\\n <span style=\\\"color: #004080;\\\">bool</span> <span style=\\\"color: #000000;\\\">more</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #004600;\\\">true</span>\\n <span style=\\\"color: #004080;\\\">integer</span> <span style=\\\"color: #000000;\\\">rank</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">0</span>\\n <span style=\\\"color: #008080;\\\">while</span> <span style=\\\"color: #000000;\\\">more</span> <span style=\\\"color: #008080;\\\">do</span>\\n <span style=\\\"color: #000000;\\\">more</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #004600;\\\">false</span>\\n <span style=\\\"color: #000000;\\\">rank</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;\\\">names</span><span style=\\\"color: #0000FF;\\\">)</span> <span style=\\\"color: #008080;\\\">do</span>\\n <span style=\\\"color: #008080;\\\">if</span> <span style=\\\"color: #000000;\\\">names</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">i</span><span style=\\\"color: #0000FF;\\\">][</span><span style=\\\"color: #000000;\\\">RANK</span><span style=\\\"color: #0000FF;\\\">]=</span><span style=\\\"color: #000000;\\\">0</span> <span style=\\\"color: #008080;\\\">then</span>\\n <span style=\\\"color: #004080;\\\">bool</span> <span style=\\\"color: #000000;\\\">ok</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #004600;\\\">true</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;\\\">names</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">i</span><span style=\\\"color: #0000FF;\\\">][</span><span style=\\\"color: #000000;\\\">DEP</span><span style=\\\"color: #0000FF;\\\">])</span> <span style=\\\"color: #008080;\\\">do</span>\\n <span style=\\\"color: #004080;\\\">integer</span> <span style=\\\"color: #000000;\\\">ji</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">names</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">i</span><span style=\\\"color: #0000FF;\\\">][</span><span style=\\\"color: #000000;\\\">DEP</span><span style=\\\"color: #0000FF;\\\">][</span><span style=\\\"color: #000000;\\\">j</span><span style=\\\"color: #0000FF;\\\">],</span>\\n <span style=\\\"color: #000000;\\\">nr</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">names</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">ji</span><span style=\\\"color: #0000FF;\\\">][</span><span style=\\\"color: #000000;\\\">RANK</span><span style=\\\"color: #0000FF;\\\">]</span>\\n <span style=\\\"color: #008080;\\\">if</span> <span style=\\\"color: #000000;\\\">nr</span><span style=\\\"color: #0000FF;\\\">=</span><span style=\\\"color: #000000;\\\">0</span> <span style=\\\"color: #008080;\\\">or</span> <span style=\\\"color: #000000;\\\">nr</span><span style=\\\"color: #0000FF;\\\">=</span><span style=\\\"color: #000000;\\\">rank</span> <span style=\\\"color: #008080;\\\">then</span>\\n <span style=\\\"color: #000080;font-style:italic;\\\">-- not yet compiled, or same pass</span>\\n <span style=\\\"color: #000000;\\\">ok</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #004600;\\\">false</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: #008080;\\\">if</span> <span style=\\\"color: #000000;\\\">ok</span> <span style=\\\"color: #008080;\\\">then</span>\\n <span style=\\\"color: #000000;\\\">names</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">i</span><span style=\\\"color: #0000FF;\\\">][</span><span style=\\\"color: #000000;\\\">RANK</span><span style=\\\"color: #0000FF;\\\">]</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">rank</span>\\n <span style=\\\"color: #000000;\\\">more</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #004600;\\\">true</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;\\\">for</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">while</span>\\n\\n <span style=\\\"color: #000000;\\\">names</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">sort</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">names</span><span style=\\\"color: #0000FF;\\\">)</span> <span style=\\\"color: #000080;font-style:italic;\\\">-- (ie by [RANK=1] then [NAME=2])</span>\\n <span style=\\\"color: #004080;\\\">integer</span> <span style=\\\"color: #000000;\\\">prank</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">names</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">][</span><span style=\\\"color: #000000;\\\">RANK</span><span style=\\\"color: #0000FF;\\\">]</span>\\n <span style=\\\"color: #008080;\\\">if</span> <span style=\\\"color: #000000;\\\">prank</span><span style=\\\"color: #0000FF;\\\">=</span><span style=\\\"color: #000000;\\\">0</span> <span style=\\\"color: #008080;\\\">then</span> <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;\\\">\\\"** CYCLIC **:\\\"</span><span style=\\\"color: #0000FF;\\\">)</span> <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;\\\">1</span> <span style=\\\"color: #008080;\\\">to</span> <span style=\\\"color: #7060A8;\\\">length</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">names</span><span style=\\\"color: #0000FF;\\\">)</span> <span style=\\\"color: #008080;\\\">do</span>\\n <span style=\\\"color: #000000;\\\">rank</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">names</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">i</span><span style=\\\"color: #0000FF;\\\">][</span><span style=\\\"color: #000000;\\\">RANK</span><span style=\\\"color: #0000FF;\\\">]</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>\\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: #008080;\\\">iff</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">rank</span><span style=\\\"color: #0000FF;\\\">=</span><span style=\\\"color: #000000;\\\">prank</span><span style=\\\"color: #0000FF;\\\">?</span><span style=\\\"color: #008000;\\\">\\\" \\\"</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;\\\">if</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;\\\">names</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">i</span><span style=\\\"color: #0000FF;\\\">][</span><span style=\\\"color: #000000;\\\">NAME</span><span style=\\\"color: #0000FF;\\\">])</span>\\n <span style=\\\"color: #000000;\\\">prank</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">rank</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;\\\">procedure</span>\\n\\n <span style=\\\"color: #008080;\\\">constant</span> <span style=\\\"color: #000000;\\\">input</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #008000;\\\">\\\"\\\"\\\"\\n des_system_lib std synopsys std_cell_lib des_system_lib dw02 dw01 ramlib ieee\\n dw01 ieee dw01 dware gtech\\n dw02 ieee dw02 dware\\n dw03 std synopsys dware dw03 dw02 dw01 ieee gtech\\n dw04 dw04 ieee dw01 dware gtech\\n dw05 dw05 ieee dware\\n dw06 dw06 ieee dware\\n dw07 ieee dware\\n dware ieee dware\\n gtech ieee gtech\\n ramlib std ieee\\n std_cell_lib ieee std_cell_lib\\n synopsys\\\"\\\"\\\"</span>\\n\\n <span style=\\\"color: #000000;\\\">topsort</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">input</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;\\\">\\\"\\\\nbad input:\\\\n\\\"</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #000000;\\\">topsort</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">input</span><span style=\\\"color: #0000FF;\\\">&</span><span style=\\\"color: #008000;\\\">\\\"\\\\ndw01 dw04\\\"</span><span style=\\\"color: #0000FF;\\\">)</span>\\n<!--\\n\",\n \"language\": \"Phix\"\n },\n {\n \"code\": \"topological_sort(Precedences, Sorted) =>\\n\\n Edges = [K=V : [K,V] in Precedences],\\n Nodes = (domain(Edges) ++ range(Edges)).remove_dups(),\\n Sorted1 = [],\\n while (member(X,Nodes), not membchk(X,range(Edges)))\\n Sorted1 := Sorted1 ++ [X],\\n Nodes := Nodes.delete(X),\\n Edges := Edges.delete_key(X)\\n end,\\n % detect and remove a cycle\\n if Nodes.length > 0 then\\n println(\\\"\\\\nThe graph is cyclic. Here's the detected cycle.\\\"),\\n println(nodes_in_cycle=Nodes),\\n println(edges_in_cycle=Edges),\\n Sorted = [without_cycle=Sorted1,cycle=Nodes]\\n else\\n Sorted = Sorted1\\n end,\\n nl.\\n\\n% domain are the keys in L\\ndomain(L) = [K : K=_V in L].\\n\\n% range are the values of L\\nrange(L) = [V : _K=V in L].\\n\\n% deletes all pairs in L where a key is X\\n% (this is lessf on a multi-map in GNU SETL)\\ndelete_key(L,X) = [K=V : K=V in L, K!=X].\\n\",\n \"language\": \"Picat\"\n },\n {\n \"code\": \"main =>\\n deps(1,Deps),\\n Prec=[],\\n foreach(Lib=Dep in Deps)\\n Prec := Prec ++ [[D,Lib] : D in Dep, D != Lib]\\n end,\\n topological_sort(Prec,Sort),\\n println(Sort),\\n nl.\\n\\n% Dependencies\\ndeps(1,Deps) =>\\n Deps = [\\n des_system_lib=[std,synopsys,std_cell_lib,des_system_lib,dw02,dw01,ramlib,ieee],\\n dw01=[ieee,dw01,dware,gtech],\\n dw02=[ieee,dw02,dware],\\n dw03=[std,synopsys,dware,dw03,dw02,dw01,ieee,gtech],\\n dw04=[dw04,ieee,dw01,dware,gtech],\\n dw05=[dw05,ieee,dware],\\n dw06=[dw06,ieee,dware],\\n dw07=[ieee,dware],\\n dware=[ieee,dware],\\n gtech=[ieee,gtech],\\n ramlib=[std,ieee],\\n std_cell_lib=[ieee,std_cell_lib],\\n synopsys=[]\\n ].\\n\",\n \"language\": \"Picat\"\n },\n {\n \"code\": \"main =>\\n deps(with_cycle,Deps),\\n Prec=[],\\n foreach(Lib=Dep in Deps)\\n Prec := Prec ++ [[D,Lib] : D in Dep, D != Lib]\\n end,\\n topological_sort(Prec,Sort),\\n println(Sort),\\n nl.\\n\\ndeps(with_cycle,Deps) =>\\n Deps = [\\n des_system_lib=[std,synopsys,std_cell_lib,des_system_lib,dw02,dw01,ramlib,ieee],\\n % dw01=[ieee,dw01,dware,gtech], % orig\\n dw01=[ieee,dw01,dware,gtech,dw04], % make a cycle\\n dw02=[ieee,dw02,dware],\\n dw03=[std,synopsys,dware,dw03,dw02,dw01,ieee,gtech],\\n dw04=[dw04,ieee,dw01,dware,gtech],\\n dw05=[dw05,ieee,dware],\\n dw06=[dw06,ieee,dware],\\n dw07=[ieee,dware],\\n dware=[ieee,dware],\\n gtech=[ieee,gtech],\\n ramlib=[std,ieee],\\n std_cell_lib=[ieee,std_cell_lib],\\n synopsys=[],\\n % And some other cycles\\n cycle_1=[cycle_2],\\n cycle_2=[cycle_1],\\n cycle_3=[dw01,cycle_4,dw02,daw03],\\n cycle_4=[cycle_3,dw01,dw04]\\n ].\\n\",\n \"language\": \"Picat\"\n },\n {\n \"code\": \"(de sortDependencies (Lst)\\n (setq Lst # Build a flat list\\n (uniq\\n (mapcan\\n '((L)\\n (put (car L) 'dep (cdr L)) # Store dependencies in 'dep' properties\\n (copy L) )\\n (mapcar uniq Lst) ) ) ) # without self-dependencies\\n (make\\n (while Lst\\n (ifn (find '((This) (not (: dep))) Lst) # Found non-depending lib?\\n (quit \\\"Can't resolve dependencies\\\" Lst)\\n (del (link @) 'Lst) # Yes: Store in result\\n (for This Lst # and remove from 'dep's\\n (=: dep (delete @ (: dep))) ) ) ) ) )\\n\",\n \"language\": \"PicoLisp\"\n },\n {\n \"code\": \"#Input Data\\n$a=@\\\"\\ndes_system_lib std synopsys std_cell_lib des_system_lib dw02 dw01 ramlib ieee\\ndw01 ieee dw01 dware gtech\\ndw02 ieee dw02 dware\\ndw03 std synopsys dware dw03 dw02 dw01 ieee gtech\\ndw04 dw04 ieee dw01 dware gtech\\ndw05 dw05 ieee dware\\ndw06 dw06 ieee dware\\ndw07 ieee dware\\ndware ieee dware\\ngtech ieee gtech\\nramlib std ieee\\nstd_cell_lib ieee std_cell_lib\\nsynopsys\\n\\\"@\\n#Convert to Object[]\\n$c = switch ( $a.split([char] 10) ) {\\n $_ {\\n $b=$_.split(' ')\\n New-Object PSObject -Property @{\\n Library = $b[0]\\n \\\"Library Dependencies\\\" = @( $( $b[1..($b.length-1)] | Where-Object { $_ -match '\\\\w' } ) )\\n }\\n }\\n}\\n#Add pure dependencies\\n$c | ForEach-Object {\\n $_.\\\"Library Dependencies\\\" | Where-Object {\\n $d=$_\\n $(:andl foreach($i in $c) {\\n if($d -match $i.Library) {\\n $false\\n break andl\\n }\\n }) -eq $null\\n } | ForEach-Object {\\n $c+=New-Object PSObject -Property @{\\n Library=$_\\n \\\"Library Dependencies\\\"=@()\\n }\\n }\\n}\\n#Associate with a dependency value\\n##Initial Dependency Value\\n$d = $c | Sort Library | Select-Object Library,\\\"Library Dependencies\\\",@{\\n Name=\\\"Dep Value\\\"\\n Expression={\\n 1\\n }\\n}\\n##Modify Dependency Value, perform check for incorrect dependency\\n##Dep Value is determined by a parent child relationship, if a library is a parent, all libraries dependant on it are children\\nfor( $i=0; $i -lt $d.count; $i++ ) {\\n $errmsg=\\\"\\\"\\n foreach( $j in ( 0..( $d.count - 1 ) | Where-Object { $_ -ne $i } ) ) {\\n #Foreach other Child Library where this is a dependency, increase the Dep Value of the Child\\n if( $( :orl foreach( $k in $d[$j].\\\"Library Dependencies\\\" ) {\\n if( $k -match $d[$i].Library ) {\\n foreach( $n in $d[$i].\\\"Library Dependencies\\\" ) {\\n if( $n -match $d[$j].Library ) {\\n $errmsg=\\\"Error Cyclic Dependency {0}<->{1}\\\" -f $d[$i].Library, $d[$j].Library\\n break\\n }\\n }\\n $true\\n break orl\\n }\\n } ) ) {\\n #If the child has already been processed, increase the Dep Value of its children\\n if( $j -lt $i ) {\\n foreach( $l in ( 0..( $d.count - 1 ) | Where-Object { $_ -ne $j } ) ) {\\n if( $( :orl2 foreach( $m in $d[$l].\\\"Library Dependencies\\\" ) {\\n if( $m -match $d[$j].Library ) {\\n $true\\n break orl2\\n }\\n } ) ) {\\n $d[$l].\\\"Dep Value\\\"+=$d[$i].\\\"Dep Value\\\"\\n }\\n }\\n }\\n $d[$j].\\\"Dep Value\\\"+=$d[$i].\\\"Dep Value\\\"\\n }\\n if( $errmsg -ne \\\"\\\" ) {\\n $errmsg\\n $d=$null\\n break\\n }\\n }\\n}\\n#Sort and Display\\nif( $d ) {\\n $d | Sort \\\"Dep Value\\\",Library | ForEach-Object {\\n \\\"{0,-14} LIBRARY DEPENDENCIES`n{1,-14} ====================\\\" -f \\\"LIBRARY\\\", \\\"=======\\\"\\n } {\\n \\\"{0,-14} $($_.\\\"Library Dependencies\\\")\\\" -f $_.Library\\n }\\n}\\n\",\n \"language\": \"PowerShell\"\n },\n {\n \"code\": \"#EndOfDataMarker$ = \\\"::EndOfData::\\\"\\nDataSection\\n ;\\\"LIBRARY: [LIBRARY_DEPENDENCY_1 LIBRARY_DEPENDENCY_2 ... LIBRARY_DEPENDENCY_N]\\n Data.s \\\"des_system_lib: [std synopsys std_cell_lib des_system_lib dw02 dw01 ramlib ieee]\\\"\\n Data.s \\\"dw01: [ieee dw01 dware gtech]\\\"\\n ;Data.s \\\"dw01: [ieee dw01 dware gtech dw04]\\\" ;comment the previous line and uncomment this one for cyclic dependency\\n Data.s \\\"dw02: [ieee dw02 dware]\\\"\\n Data.s \\\"dw03: [std synopsys dware dw03 dw02 dw01 ieee gtech]\\\"\\n Data.s \\\"dw04: [dw04 ieee dw01 dware gtech]\\\"\\n Data.s \\\"dw05: [dw05 ieee dware]\\\"\\n Data.s \\\"dw06: [dw06 ieee dware]\\\"\\n Data.s \\\"dw07: [ieee dware]\\\"\\n Data.s \\\"dware: [ieee dware]\\\"\\n Data.s \\\"gtech: [ieee gtech]\\\"\\n Data.s \\\"ramlib: [std ieee]\\\"\\n Data.s \\\"std_cell_lib: [ieee std_cell_lib]\\\"\\n Data.s \\\"synopsys: nil\\\"\\n Data.s #EndOfDataMarker$\\nEndDataSection\\n\\nStructure DAG_node\\n Value.s\\n forRemoval.i ;flag marks elements that should be removed the next time they are accessed\\n List dependencies.s()\\nEndStructure\\n\\nIf Not OpenConsole()\\n MessageRequester(\\\"Error\\\",\\\"Unable to open console\\\")\\n End\\nEndIf\\n\\n;// initialize Directed Acyclic Graph //\\nDefine i, itemData.s, firstBracketPos\\nNewList DAG.DAG_node()\\nRepeat\\n Read.s itemData\\n itemData = Trim(itemData)\\n If itemData <> #EndOfDataMarker$\\n AddElement(DAG())\\n ;add library\\n DAG()\\\\Value = Trim(Left(itemData, FindString(itemData, \\\":\\\", 1) - 1))\\n ;parse library dependencies\\n firstBracketPos = FindString(itemData, \\\"[\\\", 1)\\n If firstBracketPos\\n itemData = Trim(Mid(itemData, firstBracketPos + 1, FindString(itemData, \\\"]\\\", 1) - firstBracketPos - 1))\\n For i = (CountString(itemData, \\\" \\\") + 1) To 1 Step -1\\n AddElement(DAG()\\\\dependencies())\\n DAG()\\\\dependencies() = StringField(itemData, i, \\\" \\\")\\n Next\\n EndIf\\n EndIf\\nUntil itemData = #EndOfDataMarker$\\n\\n;// process DAG //\\n;create DAG entry for nodes listed in dependencies but without their own entry\\nNewMap libraries()\\nForEach DAG()\\n ForEach DAG()\\\\dependencies()\\n libraries(DAG()\\\\dependencies()) = #True\\n If DAG()\\\\dependencies() = DAG()\\\\Value\\n DeleteElement(DAG()\\\\dependencies()) ;remove self-dependencies\\n EndIf\\n Next\\nNext\\n\\nForEach DAG()\\n If FindMapElement(libraries(),DAG()\\\\Value)\\n DeleteMapElement(libraries(),DAG()\\\\Value)\\n EndIf\\nNext\\n\\nResetList(DAG())\\nForEach libraries()\\n AddElement(DAG())\\n DAG()\\\\Value = MapKey(libraries())\\nNext\\nClearMap(libraries())\\n\\n;process DAG() repeatedly until no changes occur\\nNewList compileOrder.s()\\nRepeat\\n noChangesMade = #True\\n ForEach DAG()\\n If DAG()\\\\forRemoval\\n DeleteElement(DAG())\\n Else\\n ;remove dependencies that have been placed in the compileOrder\\n ForEach DAG()\\\\dependencies()\\n If FindMapElement(libraries(),DAG()\\\\dependencies())\\n DeleteElement(DAG()\\\\dependencies())\\n EndIf\\n Next\\n ;add DAG() entry to compileOrder if it has no more dependencies\\n If ListSize(DAG()\\\\dependencies()) = 0\\n AddElement(compileOrder())\\n compileOrder() = DAG()\\\\Value\\n libraries(DAG()\\\\Value) = #True ;mark the library for removal as a dependency\\n DAG()\\\\forRemoval = #True\\n noChangesMade = #False\\n EndIf\\n EndIf\\n Next\\nUntil noChangesMade\\n\\nIf ListSize(DAG())\\n PrintN(\\\"Cyclic dependencies detected in:\\\" + #CRLF$)\\n ForEach DAG()\\n PrintN(\\\" \\\" + DAG()\\\\Value)\\n Next\\nElse\\n PrintN(\\\"Compile order:\\\" + #CRLF$)\\n ForEach compileOrder()\\n PrintN(\\\" \\\" + compileOrder())\\n Next\\nEndIf\\n\\nPrint(#CRLF$ + #CRLF$ + \\\"Press ENTER to exit\\\")\\nInput()\\nCloseConsole()\\n\",\n \"language\": \"PureBasic\"\n },\n {\n \"code\": \"try:\\n from functools import reduce\\nexcept:\\n pass\\n\\ndata = {\\n 'des_system_lib': set('std synopsys std_cell_lib des_system_lib dw02 dw01 ramlib ieee'.split()),\\n 'dw01': set('ieee dw01 dware gtech'.split()),\\n 'dw02': set('ieee dw02 dware'.split()),\\n 'dw03': set('std synopsys dware dw03 dw02 dw01 ieee gtech'.split()),\\n 'dw04': set('dw04 ieee dw01 dware gtech'.split()),\\n 'dw05': set('dw05 ieee dware'.split()),\\n 'dw06': set('dw06 ieee dware'.split()),\\n 'dw07': set('ieee dware'.split()),\\n 'dware': set('ieee dware'.split()),\\n 'gtech': set('ieee gtech'.split()),\\n 'ramlib': set('std ieee'.split()),\\n 'std_cell_lib': set('ieee std_cell_lib'.split()),\\n 'synopsys': set(),\\n }\\n\\ndef toposort2(data):\\n for k, v in data.items():\\n v.discard(k) # Ignore self dependencies\\n extra_items_in_deps = reduce(set.union, data.values()) - set(data.keys())\\n data.update({item:set() for item in extra_items_in_deps})\\n while True:\\n ordered = set(item for item,dep in data.items() if not dep)\\n if not ordered:\\n break\\n yield ' '.join(sorted(ordered))\\n data = {item: (dep - ordered) for item,dep in data.items()\\n if item not in ordered}\\n assert not data, \\\"A cyclic dependency exists amongst %r\\\" % data\\n\\nprint ('\\\\n'.join( toposort2(data) ))\\n\",\n \"language\": \"Python\"\n },\n {\n \"code\": \"from graphlib import TopologicalSorter\\n\\n# LIBRARY mapped_to LIBRARY DEPENDENCIES\\ndata = {\\n 'des_system_lib': set('std synopsys std_cell_lib des_system_lib dw02 dw01 ramlib ieee'.split()),\\n 'dw01': set('ieee dw01 dware gtech'.split()),\\n 'dw02': set('ieee dw02 dware'.split()),\\n 'dw03': set('std synopsys dware dw03 dw02 dw01 ieee gtech'.split()),\\n 'dw04': set('dw04 ieee dw01 dware gtech'.split()),\\n 'dw05': set('dw05 ieee dware'.split()),\\n 'dw06': set('dw06 ieee dware'.split()),\\n 'dw07': set('ieee dware'.split()),\\n 'dware': set('ieee dware'.split()),\\n 'gtech': set('ieee gtech'.split()),\\n 'ramlib': set('std ieee'.split()),\\n 'std_cell_lib': set('ieee std_cell_lib'.split()),\\n 'synopsys': set(),\\n }\\n# Ignore self dependencies\\nfor k, v in data.items():\\n v.discard(k)\\n\\nts = TopologicalSorter(data)\\nprint(tuple(ts.static_order()))\\n\",\n \"language\": \"Python\"\n },\n {\n \"code\": \"deps <- list(\\n\\\"des_system_lib\\\" = c(\\\"std\\\", \\\"synopsys\\\", \\\"std_cell_lib\\\", \\\"des_system_lib\\\", \\\"dw02\\\", \\\"dw01\\\", \\\"ramlib\\\", \\\"ieee\\\"),\\n\\\"dw01\\\" = c(\\\"ieee\\\", \\\"dw01\\\", \\\"dware\\\", \\\"gtech\\\", \\\"dw04\\\"),\\n\\\"dw02\\\" = c(\\\"ieee\\\", \\\"dw02\\\", \\\"dware\\\"),\\n\\\"dw03\\\" = c(\\\"std\\\", \\\"synopsys\\\", \\\"dware\\\", \\\"dw03\\\", \\\"dw02\\\", \\\"dw01\\\", \\\"ieee\\\", \\\"gtech\\\"),\\n\\\"dw04\\\" = c(\\\"dw04\\\", \\\"ieee\\\", \\\"dw01\\\", \\\"dware\\\", \\\"gtech\\\"),\\n\\\"dw05\\\" = c(\\\"dw05\\\", \\\"ieee\\\", \\\"dware\\\"),\\n\\\"dw06\\\" = c(\\\"dw06\\\", \\\"ieee\\\", \\\"dware\\\"),\\n\\\"dw07\\\" = c(\\\"ieee\\\", \\\"dware\\\"),\\n\\\"dware\\\" = c(\\\"ieee\\\", \\\"dware\\\"),\\n\\\"gtech\\\" = c(\\\"ieee\\\", \\\"gtech\\\"),\\n\\\"ramlib\\\" = c(\\\"std\\\", \\\"ieee\\\"),\\n\\\"std_cell_lib\\\" = c(\\\"ieee\\\", \\\"std_cell_lib\\\"),\\n\\\"synopsys\\\" = c())\\n\",\n \"language\": \"R\"\n },\n {\n \"code\": \"tsort <- function(deps) {\\n\\tnm <- names(deps)\\n\\tlibs <- union(as.vector(unlist(deps)), nm)\\n\\t\\n\\ts <- c()\\n\\t# first libs that depend on nothing\\n\\tfor(x in libs) {\\n\\t\\tif(!(x %in% nm)) {\\n\\t\\t\\ts <- c(s, x)\\n\\t\\t}\\n\\t}\\n\\t\\n\\tk <- 1\\n\\twhile(k > 0) {\\n\\t\\tk <- 0\\n\\t\\tfor(x in setdiff(nm, s)) {\\n\\t\\t\\tr <- c(s, x)\\n\\t\\t\\tif(length(setdiff(deps[[x]], r)) == 0) {\\n\\t\\t\\t\\ts <- r\\n\\t\\t\\t\\tk <- 1\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\t\\n\\tif(length(s) < length(libs)) {\\n\\t\\tv <- setdiff(libs, s)\\n\\t\\tstop(sprintf(\\\"Unorderable items :\\\\n%s\\\", paste(\\\"\\\", v, sep=\\\"\\\", collapse=\\\"\\\\n\\\")))\\n\\t}\\n\\t\\n\\ts\\n}\\n\",\n \"language\": \"R\"\n },\n {\n \"code\": \"tsort(deps)\\n# [1] \\\"std\\\" \\\"ieee\\\" \\\"dware\\\" \\\"gtech\\\" \\\"ramlib\\\"\\n# [6] \\\"std_cell_lib\\\" \\\"synopsys\\\" \\\"dw01\\\" \\\"dw02\\\" \\\"dw03\\\"\\n#[11] \\\"dw04\\\" \\\"dw05\\\" \\\"dw06\\\" \\\"dw07\\\" \\\"des_system_lib\\\"\\n\",\n \"language\": \"R\"\n },\n {\n \"code\": \"Unorderable items :\\ndes_system_lib\\ndw01\\ndw04\\ndw03\\n\",\n \"language\": \"R\"\n },\n {\n \"code\": \"#lang racket\\n\\n(define G\\n (make-hash\\n '((des_system_lib . (std synopsys std_cell_lib des_system_lib dw02\\n dw01 ramlib ieee))\\n (dw01 . (ieee dw01 dware gtech))\\n (dw02 . (ieee dw02 dware))\\n (dw03 . (std synopsys dware dw03 dw02 dw01 ieee gtech))\\n (dw04 . (dw04 ieee dw01 dware gtech))\\n (dw05 . (dw05 ieee dware))\\n (dw06 . (dw06 ieee dware))\\n (dw07 . (ieee dware))\\n (dware . (ieee dware))\\n (gtech . (ieee gtech))\\n (ramlib . (std ieee))\\n (std_cell_lib . (ieee std_cell_lib))\\n (synopsys . ()))))\\n\\n(define (clean G)\\n (define G* (hash-copy G))\\n (for ([(from tos) G])\\n ; remove self dependencies\\n (hash-set! G* from (remove from tos))\\n ; make sure all nodes are present in the ht\\n (for ([to tos]) (hash-update! G* to (λ(_)_) '())))\\n G*)\\n\\n(define (incoming G)\\n (define in (make-hash))\\n (for* ([(from tos) G] [to tos])\\n (hash-update! in to (λ(fs) (cons from fs)) '()))\\n in)\\n\\n(define (nodes G) (hash-keys G))\\n(define (out G n) (hash-ref G n '()))\\n(define (remove! G n m) (hash-set! G n (remove m (out G n))))\\n\\n(define (topo-sort G)\\n (define n (length (nodes G)))\\n (define in (incoming G))\\n (define (no-incoming? n) (empty? (hash-ref in n '())))\\n (let loop ([L '()] [S (list->set (filter no-incoming? (nodes G)))])\\n (cond [(set-empty? S)\\n (if (= (length L) n)\\n L\\n (error 'topo-sort (~a \\\"cycle detected\\\" G)))]\\n [else\\n (define n (set-first S))\\n (define S\\\\n (set-rest S))\\n (for ([m (out G n)])\\n (remove! G n m)\\n (remove! in m n)\\n (when (no-incoming? m)\\n (set! S\\\\n (set-add S\\\\n m))))\\n (loop (cons n L) S\\\\n)])))\\n\\n(topo-sort (clean G))\\n\",\n \"language\": \"Racket\"\n },\n {\n \"code\": \"'(synopsys ieee dware gtech std_cell_lib std ramlib dw07 dw06 dw05 dw01 dw04 dw02 dw03 des_system_lib)\\n\",\n \"language\": \"Racket\"\n },\n {\n \"code\": \"sub print_topo_sort ( %deps ) {\\n my %ba;\\n for %deps.kv -> $before, @afters {\\n for @afters -> $after {\\n %ba{$before}{$after} = 1 if $before ne $after;\\n %ba{$after} //= {};\\n }\\n }\\n\\n while %ba.grep( not *.value )».key -> @afters {\\n say ~@afters.sort;\\n %ba{@afters}:delete;\\n for %ba.values { .{@afters}:delete }\\n }\\n\\n say %ba ?? \\\"Cycle found! {%ba.keys.sort}\\\" !! '---';\\n}\\n\\nmy %deps =\\n des_system_lib => < std synopsys std_cell_lib des_system_lib dw02\\n dw01 ramlib ieee >,\\n dw01 => < ieee dw01 dware gtech >,\\n dw02 => < ieee dw02 dware >,\\n dw03 => < std synopsys dware dw03 dw02 dw01 ieee gtech >,\\n dw04 => < dw04 ieee dw01 dware gtech >,\\n dw05 => < dw05 ieee dware >,\\n dw06 => < dw06 ieee dware >,\\n dw07 => < ieee dware >,\\n dware => < ieee dware >,\\n gtech => < ieee gtech >,\\n ramlib => < std ieee >,\\n std_cell_lib => < ieee std_cell_lib >,\\n synopsys => < >;\\n\\nprint_topo_sort(%deps);\\n%deps<dw01> = <ieee dw01 dware gtech dw04>; # Add unresolvable dependency\\nprint_topo_sort(%deps);\\n\",\n \"language\": \"Raku\"\n },\n {\n \"code\": \"/*REXX pgm does a topological sort (orders such that no item precedes a dependent item).*/\\niDep.= 0; iPos.= 0; iOrd.= 0 /*initialize some stemmed arrays to 0.*/\\n nL= 15; nd= 44; nc= 69 /* \\\" \\\" \\\"parms\\\" and indices.*/\\nlabel= 'DES_SYSTEM_LIB DW01 DW02 DW03 DW04 DW05 DW06 DW07' ,\\n 'DWARE GTECH RAMLIB STD_CELL_LIB SYNOPSYS STD IEEE'\\niCode= 1 14 13 12 1 3 2 11 15 0 2 15 2 9 10 0 3 15 3 9 0 4 14 213 9 4 3 2 15 10 0 5 5 15 ,\\n 2 9 10 0 6 6 15 9 0 7 7 15 9 0 8 15 9 0 39 15 9 0 10 15 10 0 11 14 15 0 12 15 12 0 0\\nj= 0\\n do i=1\\n iL= word(iCode, i); if iL==0 then leave\\n do forever; i= i+1\\n iR= word(iCode, i); if iR==0 then leave\\n j= j+1; iDep.j.1= iL\\n iDep.j.2= iR\\n end /*forever*/\\n end /*i*/\\ncall tSort\\nsay '═══compile order═══'\\n@= 'libraries found.)'\\n#=0; do o=nO by -1 for nO; #= #+1; say word(label, iOrd.o)\\n end /*o*/; if #==0 then #= 'no'\\nsay ' ('# @; say\\nsay '═══unordered libraries═══'\\n#=0; do u=nO+1 to nL; #= #+1; say word(label, iOrd.u)\\n end /*u*/; if #==0 then #= 'no'\\nsay ' ('# \\\"unordered\\\" @\\nexit /*stick a fork in it, we're all done. */\\n/*──────────────────────────────────────────────────────────────────────────────────────*/\\ntSort: procedure expose iDep. iOrd. iPos. nd nL nO\\n do i=1 for nL; iOrd.i= i; iPos.i= i\\n end /*i*/\\n k= 1\\n do until k<=j; j = k; k= nL+1\\n do i=1 for nd; iL = iDep.i.1; iR= iPos.iL\\n ipL= iPos.iL; ipR= iPos.iR\\n if iL==iR | ipL>.k | ipL<j | ipR<j then iterate\\n k= k-1\\n _= iOrd.k; iPos._ = ipL\\n iPos.iL= k\\n iOrd.ipL= iOrd.k; iOrd.k = iL\\n end /*i*/\\n end /*until*/\\n nO= j-1; return\\n\",\n \"language\": \"REXX\"\n },\n {\n \"code\": \"require 'tsort'\\nclass Hash\\n include TSort\\n alias tsort_each_node each_key\\n def tsort_each_child(node, &block)\\n fetch(node).each(&block)\\n end\\nend\\n\\ndepends = {}\\nDATA.each do |line|\\n key, *libs = line.split\\n depends[key] = libs\\n libs.each {|lib| depends[lib] ||= []}\\nend\\n\\nbegin\\n p depends.tsort\\n depends[\\\"dw01\\\"] << \\\"dw04\\\"\\n p depends.tsort\\nrescue TSort::Cyclic => e\\n puts \\\"\\\\ncycle detected: #{e}\\\"\\nend\\n\\n__END__\\ndes_system_lib std synopsys std_cell_lib des_system_lib dw02 dw01 ramlib ieee\\ndw01 ieee dw01 dware gtech\\ndw02 ieee dw02 dware\\ndw03 std synopsys dware dw03 dw02 dw01 ieee gtech\\ndw04 dw04 ieee dw01 dware gtech\\ndw05 dw05 ieee dware\\ndw06 dw06 ieee dware\\ndw07 ieee dware\\ndware ieee dware\\ngtech ieee gtech\\nramlib std ieee\\nstd_cell_lib ieee std_cell_lib\\nsynopsys\\n\",\n \"language\": \"Ruby\"\n },\n {\n \"code\": \"use std::boxed::Box;\\nuse std::collections::{HashMap, HashSet};\\n\\n#[derive(Debug, PartialEq, Eq, Hash)]\\nstruct Library<'a> {\\n name: &'a str,\\n children: Vec<&'a str>,\\n num_parents: usize,\\n}\\n\\nfn build_libraries(input: Vec<&str>) -> HashMap<&str, Box<Library>> {\\n let mut libraries: HashMap<&str, Box<Library>> = HashMap::new();\\n\\n for input_line in input {\\n let line_split = input_line.split_whitespace().collect::<Vec<&str>>();\\n let name = line_split.get(0).unwrap();\\n let mut num_parents: usize = 0;\\n for parent in line_split.iter().skip(1) {\\n if parent == name {\\n continue;\\n }\\n if !libraries.contains_key(parent) {\\n libraries.insert(\\n parent,\\n Box::new(Library {\\n name: parent,\\n children: vec![name],\\n num_parents: 0,\\n }),\\n );\\n } else {\\n libraries.get_mut(parent).unwrap().children.push(name);\\n }\\n num_parents += 1;\\n }\\n\\n if !libraries.contains_key(name) {\\n libraries.insert(\\n name,\\n Box::new(Library {\\n name,\\n children: Vec::new(),\\n num_parents,\\n }),\\n );\\n } else {\\n libraries.get_mut(name).unwrap().num_parents = num_parents;\\n }\\n }\\n libraries\\n}\\n\\nfn topological_sort<'a>(\\n mut libraries: HashMap<&'a str, Box<Library<'a>>>,\\n) -> Result<Vec<&'a str>, String> {\\n let mut needs_processing = libraries\\n .iter()\\n .map(|(k, _v)| k.clone())\\n .collect::<HashSet<&str>>();\\n let mut options: Vec<&str> = libraries\\n .iter()\\n .filter(|(_k, v)| v.num_parents == 0)\\n .map(|(k, _v)| *k)\\n .collect();\\n let mut sorted: Vec<&str> = Vec::new();\\n while !options.is_empty() {\\n let cur = options.pop().unwrap();\\n for children in libraries\\n .get_mut(cur)\\n .unwrap()\\n .children\\n .drain(0..)\\n .collect::<Vec<&str>>()\\n {\\n let child = libraries.get_mut(children).unwrap();\\n child.num_parents -= 1;\\n if child.num_parents == 0 {\\n options.push(child.name)\\n }\\n }\\n sorted.push(cur);\\n needs_processing.remove(cur);\\n }\\n match needs_processing.is_empty() {\\n true => Ok(sorted),\\n false => Err(format!(\\\"Cycle detected among {:?}\\\", needs_processing)),\\n }\\n}\\n\\nfn main() {\\n let input: Vec<&str> = vec![\\n \\\"des_system_lib std synopsys std_cell_lib des_system_lib dw02 dw01 ramlib ieee\\\\n\\\",\\n \\\"dw01 ieee dw01 dware gtech dw04\\\\n\\\",\\n \\\"dw02 ieee dw02 dware\\\\n\\\",\\n \\\"dw03 std synopsys dware dw03 dw02 dw01 ieee gtech\\\\n\\\",\\n \\\"dw04 dw04 ieee dw01 dware gtech\\\\n\\\",\\n \\\"dw05 dw05 ieee dware\\\\n\\\",\\n \\\"dw06 dw06 ieee dware\\\\n\\\",\\n \\\"dw07 ieee dware\\\\n\\\",\\n \\\"dware ieee dware\\\\n\\\",\\n \\\"gtech ieee gtech\\\\n\\\",\\n \\\"ramlib std ieee\\\\n\\\",\\n \\\"std_cell_lib ieee std_cell_lib\\\\n\\\",\\n \\\"synopsys\\\\n\\\",\\n ];\\n\\n let libraries = build_libraries(input);\\n match topological_sort(libraries) {\\n Ok(sorted) => println!(\\\"{:?}\\\", sorted),\\n Err(msg) => println!(\\\"{:?}\\\", msg),\\n }\\n}\\n\",\n \"language\": \"Rust\"\n },\n {\n \"code\": \"(import (chezscheme))\\n(import (srfi srfi-1))\\n\\n\\n(define (remove-self-dependency pair)\\n (let ((key (car pair))\\n (value (cdr pair)))\\n (cons key (remq key value))))w\\n\\n(define (remove-self-dependencies alist)\\n (map remove-self-dependency alist))\\n\\n(define (add-missing-items dependencies)\\n (let loop ((items (delete-duplicates (append-map cdr dependencies) eq?))\\n (out dependencies))\\n (if (null? items)\\n out\\n (let ((item (car items)))\\n (if (assq item out)\\n (loop (cdr items) out)\\n (loop (cdr items) (cons (cons item '()) out)))))))\\n\\n(define (lift dependencies batch)\\n (let loop ((dependencies dependencies)\\n (out '()))\\n (if (null? dependencies)\\n out\\n (let ((key (caar dependencies))\\n (value (cdar dependencies)))\\n (if (null? value)\\n (loop (cdr dependencies) out)\\n (loop (cdr dependencies)\\n (cons (cons key (lset-difference eq? value batch))\\n out)))))))\\n\\n(define (topological-sort dependencies)\\n (let* ((dependencies (remove-self-dependencies dependencies))\\n (dependencies (add-missing-items dependencies)))\\n (let loop ((out '())\\n (dependencies dependencies))\\n (if (null? dependencies)\\n (reverse out)\\n (let ((batch (map car (filter (lambda (pair) (null? (cdr pair))) dependencies))))\\n (if (null? batch)\\n #f\\n (loop (cons batch out) (lift dependencies batch))))))))\\n\\n\\n(define example\\n '((des_system_lib . (std synopsys std_cell_lib des_system_lib dw02\\n dw01 ramlib ieee))\\n (dw01 . (ieee dw01 dware gtech))\\n (dw02 . (ieee dw02 dware))\\n (dw03 . (std synopsys dware dw03 dw02 dw01 ieee gtech))\\n (dw04 . (dw04 ieee dw01 dware gtech))\\n (dw05 . (dw05 ieee dware))\\n (dw06 . (dw06 ieee dware))\\n (dw07 . (ieee dware))\\n (dware . (ieee dware))\\n (gtech . (ieee gtech))\\n (ramlib . (std ieee))\\n (std_cell_lib . (ieee std_cell_lib))\\n (synopsys . ())))\\n\\n(write (topological-sort example))\\n\\n\\n(define unsortable\\n '((des_system_lib . (std synopsys std_cell_lib des_system_lib dw02\\n dw01 ramlib ieee))\\n (dw01 . (ieee dw01 dware gtech dw04))\\n (dw02 . (ieee dw02 dware))\\n (dw03 . (std synopsys dware dw03 dw02 dw01 ieee gtech))\\n (dw04 . (dw04 ieee dw01 dware gtech))\\n (dw05 . (dw05 ieee dware))\\n (dw06 . (dw06 ieee dware))\\n (dw07 . (ieee dware))\\n (dware . (ieee dware))\\n (gtech . (ieee gtech))\\n (ramlib . (std ieee))\\n (std_cell_lib . (ieee std_cell_lib))\\n (synopsys . ())))\\n\\n(newline)\\n(write (topological-sort unsortable))\\n\",\n \"language\": \"Scheme\"\n },\n {\n \"code\": \"func print_topo_sort (deps) {\\n var ba = Hash.new;\\n deps.each { |before, afters|\\n afters.each { |after|\\n if (before != after) {\\n ba{before}{after} = 1;\\n };\\n ba{after} \\\\\\\\= Hash.new;\\n }\\n };\\n\\n loop {\\n var afters = ba.keys.grep {|k| ba{k}.values.len == 0 }.sort;\\n afters.len || break;\\n say afters.join(\\\" \\\");\\n ba.delete(afters...);\\n ba.values.each { |v| v.delete(afters...) };\\n };\\n\\n say (ba.len ? \\\"Cicle found! #{ba.keys.sort}\\\" : \\\"---\\\");\\n}\\n\\nvar deps = Hash.new(\\n des_system_lib => < std synopsys std_cell_lib des_system_lib dw02\\n dw01 ramlib ieee >,\\n dw01 => < ieee dw01 dware gtech >,\\n dw02 => < ieee dw02 dware >,\\n dw03 => < std synopsys dware dw03 dw02 dw01 ieee gtech >,\\n dw04 => < dw04 ieee dw01 dware gtech >,\\n dw05 => < dw05 ieee dware >,\\n dw06 => < dw06 ieee dware >,\\n dw07 => < ieee dware >,\\n dware => < ieee dware >,\\n gtech => < ieee gtech >,\\n ramlib => < std ieee >,\\n std_cell_lib => < ieee std_cell_lib >,\\n synopsys => < >\\n);\\n\\nprint_topo_sort(deps);\\ndeps{:dw01}.append('dw04'); # Add unresolvable dependency\\nprint_topo_sort(deps);\\n\",\n \"language\": \"Sidef\"\n },\n {\n \"code\": \"let libs = [\\n (\\\"des_system_lib\\\", [\\\"std\\\", \\\"synopsys\\\", \\\"std_cell_lib\\\", \\\"des_system_lib\\\", \\\"dw02\\\", \\\"dw01\\\", \\\"ramlib\\\", \\\"ieee\\\"]),\\n (\\\"dw01\\\", [\\\"ieee\\\", \\\"dw01\\\", \\\"dware\\\", \\\"gtech\\\"]),\\n (\\\"dw02\\\", [\\\"ieee\\\", \\\"dw02\\\", \\\"dware\\\"]),\\n (\\\"dw03\\\", [\\\"std\\\", \\\"synopsys\\\", \\\"dware\\\", \\\"dw03\\\", \\\"dw02\\\", \\\"dw01\\\", \\\"ieee\\\", \\\"gtech\\\"]),\\n (\\\"dw04\\\", [\\\"dw04\\\", \\\"ieee\\\", \\\"dw01\\\", \\\"dware\\\", \\\"gtech\\\"]),\\n (\\\"dw05\\\", [\\\"dw05\\\", \\\"ieee\\\", \\\"dware\\\"]),\\n (\\\"dw06\\\", [\\\"dw06\\\", \\\"ieee\\\", \\\"dware\\\"]),\\n (\\\"dw07\\\", [\\\"ieee\\\", \\\"dware\\\"]),\\n (\\\"dware\\\", [\\\"ieee\\\", \\\"dware\\\"]),\\n (\\\"gtech\\\", [\\\"ieee\\\", \\\"gtech\\\"]),\\n (\\\"ramlib\\\", [\\\"std\\\", \\\"ieee\\\"]),\\n (\\\"std_cell_lib\\\", [\\\"ieee\\\", \\\"std_cell_lib\\\"]),\\n (\\\"synopsys\\\", [])\\n]\\n\\nstruct Library {\\n var name: String\\n var children: [String]\\n var numParents: Int\\n}\\n\\nfunc buildLibraries(_ input: [(String, [String])]) -> [String: Library] {\\n var libraries = [String: Library]()\\n\\n for (name, parents) in input {\\n var numParents = 0\\n\\n for parent in parents where parent != name {\\n numParents += 1\\n\\n libraries[parent, default: Library(name: parent, children: [], numParents: 0)].children.append(name)\\n }\\n\\n libraries[name, default: Library(name: name, children: [], numParents: numParents)].numParents = numParents\\n }\\n\\n return libraries\\n}\\n\\nfunc topologicalSort(libs: [String: Library]) -> [String]? {\\n var libs = libs\\n var needsProcessing = Set(libs.keys)\\n var options = libs.compactMap({ $0.value.numParents == 0 ? $0.key : nil })\\n var sorted = [String]()\\n\\n while let cur = options.popLast() {\\n for children in libs[cur]?.children ?? [] {\\n libs[children]?.numParents -= 1\\n\\n if libs[children]?.numParents == 0 {\\n options.append(libs[children]!.name)\\n }\\n }\\n\\n libs[cur]?.children.removeAll()\\n\\n sorted.append(cur)\\n needsProcessing.remove(cur)\\n }\\n\\n guard needsProcessing.isEmpty else {\\n return nil\\n }\\n\\n return sorted\\n}\\n\\nprint(topologicalSort(libs: buildLibraries(libs))!)\\n\",\n \"language\": \"Swift\"\n },\n {\n \"code\": \"data node <'.+'>, from <node>, to <node>\\n\\ntemplates topologicalSort\\n @: [];\\n {V: {|$.v..., $.e({node: §.to})...|} , E: {|$.e... -> \\\\(<{from: <~=$.to>}> $! \\\\)|}} -> #\\n when <{V: <?($::count <=0>)>}> $@!\\n otherwise\\n def independent: ($.V notMatching $.E({node: §.from}));\\n [$independent... -> $.node] -> ..|@: $;\\n {V: ($.V notMatching $independent), E: ($.E notMatching $independent({to: §.node}))}\\n -> \\\\(<?($independent::count <1..>)> $! \\\\) -> #\\nend topologicalSort\\n\\ncomposer lines\\n [<line>+]\\n rule line: <'[^\\\\n]*'> (<'\\\\n'>)\\nend lines\\n\\ntemplates collectDeps\\n @: { v: [], e: []};\\n composer depRecord\\n (<WS>? def node: <~WS>; <WS>? <dep>* <WS>? $node -> ..|@collectDeps.v: {node: $};)\\n rule dep: (<~WS> -> ..|@collectDeps.e: {from: node´$node, to: node´$}; <WS>?)\\n end depRecord\\n $(3..last)... -> !depRecord\\n $@!\\nend collectDeps\\n\\n'LIBRARY LIBRARY DEPENDENCIES\\n ======= ====================\\n des_system_lib std synopsys std_cell_lib des_system_lib dw02 dw01 ramlib ieee\\n dw01 ieee dw01 dware gtech\\n dw02 ieee dw02 dware\\n dw03 std synopsys dware dw03 dw02 dw01 ieee gtech\\n dw04 dw04 ieee dw01 dware gtech\\n dw05 dw05 ieee dware\\n dw06 dw06 ieee dware\\n dw07 ieee dware\\n dware ieee dware\\n gtech ieee gtech\\n ramlib std ieee\\n std_cell_lib ieee std_cell_lib\\n synopsys\\n' -> lines -> collectDeps -> topologicalSort -> !OUT::write\\n\",\n \"language\": \"Tailspin\"\n },\n {\n \"code\": \"package require Tcl 8.5\\nproc topsort {data} {\\n # Clean the data\\n dict for {node depends} $data {\\n\\tif {[set i [lsearch -exact $depends $node]] >= 0} {\\n\\t set depends [lreplace $depends $i $i]\\n\\t dict set data $node $depends\\n\\t}\\n\\tforeach node $depends {dict lappend data $node}\\n }\\n # Do the sort\\n set sorted {}\\n while 1 {\\n\\t# Find available nodes\\n\\tset avail [dict keys [dict filter $data value {}]]\\n\\tif {![llength $avail]} {\\n\\t if {[dict size $data]} {\\n\\t\\terror \\\"graph is cyclic, possibly involving nodes \\\\\\\"[dict keys $data]\\\\\\\"\\\"\\n\\t }\\n\\t return $sorted\\n\\t}\\n\\t# Note that the lsort is only necessary for making the results more like other langs\\n\\tlappend sorted {*}[lsort $avail]\\n # Remove from working copy of graph\\n\\tdict for {node depends} $data {\\n\\t foreach n $avail {\\n\\t\\tif {[set i [lsearch -exact $depends $n]] >= 0} {\\n\\t\\t set depends [lreplace $depends $i $i]\\n\\t\\t dict set data $node $depends\\n\\t\\t}\\n\\t }\\n\\t}\\n\\tforeach node $avail {\\n\\t dict unset data $node\\n\\t}\\n }\\n}\\n\",\n \"language\": \"Tcl\"\n },\n {\n \"code\": \"set inputData {\\n des_system_lib\\tstd synopsys std_cell_lib des_system_lib dw02 dw01 ramlib ieee\\n dw01\\t\\tieee dw01 dware gtech\\n dw02\\t\\tieee dw02 dware\\n dw03\\t\\tstd synopsys dware dw03 dw02 dw01 ieee gtech\\n dw04\\t\\tdw04 ieee dw01 dware gtech\\n dw05\\t\\tdw05 ieee dware\\n dw06\\t\\tdw06 ieee dware\\n dw07\\t\\tieee dware\\n dware\\t\\tieee dware\\n gtech\\t\\tieee gtech\\n ramlib\\t\\tstd ieee\\n std_cell_lib\\tieee std_cell_lib\\n synopsys\\n}\\nforeach line [split $inputData \\\\n] {\\n if {[string trim $line] eq \\\"\\\"} continue\\n dict set parsedData [lindex $line 0] [lrange $line 1 end]\\n}\\nputs [topsort $parsedData]\\n\",\n \"language\": \"Tcl\"\n },\n {\n \"code\": \"record graph(nodes,arcs)\\n\\nprocedure main()\\n show(tsort(getgraph()))\\nend\\n\\nprocedure tsort(g)\\n t := []\\n while *(n := g.nodes -- pnodes(g)) > 0 do {\\n every put(p := [], !n)\\n put(t, p)\\n g := delete(g,n)\\n }\\n if *g.nodes = 0 then return t\\n write(\\\"graph contains the cycle:\\\")\\n write(\\\"\\\\t\\\",genpath(fn := !g.nodes,fn,g))\\nend\\n\\nprocedure pnodes(g)\\n cp := create !g.arcs\\n every insert(p := set(), |1(@cp,@cp))\\n return p\\nend\\n\\nprocedure delete(g,x)\\n arcs := []\\n cp := create !g.arcs\\n while (f := @cp, t := @cp) do {\\n if !x == (f|t) then next\\n every put(arcs,f|t)\\n }\\n return graph(g.nodes--x, arcs)\\nend\\n\\nprocedure getgraph()\\n arcs := []\\n nodes := set()\\n every line := !&input do {\\n nextWord := create genWords(line)\\n if nfrom := @nextWord then {\\n insert(nodes, nfrom)\\n while nto := @nextWord do {\\n if nfrom ~== nto then {\\n insert(nodes, nto)\\n every put(arcs, nfrom | nto)\\n }\\n }\\n }\\n }\\n return graph(nodes,arcs)\\nend\\n\\nprocedure genWords(s)\\n static wchars\\n initial wchars := &cset -- ' \\\\t'\\n s ? while tab(upto(wchars))\\\\1 do suspend tab(many(wchars))\\\\1\\nend\\n\\nprocedure show(t)\\n line := \\\"\\\"\\n every n := !t do\\n case type(n) of {\\n \\\"list\\\" : line ||:= \\\"\\\\n\\\\t(\\\"||toString(n)||\\\")\\\"\\n default : line ||:= \\\" \\\"||n\\n }\\n write(line)\\nend\\n\\nprocedure toString(n)\\n every (s := \\\"\\\") ||:= !n || \\\" \\\"\\n return s[1:-1] | s\\nend\\n\\nprocedure genpath(f,t,g, seen)\\n /seen := set()\\n insert(seen, f)\\n sn := nnodes(f,g)\\n if member(sn, t) then return f || \\\" -> \\\" || t\\n suspend f || \\\" -> \\\" || genpath(!(sn--seen),t,g,seen)\\nend\\n\\nprocedure nnodes(f,g)\\n t := set()\\n cp := create !g.arcs\\n while (af := @cp, at := @cp) do if af == f then insert(t, at)\\n return t\\nend\\n\",\n \"language\": \"Unicon\"\n },\n {\n \"code\": \"$ awk '{ for (i = 1; i <= NF; i++) print $i, $1 }' <<! | tsort\\n> des_system_lib std synopsys std_cell_lib des_system_lib dw02 dw01 ramlib ieee\\n> dw01 ieee dw01 dware gtech\\n> dw02 ieee dw02 dware\\n> dw03 std synopsys dware dw03 dw02 dw01 ieee gtech\\n> dw04 dw04 ieee dw01 dware gtech\\n> dw05 dw05 ieee dware\\n> dw06 dw06 ieee dware\\n> dw07 ieee dware\\n> dware ieee dware\\n> gtech ieee gtech\\n> ramlib std ieee\\n> std_cell_lib ieee std_cell_lib\\n> synopsys\\n> !\\nieee\\ndware\\ndw02\\ndw05\\ndw06\\ndw07\\ngtech\\ndw01\\ndw04\\nstd_cell_lib\\nsynopsys\\nstd\\ndw03\\nramlib\\ndes_system_lib\\n\",\n \"language\": \"UNIX-Shell\"\n },\n {\n \"code\": \"tsort = ~&nmnNCjA*imSLs2nSjiNCSPT; @NiX ^=lxPrnSPX ^(~&rlPlT,~&rnPrmPljA*D@r)^|/~& ~&m!=rnSPlX\\n\",\n \"language\": \"Ursala\"\n },\n {\n \"code\": \"#import std\\n\\ndependence_table = -[\\n\\nLIBRARY LIBRARY DEPENDENCIES\\n======= ====================\\ndes_system_lib std synopsys std_cell_lib des_system_lib dw02 dw01 ramlib ieee\\ndw01 ieee dw01 dware gtech\\ndw02 ieee dw02 dware\\ndw03 std synopsys dware dw03 dw02 dw01 ieee gtech\\ndw04 dw04 ieee dw01 dware gtech\\ndw05 dw05 ieee dware\\ndw06 dw06 ieee dware\\ndw07 ieee dware\\ndware ieee dware\\ngtech ieee gtech\\nramlib std ieee\\nstd_cell_lib ieee std_cell_lib\\nsynopsys ]-\\n\\nparse = ~&htA*FS+ sep` *tttt\\n\\n#show+\\n\\nmain = <.~&l,@r ~&i&& 'unorderable: '--> mat` ~~ tsort parse dependence_table\\n\",\n \"language\": \"Ursala\"\n },\n {\n \"code\": \"class topological\\n\\tdim dictDependencies\\n\\tdim dictReported\\n\\tdim depth\\n\\t\\n\\tsub class_initialize\\n\\t\\tset dictDependencies = createobject(\\\"Scripting.Dictionary\\\")\\n\\t\\tset dictReported = createobject(\\\"Scripting.Dictionary\\\")\\n\\t\\tdepth = 0\\n\\tend sub\\n\\t\\n\\tsub reset\\n\\t\\tdictReported.removeall\\n\\tend sub\\n\\t\\n\\tproperty let dependencies( s )\\n\\t\\t'assuming token tab token-list newline\\n\\t\\tdim i, j ,k\\n\\t\\tdim aList\\n\\t\\tdim dep\\n\\t\\tdim a1\\n\\t\\taList = Split( s, vbNewLine )\\n\\t\\t'~ remove empty lines at end\\n\\t\\tdo while aList( UBound( aList ) ) = vbnullstring\\n\\t\\t\\tredim preserve aList( UBound( aList ) - 1 )\\n\\t\\tloop\\n\\n\\t\\tfor i = lbound( aList ) to ubound( aList )\\n\\t\\t\\taList( i ) = Split( aList( i ), vbTab, 2 )\\n\\t\\t\\ta1 = Split( aList( i )( 1 ), \\\" \\\" )\\n\\t\\t\\tk = 0\\n\\t\\t\\tfor j = lbound( a1) to ubound(a1)\\n\\t\\t\\t\\tif a1(j) <> aList(i)(0) then\\n\\t\\t\\t\\t\\ta1(k) = a1(j)\\n\\t\\t\\t\\t\\tk = k + 1\\n\\t\\t\\t\\tend if\\n\\t\\t\\tnext\\n\\t\\t\\tredim preserve a1(k-1)\\n\\t\\t\\taList(i)(1) = a1\\n\\t\\tnext\\n\\t\\tfor i = lbound( aList ) to ubound( aList )\\n\\t\\t\\tdep = aList(i)(0)\\n\\t\\t\\tif not dictDependencies.Exists( dep ) then\\n\\t\\t\\t\\tdictDependencies.add dep, aList(i)(1)\\n\\t\\t\\tend if\\n\\t\\tnext\\n\\t\\t\\n\\tend property\\n\\t\\n\\tsub resolve( s )\\n\\t\\tdim i\\n\\t\\tdim deps\\n\\t\\t'~ wscript.echo string(depth,\\\"!\\\"),s\\n\\t\\tdepth = depth + 1\\n\\t\\tif dictDependencies.Exists(s) then\\n\\t\\t\\tdeps = dictDependencies(s)\\n\\t\\t\\tfor i = lbound(deps) to ubound(deps)\\n\\t\\t\\t\\tresolve deps(i)\\n\\t\\t\\tnext\\n\\t\\tend if\\n\\t\\tif not seen(s) then\\n\\t\\t\\twscript.echo s\\n\\t\\t\\tsee s\\n\\t\\tend if\\n\\t\\tdepth = depth - 1\\n\\tend sub\\n\\n\\tfunction seen( key )\\n\\t\\tseen = dictReported.Exists( key )\\n\\tend function\\n\\t\\n\\tsub see( key )\\n\\t\\tdictReported.add key, \\\"\\\"\\n\\tend sub\\n\\t\\n\\tproperty get keys\\n\\t\\tkeys = dictDependencies.keys\\n\\tend property\\nend class\\n\",\n \"language\": \"VBScript\"\n },\n {\n \"code\": \"dim toposort\\nset toposort = new topological\\ntoposort.dependencies = \\\"des_system_lib\\tstd synopsys std_cell_lib des_system_lib dw02 dw01 ramlib ieee\\\" & vbNewLine & _\\n\\t\\\"dw01\\tieee dw01 dware gtech\\\" & vbNewLine & _\\n\\t\\\"dw02\\tieee dw02 dware\\\" & vbNewLine & _\\n\\t\\\"dw03\\tstd synopsys dware dw03 dw02 dw01 ieee gtech\\\" & vbNewLine & _\\n\\t\\\"dw04\\tdw04 ieee dw01 dware gtech\\\" & vbNewLine & _\\n\\t\\\"dw05\\tdw05 ieee dware\\\" & vbNewLine & _\\n\\t\\\"dw06\\tdw06 ieee dware\\\" & vbNewLine & _\\n\\t\\\"dw07\\tieee dware\\\" & vbNewLine & _\\n\\t\\\"dware\\tieee dware\\\" & vbNewLine & _\\n\\t\\\"gtech\\tieee gtech\\\" & vbNewLine & _\\n\\t\\\"ramlib\\tstd ieee\\\" & vbNewLine & _\\n\\t\\\"std_cell_lib\\tieee std_cell_lib\\\" & vbNewLine & _\\n\\t\\\"synopsys\\t\\\"\\n\\ndim k\\nfor each k in toposort.keys\\n\\twscript.echo \\\"----- \\\" & k\\n\\ttoposort.resolve k\\n\\twscript.echo \\\"-----\\\"\\n\\ttoposort.reset\\nnext\\n\",\n \"language\": \"VBScript\"\n },\n {\n \"code\": \"' Adapted from:\\n' http://tawani.blogspot.com/2009/02/topological-sorting-and-cyclic.html\\n' added/changed:\\n' - conversion to VB.Net (.Net 2 framework)\\n' - added Rosetta Code dependency format parsing\\n' - check & removal of self-dependencies before sorting\\nModule Program\\n\\tSub Main()\\n\\t\\tDim Fields As New List(Of Field)()\\n\\t\\t' You can also add Dependson using code like:\\n\\t\\t' .DependsOn = New String() {\\\"ieee\\\", \\\"dw01\\\", \\\"dware\\\"} _\\n\\n\\t\\tfields.Add(New Field() With { _\\n\\t\\t\\t.Name = \\\"des_system_lib\\\", _\\n\\t\\t\\t.DependsOn = Split(\\\"std synopsys std_cell_lib des_system_lib dw02 dw01 ramlib ieee\\\", \\\" \\\") _\\n\\t\\t})\\n\\t\\tfields.Add(New Field() With { _\\n\\t\\t\\t.Name = \\\"dw01\\\", _\\n\\t\\t\\t.DependsOn = Split(\\\"ieee dw01 dware gtech\\\", \\\" \\\") _\\n\\t\\t})\\n\\t\\tfields.Add(New Field() With { _\\n\\t\\t\\t.Name = \\\"dw02\\\", _\\n\\t\\t\\t.DependsOn = Split(\\\"ieee dw02 dware\\\", \\\" \\\") _\\n\\t\\t})\\n\\t\\tfields.Add(New Field() With { _\\n\\t\\t\\t.Name = \\\"dw03\\\", _\\n\\t\\t\\t.DependsOn = Split(\\\"std synopsys dware dw03 dw02 dw01 ieee gtech\\\", \\\" \\\") _\\t\\t\\t\\n\\t\\t})\\n\\t\\tfields.Add(New Field() With { _\\n\\t\\t\\t.Name = \\\"dw04\\\", _\\n\\t\\t\\t.DependsOn = Split(\\\"dw04 ieee dw01 dware gtech\\\", \\\" \\\") _\\t\\t\\t\\n\\t\\t})\\n\\t\\tfields.Add(New Field() With { _\\n\\t\\t\\t.Name = \\\"dw05\\\", _\\n\\t\\t\\t.DependsOn = Split(\\\"dw05 ieee dware\\\", \\\" \\\") _\\n\\t\\t})\\n\\t\\tfields.Add(New Field() With { _\\n\\t\\t\\t.Name = \\\"dw06\\\", _\\n\\t\\t\\t.DependsOn = Split(\\\"dw06 ieee dware\\\", \\\" \\\") _\\t\\t\\t\\n\\t\\t})\\n\\t\\tfields.Add(New Field() With { _\\n\\t\\t\\t.Name = \\\"dw07\\\", _\\n\\t\\t\\t.DependsOn = Split(\\\"ieee dware\\\", \\\" \\\") _\\t\\t\\t\\n\\t\\t})\\n\\t\\tfields.Add(New Field() With { _\\n\\t\\t\\t.Name = \\\"dware\\\", _\\n\\t\\t\\t.DependsOn = Split(\\\"ieee dware\\\", \\\" \\\") _\\n\\t\\t})\\n\\t\\tfields.Add(New Field() With { _\\n\\t\\t\\t.Name = \\\"gtech\\\", _\\n\\t\\t\\t.DependsOn = Split(\\\"ieee gtech\\\", \\\" \\\") _\\t\\t\\t\\n\\t\\t})\\n\\t\\tfields.Add(New Field() With { _\\n\\t\\t\\t.Name = \\\"ramlib\\\", _\\n\\t\\t\\t.DependsOn = Split(\\\"std ieee\\\", \\\" \\\") _\\t\\t\\t\\n\\t\\t})\\n\\t\\tfields.Add(New Field() With { _\\n\\t\\t\\t.Name = \\\"std_cell_lib\\\", _\\n\\t\\t\\t.DependsOn = Split(\\\"ieee std_cell_lib\\\", \\\" \\\") _\\t\\t\\t\\n\\t\\t})\\n\\t\\tfields.Add(New Field() With { _\\n\\t\\t\\t.Name = \\\"synopsys\\\" _\\n\\t\\t})\\t\\t\\n\\t\\tConsole.WriteLine(\\\"Input:\\\")\\n\\t\\tFor Each ThisField As field In fields\\n\\t\\t\\tConsole.WriteLine(ThisField.Name)\\n\\t\\t\\tIf ThisField.DependsOn IsNot Nothing Then\\n\\t\\t\\t\\tFor Each item As String In ThisField.DependsOn\\n\\t\\t\\t\\t\\tConsole.WriteLine(\\\" -{0}\\\", item)\\n\\t\\t\\t\\tNext\\n\\t\\t\\tEnd If\\n\\t\\tNext\\n\\n\\t\\tConsole.WriteLine(vbLf & \\\"...Sorting...\\\" & vbLf)\\n\\n\\t\\tDim sortOrder As Integer() = getTopologicalSortOrder(fields)\\n\\n\\t\\tFor i As Integer = 0 To sortOrder.Length - 1\\n\\t\\t\\tDim field = fields(sortOrder(i))\\n\\t\\t\\tConsole.WriteLine(field.Name)\\n\\t\\t\\t' Write up dependencies, too:\\n\\t\\t\\t'If field.DependsOn IsNot Nothing Then\\n\\t\\t\\t'\\tFor Each item As String In field.DependsOn\\n\\t\\t\\t'\\t\\tConsole.WriteLine(\\\" -{0}\\\", item)\\n\\t\\t\\t'\\tNext\\n\\t\\t\\t'End If\\n\\t\\tNext\\n\\t\\tConsole.Write(\\\"Press any key to continue . . . \\\")\\n\\t\\tConsole.ReadKey(True)\\n\\tEnd Sub\\n\\t\\n\\tPrivate Sub CheckDependencies (ByRef Fields As List(Of Field))\\n\\t\\t' Make sure all objects we depend on are part of the field list\\n\\t\\t' themselves, as there may be dependencies that are not specified as fields themselves.\\n\\t\\t' Remove dependencies on fields themselves.Y\\t\\t\\t\\n\\t\\tDim AField As Field, ADependency As String\\n\\t\\t\\n\\t\\tFor i As Integer = Fields.Count - 1 To 0 Step -1\\n\\t\\t\\tAField=fields(i)\\n\\t\\t\\tIf AField.DependsOn IsNot Nothing then\\n\\t\\t\\t\\tFor j As Integer = 0 To Ubound(AField.DependsOn)\\n\\t\\t\\t\\t\\tADependency = Afield.DependsOn(j)\\n\\t\\t\\t\\t\\t' We ignore fields that depends on themselves:\\n\\t\\t\\t\\t\\tIf AField.Name <> ADependency then\\n\\t\\t\\t\\t\\t\\tIf ListContainsVertex(fields, ADependency) = False Then\\n\\t\\t\\t\\t\\t\\t\\t' Add the dependent object to the field list, as it\\n\\t\\t\\t\\t\\t\\t\\t' needs to be there, without any dependencies\\n\\t\\t\\t\\t\\t\\t\\tFields.Add(New Field() With { _\\n\\t\\t\\t\\t\\t\\t\\t\\t.Name = ADependency _\\n\\t\\t\\t\\t\\t\\t\\t})\\n\\t\\t\\t\\t\\t\\tEnd If\\n\\t\\t\\t\\t\\tEnd If\\n\\t\\t\\t\\tNext j\\n\\t\\t\\tEnd If\\n\\t\\tNext i\\t\\n\\tEnd Sub\\n\\t\\n\\tPrivate Sub RemoveSelfDependencies (ByRef Fields As List(Of Field))\\n\\t\\t' Make sure our fields don't depend on themselves.\\n\\t\\t' If they do, remove the dependency.\\n\\t\\tDim InitialUbound as Integer\\n\\t\\tFor Each AField As Field In Fields\\t\\t\\t\\n\\t\\t\\tIf AField.DependsOn IsNot Nothing Then\\n\\t\\t\\t\\tInitialUbound = Ubound(AField.DependsOn)\\n\\t\\t\\t\\tFor i As Integer = InitialUbound to 0 Step - 1\\n\\t\\t\\t\\t\\tIf Afield.DependsOn(i) = Afield.Name Then\\n\\t\\t\\t\\t\\t\\t' This field depends on itself, so remove\\n\\t\\t\\t\\t\\t\\tFor j as Integer = i To UBound(AField.DependsOn)-1\\n\\t\\t\\t\\t\\t\\t\\tAfield.DependsOn(j)=Afield.DependsOn(j+1)\\n\\t\\t\\t\\t\\t\\tNext\\n\\t\\t\\t\\t\\t\\tReDim Preserve Afield.DependsOn(UBound(Afield.DependsOn)-1)\\n\\t\\t\\t\\t\\tEnd If\\n\\t\\t\\t\\tNext\\n\\t\\t\\tEnd If\\t\\t\\t\\n\\t\\tNext\\n\\tEnd Sub\\t\\n\\t\\t\\t\\n\\tPrivate Function ListContainsVertex(Fields As List(Of Field), VertexName As String) As Boolean\\n\\t' Check to see if the list of Fields already contains a vertext called VertexName\\n\\tDim Found As Boolean = False\\n\\t\\tFor i As Integer = 0 To fields.Count - 1\\n\\t\\t\\tIf Fields(i).Name = VertexName Then\\n\\t\\t\\t\\tFound = True\\n\\t\\t\\t\\tExit For\\n\\t\\t\\tEnd If\\n\\t\\tNext\\n\\t\\tReturn Found\\n\\tEnd Function\\n\\n\\tPrivate Function getTopologicalSortOrder(ByRef Fields As List(Of Field)) As Integer()\\n\\t\\t' Gets sort order. Will also add required dependencies to\\n\\t\\t' Fields.\\n\\t\\t\\n\\t\\t' Make sure we don't have dependencies on ourselves.\\n\\t\\t' We'll just get rid of them.\\n\\t\\tRemoveSelfDependencies(Fields)\\n\\t\\t\\n\\t\\t'First check depencies, add them to Fields if required:\\n\\t\\tCheckDependencies(Fields)\\n\\t\\t' Now we have the correct Fields list, so we can proceed:\\n\\t\\tDim g As New TopologicalSorter(fields.Count)\\n\\t\\tDim _indexes As New Dictionary(Of String, Integer)(fields.count)\\n\\n\\t\\t'add vertex names to our lookup dictionaey\\n\\t\\tFor i As Integer = 0 To fields.Count - 1\\n\\t\\t\\t_indexes(fields(i).Name.ToLower()) = g.AddVertex(i)\\n\\t\\tNext\\n\\n\\t\\t'add edges\\n\\t\\tFor i As Integer = 0 To fields.Count - 1\\n\\t\\t\\tIf fields(i).DependsOn IsNot Nothing Then\\n\\t\\t\\t\\tFor j As Integer = 0 To fields(i).DependsOn.Length - 1\\n\\t\\t\\t\\t\\tg.AddEdge(i, _indexes(fields(i).DependsOn(j).ToLower()))\\n\\t\\t\\t\\tNext\\n\\t\\t\\tEnd If\\n\\t\\tNext\\n\\n\\t\\tDim result As Integer() = g.Sort()\\n\\t\\tReturn result\\n\\tEnd Function\\n\\n\\tPrivate Class Field\\n\\t\\tPublic Property Name() As String\\n\\t\\t\\tGet\\n\\t\\t\\t\\tReturn m_Name\\n\\t\\t\\tEnd Get\\n\\t\\t\\tSet\\n\\t\\t\\t\\tm_Name = Value\\n\\t\\t\\tEnd Set\\n\\t\\tEnd Property\\n\\t\\tPrivate m_Name As String\\n\\t\\tPublic Property DependsOn() As String()\\n\\t\\t\\tGet\\n\\t\\t\\t\\tReturn m_DependsOn\\n\\t\\t\\tEnd Get\\n\\t\\t\\tSet\\n\\t\\t\\t\\tm_DependsOn = Value\\n\\t\\t\\tEnd Set\\n\\t\\tEnd Property\\n\\t\\tPrivate m_DependsOn As String()\\n\\tEnd Class\\nEnd Module\\nClass TopologicalSorter\\n\\t''source adapted from:\\n\\t''http://tawani.blogspot.com/2009/02/topological-sorting-and-cyclic.html\\n\\t''which was adapted from:\\n\\t''http://www.java2s.com/Code/Java/Collections-Data-Structure/Topologicalsorting.htm\\n\\t#Region \\\"- Private Members -\\\"\\n\\n\\tPrivate ReadOnly _vertices As Integer()\\n\\t' list of vertices\\n\\tPrivate ReadOnly _matrix As Integer(,)\\n\\t' adjacency matrix\\n\\tPrivate _numVerts As Integer\\n\\t' current number of vertices\\n\\tPrivate ReadOnly _sortedArray As Integer()\\n\\t' Sorted vertex labels\\n\\n\\t#End Region\\n\\n\\t#Region \\\"- CTors -\\\"\\n\\n\\tPublic Sub New(size As Integer)\\n\\t\\t_vertices = New Integer(size - 1) {}\\n\\t\\t_matrix = New Integer(size - 1, size - 1) {}\\n\\t\\t_numVerts = 0\\n\\t\\tFor i As Integer = 0 To size - 1\\n\\t\\t\\tFor j As Integer = 0 To size - 1\\n\\t\\t\\t\\t_matrix(i, j) = 0\\n\\t\\t\\tNext\\n\\t\\tNext\\n\\t\\t\\t' sorted vert labels\\n\\t\\t_sortedArray = New Integer(size - 1) {}\\n\\tEnd Sub\\n\\n\\t#End Region\\n\\n\\t#Region \\\"- Public Methods -\\\"\\n\\n\\tPublic Function AddVertex(vertex As Integer) As Integer\\n\\t\\t_vertices(System.Threading.Interlocked.Increment(_numVerts)-1) = vertex\\n\\t\\tReturn _numVerts - 1\\n\\tEnd Function\\n\\n\\tPublic Sub AddEdge(start As Integer, [end] As Integer)\\n\\t\\t_matrix(start, [end]) = 1\\n\\tEnd Sub\\n\\n\\tPublic Function Sort() As Integer()\\n\\t' Topological sort\\n\\t\\tWhile _numVerts > 0\\n\\t\\t\\t' while vertices remain,\\n\\t\\t\\t' get a vertex with no successors, or -1\\n\\t\\t\\tDim currentVertex As Integer = noSuccessors()\\n\\t\\t\\tIf currentVertex = -1 Then\\n\\t\\t\\t\\t' must be a cycle\\n\\t\\t\\t\\tThrow New Exception(\\\"Graph has cycles\\\")\\n\\t\\t\\tEnd If\\n\\n\\t\\t\\t' insert vertex label in sorted array (start at end)\\n\\t\\t\\t_sortedArray(_numVerts - 1) = _vertices(currentVertex)\\n\\n\\t\\t\\t\\t' delete vertex\\n\\t\\t\\tdeleteVertex(currentVertex)\\n\\t\\tEnd While\\n\\n\\t\\t' vertices all gone; return sortedArray\\n\\t\\tReturn _sortedArray\\n\\tEnd Function\\n\\n\\t#End Region\\n\\n\\t#Region \\\"- Private Helper Methods -\\\"\\n\\n\\t' returns vert with no successors (or -1 if no such verts)\\n\\tPrivate Function noSuccessors() As Integer\\n\\t\\tFor row As Integer = 0 To _numVerts - 1\\n\\t\\t\\tDim isEdge As Boolean = False\\n\\t\\t\\t' edge from row to column in adjMat\\n\\t\\t\\tFor col As Integer = 0 To _numVerts - 1\\n\\t\\t\\t\\tIf _matrix(row, col) > 0 Then\\n\\t\\t\\t\\t\\t' if edge to another,\\n\\t\\t\\t\\t\\tisEdge = True\\n\\t\\t\\t\\t\\t\\t' this vertex has a successor try another\\n\\t\\t\\t\\t\\tExit For\\n\\t\\t\\t\\tEnd If\\n\\t\\t\\tNext\\n\\t\\t\\tIf Not isEdge Then\\n\\t\\t\\t\\t' if no edges, has no successors\\n\\t\\t\\t\\tReturn row\\n\\t\\t\\tEnd If\\n\\t\\tNext\\n\\t\\tReturn -1\\n\\t\\t' no\\n\\tEnd Function\\n\\n\\tPrivate Sub deleteVertex(delVert As Integer)\\n\\t\\t' if not last vertex, delete from vertexList\\n\\t\\tIf delVert <> _numVerts - 1 Then\\n\\t\\t\\tFor j As Integer = delVert To _numVerts - 2\\n\\t\\t\\t\\t_vertices(j) = _vertices(j + 1)\\n\\t\\t\\tNext\\n\\n\\t\\t\\tFor row As Integer = delVert To _numVerts - 2\\n\\t\\t\\t\\tmoveRowUp(row, _numVerts)\\n\\t\\t\\tNext\\n\\n\\t\\t\\tFor col As Integer = delVert To _numVerts - 2\\n\\t\\t\\t\\tmoveColLeft(col, _numVerts - 1)\\n\\t\\t\\tNext\\n\\t\\tEnd If\\n\\t\\t_numVerts -= 1\\n\\t\\t' one less vertex\\n\\tEnd Sub\\n\\n\\tPrivate Sub moveRowUp(row As Integer, length As Integer)\\n\\t\\tFor col As Integer = 0 To length - 1\\n\\t\\t\\t_matrix(row, col) = _matrix(row + 1, col)\\n\\t\\tNext\\n\\tEnd Sub\\n\\n\\tPrivate Sub moveColLeft(col As Integer, length As Integer)\\n\\t\\tFor row As Integer = 0 To length - 1\\n\\t\\t\\t_matrix(row, col) = _matrix(row, col + 1)\\n\\t\\tNext\\n\\tEnd Sub\\n\\n\\t#End Region\\nEnd Class\\n\",\n \"language\": \"Visual-Basic-.NET\"\n },\n {\n \"code\": \"class Graph {\\n construct new(s, edges) {\\n _vertices = s.split(\\\", \\\")\\n var n = _vertices.count\\n _adjacency = List.filled(n, null)\\n for (i in 0...n) _adjacency[i] = List.filled(n, false)\\n for (edge in edges) _adjacency[edge[0]][edge[1]] = true\\n }\\n\\n hasDependency(r, todo) {\\n for (c in todo) if (_adjacency[r][c]) return true\\n return false\\n }\\n\\n topoSort() {\\n var res = []\\n var todo = List.filled(_vertices.count, 0)\\n for (i in 0...todo.count) todo[i] = i\\n while (!todo.isEmpty) {\\n var outer = false\\n var i = 0\\n for (r in todo) {\\n if (!hasDependency(r, todo)) {\\n todo.removeAt(i)\\n res.add(_vertices[r])\\n outer = true\\n break\\n }\\n i = i + 1\\n }\\n if (!outer) {\\n System.print(\\\"Graph has cycles\\\")\\n return \\\"\\\"\\n }\\n }\\n return res\\n }\\n}\\n\\nvar s = \\\"std, ieee, des_system_lib, dw01, dw02, dw03, dw04, dw05, \\\" +\\n \\\"dw06, dw07, dware, gtech, ramlib, std_cell_lib, synopsys\\\"\\n\\nvar deps = [\\n [2, 0], [2, 14], [2, 13], [2, 4], [2, 3], [2, 12], [2, 1],\\n [3, 1], [3, 10], [3, 11],\\n [4, 1], [4, 10],\\n [5, 0], [5, 14], [5, 10], [5, 4], [5, 3], [5, 1], [5, 11],\\n [6, 1], [6, 3], [6, 10], [6, 11],\\n [7, 1], [7, 10],\\n [8, 1], [8, 10],\\n [9, 1], [9, 10],\\n [10, 1],\\n [11, 1],\\n [12, 0], [12, 1],\\n [13, 1]\\n]\\n\\nvar g = Graph.new(s, deps)\\nSystem.print(\\\"Topologically sorted order:\\\")\\nSystem.print(g.topoSort())\\nSystem.print()\\n// now insert [3, 6] at index 10 of deps\\ndeps.insert(10, [3, 6])\\nvar g2 = Graph.new(s, deps)\\nSystem.print(\\\"Following the addition of dw04 to the dependencies of dw01:\\\")\\nSystem.print(g2.topoSort())\\n\",\n \"language\": \"Wren\"\n },\n {\n \"code\": \"fcn topoSort(data){ // data is L( L(root,L(leaves)),...)\\n allDs:=data.pump(List,fcn(rds){ T(Void.Write,Void.Write,rds[1]) }).copy();\\n roots:=Dictionary(data); // dictionary of root:leaves\\n L:=List();\\n S:=data.pump(List,'wrap([(r,_)]){ if(allDs.holds(r)) Void.Skip else r }).copy();\\n while(S){ //while S is non-empty do\\n (n:=S.pop()) : L.append(_); //remove a node n from S, add n to tail of L\\n foreach m in (ds:=roots.find(n,List)){ //node m with an edge e from n to m\\n\\t allDs.del(allDs.index(m));\\n\\t if (Void==allDs.find(m)) S.append(m); //m has no other incoming edges\\n } roots.del(n); // remove edge e from the graph\\n }\\n if(roots) throw(Exception.ValueError(\\\"Cycle: \\\"+roots.keys));\\n L\\n}\\n\",\n \"language\": \"Zkl\"\n },\n {\n \"code\": \"data:=T(\\n \\\"des_system_lib\\\", \\\"std synopsys std_cell_lib des_system_lib dw02 dw01 ramlib ieee\\\",\\n \\\"dw01\\\", \\\"ieee dw01 dware gtech\\\",\\n \\\"dw02\\\", \\\"ieee dw02 dware\\\",\\n \\\"dw03\\\", \\\"std synopsys dware dw03 dw02 dw01 ieee gtech\\\",\\n \\\"dw04\\\", \\\"dw04 ieee dw01 dware gtech\\\",\\n \\\"dw05\\\", \\\"dw05 ieee dware\\\",\\n \\\"dw06\\\", \\\"dw06 ieee dware\\\",\\n \\\"dw07\\\", \\\"ieee dware\\\",\\n \\\"dware\\\", \\\"ieee dware\\\",\\n \\\"gtech\\\", \\\"ieee gtech\\\",\\n \\\"ramlib\\\", \\\"std ieee\\\",\\n \\\"std_cell_lib\\\", \\\"ieee std_cell_lib\\\",\\n \\\"synopsys\\\", \\\"\\\",\\n);\\ndata=data.pump(List,Void.Read,fcn(r,ds){\\n T( r, ds.replace(r,\\\"\\\").strip().split().copy() ) // leaves writable 'cause they will be\\n});\\ntopoSort(data).println();\\n\",\n \"language\": \"Zkl\"\n }\n]","isConversational":false},"task_name":{"kind":"string","value":"Topological-sort"}}},{"rowIdx":1765,"cells":{"solutions":{"kind":"list like","value":[{"code":"---\nfrom: http://rosettacode.org/wiki/Topswops\n","language":"00-META"},{"code":"Topswops is a card game created by John Conway in the 1970's.\n\n\nAssume you have a particular permutation of a set of n cards numbered 1..n on both of their faces, for example the arrangement of four cards given by [2, 4, 1, 3] where the leftmost card is on top. \n\nA round is composed of reversing the first m cards where m is the value of the topmost card. \n\nRounds are repeated until the topmost card is the number 1 and the number of swaps is recorded. \n\n\nFor our example the swaps produce:\n<pre> \n [2, 4, 1, 3] # Initial shuffle\n [4, 2, 1, 3]\n [3, 1, 2, 4]\n [2, 1, 3, 4]\n [1, 2, 3, 4]\n</pre>\n\nFor a total of four swaps from the initial ordering to produce the terminating case where 1 is on top.\n\n\nFor a particular number <code> n </code> of cards, <code> topswops(n) </code> is the maximum swaps needed for any starting permutation of the <code>n</code> cards.\n\n\n;Task:\nThe task is to generate and show here a table of <code> n </code> vs <code> topswops(n) </code> for <code> n </code> in the range 1..10 inclusive.\n\n\n;Note:\n[[oeis:A000375|Topswops]] is also known as [http://www.haskell.org/haskellwiki/Shootout/Fannkuch Fannkuch] from the German word ''Pfannkuchen'' meaning [http://youtu.be/3biN6nQYqZY pancake].\n\n\n;Related tasks:\n* [[Number reversal game]]\n* [[Sorting algorithms/Pancake sort]]\n<br><br>\n\n","language":"00-TASK"},{"code":"V best = [0] * 16\n\nF try_swaps(&deck, f, =s, d, n)\n I d > :best[n]\n :best[n] = d\n\n V i = 0\n V k = 1 << s\n L s != 0\n k >>= 1\n s--\n I deck[s] == -1 | deck[s] == s\n L.break\n i [|]= k\n I (i [&] f) == i & d + :best[s] <= :best[n]\n R d\n s++\n\n V deck2 = copy(deck)\n k = 1\n L(i2) 1 .< s\n k <<= 1\n I deck2[i2] == -1\n I (f [&] k) != 0\n L.continue\n E I deck2[i2] != i2\n L.continue\n\n deck[i2] = i2\n L(j) 0 .. i2\n deck2[j] = deck[i2 - j]\n try_swaps(&deck2, f [|] k, s, 1 + d, n)\n\nF topswops(n)\n :best[n] = 0\n V deck0 = [-1] * 16\n deck0[0] = 0\n try_swaps(&deck0, 1, n, 0, n)\n R :best[n]\n\nL(i) 1..12\n print(‘#2: #.’.format(i, topswops(i)))\n","language":"11l"},{"code":"* Topswops optimized 12/07/2016\nTOPSWOPS CSECT\n USING TOPSWOPS,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 \" addressability\n MVC N,=F'1' n=1\nLOOPN L R4,N n; do n=1 to 10 ===-------------==*\n C R4,=F'10' \" *\n BH ELOOPN . *\n MVC P(40),PINIT p=pinit\n MVC COUNTM,=F'0' countm=0\nREPEAT MVC CARDS(40),P cards=p -------------------------+\n SR R11,R11 count=0 |\nWHILE CLC CARDS,=F'1' do while cards(1)^=1 ---------+\n BE EWHILE . |\n MVC M,CARDS m=cards(1)\n L R2,M m\n SRA R2,1 m/2\n ST R2,MD2 md2=m/2\n L R3,M @card(mm)=m\n SLA R3,2 *4\n LA R3,CARDS-4(R3) @card(mm)\n LA R2,CARDS @card(i)=0\n LA R6,1 i=1\nLOOPI C R6,MD2 do i=1 to m/2 -------------+\n BH ELOOPI . |\n L R0,0(R2) swap r0=cards(i)\n MVC 0(4,R2),0(R3) swap cards(i)=cards(mm)\n ST R0,0(R3) swap cards(mm)=r0\n AH R2,=H'4' @card(i)=@card(i)+4\n SH R3,=H'4' @card(mm)=@card(mm)-4\n LA R6,1(R6) i=i+1 |\n B LOOPI ----------------------------+\nELOOPI LA R11,1(R11) count=count+1 |\n B WHILE -------------------------------+\nEWHILE C R11,COUNTM if count>countm\n BNH NOTGT then\n ST R11,COUNTM countm=count\nNOTGT BAL R14,NEXTPERM call nextperm\n LTR R0,R0 until nextperm=0 |\n BNZ REPEAT ---------------------------------+\n L R1,N n\n XDECO R1,XDEC edit n\n MVC PG(2),XDEC+10 output n\n MVI PG+2,C':' output ':'\n L R1,COUNTM countm\n XDECO R1,XDEC edit countm\n MVC PG+3(4),XDEC+8 output countm\n XPRNT PG,L'PG print buffer\n L R1,N n *\n LA R1,1(R1) +1 *\n ST R1,N n=n+1 *\n B LOOPN ===------------------------------==*\nELOOPN L R13,4(0,R13) epilog\n LM R14,R12,12(R13) \" restore\n XR R15,R15 \" rc=0\n BR R14 exit\nPINIT DC F'1',F'2',F'3',F'4',F'5',F'6',F'7',F'8',F'9',F'10'\nCARDS DS 10F cards\nP DS 10F p\nCOUNTM DS F countm\nM DS F m\nN DS F n\nMD2 DS F m/2\nPG DC CL20' ' buffer\nXDEC DS CL12 temp\n*------- ---- nextperm ----------{-----------------------------------\nNEXTPERM L R9,N nn=n\n SR R8,R8 jj=0\n LR R7,R9 nn\n BCTR R7,0 j=nn-1\n LTR R7,R7 if j=0\n BZ ELOOPJ1 then skip do loop\nLOOPJ1 LR R1,R7 do j=nn-1 to 1 by -1; j ----+\n SLA R1,2 . |\n L R2,P-4(R1) p(j)\n C R2,P(R1) if p(j)<p(j+1)\n BNL PJGEPJP then\n LR R8,R7 jj=j\n B ELOOPJ1 leave j |\nPJGEPJP BCT R7,LOOPJ1 j=j-1 ---------------------+\nELOOPJ1 LA R7,1(R8) j=jj+1\nLOOPJ2 CR R7,R9 do j=jj+1 while j<nn ------+\n BNL ELOOPJ2 . |\n LR R2,R7 j\n SLA R2,2 .\n LR R3,R9 nn\n SLA R3,2 .\n L R0,P-4(R2) swap p(j),p(nn)\n L R1,P-4(R3) \"\n ST R0,P-4(R3) \"\n ST R1,P-4(R2) \"\n BCTR R9,0 nn=nn-1\n LA R7,1(R7) j=j+1 |\n B LOOPJ2 ----------------------------+\nELOOPJ2 LTR R8,R8 if jj=0\n BNZ JJNE0 then\n LA R0,0 return(0)\n BR R14 \"\nJJNE0 LA R7,1(R8) j=jj+1\n LR R2,R7 j\n SLA R2,2 r@p(j)\n LR R3,R8 jj\n SLA R3,2 r@p(jj)\nLOOPJ3 L R0,P-4(R2) p(j) ----------------------+\n C R0,P-4(R3) do j=jj+1 while p(j)<p(jj) |\n BNL ELOOPJ3\n LA R2,4(R2) r@p(j)=r@p(j)+4\n LA R7,1(R7) j=j+1 |\n B LOOPJ3 ----------------------------+\nELOOPJ3 L R1,P-4(R3) swap p(j),p(jj)\n ST R0,P-4(R3) \"\n ST R1,P-4(R2) \"\n LA R0,1 return(1)\n BR R14 ---------------}-----------------------------------\n YREGS\n END TOPSWOPS\n","language":"360-Assembly"},{"code":"with Ada.Integer_Text_IO, Generic_Perm;\n\nprocedure Topswaps is\n\n function Topswaps(Size: Positive) return Natural is\n package Perms is new Generic_Perm(Size);\n P: Perms.Permutation;\n Done: Boolean;\n Max: Natural;\n\n function Swapper_Calls(P: Perms.Permutation) return Natural is\n\t Q: Perms.Permutation := P;\n\t I: Perms.Element := P(1);\n begin\n\t if I = 1 then\n\t return 0;\n\t else\n\t for Idx in 1 .. I loop\n\t Q(Idx) := P(I-Idx+1);\n\t end loop;\n\t return 1 + Swapper_Calls(Q);\n\t end if;\n end Swapper_Calls;\n\n begin\n Perms.Set_To_First(P, Done);\n Max:= Swapper_Calls(P);\n while not Done loop\n\t Perms.Go_To_Next(P, Done);\n\t Max := natural'Max(Max, Swapper_Calls(P));\n end loop;\n return Max;\n end Topswaps;\n\nbegin\n for I in 1 .. 10 loop\n Ada.Integer_Text_IO.Put(Item => Topswaps(I), Width => 3);\n end loop;\nend Topswaps;\n","language":"Ada"},{"code":"Topswops(Obj, n){\n\tR := []\n\tfor i, val in obj{\n\t\tif (i <=n)\n\t\t\tres := val (A_Index=1?\"\":\",\") res\n\t\telse\n\t\t\tres .= \",\" val\n\t}\n\tLoop, Parse, res, `,\n\t\tR[A_Index]:= A_LoopField\n\treturn R\n}\n","language":"AutoHotkey"},{"code":"Cards := [2, 4, 1, 3]\nRes := Print(Cards)\nwhile (Cards[1]<>1)\n{\n\tCards := Topswops(Cards, Cards[1])\n\tRes .= \"`n\"Print(Cards)\n}\nMsgBox % Res\n\nPrint(M){\n\tfor i, val in M\n\t\t\tRes .= (A_Index=1?\"\":\"`t\") val\n\treturn Trim(Res,\"`n\")\n}\n","language":"AutoHotkey"},{"code":"#include <stdio.h>\n#include <string.h>\n\ntypedef struct { char v[16]; } deck;\ntypedef unsigned int uint;\n\nuint n, d, best[16];\n\nvoid tryswaps(deck *a, uint f, uint s) {\n#\tdefine A a->v\n#\tdefine B b.v\n\tif (d > best[n]) best[n] = d;\n\twhile (1) {\n\t\tif ((A[s] == s || (A[s] == -1 && !(f & 1U << s)))\n\t\t\t&& (d + best[s] >= best[n] || A[s] == -1))\n\t\t\tbreak;\n\n\t\tif (d + best[s] <= best[n]) return;\n\t\tif (!--s) return;\n\t}\n\n\td++;\n\tdeck b = *a;\n\tfor (uint i = 1, k = 2; i <= s; k <<= 1, i++) {\n\t\tif (A[i] != i && (A[i] != -1 || (f & k)))\n\t\t\tcontinue;\n\n\t\tfor (uint j = B[0] = i; j--;) B[i - j] = A[j];\n\t\ttryswaps(&b, f | k, s);\n\t}\n\td--;\n}\n\nint main(void) {\n\tdeck x;\n\tmemset(&x, -1, sizeof(x));\n\tx.v[0] = 0;\n\n\tfor (n = 1; n < 13; n++) {\n\t\ttryswaps(&x, 1, n - 1);\n\t\tprintf(\"%2d: %d\\n\", n, best[n]);\n\t}\n\n\treturn 0;\n}\n","language":"C"},{"code":"#define _GNU_SOURCE\n#include <stdio.h>\n#include <string.h>\n#include <pthread.h>\n#include <sched.h>\n\n#define MAX_CPUS 8 // increase this if you got more CPUs/cores\n\ntypedef struct { char v[16]; } deck;\n\nint n, best[16];\n\n// Update a shared variable by spinlock. Since this program really only\n// enters locks dozens of times, a pthread_mutex_lock() would work\n// equally fine, but RC already has plenty of examples for that.\n#define SWAP_OR_RETRY(var, old, new)\t\t\t\t\t\\\n\tif (!__sync_bool_compare_and_swap(&(var), old, new)) {\t\t\\\n\t\tvolatile int spin = 64;\t\t\t\t\t\\\n\t\twhile (spin--);\t\t\t\t\t\t\\\n\t\tcontinue; }\n\nvoid tryswaps(deck *a, int f, int s, int d) {\n#define A a->v\n#define B b->v\n\n\twhile (best[n] < d) {\n\t\tint t = best[n];\n\t\tSWAP_OR_RETRY(best[n], t, d);\n\t}\n\n#define TEST(x)\t\t\t\t\t\t\t\t\t\\\n\tcase x: if ((A[15-x] == 15-x || (A[15-x] == -1 && !(f & 1<<(15-x))))\t\\\n\t\t\t&& (A[15-x] == -1 || d + best[15-x] >= best[n]))\t\\\n\t\t\tbreak;\t\t\t\t\t\t\t\\\n\t\tif (d + best[15-x] <= best[n]) return;\t\t\t\t\\\n\t\ts = 14 - x\n\n\tswitch (15 - s) {\n\t\tTEST(0); TEST(1); TEST(2); TEST(3); TEST(4);\n\t\tTEST(5); TEST(6); TEST(7); TEST(8); TEST(9);\n\t\tTEST(10); TEST(11); TEST(12); TEST(13); TEST(14);\n\t\treturn;\n\t}\n#undef TEST\n\n\tdeck *b = a + 1;\n\t*b = *a;\n\td++;\n\n#define FLIP(x)\t\t\t\t\t\t\t\\\n\tif (A[x] == x || ((A[x] == -1) && !(f & (1<<x)))) {\t\\\n\t\tB[0] = x;\t\t\t\t\t\\\n\t\tfor (int j = x; j--; ) B[x-j] = A[j];\t\t\\\n\t\ttryswaps(b, f|(1<<x), s, d); }\t\t\t\\\n\tif (s == x) return;\n\n\tFLIP(1); FLIP(2); FLIP(3); FLIP(4); FLIP(5);\n\tFLIP(6); FLIP(7); FLIP(8); FLIP(9); FLIP(10);\n\tFLIP(11); FLIP(12); FLIP(13); FLIP(14); FLIP(15);\n#undef FLIP\n}\n\nint num_cpus(void) {\n\tcpu_set_t ct;\n\tsched_getaffinity(0, sizeof(ct), &ct);\n\n\tint cnt = 0;\n\tfor (int i = 0; i < MAX_CPUS; i++)\n\t\tif (CPU_ISSET(i, &ct))\n\t\t\tcnt++;\n\n\treturn cnt;\n}\n\nstruct work { int id; deck x[256]; } jobs[MAX_CPUS];\nint first_swap;\n\nvoid *thread_start(void *arg) {\n\tstruct work *job = arg;\n\twhile (1) {\n\t\tint at = first_swap;\n\t\tif (at >= n) return 0;\n\n\t\tSWAP_OR_RETRY(first_swap, at, at + 1);\n\n\t\tmemset(job->x, -1, sizeof(deck));\n\t\tjob->x[0].v[at] = 0;\n\t\tjob->x[0].v[0] = at;\n\t\ttryswaps(job->x, 1 | (1 << at), n - 1, 1);\n\t}\n}\n\nint main(void) {\n\tint n_cpus = num_cpus();\n\n\tfor (int i = 0; i < MAX_CPUS; i++)\n\t\tjobs[i].id = i;\n\n\tpthread_t tid[MAX_CPUS];\n\n\tfor (n = 2; n <= 14; n++) {\n\t\tint top = n_cpus;\n\t\tif (top > n) top = n;\n\n\t\tfirst_swap = 1;\n\t\tfor (int i = 0; i < top; i++)\n\t\t\tpthread_create(tid + i, 0, thread_start, jobs + i);\n\n\t\tfor (int i = 0; i < top; i++)\n\t\t\tpthread_join(tid[i], 0);\n\n\t\tprintf(\"%2d: %2d\\n\", n, best[n]);\n\t}\n\n\treturn 0;\n}\n","language":"C"},{"code":"#include <iostream>\n#include <vector>\n#include <numeric>\n#include <algorithm>\n\nint topswops(int n) {\n std::vector<int> list(n);\n std::iota(std::begin(list), std::end(list), 1);\n int max_steps = 0;\n do {\n auto temp_list = list;\n for (int steps = 1; temp_list[0] != 1; ++steps) {\n std::reverse(std::begin(temp_list), std::begin(temp_list) + temp_list[0]);\n if (steps > max_steps) max_steps = steps;\n }\n } while (std::next_permutation(std::begin(list), std::end(list)));\n return max_steps;\n}\n\nint main() {\n for (int i = 1; i <= 10; ++i) {\n std::cout << i << \": \" << topswops(i) << std::endl;\n }\n return 0;\n}\n","language":"C++"},{"code":"using System;\n\npublic class Topswops {\n static readonly int maxBest = 32;\n static int[] best;\n\n private static void TrySwaps(int[] deck, int f, int d, int n) {\n if (d > best[n])\n best[n] = d;\n\n for (int i = n - 1; i >= 0; i--) {\n if (deck[i] == -1 || deck[i] == i)\n break;\n if (d + best[i] <= best[n])\n return;\n }\n\n int[] deck2 = (int[])deck.Clone();\n for (int i = 1; i < n; i++) {\n int k = 1 << i;\n if (deck2[i] == -1) {\n if ((f & k) != 0)\n continue;\n } else if (deck2[i] != i)\n continue;\n\n deck2[0] = i;\n for (int j = i - 1; j >= 0; j--)\n deck2[i - j] = deck[j]; // Reverse copy.\n TrySwaps(deck2, f | k, d + 1, n);\n }\n }\n\n static int topswops(int n) {\n if(n <= 0 || n >= maxBest) throw new ArgumentOutOfRangeException(nameof(n), \"n must be greater than 0 and less than maxBest.\");\n best[n] = 0;\n int[] deck0 = new int[n + 1];\n for (int i = 1; i < n; i++)\n deck0[i] = -1;\n TrySwaps(deck0, 1, 0, n);\n return best[n];\n }\n\n public static void Main(string[] args) {\n best = new int[maxBest];\n for (int i = 1; i < 11; i++)\n Console.WriteLine(i + \": \" + topswops(i));\n }\n}\n","language":"C-sharp"},{"code":"import std.stdio, std.algorithm, std.range, permutations2;\n\nint topswops(in int n) pure @safe {\n static int flip(int[] xa) pure nothrow @safe @nogc {\n if (!xa[0]) return 0;\n xa[0 .. xa[0] + 1].reverse();\n return 1 + flip(xa);\n }\n return n.iota.array.permutations.map!flip.reduce!max;\n}\n\nvoid main() {\n foreach (immutable i; 1 .. 11)\n writeln(i, \": \", i.topswops);\n}\n","language":"D"},{"code":"import std.stdio, std.typecons;\n\n__gshared uint[32] best;\n\nuint topswops(size_t n)() nothrow @nogc {\n static assert(n > 0 && n < best.length);\n size_t d = 0;\n\n alias T = byte;\n alias Deck = T[n];\n\n void trySwaps(in ref Deck deck, in uint f) nothrow @nogc {\n if (d > best[n])\n best[n] = d;\n\n foreach_reverse (immutable i; staticIota!(0, n)) {\n if ((deck[i] == i || (deck[i] == -1 && !(f & (1U << i))))\n && (d + best[i] >= best[n] || deck[i] == -1))\n break;\n if (d + best[i] <= best[n])\n return;\n }\n\n Deck deck2 = void;\n foreach (immutable i; staticIota!(0, n)) // Copy.\n deck2[i] = deck[i];\n\n d++;\n foreach (immutable i; staticIota!(1, n)) {\n enum uint k = 1U << i;\n if (deck[i] != i && (deck[i] != -1 || (f & k)))\n continue;\n\n deck2[0] = T(i);\n foreach_reverse (immutable j; staticIota!(0, i))\n deck2[i - j] = deck[j]; // Reverse copy.\n trySwaps(deck2, f | k);\n }\n d--;\n }\n\n best[n] = 0;\n Deck deck0 = -1;\n deck0[0] = 0;\n trySwaps(deck0, 1);\n return best[n];\n}\n\nvoid main() {\n foreach (immutable i; staticIota!(1, 14))\n writefln(\"%2d: %d\", i, topswops!i());\n}\n","language":"D"},{"code":"class\n\tTOPSWOPS\n\ncreate\n\tmake\n\nfeature\n\n\tmake (n: INTEGER)\n\t\t\t-- Topswop game.\n\t\tlocal\n\t\t\tperm, ar: ARRAY [INTEGER]\n\t\t\ttcount, count: INTEGER\n\t\tdo\n\t\t\tcreate perm_sol.make_empty\n\t\t\tcreate solution.make_empty\n\t\t\tacross\n\t\t\t\t1 |..| n as c\n\t\t\tloop\n\t\t\t\tcreate ar.make_filled (0, 1, c.item)\n\t\t\t\tacross\n\t\t\t\t\t1 |..| c.item as d\n\t\t\t\tloop\n\t\t\t\t\tar [d.item] := d.item\n\t\t\t\tend\n\t\t\t\tpermute (ar, 1)\n\t\t\t\tacross\n\t\t\t\t\t1 |..| perm_sol.count as e\n\t\t\t\tloop\n\t\t\t\t\ttcount := 0\n\t\t\t\t\tfrom\n\t\t\t\t\tuntil\n\t\t\t\t\t\tperm_sol.at (e.item).at (1) = 1\n\t\t\t\t\tloop\n\t\t\t\t\t\tperm_sol.at (e.item) := reverse_array (perm_sol.at (e.item))\n\t\t\t\t\t\ttcount := tcount + 1\n\t\t\t\t\tend\n\t\t\t\t\tif tcount > count then\n\t\t\t\t\t\tcount := tcount\n\t\t\t\t\tend\n\t\t\t\tend\n\t\t\t\tsolution.force (count, c.item)\n\t\t\tend\n\t\tend\n\n\tsolution: ARRAY [INTEGER]\n\nfeature {NONE}\n\n\tperm_sol: ARRAY [ARRAY [INTEGER]]\n\n\treverse_array (ar: ARRAY [INTEGER]): ARRAY [INTEGER]\n\t\t\t-- Array with 'ar[1]' elements reversed.\n\t\trequire\n\t\t\tar_not_void: ar /= Void\n\t\tlocal\n\t\t\ti, j: INTEGER\n\t\tdo\n\t\t\tcreate Result.make_empty\n\t\t\tResult.deep_copy (ar)\n\t\t\tfrom\n\t\t\t\ti := 1\n\t\t\t\tj := ar [1]\n\t\t\tuntil\n\t\t\t\ti > j\n\t\t\tloop\n\t\t\t\tResult [i] := ar [j]\n\t\t\t\tResult [j] := ar [i]\n\t\t\t\ti := i + 1\n\t\t\t\tj := j - 1\n\t\t\tend\n\t\tensure\n\t\t\tsame_elements: across ar as a all Result.has (a.item) end\n\t\tend\n\n\tpermute (a: ARRAY [INTEGER]; k: INTEGER)\n\t\t\t-- All permutations of array 'a' stored in perm_sol.\n\t\trequire\n\t\t\tar_not_void: a.count >= 1\n\t\t\tk_valid_index: k > 0\n\t\tlocal\n\t\t\ti, t: INTEGER\n\t\t\ttemp: ARRAY [INTEGER]\n\t\tdo\n\t\t\tcreate temp.make_empty\n\t\t\tif k = a.count then\n\t\t\t\tacross\n\t\t\t\t\ta as ar\n\t\t\t\tloop\n\t\t\t\t\ttemp.force (ar.item, temp.count + 1)\n\t\t\t\tend\n\t\t\t\tperm_sol.force (temp, perm_sol.count + 1)\n\t\t\telse\n\t\t\t\tfrom\n\t\t\t\t\ti := k\n\t\t\t\tuntil\n\t\t\t\t\ti > a.count\n\t\t\t\tloop\n\t\t\t\t\tt := a [k]\n\t\t\t\t\ta [k] := a [i]\n\t\t\t\t\ta [i] := t\n\t\t\t\t\tpermute (a, k + 1)\n\t\t\t\t\tt := a [k]\n\t\t\t\t\ta [k] := a [i]\n\t\t\t\t\ta [i] := t\n\t\t\t\t\ti := i + 1\n\t\t\t\tend\n\t\t\tend\n\t\tend\n\nend\n","language":"Eiffel"},{"code":"class\n\tAPPLICATION\n\ncreate\n\tmake\n\nfeature\n\n\tmake\n\t\tdo\n\t\t\tcreate topswop.make (10)\n\t\t\tacross\n\t\t\t\ttopswop.solution as t\n\t\t\tloop\n\t\t\t\tio.put_string (t.item.out + \"%N\")\n\t\t\tend\n\t\tend\n\n\ttopswop: TOPSWOPS\n\nend\n","language":"Eiffel"},{"code":"defmodule Topswops do\n def get_1_first( [1 | _t] ), do: 0\n def get_1_first( list ), do: 1 + get_1_first( swap(list) )\n\n defp swap( [n | _t]=list ) do\n {swaps, remains} = Enum.split( list, n )\n Enum.reverse( swaps, remains )\n end\n\n def task do\n IO.puts \"N\\ttopswaps\"\n Enum.map(1..10, fn n -> {n, permute(Enum.to_list(1..n))} end)\n |> Enum.map(fn {n, n_permutations} -> {n, get_1_first_many(n_permutations)} end)\n |> Enum.map(fn {n, n_swops} -> {n, Enum.max(n_swops)} end)\n |> Enum.each(fn {n, max} -> IO.puts \"#{n}\\t#{max}\" end)\n end\n\n def get_1_first_many( n_permutations ), do: (for x <- n_permutations, do: get_1_first(x))\n\n defp permute([]), do: [[]]\n defp permute(list), do: for x <- list, y <- permute(list -- [x]), do: [x|y]\nend\n\nTopswops.task\n","language":"Elixir"},{"code":"-module( topswops ).\n\n-export( [get_1_first/1, swap/1, task/0] ).\n\nget_1_first( [1 | _T] ) -> 0;\nget_1_first( List ) -> 1 + get_1_first( swap(List) ).\n\nswap( [N | _T]=List ) ->\n\t{Swaps, Remains} = lists:split( N, List ),\n\tlists:reverse( Swaps ) ++ Remains.\n\t\ntask() ->\n\tPermutations = [{X, permute:permute(lists:seq(1, X))} || X <- lists:seq(1, 10)],\n\tSwops = [{N, get_1_first_many(N_permutations)} || {N, N_permutations} <- Permutations],\n\tTopswops = [{N, lists:max(N_swops)} || {N, N_swops} <- Swops],\n\tio:fwrite( \"N\ttopswaps~n\" ),\n\t[io:fwrite(\"~p\t~p~n\", [N, Max]) || {N, Max} <- Topswops].\n\n\n\nget_1_first_many( N_permutations ) -> [get_1_first(X) || X <- N_permutations].\n","language":"Erlang"},{"code":"USING: formatting kernel math math.combinatorics math.order\nmath.ranges sequences ;\nFROM: sequences.private => exchange-unsafe ;\nIN: rosetta-code.topswops\n\n! Reverse a subsequence in-place from 0 to n.\n: head-reverse! ( seq n -- seq' )\n dupd [ 2/ ] [ ] bi rot\n [ [ over - 1 - ] dip exchange-unsafe ] 2curry each-integer ;\n\n! Reverse the elements in seq according to the first element.\n: swop ( seq -- seq' ) dup first head-reverse! ;\n\n! Determine the number of swops until 1 is the head.\n: #swops ( seq -- n )\n 0 swap [ dup first 1 = ] [ [ 1 + ] [ swop ] bi* ] until\n drop ;\n\n! Determine the maximum number of swops for a given length.\n: topswops ( n -- max )\n [1,b] <permutations> [ #swops ] [ max ] map-reduce ;\n\n: main ( -- )\n 10 [1,b] [ dup topswops \"%2d: %2d\\n\" printf ] each ;\n\nMAIN: main\n","language":"Factor"},{"code":"module top\nimplicit none\ncontains\nrecursive function f(x) result(m)\n integer :: n, m, x(:),y(size(x)), fst\n fst = x(1)\n if (fst == 1) then\n m = 0\n else\n y(1:fst) = x(fst:1:-1)\n y(fst+1:) = x(fst+1:)\n m = 1 + f(y)\n end if\nend function\n\nrecursive function perms(x) result(p)\ninteger, pointer :: p(:,:), q(:,:)\ninteger :: x(:), n, k, i\nn = size(x)\nif (n == 1) then\n allocate(p(1,1))\n p(1,:) = x\nelse\n q => perms(x(2:n))\n k = ubound(q,1)\n allocate(p(k*n,n))\n p = 0\n do i = 1,n\n p(1+k*(i-1):k*i,1:i-1) = q(:,1:i-1)\n p(1+k*(i-1):k*i,i) = x(1)\n p(1+k*(i-1):k*i,i+1:) = q(:,i:)\n end do\nend if\nend function\nend module\n\nprogram topswort\nuse top\nimplicit none\ninteger :: x(10)\ninteger, pointer :: p(:,:)\ninteger :: i, j, m\n\nforall(i=1:10)\n x(i) = i\nend forall\n\ndo i = 1,10\n p=>perms(x(1:i))\n m = 0\n do j = 1, ubound(p,1)\n m = max(m, f(p(j,:)))\n end do\n print \"(i3,a,i3)\", i,\": \",m\nend do\nend program\n","language":"Fortran"},{"code":"Dim Shared As Byte n, d, best(16)\n\nSub TrySwaps(A() As Byte, f As Byte, s As Byte)\n Dim As Byte B(16), i, j, k\n If d > best(n) Then best(n) = d\n Do\n If A(s) = -1 Or A(s) = s Then Exit Do\n If d+best(s) <= best(n) Then Exit Sub\n If s = 0 Then Exit Do\n s -= 1\n Loop\n\n d += 1\n For i = 0 To s\n B(i) = A(i)\n Next\n\n k = 1\n For i = 1 To s\n k Shl= 1\n If B(i) =- 1 AndAlso (f And k) = 0 Or B(i) = i Then\n j = i\n B(0) = j\n While j\n j -= 1\n B(i-j) = A(j)\n Wend\n TrySwaps(B(), f Or k, s)\n End If\n Next\n d -= 1\nEnd Sub\n\nDim As Byte i, X(16)\nFor i = 0 To 16-1\n X(i) = -1\n best(i) = 0\nNext i\nX(0) = 0\n\nFor n = 1 To 13\n d = 0\n TrySwaps(X(), 1, n-1)\n Print Using \"##: ##\"; n; best(n)\nNext n\n\nSleep\n","language":"FreeBASIC"},{"code":"// Adapted from http://www-cs-faculty.stanford.edu/~uno/programs/topswops.w\n// at Donald Knuth's web site. Algorithm credited there to Pepperdine\n// and referenced to Mathematical Gazette 73 (1989), 131-133.\npackage main\n\nimport \"fmt\"\n\nconst ( // array sizes\n maxn = 10 // max number of cards\n maxl = 50 // upper bound for number of steps\n)\n\nfunc main() {\n for i := 1; i <= maxn; i++ {\n fmt.Printf(\"%d: %d\\n\", i, steps(i))\n }\n}\n\nfunc steps(n int) int {\n var a, b [maxl][maxn + 1]int\n var x [maxl]int\n a[0][0] = 1\n var m int\n for l := 0; ; {\n x[l]++\n k := int(x[l])\n if k >= n {\n if l <= 0 {\n break\n }\n l--\n continue\n }\n if a[l][k] == 0 {\n if b[l][k+1] != 0 {\n continue\n }\n } else if a[l][k] != k+1 {\n continue\n }\n a[l+1] = a[l]\n for j := 1; j <= k; j++ {\n a[l+1][j] = a[l][k-j]\n }\n b[l+1] = b[l]\n a[l+1][0] = k + 1\n b[l+1][k+1] = 1\n if l > m-1 {\n m = l + 1\n }\n l++\n x[l] = 0\n }\n return m\n}\n","language":"Go"},{"code":"import Data.List (permutations)\n\ntopswops :: Int -> Int\ntopswops n = maximum $ map tops $ permutations [1 .. n]\n where\n tops (1:_) = 0\n tops xa@(x:_) = 1 + tops reordered\n where\n reordered = reverse (take x xa) ++ drop x xa\n\nmain =\n mapM_ (putStrLn . ((++) <$> show <*> (\":\\t\" ++) . show . topswops)) [1 .. 10]\n","language":"Haskell"},{"code":"import Data.List (permutations, inits)\nimport Control.Arrow (first)\n\nderangements :: [Int] -> [[Int]]\nderangements = (\\x -> filter (and . zipWith (/=) x)) <*> permutations\n\ntopswop :: Int -> [a] -> [a]\ntopswop x xs = uncurry (++) (first reverse (splitAt x xs))\n\ntopswopIter :: [Int] -> [[Int]]\ntopswopIter = takeWhile ((/= 1) . head) . iterate (topswop =<< head)\n\nswops :: [Int] -> [Int]\nswops = fmap (length . topswopIter) . derangements\n\ntopSwops :: [Int] -> [(Int, Int)]\ntopSwops = zip [1 ..] . fmap (maximum . (0 :) . swops) . tail . inits\n\nmain :: IO ()\nmain = mapM_ print $ take 10 $ topSwops [1 ..]\n","language":"Haskell"},{"code":"procedure main()\n every n := 1 to 10 do {\n ts := 0\n every (ts := 0) <:= swop(permute([: 1 to n :]))\n write(right(n, 3),\": \",right(ts,4))\n }\nend\n\nprocedure swop(A)\n count := 0\n while A[1] ~= 1 do {\n A := reverse(A[1+:A[1]]) ||| A[(A[1]+1):0]\n count +:= 1\n }\n return count\nend\n\nprocedure permute(A)\n if *A <= 1 then return A\n suspend [(A[1]<->A[i := 1 to *A])] ||| permute(A[2:0])\nend\n","language":"Haskell"},{"code":" swops =: ((|.@:{. , }.)~ {.)^:a:\n","language":"J"},{"code":" swops 2 4 1 3\n2 4 1 3\n4 2 1 3\n3 1 2 4\n2 1 3 4\n1 2 3 4\n","language":"J"},{"code":" (,. _1 + ! >./@:(#@swops@A. >:)&i. ])&> 1+i.10\n 1 0\n 2 1\n 3 2\n 4 4\n 5 7\n 6 10\n 7 16\n 8 22\n 9 30\n10 38\n","language":"J"},{"code":"public class Topswops {\n static final int maxBest = 32;\n static int[] best;\n\n static private void trySwaps(int[] deck, int f, int d, int n) {\n if (d > best[n])\n best[n] = d;\n\n for (int i = n - 1; i >= 0; i--) {\n if (deck[i] == -1 || deck[i] == i)\n break;\n if (d + best[i] <= best[n])\n return;\n }\n\n int[] deck2 = deck.clone();\n for (int i = 1; i < n; i++) {\n final int k = 1 << i;\n if (deck2[i] == -1) {\n if ((f & k) != 0)\n continue;\n } else if (deck2[i] != i)\n continue;\n\n deck2[0] = i;\n for (int j = i - 1; j >= 0; j--)\n deck2[i - j] = deck[j]; // Reverse copy.\n trySwaps(deck2, f | k, d + 1, n);\n }\n }\n\n static int topswops(int n) {\n assert(n > 0 && n < maxBest);\n best[n] = 0;\n int[] deck0 = new int[n + 1];\n for (int i = 1; i < n; i++)\n deck0[i] = -1;\n trySwaps(deck0, 1, 0, n);\n return best[n];\n }\n\n public static void main(String[] args) {\n best = new int[maxBest];\n for (int i = 1; i < 11; i++)\n System.out.println(i + \": \" + topswops(i));\n }\n}\n","language":"Java"},{"code":"# \"while\" as defined here is included in recent versions (>1.4) of jq:\ndef until(cond; next):\n def _until:\n if cond then . else (next|_until) end;\n _until;\n\n# Generate a stream of permutations of [1, ... n].\n# This implementation uses arity-0 filters for speed.\ndef permutations:\n # Given a single array, insert generates a stream by inserting (length+1) at different positions\n def insert: # state: [m, array]\n .[0] as $m | (1+(.[1]|length)) as $n\n | .[1]\n | if $m >= 0 then (.[0:$m] + [$n] + .[$m:]), ([$m-1, .] | insert) else empty end;\n\n if .==0 then []\n elif . == 1 then [1]\n else\n . as $n | ($n-1) | permutations | [$n-1, .] | insert\n end;\n","language":"Jq"},{"code":"# Input: a permutation; output: an integer\ndef flips:\n # state: [i, array]\n [0, .]\n | until( .[1][0] == 1;\n .[1] as $p | $p[0] as $p0\n\t | [.[0] + 1, ($p[:$p0] | reverse) + $p[$p0:] ] )\n | .[0];\n\n# input: n, the number of items\ndef fannkuch:\n reduce permutations as $p\n (0; [., ($p|flips) ] | max);\n","language":"Jq"},{"code":"range(1; 11) | [., fannkuch ]\n","language":"Jq"},{"code":"$ jq -n -c -f topswops.jq\n[1,0]\n[2,1]\n[3,2]\n[4,4]\n[5,7]\n[6,10]\n[7,16]\n[8,22]\n[9,30]\n[10,38]\n","language":"Jq"},{"code":"function fannkuch(n)\n\tn == 1 && return 0\n\tn == 2 && return 1\n\tp = [1:n]\n\tq = copy(p)\n\ts = copy(p)\n\tsign = 1; maxflips = sum = 0\n\twhile true\n\t\tq0 = p[1]\n\t\tif q0 != 1\n\t\t\tfor i = 2:n\n\t\t\t\tq[i] = p[i]\n\t\t\tend\n\t\t\tflips = 1\n\t\t\twhile true\n\t\t\t\tqq = q[q0] #??\n\t\t\t\tif qq == 1\n\t\t\t\t\tsum += sign*flips\n\t\t\t\t\tflips > maxflips && (maxflips = flips)\n\t\t\t\t\tbreak\n\t\t\t\tend\n\t\t\t\tq[q0] = q0\n\t\t\t\tif q0 >= 4\n\t\t\t\t\ti = 2; j = q0-1\n\t\t\t\t\twhile true\n\t\t\t\t\t\tt = q[i]\n\t\t\t\t\t\tq[i] = q[j]\n\t\t\t\t\t\tq[j] = t\n\t\t\t\t\t\ti += 1\n\t\t\t\t\t\tj -= 1\n\t\t\t\t\t\ti >= j && break\n\t\t\t\t\tend\n\t\t\t\tend\n\t\t\t\tq0 = qq\n\t\t\t\tflips += 1\n\t\t\tend\n\t\tend\n\t\t#permute\n\t\tif sign == 1\n\t\t\tt = p[2]\n\t\t\tp[2] = p[1]\n\t\t\tp[1] = t\n\t\t\tsign = -1\n\t\telse\n\t\t\tt = p[2]\n\t\t\tp[2] = p[3]\n\t\t\tp[3] = t\n\t\t\tsign = 1\n\t\t\tfor i = 3:n\n\t\t\t\tsx = s[i]\n\t\t\t\tif sx != 1\n\t\t\t\t\ts[i] = sx-1\n\t\t\t\t\tbreak\n\t\t\t\tend\n\t\t\t\ti == n && return maxflips\n\t\t\t\ts[i] = i\n\t\t\t\tt = p[1]\n\t\t\t\tfor j = 1:i\n\t\t\t\t\tp[j] = p[j+1]\n\t\t\t\tend\n\t\t\t\tp[i+1] = t\n\t\t\tend\n\t\tend\n\tend\nend\n","language":"Julia"},{"code":"// version 1.1.2\n\nval best = IntArray(32)\n\nfun trySwaps(deck: IntArray, f: Int, d: Int, n: Int) {\n if (d > best[n]) best[n] = d\n for (i in n - 1 downTo 0) {\n if (deck[i] == -1 || deck[i] == i) break\n if (d + best[i] <= best[n]) return\n }\n val deck2 = deck.copyOf()\n for (i in 1 until n) {\n val k = 1 shl i\n if (deck2[i] == -1) {\n if ((f and k) != 0) continue\n }\n else if (deck2[i] != i) continue\n deck2[0] = i\n for (j in i - 1 downTo 0) deck2[i - j] = deck[j]\n trySwaps(deck2, f or k, d + 1, n)\n }\n}\n\nfun topswops(n: Int): Int {\n require(n > 0 && n < best.size)\n best[n] = 0\n val deck0 = IntArray(n + 1)\n for (i in 1 until n) deck0[i] = -1\n trySwaps(deck0, 1, 0, n)\n return best[n]\n}\n\nfun main(args: Array<String>) {\n for (i in 1..10) println(\"${\"%2d\".format(i)} : ${topswops(i)}\")\n}\n","language":"Kotlin"},{"code":"-- Return an iterator to produce every permutation of list\nfunction permute (list)\n local function perm (list, n)\n if n == 0 then coroutine.yield(list) end\n for i = 1, n do\n list[i], list[n] = list[n], list[i]\n perm(list, n - 1)\n list[i], list[n] = list[n], list[i]\n end\n end\n return coroutine.wrap(function() perm(list, #list) end)\nend\n\n-- Perform one topswop round on table t\nfunction swap (t)\n local new, limit = {}, t[1]\n for i = 1, #t do\n if i <= limit then\n new[i] = t[limit - i + 1]\n else\n new[i] = t[i]\n end\n end\n return new\nend\n\n-- Find the most swaps needed for any starting permutation of n cards\nfunction topswops (n)\n local numTab, highest, count = {}, 0\n for i = 1, n do numTab[i] = i end\n for numList in permute(numTab) do\n count = 0\n while numList[1] ~= 1 do\n numList = swap(numList)\n count = count + 1\n end\n if count > highest then highest = count end\n end\n return highest\nend\n\n-- Main procedure\nfor i = 1, 10 do print(i, topswops(i)) end\n","language":"Lua"},{"code":"flip[a_] := Block[{a1 = First@a}, If[a1 == Length@a, Reverse[a], Join[Reverse[a[[;; a1]]], a[[a1 + 1 ;;]]]]]\nswaps[a_] := Length@FixedPointList[flip, a] - 2\nPrint[#, \": \", Max[swaps /@ Permutations[Range@#]]] & /@ Range[10];\n","language":"Mathematica"},{"code":"import strformat\n\nconst maxBest = 32\nvar best: array[maxBest, int]\n\nproc trySwaps(deck: seq[int], f, d, n: int) =\n if d > best[n]:\n best[n] = d\n\n for i in countdown(n - 1, 0):\n if deck[i] == -1 or deck[i] == i:\n break\n if d + best[i] <= best[n]:\n return\n\n var deck2 = deck\n for i in 1..<n:\n var k = 1 shl i\n if deck2[i] == -1:\n if (f and k) != 0:\n continue\n elif deck2[i] != i:\n continue\n\n deck2[0] = i\n for j in countdown(i - 1, 0):\n deck2[i - j] = deck[j]\n trySwaps(deck2, f or k, d + 1, n)\n\nproc topswops(n: int): int =\n assert(n > 0 and n < maxBest)\n best[n] = 0\n var deck0 = newSeq[int](n + 1)\n for i in 1..<n:\n deck0[i] = -1\n trySwaps(deck0, 1, 0, n)\n best[n]\n\nfor i in 1..10:\n echo &\"{i:2}: {topswops(i):2}\"\n","language":"Nim"},{"code":"flip(v:vec)={\n my(t=v[1]+1);\n if (t==2, return(0));\n for(i=1,t\\2, [v[t-i],v[i]]=[v[i],v[t-i]]);\n 1+flip(v)\n}\ntopswops(n)={\n my(mx);\n for(i=0,n!-1,\n mx=max(flip(Vecsmall(numtoperm(n,i))),mx)\n );\n mx;\n}\nvector(10,n,topswops(n))\n","language":"PARI-GP"},{"code":"sub next_swop {\n my( $max, $level, $p, $d ) = @_;\n my $swopped = 0;\n for( 2..@$p ){ # find possibilities\n my @now = @$p;\n if( $_ == $now[$_-1] ) {\n splice @now, 0, 0, reverse splice @now, 0, $_;\n $swopped = 1;\n next_swop( $max, $level+1, \\@now, [ @$d ] );\n }\n }\n for( 1..@$d ) { # create possibilities\n my @now = @$p;\n my $next = shift @$d;\n if( not $now[$next-1] ) {\n $now[$next-1] = $next;\n splice @now, 0, 0, reverse splice @now, 0, $next;\n $swopped = 1;\n next_swop( $max, $level+1, \\@now, [ @$d ] );\n }\n push @$d, $next;\n }\n $$max = $level if !$swopped and $level > $$max;\n}\n\nsub topswops {\n my $n = shift;\n my @d = 2..$n;\n my @p = ( 1, (0) x ($n-1) );\n my $max = 0;\n next_swop( \\$max, 0, \\@p, \\@d );\n return $max;\n}\n\nprintf \"Maximum swops for %2d cards: %2d\\n\", $_, topswops $_ for 1..10;\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;\">fannkuch</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;\">sequence</span> <span style=\"color: #000000;\">count</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>\n <span style=\"color: #000000;\">perm1</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>\n <span style=\"color: #004080;\">integer</span> <span style=\"color: #000000;\">maxFlipsCount</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">0</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">r</span> <span style=\"color: #0000FF;\">=</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: #004600;\">true</span> <span style=\"color: #008080;\">do</span>\n <span style=\"color: #008080;\">while</span> <span style=\"color: #000000;\">r</span><span style=\"color: #0000FF;\">!=</span><span style=\"color: #000000;\">1</span> <span style=\"color: #008080;\">do</span>\n <span style=\"color: #000000;\">count</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: #0000FF;\">=</span> <span style=\"color: #000000;\">r</span>\n <span style=\"color: #000000;\">r</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;\">if</span> <span style=\"color: #008080;\">not</span> <span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">perm1</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;\">or</span> <span style=\"color: #000000;\">perm1</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> <span style=\"color: #008080;\">then</span>\n <span style=\"color: #004080;\">sequence</span> <span style=\"color: #000000;\">perm</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">perm1</span>\n <span style=\"color: #004080;\">integer</span> <span style=\"color: #000000;\">flipsCount</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">0</span><span style=\"color: #0000FF;\">,</span>\n <span style=\"color: #000000;\">k</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">perm</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: #000000;\">k</span><span style=\"color: #0000FF;\">!=</span><span style=\"color: #000000;\">1</span> <span style=\"color: #008080;\">do</span>\n <span style=\"color: #000000;\">perm</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">reverse</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">perm</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: #0000FF;\">&</span> <span style=\"color: #000000;\">perm</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: #000000;\">n</span><span style=\"color: #0000FF;\">]</span>\n <span style=\"color: #000000;\">flipsCount</span> <span style=\"color: #0000FF;\">+=</span> <span style=\"color: #000000;\">1</span>\n <span style=\"color: #000000;\">k</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">perm</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;\">while</span>\n <span style=\"color: #008080;\">if</span> <span style=\"color: #000000;\">flipsCount</span><span style=\"color: #0000FF;\">></span><span style=\"color: #000000;\">maxFlipsCount</span> <span style=\"color: #008080;\">then</span>\n <span style=\"color: #000000;\">maxFlipsCount</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">flipsCount</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;\">-- Use incremental change to generate another permutation</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;\">if</span> <span style=\"color: #000000;\">r</span><span style=\"color: #0000FF;\">></span><span style=\"color: #000000;\">n</span> <span style=\"color: #008080;\">then</span> <span style=\"color: #008080;\">return</span> <span style=\"color: #000000;\">maxFlipsCount</span> <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">if</span>\n <span style=\"color: #004080;\">integer</span> <span style=\"color: #000000;\">perm0</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">perm1</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">]</span>\n <span style=\"color: #000000;\">perm1</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">1</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: #0000FF;\">=</span> <span style=\"color: #000000;\">perm1</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">2</span><span style=\"color: #0000FF;\">..</span><span style=\"color: #000000;\">r</span><span style=\"color: #0000FF;\">]</span>\n <span style=\"color: #000000;\">perm1</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">r</span><span style=\"color: #0000FF;\">]</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">perm0</span>\n <span style=\"color: #000000;\">count</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">r</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;\">count</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: #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;\">r</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;\">while</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">function</span> <span style=\"color: #000080;font-style:italic;\">-- fannkuch</span>\n\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: #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: #008080;\">iff</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #7060A8;\">platform</span><span style=\"color: #0000FF;\">()=</span><span style=\"color: #004600;\">JS</span><span style=\"color: #0000FF;\">?</span><span style=\"color: #000000;\">9</span><span style=\"color: #0000FF;\">:</span><span style=\"color: #000000;\">10</span><span style=\"color: #0000FF;\">)</span> <span style=\"color: #008080;\">do</span>\n <span style=\"color: #0000FF;\">?</span><span style=\"color: #000000;\">fannkuch</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: #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<!--\n","language":"Phix"},{"code":"go ?=>\n member(N,1..10),\n Perm = 1..N,\n Rev = Perm.reverse(),\n Max = 0,\n while(Perm != Rev)\n next_permutation(Perm),\n C = topswops(Perm),\n if C > Max then\n Max := C\n end\n end,\n printf(\"%2d: %2d\\n\",N,Max),\n fail,\n nl.\ngo => true.\n\ntopswops([]) = 0 => true.\ntopswops([1]) = 0 => true.\ntopswops([1|_]) = 0 => true.\ntopswops(P) = Count =>\n Len = P.length,\n Count = 0,\n while (P[1] > 1)\n Pos = P[1],\n P := [P[I] : I in 1..Pos].reverse() ++ [P[I] : I in Pos+1..Len],\n Count := Count + 1\n end.\n\n% Inline\nnext_permutation(Perm) =>\n N = Perm.length,\n K = N - 1,\n while (Perm[K] > Perm[K+1], K >= 0)\n K := K - 1\n end,\n if K > 0 then\n J = N,\n while (Perm[K] > Perm[J]) J := J - 1 end,\n Tmp := Perm[K],\n Perm[K] := Perm[J],\n Perm[J] := Tmp,\n R = N,\n S = K + 1,\n while (R > S)\n Tmp := Perm[R],\n Perm[R] := Perm[S],\n Perm[S] := Tmp,\n R := R - 1,\n S := S + 1\n end\n end.\n","language":"Picat"},{"code":"(de fannkuch (N)\n (let (Lst (range 1 N) L Lst Max)\n (recur (L) # Permute\n (if (cdr L)\n (do (length L)\n (recurse (cdr L))\n (rot L) )\n (zero N) # For each permutation\n (for (P (copy Lst) (> (car P) 1) (flip P (car P)))\n (inc 'N) )\n (setq Max (max N Max)) ) )\n Max ) )\n\n(for I 10\n (println I (fannkuch I)) )\n","language":"PicoLisp"},{"code":"(subscriptrange):\ntopswap: procedure options (main); /* 12 November 2013 */\n declare cards(*) fixed (2) controlled, t fixed (2);\n declare dealt(*) bit(1) controlled;\n declare (count, i, m, n, c1, c2) fixed binary;\n declare random builtin;\n\n do n = 1 to 10;\n allocate cards(n), dealt(n);\n /* Take the n cards, in order ... */\n do i = 1 to n; cards(i) = i; end;\n /* ... and shuffle them. */\n do i = 1 to n;\n c1 = random*n+1; c2 = random*n+1;\n t = cards(c1); cards(c1) = cards(c2); cards(c2) = t;\n end;\n /* If '1' is the first card, game is trivial; swap it with another. */\n if cards(1) = 1 & n > 1 then\n do; t = cards(1); cards(1) = cards(2); cards(2) = t; end;\n\n count = 0;\n do until (cards(1) = 1);\n /* take the value of the first card, M, and reverse the first M cards. */\n m = cards(1);\n do i = 1 to m/2;\n t = cards(i); cards(i) = cards(m-i+1); cards(m-i+1) = t;\n end;\n count = count + 1;\n end;\n put skip edit (n, ':', count) (f(2), a, f(4));\n end;\nend topswap;\n","language":"PL-I"},{"code":"range = (a, b):\n i = 0, l = list(b-a+1)\n while (a + i <= b):\n l (i) = a + i++.\n l.\n\nfannkuch = (n):\n flips = 0, maxf = 0, k = 0, m = n - 1, r = n\n perml = range(0, n), count = list(n), perm = list(n)\n\n loop:\n while (r != 1):\n count (r-1) = r\n r--.\n\n if (perml (0) != 0 and perml (m) != m):\n flips = 0, i = 1\n while (i < n):\n perm (i) = perml (i)\n i++.\n k = perml (0)\n loop:\n i = 1, j = k - 1\n while (i < j):\n t = perm (i), perm (i) = perm (j), perm (j) = t\n i++, j--.\n flips++\n j = perm (k), perm (k) = k, k = j\n if (k == 0): break.\n .\n if (flips > maxf): maxf = flips.\n .\n\n loop:\n if (r == n):\n (n, maxf) say\n return (maxf).\n\n i = 0, j = perml (0)\n while (i < r):\n k = i + 1\n perml (i) = perml (k)\n i = k.\n perml (r) = j\n\n j = count (r) - 1\n count (r) = j\n if (j > 0): break.\n r++\n_ n\n\nn = argv(1) number\nif (n<1): n=10.\nfannkuch(n)\n","language":"Potion"},{"code":">>> from itertools import permutations\n>>> def f1(p):\n\ti = 0\n\twhile True:\n\t\tp0 = p[0]\n\t\tif p0 == 1: break\n\t\tp[:p0] = p[:p0][::-1]\n\t\ti += 1\n\treturn i\n\n>>> def fannkuch(n):\n\treturn max(f1(list(p)) for p in permutations(range(1, n+1)))\n\n>>> for n in range(1, 11): print(n,fannkuch(n))\n\n1 0\n2 1\n3 2\n4 4\n5 7\n6 10\n7 16\n8 22\n9 30\n10 38\n>>>\n","language":"Python"},{"code":"try:\n import psyco\n psyco.full()\nexcept ImportError:\n pass\n\nbest = [0] * 16\n\ndef try_swaps(deck, f, s, d, n):\n if d > best[n]:\n best[n] = d\n\n i = 0\n k = 1 << s\n while s:\n k >>= 1\n s -= 1\n if deck[s] == -1 or deck[s] == s:\n break\n i |= k\n if (i & f) == i and d + best[s] <= best[n]:\n return d\n s += 1\n\n deck2 = list(deck)\n k = 1\n for i2 in xrange(1, s):\n k <<= 1\n if deck2[i2] == -1:\n if f & k: continue\n elif deck2[i2] != i2:\n continue\n\n deck[i2] = i2\n deck2[:i2 + 1] = reversed(deck[:i2 + 1])\n try_swaps(deck2, f | k, s, 1 + d, n)\n\ndef topswops(n):\n best[n] = 0\n deck0 = [-1] * 16\n deck0[0] = 0\n try_swaps(deck0, 1, n, 0, n)\n return best[n]\n\nfor i in xrange(1, 13):\n print \"%2d: %d\" % (i, topswops(i))\n","language":"Python"},{"code":"topswops <- function(x){\n i <- 0\n while(x[1] != 1){\n first <- x[1]\n if(first == length(x)){\n x <- rev(x)\n } else{\n x <- c(x[first:1], x[(first+1):length(x)])\n }\n i <- i + 1\n }\n return(i)\n}\n\nlibrary(iterpc)\n\nresult <- NULL\n\nfor(i in 1:10){\n I <- iterpc(i, labels = 1:i, ordered = T)\n A <- getall(I)\n A <- data.frame(A)\n A$flips <- apply(A, 1, topswops)\n result <- rbind(result, c(i, max(A$flips)))\n}\n","language":"R"},{"code":"#lang racket\n\n(define (all-misplaced? l)\n (for/and ([x (in-list l)] [n (in-naturals 1)]) (not (= x n))))\n\n(define (topswops n)\n (for/fold ([m 0]) ([p (in-permutations (range 1 (add1 n)))]\n #:when (all-misplaced? p))\n (let loop ([p p] [n 0])\n (if (= 1 (car p))\n (max n m)\n (loop (let loop ([l '()] [r p] [n (car p)])\n (if (zero? n) (append l r)\n (loop (cons (car r) l) (cdr r) (sub1 n))))\n (add1 n))))))\n\n(for ([i (in-range 1 11)]) (printf \"~a\\t~a\\n\" i (topswops i)))\n","language":"Racket"},{"code":"sub swops(@a is copy) {\n my int $count = 0;\n until @a[0] == 1 {\n @a[ ^@a[0] ] .= reverse;\n ++$count;\n }\n $count\n}\n\nsub topswops($n) { max (1..$n).permutations.race.map: &swops }\n\nsay \"$_ {topswops $_}\" for 1 .. 10;\n","language":"Raku"},{"code":"sub swops($a is copy) {\n my int $count = 0;\n while (my \\l = $a.ord) > 1 {\n $a = $a.substr(0, l).flip ~ $a.substr(l);\n ++$count;\n }\n $count\n}\n\nsub topswops($n) { max (1..$n).permutations.map: { .chrs.join.&swops } }\n\nsay \"$_ {topswops $_}\" for 1 .. 10;\n","language":"Raku"},{"code":"/*REXX program generates N decks of numbered cards and finds the maximum \"swops\". */\nparse arg things .; if things=='' then things= 10\n\n do n=1 for things; #= decks(n, n) /*create a (things) number of \"decks\". */\n mx= n\\==1 /*handle the case of a one-card deck.*/\n do i=1 for #; p= swops(!.i) /*compute the SWOPS for this iteration.*/\n if p>mx then mx= p /*This a new maximum? Use a new max. */\n end /*i*/\n say '──────── maximum swops for a deck of' right(n,2) ' cards is' right(mx,4)\n end /*n*/\nexit 0 /*stick a fork in it, we're all done. */\n/*──────────────────────────────────────────────────────────────────────────────────────*/\ndecks: procedure expose !.; parse arg x,y,,$ @. /* X things taken Y at a time. */\n #= 0; call .decks 1 /* [↑] initialize $ & @. to null.*/\n return # /*return number of permutations (decks)*/\n/*──────────────────────────────────────────────────────────────────────────────────────*/\n.decks: procedure expose !. @. x y $ #; parse arg ?\n if ?>y then do; _=@.1; do j=2 for y-1; _= _ @.j; end /*j*/; #= #+1; !.#=_\n end\n else do; qm= ? - 1\n if ?==1 then qs= 2 /*don't use 1-swops that start with 1 */\n else if @.1==? then qs=2 /*skip the 1-swops: 3 x 1 x ···*/\n else qs=1\n do q=qs to x /*build the permutations recursively. */\n do k=1 for qm; if @.k==q then iterate q\n end /*k*/\n @.?=q ; call .decks ? + 1\n end /*q*/\n end\n return\n/*──────────────────────────────────────────────────────────────────────────────────────*/\nswops: parse arg z; do u=1; parse var z t .; if \\datatype(t, 'W') then t= x2d(t)\n if word(z, t)==1 then return u /*found unity at T. */\n do h=10 to things; if pos(h, z)==0 then iterate\n z= changestr(h, z, d2x(h) ) /* [↑] any H's in Z?*/\n end /*h*/\n z= reverse( subword(z, 1, t) ) subword(z, t + 1)\n end /*u*/\n","language":"REXX"},{"code":"def f1(a)\n i = 0\n while (a0 = a[0]) > 1\n a[0...a0] = a[0...a0].reverse\n i += 1\n end\n i\nend\n\ndef fannkuch(n)\n [*1..n].permutation.map{|a| f1(a)}.max\nend\n\nfor n in 1..10\n puts \"%2d : %d\" % [n, fannkuch(n)]\nend\n","language":"Ruby"},{"code":"def try_swaps(deck, f, d, n)\n @best[n] = d if d > @best[n]\n (n-1).downto(0) do |i|\n break if deck[i] == -1 || deck[i] == i\n return if d + @best[i] <= @best[n]\n end\n deck2 = deck.dup\n for i in 1...n\n k = 1 << i\n if deck2[i] == -1\n next if f & k != 0\n elsif deck2[i] != i\n next\n end\n deck2[0] = i\n deck2[1..i] = deck[0...i].reverse\n try_swaps(deck2, f | k, d+1, n)\n end\nend\n\ndef topswops(n)\n @best[n] = 0\n deck0 = [-1] * (n + 1)\n try_swaps(deck0, 1, 0, n)\n @best[n]\nend\n\n@best = [0] * 16\nfor i in 1..10\n puts \"%2d : %d\" % [i, topswops(i)]\nend\n","language":"Ruby"},{"code":"use itertools::Itertools;\n\nfn solve(deck: &[usize]) -> usize {\n let mut counter = 0_usize;\n let mut shuffle = deck.to_vec();\n loop {\n let p0 = shuffle[0];\n if p0 == 1 {\n break;\n }\n shuffle[..p0].reverse();\n counter += 1;\n }\n\n counter\n}\n\n// this is a naive method which tries all permutations and works up to ~12 cards\nfn topswops(number: usize) -> usize {\n (1..=number)\n .permutations(number)\n .fold(0_usize, |mut acc, p| {\n let steps = solve(&p);\n if steps > acc {\n acc = steps;\n }\n acc\n })\n}\nfn main() {\n (1_usize..=10).for_each(|x| println!(\"{}: {}\", x, topswops(x)));\n}\n","language":"Rust"},{"code":"object Fannkuch extends App {\n\n def fannkuchen(l: List[Int], n: Int, i: Int, acc: Int): Int = {\n def flips(l: List[Int]): Int = (l: @unchecked) match {\n case 1 :: ls => 0\n case (n :: ls) =>\n val splitted = l.splitAt(n)\n flips(splitted._2.reverse_:::(splitted._1)) + 1\n }\n\n def rotateLeft(l: List[Int]) =\n l match {\n case Nil => List()\n case x :: xs => xs ::: List(x)\n }\n\n if (i >= n) acc\n else {\n if (n == 1) acc.max(flips(l))\n else {\n val split = l.splitAt(n)\n fannkuchen(rotateLeft(split._1) ::: split._2, n, i + 1, fannkuchen(l, n - 1, 0, acc))\n }\n }\n } // def fannkuchen(\n\n val result = (1 to 10).map(i => (i, fannkuchen(List.range(1, i + 1), i, 0, 0)))\n println(\"Computing results...\")\n result.foreach(x => println(s\"Pfannkuchen(${x._1})\\t= ${x._2}\"))\n assert(result == Vector((1, 0), (2, 1), (3, 2), (4, 4), (5, 7), (6, 10), (7, 16), (8, 22), (9, 30), (10, 38)), \"Bad results\")\n println(s\"Successfully completed without errors. [total ${scala.compat.Platform.currentTime - executionStart} ms]\")\n}\n","language":"Scala"},{"code":"package require struct::list\n\nproc swap {listVar} {\n upvar 1 $listVar list\n set n [lindex $list 0]\n for {set i 0; set j [expr {$n-1}]} {$i<$j} {incr i;incr j -1} {\n\tset tmp [lindex $list $i]\n\tlset list $i [lindex $list $j]\n\tlset list $j $tmp\n }\n}\n\nproc swaps {list} {\n for {set i 0} {[lindex $list 0] > 1} {incr i} {\n\tswap list\n }\n return $i\n}\n\nproc topswops list {\n set n 0\n ::struct::list foreachperm p $list {\n\tset n [expr {max($n,[swaps $p])}]\n }\n return $n\n}\n\nproc topswopsTo n {\n puts \"n\\ttopswops(n)\"\n for {set i 1} {$i <= $n} {incr i} {\n\tputs $i\\t[topswops [lappend list $i]]\n }\n}\ntopswopsTo 10\n","language":"Tcl"},{"code":"import \"./fmt\" for Fmt\n\nvar maxn = 10\nvar maxl = 50\n\nvar steps = Fn.new { |n|\n var a = List.filled(maxl, null)\n var b = List.filled(maxl, null)\n var x = List.filled(maxl, 0)\n for (i in 0...maxl) {\n a[i] = List.filled(maxn + 1, 0)\n b[i] = List.filled(maxn + 1, 0)\n }\n a[0][0] = 1\n var m = 0\n var l = 0\n while (true) {\n x[l] = x[l] + 1\n var k = x[l]\n var cont = false\n if (k >= n) {\n if (l <= 0) break\n l = l - 1\n cont = true\n } else if (a[l][k] == 0) {\n if (b[l][k+1] != 0) cont = true\n } else if (a[l][k] != k + 1) {\n cont = true\n }\n if (!cont) {\n a[l+1] = a[l].toList\n var j = 1\n while (j <= k) {\n a[l+1][j] = a[l][k-j]\n j = j + 1\n }\n b[l+1] = b[l].toList\n a[l+1][0] = k + 1\n b[l+1][k+1] = 1\n if (l > m - 1) {\n m = l + 1\n }\n l = l + 1\n x[l] = 0\n }\n }\n return m\n}\n\nfor (i in 1..maxn) Fmt.print(\"$2d: $d\", i, steps.call(i))\n","language":"Wren"},{"code":"code ChOut=8, CrLf=9, IntOut=11;\nint N, Max, Card1(16), Card2(16);\n\nproc Topswop(D); \\Conway's card swopping game\nint D; \\depth of recursion\nint I, J, C, T;\n[if D # N then \\generate N! permutations of 1..N in Card1\n [for I:= 0 to N-1 do\n [for J:= 0 to D-1 do \\check if object (letter) already used\n if Card1(J) = I+1 then J:=100;\n if J < 100 then\n [Card1(D):= I+1; \\card number not used so append it\n Topswop(D+1); \\recurse next level deeper\n ];\n ];\n ]\nelse [\\determine number of topswops to get card 1 at beginning\n for I:= 0 to N-1 do Card2(I):= Card1(I); \\make working copy of deck\n C:= 0; \\initialize swop counter\n while Card2(0) # 1 do\n [I:= 0; J:= Card2(0)-1;\n while I < J do\n [T:= Card2(I); Card2(I):= Card2(J); Card2(J):= T;\n I:= I+1; J:= J-1;\n ];\n C:= C+1;\n ];\n if C>Max then Max:= C;\n ];\n];\n\n[for N:= 1 to 10 do\n [Max:= 0;\n Topswop(0);\n IntOut(0, N); ChOut(0, ^ ); IntOut(0, Max); CrLf(0);\n ];\n]\n","language":"XPL0"},{"code":"code CrLf=9, IntOut=11, Text=12;\nint N, D, Best(16);\n\nproc TrySwaps(A, F, S);\nint A, F, S;\nint B(16), I, J, K;\n[if D > Best(N) then Best(N):= D;\nloop [if A(S)=-1 ! A(S)=S then quit;\n if D+Best(S) <= Best(N) then return;\n if S = 0 then quit;\n S:= S-1;\n ];\nD:= D+1;\nfor I:= 0 to S do B(I):= A(I);\nK:= 1;\nfor I:= 1 to S do\n [K:= K<<1;\n if B(I)=-1 & (F&K)=0 ! B(I)=I then\n [J:= I; B(0):= J;\n while J do [J:= J-1; B(I-J):= A(J)];\n TrySwaps(B, F!K, S);\n ];\n ];\nD:= D-1;\n];\n\nint I, X(16);\n[for I:= 0 to 16-1 do\n [X(I):= -1; Best(I):= 0];\nX(0):= 0;\nfor N:= 1 to 13 do\n [D:= 0;\n TrySwaps(X, 1, N-1);\n IntOut(0, N); Text(0, \": \"); IntOut(0, Best(N)); CrLf(0);\n ];\n]\n","language":"XPL0"},{"code":"fcn topswops(n){\n flip:=fcn(xa){\n if (not xa[0]) return(0);\n xa.reverse(0,xa[0]+1); // inplace, ~4x faster than making new lists\n return(1 + self.fcn(xa));\n };\n (0).pump(n,List):Utils.Helpers.permute(_).pump(List,\"copy\",flip).reduce(\"max\");\n}\n\nforeach n in ([1 .. 10]){ println(n, \": \", topswops(n)) }\n","language":"Zkl"}],"string":"[\n {\n \"code\": \"---\\nfrom: http://rosettacode.org/wiki/Topswops\\n\",\n \"language\": \"00-META\"\n },\n {\n \"code\": \"Topswops is a card game created by John Conway in the 1970's.\\n\\n\\nAssume you have a particular permutation of a set of n cards numbered 1..n on both of their faces, for example the arrangement of four cards given by [2, 4, 1, 3] where the leftmost card is on top. \\n\\nA round is composed of reversing the first m cards where m is the value of the topmost card. \\n\\nRounds are repeated until the topmost card is the number 1 and the number of swaps is recorded. \\n\\n\\nFor our example the swaps produce:\\n<pre> \\n [2, 4, 1, 3] # Initial shuffle\\n [4, 2, 1, 3]\\n [3, 1, 2, 4]\\n [2, 1, 3, 4]\\n [1, 2, 3, 4]\\n</pre>\\n\\nFor a total of four swaps from the initial ordering to produce the terminating case where 1 is on top.\\n\\n\\nFor a particular number <code> n </code> of cards, <code> topswops(n) </code> is the maximum swaps needed for any starting permutation of the <code>n</code> cards.\\n\\n\\n;Task:\\nThe task is to generate and show here a table of <code> n </code> vs <code> topswops(n) </code> for <code> n </code> in the range 1..10 inclusive.\\n\\n\\n;Note:\\n[[oeis:A000375|Topswops]] is also known as [http://www.haskell.org/haskellwiki/Shootout/Fannkuch Fannkuch] from the German word ''Pfannkuchen'' meaning [http://youtu.be/3biN6nQYqZY pancake].\\n\\n\\n;Related tasks:\\n* [[Number reversal game]]\\n* [[Sorting algorithms/Pancake sort]]\\n<br><br>\\n\\n\",\n \"language\": \"00-TASK\"\n },\n {\n \"code\": \"V best = [0] * 16\\n\\nF try_swaps(&deck, f, =s, d, n)\\n I d > :best[n]\\n :best[n] = d\\n\\n V i = 0\\n V k = 1 << s\\n L s != 0\\n k >>= 1\\n s--\\n I deck[s] == -1 | deck[s] == s\\n L.break\\n i [|]= k\\n I (i [&] f) == i & d + :best[s] <= :best[n]\\n R d\\n s++\\n\\n V deck2 = copy(deck)\\n k = 1\\n L(i2) 1 .< s\\n k <<= 1\\n I deck2[i2] == -1\\n I (f [&] k) != 0\\n L.continue\\n E I deck2[i2] != i2\\n L.continue\\n\\n deck[i2] = i2\\n L(j) 0 .. i2\\n deck2[j] = deck[i2 - j]\\n try_swaps(&deck2, f [|] k, s, 1 + d, n)\\n\\nF topswops(n)\\n :best[n] = 0\\n V deck0 = [-1] * 16\\n deck0[0] = 0\\n try_swaps(&deck0, 1, n, 0, n)\\n R :best[n]\\n\\nL(i) 1..12\\n print(‘#2: #.’.format(i, topswops(i)))\\n\",\n \"language\": \"11l\"\n },\n {\n \"code\": \"* Topswops optimized 12/07/2016\\nTOPSWOPS CSECT\\n USING TOPSWOPS,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 \\\" addressability\\n MVC N,=F'1' n=1\\nLOOPN L R4,N n; do n=1 to 10 ===-------------==*\\n C R4,=F'10' \\\" *\\n BH ELOOPN . *\\n MVC P(40),PINIT p=pinit\\n MVC COUNTM,=F'0' countm=0\\nREPEAT MVC CARDS(40),P cards=p -------------------------+\\n SR R11,R11 count=0 |\\nWHILE CLC CARDS,=F'1' do while cards(1)^=1 ---------+\\n BE EWHILE . |\\n MVC M,CARDS m=cards(1)\\n L R2,M m\\n SRA R2,1 m/2\\n ST R2,MD2 md2=m/2\\n L R3,M @card(mm)=m\\n SLA R3,2 *4\\n LA R3,CARDS-4(R3) @card(mm)\\n LA R2,CARDS @card(i)=0\\n LA R6,1 i=1\\nLOOPI C R6,MD2 do i=1 to m/2 -------------+\\n BH ELOOPI . |\\n L R0,0(R2) swap r0=cards(i)\\n MVC 0(4,R2),0(R3) swap cards(i)=cards(mm)\\n ST R0,0(R3) swap cards(mm)=r0\\n AH R2,=H'4' @card(i)=@card(i)+4\\n SH R3,=H'4' @card(mm)=@card(mm)-4\\n LA R6,1(R6) i=i+1 |\\n B LOOPI ----------------------------+\\nELOOPI LA R11,1(R11) count=count+1 |\\n B WHILE -------------------------------+\\nEWHILE C R11,COUNTM if count>countm\\n BNH NOTGT then\\n ST R11,COUNTM countm=count\\nNOTGT BAL R14,NEXTPERM call nextperm\\n LTR R0,R0 until nextperm=0 |\\n BNZ REPEAT ---------------------------------+\\n L R1,N n\\n XDECO R1,XDEC edit n\\n MVC PG(2),XDEC+10 output n\\n MVI PG+2,C':' output ':'\\n L R1,COUNTM countm\\n XDECO R1,XDEC edit countm\\n MVC PG+3(4),XDEC+8 output countm\\n XPRNT PG,L'PG print buffer\\n L R1,N n *\\n LA R1,1(R1) +1 *\\n ST R1,N n=n+1 *\\n B LOOPN ===------------------------------==*\\nELOOPN L R13,4(0,R13) epilog\\n LM R14,R12,12(R13) \\\" restore\\n XR R15,R15 \\\" rc=0\\n BR R14 exit\\nPINIT DC F'1',F'2',F'3',F'4',F'5',F'6',F'7',F'8',F'9',F'10'\\nCARDS DS 10F cards\\nP DS 10F p\\nCOUNTM DS F countm\\nM DS F m\\nN DS F n\\nMD2 DS F m/2\\nPG DC CL20' ' buffer\\nXDEC DS CL12 temp\\n*------- ---- nextperm ----------{-----------------------------------\\nNEXTPERM L R9,N nn=n\\n SR R8,R8 jj=0\\n LR R7,R9 nn\\n BCTR R7,0 j=nn-1\\n LTR R7,R7 if j=0\\n BZ ELOOPJ1 then skip do loop\\nLOOPJ1 LR R1,R7 do j=nn-1 to 1 by -1; j ----+\\n SLA R1,2 . |\\n L R2,P-4(R1) p(j)\\n C R2,P(R1) if p(j)<p(j+1)\\n BNL PJGEPJP then\\n LR R8,R7 jj=j\\n B ELOOPJ1 leave j |\\nPJGEPJP BCT R7,LOOPJ1 j=j-1 ---------------------+\\nELOOPJ1 LA R7,1(R8) j=jj+1\\nLOOPJ2 CR R7,R9 do j=jj+1 while j<nn ------+\\n BNL ELOOPJ2 . |\\n LR R2,R7 j\\n SLA R2,2 .\\n LR R3,R9 nn\\n SLA R3,2 .\\n L R0,P-4(R2) swap p(j),p(nn)\\n L R1,P-4(R3) \\\"\\n ST R0,P-4(R3) \\\"\\n ST R1,P-4(R2) \\\"\\n BCTR R9,0 nn=nn-1\\n LA R7,1(R7) j=j+1 |\\n B LOOPJ2 ----------------------------+\\nELOOPJ2 LTR R8,R8 if jj=0\\n BNZ JJNE0 then\\n LA R0,0 return(0)\\n BR R14 \\\"\\nJJNE0 LA R7,1(R8) j=jj+1\\n LR R2,R7 j\\n SLA R2,2 r@p(j)\\n LR R3,R8 jj\\n SLA R3,2 r@p(jj)\\nLOOPJ3 L R0,P-4(R2) p(j) ----------------------+\\n C R0,P-4(R3) do j=jj+1 while p(j)<p(jj) |\\n BNL ELOOPJ3\\n LA R2,4(R2) r@p(j)=r@p(j)+4\\n LA R7,1(R7) j=j+1 |\\n B LOOPJ3 ----------------------------+\\nELOOPJ3 L R1,P-4(R3) swap p(j),p(jj)\\n ST R0,P-4(R3) \\\"\\n ST R1,P-4(R2) \\\"\\n LA R0,1 return(1)\\n BR R14 ---------------}-----------------------------------\\n YREGS\\n END TOPSWOPS\\n\",\n \"language\": \"360-Assembly\"\n },\n {\n \"code\": \"with Ada.Integer_Text_IO, Generic_Perm;\\n\\nprocedure Topswaps is\\n\\n function Topswaps(Size: Positive) return Natural is\\n package Perms is new Generic_Perm(Size);\\n P: Perms.Permutation;\\n Done: Boolean;\\n Max: Natural;\\n\\n function Swapper_Calls(P: Perms.Permutation) return Natural is\\n\\t Q: Perms.Permutation := P;\\n\\t I: Perms.Element := P(1);\\n begin\\n\\t if I = 1 then\\n\\t return 0;\\n\\t else\\n\\t for Idx in 1 .. I loop\\n\\t Q(Idx) := P(I-Idx+1);\\n\\t end loop;\\n\\t return 1 + Swapper_Calls(Q);\\n\\t end if;\\n end Swapper_Calls;\\n\\n begin\\n Perms.Set_To_First(P, Done);\\n Max:= Swapper_Calls(P);\\n while not Done loop\\n\\t Perms.Go_To_Next(P, Done);\\n\\t Max := natural'Max(Max, Swapper_Calls(P));\\n end loop;\\n return Max;\\n end Topswaps;\\n\\nbegin\\n for I in 1 .. 10 loop\\n Ada.Integer_Text_IO.Put(Item => Topswaps(I), Width => 3);\\n end loop;\\nend Topswaps;\\n\",\n \"language\": \"Ada\"\n },\n {\n \"code\": \"Topswops(Obj, n){\\n\\tR := []\\n\\tfor i, val in obj{\\n\\t\\tif (i <=n)\\n\\t\\t\\tres := val (A_Index=1?\\\"\\\":\\\",\\\") res\\n\\t\\telse\\n\\t\\t\\tres .= \\\",\\\" val\\n\\t}\\n\\tLoop, Parse, res, `,\\n\\t\\tR[A_Index]:= A_LoopField\\n\\treturn R\\n}\\n\",\n \"language\": \"AutoHotkey\"\n },\n {\n \"code\": \"Cards := [2, 4, 1, 3]\\nRes := Print(Cards)\\nwhile (Cards[1]<>1)\\n{\\n\\tCards := Topswops(Cards, Cards[1])\\n\\tRes .= \\\"`n\\\"Print(Cards)\\n}\\nMsgBox % Res\\n\\nPrint(M){\\n\\tfor i, val in M\\n\\t\\t\\tRes .= (A_Index=1?\\\"\\\":\\\"`t\\\") val\\n\\treturn Trim(Res,\\\"`n\\\")\\n}\\n\",\n \"language\": \"AutoHotkey\"\n },\n {\n \"code\": \"#include <stdio.h>\\n#include <string.h>\\n\\ntypedef struct { char v[16]; } deck;\\ntypedef unsigned int uint;\\n\\nuint n, d, best[16];\\n\\nvoid tryswaps(deck *a, uint f, uint s) {\\n#\\tdefine A a->v\\n#\\tdefine B b.v\\n\\tif (d > best[n]) best[n] = d;\\n\\twhile (1) {\\n\\t\\tif ((A[s] == s || (A[s] == -1 && !(f & 1U << s)))\\n\\t\\t\\t&& (d + best[s] >= best[n] || A[s] == -1))\\n\\t\\t\\tbreak;\\n\\n\\t\\tif (d + best[s] <= best[n]) return;\\n\\t\\tif (!--s) return;\\n\\t}\\n\\n\\td++;\\n\\tdeck b = *a;\\n\\tfor (uint i = 1, k = 2; i <= s; k <<= 1, i++) {\\n\\t\\tif (A[i] != i && (A[i] != -1 || (f & k)))\\n\\t\\t\\tcontinue;\\n\\n\\t\\tfor (uint j = B[0] = i; j--;) B[i - j] = A[j];\\n\\t\\ttryswaps(&b, f | k, s);\\n\\t}\\n\\td--;\\n}\\n\\nint main(void) {\\n\\tdeck x;\\n\\tmemset(&x, -1, sizeof(x));\\n\\tx.v[0] = 0;\\n\\n\\tfor (n = 1; n < 13; n++) {\\n\\t\\ttryswaps(&x, 1, n - 1);\\n\\t\\tprintf(\\\"%2d: %d\\\\n\\\", n, best[n]);\\n\\t}\\n\\n\\treturn 0;\\n}\\n\",\n \"language\": \"C\"\n },\n {\n \"code\": \"#define _GNU_SOURCE\\n#include <stdio.h>\\n#include <string.h>\\n#include <pthread.h>\\n#include <sched.h>\\n\\n#define MAX_CPUS 8 // increase this if you got more CPUs/cores\\n\\ntypedef struct { char v[16]; } deck;\\n\\nint n, best[16];\\n\\n// Update a shared variable by spinlock. Since this program really only\\n// enters locks dozens of times, a pthread_mutex_lock() would work\\n// equally fine, but RC already has plenty of examples for that.\\n#define SWAP_OR_RETRY(var, old, new)\\t\\t\\t\\t\\t\\\\\\n\\tif (!__sync_bool_compare_and_swap(&(var), old, new)) {\\t\\t\\\\\\n\\t\\tvolatile int spin = 64;\\t\\t\\t\\t\\t\\\\\\n\\t\\twhile (spin--);\\t\\t\\t\\t\\t\\t\\\\\\n\\t\\tcontinue; }\\n\\nvoid tryswaps(deck *a, int f, int s, int d) {\\n#define A a->v\\n#define B b->v\\n\\n\\twhile (best[n] < d) {\\n\\t\\tint t = best[n];\\n\\t\\tSWAP_OR_RETRY(best[n], t, d);\\n\\t}\\n\\n#define TEST(x)\\t\\t\\t\\t\\t\\t\\t\\t\\t\\\\\\n\\tcase x: if ((A[15-x] == 15-x || (A[15-x] == -1 && !(f & 1<<(15-x))))\\t\\\\\\n\\t\\t\\t&& (A[15-x] == -1 || d + best[15-x] >= best[n]))\\t\\\\\\n\\t\\t\\tbreak;\\t\\t\\t\\t\\t\\t\\t\\\\\\n\\t\\tif (d + best[15-x] <= best[n]) return;\\t\\t\\t\\t\\\\\\n\\t\\ts = 14 - x\\n\\n\\tswitch (15 - s) {\\n\\t\\tTEST(0); TEST(1); TEST(2); TEST(3); TEST(4);\\n\\t\\tTEST(5); TEST(6); TEST(7); TEST(8); TEST(9);\\n\\t\\tTEST(10); TEST(11); TEST(12); TEST(13); TEST(14);\\n\\t\\treturn;\\n\\t}\\n#undef TEST\\n\\n\\tdeck *b = a + 1;\\n\\t*b = *a;\\n\\td++;\\n\\n#define FLIP(x)\\t\\t\\t\\t\\t\\t\\t\\\\\\n\\tif (A[x] == x || ((A[x] == -1) && !(f & (1<<x)))) {\\t\\\\\\n\\t\\tB[0] = x;\\t\\t\\t\\t\\t\\\\\\n\\t\\tfor (int j = x; j--; ) B[x-j] = A[j];\\t\\t\\\\\\n\\t\\ttryswaps(b, f|(1<<x), s, d); }\\t\\t\\t\\\\\\n\\tif (s == x) return;\\n\\n\\tFLIP(1); FLIP(2); FLIP(3); FLIP(4); FLIP(5);\\n\\tFLIP(6); FLIP(7); FLIP(8); FLIP(9); FLIP(10);\\n\\tFLIP(11); FLIP(12); FLIP(13); FLIP(14); FLIP(15);\\n#undef FLIP\\n}\\n\\nint num_cpus(void) {\\n\\tcpu_set_t ct;\\n\\tsched_getaffinity(0, sizeof(ct), &ct);\\n\\n\\tint cnt = 0;\\n\\tfor (int i = 0; i < MAX_CPUS; i++)\\n\\t\\tif (CPU_ISSET(i, &ct))\\n\\t\\t\\tcnt++;\\n\\n\\treturn cnt;\\n}\\n\\nstruct work { int id; deck x[256]; } jobs[MAX_CPUS];\\nint first_swap;\\n\\nvoid *thread_start(void *arg) {\\n\\tstruct work *job = arg;\\n\\twhile (1) {\\n\\t\\tint at = first_swap;\\n\\t\\tif (at >= n) return 0;\\n\\n\\t\\tSWAP_OR_RETRY(first_swap, at, at + 1);\\n\\n\\t\\tmemset(job->x, -1, sizeof(deck));\\n\\t\\tjob->x[0].v[at] = 0;\\n\\t\\tjob->x[0].v[0] = at;\\n\\t\\ttryswaps(job->x, 1 | (1 << at), n - 1, 1);\\n\\t}\\n}\\n\\nint main(void) {\\n\\tint n_cpus = num_cpus();\\n\\n\\tfor (int i = 0; i < MAX_CPUS; i++)\\n\\t\\tjobs[i].id = i;\\n\\n\\tpthread_t tid[MAX_CPUS];\\n\\n\\tfor (n = 2; n <= 14; n++) {\\n\\t\\tint top = n_cpus;\\n\\t\\tif (top > n) top = n;\\n\\n\\t\\tfirst_swap = 1;\\n\\t\\tfor (int i = 0; i < top; i++)\\n\\t\\t\\tpthread_create(tid + i, 0, thread_start, jobs + i);\\n\\n\\t\\tfor (int i = 0; i < top; i++)\\n\\t\\t\\tpthread_join(tid[i], 0);\\n\\n\\t\\tprintf(\\\"%2d: %2d\\\\n\\\", n, best[n]);\\n\\t}\\n\\n\\treturn 0;\\n}\\n\",\n \"language\": \"C\"\n },\n {\n \"code\": \"#include <iostream>\\n#include <vector>\\n#include <numeric>\\n#include <algorithm>\\n\\nint topswops(int n) {\\n std::vector<int> list(n);\\n std::iota(std::begin(list), std::end(list), 1);\\n int max_steps = 0;\\n do {\\n auto temp_list = list;\\n for (int steps = 1; temp_list[0] != 1; ++steps) {\\n std::reverse(std::begin(temp_list), std::begin(temp_list) + temp_list[0]);\\n if (steps > max_steps) max_steps = steps;\\n }\\n } while (std::next_permutation(std::begin(list), std::end(list)));\\n return max_steps;\\n}\\n\\nint main() {\\n for (int i = 1; i <= 10; ++i) {\\n std::cout << i << \\\": \\\" << topswops(i) << std::endl;\\n }\\n return 0;\\n}\\n\",\n \"language\": \"C++\"\n },\n {\n \"code\": \"using System;\\n\\npublic class Topswops {\\n static readonly int maxBest = 32;\\n static int[] best;\\n\\n private static void TrySwaps(int[] deck, int f, int d, int n) {\\n if (d > best[n])\\n best[n] = d;\\n\\n for (int i = n - 1; i >= 0; i--) {\\n if (deck[i] == -1 || deck[i] == i)\\n break;\\n if (d + best[i] <= best[n])\\n return;\\n }\\n\\n int[] deck2 = (int[])deck.Clone();\\n for (int i = 1; i < n; i++) {\\n int k = 1 << i;\\n if (deck2[i] == -1) {\\n if ((f & k) != 0)\\n continue;\\n } else if (deck2[i] != i)\\n continue;\\n\\n deck2[0] = i;\\n for (int j = i - 1; j >= 0; j--)\\n deck2[i - j] = deck[j]; // Reverse copy.\\n TrySwaps(deck2, f | k, d + 1, n);\\n }\\n }\\n\\n static int topswops(int n) {\\n if(n <= 0 || n >= maxBest) throw new ArgumentOutOfRangeException(nameof(n), \\\"n must be greater than 0 and less than maxBest.\\\");\\n best[n] = 0;\\n int[] deck0 = new int[n + 1];\\n for (int i = 1; i < n; i++)\\n deck0[i] = -1;\\n TrySwaps(deck0, 1, 0, n);\\n return best[n];\\n }\\n\\n public static void Main(string[] args) {\\n best = new int[maxBest];\\n for (int i = 1; i < 11; i++)\\n Console.WriteLine(i + \\\": \\\" + topswops(i));\\n }\\n}\\n\",\n \"language\": \"C-sharp\"\n },\n {\n \"code\": \"import std.stdio, std.algorithm, std.range, permutations2;\\n\\nint topswops(in int n) pure @safe {\\n static int flip(int[] xa) pure nothrow @safe @nogc {\\n if (!xa[0]) return 0;\\n xa[0 .. xa[0] + 1].reverse();\\n return 1 + flip(xa);\\n }\\n return n.iota.array.permutations.map!flip.reduce!max;\\n}\\n\\nvoid main() {\\n foreach (immutable i; 1 .. 11)\\n writeln(i, \\\": \\\", i.topswops);\\n}\\n\",\n \"language\": \"D\"\n },\n {\n \"code\": \"import std.stdio, std.typecons;\\n\\n__gshared uint[32] best;\\n\\nuint topswops(size_t n)() nothrow @nogc {\\n static assert(n > 0 && n < best.length);\\n size_t d = 0;\\n\\n alias T = byte;\\n alias Deck = T[n];\\n\\n void trySwaps(in ref Deck deck, in uint f) nothrow @nogc {\\n if (d > best[n])\\n best[n] = d;\\n\\n foreach_reverse (immutable i; staticIota!(0, n)) {\\n if ((deck[i] == i || (deck[i] == -1 && !(f & (1U << i))))\\n && (d + best[i] >= best[n] || deck[i] == -1))\\n break;\\n if (d + best[i] <= best[n])\\n return;\\n }\\n\\n Deck deck2 = void;\\n foreach (immutable i; staticIota!(0, n)) // Copy.\\n deck2[i] = deck[i];\\n\\n d++;\\n foreach (immutable i; staticIota!(1, n)) {\\n enum uint k = 1U << i;\\n if (deck[i] != i && (deck[i] != -1 || (f & k)))\\n continue;\\n\\n deck2[0] = T(i);\\n foreach_reverse (immutable j; staticIota!(0, i))\\n deck2[i - j] = deck[j]; // Reverse copy.\\n trySwaps(deck2, f | k);\\n }\\n d--;\\n }\\n\\n best[n] = 0;\\n Deck deck0 = -1;\\n deck0[0] = 0;\\n trySwaps(deck0, 1);\\n return best[n];\\n}\\n\\nvoid main() {\\n foreach (immutable i; staticIota!(1, 14))\\n writefln(\\\"%2d: %d\\\", i, topswops!i());\\n}\\n\",\n \"language\": \"D\"\n },\n {\n \"code\": \"class\\n\\tTOPSWOPS\\n\\ncreate\\n\\tmake\\n\\nfeature\\n\\n\\tmake (n: INTEGER)\\n\\t\\t\\t-- Topswop game.\\n\\t\\tlocal\\n\\t\\t\\tperm, ar: ARRAY [INTEGER]\\n\\t\\t\\ttcount, count: INTEGER\\n\\t\\tdo\\n\\t\\t\\tcreate perm_sol.make_empty\\n\\t\\t\\tcreate solution.make_empty\\n\\t\\t\\tacross\\n\\t\\t\\t\\t1 |..| n as c\\n\\t\\t\\tloop\\n\\t\\t\\t\\tcreate ar.make_filled (0, 1, c.item)\\n\\t\\t\\t\\tacross\\n\\t\\t\\t\\t\\t1 |..| c.item as d\\n\\t\\t\\t\\tloop\\n\\t\\t\\t\\t\\tar [d.item] := d.item\\n\\t\\t\\t\\tend\\n\\t\\t\\t\\tpermute (ar, 1)\\n\\t\\t\\t\\tacross\\n\\t\\t\\t\\t\\t1 |..| perm_sol.count as e\\n\\t\\t\\t\\tloop\\n\\t\\t\\t\\t\\ttcount := 0\\n\\t\\t\\t\\t\\tfrom\\n\\t\\t\\t\\t\\tuntil\\n\\t\\t\\t\\t\\t\\tperm_sol.at (e.item).at (1) = 1\\n\\t\\t\\t\\t\\tloop\\n\\t\\t\\t\\t\\t\\tperm_sol.at (e.item) := reverse_array (perm_sol.at (e.item))\\n\\t\\t\\t\\t\\t\\ttcount := tcount + 1\\n\\t\\t\\t\\t\\tend\\n\\t\\t\\t\\t\\tif tcount > count then\\n\\t\\t\\t\\t\\t\\tcount := tcount\\n\\t\\t\\t\\t\\tend\\n\\t\\t\\t\\tend\\n\\t\\t\\t\\tsolution.force (count, c.item)\\n\\t\\t\\tend\\n\\t\\tend\\n\\n\\tsolution: ARRAY [INTEGER]\\n\\nfeature {NONE}\\n\\n\\tperm_sol: ARRAY [ARRAY [INTEGER]]\\n\\n\\treverse_array (ar: ARRAY [INTEGER]): ARRAY [INTEGER]\\n\\t\\t\\t-- Array with 'ar[1]' elements reversed.\\n\\t\\trequire\\n\\t\\t\\tar_not_void: ar /= Void\\n\\t\\tlocal\\n\\t\\t\\ti, j: INTEGER\\n\\t\\tdo\\n\\t\\t\\tcreate Result.make_empty\\n\\t\\t\\tResult.deep_copy (ar)\\n\\t\\t\\tfrom\\n\\t\\t\\t\\ti := 1\\n\\t\\t\\t\\tj := ar [1]\\n\\t\\t\\tuntil\\n\\t\\t\\t\\ti > j\\n\\t\\t\\tloop\\n\\t\\t\\t\\tResult [i] := ar [j]\\n\\t\\t\\t\\tResult [j] := ar [i]\\n\\t\\t\\t\\ti := i + 1\\n\\t\\t\\t\\tj := j - 1\\n\\t\\t\\tend\\n\\t\\tensure\\n\\t\\t\\tsame_elements: across ar as a all Result.has (a.item) end\\n\\t\\tend\\n\\n\\tpermute (a: ARRAY [INTEGER]; k: INTEGER)\\n\\t\\t\\t-- All permutations of array 'a' stored in perm_sol.\\n\\t\\trequire\\n\\t\\t\\tar_not_void: a.count >= 1\\n\\t\\t\\tk_valid_index: k > 0\\n\\t\\tlocal\\n\\t\\t\\ti, t: INTEGER\\n\\t\\t\\ttemp: ARRAY [INTEGER]\\n\\t\\tdo\\n\\t\\t\\tcreate temp.make_empty\\n\\t\\t\\tif k = a.count then\\n\\t\\t\\t\\tacross\\n\\t\\t\\t\\t\\ta as ar\\n\\t\\t\\t\\tloop\\n\\t\\t\\t\\t\\ttemp.force (ar.item, temp.count + 1)\\n\\t\\t\\t\\tend\\n\\t\\t\\t\\tperm_sol.force (temp, perm_sol.count + 1)\\n\\t\\t\\telse\\n\\t\\t\\t\\tfrom\\n\\t\\t\\t\\t\\ti := k\\n\\t\\t\\t\\tuntil\\n\\t\\t\\t\\t\\ti > a.count\\n\\t\\t\\t\\tloop\\n\\t\\t\\t\\t\\tt := a [k]\\n\\t\\t\\t\\t\\ta [k] := a [i]\\n\\t\\t\\t\\t\\ta [i] := t\\n\\t\\t\\t\\t\\tpermute (a, k + 1)\\n\\t\\t\\t\\t\\tt := a [k]\\n\\t\\t\\t\\t\\ta [k] := a [i]\\n\\t\\t\\t\\t\\ta [i] := t\\n\\t\\t\\t\\t\\ti := i + 1\\n\\t\\t\\t\\tend\\n\\t\\t\\tend\\n\\t\\tend\\n\\nend\\n\",\n \"language\": \"Eiffel\"\n },\n {\n \"code\": \"class\\n\\tAPPLICATION\\n\\ncreate\\n\\tmake\\n\\nfeature\\n\\n\\tmake\\n\\t\\tdo\\n\\t\\t\\tcreate topswop.make (10)\\n\\t\\t\\tacross\\n\\t\\t\\t\\ttopswop.solution as t\\n\\t\\t\\tloop\\n\\t\\t\\t\\tio.put_string (t.item.out + \\\"%N\\\")\\n\\t\\t\\tend\\n\\t\\tend\\n\\n\\ttopswop: TOPSWOPS\\n\\nend\\n\",\n \"language\": \"Eiffel\"\n },\n {\n \"code\": \"defmodule Topswops do\\n def get_1_first( [1 | _t] ), do: 0\\n def get_1_first( list ), do: 1 + get_1_first( swap(list) )\\n\\n defp swap( [n | _t]=list ) do\\n {swaps, remains} = Enum.split( list, n )\\n Enum.reverse( swaps, remains )\\n end\\n\\n def task do\\n IO.puts \\\"N\\\\ttopswaps\\\"\\n Enum.map(1..10, fn n -> {n, permute(Enum.to_list(1..n))} end)\\n |> Enum.map(fn {n, n_permutations} -> {n, get_1_first_many(n_permutations)} end)\\n |> Enum.map(fn {n, n_swops} -> {n, Enum.max(n_swops)} end)\\n |> Enum.each(fn {n, max} -> IO.puts \\\"#{n}\\\\t#{max}\\\" end)\\n end\\n\\n def get_1_first_many( n_permutations ), do: (for x <- n_permutations, do: get_1_first(x))\\n\\n defp permute([]), do: [[]]\\n defp permute(list), do: for x <- list, y <- permute(list -- [x]), do: [x|y]\\nend\\n\\nTopswops.task\\n\",\n \"language\": \"Elixir\"\n },\n {\n \"code\": \"-module( topswops ).\\n\\n-export( [get_1_first/1, swap/1, task/0] ).\\n\\nget_1_first( [1 | _T] ) -> 0;\\nget_1_first( List ) -> 1 + get_1_first( swap(List) ).\\n\\nswap( [N | _T]=List ) ->\\n\\t{Swaps, Remains} = lists:split( N, List ),\\n\\tlists:reverse( Swaps ) ++ Remains.\\n\\t\\ntask() ->\\n\\tPermutations = [{X, permute:permute(lists:seq(1, X))} || X <- lists:seq(1, 10)],\\n\\tSwops = [{N, get_1_first_many(N_permutations)} || {N, N_permutations} <- Permutations],\\n\\tTopswops = [{N, lists:max(N_swops)} || {N, N_swops} <- Swops],\\n\\tio:fwrite( \\\"N\\ttopswaps~n\\\" ),\\n\\t[io:fwrite(\\\"~p\\t~p~n\\\", [N, Max]) || {N, Max} <- Topswops].\\n\\n\\n\\nget_1_first_many( N_permutations ) -> [get_1_first(X) || X <- N_permutations].\\n\",\n \"language\": \"Erlang\"\n },\n {\n \"code\": \"USING: formatting kernel math math.combinatorics math.order\\nmath.ranges sequences ;\\nFROM: sequences.private => exchange-unsafe ;\\nIN: rosetta-code.topswops\\n\\n! Reverse a subsequence in-place from 0 to n.\\n: head-reverse! ( seq n -- seq' )\\n dupd [ 2/ ] [ ] bi rot\\n [ [ over - 1 - ] dip exchange-unsafe ] 2curry each-integer ;\\n\\n! Reverse the elements in seq according to the first element.\\n: swop ( seq -- seq' ) dup first head-reverse! ;\\n\\n! Determine the number of swops until 1 is the head.\\n: #swops ( seq -- n )\\n 0 swap [ dup first 1 = ] [ [ 1 + ] [ swop ] bi* ] until\\n drop ;\\n\\n! Determine the maximum number of swops for a given length.\\n: topswops ( n -- max )\\n [1,b] <permutations> [ #swops ] [ max ] map-reduce ;\\n\\n: main ( -- )\\n 10 [1,b] [ dup topswops \\\"%2d: %2d\\\\n\\\" printf ] each ;\\n\\nMAIN: main\\n\",\n \"language\": \"Factor\"\n },\n {\n \"code\": \"module top\\nimplicit none\\ncontains\\nrecursive function f(x) result(m)\\n integer :: n, m, x(:),y(size(x)), fst\\n fst = x(1)\\n if (fst == 1) then\\n m = 0\\n else\\n y(1:fst) = x(fst:1:-1)\\n y(fst+1:) = x(fst+1:)\\n m = 1 + f(y)\\n end if\\nend function\\n\\nrecursive function perms(x) result(p)\\ninteger, pointer :: p(:,:), q(:,:)\\ninteger :: x(:), n, k, i\\nn = size(x)\\nif (n == 1) then\\n allocate(p(1,1))\\n p(1,:) = x\\nelse\\n q => perms(x(2:n))\\n k = ubound(q,1)\\n allocate(p(k*n,n))\\n p = 0\\n do i = 1,n\\n p(1+k*(i-1):k*i,1:i-1) = q(:,1:i-1)\\n p(1+k*(i-1):k*i,i) = x(1)\\n p(1+k*(i-1):k*i,i+1:) = q(:,i:)\\n end do\\nend if\\nend function\\nend module\\n\\nprogram topswort\\nuse top\\nimplicit none\\ninteger :: x(10)\\ninteger, pointer :: p(:,:)\\ninteger :: i, j, m\\n\\nforall(i=1:10)\\n x(i) = i\\nend forall\\n\\ndo i = 1,10\\n p=>perms(x(1:i))\\n m = 0\\n do j = 1, ubound(p,1)\\n m = max(m, f(p(j,:)))\\n end do\\n print \\\"(i3,a,i3)\\\", i,\\\": \\\",m\\nend do\\nend program\\n\",\n \"language\": \"Fortran\"\n },\n {\n \"code\": \"Dim Shared As Byte n, d, best(16)\\n\\nSub TrySwaps(A() As Byte, f As Byte, s As Byte)\\n Dim As Byte B(16), i, j, k\\n If d > best(n) Then best(n) = d\\n Do\\n If A(s) = -1 Or A(s) = s Then Exit Do\\n If d+best(s) <= best(n) Then Exit Sub\\n If s = 0 Then Exit Do\\n s -= 1\\n Loop\\n\\n d += 1\\n For i = 0 To s\\n B(i) = A(i)\\n Next\\n\\n k = 1\\n For i = 1 To s\\n k Shl= 1\\n If B(i) =- 1 AndAlso (f And k) = 0 Or B(i) = i Then\\n j = i\\n B(0) = j\\n While j\\n j -= 1\\n B(i-j) = A(j)\\n Wend\\n TrySwaps(B(), f Or k, s)\\n End If\\n Next\\n d -= 1\\nEnd Sub\\n\\nDim As Byte i, X(16)\\nFor i = 0 To 16-1\\n X(i) = -1\\n best(i) = 0\\nNext i\\nX(0) = 0\\n\\nFor n = 1 To 13\\n d = 0\\n TrySwaps(X(), 1, n-1)\\n Print Using \\\"##: ##\\\"; n; best(n)\\nNext n\\n\\nSleep\\n\",\n \"language\": \"FreeBASIC\"\n },\n {\n \"code\": \"// Adapted from http://www-cs-faculty.stanford.edu/~uno/programs/topswops.w\\n// at Donald Knuth's web site. Algorithm credited there to Pepperdine\\n// and referenced to Mathematical Gazette 73 (1989), 131-133.\\npackage main\\n\\nimport \\\"fmt\\\"\\n\\nconst ( // array sizes\\n maxn = 10 // max number of cards\\n maxl = 50 // upper bound for number of steps\\n)\\n\\nfunc main() {\\n for i := 1; i <= maxn; i++ {\\n fmt.Printf(\\\"%d: %d\\\\n\\\", i, steps(i))\\n }\\n}\\n\\nfunc steps(n int) int {\\n var a, b [maxl][maxn + 1]int\\n var x [maxl]int\\n a[0][0] = 1\\n var m int\\n for l := 0; ; {\\n x[l]++\\n k := int(x[l])\\n if k >= n {\\n if l <= 0 {\\n break\\n }\\n l--\\n continue\\n }\\n if a[l][k] == 0 {\\n if b[l][k+1] != 0 {\\n continue\\n }\\n } else if a[l][k] != k+1 {\\n continue\\n }\\n a[l+1] = a[l]\\n for j := 1; j <= k; j++ {\\n a[l+1][j] = a[l][k-j]\\n }\\n b[l+1] = b[l]\\n a[l+1][0] = k + 1\\n b[l+1][k+1] = 1\\n if l > m-1 {\\n m = l + 1\\n }\\n l++\\n x[l] = 0\\n }\\n return m\\n}\\n\",\n \"language\": \"Go\"\n },\n {\n \"code\": \"import Data.List (permutations)\\n\\ntopswops :: Int -> Int\\ntopswops n = maximum $ map tops $ permutations [1 .. n]\\n where\\n tops (1:_) = 0\\n tops xa@(x:_) = 1 + tops reordered\\n where\\n reordered = reverse (take x xa) ++ drop x xa\\n\\nmain =\\n mapM_ (putStrLn . ((++) <$> show <*> (\\\":\\\\t\\\" ++) . show . topswops)) [1 .. 10]\\n\",\n \"language\": \"Haskell\"\n },\n {\n \"code\": \"import Data.List (permutations, inits)\\nimport Control.Arrow (first)\\n\\nderangements :: [Int] -> [[Int]]\\nderangements = (\\\\x -> filter (and . zipWith (/=) x)) <*> permutations\\n\\ntopswop :: Int -> [a] -> [a]\\ntopswop x xs = uncurry (++) (first reverse (splitAt x xs))\\n\\ntopswopIter :: [Int] -> [[Int]]\\ntopswopIter = takeWhile ((/= 1) . head) . iterate (topswop =<< head)\\n\\nswops :: [Int] -> [Int]\\nswops = fmap (length . topswopIter) . derangements\\n\\ntopSwops :: [Int] -> [(Int, Int)]\\ntopSwops = zip [1 ..] . fmap (maximum . (0 :) . swops) . tail . inits\\n\\nmain :: IO ()\\nmain = mapM_ print $ take 10 $ topSwops [1 ..]\\n\",\n \"language\": \"Haskell\"\n },\n {\n \"code\": \"procedure main()\\n every n := 1 to 10 do {\\n ts := 0\\n every (ts := 0) <:= swop(permute([: 1 to n :]))\\n write(right(n, 3),\\\": \\\",right(ts,4))\\n }\\nend\\n\\nprocedure swop(A)\\n count := 0\\n while A[1] ~= 1 do {\\n A := reverse(A[1+:A[1]]) ||| A[(A[1]+1):0]\\n count +:= 1\\n }\\n return count\\nend\\n\\nprocedure permute(A)\\n if *A <= 1 then return A\\n suspend [(A[1]<->A[i := 1 to *A])] ||| permute(A[2:0])\\nend\\n\",\n \"language\": \"Haskell\"\n },\n {\n \"code\": \" swops =: ((|.@:{. , }.)~ {.)^:a:\\n\",\n \"language\": \"J\"\n },\n {\n \"code\": \" swops 2 4 1 3\\n2 4 1 3\\n4 2 1 3\\n3 1 2 4\\n2 1 3 4\\n1 2 3 4\\n\",\n \"language\": \"J\"\n },\n {\n \"code\": \" (,. _1 + ! >./@:(#@swops@A. >:)&i. ])&> 1+i.10\\n 1 0\\n 2 1\\n 3 2\\n 4 4\\n 5 7\\n 6 10\\n 7 16\\n 8 22\\n 9 30\\n10 38\\n\",\n \"language\": \"J\"\n },\n {\n \"code\": \"public class Topswops {\\n static final int maxBest = 32;\\n static int[] best;\\n\\n static private void trySwaps(int[] deck, int f, int d, int n) {\\n if (d > best[n])\\n best[n] = d;\\n\\n for (int i = n - 1; i >= 0; i--) {\\n if (deck[i] == -1 || deck[i] == i)\\n break;\\n if (d + best[i] <= best[n])\\n return;\\n }\\n\\n int[] deck2 = deck.clone();\\n for (int i = 1; i < n; i++) {\\n final int k = 1 << i;\\n if (deck2[i] == -1) {\\n if ((f & k) != 0)\\n continue;\\n } else if (deck2[i] != i)\\n continue;\\n\\n deck2[0] = i;\\n for (int j = i - 1; j >= 0; j--)\\n deck2[i - j] = deck[j]; // Reverse copy.\\n trySwaps(deck2, f | k, d + 1, n);\\n }\\n }\\n\\n static int topswops(int n) {\\n assert(n > 0 && n < maxBest);\\n best[n] = 0;\\n int[] deck0 = new int[n + 1];\\n for (int i = 1; i < n; i++)\\n deck0[i] = -1;\\n trySwaps(deck0, 1, 0, n);\\n return best[n];\\n }\\n\\n public static void main(String[] args) {\\n best = new int[maxBest];\\n for (int i = 1; i < 11; i++)\\n System.out.println(i + \\\": \\\" + topswops(i));\\n }\\n}\\n\",\n \"language\": \"Java\"\n },\n {\n \"code\": \"# \\\"while\\\" as defined here is included in recent versions (>1.4) of jq:\\ndef until(cond; next):\\n def _until:\\n if cond then . else (next|_until) end;\\n _until;\\n\\n# Generate a stream of permutations of [1, ... n].\\n# This implementation uses arity-0 filters for speed.\\ndef permutations:\\n # Given a single array, insert generates a stream by inserting (length+1) at different positions\\n def insert: # state: [m, array]\\n .[0] as $m | (1+(.[1]|length)) as $n\\n | .[1]\\n | if $m >= 0 then (.[0:$m] + [$n] + .[$m:]), ([$m-1, .] | insert) else empty end;\\n\\n if .==0 then []\\n elif . == 1 then [1]\\n else\\n . as $n | ($n-1) | permutations | [$n-1, .] | insert\\n end;\\n\",\n \"language\": \"Jq\"\n },\n {\n \"code\": \"# Input: a permutation; output: an integer\\ndef flips:\\n # state: [i, array]\\n [0, .]\\n | until( .[1][0] == 1;\\n .[1] as $p | $p[0] as $p0\\n\\t | [.[0] + 1, ($p[:$p0] | reverse) + $p[$p0:] ] )\\n | .[0];\\n\\n# input: n, the number of items\\ndef fannkuch:\\n reduce permutations as $p\\n (0; [., ($p|flips) ] | max);\\n\",\n \"language\": \"Jq\"\n },\n {\n \"code\": \"range(1; 11) | [., fannkuch ]\\n\",\n \"language\": \"Jq\"\n },\n {\n \"code\": \"$ jq -n -c -f topswops.jq\\n[1,0]\\n[2,1]\\n[3,2]\\n[4,4]\\n[5,7]\\n[6,10]\\n[7,16]\\n[8,22]\\n[9,30]\\n[10,38]\\n\",\n \"language\": \"Jq\"\n },\n {\n \"code\": \"function fannkuch(n)\\n\\tn == 1 && return 0\\n\\tn == 2 && return 1\\n\\tp = [1:n]\\n\\tq = copy(p)\\n\\ts = copy(p)\\n\\tsign = 1; maxflips = sum = 0\\n\\twhile true\\n\\t\\tq0 = p[1]\\n\\t\\tif q0 != 1\\n\\t\\t\\tfor i = 2:n\\n\\t\\t\\t\\tq[i] = p[i]\\n\\t\\t\\tend\\n\\t\\t\\tflips = 1\\n\\t\\t\\twhile true\\n\\t\\t\\t\\tqq = q[q0] #??\\n\\t\\t\\t\\tif qq == 1\\n\\t\\t\\t\\t\\tsum += sign*flips\\n\\t\\t\\t\\t\\tflips > maxflips && (maxflips = flips)\\n\\t\\t\\t\\t\\tbreak\\n\\t\\t\\t\\tend\\n\\t\\t\\t\\tq[q0] = q0\\n\\t\\t\\t\\tif q0 >= 4\\n\\t\\t\\t\\t\\ti = 2; j = q0-1\\n\\t\\t\\t\\t\\twhile true\\n\\t\\t\\t\\t\\t\\tt = q[i]\\n\\t\\t\\t\\t\\t\\tq[i] = q[j]\\n\\t\\t\\t\\t\\t\\tq[j] = t\\n\\t\\t\\t\\t\\t\\ti += 1\\n\\t\\t\\t\\t\\t\\tj -= 1\\n\\t\\t\\t\\t\\t\\ti >= j && break\\n\\t\\t\\t\\t\\tend\\n\\t\\t\\t\\tend\\n\\t\\t\\t\\tq0 = qq\\n\\t\\t\\t\\tflips += 1\\n\\t\\t\\tend\\n\\t\\tend\\n\\t\\t#permute\\n\\t\\tif sign == 1\\n\\t\\t\\tt = p[2]\\n\\t\\t\\tp[2] = p[1]\\n\\t\\t\\tp[1] = t\\n\\t\\t\\tsign = -1\\n\\t\\telse\\n\\t\\t\\tt = p[2]\\n\\t\\t\\tp[2] = p[3]\\n\\t\\t\\tp[3] = t\\n\\t\\t\\tsign = 1\\n\\t\\t\\tfor i = 3:n\\n\\t\\t\\t\\tsx = s[i]\\n\\t\\t\\t\\tif sx != 1\\n\\t\\t\\t\\t\\ts[i] = sx-1\\n\\t\\t\\t\\t\\tbreak\\n\\t\\t\\t\\tend\\n\\t\\t\\t\\ti == n && return maxflips\\n\\t\\t\\t\\ts[i] = i\\n\\t\\t\\t\\tt = p[1]\\n\\t\\t\\t\\tfor j = 1:i\\n\\t\\t\\t\\t\\tp[j] = p[j+1]\\n\\t\\t\\t\\tend\\n\\t\\t\\t\\tp[i+1] = t\\n\\t\\t\\tend\\n\\t\\tend\\n\\tend\\nend\\n\",\n \"language\": \"Julia\"\n },\n {\n \"code\": \"// version 1.1.2\\n\\nval best = IntArray(32)\\n\\nfun trySwaps(deck: IntArray, f: Int, d: Int, n: Int) {\\n if (d > best[n]) best[n] = d\\n for (i in n - 1 downTo 0) {\\n if (deck[i] == -1 || deck[i] == i) break\\n if (d + best[i] <= best[n]) return\\n }\\n val deck2 = deck.copyOf()\\n for (i in 1 until n) {\\n val k = 1 shl i\\n if (deck2[i] == -1) {\\n if ((f and k) != 0) continue\\n }\\n else if (deck2[i] != i) continue\\n deck2[0] = i\\n for (j in i - 1 downTo 0) deck2[i - j] = deck[j]\\n trySwaps(deck2, f or k, d + 1, n)\\n }\\n}\\n\\nfun topswops(n: Int): Int {\\n require(n > 0 && n < best.size)\\n best[n] = 0\\n val deck0 = IntArray(n + 1)\\n for (i in 1 until n) deck0[i] = -1\\n trySwaps(deck0, 1, 0, n)\\n return best[n]\\n}\\n\\nfun main(args: Array<String>) {\\n for (i in 1..10) println(\\\"${\\\"%2d\\\".format(i)} : ${topswops(i)}\\\")\\n}\\n\",\n \"language\": \"Kotlin\"\n },\n {\n \"code\": \"-- Return an iterator to produce every permutation of list\\nfunction permute (list)\\n local function perm (list, n)\\n if n == 0 then coroutine.yield(list) end\\n for i = 1, n do\\n list[i], list[n] = list[n], list[i]\\n perm(list, n - 1)\\n list[i], list[n] = list[n], list[i]\\n end\\n end\\n return coroutine.wrap(function() perm(list, #list) end)\\nend\\n\\n-- Perform one topswop round on table t\\nfunction swap (t)\\n local new, limit = {}, t[1]\\n for i = 1, #t do\\n if i <= limit then\\n new[i] = t[limit - i + 1]\\n else\\n new[i] = t[i]\\n end\\n end\\n return new\\nend\\n\\n-- Find the most swaps needed for any starting permutation of n cards\\nfunction topswops (n)\\n local numTab, highest, count = {}, 0\\n for i = 1, n do numTab[i] = i end\\n for numList in permute(numTab) do\\n count = 0\\n while numList[1] ~= 1 do\\n numList = swap(numList)\\n count = count + 1\\n end\\n if count > highest then highest = count end\\n end\\n return highest\\nend\\n\\n-- Main procedure\\nfor i = 1, 10 do print(i, topswops(i)) end\\n\",\n \"language\": \"Lua\"\n },\n {\n \"code\": \"flip[a_] := Block[{a1 = First@a}, If[a1 == Length@a, Reverse[a], Join[Reverse[a[[;; a1]]], a[[a1 + 1 ;;]]]]]\\nswaps[a_] := Length@FixedPointList[flip, a] - 2\\nPrint[#, \\\": \\\", Max[swaps /@ Permutations[Range@#]]] & /@ Range[10];\\n\",\n \"language\": \"Mathematica\"\n },\n {\n \"code\": \"import strformat\\n\\nconst maxBest = 32\\nvar best: array[maxBest, int]\\n\\nproc trySwaps(deck: seq[int], f, d, n: int) =\\n if d > best[n]:\\n best[n] = d\\n\\n for i in countdown(n - 1, 0):\\n if deck[i] == -1 or deck[i] == i:\\n break\\n if d + best[i] <= best[n]:\\n return\\n\\n var deck2 = deck\\n for i in 1..<n:\\n var k = 1 shl i\\n if deck2[i] == -1:\\n if (f and k) != 0:\\n continue\\n elif deck2[i] != i:\\n continue\\n\\n deck2[0] = i\\n for j in countdown(i - 1, 0):\\n deck2[i - j] = deck[j]\\n trySwaps(deck2, f or k, d + 1, n)\\n\\nproc topswops(n: int): int =\\n assert(n > 0 and n < maxBest)\\n best[n] = 0\\n var deck0 = newSeq[int](n + 1)\\n for i in 1..<n:\\n deck0[i] = -1\\n trySwaps(deck0, 1, 0, n)\\n best[n]\\n\\nfor i in 1..10:\\n echo &\\\"{i:2}: {topswops(i):2}\\\"\\n\",\n \"language\": \"Nim\"\n },\n {\n \"code\": \"flip(v:vec)={\\n my(t=v[1]+1);\\n if (t==2, return(0));\\n for(i=1,t\\\\2, [v[t-i],v[i]]=[v[i],v[t-i]]);\\n 1+flip(v)\\n}\\ntopswops(n)={\\n my(mx);\\n for(i=0,n!-1,\\n mx=max(flip(Vecsmall(numtoperm(n,i))),mx)\\n );\\n mx;\\n}\\nvector(10,n,topswops(n))\\n\",\n \"language\": \"PARI-GP\"\n },\n {\n \"code\": \"sub next_swop {\\n my( $max, $level, $p, $d ) = @_;\\n my $swopped = 0;\\n for( 2..@$p ){ # find possibilities\\n my @now = @$p;\\n if( $_ == $now[$_-1] ) {\\n splice @now, 0, 0, reverse splice @now, 0, $_;\\n $swopped = 1;\\n next_swop( $max, $level+1, \\\\@now, [ @$d ] );\\n }\\n }\\n for( 1..@$d ) { # create possibilities\\n my @now = @$p;\\n my $next = shift @$d;\\n if( not $now[$next-1] ) {\\n $now[$next-1] = $next;\\n splice @now, 0, 0, reverse splice @now, 0, $next;\\n $swopped = 1;\\n next_swop( $max, $level+1, \\\\@now, [ @$d ] );\\n }\\n push @$d, $next;\\n }\\n $$max = $level if !$swopped and $level > $$max;\\n}\\n\\nsub topswops {\\n my $n = shift;\\n my @d = 2..$n;\\n my @p = ( 1, (0) x ($n-1) );\\n my $max = 0;\\n next_swop( \\\\$max, 0, \\\\@p, \\\\@d );\\n return $max;\\n}\\n\\nprintf \\\"Maximum swops for %2d cards: %2d\\\\n\\\", $_, topswops $_ for 1..10;\\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;\\\">fannkuch</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;\\\">sequence</span> <span style=\\\"color: #000000;\\\">count</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>\\n <span style=\\\"color: #000000;\\\">perm1</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>\\n <span style=\\\"color: #004080;\\\">integer</span> <span style=\\\"color: #000000;\\\">maxFlipsCount</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">0</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">r</span> <span style=\\\"color: #0000FF;\\\">=</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: #004600;\\\">true</span> <span style=\\\"color: #008080;\\\">do</span>\\n <span style=\\\"color: #008080;\\\">while</span> <span style=\\\"color: #000000;\\\">r</span><span style=\\\"color: #0000FF;\\\">!=</span><span style=\\\"color: #000000;\\\">1</span> <span style=\\\"color: #008080;\\\">do</span>\\n <span style=\\\"color: #000000;\\\">count</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: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">r</span>\\n <span style=\\\"color: #000000;\\\">r</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;\\\">if</span> <span style=\\\"color: #008080;\\\">not</span> <span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">perm1</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;\\\">or</span> <span style=\\\"color: #000000;\\\">perm1</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> <span style=\\\"color: #008080;\\\">then</span>\\n <span style=\\\"color: #004080;\\\">sequence</span> <span style=\\\"color: #000000;\\\">perm</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">perm1</span>\\n <span style=\\\"color: #004080;\\\">integer</span> <span style=\\\"color: #000000;\\\">flipsCount</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">0</span><span style=\\\"color: #0000FF;\\\">,</span>\\n <span style=\\\"color: #000000;\\\">k</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">perm</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: #000000;\\\">k</span><span style=\\\"color: #0000FF;\\\">!=</span><span style=\\\"color: #000000;\\\">1</span> <span style=\\\"color: #008080;\\\">do</span>\\n <span style=\\\"color: #000000;\\\">perm</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">reverse</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">perm</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: #0000FF;\\\">&</span> <span style=\\\"color: #000000;\\\">perm</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: #000000;\\\">n</span><span style=\\\"color: #0000FF;\\\">]</span>\\n <span style=\\\"color: #000000;\\\">flipsCount</span> <span style=\\\"color: #0000FF;\\\">+=</span> <span style=\\\"color: #000000;\\\">1</span>\\n <span style=\\\"color: #000000;\\\">k</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">perm</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;\\\">while</span>\\n <span style=\\\"color: #008080;\\\">if</span> <span style=\\\"color: #000000;\\\">flipsCount</span><span style=\\\"color: #0000FF;\\\">></span><span style=\\\"color: #000000;\\\">maxFlipsCount</span> <span style=\\\"color: #008080;\\\">then</span>\\n <span style=\\\"color: #000000;\\\">maxFlipsCount</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">flipsCount</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;\\\">-- Use incremental change to generate another permutation</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;\\\">if</span> <span style=\\\"color: #000000;\\\">r</span><span style=\\\"color: #0000FF;\\\">></span><span style=\\\"color: #000000;\\\">n</span> <span style=\\\"color: #008080;\\\">then</span> <span style=\\\"color: #008080;\\\">return</span> <span style=\\\"color: #000000;\\\">maxFlipsCount</span> <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">if</span>\\n <span style=\\\"color: #004080;\\\">integer</span> <span style=\\\"color: #000000;\\\">perm0</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">perm1</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">]</span>\\n <span style=\\\"color: #000000;\\\">perm1</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">1</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: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">perm1</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">2</span><span style=\\\"color: #0000FF;\\\">..</span><span style=\\\"color: #000000;\\\">r</span><span style=\\\"color: #0000FF;\\\">]</span>\\n <span style=\\\"color: #000000;\\\">perm1</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">r</span><span style=\\\"color: #0000FF;\\\">]</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">perm0</span>\\n <span style=\\\"color: #000000;\\\">count</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">r</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;\\\">count</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: #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;\\\">r</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;\\\">while</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">function</span> <span style=\\\"color: #000080;font-style:italic;\\\">-- fannkuch</span>\\n\\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: #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: #008080;\\\">iff</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #7060A8;\\\">platform</span><span style=\\\"color: #0000FF;\\\">()=</span><span style=\\\"color: #004600;\\\">JS</span><span style=\\\"color: #0000FF;\\\">?</span><span style=\\\"color: #000000;\\\">9</span><span style=\\\"color: #0000FF;\\\">:</span><span style=\\\"color: #000000;\\\">10</span><span style=\\\"color: #0000FF;\\\">)</span> <span style=\\\"color: #008080;\\\">do</span>\\n <span style=\\\"color: #0000FF;\\\">?</span><span style=\\\"color: #000000;\\\">fannkuch</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: #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<!--\\n\",\n \"language\": \"Phix\"\n },\n {\n \"code\": \"go ?=>\\n member(N,1..10),\\n Perm = 1..N,\\n Rev = Perm.reverse(),\\n Max = 0,\\n while(Perm != Rev)\\n next_permutation(Perm),\\n C = topswops(Perm),\\n if C > Max then\\n Max := C\\n end\\n end,\\n printf(\\\"%2d: %2d\\\\n\\\",N,Max),\\n fail,\\n nl.\\ngo => true.\\n\\ntopswops([]) = 0 => true.\\ntopswops([1]) = 0 => true.\\ntopswops([1|_]) = 0 => true.\\ntopswops(P) = Count =>\\n Len = P.length,\\n Count = 0,\\n while (P[1] > 1)\\n Pos = P[1],\\n P := [P[I] : I in 1..Pos].reverse() ++ [P[I] : I in Pos+1..Len],\\n Count := Count + 1\\n end.\\n\\n% Inline\\nnext_permutation(Perm) =>\\n N = Perm.length,\\n K = N - 1,\\n while (Perm[K] > Perm[K+1], K >= 0)\\n K := K - 1\\n end,\\n if K > 0 then\\n J = N,\\n while (Perm[K] > Perm[J]) J := J - 1 end,\\n Tmp := Perm[K],\\n Perm[K] := Perm[J],\\n Perm[J] := Tmp,\\n R = N,\\n S = K + 1,\\n while (R > S)\\n Tmp := Perm[R],\\n Perm[R] := Perm[S],\\n Perm[S] := Tmp,\\n R := R - 1,\\n S := S + 1\\n end\\n end.\\n\",\n \"language\": \"Picat\"\n },\n {\n \"code\": \"(de fannkuch (N)\\n (let (Lst (range 1 N) L Lst Max)\\n (recur (L) # Permute\\n (if (cdr L)\\n (do (length L)\\n (recurse (cdr L))\\n (rot L) )\\n (zero N) # For each permutation\\n (for (P (copy Lst) (> (car P) 1) (flip P (car P)))\\n (inc 'N) )\\n (setq Max (max N Max)) ) )\\n Max ) )\\n\\n(for I 10\\n (println I (fannkuch I)) )\\n\",\n \"language\": \"PicoLisp\"\n },\n {\n \"code\": \"(subscriptrange):\\ntopswap: procedure options (main); /* 12 November 2013 */\\n declare cards(*) fixed (2) controlled, t fixed (2);\\n declare dealt(*) bit(1) controlled;\\n declare (count, i, m, n, c1, c2) fixed binary;\\n declare random builtin;\\n\\n do n = 1 to 10;\\n allocate cards(n), dealt(n);\\n /* Take the n cards, in order ... */\\n do i = 1 to n; cards(i) = i; end;\\n /* ... and shuffle them. */\\n do i = 1 to n;\\n c1 = random*n+1; c2 = random*n+1;\\n t = cards(c1); cards(c1) = cards(c2); cards(c2) = t;\\n end;\\n /* If '1' is the first card, game is trivial; swap it with another. */\\n if cards(1) = 1 & n > 1 then\\n do; t = cards(1); cards(1) = cards(2); cards(2) = t; end;\\n\\n count = 0;\\n do until (cards(1) = 1);\\n /* take the value of the first card, M, and reverse the first M cards. */\\n m = cards(1);\\n do i = 1 to m/2;\\n t = cards(i); cards(i) = cards(m-i+1); cards(m-i+1) = t;\\n end;\\n count = count + 1;\\n end;\\n put skip edit (n, ':', count) (f(2), a, f(4));\\n end;\\nend topswap;\\n\",\n \"language\": \"PL-I\"\n },\n {\n \"code\": \"range = (a, b):\\n i = 0, l = list(b-a+1)\\n while (a + i <= b):\\n l (i) = a + i++.\\n l.\\n\\nfannkuch = (n):\\n flips = 0, maxf = 0, k = 0, m = n - 1, r = n\\n perml = range(0, n), count = list(n), perm = list(n)\\n\\n loop:\\n while (r != 1):\\n count (r-1) = r\\n r--.\\n\\n if (perml (0) != 0 and perml (m) != m):\\n flips = 0, i = 1\\n while (i < n):\\n perm (i) = perml (i)\\n i++.\\n k = perml (0)\\n loop:\\n i = 1, j = k - 1\\n while (i < j):\\n t = perm (i), perm (i) = perm (j), perm (j) = t\\n i++, j--.\\n flips++\\n j = perm (k), perm (k) = k, k = j\\n if (k == 0): break.\\n .\\n if (flips > maxf): maxf = flips.\\n .\\n\\n loop:\\n if (r == n):\\n (n, maxf) say\\n return (maxf).\\n\\n i = 0, j = perml (0)\\n while (i < r):\\n k = i + 1\\n perml (i) = perml (k)\\n i = k.\\n perml (r) = j\\n\\n j = count (r) - 1\\n count (r) = j\\n if (j > 0): break.\\n r++\\n_ n\\n\\nn = argv(1) number\\nif (n<1): n=10.\\nfannkuch(n)\\n\",\n \"language\": \"Potion\"\n },\n {\n \"code\": \">>> from itertools import permutations\\n>>> def f1(p):\\n\\ti = 0\\n\\twhile True:\\n\\t\\tp0 = p[0]\\n\\t\\tif p0 == 1: break\\n\\t\\tp[:p0] = p[:p0][::-1]\\n\\t\\ti += 1\\n\\treturn i\\n\\n>>> def fannkuch(n):\\n\\treturn max(f1(list(p)) for p in permutations(range(1, n+1)))\\n\\n>>> for n in range(1, 11): print(n,fannkuch(n))\\n\\n1 0\\n2 1\\n3 2\\n4 4\\n5 7\\n6 10\\n7 16\\n8 22\\n9 30\\n10 38\\n>>>\\n\",\n \"language\": \"Python\"\n },\n {\n \"code\": \"try:\\n import psyco\\n psyco.full()\\nexcept ImportError:\\n pass\\n\\nbest = [0] * 16\\n\\ndef try_swaps(deck, f, s, d, n):\\n if d > best[n]:\\n best[n] = d\\n\\n i = 0\\n k = 1 << s\\n while s:\\n k >>= 1\\n s -= 1\\n if deck[s] == -1 or deck[s] == s:\\n break\\n i |= k\\n if (i & f) == i and d + best[s] <= best[n]:\\n return d\\n s += 1\\n\\n deck2 = list(deck)\\n k = 1\\n for i2 in xrange(1, s):\\n k <<= 1\\n if deck2[i2] == -1:\\n if f & k: continue\\n elif deck2[i2] != i2:\\n continue\\n\\n deck[i2] = i2\\n deck2[:i2 + 1] = reversed(deck[:i2 + 1])\\n try_swaps(deck2, f | k, s, 1 + d, n)\\n\\ndef topswops(n):\\n best[n] = 0\\n deck0 = [-1] * 16\\n deck0[0] = 0\\n try_swaps(deck0, 1, n, 0, n)\\n return best[n]\\n\\nfor i in xrange(1, 13):\\n print \\\"%2d: %d\\\" % (i, topswops(i))\\n\",\n \"language\": \"Python\"\n },\n {\n \"code\": \"topswops <- function(x){\\n i <- 0\\n while(x[1] != 1){\\n first <- x[1]\\n if(first == length(x)){\\n x <- rev(x)\\n } else{\\n x <- c(x[first:1], x[(first+1):length(x)])\\n }\\n i <- i + 1\\n }\\n return(i)\\n}\\n\\nlibrary(iterpc)\\n\\nresult <- NULL\\n\\nfor(i in 1:10){\\n I <- iterpc(i, labels = 1:i, ordered = T)\\n A <- getall(I)\\n A <- data.frame(A)\\n A$flips <- apply(A, 1, topswops)\\n result <- rbind(result, c(i, max(A$flips)))\\n}\\n\",\n \"language\": \"R\"\n },\n {\n \"code\": \"#lang racket\\n\\n(define (all-misplaced? l)\\n (for/and ([x (in-list l)] [n (in-naturals 1)]) (not (= x n))))\\n\\n(define (topswops n)\\n (for/fold ([m 0]) ([p (in-permutations (range 1 (add1 n)))]\\n #:when (all-misplaced? p))\\n (let loop ([p p] [n 0])\\n (if (= 1 (car p))\\n (max n m)\\n (loop (let loop ([l '()] [r p] [n (car p)])\\n (if (zero? n) (append l r)\\n (loop (cons (car r) l) (cdr r) (sub1 n))))\\n (add1 n))))))\\n\\n(for ([i (in-range 1 11)]) (printf \\\"~a\\\\t~a\\\\n\\\" i (topswops i)))\\n\",\n \"language\": \"Racket\"\n },\n {\n \"code\": \"sub swops(@a is copy) {\\n my int $count = 0;\\n until @a[0] == 1 {\\n @a[ ^@a[0] ] .= reverse;\\n ++$count;\\n }\\n $count\\n}\\n\\nsub topswops($n) { max (1..$n).permutations.race.map: &swops }\\n\\nsay \\\"$_ {topswops $_}\\\" for 1 .. 10;\\n\",\n \"language\": \"Raku\"\n },\n {\n \"code\": \"sub swops($a is copy) {\\n my int $count = 0;\\n while (my \\\\l = $a.ord) > 1 {\\n $a = $a.substr(0, l).flip ~ $a.substr(l);\\n ++$count;\\n }\\n $count\\n}\\n\\nsub topswops($n) { max (1..$n).permutations.map: { .chrs.join.&swops } }\\n\\nsay \\\"$_ {topswops $_}\\\" for 1 .. 10;\\n\",\n \"language\": \"Raku\"\n },\n {\n \"code\": \"/*REXX program generates N decks of numbered cards and finds the maximum \\\"swops\\\". */\\nparse arg things .; if things=='' then things= 10\\n\\n do n=1 for things; #= decks(n, n) /*create a (things) number of \\\"decks\\\". */\\n mx= n\\\\==1 /*handle the case of a one-card deck.*/\\n do i=1 for #; p= swops(!.i) /*compute the SWOPS for this iteration.*/\\n if p>mx then mx= p /*This a new maximum? Use a new max. */\\n end /*i*/\\n say '──────── maximum swops for a deck of' right(n,2) ' cards is' right(mx,4)\\n end /*n*/\\nexit 0 /*stick a fork in it, we're all done. */\\n/*──────────────────────────────────────────────────────────────────────────────────────*/\\ndecks: procedure expose !.; parse arg x,y,,$ @. /* X things taken Y at a time. */\\n #= 0; call .decks 1 /* [↑] initialize $ & @. to null.*/\\n return # /*return number of permutations (decks)*/\\n/*──────────────────────────────────────────────────────────────────────────────────────*/\\n.decks: procedure expose !. @. x y $ #; parse arg ?\\n if ?>y then do; _=@.1; do j=2 for y-1; _= _ @.j; end /*j*/; #= #+1; !.#=_\\n end\\n else do; qm= ? - 1\\n if ?==1 then qs= 2 /*don't use 1-swops that start with 1 */\\n else if @.1==? then qs=2 /*skip the 1-swops: 3 x 1 x ···*/\\n else qs=1\\n do q=qs to x /*build the permutations recursively. */\\n do k=1 for qm; if @.k==q then iterate q\\n end /*k*/\\n @.?=q ; call .decks ? + 1\\n end /*q*/\\n end\\n return\\n/*──────────────────────────────────────────────────────────────────────────────────────*/\\nswops: parse arg z; do u=1; parse var z t .; if \\\\datatype(t, 'W') then t= x2d(t)\\n if word(z, t)==1 then return u /*found unity at T. */\\n do h=10 to things; if pos(h, z)==0 then iterate\\n z= changestr(h, z, d2x(h) ) /* [↑] any H's in Z?*/\\n end /*h*/\\n z= reverse( subword(z, 1, t) ) subword(z, t + 1)\\n end /*u*/\\n\",\n \"language\": \"REXX\"\n },\n {\n \"code\": \"def f1(a)\\n i = 0\\n while (a0 = a[0]) > 1\\n a[0...a0] = a[0...a0].reverse\\n i += 1\\n end\\n i\\nend\\n\\ndef fannkuch(n)\\n [*1..n].permutation.map{|a| f1(a)}.max\\nend\\n\\nfor n in 1..10\\n puts \\\"%2d : %d\\\" % [n, fannkuch(n)]\\nend\\n\",\n \"language\": \"Ruby\"\n },\n {\n \"code\": \"def try_swaps(deck, f, d, n)\\n @best[n] = d if d > @best[n]\\n (n-1).downto(0) do |i|\\n break if deck[i] == -1 || deck[i] == i\\n return if d + @best[i] <= @best[n]\\n end\\n deck2 = deck.dup\\n for i in 1...n\\n k = 1 << i\\n if deck2[i] == -1\\n next if f & k != 0\\n elsif deck2[i] != i\\n next\\n end\\n deck2[0] = i\\n deck2[1..i] = deck[0...i].reverse\\n try_swaps(deck2, f | k, d+1, n)\\n end\\nend\\n\\ndef topswops(n)\\n @best[n] = 0\\n deck0 = [-1] * (n + 1)\\n try_swaps(deck0, 1, 0, n)\\n @best[n]\\nend\\n\\n@best = [0] * 16\\nfor i in 1..10\\n puts \\\"%2d : %d\\\" % [i, topswops(i)]\\nend\\n\",\n \"language\": \"Ruby\"\n },\n {\n \"code\": \"use itertools::Itertools;\\n\\nfn solve(deck: &[usize]) -> usize {\\n let mut counter = 0_usize;\\n let mut shuffle = deck.to_vec();\\n loop {\\n let p0 = shuffle[0];\\n if p0 == 1 {\\n break;\\n }\\n shuffle[..p0].reverse();\\n counter += 1;\\n }\\n\\n counter\\n}\\n\\n// this is a naive method which tries all permutations and works up to ~12 cards\\nfn topswops(number: usize) -> usize {\\n (1..=number)\\n .permutations(number)\\n .fold(0_usize, |mut acc, p| {\\n let steps = solve(&p);\\n if steps > acc {\\n acc = steps;\\n }\\n acc\\n })\\n}\\nfn main() {\\n (1_usize..=10).for_each(|x| println!(\\\"{}: {}\\\", x, topswops(x)));\\n}\\n\",\n \"language\": \"Rust\"\n },\n {\n \"code\": \"object Fannkuch extends App {\\n\\n def fannkuchen(l: List[Int], n: Int, i: Int, acc: Int): Int = {\\n def flips(l: List[Int]): Int = (l: @unchecked) match {\\n case 1 :: ls => 0\\n case (n :: ls) =>\\n val splitted = l.splitAt(n)\\n flips(splitted._2.reverse_:::(splitted._1)) + 1\\n }\\n\\n def rotateLeft(l: List[Int]) =\\n l match {\\n case Nil => List()\\n case x :: xs => xs ::: List(x)\\n }\\n\\n if (i >= n) acc\\n else {\\n if (n == 1) acc.max(flips(l))\\n else {\\n val split = l.splitAt(n)\\n fannkuchen(rotateLeft(split._1) ::: split._2, n, i + 1, fannkuchen(l, n - 1, 0, acc))\\n }\\n }\\n } // def fannkuchen(\\n\\n val result = (1 to 10).map(i => (i, fannkuchen(List.range(1, i + 1), i, 0, 0)))\\n println(\\\"Computing results...\\\")\\n result.foreach(x => println(s\\\"Pfannkuchen(${x._1})\\\\t= ${x._2}\\\"))\\n assert(result == Vector((1, 0), (2, 1), (3, 2), (4, 4), (5, 7), (6, 10), (7, 16), (8, 22), (9, 30), (10, 38)), \\\"Bad results\\\")\\n println(s\\\"Successfully completed without errors. [total ${scala.compat.Platform.currentTime - executionStart} ms]\\\")\\n}\\n\",\n \"language\": \"Scala\"\n },\n {\n \"code\": \"package require struct::list\\n\\nproc swap {listVar} {\\n upvar 1 $listVar list\\n set n [lindex $list 0]\\n for {set i 0; set j [expr {$n-1}]} {$i<$j} {incr i;incr j -1} {\\n\\tset tmp [lindex $list $i]\\n\\tlset list $i [lindex $list $j]\\n\\tlset list $j $tmp\\n }\\n}\\n\\nproc swaps {list} {\\n for {set i 0} {[lindex $list 0] > 1} {incr i} {\\n\\tswap list\\n }\\n return $i\\n}\\n\\nproc topswops list {\\n set n 0\\n ::struct::list foreachperm p $list {\\n\\tset n [expr {max($n,[swaps $p])}]\\n }\\n return $n\\n}\\n\\nproc topswopsTo n {\\n puts \\\"n\\\\ttopswops(n)\\\"\\n for {set i 1} {$i <= $n} {incr i} {\\n\\tputs $i\\\\t[topswops [lappend list $i]]\\n }\\n}\\ntopswopsTo 10\\n\",\n \"language\": \"Tcl\"\n },\n {\n \"code\": \"import \\\"./fmt\\\" for Fmt\\n\\nvar maxn = 10\\nvar maxl = 50\\n\\nvar steps = Fn.new { |n|\\n var a = List.filled(maxl, null)\\n var b = List.filled(maxl, null)\\n var x = List.filled(maxl, 0)\\n for (i in 0...maxl) {\\n a[i] = List.filled(maxn + 1, 0)\\n b[i] = List.filled(maxn + 1, 0)\\n }\\n a[0][0] = 1\\n var m = 0\\n var l = 0\\n while (true) {\\n x[l] = x[l] + 1\\n var k = x[l]\\n var cont = false\\n if (k >= n) {\\n if (l <= 0) break\\n l = l - 1\\n cont = true\\n } else if (a[l][k] == 0) {\\n if (b[l][k+1] != 0) cont = true\\n } else if (a[l][k] != k + 1) {\\n cont = true\\n }\\n if (!cont) {\\n a[l+1] = a[l].toList\\n var j = 1\\n while (j <= k) {\\n a[l+1][j] = a[l][k-j]\\n j = j + 1\\n }\\n b[l+1] = b[l].toList\\n a[l+1][0] = k + 1\\n b[l+1][k+1] = 1\\n if (l > m - 1) {\\n m = l + 1\\n }\\n l = l + 1\\n x[l] = 0\\n }\\n }\\n return m\\n}\\n\\nfor (i in 1..maxn) Fmt.print(\\\"$2d: $d\\\", i, steps.call(i))\\n\",\n \"language\": \"Wren\"\n },\n {\n \"code\": \"code ChOut=8, CrLf=9, IntOut=11;\\nint N, Max, Card1(16), Card2(16);\\n\\nproc Topswop(D); \\\\Conway's card swopping game\\nint D; \\\\depth of recursion\\nint I, J, C, T;\\n[if D # N then \\\\generate N! permutations of 1..N in Card1\\n [for I:= 0 to N-1 do\\n [for J:= 0 to D-1 do \\\\check if object (letter) already used\\n if Card1(J) = I+1 then J:=100;\\n if J < 100 then\\n [Card1(D):= I+1; \\\\card number not used so append it\\n Topswop(D+1); \\\\recurse next level deeper\\n ];\\n ];\\n ]\\nelse [\\\\determine number of topswops to get card 1 at beginning\\n for I:= 0 to N-1 do Card2(I):= Card1(I); \\\\make working copy of deck\\n C:= 0; \\\\initialize swop counter\\n while Card2(0) # 1 do\\n [I:= 0; J:= Card2(0)-1;\\n while I < J do\\n [T:= Card2(I); Card2(I):= Card2(J); Card2(J):= T;\\n I:= I+1; J:= J-1;\\n ];\\n C:= C+1;\\n ];\\n if C>Max then Max:= C;\\n ];\\n];\\n\\n[for N:= 1 to 10 do\\n [Max:= 0;\\n Topswop(0);\\n IntOut(0, N); ChOut(0, ^ ); IntOut(0, Max); CrLf(0);\\n ];\\n]\\n\",\n \"language\": \"XPL0\"\n },\n {\n \"code\": \"code CrLf=9, IntOut=11, Text=12;\\nint N, D, Best(16);\\n\\nproc TrySwaps(A, F, S);\\nint A, F, S;\\nint B(16), I, J, K;\\n[if D > Best(N) then Best(N):= D;\\nloop [if A(S)=-1 ! A(S)=S then quit;\\n if D+Best(S) <= Best(N) then return;\\n if S = 0 then quit;\\n S:= S-1;\\n ];\\nD:= D+1;\\nfor I:= 0 to S do B(I):= A(I);\\nK:= 1;\\nfor I:= 1 to S do\\n [K:= K<<1;\\n if B(I)=-1 & (F&K)=0 ! B(I)=I then\\n [J:= I; B(0):= J;\\n while J do [J:= J-1; B(I-J):= A(J)];\\n TrySwaps(B, F!K, S);\\n ];\\n ];\\nD:= D-1;\\n];\\n\\nint I, X(16);\\n[for I:= 0 to 16-1 do\\n [X(I):= -1; Best(I):= 0];\\nX(0):= 0;\\nfor N:= 1 to 13 do\\n [D:= 0;\\n TrySwaps(X, 1, N-1);\\n IntOut(0, N); Text(0, \\\": \\\"); IntOut(0, Best(N)); CrLf(0);\\n ];\\n]\\n\",\n \"language\": \"XPL0\"\n },\n {\n \"code\": \"fcn topswops(n){\\n flip:=fcn(xa){\\n if (not xa[0]) return(0);\\n xa.reverse(0,xa[0]+1); // inplace, ~4x faster than making new lists\\n return(1 + self.fcn(xa));\\n };\\n (0).pump(n,List):Utils.Helpers.permute(_).pump(List,\\\"copy\\\",flip).reduce(\\\"max\\\");\\n}\\n\\nforeach n in ([1 .. 10]){ println(n, \\\": \\\", topswops(n)) }\\n\",\n \"language\": \"Zkl\"\n }\n]","isConversational":false},"task_name":{"kind":"string","value":"Topswops"}}},{"rowIdx":1766,"cells":{"solutions":{"kind":"list like","value":[{"code":"---\nfrom: http://rosettacode.org/wiki/Totient_function\nnote: Prime Numbers\n","language":"00-META"},{"code":"The '''totient''' function is also known as:\n::* Euler's totient function\n::* Euler's phi totient function\n::* phi totient function\n::* <big> Φ </big> function (uppercase Greek phi)\n::* <big> φ </big> function (lowercase Greek phi)\n\n\n\n;Definitions (as per number theory):\nThe totient function:\n::* counts the integers up to a given positive integer <big>'''n'''</big> that are relatively prime to <big>'''n'''</big>\n::* counts the integers <big>'''k'''</big> in the range <big>'''1 ≤ k ≤ n'''</big> for which the greatest common divisor <big>'''gcd(n,k)'''</big> is equal to <big>'''1'''</big>\n::* counts numbers <big>'''≤ n'''</big> and prime to <big>'''n'''</big>\n\n\n\nIf the totient number (for '''N''') is one less than '''N''', then '''N''' is prime.\n\n\n\n;Task:\nCreate a '''totient''' function and: \n::* Find and display (1 per line) for the 1<sup>st</sup> '''25''' integers:\n::::* the integer (the index)\n::::* the totient number for that integer\n::::* indicate if that integer is prime\n::* Find and display the ''count'' of the primes up to 100\n::* Find and display the ''count'' of the primes up to 1,000\n::* Find and display the ''count'' of the primes up to 10,000\n::* Find and display the ''count'' of the primes up to 100,000 (optional)\n\nShow all output here.\n\n\n;Related task:\n::* [[Perfect totient numbers]]\n\n\n;Also see:\n::* [[wp:Euler's_totient_function|Wikipedia: Euler's totient function]].\n::* [http://mathworld.wolfram.com/TotientFunction.html MathWorld: totient function].\n::* [[oeis:/A000010|OEIS: Euler totient function phi(n)]].\n<br/>\n\n","language":"00-TASK"},{"code":"F f(n)\n R sum((1..n).filter(k -> gcd(@n, k) == 1).map(k -> 1))\n\nF is_prime(n)\n R f(n) == n - 1\n\nL(n) 1..25\n print(‘ f(#.) == #.’.format(n, f(n))‘’(I is_prime(n) {‘, is prime’} E ‘’))\nV count = 0\nL(n) 1..10'000\n count += is_prime(n)\n I n C (100, 1000, 10'000)\n print(‘Primes up to #.: #.’.format(n, count))\n","language":"11l"},{"code":"/* ARM assembly AARCH64 Raspberry PI 3B */\n/* program totient.s */\n\n/************************************/\n/* Constantes */\n/************************************/\n.include \"../includeConstantesARM64.inc\"\n.equ MAXI, 25\n\n/*********************************/\n/* Initialized data */\n/*********************************/\n.data\nszMessNumber: .asciz \" number @ totient @ @ \\n\"\nszCarriageReturn: .asciz \"\\n\"\nszMessPrime: .asciz \" is prime.\"\nszMessSpace: .asciz \" \"\nszMessCounterPrime: .asciz \"Number of primes to @ : @ \\n\"\nszMessOverflow: .asciz \"Overflow function isPrime.\\n\"\n/*********************************/\n/* UnInitialized data */\n/*********************************/\n.bss\nsZoneConv: .skip 24\n/*********************************/\n/* code section */\n/*********************************/\n.text\n.global main\nmain:\n mov x4,#1 // start number\n1:\n mov x0,x4\n bl totient // compute totient\n mov x5,x0\n mov x0,x4\n bl isPrime // control if number is prime\n mov x6,x0\n mov x0,x4 // display result\n ldr x1,qAdrsZoneConv\n bl conversion10 // call décimal conversion\n ldr x0,qAdrszMessNumber\n ldr x1,qAdrsZoneConv // insert conversion in message\n bl strInsertAtCharInc\n mov x7,x0\n mov x0,x5\n ldr x1,qAdrsZoneConv\n bl conversion10 // call décimal conversion\n mov x0,x7\n ldr x1,qAdrsZoneConv // insert conversion in message\n bl strInsertAtCharInc\n mov x7,x0\n cmp x6,#1\n ldr x1,qAdrszMessPrime\n ldr x8,qAdrszMessSpace\n csel x1,x1,x8,eq\n mov x0,x7\n bl strInsertAtCharInc\n bl affichageMess // display message\n\n add x4,x4,#1 // increment number\n cmp x4,#MAXI // maxi ?\n ble 1b // and loop\n\n mov x4,#2 // first number\n mov x5,#0 // prime counter\n ldr x6,iCst1000 // load constantes\n ldr x7,iCst10000\n ldr x8,iCst100000\n2:\n mov x0,x4\n bl isPrime\n cmp x0,#0\n beq 3f\n add x5,x5,#1\n3:\n add x4,x4,#1\n cmp x4,#100\n bne 4f\n mov x0,#100\n mov x1,x5\n bl displayCounter\n b 7f\n4:\n cmp x4,x6 // 1000\n bne 5f\n mov x0,x6\n mov x1,x5\n bl displayCounter\n b 7f\n5:\n cmp x4,x7 // 10000\n bne 6f\n mov x0,x7\n mov x1,x5\n bl displayCounter\n b 7f\n6:\n cmp x4,x8 // 100000\n bne 7f\n mov x0,x8\n mov x1,x5\n bl displayCounter\n7:\n cmp x4,x8\n ble 2b // and loop\n\n100: // standard end of the program\n mov x0, #0 // return code\n mov x8,EXIT\n svc #0 // perform the system call\nqAdrszCarriageReturn: .quad szCarriageReturn\nqAdrsZoneConv: .quad sZoneConv\nqAdrszMessNumber: .quad szMessNumber\nqAdrszMessCounterPrime: .quad szMessCounterPrime\nqAdrszMessPrime: .quad szMessPrime\nqAdrszMessSpace: .quad szMessSpace\niCst1000: .quad 1000\niCst10000: .quad 10000\niCst100000: .quad 100000\n/******************************************************************/\n/* display counter */\n/******************************************************************/\n/* x0 contains limit */\n/* x1 contains counter */\ndisplayCounter:\n stp x1,lr,[sp,-16]! // save registers\n stp x2,x3,[sp,-16]! // save registers\n mov x2,x1\n ldr x1,qAdrsZoneConv\n bl conversion10 // call décimal conversion\n ldr x0,qAdrszMessCounterPrime\n ldr x1,qAdrsZoneConv // insert conversion in message\n bl strInsertAtCharInc\n mov x3,x0\n mov x0,x2\n ldr x1,qAdrsZoneConv\n bl conversion10 // call décimal conversion\n mov x0,x3\n ldr x1,qAdrsZoneConv // insert conversion in message\n bl strInsertAtCharInc\n bl affichageMess\n100:\n ldp x2,x3,[sp],16 // restaur registers\n ldp x1,lr,[sp],16 // restaur registers\n ret\n/******************************************************************/\n/* compute totient of number */\n/******************************************************************/\n/* x0 contains number */\ntotient:\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 mov x4,x0 // totient\n mov x5,x0 // save number\n mov x1,#0 // for first divisor\n1: // begin loop\n mul x3,x1,x1 // compute square\n cmp x3,x5 // compare number\n bgt 4f // end\n add x1,x1,#2 // next divisor\n udiv x2,x5,x1\n msub x3,x1,x2,x5 // compute remainder\n cmp x3,#0 // remainder null ?\n bne 3f\n2: // begin loop 2\n udiv x2,x5,x1\n msub x3,x1,x2,x5 // compute remainder\n cmp x3,#0\n csel x5,x2,x5,eq // new value = quotient\n beq 2b\n\n udiv x2,x4,x1 // divide totient\n sub x4,x4,x2 // compute new totient\n3:\n cmp x1,#2 // first divisor ?\n mov x0,1\n csel x1,x0,x1,eq // divisor = 1\n b 1b // and loop\n4:\n cmp x5,#1 // final value > 1\n ble 5f\n mov x0,x4 // totient\n mov x1,x5 // divide by value\n udiv x2,x4,x5 // totient divide by value\n sub x4,x4,x2 // compute new totient\n5:\n\n mov x0,x4\n100:\n ldp x4,x5,[sp],16 // restaur registers\n ldp x2,x3,[sp],16 // restaur registers\n ldp x1,lr,[sp],16 // restaur registers\n ret\n/***************************************************/\n/* Verification si un nombre est premier */\n/***************************************************/\n/* x0 contient le nombre à verifier */\n/* x0 retourne 1 si premier 0 sinon */\nisPrime:\n stp x1,lr,[sp,-16]! // save registres\n stp x2,x3,[sp,-16]! // save registres\n mov x2,x0\n sub x1,x0,#1\n cmp x2,0\n beq 99f // retourne zéro\n cmp x2,2 // pour 1 et 2 retourne 1\n ble 2f\n mov x0,#2\n bl moduloPur64\n bcs 100f // erreur overflow\n cmp x0,#1\n bne 99f // Pas premier\n cmp x2,3\n beq 2f\n mov x0,#3\n bl moduloPur64\n blt 100f // erreur overflow\n cmp x0,#1\n bne 99f\n\n cmp x2,5\n beq 2f\n mov x0,#5\n bl moduloPur64\n bcs 100f // erreur overflow\n cmp x0,#1\n bne 99f // Pas premier\n\n cmp x2,7\n beq 2f\n mov x0,#7\n bl moduloPur64\n bcs 100f // erreur overflow\n cmp x0,#1\n bne 99f // Pas premier\n\n cmp x2,11\n beq 2f\n mov x0,#11\n bl moduloPur64\n bcs 100f // erreur overflow\n cmp x0,#1\n bne 99f // Pas premier\n\n cmp x2,13\n beq 2f\n mov x0,#13\n bl moduloPur64\n bcs 100f // erreur overflow\n cmp x0,#1\n bne 99f // Pas premier\n\n cmp x2,17\n beq 2f\n mov x0,#17\n bl moduloPur64\n bcs 100f // erreur overflow\n cmp x0,#1\n bne 99f // Pas premier\n2:\n cmn x0,0 // carry à zero pas d'erreur\n mov x0,1 // premier\n b 100f\n99:\n cmn x0,0 // carry à zero pas d'erreur\n mov x0,#0 // Pas premier\n100:\n ldp x2,x3,[sp],16 // restaur des 2 registres\n ldp x1,lr,[sp],16 // restaur des 2 registres\n ret // retour adresse lr x30\n\n/**************************************************************/\n/********************************************************/\n/* Calcul modulo de b puissance e modulo m */\n/* Exemple 4 puissance 13 modulo 497 = 445 */\n/********************************************************/\n/* x0 nombre */\n/* x1 exposant */\n/* x2 modulo */\nmoduloPur64:\n stp x1,lr,[sp,-16]! // save registres\n stp x3,x4,[sp,-16]! // save registres\n stp x5,x6,[sp,-16]! // save registres\n stp x7,x8,[sp,-16]! // save registres\n stp x9,x10,[sp,-16]! // save registres\n cbz x0,100f\n cbz x1,100f\n mov x8,x0\n mov x7,x1\n mov x6,1 // resultat\n udiv x4,x8,x2\n msub x9,x4,x2,x8 // contient le reste\n1:\n tst x7,1\n beq 2f\n mul x4,x9,x6\n umulh x5,x9,x6\n //cbnz x5,99f\n mov x6,x4\n mov x0,x6\n mov x1,x5\n bl divisionReg128U\n cbnz x1,99f // overflow\n mov x6,x3\n2:\n mul x8,x9,x9\n umulh x5,x9,x9\n mov x0,x8\n mov x1,x5\n bl divisionReg128U\n cbnz x1,99f // overflow\n mov x9,x3\n lsr x7,x7,1\n cbnz x7,1b\n mov x0,x6 // result\n cmn x0,0 // carry à zero pas d'erreur\n b 100f\n99:\n ldr x0,qAdrszMessOverflow\n bl affichageMess\n cmp x0,0 // carry à un car erreur\n mov x0,-1 // code erreur\n\n100:\n ldp x9,x10,[sp],16 // restaur des 2 registres\n ldp x7,x8,[sp],16 // restaur des 2 registres\n ldp x5,x6,[sp],16 // restaur des 2 registres\n ldp x3,x4,[sp],16 // restaur des 2 registres\n ldp x1,lr,[sp],16 // restaur des 2 registres\n ret // retour adresse lr x30\nqAdrszMessOverflow: .quad szMessOverflow\n/***************************************************/\n/* division d un nombre de 128 bits par un nombre de 64 bits */\n/***************************************************/\n/* x0 contient partie basse dividende */\n/* x1 contient partie haute dividente */\n/* x2 contient le diviseur */\n/* x0 retourne partie basse quotient */\n/* x1 retourne partie haute quotient */\n/* x3 retourne le reste */\ndivisionReg128U:\n stp x6,lr,[sp,-16]! // save registres\n stp x4,x5,[sp,-16]! // save registres\n mov x5,#0 // raz du reste R\n mov x3,#128 // compteur de boucle\n mov x4,#0 // dernier bit\n1:\n lsl x5,x5,#1 // on decale le reste de 1\n tst x1,1<<63 // test du bit le plus à gauche\n lsl x1,x1,#1 // on decale la partie haute du quotient de 1\n beq 2f\n orr x5,x5,#1 // et on le pousse dans le reste R\n2:\n tst x0,1<<63\n lsl x0,x0,#1 // puis on decale la partie basse\n beq 3f\n orr x1,x1,#1 // et on pousse le bit de gauche dans la partie haute\n3:\n orr x0,x0,x4 // position du dernier bit du quotient\n mov x4,#0 // raz du bit\n cmp x5,x2\n blt 4f\n sub x5,x5,x2 // on enleve le diviseur du reste\n mov x4,#1 // dernier bit à 1\n4:\n // et boucle\n subs x3,x3,#1\n bgt 1b\n lsl x1,x1,#1 // on decale le quotient de 1\n tst x0,1<<63\n lsl x0,x0,#1 // puis on decale la partie basse\n beq 5f\n orr x1,x1,#1\n5:\n orr x0,x0,x4 // position du dernier bit du quotient\n mov x3,x5\n100:\n ldp x4,x5,[sp],16 // restaur des 2 registres\n ldp x6,lr,[sp],16 // restaur des 2 registres\n ret // retour adresse lr x30\n\n\n/***************************************************/\n/* ROUTINES INCLUDE */\n/***************************************************/\n.include \"../includeARM64.inc\"\n","language":"AArch64-Assembly"},{"code":"with Ada.Text_IO;\nwith Ada.Integer_Text_IO;\n\nprocedure Totient is\n\n function Totient (N : in Integer) return Integer is\n Tot : Integer := N;\n I : Integer;\n N2 : Integer := N;\n begin\n I := 2;\n while I * I <= N2 loop\n if N2 mod I = 0 then\n while N2 mod I = 0 loop\n N2 := N2 / I;\n end loop;\n Tot := Tot - Tot / I;\n end if;\n\n if I = 2 then\n I := 1;\n end if;\n I := I + 2;\n end loop;\n\n if N2 > 1 then\n Tot := Tot - Tot / N2;\n end if;\n\n return Tot;\n end Totient;\n\n Count : Integer := 0;\n Tot : Integer;\n Placeholder : String := \" n Phi Is_Prime\";\n Image_N : String renames Placeholder ( 1 .. 3);\n Image_Phi : String renames Placeholder ( 6 .. 8);\n Image_Prime : String renames Placeholder (11 .. 17);\n use Ada.Text_IO;\n use Ada.Integer_Text_IO;\nbegin\n\n Put_Line (Placeholder);\n\n for N in 1 .. 25 loop\n Tot := Totient (N);\n\n if N - 1 = Tot then\n Count := Count + 1;\n end if;\n Put (Image_N, N);\n Put (Image_Phi, Tot);\n Image_Prime := (if N - 1 = Tot then \" True\" else \" False\");\n Put_Line (Placeholder);\n end loop;\n New_Line;\n\n Put_Line (\"Number of primes up to \" & Integer'(25)'Image &\" =\" & Count'Image);\n\n for N in 26 .. 100_000 loop\n Tot := Totient (N);\n\n if Tot = N - 1 then\n Count := Count + 1;\n end if;\n\n if N = 100 or N = 1_000 or N mod 10_000 = 0 then\n Put_Line (\"Number of primes up to \" & N'Image & \" =\" & Count'Image);\n end if;\n end loop;\n\nend Totient;\n","language":"Ada"},{"code":"BEGIN\n # returns the number of integers k where 1 <= k <= n that are mutually prime to n #\n PROC totient = ( INT n )INT:\n IF n < 3 THEN 1\n ELIF n = 3 THEN 2\n ELSE\n INT result := n;\n INT v := n;\n INT i := 2;\n WHILE i * i <= v DO\n IF v MOD i = 0 THEN\n WHILE v MOD i = 0 DO v OVERAB i OD;\n result -:= result OVER i\n FI;\n IF i = 2 THEN\n i := 1\n FI;\n i +:= 2\n OD;\n IF v > 1 THEN result -:= result OVER v FI;\n result\n FI # totient # ;\n # show the totient function values for the first 25 integers #\n print( ( \" n phi(n) remarks\", newline ) );\n FOR n TO 25 DO\n INT tn = totient( n );\n print( ( whole( n, -2 ), \": \", whole( tn, -5 )\n , IF tn = n - 1 AND tn /= 0 THEN \" n is prime\" ELSE \"\" FI, newline\n )\n )\n OD;\n # use the totient function to count primes #\n INT n100 := 0, n1000 := 0, n10000 := 0, n100000 := 0;\n FOR n TO 100 000 DO\n IF totient( n ) = n - 1 THEN\n IF n <= 100 THEN n100 +:= 1 FI;\n IF n <= 1 000 THEN n1000 +:= 1 FI;\n IF n <= 10 000 THEN n10000 +:= 1 FI;\n IF n <= 100 000 THEN n100000 +:= 1 FI\n FI\n OD;\n print( ( \"There are \", whole( n100, -6 ), \" primes below 100\", newline ) );\n print( ( \"There are \", whole( n1000, -6 ), \" primes below 1 000\", newline ) );\n print( ( \"There are \", whole( n10000, -6 ), \" primes below 10 000\", newline ) );\n print( ( \"There are \", whole( n100000, -6 ), \" primes below 100 000\", newline ) )\nEND\n","language":"ALGOL-68"},{"code":"BEGIN\n\n% RETURN P MOD Q %\nINTEGER FUNCTION MOD (P, Q);\nINTEGER P, Q;\nBEGIN\n\tMOD := P - Q * (P / Q);\nEND;\n\n% RETURN GREATEST COMMON DIVISOR OF X AND Y %\nINTEGER FUNCTION GCD (X, Y);\nINTEGER X, Y;\nBEGIN\n\tINTEGER R;\n\tIF X < Y THEN\n\tBEGIN\n\t\tINTEGER TEMP;\n\t\tTEMP := X;\n\t\tX := Y;\n\t\tY := TEMP;\n\tEND;\n\tWHILE (R := MOD(X, Y)) <> 0 DO\n\tBEGIN\n\t\tX := Y;\n\t\tY := R;\n\tEND;\n\tGCD := Y;\nEND;\n\n% RETURN PHI (ALSO CALLED TOTIENT) OF N %\nINTEGER FUNCTION PHI(N);\nINTEGER N;\nBEGIN\n\tINTEGER I, COUNT;\n COUNT := 1;\n FOR I := 2 STEP 1 UNTIL N DO\n\tBEGIN\n\t\tIF GCD(N,I) = 1 THEN COUNT := COUNT + 1;\n \tEND;\n\tPHI := COUNT;\nEND;\n\nCOMMENT - EXERCISE THE FUNCTION;\nINTEGER N, TOTIENT, COUNT;\nWRITE(\" N PHI(N) PRIME?\");\nFOR N := 1 STEP 1 UNTIL 25 DO\nBEGIN\n WRITE(N, (TOTIENT := PHI(N)));\n WRITEON(IF TOTIENT = (N-1) THEN \" YES\" ELSE \" NO\");\nEND;\n\nCOMMENT - AND USE IT TO COUNT PRIMES;\nWRITE(\"\");\nCOUNT := 0;\nFOR N := 1 STEP 1 UNTIL 1000 DO\nBEGIN\n \tIF PHI(N) = (N-1) THEN COUNT := COUNT + 1;\n \tIF N = 100 THEN\n\t\tWRITE(\"PRIMES UP TO 100 =\", COUNT)\n ELSE IF N = 1000 THEN\n\t\tWRITE(\"PRIMES UP TO 1000 =\", COUNT);\nEND;\n\n\nEND\n","language":"ALGOL-M"},{"code":"task←{\n totient ← 1+.=⍳∨⊢\n prime ← totient=-∘1\n\n ⎕←'Index' 'Totient' 'Prime',(⊢⍪totient¨,[÷2]prime¨)⍳25\n {⎕←'There are' (+/prime¨⍳⍵) 'primes below' ⍵}¨100 1000 10000\n}\n","language":"APL"},{"code":"/* ARM assembly Raspberry PI or android with termux */\n/* program totient.s */\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/* for constantes see task include a file in arm assembly */\n/************************************/\n/* Constantes */\n/************************************/\n.include \"../constantes.inc\"\n.equ MAXI, 25\n\n/*********************************/\n/* Initialized data */\n/*********************************/\n.data\nszMessNumber: .asciz \" number @ totient @ @ \\n\"\nszCarriageReturn: .asciz \"\\n\"\nszMessPrime: .asciz \" is prime.\"\nszMessSpace: .asciz \" \"\nszMessCounterPrime: .asciz \"Number of primes to @ : @ \\n\"\n/*********************************/\n/* UnInitialized data */\n/*********************************/\n.bss\nsZoneConv: .skip 24\n/*********************************/\n/* code section */\n/*********************************/\n.text\n.global main\nmain:\n mov r4,#1 @ start number\n1:\n mov r0,r4\n bl totient @ compute totient\n mov r5,r0\n mov r0,r4\n bl isPrime @ control if number is prime\n mov r6,r0\n mov r0,r4 @ display result\n ldr r1,iAdrsZoneConv\n bl conversion10 @ call décimal conversion\n ldr r0,iAdrszMessNumber\n ldr r1,iAdrsZoneConv @ insert conversion in message\n bl strInsertAtCharInc\n mov r7,r0\n mov r0,r5\n ldr r1,iAdrsZoneConv\n bl conversion10 @ call décimal conversion\n mov r0,r7\n ldr r1,iAdrsZoneConv @ insert conversion in message\n bl strInsertAtCharInc\n mov r7,r0\n cmp r6,#1\n ldreq r1,iAdrszMessPrime\n ldrne r1,iAdrszMessSpace\n mov r0,r7\n bl strInsertAtCharInc\n bl affichageMess @ display message\n\n add r4,r4,#1 @ increment number\n cmp r4,#MAXI @ maxi ?\n ble 1b @ and loop\n\n mov r4,#2 @ first number\n mov r5,#0 @ prime counter\n ldr r6,iCst1000 @ load constantes\n ldr r7,iCst10000\n ldr r8,iCst100000\n2:\n mov r0,r4\n bl isPrime\n cmp r0,#0\n beq 3f\n add r5,r5,#1\n3:\n add r4,r4,#1\n cmp r4,#100\n bne 4f\n mov r0,#100\n mov r1,r5\n bl displayCounter\n b 7f\n4:\n cmp r4,r6 @ 1000\n bne 5f\n mov r0,r6\n mov r1,r5\n bl displayCounter\n b 7f\n5:\n cmp r4,r7 @ 10000\n bne 6f\n mov r0,r7\n mov r1,r5\n bl displayCounter\n b 7f\n6:\n cmp r4,r8 @ 100000\n bne 7f\n mov r0,r8\n mov r1,r5\n bl displayCounter\n7:\n cmp r4,r8\n ble 2b @ and loop\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\niAdrszCarriageReturn: .int szCarriageReturn\niAdrsZoneConv: .int sZoneConv\niAdrszMessNumber: .int szMessNumber\niAdrszMessCounterPrime: .int szMessCounterPrime\niAdrszMessPrime: .int szMessPrime\niAdrszMessSpace: .int szMessSpace\niCst1000: .int 1000\niCst10000: .int 10000\niCst100000: .int 100000\n/******************************************************************/\n/* display counter */\n/******************************************************************/\n/* r0 contains limit */\n/* r1 contains counter */\ndisplayCounter:\n push {r1-r3,lr} @ save registers\n mov r2,r1\n ldr r1,iAdrsZoneConv\n bl conversion10 @ call décimal conversion\n ldr r0,iAdrszMessCounterPrime\n ldr r1,iAdrsZoneConv @ insert conversion in message\n bl strInsertAtCharInc\n mov r3,r0\n mov r0,r2\n ldr r1,iAdrsZoneConv\n bl conversion10 @ call décimal conversion\n mov r0,r3\n ldr r1,iAdrsZoneConv @ insert conversion in message\n bl strInsertAtCharInc\n bl affichageMess\n100:\n pop {r1-r3,pc} @ restaur registers\n/******************************************************************/\n/* compute totient of number */\n/******************************************************************/\n/* r0 contains number */\ntotient:\n push {r1-r5,lr} @ save registers\n mov r4,r0 @ totient\n mov r5,r0 @ save number\n mov r1,#0 @ for first divisor\n1: @ begin loop\n mul r3,r1,r1 @ compute square\n cmp r3,r5 @ compare number\n bgt 4f @ end\n add r1,r1,#2 @ next divisor\n mov r0,r5\n bl division\n cmp r3,#0 @ remainder null ?\n bne 3f\n2: @ begin loop 2\n mov r0,r5\n bl division\n cmp r3,#0\n moveq r5,r2 @ new value = quotient\n beq 2b\n\n mov r0,r4 @ totient\n bl division\n sub r4,r4,r2 @ compute new totient\n3:\n cmp r1,#2 @ first divisor ?\n moveq r1,#1 @ divisor = 1\n b 1b @ and loop\n4:\n cmp r5,#1 @ final value > 1\n ble 5f\n mov r0,r4 @ totient\n mov r1,r5 @ divide by value\n bl division\n sub r4,r4,r2 @ compute new totient\n5:\n\n mov r0,r4\n100:\n pop {r1-r5,pc} @ restaur registers\n\n/***************************************************/\n/* check if a number is prime */\n/***************************************************/\n/* r0 contains the number */\n/* r0 return 1 if prime 0 else */\n@2147483647\n@4294967297\n@131071\nisPrime:\n push {r1-r6,lr} @ save registers\n cmp r0,#0\n beq 90f\n cmp r0,#17\n bhi 1f\n cmp r0,#3\n bls 80f @ for 1,2,3 return prime\n cmp r0,#5\n beq 80f @ for 5 return prime\n cmp r0,#7\n beq 80f @ for 7 return prime\n cmp r0,#11\n beq 80f @ for 11 return prime\n cmp r0,#13\n beq 80f @ for 13 return prime\n cmp r0,#17\n beq 80f @ for 17 return prime\n1:\n tst r0,#1 @ even ?\n beq 90f @ yes -> not prime\n mov r2,r0 @ save number\n sub r1,r0,#1 @ exposant n - 1\n mov r0,#3 @ base\n bl moduloPuR32 @ compute base power n - 1 modulo n\n cmp r0,#1\n bne 90f @ if <> 1 -> not prime\n\n mov r0,#5\n bl moduloPuR32\n cmp r0,#1\n bne 90f\n\n mov r0,#7\n bl moduloPuR32\n cmp r0,#1\n bne 90f\n\n mov r0,#11\n bl moduloPuR32\n cmp r0,#1\n bne 90f\n\n mov r0,#13\n bl moduloPuR32\n cmp r0,#1\n bne 90f\n\n mov r0,#17\n bl moduloPuR32\n cmp r0,#1\n bne 90f\n80:\n mov r0,#1 @ is prime\n b 100f\n90:\n mov r0,#0 @ no prime\n100: @ fin standard de la fonction\n pop {r1-r6,lr} @ restaur des registres\n bx lr @ retour de la fonction en utilisant lr\n/********************************************************/\n/* Calcul modulo de b puissance e modulo m */\n/* Exemple 4 puissance 13 modulo 497 = 445 */\n/* */\n/********************************************************/\n/* r0 nombre */\n/* r1 exposant */\n/* r2 modulo */\n/* r0 return result */\nmoduloPuR32:\n push {r1-r7,lr} @ save registers\n cmp r0,#0 @ verif <> zero\n beq 100f\n cmp r2,#0 @ verif <> zero\n beq 100f @ TODO: vérifier les cas erreur\n1:\n mov r4,r2 @ save modulo\n mov r5,r1 @ save exposant\n mov r6,r0 @ save base\n mov r3,#1 @ start result\n\n mov r1,#0 @ division de r0,r1 par r2\n bl division32R\n mov r6,r2 @ base <- remainder\n2:\n tst r5,#1 @ exposant even or odd\n beq 3f\n umull r0,r1,r6,r3\n mov r2,r4\n bl division32R\n mov r3,r2 @ result <- remainder\n3:\n umull r0,r1,r6,r6\n mov r2,r4\n bl division32R\n mov r6,r2 @ base <- remainder\n\n lsr r5,#1 @ left shift 1 bit\n cmp r5,#0 @ end ?\n bne 2b\n mov r0,r3\n100: @ fin standard de la fonction\n pop {r1-r7,lr} @ restaur des registres\n bx lr @ retour de la fonction en utilisant lr\n\n/***************************************************/\n/* division number 64 bits in 2 registers by number 32 bits */\n/***************************************************/\n/* r0 contains lower part dividende */\n/* r1 contains upper part dividende */\n/* r2 contains divisor */\n/* r0 return lower part quotient */\n/* r1 return upper part quotient */\n/* r2 return remainder */\ndivision32R:\n push {r3-r9,lr} @ save registers\n mov r6,#0 @ init upper upper part remainder !!\n mov r7,r1 @ init upper part remainder with upper part dividende\n mov r8,r0 @ init lower part remainder with lower part dividende\n mov r9,#0 @ upper part quotient\n mov r4,#0 @ lower part quotient\n mov r5,#32 @ bits number\n1: @ begin loop\n lsl r6,#1 @ shift upper upper part remainder\n lsls r7,#1 @ shift upper part remainder\n orrcs r6,#1\n lsls r8,#1 @ shift lower part remainder\n orrcs r7,#1\n lsls r4,#1 @ shift lower part quotient\n lsl r9,#1 @ shift upper part quotient\n orrcs r9,#1\n @ divisor sustract upper part remainder\n subs r7,r2\n sbcs r6,#0 @ and substract carry\n bmi 2f @ négative ?\n\n @ positive or equal\n orr r4,#1 @ 1 -> right bit quotient\n b 3f\n2: @ negative\n orr r4,#0 @ 0 -> right bit quotient\n adds r7,r2 @ and restaur remainder\n adc r6,#0\n3:\n subs r5,#1 @ decrement bit size\n bgt 1b @ end ?\n mov r0,r4 @ lower part quotient\n mov r1,r9 @ upper part quotient\n mov r2,r7 @ remainder\n100: @ function end\n pop {r3-r9,lr} @ restaur registers\n bx lr\n\n\n/***************************************************/\n/* ROUTINES INCLUDE */\n/***************************************************/\n.include \"../affichage.inc\"\n","language":"ARM-Assembly"},{"code":"totient: function [n][\n tot: new n\n i: 2\n while -> n >= i * i [\n if 0 = n % i [\n while -> 0 = n % i -> n: n / i\n 'tot - tot / i\n ]\n if 2 = i -> i: 1\n 'i + 2\n ]\n if n > 1 -> 'tot - tot / n\n return tot\n]\n\nprimes: 0\nloop 1..100000 'i [\n t: totient i\n prime?: 1 = i - t\n if i < 26 [\n prints ~« Φ(|pad.with:`0` to :string i 2|) = |pad to :string t 2|\n if prime? -> prints \", prime\"\n print \"\"\n ]\n if 50 = i -> print \"\"\n if in? i [100 1000 10000 100000] -> print ~« |primes| primes =< |i|\n if prime? -> 'primes + 1\n]\n","language":"Arturo"},{"code":"global cptext := a_tab \"Nr\" a_tab \"Phi\" a_tab \"Prime?`n---------------------------------------------`n\"\n\ndivisores(num)\n{\n\tserie := \"\"\n\tloop % num\n\t\tif !mod(num,a_index)\n\t\t\tserie .= a_index \",\"\n\treturn serie\n}\n\ngcd(serieA,serieB)\n{\n\temComum := 0\n\tloop,parse,serieA,csv\n\t\tif A_LoopField in %serieB%\n\t\t\temComum += 1\n\treturn emComum\n}\t\n\t\t\nprincipal(voltas,phi:=0)\n{\nloop %voltas%\n{\ncp := A_Index\ncpcount := 0\nnumA := divisores(cp)\nloop % a_index\n\t{\n\t\tnumA := divisores(cp)\n\t\tnumB := divisores(A_Index)\n\t\tfim := gcd(numA,numB)\n\t\tif (fim = 1)\n\t\t\tcpcount += 1\n\t}\t\t\nif (cpcount = cp-1)\n\t{\n\t\tif phi\n\t\t\tcptext .= a_tab cp a_tab cpcount a_tab \"1`n\"\n\t\ttotalPrimes += 1\n\t}\nelse\n\tcptext .= a_tab cp a_tab cpcount a_tab \"0`n\"\n}\nreturn totalPrimes\n}\n\ntotalPrimes := principal(25,1)\nmsgbox % cptext \"`n`ntotal primes = \" totalPrimes ; Number 1 is a prime number ? If yes, add 1 to totalPrimes\ntotalPrimes := principal(100)\nmsgbox % \"total primes in 1 .. 100 = \" totalPrimes\ntotalPrimes := principal(1000)\t\t\t\t\t\t\t; caution... pure gcd method\nmsgbox % \"total primes in 1 .. 1000 = \" totalPrimes ; takes 3 minutes or more\n;totalPrimes := principal(10000)\n;msgbox % \"total primes in 1 .. 10000 = \" totalPrimes\nExitApp\n","language":"AutoHotkey"},{"code":"# syntax: GAWK -f TOTIENT_FUNCTION.AWK\nBEGIN {\n print(\" N Phi isPrime\")\n for (n=1; n<=1000000; n++) {\n tot = totient(n)\n if (n-1 == tot) {\n count++\n }\n if (n <= 25) {\n printf(\"%2d %3d %s\\n\",n,tot,(n-1==tot)?\"true\":\"false\")\n if (n == 25) {\n printf(\"\\n Limit PrimeCount\\n\")\n printf(\"%7d %10d\\n\",n,count)\n }\n }\n else if (n ~ /^100+$/) {\n printf(\"%7d %10d\\n\",n,count)\n }\n }\n exit(0)\n}\nfunction totient(n, i,tot) {\n tot = n\n for (i=2; i*i<=n; i+=2) {\n if (n % i == 0) {\n while (n % i == 0) {\n n /= i\n }\n tot -= tot / i\n }\n if (i == 2) {\n i = 1\n }\n }\n if (n > 1) {\n tot -= tot / n\n }\n return(tot)\n}\n","language":"AWK"},{"code":"10 DEFINT A-Z: DIM B$(2): B$(0)=\"No\": B$(1)=\"Yes\"\n20 PRINT \" N Totient Prime\"\n30 FOR N=1 TO 25\n40 GOSUB 200\n50 P=-(T=N-1)\n60 C=C+P\n70 PRINT USING \"## ####### \\ \\\";N;T;B$(P)\n80 NEXT N\n90 F$=\"Number of primes up to ######: ####\"\n100 PRINT USING F$;25;C\n110 FOR N=26 TO 10000\n120 GOSUB 200\n130 C=C-(T=N-1)\n140 IF N=100 OR N=1000 OR N=10000 THEN PRINT USING F$;N;C\n150 NEXT N\n160 END\n200 REM T = TOTIENT(N)\n210 T=N: Z=N\n220 I=2: GOSUB 270\n230 I=3\n240 IF I*I<=Z THEN GOSUB 270: I=I+2: GOTO 240\n250 IF Z>1 THEN T=T-T\\Z\n260 RETURN\n270 IF Z MOD I<>0 THEN RETURN\n280 IF Z MOD I=0 THEN Z = Z\\I: GOTO 280\n290 T = T-T\\I\n300 RETURN\n","language":"BASIC"},{"code":"get \"libhdr\"\n\nlet totient(n) = valof\n$( let tot = n and i = 2\n while i*i <= n\n $( if n rem i = 0\n $( while n rem i = 0 do n := n / i\n tot := tot - tot/i\n $)\n if i=2 then i:=1\n i := i+2\n $)\n resultis n>1 -> tot-tot/n, tot\n$)\n\nlet start() be\n$( let count = 0\n writes(\" N Totient Prime*N\")\n for n = 1 to 25\n $( let tot = totient(n)\n let prime = n-1 = tot\n if prime then count := count + 1\n writef(\"%I2 %I7 %S*N\", n, tot, prime -> \" Yes\", \" No\")\n $)\n writef(\"Number of primes up to %I6: %I4*N\", 25, count)\n for n = 26 to 10000\n $( if totient(n) = n-1 then count := count + 1\n if n = 100 | n = 1000 | n = 10000 then\n writef(\"Number of primes up to %I6: %I4*N\", n, count)\n $)\n$)\n","language":"BCPL"},{"code":"GCD ← {𝕨(|𝕊⍟(>⟜0)⊣)𝕩}\nTotient ← +´1=⊢GCD¨1+↕\n","language":"BQN"},{"code":" Totient¨1+↕25\n⟨ 1 1 2 2 4 2 6 4 6 4 10 4 12 6 8 8 16 6 18 8 12 10 22 8 20 ⟩\n\n \"Number\"‿\"Totient\"‿\"Prime?\"∾˘{𝕩∾(⊢≍(𝕩-1)⊸=)Totient¨𝕩}1+↕25\n┌─\n╵ \"Number\" 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25\n \"Totient\" 1 1 2 2 4 2 6 4 6 4 10 4 12 6 8 8 16 6 18 8 12 10 22 8 20\n \"Prime?\" 0 1 1 0 1 0 1 0 0 0 1 0 1 0 0 0 1 0 1 0 0 0 1 0 0\n ┘\n","language":"BQN"},{"code":"/*Abhishek Ghosh, 7th December 2018*/\n\n#include<stdio.h>\n\nint totient(int n){\n\tint tot = n,i;\n\t\n\tfor(i=2;i*i<=n;i+=2){\n\t\tif(n%i==0){\n\t\t\twhile(n%i==0)\n\t\t\t\tn/=i;\n\t\t\ttot-=tot/i;\n\t\t}\n\t\t\n\t\tif(i==2)\n\t\t\ti=1;\n\t}\n\t\n\tif(n>1)\n\t\ttot-=tot/n;\n\t\n\treturn tot;\n}\n\nint main()\n{\n\tint count = 0,n,tot;\n\t\n\tprintf(\" n %c prime\",237);\n printf(\"\\n---------------\\n\");\n\t\n\tfor(n=1;n<=25;n++){\n\t\ttot = totient(n);\n\t\t\n\t\tif(n-1 == tot)\n\t\t\tcount++;\n\t\t\n\t\tprintf(\"%2d %2d %s\\n\", n, tot, n-1 == tot?\"True\":\"False\");\n\t}\n\t\n\tprintf(\"\\nNumber of primes up to %6d =%4d\\n\", 25,count);\n\t\n\tfor(n = 26; n <= 100000; n++){\n tot = totient(n);\n if(tot == n-1)\n\t\t\tcount++;\n\n if(n == 100 || n == 1000 || n%10000 == 0){\n printf(\"\\nNumber of primes up to %6d = %4d\\n\", n, count);\n }\n }\n\t\n\treturn 0;\n}\n","language":"C"},{"code":"#include <cassert>\n#include <iomanip>\n#include <iostream>\n#include <vector>\n\nclass totient_calculator {\npublic:\n explicit totient_calculator(int max) : totient_(max + 1) {\n for (int i = 1; i <= max; ++i)\n totient_[i] = i;\n for (int i = 2; i <= max; ++i) {\n if (totient_[i] < i)\n continue;\n for (int j = i; j <= max; j += i)\n totient_[j] -= totient_[j] / i;\n }\n }\n int totient(int n) const {\n assert (n >= 1 && n < totient_.size());\n return totient_[n];\n }\n bool is_prime(int n) const {\n return totient(n) == n - 1;\n }\nprivate:\n std::vector<int> totient_;\n};\n\nint count_primes(const totient_calculator& tc, int min, int max) {\n int count = 0;\n for (int i = min; i <= max; ++i) {\n if (tc.is_prime(i))\n ++count;\n }\n return count;\n}\n\nint main() {\n const int max = 10000000;\n totient_calculator tc(max);\n std::cout << \" n totient prime?\\n\";\n for (int i = 1; i <= 25; ++i) {\n std::cout << std::setw(2) << i\n << std::setw(9) << tc.totient(i)\n << std::setw(8) << (tc.is_prime(i) ? \"yes\" : \"no\") << '\\n';\n }\n for (int n = 100; n <= max; n *= 10) {\n std::cout << \"Count of primes up to \" << n << \": \"\n << count_primes(tc, 1, n) << '\\n';\n }\n return 0;\n}\n","language":"C++"},{"code":"using static System.Console;\nusing static System.Linq.Enumerable;\n\npublic class Program\n{\n static void Main()\n {\n for (int i = 1; i <= 25; i++) {\n int t = Totient(i);\n WriteLine(i + \"\\t\" + t + (t == i - 1 ? \"\\tprime\" : \"\"));\n }\n WriteLine();\n for (int i = 100; i <= 100_000; i *= 10) {\n WriteLine($\"{Range(1, i).Count(x => Totient(x) + 1 == x):n0} primes below {i:n0}\");\n }\n }\n\n static int Totient(int n) {\n if (n < 3) return 1;\n if (n == 3) return 2;\n\n int totient = n;\n\n if ((n & 1) == 0) {\n totient >>= 1;\n while (((n >>= 1) & 1) == 0) ;\n }\n\n for (int i = 3; i * i <= n; i += 2) {\n if (n % i == 0) {\n totient -= totient / i;\n while ((n /= i) % i == 0) ;\n }\n }\n if (n > 1) totient -= totient / n;\n return totient;\n }\n}\n","language":"C-sharp"},{"code":"totient = proc (n: int) returns (int)\n tot: int := n\n\n i: int := 2\n while i*i <= n do\n if n//i = 0 then\n while n//i = 0 do\n n := n/i\n end\n tot := tot-tot/i\n end\n if i=2 then i:=1 end\n i := i+2\n end\n if n>1 then\n tot := tot-tot/n\n end\n return(tot)\nend totient\n\nstart_up = proc ()\n po: stream := stream$primary_output()\n count: int := 0\n\n stream$putl(po, \" N Totient Prime\")\n for n: int in int$from_to(1, 25) do\n tot: int := totient(n)\n stream$putright(po, int$unparse(n), 2)\n stream$putright(po, int$unparse(tot), 9)\n if n-1 = tot then\n stream$putright(po, \"Yes\", 7)\n count := count + 1\n else\n stream$putright(po, \"No\", 7)\n end\n stream$putl(po, \"\")\n end\n\n stream$putl(po, \"Number of primes up to 25:\\t\" || int$unparse(count))\n for n: int in int$from_to(26, 100000) do\n if totient(n) = n-1 then\n count := count + 1\n end\n if n = 100 cor n = 1000 cor n // 10000 = 0 then\n stream$putl(po, \"Number of primes up to \"\n || int$unparse(n) || \":\\t\"\n || int$unparse(count))\n end\n end\nend start_up\n","language":"CLU"},{"code":" IDENTIFICATION DIVISION.\n PROGRAM-ID. TOTIENT-FUNCTION.\n\n DATA DIVISION.\n WORKING-STORAGE SECTION.\n 01 TOTIENT-CALCULATION.\n 03 N PIC 9(6).\n 03 TOTIENT PIC 9(6).\n 03 DIVISOR PIC 9(6).\n 03 DIV-SQUARE PIC 9(6).\n 03 MODULUS PIC 9(6).\n\n 01 LOOP-VARS.\n 03 PRIME-COUNT PIC 9(4).\n 03 CURRENT-N PIC 9(6).\n 03 PRIME-TOTIENT PIC 9(6).\n\n 01 OUTPUTFORMAT.\n 03 HEADER PIC X(20) VALUE \" N Totient Prime?\".\n 03 TOTIENT-ROW.\n 05 OUT-N PIC Z9.\n 05 FILLER PIC XX VALUE SPACES.\n 05 OUT-TOTIENT PIC Z(6)9.\n 05 FILLER PIC XX VALUE SPACES.\n 05 OUT-PRIME PIC X(5).\n 03 PRIME-COUNT-ROW.\n 05 FILLER PIC X(22) VALUE \"Number of primes up to\".\n 05 OUT-PRMTO PIC Z(5)9.\n 05 FILLER PIC XX VALUE \": \".\n 05 OUT-PRMCNT PIC ZZZ9.\n\n PROCEDURE DIVISION.\n BEGIN.\n MOVE ZERO TO PRIME-COUNT.\n DISPLAY HEADER.\n PERFORM SHOW-SMALL-TOTIENT\n VARYING CURRENT-N FROM 1 BY 1\n UNTIL CURRENT-N IS GREATER THAN 25.\n MOVE 25 TO OUT-PRMTO.\n MOVE PRIME-COUNT TO OUT-PRMCNT.\n DISPLAY PRIME-COUNT-ROW.\n PERFORM COUNT-PRIMES\n VARYING CURRENT-N FROM 26 BY 1\n UNTIL CURRENT-N IS GREATER THAN 10000.\n STOP RUN.\n\n SHOW-SMALL-TOTIENT.\n MOVE CURRENT-N TO N.\n PERFORM CALCULATE-TOTIENT.\n MOVE CURRENT-N TO OUT-N.\n MOVE TOTIENT TO OUT-TOTIENT.\n MOVE \"No\" TO OUT-PRIME.\n SUBTRACT 1 FROM CURRENT-N GIVING PRIME-TOTIENT.\n IF TOTIENT IS EQUAL TO PRIME-TOTIENT,\n MOVE \"Yes\" TO OUT-PRIME,\n ADD 1 TO PRIME-COUNT.\n DISPLAY TOTIENT-ROW.\n\n COUNT-PRIMES.\n MOVE CURRENT-N TO N.\n PERFORM CALCULATE-TOTIENT.\n SUBTRACT 1 FROM CURRENT-N GIVING PRIME-TOTIENT.\n IF TOTIENT IS EQUAL TO PRIME-TOTIENT, ADD 1 TO PRIME-COUNT.\n IF CURRENT-N IS EQUAL TO 100 OR 1000 OR 10000,\n MOVE CURRENT-N TO OUT-PRMTO,\n MOVE PRIME-COUNT TO OUT-PRMCNT,\n DISPLAY PRIME-COUNT-ROW.\n\n CALCULATE-TOTIENT.\n MOVE N TO TOTIENT.\n MOVE 2 TO DIVISOR.\n MOVE 4 TO DIV-SQUARE.\n PERFORM DIVIDE-STEP.\n PERFORM DIVIDE-STEP\n VARYING DIVISOR FROM 3 BY 2\n UNTIL DIV-SQUARE IS GREATER THAN N.\n IF N IS GREATER THAN 1,\n COMPUTE TOTIENT = TOTIENT - TOTIENT / N.\n\n DIVIDE-STEP.\n MULTIPLY DIVISOR BY DIVISOR GIVING DIV-SQUARE.\n DIVIDE N BY DIVISOR GIVING MODULUS.\n MULTIPLY DIVISOR BY MODULUS.\n SUBTRACT MODULUS FROM N GIVING MODULUS.\n IF MODULUS IS ZERO,\n PERFORM DIVIDE-OUT UNTIL MODULUS IS NOT ZERO,\n COMPUTE TOTIENT = TOTIENT - TOTIENT / DIVISOR.\n\n DIVIDE-OUT.\n DIVIDE DIVISOR INTO N.\n DIVIDE N BY DIVISOR GIVING MODULUS.\n MULTIPLY DIVISOR BY MODULUS.\n SUBTRACT MODULUS FROM N GIVING MODULUS.\n","language":"COBOL"},{"code":"include \"cowgol.coh\";\n\nsub totient(n: uint32): (tot: uint32) is\n tot := n;\n\n var i: uint32 := 2;\n while i*i <= n loop\n if n%i == 0 then\n while n%i == 0 loop\n n := n/i;\n end loop;\n tot := tot - tot/i;\n end if;\n if i == 2 then\n i := 1;\n end if;\n i := i + 2;\n end loop;\n\n if n > 1 then\n tot := tot - tot/n;\n end if;\nend sub;\n\nvar count: uint16 := 0;\n\nprint(\"N\\tTotient\\tPrime\\n\");\nvar n: uint32 := 1;\nwhile n <= 25 loop\n var tot := totient(n);\n print_i32(n);\n print_char('\\t');\n print_i32(tot);\n print_char('\\t');\n if n-1 == tot then\n count := count + 1;\n print(\"Yes\\n\");\n else\n print(\"No\\n\");\n end if;\n n := n + 1;\nend loop;\n\nprint(\"Number of primes up to 25:\\t\");\nprint_i16(count);\nprint_nl();\n\nwhile n <= 100000 loop\n tot := totient(n);\n if n-1 == tot then\n count := count + 1;\n end if;\n if n == 100 or n == 1000 or n % 10000 == 0 then\n print(\"Number of primes up to \");\n print_i32(n);\n print(\":\\t\");\n print_i16(count);\n print_nl();\n end if;\n n := n + 1;\nend loop;\n","language":"Cowgol"},{"code":"import std.stdio;\n\nint totient(int n) {\n int tot = n;\n\n for (int i = 2; i * i <= n; i += 2) {\n if (n % i == 0) {\n while (n % i == 0) {\n n /= i;\n }\n tot -= tot / i;\n }\n if (i==2) {\n i = 1;\n }\n }\n\n if (n > 1) {\n tot -= tot / n;\n }\n return tot;\n}\n\nvoid main() {\n writeln(\" n φ prime\");\n writeln(\"---------------\");\n\n int count = 0;\n for (int n = 1; n <= 25; n++) {\n int tot = totient(n);\n\n if (n - 1 == tot) {\n count++;\n }\n\n writefln(\"%2d %2d %s\", n,tot, n - 1 == tot);\n }\n writeln;\n\n writefln(\"Number of primes up to %6d = %4d\", 25, count);\n for (int n = 26; n <= 100_000; n++) {\n int tot = totient(n);\n\n if (n - 1 == tot) {\n count++;\n }\n\n if (n == 100 || n == 1_000 || n % 10_000 == 0) {\n writefln(\"Number of primes up to %6d = %4d\", n, count);\n }\n }\n}\n","language":"D"},{"code":"proc totient(word n) word:\n word tot, i;\n tot := n;\n i := 2;\n while i*i <= n do\n if n%i = 0 then\n while n%i = 0 do n := n/i od;\n tot := tot - tot/i\n fi;\n if i=2 then i:=1 fi;\n i := i+2\n od;\n if n>1 then\n tot - tot/n\n else\n tot\n fi\ncorp\n\nproc main() void:\n word count, n, tot;\n bool prime;\n\n count := 0;\n writeln(\" N Totient Prime\");\n for n from 1 upto 25 do\n tot := totient(n);\n prime := n-1 = tot;\n if prime then count := count+1 fi;\n writeln(n:2, \" \", tot:7, \" \", if prime then \" Yes\" else \" No\" fi)\n od;\n writeln(\"Number of primes up to \",25:6,\": \",count:4);\n for n from 25 upto 10000 do\n if totient(n) = n-1 then count := count+1 fi;\n if n=100 or n=1000 or n=10000 then\n writeln(\"Number of primes up to \",n:6,\": \",count:4)\n fi\n od\ncorp\n","language":"Draco"},{"code":"func totient(n) {\n var tot = n\n var i = 2\n while i * i <= n {\n if n % i == 0 {\n while n % i == 0 {\n n /= i\n }\n tot -= tot / i\n }\n if i == 2 {\n i = 1\n }\n i += 2\n }\n if n > 1 {\n tot -= tot / n\n }\n return tot\n}\n\nprint(\"n\\tphi\\tprime\")\nvar count = 0\nfor n in 1..25 {\n var tot = totient(n)\n var isPrime = n - 1 == tot\n if isPrime {\n count += 1\n }\n print(\"\\(n)\\t\\(tot)\\t\\(isPrime)\")\n}\nprint(\"\\nNumber of primes up to 25 \\t= \\(count)\")\nfor n in 26..100000 {\n var tot = totient(n)\n if tot == n - 1 {\n count += 1\n }\n if n == 100 || n == 1000 || n % 10000 == 0 {\n print(\"Number of primes up to \\(n) \\t= \\(count)\")\n }\n}\n","language":"Dyalect"},{"code":"func totient n .\n tot = n\n i = 2\n while i <= sqrt n\n if n mod i = 0\n while n mod i = 0\n n = n div i\n .\n tot -= tot div i\n .\n if i = 2\n i = 1\n .\n i += 2\n .\n if n > 1\n tot -= tot div n\n .\n return tot\n.\nnumfmt 0 3\nprint \" N Prim Phi\"\nfor n = 1 to 25\n tot = totient n\n x$ = \" \"\n if n - 1 = tot\n x$ = \" x \"\n .\n print n & x$ & tot\n.\nprint \"\"\nfor n = 1 to 100000\n tot = totient n\n if n - 1 = tot\n cnt += 1\n .\n if n = 100 or n = 1000 or n = 10000 or n = 100000\n print n & \" - \" & cnt & \" primes\"\n .\n.\n","language":"EasyLang"},{"code":"USING: combinators formatting io kernel math math.primes.factors\nmath.ranges sequences ;\nIN: rosetta-code.totient-function\n\n: Φ ( n -- m )\n {\n { [ dup 1 < ] [ drop 0 ] }\n { [ dup 1 = ] [ drop 1 ] }\n [\n dup unique-factors\n [ 1 [ 1 - * ] reduce ] [ product ] bi / *\n ]\n } cond ;\n\n: show-info ( n -- )\n [ Φ ] [ swap 2dup - 1 = ] bi \", prime\" \"\" ?\n \"Φ(%2d) = %2d%s\\n\" printf ;\n\n: totient-demo ( -- )\n 25 [1,b] [ show-info ] each nl 0 100,000 [1,b] [\n [ dup Φ - 1 = [ 1 + ] when ]\n [ dup { 100 1,000 10,000 100,000 } member? ] bi\n [ dupd \"%4d primes <= %d\\n\" printf ] [ drop ] if\n ] each drop ;\n\nMAIN: totient-demo\n","language":"Factor"},{"code":": totient \\ n -- n' ;\n DUP DUP 2 ?DO ( tot n )\n DUP I DUP * < IF LEAVE THEN \\ for(i=2;i*i<=n;i+=2){\n DUP I MOD 0= IF\t\t\t\t\t\\ if(n%i==0){\n BEGIN DUP I /MOD SWAP 0= WHILE ( tot n n/i ) \\ while(n%i==0);\n NIP ( tot n/i ) \\ n/=i;\n REPEAT\n DROP ( tot n ) \\ Remove the new n on exit from loop\n SWAP DUP I / - SWAP \t ( tot' n ) \t\\ tot-=tot/i;\n THEN\n 2 I 2 = + +LOOP \\ If I = 2 add 1 else add 2 to loop index.\n DUP 1 > IF OVER SWAP / - ELSE DROP THEN ;\n\n: bool. \\ f -- ;\n IF .\" True \" ELSE .\" False\" THEN ;\n\n: count-primes \\ n -- n' ;\n 0 SWAP 2 ?DO I DUP totient 1+ = - LOOP ;\n\n: challenge \\ -- ;\n CR .\" n φ prime\" CR\n 26 1 DO\n I 3 .r\n I totient DUP 4 .r 4 SPACES\n 1+ I = bool. CR\n LOOP CR\n 100001 100 DO\n .\" Number of primes up to \" I 6 .R .\" is \" I count-primes 4 .R CR\n I 9 * +LOOP ;\n","language":"Forth"},{"code":"#define esPar(n) (((n) And 1) = 0)\n#define esImpar(n) (esPar(n) = 0)\n\nFunction Totient(n As Integer) As Integer\n 'delta son números no divisibles por 2,3,5\n Dim delta(7) As Integer = {6,4,2,4,2,4,6,2}\n Dim As Integer i, quot, idx, result\n ' div mod por constante es rápido.\n 'i = 2\n result = n\n If (2*2 <= n) Then\n If Not(esImpar(n)) Then\n ' eliminar números con factor 2,4,8,16,...\n While Not(esImpar(n))\n n = n \\ 2\n Wend\n 'eliminar los múltiplos de 2\n result -= result \\ 2\n End If\n End If\n 'i = 3\n If (3*3 <= n) And (n Mod 3 = 0) Then\n Do\n quot = n \\ 3\n If n <> quot*3 Then\n Exit Do\n Else\n n = quot\n End If\n Loop Until false\n result -= result \\ 3\n End If\n 'i = 5\n If (5*5 <= n) And (n Mod 5 = 0) Then\n Do\n quot = n \\ 5\n If n <> quot*5 Then\n Exit Do\n Else\n n = quot\n End If\n Loop Until false\n result -= result \\ 5\n End If\n i = 7\n idx = 1\n 'i = 7,11,13,17,19,23,29,...,49 ..\n While i*i <= n\n quot = n \\ i\n If n = quot*i Then\n Do\n If n <> quot*i Then\n Exit Do\n Else\n n = quot\n End If\n quot = n \\ i\n Loop Until false\n result -= result \\ i\n End If\n i = i + delta(idx)\n idx = (idx+1) And 7\n Wend\n If n > 1 Then result -= result \\ n\n Totient = result\nEnd Function\n\nSub ContandoPrimos(n As Integer)\n Dim As Integer i, cnt = 0\n For i = 1 To n\n If Totient(i) = (i-1) Then cnt += 1\n Next i\n Print Using \" ####### ######\"; i-1; cnt\nEnd Sub\n\nFunction esPrimo(n As Ulongint) As String\n esPrimo = \"False\"\n If n = 1 then Return \"False\"\n If (n=2) Or (n=3) Then Return \"True\"\n If n Mod 2=0 Then Exit Function\n If n Mod 3=0 Then Exit Function\n Dim As Ulongint limite = Sqr(N)+1\n For i As Ulongint = 6 To limite Step 6\n If N Mod (i-1)=0 Then Exit Function\n If N Mod (i+1)=0 Then Exit Function\n Next i\n Return \"True\"\nEnd Function\n\nSub display(n As Integer)\n Dim As Integer idx, phi\n If n = 0 Then Exit Sub\n Print \" n phi(n) esPrimo\"\n For idx = 1 To n\n phi = Totient(idx)\n Print Using \"### ### \\ \\\"; idx; phi; esPrimo(idx)\n Next idx\nEnd Sub\n\nDim l As Integer\ndisplay(25)\n\nPrint Chr(10) & \" Limite Son primos\"\nContandoPrimos(25)\nl = 100\nDo\n ContandoPrimos(l)\n l = l*10\nLoop Until l > 1000000\nEnd\n","language":"FreeBASIC"},{"code":"package main\n\nimport \"fmt\"\n\nfunc gcd(n, k int) int {\n if n < k || k < 1 {\n panic(\"Need n >= k and k >= 1\")\n }\n\n s := 1\n for n&1 == 0 && k&1 == 0 {\n n >>= 1\n k >>= 1\n s <<= 1\n }\n\n t := n\n if n&1 != 0 {\n t = -k\n }\n for t != 0 {\n for t&1 == 0 {\n t >>= 1\n }\n if t > 0 {\n n = t\n } else {\n k = -t\n }\n t = n - k\n }\n return n * s\n}\n\nfunc totient(n int) int {\n tot := 0\n for k := 1; k <= n; k++ {\n if gcd(n, k) == 1 {\n tot++\n }\n }\n return tot\n}\n\nfunc main() {\n fmt.Println(\" n phi prime\")\n fmt.Println(\"---------------\")\n count := 0\n for n := 1; n <= 25; n++ {\n tot := totient(n)\n isPrime := n-1 == tot\n if isPrime {\n count++\n }\n fmt.Printf(\"%2d %2d %t\\n\", n, tot, isPrime)\n }\n fmt.Println(\"\\nNumber of primes up to 25 =\", count)\n for n := 26; n <= 100000; n++ {\n tot := totient(n)\n if tot == n-1 {\n count++\n }\n if n == 100 || n == 1000 || n%10000 == 0 {\n fmt.Printf(\"\\nNumber of primes up to %-6d = %d\\n\", n, count)\n }\n }\n}\n","language":"Go"},{"code":"package main\n\nimport \"fmt\"\n\nfunc totient(n int) int {\n tot := n\n for i := 2; i*i <= n; i += 2 {\n if n%i == 0 {\n for n%i == 0 {\n n /= i\n }\n tot -= tot / i\n }\n if i == 2 {\n i = 1\n }\n }\n if n > 1 {\n tot -= tot / n\n }\n return tot\n}\n\nfunc main() {\n fmt.Println(\" n phi prime\")\n fmt.Println(\"---------------\")\n count := 0\n for n := 1; n <= 25; n++ {\n tot := totient(n)\n isPrime := n-1 == tot\n if isPrime {\n count++\n }\n fmt.Printf(\"%2d %2d %t\\n\", n, tot, isPrime)\n }\n fmt.Println(\"\\nNumber of primes up to 25 =\", count)\n for n := 26; n <= 100000; n++ {\n tot := totient(n)\n if tot == n-1 {\n count++\n }\n if n == 100 || n == 1000 || n%10000 == 0 {\n fmt.Printf(\"\\nNumber of primes up to %-6d = %d\\n\", n, count)\n }\n }\n}\n","language":"Go"},{"code":"{-# LANGUAGE BangPatterns #-}\n\nimport Control.Monad (when)\nimport Data.Bool (bool)\n\ntotient\n :: (Integral a)\n => a -> a\ntotient n\n | n == 0 = 1 -- by definition phi(0) = 1\n | n < 0 = totient (-n) -- phi(-n) is taken to be equal to phi(n)\n | otherwise = loop n n 2 --\n where\n loop !m !tot !i\n | i * i > m = bool tot (tot - (tot `div` m)) (1 < m)\n | m `mod` i == 0 = loop m_ tot_ i_\n | otherwise = loop m tot i_\n where\n i_\n | i == 2 = 3\n | otherwise = 2 + i\n m_ = nextM m\n tot_ = tot - (tot `div` i)\n nextM !x\n | x `mod` i == 0 = nextM $ x `div` i\n | otherwise = x\n\nmain :: IO ()\nmain = do\n putStrLn \"n\\tphi\\tprime\\n---------------------\"\n let loop !i !count\n | i >= 10 ^ 6 = return ()\n | otherwise = do\n let i_ = succ i\n tot = totient i_\n isPrime = tot == pred i_\n count_\n | isPrime = succ count\n | otherwise = count\n when (25 >= i_) $\n putStrLn $ show i_ ++ \"\\t\" ++ show tot ++ \"\\t\" ++ show isPrime\n when\n (i_ `elem`\n 25 :\n [ 10 ^ k\n | k <- [2 .. 6] ]) $\n putStrLn $ \"Number of primes up to \" ++ show i_ ++ \" = \" ++ show count_\n loop (i + 1) count_\n loop 0 0\n","language":"Haskell"},{"code":" nth_prime =: p: NB. 2 is the zeroth prime\n totient =: 5&p:\n primeQ =: 1&p:\n\n NB. first row contains the integer\n NB. second row totient\n NB. third 1 iff prime\n (, totient ,: primeQ) >: i. 25\n1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25\n1 1 2 2 4 2 6 4 6 4 10 4 12 6 8 8 16 6 18 8 12 10 22 8 20\n0 1 1 0 1 0 1 0 0 0 1 0 1 0 0 0 1 0 1 0 0 0 1 0 0\n\n\n NB. primes first exceeding the limits\n [&.:(p:inv) 10 ^ 2 + i. 4\n101 1009 10007 100003\n\n p:inv 101 1009 10007 100003\n25 168 1229 9592\n\n NB. limit and prime count\n (,. p:inv) 10 ^ 2 + i. 5\n 100 25\n 1000 168\n 10000 1229\n100000 9592\n 1e6 78498\n","language":"J"},{"code":"public class TotientFunction {\n\n public static void main(String[] args) {\n computePhi();\n System.out.println(\"Compute and display phi for the first 25 integers.\");\n System.out.printf(\"n Phi IsPrime%n\");\n for ( int n = 1 ; n <= 25 ; n++ ) {\n System.out.printf(\"%2d %2d %b%n\", n, phi[n], (phi[n] == n-1));\n }\n for ( int i = 2 ; i < 8 ; i++ ) {\n int max = (int) Math.pow(10, i);\n System.out.printf(\"The count of the primes up to %,10d = %d%n\", max, countPrimes(1, max));\n }\n }\n\n private static int countPrimes(int min, int max) {\n int count = 0;\n for ( int i = min ; i <= max ; i++ ) {\n if ( phi[i] == i-1 ) {\n count++;\n }\n }\n return count;\n }\n\n private static final int max = 10000000;\n private static final int[] phi = new int[max+1];\n\n private static final void computePhi() {\n for ( int i = 1 ; i <= max ; i++ ) {\n phi[i] = i;\n }\n for ( int i = 2 ; i <= max ; i++ ) {\n if (phi[i] < i) continue;\n for ( int j = i ; j <= max ; j += i ) {\n phi[j] -= phi[j] / i;\n }\n }\n }\n\n}\n","language":"Java"},{"code":"# jq optimizes the recursive call of _gcd in the following:\ndef gcd(a;b):\n def _gcd:\n if .[1] != 0 then [.[1], .[0] % .[1]] | _gcd else .[0] end;\n [a,b] | _gcd ;\n\ndef count(s): reduce s as $x (0; .+1);\n\ndef totient:\n . as $n\n | count( range(0; .) | select( gcd($n; .) == 1) );\n\n# input: determines the maximum via range(0; .)\n# and so may be `infinite`\ndef primes_via_totient:\n range(0; .) | select(totient == . - 1);\n","language":"Jq"},{"code":"def task:\n def task1($n):\n range(1;$n)\n | totient as $totient\n | {i: ., $totient, isprime: ($totient == ( . - 1 ))};\n\n task1(26);\n\ndef onepass:\n reduce (10000 | primes_via_totient) as $p ({};\n if $p < 10000\n then .[\"10^4\"] += 1\n | if $p < 1000\n then .[\"10^3\"] += 1\n | if $p < 100\n then .[\"10^2\"] += 1\n else . end else . end else . end) ;\n\ntask, \"\\nCounts of primes up to the given limits:\", onepass\n","language":"Jq"},{"code":"φ(n) = sum(1 for k in 1:n if gcd(n, k) == 1)\n\nis_prime(n) = φ(n) == n - 1\n\nfunction runphitests()\n for n in 1:25\n println(\" φ($n) == $(φ(n))\", is_prime(n) ? \", is prime\" : \"\")\n end\n count = 0\n for n in 1:100_000\n count += is_prime(n)\n if n in [100, 1000, 10_000, 100_000]\n println(\"Primes up to $n: $count\")\n end\n end\nend\n\nrunphitests()\n","language":"Julia"},{"code":"// Version 1.3.21\n\nfun totient(n: Int): Int {\n var tot = n\n var nn = n\n var i = 2\n while (i * i <= nn) {\n if (nn % i == 0) {\n while (nn % i == 0) nn /= i\n tot -= tot / i\n }\n if (i == 2) i = 1\n i += 2\n }\n if (nn > 1) tot -= tot / nn\n return tot\n}\n\nfun main() {\n println(\" n phi prime\")\n println(\"---------------\")\n var count = 0\n for (n in 1..25) {\n val tot = totient(n)\n val isPrime = n - 1 == tot\n if (isPrime) count++\n System.out.printf(\"%2d %2d %b\\n\", n, tot, isPrime)\n }\n println(\"\\nNumber of primes up to 25 = $count\")\n for (n in 26..100_000) {\n val tot = totient(n)\n if (tot == n-1) count++\n if (n == 100 || n == 1000 || n % 10_000 == 0) {\n System.out.printf(\"\\nNumber of primes up to %-6d = %d\\n\", n, count)\n }\n }\n}\n","language":"Kotlin"},{"code":"-- Return the greatest common denominator of x and y\nfunction gcd (x, y)\n return y == 0 and math.abs(x) or gcd(y, x % y)\nend\n\n-- Return the totient number for n\nfunction totient (n)\n local count = 0\n for k = 1, n do\n if gcd(n, k) == 1 then count = count + 1 end\n end\n return count\nend\n\n-- Determine (inefficiently) whether p is prime\nfunction isPrime (p)\n return totient(p) == p - 1\nend\n\n-- Output totient and primality for the first 25 integers\nprint(\"n\", string.char(237), \"prime\")\nprint(string.rep(\"-\", 21))\nfor i = 1, 25 do\n print(i, totient(i), isPrime(i))\nend\n\n-- Count the primes up to 100, 1000 and 10000\nlocal pCount, i, limit = 0, 1\nfor power = 2, 4 do\n limit = 10 ^ power\n repeat\n i = i + 1\n if isPrime(i) then pCount = pCount + 1 end\n until i == limit\n print(\"\\nThere are \" .. pCount .. \" primes below \" .. limit)\nend\n","language":"Lua"},{"code":"do\n function totient( n ) -- returns the number of integers k where 1 <= k <= n that are mutually prime to n\n if n < 3 then return 1\n elseif n == 3 then return 2\n else\n local result, v, i = n, n, 2\n while i * i <= v do\n if v % i == 0 then\n while v % i == 0 do v = math.floor( v / i ) end\n result = result - math.floor( result / i )\n end\n if i == 2 then\n i = 1\n end\n i = i + 2\n end\n if v > 1 then result = result - math.floor( result / v ) end\n return result\n end\n end\n -- show the totient function values for the first 25 integers\n io.write( \" n phi(n) remarks\\n\" )\n for n = 1,25 do\n local tn = totient( n )\n io.write( string.format( \"%2d\", n ), \": \", string.format( \"%5d\", tn )\n , ( tn == n - 1 and tn ~= 0 and \" n is prime\" or \"\" )\n , \"\\n\"\n )\n end\n -- use the totient function to count primes\n local n100, n1000, n10000, n100000 = 0, 0, 0, 0\n for n = 1,100000 do\n if totient( n ) == n - 1 then\n if n <= 100 then n100 = n100 + 1 end\n if n <= 1000 then n1000 = n1000 + 1 end\n if n <= 10000 then n10000 = n10000 + 1 end\n if n <= 100000 then n100000 = n100000 + 1 end\n end\n end\n io.write( \"There are \", string.format( \"%6d\", n100 ), \" primes below 100\\n\" )\n io.write( \"There are \", string.format( \"%6d\", n1000 ), \" primes below 1 000\\n\" )\n io.write( \"There are \", string.format( \"%6d\", n10000 ), \" primes below 10 000\\n\" )\n io.write( \"There are \", string.format( \"%6d\", n100000 ), \" primes below 100 000\\n\" )\nend\n","language":"Lua"},{"code":" NORMAL MODE IS INTEGER\n BOOLEAN PRM\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 TOTENT.\n N = NN\n TOT = N\n THROUGH STEP, FOR I=2, 2, I*I.G.N\n WHENEVER REM.(N,I).E.0\n THROUGH DIV, FOR N=N, 0, REM.(N,I).NE.0\nDIV N = N/I\n TOT = TOT-TOT/I\n END OF CONDITIONAL\n WHENEVER I.E.2, I=1\nSTEP CONTINUE\n WHENEVER N.G.1, TOT = TOT-TOT/N\n FUNCTION RETURN TOT\n END OF FUNCTION\n\n COUNT = 0\n PRINT FORMAT HEADER\n THROUGH FRST25, FOR KN=1, 1, KN.G.25\n KTOT = TOTENT.(KN)\n PRM = KTOT.E.KN-1\n WHENEVER PRM, COUNT = COUNT + 1\nFRST25 PRINT FORMAT NUMTOT,KN,KTOT,PRM\n\n PRINT FORMAT NUMPRM,25,COUNT\n\n THROUGH CNTPRM, FOR KN=26, 1, KN.G.100000\n KTOT = TOTENT.(KN)\n WHENEVER KTOT.E.KN-1, COUNT = COUNT+1\n WHENEVER KN.E.100 .OR. KN.E.1000 .OR. REM.(KN,10000).E.0,\n 0 PRINT FORMAT NUMPRM,KN,COUNT\nCNTPRM CONTINUE\n\n VECTOR VALUES HEADER = $19H N TOTIENT PRIME*$\n VECTOR VALUES NUMTOT = $I2,S2,I7,S2,I5*$\n VECTOR VALUES NUMPRM = $22HNUMBER OF PRIMES UP TO,I7,1H:,I6*$\n END OF PROGRAM\n","language":"MAD"},{"code":"Do[\n tmp = EulerPhi[i];\n If[i - 1 == tmp,\n Print[\"\\[CurlyPhi](\", i, \")=\", tmp, \", is prime\"]\n ,\n Print[\"\\[CurlyPhi](\", i, \")=\", tmp]\n ]\n ,\n {i, 25}\n ]\nCount[EulerPhi[Range[100]] - Range[100], -1]\nCount[EulerPhi[Range[1000]] - Range[1000], -1]\nCount[EulerPhi[Range[10000]] - Range[10000], -1]\nCount[EulerPhi[Range[100000]] - Range[100000], -1]\n(*Alternative much faster way of findings the number primes up to a number*)\n(*PrimePi[100]*)\n(*PrimePi[1000]*)\n(*PrimePi[10000]*)\n(*PrimePi[100000]*)\n","language":"Mathematica"},{"code":"main :: [sys_message]\nmain = [Stdout (lay (map showline [1..25])),\n Stdout (lay (map countprimes (25:map (10^) [2..5])))]\n\ncountprimes :: num->[char]\ncountprimes n = \"There are \" ++ show amount ++ \" primes up to \" ++ show n\n where amount = #filter prime [2..n]\n\nshowline :: num->[char]\nshowline n = \"phi(\" ++ show n ++ \") = \" ++ show (totient n) ++ \", \" ++ kind\n where kind = \"prime\", if prime n\n = \"composite\", otherwise\n\nprime :: num->bool\nprime n = totient n = n - 1\n\ntotient :: num->num\ntotient n = loop n n (2:[3, 5..])\n where loop tot n (d:ds)\n = tot, if n<=1\n = tot - tot div n, if d*d > n\n = loop tot n ds, if n mod d ~= 0\n = loop (tot - tot div d) (remfac n d) ds, otherwise\n remfac n d = n, if n mod d ~= 0\n = remfac (n div d) d, otherwise\n","language":"Miranda"},{"code":"MODULE TotientFunction;\nFROM InOut IMPORT WriteString, WriteCard, WriteLn;\n\nVAR count, n, tot: CARDINAL;\n\nPROCEDURE totient(n: CARDINAL): CARDINAL;\n VAR tot, i: CARDINAL;\nBEGIN\n tot := n;\n i := 2;\n WHILE i*i <= n DO\n IF n MOD i = 0 THEN\n WHILE n MOD i = 0 DO\n n := n DIV i\n END;\n DEC(tot, tot DIV i)\n END;\n IF i=2 THEN i := 1 END;\n INC(i, 2)\n END;\n IF n>1 THEN\n DEC(tot, tot DIV n)\n END;\n RETURN tot\nEND totient;\n\nPROCEDURE ShowPrimeCount(n, count: CARDINAL);\nBEGIN\n WriteString(\"Number of primes up to\");\n WriteCard(n, 6);\n WriteString(\": \");\n WriteCard(count, 4);\n WriteLn\nEND ShowPrimeCount;\n\nBEGIN\n count := 0;\n\n WriteString(\" N Totient Prime\");\n WriteLn;\n FOR n := 1 TO 25 DO\n tot := totient(n);\n WriteCard(n, 2);\n WriteCard(tot, 9);\n IF tot = n-1 THEN\n WriteString(\" Yes\");\n INC(count)\n ELSE\n WriteString(\" No\")\n END;\n WriteLn\n END;\n\n ShowPrimeCount(25, count);\n\n FOR n := 26 TO 10000 DO\n IF totient(n) = n-1 THEN INC(count) END;\n IF (n=100) OR (n=1000) OR (n=10000) THEN\n ShowPrimeCount(n, count)\n END;\n END\nEND TotientFunction.\n","language":"Modula-2"},{"code":"import strformat\n\nfunc totient(n: int): int =\n var tot = n\n var nn = n\n var i = 2\n while i * i <= nn:\n if nn mod i == 0:\n while nn mod i == 0:\n nn = nn div i\n dec tot, tot div i\n if i == 2:\n i = 1\n inc i, 2\n if nn > 1:\n dec tot, tot div nn\n tot\n\necho \" n φ prime\"\necho \"---------------\"\nvar count = 0\nfor n in 1..25:\n let tot = totient(n)\n let isPrime = n - 1 == tot\n if isPrime:\n inc count\n echo fmt\"{n:2} {tot:2} {isPrime}\"\necho \"\"\necho fmt\"Number of primes up to {25:>6} = {count:>4}\"\nfor n in 26..100_000:\n let tot = totient(n)\n if tot == n - 1:\n inc count\n if n == 100 or n == 1000 or n mod 10_000 == 0:\n echo fmt\"Number of primes up to {n:>6} = {count:>4}\"\n","language":"Nim"},{"code":"{$IFDEF FPC}\n {$MODE DELPHI}\n{$IFEND}\nfunction gcd_mod(u, v: NativeUint): NativeUint;inline;\n//prerequisites u > v and u,v > 0\n var\n t: NativeUInt;\n begin\n repeat\n t := u;\n u := v;\n v := t mod v;\n until v = 0;\n gcd_mod := u;\n end;\n\nfunction Totient(n:NativeUint):NativeUint;\nvar\n i : NativeUint;\nBegin\n result := 1;\n For i := 2 to n do\n inc(result,ORD(GCD_mod(n,i)=1));\nend;\n\nfunction CheckPrimeTotient(n:NativeUint):Boolean;inline;\nbegin\n result := (Totient(n) = (n-1));\nend;\n\nprocedure OutCountPrimes(n:NativeUInt);\nvar\n i,cnt : NativeUint;\nbegin\n cnt := 0;\n For i := 1 to n do\n inc(cnt,Ord(CheckPrimeTotient(i)));\n writeln(n:10,cnt:8);\nend;\n\nprocedure display(n:NativeUint);\nvar\n idx,phi : NativeUint;\nBegin\n if n = 0 then\n EXIT;\n writeln('number n':5,'Totient(n)':11,'isprime':8);\n For idx := 1 to n do\n Begin\n phi := Totient(idx);\n writeln(idx:4,phi:10,(phi=(idx-1)):12);\n end\nend;\nvar\n i : NativeUint;\nBegin\n display(25);\n\n writeln('Limit primecount');\n i := 100;\n repeat\n OutCountPrimes(i);\n i := i*10;\n until i >100000;\nend.\n","language":"Pascal"},{"code":"function totient(n:NativeUInt):NativeUInt;\nconst\n //delta of numbers not divisible by 2,3,5 (0_1+6->7+4->11 ..+6->29+2->3_1\n delta : array[0..7] of NativeUint = (6,4,2,4,2,4,6,2);\nvar\n i, quot,idx: NativeUint;\nBegin\n // div mod by constant is fast.\n //i = 2\n result := n;\n if (2*2 <= n) then\n Begin\n IF not(ODD(n)) then\n Begin\n // remove numbers with factor 2,4,8,16, ...\n while not(ODD(n)) do\n n := n DIV 2;\n //remove count of multiples of 2\n dec(result,result DIV 2);\n end;\n end;\n //i = 3\n If (3*3 <= n) AND (n mod 3 = 0) then\n Begin\n repeat\n quot := n DIV 3;\n IF n <> quot*3 then\n BREAK\n else\n n := quot;\n until false;\n dec(result,result DIV 3);\n end;\n //i = 5\n If (5*5 <= n) AND (n mod 5 = 0) then\n Begin\n repeat\n quot := n DIV 5;\n IF n <> quot*5 then\n BREAK\n else\n n := quot;\n until false;\n dec(result,result DIV 5);\n end;\n i := 7;\n idx := 1;\n //i = 7,11,13,17,19,23,29, ...49 ..\n while i*i <= n do\n Begin\n quot := n DIV i;\n if n = quot*i then\n Begin\n repeat\n IF n <> quot*i then\n BREAK\n else\n n := quot;\n quot := n DIV i;\n until false;\n dec(result,result DIV i);\n end;\n i := i + delta[idx];\n idx := (idx+1) AND 7;\n end;\n if n> 1 then\n dec(result,result div n);\nend;\n","language":"Pascal"},{"code":"use utf8;\nbinmode STDOUT, \":utf8\";\n\nsub gcd {\n my ($u, $v) = @_;\n while ($v) {\n ($u, $v) = ($v, $u % $v);\n }\n return abs($u);\n}\n\npush @𝜑, 0;\nfor $t (1..10000) {\n push @𝜑, scalar grep { 1 == gcd($_,$t) } 1..$t;\n}\n\nprintf \"𝜑(%2d) = %3d%s\\n\", $_, $𝜑[$_], $_ - $𝜑[$_] - 1 ? '' : ' Prime' for 1 .. 25;\nprint \"\\n\";\n\nfor $limit (100, 1000, 10000) {\n printf \"Count of primes <= $limit: %d\\n\", scalar grep {$_ == $𝜑[$_] + 1} 0..$limit;\n}\n","language":"Perl"},{"code":"use utf8;\nbinmode STDOUT, \":utf8\";\n\nuse ntheory qw(euler_phi);\n\nmy @𝜑 = euler_phi(0,10000); # Returns list of all values in range\n\nprintf \"𝜑(%2d) = %3d%s\\n\", $_, $𝜑[$_], $_ - $𝜑[$_] - 1 ? '' : ' Prime' for 1 .. 25;\nprint \"\\n\";\n\nfor $limit (100, 1000, 10000) {\n printf \"Count of primes <= $limit: %d\\n\", scalar grep {$_ == $𝜑[$_] + 1} 0..$limit;\n}\n","language":"Perl"},{"code":"(phixonline)-->\n <span style=\"color: #008080;\">function</span> <span style=\"color: #000000;\">totient</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;\">integer</span> <span style=\"color: #000000;\">tot</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;\">2</span>\n <span style=\"color: #008080;\">while</span> <span style=\"color: #000000;\">i</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: #008080;\">do</span>\n <span style=\"color: #008080;\">if</span> <span style=\"color: #7060A8;\">mod</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;\">0</span> <span style=\"color: #008080;\">then</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;\">n</span> <span style=\"color: #0000FF;\">/=</span> <span style=\"color: #000000;\">i</span>\n <span style=\"color: #008080;\">if</span> <span style=\"color: #7060A8;\">mod</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;\">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: #008080;\">end</span> <span style=\"color: #008080;\">while</span>\n <span style=\"color: #000000;\">tot</span> <span style=\"color: #0000FF;\">-=</span> <span style=\"color: #000000;\">tot</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: #000000;\">i</span> <span style=\"color: #0000FF;\">+=</span> <span style=\"color: #008080;\">iff</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;\">1</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;\">while</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;\">then</span>\n <span style=\"color: #000000;\">tot</span> <span style=\"color: #0000FF;\">-=</span> <span style=\"color: #000000;\">tot</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: #008080;\">return</span> <span style=\"color: #000000;\">tot</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;\">\" n phi prime\\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: #004080;\">integer</span> <span style=\"color: #000000;\">count</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">0</span>\n <span style=\"color: #008080;\">for</span> <span style=\"color: #000000;\">n</span><span style=\"color: #0000FF;\">=</span><span style=\"color: #000000;\">1</span> <span style=\"color: #008080;\">to</span> <span style=\"color: #000000;\">25</span> <span style=\"color: #008080;\">do</span>\n <span style=\"color: #004080;\">integer</span> <span style=\"color: #000000;\">tot</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">totient</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">n</span><span style=\"color: #0000FF;\">),</span>\n <span style=\"color: #000000;\">prime</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;\">1</span><span style=\"color: #0000FF;\">=</span><span style=\"color: #000000;\">tot</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #000000;\">count</span> <span style=\"color: #0000FF;\">+=</span> <span style=\"color: #000000;\">prime</span>\n <span style=\"color: #004080;\">string</span> <span style=\"color: #000000;\">isp</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #008080;\">iff</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">prime</span><span style=\"color: #0000FF;\">?</span><span style=\"color: #008000;\">\"true\"</span><span style=\"color: #0000FF;\">:</span><span style=\"color: #008000;\">\"false\"</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;\">\"%2d %2d %s\\n\"</span><span style=\"color: #0000FF;\">,{</span><span style=\"color: #000000;\">n</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">tot</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">isp</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;\">\"\\nNumber of primes up to 25 = %d\\n\"</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">count</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #008080;\">for</span> <span style=\"color: #000000;\">n</span><span style=\"color: #0000FF;\">=</span><span style=\"color: #000000;\">26</span> <span style=\"color: #008080;\">to</span> <span style=\"color: #000000;\">100000</span> <span style=\"color: #008080;\">do</span>\n <span style=\"color: #000000;\">count</span> <span style=\"color: #0000FF;\">+=</span> <span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">totient</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><span style=\"color: #000000;\">1</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;\">n</span><span style=\"color: #0000FF;\">,{</span><span style=\"color: #000000;\">100</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">1000</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">10000</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">100000</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;\">\"Number of primes up to %-6d = %d\\n\"</span><span style=\"color: #0000FF;\">,{</span><span style=\"color: #000000;\">n</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: #008080;\">end</span> <span style=\"color: #008080;\">for</span>\n<!--\n","language":"Phix"},{"code":"(gc 32)\n(de gcd (A B)\n (until (=0 B)\n (let M (% A B)\n (setq A B B M) ) )\n (abs A) )\n(de totient (N)\n (let C 0\n (for I N\n (and (=1 (gcd N I)) (inc 'C)) )\n (cons C (= C (dec N))) ) )\n(de p? (N)\n (let C 0\n (for A N\n (and\n (cdr (totient A))\n (inc 'C) ) )\n C ) )\n(let Fmt (3 7 10)\n (tab Fmt \"N\" \"Phi\" \"Prime?\")\n (tab Fmt \"-\" \"---\" \"------\")\n (for N 25\n (tab Fmt\n N\n (car (setq @ (totient N)))\n (cdr @) ) ) )\n(println\n (mapcar p? (25 100 1000 10000 100000)) )\n","language":"PicoLisp"},{"code":"totientFunction: procedure options(main);\n totient: procedure(nn) returns(fixed);\n declare (nn, n, i, tot) fixed;\n n = nn;\n tot = n;\n do i=2 repeat(i+2) while(i*i <= n);\n if mod(n,i) = 0 then do;\n do while(mod(n,i) = 0);\n n = n / i;\n end;\n tot = tot - tot / i;\n end;\n if i=2 then i=1;\n end;\n if n>1 then tot = tot - tot/n;\n return(tot);\n end totient;\n\n showPrimeCount: procedure(n, primeCount);\n declare (n, primeCount) fixed;\n put skip edit('There are', primeCount, ' primes up to', n) (A,F(5),A,F(6));\n end showPrimeCount;\n\n declare (n, primeCount, tot) fixed;\n do n = 1 to 25;\n tot = totient(n);\n put edit('phi(', n, ') = ', tot) (A,F(2),A,F(2));\n if tot = n-1 then do;\n put list('; prime');\n primeCount = primeCount + 1;\n end;\n put skip;\n end;\n\n call showPrimeCount(25, primeCount);\n do n = 26 to 10000;\n if totient(n) = n-1 then primeCount = primeCount + 1;\n if n=100 | n=1000 | n=10000 then\n call showPrimeCount(n, primeCount);\n end;\nend totientFunction;\n","language":"PL-I"},{"code":"100H:\nBDOS: PROCEDURE (F,A); DECLARE F BYTE, A ADDRESS; GO TO 5; END BDOS;\nEXIT: PROCEDURE; GO TO 0; END EXIT;\nPRINT: PROCEDURE (S); DECLARE S ADDRESS; CALL BDOS(9,S); END PRINT;\n\nPRINT$NUM: PROCEDURE (N);\n DECLARE (N, P) ADDRESS, CH BASED P BYTE;\n DECLARE S (6) BYTE INITIAL ('.....$');\n P = .S(5);\nDIGIT:\n P = P-1;\n CH = '0' + N MOD 10;\n IF (N := N/10) > 0 THEN GO TO DIGIT;\n CALL PRINT(P);\nEND PRINT$NUM;\n\nTOTIENT: PROCEDURE (N) ADDRESS;\n DECLARE (TOT, N, I) ADDRESS;\n TOT = N;\n I = 2;\n DO WHILE I*I <= N;\n IF N MOD I = 0 THEN DO;\n DO WHILE (N := N / I) MOD I = 0; END;\n TOT = TOT - TOT / I;\n END;\n IF I=2 THEN I=1;\n I = I+2;\n END;\n IF N > 1 THEN TOT = TOT - TOT / N;\n RETURN TOT;\nEND TOTIENT;\n\nSHOW$PRIME$COUNT: PROCEDURE (N, COUNT);\n DECLARE (N, COUNT) ADDRESS;\n CALL PRINT(.'THERE ARE $');\n CALL PRINT$NUM(COUNT);\n CALL PRINT(.' PRIMES UP TO $');\n CALL PRINT$NUM(N);\n CALL PRINT(.(13,10,'$'));\nEND SHOW$PRIME$COUNT;\n\nDECLARE (N, TOT) ADDRESS;\nDECLARE PRIME$COUNT ADDRESS INITIAL (0);\n\nDO N = 1 TO 25;\n CALL PRINT(.'PHI($');\n CALL PRINT$NUM(N);\n CALL PRINT(.') = $');\n CALL PRINT$NUM(TOT := TOTIENT(N));\n IF TOT = N-1 THEN DO;\n CALL PRINT(.'; PRIME$');\n PRIME$COUNT = PRIME$COUNT + 1;\n END;\n CALL PRINT(.(13,10,'$'));\nEND;\n\nCALL SHOW$PRIME$COUNT(25, PRIME$COUNT);\nDO N = 26 TO 10000;\n IF TOTIENT(N) = N-1 THEN\n PRIME$COUNT = PRIME$COUNT + 1;\n IF N=100 OR N=1000 OR N=10000 THEN\n CALL SHOW$PRIME$COUNT(N, PRIME$COUNT);\nEND;\n\nCALL EXIT;\nEOF\n","language":"PL-M"},{"code":"from math import gcd\n\ndef φ(n):\n return sum(1 for k in range(1, n + 1) if gcd(n, k) == 1)\n\nif __name__ == '__main__':\n def is_prime(n):\n return φ(n) == n - 1\n\n for n in range(1, 26):\n print(f\" φ({n}) == {φ(n)}{', is prime' if is_prime(n) else ''}\")\n count = 0\n for n in range(1, 10_000 + 1):\n count += is_prime(n)\n if n in {100, 1000, 10_000}:\n print(f\"Primes up to {n}: {count}\")\n","language":"Python"},{"code":" [ 0 swap dup times\n [ i over gcd\n 1 = rot + swap ]\n drop ] is totient ( n --> n )\n\n [ 0 temp put\n times\n [ i dup 1+ totient\n = temp tally ]\n temp take ] is primecount ( n --> n )\n\n 25 times\n [ say \"The totient of \"\n i^ 1+ dup echo\n say \" is \"\n dup totient dup echo\n say \", so it is \"\n 1+ != if say \"not \"\n say \"prime.\" cr ]\n cr\n ' [ 100 1000 10000 100000 ]\n witheach\n [ say \"There are \"\n dup primecount echo\n say \" primes up to \" echo\n say \".\" cr ]\n","language":"Quackery"},{"code":"#lang racket\n\n(require math/number-theory)\n\n(define (prime*? n) (= (totient n) (sub1 n)))\n\n(for ([n (in-range 1 26)])\n (printf \"φ(~a) = ~a~a~a\\n\"\n n\n (totient n)\n (if (prime*? n) \" is prime\" \"\")\n (if (prime? n) \" (confirmed)\" \"\")))\n\n(for/fold ([count 0] #:result (void)) ([n (in-range 1 10001)])\n (define new-count (if (prime*? n) (add1 count) count))\n (when (member n '(100 1000 10000))\n (printf \"Primes up to ~a: ~a\\n\" n new-count))\n new-count)\n","language":"Racket"},{"code":"use Prime::Factor;\n\nmy \\𝜑 = 0, |(1..*).hyper.map: -> \\t { t * [*] t.&prime-factors.squish.map: { 1 - 1/$_ } }\n\nprintf \"𝜑(%2d) = %3d %s\\n\", $_, 𝜑[$_], $_ - 𝜑[$_] - 1 ?? '' !! 'Prime' for 1 .. 25;\n\n(1e2, 1e3, 1e4, 1e5).map: -> $limit {\n say \"\\nCount of primes <= $limit: \" ~ +(^$limit).grep: {$_ == 𝜑[$_] + 1}\n}\n","language":"Raku"},{"code":"/*REXX program calculates the totient numbers for a range of numbers, and count primes. */\nparse arg N . /*obtain optional argument from the CL.*/\nif N=='' | N==\",\" then N= 25 /*Not specified? Then use the default.*/\ntell= N>0 /*N positive>? Then display them all. */\nN= abs(N) /*use the absolute value of N for loop.*/\nw= length(N) /*W: is used in aligning the output. */\nprimes= 0 /*the number of primes found (so far).*/\n /*if N was negative, only count primes.*/\n do j=1 for N; T= phi(j) /*obtain totient number for a number. */\n prime= word('(prime)', 1 + (T \\== j-1 ) ) /*determine if J is a prime number. */\n if prime\\=='' then primes= primes + 1 /*if a prime, then bump the prime count*/\n if tell then say 'totient number for ' right(j, w) \" ──► \" right(T, w) ' ' prime\n end /*j*/\nsay\nsay right(primes, w) ' primes detected for numbers up to and including ' N\nexit 0 /*stick a fork in it, we're all done. */\n/*──────────────────────────────────────────────────────────────────────────────────────*/\ngcd: parse arg x,y; do until y==0; parse value x//y y with y x\n end /*until*/; return x\n/*──────────────────────────────────────────────────────────────────────────────────────*/\nphi: procedure; parse arg z; if z==1 then return 1\n #= 1\n do m=2 for z-2; if gcd(m, z)==1 then #= # + 1\n end /*m*/; return #\n","language":"REXX"},{"code":"/*REXX program calculates the totient numbers for a range of numbers, and count primes. */\nparse arg N . /*obtain optional argument from the CL.*/\nif N=='' | N==\",\" then N= 25 /*Not specified? Then use the default.*/\ntell= N>0 /*N positive>? Then display them all. */\nN= abs(N) /*use the absolute value of N for loop.*/\nw= length(N) /*W: is used in aligning the output. */\nprimes= 0 /*the number of primes found (so far).*/\n /*if N was negative, only count primes.*/\n do j=1 for N; T= phi(j) /*obtain totient number for a number. */\n prime= word('(prime)', 1 + (T \\== j-1 ) ) /*determine if J is a prime number. */\n if prime\\=='' then primes= primes + 1 /*if a prime, then bump the prime count*/\n if tell then say 'totient number for ' right(j, w) \" ──► \" right(T, w) ' ' prime\n end /*j*/\nsay\nsay right(primes, w) ' primes detected for numbers up to and including ' N\nexit 0 /*stick a fork in it, we're all done. */\n/*──────────────────────────────────────────────────────────────────────────────────────*/\nphi: procedure; parse arg z; if z==1 then return 1\n #= 1\n do m=2 for z-2; parse value m z with x y\n do until y==0; parse value x//y y with y x\n end /*until*/\n if x==1 then #= # + 1\n end /*m*/\n return #\n","language":"REXX"},{"code":"require \"prime\"\n\ndef 𝜑(n)\n n.prime_division.inject(1){|res, (pr, exp)| res * (pr-1) * pr**(exp-1) }\nend\n\n1.upto 25 do |n|\n tot = 𝜑(n)\n puts \"#{n}\\t #{tot}\\t #{\"prime\" if n-tot==1}\"\nend\n\n[100, 1_000, 10_000, 100_000].each do |u|\n puts \"Number of primes up to #{u}: #{(1..u).count{|n| n-𝜑(n) == 1} }\"\nend\n","language":"Ruby"},{"code":"use num::integer::gcd;\n\nfn main() {\n // Compute the totient of the first 25 natural integers\n println!(\"N\\t phi(n)\\t Prime\");\n for n in 1..26 {\n let phi_n = phi(n);\n println!(\"{}\\t {}\\t {:?}\", n, phi_n, phi_n == n - 1);\n }\n\n // Compute the number of prime numbers for various steps\n [1, 100, 1000, 10000, 100000]\n .windows(2)\n .scan(0, |acc, tuple| {\n *acc += (tuple[0]..=tuple[1]).filter(is_prime).count();\n Some((tuple[1], *acc))\n })\n .for_each(|x| println!(\"Until {}: {} prime numbers\", x.0, x.1));\n}\n\nfn is_prime(n: &usize) -> bool {\n phi(*n) == *n - 1\n}\n\nfn phi(n: usize) -> usize {\n (1..=n).filter(|&x| gcd(n, x) == 1).count()\n}\n","language":"Rust"},{"code":"$lines\n\nrem - return p mod q\nfunction mod(p, q = integer) = integer\nend = p - q * (p / q)\n\nrem - return greatest common divisor of x and y\nfunction gcd(x, y = integer) = integer\n var r, temp = integer\n if x < y then\n begin\n temp = x\n x = y\n y = temp\n end\n r = mod(x, y)\n while r <> 0 do\n begin\n x = y\n y = r\n r = mod(x, y)\n end\nend = y\n\nrem - return phi (also called totient) of n\nfunction phi(n = integer) = integer\n var i, count = integer\n count = 1\n for i = 2 to n\n if gcd(n, i) = 1 then count = count + 1\n next i\nend = count\n\nrem - exercise the function\nvar n, totient, count = integer\nprint \" n Phi(n) Prime?\"\nfor n = 1 to 25\n totient = phi(n)\n print using \"#### #### \";n, totient;\n if totient + 1 = n then\n print \"yes\"\n else\n print \"no\"\nnext n\n\nrem - and further test it by counting primes\nprint\ncount = 0\nfor n = 1 to 1000\n if phi(n) = n - 1 then count = count + 1\n if n = 100 then\n print \"Primes up to 100 = \";count\n else if n = 1000 then\n print \"Primes up to 1000 = \";count\nnext n\n\nend\n","language":"S-BASIC"},{"code":"@tailrec\ndef gcd(a: Int, b: Int): Int = if(b == 0) a else gcd(b, a%b)\ndef totientLaz(num: Int): Int = LazyList.range(2, num).count(gcd(num, _) == 1) + 1\n","language":"Scala"},{"code":"def totientPrd(num: Int): Int = {\n @tailrec\n def dTrec(f: Int, n: Int): Int = if(n%f == 0) dTrec(f, n/f) else n\n\n @tailrec\n def tTrec(ac: Int, i: Int, n: Int): Int = if(n != 1){\n if(n%i == 0) tTrec(ac*(i - 1)/i, i + 1, dTrec(i, n))\n else tTrec(ac, i + 1, n)\n }else{\n ac\n }\n\n tTrec(num, 2, num)\n}\n","language":"Scala"},{"code":"@tailrec\ndef scrub(f: Long, num: Long): Long = if(num%f == 0) scrub(f, num/f) else num\ndef totientLazPrd(num: Long): Long = LazyList.iterate((num, 2: Long, num)){case (ac, i, n) => if(n%i == 0) (ac*(i - 1)/i, i + 1, scrub(i, n)) else (ac, i + 1, n)}.find(_._3 == 1).get._1\n","language":"Scala"},{"code":"program totient;\n loop for n in [1..1000000] do\n tot := totient(n);\n if tot = n-1 then prime +:= 1; end if;\n\n if n <= 25 then\n print(lpad(str n, 2), \" \",\n lpad(str tot, 2), \" \",\n if tot = n-1 then \"prime\" else \"\" end if);\n end if;\n\n if n in [1000,10000,100000,1000000] then\n print(lpad(str prime,8), \"primes up to\" + lpad(str n,8));\n end if;\n end loop;\n\n proc totient(n);\n tot := n;\n i := 2;\n loop while i*i <= n do\n if n mod i = 0 then\n loop while n mod i = 0 do\n n div:= i;\n end loop;\n tot -:= tot div i;\n end if;\n if i=2 then i:=3;\n else i+:=2;\n end if;\n end loop;\n if n>1 then\n tot -:= tot div n;\n end if;\n return tot;\n end proc;\nend program;\n","language":"SETL"},{"code":"func 𝜑(n) {\n n.factor_exp.prod {|p|\n (p[0]-1) * p[0]**(p[1]-1)\n }\n}\n","language":"Sidef"},{"code":"for n in (1..25) {\n var totient = 𝜑(n)\n printf(\"𝜑(%2s) = %3s%s\\n\", n, totient, totient==(n-1) ? ' - prime' : '')\n}\n","language":"Sidef"},{"code":"[100, 1_000, 10_000, 100_000].each {|limit|\n var pi = (1..limit -> count_by {|n| 𝜑(n) == (n-1) })\n say \"Number of primes <= #{limit}: #{pi}\"\n}\n","language":"Sidef"},{"code":" REM PRINT THE DATA FOR N=1 TO 25\n LET N = 0\n 10 LET N = N + 1\n IF N = 26 THEN GOTO 100\n GOSUB 1000\n IF T = N - 1 THEN LET P = 1\n IF T <> N - 1 THEN LET P = 0\n PRINT N,\" \", T,\" \",P\n GOTO 10\n 100 REM COUNT PRIMES BELOW 10000\n LET C = 0\n LET N = 2\n 110 GOSUB 1000\n IF T = N - 1 THEN LET C = C + 1\n IF N = 100 THEN PRINT \"There are \", C, \" primes below 100.\"\n IF N = 1000 THEN PRINT \"There are \", C, \" primes below 1000.\"\n IF N = 10000 THEN PRINT \"There are \", C, \" primes below 10000.\"\n LET N = N + 1\n IF N < 10001 THEN GOTO 110\n END\n1000 REM TOTIENT FUNCTION OF INTEGER N\n LET M = 1\n LET T = 0\n1010 IF M > N THEN RETURN\n LET A = N\n LET B = M REM NEED TO RENAME THESE SO THEY ARE PRESERVED\n GOSUB 2000\n IF G = 1 THEN LET T = T + 1\n LET M = M + 1\n GOTO 1010\n2000 REM GCD OF INTEGERS A, B\n2010 IF A>B THEN GOTO 2020\n LET B = B - A\n IF A=0 THEN LET G = B\n IF A=0 THEN RETURN\n2020 LET S = A\n LET A = B\n LET B = S\n GOTO 2010\n","language":"Tiny-BASIC"},{"code":"Private Function totient(ByVal n As Long) As Long\n Dim tot As Long: tot = n\n Dim i As Long: i = 2\n Do While i * i <= n\n If n Mod i = 0 Then\n Do While True\n n = n \\ i\n If n Mod i <> 0 Then Exit Do\n Loop\n tot = tot - tot \\ i\n End If\n i = i + IIf(i = 2, 1, 2)\n Loop\n If n > 1 Then\n tot = tot - tot \\ n\n End If\n totient = tot\nEnd Function\n\nPublic Sub main()\n Debug.Print \" n phi prime\"\n Debug.Print \" --------------\"\n Dim count As Long\n Dim tot As Integer, n As Long\n For n = 1 To 25\n tot = totient(n)\n prime = (n - 1 = tot)\n count = count - prime\n Debug.Print Format(n, \"@@\"); Format(tot, \"@@@@@\"); Format(prime, \"@@@@@@@@\")\n Next n\n Debug.Print\n Debug.Print \"Number of primes up to 25 = \"; Format(count, \"@@@@\")\n For n = 26 To 100000\n count = count - (totient(n) = n - 1)\n Select Case n\n Case 100, 1000, 10000, 100000\n Debug.Print \"Number of primes up to\"; n; String$(6 - Len(CStr(n)), \" \"); \"=\"; Format(count, \"@@@@@\")\n Case Else\n End Select\n Next n\nEnd Sub\n","language":"VBA"},{"code":"Imports System.Linq.Enumerable\n\nModule Module1\n\n Sub Main()\n For i = 1 To 25\n Dim t = Totient(i)\n Console.WriteLine(\"{0}{1}{2}{3}\", i, vbTab, t, If(t = i - 1, vbTab & \"prime\", \"\"))\n Next\n Console.WriteLine()\n\n Dim j = 100\n While j <= 100000\n Console.WriteLine($\"{Range(1, j).Count(Function(x) Totient(x) + 1 = x):n0} primes below {j:n0}\")\n j *= 10\n End While\n End Sub\n\n Function Totient(n As Integer) As Integer\n If n < 3 Then\n Return 1\n End If\n If n = 3 Then\n Return 2\n End If\n\n Dim tot = n\n\n If (n And 1) = 0 Then\n tot >>= 1\n Do\n n >>= 1\n Loop While (n And 1) = 0\n End If\n\n Dim i = 3\n While i * i <= n\n If n Mod i = 0 Then\n tot -= tot \\ i\n Do\n n \\= i\n Loop While (n Mod i) = 0\n End If\n i += 2\n End While\n\n If n > 1 Then\n tot -= tot \\ n\n End If\n\n Return tot\n End Function\n\nEnd Module\n","language":"Visual-Basic-.NET"},{"code":"import \"./fmt\" for Fmt\n\nvar totient = Fn.new { |n|\n var tot = n\n var i = 2\n while (i*i <= n) {\n if (n%i == 0) {\n while(n%i == 0) n = (n/i).floor\n tot = tot - (tot/i).floor\n }\n if (i == 2) i = 1\n i = i + 2\n }\n if (n > 1) tot = tot - (tot/n).floor\n return tot\n}\n\nSystem.print(\" n phi prime\")\nSystem.print(\"---------------\")\nvar count = 0\nfor (n in 1..25) {\n var tot = totient.call(n)\n var isPrime = (n - 1) == tot\n if (isPrime) count = count + 1\n System.print(\"%(Fmt.d(2, n)) %(Fmt.d(2, tot)) %(isPrime)\")\n}\nSystem.print(\"\\nNumber of primes up to 25 = %(count)\")\nfor (n in 26..100000) {\n var tot = totient.call(n)\n if (tot == n - 1) count = count + 1\n if (n == 100 || n == 1000 || n%10000 == 0) {\n System.print(\"\\nNumber of primes up to %(Fmt.d(-6, n)) = %(count)\")\n }\n}\n","language":"Wren"},{"code":"func GCD(N, D); \\Return the greatest common divisor of N and D\nint N, D; \\numerator and denominator\nint R;\n[if D > N then\n [R:= D; D:= N; N:= R]; \\swap D and N\nwhile D > 0 do\n [R:= rem(N/D);\n N:= D;\n D:= R;\n ];\nreturn N;\n]; \\GCD\n\nfunc Totient(N); \\Return the totient of N\nint N, Phi, M;\n[Phi:= 0;\nfor M:= 1 to N do\n if GCD(M, N) = 1 then Phi:= Phi+1;\nreturn Phi;\n];\n\nint N, Phi, Pwr, C, Limit;\n[Text(0, \"n phi is prime^m^j\");\nfor N:= 1 to 25 do\n [IntOut(0, N); ChOut(0, 9\\tab\\);\n Phi:= Totient(N);\n IntOut(0, Phi); ChOut(0, 9\\tab\\);\n Text(0, if Phi = N-1 then \"true\" else \"false\");\n CrLf(0);\n ];\nCrLf(0);\nfor Pwr:= 2 to 4 do\n [C:= 0;\n Limit:= fix(Pow(10.0, float(Pwr)));\n IntOut(0, Limit); ChOut(0, 9\\tab\\);\n for N:= 1 to Limit do\n [Phi:= Totient(N);\n if Phi = N-1 then C:= C+1;\n ];\n IntOut(0, C); CrLf(0);\n ];\n]\n","language":"XPL0"},{"code":"fcn totient(n){ [1..n].reduce('wrap(p,k){ p + (n.gcd(k)==1) }) }\nfcn isPrime(n){ totient(n)==(n - 1) }\n","language":"Zkl"},{"code":"foreach n in ([1..25]){\n println(\"\\u03c6(%2d) ==%3d %s\"\n .fmt(n,totient(n),isPrime(n) and \"is prime\" or \"\"));\n}\n","language":"Zkl"},{"code":"count:=0;\nforeach n in ([1..10_000]){\t// yes, this is sloooow\n count+=isPrime(n);\n if(n==100 or n==1000 or n==10_000)\n println(\"Primes <= %,6d : %,5d\".fmt(n,count));\n}\n","language":"Zkl"}],"string":"[\n {\n \"code\": \"---\\nfrom: http://rosettacode.org/wiki/Totient_function\\nnote: Prime Numbers\\n\",\n \"language\": \"00-META\"\n },\n {\n \"code\": \"The '''totient''' function is also known as:\\n::* Euler's totient function\\n::* Euler's phi totient function\\n::* phi totient function\\n::* <big> Φ </big> function (uppercase Greek phi)\\n::* <big> φ </big> function (lowercase Greek phi)\\n\\n\\n\\n;Definitions (as per number theory):\\nThe totient function:\\n::* counts the integers up to a given positive integer <big>'''n'''</big> that are relatively prime to <big>'''n'''</big>\\n::* counts the integers <big>'''k'''</big> in the range <big>'''1 ≤ k ≤ n'''</big> for which the greatest common divisor <big>'''gcd(n,k)'''</big> is equal to <big>'''1'''</big>\\n::* counts numbers <big>'''≤ n'''</big> and prime to <big>'''n'''</big>\\n\\n\\n\\nIf the totient number (for '''N''') is one less than '''N''', then '''N''' is prime.\\n\\n\\n\\n;Task:\\nCreate a '''totient''' function and: \\n::* Find and display (1 per line) for the 1<sup>st</sup> '''25''' integers:\\n::::* the integer (the index)\\n::::* the totient number for that integer\\n::::* indicate if that integer is prime\\n::* Find and display the ''count'' of the primes up to 100\\n::* Find and display the ''count'' of the primes up to 1,000\\n::* Find and display the ''count'' of the primes up to 10,000\\n::* Find and display the ''count'' of the primes up to 100,000 (optional)\\n\\nShow all output here.\\n\\n\\n;Related task:\\n::* [[Perfect totient numbers]]\\n\\n\\n;Also see:\\n::* [[wp:Euler's_totient_function|Wikipedia: Euler's totient function]].\\n::* [http://mathworld.wolfram.com/TotientFunction.html MathWorld: totient function].\\n::* [[oeis:/A000010|OEIS: Euler totient function phi(n)]].\\n<br/>\\n\\n\",\n \"language\": \"00-TASK\"\n },\n {\n \"code\": \"F f(n)\\n R sum((1..n).filter(k -> gcd(@n, k) == 1).map(k -> 1))\\n\\nF is_prime(n)\\n R f(n) == n - 1\\n\\nL(n) 1..25\\n print(‘ f(#.) == #.’.format(n, f(n))‘’(I is_prime(n) {‘, is prime’} E ‘’))\\nV count = 0\\nL(n) 1..10'000\\n count += is_prime(n)\\n I n C (100, 1000, 10'000)\\n print(‘Primes up to #.: #.’.format(n, count))\\n\",\n \"language\": \"11l\"\n },\n {\n \"code\": \"/* ARM assembly AARCH64 Raspberry PI 3B */\\n/* program totient.s */\\n\\n/************************************/\\n/* Constantes */\\n/************************************/\\n.include \\\"../includeConstantesARM64.inc\\\"\\n.equ MAXI, 25\\n\\n/*********************************/\\n/* Initialized data */\\n/*********************************/\\n.data\\nszMessNumber: .asciz \\\" number @ totient @ @ \\\\n\\\"\\nszCarriageReturn: .asciz \\\"\\\\n\\\"\\nszMessPrime: .asciz \\\" is prime.\\\"\\nszMessSpace: .asciz \\\" \\\"\\nszMessCounterPrime: .asciz \\\"Number of primes to @ : @ \\\\n\\\"\\nszMessOverflow: .asciz \\\"Overflow function isPrime.\\\\n\\\"\\n/*********************************/\\n/* UnInitialized data */\\n/*********************************/\\n.bss\\nsZoneConv: .skip 24\\n/*********************************/\\n/* code section */\\n/*********************************/\\n.text\\n.global main\\nmain:\\n mov x4,#1 // start number\\n1:\\n mov x0,x4\\n bl totient // compute totient\\n mov x5,x0\\n mov x0,x4\\n bl isPrime // control if number is prime\\n mov x6,x0\\n mov x0,x4 // display result\\n ldr x1,qAdrsZoneConv\\n bl conversion10 // call décimal conversion\\n ldr x0,qAdrszMessNumber\\n ldr x1,qAdrsZoneConv // insert conversion in message\\n bl strInsertAtCharInc\\n mov x7,x0\\n mov x0,x5\\n ldr x1,qAdrsZoneConv\\n bl conversion10 // call décimal conversion\\n mov x0,x7\\n ldr x1,qAdrsZoneConv // insert conversion in message\\n bl strInsertAtCharInc\\n mov x7,x0\\n cmp x6,#1\\n ldr x1,qAdrszMessPrime\\n ldr x8,qAdrszMessSpace\\n csel x1,x1,x8,eq\\n mov x0,x7\\n bl strInsertAtCharInc\\n bl affichageMess // display message\\n\\n add x4,x4,#1 // increment number\\n cmp x4,#MAXI // maxi ?\\n ble 1b // and loop\\n\\n mov x4,#2 // first number\\n mov x5,#0 // prime counter\\n ldr x6,iCst1000 // load constantes\\n ldr x7,iCst10000\\n ldr x8,iCst100000\\n2:\\n mov x0,x4\\n bl isPrime\\n cmp x0,#0\\n beq 3f\\n add x5,x5,#1\\n3:\\n add x4,x4,#1\\n cmp x4,#100\\n bne 4f\\n mov x0,#100\\n mov x1,x5\\n bl displayCounter\\n b 7f\\n4:\\n cmp x4,x6 // 1000\\n bne 5f\\n mov x0,x6\\n mov x1,x5\\n bl displayCounter\\n b 7f\\n5:\\n cmp x4,x7 // 10000\\n bne 6f\\n mov x0,x7\\n mov x1,x5\\n bl displayCounter\\n b 7f\\n6:\\n cmp x4,x8 // 100000\\n bne 7f\\n mov x0,x8\\n mov x1,x5\\n bl displayCounter\\n7:\\n cmp x4,x8\\n ble 2b // and loop\\n\\n100: // standard end of the program\\n mov x0, #0 // return code\\n mov x8,EXIT\\n svc #0 // perform the system call\\nqAdrszCarriageReturn: .quad szCarriageReturn\\nqAdrsZoneConv: .quad sZoneConv\\nqAdrszMessNumber: .quad szMessNumber\\nqAdrszMessCounterPrime: .quad szMessCounterPrime\\nqAdrszMessPrime: .quad szMessPrime\\nqAdrszMessSpace: .quad szMessSpace\\niCst1000: .quad 1000\\niCst10000: .quad 10000\\niCst100000: .quad 100000\\n/******************************************************************/\\n/* display counter */\\n/******************************************************************/\\n/* x0 contains limit */\\n/* x1 contains counter */\\ndisplayCounter:\\n stp x1,lr,[sp,-16]! // save registers\\n stp x2,x3,[sp,-16]! // save registers\\n mov x2,x1\\n ldr x1,qAdrsZoneConv\\n bl conversion10 // call décimal conversion\\n ldr x0,qAdrszMessCounterPrime\\n ldr x1,qAdrsZoneConv // insert conversion in message\\n bl strInsertAtCharInc\\n mov x3,x0\\n mov x0,x2\\n ldr x1,qAdrsZoneConv\\n bl conversion10 // call décimal conversion\\n mov x0,x3\\n ldr x1,qAdrsZoneConv // insert conversion in message\\n bl strInsertAtCharInc\\n bl affichageMess\\n100:\\n ldp x2,x3,[sp],16 // restaur registers\\n ldp x1,lr,[sp],16 // restaur registers\\n ret\\n/******************************************************************/\\n/* compute totient of number */\\n/******************************************************************/\\n/* x0 contains number */\\ntotient:\\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 mov x4,x0 // totient\\n mov x5,x0 // save number\\n mov x1,#0 // for first divisor\\n1: // begin loop\\n mul x3,x1,x1 // compute square\\n cmp x3,x5 // compare number\\n bgt 4f // end\\n add x1,x1,#2 // next divisor\\n udiv x2,x5,x1\\n msub x3,x1,x2,x5 // compute remainder\\n cmp x3,#0 // remainder null ?\\n bne 3f\\n2: // begin loop 2\\n udiv x2,x5,x1\\n msub x3,x1,x2,x5 // compute remainder\\n cmp x3,#0\\n csel x5,x2,x5,eq // new value = quotient\\n beq 2b\\n\\n udiv x2,x4,x1 // divide totient\\n sub x4,x4,x2 // compute new totient\\n3:\\n cmp x1,#2 // first divisor ?\\n mov x0,1\\n csel x1,x0,x1,eq // divisor = 1\\n b 1b // and loop\\n4:\\n cmp x5,#1 // final value > 1\\n ble 5f\\n mov x0,x4 // totient\\n mov x1,x5 // divide by value\\n udiv x2,x4,x5 // totient divide by value\\n sub x4,x4,x2 // compute new totient\\n5:\\n\\n mov x0,x4\\n100:\\n ldp x4,x5,[sp],16 // restaur registers\\n ldp x2,x3,[sp],16 // restaur registers\\n ldp x1,lr,[sp],16 // restaur registers\\n ret\\n/***************************************************/\\n/* Verification si un nombre est premier */\\n/***************************************************/\\n/* x0 contient le nombre à verifier */\\n/* x0 retourne 1 si premier 0 sinon */\\nisPrime:\\n stp x1,lr,[sp,-16]! // save registres\\n stp x2,x3,[sp,-16]! // save registres\\n mov x2,x0\\n sub x1,x0,#1\\n cmp x2,0\\n beq 99f // retourne zéro\\n cmp x2,2 // pour 1 et 2 retourne 1\\n ble 2f\\n mov x0,#2\\n bl moduloPur64\\n bcs 100f // erreur overflow\\n cmp x0,#1\\n bne 99f // Pas premier\\n cmp x2,3\\n beq 2f\\n mov x0,#3\\n bl moduloPur64\\n blt 100f // erreur overflow\\n cmp x0,#1\\n bne 99f\\n\\n cmp x2,5\\n beq 2f\\n mov x0,#5\\n bl moduloPur64\\n bcs 100f // erreur overflow\\n cmp x0,#1\\n bne 99f // Pas premier\\n\\n cmp x2,7\\n beq 2f\\n mov x0,#7\\n bl moduloPur64\\n bcs 100f // erreur overflow\\n cmp x0,#1\\n bne 99f // Pas premier\\n\\n cmp x2,11\\n beq 2f\\n mov x0,#11\\n bl moduloPur64\\n bcs 100f // erreur overflow\\n cmp x0,#1\\n bne 99f // Pas premier\\n\\n cmp x2,13\\n beq 2f\\n mov x0,#13\\n bl moduloPur64\\n bcs 100f // erreur overflow\\n cmp x0,#1\\n bne 99f // Pas premier\\n\\n cmp x2,17\\n beq 2f\\n mov x0,#17\\n bl moduloPur64\\n bcs 100f // erreur overflow\\n cmp x0,#1\\n bne 99f // Pas premier\\n2:\\n cmn x0,0 // carry à zero pas d'erreur\\n mov x0,1 // premier\\n b 100f\\n99:\\n cmn x0,0 // carry à zero pas d'erreur\\n mov x0,#0 // Pas premier\\n100:\\n ldp x2,x3,[sp],16 // restaur des 2 registres\\n ldp x1,lr,[sp],16 // restaur des 2 registres\\n ret // retour adresse lr x30\\n\\n/**************************************************************/\\n/********************************************************/\\n/* Calcul modulo de b puissance e modulo m */\\n/* Exemple 4 puissance 13 modulo 497 = 445 */\\n/********************************************************/\\n/* x0 nombre */\\n/* x1 exposant */\\n/* x2 modulo */\\nmoduloPur64:\\n stp x1,lr,[sp,-16]! // save registres\\n stp x3,x4,[sp,-16]! // save registres\\n stp x5,x6,[sp,-16]! // save registres\\n stp x7,x8,[sp,-16]! // save registres\\n stp x9,x10,[sp,-16]! // save registres\\n cbz x0,100f\\n cbz x1,100f\\n mov x8,x0\\n mov x7,x1\\n mov x6,1 // resultat\\n udiv x4,x8,x2\\n msub x9,x4,x2,x8 // contient le reste\\n1:\\n tst x7,1\\n beq 2f\\n mul x4,x9,x6\\n umulh x5,x9,x6\\n //cbnz x5,99f\\n mov x6,x4\\n mov x0,x6\\n mov x1,x5\\n bl divisionReg128U\\n cbnz x1,99f // overflow\\n mov x6,x3\\n2:\\n mul x8,x9,x9\\n umulh x5,x9,x9\\n mov x0,x8\\n mov x1,x5\\n bl divisionReg128U\\n cbnz x1,99f // overflow\\n mov x9,x3\\n lsr x7,x7,1\\n cbnz x7,1b\\n mov x0,x6 // result\\n cmn x0,0 // carry à zero pas d'erreur\\n b 100f\\n99:\\n ldr x0,qAdrszMessOverflow\\n bl affichageMess\\n cmp x0,0 // carry à un car erreur\\n mov x0,-1 // code erreur\\n\\n100:\\n ldp x9,x10,[sp],16 // restaur des 2 registres\\n ldp x7,x8,[sp],16 // restaur des 2 registres\\n ldp x5,x6,[sp],16 // restaur des 2 registres\\n ldp x3,x4,[sp],16 // restaur des 2 registres\\n ldp x1,lr,[sp],16 // restaur des 2 registres\\n ret // retour adresse lr x30\\nqAdrszMessOverflow: .quad szMessOverflow\\n/***************************************************/\\n/* division d un nombre de 128 bits par un nombre de 64 bits */\\n/***************************************************/\\n/* x0 contient partie basse dividende */\\n/* x1 contient partie haute dividente */\\n/* x2 contient le diviseur */\\n/* x0 retourne partie basse quotient */\\n/* x1 retourne partie haute quotient */\\n/* x3 retourne le reste */\\ndivisionReg128U:\\n stp x6,lr,[sp,-16]! // save registres\\n stp x4,x5,[sp,-16]! // save registres\\n mov x5,#0 // raz du reste R\\n mov x3,#128 // compteur de boucle\\n mov x4,#0 // dernier bit\\n1:\\n lsl x5,x5,#1 // on decale le reste de 1\\n tst x1,1<<63 // test du bit le plus à gauche\\n lsl x1,x1,#1 // on decale la partie haute du quotient de 1\\n beq 2f\\n orr x5,x5,#1 // et on le pousse dans le reste R\\n2:\\n tst x0,1<<63\\n lsl x0,x0,#1 // puis on decale la partie basse\\n beq 3f\\n orr x1,x1,#1 // et on pousse le bit de gauche dans la partie haute\\n3:\\n orr x0,x0,x4 // position du dernier bit du quotient\\n mov x4,#0 // raz du bit\\n cmp x5,x2\\n blt 4f\\n sub x5,x5,x2 // on enleve le diviseur du reste\\n mov x4,#1 // dernier bit à 1\\n4:\\n // et boucle\\n subs x3,x3,#1\\n bgt 1b\\n lsl x1,x1,#1 // on decale le quotient de 1\\n tst x0,1<<63\\n lsl x0,x0,#1 // puis on decale la partie basse\\n beq 5f\\n orr x1,x1,#1\\n5:\\n orr x0,x0,x4 // position du dernier bit du quotient\\n mov x3,x5\\n100:\\n ldp x4,x5,[sp],16 // restaur des 2 registres\\n ldp x6,lr,[sp],16 // restaur des 2 registres\\n ret // retour adresse lr x30\\n\\n\\n/***************************************************/\\n/* ROUTINES INCLUDE */\\n/***************************************************/\\n.include \\\"../includeARM64.inc\\\"\\n\",\n \"language\": \"AArch64-Assembly\"\n },\n {\n \"code\": \"with Ada.Text_IO;\\nwith Ada.Integer_Text_IO;\\n\\nprocedure Totient is\\n\\n function Totient (N : in Integer) return Integer is\\n Tot : Integer := N;\\n I : Integer;\\n N2 : Integer := N;\\n begin\\n I := 2;\\n while I * I <= N2 loop\\n if N2 mod I = 0 then\\n while N2 mod I = 0 loop\\n N2 := N2 / I;\\n end loop;\\n Tot := Tot - Tot / I;\\n end if;\\n\\n if I = 2 then\\n I := 1;\\n end if;\\n I := I + 2;\\n end loop;\\n\\n if N2 > 1 then\\n Tot := Tot - Tot / N2;\\n end if;\\n\\n return Tot;\\n end Totient;\\n\\n Count : Integer := 0;\\n Tot : Integer;\\n Placeholder : String := \\\" n Phi Is_Prime\\\";\\n Image_N : String renames Placeholder ( 1 .. 3);\\n Image_Phi : String renames Placeholder ( 6 .. 8);\\n Image_Prime : String renames Placeholder (11 .. 17);\\n use Ada.Text_IO;\\n use Ada.Integer_Text_IO;\\nbegin\\n\\n Put_Line (Placeholder);\\n\\n for N in 1 .. 25 loop\\n Tot := Totient (N);\\n\\n if N - 1 = Tot then\\n Count := Count + 1;\\n end if;\\n Put (Image_N, N);\\n Put (Image_Phi, Tot);\\n Image_Prime := (if N - 1 = Tot then \\\" True\\\" else \\\" False\\\");\\n Put_Line (Placeholder);\\n end loop;\\n New_Line;\\n\\n Put_Line (\\\"Number of primes up to \\\" & Integer'(25)'Image &\\\" =\\\" & Count'Image);\\n\\n for N in 26 .. 100_000 loop\\n Tot := Totient (N);\\n\\n if Tot = N - 1 then\\n Count := Count + 1;\\n end if;\\n\\n if N = 100 or N = 1_000 or N mod 10_000 = 0 then\\n Put_Line (\\\"Number of primes up to \\\" & N'Image & \\\" =\\\" & Count'Image);\\n end if;\\n end loop;\\n\\nend Totient;\\n\",\n \"language\": \"Ada\"\n },\n {\n \"code\": \"BEGIN\\n # returns the number of integers k where 1 <= k <= n that are mutually prime to n #\\n PROC totient = ( INT n )INT:\\n IF n < 3 THEN 1\\n ELIF n = 3 THEN 2\\n ELSE\\n INT result := n;\\n INT v := n;\\n INT i := 2;\\n WHILE i * i <= v DO\\n IF v MOD i = 0 THEN\\n WHILE v MOD i = 0 DO v OVERAB i OD;\\n result -:= result OVER i\\n FI;\\n IF i = 2 THEN\\n i := 1\\n FI;\\n i +:= 2\\n OD;\\n IF v > 1 THEN result -:= result OVER v FI;\\n result\\n FI # totient # ;\\n # show the totient function values for the first 25 integers #\\n print( ( \\\" n phi(n) remarks\\\", newline ) );\\n FOR n TO 25 DO\\n INT tn = totient( n );\\n print( ( whole( n, -2 ), \\\": \\\", whole( tn, -5 )\\n , IF tn = n - 1 AND tn /= 0 THEN \\\" n is prime\\\" ELSE \\\"\\\" FI, newline\\n )\\n )\\n OD;\\n # use the totient function to count primes #\\n INT n100 := 0, n1000 := 0, n10000 := 0, n100000 := 0;\\n FOR n TO 100 000 DO\\n IF totient( n ) = n - 1 THEN\\n IF n <= 100 THEN n100 +:= 1 FI;\\n IF n <= 1 000 THEN n1000 +:= 1 FI;\\n IF n <= 10 000 THEN n10000 +:= 1 FI;\\n IF n <= 100 000 THEN n100000 +:= 1 FI\\n FI\\n OD;\\n print( ( \\\"There are \\\", whole( n100, -6 ), \\\" primes below 100\\\", newline ) );\\n print( ( \\\"There are \\\", whole( n1000, -6 ), \\\" primes below 1 000\\\", newline ) );\\n print( ( \\\"There are \\\", whole( n10000, -6 ), \\\" primes below 10 000\\\", newline ) );\\n print( ( \\\"There are \\\", whole( n100000, -6 ), \\\" primes below 100 000\\\", newline ) )\\nEND\\n\",\n \"language\": \"ALGOL-68\"\n },\n {\n \"code\": \"BEGIN\\n\\n% RETURN P MOD Q %\\nINTEGER FUNCTION MOD (P, Q);\\nINTEGER P, Q;\\nBEGIN\\n\\tMOD := P - Q * (P / Q);\\nEND;\\n\\n% RETURN GREATEST COMMON DIVISOR OF X AND Y %\\nINTEGER FUNCTION GCD (X, Y);\\nINTEGER X, Y;\\nBEGIN\\n\\tINTEGER R;\\n\\tIF X < Y THEN\\n\\tBEGIN\\n\\t\\tINTEGER TEMP;\\n\\t\\tTEMP := X;\\n\\t\\tX := Y;\\n\\t\\tY := TEMP;\\n\\tEND;\\n\\tWHILE (R := MOD(X, Y)) <> 0 DO\\n\\tBEGIN\\n\\t\\tX := Y;\\n\\t\\tY := R;\\n\\tEND;\\n\\tGCD := Y;\\nEND;\\n\\n% RETURN PHI (ALSO CALLED TOTIENT) OF N %\\nINTEGER FUNCTION PHI(N);\\nINTEGER N;\\nBEGIN\\n\\tINTEGER I, COUNT;\\n COUNT := 1;\\n FOR I := 2 STEP 1 UNTIL N DO\\n\\tBEGIN\\n\\t\\tIF GCD(N,I) = 1 THEN COUNT := COUNT + 1;\\n \\tEND;\\n\\tPHI := COUNT;\\nEND;\\n\\nCOMMENT - EXERCISE THE FUNCTION;\\nINTEGER N, TOTIENT, COUNT;\\nWRITE(\\\" N PHI(N) PRIME?\\\");\\nFOR N := 1 STEP 1 UNTIL 25 DO\\nBEGIN\\n WRITE(N, (TOTIENT := PHI(N)));\\n WRITEON(IF TOTIENT = (N-1) THEN \\\" YES\\\" ELSE \\\" NO\\\");\\nEND;\\n\\nCOMMENT - AND USE IT TO COUNT PRIMES;\\nWRITE(\\\"\\\");\\nCOUNT := 0;\\nFOR N := 1 STEP 1 UNTIL 1000 DO\\nBEGIN\\n \\tIF PHI(N) = (N-1) THEN COUNT := COUNT + 1;\\n \\tIF N = 100 THEN\\n\\t\\tWRITE(\\\"PRIMES UP TO 100 =\\\", COUNT)\\n ELSE IF N = 1000 THEN\\n\\t\\tWRITE(\\\"PRIMES UP TO 1000 =\\\", COUNT);\\nEND;\\n\\n\\nEND\\n\",\n \"language\": \"ALGOL-M\"\n },\n {\n \"code\": \"task←{\\n totient ← 1+.=⍳∨⊢\\n prime ← totient=-∘1\\n\\n ⎕←'Index' 'Totient' 'Prime',(⊢⍪totient¨,[÷2]prime¨)⍳25\\n {⎕←'There are' (+/prime¨⍳⍵) 'primes below' ⍵}¨100 1000 10000\\n}\\n\",\n \"language\": \"APL\"\n },\n {\n \"code\": \"/* ARM assembly Raspberry PI or android with termux */\\n/* program totient.s */\\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/* for constantes see task include a file in arm assembly */\\n/************************************/\\n/* Constantes */\\n/************************************/\\n.include \\\"../constantes.inc\\\"\\n.equ MAXI, 25\\n\\n/*********************************/\\n/* Initialized data */\\n/*********************************/\\n.data\\nszMessNumber: .asciz \\\" number @ totient @ @ \\\\n\\\"\\nszCarriageReturn: .asciz \\\"\\\\n\\\"\\nszMessPrime: .asciz \\\" is prime.\\\"\\nszMessSpace: .asciz \\\" \\\"\\nszMessCounterPrime: .asciz \\\"Number of primes to @ : @ \\\\n\\\"\\n/*********************************/\\n/* UnInitialized data */\\n/*********************************/\\n.bss\\nsZoneConv: .skip 24\\n/*********************************/\\n/* code section */\\n/*********************************/\\n.text\\n.global main\\nmain:\\n mov r4,#1 @ start number\\n1:\\n mov r0,r4\\n bl totient @ compute totient\\n mov r5,r0\\n mov r0,r4\\n bl isPrime @ control if number is prime\\n mov r6,r0\\n mov r0,r4 @ display result\\n ldr r1,iAdrsZoneConv\\n bl conversion10 @ call décimal conversion\\n ldr r0,iAdrszMessNumber\\n ldr r1,iAdrsZoneConv @ insert conversion in message\\n bl strInsertAtCharInc\\n mov r7,r0\\n mov r0,r5\\n ldr r1,iAdrsZoneConv\\n bl conversion10 @ call décimal conversion\\n mov r0,r7\\n ldr r1,iAdrsZoneConv @ insert conversion in message\\n bl strInsertAtCharInc\\n mov r7,r0\\n cmp r6,#1\\n ldreq r1,iAdrszMessPrime\\n ldrne r1,iAdrszMessSpace\\n mov r0,r7\\n bl strInsertAtCharInc\\n bl affichageMess @ display message\\n\\n add r4,r4,#1 @ increment number\\n cmp r4,#MAXI @ maxi ?\\n ble 1b @ and loop\\n\\n mov r4,#2 @ first number\\n mov r5,#0 @ prime counter\\n ldr r6,iCst1000 @ load constantes\\n ldr r7,iCst10000\\n ldr r8,iCst100000\\n2:\\n mov r0,r4\\n bl isPrime\\n cmp r0,#0\\n beq 3f\\n add r5,r5,#1\\n3:\\n add r4,r4,#1\\n cmp r4,#100\\n bne 4f\\n mov r0,#100\\n mov r1,r5\\n bl displayCounter\\n b 7f\\n4:\\n cmp r4,r6 @ 1000\\n bne 5f\\n mov r0,r6\\n mov r1,r5\\n bl displayCounter\\n b 7f\\n5:\\n cmp r4,r7 @ 10000\\n bne 6f\\n mov r0,r7\\n mov r1,r5\\n bl displayCounter\\n b 7f\\n6:\\n cmp r4,r8 @ 100000\\n bne 7f\\n mov r0,r8\\n mov r1,r5\\n bl displayCounter\\n7:\\n cmp r4,r8\\n ble 2b @ and loop\\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\\niAdrszCarriageReturn: .int szCarriageReturn\\niAdrsZoneConv: .int sZoneConv\\niAdrszMessNumber: .int szMessNumber\\niAdrszMessCounterPrime: .int szMessCounterPrime\\niAdrszMessPrime: .int szMessPrime\\niAdrszMessSpace: .int szMessSpace\\niCst1000: .int 1000\\niCst10000: .int 10000\\niCst100000: .int 100000\\n/******************************************************************/\\n/* display counter */\\n/******************************************************************/\\n/* r0 contains limit */\\n/* r1 contains counter */\\ndisplayCounter:\\n push {r1-r3,lr} @ save registers\\n mov r2,r1\\n ldr r1,iAdrsZoneConv\\n bl conversion10 @ call décimal conversion\\n ldr r0,iAdrszMessCounterPrime\\n ldr r1,iAdrsZoneConv @ insert conversion in message\\n bl strInsertAtCharInc\\n mov r3,r0\\n mov r0,r2\\n ldr r1,iAdrsZoneConv\\n bl conversion10 @ call décimal conversion\\n mov r0,r3\\n ldr r1,iAdrsZoneConv @ insert conversion in message\\n bl strInsertAtCharInc\\n bl affichageMess\\n100:\\n pop {r1-r3,pc} @ restaur registers\\n/******************************************************************/\\n/* compute totient of number */\\n/******************************************************************/\\n/* r0 contains number */\\ntotient:\\n push {r1-r5,lr} @ save registers\\n mov r4,r0 @ totient\\n mov r5,r0 @ save number\\n mov r1,#0 @ for first divisor\\n1: @ begin loop\\n mul r3,r1,r1 @ compute square\\n cmp r3,r5 @ compare number\\n bgt 4f @ end\\n add r1,r1,#2 @ next divisor\\n mov r0,r5\\n bl division\\n cmp r3,#0 @ remainder null ?\\n bne 3f\\n2: @ begin loop 2\\n mov r0,r5\\n bl division\\n cmp r3,#0\\n moveq r5,r2 @ new value = quotient\\n beq 2b\\n\\n mov r0,r4 @ totient\\n bl division\\n sub r4,r4,r2 @ compute new totient\\n3:\\n cmp r1,#2 @ first divisor ?\\n moveq r1,#1 @ divisor = 1\\n b 1b @ and loop\\n4:\\n cmp r5,#1 @ final value > 1\\n ble 5f\\n mov r0,r4 @ totient\\n mov r1,r5 @ divide by value\\n bl division\\n sub r4,r4,r2 @ compute new totient\\n5:\\n\\n mov r0,r4\\n100:\\n pop {r1-r5,pc} @ restaur registers\\n\\n/***************************************************/\\n/* check if a number is prime */\\n/***************************************************/\\n/* r0 contains the number */\\n/* r0 return 1 if prime 0 else */\\n@2147483647\\n@4294967297\\n@131071\\nisPrime:\\n push {r1-r6,lr} @ save registers\\n cmp r0,#0\\n beq 90f\\n cmp r0,#17\\n bhi 1f\\n cmp r0,#3\\n bls 80f @ for 1,2,3 return prime\\n cmp r0,#5\\n beq 80f @ for 5 return prime\\n cmp r0,#7\\n beq 80f @ for 7 return prime\\n cmp r0,#11\\n beq 80f @ for 11 return prime\\n cmp r0,#13\\n beq 80f @ for 13 return prime\\n cmp r0,#17\\n beq 80f @ for 17 return prime\\n1:\\n tst r0,#1 @ even ?\\n beq 90f @ yes -> not prime\\n mov r2,r0 @ save number\\n sub r1,r0,#1 @ exposant n - 1\\n mov r0,#3 @ base\\n bl moduloPuR32 @ compute base power n - 1 modulo n\\n cmp r0,#1\\n bne 90f @ if <> 1 -> not prime\\n\\n mov r0,#5\\n bl moduloPuR32\\n cmp r0,#1\\n bne 90f\\n\\n mov r0,#7\\n bl moduloPuR32\\n cmp r0,#1\\n bne 90f\\n\\n mov r0,#11\\n bl moduloPuR32\\n cmp r0,#1\\n bne 90f\\n\\n mov r0,#13\\n bl moduloPuR32\\n cmp r0,#1\\n bne 90f\\n\\n mov r0,#17\\n bl moduloPuR32\\n cmp r0,#1\\n bne 90f\\n80:\\n mov r0,#1 @ is prime\\n b 100f\\n90:\\n mov r0,#0 @ no prime\\n100: @ fin standard de la fonction\\n pop {r1-r6,lr} @ restaur des registres\\n bx lr @ retour de la fonction en utilisant lr\\n/********************************************************/\\n/* Calcul modulo de b puissance e modulo m */\\n/* Exemple 4 puissance 13 modulo 497 = 445 */\\n/* */\\n/********************************************************/\\n/* r0 nombre */\\n/* r1 exposant */\\n/* r2 modulo */\\n/* r0 return result */\\nmoduloPuR32:\\n push {r1-r7,lr} @ save registers\\n cmp r0,#0 @ verif <> zero\\n beq 100f\\n cmp r2,#0 @ verif <> zero\\n beq 100f @ TODO: vérifier les cas erreur\\n1:\\n mov r4,r2 @ save modulo\\n mov r5,r1 @ save exposant\\n mov r6,r0 @ save base\\n mov r3,#1 @ start result\\n\\n mov r1,#0 @ division de r0,r1 par r2\\n bl division32R\\n mov r6,r2 @ base <- remainder\\n2:\\n tst r5,#1 @ exposant even or odd\\n beq 3f\\n umull r0,r1,r6,r3\\n mov r2,r4\\n bl division32R\\n mov r3,r2 @ result <- remainder\\n3:\\n umull r0,r1,r6,r6\\n mov r2,r4\\n bl division32R\\n mov r6,r2 @ base <- remainder\\n\\n lsr r5,#1 @ left shift 1 bit\\n cmp r5,#0 @ end ?\\n bne 2b\\n mov r0,r3\\n100: @ fin standard de la fonction\\n pop {r1-r7,lr} @ restaur des registres\\n bx lr @ retour de la fonction en utilisant lr\\n\\n/***************************************************/\\n/* division number 64 bits in 2 registers by number 32 bits */\\n/***************************************************/\\n/* r0 contains lower part dividende */\\n/* r1 contains upper part dividende */\\n/* r2 contains divisor */\\n/* r0 return lower part quotient */\\n/* r1 return upper part quotient */\\n/* r2 return remainder */\\ndivision32R:\\n push {r3-r9,lr} @ save registers\\n mov r6,#0 @ init upper upper part remainder !!\\n mov r7,r1 @ init upper part remainder with upper part dividende\\n mov r8,r0 @ init lower part remainder with lower part dividende\\n mov r9,#0 @ upper part quotient\\n mov r4,#0 @ lower part quotient\\n mov r5,#32 @ bits number\\n1: @ begin loop\\n lsl r6,#1 @ shift upper upper part remainder\\n lsls r7,#1 @ shift upper part remainder\\n orrcs r6,#1\\n lsls r8,#1 @ shift lower part remainder\\n orrcs r7,#1\\n lsls r4,#1 @ shift lower part quotient\\n lsl r9,#1 @ shift upper part quotient\\n orrcs r9,#1\\n @ divisor sustract upper part remainder\\n subs r7,r2\\n sbcs r6,#0 @ and substract carry\\n bmi 2f @ négative ?\\n\\n @ positive or equal\\n orr r4,#1 @ 1 -> right bit quotient\\n b 3f\\n2: @ negative\\n orr r4,#0 @ 0 -> right bit quotient\\n adds r7,r2 @ and restaur remainder\\n adc r6,#0\\n3:\\n subs r5,#1 @ decrement bit size\\n bgt 1b @ end ?\\n mov r0,r4 @ lower part quotient\\n mov r1,r9 @ upper part quotient\\n mov r2,r7 @ remainder\\n100: @ function end\\n pop {r3-r9,lr} @ restaur registers\\n bx lr\\n\\n\\n/***************************************************/\\n/* ROUTINES INCLUDE */\\n/***************************************************/\\n.include \\\"../affichage.inc\\\"\\n\",\n \"language\": \"ARM-Assembly\"\n },\n {\n \"code\": \"totient: function [n][\\n tot: new n\\n i: 2\\n while -> n >= i * i [\\n if 0 = n % i [\\n while -> 0 = n % i -> n: n / i\\n 'tot - tot / i\\n ]\\n if 2 = i -> i: 1\\n 'i + 2\\n ]\\n if n > 1 -> 'tot - tot / n\\n return tot\\n]\\n\\nprimes: 0\\nloop 1..100000 'i [\\n t: totient i\\n prime?: 1 = i - t\\n if i < 26 [\\n prints ~« Φ(|pad.with:`0` to :string i 2|) = |pad to :string t 2|\\n if prime? -> prints \\\", prime\\\"\\n print \\\"\\\"\\n ]\\n if 50 = i -> print \\\"\\\"\\n if in? i [100 1000 10000 100000] -> print ~« |primes| primes =< |i|\\n if prime? -> 'primes + 1\\n]\\n\",\n \"language\": \"Arturo\"\n },\n {\n \"code\": \"global cptext := a_tab \\\"Nr\\\" a_tab \\\"Phi\\\" a_tab \\\"Prime?`n---------------------------------------------`n\\\"\\n\\ndivisores(num)\\n{\\n\\tserie := \\\"\\\"\\n\\tloop % num\\n\\t\\tif !mod(num,a_index)\\n\\t\\t\\tserie .= a_index \\\",\\\"\\n\\treturn serie\\n}\\n\\ngcd(serieA,serieB)\\n{\\n\\temComum := 0\\n\\tloop,parse,serieA,csv\\n\\t\\tif A_LoopField in %serieB%\\n\\t\\t\\temComum += 1\\n\\treturn emComum\\n}\\t\\n\\t\\t\\nprincipal(voltas,phi:=0)\\n{\\nloop %voltas%\\n{\\ncp := A_Index\\ncpcount := 0\\nnumA := divisores(cp)\\nloop % a_index\\n\\t{\\n\\t\\tnumA := divisores(cp)\\n\\t\\tnumB := divisores(A_Index)\\n\\t\\tfim := gcd(numA,numB)\\n\\t\\tif (fim = 1)\\n\\t\\t\\tcpcount += 1\\n\\t}\\t\\t\\nif (cpcount = cp-1)\\n\\t{\\n\\t\\tif phi\\n\\t\\t\\tcptext .= a_tab cp a_tab cpcount a_tab \\\"1`n\\\"\\n\\t\\ttotalPrimes += 1\\n\\t}\\nelse\\n\\tcptext .= a_tab cp a_tab cpcount a_tab \\\"0`n\\\"\\n}\\nreturn totalPrimes\\n}\\n\\ntotalPrimes := principal(25,1)\\nmsgbox % cptext \\\"`n`ntotal primes = \\\" totalPrimes ; Number 1 is a prime number ? If yes, add 1 to totalPrimes\\ntotalPrimes := principal(100)\\nmsgbox % \\\"total primes in 1 .. 100 = \\\" totalPrimes\\ntotalPrimes := principal(1000)\\t\\t\\t\\t\\t\\t\\t; caution... pure gcd method\\nmsgbox % \\\"total primes in 1 .. 1000 = \\\" totalPrimes ; takes 3 minutes or more\\n;totalPrimes := principal(10000)\\n;msgbox % \\\"total primes in 1 .. 10000 = \\\" totalPrimes\\nExitApp\\n\",\n \"language\": \"AutoHotkey\"\n },\n {\n \"code\": \"# syntax: GAWK -f TOTIENT_FUNCTION.AWK\\nBEGIN {\\n print(\\\" N Phi isPrime\\\")\\n for (n=1; n<=1000000; n++) {\\n tot = totient(n)\\n if (n-1 == tot) {\\n count++\\n }\\n if (n <= 25) {\\n printf(\\\"%2d %3d %s\\\\n\\\",n,tot,(n-1==tot)?\\\"true\\\":\\\"false\\\")\\n if (n == 25) {\\n printf(\\\"\\\\n Limit PrimeCount\\\\n\\\")\\n printf(\\\"%7d %10d\\\\n\\\",n,count)\\n }\\n }\\n else if (n ~ /^100+$/) {\\n printf(\\\"%7d %10d\\\\n\\\",n,count)\\n }\\n }\\n exit(0)\\n}\\nfunction totient(n, i,tot) {\\n tot = n\\n for (i=2; i*i<=n; i+=2) {\\n if (n % i == 0) {\\n while (n % i == 0) {\\n n /= i\\n }\\n tot -= tot / i\\n }\\n if (i == 2) {\\n i = 1\\n }\\n }\\n if (n > 1) {\\n tot -= tot / n\\n }\\n return(tot)\\n}\\n\",\n \"language\": \"AWK\"\n },\n {\n \"code\": \"10 DEFINT A-Z: DIM B$(2): B$(0)=\\\"No\\\": B$(1)=\\\"Yes\\\"\\n20 PRINT \\\" N Totient Prime\\\"\\n30 FOR N=1 TO 25\\n40 GOSUB 200\\n50 P=-(T=N-1)\\n60 C=C+P\\n70 PRINT USING \\\"## ####### \\\\ \\\\\\\";N;T;B$(P)\\n80 NEXT N\\n90 F$=\\\"Number of primes up to ######: ####\\\"\\n100 PRINT USING F$;25;C\\n110 FOR N=26 TO 10000\\n120 GOSUB 200\\n130 C=C-(T=N-1)\\n140 IF N=100 OR N=1000 OR N=10000 THEN PRINT USING F$;N;C\\n150 NEXT N\\n160 END\\n200 REM T = TOTIENT(N)\\n210 T=N: Z=N\\n220 I=2: GOSUB 270\\n230 I=3\\n240 IF I*I<=Z THEN GOSUB 270: I=I+2: GOTO 240\\n250 IF Z>1 THEN T=T-T\\\\Z\\n260 RETURN\\n270 IF Z MOD I<>0 THEN RETURN\\n280 IF Z MOD I=0 THEN Z = Z\\\\I: GOTO 280\\n290 T = T-T\\\\I\\n300 RETURN\\n\",\n \"language\": \"BASIC\"\n },\n {\n \"code\": \"get \\\"libhdr\\\"\\n\\nlet totient(n) = valof\\n$( let tot = n and i = 2\\n while i*i <= n\\n $( if n rem i = 0\\n $( while n rem i = 0 do n := n / i\\n tot := tot - tot/i\\n $)\\n if i=2 then i:=1\\n i := i+2\\n $)\\n resultis n>1 -> tot-tot/n, tot\\n$)\\n\\nlet start() be\\n$( let count = 0\\n writes(\\\" N Totient Prime*N\\\")\\n for n = 1 to 25\\n $( let tot = totient(n)\\n let prime = n-1 = tot\\n if prime then count := count + 1\\n writef(\\\"%I2 %I7 %S*N\\\", n, tot, prime -> \\\" Yes\\\", \\\" No\\\")\\n $)\\n writef(\\\"Number of primes up to %I6: %I4*N\\\", 25, count)\\n for n = 26 to 10000\\n $( if totient(n) = n-1 then count := count + 1\\n if n = 100 | n = 1000 | n = 10000 then\\n writef(\\\"Number of primes up to %I6: %I4*N\\\", n, count)\\n $)\\n$)\\n\",\n \"language\": \"BCPL\"\n },\n {\n \"code\": \"GCD ← {𝕨(|𝕊⍟(>⟜0)⊣)𝕩}\\nTotient ← +´1=⊢GCD¨1+↕\\n\",\n \"language\": \"BQN\"\n },\n {\n \"code\": \" Totient¨1+↕25\\n⟨ 1 1 2 2 4 2 6 4 6 4 10 4 12 6 8 8 16 6 18 8 12 10 22 8 20 ⟩\\n\\n \\\"Number\\\"‿\\\"Totient\\\"‿\\\"Prime?\\\"∾˘{𝕩∾(⊢≍(𝕩-1)⊸=)Totient¨𝕩}1+↕25\\n┌─\\n╵ \\\"Number\\\" 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25\\n \\\"Totient\\\" 1 1 2 2 4 2 6 4 6 4 10 4 12 6 8 8 16 6 18 8 12 10 22 8 20\\n \\\"Prime?\\\" 0 1 1 0 1 0 1 0 0 0 1 0 1 0 0 0 1 0 1 0 0 0 1 0 0\\n ┘\\n\",\n \"language\": \"BQN\"\n },\n {\n \"code\": \"/*Abhishek Ghosh, 7th December 2018*/\\n\\n#include<stdio.h>\\n\\nint totient(int n){\\n\\tint tot = n,i;\\n\\t\\n\\tfor(i=2;i*i<=n;i+=2){\\n\\t\\tif(n%i==0){\\n\\t\\t\\twhile(n%i==0)\\n\\t\\t\\t\\tn/=i;\\n\\t\\t\\ttot-=tot/i;\\n\\t\\t}\\n\\t\\t\\n\\t\\tif(i==2)\\n\\t\\t\\ti=1;\\n\\t}\\n\\t\\n\\tif(n>1)\\n\\t\\ttot-=tot/n;\\n\\t\\n\\treturn tot;\\n}\\n\\nint main()\\n{\\n\\tint count = 0,n,tot;\\n\\t\\n\\tprintf(\\\" n %c prime\\\",237);\\n printf(\\\"\\\\n---------------\\\\n\\\");\\n\\t\\n\\tfor(n=1;n<=25;n++){\\n\\t\\ttot = totient(n);\\n\\t\\t\\n\\t\\tif(n-1 == tot)\\n\\t\\t\\tcount++;\\n\\t\\t\\n\\t\\tprintf(\\\"%2d %2d %s\\\\n\\\", n, tot, n-1 == tot?\\\"True\\\":\\\"False\\\");\\n\\t}\\n\\t\\n\\tprintf(\\\"\\\\nNumber of primes up to %6d =%4d\\\\n\\\", 25,count);\\n\\t\\n\\tfor(n = 26; n <= 100000; n++){\\n tot = totient(n);\\n if(tot == n-1)\\n\\t\\t\\tcount++;\\n\\n if(n == 100 || n == 1000 || n%10000 == 0){\\n printf(\\\"\\\\nNumber of primes up to %6d = %4d\\\\n\\\", n, count);\\n }\\n }\\n\\t\\n\\treturn 0;\\n}\\n\",\n \"language\": \"C\"\n },\n {\n \"code\": \"#include <cassert>\\n#include <iomanip>\\n#include <iostream>\\n#include <vector>\\n\\nclass totient_calculator {\\npublic:\\n explicit totient_calculator(int max) : totient_(max + 1) {\\n for (int i = 1; i <= max; ++i)\\n totient_[i] = i;\\n for (int i = 2; i <= max; ++i) {\\n if (totient_[i] < i)\\n continue;\\n for (int j = i; j <= max; j += i)\\n totient_[j] -= totient_[j] / i;\\n }\\n }\\n int totient(int n) const {\\n assert (n >= 1 && n < totient_.size());\\n return totient_[n];\\n }\\n bool is_prime(int n) const {\\n return totient(n) == n - 1;\\n }\\nprivate:\\n std::vector<int> totient_;\\n};\\n\\nint count_primes(const totient_calculator& tc, int min, int max) {\\n int count = 0;\\n for (int i = min; i <= max; ++i) {\\n if (tc.is_prime(i))\\n ++count;\\n }\\n return count;\\n}\\n\\nint main() {\\n const int max = 10000000;\\n totient_calculator tc(max);\\n std::cout << \\\" n totient prime?\\\\n\\\";\\n for (int i = 1; i <= 25; ++i) {\\n std::cout << std::setw(2) << i\\n << std::setw(9) << tc.totient(i)\\n << std::setw(8) << (tc.is_prime(i) ? \\\"yes\\\" : \\\"no\\\") << '\\\\n';\\n }\\n for (int n = 100; n <= max; n *= 10) {\\n std::cout << \\\"Count of primes up to \\\" << n << \\\": \\\"\\n << count_primes(tc, 1, n) << '\\\\n';\\n }\\n return 0;\\n}\\n\",\n \"language\": \"C++\"\n },\n {\n \"code\": \"using static System.Console;\\nusing static System.Linq.Enumerable;\\n\\npublic class Program\\n{\\n static void Main()\\n {\\n for (int i = 1; i <= 25; i++) {\\n int t = Totient(i);\\n WriteLine(i + \\\"\\\\t\\\" + t + (t == i - 1 ? \\\"\\\\tprime\\\" : \\\"\\\"));\\n }\\n WriteLine();\\n for (int i = 100; i <= 100_000; i *= 10) {\\n WriteLine($\\\"{Range(1, i).Count(x => Totient(x) + 1 == x):n0} primes below {i:n0}\\\");\\n }\\n }\\n\\n static int Totient(int n) {\\n if (n < 3) return 1;\\n if (n == 3) return 2;\\n\\n int totient = n;\\n\\n if ((n & 1) == 0) {\\n totient >>= 1;\\n while (((n >>= 1) & 1) == 0) ;\\n }\\n\\n for (int i = 3; i * i <= n; i += 2) {\\n if (n % i == 0) {\\n totient -= totient / i;\\n while ((n /= i) % i == 0) ;\\n }\\n }\\n if (n > 1) totient -= totient / n;\\n return totient;\\n }\\n}\\n\",\n \"language\": \"C-sharp\"\n },\n {\n \"code\": \"totient = proc (n: int) returns (int)\\n tot: int := n\\n\\n i: int := 2\\n while i*i <= n do\\n if n//i = 0 then\\n while n//i = 0 do\\n n := n/i\\n end\\n tot := tot-tot/i\\n end\\n if i=2 then i:=1 end\\n i := i+2\\n end\\n if n>1 then\\n tot := tot-tot/n\\n end\\n return(tot)\\nend totient\\n\\nstart_up = proc ()\\n po: stream := stream$primary_output()\\n count: int := 0\\n\\n stream$putl(po, \\\" N Totient Prime\\\")\\n for n: int in int$from_to(1, 25) do\\n tot: int := totient(n)\\n stream$putright(po, int$unparse(n), 2)\\n stream$putright(po, int$unparse(tot), 9)\\n if n-1 = tot then\\n stream$putright(po, \\\"Yes\\\", 7)\\n count := count + 1\\n else\\n stream$putright(po, \\\"No\\\", 7)\\n end\\n stream$putl(po, \\\"\\\")\\n end\\n\\n stream$putl(po, \\\"Number of primes up to 25:\\\\t\\\" || int$unparse(count))\\n for n: int in int$from_to(26, 100000) do\\n if totient(n) = n-1 then\\n count := count + 1\\n end\\n if n = 100 cor n = 1000 cor n // 10000 = 0 then\\n stream$putl(po, \\\"Number of primes up to \\\"\\n || int$unparse(n) || \\\":\\\\t\\\"\\n || int$unparse(count))\\n end\\n end\\nend start_up\\n\",\n \"language\": \"CLU\"\n },\n {\n \"code\": \" IDENTIFICATION DIVISION.\\n PROGRAM-ID. TOTIENT-FUNCTION.\\n\\n DATA DIVISION.\\n WORKING-STORAGE SECTION.\\n 01 TOTIENT-CALCULATION.\\n 03 N PIC 9(6).\\n 03 TOTIENT PIC 9(6).\\n 03 DIVISOR PIC 9(6).\\n 03 DIV-SQUARE PIC 9(6).\\n 03 MODULUS PIC 9(6).\\n\\n 01 LOOP-VARS.\\n 03 PRIME-COUNT PIC 9(4).\\n 03 CURRENT-N PIC 9(6).\\n 03 PRIME-TOTIENT PIC 9(6).\\n\\n 01 OUTPUTFORMAT.\\n 03 HEADER PIC X(20) VALUE \\\" N Totient Prime?\\\".\\n 03 TOTIENT-ROW.\\n 05 OUT-N PIC Z9.\\n 05 FILLER PIC XX VALUE SPACES.\\n 05 OUT-TOTIENT PIC Z(6)9.\\n 05 FILLER PIC XX VALUE SPACES.\\n 05 OUT-PRIME PIC X(5).\\n 03 PRIME-COUNT-ROW.\\n 05 FILLER PIC X(22) VALUE \\\"Number of primes up to\\\".\\n 05 OUT-PRMTO PIC Z(5)9.\\n 05 FILLER PIC XX VALUE \\\": \\\".\\n 05 OUT-PRMCNT PIC ZZZ9.\\n\\n PROCEDURE DIVISION.\\n BEGIN.\\n MOVE ZERO TO PRIME-COUNT.\\n DISPLAY HEADER.\\n PERFORM SHOW-SMALL-TOTIENT\\n VARYING CURRENT-N FROM 1 BY 1\\n UNTIL CURRENT-N IS GREATER THAN 25.\\n MOVE 25 TO OUT-PRMTO.\\n MOVE PRIME-COUNT TO OUT-PRMCNT.\\n DISPLAY PRIME-COUNT-ROW.\\n PERFORM COUNT-PRIMES\\n VARYING CURRENT-N FROM 26 BY 1\\n UNTIL CURRENT-N IS GREATER THAN 10000.\\n STOP RUN.\\n\\n SHOW-SMALL-TOTIENT.\\n MOVE CURRENT-N TO N.\\n PERFORM CALCULATE-TOTIENT.\\n MOVE CURRENT-N TO OUT-N.\\n MOVE TOTIENT TO OUT-TOTIENT.\\n MOVE \\\"No\\\" TO OUT-PRIME.\\n SUBTRACT 1 FROM CURRENT-N GIVING PRIME-TOTIENT.\\n IF TOTIENT IS EQUAL TO PRIME-TOTIENT,\\n MOVE \\\"Yes\\\" TO OUT-PRIME,\\n ADD 1 TO PRIME-COUNT.\\n DISPLAY TOTIENT-ROW.\\n\\n COUNT-PRIMES.\\n MOVE CURRENT-N TO N.\\n PERFORM CALCULATE-TOTIENT.\\n SUBTRACT 1 FROM CURRENT-N GIVING PRIME-TOTIENT.\\n IF TOTIENT IS EQUAL TO PRIME-TOTIENT, ADD 1 TO PRIME-COUNT.\\n IF CURRENT-N IS EQUAL TO 100 OR 1000 OR 10000,\\n MOVE CURRENT-N TO OUT-PRMTO,\\n MOVE PRIME-COUNT TO OUT-PRMCNT,\\n DISPLAY PRIME-COUNT-ROW.\\n\\n CALCULATE-TOTIENT.\\n MOVE N TO TOTIENT.\\n MOVE 2 TO DIVISOR.\\n MOVE 4 TO DIV-SQUARE.\\n PERFORM DIVIDE-STEP.\\n PERFORM DIVIDE-STEP\\n VARYING DIVISOR FROM 3 BY 2\\n UNTIL DIV-SQUARE IS GREATER THAN N.\\n IF N IS GREATER THAN 1,\\n COMPUTE TOTIENT = TOTIENT - TOTIENT / N.\\n\\n DIVIDE-STEP.\\n MULTIPLY DIVISOR BY DIVISOR GIVING DIV-SQUARE.\\n DIVIDE N BY DIVISOR GIVING MODULUS.\\n MULTIPLY DIVISOR BY MODULUS.\\n SUBTRACT MODULUS FROM N GIVING MODULUS.\\n IF MODULUS IS ZERO,\\n PERFORM DIVIDE-OUT UNTIL MODULUS IS NOT ZERO,\\n COMPUTE TOTIENT = TOTIENT - TOTIENT / DIVISOR.\\n\\n DIVIDE-OUT.\\n DIVIDE DIVISOR INTO N.\\n DIVIDE N BY DIVISOR GIVING MODULUS.\\n MULTIPLY DIVISOR BY MODULUS.\\n SUBTRACT MODULUS FROM N GIVING MODULUS.\\n\",\n \"language\": \"COBOL\"\n },\n {\n \"code\": \"include \\\"cowgol.coh\\\";\\n\\nsub totient(n: uint32): (tot: uint32) is\\n tot := n;\\n\\n var i: uint32 := 2;\\n while i*i <= n loop\\n if n%i == 0 then\\n while n%i == 0 loop\\n n := n/i;\\n end loop;\\n tot := tot - tot/i;\\n end if;\\n if i == 2 then\\n i := 1;\\n end if;\\n i := i + 2;\\n end loop;\\n\\n if n > 1 then\\n tot := tot - tot/n;\\n end if;\\nend sub;\\n\\nvar count: uint16 := 0;\\n\\nprint(\\\"N\\\\tTotient\\\\tPrime\\\\n\\\");\\nvar n: uint32 := 1;\\nwhile n <= 25 loop\\n var tot := totient(n);\\n print_i32(n);\\n print_char('\\\\t');\\n print_i32(tot);\\n print_char('\\\\t');\\n if n-1 == tot then\\n count := count + 1;\\n print(\\\"Yes\\\\n\\\");\\n else\\n print(\\\"No\\\\n\\\");\\n end if;\\n n := n + 1;\\nend loop;\\n\\nprint(\\\"Number of primes up to 25:\\\\t\\\");\\nprint_i16(count);\\nprint_nl();\\n\\nwhile n <= 100000 loop\\n tot := totient(n);\\n if n-1 == tot then\\n count := count + 1;\\n end if;\\n if n == 100 or n == 1000 or n % 10000 == 0 then\\n print(\\\"Number of primes up to \\\");\\n print_i32(n);\\n print(\\\":\\\\t\\\");\\n print_i16(count);\\n print_nl();\\n end if;\\n n := n + 1;\\nend loop;\\n\",\n \"language\": \"Cowgol\"\n },\n {\n \"code\": \"import std.stdio;\\n\\nint totient(int n) {\\n int tot = n;\\n\\n for (int i = 2; i * i <= n; i += 2) {\\n if (n % i == 0) {\\n while (n % i == 0) {\\n n /= i;\\n }\\n tot -= tot / i;\\n }\\n if (i==2) {\\n i = 1;\\n }\\n }\\n\\n if (n > 1) {\\n tot -= tot / n;\\n }\\n return tot;\\n}\\n\\nvoid main() {\\n writeln(\\\" n φ prime\\\");\\n writeln(\\\"---------------\\\");\\n\\n int count = 0;\\n for (int n = 1; n <= 25; n++) {\\n int tot = totient(n);\\n\\n if (n - 1 == tot) {\\n count++;\\n }\\n\\n writefln(\\\"%2d %2d %s\\\", n,tot, n - 1 == tot);\\n }\\n writeln;\\n\\n writefln(\\\"Number of primes up to %6d = %4d\\\", 25, count);\\n for (int n = 26; n <= 100_000; n++) {\\n int tot = totient(n);\\n\\n if (n - 1 == tot) {\\n count++;\\n }\\n\\n if (n == 100 || n == 1_000 || n % 10_000 == 0) {\\n writefln(\\\"Number of primes up to %6d = %4d\\\", n, count);\\n }\\n }\\n}\\n\",\n \"language\": \"D\"\n },\n {\n \"code\": \"proc totient(word n) word:\\n word tot, i;\\n tot := n;\\n i := 2;\\n while i*i <= n do\\n if n%i = 0 then\\n while n%i = 0 do n := n/i od;\\n tot := tot - tot/i\\n fi;\\n if i=2 then i:=1 fi;\\n i := i+2\\n od;\\n if n>1 then\\n tot - tot/n\\n else\\n tot\\n fi\\ncorp\\n\\nproc main() void:\\n word count, n, tot;\\n bool prime;\\n\\n count := 0;\\n writeln(\\\" N Totient Prime\\\");\\n for n from 1 upto 25 do\\n tot := totient(n);\\n prime := n-1 = tot;\\n if prime then count := count+1 fi;\\n writeln(n:2, \\\" \\\", tot:7, \\\" \\\", if prime then \\\" Yes\\\" else \\\" No\\\" fi)\\n od;\\n writeln(\\\"Number of primes up to \\\",25:6,\\\": \\\",count:4);\\n for n from 25 upto 10000 do\\n if totient(n) = n-1 then count := count+1 fi;\\n if n=100 or n=1000 or n=10000 then\\n writeln(\\\"Number of primes up to \\\",n:6,\\\": \\\",count:4)\\n fi\\n od\\ncorp\\n\",\n \"language\": \"Draco\"\n },\n {\n \"code\": \"func totient(n) {\\n var tot = n\\n var i = 2\\n while i * i <= n {\\n if n % i == 0 {\\n while n % i == 0 {\\n n /= i\\n }\\n tot -= tot / i\\n }\\n if i == 2 {\\n i = 1\\n }\\n i += 2\\n }\\n if n > 1 {\\n tot -= tot / n\\n }\\n return tot\\n}\\n\\nprint(\\\"n\\\\tphi\\\\tprime\\\")\\nvar count = 0\\nfor n in 1..25 {\\n var tot = totient(n)\\n var isPrime = n - 1 == tot\\n if isPrime {\\n count += 1\\n }\\n print(\\\"\\\\(n)\\\\t\\\\(tot)\\\\t\\\\(isPrime)\\\")\\n}\\nprint(\\\"\\\\nNumber of primes up to 25 \\\\t= \\\\(count)\\\")\\nfor n in 26..100000 {\\n var tot = totient(n)\\n if tot == n - 1 {\\n count += 1\\n }\\n if n == 100 || n == 1000 || n % 10000 == 0 {\\n print(\\\"Number of primes up to \\\\(n) \\\\t= \\\\(count)\\\")\\n }\\n}\\n\",\n \"language\": \"Dyalect\"\n },\n {\n \"code\": \"func totient n .\\n tot = n\\n i = 2\\n while i <= sqrt n\\n if n mod i = 0\\n while n mod i = 0\\n n = n div i\\n .\\n tot -= tot div i\\n .\\n if i = 2\\n i = 1\\n .\\n i += 2\\n .\\n if n > 1\\n tot -= tot div n\\n .\\n return tot\\n.\\nnumfmt 0 3\\nprint \\\" N Prim Phi\\\"\\nfor n = 1 to 25\\n tot = totient n\\n x$ = \\\" \\\"\\n if n - 1 = tot\\n x$ = \\\" x \\\"\\n .\\n print n & x$ & tot\\n.\\nprint \\\"\\\"\\nfor n = 1 to 100000\\n tot = totient n\\n if n - 1 = tot\\n cnt += 1\\n .\\n if n = 100 or n = 1000 or n = 10000 or n = 100000\\n print n & \\\" - \\\" & cnt & \\\" primes\\\"\\n .\\n.\\n\",\n \"language\": \"EasyLang\"\n },\n {\n \"code\": \"USING: combinators formatting io kernel math math.primes.factors\\nmath.ranges sequences ;\\nIN: rosetta-code.totient-function\\n\\n: Φ ( n -- m )\\n {\\n { [ dup 1 < ] [ drop 0 ] }\\n { [ dup 1 = ] [ drop 1 ] }\\n [\\n dup unique-factors\\n [ 1 [ 1 - * ] reduce ] [ product ] bi / *\\n ]\\n } cond ;\\n\\n: show-info ( n -- )\\n [ Φ ] [ swap 2dup - 1 = ] bi \\\", prime\\\" \\\"\\\" ?\\n \\\"Φ(%2d) = %2d%s\\\\n\\\" printf ;\\n\\n: totient-demo ( -- )\\n 25 [1,b] [ show-info ] each nl 0 100,000 [1,b] [\\n [ dup Φ - 1 = [ 1 + ] when ]\\n [ dup { 100 1,000 10,000 100,000 } member? ] bi\\n [ dupd \\\"%4d primes <= %d\\\\n\\\" printf ] [ drop ] if\\n ] each drop ;\\n\\nMAIN: totient-demo\\n\",\n \"language\": \"Factor\"\n },\n {\n \"code\": \": totient \\\\ n -- n' ;\\n DUP DUP 2 ?DO ( tot n )\\n DUP I DUP * < IF LEAVE THEN \\\\ for(i=2;i*i<=n;i+=2){\\n DUP I MOD 0= IF\\t\\t\\t\\t\\t\\\\ if(n%i==0){\\n BEGIN DUP I /MOD SWAP 0= WHILE ( tot n n/i ) \\\\ while(n%i==0);\\n NIP ( tot n/i ) \\\\ n/=i;\\n REPEAT\\n DROP ( tot n ) \\\\ Remove the new n on exit from loop\\n SWAP DUP I / - SWAP \\t ( tot' n ) \\t\\\\ tot-=tot/i;\\n THEN\\n 2 I 2 = + +LOOP \\\\ If I = 2 add 1 else add 2 to loop index.\\n DUP 1 > IF OVER SWAP / - ELSE DROP THEN ;\\n\\n: bool. \\\\ f -- ;\\n IF .\\\" True \\\" ELSE .\\\" False\\\" THEN ;\\n\\n: count-primes \\\\ n -- n' ;\\n 0 SWAP 2 ?DO I DUP totient 1+ = - LOOP ;\\n\\n: challenge \\\\ -- ;\\n CR .\\\" n φ prime\\\" CR\\n 26 1 DO\\n I 3 .r\\n I totient DUP 4 .r 4 SPACES\\n 1+ I = bool. CR\\n LOOP CR\\n 100001 100 DO\\n .\\\" Number of primes up to \\\" I 6 .R .\\\" is \\\" I count-primes 4 .R CR\\n I 9 * +LOOP ;\\n\",\n \"language\": \"Forth\"\n },\n {\n \"code\": \"#define esPar(n) (((n) And 1) = 0)\\n#define esImpar(n) (esPar(n) = 0)\\n\\nFunction Totient(n As Integer) As Integer\\n 'delta son números no divisibles por 2,3,5\\n Dim delta(7) As Integer = {6,4,2,4,2,4,6,2}\\n Dim As Integer i, quot, idx, result\\n ' div mod por constante es rápido.\\n 'i = 2\\n result = n\\n If (2*2 <= n) Then\\n If Not(esImpar(n)) Then\\n ' eliminar números con factor 2,4,8,16,...\\n While Not(esImpar(n))\\n n = n \\\\ 2\\n Wend\\n 'eliminar los múltiplos de 2\\n result -= result \\\\ 2\\n End If\\n End If\\n 'i = 3\\n If (3*3 <= n) And (n Mod 3 = 0) Then\\n Do\\n quot = n \\\\ 3\\n If n <> quot*3 Then\\n Exit Do\\n Else\\n n = quot\\n End If\\n Loop Until false\\n result -= result \\\\ 3\\n End If\\n 'i = 5\\n If (5*5 <= n) And (n Mod 5 = 0) Then\\n Do\\n quot = n \\\\ 5\\n If n <> quot*5 Then\\n Exit Do\\n Else\\n n = quot\\n End If\\n Loop Until false\\n result -= result \\\\ 5\\n End If\\n i = 7\\n idx = 1\\n 'i = 7,11,13,17,19,23,29,...,49 ..\\n While i*i <= n\\n quot = n \\\\ i\\n If n = quot*i Then\\n Do\\n If n <> quot*i Then\\n Exit Do\\n Else\\n n = quot\\n End If\\n quot = n \\\\ i\\n Loop Until false\\n result -= result \\\\ i\\n End If\\n i = i + delta(idx)\\n idx = (idx+1) And 7\\n Wend\\n If n > 1 Then result -= result \\\\ n\\n Totient = result\\nEnd Function\\n\\nSub ContandoPrimos(n As Integer)\\n Dim As Integer i, cnt = 0\\n For i = 1 To n\\n If Totient(i) = (i-1) Then cnt += 1\\n Next i\\n Print Using \\\" ####### ######\\\"; i-1; cnt\\nEnd Sub\\n\\nFunction esPrimo(n As Ulongint) As String\\n esPrimo = \\\"False\\\"\\n If n = 1 then Return \\\"False\\\"\\n If (n=2) Or (n=3) Then Return \\\"True\\\"\\n If n Mod 2=0 Then Exit Function\\n If n Mod 3=0 Then Exit Function\\n Dim As Ulongint limite = Sqr(N)+1\\n For i As Ulongint = 6 To limite Step 6\\n If N Mod (i-1)=0 Then Exit Function\\n If N Mod (i+1)=0 Then Exit Function\\n Next i\\n Return \\\"True\\\"\\nEnd Function\\n\\nSub display(n As Integer)\\n Dim As Integer idx, phi\\n If n = 0 Then Exit Sub\\n Print \\\" n phi(n) esPrimo\\\"\\n For idx = 1 To n\\n phi = Totient(idx)\\n Print Using \\\"### ### \\\\ \\\\\\\"; idx; phi; esPrimo(idx)\\n Next idx\\nEnd Sub\\n\\nDim l As Integer\\ndisplay(25)\\n\\nPrint Chr(10) & \\\" Limite Son primos\\\"\\nContandoPrimos(25)\\nl = 100\\nDo\\n ContandoPrimos(l)\\n l = l*10\\nLoop Until l > 1000000\\nEnd\\n\",\n \"language\": \"FreeBASIC\"\n },\n {\n \"code\": \"package main\\n\\nimport \\\"fmt\\\"\\n\\nfunc gcd(n, k int) int {\\n if n < k || k < 1 {\\n panic(\\\"Need n >= k and k >= 1\\\")\\n }\\n\\n s := 1\\n for n&1 == 0 && k&1 == 0 {\\n n >>= 1\\n k >>= 1\\n s <<= 1\\n }\\n\\n t := n\\n if n&1 != 0 {\\n t = -k\\n }\\n for t != 0 {\\n for t&1 == 0 {\\n t >>= 1\\n }\\n if t > 0 {\\n n = t\\n } else {\\n k = -t\\n }\\n t = n - k\\n }\\n return n * s\\n}\\n\\nfunc totient(n int) int {\\n tot := 0\\n for k := 1; k <= n; k++ {\\n if gcd(n, k) == 1 {\\n tot++\\n }\\n }\\n return tot\\n}\\n\\nfunc main() {\\n fmt.Println(\\\" n phi prime\\\")\\n fmt.Println(\\\"---------------\\\")\\n count := 0\\n for n := 1; n <= 25; n++ {\\n tot := totient(n)\\n isPrime := n-1 == tot\\n if isPrime {\\n count++\\n }\\n fmt.Printf(\\\"%2d %2d %t\\\\n\\\", n, tot, isPrime)\\n }\\n fmt.Println(\\\"\\\\nNumber of primes up to 25 =\\\", count)\\n for n := 26; n <= 100000; n++ {\\n tot := totient(n)\\n if tot == n-1 {\\n count++\\n }\\n if n == 100 || n == 1000 || n%10000 == 0 {\\n fmt.Printf(\\\"\\\\nNumber of primes up to %-6d = %d\\\\n\\\", n, count)\\n }\\n }\\n}\\n\",\n \"language\": \"Go\"\n },\n {\n \"code\": \"package main\\n\\nimport \\\"fmt\\\"\\n\\nfunc totient(n int) int {\\n tot := n\\n for i := 2; i*i <= n; i += 2 {\\n if n%i == 0 {\\n for n%i == 0 {\\n n /= i\\n }\\n tot -= tot / i\\n }\\n if i == 2 {\\n i = 1\\n }\\n }\\n if n > 1 {\\n tot -= tot / n\\n }\\n return tot\\n}\\n\\nfunc main() {\\n fmt.Println(\\\" n phi prime\\\")\\n fmt.Println(\\\"---------------\\\")\\n count := 0\\n for n := 1; n <= 25; n++ {\\n tot := totient(n)\\n isPrime := n-1 == tot\\n if isPrime {\\n count++\\n }\\n fmt.Printf(\\\"%2d %2d %t\\\\n\\\", n, tot, isPrime)\\n }\\n fmt.Println(\\\"\\\\nNumber of primes up to 25 =\\\", count)\\n for n := 26; n <= 100000; n++ {\\n tot := totient(n)\\n if tot == n-1 {\\n count++\\n }\\n if n == 100 || n == 1000 || n%10000 == 0 {\\n fmt.Printf(\\\"\\\\nNumber of primes up to %-6d = %d\\\\n\\\", n, count)\\n }\\n }\\n}\\n\",\n \"language\": \"Go\"\n },\n {\n \"code\": \"{-# LANGUAGE BangPatterns #-}\\n\\nimport Control.Monad (when)\\nimport Data.Bool (bool)\\n\\ntotient\\n :: (Integral a)\\n => a -> a\\ntotient n\\n | n == 0 = 1 -- by definition phi(0) = 1\\n | n < 0 = totient (-n) -- phi(-n) is taken to be equal to phi(n)\\n | otherwise = loop n n 2 --\\n where\\n loop !m !tot !i\\n | i * i > m = bool tot (tot - (tot `div` m)) (1 < m)\\n | m `mod` i == 0 = loop m_ tot_ i_\\n | otherwise = loop m tot i_\\n where\\n i_\\n | i == 2 = 3\\n | otherwise = 2 + i\\n m_ = nextM m\\n tot_ = tot - (tot `div` i)\\n nextM !x\\n | x `mod` i == 0 = nextM $ x `div` i\\n | otherwise = x\\n\\nmain :: IO ()\\nmain = do\\n putStrLn \\\"n\\\\tphi\\\\tprime\\\\n---------------------\\\"\\n let loop !i !count\\n | i >= 10 ^ 6 = return ()\\n | otherwise = do\\n let i_ = succ i\\n tot = totient i_\\n isPrime = tot == pred i_\\n count_\\n | isPrime = succ count\\n | otherwise = count\\n when (25 >= i_) $\\n putStrLn $ show i_ ++ \\\"\\\\t\\\" ++ show tot ++ \\\"\\\\t\\\" ++ show isPrime\\n when\\n (i_ `elem`\\n 25 :\\n [ 10 ^ k\\n | k <- [2 .. 6] ]) $\\n putStrLn $ \\\"Number of primes up to \\\" ++ show i_ ++ \\\" = \\\" ++ show count_\\n loop (i + 1) count_\\n loop 0 0\\n\",\n \"language\": \"Haskell\"\n },\n {\n \"code\": \" nth_prime =: p: NB. 2 is the zeroth prime\\n totient =: 5&p:\\n primeQ =: 1&p:\\n\\n NB. first row contains the integer\\n NB. second row totient\\n NB. third 1 iff prime\\n (, totient ,: primeQ) >: i. 25\\n1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25\\n1 1 2 2 4 2 6 4 6 4 10 4 12 6 8 8 16 6 18 8 12 10 22 8 20\\n0 1 1 0 1 0 1 0 0 0 1 0 1 0 0 0 1 0 1 0 0 0 1 0 0\\n\\n\\n NB. primes first exceeding the limits\\n [&.:(p:inv) 10 ^ 2 + i. 4\\n101 1009 10007 100003\\n\\n p:inv 101 1009 10007 100003\\n25 168 1229 9592\\n\\n NB. limit and prime count\\n (,. p:inv) 10 ^ 2 + i. 5\\n 100 25\\n 1000 168\\n 10000 1229\\n100000 9592\\n 1e6 78498\\n\",\n \"language\": \"J\"\n },\n {\n \"code\": \"public class TotientFunction {\\n\\n public static void main(String[] args) {\\n computePhi();\\n System.out.println(\\\"Compute and display phi for the first 25 integers.\\\");\\n System.out.printf(\\\"n Phi IsPrime%n\\\");\\n for ( int n = 1 ; n <= 25 ; n++ ) {\\n System.out.printf(\\\"%2d %2d %b%n\\\", n, phi[n], (phi[n] == n-1));\\n }\\n for ( int i = 2 ; i < 8 ; i++ ) {\\n int max = (int) Math.pow(10, i);\\n System.out.printf(\\\"The count of the primes up to %,10d = %d%n\\\", max, countPrimes(1, max));\\n }\\n }\\n\\n private static int countPrimes(int min, int max) {\\n int count = 0;\\n for ( int i = min ; i <= max ; i++ ) {\\n if ( phi[i] == i-1 ) {\\n count++;\\n }\\n }\\n return count;\\n }\\n\\n private static final int max = 10000000;\\n private static final int[] phi = new int[max+1];\\n\\n private static final void computePhi() {\\n for ( int i = 1 ; i <= max ; i++ ) {\\n phi[i] = i;\\n }\\n for ( int i = 2 ; i <= max ; i++ ) {\\n if (phi[i] < i) continue;\\n for ( int j = i ; j <= max ; j += i ) {\\n phi[j] -= phi[j] / i;\\n }\\n }\\n }\\n\\n}\\n\",\n \"language\": \"Java\"\n },\n {\n \"code\": \"# jq optimizes the recursive call of _gcd in the following:\\ndef gcd(a;b):\\n def _gcd:\\n if .[1] != 0 then [.[1], .[0] % .[1]] | _gcd else .[0] end;\\n [a,b] | _gcd ;\\n\\ndef count(s): reduce s as $x (0; .+1);\\n\\ndef totient:\\n . as $n\\n | count( range(0; .) | select( gcd($n; .) == 1) );\\n\\n# input: determines the maximum via range(0; .)\\n# and so may be `infinite`\\ndef primes_via_totient:\\n range(0; .) | select(totient == . - 1);\\n\",\n \"language\": \"Jq\"\n },\n {\n \"code\": \"def task:\\n def task1($n):\\n range(1;$n)\\n | totient as $totient\\n | {i: ., $totient, isprime: ($totient == ( . - 1 ))};\\n\\n task1(26);\\n\\ndef onepass:\\n reduce (10000 | primes_via_totient) as $p ({};\\n if $p < 10000\\n then .[\\\"10^4\\\"] += 1\\n | if $p < 1000\\n then .[\\\"10^3\\\"] += 1\\n | if $p < 100\\n then .[\\\"10^2\\\"] += 1\\n else . end else . end else . end) ;\\n\\ntask, \\\"\\\\nCounts of primes up to the given limits:\\\", onepass\\n\",\n \"language\": \"Jq\"\n },\n {\n \"code\": \"φ(n) = sum(1 for k in 1:n if gcd(n, k) == 1)\\n\\nis_prime(n) = φ(n) == n - 1\\n\\nfunction runphitests()\\n for n in 1:25\\n println(\\\" φ($n) == $(φ(n))\\\", is_prime(n) ? \\\", is prime\\\" : \\\"\\\")\\n end\\n count = 0\\n for n in 1:100_000\\n count += is_prime(n)\\n if n in [100, 1000, 10_000, 100_000]\\n println(\\\"Primes up to $n: $count\\\")\\n end\\n end\\nend\\n\\nrunphitests()\\n\",\n \"language\": \"Julia\"\n },\n {\n \"code\": \"// Version 1.3.21\\n\\nfun totient(n: Int): Int {\\n var tot = n\\n var nn = n\\n var i = 2\\n while (i * i <= nn) {\\n if (nn % i == 0) {\\n while (nn % i == 0) nn /= i\\n tot -= tot / i\\n }\\n if (i == 2) i = 1\\n i += 2\\n }\\n if (nn > 1) tot -= tot / nn\\n return tot\\n}\\n\\nfun main() {\\n println(\\\" n phi prime\\\")\\n println(\\\"---------------\\\")\\n var count = 0\\n for (n in 1..25) {\\n val tot = totient(n)\\n val isPrime = n - 1 == tot\\n if (isPrime) count++\\n System.out.printf(\\\"%2d %2d %b\\\\n\\\", n, tot, isPrime)\\n }\\n println(\\\"\\\\nNumber of primes up to 25 = $count\\\")\\n for (n in 26..100_000) {\\n val tot = totient(n)\\n if (tot == n-1) count++\\n if (n == 100 || n == 1000 || n % 10_000 == 0) {\\n System.out.printf(\\\"\\\\nNumber of primes up to %-6d = %d\\\\n\\\", n, count)\\n }\\n }\\n}\\n\",\n \"language\": \"Kotlin\"\n },\n {\n \"code\": \"-- Return the greatest common denominator of x and y\\nfunction gcd (x, y)\\n return y == 0 and math.abs(x) or gcd(y, x % y)\\nend\\n\\n-- Return the totient number for n\\nfunction totient (n)\\n local count = 0\\n for k = 1, n do\\n if gcd(n, k) == 1 then count = count + 1 end\\n end\\n return count\\nend\\n\\n-- Determine (inefficiently) whether p is prime\\nfunction isPrime (p)\\n return totient(p) == p - 1\\nend\\n\\n-- Output totient and primality for the first 25 integers\\nprint(\\\"n\\\", string.char(237), \\\"prime\\\")\\nprint(string.rep(\\\"-\\\", 21))\\nfor i = 1, 25 do\\n print(i, totient(i), isPrime(i))\\nend\\n\\n-- Count the primes up to 100, 1000 and 10000\\nlocal pCount, i, limit = 0, 1\\nfor power = 2, 4 do\\n limit = 10 ^ power\\n repeat\\n i = i + 1\\n if isPrime(i) then pCount = pCount + 1 end\\n until i == limit\\n print(\\\"\\\\nThere are \\\" .. pCount .. \\\" primes below \\\" .. limit)\\nend\\n\",\n \"language\": \"Lua\"\n },\n {\n \"code\": \"do\\n function totient( n ) -- returns the number of integers k where 1 <= k <= n that are mutually prime to n\\n if n < 3 then return 1\\n elseif n == 3 then return 2\\n else\\n local result, v, i = n, n, 2\\n while i * i <= v do\\n if v % i == 0 then\\n while v % i == 0 do v = math.floor( v / i ) end\\n result = result - math.floor( result / i )\\n end\\n if i == 2 then\\n i = 1\\n end\\n i = i + 2\\n end\\n if v > 1 then result = result - math.floor( result / v ) end\\n return result\\n end\\n end\\n -- show the totient function values for the first 25 integers\\n io.write( \\\" n phi(n) remarks\\\\n\\\" )\\n for n = 1,25 do\\n local tn = totient( n )\\n io.write( string.format( \\\"%2d\\\", n ), \\\": \\\", string.format( \\\"%5d\\\", tn )\\n , ( tn == n - 1 and tn ~= 0 and \\\" n is prime\\\" or \\\"\\\" )\\n , \\\"\\\\n\\\"\\n )\\n end\\n -- use the totient function to count primes\\n local n100, n1000, n10000, n100000 = 0, 0, 0, 0\\n for n = 1,100000 do\\n if totient( n ) == n - 1 then\\n if n <= 100 then n100 = n100 + 1 end\\n if n <= 1000 then n1000 = n1000 + 1 end\\n if n <= 10000 then n10000 = n10000 + 1 end\\n if n <= 100000 then n100000 = n100000 + 1 end\\n end\\n end\\n io.write( \\\"There are \\\", string.format( \\\"%6d\\\", n100 ), \\\" primes below 100\\\\n\\\" )\\n io.write( \\\"There are \\\", string.format( \\\"%6d\\\", n1000 ), \\\" primes below 1 000\\\\n\\\" )\\n io.write( \\\"There are \\\", string.format( \\\"%6d\\\", n10000 ), \\\" primes below 10 000\\\\n\\\" )\\n io.write( \\\"There are \\\", string.format( \\\"%6d\\\", n100000 ), \\\" primes below 100 000\\\\n\\\" )\\nend\\n\",\n \"language\": \"Lua\"\n },\n {\n \"code\": \" NORMAL MODE IS INTEGER\\n BOOLEAN PRM\\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 TOTENT.\\n N = NN\\n TOT = N\\n THROUGH STEP, FOR I=2, 2, I*I.G.N\\n WHENEVER REM.(N,I).E.0\\n THROUGH DIV, FOR N=N, 0, REM.(N,I).NE.0\\nDIV N = N/I\\n TOT = TOT-TOT/I\\n END OF CONDITIONAL\\n WHENEVER I.E.2, I=1\\nSTEP CONTINUE\\n WHENEVER N.G.1, TOT = TOT-TOT/N\\n FUNCTION RETURN TOT\\n END OF FUNCTION\\n\\n COUNT = 0\\n PRINT FORMAT HEADER\\n THROUGH FRST25, FOR KN=1, 1, KN.G.25\\n KTOT = TOTENT.(KN)\\n PRM = KTOT.E.KN-1\\n WHENEVER PRM, COUNT = COUNT + 1\\nFRST25 PRINT FORMAT NUMTOT,KN,KTOT,PRM\\n\\n PRINT FORMAT NUMPRM,25,COUNT\\n\\n THROUGH CNTPRM, FOR KN=26, 1, KN.G.100000\\n KTOT = TOTENT.(KN)\\n WHENEVER KTOT.E.KN-1, COUNT = COUNT+1\\n WHENEVER KN.E.100 .OR. KN.E.1000 .OR. REM.(KN,10000).E.0,\\n 0 PRINT FORMAT NUMPRM,KN,COUNT\\nCNTPRM CONTINUE\\n\\n VECTOR VALUES HEADER = $19H N TOTIENT PRIME*$\\n VECTOR VALUES NUMTOT = $I2,S2,I7,S2,I5*$\\n VECTOR VALUES NUMPRM = $22HNUMBER OF PRIMES UP TO,I7,1H:,I6*$\\n END OF PROGRAM\\n\",\n \"language\": \"MAD\"\n },\n {\n \"code\": \"Do[\\n tmp = EulerPhi[i];\\n If[i - 1 == tmp,\\n Print[\\\"\\\\[CurlyPhi](\\\", i, \\\")=\\\", tmp, \\\", is prime\\\"]\\n ,\\n Print[\\\"\\\\[CurlyPhi](\\\", i, \\\")=\\\", tmp]\\n ]\\n ,\\n {i, 25}\\n ]\\nCount[EulerPhi[Range[100]] - Range[100], -1]\\nCount[EulerPhi[Range[1000]] - Range[1000], -1]\\nCount[EulerPhi[Range[10000]] - Range[10000], -1]\\nCount[EulerPhi[Range[100000]] - Range[100000], -1]\\n(*Alternative much faster way of findings the number primes up to a number*)\\n(*PrimePi[100]*)\\n(*PrimePi[1000]*)\\n(*PrimePi[10000]*)\\n(*PrimePi[100000]*)\\n\",\n \"language\": \"Mathematica\"\n },\n {\n \"code\": \"main :: [sys_message]\\nmain = [Stdout (lay (map showline [1..25])),\\n Stdout (lay (map countprimes (25:map (10^) [2..5])))]\\n\\ncountprimes :: num->[char]\\ncountprimes n = \\\"There are \\\" ++ show amount ++ \\\" primes up to \\\" ++ show n\\n where amount = #filter prime [2..n]\\n\\nshowline :: num->[char]\\nshowline n = \\\"phi(\\\" ++ show n ++ \\\") = \\\" ++ show (totient n) ++ \\\", \\\" ++ kind\\n where kind = \\\"prime\\\", if prime n\\n = \\\"composite\\\", otherwise\\n\\nprime :: num->bool\\nprime n = totient n = n - 1\\n\\ntotient :: num->num\\ntotient n = loop n n (2:[3, 5..])\\n where loop tot n (d:ds)\\n = tot, if n<=1\\n = tot - tot div n, if d*d > n\\n = loop tot n ds, if n mod d ~= 0\\n = loop (tot - tot div d) (remfac n d) ds, otherwise\\n remfac n d = n, if n mod d ~= 0\\n = remfac (n div d) d, otherwise\\n\",\n \"language\": \"Miranda\"\n },\n {\n \"code\": \"MODULE TotientFunction;\\nFROM InOut IMPORT WriteString, WriteCard, WriteLn;\\n\\nVAR count, n, tot: CARDINAL;\\n\\nPROCEDURE totient(n: CARDINAL): CARDINAL;\\n VAR tot, i: CARDINAL;\\nBEGIN\\n tot := n;\\n i := 2;\\n WHILE i*i <= n DO\\n IF n MOD i = 0 THEN\\n WHILE n MOD i = 0 DO\\n n := n DIV i\\n END;\\n DEC(tot, tot DIV i)\\n END;\\n IF i=2 THEN i := 1 END;\\n INC(i, 2)\\n END;\\n IF n>1 THEN\\n DEC(tot, tot DIV n)\\n END;\\n RETURN tot\\nEND totient;\\n\\nPROCEDURE ShowPrimeCount(n, count: CARDINAL);\\nBEGIN\\n WriteString(\\\"Number of primes up to\\\");\\n WriteCard(n, 6);\\n WriteString(\\\": \\\");\\n WriteCard(count, 4);\\n WriteLn\\nEND ShowPrimeCount;\\n\\nBEGIN\\n count := 0;\\n\\n WriteString(\\\" N Totient Prime\\\");\\n WriteLn;\\n FOR n := 1 TO 25 DO\\n tot := totient(n);\\n WriteCard(n, 2);\\n WriteCard(tot, 9);\\n IF tot = n-1 THEN\\n WriteString(\\\" Yes\\\");\\n INC(count)\\n ELSE\\n WriteString(\\\" No\\\")\\n END;\\n WriteLn\\n END;\\n\\n ShowPrimeCount(25, count);\\n\\n FOR n := 26 TO 10000 DO\\n IF totient(n) = n-1 THEN INC(count) END;\\n IF (n=100) OR (n=1000) OR (n=10000) THEN\\n ShowPrimeCount(n, count)\\n END;\\n END\\nEND TotientFunction.\\n\",\n \"language\": \"Modula-2\"\n },\n {\n \"code\": \"import strformat\\n\\nfunc totient(n: int): int =\\n var tot = n\\n var nn = n\\n var i = 2\\n while i * i <= nn:\\n if nn mod i == 0:\\n while nn mod i == 0:\\n nn = nn div i\\n dec tot, tot div i\\n if i == 2:\\n i = 1\\n inc i, 2\\n if nn > 1:\\n dec tot, tot div nn\\n tot\\n\\necho \\\" n φ prime\\\"\\necho \\\"---------------\\\"\\nvar count = 0\\nfor n in 1..25:\\n let tot = totient(n)\\n let isPrime = n - 1 == tot\\n if isPrime:\\n inc count\\n echo fmt\\\"{n:2} {tot:2} {isPrime}\\\"\\necho \\\"\\\"\\necho fmt\\\"Number of primes up to {25:>6} = {count:>4}\\\"\\nfor n in 26..100_000:\\n let tot = totient(n)\\n if tot == n - 1:\\n inc count\\n if n == 100 or n == 1000 or n mod 10_000 == 0:\\n echo fmt\\\"Number of primes up to {n:>6} = {count:>4}\\\"\\n\",\n \"language\": \"Nim\"\n },\n {\n \"code\": \"{$IFDEF FPC}\\n {$MODE DELPHI}\\n{$IFEND}\\nfunction gcd_mod(u, v: NativeUint): NativeUint;inline;\\n//prerequisites u > v and u,v > 0\\n var\\n t: NativeUInt;\\n begin\\n repeat\\n t := u;\\n u := v;\\n v := t mod v;\\n until v = 0;\\n gcd_mod := u;\\n end;\\n\\nfunction Totient(n:NativeUint):NativeUint;\\nvar\\n i : NativeUint;\\nBegin\\n result := 1;\\n For i := 2 to n do\\n inc(result,ORD(GCD_mod(n,i)=1));\\nend;\\n\\nfunction CheckPrimeTotient(n:NativeUint):Boolean;inline;\\nbegin\\n result := (Totient(n) = (n-1));\\nend;\\n\\nprocedure OutCountPrimes(n:NativeUInt);\\nvar\\n i,cnt : NativeUint;\\nbegin\\n cnt := 0;\\n For i := 1 to n do\\n inc(cnt,Ord(CheckPrimeTotient(i)));\\n writeln(n:10,cnt:8);\\nend;\\n\\nprocedure display(n:NativeUint);\\nvar\\n idx,phi : NativeUint;\\nBegin\\n if n = 0 then\\n EXIT;\\n writeln('number n':5,'Totient(n)':11,'isprime':8);\\n For idx := 1 to n do\\n Begin\\n phi := Totient(idx);\\n writeln(idx:4,phi:10,(phi=(idx-1)):12);\\n end\\nend;\\nvar\\n i : NativeUint;\\nBegin\\n display(25);\\n\\n writeln('Limit primecount');\\n i := 100;\\n repeat\\n OutCountPrimes(i);\\n i := i*10;\\n until i >100000;\\nend.\\n\",\n \"language\": \"Pascal\"\n },\n {\n \"code\": \"function totient(n:NativeUInt):NativeUInt;\\nconst\\n //delta of numbers not divisible by 2,3,5 (0_1+6->7+4->11 ..+6->29+2->3_1\\n delta : array[0..7] of NativeUint = (6,4,2,4,2,4,6,2);\\nvar\\n i, quot,idx: NativeUint;\\nBegin\\n // div mod by constant is fast.\\n //i = 2\\n result := n;\\n if (2*2 <= n) then\\n Begin\\n IF not(ODD(n)) then\\n Begin\\n // remove numbers with factor 2,4,8,16, ...\\n while not(ODD(n)) do\\n n := n DIV 2;\\n //remove count of multiples of 2\\n dec(result,result DIV 2);\\n end;\\n end;\\n //i = 3\\n If (3*3 <= n) AND (n mod 3 = 0) then\\n Begin\\n repeat\\n quot := n DIV 3;\\n IF n <> quot*3 then\\n BREAK\\n else\\n n := quot;\\n until false;\\n dec(result,result DIV 3);\\n end;\\n //i = 5\\n If (5*5 <= n) AND (n mod 5 = 0) then\\n Begin\\n repeat\\n quot := n DIV 5;\\n IF n <> quot*5 then\\n BREAK\\n else\\n n := quot;\\n until false;\\n dec(result,result DIV 5);\\n end;\\n i := 7;\\n idx := 1;\\n //i = 7,11,13,17,19,23,29, ...49 ..\\n while i*i <= n do\\n Begin\\n quot := n DIV i;\\n if n = quot*i then\\n Begin\\n repeat\\n IF n <> quot*i then\\n BREAK\\n else\\n n := quot;\\n quot := n DIV i;\\n until false;\\n dec(result,result DIV i);\\n end;\\n i := i + delta[idx];\\n idx := (idx+1) AND 7;\\n end;\\n if n> 1 then\\n dec(result,result div n);\\nend;\\n\",\n \"language\": \"Pascal\"\n },\n {\n \"code\": \"use utf8;\\nbinmode STDOUT, \\\":utf8\\\";\\n\\nsub gcd {\\n my ($u, $v) = @_;\\n while ($v) {\\n ($u, $v) = ($v, $u % $v);\\n }\\n return abs($u);\\n}\\n\\npush @𝜑, 0;\\nfor $t (1..10000) {\\n push @𝜑, scalar grep { 1 == gcd($_,$t) } 1..$t;\\n}\\n\\nprintf \\\"𝜑(%2d) = %3d%s\\\\n\\\", $_, $𝜑[$_], $_ - $𝜑[$_] - 1 ? '' : ' Prime' for 1 .. 25;\\nprint \\\"\\\\n\\\";\\n\\nfor $limit (100, 1000, 10000) {\\n printf \\\"Count of primes <= $limit: %d\\\\n\\\", scalar grep {$_ == $𝜑[$_] + 1} 0..$limit;\\n}\\n\",\n \"language\": \"Perl\"\n },\n {\n \"code\": \"use utf8;\\nbinmode STDOUT, \\\":utf8\\\";\\n\\nuse ntheory qw(euler_phi);\\n\\nmy @𝜑 = euler_phi(0,10000); # Returns list of all values in range\\n\\nprintf \\\"𝜑(%2d) = %3d%s\\\\n\\\", $_, $𝜑[$_], $_ - $𝜑[$_] - 1 ? '' : ' Prime' for 1 .. 25;\\nprint \\\"\\\\n\\\";\\n\\nfor $limit (100, 1000, 10000) {\\n printf \\\"Count of primes <= $limit: %d\\\\n\\\", scalar grep {$_ == $𝜑[$_] + 1} 0..$limit;\\n}\\n\",\n \"language\": \"Perl\"\n },\n {\n \"code\": \"(phixonline)-->\\n <span style=\\\"color: #008080;\\\">function</span> <span style=\\\"color: #000000;\\\">totient</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;\\\">integer</span> <span style=\\\"color: #000000;\\\">tot</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;\\\">2</span>\\n <span style=\\\"color: #008080;\\\">while</span> <span style=\\\"color: #000000;\\\">i</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: #008080;\\\">do</span>\\n <span style=\\\"color: #008080;\\\">if</span> <span style=\\\"color: #7060A8;\\\">mod</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;\\\">0</span> <span style=\\\"color: #008080;\\\">then</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;\\\">n</span> <span style=\\\"color: #0000FF;\\\">/=</span> <span style=\\\"color: #000000;\\\">i</span>\\n <span style=\\\"color: #008080;\\\">if</span> <span style=\\\"color: #7060A8;\\\">mod</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;\\\">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: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">while</span>\\n <span style=\\\"color: #000000;\\\">tot</span> <span style=\\\"color: #0000FF;\\\">-=</span> <span style=\\\"color: #000000;\\\">tot</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: #000000;\\\">i</span> <span style=\\\"color: #0000FF;\\\">+=</span> <span style=\\\"color: #008080;\\\">iff</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;\\\">1</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;\\\">while</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;\\\">then</span>\\n <span style=\\\"color: #000000;\\\">tot</span> <span style=\\\"color: #0000FF;\\\">-=</span> <span style=\\\"color: #000000;\\\">tot</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: #008080;\\\">return</span> <span style=\\\"color: #000000;\\\">tot</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;\\\">\\\" n phi prime\\\\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: #004080;\\\">integer</span> <span style=\\\"color: #000000;\\\">count</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">0</span>\\n <span style=\\\"color: #008080;\\\">for</span> <span style=\\\"color: #000000;\\\">n</span><span style=\\\"color: #0000FF;\\\">=</span><span style=\\\"color: #000000;\\\">1</span> <span style=\\\"color: #008080;\\\">to</span> <span style=\\\"color: #000000;\\\">25</span> <span style=\\\"color: #008080;\\\">do</span>\\n <span style=\\\"color: #004080;\\\">integer</span> <span style=\\\"color: #000000;\\\">tot</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">totient</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">n</span><span style=\\\"color: #0000FF;\\\">),</span>\\n <span style=\\\"color: #000000;\\\">prime</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;\\\">1</span><span style=\\\"color: #0000FF;\\\">=</span><span style=\\\"color: #000000;\\\">tot</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #000000;\\\">count</span> <span style=\\\"color: #0000FF;\\\">+=</span> <span style=\\\"color: #000000;\\\">prime</span>\\n <span style=\\\"color: #004080;\\\">string</span> <span style=\\\"color: #000000;\\\">isp</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #008080;\\\">iff</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">prime</span><span style=\\\"color: #0000FF;\\\">?</span><span style=\\\"color: #008000;\\\">\\\"true\\\"</span><span style=\\\"color: #0000FF;\\\">:</span><span style=\\\"color: #008000;\\\">\\\"false\\\"</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;\\\">\\\"%2d %2d %s\\\\n\\\"</span><span style=\\\"color: #0000FF;\\\">,{</span><span style=\\\"color: #000000;\\\">n</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">tot</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">isp</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;\\\">\\\"\\\\nNumber of primes up to 25 = %d\\\\n\\\"</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">count</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #008080;\\\">for</span> <span style=\\\"color: #000000;\\\">n</span><span style=\\\"color: #0000FF;\\\">=</span><span style=\\\"color: #000000;\\\">26</span> <span style=\\\"color: #008080;\\\">to</span> <span style=\\\"color: #000000;\\\">100000</span> <span style=\\\"color: #008080;\\\">do</span>\\n <span style=\\\"color: #000000;\\\">count</span> <span style=\\\"color: #0000FF;\\\">+=</span> <span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">totient</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><span style=\\\"color: #000000;\\\">1</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;\\\">n</span><span style=\\\"color: #0000FF;\\\">,{</span><span style=\\\"color: #000000;\\\">100</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">1000</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">10000</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">100000</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;\\\">\\\"Number of primes up to %-6d = %d\\\\n\\\"</span><span style=\\\"color: #0000FF;\\\">,{</span><span style=\\\"color: #000000;\\\">n</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: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">for</span>\\n<!--\\n\",\n \"language\": \"Phix\"\n },\n {\n \"code\": \"(gc 32)\\n(de gcd (A B)\\n (until (=0 B)\\n (let M (% A B)\\n (setq A B B M) ) )\\n (abs A) )\\n(de totient (N)\\n (let C 0\\n (for I N\\n (and (=1 (gcd N I)) (inc 'C)) )\\n (cons C (= C (dec N))) ) )\\n(de p? (N)\\n (let C 0\\n (for A N\\n (and\\n (cdr (totient A))\\n (inc 'C) ) )\\n C ) )\\n(let Fmt (3 7 10)\\n (tab Fmt \\\"N\\\" \\\"Phi\\\" \\\"Prime?\\\")\\n (tab Fmt \\\"-\\\" \\\"---\\\" \\\"------\\\")\\n (for N 25\\n (tab Fmt\\n N\\n (car (setq @ (totient N)))\\n (cdr @) ) ) )\\n(println\\n (mapcar p? (25 100 1000 10000 100000)) )\\n\",\n \"language\": \"PicoLisp\"\n },\n {\n \"code\": \"totientFunction: procedure options(main);\\n totient: procedure(nn) returns(fixed);\\n declare (nn, n, i, tot) fixed;\\n n = nn;\\n tot = n;\\n do i=2 repeat(i+2) while(i*i <= n);\\n if mod(n,i) = 0 then do;\\n do while(mod(n,i) = 0);\\n n = n / i;\\n end;\\n tot = tot - tot / i;\\n end;\\n if i=2 then i=1;\\n end;\\n if n>1 then tot = tot - tot/n;\\n return(tot);\\n end totient;\\n\\n showPrimeCount: procedure(n, primeCount);\\n declare (n, primeCount) fixed;\\n put skip edit('There are', primeCount, ' primes up to', n) (A,F(5),A,F(6));\\n end showPrimeCount;\\n\\n declare (n, primeCount, tot) fixed;\\n do n = 1 to 25;\\n tot = totient(n);\\n put edit('phi(', n, ') = ', tot) (A,F(2),A,F(2));\\n if tot = n-1 then do;\\n put list('; prime');\\n primeCount = primeCount + 1;\\n end;\\n put skip;\\n end;\\n\\n call showPrimeCount(25, primeCount);\\n do n = 26 to 10000;\\n if totient(n) = n-1 then primeCount = primeCount + 1;\\n if n=100 | n=1000 | n=10000 then\\n call showPrimeCount(n, primeCount);\\n end;\\nend totientFunction;\\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; GO TO 0; END EXIT;\\nPRINT: PROCEDURE (S); DECLARE S ADDRESS; CALL BDOS(9,S); END PRINT;\\n\\nPRINT$NUM: PROCEDURE (N);\\n DECLARE (N, P) ADDRESS, CH BASED P BYTE;\\n DECLARE S (6) BYTE INITIAL ('.....$');\\n P = .S(5);\\nDIGIT:\\n P = P-1;\\n CH = '0' + N MOD 10;\\n IF (N := N/10) > 0 THEN GO TO DIGIT;\\n CALL PRINT(P);\\nEND PRINT$NUM;\\n\\nTOTIENT: PROCEDURE (N) ADDRESS;\\n DECLARE (TOT, N, I) ADDRESS;\\n TOT = N;\\n I = 2;\\n DO WHILE I*I <= N;\\n IF N MOD I = 0 THEN DO;\\n DO WHILE (N := N / I) MOD I = 0; END;\\n TOT = TOT - TOT / I;\\n END;\\n IF I=2 THEN I=1;\\n I = I+2;\\n END;\\n IF N > 1 THEN TOT = TOT - TOT / N;\\n RETURN TOT;\\nEND TOTIENT;\\n\\nSHOW$PRIME$COUNT: PROCEDURE (N, COUNT);\\n DECLARE (N, COUNT) ADDRESS;\\n CALL PRINT(.'THERE ARE $');\\n CALL PRINT$NUM(COUNT);\\n CALL PRINT(.' PRIMES UP TO $');\\n CALL PRINT$NUM(N);\\n CALL PRINT(.(13,10,'$'));\\nEND SHOW$PRIME$COUNT;\\n\\nDECLARE (N, TOT) ADDRESS;\\nDECLARE PRIME$COUNT ADDRESS INITIAL (0);\\n\\nDO N = 1 TO 25;\\n CALL PRINT(.'PHI($');\\n CALL PRINT$NUM(N);\\n CALL PRINT(.') = $');\\n CALL PRINT$NUM(TOT := TOTIENT(N));\\n IF TOT = N-1 THEN DO;\\n CALL PRINT(.'; PRIME$');\\n PRIME$COUNT = PRIME$COUNT + 1;\\n END;\\n CALL PRINT(.(13,10,'$'));\\nEND;\\n\\nCALL SHOW$PRIME$COUNT(25, PRIME$COUNT);\\nDO N = 26 TO 10000;\\n IF TOTIENT(N) = N-1 THEN\\n PRIME$COUNT = PRIME$COUNT + 1;\\n IF N=100 OR N=1000 OR N=10000 THEN\\n CALL SHOW$PRIME$COUNT(N, PRIME$COUNT);\\nEND;\\n\\nCALL EXIT;\\nEOF\\n\",\n \"language\": \"PL-M\"\n },\n {\n \"code\": \"from math import gcd\\n\\ndef φ(n):\\n return sum(1 for k in range(1, n + 1) if gcd(n, k) == 1)\\n\\nif __name__ == '__main__':\\n def is_prime(n):\\n return φ(n) == n - 1\\n\\n for n in range(1, 26):\\n print(f\\\" φ({n}) == {φ(n)}{', is prime' if is_prime(n) else ''}\\\")\\n count = 0\\n for n in range(1, 10_000 + 1):\\n count += is_prime(n)\\n if n in {100, 1000, 10_000}:\\n print(f\\\"Primes up to {n}: {count}\\\")\\n\",\n \"language\": \"Python\"\n },\n {\n \"code\": \" [ 0 swap dup times\\n [ i over gcd\\n 1 = rot + swap ]\\n drop ] is totient ( n --> n )\\n\\n [ 0 temp put\\n times\\n [ i dup 1+ totient\\n = temp tally ]\\n temp take ] is primecount ( n --> n )\\n\\n 25 times\\n [ say \\\"The totient of \\\"\\n i^ 1+ dup echo\\n say \\\" is \\\"\\n dup totient dup echo\\n say \\\", so it is \\\"\\n 1+ != if say \\\"not \\\"\\n say \\\"prime.\\\" cr ]\\n cr\\n ' [ 100 1000 10000 100000 ]\\n witheach\\n [ say \\\"There are \\\"\\n dup primecount echo\\n say \\\" primes up to \\\" echo\\n say \\\".\\\" cr ]\\n\",\n \"language\": \"Quackery\"\n },\n {\n \"code\": \"#lang racket\\n\\n(require math/number-theory)\\n\\n(define (prime*? n) (= (totient n) (sub1 n)))\\n\\n(for ([n (in-range 1 26)])\\n (printf \\\"φ(~a) = ~a~a~a\\\\n\\\"\\n n\\n (totient n)\\n (if (prime*? n) \\\" is prime\\\" \\\"\\\")\\n (if (prime? n) \\\" (confirmed)\\\" \\\"\\\")))\\n\\n(for/fold ([count 0] #:result (void)) ([n (in-range 1 10001)])\\n (define new-count (if (prime*? n) (add1 count) count))\\n (when (member n '(100 1000 10000))\\n (printf \\\"Primes up to ~a: ~a\\\\n\\\" n new-count))\\n new-count)\\n\",\n \"language\": \"Racket\"\n },\n {\n \"code\": \"use Prime::Factor;\\n\\nmy \\\\𝜑 = 0, |(1..*).hyper.map: -> \\\\t { t * [*] t.&prime-factors.squish.map: { 1 - 1/$_ } }\\n\\nprintf \\\"𝜑(%2d) = %3d %s\\\\n\\\", $_, 𝜑[$_], $_ - 𝜑[$_] - 1 ?? '' !! 'Prime' for 1 .. 25;\\n\\n(1e2, 1e3, 1e4, 1e5).map: -> $limit {\\n say \\\"\\\\nCount of primes <= $limit: \\\" ~ +(^$limit).grep: {$_ == 𝜑[$_] + 1}\\n}\\n\",\n \"language\": \"Raku\"\n },\n {\n \"code\": \"/*REXX program calculates the totient numbers for a range of numbers, and count primes. */\\nparse arg N . /*obtain optional argument from the CL.*/\\nif N=='' | N==\\\",\\\" then N= 25 /*Not specified? Then use the default.*/\\ntell= N>0 /*N positive>? Then display them all. */\\nN= abs(N) /*use the absolute value of N for loop.*/\\nw= length(N) /*W: is used in aligning the output. */\\nprimes= 0 /*the number of primes found (so far).*/\\n /*if N was negative, only count primes.*/\\n do j=1 for N; T= phi(j) /*obtain totient number for a number. */\\n prime= word('(prime)', 1 + (T \\\\== j-1 ) ) /*determine if J is a prime number. */\\n if prime\\\\=='' then primes= primes + 1 /*if a prime, then bump the prime count*/\\n if tell then say 'totient number for ' right(j, w) \\\" ──► \\\" right(T, w) ' ' prime\\n end /*j*/\\nsay\\nsay right(primes, w) ' primes detected for numbers up to and including ' N\\nexit 0 /*stick a fork in it, we're all done. */\\n/*──────────────────────────────────────────────────────────────────────────────────────*/\\ngcd: parse arg x,y; do until y==0; parse value x//y y with y x\\n end /*until*/; return x\\n/*──────────────────────────────────────────────────────────────────────────────────────*/\\nphi: procedure; parse arg z; if z==1 then return 1\\n #= 1\\n do m=2 for z-2; if gcd(m, z)==1 then #= # + 1\\n end /*m*/; return #\\n\",\n \"language\": \"REXX\"\n },\n {\n \"code\": \"/*REXX program calculates the totient numbers for a range of numbers, and count primes. */\\nparse arg N . /*obtain optional argument from the CL.*/\\nif N=='' | N==\\\",\\\" then N= 25 /*Not specified? Then use the default.*/\\ntell= N>0 /*N positive>? Then display them all. */\\nN= abs(N) /*use the absolute value of N for loop.*/\\nw= length(N) /*W: is used in aligning the output. */\\nprimes= 0 /*the number of primes found (so far).*/\\n /*if N was negative, only count primes.*/\\n do j=1 for N; T= phi(j) /*obtain totient number for a number. */\\n prime= word('(prime)', 1 + (T \\\\== j-1 ) ) /*determine if J is a prime number. */\\n if prime\\\\=='' then primes= primes + 1 /*if a prime, then bump the prime count*/\\n if tell then say 'totient number for ' right(j, w) \\\" ──► \\\" right(T, w) ' ' prime\\n end /*j*/\\nsay\\nsay right(primes, w) ' primes detected for numbers up to and including ' N\\nexit 0 /*stick a fork in it, we're all done. */\\n/*──────────────────────────────────────────────────────────────────────────────────────*/\\nphi: procedure; parse arg z; if z==1 then return 1\\n #= 1\\n do m=2 for z-2; parse value m z with x y\\n do until y==0; parse value x//y y with y x\\n end /*until*/\\n if x==1 then #= # + 1\\n end /*m*/\\n return #\\n\",\n \"language\": \"REXX\"\n },\n {\n \"code\": \"require \\\"prime\\\"\\n\\ndef 𝜑(n)\\n n.prime_division.inject(1){|res, (pr, exp)| res * (pr-1) * pr**(exp-1) }\\nend\\n\\n1.upto 25 do |n|\\n tot = 𝜑(n)\\n puts \\\"#{n}\\\\t #{tot}\\\\t #{\\\"prime\\\" if n-tot==1}\\\"\\nend\\n\\n[100, 1_000, 10_000, 100_000].each do |u|\\n puts \\\"Number of primes up to #{u}: #{(1..u).count{|n| n-𝜑(n) == 1} }\\\"\\nend\\n\",\n \"language\": \"Ruby\"\n },\n {\n \"code\": \"use num::integer::gcd;\\n\\nfn main() {\\n // Compute the totient of the first 25 natural integers\\n println!(\\\"N\\\\t phi(n)\\\\t Prime\\\");\\n for n in 1..26 {\\n let phi_n = phi(n);\\n println!(\\\"{}\\\\t {}\\\\t {:?}\\\", n, phi_n, phi_n == n - 1);\\n }\\n\\n // Compute the number of prime numbers for various steps\\n [1, 100, 1000, 10000, 100000]\\n .windows(2)\\n .scan(0, |acc, tuple| {\\n *acc += (tuple[0]..=tuple[1]).filter(is_prime).count();\\n Some((tuple[1], *acc))\\n })\\n .for_each(|x| println!(\\\"Until {}: {} prime numbers\\\", x.0, x.1));\\n}\\n\\nfn is_prime(n: &usize) -> bool {\\n phi(*n) == *n - 1\\n}\\n\\nfn phi(n: usize) -> usize {\\n (1..=n).filter(|&x| gcd(n, x) == 1).count()\\n}\\n\",\n \"language\": \"Rust\"\n },\n {\n \"code\": \"$lines\\n\\nrem - return p mod q\\nfunction mod(p, q = integer) = integer\\nend = p - q * (p / q)\\n\\nrem - return greatest common divisor of x and y\\nfunction gcd(x, y = integer) = integer\\n var r, temp = integer\\n if x < y then\\n begin\\n temp = x\\n x = y\\n y = temp\\n end\\n r = mod(x, y)\\n while r <> 0 do\\n begin\\n x = y\\n y = r\\n r = mod(x, y)\\n end\\nend = y\\n\\nrem - return phi (also called totient) of n\\nfunction phi(n = integer) = integer\\n var i, count = integer\\n count = 1\\n for i = 2 to n\\n if gcd(n, i) = 1 then count = count + 1\\n next i\\nend = count\\n\\nrem - exercise the function\\nvar n, totient, count = integer\\nprint \\\" n Phi(n) Prime?\\\"\\nfor n = 1 to 25\\n totient = phi(n)\\n print using \\\"#### #### \\\";n, totient;\\n if totient + 1 = n then\\n print \\\"yes\\\"\\n else\\n print \\\"no\\\"\\nnext n\\n\\nrem - and further test it by counting primes\\nprint\\ncount = 0\\nfor n = 1 to 1000\\n if phi(n) = n - 1 then count = count + 1\\n if n = 100 then\\n print \\\"Primes up to 100 = \\\";count\\n else if n = 1000 then\\n print \\\"Primes up to 1000 = \\\";count\\nnext n\\n\\nend\\n\",\n \"language\": \"S-BASIC\"\n },\n {\n \"code\": \"@tailrec\\ndef gcd(a: Int, b: Int): Int = if(b == 0) a else gcd(b, a%b)\\ndef totientLaz(num: Int): Int = LazyList.range(2, num).count(gcd(num, _) == 1) + 1\\n\",\n \"language\": \"Scala\"\n },\n {\n \"code\": \"def totientPrd(num: Int): Int = {\\n @tailrec\\n def dTrec(f: Int, n: Int): Int = if(n%f == 0) dTrec(f, n/f) else n\\n\\n @tailrec\\n def tTrec(ac: Int, i: Int, n: Int): Int = if(n != 1){\\n if(n%i == 0) tTrec(ac*(i - 1)/i, i + 1, dTrec(i, n))\\n else tTrec(ac, i + 1, n)\\n }else{\\n ac\\n }\\n\\n tTrec(num, 2, num)\\n}\\n\",\n \"language\": \"Scala\"\n },\n {\n \"code\": \"@tailrec\\ndef scrub(f: Long, num: Long): Long = if(num%f == 0) scrub(f, num/f) else num\\ndef totientLazPrd(num: Long): Long = LazyList.iterate((num, 2: Long, num)){case (ac, i, n) => if(n%i == 0) (ac*(i - 1)/i, i + 1, scrub(i, n)) else (ac, i + 1, n)}.find(_._3 == 1).get._1\\n\",\n \"language\": \"Scala\"\n },\n {\n \"code\": \"program totient;\\n loop for n in [1..1000000] do\\n tot := totient(n);\\n if tot = n-1 then prime +:= 1; end if;\\n\\n if n <= 25 then\\n print(lpad(str n, 2), \\\" \\\",\\n lpad(str tot, 2), \\\" \\\",\\n if tot = n-1 then \\\"prime\\\" else \\\"\\\" end if);\\n end if;\\n\\n if n in [1000,10000,100000,1000000] then\\n print(lpad(str prime,8), \\\"primes up to\\\" + lpad(str n,8));\\n end if;\\n end loop;\\n\\n proc totient(n);\\n tot := n;\\n i := 2;\\n loop while i*i <= n do\\n if n mod i = 0 then\\n loop while n mod i = 0 do\\n n div:= i;\\n end loop;\\n tot -:= tot div i;\\n end if;\\n if i=2 then i:=3;\\n else i+:=2;\\n end if;\\n end loop;\\n if n>1 then\\n tot -:= tot div n;\\n end if;\\n return tot;\\n end proc;\\nend program;\\n\",\n \"language\": \"SETL\"\n },\n {\n \"code\": \"func 𝜑(n) {\\n n.factor_exp.prod {|p|\\n (p[0]-1) * p[0]**(p[1]-1)\\n }\\n}\\n\",\n \"language\": \"Sidef\"\n },\n {\n \"code\": \"for n in (1..25) {\\n var totient = 𝜑(n)\\n printf(\\\"𝜑(%2s) = %3s%s\\\\n\\\", n, totient, totient==(n-1) ? ' - prime' : '')\\n}\\n\",\n \"language\": \"Sidef\"\n },\n {\n \"code\": \"[100, 1_000, 10_000, 100_000].each {|limit|\\n var pi = (1..limit -> count_by {|n| 𝜑(n) == (n-1) })\\n say \\\"Number of primes <= #{limit}: #{pi}\\\"\\n}\\n\",\n \"language\": \"Sidef\"\n },\n {\n \"code\": \" REM PRINT THE DATA FOR N=1 TO 25\\n LET N = 0\\n 10 LET N = N + 1\\n IF N = 26 THEN GOTO 100\\n GOSUB 1000\\n IF T = N - 1 THEN LET P = 1\\n IF T <> N - 1 THEN LET P = 0\\n PRINT N,\\\" \\\", T,\\\" \\\",P\\n GOTO 10\\n 100 REM COUNT PRIMES BELOW 10000\\n LET C = 0\\n LET N = 2\\n 110 GOSUB 1000\\n IF T = N - 1 THEN LET C = C + 1\\n IF N = 100 THEN PRINT \\\"There are \\\", C, \\\" primes below 100.\\\"\\n IF N = 1000 THEN PRINT \\\"There are \\\", C, \\\" primes below 1000.\\\"\\n IF N = 10000 THEN PRINT \\\"There are \\\", C, \\\" primes below 10000.\\\"\\n LET N = N + 1\\n IF N < 10001 THEN GOTO 110\\n END\\n1000 REM TOTIENT FUNCTION OF INTEGER N\\n LET M = 1\\n LET T = 0\\n1010 IF M > N THEN RETURN\\n LET A = N\\n LET B = M REM NEED TO RENAME THESE SO THEY ARE PRESERVED\\n GOSUB 2000\\n IF G = 1 THEN LET T = T + 1\\n LET M = M + 1\\n GOTO 1010\\n2000 REM GCD OF INTEGERS A, B\\n2010 IF A>B THEN GOTO 2020\\n LET B = B - A\\n IF A=0 THEN LET G = B\\n IF A=0 THEN RETURN\\n2020 LET S = A\\n LET A = B\\n LET B = S\\n GOTO 2010\\n\",\n \"language\": \"Tiny-BASIC\"\n },\n {\n \"code\": \"Private Function totient(ByVal n As Long) As Long\\n Dim tot As Long: tot = n\\n Dim i As Long: i = 2\\n Do While i * i <= n\\n If n Mod i = 0 Then\\n Do While True\\n n = n \\\\ i\\n If n Mod i <> 0 Then Exit Do\\n Loop\\n tot = tot - tot \\\\ i\\n End If\\n i = i + IIf(i = 2, 1, 2)\\n Loop\\n If n > 1 Then\\n tot = tot - tot \\\\ n\\n End If\\n totient = tot\\nEnd Function\\n\\nPublic Sub main()\\n Debug.Print \\\" n phi prime\\\"\\n Debug.Print \\\" --------------\\\"\\n Dim count As Long\\n Dim tot As Integer, n As Long\\n For n = 1 To 25\\n tot = totient(n)\\n prime = (n - 1 = tot)\\n count = count - prime\\n Debug.Print Format(n, \\\"@@\\\"); Format(tot, \\\"@@@@@\\\"); Format(prime, \\\"@@@@@@@@\\\")\\n Next n\\n Debug.Print\\n Debug.Print \\\"Number of primes up to 25 = \\\"; Format(count, \\\"@@@@\\\")\\n For n = 26 To 100000\\n count = count - (totient(n) = n - 1)\\n Select Case n\\n Case 100, 1000, 10000, 100000\\n Debug.Print \\\"Number of primes up to\\\"; n; String$(6 - Len(CStr(n)), \\\" \\\"); \\\"=\\\"; Format(count, \\\"@@@@@\\\")\\n Case Else\\n End Select\\n Next n\\nEnd Sub\\n\",\n \"language\": \"VBA\"\n },\n {\n \"code\": \"Imports System.Linq.Enumerable\\n\\nModule Module1\\n\\n Sub Main()\\n For i = 1 To 25\\n Dim t = Totient(i)\\n Console.WriteLine(\\\"{0}{1}{2}{3}\\\", i, vbTab, t, If(t = i - 1, vbTab & \\\"prime\\\", \\\"\\\"))\\n Next\\n Console.WriteLine()\\n\\n Dim j = 100\\n While j <= 100000\\n Console.WriteLine($\\\"{Range(1, j).Count(Function(x) Totient(x) + 1 = x):n0} primes below {j:n0}\\\")\\n j *= 10\\n End While\\n End Sub\\n\\n Function Totient(n As Integer) As Integer\\n If n < 3 Then\\n Return 1\\n End If\\n If n = 3 Then\\n Return 2\\n End If\\n\\n Dim tot = n\\n\\n If (n And 1) = 0 Then\\n tot >>= 1\\n Do\\n n >>= 1\\n Loop While (n And 1) = 0\\n End If\\n\\n Dim i = 3\\n While i * i <= n\\n If n Mod i = 0 Then\\n tot -= tot \\\\ i\\n Do\\n n \\\\= i\\n Loop While (n Mod i) = 0\\n End If\\n i += 2\\n End While\\n\\n If n > 1 Then\\n tot -= tot \\\\ n\\n End If\\n\\n Return tot\\n End Function\\n\\nEnd Module\\n\",\n \"language\": \"Visual-Basic-.NET\"\n },\n {\n \"code\": \"import \\\"./fmt\\\" for Fmt\\n\\nvar totient = Fn.new { |n|\\n var tot = n\\n var i = 2\\n while (i*i <= n) {\\n if (n%i == 0) {\\n while(n%i == 0) n = (n/i).floor\\n tot = tot - (tot/i).floor\\n }\\n if (i == 2) i = 1\\n i = i + 2\\n }\\n if (n > 1) tot = tot - (tot/n).floor\\n return tot\\n}\\n\\nSystem.print(\\\" n phi prime\\\")\\nSystem.print(\\\"---------------\\\")\\nvar count = 0\\nfor (n in 1..25) {\\n var tot = totient.call(n)\\n var isPrime = (n - 1) == tot\\n if (isPrime) count = count + 1\\n System.print(\\\"%(Fmt.d(2, n)) %(Fmt.d(2, tot)) %(isPrime)\\\")\\n}\\nSystem.print(\\\"\\\\nNumber of primes up to 25 = %(count)\\\")\\nfor (n in 26..100000) {\\n var tot = totient.call(n)\\n if (tot == n - 1) count = count + 1\\n if (n == 100 || n == 1000 || n%10000 == 0) {\\n System.print(\\\"\\\\nNumber of primes up to %(Fmt.d(-6, n)) = %(count)\\\")\\n }\\n}\\n\",\n \"language\": \"Wren\"\n },\n {\n \"code\": \"func GCD(N, D); \\\\Return the greatest common divisor of N and D\\nint N, D; \\\\numerator and denominator\\nint R;\\n[if D > N then\\n [R:= D; D:= N; N:= R]; \\\\swap D and N\\nwhile D > 0 do\\n [R:= rem(N/D);\\n N:= D;\\n D:= R;\\n ];\\nreturn N;\\n]; \\\\GCD\\n\\nfunc Totient(N); \\\\Return the totient of N\\nint N, Phi, M;\\n[Phi:= 0;\\nfor M:= 1 to N do\\n if GCD(M, N) = 1 then Phi:= Phi+1;\\nreturn Phi;\\n];\\n\\nint N, Phi, Pwr, C, Limit;\\n[Text(0, \\\"n phi is prime^m^j\\\");\\nfor N:= 1 to 25 do\\n [IntOut(0, N); ChOut(0, 9\\\\tab\\\\);\\n Phi:= Totient(N);\\n IntOut(0, Phi); ChOut(0, 9\\\\tab\\\\);\\n Text(0, if Phi = N-1 then \\\"true\\\" else \\\"false\\\");\\n CrLf(0);\\n ];\\nCrLf(0);\\nfor Pwr:= 2 to 4 do\\n [C:= 0;\\n Limit:= fix(Pow(10.0, float(Pwr)));\\n IntOut(0, Limit); ChOut(0, 9\\\\tab\\\\);\\n for N:= 1 to Limit do\\n [Phi:= Totient(N);\\n if Phi = N-1 then C:= C+1;\\n ];\\n IntOut(0, C); CrLf(0);\\n ];\\n]\\n\",\n \"language\": \"XPL0\"\n },\n {\n \"code\": \"fcn totient(n){ [1..n].reduce('wrap(p,k){ p + (n.gcd(k)==1) }) }\\nfcn isPrime(n){ totient(n)==(n - 1) }\\n\",\n \"language\": \"Zkl\"\n },\n {\n \"code\": \"foreach n in ([1..25]){\\n println(\\\"\\\\u03c6(%2d) ==%3d %s\\\"\\n .fmt(n,totient(n),isPrime(n) and \\\"is prime\\\" or \\\"\\\"));\\n}\\n\",\n \"language\": \"Zkl\"\n },\n {\n \"code\": \"count:=0;\\nforeach n in ([1..10_000]){\\t// yes, this is sloooow\\n count+=isPrime(n);\\n if(n==100 or n==1000 or n==10_000)\\n println(\\\"Primes <= %,6d : %,5d\\\".fmt(n,count));\\n}\\n\",\n \"language\": \"Zkl\"\n }\n]","isConversational":false},"task_name":{"kind":"string","value":"Totient-function"}}},{"rowIdx":1767,"cells":{"solutions":{"kind":"list like","value":[{"code":"---\ncategory:\n- Recursion\n- Games\nfrom: http://rosettacode.org/wiki/Towers_of_Hanoi\nnote: Classic CS problems and programs\n","language":"00-META"},{"code":";Task:\nSolve the [[wp:Towers_of_Hanoi|Towers of Hanoi]] problem with recursion.\n<br><br>\n\n","language":"00-TASK"},{"code":"F hanoi(ndisks, startPeg = 1, endPeg = 3) -> N\n I ndisks\n hanoi(ndisks - 1, startPeg, 6 - startPeg - endPeg)\n print(‘Move disk #. from peg #. to peg #.’.format(ndisks, startPeg, endPeg))\n hanoi(ndisks - 1, 6 - startPeg - endPeg, endPeg)\n\nhanoi(ndisks' 3)\n","language":"11l"},{"code":"* Towers of Hanoi 08/09/2015\nHANOITOW CSECT\n USING HANOITOW,R12 r12 : base register\n LR R12,R15 establish base register\n ST R14,SAVE14 save r14\nBEGIN LH R2,=H'4' n <===\n L R3,=C'123 ' stating position\n BAL R14,MOVE r1=move(m,n)\nRETURN L R14,SAVE14 restore r14\n BR R14 return to caller\nSAVE14 DS F static save r14\nPG DC CL44'xxxxxxxxxxxx Move disc from pole X to pole Y'\nNN DC F'0'\nPOLEX DS F current poles\nPOLEN DS F new poles\n* .... recursive subroutine move(n, poles) [r2,r3]\nMOVE LR R10,R11 save stackptr (r11) in r10 temp\n LA R1,STACKLEN amount of storage required\n GETMAIN RU,LV=(R1) allocate storage for stack\n USING STACKDS,R11 make storage addressable\n LR R11,R1 establish stack addressability\n ST R14,SAVE14M save previous r14\n ST R10,SAVE11M save previous r11\n LR R1,R5 restore saved argument r5\nBEGINM STM R2,R3,STACK push arguments to stack\n ST R3,POLEX\n CH R2,=H'1' if n<>1\n BNE RECURSE then goto recurse\n L R1,NN\n LA R1,1(R1) nn=nn+1\n ST R1,NN\n XDECO R1,PG nn\n MVC PG+33(1),POLEX+0 from\n MVC PG+43(1),POLEX+1 to\n XPRNT PG,44 print \"move disk from to\"\n B RETURNM\nRECURSE L R2,N n\n BCTR R2,0 n=n-1\n MVC POLEN+0(1),POLES+0 from\n MVC POLEN+1(1),POLES+2 via\n MVC POLEN+2(1),POLES+1 to\n L R3,POLEN new poles\n BAL R14,MOVE call move(n-1,from,via,to)\n LA R2,1 n=1\n MVC POLEN,POLES\n L R3,POLEN new poles\n BAL R14,MOVE call move(1,from,to,via)\n L R2,N n\n BCTR R2,0 n=n-1\n MVC POLEN+0(1),POLES+2 via\n MVC POLEN+1(1),POLES+1 to\n MVC POLEN+2(1),POLES+0 from\n L R3,POLEN new poles\n BAL R14,MOVE call move(n-1,via,to,from)\nRETURNM LM R2,R3,STACK pull arguments from stack\n LR R1,R11 current stack\n L R14,SAVE14M restore r14\n L R11,SAVE11M restore r11\n LA R0,STACKLEN amount of storage to free\n FREEMAIN A=(R1),LV=(R0) free allocated storage\n BR R14 return to caller\n LTORG\n DROP R12 base no longer needed\nSTACKDS DSECT dynamic area\nSAVE14M DS F saved r14\nSAVE11M DS F saved r11\nSTACK DS 0F stack\nN DS F r2 n\nPOLES DS F r3 poles\nSTACKLEN EQU *-STACKDS\n YREGS\n END HANOITOW\n","language":"360-Assembly"},{"code":"temp = $FB ; this works on a VIC-20 or C-64; adjust for other machines. Need two bytes zero-page space unused by the OS.\n\n; kernal print-char routine\nchrout = $FFD2\n\n; Main Towers of Hanoi routine. To call, load the accumulator with the number of disks to move,\n; the X register with the source peg (1-3), and the Y register with the target peg.\n\nhanoi: cmp #$00 ; do nothing if the number of disks to move is zero\n bne nonzero\n rts\n\nnonzero: pha ; save registers on stack\n txa\n pha\n tya\n pha\n pha ; and make room for the spare peg number\n\n ; Parameters are now on the stack at these offsets:\n count = $0104\n source = $0103\n target = $0102\n spare = $0101\n\n ; compute spare rod number (6 - source - dest)\n tsx\n lda #6\n sec\n sbc source, x\n sec\n sbc target, x\n sta spare, x\n\n ; prepare for first recursive call\n tay ; target is the spare peg\n\n tsx\n lda source, x ; source is the same\n sta temp ; we're using X to access the stack, so save its value here for now\n\n lda count, x ; move count - 1 disks\n sec\n sbc #1\n ldx temp ; now load X for call\n\n ; and recurse\n jsr hanoi\n\n ; restore X and Y for print call\n tsx\n ldy target, x\n lda source, x\n tax\n\n ; print instructions to move the last disk\n jsr print_move\n\n ; prepare for final recursive call\n tsx\n lda spare, x ; source is now spare\n sta temp\n lda target, x ; going to the original target\n tay\n lda count, x ; and again moving count-1 disks\n sec\n sbc #1\n ldx temp\n jsr hanoi\n\n ; pop our stack frame, restore registers, and return\n pla\n pla\n tay\n pla\n tax\n pla\n rts\n\n; constants for printing\nprelude: .asciiz \"MOVE DISK FROM \"\ninterlude: .asciiz \" TO \"\npostlude: .byte 13,0\n\n; print instructions: move disk from (X) to (Y)\nprint_move:\n pha\n txa\n pha\n tya\n pha\n\n ; Parameters are now on the stack at these offsets:\n from = $0102\n to = $0101\n\n lda #<prelude\n ldx #>prelude\n jsr print_string\n tsx\n lda from,x\n clc\n adc #$30\n jsr chrout\n lda #<interlude\n ldx #>interlude\n jsr print_string\n tsx\n lda to,x\n clc\n adc #$30\n jsr chrout\n lda #<postlude\n ldx #>postlude\n jsr print_string\n pla\n tay\n pla\n tax\n pla\n rts\n\n; utility routine: print null-terminated string at address AX\nprint_string:\n sta temp\n stx temp+1\n ldy #0\nloop: lda (temp),y\n beq done_print\n jsr chrout\n iny\n bne loop\ndone_print:\n rts\n","language":"6502-Assembly"},{"code":"\torg\t100h\n\tlhld\t6\t; Top of CP/M usable memory\n\tsphl\t\t; Put the stack there\n\tlxi\tb,0401h\t; Set up first arguments to move()\n\tlxi\td,0203h\n\tcall\tmove\t; move(4, 1, 2, 3)\n\trst\t0\t; quit program\n\t;;;\tMove B disks from C via D to E.\nmove:\tdcr\tb\t; One fewer disk in next iteration\n\tjz\tmvout\t; If this was the last disk, print move and stop\n\tpush\tb\t; Otherwise, save registers,\n\tpush\td\n\tmov\ta,d\t; First recursive call\n\tmov\td,e\n\tmov\te,a\n\tcall\tmove\t; move(B-1, C, E, D)\n\tpop\td\t; Restore registers\n\tpop\tb\n\tcall\tmvout\t; Print current move\n\tmov\ta,c\t; Second recursive call\n\tmov\tc,d\n\tmov\td,a\n\tjmp\tmove\t; move(B-1, D, C, E) - tail call optimization\n\t;;;\tPrint move, saving registers.\nmvout:\tpush\tb\t; Save registers on stack\n\tpush\td\n\tmov\ta,c\t; Store 'from' as ASCII digit in 'from' space\n\tadi\t'0'\n\tsta\tout1\n\tmov\ta,e\t; Store 'to' as ASCII digit in 'to' space\n\tadi\t'0'\n\tsta\tout2\n\tlxi\td,outstr\n\tmvi\tc,9\t; CP/M call to print the string\n\tcall\t5\n\tpop\td\t; Restore register contents\n\tpop\tb\n\tret\n\t;;;\tMove output with placeholder for pole numbers\noutstr:\tdb\t'Move disk from pole '\nout1:\tdb\t'* to pole '\nout2:\tdb\t'*',13,10,'$'\n","language":"8080-Assembly"},{"code":"\tcpu\t8086\n\tbits\t16\n\torg\t100h\nsection\t.text\n\tmov\tbx,0402h\t; Set up first arguments to move()\n\tmov\tcx,0103h\t; Registers chosen s.t. CX contains output\n\t;;;\tMove BH disks from CH via BL to CL\nmove:\tdec\tbh\t\t; One fewer disk in next iteration\n\tjz\t.out\t\t; If this was last disk, just print move\n\tpush\tbx\t\t; Save the registers for a recursive call\n\tpush\tcx\n\txchg\tbl,cl\t\t; Swap the 'to' and 'via' registers\n\tcall\tmove\t\t; move(BH, CH, CL, BL)\n\tpop\tcx\t\t; Restore the registers from the stack\n\tpop\tbx\n\tcall\t.out\t\t; Print the move\n\txchg\tch,bl\t\t; Swap the 'from' and 'via' registers\n\tjmp\tmove\t\t; move(BH, BL, CH, CL)\n\t;;;\tPrint the move\n.out:\tmov\tax,'00'\t\t; Add ASCII 0 to both 'from' and 'to'\n\tadd\tax,cx\t\t; in one 16-bit operation\n\tmov\t[out1],ah\t; Store 'from' field in output\n\tmov\t[out2],al\t; Store 'to' field in output\n\tmov\tdx,outstr\t; MS-DOS system call to print string\n\tmov\tah,9\n\tint\t21h\n\tret\nsection\t.data\noutstr:\tdb\t'Move disk from pole '\nout1:\tdb\t'* to pole '\nout2:\tdb\t'*',13,10,'$'\n","language":"8086-Assembly"},{"code":"5 var, disks\nvar sa\nvar sb\nvar sc\n\n: save sc ! sb ! sa ! disks ! ;\n: get sa @ sb @ sc @ ;\n: get2 get swap ;\n: hanoi\n\tsave disks @ not if ;; then\n\tdisks @ get\n\tdisks @ n:1- get2 hanoi save\n\tcr\n\t\" move a ring from \" . sa @ . \" to \" . sb @ .\n\tdisks @ n:1- get2 rot hanoi\n;\n\n\" Tower of Hanoi, with \" . disks @ . \" rings: \" .\ndisks @ 1 2 3 hanoi cr bye\n","language":"8th"},{"code":"HOW TO MOVE n DISKS FROM src VIA via TO dest:\n IF n>0:\n MOVE n-1 DISKS FROM src VIA dest TO via\n WRITE \"Move disk from pole\", src, \"to pole\", dest/\n MOVE n-1 DISKS FROM via VIA dest TO src\n\nMOVE 4 DISKS FROM 1 VIA 2 TO 3\n","language":"ABC"},{"code":";;; Iterative Towers of Hanoi; translated from Tiny BASIC via PL/M\n;;;\n\nDEFINE NUMBER_OF_DISCS = \"4\"\n\nPROC Main()\n\n INT d, n, x\n\n n = 1\n FOR d = 1 TO NUMBER_OF_DISCS DO\n n = n + n\n OD\n FOR x = 1 TO n - 1 DO\n ; as with Algol W, PL/M, Action! has bit and MOD operators\n Print( \"Move disc on peg \" )\n Put( '1 + ( ( x AND ( x - 1 ) ) MOD 3 ) )\n Print( \" to peg \" )\n Put( '1 + ( ( ( x OR ( x - 1 ) ) + 1 ) MOD 3 ) )\n PutE()\n OD\nRETURN\n","language":"Action-"},{"code":"public function move(n:int, from:int, to:int, via:int):void\n{\n if (n > 0)\n {\n move(n - 1, from, via, to);\n trace(\"Move disk from pole \" + from + \" to pole \" + to);\n move(n - 1, via, to, from);\n }\n}\n","language":"ActionScript"},{"code":"with Ada.Text_Io; use Ada.Text_Io;\n\nprocedure Towers is\n type Pegs is (Left, Center, Right);\n procedure Hanoi (Ndisks : Natural; Start_Peg : Pegs := Left; End_Peg : Pegs := Right; Via_Peg : Pegs := Center) is\n begin\n if Ndisks > 0 then\n Hanoi(Ndisks - 1, Start_Peg, Via_Peg, End_Peg);\n Put_Line(\"Move disk\" & Natural'Image(Ndisks) & \" from \" & Pegs'Image(Start_Peg) & \" to \" & Pegs'Image(End_Peg));\n Hanoi(Ndisks - 1, Via_Peg, End_Peg, Start_Peg);\n end if;\n end Hanoi;\nbegin\n Hanoi(4);\nend Towers;\n","language":"Ada"},{"code":"move := proc(n::number, src::number, dst::number, via::number) is\n if n > 0 then\n move(n - 1, src, via, dst)\n print(src & ' to ' & dst)\n move(n - 1, via, dst, src)\n fi\nend\n\nmove(4, 1, 2, 3)\n","language":"Agena"},{"code":"begin\n procedure movedisk(n, f, t);\n integer n, f, t;\n begin\n outstring (1, \"Move disk from\");\n outinteger(1, f);\n outstring (1, \"to\");\n outinteger(1, t);\n outstring (1, \"\\n\");\n end;\n\n procedure dohanoi(n, f, t, u);\n integer n, f, t, u;\n begin\n if n < 2 then\n movedisk(1, f, t)\n else\n begin\n dohanoi(n - 1, f, u, t);\n movedisk(1, f, t);\n dohanoi(n - 1, u, t, f);\n end;\n end;\n\n dohanoi(4, 1, 2, 3);\n outstring(1,\"Towers of Hanoi puzzle completed!\")\nend\n","language":"ALGOL-60"},{"code":"PROC move = (INT n, from, to, via) VOID:\n IF n > 0 THEN\n move(n - 1, from, via, to);\n printf(($\"Move disk from pole \"g\" to pole \"gl$, from, to));\n move(n - 1, via, to, from)\n FI\n;\n\nmain: (\n move(4, 1,2,3)\n)\n","language":"ALGOL-68"},{"code":"PROC move = (INT n, from, to, via) VOID:\n IF n > 0 THEN\n move(n - 1, from, via, to);\n printf(($\"Move disk \"g\" from pole \"g\" to pole \"gl$, n, from, to));\n move(n - 1, via, to, from)\n FI ;\nmain: (\n move(4, 1,2,3)\n)\n","language":"ALGOL-68"},{"code":"begin\nprocedure move(n, src, via, dest);\ninteger n;\nstring(1) src, via, dest;\nbegin\n if n > 0 then\n begin\n move(n-1, src, dest, via);\n write(\"Move disk from pole \");\n writeon(src);\n writeon(\" to pole \");\n writeon(dest);\n move(n-1, via, src, dest);\n end;\nend;\n\nmove(4, \"1\", \"2\", \"3\");\nend\n","language":"ALGOL-M"},{"code":"begin\n procedure move ( integer value n, from, to, via ) ;\n if n > 0 then begin\n move( n - 1, from, via, to );\n write( i_w := 1, s_w := 0, \"Move disk from peg: \", from, \" to peg: \", to );\n move( n - 1, via, to, from )\n end move ;\n\n move( 4, 1, 2, 3 )\nend.\n","language":"ALGOL-W"},{"code":"begin % iterative towers of hanoi - translated from Tiny Basic %\n integer d, n;\n while begin writeon( \"How many disks? \" );\n read( d );\n d < 1 or d > 10\n end\n do begin end;\n n := 1;\n while d not = 0 do begin\n d := d - 1;\n n := 2 * n\n end;\n for x := 1 until n - 1 do begin\n integer s, t;\n % Algol W has the necessary bit and modulo operators so these are used here %\n % instead of implementing them via subroutines %\n s := number( bitstring( x ) and bitstring( x - 1 ) ) rem 3;\n t := ( number( bitstring( x ) or bitstring( x - 1 ) ) + 1 ) rem 3;\n write( i_w := 1, s_w := 0, \"Move disc on peg \", s + 1, \" to peg \", t + 1 )\n end\nend.\n","language":"ALGOL-W"},{"code":"#include <hopper.h>\n#proto hanoi(_X_,_Y_,_Z_,_W_)\nmain:\n get arg number (2,discos)\n {discos}!neg? do{fail=0,mov(fail),{\"I need a positive (or zero) number here, not: \",fail}println,exit(0)}\n pos? do{\n _hanoi( discos, \"A\", \"B\", \"C\" )\n }\nexit(0)\n.locals\nhanoi(discos,inicio,aux,fin)\n iif( {discos}eqto(1), {inicio, \"->\", fin, \"\\n\"};print, _hanoi({discos}minus(1), inicio,fin,aux);\\\n {inicio, \"->\", fin, \"\\n\"};print;\\\n _hanoi({discos}minus(1), aux, inicio, fin))\nback\n","language":"Amazing-Hopper"},{"code":"PROC move(n, from, to, via)\n IF n > 0\n move(n-1, from, via, to)\n WriteF('Move disk from pole \\d to pole \\d\\n', from, to)\n move(n-1, via, to, from)\n ENDIF\nENDPROC\n\nPROC main()\n move(4, 1,2,3)\nENDPROC\n","language":"AmigaE"},{"code":"hanoi←{\n move←{\n n from to via←⍵\n n≤0:⍬\n l←∇(n-1) from via to\n r←∇(n-1) via to from\n l,(⊂from to),r\n }\n '⊂Move disk from pole ⊃,I1,⊂ to pole ⊃,I1'⎕FMT↑move ⍵\n}\n","language":"APL"},{"code":"--------------------- TOWERS OF HANOI --------------------\n\n-- hanoi :: Int -> (String, String, String) -> [(String, String)]\non hanoi(n, abc)\n script go\n on |λ|(n, {x, y, z})\n if n > 0 then\n set m to n - 1\n\n |λ|(m, {x, z, y}) & ¬\n {{x, y}} & |λ|(m, {z, y, x})\n else\n {}\n end if\n end |λ|\n end script\n\n go's |λ|(n, abc)\nend hanoi\n\n\n--------------------------- TEST -------------------------\non run\n unlines(map(intercalate(\" -> \"), ¬\n hanoi(3, {\"left\", \"right\", \"mid\"})))\nend run\n\n\n-------------------- GENERIC FUNCTIONS -------------------\n\n-- intercalate :: String -> [String] -> String\non intercalate(delim)\n script\n on |λ|(xs)\n set {dlm, my text item delimiters} to ¬\n {my text item delimiters, delim}\n set s to xs as text\n set my text item delimiters to dlm\n s\n end |λ|\n end script\nend intercalate\n\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\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-- 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","language":"AppleScript"},{"code":"on hanoi(n, source, target)\n set t1 to tab & \"tower 1: \" & tab\n set t2 to tab & \"tower 2: \" & tab\n set t3 to tab & \"tower 3: \" & tab\n\n script o\n property m : 0\n property tower1 : {}\n property tower2 : {}\n property tower3 : {}\n property towerRefs : {a reference to tower1, a reference to tower2, a reference to tower3}\n property process : missing value\n\n on |move|(n, source, target)\n set aux to 6 - source - target\n repeat with n from n to 2 by -1 -- Tail call elimination repeat.\n |move|(n - 1, source, aux)\n set end of item target of my towerRefs to n\n tell item source of my towerRefs to set its contents to reverse of rest of its reverse\n set m to m + 1\n set end of my process to ¬\n {(m as text) & \". move disc \" & n & (\" from tower \" & source) & (\" to tower \" & target & \":\"), ¬\n t1 & tower1, ¬\n t2 & tower2, ¬\n t3 & tower3}\n tell source\n set source to aux\n set aux to it\n end tell\n end repeat\n -- Specific code for n = 1:\n set end of item target of my towerRefs to 1\n tell item source of my towerRefs to set its contents to reverse of rest of its reverse\n set m to m + 1\n set end of my process to ¬\n {(m as text) & \". move disc 1 from tower \" & source & (\" to tower \" & target & \":\"), ¬\n t1 & tower1, ¬\n t2 & tower2, ¬\n t3 & tower3}\n end |move|\n end script\n\n repeat with i from n to 1 by -1\n set end of item source of o's towerRefs to i\n end repeat\n\n set astid to AppleScript's text item delimiters\n set AppleScript's text item delimiters to \", \"\n set o's process to {\"Starting with \" & n & (\" discs on tower \" & (source & \":\")), ¬\n t1 & o's tower1, t2 & o's tower2, t3 & o's tower3}\n if (n > 0) then tell o to |move|(n, source, target)\n set end of o's process to \"That's it!\"\n set AppleScript's text item delimiters to linefeed\n set process to o's process as text\n set AppleScript's text item delimiters to astid\n\n return process\nend hanoi\n\n-- Test:\nset numberOfDiscs to 3\nset sourceTower to 1\nset destinationTower to 2\nhanoi(numberOfDiscs, sourceTower, destinationTower)\n","language":"AppleScript"},{"code":".text\n.global\t_start\n_start:\tmov\tr0,#4\t\t@ 4 disks,\n\tmov\tr1,#1\t\t@ from pole 1,\n\tmov\tr2,#2\t\t@ via pole 2,\n\tmov\tr3,#3\t\t@ to pole 3.\n\tbl\tmove\n\tmov\tr0,#0\t\t@ Exit to Linux afterwards\n\tmov\tr7,#1\n\tswi\t#0\n\t@@@\tMove r0 disks from r1 via r2 to r3\nmove:\tsubs\tr0,r0,#1\t@ One fewer disk in next iteration\n\tbeq\tshow\t\t@ If last disk, just print move\n\tpush\t{r0-r3,lr}\t@ Save all the registers incl. link register\n\teor\tr2,r2,r3\t@ Swap the 'to' and 'via' registers\n\teor\tr3,r2,r3\n\teor\tr2,r2,r3\n\tbl\tmove\t\t@ Recursive call\n\tpop\t{r0-r3}\t\t@ Restore all the registers except LR\n\tbl\tshow\t\t@ Show current move\n\teor\tr1,r1,r3\t@ Swap the 'to' and 'via' registers\n\teor\tr3,r1,r3\n\teor\tr1,r1,r3\n\tpop\t{lr}\t\t@ Restore link register\n\tb\tmove\t\t@ Tail call\n\t@@@\tShow move\nshow:\tpush\t{r0-r3,lr}\t@ Save all the registers\n\tadd\tr1,r1,#'0\t@ Write the source pole\n\tldr\tlr,=spole\n\tstrb\tr1,[lr]\n\tadd\tr3,r3,#'0\t@ Write the destination pole\n\tldr\tlr,=dpole\n\tstrb\tr3,[lr]\n\tmov\tr0,#1\t\t@ 1 = stdout\n\tldr\tr1,=moves\t@ Pointer to string\n\tldr\tr2,=mlen\t@ Length of string\n\tmov\tr7,#4\t\t@ 4 = Linux write syscall\n\tswi\t#0 \t\t@ Print the move\n\tpop\t{r0-r3,pc}\t@ Restore all the registers and return\n.data\nmoves:\t.ascii\t\"Move disk from pole \"\nspole:\t.ascii\t\"* to pole \"\ndpole:\t.ascii\t\"*\\n\"\nmlen\t=\t. - moves\n","language":"ARM-Assembly"},{"code":"hanoi: function [n f dir via][\n\tif n>0 [\n\t\thanoi n-1 f via dir\n\t\tprint [\"Move disk\" n \"from\" f \"to\" dir]\n\t\thanoi n-1 via dir f\n\t]\n]\n\nhanoi 3 'L 'M 'R\n","language":"Arturo"},{"code":"move(n, from, to, via) ;n = # of disks, from = start pole, to = end pole, via = remaining pole\n{\n if (n = 1)\n {\n msgbox , Move disk from pole %from% to pole %to%\n }\n else\n {\n move(n-1, from, via, to)\n move(1, from, to, via)\n move(n-1, via, to, from)\n }\n}\nmove(64, 1, 3, 2)\n","language":"AutoHotkey"},{"code":"Func move($n, $from, $to, $via)\n\tIf ($n = 1) Then\n\t\tConsoleWrite(StringFormat(\"Move disk from pole \"&$from&\" To pole \"&$to&\"\\n\"))\n\tElse\n\t\tmove($n - 1, $from, $via, $to)\n\t\tmove(1, $from, $to, $via)\n\t\tmove($n - 1, $via, $to, $from)\n\tEndIf\nEndFunc\n\nmove(4, 1,2,3)\n","language":"AutoIt"},{"code":"$ awk 'func hanoi(n,f,t,v){if(n>0){hanoi(n-1,f,v,t);print(f,\"->\",t);hanoi(n-1,v,t,f)}}\nBEGIN{hanoi(4,\"left\",\"middle\",\"right\")}'\n","language":"AWK"},{"code":"SUB move (n AS Integer, fromPeg AS Integer, toPeg AS Integer, viaPeg AS Integer)\n IF n>0 THEN\n move n-1, fromPeg, viaPeg, toPeg\n PRINT \"Move disk from \"; fromPeg; \" to \"; toPeg\n move n-1, viaPeg, toPeg, fromPeg\n END IF\nEND SUB\n\nmove 4,1,2,3\n","language":"BASIC"},{"code":"10 DEPTH=4: REM SHOULD EQUAL NUMBER OF DISKS\n20 DIM N(DEPTH), F(DEPTH), T(DEPTH), V(DEPTH): REM STACK PER PARAMETER\n30 SP = 0: REM STACK POINTER\n40 N(SP) = 4: REM START WITH 4 DISCS\n50 F(SP) = 1: REM ON PEG 1\n60 T(SP) = 2: REM MOVE TO PEG 2\n70 V(SP) = 3: REM VIA PEG 3\n80 GOSUB 100\n90 END\n99 REM MOVE SUBROUTINE\n100 IF N(SP) = 0 THEN RETURN\n110 OS = SP: REM STORE STACK POINTER\n120 SP = SP + 1: REM INCREMENT STACK POINTER\n130 N(SP) = N(OS) - 1: REM MOVE N-1 DISCS\n140 F(SP) = F(OS) : REM FROM START PEG\n150 T(SP) = V(OS) : REM TO VIA PEG\n160 V(SP) = T(OS) : REM VIA TO PEG\n170 GOSUB 100\n180 OS = SP - 1: REM OS WILL HAVE CHANGED\n190 PRINT \"MOVE DISC FROM\"; F(OS); \"TO\"; T(OS)\n200 N(SP) = N(OS) - 1: REM MOVE N-1 DISCS\n210 F(SP) = V(OS) : REM FROM VIA PEG\n220 T(SP) = T(OS) : REM TO DEST PEG\n230 V(SP) = F(OS) : REM VIA FROM PEG\n240 GOSUB 100\n250 SP = SP - 1 : REM RESTORE STACK POINTER FOR CALLER\n260 RETURN\n","language":"BASIC"},{"code":" 10 DEF FNM3(X)=X-INT(X/3)*3:REM MODULO 3\n 20 N=4:GOSUB 100\n 30 END\n 99 REM HANOI\n 100 :FOR M=1 TO 2^N-1\n 110 ::PRINT MID$(STR$(M),2);\":\",FNM3(M AND M-1)+1;\"TO\";FNM3((M OR M-1)+1)+1\n 130 :NEXT M\n 140 RETURN\n","language":"BASIC"},{"code":"call move(4,1,2,3)\nprint \"Towers of Hanoi puzzle completed!\"\nend\n\nsubroutine move (n, fromPeg, toPeg, viaPeg)\n if n>0 then\n call move(n-1, fromPeg, viaPeg, toPeg)\n print \"Move disk from \"+fromPeg+\" to \"+toPeg\n call move(n-1, viaPeg, toPeg, fromPeg)\n end if\nend subroutine\n","language":"BASIC256"},{"code":"@echo off\nsetlocal enabledelayedexpansion\n\n\t%==The main thing==%\n\t%==First param - Number of disks==%\n\t%==Second param - Start pole==%\n\t%==Third param - End pole==%\n\t%==Fourth param - Helper pole==%\ncall :move 4 START END HELPER\necho.\npause\nexit /b 0\n\n\t%==The \"function\"==%\n:move\n\tsetlocal\n\tset n=%1\n\tset from=%2\n\tset to=%3\n\tset via=%4\n\n\tif %n% gtr 0 (\n\t\tset /a x=!n!-1\n\t\tcall :move !x! %from% %via% %to%\n\t\techo Move top disk from pole %from% to pole %to%.\n\t\tcall :move !x! %via% %to% %from%\n\t)\n\texit /b 0\n","language":"Batch-File"},{"code":" DIM Disc$(13),Size%(3)\n FOR disc% = 1 TO 13\n Disc$(disc%) = STRING$(disc%,\" \")+STR$disc%+STRING$(disc%,\" \")\n IF disc%>=10 Disc$(disc%) = MID$(Disc$(disc%),2)\n Disc$(disc%) = CHR$17+CHR$(128+disc%-(disc%>7))+Disc$(disc%)+CHR$17+CHR$128\n NEXT disc%\n\n MODE 3\n OFF\n ndiscs% = 13\n FOR n% = ndiscs% TO 1 STEP -1\n PROCput(n%,1)\n NEXT\n INPUT TAB(0,0) \"Press Enter to start\" dummy$\n PRINT TAB(0,0) SPC(20);\n PROChanoi(ndiscs%,1,2,3)\n VDU 30\n END\n\n DEF PROChanoi(a%,b%,c%,d%)\n IF a%=0 ENDPROC\n PROChanoi(a%-1,b%,d%,c%)\n PROCtake(a%,b%)\n PROCput(a%,c%)\n PROChanoi(a%-1,d%,c%,b%)\n ENDPROC\n\n DEF PROCput(disc%,peg%)\n PRINTTAB(13+26*(peg%-1)-disc%,20-Size%(peg%))Disc$(disc%);\n Size%(peg%) = Size%(peg%)+1\n ENDPROC\n\n DEF PROCtake(disc%,peg%)\n Size%(peg%) = Size%(peg%)-1\n PRINTTAB(13+26*(peg%-1)-disc%,20-Size%(peg%))STRING$(2*disc%+1,\" \");\n ENDPROC\n","language":"BBC-BASIC"},{"code":"get \"libhdr\"\n\nlet start() be move(4, 1, 2, 3)\nand move(n, src, via, dest) be if n > 0 do\n$( move(n-1, src, dest, via)\n writef(\"Move disk from pole %N to pole %N*N\", src, dest);\n move(n-1, via, src, dest)\n$)\n","language":"BCPL"},{"code":"48*2+1>#v_:!#@_0\" ksid evoM\">:#,_$:8/:.v\n>8v8:<$#<+9-+*2%3\\*3/3:,+55.+1%3:$_,#!>#:<\n: >/!#^_:0\\:8/1-8vv,_$8%:3/1+.>0\" gep ot\"^\n^++3-%3\\*2/3:%8\\*<>:^:\"from peg \"0\\*8-1<\n","language":"Befunge"},{"code":"Move ← {\n 𝕩⊑⊸≤0 ? ⟨⟩;\n 𝕊 n‿from‿to‿via:\n l ← 𝕊 ⟨n-1, from, via, to⟩\n r ← 𝕊 ⟨n-1, via, to, from⟩\n l∾(<from‿to)∾r\n}\n{\"Move disk from pole \"∾(•Fmt 𝕨)∾\" to pole \"∾•Fmt 𝕩}´˘>Move 4‿1‿2‿3\n","language":"BQN"},{"code":"┌─\n╵\"Move disk from pole 1 to pole 3\n Move disk from pole 1 to pole 2\n Move disk from pole 3 to pole 2\n Move disk from pole 1 to pole 3\n Move disk from pole 2 to pole 1\n Move disk from pole 2 to pole 3\n Move disk from pole 1 to pole 3\n Move disk from pole 1 to pole 2\n Move disk from pole 3 to pole 2\n Move disk from pole 3 to pole 1\n Move disk from pole 2 to pole 1\n Move disk from pole 3 to pole 2\n Move disk from pole 1 to pole 3\n Move disk from pole 1 to pole 2\n Move disk from pole 3 to pole 2\"\n ┘\n","language":"BQN"},{"code":"( ( move\n = n from to via\n . !arg:(?n,?from,?to,?via)\n & ( !n:>0\n & move$(!n+-1,!from,!via,!to)\n & out$(\"Move disk from pole \" !from \" to pole \" !to)\n & move$(!n+-1,!via,!to,!from)\n |\n )\n )\n& move$(4,1,2,3)\n);\n","language":"Bracmat"},{"code":"[\nThis implementation is recursive and uses\na stack, consisting of frames that are 8\nbytes long. The layout is as follows:\n\nByte Description\n 0 recursion flag\n (the program stops if the flag is\n zero)\n 1 the step which is currently\n executed\n 4 means a call to\n move(a, c, b, n - 1)\n 3 means a call to\n move(a, b, c, 1)\n 2 means a call to\n move(b, a, c, n - 1)\n 1 prints the source and dest pile\n 2 flag to check whether the current\n step has already been done or if\n it still must be executed\n 3 the step which will be executed\n in the next loop\n 4 the source pile\n 5 the helper pile\n 6 the destination pile\n 7 the number of disks to move\n\nThe first stack frame (0 0 0 0 0 0 0 0)\nis used to abort the recursion.\n]\n\n>>>>>>>>\n\nThese are the parameters for the program\n(1 4 1 0 'a 'b 'c 5)\n+>++++>+>>\n>>>>++++++++[<++++++++++++>-]<\n[<<<+>+>+>-]<<<+>++>+++>+++++>\n<<<<<<<<\n\n[> while (recurse)\n [- if (step gt 0)\n >[-]+< todo = 1\n [- if (step gt 1)\n [- if (step gt 2)\n [- if (step gt 3)\n >>+++<< next = 3\n >-< todo = 0\n >>>>>>[>+>+<<-]>[<+>-]> n dup\n -\n [[-] if (sub(n 1) gt 0)\n <+>>>++++> push (1 0 0 4)\n\n copy and push a\n <<<<<<<<[>>>>>>>>+>+\n <<<<<<<<<-]>>>>>>>>\n >[<<<<<<<<<+>>>>>>>>>-]< >\n\n copy and push c\n <<<<<<<[>>>>>>>+>+\n <<<<<<<<-]>>>>>>>\n >[<<<<<<<<+>>>>>>>>-]< >\n\n copy and push b\n <<<<<<<<<[>>>>>>>>>+>+\n <<<<<<<<<<-]>>>>>>>>>\n >[<<<<<<<<<<+>>>>>>>>>>-]< >\n\n copy n and push sub(n 1)\n <<<<<<<<[>>>>>>>>+>+\n <<<<<<<<<-]>>>>>>>>\n >[<<<<<<<<<+>>>>>>>>>-]< -\n >>\n ]\n <<<<<<<<\n ]\n >[-< if ((step gt 2) and todo)\n >>++<< next = 2\n >>>>>>>\n +>>>+> push 1 0 0 1 a b c 1\n <<<<<<<<[>>>>>>>>+>+\n <<<<<<<<<-]>>>>>>>>\n >[<<<<<<<<<+>>>>>>>>>-]< > a\n <<<<<<<<[>>>>>>>>+>+\n <<<<<<<<<-]>>>>>>>>\n >[<<<<<<<<<+>>>>>>>>>-]< > b\n <<<<<<<<[>>>>>>>>+>+\n <<<<<<<<<-]>>>>>>>>\n >[<<<<<<<<<+>>>>>>>>>-]< > c\n + >>\n >]<\n ]\n >[-< if ((step gt 1) and todo)\n >>>>>>[>+>+<<-]>[<+>-]> n dup\n -\n [[-] if (n sub 1 gt 0)\n <+>>>++++> push (1 0 0 4)\n\n copy and push b\n <<<<<<<[>>>>>>>+\n <<<<<<<-]>>>>>>>\n >[<<<<<<<<+>>>>>>>>-]< >\n\n copy and push a\n <<<<<<<<<[>>>>>>>>>+\n <<<<<<<<<-]>>>>>>>>>\n >[<<<<<<<<<<+>>>>>>>>>>-]< >\n\n copy and push c\n <<<<<<<<[>>>>>>>>+\n <<<<<<<<-]>>>>>>>>\n >[<<<<<<<<<+>>>>>>>>>-]< >\n\n copy n and push sub(n 1)\n <<<<<<<<[>>>>>>>>+>+\n <<<<<<<<<-]>>>>>>>>\n >[<<<<<<<<<+>>>>>>>>>-]< -\n >>\n ]\n <<<<<<<<\n >]<\n ]\n >[-< if ((step gt 0) and todo)\n >>>>>>>\n >++++[<++++++++>-]<\n >>++++++++[<+++++++++>-]<++++\n >>++++++++[<++++++++++++>-]<+++++\n >>+++++++++[<++++++++++++>-]<+++\n <<<\n >.+++++++>.++.--.<<.\n >>-.+++++.----.<<.\n >>>.<---.+++.>+++.+.+.<.<<.\n >.>--.+++++.---.++++.\n -------.+++.<<.\n >>>++.-------.-.<<<.\n >+.>>+++++++.---.-----.<<<.\n <<<<.>>>>.\n >>----.>++++++++.<+++++.<<.\n >.>>.---.-----.<<<.\n <<.>>++++++++++++++.\n >>>[-]<[-]<[-]<[-]\n +++++++++++++.---.[-]\n <<<<<<<\n >]<\n >>[<<+>>-]<< step = next\n ]\n return with clear stack frame\n <[-]>[-]>[-]>[-]>[-]>[-]>[-]>[-]<<<<<<\n <<<<<<<<\n >>[<<+>>-]<< step = next\n <\n]\n","language":"Brainf---"},{"code":"#include <stdio.h>\n\nvoid move(int n, int from, int via, int to)\n{\n if (n > 1) {\n move(n - 1, from, to, via);\n printf(\"Move disk from pole %d to pole %d\\n\", from, to);\n move(n - 1, via, from, to);\n } else {\n printf(\"Move disk from pole %d to pole %d\\n\", from, to);\n }\n}\nint main()\n{\n move(4, 1,2,3);\n return 0;\n}\n","language":"C"},{"code":"#include <stdio.h>\n#include <stdlib.h>\n#include <unistd.h>\n\ntypedef struct { int *x, n; } tower;\ntower *new_tower(int cap)\n{\n\ttower *t = calloc(1, sizeof(tower) + sizeof(int) * cap);\n\tt->x = (int*)(t + 1);\n\treturn t;\n}\n\ntower *t[3];\nint height;\n\nvoid text(int y, int i, int d, const char *s)\n{\n\tprintf(\"\\033[%d;%dH\", height - y + 1, (height + 1) * (2 * i + 1) - d);\n\twhile (d--) printf(\"%s\", s);\n}\n\nvoid add_disk(int i, int d)\n{\n\tt[i]->x[t[i]->n++] = d;\n\ttext(t[i]->n, i, d, \"==\");\n\n\tusleep(100000);\n\tfflush(stdout);\n}\n\nint remove_disk(int i)\n{\n\tint d = t[i]->x[--t[i]->n];\n\ttext(t[i]->n + 1, i, d, \" \");\n\treturn d;\n}\n\nvoid move(int n, int from, int to, int via)\n{\n\tif (!n) return;\n\n\tmove(n - 1, from, via, to);\n\tadd_disk(to, remove_disk(from));\n\tmove(n - 1, via, to, from);\n}\n\nint main(int c, char *v[])\n{\n\tputs(\"\\033[H\\033[J\");\n\n\tif (c <= 1 || (height = atoi(v[1])) <= 0)\n\t\theight = 8;\n\tfor (c = 0; c < 3; c++)\t t[c] = new_tower(height);\n\tfor (c = height; c; c--) add_disk(0, c);\n\n\tmove(height, 0, 2, 1);\n\n\ttext(1, 0, 1, \"\\n\");\n\treturn 0;\n}\n","language":"C"},{"code":"void move(int n, int from, int to, int via) {\n if (n == 1) {\n std::cout << \"Move disk from pole \" << from << \" to pole \" << to << std::endl;\n } else {\n move(n - 1, from, via, to);\n move(1, from, to, via);\n move(n - 1, via, to, from);\n }\n}\n","language":"C++"},{"code":"public void move(int n, int from, int to, int via) {\n if (n == 1) {\n System.Console.WriteLine(\"Move disk from pole \" + from + \" to pole \" + to);\n } else {\n move(n - 1, from, via, to);\n move(1, from, to, via);\n move(n - 1, via, to, from);\n }\n }\n","language":"C-sharp"},{"code":"100 cls\n110 print \"Three disks\" : print\n120 hanoi(3,1,2,3)\n130 print chr$(10)\"Four disks\" chr$(10)\n140 hanoi(4,1,2,3)\n150 print : print \"Towers of Hanoi puzzle completed!\"\n160 end\n170 sub hanoi(n,desde,hasta,via)\n180 if n > 0 then\n190 hanoi(n-1,desde,via,hasta)\n200 print \"Move disk \" n \"from pole \" desde \"to pole \" hasta\n210 hanoi(n-1,via,hasta,desde)\n220 endif\n230 end sub\n","language":"Chipmunk-Basic"},{"code":"(defn towers-of-hanoi [n from to via]\n (when (pos? n)\n (towers-of-hanoi (dec n) from via to)\n (printf \"Move from %s to %s\\n\" from to)\n (recur (dec n) via to from)))\n","language":"Clojure"},{"code":"(defn towers-of-hanoi [n from to via]\n (when (pos? n)\n (lazy-cat (towers-of-hanoi (dec n) from via to)\n (cons [from '-> to]\n (towers-of-hanoi (dec n) via to from)))))\n","language":"Clojure"},{"code":"move = proc (n, from, via, to: int)\n po: stream := stream$primary_output()\n if n > 0 then\n move(n-1, from, to, via)\n stream$putl(po, \"Move disk from pole \"\n || int$unparse(from)\n || \" to pole \"\n || int$unparse(to))\n move(n-1, via, from, to)\n end\nend move\n\nstart_up = proc ()\n move(4, 1, 2, 3)\nend start_up\n","language":"CLU"},{"code":" >>SOURCE FREE\nIDENTIFICATION DIVISION.\nPROGRAM-ID. towers-of-hanoi.\n\nPROCEDURE DIVISION.\n CALL \"move-disk\" USING 4, 1, 2, 3\n .\nEND PROGRAM towers-of-hanoi.\n\nIDENTIFICATION DIVISION.\nPROGRAM-ID. move-disk RECURSIVE.\n\nDATA DIVISION.\nLINKAGE SECTION.\n01 n PIC 9 USAGE COMP.\n01 from-pole PIC 9 USAGE COMP.\n01 to-pole PIC 9 USAGE COMP.\n01 via-pole PIC 9 USAGE COMP.\n\nPROCEDURE DIVISION USING n, from-pole, to-pole, via-pole.\n IF n > 0\n SUBTRACT 1 FROM n\n CALL \"move-disk\" USING CONTENT n, from-pole, via-pole, to-pole\n DISPLAY \"Move disk from pole \" from-pole \" to pole \" to-pole\n CALL \"move-disk\" USING CONTENT n, via-pole, to-pole, from-pole\n END-IF\n .\nEND PROGRAM move-disk.\n","language":"COBOL"},{"code":"IDENTIFICATION DIVISION.\nPROGRAM-ID. towers-of-hanoi.\n\nPROCEDURE DIVISION.\n CALL \"move-disk\" USING 4, 1, 2, 3\n .\nEND PROGRAM towers-of-hanoi.\n\nIDENTIFICATION DIVISION.\nPROGRAM-ID. move-disk RECURSIVE.\n\nDATA DIVISION.\nLINKAGE SECTION.\n01 n PIC 9 USAGE COMP.\n01 from-pole PIC 9 USAGE COMP.\n01 to-pole PIC 9 USAGE COMP.\n01 via-pole PIC 9 USAGE COMP.\n\nPROCEDURE DIVISION USING n, from-pole, to-pole, via-pole.\n IF n > 0\n SUBTRACT 1 FROM n\n CALL \"move-disk\" USING CONTENT n, from-pole, via-pole, to-pole\n ADD 1 TO n\n DISPLAY \"Move disk number \"n \" from pole \" from-pole \" to pole \" to-pole\n SUBTRACT 1 FROM n\n CALL \"move-disk\" USING CONTENT n, via-pole, to-pole, from-pole\n END-IF\n .\nEND PROGRAM move-disk.\n","language":"COBOL"},{"code":" IDENTIFICATION DIVISION.\n PROGRAM-ID. ITERATIVE-TOWERS-OF-HANOI.\n AUTHOR. SOREN ROUG.\n DATE-WRITTEN. 2019-06-28.\n ENVIRONMENT DIVISION.\n CONFIGURATION SECTION.\n SOURCE-COMPUTER. LINUX.\n OBJECT-COMPUTER. KAYPRO4.\n INPUT-OUTPUT SECTION.\n FILE-CONTROL.\n DATA DIVISION.\n WORKING-STORAGE SECTION.\n 77 NUM-DISKS PIC 9 VALUE 4.\n 77 N1 PIC 9 COMP.\n 77 N2 PIC 9 COMP.\n 77 FROM-POLE PIC 9 COMP.\n 77 TO-POLE PIC 9 COMP.\n 77 VIA-POLE PIC 9 COMP.\n 77 FP-TMP PIC 9 COMP.\n 77 TO-TMP PIC 9 COMP.\n 77 P-TMP PIC 9 COMP.\n 77 TMP-P PIC 9 COMP.\n 77 I PIC 9 COMP.\n 77 DIV PIC 9 COMP.\n 01 STACKNUMS.\n 05 NUMSET OCCURS 3 TIMES.\n 10 DNUM PIC 9 COMP.\n 01 GAMESET.\n 05 POLES OCCURS 3 TIMES.\n 10 STACK OCCURS 10 TIMES.\n 15 POLE PIC 9 USAGE COMP.\n\n PROCEDURE DIVISION.\n HANOI.\n DISPLAY \"TOWERS OF HANOI PUZZLE WITH \", NUM-DISKS, \" DISKS.\".\n ADD NUM-DISKS, 1 GIVING N1.\n ADD NUM-DISKS, 2 GIVING N2.\n MOVE 1 TO DNUM (1).\n MOVE N1 TO DNUM (2), DNUM (3).\n MOVE N1 TO POLE (1, N1), POLE (2, N1), POLE (3, N1).\n MOVE 1 TO POLE (1, N2).\n MOVE 2 TO POLE (2, N2).\n MOVE 3 TO POLE (3, N2).\n MOVE 1 TO I.\n PERFORM INIT-PUZZLE UNTIL I = N1.\n MOVE 1 TO FROM-POLE.\n DIVIDE 2 INTO NUM-DISKS GIVING DIV.\n MULTIPLY 2 BY DIV.\n IF DIV NOT = NUM-DISKS PERFORM INITODD ELSE PERFORM INITEVEN.\n PERFORM MOVE-DISK UNTIL DNUM (3) NOT > 1.\n DISPLAY \"TOWERS OF HANOI PUZZLE COMPLETED!\".\n STOP RUN.\n INIT-PUZZLE.\n MOVE I TO POLE (1, I).\n MOVE 0 TO POLE (2, I), POLE (3, I).\n ADD 1 TO I.\n INITEVEN.\n MOVE 2 TO TO-POLE.\n MOVE 3 TO VIA-POLE.\n INITODD.\n MOVE 3 TO TO-POLE.\n MOVE 2 TO VIA-POLE.\n MOVE-DISK.\n MOVE DNUM (FROM-POLE) TO FP-TMP.\n MOVE POLE (FROM-POLE, FP-TMP) TO I.\n DISPLAY \"MOVE DISK FROM \", POLE (FROM-POLE, N2),\n \" TO \", POLE (TO-POLE, N2).\n ADD 1 TO DNUM (FROM-POLE).\n MOVE VIA-POLE TO TMP-P.\n SUBTRACT 1 FROM DNUM (TO-POLE).\n MOVE DNUM (TO-POLE) TO TO-TMP.\n MOVE I TO POLE (TO-POLE, TO-TMP).\n DIVIDE 2 INTO I GIVING DIV.\n MULTIPLY 2 BY DIV.\n IF I NOT = DIV PERFORM MOVE-TO-VIA ELSE\n PERFORM MOVE-FROM-VIA.\n MOVE-TO-VIA.\n MOVE TO-POLE TO VIA-POLE.\n MOVE DNUM (FROM-POLE) TO FP-TMP.\n MOVE DNUM (TMP-P) TO P-TMP.\n IF POLE (FROM-POLE, FP-TMP) > POLE (TMP-P, P-TMP)\n PERFORM MOVE-FROM-TO\n ELSE MOVE TMP-P TO TO-POLE.\n MOVE-FROM-TO.\n MOVE FROM-POLE TO TO-POLE.\n MOVE TMP-P TO FROM-POLE.\n MOVE DNUM (FROM-POLE) TO FP-TMP.\n MOVE DNUM (TMP-P) TO P-TMP.\n MOVE-FROM-VIA.\n MOVE FROM-POLE TO VIA-POLE.\n MOVE TMP-P TO FROM-POLE.\n","language":"COBOL"},{"code":"hanoi = (ndisks, start_peg=1, end_peg=3) ->\n if ndisks\n staging_peg = 1 + 2 + 3 - start_peg - end_peg\n hanoi(ndisks-1, start_peg, staging_peg)\n console.log \"Move disk #{ndisks} from peg #{start_peg} to #{end_peg}\"\n hanoi(ndisks-1, staging_peg, end_peg)\n\nhanoi(4)\n","language":"CoffeeScript"},{"code":"(defun move (n from to via)\n (cond ((= n 1)\n (format t \"Move from ~A to ~A.~%\" from to))\n (t\n (move (- n 1) from via to)\n (format t \"Move from ~A to ~A.~%\" from to)\n (move (- n 1) via to from))))\n","language":"Common-Lisp"},{"code":"import std.stdio;\n\nvoid hanoi(in int n, in char from, in char to, in char via) {\n if (n > 0) {\n hanoi(n - 1, from, via, to);\n writefln(\"Move disk %d from %s to %s\", n, from, to);\n hanoi(n - 1, via, to, from);\n }\n}\n\nvoid main() {\n hanoi(3, 'L', 'M', 'R');\n}\n","language":"D"},{"code":"// Code found and then improved by Glenn C. Rhoads,\n// then some more by M. Kolar (2000).\nvoid main(in string[] args) {\n import core.stdc.stdio, std.conv, std.typetuple;\n\n immutable size_t n = (args.length > 1) ? args[1].to!size_t : 3;\n size_t[3] p = [(1 << n) - 1, 0, 0];\n\n // Show the start configuration of the pegs.\n '|'.putchar;\n foreach_reverse (immutable i; 1 .. n + 1)\n printf(\" %d\", i);\n \"\\n|\\n|\".puts;\n\n foreach (immutable size_t x; 1 .. (1 << n)) {\n {\n immutable size_t i1 = x & (x - 1);\n immutable size_t fr = (i1 + i1 / 3) & 3;\n immutable size_t i2 = (x | (x - 1)) + 1;\n immutable size_t to = (i2 + i2 / 3) & 3;\n\n size_t j = 1;\n for (size_t w = x; !(w & 1); w >>= 1, j <<= 1) {}\n\n // Now j is not the number of the disk to move,\n // it contains the single bit to be moved:\n p[fr] &= ~j;\n p[to] |= j;\n }\n\n // Show the current configuration of pegs.\n foreach (immutable size_t k; TypeTuple!(0, 1, 2)) {\n \"\\n|\".printf;\n size_t j = 1 << n;\n foreach_reverse (immutable size_t w; 1 .. n + 1) {\n j >>= 1;\n if (j & p[k])\n printf(\" %zd\", w);\n }\n }\n '\\n'.putchar;\n }\n}\n","language":"D"},{"code":"main() {\n moveit(from,to) {\n print(\"move ${from} ---> ${to}\");\n }\n\n hanoi(height,toPole,fromPole,usePole) {\n if (height>0) {\n hanoi(height-1,usePole,fromPole,toPole);\n moveit(fromPole,toPole);\n hanoi(height-1,toPole,usePole,fromPole);\n }\n }\n\n hanoi(3,3,1,2);\n}\n","language":"Dart"},{"code":"main() {\n String say(String from, String to) => \"$from ---> $to\";\n\n hanoi(int height, int toPole, int fromPole, int usePole) {\n if (height > 0) {\n hanoi(height - 1, usePole, fromPole, toPole);\n print(say(fromPole.toString(), toPole.toString()));\n hanoi(height - 1, toPole, usePole, fromPole);\n }\n }\n\n hanoi(3, 3, 1, 2);\n}\n","language":"Dart"},{"code":"proc move(byte n, src, via, dest) void:\n if n>0 then\n move(n-1, src, dest, via);\n writeln(\"Move disk from pole \",src,\" to pole \",dest);\n move(n-1, via, src, dest)\n fi\ncorp\n\nproc nonrec main() void:\n move(4, 1, 2, 3)\ncorp\n","language":"Draco"},{"code":"func hanoi(n, a, b, c) {\n if n > 0 {\n hanoi(n - 1, a, c, b)\n print(\"Move disk from \\(a) to \\(c)\")\n hanoi(n - 1, b, a, c)\n }\n}\n\nhanoi(4, \"A\", \"B\", \"C\")\n","language":"Dyalect"},{"code":"def move(out, n, fromPeg, toPeg, viaPeg) {\n if (n.aboveZero()) {\n move(out, n.previous(), fromPeg, viaPeg, toPeg)\n out.println(`Move disk $n from $fromPeg to $toPeg.`)\n move(out, n.previous(), viaPeg, toPeg, fromPeg)\n }\n}\n\nmove(stdout, 4, def left {}, def right {}, def middle {})\n","language":"E"},{"code":"proc hanoi n src dst aux . .\n if n >= 1\n hanoi n - 1 src aux dst\n print \"Move \" & src & \" to \" & dst\n hanoi n - 1 aux dst src\n .\n.\nhanoi 5 1 2 3\n","language":"EasyLang"},{"code":"[Towers of Hanoi task for Rosetta Code.]\n[EDSAC program, Initial Orders 2.]\n\n T100K [load program at location 100 (arbitrary)]\n GK\n[Number of discs, in the address field]\n [0] P3F [<--- edit here, value 1..9]\n[Letters to represent the rods]\n [1] LF [left]\n [2] CF [centre]\n [3] RF [right]\n\n[Main routine. Enter with acc = 0]\n [4] T1F [1F := 0]\n [5] A5@ [initialize recursive subroutine]\n G104@\n A@ [number of discs]\n T1F [pass to subroutines]\n A1@ [source rod]\n T4F [pass to subroutines]\n A3@ [target rod]\n T5F [pass to subroutines]\n [13] A13@ [call subroutine to write header ]\n G18@\n [15] A15@ [call recursive subroutine to write moves ]\n G104@\n ZF [stop]\n\n[Subroutine to write a header]\n[Input: 1F = number of discs (in the address field)]\n [4F = letter for starting rod]\n [5F = letter for ending rod]\n[Output: None. 1F, 4F, 5F must be preserved.]\n [18] A3F [plant return link as usual]\n T35@\n A1F [number of discs]\n L512F [shift 11 left to make output char]\n T39@ [plant in message]\n A4F [starting rod]\n T53@ [plant in message]\n A5F [ending rod]\n T58@ [plant in message]\n A36@ [O order for first char of message]\n E30@ [skip next order (code for 'O' is positive)]\n [29] A37@ [restore acc after test below]\n [30] U31@ [plant order to write next character]\n [31] OF [(planted) write next character]\n A2F [inc address in previous order]\n S37@ [finished yet?]\n G29@ [if not, loop back]\n [35] ZF [(planted) exit with acc = 0]\n [36] O38@ [O order for start of message]\n [37] O61@ [O order for exclusive end of message]\n [38] #F\n [39] PFK2048F!FDFIFSFCFSF!FFFRFOFMF!F\n [53] PF!FTFOF!F\n [58] PF@F&F\n [61]\n\n[Subroutine to write a move of one disc.]\n[Input: 1F = disc number 1..9 (in the address field)]\n [4F = letter for source rod]\n [5F = letter for target rod]\n[Output: None. 1F, 4F, 5F must be preserved.]\n[Condensed to save space; very similar to previous subroutine.]\n [61] A3FT78@A1FL512FT88@ A4FT96@A5FT101@A79@E73@\n [72] A80@\n [73] U74@\n [74] OFA2FS80@G72@\n [78] ZF [(planted) exit with acc = 0]\n [79] O81@\n [80] O104@\n [81] K2048FMFOFVFEF!F#F\n [88] PFK2048F!FFFRFOFMF!F\n [96] PF!FTFOF!F\n [101] PF@F&F\n [104]\n\n[Recursive subroutine to move discs 1..n, where 1 <= n <= 9.]\n[Call with n = 0 to initialize.]\n[Input: 1F = n (in the address field)]\n [4F = letter for source rod]\n [5F = letter for target rod]\n[Output: None. 1F, 4F, 5F must be preserved.]\n [104] A3F [plant link as usual ]\n T167@\n[The link will be saved in a stack if recursive calls are required.]\n S1F [load -n]\n G115@ [jump if n > 0]\n[Here if n = 0. Initialize; no recursive calls.]\n A169@ [initialize push order to start of stack]\n T122@\n A1@ [find total of the codes for the rod letters]\n A2@\n A3@\n T168@ [store for future use]\n E167@ [jump to link]\n[Here with acc = -n in address field]\n [115] A2F [add 1]\n G120@ [jump if n > 1]\n[Here if n = 1. Just write the move; no recursive calls.]\n [117] A117@ [call write subroutine]\n G61@\n E167@ [jump to link]\n[Here if n > 1. Recursive calls are required.]\n [120] TF [clear acc]\n A167@ [load link order]\n [122] TF [(planted) push link order onto stack]\n A122@ [inc address in previous order]\n A2F\n T122@\n[First recursive call. Modify parameters 1F and 5F; 4F stays the same]\n A1F [load n]\n S2F [make n - 1]\n T1F [pass as parameter]\n A168@ [get 3rd rod, neither source nor target]\n S4F\n S5F\n T5F\n [133] A133@ [recursive call]\n G104@\n[Returned, restore parameters]\n A1F\n A2F\n T1F\n A168@\n S4F\n S5F\n T5F\n[Write move of largest disc]\n [142] A142@\n G61@\n[Second recursive call. Modify parameters 1F and 4F; 5F stays the same]\n[Condensed to save space; very similar to first recursice call.]\n A1FS2FT1FA168@S4FS5FT4F\n [151] A151@G104@A1FA2FT1FA168@S4FS5FT4F\n[Pop return link off stack]\n A122@ [dec address in push order]\n S2F\n U122@\n A170@ [make A order with same address]\n T165@ [plant in code]\n [165] AF [(planted) pop return link from stack]\n T167@ [plant in code]\n [167] ZF [(planted) return to caller]\n[Constants]\n [168] PF [(planted) sum of letters for rods]\n [169] T171@ [T order for start of stack]\n [170] MF [add to T order to make A order, same address]\n[Stack: placed at end of program, grows into free space.]\n [171]\n E4Z [define entry point]\n PF [acc = 0 on entry]\n[end]\n","language":"EDSAC-order-code"},{"code":"class\n\tAPPLICATION\n\ncreate\n\tmake\n\nfeature {NONE} -- Initialization\n\n\tmake\n\t\tdo\n\t\t\tmove (4, \"A\", \"B\", \"C\")\n\t\tend\n\nfeature -- Towers of Hanoi\n\n\tmove (n: INTEGER; frm, to, via: STRING)\n\t\trequire\n\t\t\tn > 0\n\t do\n\t\t\tif n = 1 then\n \t\t\tprint (\"Move disk from pole \" + frm + \" to pole \" + to + \"%N\")\n \t\telse\n \t\t\tmove (n - 1, frm, via, to)\n \t\t\tmove (1, frm, to, via)\n \t\t\tmove (n - 1, via, to, frm)\n\t end\n\t end\nend\n","language":"Eiffel"},{"code":"open monad io\n:::IO\n\n//Functional approach\nhanoi 0 _ _ _ = []\nhanoi n a b c = hanoi (n - 1) a c b ++ [(a,b)] ++ hanoi (n - 1) c b a\n\nhanoiIO n = mapM_ f $ hanoi n 1 2 3 where\n f (x,y) = putStrLn $ \"Move \" ++ show x ++ \" to \" ++ show y\n\n//Imperative approach using IO monad\nhanoiM n = hanoiM' n 1 2 3 where\n hanoiM' 0 _ _ _ = return ()\n hanoiM' n a b c = do\n hanoiM' (n - 1) a c b\n putStrLn $ \"Move \" ++ show a ++ \" to \" ++ show b\n hanoiM' (n - 1) c b a\n","language":"Ela"},{"code":"move = (n,from,to,via)\n{\n if (n == 1)\n {\n console.printLine(\"Move disk from pole \",from,\" to pole \",to)\n }\n else\n {\n move(n-1,from,via,to);\n move(1,from,to,via);\n move(n-1,via,to,from)\n }\n};\n","language":"Elena"},{"code":"defmodule RC do\n def hanoi(n) when 0<n and n<10, do: hanoi(n, 1, 2, 3)\n\n defp hanoi(1, f, _, t), do: move(f, t)\n defp hanoi(n, f, u, t) do\n hanoi(n-1, f, t, u)\n move(f, t)\n hanoi(n-1, u, f, t)\n end\n\n defp move(f, t), do: IO.puts \"Move disk from #{f} to #{t}\"\nend\n\nRC.hanoi(3)\n","language":"Elixir"},{"code":"(defun move (n from to via)\n (if (= n 1)\n (message \"Move from %S to %S\" from to)\n (move (- n 1) from via to)\n (message \"Move from %S to %S\" from to)\n (move (- n 1) via to from)))\n","language":"Emacs-Lisp"},{"code":"fun move = void by int n, int from, int to, int via\n if n == 1\n writeLine(\"Move disk from pole \" + from + \" to pole \" + to)\n return\n end\n move(n - 1, from, via, to)\n move(1, from, to, via)\n move(n - 1, via, to, from)\nend\nmove(3, 1, 2, 3)\n","language":"EMal"},{"code":"move(1, F, T, _V) ->\n io:format(\"Move from ~p to ~p~n\", [F, T]);\nmove(N, F, T, V) ->\n move(N-1, F, V, T),\n move(1 , F, T, V),\n move(N-1, V, T, F).\n","language":"Erlang"},{"code":"!-----------------------------------------------------------\n! HANOI.R : solve tower of Hanoi puzzle using a recursive\n! modified algorithm.\n!-----------------------------------------------------------\n\nPROGRAM HANOI\n\n!$INTEGER\n\n!VAR I,J,MOSSE,NUMBER\n\nPROCEDURE PRINTMOVE\n LOCAL SOURCE$,DEST$\n MOSSE=MOSSE+1\n CASE I OF\n 1-> SOURCE$=\"Left\" END ->\n 2-> SOURCE$=\"Center\" END ->\n 3-> SOURCE$=\"Right\" END ->\n END CASE\n CASE J OF\n 1-> DEST$=\"Left\" END ->\n 2-> DEST$=\"Center\" END ->\n 3-> DEST$=\"Right\" END ->\n END CASE\n PRINT(\"I move a disk from \";SOURCE$;\" to \";DEST$)\nEND PROCEDURE\n\nPROCEDURE MOVE\n IF NUMBER<>0 THEN\n NUMBER=NUMBER-1\n J=6-I-J\n MOVE\n J=6-I-J\n PRINTMOVE\n I=6-I-J\n MOVE\n I=6-I-J\n NUMBER=NUMBER+1\n END IF\nEND PROCEDURE\n\nBEGIN\n MAXNUM=12\n MOSSE=0\n PRINT(CHR$(12);TAB(25);\"--- TOWERS OF HANOI ---\")\n REPEAT\n PRINT(\"Number of disks \";)\n INPUT(NUMBER)\n UNTIL NUMBER>1 AND NUMBER<=MAXNUM\n PRINT\n PRINT(\"For \";NUMBER;\"disks the total number of moves is\";2^NUMBER-1)\n I=1 ! number of source pole\n J=3 ! number of destination pole\n MOVE\nEND PROGRAM\n","language":"ERRE"},{"code":"SHOWHANOI\n=LAMBDA(n,\n FILTERP(\n LAMBDA(x, \"\" <> x)\n )(\n HANOI(n)(\"left\")(\"right\")(\"mid\")\n )\n)\n\n\nHANOI\n=LAMBDA(n,\n LAMBDA(l,\n LAMBDA(r,\n LAMBDA(m,\n IF(0 = n,\n \"\",\n LET(\n next, n - 1,\n APPEND(\n APPEND(\n HANOI(next)(l)(m)(r)\n )(\n CONCAT(l, \" -> \", r)\n )\n )(\n HANOI(next)(m)(r)(l)\n )\n )\n )\n )\n )\n )\n)\n","language":"Excel"},{"code":"APPEND\n=LAMBDA(xs,\n LAMBDA(ys,\n LET(\n nx, ROWS(xs),\n rowIndexes, SEQUENCE(nx + ROWS(ys)),\n colIndexes, SEQUENCE(\n 1,\n MAX(COLUMNS(xs), COLUMNS(ys))\n ),\n IF(\n rowIndexes <= nx,\n INDEX(xs, rowIndexes, colIndexes),\n INDEX(ys, rowIndexes - nx, colIndexes)\n )\n )\n )\n)\n\n\nFILTERP\n=LAMBDA(p,\n LAMBDA(xs,\n FILTER(xs, p(xs))\n )\n)\n","language":"Excel"},{"code":"# (C) 2013 Ezhil Language Project\n# Tower of Hanoi – recursive solution\n\nநிரல்பாகம் ஹோனாய்(வட்டுகள், முதல்அச்சு, இறுதிஅச்சு,வட்டு)\n\n @(வட்டுகள் == 1 ) ஆனால்\n பதிப்பி “வட்டு ” + str(வட்டு) + “ஐ \\t (” + str(முதல்அச்சு) + “ —> ” + str(இறுதிஅச்சு)+ “) அச்சிற்கு நகர்த்துக.”\n இல்லை\n\n @( [\"இ\", \"அ\", \"ஆ\"] இல் அச்சு ) ஒவ்வொன்றாக\n @( (முதல்அச்சு != அச்சு) && (இறுதிஅச்சு != அச்சு) ) ஆனால்\n நடு = அச்சு\n முடி\n முடி\n\n # solve problem for n-1 again between src and temp pegs\n ஹோனாய்(வட்டுகள்-1, முதல்அச்சு,நடு,வட்டுகள்-1)\n\n # move largest disk from src to destination\n ஹோனாய்(1, முதல்அச்சு, இறுதிஅச்சு,வட்டுகள்)\n\n # solve problem for n-1 again between different pegs\n ஹோனாய்(வட்டுகள்-1, நடு, இறுதிஅச்சு,வட்டுகள்-1)\n முடி\nமுடி\n\nஹோனாய்(4,”அ”,”ஆ”,0)\n","language":"Ezhil"},{"code":"#light\nlet rec hanoi num start finish =\n match num with\n | 0 -> [ ]\n | _ -> let temp = (6 - start - finish)\n (hanoi (num-1) start temp) @ [ start, finish ] @ (hanoi (num-1) temp finish)\n\n[<EntryPoint>]\nlet main args =\n (hanoi 4 1 2) |> List.iter (fun pair -> match pair with\n | a, b -> printf \"Move disc from %A to %A\\n\" a b)\n 0\n","language":"F-Sharp"},{"code":"USING: formatting kernel locals math ;\nIN: rosettacode.hanoi\n\n: move ( from to -- )\n \"%d->%d\\n\" printf ;\n:: hanoi ( n from to other -- )\n n 0 > [\n n 1 - from other to hanoi\n from to move\n n 1 - other to from hanoi\n ] when ;\n","language":"Factor"},{"code":"[\"Move disk from \"$!\\\" to \"$!\\\"\n\"]p: { to from }\n[n;0>[n;1-n: @\\ h;! @\\ p;! \\@ h;! \\@ n;1+n:]?]h: { via to from }\n4n:[\"right\"][\"middle\"][\"left\"]h;!%%%\n","language":"FALSE"},{"code":"Func Hanoi( n, f, t, v ) =\nif n = 0 then\n !'';\nelse\n Hanoi(n - 1, f, v, t);\n !f;!' -> ';!t;!', ';\n Hanoi(n - 1, v, t, f)\nfi.\n","language":"Fermat"},{"code":"01.10 S N=4;S S=1;S V=2;S T=3\n01.20 D 2\n01.30 Q\n\n02.02 S N(D)=N(D)-1;I (N(D)),2.2,2.04\n02.04 S D=D+1\n02.06 S N(D)=N(D-1);S S(D)=S(D-1)\n02.08 S T(D)=V(D-1);S V(D)=T(D-1)\n02.10 D 2\n02.12 S D=D-1\n02.14 D 3\n02.16 S A=S(D);S S(D)=V(D);S V(D)=A\n02.18 G 2.02\n02.20 D 3\n\n03.10 T %1,\"MOVE DISK FROM POLE\",S(D)\n03.20 T \" TO POLE\",T(D),!\n","language":"FOCAL"},{"code":"CREATE peg1 ,\" left \"\nCREATE peg2 ,\" middle \"\nCREATE peg3 ,\" right \"\n\n: .$ COUNT TYPE ;\n: MOVE-DISK\n LOCALS| via to from n |\n n 1 =\n IF CR .\" Move disk from \" from .$ .\" to \" to .$\n ELSE n 1- from via to RECURSE\n 1 from to via RECURSE\n n 1- via to from RECURSE\n THEN ;\n","language":"Forth"},{"code":": left .\" left\" ;\n: right .\" right\" ;\n: middle .\" middle\" ;\n\n: move-disk ( v t f n -- v t f )\n dup 0= if drop exit then\n 1- >R\n rot swap R@ ( t v f n-1 ) recurse\n rot swap\n 2dup cr .\" Move disk from \" execute .\" to \" execute\n swap rot R> ( f t v n-1 ) recurse\n swap rot ;\n: hanoi ( n -- )\n 1 max >R ['] right ['] middle ['] left R> move-disk drop drop drop ;\n","language":"Forth"},{"code":"PROGRAM TOWER\n\n CALL Move(4, 1, 2, 3)\n\nCONTAINS\n\n RECURSIVE SUBROUTINE Move(ndisks, from, to, via)\n INTEGER, INTENT (IN) :: ndisks, from, to, via\n\n IF (ndisks == 1) THEN\n WRITE(*, \"(A,I1,A,I1)\") \"Move disk from pole \", from, \" to pole \", to\n ELSE\n CALL Move(ndisks-1, from, via, to)\n CALL Move(1, from, to, via)\n CALL Move(ndisks-1, via, to, from)\n END IF\n END SUBROUTINE Move\n\nEND PROGRAM TOWER\n","language":"Fortran"},{"code":"PROGRAM TOWER2\n\n CALL Move(4, 1, 2, 3)\n\nCONTAINS\n\n RECURSIVE SUBROUTINE Move(ndisks, from, via, to)\n INTEGER, INTENT (IN) :: ndisks, from, via, to\n\n IF (ndisks > 1) THEN\n CALL Move(ndisks-1, from, to, via)\n WRITE(*, \"(A,I1,A,I1,A,I1)\") \"Move disk \", ndisks, \" from pole \", from, \" to pole \", to\n Call Move(ndisks-1,via,from,to)\n ELSE\n WRITE(*, \"(A,I1,A,I1,A,I1)\") \"Move disk \", ndisks, \" from pole \", from, \" to pole \", to\n END IF\n END SUBROUTINE Move\n\nEND PROGRAM TOWER2\n","language":"Fortran"},{"code":"' FB 1.05.0 Win64\n\nSub move(n As Integer, from As Integer, to_ As Integer, via As Integer)\n If n > 0 Then\n move(n - 1, from, via, to_)\n Print \"Move disk\"; n; \" from pole\"; from; \" to pole\"; to_\n move(n - 1, via, to_, from)\n End If\nEnd Sub\n\nPrint \"Three disks\" : Print\nmove 3, 1, 2, 3\nPrint\nPrint \"Four disks\" : Print\nmove 4, 1, 2, 3\nPrint \"Press any key to quit\"\nSleep\n","language":"FreeBASIC"},{"code":"/** Set up the recursive call for n disks */\nhanoi[n] := hanoi[n, 1, 3, 2]\n\n/** The recursive call. */\nhanoi[n, source, target, aux] :=\n{\n if n > 0\n {\n hanoi[n-1, source, aux, target]\n println[\"Move from $source to $target\"]\n hanoi[n-1, aux, target, source]\n }\n}\n\nhanoi[7]\n","language":"Frink"},{"code":"window 1, @\"Towers of Hanoi\", ( 0, 0, 300, 300 )\n\nvoid local fn Move( n as long, fromPeg as long, toPeg as long, viaPeg as long )\n if n > 0\n fn Move( n-1, fromPeg, viaPeg, toPeg )\n print \"Move disk from \"; fromPeg; \" to \"; toPeg\n fn Move( n-1, viaPeg, toPeg, fromPeg )\n end if\nend fn\n\nfn Move( 4, 1, 2, 3 )\nprint\nprint \"Towers of Hanoi puzzle solved.\"\n\nHandleEvents\n","language":"FutureBasic"},{"code":"Public Sub Main()\n\n Print \"Three disks\\n\"\n move_(3, 1, 2, 3)\n Print\n Print \"Four disks\\n\"\n move_(4, 1, 2, 3)\n\nEnd\n\nPublic Sub move_(n As Integer, from As Integer, to As Integer, via As Integer)\n\n If n > 0 Then\n move_(n - 1, from, via, to)\n Print \"Move disk \"; n; \" from pole \"; from; \" to pole \"; to\n move_(n - 1, via, to, from)\n End If\n\nEnd Sub\n","language":"Gambas"},{"code":"Hanoi := function(n)\n\tlocal move;\n\tmove := function(n, a, b, c) # from, through, to\n\t\tif n = 1 then\n\t\t\tPrint(a, \" -> \", c, \"\\n\");\n\t\telse\n\t\t\tmove(n - 1, a, c, b);\n\t\t\tmove(1, a, b, c);\n\t\t\tmove(n - 1, b, a, c);\n\t\tfi;\n\tend;\n\tmove(n, \"A\", \"B\", \"C\");\nend;\n\nHanoi(1);\n# A -> C\n\nHanoi(2);\n# A -> B\n# A -> C\n# B -> C\n\nHanoi(3);\n# A -> C\n# A -> B\n# C -> B\n# A -> C\n# B -> A\n# B -> C\n# A -> C\n","language":"GAP"},{"code":"package main\n\nimport \"fmt\"\n\n// a towers of hanoi solver just has one method, play\ntype solver interface {\n play(int)\n}\n\nfunc main() {\n var t solver // declare variable of solver type\n t = new(towers) // type towers must satisfy solver interface\n t.play(4)\n}\n\n// towers is example of type satisfying solver interface\ntype towers struct {\n // an empty struct. some other solver might fill this with some\n // data representation, maybe for algorithm validation, or maybe for\n // visualization.\n}\n\n// play is sole method required to implement solver type\nfunc (t *towers) play(n int) {\n // drive recursive solution, per task description\n t.moveN(n, 1, 2, 3)\n}\n\n// recursive algorithm\nfunc (t *towers) moveN(n, from, to, via int) {\n if n > 0 {\n t.moveN(n-1, from, via, to)\n t.move1(from, to)\n t.moveN(n-1, via, to, from)\n }\n}\n\n// example function prints actions to screen.\n// enhance with validation or visualization as needed.\nfunc (t *towers) move1(from, to int) {\n fmt.Println(\"move disk from rod\", from, \"to rod\", to)\n}\n","language":"Go"},{"code":"package main\n\nimport \"fmt\"\n\nfunc main() {\n\tmove(3, \"A\", \"B\", \"C\")\n}\n\nfunc move(n uint64, a, b, c string) {\n\tif n > 0 {\n\t\tmove(n-1, a, c, b)\n\t\tfmt.Println(\"Move disk from \" + a + \" to \" + c)\n\t\tmove(n-1, b, a, c)\n\t}\n}\n","language":"Go"},{"code":"def tail = { list, n -> def m = list.size(); list.subList([m - n, 0].max(),m) }\n\nfinal STACK = [A:[],B:[],C:[]].asImmutable()\n\ndef report = { it -> }\ndef check = { it -> }\n\ndef moveRing = { from, to -> to << from.pop(); report(); check(to) }\n\ndef moveStack\nmoveStack = { from, to, using = STACK.values().find { !(it.is(from) || it.is(to)) } ->\n if (!from) return\n def n = from.size()\n moveStack(tail(from, n-1), using, to)\n moveRing(from, to)\n moveStack(tail(using, n-1), to, from)\n}\n","language":"Groovy"},{"code":"enum Ring {\n S('°'), M('o'), L('O'), XL('( )');\n private sym\n private Ring(sym) { this.sym=sym }\n String toString() { sym }\n}\n\nreport = { STACK.each { k, v -> println \"${k}: ${v}\" }; println() }\ncheck = { to -> assert to == ([] + to).sort().reverse() }\n\nRing.values().reverseEach { STACK.A << it }\nreport()\ncheck(STACK.A)\nmoveStack(STACK.A, STACK.C)\n","language":"Groovy"},{"code":"hanoi :: Integer -> a -> a -> a -> [(a, a)]\nhanoi 0 _ _ _ = []\nhanoi n a b c = hanoi (n-1) a c b ++ [(a,b)] ++ hanoi (n-1) c b a\n","language":"Haskell"},{"code":"hanoi :: Integer -> a -> a -> a -> [(a, a)]\n\nhanoi n a b c = hanoiToList n a b c []\n where\n hanoiToList 0 _ _ _ l = l\n hanoiToList n a b c l = hanoiToList (n-1) a c b ((a, b) : hanoiToList (n-1) c b a l)\n","language":"Haskell"},{"code":"hanoiIO n = mapM_ f $ hanoi n 1 2 3 where\n f (x,y) = putStrLn $ \"Move \" ++ show x ++ \" to \" ++ show y\n","language":"Haskell"},{"code":"hanoiM :: Integer -> IO ()\nhanoiM n = hanoiM' n 1 2 3 where\n hanoiM' 0 _ _ _ = return ()\n hanoiM' n a b c = do\n hanoiM' (n-1) a c b\n putStrLn $ \"Move \" ++ show a ++ \" to \" ++ show b\n hanoiM' (n-1) c b a\n","language":"Haskell"},{"code":"-------------------------- HANOI -------------------------\n\nhanoi ::\n Int ->\n String ->\n String ->\n String ->\n [(String, String)]\nhanoi 0 _ _ _ = mempty\nhanoi n l r m =\n hanoi (n - 1) l m r\n <> [(l, r)]\n <> hanoi (n - 1) m r l\n\n--------------------------- TEST -------------------------\nmain :: IO ()\nmain = putStrLn $ showHanoi 5\n\n------------------------- DISPLAY ------------------------\nshowHanoi :: Int -> String\nshowHanoi n =\n unlines $\n fmap\n ( \\(from, to) ->\n concat [justifyRight 5 ' ' from, \" -> \", to]\n )\n (hanoi n \"left\" \"right\" \"mid\")\n\njustifyRight :: Int -> Char -> String -> String\njustifyRight n c = (drop . length) <*> (replicate n c <>)\n","language":"Haskell"},{"code":"U0 Move(U8 n, U8 from, U8 to, U8 via) {\n if (n > 0) {\n Move(n - 1, from, via, to);\n Print(\"Move disk from pole %d to pole %d\\n\", from, to);\n Move(n - 1, via, to, from);\n }\n}\n\nMove(4, 1, 2, 3);\n","language":"HolyC"},{"code":"procedure main(arglist)\nhanoi(arglist[1]) | stop(\"Usage: hanoi n\\n\\rWhere n is the number of disks to move.\")\nend\n\n#procedure hanoi(n:integer, needle1:1, needle2:2) # unicon shorthand for icon code 1,2,3 below\n\nprocedure hanoi(n, needle1, needle2) #: solve towers of hanoi by moving n disks from needle 1 to needle2 via other\nlocal other\n\nn := integer(0 < n) | runerr(n,101) # 1 ensure integer (this also ensures it's positive too)\n/needle1 := 1 # 2 default\n/needle2 := 2 # 3 default\n\nif n = 1 then\n write(\"Move disk from \", needle1, \" to \", needle2)\nelse {\n other := 6 - needle1 - needle2 # clever but somewhat un-iconish way to find other\n hanoi(n-1, needle1, other)\n write(\"Move disk from \", needle1, \" to \", needle2)\n hanoi(n-1, other, needle2)\n}\nreturn\nend\n","language":"Icon"},{"code":"Hanoi is a room.\n\nA post is a kind of supporter. A post is always fixed in place.\n\nThe left post, the middle post, and the right post are posts in Hanoi.\n\nA disk is a kind of supporter.\nThe red disk is a disk on the left post.\nThe orange disk is a disk on the red disk.\nThe yellow disk is a disk on the orange disk.\nThe green disk is a disk on the yellow disk.\n\nDefinition: a disk is topmost if nothing is on it.\n\nWhen play begins:\n\tmove 4 disks from the left post to the right post via the middle post.\n\nTo move (N - number) disk/disks from (FP - post) to (TP - post) via (VP - post):\n\tif N > 0:\n\t\tmove N - 1 disks from FP to VP via TP;\n\t\tsay \"Moving a disk from [FP] to [TP]...\";\n\t\tlet D be a random topmost disk enclosed by FP;\n\t\tif a topmost disk (called TD) is enclosed by TP, now D is on TD;\n\t\totherwise now D is on TP;\n\t\tmove N - 1 disks from VP to TP via FP.\n","language":"Inform-7"},{"code":"hanoi := method(n, from, to, via,\n if (n == 1) then (\n writeln(\"Move from \", from, \" to \", to)\n ) else (\n hanoi(n - 1, from, via, to )\n hanoi(1 , from, to , via )\n hanoi(n - 1, via , to , from)\n )\n)\n","language":"Io"},{"code":" = method(n, f, u, t,\n if(n < 2,\n \"#{f} --> #{t}\" println,\n\n H(n - 1, f, t, u)\n \"#{f} --> #{t}\" println\n H(n - 1, u, f, t)\n )\n)\n\nhanoi = method(n,\n H(n, 1, 2, 3)\n)\n","language":"Ioke"},{"code":"100 PROGRAM \"Hanoi.bas\"\n110 CALL HANOI(4,1,3,2)\n120 DEF HANOI(DISK,FRO,TO,WITH)\n130 IF DISK>0 THEN\n140 CALL HANOI(DISK-1,FRO,WITH,TO)\n150 PRINT \"Move disk\";DISK;\"from\";FRO;\"to\";TO\n160 CALL HANOI(DISK-1,WITH,TO,FRO)\n170 END IF\n180 END DEF\n","language":"IS-BASIC"},{"code":"H =: i.@,&2 ` (({&0 2 1,0 2,{&1 0 2)@$:@<:) @. * NB. tacit using anonymous recursion\n","language":"J"},{"code":" H 3\n0 2\n0 1\n2 1\n0 2\n1 2\n1 0\n2 0\n","language":"J"},{"code":"H1=: monad define NB. explicit equivalent of H\n if. y do.\n ({&0 2 1 , 0 2 , {&1 0 2) H1 y-1\n else.\n i.0 2\n end.\n)\n","language":"J"},{"code":"hanoi=: monad define\n moves=. H y\n disks=. $~` ((],[,]) $:@<:) @.* y\n ('move disk ';' from peg ';' to peg ');@,.\"1 \":&.>disks,.1+moves\n)\n","language":"J"},{"code":" hanoi 3\nmove disk 1 from peg 1 to peg 3\nmove disk 2 from peg 1 to peg 2\nmove disk 1 from peg 3 to peg 2\nmove disk 3 from peg 1 to peg 3\nmove disk 1 from peg 2 to peg 1\nmove disk 2 from peg 2 to peg 3\nmove disk 1 from peg 1 to peg 3\n","language":"J"},{"code":"public void move(int n, int from, int to, int via) {\n if (n == 1) {\n System.out.println(\"Move disk from pole \" + from + \" to pole \" + to);\n } else {\n move(n - 1, from, via, to);\n move(1, from, to, via);\n move(n - 1, via, to, from);\n }\n}\n","language":"Java"},{"code":"move(3, 1, 2, 3);\n","language":"Java"},{"code":"Move disk from pole 1 to pole 2\nMove disk from pole 1 to pole 3\nMove disk from pole 2 to pole 3\nMove disk from pole 1 to pole 2\nMove disk from pole 3 to pole 1\nMove disk from pole 3 to pole 2\nMove disk from pole 1 to pole 2\n","language":"Java"},{"code":"function move(n, a, b, c) {\n if (n > 0) {\n move(n-1, a, c, b);\n console.log(\"Move disk from \" + a + \" to \" + c);\n move(n-1, b, a, c);\n }\n}\nmove(4, \"A\", \"B\", \"C\");\n","language":"JavaScript"},{"code":"(function () {\n\n // hanoi :: Int -> String -> String -> String -> [[String, String]]\n function hanoi(n, a, b, c) {\n return n ? hanoi(n - 1, a, c, b)\n .concat([\n [a, b]\n ])\n .concat(hanoi(n - 1, c, b, a)) : [];\n }\n\n return hanoi(3, 'left', 'right', 'mid')\n .map(function (d) {\n return d[0] + ' -> ' + d[1];\n });\n})();\n","language":"JavaScript"},{"code":"[\"left -> right\", \"left -> mid\",\n \"right -> mid\", \"left -> right\",\n \"mid -> left\", \"mid -> right\",\n \"left -> right\"]\n","language":"JavaScript"},{"code":"(() => {\n \"use strict\";\n\n // ----------------- TOWERS OF HANOI -----------------\n\n // hanoi :: Int -> String -> String ->\n // String -> [[String, String]]\n const hanoi = n =>\n (a, b, c) => {\n const go = hanoi(n - 1);\n\n return Boolean(n) ? [\n ...go(a, c, b),\n ...[\n [a, b]\n ],\n ...go(c, b, a)\n ] : [];\n };\n\n\n // ---------------------- TEST -----------------------\n return hanoi(3)(\"left\", \"right\", \"mid\")\n .map(d => `${d[0]} -> ${d[1]}`)\n .join(\"\\n\");\n})();\n","language":"JavaScript"},{"code":"DEFINE hanoi == [[rolldown] infra] dip\n[[[null] [pop pop] ]\n [[dup2 [[rotate] infra] dip pred]\n [[dup rest put] dip\n [[swap] infra] dip pred]\n []]]\ncondnestrec.\n","language":"Joy"},{"code":"[source destination temp] 5 hanoi.\n","language":"Joy"},{"code":"# n is the number of disks to move from From to To\ndef move(n; From; To; Via):\n if n > 0 then\n # move all but the largest at From to Via (according to the rules):\n move(n-1; From; Via; To),\n # ... so the largest disk at From is now free to move to its final destination:\n \"Move disk from \\(From) to \\(To)\",\n # Move the remaining disks at Via to To:\n move(n-1; Via; To; From)\n else empty\n end;\n","language":"Jq"},{"code":"/* Towers of Hanoi, in Jsish */\n\nfunction move(n, a, b, c) {\n if (n > 0) {\n move(n-1, a, c, b);\n puts(\"Move disk from \" + a + \" to \" + c);\n move(n-1, b, a, c);\n }\n}\n\nif (Interp.conf('unitTest')) move(4, \"A\", \"B\", \"C\");\n\n/*\n=!EXPECTSTART!=\nMove disk from A to B\nMove disk from A to C\nMove disk from B to C\nMove disk from A to B\nMove disk from C to A\nMove disk from C to B\nMove disk from A to B\nMove disk from A to C\nMove disk from B to C\nMove disk from B to A\nMove disk from C to A\nMove disk from B to C\nMove disk from A to B\nMove disk from A to C\nMove disk from B to C\n=!EXPECTEND!=\n*/\n","language":"Jsish"},{"code":"function solve(n::Integer, from::Integer, to::Integer, via::Integer)\n if n == 1\n println(\"Move disk from $from to $to\")\n else\n solve(n - 1, from, via, to)\n solve(1, from, to, via)\n solve(n - 1, via, to, from)\n end\nend\n\nsolve(4, 1, 2, 3)\n","language":"Julia"},{"code":" h:{[n;a;b;c]if[n>0;_f[n-1;a;c;b];`0:,//$($n,\":\",$a,\"->\",$b,\"\\n\");_f[n-1;c;b;a]]}\n h[4;1;2;3]\n1:1->3\n2:1->2\n1:3->2\n3:1->3\n1:2->1\n2:2->3\n1:1->3\n4:1->2\n1:3->2\n2:3->1\n1:2->1\n3:3->2\n1:1->3\n2:1->2\n1:3->2\n","language":"K"},{"code":" s:();{[n;a;b;c]if[n>0;_f[n-1;a;c;b];s,:n;_f[n-1;c;b;a]]}[4;1;2;3];s\n1 2 1 3 1 2 1 4 1 2 1 3 1 2 1\n\n 1_{*1+&|x}'a:(2_vs!_2^4)\n1 2 1 3 1 2 1 4 1 2 1 3 1 2 1\n","language":"K"},{"code":"include ..\\Utilitys.tlhy\n\n:moveDisc %B !B %C !C %A !A %n !n { n A C B }\n $n [\n $n 1 - $A $B $C moveDisc\n ( \"Move disc \" $n \" from pole \" $A \" to pole \" $C ) lprint nl\n $n 1 - $B $C $A moveDisc\n ] if\n;\n\n{ Move disc 3 from pole 1 to pole 3, with pole 2 as spare }\n3 1 3 2 moveDisc\n\n\" \" input\n","language":"Klingphix"},{"code":"// version 1.1.0\n\nclass Hanoi(disks: Int) {\n private var moves = 0\n\n init {\n println(\"Towers of Hanoi with $disks disks:\\n\")\n move(disks, 'L', 'C', 'R')\n println(\"\\nCompleted in $moves moves\\n\")\n }\n\n private fun move(n: Int, from: Char, to: Char, via: Char) {\n if (n > 0) {\n move(n - 1, from, via, to)\n moves++\n println(\"Move disk $n from $from to $to\")\n move(n - 1, via, to, from)\n }\n }\n}\n\nfun main(args: Array<String>) {\n Hanoi(3)\n Hanoi(4)\n}\n","language":"Kotlin"},{"code":"PSEUDO-CODE:\n\nhanoi disks from A to B via C\n if no disks\n then stop\n else hanoi upper disks from A to C via B\n move lower disk from A to B\n hanoi upper disks from C to B via A\n\nCODE:\n\n{def hanoi\n {lambda {:disks :a :b :c}\n {if {A.empty? :disks}\n then\n else {hanoi {A.rest :disks} :a :c :b}\n {div > move {A.first :disks} from :a to :b}\n {hanoi {A.rest :disks} :c :b :a} }}}\n-> hanoi\n\n{hanoi {A.new ==== === == =} A B C}\n->\n> move = from A to C\n> move == from A to B\n> move = from C to B\n> move === from A to C\n> move = from B to A\n> move == from B to C\n> move = from A to C\n> move ==== from A to B\n> move = from C to B\n> move == from C to A\n> move = from B to A\n> move === from C to B\n> move = from A to C\n> move == from A to B\n> move = from C to B\n","language":"Lambdatalk"},{"code":"#!/usr/bin/lasso9\n\ndefine towermove(\n\tdisks::integer,\n\ta,b,c\n) => {\n\tif(#disks > 0) => {\n\t\ttowermove(#disks - 1, #a, #c, #b )\n\t\tstdoutnl(\"Move disk from \" + #a + \" to \" + #c)\n\t\ttowermove(#disks - 1, #b, #a, #c )\n\t}\n}\n\ntowermove((integer($argv -> second || 3)), \"A\", \"B\", \"C\")\n","language":"Lasso"},{"code":"./towers\n","language":"Lasso"},{"code":"./towers 4\n","language":"Lasso"},{"code":" source$ =\"A\"\n via$ =\"B\"\n target$ =\"C\"\n\n call hanoi 4, source$, target$, via$ ' ie call procedure to move legally 4 disks from peg A to peg C via peg B\n\n wait\n\n sub hanoi numDisks, source$, target$, via$\n if numDisks =0 then\n exit sub\n else\n call hanoi numDisks -1, source$, via$, target$\n print \" Move disk \"; numDisks; \" from peg \"; source$; \" to peg \"; target$\n call hanoi numDisks -1, via$, target$, source$\n end if\n end sub\n\n end\n","language":"Liberty-BASIC"},{"code":"on hanoi (n, a, b, c)\n if n > 0 then\n hanoi(n-1, a, c, b)\n put \"Move disk from\" && a && \"to\" && c\n hanoi(n-1, b, a, c)\n end if\nend\n","language":"Lingo"},{"code":"hanoi(3, \"A\", \"B\", \"C\")\n-- \"Move disk from A to C\"\n-- \"Move disk from A to B\"\n-- \"Move disk from C to B\"\n-- \"Move disk from A to C\"\n-- \"Move disk from B to A\"\n-- \"Move disk from B to C\"\n-- \"Move disk from A to C\"\n","language":"Lingo"},{"code":"to move :n :from :to :via\n if :n = 0 [stop]\n move :n-1 :from :via :to\n (print [Move disk from] :from [to] :to)\n move :n-1 :via :to :from\nend\nmove 4 \"left \"middle \"right\n","language":"Logo"},{"code":":- object(hanoi).\n\n :- public(run/1).\n :- mode(run(+integer), one).\n :- info(run/1, [\n comment is 'Solves the towers of Hanoi problem for the specified number of disks.',\n argnames is ['Disks']]).\n\n run(Disks) :-\n move(Disks, left, middle, right).\n\n move(1, Left, _, Right):-\n !,\n report(Left, Right).\n move(Disks, Left, Aux, Right):-\n Disks2 is Disks - 1,\n move(Disks2, Left, Right, Aux),\n report(Left, Right),\n move(Disks2, Aux, Left, Right).\n\n report(Pole1, Pole2):-\n write('Move a disk from '),\n writeq(Pole1),\n write(' to '),\n writeq(Pole2),\n write('.'),\n nl.\n\n:- end_object.\n","language":"Logtalk"},{"code":"HAI 1.2\n\nHOW IZ I HANOI YR N AN YR SRC AN YR DST AN YR VIA\n BTW VISIBLE SMOOSH \"HANOI N=\" N \" SRC=\" SRC \" DST=\" DST \" VIA=\" VIA MKAY\n BOTH SAEM N AN 0, O RLY?\n YA RLY\n BTW VISIBLE \"Done.\"\n GTFO\n NO WAI\n I HAS A LOWER ITZ DIFF OF N AN 1\n I IZ HANOI YR LOWER AN YR SRC AN YR VIA AN YR DST MKAY\n VISIBLE SMOOSH \"Move disc \" N \" from \" SRC \" to \" DST MKAY\n I IZ HANOI YR LOWER AN YR VIA AN YR DST AN YR SRC MKAY\n OIC\nIF U SAY SO\n\nI IZ HANOI YR 4 AN YR 1 AN YR 2 AN YR 3 MKAY\n\nKTHXBYE\n","language":"LOLCODE"},{"code":"function move(n, src, dst, via)\n if n > 0 then\n move(n - 1, src, via, dst)\n print(src, 'to', dst)\n move(n - 1, via, dst, src)\n end\nend\n\nmove(4, 1, 2, 3)\n","language":"Lua"},{"code":"function move(n, src, via, dst)\n if n > 0 then\n move(n - 1, src, dst, via)\n print('Disk ',n,' from ' ,src, 'to', dst)\n move(n - 1, via, src, dst)\n\n end\nend\n\nmove(4, 1, 2, 3)\n","language":"Lua"},{"code":"#!/usr/bin/env luajit\nlocal function printf(fmt, ...) io.write(string.format(fmt, ...)) end\nlocal runs=0\nlocal function move(tower, from, to)\n\tif #tower[from]==0\n\t\tor (#tower[to]>0\n\t\tand tower[from][#tower[from]]>tower[to][#tower[to]]) then\n\t\t\tto,from=from,to\n\tend\n\tif #tower[from]>0 then\n\t\ttower[to][#tower[to]+1]=tower[from][#tower[from]]\n\t\ttower[from][#tower[from]]=nil\n\n\t\tio.write(tower[to][#tower[to]],\":\",from, \"→\", to, \" \")\n\tend\nend\n\nlocal function hanoi(n)\n\tlocal src,dst,via={},{},{}\n\tlocal tower={src,dst,via}\n\tfor i=1,n do src[i]=n-i+1 end\n\tlocal one,nxt,lst\n\tif n%2==1 then -- odd\n\t\tone,nxt,lst=1,2,3\n\telse\n\t\tone,nxt,lst=1,3,2\n\tend\n\t--repeat\n\t::loop::\n\t\tmove(tower, one, nxt)\n\t\tif #dst==n then return end\n\t\tmove(tower, one, lst)\n\t\tone,nxt,lst=nxt,lst,one\n\tgoto loop\n\t--until false\nend\n\nlocal num=arg[1] and tonumber(arg[1]) or 4\n\nhanoi(num)\n","language":"Lua"},{"code":"#!/usr/bin/env luajit\n-- binary solution\nlocal bit=require\"bit\"\nlocal band,bor=bit.band,bit.bor\nlocal function hanoi(n)\n\tlocal even=(n-1)%2\n\tfor m=1,2^n-1 do\n\t\tio.write(m,\":\",band(m,m-1)%3+1, \"→\", (bor(m,m-1)+1)%3+1, \" \")\n\tend\nend\n\nlocal num=arg[1] and tonumber(arg[1]) or 4\n\nhanoi(num)\n","language":"Lua"},{"code":"Module Hanoi {\n Rem HANOI TOWERS\n Print \"Three disks\" : Print\n move(3, 1, 2, 3)\n Print\n Print \"Four disks\" : Print\n move(4, 1, 2, 3)\n\n\n Sub move(n, from, to, via)\n If n <=0 Then Exit Sub\n move(n - 1, from, via, to)\n Print \"Move disk\"; n; \" from pole\"; from; \" to pole\"; to\n move(n - 1, via, to, from)\n End Sub\n}\nHanoi\n","language":"M2000-Interpreter"},{"code":" .TITLE HANOI\n .MCALL .PRINT,.EXIT\nHANOI:: MOV #4,R2\n MOV #61,R3\n MOV #62,R4\n MOV #63,R5\n JSR PC,MOVE\n .EXIT\nMOVE: DEC R2\n BLT 1$\n MOV R2,-(SP)\n MOV R3,-(SP)\n MOV R4,-(SP)\n MOV R5,-(SP)\n MOV R5,R0\n MOV R4,R5\n MOV R0,R4\n JSR PC,MOVE\n MOV (SP)+,R5\n MOV (SP)+,R4\n MOV (SP)+,R3\n MOV (SP)+,R2\n MOVB R3,3$\n MOVB R4,4$\n .PRINT #2$\n MOV R3,R0\n MOV R4,R3\n MOV R5,R4\n MOV R0,R5\n BR MOVE\n1$: RTS PC\n2$: .ASCII /MOVE DISK FROM PEG /\n3$: .ASCII /* TO PEG /\n4$: .ASCIZ /*/\n .EVEN\n .END HANOI\n","language":"MACRO-11"},{"code":" NORMAL MODE IS INTEGER\n DIMENSION LIST(100)\n SET LIST TO LIST\n\n VECTOR VALUES MOVFMT =\n 0 $20HMOVE DISK FROM POLE ,I1,S1,8HTO POLE ,I1*$\n\n INTERNAL FUNCTION(DUMMY)\n ENTRY TO MOVE.\nLOOP NUM = NUM - 1\n WHENEVER NUM.E.0\n PRINT FORMAT MOVFMT,FROM,DEST\n OTHERWISE\n SAVE RETURN\n SAVE DATA NUM,FROM,VIA,DEST\n TEMP=DEST\n DEST=VIA\n VIA=TEMP\n MOVE.(0)\n RESTORE DATA NUM,FROM,VIA,DEST\n RESTORE RETURN\n PRINT FORMAT MOVFMT,FROM,DEST\n TEMP=FROM\n FROM=VIA\n VIA=TEMP\n TRANSFER TO LOOP\n END OF CONDITIONAL\n FUNCTION RETURN\n END OF FUNCTION\n\n NUM = 4\n FROM = 1\n VIA = 2\n DEST = 3\n MOVE.(0)\n\n END OF PROGRAM\n","language":"MAD"},{"code":"Hanoi := proc(n::posint,a,b,c)\n if n = 1 then\n printf(\"Move disk from tower %a to tower %a.\\n\",a,c);\n else\n Hanoi(n-1,a,c,b);\n Hanoi(1,a,b,c);\n Hanoi(n-1,b,a,c);\n fi;\nend:\n\nprintf(\"Moving 2 disks from tower A to tower C using tower B.\\n\");\nHanoi(2,A,B,C);\n","language":"Maple"},{"code":"Hanoi[0, from_, to_, via_] := Null\nHanoi[n_Integer, from_, to_, via_] := (Hanoi[n-1, from, via, to];Print[\"Move disk from pole \", from, \" to \", to, \".\"];Hanoi[n-1, via, to, from])\n","language":"Mathematica"},{"code":"function towerOfHanoi(n,A,C,B)\n if (n~=0)\n towerOfHanoi(n-1,A,B,C);\n disp(sprintf('Move plate %d from tower %d to tower %d',[n A C]));\n towerOfHanoi(n-1,B,C,A);\n end\nend\n","language":"MATLAB"},{"code":"moveDisc = function(n, A, C, B)\n if n == 0 then return\n moveDisc n-1, A, B, C\n print \"Move disc \" + n + \" from pole \" + A + \" to pole \" + C\n moveDisc n-1, B, C, A\nend function\n\n// Move disc 3 from pole 1 to pole 3, with pole 2 as spare\nmoveDisc 3, 1, 3, 2\n","language":"MiniScript"},{"code":"# Towers of Hanoi\n# MIPS assembly implementation (tested with MARS)\n# Source: https://stackoverflow.com/questions/50382420/hanoi-towers-recursive-solution-using-mips/50383530#50383530\n\n.data\nprompt: .asciiz \"Enter a number: \"\npart1: .asciiz \"\\nMove disk \"\npart2: .asciiz \" from rod \"\npart3: .asciiz \" to rod \"\n\n.text\n.globl main\nmain:\n li $v0, 4 # print string\n la $a0, prompt\n syscall\n li $v0, 5 # read integer\n syscall\n\n # parameters for the routine\n add $a0, $v0, $zero # move to $a0\n li $a1, 'A'\n li $a2, 'B'\n li $a3, 'C'\n\n jal hanoi # call hanoi routine\n\n li $v0, 10 # exit\n syscall\n\nhanoi:\n\n #save in stack\n addi $sp, $sp, -20\n sw $ra, 0($sp)\n sw $s0, 4($sp)\n sw $s1, 8($sp)\n sw $s2, 12($sp)\n sw $s3, 16($sp)\n\n add $s0, $a0, $zero\n add $s1, $a1, $zero\n add $s2, $a2, $zero\n add $s3, $a3, $zero\n\n addi $t1, $zero, 1\n beq $s0, $t1, output\n\n recur1:\n\n addi $a0, $s0, -1\n add $a1, $s1, $zero\n add $a2, $s3, $zero\n add $a3, $s2, $zero\n jal hanoi\n\n j output\n\n recur2:\n\n addi $a0, $s0, -1\n add $a1, $s3, $zero\n add $a2, $s2, $zero\n add $a3, $s1, $zero\n jal hanoi\n\n exithanoi:\n\n lw $ra, 0($sp) # restore registers from stack\n lw $s0, 4($sp)\n lw $s1, 8($sp)\n lw $s2, 12($sp)\n lw $s3, 16($sp)\n\n addi $sp, $sp, 20 # restore stack pointer\n\n jr $ra\n\n output:\n\n li $v0, 4 # print string\n la $a0, part1\n syscall\n li $v0, 1 # print integer\n add $a0, $s0, $zero\n syscall\n li $v0, 4 # print string\n la $a0, part2\n syscall\n li $v0, 11 # print character\n add $a0, $s1, $zero\n syscall\n li $v0, 4 # print string\n la $a0, part3\n syscall\n li $v0, 11 # print character\n add $a0, $s2, $zero\n syscall\n\n beq $s0, $t1, exithanoi\n j recur2\n","language":"MIPS-Assembly"},{"code":"main :: [sys_message]\nmain = [Stdout (lay (map showmove (move 4 1 2 3)))]\n\nshowmove :: (num,num)->[char]\nshowmove (src,dest)\n = \"Move disk from pole \" ++ show src ++ \" to pole \" ++ show dest\n\nmove :: num->*->*->*->[(*,*)]\nmove n src via dest\n = [], if n=0\n = left ++ [(src,dest)] ++ right, otherwise\n where left = move (n-1) src dest via\n right = move (n-1) via src dest\n","language":"Miranda"},{"code":"MODULE Towers;\nFROM FormatString IMPORT FormatString;\nFROM Terminal IMPORT WriteString,ReadChar;\n\nPROCEDURE Move(n,from,to,via : INTEGER);\nVAR buf : ARRAY[0..63] OF CHAR;\nBEGIN\n IF n>0 THEN\n Move(n-1, from, via, to);\n FormatString(\"Move disk %i from pole %i to pole %i\\n\", buf, n, from, to);\n WriteString(buf);\n Move(n-1, via, to, from)\n END\nEND Move;\n\nBEGIN\n Move(3, 1, 3, 2);\n\n ReadChar\nEND Towers.\n","language":"Modula-2"},{"code":"MODULE Hanoi EXPORTS Main;\n\nFROM IO IMPORT Put;\nFROM Fmt IMPORT Int;\n\nPROCEDURE doHanoi(n, from, to, using: INTEGER) =\n BEGIN\n IF n > 0 THEN\n doHanoi(n - 1, from, using, to);\n Put(\"move \" & Int(from) & \" --> \" & Int(to) & \"\\n\");\n doHanoi(n - 1, using, to, from);\n END;\n END doHanoi;\n\nBEGIN\n doHanoi(4, 1, 2, 3);\nEND Hanoi.\n","language":"Modula-3"},{"code":"def move(n, fromPeg, toPeg, viaPeg):\n if (n > 0):\n move(n.previous(), fromPeg, viaPeg, toPeg)\n traceln(`Move disk $n from $fromPeg to $toPeg`)\n move(n.previous(), viaPeg, toPeg, fromPeg)\n\nmove(3, \"left\", \"right\", \"middle\")\n","language":"Monte"},{"code":"hanoi = (n, src, dest, via) ->\n if n > 1\n hanoi n-1, src, via, dest\n print \"#{src} -> #{dest}\"\n if n > 1\n hanoi n-1, via, dest, src\n\nhanoi 4,1,3,2\n","language":"MoonScript"},{"code":"using System;\nusing System.Console;\n\nmodule Towers\n{\n Hanoi(n : int, from = 1, to = 3, via = 2) : void\n {\n when (n > 0)\n {\n Hanoi(n - 1, from, via, to);\n WriteLine(\"Move disk from peg {0} to peg {1}\", from, to);\n Hanoi(n - 1, via, to, from);\n }\n }\n\n Main() : void\n {\n Hanoi(4)\n }\n}\n","language":"Nemerle"},{"code":"/* NetRexx */\noptions replace format comments java crossref symbols binary\n\nrunSample(arg)\nreturn\n\n-- 09:02, 27 August 2022 (UTC)09:02, 27 August 2022 (UTC)09:02, 27 August 2022 (UTC)09:02, 27 August 2022 (UTC)09:02, 27 August 2022 (UTC)09:02, 27 August 2022 (UTC)09:02, 27 August 2022 (UTC)09:02, 27 August 2022 (UTC)09:02, 27 August 2022 (UTC)09:02, 27 August 2022 (UTC)09:02, 27 August 2022 (UTC)09:02, 27 August 2022 (UTC)09:02, 27 August 2022 (UTC)09:02, 27 August 2022 (UTC)09:02, 27 August 2022 (UTC)~~\nmethod runSample(arg) private static\n parse arg discs .\n if discs = '', discs < 1 then discs = 4\n say 'Minimum moves to solution:' 2 ** discs - 1\n moves = move(discs)\n say 'Solved in' moves 'moves.'\n return\n\n-- 09:02, 27 August 2022 (UTC)09:02, 27 August 2022 (UTC)09:02, 27 August 2022 (UTC)09:02, 27 August 2022 (UTC)09:02, 27 August 2022 (UTC)09:02, 27 August 2022 (UTC)09:02, 27 August 2022 (UTC)09:02, 27 August 2022 (UTC)09:02, 27 August 2022 (UTC)09:02, 27 August 2022 (UTC)09:02, 27 August 2022 (UTC)09:02, 27 August 2022 (UTC)09:02, 27 August 2022 (UTC)09:02, 27 August 2022 (UTC)09:02, 27 August 2022 (UTC)~~\nmethod move(discs = int 4, towerFrom = int 1, towerTo = int 2, towerVia = int 3, moves = int 0) public static\n if discs == 1 then do\n moves = moves + 1\n say 'Move disc from peg' towerFrom 'to peg' towerTo '- Move No:' Rexx(moves).right(5)\n end\n else do\n moves = move(discs - 1, towerFrom, towerVia, towerTo, moves)\n moves = move(1, towerFrom, towerTo, towerVia, moves)\n moves = move(discs - 1, towerVia, towerTo, towerFrom, moves)\n end\n return moves\n","language":"NetRexx"},{"code":"(define (move n from to via)\n\t\t\t(if (> n 0)\n\t\t\t\t(move (- n 1) from via to\n\t\t\t\t(print \"move disk from pole \" from \" to pole \" to \"\\n\")\n\t\t\t\t(move (- n 1) via to from))))\n\n(move 4 1 2 3)\n","language":"NewLISP"},{"code":"proc hanoi(disks: int; fromTower, toTower, viaTower: string) =\n if disks != 0:\n hanoi(disks - 1, fromTower, viaTower, toTower)\n echo(\"Move disk \", disks, \" from \", fromTower, \" to \", toTower)\n hanoi(disks - 1, viaTower, toTower, fromTower)\n\nhanoi(4, \"1\", \"2\", \"3\")\n","language":"Nim"},{"code":"MODULE Hanoi;\n\n IMPORT Out;\n\n PROCEDURE Move(n,from,via,to:INTEGER);\n BEGIN\n IF n > 1 THEN\n Move(n-1,from,to,via);\n Out.String(\"Move disk from pole \");\n Out.Int(from,0);\n Out.String(\" to pole \");\n Out.Int(to,0);\n Out.Ln;\n Move(n-1,via,from,to);\n ELSE\n Out.String(\"Move disk from pole \");\n Out.Int(from,0);\n Out.String(\" to pole \");\n Out.Int(to,0);\n Out.Ln;\n END;\n END Move;\n\nBEGIN\n Move(4,1,2,3);\nEND Hanoi.\n","language":"Oberon"},{"code":"class Hanoi {\n function : Main(args : String[]) ~ Nil {\n Move(4, 1, 2, 3);\n }\n\n function: Move(n:Int, f:Int, t:Int, v:Int) ~ Nil {\n if(n = 1) {\n \"Move disk from pole {$f} to pole {$t}\"->PrintLine();\n }\n else {\n Move(n - 1, f, v, t);\n Move(1, f, t, v);\n Move(n - 1, v, t, f);\n };\n }\n}\n","language":"Objeck"},{"code":"#import <Foundation/NSObject.h>\n\n@interface TowersOfHanoi: NSObject {\n\tint pegFrom;\n\tint pegTo;\n\tint pegVia;\n\tint numDisks;\n}\n\n-(void) setPegFrom: (int) from andSetPegTo: (int) to andSetPegVia: (int) via andSetNumDisks: (int) disks;\n-(void) movePegFrom: (int) from andMovePegTo: (int) to andMovePegVia: (int) via andWithNumDisks: (int) disks;\n@end\n","language":"Objective-C"},{"code":"#import \"TowersOfHanoi.h\"\n@implementation TowersOfHanoi\n\n-(void) setPegFrom: (int) from andSetPegTo: (int) to andSetPegVia: (int) via andSetNumDisks: (int) disks {\n\tpegFrom = from;\n\tpegTo = to;\n\tpegVia = via;\n\tnumDisks = disks;\n}\n\n-(void) movePegFrom: (int) from andMovePegTo: (int) to andMovePegVia: (int) via andWithNumDisks: (int) disks {\n\tif (disks == 1) {\n printf(\"Move disk from pole %i to pole %i\\n\", from, to);\n } else {\n \t\t\t[self movePegFrom: from andMovePegTo: via andMovePegVia: to andWithNumDisks: disks-1];\n\t\t\t[self movePegFrom: from andMovePegTo: to andMovePegVia: via andWithNumDisks: 1];\n\t\t\t[self movePegFrom: via andMovePegTo: to andMovePegVia: from andWithNumDisks: disks-1];\n }\n}\n\n@end\n","language":"Objective-C"},{"code":"#import <stdio.h>\n#import \"TowersOfHanoi.h\"\n\nint main( int argc, const char *argv[] ) {\n\t@autoreleasepool {\n\n\t\tTowersOfHanoi *tower = [[TowersOfHanoi alloc] init];\n\n\t\tint from = 1;\n\t\tint to = 3;\n\t\tint via = 2;\n\t\tint disks = 3;\n\n\t\t[tower setPegFrom: from andSetPegTo: to andSetPegVia: via andSetNumDisks: disks];\n\n\t\t[tower movePegFrom: from andMovePegTo: to andMovePegVia: via andWithNumDisks: disks];\n\n\t}\n\treturn 0;\n}\n","language":"Objective-C"},{"code":"let rec hanoi n a b c =\n if n <> 0 then begin\n hanoi (pred n) a c b;\n Printf.printf \"Move disk from pole %d to pole %d\\n\" a b;\n hanoi (pred n) c b a\n end\n\nlet () =\n hanoi 4 1 2 3\n","language":"OCaml"},{"code":"function hanoimove(ndisks, from, to, via)\n if ( ndisks == 1 )\n printf(\"Move disk from pole %d to pole %d\\n\", from, to);\n else\n hanoimove(ndisks-1, from, via, to);\n hanoimove(1, from, to, via);\n hanoimove(ndisks-1, via, to, from);\n endif\nendfunction\n\nhanoimove(4, 1, 2, 3);\n","language":"Octave"},{"code":": move(n, from, to, via)\n n 0 > ifTrue: [\n move(n 1-, from, via, to)\n System.Out \"Move disk from \" << from << \" to \" << to << cr\n move(n 1-, via, to, from)\n ] ;\n\n5 $left $middle $right) move\n","language":"Oforth"},{"code":"declare\n proc {TowersOfHanoi N From To Via}\n if N > 0 then\n {TowersOfHanoi N-1 From Via To}\n {System.showInfo \"Move from \"#From#\" to \"#To}\n {TowersOfHanoi N-1 Via To From}\n end\n end\nin\n {TowersOfHanoi 4 left middle right}\n","language":"Oz"},{"code":"\\\\ Towers of Hanoi\n\\\\ 8/19/2016 aev\n\\\\ Where: n - number of disks, sp - start pole, ep - end pole.\nHanoiTowers(n,sp,ep)={\n if(n!=0,\n HanoiTowers(n-1,sp,6-sp-ep);\n print(\"Move disk \", n, \" from pole \", sp,\" to pole \", ep);\n HanoiTowers(n-1,6-sp-ep,ep);\n );\n}\n\\\\ Testing n=3:\nHanoiTowers(3,1,3);\n","language":"PARI-GP"},{"code":"program Hanoi;\ntype\n TPole = (tpLeft, tpCenter, tpRight);\nconst\n strPole:array[TPole] of string[6]=('left','center','right');\n\n procedure MoveStack (const Ndisks : integer; const Origin,Destination,Auxiliary:TPole);\n begin\n if Ndisks >0 then begin\n MoveStack(Ndisks - 1, Origin,Auxiliary, Destination );\n Writeln('Move disk ',Ndisks ,' from ',strPole[Origin],' to ',strPole[Destination]);\n MoveStack(Ndisks - 1, Auxiliary, Destination, origin);\n end;\n end;\n\nbegin\n MoveStack(4,tpLeft,tpCenter,tpRight);\nend.\n","language":"Pascal"},{"code":"program Hanoi;\ntype\n TPole = (tpLeft, tpCenter, tpRight);\nconst\n strPole:array[TPole] of string[6]=('left','center','right');\n\n procedure MoveOneDisk(const DiskNum:integer; const Origin,Destination:TPole);\n begin\n Writeln('Move disk ',DiskNum,' from ',strPole[Origin],' to ',strPole[Destination]);\n end;\n\n procedure MoveStack (const Ndisks : integer; const Origin,Destination,Auxiliary:TPole);\n begin\n if Ndisks =1 then\n MoveOneDisk(1,origin,Destination)\n else begin\n MoveStack(Ndisks - 1, Origin,Auxiliary, Destination );\n MoveOneDisk(Ndisks,origin,Destination);\n MoveStack(Ndisks - 1, Auxiliary, Destination, origin);\n end;\n end;\n\nbegin\n MoveStack(4,tpLeft,tpCenter,tpRight);\nend.\n","language":"Pascal"},{"code":"sub hanoi {\n my ($n, $from, $to, $via) = (@_, 1, 2, 3);\n\n if ($n == 1) {\n print \"Move disk from pole $from to pole $to.\\n\";\n } else {\n hanoi($n - 1, $from, $via, $to);\n hanoi(1, $from, $to, $via);\n hanoi($n - 1, $via, $to, $from);\n };\n};\n","language":"Perl"},{"code":"(phixonline)-->\n <span style=\"color: #008080;\">constant</span> <span style=\"color: #000000;\">poles</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #0000FF;\">{</span><span style=\"color: #008000;\">\"left\"</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #008000;\">\"middle\"</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #008000;\">\"right\"</span><span style=\"color: #0000FF;\">}</span>\n <span style=\"color: #008080;\">enum</span> <span style=\"color: #000000;\">left</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">middle</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">right</span>\n\n <span style=\"color: #004080;\">sequence</span> <span style=\"color: #000000;\">disks</span>\n <span style=\"color: #004080;\">integer</span> <span style=\"color: #000000;\">moves</span>\n\n <span style=\"color: #008080;\">procedure</span> <span style=\"color: #000000;\">showpegs</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #004080;\">integer</span> <span style=\"color: #000000;\">src</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #004080;\">integer</span> <span style=\"color: #000000;\">dest</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #004080;\">string</span> <span style=\"color: #000000;\">desc</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">sprintf</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #008000;\">\"%s to %s:\"</span><span style=\"color: #0000FF;\">,{</span><span style=\"color: #000000;\">poles</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">src</span><span style=\"color: #0000FF;\">],</span><span style=\"color: #000000;\">poles</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">dest</span><span style=\"color: #0000FF;\">]})</span>\n <span style=\"color: #000000;\">disks</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">dest</span><span style=\"color: #0000FF;\">]</span> <span style=\"color: #0000FF;\">&=</span> <span style=\"color: #000000;\">disks</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">src</span><span style=\"color: #0000FF;\">][$]</span>\n <span style=\"color: #000000;\">disks</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">src</span><span style=\"color: #0000FF;\">]</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">disks</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">src</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;\">1</span> <span style=\"color: #008080;\">to</span> <span style=\"color: #7060A8;\">length</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">disks</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;\">\"%-16s | %s\\n\"</span><span style=\"color: #0000FF;\">,{</span><span style=\"color: #000000;\">desc</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #7060A8;\">join</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #7060A8;\">sq_add</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">disks</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">i</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;\">desc</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #008000;\">\"\"</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: #000000;\">moves</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;\">hanoir</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #004080;\">integer</span> <span style=\"color: #000000;\">n</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">src</span><span style=\"color: #0000FF;\">=</span><span style=\"color: #000000;\">left</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">dest</span><span style=\"color: #0000FF;\">=</span><span style=\"color: #000000;\">right</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">via</span><span style=\"color: #0000FF;\">=</span><span style=\"color: #000000;\">middle</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;\">0</span> <span style=\"color: #008080;\">then</span>\n <span style=\"color: #000000;\">hanoir</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;\">src</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">via</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">dest</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #000000;\">showpegs</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">src</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">dest</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #000000;\">hanoir</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;\">via</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">dest</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">src</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;\">procedure</span>\n\n <span style=\"color: #008080;\">procedure</span> <span style=\"color: #000000;\">hanoi</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: #000000;\">disks</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #0000FF;\">{</span><span style=\"color: #7060A8;\">reverse</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>\n <span style=\"color: #000000;\">moves</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">0</span>\n <span style=\"color: #000000;\">hanoir</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;\">\"completed in %d moves\\n\"</span><span style=\"color: #0000FF;\">,{</span><span style=\"color: #000000;\">moves</span><span style=\"color: #0000FF;\">})</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">procedure</span>\n\n <span style=\"color: #000000;\">hanoi</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">3</span><span style=\"color: #0000FF;\">)</span> <span style=\"color: #000080;font-style:italic;\">-- (output of 4,5,6 also shown)</span>\n<!--\n","language":"Phix"},{"code":"module hanoi;\n\nextern printf;\n\n@Void move(@Integer n, @Integer from, @Integer to, @Integer via) [\n\tif (n > 0) {\n\t\tmove(n - 1, from, via, to);\n\t\tprintf(\"Move disk from pole %d to pole %d\\n\", from, to);\n\t\tmove(n - 1, via, to, from);\n\t}\n]\n\n@Integer main [\n\tmove(4, 1,2,3);\n\treturn 0;\n]\n","language":"PHL"},{"code":"function move($n,$from,$to,$via) {\n if ($n === 1) {\n print(\"Move disk from pole $from to pole $to\");\n } else {\n move($n-1,$from,$via,$to);\n move(1,$from,$to,$via);\n move($n-1,$via,$to,$from);\n }\n}\n","language":"PHP"},{"code":"main =>\n hanoi(3, left, center, right).\n\nhanoi(0, _From, _To, _Via) => true.\nhanoi(N, From, To, Via) =>\n hanoi(N - 1, From, Via, To),\n printf(\"Move disk %w from pole %w to pole %w\\n\", N, From, To),\n hanoi(N - 1, Via, To, From).\n","language":"Picat"},{"code":"main =>\n hanoi(64).\n\nhanoi(N) =>\n printf(\"N=%d\\n\", N),\n Count = move(N, left, center, right) ,\n printf(\"count=%w, theoretical=%w\\n\", Count, 2**N-1).\n\ntable\nmove(0, _From, _To, _Via) = 0.\nmove(N, From, To, Via) = Count =>\n Count1 = move(N - 1, From, Via, To),\n Count2 = move(N - 1, Via, To, From),\n Count = Count1+Count2+1.\n","language":"Picat"},{"code":"(de move (N A B C) # Use: (move 3 'left 'center 'right)\n (unless (=0 N)\n (move (dec N) A C B)\n (println 'Move 'disk 'from A 'to B)\n (move (dec N) C B A) ) )\n","language":"PicoLisp"},{"code":"tower: proc options (main);\n\n call Move (4,1,2,3);\n\nMove: procedure (ndiscs, from, to, via) recursive;\n declare (ndiscs, from, to, via) fixed binary;\n\n if ndiscs = 1 then\n put skip edit ('Move disc from pole ', trim(from), ' to pole ',\n trim(to) ) (a);\n else\n do;\n call Move (ndiscs-1, from, via, to);\n call Move (1, from, to, via);\n call Move (ndiscs-1, via, to, from);\n end;\nend Move;\n\nend tower;\n","language":"PL-I"},{"code":"100H: /* ITERATIVE TOWERS OF HANOI; TRANSLATED FROM TINY BASIC (VIA ALGOL W) */\n\n /* CP/M BDOS SYSTEM CALL */\n BDOS: PROCEDURE( FN, ARG ); DECLARE FN BYTE, ARG ADDRESS; GOTO 5; END;\n /* I/O ROUTINES */\n PR$CHAR: PROCEDURE( C ); DECLARE C BYTE; CALL BDOS( 2, C ); END;\n PR$STRING: PROCEDURE( S ); DECLARE S ADDRESS; CALL BDOS( 9, S ); END;\n\n DECLARE ( D, N, X, S, T ) ADDRESS;\n /* FIXED NUMBER OF DISCS: 4 */\n N = 1;\n DO D = 1 TO 4;\n N = N + N;\n END;\n DO X = 1 TO N - 1;\n /* AS IN ALGOL W, WE CAN USE PL/M'S BIT ABD MOD OPERATORS */\n S = ( X AND ( X - 1 ) ) MOD 3;\n T = ( ( X OR ( X - 1 ) ) + 1 ) MOD 3;\n CALL PR$STRING( .'MOVE DISC ON PEG $' );\n CALL PR$CHAR( '1' + S );\n CALL PR$STRING( .' TO PEG $' );\n CALL PR$CHAR( '1' + T );\n CALL PR$STRING( .( 0DH, 0AH, '$' ) );\n END;\nEOF\n","language":"PL-M"},{"code":"\\newcount\\hanoidepth\n\\def\\hanoi#1{%\n \\hanoidepth = #1\n \\move abc\n}%\n\\def\\move#1#2#3{%\n \\advance \\hanoidepth by -1\n \\ifnum \\hanoidepth > 0\n \\move #1#3#2\n \\fi\n Move the upper disk from pole #1 to pole #3.\\par\n \\ifnum \\hanoidepth > 0\n \\move#2#1#3\n \\fi\n \\advance \\hanoidepth by 1\n}\n\n\\hanoi{5}\n\\end\n","language":"PlainTeX"},{"code":"define hanoi(n, src, dst, via);\nif n > 0 then\n hanoi(n - 1, src, via, dst);\n 'Move disk ' >< n >< ' from ' >< src >< ' to ' >< dst >< '.' =>\n hanoi(n - 1, via, dst, src);\nendif;\nenddefine;\n\nhanoi(4, \"left\", \"middle\", \"right\");\n","language":"Pop11"},{"code":"%!PS-Adobe-3.0\n%%BoundingBox: 0 0 300 300\n\n/plate {\n exch 100 mul 50 add exch th mul 10 add moveto\n dup s mul neg 2 div 0 rmoveto\n dup s mul 0 rlineto\n 0 th rlineto\n s neg mul 0 rlineto\n closepath gsave .5 setgray fill grestore 0 setgray stroke\n} def\n\n/drawtower {\n 0 1 2 { /x exch def /y 0 def\n tower x get {\n dup 0 gt { x y plate /y y 1 add def } {pop} ifelse\n } forall\n } for showpage\n} def\n\n/apop { [ exch aload pop /last exch def ] last } def\n/apush{ [ 3 1 roll aload pop counttomark -1 roll ] } def\n\n/hanoi {\n 0 dict begin /from /mid /to /h 5 -1 2 { -1 roll def } for\n h 1 eq {\n tower from get apop tower to get apush\n tower to 3 -1 roll put\n tower from 3 -1 roll put\n drawtower\n } {\n /h h 1 sub def\n from to mid h hanoi\n from mid to 1 hanoi\n mid from to h hanoi\n } ifelse\n end\n} def\n\n\n/n 12 def\n/s 90 n div def\n/th 180 n div def\n/tower [ [n 1 add -1 2 { } for ] [] [] ] def\n\ndrawtower 0 1 2 n hanoi\n\n%%EOF\n","language":"PostScript"},{"code":"function hanoi($n, $a, $b, $c) {\n if($n -eq 1) {\n \"$a -> $c\"\n } else{\n hanoi ($n - 1) $a $c $b\n hanoi 1 $a $b $c\n hanoi ($n - 1) $b $a $c\n }\n}\nhanoi 3 \"A\" \"B\" \"C\"\n","language":"PowerShell"},{"code":"hanoi(N) :- move(N,left,center,right).\n\nmove(0,_,_,_) :- !.\nmove(N,A,B,C) :-\n M is N-1,\n move(M,A,C,B),\n inform(A,B),\n move(M,C,B,A).\n\ninform(X,Y) :- write([move,a,disk,from,the,X,pole,to,Y,pole]), nl.\n","language":"Prolog"},{"code":"hanoi(N, Src, Aux, Dest, Moves-NMoves) :-\n NMoves is 2^N - 1,\n length(Moves, NMoves),\n phrase(move(N, Src, Aux, Dest), Moves).\n\n\nmove(1, Src, _, Dest) --> !,\n [Src->Dest].\n\nmove(2, Src, Aux, Dest) --> !,\n [Src->Aux,Src->Dest,Aux->Dest].\n\nmove(N, Src, Aux, Dest) -->\n { succ(N0, N) },\n move(N0, Src, Dest, Aux),\n move(1, Src, Aux, Dest),\n move(N0, Aux, Src, Dest).\n","language":"Prolog"},{"code":"Procedure Hanoi(n, A.s, C.s, B.s)\n If n\n Hanoi(n-1, A, B, C)\n PrintN(\"Move the plate from \"+A+\" to \"+C)\n Hanoi(n-1, B, C, A)\n EndIf\nEndProcedure\n","language":"PureBasic"},{"code":"Procedure Hanoi(n, A.s, C.s, B.s)\n If n\n Hanoi(n-1, A, B, C)\n PrintN(\"Move the plate from \"+A+\" to \"+C)\n Hanoi(n-1, B, C, A)\n EndIf\nEndProcedure\n\nIf OpenConsole()\n Define n=3\n PrintN(\"Moving \"+Str(n)+\" pegs.\"+#CRLF$)\n Hanoi(n,\"Left Peg\",\"Middle Peg\",\"Right Peg\")\n PrintN(#CRLF$+\"Press ENTER to exit.\"): Input()\nEndIf\n","language":"PureBasic"},{"code":"def hanoi(ndisks, startPeg=1, endPeg=3):\n if ndisks:\n hanoi(ndisks-1, startPeg, 6-startPeg-endPeg)\n print(f\"Move disk {ndisks} from peg {startPeg} to peg {endPeg}\")\n hanoi(ndisks-1, 6-startPeg-endPeg, endPeg)\n\nhanoi(4)\n","language":"Python"},{"code":"'''Towers of Hanoi'''\n\n\n# hanoi :: Int -> String -> String -> String -> [(String, String)]\ndef hanoi(n):\n '''A list of (from, to) label pairs,\n where a, b and c are labels for each of the\n three Hanoi tower positions.'''\n def go(n, a, b, c):\n p = n - 1\n return (\n go(p, a, c, b) + [(a, b)] + go(p, c, b, a)\n ) if 0 < n else []\n return lambda a: lambda b: lambda c: go(n, a, b, c)\n\n\n# TEST ----------------------------------------------------\nif __name__ == '__main__':\n\n # fromTo :: (String, String) -> String\n def fromTo(xy):\n '''x -> y'''\n x, y = xy\n return x.rjust(5, ' ') + ' -> ' + y\n\n print(__doc__ + ':\\n\\n' + '\\n'.join(\n map(fromTo, hanoi(4)('left')('right')('mid'))\n ))\n","language":"Python"},{"code":"'''Towers of Hanoi'''\n\nfrom itertools import accumulate, chain, repeat\nfrom inspect import signature\nimport operator\n\n\n# hanoi :: Int -> [(Int, Int)]\ndef hanoi(n):\n '''A list of index pairs, representing disk moves\n between indexed Hanoi positions.\n '''\n def go(n, a, b, c):\n p = n - 1\n return (\n go(p, a, c, b) + [(a, b)] + go(p, c, b, a)\n ) if 0 < n else []\n return go(n, 0, 2, 1)\n\n\n# hanoiState :: ([Int],[Int],[Int], String) -> (Int, Int) ->\n# ([Int],[Int],[Int], String)\ndef hanoiState(tpl, ab):\n '''A new Hanoi tower state'''\n a, b = ab\n xs, ys = tpl[a], tpl[b]\n\n w = 3 * (2 + (2 * max(map(max, filter(len, tpl[:-1])))))\n\n def delta(i):\n return tpl[i] if i not in ab else xs[1:] if (\n i == a\n ) else [xs[0]] + ys\n\n tkns = moveName(('left', 'mid', 'right'))(ab)\n caption = ' '.join(tkns)\n return tuple(map(delta, [0, 1, 2])) + (\n (caption if tkns[0] != 'mid' else caption.rjust(w, ' ')),\n )\n\n\n# showHanoi :: ([Int],[Int],[Int], String) -> String\ndef showHanoi(tpl):\n '''Captioned string representation of an updated Hanoi tower state.'''\n\n def fullHeight(n):\n return lambda xs: list(repeat('', n - len(xs))) + xs\n\n mul = curry(operator.mul)\n lt = curry(operator.lt)\n rods = fmap(fmap(mul('__')))(\n list(tpl[0:3])\n )\n h = max(map(len, rods))\n w = 2 + max(\n map(\n compose(max)(fmap(len)),\n filter(compose(lt(0))(len), rods)\n )\n )\n xs = fmap(concat)(\n transpose(fmap(\n compose(fmap(center(w)(' ')))(\n fullHeight(h)\n )\n )(rods))\n )\n return tpl[3] + '\\n\\n' + unlines(xs) + '\\n' + ('___' * w)\n\n\n# moveName :: (String, String, String) -> (Int, Int) -> [String]\ndef moveName(labels):\n '''(from, to) index pair represented as an a -> b string.'''\n def go(ab):\n a, b = ab\n return [labels[a], ' to ', labels[b]] if a < b else [\n labels[b], ' from ', labels[a]\n ]\n return lambda ab: go(ab)\n\n\n# TEST ----------------------------------------------------\ndef main():\n '''Visualisation of a Hanoi tower sequence for N discs.\n '''\n n = 3\n print('Hanoi sequence for ' + str(n) + ' disks:\\n')\n print(unlines(\n fmap(showHanoi)(\n scanl(hanoiState)(\n (enumFromTo(1)(n), [], [], '')\n )(hanoi(n))\n )\n ))\n\n\n# GENERIC -------------------------------------------------\n\n# center :: Int -> Char -> String -> String\ndef center(n):\n '''String s padded with c to approximate centre,\n fitting in but not truncated to width n.'''\n return lambda c: lambda s: s.center(n, c)\n\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# concat :: [[a]] -> [a]\n# concat :: [String] -> String\ndef concat(xs):\n '''The concatenation of all the elements\n in a list or iterable.'''\n\n def f(ys):\n zs = list(chain(*ys))\n return ''.join(zs) if isinstance(ys[0], str) else zs\n\n return (\n f(xs) if isinstance(xs, list) else (\n chain.from_iterable(xs)\n )\n ) if xs else []\n\n\n# curry :: ((a, b) -> c) -> a -> b -> c\ndef curry(f):\n '''A curried function derived\n from an uncurried function.'''\n if 1 < len(signature(f).parameters):\n return lambda x: lambda y: f(x, y)\n else:\n return f\n\n\n# enumFromTo :: (Int, Int) -> [Int]\ndef enumFromTo(m):\n '''Integer enumeration from m to n.'''\n return lambda n: list(range(m, 1 + n))\n\n\n# fmap :: (a -> b) -> [a] -> [b]\ndef fmap(f):\n '''fmap over a list.\n f lifted to a function over a list.\n '''\n return lambda xs: list(map(f, xs))\n\n\n# scanl :: (b -> a -> b) -> b -> [a] -> [b]\ndef scanl(f):\n '''scanl is like reduce, but returns a succession of\n intermediate values, building from the left.\n '''\n return lambda a: lambda xs: (\n accumulate(chain([a], xs), f)\n )\n\n\n# showLog :: a -> IO String\ndef showLog(*s):\n '''Arguments printed with\n intercalated arrows.'''\n print(\n ' -> '.join(map(str, s))\n )\n\n\n# transpose :: Matrix a -> Matrix a\ndef transpose(m):\n '''The rows and columns of the argument transposed.\n (The matrix containers and rows can be lists or tuples).\n '''\n if m:\n inner = type(m[0])\n z = zip(*m)\n return (type(m))(\n map(inner, z) if tuple != inner else z\n )\n else:\n return m\n\n\n# unlines :: [String] -> String\ndef unlines(xs):\n '''A single string derived by the intercalation\n of a list of strings with the newline character.\n '''\n return '\\n'.join(xs)\n\n\n# TEST ----------------------------------------------------\nif __name__ == '__main__':\n main()\n","language":"Python"},{"code":" [ stack ] is rings ( --> [ )\n\n [ rings share\n depth share -\n 8 * times sp\n emit sp emit sp\n say 'move' cr ] is echomove ( c c --> )\n\n [ dup rings put\n depth put\n char a char b char c\n [ swap decurse\n rot 2dup echomove\n decurse\n swap rot ]\n 3 times drop\n depth release\n rings release ] is hanoi ( n --> n )\n\n say 'How to solve a three ring Towers of Hanoi puzzle:' cr cr\n 3 hanoi cr\n","language":"Quackery"},{"code":"1000 REM Towers of Hanoi\n1010 REM Quite BASIC Puzzle Project\n1020 CLS\n1030 PRINT \"Towers of Hanoi\"\n1040 PRINT\n1050 PRINT \"This is a recursive solution for seven discs.\"\n1060 PRINT\n1070 PRINT \"See the REM statements in the program if you didn't think that recursion was possible in classic BASIC!\"\n1080 REM Yep, recursive GOSUB calls works in Quite BASIC!\n1090 REM However, to actually write useful recursive algorithms, it helps to have variable scoping and parameters to subroutines -- something classic BASIC is lacking. In this case we have only one \"parameter\" -- the variable N. And subroutines are always called with N-1. This is lucky for us because we can keep track of the value by decrementing it when we enter subroutines and incrementing it back when we exit.\n1100 REM If we had subroutine parameters we could have written a single subroutine for moving discs from peg P to peg Q where P and Q were subroutine parameters, but no such luck. Instead we have to write six different subroutines for moving from peg to peg. See Subroutines 4000, 5000, 6000, 7000, 8000, and 9000.\n1110 REM ===============================\n2000 REM A, B, and C are arrays holding the discs\n2010 REM We refer to the corresponding pegs as peg A, B, and C\n2020 ARRAY A\n2030 ARRAY B\n2040 ARRAY C\n2050 REM Fill peg A with seven discs\n2060 FOR I = 0 TO 6\n2070 LET A[I] = 7 - I\n2080 NEXT I\n2090 REM X, Y, Z hold the number of discs on pegs A, B, and C\n2100 LET X = 7\n2110 LET Y = 0\n2120 LET Z = 0\n2130 REM Disc colors\n2140 ARRAY P\n2150 LET P[1] = \"cyan\"\n2160 LET P[2] = \"blue\"\n2170 LET P[3] = \"green\"\n2180 LET P[4] = \"yellow\"\n2190 LET P[5] = \"magenta\"\n2200 LET P[6] = \"orange\"\n2210 LET P[7] = \"red\"\n2220 REM Draw initial position -- all discs on the A peg\n2230 FOR I = 0 TO 6\n2240 FOR J = 8 - A[I] TO 8 + A[I]\n2250 PLOT J, I, P[A[I]]\n2260 NEXT J\n2270 NEXT I\n2280 REM N is the number of discs to move\n2290 LET N = 7\n2320 REM Move all discs from peg A to peg B\n2310 GOSUB 6000\n2320 END\n3000 REM The subroutines 3400, 3500, 3600, 3700, 3800, 3900\n3010 REM handle the drawing of the discs on the canvas as we\n3020 REM move discs from one peg to another.\n3030 REM These subroutines also update the variables X, Y, and Z\n3040 REM which hold the number of discs on each peg.\n3050 REM ==============================\n3400 REM Subroutine -- Remove disc from peg A\n3410 LET X = X - 1\n3420 FOR I = 8 - A[X] TO 8 + A[X]\n3430 PLOT I, X, \"gray\"\n3440 NEXT I\n3450 RETURN\n3500 REM Subroutine -- Add disc to peg A\n3510 FOR I = 8 - A[X] TO 8 + A[X]\n3520 PLOT I, X, P[A[X]]\n3530 NEXT I\n3540 LET X = X + 1\n3550 PAUSE 400 * (5 - LEVEL) + 10\n3560 RETURN\n3600 REM Subroutine -- Remove disc from peg B\n3610 LET Y = Y - 1\n3620 FOR I = 24 - B[Y] TO 24 + B[Y]\n3630 PLOT I, Y, \"gray\"\n3640 NEXT I\n3650 RETURN\n3700 REM Subroutine -- Add disc to peg B\n3710 FOR I = 24 - B[Y] TO 24 + B[Y]\n3720 PLOT I, Y, P[B[Y]]\n3730 NEXT I\n3740 LET Y = Y + 1\n3750 PAUSE 400 * (5 - LEVEL) + 10\n3760 RETURN\n3800 REM Subroutine -- Remove disc from peg C\n3810 LET Z = Z - 1\n3820 FOR I = 40 - C[Z] TO 40 + C[Z]\n3830 PLOT I, Z, \"gray\"\n3840 NEXT I\n3850 RETURN\n3900 REM Subroutine -- Add disc to peg C\n3910 FOR I = 40 - C[Z] TO 40 + C[Z]\n3920 PLOT I, Z, P[C[Z]]\n3930 NEXT I\n3940 LET Z = Z + 1\n3950 PAUSE 400 * (5 - LEVEL) + 10\n3960 RETURN\n4000 REM ======================================\n4010 REM Recursive Subroutine -- move N discs from peg B to peg A\n4020 REM First move N-1 discs from peg B to peg C\n4030 LET N = N - 1\n4040 IF N <> 0 THEN GOSUB 9000\n4050 REM Then move one disc from peg B to peg A\n4060 GOSUB 3600\n4070 LET A[X] = B[Y]\n4080 GOSUB 3500\n4090 REM And finally move N-1 discs from peg C to peg A\n4100 IF N <> 0 THEN GOSUB 5000\n4110 REM Restore N before returning\n4120 LET N = N + 1\n4130 RETURN\n5000 REM ======================================\n5010 REM Recursive Subroutine -- Move N discs from peg C to peg A\n5020 REM First move N-1 discs from peg C to peg B\n5030 LET N = N - 1\n5040 IF N <> 0 THEN GOSUB 8000\n5050 REM Then move one disc from peg C to peg A\n5060 GOSUB 3800\n5070 LET A[X] = C[Z]\n5080 GOSUB 3500\n5090 REM And finally move N-1 discs from peg B to peg A\n5100 IF N <> 0 THEN GOSUB 4000\n5120 REM Restore N before returning\n5130 LET N = N + 1\n5140 RETURN\n6000 REM ======================================\n6000 REM Recursive Subroutine -- Move N discs from peg A to peg B\n6010 REM First move N-1 discs from peg A to peg C\n6020 LET N = N - 1\n6030 IF N <> 0 THEN GOSUB 7000\n6040 REM Then move one disc from peg A to peg B\n6050 GOSUB 3400\n6060 LET B[Y] = A[X]\n6070 GOSUB 3700\n6090 REM And finally move N-1 discs from peg C to peg B\n6100 IF N <> 0 THEN GOSUB 8000\n6110 REM Restore N before returning\n6120 LET N = N + 1\n6130 RETURN\n7000 REM ======================================\n7010 REM Recursive Subroutine -- Move N discs from peg A to peg C\n7020 REM First move N-1 discs from peg A to peg B\n7030 LET N = N - 1\n7040 IF N <> 0 THEN GOSUB 6000\n7050 REM Then move one disc from peg A to peg C\n7060 GOSUB 3400\n7070 LET C[Z] = A[X]\n7080 GOSUB 3900\n7090 REM And finally move N-1 discs from peg B to peg C\n7100 IF N <> 0 THEN GOSUB 9000\n7110 REM Restore N before returning\n7120 LET N = N + 1\n7130 RETURN\n8000 REM ======================================\n8010 REM Recursive Subroutine -- Move N discs from peg C to peg B\n8020 REM First move N-1 discs from peg C to peg A\n8030 LET N = N - 1\n8040 IF N <> 0 THEN GOSUB 5000\n8050 REM Then move one disc from peg C to peg B\n8060 GOSUB 3800\n8070 LET B[Y] = C[Z]\n8080 GOSUB 3700\n8090 REM And finally move N-1 discs from peg A to peg B\n8100 IF N <> 0 THEN GOSUB 6000\n8110 REM Restore N before returning\n8120 LET N = N + 1\n8130 RETURN\n9000 REM ======================================\n9010 REM Recursive Subroutine -- Move N discs from peg B to peg C\n9020 REM First move N-1 discs from peg B to peg A\n9030 LET N = N - 1\n9040 IF N <> 0 THEN GOSUB 4000\n9050 REM Then move one disc from peg B to peg C\n9060 GOSUB 3600\n9070 LET C[Z] = B[Y]\n9080 GOSUB 3900\n9090 REM And finally move N-1 discs from peg A to peg C\n9100 IF N <> 0 THEN GOSUB 7000\n9110 REM Restore N before returning\n9120 LET N = N + 1\n9130 RETURN\n","language":"Quite-BASIC"},{"code":"hanoimove <- function(ndisks, from, to, via) {\n if (ndisks == 1) {\n cat(\"move disk from\", from, \"to\", to, \"\\n\")\n } else {\n hanoimove(ndisks - 1, from, via, to)\n hanoimove(1, from, to, via)\n hanoimove(ndisks - 1, via, to, from)\n }\n}\n\nhanoimove(4, 1, 2, 3)\n","language":"R"},{"code":"#lang racket\n(define (hanoi n a b c)\n (when (> n 0)\n (hanoi (- n 1) a c b)\n (printf \"Move ~a to ~a\\n\" a b)\n (hanoi (- n 1) c b a)))\n(hanoi 4 'left 'middle 'right)\n","language":"Racket"},{"code":"subset Peg of Int where 1|2|3;\n\nmulti hanoi (0, Peg $a, Peg $b, Peg $c) { }\nmulti hanoi (Int $n, Peg $a = 1, Peg $b = 2, Peg $c = 3) {\n hanoi $n - 1, $a, $c, $b;\n say \"Move $a to $b.\";\n hanoi $n - 1, $c, $b, $a;\n}\n","language":"Raku"},{"code":"public void hanoi(ndisks, startPeg, endPeg){\n\tif(ndisks>0){\n\t\thanoi(ndisks-1, startPeg, 6 - startPeg - endPeg);\n\t\tprintln(\"Move disk <ndisks> from peg <startPeg> to peg <endPeg>\");\n\t\thanoi(ndisks-1, 6 - startPeg - endPeg, endPeg);\n\t}\n}\n","language":"Rascal"},{"code":"rascal>hanoi(4,1,3)\nMove disk 1 from peg 1 to peg 2\nMove disk 2 from peg 1 to peg 3\nMove disk 1 from peg 2 to peg 3\nMove disk 3 from peg 1 to peg 2\nMove disk 1 from peg 3 to peg 1\nMove disk 2 from peg 3 to peg 2\nMove disk 1 from peg 1 to peg 2\nMove disk 4 from peg 1 to peg 3\nMove disk 1 from peg 2 to peg 3\nMove disk 2 from peg 2 to peg 1\nMove disk 1 from peg 3 to peg 1\nMove disk 3 from peg 2 to peg 3\nMove disk 1 from peg 1 to peg 2\nMove disk 2 from peg 1 to peg 3\nMove disk 1 from peg 2 to peg 3\nok\n","language":"Rascal"},{"code":"define hanoi use ndisks, startpeg, endpeg\n ndisks 0 > if\n 6 startpeg - endpeg - startpeg ndisks 1 - hanoi\n endpeg startpeg ndisks \"Move disk %d from peg %d to peg %d\\n\" print\n endpeg 6 startpeg - endpeg - ndisks 1 - hanoi\n\ndefine dohanoi use ndisks\n # startpeg=1, endpeg=3\n 3 1 ndisks hanoi\n\n# 4 disks\n4 dohanoi\n","language":"Raven"},{"code":"REBOL [\n\tTitle: \"Towers of Hanoi\"\n\tURL: http://rosettacode.org/wiki/Towers_of_Hanoi\n]\n\nhanoi: func [\n\t{Begin moving the golden disks from one pole to the next.\n\t Note: when last disk moved, the world will end.}\n\tdisks [integer!] \"Number of discs on starting pole.\"\n\t/poles \"Name poles.\"\n\tfrom to via\n][\n if disks = 0 [return]\n\tif not poles [from: 'left to: 'middle via: 'right]\n\n hanoi/poles disks - 1 from via to\n\tprint [from \"->\" to]\n hanoi/poles disks - 1 via to from\n]\n\nhanoi 4\n","language":"REBOL"},{"code":"$ENTRY Go {\n = <Move 4 1 2 3>;\n};\n\nMove {\n 0 e.X = ;\n s.N s.Src s.Via s.Dest, <- s.N 1>: s.Next =\n <Move s.Next s.Src s.Dest s.Via>\n <Prout \"Move disk from pole\" s.Src \"to pole\" s.Dest>\n <Move s.Next s.Via s.Src s.Dest>;\n};\n","language":"Refal"},{"code":"[[User:Wodan58|Wodan58]] ([[User talk:Wodan58|talk]])\n{ 'Num 'From 'To 'Via } [ var ] a:for-each\n\n:set !Via !To !From !Num ;\n:display @To @From 'Move_a_ring_from_%n_to_%n\\n s:format s:put ;\n\n:hanoi (num,from,to,via-)\n set @Num n:-zero?\n [ @Num @From @To @Via\n @Num n:dec @From @Via @To hanoi set display\n @Num n:dec @Via @To @From hanoi ] if ;\n\n#3 #1 #3 #2 hanoi nl\n[[User:Wodan58|Wodan58]] ([[User talk:Wodan58|talk]])\n","language":"Retro"},{"code":"/*REXX program displays the moves to solve the Tower of Hanoi (with N disks). */\nparse arg N . /*get optional number of disks from CL.*/\nif N=='' | N==\",\" then N=3 /*Not specified? Then use the default.*/\n#= 0 /*#: the number of disk moves (so far)*/\nz= 2**N - 1 /*Z: \" \" \" minimum # of moves.*/\ncall mov 1, 3, N /*move the top disk, then recurse ··· */\nsay /* [↓] Display the minimum # of moves.*/\nsay 'The minimum number of moves to solve a ' N\"─disk Tower of Hanoi is \" z\nexit /*stick a fork in it, we're all done. */\n/*──────────────────────────────────────────────────────────────────────────────────────*/\nmov: procedure expose # z; parse arg @1,@2,@3; L= length(z)\n if @3==1 then do; #= # + 1 /*bump the (disk) move counter by one. */\n say 'step' right(#, L)\": move disk on tower\" @1 '───►' @2\n end\n else do; call mov @1, 6 -@1 -@2, @3 -1\n call mov @1, @2, 1\n call mov 6 - @1 - @2, @2, @3 -1\n end\n return /* [↑] this subroutine uses recursion.*/\n","language":"REXX"},{"code":"/*REXX program displays the moves to solve the Tower of Hanoi (with N disks). */\nparse arg N . /*get optional number of disks from CL.*/\nif N=='' | N==\",\" then N=3 /*Not specified? Then use the default.*/\nsw= 80; wp= sw%3 - 1; blanks= left('', wp) /*define some default REXX variables. */\nc.1= sw % 3 % 2 /* [↑] SW: assume default Screen Width*/\nc.2= sw % 2 - 1 /* ◄─── C.1 C.2 C.2 are the positions*/\nc.3= sw - 2 - c.1 /* of the 3 columns.*/\n#= 0; z= 2**N - 1; moveK= z /*#moves; min# of moves; where to move.*/\n@abc= 'abcdefghijklmnopqrstuvwxyN' /*dithering chars when many disks used.*/\nebcdic= ('f2'x==2) /*determine if EBCDIC or ASCII machine.*/\n\nif ebcdic then do; bar= 'bf'x; ar= \"df\"x; dither= 'db9f9caf'x; down= \"9a\"x\n tr= 'bc'x; bl= \"ab\"x; br= 'bb'x; vert= \"fa\"x; tl= 'ac'x\n end\n else do; bar= 'c4'x; ar= \"10\"x; dither= 'b0b1b2db'x; down= \"19\"x\n tr= 'bf'x; bl= \"c0\"x; br= 'd9'x; vert= \"b3\"x; tl= 'da'x\n end\n\nverts= vert || vert; Tcorners= tl || tr; box = left(dither, 1)\ndowns= down || down; Bcorners= bl || br; boxChars= dither || @abc\n$.= 0; $.1= N; k= N; kk= k + k\n\n do j=1 for N; @.3.j= blanks; @.2.j= blanks; @.1.j= center( copies(box, kk), wp)\n if N<=length(boxChars) then @.1.j= translate( @.1.j, , substr( boxChars, kk%2, 1), box)\n kk= kk - 2\n end /*j*/ /*populate the tower of Hanoi spindles.*/\n\ncall showTowers; call mov 1,3,N; say\nsay 'The minimum number of moves to solve a ' N\"-disk Tower of Hanoi is \" z\nexit /*stick a fork in it, we're all done. */\n/*──────────────────────────────────────────────────────────────────────────────────────*/\ndsk: parse arg from dest; #= # + 1; pp=\n if from==1 then do; pp= overlay(bl, pp, c.1)\n pp= overlay(bar, pp, c.1+1, c.dest-c.1-1, bar) || tr\n end\n if from==2 then do\n if dest==1 then do; pp= overlay(tl, pp, c.1)\n pp= overlay(bar, pp, c.1+1, c.2-c.1-1,bar)||br\n end\n if dest==3 then do; pp= overlay(bl, pp, c.2)\n pp= overlay(bar, pp, c.2+1, c.3-c.2-1,bar)||tr\n end\n end\n if from==3 then do; pp= overlay(br, pp, c.3)\n pp= overlay(bar, pp, c.dest+1, c.3-c.dest-1, bar)\n pp= overlay(tl, pp, c.dest)\n end\n say translate(pp, downs, Bcorners || Tcorners || bar); say overlay(moveK, pp, 1)\n say translate(pp, verts, Tcorners || Bcorners || bar)\n say translate(pp, downs, Tcorners || Bcorners || bar); moveK= moveK - 1\n $.from= $.from - 1; $.dest= $.dest + 1; _f= $.from + 1; _t= $.dest\n @.dest._t= @.from._f; @.from._f= blanks; call showTowers\n return\n/*──────────────────────────────────────────────────────────────────────────────────────*/\nmov: if arg(3)==1 then call dsk arg(1) arg(2)\n else do; call mov arg(1), 6 -arg(1) -arg(2), arg(3) -1\n call mov arg(1), arg(2), 1\n call mov 6 -arg(1) -arg(2), arg(2), arg(3) -1\n end /* [↑] The MOV subroutine is recursive, */\n return /*it uses no variables, is uses BIFs instead*/\n/*──────────────────────────────────────────────────────────────────────────────────────*/\nshowTowers: do j=N by -1 for N; _=@.1.j @.2.j @.3.j; if _\\='' then say _; end; return\n","language":"REXX"},{"code":"move(4, 1, 2, 3)\n\nfunc move n, src, dst, via\n if n > 0 move(n - 1, src, via, dst)\n see \"\" + src + \" to \" + dst + nl\n move(n - 1, via, dst, src) ok\n","language":"Ring"},{"code":"def move(num_disks, start=0, target=1, using=2)\n if num_disks == 1\n @towers[target] << @towers[start].pop\n puts \"Move disk from #{start} to #{target} : #{@towers}\"\n else\n move(num_disks-1, start, using, target)\n move(1, start, target, using)\n move(num_disks-1, using, target, start)\n end\nend\n\nn = 5\n@towers = [[*1..n].reverse, [], []]\nmove(n)\n","language":"Ruby"},{"code":"# solve(source, via, target)\n# Example:\n# solve([5, 4, 3, 2, 1], [], [])\n# Note this will also solve randomly placed disks,\n# \"place all disk in target with legal moves only\".\ndef solve(*towers)\n # total number of disks\n disks = towers.inject(0){|sum, tower| sum+tower.length}\n x=0 # sequence number\n p towers # initial trace\n # have we solved the puzzle yet?\n while towers.last.length < disks do\n x+=1 # assume the next step\n from = (x&x-1)%3\n to = ((x|(x-1))+1)%3\n # can we actually take from tower?\n if top = towers[from].last\n bottom = towers[to].last\n # is the move legal?\n if !bottom || bottom > top\n # ok, do it!\n towers[to].push(towers[from].pop)\n p towers # trace\n end\n end\n end\nend\n\nsolve([5, 4, 3, 2, 1], [], [])\n","language":"Ruby"},{"code":"a = move(4, \"1\", \"2\", \"3\")\nfunction move(n, a$, b$, c$)\nif n > 0 then\n\ta = move(n-1, a$, c$, b$)\n\tprint \"Move disk from \" ; a$ ; \" to \" ; c$\n\ta = move(n-1, b$, a$, c$)\nend if\nend function\n","language":"Run-BASIC"},{"code":"fn move_(n: i32, from: i32, to: i32, via: i32) {\n if n > 0 {\n move_(n - 1, from, via, to);\n println!(\"Move disk from pole {} to pole {}\", from, to);\n move_(n - 1, via, to, from);\n }\n}\n\nfn main() {\n move_(4, 1,2,3);\n}\n","language":"Rust"},{"code":"hanoi 8 ‘abc\"\nWHERE\nhanoi 0 (a,b,c,) = ()\nhanoi n ( a,b,c) = hanoi (n-1) (a,c,b) ,\n ‘move a disc from \" , a , ‘ to \" , b , NL ,\n hanoi (n-1) (c,b,a)\n?\n","language":"SASL"},{"code":"class MAIN is\n\n move(ndisks, from, to, via:INT) is\n if ndisks = 1 then\n #OUT + \"Move disk from pole \" + from + \" to pole \" + to + \"\\n\";\n else\n move(ndisks-1, from, via, to);\n move(1, from, to, via);\n move(ndisks-1, via, to, from);\n end;\n end;\n\n main is\n move(4, 1, 2, 3);\n end;\nend;\n","language":"Sather"},{"code":"def move(n: Int, from: Int, to: Int, via: Int) : Unit = {\n if (n == 1) {\n Console.println(\"Move disk from pole \" + from + \" to pole \" + to)\n } else {\n move(n - 1, from, via, to)\n move(1, from, to, via)\n move(n - 1, via, to, from)\n }\n }\n","language":"Scala"},{"code":"object TowersOfHanoi {\n import scala.reflect.Manifest\n\n def simpleName(m:Manifest[_]):String = {\n val name = m.toString\n name.substring(name.lastIndexOf('$')+1)\n }\n\n trait Nat\n final class _0 extends Nat\n final class Succ[Pre<:Nat] extends Nat\n\n type _1 = Succ[_0]\n type _2 = Succ[_1]\n type _3 = Succ[_2]\n type _4 = Succ[_3]\n\n case class Move[N<:Nat,A,B,C]()\n\n implicit def move0[A,B,C](implicit a:Manifest[A],b:Manifest[B]):Move[_0,A,B,C] = {\n System.out.println(\"Move from \"+simpleName(a)+\" to \"+simpleName(b));null\n }\n\n implicit def moveN[P<:Nat,A,B,C](implicit m1:Move[P,A,C,B],m2:Move[_0,A,B,C],m3:Move[P,C,B,A])\n :Move[Succ[P],A,B,C] = null\n\n def run[N<:Nat,A,B,C](implicit m:Move[N,A,B,C]) = null\n\n case class Left()\n case class Center()\n case class Right()\n\n def main(args:Array[String]){\n run[_2,Left,Right,Center]\n }\n}\n","language":"Scala"},{"code":"(define (towers-of-hanoi n from to spare)\n (define (print-move from to)\n (display \"Move[\")\n (display from)\n (display \", \")\n (display to)\n (display \"]\")\n (newline))\n (cond ((= n 0) \"done\")\n (else\n (towers-of-hanoi (- n 1) from spare to)\n (print-move from to)\n (towers-of-hanoi (- n 1) spare to from))))\n\n(towers-of-hanoi 3 \"A\" \"B\" \"C\")\n","language":"Scheme"},{"code":"const proc: hanoi (in integer: disk, in string: source, in string: dest, in string: via) is func\n begin\n if disk > 0 then\n hanoi(pred(disk), source, via, dest);\n writeln(\"Move disk \" <& disk <& \" from \" <& source <& \" to \" <& dest);\n hanoi(pred(disk), via, dest, source);\n end if;\n end func;\n","language":"Seed7"},{"code":"program hanoi;\n loop for [src, dest] in move(4, 1, 2, 3) do\n print(\"Move disk from pole \" + src + \" to pole \" + dest);\n end loop;\n\n proc move(n, src, via, dest);\n if n=0 then return []; end if;\n return move(n-1, src, dest, via)\n + [[src, dest]]\n + move(n-1, via, src, dest);\n end proc;\nend program;\n","language":"SETL"},{"code":"func hanoi(n, from=1, to=2, via=3) {\n if (n == 1) {\n say \"Move disk from pole #{from} to pole #{to}.\";\n } else {\n hanoi(n-1, from, via, to);\n hanoi( 1, from, to, via);\n hanoi(n-1, via, to, from);\n }\n}\n\nhanoi(4);\n","language":"Sidef"},{"code":"* # Note: count is global\n\n define('hanoi(n,src,trg,tmp)') :(hanoi_end)\nhanoi hanoi = eq(n,0) 1 :s(return)\n hanoi(n - 1, src, tmp, trg)\n count = count + 1\n output = count ': Move disc from ' src ' to ' trg\n hanoi(n - 1, tmp, trg, src) :(return)\nhanoi_end\n\n* # Test with 4 discs\n hanoi(4,'A','C','B')\nend\n","language":"SNOBOL4"},{"code":"#!/usr/local/bin/spar\npragma annotate( summary, \"hanoi\" )\n @( description, \"Solve the Towers of Hanoi problem with recursion.\" )\n @( see_also, \"https://rosettacode.org/wiki/Towers_of_Hanoi\" )\n @( author, \"Ken O. Burtch\" );\npragma license( unrestricted );\n\npragma restriction( no_external_commands );\n\nprocedure hanoi is\n type pegs is (left, center, right);\n\n -- Determine the moves\n\n procedure solve( num_disks : natural; start_peg : pegs; end_peg : pegs; via_peg : pegs ) is\n begin\n if num_disks > 0 then\n solve( num_disks - 1, start_peg, via_peg, end_peg );\n put( \"Move disk\" )@( num_disks )@( \" from \" )@( start_peg )@( \" to \" )@( end_peg );\n new_line;\n solve( num_disks - 1, via_peg, end_peg, start_peg );\n end if;\n end solve;\n\nbegin\n -- solve with 4 disks at the left\n --solve( 4, left, right, center );\n solve( 4, left, right, center );\n put_line( \"Towers of Hanoi puzzle completed\" );\nend hanoi;\n","language":"SparForte"},{"code":"function hanoi(n, a, b, c) {\n\tif (n>0) {\n\t\thanoi(n-1, a, c, b)\n\t\tprintf(\"Move from %f to %f\\n\", a, b)\n\t\thanoi(n-1, c, b, a)\n\t}\n}\n\nhanoi(3, 1, 2, 3)\n\nMove from 1 to 2\nMove from 1 to 3\nMove from 2 to 3\nMove from 1 to 2\nMove from 3 to 1\nMove from 3 to 2\nMove from 1 to 2\n","language":"Stata"},{"code":"func hanoi(n:Int, a:String, b:String, c:String) {\n if (n > 0) {\n hanoi(n - 1, a, c, b)\n println(\"Move disk from \\(a) to \\(c)\")\n hanoi(n - 1, b, a, c)\n }\n}\n\nhanoi(4, \"A\", \"B\", \"C\")\n","language":"Swift"},{"code":"func hanoi(n:Int, a:String, b:String, c:String) {\n if (n > 0) {\n hanoi(n - 1, a: a, b: c, c: b)\n print(\"Move disk from \\(a) to \\(c)\")\n hanoi(n - 1, a: b, b: a, c: c)\n }\n}\n\nhanoi(4, a:\"A\", b:\"B\", c:\"C\")\n","language":"Swift"},{"code":"interp alias {} hanoi {} do_hanoi 0\n\nproc do_hanoi {count n {from A} {to C} {via B}} {\n if {$n == 1} {\n interp alias {} hanoi {} do_hanoi [incr count]\n puts \"$count: move from $from to $to\"\n } else {\n incr n -1\n hanoi $n $from $via $to\n hanoi 1 $from $to $via\n hanoi $n $via $to $from\n }\n}\n\nhanoi 4\n","language":"Tcl"},{"code":"PROGRAM:TOHSOLVE\n0→A\n1→B\n0→C\n0→D\n0→M\n1→R\nWhile A<1 or A>7\nInput \"No. of rings=?\",A\nEnd\nrandM(A+1,3)→[C]\n[[1,2][1,3][2,3]]→[E]\n\nFill(0,[C])\nFor(I,1,A,1)\nI?[C](I,1)\nEnd\nClrHome\nWhile [C](1,3)≠1 and [C](1,2)≠1\n\nFor(J,1,3)\nFor(I,1,A)\nIf [C](I,J)≠0:Then\nOutput(I+1,3J,[C](I,J))\nEnd\nEnd\nEnd\nWhile C=0\nOutput(1,3B,\" \")\n1→I\n[E](R,2)→J\nWhile [C](I,J)=0 and I≤A\nI+1→I\nEnd\n[C](I,J)→D\n1→I\n[E](R,1)→J\nWhile [C](I,J)=0 and I≤A\nI+1→I\nEnd\nIf (D<[C](I,J) and D≠0) or [C](I,J)=0:Then\n[E](R,2)→B\nElse\n[E](R,1)→B\nEnd\n\n1→I\nWhile [C](I,B)=0 and I≤A\nI+1→I\nEnd\nIf I≤A:Then\n[C](I,B)→C\n0→[C](I,B)\nOutput(I+1,3B,\" \")\nEnd\nOutput(1,3B,\"V\")\nEnd\n\nWhile C≠0\nOutput(1,3B,\" \")\nIf B=[E](R,2):Then\n[E](R,1)→B\nElse\n[E](R,2)→B\nEnd\n\n1→I\nWhile [C](I,B)=0 and I≤A\nI+1→I\nEnd\nIf [C](I,B)=0 or [C](I,B)>C:Then\nC→[C](I-1,B)\n0→C\nM+1→M\nEnd\nEnd\nOutput(1,3B,\"V\")\nR+1→R\nIf R=4:Then:1→R:End\n\nEnd\n","language":"TI-83-BASIC"},{"code":" 5 PRINT \"How many disks?\"\n INPUT D\n IF D < 1 THEN GOTO 5\n IF D > 10 THEN GOTO 5\n LET N = 1\n10 IF D = 0 THEN GOTO 20\n LET D = D - 1\n LET N = 2*N\n GOTO 10\n20 LET X = 0\n30 LET X = X + 1\n IF X = N THEN END\n GOSUB 40\n LET S = S - 3*(S/3)\n GOSUB 50\n LET T = T + 1\n LET T = T - 3*(T/3)\n PRINT \"Move disc on peg \",S+1,\" to peg \",T+1\n GOTO 30\n40 LET B = X - 1\n LET A = X\n LET S = 0\n LET Z = 2048\n45 LET C = 0\n IF B >= Z THEN LET C = 1\n IF A >= Z THEN LET C = C + 1\n IF C = 2 THEN LET S = S + Z\n IF A >= Z THEN LET A = A - Z\n IF B >= Z THEN LET B = B - Z\n LET Z = Z / 2\n IF Z = 0 THEN RETURN\n GOTO 45\n50 LET B = X - 1\n LET A = X\n LET T = 0\n LET Z = 2048\n55 LET C = 0\n IF B >= Z THEN LET C = 1\n IF A >= Z THEN LET C = C + 1\n IF C > 0 THEN LET T = T + Z\n IF A >= Z THEN LET A = A - Z\n IF B >= Z THEN LET B = B - Z\n LET Z = Z / 2\n IF Z = 0 THEN RETURN\n GOTO 55\n","language":"Tiny-BASIC"},{"code":"value| sa sb sc n |\n[ to sc to sb to sa to n ] is vars!\n[ ( num from to via -- )\n vars!\n n 0 <>\n [\n n sa sb sc\n n 1- sa sc sb recurse\n vars!\n .\" Move a ring from \" sa . .\" to \" sb . cr\n n 1- sc sb sa recurse\n ] ifTrue\n] is hanoi\n","language":"Toka"},{"code":"DECLARE SUB hanoi\n\nSUB hanoi(n, desde , hasta, via)\n IF n > 0 THEN\n CALL hanoi(n - 1, desde, via, hasta)\n PRINT \"Mover disco\"; n; \"desde posición\"; desde; \"hasta posición\"; hasta\n CALL hanoi(n - 1, via, hasta, desde)\n END IF\nEND SUB\n\nPRINT \"Tres discos\"\nPRINT\nCALL hanoi(3, 1, 2, 3)\nPRINT\nPRINT \"Cuatro discos\"\nPRINT\nCALL hanoi(4, 1, 2, 3)\nPRINT\nPRINT \"Pulsa un tecla para salir\"\nEND\n","language":"True-BASIC"},{"code":"// library: program: run: towersofhanoi: recursive: sub <description></description> <version>1.0.0.0.0</version> <version control></version control> (filenamemacro=runprrsu.s) [kn, ri, tu, 07-02-2012 19:54:23]\nPROC PROCProgramRunTowersofhanoiRecursiveSub( INTEGER totalDiskI, STRING fromS, STRING toS, STRING viaS, INTEGER bufferI )\n IF ( totalDiskI == 0 )\n RETURN()\n ENDIF\n PROCProgramRunTowersofhanoiRecursiveSub( totalDiskI - 1, fromS, viaS, toS, bufferI )\n AddLine( Format( \"Move disk\", \" \", totalDiskI, \" \", \"from peg\", \" \", \"'\", fromS, \"'\", \" \", \"to peg\", \" \", \"'\", toS, \"'\" ), bufferI )\n PROCProgramRunTowersofhanoiRecursiveSub( totalDiskI - 1, viaS, toS, fromS, bufferI )\nEND\n\n// library: program: run: towersofhanoi: recursive <description></description> <version>1.0.0.0.6</version> <version control></version control> (filenamemacro=runprtre.s) [kn, ri, tu, 07-02-2012 19:40:45]\nPROC PROCProgramRunTowersofhanoiRecursive( INTEGER totalDiskI, STRING fromS, STRING toS, STRING viaS )\n INTEGER bufferI = 0\n PushPosition()\n bufferI = CreateTempBuffer()\n PopPosition()\n PROCProgramRunTowersofhanoiRecursiveSub( totalDiskI, fromS, toS, viaS, bufferI )\n GotoBufferId( bufferI )\nEND\n\nPROC Main()\nSTRING s1[255] = \"4\"\nIF ( NOT ( Ask( \"program: run: towersofhanoi: recursive: totalDiskI = \", s1, _EDIT_HISTORY_ ) ) AND ( Length( s1 ) > 0 ) ) RETURN() ENDIF\n PROCProgramRunTowersofhanoiRecursive( Val( s1 ), \"source\", \"target\", \"via\" )\nEND\n","language":"TSE-SAL"},{"code":"F ← |1.0 (\n ⟨\n &p ⊏[1 2] &pf \"Move disc [from to]: \"\n | F⍜(⊡0|-1)⍜(⊏[2 3]|⇌).\n F⍜(⊡0|1◌).\n F⍜(⊡0|-1)⍜(⊏[1 3]|⇌)\n ⟩≠1⊢.\n)\nF [4 1 2 3]\n","language":"Uiua"},{"code":"function move {\n typeset -i n=$1\n typeset from=$2\n typeset to=$3\n typeset via=$4\n\n if (( n )); then\n move $(( n - 1 )) \"$from\" \"$via\" \"$to\"\n echo \"Move disk from pole $from to pole $to\"\n move $(( n - 1 )) \"$via\" \"$to\" \"$from\"\n fi\n}\n\nmove \"$@\"\n","language":"UNIX-Shell"},{"code":"#!/bin/sh\nif [ \"$1\" -gt 0 ]; then\n \"$0\" \"`expr $1 - 1`\" \"$2\" \"$4\" \"$3\"\n echo \"Move disk from pole $2 to pole $3\"\n \"$0\" \"`expr $1 - 1`\" \"$4\" \"$3\" \"$2\"\nfi\n","language":"UNIX-Shell"},{"code":"#import nat\n\nmove = ~&al^& ^rlPlrrPCT/~&arhthPX ^|W/~& ^|G/predecessor ^/~&htxPC ~&zyxPC\n\n#show+\n\nmain = ^|T(~&,' -> '--)* move/4 <'start','end','middle'>\n","language":"Ursala"},{"code":"|10 @Console &vector $2 &read $1 &pad $4 &type $1 &write $1 &error $1\n\n|0100 ( -> )\n #0102 [ LIT2 03 &count 04 ] hanoi\n POP2 POP2 BRK\n\n@hanoi ( from spare to count -: from spare to count )\n ( moving 0 disks is no-op )\n DUP ?{ JMP2r }\n\n ( move disks 1..count-1 to the spare peg )\n #01 SUB ROT SWP hanoi\n ( from to spare count-1 )\n\n ( print the current move )\n ;dict/move print-str\n INCk #30 ORA .Console/write DEO\n STH2\n ;dict/from print-str\n OVR #30 ORA .Console/write DEO\n ;dict/to print-str\n DUP #30 ORA .Console/write DEO\n [ LIT2 0a -Console/write ] DEO\n STH2r\n\n ( move disks 1..count-1 from the spare peg to the goal peg )\n STH ROT ROT STHr hanoi\n\n ( restore original parameters for convenient recursion )\n STH2 SWP STH2r INC\n\n JMP2r\n\n@print-str\n &loop\n LDAk .Console/write DEO\n INC2 LDAk ?&loop\n POP2 JMP2r\n\n@dict\n &move \"Move 20 \"disk 2000\n &from 20 \"from 20 \"pole 2000\n &to 20 \"to 20 \"pole 2000\n","language":"Uxntal"},{"code":"fn main() {\n\thanoi(4, \"A\", \"B\", \"C\")\n}\n\nfn hanoi(n u64, a string, b string, c string) {\n if n > 0 {\n hanoi(n - 1, a, c, b)\n println(\"Move disk from ${a} to ${c}\")\n hanoi(n - 1, b, a, c)\n }\n}\n","language":"V-(Vlang)"},{"code":"Sub Move(n,fromPeg,toPeg,viaPeg)\n\tIf n > 0 Then\n\t\tMove n-1, fromPeg, viaPeg, toPeg\n\t\tWScript.StdOut.Write \"Move disk from \" & fromPeg & \" to \" & toPeg\n\t\tWScript.StdOut.WriteBlankLines(1)\n\t\tMove n-1, viaPeg, toPeg, fromPeg\n\tEnd If\nEnd Sub\n\nMove 4,1,2,3\nWScript.StdOut.Write(\"Towers of Hanoi puzzle completed!\")\n","language":"VBScript"},{"code":"#1=1; #2=2; #3=3; #4=4 // move 4 disks from 1 to 2\nCall(\"MOVE_DISKS\")\nReturn\n\n// Move disks\n// #1 = from, #2 = to, #3 = via, #4 = number of disks\n//\n:MOVE_DISKS:\nif (#4 > 0) {\n Num_Push(1,4)\n #9=#2; #2=#3; #3=#9; #4-- // #1 to #3 via #2\n Call(\"MOVE_DISKS\")\n Num_Pop(1,4)\n\n Ins_Text(\"Move a disk from \") // move one disk\n Num_Ins(#1, LEFT+NOCR)\n Ins_Text(\" to \")\n Num_Ins(#2, LEFT)\n\n Num_Push(1,4)\n #9=#1; #1=#3; #3 = #9; #4-- // #3 to #2 via #1\n Call(\"MOVE_DISKS\")\n Num_Pop(1,4)\n}\nReturn\n","language":"Vedit-macro-language"},{"code":"function TowersOfHanoi(n, from, to, via)\n if (a:n > 1)\n call TowersOfHanoi(a:n-1, a:from, a:via, a:to)\n endif\n echom(\"Move a disc from \" . a:from . \" to \" . a:to)\n if (a:n > 1)\n call TowersOfHanoi(a:n-1, a:via, a:to, a:from)\n endif\nendfunction\n\ncall TowersOfHanoi(4, 1, 3, 2)\n","language":"Vim-Script"},{"code":"Module TowersOfHanoi\n Sub MoveTowerDisks(ByVal disks As Integer, ByVal fromTower As Integer, ByVal toTower As Integer, ByVal viaTower As Integer)\n If disks > 0 Then\n MoveTowerDisks(disks - 1, fromTower, viaTower, toTower)\n System.Console.WriteLine(\"Move disk {0} from {1} to {2}\", disks, fromTower, toTower)\n MoveTowerDisks(disks - 1, viaTower, toTower, fromTower)\n End If\n End Sub\n\n Sub Main()\n MoveTowerDisks(4, 1, 2, 3)\n End Sub\nEnd Module\n","language":"Visual-Basic-.NET"},{"code":"1000 N=4\n1010 F=1\n1020 T=2\n1030 V=3\n1040 S=0\n1050 #=2000\n1060 #=9999\n2000 R=!\n2010 #=N<1*2210\n2020 #=4000\n2030 N=N-1\n2040 A=T\n2050 T=V\n2060 V=A\n2070 #=2000\n2080 #=5000\n2090 ?=\"Move disk from peg: \";\n2100 ?=F\n2110 ?=\" to peg: \";\n2120 ?=T\n2130 ?=\"\"\n2140 #=4000\n2150 N=N-1\n2160 A=F\n2170 F=V\n2180 V=A\n2190 #=2000\n2200 #=5000\n2210 #=R\n4000 S=S+1\n4010 :S)=R\n4020 S=S+1\n4030 :S)=N\n4040 S=S+1\n4050 :S)=F\n4060 S=S+1\n4070 :S)=V\n4080 S=S+1\n4090 :S)=T\n4100 #=!\n5000 T=:S)\n5010 S=S-1\n5020 V=:S)\n5030 S=S-1\n5040 F=:S)\n5050 S=S-1\n5060 N=:S)\n5070 S=S-1\n5080 R=:S)\n5090 S=S-1\n5100 #=!\n","language":"VTL-2"},{"code":"class Hanoi {\n construct new(disks) {\n _moves = 0\n System.print(\"Towers of Hanoi with %(disks) disks:\\n\")\n move(disks, \"L\", \"C\", \"R\")\n System.print(\"\\nCompleted in %(_moves) moves\\n\")\n }\n\n move(n, from, to, via) {\n if (n > 0) {\n move(n - 1, from, via, to)\n _moves = _moves + 1\n System.print(\"Move disk %(n) from %(from) to %(to)\")\n move(n - 1, via, to, from)\n }\n }\n}\n\nHanoi.new(3)\nHanoi.new(4)\n","language":"Wren"},{"code":"PROGRAM\t\"Hanoi\"\nVERSION\t\"0.0000\"\n\nDECLARE FUNCTION Entry ()\nDECLARE FUNCTION Hanoi(n, desde , hasta, via)\n\nFUNCTION Entry ()\n\tPRINT \"Three disks\\n\"\n\tHanoi (3, 1, 2, 3)\n\tPRINT \"\\nFour discks\\n\"\n\tHanoi (4, 1, 2, 3)\n\tPRINT \"\\nTowers of Hanoi puzzle completed!\"\nEND FUNCTION\n\nFUNCTION Hanoi (n, desde , hasta, via)\n IF n > 0 THEN\n Hanoi (n - 1, desde, via, hasta)\n PRINT \"Move disk\"; n; \" from pole\"; desde; \" to pole\"; hasta\n Hanoi (n - 1, via, hasta, desde)\n END IF\nEND FUNCTION\nEND PROGRAM\n","language":"XBasic"},{"code":"code Text=12;\n\nproc MoveTower(Discs, From, To, Using);\nint Discs, From, To, Using;\n[if Discs > 0 then\n [MoveTower(Discs-1, From, Using, To);\n Text(0, \"Move from \"); Text(0, From);\n Text(0, \" peg to \"); Text(0, To); Text(0, \" peg.^M^J\");\n MoveTower(Discs-1, Using, To, From);\n ];\n];\n\nMoveTower(3, \"left\", \"right\", \"center\")\n","language":"XPL0"},{"code":"declare function local:hanoi($disk as xs:integer, $from as xs:integer,\n $to as xs:integer, $via as xs:integer) as element()*\n{\n if($disk > 0)\n then (\n local:hanoi($disk - 1, $from, $via, $to),\n <move disk='{$disk}'><from>{$from}</from><to>{$to}</to></move>,\n local:hanoi($disk - 1, $via, $to, $from)\n )\n else ()\n};\n\n<hanoi>\n{\n local:hanoi(4, 1, 2, 3)\n}\n</hanoi>\n","language":"XQuery"},{"code":"<?xml version=\"1.0\" encoding=\"UTF-8\"?>\n<hanoi>\n <move disk=\"1\">\n <from>1</from>\n <to>3</to>\n </move>\n <move disk=\"2\">\n <from>1</from>\n <to>2</to>\n </move>\n <move disk=\"1\">\n <from>3</from>\n <to>2</to>\n </move>\n <move disk=\"3\">\n <from>1</from>\n <to>3</to>\n </move>\n <move disk=\"1\">\n <from>2</from>\n <to>1</to>\n </move>\n <move disk=\"2\">\n <from>2</from>\n <to>3</to>\n </move>\n <move disk=\"1\">\n <from>1</from>\n <to>3</to>\n </move>\n <move disk=\"4\">\n <from>1</from>\n <to>2</to>\n </move>\n <move disk=\"1\">\n <from>3</from>\n <to>2</to>\n </move>\n <move disk=\"2\">\n <from>3</from>\n <to>1</to>\n </move>\n <move disk=\"1\">\n <from>2</from>\n <to>1</to>\n </move>\n <move disk=\"3\">\n <from>3</from>\n <to>2</to>\n </move>\n <move disk=\"1\">\n <from>1</from>\n <to>3</to>\n </move>\n <move disk=\"2\">\n <from>1</from>\n <to>2</to>\n </move>\n <move disk=\"1\">\n <from>3</from>\n <to>2</to>\n </move>\n</hanoi>\n","language":"XQuery"},{"code":"<xsl:template name=\"hanoi\">\n<xsl:param name=\"n\"/>\n<xsl:param name=\"from\">left</xsl:param>\n<xsl:param name=\"to\">middle</xsl:param>\n<xsl:param name=\"via\">right</xsl:param>\n <xsl:if test=\"$n > 0\">\n <xsl:call-template name=\"hanoi\">\n <xsl:with-param name=\"n\" select=\"$n - 1\"/>\n <xsl:with-param name=\"from\" select=\"$from\"/>\n <xsl:with-param name=\"to\" select=\"$via\"/>\n <xsl:with-param name=\"via\" select=\"$to\"/>\n </xsl:call-template>\n <fo:block>\n <xsl:text>Move disk from </xsl:text>\n <xsl:value-of select=\"$from\"/>\n <xsl:text> to </xsl:text>\n <xsl:value-of select=\"$to\"/>\n </fo:block>\n <xsl:call-template name=\"hanoi\">\n <xsl:with-param name=\"n\" select=\"$n - 1\"/>\n <xsl:with-param name=\"from\" select=\"$via\"/>\n <xsl:with-param name=\"to\" select=\"$to\"/>\n <xsl:with-param name=\"via\" select=\"$from\"/>\n </xsl:call-template>\n </xsl:if>\n</xsl:template>\n","language":"XSLT"},{"code":"sub hanoi(ndisks, startPeg, endPeg)\n if ndisks then\n hanoi(ndisks-1, startPeg, 6-startPeg-endPeg)\n //print \"Move disk \", ndisks, \" from \", startPeg, \" to \", endPeg\n hanoi(ndisks-1, 6-startPeg-endPeg, endPeg)\n end if\nend sub\n\nprint \"Be patient, please.\\n\\n\"\nprint \"Hanoi 1 ellapsed ... \";\n\nt1 = peek(\"millisrunning\")\nhanoi(22, 1, 3)\nt2 = peek(\"millisrunning\")\nprint t2-t1, \" ms\"\n\n\nsub hanoi2(n, from, to_, via)\n if n = 1 then\n\t//print \"Move from \", from, \" to \", to_\n else\n\thanoi2(n - 1, from, via , to_ )\n \thanoi2(1 , from, to_ , via )\n \thanoi2(n - 1, via , to_ , from)\n end if\nend sub\n\nprint \"Hanoi 2 ellapsed ... \";\nhanoi2(22, 1, 3, 2)\nprint peek(\"millisrunning\") - t2, \" ms\"\n","language":"Yabasic"},{"code":"\t;\n\t; Towers of Hanoi using Z80 assembly language\n\t;\n\t; Runs under CP/M 3.1 on YAZE-AG-2.51.2 Z80 emulator\n\t; Assembled with zsm4 on same emulator/OS, uses macro capabilities of said assembler\n\t; Created with vim under Windows\n\t;\n\t; 2023-05-29 Xorph\n\t;\n\n\t;\n\t; Useful definitions\n\t;\n\n\tbdos\tequ 05h\t\t; Call to CP/M BDOS function\n\tstrdel\tequ 6eh\t\t; Set string delimiter\n\twrtstr\tequ 09h\t\t; Write string to console\n\n\tnul\tequ 00h\t\t; ASCII control characters\n\tcr\tequ 0dh\n\tlf\tequ 0ah\n\n\tcnull\tequ '0'\t\t; ASCII character constants\n\tca\tequ 'A'\n\tcb\tequ 'B'\n\tcc\tequ 'C'\n\n\tdisks\tequ 4\t\t; Number of disks to move\n\n\t;\n\t; Macros for BDOS calls\n\t;\n\nsetdel \tmacro\tchar\t\t; Set string delimiter to char\n\tld\tc,strdel\n\tld\te,char\n\tcall\tbdos\n\tendm\n\nprint \tmacro\tmsg\t\t; Output string to console\n\tld\tc,wrtstr\n\tld\tde,msg\n\tcall\tbdos\n\tendm\n\npushall\tmacro\t\t\t; Save required registers to stack\n\tpush\taf\n\tpush\tbc\n\tpush\tde\n\tendm\n\npopall\tmacro\t\t\t; Recall required registers from stack\n\tpop\tde\n\tpop\tbc\n\tpop\taf\n\tendm\n\n\t;\n\t; =====================\n\t; Start of main program\n\t; =====================\n\t;\n\n\tcseg\n\n\tsetdel\tnul\t\t; Set string delimiter to 00h\n\n\tld\ta,disks\t\t; Initialization:\n\tld\tb,ca\t\t; Tower A is source\n\tld\tc,cb\t\t; Tower B is target\n\tld\td,cc\t\t; Tower C is intermediate\n\nhanoi:\n\t;\n\t; Parameters in registers:\n\t; Move a disks from b (source) to c (target) via d (intermediate)\n\t;\n\n\tor\ta\t\t; If 0 disks to move, return\n\tret\tz\n\n\tdec\ta\t\t; Move all but lowest disk from source to intermediate via target\n\tpushall\t\t\t; Save registers\n\tld\te,c\t\t; Exchange c and d (target and intermediate)\n\tld\tc,d\n\tld\td,e\n\tcall\thanoi\t\t; First recursion\n\tpopall\t\t\t; Restore registers\n\n\tld\thl,source\t; Print move of lowest disk from source to target, save registers during BDOS call\n\tld\t(hl),b\t\t; Source is still in b\n\tld\thl,target\n\tld\t(hl),c\t\t; Target is back in c due to popall\n\n\tpushall\n\tprint\tmovement\n\tpopall\n\n\tld\te,b\t\t; Now move stack from intermediate to target via source\n\tld\tb,d\t\t; Source is still in b, target in c and intermediate in d\n\tld\td,e\n\tjr\thanoi\t\t; Optimize tail recursion\n\n\t;\n\t; ================\n\t; Data definitions\n\t; ================\n\t;\n\n\tdseg\n\nmovement:\n\tdefb\t'Move disk from tower '\nsource:\n\tdefs\t1\n\tdefb\t' to tower '\ntarget:\n\tdefs\t1\ncrlf:\n\tdefb\tcr,lf,nul\n","language":"Z80-Assembly"},{"code":"const std = @import(\"std\");\n\npub fn print(from: u32, to: u32) void {\n std.log.info(\"Moving disk from rod {} to rod {}\", .{ from, to });\n}\n\npub fn move(n: u32, from: u32, via: u32, to: u32) void {\n if (n > 1) {\n move(n - 1, from, to, via);\n print(from, to);\n move(n - 1, via, from, to);\n } else {\n print(from, to);\n }\n}\n\npub fn main() !void {\n move(4, 1, 2, 3);\n}\n","language":"Zig"},{"code":"fcn move(n, from,to,via){\n if (n>0){\n move(n-1, from,via,to);\n println(\"Move disk from pole %d to pole %d\".fmt(from, to));\n move(n-1, via,to,from);\n }\n}\nmove(3, 1,2,3);\n","language":"Zkl"}],"string":"[\n {\n \"code\": \"---\\ncategory:\\n- Recursion\\n- Games\\nfrom: http://rosettacode.org/wiki/Towers_of_Hanoi\\nnote: Classic CS problems and programs\\n\",\n \"language\": \"00-META\"\n },\n {\n \"code\": \";Task:\\nSolve the [[wp:Towers_of_Hanoi|Towers of Hanoi]] problem with recursion.\\n<br><br>\\n\\n\",\n \"language\": \"00-TASK\"\n },\n {\n \"code\": \"F hanoi(ndisks, startPeg = 1, endPeg = 3) -> N\\n I ndisks\\n hanoi(ndisks - 1, startPeg, 6 - startPeg - endPeg)\\n print(‘Move disk #. from peg #. to peg #.’.format(ndisks, startPeg, endPeg))\\n hanoi(ndisks - 1, 6 - startPeg - endPeg, endPeg)\\n\\nhanoi(ndisks' 3)\\n\",\n \"language\": \"11l\"\n },\n {\n \"code\": \"* Towers of Hanoi 08/09/2015\\nHANOITOW CSECT\\n USING HANOITOW,R12 r12 : base register\\n LR R12,R15 establish base register\\n ST R14,SAVE14 save r14\\nBEGIN LH R2,=H'4' n <===\\n L R3,=C'123 ' stating position\\n BAL R14,MOVE r1=move(m,n)\\nRETURN L R14,SAVE14 restore r14\\n BR R14 return to caller\\nSAVE14 DS F static save r14\\nPG DC CL44'xxxxxxxxxxxx Move disc from pole X to pole Y'\\nNN DC F'0'\\nPOLEX DS F current poles\\nPOLEN DS F new poles\\n* .... recursive subroutine move(n, poles) [r2,r3]\\nMOVE LR R10,R11 save stackptr (r11) in r10 temp\\n LA R1,STACKLEN amount of storage required\\n GETMAIN RU,LV=(R1) allocate storage for stack\\n USING STACKDS,R11 make storage addressable\\n LR R11,R1 establish stack addressability\\n ST R14,SAVE14M save previous r14\\n ST R10,SAVE11M save previous r11\\n LR R1,R5 restore saved argument r5\\nBEGINM STM R2,R3,STACK push arguments to stack\\n ST R3,POLEX\\n CH R2,=H'1' if n<>1\\n BNE RECURSE then goto recurse\\n L R1,NN\\n LA R1,1(R1) nn=nn+1\\n ST R1,NN\\n XDECO R1,PG nn\\n MVC PG+33(1),POLEX+0 from\\n MVC PG+43(1),POLEX+1 to\\n XPRNT PG,44 print \\\"move disk from to\\\"\\n B RETURNM\\nRECURSE L R2,N n\\n BCTR R2,0 n=n-1\\n MVC POLEN+0(1),POLES+0 from\\n MVC POLEN+1(1),POLES+2 via\\n MVC POLEN+2(1),POLES+1 to\\n L R3,POLEN new poles\\n BAL R14,MOVE call move(n-1,from,via,to)\\n LA R2,1 n=1\\n MVC POLEN,POLES\\n L R3,POLEN new poles\\n BAL R14,MOVE call move(1,from,to,via)\\n L R2,N n\\n BCTR R2,0 n=n-1\\n MVC POLEN+0(1),POLES+2 via\\n MVC POLEN+1(1),POLES+1 to\\n MVC POLEN+2(1),POLES+0 from\\n L R3,POLEN new poles\\n BAL R14,MOVE call move(n-1,via,to,from)\\nRETURNM LM R2,R3,STACK pull arguments from stack\\n LR R1,R11 current stack\\n L R14,SAVE14M restore r14\\n L R11,SAVE11M restore r11\\n LA R0,STACKLEN amount of storage to free\\n FREEMAIN A=(R1),LV=(R0) free allocated storage\\n BR R14 return to caller\\n LTORG\\n DROP R12 base no longer needed\\nSTACKDS DSECT dynamic area\\nSAVE14M DS F saved r14\\nSAVE11M DS F saved r11\\nSTACK DS 0F stack\\nN DS F r2 n\\nPOLES DS F r3 poles\\nSTACKLEN EQU *-STACKDS\\n YREGS\\n END HANOITOW\\n\",\n \"language\": \"360-Assembly\"\n },\n {\n \"code\": \"temp = $FB ; this works on a VIC-20 or C-64; adjust for other machines. Need two bytes zero-page space unused by the OS.\\n\\n; kernal print-char routine\\nchrout = $FFD2\\n\\n; Main Towers of Hanoi routine. To call, load the accumulator with the number of disks to move,\\n; the X register with the source peg (1-3), and the Y register with the target peg.\\n\\nhanoi: cmp #$00 ; do nothing if the number of disks to move is zero\\n bne nonzero\\n rts\\n\\nnonzero: pha ; save registers on stack\\n txa\\n pha\\n tya\\n pha\\n pha ; and make room for the spare peg number\\n\\n ; Parameters are now on the stack at these offsets:\\n count = $0104\\n source = $0103\\n target = $0102\\n spare = $0101\\n\\n ; compute spare rod number (6 - source - dest)\\n tsx\\n lda #6\\n sec\\n sbc source, x\\n sec\\n sbc target, x\\n sta spare, x\\n\\n ; prepare for first recursive call\\n tay ; target is the spare peg\\n\\n tsx\\n lda source, x ; source is the same\\n sta temp ; we're using X to access the stack, so save its value here for now\\n\\n lda count, x ; move count - 1 disks\\n sec\\n sbc #1\\n ldx temp ; now load X for call\\n\\n ; and recurse\\n jsr hanoi\\n\\n ; restore X and Y for print call\\n tsx\\n ldy target, x\\n lda source, x\\n tax\\n\\n ; print instructions to move the last disk\\n jsr print_move\\n\\n ; prepare for final recursive call\\n tsx\\n lda spare, x ; source is now spare\\n sta temp\\n lda target, x ; going to the original target\\n tay\\n lda count, x ; and again moving count-1 disks\\n sec\\n sbc #1\\n ldx temp\\n jsr hanoi\\n\\n ; pop our stack frame, restore registers, and return\\n pla\\n pla\\n tay\\n pla\\n tax\\n pla\\n rts\\n\\n; constants for printing\\nprelude: .asciiz \\\"MOVE DISK FROM \\\"\\ninterlude: .asciiz \\\" TO \\\"\\npostlude: .byte 13,0\\n\\n; print instructions: move disk from (X) to (Y)\\nprint_move:\\n pha\\n txa\\n pha\\n tya\\n pha\\n\\n ; Parameters are now on the stack at these offsets:\\n from = $0102\\n to = $0101\\n\\n lda #<prelude\\n ldx #>prelude\\n jsr print_string\\n tsx\\n lda from,x\\n clc\\n adc #$30\\n jsr chrout\\n lda #<interlude\\n ldx #>interlude\\n jsr print_string\\n tsx\\n lda to,x\\n clc\\n adc #$30\\n jsr chrout\\n lda #<postlude\\n ldx #>postlude\\n jsr print_string\\n pla\\n tay\\n pla\\n tax\\n pla\\n rts\\n\\n; utility routine: print null-terminated string at address AX\\nprint_string:\\n sta temp\\n stx temp+1\\n ldy #0\\nloop: lda (temp),y\\n beq done_print\\n jsr chrout\\n iny\\n bne loop\\ndone_print:\\n rts\\n\",\n \"language\": \"6502-Assembly\"\n },\n {\n \"code\": \"\\torg\\t100h\\n\\tlhld\\t6\\t; Top of CP/M usable memory\\n\\tsphl\\t\\t; Put the stack there\\n\\tlxi\\tb,0401h\\t; Set up first arguments to move()\\n\\tlxi\\td,0203h\\n\\tcall\\tmove\\t; move(4, 1, 2, 3)\\n\\trst\\t0\\t; quit program\\n\\t;;;\\tMove B disks from C via D to E.\\nmove:\\tdcr\\tb\\t; One fewer disk in next iteration\\n\\tjz\\tmvout\\t; If this was the last disk, print move and stop\\n\\tpush\\tb\\t; Otherwise, save registers,\\n\\tpush\\td\\n\\tmov\\ta,d\\t; First recursive call\\n\\tmov\\td,e\\n\\tmov\\te,a\\n\\tcall\\tmove\\t; move(B-1, C, E, D)\\n\\tpop\\td\\t; Restore registers\\n\\tpop\\tb\\n\\tcall\\tmvout\\t; Print current move\\n\\tmov\\ta,c\\t; Second recursive call\\n\\tmov\\tc,d\\n\\tmov\\td,a\\n\\tjmp\\tmove\\t; move(B-1, D, C, E) - tail call optimization\\n\\t;;;\\tPrint move, saving registers.\\nmvout:\\tpush\\tb\\t; Save registers on stack\\n\\tpush\\td\\n\\tmov\\ta,c\\t; Store 'from' as ASCII digit in 'from' space\\n\\tadi\\t'0'\\n\\tsta\\tout1\\n\\tmov\\ta,e\\t; Store 'to' as ASCII digit in 'to' space\\n\\tadi\\t'0'\\n\\tsta\\tout2\\n\\tlxi\\td,outstr\\n\\tmvi\\tc,9\\t; CP/M call to print the string\\n\\tcall\\t5\\n\\tpop\\td\\t; Restore register contents\\n\\tpop\\tb\\n\\tret\\n\\t;;;\\tMove output with placeholder for pole numbers\\noutstr:\\tdb\\t'Move disk from pole '\\nout1:\\tdb\\t'* to pole '\\nout2:\\tdb\\t'*',13,10,'$'\\n\",\n \"language\": \"8080-Assembly\"\n },\n {\n \"code\": \"\\tcpu\\t8086\\n\\tbits\\t16\\n\\torg\\t100h\\nsection\\t.text\\n\\tmov\\tbx,0402h\\t; Set up first arguments to move()\\n\\tmov\\tcx,0103h\\t; Registers chosen s.t. CX contains output\\n\\t;;;\\tMove BH disks from CH via BL to CL\\nmove:\\tdec\\tbh\\t\\t; One fewer disk in next iteration\\n\\tjz\\t.out\\t\\t; If this was last disk, just print move\\n\\tpush\\tbx\\t\\t; Save the registers for a recursive call\\n\\tpush\\tcx\\n\\txchg\\tbl,cl\\t\\t; Swap the 'to' and 'via' registers\\n\\tcall\\tmove\\t\\t; move(BH, CH, CL, BL)\\n\\tpop\\tcx\\t\\t; Restore the registers from the stack\\n\\tpop\\tbx\\n\\tcall\\t.out\\t\\t; Print the move\\n\\txchg\\tch,bl\\t\\t; Swap the 'from' and 'via' registers\\n\\tjmp\\tmove\\t\\t; move(BH, BL, CH, CL)\\n\\t;;;\\tPrint the move\\n.out:\\tmov\\tax,'00'\\t\\t; Add ASCII 0 to both 'from' and 'to'\\n\\tadd\\tax,cx\\t\\t; in one 16-bit operation\\n\\tmov\\t[out1],ah\\t; Store 'from' field in output\\n\\tmov\\t[out2],al\\t; Store 'to' field in output\\n\\tmov\\tdx,outstr\\t; MS-DOS system call to print string\\n\\tmov\\tah,9\\n\\tint\\t21h\\n\\tret\\nsection\\t.data\\noutstr:\\tdb\\t'Move disk from pole '\\nout1:\\tdb\\t'* to pole '\\nout2:\\tdb\\t'*',13,10,'$'\\n\",\n \"language\": \"8086-Assembly\"\n },\n {\n \"code\": \"5 var, disks\\nvar sa\\nvar sb\\nvar sc\\n\\n: save sc ! sb ! sa ! disks ! ;\\n: get sa @ sb @ sc @ ;\\n: get2 get swap ;\\n: hanoi\\n\\tsave disks @ not if ;; then\\n\\tdisks @ get\\n\\tdisks @ n:1- get2 hanoi save\\n\\tcr\\n\\t\\\" move a ring from \\\" . sa @ . \\\" to \\\" . sb @ .\\n\\tdisks @ n:1- get2 rot hanoi\\n;\\n\\n\\\" Tower of Hanoi, with \\\" . disks @ . \\\" rings: \\\" .\\ndisks @ 1 2 3 hanoi cr bye\\n\",\n \"language\": \"8th\"\n },\n {\n \"code\": \"HOW TO MOVE n DISKS FROM src VIA via TO dest:\\n IF n>0:\\n MOVE n-1 DISKS FROM src VIA dest TO via\\n WRITE \\\"Move disk from pole\\\", src, \\\"to pole\\\", dest/\\n MOVE n-1 DISKS FROM via VIA dest TO src\\n\\nMOVE 4 DISKS FROM 1 VIA 2 TO 3\\n\",\n \"language\": \"ABC\"\n },\n {\n \"code\": \";;; Iterative Towers of Hanoi; translated from Tiny BASIC via PL/M\\n;;;\\n\\nDEFINE NUMBER_OF_DISCS = \\\"4\\\"\\n\\nPROC Main()\\n\\n INT d, n, x\\n\\n n = 1\\n FOR d = 1 TO NUMBER_OF_DISCS DO\\n n = n + n\\n OD\\n FOR x = 1 TO n - 1 DO\\n ; as with Algol W, PL/M, Action! has bit and MOD operators\\n Print( \\\"Move disc on peg \\\" )\\n Put( '1 + ( ( x AND ( x - 1 ) ) MOD 3 ) )\\n Print( \\\" to peg \\\" )\\n Put( '1 + ( ( ( x OR ( x - 1 ) ) + 1 ) MOD 3 ) )\\n PutE()\\n OD\\nRETURN\\n\",\n \"language\": \"Action-\"\n },\n {\n \"code\": \"public function move(n:int, from:int, to:int, via:int):void\\n{\\n if (n > 0)\\n {\\n move(n - 1, from, via, to);\\n trace(\\\"Move disk from pole \\\" + from + \\\" to pole \\\" + to);\\n move(n - 1, via, to, from);\\n }\\n}\\n\",\n \"language\": \"ActionScript\"\n },\n {\n \"code\": \"with Ada.Text_Io; use Ada.Text_Io;\\n\\nprocedure Towers is\\n type Pegs is (Left, Center, Right);\\n procedure Hanoi (Ndisks : Natural; Start_Peg : Pegs := Left; End_Peg : Pegs := Right; Via_Peg : Pegs := Center) is\\n begin\\n if Ndisks > 0 then\\n Hanoi(Ndisks - 1, Start_Peg, Via_Peg, End_Peg);\\n Put_Line(\\\"Move disk\\\" & Natural'Image(Ndisks) & \\\" from \\\" & Pegs'Image(Start_Peg) & \\\" to \\\" & Pegs'Image(End_Peg));\\n Hanoi(Ndisks - 1, Via_Peg, End_Peg, Start_Peg);\\n end if;\\n end Hanoi;\\nbegin\\n Hanoi(4);\\nend Towers;\\n\",\n \"language\": \"Ada\"\n },\n {\n \"code\": \"move := proc(n::number, src::number, dst::number, via::number) is\\n if n > 0 then\\n move(n - 1, src, via, dst)\\n print(src & ' to ' & dst)\\n move(n - 1, via, dst, src)\\n fi\\nend\\n\\nmove(4, 1, 2, 3)\\n\",\n \"language\": \"Agena\"\n },\n {\n \"code\": \"begin\\n procedure movedisk(n, f, t);\\n integer n, f, t;\\n begin\\n outstring (1, \\\"Move disk from\\\");\\n outinteger(1, f);\\n outstring (1, \\\"to\\\");\\n outinteger(1, t);\\n outstring (1, \\\"\\\\n\\\");\\n end;\\n\\n procedure dohanoi(n, f, t, u);\\n integer n, f, t, u;\\n begin\\n if n < 2 then\\n movedisk(1, f, t)\\n else\\n begin\\n dohanoi(n - 1, f, u, t);\\n movedisk(1, f, t);\\n dohanoi(n - 1, u, t, f);\\n end;\\n end;\\n\\n dohanoi(4, 1, 2, 3);\\n outstring(1,\\\"Towers of Hanoi puzzle completed!\\\")\\nend\\n\",\n \"language\": \"ALGOL-60\"\n },\n {\n \"code\": \"PROC move = (INT n, from, to, via) VOID:\\n IF n > 0 THEN\\n move(n - 1, from, via, to);\\n printf(($\\\"Move disk from pole \\\"g\\\" to pole \\\"gl$, from, to));\\n move(n - 1, via, to, from)\\n FI\\n;\\n\\nmain: (\\n move(4, 1,2,3)\\n)\\n\",\n \"language\": \"ALGOL-68\"\n },\n {\n \"code\": \"PROC move = (INT n, from, to, via) VOID:\\n IF n > 0 THEN\\n move(n - 1, from, via, to);\\n printf(($\\\"Move disk \\\"g\\\" from pole \\\"g\\\" to pole \\\"gl$, n, from, to));\\n move(n - 1, via, to, from)\\n FI ;\\nmain: (\\n move(4, 1,2,3)\\n)\\n\",\n \"language\": \"ALGOL-68\"\n },\n {\n \"code\": \"begin\\nprocedure move(n, src, via, dest);\\ninteger n;\\nstring(1) src, via, dest;\\nbegin\\n if n > 0 then\\n begin\\n move(n-1, src, dest, via);\\n write(\\\"Move disk from pole \\\");\\n writeon(src);\\n writeon(\\\" to pole \\\");\\n writeon(dest);\\n move(n-1, via, src, dest);\\n end;\\nend;\\n\\nmove(4, \\\"1\\\", \\\"2\\\", \\\"3\\\");\\nend\\n\",\n \"language\": \"ALGOL-M\"\n },\n {\n \"code\": \"begin\\n procedure move ( integer value n, from, to, via ) ;\\n if n > 0 then begin\\n move( n - 1, from, via, to );\\n write( i_w := 1, s_w := 0, \\\"Move disk from peg: \\\", from, \\\" to peg: \\\", to );\\n move( n - 1, via, to, from )\\n end move ;\\n\\n move( 4, 1, 2, 3 )\\nend.\\n\",\n \"language\": \"ALGOL-W\"\n },\n {\n \"code\": \"begin % iterative towers of hanoi - translated from Tiny Basic %\\n integer d, n;\\n while begin writeon( \\\"How many disks? \\\" );\\n read( d );\\n d < 1 or d > 10\\n end\\n do begin end;\\n n := 1;\\n while d not = 0 do begin\\n d := d - 1;\\n n := 2 * n\\n end;\\n for x := 1 until n - 1 do begin\\n integer s, t;\\n % Algol W has the necessary bit and modulo operators so these are used here %\\n % instead of implementing them via subroutines %\\n s := number( bitstring( x ) and bitstring( x - 1 ) ) rem 3;\\n t := ( number( bitstring( x ) or bitstring( x - 1 ) ) + 1 ) rem 3;\\n write( i_w := 1, s_w := 0, \\\"Move disc on peg \\\", s + 1, \\\" to peg \\\", t + 1 )\\n end\\nend.\\n\",\n \"language\": \"ALGOL-W\"\n },\n {\n \"code\": \"#include <hopper.h>\\n#proto hanoi(_X_,_Y_,_Z_,_W_)\\nmain:\\n get arg number (2,discos)\\n {discos}!neg? do{fail=0,mov(fail),{\\\"I need a positive (or zero) number here, not: \\\",fail}println,exit(0)}\\n pos? do{\\n _hanoi( discos, \\\"A\\\", \\\"B\\\", \\\"C\\\" )\\n }\\nexit(0)\\n.locals\\nhanoi(discos,inicio,aux,fin)\\n iif( {discos}eqto(1), {inicio, \\\"->\\\", fin, \\\"\\\\n\\\"};print, _hanoi({discos}minus(1), inicio,fin,aux);\\\\\\n {inicio, \\\"->\\\", fin, \\\"\\\\n\\\"};print;\\\\\\n _hanoi({discos}minus(1), aux, inicio, fin))\\nback\\n\",\n \"language\": \"Amazing-Hopper\"\n },\n {\n \"code\": \"PROC move(n, from, to, via)\\n IF n > 0\\n move(n-1, from, via, to)\\n WriteF('Move disk from pole \\\\d to pole \\\\d\\\\n', from, to)\\n move(n-1, via, to, from)\\n ENDIF\\nENDPROC\\n\\nPROC main()\\n move(4, 1,2,3)\\nENDPROC\\n\",\n \"language\": \"AmigaE\"\n },\n {\n \"code\": \"hanoi←{\\n move←{\\n n from to via←⍵\\n n≤0:⍬\\n l←∇(n-1) from via to\\n r←∇(n-1) via to from\\n l,(⊂from to),r\\n }\\n '⊂Move disk from pole ⊃,I1,⊂ to pole ⊃,I1'⎕FMT↑move ⍵\\n}\\n\",\n \"language\": \"APL\"\n },\n {\n \"code\": \"--------------------- TOWERS OF HANOI --------------------\\n\\n-- hanoi :: Int -> (String, String, String) -> [(String, String)]\\non hanoi(n, abc)\\n script go\\n on |λ|(n, {x, y, z})\\n if n > 0 then\\n set m to n - 1\\n\\n |λ|(m, {x, z, y}) & ¬\\n {{x, y}} & |λ|(m, {z, y, x})\\n else\\n {}\\n end if\\n end |λ|\\n end script\\n\\n go's |λ|(n, abc)\\nend hanoi\\n\\n\\n--------------------------- TEST -------------------------\\non run\\n unlines(map(intercalate(\\\" -> \\\"), ¬\\n hanoi(3, {\\\"left\\\", \\\"right\\\", \\\"mid\\\"})))\\nend run\\n\\n\\n-------------------- GENERIC FUNCTIONS -------------------\\n\\n-- intercalate :: String -> [String] -> String\\non intercalate(delim)\\n script\\n on |λ|(xs)\\n set {dlm, my text item delimiters} to ¬\\n {my text item delimiters, delim}\\n set s to xs as text\\n set my text item delimiters to dlm\\n s\\n end |λ|\\n end script\\nend intercalate\\n\\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\\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-- 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 \"language\": \"AppleScript\"\n },\n {\n \"code\": \"on hanoi(n, source, target)\\n set t1 to tab & \\\"tower 1: \\\" & tab\\n set t2 to tab & \\\"tower 2: \\\" & tab\\n set t3 to tab & \\\"tower 3: \\\" & tab\\n\\n script o\\n property m : 0\\n property tower1 : {}\\n property tower2 : {}\\n property tower3 : {}\\n property towerRefs : {a reference to tower1, a reference to tower2, a reference to tower3}\\n property process : missing value\\n\\n on |move|(n, source, target)\\n set aux to 6 - source - target\\n repeat with n from n to 2 by -1 -- Tail call elimination repeat.\\n |move|(n - 1, source, aux)\\n set end of item target of my towerRefs to n\\n tell item source of my towerRefs to set its contents to reverse of rest of its reverse\\n set m to m + 1\\n set end of my process to ¬\\n {(m as text) & \\\". move disc \\\" & n & (\\\" from tower \\\" & source) & (\\\" to tower \\\" & target & \\\":\\\"), ¬\\n t1 & tower1, ¬\\n t2 & tower2, ¬\\n t3 & tower3}\\n tell source\\n set source to aux\\n set aux to it\\n end tell\\n end repeat\\n -- Specific code for n = 1:\\n set end of item target of my towerRefs to 1\\n tell item source of my towerRefs to set its contents to reverse of rest of its reverse\\n set m to m + 1\\n set end of my process to ¬\\n {(m as text) & \\\". move disc 1 from tower \\\" & source & (\\\" to tower \\\" & target & \\\":\\\"), ¬\\n t1 & tower1, ¬\\n t2 & tower2, ¬\\n t3 & tower3}\\n end |move|\\n end script\\n\\n repeat with i from n to 1 by -1\\n set end of item source of o's towerRefs to i\\n end repeat\\n\\n set astid to AppleScript's text item delimiters\\n set AppleScript's text item delimiters to \\\", \\\"\\n set o's process to {\\\"Starting with \\\" & n & (\\\" discs on tower \\\" & (source & \\\":\\\")), ¬\\n t1 & o's tower1, t2 & o's tower2, t3 & o's tower3}\\n if (n > 0) then tell o to |move|(n, source, target)\\n set end of o's process to \\\"That's it!\\\"\\n set AppleScript's text item delimiters to linefeed\\n set process to o's process as text\\n set AppleScript's text item delimiters to astid\\n\\n return process\\nend hanoi\\n\\n-- Test:\\nset numberOfDiscs to 3\\nset sourceTower to 1\\nset destinationTower to 2\\nhanoi(numberOfDiscs, sourceTower, destinationTower)\\n\",\n \"language\": \"AppleScript\"\n },\n {\n \"code\": \".text\\n.global\\t_start\\n_start:\\tmov\\tr0,#4\\t\\t@ 4 disks,\\n\\tmov\\tr1,#1\\t\\t@ from pole 1,\\n\\tmov\\tr2,#2\\t\\t@ via pole 2,\\n\\tmov\\tr3,#3\\t\\t@ to pole 3.\\n\\tbl\\tmove\\n\\tmov\\tr0,#0\\t\\t@ Exit to Linux afterwards\\n\\tmov\\tr7,#1\\n\\tswi\\t#0\\n\\t@@@\\tMove r0 disks from r1 via r2 to r3\\nmove:\\tsubs\\tr0,r0,#1\\t@ One fewer disk in next iteration\\n\\tbeq\\tshow\\t\\t@ If last disk, just print move\\n\\tpush\\t{r0-r3,lr}\\t@ Save all the registers incl. link register\\n\\teor\\tr2,r2,r3\\t@ Swap the 'to' and 'via' registers\\n\\teor\\tr3,r2,r3\\n\\teor\\tr2,r2,r3\\n\\tbl\\tmove\\t\\t@ Recursive call\\n\\tpop\\t{r0-r3}\\t\\t@ Restore all the registers except LR\\n\\tbl\\tshow\\t\\t@ Show current move\\n\\teor\\tr1,r1,r3\\t@ Swap the 'to' and 'via' registers\\n\\teor\\tr3,r1,r3\\n\\teor\\tr1,r1,r3\\n\\tpop\\t{lr}\\t\\t@ Restore link register\\n\\tb\\tmove\\t\\t@ Tail call\\n\\t@@@\\tShow move\\nshow:\\tpush\\t{r0-r3,lr}\\t@ Save all the registers\\n\\tadd\\tr1,r1,#'0\\t@ Write the source pole\\n\\tldr\\tlr,=spole\\n\\tstrb\\tr1,[lr]\\n\\tadd\\tr3,r3,#'0\\t@ Write the destination pole\\n\\tldr\\tlr,=dpole\\n\\tstrb\\tr3,[lr]\\n\\tmov\\tr0,#1\\t\\t@ 1 = stdout\\n\\tldr\\tr1,=moves\\t@ Pointer to string\\n\\tldr\\tr2,=mlen\\t@ Length of string\\n\\tmov\\tr7,#4\\t\\t@ 4 = Linux write syscall\\n\\tswi\\t#0 \\t\\t@ Print the move\\n\\tpop\\t{r0-r3,pc}\\t@ Restore all the registers and return\\n.data\\nmoves:\\t.ascii\\t\\\"Move disk from pole \\\"\\nspole:\\t.ascii\\t\\\"* to pole \\\"\\ndpole:\\t.ascii\\t\\\"*\\\\n\\\"\\nmlen\\t=\\t. - moves\\n\",\n \"language\": \"ARM-Assembly\"\n },\n {\n \"code\": \"hanoi: function [n f dir via][\\n\\tif n>0 [\\n\\t\\thanoi n-1 f via dir\\n\\t\\tprint [\\\"Move disk\\\" n \\\"from\\\" f \\\"to\\\" dir]\\n\\t\\thanoi n-1 via dir f\\n\\t]\\n]\\n\\nhanoi 3 'L 'M 'R\\n\",\n \"language\": \"Arturo\"\n },\n {\n \"code\": \"move(n, from, to, via) ;n = # of disks, from = start pole, to = end pole, via = remaining pole\\n{\\n if (n = 1)\\n {\\n msgbox , Move disk from pole %from% to pole %to%\\n }\\n else\\n {\\n move(n-1, from, via, to)\\n move(1, from, to, via)\\n move(n-1, via, to, from)\\n }\\n}\\nmove(64, 1, 3, 2)\\n\",\n \"language\": \"AutoHotkey\"\n },\n {\n \"code\": \"Func move($n, $from, $to, $via)\\n\\tIf ($n = 1) Then\\n\\t\\tConsoleWrite(StringFormat(\\\"Move disk from pole \\\"&$from&\\\" To pole \\\"&$to&\\\"\\\\n\\\"))\\n\\tElse\\n\\t\\tmove($n - 1, $from, $via, $to)\\n\\t\\tmove(1, $from, $to, $via)\\n\\t\\tmove($n - 1, $via, $to, $from)\\n\\tEndIf\\nEndFunc\\n\\nmove(4, 1,2,3)\\n\",\n \"language\": \"AutoIt\"\n },\n {\n \"code\": \"$ awk 'func hanoi(n,f,t,v){if(n>0){hanoi(n-1,f,v,t);print(f,\\\"->\\\",t);hanoi(n-1,v,t,f)}}\\nBEGIN{hanoi(4,\\\"left\\\",\\\"middle\\\",\\\"right\\\")}'\\n\",\n \"language\": \"AWK\"\n },\n {\n \"code\": \"SUB move (n AS Integer, fromPeg AS Integer, toPeg AS Integer, viaPeg AS Integer)\\n IF n>0 THEN\\n move n-1, fromPeg, viaPeg, toPeg\\n PRINT \\\"Move disk from \\\"; fromPeg; \\\" to \\\"; toPeg\\n move n-1, viaPeg, toPeg, fromPeg\\n END IF\\nEND SUB\\n\\nmove 4,1,2,3\\n\",\n \"language\": \"BASIC\"\n },\n {\n \"code\": \"10 DEPTH=4: REM SHOULD EQUAL NUMBER OF DISKS\\n20 DIM N(DEPTH), F(DEPTH), T(DEPTH), V(DEPTH): REM STACK PER PARAMETER\\n30 SP = 0: REM STACK POINTER\\n40 N(SP) = 4: REM START WITH 4 DISCS\\n50 F(SP) = 1: REM ON PEG 1\\n60 T(SP) = 2: REM MOVE TO PEG 2\\n70 V(SP) = 3: REM VIA PEG 3\\n80 GOSUB 100\\n90 END\\n99 REM MOVE SUBROUTINE\\n100 IF N(SP) = 0 THEN RETURN\\n110 OS = SP: REM STORE STACK POINTER\\n120 SP = SP + 1: REM INCREMENT STACK POINTER\\n130 N(SP) = N(OS) - 1: REM MOVE N-1 DISCS\\n140 F(SP) = F(OS) : REM FROM START PEG\\n150 T(SP) = V(OS) : REM TO VIA PEG\\n160 V(SP) = T(OS) : REM VIA TO PEG\\n170 GOSUB 100\\n180 OS = SP - 1: REM OS WILL HAVE CHANGED\\n190 PRINT \\\"MOVE DISC FROM\\\"; F(OS); \\\"TO\\\"; T(OS)\\n200 N(SP) = N(OS) - 1: REM MOVE N-1 DISCS\\n210 F(SP) = V(OS) : REM FROM VIA PEG\\n220 T(SP) = T(OS) : REM TO DEST PEG\\n230 V(SP) = F(OS) : REM VIA FROM PEG\\n240 GOSUB 100\\n250 SP = SP - 1 : REM RESTORE STACK POINTER FOR CALLER\\n260 RETURN\\n\",\n \"language\": \"BASIC\"\n },\n {\n \"code\": \" 10 DEF FNM3(X)=X-INT(X/3)*3:REM MODULO 3\\n 20 N=4:GOSUB 100\\n 30 END\\n 99 REM HANOI\\n 100 :FOR M=1 TO 2^N-1\\n 110 ::PRINT MID$(STR$(M),2);\\\":\\\",FNM3(M AND M-1)+1;\\\"TO\\\";FNM3((M OR M-1)+1)+1\\n 130 :NEXT M\\n 140 RETURN\\n\",\n \"language\": \"BASIC\"\n },\n {\n \"code\": \"call move(4,1,2,3)\\nprint \\\"Towers of Hanoi puzzle completed!\\\"\\nend\\n\\nsubroutine move (n, fromPeg, toPeg, viaPeg)\\n if n>0 then\\n call move(n-1, fromPeg, viaPeg, toPeg)\\n print \\\"Move disk from \\\"+fromPeg+\\\" to \\\"+toPeg\\n call move(n-1, viaPeg, toPeg, fromPeg)\\n end if\\nend subroutine\\n\",\n \"language\": \"BASIC256\"\n },\n {\n \"code\": \"@echo off\\nsetlocal enabledelayedexpansion\\n\\n\\t%==The main thing==%\\n\\t%==First param - Number of disks==%\\n\\t%==Second param - Start pole==%\\n\\t%==Third param - End pole==%\\n\\t%==Fourth param - Helper pole==%\\ncall :move 4 START END HELPER\\necho.\\npause\\nexit /b 0\\n\\n\\t%==The \\\"function\\\"==%\\n:move\\n\\tsetlocal\\n\\tset n=%1\\n\\tset from=%2\\n\\tset to=%3\\n\\tset via=%4\\n\\n\\tif %n% gtr 0 (\\n\\t\\tset /a x=!n!-1\\n\\t\\tcall :move !x! %from% %via% %to%\\n\\t\\techo Move top disk from pole %from% to pole %to%.\\n\\t\\tcall :move !x! %via% %to% %from%\\n\\t)\\n\\texit /b 0\\n\",\n \"language\": \"Batch-File\"\n },\n {\n \"code\": \" DIM Disc$(13),Size%(3)\\n FOR disc% = 1 TO 13\\n Disc$(disc%) = STRING$(disc%,\\\" \\\")+STR$disc%+STRING$(disc%,\\\" \\\")\\n IF disc%>=10 Disc$(disc%) = MID$(Disc$(disc%),2)\\n Disc$(disc%) = CHR$17+CHR$(128+disc%-(disc%>7))+Disc$(disc%)+CHR$17+CHR$128\\n NEXT disc%\\n\\n MODE 3\\n OFF\\n ndiscs% = 13\\n FOR n% = ndiscs% TO 1 STEP -1\\n PROCput(n%,1)\\n NEXT\\n INPUT TAB(0,0) \\\"Press Enter to start\\\" dummy$\\n PRINT TAB(0,0) SPC(20);\\n PROChanoi(ndiscs%,1,2,3)\\n VDU 30\\n END\\n\\n DEF PROChanoi(a%,b%,c%,d%)\\n IF a%=0 ENDPROC\\n PROChanoi(a%-1,b%,d%,c%)\\n PROCtake(a%,b%)\\n PROCput(a%,c%)\\n PROChanoi(a%-1,d%,c%,b%)\\n ENDPROC\\n\\n DEF PROCput(disc%,peg%)\\n PRINTTAB(13+26*(peg%-1)-disc%,20-Size%(peg%))Disc$(disc%);\\n Size%(peg%) = Size%(peg%)+1\\n ENDPROC\\n\\n DEF PROCtake(disc%,peg%)\\n Size%(peg%) = Size%(peg%)-1\\n PRINTTAB(13+26*(peg%-1)-disc%,20-Size%(peg%))STRING$(2*disc%+1,\\\" \\\");\\n ENDPROC\\n\",\n \"language\": \"BBC-BASIC\"\n },\n {\n \"code\": \"get \\\"libhdr\\\"\\n\\nlet start() be move(4, 1, 2, 3)\\nand move(n, src, via, dest) be if n > 0 do\\n$( move(n-1, src, dest, via)\\n writef(\\\"Move disk from pole %N to pole %N*N\\\", src, dest);\\n move(n-1, via, src, dest)\\n$)\\n\",\n \"language\": \"BCPL\"\n },\n {\n \"code\": \"48*2+1>#v_:!#@_0\\\" ksid evoM\\\">:#,_$:8/:.v\\n>8v8:<$#<+9-+*2%3\\\\*3/3:,+55.+1%3:$_,#!>#:<\\n: >/!#^_:0\\\\:8/1-8vv,_$8%:3/1+.>0\\\" gep ot\\\"^\\n^++3-%3\\\\*2/3:%8\\\\*<>:^:\\\"from peg \\\"0\\\\*8-1<\\n\",\n \"language\": \"Befunge\"\n },\n {\n \"code\": \"Move ← {\\n 𝕩⊑⊸≤0 ? ⟨⟩;\\n 𝕊 n‿from‿to‿via:\\n l ← 𝕊 ⟨n-1, from, via, to⟩\\n r ← 𝕊 ⟨n-1, via, to, from⟩\\n l∾(<from‿to)∾r\\n}\\n{\\\"Move disk from pole \\\"∾(•Fmt 𝕨)∾\\\" to pole \\\"∾•Fmt 𝕩}´˘>Move 4‿1‿2‿3\\n\",\n \"language\": \"BQN\"\n },\n {\n \"code\": \"┌─\\n╵\\\"Move disk from pole 1 to pole 3\\n Move disk from pole 1 to pole 2\\n Move disk from pole 3 to pole 2\\n Move disk from pole 1 to pole 3\\n Move disk from pole 2 to pole 1\\n Move disk from pole 2 to pole 3\\n Move disk from pole 1 to pole 3\\n Move disk from pole 1 to pole 2\\n Move disk from pole 3 to pole 2\\n Move disk from pole 3 to pole 1\\n Move disk from pole 2 to pole 1\\n Move disk from pole 3 to pole 2\\n Move disk from pole 1 to pole 3\\n Move disk from pole 1 to pole 2\\n Move disk from pole 3 to pole 2\\\"\\n ┘\\n\",\n \"language\": \"BQN\"\n },\n {\n \"code\": \"( ( move\\n = n from to via\\n . !arg:(?n,?from,?to,?via)\\n & ( !n:>0\\n & move$(!n+-1,!from,!via,!to)\\n & out$(\\\"Move disk from pole \\\" !from \\\" to pole \\\" !to)\\n & move$(!n+-1,!via,!to,!from)\\n |\\n )\\n )\\n& move$(4,1,2,3)\\n);\\n\",\n \"language\": \"Bracmat\"\n },\n {\n \"code\": \"[\\nThis implementation is recursive and uses\\na stack, consisting of frames that are 8\\nbytes long. The layout is as follows:\\n\\nByte Description\\n 0 recursion flag\\n (the program stops if the flag is\\n zero)\\n 1 the step which is currently\\n executed\\n 4 means a call to\\n move(a, c, b, n - 1)\\n 3 means a call to\\n move(a, b, c, 1)\\n 2 means a call to\\n move(b, a, c, n - 1)\\n 1 prints the source and dest pile\\n 2 flag to check whether the current\\n step has already been done or if\\n it still must be executed\\n 3 the step which will be executed\\n in the next loop\\n 4 the source pile\\n 5 the helper pile\\n 6 the destination pile\\n 7 the number of disks to move\\n\\nThe first stack frame (0 0 0 0 0 0 0 0)\\nis used to abort the recursion.\\n]\\n\\n>>>>>>>>\\n\\nThese are the parameters for the program\\n(1 4 1 0 'a 'b 'c 5)\\n+>++++>+>>\\n>>>>++++++++[<++++++++++++>-]<\\n[<<<+>+>+>-]<<<+>++>+++>+++++>\\n<<<<<<<<\\n\\n[> while (recurse)\\n [- if (step gt 0)\\n >[-]+< todo = 1\\n [- if (step gt 1)\\n [- if (step gt 2)\\n [- if (step gt 3)\\n >>+++<< next = 3\\n >-< todo = 0\\n >>>>>>[>+>+<<-]>[<+>-]> n dup\\n -\\n [[-] if (sub(n 1) gt 0)\\n <+>>>++++> push (1 0 0 4)\\n\\n copy and push a\\n <<<<<<<<[>>>>>>>>+>+\\n <<<<<<<<<-]>>>>>>>>\\n >[<<<<<<<<<+>>>>>>>>>-]< >\\n\\n copy and push c\\n <<<<<<<[>>>>>>>+>+\\n <<<<<<<<-]>>>>>>>\\n >[<<<<<<<<+>>>>>>>>-]< >\\n\\n copy and push b\\n <<<<<<<<<[>>>>>>>>>+>+\\n <<<<<<<<<<-]>>>>>>>>>\\n >[<<<<<<<<<<+>>>>>>>>>>-]< >\\n\\n copy n and push sub(n 1)\\n <<<<<<<<[>>>>>>>>+>+\\n <<<<<<<<<-]>>>>>>>>\\n >[<<<<<<<<<+>>>>>>>>>-]< -\\n >>\\n ]\\n <<<<<<<<\\n ]\\n >[-< if ((step gt 2) and todo)\\n >>++<< next = 2\\n >>>>>>>\\n +>>>+> push 1 0 0 1 a b c 1\\n <<<<<<<<[>>>>>>>>+>+\\n <<<<<<<<<-]>>>>>>>>\\n >[<<<<<<<<<+>>>>>>>>>-]< > a\\n <<<<<<<<[>>>>>>>>+>+\\n <<<<<<<<<-]>>>>>>>>\\n >[<<<<<<<<<+>>>>>>>>>-]< > b\\n <<<<<<<<[>>>>>>>>+>+\\n <<<<<<<<<-]>>>>>>>>\\n >[<<<<<<<<<+>>>>>>>>>-]< > c\\n + >>\\n >]<\\n ]\\n >[-< if ((step gt 1) and todo)\\n >>>>>>[>+>+<<-]>[<+>-]> n dup\\n -\\n [[-] if (n sub 1 gt 0)\\n <+>>>++++> push (1 0 0 4)\\n\\n copy and push b\\n <<<<<<<[>>>>>>>+\\n <<<<<<<-]>>>>>>>\\n >[<<<<<<<<+>>>>>>>>-]< >\\n\\n copy and push a\\n <<<<<<<<<[>>>>>>>>>+\\n <<<<<<<<<-]>>>>>>>>>\\n >[<<<<<<<<<<+>>>>>>>>>>-]< >\\n\\n copy and push c\\n <<<<<<<<[>>>>>>>>+\\n <<<<<<<<-]>>>>>>>>\\n >[<<<<<<<<<+>>>>>>>>>-]< >\\n\\n copy n and push sub(n 1)\\n <<<<<<<<[>>>>>>>>+>+\\n <<<<<<<<<-]>>>>>>>>\\n >[<<<<<<<<<+>>>>>>>>>-]< -\\n >>\\n ]\\n <<<<<<<<\\n >]<\\n ]\\n >[-< if ((step gt 0) and todo)\\n >>>>>>>\\n >++++[<++++++++>-]<\\n >>++++++++[<+++++++++>-]<++++\\n >>++++++++[<++++++++++++>-]<+++++\\n >>+++++++++[<++++++++++++>-]<+++\\n <<<\\n >.+++++++>.++.--.<<.\\n >>-.+++++.----.<<.\\n >>>.<---.+++.>+++.+.+.<.<<.\\n >.>--.+++++.---.++++.\\n -------.+++.<<.\\n >>>++.-------.-.<<<.\\n >+.>>+++++++.---.-----.<<<.\\n <<<<.>>>>.\\n >>----.>++++++++.<+++++.<<.\\n >.>>.---.-----.<<<.\\n <<.>>++++++++++++++.\\n >>>[-]<[-]<[-]<[-]\\n +++++++++++++.---.[-]\\n <<<<<<<\\n >]<\\n >>[<<+>>-]<< step = next\\n ]\\n return with clear stack frame\\n <[-]>[-]>[-]>[-]>[-]>[-]>[-]>[-]<<<<<<\\n <<<<<<<<\\n >>[<<+>>-]<< step = next\\n <\\n]\\n\",\n \"language\": \"Brainf---\"\n },\n {\n \"code\": \"#include <stdio.h>\\n\\nvoid move(int n, int from, int via, int to)\\n{\\n if (n > 1) {\\n move(n - 1, from, to, via);\\n printf(\\\"Move disk from pole %d to pole %d\\\\n\\\", from, to);\\n move(n - 1, via, from, to);\\n } else {\\n printf(\\\"Move disk from pole %d to pole %d\\\\n\\\", from, to);\\n }\\n}\\nint main()\\n{\\n move(4, 1,2,3);\\n return 0;\\n}\\n\",\n \"language\": \"C\"\n },\n {\n \"code\": \"#include <stdio.h>\\n#include <stdlib.h>\\n#include <unistd.h>\\n\\ntypedef struct { int *x, n; } tower;\\ntower *new_tower(int cap)\\n{\\n\\ttower *t = calloc(1, sizeof(tower) + sizeof(int) * cap);\\n\\tt->x = (int*)(t + 1);\\n\\treturn t;\\n}\\n\\ntower *t[3];\\nint height;\\n\\nvoid text(int y, int i, int d, const char *s)\\n{\\n\\tprintf(\\\"\\\\033[%d;%dH\\\", height - y + 1, (height + 1) * (2 * i + 1) - d);\\n\\twhile (d--) printf(\\\"%s\\\", s);\\n}\\n\\nvoid add_disk(int i, int d)\\n{\\n\\tt[i]->x[t[i]->n++] = d;\\n\\ttext(t[i]->n, i, d, \\\"==\\\");\\n\\n\\tusleep(100000);\\n\\tfflush(stdout);\\n}\\n\\nint remove_disk(int i)\\n{\\n\\tint d = t[i]->x[--t[i]->n];\\n\\ttext(t[i]->n + 1, i, d, \\\" \\\");\\n\\treturn d;\\n}\\n\\nvoid move(int n, int from, int to, int via)\\n{\\n\\tif (!n) return;\\n\\n\\tmove(n - 1, from, via, to);\\n\\tadd_disk(to, remove_disk(from));\\n\\tmove(n - 1, via, to, from);\\n}\\n\\nint main(int c, char *v[])\\n{\\n\\tputs(\\\"\\\\033[H\\\\033[J\\\");\\n\\n\\tif (c <= 1 || (height = atoi(v[1])) <= 0)\\n\\t\\theight = 8;\\n\\tfor (c = 0; c < 3; c++)\\t t[c] = new_tower(height);\\n\\tfor (c = height; c; c--) add_disk(0, c);\\n\\n\\tmove(height, 0, 2, 1);\\n\\n\\ttext(1, 0, 1, \\\"\\\\n\\\");\\n\\treturn 0;\\n}\\n\",\n \"language\": \"C\"\n },\n {\n \"code\": \"void move(int n, int from, int to, int via) {\\n if (n == 1) {\\n std::cout << \\\"Move disk from pole \\\" << from << \\\" to pole \\\" << to << std::endl;\\n } else {\\n move(n - 1, from, via, to);\\n move(1, from, to, via);\\n move(n - 1, via, to, from);\\n }\\n}\\n\",\n \"language\": \"C++\"\n },\n {\n \"code\": \"public void move(int n, int from, int to, int via) {\\n if (n == 1) {\\n System.Console.WriteLine(\\\"Move disk from pole \\\" + from + \\\" to pole \\\" + to);\\n } else {\\n move(n - 1, from, via, to);\\n move(1, from, to, via);\\n move(n - 1, via, to, from);\\n }\\n }\\n\",\n \"language\": \"C-sharp\"\n },\n {\n \"code\": \"100 cls\\n110 print \\\"Three disks\\\" : print\\n120 hanoi(3,1,2,3)\\n130 print chr$(10)\\\"Four disks\\\" chr$(10)\\n140 hanoi(4,1,2,3)\\n150 print : print \\\"Towers of Hanoi puzzle completed!\\\"\\n160 end\\n170 sub hanoi(n,desde,hasta,via)\\n180 if n > 0 then\\n190 hanoi(n-1,desde,via,hasta)\\n200 print \\\"Move disk \\\" n \\\"from pole \\\" desde \\\"to pole \\\" hasta\\n210 hanoi(n-1,via,hasta,desde)\\n220 endif\\n230 end sub\\n\",\n \"language\": \"Chipmunk-Basic\"\n },\n {\n \"code\": \"(defn towers-of-hanoi [n from to via]\\n (when (pos? n)\\n (towers-of-hanoi (dec n) from via to)\\n (printf \\\"Move from %s to %s\\\\n\\\" from to)\\n (recur (dec n) via to from)))\\n\",\n \"language\": \"Clojure\"\n },\n {\n \"code\": \"(defn towers-of-hanoi [n from to via]\\n (when (pos? n)\\n (lazy-cat (towers-of-hanoi (dec n) from via to)\\n (cons [from '-> to]\\n (towers-of-hanoi (dec n) via to from)))))\\n\",\n \"language\": \"Clojure\"\n },\n {\n \"code\": \"move = proc (n, from, via, to: int)\\n po: stream := stream$primary_output()\\n if n > 0 then\\n move(n-1, from, to, via)\\n stream$putl(po, \\\"Move disk from pole \\\"\\n || int$unparse(from)\\n || \\\" to pole \\\"\\n || int$unparse(to))\\n move(n-1, via, from, to)\\n end\\nend move\\n\\nstart_up = proc ()\\n move(4, 1, 2, 3)\\nend start_up\\n\",\n \"language\": \"CLU\"\n },\n {\n \"code\": \" >>SOURCE FREE\\nIDENTIFICATION DIVISION.\\nPROGRAM-ID. towers-of-hanoi.\\n\\nPROCEDURE DIVISION.\\n CALL \\\"move-disk\\\" USING 4, 1, 2, 3\\n .\\nEND PROGRAM towers-of-hanoi.\\n\\nIDENTIFICATION DIVISION.\\nPROGRAM-ID. move-disk RECURSIVE.\\n\\nDATA DIVISION.\\nLINKAGE SECTION.\\n01 n PIC 9 USAGE COMP.\\n01 from-pole PIC 9 USAGE COMP.\\n01 to-pole PIC 9 USAGE COMP.\\n01 via-pole PIC 9 USAGE COMP.\\n\\nPROCEDURE DIVISION USING n, from-pole, to-pole, via-pole.\\n IF n > 0\\n SUBTRACT 1 FROM n\\n CALL \\\"move-disk\\\" USING CONTENT n, from-pole, via-pole, to-pole\\n DISPLAY \\\"Move disk from pole \\\" from-pole \\\" to pole \\\" to-pole\\n CALL \\\"move-disk\\\" USING CONTENT n, via-pole, to-pole, from-pole\\n END-IF\\n .\\nEND PROGRAM move-disk.\\n\",\n \"language\": \"COBOL\"\n },\n {\n \"code\": \"IDENTIFICATION DIVISION.\\nPROGRAM-ID. towers-of-hanoi.\\n\\nPROCEDURE DIVISION.\\n CALL \\\"move-disk\\\" USING 4, 1, 2, 3\\n .\\nEND PROGRAM towers-of-hanoi.\\n\\nIDENTIFICATION DIVISION.\\nPROGRAM-ID. move-disk RECURSIVE.\\n\\nDATA DIVISION.\\nLINKAGE SECTION.\\n01 n PIC 9 USAGE COMP.\\n01 from-pole PIC 9 USAGE COMP.\\n01 to-pole PIC 9 USAGE COMP.\\n01 via-pole PIC 9 USAGE COMP.\\n\\nPROCEDURE DIVISION USING n, from-pole, to-pole, via-pole.\\n IF n > 0\\n SUBTRACT 1 FROM n\\n CALL \\\"move-disk\\\" USING CONTENT n, from-pole, via-pole, to-pole\\n ADD 1 TO n\\n DISPLAY \\\"Move disk number \\\"n \\\" from pole \\\" from-pole \\\" to pole \\\" to-pole\\n SUBTRACT 1 FROM n\\n CALL \\\"move-disk\\\" USING CONTENT n, via-pole, to-pole, from-pole\\n END-IF\\n .\\nEND PROGRAM move-disk.\\n\",\n \"language\": \"COBOL\"\n },\n {\n \"code\": \" IDENTIFICATION DIVISION.\\n PROGRAM-ID. ITERATIVE-TOWERS-OF-HANOI.\\n AUTHOR. SOREN ROUG.\\n DATE-WRITTEN. 2019-06-28.\\n ENVIRONMENT DIVISION.\\n CONFIGURATION SECTION.\\n SOURCE-COMPUTER. LINUX.\\n OBJECT-COMPUTER. KAYPRO4.\\n INPUT-OUTPUT SECTION.\\n FILE-CONTROL.\\n DATA DIVISION.\\n WORKING-STORAGE SECTION.\\n 77 NUM-DISKS PIC 9 VALUE 4.\\n 77 N1 PIC 9 COMP.\\n 77 N2 PIC 9 COMP.\\n 77 FROM-POLE PIC 9 COMP.\\n 77 TO-POLE PIC 9 COMP.\\n 77 VIA-POLE PIC 9 COMP.\\n 77 FP-TMP PIC 9 COMP.\\n 77 TO-TMP PIC 9 COMP.\\n 77 P-TMP PIC 9 COMP.\\n 77 TMP-P PIC 9 COMP.\\n 77 I PIC 9 COMP.\\n 77 DIV PIC 9 COMP.\\n 01 STACKNUMS.\\n 05 NUMSET OCCURS 3 TIMES.\\n 10 DNUM PIC 9 COMP.\\n 01 GAMESET.\\n 05 POLES OCCURS 3 TIMES.\\n 10 STACK OCCURS 10 TIMES.\\n 15 POLE PIC 9 USAGE COMP.\\n\\n PROCEDURE DIVISION.\\n HANOI.\\n DISPLAY \\\"TOWERS OF HANOI PUZZLE WITH \\\", NUM-DISKS, \\\" DISKS.\\\".\\n ADD NUM-DISKS, 1 GIVING N1.\\n ADD NUM-DISKS, 2 GIVING N2.\\n MOVE 1 TO DNUM (1).\\n MOVE N1 TO DNUM (2), DNUM (3).\\n MOVE N1 TO POLE (1, N1), POLE (2, N1), POLE (3, N1).\\n MOVE 1 TO POLE (1, N2).\\n MOVE 2 TO POLE (2, N2).\\n MOVE 3 TO POLE (3, N2).\\n MOVE 1 TO I.\\n PERFORM INIT-PUZZLE UNTIL I = N1.\\n MOVE 1 TO FROM-POLE.\\n DIVIDE 2 INTO NUM-DISKS GIVING DIV.\\n MULTIPLY 2 BY DIV.\\n IF DIV NOT = NUM-DISKS PERFORM INITODD ELSE PERFORM INITEVEN.\\n PERFORM MOVE-DISK UNTIL DNUM (3) NOT > 1.\\n DISPLAY \\\"TOWERS OF HANOI PUZZLE COMPLETED!\\\".\\n STOP RUN.\\n INIT-PUZZLE.\\n MOVE I TO POLE (1, I).\\n MOVE 0 TO POLE (2, I), POLE (3, I).\\n ADD 1 TO I.\\n INITEVEN.\\n MOVE 2 TO TO-POLE.\\n MOVE 3 TO VIA-POLE.\\n INITODD.\\n MOVE 3 TO TO-POLE.\\n MOVE 2 TO VIA-POLE.\\n MOVE-DISK.\\n MOVE DNUM (FROM-POLE) TO FP-TMP.\\n MOVE POLE (FROM-POLE, FP-TMP) TO I.\\n DISPLAY \\\"MOVE DISK FROM \\\", POLE (FROM-POLE, N2),\\n \\\" TO \\\", POLE (TO-POLE, N2).\\n ADD 1 TO DNUM (FROM-POLE).\\n MOVE VIA-POLE TO TMP-P.\\n SUBTRACT 1 FROM DNUM (TO-POLE).\\n MOVE DNUM (TO-POLE) TO TO-TMP.\\n MOVE I TO POLE (TO-POLE, TO-TMP).\\n DIVIDE 2 INTO I GIVING DIV.\\n MULTIPLY 2 BY DIV.\\n IF I NOT = DIV PERFORM MOVE-TO-VIA ELSE\\n PERFORM MOVE-FROM-VIA.\\n MOVE-TO-VIA.\\n MOVE TO-POLE TO VIA-POLE.\\n MOVE DNUM (FROM-POLE) TO FP-TMP.\\n MOVE DNUM (TMP-P) TO P-TMP.\\n IF POLE (FROM-POLE, FP-TMP) > POLE (TMP-P, P-TMP)\\n PERFORM MOVE-FROM-TO\\n ELSE MOVE TMP-P TO TO-POLE.\\n MOVE-FROM-TO.\\n MOVE FROM-POLE TO TO-POLE.\\n MOVE TMP-P TO FROM-POLE.\\n MOVE DNUM (FROM-POLE) TO FP-TMP.\\n MOVE DNUM (TMP-P) TO P-TMP.\\n MOVE-FROM-VIA.\\n MOVE FROM-POLE TO VIA-POLE.\\n MOVE TMP-P TO FROM-POLE.\\n\",\n \"language\": \"COBOL\"\n },\n {\n \"code\": \"hanoi = (ndisks, start_peg=1, end_peg=3) ->\\n if ndisks\\n staging_peg = 1 + 2 + 3 - start_peg - end_peg\\n hanoi(ndisks-1, start_peg, staging_peg)\\n console.log \\\"Move disk #{ndisks} from peg #{start_peg} to #{end_peg}\\\"\\n hanoi(ndisks-1, staging_peg, end_peg)\\n\\nhanoi(4)\\n\",\n \"language\": \"CoffeeScript\"\n },\n {\n \"code\": \"(defun move (n from to via)\\n (cond ((= n 1)\\n (format t \\\"Move from ~A to ~A.~%\\\" from to))\\n (t\\n (move (- n 1) from via to)\\n (format t \\\"Move from ~A to ~A.~%\\\" from to)\\n (move (- n 1) via to from))))\\n\",\n \"language\": \"Common-Lisp\"\n },\n {\n \"code\": \"import std.stdio;\\n\\nvoid hanoi(in int n, in char from, in char to, in char via) {\\n if (n > 0) {\\n hanoi(n - 1, from, via, to);\\n writefln(\\\"Move disk %d from %s to %s\\\", n, from, to);\\n hanoi(n - 1, via, to, from);\\n }\\n}\\n\\nvoid main() {\\n hanoi(3, 'L', 'M', 'R');\\n}\\n\",\n \"language\": \"D\"\n },\n {\n \"code\": \"// Code found and then improved by Glenn C. Rhoads,\\n// then some more by M. Kolar (2000).\\nvoid main(in string[] args) {\\n import core.stdc.stdio, std.conv, std.typetuple;\\n\\n immutable size_t n = (args.length > 1) ? args[1].to!size_t : 3;\\n size_t[3] p = [(1 << n) - 1, 0, 0];\\n\\n // Show the start configuration of the pegs.\\n '|'.putchar;\\n foreach_reverse (immutable i; 1 .. n + 1)\\n printf(\\\" %d\\\", i);\\n \\\"\\\\n|\\\\n|\\\".puts;\\n\\n foreach (immutable size_t x; 1 .. (1 << n)) {\\n {\\n immutable size_t i1 = x & (x - 1);\\n immutable size_t fr = (i1 + i1 / 3) & 3;\\n immutable size_t i2 = (x | (x - 1)) + 1;\\n immutable size_t to = (i2 + i2 / 3) & 3;\\n\\n size_t j = 1;\\n for (size_t w = x; !(w & 1); w >>= 1, j <<= 1) {}\\n\\n // Now j is not the number of the disk to move,\\n // it contains the single bit to be moved:\\n p[fr] &= ~j;\\n p[to] |= j;\\n }\\n\\n // Show the current configuration of pegs.\\n foreach (immutable size_t k; TypeTuple!(0, 1, 2)) {\\n \\\"\\\\n|\\\".printf;\\n size_t j = 1 << n;\\n foreach_reverse (immutable size_t w; 1 .. n + 1) {\\n j >>= 1;\\n if (j & p[k])\\n printf(\\\" %zd\\\", w);\\n }\\n }\\n '\\\\n'.putchar;\\n }\\n}\\n\",\n \"language\": \"D\"\n },\n {\n \"code\": \"main() {\\n moveit(from,to) {\\n print(\\\"move ${from} ---> ${to}\\\");\\n }\\n\\n hanoi(height,toPole,fromPole,usePole) {\\n if (height>0) {\\n hanoi(height-1,usePole,fromPole,toPole);\\n moveit(fromPole,toPole);\\n hanoi(height-1,toPole,usePole,fromPole);\\n }\\n }\\n\\n hanoi(3,3,1,2);\\n}\\n\",\n \"language\": \"Dart\"\n },\n {\n \"code\": \"main() {\\n String say(String from, String to) => \\\"$from ---> $to\\\";\\n\\n hanoi(int height, int toPole, int fromPole, int usePole) {\\n if (height > 0) {\\n hanoi(height - 1, usePole, fromPole, toPole);\\n print(say(fromPole.toString(), toPole.toString()));\\n hanoi(height - 1, toPole, usePole, fromPole);\\n }\\n }\\n\\n hanoi(3, 3, 1, 2);\\n}\\n\",\n \"language\": \"Dart\"\n },\n {\n \"code\": \"proc move(byte n, src, via, dest) void:\\n if n>0 then\\n move(n-1, src, dest, via);\\n writeln(\\\"Move disk from pole \\\",src,\\\" to pole \\\",dest);\\n move(n-1, via, src, dest)\\n fi\\ncorp\\n\\nproc nonrec main() void:\\n move(4, 1, 2, 3)\\ncorp\\n\",\n \"language\": \"Draco\"\n },\n {\n \"code\": \"func hanoi(n, a, b, c) {\\n if n > 0 {\\n hanoi(n - 1, a, c, b)\\n print(\\\"Move disk from \\\\(a) to \\\\(c)\\\")\\n hanoi(n - 1, b, a, c)\\n }\\n}\\n\\nhanoi(4, \\\"A\\\", \\\"B\\\", \\\"C\\\")\\n\",\n \"language\": \"Dyalect\"\n },\n {\n \"code\": \"def move(out, n, fromPeg, toPeg, viaPeg) {\\n if (n.aboveZero()) {\\n move(out, n.previous(), fromPeg, viaPeg, toPeg)\\n out.println(`Move disk $n from $fromPeg to $toPeg.`)\\n move(out, n.previous(), viaPeg, toPeg, fromPeg)\\n }\\n}\\n\\nmove(stdout, 4, def left {}, def right {}, def middle {})\\n\",\n \"language\": \"E\"\n },\n {\n \"code\": \"proc hanoi n src dst aux . .\\n if n >= 1\\n hanoi n - 1 src aux dst\\n print \\\"Move \\\" & src & \\\" to \\\" & dst\\n hanoi n - 1 aux dst src\\n .\\n.\\nhanoi 5 1 2 3\\n\",\n \"language\": \"EasyLang\"\n },\n {\n \"code\": \"[Towers of Hanoi task for Rosetta Code.]\\n[EDSAC program, Initial Orders 2.]\\n\\n T100K [load program at location 100 (arbitrary)]\\n GK\\n[Number of discs, in the address field]\\n [0] P3F [<--- edit here, value 1..9]\\n[Letters to represent the rods]\\n [1] LF [left]\\n [2] CF [centre]\\n [3] RF [right]\\n\\n[Main routine. Enter with acc = 0]\\n [4] T1F [1F := 0]\\n [5] A5@ [initialize recursive subroutine]\\n G104@\\n A@ [number of discs]\\n T1F [pass to subroutines]\\n A1@ [source rod]\\n T4F [pass to subroutines]\\n A3@ [target rod]\\n T5F [pass to subroutines]\\n [13] A13@ [call subroutine to write header ]\\n G18@\\n [15] A15@ [call recursive subroutine to write moves ]\\n G104@\\n ZF [stop]\\n\\n[Subroutine to write a header]\\n[Input: 1F = number of discs (in the address field)]\\n [4F = letter for starting rod]\\n [5F = letter for ending rod]\\n[Output: None. 1F, 4F, 5F must be preserved.]\\n [18] A3F [plant return link as usual]\\n T35@\\n A1F [number of discs]\\n L512F [shift 11 left to make output char]\\n T39@ [plant in message]\\n A4F [starting rod]\\n T53@ [plant in message]\\n A5F [ending rod]\\n T58@ [plant in message]\\n A36@ [O order for first char of message]\\n E30@ [skip next order (code for 'O' is positive)]\\n [29] A37@ [restore acc after test below]\\n [30] U31@ [plant order to write next character]\\n [31] OF [(planted) write next character]\\n A2F [inc address in previous order]\\n S37@ [finished yet?]\\n G29@ [if not, loop back]\\n [35] ZF [(planted) exit with acc = 0]\\n [36] O38@ [O order for start of message]\\n [37] O61@ [O order for exclusive end of message]\\n [38] #F\\n [39] PFK2048F!FDFIFSFCFSF!FFFRFOFMF!F\\n [53] PF!FTFOF!F\\n [58] PF@F&F\\n [61]\\n\\n[Subroutine to write a move of one disc.]\\n[Input: 1F = disc number 1..9 (in the address field)]\\n [4F = letter for source rod]\\n [5F = letter for target rod]\\n[Output: None. 1F, 4F, 5F must be preserved.]\\n[Condensed to save space; very similar to previous subroutine.]\\n [61] A3FT78@A1FL512FT88@ A4FT96@A5FT101@A79@E73@\\n [72] A80@\\n [73] U74@\\n [74] OFA2FS80@G72@\\n [78] ZF [(planted) exit with acc = 0]\\n [79] O81@\\n [80] O104@\\n [81] K2048FMFOFVFEF!F#F\\n [88] PFK2048F!FFFRFOFMF!F\\n [96] PF!FTFOF!F\\n [101] PF@F&F\\n [104]\\n\\n[Recursive subroutine to move discs 1..n, where 1 <= n <= 9.]\\n[Call with n = 0 to initialize.]\\n[Input: 1F = n (in the address field)]\\n [4F = letter for source rod]\\n [5F = letter for target rod]\\n[Output: None. 1F, 4F, 5F must be preserved.]\\n [104] A3F [plant link as usual ]\\n T167@\\n[The link will be saved in a stack if recursive calls are required.]\\n S1F [load -n]\\n G115@ [jump if n > 0]\\n[Here if n = 0. Initialize; no recursive calls.]\\n A169@ [initialize push order to start of stack]\\n T122@\\n A1@ [find total of the codes for the rod letters]\\n A2@\\n A3@\\n T168@ [store for future use]\\n E167@ [jump to link]\\n[Here with acc = -n in address field]\\n [115] A2F [add 1]\\n G120@ [jump if n > 1]\\n[Here if n = 1. Just write the move; no recursive calls.]\\n [117] A117@ [call write subroutine]\\n G61@\\n E167@ [jump to link]\\n[Here if n > 1. Recursive calls are required.]\\n [120] TF [clear acc]\\n A167@ [load link order]\\n [122] TF [(planted) push link order onto stack]\\n A122@ [inc address in previous order]\\n A2F\\n T122@\\n[First recursive call. Modify parameters 1F and 5F; 4F stays the same]\\n A1F [load n]\\n S2F [make n - 1]\\n T1F [pass as parameter]\\n A168@ [get 3rd rod, neither source nor target]\\n S4F\\n S5F\\n T5F\\n [133] A133@ [recursive call]\\n G104@\\n[Returned, restore parameters]\\n A1F\\n A2F\\n T1F\\n A168@\\n S4F\\n S5F\\n T5F\\n[Write move of largest disc]\\n [142] A142@\\n G61@\\n[Second recursive call. Modify parameters 1F and 4F; 5F stays the same]\\n[Condensed to save space; very similar to first recursice call.]\\n A1FS2FT1FA168@S4FS5FT4F\\n [151] A151@G104@A1FA2FT1FA168@S4FS5FT4F\\n[Pop return link off stack]\\n A122@ [dec address in push order]\\n S2F\\n U122@\\n A170@ [make A order with same address]\\n T165@ [plant in code]\\n [165] AF [(planted) pop return link from stack]\\n T167@ [plant in code]\\n [167] ZF [(planted) return to caller]\\n[Constants]\\n [168] PF [(planted) sum of letters for rods]\\n [169] T171@ [T order for start of stack]\\n [170] MF [add to T order to make A order, same address]\\n[Stack: placed at end of program, grows into free space.]\\n [171]\\n E4Z [define entry point]\\n PF [acc = 0 on entry]\\n[end]\\n\",\n \"language\": \"EDSAC-order-code\"\n },\n {\n \"code\": \"class\\n\\tAPPLICATION\\n\\ncreate\\n\\tmake\\n\\nfeature {NONE} -- Initialization\\n\\n\\tmake\\n\\t\\tdo\\n\\t\\t\\tmove (4, \\\"A\\\", \\\"B\\\", \\\"C\\\")\\n\\t\\tend\\n\\nfeature -- Towers of Hanoi\\n\\n\\tmove (n: INTEGER; frm, to, via: STRING)\\n\\t\\trequire\\n\\t\\t\\tn > 0\\n\\t do\\n\\t\\t\\tif n = 1 then\\n \\t\\t\\tprint (\\\"Move disk from pole \\\" + frm + \\\" to pole \\\" + to + \\\"%N\\\")\\n \\t\\telse\\n \\t\\t\\tmove (n - 1, frm, via, to)\\n \\t\\t\\tmove (1, frm, to, via)\\n \\t\\t\\tmove (n - 1, via, to, frm)\\n\\t end\\n\\t end\\nend\\n\",\n \"language\": \"Eiffel\"\n },\n {\n \"code\": \"open monad io\\n:::IO\\n\\n//Functional approach\\nhanoi 0 _ _ _ = []\\nhanoi n a b c = hanoi (n - 1) a c b ++ [(a,b)] ++ hanoi (n - 1) c b a\\n\\nhanoiIO n = mapM_ f $ hanoi n 1 2 3 where\\n f (x,y) = putStrLn $ \\\"Move \\\" ++ show x ++ \\\" to \\\" ++ show y\\n\\n//Imperative approach using IO monad\\nhanoiM n = hanoiM' n 1 2 3 where\\n hanoiM' 0 _ _ _ = return ()\\n hanoiM' n a b c = do\\n hanoiM' (n - 1) a c b\\n putStrLn $ \\\"Move \\\" ++ show a ++ \\\" to \\\" ++ show b\\n hanoiM' (n - 1) c b a\\n\",\n \"language\": \"Ela\"\n },\n {\n \"code\": \"move = (n,from,to,via)\\n{\\n if (n == 1)\\n {\\n console.printLine(\\\"Move disk from pole \\\",from,\\\" to pole \\\",to)\\n }\\n else\\n {\\n move(n-1,from,via,to);\\n move(1,from,to,via);\\n move(n-1,via,to,from)\\n }\\n};\\n\",\n \"language\": \"Elena\"\n },\n {\n \"code\": \"defmodule RC do\\n def hanoi(n) when 0<n and n<10, do: hanoi(n, 1, 2, 3)\\n\\n defp hanoi(1, f, _, t), do: move(f, t)\\n defp hanoi(n, f, u, t) do\\n hanoi(n-1, f, t, u)\\n move(f, t)\\n hanoi(n-1, u, f, t)\\n end\\n\\n defp move(f, t), do: IO.puts \\\"Move disk from #{f} to #{t}\\\"\\nend\\n\\nRC.hanoi(3)\\n\",\n \"language\": \"Elixir\"\n },\n {\n \"code\": \"(defun move (n from to via)\\n (if (= n 1)\\n (message \\\"Move from %S to %S\\\" from to)\\n (move (- n 1) from via to)\\n (message \\\"Move from %S to %S\\\" from to)\\n (move (- n 1) via to from)))\\n\",\n \"language\": \"Emacs-Lisp\"\n },\n {\n \"code\": \"fun move = void by int n, int from, int to, int via\\n if n == 1\\n writeLine(\\\"Move disk from pole \\\" + from + \\\" to pole \\\" + to)\\n return\\n end\\n move(n - 1, from, via, to)\\n move(1, from, to, via)\\n move(n - 1, via, to, from)\\nend\\nmove(3, 1, 2, 3)\\n\",\n \"language\": \"EMal\"\n },\n {\n \"code\": \"move(1, F, T, _V) ->\\n io:format(\\\"Move from ~p to ~p~n\\\", [F, T]);\\nmove(N, F, T, V) ->\\n move(N-1, F, V, T),\\n move(1 , F, T, V),\\n move(N-1, V, T, F).\\n\",\n \"language\": \"Erlang\"\n },\n {\n \"code\": \"!-----------------------------------------------------------\\n! HANOI.R : solve tower of Hanoi puzzle using a recursive\\n! modified algorithm.\\n!-----------------------------------------------------------\\n\\nPROGRAM HANOI\\n\\n!$INTEGER\\n\\n!VAR I,J,MOSSE,NUMBER\\n\\nPROCEDURE PRINTMOVE\\n LOCAL SOURCE$,DEST$\\n MOSSE=MOSSE+1\\n CASE I OF\\n 1-> SOURCE$=\\\"Left\\\" END ->\\n 2-> SOURCE$=\\\"Center\\\" END ->\\n 3-> SOURCE$=\\\"Right\\\" END ->\\n END CASE\\n CASE J OF\\n 1-> DEST$=\\\"Left\\\" END ->\\n 2-> DEST$=\\\"Center\\\" END ->\\n 3-> DEST$=\\\"Right\\\" END ->\\n END CASE\\n PRINT(\\\"I move a disk from \\\";SOURCE$;\\\" to \\\";DEST$)\\nEND PROCEDURE\\n\\nPROCEDURE MOVE\\n IF NUMBER<>0 THEN\\n NUMBER=NUMBER-1\\n J=6-I-J\\n MOVE\\n J=6-I-J\\n PRINTMOVE\\n I=6-I-J\\n MOVE\\n I=6-I-J\\n NUMBER=NUMBER+1\\n END IF\\nEND PROCEDURE\\n\\nBEGIN\\n MAXNUM=12\\n MOSSE=0\\n PRINT(CHR$(12);TAB(25);\\\"--- TOWERS OF HANOI ---\\\")\\n REPEAT\\n PRINT(\\\"Number of disks \\\";)\\n INPUT(NUMBER)\\n UNTIL NUMBER>1 AND NUMBER<=MAXNUM\\n PRINT\\n PRINT(\\\"For \\\";NUMBER;\\\"disks the total number of moves is\\\";2^NUMBER-1)\\n I=1 ! number of source pole\\n J=3 ! number of destination pole\\n MOVE\\nEND PROGRAM\\n\",\n \"language\": \"ERRE\"\n },\n {\n \"code\": \"SHOWHANOI\\n=LAMBDA(n,\\n FILTERP(\\n LAMBDA(x, \\\"\\\" <> x)\\n )(\\n HANOI(n)(\\\"left\\\")(\\\"right\\\")(\\\"mid\\\")\\n )\\n)\\n\\n\\nHANOI\\n=LAMBDA(n,\\n LAMBDA(l,\\n LAMBDA(r,\\n LAMBDA(m,\\n IF(0 = n,\\n \\\"\\\",\\n LET(\\n next, n - 1,\\n APPEND(\\n APPEND(\\n HANOI(next)(l)(m)(r)\\n )(\\n CONCAT(l, \\\" -> \\\", r)\\n )\\n )(\\n HANOI(next)(m)(r)(l)\\n )\\n )\\n )\\n )\\n )\\n )\\n)\\n\",\n \"language\": \"Excel\"\n },\n {\n \"code\": \"APPEND\\n=LAMBDA(xs,\\n LAMBDA(ys,\\n LET(\\n nx, ROWS(xs),\\n rowIndexes, SEQUENCE(nx + ROWS(ys)),\\n colIndexes, SEQUENCE(\\n 1,\\n MAX(COLUMNS(xs), COLUMNS(ys))\\n ),\\n IF(\\n rowIndexes <= nx,\\n INDEX(xs, rowIndexes, colIndexes),\\n INDEX(ys, rowIndexes - nx, colIndexes)\\n )\\n )\\n )\\n)\\n\\n\\nFILTERP\\n=LAMBDA(p,\\n LAMBDA(xs,\\n FILTER(xs, p(xs))\\n )\\n)\\n\",\n \"language\": \"Excel\"\n },\n {\n \"code\": \"# (C) 2013 Ezhil Language Project\\n# Tower of Hanoi – recursive solution\\n\\nநிரல்பாகம் ஹோனாய்(வட்டுகள், முதல்அச்சு, இறுதிஅச்சு,வட்டு)\\n\\n @(வட்டுகள் == 1 ) ஆனால்\\n பதிப்பி “வட்டு ” + str(வட்டு) + “ஐ \\\\t (” + str(முதல்அச்சு) + “ —> ” + str(இறுதிஅச்சு)+ “) அச்சிற்கு நகர்த்துக.”\\n இல்லை\\n\\n @( [\\\"இ\\\", \\\"அ\\\", \\\"ஆ\\\"] இல் அச்சு ) ஒவ்வொன்றாக\\n @( (முதல்அச்சு != அச்சு) && (இறுதிஅச்சு != அச்சு) ) ஆனால்\\n நடு = அச்சு\\n முடி\\n முடி\\n\\n # solve problem for n-1 again between src and temp pegs\\n ஹோனாய்(வட்டுகள்-1, முதல்அச்சு,நடு,வட்டுகள்-1)\\n\\n # move largest disk from src to destination\\n ஹோனாய்(1, முதல்அச்சு, இறுதிஅச்சு,வட்டுகள்)\\n\\n # solve problem for n-1 again between different pegs\\n ஹோனாய்(வட்டுகள்-1, நடு, இறுதிஅச்சு,வட்டுகள்-1)\\n முடி\\nமுடி\\n\\nஹோனாய்(4,”அ”,”ஆ”,0)\\n\",\n \"language\": \"Ezhil\"\n },\n {\n \"code\": \"#light\\nlet rec hanoi num start finish =\\n match num with\\n | 0 -> [ ]\\n | _ -> let temp = (6 - start - finish)\\n (hanoi (num-1) start temp) @ [ start, finish ] @ (hanoi (num-1) temp finish)\\n\\n[<EntryPoint>]\\nlet main args =\\n (hanoi 4 1 2) |> List.iter (fun pair -> match pair with\\n | a, b -> printf \\\"Move disc from %A to %A\\\\n\\\" a b)\\n 0\\n\",\n \"language\": \"F-Sharp\"\n },\n {\n \"code\": \"USING: formatting kernel locals math ;\\nIN: rosettacode.hanoi\\n\\n: move ( from to -- )\\n \\\"%d->%d\\\\n\\\" printf ;\\n:: hanoi ( n from to other -- )\\n n 0 > [\\n n 1 - from other to hanoi\\n from to move\\n n 1 - other to from hanoi\\n ] when ;\\n\",\n \"language\": \"Factor\"\n },\n {\n \"code\": \"[\\\"Move disk from \\\"$!\\\\\\\" to \\\"$!\\\\\\\"\\n\\\"]p: { to from }\\n[n;0>[n;1-n: @\\\\ h;! @\\\\ p;! \\\\@ h;! \\\\@ n;1+n:]?]h: { via to from }\\n4n:[\\\"right\\\"][\\\"middle\\\"][\\\"left\\\"]h;!%%%\\n\",\n \"language\": \"FALSE\"\n },\n {\n \"code\": \"Func Hanoi( n, f, t, v ) =\\nif n = 0 then\\n !'';\\nelse\\n Hanoi(n - 1, f, v, t);\\n !f;!' -> ';!t;!', ';\\n Hanoi(n - 1, v, t, f)\\nfi.\\n\",\n \"language\": \"Fermat\"\n },\n {\n \"code\": \"01.10 S N=4;S S=1;S V=2;S T=3\\n01.20 D 2\\n01.30 Q\\n\\n02.02 S N(D)=N(D)-1;I (N(D)),2.2,2.04\\n02.04 S D=D+1\\n02.06 S N(D)=N(D-1);S S(D)=S(D-1)\\n02.08 S T(D)=V(D-1);S V(D)=T(D-1)\\n02.10 D 2\\n02.12 S D=D-1\\n02.14 D 3\\n02.16 S A=S(D);S S(D)=V(D);S V(D)=A\\n02.18 G 2.02\\n02.20 D 3\\n\\n03.10 T %1,\\\"MOVE DISK FROM POLE\\\",S(D)\\n03.20 T \\\" TO POLE\\\",T(D),!\\n\",\n \"language\": \"FOCAL\"\n },\n {\n \"code\": \"CREATE peg1 ,\\\" left \\\"\\nCREATE peg2 ,\\\" middle \\\"\\nCREATE peg3 ,\\\" right \\\"\\n\\n: .$ COUNT TYPE ;\\n: MOVE-DISK\\n LOCALS| via to from n |\\n n 1 =\\n IF CR .\\\" Move disk from \\\" from .$ .\\\" to \\\" to .$\\n ELSE n 1- from via to RECURSE\\n 1 from to via RECURSE\\n n 1- via to from RECURSE\\n THEN ;\\n\",\n \"language\": \"Forth\"\n },\n {\n \"code\": \": left .\\\" left\\\" ;\\n: right .\\\" right\\\" ;\\n: middle .\\\" middle\\\" ;\\n\\n: move-disk ( v t f n -- v t f )\\n dup 0= if drop exit then\\n 1- >R\\n rot swap R@ ( t v f n-1 ) recurse\\n rot swap\\n 2dup cr .\\\" Move disk from \\\" execute .\\\" to \\\" execute\\n swap rot R> ( f t v n-1 ) recurse\\n swap rot ;\\n: hanoi ( n -- )\\n 1 max >R ['] right ['] middle ['] left R> move-disk drop drop drop ;\\n\",\n \"language\": \"Forth\"\n },\n {\n \"code\": \"PROGRAM TOWER\\n\\n CALL Move(4, 1, 2, 3)\\n\\nCONTAINS\\n\\n RECURSIVE SUBROUTINE Move(ndisks, from, to, via)\\n INTEGER, INTENT (IN) :: ndisks, from, to, via\\n\\n IF (ndisks == 1) THEN\\n WRITE(*, \\\"(A,I1,A,I1)\\\") \\\"Move disk from pole \\\", from, \\\" to pole \\\", to\\n ELSE\\n CALL Move(ndisks-1, from, via, to)\\n CALL Move(1, from, to, via)\\n CALL Move(ndisks-1, via, to, from)\\n END IF\\n END SUBROUTINE Move\\n\\nEND PROGRAM TOWER\\n\",\n \"language\": \"Fortran\"\n },\n {\n \"code\": \"PROGRAM TOWER2\\n\\n CALL Move(4, 1, 2, 3)\\n\\nCONTAINS\\n\\n RECURSIVE SUBROUTINE Move(ndisks, from, via, to)\\n INTEGER, INTENT (IN) :: ndisks, from, via, to\\n\\n IF (ndisks > 1) THEN\\n CALL Move(ndisks-1, from, to, via)\\n WRITE(*, \\\"(A,I1,A,I1,A,I1)\\\") \\\"Move disk \\\", ndisks, \\\" from pole \\\", from, \\\" to pole \\\", to\\n Call Move(ndisks-1,via,from,to)\\n ELSE\\n WRITE(*, \\\"(A,I1,A,I1,A,I1)\\\") \\\"Move disk \\\", ndisks, \\\" from pole \\\", from, \\\" to pole \\\", to\\n END IF\\n END SUBROUTINE Move\\n\\nEND PROGRAM TOWER2\\n\",\n \"language\": \"Fortran\"\n },\n {\n \"code\": \"' FB 1.05.0 Win64\\n\\nSub move(n As Integer, from As Integer, to_ As Integer, via As Integer)\\n If n > 0 Then\\n move(n - 1, from, via, to_)\\n Print \\\"Move disk\\\"; n; \\\" from pole\\\"; from; \\\" to pole\\\"; to_\\n move(n - 1, via, to_, from)\\n End If\\nEnd Sub\\n\\nPrint \\\"Three disks\\\" : Print\\nmove 3, 1, 2, 3\\nPrint\\nPrint \\\"Four disks\\\" : Print\\nmove 4, 1, 2, 3\\nPrint \\\"Press any key to quit\\\"\\nSleep\\n\",\n \"language\": \"FreeBASIC\"\n },\n {\n \"code\": \"/** Set up the recursive call for n disks */\\nhanoi[n] := hanoi[n, 1, 3, 2]\\n\\n/** The recursive call. */\\nhanoi[n, source, target, aux] :=\\n{\\n if n > 0\\n {\\n hanoi[n-1, source, aux, target]\\n println[\\\"Move from $source to $target\\\"]\\n hanoi[n-1, aux, target, source]\\n }\\n}\\n\\nhanoi[7]\\n\",\n \"language\": \"Frink\"\n },\n {\n \"code\": \"window 1, @\\\"Towers of Hanoi\\\", ( 0, 0, 300, 300 )\\n\\nvoid local fn Move( n as long, fromPeg as long, toPeg as long, viaPeg as long )\\n if n > 0\\n fn Move( n-1, fromPeg, viaPeg, toPeg )\\n print \\\"Move disk from \\\"; fromPeg; \\\" to \\\"; toPeg\\n fn Move( n-1, viaPeg, toPeg, fromPeg )\\n end if\\nend fn\\n\\nfn Move( 4, 1, 2, 3 )\\nprint\\nprint \\\"Towers of Hanoi puzzle solved.\\\"\\n\\nHandleEvents\\n\",\n \"language\": \"FutureBasic\"\n },\n {\n \"code\": \"Public Sub Main()\\n\\n Print \\\"Three disks\\\\n\\\"\\n move_(3, 1, 2, 3)\\n Print\\n Print \\\"Four disks\\\\n\\\"\\n move_(4, 1, 2, 3)\\n\\nEnd\\n\\nPublic Sub move_(n As Integer, from As Integer, to As Integer, via As Integer)\\n\\n If n > 0 Then\\n move_(n - 1, from, via, to)\\n Print \\\"Move disk \\\"; n; \\\" from pole \\\"; from; \\\" to pole \\\"; to\\n move_(n - 1, via, to, from)\\n End If\\n\\nEnd Sub\\n\",\n \"language\": \"Gambas\"\n },\n {\n \"code\": \"Hanoi := function(n)\\n\\tlocal move;\\n\\tmove := function(n, a, b, c) # from, through, to\\n\\t\\tif n = 1 then\\n\\t\\t\\tPrint(a, \\\" -> \\\", c, \\\"\\\\n\\\");\\n\\t\\telse\\n\\t\\t\\tmove(n - 1, a, c, b);\\n\\t\\t\\tmove(1, a, b, c);\\n\\t\\t\\tmove(n - 1, b, a, c);\\n\\t\\tfi;\\n\\tend;\\n\\tmove(n, \\\"A\\\", \\\"B\\\", \\\"C\\\");\\nend;\\n\\nHanoi(1);\\n# A -> C\\n\\nHanoi(2);\\n# A -> B\\n# A -> C\\n# B -> C\\n\\nHanoi(3);\\n# A -> C\\n# A -> B\\n# C -> B\\n# A -> C\\n# B -> A\\n# B -> C\\n# A -> C\\n\",\n \"language\": \"GAP\"\n },\n {\n \"code\": \"package main\\n\\nimport \\\"fmt\\\"\\n\\n// a towers of hanoi solver just has one method, play\\ntype solver interface {\\n play(int)\\n}\\n\\nfunc main() {\\n var t solver // declare variable of solver type\\n t = new(towers) // type towers must satisfy solver interface\\n t.play(4)\\n}\\n\\n// towers is example of type satisfying solver interface\\ntype towers struct {\\n // an empty struct. some other solver might fill this with some\\n // data representation, maybe for algorithm validation, or maybe for\\n // visualization.\\n}\\n\\n// play is sole method required to implement solver type\\nfunc (t *towers) play(n int) {\\n // drive recursive solution, per task description\\n t.moveN(n, 1, 2, 3)\\n}\\n\\n// recursive algorithm\\nfunc (t *towers) moveN(n, from, to, via int) {\\n if n > 0 {\\n t.moveN(n-1, from, via, to)\\n t.move1(from, to)\\n t.moveN(n-1, via, to, from)\\n }\\n}\\n\\n// example function prints actions to screen.\\n// enhance with validation or visualization as needed.\\nfunc (t *towers) move1(from, to int) {\\n fmt.Println(\\\"move disk from rod\\\", from, \\\"to rod\\\", to)\\n}\\n\",\n \"language\": \"Go\"\n },\n {\n \"code\": \"package main\\n\\nimport \\\"fmt\\\"\\n\\nfunc main() {\\n\\tmove(3, \\\"A\\\", \\\"B\\\", \\\"C\\\")\\n}\\n\\nfunc move(n uint64, a, b, c string) {\\n\\tif n > 0 {\\n\\t\\tmove(n-1, a, c, b)\\n\\t\\tfmt.Println(\\\"Move disk from \\\" + a + \\\" to \\\" + c)\\n\\t\\tmove(n-1, b, a, c)\\n\\t}\\n}\\n\",\n \"language\": \"Go\"\n },\n {\n \"code\": \"def tail = { list, n -> def m = list.size(); list.subList([m - n, 0].max(),m) }\\n\\nfinal STACK = [A:[],B:[],C:[]].asImmutable()\\n\\ndef report = { it -> }\\ndef check = { it -> }\\n\\ndef moveRing = { from, to -> to << from.pop(); report(); check(to) }\\n\\ndef moveStack\\nmoveStack = { from, to, using = STACK.values().find { !(it.is(from) || it.is(to)) } ->\\n if (!from) return\\n def n = from.size()\\n moveStack(tail(from, n-1), using, to)\\n moveRing(from, to)\\n moveStack(tail(using, n-1), to, from)\\n}\\n\",\n \"language\": \"Groovy\"\n },\n {\n \"code\": \"enum Ring {\\n S('°'), M('o'), L('O'), XL('( )');\\n private sym\\n private Ring(sym) { this.sym=sym }\\n String toString() { sym }\\n}\\n\\nreport = { STACK.each { k, v -> println \\\"${k}: ${v}\\\" }; println() }\\ncheck = { to -> assert to == ([] + to).sort().reverse() }\\n\\nRing.values().reverseEach { STACK.A << it }\\nreport()\\ncheck(STACK.A)\\nmoveStack(STACK.A, STACK.C)\\n\",\n \"language\": \"Groovy\"\n },\n {\n \"code\": \"hanoi :: Integer -> a -> a -> a -> [(a, a)]\\nhanoi 0 _ _ _ = []\\nhanoi n a b c = hanoi (n-1) a c b ++ [(a,b)] ++ hanoi (n-1) c b a\\n\",\n \"language\": \"Haskell\"\n },\n {\n \"code\": \"hanoi :: Integer -> a -> a -> a -> [(a, a)]\\n\\nhanoi n a b c = hanoiToList n a b c []\\n where\\n hanoiToList 0 _ _ _ l = l\\n hanoiToList n a b c l = hanoiToList (n-1) a c b ((a, b) : hanoiToList (n-1) c b a l)\\n\",\n \"language\": \"Haskell\"\n },\n {\n \"code\": \"hanoiIO n = mapM_ f $ hanoi n 1 2 3 where\\n f (x,y) = putStrLn $ \\\"Move \\\" ++ show x ++ \\\" to \\\" ++ show y\\n\",\n \"language\": \"Haskell\"\n },\n {\n \"code\": \"hanoiM :: Integer -> IO ()\\nhanoiM n = hanoiM' n 1 2 3 where\\n hanoiM' 0 _ _ _ = return ()\\n hanoiM' n a b c = do\\n hanoiM' (n-1) a c b\\n putStrLn $ \\\"Move \\\" ++ show a ++ \\\" to \\\" ++ show b\\n hanoiM' (n-1) c b a\\n\",\n \"language\": \"Haskell\"\n },\n {\n \"code\": \"-------------------------- HANOI -------------------------\\n\\nhanoi ::\\n Int ->\\n String ->\\n String ->\\n String ->\\n [(String, String)]\\nhanoi 0 _ _ _ = mempty\\nhanoi n l r m =\\n hanoi (n - 1) l m r\\n <> [(l, r)]\\n <> hanoi (n - 1) m r l\\n\\n--------------------------- TEST -------------------------\\nmain :: IO ()\\nmain = putStrLn $ showHanoi 5\\n\\n------------------------- DISPLAY ------------------------\\nshowHanoi :: Int -> String\\nshowHanoi n =\\n unlines $\\n fmap\\n ( \\\\(from, to) ->\\n concat [justifyRight 5 ' ' from, \\\" -> \\\", to]\\n )\\n (hanoi n \\\"left\\\" \\\"right\\\" \\\"mid\\\")\\n\\njustifyRight :: Int -> Char -> String -> String\\njustifyRight n c = (drop . length) <*> (replicate n c <>)\\n\",\n \"language\": \"Haskell\"\n },\n {\n \"code\": \"U0 Move(U8 n, U8 from, U8 to, U8 via) {\\n if (n > 0) {\\n Move(n - 1, from, via, to);\\n Print(\\\"Move disk from pole %d to pole %d\\\\n\\\", from, to);\\n Move(n - 1, via, to, from);\\n }\\n}\\n\\nMove(4, 1, 2, 3);\\n\",\n \"language\": \"HolyC\"\n },\n {\n \"code\": \"procedure main(arglist)\\nhanoi(arglist[1]) | stop(\\\"Usage: hanoi n\\\\n\\\\rWhere n is the number of disks to move.\\\")\\nend\\n\\n#procedure hanoi(n:integer, needle1:1, needle2:2) # unicon shorthand for icon code 1,2,3 below\\n\\nprocedure hanoi(n, needle1, needle2) #: solve towers of hanoi by moving n disks from needle 1 to needle2 via other\\nlocal other\\n\\nn := integer(0 < n) | runerr(n,101) # 1 ensure integer (this also ensures it's positive too)\\n/needle1 := 1 # 2 default\\n/needle2 := 2 # 3 default\\n\\nif n = 1 then\\n write(\\\"Move disk from \\\", needle1, \\\" to \\\", needle2)\\nelse {\\n other := 6 - needle1 - needle2 # clever but somewhat un-iconish way to find other\\n hanoi(n-1, needle1, other)\\n write(\\\"Move disk from \\\", needle1, \\\" to \\\", needle2)\\n hanoi(n-1, other, needle2)\\n}\\nreturn\\nend\\n\",\n \"language\": \"Icon\"\n },\n {\n \"code\": \"Hanoi is a room.\\n\\nA post is a kind of supporter. A post is always fixed in place.\\n\\nThe left post, the middle post, and the right post are posts in Hanoi.\\n\\nA disk is a kind of supporter.\\nThe red disk is a disk on the left post.\\nThe orange disk is a disk on the red disk.\\nThe yellow disk is a disk on the orange disk.\\nThe green disk is a disk on the yellow disk.\\n\\nDefinition: a disk is topmost if nothing is on it.\\n\\nWhen play begins:\\n\\tmove 4 disks from the left post to the right post via the middle post.\\n\\nTo move (N - number) disk/disks from (FP - post) to (TP - post) via (VP - post):\\n\\tif N > 0:\\n\\t\\tmove N - 1 disks from FP to VP via TP;\\n\\t\\tsay \\\"Moving a disk from [FP] to [TP]...\\\";\\n\\t\\tlet D be a random topmost disk enclosed by FP;\\n\\t\\tif a topmost disk (called TD) is enclosed by TP, now D is on TD;\\n\\t\\totherwise now D is on TP;\\n\\t\\tmove N - 1 disks from VP to TP via FP.\\n\",\n \"language\": \"Inform-7\"\n },\n {\n \"code\": \"hanoi := method(n, from, to, via,\\n if (n == 1) then (\\n writeln(\\\"Move from \\\", from, \\\" to \\\", to)\\n ) else (\\n hanoi(n - 1, from, via, to )\\n hanoi(1 , from, to , via )\\n hanoi(n - 1, via , to , from)\\n )\\n)\\n\",\n \"language\": \"Io\"\n },\n {\n \"code\": \" = method(n, f, u, t,\\n if(n < 2,\\n \\\"#{f} --> #{t}\\\" println,\\n\\n H(n - 1, f, t, u)\\n \\\"#{f} --> #{t}\\\" println\\n H(n - 1, u, f, t)\\n )\\n)\\n\\nhanoi = method(n,\\n H(n, 1, 2, 3)\\n)\\n\",\n \"language\": \"Ioke\"\n },\n {\n \"code\": \"100 PROGRAM \\\"Hanoi.bas\\\"\\n110 CALL HANOI(4,1,3,2)\\n120 DEF HANOI(DISK,FRO,TO,WITH)\\n130 IF DISK>0 THEN\\n140 CALL HANOI(DISK-1,FRO,WITH,TO)\\n150 PRINT \\\"Move disk\\\";DISK;\\\"from\\\";FRO;\\\"to\\\";TO\\n160 CALL HANOI(DISK-1,WITH,TO,FRO)\\n170 END IF\\n180 END DEF\\n\",\n \"language\": \"IS-BASIC\"\n },\n {\n \"code\": \"H =: i.@,&2 ` (({&0 2 1,0 2,{&1 0 2)@$:@<:) @. * NB. tacit using anonymous recursion\\n\",\n \"language\": \"J\"\n },\n {\n \"code\": \" H 3\\n0 2\\n0 1\\n2 1\\n0 2\\n1 2\\n1 0\\n2 0\\n\",\n \"language\": \"J\"\n },\n {\n \"code\": \"H1=: monad define NB. explicit equivalent of H\\n if. y do.\\n ({&0 2 1 , 0 2 , {&1 0 2) H1 y-1\\n else.\\n i.0 2\\n end.\\n)\\n\",\n \"language\": \"J\"\n },\n {\n \"code\": \"hanoi=: monad define\\n moves=. H y\\n disks=. $~` ((],[,]) $:@<:) @.* y\\n ('move disk ';' from peg ';' to peg ');@,.\\\"1 \\\":&.>disks,.1+moves\\n)\\n\",\n \"language\": \"J\"\n },\n {\n \"code\": \" hanoi 3\\nmove disk 1 from peg 1 to peg 3\\nmove disk 2 from peg 1 to peg 2\\nmove disk 1 from peg 3 to peg 2\\nmove disk 3 from peg 1 to peg 3\\nmove disk 1 from peg 2 to peg 1\\nmove disk 2 from peg 2 to peg 3\\nmove disk 1 from peg 1 to peg 3\\n\",\n \"language\": \"J\"\n },\n {\n \"code\": \"public void move(int n, int from, int to, int via) {\\n if (n == 1) {\\n System.out.println(\\\"Move disk from pole \\\" + from + \\\" to pole \\\" + to);\\n } else {\\n move(n - 1, from, via, to);\\n move(1, from, to, via);\\n move(n - 1, via, to, from);\\n }\\n}\\n\",\n \"language\": \"Java\"\n },\n {\n \"code\": \"move(3, 1, 2, 3);\\n\",\n \"language\": \"Java\"\n },\n {\n \"code\": \"Move disk from pole 1 to pole 2\\nMove disk from pole 1 to pole 3\\nMove disk from pole 2 to pole 3\\nMove disk from pole 1 to pole 2\\nMove disk from pole 3 to pole 1\\nMove disk from pole 3 to pole 2\\nMove disk from pole 1 to pole 2\\n\",\n \"language\": \"Java\"\n },\n {\n \"code\": \"function move(n, a, b, c) {\\n if (n > 0) {\\n move(n-1, a, c, b);\\n console.log(\\\"Move disk from \\\" + a + \\\" to \\\" + c);\\n move(n-1, b, a, c);\\n }\\n}\\nmove(4, \\\"A\\\", \\\"B\\\", \\\"C\\\");\\n\",\n \"language\": \"JavaScript\"\n },\n {\n \"code\": \"(function () {\\n\\n // hanoi :: Int -> String -> String -> String -> [[String, String]]\\n function hanoi(n, a, b, c) {\\n return n ? hanoi(n - 1, a, c, b)\\n .concat([\\n [a, b]\\n ])\\n .concat(hanoi(n - 1, c, b, a)) : [];\\n }\\n\\n return hanoi(3, 'left', 'right', 'mid')\\n .map(function (d) {\\n return d[0] + ' -> ' + d[1];\\n });\\n})();\\n\",\n \"language\": \"JavaScript\"\n },\n {\n \"code\": \"[\\\"left -> right\\\", \\\"left -> mid\\\",\\n \\\"right -> mid\\\", \\\"left -> right\\\",\\n \\\"mid -> left\\\", \\\"mid -> right\\\",\\n \\\"left -> right\\\"]\\n\",\n \"language\": \"JavaScript\"\n },\n {\n \"code\": \"(() => {\\n \\\"use strict\\\";\\n\\n // ----------------- TOWERS OF HANOI -----------------\\n\\n // hanoi :: Int -> String -> String ->\\n // String -> [[String, String]]\\n const hanoi = n =>\\n (a, b, c) => {\\n const go = hanoi(n - 1);\\n\\n return Boolean(n) ? [\\n ...go(a, c, b),\\n ...[\\n [a, b]\\n ],\\n ...go(c, b, a)\\n ] : [];\\n };\\n\\n\\n // ---------------------- TEST -----------------------\\n return hanoi(3)(\\\"left\\\", \\\"right\\\", \\\"mid\\\")\\n .map(d => `${d[0]} -> ${d[1]}`)\\n .join(\\\"\\\\n\\\");\\n})();\\n\",\n \"language\": \"JavaScript\"\n },\n {\n \"code\": \"DEFINE hanoi == [[rolldown] infra] dip\\n[[[null] [pop pop] ]\\n [[dup2 [[rotate] infra] dip pred]\\n [[dup rest put] dip\\n [[swap] infra] dip pred]\\n []]]\\ncondnestrec.\\n\",\n \"language\": \"Joy\"\n },\n {\n \"code\": \"[source destination temp] 5 hanoi.\\n\",\n \"language\": \"Joy\"\n },\n {\n \"code\": \"# n is the number of disks to move from From to To\\ndef move(n; From; To; Via):\\n if n > 0 then\\n # move all but the largest at From to Via (according to the rules):\\n move(n-1; From; Via; To),\\n # ... so the largest disk at From is now free to move to its final destination:\\n \\\"Move disk from \\\\(From) to \\\\(To)\\\",\\n # Move the remaining disks at Via to To:\\n move(n-1; Via; To; From)\\n else empty\\n end;\\n\",\n \"language\": \"Jq\"\n },\n {\n \"code\": \"/* Towers of Hanoi, in Jsish */\\n\\nfunction move(n, a, b, c) {\\n if (n > 0) {\\n move(n-1, a, c, b);\\n puts(\\\"Move disk from \\\" + a + \\\" to \\\" + c);\\n move(n-1, b, a, c);\\n }\\n}\\n\\nif (Interp.conf('unitTest')) move(4, \\\"A\\\", \\\"B\\\", \\\"C\\\");\\n\\n/*\\n=!EXPECTSTART!=\\nMove disk from A to B\\nMove disk from A to C\\nMove disk from B to C\\nMove disk from A to B\\nMove disk from C to A\\nMove disk from C to B\\nMove disk from A to B\\nMove disk from A to C\\nMove disk from B to C\\nMove disk from B to A\\nMove disk from C to A\\nMove disk from B to C\\nMove disk from A to B\\nMove disk from A to C\\nMove disk from B to C\\n=!EXPECTEND!=\\n*/\\n\",\n \"language\": \"Jsish\"\n },\n {\n \"code\": \"function solve(n::Integer, from::Integer, to::Integer, via::Integer)\\n if n == 1\\n println(\\\"Move disk from $from to $to\\\")\\n else\\n solve(n - 1, from, via, to)\\n solve(1, from, to, via)\\n solve(n - 1, via, to, from)\\n end\\nend\\n\\nsolve(4, 1, 2, 3)\\n\",\n \"language\": \"Julia\"\n },\n {\n \"code\": \" h:{[n;a;b;c]if[n>0;_f[n-1;a;c;b];`0:,//$($n,\\\":\\\",$a,\\\"->\\\",$b,\\\"\\\\n\\\");_f[n-1;c;b;a]]}\\n h[4;1;2;3]\\n1:1->3\\n2:1->2\\n1:3->2\\n3:1->3\\n1:2->1\\n2:2->3\\n1:1->3\\n4:1->2\\n1:3->2\\n2:3->1\\n1:2->1\\n3:3->2\\n1:1->3\\n2:1->2\\n1:3->2\\n\",\n \"language\": \"K\"\n },\n {\n \"code\": \" s:();{[n;a;b;c]if[n>0;_f[n-1;a;c;b];s,:n;_f[n-1;c;b;a]]}[4;1;2;3];s\\n1 2 1 3 1 2 1 4 1 2 1 3 1 2 1\\n\\n 1_{*1+&|x}'a:(2_vs!_2^4)\\n1 2 1 3 1 2 1 4 1 2 1 3 1 2 1\\n\",\n \"language\": \"K\"\n },\n {\n \"code\": \"include ..\\\\Utilitys.tlhy\\n\\n:moveDisc %B !B %C !C %A !A %n !n { n A C B }\\n $n [\\n $n 1 - $A $B $C moveDisc\\n ( \\\"Move disc \\\" $n \\\" from pole \\\" $A \\\" to pole \\\" $C ) lprint nl\\n $n 1 - $B $C $A moveDisc\\n ] if\\n;\\n\\n{ Move disc 3 from pole 1 to pole 3, with pole 2 as spare }\\n3 1 3 2 moveDisc\\n\\n\\\" \\\" input\\n\",\n \"language\": \"Klingphix\"\n },\n {\n \"code\": \"// version 1.1.0\\n\\nclass Hanoi(disks: Int) {\\n private var moves = 0\\n\\n init {\\n println(\\\"Towers of Hanoi with $disks disks:\\\\n\\\")\\n move(disks, 'L', 'C', 'R')\\n println(\\\"\\\\nCompleted in $moves moves\\\\n\\\")\\n }\\n\\n private fun move(n: Int, from: Char, to: Char, via: Char) {\\n if (n > 0) {\\n move(n - 1, from, via, to)\\n moves++\\n println(\\\"Move disk $n from $from to $to\\\")\\n move(n - 1, via, to, from)\\n }\\n }\\n}\\n\\nfun main(args: Array<String>) {\\n Hanoi(3)\\n Hanoi(4)\\n}\\n\",\n \"language\": \"Kotlin\"\n },\n {\n \"code\": \"PSEUDO-CODE:\\n\\nhanoi disks from A to B via C\\n if no disks\\n then stop\\n else hanoi upper disks from A to C via B\\n move lower disk from A to B\\n hanoi upper disks from C to B via A\\n\\nCODE:\\n\\n{def hanoi\\n {lambda {:disks :a :b :c}\\n {if {A.empty? :disks}\\n then\\n else {hanoi {A.rest :disks} :a :c :b}\\n {div > move {A.first :disks} from :a to :b}\\n {hanoi {A.rest :disks} :c :b :a} }}}\\n-> hanoi\\n\\n{hanoi {A.new ==== === == =} A B C}\\n->\\n> move = from A to C\\n> move == from A to B\\n> move = from C to B\\n> move === from A to C\\n> move = from B to A\\n> move == from B to C\\n> move = from A to C\\n> move ==== from A to B\\n> move = from C to B\\n> move == from C to A\\n> move = from B to A\\n> move === from C to B\\n> move = from A to C\\n> move == from A to B\\n> move = from C to B\\n\",\n \"language\": \"Lambdatalk\"\n },\n {\n \"code\": \"#!/usr/bin/lasso9\\n\\ndefine towermove(\\n\\tdisks::integer,\\n\\ta,b,c\\n) => {\\n\\tif(#disks > 0) => {\\n\\t\\ttowermove(#disks - 1, #a, #c, #b )\\n\\t\\tstdoutnl(\\\"Move disk from \\\" + #a + \\\" to \\\" + #c)\\n\\t\\ttowermove(#disks - 1, #b, #a, #c )\\n\\t}\\n}\\n\\ntowermove((integer($argv -> second || 3)), \\\"A\\\", \\\"B\\\", \\\"C\\\")\\n\",\n \"language\": \"Lasso\"\n },\n {\n \"code\": \"./towers\\n\",\n \"language\": \"Lasso\"\n },\n {\n \"code\": \"./towers 4\\n\",\n \"language\": \"Lasso\"\n },\n {\n \"code\": \" source$ =\\\"A\\\"\\n via$ =\\\"B\\\"\\n target$ =\\\"C\\\"\\n\\n call hanoi 4, source$, target$, via$ ' ie call procedure to move legally 4 disks from peg A to peg C via peg B\\n\\n wait\\n\\n sub hanoi numDisks, source$, target$, via$\\n if numDisks =0 then\\n exit sub\\n else\\n call hanoi numDisks -1, source$, via$, target$\\n print \\\" Move disk \\\"; numDisks; \\\" from peg \\\"; source$; \\\" to peg \\\"; target$\\n call hanoi numDisks -1, via$, target$, source$\\n end if\\n end sub\\n\\n end\\n\",\n \"language\": \"Liberty-BASIC\"\n },\n {\n \"code\": \"on hanoi (n, a, b, c)\\n if n > 0 then\\n hanoi(n-1, a, c, b)\\n put \\\"Move disk from\\\" && a && \\\"to\\\" && c\\n hanoi(n-1, b, a, c)\\n end if\\nend\\n\",\n \"language\": \"Lingo\"\n },\n {\n \"code\": \"hanoi(3, \\\"A\\\", \\\"B\\\", \\\"C\\\")\\n-- \\\"Move disk from A to C\\\"\\n-- \\\"Move disk from A to B\\\"\\n-- \\\"Move disk from C to B\\\"\\n-- \\\"Move disk from A to C\\\"\\n-- \\\"Move disk from B to A\\\"\\n-- \\\"Move disk from B to C\\\"\\n-- \\\"Move disk from A to C\\\"\\n\",\n \"language\": \"Lingo\"\n },\n {\n \"code\": \"to move :n :from :to :via\\n if :n = 0 [stop]\\n move :n-1 :from :via :to\\n (print [Move disk from] :from [to] :to)\\n move :n-1 :via :to :from\\nend\\nmove 4 \\\"left \\\"middle \\\"right\\n\",\n \"language\": \"Logo\"\n },\n {\n \"code\": \":- object(hanoi).\\n\\n :- public(run/1).\\n :- mode(run(+integer), one).\\n :- info(run/1, [\\n comment is 'Solves the towers of Hanoi problem for the specified number of disks.',\\n argnames is ['Disks']]).\\n\\n run(Disks) :-\\n move(Disks, left, middle, right).\\n\\n move(1, Left, _, Right):-\\n !,\\n report(Left, Right).\\n move(Disks, Left, Aux, Right):-\\n Disks2 is Disks - 1,\\n move(Disks2, Left, Right, Aux),\\n report(Left, Right),\\n move(Disks2, Aux, Left, Right).\\n\\n report(Pole1, Pole2):-\\n write('Move a disk from '),\\n writeq(Pole1),\\n write(' to '),\\n writeq(Pole2),\\n write('.'),\\n nl.\\n\\n:- end_object.\\n\",\n \"language\": \"Logtalk\"\n },\n {\n \"code\": \"HAI 1.2\\n\\nHOW IZ I HANOI YR N AN YR SRC AN YR DST AN YR VIA\\n BTW VISIBLE SMOOSH \\\"HANOI N=\\\" N \\\" SRC=\\\" SRC \\\" DST=\\\" DST \\\" VIA=\\\" VIA MKAY\\n BOTH SAEM N AN 0, O RLY?\\n YA RLY\\n BTW VISIBLE \\\"Done.\\\"\\n GTFO\\n NO WAI\\n I HAS A LOWER ITZ DIFF OF N AN 1\\n I IZ HANOI YR LOWER AN YR SRC AN YR VIA AN YR DST MKAY\\n VISIBLE SMOOSH \\\"Move disc \\\" N \\\" from \\\" SRC \\\" to \\\" DST MKAY\\n I IZ HANOI YR LOWER AN YR VIA AN YR DST AN YR SRC MKAY\\n OIC\\nIF U SAY SO\\n\\nI IZ HANOI YR 4 AN YR 1 AN YR 2 AN YR 3 MKAY\\n\\nKTHXBYE\\n\",\n \"language\": \"LOLCODE\"\n },\n {\n \"code\": \"function move(n, src, dst, via)\\n if n > 0 then\\n move(n - 1, src, via, dst)\\n print(src, 'to', dst)\\n move(n - 1, via, dst, src)\\n end\\nend\\n\\nmove(4, 1, 2, 3)\\n\",\n \"language\": \"Lua\"\n },\n {\n \"code\": \"function move(n, src, via, dst)\\n if n > 0 then\\n move(n - 1, src, dst, via)\\n print('Disk ',n,' from ' ,src, 'to', dst)\\n move(n - 1, via, src, dst)\\n\\n end\\nend\\n\\nmove(4, 1, 2, 3)\\n\",\n \"language\": \"Lua\"\n },\n {\n \"code\": \"#!/usr/bin/env luajit\\nlocal function printf(fmt, ...) io.write(string.format(fmt, ...)) end\\nlocal runs=0\\nlocal function move(tower, from, to)\\n\\tif #tower[from]==0\\n\\t\\tor (#tower[to]>0\\n\\t\\tand tower[from][#tower[from]]>tower[to][#tower[to]]) then\\n\\t\\t\\tto,from=from,to\\n\\tend\\n\\tif #tower[from]>0 then\\n\\t\\ttower[to][#tower[to]+1]=tower[from][#tower[from]]\\n\\t\\ttower[from][#tower[from]]=nil\\n\\n\\t\\tio.write(tower[to][#tower[to]],\\\":\\\",from, \\\"→\\\", to, \\\" \\\")\\n\\tend\\nend\\n\\nlocal function hanoi(n)\\n\\tlocal src,dst,via={},{},{}\\n\\tlocal tower={src,dst,via}\\n\\tfor i=1,n do src[i]=n-i+1 end\\n\\tlocal one,nxt,lst\\n\\tif n%2==1 then -- odd\\n\\t\\tone,nxt,lst=1,2,3\\n\\telse\\n\\t\\tone,nxt,lst=1,3,2\\n\\tend\\n\\t--repeat\\n\\t::loop::\\n\\t\\tmove(tower, one, nxt)\\n\\t\\tif #dst==n then return end\\n\\t\\tmove(tower, one, lst)\\n\\t\\tone,nxt,lst=nxt,lst,one\\n\\tgoto loop\\n\\t--until false\\nend\\n\\nlocal num=arg[1] and tonumber(arg[1]) or 4\\n\\nhanoi(num)\\n\",\n \"language\": \"Lua\"\n },\n {\n \"code\": \"#!/usr/bin/env luajit\\n-- binary solution\\nlocal bit=require\\\"bit\\\"\\nlocal band,bor=bit.band,bit.bor\\nlocal function hanoi(n)\\n\\tlocal even=(n-1)%2\\n\\tfor m=1,2^n-1 do\\n\\t\\tio.write(m,\\\":\\\",band(m,m-1)%3+1, \\\"→\\\", (bor(m,m-1)+1)%3+1, \\\" \\\")\\n\\tend\\nend\\n\\nlocal num=arg[1] and tonumber(arg[1]) or 4\\n\\nhanoi(num)\\n\",\n \"language\": \"Lua\"\n },\n {\n \"code\": \"Module Hanoi {\\n Rem HANOI TOWERS\\n Print \\\"Three disks\\\" : Print\\n move(3, 1, 2, 3)\\n Print\\n Print \\\"Four disks\\\" : Print\\n move(4, 1, 2, 3)\\n\\n\\n Sub move(n, from, to, via)\\n If n <=0 Then Exit Sub\\n move(n - 1, from, via, to)\\n Print \\\"Move disk\\\"; n; \\\" from pole\\\"; from; \\\" to pole\\\"; to\\n move(n - 1, via, to, from)\\n End Sub\\n}\\nHanoi\\n\",\n \"language\": \"M2000-Interpreter\"\n },\n {\n \"code\": \" .TITLE HANOI\\n .MCALL .PRINT,.EXIT\\nHANOI:: MOV #4,R2\\n MOV #61,R3\\n MOV #62,R4\\n MOV #63,R5\\n JSR PC,MOVE\\n .EXIT\\nMOVE: DEC R2\\n BLT 1$\\n MOV R2,-(SP)\\n MOV R3,-(SP)\\n MOV R4,-(SP)\\n MOV R5,-(SP)\\n MOV R5,R0\\n MOV R4,R5\\n MOV R0,R4\\n JSR PC,MOVE\\n MOV (SP)+,R5\\n MOV (SP)+,R4\\n MOV (SP)+,R3\\n MOV (SP)+,R2\\n MOVB R3,3$\\n MOVB R4,4$\\n .PRINT #2$\\n MOV R3,R0\\n MOV R4,R3\\n MOV R5,R4\\n MOV R0,R5\\n BR MOVE\\n1$: RTS PC\\n2$: .ASCII /MOVE DISK FROM PEG /\\n3$: .ASCII /* TO PEG /\\n4$: .ASCIZ /*/\\n .EVEN\\n .END HANOI\\n\",\n \"language\": \"MACRO-11\"\n },\n {\n \"code\": \" NORMAL MODE IS INTEGER\\n DIMENSION LIST(100)\\n SET LIST TO LIST\\n\\n VECTOR VALUES MOVFMT =\\n 0 $20HMOVE DISK FROM POLE ,I1,S1,8HTO POLE ,I1*$\\n\\n INTERNAL FUNCTION(DUMMY)\\n ENTRY TO MOVE.\\nLOOP NUM = NUM - 1\\n WHENEVER NUM.E.0\\n PRINT FORMAT MOVFMT,FROM,DEST\\n OTHERWISE\\n SAVE RETURN\\n SAVE DATA NUM,FROM,VIA,DEST\\n TEMP=DEST\\n DEST=VIA\\n VIA=TEMP\\n MOVE.(0)\\n RESTORE DATA NUM,FROM,VIA,DEST\\n RESTORE RETURN\\n PRINT FORMAT MOVFMT,FROM,DEST\\n TEMP=FROM\\n FROM=VIA\\n VIA=TEMP\\n TRANSFER TO LOOP\\n END OF CONDITIONAL\\n FUNCTION RETURN\\n END OF FUNCTION\\n\\n NUM = 4\\n FROM = 1\\n VIA = 2\\n DEST = 3\\n MOVE.(0)\\n\\n END OF PROGRAM\\n\",\n \"language\": \"MAD\"\n },\n {\n \"code\": \"Hanoi := proc(n::posint,a,b,c)\\n if n = 1 then\\n printf(\\\"Move disk from tower %a to tower %a.\\\\n\\\",a,c);\\n else\\n Hanoi(n-1,a,c,b);\\n Hanoi(1,a,b,c);\\n Hanoi(n-1,b,a,c);\\n fi;\\nend:\\n\\nprintf(\\\"Moving 2 disks from tower A to tower C using tower B.\\\\n\\\");\\nHanoi(2,A,B,C);\\n\",\n \"language\": \"Maple\"\n },\n {\n \"code\": \"Hanoi[0, from_, to_, via_] := Null\\nHanoi[n_Integer, from_, to_, via_] := (Hanoi[n-1, from, via, to];Print[\\\"Move disk from pole \\\", from, \\\" to \\\", to, \\\".\\\"];Hanoi[n-1, via, to, from])\\n\",\n \"language\": \"Mathematica\"\n },\n {\n \"code\": \"function towerOfHanoi(n,A,C,B)\\n if (n~=0)\\n towerOfHanoi(n-1,A,B,C);\\n disp(sprintf('Move plate %d from tower %d to tower %d',[n A C]));\\n towerOfHanoi(n-1,B,C,A);\\n end\\nend\\n\",\n \"language\": \"MATLAB\"\n },\n {\n \"code\": \"moveDisc = function(n, A, C, B)\\n if n == 0 then return\\n moveDisc n-1, A, B, C\\n print \\\"Move disc \\\" + n + \\\" from pole \\\" + A + \\\" to pole \\\" + C\\n moveDisc n-1, B, C, A\\nend function\\n\\n// Move disc 3 from pole 1 to pole 3, with pole 2 as spare\\nmoveDisc 3, 1, 3, 2\\n\",\n \"language\": \"MiniScript\"\n },\n {\n \"code\": \"# Towers of Hanoi\\n# MIPS assembly implementation (tested with MARS)\\n# Source: https://stackoverflow.com/questions/50382420/hanoi-towers-recursive-solution-using-mips/50383530#50383530\\n\\n.data\\nprompt: .asciiz \\\"Enter a number: \\\"\\npart1: .asciiz \\\"\\\\nMove disk \\\"\\npart2: .asciiz \\\" from rod \\\"\\npart3: .asciiz \\\" to rod \\\"\\n\\n.text\\n.globl main\\nmain:\\n li $v0, 4 # print string\\n la $a0, prompt\\n syscall\\n li $v0, 5 # read integer\\n syscall\\n\\n # parameters for the routine\\n add $a0, $v0, $zero # move to $a0\\n li $a1, 'A'\\n li $a2, 'B'\\n li $a3, 'C'\\n\\n jal hanoi # call hanoi routine\\n\\n li $v0, 10 # exit\\n syscall\\n\\nhanoi:\\n\\n #save in stack\\n addi $sp, $sp, -20\\n sw $ra, 0($sp)\\n sw $s0, 4($sp)\\n sw $s1, 8($sp)\\n sw $s2, 12($sp)\\n sw $s3, 16($sp)\\n\\n add $s0, $a0, $zero\\n add $s1, $a1, $zero\\n add $s2, $a2, $zero\\n add $s3, $a3, $zero\\n\\n addi $t1, $zero, 1\\n beq $s0, $t1, output\\n\\n recur1:\\n\\n addi $a0, $s0, -1\\n add $a1, $s1, $zero\\n add $a2, $s3, $zero\\n add $a3, $s2, $zero\\n jal hanoi\\n\\n j output\\n\\n recur2:\\n\\n addi $a0, $s0, -1\\n add $a1, $s3, $zero\\n add $a2, $s2, $zero\\n add $a3, $s1, $zero\\n jal hanoi\\n\\n exithanoi:\\n\\n lw $ra, 0($sp) # restore registers from stack\\n lw $s0, 4($sp)\\n lw $s1, 8($sp)\\n lw $s2, 12($sp)\\n lw $s3, 16($sp)\\n\\n addi $sp, $sp, 20 # restore stack pointer\\n\\n jr $ra\\n\\n output:\\n\\n li $v0, 4 # print string\\n la $a0, part1\\n syscall\\n li $v0, 1 # print integer\\n add $a0, $s0, $zero\\n syscall\\n li $v0, 4 # print string\\n la $a0, part2\\n syscall\\n li $v0, 11 # print character\\n add $a0, $s1, $zero\\n syscall\\n li $v0, 4 # print string\\n la $a0, part3\\n syscall\\n li $v0, 11 # print character\\n add $a0, $s2, $zero\\n syscall\\n\\n beq $s0, $t1, exithanoi\\n j recur2\\n\",\n \"language\": \"MIPS-Assembly\"\n },\n {\n \"code\": \"main :: [sys_message]\\nmain = [Stdout (lay (map showmove (move 4 1 2 3)))]\\n\\nshowmove :: (num,num)->[char]\\nshowmove (src,dest)\\n = \\\"Move disk from pole \\\" ++ show src ++ \\\" to pole \\\" ++ show dest\\n\\nmove :: num->*->*->*->[(*,*)]\\nmove n src via dest\\n = [], if n=0\\n = left ++ [(src,dest)] ++ right, otherwise\\n where left = move (n-1) src dest via\\n right = move (n-1) via src dest\\n\",\n \"language\": \"Miranda\"\n },\n {\n \"code\": \"MODULE Towers;\\nFROM FormatString IMPORT FormatString;\\nFROM Terminal IMPORT WriteString,ReadChar;\\n\\nPROCEDURE Move(n,from,to,via : INTEGER);\\nVAR buf : ARRAY[0..63] OF CHAR;\\nBEGIN\\n IF n>0 THEN\\n Move(n-1, from, via, to);\\n FormatString(\\\"Move disk %i from pole %i to pole %i\\\\n\\\", buf, n, from, to);\\n WriteString(buf);\\n Move(n-1, via, to, from)\\n END\\nEND Move;\\n\\nBEGIN\\n Move(3, 1, 3, 2);\\n\\n ReadChar\\nEND Towers.\\n\",\n \"language\": \"Modula-2\"\n },\n {\n \"code\": \"MODULE Hanoi EXPORTS Main;\\n\\nFROM IO IMPORT Put;\\nFROM Fmt IMPORT Int;\\n\\nPROCEDURE doHanoi(n, from, to, using: INTEGER) =\\n BEGIN\\n IF n > 0 THEN\\n doHanoi(n - 1, from, using, to);\\n Put(\\\"move \\\" & Int(from) & \\\" --> \\\" & Int(to) & \\\"\\\\n\\\");\\n doHanoi(n - 1, using, to, from);\\n END;\\n END doHanoi;\\n\\nBEGIN\\n doHanoi(4, 1, 2, 3);\\nEND Hanoi.\\n\",\n \"language\": \"Modula-3\"\n },\n {\n \"code\": \"def move(n, fromPeg, toPeg, viaPeg):\\n if (n > 0):\\n move(n.previous(), fromPeg, viaPeg, toPeg)\\n traceln(`Move disk $n from $fromPeg to $toPeg`)\\n move(n.previous(), viaPeg, toPeg, fromPeg)\\n\\nmove(3, \\\"left\\\", \\\"right\\\", \\\"middle\\\")\\n\",\n \"language\": \"Monte\"\n },\n {\n \"code\": \"hanoi = (n, src, dest, via) ->\\n if n > 1\\n hanoi n-1, src, via, dest\\n print \\\"#{src} -> #{dest}\\\"\\n if n > 1\\n hanoi n-1, via, dest, src\\n\\nhanoi 4,1,3,2\\n\",\n \"language\": \"MoonScript\"\n },\n {\n \"code\": \"using System;\\nusing System.Console;\\n\\nmodule Towers\\n{\\n Hanoi(n : int, from = 1, to = 3, via = 2) : void\\n {\\n when (n > 0)\\n {\\n Hanoi(n - 1, from, via, to);\\n WriteLine(\\\"Move disk from peg {0} to peg {1}\\\", from, to);\\n Hanoi(n - 1, via, to, from);\\n }\\n }\\n\\n Main() : void\\n {\\n Hanoi(4)\\n }\\n}\\n\",\n \"language\": \"Nemerle\"\n },\n {\n \"code\": \"/* NetRexx */\\noptions replace format comments java crossref symbols binary\\n\\nrunSample(arg)\\nreturn\\n\\n-- 09:02, 27 August 2022 (UTC)09:02, 27 August 2022 (UTC)09:02, 27 August 2022 (UTC)09:02, 27 August 2022 (UTC)09:02, 27 August 2022 (UTC)09:02, 27 August 2022 (UTC)09:02, 27 August 2022 (UTC)09:02, 27 August 2022 (UTC)09:02, 27 August 2022 (UTC)09:02, 27 August 2022 (UTC)09:02, 27 August 2022 (UTC)09:02, 27 August 2022 (UTC)09:02, 27 August 2022 (UTC)09:02, 27 August 2022 (UTC)09:02, 27 August 2022 (UTC)~~\\nmethod runSample(arg) private static\\n parse arg discs .\\n if discs = '', discs < 1 then discs = 4\\n say 'Minimum moves to solution:' 2 ** discs - 1\\n moves = move(discs)\\n say 'Solved in' moves 'moves.'\\n return\\n\\n-- 09:02, 27 August 2022 (UTC)09:02, 27 August 2022 (UTC)09:02, 27 August 2022 (UTC)09:02, 27 August 2022 (UTC)09:02, 27 August 2022 (UTC)09:02, 27 August 2022 (UTC)09:02, 27 August 2022 (UTC)09:02, 27 August 2022 (UTC)09:02, 27 August 2022 (UTC)09:02, 27 August 2022 (UTC)09:02, 27 August 2022 (UTC)09:02, 27 August 2022 (UTC)09:02, 27 August 2022 (UTC)09:02, 27 August 2022 (UTC)09:02, 27 August 2022 (UTC)~~\\nmethod move(discs = int 4, towerFrom = int 1, towerTo = int 2, towerVia = int 3, moves = int 0) public static\\n if discs == 1 then do\\n moves = moves + 1\\n say 'Move disc from peg' towerFrom 'to peg' towerTo '- Move No:' Rexx(moves).right(5)\\n end\\n else do\\n moves = move(discs - 1, towerFrom, towerVia, towerTo, moves)\\n moves = move(1, towerFrom, towerTo, towerVia, moves)\\n moves = move(discs - 1, towerVia, towerTo, towerFrom, moves)\\n end\\n return moves\\n\",\n \"language\": \"NetRexx\"\n },\n {\n \"code\": \"(define (move n from to via)\\n\\t\\t\\t(if (> n 0)\\n\\t\\t\\t\\t(move (- n 1) from via to\\n\\t\\t\\t\\t(print \\\"move disk from pole \\\" from \\\" to pole \\\" to \\\"\\\\n\\\")\\n\\t\\t\\t\\t(move (- n 1) via to from))))\\n\\n(move 4 1 2 3)\\n\",\n \"language\": \"NewLISP\"\n },\n {\n \"code\": \"proc hanoi(disks: int; fromTower, toTower, viaTower: string) =\\n if disks != 0:\\n hanoi(disks - 1, fromTower, viaTower, toTower)\\n echo(\\\"Move disk \\\", disks, \\\" from \\\", fromTower, \\\" to \\\", toTower)\\n hanoi(disks - 1, viaTower, toTower, fromTower)\\n\\nhanoi(4, \\\"1\\\", \\\"2\\\", \\\"3\\\")\\n\",\n \"language\": \"Nim\"\n },\n {\n \"code\": \"MODULE Hanoi;\\n\\n IMPORT Out;\\n\\n PROCEDURE Move(n,from,via,to:INTEGER);\\n BEGIN\\n IF n > 1 THEN\\n Move(n-1,from,to,via);\\n Out.String(\\\"Move disk from pole \\\");\\n Out.Int(from,0);\\n Out.String(\\\" to pole \\\");\\n Out.Int(to,0);\\n Out.Ln;\\n Move(n-1,via,from,to);\\n ELSE\\n Out.String(\\\"Move disk from pole \\\");\\n Out.Int(from,0);\\n Out.String(\\\" to pole \\\");\\n Out.Int(to,0);\\n Out.Ln;\\n END;\\n END Move;\\n\\nBEGIN\\n Move(4,1,2,3);\\nEND Hanoi.\\n\",\n \"language\": \"Oberon\"\n },\n {\n \"code\": \"class Hanoi {\\n function : Main(args : String[]) ~ Nil {\\n Move(4, 1, 2, 3);\\n }\\n\\n function: Move(n:Int, f:Int, t:Int, v:Int) ~ Nil {\\n if(n = 1) {\\n \\\"Move disk from pole {$f} to pole {$t}\\\"->PrintLine();\\n }\\n else {\\n Move(n - 1, f, v, t);\\n Move(1, f, t, v);\\n Move(n - 1, v, t, f);\\n };\\n }\\n}\\n\",\n \"language\": \"Objeck\"\n },\n {\n \"code\": \"#import <Foundation/NSObject.h>\\n\\n@interface TowersOfHanoi: NSObject {\\n\\tint pegFrom;\\n\\tint pegTo;\\n\\tint pegVia;\\n\\tint numDisks;\\n}\\n\\n-(void) setPegFrom: (int) from andSetPegTo: (int) to andSetPegVia: (int) via andSetNumDisks: (int) disks;\\n-(void) movePegFrom: (int) from andMovePegTo: (int) to andMovePegVia: (int) via andWithNumDisks: (int) disks;\\n@end\\n\",\n \"language\": \"Objective-C\"\n },\n {\n \"code\": \"#import \\\"TowersOfHanoi.h\\\"\\n@implementation TowersOfHanoi\\n\\n-(void) setPegFrom: (int) from andSetPegTo: (int) to andSetPegVia: (int) via andSetNumDisks: (int) disks {\\n\\tpegFrom = from;\\n\\tpegTo = to;\\n\\tpegVia = via;\\n\\tnumDisks = disks;\\n}\\n\\n-(void) movePegFrom: (int) from andMovePegTo: (int) to andMovePegVia: (int) via andWithNumDisks: (int) disks {\\n\\tif (disks == 1) {\\n printf(\\\"Move disk from pole %i to pole %i\\\\n\\\", from, to);\\n } else {\\n \\t\\t\\t[self movePegFrom: from andMovePegTo: via andMovePegVia: to andWithNumDisks: disks-1];\\n\\t\\t\\t[self movePegFrom: from andMovePegTo: to andMovePegVia: via andWithNumDisks: 1];\\n\\t\\t\\t[self movePegFrom: via andMovePegTo: to andMovePegVia: from andWithNumDisks: disks-1];\\n }\\n}\\n\\n@end\\n\",\n \"language\": \"Objective-C\"\n },\n {\n \"code\": \"#import <stdio.h>\\n#import \\\"TowersOfHanoi.h\\\"\\n\\nint main( int argc, const char *argv[] ) {\\n\\t@autoreleasepool {\\n\\n\\t\\tTowersOfHanoi *tower = [[TowersOfHanoi alloc] init];\\n\\n\\t\\tint from = 1;\\n\\t\\tint to = 3;\\n\\t\\tint via = 2;\\n\\t\\tint disks = 3;\\n\\n\\t\\t[tower setPegFrom: from andSetPegTo: to andSetPegVia: via andSetNumDisks: disks];\\n\\n\\t\\t[tower movePegFrom: from andMovePegTo: to andMovePegVia: via andWithNumDisks: disks];\\n\\n\\t}\\n\\treturn 0;\\n}\\n\",\n \"language\": \"Objective-C\"\n },\n {\n \"code\": \"let rec hanoi n a b c =\\n if n <> 0 then begin\\n hanoi (pred n) a c b;\\n Printf.printf \\\"Move disk from pole %d to pole %d\\\\n\\\" a b;\\n hanoi (pred n) c b a\\n end\\n\\nlet () =\\n hanoi 4 1 2 3\\n\",\n \"language\": \"OCaml\"\n },\n {\n \"code\": \"function hanoimove(ndisks, from, to, via)\\n if ( ndisks == 1 )\\n printf(\\\"Move disk from pole %d to pole %d\\\\n\\\", from, to);\\n else\\n hanoimove(ndisks-1, from, via, to);\\n hanoimove(1, from, to, via);\\n hanoimove(ndisks-1, via, to, from);\\n endif\\nendfunction\\n\\nhanoimove(4, 1, 2, 3);\\n\",\n \"language\": \"Octave\"\n },\n {\n \"code\": \": move(n, from, to, via)\\n n 0 > ifTrue: [\\n move(n 1-, from, via, to)\\n System.Out \\\"Move disk from \\\" << from << \\\" to \\\" << to << cr\\n move(n 1-, via, to, from)\\n ] ;\\n\\n5 $left $middle $right) move\\n\",\n \"language\": \"Oforth\"\n },\n {\n \"code\": \"declare\\n proc {TowersOfHanoi N From To Via}\\n if N > 0 then\\n {TowersOfHanoi N-1 From Via To}\\n {System.showInfo \\\"Move from \\\"#From#\\\" to \\\"#To}\\n {TowersOfHanoi N-1 Via To From}\\n end\\n end\\nin\\n {TowersOfHanoi 4 left middle right}\\n\",\n \"language\": \"Oz\"\n },\n {\n \"code\": \"\\\\\\\\ Towers of Hanoi\\n\\\\\\\\ 8/19/2016 aev\\n\\\\\\\\ Where: n - number of disks, sp - start pole, ep - end pole.\\nHanoiTowers(n,sp,ep)={\\n if(n!=0,\\n HanoiTowers(n-1,sp,6-sp-ep);\\n print(\\\"Move disk \\\", n, \\\" from pole \\\", sp,\\\" to pole \\\", ep);\\n HanoiTowers(n-1,6-sp-ep,ep);\\n );\\n}\\n\\\\\\\\ Testing n=3:\\nHanoiTowers(3,1,3);\\n\",\n \"language\": \"PARI-GP\"\n },\n {\n \"code\": \"program Hanoi;\\ntype\\n TPole = (tpLeft, tpCenter, tpRight);\\nconst\\n strPole:array[TPole] of string[6]=('left','center','right');\\n\\n procedure MoveStack (const Ndisks : integer; const Origin,Destination,Auxiliary:TPole);\\n begin\\n if Ndisks >0 then begin\\n MoveStack(Ndisks - 1, Origin,Auxiliary, Destination );\\n Writeln('Move disk ',Ndisks ,' from ',strPole[Origin],' to ',strPole[Destination]);\\n MoveStack(Ndisks - 1, Auxiliary, Destination, origin);\\n end;\\n end;\\n\\nbegin\\n MoveStack(4,tpLeft,tpCenter,tpRight);\\nend.\\n\",\n \"language\": \"Pascal\"\n },\n {\n \"code\": \"program Hanoi;\\ntype\\n TPole = (tpLeft, tpCenter, tpRight);\\nconst\\n strPole:array[TPole] of string[6]=('left','center','right');\\n\\n procedure MoveOneDisk(const DiskNum:integer; const Origin,Destination:TPole);\\n begin\\n Writeln('Move disk ',DiskNum,' from ',strPole[Origin],' to ',strPole[Destination]);\\n end;\\n\\n procedure MoveStack (const Ndisks : integer; const Origin,Destination,Auxiliary:TPole);\\n begin\\n if Ndisks =1 then\\n MoveOneDisk(1,origin,Destination)\\n else begin\\n MoveStack(Ndisks - 1, Origin,Auxiliary, Destination );\\n MoveOneDisk(Ndisks,origin,Destination);\\n MoveStack(Ndisks - 1, Auxiliary, Destination, origin);\\n end;\\n end;\\n\\nbegin\\n MoveStack(4,tpLeft,tpCenter,tpRight);\\nend.\\n\",\n \"language\": \"Pascal\"\n },\n {\n \"code\": \"sub hanoi {\\n my ($n, $from, $to, $via) = (@_, 1, 2, 3);\\n\\n if ($n == 1) {\\n print \\\"Move disk from pole $from to pole $to.\\\\n\\\";\\n } else {\\n hanoi($n - 1, $from, $via, $to);\\n hanoi(1, $from, $to, $via);\\n hanoi($n - 1, $via, $to, $from);\\n };\\n};\\n\",\n \"language\": \"Perl\"\n },\n {\n \"code\": \"(phixonline)-->\\n <span style=\\\"color: #008080;\\\">constant</span> <span style=\\\"color: #000000;\\\">poles</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #0000FF;\\\">{</span><span style=\\\"color: #008000;\\\">\\\"left\\\"</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #008000;\\\">\\\"middle\\\"</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #008000;\\\">\\\"right\\\"</span><span style=\\\"color: #0000FF;\\\">}</span>\\n <span style=\\\"color: #008080;\\\">enum</span> <span style=\\\"color: #000000;\\\">left</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">middle</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">right</span>\\n\\n <span style=\\\"color: #004080;\\\">sequence</span> <span style=\\\"color: #000000;\\\">disks</span>\\n <span style=\\\"color: #004080;\\\">integer</span> <span style=\\\"color: #000000;\\\">moves</span>\\n\\n <span style=\\\"color: #008080;\\\">procedure</span> <span style=\\\"color: #000000;\\\">showpegs</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #004080;\\\">integer</span> <span style=\\\"color: #000000;\\\">src</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #004080;\\\">integer</span> <span style=\\\"color: #000000;\\\">dest</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #004080;\\\">string</span> <span style=\\\"color: #000000;\\\">desc</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">sprintf</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #008000;\\\">\\\"%s to %s:\\\"</span><span style=\\\"color: #0000FF;\\\">,{</span><span style=\\\"color: #000000;\\\">poles</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">src</span><span style=\\\"color: #0000FF;\\\">],</span><span style=\\\"color: #000000;\\\">poles</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">dest</span><span style=\\\"color: #0000FF;\\\">]})</span>\\n <span style=\\\"color: #000000;\\\">disks</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">dest</span><span style=\\\"color: #0000FF;\\\">]</span> <span style=\\\"color: #0000FF;\\\">&=</span> <span style=\\\"color: #000000;\\\">disks</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">src</span><span style=\\\"color: #0000FF;\\\">][$]</span>\\n <span style=\\\"color: #000000;\\\">disks</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">src</span><span style=\\\"color: #0000FF;\\\">]</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">disks</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">src</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;\\\">1</span> <span style=\\\"color: #008080;\\\">to</span> <span style=\\\"color: #7060A8;\\\">length</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">disks</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;\\\">\\\"%-16s | %s\\\\n\\\"</span><span style=\\\"color: #0000FF;\\\">,{</span><span style=\\\"color: #000000;\\\">desc</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #7060A8;\\\">join</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #7060A8;\\\">sq_add</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">disks</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">i</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;\\\">desc</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #008000;\\\">\\\"\\\"</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: #000000;\\\">moves</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;\\\">hanoir</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #004080;\\\">integer</span> <span style=\\\"color: #000000;\\\">n</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">src</span><span style=\\\"color: #0000FF;\\\">=</span><span style=\\\"color: #000000;\\\">left</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">dest</span><span style=\\\"color: #0000FF;\\\">=</span><span style=\\\"color: #000000;\\\">right</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">via</span><span style=\\\"color: #0000FF;\\\">=</span><span style=\\\"color: #000000;\\\">middle</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;\\\">0</span> <span style=\\\"color: #008080;\\\">then</span>\\n <span style=\\\"color: #000000;\\\">hanoir</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;\\\">src</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">via</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">dest</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #000000;\\\">showpegs</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">src</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">dest</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #000000;\\\">hanoir</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;\\\">via</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">dest</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">src</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;\\\">procedure</span>\\n\\n <span style=\\\"color: #008080;\\\">procedure</span> <span style=\\\"color: #000000;\\\">hanoi</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: #000000;\\\">disks</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #0000FF;\\\">{</span><span style=\\\"color: #7060A8;\\\">reverse</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>\\n <span style=\\\"color: #000000;\\\">moves</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">0</span>\\n <span style=\\\"color: #000000;\\\">hanoir</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;\\\">\\\"completed in %d moves\\\\n\\\"</span><span style=\\\"color: #0000FF;\\\">,{</span><span style=\\\"color: #000000;\\\">moves</span><span style=\\\"color: #0000FF;\\\">})</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">procedure</span>\\n\\n <span style=\\\"color: #000000;\\\">hanoi</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">3</span><span style=\\\"color: #0000FF;\\\">)</span> <span style=\\\"color: #000080;font-style:italic;\\\">-- (output of 4,5,6 also shown)</span>\\n<!--\\n\",\n \"language\": \"Phix\"\n },\n {\n \"code\": \"module hanoi;\\n\\nextern printf;\\n\\n@Void move(@Integer n, @Integer from, @Integer to, @Integer via) [\\n\\tif (n > 0) {\\n\\t\\tmove(n - 1, from, via, to);\\n\\t\\tprintf(\\\"Move disk from pole %d to pole %d\\\\n\\\", from, to);\\n\\t\\tmove(n - 1, via, to, from);\\n\\t}\\n]\\n\\n@Integer main [\\n\\tmove(4, 1,2,3);\\n\\treturn 0;\\n]\\n\",\n \"language\": \"PHL\"\n },\n {\n \"code\": \"function move($n,$from,$to,$via) {\\n if ($n === 1) {\\n print(\\\"Move disk from pole $from to pole $to\\\");\\n } else {\\n move($n-1,$from,$via,$to);\\n move(1,$from,$to,$via);\\n move($n-1,$via,$to,$from);\\n }\\n}\\n\",\n \"language\": \"PHP\"\n },\n {\n \"code\": \"main =>\\n hanoi(3, left, center, right).\\n\\nhanoi(0, _From, _To, _Via) => true.\\nhanoi(N, From, To, Via) =>\\n hanoi(N - 1, From, Via, To),\\n printf(\\\"Move disk %w from pole %w to pole %w\\\\n\\\", N, From, To),\\n hanoi(N - 1, Via, To, From).\\n\",\n \"language\": \"Picat\"\n },\n {\n \"code\": \"main =>\\n hanoi(64).\\n\\nhanoi(N) =>\\n printf(\\\"N=%d\\\\n\\\", N),\\n Count = move(N, left, center, right) ,\\n printf(\\\"count=%w, theoretical=%w\\\\n\\\", Count, 2**N-1).\\n\\ntable\\nmove(0, _From, _To, _Via) = 0.\\nmove(N, From, To, Via) = Count =>\\n Count1 = move(N - 1, From, Via, To),\\n Count2 = move(N - 1, Via, To, From),\\n Count = Count1+Count2+1.\\n\",\n \"language\": \"Picat\"\n },\n {\n \"code\": \"(de move (N A B C) # Use: (move 3 'left 'center 'right)\\n (unless (=0 N)\\n (move (dec N) A C B)\\n (println 'Move 'disk 'from A 'to B)\\n (move (dec N) C B A) ) )\\n\",\n \"language\": \"PicoLisp\"\n },\n {\n \"code\": \"tower: proc options (main);\\n\\n call Move (4,1,2,3);\\n\\nMove: procedure (ndiscs, from, to, via) recursive;\\n declare (ndiscs, from, to, via) fixed binary;\\n\\n if ndiscs = 1 then\\n put skip edit ('Move disc from pole ', trim(from), ' to pole ',\\n trim(to) ) (a);\\n else\\n do;\\n call Move (ndiscs-1, from, via, to);\\n call Move (1, from, to, via);\\n call Move (ndiscs-1, via, to, from);\\n end;\\nend Move;\\n\\nend tower;\\n\",\n \"language\": \"PL-I\"\n },\n {\n \"code\": \"100H: /* ITERATIVE TOWERS OF HANOI; TRANSLATED FROM TINY BASIC (VIA ALGOL W) */\\n\\n /* CP/M BDOS SYSTEM CALL */\\n BDOS: PROCEDURE( FN, ARG ); DECLARE FN BYTE, ARG ADDRESS; GOTO 5; END;\\n /* I/O ROUTINES */\\n PR$CHAR: PROCEDURE( C ); DECLARE C BYTE; CALL BDOS( 2, C ); END;\\n PR$STRING: PROCEDURE( S ); DECLARE S ADDRESS; CALL BDOS( 9, S ); END;\\n\\n DECLARE ( D, N, X, S, T ) ADDRESS;\\n /* FIXED NUMBER OF DISCS: 4 */\\n N = 1;\\n DO D = 1 TO 4;\\n N = N + N;\\n END;\\n DO X = 1 TO N - 1;\\n /* AS IN ALGOL W, WE CAN USE PL/M'S BIT ABD MOD OPERATORS */\\n S = ( X AND ( X - 1 ) ) MOD 3;\\n T = ( ( X OR ( X - 1 ) ) + 1 ) MOD 3;\\n CALL PR$STRING( .'MOVE DISC ON PEG $' );\\n CALL PR$CHAR( '1' + S );\\n CALL PR$STRING( .' TO PEG $' );\\n CALL PR$CHAR( '1' + T );\\n CALL PR$STRING( .( 0DH, 0AH, '$' ) );\\n END;\\nEOF\\n\",\n \"language\": \"PL-M\"\n },\n {\n \"code\": \"\\\\newcount\\\\hanoidepth\\n\\\\def\\\\hanoi#1{%\\n \\\\hanoidepth = #1\\n \\\\move abc\\n}%\\n\\\\def\\\\move#1#2#3{%\\n \\\\advance \\\\hanoidepth by -1\\n \\\\ifnum \\\\hanoidepth > 0\\n \\\\move #1#3#2\\n \\\\fi\\n Move the upper disk from pole #1 to pole #3.\\\\par\\n \\\\ifnum \\\\hanoidepth > 0\\n \\\\move#2#1#3\\n \\\\fi\\n \\\\advance \\\\hanoidepth by 1\\n}\\n\\n\\\\hanoi{5}\\n\\\\end\\n\",\n \"language\": \"PlainTeX\"\n },\n {\n \"code\": \"define hanoi(n, src, dst, via);\\nif n > 0 then\\n hanoi(n - 1, src, via, dst);\\n 'Move disk ' >< n >< ' from ' >< src >< ' to ' >< dst >< '.' =>\\n hanoi(n - 1, via, dst, src);\\nendif;\\nenddefine;\\n\\nhanoi(4, \\\"left\\\", \\\"middle\\\", \\\"right\\\");\\n\",\n \"language\": \"Pop11\"\n },\n {\n \"code\": \"%!PS-Adobe-3.0\\n%%BoundingBox: 0 0 300 300\\n\\n/plate {\\n exch 100 mul 50 add exch th mul 10 add moveto\\n dup s mul neg 2 div 0 rmoveto\\n dup s mul 0 rlineto\\n 0 th rlineto\\n s neg mul 0 rlineto\\n closepath gsave .5 setgray fill grestore 0 setgray stroke\\n} def\\n\\n/drawtower {\\n 0 1 2 { /x exch def /y 0 def\\n tower x get {\\n dup 0 gt { x y plate /y y 1 add def } {pop} ifelse\\n } forall\\n } for showpage\\n} def\\n\\n/apop { [ exch aload pop /last exch def ] last } def\\n/apush{ [ 3 1 roll aload pop counttomark -1 roll ] } def\\n\\n/hanoi {\\n 0 dict begin /from /mid /to /h 5 -1 2 { -1 roll def } for\\n h 1 eq {\\n tower from get apop tower to get apush\\n tower to 3 -1 roll put\\n tower from 3 -1 roll put\\n drawtower\\n } {\\n /h h 1 sub def\\n from to mid h hanoi\\n from mid to 1 hanoi\\n mid from to h hanoi\\n } ifelse\\n end\\n} def\\n\\n\\n/n 12 def\\n/s 90 n div def\\n/th 180 n div def\\n/tower [ [n 1 add -1 2 { } for ] [] [] ] def\\n\\ndrawtower 0 1 2 n hanoi\\n\\n%%EOF\\n\",\n \"language\": \"PostScript\"\n },\n {\n \"code\": \"function hanoi($n, $a, $b, $c) {\\n if($n -eq 1) {\\n \\\"$a -> $c\\\"\\n } else{\\n hanoi ($n - 1) $a $c $b\\n hanoi 1 $a $b $c\\n hanoi ($n - 1) $b $a $c\\n }\\n}\\nhanoi 3 \\\"A\\\" \\\"B\\\" \\\"C\\\"\\n\",\n \"language\": \"PowerShell\"\n },\n {\n \"code\": \"hanoi(N) :- move(N,left,center,right).\\n\\nmove(0,_,_,_) :- !.\\nmove(N,A,B,C) :-\\n M is N-1,\\n move(M,A,C,B),\\n inform(A,B),\\n move(M,C,B,A).\\n\\ninform(X,Y) :- write([move,a,disk,from,the,X,pole,to,Y,pole]), nl.\\n\",\n \"language\": \"Prolog\"\n },\n {\n \"code\": \"hanoi(N, Src, Aux, Dest, Moves-NMoves) :-\\n NMoves is 2^N - 1,\\n length(Moves, NMoves),\\n phrase(move(N, Src, Aux, Dest), Moves).\\n\\n\\nmove(1, Src, _, Dest) --> !,\\n [Src->Dest].\\n\\nmove(2, Src, Aux, Dest) --> !,\\n [Src->Aux,Src->Dest,Aux->Dest].\\n\\nmove(N, Src, Aux, Dest) -->\\n { succ(N0, N) },\\n move(N0, Src, Dest, Aux),\\n move(1, Src, Aux, Dest),\\n move(N0, Aux, Src, Dest).\\n\",\n \"language\": \"Prolog\"\n },\n {\n \"code\": \"Procedure Hanoi(n, A.s, C.s, B.s)\\n If n\\n Hanoi(n-1, A, B, C)\\n PrintN(\\\"Move the plate from \\\"+A+\\\" to \\\"+C)\\n Hanoi(n-1, B, C, A)\\n EndIf\\nEndProcedure\\n\",\n \"language\": \"PureBasic\"\n },\n {\n \"code\": \"Procedure Hanoi(n, A.s, C.s, B.s)\\n If n\\n Hanoi(n-1, A, B, C)\\n PrintN(\\\"Move the plate from \\\"+A+\\\" to \\\"+C)\\n Hanoi(n-1, B, C, A)\\n EndIf\\nEndProcedure\\n\\nIf OpenConsole()\\n Define n=3\\n PrintN(\\\"Moving \\\"+Str(n)+\\\" pegs.\\\"+#CRLF$)\\n Hanoi(n,\\\"Left Peg\\\",\\\"Middle Peg\\\",\\\"Right Peg\\\")\\n PrintN(#CRLF$+\\\"Press ENTER to exit.\\\"): Input()\\nEndIf\\n\",\n \"language\": \"PureBasic\"\n },\n {\n \"code\": \"def hanoi(ndisks, startPeg=1, endPeg=3):\\n if ndisks:\\n hanoi(ndisks-1, startPeg, 6-startPeg-endPeg)\\n print(f\\\"Move disk {ndisks} from peg {startPeg} to peg {endPeg}\\\")\\n hanoi(ndisks-1, 6-startPeg-endPeg, endPeg)\\n\\nhanoi(4)\\n\",\n \"language\": \"Python\"\n },\n {\n \"code\": \"'''Towers of Hanoi'''\\n\\n\\n# hanoi :: Int -> String -> String -> String -> [(String, String)]\\ndef hanoi(n):\\n '''A list of (from, to) label pairs,\\n where a, b and c are labels for each of the\\n three Hanoi tower positions.'''\\n def go(n, a, b, c):\\n p = n - 1\\n return (\\n go(p, a, c, b) + [(a, b)] + go(p, c, b, a)\\n ) if 0 < n else []\\n return lambda a: lambda b: lambda c: go(n, a, b, c)\\n\\n\\n# TEST ----------------------------------------------------\\nif __name__ == '__main__':\\n\\n # fromTo :: (String, String) -> String\\n def fromTo(xy):\\n '''x -> y'''\\n x, y = xy\\n return x.rjust(5, ' ') + ' -> ' + y\\n\\n print(__doc__ + ':\\\\n\\\\n' + '\\\\n'.join(\\n map(fromTo, hanoi(4)('left')('right')('mid'))\\n ))\\n\",\n \"language\": \"Python\"\n },\n {\n \"code\": \"'''Towers of Hanoi'''\\n\\nfrom itertools import accumulate, chain, repeat\\nfrom inspect import signature\\nimport operator\\n\\n\\n# hanoi :: Int -> [(Int, Int)]\\ndef hanoi(n):\\n '''A list of index pairs, representing disk moves\\n between indexed Hanoi positions.\\n '''\\n def go(n, a, b, c):\\n p = n - 1\\n return (\\n go(p, a, c, b) + [(a, b)] + go(p, c, b, a)\\n ) if 0 < n else []\\n return go(n, 0, 2, 1)\\n\\n\\n# hanoiState :: ([Int],[Int],[Int], String) -> (Int, Int) ->\\n# ([Int],[Int],[Int], String)\\ndef hanoiState(tpl, ab):\\n '''A new Hanoi tower state'''\\n a, b = ab\\n xs, ys = tpl[a], tpl[b]\\n\\n w = 3 * (2 + (2 * max(map(max, filter(len, tpl[:-1])))))\\n\\n def delta(i):\\n return tpl[i] if i not in ab else xs[1:] if (\\n i == a\\n ) else [xs[0]] + ys\\n\\n tkns = moveName(('left', 'mid', 'right'))(ab)\\n caption = ' '.join(tkns)\\n return tuple(map(delta, [0, 1, 2])) + (\\n (caption if tkns[0] != 'mid' else caption.rjust(w, ' ')),\\n )\\n\\n\\n# showHanoi :: ([Int],[Int],[Int], String) -> String\\ndef showHanoi(tpl):\\n '''Captioned string representation of an updated Hanoi tower state.'''\\n\\n def fullHeight(n):\\n return lambda xs: list(repeat('', n - len(xs))) + xs\\n\\n mul = curry(operator.mul)\\n lt = curry(operator.lt)\\n rods = fmap(fmap(mul('__')))(\\n list(tpl[0:3])\\n )\\n h = max(map(len, rods))\\n w = 2 + max(\\n map(\\n compose(max)(fmap(len)),\\n filter(compose(lt(0))(len), rods)\\n )\\n )\\n xs = fmap(concat)(\\n transpose(fmap(\\n compose(fmap(center(w)(' ')))(\\n fullHeight(h)\\n )\\n )(rods))\\n )\\n return tpl[3] + '\\\\n\\\\n' + unlines(xs) + '\\\\n' + ('___' * w)\\n\\n\\n# moveName :: (String, String, String) -> (Int, Int) -> [String]\\ndef moveName(labels):\\n '''(from, to) index pair represented as an a -> b string.'''\\n def go(ab):\\n a, b = ab\\n return [labels[a], ' to ', labels[b]] if a < b else [\\n labels[b], ' from ', labels[a]\\n ]\\n return lambda ab: go(ab)\\n\\n\\n# TEST ----------------------------------------------------\\ndef main():\\n '''Visualisation of a Hanoi tower sequence for N discs.\\n '''\\n n = 3\\n print('Hanoi sequence for ' + str(n) + ' disks:\\\\n')\\n print(unlines(\\n fmap(showHanoi)(\\n scanl(hanoiState)(\\n (enumFromTo(1)(n), [], [], '')\\n )(hanoi(n))\\n )\\n ))\\n\\n\\n# GENERIC -------------------------------------------------\\n\\n# center :: Int -> Char -> String -> String\\ndef center(n):\\n '''String s padded with c to approximate centre,\\n fitting in but not truncated to width n.'''\\n return lambda c: lambda s: s.center(n, c)\\n\\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# concat :: [[a]] -> [a]\\n# concat :: [String] -> String\\ndef concat(xs):\\n '''The concatenation of all the elements\\n in a list or iterable.'''\\n\\n def f(ys):\\n zs = list(chain(*ys))\\n return ''.join(zs) if isinstance(ys[0], str) else zs\\n\\n return (\\n f(xs) if isinstance(xs, list) else (\\n chain.from_iterable(xs)\\n )\\n ) if xs else []\\n\\n\\n# curry :: ((a, b) -> c) -> a -> b -> c\\ndef curry(f):\\n '''A curried function derived\\n from an uncurried function.'''\\n if 1 < len(signature(f).parameters):\\n return lambda x: lambda y: f(x, y)\\n else:\\n return f\\n\\n\\n# enumFromTo :: (Int, Int) -> [Int]\\ndef enumFromTo(m):\\n '''Integer enumeration from m to n.'''\\n return lambda n: list(range(m, 1 + n))\\n\\n\\n# fmap :: (a -> b) -> [a] -> [b]\\ndef fmap(f):\\n '''fmap over a list.\\n f lifted to a function over a list.\\n '''\\n return lambda xs: list(map(f, xs))\\n\\n\\n# scanl :: (b -> a -> b) -> b -> [a] -> [b]\\ndef scanl(f):\\n '''scanl is like reduce, but returns a succession of\\n intermediate values, building from the left.\\n '''\\n return lambda a: lambda xs: (\\n accumulate(chain([a], xs), f)\\n )\\n\\n\\n# showLog :: a -> IO String\\ndef showLog(*s):\\n '''Arguments printed with\\n intercalated arrows.'''\\n print(\\n ' -> '.join(map(str, s))\\n )\\n\\n\\n# transpose :: Matrix a -> Matrix a\\ndef transpose(m):\\n '''The rows and columns of the argument transposed.\\n (The matrix containers and rows can be lists or tuples).\\n '''\\n if m:\\n inner = type(m[0])\\n z = zip(*m)\\n return (type(m))(\\n map(inner, z) if tuple != inner else z\\n )\\n else:\\n return m\\n\\n\\n# unlines :: [String] -> String\\ndef unlines(xs):\\n '''A single string derived by the intercalation\\n of a list of strings with the newline character.\\n '''\\n return '\\\\n'.join(xs)\\n\\n\\n# TEST ----------------------------------------------------\\nif __name__ == '__main__':\\n main()\\n\",\n \"language\": \"Python\"\n },\n {\n \"code\": \" [ stack ] is rings ( --> [ )\\n\\n [ rings share\\n depth share -\\n 8 * times sp\\n emit sp emit sp\\n say 'move' cr ] is echomove ( c c --> )\\n\\n [ dup rings put\\n depth put\\n char a char b char c\\n [ swap decurse\\n rot 2dup echomove\\n decurse\\n swap rot ]\\n 3 times drop\\n depth release\\n rings release ] is hanoi ( n --> n )\\n\\n say 'How to solve a three ring Towers of Hanoi puzzle:' cr cr\\n 3 hanoi cr\\n\",\n \"language\": \"Quackery\"\n },\n {\n \"code\": \"1000 REM Towers of Hanoi\\n1010 REM Quite BASIC Puzzle Project\\n1020 CLS\\n1030 PRINT \\\"Towers of Hanoi\\\"\\n1040 PRINT\\n1050 PRINT \\\"This is a recursive solution for seven discs.\\\"\\n1060 PRINT\\n1070 PRINT \\\"See the REM statements in the program if you didn't think that recursion was possible in classic BASIC!\\\"\\n1080 REM Yep, recursive GOSUB calls works in Quite BASIC!\\n1090 REM However, to actually write useful recursive algorithms, it helps to have variable scoping and parameters to subroutines -- something classic BASIC is lacking. In this case we have only one \\\"parameter\\\" -- the variable N. And subroutines are always called with N-1. This is lucky for us because we can keep track of the value by decrementing it when we enter subroutines and incrementing it back when we exit.\\n1100 REM If we had subroutine parameters we could have written a single subroutine for moving discs from peg P to peg Q where P and Q were subroutine parameters, but no such luck. Instead we have to write six different subroutines for moving from peg to peg. See Subroutines 4000, 5000, 6000, 7000, 8000, and 9000.\\n1110 REM ===============================\\n2000 REM A, B, and C are arrays holding the discs\\n2010 REM We refer to the corresponding pegs as peg A, B, and C\\n2020 ARRAY A\\n2030 ARRAY B\\n2040 ARRAY C\\n2050 REM Fill peg A with seven discs\\n2060 FOR I = 0 TO 6\\n2070 LET A[I] = 7 - I\\n2080 NEXT I\\n2090 REM X, Y, Z hold the number of discs on pegs A, B, and C\\n2100 LET X = 7\\n2110 LET Y = 0\\n2120 LET Z = 0\\n2130 REM Disc colors\\n2140 ARRAY P\\n2150 LET P[1] = \\\"cyan\\\"\\n2160 LET P[2] = \\\"blue\\\"\\n2170 LET P[3] = \\\"green\\\"\\n2180 LET P[4] = \\\"yellow\\\"\\n2190 LET P[5] = \\\"magenta\\\"\\n2200 LET P[6] = \\\"orange\\\"\\n2210 LET P[7] = \\\"red\\\"\\n2220 REM Draw initial position -- all discs on the A peg\\n2230 FOR I = 0 TO 6\\n2240 FOR J = 8 - A[I] TO 8 + A[I]\\n2250 PLOT J, I, P[A[I]]\\n2260 NEXT J\\n2270 NEXT I\\n2280 REM N is the number of discs to move\\n2290 LET N = 7\\n2320 REM Move all discs from peg A to peg B\\n2310 GOSUB 6000\\n2320 END\\n3000 REM The subroutines 3400, 3500, 3600, 3700, 3800, 3900\\n3010 REM handle the drawing of the discs on the canvas as we\\n3020 REM move discs from one peg to another.\\n3030 REM These subroutines also update the variables X, Y, and Z\\n3040 REM which hold the number of discs on each peg.\\n3050 REM ==============================\\n3400 REM Subroutine -- Remove disc from peg A\\n3410 LET X = X - 1\\n3420 FOR I = 8 - A[X] TO 8 + A[X]\\n3430 PLOT I, X, \\\"gray\\\"\\n3440 NEXT I\\n3450 RETURN\\n3500 REM Subroutine -- Add disc to peg A\\n3510 FOR I = 8 - A[X] TO 8 + A[X]\\n3520 PLOT I, X, P[A[X]]\\n3530 NEXT I\\n3540 LET X = X + 1\\n3550 PAUSE 400 * (5 - LEVEL) + 10\\n3560 RETURN\\n3600 REM Subroutine -- Remove disc from peg B\\n3610 LET Y = Y - 1\\n3620 FOR I = 24 - B[Y] TO 24 + B[Y]\\n3630 PLOT I, Y, \\\"gray\\\"\\n3640 NEXT I\\n3650 RETURN\\n3700 REM Subroutine -- Add disc to peg B\\n3710 FOR I = 24 - B[Y] TO 24 + B[Y]\\n3720 PLOT I, Y, P[B[Y]]\\n3730 NEXT I\\n3740 LET Y = Y + 1\\n3750 PAUSE 400 * (5 - LEVEL) + 10\\n3760 RETURN\\n3800 REM Subroutine -- Remove disc from peg C\\n3810 LET Z = Z - 1\\n3820 FOR I = 40 - C[Z] TO 40 + C[Z]\\n3830 PLOT I, Z, \\\"gray\\\"\\n3840 NEXT I\\n3850 RETURN\\n3900 REM Subroutine -- Add disc to peg C\\n3910 FOR I = 40 - C[Z] TO 40 + C[Z]\\n3920 PLOT I, Z, P[C[Z]]\\n3930 NEXT I\\n3940 LET Z = Z + 1\\n3950 PAUSE 400 * (5 - LEVEL) + 10\\n3960 RETURN\\n4000 REM ======================================\\n4010 REM Recursive Subroutine -- move N discs from peg B to peg A\\n4020 REM First move N-1 discs from peg B to peg C\\n4030 LET N = N - 1\\n4040 IF N <> 0 THEN GOSUB 9000\\n4050 REM Then move one disc from peg B to peg A\\n4060 GOSUB 3600\\n4070 LET A[X] = B[Y]\\n4080 GOSUB 3500\\n4090 REM And finally move N-1 discs from peg C to peg A\\n4100 IF N <> 0 THEN GOSUB 5000\\n4110 REM Restore N before returning\\n4120 LET N = N + 1\\n4130 RETURN\\n5000 REM ======================================\\n5010 REM Recursive Subroutine -- Move N discs from peg C to peg A\\n5020 REM First move N-1 discs from peg C to peg B\\n5030 LET N = N - 1\\n5040 IF N <> 0 THEN GOSUB 8000\\n5050 REM Then move one disc from peg C to peg A\\n5060 GOSUB 3800\\n5070 LET A[X] = C[Z]\\n5080 GOSUB 3500\\n5090 REM And finally move N-1 discs from peg B to peg A\\n5100 IF N <> 0 THEN GOSUB 4000\\n5120 REM Restore N before returning\\n5130 LET N = N + 1\\n5140 RETURN\\n6000 REM ======================================\\n6000 REM Recursive Subroutine -- Move N discs from peg A to peg B\\n6010 REM First move N-1 discs from peg A to peg C\\n6020 LET N = N - 1\\n6030 IF N <> 0 THEN GOSUB 7000\\n6040 REM Then move one disc from peg A to peg B\\n6050 GOSUB 3400\\n6060 LET B[Y] = A[X]\\n6070 GOSUB 3700\\n6090 REM And finally move N-1 discs from peg C to peg B\\n6100 IF N <> 0 THEN GOSUB 8000\\n6110 REM Restore N before returning\\n6120 LET N = N + 1\\n6130 RETURN\\n7000 REM ======================================\\n7010 REM Recursive Subroutine -- Move N discs from peg A to peg C\\n7020 REM First move N-1 discs from peg A to peg B\\n7030 LET N = N - 1\\n7040 IF N <> 0 THEN GOSUB 6000\\n7050 REM Then move one disc from peg A to peg C\\n7060 GOSUB 3400\\n7070 LET C[Z] = A[X]\\n7080 GOSUB 3900\\n7090 REM And finally move N-1 discs from peg B to peg C\\n7100 IF N <> 0 THEN GOSUB 9000\\n7110 REM Restore N before returning\\n7120 LET N = N + 1\\n7130 RETURN\\n8000 REM ======================================\\n8010 REM Recursive Subroutine -- Move N discs from peg C to peg B\\n8020 REM First move N-1 discs from peg C to peg A\\n8030 LET N = N - 1\\n8040 IF N <> 0 THEN GOSUB 5000\\n8050 REM Then move one disc from peg C to peg B\\n8060 GOSUB 3800\\n8070 LET B[Y] = C[Z]\\n8080 GOSUB 3700\\n8090 REM And finally move N-1 discs from peg A to peg B\\n8100 IF N <> 0 THEN GOSUB 6000\\n8110 REM Restore N before returning\\n8120 LET N = N + 1\\n8130 RETURN\\n9000 REM ======================================\\n9010 REM Recursive Subroutine -- Move N discs from peg B to peg C\\n9020 REM First move N-1 discs from peg B to peg A\\n9030 LET N = N - 1\\n9040 IF N <> 0 THEN GOSUB 4000\\n9050 REM Then move one disc from peg B to peg C\\n9060 GOSUB 3600\\n9070 LET C[Z] = B[Y]\\n9080 GOSUB 3900\\n9090 REM And finally move N-1 discs from peg A to peg C\\n9100 IF N <> 0 THEN GOSUB 7000\\n9110 REM Restore N before returning\\n9120 LET N = N + 1\\n9130 RETURN\\n\",\n \"language\": \"Quite-BASIC\"\n },\n {\n \"code\": \"hanoimove <- function(ndisks, from, to, via) {\\n if (ndisks == 1) {\\n cat(\\\"move disk from\\\", from, \\\"to\\\", to, \\\"\\\\n\\\")\\n } else {\\n hanoimove(ndisks - 1, from, via, to)\\n hanoimove(1, from, to, via)\\n hanoimove(ndisks - 1, via, to, from)\\n }\\n}\\n\\nhanoimove(4, 1, 2, 3)\\n\",\n \"language\": \"R\"\n },\n {\n \"code\": \"#lang racket\\n(define (hanoi n a b c)\\n (when (> n 0)\\n (hanoi (- n 1) a c b)\\n (printf \\\"Move ~a to ~a\\\\n\\\" a b)\\n (hanoi (- n 1) c b a)))\\n(hanoi 4 'left 'middle 'right)\\n\",\n \"language\": \"Racket\"\n },\n {\n \"code\": \"subset Peg of Int where 1|2|3;\\n\\nmulti hanoi (0, Peg $a, Peg $b, Peg $c) { }\\nmulti hanoi (Int $n, Peg $a = 1, Peg $b = 2, Peg $c = 3) {\\n hanoi $n - 1, $a, $c, $b;\\n say \\\"Move $a to $b.\\\";\\n hanoi $n - 1, $c, $b, $a;\\n}\\n\",\n \"language\": \"Raku\"\n },\n {\n \"code\": \"public void hanoi(ndisks, startPeg, endPeg){\\n\\tif(ndisks>0){\\n\\t\\thanoi(ndisks-1, startPeg, 6 - startPeg - endPeg);\\n\\t\\tprintln(\\\"Move disk <ndisks> from peg <startPeg> to peg <endPeg>\\\");\\n\\t\\thanoi(ndisks-1, 6 - startPeg - endPeg, endPeg);\\n\\t}\\n}\\n\",\n \"language\": \"Rascal\"\n },\n {\n \"code\": \"rascal>hanoi(4,1,3)\\nMove disk 1 from peg 1 to peg 2\\nMove disk 2 from peg 1 to peg 3\\nMove disk 1 from peg 2 to peg 3\\nMove disk 3 from peg 1 to peg 2\\nMove disk 1 from peg 3 to peg 1\\nMove disk 2 from peg 3 to peg 2\\nMove disk 1 from peg 1 to peg 2\\nMove disk 4 from peg 1 to peg 3\\nMove disk 1 from peg 2 to peg 3\\nMove disk 2 from peg 2 to peg 1\\nMove disk 1 from peg 3 to peg 1\\nMove disk 3 from peg 2 to peg 3\\nMove disk 1 from peg 1 to peg 2\\nMove disk 2 from peg 1 to peg 3\\nMove disk 1 from peg 2 to peg 3\\nok\\n\",\n \"language\": \"Rascal\"\n },\n {\n \"code\": \"define hanoi use ndisks, startpeg, endpeg\\n ndisks 0 > if\\n 6 startpeg - endpeg - startpeg ndisks 1 - hanoi\\n endpeg startpeg ndisks \\\"Move disk %d from peg %d to peg %d\\\\n\\\" print\\n endpeg 6 startpeg - endpeg - ndisks 1 - hanoi\\n\\ndefine dohanoi use ndisks\\n # startpeg=1, endpeg=3\\n 3 1 ndisks hanoi\\n\\n# 4 disks\\n4 dohanoi\\n\",\n \"language\": \"Raven\"\n },\n {\n \"code\": \"REBOL [\\n\\tTitle: \\\"Towers of Hanoi\\\"\\n\\tURL: http://rosettacode.org/wiki/Towers_of_Hanoi\\n]\\n\\nhanoi: func [\\n\\t{Begin moving the golden disks from one pole to the next.\\n\\t Note: when last disk moved, the world will end.}\\n\\tdisks [integer!] \\\"Number of discs on starting pole.\\\"\\n\\t/poles \\\"Name poles.\\\"\\n\\tfrom to via\\n][\\n if disks = 0 [return]\\n\\tif not poles [from: 'left to: 'middle via: 'right]\\n\\n hanoi/poles disks - 1 from via to\\n\\tprint [from \\\"->\\\" to]\\n hanoi/poles disks - 1 via to from\\n]\\n\\nhanoi 4\\n\",\n \"language\": \"REBOL\"\n },\n {\n \"code\": \"$ENTRY Go {\\n = <Move 4 1 2 3>;\\n};\\n\\nMove {\\n 0 e.X = ;\\n s.N s.Src s.Via s.Dest, <- s.N 1>: s.Next =\\n <Move s.Next s.Src s.Dest s.Via>\\n <Prout \\\"Move disk from pole\\\" s.Src \\\"to pole\\\" s.Dest>\\n <Move s.Next s.Via s.Src s.Dest>;\\n};\\n\",\n \"language\": \"Refal\"\n },\n {\n \"code\": \"[[User:Wodan58|Wodan58]] ([[User talk:Wodan58|talk]])\\n{ 'Num 'From 'To 'Via } [ var ] a:for-each\\n\\n:set !Via !To !From !Num ;\\n:display @To @From 'Move_a_ring_from_%n_to_%n\\\\n s:format s:put ;\\n\\n:hanoi (num,from,to,via-)\\n set @Num n:-zero?\\n [ @Num @From @To @Via\\n @Num n:dec @From @Via @To hanoi set display\\n @Num n:dec @Via @To @From hanoi ] if ;\\n\\n#3 #1 #3 #2 hanoi nl\\n[[User:Wodan58|Wodan58]] ([[User talk:Wodan58|talk]])\\n\",\n \"language\": \"Retro\"\n },\n {\n \"code\": \"/*REXX program displays the moves to solve the Tower of Hanoi (with N disks). */\\nparse arg N . /*get optional number of disks from CL.*/\\nif N=='' | N==\\\",\\\" then N=3 /*Not specified? Then use the default.*/\\n#= 0 /*#: the number of disk moves (so far)*/\\nz= 2**N - 1 /*Z: \\\" \\\" \\\" minimum # of moves.*/\\ncall mov 1, 3, N /*move the top disk, then recurse ··· */\\nsay /* [↓] Display the minimum # of moves.*/\\nsay 'The minimum number of moves to solve a ' N\\\"─disk Tower of Hanoi is \\\" z\\nexit /*stick a fork in it, we're all done. */\\n/*──────────────────────────────────────────────────────────────────────────────────────*/\\nmov: procedure expose # z; parse arg @1,@2,@3; L= length(z)\\n if @3==1 then do; #= # + 1 /*bump the (disk) move counter by one. */\\n say 'step' right(#, L)\\\": move disk on tower\\\" @1 '───►' @2\\n end\\n else do; call mov @1, 6 -@1 -@2, @3 -1\\n call mov @1, @2, 1\\n call mov 6 - @1 - @2, @2, @3 -1\\n end\\n return /* [↑] this subroutine uses recursion.*/\\n\",\n \"language\": \"REXX\"\n },\n {\n \"code\": \"/*REXX program displays the moves to solve the Tower of Hanoi (with N disks). */\\nparse arg N . /*get optional number of disks from CL.*/\\nif N=='' | N==\\\",\\\" then N=3 /*Not specified? Then use the default.*/\\nsw= 80; wp= sw%3 - 1; blanks= left('', wp) /*define some default REXX variables. */\\nc.1= sw % 3 % 2 /* [↑] SW: assume default Screen Width*/\\nc.2= sw % 2 - 1 /* ◄─── C.1 C.2 C.2 are the positions*/\\nc.3= sw - 2 - c.1 /* of the 3 columns.*/\\n#= 0; z= 2**N - 1; moveK= z /*#moves; min# of moves; where to move.*/\\n@abc= 'abcdefghijklmnopqrstuvwxyN' /*dithering chars when many disks used.*/\\nebcdic= ('f2'x==2) /*determine if EBCDIC or ASCII machine.*/\\n\\nif ebcdic then do; bar= 'bf'x; ar= \\\"df\\\"x; dither= 'db9f9caf'x; down= \\\"9a\\\"x\\n tr= 'bc'x; bl= \\\"ab\\\"x; br= 'bb'x; vert= \\\"fa\\\"x; tl= 'ac'x\\n end\\n else do; bar= 'c4'x; ar= \\\"10\\\"x; dither= 'b0b1b2db'x; down= \\\"19\\\"x\\n tr= 'bf'x; bl= \\\"c0\\\"x; br= 'd9'x; vert= \\\"b3\\\"x; tl= 'da'x\\n end\\n\\nverts= vert || vert; Tcorners= tl || tr; box = left(dither, 1)\\ndowns= down || down; Bcorners= bl || br; boxChars= dither || @abc\\n$.= 0; $.1= N; k= N; kk= k + k\\n\\n do j=1 for N; @.3.j= blanks; @.2.j= blanks; @.1.j= center( copies(box, kk), wp)\\n if N<=length(boxChars) then @.1.j= translate( @.1.j, , substr( boxChars, kk%2, 1), box)\\n kk= kk - 2\\n end /*j*/ /*populate the tower of Hanoi spindles.*/\\n\\ncall showTowers; call mov 1,3,N; say\\nsay 'The minimum number of moves to solve a ' N\\\"-disk Tower of Hanoi is \\\" z\\nexit /*stick a fork in it, we're all done. */\\n/*──────────────────────────────────────────────────────────────────────────────────────*/\\ndsk: parse arg from dest; #= # + 1; pp=\\n if from==1 then do; pp= overlay(bl, pp, c.1)\\n pp= overlay(bar, pp, c.1+1, c.dest-c.1-1, bar) || tr\\n end\\n if from==2 then do\\n if dest==1 then do; pp= overlay(tl, pp, c.1)\\n pp= overlay(bar, pp, c.1+1, c.2-c.1-1,bar)||br\\n end\\n if dest==3 then do; pp= overlay(bl, pp, c.2)\\n pp= overlay(bar, pp, c.2+1, c.3-c.2-1,bar)||tr\\n end\\n end\\n if from==3 then do; pp= overlay(br, pp, c.3)\\n pp= overlay(bar, pp, c.dest+1, c.3-c.dest-1, bar)\\n pp= overlay(tl, pp, c.dest)\\n end\\n say translate(pp, downs, Bcorners || Tcorners || bar); say overlay(moveK, pp, 1)\\n say translate(pp, verts, Tcorners || Bcorners || bar)\\n say translate(pp, downs, Tcorners || Bcorners || bar); moveK= moveK - 1\\n $.from= $.from - 1; $.dest= $.dest + 1; _f= $.from + 1; _t= $.dest\\n @.dest._t= @.from._f; @.from._f= blanks; call showTowers\\n return\\n/*──────────────────────────────────────────────────────────────────────────────────────*/\\nmov: if arg(3)==1 then call dsk arg(1) arg(2)\\n else do; call mov arg(1), 6 -arg(1) -arg(2), arg(3) -1\\n call mov arg(1), arg(2), 1\\n call mov 6 -arg(1) -arg(2), arg(2), arg(3) -1\\n end /* [↑] The MOV subroutine is recursive, */\\n return /*it uses no variables, is uses BIFs instead*/\\n/*──────────────────────────────────────────────────────────────────────────────────────*/\\nshowTowers: do j=N by -1 for N; _=@.1.j @.2.j @.3.j; if _\\\\='' then say _; end; return\\n\",\n \"language\": \"REXX\"\n },\n {\n \"code\": \"move(4, 1, 2, 3)\\n\\nfunc move n, src, dst, via\\n if n > 0 move(n - 1, src, via, dst)\\n see \\\"\\\" + src + \\\" to \\\" + dst + nl\\n move(n - 1, via, dst, src) ok\\n\",\n \"language\": \"Ring\"\n },\n {\n \"code\": \"def move(num_disks, start=0, target=1, using=2)\\n if num_disks == 1\\n @towers[target] << @towers[start].pop\\n puts \\\"Move disk from #{start} to #{target} : #{@towers}\\\"\\n else\\n move(num_disks-1, start, using, target)\\n move(1, start, target, using)\\n move(num_disks-1, using, target, start)\\n end\\nend\\n\\nn = 5\\n@towers = [[*1..n].reverse, [], []]\\nmove(n)\\n\",\n \"language\": \"Ruby\"\n },\n {\n \"code\": \"# solve(source, via, target)\\n# Example:\\n# solve([5, 4, 3, 2, 1], [], [])\\n# Note this will also solve randomly placed disks,\\n# \\\"place all disk in target with legal moves only\\\".\\ndef solve(*towers)\\n # total number of disks\\n disks = towers.inject(0){|sum, tower| sum+tower.length}\\n x=0 # sequence number\\n p towers # initial trace\\n # have we solved the puzzle yet?\\n while towers.last.length < disks do\\n x+=1 # assume the next step\\n from = (x&x-1)%3\\n to = ((x|(x-1))+1)%3\\n # can we actually take from tower?\\n if top = towers[from].last\\n bottom = towers[to].last\\n # is the move legal?\\n if !bottom || bottom > top\\n # ok, do it!\\n towers[to].push(towers[from].pop)\\n p towers # trace\\n end\\n end\\n end\\nend\\n\\nsolve([5, 4, 3, 2, 1], [], [])\\n\",\n \"language\": \"Ruby\"\n },\n {\n \"code\": \"a = move(4, \\\"1\\\", \\\"2\\\", \\\"3\\\")\\nfunction move(n, a$, b$, c$)\\nif n > 0 then\\n\\ta = move(n-1, a$, c$, b$)\\n\\tprint \\\"Move disk from \\\" ; a$ ; \\\" to \\\" ; c$\\n\\ta = move(n-1, b$, a$, c$)\\nend if\\nend function\\n\",\n \"language\": \"Run-BASIC\"\n },\n {\n \"code\": \"fn move_(n: i32, from: i32, to: i32, via: i32) {\\n if n > 0 {\\n move_(n - 1, from, via, to);\\n println!(\\\"Move disk from pole {} to pole {}\\\", from, to);\\n move_(n - 1, via, to, from);\\n }\\n}\\n\\nfn main() {\\n move_(4, 1,2,3);\\n}\\n\",\n \"language\": \"Rust\"\n },\n {\n \"code\": \"hanoi 8 ‘abc\\\"\\nWHERE\\nhanoi 0 (a,b,c,) = ()\\nhanoi n ( a,b,c) = hanoi (n-1) (a,c,b) ,\\n ‘move a disc from \\\" , a , ‘ to \\\" , b , NL ,\\n hanoi (n-1) (c,b,a)\\n?\\n\",\n \"language\": \"SASL\"\n },\n {\n \"code\": \"class MAIN is\\n\\n move(ndisks, from, to, via:INT) is\\n if ndisks = 1 then\\n #OUT + \\\"Move disk from pole \\\" + from + \\\" to pole \\\" + to + \\\"\\\\n\\\";\\n else\\n move(ndisks-1, from, via, to);\\n move(1, from, to, via);\\n move(ndisks-1, via, to, from);\\n end;\\n end;\\n\\n main is\\n move(4, 1, 2, 3);\\n end;\\nend;\\n\",\n \"language\": \"Sather\"\n },\n {\n \"code\": \"def move(n: Int, from: Int, to: Int, via: Int) : Unit = {\\n if (n == 1) {\\n Console.println(\\\"Move disk from pole \\\" + from + \\\" to pole \\\" + to)\\n } else {\\n move(n - 1, from, via, to)\\n move(1, from, to, via)\\n move(n - 1, via, to, from)\\n }\\n }\\n\",\n \"language\": \"Scala\"\n },\n {\n \"code\": \"object TowersOfHanoi {\\n import scala.reflect.Manifest\\n\\n def simpleName(m:Manifest[_]):String = {\\n val name = m.toString\\n name.substring(name.lastIndexOf('$')+1)\\n }\\n\\n trait Nat\\n final class _0 extends Nat\\n final class Succ[Pre<:Nat] extends Nat\\n\\n type _1 = Succ[_0]\\n type _2 = Succ[_1]\\n type _3 = Succ[_2]\\n type _4 = Succ[_3]\\n\\n case class Move[N<:Nat,A,B,C]()\\n\\n implicit def move0[A,B,C](implicit a:Manifest[A],b:Manifest[B]):Move[_0,A,B,C] = {\\n System.out.println(\\\"Move from \\\"+simpleName(a)+\\\" to \\\"+simpleName(b));null\\n }\\n\\n implicit def moveN[P<:Nat,A,B,C](implicit m1:Move[P,A,C,B],m2:Move[_0,A,B,C],m3:Move[P,C,B,A])\\n :Move[Succ[P],A,B,C] = null\\n\\n def run[N<:Nat,A,B,C](implicit m:Move[N,A,B,C]) = null\\n\\n case class Left()\\n case class Center()\\n case class Right()\\n\\n def main(args:Array[String]){\\n run[_2,Left,Right,Center]\\n }\\n}\\n\",\n \"language\": \"Scala\"\n },\n {\n \"code\": \"(define (towers-of-hanoi n from to spare)\\n (define (print-move from to)\\n (display \\\"Move[\\\")\\n (display from)\\n (display \\\", \\\")\\n (display to)\\n (display \\\"]\\\")\\n (newline))\\n (cond ((= n 0) \\\"done\\\")\\n (else\\n (towers-of-hanoi (- n 1) from spare to)\\n (print-move from to)\\n (towers-of-hanoi (- n 1) spare to from))))\\n\\n(towers-of-hanoi 3 \\\"A\\\" \\\"B\\\" \\\"C\\\")\\n\",\n \"language\": \"Scheme\"\n },\n {\n \"code\": \"const proc: hanoi (in integer: disk, in string: source, in string: dest, in string: via) is func\\n begin\\n if disk > 0 then\\n hanoi(pred(disk), source, via, dest);\\n writeln(\\\"Move disk \\\" <& disk <& \\\" from \\\" <& source <& \\\" to \\\" <& dest);\\n hanoi(pred(disk), via, dest, source);\\n end if;\\n end func;\\n\",\n \"language\": \"Seed7\"\n },\n {\n \"code\": \"program hanoi;\\n loop for [src, dest] in move(4, 1, 2, 3) do\\n print(\\\"Move disk from pole \\\" + src + \\\" to pole \\\" + dest);\\n end loop;\\n\\n proc move(n, src, via, dest);\\n if n=0 then return []; end if;\\n return move(n-1, src, dest, via)\\n + [[src, dest]]\\n + move(n-1, via, src, dest);\\n end proc;\\nend program;\\n\",\n \"language\": \"SETL\"\n },\n {\n \"code\": \"func hanoi(n, from=1, to=2, via=3) {\\n if (n == 1) {\\n say \\\"Move disk from pole #{from} to pole #{to}.\\\";\\n } else {\\n hanoi(n-1, from, via, to);\\n hanoi( 1, from, to, via);\\n hanoi(n-1, via, to, from);\\n }\\n}\\n\\nhanoi(4);\\n\",\n \"language\": \"Sidef\"\n },\n {\n \"code\": \"* # Note: count is global\\n\\n define('hanoi(n,src,trg,tmp)') :(hanoi_end)\\nhanoi hanoi = eq(n,0) 1 :s(return)\\n hanoi(n - 1, src, tmp, trg)\\n count = count + 1\\n output = count ': Move disc from ' src ' to ' trg\\n hanoi(n - 1, tmp, trg, src) :(return)\\nhanoi_end\\n\\n* # Test with 4 discs\\n hanoi(4,'A','C','B')\\nend\\n\",\n \"language\": \"SNOBOL4\"\n },\n {\n \"code\": \"#!/usr/local/bin/spar\\npragma annotate( summary, \\\"hanoi\\\" )\\n @( description, \\\"Solve the Towers of Hanoi problem with recursion.\\\" )\\n @( see_also, \\\"https://rosettacode.org/wiki/Towers_of_Hanoi\\\" )\\n @( author, \\\"Ken O. Burtch\\\" );\\npragma license( unrestricted );\\n\\npragma restriction( no_external_commands );\\n\\nprocedure hanoi is\\n type pegs is (left, center, right);\\n\\n -- Determine the moves\\n\\n procedure solve( num_disks : natural; start_peg : pegs; end_peg : pegs; via_peg : pegs ) is\\n begin\\n if num_disks > 0 then\\n solve( num_disks - 1, start_peg, via_peg, end_peg );\\n put( \\\"Move disk\\\" )@( num_disks )@( \\\" from \\\" )@( start_peg )@( \\\" to \\\" )@( end_peg );\\n new_line;\\n solve( num_disks - 1, via_peg, end_peg, start_peg );\\n end if;\\n end solve;\\n\\nbegin\\n -- solve with 4 disks at the left\\n --solve( 4, left, right, center );\\n solve( 4, left, right, center );\\n put_line( \\\"Towers of Hanoi puzzle completed\\\" );\\nend hanoi;\\n\",\n \"language\": \"SparForte\"\n },\n {\n \"code\": \"function hanoi(n, a, b, c) {\\n\\tif (n>0) {\\n\\t\\thanoi(n-1, a, c, b)\\n\\t\\tprintf(\\\"Move from %f to %f\\\\n\\\", a, b)\\n\\t\\thanoi(n-1, c, b, a)\\n\\t}\\n}\\n\\nhanoi(3, 1, 2, 3)\\n\\nMove from 1 to 2\\nMove from 1 to 3\\nMove from 2 to 3\\nMove from 1 to 2\\nMove from 3 to 1\\nMove from 3 to 2\\nMove from 1 to 2\\n\",\n \"language\": \"Stata\"\n },\n {\n \"code\": \"func hanoi(n:Int, a:String, b:String, c:String) {\\n if (n > 0) {\\n hanoi(n - 1, a, c, b)\\n println(\\\"Move disk from \\\\(a) to \\\\(c)\\\")\\n hanoi(n - 1, b, a, c)\\n }\\n}\\n\\nhanoi(4, \\\"A\\\", \\\"B\\\", \\\"C\\\")\\n\",\n \"language\": \"Swift\"\n },\n {\n \"code\": \"func hanoi(n:Int, a:String, b:String, c:String) {\\n if (n > 0) {\\n hanoi(n - 1, a: a, b: c, c: b)\\n print(\\\"Move disk from \\\\(a) to \\\\(c)\\\")\\n hanoi(n - 1, a: b, b: a, c: c)\\n }\\n}\\n\\nhanoi(4, a:\\\"A\\\", b:\\\"B\\\", c:\\\"C\\\")\\n\",\n \"language\": \"Swift\"\n },\n {\n \"code\": \"interp alias {} hanoi {} do_hanoi 0\\n\\nproc do_hanoi {count n {from A} {to C} {via B}} {\\n if {$n == 1} {\\n interp alias {} hanoi {} do_hanoi [incr count]\\n puts \\\"$count: move from $from to $to\\\"\\n } else {\\n incr n -1\\n hanoi $n $from $via $to\\n hanoi 1 $from $to $via\\n hanoi $n $via $to $from\\n }\\n}\\n\\nhanoi 4\\n\",\n \"language\": \"Tcl\"\n },\n {\n \"code\": \"PROGRAM:TOHSOLVE\\n0→A\\n1→B\\n0→C\\n0→D\\n0→M\\n1→R\\nWhile A<1 or A>7\\nInput \\\"No. of rings=?\\\",A\\nEnd\\nrandM(A+1,3)→[C]\\n[[1,2][1,3][2,3]]→[E]\\n\\nFill(0,[C])\\nFor(I,1,A,1)\\nI?[C](I,1)\\nEnd\\nClrHome\\nWhile [C](1,3)≠1 and [C](1,2)≠1\\n\\nFor(J,1,3)\\nFor(I,1,A)\\nIf [C](I,J)≠0:Then\\nOutput(I+1,3J,[C](I,J))\\nEnd\\nEnd\\nEnd\\nWhile C=0\\nOutput(1,3B,\\\" \\\")\\n1→I\\n[E](R,2)→J\\nWhile [C](I,J)=0 and I≤A\\nI+1→I\\nEnd\\n[C](I,J)→D\\n1→I\\n[E](R,1)→J\\nWhile [C](I,J)=0 and I≤A\\nI+1→I\\nEnd\\nIf (D<[C](I,J) and D≠0) or [C](I,J)=0:Then\\n[E](R,2)→B\\nElse\\n[E](R,1)→B\\nEnd\\n\\n1→I\\nWhile [C](I,B)=0 and I≤A\\nI+1→I\\nEnd\\nIf I≤A:Then\\n[C](I,B)→C\\n0→[C](I,B)\\nOutput(I+1,3B,\\\" \\\")\\nEnd\\nOutput(1,3B,\\\"V\\\")\\nEnd\\n\\nWhile C≠0\\nOutput(1,3B,\\\" \\\")\\nIf B=[E](R,2):Then\\n[E](R,1)→B\\nElse\\n[E](R,2)→B\\nEnd\\n\\n1→I\\nWhile [C](I,B)=0 and I≤A\\nI+1→I\\nEnd\\nIf [C](I,B)=0 or [C](I,B)>C:Then\\nC→[C](I-1,B)\\n0→C\\nM+1→M\\nEnd\\nEnd\\nOutput(1,3B,\\\"V\\\")\\nR+1→R\\nIf R=4:Then:1→R:End\\n\\nEnd\\n\",\n \"language\": \"TI-83-BASIC\"\n },\n {\n \"code\": \" 5 PRINT \\\"How many disks?\\\"\\n INPUT D\\n IF D < 1 THEN GOTO 5\\n IF D > 10 THEN GOTO 5\\n LET N = 1\\n10 IF D = 0 THEN GOTO 20\\n LET D = D - 1\\n LET N = 2*N\\n GOTO 10\\n20 LET X = 0\\n30 LET X = X + 1\\n IF X = N THEN END\\n GOSUB 40\\n LET S = S - 3*(S/3)\\n GOSUB 50\\n LET T = T + 1\\n LET T = T - 3*(T/3)\\n PRINT \\\"Move disc on peg \\\",S+1,\\\" to peg \\\",T+1\\n GOTO 30\\n40 LET B = X - 1\\n LET A = X\\n LET S = 0\\n LET Z = 2048\\n45 LET C = 0\\n IF B >= Z THEN LET C = 1\\n IF A >= Z THEN LET C = C + 1\\n IF C = 2 THEN LET S = S + Z\\n IF A >= Z THEN LET A = A - Z\\n IF B >= Z THEN LET B = B - Z\\n LET Z = Z / 2\\n IF Z = 0 THEN RETURN\\n GOTO 45\\n50 LET B = X - 1\\n LET A = X\\n LET T = 0\\n LET Z = 2048\\n55 LET C = 0\\n IF B >= Z THEN LET C = 1\\n IF A >= Z THEN LET C = C + 1\\n IF C > 0 THEN LET T = T + Z\\n IF A >= Z THEN LET A = A - Z\\n IF B >= Z THEN LET B = B - Z\\n LET Z = Z / 2\\n IF Z = 0 THEN RETURN\\n GOTO 55\\n\",\n \"language\": \"Tiny-BASIC\"\n },\n {\n \"code\": \"value| sa sb sc n |\\n[ to sc to sb to sa to n ] is vars!\\n[ ( num from to via -- )\\n vars!\\n n 0 <>\\n [\\n n sa sb sc\\n n 1- sa sc sb recurse\\n vars!\\n .\\\" Move a ring from \\\" sa . .\\\" to \\\" sb . cr\\n n 1- sc sb sa recurse\\n ] ifTrue\\n] is hanoi\\n\",\n \"language\": \"Toka\"\n },\n {\n \"code\": \"DECLARE SUB hanoi\\n\\nSUB hanoi(n, desde , hasta, via)\\n IF n > 0 THEN\\n CALL hanoi(n - 1, desde, via, hasta)\\n PRINT \\\"Mover disco\\\"; n; \\\"desde posición\\\"; desde; \\\"hasta posición\\\"; hasta\\n CALL hanoi(n - 1, via, hasta, desde)\\n END IF\\nEND SUB\\n\\nPRINT \\\"Tres discos\\\"\\nPRINT\\nCALL hanoi(3, 1, 2, 3)\\nPRINT\\nPRINT \\\"Cuatro discos\\\"\\nPRINT\\nCALL hanoi(4, 1, 2, 3)\\nPRINT\\nPRINT \\\"Pulsa un tecla para salir\\\"\\nEND\\n\",\n \"language\": \"True-BASIC\"\n },\n {\n \"code\": \"// library: program: run: towersofhanoi: recursive: sub <description></description> <version>1.0.0.0.0</version> <version control></version control> (filenamemacro=runprrsu.s) [kn, ri, tu, 07-02-2012 19:54:23]\\nPROC PROCProgramRunTowersofhanoiRecursiveSub( INTEGER totalDiskI, STRING fromS, STRING toS, STRING viaS, INTEGER bufferI )\\n IF ( totalDiskI == 0 )\\n RETURN()\\n ENDIF\\n PROCProgramRunTowersofhanoiRecursiveSub( totalDiskI - 1, fromS, viaS, toS, bufferI )\\n AddLine( Format( \\\"Move disk\\\", \\\" \\\", totalDiskI, \\\" \\\", \\\"from peg\\\", \\\" \\\", \\\"'\\\", fromS, \\\"'\\\", \\\" \\\", \\\"to peg\\\", \\\" \\\", \\\"'\\\", toS, \\\"'\\\" ), bufferI )\\n PROCProgramRunTowersofhanoiRecursiveSub( totalDiskI - 1, viaS, toS, fromS, bufferI )\\nEND\\n\\n// library: program: run: towersofhanoi: recursive <description></description> <version>1.0.0.0.6</version> <version control></version control> (filenamemacro=runprtre.s) [kn, ri, tu, 07-02-2012 19:40:45]\\nPROC PROCProgramRunTowersofhanoiRecursive( INTEGER totalDiskI, STRING fromS, STRING toS, STRING viaS )\\n INTEGER bufferI = 0\\n PushPosition()\\n bufferI = CreateTempBuffer()\\n PopPosition()\\n PROCProgramRunTowersofhanoiRecursiveSub( totalDiskI, fromS, toS, viaS, bufferI )\\n GotoBufferId( bufferI )\\nEND\\n\\nPROC Main()\\nSTRING s1[255] = \\\"4\\\"\\nIF ( NOT ( Ask( \\\"program: run: towersofhanoi: recursive: totalDiskI = \\\", s1, _EDIT_HISTORY_ ) ) AND ( Length( s1 ) > 0 ) ) RETURN() ENDIF\\n PROCProgramRunTowersofhanoiRecursive( Val( s1 ), \\\"source\\\", \\\"target\\\", \\\"via\\\" )\\nEND\\n\",\n \"language\": \"TSE-SAL\"\n },\n {\n \"code\": \"F ← |1.0 (\\n ⟨\\n &p ⊏[1 2] &pf \\\"Move disc [from to]: \\\"\\n | F⍜(⊡0|-1)⍜(⊏[2 3]|⇌).\\n F⍜(⊡0|1◌).\\n F⍜(⊡0|-1)⍜(⊏[1 3]|⇌)\\n ⟩≠1⊢.\\n)\\nF [4 1 2 3]\\n\",\n \"language\": \"Uiua\"\n },\n {\n \"code\": \"function move {\\n typeset -i n=$1\\n typeset from=$2\\n typeset to=$3\\n typeset via=$4\\n\\n if (( n )); then\\n move $(( n - 1 )) \\\"$from\\\" \\\"$via\\\" \\\"$to\\\"\\n echo \\\"Move disk from pole $from to pole $to\\\"\\n move $(( n - 1 )) \\\"$via\\\" \\\"$to\\\" \\\"$from\\\"\\n fi\\n}\\n\\nmove \\\"$@\\\"\\n\",\n \"language\": \"UNIX-Shell\"\n },\n {\n \"code\": \"#!/bin/sh\\nif [ \\\"$1\\\" -gt 0 ]; then\\n \\\"$0\\\" \\\"`expr $1 - 1`\\\" \\\"$2\\\" \\\"$4\\\" \\\"$3\\\"\\n echo \\\"Move disk from pole $2 to pole $3\\\"\\n \\\"$0\\\" \\\"`expr $1 - 1`\\\" \\\"$4\\\" \\\"$3\\\" \\\"$2\\\"\\nfi\\n\",\n \"language\": \"UNIX-Shell\"\n },\n {\n \"code\": \"#import nat\\n\\nmove = ~&al^& ^rlPlrrPCT/~&arhthPX ^|W/~& ^|G/predecessor ^/~&htxPC ~&zyxPC\\n\\n#show+\\n\\nmain = ^|T(~&,' -> '--)* move/4 <'start','end','middle'>\\n\",\n \"language\": \"Ursala\"\n },\n {\n \"code\": \"|10 @Console &vector $2 &read $1 &pad $4 &type $1 &write $1 &error $1\\n\\n|0100 ( -> )\\n #0102 [ LIT2 03 &count 04 ] hanoi\\n POP2 POP2 BRK\\n\\n@hanoi ( from spare to count -: from spare to count )\\n ( moving 0 disks is no-op )\\n DUP ?{ JMP2r }\\n\\n ( move disks 1..count-1 to the spare peg )\\n #01 SUB ROT SWP hanoi\\n ( from to spare count-1 )\\n\\n ( print the current move )\\n ;dict/move print-str\\n INCk #30 ORA .Console/write DEO\\n STH2\\n ;dict/from print-str\\n OVR #30 ORA .Console/write DEO\\n ;dict/to print-str\\n DUP #30 ORA .Console/write DEO\\n [ LIT2 0a -Console/write ] DEO\\n STH2r\\n\\n ( move disks 1..count-1 from the spare peg to the goal peg )\\n STH ROT ROT STHr hanoi\\n\\n ( restore original parameters for convenient recursion )\\n STH2 SWP STH2r INC\\n\\n JMP2r\\n\\n@print-str\\n &loop\\n LDAk .Console/write DEO\\n INC2 LDAk ?&loop\\n POP2 JMP2r\\n\\n@dict\\n &move \\\"Move 20 \\\"disk 2000\\n &from 20 \\\"from 20 \\\"pole 2000\\n &to 20 \\\"to 20 \\\"pole 2000\\n\",\n \"language\": \"Uxntal\"\n },\n {\n \"code\": \"fn main() {\\n\\thanoi(4, \\\"A\\\", \\\"B\\\", \\\"C\\\")\\n}\\n\\nfn hanoi(n u64, a string, b string, c string) {\\n if n > 0 {\\n hanoi(n - 1, a, c, b)\\n println(\\\"Move disk from ${a} to ${c}\\\")\\n hanoi(n - 1, b, a, c)\\n }\\n}\\n\",\n \"language\": \"V-(Vlang)\"\n },\n {\n \"code\": \"Sub Move(n,fromPeg,toPeg,viaPeg)\\n\\tIf n > 0 Then\\n\\t\\tMove n-1, fromPeg, viaPeg, toPeg\\n\\t\\tWScript.StdOut.Write \\\"Move disk from \\\" & fromPeg & \\\" to \\\" & toPeg\\n\\t\\tWScript.StdOut.WriteBlankLines(1)\\n\\t\\tMove n-1, viaPeg, toPeg, fromPeg\\n\\tEnd If\\nEnd Sub\\n\\nMove 4,1,2,3\\nWScript.StdOut.Write(\\\"Towers of Hanoi puzzle completed!\\\")\\n\",\n \"language\": \"VBScript\"\n },\n {\n \"code\": \"#1=1; #2=2; #3=3; #4=4 // move 4 disks from 1 to 2\\nCall(\\\"MOVE_DISKS\\\")\\nReturn\\n\\n// Move disks\\n// #1 = from, #2 = to, #3 = via, #4 = number of disks\\n//\\n:MOVE_DISKS:\\nif (#4 > 0) {\\n Num_Push(1,4)\\n #9=#2; #2=#3; #3=#9; #4-- // #1 to #3 via #2\\n Call(\\\"MOVE_DISKS\\\")\\n Num_Pop(1,4)\\n\\n Ins_Text(\\\"Move a disk from \\\") // move one disk\\n Num_Ins(#1, LEFT+NOCR)\\n Ins_Text(\\\" to \\\")\\n Num_Ins(#2, LEFT)\\n\\n Num_Push(1,4)\\n #9=#1; #1=#3; #3 = #9; #4-- // #3 to #2 via #1\\n Call(\\\"MOVE_DISKS\\\")\\n Num_Pop(1,4)\\n}\\nReturn\\n\",\n \"language\": \"Vedit-macro-language\"\n },\n {\n \"code\": \"function TowersOfHanoi(n, from, to, via)\\n if (a:n > 1)\\n call TowersOfHanoi(a:n-1, a:from, a:via, a:to)\\n endif\\n echom(\\\"Move a disc from \\\" . a:from . \\\" to \\\" . a:to)\\n if (a:n > 1)\\n call TowersOfHanoi(a:n-1, a:via, a:to, a:from)\\n endif\\nendfunction\\n\\ncall TowersOfHanoi(4, 1, 3, 2)\\n\",\n \"language\": \"Vim-Script\"\n },\n {\n \"code\": \"Module TowersOfHanoi\\n Sub MoveTowerDisks(ByVal disks As Integer, ByVal fromTower As Integer, ByVal toTower As Integer, ByVal viaTower As Integer)\\n If disks > 0 Then\\n MoveTowerDisks(disks - 1, fromTower, viaTower, toTower)\\n System.Console.WriteLine(\\\"Move disk {0} from {1} to {2}\\\", disks, fromTower, toTower)\\n MoveTowerDisks(disks - 1, viaTower, toTower, fromTower)\\n End If\\n End Sub\\n\\n Sub Main()\\n MoveTowerDisks(4, 1, 2, 3)\\n End Sub\\nEnd Module\\n\",\n \"language\": \"Visual-Basic-.NET\"\n },\n {\n \"code\": \"1000 N=4\\n1010 F=1\\n1020 T=2\\n1030 V=3\\n1040 S=0\\n1050 #=2000\\n1060 #=9999\\n2000 R=!\\n2010 #=N<1*2210\\n2020 #=4000\\n2030 N=N-1\\n2040 A=T\\n2050 T=V\\n2060 V=A\\n2070 #=2000\\n2080 #=5000\\n2090 ?=\\\"Move disk from peg: \\\";\\n2100 ?=F\\n2110 ?=\\\" to peg: \\\";\\n2120 ?=T\\n2130 ?=\\\"\\\"\\n2140 #=4000\\n2150 N=N-1\\n2160 A=F\\n2170 F=V\\n2180 V=A\\n2190 #=2000\\n2200 #=5000\\n2210 #=R\\n4000 S=S+1\\n4010 :S)=R\\n4020 S=S+1\\n4030 :S)=N\\n4040 S=S+1\\n4050 :S)=F\\n4060 S=S+1\\n4070 :S)=V\\n4080 S=S+1\\n4090 :S)=T\\n4100 #=!\\n5000 T=:S)\\n5010 S=S-1\\n5020 V=:S)\\n5030 S=S-1\\n5040 F=:S)\\n5050 S=S-1\\n5060 N=:S)\\n5070 S=S-1\\n5080 R=:S)\\n5090 S=S-1\\n5100 #=!\\n\",\n \"language\": \"VTL-2\"\n },\n {\n \"code\": \"class Hanoi {\\n construct new(disks) {\\n _moves = 0\\n System.print(\\\"Towers of Hanoi with %(disks) disks:\\\\n\\\")\\n move(disks, \\\"L\\\", \\\"C\\\", \\\"R\\\")\\n System.print(\\\"\\\\nCompleted in %(_moves) moves\\\\n\\\")\\n }\\n\\n move(n, from, to, via) {\\n if (n > 0) {\\n move(n - 1, from, via, to)\\n _moves = _moves + 1\\n System.print(\\\"Move disk %(n) from %(from) to %(to)\\\")\\n move(n - 1, via, to, from)\\n }\\n }\\n}\\n\\nHanoi.new(3)\\nHanoi.new(4)\\n\",\n \"language\": \"Wren\"\n },\n {\n \"code\": \"PROGRAM\\t\\\"Hanoi\\\"\\nVERSION\\t\\\"0.0000\\\"\\n\\nDECLARE FUNCTION Entry ()\\nDECLARE FUNCTION Hanoi(n, desde , hasta, via)\\n\\nFUNCTION Entry ()\\n\\tPRINT \\\"Three disks\\\\n\\\"\\n\\tHanoi (3, 1, 2, 3)\\n\\tPRINT \\\"\\\\nFour discks\\\\n\\\"\\n\\tHanoi (4, 1, 2, 3)\\n\\tPRINT \\\"\\\\nTowers of Hanoi puzzle completed!\\\"\\nEND FUNCTION\\n\\nFUNCTION Hanoi (n, desde , hasta, via)\\n IF n > 0 THEN\\n Hanoi (n - 1, desde, via, hasta)\\n PRINT \\\"Move disk\\\"; n; \\\" from pole\\\"; desde; \\\" to pole\\\"; hasta\\n Hanoi (n - 1, via, hasta, desde)\\n END IF\\nEND FUNCTION\\nEND PROGRAM\\n\",\n \"language\": \"XBasic\"\n },\n {\n \"code\": \"code Text=12;\\n\\nproc MoveTower(Discs, From, To, Using);\\nint Discs, From, To, Using;\\n[if Discs > 0 then\\n [MoveTower(Discs-1, From, Using, To);\\n Text(0, \\\"Move from \\\"); Text(0, From);\\n Text(0, \\\" peg to \\\"); Text(0, To); Text(0, \\\" peg.^M^J\\\");\\n MoveTower(Discs-1, Using, To, From);\\n ];\\n];\\n\\nMoveTower(3, \\\"left\\\", \\\"right\\\", \\\"center\\\")\\n\",\n \"language\": \"XPL0\"\n },\n {\n \"code\": \"declare function local:hanoi($disk as xs:integer, $from as xs:integer,\\n $to as xs:integer, $via as xs:integer) as element()*\\n{\\n if($disk > 0)\\n then (\\n local:hanoi($disk - 1, $from, $via, $to),\\n <move disk='{$disk}'><from>{$from}</from><to>{$to}</to></move>,\\n local:hanoi($disk - 1, $via, $to, $from)\\n )\\n else ()\\n};\\n\\n<hanoi>\\n{\\n local:hanoi(4, 1, 2, 3)\\n}\\n</hanoi>\\n\",\n \"language\": \"XQuery\"\n },\n {\n \"code\": \"<?xml version=\\\"1.0\\\" encoding=\\\"UTF-8\\\"?>\\n<hanoi>\\n <move disk=\\\"1\\\">\\n <from>1</from>\\n <to>3</to>\\n </move>\\n <move disk=\\\"2\\\">\\n <from>1</from>\\n <to>2</to>\\n </move>\\n <move disk=\\\"1\\\">\\n <from>3</from>\\n <to>2</to>\\n </move>\\n <move disk=\\\"3\\\">\\n <from>1</from>\\n <to>3</to>\\n </move>\\n <move disk=\\\"1\\\">\\n <from>2</from>\\n <to>1</to>\\n </move>\\n <move disk=\\\"2\\\">\\n <from>2</from>\\n <to>3</to>\\n </move>\\n <move disk=\\\"1\\\">\\n <from>1</from>\\n <to>3</to>\\n </move>\\n <move disk=\\\"4\\\">\\n <from>1</from>\\n <to>2</to>\\n </move>\\n <move disk=\\\"1\\\">\\n <from>3</from>\\n <to>2</to>\\n </move>\\n <move disk=\\\"2\\\">\\n <from>3</from>\\n <to>1</to>\\n </move>\\n <move disk=\\\"1\\\">\\n <from>2</from>\\n <to>1</to>\\n </move>\\n <move disk=\\\"3\\\">\\n <from>3</from>\\n <to>2</to>\\n </move>\\n <move disk=\\\"1\\\">\\n <from>1</from>\\n <to>3</to>\\n </move>\\n <move disk=\\\"2\\\">\\n <from>1</from>\\n <to>2</to>\\n </move>\\n <move disk=\\\"1\\\">\\n <from>3</from>\\n <to>2</to>\\n </move>\\n</hanoi>\\n\",\n \"language\": \"XQuery\"\n },\n {\n \"code\": \"<xsl:template name=\\\"hanoi\\\">\\n<xsl:param name=\\\"n\\\"/>\\n<xsl:param name=\\\"from\\\">left</xsl:param>\\n<xsl:param name=\\\"to\\\">middle</xsl:param>\\n<xsl:param name=\\\"via\\\">right</xsl:param>\\n <xsl:if test=\\\"$n > 0\\\">\\n <xsl:call-template name=\\\"hanoi\\\">\\n <xsl:with-param name=\\\"n\\\" select=\\\"$n - 1\\\"/>\\n <xsl:with-param name=\\\"from\\\" select=\\\"$from\\\"/>\\n <xsl:with-param name=\\\"to\\\" select=\\\"$via\\\"/>\\n <xsl:with-param name=\\\"via\\\" select=\\\"$to\\\"/>\\n </xsl:call-template>\\n <fo:block>\\n <xsl:text>Move disk from </xsl:text>\\n <xsl:value-of select=\\\"$from\\\"/>\\n <xsl:text> to </xsl:text>\\n <xsl:value-of select=\\\"$to\\\"/>\\n </fo:block>\\n <xsl:call-template name=\\\"hanoi\\\">\\n <xsl:with-param name=\\\"n\\\" select=\\\"$n - 1\\\"/>\\n <xsl:with-param name=\\\"from\\\" select=\\\"$via\\\"/>\\n <xsl:with-param name=\\\"to\\\" select=\\\"$to\\\"/>\\n <xsl:with-param name=\\\"via\\\" select=\\\"$from\\\"/>\\n </xsl:call-template>\\n </xsl:if>\\n</xsl:template>\\n\",\n \"language\": \"XSLT\"\n },\n {\n \"code\": \"sub hanoi(ndisks, startPeg, endPeg)\\n if ndisks then\\n hanoi(ndisks-1, startPeg, 6-startPeg-endPeg)\\n //print \\\"Move disk \\\", ndisks, \\\" from \\\", startPeg, \\\" to \\\", endPeg\\n hanoi(ndisks-1, 6-startPeg-endPeg, endPeg)\\n end if\\nend sub\\n\\nprint \\\"Be patient, please.\\\\n\\\\n\\\"\\nprint \\\"Hanoi 1 ellapsed ... \\\";\\n\\nt1 = peek(\\\"millisrunning\\\")\\nhanoi(22, 1, 3)\\nt2 = peek(\\\"millisrunning\\\")\\nprint t2-t1, \\\" ms\\\"\\n\\n\\nsub hanoi2(n, from, to_, via)\\n if n = 1 then\\n\\t//print \\\"Move from \\\", from, \\\" to \\\", to_\\n else\\n\\thanoi2(n - 1, from, via , to_ )\\n \\thanoi2(1 , from, to_ , via )\\n \\thanoi2(n - 1, via , to_ , from)\\n end if\\nend sub\\n\\nprint \\\"Hanoi 2 ellapsed ... \\\";\\nhanoi2(22, 1, 3, 2)\\nprint peek(\\\"millisrunning\\\") - t2, \\\" ms\\\"\\n\",\n \"language\": \"Yabasic\"\n },\n {\n \"code\": \"\\t;\\n\\t; Towers of Hanoi using Z80 assembly language\\n\\t;\\n\\t; Runs under CP/M 3.1 on YAZE-AG-2.51.2 Z80 emulator\\n\\t; Assembled with zsm4 on same emulator/OS, uses macro capabilities of said assembler\\n\\t; Created with vim under Windows\\n\\t;\\n\\t; 2023-05-29 Xorph\\n\\t;\\n\\n\\t;\\n\\t; Useful definitions\\n\\t;\\n\\n\\tbdos\\tequ 05h\\t\\t; Call to CP/M BDOS function\\n\\tstrdel\\tequ 6eh\\t\\t; Set string delimiter\\n\\twrtstr\\tequ 09h\\t\\t; Write string to console\\n\\n\\tnul\\tequ 00h\\t\\t; ASCII control characters\\n\\tcr\\tequ 0dh\\n\\tlf\\tequ 0ah\\n\\n\\tcnull\\tequ '0'\\t\\t; ASCII character constants\\n\\tca\\tequ 'A'\\n\\tcb\\tequ 'B'\\n\\tcc\\tequ 'C'\\n\\n\\tdisks\\tequ 4\\t\\t; Number of disks to move\\n\\n\\t;\\n\\t; Macros for BDOS calls\\n\\t;\\n\\nsetdel \\tmacro\\tchar\\t\\t; Set string delimiter to char\\n\\tld\\tc,strdel\\n\\tld\\te,char\\n\\tcall\\tbdos\\n\\tendm\\n\\nprint \\tmacro\\tmsg\\t\\t; Output string to console\\n\\tld\\tc,wrtstr\\n\\tld\\tde,msg\\n\\tcall\\tbdos\\n\\tendm\\n\\npushall\\tmacro\\t\\t\\t; Save required registers to stack\\n\\tpush\\taf\\n\\tpush\\tbc\\n\\tpush\\tde\\n\\tendm\\n\\npopall\\tmacro\\t\\t\\t; Recall required registers from stack\\n\\tpop\\tde\\n\\tpop\\tbc\\n\\tpop\\taf\\n\\tendm\\n\\n\\t;\\n\\t; =====================\\n\\t; Start of main program\\n\\t; =====================\\n\\t;\\n\\n\\tcseg\\n\\n\\tsetdel\\tnul\\t\\t; Set string delimiter to 00h\\n\\n\\tld\\ta,disks\\t\\t; Initialization:\\n\\tld\\tb,ca\\t\\t; Tower A is source\\n\\tld\\tc,cb\\t\\t; Tower B is target\\n\\tld\\td,cc\\t\\t; Tower C is intermediate\\n\\nhanoi:\\n\\t;\\n\\t; Parameters in registers:\\n\\t; Move a disks from b (source) to c (target) via d (intermediate)\\n\\t;\\n\\n\\tor\\ta\\t\\t; If 0 disks to move, return\\n\\tret\\tz\\n\\n\\tdec\\ta\\t\\t; Move all but lowest disk from source to intermediate via target\\n\\tpushall\\t\\t\\t; Save registers\\n\\tld\\te,c\\t\\t; Exchange c and d (target and intermediate)\\n\\tld\\tc,d\\n\\tld\\td,e\\n\\tcall\\thanoi\\t\\t; First recursion\\n\\tpopall\\t\\t\\t; Restore registers\\n\\n\\tld\\thl,source\\t; Print move of lowest disk from source to target, save registers during BDOS call\\n\\tld\\t(hl),b\\t\\t; Source is still in b\\n\\tld\\thl,target\\n\\tld\\t(hl),c\\t\\t; Target is back in c due to popall\\n\\n\\tpushall\\n\\tprint\\tmovement\\n\\tpopall\\n\\n\\tld\\te,b\\t\\t; Now move stack from intermediate to target via source\\n\\tld\\tb,d\\t\\t; Source is still in b, target in c and intermediate in d\\n\\tld\\td,e\\n\\tjr\\thanoi\\t\\t; Optimize tail recursion\\n\\n\\t;\\n\\t; ================\\n\\t; Data definitions\\n\\t; ================\\n\\t;\\n\\n\\tdseg\\n\\nmovement:\\n\\tdefb\\t'Move disk from tower '\\nsource:\\n\\tdefs\\t1\\n\\tdefb\\t' to tower '\\ntarget:\\n\\tdefs\\t1\\ncrlf:\\n\\tdefb\\tcr,lf,nul\\n\",\n \"language\": \"Z80-Assembly\"\n },\n {\n \"code\": \"const std = @import(\\\"std\\\");\\n\\npub fn print(from: u32, to: u32) void {\\n std.log.info(\\\"Moving disk from rod {} to rod {}\\\", .{ from, to });\\n}\\n\\npub fn move(n: u32, from: u32, via: u32, to: u32) void {\\n if (n > 1) {\\n move(n - 1, from, to, via);\\n print(from, to);\\n move(n - 1, via, from, to);\\n } else {\\n print(from, to);\\n }\\n}\\n\\npub fn main() !void {\\n move(4, 1, 2, 3);\\n}\\n\",\n \"language\": \"Zig\"\n },\n {\n \"code\": \"fcn move(n, from,to,via){\\n if (n>0){\\n move(n-1, from,via,to);\\n println(\\\"Move disk from pole %d to pole %d\\\".fmt(from, to));\\n move(n-1, via,to,from);\\n }\\n}\\nmove(3, 1,2,3);\\n\",\n \"language\": \"Zkl\"\n }\n]","isConversational":false},"task_name":{"kind":"string","value":"Towers-of-Hanoi"}}},{"rowIdx":1768,"cells":{"solutions":{"kind":"list like","value":[{"code":"---\nfrom: http://rosettacode.org/wiki/Trabb_Pardo–Knuth_algorithm\n","language":"00-META"},{"code":"The TPK algorithm is an early example of a programming chrestomathy. \nIt was used in Donald Knuth and Luis Trabb Pardo's Stanford tech report [http://bitsavers.org/pdf/stanford/cs_techReports/STAN-CS-76-562_EarlyDevelPgmgLang_Aug76.pdf The Early Development of Programming Languages]. \nThe report traces the early history of work in developing computer languages in the 1940s and 1950s, giving several translations of the algorithm.\n\nFrom the [[wp:Trabb Pardo–Knuth algorithm|wikipedia entry]]:\n\n '''ask''' for 11 numbers to be read into a sequence ''S''\n '''reverse''' sequence ''S''\n '''for each''' ''item'' '''in''' sequence ''S''\n ''result'' ''':=''' '''call''' a function to do an ''operation''\n '''if''' ''result'' overflows\n '''alert''' user\n '''else'''\n '''print''' ''result''\n\nThe task is to implement the algorithm:\n# Use the function: <big><math>f(x) = |x|^{0.5} + 5x^3</math></big>\n# The overflow condition is an answer of greater than 400.\n# The 'user alert' should not stop processing of other items of the sequence.\n# Print a prompt before accepting '''eleven''', textual, numeric inputs.\n# You may optionally print the item as well as its associated result, but the results must be in reverse order of input.\n# The sequence ''' ''S'' ''' may be 'implied' and so not shown explicitly.\n# ''Print and show the program in action from a typical run here''. (If the output is graphical rather than text then either add a screendump or describe textually what is displayed).\n<br><br>\n\n","language":"00-TASK"},{"code":"F f(x)\n R sqrt(abs(x)) + 5 * x ^ 3\n\nV s = Array(1..11)\ns.reverse()\nL(x) s\n V result = f(x)\n I result > 400\n print(‘#.: #.’.format(x, ‘TOO LARGE!’))\n E\n print(‘#.: #.’.format(x, result))\nprint()\n","language":"11l"},{"code":"with Ada.Text_IO, Ada.Numerics.Generic_Elementary_Functions;\n\nprocedure Trabb_Pardo_Knuth is\n\n type Real is digits 6 range -400.0 .. 400.0;\n\n package TIO renames Ada.Text_IO;\n package FIO is new TIO.Float_IO(Real);\n package Math is new Ada.Numerics.Generic_Elementary_Functions(Real);\n\n function F(X: Real) return Real is\n begin\n return (Math.Sqrt(abs(X)) + 5.0 * X**3);\n end F;\n\n Values: array(1 .. 11) of Real;\n\nbegin\n TIO.Put(\"Please enter 11 Numbers:\");\n for I in Values'Range loop\n FIO.Get(Values(I));\n end loop;\n\n for I in reverse Values'Range loop\n TIO.Put(\"f(\");\n FIO.Put(Values(I), Fore => 2, Aft => 3, Exp => 0);\n TIO.Put(\")=\");\n begin\n FIO.Put(F(Values(I)), Fore=> 4, Aft => 3, Exp => 0);\n exception\n when Constraint_Error => TIO.Put(\"-->too large<--\");\n end;\n TIO.New_Line;\n end loop;\n\nend Trabb_Pardo_Knuth;\n","language":"Ada"},{"code":"scope # TPK algorithm in Agena\n local y;\n local a := [];\n local f := proc( t :: number ) is return sqrt(abs(t))+5*t*t*t end;\n for i from 0 to 10 do a[i] := tonumber( io.read() ) od;\n for i from 10 to 0 by - 1 do\n y:=f(a[i]);\n if y > 400\n then print( \"TOO LARGE\" )\n else printf( \"%10.4f\\n\", y )\n fi\n od\nepocs\n","language":"Agena"},{"code":"begin\n integer i; real y; real array a[0:10];\n real procedure f(t); value t; real t;\n f:=sqrt(abs(t))+5*t^3;\n for i:=0 step 1 until 10 do inreal(0, a[i]);\n for i:=10 step -1 until 0 do\n begin\n y:=f(a[i]);\n if y > 400 then outstring(1, \"TOO LARGE\")\n else outreal(1,y);\n outchar(1, \"\\n\", 1)\n end\nend\n","language":"ALGOL-60"},{"code":"[ 0 : 10 ]REAL a;\nPROC f = ( REAL t )REAL:\n sqrt(ABS t)+5*t*t*t;\nFOR i FROM LWB a TO UPB a DO read( ( a[ i ] ) ) OD;\nFOR i FROM UPB a BY -1 TO LWB a DO\n REAL y=f(a[i]);\n IF y > 400 THEN print( ( \"TOO LARGE\", newline ) )\n ELSE print( ( fixed( y, -9, 4 ), newline ) )\n FI\nOD\n","language":"ALGOL-68"},{"code":"begin\n real y; real array a( 0 :: 10 );\n real procedure f( real value t );\n sqrt(abs(t))+5*t*t*t;\n for i:=0 until 10 do read( a(i) );\n r_format := \"A\"; r_w := 9; r_d := 4;\n for i:=10 step -1 until 0 do\n begin\n y:=f(a(i));\n if y > 400 then write( \"TOO LARGE\" )\n else write( y );\n end\nend.\n","language":"ALGOL-W"},{"code":"100 REM Trabb Pardo-Knuth algorithm\n110 REM Used \"magic numbers\" because of strict specification of the algorithm.\n120 DEF FNF(N) = SQR(ABS(N)) + 5 * N * N * N\n130 DIM S(0 TO 10)\n140 PRINT \"Enter 11 numbers.\"\n150 FOR I = 0 TO 10\n160 INPUT PROMPT STR$(I + 1) & \":\": S(I)\n170 NEXT I\n180 PRINT\n190 REM Reverse\n200 FOR I = 0 TO INT(10 / 2)\n210 LET Tmp = S(I)\n220 LET S(I) = S(10 - I)\n230 LET S(10 - I) = Tmp\n240 NEXT I\n250 REM Results\n260 FOR I = 0 TO 10\n270 LET R = FNF(S(I))\n280 PRINT USING \"f(####.###) = \": S(I);\n290 IF R > 400 THEN\n300 PRINT \"overflow\"\n310 ELSE\n320 PRINT USING \"####.###\": R\n330 END IF\n340 NEXT I\n350 END\n","language":"ANSI-BASIC"},{"code":"∇ {res}←Trabb;f;S;i;a;y ⍝ define a function Trabb\n f←{(0.5*⍨|⍵)+5×⍵*3} ⍝ define a function f\n S←,⍎{⍞←⍵ ⋄ (≢⍵)↓⍞}'Please, enter 11 numbers: '\n :For i a :InEach (⌽⍳≢S)(⌽S) ⍝ loop through N..1 and reversed S\n :If 400<y←f(a)\n ⎕←'Too large: ',⍕i\n :Else\n ⎕←i,y\n :EndIf\n :EndFor\n∇\n","language":"APL"},{"code":"10 REM Trabb Pardo-Knuth algorithm\n20 HOME : REM 20 CLS for Chipmunk Basic or GW-BASIC\n30 DIM S(10)\n40 PRINT \"Enter 11 numbers.\"\n50 FOR I = 0 TO 10\n60 PRINT I+1;\n70 INPUT \"=> \";S(I)\n80 NEXT I\n90 PRINT\n100 REM Results\n110 FOR I = 10 TO 0 STEP -1\n120 PRINT \"f( \" S(I)\") = \";\n130 F = S(I)\n140 R = SQR(ABS(F))+5*F^3\n150 IF R > 400 THEN PRINT \"-=< overflow >=-\"\n160 IF R <= 400 THEN PRINT R\n170 NEXT I\n180 END\n","language":"Applesoft-BASIC"},{"code":"proc: function [x]->\n ((abs x) ^ 0.5) + 5 * x ^ 3\n\nask: function [msg][\n to [:floating] first.n: 11 split.words strip input msg\n]\n\nloop reverse ask \"11 numbers: \" 'n [\n result: proc n\n print [n \":\" (result > 400)? -> \"TOO LARGE!\" -> result]\n]\n","language":"Arturo"},{"code":"REM Trabb Pardo-Knuth algorithm\nREM Used \"magic numbers\" because of strict specification of the algorithm.\nDIM S@(10)\nPRINT \"Enter 11 numbers.\"\nFOR I = 0 TO 10\n I1= I + 1\n PRINT I1;\n PRINT \" => \";\n INPUT TMP@\n S@(I) = TMP@\nNEXT I\nPRINT\nREM Reverse\nHALFIMAX = 10 / 2\nFOR I = 0 TO HALFIMAX\n IREV = 10 - I\n TMP@ = S@(I)\n S@(I) = S@(IREV)\n S@(IREV) = TMP@\nNEXT I\nREM Results\nREM Leading spaces in printed numbers are removed\nCLS\nFOR I = 0 TO 10\n PRINT \"f(\";\n STMP$ = STR$(S@(I))\n STMP$ = LTRIM$(STMP$)\n PRINT STMP$;\n PRINT \") = \";\n N@ = S@(I)\n GOSUB CALCF:\n R@ = F@\n IF R@ > 400 THEN\n PRINT \"overflow\"\n ELSE\n STMP$ = STR$(R@)\n STMP$ = LTRIM$(STMP$)\n PRINT STMP$\n ENDIF\nNEXT I\nEND\n\nCALCF:\nREM Calculates f(N@)\nREM Result in F@\nX@ = ABS(N@)\nGOSUB CALCSQRT:\nF@ = 5.0 * N@\nF@ = F@ * N@\nF@ = F@ * N@\nF@ = F@ + SQRT@\nRETURN\n\nCALCSQRT:\nREM Calculates approximate (+- 0.00001) square root of X@ for X@ >= 0 (bisection method)\nREM Result in SQRT@\nA@ = 0.0\nIF X@ >= 1.0 THEN\n B@ = X@\nELSE\n B@ = 1.0\nENDIF\nL@ = B@ - A@\nL@ = ABS(L@)\nWHILE L@ > 0.00001\n MIDDLE@ = A@ + B@\n MIDDLE@ = MIDDLE@ / 2\n MIDDLETO2@ = MIDDLE@ * MIDDLE@\n IF MIDDLETO2@ < X@ THEN\n A@ = MIDDLE@\n ELSE\n B@ = MIDDLE@\n ENDIF\n L@ = B@ - A@\n L@ = ABS(L@)\nWEND\nSQRT@ = MIDDLE@\nRETURN\n","language":"ASIC"},{"code":"seq := [1,2,3,4,5,6,7,8,9,10,11]\nMsgBox % result := TPK(seq, 400)\nreturn\n\nTPK(s, num){\n for i, v in reverse(s)\n res .= v . \" : \" . ((x:=f(v)) > num ? \"OVERFLOW\" : x ) . \"`n\"\n return res\n}\nreverse(s){\n Loop % s.Count()\n s.InsertAt(A_Index, s.pop())\n return s\n}\nf(x){\n return Sqrt(x) + 5* (x**3)\n}\n","language":"AutoHotkey"},{"code":"; Trabb Pardo–Knuth algorithm\n; by James1337 (autoit.de)\n; AutoIt Version: 3.3.8.1\n\nLocal $S, $i, $y\n\nDo\n\t$S = InputBox(\"Trabb Pardo–Knuth algorithm\", \"Please enter 11 numbers:\", \"1 2 3 4 5 6 7 8 9 10 11\")\n\tIf @error Then Exit\n\t$S = StringSplit($S, \" \")\nUntil ($S[0] = 11)\n\nFor $i = 11 To 1 Step -1\n\t$y = f($S[$i])\n\tIf ($y > 400) Then\n\t\tConsoleWrite(\"f(\" & $S[$i] & \") = Overflow!\" & @CRLF)\n\tElse\n\t\tConsoleWrite(\"f(\" & $S[$i] & \") = \" & $y & @CRLF)\n\tEndIf\nNext\n\nFunc f($x)\n\tReturn Sqrt(Abs($x)) + 5*$x^3\nEndFunc\n","language":"AutoIt"},{"code":"# syntax: GAWK -f TRABB_PARDO-KNUTH_ALGORITHM.AWK\nBEGIN {\n printf(\"enter 11 numbers: \")\n getline S\n n = split(S,arr,\" \")\n if (n != 11) {\n printf(\"%d numbers entered; S/B 11\\n\",n)\n exit(1)\n }\n for (i=n; i>0; i--) {\n x = f(arr[i])\n printf(\"f(%s) = %s\\n\",arr[i],(x>400) ? \"too large\" : x)\n }\n exit(0)\n}\nfunction abs(x) { if (x >= 0) { return x } else { return -x } }\nfunction f(x) { return sqrt(abs(x)) + 5 * x ^ 3 }\n","language":"AWK"},{"code":"dim s(11)\nprint 'enter 11 numbers'\nfor i = 0 to 10\n input i + \">\" , s[i]\nnext i\n\nfor i = 10 to 0 step -1\n print \"f(\" + s[i] + \")=\";\n x = f(s[i])\n if x > 400 then\n print \"-=< overflow >=-\"\n else\n print x\n endif\nnext i\nend\n\nfunction f(n)\n return sqrt(abs(n))+5*n^3\nend function\n","language":"BASIC256"},{"code":"#include<math.h>\n#include<stdio.h>\n\nint\nmain ()\n{\n double inputs[11], check = 400, result;\n int i;\n\n printf (\"\\nPlease enter 11 numbers :\");\n\n for (i = 0; i < 11; i++)\n {\n scanf (\"%lf\", &inputs[i]);\n }\n\n printf (\"\\n\\n\\nEvaluating f(x) = |x|^0.5 + 5x^3 for the given inputs :\");\n\n for (i = 10; i >= 0; i--)\n {\n result = sqrt (fabs (inputs[i])) + 5 * pow (inputs[i], 3);\n\n printf (\"\\nf(%lf) = \");\n\n if (result > check)\n {\n printf (\"Overflow!\");\n }\n\n else\n {\n printf (\"%lf\", result);\n }\n }\n\n return 0;\n}\n","language":"C"},{"code":"#include <iostream>\n#include <cmath>\n#include <vector>\n#include <algorithm>\n#include <iomanip>\n\nint main( ) {\n std::vector<double> input( 11 ) , results( 11 ) ;\n std::cout << \"Please enter 11 numbers!\\n\" ;\n for ( int i = 0 ; i < input.size( ) ; i++ )\n std::cin >> input[i];\n\n std::transform( input.begin( ) , input.end( ) , results.begin( ) ,\n\t [ ]( double n )-> double { return sqrt( abs( n ) ) + 5 * pow( n , 3 ) ; } ) ;\n for ( int i = 10 ; i > -1 ; i-- ) {\n std::cout << \"f( \" << std::setw( 3 ) << input[ i ] << \" ) : \" ;\n if ( results[ i ] > 400 )\n\t std::cout << \"too large!\" ;\n else\n\t std::cout << results[ i ] << \" !\" ;\n std::cout << std::endl ;\n }\n return 0 ;\n}\n","language":"C++"},{"code":"10 rem Trabb Pardo-Knuth algorithm\n20 cls\n30 dim s(10)\n40 print \"Enter 11 numbers.\"\n50 for i = 0 to 10\n60 print i+1;\n70 input \"=> \";s(i)\n80 next i\n90 print\n160 'Results\n170 for i = 10 to 0 step -1\n180 print \"f( \" s(i)\") = \";\n190 r = f(s(i))\n200 if r > 400 then\n210 print \"-=< overflow >=-\"\n220 else\n230 print r\n240 endif\n250 next i\n260 end\n270 function f(n)\n280 f = sqr(abs(n))+5*n^3\n290 return\n","language":"Chipmunk-Basic"},{"code":"10 REM TRABB PARDO-KNUTH ALGORITHM\n20 REM USED \"MAGIC NUMBERS\" BECAUSE OF STRICT SPECIFICATION OF THE ALGORITHM.\n30 DEF FNF(N)=SQR(ABS(N))+5*N*N*N\n40 DIM S(10)\n50 PRINT \"ENTER 11 NUMBERS.\"\n60 FOR I=0 TO 10\n70 PRINT STR$(I+1);\n80 INPUT S(I)\n90 NEXT I\n100 PRINT\n110 REM REVERSE\n120 FOR I=0 TO 10/2\n130 TMP=S(I)\n140 S(I)=S(10-I)\n150 S(10-I)=TMP\n160 NEXT I\n170 REM RESULTS\n180 FOR I=0 TO 10\n190 PRINT \"F(\";STR$(S(I));\") =\";\n200 R=FNF(S(I))\n210 IF R>400 THEN PRINT \" OVERFLOW\":ELSE PRINT R\n220 NEXT I\n230 END\n","language":"Commodore-BASIC"},{"code":"(defun read-numbers ()\n (princ \"Enter 11 numbers (space-separated): \")\n (let ((numbers '()))\n (dotimes (i 11 numbers)\n (push (read) numbers))))\n\n(defun trabb-pardo-knuth (func overflowp)\n (let ((S (read-numbers)))\n (format T \"~{~a~%~}\"\n (substitute-if \"Overflow!\" overflowp (mapcar func S)))))\n\n(trabb-pardo-knuth (lambda (x) (+ (expt (abs x) 0.5) (* 5 (expt x 3))))\n (lambda (x) (> x 400)))\n","language":"Common-Lisp"},{"code":"import std.stdio, std.math, std.conv, std.algorithm, std.array;\n\ndouble f(in double x) pure nothrow {\n return x.abs.sqrt + 5 * x ^^ 3;\n}\n\nvoid main() {\n double[] data;\n\n while (true) {\n \"Please enter eleven numbers on a line: \".write;\n data = readln.split.map!(to!double).array;\n if (data.length == 11)\n break;\n writeln(\"Those aren't eleven numbers.\");\n }\n foreach_reverse (immutable x; data) {\n immutable y = x.f;\n writefln(\"f(%0.3f) = %s\", x, y > 400 ? \"Too large\" : y.text);\n }\n}\n","language":"D"},{"code":"procedure DoPardoKnuth(Memo: TMemo; A: array of double);\nvar Y: double;\nvar I: integer;\nvar S: string;\n\n\tfunction Func(T: double): double;\n\tbegin\n\tResult:=Sqrt(abs(T))+ 5*T*T*T;\n\tend;\n\nbegin\nfor I:=0 to High(A) do\n\tbegin\n\tY:=Func(A[I]);\n\tif y > 400 then S:='Too Large'\n\telse S:=Format('%f %f',[A[I],Y]);\n\tMemo.Lines.Add(S);\n\tend;\nend;\n\nprocedure ShowPardoKnuth(Memo: TMemo);\nbegin\nDoPardoKnuth(Memo, [1,2,3,4,5,6,7,8,9,10,11]);\nend;\n","language":"Delphi"},{"code":"print \"Please enter 11 numbers :\"\nn[] = number strsplit input \" \"\nprint \"\"\nprint \"Evaluating f(x) = |x|^0.5 + 5x^3 for the given inputs :\"\nfor i = len n[] downto 1\n r = sqrt abs n[i] + 5 * pow n[i] 3\n write \"f(\" & n[i] & \") = \"\n if r > 400\n print \"Overflow!\"\n else\n print r\n .\n.\n# without this section, the input is interactive\ninput_data\n10 -1 1 2 3 4 4.3 4.31 4.32 4.32 4.29\n","language":"EasyLang"},{"code":"(define (trabb-fun n)\n\t\t(+ (* 5 n n n) (sqrt(abs n))))\n\t\t\n(define (check-trabb n)\n\t(if (number? n)\n\t(if (<= (trabb-fun n) 400)\n\t\t(printf \"🌱 f(%d) = %d\" n (trabb-fun n))\n\t\t(printf \"❌ f(%d) = %d\" n (trabb-fun n)))\n\t(error \"not a number\" n)))\n\t\t\n(define (trabb (numlist null))\n\t(while (< (length numlist) 11)\n\t(set! numlist (append numlist\n\t\t(or\n\t\t(read default: (shuffle (iota 11))\n\t\t prompt: (format \"Please enter %d more numbers\" (- 11 (length numlist))))\n\t\t(error 'incomplete-list numlist))))) ;; users cancel\n\t(for-each check-trabb (reverse (take numlist 11))))\n","language":"EchoLisp"},{"code":"(trabb)\n;; input : (0 4 1 8 5 9 10 3 6 7 2)\n\n🌱 f(2) = 41.41421356237309\n❌ f(7) = 1717.6457513110645\n❌ f(6) = 1082.4494897427833\n🌱 f(3) = 136.73205080756887\n❌ f(10) = 5003.162277660168\n❌ f(9) = 3648\n❌ f(5) = 627.2360679774998\n❌ f(8) = 2562.828427124746\n🌱 f(1) = 6\n🌱 f(4) = 322\n🌱 f(0) = 0\n\n;; extra credit : let's find the threshold\n(lib 'math)\n(define (g x) (- (trabb-fun x) 400))\n(root g 0 10)\n → 4.301409367213084\n","language":"EchoLisp"},{"code":"open monad io number string\n\n:::IO\n\ntake_numbers 0 xs = do\n return $ iter xs\n where f x = sqrt (toSingle x) + 5.0 * (x ** 3.0)\n p x = x < 400.0\n iter [] = return ()\n iter (x::xs)\n | p res = do\n putStrLn (format \"f({0}) = {1}\" x res)\n iter xs\n | else = do\n putStrLn (format \"f({0}) :: Overflow\" x)\n iter xs\n where res = f x\ntake_numbers n xs = do\n x <- readAny\n take_numbers (n - 1) (x::xs)\n\ndo\n putStrLn \"Please enter 11 numbers:\"\n take_numbers 11 []\n","language":"Ela"},{"code":"import extensions;\nimport extensions'math;\n\npublic program()\n{\n real[] inputs := new real[](11);\n console.printLine(\"Please enter 11 numbers :\");\n for(int i := 0; i < 11; i += 1)\n {\n inputs[i] := console.readLine().toReal()\n };\n\n console.printLine(\"Evaluating f(x) = |x|^0.5 + 5x^3 for the given inputs :\");\n for(int i := 10; i >= 0; i -= 1)\n {\n real result := sqrt(abs(inputs[i])) + 5 * power(inputs[i], 3);\n\n console.print(\"f(\", inputs[i], \")=\");\n\n if (result > 400)\n {\n console.printLine(\"Overflow!\")\n }\n else\n {\n console.printLine(result)\n }\n }\n}\n","language":"Elena"},{"code":"defmodule Trabb_Pardo_Knuth do\n def task do\n Enum.reverse( get_11_numbers )\n |> Enum.each( fn x -> perform_operation( &function(&1), 400, x ) end )\n end\n\n defp alert( n ), do: IO.puts \"Operation on #{n} overflowed\"\n\n defp get_11_numbers do\n ns = IO.gets( \"Input 11 integers. Space delimited, please: \" )\n |> String.split\n |> Enum.map( &String.to_integer &1 )\n if 11 == length( ns ), do: ns, else: get_11_numbers\n end\n\n defp function( x ), do: :math.sqrt( abs(x) ) + 5 * :math.pow( x, 3 )\n\n defp perform_operation( fun, overflow, n ), do: perform_operation_check_overflow( n, fun.(n), overflow )\n\n defp perform_operation_check_overflow( n, result, overflow ) when result > overflow, do: alert( n )\n defp perform_operation_check_overflow( n, result, _overflow ), do: IO.puts \"f(#{n}) => #{result}\"\nend\n\nTrabb_Pardo_Knuth.task\n","language":"Elixir"},{"code":"-module( trabb_pardo_knuth ).\n\n-export( [task/0] ).\n\ntask() ->\n\tSequence = get_11_numbers(),\n\tS = lists:reverse( Sequence ),\n\t[perform_operation( fun function/1, 400, X) || X <- S].\n\n\nalert( N ) -> io:fwrite( \"Operation on ~p overflowed~n\", [N] ).\n\nget_11_numbers() ->\n\t{ok, Ns} = io:fread( \"Input 11 integers. Space delimited, please: \", \"~d ~d ~d ~d ~d ~d ~d ~d ~d ~d ~d\" ),\n\t11 = erlang:length( Ns ),\n\tNs.\n\nfunction( X ) -> math:sqrt( erlang:abs(X) ) + 5 * math:pow( X, 3 ).\n\nperform_operation( Fun, Overflow, N ) -> perform_operation_check_overflow( N, Fun(N), Overflow ).\n\nperform_operation_check_overflow( N, Result, Overflow ) when Result > Overflow -> alert( N );\nperform_operation_check_overflow( N, Result, _Overflow ) -> io:fwrite( \"f(~p) => ~p~n\", [N, Result] ).\n","language":"Erlang"},{"code":"!Trabb Pardo-Knuth algorithm\nPROGRAM TPK\n!VAR I%,Y\nDIM A[10]\n\nFUNCTION F(T)\n F=SQR(ABS(T))+5*T^3\nEND FUNCTION\n\nBEGIN\n DATA(10,-1,1,2,3,4,4.3,4.305,4.303,4.302,4.301)\n FOR I%=0 TO 10 DO\n READ(A[I%])\n END FOR\n FOR I%=10 TO 0 STEP -1 DO\n Y=F(A[I%])\n PRINT(\"F(\";A[I%];\")=\";)\n IF Y>400 THEN PRINT(\"--->too large<---\")\n ELSE PRINT(Y)\n END IF\n END FOR\nEND PROGRAM\n","language":"ERRE"},{"code":"module ``Trabb Pardo - Knuth``\nopen System\nlet f (x: float) = sqrt(abs x) + (5.0 * (x ** 3.0))\n\nConsole.WriteLine \"Enter 11 numbers:\"\n[for _ in 1..11 -> Convert.ToDouble(Console.ReadLine())]\n|> List.rev |> List.map f |> List.iter (function\n| n when n <= 400.0 -> Console.WriteLine(n)\n| _ -> Console.WriteLine(\"Overflow\"))\n","language":"F-Sharp"},{"code":"USING: formatting io kernel math math.functions math.parser\nprettyprint sequences splitting ;\nIN: rosetta-code.trabb-pardo-knuth\n\nCONSTANT: threshold 400\nCONSTANT: prompt \"Please enter 11 numbers: \"\n\n: fn ( x -- y ) [ abs 0.5 ^ ] [ 3 ^ 5 * ] bi + ;\n\n: overflow? ( x -- ? ) threshold > ;\n\n: get-input ( -- seq )\n prompt write flush readln \" \" split dup length 11 =\n [ drop get-input ] unless ;\n\n: ?result ( ..a quot: ( ..a -- ..b ) -- ..b )\n [ \"f(%u) = \" sprintf ] swap bi dup overflow?\n [ drop \"overflow\" ] [ \"%.3f\" sprintf ] if append ; inline\n\n: main ( -- )\n get-input reverse\n [ string>number [ fn ] ?result print ] each ;\n\nMAIN: main\n","language":"Factor"},{"code":": f(x) fdup fsqrt fswap 3e f** 5e f* f+ ;\n\n4e2 fconstant f-too-big\n\n11 Constant #Elements\n\n: float-array ( compile: n -- / run: n -- addr )\n create\n floats allot\n does>\n swap floats + ;\n\n#Elements float-array vec\n\n: get-it ( -- )\n .\" Enter \" #Elements . .\" numbers:\" cr\n #Elements 0 DO\n .\" > \" pad 25 accept cr\n pad swap >float 0= abort\" Invalid Number\"\n i vec F!\n LOOP ;\n\n: reverse-it ( -- )\n #Elements 2/ 0 DO\n i vec F@ #Elements i - 1- vec F@\n i vec F! #Elements i - 1- vec F!\n LOOP ;\n\n: do-it ( -- )\n #Elements 0 DO\n i vec F@ fdup f. [char] : emit space\n\tf(x) fdup f-too-big f> IF\n fdrop .\" too large\"\n ELSE\n f.\n THEN cr\n LOOP ;\n\n: tpk ( -- )\n get-it reverse-it do-it ;\n","language":"Forth"},{"code":"program tpk\n implicit none\n\n real, parameter :: overflow = 400.0\n real :: a(11), res\n integer :: i\n\n write(*,*) \"Input eleven numbers:\"\n read(*,*) a\n\n a = a(11:1:-1)\n do i = 1, 11\n res = f(a(i))\n write(*, \"(a, f0.3, a)\", advance = \"no\") \"f(\", a(i), \") = \"\n if(res > overflow) then\n write(*, \"(a)\") \"overflow!\"\n else\n write(*, \"(f0.3)\") res\n end if\n end do\n\ncontains\n\nreal function f(x)\n real, intent(in) :: x\n\n f = sqrt(abs(x)) + 5.0*x**3\n\nend function\nend program\n","language":"Fortran"},{"code":"C THE TPK ALGORITH - FORTRAN I - 1957 TPK00010\n FTPKF(X)=SQRTF(ABSF(X))+5.0*X**3 TPK00020\n DIMENSION A(11) TPK00030\n READ 100,A TPK00040\n 100 FORMAT(6F12.4/) TPK00050\n DO 3 I=1,11 TPK00060\n J=12-I TPK00070\n Y=FTPKF(A(J)) TPK00080\n IF (Y-400.0)2,2,1 TPK00090\n 1 PRINT 301,I,A(J) TPK00100\n 301 FORMAT(I10,F12.7,18H *** TOO LARGE ***) TPK00110\n GO TO 10 TPK00120\n 2 PRINT 302,I,A(J),Y TPK00130\n 302 FORMAT(I10,2F12.7) TPK00140\n 3 CONTINUE TPK00150\n STOP 0 TPK00160\n","language":"Fortran"},{"code":"' version 22-07-2017\n' compile with: fbc -s console\n\nFunction f(n As Double) As Double\n return Sqr(Abs(n)) + 5 * n ^ 3\nEnd Function\n\n' ------=< MAIN >=------\n\nDim As Double x, s(1 To 11)\nDim As Long i\n\nFor i = 1 To 11\n Print Str(i);\n Input \" => \", s(i)\nNext\n\nPrint\nPrint String(20,\"-\")\n\ni -= 1\nDo\n Print \"f(\" + Str(s(i)) + \") = \";\n x = f(s(i))\n If x > 400 Then\n Print \"-=< overflow >=-\"\n Else\n Print x\n End If\n i -= 1\nLoop Until i < 1\n\n' empty keyboard buffer\nWhile InKey <> \"\" : Wend\nPrint : Print \"hit any key to end program\"\nSleep\nEnd\n","language":"FreeBASIC"},{"code":"// Trabb Pardo-Knuth algorithm\n\ninclude \"NSLog.incl\"\n\nlocal fn f( x as double ) as double\nend fn = fn pow( abs(x), 0.5) + 5 * ( fn pow(x, 3) )\n\nvoid local fn PardoKnuth( userInput as double )\n double x = userInput\n double y = fn f(x)\n NSLog( @\"f(%.4f)\\t= \\b\", x )\n if( y < 400.0 )\n NSLog( @\"%.4f\", y )\n else\n NSLog( @\"[Overflow]\" )\n end if\nend fn\n\nNSUInteger i\nCFArrayRef numbers\n\nnumbers = @[@10, @-1, @1, @2, @3 ,@4, @4.3, @4.305, @4.303, @4.302, @4.301]\n\nNSLog( @\"Please enter 11 numbers:\" )\nfor i = len(numbers) to 1 step -1\n fn PardoKnuth( fn NumberDoubleValue( numbers[i-1] ) )\nnext\n\nHandleEvents\n","language":"FutureBasic"},{"code":"package main\n\nimport (\n \"fmt\"\n \"log\"\n \"math\"\n)\n\nfunc main() {\n // prompt\n fmt.Print(\"Enter 11 numbers: \")\n // accept sequence\n var s [11]float64\n for i := 0; i < 11; {\n if n, _ := fmt.Scan(&s[i]); n > 0 {\n i++\n }\n }\n // reverse sequence\n for i, item := range s[:5] {\n s[i], s[10-i] = s[10-i], item\n }\n // iterate\n for _, item := range s {\n if result, overflow := f(item); overflow {\n // send alerts to stderr\n log.Printf(\"f(%g) overflow\", item)\n } else {\n // send normal results to stdout\n fmt.Printf(\"f(%g) = %g\\n\", item, result)\n }\n }\n}\n\nfunc f(x float64) (float64, bool) {\n result := math.Sqrt(math.Abs(x)) + 5*x*x*x\n return result, result > 400\n}\n","language":"Go"},{"code":"package main\n\nimport (\n \"fmt\"\n \"math\"\n)\n\nfunc f(t float64) float64 {\n return math.Sqrt(math.Abs(t)) + 5*math.Pow(t, 3)\n}\n\nfunc main() {\n var a [11]float64\n for i := range a {\n fmt.Scan(&a[i])\n }\n for i := len(a) - 1; i >= 0; i-- {\n if y := f(a[i]); y > 400 {\n fmt.Println(i, \"TOO LARGE\")\n } else {\n fmt.Println(i, y)\n }\n }\n}\n","language":"Go"},{"code":"10 REM Trabb Pardo-Knuth algorithm\n20 REM Used \"magic numbers\" because of strict specification of the algorithm.\n30 DEF FNF(N) = SQR(ABS(N)) + 5 * N * N * N\n40 DIM S(10)\n50 PRINT \"Enter 11 numbers.\"\n60 FOR I% = 0 TO 10\n70 PRINT STR$(I%+1);\n80 INPUT S(I%)\n90 NEXT I%\n100 PRINT\n110 REM Reverse\n120 FOR I% = 0 TO 10 \\ 2\n130 TMP = S(I%): S(I%) = S(10 - I%): S(10 - I%) = TMP\n160 NEXT I%\n170 REM Results\n180 FOR I% = 0 TO 10\n190 PRINT \"f(\";STR$(S(I%));\") =\";\n220 R = FNF(S(I%))\n230 IF R > 400 THEN PRINT \" overflow\" ELSE PRINT R\n240 NEXT I%\n250 END\n","language":"GW-BASIC"},{"code":"import Control.Monad (replicateM, mapM_)\n\nf :: Floating a => a -> a\nf x = sqrt (abs x) + 5 * x ** 3\n\nmain :: IO ()\nmain = do\n putStrLn \"Enter 11 numbers for evaluation\"\n x <- replicateM 11 readLn\n mapM_\n ((\\x ->\n if x > 400\n then putStrLn \"OVERFLOW\"\n else print x) .\n f) $\n reverse x\n","language":"Haskell"},{"code":"procedure main()\n S := []\n writes(\"Enter 11 numbers: \")\n read() ? every !11 do (tab(many(' \\t'))|0,put(S, tab(upto(' \\t')|0)))\n every item := !reverse(S) do\n write(item, \" -> \", (400 >= f(item)) | \"overflows\")\nend\n\nprocedure f(x)\n return abs(x)^0.5 + 5*x^3\nend\n","language":"Icon"},{"code":"// Initialize objects to be used\nin_num := File standardInput()\nnums := List clone\nresult := Number\n\n// Prompt the user and get numbers from standard input\n\"Please enter 11 numbers:\" println\n11 repeat(nums append(in_num readLine() asNumber()))\n\n// Reverse the numbers received\nnums reverseInPlace\n\n// Apply the function and tell the user if the result is above\n// our limit. Otherwise, tell them the result.\nnums foreach(v,\n // v needs parentheses around it for abs to properly convert v to its absolute value\n result = (v) abs ** 0.5 + 5 * v ** 3\n if (result > 400,\n \"Overflow!\" println\n ,\n result println\n )\n)\n","language":"Io"},{"code":"tpk=: 3 :0\n smoutput 'Enter 11 numbers: '\n t1=: ((5 * ^&3) + (^&0.5@* *))\"0 |. _999&\".;._1 ' ' , 1!:1 [ 1\n smoutput 'Values of functions of reversed input: ' , \": t1\n ; <@(,&' ')@\": ` ((<'user alert ')&[) @. (>&400)\"0 t1\n)\n","language":"J"},{"code":" tpk ''\nEnter 11 numbers:\n1 2 3 4 5 6 7 8.8 _9 10.123 0\nValues of functions of reversed input: 0 5189.96 _3642 3410.33 1717.65 1082.45 627.236 322 136.732 41.4142 6\n0 user alert _3642 user alert user alert user alert user alert 322 136.732 41.4142 6\n","language":"J"},{"code":"get11numbers=: 3 :0\n smoutput 'Enter 11 numbers: '\n _&\". 1!:1]1\n)\n\nf_x=: %:@| + 5 * ^&3\n\noverflow400=: 'user alert'\"_`\":@.(<:&400)\"0\n\ntpk=: overflow400@f_x@|.@get11numbers\n","language":"J"},{"code":" tpk''\nEnter 11 numbers:\n1 2 3 4 5 6 7 8.8 _9 10.123 0\n0\nuser alert\n_3642\nuser alert\nuser alert\nuser alert\nuser alert\n322\n136.732\n41.4142\n6\n","language":"J"},{"code":"/**\n * Alexander Alvonellos\n */\nimport java.util.*;\nimport java.io.*;\n\npublic class TPKA {\n\tpublic static void main(String... args) {\n\t\tdouble[] input = new double[11];\n\t\tdouble userInput = 0.0;\n\t\tScanner in = new Scanner(System.in);\n\t\tfor(int i = 0; i < 11; i++) {\n\t\t\tSystem.out.print(\"Please enter a number: \");\n\t\t\tString s = in.nextLine();\n\t\t\ttry {\n\t\t\t\tuserInput = Double.parseDouble(s);\n\t\t\t} catch (NumberFormatException e) {\n\t\t\t\tSystem.out.println(\"You entered invalid input, exiting\");\n\t\t\t\tSystem.exit(1);\n\t\t\t}\n\t\t\tinput[i] = userInput;\n\t\t}\n\t\tfor(int j = 10; j >= 0; j--) {\n\t\t\tdouble x = input[j]; double y = f(x);\n\t\t\tif( y < 400.0) {\n\t\t\t\tSystem.out.printf(\"f( %.2f ) = %.2f\\n\", x, y);\n\t\t\t} else {\n\t\t\t\tSystem.out.printf(\"f( %.2f ) = %s\\n\", x, \"TOO LARGE\");\n\t\t\t}\n\t\t}\n\t}\n\n\tprivate static double f(double x) {\n\t\treturn Math.pow(Math.abs(x), 0.5) + (5*(Math.pow(x, 3)));\n\t}\n}\n","language":"Java"},{"code":"#!/usr/bin/env js\n\nfunction main() {\n var nums = getNumbers(11);\n nums.reverse();\n for (var i in nums) {\n pardoKnuth(nums[i], fn, 400);\n }\n}\n\nfunction pardoKnuth(n, f, max) {\n var res = f(n);\n putstr('f(' + String(n) + ')');\n if (res > max) {\n print(' is too large');\n } else {\n print(' = ' + String(res));\n }\n}\n\nfunction fn(x) {\n return Math.pow(Math.abs(x), 0.5) + 5 * Math.pow(x, 3);\n}\n\nfunction getNumbers(n) {\n var nums = [];\n print('Enter', n, 'numbers.');\n for (var i = 1; i <= n; i++) {\n putstr(' ' + i + ': ');\n var num = readline();\n nums.push(Number(num));\n }\n return nums;\n}\n\nmain();\n","language":"JavaScript"},{"code":"def f:\n def abs: if . < 0 then -. else . end;\n def power(x): (x * log) | exp;\n . as $x | abs | power(0.5) + (5 * (.*.*. ));\n\n. as $in | split(\" \") | map(tonumber)\n| if length == 11 then\n reverse | map(f | if . > 400 then \"TOO LARGE\" else . end)\n else error(\"The number of numbers was not 11.\")\n end\n| .[] # print one result per line\n","language":"Jq"},{"code":"$ echo \"Enter 11 numbers on one line; when done, enter the end-of-file character:\" ;\\\njq -M -s -R -f Trabb_Pardo-Knuth_algorithm.jq\n> Enter 11 numbers on one line; when done, enter the end-of-file character:\n1 2 3 4 5 6 7 8 9 10 11\n\"TOO LARGE\"\n\"TOO LARGE\"\n\"TOO LARGE\"\n\"TOO LARGE\"\n\"TOO LARGE\"\n\"TOO LARGE\"\n\"TOO LARGE\"\n322\n136.73205080756887\n41.41421356237309\n6\n","language":"Jq"},{"code":"f(x) = √abs(x) + 5x^3\nfor i in reverse(split(readline()))\n v = f(parse(Int, i))\n println(\"$(i): \", v > 400 ? \"TOO LARGE\" : v)\nend\n","language":"Julia"},{"code":"// version 1.1.2\n\nfun f(x: Double) = Math.sqrt(Math.abs(x)) + 5.0 * x * x * x\n\nfun main(args: Array<String>) {\n val da = DoubleArray(11)\n println(\"Please enter 11 numbers:\")\n var i = 0\n while (i < 11) {\n print(\" ${\"%2d\".format(i + 1)}: \")\n val d = readLine()!!.toDoubleOrNull()\n if (d == null)\n println(\"Not a valid number, try again\")\n else\n da[i++] = d\n }\n println(\"\\nThe sequence you just entered in reverse is:\")\n da.reverse()\n println(da.contentToString())\n println(\"\\nProcessing this sequence...\")\n for (j in 0..10) {\n val v = f(da[j])\n print(\" ${\"%2d\".format(j + 1)}: \")\n if (v > 400.0)\n println(\"Overflow!\")\n else\n println(v)\n }\n}\n","language":"Kotlin"},{"code":"#!/bin/ksh\n\n# Trabb Pardo–Knuth algorithm\n\n#\t# Variables:\n#\ninteger NUM_ELE=11\ntypeset -F FUNC_LIMIT=400\n\n#\t# Functions:\n#\n#\t# Function _input(_arr) - Ask for user input, build array\n#\nfunction _input {\n\ttypeset _arr ; nameref _arr=\"$1\"\n\ttypeset _i ; integer _i\n\n\tclear ; print \"Please input 11 numbers...\"\n\tfor ((_i=1 ; _i<=NUM_ELE ; _i++)); do\n\t\tread REPLY?\"${_i}: \"\n\t\t[[ $REPLY != {,1}(-)+(\\d){,1}(.)*(\\d) ]] && ((_i--)) && continue\n\t\t_arr+=( $REPLY )\n\tdone\n}\n\n#\t# Function _function() - Apply |x|^0.5 + 5x^3\n#\t#\tnote: >400 creates an overflow situation\n#\nfunction _function {\n\ttypeset _x ; _x=$1\n\n\t(( _result = sqrt(abs(${_x})) + 5 * _x * _x * _x ))\n\t(( _result <= $FUNC_LIMIT )) && echo ${_result} && return 0\n\treturn 1\n}\n\n ######\n# main #\n ######\n\ntypeset -a inputarr\n_input inputarr\ninteger i\nprintf \"%s\\n\\n\" \"Evaluating f(x) = |x|^0.5 + 5x^3 for the given inputs :\"\nfor (( i=NUM_ELE-1; i>=0; i-- )); do\n\tresult=$(_function ${inputarr[i]})\n\tif (( $? )); then\n\t\tprintf \"%s\\n\" \"Overflow\"\n\telse\n\t\tprintf \"%s\\n\" \"${result}\"\n\tfi\ndone\n","language":"Ksh"},{"code":"' Trabb Pardo-Knuth algorithm\n' Used \"magic numbers\" because of strict specification of the algorithm.\ndim s(10)\nprint \"Enter 11 numbers.\"\nfor i = 0 to 10\n print i + 1;\n input \" => \"; s(i)\nnext i\nprint\n' Reverse\nfor i = 0 to 10 / 2\n tmp = s(i)\n s(i) = s(10 - i)\n s(10 - i) = tmp\nnext i\n'Results\nfor i = 0 to 10\n print \"f(\"; s(i); \") = \";\n r = f(s(i))\n if r > 400 then\n print \"overflow\"\n else\n print r\n end if\nnext i\nend\n\nfunction f(n)\n f = sqr(abs(n)) + 5 * n * n * n\nend function\n","language":"Liberty-BASIC"},{"code":"function f (x) return math.abs(x)^0.5 + 5*x^3 end\n\nfunction reverse (t)\n local rev = {}\n for i, v in ipairs(t) do rev[#t - (i-1)] = v end\n return rev\nend\n\nlocal sequence, result = {}\nprint(\"Enter 11 numbers...\")\nfor n = 1, 11 do\n io.write(n .. \": \")\n sequence[n] = io.read()\nend\nfor _, x in ipairs(reverse(sequence)) do\n result = f(x)\n if result > 400 then print(\"Overflow!\") else print(result) end\nend\n","language":"Lua"},{"code":"local a, y = {}\nfunction f (t)\n return math.sqrt(math.abs(t)) + 5*t^3\nend\nfor i = 0, 10 do a[i] = io.read() end\nfor i = 10, 0, -1 do\n y = f(a[i])\n if y > 400 then print(i, \"TOO LARGE\")\n else print(i, y) end\nend\n","language":"Lua"},{"code":"Module Input11 {\n Flush ' empty stack\n For I=1 to 11 {\n Input \"Give me a number \", a\n Data a ' add to bottom of stack, use: Push a to add to top, to get reverse order here\n }\n}\nModule Run {\n Print \"Trabb Pardo–Knuth algorithm\"\n Print \"f(x)=Sqrt(Abs(x))+5*x^3\"\n if not match(\"NNNNNNNNN\") then Error \"Need 11 numbers\"\n Shiftback 1, -11 ' reverse order 11 elements of stack of values\n Def f(x)=Sqrt(Abs(x))+5*x^3\n For i=1 to 11 {\n Read pop\n y=f(pop)\n if y>400 Then {\n Print format$(\"f({0}) = Overflow!\", pop)\n } Else {\n Print format$(\"f({0}) = {1}\", pop, y)\n }\n }\n}\nRun 10, -1, 1, 2, 3, 4, 4.3, 4.305, 4.303, 4.302, 4.301\nRun 1, 2, 3, -4.55,5.1111, 6, -7, 8, 9, 10, 11\nInput11\nRun\n","language":"M2000-Interpreter"},{"code":"Global a$\nDocument a$ ' make a$ as a document - string with paragraphs\nModule Run {\n a$<={Trabb Pardo–Knuth algorithm\n f(x)=Sqrt(Abs(x))+5*x^3\n }\n if not match(\"NNNNNNNNN\") then Error \"Need 11 numbers\"\n Shiftback 1, -11 ' reverse order 11 elements of stack of values\n Def f(x)=Sqrt(Abs(x))+5*x^3\n For i=1 to 11 {\n Read pop\n y=f(pop)\n if y>400 Then {\n a$<=format$(\"f({0}) = Overflow!\", pop)+{\n }\n } Else {\n a$<=format$(\"f({0}) = {1}\", pop, y)+{\n }\n }\n }\n}\nRun 10, -1, 1, 2, 3, 4, 4.3, 4.305, 4.303, 4.302, 4.301\nRun 1, 2, 3, -4.55,5.1111, 6, -7, 8, 9, 10, 11\nClipboard a$\n","language":"M2000-Interpreter"},{"code":"seqn := ListTools:-Reverse([parse(Maplets[Display](Maplets:-Elements:-Maplet(Maplets:-Elements:-InputDialog['ID1'](\"Enter a sequence of numbers separated by comma\", 'onapprove' = Maplets:-Elements:-Shutdown(['ID1']), 'oncancel' = Maplets:-Elements:-Shutdown())))[1])]):\nf:= x -> abs(x)^0.5 + 5*x^3:\nfor item in seqn do\n\tresult := f(item):\n\tif (result > 400) then\n\t\tprint(\"Alert: Overflow.\"):\n\telse\n\t\tprint(result):\n\tend if:\nend do:\n","language":"Maple"},{"code":"numbers=RandomReal[{-2,6},11]\ntpk[numbers_,overflowVal_]:=Module[{revNumbers},\n revNumbers=Reverse[numbers];\n f[x_]:=Abs[x]^0.5+5 x^3;\n Do[\n If[f[i]>overflowVal,\n Print[\"f[\",i,\"]= Overflow\"]\n ,\n Print[\"f[\",i,\"]= \",f[i]]\n ]\n ,\n {i,revNumbers}\n ]\n]\ntpk[numbers,400]\n","language":"Mathematica"},{"code":"clear all;close all;clc;\n\n% Define the function f(x)\nf = @(x) sqrt(abs(x)) + 5 * x^3;\n\n% Read a line of input, split it into elements, convert to numbers\ninputLine = input('', 's');\nnumbers = str2double(strsplit(inputLine));\n\n% Process each number in reverse order\nfor i = length(numbers):-1:1\n value = f(numbers(i));\n if value > 400\n fprintf('%g: TOO LARGE\\n', numbers(i));\n else\n fprintf('%g: %g\\n', numbers(i), value);\n end\nend\n","language":"MATLAB"},{"code":"((0 <) (-1 *) when) :abs\n(((abs 0.5 pow) (3 pow 5 * +)) cleave) :fn\n\"Enter 11 numbers:\" puts!\n(gets float) 11 times\n(fn (400 <=) (pop \"Overflow\") unless puts!) 11 times\n","language":"Min"},{"code":"10 REM Trabb Pardo-Knuth algorithm\n20 REM Used \"magic numbers\" because of strict specification\n30 REM of the algorithm.\n40 DEF FNF(N) = SQR(ABS(N))+5*N*N*N\n50 DIM S(10)\n60 PRINT \"Enter 11 numbers.\"\n70 FOR I = 0 TO 10\n80 PRINT I+1; \"- Enter number\";\n90 INPUT S(I)\n100 NEXT I\n110 PRINT\n120 REM Reverse\n130 FOR I = 0 TO 10/2\n140 LET T = S(I)\n150 LET S(I) = S(10-I)\n160 LET S(10-I) = T\n170 NEXT I\n180 REM Results\n190 PRINT \"num\", \"f(num)\"\n200 FOR I = 0 TO 10\n210 LET R = FNF(S(I))\n220 IF R>400 THEN 250\n230 PRINT S(I), R\n240 GOTO 260\n250 PRINT S(I), \" overflow\"\n260 NEXT I\n270 END\n","language":"Minimal-BASIC"},{"code":"MODULE TrabbPardoKnuth;\n\nFROM STextIO IMPORT\n SkipLine, WriteString, WriteLn;\nFROM SRealIO IMPORT\n ReadReal, WriteFixed;\nFROM SWholeIO IMPORT\n WriteInt;\nFROM RealMath IMPORT\n sqrt;\n\nCONST\n Size = 11;\n\nTYPE\n TSequence = ARRAY [1 .. Size] OF REAL;\n\nVAR\n S: TSequence;\n I: CARDINAL;\n Result: REAL;\n\nPROCEDURE ReverseSequence(VAR S: TSequence);\nVAR\n I: CARDINAL;\n Temp: REAL;\nBEGIN\n FOR I := 1 TO Size DIV 2 DO\n Temp := S[I];\n S[I] := S[Size - I + 1];\n S[Size - I + 1] := Temp;\n END;\nEND ReverseSequence;\n\nPROCEDURE DoOperation(Item: REAL): REAL;\nBEGIN\n RETURN sqrt(ABS(Item)) + 5.0 * Item * Item * Item;\nEND DoOperation;\n\nBEGIN\n WriteString(\"Enter 11 numbers.\");\n WriteLn;\n FOR I := 1 TO Size DO\n WriteInt(I, 2);\n WriteString(\": \");\n ReadReal(S[I]);\n SkipLine\n END;\n ReverseSequence(S);\n WriteLn;\n FOR I := 1 TO Size DO\n Result := DoOperation(S[I]);\n WriteString(\"f(\");\n WriteFixed(S[I], 3, 8);\n WriteString(\") = \");\n IF Result > 400.0 THEN\n WriteString(\"overflow\");\n ELSE\n WriteFixed(Result, 3, 8)\n END;\n WriteLn;\n END;\nEND TrabbPardoKnuth.\n","language":"Modula-2"},{"code":"10 REM Trabb Pardo-Knuth algorithm\n20 REM Used \"magic numbers\" because of strict\n30 REM specification of the algorithm.\n40 DEF FNF(N)=SQR(ABS(N))+5*N*N*N\n50 DIM S(10)\n60 PRINT \"Enter 11 numbers.\"\n70 FOR I=0 TO 10\n80 PRINT STR$(I+1);\n90 INPUT S(I)\n100 NEXT I\n110 PRINT\n120 REM ** Reverse\n130 FOR I=0 TO 10/2\n140 TMP=S(I)\n150 S(I)=S(10-I)\n160 S(10-I)=TMP\n170 NEXT I\n180 REM ** Results\n190 FOR I=0 TO 10\n200 PRINT \"f(\";STR$(S(I));\") =\";\n210 R=FNF(S(I))\n220 IF R>400 THEN PRINT \" overflow\":GOTO 240\n230 PRINT R\n240 NEXT I\n250 END\n","language":"Nascom-BASIC"},{"code":"import math, rdstdin, strutils, algorithm, sequtils\n\nproc f(x: float): float = x.abs.pow(0.5) + 5 * x.pow(3)\n\nproc ask: seq[float] =\n readLineFromStdin(\"11 numbers: \").strip.split[0..10].map(parseFloat)\n\nvar s = ask()\nreverse s\nfor x in s:\n let result = f(x)\n echo x, \": \", if result > 400: \"TOO LARGE!\" else: $result\n","language":"Nim"},{"code":"//\n// TPKA.m\n// RosettaCode\n//\n// Created by Alexander Alvonellos on 5/26/12.\n// Trabb Pardo-Knuth algorithm\n//\n\n#import <Foundation/Foundation.h>\ndouble f(double x);\n\ndouble f(double x) {\n return pow(abs(x), 0.5) + 5*(pow(x, 3));\n}\n\nint main (int argc, const char * argv[])\n{\n @autoreleasepool {\n NSMutableArray *input = [[NSMutableArray alloc] initWithCapacity:0];\n\n printf(\"%s\", \"Instructions: please enter 11 numbers.\\n\");\n for(int i = 0; i < 11; i++) {\n double userInput = 0.0;\n printf(\"%s\", \"Please enter a number: \");\n scanf(\"%lf\", &userInput);\n [input addObject: @(userInput)];\n }\n\n for(int i = 10; i >= 0; i--) {\n double x = [input[i] doubleValue];\n double y = f(x);\n printf(\"f(%.2f) \\t=\\t\", x);\n if(y < 400.0) {\n printf(\"%.2f\\n\", y);\n } else {\n printf(\"%s\\n\", \"TOO LARGE\");\n }\n }\n }\n return 0;\n}\n","language":"Objective-C"},{"code":"let f x = sqrt x +. 5.0 *. (x ** 3.0)\nlet p x = x < 400.0\n\nlet () =\n print_endline \"Please enter 11 Numbers:\";\n let lst = Array.to_list (Array.init 11 (fun _ -> read_float ())) in\n List.iter (fun x ->\n let res = f x in\n if p res\n then Printf.printf \"f(%g) = %g\\n%!\" x res\n else Printf.eprintf \"f(%g) :: Overflow\\n%!\" x\n ) (List.rev lst)\n","language":"OCaml"},{"code":"{\n print(\"11 numbers: \");\n v=vector(11, n, eval(input()));\n v=apply(x->x=sqrt(abs(x))+5*x^3;if(x>400,\"overflow\",x), v);\n vector(11, i, v[12-i])\n}\n","language":"PARI-GP"},{"code":"print \"Enter 11 numbers:\\n\";\nfor ( 1..11 ) {\n $number = <STDIN>;\n chomp $number;\n push @sequence, $number;\n}\n\nfor $n (reverse @sequence) {\n my $result = sqrt( abs($n) ) + 5 * $n**3;\n printf \"f( %6.2f ) %s\\n\", $n, $result > 400 ? \" too large!\" : sprintf \"= %6.2f\", $result\n}\n","language":"Perl"},{"code":"(phixonline)-->\n <span style=\"color: #008080;\">function</span> <span style=\"color: #000000;\">f</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #004080;\">atom</span> <span style=\"color: #000000;\">x</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: #7060A8;\">abs</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">x</span><span style=\"color: #0000FF;\">))+</span><span style=\"color: #000000;\">5</span><span style=\"color: #0000FF;\">*</span><span style=\"color: #7060A8;\">power</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">x</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">3</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;\">procedure</span> <span style=\"color: #000000;\">test</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;\">bool</span> <span style=\"color: #000000;\">fake_prompt</span><span style=\"color: #0000FF;\">=</span><span style=\"color: #004600;\">true</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #008080;\">if</span> <span style=\"color: #000000;\">fake_prompt</span> <span style=\"color: #008080;\">then</span> <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;\">\"Enter 11 numbers:%s\\n\"</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;\">if</span>\n <span style=\"color: #000000;\">s</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">substitute</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">s</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: #004080;\">sequence</span> <span style=\"color: #000000;\">S</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">scanf</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">s</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #008000;\">\"%f %f %f %f %f %f %f %f %f %f %f\"</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;\">S</span><span style=\"color: #0000FF;\">)!=</span><span style=\"color: #000000;\">1</span> <span style=\"color: #008080;\">then</span> <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;\">\"not 11 numbers\"</span><span style=\"color: #0000FF;\">)</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: #000000;\">S</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">reverse</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>\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;\">atom</span> <span style=\"color: #000000;\">result</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">f</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;\">result</span><span style=\"color: #0000FF;\">></span><span style=\"color: #000000;\">400</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;\">\"f(%g):overflow\\n\"</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;\">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;\">\"f(%g):%g\\n\"</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;\">result</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: #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;\">procedure</span>\n\n <span style=\"color: #000080;font-style:italic;\">--test(prompt_string(\"Enter 11 numbers:\"),false)</span>\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;\">\"10 -1 1 2 3 4 4.3 4.305 4.303 4.302 4.301\"</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #008000;\">\"1,2,3,4,5,6,7,8,9,10,11\"</span><span style=\"color: #0000FF;\">,</span>\n <span style=\"color: #008000;\">\"0.470145,1.18367,2.36984,4.86759,2.40274,5.48793,3.30256,5.34393,4.21944,2.23501,-0.0200707\"</span><span style=\"color: #0000FF;\">}</span>\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;\">test</span><span style=\"color: #0000FF;\">)</span>\n<!--\n","language":"Phix"},{"code":"<?php\n// Trabb Pardo-Knuth algorithm\n// Used \"magic numbers\" because of strict specification of the algorithm.\n\nfunction f($n)\n{\n return sqrt(abs($n)) + 5 * $n * $n * $n;\n}\n\n$sArray = [];\necho \"Enter 11 numbers.\\n\";\nfor ($i = 0; $i <= 10; $i++) {\n echo $i + 1, \" - Enter number: \";\n array_push($sArray, (float)fgets(STDIN));\n}\necho PHP_EOL;\n// Reverse\n$sArray = array_reverse($sArray);\n// Results\nforeach ($sArray as $s) {\n $r = f($s);\n echo \"f(\", $s, \") = \";\n if ($r > 400)\n echo \"overflow\\n\";\n else\n echo $r, PHP_EOL;\n}\n?>\n","language":"PHP"},{"code":"import util.\n\ngo =>\n L = [I.parse_term() : I in split(read_line())],\n S = [[I,cond(F<=400,F,'TOO LARGE')] : I in L.len..-1..1, F=f(L[I])],\n println(S),\n nl.\n\nf(T) = sqrt(abs(T)) + 5*T**3.\n","language":"Picat"},{"code":"(de f (X)\n (+ (sqrt (abs X)) (* 5 X X X)) )\n\n(trace 'f)\n\n(in NIL\n (prin \"Input 11 numbers: \")\n (for X (reverse (make (do 11 (link (read)))))\n (when (> (f X) 400)\n (prinl \"TOO LARGE\") ) ) )\n","language":"PicoLisp"},{"code":"Input 11 numbers: 1 2 3 4 5 6 7 8 9 10 11\n f : 11\n f = 6658\nTOO LARGE\n f : 10\n f = 5003\nTOO LARGE\n f : 9\n f = 3648\nTOO LARGE\n f : 8\n f = 2562\nTOO LARGE\n f : 7\n f = 1717\nTOO LARGE\n f : 6\n f = 1082\nTOO LARGE\n f : 5\n f = 627\nTOO LARGE\n f : 4\n f = 322\n f : 3\n f = 136\n f : 2\n f = 41\n f : 1\n f = 6\n","language":"PicoLisp"},{"code":"Trabb: Procedure options (main); /* 11 November 2013 */\n\n declare (i, n) fixed binary;\n declare s fixed (5,1) controlled;\n declare g fixed (15,5);\n\n put ('Please type 11 values:');\n do i = 1 to 11;\n allocate s;\n get (s);\n put (s);\n end;\n put skip(2) ('Results:');\n do i = 1 to 11;\n g = f(s); put skip list (s);\n if g > 400 then put ('Too large'); else put (g);\n free s;\n end;\n\nf: procedure (x) returns (fixed(15,5));\n declare x fixed (5,1);\n return (sqrt(abs(x)) + 5*x**3);\nend f;\n\nend Trabb;\n","language":"PL-I"},{"code":"TPK: DO;\n /* external I/O and real mathematical routines */\n WRITE$STRING: PROCEDURE( S ) EXTERNAL; DECLARE S POINTER; END;\n WRITE$REAL: PROCEDURE( R ) EXTERNAL; DECLARE R REAL; END;\n WRITE$NL: PROCEDURE EXTERNAL; END;\n READ$REAL: PROCEDURE( R ) REAL EXTERNAL; DECLARE R POINTER; END;\n REAL$ABS: PROCEDURE( R ) REAL EXTERNAL; DECLARE R REAL; END;\n REAL$SQRT: PROCEDURE( R ) REAL EXTERNAL; DECLARE R REAL; END;\n /* end external routines */\n\n F: PROCEDURE( T ) REAL;\n DECLARE T REAL;\n RETURN REAL$SQRT(REAL$ABS(T))+5*T*T*T;\n END F;\n MAIN: PROCEDURE;\n DECLARE Y REAL, A( 11 ) REAL, I INTEGER;\n DO I = 0 TO 10;\n CALL READ$REAL( @A( I ) );\n END;\n DO I = 10 TO 0 BY -1;\n Y = F( A( I ) );\n IF Y > 400.0 THEN CALL WRITE$STRING( @( 'TOO LARGE', 0 ) );\n ELSE CALL WRITE$REAL( Y );\n CALL WRITE$NL();\n END;\n END MAIN;\n\nEND TPK;\n","language":"PL-M"},{"code":"function Get-Tpk\n{\n [CmdletBinding()]\n [OutputType([PSCustomObject])]\n Param\n (\n [Parameter(Mandatory=$true,\n ValueFromPipeline=$true,\n ValueFromPipelineByPropertyName=$true,\n Position=0)]\n [double]\n $Number\n )\n\n Begin\n {\n function Get-TpkFunction ([double]$Number)\n {\n [Math]::Pow([Math]::Abs($Number),(0.5)) + 5 * [Math]::Pow($Number,3)\n }\n\n [object[]]$output = @()\n }\n Process\n {\n $Number | ForEach-Object {\n $n = Get-TpkFunction $_\n\n if ($n -le 400)\n {\n $result = $n\n }\n else\n {\n $result = \"Overflow\"\n }\n }\n\n $output += [PSCustomObject]@{\n Number = $Number\n Result = $result\n }\n }\n End\n {\n [Array]::Reverse($output)\n $output\n }\n}\n","language":"PowerShell"},{"code":"$tpk = 1..11 | Get-Tpk\n$tpk\n","language":"PowerShell"},{"code":"$tpk | where result -ne overflow | sort number\n","language":"PowerShell"},{"code":"Procedure.d f(x.d)\n ProcedureReturn Pow(Abs(x), 0.5) + 5 * x * x * x\nEndProcedure\n\nProcedure split(i.s, delimeter.s, List o.d())\n Protected index = CountString(i, delimeter) + 1 ;add 1 because last entry will not have a delimeter\n\n While index > 0\n AddElement(o())\n o() = ValD(Trim(StringField(i, index, delimeter)))\n index - 1\n Wend\n\n ProcedureReturn ListSize(o())\nEndProcedure\n\nDefine i$, entriesAreValid = 0, result.d, output$\nNewList numbers.d()\n\nIf OpenConsole()\n Repeat\n PrintN(#crlf$ + \"Enter eleven numbers that are each separated by spaces or commas:\")\n\n i$ = Input(\n i$ = Trim(i$)\n If split(i$, \",\", numbers.d()) < 11\n ClearList(numbers())\n If split(i$, \" \", numbers.d()) < 11\n PrintN(\"Not enough numbers were supplied.\")\n ClearList(numbers())\n Else\n entriesAreValid = 1\n EndIf\n Else\n entriesAreValid = 1\n EndIf\n Until entriesAreValid = 1\n\n ForEach numbers()\n output$ = \"f(\" + RTrim(RTrim(StrD(numbers(), 3), \"0\"), \".\") + \") = \"\n result.d = f(numbers())\n If result > 400\n output$ + \"Too Large\"\n Else\n output$ + RTrim(RTrim(StrD(result, 3), \"0\"), \".\")\n EndIf\n PrintN(output$)\n Next\n\n Print(#crlf$ + #crlf$ + \"Press ENTER to exit\"): Input()\n CloseConsole()\nEndIf\n","language":"PureBasic"},{"code":"Python 3.2.2 (default, Sep 4 2011, 09:51:08) [MSC v.1500 32 bit (Intel)] on win32\nType \"copyright\", \"credits\" or \"license()\" for more information.\n>>> def f(x): return abs(x) ** 0.5 + 5 * x**3\n\n>>> print(', '.join('%s:%s' % (x, v if v<=400 else \"TOO LARGE!\")\n\t for x,v in ((y, f(float(y))) for y in input('\\nnumbers: ').strip().split()[:11][::-1])))\n\n11 numbers: 1 2 3 4 5 6 7 8 9 10 11\n11:TOO LARGE!, 10:TOO LARGE!, 9:TOO LARGE!, 8:TOO LARGE!, 7:TOO LARGE!, 6:TOO LARGE!, 5:TOO LARGE!, 4:322.0, 3:136.73205080756887, 2:41.41421356237309, 1:6.0\n>>>\n","language":"Python"},{"code":"import math\n\ndef f(x):\n return math.sqrt(abs(x)) + 5 * x**3\n\ndef ask_numbers(n=11):\n print(f'Enter {n} numbers:')\n return (float(input('>')) for _ in range(n))\n\nif __name__ == '__main__':\n for x in ask_numbers().reverse():\n if (result := f(x)) > 400:\n print(f'f({x}): overflow')\n else:\n print(f'f({x}) = {result}')\n","language":"Python"},{"code":"FUNCTION f (n!)\n f = SQR(ABS(n)) + 5 * n ^ 3\nEND FUNCTION\n\nDIM s(1 TO 11)\nPRINT \"enter 11 numbers\"\nFOR i = 1 TO 11\n PRINT STR$(i);\n INPUT \" => \", s(i)\nNEXT i\n\nPRINT : PRINT STRING$(20, \"-\")\n\ni = i - 1\nDO\n PRINT \"f(\"; STR$(s(i)); \") = \";\n x = f(s(i))\n IF x > 400 THEN\n PRINT \"-=< overflow >=-\"\n ELSE\n PRINT x\n END IF\n i = i - 1\nLOOP UNTIL i < 1\nEND\n","language":"QBasic"},{"code":" [ $ \"bigrat.qky\" loadfile ] now!\n\n [ $->v drop\n 2dup vabs 10 vsqrt drop\n 2swap 2dup 2dup\n v* v* 5 n->v v* v+ ] is function ( $ --> n/d )\n\n [ $ \"Please enter 11 numbers: \"\n input nest$\n reverse\n witheach\n [ function\n 400 n->v 2over v< iff\n [ 2drop say \"overflow\" ]\n else\n [ 7 point$ echo$ ]\n sp ]\n cr ] is task ( --> )\n","language":"Quackery"},{"code":"S <- scan(n=11)\n\nf <- function(x) sqrt(abs(x)) + 5*x^3\n\nfor (i in rev(S)) {\n res <- f(i)\n if (res > 400)\n print(\"Too large!\")\n else\n print(res)\n}\n","language":"R"},{"code":"#lang racket\n\n(define input\n (for/list ([i 11])\n (printf \"Enter a number (~a of 11): \" (+ 1 i))\n (read)))\n\n(for ([x (reverse input)])\n (define res (+ (sqrt (abs x)) (* 5 (expt x 3))))\n (if (> res 400)\n (displayln \"Overflow!\")\n (printf \"f(~a) = ~a\\n\" x res)))\n","language":"Racket"},{"code":"my @nums = prompt(\"Please type 11 space-separated numbers: \").words\n until @nums == 11;\nfor @nums.reverse -> $n {\n my $r = $n.abs.sqrt + 5 * $n ** 3;\n say \"$n\\t{ $r > 400 ?? 'Urk!' !! $r }\";\n}\n","language":"Raku"},{"code":"/*REXX program implements the Trabb─Pardo-Knuth algorithm for N numbers (default is 11).*/\nnumeric digits 200 /*the number of digits precision to use*/\nparse arg N .; if N=='' | N==\",\" then N=11 /*Not specified? Then use the default.*/\nmaxValue= 400 /*the maximum value f(x) can have. */\n wid= 20 /* ··· but only show this many digits.*/\n frac= 5 /* ··· show this # of fractional digs.*/\nsay ' _____' /* ◄─── this SAY displays a vinculum.*/\nsay 'function: ƒ(x) ≡ √ │x│ + (5 * x^3)'\nprompt= 'enter ' N \" numbers for the Trabb─Pardo─Knuth algorithm: (or Quit)\"\n\n do ask=0; say; /*░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░*/\n say prompt; say; pull $; say /*░*/\n if abbrev('QUIT',$,1) then do; say 'quitting.'; exit 1; end /*░*/\n ok=0 /*░*/\n select /*validate there're N numbers.*/ /*░*/\n when $='' then say \"no numbers entered\" /*░*/\n when words($)<N then say \"not enough numbers entered\" /*░*/\n when words($)>N then say \"too many numbers entered\" /*░*/\n otherwise ok=1 /*░*/\n end /*select*/ /*░*/\n if \\ok then iterate /* [↓] W=max width. */ /*░*/\n w=0; do v=1 for N; _=word($, v); w=max(w, length(_) ) /*░*/\n if datatype(_, 'N') then iterate /*numeric ?*/ /*░*/\n say _ \"isn't numeric\"; iterate ask /*░*/\n end /*v*/ /*░*/\n leave /*░*/\n end /*ask*/ /*░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░*/\n\nsay 'numbers entered: ' $\nsay\n do i=N by -1 for N; #=word($, i) / 1 /*process the numbers in reverse. */\n g = fmt( f( # ) ) /*invoke function ƒ with arg number.*/\n gw=right( 'ƒ('#\") \", w+7) /*nicely formatted ƒ(number). */\n if g>maxValue then say gw \"is > \" maxValue ' ['space(g)\"]\"\n else say gw \" = \" g\n end /*i*/ /* [↑] display the result to terminal.*/\nexit /*stick a fork in it, we're all done. */\n/*──────────────────────────────────────────────────────────────────────────────────────*/\nf: procedure; parse arg x; return sqrt( abs(x) ) + 5 * x**3\n/*──────────────────────────────────────────────────────────────────────────────────────*/\nfmt: z=right(translate(format(arg(1), wid, frac), 'e', \"E\"), wid) /*right adjust; use e*/\n if pos(.,z)\\==0 then z=left(strip(strip(z,'T',0),\"T\",.),wid) /*strip trailing 0 &.*/\n return right(z, wid - 4*(pos('e', z)==0) ) /*adjust: no exponent*/\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":"# Project : Trabb Pardo–Knuth algorithm\n\ndecimals(3)\nx = list(11)\nfor n=1 to 11\n x[n] = n\nnext\n\ns = [-5, -3, -2, -1, 0, 1, 2, 3, 4, 5, 6]\nfor i = 1 to 11\n see string(i) + \" => \" + s[i] + nl\nnext\nsee copy(\"-\", 20) + nl\ni = i - 1\n\nwhile i > 0\n see \"f(\" + string(s[i]) + \") = \"\n x = f(s[i])\n if x > 400\n see \"-=< overflow >=-\" + nl\n else\n see x + nl\n ok\n i = i - 1\nend\n\nfunc f(n)\n return sqrt(fabs(n)) + 5 * pow(n, 3)\n","language":"Ring"},{"code":"def f(x) x.abs ** 0.5 + 5 * x ** 3 end\n\nputs \"Please enter 11 numbers:\"\nnums = 11.times.map{ gets.to_f }\n\nnums.reverse_each do |n|\n print \"f(#{n}) = \"\n res = f(n)\n puts res > 400 ? \"Overflow!\" : res\nend\n","language":"Ruby"},{"code":"dim s(10)\nprint \"Enter 11 numbers.\"\nfor i = 0 to 10\n print i +1;\n input \" => \"; s(i)\nnext i\nprint\n'Results\nfor i = 10 to 0 step -1\n print \"f(\"; s(i); \") = \";\n r = f(s(i))\n if r > 400 then\n print \"-=< overflow >=-\"\n else\n print r\n end if\nnext i\nend\n\nfunction f(n)\n f = sqr(abs(n)) + 5 * n * n * n\nend function\n","language":"Run-BASIC"},{"code":"use std::io::{self, BufRead};\n\nfn op(x: f32) -> Option<f32> {\n let y = x.abs().sqrt() + 5.0 * x * x * x;\n if y < 400.0 {\n Some(y)\n } else {\n None\n }\n}\n\nfn main() {\n println!(\"Please enter 11 numbers (one number per line)\");\n let stdin = io::stdin();\n\n let xs = stdin\n .lock()\n .lines()\n .map(|ox| ox.unwrap().trim().to_string())\n .flat_map(|s| str::parse::<f32>(&s))\n .take(11)\n .collect::<Vec<_>>();\n\n for x in xs.into_iter().rev() {\n match op(x) {\n Some(y) => println!(\"{}\", y),\n None => println!(\"overflow\"),\n };\n }\n}\n","language":"Rust"},{"code":"object TPKa extends App {\n final val numbers = scala.collection.mutable.MutableList[Double]()\n final val in = new java.util.Scanner(System.in)\n while (numbers.length < CAPACITY) {\n print(\"enter a number: \")\n try {\n numbers += in.nextDouble()\n }\n catch {\n case _: Exception =>\n in.next()\n println(\"invalid input, try again\")\n }\n }\n\n numbers reverseMap { x =>\n val fx = Math.pow(Math.abs(x), .5D) + 5D * (Math.pow(x, 3))\n if (fx < THRESHOLD)\n print(\"%8.3f -> %8.3f\\n\".format(x, fx))\n else\n print(\"%8.3f -> %s\\n\".format(x, Double.PositiveInfinity.toString))\n }\n\n private final val THRESHOLD = 400D\n private final val CAPACITY = 11\n}\n","language":"Scala"},{"code":"var nums; do {\n nums = Sys.readln(\"Please type 11 space-separated numbers: \").nums\n} while(nums.len != 11)\n\nnums.reverse.each { |n|\n var r = (n.abs.sqrt + (5 * n**3));\n say \"#{n}\\t#{ r > 400 ? 'Urk!' : r }\";\n}\n","language":"Sidef"},{"code":" 10 DIM A(11)\n 20 PRINT \"ENTER ELEVEN NUMBERS:\"\n 30 FOR I=1 TO 11\n 40 INPUT A(I)\n 50 NEXT I\n 60 FOR I=11 TO 1 STEP -1\n 70 LET Y=SQR ABS A(I)+5*A(I)**3\n 80 IF Y<=400 THEN GOTO 110\n 90 PRINT A(I),\"TOO LARGE\"\n100 GOTO 120\n110 PRINT A(I),Y\n120 NEXT I\n","language":"Sinclair-ZX81-BASIC"},{"code":"import Foundation\n\nprint(\"Enter 11 numbers for the Trabb─Pardo─Knuth algorithm:\")\n\nlet f: (Double) -> Double = { sqrt(fabs($0)) + 5 * pow($0, 3) }\n\n(1...11)\n .generate()\n .map { i -> Double in\n print(\"\\(i): \", terminator: \"\")\n guard let s = readLine(), let n = Double(s) else { return 0 }\n return n\n }\n .reverse()\n .forEach {\n let result = f($0)\n print(\"f(\\($0))\", result > 400.0 ? \"OVERFLOW\" : result, separator: \"\\t\")\n }\n","language":"Swift"},{"code":"|Trabb Pardo–Knuth algorithm\n\na : 11 0\n\n i\n if i LE 10\n [] $s\n ~ $s w\n w a.i\n + i\n goif\n endif\n 10 i\n if i GE 0\n call f\n if x GT 400\n 'too large' $s\n else\n ~ x $s\n endif\n ~ i $r\n + ' ' $r\n + $r $s.1\n $s []\n - i\n goif\n endif\n stop\n\nf a.i t\n * t t x\n * x t x\n * 5 x\n abs t\n sqrt t y\n + y x\n return\n","language":"Symsyn"},{"code":"# Helper procedures\nproc f {x} {expr {abs($x)**0.5 + 5*$x**3}}\nproc overflow {y} {expr {$y > 400}}\n\n# Read in 11 numbers, with nice prompting\nfconfigure stdout -buffering none\nfor {set n 1} {$n <= 11} {incr n} {\n puts -nonewline \"number ${n}: \"\n lappend S [scan [gets stdin] \"%f\"]\n}\n\n# Process and print results in reverse order\nforeach x [lreverse $S] {\n set result [f $x]\n if {[overflow $result]} {\n\tputs \"${x}: TOO LARGE!\"\n } else {\n\tputs \"${x}: $result\"\n }\n}\n","language":"Tcl"},{"code":"FUNCTION f (n)\n LET f = SQR(ABS(n)) + 5 * n ^ 3\nEND FUNCTION\n\nDIM s(1 TO 11)\nPRINT \"enter 11 numbers\"\nFOR i = 1 TO 11\n PRINT STR$(i); \" => \";\n INPUT s(i)\nNEXT i\n\nPRINT\nPRINT \"--------------------\"\n\nLET i = i - 1\nDO\n PRINT \"f(\"; STR$(s(i)); \") = \";\n LET x = f(s(i))\n IF x > 400 THEN\n PRINT \"-=< overflow >=-\"\n ELSE\n PRINT x\n END IF\n LET i = i - 1\nLOOP UNTIL i < 1\nEND\n","language":"True-BASIC"},{"code":"Function tpk(s)\n\tarr = Split(s,\" \")\n\tFor i = UBound(arr) To 0 Step -1\n\t\tn = fx(CDbl(arr(i)))\n\t\tIf n > 400 Then\n\t\t\tWScript.StdOut.WriteLine arr(i) & \" = OVERFLOW\"\n\t\tElse\n\t\t\tWScript.StdOut.WriteLine arr(i) & \" = \" & n\n\t\tEnd If\n\tNext\nEnd Function\n\nFunction fx(x)\n\tfx = Sqr(Abs(x))+5*x^3\nEnd Function\n\n'testing the function\nWScript.StdOut.Write \"Please enter a series of numbers:\"\nlist = WScript.StdIn.ReadLine\ntpk(list)\n","language":"VBScript"},{"code":"import \"io\" for Stdin, Stdout\nimport \"./fmt\" for Fmt\n\nvar f = Fn.new { |x| x.abs.sqrt + 5*x*x*x }\n\nvar s = List.filled(11, 0)\nSystem.print(\"Please enter 11 numbers:\")\nvar count = 0\nwhile (count < 11) {\n Fmt.write(\" Number $-2d : \", count + 1)\n Stdout.flush()\n var number = Num.fromString(Stdin.readLine())\n if (!number) {\n System.print(\"Not a valid number, try again.\")\n } else {\n s[count] = number\n count = count + 1\n }\n}\ns = s[-1..0]\nSystem.print(\"\\nResults:\")\nfor (item in s) {\n var fi = f.call(item)\n if (fi <= 400) {\n Fmt.print(\" f($6.3f) = $7.3f\", item, fi)\n } else {\n Fmt.print(\" f($6.3f) = overflow\", item)\n }\n}\n","language":"Wren"},{"code":"' Trabb Pardo-Knuth algorithm\nPROGRAM \"tpkalgorithm\"\nVERSION \"0.0001\"\n\nIMPORT \"xma\"\n\nDECLARE FUNCTION Entry ()\nINTERNAL FUNCTION SINGLE F(SINGLE n)\n\nFUNCTION Entry ()\n ' Used \"magic numbers\" because of strict specification of the algorithm.\n SINGLE s[10]\n SINGLE tmp, r\n UBYTE i\n PRINT \"Enter 11 numbers.\"\n FOR i = 0 TO 10\n PRINT i + 1;\n s[i] = SINGLE(INLINE$(\" => \"))\n NEXT i\n PRINT\n ' Reverse\n FOR i = 0 TO 10 / 2\n tmp = s[i]\n s[i] = s[10 - i]\n s[10 - i] = tmp\n NEXT i\n 'Results\n FOR i = 0 TO 10\n PRINT \"f(\"; LTRIM$(STR$(s[i])); \") =\";\n r = F(s[i])\n IF r > 400 THEN\n PRINT \" overflow\"\n ELSE\n PRINT r\n END IF\n NEXT i\nEND FUNCTION\n\nFUNCTION SINGLE F(SINGLE n)\n RETURN SQRT(ABS(n)) + 5 * n * n *n\nEND FUNCTION\nEND PROGRAM\n","language":"XBasic"},{"code":"include c:\\cxpl\\codes;\n\nfunc real F(X);\nreal X;\nreturn sqrt(abs(X)) + 5.0*X*X*X;\n\nreal Result, S(11); int I;\n[Text(0, \"Please enter 11 numbers: \");\nfor I:= 0 to 11-1 do S(I):= RlIn(0);\n\nfor I:= 11-1 downto 0 do\n [RlOut(0, S(I));\n Result:= F(S(I));\n if Result > 400.0 then\n Text(0, \" overflows\")\n else RlOut(0, Result);\n CrLf(0)];\n]\n","language":"XPL0"},{"code":"sub f(n)\n return sqr(abs(n)) + 5.0 * n ^ 3.0\nend sub\n\ndim s(11)\nprint \"enter 11 numbers\"\nfor i = 0 to 10\n print i, \" => \";\n input \"\" s(i)\nnext i\n\nprint \"\\n--------------------\"\nfor i = 10 to 0 step -1\n print \"f(\", s(i), \") = \";\n x = f(s(i))\n if x > 400 then\n print \"--- too large ---\"\n else\n print x\n endif\nnext i\nend\n","language":"Yabasic"},{"code":"fcn f(x) { x.abs().pow(0.5) + x.pow(3)*5 }\nreg ns; do{\n ns=ask(\"11 numbers seperated by spaces: \");\n try{ ns=ns.split(\" \").filter().apply(\"toFloat\") } catch{}\n}while(not ns.isType(List) or ns.len()!=11);\nns.reverse().apply(fcn(x){\n fx:=f(x); \"f(%7.3f)-->%s\".fmt(x, if(fx>400)\"Overflow\" else fx) })\n.pump(Console.println);\n","language":"Zkl"}],"string":"[\n {\n \"code\": \"---\\nfrom: http://rosettacode.org/wiki/Trabb_Pardo–Knuth_algorithm\\n\",\n \"language\": \"00-META\"\n },\n {\n \"code\": \"The TPK algorithm is an early example of a programming chrestomathy. \\nIt was used in Donald Knuth and Luis Trabb Pardo's Stanford tech report [http://bitsavers.org/pdf/stanford/cs_techReports/STAN-CS-76-562_EarlyDevelPgmgLang_Aug76.pdf The Early Development of Programming Languages]. \\nThe report traces the early history of work in developing computer languages in the 1940s and 1950s, giving several translations of the algorithm.\\n\\nFrom the [[wp:Trabb Pardo–Knuth algorithm|wikipedia entry]]:\\n\\n '''ask''' for 11 numbers to be read into a sequence ''S''\\n '''reverse''' sequence ''S''\\n '''for each''' ''item'' '''in''' sequence ''S''\\n ''result'' ''':=''' '''call''' a function to do an ''operation''\\n '''if''' ''result'' overflows\\n '''alert''' user\\n '''else'''\\n '''print''' ''result''\\n\\nThe task is to implement the algorithm:\\n# Use the function: <big><math>f(x) = |x|^{0.5} + 5x^3</math></big>\\n# The overflow condition is an answer of greater than 400.\\n# The 'user alert' should not stop processing of other items of the sequence.\\n# Print a prompt before accepting '''eleven''', textual, numeric inputs.\\n# You may optionally print the item as well as its associated result, but the results must be in reverse order of input.\\n# The sequence ''' ''S'' ''' may be 'implied' and so not shown explicitly.\\n# ''Print and show the program in action from a typical run here''. (If the output is graphical rather than text then either add a screendump or describe textually what is displayed).\\n<br><br>\\n\\n\",\n \"language\": \"00-TASK\"\n },\n {\n \"code\": \"F f(x)\\n R sqrt(abs(x)) + 5 * x ^ 3\\n\\nV s = Array(1..11)\\ns.reverse()\\nL(x) s\\n V result = f(x)\\n I result > 400\\n print(‘#.: #.’.format(x, ‘TOO LARGE!’))\\n E\\n print(‘#.: #.’.format(x, result))\\nprint()\\n\",\n \"language\": \"11l\"\n },\n {\n \"code\": \"with Ada.Text_IO, Ada.Numerics.Generic_Elementary_Functions;\\n\\nprocedure Trabb_Pardo_Knuth is\\n\\n type Real is digits 6 range -400.0 .. 400.0;\\n\\n package TIO renames Ada.Text_IO;\\n package FIO is new TIO.Float_IO(Real);\\n package Math is new Ada.Numerics.Generic_Elementary_Functions(Real);\\n\\n function F(X: Real) return Real is\\n begin\\n return (Math.Sqrt(abs(X)) + 5.0 * X**3);\\n end F;\\n\\n Values: array(1 .. 11) of Real;\\n\\nbegin\\n TIO.Put(\\\"Please enter 11 Numbers:\\\");\\n for I in Values'Range loop\\n FIO.Get(Values(I));\\n end loop;\\n\\n for I in reverse Values'Range loop\\n TIO.Put(\\\"f(\\\");\\n FIO.Put(Values(I), Fore => 2, Aft => 3, Exp => 0);\\n TIO.Put(\\\")=\\\");\\n begin\\n FIO.Put(F(Values(I)), Fore=> 4, Aft => 3, Exp => 0);\\n exception\\n when Constraint_Error => TIO.Put(\\\"-->too large<--\\\");\\n end;\\n TIO.New_Line;\\n end loop;\\n\\nend Trabb_Pardo_Knuth;\\n\",\n \"language\": \"Ada\"\n },\n {\n \"code\": \"scope # TPK algorithm in Agena\\n local y;\\n local a := [];\\n local f := proc( t :: number ) is return sqrt(abs(t))+5*t*t*t end;\\n for i from 0 to 10 do a[i] := tonumber( io.read() ) od;\\n for i from 10 to 0 by - 1 do\\n y:=f(a[i]);\\n if y > 400\\n then print( \\\"TOO LARGE\\\" )\\n else printf( \\\"%10.4f\\\\n\\\", y )\\n fi\\n od\\nepocs\\n\",\n \"language\": \"Agena\"\n },\n {\n \"code\": \"begin\\n integer i; real y; real array a[0:10];\\n real procedure f(t); value t; real t;\\n f:=sqrt(abs(t))+5*t^3;\\n for i:=0 step 1 until 10 do inreal(0, a[i]);\\n for i:=10 step -1 until 0 do\\n begin\\n y:=f(a[i]);\\n if y > 400 then outstring(1, \\\"TOO LARGE\\\")\\n else outreal(1,y);\\n outchar(1, \\\"\\\\n\\\", 1)\\n end\\nend\\n\",\n \"language\": \"ALGOL-60\"\n },\n {\n \"code\": \"[ 0 : 10 ]REAL a;\\nPROC f = ( REAL t )REAL:\\n sqrt(ABS t)+5*t*t*t;\\nFOR i FROM LWB a TO UPB a DO read( ( a[ i ] ) ) OD;\\nFOR i FROM UPB a BY -1 TO LWB a DO\\n REAL y=f(a[i]);\\n IF y > 400 THEN print( ( \\\"TOO LARGE\\\", newline ) )\\n ELSE print( ( fixed( y, -9, 4 ), newline ) )\\n FI\\nOD\\n\",\n \"language\": \"ALGOL-68\"\n },\n {\n \"code\": \"begin\\n real y; real array a( 0 :: 10 );\\n real procedure f( real value t );\\n sqrt(abs(t))+5*t*t*t;\\n for i:=0 until 10 do read( a(i) );\\n r_format := \\\"A\\\"; r_w := 9; r_d := 4;\\n for i:=10 step -1 until 0 do\\n begin\\n y:=f(a(i));\\n if y > 400 then write( \\\"TOO LARGE\\\" )\\n else write( y );\\n end\\nend.\\n\",\n \"language\": \"ALGOL-W\"\n },\n {\n \"code\": \"100 REM Trabb Pardo-Knuth algorithm\\n110 REM Used \\\"magic numbers\\\" because of strict specification of the algorithm.\\n120 DEF FNF(N) = SQR(ABS(N)) + 5 * N * N * N\\n130 DIM S(0 TO 10)\\n140 PRINT \\\"Enter 11 numbers.\\\"\\n150 FOR I = 0 TO 10\\n160 INPUT PROMPT STR$(I + 1) & \\\":\\\": S(I)\\n170 NEXT I\\n180 PRINT\\n190 REM Reverse\\n200 FOR I = 0 TO INT(10 / 2)\\n210 LET Tmp = S(I)\\n220 LET S(I) = S(10 - I)\\n230 LET S(10 - I) = Tmp\\n240 NEXT I\\n250 REM Results\\n260 FOR I = 0 TO 10\\n270 LET R = FNF(S(I))\\n280 PRINT USING \\\"f(####.###) = \\\": S(I);\\n290 IF R > 400 THEN\\n300 PRINT \\\"overflow\\\"\\n310 ELSE\\n320 PRINT USING \\\"####.###\\\": R\\n330 END IF\\n340 NEXT I\\n350 END\\n\",\n \"language\": \"ANSI-BASIC\"\n },\n {\n \"code\": \"∇ {res}←Trabb;f;S;i;a;y ⍝ define a function Trabb\\n f←{(0.5*⍨|⍵)+5×⍵*3} ⍝ define a function f\\n S←,⍎{⍞←⍵ ⋄ (≢⍵)↓⍞}'Please, enter 11 numbers: '\\n :For i a :InEach (⌽⍳≢S)(⌽S) ⍝ loop through N..1 and reversed S\\n :If 400<y←f(a)\\n ⎕←'Too large: ',⍕i\\n :Else\\n ⎕←i,y\\n :EndIf\\n :EndFor\\n∇\\n\",\n \"language\": \"APL\"\n },\n {\n \"code\": \"10 REM Trabb Pardo-Knuth algorithm\\n20 HOME : REM 20 CLS for Chipmunk Basic or GW-BASIC\\n30 DIM S(10)\\n40 PRINT \\\"Enter 11 numbers.\\\"\\n50 FOR I = 0 TO 10\\n60 PRINT I+1;\\n70 INPUT \\\"=> \\\";S(I)\\n80 NEXT I\\n90 PRINT\\n100 REM Results\\n110 FOR I = 10 TO 0 STEP -1\\n120 PRINT \\\"f( \\\" S(I)\\\") = \\\";\\n130 F = S(I)\\n140 R = SQR(ABS(F))+5*F^3\\n150 IF R > 400 THEN PRINT \\\"-=< overflow >=-\\\"\\n160 IF R <= 400 THEN PRINT R\\n170 NEXT I\\n180 END\\n\",\n \"language\": \"Applesoft-BASIC\"\n },\n {\n \"code\": \"proc: function [x]->\\n ((abs x) ^ 0.5) + 5 * x ^ 3\\n\\nask: function [msg][\\n to [:floating] first.n: 11 split.words strip input msg\\n]\\n\\nloop reverse ask \\\"11 numbers: \\\" 'n [\\n result: proc n\\n print [n \\\":\\\" (result > 400)? -> \\\"TOO LARGE!\\\" -> result]\\n]\\n\",\n \"language\": \"Arturo\"\n },\n {\n \"code\": \"REM Trabb Pardo-Knuth algorithm\\nREM Used \\\"magic numbers\\\" because of strict specification of the algorithm.\\nDIM S@(10)\\nPRINT \\\"Enter 11 numbers.\\\"\\nFOR I = 0 TO 10\\n I1= I + 1\\n PRINT I1;\\n PRINT \\\" => \\\";\\n INPUT TMP@\\n S@(I) = TMP@\\nNEXT I\\nPRINT\\nREM Reverse\\nHALFIMAX = 10 / 2\\nFOR I = 0 TO HALFIMAX\\n IREV = 10 - I\\n TMP@ = S@(I)\\n S@(I) = S@(IREV)\\n S@(IREV) = TMP@\\nNEXT I\\nREM Results\\nREM Leading spaces in printed numbers are removed\\nCLS\\nFOR I = 0 TO 10\\n PRINT \\\"f(\\\";\\n STMP$ = STR$(S@(I))\\n STMP$ = LTRIM$(STMP$)\\n PRINT STMP$;\\n PRINT \\\") = \\\";\\n N@ = S@(I)\\n GOSUB CALCF:\\n R@ = F@\\n IF R@ > 400 THEN\\n PRINT \\\"overflow\\\"\\n ELSE\\n STMP$ = STR$(R@)\\n STMP$ = LTRIM$(STMP$)\\n PRINT STMP$\\n ENDIF\\nNEXT I\\nEND\\n\\nCALCF:\\nREM Calculates f(N@)\\nREM Result in F@\\nX@ = ABS(N@)\\nGOSUB CALCSQRT:\\nF@ = 5.0 * N@\\nF@ = F@ * N@\\nF@ = F@ * N@\\nF@ = F@ + SQRT@\\nRETURN\\n\\nCALCSQRT:\\nREM Calculates approximate (+- 0.00001) square root of X@ for X@ >= 0 (bisection method)\\nREM Result in SQRT@\\nA@ = 0.0\\nIF X@ >= 1.0 THEN\\n B@ = X@\\nELSE\\n B@ = 1.0\\nENDIF\\nL@ = B@ - A@\\nL@ = ABS(L@)\\nWHILE L@ > 0.00001\\n MIDDLE@ = A@ + B@\\n MIDDLE@ = MIDDLE@ / 2\\n MIDDLETO2@ = MIDDLE@ * MIDDLE@\\n IF MIDDLETO2@ < X@ THEN\\n A@ = MIDDLE@\\n ELSE\\n B@ = MIDDLE@\\n ENDIF\\n L@ = B@ - A@\\n L@ = ABS(L@)\\nWEND\\nSQRT@ = MIDDLE@\\nRETURN\\n\",\n \"language\": \"ASIC\"\n },\n {\n \"code\": \"seq := [1,2,3,4,5,6,7,8,9,10,11]\\nMsgBox % result := TPK(seq, 400)\\nreturn\\n\\nTPK(s, num){\\n for i, v in reverse(s)\\n res .= v . \\\" : \\\" . ((x:=f(v)) > num ? \\\"OVERFLOW\\\" : x ) . \\\"`n\\\"\\n return res\\n}\\nreverse(s){\\n Loop % s.Count()\\n s.InsertAt(A_Index, s.pop())\\n return s\\n}\\nf(x){\\n return Sqrt(x) + 5* (x**3)\\n}\\n\",\n \"language\": \"AutoHotkey\"\n },\n {\n \"code\": \"; Trabb Pardo–Knuth algorithm\\n; by James1337 (autoit.de)\\n; AutoIt Version: 3.3.8.1\\n\\nLocal $S, $i, $y\\n\\nDo\\n\\t$S = InputBox(\\\"Trabb Pardo–Knuth algorithm\\\", \\\"Please enter 11 numbers:\\\", \\\"1 2 3 4 5 6 7 8 9 10 11\\\")\\n\\tIf @error Then Exit\\n\\t$S = StringSplit($S, \\\" \\\")\\nUntil ($S[0] = 11)\\n\\nFor $i = 11 To 1 Step -1\\n\\t$y = f($S[$i])\\n\\tIf ($y > 400) Then\\n\\t\\tConsoleWrite(\\\"f(\\\" & $S[$i] & \\\") = Overflow!\\\" & @CRLF)\\n\\tElse\\n\\t\\tConsoleWrite(\\\"f(\\\" & $S[$i] & \\\") = \\\" & $y & @CRLF)\\n\\tEndIf\\nNext\\n\\nFunc f($x)\\n\\tReturn Sqrt(Abs($x)) + 5*$x^3\\nEndFunc\\n\",\n \"language\": \"AutoIt\"\n },\n {\n \"code\": \"# syntax: GAWK -f TRABB_PARDO-KNUTH_ALGORITHM.AWK\\nBEGIN {\\n printf(\\\"enter 11 numbers: \\\")\\n getline S\\n n = split(S,arr,\\\" \\\")\\n if (n != 11) {\\n printf(\\\"%d numbers entered; S/B 11\\\\n\\\",n)\\n exit(1)\\n }\\n for (i=n; i>0; i--) {\\n x = f(arr[i])\\n printf(\\\"f(%s) = %s\\\\n\\\",arr[i],(x>400) ? \\\"too large\\\" : x)\\n }\\n exit(0)\\n}\\nfunction abs(x) { if (x >= 0) { return x } else { return -x } }\\nfunction f(x) { return sqrt(abs(x)) + 5 * x ^ 3 }\\n\",\n \"language\": \"AWK\"\n },\n {\n \"code\": \"dim s(11)\\nprint 'enter 11 numbers'\\nfor i = 0 to 10\\n input i + \\\">\\\" , s[i]\\nnext i\\n\\nfor i = 10 to 0 step -1\\n print \\\"f(\\\" + s[i] + \\\")=\\\";\\n x = f(s[i])\\n if x > 400 then\\n print \\\"-=< overflow >=-\\\"\\n else\\n print x\\n endif\\nnext i\\nend\\n\\nfunction f(n)\\n return sqrt(abs(n))+5*n^3\\nend function\\n\",\n \"language\": \"BASIC256\"\n },\n {\n \"code\": \"#include<math.h>\\n#include<stdio.h>\\n\\nint\\nmain ()\\n{\\n double inputs[11], check = 400, result;\\n int i;\\n\\n printf (\\\"\\\\nPlease enter 11 numbers :\\\");\\n\\n for (i = 0; i < 11; i++)\\n {\\n scanf (\\\"%lf\\\", &inputs[i]);\\n }\\n\\n printf (\\\"\\\\n\\\\n\\\\nEvaluating f(x) = |x|^0.5 + 5x^3 for the given inputs :\\\");\\n\\n for (i = 10; i >= 0; i--)\\n {\\n result = sqrt (fabs (inputs[i])) + 5 * pow (inputs[i], 3);\\n\\n printf (\\\"\\\\nf(%lf) = \\\");\\n\\n if (result > check)\\n {\\n printf (\\\"Overflow!\\\");\\n }\\n\\n else\\n {\\n printf (\\\"%lf\\\", result);\\n }\\n }\\n\\n return 0;\\n}\\n\",\n \"language\": \"C\"\n },\n {\n \"code\": \"#include <iostream>\\n#include <cmath>\\n#include <vector>\\n#include <algorithm>\\n#include <iomanip>\\n\\nint main( ) {\\n std::vector<double> input( 11 ) , results( 11 ) ;\\n std::cout << \\\"Please enter 11 numbers!\\\\n\\\" ;\\n for ( int i = 0 ; i < input.size( ) ; i++ )\\n std::cin >> input[i];\\n\\n std::transform( input.begin( ) , input.end( ) , results.begin( ) ,\\n\\t [ ]( double n )-> double { return sqrt( abs( n ) ) + 5 * pow( n , 3 ) ; } ) ;\\n for ( int i = 10 ; i > -1 ; i-- ) {\\n std::cout << \\\"f( \\\" << std::setw( 3 ) << input[ i ] << \\\" ) : \\\" ;\\n if ( results[ i ] > 400 )\\n\\t std::cout << \\\"too large!\\\" ;\\n else\\n\\t std::cout << results[ i ] << \\\" !\\\" ;\\n std::cout << std::endl ;\\n }\\n return 0 ;\\n}\\n\",\n \"language\": \"C++\"\n },\n {\n \"code\": \"10 rem Trabb Pardo-Knuth algorithm\\n20 cls\\n30 dim s(10)\\n40 print \\\"Enter 11 numbers.\\\"\\n50 for i = 0 to 10\\n60 print i+1;\\n70 input \\\"=> \\\";s(i)\\n80 next i\\n90 print\\n160 'Results\\n170 for i = 10 to 0 step -1\\n180 print \\\"f( \\\" s(i)\\\") = \\\";\\n190 r = f(s(i))\\n200 if r > 400 then\\n210 print \\\"-=< overflow >=-\\\"\\n220 else\\n230 print r\\n240 endif\\n250 next i\\n260 end\\n270 function f(n)\\n280 f = sqr(abs(n))+5*n^3\\n290 return\\n\",\n \"language\": \"Chipmunk-Basic\"\n },\n {\n \"code\": \"10 REM TRABB PARDO-KNUTH ALGORITHM\\n20 REM USED \\\"MAGIC NUMBERS\\\" BECAUSE OF STRICT SPECIFICATION OF THE ALGORITHM.\\n30 DEF FNF(N)=SQR(ABS(N))+5*N*N*N\\n40 DIM S(10)\\n50 PRINT \\\"ENTER 11 NUMBERS.\\\"\\n60 FOR I=0 TO 10\\n70 PRINT STR$(I+1);\\n80 INPUT S(I)\\n90 NEXT I\\n100 PRINT\\n110 REM REVERSE\\n120 FOR I=0 TO 10/2\\n130 TMP=S(I)\\n140 S(I)=S(10-I)\\n150 S(10-I)=TMP\\n160 NEXT I\\n170 REM RESULTS\\n180 FOR I=0 TO 10\\n190 PRINT \\\"F(\\\";STR$(S(I));\\\") =\\\";\\n200 R=FNF(S(I))\\n210 IF R>400 THEN PRINT \\\" OVERFLOW\\\":ELSE PRINT R\\n220 NEXT I\\n230 END\\n\",\n \"language\": \"Commodore-BASIC\"\n },\n {\n \"code\": \"(defun read-numbers ()\\n (princ \\\"Enter 11 numbers (space-separated): \\\")\\n (let ((numbers '()))\\n (dotimes (i 11 numbers)\\n (push (read) numbers))))\\n\\n(defun trabb-pardo-knuth (func overflowp)\\n (let ((S (read-numbers)))\\n (format T \\\"~{~a~%~}\\\"\\n (substitute-if \\\"Overflow!\\\" overflowp (mapcar func S)))))\\n\\n(trabb-pardo-knuth (lambda (x) (+ (expt (abs x) 0.5) (* 5 (expt x 3))))\\n (lambda (x) (> x 400)))\\n\",\n \"language\": \"Common-Lisp\"\n },\n {\n \"code\": \"import std.stdio, std.math, std.conv, std.algorithm, std.array;\\n\\ndouble f(in double x) pure nothrow {\\n return x.abs.sqrt + 5 * x ^^ 3;\\n}\\n\\nvoid main() {\\n double[] data;\\n\\n while (true) {\\n \\\"Please enter eleven numbers on a line: \\\".write;\\n data = readln.split.map!(to!double).array;\\n if (data.length == 11)\\n break;\\n writeln(\\\"Those aren't eleven numbers.\\\");\\n }\\n foreach_reverse (immutable x; data) {\\n immutable y = x.f;\\n writefln(\\\"f(%0.3f) = %s\\\", x, y > 400 ? \\\"Too large\\\" : y.text);\\n }\\n}\\n\",\n \"language\": \"D\"\n },\n {\n \"code\": \"procedure DoPardoKnuth(Memo: TMemo; A: array of double);\\nvar Y: double;\\nvar I: integer;\\nvar S: string;\\n\\n\\tfunction Func(T: double): double;\\n\\tbegin\\n\\tResult:=Sqrt(abs(T))+ 5*T*T*T;\\n\\tend;\\n\\nbegin\\nfor I:=0 to High(A) do\\n\\tbegin\\n\\tY:=Func(A[I]);\\n\\tif y > 400 then S:='Too Large'\\n\\telse S:=Format('%f %f',[A[I],Y]);\\n\\tMemo.Lines.Add(S);\\n\\tend;\\nend;\\n\\nprocedure ShowPardoKnuth(Memo: TMemo);\\nbegin\\nDoPardoKnuth(Memo, [1,2,3,4,5,6,7,8,9,10,11]);\\nend;\\n\",\n \"language\": \"Delphi\"\n },\n {\n \"code\": \"print \\\"Please enter 11 numbers :\\\"\\nn[] = number strsplit input \\\" \\\"\\nprint \\\"\\\"\\nprint \\\"Evaluating f(x) = |x|^0.5 + 5x^3 for the given inputs :\\\"\\nfor i = len n[] downto 1\\n r = sqrt abs n[i] + 5 * pow n[i] 3\\n write \\\"f(\\\" & n[i] & \\\") = \\\"\\n if r > 400\\n print \\\"Overflow!\\\"\\n else\\n print r\\n .\\n.\\n# without this section, the input is interactive\\ninput_data\\n10 -1 1 2 3 4 4.3 4.31 4.32 4.32 4.29\\n\",\n \"language\": \"EasyLang\"\n },\n {\n \"code\": \"(define (trabb-fun n)\\n\\t\\t(+ (* 5 n n n) (sqrt(abs n))))\\n\\t\\t\\n(define (check-trabb n)\\n\\t(if (number? n)\\n\\t(if (<= (trabb-fun n) 400)\\n\\t\\t(printf \\\"🌱 f(%d) = %d\\\" n (trabb-fun n))\\n\\t\\t(printf \\\"❌ f(%d) = %d\\\" n (trabb-fun n)))\\n\\t(error \\\"not a number\\\" n)))\\n\\t\\t\\n(define (trabb (numlist null))\\n\\t(while (< (length numlist) 11)\\n\\t(set! numlist (append numlist\\n\\t\\t(or\\n\\t\\t(read default: (shuffle (iota 11))\\n\\t\\t prompt: (format \\\"Please enter %d more numbers\\\" (- 11 (length numlist))))\\n\\t\\t(error 'incomplete-list numlist))))) ;; users cancel\\n\\t(for-each check-trabb (reverse (take numlist 11))))\\n\",\n \"language\": \"EchoLisp\"\n },\n {\n \"code\": \"(trabb)\\n;; input : (0 4 1 8 5 9 10 3 6 7 2)\\n\\n🌱 f(2) = 41.41421356237309\\n❌ f(7) = 1717.6457513110645\\n❌ f(6) = 1082.4494897427833\\n🌱 f(3) = 136.73205080756887\\n❌ f(10) = 5003.162277660168\\n❌ f(9) = 3648\\n❌ f(5) = 627.2360679774998\\n❌ f(8) = 2562.828427124746\\n🌱 f(1) = 6\\n🌱 f(4) = 322\\n🌱 f(0) = 0\\n\\n;; extra credit : let's find the threshold\\n(lib 'math)\\n(define (g x) (- (trabb-fun x) 400))\\n(root g 0 10)\\n → 4.301409367213084\\n\",\n \"language\": \"EchoLisp\"\n },\n {\n \"code\": \"open monad io number string\\n\\n:::IO\\n\\ntake_numbers 0 xs = do\\n return $ iter xs\\n where f x = sqrt (toSingle x) + 5.0 * (x ** 3.0)\\n p x = x < 400.0\\n iter [] = return ()\\n iter (x::xs)\\n | p res = do\\n putStrLn (format \\\"f({0}) = {1}\\\" x res)\\n iter xs\\n | else = do\\n putStrLn (format \\\"f({0}) :: Overflow\\\" x)\\n iter xs\\n where res = f x\\ntake_numbers n xs = do\\n x <- readAny\\n take_numbers (n - 1) (x::xs)\\n\\ndo\\n putStrLn \\\"Please enter 11 numbers:\\\"\\n take_numbers 11 []\\n\",\n \"language\": \"Ela\"\n },\n {\n \"code\": \"import extensions;\\nimport extensions'math;\\n\\npublic program()\\n{\\n real[] inputs := new real[](11);\\n console.printLine(\\\"Please enter 11 numbers :\\\");\\n for(int i := 0; i < 11; i += 1)\\n {\\n inputs[i] := console.readLine().toReal()\\n };\\n\\n console.printLine(\\\"Evaluating f(x) = |x|^0.5 + 5x^3 for the given inputs :\\\");\\n for(int i := 10; i >= 0; i -= 1)\\n {\\n real result := sqrt(abs(inputs[i])) + 5 * power(inputs[i], 3);\\n\\n console.print(\\\"f(\\\", inputs[i], \\\")=\\\");\\n\\n if (result > 400)\\n {\\n console.printLine(\\\"Overflow!\\\")\\n }\\n else\\n {\\n console.printLine(result)\\n }\\n }\\n}\\n\",\n \"language\": \"Elena\"\n },\n {\n \"code\": \"defmodule Trabb_Pardo_Knuth do\\n def task do\\n Enum.reverse( get_11_numbers )\\n |> Enum.each( fn x -> perform_operation( &function(&1), 400, x ) end )\\n end\\n\\n defp alert( n ), do: IO.puts \\\"Operation on #{n} overflowed\\\"\\n\\n defp get_11_numbers do\\n ns = IO.gets( \\\"Input 11 integers. Space delimited, please: \\\" )\\n |> String.split\\n |> Enum.map( &String.to_integer &1 )\\n if 11 == length( ns ), do: ns, else: get_11_numbers\\n end\\n\\n defp function( x ), do: :math.sqrt( abs(x) ) + 5 * :math.pow( x, 3 )\\n\\n defp perform_operation( fun, overflow, n ), do: perform_operation_check_overflow( n, fun.(n), overflow )\\n\\n defp perform_operation_check_overflow( n, result, overflow ) when result > overflow, do: alert( n )\\n defp perform_operation_check_overflow( n, result, _overflow ), do: IO.puts \\\"f(#{n}) => #{result}\\\"\\nend\\n\\nTrabb_Pardo_Knuth.task\\n\",\n \"language\": \"Elixir\"\n },\n {\n \"code\": \"-module( trabb_pardo_knuth ).\\n\\n-export( [task/0] ).\\n\\ntask() ->\\n\\tSequence = get_11_numbers(),\\n\\tS = lists:reverse( Sequence ),\\n\\t[perform_operation( fun function/1, 400, X) || X <- S].\\n\\n\\nalert( N ) -> io:fwrite( \\\"Operation on ~p overflowed~n\\\", [N] ).\\n\\nget_11_numbers() ->\\n\\t{ok, Ns} = io:fread( \\\"Input 11 integers. Space delimited, please: \\\", \\\"~d ~d ~d ~d ~d ~d ~d ~d ~d ~d ~d\\\" ),\\n\\t11 = erlang:length( Ns ),\\n\\tNs.\\n\\nfunction( X ) -> math:sqrt( erlang:abs(X) ) + 5 * math:pow( X, 3 ).\\n\\nperform_operation( Fun, Overflow, N ) -> perform_operation_check_overflow( N, Fun(N), Overflow ).\\n\\nperform_operation_check_overflow( N, Result, Overflow ) when Result > Overflow -> alert( N );\\nperform_operation_check_overflow( N, Result, _Overflow ) -> io:fwrite( \\\"f(~p) => ~p~n\\\", [N, Result] ).\\n\",\n \"language\": \"Erlang\"\n },\n {\n \"code\": \"!Trabb Pardo-Knuth algorithm\\nPROGRAM TPK\\n!VAR I%,Y\\nDIM A[10]\\n\\nFUNCTION F(T)\\n F=SQR(ABS(T))+5*T^3\\nEND FUNCTION\\n\\nBEGIN\\n DATA(10,-1,1,2,3,4,4.3,4.305,4.303,4.302,4.301)\\n FOR I%=0 TO 10 DO\\n READ(A[I%])\\n END FOR\\n FOR I%=10 TO 0 STEP -1 DO\\n Y=F(A[I%])\\n PRINT(\\\"F(\\\";A[I%];\\\")=\\\";)\\n IF Y>400 THEN PRINT(\\\"--->too large<---\\\")\\n ELSE PRINT(Y)\\n END IF\\n END FOR\\nEND PROGRAM\\n\",\n \"language\": \"ERRE\"\n },\n {\n \"code\": \"module ``Trabb Pardo - Knuth``\\nopen System\\nlet f (x: float) = sqrt(abs x) + (5.0 * (x ** 3.0))\\n\\nConsole.WriteLine \\\"Enter 11 numbers:\\\"\\n[for _ in 1..11 -> Convert.ToDouble(Console.ReadLine())]\\n|> List.rev |> List.map f |> List.iter (function\\n| n when n <= 400.0 -> Console.WriteLine(n)\\n| _ -> Console.WriteLine(\\\"Overflow\\\"))\\n\",\n \"language\": \"F-Sharp\"\n },\n {\n \"code\": \"USING: formatting io kernel math math.functions math.parser\\nprettyprint sequences splitting ;\\nIN: rosetta-code.trabb-pardo-knuth\\n\\nCONSTANT: threshold 400\\nCONSTANT: prompt \\\"Please enter 11 numbers: \\\"\\n\\n: fn ( x -- y ) [ abs 0.5 ^ ] [ 3 ^ 5 * ] bi + ;\\n\\n: overflow? ( x -- ? ) threshold > ;\\n\\n: get-input ( -- seq )\\n prompt write flush readln \\\" \\\" split dup length 11 =\\n [ drop get-input ] unless ;\\n\\n: ?result ( ..a quot: ( ..a -- ..b ) -- ..b )\\n [ \\\"f(%u) = \\\" sprintf ] swap bi dup overflow?\\n [ drop \\\"overflow\\\" ] [ \\\"%.3f\\\" sprintf ] if append ; inline\\n\\n: main ( -- )\\n get-input reverse\\n [ string>number [ fn ] ?result print ] each ;\\n\\nMAIN: main\\n\",\n \"language\": \"Factor\"\n },\n {\n \"code\": \": f(x) fdup fsqrt fswap 3e f** 5e f* f+ ;\\n\\n4e2 fconstant f-too-big\\n\\n11 Constant #Elements\\n\\n: float-array ( compile: n -- / run: n -- addr )\\n create\\n floats allot\\n does>\\n swap floats + ;\\n\\n#Elements float-array vec\\n\\n: get-it ( -- )\\n .\\\" Enter \\\" #Elements . .\\\" numbers:\\\" cr\\n #Elements 0 DO\\n .\\\" > \\\" pad 25 accept cr\\n pad swap >float 0= abort\\\" Invalid Number\\\"\\n i vec F!\\n LOOP ;\\n\\n: reverse-it ( -- )\\n #Elements 2/ 0 DO\\n i vec F@ #Elements i - 1- vec F@\\n i vec F! #Elements i - 1- vec F!\\n LOOP ;\\n\\n: do-it ( -- )\\n #Elements 0 DO\\n i vec F@ fdup f. [char] : emit space\\n\\tf(x) fdup f-too-big f> IF\\n fdrop .\\\" too large\\\"\\n ELSE\\n f.\\n THEN cr\\n LOOP ;\\n\\n: tpk ( -- )\\n get-it reverse-it do-it ;\\n\",\n \"language\": \"Forth\"\n },\n {\n \"code\": \"program tpk\\n implicit none\\n\\n real, parameter :: overflow = 400.0\\n real :: a(11), res\\n integer :: i\\n\\n write(*,*) \\\"Input eleven numbers:\\\"\\n read(*,*) a\\n\\n a = a(11:1:-1)\\n do i = 1, 11\\n res = f(a(i))\\n write(*, \\\"(a, f0.3, a)\\\", advance = \\\"no\\\") \\\"f(\\\", a(i), \\\") = \\\"\\n if(res > overflow) then\\n write(*, \\\"(a)\\\") \\\"overflow!\\\"\\n else\\n write(*, \\\"(f0.3)\\\") res\\n end if\\n end do\\n\\ncontains\\n\\nreal function f(x)\\n real, intent(in) :: x\\n\\n f = sqrt(abs(x)) + 5.0*x**3\\n\\nend function\\nend program\\n\",\n \"language\": \"Fortran\"\n },\n {\n \"code\": \"C THE TPK ALGORITH - FORTRAN I - 1957 TPK00010\\n FTPKF(X)=SQRTF(ABSF(X))+5.0*X**3 TPK00020\\n DIMENSION A(11) TPK00030\\n READ 100,A TPK00040\\n 100 FORMAT(6F12.4/) TPK00050\\n DO 3 I=1,11 TPK00060\\n J=12-I TPK00070\\n Y=FTPKF(A(J)) TPK00080\\n IF (Y-400.0)2,2,1 TPK00090\\n 1 PRINT 301,I,A(J) TPK00100\\n 301 FORMAT(I10,F12.7,18H *** TOO LARGE ***) TPK00110\\n GO TO 10 TPK00120\\n 2 PRINT 302,I,A(J),Y TPK00130\\n 302 FORMAT(I10,2F12.7) TPK00140\\n 3 CONTINUE TPK00150\\n STOP 0 TPK00160\\n\",\n \"language\": \"Fortran\"\n },\n {\n \"code\": \"' version 22-07-2017\\n' compile with: fbc -s console\\n\\nFunction f(n As Double) As Double\\n return Sqr(Abs(n)) + 5 * n ^ 3\\nEnd Function\\n\\n' ------=< MAIN >=------\\n\\nDim As Double x, s(1 To 11)\\nDim As Long i\\n\\nFor i = 1 To 11\\n Print Str(i);\\n Input \\\" => \\\", s(i)\\nNext\\n\\nPrint\\nPrint String(20,\\\"-\\\")\\n\\ni -= 1\\nDo\\n Print \\\"f(\\\" + Str(s(i)) + \\\") = \\\";\\n x = f(s(i))\\n If x > 400 Then\\n Print \\\"-=< overflow >=-\\\"\\n Else\\n Print x\\n End If\\n i -= 1\\nLoop Until i < 1\\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\": \"// Trabb Pardo-Knuth algorithm\\n\\ninclude \\\"NSLog.incl\\\"\\n\\nlocal fn f( x as double ) as double\\nend fn = fn pow( abs(x), 0.5) + 5 * ( fn pow(x, 3) )\\n\\nvoid local fn PardoKnuth( userInput as double )\\n double x = userInput\\n double y = fn f(x)\\n NSLog( @\\\"f(%.4f)\\\\t= \\\\b\\\", x )\\n if( y < 400.0 )\\n NSLog( @\\\"%.4f\\\", y )\\n else\\n NSLog( @\\\"[Overflow]\\\" )\\n end if\\nend fn\\n\\nNSUInteger i\\nCFArrayRef numbers\\n\\nnumbers = @[@10, @-1, @1, @2, @3 ,@4, @4.3, @4.305, @4.303, @4.302, @4.301]\\n\\nNSLog( @\\\"Please enter 11 numbers:\\\" )\\nfor i = len(numbers) to 1 step -1\\n fn PardoKnuth( fn NumberDoubleValue( numbers[i-1] ) )\\nnext\\n\\nHandleEvents\\n\",\n \"language\": \"FutureBasic\"\n },\n {\n \"code\": \"package main\\n\\nimport (\\n \\\"fmt\\\"\\n \\\"log\\\"\\n \\\"math\\\"\\n)\\n\\nfunc main() {\\n // prompt\\n fmt.Print(\\\"Enter 11 numbers: \\\")\\n // accept sequence\\n var s [11]float64\\n for i := 0; i < 11; {\\n if n, _ := fmt.Scan(&s[i]); n > 0 {\\n i++\\n }\\n }\\n // reverse sequence\\n for i, item := range s[:5] {\\n s[i], s[10-i] = s[10-i], item\\n }\\n // iterate\\n for _, item := range s {\\n if result, overflow := f(item); overflow {\\n // send alerts to stderr\\n log.Printf(\\\"f(%g) overflow\\\", item)\\n } else {\\n // send normal results to stdout\\n fmt.Printf(\\\"f(%g) = %g\\\\n\\\", item, result)\\n }\\n }\\n}\\n\\nfunc f(x float64) (float64, bool) {\\n result := math.Sqrt(math.Abs(x)) + 5*x*x*x\\n return result, result > 400\\n}\\n\",\n \"language\": \"Go\"\n },\n {\n \"code\": \"package main\\n\\nimport (\\n \\\"fmt\\\"\\n \\\"math\\\"\\n)\\n\\nfunc f(t float64) float64 {\\n return math.Sqrt(math.Abs(t)) + 5*math.Pow(t, 3)\\n}\\n\\nfunc main() {\\n var a [11]float64\\n for i := range a {\\n fmt.Scan(&a[i])\\n }\\n for i := len(a) - 1; i >= 0; i-- {\\n if y := f(a[i]); y > 400 {\\n fmt.Println(i, \\\"TOO LARGE\\\")\\n } else {\\n fmt.Println(i, y)\\n }\\n }\\n}\\n\",\n \"language\": \"Go\"\n },\n {\n \"code\": \"10 REM Trabb Pardo-Knuth algorithm\\n20 REM Used \\\"magic numbers\\\" because of strict specification of the algorithm.\\n30 DEF FNF(N) = SQR(ABS(N)) + 5 * N * N * N\\n40 DIM S(10)\\n50 PRINT \\\"Enter 11 numbers.\\\"\\n60 FOR I% = 0 TO 10\\n70 PRINT STR$(I%+1);\\n80 INPUT S(I%)\\n90 NEXT I%\\n100 PRINT\\n110 REM Reverse\\n120 FOR I% = 0 TO 10 \\\\ 2\\n130 TMP = S(I%): S(I%) = S(10 - I%): S(10 - I%) = TMP\\n160 NEXT I%\\n170 REM Results\\n180 FOR I% = 0 TO 10\\n190 PRINT \\\"f(\\\";STR$(S(I%));\\\") =\\\";\\n220 R = FNF(S(I%))\\n230 IF R > 400 THEN PRINT \\\" overflow\\\" ELSE PRINT R\\n240 NEXT I%\\n250 END\\n\",\n \"language\": \"GW-BASIC\"\n },\n {\n \"code\": \"import Control.Monad (replicateM, mapM_)\\n\\nf :: Floating a => a -> a\\nf x = sqrt (abs x) + 5 * x ** 3\\n\\nmain :: IO ()\\nmain = do\\n putStrLn \\\"Enter 11 numbers for evaluation\\\"\\n x <- replicateM 11 readLn\\n mapM_\\n ((\\\\x ->\\n if x > 400\\n then putStrLn \\\"OVERFLOW\\\"\\n else print x) .\\n f) $\\n reverse x\\n\",\n \"language\": \"Haskell\"\n },\n {\n \"code\": \"procedure main()\\n S := []\\n writes(\\\"Enter 11 numbers: \\\")\\n read() ? every !11 do (tab(many(' \\\\t'))|0,put(S, tab(upto(' \\\\t')|0)))\\n every item := !reverse(S) do\\n write(item, \\\" -> \\\", (400 >= f(item)) | \\\"overflows\\\")\\nend\\n\\nprocedure f(x)\\n return abs(x)^0.5 + 5*x^3\\nend\\n\",\n \"language\": \"Icon\"\n },\n {\n \"code\": \"// Initialize objects to be used\\nin_num := File standardInput()\\nnums := List clone\\nresult := Number\\n\\n// Prompt the user and get numbers from standard input\\n\\\"Please enter 11 numbers:\\\" println\\n11 repeat(nums append(in_num readLine() asNumber()))\\n\\n// Reverse the numbers received\\nnums reverseInPlace\\n\\n// Apply the function and tell the user if the result is above\\n// our limit. Otherwise, tell them the result.\\nnums foreach(v,\\n // v needs parentheses around it for abs to properly convert v to its absolute value\\n result = (v) abs ** 0.5 + 5 * v ** 3\\n if (result > 400,\\n \\\"Overflow!\\\" println\\n ,\\n result println\\n )\\n)\\n\",\n \"language\": \"Io\"\n },\n {\n \"code\": \"tpk=: 3 :0\\n smoutput 'Enter 11 numbers: '\\n t1=: ((5 * ^&3) + (^&0.5@* *))\\\"0 |. _999&\\\".;._1 ' ' , 1!:1 [ 1\\n smoutput 'Values of functions of reversed input: ' , \\\": t1\\n ; <@(,&' ')@\\\": ` ((<'user alert ')&[) @. (>&400)\\\"0 t1\\n)\\n\",\n \"language\": \"J\"\n },\n {\n \"code\": \" tpk ''\\nEnter 11 numbers:\\n1 2 3 4 5 6 7 8.8 _9 10.123 0\\nValues of functions of reversed input: 0 5189.96 _3642 3410.33 1717.65 1082.45 627.236 322 136.732 41.4142 6\\n0 user alert _3642 user alert user alert user alert user alert 322 136.732 41.4142 6\\n\",\n \"language\": \"J\"\n },\n {\n \"code\": \"get11numbers=: 3 :0\\n smoutput 'Enter 11 numbers: '\\n _&\\\". 1!:1]1\\n)\\n\\nf_x=: %:@| + 5 * ^&3\\n\\noverflow400=: 'user alert'\\\"_`\\\":@.(<:&400)\\\"0\\n\\ntpk=: overflow400@f_x@|.@get11numbers\\n\",\n \"language\": \"J\"\n },\n {\n \"code\": \" tpk''\\nEnter 11 numbers:\\n1 2 3 4 5 6 7 8.8 _9 10.123 0\\n0\\nuser alert\\n_3642\\nuser alert\\nuser alert\\nuser alert\\nuser alert\\n322\\n136.732\\n41.4142\\n6\\n\",\n \"language\": \"J\"\n },\n {\n \"code\": \"/**\\n * Alexander Alvonellos\\n */\\nimport java.util.*;\\nimport java.io.*;\\n\\npublic class TPKA {\\n\\tpublic static void main(String... args) {\\n\\t\\tdouble[] input = new double[11];\\n\\t\\tdouble userInput = 0.0;\\n\\t\\tScanner in = new Scanner(System.in);\\n\\t\\tfor(int i = 0; i < 11; i++) {\\n\\t\\t\\tSystem.out.print(\\\"Please enter a number: \\\");\\n\\t\\t\\tString s = in.nextLine();\\n\\t\\t\\ttry {\\n\\t\\t\\t\\tuserInput = Double.parseDouble(s);\\n\\t\\t\\t} catch (NumberFormatException e) {\\n\\t\\t\\t\\tSystem.out.println(\\\"You entered invalid input, exiting\\\");\\n\\t\\t\\t\\tSystem.exit(1);\\n\\t\\t\\t}\\n\\t\\t\\tinput[i] = userInput;\\n\\t\\t}\\n\\t\\tfor(int j = 10; j >= 0; j--) {\\n\\t\\t\\tdouble x = input[j]; double y = f(x);\\n\\t\\t\\tif( y < 400.0) {\\n\\t\\t\\t\\tSystem.out.printf(\\\"f( %.2f ) = %.2f\\\\n\\\", x, y);\\n\\t\\t\\t} else {\\n\\t\\t\\t\\tSystem.out.printf(\\\"f( %.2f ) = %s\\\\n\\\", x, \\\"TOO LARGE\\\");\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\n\\tprivate static double f(double x) {\\n\\t\\treturn Math.pow(Math.abs(x), 0.5) + (5*(Math.pow(x, 3)));\\n\\t}\\n}\\n\",\n \"language\": \"Java\"\n },\n {\n \"code\": \"#!/usr/bin/env js\\n\\nfunction main() {\\n var nums = getNumbers(11);\\n nums.reverse();\\n for (var i in nums) {\\n pardoKnuth(nums[i], fn, 400);\\n }\\n}\\n\\nfunction pardoKnuth(n, f, max) {\\n var res = f(n);\\n putstr('f(' + String(n) + ')');\\n if (res > max) {\\n print(' is too large');\\n } else {\\n print(' = ' + String(res));\\n }\\n}\\n\\nfunction fn(x) {\\n return Math.pow(Math.abs(x), 0.5) + 5 * Math.pow(x, 3);\\n}\\n\\nfunction getNumbers(n) {\\n var nums = [];\\n print('Enter', n, 'numbers.');\\n for (var i = 1; i <= n; i++) {\\n putstr(' ' + i + ': ');\\n var num = readline();\\n nums.push(Number(num));\\n }\\n return nums;\\n}\\n\\nmain();\\n\",\n \"language\": \"JavaScript\"\n },\n {\n \"code\": \"def f:\\n def abs: if . < 0 then -. else . end;\\n def power(x): (x * log) | exp;\\n . as $x | abs | power(0.5) + (5 * (.*.*. ));\\n\\n. as $in | split(\\\" \\\") | map(tonumber)\\n| if length == 11 then\\n reverse | map(f | if . > 400 then \\\"TOO LARGE\\\" else . end)\\n else error(\\\"The number of numbers was not 11.\\\")\\n end\\n| .[] # print one result per line\\n\",\n \"language\": \"Jq\"\n },\n {\n \"code\": \"$ echo \\\"Enter 11 numbers on one line; when done, enter the end-of-file character:\\\" ;\\\\\\njq -M -s -R -f Trabb_Pardo-Knuth_algorithm.jq\\n> Enter 11 numbers on one line; when done, enter the end-of-file character:\\n1 2 3 4 5 6 7 8 9 10 11\\n\\\"TOO LARGE\\\"\\n\\\"TOO LARGE\\\"\\n\\\"TOO LARGE\\\"\\n\\\"TOO LARGE\\\"\\n\\\"TOO LARGE\\\"\\n\\\"TOO LARGE\\\"\\n\\\"TOO LARGE\\\"\\n322\\n136.73205080756887\\n41.41421356237309\\n6\\n\",\n \"language\": \"Jq\"\n },\n {\n \"code\": \"f(x) = √abs(x) + 5x^3\\nfor i in reverse(split(readline()))\\n v = f(parse(Int, i))\\n println(\\\"$(i): \\\", v > 400 ? \\\"TOO LARGE\\\" : v)\\nend\\n\",\n \"language\": \"Julia\"\n },\n {\n \"code\": \"// version 1.1.2\\n\\nfun f(x: Double) = Math.sqrt(Math.abs(x)) + 5.0 * x * x * x\\n\\nfun main(args: Array<String>) {\\n val da = DoubleArray(11)\\n println(\\\"Please enter 11 numbers:\\\")\\n var i = 0\\n while (i < 11) {\\n print(\\\" ${\\\"%2d\\\".format(i + 1)}: \\\")\\n val d = readLine()!!.toDoubleOrNull()\\n if (d == null)\\n println(\\\"Not a valid number, try again\\\")\\n else\\n da[i++] = d\\n }\\n println(\\\"\\\\nThe sequence you just entered in reverse is:\\\")\\n da.reverse()\\n println(da.contentToString())\\n println(\\\"\\\\nProcessing this sequence...\\\")\\n for (j in 0..10) {\\n val v = f(da[j])\\n print(\\\" ${\\\"%2d\\\".format(j + 1)}: \\\")\\n if (v > 400.0)\\n println(\\\"Overflow!\\\")\\n else\\n println(v)\\n }\\n}\\n\",\n \"language\": \"Kotlin\"\n },\n {\n \"code\": \"#!/bin/ksh\\n\\n# Trabb Pardo–Knuth algorithm\\n\\n#\\t# Variables:\\n#\\ninteger NUM_ELE=11\\ntypeset -F FUNC_LIMIT=400\\n\\n#\\t# Functions:\\n#\\n#\\t# Function _input(_arr) - Ask for user input, build array\\n#\\nfunction _input {\\n\\ttypeset _arr ; nameref _arr=\\\"$1\\\"\\n\\ttypeset _i ; integer _i\\n\\n\\tclear ; print \\\"Please input 11 numbers...\\\"\\n\\tfor ((_i=1 ; _i<=NUM_ELE ; _i++)); do\\n\\t\\tread REPLY?\\\"${_i}: \\\"\\n\\t\\t[[ $REPLY != {,1}(-)+(\\\\d){,1}(.)*(\\\\d) ]] && ((_i--)) && continue\\n\\t\\t_arr+=( $REPLY )\\n\\tdone\\n}\\n\\n#\\t# Function _function() - Apply |x|^0.5 + 5x^3\\n#\\t#\\tnote: >400 creates an overflow situation\\n#\\nfunction _function {\\n\\ttypeset _x ; _x=$1\\n\\n\\t(( _result = sqrt(abs(${_x})) + 5 * _x * _x * _x ))\\n\\t(( _result <= $FUNC_LIMIT )) && echo ${_result} && return 0\\n\\treturn 1\\n}\\n\\n ######\\n# main #\\n ######\\n\\ntypeset -a inputarr\\n_input inputarr\\ninteger i\\nprintf \\\"%s\\\\n\\\\n\\\" \\\"Evaluating f(x) = |x|^0.5 + 5x^3 for the given inputs :\\\"\\nfor (( i=NUM_ELE-1; i>=0; i-- )); do\\n\\tresult=$(_function ${inputarr[i]})\\n\\tif (( $? )); then\\n\\t\\tprintf \\\"%s\\\\n\\\" \\\"Overflow\\\"\\n\\telse\\n\\t\\tprintf \\\"%s\\\\n\\\" \\\"${result}\\\"\\n\\tfi\\ndone\\n\",\n \"language\": \"Ksh\"\n },\n {\n \"code\": \"' Trabb Pardo-Knuth algorithm\\n' Used \\\"magic numbers\\\" because of strict specification of the algorithm.\\ndim s(10)\\nprint \\\"Enter 11 numbers.\\\"\\nfor i = 0 to 10\\n print i + 1;\\n input \\\" => \\\"; s(i)\\nnext i\\nprint\\n' Reverse\\nfor i = 0 to 10 / 2\\n tmp = s(i)\\n s(i) = s(10 - i)\\n s(10 - i) = tmp\\nnext i\\n'Results\\nfor i = 0 to 10\\n print \\\"f(\\\"; s(i); \\\") = \\\";\\n r = f(s(i))\\n if r > 400 then\\n print \\\"overflow\\\"\\n else\\n print r\\n end if\\nnext i\\nend\\n\\nfunction f(n)\\n f = sqr(abs(n)) + 5 * n * n * n\\nend function\\n\",\n \"language\": \"Liberty-BASIC\"\n },\n {\n \"code\": \"function f (x) return math.abs(x)^0.5 + 5*x^3 end\\n\\nfunction reverse (t)\\n local rev = {}\\n for i, v in ipairs(t) do rev[#t - (i-1)] = v end\\n return rev\\nend\\n\\nlocal sequence, result = {}\\nprint(\\\"Enter 11 numbers...\\\")\\nfor n = 1, 11 do\\n io.write(n .. \\\": \\\")\\n sequence[n] = io.read()\\nend\\nfor _, x in ipairs(reverse(sequence)) do\\n result = f(x)\\n if result > 400 then print(\\\"Overflow!\\\") else print(result) end\\nend\\n\",\n \"language\": \"Lua\"\n },\n {\n \"code\": \"local a, y = {}\\nfunction f (t)\\n return math.sqrt(math.abs(t)) + 5*t^3\\nend\\nfor i = 0, 10 do a[i] = io.read() end\\nfor i = 10, 0, -1 do\\n y = f(a[i])\\n if y > 400 then print(i, \\\"TOO LARGE\\\")\\n else print(i, y) end\\nend\\n\",\n \"language\": \"Lua\"\n },\n {\n \"code\": \"Module Input11 {\\n Flush ' empty stack\\n For I=1 to 11 {\\n Input \\\"Give me a number \\\", a\\n Data a ' add to bottom of stack, use: Push a to add to top, to get reverse order here\\n }\\n}\\nModule Run {\\n Print \\\"Trabb Pardo–Knuth algorithm\\\"\\n Print \\\"f(x)=Sqrt(Abs(x))+5*x^3\\\"\\n if not match(\\\"NNNNNNNNN\\\") then Error \\\"Need 11 numbers\\\"\\n Shiftback 1, -11 ' reverse order 11 elements of stack of values\\n Def f(x)=Sqrt(Abs(x))+5*x^3\\n For i=1 to 11 {\\n Read pop\\n y=f(pop)\\n if y>400 Then {\\n Print format$(\\\"f({0}) = Overflow!\\\", pop)\\n } Else {\\n Print format$(\\\"f({0}) = {1}\\\", pop, y)\\n }\\n }\\n}\\nRun 10, -1, 1, 2, 3, 4, 4.3, 4.305, 4.303, 4.302, 4.301\\nRun 1, 2, 3, -4.55,5.1111, 6, -7, 8, 9, 10, 11\\nInput11\\nRun\\n\",\n \"language\": \"M2000-Interpreter\"\n },\n {\n \"code\": \"Global a$\\nDocument a$ ' make a$ as a document - string with paragraphs\\nModule Run {\\n a$<={Trabb Pardo–Knuth algorithm\\n f(x)=Sqrt(Abs(x))+5*x^3\\n }\\n if not match(\\\"NNNNNNNNN\\\") then Error \\\"Need 11 numbers\\\"\\n Shiftback 1, -11 ' reverse order 11 elements of stack of values\\n Def f(x)=Sqrt(Abs(x))+5*x^3\\n For i=1 to 11 {\\n Read pop\\n y=f(pop)\\n if y>400 Then {\\n a$<=format$(\\\"f({0}) = Overflow!\\\", pop)+{\\n }\\n } Else {\\n a$<=format$(\\\"f({0}) = {1}\\\", pop, y)+{\\n }\\n }\\n }\\n}\\nRun 10, -1, 1, 2, 3, 4, 4.3, 4.305, 4.303, 4.302, 4.301\\nRun 1, 2, 3, -4.55,5.1111, 6, -7, 8, 9, 10, 11\\nClipboard a$\\n\",\n \"language\": \"M2000-Interpreter\"\n },\n {\n \"code\": \"seqn := ListTools:-Reverse([parse(Maplets[Display](Maplets:-Elements:-Maplet(Maplets:-Elements:-InputDialog['ID1'](\\\"Enter a sequence of numbers separated by comma\\\", 'onapprove' = Maplets:-Elements:-Shutdown(['ID1']), 'oncancel' = Maplets:-Elements:-Shutdown())))[1])]):\\nf:= x -> abs(x)^0.5 + 5*x^3:\\nfor item in seqn do\\n\\tresult := f(item):\\n\\tif (result > 400) then\\n\\t\\tprint(\\\"Alert: Overflow.\\\"):\\n\\telse\\n\\t\\tprint(result):\\n\\tend if:\\nend do:\\n\",\n \"language\": \"Maple\"\n },\n {\n \"code\": \"numbers=RandomReal[{-2,6},11]\\ntpk[numbers_,overflowVal_]:=Module[{revNumbers},\\n revNumbers=Reverse[numbers];\\n f[x_]:=Abs[x]^0.5+5 x^3;\\n Do[\\n If[f[i]>overflowVal,\\n Print[\\\"f[\\\",i,\\\"]= Overflow\\\"]\\n ,\\n Print[\\\"f[\\\",i,\\\"]= \\\",f[i]]\\n ]\\n ,\\n {i,revNumbers}\\n ]\\n]\\ntpk[numbers,400]\\n\",\n \"language\": \"Mathematica\"\n },\n {\n \"code\": \"clear all;close all;clc;\\n\\n% Define the function f(x)\\nf = @(x) sqrt(abs(x)) + 5 * x^3;\\n\\n% Read a line of input, split it into elements, convert to numbers\\ninputLine = input('', 's');\\nnumbers = str2double(strsplit(inputLine));\\n\\n% Process each number in reverse order\\nfor i = length(numbers):-1:1\\n value = f(numbers(i));\\n if value > 400\\n fprintf('%g: TOO LARGE\\\\n', numbers(i));\\n else\\n fprintf('%g: %g\\\\n', numbers(i), value);\\n end\\nend\\n\",\n \"language\": \"MATLAB\"\n },\n {\n \"code\": \"((0 <) (-1 *) when) :abs\\n(((abs 0.5 pow) (3 pow 5 * +)) cleave) :fn\\n\\\"Enter 11 numbers:\\\" puts!\\n(gets float) 11 times\\n(fn (400 <=) (pop \\\"Overflow\\\") unless puts!) 11 times\\n\",\n \"language\": \"Min\"\n },\n {\n \"code\": \"10 REM Trabb Pardo-Knuth algorithm\\n20 REM Used \\\"magic numbers\\\" because of strict specification\\n30 REM of the algorithm.\\n40 DEF FNF(N) = SQR(ABS(N))+5*N*N*N\\n50 DIM S(10)\\n60 PRINT \\\"Enter 11 numbers.\\\"\\n70 FOR I = 0 TO 10\\n80 PRINT I+1; \\\"- Enter number\\\";\\n90 INPUT S(I)\\n100 NEXT I\\n110 PRINT\\n120 REM Reverse\\n130 FOR I = 0 TO 10/2\\n140 LET T = S(I)\\n150 LET S(I) = S(10-I)\\n160 LET S(10-I) = T\\n170 NEXT I\\n180 REM Results\\n190 PRINT \\\"num\\\", \\\"f(num)\\\"\\n200 FOR I = 0 TO 10\\n210 LET R = FNF(S(I))\\n220 IF R>400 THEN 250\\n230 PRINT S(I), R\\n240 GOTO 260\\n250 PRINT S(I), \\\" overflow\\\"\\n260 NEXT I\\n270 END\\n\",\n \"language\": \"Minimal-BASIC\"\n },\n {\n \"code\": \"MODULE TrabbPardoKnuth;\\n\\nFROM STextIO IMPORT\\n SkipLine, WriteString, WriteLn;\\nFROM SRealIO IMPORT\\n ReadReal, WriteFixed;\\nFROM SWholeIO IMPORT\\n WriteInt;\\nFROM RealMath IMPORT\\n sqrt;\\n\\nCONST\\n Size = 11;\\n\\nTYPE\\n TSequence = ARRAY [1 .. Size] OF REAL;\\n\\nVAR\\n S: TSequence;\\n I: CARDINAL;\\n Result: REAL;\\n\\nPROCEDURE ReverseSequence(VAR S: TSequence);\\nVAR\\n I: CARDINAL;\\n Temp: REAL;\\nBEGIN\\n FOR I := 1 TO Size DIV 2 DO\\n Temp := S[I];\\n S[I] := S[Size - I + 1];\\n S[Size - I + 1] := Temp;\\n END;\\nEND ReverseSequence;\\n\\nPROCEDURE DoOperation(Item: REAL): REAL;\\nBEGIN\\n RETURN sqrt(ABS(Item)) + 5.0 * Item * Item * Item;\\nEND DoOperation;\\n\\nBEGIN\\n WriteString(\\\"Enter 11 numbers.\\\");\\n WriteLn;\\n FOR I := 1 TO Size DO\\n WriteInt(I, 2);\\n WriteString(\\\": \\\");\\n ReadReal(S[I]);\\n SkipLine\\n END;\\n ReverseSequence(S);\\n WriteLn;\\n FOR I := 1 TO Size DO\\n Result := DoOperation(S[I]);\\n WriteString(\\\"f(\\\");\\n WriteFixed(S[I], 3, 8);\\n WriteString(\\\") = \\\");\\n IF Result > 400.0 THEN\\n WriteString(\\\"overflow\\\");\\n ELSE\\n WriteFixed(Result, 3, 8)\\n END;\\n WriteLn;\\n END;\\nEND TrabbPardoKnuth.\\n\",\n \"language\": \"Modula-2\"\n },\n {\n \"code\": \"10 REM Trabb Pardo-Knuth algorithm\\n20 REM Used \\\"magic numbers\\\" because of strict\\n30 REM specification of the algorithm.\\n40 DEF FNF(N)=SQR(ABS(N))+5*N*N*N\\n50 DIM S(10)\\n60 PRINT \\\"Enter 11 numbers.\\\"\\n70 FOR I=0 TO 10\\n80 PRINT STR$(I+1);\\n90 INPUT S(I)\\n100 NEXT I\\n110 PRINT\\n120 REM ** Reverse\\n130 FOR I=0 TO 10/2\\n140 TMP=S(I)\\n150 S(I)=S(10-I)\\n160 S(10-I)=TMP\\n170 NEXT I\\n180 REM ** Results\\n190 FOR I=0 TO 10\\n200 PRINT \\\"f(\\\";STR$(S(I));\\\") =\\\";\\n210 R=FNF(S(I))\\n220 IF R>400 THEN PRINT \\\" overflow\\\":GOTO 240\\n230 PRINT R\\n240 NEXT I\\n250 END\\n\",\n \"language\": \"Nascom-BASIC\"\n },\n {\n \"code\": \"import math, rdstdin, strutils, algorithm, sequtils\\n\\nproc f(x: float): float = x.abs.pow(0.5) + 5 * x.pow(3)\\n\\nproc ask: seq[float] =\\n readLineFromStdin(\\\"11 numbers: \\\").strip.split[0..10].map(parseFloat)\\n\\nvar s = ask()\\nreverse s\\nfor x in s:\\n let result = f(x)\\n echo x, \\\": \\\", if result > 400: \\\"TOO LARGE!\\\" else: $result\\n\",\n \"language\": \"Nim\"\n },\n {\n \"code\": \"//\\n// TPKA.m\\n// RosettaCode\\n//\\n// Created by Alexander Alvonellos on 5/26/12.\\n// Trabb Pardo-Knuth algorithm\\n//\\n\\n#import <Foundation/Foundation.h>\\ndouble f(double x);\\n\\ndouble f(double x) {\\n return pow(abs(x), 0.5) + 5*(pow(x, 3));\\n}\\n\\nint main (int argc, const char * argv[])\\n{\\n @autoreleasepool {\\n NSMutableArray *input = [[NSMutableArray alloc] initWithCapacity:0];\\n\\n printf(\\\"%s\\\", \\\"Instructions: please enter 11 numbers.\\\\n\\\");\\n for(int i = 0; i < 11; i++) {\\n double userInput = 0.0;\\n printf(\\\"%s\\\", \\\"Please enter a number: \\\");\\n scanf(\\\"%lf\\\", &userInput);\\n [input addObject: @(userInput)];\\n }\\n\\n for(int i = 10; i >= 0; i--) {\\n double x = [input[i] doubleValue];\\n double y = f(x);\\n printf(\\\"f(%.2f) \\\\t=\\\\t\\\", x);\\n if(y < 400.0) {\\n printf(\\\"%.2f\\\\n\\\", y);\\n } else {\\n printf(\\\"%s\\\\n\\\", \\\"TOO LARGE\\\");\\n }\\n }\\n }\\n return 0;\\n}\\n\",\n \"language\": \"Objective-C\"\n },\n {\n \"code\": \"let f x = sqrt x +. 5.0 *. (x ** 3.0)\\nlet p x = x < 400.0\\n\\nlet () =\\n print_endline \\\"Please enter 11 Numbers:\\\";\\n let lst = Array.to_list (Array.init 11 (fun _ -> read_float ())) in\\n List.iter (fun x ->\\n let res = f x in\\n if p res\\n then Printf.printf \\\"f(%g) = %g\\\\n%!\\\" x res\\n else Printf.eprintf \\\"f(%g) :: Overflow\\\\n%!\\\" x\\n ) (List.rev lst)\\n\",\n \"language\": \"OCaml\"\n },\n {\n \"code\": \"{\\n print(\\\"11 numbers: \\\");\\n v=vector(11, n, eval(input()));\\n v=apply(x->x=sqrt(abs(x))+5*x^3;if(x>400,\\\"overflow\\\",x), v);\\n vector(11, i, v[12-i])\\n}\\n\",\n \"language\": \"PARI-GP\"\n },\n {\n \"code\": \"print \\\"Enter 11 numbers:\\\\n\\\";\\nfor ( 1..11 ) {\\n $number = <STDIN>;\\n chomp $number;\\n push @sequence, $number;\\n}\\n\\nfor $n (reverse @sequence) {\\n my $result = sqrt( abs($n) ) + 5 * $n**3;\\n printf \\\"f( %6.2f ) %s\\\\n\\\", $n, $result > 400 ? \\\" too large!\\\" : sprintf \\\"= %6.2f\\\", $result\\n}\\n\",\n \"language\": \"Perl\"\n },\n {\n \"code\": \"(phixonline)-->\\n <span style=\\\"color: #008080;\\\">function</span> <span style=\\\"color: #000000;\\\">f</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #004080;\\\">atom</span> <span style=\\\"color: #000000;\\\">x</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: #7060A8;\\\">abs</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">x</span><span style=\\\"color: #0000FF;\\\">))+</span><span style=\\\"color: #000000;\\\">5</span><span style=\\\"color: #0000FF;\\\">*</span><span style=\\\"color: #7060A8;\\\">power</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">x</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">3</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;\\\">procedure</span> <span style=\\\"color: #000000;\\\">test</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;\\\">bool</span> <span style=\\\"color: #000000;\\\">fake_prompt</span><span style=\\\"color: #0000FF;\\\">=</span><span style=\\\"color: #004600;\\\">true</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #008080;\\\">if</span> <span style=\\\"color: #000000;\\\">fake_prompt</span> <span style=\\\"color: #008080;\\\">then</span> <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;\\\">\\\"Enter 11 numbers:%s\\\\n\\\"</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;\\\">if</span>\\n <span style=\\\"color: #000000;\\\">s</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">substitute</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">s</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: #004080;\\\">sequence</span> <span style=\\\"color: #000000;\\\">S</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">scanf</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">s</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #008000;\\\">\\\"%f %f %f %f %f %f %f %f %f %f %f\\\"</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;\\\">S</span><span style=\\\"color: #0000FF;\\\">)!=</span><span style=\\\"color: #000000;\\\">1</span> <span style=\\\"color: #008080;\\\">then</span> <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;\\\">\\\"not 11 numbers\\\"</span><span style=\\\"color: #0000FF;\\\">)</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: #000000;\\\">S</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">reverse</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>\\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;\\\">atom</span> <span style=\\\"color: #000000;\\\">result</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">f</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;\\\">result</span><span style=\\\"color: #0000FF;\\\">></span><span style=\\\"color: #000000;\\\">400</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;\\\">\\\"f(%g):overflow\\\\n\\\"</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;\\\">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;\\\">\\\"f(%g):%g\\\\n\\\"</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;\\\">result</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: #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;\\\">procedure</span>\\n\\n <span style=\\\"color: #000080;font-style:italic;\\\">--test(prompt_string(\\\"Enter 11 numbers:\\\"),false)</span>\\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;\\\">\\\"10 -1 1 2 3 4 4.3 4.305 4.303 4.302 4.301\\\"</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #008000;\\\">\\\"1,2,3,4,5,6,7,8,9,10,11\\\"</span><span style=\\\"color: #0000FF;\\\">,</span>\\n <span style=\\\"color: #008000;\\\">\\\"0.470145,1.18367,2.36984,4.86759,2.40274,5.48793,3.30256,5.34393,4.21944,2.23501,-0.0200707\\\"</span><span style=\\\"color: #0000FF;\\\">}</span>\\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;\\\">test</span><span style=\\\"color: #0000FF;\\\">)</span>\\n<!--\\n\",\n \"language\": \"Phix\"\n },\n {\n \"code\": \"<?php\\n// Trabb Pardo-Knuth algorithm\\n// Used \\\"magic numbers\\\" because of strict specification of the algorithm.\\n\\nfunction f($n)\\n{\\n return sqrt(abs($n)) + 5 * $n * $n * $n;\\n}\\n\\n$sArray = [];\\necho \\\"Enter 11 numbers.\\\\n\\\";\\nfor ($i = 0; $i <= 10; $i++) {\\n echo $i + 1, \\\" - Enter number: \\\";\\n array_push($sArray, (float)fgets(STDIN));\\n}\\necho PHP_EOL;\\n// Reverse\\n$sArray = array_reverse($sArray);\\n// Results\\nforeach ($sArray as $s) {\\n $r = f($s);\\n echo \\\"f(\\\", $s, \\\") = \\\";\\n if ($r > 400)\\n echo \\\"overflow\\\\n\\\";\\n else\\n echo $r, PHP_EOL;\\n}\\n?>\\n\",\n \"language\": \"PHP\"\n },\n {\n \"code\": \"import util.\\n\\ngo =>\\n L = [I.parse_term() : I in split(read_line())],\\n S = [[I,cond(F<=400,F,'TOO LARGE')] : I in L.len..-1..1, F=f(L[I])],\\n println(S),\\n nl.\\n\\nf(T) = sqrt(abs(T)) + 5*T**3.\\n\",\n \"language\": \"Picat\"\n },\n {\n \"code\": \"(de f (X)\\n (+ (sqrt (abs X)) (* 5 X X X)) )\\n\\n(trace 'f)\\n\\n(in NIL\\n (prin \\\"Input 11 numbers: \\\")\\n (for X (reverse (make (do 11 (link (read)))))\\n (when (> (f X) 400)\\n (prinl \\\"TOO LARGE\\\") ) ) )\\n\",\n \"language\": \"PicoLisp\"\n },\n {\n \"code\": \"Input 11 numbers: 1 2 3 4 5 6 7 8 9 10 11\\n f : 11\\n f = 6658\\nTOO LARGE\\n f : 10\\n f = 5003\\nTOO LARGE\\n f : 9\\n f = 3648\\nTOO LARGE\\n f : 8\\n f = 2562\\nTOO LARGE\\n f : 7\\n f = 1717\\nTOO LARGE\\n f : 6\\n f = 1082\\nTOO LARGE\\n f : 5\\n f = 627\\nTOO LARGE\\n f : 4\\n f = 322\\n f : 3\\n f = 136\\n f : 2\\n f = 41\\n f : 1\\n f = 6\\n\",\n \"language\": \"PicoLisp\"\n },\n {\n \"code\": \"Trabb: Procedure options (main); /* 11 November 2013 */\\n\\n declare (i, n) fixed binary;\\n declare s fixed (5,1) controlled;\\n declare g fixed (15,5);\\n\\n put ('Please type 11 values:');\\n do i = 1 to 11;\\n allocate s;\\n get (s);\\n put (s);\\n end;\\n put skip(2) ('Results:');\\n do i = 1 to 11;\\n g = f(s); put skip list (s);\\n if g > 400 then put ('Too large'); else put (g);\\n free s;\\n end;\\n\\nf: procedure (x) returns (fixed(15,5));\\n declare x fixed (5,1);\\n return (sqrt(abs(x)) + 5*x**3);\\nend f;\\n\\nend Trabb;\\n\",\n \"language\": \"PL-I\"\n },\n {\n \"code\": \"TPK: DO;\\n /* external I/O and real mathematical routines */\\n WRITE$STRING: PROCEDURE( S ) EXTERNAL; DECLARE S POINTER; END;\\n WRITE$REAL: PROCEDURE( R ) EXTERNAL; DECLARE R REAL; END;\\n WRITE$NL: PROCEDURE EXTERNAL; END;\\n READ$REAL: PROCEDURE( R ) REAL EXTERNAL; DECLARE R POINTER; END;\\n REAL$ABS: PROCEDURE( R ) REAL EXTERNAL; DECLARE R REAL; END;\\n REAL$SQRT: PROCEDURE( R ) REAL EXTERNAL; DECLARE R REAL; END;\\n /* end external routines */\\n\\n F: PROCEDURE( T ) REAL;\\n DECLARE T REAL;\\n RETURN REAL$SQRT(REAL$ABS(T))+5*T*T*T;\\n END F;\\n MAIN: PROCEDURE;\\n DECLARE Y REAL, A( 11 ) REAL, I INTEGER;\\n DO I = 0 TO 10;\\n CALL READ$REAL( @A( I ) );\\n END;\\n DO I = 10 TO 0 BY -1;\\n Y = F( A( I ) );\\n IF Y > 400.0 THEN CALL WRITE$STRING( @( 'TOO LARGE', 0 ) );\\n ELSE CALL WRITE$REAL( Y );\\n CALL WRITE$NL();\\n END;\\n END MAIN;\\n\\nEND TPK;\\n\",\n \"language\": \"PL-M\"\n },\n {\n \"code\": \"function Get-Tpk\\n{\\n [CmdletBinding()]\\n [OutputType([PSCustomObject])]\\n Param\\n (\\n [Parameter(Mandatory=$true,\\n ValueFromPipeline=$true,\\n ValueFromPipelineByPropertyName=$true,\\n Position=0)]\\n [double]\\n $Number\\n )\\n\\n Begin\\n {\\n function Get-TpkFunction ([double]$Number)\\n {\\n [Math]::Pow([Math]::Abs($Number),(0.5)) + 5 * [Math]::Pow($Number,3)\\n }\\n\\n [object[]]$output = @()\\n }\\n Process\\n {\\n $Number | ForEach-Object {\\n $n = Get-TpkFunction $_\\n\\n if ($n -le 400)\\n {\\n $result = $n\\n }\\n else\\n {\\n $result = \\\"Overflow\\\"\\n }\\n }\\n\\n $output += [PSCustomObject]@{\\n Number = $Number\\n Result = $result\\n }\\n }\\n End\\n {\\n [Array]::Reverse($output)\\n $output\\n }\\n}\\n\",\n \"language\": \"PowerShell\"\n },\n {\n \"code\": \"$tpk = 1..11 | Get-Tpk\\n$tpk\\n\",\n \"language\": \"PowerShell\"\n },\n {\n \"code\": \"$tpk | where result -ne overflow | sort number\\n\",\n \"language\": \"PowerShell\"\n },\n {\n \"code\": \"Procedure.d f(x.d)\\n ProcedureReturn Pow(Abs(x), 0.5) + 5 * x * x * x\\nEndProcedure\\n\\nProcedure split(i.s, delimeter.s, List o.d())\\n Protected index = CountString(i, delimeter) + 1 ;add 1 because last entry will not have a delimeter\\n\\n While index > 0\\n AddElement(o())\\n o() = ValD(Trim(StringField(i, index, delimeter)))\\n index - 1\\n Wend\\n\\n ProcedureReturn ListSize(o())\\nEndProcedure\\n\\nDefine i$, entriesAreValid = 0, result.d, output$\\nNewList numbers.d()\\n\\nIf OpenConsole()\\n Repeat\\n PrintN(#crlf$ + \\\"Enter eleven numbers that are each separated by spaces or commas:\\\")\\n\\n i$ = Input(\\n i$ = Trim(i$)\\n If split(i$, \\\",\\\", numbers.d()) < 11\\n ClearList(numbers())\\n If split(i$, \\\" \\\", numbers.d()) < 11\\n PrintN(\\\"Not enough numbers were supplied.\\\")\\n ClearList(numbers())\\n Else\\n entriesAreValid = 1\\n EndIf\\n Else\\n entriesAreValid = 1\\n EndIf\\n Until entriesAreValid = 1\\n\\n ForEach numbers()\\n output$ = \\\"f(\\\" + RTrim(RTrim(StrD(numbers(), 3), \\\"0\\\"), \\\".\\\") + \\\") = \\\"\\n result.d = f(numbers())\\n If result > 400\\n output$ + \\\"Too Large\\\"\\n Else\\n output$ + RTrim(RTrim(StrD(result, 3), \\\"0\\\"), \\\".\\\")\\n EndIf\\n PrintN(output$)\\n Next\\n\\n Print(#crlf$ + #crlf$ + \\\"Press ENTER to exit\\\"): Input()\\n CloseConsole()\\nEndIf\\n\",\n \"language\": \"PureBasic\"\n },\n {\n \"code\": \"Python 3.2.2 (default, Sep 4 2011, 09:51:08) [MSC v.1500 32 bit (Intel)] on win32\\nType \\\"copyright\\\", \\\"credits\\\" or \\\"license()\\\" for more information.\\n>>> def f(x): return abs(x) ** 0.5 + 5 * x**3\\n\\n>>> print(', '.join('%s:%s' % (x, v if v<=400 else \\\"TOO LARGE!\\\")\\n\\t for x,v in ((y, f(float(y))) for y in input('\\\\nnumbers: ').strip().split()[:11][::-1])))\\n\\n11 numbers: 1 2 3 4 5 6 7 8 9 10 11\\n11:TOO LARGE!, 10:TOO LARGE!, 9:TOO LARGE!, 8:TOO LARGE!, 7:TOO LARGE!, 6:TOO LARGE!, 5:TOO LARGE!, 4:322.0, 3:136.73205080756887, 2:41.41421356237309, 1:6.0\\n>>>\\n\",\n \"language\": \"Python\"\n },\n {\n \"code\": \"import math\\n\\ndef f(x):\\n return math.sqrt(abs(x)) + 5 * x**3\\n\\ndef ask_numbers(n=11):\\n print(f'Enter {n} numbers:')\\n return (float(input('>')) for _ in range(n))\\n\\nif __name__ == '__main__':\\n for x in ask_numbers().reverse():\\n if (result := f(x)) > 400:\\n print(f'f({x}): overflow')\\n else:\\n print(f'f({x}) = {result}')\\n\",\n \"language\": \"Python\"\n },\n {\n \"code\": \"FUNCTION f (n!)\\n f = SQR(ABS(n)) + 5 * n ^ 3\\nEND FUNCTION\\n\\nDIM s(1 TO 11)\\nPRINT \\\"enter 11 numbers\\\"\\nFOR i = 1 TO 11\\n PRINT STR$(i);\\n INPUT \\\" => \\\", s(i)\\nNEXT i\\n\\nPRINT : PRINT STRING$(20, \\\"-\\\")\\n\\ni = i - 1\\nDO\\n PRINT \\\"f(\\\"; STR$(s(i)); \\\") = \\\";\\n x = f(s(i))\\n IF x > 400 THEN\\n PRINT \\\"-=< overflow >=-\\\"\\n ELSE\\n PRINT x\\n END IF\\n i = i - 1\\nLOOP UNTIL i < 1\\nEND\\n\",\n \"language\": \"QBasic\"\n },\n {\n \"code\": \" [ $ \\\"bigrat.qky\\\" loadfile ] now!\\n\\n [ $->v drop\\n 2dup vabs 10 vsqrt drop\\n 2swap 2dup 2dup\\n v* v* 5 n->v v* v+ ] is function ( $ --> n/d )\\n\\n [ $ \\\"Please enter 11 numbers: \\\"\\n input nest$\\n reverse\\n witheach\\n [ function\\n 400 n->v 2over v< iff\\n [ 2drop say \\\"overflow\\\" ]\\n else\\n [ 7 point$ echo$ ]\\n sp ]\\n cr ] is task ( --> )\\n\",\n \"language\": \"Quackery\"\n },\n {\n \"code\": \"S <- scan(n=11)\\n\\nf <- function(x) sqrt(abs(x)) + 5*x^3\\n\\nfor (i in rev(S)) {\\n res <- f(i)\\n if (res > 400)\\n print(\\\"Too large!\\\")\\n else\\n print(res)\\n}\\n\",\n \"language\": \"R\"\n },\n {\n \"code\": \"#lang racket\\n\\n(define input\\n (for/list ([i 11])\\n (printf \\\"Enter a number (~a of 11): \\\" (+ 1 i))\\n (read)))\\n\\n(for ([x (reverse input)])\\n (define res (+ (sqrt (abs x)) (* 5 (expt x 3))))\\n (if (> res 400)\\n (displayln \\\"Overflow!\\\")\\n (printf \\\"f(~a) = ~a\\\\n\\\" x res)))\\n\",\n \"language\": \"Racket\"\n },\n {\n \"code\": \"my @nums = prompt(\\\"Please type 11 space-separated numbers: \\\").words\\n until @nums == 11;\\nfor @nums.reverse -> $n {\\n my $r = $n.abs.sqrt + 5 * $n ** 3;\\n say \\\"$n\\\\t{ $r > 400 ?? 'Urk!' !! $r }\\\";\\n}\\n\",\n \"language\": \"Raku\"\n },\n {\n \"code\": \"/*REXX program implements the Trabb─Pardo-Knuth algorithm for N numbers (default is 11).*/\\nnumeric digits 200 /*the number of digits precision to use*/\\nparse arg N .; if N=='' | N==\\\",\\\" then N=11 /*Not specified? Then use the default.*/\\nmaxValue= 400 /*the maximum value f(x) can have. */\\n wid= 20 /* ··· but only show this many digits.*/\\n frac= 5 /* ··· show this # of fractional digs.*/\\nsay ' _____' /* ◄─── this SAY displays a vinculum.*/\\nsay 'function: ƒ(x) ≡ √ │x│ + (5 * x^3)'\\nprompt= 'enter ' N \\\" numbers for the Trabb─Pardo─Knuth algorithm: (or Quit)\\\"\\n\\n do ask=0; say; /*░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░*/\\n say prompt; say; pull $; say /*░*/\\n if abbrev('QUIT',$,1) then do; say 'quitting.'; exit 1; end /*░*/\\n ok=0 /*░*/\\n select /*validate there're N numbers.*/ /*░*/\\n when $='' then say \\\"no numbers entered\\\" /*░*/\\n when words($)<N then say \\\"not enough numbers entered\\\" /*░*/\\n when words($)>N then say \\\"too many numbers entered\\\" /*░*/\\n otherwise ok=1 /*░*/\\n end /*select*/ /*░*/\\n if \\\\ok then iterate /* [↓] W=max width. */ /*░*/\\n w=0; do v=1 for N; _=word($, v); w=max(w, length(_) ) /*░*/\\n if datatype(_, 'N') then iterate /*numeric ?*/ /*░*/\\n say _ \\\"isn't numeric\\\"; iterate ask /*░*/\\n end /*v*/ /*░*/\\n leave /*░*/\\n end /*ask*/ /*░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░*/\\n\\nsay 'numbers entered: ' $\\nsay\\n do i=N by -1 for N; #=word($, i) / 1 /*process the numbers in reverse. */\\n g = fmt( f( # ) ) /*invoke function ƒ with arg number.*/\\n gw=right( 'ƒ('#\\\") \\\", w+7) /*nicely formatted ƒ(number). */\\n if g>maxValue then say gw \\\"is > \\\" maxValue ' ['space(g)\\\"]\\\"\\n else say gw \\\" = \\\" g\\n end /*i*/ /* [↑] display the result to terminal.*/\\nexit /*stick a fork in it, we're all done. */\\n/*──────────────────────────────────────────────────────────────────────────────────────*/\\nf: procedure; parse arg x; return sqrt( abs(x) ) + 5 * x**3\\n/*──────────────────────────────────────────────────────────────────────────────────────*/\\nfmt: z=right(translate(format(arg(1), wid, frac), 'e', \\\"E\\\"), wid) /*right adjust; use e*/\\n if pos(.,z)\\\\==0 then z=left(strip(strip(z,'T',0),\\\"T\\\",.),wid) /*strip trailing 0 &.*/\\n return right(z, wid - 4*(pos('e', z)==0) ) /*adjust: no exponent*/\\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\": \"# Project : Trabb Pardo–Knuth algorithm\\n\\ndecimals(3)\\nx = list(11)\\nfor n=1 to 11\\n x[n] = n\\nnext\\n\\ns = [-5, -3, -2, -1, 0, 1, 2, 3, 4, 5, 6]\\nfor i = 1 to 11\\n see string(i) + \\\" => \\\" + s[i] + nl\\nnext\\nsee copy(\\\"-\\\", 20) + nl\\ni = i - 1\\n\\nwhile i > 0\\n see \\\"f(\\\" + string(s[i]) + \\\") = \\\"\\n x = f(s[i])\\n if x > 400\\n see \\\"-=< overflow >=-\\\" + nl\\n else\\n see x + nl\\n ok\\n i = i - 1\\nend\\n\\nfunc f(n)\\n return sqrt(fabs(n)) + 5 * pow(n, 3)\\n\",\n \"language\": \"Ring\"\n },\n {\n \"code\": \"def f(x) x.abs ** 0.5 + 5 * x ** 3 end\\n\\nputs \\\"Please enter 11 numbers:\\\"\\nnums = 11.times.map{ gets.to_f }\\n\\nnums.reverse_each do |n|\\n print \\\"f(#{n}) = \\\"\\n res = f(n)\\n puts res > 400 ? \\\"Overflow!\\\" : res\\nend\\n\",\n \"language\": \"Ruby\"\n },\n {\n \"code\": \"dim s(10)\\nprint \\\"Enter 11 numbers.\\\"\\nfor i = 0 to 10\\n print i +1;\\n input \\\" => \\\"; s(i)\\nnext i\\nprint\\n'Results\\nfor i = 10 to 0 step -1\\n print \\\"f(\\\"; s(i); \\\") = \\\";\\n r = f(s(i))\\n if r > 400 then\\n print \\\"-=< overflow >=-\\\"\\n else\\n print r\\n end if\\nnext i\\nend\\n\\nfunction f(n)\\n f = sqr(abs(n)) + 5 * n * n * n\\nend function\\n\",\n \"language\": \"Run-BASIC\"\n },\n {\n \"code\": \"use std::io::{self, BufRead};\\n\\nfn op(x: f32) -> Option<f32> {\\n let y = x.abs().sqrt() + 5.0 * x * x * x;\\n if y < 400.0 {\\n Some(y)\\n } else {\\n None\\n }\\n}\\n\\nfn main() {\\n println!(\\\"Please enter 11 numbers (one number per line)\\\");\\n let stdin = io::stdin();\\n\\n let xs = stdin\\n .lock()\\n .lines()\\n .map(|ox| ox.unwrap().trim().to_string())\\n .flat_map(|s| str::parse::<f32>(&s))\\n .take(11)\\n .collect::<Vec<_>>();\\n\\n for x in xs.into_iter().rev() {\\n match op(x) {\\n Some(y) => println!(\\\"{}\\\", y),\\n None => println!(\\\"overflow\\\"),\\n };\\n }\\n}\\n\",\n \"language\": \"Rust\"\n },\n {\n \"code\": \"object TPKa extends App {\\n final val numbers = scala.collection.mutable.MutableList[Double]()\\n final val in = new java.util.Scanner(System.in)\\n while (numbers.length < CAPACITY) {\\n print(\\\"enter a number: \\\")\\n try {\\n numbers += in.nextDouble()\\n }\\n catch {\\n case _: Exception =>\\n in.next()\\n println(\\\"invalid input, try again\\\")\\n }\\n }\\n\\n numbers reverseMap { x =>\\n val fx = Math.pow(Math.abs(x), .5D) + 5D * (Math.pow(x, 3))\\n if (fx < THRESHOLD)\\n print(\\\"%8.3f -> %8.3f\\\\n\\\".format(x, fx))\\n else\\n print(\\\"%8.3f -> %s\\\\n\\\".format(x, Double.PositiveInfinity.toString))\\n }\\n\\n private final val THRESHOLD = 400D\\n private final val CAPACITY = 11\\n}\\n\",\n \"language\": \"Scala\"\n },\n {\n \"code\": \"var nums; do {\\n nums = Sys.readln(\\\"Please type 11 space-separated numbers: \\\").nums\\n} while(nums.len != 11)\\n\\nnums.reverse.each { |n|\\n var r = (n.abs.sqrt + (5 * n**3));\\n say \\\"#{n}\\\\t#{ r > 400 ? 'Urk!' : r }\\\";\\n}\\n\",\n \"language\": \"Sidef\"\n },\n {\n \"code\": \" 10 DIM A(11)\\n 20 PRINT \\\"ENTER ELEVEN NUMBERS:\\\"\\n 30 FOR I=1 TO 11\\n 40 INPUT A(I)\\n 50 NEXT I\\n 60 FOR I=11 TO 1 STEP -1\\n 70 LET Y=SQR ABS A(I)+5*A(I)**3\\n 80 IF Y<=400 THEN GOTO 110\\n 90 PRINT A(I),\\\"TOO LARGE\\\"\\n100 GOTO 120\\n110 PRINT A(I),Y\\n120 NEXT I\\n\",\n \"language\": \"Sinclair-ZX81-BASIC\"\n },\n {\n \"code\": \"import Foundation\\n\\nprint(\\\"Enter 11 numbers for the Trabb─Pardo─Knuth algorithm:\\\")\\n\\nlet f: (Double) -> Double = { sqrt(fabs($0)) + 5 * pow($0, 3) }\\n\\n(1...11)\\n .generate()\\n .map { i -> Double in\\n print(\\\"\\\\(i): \\\", terminator: \\\"\\\")\\n guard let s = readLine(), let n = Double(s) else { return 0 }\\n return n\\n }\\n .reverse()\\n .forEach {\\n let result = f($0)\\n print(\\\"f(\\\\($0))\\\", result > 400.0 ? \\\"OVERFLOW\\\" : result, separator: \\\"\\\\t\\\")\\n }\\n\",\n \"language\": \"Swift\"\n },\n {\n \"code\": \"|Trabb Pardo–Knuth algorithm\\n\\na : 11 0\\n\\n i\\n if i LE 10\\n [] $s\\n ~ $s w\\n w a.i\\n + i\\n goif\\n endif\\n 10 i\\n if i GE 0\\n call f\\n if x GT 400\\n 'too large' $s\\n else\\n ~ x $s\\n endif\\n ~ i $r\\n + ' ' $r\\n + $r $s.1\\n $s []\\n - i\\n goif\\n endif\\n stop\\n\\nf a.i t\\n * t t x\\n * x t x\\n * 5 x\\n abs t\\n sqrt t y\\n + y x\\n return\\n\",\n \"language\": \"Symsyn\"\n },\n {\n \"code\": \"# Helper procedures\\nproc f {x} {expr {abs($x)**0.5 + 5*$x**3}}\\nproc overflow {y} {expr {$y > 400}}\\n\\n# Read in 11 numbers, with nice prompting\\nfconfigure stdout -buffering none\\nfor {set n 1} {$n <= 11} {incr n} {\\n puts -nonewline \\\"number ${n}: \\\"\\n lappend S [scan [gets stdin] \\\"%f\\\"]\\n}\\n\\n# Process and print results in reverse order\\nforeach x [lreverse $S] {\\n set result [f $x]\\n if {[overflow $result]} {\\n\\tputs \\\"${x}: TOO LARGE!\\\"\\n } else {\\n\\tputs \\\"${x}: $result\\\"\\n }\\n}\\n\",\n \"language\": \"Tcl\"\n },\n {\n \"code\": \"FUNCTION f (n)\\n LET f = SQR(ABS(n)) + 5 * n ^ 3\\nEND FUNCTION\\n\\nDIM s(1 TO 11)\\nPRINT \\\"enter 11 numbers\\\"\\nFOR i = 1 TO 11\\n PRINT STR$(i); \\\" => \\\";\\n INPUT s(i)\\nNEXT i\\n\\nPRINT\\nPRINT \\\"--------------------\\\"\\n\\nLET i = i - 1\\nDO\\n PRINT \\\"f(\\\"; STR$(s(i)); \\\") = \\\";\\n LET x = f(s(i))\\n IF x > 400 THEN\\n PRINT \\\"-=< overflow >=-\\\"\\n ELSE\\n PRINT x\\n END IF\\n LET i = i - 1\\nLOOP UNTIL i < 1\\nEND\\n\",\n \"language\": \"True-BASIC\"\n },\n {\n \"code\": \"Function tpk(s)\\n\\tarr = Split(s,\\\" \\\")\\n\\tFor i = UBound(arr) To 0 Step -1\\n\\t\\tn = fx(CDbl(arr(i)))\\n\\t\\tIf n > 400 Then\\n\\t\\t\\tWScript.StdOut.WriteLine arr(i) & \\\" = OVERFLOW\\\"\\n\\t\\tElse\\n\\t\\t\\tWScript.StdOut.WriteLine arr(i) & \\\" = \\\" & n\\n\\t\\tEnd If\\n\\tNext\\nEnd Function\\n\\nFunction fx(x)\\n\\tfx = Sqr(Abs(x))+5*x^3\\nEnd Function\\n\\n'testing the function\\nWScript.StdOut.Write \\\"Please enter a series of numbers:\\\"\\nlist = WScript.StdIn.ReadLine\\ntpk(list)\\n\",\n \"language\": \"VBScript\"\n },\n {\n \"code\": \"import \\\"io\\\" for Stdin, Stdout\\nimport \\\"./fmt\\\" for Fmt\\n\\nvar f = Fn.new { |x| x.abs.sqrt + 5*x*x*x }\\n\\nvar s = List.filled(11, 0)\\nSystem.print(\\\"Please enter 11 numbers:\\\")\\nvar count = 0\\nwhile (count < 11) {\\n Fmt.write(\\\" Number $-2d : \\\", count + 1)\\n Stdout.flush()\\n var number = Num.fromString(Stdin.readLine())\\n if (!number) {\\n System.print(\\\"Not a valid number, try again.\\\")\\n } else {\\n s[count] = number\\n count = count + 1\\n }\\n}\\ns = s[-1..0]\\nSystem.print(\\\"\\\\nResults:\\\")\\nfor (item in s) {\\n var fi = f.call(item)\\n if (fi <= 400) {\\n Fmt.print(\\\" f($6.3f) = $7.3f\\\", item, fi)\\n } else {\\n Fmt.print(\\\" f($6.3f) = overflow\\\", item)\\n }\\n}\\n\",\n \"language\": \"Wren\"\n },\n {\n \"code\": \"' Trabb Pardo-Knuth algorithm\\nPROGRAM \\\"tpkalgorithm\\\"\\nVERSION \\\"0.0001\\\"\\n\\nIMPORT \\\"xma\\\"\\n\\nDECLARE FUNCTION Entry ()\\nINTERNAL FUNCTION SINGLE F(SINGLE n)\\n\\nFUNCTION Entry ()\\n ' Used \\\"magic numbers\\\" because of strict specification of the algorithm.\\n SINGLE s[10]\\n SINGLE tmp, r\\n UBYTE i\\n PRINT \\\"Enter 11 numbers.\\\"\\n FOR i = 0 TO 10\\n PRINT i + 1;\\n s[i] = SINGLE(INLINE$(\\\" => \\\"))\\n NEXT i\\n PRINT\\n ' Reverse\\n FOR i = 0 TO 10 / 2\\n tmp = s[i]\\n s[i] = s[10 - i]\\n s[10 - i] = tmp\\n NEXT i\\n 'Results\\n FOR i = 0 TO 10\\n PRINT \\\"f(\\\"; LTRIM$(STR$(s[i])); \\\") =\\\";\\n r = F(s[i])\\n IF r > 400 THEN\\n PRINT \\\" overflow\\\"\\n ELSE\\n PRINT r\\n END IF\\n NEXT i\\nEND FUNCTION\\n\\nFUNCTION SINGLE F(SINGLE n)\\n RETURN SQRT(ABS(n)) + 5 * n * n *n\\nEND FUNCTION\\nEND PROGRAM\\n\",\n \"language\": \"XBasic\"\n },\n {\n \"code\": \"include c:\\\\cxpl\\\\codes;\\n\\nfunc real F(X);\\nreal X;\\nreturn sqrt(abs(X)) + 5.0*X*X*X;\\n\\nreal Result, S(11); int I;\\n[Text(0, \\\"Please enter 11 numbers: \\\");\\nfor I:= 0 to 11-1 do S(I):= RlIn(0);\\n\\nfor I:= 11-1 downto 0 do\\n [RlOut(0, S(I));\\n Result:= F(S(I));\\n if Result > 400.0 then\\n Text(0, \\\" overflows\\\")\\n else RlOut(0, Result);\\n CrLf(0)];\\n]\\n\",\n \"language\": \"XPL0\"\n },\n {\n \"code\": \"sub f(n)\\n return sqr(abs(n)) + 5.0 * n ^ 3.0\\nend sub\\n\\ndim s(11)\\nprint \\\"enter 11 numbers\\\"\\nfor i = 0 to 10\\n print i, \\\" => \\\";\\n input \\\"\\\" s(i)\\nnext i\\n\\nprint \\\"\\\\n--------------------\\\"\\nfor i = 10 to 0 step -1\\n print \\\"f(\\\", s(i), \\\") = \\\";\\n x = f(s(i))\\n if x > 400 then\\n print \\\"--- too large ---\\\"\\n else\\n print x\\n endif\\nnext i\\nend\\n\",\n \"language\": \"Yabasic\"\n },\n {\n \"code\": \"fcn f(x) { x.abs().pow(0.5) + x.pow(3)*5 }\\nreg ns; do{\\n ns=ask(\\\"11 numbers seperated by spaces: \\\");\\n try{ ns=ns.split(\\\" \\\").filter().apply(\\\"toFloat\\\") } catch{}\\n}while(not ns.isType(List) or ns.len()!=11);\\nns.reverse().apply(fcn(x){\\n fx:=f(x); \\\"f(%7.3f)-->%s\\\".fmt(x, if(fx>400)\\\"Overflow\\\" else fx) })\\n.pump(Console.println);\\n\",\n \"language\": \"Zkl\"\n }\n]","isConversational":false},"task_name":{"kind":"string","value":"Trabb-Pardo-Knuth-algorithm"}}},{"rowIdx":1769,"cells":{"solutions":{"kind":"list like","value":[{"code":"---\nfrom: http://rosettacode.org/wiki/Tree_datastructures\n","language":"00-META"},{"code":"The following shows a tree of data with nesting denoted by visual levels of indentation:\n<pre>RosettaCode\n rocks\n code\n comparison\n wiki\n mocks\n trolling</pre>\n\nA common datastructure for trees is to define node structures having a name and a, (possibly empty), list of child nodes. The nesting of nodes captures the indentation of the tree. Lets call this '''the nest form'''.\n<pre># E.g. if child nodes are surrounded by brackets\n# and separated by commas then:\nRosettaCode(rocks(code, ...), ...)\n# But only an _example_</pre>\n\nAnother datastructure for trees is to construct from the root an ordered list of the nodes level of indentation and the name of that node. The indentation for the root node is zero; node 'rocks is indented by one level from the left, and so on. Lets call this '''the indent form'''.\n<pre>0 RosettaCode\n1 rocks\n2 code\n...</pre>\n\n;Task:\n# Create/use a nest datastructure format and textual representation for arbitrary trees.\n# Create/use an indent datastructure format and textual representation for arbitrary trees.\n# Create methods/classes/proceedures/routines etc to:\n## Change from a nest tree datastructure to an indent one.\n## Change from an indent tree datastructure to a nest one\n# Use the above to encode the example at the start into the nest format, and show it.\n# transform the initial nest format to indent format and show it.\n# transform the indent format to final nest format and show it.\n# Compare initial and final nest formats which should be the same.\n\n;Note:\n* It's all about showing aspects of the contrasting datastructures as they hold the tree.\n* Comparing nested datastructures is secondary - saving formatted output as a string then a string compare would suffice for this task, if its easier.\n<br>\n\nShow all output on this page.\n\n","language":"00-TASK"},{"code":"T NNode\n String value\n [NNode] children\n\n F (value)\n .value = value\n\n F add(node)\n .children.append(node)\n\n F.const to_str(depth) -> String\n V result = (‘ ’ * depth)‘’(.value)\"\\n\"\n L(child) .children\n result ‘’= child.to_str(depth + 1)\n R result\n\n F String()\n R .to_str(0)\n\nT INode\n String value\n Int level\n F (value, level)\n .value = value\n .level = level\n\nF to_indented(node)\n [INode] result\n F add_node(NNode node, Int level) -> N\n @result.append(INode(node.value, level))\n L(child) node.children\n @add_node(child, level + 1)\n add_node(node, 0)\n R result\n\nF to_nested(tree)\n [NNode] stack\n V nnode = NNode(tree[0].value)\n L(i) 1 .< tree.len\n V inode = tree[i]\n I inode.level > stack.len\n stack.append(nnode)\n E I inode.level == stack.len\n stack.last.children.append(nnode)\n E\n L inode.level < stack.len\n stack.last.children.append(nnode)\n nnode = stack.pop()\n stack.last.children.append(nnode)\n nnode = NNode(inode.value)\n\n L stack.len > 0\n stack.last.children.append(nnode)\n nnode = stack.pop()\n\n R nnode\n\nprint(‘Displaying tree built using nested structure:’)\nV nestedTree = NNode(‘RosettaCode’)\nV rocks = NNode(‘rocks’)\nrocks.add(NNode(‘code’))\nrocks.add(NNode(‘comparison’))\nrocks.add(NNode(‘wiki’))\nV mocks = NNode(‘mocks’)\nmocks.add(NNode(‘trolling’))\nnestedTree.add(rocks)\nnestedTree.add(mocks)\nprint(nestedTree)\n\nprint(‘Displaying tree converted to indented structure:’)\nV indentedTree = to_indented(nestedTree)\nL(node) indentedTree\n print((node.level)‘ ’(node.value))\nprint()\n\nprint(‘Displaying tree converted back to nested structure:’)\nprint(to_nested(indentedTree))\n\nprint(‘Are they equal? ’(I String(nestedTree) == String(to_nested(indentedTree)) {‘yes’} E ‘no’))\n","language":"11l"},{"code":"#include <iomanip>\n#include <iostream>\n#include <list>\n#include <string>\n#include <vector>\n#include <utility>\n#include <vector>\n\nclass nest_tree;\n\nbool operator==(const nest_tree&, const nest_tree&);\n\nclass nest_tree {\npublic:\n explicit nest_tree(const std::string& name) : name_(name) {}\n nest_tree& add_child(const std::string& name) {\n children_.emplace_back(name);\n return children_.back();\n }\n void print(std::ostream& out) const {\n print(out, 0);\n }\n const std::string& name() const {\n return name_;\n }\n const std::list<nest_tree>& children() const {\n return children_;\n }\n bool equals(const nest_tree& n) const {\n return name_ == n.name_ && children_ == n.children_;\n }\nprivate:\n void print(std::ostream& out, int level) const {\n std::string indent(level * 4, ' ');\n out << indent << name_ << '\\n';\n for (const nest_tree& child : children_)\n child.print(out, level + 1);\n }\n std::string name_;\n std::list<nest_tree> children_;\n};\n\nbool operator==(const nest_tree& a, const nest_tree& b) {\n return a.equals(b);\n}\n\nclass indent_tree {\npublic:\n explicit indent_tree(const nest_tree& n) {\n items_.emplace_back(0, n.name());\n from_nest(n, 0);\n }\n void print(std::ostream& out) const {\n for (const auto& item : items_)\n std::cout << item.first << ' ' << item.second << '\\n';\n }\n nest_tree to_nest() const {\n nest_tree n(items_[0].second);\n to_nest_(n, 1, 0);\n return n;\n }\nprivate:\n void from_nest(const nest_tree& n, int level) {\n for (const nest_tree& child : n.children()) {\n items_.emplace_back(level + 1, child.name());\n from_nest(child, level + 1);\n }\n }\n size_t to_nest_(nest_tree& n, size_t pos, int level) const {\n while (pos < items_.size() && items_[pos].first == level + 1) {\n nest_tree& child = n.add_child(items_[pos].second);\n pos = to_nest_(child, pos + 1, level + 1);\n }\n return pos;\n }\n std::vector<std::pair<int, std::string>> items_;\n};\n\nint main() {\n nest_tree n(\"RosettaCode\");\n auto& child1 = n.add_child(\"rocks\");\n auto& child2 = n.add_child(\"mocks\");\n child1.add_child(\"code\");\n child1.add_child(\"comparison\");\n child1.add_child(\"wiki\");\n child2.add_child(\"trolling\");\n\n std::cout << \"Initial nest format:\\n\";\n n.print(std::cout);\n\n indent_tree i(n);\n std::cout << \"\\nIndent format:\\n\";\n i.print(std::cout);\n\n nest_tree n2(i.to_nest());\n std::cout << \"\\nFinal nest format:\\n\";\n n2.print(std::cout);\n\n std::cout << \"\\nAre initial and final nest formats equal? \"\n << std::boolalpha << n.equals(n2) << '\\n';\n\n return 0;\n}\n","language":"C++"},{"code":"package main\n\nimport (\n \"fmt\"\n \"io\"\n \"os\"\n \"strings\"\n)\n\ntype nNode struct {\n name string\n children []nNode\n}\n\ntype iNode struct {\n level int\n name string\n}\n\nfunc printNest(n nNode, level int, w io.Writer) {\n if level == 0 {\n fmt.Fprintln(w, \"\\n==Nest form==\\n\")\n }\n fmt.Fprintf(w, \"%s%s\\n\", strings.Repeat(\" \", level), n.name)\n for _, c := range n.children {\n fmt.Fprintf(w, \"%s\", strings.Repeat(\" \", level+1))\n printNest(c, level+1, w)\n }\n}\n\nfunc toNest(iNodes []iNode, start, level int, n *nNode) {\n if level == 0 {\n n.name = iNodes[0].name\n }\n for i := start + 1; i < len(iNodes); i++ {\n if iNodes[i].level == level+1 {\n c := nNode{iNodes[i].name, nil}\n toNest(iNodes, i, level+1, &c)\n n.children = append(n.children, c)\n } else if iNodes[i].level <= level {\n return\n }\n }\n}\n\nfunc printIndent(iNodes []iNode, w io.Writer) {\n fmt.Fprintln(w, \"\\n==Indent form==\\n\")\n for _, n := range iNodes {\n fmt.Fprintf(w, \"%d %s\\n\", n.level, n.name)\n }\n}\n\nfunc toIndent(n nNode, level int, iNodes *[]iNode) {\n *iNodes = append(*iNodes, iNode{level, n.name})\n for _, c := range n.children {\n toIndent(c, level+1, iNodes)\n }\n}\n\nfunc main() {\n n1 := nNode{\"RosettaCode\", nil}\n n2 := nNode{\"rocks\", []nNode{{\"code\", nil}, {\"comparison\", nil}, {\"wiki\", nil}}}\n n3 := nNode{\"mocks\", []nNode{{\"trolling\", nil}}}\n n1.children = append(n1.children, n2, n3)\n\n var sb strings.Builder\n printNest(n1, 0, &sb)\n s1 := sb.String()\n fmt.Print(s1)\n\n var iNodes []iNode\n toIndent(n1, 0, &iNodes)\n printIndent(iNodes, os.Stdout)\n\n var n nNode\n toNest(iNodes, 0, 0, &n)\n sb.Reset()\n printNest(n, 0, &sb)\n s2 := sb.String()\n fmt.Print(s2)\n\n fmt.Println(\"\\nRound trip test satisfied? \", s1 == s2)\n}\n","language":"Go"},{"code":"{-# LANGUAGE FlexibleInstances #-}\n{-# LANGUAGE MultiParamTypeClasses #-}\n{-# LANGUAGE UndecidableSuperClasses #-}\n{-# LANGUAGE TypeApplications #-}\n\nimport Data.List (span)\n\n-- A nested tree structure.\n-- Using `Maybe` allows encoding several zero-level items\n-- or irregular lists (see test example)\ndata Nest a = Nest (Maybe a) [Nest a]\n deriving Eq\n\ninstance Show a => Show (Nest a) where\n show (Nest (Just a) []) = show a\n show (Nest (Just a) s) = show a ++ show s\n show (Nest Nothing []) = \"\\\"\\\"\"\n show (Nest Nothing s) = \"\\\"\\\"\" ++ show s\n\n-- An indented tree structure.\ntype Indent a = [(Int, a)]\n\n-- class for isomorphic types\nclass Iso b a => Iso a b where\n from :: a -> b\n\n-- A bijection from nested form to indent form\ninstance Iso (Nest a) (Indent a) where\n from = go (-1)\n where\n go n (Nest a t) =\n case a of\n Just a -> (n, a) : foldMap (go (n + 1)) t\n Nothing -> foldMap (go (n + 1)) t\n\n-- A bijection from indent form to nested form\ninstance Iso (Indent a) (Nest a) where\n from = revNest . foldl add (Nest Nothing [])\n where\n add t (d,x) = go 0 t\n where\n go n (Nest a s) =\n case compare n d of\n EQ -> Nest a $ Nest (Just x) [] : s\n LT -> case s of\n h:t -> Nest a $ go (n+1) h : t\n [] -> go n $ Nest a [Nest Nothing []]\n GT -> go (n-1) $ Nest Nothing [Nest a s]\n\n revNest (Nest a s) = Nest a (reverse $ revNest <$> s)\n\n-- A bijection from indent form to a string\ninstance Iso (Indent String) String where\n from = unlines . map process\n where\n process (d, s) = replicate (4*d) ' ' ++ s\n\n-- A bijection from a string to indent form\ninstance Iso String (Indent String) where\n from = map process . lines\n where\n process s = let (i, a) = span (== ' ') s\n in (length i `div` 4, a)\n\n-- A bijection from nest form to a string via indent form\ninstance Iso (Nest String) String where\n from = from @(Indent String) . from\n\n-- A bijection from a string to nest form via indent form\ninstance Iso String (Nest String) where\n from = from @(Indent String) . from\n","language":"Haskell"},{"code":"test = unlines\n [ \"RosettaCode\"\n , \" rocks\"\n , \" code\"\n , \" comparison\"\n , \" wiki\"\n , \" mocks\"\n , \" trolling\"\n , \"Some lists\"\n , \" may\"\n , \" be\"\n , \" irregular\" ]\n\nitest :: Indent String\nitest = from test\n\nttest :: Nest String\nttest = from test\n","language":"Haskell"},{"code":"import Data.Bifunctor (bimap, first)\nimport Data.Char (isSpace)\nimport Data.List (find)\nimport Data.Tree (Forest, Tree (..), drawTree)\n\n-------- MAPPINGS BETWEEN INDENTED LINES AND TREES -------\n\nforestFromNestLevels :: [(Int, String)] -> Forest String\nforestFromNestLevels = go\n where\n go [] = []\n go ((n, v) : xs) =\n uncurry (:) $\n bimap (Node v . go) go (span ((n <) . fst) xs)\n\nindentLevelsFromLines :: [String] -> [(Int, String)]\nindentLevelsFromLines xs =\n let pairs = first length . span isSpace <$> xs\n indentUnit = maybe 1 fst (find ((0 <) . fst) pairs)\n in first (`div` indentUnit) <$> pairs\n\noutlineFromForest ::\n (String -> String -> String) ->\n String ->\n Forest String ->\n String\noutlineFromForest showRoot tabString forest =\n let go indent node =\n showRoot indent (rootLabel node) :\n (subForest node >>= go ((<>) tabString indent))\n in unlines $ forest >>= go \"\"\n\n-------------------------- TESTS -------------------------\nmain :: IO ()\nmain = do\n putStrLn \"Tree representation parsed directly:\\n\"\n putStrLn $ drawTree $ Node \"\" nativeForest\n\n let levelPairs = indentLevelsFromLines test\n putStrLn \"\\n[(Level, Text)] list from lines:\\n\"\n mapM_ print levelPairs\n\n putStrLn \"\\n\\nTrees from indented text:\\n\"\n let trees = forestFromNestLevels levelPairs\n putStrLn $ drawTree $ Node \"\" trees\n\n putStrLn \"Indented text from trees:\\n\"\n putStrLn $ outlineFromForest (<>) \" \" trees\n\ntest :: [String]\ntest =\n [ \"RosettaCode\",\n \" rocks\",\n \" code\",\n \" comparison\",\n \" wiki\",\n \" mocks\",\n \" trolling\",\n \"Some lists\",\n \" may\",\n \" be\",\n \" irregular\"\n ]\n\nnativeForest :: Forest String\nnativeForest =\n [ Node\n \"RosettaCode\"\n [ Node\n \"rocks\"\n [ Node \"code\" [],\n Node \"comparison\" [],\n Node \"wiki\" []\n ],\n Node\n \"mocks\"\n [Node \"trolling\" []]\n ],\n Node\n \"Some lists\"\n [ Node \"may\" [],\n Node \"be\" [],\n Node \"irregular\" []\n ]\n ]\n","language":"Haskell"},{"code":"public class TreeDatastructures {\n\n\tpublic static void main(String[] args) {\n\t\tString initialNested = \"\"\"\n\t Rosetta Code\n\t ....rocks\n\t ........code\n\t ........comparison\n\t ........wiki\n\t ....mocks\n\t ........trolling\n\t \"\"\";\n\t\n\t System.out.println(initialNested);\n\t\n\t String indented = nestedToIndented(initialNested);\n\t System.out.println(indented);\n\t\n\t String finalNested = indentedToNested(indented);\n\t System.out.println(finalNested);\n\n\t final boolean equal = ( initialNested.compareTo(finalNested) == 0 );\n\t System.out.println(\"initialNested = finalNested ? \" + equal);\n\t}\t\n\t\n\tprivate static String nestedToIndented(String nested) {\n\t\tStringBuilder result = new StringBuilder();\n\t\n\t\tfor ( String line : nested.split(LINE_END) ) {\n\t\t\tint index = 0;\n\t\t\twhile ( line.charAt(index) == '.' ) {\n\t\t\t\tindex += 1;\n\t\t\t}\t\t\t\t\t\t\n\t\t\tresult.append(String.valueOf(index / 4) + \" \" + line.substring(index) + LINE_END);\t\t\t\n\t\t}\n\t\t\n\t\treturn result.toString();\n\t}\t\n\n\tprivate static String indentedToNested(String indented) {\n\t\tStringBuilder result = new StringBuilder();\n\t\t\n\t\tfor ( String line : indented.split(LINE_END) ) {\n\t\t\tfinal int index = line.indexOf(' ');\n\t\t\tfinal int level = Integer.valueOf(line.substring(0, index));\t\t\t\n\t\t\tfor ( int i = 0; i < level; i++ ) {\n\t\t\t\tresult.append(\"....\");\n\t\t\t}\n\t\t\tresult.append(line.substring(index + 1) + LINE_END);\n\t\t}\t\t\n\t\t\n\t\treturn result.toString();\n\t}\n\t\n\tprivate static final String LINE_END = \"\\n\";\n\n}\n","language":"Java"},{"code":"# node of a nested representation\ndef NNode($name; $children): {$name, $children};\n\n# node of an indented representation:\ndef INode($level; $name): {$level, $name};\n\n# Output: string representation of an NNode structure\ndef printNest:\n . as $nested\n # input: string so far\n | def printNest($n; $level):\n if ($level == 0) then \"\\n==Nest form==\\n\\n\" else . end\n | reduce ($n.children[], null) as $c ( . + \"\\((\" \" * $level) // \"\")\\($n.name)\\n\";\n if $c == null then .\n else . + (\" \" * ($level + 1)) | printNest($c; $level + 1)\n end );\n printNest($nested; 0);\n\n# input: an INode structure\n# output: the corresponding NNode structure\ndef toNest:\n . as $in\n | def toNest($iNodes; start; level):\n { i: (start + 1),\n n: (if (level == 0) then .name = $iNodes[0].name else . end)\n }\n | until ( (.i >= ($iNodes|length)) or .done;\n if ($iNodes[.i].level == level + 1)\n then .i as $i\n\t | (NNode($iNodes[$i].name; []) | toNest($iNodes; $i; level+1)) as $c\n | .n.children += [$c]\n else if ($iNodes[.i].level <= level) then .done = true else . end\n end\n | .i += 1 )\n | .n ;\n NNode(\"\"; []) | toNest($in; 0; 0);\n\n# Output: string representation of an INode structure\ndef printIndent:\n \"\\n==Indent form==\\n\\n\"\n + reduce .[] as $n (\"\";\n . + \"\\($n.level) \\($n.name)\\n\") ;\n\n# output: representation using INode\ndef toIndent:\n def toIndent($n; level):\n . + [INode(level; $n.name)]\n + reduce $n.children[] as $c ([];\n toIndent($c; level+1) );\n . as $in\t\n | [] | toIndent($in; 0);\n\n\n### Example\n\ndef n: NNode(\"\"; []);\ndef n1: NNode(\"RosettaCode\"; []);\ndef n2: NNode(\"rocks\"; [NNode(\"code\"; []), NNode(\"comparison\"; []), NNode(\"wiki\"; [])] );\ndef n3: NNode(\"mocks\"; [NNode(\"trolling\"; [])]);\n\ndef n123:\n n1\n | .children += [n2]\n | .children += [n3];\n\n### The task\ndef nested:\n n123\n | printNest ;\n\ndef indented:\n n123\n | toIndent\n | printIndent;\n\ndef roundtrip:\n n123\n | toIndent\n | toNest\n | printNest;\n\ndef task:\n nested as $nested\n | roundtrip as $roundtrip\n | $nested, indented, $roundtrip,\n \"\\nRound trip test satisfied? \\($nested == $roundtrip)\" ;\n\ntask\n","language":"Jq"},{"code":"const nesttext = \"\"\"\nRosettaCode\n rocks\n code\n comparison\n wiki\n mocks\n trolling\n\"\"\"\n\nfunction nesttoindent(txt)\n ret = \"\"\n windent = gcd(length.([x.match for x in eachmatch(r\"\\s+\", txt)]) .- 1)\n for lin in split(txt, \"\\n\")\n ret *= isempty(lin) ? \"\\n\" : isspace(lin[1]) ?\n replace(lin, r\"\\s+\" => (s) -> \"$(length(s)÷windent) \") * \"\\n\" :\n \"0 \" * lin * \"\\n\"\n end\n return ret, \" \"^windent\nend\n\nfunction indenttonest(txt, indenttext)\n ret = \"\"\n for lin in filter(x -> length(x) > 1, split(txt, \"\\n\"))\n (num, name) = split(lin, r\"\\s+\", limit=2)\n indentnum = parse(Int, num)\n ret *= indentnum == 0 ? name * \"\\n\" : indenttext^indentnum * name * \"\\n\"\n end\n return ret\nend\n\nindenttext, itext = nesttoindent(nesttext)\nrestorednesttext = indenttonest(indenttext, itext)\n\nprintln(\"Original:\\n\", nesttext, \"\\n\")\nprintln(\"Indent form:\\n\", indenttext, \"\\n\")\nprintln(\"Back to nest form:\\n\", restorednesttext, \"\\n\")\nprintln(\"original == restored: \", strip(nesttext) == strip(restorednesttext))\n","language":"Julia"},{"code":"import strformat, strutils\n\n\n####################################################################################################\n# Nested representation of trees.\n# The tree is simply the first node.\n\ntype\n\n NNode*[T] = ref object\n value*: T\n children*: seq[NNode[T]]\n\n\nproc newNNode*[T](value: T; children: varargs[NNode[T]]): NNode[T] =\n ## Create a node.\n NNode[T](value: value, children: @children)\n\n\nproc add*[T](node: NNode[T]; children: varargs[NNode[T]]) =\n ## Add a list of chlidren to a node.\n node.children.add children\n\n\nproc `$`*[T](node: NNode[T]; depth = 0): string =\n ## Return a string representation of a tree/node.\n result = repeat(' ', 2 * depth) & $node.value & '\\n'\n for child in node.children:\n result.add `$`(child, depth + 1)\n\n\n####################################################################################################\n# Indented representation of trees.\n# The tree is described as the list of the nodes.\n\ntype\n\n INode*[T] = object\n value*: T\n level*: Natural\n\n ITree*[T] = seq[INode[T]]\n\n\nproc initINode*[T](value: T; level: Natural): INode[T] =\n ## Return a new node.\n INode[T](value: value, level: level)\n\n\nproc initItree*[T](value: T): ITree[T] =\n ## Return a new tree initialized with the first node (root node).\n result = @[initINode(value, 0)]\n\n\nproc add*[T](tree: var ITree[T]; nodes: varargs[INode[T]]) =\n ## Add a list of nodes to the tree.\n for node in nodes:\n if node.level - tree[^1].level > 1:\n raise newException(ValueError, &\"wrong level {node.level} in node {node.value}.\")\n tree.add node\n\n\nproc `$`*[T](tree: ITree[T]): string =\n ## Return a string representation of a tree.\n for node in tree:\n result.add $node.level & ' ' & $node.value & '\\n'\n\n\n####################################################################################################\n# Conversion between nested form and indented form.\n\nproc toIndented*[T](node: NNode[T]): Itree[T] =\n ## Convert a tree in nested form to a tree in indented form.\n\n proc addNode[T](tree: var Itree[T]; node: NNode[T]; level: Natural) =\n ## Add a node to the tree at the given level.\n tree.add initINode(node.value, level)\n for child in node.children:\n tree.addNode(child, level + 1)\n\n result.addNode(node, 0)\n\n\nproc toNested*[T](tree: Itree[T]): NNode[T] =\n ## Convert a tree in indented form to a tree in nested form.\n\n var stack: seq[NNode[T]] # Note that stack.len is equal to the current level.\n var nnode = newNNode(tree[0].value) # Root.\n for i in 1..tree.high:\n let inode = tree[i]\n if inode.level > stack.len:\n # Child.\n stack.add nnode\n elif inode.level == stack.len:\n # Sibling.\n stack[^1].children.add nnode\n else:\n # Branch terminated.\n while inode.level < stack.len:\n stack[^1].children.add nnode\n nnode = stack.pop()\n stack[^1].children.add nnode\n\n nnode = newNNode(inode.value)\n\n # Empty the stack.\n while stack.len > 0:\n stack[^1].children.add nnode\n nnode = stack.pop()\n\n result = nnode\n\n\n#———————————————————————————————————————————————————————————————————————————————————————————————————\n\nwhen isMainModule:\n\n echo \"Displaying tree built using nested structure:\"\n let nestedTree = newNNode(\"RosettaCode\")\n let rocks = newNNode(\"rocks\")\n rocks.add newNNode(\"code\"), newNNode(\"comparison\"), newNNode(\"wiki\")\n let mocks = newNNode(\"mocks\", newNNode(\"trolling\"))\n nestedTree.add rocks, mocks\n echo nestedTree\n\n echo \"Displaying tree converted to indented structure:\"\n let indentedTree = nestedTree.toIndented\n echo indentedTree\n\n echo \"Displaying tree converted back to nested structure:\"\n echo indentedTree.toNested\n\n echo \"Are they equal? \", if $nestedTree == $indentedTree.toNested: \"yes\" else: \"no\"\n","language":"Nim"},{"code":"use strict;\nuse warnings;\nuse feature 'say';\nuse JSON;\nuse Data::Printer;\n\nmy $trees = <<~END;\n RosettaCode\n encourages\n code\n diversity\n comparison\n discourages\n golfing\n trolling\n emphasising execution speed\n code-golf.io\n encourages\n golfing\n discourages\n comparison\n END\n\nmy $level = ' ';\nsub nested_to_indent { shift =~ s#^($level*)# ($1 ? length($1)/length $level : 0) . ' ' #egmr }\nsub indent_to_nested { shift =~ s#^(\\d+)\\s*# $level x $1 #egmr }\n\nsay my $indent = nested_to_indent $trees;\n my $nest = indent_to_nested $indent;\n\nuse Test::More;\nis($trees, $nest, 'Round-trip');\ndone_testing();\n\n# Import outline paragraph into native data structure\nsub import {\n my($trees) = @_;\n my $level = ' ';\n my $forest;\n my $last = -999;\n\n for my $branch (split /\\n/, $trees) {\n $branch =~ m/(($level*))*/;\n my $this = $1 ? length($1)/length($level) : 0;\n $forest .= do {\n if ($this gt $last) { '[' . trim_and_quote($branch) }\n elsif ($this lt $last) { ']'x($last-$this).',' . trim_and_quote($branch) }\n else { trim_and_quote($branch) }\n };\n $last = $this;\n }\n sub trim_and_quote { shift =~ s/^\\s*(.*\\S)\\s*$/\"$1\",/r }\n\n eval $forest . ']' x (1+$last);\n}\n\nmy $forest = import $trees;\nsay \"Native data structure:\\n\" . np $forest;\nsay \"\\nJSON:\\n\" . encode_json($forest);\n","language":"Perl"},{"code":"-->\n <span style=\"color: #008080;\">function</span> <span style=\"color: #000000;\">text_to_indent</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #004080;\">string</span> <span style=\"color: #000000;\">plain_text</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;\">plain_text</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #008000;\">\"\\n\"</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">no_empty</span><span style=\"color: #0000FF;\">:=</span><span style=\"color: #004600;\">true</span><span style=\"color: #0000FF;\">),</span>\n <span style=\"color: #000000;\">parents</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: #004080;\">string</span> <span style=\"color: #000000;\">line</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">trim_tail</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: #000000;\">text</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">trim_head</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">line</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #004080;\">integer</span> <span style=\"color: #000000;\">indent</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">length</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">line</span><span style=\"color: #0000FF;\">)-</span><span style=\"color: #7060A8;\">length</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">text</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #000080;font-style:italic;\">-- remove any completed parents</span>\n <span style=\"color: #008080;\">while</span> <span style=\"color: #7060A8;\">length</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">parents</span><span style=\"color: #0000FF;\">)</span> <span style=\"color: #008080;\">and</span> <span style=\"color: #000000;\">indent</span><span style=\"color: #0000FF;\"><=</span><span style=\"color: #000000;\">parents</span><span style=\"color: #0000FF;\">[$]</span> <span style=\"color: #008080;\">do</span>\n <span style=\"color: #000000;\">parents</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">parents</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;\">end</span> <span style=\"color: #008080;\">while</span>\n <span style=\"color: #000080;font-style:italic;\">-- append potential new parent</span>\n <span style=\"color: #000000;\">parents</span> <span style=\"color: #0000FF;\">&=</span> <span style=\"color: #000000;\">indent</span>\n <span style=\"color: #004080;\">integer</span> <span style=\"color: #000000;\">depth</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">length</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">parents</span><span style=\"color: #0000FF;\">)</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: #0000FF;\">{</span><span style=\"color: #000000;\">depth</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">text</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;\">lines</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;\">indent_to_nested</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #004080;\">sequence</span> <span style=\"color: #000000;\">indent</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #004080;\">integer</span> <span style=\"color: #000000;\">idx</span><span style=\"color: #0000FF;\">=</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">level</span><span style=\"color: #0000FF;\">=</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #004080;\">sequence</span> <span style=\"color: #000000;\">res</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #0000FF;\">{}</span>\n <span style=\"color: #008080;\">while</span> <span style=\"color: #000000;\">idx</span><span style=\"color: #0000FF;\"><=</span><span style=\"color: #7060A8;\">length</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">indent</span><span style=\"color: #0000FF;\">)</span> <span style=\"color: #008080;\">do</span>\n <span style=\"color: #0000FF;\">{</span><span style=\"color: #004080;\">integer</span> <span style=\"color: #000000;\">lvl</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #004080;\">string</span> <span style=\"color: #000000;\">text</span><span style=\"color: #0000FF;\">}</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">indent</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">idx</span><span style=\"color: #0000FF;\">]</span>\n <span style=\"color: #008080;\">if</span> <span style=\"color: #000000;\">lvl</span><span style=\"color: #0000FF;\"><</span><span style=\"color: #000000;\">level</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: #004080;\">sequence</span> <span style=\"color: #000000;\">children</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">idx</span><span style=\"color: #0000FF;\">}</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">indent_to_nested</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">indent</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">idx</span><span style=\"color: #0000FF;\">+</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">level</span><span style=\"color: #0000FF;\">+</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">)</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;\">text</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">children</span><span style=\"color: #0000FF;\">})</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">while</span>\n <span style=\"color: #008080;\">return</span> <span style=\"color: #0000FF;\">{</span><span style=\"color: #000000;\">res</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">idx</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;\">function</span> <span style=\"color: #000000;\">nested_to_indent</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #004080;\">sequence</span> <span style=\"color: #000000;\">nested</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #004080;\">integer</span> <span style=\"color: #000000;\">level</span><span style=\"color: #0000FF;\">=</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #004080;\">sequence</span> <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;\">nested</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;\">text</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #004080;\">sequence</span> <span style=\"color: #000000;\">children</span><span style=\"color: #0000FF;\">}</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">nested</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">i</span><span style=\"color: #0000FF;\">]</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;\">level</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">text</span><span style=\"color: #0000FF;\">})</span>\n <span style=\"color: #000000;\">res</span> <span style=\"color: #0000FF;\">&=</span> <span style=\"color: #000000;\">nested_to_indent</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">children</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">level</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;\">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;\">constant</span> <span style=\"color: #000000;\">text</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #008000;\">\"\"\"\n RosettaCode\n encourages\n code\n diversity\n comparison\n discourages\n emphasising execution speed\n code-golf.io\n encourages\n golfing\n discourages\n comparison\"\"\"</span>\n\n <span style=\"color: #004080;\">sequence</span> <span style=\"color: #000000;\">indent</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">text_to_indent</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">text</span><span style=\"color: #0000FF;\">),</span>\n <span style=\"color: #000000;\">nested</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">indent_to_nested</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">indent</span><span style=\"color: #0000FF;\">)[</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">],</span>\n <span style=\"color: #000000;\">n2ichk</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">nested_to_indent</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">nested</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;\">\"Indent form:\\n\"</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #7060A8;\">pp</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">indent</span><span style=\"color: #0000FF;\">,{</span><span style=\"color: #000000;\">pp_Nest</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">1</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;\">\"\\nNested form:\\n\"</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #7060A8;\">pp</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">nested</span><span style=\"color: #0000FF;\">,{</span><span style=\"color: #000000;\">pp_Nest</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">8</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;\">\"\\nNested to indent:%s\\n\"</span><span style=\"color: #0000FF;\">,{</span><span style=\"color: #008080;\">iff</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">n2ichk</span><span style=\"color: #0000FF;\">==</span><span style=\"color: #000000;\">indent</span><span style=\"color: #0000FF;\">?</span><span style=\"color: #008000;\">\"same\"</span><span style=\"color: #0000FF;\">:</span><span style=\"color: #008000;\">\"***ERROR***\"</span><span style=\"color: #0000FF;\">)})</span>\n<!--\n","language":"Phix"},{"code":"-->\n <span style=\"color: #008080;\">type</span> <span style=\"color: #000000;\">indent_struct</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: #008080;\">if</span> <span style=\"color: #004080;\">sequence</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">o</span><span style=\"color: #0000FF;\">)</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;\">1</span> <span style=\"color: #008080;\">to</span> <span style=\"color: #7060A8;\">length</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">o</span><span style=\"color: #0000FF;\">)</span> <span style=\"color: #008080;\">do</span>\n <span style=\"color: #004080;\">object</span> <span style=\"color: #000000;\">oi</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">o</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: #004080;\">sequence</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">oi</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #008080;\">or</span> <span style=\"color: #7060A8;\">length</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">oi</span><span style=\"color: #0000FF;\">)!=</span><span style=\"color: #000000;\">2</span>\n <span style=\"color: #008080;\">or</span> <span style=\"color: #008080;\">not</span> <span style=\"color: #004080;\">integer</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">oi</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">])</span>\n <span style=\"color: #008080;\">or</span> <span style=\"color: #008080;\">not</span> <span style=\"color: #004080;\">string</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">oi</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">2</span><span style=\"color: #0000FF;\">])</span> <span style=\"color: #008080;\">then</span>\n <span style=\"color: #008080;\">return</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;\">for</span>\n <span style=\"color: #008080;\">return</span> <span style=\"color: #004600;\">true</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">if</span>\n <span style=\"color: #008080;\">return</span> <span style=\"color: #004600;\">false</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">type</span>\n\n <span style=\"color: #008080;\">type</span> <span style=\"color: #000000;\">nested_struct</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: #008080;\">if</span> <span style=\"color: #004080;\">sequence</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">o</span><span style=\"color: #0000FF;\">)</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;\">1</span> <span style=\"color: #008080;\">to</span> <span style=\"color: #7060A8;\">length</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">o</span><span style=\"color: #0000FF;\">)</span> <span style=\"color: #008080;\">do</span>\n <span style=\"color: #004080;\">object</span> <span style=\"color: #000000;\">oi</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">o</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: #004080;\">sequence</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">oi</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #008080;\">or</span> <span style=\"color: #7060A8;\">length</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">oi</span><span style=\"color: #0000FF;\">)!=</span><span style=\"color: #000000;\">2</span>\n <span style=\"color: #008080;\">or</span> <span style=\"color: #008080;\">not</span> <span style=\"color: #004080;\">string</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">oi</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">])</span>\n <span style=\"color: #008080;\">or</span> <span style=\"color: #008080;\">not</span> <span style=\"color: #000000;\">nested_struct</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">oi</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">2</span><span style=\"color: #0000FF;\">])</span> <span style=\"color: #008080;\">then</span>\n <span style=\"color: #008080;\">return</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;\">for</span>\n <span style=\"color: #008080;\">return</span> <span style=\"color: #004600;\">true</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">if</span>\n <span style=\"color: #008080;\">return</span> <span style=\"color: #004600;\">false</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">type</span>\n\n <span style=\"color: #000080;font-style:italic;\">-- and as above except:</span>\n <span style=\"color: #008080;\">function</span> <span style=\"color: #000000;\">indent_to_nested</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">indent_struct</span> <span style=\"color: #000000;\">indent</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #004080;\">integer</span> <span style=\"color: #000000;\">idx</span><span style=\"color: #0000FF;\">=</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">level</span><span style=\"color: #0000FF;\">=</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #008080;\">function</span> <span style=\"color: #000000;\">nested_to_indent</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">nested_struct</span> <span style=\"color: #000000;\">nested</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #004080;\">integer</span> <span style=\"color: #000000;\">level</span><span style=\"color: #0000FF;\">=</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #000080;font-style:italic;\">-- also make the output sequences better typed:</span>\n <span style=\"color: #000000;\">indent_struct</span> <span style=\"color: #000000;\">indent</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">text_to_indent</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">text</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #000000;\">nested_struct</span> <span style=\"color: #000000;\">nested</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">indent_to_nested</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">indent</span><span style=\"color: #0000FF;\">)[</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">]</span>\n <span style=\"color: #000000;\">indent_struct</span> <span style=\"color: #000000;\">r2ichk</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">nested_to_indent</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">nested</span><span style=\"color: #0000FF;\">)</span>\n<!--\n","language":"Phix"},{"code":"from pprint import pprint as pp\n\ndef to_indent(node, depth=0, flat=None):\n if flat is None:\n flat = []\n if node:\n flat.append((depth, node[0]))\n for child in node[1]:\n to_indent(child, depth + 1, flat)\n return flat\n\ndef to_nest(lst, depth=0, level=None):\n if level is None:\n level = []\n while lst:\n d, name = lst[0]\n if d == depth:\n children = []\n level.append((name, children))\n lst.pop(0)\n elif d > depth: # down\n to_nest(lst, d, children)\n elif d < depth: # up\n return\n return level[0] if level else None\n\nif __name__ == '__main__':\n print('Start Nest format:')\n nest = ('RosettaCode', [('rocks', [('code', []), ('comparison', []), ('wiki', [])]),\n ('mocks', [('trolling', [])])])\n pp(nest, width=25)\n\n print('\\n... To Indent format:')\n as_ind = to_indent(nest)\n pp(as_ind, width=25)\n\n print('\\n... To Nest format:')\n as_nest = to_nest(as_ind)\n pp(as_nest, width=25)\n\n if nest != as_nest:\n print(\"Whoops round-trip issues\")\n","language":"Python"},{"code":"#`(\nSort of vague as to what we are trying to accomplish here. If we are just\ntrying to transform from one format to another, probably easiest to just\nperform string manipulations.\n)\n\nmy $level = ' ';\n\nmy $trees = q:to/END/;\n RosettaCode\n encourages\n code\n diversity\n comparison\n discourages\n golfing\n trolling\n emphasising execution speed\n code-golf.io\n encourages\n golfing\n discourages\n comparison\n END\n\nsub nested-to-indent { $^str.subst: / ^^ ($($level))* /, -> $/ { \"{+$0} \" }, :g }\nsub indent-to-nested { $^str.subst: / ^^ (\\d+) \\s* /, -> $/ { \"{$level x +$0}\" }, :g }\n\nsay $trees;\nsay my $indent = $trees.&nested-to-indent;\nsay my $nest = $indent.&indent-to-nested;\n\nuse Test;\nis($trees, $nest, 'Round-trip equals original');\n\n#`(\nIf, on the other hand, we want perform more complex transformations; better to\nload it into a native data structure which will then allow us to manipulate it\nhowever we like.\n)\n\n# Import outline paragraph into native data structure\nsub import (Str $trees, $level = ' ') {\n my $forest;\n my $last = -Inf;\n\n for $trees.lines -> $branch {\n $branch ~~ / ($($level))* /;\n my $this = +$0;\n $forest ~= do {\n given $this cmp $last {\n when More { \"\\['{esc $branch.trim}', \" }\n when Same { \"'{esc $branch.trim}', \" }\n when Less { \"{']' x $last - $this}, '{esc $branch.trim}', \" }\n }\n }\n $last = $this;\n }\n\n sub esc { $^s.subst( /(<['\\\\]>)/, -> $/ { \"\\\\$0\" }, :g) }\n\n $forest ~= ']' x 1 + $last;\n $forest.EVAL;\n}\n\nmy $forest = import $trees;\n\nsay \"\\nNative data structure:\\n\", $forest.raku;\n\n{\n use JSON::Fast;\n say \"\\nJSON:\\n\", $forest.&to-json;\n}\n\n{\n use YAML;\n say \"\\nYAML:\\n\", $forest.&dump;\n}\n","language":"Raku"},{"code":"import \"./dynamic\" for Struct\nimport \"./fmt\" for Fmt\n\nvar NNode = Struct.create(\"NNode\", [\"name\", \"children\"])\nvar INode = Struct.create(\"INode\", [\"level\", \"name\"])\n\nvar sw = \"\"\n\nvar printNest // recursive\nprintNest = Fn.new { |n, level|\n if (level == 0) sw = sw + \"\\n==Nest form==\\n\\n\"\n sw = sw + Fmt.swrite(\"$0s$s\\n\", \" \" * level, n.name)\n for (c in n.children) {\n sw = sw + (\" \" * (level + 1))\n printNest.call(c, level+1)\n }\n}\n\nvar toNest // recursive\ntoNest = Fn.new { |iNodes, start, level, n|\n if (level == 0) n.name = iNodes[0].name\n var i = start + 1\n while (i < iNodes.count) {\n if (iNodes[i].level == level + 1) {\n var c = NNode.new(iNodes[i].name, [])\n toNest.call(iNodes, i, level+1, c)\n n.children.add(c)\n } else if (iNodes[i].level <= level) return\n i = i + 1\n }\n}\n\nvar printIndent = Fn.new { |iNodes|\n sw = sw + \"\\n==Indent form==\\n\\n\"\n for (n in iNodes) sw = sw + Fmt.swrite(\"$d $s\\n\", n.level, n.name)\n}\n\nvar toIndent // recursive\ntoIndent = Fn.new { |n, level, iNodes|\n iNodes.add(INode.new(level, n.name))\n for (c in n.children) toIndent.call(c, level+1, iNodes)\n}\n\nvar n1 = NNode.new(\"RosettaCode\", [])\nvar n2 = NNode.new(\"rocks\", [NNode.new(\"code\", []), NNode.new(\"comparison\", []), NNode.new(\"wiki\", [])])\nvar n3 = NNode.new(\"mocks\", [NNode.new(\"trolling\", [])])\nn1.children.add(n2)\nn1.children.add(n3)\n\nprintNest.call(n1, 0)\nvar s1 = sw\nSystem.print(s1)\n\nvar iNodes = []\ntoIndent.call(n1, 0, iNodes)\nsw = \"\"\nprintIndent.call(iNodes)\nSystem.print(sw)\n\nvar n = NNode.new(\"\", [])\ntoNest.call(iNodes, 0, 0, n)\nsw = \"\"\nprintNest.call(n, 0)\nvar s2 = sw\nSystem.print(s2)\n\nSystem.print(\"\\nRound trip test satisfied? %(s1 == s2)\")\n","language":"Wren"},{"code":"fcn nestToIndent(nestTree){\n fcn(out,node,level){\n out.append(List(level,node[0]));\t// (n,name) or (\"..\",name)\n if(node.len()>1){\t\t// (name children), (name, (tree))\n\t level+=1;\n\t foreach child in (node[1,*]){\n\t if(String.isType(child)) out.append(List(level,child));\n\t else self.fcn(out,child,level)\n\t }\n }\n out\n }(List(),nestTree,0)\n}\nfcn nestToString(nestTree,dot=\".\"){\n fcn(out,dot,node,level){\n out.writeln(dot*level,node[0]);\t// (name)\n if(node.len()>1){\t\t\t// (name children), (name, (tree))\n\t level+=1;\n\t foreach child in (node[1,*]){\n\t if(String.isType(child)) out.writeln(dot*level,child);\n\t else self.fcn(out,dot,child,level)\n\t }\n }\n out\n }(Data(),dot,nestTree,0).text\n}\n\nfcn indentToNest(iTree,depth=0,nTree=List()){\n while(iTree){\t// (n,name)\n d, name := iTree[0];\n if(d==depth){\n nTree.append(name);\n\t iTree.pop(0);\n }\n else if(d>depth){\t\t// assume can't skip levels down\n\t if(nTree.len()>1 and not List.isType((nm:=nTree[-1]))){\n\t nTree[-1]=(children:=List(nm));\n\t indentToNest(iTree,d,children);\n\t }else{\n\t nTree.append(children:=List(name));\n\t iTree.pop(0);\n\t indentToNest(iTree,d+1,children);\n\t }\n }\n else break; // d<depth\n }\n return(nTree)\n}\nfcn indentToString(indentTree){ indentTree.apply(\"concat\",\" \").concat(\"\\n\") }\n","language":"Zkl"},{"code":"tree:=L(\"RosettaCode\",\n L(\"rocks\",\"code\",\"comparison\",\"wiki\"),\n\t L(\"mocks\",\"golfing\") );\n\nprintln(\"Nest tree internal format:\\n\",tree.toString(*,*));\nprintln(\"Formated:\\n\",nestToString(tree));\n\nindentTree:=nestToIndent(tree);\nprintln(\"To indent format:\\n\",indentToString(indentTree));\n\nnestTree:=indentToNest(indentTree);\nprintln(\"\\nIndent to nested format:\\n\",nestTree);\nprintln(\"Is this tree the same as what we started with? \",nestTree==tree);\n","language":"Zkl"},{"code":"rakutrees:=L(\n L(\"RosettaCode\",\n L(\"encourages\",\n L(\"code\",\n\t \"diversity\",\"comparison\")),\n L(\"discourages\",\n \"golfing\",\"trolling\",\"emphasising execution speed\"),\n ),\n L(\"code-golf.io\",\n L(\"encourages\",\"golfing\"),\n L(\"discourages\",\"comparison\"),\n )\n);\nprintln(rakutrees.apply(nestToString).concat());\niTrees := rakutrees.apply(nestToIndent);\nprintln(iTrees.apply(indentToString).concat(\"\\n\"));\n(iTrees.apply(indentToNest)==rakutrees).println();\n","language":"Zkl"}],"string":"[\n {\n \"code\": \"---\\nfrom: http://rosettacode.org/wiki/Tree_datastructures\\n\",\n \"language\": \"00-META\"\n },\n {\n \"code\": \"The following shows a tree of data with nesting denoted by visual levels of indentation:\\n<pre>RosettaCode\\n rocks\\n code\\n comparison\\n wiki\\n mocks\\n trolling</pre>\\n\\nA common datastructure for trees is to define node structures having a name and a, (possibly empty), list of child nodes. The nesting of nodes captures the indentation of the tree. Lets call this '''the nest form'''.\\n<pre># E.g. if child nodes are surrounded by brackets\\n# and separated by commas then:\\nRosettaCode(rocks(code, ...), ...)\\n# But only an _example_</pre>\\n\\nAnother datastructure for trees is to construct from the root an ordered list of the nodes level of indentation and the name of that node. The indentation for the root node is zero; node 'rocks is indented by one level from the left, and so on. Lets call this '''the indent form'''.\\n<pre>0 RosettaCode\\n1 rocks\\n2 code\\n...</pre>\\n\\n;Task:\\n# Create/use a nest datastructure format and textual representation for arbitrary trees.\\n# Create/use an indent datastructure format and textual representation for arbitrary trees.\\n# Create methods/classes/proceedures/routines etc to:\\n## Change from a nest tree datastructure to an indent one.\\n## Change from an indent tree datastructure to a nest one\\n# Use the above to encode the example at the start into the nest format, and show it.\\n# transform the initial nest format to indent format and show it.\\n# transform the indent format to final nest format and show it.\\n# Compare initial and final nest formats which should be the same.\\n\\n;Note:\\n* It's all about showing aspects of the contrasting datastructures as they hold the tree.\\n* Comparing nested datastructures is secondary - saving formatted output as a string then a string compare would suffice for this task, if its easier.\\n<br>\\n\\nShow all output on this page.\\n\\n\",\n \"language\": \"00-TASK\"\n },\n {\n \"code\": \"T NNode\\n String value\\n [NNode] children\\n\\n F (value)\\n .value = value\\n\\n F add(node)\\n .children.append(node)\\n\\n F.const to_str(depth) -> String\\n V result = (‘ ’ * depth)‘’(.value)\\\"\\\\n\\\"\\n L(child) .children\\n result ‘’= child.to_str(depth + 1)\\n R result\\n\\n F String()\\n R .to_str(0)\\n\\nT INode\\n String value\\n Int level\\n F (value, level)\\n .value = value\\n .level = level\\n\\nF to_indented(node)\\n [INode] result\\n F add_node(NNode node, Int level) -> N\\n @result.append(INode(node.value, level))\\n L(child) node.children\\n @add_node(child, level + 1)\\n add_node(node, 0)\\n R result\\n\\nF to_nested(tree)\\n [NNode] stack\\n V nnode = NNode(tree[0].value)\\n L(i) 1 .< tree.len\\n V inode = tree[i]\\n I inode.level > stack.len\\n stack.append(nnode)\\n E I inode.level == stack.len\\n stack.last.children.append(nnode)\\n E\\n L inode.level < stack.len\\n stack.last.children.append(nnode)\\n nnode = stack.pop()\\n stack.last.children.append(nnode)\\n nnode = NNode(inode.value)\\n\\n L stack.len > 0\\n stack.last.children.append(nnode)\\n nnode = stack.pop()\\n\\n R nnode\\n\\nprint(‘Displaying tree built using nested structure:’)\\nV nestedTree = NNode(‘RosettaCode’)\\nV rocks = NNode(‘rocks’)\\nrocks.add(NNode(‘code’))\\nrocks.add(NNode(‘comparison’))\\nrocks.add(NNode(‘wiki’))\\nV mocks = NNode(‘mocks’)\\nmocks.add(NNode(‘trolling’))\\nnestedTree.add(rocks)\\nnestedTree.add(mocks)\\nprint(nestedTree)\\n\\nprint(‘Displaying tree converted to indented structure:’)\\nV indentedTree = to_indented(nestedTree)\\nL(node) indentedTree\\n print((node.level)‘ ’(node.value))\\nprint()\\n\\nprint(‘Displaying tree converted back to nested structure:’)\\nprint(to_nested(indentedTree))\\n\\nprint(‘Are they equal? ’(I String(nestedTree) == String(to_nested(indentedTree)) {‘yes’} E ‘no’))\\n\",\n \"language\": \"11l\"\n },\n {\n \"code\": \"#include <iomanip>\\n#include <iostream>\\n#include <list>\\n#include <string>\\n#include <vector>\\n#include <utility>\\n#include <vector>\\n\\nclass nest_tree;\\n\\nbool operator==(const nest_tree&, const nest_tree&);\\n\\nclass nest_tree {\\npublic:\\n explicit nest_tree(const std::string& name) : name_(name) {}\\n nest_tree& add_child(const std::string& name) {\\n children_.emplace_back(name);\\n return children_.back();\\n }\\n void print(std::ostream& out) const {\\n print(out, 0);\\n }\\n const std::string& name() const {\\n return name_;\\n }\\n const std::list<nest_tree>& children() const {\\n return children_;\\n }\\n bool equals(const nest_tree& n) const {\\n return name_ == n.name_ && children_ == n.children_;\\n }\\nprivate:\\n void print(std::ostream& out, int level) const {\\n std::string indent(level * 4, ' ');\\n out << indent << name_ << '\\\\n';\\n for (const nest_tree& child : children_)\\n child.print(out, level + 1);\\n }\\n std::string name_;\\n std::list<nest_tree> children_;\\n};\\n\\nbool operator==(const nest_tree& a, const nest_tree& b) {\\n return a.equals(b);\\n}\\n\\nclass indent_tree {\\npublic:\\n explicit indent_tree(const nest_tree& n) {\\n items_.emplace_back(0, n.name());\\n from_nest(n, 0);\\n }\\n void print(std::ostream& out) const {\\n for (const auto& item : items_)\\n std::cout << item.first << ' ' << item.second << '\\\\n';\\n }\\n nest_tree to_nest() const {\\n nest_tree n(items_[0].second);\\n to_nest_(n, 1, 0);\\n return n;\\n }\\nprivate:\\n void from_nest(const nest_tree& n, int level) {\\n for (const nest_tree& child : n.children()) {\\n items_.emplace_back(level + 1, child.name());\\n from_nest(child, level + 1);\\n }\\n }\\n size_t to_nest_(nest_tree& n, size_t pos, int level) const {\\n while (pos < items_.size() && items_[pos].first == level + 1) {\\n nest_tree& child = n.add_child(items_[pos].second);\\n pos = to_nest_(child, pos + 1, level + 1);\\n }\\n return pos;\\n }\\n std::vector<std::pair<int, std::string>> items_;\\n};\\n\\nint main() {\\n nest_tree n(\\\"RosettaCode\\\");\\n auto& child1 = n.add_child(\\\"rocks\\\");\\n auto& child2 = n.add_child(\\\"mocks\\\");\\n child1.add_child(\\\"code\\\");\\n child1.add_child(\\\"comparison\\\");\\n child1.add_child(\\\"wiki\\\");\\n child2.add_child(\\\"trolling\\\");\\n\\n std::cout << \\\"Initial nest format:\\\\n\\\";\\n n.print(std::cout);\\n\\n indent_tree i(n);\\n std::cout << \\\"\\\\nIndent format:\\\\n\\\";\\n i.print(std::cout);\\n\\n nest_tree n2(i.to_nest());\\n std::cout << \\\"\\\\nFinal nest format:\\\\n\\\";\\n n2.print(std::cout);\\n\\n std::cout << \\\"\\\\nAre initial and final nest formats equal? \\\"\\n << std::boolalpha << n.equals(n2) << '\\\\n';\\n\\n return 0;\\n}\\n\",\n \"language\": \"C++\"\n },\n {\n \"code\": \"package main\\n\\nimport (\\n \\\"fmt\\\"\\n \\\"io\\\"\\n \\\"os\\\"\\n \\\"strings\\\"\\n)\\n\\ntype nNode struct {\\n name string\\n children []nNode\\n}\\n\\ntype iNode struct {\\n level int\\n name string\\n}\\n\\nfunc printNest(n nNode, level int, w io.Writer) {\\n if level == 0 {\\n fmt.Fprintln(w, \\\"\\\\n==Nest form==\\\\n\\\")\\n }\\n fmt.Fprintf(w, \\\"%s%s\\\\n\\\", strings.Repeat(\\\" \\\", level), n.name)\\n for _, c := range n.children {\\n fmt.Fprintf(w, \\\"%s\\\", strings.Repeat(\\\" \\\", level+1))\\n printNest(c, level+1, w)\\n }\\n}\\n\\nfunc toNest(iNodes []iNode, start, level int, n *nNode) {\\n if level == 0 {\\n n.name = iNodes[0].name\\n }\\n for i := start + 1; i < len(iNodes); i++ {\\n if iNodes[i].level == level+1 {\\n c := nNode{iNodes[i].name, nil}\\n toNest(iNodes, i, level+1, &c)\\n n.children = append(n.children, c)\\n } else if iNodes[i].level <= level {\\n return\\n }\\n }\\n}\\n\\nfunc printIndent(iNodes []iNode, w io.Writer) {\\n fmt.Fprintln(w, \\\"\\\\n==Indent form==\\\\n\\\")\\n for _, n := range iNodes {\\n fmt.Fprintf(w, \\\"%d %s\\\\n\\\", n.level, n.name)\\n }\\n}\\n\\nfunc toIndent(n nNode, level int, iNodes *[]iNode) {\\n *iNodes = append(*iNodes, iNode{level, n.name})\\n for _, c := range n.children {\\n toIndent(c, level+1, iNodes)\\n }\\n}\\n\\nfunc main() {\\n n1 := nNode{\\\"RosettaCode\\\", nil}\\n n2 := nNode{\\\"rocks\\\", []nNode{{\\\"code\\\", nil}, {\\\"comparison\\\", nil}, {\\\"wiki\\\", nil}}}\\n n3 := nNode{\\\"mocks\\\", []nNode{{\\\"trolling\\\", nil}}}\\n n1.children = append(n1.children, n2, n3)\\n\\n var sb strings.Builder\\n printNest(n1, 0, &sb)\\n s1 := sb.String()\\n fmt.Print(s1)\\n\\n var iNodes []iNode\\n toIndent(n1, 0, &iNodes)\\n printIndent(iNodes, os.Stdout)\\n\\n var n nNode\\n toNest(iNodes, 0, 0, &n)\\n sb.Reset()\\n printNest(n, 0, &sb)\\n s2 := sb.String()\\n fmt.Print(s2)\\n\\n fmt.Println(\\\"\\\\nRound trip test satisfied? \\\", s1 == s2)\\n}\\n\",\n \"language\": \"Go\"\n },\n {\n \"code\": \"{-# LANGUAGE FlexibleInstances #-}\\n{-# LANGUAGE MultiParamTypeClasses #-}\\n{-# LANGUAGE UndecidableSuperClasses #-}\\n{-# LANGUAGE TypeApplications #-}\\n\\nimport Data.List (span)\\n\\n-- A nested tree structure.\\n-- Using `Maybe` allows encoding several zero-level items\\n-- or irregular lists (see test example)\\ndata Nest a = Nest (Maybe a) [Nest a]\\n deriving Eq\\n\\ninstance Show a => Show (Nest a) where\\n show (Nest (Just a) []) = show a\\n show (Nest (Just a) s) = show a ++ show s\\n show (Nest Nothing []) = \\\"\\\\\\\"\\\\\\\"\\\"\\n show (Nest Nothing s) = \\\"\\\\\\\"\\\\\\\"\\\" ++ show s\\n\\n-- An indented tree structure.\\ntype Indent a = [(Int, a)]\\n\\n-- class for isomorphic types\\nclass Iso b a => Iso a b where\\n from :: a -> b\\n\\n-- A bijection from nested form to indent form\\ninstance Iso (Nest a) (Indent a) where\\n from = go (-1)\\n where\\n go n (Nest a t) =\\n case a of\\n Just a -> (n, a) : foldMap (go (n + 1)) t\\n Nothing -> foldMap (go (n + 1)) t\\n\\n-- A bijection from indent form to nested form\\ninstance Iso (Indent a) (Nest a) where\\n from = revNest . foldl add (Nest Nothing [])\\n where\\n add t (d,x) = go 0 t\\n where\\n go n (Nest a s) =\\n case compare n d of\\n EQ -> Nest a $ Nest (Just x) [] : s\\n LT -> case s of\\n h:t -> Nest a $ go (n+1) h : t\\n [] -> go n $ Nest a [Nest Nothing []]\\n GT -> go (n-1) $ Nest Nothing [Nest a s]\\n\\n revNest (Nest a s) = Nest a (reverse $ revNest <$> s)\\n\\n-- A bijection from indent form to a string\\ninstance Iso (Indent String) String where\\n from = unlines . map process\\n where\\n process (d, s) = replicate (4*d) ' ' ++ s\\n\\n-- A bijection from a string to indent form\\ninstance Iso String (Indent String) where\\n from = map process . lines\\n where\\n process s = let (i, a) = span (== ' ') s\\n in (length i `div` 4, a)\\n\\n-- A bijection from nest form to a string via indent form\\ninstance Iso (Nest String) String where\\n from = from @(Indent String) . from\\n\\n-- A bijection from a string to nest form via indent form\\ninstance Iso String (Nest String) where\\n from = from @(Indent String) . from\\n\",\n \"language\": \"Haskell\"\n },\n {\n \"code\": \"test = unlines\\n [ \\\"RosettaCode\\\"\\n , \\\" rocks\\\"\\n , \\\" code\\\"\\n , \\\" comparison\\\"\\n , \\\" wiki\\\"\\n , \\\" mocks\\\"\\n , \\\" trolling\\\"\\n , \\\"Some lists\\\"\\n , \\\" may\\\"\\n , \\\" be\\\"\\n , \\\" irregular\\\" ]\\n\\nitest :: Indent String\\nitest = from test\\n\\nttest :: Nest String\\nttest = from test\\n\",\n \"language\": \"Haskell\"\n },\n {\n \"code\": \"import Data.Bifunctor (bimap, first)\\nimport Data.Char (isSpace)\\nimport Data.List (find)\\nimport Data.Tree (Forest, Tree (..), drawTree)\\n\\n-------- MAPPINGS BETWEEN INDENTED LINES AND TREES -------\\n\\nforestFromNestLevels :: [(Int, String)] -> Forest String\\nforestFromNestLevels = go\\n where\\n go [] = []\\n go ((n, v) : xs) =\\n uncurry (:) $\\n bimap (Node v . go) go (span ((n <) . fst) xs)\\n\\nindentLevelsFromLines :: [String] -> [(Int, String)]\\nindentLevelsFromLines xs =\\n let pairs = first length . span isSpace <$> xs\\n indentUnit = maybe 1 fst (find ((0 <) . fst) pairs)\\n in first (`div` indentUnit) <$> pairs\\n\\noutlineFromForest ::\\n (String -> String -> String) ->\\n String ->\\n Forest String ->\\n String\\noutlineFromForest showRoot tabString forest =\\n let go indent node =\\n showRoot indent (rootLabel node) :\\n (subForest node >>= go ((<>) tabString indent))\\n in unlines $ forest >>= go \\\"\\\"\\n\\n-------------------------- TESTS -------------------------\\nmain :: IO ()\\nmain = do\\n putStrLn \\\"Tree representation parsed directly:\\\\n\\\"\\n putStrLn $ drawTree $ Node \\\"\\\" nativeForest\\n\\n let levelPairs = indentLevelsFromLines test\\n putStrLn \\\"\\\\n[(Level, Text)] list from lines:\\\\n\\\"\\n mapM_ print levelPairs\\n\\n putStrLn \\\"\\\\n\\\\nTrees from indented text:\\\\n\\\"\\n let trees = forestFromNestLevels levelPairs\\n putStrLn $ drawTree $ Node \\\"\\\" trees\\n\\n putStrLn \\\"Indented text from trees:\\\\n\\\"\\n putStrLn $ outlineFromForest (<>) \\\" \\\" trees\\n\\ntest :: [String]\\ntest =\\n [ \\\"RosettaCode\\\",\\n \\\" rocks\\\",\\n \\\" code\\\",\\n \\\" comparison\\\",\\n \\\" wiki\\\",\\n \\\" mocks\\\",\\n \\\" trolling\\\",\\n \\\"Some lists\\\",\\n \\\" may\\\",\\n \\\" be\\\",\\n \\\" irregular\\\"\\n ]\\n\\nnativeForest :: Forest String\\nnativeForest =\\n [ Node\\n \\\"RosettaCode\\\"\\n [ Node\\n \\\"rocks\\\"\\n [ Node \\\"code\\\" [],\\n Node \\\"comparison\\\" [],\\n Node \\\"wiki\\\" []\\n ],\\n Node\\n \\\"mocks\\\"\\n [Node \\\"trolling\\\" []]\\n ],\\n Node\\n \\\"Some lists\\\"\\n [ Node \\\"may\\\" [],\\n Node \\\"be\\\" [],\\n Node \\\"irregular\\\" []\\n ]\\n ]\\n\",\n \"language\": \"Haskell\"\n },\n {\n \"code\": \"public class TreeDatastructures {\\n\\n\\tpublic static void main(String[] args) {\\n\\t\\tString initialNested = \\\"\\\"\\\"\\n\\t Rosetta Code\\n\\t ....rocks\\n\\t ........code\\n\\t ........comparison\\n\\t ........wiki\\n\\t ....mocks\\n\\t ........trolling\\n\\t \\\"\\\"\\\";\\n\\t\\n\\t System.out.println(initialNested);\\n\\t\\n\\t String indented = nestedToIndented(initialNested);\\n\\t System.out.println(indented);\\n\\t\\n\\t String finalNested = indentedToNested(indented);\\n\\t System.out.println(finalNested);\\n\\n\\t final boolean equal = ( initialNested.compareTo(finalNested) == 0 );\\n\\t System.out.println(\\\"initialNested = finalNested ? \\\" + equal);\\n\\t}\\t\\n\\t\\n\\tprivate static String nestedToIndented(String nested) {\\n\\t\\tStringBuilder result = new StringBuilder();\\n\\t\\n\\t\\tfor ( String line : nested.split(LINE_END) ) {\\n\\t\\t\\tint index = 0;\\n\\t\\t\\twhile ( line.charAt(index) == '.' ) {\\n\\t\\t\\t\\tindex += 1;\\n\\t\\t\\t}\\t\\t\\t\\t\\t\\t\\n\\t\\t\\tresult.append(String.valueOf(index / 4) + \\\" \\\" + line.substring(index) + LINE_END);\\t\\t\\t\\n\\t\\t}\\n\\t\\t\\n\\t\\treturn result.toString();\\n\\t}\\t\\n\\n\\tprivate static String indentedToNested(String indented) {\\n\\t\\tStringBuilder result = new StringBuilder();\\n\\t\\t\\n\\t\\tfor ( String line : indented.split(LINE_END) ) {\\n\\t\\t\\tfinal int index = line.indexOf(' ');\\n\\t\\t\\tfinal int level = Integer.valueOf(line.substring(0, index));\\t\\t\\t\\n\\t\\t\\tfor ( int i = 0; i < level; i++ ) {\\n\\t\\t\\t\\tresult.append(\\\"....\\\");\\n\\t\\t\\t}\\n\\t\\t\\tresult.append(line.substring(index + 1) + LINE_END);\\n\\t\\t}\\t\\t\\n\\t\\t\\n\\t\\treturn result.toString();\\n\\t}\\n\\t\\n\\tprivate static final String LINE_END = \\\"\\\\n\\\";\\n\\n}\\n\",\n \"language\": \"Java\"\n },\n {\n \"code\": \"# node of a nested representation\\ndef NNode($name; $children): {$name, $children};\\n\\n# node of an indented representation:\\ndef INode($level; $name): {$level, $name};\\n\\n# Output: string representation of an NNode structure\\ndef printNest:\\n . as $nested\\n # input: string so far\\n | def printNest($n; $level):\\n if ($level == 0) then \\\"\\\\n==Nest form==\\\\n\\\\n\\\" else . end\\n | reduce ($n.children[], null) as $c ( . + \\\"\\\\((\\\" \\\" * $level) // \\\"\\\")\\\\($n.name)\\\\n\\\";\\n if $c == null then .\\n else . + (\\\" \\\" * ($level + 1)) | printNest($c; $level + 1)\\n end );\\n printNest($nested; 0);\\n\\n# input: an INode structure\\n# output: the corresponding NNode structure\\ndef toNest:\\n . as $in\\n | def toNest($iNodes; start; level):\\n { i: (start + 1),\\n n: (if (level == 0) then .name = $iNodes[0].name else . end)\\n }\\n | until ( (.i >= ($iNodes|length)) or .done;\\n if ($iNodes[.i].level == level + 1)\\n then .i as $i\\n\\t | (NNode($iNodes[$i].name; []) | toNest($iNodes; $i; level+1)) as $c\\n | .n.children += [$c]\\n else if ($iNodes[.i].level <= level) then .done = true else . end\\n end\\n | .i += 1 )\\n | .n ;\\n NNode(\\\"\\\"; []) | toNest($in; 0; 0);\\n\\n# Output: string representation of an INode structure\\ndef printIndent:\\n \\\"\\\\n==Indent form==\\\\n\\\\n\\\"\\n + reduce .[] as $n (\\\"\\\";\\n . + \\\"\\\\($n.level) \\\\($n.name)\\\\n\\\") ;\\n\\n# output: representation using INode\\ndef toIndent:\\n def toIndent($n; level):\\n . + [INode(level; $n.name)]\\n + reduce $n.children[] as $c ([];\\n toIndent($c; level+1) );\\n . as $in\\t\\n | [] | toIndent($in; 0);\\n\\n\\n### Example\\n\\ndef n: NNode(\\\"\\\"; []);\\ndef n1: NNode(\\\"RosettaCode\\\"; []);\\ndef n2: NNode(\\\"rocks\\\"; [NNode(\\\"code\\\"; []), NNode(\\\"comparison\\\"; []), NNode(\\\"wiki\\\"; [])] );\\ndef n3: NNode(\\\"mocks\\\"; [NNode(\\\"trolling\\\"; [])]);\\n\\ndef n123:\\n n1\\n | .children += [n2]\\n | .children += [n3];\\n\\n### The task\\ndef nested:\\n n123\\n | printNest ;\\n\\ndef indented:\\n n123\\n | toIndent\\n | printIndent;\\n\\ndef roundtrip:\\n n123\\n | toIndent\\n | toNest\\n | printNest;\\n\\ndef task:\\n nested as $nested\\n | roundtrip as $roundtrip\\n | $nested, indented, $roundtrip,\\n \\\"\\\\nRound trip test satisfied? \\\\($nested == $roundtrip)\\\" ;\\n\\ntask\\n\",\n \"language\": \"Jq\"\n },\n {\n \"code\": \"const nesttext = \\\"\\\"\\\"\\nRosettaCode\\n rocks\\n code\\n comparison\\n wiki\\n mocks\\n trolling\\n\\\"\\\"\\\"\\n\\nfunction nesttoindent(txt)\\n ret = \\\"\\\"\\n windent = gcd(length.([x.match for x in eachmatch(r\\\"\\\\s+\\\", txt)]) .- 1)\\n for lin in split(txt, \\\"\\\\n\\\")\\n ret *= isempty(lin) ? \\\"\\\\n\\\" : isspace(lin[1]) ?\\n replace(lin, r\\\"\\\\s+\\\" => (s) -> \\\"$(length(s)÷windent) \\\") * \\\"\\\\n\\\" :\\n \\\"0 \\\" * lin * \\\"\\\\n\\\"\\n end\\n return ret, \\\" \\\"^windent\\nend\\n\\nfunction indenttonest(txt, indenttext)\\n ret = \\\"\\\"\\n for lin in filter(x -> length(x) > 1, split(txt, \\\"\\\\n\\\"))\\n (num, name) = split(lin, r\\\"\\\\s+\\\", limit=2)\\n indentnum = parse(Int, num)\\n ret *= indentnum == 0 ? name * \\\"\\\\n\\\" : indenttext^indentnum * name * \\\"\\\\n\\\"\\n end\\n return ret\\nend\\n\\nindenttext, itext = nesttoindent(nesttext)\\nrestorednesttext = indenttonest(indenttext, itext)\\n\\nprintln(\\\"Original:\\\\n\\\", nesttext, \\\"\\\\n\\\")\\nprintln(\\\"Indent form:\\\\n\\\", indenttext, \\\"\\\\n\\\")\\nprintln(\\\"Back to nest form:\\\\n\\\", restorednesttext, \\\"\\\\n\\\")\\nprintln(\\\"original == restored: \\\", strip(nesttext) == strip(restorednesttext))\\n\",\n \"language\": \"Julia\"\n },\n {\n \"code\": \"import strformat, strutils\\n\\n\\n####################################################################################################\\n# Nested representation of trees.\\n# The tree is simply the first node.\\n\\ntype\\n\\n NNode*[T] = ref object\\n value*: T\\n children*: seq[NNode[T]]\\n\\n\\nproc newNNode*[T](value: T; children: varargs[NNode[T]]): NNode[T] =\\n ## Create a node.\\n NNode[T](value: value, children: @children)\\n\\n\\nproc add*[T](node: NNode[T]; children: varargs[NNode[T]]) =\\n ## Add a list of chlidren to a node.\\n node.children.add children\\n\\n\\nproc `$`*[T](node: NNode[T]; depth = 0): string =\\n ## Return a string representation of a tree/node.\\n result = repeat(' ', 2 * depth) & $node.value & '\\\\n'\\n for child in node.children:\\n result.add `$`(child, depth + 1)\\n\\n\\n####################################################################################################\\n# Indented representation of trees.\\n# The tree is described as the list of the nodes.\\n\\ntype\\n\\n INode*[T] = object\\n value*: T\\n level*: Natural\\n\\n ITree*[T] = seq[INode[T]]\\n\\n\\nproc initINode*[T](value: T; level: Natural): INode[T] =\\n ## Return a new node.\\n INode[T](value: value, level: level)\\n\\n\\nproc initItree*[T](value: T): ITree[T] =\\n ## Return a new tree initialized with the first node (root node).\\n result = @[initINode(value, 0)]\\n\\n\\nproc add*[T](tree: var ITree[T]; nodes: varargs[INode[T]]) =\\n ## Add a list of nodes to the tree.\\n for node in nodes:\\n if node.level - tree[^1].level > 1:\\n raise newException(ValueError, &\\\"wrong level {node.level} in node {node.value}.\\\")\\n tree.add node\\n\\n\\nproc `$`*[T](tree: ITree[T]): string =\\n ## Return a string representation of a tree.\\n for node in tree:\\n result.add $node.level & ' ' & $node.value & '\\\\n'\\n\\n\\n####################################################################################################\\n# Conversion between nested form and indented form.\\n\\nproc toIndented*[T](node: NNode[T]): Itree[T] =\\n ## Convert a tree in nested form to a tree in indented form.\\n\\n proc addNode[T](tree: var Itree[T]; node: NNode[T]; level: Natural) =\\n ## Add a node to the tree at the given level.\\n tree.add initINode(node.value, level)\\n for child in node.children:\\n tree.addNode(child, level + 1)\\n\\n result.addNode(node, 0)\\n\\n\\nproc toNested*[T](tree: Itree[T]): NNode[T] =\\n ## Convert a tree in indented form to a tree in nested form.\\n\\n var stack: seq[NNode[T]] # Note that stack.len is equal to the current level.\\n var nnode = newNNode(tree[0].value) # Root.\\n for i in 1..tree.high:\\n let inode = tree[i]\\n if inode.level > stack.len:\\n # Child.\\n stack.add nnode\\n elif inode.level == stack.len:\\n # Sibling.\\n stack[^1].children.add nnode\\n else:\\n # Branch terminated.\\n while inode.level < stack.len:\\n stack[^1].children.add nnode\\n nnode = stack.pop()\\n stack[^1].children.add nnode\\n\\n nnode = newNNode(inode.value)\\n\\n # Empty the stack.\\n while stack.len > 0:\\n stack[^1].children.add nnode\\n nnode = stack.pop()\\n\\n result = nnode\\n\\n\\n#———————————————————————————————————————————————————————————————————————————————————————————————————\\n\\nwhen isMainModule:\\n\\n echo \\\"Displaying tree built using nested structure:\\\"\\n let nestedTree = newNNode(\\\"RosettaCode\\\")\\n let rocks = newNNode(\\\"rocks\\\")\\n rocks.add newNNode(\\\"code\\\"), newNNode(\\\"comparison\\\"), newNNode(\\\"wiki\\\")\\n let mocks = newNNode(\\\"mocks\\\", newNNode(\\\"trolling\\\"))\\n nestedTree.add rocks, mocks\\n echo nestedTree\\n\\n echo \\\"Displaying tree converted to indented structure:\\\"\\n let indentedTree = nestedTree.toIndented\\n echo indentedTree\\n\\n echo \\\"Displaying tree converted back to nested structure:\\\"\\n echo indentedTree.toNested\\n\\n echo \\\"Are they equal? \\\", if $nestedTree == $indentedTree.toNested: \\\"yes\\\" else: \\\"no\\\"\\n\",\n \"language\": \"Nim\"\n },\n {\n \"code\": \"use strict;\\nuse warnings;\\nuse feature 'say';\\nuse JSON;\\nuse Data::Printer;\\n\\nmy $trees = <<~END;\\n RosettaCode\\n encourages\\n code\\n diversity\\n comparison\\n discourages\\n golfing\\n trolling\\n emphasising execution speed\\n code-golf.io\\n encourages\\n golfing\\n discourages\\n comparison\\n END\\n\\nmy $level = ' ';\\nsub nested_to_indent { shift =~ s#^($level*)# ($1 ? length($1)/length $level : 0) . ' ' #egmr }\\nsub indent_to_nested { shift =~ s#^(\\\\d+)\\\\s*# $level x $1 #egmr }\\n\\nsay my $indent = nested_to_indent $trees;\\n my $nest = indent_to_nested $indent;\\n\\nuse Test::More;\\nis($trees, $nest, 'Round-trip');\\ndone_testing();\\n\\n# Import outline paragraph into native data structure\\nsub import {\\n my($trees) = @_;\\n my $level = ' ';\\n my $forest;\\n my $last = -999;\\n\\n for my $branch (split /\\\\n/, $trees) {\\n $branch =~ m/(($level*))*/;\\n my $this = $1 ? length($1)/length($level) : 0;\\n $forest .= do {\\n if ($this gt $last) { '[' . trim_and_quote($branch) }\\n elsif ($this lt $last) { ']'x($last-$this).',' . trim_and_quote($branch) }\\n else { trim_and_quote($branch) }\\n };\\n $last = $this;\\n }\\n sub trim_and_quote { shift =~ s/^\\\\s*(.*\\\\S)\\\\s*$/\\\"$1\\\",/r }\\n\\n eval $forest . ']' x (1+$last);\\n}\\n\\nmy $forest = import $trees;\\nsay \\\"Native data structure:\\\\n\\\" . np $forest;\\nsay \\\"\\\\nJSON:\\\\n\\\" . encode_json($forest);\\n\",\n \"language\": \"Perl\"\n },\n {\n \"code\": \"-->\\n <span style=\\\"color: #008080;\\\">function</span> <span style=\\\"color: #000000;\\\">text_to_indent</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #004080;\\\">string</span> <span style=\\\"color: #000000;\\\">plain_text</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;\\\">plain_text</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #008000;\\\">\\\"\\\\n\\\"</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">no_empty</span><span style=\\\"color: #0000FF;\\\">:=</span><span style=\\\"color: #004600;\\\">true</span><span style=\\\"color: #0000FF;\\\">),</span>\\n <span style=\\\"color: #000000;\\\">parents</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: #004080;\\\">string</span> <span style=\\\"color: #000000;\\\">line</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">trim_tail</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: #000000;\\\">text</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">trim_head</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">line</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #004080;\\\">integer</span> <span style=\\\"color: #000000;\\\">indent</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">length</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">line</span><span style=\\\"color: #0000FF;\\\">)-</span><span style=\\\"color: #7060A8;\\\">length</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">text</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #000080;font-style:italic;\\\">-- remove any completed parents</span>\\n <span style=\\\"color: #008080;\\\">while</span> <span style=\\\"color: #7060A8;\\\">length</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">parents</span><span style=\\\"color: #0000FF;\\\">)</span> <span style=\\\"color: #008080;\\\">and</span> <span style=\\\"color: #000000;\\\">indent</span><span style=\\\"color: #0000FF;\\\"><=</span><span style=\\\"color: #000000;\\\">parents</span><span style=\\\"color: #0000FF;\\\">[$]</span> <span style=\\\"color: #008080;\\\">do</span>\\n <span style=\\\"color: #000000;\\\">parents</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">parents</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;\\\">end</span> <span style=\\\"color: #008080;\\\">while</span>\\n <span style=\\\"color: #000080;font-style:italic;\\\">-- append potential new parent</span>\\n <span style=\\\"color: #000000;\\\">parents</span> <span style=\\\"color: #0000FF;\\\">&=</span> <span style=\\\"color: #000000;\\\">indent</span>\\n <span style=\\\"color: #004080;\\\">integer</span> <span style=\\\"color: #000000;\\\">depth</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">length</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">parents</span><span style=\\\"color: #0000FF;\\\">)</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: #0000FF;\\\">{</span><span style=\\\"color: #000000;\\\">depth</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">text</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;\\\">lines</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;\\\">indent_to_nested</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #004080;\\\">sequence</span> <span style=\\\"color: #000000;\\\">indent</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #004080;\\\">integer</span> <span style=\\\"color: #000000;\\\">idx</span><span style=\\\"color: #0000FF;\\\">=</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">level</span><span style=\\\"color: #0000FF;\\\">=</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #004080;\\\">sequence</span> <span style=\\\"color: #000000;\\\">res</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #0000FF;\\\">{}</span>\\n <span style=\\\"color: #008080;\\\">while</span> <span style=\\\"color: #000000;\\\">idx</span><span style=\\\"color: #0000FF;\\\"><=</span><span style=\\\"color: #7060A8;\\\">length</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">indent</span><span style=\\\"color: #0000FF;\\\">)</span> <span style=\\\"color: #008080;\\\">do</span>\\n <span style=\\\"color: #0000FF;\\\">{</span><span style=\\\"color: #004080;\\\">integer</span> <span style=\\\"color: #000000;\\\">lvl</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #004080;\\\">string</span> <span style=\\\"color: #000000;\\\">text</span><span style=\\\"color: #0000FF;\\\">}</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">indent</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">idx</span><span style=\\\"color: #0000FF;\\\">]</span>\\n <span style=\\\"color: #008080;\\\">if</span> <span style=\\\"color: #000000;\\\">lvl</span><span style=\\\"color: #0000FF;\\\"><</span><span style=\\\"color: #000000;\\\">level</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: #004080;\\\">sequence</span> <span style=\\\"color: #000000;\\\">children</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">idx</span><span style=\\\"color: #0000FF;\\\">}</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">indent_to_nested</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">indent</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">idx</span><span style=\\\"color: #0000FF;\\\">+</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">level</span><span style=\\\"color: #0000FF;\\\">+</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">)</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;\\\">text</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">children</span><span style=\\\"color: #0000FF;\\\">})</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">while</span>\\n <span style=\\\"color: #008080;\\\">return</span> <span style=\\\"color: #0000FF;\\\">{</span><span style=\\\"color: #000000;\\\">res</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">idx</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;\\\">function</span> <span style=\\\"color: #000000;\\\">nested_to_indent</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #004080;\\\">sequence</span> <span style=\\\"color: #000000;\\\">nested</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #004080;\\\">integer</span> <span style=\\\"color: #000000;\\\">level</span><span style=\\\"color: #0000FF;\\\">=</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #004080;\\\">sequence</span> <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;\\\">nested</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;\\\">text</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #004080;\\\">sequence</span> <span style=\\\"color: #000000;\\\">children</span><span style=\\\"color: #0000FF;\\\">}</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">nested</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">i</span><span style=\\\"color: #0000FF;\\\">]</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;\\\">level</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">text</span><span style=\\\"color: #0000FF;\\\">})</span>\\n <span style=\\\"color: #000000;\\\">res</span> <span style=\\\"color: #0000FF;\\\">&=</span> <span style=\\\"color: #000000;\\\">nested_to_indent</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">children</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">level</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;\\\">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;\\\">constant</span> <span style=\\\"color: #000000;\\\">text</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #008000;\\\">\\\"\\\"\\\"\\n RosettaCode\\n encourages\\n code\\n diversity\\n comparison\\n discourages\\n emphasising execution speed\\n code-golf.io\\n encourages\\n golfing\\n discourages\\n comparison\\\"\\\"\\\"</span>\\n\\n <span style=\\\"color: #004080;\\\">sequence</span> <span style=\\\"color: #000000;\\\">indent</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">text_to_indent</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">text</span><span style=\\\"color: #0000FF;\\\">),</span>\\n <span style=\\\"color: #000000;\\\">nested</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">indent_to_nested</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">indent</span><span style=\\\"color: #0000FF;\\\">)[</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">],</span>\\n <span style=\\\"color: #000000;\\\">n2ichk</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">nested_to_indent</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">nested</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;\\\">\\\"Indent form:\\\\n\\\"</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #7060A8;\\\">pp</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">indent</span><span style=\\\"color: #0000FF;\\\">,{</span><span style=\\\"color: #000000;\\\">pp_Nest</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">1</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;\\\">\\\"\\\\nNested form:\\\\n\\\"</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #7060A8;\\\">pp</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">nested</span><span style=\\\"color: #0000FF;\\\">,{</span><span style=\\\"color: #000000;\\\">pp_Nest</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">8</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;\\\">\\\"\\\\nNested to indent:%s\\\\n\\\"</span><span style=\\\"color: #0000FF;\\\">,{</span><span style=\\\"color: #008080;\\\">iff</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">n2ichk</span><span style=\\\"color: #0000FF;\\\">==</span><span style=\\\"color: #000000;\\\">indent</span><span style=\\\"color: #0000FF;\\\">?</span><span style=\\\"color: #008000;\\\">\\\"same\\\"</span><span style=\\\"color: #0000FF;\\\">:</span><span style=\\\"color: #008000;\\\">\\\"***ERROR***\\\"</span><span style=\\\"color: #0000FF;\\\">)})</span>\\n<!--\\n\",\n \"language\": \"Phix\"\n },\n {\n \"code\": \"-->\\n <span style=\\\"color: #008080;\\\">type</span> <span style=\\\"color: #000000;\\\">indent_struct</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: #008080;\\\">if</span> <span style=\\\"color: #004080;\\\">sequence</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">o</span><span style=\\\"color: #0000FF;\\\">)</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;\\\">1</span> <span style=\\\"color: #008080;\\\">to</span> <span style=\\\"color: #7060A8;\\\">length</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">o</span><span style=\\\"color: #0000FF;\\\">)</span> <span style=\\\"color: #008080;\\\">do</span>\\n <span style=\\\"color: #004080;\\\">object</span> <span style=\\\"color: #000000;\\\">oi</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">o</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: #004080;\\\">sequence</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">oi</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #008080;\\\">or</span> <span style=\\\"color: #7060A8;\\\">length</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">oi</span><span style=\\\"color: #0000FF;\\\">)!=</span><span style=\\\"color: #000000;\\\">2</span>\\n <span style=\\\"color: #008080;\\\">or</span> <span style=\\\"color: #008080;\\\">not</span> <span style=\\\"color: #004080;\\\">integer</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">oi</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">])</span>\\n <span style=\\\"color: #008080;\\\">or</span> <span style=\\\"color: #008080;\\\">not</span> <span style=\\\"color: #004080;\\\">string</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">oi</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">2</span><span style=\\\"color: #0000FF;\\\">])</span> <span style=\\\"color: #008080;\\\">then</span>\\n <span style=\\\"color: #008080;\\\">return</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;\\\">for</span>\\n <span style=\\\"color: #008080;\\\">return</span> <span style=\\\"color: #004600;\\\">true</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">if</span>\\n <span style=\\\"color: #008080;\\\">return</span> <span style=\\\"color: #004600;\\\">false</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">type</span>\\n\\n <span style=\\\"color: #008080;\\\">type</span> <span style=\\\"color: #000000;\\\">nested_struct</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: #008080;\\\">if</span> <span style=\\\"color: #004080;\\\">sequence</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">o</span><span style=\\\"color: #0000FF;\\\">)</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;\\\">1</span> <span style=\\\"color: #008080;\\\">to</span> <span style=\\\"color: #7060A8;\\\">length</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">o</span><span style=\\\"color: #0000FF;\\\">)</span> <span style=\\\"color: #008080;\\\">do</span>\\n <span style=\\\"color: #004080;\\\">object</span> <span style=\\\"color: #000000;\\\">oi</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">o</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: #004080;\\\">sequence</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">oi</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #008080;\\\">or</span> <span style=\\\"color: #7060A8;\\\">length</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">oi</span><span style=\\\"color: #0000FF;\\\">)!=</span><span style=\\\"color: #000000;\\\">2</span>\\n <span style=\\\"color: #008080;\\\">or</span> <span style=\\\"color: #008080;\\\">not</span> <span style=\\\"color: #004080;\\\">string</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">oi</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">])</span>\\n <span style=\\\"color: #008080;\\\">or</span> <span style=\\\"color: #008080;\\\">not</span> <span style=\\\"color: #000000;\\\">nested_struct</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">oi</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">2</span><span style=\\\"color: #0000FF;\\\">])</span> <span style=\\\"color: #008080;\\\">then</span>\\n <span style=\\\"color: #008080;\\\">return</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;\\\">for</span>\\n <span style=\\\"color: #008080;\\\">return</span> <span style=\\\"color: #004600;\\\">true</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">if</span>\\n <span style=\\\"color: #008080;\\\">return</span> <span style=\\\"color: #004600;\\\">false</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">type</span>\\n\\n <span style=\\\"color: #000080;font-style:italic;\\\">-- and as above except:</span>\\n <span style=\\\"color: #008080;\\\">function</span> <span style=\\\"color: #000000;\\\">indent_to_nested</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">indent_struct</span> <span style=\\\"color: #000000;\\\">indent</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #004080;\\\">integer</span> <span style=\\\"color: #000000;\\\">idx</span><span style=\\\"color: #0000FF;\\\">=</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">level</span><span style=\\\"color: #0000FF;\\\">=</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #008080;\\\">function</span> <span style=\\\"color: #000000;\\\">nested_to_indent</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">nested_struct</span> <span style=\\\"color: #000000;\\\">nested</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #004080;\\\">integer</span> <span style=\\\"color: #000000;\\\">level</span><span style=\\\"color: #0000FF;\\\">=</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #000080;font-style:italic;\\\">-- also make the output sequences better typed:</span>\\n <span style=\\\"color: #000000;\\\">indent_struct</span> <span style=\\\"color: #000000;\\\">indent</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">text_to_indent</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">text</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #000000;\\\">nested_struct</span> <span style=\\\"color: #000000;\\\">nested</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">indent_to_nested</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">indent</span><span style=\\\"color: #0000FF;\\\">)[</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">]</span>\\n <span style=\\\"color: #000000;\\\">indent_struct</span> <span style=\\\"color: #000000;\\\">r2ichk</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">nested_to_indent</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">nested</span><span style=\\\"color: #0000FF;\\\">)</span>\\n<!--\\n\",\n \"language\": \"Phix\"\n },\n {\n \"code\": \"from pprint import pprint as pp\\n\\ndef to_indent(node, depth=0, flat=None):\\n if flat is None:\\n flat = []\\n if node:\\n flat.append((depth, node[0]))\\n for child in node[1]:\\n to_indent(child, depth + 1, flat)\\n return flat\\n\\ndef to_nest(lst, depth=0, level=None):\\n if level is None:\\n level = []\\n while lst:\\n d, name = lst[0]\\n if d == depth:\\n children = []\\n level.append((name, children))\\n lst.pop(0)\\n elif d > depth: # down\\n to_nest(lst, d, children)\\n elif d < depth: # up\\n return\\n return level[0] if level else None\\n\\nif __name__ == '__main__':\\n print('Start Nest format:')\\n nest = ('RosettaCode', [('rocks', [('code', []), ('comparison', []), ('wiki', [])]),\\n ('mocks', [('trolling', [])])])\\n pp(nest, width=25)\\n\\n print('\\\\n... To Indent format:')\\n as_ind = to_indent(nest)\\n pp(as_ind, width=25)\\n\\n print('\\\\n... To Nest format:')\\n as_nest = to_nest(as_ind)\\n pp(as_nest, width=25)\\n\\n if nest != as_nest:\\n print(\\\"Whoops round-trip issues\\\")\\n\",\n \"language\": \"Python\"\n },\n {\n \"code\": \"#`(\\nSort of vague as to what we are trying to accomplish here. If we are just\\ntrying to transform from one format to another, probably easiest to just\\nperform string manipulations.\\n)\\n\\nmy $level = ' ';\\n\\nmy $trees = q:to/END/;\\n RosettaCode\\n encourages\\n code\\n diversity\\n comparison\\n discourages\\n golfing\\n trolling\\n emphasising execution speed\\n code-golf.io\\n encourages\\n golfing\\n discourages\\n comparison\\n END\\n\\nsub nested-to-indent { $^str.subst: / ^^ ($($level))* /, -> $/ { \\\"{+$0} \\\" }, :g }\\nsub indent-to-nested { $^str.subst: / ^^ (\\\\d+) \\\\s* /, -> $/ { \\\"{$level x +$0}\\\" }, :g }\\n\\nsay $trees;\\nsay my $indent = $trees.&nested-to-indent;\\nsay my $nest = $indent.&indent-to-nested;\\n\\nuse Test;\\nis($trees, $nest, 'Round-trip equals original');\\n\\n#`(\\nIf, on the other hand, we want perform more complex transformations; better to\\nload it into a native data structure which will then allow us to manipulate it\\nhowever we like.\\n)\\n\\n# Import outline paragraph into native data structure\\nsub import (Str $trees, $level = ' ') {\\n my $forest;\\n my $last = -Inf;\\n\\n for $trees.lines -> $branch {\\n $branch ~~ / ($($level))* /;\\n my $this = +$0;\\n $forest ~= do {\\n given $this cmp $last {\\n when More { \\\"\\\\['{esc $branch.trim}', \\\" }\\n when Same { \\\"'{esc $branch.trim}', \\\" }\\n when Less { \\\"{']' x $last - $this}, '{esc $branch.trim}', \\\" }\\n }\\n }\\n $last = $this;\\n }\\n\\n sub esc { $^s.subst( /(<['\\\\\\\\]>)/, -> $/ { \\\"\\\\\\\\$0\\\" }, :g) }\\n\\n $forest ~= ']' x 1 + $last;\\n $forest.EVAL;\\n}\\n\\nmy $forest = import $trees;\\n\\nsay \\\"\\\\nNative data structure:\\\\n\\\", $forest.raku;\\n\\n{\\n use JSON::Fast;\\n say \\\"\\\\nJSON:\\\\n\\\", $forest.&to-json;\\n}\\n\\n{\\n use YAML;\\n say \\\"\\\\nYAML:\\\\n\\\", $forest.&dump;\\n}\\n\",\n \"language\": \"Raku\"\n },\n {\n \"code\": \"import \\\"./dynamic\\\" for Struct\\nimport \\\"./fmt\\\" for Fmt\\n\\nvar NNode = Struct.create(\\\"NNode\\\", [\\\"name\\\", \\\"children\\\"])\\nvar INode = Struct.create(\\\"INode\\\", [\\\"level\\\", \\\"name\\\"])\\n\\nvar sw = \\\"\\\"\\n\\nvar printNest // recursive\\nprintNest = Fn.new { |n, level|\\n if (level == 0) sw = sw + \\\"\\\\n==Nest form==\\\\n\\\\n\\\"\\n sw = sw + Fmt.swrite(\\\"$0s$s\\\\n\\\", \\\" \\\" * level, n.name)\\n for (c in n.children) {\\n sw = sw + (\\\" \\\" * (level + 1))\\n printNest.call(c, level+1)\\n }\\n}\\n\\nvar toNest // recursive\\ntoNest = Fn.new { |iNodes, start, level, n|\\n if (level == 0) n.name = iNodes[0].name\\n var i = start + 1\\n while (i < iNodes.count) {\\n if (iNodes[i].level == level + 1) {\\n var c = NNode.new(iNodes[i].name, [])\\n toNest.call(iNodes, i, level+1, c)\\n n.children.add(c)\\n } else if (iNodes[i].level <= level) return\\n i = i + 1\\n }\\n}\\n\\nvar printIndent = Fn.new { |iNodes|\\n sw = sw + \\\"\\\\n==Indent form==\\\\n\\\\n\\\"\\n for (n in iNodes) sw = sw + Fmt.swrite(\\\"$d $s\\\\n\\\", n.level, n.name)\\n}\\n\\nvar toIndent // recursive\\ntoIndent = Fn.new { |n, level, iNodes|\\n iNodes.add(INode.new(level, n.name))\\n for (c in n.children) toIndent.call(c, level+1, iNodes)\\n}\\n\\nvar n1 = NNode.new(\\\"RosettaCode\\\", [])\\nvar n2 = NNode.new(\\\"rocks\\\", [NNode.new(\\\"code\\\", []), NNode.new(\\\"comparison\\\", []), NNode.new(\\\"wiki\\\", [])])\\nvar n3 = NNode.new(\\\"mocks\\\", [NNode.new(\\\"trolling\\\", [])])\\nn1.children.add(n2)\\nn1.children.add(n3)\\n\\nprintNest.call(n1, 0)\\nvar s1 = sw\\nSystem.print(s1)\\n\\nvar iNodes = []\\ntoIndent.call(n1, 0, iNodes)\\nsw = \\\"\\\"\\nprintIndent.call(iNodes)\\nSystem.print(sw)\\n\\nvar n = NNode.new(\\\"\\\", [])\\ntoNest.call(iNodes, 0, 0, n)\\nsw = \\\"\\\"\\nprintNest.call(n, 0)\\nvar s2 = sw\\nSystem.print(s2)\\n\\nSystem.print(\\\"\\\\nRound trip test satisfied? %(s1 == s2)\\\")\\n\",\n \"language\": \"Wren\"\n },\n {\n \"code\": \"fcn nestToIndent(nestTree){\\n fcn(out,node,level){\\n out.append(List(level,node[0]));\\t// (n,name) or (\\\"..\\\",name)\\n if(node.len()>1){\\t\\t// (name children), (name, (tree))\\n\\t level+=1;\\n\\t foreach child in (node[1,*]){\\n\\t if(String.isType(child)) out.append(List(level,child));\\n\\t else self.fcn(out,child,level)\\n\\t }\\n }\\n out\\n }(List(),nestTree,0)\\n}\\nfcn nestToString(nestTree,dot=\\\".\\\"){\\n fcn(out,dot,node,level){\\n out.writeln(dot*level,node[0]);\\t// (name)\\n if(node.len()>1){\\t\\t\\t// (name children), (name, (tree))\\n\\t level+=1;\\n\\t foreach child in (node[1,*]){\\n\\t if(String.isType(child)) out.writeln(dot*level,child);\\n\\t else self.fcn(out,dot,child,level)\\n\\t }\\n }\\n out\\n }(Data(),dot,nestTree,0).text\\n}\\n\\nfcn indentToNest(iTree,depth=0,nTree=List()){\\n while(iTree){\\t// (n,name)\\n d, name := iTree[0];\\n if(d==depth){\\n nTree.append(name);\\n\\t iTree.pop(0);\\n }\\n else if(d>depth){\\t\\t// assume can't skip levels down\\n\\t if(nTree.len()>1 and not List.isType((nm:=nTree[-1]))){\\n\\t nTree[-1]=(children:=List(nm));\\n\\t indentToNest(iTree,d,children);\\n\\t }else{\\n\\t nTree.append(children:=List(name));\\n\\t iTree.pop(0);\\n\\t indentToNest(iTree,d+1,children);\\n\\t }\\n }\\n else break; // d<depth\\n }\\n return(nTree)\\n}\\nfcn indentToString(indentTree){ indentTree.apply(\\\"concat\\\",\\\" \\\").concat(\\\"\\\\n\\\") }\\n\",\n \"language\": \"Zkl\"\n },\n {\n \"code\": \"tree:=L(\\\"RosettaCode\\\",\\n L(\\\"rocks\\\",\\\"code\\\",\\\"comparison\\\",\\\"wiki\\\"),\\n\\t L(\\\"mocks\\\",\\\"golfing\\\") );\\n\\nprintln(\\\"Nest tree internal format:\\\\n\\\",tree.toString(*,*));\\nprintln(\\\"Formated:\\\\n\\\",nestToString(tree));\\n\\nindentTree:=nestToIndent(tree);\\nprintln(\\\"To indent format:\\\\n\\\",indentToString(indentTree));\\n\\nnestTree:=indentToNest(indentTree);\\nprintln(\\\"\\\\nIndent to nested format:\\\\n\\\",nestTree);\\nprintln(\\\"Is this tree the same as what we started with? \\\",nestTree==tree);\\n\",\n \"language\": \"Zkl\"\n },\n {\n \"code\": \"rakutrees:=L(\\n L(\\\"RosettaCode\\\",\\n L(\\\"encourages\\\",\\n L(\\\"code\\\",\\n\\t \\\"diversity\\\",\\\"comparison\\\")),\\n L(\\\"discourages\\\",\\n \\\"golfing\\\",\\\"trolling\\\",\\\"emphasising execution speed\\\"),\\n ),\\n L(\\\"code-golf.io\\\",\\n L(\\\"encourages\\\",\\\"golfing\\\"),\\n L(\\\"discourages\\\",\\\"comparison\\\"),\\n )\\n);\\nprintln(rakutrees.apply(nestToString).concat());\\niTrees := rakutrees.apply(nestToIndent);\\nprintln(iTrees.apply(indentToString).concat(\\\"\\\\n\\\"));\\n(iTrees.apply(indentToNest)==rakutrees).println();\\n\",\n \"language\": \"Zkl\"\n }\n]","isConversational":false},"task_name":{"kind":"string","value":"Tree-datastructures"}}},{"rowIdx":1770,"cells":{"solutions":{"kind":"list like","value":[{"code":"---\nfrom: http://rosettacode.org/wiki/Tree_from_nesting_levels\n","language":"00-META"},{"code":"Given a flat list of integers greater than zero, representing object nesting\nlevels, e.g. <code>[1, 2, 4]</code>,\ngenerate a tree formed from nested lists of those nesting level integers where:\n* Every int appears, in order, at its depth of nesting.\n* If the next level int is greater than the previous then it appears in a sub-list of the list containing the previous item\n\n\nThe generated tree data structure should ideally be in a languages nested list format that can\nbe used for further calculations rather than something just calculated for printing.\n\n\nAn input of <code>[1, 2, 4]</code> should produce the equivalent of: <code><nowiki>[1, [2, [[4]]]]</nowiki></code>\nwhere 1 is at depth1, 2 is two deep and 4 is nested 4 deep.\n\n<code>[1, 2, 4, 2, 2, 1]</code> should produce <code><nowiki>[1, [2, [[4]], 2, 2], 1]</nowiki></code>. <br>\nAll the nesting integers are in the same order but at the correct nesting\nlevels.\n\nSimilarly <code>[3, 1, 3, 1]</code> should generate <code><nowiki>[[[3]], 1, [[3]], 1]</nowiki></code>\n\n;Task:\nGenerate and show here the results for the following inputs:\n:* <code>[]</code>\n:* <code>[1, 2, 4]</code>\n:* <code>[3, 1, 3, 1]</code>\n:* <code>[1, 2, 3, 1]</code>\n:* <code>[3, 2, 1, 3]</code>\n:* <code>[3, 3, 3, 1, 1, 3, 3, 3]</code>\n\n\n","language":"00-TASK"},{"code":"on treeFromNestingLevels(input)\n set maxLevel to 0\n repeat with thisLevel in input\n if (thisLevel > maxLevel) then set maxLevel to thisLevel\n end repeat\n if (maxLevel < 2) then return input\n\n set emptyList to {}\n repeat with testLevel from maxLevel to 2 by -1\n set output to {}\n set subnest to {}\n repeat with thisLevel in input\n set thisLevel to thisLevel's contents\n if ((thisLevel's class is integer) and (thisLevel < testLevel)) then\n if (subnest ≠ emptyList) then set subnest to {}\n set end of output to thisLevel\n else\n if (subnest = emptyList) then set end of output to subnest\n set end of subnest to thisLevel\n end if\n end repeat\n set input to output\n end repeat\n\n return output\nend treeFromNestingLevels\n\n-- Task code:\nlocal output, astid, input, part1, errMsg\nset output to {}\nset astid to AppleScript's text item delimiters\nrepeat with input in {{}, {1, 2, 4}, {3, 1, 3, 1}, {1, 2, 3, 1}, {3, 2, 1, 3}, {3, 3, 3, 1, 1, 3, 3, 3}}\n set input to input's contents\n set AppleScript's text item delimiters to \", \"\n set part1 to \"{\" & input & \"} nests to: {\"\n -- It's a pain having to parse nested lists to text, so throw a deliberate error and parse the error message instead.\n try\n || of treeFromNestingLevels(input)\n on error errMsg\n set AppleScript's text item delimiters to {\"{\", \"}\"}\n set end of output to part1 & ((text from text item 2 to text item -2 of errMsg) & \"}\")\n end try\nend repeat\nset AppleScript's text item delimiters to linefeed\nset output to output as text\nset AppleScript's text item delimiters to astid\nreturn output\n","language":"AppleScript"},{"code":"\"{} nests to: {}\n{1, 2, 4} nests to: {1, {2, {{4}}}}\n{3, 1, 3, 1} nests to: {{{3}}, 1, {{3}}, 1}\n{1, 2, 3, 1} nests to: {1, {2, {3}}, 1}\n{3, 2, 1, 3} nests to: {{{3}, 2}, 1, {{3}}}\n{3, 3, 3, 1, 1, 3, 3, 3} nests to: {{{3, 3, 3}}, 1, 1, {{3, 3, 3}}}\"\n","language":"AppleScript"},{"code":"on treeFromNestingLevels(input)\n script recursion\n property emptyList : {}\n\n on recurse(input, currentLevel)\n set output to {}\n set subnest to {}\n repeat with thisLevel in input\n set thisLevel to thisLevel's contents\n if (thisLevel > currentLevel) then\n set end of subnest to thisLevel\n else\n if (subnest ≠ emptyList) then\n set end of output to recurse(subnest, currentLevel + 1)\n set subnest to {}\n end if\n set end of output to thisLevel\n end if\n end repeat\n if (subnest ≠ emptyList) then set end of output to recurse(subnest, currentLevel + 1)\n\n return output\n end recurse\n end script\n\n return recursion's recurse(input, 1)\nend treeFromNestingLevels\n","language":"AppleScript"},{"code":"----------------- FOREST FROM NEST LEVELS ----------------\n\n-- forestFromNestLevels :: [(Int, a)] -> [Tree a]\non forestFromNestLevels(pairs)\n script go\n on |λ|(xs)\n if {} ≠ xs then\n set {n, v} to item 1 of xs\n\n script deeper\n on |λ|(x)\n n < item 1 of x\n end |λ|\n end script\n set {descendants, rs} to ¬\n |λ|(rest of xs) of span(deeper)\n\n {Node(v, |λ|(descendants))} & |λ|(rs)\n else\n {}\n end if\n end |λ|\n end script\n |λ|(pairs) of go\nend forestFromNestLevels\n\n\n-- nestedList :: Maybe Int -> Nest -> Nest\non nestedList(maybeLevel, xs)\n set subTree to concat(xs)\n if maybeLevel ≠ missing value then\n if {} ≠ subTree then\n {maybeLevel, subTree}\n else\n {maybeLevel}\n end if\n else\n {subTree}\n end if\nend nestedList\n\n\n-- treeFromSparseLevelList :: [Int] -> Tree Maybe Int\non treeFromSparseLevelList(xs)\n {missing value, ¬\n forestFromNestLevels(rooted(normalized(xs)))}\nend treeFromSparseLevelList\n\n-------------------------- TESTS -------------------------\non run\n set tests to {¬\n {}, ¬\n {1, 2, 4}, ¬\n {3, 1, 3, 1}, ¬\n {1, 2, 3, 1}, ¬\n {3, 2, 1, 3}, ¬\n {3, 3, 3, 1, 1, 3, 3, 3}}\n\n script translate\n on |λ|(ns)\n set tree to treeFromSparseLevelList(ns)\n\n set bracketNest to root(foldTree(my nestedList, tree))\n\n set returnTrip to foldTree(my levelList, tree)\n\n map(my showList, {ns, bracketNest, returnTrip})\n end |λ|\n end script\n\n set testResults to {{\"INPUT\", \"NESTED\", \"ROUND-TRIP\"}} & map(translate, tests)\n\n set {firstColWidth, secondColWidth} to map(widest(testResults), {fst, snd})\n\n script display\n on |λ|(triple)\n intercalate(\" -> \", ¬\n {justifyRight(firstColWidth, space, item 1 of triple)} & ¬\n {justifyLeft(secondColWidth, space, item 2 of triple)} & ¬\n {item 3 of triple})\n end |λ|\n end script\n linefeed & unlines(map(display, testResults))\nend run\n\n\n-- widest :: ((a, a) -> a) -> [String] -> Int\non widest(xs)\n script\n on |λ|(f)\n maximum(map(compose(my |length|, mReturn(f)), xs))\n end |λ|\n end script\nend widest\n\n\n-------------- FROM TREE BACK TO SPARSE LIST -------------\n\n-- levelListFromNestedList :: Maybe a -> NestedList -> [a]\non levelList(maybeLevel, xs)\n if maybeLevel ≠ missing value then\n concat(maybeLevel & xs)\n else\n concat(xs)\n end if\nend levelList\n\n\n----- NORMALIZED TO A STRICTER GENERIC DATA STRUCTURE ----\n\n-- normalized :: [Int] -> [(Int, Maybe Int)]\non normalized(xs)\n -- Explicit representation of implicit nodes.\n\n if {} ≠ xs then\n set x to item 1 of xs\n if 1 > x then\n normalized(rest of xs)\n else\n set h to {{x, x}}\n if 1 = length of xs then\n h\n else\n if 1 < ((item 2 of xs) - x) then\n set ys to h & {{1 + x, missing value}}\n else\n set ys to h\n end if\n ys & normalized(rest of xs)\n end if\n end if\n else\n {}\n end if\nend normalized\n\n\n-- rooted :: [(Int, Maybe Int)] -> [(Int, Maybe Int)]\non rooted(pairs)\n -- Path from the virtual root to the first explicit node.\n if {} ≠ pairs then\n set {n, _} to item 1 of pairs\n if 1 ≠ n then\n script go\n on |λ|(x)\n {x, missing value}\n end |λ|\n end script\n map(go, enumFromTo(1, n - 1)) & pairs\n else\n pairs\n end if\n else\n {}\n end if\nend rooted\n\n------------------ GENERIC TREE FUNCTIONS ----------------\n\n-- Node :: a -> [Tree a] -> Tree a\non Node(v, xs)\n -- {type:\"Node\", root:v, nest:xs}\n {v, xs}\nend Node\n\n\n-- foldTree :: (a -> [b] -> b) -> Tree a -> b\non foldTree(f, tree)\n script go\n property g : mReturn(f)\n on |λ|(tree)\n tell g to |λ|(root(tree), map(go, nest(tree)))\n end |λ|\n end script\n |λ|(tree) of go\nend foldTree\n\n\n-- nest :: Tree a -> [a]\non nest(oTree)\n item 2 of oTree\n -- nest of oTree\nend nest\n\n\n-- root :: Tree a -> a\non root(oTree)\n item 1 of oTree\n -- root of oTree\nend root\n\n\n---------------------- OTHER GENERIC ---------------------\n\n-- compose (<<<) :: (b -> c) -> (a -> b) -> a -> c\non compose(f, g)\n script\n property mf : mReturn(f)\n property mg : mReturn(g)\n on |λ|(x)\n mf's |λ|(mg's |λ|(x))\n end |λ|\n end script\nend compose\n\n\n-- concat :: [[a]] -> [a]\non concat(xs)\n set lng to length of xs\n set acc to {}\n repeat with i from 1 to lng\n set acc to acc & item i of xs\n end repeat\n acc\nend concat\n\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 lst\n else\n {}\n end if\nend enumFromTo\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-- 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\n-- intercalate :: String -> [String] -> String\non intercalate(delim, xs)\n set {dlm, my text item delimiters} to ¬\n {my text item delimiters, delim}\n set s to xs as text\n set my text item delimiters to dlm\n s\nend intercalate\n\n\n-- justifyLeft :: Int -> Char -> String -> String\non justifyLeft(n, cFiller, strText)\n if n > length of strText then\n text 1 thru n of (strText & replicate(n, cFiller))\n else\n strText\n end if\nend justifyLeft\n\n\n-- justifyRight :: Int -> Char -> String -> String\non justifyRight(n, cFiller, strText)\n if n > length of strText then\n text -n thru -1 of ((replicate(n, cFiller) as text) & strText)\n else\n strText\n end if\nend justifyRight\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-- 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\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-- maximum :: Ord a => [a] -> a\non maximum(xs)\n script\n on |λ|(a, b)\n if a is missing value or b > a then\n b\n else\n a\n end if\n end |λ|\n end script\n\n foldl(result, missing value, xs)\nend maximum\n\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 -> String -> String\non replicate(n, s)\n -- Egyptian multiplication - progressively doubling a list,\n -- appending stages of doubling to an accumulator where needed\n -- for binary assembly of a target length\n script p\n on |λ|({n})\n n ≤ 1\n end |λ|\n end script\n\n script f\n on |λ|({n, dbl, out})\n if (n mod 2) > 0 then\n set d to out & dbl\n else\n set d to out\n end if\n {n div 2, dbl & dbl, d}\n end |λ|\n end script\n\n set xs to |until|(p, f, {n, s, \"\"})\n item 2 of xs & item 3 of xs\nend replicate\n\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\n-- showList :: [a] -> String\non showList(xs)\n \"[\" & intercalate(\", \", map(my show, xs)) & \"]\"\nend showList\n\n\non show(v)\n if list is class of v then\n showList(v)\n else\n v as text\n end if\nend show\n\n\n-- span :: (a -> Bool) -> [a] -> ([a], [a])\non span(f)\n -- The longest (possibly empty) prefix of xs\n -- that contains only elements satisfying p,\n -- tupled with the remainder of xs.\n -- span(p, xs) eq (takeWhile(p, xs), dropWhile(p, xs))\n script\n on |λ|(xs)\n set lng to length of xs\n set i to 0\n tell mReturn(f)\n repeat while lng > i and |λ|(item (1 + i) of xs)\n set i to 1 + i\n end repeat\n end tell\n splitAt(i, xs)\n end |λ|\n end script\nend span\n\n\n-- splitAt :: Int -> [a] -> ([a], [a])\non splitAt(n, xs)\n if n > 0 and n < length of xs then\n if class of xs is text then\n {items 1 thru n of xs as text, ¬\n items (n + 1) thru -1 of xs as text}\n else\n {items 1 thru n of xs, items (n + 1) thru -1 of xs}\n end if\n else\n if n < 1 then\n {{}, xs}\n else\n {xs, {}}\n end if\n end if\nend splitAt\n\n\n-- unlines :: [String] -> String\non unlines(xs)\n -- A single string formed by the intercalation\n -- of a list of strings with the newline character.\n set {dlm, my text item delimiters} to ¬\n {my text item delimiters, linefeed}\n set s to xs as text\n set my text item delimiters to dlm\n s\nend unlines\n\n\n-- until :: (a -> Bool) -> (a -> a) -> a -> a\non |until|(p, f, x)\n set v to x\n set mp to mReturn(p)\n set mf to mReturn(f)\n repeat until mp's |λ|(v)\n set v to mf's |λ|(v)\n end repeat\n v\nend |until|\n","language":"AppleScript"},{"code":"#include <any>\n#include <iostream>\n#include <iterator>\n#include <vector>\n\nusing namespace std;\n\n// Make a tree that is a vector of either values or other trees\nvector<any> MakeTree(input_iterator auto first, input_iterator auto last, int depth = 1)\n{\n vector<any> tree;\n while (first < last && depth <= *first)\n {\n if(*first == depth)\n {\n // add a single value\n tree.push_back(*first);\n ++first;\n }\n else // (depth < *b)\n {\n // add a subtree\n tree.push_back(MakeTree(first, last, depth + 1));\n first = find(first + 1, last, depth);\n }\n }\n\n return tree;\n}\n\n// Print an input vector or tree\nvoid PrintTree(input_iterator auto first, input_iterator auto last)\n{\n cout << \"[\";\n for(auto it = first; it != last; ++it)\n {\n if(it != first) cout << \", \";\n if constexpr (is_integral_v<remove_reference_t<decltype(*first)>>)\n {\n // for printing the input vector\n cout << *it;\n }\n else\n {\n // for printing the tree\n if(it->type() == typeid(unsigned int))\n {\n // a single value\n cout << any_cast<unsigned int>(*it);\n }\n else\n {\n // a subtree\n const auto& subTree = any_cast<vector<any>>(*it);\n PrintTree(subTree.begin(), subTree.end());\n }\n }\n }\n cout << \"]\";\n}\n\nint main(void)\n{\n auto execises = vector<vector<unsigned int>> {\n {},\n {1, 2, 4},\n {3, 1, 3, 1},\n {1, 2, 3, 1},\n {3, 2, 1, 3},\n {3, 3, 3, 1, 1, 3, 3, 3}\n };\n\n for(const auto& e : execises)\n {\n auto tree = MakeTree(e.begin(), e.end());\n PrintTree(e.begin(), e.end());\n cout << \" Nests to:\\n\";\n PrintTree(tree.begin(), tree.end());\n cout << \"\\n\\n\";\n }\n}\n","language":"C++"},{"code":"const TreeData1: array [0..0] of integer = (0);\nconst TreeData2: array [0..2] of integer = (1, 2, 4);\nconst TreeData3: array [0..3] of integer = (3, 1, 3, 1);\nconst TreeData4: array [0..3] of integer = (1, 2, 3, 1);\nconst TreeData5: array [0..3] of integer = (3, 2, 1, 3);\nconst TreeData6: array [0..7] of integer = (3, 3, 3, 1, 1, 3, 3, 3);\n\n\nfunction GetDataString(Data: array of integer): string;\nvar I: integer;\nbegin\nResult:='[';\nfor I:=0 to High(Data) do\n\tbegin\n\tif I<>0 then Result:=Result+', ';\n\tResult:=Result+IntToStr(Data[I]);\n\tend;\nResult:=Result+']';\nend;\n\n\nfunction GetNestingLevel(Data: array of integer): string;\nvar Level,Level2: integer;\nvar I,J,HLen: integer;\nbegin\nLevel:=0;\nResult:='';\nfor I:=0 to High(Data) do\n\tbegin\n\tLevel2:=Data[I];\n\tif Level2>Level then for J:=Level to Level2-1 do Result:=Result+'['\n\telse if Level2<Level then\n\t\tbegin\n\t\tfor J:=Level-1 downto Level2 do Result:=Result+']';\n\t\tResult:=Result+', ';\n\t\tend\n\telse if Level2=0 then\n\t\tbegin\n\t\tResult:='[]';\n\t\tbreak;\n\t\tend\n\telse Result:=Result+', ';\n\tResult:=Result+IntToStr(Level2);\n\tLevel:=Level2;\n\tif (I<High(Data)) and (Level<Data[I+1]) then Result:=Result+', ';\n\tend;\nfor J:=Level downto 1 do Result:=Result+']';\nend;\n\n\nprocedure ShowNestData(Memo: TMemo; Data: array of integer);\nbegin\nMemo.Lines.Add(GetDataString(Data)+' Nests to: ');\nMemo.Lines.Add(GetNestingLevel(Data));\nMemo.Lines.Add('');\nend;\n\nprocedure ShowNestingLevels(Memo: TMemo);\nvar S: string;\nbegin\nShowNestData(Memo,TreeData1);\nShowNestData(Memo,TreeData2);\nShowNestData(Memo,TreeData3);\nShowNestData(Memo,TreeData4);\nShowNestData(Memo,TreeData5);\nShowNestData(Memo,TreeData6);\nend;\n","language":"Delphi"},{"code":"Sub ShowTree(List() As Integer)\n Dim As Integer I, NestLevel = 0\n For I = 0 To Ubound(List)\n While List(I) < NestLevel\n Print \"]\";\n NestLevel -= 1\n Wend\n If List(I) = 0 Then\n Print\n Elseif I <> Lbound(List) Then Print \", \";\n End If\n While List(I) > NestLevel\n Print \"[\";\n NestLevel += 1\n Wend\n If NestLevel <> 0 Then Print NestLevel;\n Next I\nEnd Sub\n\nDim As Integer list(0 To ...) = {0}\nShowTree(list())\nDim As Integer list0(0 To ...) = {1, 2, 4, 0}\nShowTree(list0())\nDim As Integer list1(0 To ...) = {3, 1, 3, 1, 0}\nShowTree(list1())\nDim As Integer list2(0 To ...) = {1, 2, 3, 1, 0}\nShowTree(list2())\nDim As Integer list3(0 To ...) = {3, 2, 1, 3, 0}\nShowTree(list3())\nDim As Integer list4(0 To ...) = {3, 3, 3, 1, 1, 3, 3, 3, 0}\nShowTree(list4())\nDim As Integer list5(0 To ...) = {1, 2, 4, 2, 2, 1, 0}\nShowTree(list5())\n\nSleep\n","language":"FreeBASIC"},{"code":"package main\n\nimport \"fmt\"\n\ntype any = interface{}\n\nfunc toTree(list []int) any {\n s := []any{[]any{}}\n for _, n := range list {\n for n != len(s) {\n if n > len(s) {\n inner := []any{}\n s[len(s)-1] = append(s[len(s)-1].([]any), inner)\n s = append(s, inner)\n } else {\n s = s[0 : len(s)-1]\n }\n }\n s[len(s)-1] = append(s[len(s)-1].([]any), n)\n for i := len(s) - 2; i >= 0; i-- {\n le := len(s[i].([]any))\n s[i].([]any)[le-1] = s[i+1]\n }\n }\n return s[0]\n}\n\nfunc main() {\n tests := [][]int{\n {},\n {1, 2, 4},\n {3, 1, 3, 1},\n {1, 2, 3, 1},\n {3, 2, 1, 3},\n {3, 3, 3, 1, 1, 3, 3, 3},\n }\n for _, test := range tests {\n nest := toTree(test)\n fmt.Printf(\"%17s => %v\\n\", fmt.Sprintf(\"%v\", test), nest)\n }\n}\n","language":"Go"},{"code":"package main\n\nimport \"fmt\"\n\ntype any = interface{}\n\nfunc toTree(list []int, index, depth int) (int, []any) {\n var soFar []any\n for index < len(list) {\n t := list[index]\n if t == depth {\n soFar = append(soFar, t)\n } else if t > depth {\n var deeper []any\n index, deeper = toTree(list, index, depth+1)\n soFar = append(soFar, deeper)\n } else {\n index = index - 1\n break\n }\n index = index + 1\n }\n if depth > 1 {\n return index, soFar\n }\n return -1, soFar\n}\n\nfunc main() {\n tests := [][]int{\n {},\n {1, 2, 4},\n {3, 1, 3, 1},\n {1, 2, 3, 1},\n {3, 2, 1, 3},\n {3, 3, 3, 1, 1, 3, 3, 3},\n }\n for _, test := range tests {\n _, nest := toTree(test, 0, 1)\n fmt.Printf(\"%17s => %v\\n\", fmt.Sprintf(\"%v\", test), nest)\n }\n}\n","language":"Go"},{"code":";; helper function that finds the rest that are less than or equal\n(define (rest-less-eq x ls)\n (cond\n ((null? ls) #f)\n ((<= (car ls) x) ls)\n (else (rest-less-eq x (cdr ls)))))\n\n;; nest the input as a tree\n(define (make-tree input depth)\n (cond\n ((null? input) '())\n ((eq? input #f ) '())\n ((= depth (car input))\n (cons (car input)(make-tree(cdr input) depth)))\n ((< depth (car input))\n (cons (make-tree input (+ depth 1))\n\t (make-tree (rest-less-eq depth input) depth)))\n (#t '())\n ))\n\n(define examples\n '(()\n (1 2 4)\n (3 1 3 1)\n (1 2 3 1)\n (3 2 1 3)\n (3 3 3 1 1 3 3 3)))\n\n(define (run-examples x)\n (if (null? x) '()\n (begin\n\t(display (car x))(display \" -> \")\n\t(display (make-tree(car x) 1))(display \"\\n\")\n\t(run-examples (cdr x)))))\n\n(run-examples examples)\n","language":"Guile"},{"code":"{-# LANGUAGE TupleSections #-}\n\nimport Data.Bifunctor (bimap)\nimport Data.Tree (Forest, Tree (..), drawTree, foldTree)\n\n------------- TREE FROM NEST LEVELS (AND BACK) -----------\n\ntreeFromSparseLevels :: [Int] -> Tree (Maybe Int)\ntreeFromSparseLevels =\n Node Nothing\n . forestFromNestLevels\n . rooted\n . normalised\n\nsparseLevelsFromTree :: Tree (Maybe Int) -> [Int]\nsparseLevelsFromTree = foldTree go\n where\n go Nothing xs = concat xs\n go (Just x) xs = x : concat xs\n\nforestFromNestLevels :: [(Int, a)] -> Forest a\nforestFromNestLevels = go\n where\n go [] = []\n go ((n, v) : xs) =\n uncurry (:) $\n bimap (Node v . go) go (span ((n <) . fst) xs)\n\n--------------------- TEST AND DISPLAY -------------------\nmain :: IO ()\nmain =\n mapM_\n ( \\xs ->\n putStrLn (\"From: \" <> show xs)\n >> let tree = treeFromSparseLevels xs\n in putStrLn ((drawTree . fmap show) tree)\n >> putStrLn\n ( \"Back to: \"\n <> show (sparseLevelsFromTree tree)\n <> \"\\n\\n\"\n )\n )\n [ [],\n [1, 2, 4],\n [3, 1, 3, 1],\n [1, 2, 3, 1],\n [3, 2, 1, 3],\n [3, 3, 3, 1, 1, 3, 3, 3]\n ]\n\n----------- MAPPING TO A STRICTER DATA STRUCTURE ---------\n\n-- Path from the virtual root to the first explicit node.\nrooted :: [(Int, Maybe Int)] -> [(Int, Maybe Int)]\nrooted [] = []\nrooted xs = go $ filter ((1 <=) . fst) xs\n where\n go xs@((1, mb) : _) = xs\n go xs@((n, mb) : _) =\n fmap (,Nothing) [1 .. pred n] <> xs\n\n-- Representation of implicit nodes.\nnormalised [] = []\nnormalised [x] = [(x, Just x)]\nnormalised (x : y : xs)\n | 1 < (y - x) =\n (x, Just x) :\n (succ x, Nothing) : normalised (y : xs)\n | otherwise = (x, Just x) : normalised (y : xs)\n","language":"Haskell"},{"code":" [[[3]], 1, [[3]], 1\n1 1\n [[[3]], 1, [[3]], 1]\n|syntax error\n","language":"J"},{"code":"NB. first we nest each integer to the required depth, independently\nNB. then we recursively merge deep boxes\nNB. for consistency, if there are no integers, we box that empty list\ndtree=: {{\n <^:(0=L.) merge <^:]each y\n}}\n\nmerge=: {{\n if.(0=#$y)+.2>L.y do.y return.end. NB. done if no deep boxes left\n shallow=. 2 > L.\"0 y NB. locate shallow boxes\n group=. shallow} (+/\\ shallow),:-#\\y NB. find groups of adjacent deep boxes\n merge each group ,each//. y NB. combine them and recursively merge their contents\n}}\n","language":"J"},{"code":" dtree ''\n┌┐\n││\n└┘\n dtree 1 2 4\n┌─────────────┐\n│┌─┬─────────┐│\n││1│┌─┬─────┐││\n││ ││2│┌───┐│││\n││ ││ ││┌─┐││││\n││ ││ │││4│││││\n││ ││ ││└─┘││││\n││ ││ │└───┘│││\n││ │└─┴─────┘││\n│└─┴─────────┘│\n└─────────────┘\n dtree 3 1 3 1\n┌─────────────────┐\n│┌─────┬─┬─────┬─┐│\n││┌───┐│1│┌───┐│1││\n│││┌─┐││ ││┌─┐││ ││\n││││3│││ │││3│││ ││\n│││└─┘││ ││└─┘││ ││\n││└───┘│ │└───┘│ ││\n│└─────┴─┴─────┴─┘│\n└─────────────────┘\n dtree 1 2 3 1\n┌─────────────┐\n│┌─┬───────┬─┐│\n││1│┌─┬───┐│1││\n││ ││2│┌─┐││ ││\n││ ││ ││3│││ ││\n││ ││ │└─┘││ ││\n││ │└─┴───┘│ ││\n│└─┴───────┴─┘│\n└─────────────┘\n dtree 3 2 1 3\n┌─────────────────┐\n│┌───────┬─┬─────┐│\n││┌───┬─┐│1│┌───┐││\n│││┌─┐│2││ ││┌─┐│││\n││││3││ ││ │││3││││\n│││└─┘│ ││ ││└─┘│││\n││└───┴─┘│ │└───┘││\n│└───────┴─┴─────┘│\n└─────────────────┘\n dtree 3 3 3 1 1 3 3 3\n┌─────────────────────────┐\n│┌─────────┬─┬─┬─────────┐│\n││┌───────┐│1│1│┌───────┐││\n│││┌─┬─┬─┐││ │ ││┌─┬─┬─┐│││\n││││3│3│3│││ │ │││3│3│3││││\n│││└─┴─┴─┘││ │ ││└─┴─┴─┘│││\n││└───────┘│ │ │└───────┘││\n│└─────────┴─┴─┴─────────┘│\n└─────────────────────────┘\n","language":"J"},{"code":" t=: ;:'(a b c) d (e f g)'\n p=: ;:'()'\n d=: +/\\-/p=/t\n k=: =/p=/t\n merge d <@]^:[&.>&(k&#) t\n┌───────┬─┬───────┐\n│┌─┬─┬─┐│d│┌─┬─┬─┐│\n││a│b│c││ ││e│f│g││\n│└─┴─┴─┘│ │└─┴─┴─┘│\n└───────┴─┴───────┘\n","language":"J"},{"code":"pnest=: {{\n t=. ;:y NB. tokens\n p=. (;:'()')=/t NB. paren token matches\n d=: +/\\-/p NB. paren token depths\n k=: =/p NB. keep non-paren tokens\n merge d <@]^:[&.>&(k&#) t NB. exercise task\n}}\n","language":"J"},{"code":" pnest '((a b) c (d e) f) g (h i)'\n┌─────────────────┬─┬─────┐\n│┌─────┬─┬─────┬─┐│g│┌─┬─┐│\n││┌─┬─┐│c│┌─┬─┐│f││ ││h│i││\n│││a│b││ ││d│e││ ││ │└─┴─┘│\n││└─┴─┘│ │└─┴─┘│ ││ │ │\n│└─────┴─┴─────┴─┘│ │ │\n└─────────────────┴─┴─────┘\n","language":"J"},{"code":"import java.util.ArrayList;\nimport java.util.Arrays;\nimport java.util.List;\n\npublic final class TreeNestingLevels {\n\n\tpublic static void main(String[] args) {\n\t\tList<List<Integer>> lists = List.of(\n \t\t\tArrays.asList(),\n\t\t\tArrays.asList( 1, 2, 4 ),\n\t\t\tArrays.asList( 3, 1, 3, 1 ),\n\t\t\tArrays.asList( 1, 2, 3, 1 ),\n\t\t\tArrays.asList( 3, 2, 1, 3 ),\n\t\t\tArrays.asList( 3, 3, 3, 1, 1, 3, 3, 3 )\n\t\t);\n\t\t\n\t\tfor ( List<Integer> list : lists ) {\n\t\t List<Object> tree = createTree(list);\n\t\t System.out.println(list + \" --> \" + tree);\n\t\t}\t\n\t}\n\t\n\tprivate static List<Object> createTree(List<Integer> list) {\n\t\treturn makeTree(list, 0, 1);\n\t}\t\n\t\n\tprivate static List<Object> makeTree(List<Integer> list, int index, int depth) {\n\t\tList<Object> tree = new ArrayList<Object>();\n\t\tint current;\n\t\t\n\t\twhile ( index < list.size() && depth <= ( current = list.get(index) ) ) {\n\t\t\tif ( depth == current ) {\n\t\t\t\ttree.add(current);\n\t\t\t\tindex += 1;\n\t\t\t} else {\n\t\t\t\ttree.add(makeTree(list, index, depth + 1));\n\t\t\t\tfinal int position = list.subList(index, list.size()).indexOf(depth);\n\t\t\t\tindex += ( position == -1 ) ? list.size() : position;\n\t\t\t}\t\t\t\n\t\t}\n\t\t\n\t\treturn tree;\t\t\n\t}\n\t\n}\n","language":"Java"},{"code":"function makenested(list)\n nesting = 0\n str = isempty(list) ? \"[]\" : \"\"\n for n in list\n if n > nesting\n str *= \"[\"^(n - nesting)\n nesting = n\n elseif n < nesting\n str *= \"]\"^(nesting - n) * \", \"\n nesting = n\n end\n str *= \"$n, \"\n end\n str *= \"]\"^nesting\n return eval(Meta.parse(str))\nend\n\nfor test in [[], [1, 2, 4], [3, 1, 3, 1], [1, 2, 3, 1], [3, 2, 1, 3], [3, 3, 3, 1, 1, 3, 3, 3]]\n result = \"$test => $(makenested(test))\"\n println(replace(result, \"Any\" => \"\"))\nend\n","language":"Julia"},{"code":"import sequtils, strutils\n\ntype\n Kind = enum kValue, kList\n Node = ref object\n case kind: Kind\n of kValue: value: int\n of kList: list: seq[Node]\n\n\nproc newTree(s: varargs[int]): Node =\n ## Build a tree from a list of level values.\n var level = 1\n result = Node(kind: kList)\n var stack = @[result]\n for n in s:\n if n <= 0:\n raise newException(ValueError, \"expected a positive integer, got \" & $n)\n let node = Node(kind: kValue, value: n)\n if n < level:\n # Unstack lists.\n stack.setLen(n)\n level = n\n else:\n while n > level:\n # Create intermediate lists.\n let newList = Node(kind: kList)\n stack[^1].list.add newList\n stack.add newList\n inc level\n # Add value.\n stack[^1].list.add node\n\n\nproc `$`(node: Node): string =\n ## Display a tree using a nested lists representation.\n if node.kind == kValue: $node.value\n else: '[' & node.list.mapIt($it).join(\", \") & ']'\n\n\nfor list in [newSeq[int](), # Empty list (== @[]).\n @[1, 2, 4],\n @[3, 1, 3, 1],\n @[1, 2, 3, 1],\n @[3, 2, 1, 3],\n @[3, 3, 3, 1, 1, 3, 3, 3]]:\n echo ($list).align(25), \" → \", newTree(list)\n","language":"Nim"},{"code":"uses console\ndeclare DemoTree(string src)\nDemoTree \"[]\"\nDemoTree \"[1, 2, 4]\"\nDemoTree \"[3, 1, 3, 1]\"\nDemoTree \"[1, 2, 3, 1]\"\nDemoTree \"[3, 2, 1, 3]\"\nDemoTree \"[3, 3, 3, 1, 1, 3, 3, 3]\"\npause\nend\n\n/*\nRESULTS:\n========\n\n[]\n[]\n\n[1, 2, 4]\n[ 1,[ 2,[[ 4]]]]\n\n[3, 1, 3, 1]\n[[[ 3]], 1,[[ 3]], 1]\n\n[1, 2, 3, 1]\n[ 1,[ 2,[ 3]], 1]\n\n[3, 2, 1, 3]\n[[[ 3], 2], 1,[[ 3]]]\n\n[3, 3, 3, 1, 1, 3, 3, 3]\n[[[ 3, 3, 3]], 1, 1,[[ 3, 3, 3]]]\n*/\n\n\n\nsub DemoTree(string src)\n========================\n\nstring tree=nuls 1000 'TREE OUTPUT\nint i=1 'src char iterator\nint j=1 'tree char iterator\nbyte bs at strptr src 'src bytes\nbyte bt at strptr tree 'tree bytes\nint bl=len src 'end of src\nint lvl 'current tree level\nint olv 'prior tree level\nint v 'number value\nstring vs 'number in string form\n\ndo\n exit if i>bl\n select bs[i]\n case 91 '['\n i++\n case 93 ']'\n if i=bl\n gosub writex\n endif\n i++\n case 44 ','\n i++\n gosub writex\n case 0 to 32 'white space\n i++\n 'bt[j]=\" \" : j++\n case 48 to 57 '0..9'\n gosub ReadDigits\n case else\n i++\n end select\nloop\ntree=left(tree,j-1)\noutput src cr\noutput tree cr cr\nexit sub\n\n'SUBROUTINES OF DEMOTREE:\n=========================\n\nwritex:\n=======\nolv=lvl\n if i>=bl\n if v=0 and olv=0\n tree=\"[]\" : j=3\n ret\n endif\n endif\n if v<olv\n gosub WriteRbr\n endif\n if olv\n gosub WriteComma\n endif\n if v>olv\n gosub WriteLbr\n endif\n gosub WriteDigits '3]]'\n if i>=bl\n v=0\n gosub WriteRbr\n endif\nret\n\nReadDigits:\n===========\nv=0\nwhile i<=bl\n select bs[i]\n case 48 to 57 '1..9\n v*=10 : v+=bs[i]-48 'digit\n case else\n exit while\n end select\n i++\nwend\nret\n'\nWriteDigits:\n============\nvs=\" \"+str(v) : mid(tree,j,vs) : j+=len vs\nret\n\nWriteLbr:\n=========\nwhile v>lvl\n bt[j]=91 : j++ : lvl++\nwend\nret\n\nWriteRbr:\n=========\nwhile v<lvl\n bt[j]=93 : j++ : lvl--\nwend\nret\n\nWriteComma:\n===========\nbt[j]=44 : j++ ','\nret\n\nend sub\n","language":"OxygenBasic"},{"code":"#!/usr/bin/perl\n\nuse strict;\nuse warnings;\nuse Data::Dump qw(dd pp);\n\nmy @tests =\n (\n []\n ,[1, 2, 4]\n ,[3, 1, 3, 1]\n ,[1, 2, 3, 1]\n ,[3, 2, 1, 3]\n ,[3, 3, 3, 1, 1, 3, 3, 3]\n );\n\nfor my $before ( @tests )\n {\n dd { before => $before };\n local $_ = (pp $before) =~ s/\\d+/ '['x($&-1) . $& . ']'x($&-1) /ger;\n 1 while s/\\](,\\s*)\\[/$1/;\n my $after = eval;\n dd { after => $after };\n }\n","language":"Perl"},{"code":"use 5.020_000; # Also turns on `strict`\nuse warnings;\nuse experimental qw<signatures>;\nuse Data::Dump qw<pp>;\n\nsub new_level ( $stack ) {\n my $e = [];\n push @{ $stack->[-1] }, $e;\n push @{ $stack }, $e;\n}\nsub to_tree_iterative ( @xs ) {\n my $nested = [];\n my $stack = [$nested];\n\n for my $x (@xs) {\n new_level($stack) while $x > @{$stack};\n pop @{$stack} while $x < @{$stack};\n push @{$stack->[-1]},$x;\n }\n\n return $nested;\n}\nmy @tests = ([],[1,2,4],[3,1,3,1],[1,2,3,1],[3,2,1,3],[3,3,3,1,1,3,3,3]);\nsay sprintf('%15s => ', join(' ', @{$_})), pp(to_tree_iterative(@{$_})) for @tests;\n","language":"Perl"},{"code":"-->\n <span style=\"color: #008080;\">function</span> <span style=\"color: #000000;\">test</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #004080;\">sequence</span> <span style=\"color: #000000;\">s</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #004080;\">integer</span> <span style=\"color: #000000;\">level</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;\">1</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #004080;\">sequence</span> <span style=\"color: #000000;\">res</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #0000FF;\">{},</span> <span style=\"color: #000000;\">part</span>\n <span style=\"color: #008080;\">while</span> <span style=\"color: #000000;\">idx</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: #008080;\">do</span>\n <span style=\"color: #008080;\">switch</span> <span style=\"color: #7060A8;\">compare</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">s</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">idx</span><span style=\"color: #0000FF;\">],</span><span style=\"color: #000000;\">level</span><span style=\"color: #0000FF;\">)</span> <span style=\"color: #008080;\">do</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: #0000FF;\">{</span><span style=\"color: #000000;\">idx</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">part</span><span style=\"color: #0000FF;\">}</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">test</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">s</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">level</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>\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;\">part</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #008080;\">case</span> <span style=\"color: #000000;\">0</span><span style=\"color: #0000FF;\">:</span> <span style=\"color: #000000;\">res</span> <span style=\"color: #0000FF;\">&=</span> <span style=\"color: #000000;\">s</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">idx</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;\">idx</span> <span style=\"color: #0000FF;\">-=</span> <span style=\"color: #000000;\">1</span> <span style=\"color: #008080;\">exit</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">switch</span>\n <span style=\"color: #000000;\">idx</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: #008080;\">iff</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">level</span><span style=\"color: #0000FF;\">=</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">?</span><span style=\"color: #000000;\">res</span><span style=\"color: #0000FF;\">:{</span><span style=\"color: #000000;\">idx</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;\">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>\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;\">4</span><span style=\"color: #0000FF;\">},</span>\n <span style=\"color: #000080;font-style:italic;\">-- {1, 2, 4, 2, 2, 1}, -- (fine too)</span>\n <span style=\"color: #0000FF;\">{</span><span style=\"color: #000000;\">3</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;\">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;\">2</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">3</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;\">3</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;\">3</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;\">3</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">3</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;\">3</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">3</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">3</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: #004080;\">sequence</span> <span style=\"color: #000000;\">ti</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: #000000;\">res</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">test</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">ti</span><span style=\"color: #0000FF;\">),</span>\n <span style=\"color: #000000;\">rpp</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">ppf</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">res</span><span style=\"color: #0000FF;\">,{</span><span style=\"color: #000000;\">pp_Nest</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">3</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">pp_Indent</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">4</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;\">\"%v nests to %v\\n or %s\\n\"</span><span style=\"color: #0000FF;\">,{</span><span style=\"color: #000000;\">ti</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">res</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">rpp</span><span style=\"color: #0000FF;\">})</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">for</span>\n<!--\n","language":"Phix"},{"code":"-->\n <span style=\"color: #008080;\">function</span> <span style=\"color: #000000;\">nest</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #004080;\">sequence</span> <span style=\"color: #000000;\">input</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;\">input</span><span style=\"color: #0000FF;\">)</span> <span style=\"color: #008080;\">then</span>\n <span style=\"color: #008080;\">for</span> <span style=\"color: #000000;\">level</span><span style=\"color: #0000FF;\">=</span><span style=\"color: #7060A8;\">max</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">input</span><span style=\"color: #0000FF;\">)</span> <span style=\"color: #008080;\">to</span> <span style=\"color: #000000;\">2</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;\">sequence</span> <span style=\"color: #000000;\">output</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #0000FF;\">{}</span>\n <span style=\"color: #004080;\">bool</span> <span style=\"color: #000000;\">subnest</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;\">input</span><span style=\"color: #0000FF;\">)</span> <span style=\"color: #008080;\">do</span>\n <span style=\"color: #004080;\">object</span> <span style=\"color: #000000;\">ii</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">input</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: #004080;\">integer</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">ii</span><span style=\"color: #0000FF;\">)</span> <span style=\"color: #008080;\">and</span> <span style=\"color: #000000;\">ii</span><span style=\"color: #0000FF;\"><</span><span style=\"color: #000000;\">level</span> <span style=\"color: #008080;\">then</span>\n <span style=\"color: #000000;\">subnest</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #004600;\">false</span>\n <span style=\"color: #000000;\">output</span> <span style=\"color: #0000FF;\">&=</span> <span style=\"color: #000000;\">ii</span>\n <span style=\"color: #008080;\">elsif</span> <span style=\"color: #008080;\">not</span> <span style=\"color: #000000;\">subnest</span> <span style=\"color: #008080;\">then</span>\n <span style=\"color: #000000;\">output</span> <span style=\"color: #0000FF;\">&=</span> <span style=\"color: #0000FF;\">{{</span><span style=\"color: #000000;\">ii</span><span style=\"color: #0000FF;\">}}</span>\n <span style=\"color: #000000;\">subnest</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #004600;\">true</span>\n <span style=\"color: #008080;\">else</span>\n <span style=\"color: #000000;\">output</span><span style=\"color: #0000FF;\">[$]</span> <span style=\"color: #0000FF;\">&=</span> <span style=\"color: #0000FF;\">{</span><span style=\"color: #000000;\">ii</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;\">input</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">output</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;\">input</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">function</span>\n<!--\n","language":"Phix"},{"code":"def to_tree(x, index=0, depth=1):\n so_far = []\n while index < len(x):\n this = x[index]\n if this == depth:\n so_far.append(this)\n elif this > depth:\n index, deeper = to_tree(x, index, depth + 1)\n so_far.append(deeper)\n else: # this < depth:\n index -=1\n break\n index += 1\n return (index, so_far) if depth > 1 else so_far\n\n\nif __name__ == \"__main__\":\n from pprint import pformat\n\n def pnest(nest:list, width: int=9) -> str:\n text = pformat(nest, width=width).replace('\\n', '\\n ')\n print(f\" OR {text}\\n\")\n\n exercises = [\n [],\n [1, 2, 4],\n [3, 1, 3, 1],\n [1, 2, 3, 1],\n [3, 2, 1, 3],\n [3, 3, 3, 1, 1, 3, 3, 3],\n ]\n for flat in exercises:\n nest = to_tree(flat)\n print(f\"{flat} NESTS TO: {nest}\")\n pnest(nest)\n","language":"Python"},{"code":"def to_tree(x: list) -> list:\n nested = []\n stack = [nested]\n for this in x:\n while this != len(stack):\n if this > len(stack):\n innermost = [] # new level\n stack[-1].append(innermost) # nest it\n stack.append(innermost) # push it\n else: # this < stack:\n stack.pop(-1)\n stack[-1].append(this)\n\n return nested\n","language":"Python"},{"code":"'''Tree from nesting levels'''\n\nfrom itertools import chain, repeat\nfrom operator import add\n\n\n# treeFromSparseLevels :: [Int] -> Tree Maybe Int\ndef treeFromSparseLevels(levelList):\n '''A Forest (list of Trees) of (Maybe Int) values,\n in which implicit nodes have the value None.\n '''\n return Node(None)(\n forestFromLevels(\n rooted(normalized(levelList))\n )\n )\n\n\n# forestFromLevels :: [(Int, a)] -> [Tree a]\ndef forestFromLevels(nvs):\n '''A list of generic trees derived from a list of\n values paired with integers representing\n nesting depths.\n '''\n def go(xs):\n if xs:\n level, v = xs[0]\n children, rest = span(\n lambda x: level < x[0]\n )(xs[1:])\n return [Node(v)(go(children))] + go(rest)\n else:\n return []\n return go(nvs)\n\n\n# bracketNest :: Maybe Int -> Nest -> Nest\ndef bracketNest(maybeLevel):\n '''An arbitrary nest of bracketed\n lists and sublists.\n '''\n def go(xs):\n subNest = concat(xs)\n return [subNest] if None is maybeLevel else (\n [maybeLevel, subNest] if subNest else (\n [maybeLevel]\n )\n )\n return go\n\n\n# showTree :: Tree Maybe Int -> String\ndef showTree(tree):\n '''A string representation of\n a Maybe Int tree.\n '''\n return drawTree(\n fmapTree(repr)(tree)\n )\n\n\n# sparseLevelsFromTree :: Tree (Maybe Int) -> [Int]\ndef sparseLevelsFromTree(tree):\n '''Sparse representation of the tree\n a list of nest level integers.\n '''\n def go(x):\n return lambda xs: concat(xs) if (\n None is x\n ) else [x] + concat(xs)\n return foldTree(go)(tree)\n\n\n# ------------------------- TEST -------------------------\n# main :: IO ()\ndef main():\n '''Test the building and display of\n normalized forests from level integers.\n '''\n for xs in [\n [],\n [1, 2, 4],\n [3, 1, 3, 1],\n [1, 2, 3, 1],\n [3, 2, 1, 3],\n [3, 3, 3, 1, 1, 3, 3, 3]\n ]:\n tree = treeFromSparseLevels(xs)\n (\n print('From: ' + repr(xs)),\n print('Through tuple nest:'),\n print(repr(tree)),\n print('\\nTree:'),\n print(showTree(tree)),\n print('\\nto bracket nest:'),\n print(\n repr(\n root(foldTree(bracketNest)(tree))\n )\n ),\n print(\n 'and back to: ' + (\n repr(sparseLevelsFromTree(tree))\n )\n ),\n print()\n )\n\n\n# ------ TRANSLATION TO A CONSISTENT DATA STRUCTURE ------\n\n# normalized :: [Int] -> [(Int, Maybe Int)]\ndef normalized(xs):\n '''Explicit representation of implicit nodes.\n '''\n if xs:\n x = xs[0]\n h = [(x, x)]\n return h if 1 == len(xs) else (\n h + [(1 + x, None)] if (\n 1 < (xs[1] - x)\n ) else h\n ) + normalized(xs[1:])\n else:\n return []\n\n\n# rooted :: [(Int, Maybe Int)] -> [(Int, Maybe Int)]\ndef rooted(pairs):\n '''Path from the virtual root\n to the first explicit node.\n '''\n def go(xs):\n n = xs[0][0]\n return xs if 1 == n else (\n [(x, Nothing()) for x in range(1, n)] + xs\n )\n return go([\n x for x in pairs if 1 <= x[0]\n ]) if pairs else []\n\n\n# ---------------- GENERIC TREE FUNCTIONS ----------------\n\n# Node :: a -> [Tree a] -> Tree a\ndef Node(v):\n '''Constructor for a Tree node which connects a\n value of some kind to a list of zero or\n more child trees.\n '''\n return lambda xs: (v, xs)\n\n\n# draw :: Tree a -> [String]\ndef draw(node):\n '''List of the lines of an ASCII\n diagram of a tree.\n '''\n def shift_(h, other, xs):\n return list(map(\n add,\n chain(\n [h], (\n repeat(other, len(xs) - 1)\n )\n ),\n xs\n ))\n\n def drawSubTrees(xs):\n return (\n (\n ['|'] + shift_(\n '├─ ', '│ ', draw(xs[0])\n ) + drawSubTrees(xs[1:])\n ) if 1 < len(xs) else ['|'] + shift_(\n '└─ ', ' ', draw(xs[0])\n )\n ) if xs else []\n\n return (root(node)).splitlines() + (\n drawSubTrees(nest(node))\n )\n\n\n# drawForest :: [Tree String] -> String\ndef drawForest(trees):\n '''A simple unicode character representation of\n a list of trees.\n '''\n return '\\n'.join(map(drawTree, trees))\n\n\n# drawTree :: Tree a -> String\ndef drawTree(tree):\n '''ASCII diagram of a tree.'''\n return '\\n'.join(draw(tree))\n\n\n# fmapTree :: (a -> b) -> Tree a -> Tree b\ndef fmapTree(f):\n '''A new tree holding the results of\n an application of f to each root in\n the existing tree.\n '''\n def go(x):\n return Node(\n f(root(x))\n )([go(v) for v in nest(x)])\n return go\n\n\n# foldTree :: (a -> [b] -> b) -> Tree a -> b\ndef foldTree(f):\n '''The catamorphism on trees. A summary\n value defined by a depth-first fold.\n '''\n def go(node):\n return f(root(node))([\n go(x) for x in nest(node)\n ])\n return go\n\n\n# nest :: Tree a -> [Tree a]\ndef nest(t):\n '''Accessor function for children of tree node.'''\n return t[1]\n\n\n# root :: Tree a -> a\ndef root(t):\n '''Accessor function for data of tree node.'''\n return t[0]\n\n\n# -------------------- GENERIC OTHER ---------------------\n\n# Nothing :: () -> Maybe a\ndef Nothing():\n '''Constructor for an empty Maybe (option type) value.\n Empty wrapper returned where a computation is not possible.\n '''\n return None\n\n\n# concat :: [[a]] -> [a]\n# concat :: [String] -> String\ndef concat(xs):\n '''The concatenation of all the elements\n in a list or iterable.\n '''\n def f(ys):\n zs = list(chain(*ys))\n return ''.join(zs) if isinstance(ys[0], str) else zs\n\n return (\n f(xs) if isinstance(xs, list) else (\n chain.from_iterable(xs)\n )\n ) if xs else []\n\n\n# span :: (a -> Bool) -> [a] -> ([a], [a])\ndef span(p):\n '''The longest (possibly empty) prefix of xs\n that contains only elements satisfying p,\n tupled with the remainder of xs.\n span p xs is equivalent to\n (takeWhile p xs, dropWhile p xs).\n '''\n def match(ab):\n b = ab[1]\n return not b or not p(b[0])\n\n def f(ab):\n a, b = ab\n return a + [b[0]], b[1:]\n\n def go(xs):\n return until(match)(f)(([], xs))\n return go\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 ] is prev ( --> s )\n\n [ temp take\n swap join\n temp put ] is add$ ( x --> )\n\n [ dup [] = if done\n 0 prev put\n $ \"' \" temp put\n witheach\n [ dup prev take -\n over prev put\n dup 0 > iff\n [ times\n [ $ \"[ \" add$ ] ]\n else\n [ abs times\n [ $ \"] \" add$ ] ]\n number$ space join add$ ]\n prev take times\n [ $ \"] \" add$ ]\n temp take quackery ] is nesttree ( [ --> [ )\n\n ' [ [ ]\n [ 1 2 4 ]\n [ 3 1 3 1 ]\n [ 1 2 3 1 ]\n [ 3 2 1 3 ]\n [ 3 3 3 1 1 3 3 3 ] ]\n\n witheach\n [ dup echo say \" --> \"\n nesttree echo cr cr ]\n","language":"Quackery"},{"code":"sub new_level ( @stack --> Nil ) {\n my $e = [];\n push @stack.tail, $e;\n push @stack, $e;\n}\nsub to_tree_iterative ( @xs --> List ) {\n my $nested = [];\n my @stack = $nested;\n\n for @xs -> Int $x {\n new_level(@stack) while $x > @stack;\n pop @stack while $x < @stack;\n push @stack.tail, $x;\n }\n\n return $nested;\n}\nmy @tests = (), (1, 2, 4), (3, 1, 3, 1), (1, 2, 3, 1), (3, 2, 1, 3), (3, 3, 3, 1, 1, 3, 3, 3);\nsay .Str.fmt( '%15s => ' ), .&to_tree_iterative for @tests;\n","language":"Raku"},{"code":"sub to_tree_recursive ( @list, $index is copy, $depth ) {\n my @so_far = gather while $index <= @list.end {\n my $t = @list[$index];\n\n given $t <=> $depth {\n when Order::Same {\n take $t;\n }\n when Order::More {\n ( $index, my $n1 ) = to_tree_recursive( @list, $index, $depth+1 );\n take $n1;\n }\n when Order::Less {\n $index--;\n last;\n }\n }\n $index++;\n }\n\n my $i = ($depth > 1) ?? $index !! -1;\n return $i, @so_far;\n}\nmy @tests = (), (1, 2, 4), (3, 1, 3, 1), (1, 2, 3, 1), (3, 2, 1, 3), (3, 3, 3, 1, 1, 3, 3, 3);\nsay .Str.fmt( '%15s => ' ), to_tree_recursive( $_, 0, 1 ).[1] for @tests;\n","language":"Raku"},{"code":"use MONKEY-SEE-NO-EVAL;\nsub to_tree_string_eval ( @xs --> Array ) {\n my @gap = [ |@xs, 0 ] Z- [ 0, |@xs ];\n\n my @open = @gap.map( '[' x * );\n my @close = @gap.map( ']' x -* );\n\n my @wrapped = [Z~] @open, @xs, @close.skip;\n\n return EVAL @wrapped.join(',').subst(:g, ']]', '],]') || '[]';\n}\nmy @tests = (), (1, 2, 4), (3, 1, 3, 1), (1, 2, 3, 1), (3, 2, 1, 3), (3, 3, 3, 1, 1, 3, 3, 3);\nsay .Str.fmt( '%15s => ' ), .&to_tree_string_eval for @tests;\n","language":"Raku"},{"code":"import \"./seq\" for Stack\nimport \"./fmt\" for Fmt\n\nvar toTree = Fn.new { |list|\n var nested = []\n var s = Stack.new()\n s.push(nested)\n for (n in list) {\n while (n != s.count) {\n if (n > s.count) {\n var inner = []\n s.peek().add(inner)\n s.push(inner)\n } else {\n s.pop()\n }\n }\n s.peek().add(n)\n }\n return nested\n}\n\nvar tests = [\n [],\n [1, 2, 4],\n [3, 1, 3, 1],\n [1, 2, 3, 1],\n [3, 2, 1, 3],\n [3, 3, 3, 1, 1, 3, 3, 3]\n]\nfor (test in tests) {\n var nest = toTree.call(test)\n Fmt.print(\"$24n => $n\", test, nest)\n}\n","language":"Wren"},{"code":"import \"./fmt\" for Fmt\n\nvar toTree // recursive\ntoTree = Fn.new { |list, index, depth|\n var soFar = []\n while (index < list.count) {\n var t = list[index]\n if (t == depth) {\n soFar.add(t)\n } else if (t > depth) {\n var n = toTree.call(list, index, depth+1)\n index = n[0]\n soFar.add(n[1])\n } else {\n index = index - 1\n break\n }\n index = index + 1\n }\n if (depth > 1) return [index, soFar]\n return [-1, soFar]\n}\n\nvar tests = [\n [],\n [1, 2, 4],\n [3, 1, 3, 1],\n [1, 2, 3, 1],\n [3, 2, 1, 3],\n [3, 3, 3, 1, 1, 3, 3, 3]\n]\nfor (test in tests) {\n var n = toTree.call(test, 0, 1)\n Fmt.print(\"$24n => $n\", test, n[1])\n}\n","language":"Wren"},{"code":"proc ShowTree(List);\nint List, NestLevel, I;\n[NestLevel:= 0;\nfor I:= 0 to -1>>1 do\n [while List(I) < NestLevel do\n [ChOut(0, ^]); NestLevel:= NestLevel-1];\n if List(I) = 0 then [CrLf(0); return];\n if I # 0 then Text(0, \", \");\n while List(I) > NestLevel do\n [ChOut(0, ^[); NestLevel:= NestLevel+1];\n IntOut(0, NestLevel);\n ];\n];\n\n[ShowTree([0]);\nShowTree([1, 2, 4, 0]);\nShowTree([3, 1, 3, 1, 0]);\nShowTree([1, 2, 3, 1, 0]);\nShowTree([3, 2, 1, 3, 0]);\nShowTree([3, 3, 3, 1, 1, 3, 3, 3, 0]);\nShowTree([1, 2, 4, 2, 2, 1, 0]);\n]\n","language":"XPL0"}],"string":"[\n {\n \"code\": \"---\\nfrom: http://rosettacode.org/wiki/Tree_from_nesting_levels\\n\",\n \"language\": \"00-META\"\n },\n {\n \"code\": \"Given a flat list of integers greater than zero, representing object nesting\\nlevels, e.g. <code>[1, 2, 4]</code>,\\ngenerate a tree formed from nested lists of those nesting level integers where:\\n* Every int appears, in order, at its depth of nesting.\\n* If the next level int is greater than the previous then it appears in a sub-list of the list containing the previous item\\n\\n\\nThe generated tree data structure should ideally be in a languages nested list format that can\\nbe used for further calculations rather than something just calculated for printing.\\n\\n\\nAn input of <code>[1, 2, 4]</code> should produce the equivalent of: <code><nowiki>[1, [2, [[4]]]]</nowiki></code>\\nwhere 1 is at depth1, 2 is two deep and 4 is nested 4 deep.\\n\\n<code>[1, 2, 4, 2, 2, 1]</code> should produce <code><nowiki>[1, [2, [[4]], 2, 2], 1]</nowiki></code>. <br>\\nAll the nesting integers are in the same order but at the correct nesting\\nlevels.\\n\\nSimilarly <code>[3, 1, 3, 1]</code> should generate <code><nowiki>[[[3]], 1, [[3]], 1]</nowiki></code>\\n\\n;Task:\\nGenerate and show here the results for the following inputs:\\n:* <code>[]</code>\\n:* <code>[1, 2, 4]</code>\\n:* <code>[3, 1, 3, 1]</code>\\n:* <code>[1, 2, 3, 1]</code>\\n:* <code>[3, 2, 1, 3]</code>\\n:* <code>[3, 3, 3, 1, 1, 3, 3, 3]</code>\\n\\n\\n\",\n \"language\": \"00-TASK\"\n },\n {\n \"code\": \"on treeFromNestingLevels(input)\\n set maxLevel to 0\\n repeat with thisLevel in input\\n if (thisLevel > maxLevel) then set maxLevel to thisLevel\\n end repeat\\n if (maxLevel < 2) then return input\\n\\n set emptyList to {}\\n repeat with testLevel from maxLevel to 2 by -1\\n set output to {}\\n set subnest to {}\\n repeat with thisLevel in input\\n set thisLevel to thisLevel's contents\\n if ((thisLevel's class is integer) and (thisLevel < testLevel)) then\\n if (subnest ≠ emptyList) then set subnest to {}\\n set end of output to thisLevel\\n else\\n if (subnest = emptyList) then set end of output to subnest\\n set end of subnest to thisLevel\\n end if\\n end repeat\\n set input to output\\n end repeat\\n\\n return output\\nend treeFromNestingLevels\\n\\n-- Task code:\\nlocal output, astid, input, part1, errMsg\\nset output to {}\\nset astid to AppleScript's text item delimiters\\nrepeat with input in {{}, {1, 2, 4}, {3, 1, 3, 1}, {1, 2, 3, 1}, {3, 2, 1, 3}, {3, 3, 3, 1, 1, 3, 3, 3}}\\n set input to input's contents\\n set AppleScript's text item delimiters to \\\", \\\"\\n set part1 to \\\"{\\\" & input & \\\"} nests to: {\\\"\\n -- It's a pain having to parse nested lists to text, so throw a deliberate error and parse the error message instead.\\n try\\n || of treeFromNestingLevels(input)\\n on error errMsg\\n set AppleScript's text item delimiters to {\\\"{\\\", \\\"}\\\"}\\n set end of output to part1 & ((text from text item 2 to text item -2 of errMsg) & \\\"}\\\")\\n end try\\nend repeat\\nset AppleScript's text item delimiters to linefeed\\nset output to output as text\\nset AppleScript's text item delimiters to astid\\nreturn output\\n\",\n \"language\": \"AppleScript\"\n },\n {\n \"code\": \"\\\"{} nests to: {}\\n{1, 2, 4} nests to: {1, {2, {{4}}}}\\n{3, 1, 3, 1} nests to: {{{3}}, 1, {{3}}, 1}\\n{1, 2, 3, 1} nests to: {1, {2, {3}}, 1}\\n{3, 2, 1, 3} nests to: {{{3}, 2}, 1, {{3}}}\\n{3, 3, 3, 1, 1, 3, 3, 3} nests to: {{{3, 3, 3}}, 1, 1, {{3, 3, 3}}}\\\"\\n\",\n \"language\": \"AppleScript\"\n },\n {\n \"code\": \"on treeFromNestingLevels(input)\\n script recursion\\n property emptyList : {}\\n\\n on recurse(input, currentLevel)\\n set output to {}\\n set subnest to {}\\n repeat with thisLevel in input\\n set thisLevel to thisLevel's contents\\n if (thisLevel > currentLevel) then\\n set end of subnest to thisLevel\\n else\\n if (subnest ≠ emptyList) then\\n set end of output to recurse(subnest, currentLevel + 1)\\n set subnest to {}\\n end if\\n set end of output to thisLevel\\n end if\\n end repeat\\n if (subnest ≠ emptyList) then set end of output to recurse(subnest, currentLevel + 1)\\n\\n return output\\n end recurse\\n end script\\n\\n return recursion's recurse(input, 1)\\nend treeFromNestingLevels\\n\",\n \"language\": \"AppleScript\"\n },\n {\n \"code\": \"----------------- FOREST FROM NEST LEVELS ----------------\\n\\n-- forestFromNestLevels :: [(Int, a)] -> [Tree a]\\non forestFromNestLevels(pairs)\\n script go\\n on |λ|(xs)\\n if {} ≠ xs then\\n set {n, v} to item 1 of xs\\n\\n script deeper\\n on |λ|(x)\\n n < item 1 of x\\n end |λ|\\n end script\\n set {descendants, rs} to ¬\\n |λ|(rest of xs) of span(deeper)\\n\\n {Node(v, |λ|(descendants))} & |λ|(rs)\\n else\\n {}\\n end if\\n end |λ|\\n end script\\n |λ|(pairs) of go\\nend forestFromNestLevels\\n\\n\\n-- nestedList :: Maybe Int -> Nest -> Nest\\non nestedList(maybeLevel, xs)\\n set subTree to concat(xs)\\n if maybeLevel ≠ missing value then\\n if {} ≠ subTree then\\n {maybeLevel, subTree}\\n else\\n {maybeLevel}\\n end if\\n else\\n {subTree}\\n end if\\nend nestedList\\n\\n\\n-- treeFromSparseLevelList :: [Int] -> Tree Maybe Int\\non treeFromSparseLevelList(xs)\\n {missing value, ¬\\n forestFromNestLevels(rooted(normalized(xs)))}\\nend treeFromSparseLevelList\\n\\n-------------------------- TESTS -------------------------\\non run\\n set tests to {¬\\n {}, ¬\\n {1, 2, 4}, ¬\\n {3, 1, 3, 1}, ¬\\n {1, 2, 3, 1}, ¬\\n {3, 2, 1, 3}, ¬\\n {3, 3, 3, 1, 1, 3, 3, 3}}\\n\\n script translate\\n on |λ|(ns)\\n set tree to treeFromSparseLevelList(ns)\\n\\n set bracketNest to root(foldTree(my nestedList, tree))\\n\\n set returnTrip to foldTree(my levelList, tree)\\n\\n map(my showList, {ns, bracketNest, returnTrip})\\n end |λ|\\n end script\\n\\n set testResults to {{\\\"INPUT\\\", \\\"NESTED\\\", \\\"ROUND-TRIP\\\"}} & map(translate, tests)\\n\\n set {firstColWidth, secondColWidth} to map(widest(testResults), {fst, snd})\\n\\n script display\\n on |λ|(triple)\\n intercalate(\\\" -> \\\", ¬\\n {justifyRight(firstColWidth, space, item 1 of triple)} & ¬\\n {justifyLeft(secondColWidth, space, item 2 of triple)} & ¬\\n {item 3 of triple})\\n end |λ|\\n end script\\n linefeed & unlines(map(display, testResults))\\nend run\\n\\n\\n-- widest :: ((a, a) -> a) -> [String] -> Int\\non widest(xs)\\n script\\n on |λ|(f)\\n maximum(map(compose(my |length|, mReturn(f)), xs))\\n end |λ|\\n end script\\nend widest\\n\\n\\n-------------- FROM TREE BACK TO SPARSE LIST -------------\\n\\n-- levelListFromNestedList :: Maybe a -> NestedList -> [a]\\non levelList(maybeLevel, xs)\\n if maybeLevel ≠ missing value then\\n concat(maybeLevel & xs)\\n else\\n concat(xs)\\n end if\\nend levelList\\n\\n\\n----- NORMALIZED TO A STRICTER GENERIC DATA STRUCTURE ----\\n\\n-- normalized :: [Int] -> [(Int, Maybe Int)]\\non normalized(xs)\\n -- Explicit representation of implicit nodes.\\n\\n if {} ≠ xs then\\n set x to item 1 of xs\\n if 1 > x then\\n normalized(rest of xs)\\n else\\n set h to {{x, x}}\\n if 1 = length of xs then\\n h\\n else\\n if 1 < ((item 2 of xs) - x) then\\n set ys to h & {{1 + x, missing value}}\\n else\\n set ys to h\\n end if\\n ys & normalized(rest of xs)\\n end if\\n end if\\n else\\n {}\\n end if\\nend normalized\\n\\n\\n-- rooted :: [(Int, Maybe Int)] -> [(Int, Maybe Int)]\\non rooted(pairs)\\n -- Path from the virtual root to the first explicit node.\\n if {} ≠ pairs then\\n set {n, _} to item 1 of pairs\\n if 1 ≠ n then\\n script go\\n on |λ|(x)\\n {x, missing value}\\n end |λ|\\n end script\\n map(go, enumFromTo(1, n - 1)) & pairs\\n else\\n pairs\\n end if\\n else\\n {}\\n end if\\nend rooted\\n\\n------------------ GENERIC TREE FUNCTIONS ----------------\\n\\n-- Node :: a -> [Tree a] -> Tree a\\non Node(v, xs)\\n -- {type:\\\"Node\\\", root:v, nest:xs}\\n {v, xs}\\nend Node\\n\\n\\n-- foldTree :: (a -> [b] -> b) -> Tree a -> b\\non foldTree(f, tree)\\n script go\\n property g : mReturn(f)\\n on |λ|(tree)\\n tell g to |λ|(root(tree), map(go, nest(tree)))\\n end |λ|\\n end script\\n |λ|(tree) of go\\nend foldTree\\n\\n\\n-- nest :: Tree a -> [a]\\non nest(oTree)\\n item 2 of oTree\\n -- nest of oTree\\nend nest\\n\\n\\n-- root :: Tree a -> a\\non root(oTree)\\n item 1 of oTree\\n -- root of oTree\\nend root\\n\\n\\n---------------------- OTHER GENERIC ---------------------\\n\\n-- compose (<<<) :: (b -> c) -> (a -> b) -> a -> c\\non compose(f, g)\\n script\\n property mf : mReturn(f)\\n property mg : mReturn(g)\\n on |λ|(x)\\n mf's |λ|(mg's |λ|(x))\\n end |λ|\\n end script\\nend compose\\n\\n\\n-- concat :: [[a]] -> [a]\\non concat(xs)\\n set lng to length of xs\\n set acc to {}\\n repeat with i from 1 to lng\\n set acc to acc & item i of xs\\n end repeat\\n acc\\nend concat\\n\\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 lst\\n else\\n {}\\n end if\\nend enumFromTo\\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-- 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\\n-- intercalate :: String -> [String] -> String\\non intercalate(delim, xs)\\n set {dlm, my text item delimiters} to ¬\\n {my text item delimiters, delim}\\n set s to xs as text\\n set my text item delimiters to dlm\\n s\\nend intercalate\\n\\n\\n-- justifyLeft :: Int -> Char -> String -> String\\non justifyLeft(n, cFiller, strText)\\n if n > length of strText then\\n text 1 thru n of (strText & replicate(n, cFiller))\\n else\\n strText\\n end if\\nend justifyLeft\\n\\n\\n-- justifyRight :: Int -> Char -> String -> String\\non justifyRight(n, cFiller, strText)\\n if n > length of strText then\\n text -n thru -1 of ((replicate(n, cFiller) as text) & strText)\\n else\\n strText\\n end if\\nend justifyRight\\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-- 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\\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-- maximum :: Ord a => [a] -> a\\non maximum(xs)\\n script\\n on |λ|(a, b)\\n if a is missing value or b > a then\\n b\\n else\\n a\\n end if\\n end |λ|\\n end script\\n\\n foldl(result, missing value, xs)\\nend maximum\\n\\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 -> String -> String\\non replicate(n, s)\\n -- Egyptian multiplication - progressively doubling a list,\\n -- appending stages of doubling to an accumulator where needed\\n -- for binary assembly of a target length\\n script p\\n on |λ|({n})\\n n ≤ 1\\n end |λ|\\n end script\\n\\n script f\\n on |λ|({n, dbl, out})\\n if (n mod 2) > 0 then\\n set d to out & dbl\\n else\\n set d to out\\n end if\\n {n div 2, dbl & dbl, d}\\n end |λ|\\n end script\\n\\n set xs to |until|(p, f, {n, s, \\\"\\\"})\\n item 2 of xs & item 3 of xs\\nend replicate\\n\\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\\n-- showList :: [a] -> String\\non showList(xs)\\n \\\"[\\\" & intercalate(\\\", \\\", map(my show, xs)) & \\\"]\\\"\\nend showList\\n\\n\\non show(v)\\n if list is class of v then\\n showList(v)\\n else\\n v as text\\n end if\\nend show\\n\\n\\n-- span :: (a -> Bool) -> [a] -> ([a], [a])\\non span(f)\\n -- The longest (possibly empty) prefix of xs\\n -- that contains only elements satisfying p,\\n -- tupled with the remainder of xs.\\n -- span(p, xs) eq (takeWhile(p, xs), dropWhile(p, xs))\\n script\\n on |λ|(xs)\\n set lng to length of xs\\n set i to 0\\n tell mReturn(f)\\n repeat while lng > i and |λ|(item (1 + i) of xs)\\n set i to 1 + i\\n end repeat\\n end tell\\n splitAt(i, xs)\\n end |λ|\\n end script\\nend span\\n\\n\\n-- splitAt :: Int -> [a] -> ([a], [a])\\non splitAt(n, xs)\\n if n > 0 and n < length of xs then\\n if class of xs is text then\\n {items 1 thru n of xs as text, ¬\\n items (n + 1) thru -1 of xs as text}\\n else\\n {items 1 thru n of xs, items (n + 1) thru -1 of xs}\\n end if\\n else\\n if n < 1 then\\n {{}, xs}\\n else\\n {xs, {}}\\n end if\\n end if\\nend splitAt\\n\\n\\n-- unlines :: [String] -> String\\non unlines(xs)\\n -- A single string formed by the intercalation\\n -- of a list of strings with the newline character.\\n set {dlm, my text item delimiters} to ¬\\n {my text item delimiters, linefeed}\\n set s to xs as text\\n set my text item delimiters to dlm\\n s\\nend unlines\\n\\n\\n-- until :: (a -> Bool) -> (a -> a) -> a -> a\\non |until|(p, f, x)\\n set v to x\\n set mp to mReturn(p)\\n set mf to mReturn(f)\\n repeat until mp's |λ|(v)\\n set v to mf's |λ|(v)\\n end repeat\\n v\\nend |until|\\n\",\n \"language\": \"AppleScript\"\n },\n {\n \"code\": \"#include <any>\\n#include <iostream>\\n#include <iterator>\\n#include <vector>\\n\\nusing namespace std;\\n\\n// Make a tree that is a vector of either values or other trees\\nvector<any> MakeTree(input_iterator auto first, input_iterator auto last, int depth = 1)\\n{\\n vector<any> tree;\\n while (first < last && depth <= *first)\\n {\\n if(*first == depth)\\n {\\n // add a single value\\n tree.push_back(*first);\\n ++first;\\n }\\n else // (depth < *b)\\n {\\n // add a subtree\\n tree.push_back(MakeTree(first, last, depth + 1));\\n first = find(first + 1, last, depth);\\n }\\n }\\n\\n return tree;\\n}\\n\\n// Print an input vector or tree\\nvoid PrintTree(input_iterator auto first, input_iterator auto last)\\n{\\n cout << \\\"[\\\";\\n for(auto it = first; it != last; ++it)\\n {\\n if(it != first) cout << \\\", \\\";\\n if constexpr (is_integral_v<remove_reference_t<decltype(*first)>>)\\n {\\n // for printing the input vector\\n cout << *it;\\n }\\n else\\n {\\n // for printing the tree\\n if(it->type() == typeid(unsigned int))\\n {\\n // a single value\\n cout << any_cast<unsigned int>(*it);\\n }\\n else\\n {\\n // a subtree\\n const auto& subTree = any_cast<vector<any>>(*it);\\n PrintTree(subTree.begin(), subTree.end());\\n }\\n }\\n }\\n cout << \\\"]\\\";\\n}\\n\\nint main(void)\\n{\\n auto execises = vector<vector<unsigned int>> {\\n {},\\n {1, 2, 4},\\n {3, 1, 3, 1},\\n {1, 2, 3, 1},\\n {3, 2, 1, 3},\\n {3, 3, 3, 1, 1, 3, 3, 3}\\n };\\n\\n for(const auto& e : execises)\\n {\\n auto tree = MakeTree(e.begin(), e.end());\\n PrintTree(e.begin(), e.end());\\n cout << \\\" Nests to:\\\\n\\\";\\n PrintTree(tree.begin(), tree.end());\\n cout << \\\"\\\\n\\\\n\\\";\\n }\\n}\\n\",\n \"language\": \"C++\"\n },\n {\n \"code\": \"const TreeData1: array [0..0] of integer = (0);\\nconst TreeData2: array [0..2] of integer = (1, 2, 4);\\nconst TreeData3: array [0..3] of integer = (3, 1, 3, 1);\\nconst TreeData4: array [0..3] of integer = (1, 2, 3, 1);\\nconst TreeData5: array [0..3] of integer = (3, 2, 1, 3);\\nconst TreeData6: array [0..7] of integer = (3, 3, 3, 1, 1, 3, 3, 3);\\n\\n\\nfunction GetDataString(Data: array of integer): string;\\nvar I: integer;\\nbegin\\nResult:='[';\\nfor I:=0 to High(Data) do\\n\\tbegin\\n\\tif I<>0 then Result:=Result+', ';\\n\\tResult:=Result+IntToStr(Data[I]);\\n\\tend;\\nResult:=Result+']';\\nend;\\n\\n\\nfunction GetNestingLevel(Data: array of integer): string;\\nvar Level,Level2: integer;\\nvar I,J,HLen: integer;\\nbegin\\nLevel:=0;\\nResult:='';\\nfor I:=0 to High(Data) do\\n\\tbegin\\n\\tLevel2:=Data[I];\\n\\tif Level2>Level then for J:=Level to Level2-1 do Result:=Result+'['\\n\\telse if Level2<Level then\\n\\t\\tbegin\\n\\t\\tfor J:=Level-1 downto Level2 do Result:=Result+']';\\n\\t\\tResult:=Result+', ';\\n\\t\\tend\\n\\telse if Level2=0 then\\n\\t\\tbegin\\n\\t\\tResult:='[]';\\n\\t\\tbreak;\\n\\t\\tend\\n\\telse Result:=Result+', ';\\n\\tResult:=Result+IntToStr(Level2);\\n\\tLevel:=Level2;\\n\\tif (I<High(Data)) and (Level<Data[I+1]) then Result:=Result+', ';\\n\\tend;\\nfor J:=Level downto 1 do Result:=Result+']';\\nend;\\n\\n\\nprocedure ShowNestData(Memo: TMemo; Data: array of integer);\\nbegin\\nMemo.Lines.Add(GetDataString(Data)+' Nests to: ');\\nMemo.Lines.Add(GetNestingLevel(Data));\\nMemo.Lines.Add('');\\nend;\\n\\nprocedure ShowNestingLevels(Memo: TMemo);\\nvar S: string;\\nbegin\\nShowNestData(Memo,TreeData1);\\nShowNestData(Memo,TreeData2);\\nShowNestData(Memo,TreeData3);\\nShowNestData(Memo,TreeData4);\\nShowNestData(Memo,TreeData5);\\nShowNestData(Memo,TreeData6);\\nend;\\n\",\n \"language\": \"Delphi\"\n },\n {\n \"code\": \"Sub ShowTree(List() As Integer)\\n Dim As Integer I, NestLevel = 0\\n For I = 0 To Ubound(List)\\n While List(I) < NestLevel\\n Print \\\"]\\\";\\n NestLevel -= 1\\n Wend\\n If List(I) = 0 Then\\n Print\\n Elseif I <> Lbound(List) Then Print \\\", \\\";\\n End If\\n While List(I) > NestLevel\\n Print \\\"[\\\";\\n NestLevel += 1\\n Wend\\n If NestLevel <> 0 Then Print NestLevel;\\n Next I\\nEnd Sub\\n\\nDim As Integer list(0 To ...) = {0}\\nShowTree(list())\\nDim As Integer list0(0 To ...) = {1, 2, 4, 0}\\nShowTree(list0())\\nDim As Integer list1(0 To ...) = {3, 1, 3, 1, 0}\\nShowTree(list1())\\nDim As Integer list2(0 To ...) = {1, 2, 3, 1, 0}\\nShowTree(list2())\\nDim As Integer list3(0 To ...) = {3, 2, 1, 3, 0}\\nShowTree(list3())\\nDim As Integer list4(0 To ...) = {3, 3, 3, 1, 1, 3, 3, 3, 0}\\nShowTree(list4())\\nDim As Integer list5(0 To ...) = {1, 2, 4, 2, 2, 1, 0}\\nShowTree(list5())\\n\\nSleep\\n\",\n \"language\": \"FreeBASIC\"\n },\n {\n \"code\": \"package main\\n\\nimport \\\"fmt\\\"\\n\\ntype any = interface{}\\n\\nfunc toTree(list []int) any {\\n s := []any{[]any{}}\\n for _, n := range list {\\n for n != len(s) {\\n if n > len(s) {\\n inner := []any{}\\n s[len(s)-1] = append(s[len(s)-1].([]any), inner)\\n s = append(s, inner)\\n } else {\\n s = s[0 : len(s)-1]\\n }\\n }\\n s[len(s)-1] = append(s[len(s)-1].([]any), n)\\n for i := len(s) - 2; i >= 0; i-- {\\n le := len(s[i].([]any))\\n s[i].([]any)[le-1] = s[i+1]\\n }\\n }\\n return s[0]\\n}\\n\\nfunc main() {\\n tests := [][]int{\\n {},\\n {1, 2, 4},\\n {3, 1, 3, 1},\\n {1, 2, 3, 1},\\n {3, 2, 1, 3},\\n {3, 3, 3, 1, 1, 3, 3, 3},\\n }\\n for _, test := range tests {\\n nest := toTree(test)\\n fmt.Printf(\\\"%17s => %v\\\\n\\\", fmt.Sprintf(\\\"%v\\\", test), nest)\\n }\\n}\\n\",\n \"language\": \"Go\"\n },\n {\n \"code\": \"package main\\n\\nimport \\\"fmt\\\"\\n\\ntype any = interface{}\\n\\nfunc toTree(list []int, index, depth int) (int, []any) {\\n var soFar []any\\n for index < len(list) {\\n t := list[index]\\n if t == depth {\\n soFar = append(soFar, t)\\n } else if t > depth {\\n var deeper []any\\n index, deeper = toTree(list, index, depth+1)\\n soFar = append(soFar, deeper)\\n } else {\\n index = index - 1\\n break\\n }\\n index = index + 1\\n }\\n if depth > 1 {\\n return index, soFar\\n }\\n return -1, soFar\\n}\\n\\nfunc main() {\\n tests := [][]int{\\n {},\\n {1, 2, 4},\\n {3, 1, 3, 1},\\n {1, 2, 3, 1},\\n {3, 2, 1, 3},\\n {3, 3, 3, 1, 1, 3, 3, 3},\\n }\\n for _, test := range tests {\\n _, nest := toTree(test, 0, 1)\\n fmt.Printf(\\\"%17s => %v\\\\n\\\", fmt.Sprintf(\\\"%v\\\", test), nest)\\n }\\n}\\n\",\n \"language\": \"Go\"\n },\n {\n \"code\": \";; helper function that finds the rest that are less than or equal\\n(define (rest-less-eq x ls)\\n (cond\\n ((null? ls) #f)\\n ((<= (car ls) x) ls)\\n (else (rest-less-eq x (cdr ls)))))\\n\\n;; nest the input as a tree\\n(define (make-tree input depth)\\n (cond\\n ((null? input) '())\\n ((eq? input #f ) '())\\n ((= depth (car input))\\n (cons (car input)(make-tree(cdr input) depth)))\\n ((< depth (car input))\\n (cons (make-tree input (+ depth 1))\\n\\t (make-tree (rest-less-eq depth input) depth)))\\n (#t '())\\n ))\\n\\n(define examples\\n '(()\\n (1 2 4)\\n (3 1 3 1)\\n (1 2 3 1)\\n (3 2 1 3)\\n (3 3 3 1 1 3 3 3)))\\n\\n(define (run-examples x)\\n (if (null? x) '()\\n (begin\\n\\t(display (car x))(display \\\" -> \\\")\\n\\t(display (make-tree(car x) 1))(display \\\"\\\\n\\\")\\n\\t(run-examples (cdr x)))))\\n\\n(run-examples examples)\\n\",\n \"language\": \"Guile\"\n },\n {\n \"code\": \"{-# LANGUAGE TupleSections #-}\\n\\nimport Data.Bifunctor (bimap)\\nimport Data.Tree (Forest, Tree (..), drawTree, foldTree)\\n\\n------------- TREE FROM NEST LEVELS (AND BACK) -----------\\n\\ntreeFromSparseLevels :: [Int] -> Tree (Maybe Int)\\ntreeFromSparseLevels =\\n Node Nothing\\n . forestFromNestLevels\\n . rooted\\n . normalised\\n\\nsparseLevelsFromTree :: Tree (Maybe Int) -> [Int]\\nsparseLevelsFromTree = foldTree go\\n where\\n go Nothing xs = concat xs\\n go (Just x) xs = x : concat xs\\n\\nforestFromNestLevels :: [(Int, a)] -> Forest a\\nforestFromNestLevels = go\\n where\\n go [] = []\\n go ((n, v) : xs) =\\n uncurry (:) $\\n bimap (Node v . go) go (span ((n <) . fst) xs)\\n\\n--------------------- TEST AND DISPLAY -------------------\\nmain :: IO ()\\nmain =\\n mapM_\\n ( \\\\xs ->\\n putStrLn (\\\"From: \\\" <> show xs)\\n >> let tree = treeFromSparseLevels xs\\n in putStrLn ((drawTree . fmap show) tree)\\n >> putStrLn\\n ( \\\"Back to: \\\"\\n <> show (sparseLevelsFromTree tree)\\n <> \\\"\\\\n\\\\n\\\"\\n )\\n )\\n [ [],\\n [1, 2, 4],\\n [3, 1, 3, 1],\\n [1, 2, 3, 1],\\n [3, 2, 1, 3],\\n [3, 3, 3, 1, 1, 3, 3, 3]\\n ]\\n\\n----------- MAPPING TO A STRICTER DATA STRUCTURE ---------\\n\\n-- Path from the virtual root to the first explicit node.\\nrooted :: [(Int, Maybe Int)] -> [(Int, Maybe Int)]\\nrooted [] = []\\nrooted xs = go $ filter ((1 <=) . fst) xs\\n where\\n go xs@((1, mb) : _) = xs\\n go xs@((n, mb) : _) =\\n fmap (,Nothing) [1 .. pred n] <> xs\\n\\n-- Representation of implicit nodes.\\nnormalised [] = []\\nnormalised [x] = [(x, Just x)]\\nnormalised (x : y : xs)\\n | 1 < (y - x) =\\n (x, Just x) :\\n (succ x, Nothing) : normalised (y : xs)\\n | otherwise = (x, Just x) : normalised (y : xs)\\n\",\n \"language\": \"Haskell\"\n },\n {\n \"code\": \" [[[3]], 1, [[3]], 1\\n1 1\\n [[[3]], 1, [[3]], 1]\\n|syntax error\\n\",\n \"language\": \"J\"\n },\n {\n \"code\": \"NB. first we nest each integer to the required depth, independently\\nNB. then we recursively merge deep boxes\\nNB. for consistency, if there are no integers, we box that empty list\\ndtree=: {{\\n <^:(0=L.) merge <^:]each y\\n}}\\n\\nmerge=: {{\\n if.(0=#$y)+.2>L.y do.y return.end. NB. done if no deep boxes left\\n shallow=. 2 > L.\\\"0 y NB. locate shallow boxes\\n group=. shallow} (+/\\\\ shallow),:-#\\\\y NB. find groups of adjacent deep boxes\\n merge each group ,each//. y NB. combine them and recursively merge their contents\\n}}\\n\",\n \"language\": \"J\"\n },\n {\n \"code\": \" dtree ''\\n┌┐\\n││\\n└┘\\n dtree 1 2 4\\n┌─────────────┐\\n│┌─┬─────────┐│\\n││1│┌─┬─────┐││\\n││ ││2│┌───┐│││\\n││ ││ ││┌─┐││││\\n││ ││ │││4│││││\\n││ ││ ││└─┘││││\\n││ ││ │└───┘│││\\n││ │└─┴─────┘││\\n│└─┴─────────┘│\\n└─────────────┘\\n dtree 3 1 3 1\\n┌─────────────────┐\\n│┌─────┬─┬─────┬─┐│\\n││┌───┐│1│┌───┐│1││\\n│││┌─┐││ ││┌─┐││ ││\\n││││3│││ │││3│││ ││\\n│││└─┘││ ││└─┘││ ││\\n││└───┘│ │└───┘│ ││\\n│└─────┴─┴─────┴─┘│\\n└─────────────────┘\\n dtree 1 2 3 1\\n┌─────────────┐\\n│┌─┬───────┬─┐│\\n││1│┌─┬───┐│1││\\n││ ││2│┌─┐││ ││\\n││ ││ ││3│││ ││\\n││ ││ │└─┘││ ││\\n││ │└─┴───┘│ ││\\n│└─┴───────┴─┘│\\n└─────────────┘\\n dtree 3 2 1 3\\n┌─────────────────┐\\n│┌───────┬─┬─────┐│\\n││┌───┬─┐│1│┌───┐││\\n│││┌─┐│2││ ││┌─┐│││\\n││││3││ ││ │││3││││\\n│││└─┘│ ││ ││└─┘│││\\n││└───┴─┘│ │└───┘││\\n│└───────┴─┴─────┘│\\n└─────────────────┘\\n dtree 3 3 3 1 1 3 3 3\\n┌─────────────────────────┐\\n│┌─────────┬─┬─┬─────────┐│\\n││┌───────┐│1│1│┌───────┐││\\n│││┌─┬─┬─┐││ │ ││┌─┬─┬─┐│││\\n││││3│3│3│││ │ │││3│3│3││││\\n│││└─┴─┴─┘││ │ ││└─┴─┴─┘│││\\n││└───────┘│ │ │└───────┘││\\n│└─────────┴─┴─┴─────────┘│\\n└─────────────────────────┘\\n\",\n \"language\": \"J\"\n },\n {\n \"code\": \" t=: ;:'(a b c) d (e f g)'\\n p=: ;:'()'\\n d=: +/\\\\-/p=/t\\n k=: =/p=/t\\n merge d <@]^:[&.>&(k&#) t\\n┌───────┬─┬───────┐\\n│┌─┬─┬─┐│d│┌─┬─┬─┐│\\n││a│b│c││ ││e│f│g││\\n│└─┴─┴─┘│ │└─┴─┴─┘│\\n└───────┴─┴───────┘\\n\",\n \"language\": \"J\"\n },\n {\n \"code\": \"pnest=: {{\\n t=. ;:y NB. tokens\\n p=. (;:'()')=/t NB. paren token matches\\n d=: +/\\\\-/p NB. paren token depths\\n k=: =/p NB. keep non-paren tokens\\n merge d <@]^:[&.>&(k&#) t NB. exercise task\\n}}\\n\",\n \"language\": \"J\"\n },\n {\n \"code\": \" pnest '((a b) c (d e) f) g (h i)'\\n┌─────────────────┬─┬─────┐\\n│┌─────┬─┬─────┬─┐│g│┌─┬─┐│\\n││┌─┬─┐│c│┌─┬─┐│f││ ││h│i││\\n│││a│b││ ││d│e││ ││ │└─┴─┘│\\n││└─┴─┘│ │└─┴─┘│ ││ │ │\\n│└─────┴─┴─────┴─┘│ │ │\\n└─────────────────┴─┴─────┘\\n\",\n \"language\": \"J\"\n },\n {\n \"code\": \"import java.util.ArrayList;\\nimport java.util.Arrays;\\nimport java.util.List;\\n\\npublic final class TreeNestingLevels {\\n\\n\\tpublic static void main(String[] args) {\\n\\t\\tList<List<Integer>> lists = List.of(\\n \\t\\t\\tArrays.asList(),\\n\\t\\t\\tArrays.asList( 1, 2, 4 ),\\n\\t\\t\\tArrays.asList( 3, 1, 3, 1 ),\\n\\t\\t\\tArrays.asList( 1, 2, 3, 1 ),\\n\\t\\t\\tArrays.asList( 3, 2, 1, 3 ),\\n\\t\\t\\tArrays.asList( 3, 3, 3, 1, 1, 3, 3, 3 )\\n\\t\\t);\\n\\t\\t\\n\\t\\tfor ( List<Integer> list : lists ) {\\n\\t\\t List<Object> tree = createTree(list);\\n\\t\\t System.out.println(list + \\\" --> \\\" + tree);\\n\\t\\t}\\t\\n\\t}\\n\\t\\n\\tprivate static List<Object> createTree(List<Integer> list) {\\n\\t\\treturn makeTree(list, 0, 1);\\n\\t}\\t\\n\\t\\n\\tprivate static List<Object> makeTree(List<Integer> list, int index, int depth) {\\n\\t\\tList<Object> tree = new ArrayList<Object>();\\n\\t\\tint current;\\n\\t\\t\\n\\t\\twhile ( index < list.size() && depth <= ( current = list.get(index) ) ) {\\n\\t\\t\\tif ( depth == current ) {\\n\\t\\t\\t\\ttree.add(current);\\n\\t\\t\\t\\tindex += 1;\\n\\t\\t\\t} else {\\n\\t\\t\\t\\ttree.add(makeTree(list, index, depth + 1));\\n\\t\\t\\t\\tfinal int position = list.subList(index, list.size()).indexOf(depth);\\n\\t\\t\\t\\tindex += ( position == -1 ) ? list.size() : position;\\n\\t\\t\\t}\\t\\t\\t\\n\\t\\t}\\n\\t\\t\\n\\t\\treturn tree;\\t\\t\\n\\t}\\n\\t\\n}\\n\",\n \"language\": \"Java\"\n },\n {\n \"code\": \"function makenested(list)\\n nesting = 0\\n str = isempty(list) ? \\\"[]\\\" : \\\"\\\"\\n for n in list\\n if n > nesting\\n str *= \\\"[\\\"^(n - nesting)\\n nesting = n\\n elseif n < nesting\\n str *= \\\"]\\\"^(nesting - n) * \\\", \\\"\\n nesting = n\\n end\\n str *= \\\"$n, \\\"\\n end\\n str *= \\\"]\\\"^nesting\\n return eval(Meta.parse(str))\\nend\\n\\nfor test in [[], [1, 2, 4], [3, 1, 3, 1], [1, 2, 3, 1], [3, 2, 1, 3], [3, 3, 3, 1, 1, 3, 3, 3]]\\n result = \\\"$test => $(makenested(test))\\\"\\n println(replace(result, \\\"Any\\\" => \\\"\\\"))\\nend\\n\",\n \"language\": \"Julia\"\n },\n {\n \"code\": \"import sequtils, strutils\\n\\ntype\\n Kind = enum kValue, kList\\n Node = ref object\\n case kind: Kind\\n of kValue: value: int\\n of kList: list: seq[Node]\\n\\n\\nproc newTree(s: varargs[int]): Node =\\n ## Build a tree from a list of level values.\\n var level = 1\\n result = Node(kind: kList)\\n var stack = @[result]\\n for n in s:\\n if n <= 0:\\n raise newException(ValueError, \\\"expected a positive integer, got \\\" & $n)\\n let node = Node(kind: kValue, value: n)\\n if n < level:\\n # Unstack lists.\\n stack.setLen(n)\\n level = n\\n else:\\n while n > level:\\n # Create intermediate lists.\\n let newList = Node(kind: kList)\\n stack[^1].list.add newList\\n stack.add newList\\n inc level\\n # Add value.\\n stack[^1].list.add node\\n\\n\\nproc `$`(node: Node): string =\\n ## Display a tree using a nested lists representation.\\n if node.kind == kValue: $node.value\\n else: '[' & node.list.mapIt($it).join(\\\", \\\") & ']'\\n\\n\\nfor list in [newSeq[int](), # Empty list (== @[]).\\n @[1, 2, 4],\\n @[3, 1, 3, 1],\\n @[1, 2, 3, 1],\\n @[3, 2, 1, 3],\\n @[3, 3, 3, 1, 1, 3, 3, 3]]:\\n echo ($list).align(25), \\\" → \\\", newTree(list)\\n\",\n \"language\": \"Nim\"\n },\n {\n \"code\": \"uses console\\ndeclare DemoTree(string src)\\nDemoTree \\\"[]\\\"\\nDemoTree \\\"[1, 2, 4]\\\"\\nDemoTree \\\"[3, 1, 3, 1]\\\"\\nDemoTree \\\"[1, 2, 3, 1]\\\"\\nDemoTree \\\"[3, 2, 1, 3]\\\"\\nDemoTree \\\"[3, 3, 3, 1, 1, 3, 3, 3]\\\"\\npause\\nend\\n\\n/*\\nRESULTS:\\n========\\n\\n[]\\n[]\\n\\n[1, 2, 4]\\n[ 1,[ 2,[[ 4]]]]\\n\\n[3, 1, 3, 1]\\n[[[ 3]], 1,[[ 3]], 1]\\n\\n[1, 2, 3, 1]\\n[ 1,[ 2,[ 3]], 1]\\n\\n[3, 2, 1, 3]\\n[[[ 3], 2], 1,[[ 3]]]\\n\\n[3, 3, 3, 1, 1, 3, 3, 3]\\n[[[ 3, 3, 3]], 1, 1,[[ 3, 3, 3]]]\\n*/\\n\\n\\n\\nsub DemoTree(string src)\\n========================\\n\\nstring tree=nuls 1000 'TREE OUTPUT\\nint i=1 'src char iterator\\nint j=1 'tree char iterator\\nbyte bs at strptr src 'src bytes\\nbyte bt at strptr tree 'tree bytes\\nint bl=len src 'end of src\\nint lvl 'current tree level\\nint olv 'prior tree level\\nint v 'number value\\nstring vs 'number in string form\\n\\ndo\\n exit if i>bl\\n select bs[i]\\n case 91 '['\\n i++\\n case 93 ']'\\n if i=bl\\n gosub writex\\n endif\\n i++\\n case 44 ','\\n i++\\n gosub writex\\n case 0 to 32 'white space\\n i++\\n 'bt[j]=\\\" \\\" : j++\\n case 48 to 57 '0..9'\\n gosub ReadDigits\\n case else\\n i++\\n end select\\nloop\\ntree=left(tree,j-1)\\noutput src cr\\noutput tree cr cr\\nexit sub\\n\\n'SUBROUTINES OF DEMOTREE:\\n=========================\\n\\nwritex:\\n=======\\nolv=lvl\\n if i>=bl\\n if v=0 and olv=0\\n tree=\\\"[]\\\" : j=3\\n ret\\n endif\\n endif\\n if v<olv\\n gosub WriteRbr\\n endif\\n if olv\\n gosub WriteComma\\n endif\\n if v>olv\\n gosub WriteLbr\\n endif\\n gosub WriteDigits '3]]'\\n if i>=bl\\n v=0\\n gosub WriteRbr\\n endif\\nret\\n\\nReadDigits:\\n===========\\nv=0\\nwhile i<=bl\\n select bs[i]\\n case 48 to 57 '1..9\\n v*=10 : v+=bs[i]-48 'digit\\n case else\\n exit while\\n end select\\n i++\\nwend\\nret\\n'\\nWriteDigits:\\n============\\nvs=\\\" \\\"+str(v) : mid(tree,j,vs) : j+=len vs\\nret\\n\\nWriteLbr:\\n=========\\nwhile v>lvl\\n bt[j]=91 : j++ : lvl++\\nwend\\nret\\n\\nWriteRbr:\\n=========\\nwhile v<lvl\\n bt[j]=93 : j++ : lvl--\\nwend\\nret\\n\\nWriteComma:\\n===========\\nbt[j]=44 : j++ ','\\nret\\n\\nend sub\\n\",\n \"language\": \"OxygenBasic\"\n },\n {\n \"code\": \"#!/usr/bin/perl\\n\\nuse strict;\\nuse warnings;\\nuse Data::Dump qw(dd pp);\\n\\nmy @tests =\\n (\\n []\\n ,[1, 2, 4]\\n ,[3, 1, 3, 1]\\n ,[1, 2, 3, 1]\\n ,[3, 2, 1, 3]\\n ,[3, 3, 3, 1, 1, 3, 3, 3]\\n );\\n\\nfor my $before ( @tests )\\n {\\n dd { before => $before };\\n local $_ = (pp $before) =~ s/\\\\d+/ '['x($&-1) . $& . ']'x($&-1) /ger;\\n 1 while s/\\\\](,\\\\s*)\\\\[/$1/;\\n my $after = eval;\\n dd { after => $after };\\n }\\n\",\n \"language\": \"Perl\"\n },\n {\n \"code\": \"use 5.020_000; # Also turns on `strict`\\nuse warnings;\\nuse experimental qw<signatures>;\\nuse Data::Dump qw<pp>;\\n\\nsub new_level ( $stack ) {\\n my $e = [];\\n push @{ $stack->[-1] }, $e;\\n push @{ $stack }, $e;\\n}\\nsub to_tree_iterative ( @xs ) {\\n my $nested = [];\\n my $stack = [$nested];\\n\\n for my $x (@xs) {\\n new_level($stack) while $x > @{$stack};\\n pop @{$stack} while $x < @{$stack};\\n push @{$stack->[-1]},$x;\\n }\\n\\n return $nested;\\n}\\nmy @tests = ([],[1,2,4],[3,1,3,1],[1,2,3,1],[3,2,1,3],[3,3,3,1,1,3,3,3]);\\nsay sprintf('%15s => ', join(' ', @{$_})), pp(to_tree_iterative(@{$_})) for @tests;\\n\",\n \"language\": \"Perl\"\n },\n {\n \"code\": \"-->\\n <span style=\\\"color: #008080;\\\">function</span> <span style=\\\"color: #000000;\\\">test</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #004080;\\\">sequence</span> <span style=\\\"color: #000000;\\\">s</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #004080;\\\">integer</span> <span style=\\\"color: #000000;\\\">level</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;\\\">1</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #004080;\\\">sequence</span> <span style=\\\"color: #000000;\\\">res</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #0000FF;\\\">{},</span> <span style=\\\"color: #000000;\\\">part</span>\\n <span style=\\\"color: #008080;\\\">while</span> <span style=\\\"color: #000000;\\\">idx</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: #008080;\\\">do</span>\\n <span style=\\\"color: #008080;\\\">switch</span> <span style=\\\"color: #7060A8;\\\">compare</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">s</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">idx</span><span style=\\\"color: #0000FF;\\\">],</span><span style=\\\"color: #000000;\\\">level</span><span style=\\\"color: #0000FF;\\\">)</span> <span style=\\\"color: #008080;\\\">do</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: #0000FF;\\\">{</span><span style=\\\"color: #000000;\\\">idx</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">part</span><span style=\\\"color: #0000FF;\\\">}</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">test</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">s</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">level</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>\\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;\\\">part</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #008080;\\\">case</span> <span style=\\\"color: #000000;\\\">0</span><span style=\\\"color: #0000FF;\\\">:</span> <span style=\\\"color: #000000;\\\">res</span> <span style=\\\"color: #0000FF;\\\">&=</span> <span style=\\\"color: #000000;\\\">s</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">idx</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;\\\">idx</span> <span style=\\\"color: #0000FF;\\\">-=</span> <span style=\\\"color: #000000;\\\">1</span> <span style=\\\"color: #008080;\\\">exit</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">switch</span>\\n <span style=\\\"color: #000000;\\\">idx</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: #008080;\\\">iff</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">level</span><span style=\\\"color: #0000FF;\\\">=</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">?</span><span style=\\\"color: #000000;\\\">res</span><span style=\\\"color: #0000FF;\\\">:{</span><span style=\\\"color: #000000;\\\">idx</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;\\\">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>\\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;\\\">4</span><span style=\\\"color: #0000FF;\\\">},</span>\\n <span style=\\\"color: #000080;font-style:italic;\\\">-- {1, 2, 4, 2, 2, 1}, -- (fine too)</span>\\n <span style=\\\"color: #0000FF;\\\">{</span><span style=\\\"color: #000000;\\\">3</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;\\\">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;\\\">2</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">3</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;\\\">3</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;\\\">3</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;\\\">3</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">3</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;\\\">3</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">3</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">3</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: #004080;\\\">sequence</span> <span style=\\\"color: #000000;\\\">ti</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: #000000;\\\">res</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">test</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">ti</span><span style=\\\"color: #0000FF;\\\">),</span>\\n <span style=\\\"color: #000000;\\\">rpp</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">ppf</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">res</span><span style=\\\"color: #0000FF;\\\">,{</span><span style=\\\"color: #000000;\\\">pp_Nest</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">3</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">pp_Indent</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">4</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;\\\">\\\"%v nests to %v\\\\n or %s\\\\n\\\"</span><span style=\\\"color: #0000FF;\\\">,{</span><span style=\\\"color: #000000;\\\">ti</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">res</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">rpp</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\": \"-->\\n <span style=\\\"color: #008080;\\\">function</span> <span style=\\\"color: #000000;\\\">nest</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #004080;\\\">sequence</span> <span style=\\\"color: #000000;\\\">input</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;\\\">input</span><span style=\\\"color: #0000FF;\\\">)</span> <span style=\\\"color: #008080;\\\">then</span>\\n <span style=\\\"color: #008080;\\\">for</span> <span style=\\\"color: #000000;\\\">level</span><span style=\\\"color: #0000FF;\\\">=</span><span style=\\\"color: #7060A8;\\\">max</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">input</span><span style=\\\"color: #0000FF;\\\">)</span> <span style=\\\"color: #008080;\\\">to</span> <span style=\\\"color: #000000;\\\">2</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;\\\">sequence</span> <span style=\\\"color: #000000;\\\">output</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #0000FF;\\\">{}</span>\\n <span style=\\\"color: #004080;\\\">bool</span> <span style=\\\"color: #000000;\\\">subnest</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;\\\">input</span><span style=\\\"color: #0000FF;\\\">)</span> <span style=\\\"color: #008080;\\\">do</span>\\n <span style=\\\"color: #004080;\\\">object</span> <span style=\\\"color: #000000;\\\">ii</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">input</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: #004080;\\\">integer</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">ii</span><span style=\\\"color: #0000FF;\\\">)</span> <span style=\\\"color: #008080;\\\">and</span> <span style=\\\"color: #000000;\\\">ii</span><span style=\\\"color: #0000FF;\\\"><</span><span style=\\\"color: #000000;\\\">level</span> <span style=\\\"color: #008080;\\\">then</span>\\n <span style=\\\"color: #000000;\\\">subnest</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #004600;\\\">false</span>\\n <span style=\\\"color: #000000;\\\">output</span> <span style=\\\"color: #0000FF;\\\">&=</span> <span style=\\\"color: #000000;\\\">ii</span>\\n <span style=\\\"color: #008080;\\\">elsif</span> <span style=\\\"color: #008080;\\\">not</span> <span style=\\\"color: #000000;\\\">subnest</span> <span style=\\\"color: #008080;\\\">then</span>\\n <span style=\\\"color: #000000;\\\">output</span> <span style=\\\"color: #0000FF;\\\">&=</span> <span style=\\\"color: #0000FF;\\\">{{</span><span style=\\\"color: #000000;\\\">ii</span><span style=\\\"color: #0000FF;\\\">}}</span>\\n <span style=\\\"color: #000000;\\\">subnest</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #004600;\\\">true</span>\\n <span style=\\\"color: #008080;\\\">else</span>\\n <span style=\\\"color: #000000;\\\">output</span><span style=\\\"color: #0000FF;\\\">[$]</span> <span style=\\\"color: #0000FF;\\\">&=</span> <span style=\\\"color: #0000FF;\\\">{</span><span style=\\\"color: #000000;\\\">ii</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;\\\">input</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">output</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;\\\">input</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">function</span>\\n<!--\\n\",\n \"language\": \"Phix\"\n },\n {\n \"code\": \"def to_tree(x, index=0, depth=1):\\n so_far = []\\n while index < len(x):\\n this = x[index]\\n if this == depth:\\n so_far.append(this)\\n elif this > depth:\\n index, deeper = to_tree(x, index, depth + 1)\\n so_far.append(deeper)\\n else: # this < depth:\\n index -=1\\n break\\n index += 1\\n return (index, so_far) if depth > 1 else so_far\\n\\n\\nif __name__ == \\\"__main__\\\":\\n from pprint import pformat\\n\\n def pnest(nest:list, width: int=9) -> str:\\n text = pformat(nest, width=width).replace('\\\\n', '\\\\n ')\\n print(f\\\" OR {text}\\\\n\\\")\\n\\n exercises = [\\n [],\\n [1, 2, 4],\\n [3, 1, 3, 1],\\n [1, 2, 3, 1],\\n [3, 2, 1, 3],\\n [3, 3, 3, 1, 1, 3, 3, 3],\\n ]\\n for flat in exercises:\\n nest = to_tree(flat)\\n print(f\\\"{flat} NESTS TO: {nest}\\\")\\n pnest(nest)\\n\",\n \"language\": \"Python\"\n },\n {\n \"code\": \"def to_tree(x: list) -> list:\\n nested = []\\n stack = [nested]\\n for this in x:\\n while this != len(stack):\\n if this > len(stack):\\n innermost = [] # new level\\n stack[-1].append(innermost) # nest it\\n stack.append(innermost) # push it\\n else: # this < stack:\\n stack.pop(-1)\\n stack[-1].append(this)\\n\\n return nested\\n\",\n \"language\": \"Python\"\n },\n {\n \"code\": \"'''Tree from nesting levels'''\\n\\nfrom itertools import chain, repeat\\nfrom operator import add\\n\\n\\n# treeFromSparseLevels :: [Int] -> Tree Maybe Int\\ndef treeFromSparseLevels(levelList):\\n '''A Forest (list of Trees) of (Maybe Int) values,\\n in which implicit nodes have the value None.\\n '''\\n return Node(None)(\\n forestFromLevels(\\n rooted(normalized(levelList))\\n )\\n )\\n\\n\\n# forestFromLevels :: [(Int, a)] -> [Tree a]\\ndef forestFromLevels(nvs):\\n '''A list of generic trees derived from a list of\\n values paired with integers representing\\n nesting depths.\\n '''\\n def go(xs):\\n if xs:\\n level, v = xs[0]\\n children, rest = span(\\n lambda x: level < x[0]\\n )(xs[1:])\\n return [Node(v)(go(children))] + go(rest)\\n else:\\n return []\\n return go(nvs)\\n\\n\\n# bracketNest :: Maybe Int -> Nest -> Nest\\ndef bracketNest(maybeLevel):\\n '''An arbitrary nest of bracketed\\n lists and sublists.\\n '''\\n def go(xs):\\n subNest = concat(xs)\\n return [subNest] if None is maybeLevel else (\\n [maybeLevel, subNest] if subNest else (\\n [maybeLevel]\\n )\\n )\\n return go\\n\\n\\n# showTree :: Tree Maybe Int -> String\\ndef showTree(tree):\\n '''A string representation of\\n a Maybe Int tree.\\n '''\\n return drawTree(\\n fmapTree(repr)(tree)\\n )\\n\\n\\n# sparseLevelsFromTree :: Tree (Maybe Int) -> [Int]\\ndef sparseLevelsFromTree(tree):\\n '''Sparse representation of the tree\\n a list of nest level integers.\\n '''\\n def go(x):\\n return lambda xs: concat(xs) if (\\n None is x\\n ) else [x] + concat(xs)\\n return foldTree(go)(tree)\\n\\n\\n# ------------------------- TEST -------------------------\\n# main :: IO ()\\ndef main():\\n '''Test the building and display of\\n normalized forests from level integers.\\n '''\\n for xs in [\\n [],\\n [1, 2, 4],\\n [3, 1, 3, 1],\\n [1, 2, 3, 1],\\n [3, 2, 1, 3],\\n [3, 3, 3, 1, 1, 3, 3, 3]\\n ]:\\n tree = treeFromSparseLevels(xs)\\n (\\n print('From: ' + repr(xs)),\\n print('Through tuple nest:'),\\n print(repr(tree)),\\n print('\\\\nTree:'),\\n print(showTree(tree)),\\n print('\\\\nto bracket nest:'),\\n print(\\n repr(\\n root(foldTree(bracketNest)(tree))\\n )\\n ),\\n print(\\n 'and back to: ' + (\\n repr(sparseLevelsFromTree(tree))\\n )\\n ),\\n print()\\n )\\n\\n\\n# ------ TRANSLATION TO A CONSISTENT DATA STRUCTURE ------\\n\\n# normalized :: [Int] -> [(Int, Maybe Int)]\\ndef normalized(xs):\\n '''Explicit representation of implicit nodes.\\n '''\\n if xs:\\n x = xs[0]\\n h = [(x, x)]\\n return h if 1 == len(xs) else (\\n h + [(1 + x, None)] if (\\n 1 < (xs[1] - x)\\n ) else h\\n ) + normalized(xs[1:])\\n else:\\n return []\\n\\n\\n# rooted :: [(Int, Maybe Int)] -> [(Int, Maybe Int)]\\ndef rooted(pairs):\\n '''Path from the virtual root\\n to the first explicit node.\\n '''\\n def go(xs):\\n n = xs[0][0]\\n return xs if 1 == n else (\\n [(x, Nothing()) for x in range(1, n)] + xs\\n )\\n return go([\\n x for x in pairs if 1 <= x[0]\\n ]) if pairs else []\\n\\n\\n# ---------------- GENERIC TREE FUNCTIONS ----------------\\n\\n# Node :: a -> [Tree a] -> Tree a\\ndef Node(v):\\n '''Constructor for a Tree node which connects a\\n value of some kind to a list of zero or\\n more child trees.\\n '''\\n return lambda xs: (v, xs)\\n\\n\\n# draw :: Tree a -> [String]\\ndef draw(node):\\n '''List of the lines of an ASCII\\n diagram of a tree.\\n '''\\n def shift_(h, other, xs):\\n return list(map(\\n add,\\n chain(\\n [h], (\\n repeat(other, len(xs) - 1)\\n )\\n ),\\n xs\\n ))\\n\\n def drawSubTrees(xs):\\n return (\\n (\\n ['|'] + shift_(\\n '├─ ', '│ ', draw(xs[0])\\n ) + drawSubTrees(xs[1:])\\n ) if 1 < len(xs) else ['|'] + shift_(\\n '└─ ', ' ', draw(xs[0])\\n )\\n ) if xs else []\\n\\n return (root(node)).splitlines() + (\\n drawSubTrees(nest(node))\\n )\\n\\n\\n# drawForest :: [Tree String] -> String\\ndef drawForest(trees):\\n '''A simple unicode character representation of\\n a list of trees.\\n '''\\n return '\\\\n'.join(map(drawTree, trees))\\n\\n\\n# drawTree :: Tree a -> String\\ndef drawTree(tree):\\n '''ASCII diagram of a tree.'''\\n return '\\\\n'.join(draw(tree))\\n\\n\\n# fmapTree :: (a -> b) -> Tree a -> Tree b\\ndef fmapTree(f):\\n '''A new tree holding the results of\\n an application of f to each root in\\n the existing tree.\\n '''\\n def go(x):\\n return Node(\\n f(root(x))\\n )([go(v) for v in nest(x)])\\n return go\\n\\n\\n# foldTree :: (a -> [b] -> b) -> Tree a -> b\\ndef foldTree(f):\\n '''The catamorphism on trees. A summary\\n value defined by a depth-first fold.\\n '''\\n def go(node):\\n return f(root(node))([\\n go(x) for x in nest(node)\\n ])\\n return go\\n\\n\\n# nest :: Tree a -> [Tree a]\\ndef nest(t):\\n '''Accessor function for children of tree node.'''\\n return t[1]\\n\\n\\n# root :: Tree a -> a\\ndef root(t):\\n '''Accessor function for data of tree node.'''\\n return t[0]\\n\\n\\n# -------------------- GENERIC OTHER ---------------------\\n\\n# Nothing :: () -> Maybe a\\ndef Nothing():\\n '''Constructor for an empty Maybe (option type) value.\\n Empty wrapper returned where a computation is not possible.\\n '''\\n return None\\n\\n\\n# concat :: [[a]] -> [a]\\n# concat :: [String] -> String\\ndef concat(xs):\\n '''The concatenation of all the elements\\n in a list or iterable.\\n '''\\n def f(ys):\\n zs = list(chain(*ys))\\n return ''.join(zs) if isinstance(ys[0], str) else zs\\n\\n return (\\n f(xs) if isinstance(xs, list) else (\\n chain.from_iterable(xs)\\n )\\n ) if xs else []\\n\\n\\n# span :: (a -> Bool) -> [a] -> ([a], [a])\\ndef span(p):\\n '''The longest (possibly empty) prefix of xs\\n that contains only elements satisfying p,\\n tupled with the remainder of xs.\\n span p xs is equivalent to\\n (takeWhile p xs, dropWhile p xs).\\n '''\\n def match(ab):\\n b = ab[1]\\n return not b or not p(b[0])\\n\\n def f(ab):\\n a, b = ab\\n return a + [b[0]], b[1:]\\n\\n def go(xs):\\n return until(match)(f)(([], xs))\\n return go\\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 ] is prev ( --> s )\\n\\n [ temp take\\n swap join\\n temp put ] is add$ ( x --> )\\n\\n [ dup [] = if done\\n 0 prev put\\n $ \\\"' \\\" temp put\\n witheach\\n [ dup prev take -\\n over prev put\\n dup 0 > iff\\n [ times\\n [ $ \\\"[ \\\" add$ ] ]\\n else\\n [ abs times\\n [ $ \\\"] \\\" add$ ] ]\\n number$ space join add$ ]\\n prev take times\\n [ $ \\\"] \\\" add$ ]\\n temp take quackery ] is nesttree ( [ --> [ )\\n\\n ' [ [ ]\\n [ 1 2 4 ]\\n [ 3 1 3 1 ]\\n [ 1 2 3 1 ]\\n [ 3 2 1 3 ]\\n [ 3 3 3 1 1 3 3 3 ] ]\\n\\n witheach\\n [ dup echo say \\\" --> \\\"\\n nesttree echo cr cr ]\\n\",\n \"language\": \"Quackery\"\n },\n {\n \"code\": \"sub new_level ( @stack --> Nil ) {\\n my $e = [];\\n push @stack.tail, $e;\\n push @stack, $e;\\n}\\nsub to_tree_iterative ( @xs --> List ) {\\n my $nested = [];\\n my @stack = $nested;\\n\\n for @xs -> Int $x {\\n new_level(@stack) while $x > @stack;\\n pop @stack while $x < @stack;\\n push @stack.tail, $x;\\n }\\n\\n return $nested;\\n}\\nmy @tests = (), (1, 2, 4), (3, 1, 3, 1), (1, 2, 3, 1), (3, 2, 1, 3), (3, 3, 3, 1, 1, 3, 3, 3);\\nsay .Str.fmt( '%15s => ' ), .&to_tree_iterative for @tests;\\n\",\n \"language\": \"Raku\"\n },\n {\n \"code\": \"sub to_tree_recursive ( @list, $index is copy, $depth ) {\\n my @so_far = gather while $index <= @list.end {\\n my $t = @list[$index];\\n\\n given $t <=> $depth {\\n when Order::Same {\\n take $t;\\n }\\n when Order::More {\\n ( $index, my $n1 ) = to_tree_recursive( @list, $index, $depth+1 );\\n take $n1;\\n }\\n when Order::Less {\\n $index--;\\n last;\\n }\\n }\\n $index++;\\n }\\n\\n my $i = ($depth > 1) ?? $index !! -1;\\n return $i, @so_far;\\n}\\nmy @tests = (), (1, 2, 4), (3, 1, 3, 1), (1, 2, 3, 1), (3, 2, 1, 3), (3, 3, 3, 1, 1, 3, 3, 3);\\nsay .Str.fmt( '%15s => ' ), to_tree_recursive( $_, 0, 1 ).[1] for @tests;\\n\",\n \"language\": \"Raku\"\n },\n {\n \"code\": \"use MONKEY-SEE-NO-EVAL;\\nsub to_tree_string_eval ( @xs --> Array ) {\\n my @gap = [ |@xs, 0 ] Z- [ 0, |@xs ];\\n\\n my @open = @gap.map( '[' x * );\\n my @close = @gap.map( ']' x -* );\\n\\n my @wrapped = [Z~] @open, @xs, @close.skip;\\n\\n return EVAL @wrapped.join(',').subst(:g, ']]', '],]') || '[]';\\n}\\nmy @tests = (), (1, 2, 4), (3, 1, 3, 1), (1, 2, 3, 1), (3, 2, 1, 3), (3, 3, 3, 1, 1, 3, 3, 3);\\nsay .Str.fmt( '%15s => ' ), .&to_tree_string_eval for @tests;\\n\",\n \"language\": \"Raku\"\n },\n {\n \"code\": \"import \\\"./seq\\\" for Stack\\nimport \\\"./fmt\\\" for Fmt\\n\\nvar toTree = Fn.new { |list|\\n var nested = []\\n var s = Stack.new()\\n s.push(nested)\\n for (n in list) {\\n while (n != s.count) {\\n if (n > s.count) {\\n var inner = []\\n s.peek().add(inner)\\n s.push(inner)\\n } else {\\n s.pop()\\n }\\n }\\n s.peek().add(n)\\n }\\n return nested\\n}\\n\\nvar tests = [\\n [],\\n [1, 2, 4],\\n [3, 1, 3, 1],\\n [1, 2, 3, 1],\\n [3, 2, 1, 3],\\n [3, 3, 3, 1, 1, 3, 3, 3]\\n]\\nfor (test in tests) {\\n var nest = toTree.call(test)\\n Fmt.print(\\\"$24n => $n\\\", test, nest)\\n}\\n\",\n \"language\": \"Wren\"\n },\n {\n \"code\": \"import \\\"./fmt\\\" for Fmt\\n\\nvar toTree // recursive\\ntoTree = Fn.new { |list, index, depth|\\n var soFar = []\\n while (index < list.count) {\\n var t = list[index]\\n if (t == depth) {\\n soFar.add(t)\\n } else if (t > depth) {\\n var n = toTree.call(list, index, depth+1)\\n index = n[0]\\n soFar.add(n[1])\\n } else {\\n index = index - 1\\n break\\n }\\n index = index + 1\\n }\\n if (depth > 1) return [index, soFar]\\n return [-1, soFar]\\n}\\n\\nvar tests = [\\n [],\\n [1, 2, 4],\\n [3, 1, 3, 1],\\n [1, 2, 3, 1],\\n [3, 2, 1, 3],\\n [3, 3, 3, 1, 1, 3, 3, 3]\\n]\\nfor (test in tests) {\\n var n = toTree.call(test, 0, 1)\\n Fmt.print(\\\"$24n => $n\\\", test, n[1])\\n}\\n\",\n \"language\": \"Wren\"\n },\n {\n \"code\": \"proc ShowTree(List);\\nint List, NestLevel, I;\\n[NestLevel:= 0;\\nfor I:= 0 to -1>>1 do\\n [while List(I) < NestLevel do\\n [ChOut(0, ^]); NestLevel:= NestLevel-1];\\n if List(I) = 0 then [CrLf(0); return];\\n if I # 0 then Text(0, \\\", \\\");\\n while List(I) > NestLevel do\\n [ChOut(0, ^[); NestLevel:= NestLevel+1];\\n IntOut(0, NestLevel);\\n ];\\n];\\n\\n[ShowTree([0]);\\nShowTree([1, 2, 4, 0]);\\nShowTree([3, 1, 3, 1, 0]);\\nShowTree([1, 2, 3, 1, 0]);\\nShowTree([3, 2, 1, 3, 0]);\\nShowTree([3, 3, 3, 1, 1, 3, 3, 3, 0]);\\nShowTree([1, 2, 4, 2, 2, 1, 0]);\\n]\\n\",\n \"language\": \"XPL0\"\n }\n]","isConversational":false},"task_name":{"kind":"string","value":"Tree-from-nesting-levels"}}},{"rowIdx":1771,"cells":{"solutions":{"kind":"list like","value":[{"code":"---\ncategory:\n- Recursion\nfrom: http://rosettacode.org/wiki/Tree_traversal\nnote: Data Structures\n","language":"00-META"},{"code":";Task:\nImplement a binary tree where each node carries an integer, and implement:\n:::* pre-order,\n:::* in-order, \n:::* post-order, and \n:::* level-order [[wp:Tree traversal|traversal]]. \n\n\nUse those traversals to output the following tree:\n 1\n / \\\n / \\\n / \\\n 2 3\n / \\ /\n 4 5 6\n / / \\\n 7 8 9\n\nThe correct output should look like this:\n preorder: 1 2 4 7 5 3 6 8 9\n inorder: 7 4 2 5 1 8 6 9 3\n postorder: 7 4 5 2 8 9 6 3 1\n level-order: 1 2 3 4 5 6 7 8 9\n\n\n;See also:\n* Wikipedia article: [[wp:Tree traversal|Tree traversal]].\n<br><br>\n","language":"00-TASK"},{"code":"T Node\n Int data\n Node? left\n Node? right\n\n F (data, Node? left = N, Node? right = N)\n .data = data\n .left = left\n .right = right\n\n F preorder(visitor) -> N\n visitor(.data)\n I .left != N\n .left.preorder(visitor)\n I .right != N\n .right.preorder(visitor)\n\n F inorder(visitor) -> N\n I .left != N\n .left.inorder(visitor)\n visitor(.data)\n I .right != N\n .right.inorder(visitor)\n\n F postorder(visitor) -> N\n I .left != N\n .left.postorder(visitor)\n I .right != N\n .right.postorder(visitor)\n visitor(.data)\n\n F preorder2(&d, level = 0) -> N\n d[level].append(.data)\n I .left != N\n .left.preorder2(d, level + 1)\n I .right != N\n .right.preorder2(d, level + 1)\n\n F levelorder(visitor)\n DefaultDict[Int, [Int]] d\n .preorder2(&d)\n L(k) sorted(d.keys())\n L(v) d[k]\n visitor(v)\n\nV tree = Node(1,\n Node(2,\n Node(4,\n Node(7, N, N),\n N),\n Node(5, N, N)),\n Node(3,\n Node(6,\n Node(8, N, N),\n Node(9, N, N)),\n N))\n\nF printwithspace(Int i)\n print(‘#. ’.format(i), end' ‘’)\n\nprint(‘ preorder: ’, end' ‘’)\ntree.preorder(printwithspace)\nprint()\nprint(‘ inorder: ’, end' ‘’)\ntree.inorder(printwithspace)\nprint()\nprint(‘ postorder: ’, end' ‘’)\ntree.postorder(printwithspace)\nprint()\nprint(‘levelorder: ’, end' ‘’)\ntree.levelorder(printwithspace)\nprint()\n","language":"11l"},{"code":" org 100h\n jmp demo\n ;;; Traverse tree at DE according to method at BC.\n ;;; Call routine at HL with DE=<value> for each value encounterd.\ntravrs: shld trvcb+1 ; Store routine pointer\n xchg ; Tree in HL\n push b ; Jump to method BC\n ret\n ;;; Preorder traversal\npreo: mov a,h\n ora l\n rz ; Null node = stop\n mov e,m\n inx h\n mov d,m ; Load value\n inx h\n push h ; Handle value\n call trvcb\n pop h ; Left node\n mov e,m\n inx h\n mov d,m\n inx h\n push h ; Save pointer\n xchg\n call preo\n pop h\n mov e,m\n inx h ; Right node\n mov d,m\n xchg\n jmp preo\n ;;; Inorder traversal\nino: mov a,h\n ora l\n rz ; Null node = stop\n mov e,m\n inx h\n mov d,m ; Load value\n inx h\n push d ; Save value on stack\n mov e,m\n inx h\n mov d,m\n inx h ; Load left node\n push h ; Save pointer on stack\n xchg\n call ino ; Traverse left node\n pop h\n pop d ; Get value\n push h\n call trvcb ; Handle value\n pop h\n mov e,m\n inx h\n mov d,m\n xchg\n jmp ino ; Traverse right node\n ;;; Postorder traversal\nposto: mov a,h\n ora l\n rz ; Null node = stop\n mov e,m\n inx h\n mov d,m ; Load value\n inx h\n push d ; Keep value on stack\n mov e,m\n inx h\n mov d,m\n inx h ; Load left node\n push h\n xchg\n call posto ; Traverse left node\n pop h\n mov e,m\n inx h\n mov d,m ; Load right node\n xchg\n call posto ; Traverse right node\n pop d ; Get value from stack\n jmp trvcb ; Handle value\n ;;; Level-order traversal\nlvlo: shld queue ; Store current node at beginning of queue\n lxi h,queue ; HL = Queue start pointer\n lxi b,queue+2 ; BC = Queue end pointer\nlvllp: mov a,h ; When start == end, stop\n cmp b\n jnz lvlt ; Not equal\n mov a,l\n cmp c\n rz ; Equal = stop\nlvlt: mov e,m ; Load current node in DE\n inx h\n mov d,m\n inx h\n mov a,d ; Null node = ignore\n ora e\n jz lvllp\n push h ; Keep queue start pointer\n xchg ; HL = current node\n mov e,m ; Load value into DE\n inx h\n mov d,m\n inx h\n push h ; Keep pointer to left and right nodes\n push b ; And pointer to end of queue\n call trvcb ; Handle value\n pop b ; Restore pointer to end of queue\n pop h ; Restore pointer to left and right nodes\n mvi d,4 ; D = copy counter\nlvlcp: mov a,m ; Copy left and right nodes to queue\n stax b\n inx h\n inx b\n dcr d\n jnz lvlcp\n pop h ; Restore queue stack pointer\n jmp lvllp\ntrvcb: jmp 0 ; Callback pointer\n\n ;;; Run examples\ndemo: lhld 6 ; Move stack to top of memory\n sphl\n lxi h,0 ; So we can still RET out of the program\n push h\n lxi h,orders\norder: mov e,m ; Get string\n inx h\n mov d,m\n inx h\n mov a,e ; 0 = done\n ora d\n rz\n push h ; Print string\n call print\n pop h\n mov c,m ; Load method in BC\n inx h\n mov b,m\n inx h\n push h\n lxi d,tree ; Tree in DE\n lxi h,cb ; Callback in HL\n call travrs ; Traverse the tree\n lxi d,nl\n call print ; Newline\n pop h ; Restore table pointer\n jmp order\n\n ;;; Print the tree value. They're all <10 for the example, so we\n ;;; don't need multiple digits.\ncb: mvi a,'0'\n add e\n sta nstr\n lxi d,nstr\nprint: mvi c,9 ; CP/M print string call\n jmp 5\nnstr: db '* $'\nnl: db 13,10,'$'\n\n ;;; Example tree\ntree: dw 1, node2, node3\nnode2: dw 2, node4, node5\nnode3: dw 3, node6, 0\nnode4: dw 4, node7, 0\nnode5: dw 5, 0, 0\nnode6: dw 6, node8, node9\nnode7: dw 7, 0, 0\nnode8: dw 8, 0, 0\nnode9: dw 9, 0 ,0\n\n ;;; Table of names and orders\norders: dw spreo,preo\n dw sino,ino\n dw sposto,posto\n dw slvlo,lvlo\n dw 0\nspreo: db 'Preorder: $'\nsino: db 'Inorder: $'\nsposto: db 'Postorder: $'\nslvlo: db 'Level-order: $'\n\nqueue: equ $ ; Put level-order queue on heap\n","language":"8080-Assembly"},{"code":" cpu 8086\n org 100h\nsection .text\n jmp demo\n ;;; Traverse tree at SI. Call routine at CX with values in AX.\n ;;; CX must preserve BX, CX, SI, DI.\n ;;; Preorder traversal\npreo: test si,si\n jz pdone ; Zero pointer = done\n lodsw ; Load value\n call cx ; Handle value\n push si ; Keep value\n mov si,[si] ; Load left node\n call preo ; Traverse left node\n pop si\n mov si,[si+2] ; Load right node\n jmp preo ; Traverse right node\n ;;; Inorder traversal\nino: test si,si\n jz pdone ; Zero pointer = done\n push si\n mov si,[si+2] ; Load left node\n call ino ; Traverse left node\n pop si\n lodsw ; Load value\n call cx ; Handle value\n mov si,[si+2] ; Load right node\n jmp ino ; Traverse right node\n ;;; Postorder traversal\nposto: test si,si\n jz pdone ; Zero pointer = done\n push si\n mov si,[si+2] ; Load left node\n call posto ; Traverse left node\n pop si\n push si\n mov si,[si+4] ; Load right node\n call posto\n pop si ; Load value\n lodsw\n jmp cx ; Handle value\npdone: ret\n ;;; Level-order traversal\nlvlo: mov di,queue ; DI = queue end pointer\n mov ax,si\n mov si,di ; SI = queue start pointer\n stosw\n.step: cmp di,si ; If end == start, done\n je pdone\n lodsw ; Get next item\n test ax,ax ; Null?\n jz .step\n mov bx,si ; Keep start pointer in BX\n mov si,ax ; Load item\n lodsw ; Get value\n call cx ; Handle value\n lodsw ; Copy nodes to queue\n stosw\n lodsw\n stosw\n mov si,bx ; Put start pointer back\n jmp .step\n\n ;;; Demo code\ndemo: mov si,orders\n.loop: lodsw ; Load next order\n test ax,ax\n jz .done\n mov dx,ax ; Print order name\n mov ah,9\n int 21h\n lodsw ; Load order routine\n mov bp,si ; Keep SI\n mov si,tree ; Traverse the tree\n mov cx,pdgt ; Printing the digits\n call ax\n mov si,bp\n jmp .loop\n.done: ret\n\n ;;; Callback: print single digit\npdgt: add al,'0'\n mov [.str],al\n mov ah,9\n mov dx,.str\n int 21h\n ret\n.str: db '* $'\n\nsection .data\n ;;; List of orders\norders: dw .preo,preo\n dw .ino,ino\n dw .posto,posto\n dw .lvlo,lvlo\n dw 0\n.preo: db 'Preorder: $'\n.ino: db 13,10,'Inorder: $'\n.posto: db 13,10,'Postorder: $'\n.lvlo: db 13,10,'Level-order: $'\n\n ;;; Exampe tree\ntree: dw 1,.n2,.n3\n.n2: dw 2,.n4,.n5\n.n3: dw 3,.n6,0\n.n4: dw 4,.n7,0\n.n5: dw 5,0,0\n.n6: dw 6,.n8,.n9\n.n7: dw 7,0,0\n.n8: dw 8,0,0\n.n9: dw 9,0,0\n\nsection .bss\nqueue: resw 256\n","language":"8086-Assembly"},{"code":"/* ARM assembly AARCH64 Raspberry PI 3B */\n/* program deftree64.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 NBVAL, 9\n\n/*******************************************/\n/* Structures */\n/********************************************/\n/* structure tree */\n .struct 0\ntree_root: // root pointer\n .struct tree_root + 8\ntree_size: // number of element of tree\n .struct tree_size + 8\ntree_fin:\n/* structure node tree */\n .struct 0\nnode_left: // left pointer\n .struct node_left + 8\nnode_right: // right pointer\n .struct node_right + 8\nnode_value: // element value\n .struct node_value + 8\nnode_fin:\n/* structure queue*/\n .struct 0\nqueue_begin: // next pointer\n .struct queue_begin + 8\nqueue_end: // element value\n .struct queue_end + 8\nqueue_fin:\n/* structure node queue */\n .struct 0\nqueue_node_next: // next pointer\n .struct queue_node_next + 8\nqueue_node_value: // element value\n .struct queue_node_value + 8\nqueue_node_fin:\n/*******************************************/\n/* Initialized data */\n/*******************************************/\n.data\nszMessInOrder: .asciz \"inOrder :\\n\"\nszMessPreOrder: .asciz \"PreOrder :\\n\"\nszMessPostOrder: .asciz \"PostOrder :\\n\"\nszMessLevelOrder: .asciz \"LevelOrder :\\n\"\nszCarriageReturn: .asciz \"\\n\"\n/* datas error display */\nszMessErreur: .asciz \"Error detected.\\n\"\n/* datas message display */\nszMessResult: .ascii \"Element value : @ \\n\"\n\n/*******************************************/\n/* UnInitialized data */\n/*******************************************/\n.bss\n.align 4\nsZoneConv: .skip 24\nstTree: .skip tree_fin // place to structure tree\nstQueue: .skip queue_fin // place to structure queue\n/*******************************************/\n/* code section */\n/*******************************************/\n.text\n.global main\nmain:\n mov x1,1 // node tree value\n1:\n ldr x0,qAdrstTree // structure tree address\n bl insertElement // add element value x1\n cmp x0,-1\n beq 99f\n add x1,x1,1 // increment value\n cmp x1,NBVAL // end ?\n ble 1b // no -> loop\n\n ldr x0,qAdrszMessPreOrder\n bl affichageMess\n ldr x3,qAdrstTree // tree root address (begin structure)\n ldr x0,[x3,#tree_root]\n ldr x1,qAdrdisplayElement // function to execute\n bl preOrder\n\n ldr x0,qAdrszMessInOrder\n bl affichageMess\n ldr x3,qAdrstTree\n ldr x0,[x3,#tree_root]\n ldr x1,qAdrdisplayElement // function to execute\n bl inOrder\n\n ldr x0,qAdrszMessPostOrder\n bl affichageMess\n ldr x3,qAdrstTree\n ldr x0,[x3,#tree_root]\n ldr x1,qAdrdisplayElement // function to execute\n bl postOrder\n\n ldr x0,qAdrszMessLevelOrder\n bl affichageMess\n ldr x3,qAdrstTree\n ldr x0,[x3,#tree_root]\n ldr x1,qAdrdisplayElement // function to execute\n bl levelOrder\n b 100f\n99: // display error\n ldr x0,qAdrszMessErreur\n bl affichageMess\n100: // standard end of the program\n mov x8,EXIT // request to exit program\n svc 0 // perform system call\nqAdrszMessInOrder: .quad szMessInOrder\nqAdrszMessPreOrder: .quad szMessPreOrder\nqAdrszMessPostOrder: .quad szMessPostOrder\nqAdrszMessLevelOrder: .quad szMessLevelOrder\nqAdrszMessErreur: .quad szMessErreur\nqAdrszCarriageReturn: .quad szCarriageReturn\nqAdrstTree: .quad stTree\nqAdrstQueue: .quad stQueue\nqAdrdisplayElement: .quad displayElement\n/******************************************************************/\n/* insert element in the tree */\n/******************************************************************/\n/* x0 contains the address of the tree structure */\n/* x1 contains the value of element */\n/* x0 returns address of element or - 1 if error */\ninsertElement:\n stp x1,lr,[sp,-16]! // save registers\n mov x4,x0\n mov x0,node_fin // reservation place one element\n bl allocHeap\n cmp x0,-1 // allocation error\n beq 100f\n mov x5,x0\n str x1,[x5,node_value] // store value in address heap\n mov x1,0\n str x1,[x5,node_left] // init left pointer with zero\n str x1,[x5,node_right] // init right pointer with zero\n ldr x2,[x4,tree_size] // load tree size\n cbnz x2,1f // 0 element ?\n str x5,[x4,tree_root] // yes -> store in root\n b 6f\n1: // else search free address in tree\n ldr x3,[x4,tree_root] // start with address root\n add x6,x2,1 // increment tree size\n clz x7,x6 // compute zeroes left bits\n add x7,x7,1 // for sustract the first left bit\n lsl x6,x6,x7 // shift number in left\n2:\n tst x6,1<<63 // test left bit\n lsl x6,x6,1 // shift left bit\n bne 3f // bit at one\n ldr x1,[x3,node_left] // no store node address in left pointer\n cbz x1,4f // if equal zero\n mov x3,x1 // else loop with next node\n b 2b\n3: // yes\n ldr x1,[x3,node_right] // store node address in right pointer\n cbz x1,5f // if equal zero\n mov x3,x1 // else loop with next node\n b 2b\n4:\n str x5,[x3,node_left]\n b 6f\n5:\n str x5,[x3,node_right]\n6:\n add x2,x2,1 // increment tree size\n str x2,[x4,tree_size]\n100:\n ldp x1,lr,[sp],16 // restaur 2 registers\n ret // return to address lr x30\n/******************************************************************/\n/* preOrder */\n/******************************************************************/\n/* x0 contains the address of the node */\n/* x1 function address */\npreOrder:\n stp x1,lr,[sp,-16]! // save registers\n stp x2,x3,[sp,-16]! // save registers\n cmp x0,#0\n beq 100f\n mov x2,x0\n blr x1 // call function\n\n ldr x0,[x2,#node_left]\n bl preOrder\n ldr x0,[x2,#node_right]\n bl preOrder\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/* inOrder */\n/******************************************************************/\n/* x0 contains the address of the node */\n/* x1 function address */\ninOrder:\n stp x1,lr,[sp,-16]! // save registers\n stp x2,x3,[sp,-16]! // save registers\n cbz x0,100f\n mov x3,x0\n mov x2,x1\n ldr x0,[x3,node_left]\n bl inOrder\n mov x0,x3\n blr x2 // call function\n\n ldr x0,[x3,node_right]\n mov x1,x2\n bl inOrder\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/* postOrder */\n/******************************************************************/\n/* x0 contains the address of the node */\n/* x1 function address */\npostOrder:\n stp x1,lr,[sp,-16]! // save registers\n stp x2,x3,[sp,-16]! // save registers\n cbz x0,100f\n mov x3,x0\n mov x2,x1\n ldr x0,[x3,#node_left]\n bl postOrder\n\n ldr x0,[x3,#node_right]\n mov x1,x2\n bl postOrder\n mov x0,x3\n blr x2 // call function\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/* levelOrder */\n/******************************************************************/\n/* x0 contains the address of the node */\n/* x1 function address */\nlevelOrder:\n stp x1,lr,[sp,-16]! // save registers\n stp x2,x3,[sp,-16]! // save registers\n cbz x0,100f\n mov x2,x1\n mov x1,x0\n ldr x0,qAdrstQueue // adresse queue\n bl enqueueNode // queue the node\n1: // begin loop\n ldr x0,qAdrstQueue\n bl isEmptyQueue // is queue empty\n cbz x0,100f // yes -> end\n ldr x0,qAdrstQueue\n bl dequeueNode\n mov x3,x0 // save node\n blr x2 // call function\n ldr x14,[x3,#node_left] // left node ok ?\n cbz x14,2f\n ldr x0,qAdrstQueue // yes -> enqueue\n mov x1,x14\n bl enqueueNode\n2:\n ldr x14,[x3,#node_right] // right node ok ?\n cbz x14,3f\n ldr x0,qAdrstQueue // yes -> enqueue\n mov x1,x14\n bl enqueueNode\n3:\n b 1b // and loop\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/* display node */\n/******************************************************************/\n/* x0 contains node address */\ndisplayElement:\n stp x1,lr,[sp,-16]! // save registers\n ldr x0,[x0,#node_value]\n ldr x1,qAdrsZoneConv\n bl conversion10S\n ldr x0,qAdrszMessResult\n ldr x1,qAdrsZoneConv\n bl strInsertAtCharInc // insert result at @ character\n bl affichageMess\n100:\n ldp x1,lr,[sp],16 // restaur 2 registers\n ret // return to address lr x30\nqAdrszMessResult: .quad szMessResult\nqAdrsZoneConv: .quad sZoneConv\n/******************************************************************/\n/* enqueue node */\n/******************************************************************/\n/* x0 contains the address of the queue */\n/* x1 contains the value of element */\n/* x0 returns address of element or - 1 if error */\nenqueueNode:\n stp x1,lr,[sp,-16]! // save registers\n stp x2,x3,[sp,-16]! // save registers\n mov x14,x0\n mov x0,#queue_node_fin // allocation place heap\n bl allocHeap\n cmp x0,#-1 // allocation error\n beq 100f\n mov x15,x0 // save heap address\n str x1,[x15,#queue_node_value] // store node value\n mov x1,#0\n str x1,[x15,#queue_node_next] // init pointer next\n ldr x0,[x14,#queue_end]\n cbz x0,1f\n str x15,[x0,#queue_node_next]\n b 2f\n1:\n str x15,[x14,#queue_begin]\n2:\n str x15,[x14,#queue_end]\n mov x0,#0\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/* dequeue node */\n/******************************************************************/\n/* x0 contains the address of the queue */\n/* x0 returns address of element or - 1 if error */\ndequeueNode:\n stp x1,lr,[sp,-16]! // save registers\n ldr x14,[x0,#queue_begin]\n ldr x15,[x14,#queue_node_value]\n ldr x16,[x14,#queue_node_next]\n str x16,[x0,#queue_begin]\n cbnz x16,1f\n str x16,[x0,#queue_end]\n1:\n mov x0,x15\n100:\n ldp x1,lr,[sp],16 // restaur 2 registers\n ret // return to address lr x30\n/******************************************************************/\n/* dequeue node */\n/******************************************************************/\n/* x0 contains the address of the queue */\n/* x0 returns 0 if empty else 1 */\nisEmptyQueue:\n ldr x0,[x0,#queue_begin]\n cmp x0,#0\n cset x0,ne\n ret // return\n/******************************************************************/\n/* memory allocation on the heap */\n/******************************************************************/\n/* x0 contains the size to allocate */\n/* x0 returns address of memory heap or - 1 if error */\n/* CAUTION : The size of the allowance must be a multiple of 4 */\nallocHeap:\n stp x8,lr,[sp,-16]! // save registers\n // allocation\n mov x16,x0 // save size\n mov x0,0 // read address start heap\n mov x8,BRK // call system 'brk'\n svc 0\n mov x15,x0 // save address heap for return\n add x0,x0,x16 // reservation place for size\n mov x8,BRK // call system 'brk'\n svc 0\n cmp x0,-1 // allocation error\n beq 100f\n mov x0,x15 // return address memory heap\n100:\n ldp x8,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":"(defun flatten-preorder (tree)\n (if (endp tree)\n nil\n (append (list (first tree))\n (flatten-preorder (second tree))\n (flatten-preorder (third tree)))))\n\n(defun flatten-inorder (tree)\n (if (endp tree)\n nil\n (append (flatten-inorder (second tree))\n (list (first tree))\n (flatten-inorder (third tree)))))\n\n(defun flatten-postorder (tree)\n (if (endp tree)\n nil\n (append (flatten-postorder (second tree))\n (flatten-postorder (third tree))\n (list (first tree)))))\n\n(defun flatten-level-r1 (tree level levels)\n (if (endp tree)\n levels\n (let ((curr (cdr (assoc level levels))))\n (flatten-level-r1\n (second tree)\n (1+ level)\n (flatten-level-r1\n (third tree)\n (1+ level)\n (put-assoc level\n (append curr (list (first tree)))\n levels))))))\n\n(defun flatten-level-r2 (levels max-level)\n (declare (xargs :measure (nfix (1+ max-level))))\n (if (zp (1+ max-level))\n nil\n (append (flatten-level-r2 levels\n (1- max-level))\n (reverse (cdr (assoc max-level levels))))))\n\n\n(defun flatten-level (tree)\n (let ((levels (flatten-level-r1 tree 0 nil)))\n (flatten-level-r2 levels (len levels))))\n","language":"ACL2"},{"code":"CARD EndProg ;required for ALLOCATE.ACT\n\nINCLUDE \"D2:ALLOCATE.ACT\" ;from the Action! Tool Kit. You must type 'SET EndProg=*' from the monitor after compiling, but before running this program!\n\nDEFINE PTR=\"CARD\"\n\nDEFINE TREE_NODE_SIZE=\"5\"\nTYPE TreeNode=[BYTE tData PTR left,right]\n\nDEFINE QUEUE_NODE_SIZE=\"4\"\nTYPE QueueNode=[PTR qData,qNext]\n\nDEFINE STACK_NODE_SIZE=\"4\"\nTYPE StackNode=[PTR sData,sNext]\n\nType Tree=[PTR root] ;TreeNode POINTER\nTYPE Stack=[PTR top] ;StackNode POINTER\nTYPE Queue=[PTR front,rear] ;QueueNode POINTER\n\nPROC QueueInit(Queue POINTER q)\n q.front=0 q.rear=0\nRETURN\n\nBYTE FUNC QueueIsEmpty(Queue POINTER q)\n IF q.front=0 THEN RETURN (1) FI\nRETURN (0)\n\nPROC QueuePush(Queue POINTER q TreeNode POINTER d)\n QueueNode POINTER node,tmp\n\n node=Alloc(QUEUE_NODE_SIZE)\n node.qData=d\n node.qNext=0\n IF QueueIsEmpty(q) THEN\n q.front=node\n ELSE\n tmp=q.rear\n tmp.qNext=node\n FI\n q.rear=node\nRETURN\n\nPTR FUNC QueuePop(Queue POINTER q)\n QueueNode POINTER node\n TreeNode POINTER d\n\n IF QueueIsEmpty(q) THEN\n PrintE(\"Error: queue is empty!\")\n Break()\n FI\n\n node=q.front\n d=node.qData\n q.front=node.qNext\n Free(node,QUEUE_NODE_SIZE)\nRETURN (d)\n\nPROC StackInit(Stack POINTER s)\n s.top=0\nRETURN\n\nBYTE FUNC StackIsEmpty(Stack POINTER s)\n IF s.top=0 THEN\n RETURN (1)\n FI\nRETURN (0)\n\nPROC StackPush(Stack POINTER s TreeNode POINTER d)\n StackNode POINTER node\n\n node=Alloc(STACK_NODE_SIZE)\n node.sData=d\n node.sNext=s.top\n s.top=node\nRETURN\n\nPTR FUNC StackPop(Stack POINTER s)\n StackNode POINTER node\n TreeNode POINTER d\n\n IF StackIsEmpty(s) THEN\n PrintE(\"Error stack is empty!\")\n Break()\n FI\n\n node=s.top\n d=node.sData\n s.top=node.sNext\n Free(node,STACK_NODE_SIZE)\nRETURN (d)\n\nPTR FUNC CreateTreeNode(BYTE d TreeNode POINTER l,r)\n TreeNode POINTER node\n\n node=Alloc(TREE_NODE_SIZE)\n node.tData=d\n node.left=l\n node.right=r\nRETURN (node)\n\nPROC BuildTree(Tree POINTER t)\n TreeNode POINTER t2,t3,t4,t5,t6,t7,t8,t9\n\n t7=CreateTreeNode(7,0,0)\n t4=CreateTreeNode(4,t7,0)\n t5=CreateTreeNode(5,0,0)\n t2=CreateTreeNode(2,t4,t5)\n t8=CreateTreeNode(8,0,0)\n t9=CreateTreeNode(9,0,0)\n t6=CreateTreeNode(6,t8,t9)\n t3=CreateTreeNode(3,t6,0)\n t.root=CreateTreeNode(1,t2,t3)\nRETURN\n\nPROC DestroyTree(Tree POINTER t)\n TreeNode POINTER n\n Queue q\n\n IF t.root=0 THEN RETURN FI\n\n QueueInit(q)\n QueuePush(q,t.root)\n WHILE QueueIsEmpty(q)=0\n DO\n n=QueuePop(q)\n IF n.left#0 THEN\n QueuePush(q,n.left)\n FI\n IF n.right#0 THEN\n QueuePush(q,n.right)\n FI\n Free(n,TREE_NODE_SIZE)\n OD\n t.root=0\nRETURN\n\nPROC VisitNode(TreeNode POINTER n)\n PrintB(n.tData) Put(32)\nRETURN\n\nPROC PreOrder(Tree POINTER t)\n TreeNode POINTER n\n Stack s\n\n StackInit(s)\n StackPush(s,t.root)\n WHILE StackIsEmpty(s)=0\n DO\n n=StackPop(s)\n VisitNode(n)\n IF n.right#0 THEN\n StackPush(s,n.right)\n FI\n IF n.left#0 THEN\n StackPush(s,n.left)\n FI\n OD\nRETURN\n\nPROC InOrder(Tree POINTER t)\n TreeNode POINTER n\n Stack s\n\n StackInit(s)\n n=t.root\n DO\n DO\n IF n.right#0 THEN\n StackPush(s,n.right)\n FI\n StackPush(s,n)\n IF n.left#0 THEN\n n=n.left\n ELSE\n EXIT\n FI\n OD\n\n n=StackPop(s)\n WHILE StackIsEmpty(s)=0 AND n.right=0\n DO\n VisitNode(n)\n n=StackPop(s)\n OD\n\n VisitNode(n)\n IF StackIsEmpty(s) THEN EXIT FI\n n=StackPop(s)\n OD\nRETURN\n\nPROC PostOrder(Tree POINTER t)\n TreeNode POINTER n\n Stack s,tmp\n\n StackInit(s)\n StackInit(tmp)\n StackPush(s,t.root)\n WHILE StackIsEmpty(s)=0\n DO\n n=StackPop(s)\n StackPush(tmp,n)\n IF n.left#0 THEN\n StackPush(s,n.left)\n FI\n IF n.right#0 THEN\n StackPush(s,n.right)\n FI\n OD\n\n WHILE StackIsEmpty(tmp)=0\n DO\n n=StackPop(tmp)\n VisitNode(n)\n OD\nRETURN\n\nPROC LevelOrder(Tree POINTER t)\n TreeNode POINTER n\n Queue q\n\n QueueInit(q)\n QueuePush(q,t.root)\n WHILE QueueIsEmpty(q)=0\n DO\n n=QueuePop(q)\n IF n.left#0 THEN\n QueuePush(q,n.left)\n FI\n IF n.right#0 THEN\n QueuePush(q,n.right)\n FI\n VisitNode(n)\n OD\nRETURN\n\nPROC Main()\n Tree t\n\n Put(125) PutE() ;clear screen\n\n AllocInit(0)\n BuildTree(t)\n\n Print(\"pre-order: \") PreOrder(t) PutE()\n Print(\"in-order: \") InOrder(t) PutE()\n Print(\"post-order: \") PostOrder(t) PutE()\n Print(\"level-order: \") LevelOrder(t) PutE()\n\n DestroyTree(t)\nRETURN\n","language":"Action-"},{"code":"with Ada.Text_Io; use Ada.Text_Io;\nwith Ada.Unchecked_Deallocation;\nwith Ada.Containers.Doubly_Linked_Lists;\n\nprocedure Tree_Traversal is\n type Node;\n type Node_Access is access Node;\n type Node is record\n Left : Node_Access := null;\n Right : Node_Access := null;\n Data : Integer;\n end record;\n procedure Destroy_Tree(N : in out Node_Access) is\n procedure free is new Ada.Unchecked_Deallocation(Node, Node_Access);\n begin\n if N.Left /= null then\n Destroy_Tree(N.Left);\n end if;\n if N.Right /= null then\n Destroy_Tree(N.Right);\n end if;\n Free(N);\n end Destroy_Tree;\n function Tree(Value : Integer; Left : Node_Access; Right : Node_Access) return Node_Access is\n Temp : Node_Access := new Node;\n begin\n Temp.Data := Value;\n Temp.Left := Left;\n Temp.Right := Right;\n return Temp;\n end Tree;\n procedure Preorder(N : Node_Access) is\n begin\n Put(Integer'Image(N.Data));\n if N.Left /= null then\n Preorder(N.Left);\n end if;\n if N.Right /= null then\n Preorder(N.Right);\n end if;\n end Preorder;\n procedure Inorder(N : Node_Access) is\n begin\n if N.Left /= null then\n Inorder(N.Left);\n end if;\n Put(Integer'Image(N.Data));\n if N.Right /= null then\n Inorder(N.Right);\n end if;\n end Inorder;\n procedure Postorder(N : Node_Access) is\n begin\n if N.Left /= null then\n Postorder(N.Left);\n end if;\n if N.Right /= null then\n Postorder(N.Right);\n end if;\n Put(Integer'Image(N.Data));\n end Postorder;\n procedure Levelorder(N : Node_Access) is\n package Queues is new Ada.Containers.Doubly_Linked_Lists(Node_Access);\n use Queues;\n Node_Queue : List;\n Next : Node_Access;\n begin\n Node_Queue.Append(N);\n while not Is_Empty(Node_Queue) loop\n Next := First_Element(Node_Queue);\n Delete_First(Node_Queue);\n Put(Integer'Image(Next.Data));\n if Next.Left /= null then\n Node_Queue.Append(Next.Left);\n end if;\n if Next.Right /= null then\n Node_Queue.Append(Next.Right);\n end if;\n end loop;\n end Levelorder;\n N : Node_Access;\nbegin\n N := Tree(1,\n Tree(2,\n Tree(4,\n Tree(7, null, null),\n null),\n Tree(5, null, null)),\n Tree(3,\n Tree(6,\n Tree(8, null, null),\n Tree(9, null, null)),\n null));\n\n Put(\"preorder: \");\n Preorder(N);\n New_Line;\n Put(\"inorder: \");\n Inorder(N);\n New_Line;\n Put(\"postorder: \");\n Postorder(N);\n New_Line;\n Put(\"level order: \");\n Levelorder(N);\n New_Line;\n Destroy_Tree(N);\nend Tree_traversal;\n","language":"Ada"},{"code":"open import Data.List using (List; _?_; []; concat)\nopen import Data.Nat using (N; suc; zero)\nopen import Level using (Level)\nopen import Relation.Binary.PropositionalEquality using (_=_; refl)\n\ndata Tree {a} (A : Set a) : Set a where\n leaf : Tree A\n node : A ? Tree A ? Tree A ? Tree A\n\nvariable\n a : Level\n A : Set a\n\npreorder : Tree A ? List A\npreorder tr = go tr []\n where\n go : Tree A ? List A ? List A\n go leaf ys = ys\n go (node x ls rs) ys = x ? go ls (go rs ys)\n\ninorder : Tree A ? List A\ninorder tr = go tr []\n where\n go : Tree A ? List A ? List A\n go leaf ys = ys\n go (node x ls rs) ys = go ls (x ? go rs ys)\n\npostorder : Tree A ? List A\npostorder tr = go tr []\n where\n go : Tree A ? List A ? List A\n go leaf ys = ys\n go (node x ls rs) ys = go ls (go rs (x ? ys))\n\nlevel-order : Tree A ? List A\nlevel-order tr = concat (go tr [])\n where\n go : Tree A ? List (List A) ? List (List A)\n go leaf qs = qs\n go (node x ls rs) [] = (x ? []) ? go ls (go rs [])\n go (node x ls rs) (q ? qs) = (x ? q ) ? go ls (go rs qs)\n\nexample-tree : Tree N\nexample-tree =\n node 1\n (node 2\n (node 4\n (node 7\n leaf\n leaf)\n leaf)\n (node 5\n leaf\n leaf))\n (node 3\n (node 6\n (node 8\n leaf\n leaf)\n (node 9\n leaf\n leaf))\n leaf)\n\n_ : preorder example-tree = 1 ? 2 ? 4 ? 7 ? 5 ? 3 ? 6 ? 8 ? 9 ? []\n_ = refl\n\n_ : inorder example-tree = 7 ? 4 ? 2 ? 5 ? 1 ? 8 ? 6 ? 9 ? 3 ? []\n_ = refl\n\n_ : postorder example-tree = 7 ? 4 ? 5 ? 2 ? 8 ? 9 ? 6 ? 3 ? 1 ? []\n_ = refl\n\n_ : level-order example-tree = 1 ? 2 ? 3 ? 4 ? 5 ? 6 ? 7 ? 8 ? 9 ? []\n_ = refl\n","language":"Agda"},{"code":"MODE VALUE = INT;\nPROC value repr = (VALUE value)STRING: whole(value, 0);\n\nMODE NODES = STRUCT ( VALUE value, REF NODES left, right);\nMODE NODE = REF NODES;\n\nPROC tree = (VALUE value, NODE left, right)NODE:\n HEAP NODES := (value, left, right);\n\nPROC preorder = (NODE node, PROC (VALUE)VOID action)VOID:\n IF node ISNT NODE(NIL) THEN\n action(value OF node);\n preorder(left OF node, action);\n preorder(right OF node, action)\n FI;\n\nPROC inorder = (NODE node, PROC (VALUE)VOID action)VOID:\n IF node ISNT NODE(NIL) THEN\n inorder(left OF node, action);\n action(value OF node);\n inorder(right OF node, action)\n FI;\n\nPROC postorder = (NODE node, PROC (VALUE)VOID action)VOID:\n IF node ISNT NODE(NIL) THEN\n postorder(left OF node, action);\n postorder(right OF node, action);\n action(value OF node)\n FI;\n\nPROC destroy tree = (NODE node)VOID:\n postorder(node, (VALUE skip)VOID:\n # free(node) - PR garbage collect hint PR #\n node := (SKIP, NIL, NIL)\n );\n\n# helper queue for level order #\nMODE QNODES = STRUCT (REF QNODES next, NODE value);\nMODE QNODE = REF QNODES;\n\n\nMODE QUEUES = STRUCT (QNODE begin, end);\nMODE QUEUE = REF QUEUES;\n\nPROC enqueue = (QUEUE queue, NODE node)VOID:\n(\n HEAP QNODES qnode := (NIL, node);\n IF end OF queue ISNT QNODE(NIL) THEN\n next OF end OF queue\n ELSE\n begin OF queue\n FI := end OF queue := qnode\n);\n\nPROC queue empty = (QUEUE queue)BOOL:\n begin OF queue IS QNODE(NIL);\n\nPROC dequeue = (QUEUE queue)NODE:\n(\n NODE out := value OF begin OF queue;\n QNODE second := next OF begin OF queue;\n# free(begin OF queue); PR garbage collect hint PR #\n QNODE(begin OF queue) := (NIL, NIL);\n begin OF queue := second;\n IF queue empty(queue) THEN\n end OF queue := begin OF queue\n FI;\n out\n);\n\nPROC level order = (NODE node, PROC (VALUE)VOID action)VOID:\n(\n HEAP QUEUES queue := (QNODE(NIL), QNODE(NIL));\n enqueue(queue, node);\n WHILE NOT queue empty(queue)\n DO\n NODE next := dequeue(queue);\n IF next ISNT NODE(NIL) THEN\n action(value OF next);\n enqueue(queue, left OF next);\n enqueue(queue, right OF next)\n FI\n OD\n);\n\nPROC print node = (VALUE value)VOID:\n print((\" \",value repr(value)));\n\nmain: (\n NODE node := tree(1,\n tree(2,\n tree(4,\n tree(7, NIL, NIL),\n NIL),\n tree(5, NIL, NIL)),\n tree(3,\n tree(6,\n tree(8, NIL, NIL),\n tree(9, NIL, NIL)),\n NIL));\n\n MODE TEST = STRUCT(\n STRING name,\n PROC(NODE,PROC(VALUE)VOID)VOID order\n );\n\n PROC test = (TEST test)VOID:(\n STRING pad=\" \"*(12-UPB name OF test);\n print((name OF test,pad,\": \"));\n (order OF test)(node, print node);\n print(new line)\n );\n\n []TEST test list = (\n (\"preorder\",preorder),\n (\"inorder\",inorder),\n (\"postorder\",postorder),\n (\"level order\",level order)\n );\n\n FOR i TO UPB test list DO test(test list[i]) OD;\n\n destroy tree(node)\n)\n","language":"ALGOL-68"},{"code":"preorder ? {l r?? ?? ? ? (?r)???(×?r)?(?l)???(×?l)?? ?? ?}\ninorder ? {l r?? ?? ? ? (?r)???(×?r)?? ???(?l)???(×?l)??}\npostorder? {l r?? ?? ? ? ? ???(?r)???(×?r)?(?l)???(×?l)??}\nlvlorder ? {0=??:? ? (????/(??),??)??°(,/)?2??°??¨?}\n","language":"APL"},{"code":"tree?1(2(4(7??)?)(5??))(3(6(8??)(9??))?)\nvisit?{?,(×??)???}\nchildren?{?¨@(×°?¨)1??}\n","language":"APL"},{"code":"on run\n -- Sample tree of integers\n set tree to node(1, ¬\n {node(2, ¬\n {node(4, {node(7, {})}), ¬\n node(5, {})}), ¬\n node(3, ¬\n {node(6, {node(8, {}), ¬\n node(9, {})})})})\n\n\n -- Output of AppleScript code at Rosetta Code task\n -- 'Visualize a Tree':\n set strTree to unlines({¬\n \" + 4 - 7\", ¬\n \" + 2 ¦\", ¬\n \" ¦ + 5\", ¬\n \" 1 ¦\", ¬\n \" ¦ + 8\", ¬\n \" + 3 - 6 ¦\", ¬\n \" + 9\"})\n\n script tabulate\n on |?|(s, xs)\n justifyRight(14, space, s & \": \") & unwords(xs)\n end |?|\n end script\n\n set strResult to strTree & linefeed & unlines(zipWith(tabulate, ¬\n [\"preorder\", \"inorder\", \"postorder\", \"level-order\"], ¬\n apList([¬\n foldTree(preorder), ¬\n foldTree(inorder), ¬\n foldTree(postorder), ¬\n levelOrder], [tree])))\n\n set the clipboard to strResult\n return strResult\nend run\n\n\n---------------------- TREE TRAVERSAL ----------------------\n\n-- preorder :: a -> [[a]] -> [a]\non preorder(x, xs)\n {x} & concat(xs)\nend preorder\n\n\n-- inorder :: a -> [[a]] -> [a]\non inorder(x, xs)\n if {} ? xs then\n item 1 of xs & x & concat(rest of xs)\n else\n {x}\n end if\nend inorder\n\n\n-- postorder :: a -> [[a]] -> [a]\non postorder(x, xs)\n concat(xs) & {x}\nend postorder\n\n\n-- levelOrder :: Tree a -> [a]\non levelOrder(tree)\n concat(levels(tree))\nend levelOrder\n\n\n-- foldTree :: (a -> [b] -> b) -> Tree a -> b\non foldTree(f)\n script\n on |?|(tree)\n script go\n property g : |?| of mReturn(f)\n on |?|(oNode)\n g(root of oNode, |?|(nest of oNode) ¬\n of map(go))\n end |?|\n end script\n |?|(tree) of go\n end |?|\n end script\nend foldTree\n\n\n------------------------- GENERIC --------------------------\n\n-- Node :: a -> [Tree a] -> Tree a\non node(v, xs)\n {type:\"Node\", root:v, nest:xs}\nend node\n\n\n-- e.g. [(*2),(/2), sqrt] <*> [1,2,3]\n-- --> ap([dbl, hlf, root], [1, 2, 3])\n-- --> [2,4,6,0.5,1,1.5,1,1.4142135623730951,1.7320508075688772]\n\n-- Each member of a list of functions applied to\n-- each of a list of arguments, deriving a list of new values\n-- apList (<*>) :: [(a -> b)] -> [a] -> [b]\non apList(fs, xs)\n set lst to {}\n repeat with f in fs\n tell mReturn(contents of f)\n repeat with x in xs\n set end of lst to |?|(contents of x)\n end repeat\n end tell\n end repeat\n return lst\nend apList\n\n\n-- concat :: [[a]] -> [a]\n-- concat :: [String] -> String\non concat(xs)\n set lng to length of xs\n if 0 < lng and string is class of (item 1 of xs) then\n set acc to \"\"\n else\n set acc to {}\n end if\n repeat with i from 1 to lng\n set acc to acc & item i of xs\n end repeat\n acc\nend concat\n\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, i, xs)\n end repeat\n return v\n end tell\nend foldr\n\n\n-- justifyRight :: Int -> Char -> String -> String\non justifyRight(n, cFiller, strText)\n if n > length of strText then\n text -n thru -1 of ((replicate(n, cFiller) as text) & strText)\n else\n strText\n end if\nend justifyRight\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-- levels :: Tree a -> [[a]]\non levels(tree)\n -- A list of lists, grouping the root\n -- values of each level of the tree.\n script go\n on |?|(node, a)\n if {} ? a then\n tell a to set {h, t} to {item 1, rest}\n else\n set {h, t} to {{}, {}}\n end if\n\n {{root of node} & h} & foldr(go, t, nest of node)\n end |?|\n end script\n\n |?|(tree, {}) of go\nend levels\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\n-- map :: (a -> b) -> [a] -> [b]\non map(f)\n -- The list obtained by applying f\n -- to each element of xs.\n script\n on |?|(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\n end |?|\n end script\nend map\n\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\n-- nest :: Tree a -> [a]\non nest(oTree)\n nest of oTree\nend nest\n\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-- root :: Tree a -> a\non root(oTree)\n root of oTree\nend root\n\n\n-- take :: Int -> [a] -> [a]\n-- take :: Int -> String -> String\non take(n, xs)\n set c to class of xs\n if list is c then\n if 0 < n then\n items 1 thru min(n, length of xs) of xs\n else\n {}\n end if\n else if string is c then\n if 0 < n then\n text 1 thru min(n, length of xs) of xs\n else\n \"\"\n end if\n else if script is c then\n set ys to {}\n repeat with i from 1 to n\n set v to |?|() of xs\n if missing value is v then\n return ys\n else\n set end of ys to v\n end if\n end repeat\n return ys\n else\n missing value\n end if\nend take\n\n\n-- unlines :: [String] -> String\non unlines(xs)\n -- A single string formed by the intercalation\n -- of a list of strings with the newline character.\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\n-- unwords :: [String] -> String\non unwords(xs)\n set {dlm, my text item delimiters} to ¬\n {my text item delimiters, space}\n set s to xs as text\n set my text item delimiters to dlm\n return s\nend unwords\n\n\n-- zipWith :: (a -> b -> c) -> [a] -> [b] -> [c]\non zipWith(f, xs, ys)\n set lng to min(|length|(xs), |length|(ys))\n if 1 > lng then return {}\n set xs_ to take(lng, xs) -- Allow for non-finite\n set ys_ to take(lng, ys) -- generators like cycle etc\n set lst to {}\n tell mReturn(f)\n repeat with i from 1 to lng\n set end of lst to |?|(item i of xs_, item i of ys_)\n end repeat\n return lst\n end tell\nend zipWith\n","language":"AppleScript"},{"code":"/* ARM assembly Raspberry PI */\n/* program deftree2.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\n.equ NBVAL, 9\n\n/*******************************************/\n/* Structures */\n/********************************************/\n/* structure tree */\n .struct 0\ntree_root: @ root pointer\n .struct tree_root + 4\ntree_size: @ number of element of tree\n .struct tree_size + 4\ntree_fin:\n/* structure node tree */\n .struct 0\nnode_left: @ left pointer\n .struct node_left + 4\nnode_right: @ right pointer\n .struct node_right + 4\nnode_value: @ element value\n .struct node_value + 4\nnode_fin:\n/* structure queue*/\n .struct 0\nqueue_begin: @ next pointer\n .struct queue_begin + 4\nqueue_end: @ element value\n .struct queue_end + 4\nqueue_fin:\n/* structure node queue */\n .struct 0\nqueue_node_next: @ next pointer\n .struct queue_node_next + 4\nqueue_node_value: @ element value\n .struct queue_node_value + 4\nqueue_node_fin:\n/* Initialized data */\n.data\nszMessInOrder: .asciz \"inOrder :\\n\"\nszMessPreOrder: .asciz \"PreOrder :\\n\"\nszMessPostOrder: .asciz \"PostOrder :\\n\"\nszMessLevelOrder: .asciz \"LevelOrder :\\n\"\nszCarriageReturn: .asciz \"\\n\"\n/* datas error display */\nszMessErreur: .asciz \"Error detected.\\n\"\n/* datas message display */\nszMessResult: .ascii \"Element value :\"\nsValue: .space 12,' '\n .asciz \"\\n\"\n\n/* UnInitialized data */\n.bss\nstTree: .skip tree_fin @ place to structure tree\nstQueue: .skip queue_fin @ place to structure queue\n/* code section */\n.text\n.global main\nmain:\n mov r1,#1 @ node tree value\n1:\n ldr r0,iAdrstTree @ structure tree address\n bl insertElement @ add element value r1\n cmp r0,#-1\n beq 99f\n add r1,#1 @ increment value\n cmp r1,#NBVAL @ end ?\n ble 1b @ no -> loop\n\n ldr r0,iAdrszMessPreOrder\n bl affichageMess\n ldr r3,iAdrstTree @ tree root address (begin structure)\n ldr r0,[r3,#tree_root]\n ldr r1,iAdrdisplayElement @ function to execute\n bl preOrder\n\n ldr r0,iAdrszMessInOrder\n bl affichageMess\n ldr r3,iAdrstTree\n ldr r0,[r3,#tree_root]\n ldr r1,iAdrdisplayElement @ function to execute\n bl inOrder\n\n ldr r0,iAdrszMessPostOrder\n bl affichageMess\n ldr r3,iAdrstTree\n ldr r0,[r3,#tree_root]\n ldr r1,iAdrdisplayElement @ function to execute\n bl postOrder\n\n ldr r0,iAdrszMessLevelOrder\n bl affichageMess\n ldr r3,iAdrstTree\n ldr r0,[r3,#tree_root]\n ldr r1,iAdrdisplayElement @ function to execute\n bl levelOrder\n b 100f\n99: @ display error\n ldr r0,iAdrszMessErreur\n bl affichageMess\n100: @ standard end of the program\n mov r7, #EXIT @ request to exit program\n svc 0 @ perform system call\niAdrszMessInOrder: .int szMessInOrder\niAdrszMessPreOrder: .int szMessPreOrder\niAdrszMessPostOrder: .int szMessPostOrder\niAdrszMessLevelOrder: .int szMessLevelOrder\niAdrszMessErreur: .int szMessErreur\niAdrszCarriageReturn: .int szCarriageReturn\niAdrstTree: .int stTree\niAdrstQueue: .int stQueue\niAdrdisplayElement: .int displayElement\n/******************************************************************/\n/* insert element in the tree */\n/******************************************************************/\n/* r0 contains the address of the tree structure */\n/* r1 contains the value of element */\n/* r0 returns address of element or - 1 if error */\ninsertElement:\n push {r1-r7,lr} @ save registers\n mov r4,r0\n mov r0,#node_fin @ reservation place one element\n bl allocHeap\n cmp r0,#-1 @ allocation error\n beq 100f\n mov r5,r0\n str r1,[r5,#node_value] @ store value in address heap\n mov r1,#0\n str r1,[r5,#node_left] @ init left pointer with zero\n str r1,[r5,#node_right] @ init right pointer with zero\n ldr r2,[r4,#tree_size] @ load tree size\n cmp r2,#0 @ 0 element ?\n bne 1f\n str r5,[r4,#tree_root] @ yes -> store in root\n b 4f\n1: @ else search free address in tree\n ldr r3,[r4,#tree_root] @ start with address root\n add r6,r2,#1 @ increment tree size\n clz r7,r6 @ compute zeroes left bits\n add r7,#1 @ for sustract the first left bit\n lsl r6,r7 @ shift number in left\n2:\n lsls r6,#1 @ read left bit\n bcs 3f @ is 1 ?\n ldr r1,[r3,#node_left] @ no store node address in left pointer\n cmp r1,#0 @ if equal zero\n streq r5,[r3,#node_left]\n beq 4f\n mov r3,r1 @ else loop with next node\n b 2b\n3: @ yes\n ldr r1,[r3,#node_right] @ store node address in right pointer\n cmp r1,#0 @ if equal zero\n streq r5,[r3,#node_right]\n beq 4f\n mov r3,r1 @ else loop with next node\n b 2b\n4:\n add r2,#1 @ increment tree size\n str r2,[r4,#tree_size]\n100:\n pop {r1-r7,lr} @ restaur registers\n bx lr @ return\n/******************************************************************/\n/* preOrder */\n/******************************************************************/\n/* r0 contains the address of the node */\n/* r1 function address */\npreOrder:\n push {r1-r2,lr} @ save registers\n cmp r0,#0\n beq 100f\n mov r2,r0\n blx r1 @ call function\n\n ldr r0,[r2,#node_left]\n bl preOrder\n ldr r0,[r2,#node_right]\n bl preOrder\n100:\n pop {r1-r2,lr} @ restaur registers\n bx lr\n/******************************************************************/\n/* inOrder */\n/******************************************************************/\n/* r0 contains the address of the node */\n/* r1 function address */\ninOrder:\n push {r1-r3,lr} @ save registers\n cmp r0,#0\n beq 100f\n mov r3,r0\n mov r2,r1\n ldr r0,[r3,#node_left]\n bl inOrder\n mov r0,r3\n blx r2 @ call function\n\n ldr r0,[r3,#node_right]\n mov r1,r2\n bl inOrder\n100:\n pop {r1-r3,lr} @ restaur registers\n bx lr @ return\n/******************************************************************/\n/* postOrder */\n/******************************************************************/\n/* r0 contains the address of the node */\n/* r1 function address */\npostOrder:\n push {r1-r3,lr} @ save registers\n cmp r0,#0\n beq 100f\n mov r3,r0\n mov r2,r1\n ldr r0,[r3,#node_left]\n bl postOrder\n\n ldr r0,[r3,#node_right]\n mov r1,r2\n bl postOrder\n mov r0,r3\n blx r2 @ call function\n100:\n pop {r1-r3,lr} @ restaur registers\n bx lr @ return\n/******************************************************************/\n/* levelOrder */\n/******************************************************************/\n/* r0 contains the address of the node */\n/* r1 function address */\nlevelOrder:\n push {r1-r4,lr} @ save registers\n cmp r0,#0\n beq 100f\n mov r2,r1\n mov r1,r0\n ldr r0,iAdrstQueue @ adresse queue\n bl enqueueNode @ queue the node\n1: @ begin loop\n ldr r0,iAdrstQueue\n bl isEmptyQueue @ is queue empty\n cmp r0,#0\n beq 100f @ yes -> end\n ldr r0,iAdrstQueue\n bl dequeueNode\n mov r3,r0 @ save node\n blx r2 @ call function\n ldr r4,[r3,#node_left] @ left node ok ?\n cmp r4,#0\n beq 2f @ no\n ldr r0,iAdrstQueue @ yes -> enqueue\n mov r1,r4\n bl enqueueNode\n2:\n ldr r4,[r3,#node_right] @ right node ok ?\n cmp r4,#0\n beq 3f @ no\n ldr r0,iAdrstQueue @ yes -> enqueue\n mov r1,r4\n bl enqueueNode\n3:\n b 1b @ and loop\n\n100:\n pop {r1-r4,lr} @ restaur registers\n bx lr @ return\n/******************************************************************/\n/* display node */\n/******************************************************************/\n/* r0 contains node address */\ndisplayElement:\n push {r1,lr} @ save registers\n ldr r0,[r0,#node_value]\n ldr r1,iAdrsValue\n bl conversion10S\n ldr r0,iAdrszMessResult\n bl affichageMess\n100:\n pop {r1,lr} @ restaur registers\n bx lr @ return\niAdrszMessResult: .int szMessResult\niAdrsValue: .int sValue\n/******************************************************************/\n/* enqueue node */\n/******************************************************************/\n/* r0 contains the address of the queue */\n/* r1 contains the value of element */\n/* r0 returns address of element or - 1 if error */\nenqueueNode:\n push {r1-r5,lr} @ save registers\n mov r4,r0\n mov r0,#queue_node_fin @ allocation place heap\n bl allocHeap\n cmp r0,#-1 @ allocation error\n beq 100f\n mov r5,r0 @ save heap address\n str r1,[r5,#queue_node_value] @ store node value\n mov r1,#0\n str r1,[r5,#queue_node_next] @ init pointer next\n ldr r0,[r4,#queue_end]\n cmp r0,#0\n strne r5,[r0,#queue_node_next]\n streq r5,[r4,#queue_begin]\n str r5,[r4,#queue_end]\n mov r0,#0\n pop {r1-r5,lr}\n bx lr @ return\n/******************************************************************/\n/* dequeue node */\n/******************************************************************/\n/* r0 contains the address of the queue */\n/* r0 returns address of element or - 1 if error */\ndequeueNode:\n push {r1-r5,lr} @ save registers\n ldr r4,[r0,#queue_begin]\n ldr r5,[r4,#queue_node_value]\n ldr r6,[r4,#queue_node_next]\n str r6,[r0,#queue_begin]\n cmp r6,#0\n streq r6,[r0,#queue_end]\n mov r0,r5\n100:\n pop {r1-r5,lr}\n bx lr @ return\n/******************************************************************/\n/* dequeue node */\n/******************************************************************/\n/* r0 contains the address of the queue */\n/* r0 returns 0 if empty else 1 */\nisEmptyQueue:\n ldr r0,[r0,#queue_begin]\n cmp r0,#0\n movne r0,#1\n bx lr @ return\n/******************************************************************/\n/* memory allocation on the heap */\n/******************************************************************/\n/* r0 contains the size to allocate */\n/* r0 returns address of memory heap or - 1 if error */\n/* CAUTION : The size of the allowance must be a multiple of 4 */\nallocHeap:\n push {r5-r7,lr} @ save registers\n @ allocation\n mov r6,r0 @ save size\n mov r0,#0 @ read address start heap\n mov r7,#0x2D @ call system 'brk'\n svc #0\n mov r5,r0 @ save address heap for return\n add r0,r6 @ reservation place for size\n mov r7,#0x2D @ call system 'brk'\n svc #0\n cmp r0,#-1 @ allocation error\n movne r0,r5 @ return address memory heap\n pop {r5-r7,lr} @ restaur registers\n bx lr @ return\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/* 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":"#include\n\"share/atspre_staload.hats\"\n//\n(* ****** ****** *)\n//\ndatatype\ntree (a:t@ype) =\n | tnil of ()\n | tcons of (tree a, a, tree a)\n//\n(* ****** ****** *)\n\nsymintr ++\ninfixr (+) ++\noverload ++ with list_append\n\n(* ****** ****** *)\n\n#define sing list_sing\n\n(* ****** ****** *)\n\nfun{\na:t@ype\n} preorder\n (t0: tree a): List0 a =\n case t0 of\n | tnil () => nil ()\n | tcons (tl, x, tr) => sing(x) ++ preorder(tl) ++ preorder(tr)\n\n(* ****** ****** *)\n\nfun{\na:t@ype\n} inorder\n (t0: tree a): List0 a =\n case t0 of\n | tnil () => nil ()\n | tcons (tl, x, tr) => inorder(tl) ++ sing(x) ++ inorder(tr)\n\n(* ****** ****** *)\n\nfun{\na:t@ype\n} postorder\n (t0: tree a): List0 a =\n case t0 of\n | tnil () => nil ()\n | tcons (tl, x, tr) => postorder(tl) ++ postorder(tr) ++ sing(x)\n\n(* ****** ****** *)\n\nfun{\na:t@ype\n} levelorder\n (t0: tree a): List0 a = let\n//\nfun auxlst\n (ts: List (tree(a))): List0 a =\n case ts of\n | list_nil () => list_nil ()\n | list_cons (t, ts) =>\n (\n case+ t of\n | tnil () => auxlst (ts)\n | tcons (tl, x, tr) => cons (x, auxlst (ts ++ $list{tree(a)}(tl, tr)))\n )\n//\nin\n auxlst (sing(t0))\nend // end of [levelorder]\n\n(* ****** ****** *)\n\nmacdef\ntsing(x) = tcons (tnil, ,(x), tnil)\n\n(* ****** ****** *)\n\nimplement\nmain0 () = let\n//\nval t0 =\ntcons{int}\n(\n tcons (tcons (tsing (7), 4, tnil ()), 2, tsing (5))\n,\n1\n,\n tcons (tcons (tsing (8), 6, tsing (9)), 3, tnil ())\n)\n//\nin\n println! (\"preorder:\\t\", preorder(t0));\n println! (\"inorder:\\t\", inorder(t0));\n println! (\"postorder:\\t\", postorder(t0));\n println! (\"level-order:\\t\", levelorder(t0));\nend (* end of [main0] *)\n","language":"ATS"},{"code":"AddNode(Tree,1,2,3,1) ; Build global Tree\nAddNode(Tree,2,4,5,2)\nAddNode(Tree,3,6,0,3)\nAddNode(Tree,4,7,0,4)\nAddNode(Tree,5,0,0,5)\nAddNode(Tree,6,8,9,6)\nAddNode(Tree,7,0,0,7)\nAddNode(Tree,8,0,0,8)\nAddNode(Tree,9,0,0,9)\n\nMsgBox % \"Preorder: \" PreOrder(Tree,1) ; 1 2 4 7 5 3 6 8 9\nMsgBox % \"Inorder: \" InOrder(Tree,1) ; 7 4 2 5 1 8 6 9 3\nMsgBox % \"postorder: \" PostOrder(Tree,1) ; 7 4 5 2 8 9 6 3 1\nMsgBox % \"levelorder: \" LevOrder(Tree,1) ; 1 2 3 4 5 6 7 8 9\n\nAddNode(ByRef Tree,Node,Left,Right,Value) {\n if !isobject(Tree)\n Tree := object()\n\n Tree[Node, \"L\"] := Left\n Tree[Node, \"R\"] := Right\n Tree[Node, \"V\"] := Value\n}\n\nPreOrder(Tree,Node) {\nptree := Tree[Node, \"V\"] \" \"\n . ((L:=Tree[Node, \"L\"]) ? PreOrder(Tree,L) : \"\")\n . ((R:=Tree[Node, \"R\"]) ? PreOrder(Tree,R) : \"\")\nreturn ptree\n}\nInOrder(Tree,Node) {\n Return itree := ((L:=Tree[Node, \"L\"]) ? InOrder(Tree,L) : \"\")\n . Tree[Node, \"V\"] \" \"\n . ((R:=Tree[Node, \"R\"]) ? InOrder(Tree,R) : \"\")\n}\nPostOrder(Tree,Node) {\n Return ptree := ((L:=Tree[Node, \"L\"]) ? PostOrder(Tree,L) : \"\")\n . ((R:=Tree[Node, \"R\"]) ? PostOrder(Tree,R) : \"\")\n . Tree[Node, \"V\"] \" \"\n}\nLevOrder(Tree,Node,Lev=1) {\n Static ; make node lists static\n i%Lev% .= Tree[Node, \"V\"] \" \" ; build node lists in every level\n If (L:=Tree[Node, \"L\"])\n LevOrder(Tree,L,Lev+1)\n If (R:=Tree[Node, \"R\"])\n LevOrder(Tree,R,Lev+1)\n If (Lev > 1)\n Return\n While i%Lev% ; concatenate node lists from all levels\n t .= i%Lev%, Lev++\n Return t\n}\n","language":"AutoHotkey"},{"code":"function preorder(tree, node, res, child) {\n if (node == \"\")\n return\n res[res[\"count\"]++] = node\n split(tree[node], child, \",\")\n preorder(tree,child[1],res)\n preorder(tree,child[2],res)\n}\n\nfunction inorder(tree, node, res, child) {\n if (node == \"\")\n return\n split(tree[node], child, \",\")\n inorder(tree,child[1],res)\n res[res[\"count\"]++] = node\n inorder(tree,child[2],res)\n}\n\nfunction postorder(tree, node, res, child) {\n if (node == \"\")\n return\n split(tree[node], child, \",\")\n postorder(tree,child[1], res)\n postorder(tree,child[2], res)\n res[res[\"count\"]++] = node\n}\n\nfunction levelorder(tree, node, res, nextnode, queue, child) {\n if (node == \"\")\n return\n\n queue[\"tail\"] = 0\n queue[queue[\"head\"]++] = node\n\n while (queue[\"head\"] - queue[\"tail\"] >= 1) {\n\n nextnode = queue[queue[\"tail\"]]\n delete queue[queue[\"tail\"]++]\n\n res[res[\"count\"]++] = nextnode\n\n split(tree[nextnode], child, \",\")\n if (child[1] != \"\")\n queue[queue[\"head\"]++] = child[1]\n if (child[2] != \"\")\n queue[queue[\"head\"]++] = child[2]\n }\n delete queue\n}\n\nBEGIN {\n tree[\"1\"] = \"2,3\"\n tree[\"2\"] = \"4,5\"\n tree[\"3\"] = \"6,\"\n tree[\"4\"] = \"7,\"\n tree[\"5\"] = \",\"\n tree[\"6\"] = \"8,9\"\n tree[\"7\"] = \",\"\n tree[\"8\"] = \",\"\n tree[\"9\"] = \",\"\n\n preorder(tree,\"1\",result)\n printf \"preorder:\\t\"\n for (n = 0; n < result[\"count\"]; n += 1)\n printf result[n]\" \"\n printf \"\\n\"\n delete result\n\n inorder(tree,\"1\",result)\n printf \"inorder:\\t\"\n for (n = 0; n < result[\"count\"]; n += 1)\n printf result[n]\" \"\n printf \"\\n\"\n delete result\n\n postorder(tree,\"1\",result)\n printf \"postorder:\\t\"\n for (n = 0; n < result[\"count\"]; n += 1)\n printf result[n]\" \"\n printf \"\\n\"\n delete result\n\n levelorder(tree,\"1\",result)\n printf \"level-order:\\t\"\n for (n = 0; n < result[\"count\"]; n += 1)\n printf result[n]\" \"\n printf \"\\n\"\n delete result\n}\n","language":"AWK"},{"code":"get \"libhdr\"\nmanifest $(\n VAL=0\n LEFT=1\n RIGHT=2\n$)\n\nlet tree(v,l,r) = valof\n$( let obj = getvec(2)\n obj!VAL := v\n obj!LEFT := l\n obj!RIGHT := r\n resultis obj\n$)\n\nlet preorder(tree, cb) be unless tree=0\n$( cb(tree!VAL)\n preorder(tree!LEFT, cb)\n preorder(tree!RIGHT, cb)\n$)\n\nlet inorder(tree, cb) be unless tree=0\n$( inorder(tree!LEFT, cb)\n cb(tree!VAL)\n inorder(tree!RIGHT, cb)\n$)\n\nlet postorder(tree, cb) be unless tree=0\n$( postorder(tree!LEFT, cb)\n postorder(tree!RIGHT, cb)\n cb(tree!VAL)\n$)\n\nlet levelorder(tree, cb) be\n$( let q=vec 255\n let s=0 and e=1\n q!0 := tree\n until s=e do\n $( unless q!s=0 do\n $( q!e := q!s!LEFT\n q!(e+1) := q!s!RIGHT\n e := e+2\n cb(q!s!VAL)\n $)\n s := s+1\n $)\n$)\n\nlet traverse(name, order, tree) be\n$( let cb(n) be writef(\"%N \", n)\n writef(\"%S:*T\", name)\n order(tree, cb)\n wrch('*N')\n$)\n\nlet start() be\n$( let example = tree(1, tree(2, tree(4, tree(7, 0, 0), 0),\n tree(5, 0, 0)),\n tree(3, tree(6, tree(8, 0, 0),\n tree(9, 0, 0)),\n 0))\n traverse(\"preorder\", preorder, example)\n traverse(\"inorder\", inorder, example)\n traverse(\"postorder\", postorder, example)\n traverse(\"level-order\", levelorder, example)\n$)\n","language":"BCPL"},{"code":"(\n ( tree\n = 1\n . (2.(4.7.) (5.))\n (3.6.(8.) (9.))\n )\n& ( preorder\n = K sub\n . !arg:(?K.?sub) ?arg\n & !K preorder$!sub preorder$!arg\n |\n )\n& out$(\"preorder: \" preorder$!tree)\n& ( inorder\n = K lhs rhs\n . !arg:(?K.?sub) ?arg\n & ( !sub:%?lhs ?rhs\n & inorder$!lhs !K inorder$!rhs inorder$!arg\n | !K\n )\n )\n& out$(\"inorder: \" inorder$!tree)\n& ( postorder\n = K sub\n . !arg:(?K.?sub) ?arg\n & postorder$!sub !K postorder$!arg\n |\n )\n& out$(\"postorder: \" postorder$!tree)\n& ( levelorder\n = todo tree sub\n . !arg:(.)&\n | !arg:(?tree.?todo)\n & ( !tree:(?K.?sub) ?tree\n & !K levelorder$(!tree.!todo !sub)\n | levelorder$(!todo.)\n )\n )\n& out$(\"level-order:\" levelorder$(!tree.))\n&\n)\n","language":"Bracmat"},{"code":"#include <stdlib.h>\n#include <stdio.h>\n\ntypedef struct node_s\n{\n int value;\n struct node_s* left;\n struct node_s* right;\n} *node;\n\nnode tree(int v, node l, node r)\n{\n node n = malloc(sizeof(struct node_s));\n n->value = v;\n n->left = l;\n n->right = r;\n return n;\n}\n\nvoid destroy_tree(node n)\n{\n if (n->left)\n destroy_tree(n->left);\n if (n->right)\n destroy_tree(n->right);\n free(n);\n}\n\nvoid preorder(node n, void (*f)(int))\n{\n f(n->value);\n if (n->left)\n preorder(n->left, f);\n if (n->right)\n preorder(n->right, f);\n}\n\nvoid inorder(node n, void (*f)(int))\n{\n if (n->left)\n inorder(n->left, f);\n f(n->value);\n if (n->right)\n inorder(n->right, f);\n}\n\nvoid postorder(node n, void (*f)(int))\n{\n if (n->left)\n postorder(n->left, f);\n if (n->right)\n postorder(n->right, f);\n f(n->value);\n}\n\n/* helper queue for levelorder */\ntypedef struct qnode_s\n{\n struct qnode_s* next;\n node value;\n} *qnode;\n\ntypedef struct { qnode begin, end; } queue;\n\nvoid enqueue(queue* q, node n)\n{\n qnode node = malloc(sizeof(struct qnode_s));\n node->value = n;\n node->next = 0;\n if (q->end)\n q->end->next = node;\n else\n q->begin = node;\n q->end = node;\n}\n\nnode dequeue(queue* q)\n{\n node tmp = q->begin->value;\n qnode second = q->begin->next;\n free(q->begin);\n q->begin = second;\n if (!q->begin)\n q->end = 0;\n return tmp;\n}\n\nint queue_empty(queue* q)\n{\n return !q->begin;\n}\n\nvoid levelorder(node n, void(*f)(int))\n{\n queue nodequeue = {};\n enqueue(&nodequeue, n);\n while (!queue_empty(&nodequeue))\n {\n node next = dequeue(&nodequeue);\n f(next->value);\n if (next->left)\n enqueue(&nodequeue, next->left);\n if (next->right)\n enqueue(&nodequeue, next->right);\n }\n}\n\nvoid print(int n)\n{\n printf(\"%d \", n);\n}\n\nint main()\n{\n node n = tree(1,\n tree(2,\n tree(4,\n tree(7, 0, 0),\n 0),\n tree(5, 0, 0)),\n tree(3,\n tree(6,\n tree(8, 0, 0),\n tree(9, 0, 0)),\n 0));\n\n printf(\"preorder: \");\n preorder(n, print);\n printf(\"\\n\");\n\n printf(\"inorder: \");\n inorder(n, print);\n printf(\"\\n\");\n\n printf(\"postorder: \");\n postorder(n, print);\n printf(\"\\n\");\n\n printf(\"level-order: \");\n levelorder(n, print);\n printf(\"\\n\");\n\n destroy_tree(n);\n\n return 0;\n}\n","language":"C"},{"code":"#include <boost/scoped_ptr.hpp>\n#include <iostream>\n#include <queue>\n\ntemplate<typename T>\nclass TreeNode {\npublic:\n TreeNode(const T& n, TreeNode* left = NULL, TreeNode* right = NULL)\n : mValue(n),\n mLeft(left),\n mRight(right) {}\n\n T getValue() const {\n return mValue;\n }\n\n TreeNode* left() const {\n return mLeft.get();\n }\n\n TreeNode* right() const {\n return mRight.get();\n }\n\n void preorderTraverse() const {\n std::cout << \" \" << getValue();\n if(mLeft) { mLeft->preorderTraverse(); }\n if(mRight) { mRight->preorderTraverse(); }\n }\n\n void inorderTraverse() const {\n if(mLeft) { mLeft->inorderTraverse(); }\n std::cout << \" \" << getValue();\n if(mRight) { mRight->inorderTraverse(); }\n }\n\n void postorderTraverse() const {\n if(mLeft) { mLeft->postorderTraverse(); }\n if(mRight) { mRight->postorderTraverse(); }\n std::cout << \" \" << getValue();\n }\n\n void levelorderTraverse() const {\n std::queue<const TreeNode*> q;\n q.push(this);\n\n while(!q.empty()) {\n const TreeNode* n = q.front();\n q.pop();\n std::cout << \" \" << n->getValue();\n\n if(n->left()) { q.push(n->left()); }\n if(n->right()) { q.push(n->right()); }\n }\n }\n\nprotected:\n T mValue;\n boost::scoped_ptr<TreeNode> mLeft;\n boost::scoped_ptr<TreeNode> mRight;\n\nprivate:\n TreeNode();\n};\n\nint main() {\n TreeNode<int> root(1,\n new TreeNode<int>(2,\n new TreeNode<int>(4,\n new TreeNode<int>(7)),\n new TreeNode<int>(5)),\n new TreeNode<int>(3,\n new TreeNode<int>(6,\n new TreeNode<int>(8),\n new TreeNode<int>(9))));\n\n std::cout << \"preorder: \";\n root.preorderTraverse();\n std::cout << std::endl;\n\n std::cout << \"inorder: \";\n root.inorderTraverse();\n std::cout << std::endl;\n\n std::cout << \"postorder: \";\n root.postorderTraverse();\n std::cout << std::endl;\n\n std::cout << \"level-order:\";\n root.levelorderTraverse();\n std::cout << std::endl;\n\n return 0;\n}\n","language":"C++"},{"code":"#include <iostream>\n\nusing namespace std;\n\nconst int MAX_DIM = 16;\n\ntypedef int* tree;\n\nint left(int index)\n{\n return index*2+1;\n}\n\nint right(int index)\n{\n return index*2+2;\n}\n\nvoid preorder(tree t, int index = 0)\n{\n if(index < MAX_DIM && t[index] != 0){\n cout << t[index] << ' ';\n preorder(t, left(index));\n preorder(t, right(index));\n }\n}\n\nvoid inorder(tree t, int index = 0)\n{\n if(index < MAX_DIM && t[index] != 0){\n inorder(t, left(index));\n cout << t[index] << ' ';\n inorder(t, right(index));\n }\n}\n\nvoid postorder(tree t, int index = 0)\n{\n if(index < MAX_DIM && t[index] != 0){\n postorder(t, left(index));\n postorder(t, right(index));\n cout << t[index] << ' ';\n }\n}\n\nvoid level_order(tree t, int index = 0)\n{\n for(int i = 0; i < MAX_DIM; ++i){\n if(t[i] != 0)\n cout << t[i] << ' ';\n }\n}\n\nint main()\n{\n int t[MAX_DIM] = {1,2,3,4,5,6,0,7,0,0,0,8,9};\n cout << \"preorder: \";\n preorder(t);\n cout << endl;\n cout << \"inorder: \";\n inorder(t);\n cout << endl;\n cout << \"postorder: \";\n postorder(t);\n cout << endl;\n cout << \"level_order: \";\n level_order(t);\n cout << endl;\n}\n","language":"C++"},{"code":"#include <iostream>\n#include <memory>\n#include <queue>\n\ntemplate <typename T>\nclass node {\npublic:\n node(T value) : value_(value) {}\n node(T value, std::unique_ptr<node>&& left)\n : value_(value), left_(std::move(left)) {}\n node(T value, std::unique_ptr<node>&& left, std::unique_ptr<node>&& right)\n : value_(value), left_(std::move(left)), right_(std::move(right)) {}\n\n template <typename Function>\n void pre_order(Function f) {\n f(value_);\n if (left_)\n left_->pre_order(f);\n if (right_)\n right_->pre_order(f);\n }\n\n template <typename Function>\n void in_order(Function f) {\n if (left_)\n left_->in_order(f);\n f(value_);\n if (right_)\n right_->in_order(f);\n }\n\n template <typename Function>\n void post_order(Function f) {\n if (left_)\n left_->post_order(f);\n if (right_)\n right_->post_order(f);\n f(value_);\n }\n\n template <typename Function>\n void level_order(Function f) {\n std::queue<node*> queue;\n queue.push(this);\n while (!queue.empty()) {\n node* next = queue.front();\n queue.pop();\n f(next->value_);\n if (next->left_)\n queue.push(next->left_.get());\n if (next->right_)\n queue.push(next->right_.get());\n }\n }\nprivate:\n T value_;\n std::unique_ptr<node> left_;\n std::unique_ptr<node> right_;\n};\n\ntemplate <typename T, typename... Args>\nstd::unique_ptr<node<T>>\ntree(T value, Args&&... args) {\n return std::make_unique<node<T>>(value, std::forward<Args>(args)...);\n}\n\nint main() {\n node<int> n(1,\n tree(2,\n tree(4,\n tree(7)),\n tree(5)),\n tree(3,\n tree(6,\n tree(8),\n tree(9))));\n\n auto print = [](int n) { std::cout << n << ' '; };\n\n std::cout << \"pre-order: \";\n n.pre_order(print);\n std::cout << '\\n';\n\n std::cout << \"in-order: \";\n n.in_order(print);\n std::cout << '\\n';\n\n std::cout << \"post-order: \";\n n.post_order(print);\n std::cout << '\\n';\n\n std::cout << \"level-order: \";\n n.level_order(print);\n std::cout << '\\n';\n}\n","language":"C++"},{"code":"using System;\nusing System.Collections.Generic;\nusing System.Linq;\n\nclass Node\n{\n int Value;\n Node Left;\n Node Right;\n\n Node(int value = default(int), Node left = default(Node), Node right = default(Node))\n {\n Value = value;\n Left = left;\n Right = right;\n }\n\n IEnumerable<int> Preorder()\n {\n yield return Value;\n if (Left != null)\n foreach (var value in Left.Preorder())\n yield return value;\n if (Right != null)\n foreach (var value in Right.Preorder())\n yield return value;\n }\n\n IEnumerable<int> Inorder()\n {\n if (Left != null)\n foreach (var value in Left.Inorder())\n yield return value;\n yield return Value;\n if (Right != null)\n foreach (var value in Right.Inorder())\n yield return value;\n }\n\n IEnumerable<int> Postorder()\n {\n if (Left != null)\n foreach (var value in Left.Postorder())\n yield return value;\n if (Right != null)\n foreach (var value in Right.Postorder())\n yield return value;\n yield return Value;\n }\n\n IEnumerable<int> LevelOrder()\n {\n var queue = new Queue<Node>();\n queue.Enqueue(this);\n while (queue.Any())\n {\n var node = queue.Dequeue();\n yield return node.Value;\n if (node.Left != null)\n queue.Enqueue(node.Left);\n if (node.Right != null)\n queue.Enqueue(node.Right);\n }\n }\n\n static void Main()\n {\n var tree = new Node(1, new Node(2, new Node(4, new Node(7)), new Node(5)), new Node(3, new Node(6, new Node(8), new Node(9))));\n foreach (var traversal in new Func<IEnumerable<int>>[] { tree.Preorder, tree.Inorder, tree.Postorder, tree.LevelOrder })\n Console.WriteLine(\"{0}:\\t{1}\", traversal.Method.Name, string.Join(\" \", traversal()));\n }\n}\n","language":"C-sharp"},{"code":"import ceylon.collection {\n\tArrayList\n}\n\nshared void run() {\n\n\tclass Node(label, left = null, right = null) {\n\t\tshared Integer label;\n\t\tshared Node? left;\n\t\tshared Node? right;\n\t\tstring => label.string;\n\t}\n\t\n\tvoid preorder(Node node) {\n\t\tprocess.write(node.string + \" \");\n\t\tif(exists left = node.left) {\n\t\t\tpreorder(left);\n\t\t}\n\t\tif(exists right = node.right) {\n\t\t\tpreorder(right);\n\t\t}\n\t}\n\t\n\tvoid inorder(Node node) {\n\t\tif(exists left = node.left) {\n\t\t\tinorder(left);\n\t\t}\n\t\tprocess.write(node.string + \" \");\n\t\tif(exists right = node.right) {\n\t\t\tinorder(right);\n\t\t}\n\t}\n\t\n\tvoid postorder(Node node) {\n\t\tif(exists left = node.left) {\n\t\t\tpostorder(left);\n\t\t}\n\t\tif(exists right = node.right) {\n\t\t\tpostorder(right);\n\t\t}\n\t\tprocess.write(node.string + \" \");\n\t}\n\t\n\tvoid levelOrder(Node node) {\n\t\tvalue nodes = ArrayList<Node> {node};\n\t\twhile(exists current = nodes.accept()) {\n\t\t\tprocess.write(current.string + \" \");\n\t\t\tif(exists left = current.left) {\n\t\t\t\tnodes.offer(left);\n\t\t\t}\n\t\t\tif(exists right = current.right) {\n\t\t\t\tnodes.offer(right);\n\t\t\t}\n\t\t}\n\t}\n\n\tvalue tree = Node {\n\t\tlabel = 1;\n\t\tleft = Node {\n\t\t\tlabel = 2;\n\t\t\tleft = Node {\n\t\t\t\tlabel = 4;\n\t\t\t\tleft = Node {\n\t\t\t\t\tlabel = 7;\n\t\t\t\t};\n\t\t\t};\n\t\t\tright = Node {\n\t\t\t\tlabel = 5;\n\t\t\t};\n\t\t};\n\t\tright = Node {\n\t\t\tlabel = 3;\n\t\t\tleft = Node {\n\t\t\t\tlabel = 6;\n\t\t\t\tleft = Node {\n\t\t\t\t\tlabel = 8;\n\t\t\t\t};\n\t\t\t\tright = Node {\n\t\t\t\t\tlabel = 9;\n\t\t\t\t};\n\t\t\t};\n\t\t};\n\t};\n\t\n\tprocess.write(\"preorder: \");\n\tpreorder(tree);\n\tprint(\"\");\n\tprocess.write(\"inorder: \");\n\tinorder(tree);\n\tprint(\"\");\n\tprocess.write(\"postorder: \");\n\tpostorder(tree);\n\tprint(\"\");\n\tprocess.write(\"levelorder: \");\n\tlevelOrder(tree);\n\tprint(\"\");\n}\n","language":"Ceylon"},{"code":"(defn walk [node f order]\n (when node\n (doseq [o order]\n (if (= o :visit)\n (f (:val node))\n (walk (node o) f order)))))\n\n(defn preorder [node f]\n (walk node f [:visit :left :right]))\n\n(defn inorder [node f]\n (walk node f [:left :visit :right]))\n\n(defn postorder [node f]\n (walk node f [:left :right :visit]))\n\n(defn queue [& xs]\n (when (seq xs)\n (apply conj clojure.lang.PersistentQueue/EMPTY xs)))\n\n(defn level-order [root f]\n (loop [q (queue root)]\n (when-not (empty? q)\n (if-let [node (first q)]\n (do\n (f (:val node))\n (recur (conj (pop q) (:left node) (:right node))))\n (recur (pop q))))))\n\n(defn vec-to-tree [t]\n (if (vector? t)\n (let [[val left right] t]\n {:val val\n :left (vec-to-tree left)\n :right (vec-to-tree right)})\n t))\n\n(let [tree (vec-to-tree [1 [2 [4 [7]] [5]] [3 [6 [8] [9]]]])\n fs '[preorder inorder postorder level-order]\n pr-node #(print (format \"%2d\" %))]\n (doseq [f fs]\n (print (format \"%-12s\" (str f \":\")))\n ((resolve f) tree pr-node)\n (println)))\n","language":"Clojure"},{"code":"bintree = cluster [T: type] is leaf, node,\n pre_order, post_order, in_order, level_order\n branch = struct[left, right: bintree[T], val: T]\n rep = oneof[br: branch, leaf: null]\n\n leaf = proc () returns (cvt)\n return(rep$make_leaf(nil))\n end leaf\n\n node = proc (val: T, l,r: cvt) returns (cvt)\n return(rep$make_br(branch${left:up(l), right:up(r), val:val}))\n end node\n\n pre_order = iter (n: cvt) yields (T)\n tagcase n\n tag br (b: branch):\n yield(b.val)\n for v: T in pre_order(b.left) do yield(v) end\n for v: T in pre_order(b.right) do yield(v) end\n tag leaf:\n end\n end pre_order\n\n in_order = iter (n: cvt) yields (T)\n tagcase n\n tag br (b: branch):\n for v: T in in_order(b.left) do yield(v) end\n yield(b.val)\n for v: T in in_order(b.right) do yield(v) end\n tag leaf:\n end\n end in_order\n\n post_order = iter (n: cvt) yields (T)\n tagcase n\n tag br (b: branch):\n for v: T in post_order(b.left) do yield(v) end\n for v: T in post_order(b.right) do yield(v) end\n yield(b.val)\n tag leaf:\n end\n end post_order\n\n level_order = iter (n: cvt) yields (T)\n bfs: array[rep] := array[rep]$[n]\n while ~array[rep]$empty(bfs) do\n cur: rep := array[rep]$reml(bfs)\n tagcase cur\n tag br (b: branch):\n yield(b.val)\n array[rep]$addh(bfs,down(b.left))\n array[rep]$addh(bfs,down(b.right))\n tag leaf:\n end\n end\n end level_order\nend bintree\n\nstart_up = proc ()\n bt = bintree[int]\n\n po: stream := stream$primary_output()\n tree: bt := bt$node(1,\n bt$node(2,\n bt$node(4,\n bt$node(7, bt$leaf(), bt$leaf()),\n bt$leaf()),\n bt$node(5, bt$leaf(), bt$leaf())),\n bt$node(3,\n bt$node(6,\n bt$node(8, bt$leaf(), bt$leaf()),\n bt$node(9, bt$leaf(), bt$leaf())),\n bt$leaf()))\n\n stream$puts(po, \"preorder: \")\n for i: int in bt$pre_order(tree) do\n stream$puts(po, \" \" || int$unparse(i))\n end\n\n stream$puts(po, \"\\ninorder: \")\n for i: int in bt$in_order(tree) do\n stream$puts(po, \" \" || int$unparse(i))\n end\n\n stream$puts(po, \"\\npostorder: \")\n for i: int in bt$post_order(tree) do\n stream$puts(po, \" \" || int$unparse(i))\n end\n\n stream$puts(po, \"\\nlevel-order:\")\n for i: int in bt$level_order(tree) do\n stream$puts(po, \" \" || int$unparse(i))\n end\nend start_up\n","language":"CLU"},{"code":"# In this example, we don't encapsulate binary trees as objects; instead, we have a\n# convention on how to store them as arrays, and we namespace the functions that\n# operate on those data structures.\nbinary_tree =\n preorder: (tree, visit) ->\n return unless tree?\n [node, left, right] = tree\n visit node\n binary_tree.preorder left, visit\n binary_tree.preorder right, visit\n\n inorder: (tree, visit) ->\n return unless tree?\n [node, left, right] = tree\n binary_tree.inorder left, visit\n visit node\n binary_tree.inorder right, visit\n\n postorder: (tree, visit) ->\n return unless tree?\n [node, left, right] = tree\n binary_tree.postorder left, visit\n binary_tree.postorder right, visit\n visit node\n\n levelorder: (tree, visit) ->\n q = []\n q.push tree\n while q.length > 0\n t = q.shift()\n continue unless t?\n [node, left, right] = t\n visit node\n q.push left\n q.push right\n\ndo ->\n tree = [1, [2, [4, [7]], [5]], [3, [6, [8],[9]]]]\n test_walk = (walk_function_name) ->\n output = []\n binary_tree[walk_function_name] tree, output.push.bind(output)\n console.log walk_function_name, output.join ' '\n test_walk \"preorder\"\n test_walk \"inorder\"\n test_walk \"postorder\"\n test_walk \"levelorder\"\n","language":"CoffeeScript"},{"code":"(defun preorder (node f)\n (when node\n (funcall f (first node))\n (preorder (second node) f)\n (preorder (third node) f)))\n\n(defun inorder (node f)\n (when node\n (inorder (second node) f)\n (funcall f (first node))\n (inorder (third node) f)))\n\n(defun postorder (node f)\n (when node\n (postorder (second node) f)\n (postorder (third node) f)\n (funcall f (first node))))\n\n(defun level-order (node f)\n (loop with level = (list node)\n while level\n do\n (setf level (loop for node in level\n when node\n do (funcall f (first node))\n and collect (second node)\n and collect (third node)))))\n\n(defparameter *tree* '(1 (2 (4 (7))\n (5))\n (3 (6 (8)\n (9)))))\n\n(defun show (traversal-function)\n (format t \"~&~(~A~):~12,0T\" traversal-function)\n (funcall traversal-function *tree* (lambda (value) (format t \" ~A\" value))))\n\n(map nil #'show '(preorder inorder postorder level-order))\n","language":"Common-Lisp"},{"code":"Require Import Utf8.\nRequire Import List.\n\nUnset Elimination Schemes.\n\n(* Rose tree, with numbers on nodes *)\nInductive tree := Tree { value : nat ; children : list tree }.\n\nFixpoint height (t: tree) : nat :=\n 1 + fold_left (? n t, max n (height t)) (children t) 0.\n\nExample leaf n : tree := {| value := n ; children := nil |}.\n\nExample t2 : tree := {| value := 2 ; children := {| value := 4 ; children := leaf 7 :: nil |} :: leaf 5 :: nil |}.\n\nExample t3 : tree := {| value := 3 ; children := {| value := 6 ; children := leaf 8 :: leaf 9 :: nil |} :: nil |}.\n\nExample t9 : tree := {| value := 1 ; children := t2 :: t3 :: nil |}.\n\nFixpoint preorder (t: tree) : list nat :=\n let '{| value := n ; children := c |} := t in\n n :: flat_map preorder c.\n\nFixpoint inorder (t: tree) : list nat :=\n let '{| value := n ; children := c |} := t in\n match c with\n | nil => n :: nil\n | l :: r => inorder l ++ n :: flat_map inorder r\n end.\n\nFixpoint postorder (t: tree) : list nat :=\n let '{| value := n ; children := c |} := t in\n flat_map postorder c ++ n :: nil.\n\n(* Auxiliary function for levelorder, which operates on forests *)\n(* Since the recursion is tricky, it relies on a fuel parameter which obviously decreases. *)\nFixpoint levelorder_forest (fuel: nat) (f: list tree) : list nat:=\n match fuel with\n | O => nil\n | S fuel' =>\n let '(p, f) := fold_right (? t r, let '(x, f) := r in (value t :: x, children t ++ f) ) (nil, nil) f in\n p ++ levelorder_forest fuel' f\n end.\n\nDefinition levelorder (t: tree) : list nat :=\n levelorder_forest (height t) (t :: nil).\n\nCompute preorder t9.\nCompute inorder t9.\nCompute postorder t9.\nCompute levelorder t9.\n","language":"Coq"},{"code":"class Node(T)\n property left : Nil | Node(T)\n property right : Nil | Node(T)\n property data : T\n\n def initialize(@data, @left = nil, @right = nil)\n end\n\n def preorder_traverse\n print \" #{data}\"\n if left = @left\n left.preorder_traverse\n end\n if right = @right\n right.preorder_traverse\n end\n end\n\n def inorder_traverse\n if left = @left\n left.inorder_traverse\n end\n print \" #{data}\"\n if right = @right\n right.inorder_traverse\n end\n end\n\n def postorder_traverse\n if left = @left\n left.postorder_traverse\n end\n if right = @right\n right.postorder_traverse\n end\n print \" #{data}\"\n end\n\n def levelorder_traverse\n queue = Array(Node(T)).new\n queue << self\n\n until queue.size <= 0\n node = queue.shift\n\n unless node\n next\n end\n\n print \" #{node.data}\"\n\n if left = node.left\n queue << left\n end\n if right = node.right\n queue << right\n end\n end\n end\nend\n\ntree = Node(Int32).new(1,\n Node(Int32).new(2,\n Node(Int32).new(4,\n Node(Int32).new(7)),\n Node(Int32).new(5)),\n Node(Int32).new(3,\n Node(Int32).new(6,\n Node(Int32).new(8),\n Node(Int32).new(9))))\n\nprint \"preorder: \"\ntree.preorder_traverse\nprint \"\\ninorder: \"\ntree.inorder_traverse\nprint \"\\npostorder: \"\ntree.postorder_traverse\nprint \"\\nlevelorder: \"\ntree.levelorder_traverse\nputs\n","language":"Crystal"},{"code":"import std.stdio, std.traits;\n\nconst final class Node(T) {\n T data;\n Node left, right;\n\n this(in T data, in Node left=null, in Node right=null)\n const pure nothrow {\n this.data = data;\n this.left = left;\n this.right = right;\n }\n}\n\n// 'static' templated opCall can't be used in Node\nauto node(T)(in T data, in Node!T left=null, in Node!T right=null)\npure nothrow {\n return new const(Node!T)(data, left, right);\n}\n\nvoid show(T)(in T x) {\n write(x, \" \");\n}\n\nenum Visit { pre, inv, post }\n\n// 'visitor' can be any kind of callable or it uses a default visitor.\n// TNode can be any kind of Node, with data, left and right fields,\n// so this is more generic than a member function of Node.\nvoid backtrackingOrder(Visit v, TNode, TyF=void*)\n (in TNode node, TyF visitor=null) {\n alias trueVisitor = Select!(is(TyF == void*), show, visitor);\n if (node !is null) {\n static if (v == Visit.pre)\n trueVisitor(node.data);\n backtrackingOrder!v(node.left, visitor);\n static if (v == Visit.inv)\n trueVisitor(node.data);\n backtrackingOrder!v(node.right, visitor);\n static if (v == Visit.post)\n trueVisitor(node.data);\n }\n}\n\nvoid levelOrder(TNode, TyF=void*)\n (in TNode node, TyF visitor=null, const(TNode)[] more=[]) {\n alias trueVisitor = Select!(is(TyF == void*), show, visitor);\n if (node !is null) {\n more ~= [node.left, node.right];\n trueVisitor(node.data);\n }\n if (more.length)\n levelOrder(more[0], visitor, more[1 .. $]);\n}\n\nvoid main() {\n alias N = node;\n const tree = N(1,\n N(2,\n N(4,\n N(7)),\n N(5)),\n N(3,\n N(6,\n N(8),\n N(9))));\n\n write(\" preOrder: \");\n tree.backtrackingOrder!(Visit.pre);\n write(\"\\n inorder: \");\n tree.backtrackingOrder!(Visit.inv);\n write(\"\\n postOrder: \");\n tree.backtrackingOrder!(Visit.post);\n write(\"\\nlevelorder: \");\n tree.levelOrder;\n writeln;\n}\n","language":"D"},{"code":"const struct Node(T) {\n T v;\n Node* l, r;\n}\n\nT[] preOrder(T)(in Node!T* t) pure nothrow {\n return t ? t.v ~ preOrder(t.l) ~ preOrder(t.r) : [];\n}\n\nT[] inOrder(T)(in Node!T* t) pure nothrow {\n return t ? inOrder(t.l) ~ t.v ~ inOrder(t.r) : [];\n}\n\nT[] postOrder(T)(in Node!T* t) pure nothrow {\n return t ? postOrder(t.l) ~ postOrder(t.r) ~ t.v : [];\n}\n\nT[] levelOrder(T)(in Node!T* t) pure nothrow {\n static T[] loop(in Node!T*[] a) pure nothrow {\n if (!a.length) return [];\n if (!a[0]) return loop(a[1 .. $]);\n return a[0].v ~ loop(a[1 .. $] ~ [a[0].l, a[0].r]);\n }\n return loop([t]);\n}\n\nvoid main() {\n alias N = Node!int;\n auto tree = new N(1,\n new N(2,\n new N(4,\n new N(7)),\n new N(5)),\n new N(3,\n new N(6,\n new N(8),\n new N(9))));\n\n import std.stdio;\n writeln(preOrder(tree));\n writeln(inOrder(tree));\n writeln(postOrder(tree));\n writeln(levelOrder(tree));\n}\n","language":"D"},{"code":"import std.stdio, std.algorithm, std.range, std.string;\n\nconst struct Tree(T) {\n T value;\n Tree* left, right;\n}\n\nalias VisitRange(T) = InputRange!(const Tree!T);\n\nVisitRange!T preOrder(T)(in Tree!T* t) /*pure nothrow*/ {\n enum self = mixin(\"&\" ~ __FUNCTION__.split(\".\").back);\n if (t == null)\n return typeof(return).init.takeNone.inputRangeObject;\n return [*t]\n .chain([t.left, t.right]\n .filter!(t => t != null)\n .map!(a => self(a))\n .joiner)\n .inputRangeObject;\n}\n\nVisitRange!T inOrder(T)(in Tree!T* t) /*pure nothrow*/ {\n enum self = mixin(\"&\" ~ __FUNCTION__.split(\".\").back);\n if (t == null)\n return typeof(return).init.takeNone.inputRangeObject;\n return [t.left]\n .filter!(t => t != null)\n .map!(a => self(a))\n .joiner\n .chain([*t])\n .chain([t.right]\n .filter!(t => t != null)\n .map!(a => self(a))\n .joiner)\n .inputRangeObject;\n}\n\nVisitRange!T postOrder(T)(in Tree!T* t) /*pure nothrow*/ {\n enum self = mixin(\"&\" ~ __FUNCTION__.split(\".\").back);\n if (t == null)\n return typeof(return).init.takeNone.inputRangeObject;\n return [t.left, t.right]\n .filter!(t => t != null)\n .map!(a => self(a))\n .joiner\n .chain([*t])\n .inputRangeObject;\n}\n\nvoid main() {\n alias N = Tree!int;\n const tree = new N(1,\n new N(2,\n new N(4,\n new N(7)),\n new N(5)),\n new N(3,\n new N(6,\n new N(8),\n new N(9))));\n\n tree.preOrder.map!(t => t.value).writeln;\n tree.inOrder.map!(t => t.value).writeln;\n tree.postOrder.map!(t => t.value).writeln;\n}\n","language":"D"},{"code":"{Structure holding node data}\n\ntype PNode = ^TNode;\n TNode = record\n Data: integer;\n Left,Right: PNode;\n end;\n\n\nfunction PreOrder(Node: TNode): string;\n{Recursively traverse Node-Left-Right}\nbegin\nResult:=IntToStr(Node.Data);\nif Node.Left<>nil then Result:=Result+' '+PreOrder(Node.Left^);\nif Node.Right<>nil then Result:=Result+' '+PreOrder(Node.Right^);\nend;\n\n\nfunction InOrder(Node: TNode): string;\n{Recursively traverse Left-Node-Right}\nbegin\nResult:='';\nif Node.Left<>nil then Result:=Result+inOrder(Node.Left^);\nResult:=Result+IntToStr(Node.Data)+' ';\nif Node.Right<>nil then Result:=Result+inOrder(Node.Right^);\nend;\n\n\nfunction PostOrder(Node: TNode): string;\n{Recursively traverse Left-Right-Node}\nbegin\nResult:='';\nif Node.Left<>nil then Result:=Result+PostOrder(Node.Left^);\nif Node.Right<>nil then Result:=Result+PostOrder(Node.Right^);\nResult:=Result+IntToStr(Node.Data)+' ';\nend;\n\n\nfunction LevelOrder(Node: TNode): string;\n{Traverse the tree at each level, Left to right}\nvar Queue: TList;\nvar NT: TNode;\nbegin\nQueue:=TList.Create;\ntry\nResult:='';\nQueue.Add(@Node);\nwhile true do\n\tbegin\n\t{Display oldest node in queue}\n\tNT:=PNode(Queue[0])^;\n\tQueue.Delete(0);\n\tResult:=Result+IntToStr(NT.Data)+' ';\n\t{Queue left and right children}\n\tif NT.left<>nil then Queue.add(NT.left);\n\tif NT.right<>nil then Queue.add(NT.right);\n\tif Queue.Count<1 then break;\n end;\nfinally Queue.Free; end;\nend;\n\n\nprocedure ShowBinaryTree(Memo: TMemo);\nvar Tree: array [0..9] of TNode;\nvar I: integer;\nbegin\n{Fill array of node with data}\n{that matchs its position in the array}\nfor I:=0 to High(Tree) do\n\tbegin\n\tTree[I].Data:=I+1;\n\tTree[I].Left:=nil;\n\tTree[I].Right:=nil;\n\tend;\n{Build the specified tree}\nTree[0].left:=@Tree[2-1];\nTree[0].right:=@Tree[3-1];\nTree[1].left:=@Tree[4-1];\nTree[1].right:=@Tree[5-1];\nTree[3].left:=@Tree[7-1];\nTree[2].left:=@Tree[6-1];\nTree[5].left:=@Tree[8-1];\nTree[5].right:=@Tree[9-1];\n{Tranverse the tree in four specified ways}\nMemo.Lines.Add('Pre-Order: '+PreOrder(Tree[0]));\nMemo.Lines.Add('In-Order: '+InOrder(Tree[0]));\nMemo.Lines.Add('Post-Order: '+PostOrder(Tree[0]));\nMemo.Lines.Add('Level-Order: '+LevelOrder(Tree[0]));\nend;\n","language":"Delphi"},{"code":"type\n Node = struct {\n int val;\n *Node left, right;\n },\n Tree = *Node;\n\nproc tree(int v; Tree l, r) Tree:\n Tree t;\n t := new(Node);\n t*.val := v;\n t*.left := l;\n t*.right := r;\n t\ncorp\n\nproc preorder(Tree t) void:\n if t /= nil then\n write(t*.val, ' ');\n preorder(t*.left);\n preorder(t*.right)\n fi\ncorp\n\nproc inorder(Tree t) void:\n if t /= nil then\n inorder(t*.left);\n write(t*.val, ' ');\n inorder(t*.right)\n fi\ncorp\n\nproc postorder(Tree t) void:\n if t /= nil then\n postorder(t*.left);\n postorder(t*.right);\n write(t*.val, ' ')\n fi\ncorp\n\nproc levelorder(Tree t) void:\n [256]Tree q;\n word s, e;\n s := 0;\n q[s] := t;\n e := 1;\n while s /= e do\n if q[s] /= nil then\n q[e] := q[s]*.left;\n q[e+1] := q[s]*.right;\n e := e+2;\n write(q[s]*.val, ' ')\n fi;\n s := s+1\n od\ncorp\n\nproc main() void:\n Tree t;\n t := tree(1,\n tree(2,\n tree(4,\n tree(7,nil,nil),\n nil),\n tree(5,nil,nil)),\n tree(3,\n tree(6,\n tree(8,nil,nil),\n tree(9,nil,nil)),\n nil));\n\n write(\"preorder: \"); preorder(t); writeln();\n write(\"inorder: \"); inorder(t); writeln();\n write(\"postorder: \"); postorder(t); writeln();\n write(\"level-order: \"); levelorder(t); writeln();\ncorp\n","language":"Draco"},{"code":"def btree := [1, [2, [4, [7, null, null],\n null],\n [5, null, null]],\n [3, [6, [8, null, null],\n [9, null, null]],\n null]]\n\ndef backtrackingOrder(node, pre, mid, post) {\n switch (node) {\n match ==null {}\n match [value, left, right] {\n pre(value)\n backtrackingOrder(left, pre, mid, post)\n mid(value)\n backtrackingOrder(right, pre, mid, post)\n post(value)\n }\n }\n}\n\ndef levelOrder(root, func) {\n var level := [root].diverge()\n while (level.size() > 0) {\n for node in level.removeRun(0) {\n switch (node) {\n match ==null {}\n match [value, left, right] {\n func(value)\n level.push(left)\n level.push(right)\n} } } } }\n\nprint(\"preorder: \")\nbacktrackingOrder(btree, fn v { print(\" \", v) }, fn _ {}, fn _ {})\nprintln()\n\nprint(\"inorder: \")\nbacktrackingOrder(btree, fn _ {}, fn v { print(\" \", v) }, fn _ {})\nprintln()\n\nprint(\"postorder: \")\nbacktrackingOrder(btree, fn _ {}, fn _ {}, fn v { print(\" \", v) })\nprintln()\n\nprint(\"level-order:\")\nlevelOrder(btree, fn v { print(\" \", v) })\nprintln()\n","language":"E"},{"code":"tree[] = [ 1 2 3 4 5 6 -1 7 -1 -1 -1 8 9 ]\n#\nproc preorder ind . .\n if ind > len tree[] or tree[ind] = -1\n return\n .\n write \" \" & tree[ind]\n preorder ind * 2\n preorder ind * 2 + 1\n.\nwrite \"preorder:\"\npreorder 1\nprint \"\"\n#\nproc inorder ind . .\n if ind > len tree[] or tree[ind] = -1\n return\n .\n inorder ind * 2\n write \" \" & tree[ind]\n inorder ind * 2 + 1\n.\nwrite \"inorder:\"\ninorder 1\nprint \"\"\n#\nproc postorder ind . .\n if ind > len tree[] or tree[ind] = -1\n return\n .\n postorder ind * 2\n postorder ind * 2 + 1\n write \" \" & tree[ind]\n.\nwrite \"postorder:\"\npostorder 1\nprint \"\"\n#\nglobal tail head queue[] .\nproc initqu n . .\n len queue[] n\n tail = 1\n head = 1\n.\nproc enqu v . .\n queue[tail] = v\n tail = (tail + 1) mod1 len queue[]\n.\nfunc dequ .\n if head = tail\n return -1\n .\n h = head\n head = (head + 1) mod1 len queue[]\n return queue[h]\n.\ninitqu len tree[]\nproc levelorder n . .\n enqu n\n repeat\n ind = dequ\n until ind = -1\n if ind < len tree[] and tree[ind] <> -1\n write \" \" & tree[ind]\n enqu ind * 2\n enqu ind * 2 + 1\n .\n .\n.\nwrite \"level-order:\"\nlevelorder 1\nprint \"\"\n","language":"EasyLang"},{"code":"note\n\tdescription : \"Application for tree traversal demonstration\"\n output : \"[\n \t Prints preorder, inorder, postorder and levelorder traversal of an example binary tree.\n \t\t ]\"\n\tauthor\t : \"Jascha Grübel\"\n\tdate : \"$2014-01-07$\"\n\trevision : \"$1.0$\"\n\nclass\n\tAPPLICATION\n\ncreate\n\tmake\n\nfeature {NONE} -- Initialization\n\n\tmake\n\t\t\t-- Run Tree traversal example.\n\t\tlocal\n\t\t\ttree:NODE\n\t\tdo\n\t\t\tcreate tree.make (1)\n\t\t\ttree.set_left_child (create {NODE}.make (2))\n\t\t\ttree.set_right_child (create {NODE}.make (3))\n\t\t\ttree.left_child.set_left_child (create {NODE}.make (4))\n\t\t\ttree.left_child.set_right_child (create {NODE}.make (5))\n\t\t\ttree.left_child.left_child.set_left_child (create {NODE}.make (7))\n\t\t\ttree.right_child.set_left_child (create {NODE}.make (6))\n\t\t\ttree.right_child.left_child.set_left_child (create {NODE}.make (8))\n\t\t\ttree.right_child.left_child.set_right_child (create {NODE}.make (9))\n\n\t\t\tIo.put_string (\"preorder: \")\n\t\t\ttree.print_preorder\n\t\t\tIo.put_new_line\n\n\t\t\tIo.put_string (\"inorder: \")\n\t\t\ttree.print_inorder\n\t\t\tIo.put_new_line\n\n\t\t\tIo.put_string (\"postorder: \")\n\t\t\ttree.print_postorder\n\t\t\tIo.put_new_line\n\t\t\t\n\t\t\tIo.put_string (\"level-order:\")\n\t\t\ttree.print_levelorder\n\t\t\tIo.put_new_line\n\n\t\tend\n\nend -- class APPLICATION\n","language":"Eiffel"},{"code":"note\n\tdescription : \"A simple node for a binary tree\"\n libraries : \"Relies on LINKED_LIST from EiffelBase\"\n\tauthor : \"Jascha Grübel\"\n\tdate : \"$2014-01-07$\"\n\trevision : \"$1.0$\"\n implementation : \"[\n\t\t\t All traversals but the levelorder traversal have been implemented recursively.\n The levelorder traversal is solved iteratively.\n\t\t\t ]\"\n\nclass\n\tNODE\ncreate\n\tmake\n\nfeature {NONE} -- Initialization\n\n\tmake (a_value:INTEGER)\n\t\t\t-- Creates a node with no children.\n\t\tdo\n\t\t\tvalue := a_value\n\t\t\tset_right_child(Void)\n\t\t\tset_left_child(Void)\n\t\tend\n\nfeature -- Modification\n\n\tset_right_child (a_node:NODE)\n\t\t\t-- Sets `right_child' to `a_node'.\n\t\tdo\n\t\t\tright_child:=a_node\n\t\tend\n\n\tset_left_child (a_node:NODE)\n\t\t\t-- Sets `left_child' to `a_node'.\n\t\tdo\n\t\t\tleft_child:=a_node\n\t\tend\n\nfeature -- Representation\n\n\tprint_preorder\n\t\t\t-- Recursively prints the value of the node and all its children in preorder\n\t\tdo\n\t\t\tIo.put_string (\" \" + value.out)\n\t\t\tif has_left_child then\n\t\t\t\tleft_child.print_preorder\n\t\t\tend\n\t\t\tif has_right_child then\n\t\t\t\tright_child.print_preorder\n\t\t\tend\n\t\tend\n\n\tprint_inorder\n\t\t\t-- Recursively prints the value of the node and all its children in inorder\n\t\tdo\n\t\t\tif has_left_child then\n\t\t\t\tleft_child.print_inorder\n\t\t\tend\n\t\t\tIo.put_string (\" \" + value.out)\n\t\t\tif has_right_child then\n\t\t\t\tright_child.print_inorder\n\t\t\tend\n\t\tend\n\n\tprint_postorder\n\t\t\t-- Recursively prints the value of the node and all its children in postorder\n\t\tdo\n\t\t\tif has_left_child then\n\t\t\t\tleft_child.print_postorder\n\t\t\tend\n\t\t\tif has_right_child then\n\t\t\t\tright_child.print_postorder\n\t\t\tend\n\t\t\tIo.put_string (\" \" + value.out)\n\t\tend\n\n\tprint_levelorder\n\t\t\t-- Iteratively prints the value of the node and all its children in levelorder\n\t\tlocal\n\t\t\tl_linked_list:LINKED_LIST[NODE]\n\t\t\tl_node:NODE\n\t\tdo\n\t\t\tfrom\n\t\t\t\tcreate l_linked_list.make\n\t\t\t\tl_linked_list.extend (Current)\n\t\t\tuntil\n\t\t\t\tl_linked_list.is_empty\n\t\t\tloop\n\t\t\t\tl_node := l_linked_list.first\n\t\t\t\tif l_node.has_left_child then\n\t\t\t\t\tl_linked_list.extend (l_node.left_child)\n\t\t\t\tend\n\t\t\t\tif l_node.has_right_child then\n\t\t\t\t\tl_linked_list.extend (l_node.right_child)\n\t\t\t\tend\n\t\t\t\tIo.put_string (\" \" + l_node.value.out)\n\t\t\t\tl_linked_list.prune (l_node)\n\t\t\tend\n\t\tend\n\nfeature -- Access\n\n\tvalue:INTEGER\n\t\t\t-- Value stored in the node.\n\n\tright_child:NODE\n\t\t\t-- Reference to right child, possibly void.\n\n\tleft_child:NODE\n\t\t\t-- Reference to left child, possibly void.\n\n\thas_right_child:BOOLEAN\n\t\t\t-- Test right child for existence.\n\t\tdo\n\t\t\tResult := right_child /= Void\n\t\tend\n\n\thas_left_child:BOOLEAN\n\t\t\t-- Test left child for existence.\n\t\tdo\n\t\t\tResult := left_child /= Void\n\t\tend\n\nend\n -- class NODE\n","language":"Eiffel"},{"code":"import extensions;\nimport extensions'routines;\nimport system'collections;\n\nsingleton DummyNode\n{\n get generic()\n = EmptyEnumerable;\n}\n\nclass Node\n{\n int Value : rprop;\n Node Left : rprop;\n Node Right : rprop;\n\n constructor new(int value)\n {\n Value := value\n }\n\n constructor new(int value, Node left)\n {\n Value := value;\n Left := left;\n }\n\n constructor new(int value, Node left, Node right)\n {\n Value := value;\n Left := left;\n Right := right\n }\n\n Preorder = new Enumerable\n {\n Enumerator enumerator() = CompoundEnumerator.new(\n SingleEnumerable.new(Value),\n (Left ?? DummyNode).Preorder,\n (Right ?? DummyNode).Preorder);\n };\n\n Inorder = new Enumerable\n {\n Enumerator enumerator()\n {\n if (nil != Left)\n {\n ^ CompoundEnumerator.new(Left.Inorder, SingleEnumerable.new(Value), (Right ?? DummyNode).Inorder)\n }\n else\n {\n ^ SingleEnumerable.new(Value).enumerator()\n }\n }\n };\n\n Postorder = new Enumerable\n {\n Enumerator enumerator()\n {\n if (nil == Left)\n {\n ^ SingleEnumerable.new(Value).enumerator()\n }\n else if (nil == Right)\n {\n ^ CompoundEnumerator.new(Left.Postorder, SingleEnumerable.new(Value))\n }\n else\n {\n ^ CompoundEnumerator.new(Left.Postorder, Right.Postorder, SingleEnumerable.new(Value))\n }\n }\n };\n\n LevelOrder = new Enumerable\n {\n Queue<Node> queue := class Queue<Node>.allocate(4).push(self);\n\n Enumerator enumerator() = new Enumerator\n {\n bool next() = queue.isNotEmpty();\n\n get Value()\n {\n Node item := queue.pop();\n Node left := item.Left;\n Node right := item.Right;\n\n if (nil != left)\n {\n queue.push(left)\n };\n if (nil != right)\n {\n queue.push(right)\n };\n\n ^ item.Value\n }\n\n reset()\n {\n NotSupportedException.raise()\n }\n\n enumerable() = queue;\n };\n };\n}\n\npublic program()\n{\n var tree := Node.new(1, Node.new(2, Node.new(4, Node.new(7)), Node.new(5)), Node.new(3, Node.new(6, Node.new(8), Node.new(9))));\n\n console.printLine(\"Preorder :\", tree.Preorder);\n console.printLine(\"Inorder :\", tree.Inorder);\n console.printLine(\"Postorder :\", tree.Postorder);\n console.printLine(\"LevelOrder:\", tree.LevelOrder)\n}\n","language":"Elena"},{"code":"component BinaryTreeTraversals (Tree, Element);\ntype Tree;\ntype Node = Tree;\n Tree (LeftTree = Tree, Element, RightTree = Tree) -> Tree;\n Leaf (Element) -> Node;\n Node (Tree) -> Node;\n Item (Node) -> Element;\n\n Preorder (Tree) -> multi (Node);\n Inorder (Tree) -> multi (Node);\n Postorder (Tree) -> multi (Node);\n Level_order(Tree) \t\t -> multi (Node);\nbegin\n Tree (Lefttree, Item, Righttree) = Tree: [ Lefttree; Item; Righttree ];\n Leaf (anItem) = Tree (null(Tree), anItem, null(Tree) );\n Node (aTree) = aTree;\n Item (aNode) = aNode.Item;\n\n Preorder (=null(Tree)) = no(Tree);\n Preorder (T) = ( T, Preorder (T.Lefttree), Preorder (T.Righttree));\n\n Inorder (=null(Tree)) = no(Tree);\n Inorder (T) = ( Inorder (T.Lefttree), T, Inorder (T.Righttree));\n\n Postorder (=null(Tree)) = no(Tree);\n Postorder (T) = ( Postorder (T.Lefttree), Postorder (T.Righttree), T);\t\n\n Level_order(T) = [ Queue = {T};\n\t\t\t node = Tree:items(Queue);\n\t\t\t [ result(node);\n\t\t\t add(Queue, node.Lefttree) when valid(node.Lefttree); \t\n \t\t\t add(Queue, node.Righttree) when valid(node.Righttree); \t\n\t\t\t ];\n\t\t\t no(Tree);\n\t\t ];\nend component BinaryTreeTraversals;\n","language":"Elisa"},{"code":"use BinaryTreeTraversals (Tree, integer);\n\nBT = Tree(\n\tTree(\n Tree(Leaf(7), 4, null(Tree)), 2 , Leaf(5)), 1,\n Tree(\n Tree(Leaf(8), 6, Leaf(9)), 3 ,null(Tree)));\n\n{Item(Preorder(BT))}?\n{ 1, 2, 4, 7, 5, 3, 6, 8, 9}\n\n{Item(Inorder(BT))}?\n{ 7, 4, 2, 5, 1, 8, 6, 9, 3}\n\n{Item(Postorder(BT))}?\n{ 7, 4, 5, 2, 8, 9, 6, 3, 1}\n\n{Item(Level_order(BT))}?\n{ 1, 2, 3, 4, 5, 6, 7, 8, 9}\n","language":"Elisa"},{"code":"defmodule Tree_Traversal do\n defp tnode, do: {}\n defp tnode(v), do: {:node, v, {}, {}}\n defp tnode(v,l,r), do: {:node, v, l, r}\n\n defp preorder(_,{}), do: :ok\n defp preorder(f,{:node,v,l,r}) do\n f.(v)\n preorder(f,l)\n preorder(f,r)\n end\n\n defp inorder(_,{}), do: :ok\n defp inorder(f,{:node,v,l,r}) do\n inorder(f,l)\n f.(v)\n inorder(f,r)\n end\n\n defp postorder(_,{}), do: :ok\n defp postorder(f,{:node,v,l,r}) do\n postorder(f,l)\n postorder(f,r)\n f.(v)\n end\n\n defp levelorder(_, []), do: []\n defp levelorder(f, [{}|t]), do: levelorder(f, t)\n defp levelorder(f, [{:node,v,l,r}|t]) do\n f.(v)\n levelorder(f, t++[l,r])\n end\n defp levelorder(f, x), do: levelorder(f, [x])\n\n def main do\n tree = tnode(1,\n tnode(2,\n tnode(4, tnode(7), tnode()),\n tnode(5, tnode(), tnode())),\n tnode(3,\n tnode(6, tnode(8), tnode(9)),\n tnode()))\n f = fn x -> IO.write \"#{x} \" end\n IO.write \"preorder: \"\n preorder(f, tree)\n IO.write \"\\ninorder: \"\n inorder(f, tree)\n IO.write \"\\npostorder: \"\n postorder(f, tree)\n IO.write \"\\nlevelorder: \"\n levelorder(f, tree)\n IO.puts \"\"\n end\nend\n\nTree_Traversal.main\n","language":"Elixir"},{"code":"-module(tree_traversal).\n-export([main/0]).\n-export([preorder/2, inorder/2, postorder/2, levelorder/2]).\n-export([tnode/0, tnode/1, tnode/3]).\n\n-define(NEWLINE, io:format(\"~n\")).\n\ntnode() -> {}.\ntnode(V) -> {node, V, {}, {}}.\ntnode(V,L,R) -> {node, V, L, R}.\n\npreorder(_,{}) -> ok;\npreorder(F,{node,V,L,R}) ->\n F(V), preorder(F,L), preorder(F,R).\n\ninorder(_,{}) -> ok;\ninorder(F,{node,V,L,R}) ->\n inorder(F,L), F(V), inorder(F,R).\n\npostorder(_,{}) -> ok;\npostorder(F,{node,V,L,R}) ->\n postorder(F,L), postorder(F,R), F(V).\n\nlevelorder(_, []) -> [];\nlevelorder(F, [{}|T]) -> levelorder(F, T);\nlevelorder(F, [{node,V,L,R}|T]) ->\n F(V), levelorder(F, T++[L,R]);\nlevelorder(F, X) -> levelorder(F, [X]).\n\nmain() ->\n Tree = tnode(1,\n tnode(2,\n tnode(4, tnode(7), tnode()),\n tnode(5, tnode(), tnode())),\n tnode(3,\n tnode(6, tnode(8), tnode(9)),\n tnode())),\n F = fun(X) -> io:format(\"~p \",[X]) end,\n preorder(F, Tree), ?NEWLINE,\n inorder(F, Tree), ?NEWLINE,\n postorder(F, Tree), ?NEWLINE,\n levelorder(F, Tree), ?NEWLINE.\n","language":"Erlang"},{"code":"constant VALUE = 1, LEFT = 2, RIGHT = 3\n\nconstant tree = {1,\n {2,\n {4,\n {7, 0, 0},\n 0},\n {5, 0, 0}},\n {3,\n {6,\n {8, 0, 0},\n {9, 0, 0}},\n 0}}\n\nprocedure preorder(object tree)\n if sequence(tree) then\n printf(1,\"%d \",{tree[VALUE]})\n preorder(tree[LEFT])\n preorder(tree[RIGHT])\n end if\nend procedure\n\nprocedure inorder(object tree)\n if sequence(tree) then\n inorder(tree[LEFT])\n printf(1,\"%d \",{tree[VALUE]})\n inorder(tree[RIGHT])\n end if\nend procedure\n\nprocedure postorder(object tree)\n if sequence(tree) then\n postorder(tree[LEFT])\n postorder(tree[RIGHT])\n printf(1,\"%d \",{tree[VALUE]})\n end if\nend procedure\n\nprocedure lo(object tree, sequence more)\n if sequence(tree) then\n more &= {tree[LEFT],tree[RIGHT]}\n printf(1,\"%d \",{tree[VALUE]})\n end if\n if length(more) > 0 then\n lo(more[1],more[2..$])\n end if\nend procedure\n\nprocedure level_order(object tree)\n lo(tree,{})\nend procedure\n\nputs(1,\"preorder: \")\npreorder(tree)\nputs(1,'\\n')\n\nputs(1,\"inorder: \")\ninorder(tree)\nputs(1,'\\n')\n\nputs(1,\"postorder: \")\npostorder(tree)\nputs(1,'\\n')\n\nputs(1,\"level-order: \")\nlevel_order(tree)\nputs(1,'\\n')\n","language":"Euphoria"},{"code":"open System\nopen System.IO\n\ntype Tree<'a> =\n | Tree of 'a * Tree<'a> * Tree<'a>\n | Empty\n\nlet rec inorder tree =\n seq {\n match tree with\n | Tree(x, left, right) ->\n yield! inorder left\n yield x\n yield! inorder right\n | Empty -> ()\n }\n\nlet rec preorder tree =\n seq {\n match tree with\n | Tree(x, left, right) ->\n yield x\n yield! preorder left\n yield! preorder right\n | Empty -> ()\n }\n\nlet rec postorder tree =\n seq {\n match tree with\n | Tree(x, left, right) ->\n yield! postorder left\n yield! postorder right\n yield x\n | Empty -> ()\n }\n\nlet levelorder tree =\n let rec loop queue =\n seq {\n match queue with\n | [] -> ()\n | (Empty::tail) -> yield! loop tail\n | (Tree(x, l, r)::tail) ->\n yield x\n yield! loop (tail @ [l; r])\n }\n loop [tree]\n\n[<EntryPoint>]\nlet main _ =\n let tree =\n Tree (1,\n Tree (2,\n Tree (4,\n Tree (7, Empty, Empty),\n Empty),\n Tree (5, Empty, Empty)),\n Tree (3,\n Tree (6,\n Tree (8, Empty, Empty),\n Tree (9, Empty, Empty)),\n Empty))\n\n let show x = printf \"%d \" x\n\n printf \"preorder: \"\n preorder tree |> Seq.iter show\n printf \"\\ninorder: \"\n inorder tree |> Seq.iter show\n printf \"\\npostorder: \"\n postorder tree |> Seq.iter show\n printf \"\\nlevel-order: \"\n levelorder tree |> Seq.iter show\n 0\n","language":"F-Sharp"},{"code":"USING: accessors combinators deques dlists fry io kernel\nmath.parser ;\nIN: rosetta.tree-traversal\n\nTUPLE: node data left right ;\n\nCONSTANT: example-tree\n T{ node f 1\n T{ node f 2\n T{ node f 4\n T{ node f 7 f f }\n f\n }\n T{ node f 5 f f }\n }\n T{ node f 3\n T{ node f 6\n T{ node f 8 f f }\n T{ node f 9 f f }\n }\n f\n }\n }\n\n: preorder ( node quot: ( data -- ) -- )\n [ [ data>> ] dip call ]\n [ [ left>> ] dip over [ preorder ] [ 2drop ] if ]\n [ [ right>> ] dip over [ preorder ] [ 2drop ] if ]\n 2tri ; inline recursive\n\n: inorder ( node quot: ( data -- ) -- )\n [ [ left>> ] dip over [ inorder ] [ 2drop ] if ]\n [ [ data>> ] dip call ]\n [ [ right>> ] dip over [ inorder ] [ 2drop ] if ]\n 2tri ; inline recursive\n\n: postorder ( node quot: ( data -- ) -- )\n [ [ left>> ] dip over [ postorder ] [ 2drop ] if ]\n [ [ right>> ] dip over [ postorder ] [ 2drop ] if ]\n [ [ data>> ] dip call ]\n 2tri ; inline recursive\n\n: (levelorder) ( dlist quot: ( data -- ) -- )\n over deque-empty? [ 2drop ] [\n [ dup pop-front ] dip {\n [ [ data>> ] dip call drop ]\n [ drop left>> [ swap push-back ] [ drop ] if* ]\n [ drop right>> [ swap push-back ] [ drop ] if* ]\n [ nip (levelorder) ]\n } 3cleave\n ] if ; inline recursive\n\n: levelorder ( node quot: ( data -- ) -- )\n [ 1dlist ] dip (levelorder) ; inline\n\n: levelorder2 ( node quot: ( data -- ) -- )\n [ 1dlist ] dip\n [ dup deque-empty? not ] swap '[\n dup pop-front\n [ data>> @ ]\n [ left>> [ over push-back ] when* ]\n [ right>> [ over push-back ] when* ] tri\n ] while drop ; inline\n\n: main ( -- )\n example-tree [ number>string write \" \" write ] {\n [ \"preorder: \" write preorder nl ]\n [ \"inorder: \" write inorder nl ]\n [ \"postorder: \" write postorder nl ]\n [ \"levelorder: \" write levelorder nl ]\n [ \"levelorder2: \" write levelorder2 nl ]\n } 2cleave ;\n","language":"Factor"},{"code":"class Tree\n{\n readonly Int label\n readonly Tree? left\n readonly Tree? right\n\n new make (Int label, Tree? left := null, Tree? right := null)\n {\n this.label = label\n this.left = left\n this.right = right\n }\n\n Void preorder(|Int->Void| func)\n {\n func(label)\n left?.preorder(func) // ?. will not call method if 'left' is null\n right?.preorder(func)\n }\n\n Void postorder(|Int->Void| func)\n {\n left?.postorder(func)\n right?.postorder(func)\n func(label)\n }\n\n Void inorder(|Int->Void| func)\n {\n left?.inorder(func)\n func(label)\n right?.inorder(func)\n }\n\n Void levelorder(|Int->Void| func)\n {\n Tree[] nodes := [this]\n while (nodes.size > 0)\n {\n Tree cur := nodes.removeAt(0)\n func(cur.label)\n if (cur.left != null) nodes.add (cur.left)\n if (cur.right != null) nodes.add (cur.right)\n }\n }\n}\n\nclass Main\n{\n public static Void main ()\n {\n tree := Tree(1,\n Tree(2, Tree(4, Tree(7)), Tree(5)),\n Tree(3, Tree(6, Tree(8), Tree(9))))\n List result := [,]\n collect := |Int a -> Void| { result.add(a) }\n tree.preorder(collect)\n echo (\"preorder: \" + result.join(\" \"))\n result = [,]\n tree.inorder(collect)\n echo (\"inorder: \" + result.join(\" \"))\n result = [,]\n tree.postorder(collect)\n echo (\"postorder: \" + result.join(\" \"))\n result = [,]\n tree.levelorder(collect)\n echo (\"levelorder: \" + result.join(\" \"))\n }\n}\n","language":"Fantom"},{"code":"\\ binary tree (dictionary)\n: node ( l r data -- node ) here >r , , , r> ;\n: leaf ( data -- node ) 0 0 rot node ;\n\n: >data ( node -- ) @ ;\n: >right ( node -- ) cell+ @ ;\n: >left ( node -- ) cell+ cell+ @ ;\n\n: preorder ( xt tree -- )\n dup 0= if 2drop exit then\n 2dup >data swap execute\n 2dup >left recurse\n >right recurse ;\n\n: inorder ( xt tree -- )\n dup 0= if 2drop exit then\n 2dup >left recurse\n 2dup >data swap execute\n >right recurse ;\n\n: postorder ( xt tree -- )\n dup 0= if 2drop exit then\n 2dup >left recurse\n 2dup >right recurse\n >data swap execute ;\n\n: max-depth ( tree -- n )\n dup 0= if exit then\n dup >left recurse\n swap >right recurse max 1+ ;\n\ndefer depthaction\n: depthorder ( depth tree -- )\n dup 0= if 2drop exit then\n over 0=\n if >data depthaction drop\n else over 1- over >left recurse\n swap 1- swap >right recurse\n then ;\n\n: levelorder ( xt tree -- )\n swap is depthaction\n dup max-depth 0 ?do\n i over depthorder\n loop drop ;\n\n7 leaf 0 4 node\n 5 leaf 2 node\n8 leaf 9 leaf 6 node\n 0 3 node 1 node value tree\n\ncr ' . tree preorder \\ 1 2 4 7 5 3 6 8 9\ncr ' . tree inorder \\ 7 4 2 5 1 8 6 9 3\ncr ' . tree postorder \\ 7 4 5 2 8 9 6 3 1\ncr tree max-depth . \\ 4\ncr ' . tree levelorder \\ 1 2 3 4 5 6 7 8 9\n","language":"Forth"},{"code":" IF (STYLE.EQ.\"PRE\") CALL OUT(HAS)\n IF (LINKL(HAS).GT.0) CALL TARZAN(LINKL(HAS),STYLE)\n IF (STYLE.EQ.\"IN\") CALL OUT(HAS)\n IF (LINKR(HAS).GT.0) CALL TARZAN(LINKR(HAS),STYLE)\n IF (STYLE.EQ.\"POST\") CALL OUT(HAS)\n","language":"Fortran"},{"code":" DO GASP = 1,MAXLEVEL\n CALL TARZAN(1,HOW)\n END DO\n","language":"Fortran"},{"code":" MODULE ARAUCARIA\t!Cunning crosswords, also.\n INTEGER ENUFF\t\t!To suit the set example.\n PARAMETER (ENUFF = 9)\t!This will do.\n INTEGER NODE(ENUFF),LINKL(ENUFF),LINKR(ENUFF)\t!The nodes, and their links.\n DATA NODE/ 1,2,3,4,5,6,7,8,9/\t!Value = index. A rather boring payload.\n DATA LINKL/2,4,6,7,0,8,0,0,0/\t!\"Left\" and \"Right\" are as looking at the page.\n DATA LINKR/3,5,0,0,0,9,0,0,0/\t!If one thinks within the tree, they're the other way around!\nC 1\t!Thus, looking from the \"1\", to the right is \"2\" and to the left is \"3\".\nC / \\\t!But, looking at the scheme, to the left is \"2\" and to the right is \"3\".\nC / \\\t!This latter seems to be the popular view from the outside, not within the data.\nC / \\\t!Similarily, although called a \"tree\", the depiction is upside down!\nC 2 3\t!How can computers be expected to keep up with this contrariness?\nC / \\ /\t!Humm, no example of a rightwards link with no leftwards link.\nC 4 5 6\t!Topologically equivalent, but not so in usage.\nC / / \\\nC 7 8 9\n INTEGER N,LIST(ENUFF)\t!This is to be developed.\n INTEGER LEVEL,MAXLEVEL\t!While these vary in various ways.\n INTEGER GASP\t\t!Communication from JANE.\n CONTAINS\t!No checks for invalid links, etc.\n SUBROUTINE OUT(IS)\t!Append a value to a list.\n INTEGER IS\t\t!The value.\n N = N + 1\t\t!The list's count so far.\n LIST(N) = IS\t\t!Place.\n END SUBROUTINE OUT\t!Eventually, the list can be written in one go.\n\n RECURSIVE SUBROUTINE TARZAN(HAS,STYLE)\t!Skilled at tree traversal, is he.\n INTEGER HAS\t\t!The current position.\n CHARACTER*(*) STYLE\t!Traversal type.\n LEVEL = LEVEL + 1\t!A leap is made.\n IF (LEVEL.GT.MAXLEVEL) MAXLEVEL = LEVEL\t!Staring at the moon.\n SELECT CASE(STYLE)\t!And, in what manner?\n CASE (\"PRE\")\t\t!Declare the position first.\n CALL OUT(HAS)\t!Thus.\n IF (LINKL(HAS).GT.0) CALL TARZAN(LINKL(HAS),STYLE)\n IF (LINKR(HAS).GT.0) CALL TARZAN(LINKR(HAS),STYLE)\n CASE (\"IN\")\t\t!Or in the middle.\n IF (LINKL(HAS).GT.0) CALL TARZAN(LINKL(HAS),STYLE)\n CALL OUT(HAS)\t!Thus.\n IF (LINKR(HAS).GT.0) CALL TARZAN(LINKR(HAS),STYLE)\n CASE (\"POST\")\t!Or at the end.\n IF (LINKL(HAS).GT.0) CALL TARZAN(LINKL(HAS),STYLE)\n IF (LINKR(HAS).GT.0) CALL TARZAN(LINKR(HAS),STYLE)\n CALL OUT(HAS)\t!Thus.\n CASE (\"LEVEL\")\t!Or at specified levels.\n IF (LEVEL.EQ.GASP) CALL OUT(HAS)\t!Such as this?\n IF (LINKL(HAS).GT.0) CALL TARZAN(LINKL(HAS),STYLE)\n IF (LINKR(HAS).GT.0) CALL TARZAN(LINKR(HAS),STYLE)\n CASE DEFAULT\t\t!This shouldn't happen.\n WRITE (6,*) \"Unknown style \",STYLE\t!But, paranoia.\n STOP \"No can do!\"\t\t!Rather than flounder about.\n END SELECT\t\t!That was simple.\n LEVEL = LEVEL - 1\t!Sag back.\n END SUBROUTINE TARZAN\t!Not like George of the Jungle.\n\n SUBROUTINE JANE(HOW)\t!Tells Tarzan what to do.\n CHARACTER*(*) HOW\t!A single word suffices.\n N = 0\t\t\t!No positions trampled.\n LEVEL = 0\t\t!Starting on the ground.\n MAXLEVEL = 0\t\t!The ascent follows.\n IF (HOW.NE.\"LEVEL\") THEN\t!Ordinary styles?\n CALL TARZAN(1,HOW)\t\t!Yes. From the root, go...\n ELSE\t\t\t!But this is not tree-structured.\n GASP = 0\t\t!Instead, we ascend through the canopy in stages.\n 1 GASP = GASP + 1\t\t!Up one stage.\n CALL TARZAN(1,HOW)\t\t!And do it all again.\n IF (GASP.LT.MAXLEVEL) GO TO 1\t!Are we there yet?\n END IF\t\t!Don't know MAXLEVEL until after the first clamber.\nCast forth the list.\n WRITE (6,10) HOW,NODE(LIST(1:N))\t!Show spoor.\n 10 FORMAT (A6,\"-order:\",66(1X,I0))\t!Large enough.\n WRITE (6,*)\t\t\t\t!Sigh.\n END SUBROUTINE JANE\t!That was simple.\n END MODULE ARAUCARIA\t!The monkeys are puzzled.\n\n PROGRAM GORILLA\t\t!No fancy stuff. Just brute force.\n USE ARAUCARIA\t\t!This is for lightweight but cunning monkeys.\n INTEGER IT\t\t!A finger.\n INTEGER SP,STACK(ENUFF)\t!The tree may be slim.\n INTEGER SLEVL(ENUFF)\t!So prepare for maximum usage.\n INTEGER MIST(ENUFF,0:ENUFF)\t!Multiple lists.\n\nChase the links preorder style: name the node, delve its left link, delve its right link.\n N = 0\t!No nodes have been visited.\n SP = 0\t!My stack is empty.\n IT = 1\t!I start at the root.\n 10 N = N + 1\t\t\t!Another node arrived at.\n LIST(N) = IT\t\t!Finger it.\n IF (LINKL(IT).GT.0) THEN\t!A left link?\n IF (LINKR(IT).GT.0) THEN\t!Yes. A right link also?\n SP = SP + 1\t\t\t\t!Yes. Stack it up.\n STACK(SP) = LINKR(IT)\t\t\t!For later investigation.\n END IF\t\t\t\t!So much for the right link.\n IT = LINKL(IT)\t\t\t!Fingered by the left link.\n GO TO 10\t\t\t!See what happens.\n END IF\t\t\t!But if there is no left link,\n IF (LINKR(IT).GT.0) THEN\t!There still might be a right link.\n IT = LINKR(IT)\t\t\t!There is.\n GO TO 10\t\t\t!See what happens.\n END IF\t\t\t!And if there are no links,\n IF (SP.GT.0) THEN\t\t!Perhaps the stack has bottomed out too?\n IT = STACK(SP)\t\t\t!No, this was deferred.\n SP = SP - 1\t\t\t!So, pick up where we left off.\n GO TO 10\t\t\t!And carry on.\n END IF\t\t\t!So much for unstacking.\n WRITE (6,12) \"Preorder\",NODE(LIST(1:N))\t!I've got a little list!\n 12 FORMAT (A12,\":\",66(1X,I0))\n CALL JANE(\"PRE\")\t\t!Try it fancy style.\n\nChase the links inorder style: delve left fully, name the node and try its right, then unstack.\n N = 0\t!No nodes have been visited.\n SP = 0\t!My stack is empty.\n IT = 1\t!I start at the root.\n 20 SP = SP + 1\t\t!I'm on the way down.\n STACK(SP) = IT\t\t!So, save this position to later retreat to.\n IF (LINKL(IT).GT.0) THEN\t!Can I delve further left?\n IT = LINKL(IT)\t\t\t!Yes.\n GO TO 20\t\t\t!And see what happens.\n END IF\t\t\t!So much for diving.\n 21 IF (SP.GT.0) THEN\t!Can I retreat?\n IT = STACK(SP)\t\t!Yes.\n SP = SP - 1\t\t!Go back to whence I had delved left.\n N = N + 1\t\t!This now counts as a place in order.\n LIST(N) = IT\t\t!So list it.\n IF (LINKR(IT).GT.0) THEN!Have I a rightwards path?\n IT = LINKR(IT)\t\t!Yes. Take it.\n GO TO 20\t\t\t!And delve therefrom.\n END IF\t\t\t!This node is now finished with.\n GO TO 21\t\t!So, try for another retreat.\n END IF\t\t!So much for unstacking.\n WRITE (6,12) \"Inorder\",NODE(LIST(1:N))\t!I've got a little list!\n CALL JANE(\"IN\")\t!Try with more style.\n\nChase the links postorder style: delve left fully, delve right, name the node, then unstack.\n N = 0\t!No nodes have been visited.\n SP = 0\t!My stack is empty.\n IT = 1\t!I start at the root.\n 30 SP = SP + 1\t!Action follows delving,\n STACK(SP) = IT\t!So this node will be returned to.\n IF (LINKL(IT).GT.0) THEN\t!Take any leftwards link straightaway.\n IT = LINKL(IT)\t\t!Thus.\n GO TO 30\t\t!Thanks to the stack, we'll return to IT (as was).\n END IF\t\t!But if there is no leftwards link to follow,\n IF (LINKR(IT).GT.0) THEN\t!Perhaps there is a rightwards one?\n STACK(SP) = -STACK(SP)\t!=-IT Mark the stacked finger as a rightwards lurch!\n IT = LINKR(IT)\t\t!The rightwards link is now to be taken.\n GO TO 30\t\t!Thus start on a sub-tree.\n END IF\t\t!But if there is no rightwards link either,\n 31 IF (SP.GT.0) THEN\t!See if there is anywhere to retreat to.\n IT = STACK(SP)\t\t!The same IT placed at 30 if we dropped into 31.\n SP = SP - 1\t\t!But now we're in a different mood.\n IF (IT.LT.0) THEN\t!Returning to what had been a rightwards departure?\n N = N + 1\t\t\t!Yes! Then this node is post-interest.\n LIST(N) = -IT\t\t\t!So, time to roll it forth at last.\n GO TO 31\t\t\t!And retreat some more.\n END IF\t\t\t!But if we hadn't gone right from IT,\n IF (LINKR(IT).LE.0) THEN!We had gone left.\n N = N + 1\t\t\t!And now there is nowhere rightwards.\n LIST(N) = IT\t\t\t!So this node is post-interest.\n GO TO 31\t\t\t!And retreat some more.\n END IF\t\t\t!But if there is a rightwards leap,\n SP = SP + 1\t\t\t!Prepare to return to it,\n STACK(SP) = -IT\t\t\t!Marked as having gone rightwards.\n IT = LINKR(IT)\t\t\t!The rightwards move.\n GO TO 30\t\t\t!Peruse a fresh sub-tree.\n END IF\t\t\t!And if the stack is reduced,\n WRITE (6,12) \"Postorder\",NODE(LIST(1:N))\t!Results!\n CALL JANE(\"POST\")\t\t!The same again?\n\nChase the nodes level style.\n SP = 0\t\t!My stack is empty.\n IT = 1\t\t!I start at the root.\n LEVEL = 0\t\t!On the ground.\n MAXLEVEL = 0\t!No ascent as yet.\n MIST(:,0) = 0\t!At all levels, nothing.\n 40 LEVEL = LEVEL + 1\t\t\t!Every arrival is one level up.\n IF (LEVEL.GT.MAXLEVEL) MAXLEVEL = LEVEL\t!Note the most high.\n MIST(LEVEL,0) = MIST(LEVEL,0) + 1\t!The count at that level.\n MIST(LEVEL,MIST(LEVEL,0)) = IT\t!Add to the level's list.\n IF (LINKL(IT).GT.0) THEN\t\t!Righto, can we go left?\n IF (LINKR(IT).GT.0) THEN\t!Yes. Rightwards as well?\n SP = SP + 1\t\t\t\t!Yes! This will have to wait.\n STACK(SP) = LINKR(IT)\t\t\t!So remember it,\n SLEVL(SP) = LEVEL\t\t\t!And what level we're at now.\n END IF\t\t\t\t!I can only go one way at a time.\n IT = LINKL(IT)\t\t\t!Accept the fingered leftwards lurch.\n GO TO 40\t\t\t!Go to IT.\n END IF\t\t\t!But if there is no leftwards link,\n IF (LINKR(IT).GT.0) THEN\t!Perhaps there is a rightwards one?\n IT = LINKR(IT)\t\t\t!There is.\n GO TO 40\t\t\t!Go to IT.\n END IF\t\t\t!And if there are no further links,\n IF (SP.GT.0) THEN\t\t!Perhaps we can retreat to what was deferred.\n IT = STACK(SP)\t\t\t!The finger.\n LEVEL = SLEVL(SP)\t\t!The level.\n SP = SP - 1\t\t\t!Wind back the stack.\n GO TO 40\t\t\t!Go to IT.\n END IF\t\t\t!So much for the stack.\n WRITE (6,12) \"Levelorder\",\t!Roll the lists in ascending LEVEL order.\n 1 (NODE(MIST(LEVEL,1:MIST(LEVEL,0))), LEVEL = 1,MAXLEVEL)\n CALL JANE(\"LEVEL\")\t!Alternatively...\n END\t!So much for that.\n","language":"Fortran"},{"code":"#define NULL 0\n\nDim Shared As Byte maxnodos = 100\nDim Shared As Byte raiz = 0\nDim Shared As Byte izda = 1\nDim Shared As Byte dcha = 2\nDim Shared As Byte arbol(maxnodos, 3)\n\nSub crear_arbol()\n arbol(1, raiz) = 1\n arbol(1, izda) = 2 : arbol(1, dcha) = 3\n arbol(2, raiz) = 2\n arbol(2, izda) = 4 : arbol(2, dcha) = 5\n arbol(3, raiz) = 3\n arbol(3, izda) = 6 : arbol(3, dcha) = NULL\n arbol(4, raiz) = 4\n arbol(4, izda) = 7 : arbol(4, dcha) = NULL\n arbol(5, raiz) = 5\n arbol(5, izda) = NULL : arbol(5, dcha) = NULL\n arbol(6, raiz) = 6\n arbol(6, izda) = 8 : arbol(6, dcha) = 9\n arbol(7, raiz) = 7\n arbol(7, izda) = NULL : arbol(7, dcha) = NULL\n arbol(8, raiz) = 8\n arbol(8, izda) = NULL : arbol(8, dcha) = NULL\n arbol(9, raiz) = 9\n arbol(9, izda) = NULL : arbol(9, dcha) = NULL\nEnd Sub\n\nSub recorrido_preorder(nodo As Byte)\n If nodo <> NULL Then\n Print arbol(nodo, raiz);\n recorrido_preorder(arbol(nodo, izda))\n recorrido_preorder(arbol(nodo, dcha))\n End If\nEnd Sub\n\nSub recorrido_postorder(nodo As Byte)\n If nodo <> NULL Then\n recorrido_postorder(arbol(nodo, izda))\n recorrido_postorder(arbol(nodo, dcha))\n Print arbol(nodo, raiz);\n End If\nEnd Sub\n\nSub recorrido_inorden(nodo As Byte)\n If nodo <> NULL Then\n recorrido_inorden(arbol(nodo, izda))\n Print arbol(nodo, raiz);\n recorrido_inorden(arbol(nodo, dcha))\n End If\nEnd Sub\n\nSub recorrido_ordenXnivel(nodo As Byte)\n Dim As Byte actual = 1\n Dim As Byte primero_libre = actual + 1\n Dim As Byte cola(maxnodos)\n cola(actual) = nodo\n\n While cola(actual) <> NULL\n If arbol(cola(actual), izda) <> NULL Then\n cola(primero_libre) = arbol(cola(actual), izda)\n primero_libre += 1\n End If\n If arbol(cola(actual), dcha) <> NULL Then\n cola(primero_libre) = arbol(cola(actual), dcha)\n primero_libre += 1\n End If\n Print arbol(cola(actual), raiz);\n actual += 1\n Wend\nEnd Sub\n","language":"FreeBASIC"},{"code":"data Tree = Empty | Node( value, left, right )\n\ndef\n preorder( Empty ) = []\n preorder( Node(v, l, r) ) = [v] + preorder( l ) + preorder( r )\n\n inorder( Empty ) = []\n inorder( Node(v, l, r) ) = inorder( l ) + [v] + inorder( r )\n\n postorder( Empty ) = []\n postorder( Node(v, l, r) ) = postorder( l ) + postorder( r ) + [v]\n\n levelorder( x ) =\n def\n order( [] ) = []\n order( Empty : xs ) = order( xs )\n order( Node(v, l, r) : xs ) = v : order( xs + [l, r] )\n\n order( [x] )\n\ntree = Node( 1,\n Node( 2,\n Node( 4,\n Node( 7, Empty, Empty ),\n Empty ),\n Node( 5, Empty, Empty ) ),\n Node( 3,\n Node( 6,\n Node( 8, Empty, Empty ),\n Node( 9, Empty, Empty ) ),\n Empty ) )\n\nprintln( preorder(tree) )\nprintln( inorder(tree) )\nprintln( postorder(tree) )\nprintln( levelorder(tree) )\n","language":"FunL"},{"code":"maxnodes%=100 ! set a limit to size of tree\ncontent%=0 ! index of content field\nleft%=1 ! index of left tree\nright%=2 ! index of right tree\nDIM tree%(maxnodes%,3) ! create space for tree\n'\nOPENW 1\nCLEARW 1\n'\n@create_tree\nPRINT \"Preorder: \";\n@preorder_traversal(1)\nPRINT \"\"\nPRINT \"Inorder: \";\n@inorder_traversal(1)\nPRINT \"\"\nPRINT \"Postorder: \";\n@postorder_traversal(1)\nPRINT \"\"\nPRINT \"Levelorder: \";\n@levelorder_traversal(1)\nPRINT \"\"\n'\n~INP(2)\nCLOSEW 1\n'\n' Define the example tree\n'\nPROCEDURE create_tree\n tree%(1,content%)=1\n tree%(1,left%)=2\n tree%(1,right%)=3\n tree%(2,content%)=2\n tree%(2,left%)=4\n tree%(2,right%)=5\n tree%(3,content%)=3\n tree%(3,left%)=6\n tree%(3,right%)=0 ! 0 is used for no subtree\n tree%(4,content%)=4\n tree%(4,left%)=7\n tree%(4,right%)=0\n tree%(5,content%)=5\n tree%(5,left%)=0\n tree%(5,right%)=0\n tree%(6,content%)=6\n tree%(6,left%)=8\n tree%(6,right%)=9\n tree%(7,content%)=7\n tree%(7,left%)=0\n tree%(7,right%)=0\n tree%(8,content%)=8\n tree%(8,left%)=0\n tree%(8,right%)=0\n tree%(9,content%)=9\n tree%(9,left%)=0\n tree%(9,right%)=0\nRETURN\n'\n' Preorder traversal from given node\n'\nPROCEDURE preorder_traversal(node%)\n IF node%<>0 ! 0 means there is no node\n PRINT tree%(node%,content%);\n preorder_traversal(tree%(node%,left%))\n preorder_traversal(tree%(node%,right%))\n ENDIF\nRETURN\n'\n' Postorder traversal from given node\n'\nPROCEDURE postorder_traversal(node%)\n IF node%<>0 ! 0 means there is no node\n postorder_traversal(tree%(node%,left%))\n postorder_traversal(tree%(node%,right%))\n PRINT tree%(node%,content%);\n ENDIF\nRETURN\n'\n' Inorder traversal from given node\n'\nPROCEDURE inorder_traversal(node%)\n IF node%<>0 ! 0 means there is no node\n inorder_traversal(tree%(node%,left%))\n PRINT tree%(node%,content%);\n inorder_traversal(tree%(node%,right%))\n ENDIF\nRETURN\n'\n' Level order traversal from given node\n'\nPROCEDURE levelorder_traversal(node%)\n LOCAL nodes%,first_free%,current%\n '\n ' Set up initial queue of nodes\n '\n DIM nodes%(maxnodes%) ! some working space to store queue of nodes\n current%=1\n nodes%(current%)=node%\n first_free%=current%+1\n '\n WHILE nodes%(current%)<>0\n ' add the children of current node onto queue\n IF tree%(nodes%(current%),left%)<>0\n nodes%(first_free%)=tree%(nodes%(current%),left%)\n first_free%=first_free%+1\n ENDIF\n IF tree%(nodes%(current%),right%)<>0\n nodes%(first_free%)=tree%(nodes%(current%),right%)\n first_free%=first_free%+1\n ENDIF\n ' print the current node content\n PRINT tree%(nodes%(current%),content%);\n ' advance to next node\n current%=current%+1\n WEND\nRETURN\n","language":"GFA-Basic"},{"code":"package main\n\nimport \"fmt\"\n\ntype node struct {\n value int\n left, right *node\n}\n\nfunc (n *node) iterPreorder(visit func(int)) {\n if n == nil {\n return\n }\n visit(n.value)\n n.left.iterPreorder(visit)\n n.right.iterPreorder(visit)\n}\n\nfunc (n *node) iterInorder(visit func(int)) {\n if n == nil {\n return\n }\n n.left.iterInorder(visit)\n visit(n.value)\n n.right.iterInorder(visit)\n}\n\nfunc (n *node) iterPostorder(visit func(int)) {\n if n == nil {\n return\n }\n n.left.iterPostorder(visit)\n n.right.iterPostorder(visit)\n visit(n.value)\n}\n\nfunc (n *node) iterLevelorder(visit func(int)) {\n if n == nil {\n return\n }\n for queue := []*node{n}; ; {\n n = queue[0]\n visit(n.value)\n copy(queue, queue[1:])\n queue = queue[:len(queue)-1]\n if n.left != nil {\n queue = append(queue, n.left)\n }\n if n.right != nil {\n queue = append(queue, n.right)\n }\n if len(queue) == 0 {\n return\n }\n }\n}\n\nfunc main() {\n tree := &node{1,\n &node{2,\n &node{4,\n &node{7, nil, nil},\n nil},\n &node{5, nil, nil}},\n &node{3,\n &node{6,\n &node{8, nil, nil},\n &node{9, nil, nil}},\n nil}}\n fmt.Print(\"preorder: \")\n tree.iterPreorder(visitor)\n fmt.Println()\n fmt.Print(\"inorder: \")\n tree.iterInorder(visitor)\n fmt.Println()\n fmt.Print(\"postorder: \")\n tree.iterPostorder(visitor)\n fmt.Println()\n fmt.Print(\"level-order: \")\n tree.iterLevelorder(visitor)\n fmt.Println()\n}\n\nfunc visitor(value int) {\n fmt.Print(value, \" \")\n}\n","language":"Go"},{"code":"package main\n\nimport \"fmt\"\n\n// flat, level-order representation.\n// for node at index k, left child has index 2k, right child has index 2k+1.\n// a value of -1 means the node does not exist.\ntype tree []int\n\nfunc main() {\n t := tree{1, 2, 3, 4, 5, 6, -1, 7, -1, -1, -1, 8, 9}\n visitor := func(n int) {\n fmt.Print(n, \" \")\n }\n fmt.Print(\"preorder: \")\n t.iterPreorder(visitor)\n fmt.Print(\"\\ninorder: \")\n t.iterInorder(visitor)\n fmt.Print(\"\\npostorder: \")\n t.iterPostorder(visitor)\n fmt.Print(\"\\nlevel-order: \")\n t.iterLevelorder(visitor)\n fmt.Println()\n}\n\nfunc (t tree) iterPreorder(visit func(int)) {\n var traverse func(int)\n traverse = func(k int) {\n if k >= len(t) || t[k] == -1 {\n return\n }\n visit(t[k])\n traverse(2*k + 1)\n traverse(2*k + 2)\n }\n traverse(0)\n}\n\nfunc (t tree) iterInorder(visit func(int)) {\n var traverse func(int)\n traverse = func(k int) {\n if k >= len(t) || t[k] == -1 {\n return\n }\n traverse(2*k + 1)\n visit(t[k])\n traverse(2*k + 2)\n }\n traverse(0)\n}\n\nfunc (t tree) iterPostorder(visit func(int)) {\n var traverse func(int)\n traverse = func(k int) {\n if k >= len(t) || t[k] == -1 {\n return\n }\n traverse(2*k + 1)\n traverse(2*k + 2)\n visit(t[k])\n }\n traverse(0)\n}\n\nfunc (t tree) iterLevelorder(visit func(int)) {\n for _, n := range t {\n if n != -1 {\n visit(n)\n }\n }\n}\n","language":"Go"},{"code":"def preorder;\npreorder = { Node node ->\n ([node] + node.children().collect { preorder(it) }).flatten()\n}\n\ndef postorder;\npostorder = { Node node ->\n (node.children().collect { postorder(it) } + [node]).flatten()\n}\n\ndef inorder;\ninorder = { Node node ->\n def kids = node.children()\n if (kids.empty) [node]\n else if (kids.size() == 1 && kids[0].'@right') [node] + inorder(kids[0])\n else inorder(kids[0]) + [node] + (kids.size()>1 ? inorder(kids[1]) : [])\n}\n\ndef levelorder = { Node node ->\n def nodeList = []\n def level = [node]\n while (!level.empty) {\n nodeList += level\n def nextLevel = level.collect { it.children() }.flatten()\n level = nextLevel\n }\n nodeList\n}\n\nclass BinaryNodeBuilder extends NodeBuilder {\n protected Object postNodeCompletion(Object parent, Object node) {\n assert node.children().size() < 3\n node\n }\n}\n","language":"Groovy"},{"code":"try {\n new BinaryNodeBuilder().'1' {\n a {}\n b {}\n c {}\n }\n println 'not limited to binary tree\\r\\n'\n} catch (org.codehaus.groovy.transform.powerassert.PowerAssertionError e) {\n println 'limited to binary tree\\r\\n'\n}\n","language":"Groovy"},{"code":"// 1\n// / \\\n// 2 3\n// / \\ /\n// 4 5 6\n// / / \\\n// 7 8 9\ndef tree1 = new BinaryNodeBuilder().\n'1' {\n '2' {\n '4' { '7' {} }\n '5' {}\n }\n '3' {\n '6' { '8' {}; '9' {} }\n }\n}\n","language":"Groovy"},{"code":"// 1\n// / \\\n// 2 3\n// / \\ /\n// 4 5 6\n// \\ / \\\n// 7 8 9\ndef tree2 = new BinaryNodeBuilder().\n'1' {\n '2' {\n '4' { '7'(right:true) {} }\n '5' {}\n }\n '3' {\n '6' { '8' {}; '9' {} }\n }\n}\n","language":"Groovy"},{"code":"def test = { tree ->\n println \"preorder: ${preorder(tree).collect{it.name()}}\"\n println \"preorder: ${tree.depthFirst().collect{it.name()}}\"\n\n println \"postorder: ${postorder(tree).collect{it.name()}}\"\n\n println \"inorder: ${inorder(tree).collect{it.name()}}\"\n\n println \"level-order: ${levelorder(tree).collect{it.name()}}\"\n println \"level-order: ${tree.breadthFirst().collect{it.name()}}\"\n\n println()\n}\ntest(tree1)\ntest(tree2)\n","language":"Groovy"},{"code":"---------------------- TREE TRAVERSAL --------------------\n\ndata Tree a\n = Empty\n | Node\n { value :: a,\n left :: Tree a,\n right :: Tree a\n }\n\npreorder, inorder, postorder, levelorder :: Tree a -> [a]\npreorder Empty = []\npreorder (Node v l r) = v : preorder l <> preorder r\n\ninorder Empty = []\ninorder (Node v l r) = inorder l <> (v : inorder r)\n\npostorder Empty = []\npostorder (Node v l r) = postorder l <> postorder r <> [v]\n\nlevelorder x = loop [x]\n where\n loop [] = []\n loop (Empty : xs) = loop xs\n loop (Node v l r : xs) = v : loop (xs <> [l, r])\n\n--------------------------- TEST -------------------------\ntree :: Tree Int\ntree =\n Node\n 1\n ( Node\n 2\n (Node 4 (Node 7 Empty Empty) Empty)\n (Node 5 Empty Empty)\n )\n ( Node\n 3\n (Node 6 (Node 8 Empty Empty) (Node 9 Empty Empty))\n Empty\n )\n\nasciiTree :: String\nasciiTree =\n unlines\n [ \" 1\",\n \" / \\\\\",\n \" / \\\\\",\n \" / \\\\\",\n \" 2 3\",\n \" / \\\\ /\",\n \" 4 5 6\",\n \" / / \\\\\",\n \" 7 8 9\"\n ]\n\n-------------------------- OUTPUT ------------------------\nmain :: IO ()\nmain = do\n putStrLn asciiTree\n mapM_ putStrLn $\n zipWith\n ( \\s xs ->\n justifyLeft 14 ' ' (s <> \":\")\n <> unwords (show <$> xs)\n )\n [\"preorder\", \"inorder\", \"postorder\", \"level-order\"]\n ([preorder, inorder, postorder, levelorder] <*> [tree])\n where\n justifyLeft n c s = take n (s <> replicate n c)\n","language":"Haskell"},{"code":"import Data.Bool (bool)\nimport Data.Tree (Tree (..), drawForest, drawTree, foldTree)\n\n---------------------- TREE TRAVERSAL --------------------\n\ninorder, postorder, preorder :: a -> [[a]] -> [a]\ninorder x [] = [x]\ninorder x (y : xs) = y <> [x] <> concat xs\n\npostorder x xs = concat xs <> [x]\n\npreorder x xs = x : concat xs\n\nlevelOrder :: Tree a -> [a]\nlevelOrder = concat . levels\n\nlevels :: Tree a -> [[a]]\nlevels tree = go tree []\n where\n go (Node x xs) a =\n let (h, t) = case a of\n [] -> ([], [])\n (y : ys) -> (y, ys)\n in (x : h) : foldr go t xs\n\nnodeCount,\n treeDepth,\n treeMax,\n treeMin,\n treeProduct,\n treeSum,\n treeWidth ::\n Int -> [Int] -> Int\nnodeCount = const (succ . sum)\ntreeDepth = const (succ . foldr max 1)\ntreeMax x xs = maximum (x : xs)\ntreeMin x xs = minimum (x : xs)\ntreeProduct x xs = x * product xs\ntreeSum x xs = x + sum xs\ntreeWidth _ [] = 1\ntreeWidth _ xs = sum xs\n\ntreeLeaves :: Tree a -> [a]\ntreeLeaves = foldTree go\n where\n go x [] = [x]\n go _ xs = concat xs\n\n--------------------------- TEST -------------------------\ntree :: Tree Int\ntree =\n Node\n 1\n [ Node 2 [Node 4 [Node 7 []], Node 5 []],\n Node 3 [Node 6 [Node 8 [], Node 9 []]]\n ]\n\nmain :: IO ()\nmain = do\n putStrLn $ drawTree $ fmap show tree\n mapM_\n print\n ( [foldTree]\n <*> [preorder, inorder, postorder]\n <*> [tree]\n )\n print $ levelOrder tree\n putStrLn \"\"\n\n (putStrLn . unlines)\n ( ( \\(k, f) ->\n justifyRight 7 ' ' k\n <> \" -> \"\n <> justifyLeft 6 ' ' (show $ foldTree f tree)\n )\n <$> [ (\"Count\", nodeCount),\n (\"Layers\", treeDepth),\n (\"Max\", treeMax),\n (\"Min\", treeMin),\n (\"Product\", treeProduct),\n (\"Sum\", treeSum),\n (\"Leaves\", treeWidth)\n ]\n )\n\njustifyLeft, justifyRight :: Int -> Char -> String -> String\njustifyLeft n c s = take n (s <> replicate n c)\njustifyRight n c = (drop . length) <*> (replicate n c <>)\n","language":"Haskell"},{"code":"procedure main()\n bTree := [1, [2, [4, [7]], [5]], [3, [6, [8], [9]]]]\n showTree(bTree, preorder|inorder|postorder|levelorder)\nend\n\nprocedure showTree(tree, f)\n writes(image(f),\":\\t\")\n every writes(\" \",f(tree)[1])\n write()\nend\n\nprocedure preorder(L)\n if \\L then suspend L | preorder(L[2|3])\nend\n\nprocedure inorder(L)\n if \\L then suspend inorder(L[2]) | L | inorder(L[3])\nend\n\nprocedure postorder(L)\n if \\L then suspend postorder(L[2|3]) | L\nend\n\nprocedure levelorder(L)\n if \\L then {\n queue := [L]\n while nextnode := get(queue) do {\n every put(queue, \\nextnode[2|3])\n suspend nextnode\n }\n }\nend\n","language":"Icon"},{"code":"theory Tree\nimports Main\nbegin\n\ndatatype 'a tree = Leaf | Node \"'a tree\" 'a \"'a tree\"\n\ndefinition example :: \"int tree\" where\n \"example =\n Node\n (Node\n (Node\n (Node Leaf 7 Leaf)\n 4\n Leaf\n )\n 2\n (Node Leaf 5 Leaf)\n )\n 1\n (Node\n (Node\n (Node Leaf 8 Leaf)\n 6\n (Node Leaf 9 Leaf)\n )\n 3\n Leaf\n )\"\n\nfun preorder :: \"'a tree ? 'a list\" where\n \"preorder Leaf = []\"\n| \"preorder (Node l a r) = a # preorder l @ preorder r\"\n\nlemma \"preorder example = [1, 2, 4, 7, 5, 3, 6, 8, 9]\" by code_simp\n\nfun inorder :: \"'a tree ? 'a list\" where\n \"inorder Leaf = []\"\n| \"inorder (Node l a r) = inorder l @ [a] @ inorder r\"\n\nlemma \"inorder example = [7, 4, 2, 5, 1, 8, 6, 9, 3]\" by code_simp\n\nfun postorder :: \"'a tree ? 'a list\" where\n \"postorder Leaf = []\"\n| \"postorder (Node l a r) = postorder l @ postorder r @ [a]\"\n\nlemma \"postorder example = [7, 4, 5, 2, 8, 9, 6, 3, 1]\" by code_simp\n\nlemma\n \"set (inorder t) = set (preorder t)\"\n \"set (preorder t) = set (postorder t)\"\n \"set (inorder t) = set (postorder t)\"\n by(induction t, simp, simp)+\n\ntext‹\nFor a breadth first search, we will have a queue of the nodes we still\nwant to visit. The type of the queue is \\<^typ>‹'a tree list›.\nWith each step, summing the sizes of the subtrees in the queue,\nthe queue gets smaller. Thus, the breadth first search terminates.\nIsabelle cannot figure out this termination argument automatically,\nso we provide some help by defining what the size of a tree is.\n›\nfun tree_size :: \"'a tree ? nat\" where\n \"tree_size Leaf = 1\"\n| \"tree_size (Node l _ r) = 1 + tree_size l + tree_size r\"\n\nfunction (sequential) bfs :: \"'a tree list ? 'a list\" where\n \"bfs [] = []\"\n| \"bfs (Leaf#q) = bfs q\"\n| \"bfs ((Node l a r)#q) = a # bfs (q @ [l,r])\"\n by pat_completeness auto\ntermination bfs\n by(relation \"measure (?qs. sum_list (map tree_size qs))\") simp+\n\nfun levelorder :: \"'a tree ? 'a list\" where\n \"levelorder t = bfs [t]\"\n\nlemma \"levelorder example = [1, 2, 3, 4, 5, 6, 7, 8, 9]\" by code_simp\n\nend\n","language":"Isabelle"},{"code":"preorder=: ]S:0\npostorder=: ([:; postorder&.>@}.) , >@{.\nlevelorder=: ;@({::L:1 _~ [: (/: #@>) <S:1@{::)\ninorder=: ([:; inorder&.>@(''\"_`(1&{)@.(1<#))) , >@{. , [:; inorder&.>@}.@}.\n","language":"J"},{"code":"dataorder=: /:@data reorder ]\nlevelorder=: /:@depth@parent reorder ]\n\ninorder=: inperm@parent reorder ]\ninperm=:3 :0\n chil=. childinds y\n node=. {.I.(= i.@#) y\n todo=. i.0 2\n r=. i.0\n whilst. (#todo)+.0<:node do.\n if. 0 <: node do.\n if. 0 <: {.ch=. node{chil do.\n todo=. todo, node,{:ch\n node=. {.ch\n else.\n r=. r, node\n node=. _1 end.\n else.\n r=. r, {.ch=. {: todo\n todo=. }: todo\n node=. {:ch end. end.\n r\n)\n\npostorder=: postperm@parent reorder ]\npostperm=:3 :0\n chil=. 0,1+childinds y\n todo=. 1+I.(= i.@#) y\n r=. i.0\n whilst. (#todo) do.\n node=. {: todo\n todo=. }: todo\n if. 0 < node do.\n if. #ch=. (node{chil)-.0 do.\n todo=. todo,(-node),|.ch\n else.\n r=. r, <:node end.\n else.\n r=. r, <:|node end. end.\n)\n\npreorder=: preperm@parent reorder ]\npreperm=:3 :0\n chil=. childinds y\n todo=. I.(= i.@#) y\n r=. i.0\n whilst. (#todo) do.\n r=. r,node=. {: todo\n todo=. }: todo\n if. #ch=. (node{chil)-._1 do.\n todo=. todo,|.ch end. end.\n r\n)\n","language":"J"},{"code":" levelorder dataorder example\n1 2 3 4 5 6 7 8 9\n0 0 0 1 1 2 3 5 5\n inorder dataorder example\n7 4 2 5 1 8 6 9 3\n1 2 4 2 4 6 8 6 4\n preorder dataorder example\n1 2 4 7 5 3 6 8 9\n0 0 1 2 1 0 5 6 6\n postorder dataorder example\n7 4 5 2 8 9 6 3 1\n1 3 3 8 6 6 7 8 8\n","language":"J"},{"code":"N2=: conjunction def '(<m),(<n),<y'\nN1=: adverb def '(<m),<y'\nL=: adverb def '<m'\n\ntree=: 1 N2 (2 N2 (4 N1 (7 L)) 5 L) 3 N1 6 N2 (8 L) 9 L\n","language":"J"},{"code":" preorder tree\n1 2 4 7 5 3 6 8 9\n","language":"J"},{"code":" postorder tree\n7 4 5 2 8 9 6 3 1\n","language":"J"},{"code":" inorder tree\n7 4 2 5 1 8 6 9 3\n","language":"J"},{"code":" levelorder tree\n1 2 3 4 5 6 7 8 9\n","language":"J"},{"code":" tree=: 1 N2 (2 N2 (4 N1 (7 L)) (5 L)) (3 N1 (6 N2 (8 L) (9 L)))\n","language":"J"},{"code":"example=:1 8 3 4 7 5 9 6 2,: 0 7 0 8 3 8 7 2 0\n","language":"J"},{"code":"depth=: +/@((~: , (~: i.@#@{.)~) {:@,)@({~^:a:)\n\nreorder=:4 :0\n 'data parent'=. y\n data1=. x{data\n parent1=. x{data1 i. parent{data\n if. 0=L.y do. data1,:parent1 else. data1;parent1 end.\n)\n\ndata=:3 :'data[''data parent''=. y'\nparent=:3 :'parent[''data parent''=. y'\n\nchildinds=: [: <:@(2&{.@-.&> #\\) (</. #\\)`(]~.)`(a:\"0)}~\n","language":"J"},{"code":"import java.util.*;\n\npublic class TreeTraversal {\n\n static class Node<T> {\n\t\tT value;\n\t\tNode<T> left;\n\t\tNode<T> right;\n\n\t\tNode(T value) {\n\t\t\tthis.value = value;\n\t\t}\n\n\t\tvoid visit() {\n\t\t\tSystem.out.print(this.value + \" \");\n\t\t}\n\t}\n\n\tstatic enum ORDER {\n\t\tPREORDER, INORDER, POSTORDER, LEVEL\n\t}\n\n static <T> void traverse(Node<T> node, ORDER order) {\n\t\tif (node == null) {\n\t\t\treturn;\n\t\t}\n\t\tswitch (order) {\n\t\tcase PREORDER:\n\t\t\tnode.visit();\n\t\t\ttraverse(node.left, order);\n\t\t\ttraverse(node.right, order);\n\t\t\tbreak;\n\t\tcase INORDER:\n\t\t\ttraverse(node.left, order);\n\t\t\tnode.visit();\n\t\t\ttraverse(node.right, order);\n\t\t\tbreak;\n\t\tcase POSTORDER:\n\t\t\ttraverse(node.left, order);\n\t\t\ttraverse(node.right, order);\n\t\t\tnode.visit();\n\t\t\tbreak;\n\t\tcase LEVEL:\n\t\t\tQueue<Node<T>> queue = new LinkedList<>();\n\t\t\tqueue.add(node);\n\t\t\twhile(!queue.isEmpty()){\n\t\t\t\tNode<T> next = queue.remove();\n\t\t\t\tnext.visit();\n\t\t\t\tif(next.left!=null)\n\t\t\t\t\tqueue.add(next.left);\n\t\t\t\tif(next.right!=null)\n\t\t\t\t\tqueue.add(next.right);\n\t\t\t}\n\t\t}\n\t}\t\n\n\tpublic static void main(String[] args) {\n\n\t\tNode<Integer> one = new Node<Integer>(1);\n\t\tNode<Integer> two = new Node<Integer>(2);\n\t\tNode<Integer> three = new Node<Integer>(3);\n\t\tNode<Integer> four = new Node<Integer>(4);\n\t\tNode<Integer> five = new Node<Integer>(5);\n\t\tNode<Integer> six = new Node<Integer>(6);\n\t\tNode<Integer> seven = new Node<Integer>(7);\n\t\tNode<Integer> eight = new Node<Integer>(8);\n\t\tNode<Integer> nine = new Node<Integer>(9);\n\t\t\n\t\tone.left = two;\n\t\tone.right = three;\n\t\ttwo.left = four;\n\t\ttwo.right = five;\n\t\tthree.left = six;\n\t\tfour.left = seven;\n\t\tsix.left = eight;\n\t\tsix.right = nine;\n\n\t\ttraverse(one, ORDER.PREORDER);\n\t\tSystem.out.println();\n\t\ttraverse(one, ORDER.INORDER);\n\t\tSystem.out.println();\n\t\ttraverse(one, ORDER.POSTORDER);\n\t\tSystem.out.println();\n\t\ttraverse(one, ORDER.LEVEL);\n\t\t\n\t}\n}\n","language":"Java"},{"code":"import java.util.function.Consumer;\nimport java.util.Queue;\nimport java.util.LinkedList;\n\nclass TreeTraversal {\n static class EmptyNode {\n void accept(Visitor aVisitor) {}\n\n void accept(LevelOrder aVisitor, Queue<EmptyNode> data) {}\n }\n\n static class Node<T> extends EmptyNode {\n T data;\n EmptyNode left = new EmptyNode();\n EmptyNode right = new EmptyNode();\n\n Node(T data) {\n this.data = data;\n }\n\n Node<T> left(Node<?> aNode) {\n this.left = aNode;\n return this;\n }\n\n Node<T> right(Node<?> aNode) {\n this.right = aNode;\n return this;\n }\n\n void accept(Visitor aVisitor) {\n aVisitor.visit(this);\n }\n\n void accept(LevelOrder aVisitor, Queue<EmptyNode> data) {\n aVisitor.visit(this, data);\n }\n }\n\n static abstract class Visitor {\n Consumer<Node<?>> action;\n\n Visitor(Consumer<Node<?>> action) {\n this.action = action;\n }\n\n abstract <T> void visit(Node<T> aNode);\n }\n\n static class PreOrder extends Visitor {\n PreOrder(Consumer<Node<?>> action) {\n super(action);\n }\n\n <T> void visit(Node<T> aNode) {\n action.accept(aNode);\n aNode.left.accept(this);\n aNode.right.accept(this);\n }\n }\n\n static class InOrder extends Visitor {\n InOrder(Consumer<Node<?>> action) {\n super(action);\n }\n\n <T> void visit(Node<T> aNode) {\n aNode.left.accept(this);\n action.accept(aNode);\n aNode.right.accept(this);\n }\n }\n\n static class PostOrder extends Visitor {\n PostOrder(Consumer<Node<?>> action) {\n super(action);\n }\n\n <T> void visit(Node<T> aNode) {\n aNode.left.accept(this);\n aNode.right.accept(this);\n action.accept(aNode);\n }\n }\n\n static class LevelOrder extends Visitor {\n LevelOrder(Consumer<Node<?>> action) {\n super(action);\n }\n\n <T> void visit(Node<T> aNode) {\n Queue<EmptyNode> queue = new LinkedList<>();\n queue.add(aNode);\n do {\n queue.remove().accept(this, queue);\n } while (!queue.isEmpty());\n }\n\n <T> void visit(Node<T> aNode, Queue<EmptyNode> queue) {\n action.accept(aNode);\n queue.add(aNode.left);\n queue.add(aNode.right);\n }\n }\n\n public static void main(String[] args) {\n Node<Integer> tree = new Node<Integer>(1)\n .left(new Node<Integer>(2)\n .left(new Node<Integer>(4)\n .left(new Node<Integer>(7)))\n .right(new Node<Integer>(5)))\n .right(new Node<Integer>(3)\n .left(new Node<Integer>(6)\n .left(new Node<Integer>(8))\n .right(new Node<Integer>(9))));\n Consumer<Node<?>> print = aNode -> System.out.print(aNode.data + \" \");\n tree.accept(new PreOrder(print));\n System.out.println();\n tree.accept(new InOrder(print));\n System.out.println();\n tree.accept(new PostOrder(print));\n System.out.println();\n tree.accept(new LevelOrder(print));\n System.out.println();\n }\n}\n","language":"Java"},{"code":"function BinaryTree(value, left, right) {\n this.value = value;\n this.left = left;\n this.right = right;\n}\nBinaryTree.prototype.preorder = function(f) {this.walk(f,['this','left','right'])}\nBinaryTree.prototype.inorder = function(f) {this.walk(f,['left','this','right'])}\nBinaryTree.prototype.postorder = function(f) {this.walk(f,['left','right','this'])}\nBinaryTree.prototype.walk = function(func, order) {\n for (var i in order)\n switch (order[i]) {\n case \"this\": func(this.value); break;\n case \"left\": if (this.left) this.left.walk(func, order); break;\n case \"right\": if (this.right) this.right.walk(func, order); break;\n }\n}\nBinaryTree.prototype.levelorder = function(func) {\n var queue = [this];\n while (queue.length != 0) {\n var node = queue.shift();\n func(node.value);\n if (node.left) queue.push(node.left);\n if (node.right) queue.push(node.right);\n }\n}\n\n// convenience function for creating a binary tree\nfunction createBinaryTreeFromArray(ary) {\n var left = null, right = null;\n if (ary[1]) left = createBinaryTreeFromArray(ary[1]);\n if (ary[2]) right = createBinaryTreeFromArray(ary[2]);\n return new BinaryTree(ary[0], left, right);\n}\n\nvar tree = createBinaryTreeFromArray([1, [2, [4, [7]], [5]], [3, [6, [8],[9]]]]);\n\nprint(\"*** preorder ***\"); tree.preorder(print);\nprint(\"*** inorder ***\"); tree.inorder(print);\nprint(\"*** postorder ***\"); tree.postorder(print);\nprint(\"*** levelorder ***\"); tree.levelorder(print);\n","language":"JavaScript"},{"code":"(function () {\n\n function preorder(n) {\n return [n[v]].concat(\n n[l] ? preorder(n[l]) : []\n ).concat(\n n[r] ? preorder(n[r]) : []\n );\n }\n\n function inorder(n) {\n return (\n n[l] ? inorder(n[l]) : []\n ).concat(\n n[v]\n ).concat(\n n[r] ? inorder(n[r]) : []\n );\n }\n\n function postorder(n) {\n return (\n n[l] ? postorder(n[l]) : []\n ).concat(\n n[r] ? postorder(n[r]) : []\n ).concat(\n n[v]\n );\n }\n\n function levelorder(n) {\n return (function loop(x) {\n return x.length ? (\n x[0] ? (\n [x[0][v]].concat(\n loop(\n x.slice(1).concat(\n [x[0][l], x[0][r]]\n )\n )\n )\n ) : loop(x.slice(1))\n ) : [];\n })([n]);\n }\n\n var v = 0,\n l = 1,\n r = 2,\n\n tree = [1,\n [2,\n [4,\n [7]\n ],\n [5]\n ],\n [3,\n [6,\n [8],\n [9]\n ]\n ]\n ],\n\n lstTest = [[\"Traversal\", \"Nodes visited\"]].concat(\n [preorder, inorder, postorder, levelorder].map(\n function (f) {\n return [f.name, f(tree)];\n }\n )\n );\n\n // [[a]] -> bool -> s -> s\n function wikiTable(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(lstTest, true) + '\\n\\n' + JSON.stringify(lstTest);\n\n})();\n","language":"JavaScript"},{"code":"[[\"Traversal\",\"Nodes visited\"],\n[\"preorder\",[1,2,4,7,5,3,6,8,9]],[\"inorder\",[7,4,2,5,1,8,6,9,3]],\n[\"postorder\",[7,4,5,2,8,9,6,3,1]],[\"levelorder\",[1,2,3,4,5,6,7,8,9]]]\n","language":"JavaScript"},{"code":"(function () {\n 'use strict';\n\n // 'preorder' | 'inorder' | 'postorder' | 'level-order'\n\n // traverse :: String -> Tree {value: a, nest: [Tree]} -> [a]\n function traverse(strOrderName, dctTree) {\n var strName = strOrderName.toLowerCase();\n\n if (strName.startsWith('level')) {\n\n // LEVEL-ORDER\n return levelOrder([dctTree]);\n\n } else if (strName.startsWith('in')) {\n var lstNest = dctTree.nest;\n\n if ((lstNest ? lstNest.length : 0) < 3) {\n var left = lstNest[0] || [],\n right = lstNest[1] || [],\n\n lstLeft = left.nest ? (\n traverse(strName, left)\n ) : (left.value || []),\n lstRight = right.nest ? (\n traverse(strName, right)\n ) : (right.value || []);\n\n return (lstLeft !== undefined && lstRight !== undefined) ?\n\n // IN-ORDER\n (lstLeft instanceof Array ? lstLeft : [lstLeft])\n .concat(dctTree.value)\n .concat(lstRight) : undefined;\n\n } else { // in-order only defined here for binary trees\n return undefined;\n }\n\n } else {\n var lstTraversed = concatMap(function (x) {\n return traverse(strName, x);\n }, (dctTree.nest || []));\n\n return (\n strName.startsWith('pre') ? (\n\n // PRE-ORDER\n [dctTree.value].concat(lstTraversed)\n\n ) : strName.startsWith('post') ? (\n\n // POST-ORDER\n lstTraversed.concat(dctTree.value)\n\n ) : []\n );\n }\n }\n\n // levelOrder :: [Tree {value: a, nest: [Tree]}] -> [a]\n function levelOrder(lstTree) {\n var lngTree = lstTree.length,\n head = lngTree ? lstTree[0] : undefined,\n tail = lstTree.slice(1);\n\n // Recursively take any value found in the head node\n // of the remaining tail, deferring any child nodes\n // of that head to the end of the tail\n return lngTree ? (\n head ? (\n [head.value].concat(\n levelOrder(\n tail\n .concat(head.nest || [])\n )\n )\n ) : levelOrder(tail)\n ) : [];\n }\n\n // concatMap :: (a -> [b]) -> [a] -> [b]\n function concatMap(f, xs) {\n return [].concat.apply([], xs.map(f));\n }\n\n var dctTree = {\n value: 1,\n nest: [{\n value: 2,\n nest: [{\n value: 4,\n nest: [{\n value: 7\n }]\n }, {\n value: 5\n }]\n }, {\n value: 3,\n nest: [{\n value: 6,\n nest: [{\n value: 8\n }, {\n value: 9\n }]\n }]\n }]\n };\n\n\n return ['preorder', 'inorder', 'postorder', 'level-order']\n .reduce(function (a, k) {\n return (\n a[k] = traverse(k, dctTree),\n a\n );\n }, {});\n\n})();\n","language":"JavaScript"},{"code":"{\"preorder\":[1, 2, 4, 7, 5, 3, 6, 8, 9],\n\"inorder\":[7, 4, 2, 5, 1, 8, 6, 9, 3],\n\"postorder\":[7, 4, 5, 2, 8, 9, 6, 3, 1],\n\"level-order\":[1, 2, 3, 4, 5, 6, 7, 8, 9]}\n","language":"JavaScript"},{"code":"(() => {\n \"use strict\";\n\n // preorder :: a -> [[a]] -> [a]\n const preorder = x =>\n xs => [x, ...xs.flat()];\n\n\n // inorder :: a -> [[a]] -> [a]\n const inorder = x =>\n xs => Boolean(xs.length) ? (\n [...xs[0], x, ...xs.slice(1).flat()]\n ) : [x];\n\n\n // postorder :: a -> [[a]] -> [a]\n const postorder = x =>\n xs => [...xs.flat(), x];\n\n\n // levelOrder :: Tree a -> [a]\n const levelOrder = tree =>\n levels(tree).flat();\n\n\n // ------------------------TEST------------------------\n // main :: IO ()\n const main = () => {\n const tree = Node(1)([\n Node(2)([\n Node(4)([\n Node(7)([])\n ]),\n Node(5)([])\n ]),\n Node(3)([\n Node(6)([\n Node(8)([]),\n Node(9)([])\n ])\n ])\n ]);\n\n // Generated by code in Rosetta Code\n // task: 'Visualize a tree'\n console.log([\n \" + 4 - 7\",\n \" + 2 ¦\",\n \" ¦ + 5\",\n \" 1 ¦\",\n \" ¦ + 8\",\n \" + 3 - 6 ¦\",\n \" + 9\"\n ].join(\"\\n\"));\n\n [preorder, inorder, postorder]\n .forEach(f => console.log(\n justifyRight(11)(\" \")(`${f.name}:`),\n foldTree(f)(\n tree\n )\n ));\n\n console.log(\n `levelOrder: ${levelOrder(tree)}`\n );\n };\n\n // ---------------------- TREES ----------------------\n\n // Node :: a -> [Tree a] -> Tree a\n const Node = v =>\n // Constructor for a Tree node which connects a\n // value of some kind to a list of zero or\n // more child trees.\n xs => ({\n type: \"Node\",\n root: v,\n nest: xs || []\n });\n\n\n // foldTree :: (a -> [b] -> b) -> Tree a -> b\n const foldTree = f => {\n // The catamorphism on trees. A summary\n // value obtained by a depth-first fold.\n const go = tree => f(\n tree.root\n )(\n tree.nest.map(go)\n );\n\n return go;\n };\n\n\n // levels :: Tree a -> [[a]]\n const levels = tree => {\n // A list of lists, grouping the root\n // values of each level of the tree.\n const go = (a, node) => {\n const [h, ...t] = 0 < a.length ? a : [\n []\n ];\n\n return [\n [node.root, ...h],\n ...node.nest.reduceRight(go, t)\n ];\n };\n\n return go([], tree);\n };\n\n\n // --------------------- GENERIC ---------------------\n\n // justifyRight :: Int -> Char -> String -> String\n const justifyRight = n =>\n // The string s, preceded by enough padding (with\n // the character c) to reach the string length n.\n c => s => Boolean(s) ? (\n s.padStart(n, c)\n ) : \"\";\n\n // MAIN ---\n return main();\n})();\n","language":"JavaScript"},{"code":"def preorder:\n if length == 0 then empty\n else .[0], (.[1]|preorder), (.[2]|preorder)\n end;\n\ndef inorder:\n if length == 0 then empty\n else (.[1]|inorder), .[0] , (.[2]|inorder)\n end;\n\ndef postorder:\n if length == 0 then empty\n else (.[1] | postorder), (.[2]|postorder), .[0]\n end;\n\n# Helper functions for levelorder:\n # Produce a stream of the first elements\n def heads: map( .[0] | select(. != null)) | .[];\n\n# Produce a stream of the left/right branches:\n def tails:\n if length == 0 then empty\n else [map ( .[1], .[2] ) | .[] | select( . != null)]\n end;\n\ndef levelorder: [.] | recurse( tails ) | heads;\n","language":"Jq"},{"code":"def task:\n # [node, left, right]\n def atree: [1, [2, [4, [7,[],[]],\n []],\n [5, [],[]]],\n\n [3, [6, [8,[],[]],\n [9,[],[]]],\n []]] ;\n\n \"preorder: \\( [atree|preorder ])\",\n \"inorder: \\( [atree|inorder ])\",\n \"postorder: \\( [atree|postorder ])\",\n \"levelorder: \\( [atree|levelorder])\"\n;\n\ntask\n","language":"Jq"},{"code":"tree = Any[1, Any[2, Any[4, Any[7, Any[],\n Any[]],\n Any[]],\n Any[5, Any[],\n Any[]]],\n Any[3, Any[6, Any[8, Any[],\n Any[]],\n Any[9, Any[],\n Any[]]],\n Any[]]]\n\npreorder(t, f) = if !isempty(t)\n f(t[1]); preorder(t[2], f); preorder(t[3], f)\n end\n\ninorder(t, f) = if !isempty(t)\n inorder(t[2], f); f(t[1]); inorder(t[3], f)\n end\n\npostorder(t, f) = if !isempty(t)\n postorder(t[2], f); postorder(t[3], f); f(t[1])\n end\n\nlevelorder(t, f) = while !isempty(t)\n t = mapreduce(x -> isa(x, Number) ? (f(x); []) : x, vcat, t)\n end\n","language":"Julia"},{"code":"data class Node(val v: Int, var left: Node? = null, var right: Node? = null) {\n override fun toString() = \"$v\"\n}\n\nfun preOrder(n: Node?) {\n n?.let {\n print(\"$n \")\n preOrder(n.left)\n preOrder(n.right)\n }\n}\n\nfun inorder(n: Node?) {\n n?.let {\n inorder(n.left)\n print(\"$n \")\n inorder(n.right)\n }\n}\n\nfun postOrder(n: Node?) {\n n?.let {\n postOrder(n.left)\n postOrder(n.right)\n print(\"$n \")\n }\n}\n\nfun levelOrder(n: Node?) {\n n?.let {\n val queue = mutableListOf(n)\n while (queue.isNotEmpty()) {\n val node = queue.removeAt(0)\n print(\"$node \")\n node.left?.let { queue.add(it) }\n node.right?.let { queue.add(it) }\n }\n }\n}\n\ninline fun exec(name: String, n: Node?, f: (Node?) -> Unit) {\n print(name)\n f(n)\n println()\n}\n\nfun main(args: Array<String>) {\n val nodes = Array(10) { Node(it) }\n\n nodes[1].left = nodes[2]\n nodes[1].right = nodes[3]\n\n nodes[2].left = nodes[4]\n nodes[2].right = nodes[5]\n\n nodes[4].left = nodes[7]\n\n nodes[3].left = nodes[6]\n\n nodes[6].left = nodes[8]\n nodes[6].right = nodes[9]\n\n exec(\" preOrder: \", nodes[1], ::preOrder)\n exec(\" inorder: \", nodes[1], ::inorder)\n exec(\" postOrder: \", nodes[1], ::postOrder)\n exec(\"level-order: \", nodes[1], ::levelOrder)\n}\n","language":"Kotlin"},{"code":"fun main(args: Array<String>) {\n data class Node(val v: Int, var left: Node? = null, var right: Node? = null) {\n override fun toString() = \" $v\"\n\n fun preOrder() { print(this); left?.preOrder(); right?.preOrder() }\n fun inorder() { left?.inorder(); print(this); right?.inorder() }\n fun postOrder() { left?.postOrder(); right?.postOrder(); print(this) }\n\n fun levelOrder() = with(mutableListOf(this)) {\n do {\n val node = removeAt(0)\n print(node)\n node.left?.let { add(it) }\n node.right?.let { add(it) }\n } while (any())\n }\n\n inline fun exec(name: String, f: (Node) -> Unit) {\n print(name)\n f(this)\n println()\n }\n }\n\n val nodes = Array(10) { Node(it) }\n\n nodes[1].left = nodes[2]\n nodes[1].right = nodes[3]\n nodes[2].left = nodes[4]\n nodes[2].right = nodes[5]\n nodes[4].left = nodes[7]\n nodes[3].left = nodes[6]\n nodes[6].left = nodes[8]\n nodes[6].right = nodes[9]\n\n with(nodes[1]) {\n exec(\" preOrder:\", Node::preOrder)\n exec(\" inorder:\", Node::inorder)\n exec(\" postOrder:\", Node::postOrder)\n exec(\"level-order:\", Node::levelOrder)\n }\n}\n","language":"Kotlin"},{"code":"{def walk\n\n {def walk.r\n {lambda {:o :t}\n {if {W.equal? :t nil}\n then\n else {if {W.equal? :o preorder} then {A.get 0 :t} else}\n {walk.r :order {A.get 1 :t}}\n {if {W.equal? :o inorder} then {A.get 0 :t} else}\n {walk.r :order {A.get 2 :t}}\n {if {W.equal? :o postorder} then {A.get 0 :t} else} }}}\n\n {lambda {:o :t}\n {S.replace \\s by space in {walk.r :o :t}}}}\n\n{def sort\n {lambda {:o :t} {S.sort :o {walk preorder :t}}}}\n\n{def T\n {A.new 1\n {A.new 2\n {A.new 4\n {A.new 7 nil nil} nil}\n {A.new 5 nil nil}}\n {A.new 3\n {A.new 6\n {A.new 8 nil nil}\n {A.new 9 nil nil}} nil}}}\n\n{walk preorder {T}} -> 1 2 4 7 5 3 6 8 9\n{walk inorder {T}} -> 7 4 2 5 1 8 6 9 3\n{walk postorder {T}} -> 7 4 5 2 8 9 6 3 1\n{sort < {T}} -> 1 2 3 4 5 6 7 8 9\n{sort > {T}} -> 9 8 7 6 5 4 3 2 1\n","language":"Lambdatalk"},{"code":"-- parent script \"BinaryTreeNode\"\n\nproperty _val, _left, _right\n\non new (me, val)\n me._val = val\n return me\nend\n\non getValue (me)\n return me._val\nend\n\non setLeft (me, node)\n me._left = node\nend\n\non setRight (me, node)\n me._right = node\nend\n\non getLeft (me)\n return me._left\nend\n\non getRight (me)\n return me._right\nend\n","language":"Lingo"},{"code":"-- parent script \"BinaryTreeTraversal\"\n\non inOrder (me, node, l)\n if voidP(l) then l = []\n if voidP(node) then return l\n if not voidP(node.getLeft()) then l = me.inOrder(node.getLeft(), l)\n l.add(node)\n if not voidP(node.getRight()) then l = me.inOrder(node.getRight(), l)\n return l\nend\n\non preOrder (me, node, l)\n if voidP(l) then l = []\n if voidP(node) then return l\n l.add(node)\n if not voidP(node.getLeft()) then l = me.preOrder(node.getLeft(), l)\n if not voidP(node.getRight()) then l = me.preOrder(node.getRight(), l)\n return l\nend\n\non postOrder (me, node, l)\n if voidP(l) then l = []\n if voidP(node) then return l\n if not voidP(node.getLeft()) then l = me.postOrder(node.getLeft(), l)\n if not voidP(node.getRight()) then l = me.postOrder(node.getRight(), l)\n l.add(node)\n return l\nend\n\non levelOrder (me, node)\n l = []\n queue = [node]\n repeat while queue.count\n node = queue[1]\n queue.deleteAt(1)\n l.add(node)\n if not voidP(node.getLeft()) then queue.add(node.getLeft())\n if not voidP(node.getRight()) then queue.add(node.getRight())\n end repeat\n return l\nend\n\n-- print utility function\non serialize (me, l)\n str = \"\"\n repeat with node in l\n put node.getValue()&\" \" after str\n end repeat\n delete the last char of str\n return str\nend\n","language":"Lingo"},{"code":"-- create the tree\nl = []\nrepeat with i = 1 to 10\n l[i] = script(\"BinaryTreeNode\").new(i)\nend repeat\nl[6].setLeft (l[8])\nl[6].setRight(l[9])\nl[3].setLeft (l[6])\nl[4].setLeft (l[7])\nl[2].setLeft (l[4])\nl[2].setRight(l[5])\nl[1].setLeft (l[2])\nl[1].setRight(l[3])\n\n-- print traversal results\ntrav = script(\"BinaryTreeTraversal\")\nput \"preorder: \" & trav.serialize(trav.preOrder(l[1]))\nput \"inorder: \" & trav.serialize(trav.inOrder(l[1]))\nput \"postorder: \" & trav.serialize(trav.postOrder(l[1]))\nput \"level-order: \" & trav.serialize(trav.levelOrder(l[1]))\n","language":"Lingo"},{"code":"; nodes are [data left right], use \"first\" to get data\n\nto node.left :node\n if empty? butfirst :node [output []]\n output first butfirst :node\nend\nto node.right :node\n if empty? butfirst :node [output []]\n if empty? butfirst butfirst :node [output []]\n output first butfirst butfirst :node\nend\nto max :a :b\n output ifelse :a > :b [:a] [:b]\nend\nto tree.depth :tree\n if empty? :tree [output 0]\n output 1 + max tree.depth node.left :tree tree.depth node.right :tree\nend\n\nto pre.order :tree :action\n if empty? :tree [stop]\n invoke :action first :tree\n pre.order node.left :tree :action\n pre.order node.right :tree :action\nend\nto in.order :tree :action\n if empty? :tree [stop]\n in.order node.left :tree :action\n invoke :action first :tree\n in.order node.right :tree :action\nend\nto post.order :tree :action\n if empty? :tree [stop]\n post.order node.left :tree :action\n post.order node.right :tree :action\n invoke :action first :tree\nend\nto at.depth :n :tree :action\n if empty? :tree [stop]\n ifelse :n = 1 [invoke :action first :tree] [\n at.depth :n-1 node.left :tree :action\n at.depth :n-1 node.right :tree :action\n ]\nend\nto level.order :tree :action\n for [i 1 [tree.depth :tree]] [at.depth :i :tree :action]\nend\n\nmake \"tree [1 [2 [4 [7]]\n [5]]\n [3 [6 [8]\n [9]]]]\n\n pre.order :tree [(type ? \"| |)] (print)\n in.order :tree [(type ? \"| |)] (print)\n post.order :tree [(type ? \"| |)] (print)\nlevel.order :tree [(type ? \"| |)] (print)\n","language":"Logo"},{"code":":- object(tree_traversal).\n\n :- public(orders/1).\n orders(Tree) :-\n write('Pre-order: '), pre_order(Tree), nl,\n write('In-order: '), in_order(Tree), nl,\n write('Post-order: '), post_order(Tree), nl,\n write('Level-order: '), level_order(Tree).\n\n :- public(orders/0).\n orders :-\n tree(Tree),\n orders(Tree).\n\n tree(\n t(1,\n t(2,\n t(4,\n t(7, t, t),\n t\n ),\n t(5, t, t)\n ),\n t(3,\n t(6,\n t(8, t, t),\n t(9, t, t)\n ),\n t\n )\n )\n ).\n\n pre_order(t).\n pre_order(t(Value, Left, Right)) :-\n write(Value), write(' '),\n pre_order(Left),\n pre_order(Right).\n\n in_order(t).\n in_order(t(Value, Left, Right)) :-\n in_order(Left),\n write(Value), write(' '),\n in_order(Right).\n\n post_order(t).\n post_order(t(Value, Left, Right)) :-\n post_order(Left),\n post_order(Right),\n write(Value), write(' ').\n\n level_order(t).\n level_order(t(Value, Left, Right)) :-\n % write tree root value\n write(Value), write(' '),\n % write rest of the tree\n level_order([Left, Right], Tail-Tail).\n\n level_order([], Trees-[]) :-\n ( Trees \\= [] ->\n % print next level\n level_order(Trees, Tail-Tail)\n ; % no more levels\n true\n ).\n level_order([Tree| Trees], Rest0) :-\n ( Tree = t(Value, Left, Right) ->\n write(Value), write(' '),\n % collect the subtrees to print the next level\n append(Rest0, [Left, Right| Tail]-Tail, Rest1),\n % continue printing the current level\n level_order(Trees, Rest1)\n ; % continue printing the current level\n level_order(Trees, Rest0)\n ).\n\n % use difference-lists for constant time append\n append(List1-Tail1, Tail1-Tail2, List1-Tail2).\n\n:- end_object.\n","language":"Logtalk"},{"code":"| ?- ?- tree_traversal::orders.\nPre-order: 1 2 4 7 5 3 6 8 9\nIn-order: 7 4 2 5 1 8 6 9 3\nPost-order: 7 4 5 2 8 9 6 3 1\nLevel-order: 1 2 3 4 5 6 7 8 9\nyes\n","language":"Logtalk"},{"code":"local function depth_first(tr, a, b, c, flat_list)\n\tfor _, val in ipairs({a, b, c}) do\n\t\tif type(tr[val]) == \"table\" then\n\t\t\tdepth_first(tr[val], a, b, c, flat_list)\n\t\telseif type(tr[val]) ~= \"nil\" then\n\t\t\ttable.insert(flat_list, tr[val])\n\t\tend -- if\n\tend -- for\n\treturn flat_list\nend\nlocal function flatten_pre_order(tr) return depth_first(tr, 1, 2, 3, {}) end\nlocal function flatten_in_order(tr) return depth_first(tr, 2, 1, 3, {}) end\nlocal function flatten_post_order(tr) return depth_first(tr, 2, 3, 1, {}) end\n\nlocal function flatten_level_order(tr)\n local flat_list, queue = {}, {tr}\n while next(queue) do -- while queue is not empty\n local node = table.remove(queue, 1) -- dequeue\n\t\t if type(node) == \"table\" then\n\t\t\t table.insert(flat_list, node[1])\n\t\t\t table.insert(queue, node[2]) -- enqueue\n\t\t\t table.insert(queue, node[3]) -- enqueue\n\t\t else\n\t\t\t table.insert(flat_list, node)\n\t\t end -- if\n end -- while\n return flat_list\nend\n\n-- Example\nlocal tree = {1, {2, {4, 7}, 5}, {3, {6, 8, 9}}}\nprint(\"Pre order: \" .. table.concat(flatten_pre_order(tree), \" \"))\nprint(\"In order: \" .. table.concat(flatten_in_order(tree), \" \"))\nprint(\"Post order: \" .. table.concat(flatten_post_order(tree), \" \"))\nprint(\"Level order: \" .. table.concat(flatten_level_order(tree), \" \"))\n","language":"Lua"},{"code":"Module CheckIt {\n Null=(,)\n Tree=((((Null,7,Null),4,Null),2,(Null,5,Null)),1,(((Null,8,Null),6,(Null,9,Null)),3,Null))\n\n Module preorder (T) {\n Print \"preorder: \";\n printtree(T)\n Print\n sub printtree(T)\n Print T#val(1);\" \";\n If len(T#val(0))>0 then printtree(T#val(0))\n If len(T#val(2))>0 then printtree(T#val(2))\n end sub\n }\n preorder Tree\n\n Module inorder (T) {\n Print \"inorder: \";\n printtree(T)\n Print\n sub printtree(T)\n If len(T#val(0))>0 then printtree(T#val(0))\n Print T#val(1);\" \";\n If len(T#val(2))>0 then printtree(T#val(2))\n end sub\n }\n inorder Tree\n\n Module postorder (T) {\n Print \"postorder: \";\n printtree(T)\n Print\n sub printtree(T)\n If len(T#val(0))>0 then printtree(T#val(0))\n If len(T#val(2))>0 then printtree(T#val(2))\n Print T#val(1);\" \";\n end sub\n }\n postorder Tree\n\n Module level_order (T) {\n Print \"level-order: \";\n Stack New {\n printtree(T)\n if empty then exit\n Read T\n Loop\n }\n Print\n sub printtree(T)\n If Len(T)>0 then\n Print T#val(1);\" \";\n Data T#val(0), T#val(2)\n end if\n end sub\n }\n level_order Tree\n}\nCheckIt\n","language":"M2000-Interpreter"},{"code":"Module OOP {\n \\\\ Class is a global function (until this module end)\n Class Null {\n }\n \\\\ Null is a pointer to an object returned from class Null()\n Global Null->Null()\n Class Node {\n Public:\n x, Group LeftNode, Group RightNode\n Class:\n \\\\ after class: anything exist one time,\n \\\\ not included in final object\n Module Node {\n .LeftNode<=Null\n .RightNode<=Null\n Read .x\n \\\\ read ? for optional values\n Read ? .LeftNode, .RightNode\n }\n }\n \\\\ NodeTree return a pointer to a new Node\n Function NodeTree {\n \\\\ ![] pass currrent stack to Node()\n ->Node(![])\n }\n\n Tree=NodeTree(1, NodeTree(2,NodeTree(4, NodeTree(7)), NodeTree(5)), NodeTree(3, NodeTree(6, NodeTree(8), NodeTree(9))))\n\n Module preorder (T) {\n Print \"preorder: \";\n printtree(T)\n Print\n sub printtree(T as pointer)\n If T is Null then Exit sub\n Print T=>x;\" \";\n printtree(T=>LeftNode)\n printtree(T=>RightNode)\n end sub\n }\n preorder Tree\n Module inorder (T) {\n Print \"inorder: \";\n printtree(T)\n Print\n sub printtree(T as pointer)\n If T is Null then Exit sub\n printtree(T=>LeftNode)\n Print T=>x;\" \";\n printtree(T=>RightNode)\n end sub\n }\n inorder Tree\n Module postorder (T) {\n Print \"postorder: \";\n printtree(T)\n Print\n sub printtree(T as pointer)\n If T is Null then Exit sub\n printtree(T=>LeftNode)\n printtree(T=>RightNode)\n Print T=>x;\" \";\n end sub\n }\n postorder Tree\n Module level_order (T) {\n Print \"level-order: \";\n Stack New {\n printtree(T)\n if empty then exit\n Read T\n Loop\n }\n Print\n sub printtree(T as pointer)\n If T is Null else\n Print T=>x;\" \";\n Data T=>LeftNode, T=>RightNode\n end if\n end sub\n }\n level_order Tree\n}\nOOP\n","language":"M2000-Interpreter"},{"code":"Module OOP {\n \\\\ Class is a global function (until this module end)\n Class Null {\n }\n \\\\ Null is a pointer to an object returned from class Null()\n Global Null->Null()\n Class Node {\n Public:\n x, Group LeftNode, Group RightNode\n Module preorder (visitor){\n T->This\n printtree(T)\n sub printtree(T as pointer)\n If T is Null then Exit sub\n call visitor(T=>x)\n printtree(T=>LeftNode)\n printtree(T=>RightNode)\n end sub\n }\n Module inorder (visitor){\n T->This\n printtree(T)\n sub printtree(T as pointer)\n If T is Null then Exit sub\n printtree(T=>LeftNode)\n call visitor(T=>x)\n printtree(T=>RightNode)\n end sub\n }\n Module postorder (visitor) {\n T->This\n printtree(T)\n sub printtree(T as pointer)\n If T is Null then Exit sub\n printtree(T=>LeftNode)\n printtree(T=>RightNode)\n call visitor(T=>x)\n end sub\n }\n Module level_order (visitor){\n T->This\n Stack New {\n printtree(T)\n if empty then exit\n Read T\n Loop\n }\n sub printtree(T as pointer)\n If T is Null else\n call visitor(T=>x)\n Data T=>LeftNode, T=>RightNode\n end if\n end sub\n }\n Class:\n \\\\ after class: anything exist one time,\n \\\\ not included in final object\n Module Node {\n .LeftNode<=Null\n .RightNode<=Null\n Read .x\n \\\\ read ? for optional values\n Read ? .LeftNode, .RightNode\n }\n }\n \\\\ NodeTree return a pointer to a new Node\n Function NodeTree {\n \\\\ ![] pass currrent stack to Node()\n ->Node(![])\n }\n\n Tree=NodeTree(1, NodeTree(2,NodeTree(4, NodeTree(7)), NodeTree(5)), NodeTree(3, NodeTree(6, NodeTree(8), NodeTree(9))))\n\n printnum=lambda (title$) -> {\n Print\n Print title$;\n =lambda (x)-> {\n Print x;\" \";\n }\n }\n Tree=>preorder printnum(\"preorder: \")\n Tree=>inorder printnum(\"inorder: \")\n Tree=>postorder printnum(\"postorder: \")\n Tree=>level_order printnum(\"level-order: \")\n}\nOOP\n","language":"M2000-Interpreter"},{"code":"Module OOP {\n \\\\ Class is a global function (until this module end)\n Class Null {\n }\n \\\\ Null is a pointer to an object returned from class Null()\n Global Null->Null()\n Class Node {\n Public:\n x, Group LeftNode, Group RightNode\n Module preorder (visitor){\n T->This\n printtree(T)\n sub printtree(T as pointer)\n If T is Null then Exit sub\n call event visitor, T=>x\n printtree(T=>LeftNode)\n printtree(T=>RightNode)\n end sub\n }\n Module inorder (visitor){\n T->This\n printtree(T)\n sub printtree(T as pointer)\n If T is Null then Exit sub\n printtree(T=>LeftNode)\n call event visitor, T=>x\n printtree(T=>RightNode)\n end sub\n }\n Module postorder (visitor) {\n T->This\n printtree(T)\n sub printtree(T as pointer)\n If T is Null then Exit sub\n printtree(T=>LeftNode)\n printtree(T=>RightNode)\n call event visitor, T=>x\n end sub\n }\n Module level_order (visitor){\n T->This\n Stack New {\n printtree(T)\n if empty then exit\n Read T\n Loop\n }\n sub printtree(T as pointer)\n If T is Null else\n call event visitor, T=>x\n Data T=>LeftNode, T=>RightNode\n end if\n end sub\n }\n Class:\n \\\\ after class: anything exist one time,\n \\\\ not included in final object\n Module Node {\n .LeftNode<=Null\n .RightNode<=Null\n Read .x\n \\\\ read ? for optional values\n Read ? .LeftNode, .RightNode\n }\n }\n \\\\ NodeTree return a pointer to a new Node\n Function NodeTree {\n \\\\ ![] pass currrent stack to Node()\n ->Node(![])\n }\n\n Tree=NodeTree(1, NodeTree(2,NodeTree(4, NodeTree(7)), NodeTree(5)), NodeTree(3, NodeTree(6, NodeTree(8), NodeTree(9))))\n Event PrintAnum {\n read x\n }\n Function PrintThis(x) {\n Print x;\" \";\n }\n Event PrintAnum New PrintThis()\n printnum=lambda PrintAnum (title$) -> {\n Print\n Print title$;\n =PrintAnum\n }\n Tree=>preorder printnum(\"preorder: \")\n Tree=>inorder printnum(\"inorder: \")\n Tree=>postorder printnum(\"postorder: \")\n Tree=>level_order printnum(\"level-order: \")\n}\nOOP\n","language":"M2000-Interpreter"},{"code":"preorder[a_Integer] := a;\npreorder[a_[b__]] := Flatten@{a, preorder /@ {b}};\ninorder[a_Integer] := a;\ninorder[a_[b_, c_]] := Flatten@{inorder@b, a, inorder@c};\ninorder[a_[b_]] := Flatten@{inorder@b, a}; postorder[a_Integer] := a;\npostorder[a_[b__]] := Flatten@{postorder /@ {b}, a};\nlevelorder[a_] :=\n Flatten[Table[Level[a, {n}], {n, 0, Depth@a}]] /. {b_Integer[__] :>\n b};\n","language":"Mathematica"},{"code":"preorder[1[2[4[7], 5], 3[6[8, 9]]]]\ninorder[1[2[4[7], 5], 3[6[8, 9]]]]\npostorder[1[2[4[7], 5], 3[6[8, 9]]]]\nlevelorder[1[2[4[7], 5], 3[6[8, 9]]]]\n","language":"Mathematica"},{"code":":- module tree_traversal.\n:- interface.\n\n:- import_module io.\n\n:- pred main(io::di, io::uo) is det.\n\n:- implementation.\n\n:- import_module list.\n\n:- type tree(V)\n ---> empty\n ; node(V, tree(V), tree(V)).\n\n:- pred preorder(pred(V, A, A), tree(V), A, A).\n:- mode preorder(pred(in, di, uo) is det, in, di, uo) is det.\n\npreorder(_, empty, !Acc).\npreorder(P, node(Value, Left, Right), !Acc) :-\n P(Value, !Acc),\n preorder(P, Left, !Acc),\n preorder(P, Right, !Acc).\n\n:- pred inorder(pred(V, A, A), tree(V), A, A).\n:- mode inorder(pred(in, di, uo) is det, in, di, uo) is det.\n\ninorder(_, empty, !Acc).\ninorder(P, node(Value, Left, Right), !Acc) :-\n inorder(P, Left, !Acc),\n P(Value, !Acc),\n inorder(P, Right, !Acc).\n\n:- pred postorder(pred(V, A, A), tree(V), A, A).\n:- mode postorder(pred(in, di, uo) is det, in, di, uo) is det.\n\npostorder(_, empty, !Acc).\npostorder(P, node(Value, Left, Right), !Acc) :-\n postorder(P, Left, !Acc),\n postorder(P, Right, !Acc),\n P(Value, !Acc).\n\n:- pred levelorder(pred(V, A, A), tree(V), A, A).\n:- mode levelorder(pred(in, di, uo) is det, in, di, uo) is det.\n\nlevelorder(P, Tree, !Acc) :-\n do_levelorder(P, [Tree], !Acc).\n\n:- pred do_levelorder(pred(V, A, A), list(tree(V)), A, A).\n:- mode do_levelorder(pred(in, di, uo) is det, in, di, uo) is det.\n\ndo_levelorder(_, [], !Acc).\ndo_levelorder(P, [empty | Xs], !Acc) :-\n do_levelorder(P, Xs, !Acc).\ndo_levelorder(P, [node(Value, Left, Right) | Xs], !Acc) :-\n P(Value, !Acc),\n do_levelorder(P, Xs ++ [Left, Right], !Acc).\n\n:- func tree = tree(int).\n\ntree =\n node(1,\n node(2,\n node(4,\n node(7, empty, empty),\n empty\n ),\n node(5, empty, empty)\n ),\n node(3,\n node(6,\n node(8, empty, empty),\n node(9, empty, empty)\n ),\n empty\n )\n ).\n\nmain(!IO) :-\n io.write_string(\"preorder: \" ,!IO),\n preorder(print_value, tree, !IO), io.nl(!IO),\n io.write_string(\"inorder: \" ,!IO),\n inorder(print_value, tree, !IO), io.nl(!IO),\n io.write_string(\"postorder: \" ,!IO),\n postorder(print_value, tree, !IO), io.nl(!IO),\n io.write_string(\"levelorder: \" ,!IO),\n levelorder(print_value, tree, !IO), io.nl(!IO).\n\n:- pred print_value(V::in, io::di, io::uo) is det.\n\nprint_value(V, !IO) :-\n io.print(V, !IO),\n io.write_string(\" \", !IO).\n","language":"Mercury"},{"code":"main :: [sys_message]\nmain = [Stdout (lay [show (f example)\n | f <- [preorder,inorder,postorder,levelorder]])]\n\nexample :: tree num\nexample = Node 1 (Node 2 (Node 4 (leaf 7) Nilt)\n (leaf 5))\n (Node 3 (Node 6 (leaf 8) (leaf 9)) Nilt)\n\ntree * ::= Nilt | Node * (tree *) (tree *)\n\nleaf :: *->tree *\nleaf k = Node k Nilt Nilt\n\npreorder :: tree *->[*]\npreorder Nilt = []\npreorder (Node v l r) = v : preorder l ++ preorder r\n\ninorder :: tree *->[*]\ninorder Nilt = []\ninorder (Node v l r) = inorder l ++ v : inorder r\n\npostorder :: tree *->[*]\npostorder Nilt = []\npostorder (Node v l r) = postorder l ++ postorder r ++ [v]\n\nlevelorder :: tree *->[*]\nlevelorder t = f [t]\n where f [] = []\n f (Nilt:xs) = f xs\n f (Node v l r:xs) = v : f (xs++[l,r])\n","language":"Miranda"},{"code":"import deques\n\ntype\n Node[T] = ref object\n data: T\n left, right: Node[T]\n\nproc newNode[T](data: T; left, right: Node[T] = nil): Node[T] =\n Node[T](data: data, left: left, right: right)\n\nproc preorder[T](n: Node[T]): seq[T] =\n if n.isNil: @[]\n else: @[n.data] & preorder(n.left) & preorder(n.right)\n\nproc inorder[T](n: Node[T]): seq[T] =\n if n.isNil: @[]\n else: inorder(n.left) & @[n.data] & inorder(n.right)\n\nproc postorder[T](n: Node[T]): seq[T] =\n if n.isNil: @[]\n else: postorder(n.left) & postorder(n.right) & @[n.data]\n\nproc levelorder[T](n: Node[T]): seq[T] =\n var queue: Deque[Node[T]]\n queue.addLast(n)\n while queue.len > 0:\n let next = queue.popFirst()\n result.add next.data\n if not next.left.isNil: queue.addLast(next.left)\n if not next.right.isNil: queue.addLast(next.right)\n\nlet tree = 1.newNode(\n 2.newNode(\n 4.newNode(\n 7.newNode),\n 5.newNode),\n 3.newNode(\n 6.newNode(\n 8.newNode,\n 9.newNode)))\n\necho preorder tree\necho inorder tree\necho postorder tree\necho levelorder tree\n","language":"Nim"},{"code":"??use Collection;\n\nclass Test {\n function : Main(args : String[]) ~ Nil {\n one := Node->New(1);\n two := Node->New(2);\n three := Node->New(3);\n four := Node->New(4);\n five := Node->New(5);\n six := Node->New(6);\n seven := Node->New(7);\n eight := Node->New(8);\n nine := Node->New(9);\n\n one->SetLeft(two); one->SetRight(three);\n two->SetLeft(four); two->SetRight(five);\n three->SetLeft(six); four->SetLeft(seven);\n six->SetLeft(eight); six->SetRight(nine);\n\n \"Preorder: \"->Print(); Preorder(one);\n \"\\nInorder: \"->Print(); Inorder(one);\n \"\\nPostorder: \"->Print(); Postorder(one);\n \"\\nLevelorder: \"->Print(); Levelorder(one);\n \"\\n\"->Print();\n }\n\n function : Preorder(node : Node) ~ Nil {\n if(node <> Nil) {\n System.IO.Console->Print(node->GetData())->Print(\", \");\n Preorder(node->GetLeft());\n Preorder(node->GetRight());\n };\n }\n\n function : Inorder(node : Node) ~ Nil {\n if(node <> Nil) {\n Inorder(node->GetLeft());\n System.IO.Console->Print(node->GetData())->Print(\", \");\n Inorder(node->GetRight());\n };\n }\n\n function : Postorder(node : Node) ~ Nil {\n if(node <> Nil) {\n Postorder(node->GetLeft());\n Postorder(node->GetRight());\n System.IO.Console->Print(node->GetData())->Print(\", \");\n };\n }\n\n function : Levelorder(node : Node) ~ Nil {\n nodequeue := Collection.Queue->New();\n if(node <> Nil) {\n nodequeue->Add(node);\n };\n\n while(nodequeue->IsEmpty() = false) {\n next := nodequeue->Remove()->As(Node);\n System.IO.Console->Print(next->GetData())->Print(\", \");\n if(next->GetLeft() <> Nil) {\n nodequeue->Add(next->GetLeft());\n };\n\n if(next->GetRight() <> Nil) {\n nodequeue->Add(next->GetRight());\n };\n };\n }\n}\n\nclass Node from BasicCompare {\n @left : Node;\n @right : Node;\n @data : Int;\n\n New(data : Int) {\n Parent();\n @data := data;\n }\n\n method : public : GetData() ~ Int {\n return @data;\n }\n\n method : public : SetLeft(left : Node) ~ Nil {\n @left := left;\n }\n\n method : public : GetLeft() ~ Node {\n return @left;\n }\n\n method : public : SetRight(right : Node) ~ Nil {\n @right := right;\n }\n\n method : public : GetRight() ~ Node {\n return @right;\n }\n\n method : public : Compare(rhs : Compare) ~ Int {\n right : Node := rhs->As(Node);\n if(@data = right->GetData()) {\n return 0;\n }\n else if(@data < right->GetData()) {\n return -1;\n };\n\n return 1;\n }\n}\n","language":"Objeck"},{"code":"type 'a tree = Empty\n | Node of 'a * 'a tree * 'a tree\n\nlet rec preorder f = function\n Empty -> ()\n | Node (v,l,r) -> f v;\n preorder f l;\n preorder f r\n\nlet rec inorder f = function\n Empty -> ()\n | Node (v,l,r) -> inorder f l;\n f v;\n inorder f r\n\nlet rec postorder f = function\n Empty -> ()\n | Node (v,l,r) -> postorder f l;\n postorder f r;\n f v\n\nlet levelorder f x =\n let queue = Queue.create () in\n Queue.add x queue;\n while not (Queue.is_empty queue) do\n match Queue.take queue with\n Empty -> ()\n | Node (v,l,r) -> f v;\n Queue.add l queue;\n Queue.add r queue\n done\n\nlet tree =\n Node (1,\n Node (2,\n Node (4,\n Node (7, Empty, Empty),\n Empty),\n Node (5, Empty, Empty)),\n Node (3,\n Node (6,\n Node (8, Empty, Empty),\n Node (9, Empty, Empty)),\n Empty))\n\nlet () =\n preorder (Printf.printf \"%d \") tree; print_newline ();\n inorder (Printf.printf \"%d \") tree; print_newline ();\n postorder (Printf.printf \"%d \") tree; print_newline ();\n levelorder (Printf.printf \"%d \") tree; print_newline ()\n","language":"OCaml"},{"code":"Object Class new: Tree(v, l, r)\n\nTree method: initialize(v, l, r) v := v l := l r := r ;\nTree method: v @v ;\nTree method: l @l ;\nTree method: r @r ;\n\nTree method: preOrder(f)\n @v f perform\n @l ifNotNull: [ @l preOrder(f) ]\n @r ifNotNull: [ @r preOrder(f) ] ;\n\nTree method: inOrder(f)\n @l ifNotNull: [ @l inOrder(f) ]\n @v f perform\n @r ifNotNull: [ @r inOrder(f) ] ;\n\nTree method: postOrder(f)\n @l ifNotNull: [ @l postOrder(f) ]\n @r ifNotNull: [ @r postOrder(f) ]\n @v f perform ;\n\nTree method: levelOrder(f)\n| c n |\n Channel new self over send drop ->c\n while(c notEmpty) [\n c receive ->n\n n v f perform\n n l dup ifNotNull: [ c send ] drop\n n r dup ifNotNull: [ c send ] drop\n ] ;\n","language":"Oforth"},{"code":" one = .Node~new(1);\n two = .Node~new(2);\n three = .Node~new(3);\n four = .Node~new(4);\n five = .Node~new(5);\n six = .Node~new(6);\n seven = .Node~new(7);\n eight = .Node~new(8);\n nine = .Node~new(9);\n\n one~left = two\n one~right = three\n two~left = four\n two~right = five\n three~left = six\n four~left = seven\n six~left = eight\n six~right = nine\n\n out = .array~new\n .treetraverser~preorder(one, out);\n say \"Preorder: \" out~toString(\"l\", \", \")\n out~empty\n .treetraverser~inorder(one, out);\n say \"Inorder: \" out~toString(\"l\", \", \")\n out~empty\n .treetraverser~postorder(one, out);\n say \"Postorder: \" out~toString(\"l\", \", \")\n out~empty\n .treetraverser~levelorder(one, out);\n say \"Levelorder:\" out~toString(\"l\", \", \")\n\n\n::class node\n::method init\n expose left right data\n use strict arg data\n left = .nil\n right = .nil\n\n::attribute left\n::attribute right\n::attribute data\n\n::class treeTraverser\n::method preorder class\n use arg node, out\n if node \\== .nil then do\n out~append(node~data)\n self~preorder(node~left, out)\n self~preorder(node~right, out)\n end\n\n::method inorder class\n use arg node, out\n if node \\== .nil then do\n self~inorder(node~left, out)\n out~append(node~data)\n self~inorder(node~right, out)\n end\n\n::method postorder class\n use arg node, out\n if node \\== .nil then do\n self~postorder(node~left, out)\n self~postorder(node~right, out)\n out~append(node~data)\n end\n\n::method levelorder class\n use arg node, out\n\n if node == .nil then return\n nodequeue = .queue~new\n nodequeue~queue(node)\n loop while \\nodequeue~isEmpty\n next = nodequeue~pull\n out~append(next~data)\n if next~left \\= .nil then\n nodequeue~queue(next~left)\n if next~right \\= .nil then\n nodequeue~queue(next~right)\n end\n","language":"OoRexx"},{"code":"declare\n Tree = n(1\n n(2\n n(4 n(7 e e) e)\n n(5 e e))\n n(3\n n(6 n(8 e e) n(9 e e))\n e))\n\n fun {Concat Xs}\n {FoldR Xs Append nil}\n end\n\n fun {Preorder T}\n case T of e then nil\n [] n(V L R) then\n {Concat [[V]\n {Preorder L}\n {Preorder R}]}\n end\n end\n\n fun {Inorder T}\n case T of e then nil\n [] n(V L R) then\n {Concat [{Inorder L}\n [V]\n {Inorder R}]}\n end\n end\n\n fun {Postorder T}\n case T of e then nil\n [] n(V L R) then\n {Concat [{Postorder L}\n {Postorder R}\n [V]]}\n end\n end\n\n local\n fun {Collect Queue}\n case Queue of nil then nil\n [] e|Xr then {Collect Xr}\n [] n(V L R)|Xr then\n V|{Collect {Append Xr [L R]}}\n end\n end\n in\n fun {Levelorder T}\n {Collect [T]}\n end\n end\nin\n {Show {Preorder Tree}}\n {Show {Inorder Tree}}\n {Show {Postorder Tree}}\n {Show {Levelorder Tree}}\n","language":"Oz"},{"code":"sub preorder\n{\n\tmy $t = shift or return ();\n\treturn ($t->[0], preorder($t->[1]), preorder($t->[2]));\n}\n\nsub inorder\n{\n\tmy $t = shift or return ();\n\treturn (inorder($t->[1]), $t->[0], inorder($t->[2]));\n}\n\nsub postorder\n{\n\tmy $t = shift or return ();\n\treturn (postorder($t->[1]), postorder($t->[2]), $t->[0]);\n}\n\nsub depth\n{\n\tmy @ret;\n\tmy @a = ($_[0]);\n\twhile (@a) {\n\t\tmy $v = shift @a or next;\n\t\tpush @ret, $v->[0];\n\t\tpush @a, @{$v}[1,2];\n\t}\n\treturn @ret;\n}\n\nmy $x = [1,[2,[4,[7]],[5]],[3,[6,[8],[9]]]];\n\nprint \"pre: @{[preorder($x)]}\\n\";\nprint \"in: @{[inorder($x)]}\\n\";\nprint \"post: @{[postorder($x)]}\\n\";\nprint \"depth: @{[depth($x)]}\\n\";\n","language":"Perl"},{"code":"-->\n <span style=\"color: #008080;\">constant</span> <span style=\"color: #000000;\">VALUE</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">LEFT</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">2</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">RIGHT</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">3</span>\n\n <span style=\"color: #008080;\">constant</span> <span style=\"color: #000000;\">tree</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: #0000FF;\">{</span><span style=\"color: #000000;\">2</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: #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;\">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;\">5</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;\">3</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: #0000FF;\">{</span><span style=\"color: #000000;\">8</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;\">9</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: #000000;\">0</span><span style=\"color: #0000FF;\">}}</span>\n\n <span style=\"color: #008080;\">procedure</span> <span style=\"color: #000000;\">preorder</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #004080;\">object</span> <span style=\"color: #000000;\">tree</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;\">tree</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;\">\"%d \"</span><span style=\"color: #0000FF;\">,{</span><span style=\"color: #000000;\">tree</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">VALUE</span><span style=\"color: #0000FF;\">]})</span>\n <span style=\"color: #000000;\">preorder</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">tree</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">LEFT</span><span style=\"color: #0000FF;\">])</span>\n <span style=\"color: #000000;\">preorder</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">tree</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">RIGHT</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;\">procedure</span>\n\n <span style=\"color: #008080;\">procedure</span> <span style=\"color: #000000;\">inorder</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #004080;\">object</span> <span style=\"color: #000000;\">tree</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;\">tree</span><span style=\"color: #0000FF;\">)</span> <span style=\"color: #008080;\">then</span>\n <span style=\"color: #000000;\">inorder</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">tree</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">LEFT</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;\">\"%d \"</span><span style=\"color: #0000FF;\">,{</span><span style=\"color: #000000;\">tree</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">VALUE</span><span style=\"color: #0000FF;\">]})</span>\n <span style=\"color: #000000;\">inorder</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">tree</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">RIGHT</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;\">procedure</span>\n\n <span style=\"color: #008080;\">procedure</span> <span style=\"color: #000000;\">postorder</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #004080;\">object</span> <span style=\"color: #000000;\">tree</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;\">tree</span><span style=\"color: #0000FF;\">)</span> <span style=\"color: #008080;\">then</span>\n <span style=\"color: #000000;\">postorder</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">tree</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">LEFT</span><span style=\"color: #0000FF;\">])</span>\n <span style=\"color: #000000;\">postorder</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">tree</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">RIGHT</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;\">\"%d \"</span><span style=\"color: #0000FF;\">,{</span><span style=\"color: #000000;\">tree</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">VALUE</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;\">procedure</span>\n\n <span style=\"color: #008080;\">procedure</span> <span style=\"color: #000000;\">level_order</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #004080;\">object</span> <span style=\"color: #000000;\">tree</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #004080;\">sequence</span> <span style=\"color: #000000;\">more</span> <span style=\"color: #0000FF;\">=</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;\">tree</span><span style=\"color: #0000FF;\">)</span> <span style=\"color: #008080;\">then</span>\n <span style=\"color: #000000;\">more</span> <span style=\"color: #0000FF;\">&=</span> <span style=\"color: #0000FF;\">{</span><span style=\"color: #000000;\">tree</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">LEFT</span><span style=\"color: #0000FF;\">],</span><span style=\"color: #000000;\">tree</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">RIGHT</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;\">\"%d \"</span><span style=\"color: #0000FF;\">,{</span><span style=\"color: #000000;\">tree</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">VALUE</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;\">more</span><span style=\"color: #0000FF;\">)</span> <span style=\"color: #0000FF;\">></span> <span style=\"color: #000000;\">0</span> <span style=\"color: #008080;\">then</span>\n <span style=\"color: #000000;\">level_order</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">more</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">],</span><span style=\"color: #000000;\">more</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;\">end</span> <span style=\"color: #008080;\">procedure</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 preorder: \"</span><span style=\"color: #0000FF;\">)</span> <span style=\"color: #000000;\">preorder</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">tree</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;\">\"\\n inorder: \"</span><span style=\"color: #0000FF;\">)</span> <span style=\"color: #000000;\">inorder</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">tree</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;\">\"\\n postorder: \"</span><span style=\"color: #0000FF;\">)</span> <span style=\"color: #000000;\">postorder</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">tree</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;\">\"\\n level-order: \"</span><span style=\"color: #0000FF;\">)</span> <span style=\"color: #000000;\">level_order</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">tree</span><span style=\"color: #0000FF;\">)</span>\n<!--\n","language":"Phix"},{"code":"class Node {\n private $left;\n private $right;\n private $value;\n\n function __construct($value) {\n $this->value = $value;\n }\n\n public function getLeft() {\n return $this->left;\n }\n public function getRight() {\n return $this->right;\n }\n public function getValue() {\n return $this->value;\n }\n\n public function setLeft($value) {\n $this->left = $value;\n }\n public function setRight($value) {\n $this->right = $value;\n }\n public function setValue($value) {\n $this->value = $value;\n }\n}\n\nclass TreeTraversal {\n\n public function preOrder(Node $n) {\n echo $n->getValue() . \" \";\n if($n->getLeft() != null) {\n $this->preOrder($n->getLeft());\n }\n if($n->getRight() != null){\n $this->preOrder($n->getRight());\n }\n }\n\n public function inOrder(Node $n) {\n if($n->getLeft() != null) {\n $this->inOrder($n->getLeft());\n }\n echo $n->getValue() . \" \";\n if($n->getRight() != null){\n $this->inOrder($n->getRight());\n }\n\n }\n\n public function postOrder(Node $n) {\n if($n->getLeft() != null) {\n $this->postOrder($n->getLeft());\n }\n if($n->getRight() != null){\n $this->postOrder($n->getRight());\n }\n echo $n->getValue() . \" \";\n }\n\n public function levelOrder($arg) {\n $q[] = $arg;\n while (!empty($q)) {\n $n = array_shift($q);\n echo $n->getValue() . \" \";\n if($n->getLeft() != null) {\n $q[] = $n->getLeft();\n }\n if($n->getRight() != null){\n $q[] = $n->getRight();\n }\n }\n }\n}\n\n$arr = [];\nfor ($i=1; $i < 10; $i++) {\n $arr[$i] = new Node($i);\n}\n\n$arr[6]->setLeft($arr[8]);\n$arr[6]->setRight($arr[9]);\n$arr[3]->setLeft($arr[6]);\n$arr[4]->setLeft($arr[7]);\n$arr[2]->setLeft($arr[4]);\n$arr[2]->setRight($arr[5]);\n$arr[1]->setLeft($arr[2]);\n$arr[1]->setRight($arr[3]);\n\n$tree = new TreeTraversal($arr);\n\necho \"preorder:\\t\";\n$tree->preOrder($arr[1]);\necho \"\\ninorder:\\t\";\n$tree->inOrder($arr[1]);\necho \"\\npostorder:\\t\";\n$tree->postOrder($arr[1]);\necho \"\\nlevel-order:\\t\";\n$tree->levelOrder($arr[1]);\n","language":"PHP"},{"code":"(de preorder (Node Fun)\n (when Node\n (Fun (car Node))\n (preorder (cadr Node) Fun)\n (preorder (caddr Node) Fun) ) )\n\n(de inorder (Node Fun)\n (when Node\n (inorder (cadr Node) Fun)\n (Fun (car Node))\n (inorder (caddr Node) Fun) ) )\n\n(de postorder (Node Fun)\n (when Node\n (postorder (cadr Node) Fun)\n (postorder (caddr Node) Fun)\n (Fun (car Node)) ) )\n\n(de level-order (Node Fun)\n (for (Q (circ Node) Q)\n (let N (fifo 'Q)\n (Fun (car N))\n (and (cadr N) (fifo 'Q @))\n (and (caddr N) (fifo 'Q @)) ) ) )\n\n(setq *Tree\n (1\n (2 (4 (7)) (5))\n (3 (6 (8) (9))) ) )\n\n(for Order '(preorder inorder postorder level-order)\n (prin (align -13 (pack Order \":\")))\n (Order *Tree printsp)\n (prinl) )\n","language":"PicoLisp"},{"code":"tree :-\n\tTree= [1,\n\t [2,\n\t\t [4,\n\t\t [7, nil, nil],\n\t\t nil],\n\t\t [5, nil, nil]],\n\t [3,\n\t\t [6,\n\t\t [8, nil, nil],\n\t\t [9,nil, nil]],\n\t\t nil]],\n\t\n\twrite('preorder : '), preorder(Tree), nl,\n\twrite('inorder : '), inorder(Tree), nl,\n\twrite('postorder : '), postorder(Tree), nl,\n\twrite('level-order : '), level_order([Tree]).\n\npreorder(nil).\npreorder([Node, FG, FD]) :-\n\tformat('~w ', [Node]),\n\tpreorder(FG),\n\tpreorder(FD).\n\n\ninorder(nil).\ninorder([Node, FG, FD]) :-\n\tinorder(FG),\n\tformat('~w ', [Node]),\n\tinorder(FD).\n\npostorder(nil).\npostorder([Node, FG, FD]) :-\n\tpostorder(FG),\n\tpostorder(FD),\n\tformat('~w ', [Node]).\n\n\nlevel_order([]).\n\nlevel_order(A) :-\n\tlevel_order_(A, U-U, S),\n\tlevel_order(S).\n\nlevel_order_([], S-[],S).\n\nlevel_order_([[Node, FG, FD] | T], CS, FS) :-\n\tformat('~w ', [Node]),\n\tappend_dl(CS, [FG, FD|U]-U, CS1),\n\tlevel_order_(T, CS1, FS).\n\nlevel_order_([nil | T], CS, FS) :-\n\tlevel_order_(T, CS, FS).\n\n\nappend_dl(X-Y, Y-Z, X-Z).\n","language":"Prolog"},{"code":"Structure node\n value.i\n *left.node\n *right.node\nEndStructure\n\nStructure queue\n List q.i()\nEndStructure\n\nDataSection\n tree:\n Data.s \"1(2(4(7),5),3(6(8,9)))\"\nEndDataSection\n\n;Convenient routine to interpret string data to construct a tree of integers.\nProcedure createTree(*n.node, *tPtr.Character)\n Protected num.s, *l.node, *ntPtr.Character\n\n Repeat\n Select *tPtr\\c\n Case '0' To '9'\n num + Chr(*tPtr\\c)\n Case '('\n *n\\value = Val(num): num = \"\"\n *ntPtr = *tPtr + 1\n If *ntPtr\\c = ','\n ProcedureReturn *tPtr\n Else\n *l = AllocateMemory(SizeOf(node))\n *n\\left = *l: *tPtr = createTree(*l, *ntPtr)\n EndIf\n Case ')', ',', #Null\n If num: *n\\value = Val(num): EndIf\n ProcedureReturn *tPtr\n EndSelect\n\n If *tPtr\\c = ','\n *l = AllocateMemory(SizeOf(node)):\n *n\\right = *l: *tPtr = createTree(*l, *tPtr + 1)\n EndIf\n *tPtr + 1\n ForEver\nEndProcedure\n\nProcedure enqueue(List q.i(), element)\n LastElement(q())\n AddElement(q())\n q() = element\nEndProcedure\n\nProcedure dequeue(List q.i())\n Protected element\n If FirstElement(q())\n element = q()\n DeleteElement(q())\n EndIf\n ProcedureReturn element\nEndProcedure\n\nProcedure onVisit(*n.node)\n Print(Str(*n\\value) + \" \")\nEndProcedure\n\nProcedure preorder(*n.node) ;recursive\n onVisit(*n)\n If *n\\left\n preorder(*n\\left)\n EndIf\n If *n\\right\n preorder(*n\\right)\n EndIf\nEndProcedure\n\nProcedure inorder(*n.node) ;recursive\n If *n\\left\n inorder(*n\\left)\n EndIf\n onVisit(*n)\n If *n\\right\n inorder(*n\\right)\n EndIf\nEndProcedure\n\nProcedure postorder(*n.node) ;recursive\n If *n\\left\n postorder(*n\\left)\n EndIf\n If *n\\right\n postorder(*n\\right)\n EndIf\n onVisit(*n)\nEndProcedure\n\nProcedure levelorder(*n.node)\n Dim q.queue(1)\n Protected readQueue = 1, writeQueue, *currNode.node\n\n enqueue(q(writeQueue)\\q(),*n) ;start queue off with root\n Repeat\n readQueue ! 1: writeQueue ! 1\n While ListSize(q(readQueue)\\q())\n *currNode = dequeue(q(readQueue)\\q())\n If *currNode\\left\n enqueue(q(writeQueue)\\q(),*currNode\\left)\n EndIf\n If *currNode\\right\n enqueue(q(writeQueue)\\q(),*currNode\\right)\n EndIf\n onVisit(*currNode)\n Wend\n Until ListSize(q(writeQueue)\\q()) = 0\nEndProcedure\n\nIf OpenConsole()\n Define root.node\n createTree(root,?tree)\n\n Print(\"preorder: \")\n preorder(root)\n PrintN(\"\")\n Print(\"inorder: \")\n inorder(root)\n PrintN(\"\")\n Print(\"postorder: \")\n postorder(root)\n PrintN(\"\")\n Print(\"levelorder: \")\n levelorder(root)\n PrintN(\"\")\n\n Print(#CRLF$ + #CRLF$ + \"Press ENTER to exit\")\n Input()\n CloseConsole()\nEndIf\n","language":"PureBasic"},{"code":"from collections import namedtuple\n\nNode = namedtuple('Node', 'data, left, right')\ntree = Node(1,\n Node(2,\n Node(4,\n Node(7, None, None),\n None),\n Node(5, None, None)),\n Node(3,\n Node(6,\n Node(8, None, None),\n Node(9, None, None)),\n None))\n\ndef printwithspace(i):\n print(i, end=' ')\n\ndef dfs(order, node, visitor):\n if node is not None:\n for action in order:\n if action == 'N':\n visitor(node.data)\n elif action == 'L':\n dfs(order, node.left, visitor)\n elif action == 'R':\n dfs(order, node.right, visitor)\n\ndef preorder(node, visitor = printwithspace):\n dfs('NLR', node, visitor)\n\ndef inorder(node, visitor = printwithspace):\n dfs('LNR', node, visitor)\n\ndef postorder(node, visitor = printwithspace):\n dfs('LRN', node, visitor)\n\ndef ls(node, more, visitor, order='TB'):\n \"Level-based Top-to-Bottom or Bottom-to-Top tree search\"\n if node:\n if more is None:\n more = []\n more += [node.left, node.right]\n for action in order:\n if action == 'B' and more:\n ls(more[0], more[1:], visitor, order)\n elif action == 'T' and node:\n visitor(node.data)\n\ndef levelorder(node, more=None, visitor = printwithspace):\n ls(node, more, visitor, 'TB')\n\n# Because we can\ndef reverse_preorder(node, visitor = printwithspace):\n dfs('RLN', node, visitor)\n\ndef bottom_up_order(node, more=None, visitor = printwithspace, order='BT'):\n ls(node, more, visitor, 'BT')\n\n\nif __name__ == '__main__':\n w = 10\n for traversal in [preorder, inorder, postorder, levelorder,\n reverse_preorder, bottom_up_order]:\n if traversal == reverse_preorder:\n w = 20\n print('\\nThe generalisation of function dfs allows:')\n if traversal == bottom_up_order:\n print('The generalisation of function ls allows:')\n print(f\"{traversal.__name__:>{w}}:\", end=' ')\n traversal(tree)\n print()\n","language":"Python"},{"code":"from collections import namedtuple\nfrom sys import stdout\n\nclass Node(namedtuple('Node', 'data, left, right')):\n __slots__ = ()\n\n def preorder(self, visitor):\n if self is not None:\n visitor(self.data)\n Node.preorder(self.left, visitor)\n Node.preorder(self.right, visitor)\n\n def inorder(self, visitor):\n if self is not None:\n Node.inorder(self.left, visitor)\n visitor(self.data)\n Node.inorder(self.right, visitor)\n\n def postorder(self, visitor):\n if self is not None:\n Node.postorder(self.left, visitor)\n Node.postorder(self.right, visitor)\n visitor(self.data)\n\n def levelorder(self, visitor, more=None):\n if self is not None:\n if more is None:\n more = []\n more += [self.left, self.right]\n visitor(self.data)\n if more:\n Node.levelorder(more[0], visitor, more[1:])\n\n\ndef printwithspace(i):\n stdout.write(\"%i \" % i)\n\n\ntree = Node(1,\n Node(2,\n Node(4,\n Node(7, None, None),\n None),\n Node(5, None, None)),\n Node(3,\n Node(6,\n Node(8, None, None),\n Node(9, None, None)),\n None))\n\n\nif __name__ == '__main__':\n stdout.write(' preorder: ')\n tree.preorder(printwithspace)\n stdout.write('\\n inorder: ')\n tree.inorder(printwithspace)\n stdout.write('\\n postorder: ')\n tree.postorder(printwithspace)\n stdout.write('\\nlevelorder: ')\n tree.levelorder(printwithspace)\n stdout.write('\\n')\n","language":"Python"},{"code":"'''Tree traversals'''\n\nfrom itertools import chain\nfrom functools import reduce\nfrom operator import mul\n\n\n# foldTree :: (a -> [b] -> b) -> Tree a -> b\ndef foldTree(f):\n '''The catamorphism on trees. A summary\n value defined by a depth-first fold.\n '''\n def go(node):\n return f(root(node))([\n go(x) for x in nest(node)\n ])\n return go\n\n\n# levels :: Tree a -> [[a]]\ndef levels(tree):\n '''A list of lists, grouping the root\n values of each level of the tree.\n '''\n def go(a, node):\n h, *t = a if a else ([], [])\n\n return [[root(node)] + h] + reduce(\n go, nest(node)[::-1], t\n )\n return go([], tree)\n\n\n# preorder :: a -> [[a]] -> [a]\ndef preorder(x):\n '''This node followed by the rest.'''\n return lambda xs: [x] + concat(xs)\n\n\n# inorder :: a -> [[a]] -> [a]\ndef inorder(x):\n '''Descendants of any first child,\n then this node, then the rest.'''\n return lambda xs: (\n xs[0] + [x] + concat(xs[1:]) if xs else [x]\n )\n\n\n# postorder :: a -> [[a]] -> [a]\ndef postorder(x):\n '''Descendants first, then this node.'''\n return lambda xs: concat(xs) + [x]\n\n\n# levelorder :: Tree a -> [a]\ndef levelorder(tree):\n '''Top-down concatenation of this node\n with the rows below.'''\n return concat(levels(tree))\n\n\n# treeSum :: Int -> [Int] -> Int\ndef treeSum(x):\n '''This node's value + the sum of its descendants.'''\n return lambda xs: x + sum(xs)\n\n\n# treeProduct :: Int -> [Int] -> Int\ndef treeProduct(x):\n '''This node's value * the product of its descendants.'''\n return lambda xs: x * numericProduct(xs)\n\n\n# treeMax :: Ord a => a -> [a] -> a\ndef treeMax(x):\n '''Maximum value of this node and any descendants.'''\n return lambda xs: max([x] + xs)\n\n\n# treeMin :: Ord a => a -> [a] -> a\ndef treeMin(x):\n '''Minimum value of this node and any descendants.'''\n return lambda xs: min([x] + xs)\n\n\n# nodeCount :: Int -> [Int] -> Int\ndef nodeCount(_):\n '''One more than the total number of descendants.'''\n return lambda xs: 1 + sum(xs)\n\n\n# treeWidth :: Int -> [Int] -> Int\ndef treeWidth(_):\n '''Sum of widths of any children, or a minimum of 1.'''\n return lambda xs: sum(xs) if xs else 1\n\n\n# treeDepth :: Int -> [Int] -> Int\ndef treeDepth(_):\n '''One more than that of the deepest child.'''\n return lambda xs: 1 + (max(xs) if xs else 0)\n\n\n# ------------------------- TEST -------------------------\n# main :: IO ()\ndef main():\n '''Tree traversals - accumulating and folding'''\n\n # tree :: Tree Int\n tree = Node(1)([\n Node(2)([\n Node(4)([\n Node(7)([])\n ]),\n Node(5)([])\n ]),\n Node(3)([\n Node(6)([\n Node(8)([]),\n Node(9)([])\n ])\n ])\n ])\n\n print(\n fTable(main.__doc__ + ':\\n')(fName)(str)(\n lambda f: (\n foldTree(f) if 'levelorder' != fName(f) else f\n )(tree)\n )([\n preorder, inorder, postorder, levelorder,\n treeSum, treeProduct, treeMin, treeMax,\n nodeCount, treeWidth, treeDepth\n ])\n )\n\n\n# ----------------------- GENERIC ------------------------\n\n# Node :: a -> [Tree a] -> Tree a\ndef Node(v):\n '''Contructor for a Tree node which connects a\n value of some kind to a list of zero or\n more child trees.'''\n return lambda xs: {\n 'type': 'Node', 'root': v, 'nest': xs\n }\n\n\n# nest :: Tree a -> [Tree a]\ndef nest(tree):\n '''Accessor function for children of tree node'''\n return tree['nest'] if 'nest' in tree else None\n\n\n# root :: Dict -> a\ndef root(tree):\n '''Accessor function for data of tree node'''\n return tree['root'] if 'root' in tree else None\n\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# numericProduct :: [Num] -> Num\ndef numericProduct(xs):\n '''The arithmetic product of all numbers in xs.'''\n return reduce(mul, xs, 1)\n\n\n# ---------------------- FORMATTING ----------------------\n\n# fName :: (a -> b) -> String\ndef fName(f):\n '''The name bound to the function.'''\n return f.__name__\n\n\n# fTable :: String -> (a -> String) ->\n# (b -> String) ->\n# (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: y.rjust(w, ' ') + (\n ' -> ' + fxShow(f(x))\n ),\n xs, ys\n ))\n return lambda xShow: lambda fxShow: (\n lambda f: lambda xs: go(\n xShow, fxShow, f, xs\n )\n )\n\n\nif __name__ == '__main__':\n main()\n","language":"Python"},{"code":"(set *tree* [1 [2 [4 [7]]\n [5]]\n [3 [6 [8]\n [9]]]])\n\n(define inorder\n [] -> []\n [V] -> [V]\n [V L] -> (append (inorder L)\n [V])\n [V L R] -> (append (inorder L)\n [V]\n (inorder R)))\n\n(define postorder\n [] -> []\n [V] -> [V]\n [V L] -> (append (postorder L)\n [V])\n [V L R] -> (append (postorder L)\n (postorder R)\n [V]))\n\n(define preorder\n [] -> []\n [V] -> [V]\n [V L] -> (append [V]\n (preorder L))\n [V L R] -> (append [V]\n (preorder L)\n (preorder R)))\n\n(define levelorder-0\n [] -> []\n [[] | Q] -> (levelorder-0 Q)\n [[V | LR] | Q] -> [V | (levelorder-0 (append Q LR))])\n\n(define levelorder\n Node -> (levelorder-0 [Node]))\n\n(preorder (value *tree*))\n(postorder (value *tree*))\n(inorder (value *tree*))\n(levelorder (value *tree*))\n","language":"Qi"},{"code":" [ this ] is nil ( --> [ )\n\n [ ' [ 1\n [ 2\n [ 4\n [ 7 nil nil ]\n nil ]\n [ 5 nil nil ] ]\n [ 3\n [ 6\n [ 8 nil nil ]\n [ 9 nil nil ] ]\n nil ] ] ] is tree ( --> [ )\n\n [ dup nil = iff drop done\n unpack swap rot\n echo sp\n recurse\n recurse ] is pre-order ( [ --> )\n\n [ dup nil = iff drop done\n unpack unrot\n recurse\n echo sp\n recurse ] is in-order ( [ --> )\n\n [ dup nil = iff drop done\n unpack swap\n recurse\n recurse\n echo sp ] is post-order ( [ --> )\n\n [ queue swap push\n [ dup empty?\n iff drop done\n pop\n dup nil = iff\n drop again\n unpack\n rot echo sp\n dip push push\n again ] ] is level-order ( [ --> )\n\n tree pre-order cr\n tree in-order cr\n tree post-order cr\n tree level-order cr\n","language":"Quackery"},{"code":"#lang racket\n\n(define the-tree ; Node: (list <data> <left> <right>)\n '(1 (2 (4 (7 #f #f) #f) (5 #f #f)) (3 (6 (8 #f #f) (9 #f #f)) #f)))\n\n(define (preorder tree visit)\n (let loop ([t tree])\n (when t (visit (car t)) (loop (cadr t)) (loop (caddr t)))))\n(define (inorder tree visit)\n (let loop ([t tree])\n (when t (loop (cadr t)) (visit (car t)) (loop (caddr t)))))\n(define (postorder tree visit)\n (let loop ([t tree])\n (when t (loop (cadr t)) (loop (caddr t)) (visit (car t)))))\n(define (levelorder tree visit)\n (let loop ([trees (list tree)])\n (unless (null? trees)\n ((compose1 loop (curry filter values) append*)\n (for/list ([t trees] #:when t) (visit (car t)) (cdr t))))))\n\n(define (run order)\n (printf \"~a:\" (object-name order))\n (order the-tree (?(x) (printf \" ~s\" x)))\n (newline))\n(for-each run (list preorder inorder postorder levelorder))\n","language":"Racket"},{"code":"class TreeNode {\n has TreeNode $.parent;\n has TreeNode $.left;\n has TreeNode $.right;\n has $.value;\n\n method pre-order {\n flat gather {\n take $.value;\n take $.left.pre-order if $.left;\n take $.right.pre-order if $.right\n }\n }\n\n method in-order {\n flat gather {\n take $.left.in-order if $.left;\n take $.value;\n take $.right.in-order if $.right;\n }\n }\n\n method post-order {\n flat gather {\n take $.left.post-order if $.left;\n take $.right.post-order if $.right;\n take $.value;\n }\n }\n\n method level-order {\n my TreeNode @queue = (self);\n flat gather while @queue.elems {\n my $n = @queue.shift;\n take $n.value;\n @queue.push($n.left) if $n.left;\n @queue.push($n.right) if $n.right;\n }\n }\n}\n\nmy TreeNode $root .= new( value => 1,\n left => TreeNode.new( value => 2,\n left => TreeNode.new( value => 4, left => TreeNode.new(value => 7)),\n right => TreeNode.new( value => 5)\n ),\n right => TreeNode.new( value => 3,\n left => TreeNode.new( value => 6,\n left => TreeNode.new(value => 8),\n right => TreeNode.new(value => 9)\n )\n )\n );\n\nsay \"preorder: \",$root.pre-order.join(\" \");\nsay \"inorder: \",$root.in-order.join(\" \");\nsay \"postorder: \",$root.post-order.join(\" \");\nsay \"levelorder:\",$root.level-order.join(\" \");\n","language":"Raku"},{"code":"tree: [1 [2 [4 [7 [] []] []] [5 [] []]] [3 [6 [8 [] []] [9 [] []]] []]]\n; \"compacted\" version\ntree: [1 [2 [4 [7 ] ] [5 ]] [3 [6 [8 ] [9 ]] ]]\n\nvisit: func [tree [block!]][prin rejoin [first tree \" \"]]\nleft: :second\nright: :third\n\npreorder: func [tree [block!]][\n\tif not empty? tree [visit tree]\n\tattempt [preorder left tree]\n\tattempt [preorder right tree]\n]\nprin \"preorder: \" preorder tree\nprint \"\"\n\ninorder: func [tree [block!]][\n\tattempt [inorder left tree]\n\tif not empty? tree [visit tree]\n\tattempt [inorder right tree]\n]\nprin \"inorder: \" inorder tree\nprint \"\"\n\npostorder: func [tree [block!]][\n\tattempt [postorder left tree]\n\tattempt [postorder right tree]\n\tif not empty? tree [visit tree]\n]\nprin \"postorder: \" postorder tree\nprint \"\"\n\nqueue: []\nenqueue: func [tree [block!]][append/only queue tree]\ndequeue: func [queue [block!]][take queue]\nlevel-order: func [tree [block!]][\n\tclear head queue\n\tqueue: enqueue tree\n\twhile [not empty? queue] [\n\t\ttree: dequeue queue\n\t\tif not empty? tree [visit tree]\n\t\tattempt [enqueue left tree]\n\t\tattempt [enqueue right tree]\n\t]\n]\nprin \"level-order: \" level-order tree\n","language":"REBOL"},{"code":"$ENTRY Go {\n = <Show Preorder <Tree>>\n <Show Inorder <Tree>>\n <Show Postorder <Tree>>\n <Show Levelorder <Tree>>;\n};\n\nShow {\n s.F t.T = <Prout s.F ': ' <Mu s.F t.T>>;\n};\n\nTree {\n = (1 (2 (4 (7 () ()) ()) (5 () ())) (3 (6 (8 () ()) (9 () ())) ()));\n};\n\nPreorder {\n () = ;\n (s.V t.L t.R) = s.V <Preorder t.L> <Preorder t.R>;\n};\n\nInorder {\n () = ;\n (s.V t.L t.R) = <Inorder t.L> s.V <Inorder t.R>;\n};\n\nPostorder {\n () = ;\n (s.V t.L t.R) = <Postorder t.L> <Postorder t.R> s.V;\n};\n\nLevelorder {\n = ;\n () e.Q = <Levelorder e.Q>;\n (s.V t.L t.R) e.Q = s.V <Levelorder e.Q t.L t.R>;\n};\n","language":"Refal"},{"code":"/* REXX ***************************************************************\n* Tree traversal\n= 1\n= / \\\n= / \\\n= / \\\n= 2 3\n= / \\ /\n= 4 5 6\n= / / \\\n= 7 8 9\n=\n= The correct output should look like this:\n= preorder: 1 2 4 7 5 3 6 8 9\n= level-order: 1 2 3 4 5 6 7 8 9\n= postorder: 7 4 5 2 8 9 6 3 1\n= inorder: 7 4 2 5 1 8 6 9 3\n\n* 17.06.2012 Walter Pachl not thoroughly tested\n**********************************************************************/\ndebug=0\nwl_soll=1 2 4 7 5 3 6 8 9\nil_soll=7 4 2 5 1 8 6 9 3\npl_soll=7 4 5 2 8 9 6 3 1\nll_soll=1 2 3 4 5 6 7 8 9\n\nCall mktree\nwl.=''; wl='' /* preorder */\nll.=''; ll='' /* level-order */\n il='' /* inorder */\n pl='' /* postorder */\n\n/**********************************************************************\n* First walk the tree and construct preorder and level-order lists\n**********************************************************************/\ndone.=0\nlvl=1\nz=root\nCall note z\nDo Until z=0\n z=go_next(z)\n Call note z\n End\nCall show 'preorder: ',wl,wl_soll\nDo lvl=1 To 4\n ll=ll ll.lvl\n End\nCall show 'level-order:',ll,ll_soll\n\n/**********************************************************************\n* Next construct postorder list\n**********************************************************************/\ndone.=0\nridone.=0\nz=lbot(root)\nCall notep z\nDo Until z=0\n br=brother(z)\n If br>0 &,\n done.br=0 Then Do\n ridone.br=1\n z=lbot(br)\n Call notep z\n End\n Else\n z=father(z)\n Call notep z\n End\nCall show 'postorder: ',pl,pl_soll\n\n/**********************************************************************\n* Finally construct inorder list\n**********************************************************************/\ndone.=0\nridone.=0\nz=lbot(root)\nCall notei z\nDo Until z=0\n z=father(z)\n Call notei z\n ri=node.z.0rite\n If ridone.z=0 Then Do\n ridone.z=1\n If ri>0 Then Do\n z=lbot(ri)\n Call notei z\n End\n End\n End\n\n/**********************************************************************\n* And now show the results and check them for correctness\n**********************************************************************/\nCall show 'inorder: ',il,il_soll\n\nExit\n\nshow: Parse Arg Which,have,soll\n/**********************************************************************\n* Show our result and show it it's correct\n**********************************************************************/\nhave=space(have)\nIf have=soll Then\n tag=''\nElse\n tag='*wrong*'\nSay which have tag\nIf tag<>'' Then\n Say '------------>'soll 'is the expected result'\nReturn\n\nbrother: Procedure Expose node.\n/**********************************************************************\n* Return the right node of this node's father or 0\n**********************************************************************/\n Parse arg no\n nof=node.no.0father\n brot1=node.nof.0rite\n Return brot1\n\nnotei: Procedure Expose debug il done.\n/**********************************************************************\n* append the given node to il\n**********************************************************************/\n Parse Arg nd\n If nd<>0 &,\n done.nd=0 Then\n il=il nd\n If debug Then\n Say 'notei' nd\n done.nd=1\n Return\n\nnotep: Procedure Expose debug pl done.\n/**********************************************************************\n* append the given node to pl\n**********************************************************************/\n Parse Arg nd\n If nd<>0 &,\n done.nd=0 Then Do\n pl=pl nd\n If debug Then\n Say 'notep' nd\n End\n done.nd=1\n Return\n\nfather: Procedure Expose node.\n/**********************************************************************\n* Return the father of the argument\n* or 0 if the root is given as argument\n**********************************************************************/\n Parse Arg nd\n Return node.nd.0father\n\nlbot: Procedure Expose node.\n/**********************************************************************\n* From node z: Walk down on the left side until you reach the bottom\n* and return the bottom node\n* If z has no left son (at the bottom of the tree) returm itself\n**********************************************************************/\n Parse Arg z\n Do i=1 To 100\n If node.z.0left<>0 Then\n z=node.z.0left\n Else\n Leave\n End\n Return z\n\nnote:\n/**********************************************************************\n* add the node to the preorder list unless it's already there\n* add the node to the level list\n**********************************************************************/\n If z<>0 &, /* it's a node */\n done.z=0 Then Do /* not yet done */\n wl=wl z /* add it to the preorder list*/\n ll.lvl=ll.lvl z /* add it to the level list */\n done.z=1 /* remember it's done */\n End\n Return\n\ngo_next: Procedure Expose node. lvl\n/**********************************************************************\n* find the next node to visit in the treewalk\n**********************************************************************/\n next=0\n Parse arg z\n If node.z.0left<>0 Then Do /* there is a left son */\n If node.z.0left.done=0 Then Do /* we have not visited it */\n next=node.z.0left /* so we go there */\n node.z.0left.done=1 /* note we were here */\n lvl=lvl+1 /* increase the level */\n End\n End\n If next=0 Then Do /* not moved yet */\n If node.z.0rite<>0 Then Do /* there is a right son */\n If node.z.0rite.done=0 Then Do /* we have not visited it */\n next=node.z.0rite /* so we go there */\n node.z.0rite.done=1 /* note we were here */\n lvl=lvl+1 /* increase the level */\n End\n End\n End\n If next=0 Then Do /* not moved yet */\n next=node.z.0father /* go to the father */\n lvl=lvl-1 /* decrease the level */\n End\n Return next /* that's the next node */\n /* or zero if we are done */\n\nmknode: Procedure Expose node.\n/**********************************************************************\n* create a new node\n**********************************************************************/\n Parse Arg name\n z=node.0+1\n node.z.0name=name\n node.z.0father=0\n node.z.0left =0\n node.z.0rite =0\n node.0=z\n Return z /* number of the node just created */\n\nattleft: Procedure Expose node.\n/**********************************************************************\n* make son the left son of father\n**********************************************************************/\n Parse Arg son,father\n node.son.0father=father\n z=node.father.0left\n If z<>0 Then Do\n node.z.0father=son\n node.son.0left=z\n End\n node.father.0left=son\n Return\n\nattrite: Procedure Expose node.\n/**********************************************************************\n* make son the right son of father\n**********************************************************************/\n Parse Arg son,father\n node.son.0father=father\n z=node.father.0rite\n If z<>0 Then Do\n node.z.0father=son\n node.son.0rite=z\n End\n node.father.0rite=son\n le=node.father.0left\n If le>0 Then\n node.le.0brother=node.father.0rite\n Return\n\nmktree: Procedure Expose node. root\n/**********************************************************************\n* build the tree according to the task\n**********************************************************************/\n node.=0\n a=mknode('A'); root=a\n b=mknode('B'); Call attleft b,a\n c=mknode('C'); Call attrite c,a\n d=mknode('D'); Call attleft d,b\n e=mknode('E'); Call attrite e,b\n f=mknode('F'); Call attleft f,c\n g=mknode('G'); Call attleft g,d\n h=mknode('H'); Call attleft h,f\n i=mknode('I'); Call attrite i,f\n Call show_tree 1\n Return\n\nshow_tree: Procedure Expose node.\n/**********************************************************************\n* Show the tree\n* f\n* l1 1 r1\n* l r l r\n* l r l r l r l r\n* 12345678901234567890\n**********************************************************************/\n Parse Arg f\n l.=''\n l.1=overlay(f ,l.1, 9)\n\n l1=node.f.0left ;l.2=overlay(l1 ,l.2, 5)\n/*b1=node.f.0brother ;l.2=overlay(b1 ,l.2, 9) */\n r1=node.f.0rite ;l.2=overlay(r1 ,l.2,13)\n\n l1g=node.l1.0left ;l.3=overlay(l1g ,l.3, 3)\n/*b1g=node.l1.0brother ;l.3=overlay(b1g ,l.3, 5) */\n r1g=node.l1.0rite ;l.3=overlay(r1g ,l.3, 7)\n\n l2g=node.r1.0left ;l.3=overlay(l2g ,l.3,11)\n/*b2g=node.r1.0brother ;l.3=overlay(b2g ,l.3,13) */\n r2g=node.r1.0rite ;l.3=overlay(r2g ,l.3,15)\n\n l1ls=node.l1g.0left ;l.4=overlay(l1ls,l.4, 2)\n/*b1ls=node.l1g.0brother ;l.4=overlay(b1ls,l.4, 3) */\n r1ls=node.l1g.0rite ;l.4=overlay(r1ls,l.4, 4)\n\n l1rs=node.r1g.0left ;l.4=overlay(l1rs,l.4, 6)\n/*b1rs=node.r1g.0brother ;l.4=overlay(b1rs,l.4, 7) */\n r1rs=node.r1g.0rite ;l.4=overlay(r1rs,l.4, 8)\n\n l2ls=node.l2g.0left ;l.4=overlay(l2ls,l.4,10)\n/*b2ls=node.l2g.0brother ;l.4=overlay(b2ls,l.4,11) */\n r2ls=node.l2g.0rite ;l.4=overlay(r2ls,l.4,12)\n\n l2rs=node.r2g.0left ;l.4=overlay(l2rs,l.4,14)\n/*b2rs=node.r2g.0brother ;l.4=overlay(b2rs,l.4,15) */\n r2rs=node.r2g.0rite ;l.4=overlay(r2rs,l.4,16)\n Do i=1 To 4\n Say translate(l.i,' ','0')\n Say ''\n End\n Return\n","language":"REXX"},{"code":"BinaryTreeNode = Struct.new(:value, :left, :right) do\n def self.from_array(nested_list)\n value, left, right = nested_list\n if value\n self.new(value, self.from_array(left), self.from_array(right))\n end\n end\n\n def walk_nodes(order, &block)\n order.each do |node|\n case node\n when :left then left && left.walk_nodes(order, &block)\n when :self then yield self\n when :right then right && right.walk_nodes(order, &block)\n end\n end\n end\n\n def each_preorder(&b) walk_nodes([:self, :left, :right], &b) end\n def each_inorder(&b) walk_nodes([:left, :self, :right], &b) end\n def each_postorder(&b) walk_nodes([:left, :right, :self], &b) end\n\n def each_levelorder\n queue = [self]\n until queue.empty?\n node = queue.shift\n yield node\n queue << node.left if node.left\n queue << node.right if node.right\n end\n end\nend\n\nroot = BinaryTreeNode.from_array [1, [2, [4, 7], [5]], [3, [6, [8], [9]]]]\n\nBinaryTreeNode.instance_methods.select{|m| m=~/.+order/}.each do |mthd|\n printf \"%-11s \", mthd[5..-1] + ':'\n root.send(mthd) {|node| print \"#{node.value} \"}\n puts\nend\n","language":"Ruby"},{"code":"#![feature(box_syntax, box_patterns)]\n\nuse std::collections::VecDeque;\n\n#[derive(Debug)]\nstruct TreeNode<T> {\n value: T,\n left: Option<Box<TreeNode<T>>>,\n right: Option<Box<TreeNode<T>>>,\n}\n\nenum TraversalMethod {\n PreOrder,\n InOrder,\n PostOrder,\n LevelOrder,\n}\n\nimpl<T> TreeNode<T> {\n pub fn new(arr: &[[i8; 3]]) -> TreeNode<i8> {\n\n let l = match arr[0][1] {\n -1 => None,\n i @ _ => Some(Box::new(TreeNode::<i8>::new(&arr[(i - arr[0][0]) as usize..]))),\n };\n let r = match arr[0][2] {\n -1 => None,\n i @ _ => Some(Box::new(TreeNode::<i8>::new(&arr[(i - arr[0][0]) as usize..]))),\n };\n\n TreeNode {\n value: arr[0][0],\n left: l,\n right: r,\n }\n }\n\n pub fn traverse(&self, tr: &TraversalMethod) -> Vec<&TreeNode<T>> {\n match tr {\n &TraversalMethod::PreOrder => self.iterative_preorder(),\n &TraversalMethod::InOrder => self.iterative_inorder(),\n &TraversalMethod::PostOrder => self.iterative_postorder(),\n &TraversalMethod::LevelOrder => self.iterative_levelorder(),\n }\n }\n\n fn iterative_preorder(&self) -> Vec<&TreeNode<T>> {\n let mut stack: Vec<&TreeNode<T>> = Vec::new();\n let mut res: Vec<&TreeNode<T>> = Vec::new();\n\n stack.push(self);\n while !stack.is_empty() {\n let node = stack.pop().unwrap();\n res.push(node);\n match node.right {\n None => {}\n Some(box ref n) => stack.push(n),\n }\n match node.left {\n None => {}\n Some(box ref n) => stack.push(n),\n }\n }\n res\n }\n\n // Leftmost to rightmost\n fn iterative_inorder(&self) -> Vec<&TreeNode<T>> {\n let mut stack: Vec<&TreeNode<T>> = Vec::new();\n let mut res: Vec<&TreeNode<T>> = Vec::new();\n let mut p = self;\n\n loop {\n // Stack parents and right children while left-descending\n loop {\n match p.right {\n None => {}\n Some(box ref n) => stack.push(n),\n }\n stack.push(p);\n match p.left {\n None => break,\n Some(box ref n) => p = n,\n }\n }\n // Visit the nodes with no right child\n p = stack.pop().unwrap();\n while !stack.is_empty() && p.right.is_none() {\n res.push(p);\n p = stack.pop().unwrap();\n }\n // First node that can potentially have a right child:\n res.push(p);\n if stack.is_empty() {\n break;\n } else {\n p = stack.pop().unwrap();\n }\n }\n res\n }\n\n // Left-to-right postorder is same sequence as right-to-left preorder, reversed\n fn iterative_postorder(&self) -> Vec<&TreeNode<T>> {\n let mut stack: Vec<&TreeNode<T>> = Vec::new();\n let mut res: Vec<&TreeNode<T>> = Vec::new();\n\n stack.push(self);\n while !stack.is_empty() {\n let node = stack.pop().unwrap();\n res.push(node);\n match node.left {\n None => {}\n Some(box ref n) => stack.push(n),\n }\n match node.right {\n None => {}\n Some(box ref n) => stack.push(n),\n }\n }\n let rev_iter = res.iter().rev();\n let mut rev: Vec<&TreeNode<T>> = Vec::new();\n for elem in rev_iter {\n rev.push(elem);\n }\n rev\n }\n\n fn iterative_levelorder(&self) -> Vec<&TreeNode<T>> {\n let mut queue: VecDeque<&TreeNode<T>> = VecDeque::new();\n let mut res: Vec<&TreeNode<T>> = Vec::new();\n\n queue.push_back(self);\n while !queue.is_empty() {\n let node = queue.pop_front().unwrap();\n res.push(node);\n match node.left {\n None => {}\n Some(box ref n) => queue.push_back(n),\n }\n match node.right {\n None => {}\n Some(box ref n) => queue.push_back(n),\n }\n }\n res\n }\n}\n\nfn main() {\n // Array representation of task tree\n let arr_tree = [[1, 2, 3],\n [2, 4, 5],\n [3, 6, -1],\n [4, 7, -1],\n [5, -1, -1],\n [6, 8, 9],\n [7, -1, -1],\n [8, -1, -1],\n [9, -1, -1]];\n\n let root = TreeNode::<i8>::new(&arr_tree);\n\n for method_label in [(TraversalMethod::PreOrder, \"pre-order:\"),\n (TraversalMethod::InOrder, \"in-order:\"),\n (TraversalMethod::PostOrder, \"post-order:\"),\n (TraversalMethod::LevelOrder, \"level-order:\")]\n .iter() {\n print!(\"{}\\t\", method_label.1);\n for n in root.traverse(&method_label.0) {\n print!(\" {}\", n.value);\n }\n print!(\"\\n\");\n }\n}\n","language":"Rust"},{"code":"case class IntNode(value: Int, left: Option[IntNode] = None, right: Option[IntNode] = None) {\n\n def preorder(f: IntNode => Unit) {\n f(this)\n left.map(_.preorder(f)) // Same as: if(left.isDefined) left.get.preorder(f)\n right.map(_.preorder(f))\n }\n\n def postorder(f: IntNode => Unit) {\n left.map(_.postorder(f))\n right.map(_.postorder(f))\n f(this)\n }\n\n def inorder(f: IntNode => Unit) {\n left.map(_.inorder(f))\n f(this)\n right.map(_.inorder(f))\n }\n\n def levelorder(f: IntNode => Unit) {\n\n def loVisit(ls: List[IntNode]): Unit = ls match {\n case Nil => None\n case node :: rest => f(node); loVisit(rest ++ node.left ++ node.right)\n }\n\n loVisit(List(this))\n }\n}\n\nobject TreeTraversal extends App {\n implicit def intNode2SomeIntNode(n: IntNode) = Some[IntNode](n)\n\n val tree = IntNode(1,\n IntNode(2,\n IntNode(4,\n IntNode(7)),\n IntNode(5)),\n IntNode(3,\n IntNode(6,\n IntNode(8),\n IntNode(9))))\n\n List(\n \" preorder: \" -> tree.preorder _, // `_` denotes the function value of type `IntNode => Unit` (returning nothing)\n \" inorder: \" -> tree.inorder _,\n \" postorder: \" -> tree.postorder _,\n \"levelorder: \" -> tree.levelorder _) foreach {\n case (name, func) =>\n val s = new StringBuilder(name)\n func(n => s ++= n.value.toString + \" \")\n println(s)\n }\n}\n","language":"Scala"},{"code":"(define (preorder tree)\n (if (null? tree)\n '()\n (append (list (car tree))\n (preorder (cadr tree))\n (preorder (caddr tree)))))\n\n(define (inorder tree)\n (if (null? tree)\n '()\n (append (inorder (cadr tree))\n (list (car tree))\n (inorder (caddr tree)))))\n\n(define (postorder tree)\n (if (null? tree)\n '()\n (append (postorder (cadr tree))\n (postorder (caddr tree))\n (list (car tree)))))\n\n(define (level-order tree)\n (define lst '())\n (define (traverse nodes)\n (if (pair? nodes)\n (let ((next-nodes '()))\n (do ((p nodes (cdr p)))\n ((null? p))\n (set! lst (cons (caar p) lst))\n (let* ((n '())\n (n (if (null? (cadar p))\n n\n (cons (cadar p) n)))\n (n (if (null? (caddar p))\n n\n (cons (caddar p) n))))\n (set! next-nodes (append n next-nodes))))\n (traverse (reverse next-nodes)))))\n (if (null? tree)\n '()\n (begin\n (traverse (list tree))\n (reverse lst))))\n\n(define (demonstration tree)\n (define (display-values lst)\n (do ((p lst (cdr p)))\n ((null? p))\n (display (car p))\n (if (pair? (cdr p))\n (display \" \")))\n (newline))\n (display \"preorder: \") (display-values (preorder tree))\n (display \"inorder: \") (display-values (inorder tree))\n (display \"postorder: \") (display-values (postorder tree))\n (display \"level-order: \") (display-values (level-order tree)))\n\n(define the-task-tree\n '(1 (2 (4 (7 () ())\n ())\n (5 () ()))\n (3 (6 (8 () ())\n (9 () ()))\n ())))\n\n(demonstration the-task-tree)\n","language":"Scheme"},{"code":"main(args(2)) :=\n \"preorder: \" ++ toString(preOrder(testTree)) ++\n \"\\ninoder: \" ++ toString(inOrder(testTree)) ++\n \"\\npostorder: \" ++ toString(postOrder(testTree)) ++\n \"\\nlevel-order: \" ++ toString(levelOrder(testTree));\n\nNode ::= (value : int, left : Node, right : Node);\n\npreOrder(n) := [n.value] ++\n (preOrder(n.left) when isDefined(n, left) else []) ++\n (preOrder(n.right) when isDefined(n, right) else []);\n\ninOrder(n) := (inOrder(n.left) when isDefined(n, left) else []) ++\n [n.value] ++\n (inOrder(n.right) when isDefined(n, right) else []);\n\npostOrder(n) := (postOrder(n.left) when isDefined(n, left) else []) ++\n (postOrder(n.right) when isDefined(n, right) else []) ++\n [n.value];\n\nlevelOrder(n) := levelOrderHelper([n]);\nlevelOrderHelper(ns(1)) :=\n let\n n := head(ns);\n in\n [] when size(ns) = 0 else\n [n.value] ++ levelOrderHelper(tail(ns) ++\n ([n.left] when isDefined(n, left) else []) ++\n ([n.right] when isDefined(n, right) else []));\n\ntestTree :=\n (value : 1,\n left : (value : 2,\n left : (value : 4,\n left : (value : 7)),\n right : (value : 5)),\n right : (value : 3,\n left : (value : 6,\n left : (value : 8),\n right : (value : 9))\n )\n );\n","language":"SequenceL"},{"code":"program tree_traversal;\n tree := [1, [2, [4, [7]], [5]], [3, [6, [8], [9]]]];\n\n print(\"preorder \", preorder(tree));\n print(\"inorder \", inorder(tree));\n print(\"postorder \", postorder(tree));\n print(\"level-order \", levelorder(tree));\n\n proc preorder(tree);\n if tree = om then return []; end if;\n [item, left, right] := tree;\n return [item] + preorder(left) + preorder(right);\n end proc;\n\n proc inorder(tree);\n if tree = om then return []; end if;\n [item, left, right] := tree;\n return inorder(left) + [item] + inorder(right);\n end proc;\n\n proc postorder(tree);\n if tree = om then return []; end if;\n [item, left, right] := tree;\n return postorder(left) + postorder(right) + [item];\n end proc;\n\n proc levelorder(tree);\n items := [];\n loop init queue := [tree]; while queue /= [] do\n [item, left, right] fromb queue;\n items with:= item;\n if left /= om then queue with:= left; end if;\n if right /= om then queue with:= right; end if;\n end loop;\n return items;\n end proc;\nend program;\n","language":"SETL"},{"code":"func preorder(t) {\n t ? [t[0], __FUNC__(t[1])..., __FUNC__(t[2])...] : [];\n}\n\nfunc inorder(t) {\n t ? [__FUNC__(t[1])..., t[0], __FUNC__(t[2])...] : [];\n}\n\nfunc postorder(t) {\n t ? [__FUNC__(t[1])..., __FUNC__(t[2])..., t[0]] : [];\n}\n\nfunc depth(t) {\n var a = [t];\n var ret = [];\n while (a.len > 0) {\n var v = (a.shift \\\\ next);\n ret « v[0];\n a += [v[1,2]];\n };\n return ret;\n}\n\nvar x = [1,[2,[4,[7]],[5]],[3,[6,[8],[9]]]];\nsay \"pre: #{preorder(x)}\";\nsay \"in: #{inorder(x)}\";\nsay \"post: #{postorder(x)}\";\nsay \"depth: #{depth(x)}\";\n","language":"Sidef"},{"code":"\"Protocol: visiting\"\nEmptyNode>>accept: aVisitor\n\nEmptyNode>>accept: aVisitor with: anObject\n\t^anObject\n\n\"Protocol: enumerating\"\nEmptyNode>>traverse: aVisitorClass do: aBlock\n\t^self accept: (aVisitorClass block: aBlock)\n","language":"Smalltalk"},{"code":"\"Protocol: visiting\"\nNode>>accept: aVisitor\n\t^aVisitor visit: self\n\nNode>>accept: aVisitor with: anObject\n\t^aVisitor visit: self with: anObject\n\n\"Protocol: accessing\"\nNode>>data\n\t^data\n\nNode>>data: anObject\n\tdata := anObject\n\nNode>>left\n\t^left\n\nNode>>left: aNode\n\tleft := aNode\n\nNode>>right\n\t^right\n\nNode>>right: aNode\n\tright := aNode\n\n\"Protocol: initialize-release\"\nNode>>initialize\n\tsuper initialize.\n\tleft := right := EmptyNode new\n\n\"Class side\"\n\"Protocol: instance creation\"\nNode class>>data: anObject\n\t^self new data: anObject\n","language":"Smalltalk"},{"code":"\"Protocol: visiting\"\nvisit: aNode\n\tself subclassResponsibility\n\n\"Protocol: accessing\"\nVisitor>>block: anObject\n\tblock := anObject\n\n\"Protocol: initialize-release\"\nVisitor>>initialize\n\tsuper initialize.\n\tblock := [:node | ]\n\n\"Class side\"\n\"Protocol: instance creation\"\nVisitor class>>block: aBlock\n\t^self new block: aBlock\n","language":"Smalltalk"},{"code":"\"Protocol: visiting\"\nInOrder>>visit: aNode\n\taNode left accept: self.\n\tblock value: aNode.\n\taNode right accept: self\n","language":"Smalltalk"},{"code":"\"Protocol: visiting\"\nLevelOrder>>visit: aNode\n\t| queue |\n\tqueue := OrderedCollection with: aNode.\n\t[(queue removeFirst accept: self with: queue) isEmpty] whileFalse\n\nLevelOrder>>visit: aNode with: aQueue\n\tblock value: aNode.\n\t^aQueue\n\t\tadd: aNode left;\n\t\tadd: aNode right;\n\t\tyourself\n","language":"Smalltalk"},{"code":"\"Protocol: visiting\"\nPostOrder>>visit: aNode\n\taNode left accept: self.\n\taNode right accept: self.\n\tblock value: aNode\n","language":"Smalltalk"},{"code":"\"Protocol: visiting\"\nPreOrder>>visit: aNode\n\tblock value: aNode.\n\taNode left accept: self.\n\taNode right accept: self\n","language":"Smalltalk"},{"code":"| tree |\ntree := (Node data: 1)\n\t\tleft: ((Node data: 2)\n\t\t\tleft: ((Node data: 4)\n\t\t\t\tleft: (Node data: 7));\n\t\t\tright: (Node data: 5));\n\t\tright: ((Node data: 3)\n\t\t\tleft: ((Node data: 6)\n\t\t\t\tleft: (Node data: 8);\n\t\t\t\tright: (Node data: 9))).\ntree traverse: PreOrder do: [:node | Transcript print: node data; space].\nTranscript cr.\ntree traverse: InOrder do: [:node | Transcript print: node data; space].\nTranscript cr.\ntree traverse: PostOrder do: [:node | Transcript print: node data; space].\nTranscript cr.\ntree traverse: LevelOrder do: [:node | Transcript print: node data; space].\nTranscript cr.\n","language":"Smalltalk"},{"code":"class TreeNode<T> {\n let value: T\n let left: TreeNode?\n let right: TreeNode?\n\n init(value: T, left: TreeNode? = nil, right: TreeNode? = nil) {\n self.value = value\n self.left = left\n self.right = right\n }\n\n func preOrder(function: (T) -> Void) {\n function(value)\n if left != nil {\n left!.preOrder(function: function)\n }\n if right != nil {\n right!.preOrder(function: function)\n }\n }\n\n func inOrder(function: (T) -> Void) {\n if left != nil {\n left!.inOrder(function: function)\n }\n function(value)\n if right != nil {\n right!.inOrder(function: function)\n }\n }\n\n func postOrder(function: (T) -> Void) {\n if left != nil {\n left!.postOrder(function: function)\n }\n if right != nil {\n right!.postOrder(function: function)\n }\n function(value)\n }\n\n func levelOrder(function: (T) -> Void) {\n var queue: [TreeNode] = []\n queue.append(self)\n while queue.count > 0 {\n let node = queue.removeFirst()\n function(node.value)\n if node.left != nil {\n queue.append(node.left!)\n }\n if node.right != nil {\n queue.append(node.right!)\n }\n }\n }\n}\n\ntypealias Node = TreeNode<Int>\n\nlet n = Node(value: 1,\n left: Node(value: 2,\n left: Node(value: 4,\n left: Node(value: 7)),\n right: Node(value: 5)),\n right: Node(value: 3,\n left: Node(value: 6,\n left: Node(value: 8),\n right: Node(value: 9))))\n\nlet fn = { print($0, terminator: \" \") }\n\nprint(\"pre-order: \", terminator: \"\")\nn.preOrder(function: fn)\nprint()\n\nprint(\"in-order: \", terminator: \"\")\nn.inOrder(function: fn)\nprint()\n\nprint(\"post-order: \", terminator: \"\")\nn.postOrder(function: fn)\nprint()\n\nprint(\"level-order: \", terminator: \"\")\nn.levelOrder(function: fn)\nprint()\n","language":"Swift"},{"code":"oo::class create tree {\n # Basic tree data structure stuff...\n variable val l r\n constructor {value {left {}} {right {}}} {\n\tset val $value\n\tset l $left\n\tset r $right\n }\n method value {} {return $val}\n method left {} {return $l}\n method right {} {return $r}\n destructor {\n\tif {$l ne \"\"} {$l destroy}\n\tif {$r ne \"\"} {$r destroy}\n }\n\n # Traversal methods\n method preorder {varName script {level 0}} {\n\tupvar [incr level] $varName var\n\tset var $val\n\tuplevel $level $script\n\tif {$l ne \"\"} {$l preorder $varName $script $level}\n\tif {$r ne \"\"} {$r preorder $varName $script $level}\n }\n method inorder {varName script {level 0}} {\n\tupvar [incr level] $varName var\n\tif {$l ne \"\"} {$l inorder $varName $script $level}\n\tset var $val\n\tuplevel $level $script\n\tif {$r ne \"\"} {$r inorder $varName $script $level}\n }\n method postorder {varName script {level 0}} {\n\tupvar [incr level] $varName var\n\tif {$l ne \"\"} {$l postorder $varName $script $level}\n\tif {$r ne \"\"} {$r postorder $varName $script $level}\n\tset var $val\n\tuplevel $level $script\n }\n method levelorder {varName script} {\n\tupvar 1 $varName var\n\tset nodes [list [self]]; # A queue of nodes to process\n\twhile {[llength $nodes] > 0} {\n\t set nodes [lassign $nodes n]\n\t set var [$n value]\n\t uplevel 1 $script\n\t if {[$n left] ne \"\"} {lappend nodes [$n left]}\n\t if {[$n right] ne \"\"} {lappend nodes [$n right]}\n\t}\n }\n}\n","language":"Tcl"},{"code":"# Helpers to make construction and listing of a whole tree simpler\nproc Tree nested {\n lassign $nested v l r\n if {$l ne \"\"} {set l [Tree $l]}\n if {$r ne \"\"} {set r [Tree $r]}\n tree new $v $l $r\n}\nproc Listify {tree order} {\n set list {}\n $tree $order v {\n\tlappend list $v\n }\n return $list\n}\n\n# Make a tree, print it a few ways, and destroy the tree\nset t [Tree {1 {2 {4 7} 5} {3 {6 8 9}}}]\nputs \"preorder: [Listify $t preorder]\"\nputs \"inorder: [Listify $t inorder]\"\nputs \"postorder: [Listify $t postorder]\"\nputs \"level-order: [Listify $t levelorder]\"\n$t destroy\n","language":"Tcl"},{"code":"left=()\nright=()\nvalue=()\n\n# node node#, left#, right#, value\n#\n# if value is empty, use node#\n\nnode() {\n nx=${1:-'Missing node index'}\n leftx=${2}\n rightx=${3}\n val=${4:-$1}\n value[$nx]=\"$val\"\n left[$nx]=\"$leftx\"\n right[$nx]=\"$rightx\"\n}\n\n# define the tree\n\nnode 1 2 3\nnode 2 4 5\nnode 3 6\nnode 4 7\nnode 5\nnode 6 8 9\nnode 7\nnode 8\nnode 9\n\n# walk NODE# ORDER\n\nwalk() {\n local nx=${1-\"Missing index\"}\n shift\n for branch in \"$@\" ; do\n case \"$branch\" in\n left) if [[ \"${left[$nx]}\" ]]; then walk ${left[$nx]} $@ ; fi ;;\n right) if [[ \"${right[$nx]}\" ]]; then walk ${right[$nx]} $@ ; fi ;;\n self) printf \"%d \" \"${value[$nx]}\" ;;\n esac\n done\n}\n\napush() {\n local var=\"$1\"\n eval \"$var=( \\\"\\${$var[@]}\\\" \\\"$2\\\" )\"\n}\n\nshowname() {\n printf \"%-12s \" \"$1:\"\n}\n\nshowdata() {\n showname \"$1\"\n shift\n walk \"$@\"\n echo ''\n}\n\npreorder() { showdata $FUNCNAME $1 self left right ; }\ninorder() { showdata $FUNCNAME $1 left self right ; }\npostorder() { showdata $FUNCNAME $1 left right self ; }\nlevelorder() {\n showname 'level-order'\n queue=( $1 )\n x=0\n while [[ $x < ${#queue[*]} ]]; do\n value=\"${queue[$x]}\"\n printf \"%d \" \"$value\"\n for more in \"${left[$value]}\" \"${right[$value]}\" ; do\n if [[ -n \"$more\" ]]; then\n\tapush queue \"$more\"\n fi\n done\n : $((x++))\n done\n echo ''\n}\n\npreorder 1\ninorder 1\npostorder 1\nlevelorder 1\n","language":"UNIX-Shell"},{"code":"preorder: 1 2 4 7 5 3 6 8 9\ninorder: 7 4 2 5 1 8 6 9 3\npostorder: 7 4 5 2 8 9 6 3 1\nlevel-order: 1 2 3 4 5 6 7 8 9\n","language":"UNIX-Shell"},{"code":"tree =\n\n1^:<\n 2^: <4^: <7^: <>, 0>, 5^: <>>,\n 3^: <6^: <8^: <>, 9^: <>>, 0>>\n\npre = ~&dvLPCo\npost = ~&vLPdNCTo\nin = ~&vvhPdvtL2CTiQo\nlev = ~&iNCaadSPfavSLiF3RTaq\n\n#cast %nLL\n\nmain = <.pre,in,post,lev> tree\n","language":"Ursala"},{"code":"Public Value As Integer\nPublic LeftChild As TreeItem\nPublic RightChild As TreeItem\n","language":"VBA"},{"code":"Dim tihead As TreeItem\n\nPrivate Function Add(v As Integer, left As TreeItem, right As TreeItem) As TreeItem\n Dim x As New TreeItem\n x.Value = v\n Set x.LeftChild = left\n Set x.RightChild = right\n Set Add = x\nEnd Function\n\nPrivate Sub Init()\n Set tihead = Add(1, _\n Add(2, _\n Add(4, _\n Add(7, Nothing, Nothing), _\n Nothing), _\n Add(5, Nothing, Nothing)), _\n Add(3, _\n Add(6, _\n Add(8, Nothing, Nothing), _\n Add(9, Nothing, Nothing)), _\n Nothing))\nEnd Sub\n\nPrivate Sub InOrder(ti As TreeItem)\n If Not ti Is Nothing Then\n Call InOrder(ti.LeftChild)\n Debug.Print ti.Value;\n Call InOrder(ti.RightChild)\n End If\nEnd Sub\n\nPrivate Sub PreOrder(ti As TreeItem)\n If Not ti Is Nothing Then\n Debug.Print ti.Value;\n Call PreOrder(ti.LeftChild)\n Call PreOrder(ti.RightChild)\n End If\nEnd Sub\n\nPrivate Sub PostOrder(ti As TreeItem)\n If Not ti Is Nothing Then\n Call PostOrder(ti.LeftChild)\n Call PostOrder(ti.RightChild)\n Debug.Print ti.Value;\n End If\nEnd Sub\n\nPrivate Sub LevelOrder(ti As TreeItem)\n Dim queue As Object\n Set queue = CreateObject(\"System.Collections.Queue\")\n queue.Enqueue ti\n Do While (queue.Count > 0)\n Set next_ = queue.Dequeue\n Debug.Print next_.Value;\n If Not next_.LeftChild Is Nothing Then queue.Enqueue next_.LeftChild\n If Not next_.RightChild Is Nothing Then queue.Enqueue next_.RightChild\n Loop\nEnd Sub\n\nPublic Sub Main()\n Init\n Debug.Print \"preorder: \";\n Call PreOrder(tihead)\n Debug.Print vbCrLf; \"inorder: \";\n Call InOrder(tihead)\n Debug.Print vbCrLf; \"postorder: \";\n Call PostOrder(tihead)\n Debug.Print vbCrLf; \"level-order: \";\n Call LevelOrder(tihead)\nEnd Sub\n","language":"VBA"},{"code":"' 1\n' / \\\n' / \\\n' / \\\n' 2 3\n' / \\ /\n' 4 5 6\n' / / \\\n' 7 8 9\n'with no pointers available, the binary tree has to be saved in an array\n' root at index 1\n' parent index is i\\2\n' children indexes are i*2 and i*2+1\n' a value of 0 denotes an empty branch\n\n Sub print(s):\n On Error Resume Next\n WScript.stdout.Write(s)\n If err= &h80070006& Then WScript.Echo \" Please run this script with CScript\": WScript.quit\n End Sub\n\n\n Sub inorder(i)\n If tree(i*2)<>0 Then inorder(i*2)\n print tree(i)& vbtab\n If tree(i*2+1)<>0 Then inorder(i*2+1)\n End Sub\n\n\n Sub preorder(i)\n print tree(i)& vbtab\n If tree(i*2)<>0 Then preorder(i*2)\n If tree(i*2+1)<>0 Then preorder(i*2+1)\n End Sub\n\n Sub postorder(i)\n If tree(i*2)<>0 Then postorder(i*2)\n If tree(i*2+1)<>0 Then postorder(i*2+1)\n print tree(i)& vbTab\n End Sub\n\n Sub levelorder(x)\n Dim i\n For i= 1 To UBound(tree)\n If tree(i)<>0 Then print tree(i)& vbTab\n Next\n End sub\n\nDim tree\n' 1 2 3 4 5 6 7 8 9 1011121314151617181920212223242526\n' 1 2 2 3 3 3 3 4 4 4 4 4 4 4 4\ntree=Array(0,1,2,3,4,5,6,0,7,0,0,0,8,9,0,0,0,0,0,0,0,0,0,0,0,0,0,0)\nprint vbCrLf & \"Preorder\" & vbcrlf\npreorder(1)\nprint vbCrLf & \"Inorder\" & vbcrlf\ninorder(1)\nprint vbCrLf & \"Postorder\" & vbcrlf\npostorder(1)\nprint vbCrLf & \"Levelorder\" & vbcrlf\nlevelorder(1)\n","language":"VBScript"},{"code":"class Node {\n construct new(v) {\n _v = v\n _left = null\n _right = null\n }\n\n value { _v }\n left { _left }\n right { _right}\n\n left =(n) { _left = n }\n right= (n) { _right = n }\n\n preOrder() {\n System.write(this)\n if (_left) _left.preOrder()\n if (_right) _right.preOrder()\n }\n\n inOrder() {\n if ( _left) _left.inOrder()\n System.write(this)\n if (_right) _right.inOrder()\n }\n\n postOrder() {\n if (_left) _left.postOrder()\n if (_right) _right.postOrder()\n System.write(this)\n }\n\n levelOrder() {\n var queue = [this]\n while (true) {\n var node = queue.removeAt(0)\n System.write(node)\n if (node.left) queue.add(node.left)\n if (node.right) queue.add(node.right)\n if (queue.isEmpty) break\n }\n }\n\n exec(name, f) {\n System.write(name)\n f.call(this)\n System.print()\n }\n\n toString { \" %(_v)\" }\n}\n\nvar nodes = List.filled(10, null)\nfor (i in 0..9) nodes[i] = Node.new(i)\nnodes[1].left = nodes[2]\nnodes[1].right = nodes[3]\nnodes[2].left = nodes[4]\nnodes[2].right = nodes[5]\nnodes[4].left = nodes[7]\nnodes[3].left = nodes[6]\nnodes[6].left = nodes[8]\nnodes[6].right = nodes[9]\n\nnodes[1].exec(\" preOrder:\", Fn.new { |n| n.preOrder() })\nnodes[1].exec(\" inOrder:\", Fn.new { |n| n.inOrder() })\nnodes[1].exec(\" postOrder:\", Fn.new { |n| n.postOrder() })\nnodes[1].exec(\"level-order:\", Fn.new { |n| n.levelOrder() })\n","language":"Wren"},{"code":"def \\Node\\ Left, Data, Right;\n\nproc PreOrder(Node); \\Traverse tree at Node in preorder\nint Node;\n[if Node # 0 then\n [IntOut(0, Node(Data)); ChOut(0, ^ );\n PreOrder(Node(Left));\n PreOrder(Node(Right));\n ];\n];\n\nproc InOrder(Node); \\Traverse tree at Node in inorder\nint Node;\n[if Node # 0 then\n [InOrder(Node(Left));\n IntOut(0, Node(Data)); ChOut(0, ^ );\n InOrder(Node(Right));\n ];\n];\n\nproc PostOrder(Node); \\Traverse tree at Node in postorder\nint Node;\n[if Node # 0 then\n [PostOrder(Node(Left));\n PostOrder(Node(Right));\n IntOut(0, Node(Data)); ChOut(0, ^ );\n ];\n];\n\nproc LevelOrder(Node); \\Traverse tree at Node in level-order\nint Node;\ndef S=100*3; \\size of queue (must be a multiple of 3 for wrap-around)\nint Q(S), \\queue (FIFO)\n F, E; \\fill and empty indexes\n\n proc EnQ(Node); \\Enqueue Node\n int Node;\n [Q(F):= Node(Left); F:= F+1;\n Q(F):= Node(Data); F:= F+1;\n Q(F):= Node(Right); F:= F+1;\n if F >= S then F:= 0;\n ];\n\n proc DeQ; \\Dequeue Node\n [Node(Left):= Q(E); E:= E+1;\n Node(Data):= Q(E); E:= E+1;\n Node(Right):= Q(E); E:= E+1;\n if E >= S then E:= 0;\n ];\n\n[F:= 0; E:= 0; \\empty queue\nEnQ(Node);\nwhile E # F do\n [DeQ;\n IntOut(0, Node(Data)); ChOut(0, ^ );\n if Node(Left) # 0 then\n EnQ(Node(Left));\n if Node(Right) # 0 then\n EnQ(Node(Right));\n ];\n];\n\nint Tree;\n[Tree:= [[ [[0,7,0],4,0], 2, [0,5,0]], 1, [ [[0,8,0], 6, [0,9,0]], 3, 0 ]];\nText(0, \"preorder: \"); PreOrder(Tree); CrLf(0);\nText(0, \"inorder: \"); InOrder(Tree); CrLf(0);\nText(0, \"postorder: \"); PostOrder(Tree); CrLf(0);\nText(0, \"level-order: \"); LevelOrder(Tree); CrLf(0);\n]\n","language":"XPL0"},{"code":"class Node{ var [mixin=Node]left,right; var v;\n fcn init(val,[Node]l=Void,[Node]r=Void) { v,left,right=vm.arglist }\n}\n\nclass BTree{ var [mixin=Node] root;\n fcn init(r){ root=r }\n const VISIT=Void, LEFT=\"left\", RIGHT=\"right\";\n fcn preOrder { traverse(VISIT,LEFT, RIGHT) }\n fcn inOrder { traverse(LEFT, VISIT,RIGHT) }\n fcn postOrder { traverse(LEFT, RIGHT,VISIT) }\n fcn [private] traverse(order){ //--> list of Nodes\n sink:=List();\n fcn(sink,[Node]n,order){\n if(n){ foreach o in (order){\n\t if(VISIT==o) sink.write(n);\n\t else self.fcn(sink,n.setVar(o),order); // actually get var, eg n.left\n\t }}\n }(sink,root,vm.arglist);\n sink\n }\n fcn levelOrder{ // breadth first\n sink:=List(); q:=List(root);\n while(q){\n n:=q.pop(0); l:=n.left; r:=n.right;\n\t sink.write(n);\n\t if(l) q.append(l);\n\t if(r) q.append(r);\n }\n sink\n }\n}\n","language":"Zkl"},{"code":"t:=BTree(Node(1,\n\t Node(2,\n\t Node(4,Node(7)),\n\t Node(5)),\n\t Node(3,\n\t Node(6, Node(8),Node(9)))));\n\nt.preOrder() .apply(\"v\").println(\" preorder\");\nt.inOrder() .apply(\"v\").println(\" inorder\");\nt.postOrder() .apply(\"v\").println(\" postorder\");\nt.levelOrder().apply(\"v\").println(\" level-order\");\n","language":"Zkl"}],"string":"[\n {\n \"code\": \"---\\ncategory:\\n- Recursion\\nfrom: http://rosettacode.org/wiki/Tree_traversal\\nnote: Data Structures\\n\",\n \"language\": \"00-META\"\n },\n {\n \"code\": \";Task:\\nImplement a binary tree where each node carries an integer, and implement:\\n:::* pre-order,\\n:::* in-order, \\n:::* post-order, and \\n:::* level-order [[wp:Tree traversal|traversal]]. \\n\\n\\nUse those traversals to output the following tree:\\n 1\\n / \\\\\\n / \\\\\\n / \\\\\\n 2 3\\n / \\\\ /\\n 4 5 6\\n / / \\\\\\n 7 8 9\\n\\nThe correct output should look like this:\\n preorder: 1 2 4 7 5 3 6 8 9\\n inorder: 7 4 2 5 1 8 6 9 3\\n postorder: 7 4 5 2 8 9 6 3 1\\n level-order: 1 2 3 4 5 6 7 8 9\\n\\n\\n;See also:\\n* Wikipedia article: [[wp:Tree traversal|Tree traversal]].\\n<br><br>\\n\",\n \"language\": \"00-TASK\"\n },\n {\n \"code\": \"T Node\\n Int data\\n Node? left\\n Node? right\\n\\n F (data, Node? left = N, Node? right = N)\\n .data = data\\n .left = left\\n .right = right\\n\\n F preorder(visitor) -> N\\n visitor(.data)\\n I .left != N\\n .left.preorder(visitor)\\n I .right != N\\n .right.preorder(visitor)\\n\\n F inorder(visitor) -> N\\n I .left != N\\n .left.inorder(visitor)\\n visitor(.data)\\n I .right != N\\n .right.inorder(visitor)\\n\\n F postorder(visitor) -> N\\n I .left != N\\n .left.postorder(visitor)\\n I .right != N\\n .right.postorder(visitor)\\n visitor(.data)\\n\\n F preorder2(&d, level = 0) -> N\\n d[level].append(.data)\\n I .left != N\\n .left.preorder2(d, level + 1)\\n I .right != N\\n .right.preorder2(d, level + 1)\\n\\n F levelorder(visitor)\\n DefaultDict[Int, [Int]] d\\n .preorder2(&d)\\n L(k) sorted(d.keys())\\n L(v) d[k]\\n visitor(v)\\n\\nV tree = Node(1,\\n Node(2,\\n Node(4,\\n Node(7, N, N),\\n N),\\n Node(5, N, N)),\\n Node(3,\\n Node(6,\\n Node(8, N, N),\\n Node(9, N, N)),\\n N))\\n\\nF printwithspace(Int i)\\n print(‘#. ’.format(i), end' ‘’)\\n\\nprint(‘ preorder: ’, end' ‘’)\\ntree.preorder(printwithspace)\\nprint()\\nprint(‘ inorder: ’, end' ‘’)\\ntree.inorder(printwithspace)\\nprint()\\nprint(‘ postorder: ’, end' ‘’)\\ntree.postorder(printwithspace)\\nprint()\\nprint(‘levelorder: ’, end' ‘’)\\ntree.levelorder(printwithspace)\\nprint()\\n\",\n \"language\": \"11l\"\n },\n {\n \"code\": \" org 100h\\n jmp demo\\n ;;; Traverse tree at DE according to method at BC.\\n ;;; Call routine at HL with DE=<value> for each value encounterd.\\ntravrs: shld trvcb+1 ; Store routine pointer\\n xchg ; Tree in HL\\n push b ; Jump to method BC\\n ret\\n ;;; Preorder traversal\\npreo: mov a,h\\n ora l\\n rz ; Null node = stop\\n mov e,m\\n inx h\\n mov d,m ; Load value\\n inx h\\n push h ; Handle value\\n call trvcb\\n pop h ; Left node\\n mov e,m\\n inx h\\n mov d,m\\n inx h\\n push h ; Save pointer\\n xchg\\n call preo\\n pop h\\n mov e,m\\n inx h ; Right node\\n mov d,m\\n xchg\\n jmp preo\\n ;;; Inorder traversal\\nino: mov a,h\\n ora l\\n rz ; Null node = stop\\n mov e,m\\n inx h\\n mov d,m ; Load value\\n inx h\\n push d ; Save value on stack\\n mov e,m\\n inx h\\n mov d,m\\n inx h ; Load left node\\n push h ; Save pointer on stack\\n xchg\\n call ino ; Traverse left node\\n pop h\\n pop d ; Get value\\n push h\\n call trvcb ; Handle value\\n pop h\\n mov e,m\\n inx h\\n mov d,m\\n xchg\\n jmp ino ; Traverse right node\\n ;;; Postorder traversal\\nposto: mov a,h\\n ora l\\n rz ; Null node = stop\\n mov e,m\\n inx h\\n mov d,m ; Load value\\n inx h\\n push d ; Keep value on stack\\n mov e,m\\n inx h\\n mov d,m\\n inx h ; Load left node\\n push h\\n xchg\\n call posto ; Traverse left node\\n pop h\\n mov e,m\\n inx h\\n mov d,m ; Load right node\\n xchg\\n call posto ; Traverse right node\\n pop d ; Get value from stack\\n jmp trvcb ; Handle value\\n ;;; Level-order traversal\\nlvlo: shld queue ; Store current node at beginning of queue\\n lxi h,queue ; HL = Queue start pointer\\n lxi b,queue+2 ; BC = Queue end pointer\\nlvllp: mov a,h ; When start == end, stop\\n cmp b\\n jnz lvlt ; Not equal\\n mov a,l\\n cmp c\\n rz ; Equal = stop\\nlvlt: mov e,m ; Load current node in DE\\n inx h\\n mov d,m\\n inx h\\n mov a,d ; Null node = ignore\\n ora e\\n jz lvllp\\n push h ; Keep queue start pointer\\n xchg ; HL = current node\\n mov e,m ; Load value into DE\\n inx h\\n mov d,m\\n inx h\\n push h ; Keep pointer to left and right nodes\\n push b ; And pointer to end of queue\\n call trvcb ; Handle value\\n pop b ; Restore pointer to end of queue\\n pop h ; Restore pointer to left and right nodes\\n mvi d,4 ; D = copy counter\\nlvlcp: mov a,m ; Copy left and right nodes to queue\\n stax b\\n inx h\\n inx b\\n dcr d\\n jnz lvlcp\\n pop h ; Restore queue stack pointer\\n jmp lvllp\\ntrvcb: jmp 0 ; Callback pointer\\n\\n ;;; Run examples\\ndemo: lhld 6 ; Move stack to top of memory\\n sphl\\n lxi h,0 ; So we can still RET out of the program\\n push h\\n lxi h,orders\\norder: mov e,m ; Get string\\n inx h\\n mov d,m\\n inx h\\n mov a,e ; 0 = done\\n ora d\\n rz\\n push h ; Print string\\n call print\\n pop h\\n mov c,m ; Load method in BC\\n inx h\\n mov b,m\\n inx h\\n push h\\n lxi d,tree ; Tree in DE\\n lxi h,cb ; Callback in HL\\n call travrs ; Traverse the tree\\n lxi d,nl\\n call print ; Newline\\n pop h ; Restore table pointer\\n jmp order\\n\\n ;;; Print the tree value. They're all <10 for the example, so we\\n ;;; don't need multiple digits.\\ncb: mvi a,'0'\\n add e\\n sta nstr\\n lxi d,nstr\\nprint: mvi c,9 ; CP/M print string call\\n jmp 5\\nnstr: db '* $'\\nnl: db 13,10,'$'\\n\\n ;;; Example tree\\ntree: dw 1, node2, node3\\nnode2: dw 2, node4, node5\\nnode3: dw 3, node6, 0\\nnode4: dw 4, node7, 0\\nnode5: dw 5, 0, 0\\nnode6: dw 6, node8, node9\\nnode7: dw 7, 0, 0\\nnode8: dw 8, 0, 0\\nnode9: dw 9, 0 ,0\\n\\n ;;; Table of names and orders\\norders: dw spreo,preo\\n dw sino,ino\\n dw sposto,posto\\n dw slvlo,lvlo\\n dw 0\\nspreo: db 'Preorder: $'\\nsino: db 'Inorder: $'\\nsposto: db 'Postorder: $'\\nslvlo: db 'Level-order: $'\\n\\nqueue: equ $ ; Put level-order queue on heap\\n\",\n \"language\": \"8080-Assembly\"\n },\n {\n \"code\": \" cpu 8086\\n org 100h\\nsection .text\\n jmp demo\\n ;;; Traverse tree at SI. Call routine at CX with values in AX.\\n ;;; CX must preserve BX, CX, SI, DI.\\n ;;; Preorder traversal\\npreo: test si,si\\n jz pdone ; Zero pointer = done\\n lodsw ; Load value\\n call cx ; Handle value\\n push si ; Keep value\\n mov si,[si] ; Load left node\\n call preo ; Traverse left node\\n pop si\\n mov si,[si+2] ; Load right node\\n jmp preo ; Traverse right node\\n ;;; Inorder traversal\\nino: test si,si\\n jz pdone ; Zero pointer = done\\n push si\\n mov si,[si+2] ; Load left node\\n call ino ; Traverse left node\\n pop si\\n lodsw ; Load value\\n call cx ; Handle value\\n mov si,[si+2] ; Load right node\\n jmp ino ; Traverse right node\\n ;;; Postorder traversal\\nposto: test si,si\\n jz pdone ; Zero pointer = done\\n push si\\n mov si,[si+2] ; Load left node\\n call posto ; Traverse left node\\n pop si\\n push si\\n mov si,[si+4] ; Load right node\\n call posto\\n pop si ; Load value\\n lodsw\\n jmp cx ; Handle value\\npdone: ret\\n ;;; Level-order traversal\\nlvlo: mov di,queue ; DI = queue end pointer\\n mov ax,si\\n mov si,di ; SI = queue start pointer\\n stosw\\n.step: cmp di,si ; If end == start, done\\n je pdone\\n lodsw ; Get next item\\n test ax,ax ; Null?\\n jz .step\\n mov bx,si ; Keep start pointer in BX\\n mov si,ax ; Load item\\n lodsw ; Get value\\n call cx ; Handle value\\n lodsw ; Copy nodes to queue\\n stosw\\n lodsw\\n stosw\\n mov si,bx ; Put start pointer back\\n jmp .step\\n\\n ;;; Demo code\\ndemo: mov si,orders\\n.loop: lodsw ; Load next order\\n test ax,ax\\n jz .done\\n mov dx,ax ; Print order name\\n mov ah,9\\n int 21h\\n lodsw ; Load order routine\\n mov bp,si ; Keep SI\\n mov si,tree ; Traverse the tree\\n mov cx,pdgt ; Printing the digits\\n call ax\\n mov si,bp\\n jmp .loop\\n.done: ret\\n\\n ;;; Callback: print single digit\\npdgt: add al,'0'\\n mov [.str],al\\n mov ah,9\\n mov dx,.str\\n int 21h\\n ret\\n.str: db '* $'\\n\\nsection .data\\n ;;; List of orders\\norders: dw .preo,preo\\n dw .ino,ino\\n dw .posto,posto\\n dw .lvlo,lvlo\\n dw 0\\n.preo: db 'Preorder: $'\\n.ino: db 13,10,'Inorder: $'\\n.posto: db 13,10,'Postorder: $'\\n.lvlo: db 13,10,'Level-order: $'\\n\\n ;;; Exampe tree\\ntree: dw 1,.n2,.n3\\n.n2: dw 2,.n4,.n5\\n.n3: dw 3,.n6,0\\n.n4: dw 4,.n7,0\\n.n5: dw 5,0,0\\n.n6: dw 6,.n8,.n9\\n.n7: dw 7,0,0\\n.n8: dw 8,0,0\\n.n9: dw 9,0,0\\n\\nsection .bss\\nqueue: resw 256\\n\",\n \"language\": \"8086-Assembly\"\n },\n {\n \"code\": \"/* ARM assembly AARCH64 Raspberry PI 3B */\\n/* program deftree64.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 NBVAL, 9\\n\\n/*******************************************/\\n/* Structures */\\n/********************************************/\\n/* structure tree */\\n .struct 0\\ntree_root: // root pointer\\n .struct tree_root + 8\\ntree_size: // number of element of tree\\n .struct tree_size + 8\\ntree_fin:\\n/* structure node tree */\\n .struct 0\\nnode_left: // left pointer\\n .struct node_left + 8\\nnode_right: // right pointer\\n .struct node_right + 8\\nnode_value: // element value\\n .struct node_value + 8\\nnode_fin:\\n/* structure queue*/\\n .struct 0\\nqueue_begin: // next pointer\\n .struct queue_begin + 8\\nqueue_end: // element value\\n .struct queue_end + 8\\nqueue_fin:\\n/* structure node queue */\\n .struct 0\\nqueue_node_next: // next pointer\\n .struct queue_node_next + 8\\nqueue_node_value: // element value\\n .struct queue_node_value + 8\\nqueue_node_fin:\\n/*******************************************/\\n/* Initialized data */\\n/*******************************************/\\n.data\\nszMessInOrder: .asciz \\\"inOrder :\\\\n\\\"\\nszMessPreOrder: .asciz \\\"PreOrder :\\\\n\\\"\\nszMessPostOrder: .asciz \\\"PostOrder :\\\\n\\\"\\nszMessLevelOrder: .asciz \\\"LevelOrder :\\\\n\\\"\\nszCarriageReturn: .asciz \\\"\\\\n\\\"\\n/* datas error display */\\nszMessErreur: .asciz \\\"Error detected.\\\\n\\\"\\n/* datas message display */\\nszMessResult: .ascii \\\"Element value : @ \\\\n\\\"\\n\\n/*******************************************/\\n/* UnInitialized data */\\n/*******************************************/\\n.bss\\n.align 4\\nsZoneConv: .skip 24\\nstTree: .skip tree_fin // place to structure tree\\nstQueue: .skip queue_fin // place to structure queue\\n/*******************************************/\\n/* code section */\\n/*******************************************/\\n.text\\n.global main\\nmain:\\n mov x1,1 // node tree value\\n1:\\n ldr x0,qAdrstTree // structure tree address\\n bl insertElement // add element value x1\\n cmp x0,-1\\n beq 99f\\n add x1,x1,1 // increment value\\n cmp x1,NBVAL // end ?\\n ble 1b // no -> loop\\n\\n ldr x0,qAdrszMessPreOrder\\n bl affichageMess\\n ldr x3,qAdrstTree // tree root address (begin structure)\\n ldr x0,[x3,#tree_root]\\n ldr x1,qAdrdisplayElement // function to execute\\n bl preOrder\\n\\n ldr x0,qAdrszMessInOrder\\n bl affichageMess\\n ldr x3,qAdrstTree\\n ldr x0,[x3,#tree_root]\\n ldr x1,qAdrdisplayElement // function to execute\\n bl inOrder\\n\\n ldr x0,qAdrszMessPostOrder\\n bl affichageMess\\n ldr x3,qAdrstTree\\n ldr x0,[x3,#tree_root]\\n ldr x1,qAdrdisplayElement // function to execute\\n bl postOrder\\n\\n ldr x0,qAdrszMessLevelOrder\\n bl affichageMess\\n ldr x3,qAdrstTree\\n ldr x0,[x3,#tree_root]\\n ldr x1,qAdrdisplayElement // function to execute\\n bl levelOrder\\n b 100f\\n99: // display error\\n ldr x0,qAdrszMessErreur\\n bl affichageMess\\n100: // standard end of the program\\n mov x8,EXIT // request to exit program\\n svc 0 // perform system call\\nqAdrszMessInOrder: .quad szMessInOrder\\nqAdrszMessPreOrder: .quad szMessPreOrder\\nqAdrszMessPostOrder: .quad szMessPostOrder\\nqAdrszMessLevelOrder: .quad szMessLevelOrder\\nqAdrszMessErreur: .quad szMessErreur\\nqAdrszCarriageReturn: .quad szCarriageReturn\\nqAdrstTree: .quad stTree\\nqAdrstQueue: .quad stQueue\\nqAdrdisplayElement: .quad displayElement\\n/******************************************************************/\\n/* insert element in the tree */\\n/******************************************************************/\\n/* x0 contains the address of the tree structure */\\n/* x1 contains the value of element */\\n/* x0 returns address of element or - 1 if error */\\ninsertElement:\\n stp x1,lr,[sp,-16]! // save registers\\n mov x4,x0\\n mov x0,node_fin // reservation place one element\\n bl allocHeap\\n cmp x0,-1 // allocation error\\n beq 100f\\n mov x5,x0\\n str x1,[x5,node_value] // store value in address heap\\n mov x1,0\\n str x1,[x5,node_left] // init left pointer with zero\\n str x1,[x5,node_right] // init right pointer with zero\\n ldr x2,[x4,tree_size] // load tree size\\n cbnz x2,1f // 0 element ?\\n str x5,[x4,tree_root] // yes -> store in root\\n b 6f\\n1: // else search free address in tree\\n ldr x3,[x4,tree_root] // start with address root\\n add x6,x2,1 // increment tree size\\n clz x7,x6 // compute zeroes left bits\\n add x7,x7,1 // for sustract the first left bit\\n lsl x6,x6,x7 // shift number in left\\n2:\\n tst x6,1<<63 // test left bit\\n lsl x6,x6,1 // shift left bit\\n bne 3f // bit at one\\n ldr x1,[x3,node_left] // no store node address in left pointer\\n cbz x1,4f // if equal zero\\n mov x3,x1 // else loop with next node\\n b 2b\\n3: // yes\\n ldr x1,[x3,node_right] // store node address in right pointer\\n cbz x1,5f // if equal zero\\n mov x3,x1 // else loop with next node\\n b 2b\\n4:\\n str x5,[x3,node_left]\\n b 6f\\n5:\\n str x5,[x3,node_right]\\n6:\\n add x2,x2,1 // increment tree size\\n str x2,[x4,tree_size]\\n100:\\n ldp x1,lr,[sp],16 // restaur 2 registers\\n ret // return to address lr x30\\n/******************************************************************/\\n/* preOrder */\\n/******************************************************************/\\n/* x0 contains the address of the node */\\n/* x1 function address */\\npreOrder:\\n stp x1,lr,[sp,-16]! // save registers\\n stp x2,x3,[sp,-16]! // save registers\\n cmp x0,#0\\n beq 100f\\n mov x2,x0\\n blr x1 // call function\\n\\n ldr x0,[x2,#node_left]\\n bl preOrder\\n ldr x0,[x2,#node_right]\\n bl preOrder\\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/* inOrder */\\n/******************************************************************/\\n/* x0 contains the address of the node */\\n/* x1 function address */\\ninOrder:\\n stp x1,lr,[sp,-16]! // save registers\\n stp x2,x3,[sp,-16]! // save registers\\n cbz x0,100f\\n mov x3,x0\\n mov x2,x1\\n ldr x0,[x3,node_left]\\n bl inOrder\\n mov x0,x3\\n blr x2 // call function\\n\\n ldr x0,[x3,node_right]\\n mov x1,x2\\n bl inOrder\\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/* postOrder */\\n/******************************************************************/\\n/* x0 contains the address of the node */\\n/* x1 function address */\\npostOrder:\\n stp x1,lr,[sp,-16]! // save registers\\n stp x2,x3,[sp,-16]! // save registers\\n cbz x0,100f\\n mov x3,x0\\n mov x2,x1\\n ldr x0,[x3,#node_left]\\n bl postOrder\\n\\n ldr x0,[x3,#node_right]\\n mov x1,x2\\n bl postOrder\\n mov x0,x3\\n blr x2 // call function\\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/* levelOrder */\\n/******************************************************************/\\n/* x0 contains the address of the node */\\n/* x1 function address */\\nlevelOrder:\\n stp x1,lr,[sp,-16]! // save registers\\n stp x2,x3,[sp,-16]! // save registers\\n cbz x0,100f\\n mov x2,x1\\n mov x1,x0\\n ldr x0,qAdrstQueue // adresse queue\\n bl enqueueNode // queue the node\\n1: // begin loop\\n ldr x0,qAdrstQueue\\n bl isEmptyQueue // is queue empty\\n cbz x0,100f // yes -> end\\n ldr x0,qAdrstQueue\\n bl dequeueNode\\n mov x3,x0 // save node\\n blr x2 // call function\\n ldr x14,[x3,#node_left] // left node ok ?\\n cbz x14,2f\\n ldr x0,qAdrstQueue // yes -> enqueue\\n mov x1,x14\\n bl enqueueNode\\n2:\\n ldr x14,[x3,#node_right] // right node ok ?\\n cbz x14,3f\\n ldr x0,qAdrstQueue // yes -> enqueue\\n mov x1,x14\\n bl enqueueNode\\n3:\\n b 1b // and loop\\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/* display node */\\n/******************************************************************/\\n/* x0 contains node address */\\ndisplayElement:\\n stp x1,lr,[sp,-16]! // save registers\\n ldr x0,[x0,#node_value]\\n ldr x1,qAdrsZoneConv\\n bl conversion10S\\n ldr x0,qAdrszMessResult\\n ldr x1,qAdrsZoneConv\\n bl strInsertAtCharInc // insert result at @ character\\n bl affichageMess\\n100:\\n ldp x1,lr,[sp],16 // restaur 2 registers\\n ret // return to address lr x30\\nqAdrszMessResult: .quad szMessResult\\nqAdrsZoneConv: .quad sZoneConv\\n/******************************************************************/\\n/* enqueue node */\\n/******************************************************************/\\n/* x0 contains the address of the queue */\\n/* x1 contains the value of element */\\n/* x0 returns address of element or - 1 if error */\\nenqueueNode:\\n stp x1,lr,[sp,-16]! // save registers\\n stp x2,x3,[sp,-16]! // save registers\\n mov x14,x0\\n mov x0,#queue_node_fin // allocation place heap\\n bl allocHeap\\n cmp x0,#-1 // allocation error\\n beq 100f\\n mov x15,x0 // save heap address\\n str x1,[x15,#queue_node_value] // store node value\\n mov x1,#0\\n str x1,[x15,#queue_node_next] // init pointer next\\n ldr x0,[x14,#queue_end]\\n cbz x0,1f\\n str x15,[x0,#queue_node_next]\\n b 2f\\n1:\\n str x15,[x14,#queue_begin]\\n2:\\n str x15,[x14,#queue_end]\\n mov x0,#0\\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/* dequeue node */\\n/******************************************************************/\\n/* x0 contains the address of the queue */\\n/* x0 returns address of element or - 1 if error */\\ndequeueNode:\\n stp x1,lr,[sp,-16]! // save registers\\n ldr x14,[x0,#queue_begin]\\n ldr x15,[x14,#queue_node_value]\\n ldr x16,[x14,#queue_node_next]\\n str x16,[x0,#queue_begin]\\n cbnz x16,1f\\n str x16,[x0,#queue_end]\\n1:\\n mov x0,x15\\n100:\\n ldp x1,lr,[sp],16 // restaur 2 registers\\n ret // return to address lr x30\\n/******************************************************************/\\n/* dequeue node */\\n/******************************************************************/\\n/* x0 contains the address of the queue */\\n/* x0 returns 0 if empty else 1 */\\nisEmptyQueue:\\n ldr x0,[x0,#queue_begin]\\n cmp x0,#0\\n cset x0,ne\\n ret // return\\n/******************************************************************/\\n/* memory allocation on the heap */\\n/******************************************************************/\\n/* x0 contains the size to allocate */\\n/* x0 returns address of memory heap or - 1 if error */\\n/* CAUTION : The size of the allowance must be a multiple of 4 */\\nallocHeap:\\n stp x8,lr,[sp,-16]! // save registers\\n // allocation\\n mov x16,x0 // save size\\n mov x0,0 // read address start heap\\n mov x8,BRK // call system 'brk'\\n svc 0\\n mov x15,x0 // save address heap for return\\n add x0,x0,x16 // reservation place for size\\n mov x8,BRK // call system 'brk'\\n svc 0\\n cmp x0,-1 // allocation error\\n beq 100f\\n mov x0,x15 // return address memory heap\\n100:\\n ldp x8,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\": \"(defun flatten-preorder (tree)\\n (if (endp tree)\\n nil\\n (append (list (first tree))\\n (flatten-preorder (second tree))\\n (flatten-preorder (third tree)))))\\n\\n(defun flatten-inorder (tree)\\n (if (endp tree)\\n nil\\n (append (flatten-inorder (second tree))\\n (list (first tree))\\n (flatten-inorder (third tree)))))\\n\\n(defun flatten-postorder (tree)\\n (if (endp tree)\\n nil\\n (append (flatten-postorder (second tree))\\n (flatten-postorder (third tree))\\n (list (first tree)))))\\n\\n(defun flatten-level-r1 (tree level levels)\\n (if (endp tree)\\n levels\\n (let ((curr (cdr (assoc level levels))))\\n (flatten-level-r1\\n (second tree)\\n (1+ level)\\n (flatten-level-r1\\n (third tree)\\n (1+ level)\\n (put-assoc level\\n (append curr (list (first tree)))\\n levels))))))\\n\\n(defun flatten-level-r2 (levels max-level)\\n (declare (xargs :measure (nfix (1+ max-level))))\\n (if (zp (1+ max-level))\\n nil\\n (append (flatten-level-r2 levels\\n (1- max-level))\\n (reverse (cdr (assoc max-level levels))))))\\n\\n\\n(defun flatten-level (tree)\\n (let ((levels (flatten-level-r1 tree 0 nil)))\\n (flatten-level-r2 levels (len levels))))\\n\",\n \"language\": \"ACL2\"\n },\n {\n \"code\": \"CARD EndProg ;required for ALLOCATE.ACT\\n\\nINCLUDE \\\"D2:ALLOCATE.ACT\\\" ;from the Action! Tool Kit. You must type 'SET EndProg=*' from the monitor after compiling, but before running this program!\\n\\nDEFINE PTR=\\\"CARD\\\"\\n\\nDEFINE TREE_NODE_SIZE=\\\"5\\\"\\nTYPE TreeNode=[BYTE tData PTR left,right]\\n\\nDEFINE QUEUE_NODE_SIZE=\\\"4\\\"\\nTYPE QueueNode=[PTR qData,qNext]\\n\\nDEFINE STACK_NODE_SIZE=\\\"4\\\"\\nTYPE StackNode=[PTR sData,sNext]\\n\\nType Tree=[PTR root] ;TreeNode POINTER\\nTYPE Stack=[PTR top] ;StackNode POINTER\\nTYPE Queue=[PTR front,rear] ;QueueNode POINTER\\n\\nPROC QueueInit(Queue POINTER q)\\n q.front=0 q.rear=0\\nRETURN\\n\\nBYTE FUNC QueueIsEmpty(Queue POINTER q)\\n IF q.front=0 THEN RETURN (1) FI\\nRETURN (0)\\n\\nPROC QueuePush(Queue POINTER q TreeNode POINTER d)\\n QueueNode POINTER node,tmp\\n\\n node=Alloc(QUEUE_NODE_SIZE)\\n node.qData=d\\n node.qNext=0\\n IF QueueIsEmpty(q) THEN\\n q.front=node\\n ELSE\\n tmp=q.rear\\n tmp.qNext=node\\n FI\\n q.rear=node\\nRETURN\\n\\nPTR FUNC QueuePop(Queue POINTER q)\\n QueueNode POINTER node\\n TreeNode POINTER d\\n\\n IF QueueIsEmpty(q) THEN\\n PrintE(\\\"Error: queue is empty!\\\")\\n Break()\\n FI\\n\\n node=q.front\\n d=node.qData\\n q.front=node.qNext\\n Free(node,QUEUE_NODE_SIZE)\\nRETURN (d)\\n\\nPROC StackInit(Stack POINTER s)\\n s.top=0\\nRETURN\\n\\nBYTE FUNC StackIsEmpty(Stack POINTER s)\\n IF s.top=0 THEN\\n RETURN (1)\\n FI\\nRETURN (0)\\n\\nPROC StackPush(Stack POINTER s TreeNode POINTER d)\\n StackNode POINTER node\\n\\n node=Alloc(STACK_NODE_SIZE)\\n node.sData=d\\n node.sNext=s.top\\n s.top=node\\nRETURN\\n\\nPTR FUNC StackPop(Stack POINTER s)\\n StackNode POINTER node\\n TreeNode POINTER d\\n\\n IF StackIsEmpty(s) THEN\\n PrintE(\\\"Error stack is empty!\\\")\\n Break()\\n FI\\n\\n node=s.top\\n d=node.sData\\n s.top=node.sNext\\n Free(node,STACK_NODE_SIZE)\\nRETURN (d)\\n\\nPTR FUNC CreateTreeNode(BYTE d TreeNode POINTER l,r)\\n TreeNode POINTER node\\n\\n node=Alloc(TREE_NODE_SIZE)\\n node.tData=d\\n node.left=l\\n node.right=r\\nRETURN (node)\\n\\nPROC BuildTree(Tree POINTER t)\\n TreeNode POINTER t2,t3,t4,t5,t6,t7,t8,t9\\n\\n t7=CreateTreeNode(7,0,0)\\n t4=CreateTreeNode(4,t7,0)\\n t5=CreateTreeNode(5,0,0)\\n t2=CreateTreeNode(2,t4,t5)\\n t8=CreateTreeNode(8,0,0)\\n t9=CreateTreeNode(9,0,0)\\n t6=CreateTreeNode(6,t8,t9)\\n t3=CreateTreeNode(3,t6,0)\\n t.root=CreateTreeNode(1,t2,t3)\\nRETURN\\n\\nPROC DestroyTree(Tree POINTER t)\\n TreeNode POINTER n\\n Queue q\\n\\n IF t.root=0 THEN RETURN FI\\n\\n QueueInit(q)\\n QueuePush(q,t.root)\\n WHILE QueueIsEmpty(q)=0\\n DO\\n n=QueuePop(q)\\n IF n.left#0 THEN\\n QueuePush(q,n.left)\\n FI\\n IF n.right#0 THEN\\n QueuePush(q,n.right)\\n FI\\n Free(n,TREE_NODE_SIZE)\\n OD\\n t.root=0\\nRETURN\\n\\nPROC VisitNode(TreeNode POINTER n)\\n PrintB(n.tData) Put(32)\\nRETURN\\n\\nPROC PreOrder(Tree POINTER t)\\n TreeNode POINTER n\\n Stack s\\n\\n StackInit(s)\\n StackPush(s,t.root)\\n WHILE StackIsEmpty(s)=0\\n DO\\n n=StackPop(s)\\n VisitNode(n)\\n IF n.right#0 THEN\\n StackPush(s,n.right)\\n FI\\n IF n.left#0 THEN\\n StackPush(s,n.left)\\n FI\\n OD\\nRETURN\\n\\nPROC InOrder(Tree POINTER t)\\n TreeNode POINTER n\\n Stack s\\n\\n StackInit(s)\\n n=t.root\\n DO\\n DO\\n IF n.right#0 THEN\\n StackPush(s,n.right)\\n FI\\n StackPush(s,n)\\n IF n.left#0 THEN\\n n=n.left\\n ELSE\\n EXIT\\n FI\\n OD\\n\\n n=StackPop(s)\\n WHILE StackIsEmpty(s)=0 AND n.right=0\\n DO\\n VisitNode(n)\\n n=StackPop(s)\\n OD\\n\\n VisitNode(n)\\n IF StackIsEmpty(s) THEN EXIT FI\\n n=StackPop(s)\\n OD\\nRETURN\\n\\nPROC PostOrder(Tree POINTER t)\\n TreeNode POINTER n\\n Stack s,tmp\\n\\n StackInit(s)\\n StackInit(tmp)\\n StackPush(s,t.root)\\n WHILE StackIsEmpty(s)=0\\n DO\\n n=StackPop(s)\\n StackPush(tmp,n)\\n IF n.left#0 THEN\\n StackPush(s,n.left)\\n FI\\n IF n.right#0 THEN\\n StackPush(s,n.right)\\n FI\\n OD\\n\\n WHILE StackIsEmpty(tmp)=0\\n DO\\n n=StackPop(tmp)\\n VisitNode(n)\\n OD\\nRETURN\\n\\nPROC LevelOrder(Tree POINTER t)\\n TreeNode POINTER n\\n Queue q\\n\\n QueueInit(q)\\n QueuePush(q,t.root)\\n WHILE QueueIsEmpty(q)=0\\n DO\\n n=QueuePop(q)\\n IF n.left#0 THEN\\n QueuePush(q,n.left)\\n FI\\n IF n.right#0 THEN\\n QueuePush(q,n.right)\\n FI\\n VisitNode(n)\\n OD\\nRETURN\\n\\nPROC Main()\\n Tree t\\n\\n Put(125) PutE() ;clear screen\\n\\n AllocInit(0)\\n BuildTree(t)\\n\\n Print(\\\"pre-order: \\\") PreOrder(t) PutE()\\n Print(\\\"in-order: \\\") InOrder(t) PutE()\\n Print(\\\"post-order: \\\") PostOrder(t) PutE()\\n Print(\\\"level-order: \\\") LevelOrder(t) PutE()\\n\\n DestroyTree(t)\\nRETURN\\n\",\n \"language\": \"Action-\"\n },\n {\n \"code\": \"with Ada.Text_Io; use Ada.Text_Io;\\nwith Ada.Unchecked_Deallocation;\\nwith Ada.Containers.Doubly_Linked_Lists;\\n\\nprocedure Tree_Traversal is\\n type Node;\\n type Node_Access is access Node;\\n type Node is record\\n Left : Node_Access := null;\\n Right : Node_Access := null;\\n Data : Integer;\\n end record;\\n procedure Destroy_Tree(N : in out Node_Access) is\\n procedure free is new Ada.Unchecked_Deallocation(Node, Node_Access);\\n begin\\n if N.Left /= null then\\n Destroy_Tree(N.Left);\\n end if;\\n if N.Right /= null then\\n Destroy_Tree(N.Right);\\n end if;\\n Free(N);\\n end Destroy_Tree;\\n function Tree(Value : Integer; Left : Node_Access; Right : Node_Access) return Node_Access is\\n Temp : Node_Access := new Node;\\n begin\\n Temp.Data := Value;\\n Temp.Left := Left;\\n Temp.Right := Right;\\n return Temp;\\n end Tree;\\n procedure Preorder(N : Node_Access) is\\n begin\\n Put(Integer'Image(N.Data));\\n if N.Left /= null then\\n Preorder(N.Left);\\n end if;\\n if N.Right /= null then\\n Preorder(N.Right);\\n end if;\\n end Preorder;\\n procedure Inorder(N : Node_Access) is\\n begin\\n if N.Left /= null then\\n Inorder(N.Left);\\n end if;\\n Put(Integer'Image(N.Data));\\n if N.Right /= null then\\n Inorder(N.Right);\\n end if;\\n end Inorder;\\n procedure Postorder(N : Node_Access) is\\n begin\\n if N.Left /= null then\\n Postorder(N.Left);\\n end if;\\n if N.Right /= null then\\n Postorder(N.Right);\\n end if;\\n Put(Integer'Image(N.Data));\\n end Postorder;\\n procedure Levelorder(N : Node_Access) is\\n package Queues is new Ada.Containers.Doubly_Linked_Lists(Node_Access);\\n use Queues;\\n Node_Queue : List;\\n Next : Node_Access;\\n begin\\n Node_Queue.Append(N);\\n while not Is_Empty(Node_Queue) loop\\n Next := First_Element(Node_Queue);\\n Delete_First(Node_Queue);\\n Put(Integer'Image(Next.Data));\\n if Next.Left /= null then\\n Node_Queue.Append(Next.Left);\\n end if;\\n if Next.Right /= null then\\n Node_Queue.Append(Next.Right);\\n end if;\\n end loop;\\n end Levelorder;\\n N : Node_Access;\\nbegin\\n N := Tree(1,\\n Tree(2,\\n Tree(4,\\n Tree(7, null, null),\\n null),\\n Tree(5, null, null)),\\n Tree(3,\\n Tree(6,\\n Tree(8, null, null),\\n Tree(9, null, null)),\\n null));\\n\\n Put(\\\"preorder: \\\");\\n Preorder(N);\\n New_Line;\\n Put(\\\"inorder: \\\");\\n Inorder(N);\\n New_Line;\\n Put(\\\"postorder: \\\");\\n Postorder(N);\\n New_Line;\\n Put(\\\"level order: \\\");\\n Levelorder(N);\\n New_Line;\\n Destroy_Tree(N);\\nend Tree_traversal;\\n\",\n \"language\": \"Ada\"\n },\n {\n \"code\": \"open import Data.List using (List; _?_; []; concat)\\nopen import Data.Nat using (N; suc; zero)\\nopen import Level using (Level)\\nopen import Relation.Binary.PropositionalEquality using (_=_; refl)\\n\\ndata Tree {a} (A : Set a) : Set a where\\n leaf : Tree A\\n node : A ? Tree A ? Tree A ? Tree A\\n\\nvariable\\n a : Level\\n A : Set a\\n\\npreorder : Tree A ? List A\\npreorder tr = go tr []\\n where\\n go : Tree A ? List A ? List A\\n go leaf ys = ys\\n go (node x ls rs) ys = x ? go ls (go rs ys)\\n\\ninorder : Tree A ? List A\\ninorder tr = go tr []\\n where\\n go : Tree A ? List A ? List A\\n go leaf ys = ys\\n go (node x ls rs) ys = go ls (x ? go rs ys)\\n\\npostorder : Tree A ? List A\\npostorder tr = go tr []\\n where\\n go : Tree A ? List A ? List A\\n go leaf ys = ys\\n go (node x ls rs) ys = go ls (go rs (x ? ys))\\n\\nlevel-order : Tree A ? List A\\nlevel-order tr = concat (go tr [])\\n where\\n go : Tree A ? List (List A) ? List (List A)\\n go leaf qs = qs\\n go (node x ls rs) [] = (x ? []) ? go ls (go rs [])\\n go (node x ls rs) (q ? qs) = (x ? q ) ? go ls (go rs qs)\\n\\nexample-tree : Tree N\\nexample-tree =\\n node 1\\n (node 2\\n (node 4\\n (node 7\\n leaf\\n leaf)\\n leaf)\\n (node 5\\n leaf\\n leaf))\\n (node 3\\n (node 6\\n (node 8\\n leaf\\n leaf)\\n (node 9\\n leaf\\n leaf))\\n leaf)\\n\\n_ : preorder example-tree = 1 ? 2 ? 4 ? 7 ? 5 ? 3 ? 6 ? 8 ? 9 ? []\\n_ = refl\\n\\n_ : inorder example-tree = 7 ? 4 ? 2 ? 5 ? 1 ? 8 ? 6 ? 9 ? 3 ? []\\n_ = refl\\n\\n_ : postorder example-tree = 7 ? 4 ? 5 ? 2 ? 8 ? 9 ? 6 ? 3 ? 1 ? []\\n_ = refl\\n\\n_ : level-order example-tree = 1 ? 2 ? 3 ? 4 ? 5 ? 6 ? 7 ? 8 ? 9 ? []\\n_ = refl\\n\",\n \"language\": \"Agda\"\n },\n {\n \"code\": \"MODE VALUE = INT;\\nPROC value repr = (VALUE value)STRING: whole(value, 0);\\n\\nMODE NODES = STRUCT ( VALUE value, REF NODES left, right);\\nMODE NODE = REF NODES;\\n\\nPROC tree = (VALUE value, NODE left, right)NODE:\\n HEAP NODES := (value, left, right);\\n\\nPROC preorder = (NODE node, PROC (VALUE)VOID action)VOID:\\n IF node ISNT NODE(NIL) THEN\\n action(value OF node);\\n preorder(left OF node, action);\\n preorder(right OF node, action)\\n FI;\\n\\nPROC inorder = (NODE node, PROC (VALUE)VOID action)VOID:\\n IF node ISNT NODE(NIL) THEN\\n inorder(left OF node, action);\\n action(value OF node);\\n inorder(right OF node, action)\\n FI;\\n\\nPROC postorder = (NODE node, PROC (VALUE)VOID action)VOID:\\n IF node ISNT NODE(NIL) THEN\\n postorder(left OF node, action);\\n postorder(right OF node, action);\\n action(value OF node)\\n FI;\\n\\nPROC destroy tree = (NODE node)VOID:\\n postorder(node, (VALUE skip)VOID:\\n # free(node) - PR garbage collect hint PR #\\n node := (SKIP, NIL, NIL)\\n );\\n\\n# helper queue for level order #\\nMODE QNODES = STRUCT (REF QNODES next, NODE value);\\nMODE QNODE = REF QNODES;\\n\\n\\nMODE QUEUES = STRUCT (QNODE begin, end);\\nMODE QUEUE = REF QUEUES;\\n\\nPROC enqueue = (QUEUE queue, NODE node)VOID:\\n(\\n HEAP QNODES qnode := (NIL, node);\\n IF end OF queue ISNT QNODE(NIL) THEN\\n next OF end OF queue\\n ELSE\\n begin OF queue\\n FI := end OF queue := qnode\\n);\\n\\nPROC queue empty = (QUEUE queue)BOOL:\\n begin OF queue IS QNODE(NIL);\\n\\nPROC dequeue = (QUEUE queue)NODE:\\n(\\n NODE out := value OF begin OF queue;\\n QNODE second := next OF begin OF queue;\\n# free(begin OF queue); PR garbage collect hint PR #\\n QNODE(begin OF queue) := (NIL, NIL);\\n begin OF queue := second;\\n IF queue empty(queue) THEN\\n end OF queue := begin OF queue\\n FI;\\n out\\n);\\n\\nPROC level order = (NODE node, PROC (VALUE)VOID action)VOID:\\n(\\n HEAP QUEUES queue := (QNODE(NIL), QNODE(NIL));\\n enqueue(queue, node);\\n WHILE NOT queue empty(queue)\\n DO\\n NODE next := dequeue(queue);\\n IF next ISNT NODE(NIL) THEN\\n action(value OF next);\\n enqueue(queue, left OF next);\\n enqueue(queue, right OF next)\\n FI\\n OD\\n);\\n\\nPROC print node = (VALUE value)VOID:\\n print((\\\" \\\",value repr(value)));\\n\\nmain: (\\n NODE node := tree(1,\\n tree(2,\\n tree(4,\\n tree(7, NIL, NIL),\\n NIL),\\n tree(5, NIL, NIL)),\\n tree(3,\\n tree(6,\\n tree(8, NIL, NIL),\\n tree(9, NIL, NIL)),\\n NIL));\\n\\n MODE TEST = STRUCT(\\n STRING name,\\n PROC(NODE,PROC(VALUE)VOID)VOID order\\n );\\n\\n PROC test = (TEST test)VOID:(\\n STRING pad=\\\" \\\"*(12-UPB name OF test);\\n print((name OF test,pad,\\\": \\\"));\\n (order OF test)(node, print node);\\n print(new line)\\n );\\n\\n []TEST test list = (\\n (\\\"preorder\\\",preorder),\\n (\\\"inorder\\\",inorder),\\n (\\\"postorder\\\",postorder),\\n (\\\"level order\\\",level order)\\n );\\n\\n FOR i TO UPB test list DO test(test list[i]) OD;\\n\\n destroy tree(node)\\n)\\n\",\n \"language\": \"ALGOL-68\"\n },\n {\n \"code\": \"preorder ? {l r?? ?? ? ? (?r)???(×?r)?(?l)???(×?l)?? ?? ?}\\ninorder ? {l r?? ?? ? ? (?r)???(×?r)?? ???(?l)???(×?l)??}\\npostorder? {l r?? ?? ? ? ? ???(?r)???(×?r)?(?l)???(×?l)??}\\nlvlorder ? {0=??:? ? (????/(??),??)??°(,/)?2??°??¨?}\\n\",\n \"language\": \"APL\"\n },\n {\n \"code\": \"tree?1(2(4(7??)?)(5??))(3(6(8??)(9??))?)\\nvisit?{?,(×??)???}\\nchildren?{?¨@(×°?¨)1??}\\n\",\n \"language\": \"APL\"\n },\n {\n \"code\": \"on run\\n -- Sample tree of integers\\n set tree to node(1, ¬\\n {node(2, ¬\\n {node(4, {node(7, {})}), ¬\\n node(5, {})}), ¬\\n node(3, ¬\\n {node(6, {node(8, {}), ¬\\n node(9, {})})})})\\n\\n\\n -- Output of AppleScript code at Rosetta Code task\\n -- 'Visualize a Tree':\\n set strTree to unlines({¬\\n \\\" + 4 - 7\\\", ¬\\n \\\" + 2 ¦\\\", ¬\\n \\\" ¦ + 5\\\", ¬\\n \\\" 1 ¦\\\", ¬\\n \\\" ¦ + 8\\\", ¬\\n \\\" + 3 - 6 ¦\\\", ¬\\n \\\" + 9\\\"})\\n\\n script tabulate\\n on |?|(s, xs)\\n justifyRight(14, space, s & \\\": \\\") & unwords(xs)\\n end |?|\\n end script\\n\\n set strResult to strTree & linefeed & unlines(zipWith(tabulate, ¬\\n [\\\"preorder\\\", \\\"inorder\\\", \\\"postorder\\\", \\\"level-order\\\"], ¬\\n apList([¬\\n foldTree(preorder), ¬\\n foldTree(inorder), ¬\\n foldTree(postorder), ¬\\n levelOrder], [tree])))\\n\\n set the clipboard to strResult\\n return strResult\\nend run\\n\\n\\n---------------------- TREE TRAVERSAL ----------------------\\n\\n-- preorder :: a -> [[a]] -> [a]\\non preorder(x, xs)\\n {x} & concat(xs)\\nend preorder\\n\\n\\n-- inorder :: a -> [[a]] -> [a]\\non inorder(x, xs)\\n if {} ? xs then\\n item 1 of xs & x & concat(rest of xs)\\n else\\n {x}\\n end if\\nend inorder\\n\\n\\n-- postorder :: a -> [[a]] -> [a]\\non postorder(x, xs)\\n concat(xs) & {x}\\nend postorder\\n\\n\\n-- levelOrder :: Tree a -> [a]\\non levelOrder(tree)\\n concat(levels(tree))\\nend levelOrder\\n\\n\\n-- foldTree :: (a -> [b] -> b) -> Tree a -> b\\non foldTree(f)\\n script\\n on |?|(tree)\\n script go\\n property g : |?| of mReturn(f)\\n on |?|(oNode)\\n g(root of oNode, |?|(nest of oNode) ¬\\n of map(go))\\n end |?|\\n end script\\n |?|(tree) of go\\n end |?|\\n end script\\nend foldTree\\n\\n\\n------------------------- GENERIC --------------------------\\n\\n-- Node :: a -> [Tree a] -> Tree a\\non node(v, xs)\\n {type:\\\"Node\\\", root:v, nest:xs}\\nend node\\n\\n\\n-- e.g. [(*2),(/2), sqrt] <*> [1,2,3]\\n-- --> ap([dbl, hlf, root], [1, 2, 3])\\n-- --> [2,4,6,0.5,1,1.5,1,1.4142135623730951,1.7320508075688772]\\n\\n-- Each member of a list of functions applied to\\n-- each of a list of arguments, deriving a list of new values\\n-- apList (<*>) :: [(a -> b)] -> [a] -> [b]\\non apList(fs, xs)\\n set lst to {}\\n repeat with f in fs\\n tell mReturn(contents of f)\\n repeat with x in xs\\n set end of lst to |?|(contents of x)\\n end repeat\\n end tell\\n end repeat\\n return lst\\nend apList\\n\\n\\n-- concat :: [[a]] -> [a]\\n-- concat :: [String] -> String\\non concat(xs)\\n set lng to length of xs\\n if 0 < lng and string is class of (item 1 of xs) then\\n set acc to \\\"\\\"\\n else\\n set acc to {}\\n end if\\n repeat with i from 1 to lng\\n set acc to acc & item i of xs\\n end repeat\\n acc\\nend concat\\n\\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, i, xs)\\n end repeat\\n return v\\n end tell\\nend foldr\\n\\n\\n-- justifyRight :: Int -> Char -> String -> String\\non justifyRight(n, cFiller, strText)\\n if n > length of strText then\\n text -n thru -1 of ((replicate(n, cFiller) as text) & strText)\\n else\\n strText\\n end if\\nend justifyRight\\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-- levels :: Tree a -> [[a]]\\non levels(tree)\\n -- A list of lists, grouping the root\\n -- values of each level of the tree.\\n script go\\n on |?|(node, a)\\n if {} ? a then\\n tell a to set {h, t} to {item 1, rest}\\n else\\n set {h, t} to {{}, {}}\\n end if\\n\\n {{root of node} & h} & foldr(go, t, nest of node)\\n end |?|\\n end script\\n\\n |?|(tree, {}) of go\\nend levels\\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\\n-- map :: (a -> b) -> [a] -> [b]\\non map(f)\\n -- The list obtained by applying f\\n -- to each element of xs.\\n script\\n on |?|(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\\n end |?|\\n end script\\nend map\\n\\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\\n-- nest :: Tree a -> [a]\\non nest(oTree)\\n nest of oTree\\nend nest\\n\\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-- root :: Tree a -> a\\non root(oTree)\\n root of oTree\\nend root\\n\\n\\n-- take :: Int -> [a] -> [a]\\n-- take :: Int -> String -> String\\non take(n, xs)\\n set c to class of xs\\n if list is c then\\n if 0 < n then\\n items 1 thru min(n, length of xs) of xs\\n else\\n {}\\n end if\\n else if string is c then\\n if 0 < n then\\n text 1 thru min(n, length of xs) of xs\\n else\\n \\\"\\\"\\n end if\\n else if script is c then\\n set ys to {}\\n repeat with i from 1 to n\\n set v to |?|() of xs\\n if missing value is v then\\n return ys\\n else\\n set end of ys to v\\n end if\\n end repeat\\n return ys\\n else\\n missing value\\n end if\\nend take\\n\\n\\n-- unlines :: [String] -> String\\non unlines(xs)\\n -- A single string formed by the intercalation\\n -- of a list of strings with the newline character.\\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\\n-- unwords :: [String] -> String\\non unwords(xs)\\n set {dlm, my text item delimiters} to ¬\\n {my text item delimiters, space}\\n set s to xs as text\\n set my text item delimiters to dlm\\n return s\\nend unwords\\n\\n\\n-- zipWith :: (a -> b -> c) -> [a] -> [b] -> [c]\\non zipWith(f, xs, ys)\\n set lng to min(|length|(xs), |length|(ys))\\n if 1 > lng then return {}\\n set xs_ to take(lng, xs) -- Allow for non-finite\\n set ys_ to take(lng, ys) -- generators like cycle etc\\n set lst to {}\\n tell mReturn(f)\\n repeat with i from 1 to lng\\n set end of lst to |?|(item i of xs_, item i of ys_)\\n end repeat\\n return lst\\n end tell\\nend zipWith\\n\",\n \"language\": \"AppleScript\"\n },\n {\n \"code\": \"/* ARM assembly Raspberry PI */\\n/* program deftree2.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\\n.equ NBVAL, 9\\n\\n/*******************************************/\\n/* Structures */\\n/********************************************/\\n/* structure tree */\\n .struct 0\\ntree_root: @ root pointer\\n .struct tree_root + 4\\ntree_size: @ number of element of tree\\n .struct tree_size + 4\\ntree_fin:\\n/* structure node tree */\\n .struct 0\\nnode_left: @ left pointer\\n .struct node_left + 4\\nnode_right: @ right pointer\\n .struct node_right + 4\\nnode_value: @ element value\\n .struct node_value + 4\\nnode_fin:\\n/* structure queue*/\\n .struct 0\\nqueue_begin: @ next pointer\\n .struct queue_begin + 4\\nqueue_end: @ element value\\n .struct queue_end + 4\\nqueue_fin:\\n/* structure node queue */\\n .struct 0\\nqueue_node_next: @ next pointer\\n .struct queue_node_next + 4\\nqueue_node_value: @ element value\\n .struct queue_node_value + 4\\nqueue_node_fin:\\n/* Initialized data */\\n.data\\nszMessInOrder: .asciz \\\"inOrder :\\\\n\\\"\\nszMessPreOrder: .asciz \\\"PreOrder :\\\\n\\\"\\nszMessPostOrder: .asciz \\\"PostOrder :\\\\n\\\"\\nszMessLevelOrder: .asciz \\\"LevelOrder :\\\\n\\\"\\nszCarriageReturn: .asciz \\\"\\\\n\\\"\\n/* datas error display */\\nszMessErreur: .asciz \\\"Error detected.\\\\n\\\"\\n/* datas message display */\\nszMessResult: .ascii \\\"Element value :\\\"\\nsValue: .space 12,' '\\n .asciz \\\"\\\\n\\\"\\n\\n/* UnInitialized data */\\n.bss\\nstTree: .skip tree_fin @ place to structure tree\\nstQueue: .skip queue_fin @ place to structure queue\\n/* code section */\\n.text\\n.global main\\nmain:\\n mov r1,#1 @ node tree value\\n1:\\n ldr r0,iAdrstTree @ structure tree address\\n bl insertElement @ add element value r1\\n cmp r0,#-1\\n beq 99f\\n add r1,#1 @ increment value\\n cmp r1,#NBVAL @ end ?\\n ble 1b @ no -> loop\\n\\n ldr r0,iAdrszMessPreOrder\\n bl affichageMess\\n ldr r3,iAdrstTree @ tree root address (begin structure)\\n ldr r0,[r3,#tree_root]\\n ldr r1,iAdrdisplayElement @ function to execute\\n bl preOrder\\n\\n ldr r0,iAdrszMessInOrder\\n bl affichageMess\\n ldr r3,iAdrstTree\\n ldr r0,[r3,#tree_root]\\n ldr r1,iAdrdisplayElement @ function to execute\\n bl inOrder\\n\\n ldr r0,iAdrszMessPostOrder\\n bl affichageMess\\n ldr r3,iAdrstTree\\n ldr r0,[r3,#tree_root]\\n ldr r1,iAdrdisplayElement @ function to execute\\n bl postOrder\\n\\n ldr r0,iAdrszMessLevelOrder\\n bl affichageMess\\n ldr r3,iAdrstTree\\n ldr r0,[r3,#tree_root]\\n ldr r1,iAdrdisplayElement @ function to execute\\n bl levelOrder\\n b 100f\\n99: @ display error\\n ldr r0,iAdrszMessErreur\\n bl affichageMess\\n100: @ standard end of the program\\n mov r7, #EXIT @ request to exit program\\n svc 0 @ perform system call\\niAdrszMessInOrder: .int szMessInOrder\\niAdrszMessPreOrder: .int szMessPreOrder\\niAdrszMessPostOrder: .int szMessPostOrder\\niAdrszMessLevelOrder: .int szMessLevelOrder\\niAdrszMessErreur: .int szMessErreur\\niAdrszCarriageReturn: .int szCarriageReturn\\niAdrstTree: .int stTree\\niAdrstQueue: .int stQueue\\niAdrdisplayElement: .int displayElement\\n/******************************************************************/\\n/* insert element in the tree */\\n/******************************************************************/\\n/* r0 contains the address of the tree structure */\\n/* r1 contains the value of element */\\n/* r0 returns address of element or - 1 if error */\\ninsertElement:\\n push {r1-r7,lr} @ save registers\\n mov r4,r0\\n mov r0,#node_fin @ reservation place one element\\n bl allocHeap\\n cmp r0,#-1 @ allocation error\\n beq 100f\\n mov r5,r0\\n str r1,[r5,#node_value] @ store value in address heap\\n mov r1,#0\\n str r1,[r5,#node_left] @ init left pointer with zero\\n str r1,[r5,#node_right] @ init right pointer with zero\\n ldr r2,[r4,#tree_size] @ load tree size\\n cmp r2,#0 @ 0 element ?\\n bne 1f\\n str r5,[r4,#tree_root] @ yes -> store in root\\n b 4f\\n1: @ else search free address in tree\\n ldr r3,[r4,#tree_root] @ start with address root\\n add r6,r2,#1 @ increment tree size\\n clz r7,r6 @ compute zeroes left bits\\n add r7,#1 @ for sustract the first left bit\\n lsl r6,r7 @ shift number in left\\n2:\\n lsls r6,#1 @ read left bit\\n bcs 3f @ is 1 ?\\n ldr r1,[r3,#node_left] @ no store node address in left pointer\\n cmp r1,#0 @ if equal zero\\n streq r5,[r3,#node_left]\\n beq 4f\\n mov r3,r1 @ else loop with next node\\n b 2b\\n3: @ yes\\n ldr r1,[r3,#node_right] @ store node address in right pointer\\n cmp r1,#0 @ if equal zero\\n streq r5,[r3,#node_right]\\n beq 4f\\n mov r3,r1 @ else loop with next node\\n b 2b\\n4:\\n add r2,#1 @ increment tree size\\n str r2,[r4,#tree_size]\\n100:\\n pop {r1-r7,lr} @ restaur registers\\n bx lr @ return\\n/******************************************************************/\\n/* preOrder */\\n/******************************************************************/\\n/* r0 contains the address of the node */\\n/* r1 function address */\\npreOrder:\\n push {r1-r2,lr} @ save registers\\n cmp r0,#0\\n beq 100f\\n mov r2,r0\\n blx r1 @ call function\\n\\n ldr r0,[r2,#node_left]\\n bl preOrder\\n ldr r0,[r2,#node_right]\\n bl preOrder\\n100:\\n pop {r1-r2,lr} @ restaur registers\\n bx lr\\n/******************************************************************/\\n/* inOrder */\\n/******************************************************************/\\n/* r0 contains the address of the node */\\n/* r1 function address */\\ninOrder:\\n push {r1-r3,lr} @ save registers\\n cmp r0,#0\\n beq 100f\\n mov r3,r0\\n mov r2,r1\\n ldr r0,[r3,#node_left]\\n bl inOrder\\n mov r0,r3\\n blx r2 @ call function\\n\\n ldr r0,[r3,#node_right]\\n mov r1,r2\\n bl inOrder\\n100:\\n pop {r1-r3,lr} @ restaur registers\\n bx lr @ return\\n/******************************************************************/\\n/* postOrder */\\n/******************************************************************/\\n/* r0 contains the address of the node */\\n/* r1 function address */\\npostOrder:\\n push {r1-r3,lr} @ save registers\\n cmp r0,#0\\n beq 100f\\n mov r3,r0\\n mov r2,r1\\n ldr r0,[r3,#node_left]\\n bl postOrder\\n\\n ldr r0,[r3,#node_right]\\n mov r1,r2\\n bl postOrder\\n mov r0,r3\\n blx r2 @ call function\\n100:\\n pop {r1-r3,lr} @ restaur registers\\n bx lr @ return\\n/******************************************************************/\\n/* levelOrder */\\n/******************************************************************/\\n/* r0 contains the address of the node */\\n/* r1 function address */\\nlevelOrder:\\n push {r1-r4,lr} @ save registers\\n cmp r0,#0\\n beq 100f\\n mov r2,r1\\n mov r1,r0\\n ldr r0,iAdrstQueue @ adresse queue\\n bl enqueueNode @ queue the node\\n1: @ begin loop\\n ldr r0,iAdrstQueue\\n bl isEmptyQueue @ is queue empty\\n cmp r0,#0\\n beq 100f @ yes -> end\\n ldr r0,iAdrstQueue\\n bl dequeueNode\\n mov r3,r0 @ save node\\n blx r2 @ call function\\n ldr r4,[r3,#node_left] @ left node ok ?\\n cmp r4,#0\\n beq 2f @ no\\n ldr r0,iAdrstQueue @ yes -> enqueue\\n mov r1,r4\\n bl enqueueNode\\n2:\\n ldr r4,[r3,#node_right] @ right node ok ?\\n cmp r4,#0\\n beq 3f @ no\\n ldr r0,iAdrstQueue @ yes -> enqueue\\n mov r1,r4\\n bl enqueueNode\\n3:\\n b 1b @ and loop\\n\\n100:\\n pop {r1-r4,lr} @ restaur registers\\n bx lr @ return\\n/******************************************************************/\\n/* display node */\\n/******************************************************************/\\n/* r0 contains node address */\\ndisplayElement:\\n push {r1,lr} @ save registers\\n ldr r0,[r0,#node_value]\\n ldr r1,iAdrsValue\\n bl conversion10S\\n ldr r0,iAdrszMessResult\\n bl affichageMess\\n100:\\n pop {r1,lr} @ restaur registers\\n bx lr @ return\\niAdrszMessResult: .int szMessResult\\niAdrsValue: .int sValue\\n/******************************************************************/\\n/* enqueue node */\\n/******************************************************************/\\n/* r0 contains the address of the queue */\\n/* r1 contains the value of element */\\n/* r0 returns address of element or - 1 if error */\\nenqueueNode:\\n push {r1-r5,lr} @ save registers\\n mov r4,r0\\n mov r0,#queue_node_fin @ allocation place heap\\n bl allocHeap\\n cmp r0,#-1 @ allocation error\\n beq 100f\\n mov r5,r0 @ save heap address\\n str r1,[r5,#queue_node_value] @ store node value\\n mov r1,#0\\n str r1,[r5,#queue_node_next] @ init pointer next\\n ldr r0,[r4,#queue_end]\\n cmp r0,#0\\n strne r5,[r0,#queue_node_next]\\n streq r5,[r4,#queue_begin]\\n str r5,[r4,#queue_end]\\n mov r0,#0\\n pop {r1-r5,lr}\\n bx lr @ return\\n/******************************************************************/\\n/* dequeue node */\\n/******************************************************************/\\n/* r0 contains the address of the queue */\\n/* r0 returns address of element or - 1 if error */\\ndequeueNode:\\n push {r1-r5,lr} @ save registers\\n ldr r4,[r0,#queue_begin]\\n ldr r5,[r4,#queue_node_value]\\n ldr r6,[r4,#queue_node_next]\\n str r6,[r0,#queue_begin]\\n cmp r6,#0\\n streq r6,[r0,#queue_end]\\n mov r0,r5\\n100:\\n pop {r1-r5,lr}\\n bx lr @ return\\n/******************************************************************/\\n/* dequeue node */\\n/******************************************************************/\\n/* r0 contains the address of the queue */\\n/* r0 returns 0 if empty else 1 */\\nisEmptyQueue:\\n ldr r0,[r0,#queue_begin]\\n cmp r0,#0\\n movne r0,#1\\n bx lr @ return\\n/******************************************************************/\\n/* memory allocation on the heap */\\n/******************************************************************/\\n/* r0 contains the size to allocate */\\n/* r0 returns address of memory heap or - 1 if error */\\n/* CAUTION : The size of the allowance must be a multiple of 4 */\\nallocHeap:\\n push {r5-r7,lr} @ save registers\\n @ allocation\\n mov r6,r0 @ save size\\n mov r0,#0 @ read address start heap\\n mov r7,#0x2D @ call system 'brk'\\n svc #0\\n mov r5,r0 @ save address heap for return\\n add r0,r6 @ reservation place for size\\n mov r7,#0x2D @ call system 'brk'\\n svc #0\\n cmp r0,#-1 @ allocation error\\n movne r0,r5 @ return address memory heap\\n pop {r5-r7,lr} @ restaur registers\\n bx lr @ return\\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/* 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\": \"#include\\n\\\"share/atspre_staload.hats\\\"\\n//\\n(* ****** ****** *)\\n//\\ndatatype\\ntree (a:t@ype) =\\n | tnil of ()\\n | tcons of (tree a, a, tree a)\\n//\\n(* ****** ****** *)\\n\\nsymintr ++\\ninfixr (+) ++\\noverload ++ with list_append\\n\\n(* ****** ****** *)\\n\\n#define sing list_sing\\n\\n(* ****** ****** *)\\n\\nfun{\\na:t@ype\\n} preorder\\n (t0: tree a): List0 a =\\n case t0 of\\n | tnil () => nil ()\\n | tcons (tl, x, tr) => sing(x) ++ preorder(tl) ++ preorder(tr)\\n\\n(* ****** ****** *)\\n\\nfun{\\na:t@ype\\n} inorder\\n (t0: tree a): List0 a =\\n case t0 of\\n | tnil () => nil ()\\n | tcons (tl, x, tr) => inorder(tl) ++ sing(x) ++ inorder(tr)\\n\\n(* ****** ****** *)\\n\\nfun{\\na:t@ype\\n} postorder\\n (t0: tree a): List0 a =\\n case t0 of\\n | tnil () => nil ()\\n | tcons (tl, x, tr) => postorder(tl) ++ postorder(tr) ++ sing(x)\\n\\n(* ****** ****** *)\\n\\nfun{\\na:t@ype\\n} levelorder\\n (t0: tree a): List0 a = let\\n//\\nfun auxlst\\n (ts: List (tree(a))): List0 a =\\n case ts of\\n | list_nil () => list_nil ()\\n | list_cons (t, ts) =>\\n (\\n case+ t of\\n | tnil () => auxlst (ts)\\n | tcons (tl, x, tr) => cons (x, auxlst (ts ++ $list{tree(a)}(tl, tr)))\\n )\\n//\\nin\\n auxlst (sing(t0))\\nend // end of [levelorder]\\n\\n(* ****** ****** *)\\n\\nmacdef\\ntsing(x) = tcons (tnil, ,(x), tnil)\\n\\n(* ****** ****** *)\\n\\nimplement\\nmain0 () = let\\n//\\nval t0 =\\ntcons{int}\\n(\\n tcons (tcons (tsing (7), 4, tnil ()), 2, tsing (5))\\n,\\n1\\n,\\n tcons (tcons (tsing (8), 6, tsing (9)), 3, tnil ())\\n)\\n//\\nin\\n println! (\\\"preorder:\\\\t\\\", preorder(t0));\\n println! (\\\"inorder:\\\\t\\\", inorder(t0));\\n println! (\\\"postorder:\\\\t\\\", postorder(t0));\\n println! (\\\"level-order:\\\\t\\\", levelorder(t0));\\nend (* end of [main0] *)\\n\",\n \"language\": \"ATS\"\n },\n {\n \"code\": \"AddNode(Tree,1,2,3,1) ; Build global Tree\\nAddNode(Tree,2,4,5,2)\\nAddNode(Tree,3,6,0,3)\\nAddNode(Tree,4,7,0,4)\\nAddNode(Tree,5,0,0,5)\\nAddNode(Tree,6,8,9,6)\\nAddNode(Tree,7,0,0,7)\\nAddNode(Tree,8,0,0,8)\\nAddNode(Tree,9,0,0,9)\\n\\nMsgBox % \\\"Preorder: \\\" PreOrder(Tree,1) ; 1 2 4 7 5 3 6 8 9\\nMsgBox % \\\"Inorder: \\\" InOrder(Tree,1) ; 7 4 2 5 1 8 6 9 3\\nMsgBox % \\\"postorder: \\\" PostOrder(Tree,1) ; 7 4 5 2 8 9 6 3 1\\nMsgBox % \\\"levelorder: \\\" LevOrder(Tree,1) ; 1 2 3 4 5 6 7 8 9\\n\\nAddNode(ByRef Tree,Node,Left,Right,Value) {\\n if !isobject(Tree)\\n Tree := object()\\n\\n Tree[Node, \\\"L\\\"] := Left\\n Tree[Node, \\\"R\\\"] := Right\\n Tree[Node, \\\"V\\\"] := Value\\n}\\n\\nPreOrder(Tree,Node) {\\nptree := Tree[Node, \\\"V\\\"] \\\" \\\"\\n . ((L:=Tree[Node, \\\"L\\\"]) ? PreOrder(Tree,L) : \\\"\\\")\\n . ((R:=Tree[Node, \\\"R\\\"]) ? PreOrder(Tree,R) : \\\"\\\")\\nreturn ptree\\n}\\nInOrder(Tree,Node) {\\n Return itree := ((L:=Tree[Node, \\\"L\\\"]) ? InOrder(Tree,L) : \\\"\\\")\\n . Tree[Node, \\\"V\\\"] \\\" \\\"\\n . ((R:=Tree[Node, \\\"R\\\"]) ? InOrder(Tree,R) : \\\"\\\")\\n}\\nPostOrder(Tree,Node) {\\n Return ptree := ((L:=Tree[Node, \\\"L\\\"]) ? PostOrder(Tree,L) : \\\"\\\")\\n . ((R:=Tree[Node, \\\"R\\\"]) ? PostOrder(Tree,R) : \\\"\\\")\\n . Tree[Node, \\\"V\\\"] \\\" \\\"\\n}\\nLevOrder(Tree,Node,Lev=1) {\\n Static ; make node lists static\\n i%Lev% .= Tree[Node, \\\"V\\\"] \\\" \\\" ; build node lists in every level\\n If (L:=Tree[Node, \\\"L\\\"])\\n LevOrder(Tree,L,Lev+1)\\n If (R:=Tree[Node, \\\"R\\\"])\\n LevOrder(Tree,R,Lev+1)\\n If (Lev > 1)\\n Return\\n While i%Lev% ; concatenate node lists from all levels\\n t .= i%Lev%, Lev++\\n Return t\\n}\\n\",\n \"language\": \"AutoHotkey\"\n },\n {\n \"code\": \"function preorder(tree, node, res, child) {\\n if (node == \\\"\\\")\\n return\\n res[res[\\\"count\\\"]++] = node\\n split(tree[node], child, \\\",\\\")\\n preorder(tree,child[1],res)\\n preorder(tree,child[2],res)\\n}\\n\\nfunction inorder(tree, node, res, child) {\\n if (node == \\\"\\\")\\n return\\n split(tree[node], child, \\\",\\\")\\n inorder(tree,child[1],res)\\n res[res[\\\"count\\\"]++] = node\\n inorder(tree,child[2],res)\\n}\\n\\nfunction postorder(tree, node, res, child) {\\n if (node == \\\"\\\")\\n return\\n split(tree[node], child, \\\",\\\")\\n postorder(tree,child[1], res)\\n postorder(tree,child[2], res)\\n res[res[\\\"count\\\"]++] = node\\n}\\n\\nfunction levelorder(tree, node, res, nextnode, queue, child) {\\n if (node == \\\"\\\")\\n return\\n\\n queue[\\\"tail\\\"] = 0\\n queue[queue[\\\"head\\\"]++] = node\\n\\n while (queue[\\\"head\\\"] - queue[\\\"tail\\\"] >= 1) {\\n\\n nextnode = queue[queue[\\\"tail\\\"]]\\n delete queue[queue[\\\"tail\\\"]++]\\n\\n res[res[\\\"count\\\"]++] = nextnode\\n\\n split(tree[nextnode], child, \\\",\\\")\\n if (child[1] != \\\"\\\")\\n queue[queue[\\\"head\\\"]++] = child[1]\\n if (child[2] != \\\"\\\")\\n queue[queue[\\\"head\\\"]++] = child[2]\\n }\\n delete queue\\n}\\n\\nBEGIN {\\n tree[\\\"1\\\"] = \\\"2,3\\\"\\n tree[\\\"2\\\"] = \\\"4,5\\\"\\n tree[\\\"3\\\"] = \\\"6,\\\"\\n tree[\\\"4\\\"] = \\\"7,\\\"\\n tree[\\\"5\\\"] = \\\",\\\"\\n tree[\\\"6\\\"] = \\\"8,9\\\"\\n tree[\\\"7\\\"] = \\\",\\\"\\n tree[\\\"8\\\"] = \\\",\\\"\\n tree[\\\"9\\\"] = \\\",\\\"\\n\\n preorder(tree,\\\"1\\\",result)\\n printf \\\"preorder:\\\\t\\\"\\n for (n = 0; n < result[\\\"count\\\"]; n += 1)\\n printf result[n]\\\" \\\"\\n printf \\\"\\\\n\\\"\\n delete result\\n\\n inorder(tree,\\\"1\\\",result)\\n printf \\\"inorder:\\\\t\\\"\\n for (n = 0; n < result[\\\"count\\\"]; n += 1)\\n printf result[n]\\\" \\\"\\n printf \\\"\\\\n\\\"\\n delete result\\n\\n postorder(tree,\\\"1\\\",result)\\n printf \\\"postorder:\\\\t\\\"\\n for (n = 0; n < result[\\\"count\\\"]; n += 1)\\n printf result[n]\\\" \\\"\\n printf \\\"\\\\n\\\"\\n delete result\\n\\n levelorder(tree,\\\"1\\\",result)\\n printf \\\"level-order:\\\\t\\\"\\n for (n = 0; n < result[\\\"count\\\"]; n += 1)\\n printf result[n]\\\" \\\"\\n printf \\\"\\\\n\\\"\\n delete result\\n}\\n\",\n \"language\": \"AWK\"\n },\n {\n \"code\": \"get \\\"libhdr\\\"\\nmanifest $(\\n VAL=0\\n LEFT=1\\n RIGHT=2\\n$)\\n\\nlet tree(v,l,r) = valof\\n$( let obj = getvec(2)\\n obj!VAL := v\\n obj!LEFT := l\\n obj!RIGHT := r\\n resultis obj\\n$)\\n\\nlet preorder(tree, cb) be unless tree=0\\n$( cb(tree!VAL)\\n preorder(tree!LEFT, cb)\\n preorder(tree!RIGHT, cb)\\n$)\\n\\nlet inorder(tree, cb) be unless tree=0\\n$( inorder(tree!LEFT, cb)\\n cb(tree!VAL)\\n inorder(tree!RIGHT, cb)\\n$)\\n\\nlet postorder(tree, cb) be unless tree=0\\n$( postorder(tree!LEFT, cb)\\n postorder(tree!RIGHT, cb)\\n cb(tree!VAL)\\n$)\\n\\nlet levelorder(tree, cb) be\\n$( let q=vec 255\\n let s=0 and e=1\\n q!0 := tree\\n until s=e do\\n $( unless q!s=0 do\\n $( q!e := q!s!LEFT\\n q!(e+1) := q!s!RIGHT\\n e := e+2\\n cb(q!s!VAL)\\n $)\\n s := s+1\\n $)\\n$)\\n\\nlet traverse(name, order, tree) be\\n$( let cb(n) be writef(\\\"%N \\\", n)\\n writef(\\\"%S:*T\\\", name)\\n order(tree, cb)\\n wrch('*N')\\n$)\\n\\nlet start() be\\n$( let example = tree(1, tree(2, tree(4, tree(7, 0, 0), 0),\\n tree(5, 0, 0)),\\n tree(3, tree(6, tree(8, 0, 0),\\n tree(9, 0, 0)),\\n 0))\\n traverse(\\\"preorder\\\", preorder, example)\\n traverse(\\\"inorder\\\", inorder, example)\\n traverse(\\\"postorder\\\", postorder, example)\\n traverse(\\\"level-order\\\", levelorder, example)\\n$)\\n\",\n \"language\": \"BCPL\"\n },\n {\n \"code\": \"(\\n ( tree\\n = 1\\n . (2.(4.7.) (5.))\\n (3.6.(8.) (9.))\\n )\\n& ( preorder\\n = K sub\\n . !arg:(?K.?sub) ?arg\\n & !K preorder$!sub preorder$!arg\\n |\\n )\\n& out$(\\\"preorder: \\\" preorder$!tree)\\n& ( inorder\\n = K lhs rhs\\n . !arg:(?K.?sub) ?arg\\n & ( !sub:%?lhs ?rhs\\n & inorder$!lhs !K inorder$!rhs inorder$!arg\\n | !K\\n )\\n )\\n& out$(\\\"inorder: \\\" inorder$!tree)\\n& ( postorder\\n = K sub\\n . !arg:(?K.?sub) ?arg\\n & postorder$!sub !K postorder$!arg\\n |\\n )\\n& out$(\\\"postorder: \\\" postorder$!tree)\\n& ( levelorder\\n = todo tree sub\\n . !arg:(.)&\\n | !arg:(?tree.?todo)\\n & ( !tree:(?K.?sub) ?tree\\n & !K levelorder$(!tree.!todo !sub)\\n | levelorder$(!todo.)\\n )\\n )\\n& out$(\\\"level-order:\\\" levelorder$(!tree.))\\n&\\n)\\n\",\n \"language\": \"Bracmat\"\n },\n {\n \"code\": \"#include <stdlib.h>\\n#include <stdio.h>\\n\\ntypedef struct node_s\\n{\\n int value;\\n struct node_s* left;\\n struct node_s* right;\\n} *node;\\n\\nnode tree(int v, node l, node r)\\n{\\n node n = malloc(sizeof(struct node_s));\\n n->value = v;\\n n->left = l;\\n n->right = r;\\n return n;\\n}\\n\\nvoid destroy_tree(node n)\\n{\\n if (n->left)\\n destroy_tree(n->left);\\n if (n->right)\\n destroy_tree(n->right);\\n free(n);\\n}\\n\\nvoid preorder(node n, void (*f)(int))\\n{\\n f(n->value);\\n if (n->left)\\n preorder(n->left, f);\\n if (n->right)\\n preorder(n->right, f);\\n}\\n\\nvoid inorder(node n, void (*f)(int))\\n{\\n if (n->left)\\n inorder(n->left, f);\\n f(n->value);\\n if (n->right)\\n inorder(n->right, f);\\n}\\n\\nvoid postorder(node n, void (*f)(int))\\n{\\n if (n->left)\\n postorder(n->left, f);\\n if (n->right)\\n postorder(n->right, f);\\n f(n->value);\\n}\\n\\n/* helper queue for levelorder */\\ntypedef struct qnode_s\\n{\\n struct qnode_s* next;\\n node value;\\n} *qnode;\\n\\ntypedef struct { qnode begin, end; } queue;\\n\\nvoid enqueue(queue* q, node n)\\n{\\n qnode node = malloc(sizeof(struct qnode_s));\\n node->value = n;\\n node->next = 0;\\n if (q->end)\\n q->end->next = node;\\n else\\n q->begin = node;\\n q->end = node;\\n}\\n\\nnode dequeue(queue* q)\\n{\\n node tmp = q->begin->value;\\n qnode second = q->begin->next;\\n free(q->begin);\\n q->begin = second;\\n if (!q->begin)\\n q->end = 0;\\n return tmp;\\n}\\n\\nint queue_empty(queue* q)\\n{\\n return !q->begin;\\n}\\n\\nvoid levelorder(node n, void(*f)(int))\\n{\\n queue nodequeue = {};\\n enqueue(&nodequeue, n);\\n while (!queue_empty(&nodequeue))\\n {\\n node next = dequeue(&nodequeue);\\n f(next->value);\\n if (next->left)\\n enqueue(&nodequeue, next->left);\\n if (next->right)\\n enqueue(&nodequeue, next->right);\\n }\\n}\\n\\nvoid print(int n)\\n{\\n printf(\\\"%d \\\", n);\\n}\\n\\nint main()\\n{\\n node n = tree(1,\\n tree(2,\\n tree(4,\\n tree(7, 0, 0),\\n 0),\\n tree(5, 0, 0)),\\n tree(3,\\n tree(6,\\n tree(8, 0, 0),\\n tree(9, 0, 0)),\\n 0));\\n\\n printf(\\\"preorder: \\\");\\n preorder(n, print);\\n printf(\\\"\\\\n\\\");\\n\\n printf(\\\"inorder: \\\");\\n inorder(n, print);\\n printf(\\\"\\\\n\\\");\\n\\n printf(\\\"postorder: \\\");\\n postorder(n, print);\\n printf(\\\"\\\\n\\\");\\n\\n printf(\\\"level-order: \\\");\\n levelorder(n, print);\\n printf(\\\"\\\\n\\\");\\n\\n destroy_tree(n);\\n\\n return 0;\\n}\\n\",\n \"language\": \"C\"\n },\n {\n \"code\": \"#include <boost/scoped_ptr.hpp>\\n#include <iostream>\\n#include <queue>\\n\\ntemplate<typename T>\\nclass TreeNode {\\npublic:\\n TreeNode(const T& n, TreeNode* left = NULL, TreeNode* right = NULL)\\n : mValue(n),\\n mLeft(left),\\n mRight(right) {}\\n\\n T getValue() const {\\n return mValue;\\n }\\n\\n TreeNode* left() const {\\n return mLeft.get();\\n }\\n\\n TreeNode* right() const {\\n return mRight.get();\\n }\\n\\n void preorderTraverse() const {\\n std::cout << \\\" \\\" << getValue();\\n if(mLeft) { mLeft->preorderTraverse(); }\\n if(mRight) { mRight->preorderTraverse(); }\\n }\\n\\n void inorderTraverse() const {\\n if(mLeft) { mLeft->inorderTraverse(); }\\n std::cout << \\\" \\\" << getValue();\\n if(mRight) { mRight->inorderTraverse(); }\\n }\\n\\n void postorderTraverse() const {\\n if(mLeft) { mLeft->postorderTraverse(); }\\n if(mRight) { mRight->postorderTraverse(); }\\n std::cout << \\\" \\\" << getValue();\\n }\\n\\n void levelorderTraverse() const {\\n std::queue<const TreeNode*> q;\\n q.push(this);\\n\\n while(!q.empty()) {\\n const TreeNode* n = q.front();\\n q.pop();\\n std::cout << \\\" \\\" << n->getValue();\\n\\n if(n->left()) { q.push(n->left()); }\\n if(n->right()) { q.push(n->right()); }\\n }\\n }\\n\\nprotected:\\n T mValue;\\n boost::scoped_ptr<TreeNode> mLeft;\\n boost::scoped_ptr<TreeNode> mRight;\\n\\nprivate:\\n TreeNode();\\n};\\n\\nint main() {\\n TreeNode<int> root(1,\\n new TreeNode<int>(2,\\n new TreeNode<int>(4,\\n new TreeNode<int>(7)),\\n new TreeNode<int>(5)),\\n new TreeNode<int>(3,\\n new TreeNode<int>(6,\\n new TreeNode<int>(8),\\n new TreeNode<int>(9))));\\n\\n std::cout << \\\"preorder: \\\";\\n root.preorderTraverse();\\n std::cout << std::endl;\\n\\n std::cout << \\\"inorder: \\\";\\n root.inorderTraverse();\\n std::cout << std::endl;\\n\\n std::cout << \\\"postorder: \\\";\\n root.postorderTraverse();\\n std::cout << std::endl;\\n\\n std::cout << \\\"level-order:\\\";\\n root.levelorderTraverse();\\n std::cout << std::endl;\\n\\n return 0;\\n}\\n\",\n \"language\": \"C++\"\n },\n {\n \"code\": \"#include <iostream>\\n\\nusing namespace std;\\n\\nconst int MAX_DIM = 16;\\n\\ntypedef int* tree;\\n\\nint left(int index)\\n{\\n return index*2+1;\\n}\\n\\nint right(int index)\\n{\\n return index*2+2;\\n}\\n\\nvoid preorder(tree t, int index = 0)\\n{\\n if(index < MAX_DIM && t[index] != 0){\\n cout << t[index] << ' ';\\n preorder(t, left(index));\\n preorder(t, right(index));\\n }\\n}\\n\\nvoid inorder(tree t, int index = 0)\\n{\\n if(index < MAX_DIM && t[index] != 0){\\n inorder(t, left(index));\\n cout << t[index] << ' ';\\n inorder(t, right(index));\\n }\\n}\\n\\nvoid postorder(tree t, int index = 0)\\n{\\n if(index < MAX_DIM && t[index] != 0){\\n postorder(t, left(index));\\n postorder(t, right(index));\\n cout << t[index] << ' ';\\n }\\n}\\n\\nvoid level_order(tree t, int index = 0)\\n{\\n for(int i = 0; i < MAX_DIM; ++i){\\n if(t[i] != 0)\\n cout << t[i] << ' ';\\n }\\n}\\n\\nint main()\\n{\\n int t[MAX_DIM] = {1,2,3,4,5,6,0,7,0,0,0,8,9};\\n cout << \\\"preorder: \\\";\\n preorder(t);\\n cout << endl;\\n cout << \\\"inorder: \\\";\\n inorder(t);\\n cout << endl;\\n cout << \\\"postorder: \\\";\\n postorder(t);\\n cout << endl;\\n cout << \\\"level_order: \\\";\\n level_order(t);\\n cout << endl;\\n}\\n\",\n \"language\": \"C++\"\n },\n {\n \"code\": \"#include <iostream>\\n#include <memory>\\n#include <queue>\\n\\ntemplate <typename T>\\nclass node {\\npublic:\\n node(T value) : value_(value) {}\\n node(T value, std::unique_ptr<node>&& left)\\n : value_(value), left_(std::move(left)) {}\\n node(T value, std::unique_ptr<node>&& left, std::unique_ptr<node>&& right)\\n : value_(value), left_(std::move(left)), right_(std::move(right)) {}\\n\\n template <typename Function>\\n void pre_order(Function f) {\\n f(value_);\\n if (left_)\\n left_->pre_order(f);\\n if (right_)\\n right_->pre_order(f);\\n }\\n\\n template <typename Function>\\n void in_order(Function f) {\\n if (left_)\\n left_->in_order(f);\\n f(value_);\\n if (right_)\\n right_->in_order(f);\\n }\\n\\n template <typename Function>\\n void post_order(Function f) {\\n if (left_)\\n left_->post_order(f);\\n if (right_)\\n right_->post_order(f);\\n f(value_);\\n }\\n\\n template <typename Function>\\n void level_order(Function f) {\\n std::queue<node*> queue;\\n queue.push(this);\\n while (!queue.empty()) {\\n node* next = queue.front();\\n queue.pop();\\n f(next->value_);\\n if (next->left_)\\n queue.push(next->left_.get());\\n if (next->right_)\\n queue.push(next->right_.get());\\n }\\n }\\nprivate:\\n T value_;\\n std::unique_ptr<node> left_;\\n std::unique_ptr<node> right_;\\n};\\n\\ntemplate <typename T, typename... Args>\\nstd::unique_ptr<node<T>>\\ntree(T value, Args&&... args) {\\n return std::make_unique<node<T>>(value, std::forward<Args>(args)...);\\n}\\n\\nint main() {\\n node<int> n(1,\\n tree(2,\\n tree(4,\\n tree(7)),\\n tree(5)),\\n tree(3,\\n tree(6,\\n tree(8),\\n tree(9))));\\n\\n auto print = [](int n) { std::cout << n << ' '; };\\n\\n std::cout << \\\"pre-order: \\\";\\n n.pre_order(print);\\n std::cout << '\\\\n';\\n\\n std::cout << \\\"in-order: \\\";\\n n.in_order(print);\\n std::cout << '\\\\n';\\n\\n std::cout << \\\"post-order: \\\";\\n n.post_order(print);\\n std::cout << '\\\\n';\\n\\n std::cout << \\\"level-order: \\\";\\n n.level_order(print);\\n std::cout << '\\\\n';\\n}\\n\",\n \"language\": \"C++\"\n },\n {\n \"code\": \"using System;\\nusing System.Collections.Generic;\\nusing System.Linq;\\n\\nclass Node\\n{\\n int Value;\\n Node Left;\\n Node Right;\\n\\n Node(int value = default(int), Node left = default(Node), Node right = default(Node))\\n {\\n Value = value;\\n Left = left;\\n Right = right;\\n }\\n\\n IEnumerable<int> Preorder()\\n {\\n yield return Value;\\n if (Left != null)\\n foreach (var value in Left.Preorder())\\n yield return value;\\n if (Right != null)\\n foreach (var value in Right.Preorder())\\n yield return value;\\n }\\n\\n IEnumerable<int> Inorder()\\n {\\n if (Left != null)\\n foreach (var value in Left.Inorder())\\n yield return value;\\n yield return Value;\\n if (Right != null)\\n foreach (var value in Right.Inorder())\\n yield return value;\\n }\\n\\n IEnumerable<int> Postorder()\\n {\\n if (Left != null)\\n foreach (var value in Left.Postorder())\\n yield return value;\\n if (Right != null)\\n foreach (var value in Right.Postorder())\\n yield return value;\\n yield return Value;\\n }\\n\\n IEnumerable<int> LevelOrder()\\n {\\n var queue = new Queue<Node>();\\n queue.Enqueue(this);\\n while (queue.Any())\\n {\\n var node = queue.Dequeue();\\n yield return node.Value;\\n if (node.Left != null)\\n queue.Enqueue(node.Left);\\n if (node.Right != null)\\n queue.Enqueue(node.Right);\\n }\\n }\\n\\n static void Main()\\n {\\n var tree = new Node(1, new Node(2, new Node(4, new Node(7)), new Node(5)), new Node(3, new Node(6, new Node(8), new Node(9))));\\n foreach (var traversal in new Func<IEnumerable<int>>[] { tree.Preorder, tree.Inorder, tree.Postorder, tree.LevelOrder })\\n Console.WriteLine(\\\"{0}:\\\\t{1}\\\", traversal.Method.Name, string.Join(\\\" \\\", traversal()));\\n }\\n}\\n\",\n \"language\": \"C-sharp\"\n },\n {\n \"code\": \"import ceylon.collection {\\n\\tArrayList\\n}\\n\\nshared void run() {\\n\\n\\tclass Node(label, left = null, right = null) {\\n\\t\\tshared Integer label;\\n\\t\\tshared Node? left;\\n\\t\\tshared Node? right;\\n\\t\\tstring => label.string;\\n\\t}\\n\\t\\n\\tvoid preorder(Node node) {\\n\\t\\tprocess.write(node.string + \\\" \\\");\\n\\t\\tif(exists left = node.left) {\\n\\t\\t\\tpreorder(left);\\n\\t\\t}\\n\\t\\tif(exists right = node.right) {\\n\\t\\t\\tpreorder(right);\\n\\t\\t}\\n\\t}\\n\\t\\n\\tvoid inorder(Node node) {\\n\\t\\tif(exists left = node.left) {\\n\\t\\t\\tinorder(left);\\n\\t\\t}\\n\\t\\tprocess.write(node.string + \\\" \\\");\\n\\t\\tif(exists right = node.right) {\\n\\t\\t\\tinorder(right);\\n\\t\\t}\\n\\t}\\n\\t\\n\\tvoid postorder(Node node) {\\n\\t\\tif(exists left = node.left) {\\n\\t\\t\\tpostorder(left);\\n\\t\\t}\\n\\t\\tif(exists right = node.right) {\\n\\t\\t\\tpostorder(right);\\n\\t\\t}\\n\\t\\tprocess.write(node.string + \\\" \\\");\\n\\t}\\n\\t\\n\\tvoid levelOrder(Node node) {\\n\\t\\tvalue nodes = ArrayList<Node> {node};\\n\\t\\twhile(exists current = nodes.accept()) {\\n\\t\\t\\tprocess.write(current.string + \\\" \\\");\\n\\t\\t\\tif(exists left = current.left) {\\n\\t\\t\\t\\tnodes.offer(left);\\n\\t\\t\\t}\\n\\t\\t\\tif(exists right = current.right) {\\n\\t\\t\\t\\tnodes.offer(right);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\n\\tvalue tree = Node {\\n\\t\\tlabel = 1;\\n\\t\\tleft = Node {\\n\\t\\t\\tlabel = 2;\\n\\t\\t\\tleft = Node {\\n\\t\\t\\t\\tlabel = 4;\\n\\t\\t\\t\\tleft = Node {\\n\\t\\t\\t\\t\\tlabel = 7;\\n\\t\\t\\t\\t};\\n\\t\\t\\t};\\n\\t\\t\\tright = Node {\\n\\t\\t\\t\\tlabel = 5;\\n\\t\\t\\t};\\n\\t\\t};\\n\\t\\tright = Node {\\n\\t\\t\\tlabel = 3;\\n\\t\\t\\tleft = Node {\\n\\t\\t\\t\\tlabel = 6;\\n\\t\\t\\t\\tleft = Node {\\n\\t\\t\\t\\t\\tlabel = 8;\\n\\t\\t\\t\\t};\\n\\t\\t\\t\\tright = Node {\\n\\t\\t\\t\\t\\tlabel = 9;\\n\\t\\t\\t\\t};\\n\\t\\t\\t};\\n\\t\\t};\\n\\t};\\n\\t\\n\\tprocess.write(\\\"preorder: \\\");\\n\\tpreorder(tree);\\n\\tprint(\\\"\\\");\\n\\tprocess.write(\\\"inorder: \\\");\\n\\tinorder(tree);\\n\\tprint(\\\"\\\");\\n\\tprocess.write(\\\"postorder: \\\");\\n\\tpostorder(tree);\\n\\tprint(\\\"\\\");\\n\\tprocess.write(\\\"levelorder: \\\");\\n\\tlevelOrder(tree);\\n\\tprint(\\\"\\\");\\n}\\n\",\n \"language\": \"Ceylon\"\n },\n {\n \"code\": \"(defn walk [node f order]\\n (when node\\n (doseq [o order]\\n (if (= o :visit)\\n (f (:val node))\\n (walk (node o) f order)))))\\n\\n(defn preorder [node f]\\n (walk node f [:visit :left :right]))\\n\\n(defn inorder [node f]\\n (walk node f [:left :visit :right]))\\n\\n(defn postorder [node f]\\n (walk node f [:left :right :visit]))\\n\\n(defn queue [& xs]\\n (when (seq xs)\\n (apply conj clojure.lang.PersistentQueue/EMPTY xs)))\\n\\n(defn level-order [root f]\\n (loop [q (queue root)]\\n (when-not (empty? q)\\n (if-let [node (first q)]\\n (do\\n (f (:val node))\\n (recur (conj (pop q) (:left node) (:right node))))\\n (recur (pop q))))))\\n\\n(defn vec-to-tree [t]\\n (if (vector? t)\\n (let [[val left right] t]\\n {:val val\\n :left (vec-to-tree left)\\n :right (vec-to-tree right)})\\n t))\\n\\n(let [tree (vec-to-tree [1 [2 [4 [7]] [5]] [3 [6 [8] [9]]]])\\n fs '[preorder inorder postorder level-order]\\n pr-node #(print (format \\\"%2d\\\" %))]\\n (doseq [f fs]\\n (print (format \\\"%-12s\\\" (str f \\\":\\\")))\\n ((resolve f) tree pr-node)\\n (println)))\\n\",\n \"language\": \"Clojure\"\n },\n {\n \"code\": \"bintree = cluster [T: type] is leaf, node,\\n pre_order, post_order, in_order, level_order\\n branch = struct[left, right: bintree[T], val: T]\\n rep = oneof[br: branch, leaf: null]\\n\\n leaf = proc () returns (cvt)\\n return(rep$make_leaf(nil))\\n end leaf\\n\\n node = proc (val: T, l,r: cvt) returns (cvt)\\n return(rep$make_br(branch${left:up(l), right:up(r), val:val}))\\n end node\\n\\n pre_order = iter (n: cvt) yields (T)\\n tagcase n\\n tag br (b: branch):\\n yield(b.val)\\n for v: T in pre_order(b.left) do yield(v) end\\n for v: T in pre_order(b.right) do yield(v) end\\n tag leaf:\\n end\\n end pre_order\\n\\n in_order = iter (n: cvt) yields (T)\\n tagcase n\\n tag br (b: branch):\\n for v: T in in_order(b.left) do yield(v) end\\n yield(b.val)\\n for v: T in in_order(b.right) do yield(v) end\\n tag leaf:\\n end\\n end in_order\\n\\n post_order = iter (n: cvt) yields (T)\\n tagcase n\\n tag br (b: branch):\\n for v: T in post_order(b.left) do yield(v) end\\n for v: T in post_order(b.right) do yield(v) end\\n yield(b.val)\\n tag leaf:\\n end\\n end post_order\\n\\n level_order = iter (n: cvt) yields (T)\\n bfs: array[rep] := array[rep]$[n]\\n while ~array[rep]$empty(bfs) do\\n cur: rep := array[rep]$reml(bfs)\\n tagcase cur\\n tag br (b: branch):\\n yield(b.val)\\n array[rep]$addh(bfs,down(b.left))\\n array[rep]$addh(bfs,down(b.right))\\n tag leaf:\\n end\\n end\\n end level_order\\nend bintree\\n\\nstart_up = proc ()\\n bt = bintree[int]\\n\\n po: stream := stream$primary_output()\\n tree: bt := bt$node(1,\\n bt$node(2,\\n bt$node(4,\\n bt$node(7, bt$leaf(), bt$leaf()),\\n bt$leaf()),\\n bt$node(5, bt$leaf(), bt$leaf())),\\n bt$node(3,\\n bt$node(6,\\n bt$node(8, bt$leaf(), bt$leaf()),\\n bt$node(9, bt$leaf(), bt$leaf())),\\n bt$leaf()))\\n\\n stream$puts(po, \\\"preorder: \\\")\\n for i: int in bt$pre_order(tree) do\\n stream$puts(po, \\\" \\\" || int$unparse(i))\\n end\\n\\n stream$puts(po, \\\"\\\\ninorder: \\\")\\n for i: int in bt$in_order(tree) do\\n stream$puts(po, \\\" \\\" || int$unparse(i))\\n end\\n\\n stream$puts(po, \\\"\\\\npostorder: \\\")\\n for i: int in bt$post_order(tree) do\\n stream$puts(po, \\\" \\\" || int$unparse(i))\\n end\\n\\n stream$puts(po, \\\"\\\\nlevel-order:\\\")\\n for i: int in bt$level_order(tree) do\\n stream$puts(po, \\\" \\\" || int$unparse(i))\\n end\\nend start_up\\n\",\n \"language\": \"CLU\"\n },\n {\n \"code\": \"# In this example, we don't encapsulate binary trees as objects; instead, we have a\\n# convention on how to store them as arrays, and we namespace the functions that\\n# operate on those data structures.\\nbinary_tree =\\n preorder: (tree, visit) ->\\n return unless tree?\\n [node, left, right] = tree\\n visit node\\n binary_tree.preorder left, visit\\n binary_tree.preorder right, visit\\n\\n inorder: (tree, visit) ->\\n return unless tree?\\n [node, left, right] = tree\\n binary_tree.inorder left, visit\\n visit node\\n binary_tree.inorder right, visit\\n\\n postorder: (tree, visit) ->\\n return unless tree?\\n [node, left, right] = tree\\n binary_tree.postorder left, visit\\n binary_tree.postorder right, visit\\n visit node\\n\\n levelorder: (tree, visit) ->\\n q = []\\n q.push tree\\n while q.length > 0\\n t = q.shift()\\n continue unless t?\\n [node, left, right] = t\\n visit node\\n q.push left\\n q.push right\\n\\ndo ->\\n tree = [1, [2, [4, [7]], [5]], [3, [6, [8],[9]]]]\\n test_walk = (walk_function_name) ->\\n output = []\\n binary_tree[walk_function_name] tree, output.push.bind(output)\\n console.log walk_function_name, output.join ' '\\n test_walk \\\"preorder\\\"\\n test_walk \\\"inorder\\\"\\n test_walk \\\"postorder\\\"\\n test_walk \\\"levelorder\\\"\\n\",\n \"language\": \"CoffeeScript\"\n },\n {\n \"code\": \"(defun preorder (node f)\\n (when node\\n (funcall f (first node))\\n (preorder (second node) f)\\n (preorder (third node) f)))\\n\\n(defun inorder (node f)\\n (when node\\n (inorder (second node) f)\\n (funcall f (first node))\\n (inorder (third node) f)))\\n\\n(defun postorder (node f)\\n (when node\\n (postorder (second node) f)\\n (postorder (third node) f)\\n (funcall f (first node))))\\n\\n(defun level-order (node f)\\n (loop with level = (list node)\\n while level\\n do\\n (setf level (loop for node in level\\n when node\\n do (funcall f (first node))\\n and collect (second node)\\n and collect (third node)))))\\n\\n(defparameter *tree* '(1 (2 (4 (7))\\n (5))\\n (3 (6 (8)\\n (9)))))\\n\\n(defun show (traversal-function)\\n (format t \\\"~&~(~A~):~12,0T\\\" traversal-function)\\n (funcall traversal-function *tree* (lambda (value) (format t \\\" ~A\\\" value))))\\n\\n(map nil #'show '(preorder inorder postorder level-order))\\n\",\n \"language\": \"Common-Lisp\"\n },\n {\n \"code\": \"Require Import Utf8.\\nRequire Import List.\\n\\nUnset Elimination Schemes.\\n\\n(* Rose tree, with numbers on nodes *)\\nInductive tree := Tree { value : nat ; children : list tree }.\\n\\nFixpoint height (t: tree) : nat :=\\n 1 + fold_left (? n t, max n (height t)) (children t) 0.\\n\\nExample leaf n : tree := {| value := n ; children := nil |}.\\n\\nExample t2 : tree := {| value := 2 ; children := {| value := 4 ; children := leaf 7 :: nil |} :: leaf 5 :: nil |}.\\n\\nExample t3 : tree := {| value := 3 ; children := {| value := 6 ; children := leaf 8 :: leaf 9 :: nil |} :: nil |}.\\n\\nExample t9 : tree := {| value := 1 ; children := t2 :: t3 :: nil |}.\\n\\nFixpoint preorder (t: tree) : list nat :=\\n let '{| value := n ; children := c |} := t in\\n n :: flat_map preorder c.\\n\\nFixpoint inorder (t: tree) : list nat :=\\n let '{| value := n ; children := c |} := t in\\n match c with\\n | nil => n :: nil\\n | l :: r => inorder l ++ n :: flat_map inorder r\\n end.\\n\\nFixpoint postorder (t: tree) : list nat :=\\n let '{| value := n ; children := c |} := t in\\n flat_map postorder c ++ n :: nil.\\n\\n(* Auxiliary function for levelorder, which operates on forests *)\\n(* Since the recursion is tricky, it relies on a fuel parameter which obviously decreases. *)\\nFixpoint levelorder_forest (fuel: nat) (f: list tree) : list nat:=\\n match fuel with\\n | O => nil\\n | S fuel' =>\\n let '(p, f) := fold_right (? t r, let '(x, f) := r in (value t :: x, children t ++ f) ) (nil, nil) f in\\n p ++ levelorder_forest fuel' f\\n end.\\n\\nDefinition levelorder (t: tree) : list nat :=\\n levelorder_forest (height t) (t :: nil).\\n\\nCompute preorder t9.\\nCompute inorder t9.\\nCompute postorder t9.\\nCompute levelorder t9.\\n\",\n \"language\": \"Coq\"\n },\n {\n \"code\": \"class Node(T)\\n property left : Nil | Node(T)\\n property right : Nil | Node(T)\\n property data : T\\n\\n def initialize(@data, @left = nil, @right = nil)\\n end\\n\\n def preorder_traverse\\n print \\\" #{data}\\\"\\n if left = @left\\n left.preorder_traverse\\n end\\n if right = @right\\n right.preorder_traverse\\n end\\n end\\n\\n def inorder_traverse\\n if left = @left\\n left.inorder_traverse\\n end\\n print \\\" #{data}\\\"\\n if right = @right\\n right.inorder_traverse\\n end\\n end\\n\\n def postorder_traverse\\n if left = @left\\n left.postorder_traverse\\n end\\n if right = @right\\n right.postorder_traverse\\n end\\n print \\\" #{data}\\\"\\n end\\n\\n def levelorder_traverse\\n queue = Array(Node(T)).new\\n queue << self\\n\\n until queue.size <= 0\\n node = queue.shift\\n\\n unless node\\n next\\n end\\n\\n print \\\" #{node.data}\\\"\\n\\n if left = node.left\\n queue << left\\n end\\n if right = node.right\\n queue << right\\n end\\n end\\n end\\nend\\n\\ntree = Node(Int32).new(1,\\n Node(Int32).new(2,\\n Node(Int32).new(4,\\n Node(Int32).new(7)),\\n Node(Int32).new(5)),\\n Node(Int32).new(3,\\n Node(Int32).new(6,\\n Node(Int32).new(8),\\n Node(Int32).new(9))))\\n\\nprint \\\"preorder: \\\"\\ntree.preorder_traverse\\nprint \\\"\\\\ninorder: \\\"\\ntree.inorder_traverse\\nprint \\\"\\\\npostorder: \\\"\\ntree.postorder_traverse\\nprint \\\"\\\\nlevelorder: \\\"\\ntree.levelorder_traverse\\nputs\\n\",\n \"language\": \"Crystal\"\n },\n {\n \"code\": \"import std.stdio, std.traits;\\n\\nconst final class Node(T) {\\n T data;\\n Node left, right;\\n\\n this(in T data, in Node left=null, in Node right=null)\\n const pure nothrow {\\n this.data = data;\\n this.left = left;\\n this.right = right;\\n }\\n}\\n\\n// 'static' templated opCall can't be used in Node\\nauto node(T)(in T data, in Node!T left=null, in Node!T right=null)\\npure nothrow {\\n return new const(Node!T)(data, left, right);\\n}\\n\\nvoid show(T)(in T x) {\\n write(x, \\\" \\\");\\n}\\n\\nenum Visit { pre, inv, post }\\n\\n// 'visitor' can be any kind of callable or it uses a default visitor.\\n// TNode can be any kind of Node, with data, left and right fields,\\n// so this is more generic than a member function of Node.\\nvoid backtrackingOrder(Visit v, TNode, TyF=void*)\\n (in TNode node, TyF visitor=null) {\\n alias trueVisitor = Select!(is(TyF == void*), show, visitor);\\n if (node !is null) {\\n static if (v == Visit.pre)\\n trueVisitor(node.data);\\n backtrackingOrder!v(node.left, visitor);\\n static if (v == Visit.inv)\\n trueVisitor(node.data);\\n backtrackingOrder!v(node.right, visitor);\\n static if (v == Visit.post)\\n trueVisitor(node.data);\\n }\\n}\\n\\nvoid levelOrder(TNode, TyF=void*)\\n (in TNode node, TyF visitor=null, const(TNode)[] more=[]) {\\n alias trueVisitor = Select!(is(TyF == void*), show, visitor);\\n if (node !is null) {\\n more ~= [node.left, node.right];\\n trueVisitor(node.data);\\n }\\n if (more.length)\\n levelOrder(more[0], visitor, more[1 .. $]);\\n}\\n\\nvoid main() {\\n alias N = node;\\n const tree = N(1,\\n N(2,\\n N(4,\\n N(7)),\\n N(5)),\\n N(3,\\n N(6,\\n N(8),\\n N(9))));\\n\\n write(\\\" preOrder: \\\");\\n tree.backtrackingOrder!(Visit.pre);\\n write(\\\"\\\\n inorder: \\\");\\n tree.backtrackingOrder!(Visit.inv);\\n write(\\\"\\\\n postOrder: \\\");\\n tree.backtrackingOrder!(Visit.post);\\n write(\\\"\\\\nlevelorder: \\\");\\n tree.levelOrder;\\n writeln;\\n}\\n\",\n \"language\": \"D\"\n },\n {\n \"code\": \"const struct Node(T) {\\n T v;\\n Node* l, r;\\n}\\n\\nT[] preOrder(T)(in Node!T* t) pure nothrow {\\n return t ? t.v ~ preOrder(t.l) ~ preOrder(t.r) : [];\\n}\\n\\nT[] inOrder(T)(in Node!T* t) pure nothrow {\\n return t ? inOrder(t.l) ~ t.v ~ inOrder(t.r) : [];\\n}\\n\\nT[] postOrder(T)(in Node!T* t) pure nothrow {\\n return t ? postOrder(t.l) ~ postOrder(t.r) ~ t.v : [];\\n}\\n\\nT[] levelOrder(T)(in Node!T* t) pure nothrow {\\n static T[] loop(in Node!T*[] a) pure nothrow {\\n if (!a.length) return [];\\n if (!a[0]) return loop(a[1 .. $]);\\n return a[0].v ~ loop(a[1 .. $] ~ [a[0].l, a[0].r]);\\n }\\n return loop([t]);\\n}\\n\\nvoid main() {\\n alias N = Node!int;\\n auto tree = new N(1,\\n new N(2,\\n new N(4,\\n new N(7)),\\n new N(5)),\\n new N(3,\\n new N(6,\\n new N(8),\\n new N(9))));\\n\\n import std.stdio;\\n writeln(preOrder(tree));\\n writeln(inOrder(tree));\\n writeln(postOrder(tree));\\n writeln(levelOrder(tree));\\n}\\n\",\n \"language\": \"D\"\n },\n {\n \"code\": \"import std.stdio, std.algorithm, std.range, std.string;\\n\\nconst struct Tree(T) {\\n T value;\\n Tree* left, right;\\n}\\n\\nalias VisitRange(T) = InputRange!(const Tree!T);\\n\\nVisitRange!T preOrder(T)(in Tree!T* t) /*pure nothrow*/ {\\n enum self = mixin(\\\"&\\\" ~ __FUNCTION__.split(\\\".\\\").back);\\n if (t == null)\\n return typeof(return).init.takeNone.inputRangeObject;\\n return [*t]\\n .chain([t.left, t.right]\\n .filter!(t => t != null)\\n .map!(a => self(a))\\n .joiner)\\n .inputRangeObject;\\n}\\n\\nVisitRange!T inOrder(T)(in Tree!T* t) /*pure nothrow*/ {\\n enum self = mixin(\\\"&\\\" ~ __FUNCTION__.split(\\\".\\\").back);\\n if (t == null)\\n return typeof(return).init.takeNone.inputRangeObject;\\n return [t.left]\\n .filter!(t => t != null)\\n .map!(a => self(a))\\n .joiner\\n .chain([*t])\\n .chain([t.right]\\n .filter!(t => t != null)\\n .map!(a => self(a))\\n .joiner)\\n .inputRangeObject;\\n}\\n\\nVisitRange!T postOrder(T)(in Tree!T* t) /*pure nothrow*/ {\\n enum self = mixin(\\\"&\\\" ~ __FUNCTION__.split(\\\".\\\").back);\\n if (t == null)\\n return typeof(return).init.takeNone.inputRangeObject;\\n return [t.left, t.right]\\n .filter!(t => t != null)\\n .map!(a => self(a))\\n .joiner\\n .chain([*t])\\n .inputRangeObject;\\n}\\n\\nvoid main() {\\n alias N = Tree!int;\\n const tree = new N(1,\\n new N(2,\\n new N(4,\\n new N(7)),\\n new N(5)),\\n new N(3,\\n new N(6,\\n new N(8),\\n new N(9))));\\n\\n tree.preOrder.map!(t => t.value).writeln;\\n tree.inOrder.map!(t => t.value).writeln;\\n tree.postOrder.map!(t => t.value).writeln;\\n}\\n\",\n \"language\": \"D\"\n },\n {\n \"code\": \"{Structure holding node data}\\n\\ntype PNode = ^TNode;\\n TNode = record\\n Data: integer;\\n Left,Right: PNode;\\n end;\\n\\n\\nfunction PreOrder(Node: TNode): string;\\n{Recursively traverse Node-Left-Right}\\nbegin\\nResult:=IntToStr(Node.Data);\\nif Node.Left<>nil then Result:=Result+' '+PreOrder(Node.Left^);\\nif Node.Right<>nil then Result:=Result+' '+PreOrder(Node.Right^);\\nend;\\n\\n\\nfunction InOrder(Node: TNode): string;\\n{Recursively traverse Left-Node-Right}\\nbegin\\nResult:='';\\nif Node.Left<>nil then Result:=Result+inOrder(Node.Left^);\\nResult:=Result+IntToStr(Node.Data)+' ';\\nif Node.Right<>nil then Result:=Result+inOrder(Node.Right^);\\nend;\\n\\n\\nfunction PostOrder(Node: TNode): string;\\n{Recursively traverse Left-Right-Node}\\nbegin\\nResult:='';\\nif Node.Left<>nil then Result:=Result+PostOrder(Node.Left^);\\nif Node.Right<>nil then Result:=Result+PostOrder(Node.Right^);\\nResult:=Result+IntToStr(Node.Data)+' ';\\nend;\\n\\n\\nfunction LevelOrder(Node: TNode): string;\\n{Traverse the tree at each level, Left to right}\\nvar Queue: TList;\\nvar NT: TNode;\\nbegin\\nQueue:=TList.Create;\\ntry\\nResult:='';\\nQueue.Add(@Node);\\nwhile true do\\n\\tbegin\\n\\t{Display oldest node in queue}\\n\\tNT:=PNode(Queue[0])^;\\n\\tQueue.Delete(0);\\n\\tResult:=Result+IntToStr(NT.Data)+' ';\\n\\t{Queue left and right children}\\n\\tif NT.left<>nil then Queue.add(NT.left);\\n\\tif NT.right<>nil then Queue.add(NT.right);\\n\\tif Queue.Count<1 then break;\\n end;\\nfinally Queue.Free; end;\\nend;\\n\\n\\nprocedure ShowBinaryTree(Memo: TMemo);\\nvar Tree: array [0..9] of TNode;\\nvar I: integer;\\nbegin\\n{Fill array of node with data}\\n{that matchs its position in the array}\\nfor I:=0 to High(Tree) do\\n\\tbegin\\n\\tTree[I].Data:=I+1;\\n\\tTree[I].Left:=nil;\\n\\tTree[I].Right:=nil;\\n\\tend;\\n{Build the specified tree}\\nTree[0].left:=@Tree[2-1];\\nTree[0].right:=@Tree[3-1];\\nTree[1].left:=@Tree[4-1];\\nTree[1].right:=@Tree[5-1];\\nTree[3].left:=@Tree[7-1];\\nTree[2].left:=@Tree[6-1];\\nTree[5].left:=@Tree[8-1];\\nTree[5].right:=@Tree[9-1];\\n{Tranverse the tree in four specified ways}\\nMemo.Lines.Add('Pre-Order: '+PreOrder(Tree[0]));\\nMemo.Lines.Add('In-Order: '+InOrder(Tree[0]));\\nMemo.Lines.Add('Post-Order: '+PostOrder(Tree[0]));\\nMemo.Lines.Add('Level-Order: '+LevelOrder(Tree[0]));\\nend;\\n\",\n \"language\": \"Delphi\"\n },\n {\n \"code\": \"type\\n Node = struct {\\n int val;\\n *Node left, right;\\n },\\n Tree = *Node;\\n\\nproc tree(int v; Tree l, r) Tree:\\n Tree t;\\n t := new(Node);\\n t*.val := v;\\n t*.left := l;\\n t*.right := r;\\n t\\ncorp\\n\\nproc preorder(Tree t) void:\\n if t /= nil then\\n write(t*.val, ' ');\\n preorder(t*.left);\\n preorder(t*.right)\\n fi\\ncorp\\n\\nproc inorder(Tree t) void:\\n if t /= nil then\\n inorder(t*.left);\\n write(t*.val, ' ');\\n inorder(t*.right)\\n fi\\ncorp\\n\\nproc postorder(Tree t) void:\\n if t /= nil then\\n postorder(t*.left);\\n postorder(t*.right);\\n write(t*.val, ' ')\\n fi\\ncorp\\n\\nproc levelorder(Tree t) void:\\n [256]Tree q;\\n word s, e;\\n s := 0;\\n q[s] := t;\\n e := 1;\\n while s /= e do\\n if q[s] /= nil then\\n q[e] := q[s]*.left;\\n q[e+1] := q[s]*.right;\\n e := e+2;\\n write(q[s]*.val, ' ')\\n fi;\\n s := s+1\\n od\\ncorp\\n\\nproc main() void:\\n Tree t;\\n t := tree(1,\\n tree(2,\\n tree(4,\\n tree(7,nil,nil),\\n nil),\\n tree(5,nil,nil)),\\n tree(3,\\n tree(6,\\n tree(8,nil,nil),\\n tree(9,nil,nil)),\\n nil));\\n\\n write(\\\"preorder: \\\"); preorder(t); writeln();\\n write(\\\"inorder: \\\"); inorder(t); writeln();\\n write(\\\"postorder: \\\"); postorder(t); writeln();\\n write(\\\"level-order: \\\"); levelorder(t); writeln();\\ncorp\\n\",\n \"language\": \"Draco\"\n },\n {\n \"code\": \"def btree := [1, [2, [4, [7, null, null],\\n null],\\n [5, null, null]],\\n [3, [6, [8, null, null],\\n [9, null, null]],\\n null]]\\n\\ndef backtrackingOrder(node, pre, mid, post) {\\n switch (node) {\\n match ==null {}\\n match [value, left, right] {\\n pre(value)\\n backtrackingOrder(left, pre, mid, post)\\n mid(value)\\n backtrackingOrder(right, pre, mid, post)\\n post(value)\\n }\\n }\\n}\\n\\ndef levelOrder(root, func) {\\n var level := [root].diverge()\\n while (level.size() > 0) {\\n for node in level.removeRun(0) {\\n switch (node) {\\n match ==null {}\\n match [value, left, right] {\\n func(value)\\n level.push(left)\\n level.push(right)\\n} } } } }\\n\\nprint(\\\"preorder: \\\")\\nbacktrackingOrder(btree, fn v { print(\\\" \\\", v) }, fn _ {}, fn _ {})\\nprintln()\\n\\nprint(\\\"inorder: \\\")\\nbacktrackingOrder(btree, fn _ {}, fn v { print(\\\" \\\", v) }, fn _ {})\\nprintln()\\n\\nprint(\\\"postorder: \\\")\\nbacktrackingOrder(btree, fn _ {}, fn _ {}, fn v { print(\\\" \\\", v) })\\nprintln()\\n\\nprint(\\\"level-order:\\\")\\nlevelOrder(btree, fn v { print(\\\" \\\", v) })\\nprintln()\\n\",\n \"language\": \"E\"\n },\n {\n \"code\": \"tree[] = [ 1 2 3 4 5 6 -1 7 -1 -1 -1 8 9 ]\\n#\\nproc preorder ind . .\\n if ind > len tree[] or tree[ind] = -1\\n return\\n .\\n write \\\" \\\" & tree[ind]\\n preorder ind * 2\\n preorder ind * 2 + 1\\n.\\nwrite \\\"preorder:\\\"\\npreorder 1\\nprint \\\"\\\"\\n#\\nproc inorder ind . .\\n if ind > len tree[] or tree[ind] = -1\\n return\\n .\\n inorder ind * 2\\n write \\\" \\\" & tree[ind]\\n inorder ind * 2 + 1\\n.\\nwrite \\\"inorder:\\\"\\ninorder 1\\nprint \\\"\\\"\\n#\\nproc postorder ind . .\\n if ind > len tree[] or tree[ind] = -1\\n return\\n .\\n postorder ind * 2\\n postorder ind * 2 + 1\\n write \\\" \\\" & tree[ind]\\n.\\nwrite \\\"postorder:\\\"\\npostorder 1\\nprint \\\"\\\"\\n#\\nglobal tail head queue[] .\\nproc initqu n . .\\n len queue[] n\\n tail = 1\\n head = 1\\n.\\nproc enqu v . .\\n queue[tail] = v\\n tail = (tail + 1) mod1 len queue[]\\n.\\nfunc dequ .\\n if head = tail\\n return -1\\n .\\n h = head\\n head = (head + 1) mod1 len queue[]\\n return queue[h]\\n.\\ninitqu len tree[]\\nproc levelorder n . .\\n enqu n\\n repeat\\n ind = dequ\\n until ind = -1\\n if ind < len tree[] and tree[ind] <> -1\\n write \\\" \\\" & tree[ind]\\n enqu ind * 2\\n enqu ind * 2 + 1\\n .\\n .\\n.\\nwrite \\\"level-order:\\\"\\nlevelorder 1\\nprint \\\"\\\"\\n\",\n \"language\": \"EasyLang\"\n },\n {\n \"code\": \"note\\n\\tdescription : \\\"Application for tree traversal demonstration\\\"\\n output : \\\"[\\n \\t Prints preorder, inorder, postorder and levelorder traversal of an example binary tree.\\n \\t\\t ]\\\"\\n\\tauthor\\t : \\\"Jascha Grübel\\\"\\n\\tdate : \\\"$2014-01-07$\\\"\\n\\trevision : \\\"$1.0$\\\"\\n\\nclass\\n\\tAPPLICATION\\n\\ncreate\\n\\tmake\\n\\nfeature {NONE} -- Initialization\\n\\n\\tmake\\n\\t\\t\\t-- Run Tree traversal example.\\n\\t\\tlocal\\n\\t\\t\\ttree:NODE\\n\\t\\tdo\\n\\t\\t\\tcreate tree.make (1)\\n\\t\\t\\ttree.set_left_child (create {NODE}.make (2))\\n\\t\\t\\ttree.set_right_child (create {NODE}.make (3))\\n\\t\\t\\ttree.left_child.set_left_child (create {NODE}.make (4))\\n\\t\\t\\ttree.left_child.set_right_child (create {NODE}.make (5))\\n\\t\\t\\ttree.left_child.left_child.set_left_child (create {NODE}.make (7))\\n\\t\\t\\ttree.right_child.set_left_child (create {NODE}.make (6))\\n\\t\\t\\ttree.right_child.left_child.set_left_child (create {NODE}.make (8))\\n\\t\\t\\ttree.right_child.left_child.set_right_child (create {NODE}.make (9))\\n\\n\\t\\t\\tIo.put_string (\\\"preorder: \\\")\\n\\t\\t\\ttree.print_preorder\\n\\t\\t\\tIo.put_new_line\\n\\n\\t\\t\\tIo.put_string (\\\"inorder: \\\")\\n\\t\\t\\ttree.print_inorder\\n\\t\\t\\tIo.put_new_line\\n\\n\\t\\t\\tIo.put_string (\\\"postorder: \\\")\\n\\t\\t\\ttree.print_postorder\\n\\t\\t\\tIo.put_new_line\\n\\t\\t\\t\\n\\t\\t\\tIo.put_string (\\\"level-order:\\\")\\n\\t\\t\\ttree.print_levelorder\\n\\t\\t\\tIo.put_new_line\\n\\n\\t\\tend\\n\\nend -- class APPLICATION\\n\",\n \"language\": \"Eiffel\"\n },\n {\n \"code\": \"note\\n\\tdescription : \\\"A simple node for a binary tree\\\"\\n libraries : \\\"Relies on LINKED_LIST from EiffelBase\\\"\\n\\tauthor : \\\"Jascha Grübel\\\"\\n\\tdate : \\\"$2014-01-07$\\\"\\n\\trevision : \\\"$1.0$\\\"\\n implementation : \\\"[\\n\\t\\t\\t All traversals but the levelorder traversal have been implemented recursively.\\n The levelorder traversal is solved iteratively.\\n\\t\\t\\t ]\\\"\\n\\nclass\\n\\tNODE\\ncreate\\n\\tmake\\n\\nfeature {NONE} -- Initialization\\n\\n\\tmake (a_value:INTEGER)\\n\\t\\t\\t-- Creates a node with no children.\\n\\t\\tdo\\n\\t\\t\\tvalue := a_value\\n\\t\\t\\tset_right_child(Void)\\n\\t\\t\\tset_left_child(Void)\\n\\t\\tend\\n\\nfeature -- Modification\\n\\n\\tset_right_child (a_node:NODE)\\n\\t\\t\\t-- Sets `right_child' to `a_node'.\\n\\t\\tdo\\n\\t\\t\\tright_child:=a_node\\n\\t\\tend\\n\\n\\tset_left_child (a_node:NODE)\\n\\t\\t\\t-- Sets `left_child' to `a_node'.\\n\\t\\tdo\\n\\t\\t\\tleft_child:=a_node\\n\\t\\tend\\n\\nfeature -- Representation\\n\\n\\tprint_preorder\\n\\t\\t\\t-- Recursively prints the value of the node and all its children in preorder\\n\\t\\tdo\\n\\t\\t\\tIo.put_string (\\\" \\\" + value.out)\\n\\t\\t\\tif has_left_child then\\n\\t\\t\\t\\tleft_child.print_preorder\\n\\t\\t\\tend\\n\\t\\t\\tif has_right_child then\\n\\t\\t\\t\\tright_child.print_preorder\\n\\t\\t\\tend\\n\\t\\tend\\n\\n\\tprint_inorder\\n\\t\\t\\t-- Recursively prints the value of the node and all its children in inorder\\n\\t\\tdo\\n\\t\\t\\tif has_left_child then\\n\\t\\t\\t\\tleft_child.print_inorder\\n\\t\\t\\tend\\n\\t\\t\\tIo.put_string (\\\" \\\" + value.out)\\n\\t\\t\\tif has_right_child then\\n\\t\\t\\t\\tright_child.print_inorder\\n\\t\\t\\tend\\n\\t\\tend\\n\\n\\tprint_postorder\\n\\t\\t\\t-- Recursively prints the value of the node and all its children in postorder\\n\\t\\tdo\\n\\t\\t\\tif has_left_child then\\n\\t\\t\\t\\tleft_child.print_postorder\\n\\t\\t\\tend\\n\\t\\t\\tif has_right_child then\\n\\t\\t\\t\\tright_child.print_postorder\\n\\t\\t\\tend\\n\\t\\t\\tIo.put_string (\\\" \\\" + value.out)\\n\\t\\tend\\n\\n\\tprint_levelorder\\n\\t\\t\\t-- Iteratively prints the value of the node and all its children in levelorder\\n\\t\\tlocal\\n\\t\\t\\tl_linked_list:LINKED_LIST[NODE]\\n\\t\\t\\tl_node:NODE\\n\\t\\tdo\\n\\t\\t\\tfrom\\n\\t\\t\\t\\tcreate l_linked_list.make\\n\\t\\t\\t\\tl_linked_list.extend (Current)\\n\\t\\t\\tuntil\\n\\t\\t\\t\\tl_linked_list.is_empty\\n\\t\\t\\tloop\\n\\t\\t\\t\\tl_node := l_linked_list.first\\n\\t\\t\\t\\tif l_node.has_left_child then\\n\\t\\t\\t\\t\\tl_linked_list.extend (l_node.left_child)\\n\\t\\t\\t\\tend\\n\\t\\t\\t\\tif l_node.has_right_child then\\n\\t\\t\\t\\t\\tl_linked_list.extend (l_node.right_child)\\n\\t\\t\\t\\tend\\n\\t\\t\\t\\tIo.put_string (\\\" \\\" + l_node.value.out)\\n\\t\\t\\t\\tl_linked_list.prune (l_node)\\n\\t\\t\\tend\\n\\t\\tend\\n\\nfeature -- Access\\n\\n\\tvalue:INTEGER\\n\\t\\t\\t-- Value stored in the node.\\n\\n\\tright_child:NODE\\n\\t\\t\\t-- Reference to right child, possibly void.\\n\\n\\tleft_child:NODE\\n\\t\\t\\t-- Reference to left child, possibly void.\\n\\n\\thas_right_child:BOOLEAN\\n\\t\\t\\t-- Test right child for existence.\\n\\t\\tdo\\n\\t\\t\\tResult := right_child /= Void\\n\\t\\tend\\n\\n\\thas_left_child:BOOLEAN\\n\\t\\t\\t-- Test left child for existence.\\n\\t\\tdo\\n\\t\\t\\tResult := left_child /= Void\\n\\t\\tend\\n\\nend\\n -- class NODE\\n\",\n \"language\": \"Eiffel\"\n },\n {\n \"code\": \"import extensions;\\nimport extensions'routines;\\nimport system'collections;\\n\\nsingleton DummyNode\\n{\\n get generic()\\n = EmptyEnumerable;\\n}\\n\\nclass Node\\n{\\n int Value : rprop;\\n Node Left : rprop;\\n Node Right : rprop;\\n\\n constructor new(int value)\\n {\\n Value := value\\n }\\n\\n constructor new(int value, Node left)\\n {\\n Value := value;\\n Left := left;\\n }\\n\\n constructor new(int value, Node left, Node right)\\n {\\n Value := value;\\n Left := left;\\n Right := right\\n }\\n\\n Preorder = new Enumerable\\n {\\n Enumerator enumerator() = CompoundEnumerator.new(\\n SingleEnumerable.new(Value),\\n (Left ?? DummyNode).Preorder,\\n (Right ?? DummyNode).Preorder);\\n };\\n\\n Inorder = new Enumerable\\n {\\n Enumerator enumerator()\\n {\\n if (nil != Left)\\n {\\n ^ CompoundEnumerator.new(Left.Inorder, SingleEnumerable.new(Value), (Right ?? DummyNode).Inorder)\\n }\\n else\\n {\\n ^ SingleEnumerable.new(Value).enumerator()\\n }\\n }\\n };\\n\\n Postorder = new Enumerable\\n {\\n Enumerator enumerator()\\n {\\n if (nil == Left)\\n {\\n ^ SingleEnumerable.new(Value).enumerator()\\n }\\n else if (nil == Right)\\n {\\n ^ CompoundEnumerator.new(Left.Postorder, SingleEnumerable.new(Value))\\n }\\n else\\n {\\n ^ CompoundEnumerator.new(Left.Postorder, Right.Postorder, SingleEnumerable.new(Value))\\n }\\n }\\n };\\n\\n LevelOrder = new Enumerable\\n {\\n Queue<Node> queue := class Queue<Node>.allocate(4).push(self);\\n\\n Enumerator enumerator() = new Enumerator\\n {\\n bool next() = queue.isNotEmpty();\\n\\n get Value()\\n {\\n Node item := queue.pop();\\n Node left := item.Left;\\n Node right := item.Right;\\n\\n if (nil != left)\\n {\\n queue.push(left)\\n };\\n if (nil != right)\\n {\\n queue.push(right)\\n };\\n\\n ^ item.Value\\n }\\n\\n reset()\\n {\\n NotSupportedException.raise()\\n }\\n\\n enumerable() = queue;\\n };\\n };\\n}\\n\\npublic program()\\n{\\n var tree := Node.new(1, Node.new(2, Node.new(4, Node.new(7)), Node.new(5)), Node.new(3, Node.new(6, Node.new(8), Node.new(9))));\\n\\n console.printLine(\\\"Preorder :\\\", tree.Preorder);\\n console.printLine(\\\"Inorder :\\\", tree.Inorder);\\n console.printLine(\\\"Postorder :\\\", tree.Postorder);\\n console.printLine(\\\"LevelOrder:\\\", tree.LevelOrder)\\n}\\n\",\n \"language\": \"Elena\"\n },\n {\n \"code\": \"component BinaryTreeTraversals (Tree, Element);\\ntype Tree;\\ntype Node = Tree;\\n Tree (LeftTree = Tree, Element, RightTree = Tree) -> Tree;\\n Leaf (Element) -> Node;\\n Node (Tree) -> Node;\\n Item (Node) -> Element;\\n\\n Preorder (Tree) -> multi (Node);\\n Inorder (Tree) -> multi (Node);\\n Postorder (Tree) -> multi (Node);\\n Level_order(Tree) \\t\\t -> multi (Node);\\nbegin\\n Tree (Lefttree, Item, Righttree) = Tree: [ Lefttree; Item; Righttree ];\\n Leaf (anItem) = Tree (null(Tree), anItem, null(Tree) );\\n Node (aTree) = aTree;\\n Item (aNode) = aNode.Item;\\n\\n Preorder (=null(Tree)) = no(Tree);\\n Preorder (T) = ( T, Preorder (T.Lefttree), Preorder (T.Righttree));\\n\\n Inorder (=null(Tree)) = no(Tree);\\n Inorder (T) = ( Inorder (T.Lefttree), T, Inorder (T.Righttree));\\n\\n Postorder (=null(Tree)) = no(Tree);\\n Postorder (T) = ( Postorder (T.Lefttree), Postorder (T.Righttree), T);\\t\\n\\n Level_order(T) = [ Queue = {T};\\n\\t\\t\\t node = Tree:items(Queue);\\n\\t\\t\\t [ result(node);\\n\\t\\t\\t add(Queue, node.Lefttree) when valid(node.Lefttree); \\t\\n \\t\\t\\t add(Queue, node.Righttree) when valid(node.Righttree); \\t\\n\\t\\t\\t ];\\n\\t\\t\\t no(Tree);\\n\\t\\t ];\\nend component BinaryTreeTraversals;\\n\",\n \"language\": \"Elisa\"\n },\n {\n \"code\": \"use BinaryTreeTraversals (Tree, integer);\\n\\nBT = Tree(\\n\\tTree(\\n Tree(Leaf(7), 4, null(Tree)), 2 , Leaf(5)), 1,\\n Tree(\\n Tree(Leaf(8), 6, Leaf(9)), 3 ,null(Tree)));\\n\\n{Item(Preorder(BT))}?\\n{ 1, 2, 4, 7, 5, 3, 6, 8, 9}\\n\\n{Item(Inorder(BT))}?\\n{ 7, 4, 2, 5, 1, 8, 6, 9, 3}\\n\\n{Item(Postorder(BT))}?\\n{ 7, 4, 5, 2, 8, 9, 6, 3, 1}\\n\\n{Item(Level_order(BT))}?\\n{ 1, 2, 3, 4, 5, 6, 7, 8, 9}\\n\",\n \"language\": \"Elisa\"\n },\n {\n \"code\": \"defmodule Tree_Traversal do\\n defp tnode, do: {}\\n defp tnode(v), do: {:node, v, {}, {}}\\n defp tnode(v,l,r), do: {:node, v, l, r}\\n\\n defp preorder(_,{}), do: :ok\\n defp preorder(f,{:node,v,l,r}) do\\n f.(v)\\n preorder(f,l)\\n preorder(f,r)\\n end\\n\\n defp inorder(_,{}), do: :ok\\n defp inorder(f,{:node,v,l,r}) do\\n inorder(f,l)\\n f.(v)\\n inorder(f,r)\\n end\\n\\n defp postorder(_,{}), do: :ok\\n defp postorder(f,{:node,v,l,r}) do\\n postorder(f,l)\\n postorder(f,r)\\n f.(v)\\n end\\n\\n defp levelorder(_, []), do: []\\n defp levelorder(f, [{}|t]), do: levelorder(f, t)\\n defp levelorder(f, [{:node,v,l,r}|t]) do\\n f.(v)\\n levelorder(f, t++[l,r])\\n end\\n defp levelorder(f, x), do: levelorder(f, [x])\\n\\n def main do\\n tree = tnode(1,\\n tnode(2,\\n tnode(4, tnode(7), tnode()),\\n tnode(5, tnode(), tnode())),\\n tnode(3,\\n tnode(6, tnode(8), tnode(9)),\\n tnode()))\\n f = fn x -> IO.write \\\"#{x} \\\" end\\n IO.write \\\"preorder: \\\"\\n preorder(f, tree)\\n IO.write \\\"\\\\ninorder: \\\"\\n inorder(f, tree)\\n IO.write \\\"\\\\npostorder: \\\"\\n postorder(f, tree)\\n IO.write \\\"\\\\nlevelorder: \\\"\\n levelorder(f, tree)\\n IO.puts \\\"\\\"\\n end\\nend\\n\\nTree_Traversal.main\\n\",\n \"language\": \"Elixir\"\n },\n {\n \"code\": \"-module(tree_traversal).\\n-export([main/0]).\\n-export([preorder/2, inorder/2, postorder/2, levelorder/2]).\\n-export([tnode/0, tnode/1, tnode/3]).\\n\\n-define(NEWLINE, io:format(\\\"~n\\\")).\\n\\ntnode() -> {}.\\ntnode(V) -> {node, V, {}, {}}.\\ntnode(V,L,R) -> {node, V, L, R}.\\n\\npreorder(_,{}) -> ok;\\npreorder(F,{node,V,L,R}) ->\\n F(V), preorder(F,L), preorder(F,R).\\n\\ninorder(_,{}) -> ok;\\ninorder(F,{node,V,L,R}) ->\\n inorder(F,L), F(V), inorder(F,R).\\n\\npostorder(_,{}) -> ok;\\npostorder(F,{node,V,L,R}) ->\\n postorder(F,L), postorder(F,R), F(V).\\n\\nlevelorder(_, []) -> [];\\nlevelorder(F, [{}|T]) -> levelorder(F, T);\\nlevelorder(F, [{node,V,L,R}|T]) ->\\n F(V), levelorder(F, T++[L,R]);\\nlevelorder(F, X) -> levelorder(F, [X]).\\n\\nmain() ->\\n Tree = tnode(1,\\n tnode(2,\\n tnode(4, tnode(7), tnode()),\\n tnode(5, tnode(), tnode())),\\n tnode(3,\\n tnode(6, tnode(8), tnode(9)),\\n tnode())),\\n F = fun(X) -> io:format(\\\"~p \\\",[X]) end,\\n preorder(F, Tree), ?NEWLINE,\\n inorder(F, Tree), ?NEWLINE,\\n postorder(F, Tree), ?NEWLINE,\\n levelorder(F, Tree), ?NEWLINE.\\n\",\n \"language\": \"Erlang\"\n },\n {\n \"code\": \"constant VALUE = 1, LEFT = 2, RIGHT = 3\\n\\nconstant tree = {1,\\n {2,\\n {4,\\n {7, 0, 0},\\n 0},\\n {5, 0, 0}},\\n {3,\\n {6,\\n {8, 0, 0},\\n {9, 0, 0}},\\n 0}}\\n\\nprocedure preorder(object tree)\\n if sequence(tree) then\\n printf(1,\\\"%d \\\",{tree[VALUE]})\\n preorder(tree[LEFT])\\n preorder(tree[RIGHT])\\n end if\\nend procedure\\n\\nprocedure inorder(object tree)\\n if sequence(tree) then\\n inorder(tree[LEFT])\\n printf(1,\\\"%d \\\",{tree[VALUE]})\\n inorder(tree[RIGHT])\\n end if\\nend procedure\\n\\nprocedure postorder(object tree)\\n if sequence(tree) then\\n postorder(tree[LEFT])\\n postorder(tree[RIGHT])\\n printf(1,\\\"%d \\\",{tree[VALUE]})\\n end if\\nend procedure\\n\\nprocedure lo(object tree, sequence more)\\n if sequence(tree) then\\n more &= {tree[LEFT],tree[RIGHT]}\\n printf(1,\\\"%d \\\",{tree[VALUE]})\\n end if\\n if length(more) > 0 then\\n lo(more[1],more[2..$])\\n end if\\nend procedure\\n\\nprocedure level_order(object tree)\\n lo(tree,{})\\nend procedure\\n\\nputs(1,\\\"preorder: \\\")\\npreorder(tree)\\nputs(1,'\\\\n')\\n\\nputs(1,\\\"inorder: \\\")\\ninorder(tree)\\nputs(1,'\\\\n')\\n\\nputs(1,\\\"postorder: \\\")\\npostorder(tree)\\nputs(1,'\\\\n')\\n\\nputs(1,\\\"level-order: \\\")\\nlevel_order(tree)\\nputs(1,'\\\\n')\\n\",\n \"language\": \"Euphoria\"\n },\n {\n \"code\": \"open System\\nopen System.IO\\n\\ntype Tree<'a> =\\n | Tree of 'a * Tree<'a> * Tree<'a>\\n | Empty\\n\\nlet rec inorder tree =\\n seq {\\n match tree with\\n | Tree(x, left, right) ->\\n yield! inorder left\\n yield x\\n yield! inorder right\\n | Empty -> ()\\n }\\n\\nlet rec preorder tree =\\n seq {\\n match tree with\\n | Tree(x, left, right) ->\\n yield x\\n yield! preorder left\\n yield! preorder right\\n | Empty -> ()\\n }\\n\\nlet rec postorder tree =\\n seq {\\n match tree with\\n | Tree(x, left, right) ->\\n yield! postorder left\\n yield! postorder right\\n yield x\\n | Empty -> ()\\n }\\n\\nlet levelorder tree =\\n let rec loop queue =\\n seq {\\n match queue with\\n | [] -> ()\\n | (Empty::tail) -> yield! loop tail\\n | (Tree(x, l, r)::tail) ->\\n yield x\\n yield! loop (tail @ [l; r])\\n }\\n loop [tree]\\n\\n[<EntryPoint>]\\nlet main _ =\\n let tree =\\n Tree (1,\\n Tree (2,\\n Tree (4,\\n Tree (7, Empty, Empty),\\n Empty),\\n Tree (5, Empty, Empty)),\\n Tree (3,\\n Tree (6,\\n Tree (8, Empty, Empty),\\n Tree (9, Empty, Empty)),\\n Empty))\\n\\n let show x = printf \\\"%d \\\" x\\n\\n printf \\\"preorder: \\\"\\n preorder tree |> Seq.iter show\\n printf \\\"\\\\ninorder: \\\"\\n inorder tree |> Seq.iter show\\n printf \\\"\\\\npostorder: \\\"\\n postorder tree |> Seq.iter show\\n printf \\\"\\\\nlevel-order: \\\"\\n levelorder tree |> Seq.iter show\\n 0\\n\",\n \"language\": \"F-Sharp\"\n },\n {\n \"code\": \"USING: accessors combinators deques dlists fry io kernel\\nmath.parser ;\\nIN: rosetta.tree-traversal\\n\\nTUPLE: node data left right ;\\n\\nCONSTANT: example-tree\\n T{ node f 1\\n T{ node f 2\\n T{ node f 4\\n T{ node f 7 f f }\\n f\\n }\\n T{ node f 5 f f }\\n }\\n T{ node f 3\\n T{ node f 6\\n T{ node f 8 f f }\\n T{ node f 9 f f }\\n }\\n f\\n }\\n }\\n\\n: preorder ( node quot: ( data -- ) -- )\\n [ [ data>> ] dip call ]\\n [ [ left>> ] dip over [ preorder ] [ 2drop ] if ]\\n [ [ right>> ] dip over [ preorder ] [ 2drop ] if ]\\n 2tri ; inline recursive\\n\\n: inorder ( node quot: ( data -- ) -- )\\n [ [ left>> ] dip over [ inorder ] [ 2drop ] if ]\\n [ [ data>> ] dip call ]\\n [ [ right>> ] dip over [ inorder ] [ 2drop ] if ]\\n 2tri ; inline recursive\\n\\n: postorder ( node quot: ( data -- ) -- )\\n [ [ left>> ] dip over [ postorder ] [ 2drop ] if ]\\n [ [ right>> ] dip over [ postorder ] [ 2drop ] if ]\\n [ [ data>> ] dip call ]\\n 2tri ; inline recursive\\n\\n: (levelorder) ( dlist quot: ( data -- ) -- )\\n over deque-empty? [ 2drop ] [\\n [ dup pop-front ] dip {\\n [ [ data>> ] dip call drop ]\\n [ drop left>> [ swap push-back ] [ drop ] if* ]\\n [ drop right>> [ swap push-back ] [ drop ] if* ]\\n [ nip (levelorder) ]\\n } 3cleave\\n ] if ; inline recursive\\n\\n: levelorder ( node quot: ( data -- ) -- )\\n [ 1dlist ] dip (levelorder) ; inline\\n\\n: levelorder2 ( node quot: ( data -- ) -- )\\n [ 1dlist ] dip\\n [ dup deque-empty? not ] swap '[\\n dup pop-front\\n [ data>> @ ]\\n [ left>> [ over push-back ] when* ]\\n [ right>> [ over push-back ] when* ] tri\\n ] while drop ; inline\\n\\n: main ( -- )\\n example-tree [ number>string write \\\" \\\" write ] {\\n [ \\\"preorder: \\\" write preorder nl ]\\n [ \\\"inorder: \\\" write inorder nl ]\\n [ \\\"postorder: \\\" write postorder nl ]\\n [ \\\"levelorder: \\\" write levelorder nl ]\\n [ \\\"levelorder2: \\\" write levelorder2 nl ]\\n } 2cleave ;\\n\",\n \"language\": \"Factor\"\n },\n {\n \"code\": \"class Tree\\n{\\n readonly Int label\\n readonly Tree? left\\n readonly Tree? right\\n\\n new make (Int label, Tree? left := null, Tree? right := null)\\n {\\n this.label = label\\n this.left = left\\n this.right = right\\n }\\n\\n Void preorder(|Int->Void| func)\\n {\\n func(label)\\n left?.preorder(func) // ?. will not call method if 'left' is null\\n right?.preorder(func)\\n }\\n\\n Void postorder(|Int->Void| func)\\n {\\n left?.postorder(func)\\n right?.postorder(func)\\n func(label)\\n }\\n\\n Void inorder(|Int->Void| func)\\n {\\n left?.inorder(func)\\n func(label)\\n right?.inorder(func)\\n }\\n\\n Void levelorder(|Int->Void| func)\\n {\\n Tree[] nodes := [this]\\n while (nodes.size > 0)\\n {\\n Tree cur := nodes.removeAt(0)\\n func(cur.label)\\n if (cur.left != null) nodes.add (cur.left)\\n if (cur.right != null) nodes.add (cur.right)\\n }\\n }\\n}\\n\\nclass Main\\n{\\n public static Void main ()\\n {\\n tree := Tree(1,\\n Tree(2, Tree(4, Tree(7)), Tree(5)),\\n Tree(3, Tree(6, Tree(8), Tree(9))))\\n List result := [,]\\n collect := |Int a -> Void| { result.add(a) }\\n tree.preorder(collect)\\n echo (\\\"preorder: \\\" + result.join(\\\" \\\"))\\n result = [,]\\n tree.inorder(collect)\\n echo (\\\"inorder: \\\" + result.join(\\\" \\\"))\\n result = [,]\\n tree.postorder(collect)\\n echo (\\\"postorder: \\\" + result.join(\\\" \\\"))\\n result = [,]\\n tree.levelorder(collect)\\n echo (\\\"levelorder: \\\" + result.join(\\\" \\\"))\\n }\\n}\\n\",\n \"language\": \"Fantom\"\n },\n {\n \"code\": \"\\\\ binary tree (dictionary)\\n: node ( l r data -- node ) here >r , , , r> ;\\n: leaf ( data -- node ) 0 0 rot node ;\\n\\n: >data ( node -- ) @ ;\\n: >right ( node -- ) cell+ @ ;\\n: >left ( node -- ) cell+ cell+ @ ;\\n\\n: preorder ( xt tree -- )\\n dup 0= if 2drop exit then\\n 2dup >data swap execute\\n 2dup >left recurse\\n >right recurse ;\\n\\n: inorder ( xt tree -- )\\n dup 0= if 2drop exit then\\n 2dup >left recurse\\n 2dup >data swap execute\\n >right recurse ;\\n\\n: postorder ( xt tree -- )\\n dup 0= if 2drop exit then\\n 2dup >left recurse\\n 2dup >right recurse\\n >data swap execute ;\\n\\n: max-depth ( tree -- n )\\n dup 0= if exit then\\n dup >left recurse\\n swap >right recurse max 1+ ;\\n\\ndefer depthaction\\n: depthorder ( depth tree -- )\\n dup 0= if 2drop exit then\\n over 0=\\n if >data depthaction drop\\n else over 1- over >left recurse\\n swap 1- swap >right recurse\\n then ;\\n\\n: levelorder ( xt tree -- )\\n swap is depthaction\\n dup max-depth 0 ?do\\n i over depthorder\\n loop drop ;\\n\\n7 leaf 0 4 node\\n 5 leaf 2 node\\n8 leaf 9 leaf 6 node\\n 0 3 node 1 node value tree\\n\\ncr ' . tree preorder \\\\ 1 2 4 7 5 3 6 8 9\\ncr ' . tree inorder \\\\ 7 4 2 5 1 8 6 9 3\\ncr ' . tree postorder \\\\ 7 4 5 2 8 9 6 3 1\\ncr tree max-depth . \\\\ 4\\ncr ' . tree levelorder \\\\ 1 2 3 4 5 6 7 8 9\\n\",\n \"language\": \"Forth\"\n },\n {\n \"code\": \" IF (STYLE.EQ.\\\"PRE\\\") CALL OUT(HAS)\\n IF (LINKL(HAS).GT.0) CALL TARZAN(LINKL(HAS),STYLE)\\n IF (STYLE.EQ.\\\"IN\\\") CALL OUT(HAS)\\n IF (LINKR(HAS).GT.0) CALL TARZAN(LINKR(HAS),STYLE)\\n IF (STYLE.EQ.\\\"POST\\\") CALL OUT(HAS)\\n\",\n \"language\": \"Fortran\"\n },\n {\n \"code\": \" DO GASP = 1,MAXLEVEL\\n CALL TARZAN(1,HOW)\\n END DO\\n\",\n \"language\": \"Fortran\"\n },\n {\n \"code\": \" MODULE ARAUCARIA\\t!Cunning crosswords, also.\\n INTEGER ENUFF\\t\\t!To suit the set example.\\n PARAMETER (ENUFF = 9)\\t!This will do.\\n INTEGER NODE(ENUFF),LINKL(ENUFF),LINKR(ENUFF)\\t!The nodes, and their links.\\n DATA NODE/ 1,2,3,4,5,6,7,8,9/\\t!Value = index. A rather boring payload.\\n DATA LINKL/2,4,6,7,0,8,0,0,0/\\t!\\\"Left\\\" and \\\"Right\\\" are as looking at the page.\\n DATA LINKR/3,5,0,0,0,9,0,0,0/\\t!If one thinks within the tree, they're the other way around!\\nC 1\\t!Thus, looking from the \\\"1\\\", to the right is \\\"2\\\" and to the left is \\\"3\\\".\\nC / \\\\\\t!But, looking at the scheme, to the left is \\\"2\\\" and to the right is \\\"3\\\".\\nC / \\\\\\t!This latter seems to be the popular view from the outside, not within the data.\\nC / \\\\\\t!Similarily, although called a \\\"tree\\\", the depiction is upside down!\\nC 2 3\\t!How can computers be expected to keep up with this contrariness?\\nC / \\\\ /\\t!Humm, no example of a rightwards link with no leftwards link.\\nC 4 5 6\\t!Topologically equivalent, but not so in usage.\\nC / / \\\\\\nC 7 8 9\\n INTEGER N,LIST(ENUFF)\\t!This is to be developed.\\n INTEGER LEVEL,MAXLEVEL\\t!While these vary in various ways.\\n INTEGER GASP\\t\\t!Communication from JANE.\\n CONTAINS\\t!No checks for invalid links, etc.\\n SUBROUTINE OUT(IS)\\t!Append a value to a list.\\n INTEGER IS\\t\\t!The value.\\n N = N + 1\\t\\t!The list's count so far.\\n LIST(N) = IS\\t\\t!Place.\\n END SUBROUTINE OUT\\t!Eventually, the list can be written in one go.\\n\\n RECURSIVE SUBROUTINE TARZAN(HAS,STYLE)\\t!Skilled at tree traversal, is he.\\n INTEGER HAS\\t\\t!The current position.\\n CHARACTER*(*) STYLE\\t!Traversal type.\\n LEVEL = LEVEL + 1\\t!A leap is made.\\n IF (LEVEL.GT.MAXLEVEL) MAXLEVEL = LEVEL\\t!Staring at the moon.\\n SELECT CASE(STYLE)\\t!And, in what manner?\\n CASE (\\\"PRE\\\")\\t\\t!Declare the position first.\\n CALL OUT(HAS)\\t!Thus.\\n IF (LINKL(HAS).GT.0) CALL TARZAN(LINKL(HAS),STYLE)\\n IF (LINKR(HAS).GT.0) CALL TARZAN(LINKR(HAS),STYLE)\\n CASE (\\\"IN\\\")\\t\\t!Or in the middle.\\n IF (LINKL(HAS).GT.0) CALL TARZAN(LINKL(HAS),STYLE)\\n CALL OUT(HAS)\\t!Thus.\\n IF (LINKR(HAS).GT.0) CALL TARZAN(LINKR(HAS),STYLE)\\n CASE (\\\"POST\\\")\\t!Or at the end.\\n IF (LINKL(HAS).GT.0) CALL TARZAN(LINKL(HAS),STYLE)\\n IF (LINKR(HAS).GT.0) CALL TARZAN(LINKR(HAS),STYLE)\\n CALL OUT(HAS)\\t!Thus.\\n CASE (\\\"LEVEL\\\")\\t!Or at specified levels.\\n IF (LEVEL.EQ.GASP) CALL OUT(HAS)\\t!Such as this?\\n IF (LINKL(HAS).GT.0) CALL TARZAN(LINKL(HAS),STYLE)\\n IF (LINKR(HAS).GT.0) CALL TARZAN(LINKR(HAS),STYLE)\\n CASE DEFAULT\\t\\t!This shouldn't happen.\\n WRITE (6,*) \\\"Unknown style \\\",STYLE\\t!But, paranoia.\\n STOP \\\"No can do!\\\"\\t\\t!Rather than flounder about.\\n END SELECT\\t\\t!That was simple.\\n LEVEL = LEVEL - 1\\t!Sag back.\\n END SUBROUTINE TARZAN\\t!Not like George of the Jungle.\\n\\n SUBROUTINE JANE(HOW)\\t!Tells Tarzan what to do.\\n CHARACTER*(*) HOW\\t!A single word suffices.\\n N = 0\\t\\t\\t!No positions trampled.\\n LEVEL = 0\\t\\t!Starting on the ground.\\n MAXLEVEL = 0\\t\\t!The ascent follows.\\n IF (HOW.NE.\\\"LEVEL\\\") THEN\\t!Ordinary styles?\\n CALL TARZAN(1,HOW)\\t\\t!Yes. From the root, go...\\n ELSE\\t\\t\\t!But this is not tree-structured.\\n GASP = 0\\t\\t!Instead, we ascend through the canopy in stages.\\n 1 GASP = GASP + 1\\t\\t!Up one stage.\\n CALL TARZAN(1,HOW)\\t\\t!And do it all again.\\n IF (GASP.LT.MAXLEVEL) GO TO 1\\t!Are we there yet?\\n END IF\\t\\t!Don't know MAXLEVEL until after the first clamber.\\nCast forth the list.\\n WRITE (6,10) HOW,NODE(LIST(1:N))\\t!Show spoor.\\n 10 FORMAT (A6,\\\"-order:\\\",66(1X,I0))\\t!Large enough.\\n WRITE (6,*)\\t\\t\\t\\t!Sigh.\\n END SUBROUTINE JANE\\t!That was simple.\\n END MODULE ARAUCARIA\\t!The monkeys are puzzled.\\n\\n PROGRAM GORILLA\\t\\t!No fancy stuff. Just brute force.\\n USE ARAUCARIA\\t\\t!This is for lightweight but cunning monkeys.\\n INTEGER IT\\t\\t!A finger.\\n INTEGER SP,STACK(ENUFF)\\t!The tree may be slim.\\n INTEGER SLEVL(ENUFF)\\t!So prepare for maximum usage.\\n INTEGER MIST(ENUFF,0:ENUFF)\\t!Multiple lists.\\n\\nChase the links preorder style: name the node, delve its left link, delve its right link.\\n N = 0\\t!No nodes have been visited.\\n SP = 0\\t!My stack is empty.\\n IT = 1\\t!I start at the root.\\n 10 N = N + 1\\t\\t\\t!Another node arrived at.\\n LIST(N) = IT\\t\\t!Finger it.\\n IF (LINKL(IT).GT.0) THEN\\t!A left link?\\n IF (LINKR(IT).GT.0) THEN\\t!Yes. A right link also?\\n SP = SP + 1\\t\\t\\t\\t!Yes. Stack it up.\\n STACK(SP) = LINKR(IT)\\t\\t\\t!For later investigation.\\n END IF\\t\\t\\t\\t!So much for the right link.\\n IT = LINKL(IT)\\t\\t\\t!Fingered by the left link.\\n GO TO 10\\t\\t\\t!See what happens.\\n END IF\\t\\t\\t!But if there is no left link,\\n IF (LINKR(IT).GT.0) THEN\\t!There still might be a right link.\\n IT = LINKR(IT)\\t\\t\\t!There is.\\n GO TO 10\\t\\t\\t!See what happens.\\n END IF\\t\\t\\t!And if there are no links,\\n IF (SP.GT.0) THEN\\t\\t!Perhaps the stack has bottomed out too?\\n IT = STACK(SP)\\t\\t\\t!No, this was deferred.\\n SP = SP - 1\\t\\t\\t!So, pick up where we left off.\\n GO TO 10\\t\\t\\t!And carry on.\\n END IF\\t\\t\\t!So much for unstacking.\\n WRITE (6,12) \\\"Preorder\\\",NODE(LIST(1:N))\\t!I've got a little list!\\n 12 FORMAT (A12,\\\":\\\",66(1X,I0))\\n CALL JANE(\\\"PRE\\\")\\t\\t!Try it fancy style.\\n\\nChase the links inorder style: delve left fully, name the node and try its right, then unstack.\\n N = 0\\t!No nodes have been visited.\\n SP = 0\\t!My stack is empty.\\n IT = 1\\t!I start at the root.\\n 20 SP = SP + 1\\t\\t!I'm on the way down.\\n STACK(SP) = IT\\t\\t!So, save this position to later retreat to.\\n IF (LINKL(IT).GT.0) THEN\\t!Can I delve further left?\\n IT = LINKL(IT)\\t\\t\\t!Yes.\\n GO TO 20\\t\\t\\t!And see what happens.\\n END IF\\t\\t\\t!So much for diving.\\n 21 IF (SP.GT.0) THEN\\t!Can I retreat?\\n IT = STACK(SP)\\t\\t!Yes.\\n SP = SP - 1\\t\\t!Go back to whence I had delved left.\\n N = N + 1\\t\\t!This now counts as a place in order.\\n LIST(N) = IT\\t\\t!So list it.\\n IF (LINKR(IT).GT.0) THEN!Have I a rightwards path?\\n IT = LINKR(IT)\\t\\t!Yes. Take it.\\n GO TO 20\\t\\t\\t!And delve therefrom.\\n END IF\\t\\t\\t!This node is now finished with.\\n GO TO 21\\t\\t!So, try for another retreat.\\n END IF\\t\\t!So much for unstacking.\\n WRITE (6,12) \\\"Inorder\\\",NODE(LIST(1:N))\\t!I've got a little list!\\n CALL JANE(\\\"IN\\\")\\t!Try with more style.\\n\\nChase the links postorder style: delve left fully, delve right, name the node, then unstack.\\n N = 0\\t!No nodes have been visited.\\n SP = 0\\t!My stack is empty.\\n IT = 1\\t!I start at the root.\\n 30 SP = SP + 1\\t!Action follows delving,\\n STACK(SP) = IT\\t!So this node will be returned to.\\n IF (LINKL(IT).GT.0) THEN\\t!Take any leftwards link straightaway.\\n IT = LINKL(IT)\\t\\t!Thus.\\n GO TO 30\\t\\t!Thanks to the stack, we'll return to IT (as was).\\n END IF\\t\\t!But if there is no leftwards link to follow,\\n IF (LINKR(IT).GT.0) THEN\\t!Perhaps there is a rightwards one?\\n STACK(SP) = -STACK(SP)\\t!=-IT Mark the stacked finger as a rightwards lurch!\\n IT = LINKR(IT)\\t\\t!The rightwards link is now to be taken.\\n GO TO 30\\t\\t!Thus start on a sub-tree.\\n END IF\\t\\t!But if there is no rightwards link either,\\n 31 IF (SP.GT.0) THEN\\t!See if there is anywhere to retreat to.\\n IT = STACK(SP)\\t\\t!The same IT placed at 30 if we dropped into 31.\\n SP = SP - 1\\t\\t!But now we're in a different mood.\\n IF (IT.LT.0) THEN\\t!Returning to what had been a rightwards departure?\\n N = N + 1\\t\\t\\t!Yes! Then this node is post-interest.\\n LIST(N) = -IT\\t\\t\\t!So, time to roll it forth at last.\\n GO TO 31\\t\\t\\t!And retreat some more.\\n END IF\\t\\t\\t!But if we hadn't gone right from IT,\\n IF (LINKR(IT).LE.0) THEN!We had gone left.\\n N = N + 1\\t\\t\\t!And now there is nowhere rightwards.\\n LIST(N) = IT\\t\\t\\t!So this node is post-interest.\\n GO TO 31\\t\\t\\t!And retreat some more.\\n END IF\\t\\t\\t!But if there is a rightwards leap,\\n SP = SP + 1\\t\\t\\t!Prepare to return to it,\\n STACK(SP) = -IT\\t\\t\\t!Marked as having gone rightwards.\\n IT = LINKR(IT)\\t\\t\\t!The rightwards move.\\n GO TO 30\\t\\t\\t!Peruse a fresh sub-tree.\\n END IF\\t\\t\\t!And if the stack is reduced,\\n WRITE (6,12) \\\"Postorder\\\",NODE(LIST(1:N))\\t!Results!\\n CALL JANE(\\\"POST\\\")\\t\\t!The same again?\\n\\nChase the nodes level style.\\n SP = 0\\t\\t!My stack is empty.\\n IT = 1\\t\\t!I start at the root.\\n LEVEL = 0\\t\\t!On the ground.\\n MAXLEVEL = 0\\t!No ascent as yet.\\n MIST(:,0) = 0\\t!At all levels, nothing.\\n 40 LEVEL = LEVEL + 1\\t\\t\\t!Every arrival is one level up.\\n IF (LEVEL.GT.MAXLEVEL) MAXLEVEL = LEVEL\\t!Note the most high.\\n MIST(LEVEL,0) = MIST(LEVEL,0) + 1\\t!The count at that level.\\n MIST(LEVEL,MIST(LEVEL,0)) = IT\\t!Add to the level's list.\\n IF (LINKL(IT).GT.0) THEN\\t\\t!Righto, can we go left?\\n IF (LINKR(IT).GT.0) THEN\\t!Yes. Rightwards as well?\\n SP = SP + 1\\t\\t\\t\\t!Yes! This will have to wait.\\n STACK(SP) = LINKR(IT)\\t\\t\\t!So remember it,\\n SLEVL(SP) = LEVEL\\t\\t\\t!And what level we're at now.\\n END IF\\t\\t\\t\\t!I can only go one way at a time.\\n IT = LINKL(IT)\\t\\t\\t!Accept the fingered leftwards lurch.\\n GO TO 40\\t\\t\\t!Go to IT.\\n END IF\\t\\t\\t!But if there is no leftwards link,\\n IF (LINKR(IT).GT.0) THEN\\t!Perhaps there is a rightwards one?\\n IT = LINKR(IT)\\t\\t\\t!There is.\\n GO TO 40\\t\\t\\t!Go to IT.\\n END IF\\t\\t\\t!And if there are no further links,\\n IF (SP.GT.0) THEN\\t\\t!Perhaps we can retreat to what was deferred.\\n IT = STACK(SP)\\t\\t\\t!The finger.\\n LEVEL = SLEVL(SP)\\t\\t!The level.\\n SP = SP - 1\\t\\t\\t!Wind back the stack.\\n GO TO 40\\t\\t\\t!Go to IT.\\n END IF\\t\\t\\t!So much for the stack.\\n WRITE (6,12) \\\"Levelorder\\\",\\t!Roll the lists in ascending LEVEL order.\\n 1 (NODE(MIST(LEVEL,1:MIST(LEVEL,0))), LEVEL = 1,MAXLEVEL)\\n CALL JANE(\\\"LEVEL\\\")\\t!Alternatively...\\n END\\t!So much for that.\\n\",\n \"language\": \"Fortran\"\n },\n {\n \"code\": \"#define NULL 0\\n\\nDim Shared As Byte maxnodos = 100\\nDim Shared As Byte raiz = 0\\nDim Shared As Byte izda = 1\\nDim Shared As Byte dcha = 2\\nDim Shared As Byte arbol(maxnodos, 3)\\n\\nSub crear_arbol()\\n arbol(1, raiz) = 1\\n arbol(1, izda) = 2 : arbol(1, dcha) = 3\\n arbol(2, raiz) = 2\\n arbol(2, izda) = 4 : arbol(2, dcha) = 5\\n arbol(3, raiz) = 3\\n arbol(3, izda) = 6 : arbol(3, dcha) = NULL\\n arbol(4, raiz) = 4\\n arbol(4, izda) = 7 : arbol(4, dcha) = NULL\\n arbol(5, raiz) = 5\\n arbol(5, izda) = NULL : arbol(5, dcha) = NULL\\n arbol(6, raiz) = 6\\n arbol(6, izda) = 8 : arbol(6, dcha) = 9\\n arbol(7, raiz) = 7\\n arbol(7, izda) = NULL : arbol(7, dcha) = NULL\\n arbol(8, raiz) = 8\\n arbol(8, izda) = NULL : arbol(8, dcha) = NULL\\n arbol(9, raiz) = 9\\n arbol(9, izda) = NULL : arbol(9, dcha) = NULL\\nEnd Sub\\n\\nSub recorrido_preorder(nodo As Byte)\\n If nodo <> NULL Then\\n Print arbol(nodo, raiz);\\n recorrido_preorder(arbol(nodo, izda))\\n recorrido_preorder(arbol(nodo, dcha))\\n End If\\nEnd Sub\\n\\nSub recorrido_postorder(nodo As Byte)\\n If nodo <> NULL Then\\n recorrido_postorder(arbol(nodo, izda))\\n recorrido_postorder(arbol(nodo, dcha))\\n Print arbol(nodo, raiz);\\n End If\\nEnd Sub\\n\\nSub recorrido_inorden(nodo As Byte)\\n If nodo <> NULL Then\\n recorrido_inorden(arbol(nodo, izda))\\n Print arbol(nodo, raiz);\\n recorrido_inorden(arbol(nodo, dcha))\\n End If\\nEnd Sub\\n\\nSub recorrido_ordenXnivel(nodo As Byte)\\n Dim As Byte actual = 1\\n Dim As Byte primero_libre = actual + 1\\n Dim As Byte cola(maxnodos)\\n cola(actual) = nodo\\n\\n While cola(actual) <> NULL\\n If arbol(cola(actual), izda) <> NULL Then\\n cola(primero_libre) = arbol(cola(actual), izda)\\n primero_libre += 1\\n End If\\n If arbol(cola(actual), dcha) <> NULL Then\\n cola(primero_libre) = arbol(cola(actual), dcha)\\n primero_libre += 1\\n End If\\n Print arbol(cola(actual), raiz);\\n actual += 1\\n Wend\\nEnd Sub\\n\",\n \"language\": \"FreeBASIC\"\n },\n {\n \"code\": \"data Tree = Empty | Node( value, left, right )\\n\\ndef\\n preorder( Empty ) = []\\n preorder( Node(v, l, r) ) = [v] + preorder( l ) + preorder( r )\\n\\n inorder( Empty ) = []\\n inorder( Node(v, l, r) ) = inorder( l ) + [v] + inorder( r )\\n\\n postorder( Empty ) = []\\n postorder( Node(v, l, r) ) = postorder( l ) + postorder( r ) + [v]\\n\\n levelorder( x ) =\\n def\\n order( [] ) = []\\n order( Empty : xs ) = order( xs )\\n order( Node(v, l, r) : xs ) = v : order( xs + [l, r] )\\n\\n order( [x] )\\n\\ntree = Node( 1,\\n Node( 2,\\n Node( 4,\\n Node( 7, Empty, Empty ),\\n Empty ),\\n Node( 5, Empty, Empty ) ),\\n Node( 3,\\n Node( 6,\\n Node( 8, Empty, Empty ),\\n Node( 9, Empty, Empty ) ),\\n Empty ) )\\n\\nprintln( preorder(tree) )\\nprintln( inorder(tree) )\\nprintln( postorder(tree) )\\nprintln( levelorder(tree) )\\n\",\n \"language\": \"FunL\"\n },\n {\n \"code\": \"maxnodes%=100 ! set a limit to size of tree\\ncontent%=0 ! index of content field\\nleft%=1 ! index of left tree\\nright%=2 ! index of right tree\\nDIM tree%(maxnodes%,3) ! create space for tree\\n'\\nOPENW 1\\nCLEARW 1\\n'\\n@create_tree\\nPRINT \\\"Preorder: \\\";\\n@preorder_traversal(1)\\nPRINT \\\"\\\"\\nPRINT \\\"Inorder: \\\";\\n@inorder_traversal(1)\\nPRINT \\\"\\\"\\nPRINT \\\"Postorder: \\\";\\n@postorder_traversal(1)\\nPRINT \\\"\\\"\\nPRINT \\\"Levelorder: \\\";\\n@levelorder_traversal(1)\\nPRINT \\\"\\\"\\n'\\n~INP(2)\\nCLOSEW 1\\n'\\n' Define the example tree\\n'\\nPROCEDURE create_tree\\n tree%(1,content%)=1\\n tree%(1,left%)=2\\n tree%(1,right%)=3\\n tree%(2,content%)=2\\n tree%(2,left%)=4\\n tree%(2,right%)=5\\n tree%(3,content%)=3\\n tree%(3,left%)=6\\n tree%(3,right%)=0 ! 0 is used for no subtree\\n tree%(4,content%)=4\\n tree%(4,left%)=7\\n tree%(4,right%)=0\\n tree%(5,content%)=5\\n tree%(5,left%)=0\\n tree%(5,right%)=0\\n tree%(6,content%)=6\\n tree%(6,left%)=8\\n tree%(6,right%)=9\\n tree%(7,content%)=7\\n tree%(7,left%)=0\\n tree%(7,right%)=0\\n tree%(8,content%)=8\\n tree%(8,left%)=0\\n tree%(8,right%)=0\\n tree%(9,content%)=9\\n tree%(9,left%)=0\\n tree%(9,right%)=0\\nRETURN\\n'\\n' Preorder traversal from given node\\n'\\nPROCEDURE preorder_traversal(node%)\\n IF node%<>0 ! 0 means there is no node\\n PRINT tree%(node%,content%);\\n preorder_traversal(tree%(node%,left%))\\n preorder_traversal(tree%(node%,right%))\\n ENDIF\\nRETURN\\n'\\n' Postorder traversal from given node\\n'\\nPROCEDURE postorder_traversal(node%)\\n IF node%<>0 ! 0 means there is no node\\n postorder_traversal(tree%(node%,left%))\\n postorder_traversal(tree%(node%,right%))\\n PRINT tree%(node%,content%);\\n ENDIF\\nRETURN\\n'\\n' Inorder traversal from given node\\n'\\nPROCEDURE inorder_traversal(node%)\\n IF node%<>0 ! 0 means there is no node\\n inorder_traversal(tree%(node%,left%))\\n PRINT tree%(node%,content%);\\n inorder_traversal(tree%(node%,right%))\\n ENDIF\\nRETURN\\n'\\n' Level order traversal from given node\\n'\\nPROCEDURE levelorder_traversal(node%)\\n LOCAL nodes%,first_free%,current%\\n '\\n ' Set up initial queue of nodes\\n '\\n DIM nodes%(maxnodes%) ! some working space to store queue of nodes\\n current%=1\\n nodes%(current%)=node%\\n first_free%=current%+1\\n '\\n WHILE nodes%(current%)<>0\\n ' add the children of current node onto queue\\n IF tree%(nodes%(current%),left%)<>0\\n nodes%(first_free%)=tree%(nodes%(current%),left%)\\n first_free%=first_free%+1\\n ENDIF\\n IF tree%(nodes%(current%),right%)<>0\\n nodes%(first_free%)=tree%(nodes%(current%),right%)\\n first_free%=first_free%+1\\n ENDIF\\n ' print the current node content\\n PRINT tree%(nodes%(current%),content%);\\n ' advance to next node\\n current%=current%+1\\n WEND\\nRETURN\\n\",\n \"language\": \"GFA-Basic\"\n },\n {\n \"code\": \"package main\\n\\nimport \\\"fmt\\\"\\n\\ntype node struct {\\n value int\\n left, right *node\\n}\\n\\nfunc (n *node) iterPreorder(visit func(int)) {\\n if n == nil {\\n return\\n }\\n visit(n.value)\\n n.left.iterPreorder(visit)\\n n.right.iterPreorder(visit)\\n}\\n\\nfunc (n *node) iterInorder(visit func(int)) {\\n if n == nil {\\n return\\n }\\n n.left.iterInorder(visit)\\n visit(n.value)\\n n.right.iterInorder(visit)\\n}\\n\\nfunc (n *node) iterPostorder(visit func(int)) {\\n if n == nil {\\n return\\n }\\n n.left.iterPostorder(visit)\\n n.right.iterPostorder(visit)\\n visit(n.value)\\n}\\n\\nfunc (n *node) iterLevelorder(visit func(int)) {\\n if n == nil {\\n return\\n }\\n for queue := []*node{n}; ; {\\n n = queue[0]\\n visit(n.value)\\n copy(queue, queue[1:])\\n queue = queue[:len(queue)-1]\\n if n.left != nil {\\n queue = append(queue, n.left)\\n }\\n if n.right != nil {\\n queue = append(queue, n.right)\\n }\\n if len(queue) == 0 {\\n return\\n }\\n }\\n}\\n\\nfunc main() {\\n tree := &node{1,\\n &node{2,\\n &node{4,\\n &node{7, nil, nil},\\n nil},\\n &node{5, nil, nil}},\\n &node{3,\\n &node{6,\\n &node{8, nil, nil},\\n &node{9, nil, nil}},\\n nil}}\\n fmt.Print(\\\"preorder: \\\")\\n tree.iterPreorder(visitor)\\n fmt.Println()\\n fmt.Print(\\\"inorder: \\\")\\n tree.iterInorder(visitor)\\n fmt.Println()\\n fmt.Print(\\\"postorder: \\\")\\n tree.iterPostorder(visitor)\\n fmt.Println()\\n fmt.Print(\\\"level-order: \\\")\\n tree.iterLevelorder(visitor)\\n fmt.Println()\\n}\\n\\nfunc visitor(value int) {\\n fmt.Print(value, \\\" \\\")\\n}\\n\",\n \"language\": \"Go\"\n },\n {\n \"code\": \"package main\\n\\nimport \\\"fmt\\\"\\n\\n// flat, level-order representation.\\n// for node at index k, left child has index 2k, right child has index 2k+1.\\n// a value of -1 means the node does not exist.\\ntype tree []int\\n\\nfunc main() {\\n t := tree{1, 2, 3, 4, 5, 6, -1, 7, -1, -1, -1, 8, 9}\\n visitor := func(n int) {\\n fmt.Print(n, \\\" \\\")\\n }\\n fmt.Print(\\\"preorder: \\\")\\n t.iterPreorder(visitor)\\n fmt.Print(\\\"\\\\ninorder: \\\")\\n t.iterInorder(visitor)\\n fmt.Print(\\\"\\\\npostorder: \\\")\\n t.iterPostorder(visitor)\\n fmt.Print(\\\"\\\\nlevel-order: \\\")\\n t.iterLevelorder(visitor)\\n fmt.Println()\\n}\\n\\nfunc (t tree) iterPreorder(visit func(int)) {\\n var traverse func(int)\\n traverse = func(k int) {\\n if k >= len(t) || t[k] == -1 {\\n return\\n }\\n visit(t[k])\\n traverse(2*k + 1)\\n traverse(2*k + 2)\\n }\\n traverse(0)\\n}\\n\\nfunc (t tree) iterInorder(visit func(int)) {\\n var traverse func(int)\\n traverse = func(k int) {\\n if k >= len(t) || t[k] == -1 {\\n return\\n }\\n traverse(2*k + 1)\\n visit(t[k])\\n traverse(2*k + 2)\\n }\\n traverse(0)\\n}\\n\\nfunc (t tree) iterPostorder(visit func(int)) {\\n var traverse func(int)\\n traverse = func(k int) {\\n if k >= len(t) || t[k] == -1 {\\n return\\n }\\n traverse(2*k + 1)\\n traverse(2*k + 2)\\n visit(t[k])\\n }\\n traverse(0)\\n}\\n\\nfunc (t tree) iterLevelorder(visit func(int)) {\\n for _, n := range t {\\n if n != -1 {\\n visit(n)\\n }\\n }\\n}\\n\",\n \"language\": \"Go\"\n },\n {\n \"code\": \"def preorder;\\npreorder = { Node node ->\\n ([node] + node.children().collect { preorder(it) }).flatten()\\n}\\n\\ndef postorder;\\npostorder = { Node node ->\\n (node.children().collect { postorder(it) } + [node]).flatten()\\n}\\n\\ndef inorder;\\ninorder = { Node node ->\\n def kids = node.children()\\n if (kids.empty) [node]\\n else if (kids.size() == 1 && kids[0].'@right') [node] + inorder(kids[0])\\n else inorder(kids[0]) + [node] + (kids.size()>1 ? inorder(kids[1]) : [])\\n}\\n\\ndef levelorder = { Node node ->\\n def nodeList = []\\n def level = [node]\\n while (!level.empty) {\\n nodeList += level\\n def nextLevel = level.collect { it.children() }.flatten()\\n level = nextLevel\\n }\\n nodeList\\n}\\n\\nclass BinaryNodeBuilder extends NodeBuilder {\\n protected Object postNodeCompletion(Object parent, Object node) {\\n assert node.children().size() < 3\\n node\\n }\\n}\\n\",\n \"language\": \"Groovy\"\n },\n {\n \"code\": \"try {\\n new BinaryNodeBuilder().'1' {\\n a {}\\n b {}\\n c {}\\n }\\n println 'not limited to binary tree\\\\r\\\\n'\\n} catch (org.codehaus.groovy.transform.powerassert.PowerAssertionError e) {\\n println 'limited to binary tree\\\\r\\\\n'\\n}\\n\",\n \"language\": \"Groovy\"\n },\n {\n \"code\": \"// 1\\n// / \\\\\\n// 2 3\\n// / \\\\ /\\n// 4 5 6\\n// / / \\\\\\n// 7 8 9\\ndef tree1 = new BinaryNodeBuilder().\\n'1' {\\n '2' {\\n '4' { '7' {} }\\n '5' {}\\n }\\n '3' {\\n '6' { '8' {}; '9' {} }\\n }\\n}\\n\",\n \"language\": \"Groovy\"\n },\n {\n \"code\": \"// 1\\n// / \\\\\\n// 2 3\\n// / \\\\ /\\n// 4 5 6\\n// \\\\ / \\\\\\n// 7 8 9\\ndef tree2 = new BinaryNodeBuilder().\\n'1' {\\n '2' {\\n '4' { '7'(right:true) {} }\\n '5' {}\\n }\\n '3' {\\n '6' { '8' {}; '9' {} }\\n }\\n}\\n\",\n \"language\": \"Groovy\"\n },\n {\n \"code\": \"def test = { tree ->\\n println \\\"preorder: ${preorder(tree).collect{it.name()}}\\\"\\n println \\\"preorder: ${tree.depthFirst().collect{it.name()}}\\\"\\n\\n println \\\"postorder: ${postorder(tree).collect{it.name()}}\\\"\\n\\n println \\\"inorder: ${inorder(tree).collect{it.name()}}\\\"\\n\\n println \\\"level-order: ${levelorder(tree).collect{it.name()}}\\\"\\n println \\\"level-order: ${tree.breadthFirst().collect{it.name()}}\\\"\\n\\n println()\\n}\\ntest(tree1)\\ntest(tree2)\\n\",\n \"language\": \"Groovy\"\n },\n {\n \"code\": \"---------------------- TREE TRAVERSAL --------------------\\n\\ndata Tree a\\n = Empty\\n | Node\\n { value :: a,\\n left :: Tree a,\\n right :: Tree a\\n }\\n\\npreorder, inorder, postorder, levelorder :: Tree a -> [a]\\npreorder Empty = []\\npreorder (Node v l r) = v : preorder l <> preorder r\\n\\ninorder Empty = []\\ninorder (Node v l r) = inorder l <> (v : inorder r)\\n\\npostorder Empty = []\\npostorder (Node v l r) = postorder l <> postorder r <> [v]\\n\\nlevelorder x = loop [x]\\n where\\n loop [] = []\\n loop (Empty : xs) = loop xs\\n loop (Node v l r : xs) = v : loop (xs <> [l, r])\\n\\n--------------------------- TEST -------------------------\\ntree :: Tree Int\\ntree =\\n Node\\n 1\\n ( Node\\n 2\\n (Node 4 (Node 7 Empty Empty) Empty)\\n (Node 5 Empty Empty)\\n )\\n ( Node\\n 3\\n (Node 6 (Node 8 Empty Empty) (Node 9 Empty Empty))\\n Empty\\n )\\n\\nasciiTree :: String\\nasciiTree =\\n unlines\\n [ \\\" 1\\\",\\n \\\" / \\\\\\\\\\\",\\n \\\" / \\\\\\\\\\\",\\n \\\" / \\\\\\\\\\\",\\n \\\" 2 3\\\",\\n \\\" / \\\\\\\\ /\\\",\\n \\\" 4 5 6\\\",\\n \\\" / / \\\\\\\\\\\",\\n \\\" 7 8 9\\\"\\n ]\\n\\n-------------------------- OUTPUT ------------------------\\nmain :: IO ()\\nmain = do\\n putStrLn asciiTree\\n mapM_ putStrLn $\\n zipWith\\n ( \\\\s xs ->\\n justifyLeft 14 ' ' (s <> \\\":\\\")\\n <> unwords (show <$> xs)\\n )\\n [\\\"preorder\\\", \\\"inorder\\\", \\\"postorder\\\", \\\"level-order\\\"]\\n ([preorder, inorder, postorder, levelorder] <*> [tree])\\n where\\n justifyLeft n c s = take n (s <> replicate n c)\\n\",\n \"language\": \"Haskell\"\n },\n {\n \"code\": \"import Data.Bool (bool)\\nimport Data.Tree (Tree (..), drawForest, drawTree, foldTree)\\n\\n---------------------- TREE TRAVERSAL --------------------\\n\\ninorder, postorder, preorder :: a -> [[a]] -> [a]\\ninorder x [] = [x]\\ninorder x (y : xs) = y <> [x] <> concat xs\\n\\npostorder x xs = concat xs <> [x]\\n\\npreorder x xs = x : concat xs\\n\\nlevelOrder :: Tree a -> [a]\\nlevelOrder = concat . levels\\n\\nlevels :: Tree a -> [[a]]\\nlevels tree = go tree []\\n where\\n go (Node x xs) a =\\n let (h, t) = case a of\\n [] -> ([], [])\\n (y : ys) -> (y, ys)\\n in (x : h) : foldr go t xs\\n\\nnodeCount,\\n treeDepth,\\n treeMax,\\n treeMin,\\n treeProduct,\\n treeSum,\\n treeWidth ::\\n Int -> [Int] -> Int\\nnodeCount = const (succ . sum)\\ntreeDepth = const (succ . foldr max 1)\\ntreeMax x xs = maximum (x : xs)\\ntreeMin x xs = minimum (x : xs)\\ntreeProduct x xs = x * product xs\\ntreeSum x xs = x + sum xs\\ntreeWidth _ [] = 1\\ntreeWidth _ xs = sum xs\\n\\ntreeLeaves :: Tree a -> [a]\\ntreeLeaves = foldTree go\\n where\\n go x [] = [x]\\n go _ xs = concat xs\\n\\n--------------------------- TEST -------------------------\\ntree :: Tree Int\\ntree =\\n Node\\n 1\\n [ Node 2 [Node 4 [Node 7 []], Node 5 []],\\n Node 3 [Node 6 [Node 8 [], Node 9 []]]\\n ]\\n\\nmain :: IO ()\\nmain = do\\n putStrLn $ drawTree $ fmap show tree\\n mapM_\\n print\\n ( [foldTree]\\n <*> [preorder, inorder, postorder]\\n <*> [tree]\\n )\\n print $ levelOrder tree\\n putStrLn \\\"\\\"\\n\\n (putStrLn . unlines)\\n ( ( \\\\(k, f) ->\\n justifyRight 7 ' ' k\\n <> \\\" -> \\\"\\n <> justifyLeft 6 ' ' (show $ foldTree f tree)\\n )\\n <$> [ (\\\"Count\\\", nodeCount),\\n (\\\"Layers\\\", treeDepth),\\n (\\\"Max\\\", treeMax),\\n (\\\"Min\\\", treeMin),\\n (\\\"Product\\\", treeProduct),\\n (\\\"Sum\\\", treeSum),\\n (\\\"Leaves\\\", treeWidth)\\n ]\\n )\\n\\njustifyLeft, justifyRight :: Int -> Char -> String -> String\\njustifyLeft n c s = take n (s <> replicate n c)\\njustifyRight n c = (drop . length) <*> (replicate n c <>)\\n\",\n \"language\": \"Haskell\"\n },\n {\n \"code\": \"procedure main()\\n bTree := [1, [2, [4, [7]], [5]], [3, [6, [8], [9]]]]\\n showTree(bTree, preorder|inorder|postorder|levelorder)\\nend\\n\\nprocedure showTree(tree, f)\\n writes(image(f),\\\":\\\\t\\\")\\n every writes(\\\" \\\",f(tree)[1])\\n write()\\nend\\n\\nprocedure preorder(L)\\n if \\\\L then suspend L | preorder(L[2|3])\\nend\\n\\nprocedure inorder(L)\\n if \\\\L then suspend inorder(L[2]) | L | inorder(L[3])\\nend\\n\\nprocedure postorder(L)\\n if \\\\L then suspend postorder(L[2|3]) | L\\nend\\n\\nprocedure levelorder(L)\\n if \\\\L then {\\n queue := [L]\\n while nextnode := get(queue) do {\\n every put(queue, \\\\nextnode[2|3])\\n suspend nextnode\\n }\\n }\\nend\\n\",\n \"language\": \"Icon\"\n },\n {\n \"code\": \"theory Tree\\nimports Main\\nbegin\\n\\ndatatype 'a tree = Leaf | Node \\\"'a tree\\\" 'a \\\"'a tree\\\"\\n\\ndefinition example :: \\\"int tree\\\" where\\n \\\"example =\\n Node\\n (Node\\n (Node\\n (Node Leaf 7 Leaf)\\n 4\\n Leaf\\n )\\n 2\\n (Node Leaf 5 Leaf)\\n )\\n 1\\n (Node\\n (Node\\n (Node Leaf 8 Leaf)\\n 6\\n (Node Leaf 9 Leaf)\\n )\\n 3\\n Leaf\\n )\\\"\\n\\nfun preorder :: \\\"'a tree ? 'a list\\\" where\\n \\\"preorder Leaf = []\\\"\\n| \\\"preorder (Node l a r) = a # preorder l @ preorder r\\\"\\n\\nlemma \\\"preorder example = [1, 2, 4, 7, 5, 3, 6, 8, 9]\\\" by code_simp\\n\\nfun inorder :: \\\"'a tree ? 'a list\\\" where\\n \\\"inorder Leaf = []\\\"\\n| \\\"inorder (Node l a r) = inorder l @ [a] @ inorder r\\\"\\n\\nlemma \\\"inorder example = [7, 4, 2, 5, 1, 8, 6, 9, 3]\\\" by code_simp\\n\\nfun postorder :: \\\"'a tree ? 'a list\\\" where\\n \\\"postorder Leaf = []\\\"\\n| \\\"postorder (Node l a r) = postorder l @ postorder r @ [a]\\\"\\n\\nlemma \\\"postorder example = [7, 4, 5, 2, 8, 9, 6, 3, 1]\\\" by code_simp\\n\\nlemma\\n \\\"set (inorder t) = set (preorder t)\\\"\\n \\\"set (preorder t) = set (postorder t)\\\"\\n \\\"set (inorder t) = set (postorder t)\\\"\\n by(induction t, simp, simp)+\\n\\ntext‹\\nFor a breadth first search, we will have a queue of the nodes we still\\nwant to visit. The type of the queue is \\\\<^typ>‹'a tree list›.\\nWith each step, summing the sizes of the subtrees in the queue,\\nthe queue gets smaller. Thus, the breadth first search terminates.\\nIsabelle cannot figure out this termination argument automatically,\\nso we provide some help by defining what the size of a tree is.\\n›\\nfun tree_size :: \\\"'a tree ? nat\\\" where\\n \\\"tree_size Leaf = 1\\\"\\n| \\\"tree_size (Node l _ r) = 1 + tree_size l + tree_size r\\\"\\n\\nfunction (sequential) bfs :: \\\"'a tree list ? 'a list\\\" where\\n \\\"bfs [] = []\\\"\\n| \\\"bfs (Leaf#q) = bfs q\\\"\\n| \\\"bfs ((Node l a r)#q) = a # bfs (q @ [l,r])\\\"\\n by pat_completeness auto\\ntermination bfs\\n by(relation \\\"measure (?qs. sum_list (map tree_size qs))\\\") simp+\\n\\nfun levelorder :: \\\"'a tree ? 'a list\\\" where\\n \\\"levelorder t = bfs [t]\\\"\\n\\nlemma \\\"levelorder example = [1, 2, 3, 4, 5, 6, 7, 8, 9]\\\" by code_simp\\n\\nend\\n\",\n \"language\": \"Isabelle\"\n },\n {\n \"code\": \"preorder=: ]S:0\\npostorder=: ([:; postorder&.>@}.) , >@{.\\nlevelorder=: ;@({::L:1 _~ [: (/: #@>) <S:1@{::)\\ninorder=: ([:; inorder&.>@(''\\\"_`(1&{)@.(1<#))) , >@{. , [:; inorder&.>@}.@}.\\n\",\n \"language\": \"J\"\n },\n {\n \"code\": \"dataorder=: /:@data reorder ]\\nlevelorder=: /:@depth@parent reorder ]\\n\\ninorder=: inperm@parent reorder ]\\ninperm=:3 :0\\n chil=. childinds y\\n node=. {.I.(= i.@#) y\\n todo=. i.0 2\\n r=. i.0\\n whilst. (#todo)+.0<:node do.\\n if. 0 <: node do.\\n if. 0 <: {.ch=. node{chil do.\\n todo=. todo, node,{:ch\\n node=. {.ch\\n else.\\n r=. r, node\\n node=. _1 end.\\n else.\\n r=. r, {.ch=. {: todo\\n todo=. }: todo\\n node=. {:ch end. end.\\n r\\n)\\n\\npostorder=: postperm@parent reorder ]\\npostperm=:3 :0\\n chil=. 0,1+childinds y\\n todo=. 1+I.(= i.@#) y\\n r=. i.0\\n whilst. (#todo) do.\\n node=. {: todo\\n todo=. }: todo\\n if. 0 < node do.\\n if. #ch=. (node{chil)-.0 do.\\n todo=. todo,(-node),|.ch\\n else.\\n r=. r, <:node end.\\n else.\\n r=. r, <:|node end. end.\\n)\\n\\npreorder=: preperm@parent reorder ]\\npreperm=:3 :0\\n chil=. childinds y\\n todo=. I.(= i.@#) y\\n r=. i.0\\n whilst. (#todo) do.\\n r=. r,node=. {: todo\\n todo=. }: todo\\n if. #ch=. (node{chil)-._1 do.\\n todo=. todo,|.ch end. end.\\n r\\n)\\n\",\n \"language\": \"J\"\n },\n {\n \"code\": \" levelorder dataorder example\\n1 2 3 4 5 6 7 8 9\\n0 0 0 1 1 2 3 5 5\\n inorder dataorder example\\n7 4 2 5 1 8 6 9 3\\n1 2 4 2 4 6 8 6 4\\n preorder dataorder example\\n1 2 4 7 5 3 6 8 9\\n0 0 1 2 1 0 5 6 6\\n postorder dataorder example\\n7 4 5 2 8 9 6 3 1\\n1 3 3 8 6 6 7 8 8\\n\",\n \"language\": \"J\"\n },\n {\n \"code\": \"N2=: conjunction def '(<m),(<n),<y'\\nN1=: adverb def '(<m),<y'\\nL=: adverb def '<m'\\n\\ntree=: 1 N2 (2 N2 (4 N1 (7 L)) 5 L) 3 N1 6 N2 (8 L) 9 L\\n\",\n \"language\": \"J\"\n },\n {\n \"code\": \" preorder tree\\n1 2 4 7 5 3 6 8 9\\n\",\n \"language\": \"J\"\n },\n {\n \"code\": \" postorder tree\\n7 4 5 2 8 9 6 3 1\\n\",\n \"language\": \"J\"\n },\n {\n \"code\": \" inorder tree\\n7 4 2 5 1 8 6 9 3\\n\",\n \"language\": \"J\"\n },\n {\n \"code\": \" levelorder tree\\n1 2 3 4 5 6 7 8 9\\n\",\n \"language\": \"J\"\n },\n {\n \"code\": \" tree=: 1 N2 (2 N2 (4 N1 (7 L)) (5 L)) (3 N1 (6 N2 (8 L) (9 L)))\\n\",\n \"language\": \"J\"\n },\n {\n \"code\": \"example=:1 8 3 4 7 5 9 6 2,: 0 7 0 8 3 8 7 2 0\\n\",\n \"language\": \"J\"\n },\n {\n \"code\": \"depth=: +/@((~: , (~: i.@#@{.)~) {:@,)@({~^:a:)\\n\\nreorder=:4 :0\\n 'data parent'=. y\\n data1=. x{data\\n parent1=. x{data1 i. parent{data\\n if. 0=L.y do. data1,:parent1 else. data1;parent1 end.\\n)\\n\\ndata=:3 :'data[''data parent''=. y'\\nparent=:3 :'parent[''data parent''=. y'\\n\\nchildinds=: [: <:@(2&{.@-.&> #\\\\) (</. #\\\\)`(]~.)`(a:\\\"0)}~\\n\",\n \"language\": \"J\"\n },\n {\n \"code\": \"import java.util.*;\\n\\npublic class TreeTraversal {\\n\\n static class Node<T> {\\n\\t\\tT value;\\n\\t\\tNode<T> left;\\n\\t\\tNode<T> right;\\n\\n\\t\\tNode(T value) {\\n\\t\\t\\tthis.value = value;\\n\\t\\t}\\n\\n\\t\\tvoid visit() {\\n\\t\\t\\tSystem.out.print(this.value + \\\" \\\");\\n\\t\\t}\\n\\t}\\n\\n\\tstatic enum ORDER {\\n\\t\\tPREORDER, INORDER, POSTORDER, LEVEL\\n\\t}\\n\\n static <T> void traverse(Node<T> node, ORDER order) {\\n\\t\\tif (node == null) {\\n\\t\\t\\treturn;\\n\\t\\t}\\n\\t\\tswitch (order) {\\n\\t\\tcase PREORDER:\\n\\t\\t\\tnode.visit();\\n\\t\\t\\ttraverse(node.left, order);\\n\\t\\t\\ttraverse(node.right, order);\\n\\t\\t\\tbreak;\\n\\t\\tcase INORDER:\\n\\t\\t\\ttraverse(node.left, order);\\n\\t\\t\\tnode.visit();\\n\\t\\t\\ttraverse(node.right, order);\\n\\t\\t\\tbreak;\\n\\t\\tcase POSTORDER:\\n\\t\\t\\ttraverse(node.left, order);\\n\\t\\t\\ttraverse(node.right, order);\\n\\t\\t\\tnode.visit();\\n\\t\\t\\tbreak;\\n\\t\\tcase LEVEL:\\n\\t\\t\\tQueue<Node<T>> queue = new LinkedList<>();\\n\\t\\t\\tqueue.add(node);\\n\\t\\t\\twhile(!queue.isEmpty()){\\n\\t\\t\\t\\tNode<T> next = queue.remove();\\n\\t\\t\\t\\tnext.visit();\\n\\t\\t\\t\\tif(next.left!=null)\\n\\t\\t\\t\\t\\tqueue.add(next.left);\\n\\t\\t\\t\\tif(next.right!=null)\\n\\t\\t\\t\\t\\tqueue.add(next.right);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\t\\n\\n\\tpublic static void main(String[] args) {\\n\\n\\t\\tNode<Integer> one = new Node<Integer>(1);\\n\\t\\tNode<Integer> two = new Node<Integer>(2);\\n\\t\\tNode<Integer> three = new Node<Integer>(3);\\n\\t\\tNode<Integer> four = new Node<Integer>(4);\\n\\t\\tNode<Integer> five = new Node<Integer>(5);\\n\\t\\tNode<Integer> six = new Node<Integer>(6);\\n\\t\\tNode<Integer> seven = new Node<Integer>(7);\\n\\t\\tNode<Integer> eight = new Node<Integer>(8);\\n\\t\\tNode<Integer> nine = new Node<Integer>(9);\\n\\t\\t\\n\\t\\tone.left = two;\\n\\t\\tone.right = three;\\n\\t\\ttwo.left = four;\\n\\t\\ttwo.right = five;\\n\\t\\tthree.left = six;\\n\\t\\tfour.left = seven;\\n\\t\\tsix.left = eight;\\n\\t\\tsix.right = nine;\\n\\n\\t\\ttraverse(one, ORDER.PREORDER);\\n\\t\\tSystem.out.println();\\n\\t\\ttraverse(one, ORDER.INORDER);\\n\\t\\tSystem.out.println();\\n\\t\\ttraverse(one, ORDER.POSTORDER);\\n\\t\\tSystem.out.println();\\n\\t\\ttraverse(one, ORDER.LEVEL);\\n\\t\\t\\n\\t}\\n}\\n\",\n \"language\": \"Java\"\n },\n {\n \"code\": \"import java.util.function.Consumer;\\nimport java.util.Queue;\\nimport java.util.LinkedList;\\n\\nclass TreeTraversal {\\n static class EmptyNode {\\n void accept(Visitor aVisitor) {}\\n\\n void accept(LevelOrder aVisitor, Queue<EmptyNode> data) {}\\n }\\n\\n static class Node<T> extends EmptyNode {\\n T data;\\n EmptyNode left = new EmptyNode();\\n EmptyNode right = new EmptyNode();\\n\\n Node(T data) {\\n this.data = data;\\n }\\n\\n Node<T> left(Node<?> aNode) {\\n this.left = aNode;\\n return this;\\n }\\n\\n Node<T> right(Node<?> aNode) {\\n this.right = aNode;\\n return this;\\n }\\n\\n void accept(Visitor aVisitor) {\\n aVisitor.visit(this);\\n }\\n\\n void accept(LevelOrder aVisitor, Queue<EmptyNode> data) {\\n aVisitor.visit(this, data);\\n }\\n }\\n\\n static abstract class Visitor {\\n Consumer<Node<?>> action;\\n\\n Visitor(Consumer<Node<?>> action) {\\n this.action = action;\\n }\\n\\n abstract <T> void visit(Node<T> aNode);\\n }\\n\\n static class PreOrder extends Visitor {\\n PreOrder(Consumer<Node<?>> action) {\\n super(action);\\n }\\n\\n <T> void visit(Node<T> aNode) {\\n action.accept(aNode);\\n aNode.left.accept(this);\\n aNode.right.accept(this);\\n }\\n }\\n\\n static class InOrder extends Visitor {\\n InOrder(Consumer<Node<?>> action) {\\n super(action);\\n }\\n\\n <T> void visit(Node<T> aNode) {\\n aNode.left.accept(this);\\n action.accept(aNode);\\n aNode.right.accept(this);\\n }\\n }\\n\\n static class PostOrder extends Visitor {\\n PostOrder(Consumer<Node<?>> action) {\\n super(action);\\n }\\n\\n <T> void visit(Node<T> aNode) {\\n aNode.left.accept(this);\\n aNode.right.accept(this);\\n action.accept(aNode);\\n }\\n }\\n\\n static class LevelOrder extends Visitor {\\n LevelOrder(Consumer<Node<?>> action) {\\n super(action);\\n }\\n\\n <T> void visit(Node<T> aNode) {\\n Queue<EmptyNode> queue = new LinkedList<>();\\n queue.add(aNode);\\n do {\\n queue.remove().accept(this, queue);\\n } while (!queue.isEmpty());\\n }\\n\\n <T> void visit(Node<T> aNode, Queue<EmptyNode> queue) {\\n action.accept(aNode);\\n queue.add(aNode.left);\\n queue.add(aNode.right);\\n }\\n }\\n\\n public static void main(String[] args) {\\n Node<Integer> tree = new Node<Integer>(1)\\n .left(new Node<Integer>(2)\\n .left(new Node<Integer>(4)\\n .left(new Node<Integer>(7)))\\n .right(new Node<Integer>(5)))\\n .right(new Node<Integer>(3)\\n .left(new Node<Integer>(6)\\n .left(new Node<Integer>(8))\\n .right(new Node<Integer>(9))));\\n Consumer<Node<?>> print = aNode -> System.out.print(aNode.data + \\\" \\\");\\n tree.accept(new PreOrder(print));\\n System.out.println();\\n tree.accept(new InOrder(print));\\n System.out.println();\\n tree.accept(new PostOrder(print));\\n System.out.println();\\n tree.accept(new LevelOrder(print));\\n System.out.println();\\n }\\n}\\n\",\n \"language\": \"Java\"\n },\n {\n \"code\": \"function BinaryTree(value, left, right) {\\n this.value = value;\\n this.left = left;\\n this.right = right;\\n}\\nBinaryTree.prototype.preorder = function(f) {this.walk(f,['this','left','right'])}\\nBinaryTree.prototype.inorder = function(f) {this.walk(f,['left','this','right'])}\\nBinaryTree.prototype.postorder = function(f) {this.walk(f,['left','right','this'])}\\nBinaryTree.prototype.walk = function(func, order) {\\n for (var i in order)\\n switch (order[i]) {\\n case \\\"this\\\": func(this.value); break;\\n case \\\"left\\\": if (this.left) this.left.walk(func, order); break;\\n case \\\"right\\\": if (this.right) this.right.walk(func, order); break;\\n }\\n}\\nBinaryTree.prototype.levelorder = function(func) {\\n var queue = [this];\\n while (queue.length != 0) {\\n var node = queue.shift();\\n func(node.value);\\n if (node.left) queue.push(node.left);\\n if (node.right) queue.push(node.right);\\n }\\n}\\n\\n// convenience function for creating a binary tree\\nfunction createBinaryTreeFromArray(ary) {\\n var left = null, right = null;\\n if (ary[1]) left = createBinaryTreeFromArray(ary[1]);\\n if (ary[2]) right = createBinaryTreeFromArray(ary[2]);\\n return new BinaryTree(ary[0], left, right);\\n}\\n\\nvar tree = createBinaryTreeFromArray([1, [2, [4, [7]], [5]], [3, [6, [8],[9]]]]);\\n\\nprint(\\\"*** preorder ***\\\"); tree.preorder(print);\\nprint(\\\"*** inorder ***\\\"); tree.inorder(print);\\nprint(\\\"*** postorder ***\\\"); tree.postorder(print);\\nprint(\\\"*** levelorder ***\\\"); tree.levelorder(print);\\n\",\n \"language\": \"JavaScript\"\n },\n {\n \"code\": \"(function () {\\n\\n function preorder(n) {\\n return [n[v]].concat(\\n n[l] ? preorder(n[l]) : []\\n ).concat(\\n n[r] ? preorder(n[r]) : []\\n );\\n }\\n\\n function inorder(n) {\\n return (\\n n[l] ? inorder(n[l]) : []\\n ).concat(\\n n[v]\\n ).concat(\\n n[r] ? inorder(n[r]) : []\\n );\\n }\\n\\n function postorder(n) {\\n return (\\n n[l] ? postorder(n[l]) : []\\n ).concat(\\n n[r] ? postorder(n[r]) : []\\n ).concat(\\n n[v]\\n );\\n }\\n\\n function levelorder(n) {\\n return (function loop(x) {\\n return x.length ? (\\n x[0] ? (\\n [x[0][v]].concat(\\n loop(\\n x.slice(1).concat(\\n [x[0][l], x[0][r]]\\n )\\n )\\n )\\n ) : loop(x.slice(1))\\n ) : [];\\n })([n]);\\n }\\n\\n var v = 0,\\n l = 1,\\n r = 2,\\n\\n tree = [1,\\n [2,\\n [4,\\n [7]\\n ],\\n [5]\\n ],\\n [3,\\n [6,\\n [8],\\n [9]\\n ]\\n ]\\n ],\\n\\n lstTest = [[\\\"Traversal\\\", \\\"Nodes visited\\\"]].concat(\\n [preorder, inorder, postorder, levelorder].map(\\n function (f) {\\n return [f.name, f(tree)];\\n }\\n )\\n );\\n\\n // [[a]] -> bool -> s -> s\\n function wikiTable(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(lstTest, true) + '\\\\n\\\\n' + JSON.stringify(lstTest);\\n\\n})();\\n\",\n \"language\": \"JavaScript\"\n },\n {\n \"code\": \"[[\\\"Traversal\\\",\\\"Nodes visited\\\"],\\n[\\\"preorder\\\",[1,2,4,7,5,3,6,8,9]],[\\\"inorder\\\",[7,4,2,5,1,8,6,9,3]],\\n[\\\"postorder\\\",[7,4,5,2,8,9,6,3,1]],[\\\"levelorder\\\",[1,2,3,4,5,6,7,8,9]]]\\n\",\n \"language\": \"JavaScript\"\n },\n {\n \"code\": \"(function () {\\n 'use strict';\\n\\n // 'preorder' | 'inorder' | 'postorder' | 'level-order'\\n\\n // traverse :: String -> Tree {value: a, nest: [Tree]} -> [a]\\n function traverse(strOrderName, dctTree) {\\n var strName = strOrderName.toLowerCase();\\n\\n if (strName.startsWith('level')) {\\n\\n // LEVEL-ORDER\\n return levelOrder([dctTree]);\\n\\n } else if (strName.startsWith('in')) {\\n var lstNest = dctTree.nest;\\n\\n if ((lstNest ? lstNest.length : 0) < 3) {\\n var left = lstNest[0] || [],\\n right = lstNest[1] || [],\\n\\n lstLeft = left.nest ? (\\n traverse(strName, left)\\n ) : (left.value || []),\\n lstRight = right.nest ? (\\n traverse(strName, right)\\n ) : (right.value || []);\\n\\n return (lstLeft !== undefined && lstRight !== undefined) ?\\n\\n // IN-ORDER\\n (lstLeft instanceof Array ? lstLeft : [lstLeft])\\n .concat(dctTree.value)\\n .concat(lstRight) : undefined;\\n\\n } else { // in-order only defined here for binary trees\\n return undefined;\\n }\\n\\n } else {\\n var lstTraversed = concatMap(function (x) {\\n return traverse(strName, x);\\n }, (dctTree.nest || []));\\n\\n return (\\n strName.startsWith('pre') ? (\\n\\n // PRE-ORDER\\n [dctTree.value].concat(lstTraversed)\\n\\n ) : strName.startsWith('post') ? (\\n\\n // POST-ORDER\\n lstTraversed.concat(dctTree.value)\\n\\n ) : []\\n );\\n }\\n }\\n\\n // levelOrder :: [Tree {value: a, nest: [Tree]}] -> [a]\\n function levelOrder(lstTree) {\\n var lngTree = lstTree.length,\\n head = lngTree ? lstTree[0] : undefined,\\n tail = lstTree.slice(1);\\n\\n // Recursively take any value found in the head node\\n // of the remaining tail, deferring any child nodes\\n // of that head to the end of the tail\\n return lngTree ? (\\n head ? (\\n [head.value].concat(\\n levelOrder(\\n tail\\n .concat(head.nest || [])\\n )\\n )\\n ) : levelOrder(tail)\\n ) : [];\\n }\\n\\n // concatMap :: (a -> [b]) -> [a] -> [b]\\n function concatMap(f, xs) {\\n return [].concat.apply([], xs.map(f));\\n }\\n\\n var dctTree = {\\n value: 1,\\n nest: [{\\n value: 2,\\n nest: [{\\n value: 4,\\n nest: [{\\n value: 7\\n }]\\n }, {\\n value: 5\\n }]\\n }, {\\n value: 3,\\n nest: [{\\n value: 6,\\n nest: [{\\n value: 8\\n }, {\\n value: 9\\n }]\\n }]\\n }]\\n };\\n\\n\\n return ['preorder', 'inorder', 'postorder', 'level-order']\\n .reduce(function (a, k) {\\n return (\\n a[k] = traverse(k, dctTree),\\n a\\n );\\n }, {});\\n\\n})();\\n\",\n \"language\": \"JavaScript\"\n },\n {\n \"code\": \"{\\\"preorder\\\":[1, 2, 4, 7, 5, 3, 6, 8, 9],\\n\\\"inorder\\\":[7, 4, 2, 5, 1, 8, 6, 9, 3],\\n\\\"postorder\\\":[7, 4, 5, 2, 8, 9, 6, 3, 1],\\n\\\"level-order\\\":[1, 2, 3, 4, 5, 6, 7, 8, 9]}\\n\",\n \"language\": \"JavaScript\"\n },\n {\n \"code\": \"(() => {\\n \\\"use strict\\\";\\n\\n // preorder :: a -> [[a]] -> [a]\\n const preorder = x =>\\n xs => [x, ...xs.flat()];\\n\\n\\n // inorder :: a -> [[a]] -> [a]\\n const inorder = x =>\\n xs => Boolean(xs.length) ? (\\n [...xs[0], x, ...xs.slice(1).flat()]\\n ) : [x];\\n\\n\\n // postorder :: a -> [[a]] -> [a]\\n const postorder = x =>\\n xs => [...xs.flat(), x];\\n\\n\\n // levelOrder :: Tree a -> [a]\\n const levelOrder = tree =>\\n levels(tree).flat();\\n\\n\\n // ------------------------TEST------------------------\\n // main :: IO ()\\n const main = () => {\\n const tree = Node(1)([\\n Node(2)([\\n Node(4)([\\n Node(7)([])\\n ]),\\n Node(5)([])\\n ]),\\n Node(3)([\\n Node(6)([\\n Node(8)([]),\\n Node(9)([])\\n ])\\n ])\\n ]);\\n\\n // Generated by code in Rosetta Code\\n // task: 'Visualize a tree'\\n console.log([\\n \\\" + 4 - 7\\\",\\n \\\" + 2 ¦\\\",\\n \\\" ¦ + 5\\\",\\n \\\" 1 ¦\\\",\\n \\\" ¦ + 8\\\",\\n \\\" + 3 - 6 ¦\\\",\\n \\\" + 9\\\"\\n ].join(\\\"\\\\n\\\"));\\n\\n [preorder, inorder, postorder]\\n .forEach(f => console.log(\\n justifyRight(11)(\\\" \\\")(`${f.name}:`),\\n foldTree(f)(\\n tree\\n )\\n ));\\n\\n console.log(\\n `levelOrder: ${levelOrder(tree)}`\\n );\\n };\\n\\n // ---------------------- TREES ----------------------\\n\\n // Node :: a -> [Tree a] -> Tree a\\n const Node = v =>\\n // Constructor for a Tree node which connects a\\n // value of some kind to a list of zero or\\n // more child trees.\\n xs => ({\\n type: \\\"Node\\\",\\n root: v,\\n nest: xs || []\\n });\\n\\n\\n // foldTree :: (a -> [b] -> b) -> Tree a -> b\\n const foldTree = f => {\\n // The catamorphism on trees. A summary\\n // value obtained by a depth-first fold.\\n const go = tree => f(\\n tree.root\\n )(\\n tree.nest.map(go)\\n );\\n\\n return go;\\n };\\n\\n\\n // levels :: Tree a -> [[a]]\\n const levels = tree => {\\n // A list of lists, grouping the root\\n // values of each level of the tree.\\n const go = (a, node) => {\\n const [h, ...t] = 0 < a.length ? a : [\\n []\\n ];\\n\\n return [\\n [node.root, ...h],\\n ...node.nest.reduceRight(go, t)\\n ];\\n };\\n\\n return go([], tree);\\n };\\n\\n\\n // --------------------- GENERIC ---------------------\\n\\n // justifyRight :: Int -> Char -> String -> String\\n const justifyRight = n =>\\n // The string s, preceded by enough padding (with\\n // the character c) to reach the string length n.\\n c => s => Boolean(s) ? (\\n s.padStart(n, c)\\n ) : \\\"\\\";\\n\\n // MAIN ---\\n return main();\\n})();\\n\",\n \"language\": \"JavaScript\"\n },\n {\n \"code\": \"def preorder:\\n if length == 0 then empty\\n else .[0], (.[1]|preorder), (.[2]|preorder)\\n end;\\n\\ndef inorder:\\n if length == 0 then empty\\n else (.[1]|inorder), .[0] , (.[2]|inorder)\\n end;\\n\\ndef postorder:\\n if length == 0 then empty\\n else (.[1] | postorder), (.[2]|postorder), .[0]\\n end;\\n\\n# Helper functions for levelorder:\\n # Produce a stream of the first elements\\n def heads: map( .[0] | select(. != null)) | .[];\\n\\n# Produce a stream of the left/right branches:\\n def tails:\\n if length == 0 then empty\\n else [map ( .[1], .[2] ) | .[] | select( . != null)]\\n end;\\n\\ndef levelorder: [.] | recurse( tails ) | heads;\\n\",\n \"language\": \"Jq\"\n },\n {\n \"code\": \"def task:\\n # [node, left, right]\\n def atree: [1, [2, [4, [7,[],[]],\\n []],\\n [5, [],[]]],\\n\\n [3, [6, [8,[],[]],\\n [9,[],[]]],\\n []]] ;\\n\\n \\\"preorder: \\\\( [atree|preorder ])\\\",\\n \\\"inorder: \\\\( [atree|inorder ])\\\",\\n \\\"postorder: \\\\( [atree|postorder ])\\\",\\n \\\"levelorder: \\\\( [atree|levelorder])\\\"\\n;\\n\\ntask\\n\",\n \"language\": \"Jq\"\n },\n {\n \"code\": \"tree = Any[1, Any[2, Any[4, Any[7, Any[],\\n Any[]],\\n Any[]],\\n Any[5, Any[],\\n Any[]]],\\n Any[3, Any[6, Any[8, Any[],\\n Any[]],\\n Any[9, Any[],\\n Any[]]],\\n Any[]]]\\n\\npreorder(t, f) = if !isempty(t)\\n f(t[1]); preorder(t[2], f); preorder(t[3], f)\\n end\\n\\ninorder(t, f) = if !isempty(t)\\n inorder(t[2], f); f(t[1]); inorder(t[3], f)\\n end\\n\\npostorder(t, f) = if !isempty(t)\\n postorder(t[2], f); postorder(t[3], f); f(t[1])\\n end\\n\\nlevelorder(t, f) = while !isempty(t)\\n t = mapreduce(x -> isa(x, Number) ? (f(x); []) : x, vcat, t)\\n end\\n\",\n \"language\": \"Julia\"\n },\n {\n \"code\": \"data class Node(val v: Int, var left: Node? = null, var right: Node? = null) {\\n override fun toString() = \\\"$v\\\"\\n}\\n\\nfun preOrder(n: Node?) {\\n n?.let {\\n print(\\\"$n \\\")\\n preOrder(n.left)\\n preOrder(n.right)\\n }\\n}\\n\\nfun inorder(n: Node?) {\\n n?.let {\\n inorder(n.left)\\n print(\\\"$n \\\")\\n inorder(n.right)\\n }\\n}\\n\\nfun postOrder(n: Node?) {\\n n?.let {\\n postOrder(n.left)\\n postOrder(n.right)\\n print(\\\"$n \\\")\\n }\\n}\\n\\nfun levelOrder(n: Node?) {\\n n?.let {\\n val queue = mutableListOf(n)\\n while (queue.isNotEmpty()) {\\n val node = queue.removeAt(0)\\n print(\\\"$node \\\")\\n node.left?.let { queue.add(it) }\\n node.right?.let { queue.add(it) }\\n }\\n }\\n}\\n\\ninline fun exec(name: String, n: Node?, f: (Node?) -> Unit) {\\n print(name)\\n f(n)\\n println()\\n}\\n\\nfun main(args: Array<String>) {\\n val nodes = Array(10) { Node(it) }\\n\\n nodes[1].left = nodes[2]\\n nodes[1].right = nodes[3]\\n\\n nodes[2].left = nodes[4]\\n nodes[2].right = nodes[5]\\n\\n nodes[4].left = nodes[7]\\n\\n nodes[3].left = nodes[6]\\n\\n nodes[6].left = nodes[8]\\n nodes[6].right = nodes[9]\\n\\n exec(\\\" preOrder: \\\", nodes[1], ::preOrder)\\n exec(\\\" inorder: \\\", nodes[1], ::inorder)\\n exec(\\\" postOrder: \\\", nodes[1], ::postOrder)\\n exec(\\\"level-order: \\\", nodes[1], ::levelOrder)\\n}\\n\",\n \"language\": \"Kotlin\"\n },\n {\n \"code\": \"fun main(args: Array<String>) {\\n data class Node(val v: Int, var left: Node? = null, var right: Node? = null) {\\n override fun toString() = \\\" $v\\\"\\n\\n fun preOrder() { print(this); left?.preOrder(); right?.preOrder() }\\n fun inorder() { left?.inorder(); print(this); right?.inorder() }\\n fun postOrder() { left?.postOrder(); right?.postOrder(); print(this) }\\n\\n fun levelOrder() = with(mutableListOf(this)) {\\n do {\\n val node = removeAt(0)\\n print(node)\\n node.left?.let { add(it) }\\n node.right?.let { add(it) }\\n } while (any())\\n }\\n\\n inline fun exec(name: String, f: (Node) -> Unit) {\\n print(name)\\n f(this)\\n println()\\n }\\n }\\n\\n val nodes = Array(10) { Node(it) }\\n\\n nodes[1].left = nodes[2]\\n nodes[1].right = nodes[3]\\n nodes[2].left = nodes[4]\\n nodes[2].right = nodes[5]\\n nodes[4].left = nodes[7]\\n nodes[3].left = nodes[6]\\n nodes[6].left = nodes[8]\\n nodes[6].right = nodes[9]\\n\\n with(nodes[1]) {\\n exec(\\\" preOrder:\\\", Node::preOrder)\\n exec(\\\" inorder:\\\", Node::inorder)\\n exec(\\\" postOrder:\\\", Node::postOrder)\\n exec(\\\"level-order:\\\", Node::levelOrder)\\n }\\n}\\n\",\n \"language\": \"Kotlin\"\n },\n {\n \"code\": \"{def walk\\n\\n {def walk.r\\n {lambda {:o :t}\\n {if {W.equal? :t nil}\\n then\\n else {if {W.equal? :o preorder} then {A.get 0 :t} else}\\n {walk.r :order {A.get 1 :t}}\\n {if {W.equal? :o inorder} then {A.get 0 :t} else}\\n {walk.r :order {A.get 2 :t}}\\n {if {W.equal? :o postorder} then {A.get 0 :t} else} }}}\\n\\n {lambda {:o :t}\\n {S.replace \\\\s by space in {walk.r :o :t}}}}\\n\\n{def sort\\n {lambda {:o :t} {S.sort :o {walk preorder :t}}}}\\n\\n{def T\\n {A.new 1\\n {A.new 2\\n {A.new 4\\n {A.new 7 nil nil} nil}\\n {A.new 5 nil nil}}\\n {A.new 3\\n {A.new 6\\n {A.new 8 nil nil}\\n {A.new 9 nil nil}} nil}}}\\n\\n{walk preorder {T}} -> 1 2 4 7 5 3 6 8 9\\n{walk inorder {T}} -> 7 4 2 5 1 8 6 9 3\\n{walk postorder {T}} -> 7 4 5 2 8 9 6 3 1\\n{sort < {T}} -> 1 2 3 4 5 6 7 8 9\\n{sort > {T}} -> 9 8 7 6 5 4 3 2 1\\n\",\n \"language\": \"Lambdatalk\"\n },\n {\n \"code\": \"-- parent script \\\"BinaryTreeNode\\\"\\n\\nproperty _val, _left, _right\\n\\non new (me, val)\\n me._val = val\\n return me\\nend\\n\\non getValue (me)\\n return me._val\\nend\\n\\non setLeft (me, node)\\n me._left = node\\nend\\n\\non setRight (me, node)\\n me._right = node\\nend\\n\\non getLeft (me)\\n return me._left\\nend\\n\\non getRight (me)\\n return me._right\\nend\\n\",\n \"language\": \"Lingo\"\n },\n {\n \"code\": \"-- parent script \\\"BinaryTreeTraversal\\\"\\n\\non inOrder (me, node, l)\\n if voidP(l) then l = []\\n if voidP(node) then return l\\n if not voidP(node.getLeft()) then l = me.inOrder(node.getLeft(), l)\\n l.add(node)\\n if not voidP(node.getRight()) then l = me.inOrder(node.getRight(), l)\\n return l\\nend\\n\\non preOrder (me, node, l)\\n if voidP(l) then l = []\\n if voidP(node) then return l\\n l.add(node)\\n if not voidP(node.getLeft()) then l = me.preOrder(node.getLeft(), l)\\n if not voidP(node.getRight()) then l = me.preOrder(node.getRight(), l)\\n return l\\nend\\n\\non postOrder (me, node, l)\\n if voidP(l) then l = []\\n if voidP(node) then return l\\n if not voidP(node.getLeft()) then l = me.postOrder(node.getLeft(), l)\\n if not voidP(node.getRight()) then l = me.postOrder(node.getRight(), l)\\n l.add(node)\\n return l\\nend\\n\\non levelOrder (me, node)\\n l = []\\n queue = [node]\\n repeat while queue.count\\n node = queue[1]\\n queue.deleteAt(1)\\n l.add(node)\\n if not voidP(node.getLeft()) then queue.add(node.getLeft())\\n if not voidP(node.getRight()) then queue.add(node.getRight())\\n end repeat\\n return l\\nend\\n\\n-- print utility function\\non serialize (me, l)\\n str = \\\"\\\"\\n repeat with node in l\\n put node.getValue()&\\\" \\\" after str\\n end repeat\\n delete the last char of str\\n return str\\nend\\n\",\n \"language\": \"Lingo\"\n },\n {\n \"code\": \"-- create the tree\\nl = []\\nrepeat with i = 1 to 10\\n l[i] = script(\\\"BinaryTreeNode\\\").new(i)\\nend repeat\\nl[6].setLeft (l[8])\\nl[6].setRight(l[9])\\nl[3].setLeft (l[6])\\nl[4].setLeft (l[7])\\nl[2].setLeft (l[4])\\nl[2].setRight(l[5])\\nl[1].setLeft (l[2])\\nl[1].setRight(l[3])\\n\\n-- print traversal results\\ntrav = script(\\\"BinaryTreeTraversal\\\")\\nput \\\"preorder: \\\" & trav.serialize(trav.preOrder(l[1]))\\nput \\\"inorder: \\\" & trav.serialize(trav.inOrder(l[1]))\\nput \\\"postorder: \\\" & trav.serialize(trav.postOrder(l[1]))\\nput \\\"level-order: \\\" & trav.serialize(trav.levelOrder(l[1]))\\n\",\n \"language\": \"Lingo\"\n },\n {\n \"code\": \"; nodes are [data left right], use \\\"first\\\" to get data\\n\\nto node.left :node\\n if empty? butfirst :node [output []]\\n output first butfirst :node\\nend\\nto node.right :node\\n if empty? butfirst :node [output []]\\n if empty? butfirst butfirst :node [output []]\\n output first butfirst butfirst :node\\nend\\nto max :a :b\\n output ifelse :a > :b [:a] [:b]\\nend\\nto tree.depth :tree\\n if empty? :tree [output 0]\\n output 1 + max tree.depth node.left :tree tree.depth node.right :tree\\nend\\n\\nto pre.order :tree :action\\n if empty? :tree [stop]\\n invoke :action first :tree\\n pre.order node.left :tree :action\\n pre.order node.right :tree :action\\nend\\nto in.order :tree :action\\n if empty? :tree [stop]\\n in.order node.left :tree :action\\n invoke :action first :tree\\n in.order node.right :tree :action\\nend\\nto post.order :tree :action\\n if empty? :tree [stop]\\n post.order node.left :tree :action\\n post.order node.right :tree :action\\n invoke :action first :tree\\nend\\nto at.depth :n :tree :action\\n if empty? :tree [stop]\\n ifelse :n = 1 [invoke :action first :tree] [\\n at.depth :n-1 node.left :tree :action\\n at.depth :n-1 node.right :tree :action\\n ]\\nend\\nto level.order :tree :action\\n for [i 1 [tree.depth :tree]] [at.depth :i :tree :action]\\nend\\n\\nmake \\\"tree [1 [2 [4 [7]]\\n [5]]\\n [3 [6 [8]\\n [9]]]]\\n\\n pre.order :tree [(type ? \\\"| |)] (print)\\n in.order :tree [(type ? \\\"| |)] (print)\\n post.order :tree [(type ? \\\"| |)] (print)\\nlevel.order :tree [(type ? \\\"| |)] (print)\\n\",\n \"language\": \"Logo\"\n },\n {\n \"code\": \":- object(tree_traversal).\\n\\n :- public(orders/1).\\n orders(Tree) :-\\n write('Pre-order: '), pre_order(Tree), nl,\\n write('In-order: '), in_order(Tree), nl,\\n write('Post-order: '), post_order(Tree), nl,\\n write('Level-order: '), level_order(Tree).\\n\\n :- public(orders/0).\\n orders :-\\n tree(Tree),\\n orders(Tree).\\n\\n tree(\\n t(1,\\n t(2,\\n t(4,\\n t(7, t, t),\\n t\\n ),\\n t(5, t, t)\\n ),\\n t(3,\\n t(6,\\n t(8, t, t),\\n t(9, t, t)\\n ),\\n t\\n )\\n )\\n ).\\n\\n pre_order(t).\\n pre_order(t(Value, Left, Right)) :-\\n write(Value), write(' '),\\n pre_order(Left),\\n pre_order(Right).\\n\\n in_order(t).\\n in_order(t(Value, Left, Right)) :-\\n in_order(Left),\\n write(Value), write(' '),\\n in_order(Right).\\n\\n post_order(t).\\n post_order(t(Value, Left, Right)) :-\\n post_order(Left),\\n post_order(Right),\\n write(Value), write(' ').\\n\\n level_order(t).\\n level_order(t(Value, Left, Right)) :-\\n % write tree root value\\n write(Value), write(' '),\\n % write rest of the tree\\n level_order([Left, Right], Tail-Tail).\\n\\n level_order([], Trees-[]) :-\\n ( Trees \\\\= [] ->\\n % print next level\\n level_order(Trees, Tail-Tail)\\n ; % no more levels\\n true\\n ).\\n level_order([Tree| Trees], Rest0) :-\\n ( Tree = t(Value, Left, Right) ->\\n write(Value), write(' '),\\n % collect the subtrees to print the next level\\n append(Rest0, [Left, Right| Tail]-Tail, Rest1),\\n % continue printing the current level\\n level_order(Trees, Rest1)\\n ; % continue printing the current level\\n level_order(Trees, Rest0)\\n ).\\n\\n % use difference-lists for constant time append\\n append(List1-Tail1, Tail1-Tail2, List1-Tail2).\\n\\n:- end_object.\\n\",\n \"language\": \"Logtalk\"\n },\n {\n \"code\": \"| ?- ?- tree_traversal::orders.\\nPre-order: 1 2 4 7 5 3 6 8 9\\nIn-order: 7 4 2 5 1 8 6 9 3\\nPost-order: 7 4 5 2 8 9 6 3 1\\nLevel-order: 1 2 3 4 5 6 7 8 9\\nyes\\n\",\n \"language\": \"Logtalk\"\n },\n {\n \"code\": \"local function depth_first(tr, a, b, c, flat_list)\\n\\tfor _, val in ipairs({a, b, c}) do\\n\\t\\tif type(tr[val]) == \\\"table\\\" then\\n\\t\\t\\tdepth_first(tr[val], a, b, c, flat_list)\\n\\t\\telseif type(tr[val]) ~= \\\"nil\\\" then\\n\\t\\t\\ttable.insert(flat_list, tr[val])\\n\\t\\tend -- if\\n\\tend -- for\\n\\treturn flat_list\\nend\\nlocal function flatten_pre_order(tr) return depth_first(tr, 1, 2, 3, {}) end\\nlocal function flatten_in_order(tr) return depth_first(tr, 2, 1, 3, {}) end\\nlocal function flatten_post_order(tr) return depth_first(tr, 2, 3, 1, {}) end\\n\\nlocal function flatten_level_order(tr)\\n local flat_list, queue = {}, {tr}\\n while next(queue) do -- while queue is not empty\\n local node = table.remove(queue, 1) -- dequeue\\n\\t\\t if type(node) == \\\"table\\\" then\\n\\t\\t\\t table.insert(flat_list, node[1])\\n\\t\\t\\t table.insert(queue, node[2]) -- enqueue\\n\\t\\t\\t table.insert(queue, node[3]) -- enqueue\\n\\t\\t else\\n\\t\\t\\t table.insert(flat_list, node)\\n\\t\\t end -- if\\n end -- while\\n return flat_list\\nend\\n\\n-- Example\\nlocal tree = {1, {2, {4, 7}, 5}, {3, {6, 8, 9}}}\\nprint(\\\"Pre order: \\\" .. table.concat(flatten_pre_order(tree), \\\" \\\"))\\nprint(\\\"In order: \\\" .. table.concat(flatten_in_order(tree), \\\" \\\"))\\nprint(\\\"Post order: \\\" .. table.concat(flatten_post_order(tree), \\\" \\\"))\\nprint(\\\"Level order: \\\" .. table.concat(flatten_level_order(tree), \\\" \\\"))\\n\",\n \"language\": \"Lua\"\n },\n {\n \"code\": \"Module CheckIt {\\n Null=(,)\\n Tree=((((Null,7,Null),4,Null),2,(Null,5,Null)),1,(((Null,8,Null),6,(Null,9,Null)),3,Null))\\n\\n Module preorder (T) {\\n Print \\\"preorder: \\\";\\n printtree(T)\\n Print\\n sub printtree(T)\\n Print T#val(1);\\\" \\\";\\n If len(T#val(0))>0 then printtree(T#val(0))\\n If len(T#val(2))>0 then printtree(T#val(2))\\n end sub\\n }\\n preorder Tree\\n\\n Module inorder (T) {\\n Print \\\"inorder: \\\";\\n printtree(T)\\n Print\\n sub printtree(T)\\n If len(T#val(0))>0 then printtree(T#val(0))\\n Print T#val(1);\\\" \\\";\\n If len(T#val(2))>0 then printtree(T#val(2))\\n end sub\\n }\\n inorder Tree\\n\\n Module postorder (T) {\\n Print \\\"postorder: \\\";\\n printtree(T)\\n Print\\n sub printtree(T)\\n If len(T#val(0))>0 then printtree(T#val(0))\\n If len(T#val(2))>0 then printtree(T#val(2))\\n Print T#val(1);\\\" \\\";\\n end sub\\n }\\n postorder Tree\\n\\n Module level_order (T) {\\n Print \\\"level-order: \\\";\\n Stack New {\\n printtree(T)\\n if empty then exit\\n Read T\\n Loop\\n }\\n Print\\n sub printtree(T)\\n If Len(T)>0 then\\n Print T#val(1);\\\" \\\";\\n Data T#val(0), T#val(2)\\n end if\\n end sub\\n }\\n level_order Tree\\n}\\nCheckIt\\n\",\n \"language\": \"M2000-Interpreter\"\n },\n {\n \"code\": \"Module OOP {\\n \\\\\\\\ Class is a global function (until this module end)\\n Class Null {\\n }\\n \\\\\\\\ Null is a pointer to an object returned from class Null()\\n Global Null->Null()\\n Class Node {\\n Public:\\n x, Group LeftNode, Group RightNode\\n Class:\\n \\\\\\\\ after class: anything exist one time,\\n \\\\\\\\ not included in final object\\n Module Node {\\n .LeftNode<=Null\\n .RightNode<=Null\\n Read .x\\n \\\\\\\\ read ? for optional values\\n Read ? .LeftNode, .RightNode\\n }\\n }\\n \\\\\\\\ NodeTree return a pointer to a new Node\\n Function NodeTree {\\n \\\\\\\\ ![] pass currrent stack to Node()\\n ->Node(![])\\n }\\n\\n Tree=NodeTree(1, NodeTree(2,NodeTree(4, NodeTree(7)), NodeTree(5)), NodeTree(3, NodeTree(6, NodeTree(8), NodeTree(9))))\\n\\n Module preorder (T) {\\n Print \\\"preorder: \\\";\\n printtree(T)\\n Print\\n sub printtree(T as pointer)\\n If T is Null then Exit sub\\n Print T=>x;\\\" \\\";\\n printtree(T=>LeftNode)\\n printtree(T=>RightNode)\\n end sub\\n }\\n preorder Tree\\n Module inorder (T) {\\n Print \\\"inorder: \\\";\\n printtree(T)\\n Print\\n sub printtree(T as pointer)\\n If T is Null then Exit sub\\n printtree(T=>LeftNode)\\n Print T=>x;\\\" \\\";\\n printtree(T=>RightNode)\\n end sub\\n }\\n inorder Tree\\n Module postorder (T) {\\n Print \\\"postorder: \\\";\\n printtree(T)\\n Print\\n sub printtree(T as pointer)\\n If T is Null then Exit sub\\n printtree(T=>LeftNode)\\n printtree(T=>RightNode)\\n Print T=>x;\\\" \\\";\\n end sub\\n }\\n postorder Tree\\n Module level_order (T) {\\n Print \\\"level-order: \\\";\\n Stack New {\\n printtree(T)\\n if empty then exit\\n Read T\\n Loop\\n }\\n Print\\n sub printtree(T as pointer)\\n If T is Null else\\n Print T=>x;\\\" \\\";\\n Data T=>LeftNode, T=>RightNode\\n end if\\n end sub\\n }\\n level_order Tree\\n}\\nOOP\\n\",\n \"language\": \"M2000-Interpreter\"\n },\n {\n \"code\": \"Module OOP {\\n \\\\\\\\ Class is a global function (until this module end)\\n Class Null {\\n }\\n \\\\\\\\ Null is a pointer to an object returned from class Null()\\n Global Null->Null()\\n Class Node {\\n Public:\\n x, Group LeftNode, Group RightNode\\n Module preorder (visitor){\\n T->This\\n printtree(T)\\n sub printtree(T as pointer)\\n If T is Null then Exit sub\\n call visitor(T=>x)\\n printtree(T=>LeftNode)\\n printtree(T=>RightNode)\\n end sub\\n }\\n Module inorder (visitor){\\n T->This\\n printtree(T)\\n sub printtree(T as pointer)\\n If T is Null then Exit sub\\n printtree(T=>LeftNode)\\n call visitor(T=>x)\\n printtree(T=>RightNode)\\n end sub\\n }\\n Module postorder (visitor) {\\n T->This\\n printtree(T)\\n sub printtree(T as pointer)\\n If T is Null then Exit sub\\n printtree(T=>LeftNode)\\n printtree(T=>RightNode)\\n call visitor(T=>x)\\n end sub\\n }\\n Module level_order (visitor){\\n T->This\\n Stack New {\\n printtree(T)\\n if empty then exit\\n Read T\\n Loop\\n }\\n sub printtree(T as pointer)\\n If T is Null else\\n call visitor(T=>x)\\n Data T=>LeftNode, T=>RightNode\\n end if\\n end sub\\n }\\n Class:\\n \\\\\\\\ after class: anything exist one time,\\n \\\\\\\\ not included in final object\\n Module Node {\\n .LeftNode<=Null\\n .RightNode<=Null\\n Read .x\\n \\\\\\\\ read ? for optional values\\n Read ? .LeftNode, .RightNode\\n }\\n }\\n \\\\\\\\ NodeTree return a pointer to a new Node\\n Function NodeTree {\\n \\\\\\\\ ![] pass currrent stack to Node()\\n ->Node(![])\\n }\\n\\n Tree=NodeTree(1, NodeTree(2,NodeTree(4, NodeTree(7)), NodeTree(5)), NodeTree(3, NodeTree(6, NodeTree(8), NodeTree(9))))\\n\\n printnum=lambda (title$) -> {\\n Print\\n Print title$;\\n =lambda (x)-> {\\n Print x;\\\" \\\";\\n }\\n }\\n Tree=>preorder printnum(\\\"preorder: \\\")\\n Tree=>inorder printnum(\\\"inorder: \\\")\\n Tree=>postorder printnum(\\\"postorder: \\\")\\n Tree=>level_order printnum(\\\"level-order: \\\")\\n}\\nOOP\\n\",\n \"language\": \"M2000-Interpreter\"\n },\n {\n \"code\": \"Module OOP {\\n \\\\\\\\ Class is a global function (until this module end)\\n Class Null {\\n }\\n \\\\\\\\ Null is a pointer to an object returned from class Null()\\n Global Null->Null()\\n Class Node {\\n Public:\\n x, Group LeftNode, Group RightNode\\n Module preorder (visitor){\\n T->This\\n printtree(T)\\n sub printtree(T as pointer)\\n If T is Null then Exit sub\\n call event visitor, T=>x\\n printtree(T=>LeftNode)\\n printtree(T=>RightNode)\\n end sub\\n }\\n Module inorder (visitor){\\n T->This\\n printtree(T)\\n sub printtree(T as pointer)\\n If T is Null then Exit sub\\n printtree(T=>LeftNode)\\n call event visitor, T=>x\\n printtree(T=>RightNode)\\n end sub\\n }\\n Module postorder (visitor) {\\n T->This\\n printtree(T)\\n sub printtree(T as pointer)\\n If T is Null then Exit sub\\n printtree(T=>LeftNode)\\n printtree(T=>RightNode)\\n call event visitor, T=>x\\n end sub\\n }\\n Module level_order (visitor){\\n T->This\\n Stack New {\\n printtree(T)\\n if empty then exit\\n Read T\\n Loop\\n }\\n sub printtree(T as pointer)\\n If T is Null else\\n call event visitor, T=>x\\n Data T=>LeftNode, T=>RightNode\\n end if\\n end sub\\n }\\n Class:\\n \\\\\\\\ after class: anything exist one time,\\n \\\\\\\\ not included in final object\\n Module Node {\\n .LeftNode<=Null\\n .RightNode<=Null\\n Read .x\\n \\\\\\\\ read ? for optional values\\n Read ? .LeftNode, .RightNode\\n }\\n }\\n \\\\\\\\ NodeTree return a pointer to a new Node\\n Function NodeTree {\\n \\\\\\\\ ![] pass currrent stack to Node()\\n ->Node(![])\\n }\\n\\n Tree=NodeTree(1, NodeTree(2,NodeTree(4, NodeTree(7)), NodeTree(5)), NodeTree(3, NodeTree(6, NodeTree(8), NodeTree(9))))\\n Event PrintAnum {\\n read x\\n }\\n Function PrintThis(x) {\\n Print x;\\\" \\\";\\n }\\n Event PrintAnum New PrintThis()\\n printnum=lambda PrintAnum (title$) -> {\\n Print\\n Print title$;\\n =PrintAnum\\n }\\n Tree=>preorder printnum(\\\"preorder: \\\")\\n Tree=>inorder printnum(\\\"inorder: \\\")\\n Tree=>postorder printnum(\\\"postorder: \\\")\\n Tree=>level_order printnum(\\\"level-order: \\\")\\n}\\nOOP\\n\",\n \"language\": \"M2000-Interpreter\"\n },\n {\n \"code\": \"preorder[a_Integer] := a;\\npreorder[a_[b__]] := Flatten@{a, preorder /@ {b}};\\ninorder[a_Integer] := a;\\ninorder[a_[b_, c_]] := Flatten@{inorder@b, a, inorder@c};\\ninorder[a_[b_]] := Flatten@{inorder@b, a}; postorder[a_Integer] := a;\\npostorder[a_[b__]] := Flatten@{postorder /@ {b}, a};\\nlevelorder[a_] :=\\n Flatten[Table[Level[a, {n}], {n, 0, Depth@a}]] /. {b_Integer[__] :>\\n b};\\n\",\n \"language\": \"Mathematica\"\n },\n {\n \"code\": \"preorder[1[2[4[7], 5], 3[6[8, 9]]]]\\ninorder[1[2[4[7], 5], 3[6[8, 9]]]]\\npostorder[1[2[4[7], 5], 3[6[8, 9]]]]\\nlevelorder[1[2[4[7], 5], 3[6[8, 9]]]]\\n\",\n \"language\": \"Mathematica\"\n },\n {\n \"code\": \":- module tree_traversal.\\n:- interface.\\n\\n:- import_module io.\\n\\n:- pred main(io::di, io::uo) is det.\\n\\n:- implementation.\\n\\n:- import_module list.\\n\\n:- type tree(V)\\n ---> empty\\n ; node(V, tree(V), tree(V)).\\n\\n:- pred preorder(pred(V, A, A), tree(V), A, A).\\n:- mode preorder(pred(in, di, uo) is det, in, di, uo) is det.\\n\\npreorder(_, empty, !Acc).\\npreorder(P, node(Value, Left, Right), !Acc) :-\\n P(Value, !Acc),\\n preorder(P, Left, !Acc),\\n preorder(P, Right, !Acc).\\n\\n:- pred inorder(pred(V, A, A), tree(V), A, A).\\n:- mode inorder(pred(in, di, uo) is det, in, di, uo) is det.\\n\\ninorder(_, empty, !Acc).\\ninorder(P, node(Value, Left, Right), !Acc) :-\\n inorder(P, Left, !Acc),\\n P(Value, !Acc),\\n inorder(P, Right, !Acc).\\n\\n:- pred postorder(pred(V, A, A), tree(V), A, A).\\n:- mode postorder(pred(in, di, uo) is det, in, di, uo) is det.\\n\\npostorder(_, empty, !Acc).\\npostorder(P, node(Value, Left, Right), !Acc) :-\\n postorder(P, Left, !Acc),\\n postorder(P, Right, !Acc),\\n P(Value, !Acc).\\n\\n:- pred levelorder(pred(V, A, A), tree(V), A, A).\\n:- mode levelorder(pred(in, di, uo) is det, in, di, uo) is det.\\n\\nlevelorder(P, Tree, !Acc) :-\\n do_levelorder(P, [Tree], !Acc).\\n\\n:- pred do_levelorder(pred(V, A, A), list(tree(V)), A, A).\\n:- mode do_levelorder(pred(in, di, uo) is det, in, di, uo) is det.\\n\\ndo_levelorder(_, [], !Acc).\\ndo_levelorder(P, [empty | Xs], !Acc) :-\\n do_levelorder(P, Xs, !Acc).\\ndo_levelorder(P, [node(Value, Left, Right) | Xs], !Acc) :-\\n P(Value, !Acc),\\n do_levelorder(P, Xs ++ [Left, Right], !Acc).\\n\\n:- func tree = tree(int).\\n\\ntree =\\n node(1,\\n node(2,\\n node(4,\\n node(7, empty, empty),\\n empty\\n ),\\n node(5, empty, empty)\\n ),\\n node(3,\\n node(6,\\n node(8, empty, empty),\\n node(9, empty, empty)\\n ),\\n empty\\n )\\n ).\\n\\nmain(!IO) :-\\n io.write_string(\\\"preorder: \\\" ,!IO),\\n preorder(print_value, tree, !IO), io.nl(!IO),\\n io.write_string(\\\"inorder: \\\" ,!IO),\\n inorder(print_value, tree, !IO), io.nl(!IO),\\n io.write_string(\\\"postorder: \\\" ,!IO),\\n postorder(print_value, tree, !IO), io.nl(!IO),\\n io.write_string(\\\"levelorder: \\\" ,!IO),\\n levelorder(print_value, tree, !IO), io.nl(!IO).\\n\\n:- pred print_value(V::in, io::di, io::uo) is det.\\n\\nprint_value(V, !IO) :-\\n io.print(V, !IO),\\n io.write_string(\\\" \\\", !IO).\\n\",\n \"language\": \"Mercury\"\n },\n {\n \"code\": \"main :: [sys_message]\\nmain = [Stdout (lay [show (f example)\\n | f <- [preorder,inorder,postorder,levelorder]])]\\n\\nexample :: tree num\\nexample = Node 1 (Node 2 (Node 4 (leaf 7) Nilt)\\n (leaf 5))\\n (Node 3 (Node 6 (leaf 8) (leaf 9)) Nilt)\\n\\ntree * ::= Nilt | Node * (tree *) (tree *)\\n\\nleaf :: *->tree *\\nleaf k = Node k Nilt Nilt\\n\\npreorder :: tree *->[*]\\npreorder Nilt = []\\npreorder (Node v l r) = v : preorder l ++ preorder r\\n\\ninorder :: tree *->[*]\\ninorder Nilt = []\\ninorder (Node v l r) = inorder l ++ v : inorder r\\n\\npostorder :: tree *->[*]\\npostorder Nilt = []\\npostorder (Node v l r) = postorder l ++ postorder r ++ [v]\\n\\nlevelorder :: tree *->[*]\\nlevelorder t = f [t]\\n where f [] = []\\n f (Nilt:xs) = f xs\\n f (Node v l r:xs) = v : f (xs++[l,r])\\n\",\n \"language\": \"Miranda\"\n },\n {\n \"code\": \"import deques\\n\\ntype\\n Node[T] = ref object\\n data: T\\n left, right: Node[T]\\n\\nproc newNode[T](data: T; left, right: Node[T] = nil): Node[T] =\\n Node[T](data: data, left: left, right: right)\\n\\nproc preorder[T](n: Node[T]): seq[T] =\\n if n.isNil: @[]\\n else: @[n.data] & preorder(n.left) & preorder(n.right)\\n\\nproc inorder[T](n: Node[T]): seq[T] =\\n if n.isNil: @[]\\n else: inorder(n.left) & @[n.data] & inorder(n.right)\\n\\nproc postorder[T](n: Node[T]): seq[T] =\\n if n.isNil: @[]\\n else: postorder(n.left) & postorder(n.right) & @[n.data]\\n\\nproc levelorder[T](n: Node[T]): seq[T] =\\n var queue: Deque[Node[T]]\\n queue.addLast(n)\\n while queue.len > 0:\\n let next = queue.popFirst()\\n result.add next.data\\n if not next.left.isNil: queue.addLast(next.left)\\n if not next.right.isNil: queue.addLast(next.right)\\n\\nlet tree = 1.newNode(\\n 2.newNode(\\n 4.newNode(\\n 7.newNode),\\n 5.newNode),\\n 3.newNode(\\n 6.newNode(\\n 8.newNode,\\n 9.newNode)))\\n\\necho preorder tree\\necho inorder tree\\necho postorder tree\\necho levelorder tree\\n\",\n \"language\": \"Nim\"\n },\n {\n \"code\": \"??use Collection;\\n\\nclass Test {\\n function : Main(args : String[]) ~ Nil {\\n one := Node->New(1);\\n two := Node->New(2);\\n three := Node->New(3);\\n four := Node->New(4);\\n five := Node->New(5);\\n six := Node->New(6);\\n seven := Node->New(7);\\n eight := Node->New(8);\\n nine := Node->New(9);\\n\\n one->SetLeft(two); one->SetRight(three);\\n two->SetLeft(four); two->SetRight(five);\\n three->SetLeft(six); four->SetLeft(seven);\\n six->SetLeft(eight); six->SetRight(nine);\\n\\n \\\"Preorder: \\\"->Print(); Preorder(one);\\n \\\"\\\\nInorder: \\\"->Print(); Inorder(one);\\n \\\"\\\\nPostorder: \\\"->Print(); Postorder(one);\\n \\\"\\\\nLevelorder: \\\"->Print(); Levelorder(one);\\n \\\"\\\\n\\\"->Print();\\n }\\n\\n function : Preorder(node : Node) ~ Nil {\\n if(node <> Nil) {\\n System.IO.Console->Print(node->GetData())->Print(\\\", \\\");\\n Preorder(node->GetLeft());\\n Preorder(node->GetRight());\\n };\\n }\\n\\n function : Inorder(node : Node) ~ Nil {\\n if(node <> Nil) {\\n Inorder(node->GetLeft());\\n System.IO.Console->Print(node->GetData())->Print(\\\", \\\");\\n Inorder(node->GetRight());\\n };\\n }\\n\\n function : Postorder(node : Node) ~ Nil {\\n if(node <> Nil) {\\n Postorder(node->GetLeft());\\n Postorder(node->GetRight());\\n System.IO.Console->Print(node->GetData())->Print(\\\", \\\");\\n };\\n }\\n\\n function : Levelorder(node : Node) ~ Nil {\\n nodequeue := Collection.Queue->New();\\n if(node <> Nil) {\\n nodequeue->Add(node);\\n };\\n\\n while(nodequeue->IsEmpty() = false) {\\n next := nodequeue->Remove()->As(Node);\\n System.IO.Console->Print(next->GetData())->Print(\\\", \\\");\\n if(next->GetLeft() <> Nil) {\\n nodequeue->Add(next->GetLeft());\\n };\\n\\n if(next->GetRight() <> Nil) {\\n nodequeue->Add(next->GetRight());\\n };\\n };\\n }\\n}\\n\\nclass Node from BasicCompare {\\n @left : Node;\\n @right : Node;\\n @data : Int;\\n\\n New(data : Int) {\\n Parent();\\n @data := data;\\n }\\n\\n method : public : GetData() ~ Int {\\n return @data;\\n }\\n\\n method : public : SetLeft(left : Node) ~ Nil {\\n @left := left;\\n }\\n\\n method : public : GetLeft() ~ Node {\\n return @left;\\n }\\n\\n method : public : SetRight(right : Node) ~ Nil {\\n @right := right;\\n }\\n\\n method : public : GetRight() ~ Node {\\n return @right;\\n }\\n\\n method : public : Compare(rhs : Compare) ~ Int {\\n right : Node := rhs->As(Node);\\n if(@data = right->GetData()) {\\n return 0;\\n }\\n else if(@data < right->GetData()) {\\n return -1;\\n };\\n\\n return 1;\\n }\\n}\\n\",\n \"language\": \"Objeck\"\n },\n {\n \"code\": \"type 'a tree = Empty\\n | Node of 'a * 'a tree * 'a tree\\n\\nlet rec preorder f = function\\n Empty -> ()\\n | Node (v,l,r) -> f v;\\n preorder f l;\\n preorder f r\\n\\nlet rec inorder f = function\\n Empty -> ()\\n | Node (v,l,r) -> inorder f l;\\n f v;\\n inorder f r\\n\\nlet rec postorder f = function\\n Empty -> ()\\n | Node (v,l,r) -> postorder f l;\\n postorder f r;\\n f v\\n\\nlet levelorder f x =\\n let queue = Queue.create () in\\n Queue.add x queue;\\n while not (Queue.is_empty queue) do\\n match Queue.take queue with\\n Empty -> ()\\n | Node (v,l,r) -> f v;\\n Queue.add l queue;\\n Queue.add r queue\\n done\\n\\nlet tree =\\n Node (1,\\n Node (2,\\n Node (4,\\n Node (7, Empty, Empty),\\n Empty),\\n Node (5, Empty, Empty)),\\n Node (3,\\n Node (6,\\n Node (8, Empty, Empty),\\n Node (9, Empty, Empty)),\\n Empty))\\n\\nlet () =\\n preorder (Printf.printf \\\"%d \\\") tree; print_newline ();\\n inorder (Printf.printf \\\"%d \\\") tree; print_newline ();\\n postorder (Printf.printf \\\"%d \\\") tree; print_newline ();\\n levelorder (Printf.printf \\\"%d \\\") tree; print_newline ()\\n\",\n \"language\": \"OCaml\"\n },\n {\n \"code\": \"Object Class new: Tree(v, l, r)\\n\\nTree method: initialize(v, l, r) v := v l := l r := r ;\\nTree method: v @v ;\\nTree method: l @l ;\\nTree method: r @r ;\\n\\nTree method: preOrder(f)\\n @v f perform\\n @l ifNotNull: [ @l preOrder(f) ]\\n @r ifNotNull: [ @r preOrder(f) ] ;\\n\\nTree method: inOrder(f)\\n @l ifNotNull: [ @l inOrder(f) ]\\n @v f perform\\n @r ifNotNull: [ @r inOrder(f) ] ;\\n\\nTree method: postOrder(f)\\n @l ifNotNull: [ @l postOrder(f) ]\\n @r ifNotNull: [ @r postOrder(f) ]\\n @v f perform ;\\n\\nTree method: levelOrder(f)\\n| c n |\\n Channel new self over send drop ->c\\n while(c notEmpty) [\\n c receive ->n\\n n v f perform\\n n l dup ifNotNull: [ c send ] drop\\n n r dup ifNotNull: [ c send ] drop\\n ] ;\\n\",\n \"language\": \"Oforth\"\n },\n {\n \"code\": \" one = .Node~new(1);\\n two = .Node~new(2);\\n three = .Node~new(3);\\n four = .Node~new(4);\\n five = .Node~new(5);\\n six = .Node~new(6);\\n seven = .Node~new(7);\\n eight = .Node~new(8);\\n nine = .Node~new(9);\\n\\n one~left = two\\n one~right = three\\n two~left = four\\n two~right = five\\n three~left = six\\n four~left = seven\\n six~left = eight\\n six~right = nine\\n\\n out = .array~new\\n .treetraverser~preorder(one, out);\\n say \\\"Preorder: \\\" out~toString(\\\"l\\\", \\\", \\\")\\n out~empty\\n .treetraverser~inorder(one, out);\\n say \\\"Inorder: \\\" out~toString(\\\"l\\\", \\\", \\\")\\n out~empty\\n .treetraverser~postorder(one, out);\\n say \\\"Postorder: \\\" out~toString(\\\"l\\\", \\\", \\\")\\n out~empty\\n .treetraverser~levelorder(one, out);\\n say \\\"Levelorder:\\\" out~toString(\\\"l\\\", \\\", \\\")\\n\\n\\n::class node\\n::method init\\n expose left right data\\n use strict arg data\\n left = .nil\\n right = .nil\\n\\n::attribute left\\n::attribute right\\n::attribute data\\n\\n::class treeTraverser\\n::method preorder class\\n use arg node, out\\n if node \\\\== .nil then do\\n out~append(node~data)\\n self~preorder(node~left, out)\\n self~preorder(node~right, out)\\n end\\n\\n::method inorder class\\n use arg node, out\\n if node \\\\== .nil then do\\n self~inorder(node~left, out)\\n out~append(node~data)\\n self~inorder(node~right, out)\\n end\\n\\n::method postorder class\\n use arg node, out\\n if node \\\\== .nil then do\\n self~postorder(node~left, out)\\n self~postorder(node~right, out)\\n out~append(node~data)\\n end\\n\\n::method levelorder class\\n use arg node, out\\n\\n if node == .nil then return\\n nodequeue = .queue~new\\n nodequeue~queue(node)\\n loop while \\\\nodequeue~isEmpty\\n next = nodequeue~pull\\n out~append(next~data)\\n if next~left \\\\= .nil then\\n nodequeue~queue(next~left)\\n if next~right \\\\= .nil then\\n nodequeue~queue(next~right)\\n end\\n\",\n \"language\": \"OoRexx\"\n },\n {\n \"code\": \"declare\\n Tree = n(1\\n n(2\\n n(4 n(7 e e) e)\\n n(5 e e))\\n n(3\\n n(6 n(8 e e) n(9 e e))\\n e))\\n\\n fun {Concat Xs}\\n {FoldR Xs Append nil}\\n end\\n\\n fun {Preorder T}\\n case T of e then nil\\n [] n(V L R) then\\n {Concat [[V]\\n {Preorder L}\\n {Preorder R}]}\\n end\\n end\\n\\n fun {Inorder T}\\n case T of e then nil\\n [] n(V L R) then\\n {Concat [{Inorder L}\\n [V]\\n {Inorder R}]}\\n end\\n end\\n\\n fun {Postorder T}\\n case T of e then nil\\n [] n(V L R) then\\n {Concat [{Postorder L}\\n {Postorder R}\\n [V]]}\\n end\\n end\\n\\n local\\n fun {Collect Queue}\\n case Queue of nil then nil\\n [] e|Xr then {Collect Xr}\\n [] n(V L R)|Xr then\\n V|{Collect {Append Xr [L R]}}\\n end\\n end\\n in\\n fun {Levelorder T}\\n {Collect [T]}\\n end\\n end\\nin\\n {Show {Preorder Tree}}\\n {Show {Inorder Tree}}\\n {Show {Postorder Tree}}\\n {Show {Levelorder Tree}}\\n\",\n \"language\": \"Oz\"\n },\n {\n \"code\": \"sub preorder\\n{\\n\\tmy $t = shift or return ();\\n\\treturn ($t->[0], preorder($t->[1]), preorder($t->[2]));\\n}\\n\\nsub inorder\\n{\\n\\tmy $t = shift or return ();\\n\\treturn (inorder($t->[1]), $t->[0], inorder($t->[2]));\\n}\\n\\nsub postorder\\n{\\n\\tmy $t = shift or return ();\\n\\treturn (postorder($t->[1]), postorder($t->[2]), $t->[0]);\\n}\\n\\nsub depth\\n{\\n\\tmy @ret;\\n\\tmy @a = ($_[0]);\\n\\twhile (@a) {\\n\\t\\tmy $v = shift @a or next;\\n\\t\\tpush @ret, $v->[0];\\n\\t\\tpush @a, @{$v}[1,2];\\n\\t}\\n\\treturn @ret;\\n}\\n\\nmy $x = [1,[2,[4,[7]],[5]],[3,[6,[8],[9]]]];\\n\\nprint \\\"pre: @{[preorder($x)]}\\\\n\\\";\\nprint \\\"in: @{[inorder($x)]}\\\\n\\\";\\nprint \\\"post: @{[postorder($x)]}\\\\n\\\";\\nprint \\\"depth: @{[depth($x)]}\\\\n\\\";\\n\",\n \"language\": \"Perl\"\n },\n {\n \"code\": \"-->\\n <span style=\\\"color: #008080;\\\">constant</span> <span style=\\\"color: #000000;\\\">VALUE</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">LEFT</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">2</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">RIGHT</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">3</span>\\n\\n <span style=\\\"color: #008080;\\\">constant</span> <span style=\\\"color: #000000;\\\">tree</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: #0000FF;\\\">{</span><span style=\\\"color: #000000;\\\">2</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: #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;\\\">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;\\\">5</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;\\\">3</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: #0000FF;\\\">{</span><span style=\\\"color: #000000;\\\">8</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;\\\">9</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: #000000;\\\">0</span><span style=\\\"color: #0000FF;\\\">}}</span>\\n\\n <span style=\\\"color: #008080;\\\">procedure</span> <span style=\\\"color: #000000;\\\">preorder</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #004080;\\\">object</span> <span style=\\\"color: #000000;\\\">tree</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;\\\">tree</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;\\\">\\\"%d \\\"</span><span style=\\\"color: #0000FF;\\\">,{</span><span style=\\\"color: #000000;\\\">tree</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">VALUE</span><span style=\\\"color: #0000FF;\\\">]})</span>\\n <span style=\\\"color: #000000;\\\">preorder</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">tree</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">LEFT</span><span style=\\\"color: #0000FF;\\\">])</span>\\n <span style=\\\"color: #000000;\\\">preorder</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">tree</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">RIGHT</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;\\\">procedure</span>\\n\\n <span style=\\\"color: #008080;\\\">procedure</span> <span style=\\\"color: #000000;\\\">inorder</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #004080;\\\">object</span> <span style=\\\"color: #000000;\\\">tree</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;\\\">tree</span><span style=\\\"color: #0000FF;\\\">)</span> <span style=\\\"color: #008080;\\\">then</span>\\n <span style=\\\"color: #000000;\\\">inorder</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">tree</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">LEFT</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;\\\">\\\"%d \\\"</span><span style=\\\"color: #0000FF;\\\">,{</span><span style=\\\"color: #000000;\\\">tree</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">VALUE</span><span style=\\\"color: #0000FF;\\\">]})</span>\\n <span style=\\\"color: #000000;\\\">inorder</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">tree</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">RIGHT</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;\\\">procedure</span>\\n\\n <span style=\\\"color: #008080;\\\">procedure</span> <span style=\\\"color: #000000;\\\">postorder</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #004080;\\\">object</span> <span style=\\\"color: #000000;\\\">tree</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;\\\">tree</span><span style=\\\"color: #0000FF;\\\">)</span> <span style=\\\"color: #008080;\\\">then</span>\\n <span style=\\\"color: #000000;\\\">postorder</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">tree</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">LEFT</span><span style=\\\"color: #0000FF;\\\">])</span>\\n <span style=\\\"color: #000000;\\\">postorder</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">tree</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">RIGHT</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;\\\">\\\"%d \\\"</span><span style=\\\"color: #0000FF;\\\">,{</span><span style=\\\"color: #000000;\\\">tree</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">VALUE</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;\\\">procedure</span>\\n\\n <span style=\\\"color: #008080;\\\">procedure</span> <span style=\\\"color: #000000;\\\">level_order</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #004080;\\\">object</span> <span style=\\\"color: #000000;\\\">tree</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #004080;\\\">sequence</span> <span style=\\\"color: #000000;\\\">more</span> <span style=\\\"color: #0000FF;\\\">=</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;\\\">tree</span><span style=\\\"color: #0000FF;\\\">)</span> <span style=\\\"color: #008080;\\\">then</span>\\n <span style=\\\"color: #000000;\\\">more</span> <span style=\\\"color: #0000FF;\\\">&=</span> <span style=\\\"color: #0000FF;\\\">{</span><span style=\\\"color: #000000;\\\">tree</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">LEFT</span><span style=\\\"color: #0000FF;\\\">],</span><span style=\\\"color: #000000;\\\">tree</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">RIGHT</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;\\\">\\\"%d \\\"</span><span style=\\\"color: #0000FF;\\\">,{</span><span style=\\\"color: #000000;\\\">tree</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">VALUE</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;\\\">more</span><span style=\\\"color: #0000FF;\\\">)</span> <span style=\\\"color: #0000FF;\\\">></span> <span style=\\\"color: #000000;\\\">0</span> <span style=\\\"color: #008080;\\\">then</span>\\n <span style=\\\"color: #000000;\\\">level_order</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">more</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">],</span><span style=\\\"color: #000000;\\\">more</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;\\\">end</span> <span style=\\\"color: #008080;\\\">procedure</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 preorder: \\\"</span><span style=\\\"color: #0000FF;\\\">)</span> <span style=\\\"color: #000000;\\\">preorder</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">tree</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;\\\">\\\"\\\\n inorder: \\\"</span><span style=\\\"color: #0000FF;\\\">)</span> <span style=\\\"color: #000000;\\\">inorder</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">tree</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;\\\">\\\"\\\\n postorder: \\\"</span><span style=\\\"color: #0000FF;\\\">)</span> <span style=\\\"color: #000000;\\\">postorder</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">tree</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;\\\">\\\"\\\\n level-order: \\\"</span><span style=\\\"color: #0000FF;\\\">)</span> <span style=\\\"color: #000000;\\\">level_order</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">tree</span><span style=\\\"color: #0000FF;\\\">)</span>\\n<!--\\n\",\n \"language\": \"Phix\"\n },\n {\n \"code\": \"class Node {\\n private $left;\\n private $right;\\n private $value;\\n\\n function __construct($value) {\\n $this->value = $value;\\n }\\n\\n public function getLeft() {\\n return $this->left;\\n }\\n public function getRight() {\\n return $this->right;\\n }\\n public function getValue() {\\n return $this->value;\\n }\\n\\n public function setLeft($value) {\\n $this->left = $value;\\n }\\n public function setRight($value) {\\n $this->right = $value;\\n }\\n public function setValue($value) {\\n $this->value = $value;\\n }\\n}\\n\\nclass TreeTraversal {\\n\\n public function preOrder(Node $n) {\\n echo $n->getValue() . \\\" \\\";\\n if($n->getLeft() != null) {\\n $this->preOrder($n->getLeft());\\n }\\n if($n->getRight() != null){\\n $this->preOrder($n->getRight());\\n }\\n }\\n\\n public function inOrder(Node $n) {\\n if($n->getLeft() != null) {\\n $this->inOrder($n->getLeft());\\n }\\n echo $n->getValue() . \\\" \\\";\\n if($n->getRight() != null){\\n $this->inOrder($n->getRight());\\n }\\n\\n }\\n\\n public function postOrder(Node $n) {\\n if($n->getLeft() != null) {\\n $this->postOrder($n->getLeft());\\n }\\n if($n->getRight() != null){\\n $this->postOrder($n->getRight());\\n }\\n echo $n->getValue() . \\\" \\\";\\n }\\n\\n public function levelOrder($arg) {\\n $q[] = $arg;\\n while (!empty($q)) {\\n $n = array_shift($q);\\n echo $n->getValue() . \\\" \\\";\\n if($n->getLeft() != null) {\\n $q[] = $n->getLeft();\\n }\\n if($n->getRight() != null){\\n $q[] = $n->getRight();\\n }\\n }\\n }\\n}\\n\\n$arr = [];\\nfor ($i=1; $i < 10; $i++) {\\n $arr[$i] = new Node($i);\\n}\\n\\n$arr[6]->setLeft($arr[8]);\\n$arr[6]->setRight($arr[9]);\\n$arr[3]->setLeft($arr[6]);\\n$arr[4]->setLeft($arr[7]);\\n$arr[2]->setLeft($arr[4]);\\n$arr[2]->setRight($arr[5]);\\n$arr[1]->setLeft($arr[2]);\\n$arr[1]->setRight($arr[3]);\\n\\n$tree = new TreeTraversal($arr);\\n\\necho \\\"preorder:\\\\t\\\";\\n$tree->preOrder($arr[1]);\\necho \\\"\\\\ninorder:\\\\t\\\";\\n$tree->inOrder($arr[1]);\\necho \\\"\\\\npostorder:\\\\t\\\";\\n$tree->postOrder($arr[1]);\\necho \\\"\\\\nlevel-order:\\\\t\\\";\\n$tree->levelOrder($arr[1]);\\n\",\n \"language\": \"PHP\"\n },\n {\n \"code\": \"(de preorder (Node Fun)\\n (when Node\\n (Fun (car Node))\\n (preorder (cadr Node) Fun)\\n (preorder (caddr Node) Fun) ) )\\n\\n(de inorder (Node Fun)\\n (when Node\\n (inorder (cadr Node) Fun)\\n (Fun (car Node))\\n (inorder (caddr Node) Fun) ) )\\n\\n(de postorder (Node Fun)\\n (when Node\\n (postorder (cadr Node) Fun)\\n (postorder (caddr Node) Fun)\\n (Fun (car Node)) ) )\\n\\n(de level-order (Node Fun)\\n (for (Q (circ Node) Q)\\n (let N (fifo 'Q)\\n (Fun (car N))\\n (and (cadr N) (fifo 'Q @))\\n (and (caddr N) (fifo 'Q @)) ) ) )\\n\\n(setq *Tree\\n (1\\n (2 (4 (7)) (5))\\n (3 (6 (8) (9))) ) )\\n\\n(for Order '(preorder inorder postorder level-order)\\n (prin (align -13 (pack Order \\\":\\\")))\\n (Order *Tree printsp)\\n (prinl) )\\n\",\n \"language\": \"PicoLisp\"\n },\n {\n \"code\": \"tree :-\\n\\tTree= [1,\\n\\t [2,\\n\\t\\t [4,\\n\\t\\t [7, nil, nil],\\n\\t\\t nil],\\n\\t\\t [5, nil, nil]],\\n\\t [3,\\n\\t\\t [6,\\n\\t\\t [8, nil, nil],\\n\\t\\t [9,nil, nil]],\\n\\t\\t nil]],\\n\\t\\n\\twrite('preorder : '), preorder(Tree), nl,\\n\\twrite('inorder : '), inorder(Tree), nl,\\n\\twrite('postorder : '), postorder(Tree), nl,\\n\\twrite('level-order : '), level_order([Tree]).\\n\\npreorder(nil).\\npreorder([Node, FG, FD]) :-\\n\\tformat('~w ', [Node]),\\n\\tpreorder(FG),\\n\\tpreorder(FD).\\n\\n\\ninorder(nil).\\ninorder([Node, FG, FD]) :-\\n\\tinorder(FG),\\n\\tformat('~w ', [Node]),\\n\\tinorder(FD).\\n\\npostorder(nil).\\npostorder([Node, FG, FD]) :-\\n\\tpostorder(FG),\\n\\tpostorder(FD),\\n\\tformat('~w ', [Node]).\\n\\n\\nlevel_order([]).\\n\\nlevel_order(A) :-\\n\\tlevel_order_(A, U-U, S),\\n\\tlevel_order(S).\\n\\nlevel_order_([], S-[],S).\\n\\nlevel_order_([[Node, FG, FD] | T], CS, FS) :-\\n\\tformat('~w ', [Node]),\\n\\tappend_dl(CS, [FG, FD|U]-U, CS1),\\n\\tlevel_order_(T, CS1, FS).\\n\\nlevel_order_([nil | T], CS, FS) :-\\n\\tlevel_order_(T, CS, FS).\\n\\n\\nappend_dl(X-Y, Y-Z, X-Z).\\n\",\n \"language\": \"Prolog\"\n },\n {\n \"code\": \"Structure node\\n value.i\\n *left.node\\n *right.node\\nEndStructure\\n\\nStructure queue\\n List q.i()\\nEndStructure\\n\\nDataSection\\n tree:\\n Data.s \\\"1(2(4(7),5),3(6(8,9)))\\\"\\nEndDataSection\\n\\n;Convenient routine to interpret string data to construct a tree of integers.\\nProcedure createTree(*n.node, *tPtr.Character)\\n Protected num.s, *l.node, *ntPtr.Character\\n\\n Repeat\\n Select *tPtr\\\\c\\n Case '0' To '9'\\n num + Chr(*tPtr\\\\c)\\n Case '('\\n *n\\\\value = Val(num): num = \\\"\\\"\\n *ntPtr = *tPtr + 1\\n If *ntPtr\\\\c = ','\\n ProcedureReturn *tPtr\\n Else\\n *l = AllocateMemory(SizeOf(node))\\n *n\\\\left = *l: *tPtr = createTree(*l, *ntPtr)\\n EndIf\\n Case ')', ',', #Null\\n If num: *n\\\\value = Val(num): EndIf\\n ProcedureReturn *tPtr\\n EndSelect\\n\\n If *tPtr\\\\c = ','\\n *l = AllocateMemory(SizeOf(node)):\\n *n\\\\right = *l: *tPtr = createTree(*l, *tPtr + 1)\\n EndIf\\n *tPtr + 1\\n ForEver\\nEndProcedure\\n\\nProcedure enqueue(List q.i(), element)\\n LastElement(q())\\n AddElement(q())\\n q() = element\\nEndProcedure\\n\\nProcedure dequeue(List q.i())\\n Protected element\\n If FirstElement(q())\\n element = q()\\n DeleteElement(q())\\n EndIf\\n ProcedureReturn element\\nEndProcedure\\n\\nProcedure onVisit(*n.node)\\n Print(Str(*n\\\\value) + \\\" \\\")\\nEndProcedure\\n\\nProcedure preorder(*n.node) ;recursive\\n onVisit(*n)\\n If *n\\\\left\\n preorder(*n\\\\left)\\n EndIf\\n If *n\\\\right\\n preorder(*n\\\\right)\\n EndIf\\nEndProcedure\\n\\nProcedure inorder(*n.node) ;recursive\\n If *n\\\\left\\n inorder(*n\\\\left)\\n EndIf\\n onVisit(*n)\\n If *n\\\\right\\n inorder(*n\\\\right)\\n EndIf\\nEndProcedure\\n\\nProcedure postorder(*n.node) ;recursive\\n If *n\\\\left\\n postorder(*n\\\\left)\\n EndIf\\n If *n\\\\right\\n postorder(*n\\\\right)\\n EndIf\\n onVisit(*n)\\nEndProcedure\\n\\nProcedure levelorder(*n.node)\\n Dim q.queue(1)\\n Protected readQueue = 1, writeQueue, *currNode.node\\n\\n enqueue(q(writeQueue)\\\\q(),*n) ;start queue off with root\\n Repeat\\n readQueue ! 1: writeQueue ! 1\\n While ListSize(q(readQueue)\\\\q())\\n *currNode = dequeue(q(readQueue)\\\\q())\\n If *currNode\\\\left\\n enqueue(q(writeQueue)\\\\q(),*currNode\\\\left)\\n EndIf\\n If *currNode\\\\right\\n enqueue(q(writeQueue)\\\\q(),*currNode\\\\right)\\n EndIf\\n onVisit(*currNode)\\n Wend\\n Until ListSize(q(writeQueue)\\\\q()) = 0\\nEndProcedure\\n\\nIf OpenConsole()\\n Define root.node\\n createTree(root,?tree)\\n\\n Print(\\\"preorder: \\\")\\n preorder(root)\\n PrintN(\\\"\\\")\\n Print(\\\"inorder: \\\")\\n inorder(root)\\n PrintN(\\\"\\\")\\n Print(\\\"postorder: \\\")\\n postorder(root)\\n PrintN(\\\"\\\")\\n Print(\\\"levelorder: \\\")\\n levelorder(root)\\n PrintN(\\\"\\\")\\n\\n Print(#CRLF$ + #CRLF$ + \\\"Press ENTER to exit\\\")\\n Input()\\n CloseConsole()\\nEndIf\\n\",\n \"language\": \"PureBasic\"\n },\n {\n \"code\": \"from collections import namedtuple\\n\\nNode = namedtuple('Node', 'data, left, right')\\ntree = Node(1,\\n Node(2,\\n Node(4,\\n Node(7, None, None),\\n None),\\n Node(5, None, None)),\\n Node(3,\\n Node(6,\\n Node(8, None, None),\\n Node(9, None, None)),\\n None))\\n\\ndef printwithspace(i):\\n print(i, end=' ')\\n\\ndef dfs(order, node, visitor):\\n if node is not None:\\n for action in order:\\n if action == 'N':\\n visitor(node.data)\\n elif action == 'L':\\n dfs(order, node.left, visitor)\\n elif action == 'R':\\n dfs(order, node.right, visitor)\\n\\ndef preorder(node, visitor = printwithspace):\\n dfs('NLR', node, visitor)\\n\\ndef inorder(node, visitor = printwithspace):\\n dfs('LNR', node, visitor)\\n\\ndef postorder(node, visitor = printwithspace):\\n dfs('LRN', node, visitor)\\n\\ndef ls(node, more, visitor, order='TB'):\\n \\\"Level-based Top-to-Bottom or Bottom-to-Top tree search\\\"\\n if node:\\n if more is None:\\n more = []\\n more += [node.left, node.right]\\n for action in order:\\n if action == 'B' and more:\\n ls(more[0], more[1:], visitor, order)\\n elif action == 'T' and node:\\n visitor(node.data)\\n\\ndef levelorder(node, more=None, visitor = printwithspace):\\n ls(node, more, visitor, 'TB')\\n\\n# Because we can\\ndef reverse_preorder(node, visitor = printwithspace):\\n dfs('RLN', node, visitor)\\n\\ndef bottom_up_order(node, more=None, visitor = printwithspace, order='BT'):\\n ls(node, more, visitor, 'BT')\\n\\n\\nif __name__ == '__main__':\\n w = 10\\n for traversal in [preorder, inorder, postorder, levelorder,\\n reverse_preorder, bottom_up_order]:\\n if traversal == reverse_preorder:\\n w = 20\\n print('\\\\nThe generalisation of function dfs allows:')\\n if traversal == bottom_up_order:\\n print('The generalisation of function ls allows:')\\n print(f\\\"{traversal.__name__:>{w}}:\\\", end=' ')\\n traversal(tree)\\n print()\\n\",\n \"language\": \"Python\"\n },\n {\n \"code\": \"from collections import namedtuple\\nfrom sys import stdout\\n\\nclass Node(namedtuple('Node', 'data, left, right')):\\n __slots__ = ()\\n\\n def preorder(self, visitor):\\n if self is not None:\\n visitor(self.data)\\n Node.preorder(self.left, visitor)\\n Node.preorder(self.right, visitor)\\n\\n def inorder(self, visitor):\\n if self is not None:\\n Node.inorder(self.left, visitor)\\n visitor(self.data)\\n Node.inorder(self.right, visitor)\\n\\n def postorder(self, visitor):\\n if self is not None:\\n Node.postorder(self.left, visitor)\\n Node.postorder(self.right, visitor)\\n visitor(self.data)\\n\\n def levelorder(self, visitor, more=None):\\n if self is not None:\\n if more is None:\\n more = []\\n more += [self.left, self.right]\\n visitor(self.data)\\n if more:\\n Node.levelorder(more[0], visitor, more[1:])\\n\\n\\ndef printwithspace(i):\\n stdout.write(\\\"%i \\\" % i)\\n\\n\\ntree = Node(1,\\n Node(2,\\n Node(4,\\n Node(7, None, None),\\n None),\\n Node(5, None, None)),\\n Node(3,\\n Node(6,\\n Node(8, None, None),\\n Node(9, None, None)),\\n None))\\n\\n\\nif __name__ == '__main__':\\n stdout.write(' preorder: ')\\n tree.preorder(printwithspace)\\n stdout.write('\\\\n inorder: ')\\n tree.inorder(printwithspace)\\n stdout.write('\\\\n postorder: ')\\n tree.postorder(printwithspace)\\n stdout.write('\\\\nlevelorder: ')\\n tree.levelorder(printwithspace)\\n stdout.write('\\\\n')\\n\",\n \"language\": \"Python\"\n },\n {\n \"code\": \"'''Tree traversals'''\\n\\nfrom itertools import chain\\nfrom functools import reduce\\nfrom operator import mul\\n\\n\\n# foldTree :: (a -> [b] -> b) -> Tree a -> b\\ndef foldTree(f):\\n '''The catamorphism on trees. A summary\\n value defined by a depth-first fold.\\n '''\\n def go(node):\\n return f(root(node))([\\n go(x) for x in nest(node)\\n ])\\n return go\\n\\n\\n# levels :: Tree a -> [[a]]\\ndef levels(tree):\\n '''A list of lists, grouping the root\\n values of each level of the tree.\\n '''\\n def go(a, node):\\n h, *t = a if a else ([], [])\\n\\n return [[root(node)] + h] + reduce(\\n go, nest(node)[::-1], t\\n )\\n return go([], tree)\\n\\n\\n# preorder :: a -> [[a]] -> [a]\\ndef preorder(x):\\n '''This node followed by the rest.'''\\n return lambda xs: [x] + concat(xs)\\n\\n\\n# inorder :: a -> [[a]] -> [a]\\ndef inorder(x):\\n '''Descendants of any first child,\\n then this node, then the rest.'''\\n return lambda xs: (\\n xs[0] + [x] + concat(xs[1:]) if xs else [x]\\n )\\n\\n\\n# postorder :: a -> [[a]] -> [a]\\ndef postorder(x):\\n '''Descendants first, then this node.'''\\n return lambda xs: concat(xs) + [x]\\n\\n\\n# levelorder :: Tree a -> [a]\\ndef levelorder(tree):\\n '''Top-down concatenation of this node\\n with the rows below.'''\\n return concat(levels(tree))\\n\\n\\n# treeSum :: Int -> [Int] -> Int\\ndef treeSum(x):\\n '''This node's value + the sum of its descendants.'''\\n return lambda xs: x + sum(xs)\\n\\n\\n# treeProduct :: Int -> [Int] -> Int\\ndef treeProduct(x):\\n '''This node's value * the product of its descendants.'''\\n return lambda xs: x * numericProduct(xs)\\n\\n\\n# treeMax :: Ord a => a -> [a] -> a\\ndef treeMax(x):\\n '''Maximum value of this node and any descendants.'''\\n return lambda xs: max([x] + xs)\\n\\n\\n# treeMin :: Ord a => a -> [a] -> a\\ndef treeMin(x):\\n '''Minimum value of this node and any descendants.'''\\n return lambda xs: min([x] + xs)\\n\\n\\n# nodeCount :: Int -> [Int] -> Int\\ndef nodeCount(_):\\n '''One more than the total number of descendants.'''\\n return lambda xs: 1 + sum(xs)\\n\\n\\n# treeWidth :: Int -> [Int] -> Int\\ndef treeWidth(_):\\n '''Sum of widths of any children, or a minimum of 1.'''\\n return lambda xs: sum(xs) if xs else 1\\n\\n\\n# treeDepth :: Int -> [Int] -> Int\\ndef treeDepth(_):\\n '''One more than that of the deepest child.'''\\n return lambda xs: 1 + (max(xs) if xs else 0)\\n\\n\\n# ------------------------- TEST -------------------------\\n# main :: IO ()\\ndef main():\\n '''Tree traversals - accumulating and folding'''\\n\\n # tree :: Tree Int\\n tree = Node(1)([\\n Node(2)([\\n Node(4)([\\n Node(7)([])\\n ]),\\n Node(5)([])\\n ]),\\n Node(3)([\\n Node(6)([\\n Node(8)([]),\\n Node(9)([])\\n ])\\n ])\\n ])\\n\\n print(\\n fTable(main.__doc__ + ':\\\\n')(fName)(str)(\\n lambda f: (\\n foldTree(f) if 'levelorder' != fName(f) else f\\n )(tree)\\n )([\\n preorder, inorder, postorder, levelorder,\\n treeSum, treeProduct, treeMin, treeMax,\\n nodeCount, treeWidth, treeDepth\\n ])\\n )\\n\\n\\n# ----------------------- GENERIC ------------------------\\n\\n# Node :: a -> [Tree a] -> Tree a\\ndef Node(v):\\n '''Contructor for a Tree node which connects a\\n value of some kind to a list of zero or\\n more child trees.'''\\n return lambda xs: {\\n 'type': 'Node', 'root': v, 'nest': xs\\n }\\n\\n\\n# nest :: Tree a -> [Tree a]\\ndef nest(tree):\\n '''Accessor function for children of tree node'''\\n return tree['nest'] if 'nest' in tree else None\\n\\n\\n# root :: Dict -> a\\ndef root(tree):\\n '''Accessor function for data of tree node'''\\n return tree['root'] if 'root' in tree else None\\n\\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# numericProduct :: [Num] -> Num\\ndef numericProduct(xs):\\n '''The arithmetic product of all numbers in xs.'''\\n return reduce(mul, xs, 1)\\n\\n\\n# ---------------------- FORMATTING ----------------------\\n\\n# fName :: (a -> b) -> String\\ndef fName(f):\\n '''The name bound to the function.'''\\n return f.__name__\\n\\n\\n# fTable :: String -> (a -> String) ->\\n# (b -> String) ->\\n# (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: y.rjust(w, ' ') + (\\n ' -> ' + fxShow(f(x))\\n ),\\n xs, ys\\n ))\\n return lambda xShow: lambda fxShow: (\\n lambda f: lambda xs: go(\\n xShow, fxShow, f, xs\\n )\\n )\\n\\n\\nif __name__ == '__main__':\\n main()\\n\",\n \"language\": \"Python\"\n },\n {\n \"code\": \"(set *tree* [1 [2 [4 [7]]\\n [5]]\\n [3 [6 [8]\\n [9]]]])\\n\\n(define inorder\\n [] -> []\\n [V] -> [V]\\n [V L] -> (append (inorder L)\\n [V])\\n [V L R] -> (append (inorder L)\\n [V]\\n (inorder R)))\\n\\n(define postorder\\n [] -> []\\n [V] -> [V]\\n [V L] -> (append (postorder L)\\n [V])\\n [V L R] -> (append (postorder L)\\n (postorder R)\\n [V]))\\n\\n(define preorder\\n [] -> []\\n [V] -> [V]\\n [V L] -> (append [V]\\n (preorder L))\\n [V L R] -> (append [V]\\n (preorder L)\\n (preorder R)))\\n\\n(define levelorder-0\\n [] -> []\\n [[] | Q] -> (levelorder-0 Q)\\n [[V | LR] | Q] -> [V | (levelorder-0 (append Q LR))])\\n\\n(define levelorder\\n Node -> (levelorder-0 [Node]))\\n\\n(preorder (value *tree*))\\n(postorder (value *tree*))\\n(inorder (value *tree*))\\n(levelorder (value *tree*))\\n\",\n \"language\": \"Qi\"\n },\n {\n \"code\": \" [ this ] is nil ( --> [ )\\n\\n [ ' [ 1\\n [ 2\\n [ 4\\n [ 7 nil nil ]\\n nil ]\\n [ 5 nil nil ] ]\\n [ 3\\n [ 6\\n [ 8 nil nil ]\\n [ 9 nil nil ] ]\\n nil ] ] ] is tree ( --> [ )\\n\\n [ dup nil = iff drop done\\n unpack swap rot\\n echo sp\\n recurse\\n recurse ] is pre-order ( [ --> )\\n\\n [ dup nil = iff drop done\\n unpack unrot\\n recurse\\n echo sp\\n recurse ] is in-order ( [ --> )\\n\\n [ dup nil = iff drop done\\n unpack swap\\n recurse\\n recurse\\n echo sp ] is post-order ( [ --> )\\n\\n [ queue swap push\\n [ dup empty?\\n iff drop done\\n pop\\n dup nil = iff\\n drop again\\n unpack\\n rot echo sp\\n dip push push\\n again ] ] is level-order ( [ --> )\\n\\n tree pre-order cr\\n tree in-order cr\\n tree post-order cr\\n tree level-order cr\\n\",\n \"language\": \"Quackery\"\n },\n {\n \"code\": \"#lang racket\\n\\n(define the-tree ; Node: (list <data> <left> <right>)\\n '(1 (2 (4 (7 #f #f) #f) (5 #f #f)) (3 (6 (8 #f #f) (9 #f #f)) #f)))\\n\\n(define (preorder tree visit)\\n (let loop ([t tree])\\n (when t (visit (car t)) (loop (cadr t)) (loop (caddr t)))))\\n(define (inorder tree visit)\\n (let loop ([t tree])\\n (when t (loop (cadr t)) (visit (car t)) (loop (caddr t)))))\\n(define (postorder tree visit)\\n (let loop ([t tree])\\n (when t (loop (cadr t)) (loop (caddr t)) (visit (car t)))))\\n(define (levelorder tree visit)\\n (let loop ([trees (list tree)])\\n (unless (null? trees)\\n ((compose1 loop (curry filter values) append*)\\n (for/list ([t trees] #:when t) (visit (car t)) (cdr t))))))\\n\\n(define (run order)\\n (printf \\\"~a:\\\" (object-name order))\\n (order the-tree (?(x) (printf \\\" ~s\\\" x)))\\n (newline))\\n(for-each run (list preorder inorder postorder levelorder))\\n\",\n \"language\": \"Racket\"\n },\n {\n \"code\": \"class TreeNode {\\n has TreeNode $.parent;\\n has TreeNode $.left;\\n has TreeNode $.right;\\n has $.value;\\n\\n method pre-order {\\n flat gather {\\n take $.value;\\n take $.left.pre-order if $.left;\\n take $.right.pre-order if $.right\\n }\\n }\\n\\n method in-order {\\n flat gather {\\n take $.left.in-order if $.left;\\n take $.value;\\n take $.right.in-order if $.right;\\n }\\n }\\n\\n method post-order {\\n flat gather {\\n take $.left.post-order if $.left;\\n take $.right.post-order if $.right;\\n take $.value;\\n }\\n }\\n\\n method level-order {\\n my TreeNode @queue = (self);\\n flat gather while @queue.elems {\\n my $n = @queue.shift;\\n take $n.value;\\n @queue.push($n.left) if $n.left;\\n @queue.push($n.right) if $n.right;\\n }\\n }\\n}\\n\\nmy TreeNode $root .= new( value => 1,\\n left => TreeNode.new( value => 2,\\n left => TreeNode.new( value => 4, left => TreeNode.new(value => 7)),\\n right => TreeNode.new( value => 5)\\n ),\\n right => TreeNode.new( value => 3,\\n left => TreeNode.new( value => 6,\\n left => TreeNode.new(value => 8),\\n right => TreeNode.new(value => 9)\\n )\\n )\\n );\\n\\nsay \\\"preorder: \\\",$root.pre-order.join(\\\" \\\");\\nsay \\\"inorder: \\\",$root.in-order.join(\\\" \\\");\\nsay \\\"postorder: \\\",$root.post-order.join(\\\" \\\");\\nsay \\\"levelorder:\\\",$root.level-order.join(\\\" \\\");\\n\",\n \"language\": \"Raku\"\n },\n {\n \"code\": \"tree: [1 [2 [4 [7 [] []] []] [5 [] []]] [3 [6 [8 [] []] [9 [] []]] []]]\\n; \\\"compacted\\\" version\\ntree: [1 [2 [4 [7 ] ] [5 ]] [3 [6 [8 ] [9 ]] ]]\\n\\nvisit: func [tree [block!]][prin rejoin [first tree \\\" \\\"]]\\nleft: :second\\nright: :third\\n\\npreorder: func [tree [block!]][\\n\\tif not empty? tree [visit tree]\\n\\tattempt [preorder left tree]\\n\\tattempt [preorder right tree]\\n]\\nprin \\\"preorder: \\\" preorder tree\\nprint \\\"\\\"\\n\\ninorder: func [tree [block!]][\\n\\tattempt [inorder left tree]\\n\\tif not empty? tree [visit tree]\\n\\tattempt [inorder right tree]\\n]\\nprin \\\"inorder: \\\" inorder tree\\nprint \\\"\\\"\\n\\npostorder: func [tree [block!]][\\n\\tattempt [postorder left tree]\\n\\tattempt [postorder right tree]\\n\\tif not empty? tree [visit tree]\\n]\\nprin \\\"postorder: \\\" postorder tree\\nprint \\\"\\\"\\n\\nqueue: []\\nenqueue: func [tree [block!]][append/only queue tree]\\ndequeue: func [queue [block!]][take queue]\\nlevel-order: func [tree [block!]][\\n\\tclear head queue\\n\\tqueue: enqueue tree\\n\\twhile [not empty? queue] [\\n\\t\\ttree: dequeue queue\\n\\t\\tif not empty? tree [visit tree]\\n\\t\\tattempt [enqueue left tree]\\n\\t\\tattempt [enqueue right tree]\\n\\t]\\n]\\nprin \\\"level-order: \\\" level-order tree\\n\",\n \"language\": \"REBOL\"\n },\n {\n \"code\": \"$ENTRY Go {\\n = <Show Preorder <Tree>>\\n <Show Inorder <Tree>>\\n <Show Postorder <Tree>>\\n <Show Levelorder <Tree>>;\\n};\\n\\nShow {\\n s.F t.T = <Prout s.F ': ' <Mu s.F t.T>>;\\n};\\n\\nTree {\\n = (1 (2 (4 (7 () ()) ()) (5 () ())) (3 (6 (8 () ()) (9 () ())) ()));\\n};\\n\\nPreorder {\\n () = ;\\n (s.V t.L t.R) = s.V <Preorder t.L> <Preorder t.R>;\\n};\\n\\nInorder {\\n () = ;\\n (s.V t.L t.R) = <Inorder t.L> s.V <Inorder t.R>;\\n};\\n\\nPostorder {\\n () = ;\\n (s.V t.L t.R) = <Postorder t.L> <Postorder t.R> s.V;\\n};\\n\\nLevelorder {\\n = ;\\n () e.Q = <Levelorder e.Q>;\\n (s.V t.L t.R) e.Q = s.V <Levelorder e.Q t.L t.R>;\\n};\\n\",\n \"language\": \"Refal\"\n },\n {\n \"code\": \"/* REXX ***************************************************************\\n* Tree traversal\\n= 1\\n= / \\\\\\n= / \\\\\\n= / \\\\\\n= 2 3\\n= / \\\\ /\\n= 4 5 6\\n= / / \\\\\\n= 7 8 9\\n=\\n= The correct output should look like this:\\n= preorder: 1 2 4 7 5 3 6 8 9\\n= level-order: 1 2 3 4 5 6 7 8 9\\n= postorder: 7 4 5 2 8 9 6 3 1\\n= inorder: 7 4 2 5 1 8 6 9 3\\n\\n* 17.06.2012 Walter Pachl not thoroughly tested\\n**********************************************************************/\\ndebug=0\\nwl_soll=1 2 4 7 5 3 6 8 9\\nil_soll=7 4 2 5 1 8 6 9 3\\npl_soll=7 4 5 2 8 9 6 3 1\\nll_soll=1 2 3 4 5 6 7 8 9\\n\\nCall mktree\\nwl.=''; wl='' /* preorder */\\nll.=''; ll='' /* level-order */\\n il='' /* inorder */\\n pl='' /* postorder */\\n\\n/**********************************************************************\\n* First walk the tree and construct preorder and level-order lists\\n**********************************************************************/\\ndone.=0\\nlvl=1\\nz=root\\nCall note z\\nDo Until z=0\\n z=go_next(z)\\n Call note z\\n End\\nCall show 'preorder: ',wl,wl_soll\\nDo lvl=1 To 4\\n ll=ll ll.lvl\\n End\\nCall show 'level-order:',ll,ll_soll\\n\\n/**********************************************************************\\n* Next construct postorder list\\n**********************************************************************/\\ndone.=0\\nridone.=0\\nz=lbot(root)\\nCall notep z\\nDo Until z=0\\n br=brother(z)\\n If br>0 &,\\n done.br=0 Then Do\\n ridone.br=1\\n z=lbot(br)\\n Call notep z\\n End\\n Else\\n z=father(z)\\n Call notep z\\n End\\nCall show 'postorder: ',pl,pl_soll\\n\\n/**********************************************************************\\n* Finally construct inorder list\\n**********************************************************************/\\ndone.=0\\nridone.=0\\nz=lbot(root)\\nCall notei z\\nDo Until z=0\\n z=father(z)\\n Call notei z\\n ri=node.z.0rite\\n If ridone.z=0 Then Do\\n ridone.z=1\\n If ri>0 Then Do\\n z=lbot(ri)\\n Call notei z\\n End\\n End\\n End\\n\\n/**********************************************************************\\n* And now show the results and check them for correctness\\n**********************************************************************/\\nCall show 'inorder: ',il,il_soll\\n\\nExit\\n\\nshow: Parse Arg Which,have,soll\\n/**********************************************************************\\n* Show our result and show it it's correct\\n**********************************************************************/\\nhave=space(have)\\nIf have=soll Then\\n tag=''\\nElse\\n tag='*wrong*'\\nSay which have tag\\nIf tag<>'' Then\\n Say '------------>'soll 'is the expected result'\\nReturn\\n\\nbrother: Procedure Expose node.\\n/**********************************************************************\\n* Return the right node of this node's father or 0\\n**********************************************************************/\\n Parse arg no\\n nof=node.no.0father\\n brot1=node.nof.0rite\\n Return brot1\\n\\nnotei: Procedure Expose debug il done.\\n/**********************************************************************\\n* append the given node to il\\n**********************************************************************/\\n Parse Arg nd\\n If nd<>0 &,\\n done.nd=0 Then\\n il=il nd\\n If debug Then\\n Say 'notei' nd\\n done.nd=1\\n Return\\n\\nnotep: Procedure Expose debug pl done.\\n/**********************************************************************\\n* append the given node to pl\\n**********************************************************************/\\n Parse Arg nd\\n If nd<>0 &,\\n done.nd=0 Then Do\\n pl=pl nd\\n If debug Then\\n Say 'notep' nd\\n End\\n done.nd=1\\n Return\\n\\nfather: Procedure Expose node.\\n/**********************************************************************\\n* Return the father of the argument\\n* or 0 if the root is given as argument\\n**********************************************************************/\\n Parse Arg nd\\n Return node.nd.0father\\n\\nlbot: Procedure Expose node.\\n/**********************************************************************\\n* From node z: Walk down on the left side until you reach the bottom\\n* and return the bottom node\\n* If z has no left son (at the bottom of the tree) returm itself\\n**********************************************************************/\\n Parse Arg z\\n Do i=1 To 100\\n If node.z.0left<>0 Then\\n z=node.z.0left\\n Else\\n Leave\\n End\\n Return z\\n\\nnote:\\n/**********************************************************************\\n* add the node to the preorder list unless it's already there\\n* add the node to the level list\\n**********************************************************************/\\n If z<>0 &, /* it's a node */\\n done.z=0 Then Do /* not yet done */\\n wl=wl z /* add it to the preorder list*/\\n ll.lvl=ll.lvl z /* add it to the level list */\\n done.z=1 /* remember it's done */\\n End\\n Return\\n\\ngo_next: Procedure Expose node. lvl\\n/**********************************************************************\\n* find the next node to visit in the treewalk\\n**********************************************************************/\\n next=0\\n Parse arg z\\n If node.z.0left<>0 Then Do /* there is a left son */\\n If node.z.0left.done=0 Then Do /* we have not visited it */\\n next=node.z.0left /* so we go there */\\n node.z.0left.done=1 /* note we were here */\\n lvl=lvl+1 /* increase the level */\\n End\\n End\\n If next=0 Then Do /* not moved yet */\\n If node.z.0rite<>0 Then Do /* there is a right son */\\n If node.z.0rite.done=0 Then Do /* we have not visited it */\\n next=node.z.0rite /* so we go there */\\n node.z.0rite.done=1 /* note we were here */\\n lvl=lvl+1 /* increase the level */\\n End\\n End\\n End\\n If next=0 Then Do /* not moved yet */\\n next=node.z.0father /* go to the father */\\n lvl=lvl-1 /* decrease the level */\\n End\\n Return next /* that's the next node */\\n /* or zero if we are done */\\n\\nmknode: Procedure Expose node.\\n/**********************************************************************\\n* create a new node\\n**********************************************************************/\\n Parse Arg name\\n z=node.0+1\\n node.z.0name=name\\n node.z.0father=0\\n node.z.0left =0\\n node.z.0rite =0\\n node.0=z\\n Return z /* number of the node just created */\\n\\nattleft: Procedure Expose node.\\n/**********************************************************************\\n* make son the left son of father\\n**********************************************************************/\\n Parse Arg son,father\\n node.son.0father=father\\n z=node.father.0left\\n If z<>0 Then Do\\n node.z.0father=son\\n node.son.0left=z\\n End\\n node.father.0left=son\\n Return\\n\\nattrite: Procedure Expose node.\\n/**********************************************************************\\n* make son the right son of father\\n**********************************************************************/\\n Parse Arg son,father\\n node.son.0father=father\\n z=node.father.0rite\\n If z<>0 Then Do\\n node.z.0father=son\\n node.son.0rite=z\\n End\\n node.father.0rite=son\\n le=node.father.0left\\n If le>0 Then\\n node.le.0brother=node.father.0rite\\n Return\\n\\nmktree: Procedure Expose node. root\\n/**********************************************************************\\n* build the tree according to the task\\n**********************************************************************/\\n node.=0\\n a=mknode('A'); root=a\\n b=mknode('B'); Call attleft b,a\\n c=mknode('C'); Call attrite c,a\\n d=mknode('D'); Call attleft d,b\\n e=mknode('E'); Call attrite e,b\\n f=mknode('F'); Call attleft f,c\\n g=mknode('G'); Call attleft g,d\\n h=mknode('H'); Call attleft h,f\\n i=mknode('I'); Call attrite i,f\\n Call show_tree 1\\n Return\\n\\nshow_tree: Procedure Expose node.\\n/**********************************************************************\\n* Show the tree\\n* f\\n* l1 1 r1\\n* l r l r\\n* l r l r l r l r\\n* 12345678901234567890\\n**********************************************************************/\\n Parse Arg f\\n l.=''\\n l.1=overlay(f ,l.1, 9)\\n\\n l1=node.f.0left ;l.2=overlay(l1 ,l.2, 5)\\n/*b1=node.f.0brother ;l.2=overlay(b1 ,l.2, 9) */\\n r1=node.f.0rite ;l.2=overlay(r1 ,l.2,13)\\n\\n l1g=node.l1.0left ;l.3=overlay(l1g ,l.3, 3)\\n/*b1g=node.l1.0brother ;l.3=overlay(b1g ,l.3, 5) */\\n r1g=node.l1.0rite ;l.3=overlay(r1g ,l.3, 7)\\n\\n l2g=node.r1.0left ;l.3=overlay(l2g ,l.3,11)\\n/*b2g=node.r1.0brother ;l.3=overlay(b2g ,l.3,13) */\\n r2g=node.r1.0rite ;l.3=overlay(r2g ,l.3,15)\\n\\n l1ls=node.l1g.0left ;l.4=overlay(l1ls,l.4, 2)\\n/*b1ls=node.l1g.0brother ;l.4=overlay(b1ls,l.4, 3) */\\n r1ls=node.l1g.0rite ;l.4=overlay(r1ls,l.4, 4)\\n\\n l1rs=node.r1g.0left ;l.4=overlay(l1rs,l.4, 6)\\n/*b1rs=node.r1g.0brother ;l.4=overlay(b1rs,l.4, 7) */\\n r1rs=node.r1g.0rite ;l.4=overlay(r1rs,l.4, 8)\\n\\n l2ls=node.l2g.0left ;l.4=overlay(l2ls,l.4,10)\\n/*b2ls=node.l2g.0brother ;l.4=overlay(b2ls,l.4,11) */\\n r2ls=node.l2g.0rite ;l.4=overlay(r2ls,l.4,12)\\n\\n l2rs=node.r2g.0left ;l.4=overlay(l2rs,l.4,14)\\n/*b2rs=node.r2g.0brother ;l.4=overlay(b2rs,l.4,15) */\\n r2rs=node.r2g.0rite ;l.4=overlay(r2rs,l.4,16)\\n Do i=1 To 4\\n Say translate(l.i,' ','0')\\n Say ''\\n End\\n Return\\n\",\n \"language\": \"REXX\"\n },\n {\n \"code\": \"BinaryTreeNode = Struct.new(:value, :left, :right) do\\n def self.from_array(nested_list)\\n value, left, right = nested_list\\n if value\\n self.new(value, self.from_array(left), self.from_array(right))\\n end\\n end\\n\\n def walk_nodes(order, &block)\\n order.each do |node|\\n case node\\n when :left then left && left.walk_nodes(order, &block)\\n when :self then yield self\\n when :right then right && right.walk_nodes(order, &block)\\n end\\n end\\n end\\n\\n def each_preorder(&b) walk_nodes([:self, :left, :right], &b) end\\n def each_inorder(&b) walk_nodes([:left, :self, :right], &b) end\\n def each_postorder(&b) walk_nodes([:left, :right, :self], &b) end\\n\\n def each_levelorder\\n queue = [self]\\n until queue.empty?\\n node = queue.shift\\n yield node\\n queue << node.left if node.left\\n queue << node.right if node.right\\n end\\n end\\nend\\n\\nroot = BinaryTreeNode.from_array [1, [2, [4, 7], [5]], [3, [6, [8], [9]]]]\\n\\nBinaryTreeNode.instance_methods.select{|m| m=~/.+order/}.each do |mthd|\\n printf \\\"%-11s \\\", mthd[5..-1] + ':'\\n root.send(mthd) {|node| print \\\"#{node.value} \\\"}\\n puts\\nend\\n\",\n \"language\": \"Ruby\"\n },\n {\n \"code\": \"#![feature(box_syntax, box_patterns)]\\n\\nuse std::collections::VecDeque;\\n\\n#[derive(Debug)]\\nstruct TreeNode<T> {\\n value: T,\\n left: Option<Box<TreeNode<T>>>,\\n right: Option<Box<TreeNode<T>>>,\\n}\\n\\nenum TraversalMethod {\\n PreOrder,\\n InOrder,\\n PostOrder,\\n LevelOrder,\\n}\\n\\nimpl<T> TreeNode<T> {\\n pub fn new(arr: &[[i8; 3]]) -> TreeNode<i8> {\\n\\n let l = match arr[0][1] {\\n -1 => None,\\n i @ _ => Some(Box::new(TreeNode::<i8>::new(&arr[(i - arr[0][0]) as usize..]))),\\n };\\n let r = match arr[0][2] {\\n -1 => None,\\n i @ _ => Some(Box::new(TreeNode::<i8>::new(&arr[(i - arr[0][0]) as usize..]))),\\n };\\n\\n TreeNode {\\n value: arr[0][0],\\n left: l,\\n right: r,\\n }\\n }\\n\\n pub fn traverse(&self, tr: &TraversalMethod) -> Vec<&TreeNode<T>> {\\n match tr {\\n &TraversalMethod::PreOrder => self.iterative_preorder(),\\n &TraversalMethod::InOrder => self.iterative_inorder(),\\n &TraversalMethod::PostOrder => self.iterative_postorder(),\\n &TraversalMethod::LevelOrder => self.iterative_levelorder(),\\n }\\n }\\n\\n fn iterative_preorder(&self) -> Vec<&TreeNode<T>> {\\n let mut stack: Vec<&TreeNode<T>> = Vec::new();\\n let mut res: Vec<&TreeNode<T>> = Vec::new();\\n\\n stack.push(self);\\n while !stack.is_empty() {\\n let node = stack.pop().unwrap();\\n res.push(node);\\n match node.right {\\n None => {}\\n Some(box ref n) => stack.push(n),\\n }\\n match node.left {\\n None => {}\\n Some(box ref n) => stack.push(n),\\n }\\n }\\n res\\n }\\n\\n // Leftmost to rightmost\\n fn iterative_inorder(&self) -> Vec<&TreeNode<T>> {\\n let mut stack: Vec<&TreeNode<T>> = Vec::new();\\n let mut res: Vec<&TreeNode<T>> = Vec::new();\\n let mut p = self;\\n\\n loop {\\n // Stack parents and right children while left-descending\\n loop {\\n match p.right {\\n None => {}\\n Some(box ref n) => stack.push(n),\\n }\\n stack.push(p);\\n match p.left {\\n None => break,\\n Some(box ref n) => p = n,\\n }\\n }\\n // Visit the nodes with no right child\\n p = stack.pop().unwrap();\\n while !stack.is_empty() && p.right.is_none() {\\n res.push(p);\\n p = stack.pop().unwrap();\\n }\\n // First node that can potentially have a right child:\\n res.push(p);\\n if stack.is_empty() {\\n break;\\n } else {\\n p = stack.pop().unwrap();\\n }\\n }\\n res\\n }\\n\\n // Left-to-right postorder is same sequence as right-to-left preorder, reversed\\n fn iterative_postorder(&self) -> Vec<&TreeNode<T>> {\\n let mut stack: Vec<&TreeNode<T>> = Vec::new();\\n let mut res: Vec<&TreeNode<T>> = Vec::new();\\n\\n stack.push(self);\\n while !stack.is_empty() {\\n let node = stack.pop().unwrap();\\n res.push(node);\\n match node.left {\\n None => {}\\n Some(box ref n) => stack.push(n),\\n }\\n match node.right {\\n None => {}\\n Some(box ref n) => stack.push(n),\\n }\\n }\\n let rev_iter = res.iter().rev();\\n let mut rev: Vec<&TreeNode<T>> = Vec::new();\\n for elem in rev_iter {\\n rev.push(elem);\\n }\\n rev\\n }\\n\\n fn iterative_levelorder(&self) -> Vec<&TreeNode<T>> {\\n let mut queue: VecDeque<&TreeNode<T>> = VecDeque::new();\\n let mut res: Vec<&TreeNode<T>> = Vec::new();\\n\\n queue.push_back(self);\\n while !queue.is_empty() {\\n let node = queue.pop_front().unwrap();\\n res.push(node);\\n match node.left {\\n None => {}\\n Some(box ref n) => queue.push_back(n),\\n }\\n match node.right {\\n None => {}\\n Some(box ref n) => queue.push_back(n),\\n }\\n }\\n res\\n }\\n}\\n\\nfn main() {\\n // Array representation of task tree\\n let arr_tree = [[1, 2, 3],\\n [2, 4, 5],\\n [3, 6, -1],\\n [4, 7, -1],\\n [5, -1, -1],\\n [6, 8, 9],\\n [7, -1, -1],\\n [8, -1, -1],\\n [9, -1, -1]];\\n\\n let root = TreeNode::<i8>::new(&arr_tree);\\n\\n for method_label in [(TraversalMethod::PreOrder, \\\"pre-order:\\\"),\\n (TraversalMethod::InOrder, \\\"in-order:\\\"),\\n (TraversalMethod::PostOrder, \\\"post-order:\\\"),\\n (TraversalMethod::LevelOrder, \\\"level-order:\\\")]\\n .iter() {\\n print!(\\\"{}\\\\t\\\", method_label.1);\\n for n in root.traverse(&method_label.0) {\\n print!(\\\" {}\\\", n.value);\\n }\\n print!(\\\"\\\\n\\\");\\n }\\n}\\n\",\n \"language\": \"Rust\"\n },\n {\n \"code\": \"case class IntNode(value: Int, left: Option[IntNode] = None, right: Option[IntNode] = None) {\\n\\n def preorder(f: IntNode => Unit) {\\n f(this)\\n left.map(_.preorder(f)) // Same as: if(left.isDefined) left.get.preorder(f)\\n right.map(_.preorder(f))\\n }\\n\\n def postorder(f: IntNode => Unit) {\\n left.map(_.postorder(f))\\n right.map(_.postorder(f))\\n f(this)\\n }\\n\\n def inorder(f: IntNode => Unit) {\\n left.map(_.inorder(f))\\n f(this)\\n right.map(_.inorder(f))\\n }\\n\\n def levelorder(f: IntNode => Unit) {\\n\\n def loVisit(ls: List[IntNode]): Unit = ls match {\\n case Nil => None\\n case node :: rest => f(node); loVisit(rest ++ node.left ++ node.right)\\n }\\n\\n loVisit(List(this))\\n }\\n}\\n\\nobject TreeTraversal extends App {\\n implicit def intNode2SomeIntNode(n: IntNode) = Some[IntNode](n)\\n\\n val tree = IntNode(1,\\n IntNode(2,\\n IntNode(4,\\n IntNode(7)),\\n IntNode(5)),\\n IntNode(3,\\n IntNode(6,\\n IntNode(8),\\n IntNode(9))))\\n\\n List(\\n \\\" preorder: \\\" -> tree.preorder _, // `_` denotes the function value of type `IntNode => Unit` (returning nothing)\\n \\\" inorder: \\\" -> tree.inorder _,\\n \\\" postorder: \\\" -> tree.postorder _,\\n \\\"levelorder: \\\" -> tree.levelorder _) foreach {\\n case (name, func) =>\\n val s = new StringBuilder(name)\\n func(n => s ++= n.value.toString + \\\" \\\")\\n println(s)\\n }\\n}\\n\",\n \"language\": \"Scala\"\n },\n {\n \"code\": \"(define (preorder tree)\\n (if (null? tree)\\n '()\\n (append (list (car tree))\\n (preorder (cadr tree))\\n (preorder (caddr tree)))))\\n\\n(define (inorder tree)\\n (if (null? tree)\\n '()\\n (append (inorder (cadr tree))\\n (list (car tree))\\n (inorder (caddr tree)))))\\n\\n(define (postorder tree)\\n (if (null? tree)\\n '()\\n (append (postorder (cadr tree))\\n (postorder (caddr tree))\\n (list (car tree)))))\\n\\n(define (level-order tree)\\n (define lst '())\\n (define (traverse nodes)\\n (if (pair? nodes)\\n (let ((next-nodes '()))\\n (do ((p nodes (cdr p)))\\n ((null? p))\\n (set! lst (cons (caar p) lst))\\n (let* ((n '())\\n (n (if (null? (cadar p))\\n n\\n (cons (cadar p) n)))\\n (n (if (null? (caddar p))\\n n\\n (cons (caddar p) n))))\\n (set! next-nodes (append n next-nodes))))\\n (traverse (reverse next-nodes)))))\\n (if (null? tree)\\n '()\\n (begin\\n (traverse (list tree))\\n (reverse lst))))\\n\\n(define (demonstration tree)\\n (define (display-values lst)\\n (do ((p lst (cdr p)))\\n ((null? p))\\n (display (car p))\\n (if (pair? (cdr p))\\n (display \\\" \\\")))\\n (newline))\\n (display \\\"preorder: \\\") (display-values (preorder tree))\\n (display \\\"inorder: \\\") (display-values (inorder tree))\\n (display \\\"postorder: \\\") (display-values (postorder tree))\\n (display \\\"level-order: \\\") (display-values (level-order tree)))\\n\\n(define the-task-tree\\n '(1 (2 (4 (7 () ())\\n ())\\n (5 () ()))\\n (3 (6 (8 () ())\\n (9 () ()))\\n ())))\\n\\n(demonstration the-task-tree)\\n\",\n \"language\": \"Scheme\"\n },\n {\n \"code\": \"main(args(2)) :=\\n \\\"preorder: \\\" ++ toString(preOrder(testTree)) ++\\n \\\"\\\\ninoder: \\\" ++ toString(inOrder(testTree)) ++\\n \\\"\\\\npostorder: \\\" ++ toString(postOrder(testTree)) ++\\n \\\"\\\\nlevel-order: \\\" ++ toString(levelOrder(testTree));\\n\\nNode ::= (value : int, left : Node, right : Node);\\n\\npreOrder(n) := [n.value] ++\\n (preOrder(n.left) when isDefined(n, left) else []) ++\\n (preOrder(n.right) when isDefined(n, right) else []);\\n\\ninOrder(n) := (inOrder(n.left) when isDefined(n, left) else []) ++\\n [n.value] ++\\n (inOrder(n.right) when isDefined(n, right) else []);\\n\\npostOrder(n) := (postOrder(n.left) when isDefined(n, left) else []) ++\\n (postOrder(n.right) when isDefined(n, right) else []) ++\\n [n.value];\\n\\nlevelOrder(n) := levelOrderHelper([n]);\\nlevelOrderHelper(ns(1)) :=\\n let\\n n := head(ns);\\n in\\n [] when size(ns) = 0 else\\n [n.value] ++ levelOrderHelper(tail(ns) ++\\n ([n.left] when isDefined(n, left) else []) ++\\n ([n.right] when isDefined(n, right) else []));\\n\\ntestTree :=\\n (value : 1,\\n left : (value : 2,\\n left : (value : 4,\\n left : (value : 7)),\\n right : (value : 5)),\\n right : (value : 3,\\n left : (value : 6,\\n left : (value : 8),\\n right : (value : 9))\\n )\\n );\\n\",\n \"language\": \"SequenceL\"\n },\n {\n \"code\": \"program tree_traversal;\\n tree := [1, [2, [4, [7]], [5]], [3, [6, [8], [9]]]];\\n\\n print(\\\"preorder \\\", preorder(tree));\\n print(\\\"inorder \\\", inorder(tree));\\n print(\\\"postorder \\\", postorder(tree));\\n print(\\\"level-order \\\", levelorder(tree));\\n\\n proc preorder(tree);\\n if tree = om then return []; end if;\\n [item, left, right] := tree;\\n return [item] + preorder(left) + preorder(right);\\n end proc;\\n\\n proc inorder(tree);\\n if tree = om then return []; end if;\\n [item, left, right] := tree;\\n return inorder(left) + [item] + inorder(right);\\n end proc;\\n\\n proc postorder(tree);\\n if tree = om then return []; end if;\\n [item, left, right] := tree;\\n return postorder(left) + postorder(right) + [item];\\n end proc;\\n\\n proc levelorder(tree);\\n items := [];\\n loop init queue := [tree]; while queue /= [] do\\n [item, left, right] fromb queue;\\n items with:= item;\\n if left /= om then queue with:= left; end if;\\n if right /= om then queue with:= right; end if;\\n end loop;\\n return items;\\n end proc;\\nend program;\\n\",\n \"language\": \"SETL\"\n },\n {\n \"code\": \"func preorder(t) {\\n t ? [t[0], __FUNC__(t[1])..., __FUNC__(t[2])...] : [];\\n}\\n\\nfunc inorder(t) {\\n t ? [__FUNC__(t[1])..., t[0], __FUNC__(t[2])...] : [];\\n}\\n\\nfunc postorder(t) {\\n t ? [__FUNC__(t[1])..., __FUNC__(t[2])..., t[0]] : [];\\n}\\n\\nfunc depth(t) {\\n var a = [t];\\n var ret = [];\\n while (a.len > 0) {\\n var v = (a.shift \\\\\\\\ next);\\n ret « v[0];\\n a += [v[1,2]];\\n };\\n return ret;\\n}\\n\\nvar x = [1,[2,[4,[7]],[5]],[3,[6,[8],[9]]]];\\nsay \\\"pre: #{preorder(x)}\\\";\\nsay \\\"in: #{inorder(x)}\\\";\\nsay \\\"post: #{postorder(x)}\\\";\\nsay \\\"depth: #{depth(x)}\\\";\\n\",\n \"language\": \"Sidef\"\n },\n {\n \"code\": \"\\\"Protocol: visiting\\\"\\nEmptyNode>>accept: aVisitor\\n\\nEmptyNode>>accept: aVisitor with: anObject\\n\\t^anObject\\n\\n\\\"Protocol: enumerating\\\"\\nEmptyNode>>traverse: aVisitorClass do: aBlock\\n\\t^self accept: (aVisitorClass block: aBlock)\\n\",\n \"language\": \"Smalltalk\"\n },\n {\n \"code\": \"\\\"Protocol: visiting\\\"\\nNode>>accept: aVisitor\\n\\t^aVisitor visit: self\\n\\nNode>>accept: aVisitor with: anObject\\n\\t^aVisitor visit: self with: anObject\\n\\n\\\"Protocol: accessing\\\"\\nNode>>data\\n\\t^data\\n\\nNode>>data: anObject\\n\\tdata := anObject\\n\\nNode>>left\\n\\t^left\\n\\nNode>>left: aNode\\n\\tleft := aNode\\n\\nNode>>right\\n\\t^right\\n\\nNode>>right: aNode\\n\\tright := aNode\\n\\n\\\"Protocol: initialize-release\\\"\\nNode>>initialize\\n\\tsuper initialize.\\n\\tleft := right := EmptyNode new\\n\\n\\\"Class side\\\"\\n\\\"Protocol: instance creation\\\"\\nNode class>>data: anObject\\n\\t^self new data: anObject\\n\",\n \"language\": \"Smalltalk\"\n },\n {\n \"code\": \"\\\"Protocol: visiting\\\"\\nvisit: aNode\\n\\tself subclassResponsibility\\n\\n\\\"Protocol: accessing\\\"\\nVisitor>>block: anObject\\n\\tblock := anObject\\n\\n\\\"Protocol: initialize-release\\\"\\nVisitor>>initialize\\n\\tsuper initialize.\\n\\tblock := [:node | ]\\n\\n\\\"Class side\\\"\\n\\\"Protocol: instance creation\\\"\\nVisitor class>>block: aBlock\\n\\t^self new block: aBlock\\n\",\n \"language\": \"Smalltalk\"\n },\n {\n \"code\": \"\\\"Protocol: visiting\\\"\\nInOrder>>visit: aNode\\n\\taNode left accept: self.\\n\\tblock value: aNode.\\n\\taNode right accept: self\\n\",\n \"language\": \"Smalltalk\"\n },\n {\n \"code\": \"\\\"Protocol: visiting\\\"\\nLevelOrder>>visit: aNode\\n\\t| queue |\\n\\tqueue := OrderedCollection with: aNode.\\n\\t[(queue removeFirst accept: self with: queue) isEmpty] whileFalse\\n\\nLevelOrder>>visit: aNode with: aQueue\\n\\tblock value: aNode.\\n\\t^aQueue\\n\\t\\tadd: aNode left;\\n\\t\\tadd: aNode right;\\n\\t\\tyourself\\n\",\n \"language\": \"Smalltalk\"\n },\n {\n \"code\": \"\\\"Protocol: visiting\\\"\\nPostOrder>>visit: aNode\\n\\taNode left accept: self.\\n\\taNode right accept: self.\\n\\tblock value: aNode\\n\",\n \"language\": \"Smalltalk\"\n },\n {\n \"code\": \"\\\"Protocol: visiting\\\"\\nPreOrder>>visit: aNode\\n\\tblock value: aNode.\\n\\taNode left accept: self.\\n\\taNode right accept: self\\n\",\n \"language\": \"Smalltalk\"\n },\n {\n \"code\": \"| tree |\\ntree := (Node data: 1)\\n\\t\\tleft: ((Node data: 2)\\n\\t\\t\\tleft: ((Node data: 4)\\n\\t\\t\\t\\tleft: (Node data: 7));\\n\\t\\t\\tright: (Node data: 5));\\n\\t\\tright: ((Node data: 3)\\n\\t\\t\\tleft: ((Node data: 6)\\n\\t\\t\\t\\tleft: (Node data: 8);\\n\\t\\t\\t\\tright: (Node data: 9))).\\ntree traverse: PreOrder do: [:node | Transcript print: node data; space].\\nTranscript cr.\\ntree traverse: InOrder do: [:node | Transcript print: node data; space].\\nTranscript cr.\\ntree traverse: PostOrder do: [:node | Transcript print: node data; space].\\nTranscript cr.\\ntree traverse: LevelOrder do: [:node | Transcript print: node data; space].\\nTranscript cr.\\n\",\n \"language\": \"Smalltalk\"\n },\n {\n \"code\": \"class TreeNode<T> {\\n let value: T\\n let left: TreeNode?\\n let right: TreeNode?\\n\\n init(value: T, left: TreeNode? = nil, right: TreeNode? = nil) {\\n self.value = value\\n self.left = left\\n self.right = right\\n }\\n\\n func preOrder(function: (T) -> Void) {\\n function(value)\\n if left != nil {\\n left!.preOrder(function: function)\\n }\\n if right != nil {\\n right!.preOrder(function: function)\\n }\\n }\\n\\n func inOrder(function: (T) -> Void) {\\n if left != nil {\\n left!.inOrder(function: function)\\n }\\n function(value)\\n if right != nil {\\n right!.inOrder(function: function)\\n }\\n }\\n\\n func postOrder(function: (T) -> Void) {\\n if left != nil {\\n left!.postOrder(function: function)\\n }\\n if right != nil {\\n right!.postOrder(function: function)\\n }\\n function(value)\\n }\\n\\n func levelOrder(function: (T) -> Void) {\\n var queue: [TreeNode] = []\\n queue.append(self)\\n while queue.count > 0 {\\n let node = queue.removeFirst()\\n function(node.value)\\n if node.left != nil {\\n queue.append(node.left!)\\n }\\n if node.right != nil {\\n queue.append(node.right!)\\n }\\n }\\n }\\n}\\n\\ntypealias Node = TreeNode<Int>\\n\\nlet n = Node(value: 1,\\n left: Node(value: 2,\\n left: Node(value: 4,\\n left: Node(value: 7)),\\n right: Node(value: 5)),\\n right: Node(value: 3,\\n left: Node(value: 6,\\n left: Node(value: 8),\\n right: Node(value: 9))))\\n\\nlet fn = { print($0, terminator: \\\" \\\") }\\n\\nprint(\\\"pre-order: \\\", terminator: \\\"\\\")\\nn.preOrder(function: fn)\\nprint()\\n\\nprint(\\\"in-order: \\\", terminator: \\\"\\\")\\nn.inOrder(function: fn)\\nprint()\\n\\nprint(\\\"post-order: \\\", terminator: \\\"\\\")\\nn.postOrder(function: fn)\\nprint()\\n\\nprint(\\\"level-order: \\\", terminator: \\\"\\\")\\nn.levelOrder(function: fn)\\nprint()\\n\",\n \"language\": \"Swift\"\n },\n {\n \"code\": \"oo::class create tree {\\n # Basic tree data structure stuff...\\n variable val l r\\n constructor {value {left {}} {right {}}} {\\n\\tset val $value\\n\\tset l $left\\n\\tset r $right\\n }\\n method value {} {return $val}\\n method left {} {return $l}\\n method right {} {return $r}\\n destructor {\\n\\tif {$l ne \\\"\\\"} {$l destroy}\\n\\tif {$r ne \\\"\\\"} {$r destroy}\\n }\\n\\n # Traversal methods\\n method preorder {varName script {level 0}} {\\n\\tupvar [incr level] $varName var\\n\\tset var $val\\n\\tuplevel $level $script\\n\\tif {$l ne \\\"\\\"} {$l preorder $varName $script $level}\\n\\tif {$r ne \\\"\\\"} {$r preorder $varName $script $level}\\n }\\n method inorder {varName script {level 0}} {\\n\\tupvar [incr level] $varName var\\n\\tif {$l ne \\\"\\\"} {$l inorder $varName $script $level}\\n\\tset var $val\\n\\tuplevel $level $script\\n\\tif {$r ne \\\"\\\"} {$r inorder $varName $script $level}\\n }\\n method postorder {varName script {level 0}} {\\n\\tupvar [incr level] $varName var\\n\\tif {$l ne \\\"\\\"} {$l postorder $varName $script $level}\\n\\tif {$r ne \\\"\\\"} {$r postorder $varName $script $level}\\n\\tset var $val\\n\\tuplevel $level $script\\n }\\n method levelorder {varName script} {\\n\\tupvar 1 $varName var\\n\\tset nodes [list [self]]; # A queue of nodes to process\\n\\twhile {[llength $nodes] > 0} {\\n\\t set nodes [lassign $nodes n]\\n\\t set var [$n value]\\n\\t uplevel 1 $script\\n\\t if {[$n left] ne \\\"\\\"} {lappend nodes [$n left]}\\n\\t if {[$n right] ne \\\"\\\"} {lappend nodes [$n right]}\\n\\t}\\n }\\n}\\n\",\n \"language\": \"Tcl\"\n },\n {\n \"code\": \"# Helpers to make construction and listing of a whole tree simpler\\nproc Tree nested {\\n lassign $nested v l r\\n if {$l ne \\\"\\\"} {set l [Tree $l]}\\n if {$r ne \\\"\\\"} {set r [Tree $r]}\\n tree new $v $l $r\\n}\\nproc Listify {tree order} {\\n set list {}\\n $tree $order v {\\n\\tlappend list $v\\n }\\n return $list\\n}\\n\\n# Make a tree, print it a few ways, and destroy the tree\\nset t [Tree {1 {2 {4 7} 5} {3 {6 8 9}}}]\\nputs \\\"preorder: [Listify $t preorder]\\\"\\nputs \\\"inorder: [Listify $t inorder]\\\"\\nputs \\\"postorder: [Listify $t postorder]\\\"\\nputs \\\"level-order: [Listify $t levelorder]\\\"\\n$t destroy\\n\",\n \"language\": \"Tcl\"\n },\n {\n \"code\": \"left=()\\nright=()\\nvalue=()\\n\\n# node node#, left#, right#, value\\n#\\n# if value is empty, use node#\\n\\nnode() {\\n nx=${1:-'Missing node index'}\\n leftx=${2}\\n rightx=${3}\\n val=${4:-$1}\\n value[$nx]=\\\"$val\\\"\\n left[$nx]=\\\"$leftx\\\"\\n right[$nx]=\\\"$rightx\\\"\\n}\\n\\n# define the tree\\n\\nnode 1 2 3\\nnode 2 4 5\\nnode 3 6\\nnode 4 7\\nnode 5\\nnode 6 8 9\\nnode 7\\nnode 8\\nnode 9\\n\\n# walk NODE# ORDER\\n\\nwalk() {\\n local nx=${1-\\\"Missing index\\\"}\\n shift\\n for branch in \\\"$@\\\" ; do\\n case \\\"$branch\\\" in\\n left) if [[ \\\"${left[$nx]}\\\" ]]; then walk ${left[$nx]} $@ ; fi ;;\\n right) if [[ \\\"${right[$nx]}\\\" ]]; then walk ${right[$nx]} $@ ; fi ;;\\n self) printf \\\"%d \\\" \\\"${value[$nx]}\\\" ;;\\n esac\\n done\\n}\\n\\napush() {\\n local var=\\\"$1\\\"\\n eval \\\"$var=( \\\\\\\"\\\\${$var[@]}\\\\\\\" \\\\\\\"$2\\\\\\\" )\\\"\\n}\\n\\nshowname() {\\n printf \\\"%-12s \\\" \\\"$1:\\\"\\n}\\n\\nshowdata() {\\n showname \\\"$1\\\"\\n shift\\n walk \\\"$@\\\"\\n echo ''\\n}\\n\\npreorder() { showdata $FUNCNAME $1 self left right ; }\\ninorder() { showdata $FUNCNAME $1 left self right ; }\\npostorder() { showdata $FUNCNAME $1 left right self ; }\\nlevelorder() {\\n showname 'level-order'\\n queue=( $1 )\\n x=0\\n while [[ $x < ${#queue[*]} ]]; do\\n value=\\\"${queue[$x]}\\\"\\n printf \\\"%d \\\" \\\"$value\\\"\\n for more in \\\"${left[$value]}\\\" \\\"${right[$value]}\\\" ; do\\n if [[ -n \\\"$more\\\" ]]; then\\n\\tapush queue \\\"$more\\\"\\n fi\\n done\\n : $((x++))\\n done\\n echo ''\\n}\\n\\npreorder 1\\ninorder 1\\npostorder 1\\nlevelorder 1\\n\",\n \"language\": \"UNIX-Shell\"\n },\n {\n \"code\": \"preorder: 1 2 4 7 5 3 6 8 9\\ninorder: 7 4 2 5 1 8 6 9 3\\npostorder: 7 4 5 2 8 9 6 3 1\\nlevel-order: 1 2 3 4 5 6 7 8 9\\n\",\n \"language\": \"UNIX-Shell\"\n },\n {\n \"code\": \"tree =\\n\\n1^:<\\n 2^: <4^: <7^: <>, 0>, 5^: <>>,\\n 3^: <6^: <8^: <>, 9^: <>>, 0>>\\n\\npre = ~&dvLPCo\\npost = ~&vLPdNCTo\\nin = ~&vvhPdvtL2CTiQo\\nlev = ~&iNCaadSPfavSLiF3RTaq\\n\\n#cast %nLL\\n\\nmain = <.pre,in,post,lev> tree\\n\",\n \"language\": \"Ursala\"\n },\n {\n \"code\": \"Public Value As Integer\\nPublic LeftChild As TreeItem\\nPublic RightChild As TreeItem\\n\",\n \"language\": \"VBA\"\n },\n {\n \"code\": \"Dim tihead As TreeItem\\n\\nPrivate Function Add(v As Integer, left As TreeItem, right As TreeItem) As TreeItem\\n Dim x As New TreeItem\\n x.Value = v\\n Set x.LeftChild = left\\n Set x.RightChild = right\\n Set Add = x\\nEnd Function\\n\\nPrivate Sub Init()\\n Set tihead = Add(1, _\\n Add(2, _\\n Add(4, _\\n Add(7, Nothing, Nothing), _\\n Nothing), _\\n Add(5, Nothing, Nothing)), _\\n Add(3, _\\n Add(6, _\\n Add(8, Nothing, Nothing), _\\n Add(9, Nothing, Nothing)), _\\n Nothing))\\nEnd Sub\\n\\nPrivate Sub InOrder(ti As TreeItem)\\n If Not ti Is Nothing Then\\n Call InOrder(ti.LeftChild)\\n Debug.Print ti.Value;\\n Call InOrder(ti.RightChild)\\n End If\\nEnd Sub\\n\\nPrivate Sub PreOrder(ti As TreeItem)\\n If Not ti Is Nothing Then\\n Debug.Print ti.Value;\\n Call PreOrder(ti.LeftChild)\\n Call PreOrder(ti.RightChild)\\n End If\\nEnd Sub\\n\\nPrivate Sub PostOrder(ti As TreeItem)\\n If Not ti Is Nothing Then\\n Call PostOrder(ti.LeftChild)\\n Call PostOrder(ti.RightChild)\\n Debug.Print ti.Value;\\n End If\\nEnd Sub\\n\\nPrivate Sub LevelOrder(ti As TreeItem)\\n Dim queue As Object\\n Set queue = CreateObject(\\\"System.Collections.Queue\\\")\\n queue.Enqueue ti\\n Do While (queue.Count > 0)\\n Set next_ = queue.Dequeue\\n Debug.Print next_.Value;\\n If Not next_.LeftChild Is Nothing Then queue.Enqueue next_.LeftChild\\n If Not next_.RightChild Is Nothing Then queue.Enqueue next_.RightChild\\n Loop\\nEnd Sub\\n\\nPublic Sub Main()\\n Init\\n Debug.Print \\\"preorder: \\\";\\n Call PreOrder(tihead)\\n Debug.Print vbCrLf; \\\"inorder: \\\";\\n Call InOrder(tihead)\\n Debug.Print vbCrLf; \\\"postorder: \\\";\\n Call PostOrder(tihead)\\n Debug.Print vbCrLf; \\\"level-order: \\\";\\n Call LevelOrder(tihead)\\nEnd Sub\\n\",\n \"language\": \"VBA\"\n },\n {\n \"code\": \"' 1\\n' / \\\\\\n' / \\\\\\n' / \\\\\\n' 2 3\\n' / \\\\ /\\n' 4 5 6\\n' / / \\\\\\n' 7 8 9\\n'with no pointers available, the binary tree has to be saved in an array\\n' root at index 1\\n' parent index is i\\\\2\\n' children indexes are i*2 and i*2+1\\n' a value of 0 denotes an empty branch\\n\\n Sub print(s):\\n On Error Resume Next\\n WScript.stdout.Write(s)\\n If err= &h80070006& Then WScript.Echo \\\" Please run this script with CScript\\\": WScript.quit\\n End Sub\\n\\n\\n Sub inorder(i)\\n If tree(i*2)<>0 Then inorder(i*2)\\n print tree(i)& vbtab\\n If tree(i*2+1)<>0 Then inorder(i*2+1)\\n End Sub\\n\\n\\n Sub preorder(i)\\n print tree(i)& vbtab\\n If tree(i*2)<>0 Then preorder(i*2)\\n If tree(i*2+1)<>0 Then preorder(i*2+1)\\n End Sub\\n\\n Sub postorder(i)\\n If tree(i*2)<>0 Then postorder(i*2)\\n If tree(i*2+1)<>0 Then postorder(i*2+1)\\n print tree(i)& vbTab\\n End Sub\\n\\n Sub levelorder(x)\\n Dim i\\n For i= 1 To UBound(tree)\\n If tree(i)<>0 Then print tree(i)& vbTab\\n Next\\n End sub\\n\\nDim tree\\n' 1 2 3 4 5 6 7 8 9 1011121314151617181920212223242526\\n' 1 2 2 3 3 3 3 4 4 4 4 4 4 4 4\\ntree=Array(0,1,2,3,4,5,6,0,7,0,0,0,8,9,0,0,0,0,0,0,0,0,0,0,0,0,0,0)\\nprint vbCrLf & \\\"Preorder\\\" & vbcrlf\\npreorder(1)\\nprint vbCrLf & \\\"Inorder\\\" & vbcrlf\\ninorder(1)\\nprint vbCrLf & \\\"Postorder\\\" & vbcrlf\\npostorder(1)\\nprint vbCrLf & \\\"Levelorder\\\" & vbcrlf\\nlevelorder(1)\\n\",\n \"language\": \"VBScript\"\n },\n {\n \"code\": \"class Node {\\n construct new(v) {\\n _v = v\\n _left = null\\n _right = null\\n }\\n\\n value { _v }\\n left { _left }\\n right { _right}\\n\\n left =(n) { _left = n }\\n right= (n) { _right = n }\\n\\n preOrder() {\\n System.write(this)\\n if (_left) _left.preOrder()\\n if (_right) _right.preOrder()\\n }\\n\\n inOrder() {\\n if ( _left) _left.inOrder()\\n System.write(this)\\n if (_right) _right.inOrder()\\n }\\n\\n postOrder() {\\n if (_left) _left.postOrder()\\n if (_right) _right.postOrder()\\n System.write(this)\\n }\\n\\n levelOrder() {\\n var queue = [this]\\n while (true) {\\n var node = queue.removeAt(0)\\n System.write(node)\\n if (node.left) queue.add(node.left)\\n if (node.right) queue.add(node.right)\\n if (queue.isEmpty) break\\n }\\n }\\n\\n exec(name, f) {\\n System.write(name)\\n f.call(this)\\n System.print()\\n }\\n\\n toString { \\\" %(_v)\\\" }\\n}\\n\\nvar nodes = List.filled(10, null)\\nfor (i in 0..9) nodes[i] = Node.new(i)\\nnodes[1].left = nodes[2]\\nnodes[1].right = nodes[3]\\nnodes[2].left = nodes[4]\\nnodes[2].right = nodes[5]\\nnodes[4].left = nodes[7]\\nnodes[3].left = nodes[6]\\nnodes[6].left = nodes[8]\\nnodes[6].right = nodes[9]\\n\\nnodes[1].exec(\\\" preOrder:\\\", Fn.new { |n| n.preOrder() })\\nnodes[1].exec(\\\" inOrder:\\\", Fn.new { |n| n.inOrder() })\\nnodes[1].exec(\\\" postOrder:\\\", Fn.new { |n| n.postOrder() })\\nnodes[1].exec(\\\"level-order:\\\", Fn.new { |n| n.levelOrder() })\\n\",\n \"language\": \"Wren\"\n },\n {\n \"code\": \"def \\\\Node\\\\ Left, Data, Right;\\n\\nproc PreOrder(Node); \\\\Traverse tree at Node in preorder\\nint Node;\\n[if Node # 0 then\\n [IntOut(0, Node(Data)); ChOut(0, ^ );\\n PreOrder(Node(Left));\\n PreOrder(Node(Right));\\n ];\\n];\\n\\nproc InOrder(Node); \\\\Traverse tree at Node in inorder\\nint Node;\\n[if Node # 0 then\\n [InOrder(Node(Left));\\n IntOut(0, Node(Data)); ChOut(0, ^ );\\n InOrder(Node(Right));\\n ];\\n];\\n\\nproc PostOrder(Node); \\\\Traverse tree at Node in postorder\\nint Node;\\n[if Node # 0 then\\n [PostOrder(Node(Left));\\n PostOrder(Node(Right));\\n IntOut(0, Node(Data)); ChOut(0, ^ );\\n ];\\n];\\n\\nproc LevelOrder(Node); \\\\Traverse tree at Node in level-order\\nint Node;\\ndef S=100*3; \\\\size of queue (must be a multiple of 3 for wrap-around)\\nint Q(S), \\\\queue (FIFO)\\n F, E; \\\\fill and empty indexes\\n\\n proc EnQ(Node); \\\\Enqueue Node\\n int Node;\\n [Q(F):= Node(Left); F:= F+1;\\n Q(F):= Node(Data); F:= F+1;\\n Q(F):= Node(Right); F:= F+1;\\n if F >= S then F:= 0;\\n ];\\n\\n proc DeQ; \\\\Dequeue Node\\n [Node(Left):= Q(E); E:= E+1;\\n Node(Data):= Q(E); E:= E+1;\\n Node(Right):= Q(E); E:= E+1;\\n if E >= S then E:= 0;\\n ];\\n\\n[F:= 0; E:= 0; \\\\empty queue\\nEnQ(Node);\\nwhile E # F do\\n [DeQ;\\n IntOut(0, Node(Data)); ChOut(0, ^ );\\n if Node(Left) # 0 then\\n EnQ(Node(Left));\\n if Node(Right) # 0 then\\n EnQ(Node(Right));\\n ];\\n];\\n\\nint Tree;\\n[Tree:= [[ [[0,7,0],4,0], 2, [0,5,0]], 1, [ [[0,8,0], 6, [0,9,0]], 3, 0 ]];\\nText(0, \\\"preorder: \\\"); PreOrder(Tree); CrLf(0);\\nText(0, \\\"inorder: \\\"); InOrder(Tree); CrLf(0);\\nText(0, \\\"postorder: \\\"); PostOrder(Tree); CrLf(0);\\nText(0, \\\"level-order: \\\"); LevelOrder(Tree); CrLf(0);\\n]\\n\",\n \"language\": \"XPL0\"\n },\n {\n \"code\": \"class Node{ var [mixin=Node]left,right; var v;\\n fcn init(val,[Node]l=Void,[Node]r=Void) { v,left,right=vm.arglist }\\n}\\n\\nclass BTree{ var [mixin=Node] root;\\n fcn init(r){ root=r }\\n const VISIT=Void, LEFT=\\\"left\\\", RIGHT=\\\"right\\\";\\n fcn preOrder { traverse(VISIT,LEFT, RIGHT) }\\n fcn inOrder { traverse(LEFT, VISIT,RIGHT) }\\n fcn postOrder { traverse(LEFT, RIGHT,VISIT) }\\n fcn [private] traverse(order){ //--> list of Nodes\\n sink:=List();\\n fcn(sink,[Node]n,order){\\n if(n){ foreach o in (order){\\n\\t if(VISIT==o) sink.write(n);\\n\\t else self.fcn(sink,n.setVar(o),order); // actually get var, eg n.left\\n\\t }}\\n }(sink,root,vm.arglist);\\n sink\\n }\\n fcn levelOrder{ // breadth first\\n sink:=List(); q:=List(root);\\n while(q){\\n n:=q.pop(0); l:=n.left; r:=n.right;\\n\\t sink.write(n);\\n\\t if(l) q.append(l);\\n\\t if(r) q.append(r);\\n }\\n sink\\n }\\n}\\n\",\n \"language\": \"Zkl\"\n },\n {\n \"code\": \"t:=BTree(Node(1,\\n\\t Node(2,\\n\\t Node(4,Node(7)),\\n\\t Node(5)),\\n\\t Node(3,\\n\\t Node(6, Node(8),Node(9)))));\\n\\nt.preOrder() .apply(\\\"v\\\").println(\\\" preorder\\\");\\nt.inOrder() .apply(\\\"v\\\").println(\\\" inorder\\\");\\nt.postOrder() .apply(\\\"v\\\").println(\\\" postorder\\\");\\nt.levelOrder().apply(\\\"v\\\").println(\\\" level-order\\\");\\n\",\n \"language\": \"Zkl\"\n }\n]","isConversational":false},"task_name":{"kind":"string","value":"Tree-traversal"}}},{"rowIdx":1772,"cells":{"solutions":{"kind":"list like","value":[{"code":"---\nfrom: http://rosettacode.org/wiki/Tropical_algebra_overloading\n","language":"00-META"},{"code":"In algebra, a max tropical semiring (also called a max-plus algebra) is the semiring\n(ℝ ∪ -Inf, ⊕, ⊗) containing the ring of real numbers ℝ augmented by negative infinity,\nthe max function (returns the greater of two real numbers), and addition.\n\nIn max tropical algebra, x ⊕ y = max(x, y) and x ⊗ y = x + y. The identity for ⊕\nis -Inf (the max of any number with -infinity is that number), and the identity for ⊗ is 0.\n\n;Task:\n\n* Define functions or, if the language supports the symbols as operators, operators for ⊕ and ⊗ that fit the above description. If the language does not support ⊕ and ⊗ as operators but allows overloading operators for a new object type, you may instead overload + and * for a new min tropical albrbraic type. If you cannot overload operators in the language used, define ordinary functions for the purpose. \n\nShow that 2 ⊗ -2 is 0, -0.001 ⊕ -Inf is -0.001, 0 ⊗ -Inf is -Inf, 1.5 ⊕ -1 is 1.5, and -0.5 ⊗ 0 is -0.5.\n\n* Define exponentiation as serial ⊗, and in general that a to the power of b is a * b, where a is a real number and b must be a positive integer. Use either ↑ or similar up arrow or the carat ^, as an exponentiation operator if this can be used to overload such \"exponentiation\" in the language being used. Calculate 5 ↑ 7 using this definition.\n\n* Max tropical algebra is distributive, so that\n\n a ⊗ (b ⊕ c) equals a ⊗ b ⊕ b ⊗ c, \n\nwhere ⊗ has precedence over ⊕. Demonstrate that 5 ⊗ (8 ⊕ 7) equals 5 ⊗ 8 ⊕ 5 ⊗ 7.\n\n* If the language used does not support operator overloading, you may use ordinary function names such as tropicalAdd(x, y) and tropicalMul(x, y).\n\n\n;See also\n:;*[[https://en.wikipedia.org/wiki/Tropical_semiring#tropical_algebra Tropical algebra]]\n:;*[[https://arxiv.org/pdf/1908.07012.pdf Tropical geometry review article]]\n:;*[[https://en.wikipedia.org/wiki/Operator_overloading Operator overloading]]\n\n\n","language":"00-TASK"},{"code":"BEGIN # tropical algebra operator overloading #\n\n REAL minus inf = - max real;\n\n PROC real plus = ( REAL a, b )REAL: a + b;\n\n BEGIN\n PRIO X = 7; # need to specify the precedence of a new dyadic #\n # operator, X now has the same precedence as * #\n OP X = ( REAL a, b )REAL: real plus( a, b );\n OP + = ( REAL a, b )REAL: IF a < b THEN b ELSE a FI;\n OP ^ = ( REAL a, INT b )REAL:\n IF b < 1\n THEN print( ( \"0 or -ve right operand for \"\"^\"\"\", newline ) ); stop\n ELSE a * b\n FI;\n # additional operators for integer operands #\n OP X = ( INT a, REAL b )REAL: REAL(a) X b;\n OP X = ( REAL a, INT b )REAL: a X REAL(b);\n OP X = ( INT a, b )REAL: REAL(a) X REAL(b);\n OP + = ( INT a, REAL b )REAL: REAL(a) + b;\n OP + = ( REAL a, INT b )REAL: a + REAL(b);\n OP + = ( INT a, b )REAL: REAL(a) + REAL(b);\n OP ^ = ( INT a, b )REAL: REAL(a) ^ b;\n # task test cases #\n\n PROC check = ( REAL result, STRING expr, REAL expected )VOID:\n print( ( expr, IF result = expected THEN \" is TRUE\" ELSE \" is FALSE ****\" FI, newline ) );\n\n check( 2 X -2, \"2 (X) -2 = 0 \", 0 );\n check( -0.001 + minus inf, \"-0.001 (+) -Inf = -0.001 \", -0.001 );\n check( 0 X minus inf, \"0 (X) -Inf = -Inf \", minus inf );\n check( 1.5 + 1, \"1.5 (+) -1 = 1.5 \", 1.5 );\n check( -0.5 X 0, \"-0.5 (X) 0 = -0.5 \", -0.5 );\n print( ( \"5 ^ 7: \", fixed( 5 ^ 7, -6, 1 ), newline ) );\n check( 5 X ( 8 + 7 ), \"5 (X) ( 8 (+) 7 ) = 5 (X) 8 (+) 5 (X) 7\", 5 X 8 + 5 X 7 )\n END\nEND\n","language":"ALGOL-68"},{"code":"#include <iostream>\n#include <optional>\n\nusing namespace std;\n\nclass TropicalAlgebra\n{\n // use an unset std::optional to represent -infinity\n optional<double> m_value;\n\npublic:\n friend std::ostream& operator<<(std::ostream&, const TropicalAlgebra&);\n friend TropicalAlgebra pow(const TropicalAlgebra& base, unsigned int exponent) noexcept;\n\n // create a point that is initialized to -infinity\n TropicalAlgebra() = default;\n\n // construct with a value\n explicit TropicalAlgebra(double value) noexcept\n : m_value{value} {}\n\n // add a value to this one ( p+=q ). it is common to also overload\n // the += operator when overloading +\n TropicalAlgebra& operator+=(const TropicalAlgebra& rhs) noexcept\n {\n if(!m_value)\n {\n // this point is -infinity so the other point is max\n *this = rhs;\n }\n else if (!rhs.m_value)\n {\n // since rhs is -infinity this point is max\n }\n else\n {\n // both values are valid, find the max\n *m_value = max(*rhs.m_value, *m_value);\n }\n\n return *this;\n }\n\n // multiply this value by another (p *= q)\n TropicalAlgebra& operator*=(const TropicalAlgebra& rhs) noexcept\n {\n if(!m_value)\n {\n // since this value is -infinity this point does not need to be\n // modified\n }\n else if (!rhs.m_value)\n {\n // the other point is -infinity, make this -infinity too\n *this = rhs;\n }\n else\n {\n *m_value += *rhs.m_value;\n }\n\n return *this;\n }\n};\n\n// add values (p + q)\ninline TropicalAlgebra operator+(TropicalAlgebra lhs, const TropicalAlgebra& rhs) noexcept\n{\n // implemented using the += operator defined above\n lhs += rhs;\n return lhs;\n}\n\n// multiply values (p * q)\ninline TropicalAlgebra operator*(TropicalAlgebra lhs, const TropicalAlgebra& rhs) noexcept\n{\n lhs *= rhs;\n return lhs;\n}\n\n// pow is the idomatic way for exponentiation in C++\ninline TropicalAlgebra pow(const TropicalAlgebra& base, unsigned int exponent) noexcept\n{\n auto result = base;\n for(unsigned int i = 1; i < exponent; i++)\n {\n // compute the power by successive multiplication\n result *= base;\n }\n return result;\n}\n\n// print the point\nostream& operator<<(ostream& os, const TropicalAlgebra& pt)\n{\n if(!pt.m_value) cout << \"-Inf\\n\";\n else cout << *pt.m_value << \"\\n\";\n return os;\n}\n\nint main(void) {\n const TropicalAlgebra a(-2);\n const TropicalAlgebra b(-1);\n const TropicalAlgebra c(-0.5);\n const TropicalAlgebra d(-0.001);\n const TropicalAlgebra e(0);\n const TropicalAlgebra h(1.5);\n const TropicalAlgebra i(2);\n const TropicalAlgebra j(5);\n const TropicalAlgebra k(7);\n const TropicalAlgebra l(8);\n const TropicalAlgebra m; // -Inf\n\n cout << \"2 * -2 == \" << i * a;\n cout << \"-0.001 + -Inf == \" << d + m;\n cout << \"0 * -Inf == \" << e * m;\n cout << \"1.5 + -1 == \" << h + b;\n cout << \"-0.5 * 0 == \" << c * e;\n cout << \"pow(5, 7) == \" << pow(j, 7);\n cout << \"5 * (8 + 7)) == \" << j * (l + k);\n cout << \"5 * 8 + 5 * 7 == \" << j * l + j * k;\n}\n","language":"C++"},{"code":"using System;\n\npublic class Program\n{\n public static void Main(string[] args)\n {\n var a = new Tropical(-2);\n var b = new Tropical(-1);\n var c = new Tropical(-0.5);\n var d = new Tropical(-0.001);\n var e = new Tropical(0);\n var f = new Tropical(1.5);\n var g = new Tropical(2);\n var h = new Tropical(5);\n var i = new Tropical(7);\n var j = new Tropical(8);\n var k = new Tropical(); // Represents -Inf\n\n Console.WriteLine(\"2 x -2 = \" + g.Multiply(a));\n Console.WriteLine(\"-0.001 + -Inf = \" + d.Add(k));\n Console.WriteLine(\"0 x -Inf = \" + e.Multiply(k));\n Console.WriteLine(\"1.5 + -1 = \" + f.Add(b));\n Console.WriteLine(\"-0.5 x 0 = \" + c.Multiply(e));\n\n Console.WriteLine();\n Console.WriteLine(\"5^7 = \" + h.Power(7));\n\n Console.WriteLine();\n Console.WriteLine(\"5 * ( 8 + 7 ) = \" + h.Multiply(j.Add(i)));\n Console.WriteLine(\"5 * 8 + 5 * 7 = \" + h.Multiply(j).Add(h.Multiply(i)));\n }\n}\n\npublic class Tropical\n{\n private double? number;\n\n public Tropical(double number)\n {\n this.number = number;\n }\n\n public Tropical()\n {\n this.number = null; // Represents -Inf\n }\n\n public override string ToString()\n {\n return number.HasValue ? ((int)number.Value).ToString() : \"-Inf\";\n }\n\n public Tropical Add(Tropical other)\n {\n if (!number.HasValue) return other;\n if (!other.number.HasValue) return this;\n\n return number > other.number ? this : other;\n }\n\n public Tropical Multiply(Tropical other)\n {\n if (number.HasValue && other.number.HasValue)\n {\n return new Tropical(number.Value + other.number.Value);\n }\n\n return new Tropical();\n }\n\n public Tropical Power(int exponent)\n {\n if (exponent <= 0)\n {\n throw new ArgumentException(\"Power must be positive\", nameof(exponent));\n }\n\n Tropical result = this;\n for (int i = 1; i < exponent; i++)\n {\n result = result.Multiply(this);\n }\n\n return result;\n }\n}\n","language":"C-sharp"},{"code":"USING: io kernel math math.order present prettyprint sequences\ntyped ;\n\nALIAS: ⊕ max\nALIAS: ⊗ +\nPREDICATE: posint < integer 0 > ;\nTYPED: ↑ ( x: real n: posint -- y: real ) * ;\n\n: show ( quot -- )\n dup present rest but-last \"⟶ \" append write call . ; inline\n\n{\n [ 2 -2 ⊗ ]\n [ -0.001 -1/0. ⊕ ]\n [ 0 -1/0. ⊗ ]\n [ 1.5 -1 ⊕ ]\n [ -0.5 0 ⊗ ]\n [ 5 7 ↑ ]\n [ 8 7 ⊕ 5 ⊗ ]\n [ 5 8 ⊗ 5 7 ⊗ ⊕ ]\n [ 8 7 ⊕ 5 ⊗ 5 8 ⊗ 5 7 ⊗ ⊕ = ]\n} [ show ] each\n","language":"Factor"},{"code":"#define Inf 9223372036854775807\n#define tropicalAdd(x,y) iif((x > y), (x), (y))\n#define tropicalMul(x,y) (x + y)\n#define tropicalExp(x,y) iif(int(y) > 0, (x * y), 0)\n\nPrint \"tropicalMul(2,-2) = \"; tropicalMul(2,-2)\nPrint \"tropicalAdd(-0.001,-Inf) = \"; tropicalAdd(-0.001,-Inf)\nPrint \"tropicalMul(0,-Inf) = \"; tropicalMul(0,-Inf)\nPrint \"tropicalAdd(1.5,-1) = \"; tropicalAdd(1.5,-1)\nPrint \"tropicalMul(-0.5,0) = \"; tropicalMul(-0.5,0)\nPrint \"tropicalExp(5,7) = \"; tropicalExp(5,7)\nPrint \"tropicalMul(5,tropicalAdd(8,7)) = \"; tropicalMul(5,tropicalAdd(8,7))\nPrint \"tropicalAdd(tropicalMul(5,8),tropicalMul(5,7)) = \"; tropicalAdd(tropicalMul(5,8),tropicalMul(5,7))\nPrint \"tropicalMul(5,tropicalAdd(8,7)) = tropicalAdd(tropicalMul(5,8),tropicalMul(5,7)) = \"; _\nCBool(tropicalMul(5,tropicalAdd(8,7)) = tropicalAdd(tropicalMul(5,8),tropicalMul(5,7)))\nSleep\n","language":"FreeBASIC"},{"code":"package main\n\nimport (\n \"fmt\"\n \"log\"\n \"math\"\n)\n\nvar MinusInf = math.Inf(-1)\n\ntype MaxTropical struct{ r float64 }\n\nfunc newMaxTropical(r float64) MaxTropical {\n if math.IsInf(r, 1) || math.IsNaN(r) {\n log.Fatal(\"Argument must be a real number or negative infinity.\")\n }\n return MaxTropical{r}\n}\n\nfunc (t MaxTropical) eq(other MaxTropical) bool {\n return t.r == other.r\n}\n\n// equivalent to ⊕ operator\nfunc (t MaxTropical) add(other MaxTropical) MaxTropical {\n if t.r == MinusInf {\n return other\n }\n if other.r == MinusInf {\n return t\n }\n return newMaxTropical(math.Max(t.r, other.r))\n}\n\n// equivalent to ⊗ operator\nfunc (t MaxTropical) mul(other MaxTropical) MaxTropical {\n if t.r == 0 {\n return other\n }\n if other.r == 0 {\n return t\n }\n return newMaxTropical(t.r + other.r)\n}\n\n// exponentiation function\nfunc (t MaxTropical) pow(e int) MaxTropical {\n if e < 1 {\n log.Fatal(\"Exponent must be a positive integer.\")\n }\n if e == 1 {\n return t\n }\n p := t\n for i := 2; i <= e; i++ {\n p = p.mul(t)\n }\n return p\n}\n\nfunc (t MaxTropical) String() string {\n return fmt.Sprintf(\"%g\", t.r)\n}\n\nfunc main() {\n // 0 denotes ⊕ and 1 denotes ⊗\n data := [][]float64{\n {2, -2, 1},\n {-0.001, MinusInf, 0},\n {0, MinusInf, 1},\n {1.5, -1, 0},\n {-0.5, 0, 1},\n }\n for _, d := range data {\n a := newMaxTropical(d[0])\n b := newMaxTropical(d[1])\n if d[2] == 0 {\n fmt.Printf(\"%s ⊕ %s = %s\\n\", a, b, a.add(b))\n } else {\n fmt.Printf(\"%s ⊗ %s = %s\\n\", a, b, a.mul(b))\n }\n }\n\n c := newMaxTropical(5)\n fmt.Printf(\"%s ^ 7 = %s\\n\", c, c.pow(7))\n\n d := newMaxTropical(8)\n e := newMaxTropical(7)\n f := c.mul(d.add(e))\n g := c.mul(d).add(c.mul(e))\n fmt.Printf(\"%s ⊗ (%s ⊕ %s) = %s\\n\", c, d, e, f)\n fmt.Printf(\"%s ⊗ %s ⊕ %s ⊗ %s = %s\\n\", c, d, c, e, g)\n fmt.Printf(\"%s ⊗ (%s ⊕ %s) == %s ⊗ %s ⊕ %s ⊗ %s is %t\\n\", c, d, e, c, d, c, e, f.eq(g))\n}\n","language":"Go"},{"code":"{-# LANGUAGE DataKinds, DerivingVia, FlexibleInstances, StandaloneDeriving #-}\n\nimport Prelude hiding ((^))\nimport Data.Monoid (Sum(Sum))\nimport Data.Number.CReal (CReal)\nimport Data.Semiring (Semiring, (^), plus, times)\nimport Data.Semiring.Tropical (Tropical(..), Extrema(Maxima))\n\n-- Create our max-plus semiring over the constructive reals (CReal), using the\n-- Tropical type from the semirings package. (We'll put all the boilerplate\n-- code after the main function.)\n--\n-- 'Maxima indicates that our semiring is a max-plus semiring, where the plus\n-- function is maximum, the times function is addition, and the Infinity\n-- constructor is treated as -∞.\n\nnewtype MaxPlus = MaxPlus (Tropical 'Maxima CReal)\n\n-- Symbolic aliases to satisfy the problem requirements.\n\n(⊕), (⊗) :: MaxPlus -> MaxPlus -> MaxPlus\n(⊕) = plus\n(⊗) = times\n\ninfixl 6 ⊕\ninfixl 7 ⊗\n\n(↑) :: Integral a => MaxPlus -> a -> MaxPlus\n(↑) = (^)\n\ninfixr 8 ↑\n\nmain :: IO ()\nmain = do\n -- Description Equation Expected Value\n test \"2 ⊗ (-2) == 0\" (2 ⊗ (-2)) 0\n test \"-0.001 ⊕ -Inf == -0.001\" (-0.001 ⊕ MaxPlus Infinity) (-0.001)\n test \"0 ⊗ -Inf == -Inf\" (0 ⊗ MaxPlus Infinity) (MaxPlus Infinity)\n test \"1.5 ⊕ -1 == 1.5\" (1.5 ⊕ (-1)) 1.5\n test \"-0.5 ⊗ 0 == -0.5\" ((-0.5) ⊗ 0) (-0.5)\n test \"5 ↑ 7 == 35\" (5 ↑ 7) 35\n test \"5 ⊗ (8 ⊕ 7) == 13\" (5 ⊗ (8 ⊕ 7)) 13\n test \"5 ⊗ 8 ⊕ 5 ⊗ 7 == 13\" (5 ⊗ 8 ⊕ 5 ⊗ 7) 13\n\n--------------------------------------------------------------------------------\n\n-- Boilerplate, utility functions, etc.\n\n-- Bootstrap our way to having MaxPlus be a Semiring instance. Also, derive\n-- Eq and Ord instances.\nderiving via (Sum CReal) instance Semigroup CReal\nderiving via (Sum CReal) instance Monoid CReal\nderiving via Tropical 'Maxima CReal instance Semiring MaxPlus\nderiving via Tropical 'Maxima CReal instance Eq MaxPlus\nderiving via Tropical 'Maxima CReal instance Ord MaxPlus\n\n-- Create a Num instance for MaxPlus mostly so that we can use fromInteger and\n-- negate. This lets us treat the numeric literal -2, for example, as a value\n-- in our semiring.\ninstance Num MaxPlus where\n (+) = plus\n (*) = times\n abs = opError \"absolute value\"\n signum (MaxPlus Infinity) = -1\n signum x = wrap . signum . unwrap $ x\n fromInteger = wrap . fromInteger\n negate (MaxPlus Infinity) = opError \"negation of -Inf\"\n negate x = wrap . negate . unwrap $ x\n\n-- Similar to Num, this will let us treat numeric literals, like 0.001, as\n-- MaxPlus values.\ninstance Fractional MaxPlus where\n fromRational = wrap . fromRational\n recip _ = opError \"reciprocal\"\n\ninstance Show MaxPlus where\n show (MaxPlus Infinity) = \"-Inf\"\n show x = show . unwrap $ x\n\n-- Test two expressions for equality.\ntest :: String -> MaxPlus -> MaxPlus -> IO ()\ntest s actual expected = do\n putStr $ \"Expecting \" ++ s ++ \". Got \" ++ show actual ++ \" \"\n putStrLn $ if actual == expected then \"✔\" else \"✘\"\n\n-- Utility functions.\n\nwrap :: CReal -> MaxPlus\nwrap = MaxPlus . Tropical\n\nunwrap :: MaxPlus -> CReal\nunwrap (MaxPlus (Tropical x)) = x\nunwrap (MaxPlus Infinity) = error \"can't convert -Inf to a CReal\"\n\nopError :: String -> a\nopError op = error $ op ++ \" is not defined on a max-plus semiring\"\n","language":"Haskell"},{"code":"import java.util.Optional;\n\npublic final class TropicalAlgebra {\n\n\tpublic static void main(String[] aArgs) {\n\t\tfinal Tropical a = new Tropical(-2);\n\t\tfinal Tropical b = new Tropical(-1);\n\t\tfinal Tropical c = new Tropical(-0.5);\n\t\tfinal Tropical d = new Tropical(-0.001);\n\t\tfinal Tropical e = new Tropical(0);\n\t\tfinal Tropical f = new Tropical(1.5);\n\t\tfinal Tropical g = new Tropical(2);\n\t\tfinal Tropical h = new Tropical(5);\n\t\tfinal Tropical i = new Tropical(7);\n\t\tfinal Tropical j = new Tropical(8);\n\t\tfinal Tropical k = new Tropical();\n\t\t\n\t\tSystem.out.println(\"2 x -2 = \" + g.multiply(a));\n\t\tSystem.out.println(\"-0.001 + -Inf = \" + d.add(k));\n\t\tSystem.out.println(\"0 x -Inf = \" + e.multiply(k));\n\t\tSystem.out.println(\"1.5 + -1 = \" + f.add(b));\n\t\tSystem.out.println(\"-0.5 x 0 = \" + c.multiply(e));\n\t\t\n\t\tSystem.out.println();\n\t\tSystem.out.println(\"5^7 = \" + h.power(7));\t\t\n\t\t\n\t\tSystem.out.println();\n\t\tSystem.out.println(\"5 * ( 8 + 7 ) = \" + h.multiply(j.add(i)));\n\t\tSystem.out.println(\"5 * 8 + 5 * 7 = \" + h.multiply(j).add(h.multiply(i)));\t\t\n\t}\n\n}\n\nfinal class Tropical {\n\t\n\tpublic Tropical(Number aNumber) {\n\t\tif ( aNumber == null ) {\n\t\t\tthrow new IllegalArgumentException(\"Number cannot be null\");\n\t\t}\n\t\t\n\t\toptional = Optional.of(aNumber);\n\t}\n\t\n\tpublic Tropical() {\n\t\toptional = Optional.empty();\n\t}\n\t\n\t@Override\n\tpublic String toString() {\n\t\tif ( optional.isEmpty() ) {\n\t\t\treturn \"-Inf\";\n\t\t}\n\t\n\t\tString value = String.valueOf(optional.get());\n\t\tfinal int index = value.indexOf(\".\");\n\t\tif ( index >= 0 ) {\n\t\t\tvalue = value.substring(0, index);\n\t\t}\n\t\t\n\t\treturn value;\n\t}\n\t\n\tpublic Tropical add(Tropical aOther) {\n\t\tif ( aOther.optional.isEmpty() ) {\n\t\t\treturn this;\n\t\t}\n\t\t\n\t\tif ( optional.isEmpty() ) {\n\t\t\treturn aOther;\n\t\t}\n\t\t\n\t\tif ( optional.get().doubleValue() > aOther.optional.get().doubleValue() ) {\n\t\t\treturn this;\n\t\t}\t\t\n\t\treturn aOther;\n\t}\n\t\n\tpublic Tropical multiply(Tropical aOther) {\n\t\tif ( optional.isPresent() && aOther.optional.isPresent() ) {\n\t\t\tdouble result = optional.get().doubleValue() + aOther.optional.get().doubleValue();\t\t\t\n\t\t\treturn new Tropical(result);\n\t\t}\n\t\t\n\t\treturn new Tropical();\n\t}\n\t\n\tpublic Tropical power(int aExponent) {\n\t\tif ( aExponent <= 0 ) {\n\t\t\tthrow new IllegalArgumentException(\"Power must be positive\");\n\t\t}\n\t\t\n\t\tTropical result = this;;\n\t for ( int i = 1; i < aExponent; i++ ) {\n\t result = result.multiply(this);\n\t }\n\t\n\t return result;\n\t}\n\t\n\tprivate Optional<Number> optional;\n\t\n}\n","language":"Java"},{"code":"# ⊕ operator\ndef Tropical::add($other):\n [., $other] | max;\n\n# ⊗ operator\ndef Tropical::mul($other):\n . + $other;\n\n# Tropical exponentiation\ndef Tropical::exp($e):\n if ($e|type) == \"number\" and ($e | . == floor)\n then if ($e == 1) then .\n else . as $in\n | reduce range (2;1+$e) as $i (.; Tropical::mul($in))\n end\n else \"Tropical::exp(\\($e)): argument must be a positive integer.\" | error\n end ;\n\n# pretty print a number as a Tropical number\ndef pp:\n if isinfinite then if . > 0 then \"infinity\" else \"-infinity\" end\n else .\n end;\n\ndef data: [\n [2, -2, \"⊗\"],\n [-0.001, -infinite, \"⊕\"],\n [0, -infinite, \"⊗\"],\n [1.5, -1, \"⊕\"],\n [-0.5, 0, \"⊗\"]\n];\n\ndef task1:\n data[] as [$a, $b, $op]\n | if $op == \"⊕\"\n then \"\\($a|pp) ⊕ \\($b|pp) = \\($a | Tropical::add($b) | pp)\"\n else\n \"\\($a|pp) ⊗ \\($b|pp) = \\($a | Tropical::mul($b) | pp)\"\n end;\n\ndef task2:\n 5 as $c\n | \"\\($c|pp) ^ 7 = \\($c | Tropical::exp(7) | pp)\";\n\ndef task3:\n 5 as $c\n | 8 as $d\n | 7 as $e\n | ($c | Tropical::mul($d) | Tropical::add($e)) as $f\n | ($c | Tropical::mul($d) | Tropical::add( $c | Tropical::mul($e))) as $g\n | \"\\($c) ⊗ (\\($d) ⊕ \\($e)) = \\($f | pp)\",\n \"\\($c) ⊗ \\($d) ⊕ \\($c) ⊗ \\($e) = \\($g | pp)\",\n \"\\($c) ⊗ (\\($d) ⊕ \\($e)) == \\($c) ⊗ \\($d) ⊕ \\($c) ⊗ \\($e) is \\($f == $g)\" ;\n\ntask1, task2, task3\n","language":"Jq"},{"code":"⊕(x, y) = max(x, y)\n⊗(x, y) = x + y\n↑(x, y) = (@assert round(y) == y && y > 0; x * y)\n\n@show 2 ⊗ -2\n@show -0.001 ⊕ -Inf\n@show 0 ⊗ -Inf\n@show 1.5 ⊕ -1\n@show -0.5 ⊗ 0\n@show 5↑7\n@show 5 ⊗ (8 ⊕ 7)\n@show 5 ⊗ 8 ⊕ 5 ⊗ 7\n@show 5 ⊗ (8 ⊕ 7) == 5 ⊗ 8 ⊕ 5 ⊗ 7\n","language":"Julia"},{"code":"import strformat\n\ntype MaxTropical = distinct float\n\nconst MinusInfinity = MaxTropical NegInf\n\n# Borrowed functions.\nfunc `<=`(a, b: MaxTropical): bool {.borrow.} # required by \"max\".\nfunc `==`(a, b: MaxTropical): bool {.borrow}\nfunc `$`(a: MaxTropical): string {.borrow.}\n\n# ⊕ operator.\nfunc `+`(a, b: MaxTropical): MaxTropical = max(a, b)\n\n# ⊗ operator.\nfunc `*`(a, b: MaxTropical): MaxTropical = MaxTropical float(a) + float(b)\n\n# ⊗= operator, used here for exponentiation.\nfunc `*=`(a: var MaxTropical; b: MaxTropical) =\n float(a) += float(b)\n\n# ↑ operator (this can be seen as an overloading of the ^ operator from math module).\nfunc `^`(a: MaxTropical; b: Positive): MaxTropical =\n case b\n of 1: return a\n of 2: return a * a\n of 3: return a * a * a\n else:\n result = a\n for n in 2..b:\n result *= a\n\n\necho &\"2 ⊗ -2 = {MaxTropical(2) * MaxTropical(-2)}\"\necho &\"-0.001 ⊕ -Inf = {MaxTropical(-0.001) + MinusInfinity}\"\necho &\"0 ⊗ -Inf = {MaxTropical(0) * MinusInfinity}\"\necho &\"1.5 ⊕ -1 = {MaxTropical(1.5) + MaxTropical(-1)}\"\necho &\"-0.5 ⊗ 0 = {MaxTropical(-0.5) * MaxTropical(0)}\"\necho &\"5↑7 = {MaxTropical(5)^7}\"\necho()\nlet x = MaxTropical(5) * (MaxTropical(8) + MaxTropical(7))\nlet y = MaxTropical(5) * MaxTropical(8) + MaxTropical(5) * MaxTropical(7)\necho &\"5 ⊗ (8 ⊕ 7) = {x}\"\necho &\"5 ⊗ 8 ⊕ 5 ⊗ 7 = {y}\"\necho &\"So 5 ⊗ (8 ⊕ 7) equals 5 ⊗ 8 ⊕ 5 ⊗ 7 is {x == y}.\"\n","language":"Nim"},{"code":"(phixonline)-->\n <span style=\"color: #008080;\">with</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> <span style=\"color: #000080;font-style:italic;\">-- (minor/backportable bugfix rqd to handling of -inf in printf[1])</span>\n <span style=\"color: #008080;\">constant</span> <span style=\"color: #000000;\">tropicalAdd</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">max</span><span style=\"color: #0000FF;\">,</span>\n <span style=\"color: #000000;\">tropicalMul</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">sq_add</span><span style=\"color: #0000FF;\">,</span>\n <span style=\"color: #000000;\">tropicalExp</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">sq_mul</span><span style=\"color: #0000FF;\">,</span>\n <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: #7060A8;\">printf</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #008000;\">\"tropicalMul(2,-2) = %g\\n\"</span><span style=\"color: #0000FF;\">,</span>\n <span style=\"color: #0000FF;\">{</span><span style=\"color: #000000;\">tropicalMul</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: #7060A8;\">printf</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #008000;\">\"tropicalAdd(-0.001,-inf) = %g\\n\"</span><span style=\"color: #0000FF;\">,</span>\n <span style=\"color: #0000FF;\">{</span><span style=\"color: #000000;\">tropicalAdd</span><span style=\"color: #0000FF;\">(-</span><span style=\"color: #000000;\">0.001</span><span style=\"color: #0000FF;\">,-</span><span style=\"color: #000000;\">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;\">\"tropicalMul(0,-inf) = %g\\n\"</span><span style=\"color: #0000FF;\">,</span>\n <span style=\"color: #0000FF;\">{</span><span style=\"color: #000000;\">tropicalMul</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">0</span><span style=\"color: #0000FF;\">,-</span><span style=\"color: #000000;\">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;\">\"tropicalAdd(1.5,-1) = %g\\n\"</span><span style=\"color: #0000FF;\">,</span>\n <span style=\"color: #0000FF;\">{</span><span style=\"color: #000000;\">tropicalAdd</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">1.5</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;\">\"tropicalMul(-0.5,0) = %g\\n\"</span><span style=\"color: #0000FF;\">,</span>\n <span style=\"color: #0000FF;\">{</span><span style=\"color: #000000;\">tropicalMul</span><span style=\"color: #0000FF;\">(-</span><span style=\"color: #000000;\">0.5</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">0</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;\">\"tropicalExp(5,7) = %g\\n\"</span><span style=\"color: #0000FF;\">,</span>\n <span style=\"color: #0000FF;\">{</span><span style=\"color: #000000;\">tropicalExp</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>\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;\">\"tropicalMul(5,tropicalAdd(8,7)) = %g\\n\"</span><span style=\"color: #0000FF;\">,</span>\n <span style=\"color: #0000FF;\">{</span><span style=\"color: #000000;\">tropicalMul</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">5</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">tropicalAdd</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 <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;\">\"tropicalAdd(tropicalMul(5,8),tropicalMul(5,7)) = %g\\n\"</span><span style=\"color: #0000FF;\">,</span>\n <span style=\"color: #0000FF;\">{</span><span style=\"color: #000000;\">tropicalAdd</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">tropicalMul</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;\">tropicalMul</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>\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;\">\"tropicalMul(5,tropicalAdd(8,7)) == tropicalAdd(tropicalMul(5,8),tropicalMul(5,7)) = %t\\n\"</span><span style=\"color: #0000FF;\">,</span>\n <span style=\"color: #0000FF;\">{</span><span style=\"color: #000000;\">tropicalMul</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">5</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">tropicalAdd</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> <span style=\"color: #0000FF;\">==</span> <span style=\"color: #000000;\">tropicalAdd</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">tropicalMul</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;\">tropicalMul</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>\n<!--\n","language":"Phix"},{"code":"from numpy import Inf\n\nclass MaxTropical:\n \"\"\"\n Class for max tropical algebra.\n x + y is max(x, y) and X * y is x + y\n \"\"\"\n def __init__(self, x=0):\n self.x = x\n\n def __str__(self):\n return str(self.x)\n\n def __add__(self, other):\n return MaxTropical(max(self.x, other.x))\n\n def __mul__(self, other):\n return MaxTropical(self.x + other.x)\n\n def __pow__(self, other):\n assert other.x // 1 == other.x and other.x > 0, \"Invalid Operation\"\n return MaxTropical(self.x * other.x)\n\n def __eq__(self, other):\n return self.x == other.x\n\n\nif __name__ == \"__main__\":\n a = MaxTropical(-2)\n b = MaxTropical(-1)\n c = MaxTropical(-0.5)\n d = MaxTropical(-0.001)\n e = MaxTropical(0)\n f = MaxTropical(0.5)\n g = MaxTropical(1)\n h = MaxTropical(1.5)\n i = MaxTropical(2)\n j = MaxTropical(5)\n k = MaxTropical(7)\n l = MaxTropical(8)\n m = MaxTropical(-Inf)\n\n print(\"2 * -2 == \", i * a)\n print(\"-0.001 + -Inf == \", d + m)\n print(\"0 * -Inf == \", e * m)\n print(\"1.5 + -1 == \", h + b)\n print(\"-0.5 * 0 == \", c * e)\n print(\"5**7 == \", j**k)\n print(\"5 * (8 + 7)) == \", j * (l + k))\n print(\"5 * 8 + 5 * 7 == \", j * l + j * k)\n print(\"5 * (8 + 7) == 5 * 8 + 5 * 7\", j * (l + k) == j * l + j * k)\n","language":"Python"},{"code":"\"%+%\"<- function(x, y) max(x, y)\n\n\"%*%\" <- function(x, y) x + y\n\n\"%^%\" <- function(x, y) {\n stopifnot(round(y) == y && y > 0)\n x * y\n}\n\ncat(\"2 %*% -2 ==\", 2 %*% -2, \"\\n\")\ncat(\"-0.001 %+% -Inf ==\", 0.001 %+% -Inf, \"\\n\")\ncat(\"0 %*% -Inf ==\", 0 %*% -Inf, \"\\n\")\ncat(\"1.5 %+% -1 ==\", 1.5 %+% -1, \"\\n\")\ncat(\"-0.5 %*% 0 ==\", -0.5 %*% 0, \"\\n\")\ncat(\"5^7 ==\", 5 %^% 7, \"\\n\")\ncat(\"5 %*% (8 %+% 7)) ==\", 5 %*% (8 %+% 7), \"\\n\")\ncat(\"5 %*% 8 %+% 5 %*% 7 ==\", (5 %*% 8) %+% (5 %*% 7), \"\\n\")\ncat(\"5 %*% 8 %+% 5 %*% 7 == 5 %*% (8 %+% 7))\", 5 %*% (8 %+% 7) == (5 %*% 8) %+% (5 %*% 7), \"\\n\")\n","language":"R"},{"code":"sub infix:<⊕> (Real $a, Real $b) is equiv(&[+]) { $a max $b }\nsub infix:<⊗> (Real $a, Real $b) is equiv(&[×]) { $a + $b }\nsub infix:<↑> (Real $a, Int $b where * ≥ 0) is equiv(&[**]) { [⊗] $a xx $b }\n\nuse Test;\n\nis-deeply( 2 ⊗ -2, 0, '2 ⊗ -2 == 0' );\nis-deeply( -0.001 ⊕ -Inf, -0.001, '-0.001 ⊕ -Inf == -0.001' );\nis-deeply( 0 ⊗ -Inf, -Inf, '0 ⊗ -Inf == -Inf' );\nis-deeply( 1.5 ⊕ -1, 1.5, '1.5 ⊕ -1 == 1.5' );\nis-deeply( -0.5 ⊗ 0, -0.5, '-0.5 ⊗ 0 == -0.5' );\nis-deeply( 5 ↑ 7, 35, '5 ↑ 7 == 35' );\nis-deeply( 5 ⊗ (8 ⊕ 7), 5 ⊗ 8 ⊕ 5 ⊗ 7, '5 ⊗ (8 ⊕ 7) == 5 ⊗ 8 ⊕ 5 ⊗ 7');\nis-deeply( 5 ↑ 7 ⊕ 6 ↑ 6, 36, '5 ↑ 7 ⊕ 6 ↑ 6 == 36');\n","language":"Raku"},{"code":"/*REXX pgm demonstrates max tropical semi─ring with overloading: topAdd, topMul, topExp.*/\ncall negInf; @x= '(x)'; @a= '(+)'; @h= '(^)'; @e= 'expression'; @c= 'comparison'\nnumeric digits 1000 /*be able to handle negative infinity. */\nx= 2 ; y= -2 ; say is(@x) LS(x) RS(y) $Mul(x,y)\nx= -0.001 ; y= nInf ; say is(@a) LS(x) RS(y) $Add(x,y)\nx= 0 ; y= nInf ; say is(@x) LS(x) RS(y) $Mul(x,y)\nx= 1.5 ; y= -1 ; say is(@a) LS(x) RS(y) $Add(x,y)\nx= -0.5 ; y= 0 ; say is(@x) LS(x) RS(y) $Mul(x,y)\nx= 5 ; y= 7 ; say is(@h) LS(x) RS(y) $Exp(x,y)\nx= 5 ; y= $Add(8,7); say is(@e) LS(x @x) RS(@a\"(8,7)\") $Mul(x,y)\nx= $Mul(5,8); y= $Mul(5,7); say is(@e) LS(@x\"(5,8)\" @a) RS(@x'(5,7)') $Add(x,y)\nx= 5 ; y= $Add(8,7); blanks= left('', 26)\na= $Mul(5,8); b= $Mul(5,7); say is(@c) LS(x @x) @a\"(8,7)\" ' compared to'\n say blanks LS(@x\"(5,8)\") RS(@a @x'(5,7)') ,\n $ToF( $Mul(x,y) == $Add(a,b) )\nexit 0 /*stick a fork in it, we're all done. */\n/*──────────────────────────────────────────────────────────────────────────────────────*/\nABnInf: if b=='' then b=a; __= negInf(); _= nInf(); return a==__ | a==_ | b==__ | b==_\nnegInf: negInf= '-1e' || (digits()-1); call nInf; return negInf /*simulate a -∞ value.*/\nnInf: nInf= '-∞'; return nInf /*return the \"diagraph\": -∞ */\nnotNum: call sayErr \"argument isn't numeric or minus infinity:\", arg(1) /*tell error.*/\nis: return 'max tropical' center(arg(1), 10) \"of\" /*center what is to be shown*/\nLS: return right( arg(1), 12) ' with ' /*pad left─side of equation*/\nRS: return left( arg(1), 12) ' ───► ' /* \" right─side \" \" */\nsayErr: say; say '***error***' arg(1) arg(2); say; exit 13 /*issue error message──►term*/\n$Add: procedure; parse arg a,b; return max(isRing(a),isRing(b)) /*simulate max add ƒ */\n$ToF: procedure; parse arg ?; return word('false true',1+?) /*return true │ false.*/\n/*──────────────────────────────────────────────────────────────────────────────────────*/\n$Exp: procedure; parse arg a,b; if ABnInf() then return _ /*return the \"diagraph\": -∞ */\n return isRing(a) * isRing(b) /*simulate exponentiation ƒ */\n/*──────────────────────────────────────────────────────────────────────────────────────*/\n$Mul: procedure; parse arg a,b; if ABnInf() then return _ /*return the \"diagraph\": -∞ */\n return isRing(a) + isRing(b) /*simulate multiplication ƒ */\n/*──────────────────────────────────────────────────────────────────────────────────────*/\nisNum: procedure; parse arg a,b; if ABnInf() then a= negInf() /*replace A with -∞? */\n return datatype(a, 'Num') /*Arg numeric? Return 1 or 0*/\n/*──────────────────────────────────────────────────────────────────────────────────────*/\nisRing: procedure; parse arg a,b; if ABnInf() then return negInf /*return -∞ */\n if isNum(a) | a==negInf() then return a; call notNum a /*show error.*/\n","language":"REXX"},{"code":"import math\n\nconst (\nminus_inf = math.inf(-1)\n)\n\nstruct MaxTropical { r f64 }\n\nfn new_max_tropical(r f64) ?MaxTropical {\n if math.is_inf(r, 1) || math.is_nan(r) {\n return error(\"Argument must be a real number or negative infinity.\")\n }\n return MaxTropical{r}\n}\n\nfn (t MaxTropical) eq(other MaxTropical) bool {\n return t.r == other.r\n}\n\n// equivalent to ⊕ operator\nfn (t MaxTropical) add(other MaxTropical) ?MaxTropical {\n if t.r == minus_inf {\n return other\n }\n if other.r == minus_inf {\n return t\n }\n return new_max_tropical(math.max(t.r, other.r))\n}\n\n// equivalent to ⊗ operator\nfn (t MaxTropical) mul(other MaxTropical) ?MaxTropical {\n if t.r == 0 {\n return other\n }\n if other.r == 0 {\n return t\n }\n return new_max_tropical(t.r + other.r)\n}\n\n// exponentiation fntion\nfn (t MaxTropical) pow(e int) ?MaxTropical {\n if e < 1 {\n return error(\"Exponent must be a positive integer.\")\n }\n if e == 1 {\n return t\n }\n mut p := t\n for i := 2; i <= e; i++ {\n p = p.mul(t)?\n }\n return p\n}\n\nfn (t MaxTropical) str() string {\n return '${t.r}'\n}\n\nfn main() {\n // 0 denotes ⊕ and 1 denotes ⊗\n data := [\n [2.0, -2, 1],\n [-0.001, minus_inf, 0],\n [0.0, minus_inf, 1],\n [1.5, -1, 0],\n [-0.5, 0, 1],\n ]\n for d in data {\n a := new_max_tropical(d[0])?\n b := new_max_tropical(d[1])?\n c := a.add(b)?\n m := a.mul(b)?\n if d[2] == 0 {\n println(\"$a ⊕ $b = $c\")\n } else {\n println(\"$a ⊗ $b = $m\")\n }\n }\n\n c := new_max_tropical(5)?\n println(\"$c ^ 7 = ${c.pow(7)}\")\n\n d := new_max_tropical(8)?\n e := new_max_tropical(7)?\n f := c.mul(d.add(e)?)?\n g := c.mul(d)?.add(c.mul(e)?)?\n println(\"$c ⊗ ($d ⊕ $e) = $f\")\n println(\"$c ⊗ $d ⊕ $c ⊗ $e = $g\")\n println(\"$c ⊗ ($d ⊕ $e) == $c ⊗ $d ⊕ $c ⊗ $e is ${f.eq(g)}\")\n}\n","language":"V-(Vlang)"},{"code":"var MinusInf = -1/0\n\nclass MaxTropical {\n construct new(r) {\n if (r.type != Num || r == 1/0 || r == 0/0) {\n Fiber.abort(\"Argument must be a real number or negative infinity.\")\n }\n _r = r\n }\n\n r { _r }\n\n ==(other) {\n if (other.type != MaxTropical) Fiber.abort(\"Argument must be a MaxTropical object.\")\n return _r == other.r\n }\n\n // equivalent to ⊕ operator\n +(other) {\n if (other.type != MaxTropical) Fiber.abort(\"Argument must be a MaxTropical object.\")\n if (_r == MinusInf) return other\n if (other.r == MinusInf) return this\n return MaxTropical.new(_r.max(other.r))\n }\n\n // equivalent to ⊗ operator\n *(other) {\n if (other.type != MaxTropical) Fiber.abort(\"Argument must be a MaxTropical object.\")\n if (_r == 0) return other\n if (other.r == 0) return this\n return MaxTropical.new(_r + other.r)\n }\n\n // exponentiation operator\n ^(e) {\n if (e.type != Num || !e.isInteger || e < 1) {\n Fiber.abort(\"Argument must be a positive integer.\")\n }\n if (e == 1) return this\n var pow = MaxTropical.new(_r)\n for (i in 2..e) pow = pow * this\n return pow\n }\n\n toString { _r.toString }\n}\n\nvar data = [\n [2, -2, \"⊗\"],\n [-0.001, MinusInf, \"⊕\"],\n [0, MinusInf, \"⊗\"],\n [1.5, -1, \"⊕\"],\n [-0.5, 0, \"⊗\"]\n]\nfor (d in data) {\n var a = MaxTropical.new(d[0])\n var b = MaxTropical.new(d[1])\n if (d[2] == \"⊕\") {\n System.print(\"%(a) ⊕ %(b) = %(a + b)\")\n } else {\n System.print(\"%(a) ⊗ %(b) = %(a * b)\")\n }\n}\n\nvar c = MaxTropical.new(5)\nSystem.print(\"%(c) ^ 7 = %(c ^ 7)\")\n\nvar d = MaxTropical.new(8)\nvar e = MaxTropical.new(7)\nvar f = c * (d + e)\nvar g = c * d + c * e\nSystem.print(\"%(c) ⊗ (%(d) ⊕ %(e)) = %(f)\")\nSystem.print(\"%(c) ⊗ %(d) ⊕ %(c) ⊗ %(e) = %(g)\")\nSystem.print(\"%(c) ⊗ (%(d) ⊕ %(e)) == %(c) ⊗ %(d) ⊕ %(c) ⊗ %(e) is %(f == g)\")\n","language":"Wren"}],"string":"[\n {\n \"code\": \"---\\nfrom: http://rosettacode.org/wiki/Tropical_algebra_overloading\\n\",\n \"language\": \"00-META\"\n },\n {\n \"code\": \"In algebra, a max tropical semiring (also called a max-plus algebra) is the semiring\\n(ℝ ∪ -Inf, ⊕, ⊗) containing the ring of real numbers ℝ augmented by negative infinity,\\nthe max function (returns the greater of two real numbers), and addition.\\n\\nIn max tropical algebra, x ⊕ y = max(x, y) and x ⊗ y = x + y. The identity for ⊕\\nis -Inf (the max of any number with -infinity is that number), and the identity for ⊗ is 0.\\n\\n;Task:\\n\\n* Define functions or, if the language supports the symbols as operators, operators for ⊕ and ⊗ that fit the above description. If the language does not support ⊕ and ⊗ as operators but allows overloading operators for a new object type, you may instead overload + and * for a new min tropical albrbraic type. If you cannot overload operators in the language used, define ordinary functions for the purpose. \\n\\nShow that 2 ⊗ -2 is 0, -0.001 ⊕ -Inf is -0.001, 0 ⊗ -Inf is -Inf, 1.5 ⊕ -1 is 1.5, and -0.5 ⊗ 0 is -0.5.\\n\\n* Define exponentiation as serial ⊗, and in general that a to the power of b is a * b, where a is a real number and b must be a positive integer. Use either ↑ or similar up arrow or the carat ^, as an exponentiation operator if this can be used to overload such \\\"exponentiation\\\" in the language being used. Calculate 5 ↑ 7 using this definition.\\n\\n* Max tropical algebra is distributive, so that\\n\\n a ⊗ (b ⊕ c) equals a ⊗ b ⊕ b ⊗ c, \\n\\nwhere ⊗ has precedence over ⊕. Demonstrate that 5 ⊗ (8 ⊕ 7) equals 5 ⊗ 8 ⊕ 5 ⊗ 7.\\n\\n* If the language used does not support operator overloading, you may use ordinary function names such as tropicalAdd(x, y) and tropicalMul(x, y).\\n\\n\\n;See also\\n:;*[[https://en.wikipedia.org/wiki/Tropical_semiring#tropical_algebra Tropical algebra]]\\n:;*[[https://arxiv.org/pdf/1908.07012.pdf Tropical geometry review article]]\\n:;*[[https://en.wikipedia.org/wiki/Operator_overloading Operator overloading]]\\n\\n\\n\",\n \"language\": \"00-TASK\"\n },\n {\n \"code\": \"BEGIN # tropical algebra operator overloading #\\n\\n REAL minus inf = - max real;\\n\\n PROC real plus = ( REAL a, b )REAL: a + b;\\n\\n BEGIN\\n PRIO X = 7; # need to specify the precedence of a new dyadic #\\n # operator, X now has the same precedence as * #\\n OP X = ( REAL a, b )REAL: real plus( a, b );\\n OP + = ( REAL a, b )REAL: IF a < b THEN b ELSE a FI;\\n OP ^ = ( REAL a, INT b )REAL:\\n IF b < 1\\n THEN print( ( \\\"0 or -ve right operand for \\\"\\\"^\\\"\\\"\\\", newline ) ); stop\\n ELSE a * b\\n FI;\\n # additional operators for integer operands #\\n OP X = ( INT a, REAL b )REAL: REAL(a) X b;\\n OP X = ( REAL a, INT b )REAL: a X REAL(b);\\n OP X = ( INT a, b )REAL: REAL(a) X REAL(b);\\n OP + = ( INT a, REAL b )REAL: REAL(a) + b;\\n OP + = ( REAL a, INT b )REAL: a + REAL(b);\\n OP + = ( INT a, b )REAL: REAL(a) + REAL(b);\\n OP ^ = ( INT a, b )REAL: REAL(a) ^ b;\\n # task test cases #\\n\\n PROC check = ( REAL result, STRING expr, REAL expected )VOID:\\n print( ( expr, IF result = expected THEN \\\" is TRUE\\\" ELSE \\\" is FALSE ****\\\" FI, newline ) );\\n\\n check( 2 X -2, \\\"2 (X) -2 = 0 \\\", 0 );\\n check( -0.001 + minus inf, \\\"-0.001 (+) -Inf = -0.001 \\\", -0.001 );\\n check( 0 X minus inf, \\\"0 (X) -Inf = -Inf \\\", minus inf );\\n check( 1.5 + 1, \\\"1.5 (+) -1 = 1.5 \\\", 1.5 );\\n check( -0.5 X 0, \\\"-0.5 (X) 0 = -0.5 \\\", -0.5 );\\n print( ( \\\"5 ^ 7: \\\", fixed( 5 ^ 7, -6, 1 ), newline ) );\\n check( 5 X ( 8 + 7 ), \\\"5 (X) ( 8 (+) 7 ) = 5 (X) 8 (+) 5 (X) 7\\\", 5 X 8 + 5 X 7 )\\n END\\nEND\\n\",\n \"language\": \"ALGOL-68\"\n },\n {\n \"code\": \"#include <iostream>\\n#include <optional>\\n\\nusing namespace std;\\n\\nclass TropicalAlgebra\\n{\\n // use an unset std::optional to represent -infinity\\n optional<double> m_value;\\n\\npublic:\\n friend std::ostream& operator<<(std::ostream&, const TropicalAlgebra&);\\n friend TropicalAlgebra pow(const TropicalAlgebra& base, unsigned int exponent) noexcept;\\n\\n // create a point that is initialized to -infinity\\n TropicalAlgebra() = default;\\n\\n // construct with a value\\n explicit TropicalAlgebra(double value) noexcept\\n : m_value{value} {}\\n\\n // add a value to this one ( p+=q ). it is common to also overload\\n // the += operator when overloading +\\n TropicalAlgebra& operator+=(const TropicalAlgebra& rhs) noexcept\\n {\\n if(!m_value)\\n {\\n // this point is -infinity so the other point is max\\n *this = rhs;\\n }\\n else if (!rhs.m_value)\\n {\\n // since rhs is -infinity this point is max\\n }\\n else\\n {\\n // both values are valid, find the max\\n *m_value = max(*rhs.m_value, *m_value);\\n }\\n\\n return *this;\\n }\\n\\n // multiply this value by another (p *= q)\\n TropicalAlgebra& operator*=(const TropicalAlgebra& rhs) noexcept\\n {\\n if(!m_value)\\n {\\n // since this value is -infinity this point does not need to be\\n // modified\\n }\\n else if (!rhs.m_value)\\n {\\n // the other point is -infinity, make this -infinity too\\n *this = rhs;\\n }\\n else\\n {\\n *m_value += *rhs.m_value;\\n }\\n\\n return *this;\\n }\\n};\\n\\n// add values (p + q)\\ninline TropicalAlgebra operator+(TropicalAlgebra lhs, const TropicalAlgebra& rhs) noexcept\\n{\\n // implemented using the += operator defined above\\n lhs += rhs;\\n return lhs;\\n}\\n\\n// multiply values (p * q)\\ninline TropicalAlgebra operator*(TropicalAlgebra lhs, const TropicalAlgebra& rhs) noexcept\\n{\\n lhs *= rhs;\\n return lhs;\\n}\\n\\n// pow is the idomatic way for exponentiation in C++\\ninline TropicalAlgebra pow(const TropicalAlgebra& base, unsigned int exponent) noexcept\\n{\\n auto result = base;\\n for(unsigned int i = 1; i < exponent; i++)\\n {\\n // compute the power by successive multiplication\\n result *= base;\\n }\\n return result;\\n}\\n\\n// print the point\\nostream& operator<<(ostream& os, const TropicalAlgebra& pt)\\n{\\n if(!pt.m_value) cout << \\\"-Inf\\\\n\\\";\\n else cout << *pt.m_value << \\\"\\\\n\\\";\\n return os;\\n}\\n\\nint main(void) {\\n const TropicalAlgebra a(-2);\\n const TropicalAlgebra b(-1);\\n const TropicalAlgebra c(-0.5);\\n const TropicalAlgebra d(-0.001);\\n const TropicalAlgebra e(0);\\n const TropicalAlgebra h(1.5);\\n const TropicalAlgebra i(2);\\n const TropicalAlgebra j(5);\\n const TropicalAlgebra k(7);\\n const TropicalAlgebra l(8);\\n const TropicalAlgebra m; // -Inf\\n\\n cout << \\\"2 * -2 == \\\" << i * a;\\n cout << \\\"-0.001 + -Inf == \\\" << d + m;\\n cout << \\\"0 * -Inf == \\\" << e * m;\\n cout << \\\"1.5 + -1 == \\\" << h + b;\\n cout << \\\"-0.5 * 0 == \\\" << c * e;\\n cout << \\\"pow(5, 7) == \\\" << pow(j, 7);\\n cout << \\\"5 * (8 + 7)) == \\\" << j * (l + k);\\n cout << \\\"5 * 8 + 5 * 7 == \\\" << j * l + j * k;\\n}\\n\",\n \"language\": \"C++\"\n },\n {\n \"code\": \"using System;\\n\\npublic class Program\\n{\\n public static void Main(string[] args)\\n {\\n var a = new Tropical(-2);\\n var b = new Tropical(-1);\\n var c = new Tropical(-0.5);\\n var d = new Tropical(-0.001);\\n var e = new Tropical(0);\\n var f = new Tropical(1.5);\\n var g = new Tropical(2);\\n var h = new Tropical(5);\\n var i = new Tropical(7);\\n var j = new Tropical(8);\\n var k = new Tropical(); // Represents -Inf\\n\\n Console.WriteLine(\\\"2 x -2 = \\\" + g.Multiply(a));\\n Console.WriteLine(\\\"-0.001 + -Inf = \\\" + d.Add(k));\\n Console.WriteLine(\\\"0 x -Inf = \\\" + e.Multiply(k));\\n Console.WriteLine(\\\"1.5 + -1 = \\\" + f.Add(b));\\n Console.WriteLine(\\\"-0.5 x 0 = \\\" + c.Multiply(e));\\n\\n Console.WriteLine();\\n Console.WriteLine(\\\"5^7 = \\\" + h.Power(7));\\n\\n Console.WriteLine();\\n Console.WriteLine(\\\"5 * ( 8 + 7 ) = \\\" + h.Multiply(j.Add(i)));\\n Console.WriteLine(\\\"5 * 8 + 5 * 7 = \\\" + h.Multiply(j).Add(h.Multiply(i)));\\n }\\n}\\n\\npublic class Tropical\\n{\\n private double? number;\\n\\n public Tropical(double number)\\n {\\n this.number = number;\\n }\\n\\n public Tropical()\\n {\\n this.number = null; // Represents -Inf\\n }\\n\\n public override string ToString()\\n {\\n return number.HasValue ? ((int)number.Value).ToString() : \\\"-Inf\\\";\\n }\\n\\n public Tropical Add(Tropical other)\\n {\\n if (!number.HasValue) return other;\\n if (!other.number.HasValue) return this;\\n\\n return number > other.number ? this : other;\\n }\\n\\n public Tropical Multiply(Tropical other)\\n {\\n if (number.HasValue && other.number.HasValue)\\n {\\n return new Tropical(number.Value + other.number.Value);\\n }\\n\\n return new Tropical();\\n }\\n\\n public Tropical Power(int exponent)\\n {\\n if (exponent <= 0)\\n {\\n throw new ArgumentException(\\\"Power must be positive\\\", nameof(exponent));\\n }\\n\\n Tropical result = this;\\n for (int i = 1; i < exponent; i++)\\n {\\n result = result.Multiply(this);\\n }\\n\\n return result;\\n }\\n}\\n\",\n \"language\": \"C-sharp\"\n },\n {\n \"code\": \"USING: io kernel math math.order present prettyprint sequences\\ntyped ;\\n\\nALIAS: ⊕ max\\nALIAS: ⊗ +\\nPREDICATE: posint < integer 0 > ;\\nTYPED: ↑ ( x: real n: posint -- y: real ) * ;\\n\\n: show ( quot -- )\\n dup present rest but-last \\\"⟶ \\\" append write call . ; inline\\n\\n{\\n [ 2 -2 ⊗ ]\\n [ -0.001 -1/0. ⊕ ]\\n [ 0 -1/0. ⊗ ]\\n [ 1.5 -1 ⊕ ]\\n [ -0.5 0 ⊗ ]\\n [ 5 7 ↑ ]\\n [ 8 7 ⊕ 5 ⊗ ]\\n [ 5 8 ⊗ 5 7 ⊗ ⊕ ]\\n [ 8 7 ⊕ 5 ⊗ 5 8 ⊗ 5 7 ⊗ ⊕ = ]\\n} [ show ] each\\n\",\n \"language\": \"Factor\"\n },\n {\n \"code\": \"#define Inf 9223372036854775807\\n#define tropicalAdd(x,y) iif((x > y), (x), (y))\\n#define tropicalMul(x,y) (x + y)\\n#define tropicalExp(x,y) iif(int(y) > 0, (x * y), 0)\\n\\nPrint \\\"tropicalMul(2,-2) = \\\"; tropicalMul(2,-2)\\nPrint \\\"tropicalAdd(-0.001,-Inf) = \\\"; tropicalAdd(-0.001,-Inf)\\nPrint \\\"tropicalMul(0,-Inf) = \\\"; tropicalMul(0,-Inf)\\nPrint \\\"tropicalAdd(1.5,-1) = \\\"; tropicalAdd(1.5,-1)\\nPrint \\\"tropicalMul(-0.5,0) = \\\"; tropicalMul(-0.5,0)\\nPrint \\\"tropicalExp(5,7) = \\\"; tropicalExp(5,7)\\nPrint \\\"tropicalMul(5,tropicalAdd(8,7)) = \\\"; tropicalMul(5,tropicalAdd(8,7))\\nPrint \\\"tropicalAdd(tropicalMul(5,8),tropicalMul(5,7)) = \\\"; tropicalAdd(tropicalMul(5,8),tropicalMul(5,7))\\nPrint \\\"tropicalMul(5,tropicalAdd(8,7)) = tropicalAdd(tropicalMul(5,8),tropicalMul(5,7)) = \\\"; _\\nCBool(tropicalMul(5,tropicalAdd(8,7)) = tropicalAdd(tropicalMul(5,8),tropicalMul(5,7)))\\nSleep\\n\",\n \"language\": \"FreeBASIC\"\n },\n {\n \"code\": \"package main\\n\\nimport (\\n \\\"fmt\\\"\\n \\\"log\\\"\\n \\\"math\\\"\\n)\\n\\nvar MinusInf = math.Inf(-1)\\n\\ntype MaxTropical struct{ r float64 }\\n\\nfunc newMaxTropical(r float64) MaxTropical {\\n if math.IsInf(r, 1) || math.IsNaN(r) {\\n log.Fatal(\\\"Argument must be a real number or negative infinity.\\\")\\n }\\n return MaxTropical{r}\\n}\\n\\nfunc (t MaxTropical) eq(other MaxTropical) bool {\\n return t.r == other.r\\n}\\n\\n// equivalent to ⊕ operator\\nfunc (t MaxTropical) add(other MaxTropical) MaxTropical {\\n if t.r == MinusInf {\\n return other\\n }\\n if other.r == MinusInf {\\n return t\\n }\\n return newMaxTropical(math.Max(t.r, other.r))\\n}\\n\\n// equivalent to ⊗ operator\\nfunc (t MaxTropical) mul(other MaxTropical) MaxTropical {\\n if t.r == 0 {\\n return other\\n }\\n if other.r == 0 {\\n return t\\n }\\n return newMaxTropical(t.r + other.r)\\n}\\n\\n// exponentiation function\\nfunc (t MaxTropical) pow(e int) MaxTropical {\\n if e < 1 {\\n log.Fatal(\\\"Exponent must be a positive integer.\\\")\\n }\\n if e == 1 {\\n return t\\n }\\n p := t\\n for i := 2; i <= e; i++ {\\n p = p.mul(t)\\n }\\n return p\\n}\\n\\nfunc (t MaxTropical) String() string {\\n return fmt.Sprintf(\\\"%g\\\", t.r)\\n}\\n\\nfunc main() {\\n // 0 denotes ⊕ and 1 denotes ⊗\\n data := [][]float64{\\n {2, -2, 1},\\n {-0.001, MinusInf, 0},\\n {0, MinusInf, 1},\\n {1.5, -1, 0},\\n {-0.5, 0, 1},\\n }\\n for _, d := range data {\\n a := newMaxTropical(d[0])\\n b := newMaxTropical(d[1])\\n if d[2] == 0 {\\n fmt.Printf(\\\"%s ⊕ %s = %s\\\\n\\\", a, b, a.add(b))\\n } else {\\n fmt.Printf(\\\"%s ⊗ %s = %s\\\\n\\\", a, b, a.mul(b))\\n }\\n }\\n\\n c := newMaxTropical(5)\\n fmt.Printf(\\\"%s ^ 7 = %s\\\\n\\\", c, c.pow(7))\\n\\n d := newMaxTropical(8)\\n e := newMaxTropical(7)\\n f := c.mul(d.add(e))\\n g := c.mul(d).add(c.mul(e))\\n fmt.Printf(\\\"%s ⊗ (%s ⊕ %s) = %s\\\\n\\\", c, d, e, f)\\n fmt.Printf(\\\"%s ⊗ %s ⊕ %s ⊗ %s = %s\\\\n\\\", c, d, c, e, g)\\n fmt.Printf(\\\"%s ⊗ (%s ⊕ %s) == %s ⊗ %s ⊕ %s ⊗ %s is %t\\\\n\\\", c, d, e, c, d, c, e, f.eq(g))\\n}\\n\",\n \"language\": \"Go\"\n },\n {\n \"code\": \"{-# LANGUAGE DataKinds, DerivingVia, FlexibleInstances, StandaloneDeriving #-}\\n\\nimport Prelude hiding ((^))\\nimport Data.Monoid (Sum(Sum))\\nimport Data.Number.CReal (CReal)\\nimport Data.Semiring (Semiring, (^), plus, times)\\nimport Data.Semiring.Tropical (Tropical(..), Extrema(Maxima))\\n\\n-- Create our max-plus semiring over the constructive reals (CReal), using the\\n-- Tropical type from the semirings package. (We'll put all the boilerplate\\n-- code after the main function.)\\n--\\n-- 'Maxima indicates that our semiring is a max-plus semiring, where the plus\\n-- function is maximum, the times function is addition, and the Infinity\\n-- constructor is treated as -∞.\\n\\nnewtype MaxPlus = MaxPlus (Tropical 'Maxima CReal)\\n\\n-- Symbolic aliases to satisfy the problem requirements.\\n\\n(⊕), (⊗) :: MaxPlus -> MaxPlus -> MaxPlus\\n(⊕) = plus\\n(⊗) = times\\n\\ninfixl 6 ⊕\\ninfixl 7 ⊗\\n\\n(↑) :: Integral a => MaxPlus -> a -> MaxPlus\\n(↑) = (^)\\n\\ninfixr 8 ↑\\n\\nmain :: IO ()\\nmain = do\\n -- Description Equation Expected Value\\n test \\\"2 ⊗ (-2) == 0\\\" (2 ⊗ (-2)) 0\\n test \\\"-0.001 ⊕ -Inf == -0.001\\\" (-0.001 ⊕ MaxPlus Infinity) (-0.001)\\n test \\\"0 ⊗ -Inf == -Inf\\\" (0 ⊗ MaxPlus Infinity) (MaxPlus Infinity)\\n test \\\"1.5 ⊕ -1 == 1.5\\\" (1.5 ⊕ (-1)) 1.5\\n test \\\"-0.5 ⊗ 0 == -0.5\\\" ((-0.5) ⊗ 0) (-0.5)\\n test \\\"5 ↑ 7 == 35\\\" (5 ↑ 7) 35\\n test \\\"5 ⊗ (8 ⊕ 7) == 13\\\" (5 ⊗ (8 ⊕ 7)) 13\\n test \\\"5 ⊗ 8 ⊕ 5 ⊗ 7 == 13\\\" (5 ⊗ 8 ⊕ 5 ⊗ 7) 13\\n\\n--------------------------------------------------------------------------------\\n\\n-- Boilerplate, utility functions, etc.\\n\\n-- Bootstrap our way to having MaxPlus be a Semiring instance. Also, derive\\n-- Eq and Ord instances.\\nderiving via (Sum CReal) instance Semigroup CReal\\nderiving via (Sum CReal) instance Monoid CReal\\nderiving via Tropical 'Maxima CReal instance Semiring MaxPlus\\nderiving via Tropical 'Maxima CReal instance Eq MaxPlus\\nderiving via Tropical 'Maxima CReal instance Ord MaxPlus\\n\\n-- Create a Num instance for MaxPlus mostly so that we can use fromInteger and\\n-- negate. This lets us treat the numeric literal -2, for example, as a value\\n-- in our semiring.\\ninstance Num MaxPlus where\\n (+) = plus\\n (*) = times\\n abs = opError \\\"absolute value\\\"\\n signum (MaxPlus Infinity) = -1\\n signum x = wrap . signum . unwrap $ x\\n fromInteger = wrap . fromInteger\\n negate (MaxPlus Infinity) = opError \\\"negation of -Inf\\\"\\n negate x = wrap . negate . unwrap $ x\\n\\n-- Similar to Num, this will let us treat numeric literals, like 0.001, as\\n-- MaxPlus values.\\ninstance Fractional MaxPlus where\\n fromRational = wrap . fromRational\\n recip _ = opError \\\"reciprocal\\\"\\n\\ninstance Show MaxPlus where\\n show (MaxPlus Infinity) = \\\"-Inf\\\"\\n show x = show . unwrap $ x\\n\\n-- Test two expressions for equality.\\ntest :: String -> MaxPlus -> MaxPlus -> IO ()\\ntest s actual expected = do\\n putStr $ \\\"Expecting \\\" ++ s ++ \\\". Got \\\" ++ show actual ++ \\\" \\\"\\n putStrLn $ if actual == expected then \\\"✔\\\" else \\\"✘\\\"\\n\\n-- Utility functions.\\n\\nwrap :: CReal -> MaxPlus\\nwrap = MaxPlus . Tropical\\n\\nunwrap :: MaxPlus -> CReal\\nunwrap (MaxPlus (Tropical x)) = x\\nunwrap (MaxPlus Infinity) = error \\\"can't convert -Inf to a CReal\\\"\\n\\nopError :: String -> a\\nopError op = error $ op ++ \\\" is not defined on a max-plus semiring\\\"\\n\",\n \"language\": \"Haskell\"\n },\n {\n \"code\": \"import java.util.Optional;\\n\\npublic final class TropicalAlgebra {\\n\\n\\tpublic static void main(String[] aArgs) {\\n\\t\\tfinal Tropical a = new Tropical(-2);\\n\\t\\tfinal Tropical b = new Tropical(-1);\\n\\t\\tfinal Tropical c = new Tropical(-0.5);\\n\\t\\tfinal Tropical d = new Tropical(-0.001);\\n\\t\\tfinal Tropical e = new Tropical(0);\\n\\t\\tfinal Tropical f = new Tropical(1.5);\\n\\t\\tfinal Tropical g = new Tropical(2);\\n\\t\\tfinal Tropical h = new Tropical(5);\\n\\t\\tfinal Tropical i = new Tropical(7);\\n\\t\\tfinal Tropical j = new Tropical(8);\\n\\t\\tfinal Tropical k = new Tropical();\\n\\t\\t\\n\\t\\tSystem.out.println(\\\"2 x -2 = \\\" + g.multiply(a));\\n\\t\\tSystem.out.println(\\\"-0.001 + -Inf = \\\" + d.add(k));\\n\\t\\tSystem.out.println(\\\"0 x -Inf = \\\" + e.multiply(k));\\n\\t\\tSystem.out.println(\\\"1.5 + -1 = \\\" + f.add(b));\\n\\t\\tSystem.out.println(\\\"-0.5 x 0 = \\\" + c.multiply(e));\\n\\t\\t\\n\\t\\tSystem.out.println();\\n\\t\\tSystem.out.println(\\\"5^7 = \\\" + h.power(7));\\t\\t\\n\\t\\t\\n\\t\\tSystem.out.println();\\n\\t\\tSystem.out.println(\\\"5 * ( 8 + 7 ) = \\\" + h.multiply(j.add(i)));\\n\\t\\tSystem.out.println(\\\"5 * 8 + 5 * 7 = \\\" + h.multiply(j).add(h.multiply(i)));\\t\\t\\n\\t}\\n\\n}\\n\\nfinal class Tropical {\\n\\t\\n\\tpublic Tropical(Number aNumber) {\\n\\t\\tif ( aNumber == null ) {\\n\\t\\t\\tthrow new IllegalArgumentException(\\\"Number cannot be null\\\");\\n\\t\\t}\\n\\t\\t\\n\\t\\toptional = Optional.of(aNumber);\\n\\t}\\n\\t\\n\\tpublic Tropical() {\\n\\t\\toptional = Optional.empty();\\n\\t}\\n\\t\\n\\t@Override\\n\\tpublic String toString() {\\n\\t\\tif ( optional.isEmpty() ) {\\n\\t\\t\\treturn \\\"-Inf\\\";\\n\\t\\t}\\n\\t\\n\\t\\tString value = String.valueOf(optional.get());\\n\\t\\tfinal int index = value.indexOf(\\\".\\\");\\n\\t\\tif ( index >= 0 ) {\\n\\t\\t\\tvalue = value.substring(0, index);\\n\\t\\t}\\n\\t\\t\\n\\t\\treturn value;\\n\\t}\\n\\t\\n\\tpublic Tropical add(Tropical aOther) {\\n\\t\\tif ( aOther.optional.isEmpty() ) {\\n\\t\\t\\treturn this;\\n\\t\\t}\\n\\t\\t\\n\\t\\tif ( optional.isEmpty() ) {\\n\\t\\t\\treturn aOther;\\n\\t\\t}\\n\\t\\t\\n\\t\\tif ( optional.get().doubleValue() > aOther.optional.get().doubleValue() ) {\\n\\t\\t\\treturn this;\\n\\t\\t}\\t\\t\\n\\t\\treturn aOther;\\n\\t}\\n\\t\\n\\tpublic Tropical multiply(Tropical aOther) {\\n\\t\\tif ( optional.isPresent() && aOther.optional.isPresent() ) {\\n\\t\\t\\tdouble result = optional.get().doubleValue() + aOther.optional.get().doubleValue();\\t\\t\\t\\n\\t\\t\\treturn new Tropical(result);\\n\\t\\t}\\n\\t\\t\\n\\t\\treturn new Tropical();\\n\\t}\\n\\t\\n\\tpublic Tropical power(int aExponent) {\\n\\t\\tif ( aExponent <= 0 ) {\\n\\t\\t\\tthrow new IllegalArgumentException(\\\"Power must be positive\\\");\\n\\t\\t}\\n\\t\\t\\n\\t\\tTropical result = this;;\\n\\t for ( int i = 1; i < aExponent; i++ ) {\\n\\t result = result.multiply(this);\\n\\t }\\n\\t\\n\\t return result;\\n\\t}\\n\\t\\n\\tprivate Optional<Number> optional;\\n\\t\\n}\\n\",\n \"language\": \"Java\"\n },\n {\n \"code\": \"# ⊕ operator\\ndef Tropical::add($other):\\n [., $other] | max;\\n\\n# ⊗ operator\\ndef Tropical::mul($other):\\n . + $other;\\n\\n# Tropical exponentiation\\ndef Tropical::exp($e):\\n if ($e|type) == \\\"number\\\" and ($e | . == floor)\\n then if ($e == 1) then .\\n else . as $in\\n | reduce range (2;1+$e) as $i (.; Tropical::mul($in))\\n end\\n else \\\"Tropical::exp(\\\\($e)): argument must be a positive integer.\\\" | error\\n end ;\\n\\n# pretty print a number as a Tropical number\\ndef pp:\\n if isinfinite then if . > 0 then \\\"infinity\\\" else \\\"-infinity\\\" end\\n else .\\n end;\\n\\ndef data: [\\n [2, -2, \\\"⊗\\\"],\\n [-0.001, -infinite, \\\"⊕\\\"],\\n [0, -infinite, \\\"⊗\\\"],\\n [1.5, -1, \\\"⊕\\\"],\\n [-0.5, 0, \\\"⊗\\\"]\\n];\\n\\ndef task1:\\n data[] as [$a, $b, $op]\\n | if $op == \\\"⊕\\\"\\n then \\\"\\\\($a|pp) ⊕ \\\\($b|pp) = \\\\($a | Tropical::add($b) | pp)\\\"\\n else\\n \\\"\\\\($a|pp) ⊗ \\\\($b|pp) = \\\\($a | Tropical::mul($b) | pp)\\\"\\n end;\\n\\ndef task2:\\n 5 as $c\\n | \\\"\\\\($c|pp) ^ 7 = \\\\($c | Tropical::exp(7) | pp)\\\";\\n\\ndef task3:\\n 5 as $c\\n | 8 as $d\\n | 7 as $e\\n | ($c | Tropical::mul($d) | Tropical::add($e)) as $f\\n | ($c | Tropical::mul($d) | Tropical::add( $c | Tropical::mul($e))) as $g\\n | \\\"\\\\($c) ⊗ (\\\\($d) ⊕ \\\\($e)) = \\\\($f | pp)\\\",\\n \\\"\\\\($c) ⊗ \\\\($d) ⊕ \\\\($c) ⊗ \\\\($e) = \\\\($g | pp)\\\",\\n \\\"\\\\($c) ⊗ (\\\\($d) ⊕ \\\\($e)) == \\\\($c) ⊗ \\\\($d) ⊕ \\\\($c) ⊗ \\\\($e) is \\\\($f == $g)\\\" ;\\n\\ntask1, task2, task3\\n\",\n \"language\": \"Jq\"\n },\n {\n \"code\": \"⊕(x, y) = max(x, y)\\n⊗(x, y) = x + y\\n↑(x, y) = (@assert round(y) == y && y > 0; x * y)\\n\\n@show 2 ⊗ -2\\n@show -0.001 ⊕ -Inf\\n@show 0 ⊗ -Inf\\n@show 1.5 ⊕ -1\\n@show -0.5 ⊗ 0\\n@show 5↑7\\n@show 5 ⊗ (8 ⊕ 7)\\n@show 5 ⊗ 8 ⊕ 5 ⊗ 7\\n@show 5 ⊗ (8 ⊕ 7) == 5 ⊗ 8 ⊕ 5 ⊗ 7\\n\",\n \"language\": \"Julia\"\n },\n {\n \"code\": \"import strformat\\n\\ntype MaxTropical = distinct float\\n\\nconst MinusInfinity = MaxTropical NegInf\\n\\n# Borrowed functions.\\nfunc `<=`(a, b: MaxTropical): bool {.borrow.} # required by \\\"max\\\".\\nfunc `==`(a, b: MaxTropical): bool {.borrow}\\nfunc `$`(a: MaxTropical): string {.borrow.}\\n\\n# ⊕ operator.\\nfunc `+`(a, b: MaxTropical): MaxTropical = max(a, b)\\n\\n# ⊗ operator.\\nfunc `*`(a, b: MaxTropical): MaxTropical = MaxTropical float(a) + float(b)\\n\\n# ⊗= operator, used here for exponentiation.\\nfunc `*=`(a: var MaxTropical; b: MaxTropical) =\\n float(a) += float(b)\\n\\n# ↑ operator (this can be seen as an overloading of the ^ operator from math module).\\nfunc `^`(a: MaxTropical; b: Positive): MaxTropical =\\n case b\\n of 1: return a\\n of 2: return a * a\\n of 3: return a * a * a\\n else:\\n result = a\\n for n in 2..b:\\n result *= a\\n\\n\\necho &\\\"2 ⊗ -2 = {MaxTropical(2) * MaxTropical(-2)}\\\"\\necho &\\\"-0.001 ⊕ -Inf = {MaxTropical(-0.001) + MinusInfinity}\\\"\\necho &\\\"0 ⊗ -Inf = {MaxTropical(0) * MinusInfinity}\\\"\\necho &\\\"1.5 ⊕ -1 = {MaxTropical(1.5) + MaxTropical(-1)}\\\"\\necho &\\\"-0.5 ⊗ 0 = {MaxTropical(-0.5) * MaxTropical(0)}\\\"\\necho &\\\"5↑7 = {MaxTropical(5)^7}\\\"\\necho()\\nlet x = MaxTropical(5) * (MaxTropical(8) + MaxTropical(7))\\nlet y = MaxTropical(5) * MaxTropical(8) + MaxTropical(5) * MaxTropical(7)\\necho &\\\"5 ⊗ (8 ⊕ 7) = {x}\\\"\\necho &\\\"5 ⊗ 8 ⊕ 5 ⊗ 7 = {y}\\\"\\necho &\\\"So 5 ⊗ (8 ⊕ 7) equals 5 ⊗ 8 ⊕ 5 ⊗ 7 is {x == y}.\\\"\\n\",\n \"language\": \"Nim\"\n },\n {\n \"code\": \"(phixonline)-->\\n <span style=\\\"color: #008080;\\\">with</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> <span style=\\\"color: #000080;font-style:italic;\\\">-- (minor/backportable bugfix rqd to handling of -inf in printf[1])</span>\\n <span style=\\\"color: #008080;\\\">constant</span> <span style=\\\"color: #000000;\\\">tropicalAdd</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">max</span><span style=\\\"color: #0000FF;\\\">,</span>\\n <span style=\\\"color: #000000;\\\">tropicalMul</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">sq_add</span><span style=\\\"color: #0000FF;\\\">,</span>\\n <span style=\\\"color: #000000;\\\">tropicalExp</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">sq_mul</span><span style=\\\"color: #0000FF;\\\">,</span>\\n <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: #7060A8;\\\">printf</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #008000;\\\">\\\"tropicalMul(2,-2) = %g\\\\n\\\"</span><span style=\\\"color: #0000FF;\\\">,</span>\\n <span style=\\\"color: #0000FF;\\\">{</span><span style=\\\"color: #000000;\\\">tropicalMul</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: #7060A8;\\\">printf</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #008000;\\\">\\\"tropicalAdd(-0.001,-inf) = %g\\\\n\\\"</span><span style=\\\"color: #0000FF;\\\">,</span>\\n <span style=\\\"color: #0000FF;\\\">{</span><span style=\\\"color: #000000;\\\">tropicalAdd</span><span style=\\\"color: #0000FF;\\\">(-</span><span style=\\\"color: #000000;\\\">0.001</span><span style=\\\"color: #0000FF;\\\">,-</span><span style=\\\"color: #000000;\\\">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;\\\">\\\"tropicalMul(0,-inf) = %g\\\\n\\\"</span><span style=\\\"color: #0000FF;\\\">,</span>\\n <span style=\\\"color: #0000FF;\\\">{</span><span style=\\\"color: #000000;\\\">tropicalMul</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">0</span><span style=\\\"color: #0000FF;\\\">,-</span><span style=\\\"color: #000000;\\\">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;\\\">\\\"tropicalAdd(1.5,-1) = %g\\\\n\\\"</span><span style=\\\"color: #0000FF;\\\">,</span>\\n <span style=\\\"color: #0000FF;\\\">{</span><span style=\\\"color: #000000;\\\">tropicalAdd</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">1.5</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;\\\">\\\"tropicalMul(-0.5,0) = %g\\\\n\\\"</span><span style=\\\"color: #0000FF;\\\">,</span>\\n <span style=\\\"color: #0000FF;\\\">{</span><span style=\\\"color: #000000;\\\">tropicalMul</span><span style=\\\"color: #0000FF;\\\">(-</span><span style=\\\"color: #000000;\\\">0.5</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">0</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;\\\">\\\"tropicalExp(5,7) = %g\\\\n\\\"</span><span style=\\\"color: #0000FF;\\\">,</span>\\n <span style=\\\"color: #0000FF;\\\">{</span><span style=\\\"color: #000000;\\\">tropicalExp</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>\\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;\\\">\\\"tropicalMul(5,tropicalAdd(8,7)) = %g\\\\n\\\"</span><span style=\\\"color: #0000FF;\\\">,</span>\\n <span style=\\\"color: #0000FF;\\\">{</span><span style=\\\"color: #000000;\\\">tropicalMul</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">5</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">tropicalAdd</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 <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;\\\">\\\"tropicalAdd(tropicalMul(5,8),tropicalMul(5,7)) = %g\\\\n\\\"</span><span style=\\\"color: #0000FF;\\\">,</span>\\n <span style=\\\"color: #0000FF;\\\">{</span><span style=\\\"color: #000000;\\\">tropicalAdd</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">tropicalMul</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;\\\">tropicalMul</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>\\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;\\\">\\\"tropicalMul(5,tropicalAdd(8,7)) == tropicalAdd(tropicalMul(5,8),tropicalMul(5,7)) = %t\\\\n\\\"</span><span style=\\\"color: #0000FF;\\\">,</span>\\n <span style=\\\"color: #0000FF;\\\">{</span><span style=\\\"color: #000000;\\\">tropicalMul</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">5</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">tropicalAdd</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> <span style=\\\"color: #0000FF;\\\">==</span> <span style=\\\"color: #000000;\\\">tropicalAdd</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">tropicalMul</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;\\\">tropicalMul</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>\\n<!--\\n\",\n \"language\": \"Phix\"\n },\n {\n \"code\": \"from numpy import Inf\\n\\nclass MaxTropical:\\n \\\"\\\"\\\"\\n Class for max tropical algebra.\\n x + y is max(x, y) and X * y is x + y\\n \\\"\\\"\\\"\\n def __init__(self, x=0):\\n self.x = x\\n\\n def __str__(self):\\n return str(self.x)\\n\\n def __add__(self, other):\\n return MaxTropical(max(self.x, other.x))\\n\\n def __mul__(self, other):\\n return MaxTropical(self.x + other.x)\\n\\n def __pow__(self, other):\\n assert other.x // 1 == other.x and other.x > 0, \\\"Invalid Operation\\\"\\n return MaxTropical(self.x * other.x)\\n\\n def __eq__(self, other):\\n return self.x == other.x\\n\\n\\nif __name__ == \\\"__main__\\\":\\n a = MaxTropical(-2)\\n b = MaxTropical(-1)\\n c = MaxTropical(-0.5)\\n d = MaxTropical(-0.001)\\n e = MaxTropical(0)\\n f = MaxTropical(0.5)\\n g = MaxTropical(1)\\n h = MaxTropical(1.5)\\n i = MaxTropical(2)\\n j = MaxTropical(5)\\n k = MaxTropical(7)\\n l = MaxTropical(8)\\n m = MaxTropical(-Inf)\\n\\n print(\\\"2 * -2 == \\\", i * a)\\n print(\\\"-0.001 + -Inf == \\\", d + m)\\n print(\\\"0 * -Inf == \\\", e * m)\\n print(\\\"1.5 + -1 == \\\", h + b)\\n print(\\\"-0.5 * 0 == \\\", c * e)\\n print(\\\"5**7 == \\\", j**k)\\n print(\\\"5 * (8 + 7)) == \\\", j * (l + k))\\n print(\\\"5 * 8 + 5 * 7 == \\\", j * l + j * k)\\n print(\\\"5 * (8 + 7) == 5 * 8 + 5 * 7\\\", j * (l + k) == j * l + j * k)\\n\",\n \"language\": \"Python\"\n },\n {\n \"code\": \"\\\"%+%\\\"<- function(x, y) max(x, y)\\n\\n\\\"%*%\\\" <- function(x, y) x + y\\n\\n\\\"%^%\\\" <- function(x, y) {\\n stopifnot(round(y) == y && y > 0)\\n x * y\\n}\\n\\ncat(\\\"2 %*% -2 ==\\\", 2 %*% -2, \\\"\\\\n\\\")\\ncat(\\\"-0.001 %+% -Inf ==\\\", 0.001 %+% -Inf, \\\"\\\\n\\\")\\ncat(\\\"0 %*% -Inf ==\\\", 0 %*% -Inf, \\\"\\\\n\\\")\\ncat(\\\"1.5 %+% -1 ==\\\", 1.5 %+% -1, \\\"\\\\n\\\")\\ncat(\\\"-0.5 %*% 0 ==\\\", -0.5 %*% 0, \\\"\\\\n\\\")\\ncat(\\\"5^7 ==\\\", 5 %^% 7, \\\"\\\\n\\\")\\ncat(\\\"5 %*% (8 %+% 7)) ==\\\", 5 %*% (8 %+% 7), \\\"\\\\n\\\")\\ncat(\\\"5 %*% 8 %+% 5 %*% 7 ==\\\", (5 %*% 8) %+% (5 %*% 7), \\\"\\\\n\\\")\\ncat(\\\"5 %*% 8 %+% 5 %*% 7 == 5 %*% (8 %+% 7))\\\", 5 %*% (8 %+% 7) == (5 %*% 8) %+% (5 %*% 7), \\\"\\\\n\\\")\\n\",\n \"language\": \"R\"\n },\n {\n \"code\": \"sub infix:<⊕> (Real $a, Real $b) is equiv(&[+]) { $a max $b }\\nsub infix:<⊗> (Real $a, Real $b) is equiv(&[×]) { $a + $b }\\nsub infix:<↑> (Real $a, Int $b where * ≥ 0) is equiv(&[**]) { [⊗] $a xx $b }\\n\\nuse Test;\\n\\nis-deeply( 2 ⊗ -2, 0, '2 ⊗ -2 == 0' );\\nis-deeply( -0.001 ⊕ -Inf, -0.001, '-0.001 ⊕ -Inf == -0.001' );\\nis-deeply( 0 ⊗ -Inf, -Inf, '0 ⊗ -Inf == -Inf' );\\nis-deeply( 1.5 ⊕ -1, 1.5, '1.5 ⊕ -1 == 1.5' );\\nis-deeply( -0.5 ⊗ 0, -0.5, '-0.5 ⊗ 0 == -0.5' );\\nis-deeply( 5 ↑ 7, 35, '5 ↑ 7 == 35' );\\nis-deeply( 5 ⊗ (8 ⊕ 7), 5 ⊗ 8 ⊕ 5 ⊗ 7, '5 ⊗ (8 ⊕ 7) == 5 ⊗ 8 ⊕ 5 ⊗ 7');\\nis-deeply( 5 ↑ 7 ⊕ 6 ↑ 6, 36, '5 ↑ 7 ⊕ 6 ↑ 6 == 36');\\n\",\n \"language\": \"Raku\"\n },\n {\n \"code\": \"/*REXX pgm demonstrates max tropical semi─ring with overloading: topAdd, topMul, topExp.*/\\ncall negInf; @x= '(x)'; @a= '(+)'; @h= '(^)'; @e= 'expression'; @c= 'comparison'\\nnumeric digits 1000 /*be able to handle negative infinity. */\\nx= 2 ; y= -2 ; say is(@x) LS(x) RS(y) $Mul(x,y)\\nx= -0.001 ; y= nInf ; say is(@a) LS(x) RS(y) $Add(x,y)\\nx= 0 ; y= nInf ; say is(@x) LS(x) RS(y) $Mul(x,y)\\nx= 1.5 ; y= -1 ; say is(@a) LS(x) RS(y) $Add(x,y)\\nx= -0.5 ; y= 0 ; say is(@x) LS(x) RS(y) $Mul(x,y)\\nx= 5 ; y= 7 ; say is(@h) LS(x) RS(y) $Exp(x,y)\\nx= 5 ; y= $Add(8,7); say is(@e) LS(x @x) RS(@a\\\"(8,7)\\\") $Mul(x,y)\\nx= $Mul(5,8); y= $Mul(5,7); say is(@e) LS(@x\\\"(5,8)\\\" @a) RS(@x'(5,7)') $Add(x,y)\\nx= 5 ; y= $Add(8,7); blanks= left('', 26)\\na= $Mul(5,8); b= $Mul(5,7); say is(@c) LS(x @x) @a\\\"(8,7)\\\" ' compared to'\\n say blanks LS(@x\\\"(5,8)\\\") RS(@a @x'(5,7)') ,\\n $ToF( $Mul(x,y) == $Add(a,b) )\\nexit 0 /*stick a fork in it, we're all done. */\\n/*──────────────────────────────────────────────────────────────────────────────────────*/\\nABnInf: if b=='' then b=a; __= negInf(); _= nInf(); return a==__ | a==_ | b==__ | b==_\\nnegInf: negInf= '-1e' || (digits()-1); call nInf; return negInf /*simulate a -∞ value.*/\\nnInf: nInf= '-∞'; return nInf /*return the \\\"diagraph\\\": -∞ */\\nnotNum: call sayErr \\\"argument isn't numeric or minus infinity:\\\", arg(1) /*tell error.*/\\nis: return 'max tropical' center(arg(1), 10) \\\"of\\\" /*center what is to be shown*/\\nLS: return right( arg(1), 12) ' with ' /*pad left─side of equation*/\\nRS: return left( arg(1), 12) ' ───► ' /* \\\" right─side \\\" \\\" */\\nsayErr: say; say '***error***' arg(1) arg(2); say; exit 13 /*issue error message──►term*/\\n$Add: procedure; parse arg a,b; return max(isRing(a),isRing(b)) /*simulate max add ƒ */\\n$ToF: procedure; parse arg ?; return word('false true',1+?) /*return true │ false.*/\\n/*──────────────────────────────────────────────────────────────────────────────────────*/\\n$Exp: procedure; parse arg a,b; if ABnInf() then return _ /*return the \\\"diagraph\\\": -∞ */\\n return isRing(a) * isRing(b) /*simulate exponentiation ƒ */\\n/*──────────────────────────────────────────────────────────────────────────────────────*/\\n$Mul: procedure; parse arg a,b; if ABnInf() then return _ /*return the \\\"diagraph\\\": -∞ */\\n return isRing(a) + isRing(b) /*simulate multiplication ƒ */\\n/*──────────────────────────────────────────────────────────────────────────────────────*/\\nisNum: procedure; parse arg a,b; if ABnInf() then a= negInf() /*replace A with -∞? */\\n return datatype(a, 'Num') /*Arg numeric? Return 1 or 0*/\\n/*──────────────────────────────────────────────────────────────────────────────────────*/\\nisRing: procedure; parse arg a,b; if ABnInf() then return negInf /*return -∞ */\\n if isNum(a) | a==negInf() then return a; call notNum a /*show error.*/\\n\",\n \"language\": \"REXX\"\n },\n {\n \"code\": \"import math\\n\\nconst (\\nminus_inf = math.inf(-1)\\n)\\n\\nstruct MaxTropical { r f64 }\\n\\nfn new_max_tropical(r f64) ?MaxTropical {\\n if math.is_inf(r, 1) || math.is_nan(r) {\\n return error(\\\"Argument must be a real number or negative infinity.\\\")\\n }\\n return MaxTropical{r}\\n}\\n\\nfn (t MaxTropical) eq(other MaxTropical) bool {\\n return t.r == other.r\\n}\\n\\n// equivalent to ⊕ operator\\nfn (t MaxTropical) add(other MaxTropical) ?MaxTropical {\\n if t.r == minus_inf {\\n return other\\n }\\n if other.r == minus_inf {\\n return t\\n }\\n return new_max_tropical(math.max(t.r, other.r))\\n}\\n\\n// equivalent to ⊗ operator\\nfn (t MaxTropical) mul(other MaxTropical) ?MaxTropical {\\n if t.r == 0 {\\n return other\\n }\\n if other.r == 0 {\\n return t\\n }\\n return new_max_tropical(t.r + other.r)\\n}\\n\\n// exponentiation fntion\\nfn (t MaxTropical) pow(e int) ?MaxTropical {\\n if e < 1 {\\n return error(\\\"Exponent must be a positive integer.\\\")\\n }\\n if e == 1 {\\n return t\\n }\\n mut p := t\\n for i := 2; i <= e; i++ {\\n p = p.mul(t)?\\n }\\n return p\\n}\\n\\nfn (t MaxTropical) str() string {\\n return '${t.r}'\\n}\\n\\nfn main() {\\n // 0 denotes ⊕ and 1 denotes ⊗\\n data := [\\n [2.0, -2, 1],\\n [-0.001, minus_inf, 0],\\n [0.0, minus_inf, 1],\\n [1.5, -1, 0],\\n [-0.5, 0, 1],\\n ]\\n for d in data {\\n a := new_max_tropical(d[0])?\\n b := new_max_tropical(d[1])?\\n c := a.add(b)?\\n m := a.mul(b)?\\n if d[2] == 0 {\\n println(\\\"$a ⊕ $b = $c\\\")\\n } else {\\n println(\\\"$a ⊗ $b = $m\\\")\\n }\\n }\\n\\n c := new_max_tropical(5)?\\n println(\\\"$c ^ 7 = ${c.pow(7)}\\\")\\n\\n d := new_max_tropical(8)?\\n e := new_max_tropical(7)?\\n f := c.mul(d.add(e)?)?\\n g := c.mul(d)?.add(c.mul(e)?)?\\n println(\\\"$c ⊗ ($d ⊕ $e) = $f\\\")\\n println(\\\"$c ⊗ $d ⊕ $c ⊗ $e = $g\\\")\\n println(\\\"$c ⊗ ($d ⊕ $e) == $c ⊗ $d ⊕ $c ⊗ $e is ${f.eq(g)}\\\")\\n}\\n\",\n \"language\": \"V-(Vlang)\"\n },\n {\n \"code\": \"var MinusInf = -1/0\\n\\nclass MaxTropical {\\n construct new(r) {\\n if (r.type != Num || r == 1/0 || r == 0/0) {\\n Fiber.abort(\\\"Argument must be a real number or negative infinity.\\\")\\n }\\n _r = r\\n }\\n\\n r { _r }\\n\\n ==(other) {\\n if (other.type != MaxTropical) Fiber.abort(\\\"Argument must be a MaxTropical object.\\\")\\n return _r == other.r\\n }\\n\\n // equivalent to ⊕ operator\\n +(other) {\\n if (other.type != MaxTropical) Fiber.abort(\\\"Argument must be a MaxTropical object.\\\")\\n if (_r == MinusInf) return other\\n if (other.r == MinusInf) return this\\n return MaxTropical.new(_r.max(other.r))\\n }\\n\\n // equivalent to ⊗ operator\\n *(other) {\\n if (other.type != MaxTropical) Fiber.abort(\\\"Argument must be a MaxTropical object.\\\")\\n if (_r == 0) return other\\n if (other.r == 0) return this\\n return MaxTropical.new(_r + other.r)\\n }\\n\\n // exponentiation operator\\n ^(e) {\\n if (e.type != Num || !e.isInteger || e < 1) {\\n Fiber.abort(\\\"Argument must be a positive integer.\\\")\\n }\\n if (e == 1) return this\\n var pow = MaxTropical.new(_r)\\n for (i in 2..e) pow = pow * this\\n return pow\\n }\\n\\n toString { _r.toString }\\n}\\n\\nvar data = [\\n [2, -2, \\\"⊗\\\"],\\n [-0.001, MinusInf, \\\"⊕\\\"],\\n [0, MinusInf, \\\"⊗\\\"],\\n [1.5, -1, \\\"⊕\\\"],\\n [-0.5, 0, \\\"⊗\\\"]\\n]\\nfor (d in data) {\\n var a = MaxTropical.new(d[0])\\n var b = MaxTropical.new(d[1])\\n if (d[2] == \\\"⊕\\\") {\\n System.print(\\\"%(a) ⊕ %(b) = %(a + b)\\\")\\n } else {\\n System.print(\\\"%(a) ⊗ %(b) = %(a * b)\\\")\\n }\\n}\\n\\nvar c = MaxTropical.new(5)\\nSystem.print(\\\"%(c) ^ 7 = %(c ^ 7)\\\")\\n\\nvar d = MaxTropical.new(8)\\nvar e = MaxTropical.new(7)\\nvar f = c * (d + e)\\nvar g = c * d + c * e\\nSystem.print(\\\"%(c) ⊗ (%(d) ⊕ %(e)) = %(f)\\\")\\nSystem.print(\\\"%(c) ⊗ %(d) ⊕ %(c) ⊗ %(e) = %(g)\\\")\\nSystem.print(\\\"%(c) ⊗ (%(d) ⊕ %(e)) == %(c) ⊗ %(d) ⊕ %(c) ⊗ %(e) is %(f == g)\\\")\\n\",\n \"language\": \"Wren\"\n }\n]","isConversational":false},"task_name":{"kind":"string","value":"Tropical-algebra-overloading"}}},{"rowIdx":1773,"cells":{"solutions":{"kind":"list like","value":[{"code":"---\nfrom: http://rosettacode.org/wiki/Truncatable_primes\nnote: Prime Numbers\n","language":"00-META"},{"code":"A truncatable prime is a prime number that when you successively remove digits from one end of the prime, you are left with a new prime number.\n\n\n;Examples:\nThe number '''997''' is called a ''left-truncatable prime'' as the numbers '''997''', '''97''', and '''7''' are all prime. \n\nThe number '''7393''' is a ''right-truncatable prime'' as the numbers '''7393''', '''739''', '''73''', and '''7''' formed by removing digits from its right are also prime. \n\nNo zeroes are allowed in truncatable primes.\n\n\n;Task:\nThe task is to find the largest left-truncatable and right-truncatable primes less than one million (base 10 is implied).\n\n\n;Related tasks: \n* [[Find largest left truncatable prime in a given base]]\n* [[Sieve of Eratosthenes]]\n\n\n;See also:\n* [http://mathworld.wolfram.com/TruncatablePrime.html Truncatable Prime] from MathWorld.]\n<br><br>\n\n","language":"00-TASK"},{"code":"V MAX_PRIME = 1000000\nV primes = [1B] * MAX_PRIME\nprimes[0] = primes[1] = 0B\n\nV i = 2\nL i * i < MAX_PRIME\n L(j) (i * i .< MAX_PRIME).step(i)\n primes[j] = 0B\n i++\n L i < MAX_PRIME & !primes[i]\n i++\n\nF left_trunc(=n)\n V tens = 1\n L tens < n\n tens *= 10\n\n L n != 0\n I !:primes[n]\n R 0B\n tens I/= 10\n I n < tens\n R 0B\n n %= tens\n\n R 1B\n\nF right_trunc(=n)\n L n != 0\n I !:primes[n]\n R 0B\n n I/= 10\n R 1B\n\nL(n) (MAX_PRIME - 1 .< 0).step(-2)\n I left_trunc(n)\n print(‘Left: ’n)\n L.break\n\nL(n) (MAX_PRIME - 1 .< 0).step(-2)\n I right_trunc(n)\n print(‘Right: ’n)\n L.break\n","language":"11l"},{"code":"with Ada.Text_IO; use Ada.Text_IO;\nwith Ada.Containers.Ordered_Sets;\n\nprocedure Truncatable_Primes is\n package Natural_Set is new Ada.Containers.Ordered_Sets (Natural);\n use Natural_Set;\n\n Primes : Set;\n\n function Is_Prime (N : Natural) return Boolean is\n Position : Cursor := First (Primes);\n begin\n while Has_Element (Position) loop\n if N mod Element (Position) = 0 then\n return False;\n end if;\n Position := Next (Position);\n end loop;\n return True;\n end Is_Prime;\n\n function Is_Left_Trucatable_Prime (N : Positive) return Boolean is\n M : Natural := 1;\n begin\n while Contains (Primes, N mod (M * 10)) and (N / M) mod 10 > 0 loop\n M := M * 10;\n if N <= M then\n return True;\n end if;\n end loop;\n return False;\n end Is_Left_Trucatable_Prime;\n\n function Is_Right_Trucatable_Prime (N : Positive) return Boolean is\n M : Natural := N;\n begin\n while Contains (Primes, M) and M mod 10 > 0 loop\n M := M / 10;\n if M <= 1 then\n return True;\n end if;\n end loop;\n return False;\n end Is_Right_Trucatable_Prime;\n\n Position : Cursor;\nbegin\n for N in 2..1_000_000 loop\n if Is_Prime (N) then\n Insert (Primes, N);\n end if;\n end loop;\n Position := Last (Primes);\n while Has_Element (Position) loop\n if Is_Left_Trucatable_Prime (Element (Position)) then\n Put_Line (\"Largest LTP from 1..1000000:\" & Integer'Image (Element (Position)));\n exit;\n end if;\n Previous (Position);\n end loop;\n Position := Last (Primes);\n while Has_Element (Position) loop\n if Is_Right_Trucatable_Prime (Element (Position)) then\n Put_Line (\"Largest RTP from 1..1000000:\" & Integer'Image (Element (Position)));\n exit;\n end if;\n Previous (Position);\n end loop;\nend Truncatable_Primes;\n","language":"Ada"},{"code":"#!/usr/local/bin/a68g --script #\n\nPROC is prime = (INT n)BOOL:(\n []BOOL is short prime=(FALSE, TRUE, TRUE, FALSE, TRUE, FALSE, TRUE, FALSE, FALSE);\n IF n<=UPB is short prime THEN is short prime[n] # EXIT # ELSE\n IF ( NOT ODD n | TRUE | n MOD 3 = 0 ) THEN FALSE # EXIT # ELSE\n INT h := ENTIER sqrt(n)+3;\n FOR a FROM 7 BY 6 WHILE a<h DO\n IF ( n MOD a = 0 | TRUE | n MOD (a-2) = 0 ) THEN false exit FI\n OD;\n TRUE # EXIT #\n FI\n FI EXIT\n false exit: FALSE\n);\n\nPROC string to int = (STRING in a)INT:(\n FILE f; STRING a := in a; associate(f, a);\n INT i; get(f, i); close(f);\n i\n);\n\nPROC is trunc prime = (INT in n, PROC(REF STRING)VOID trunc)BOOL: (\n INT n := in n;\n STRING s := whole(n, 0);\n IF char in string(\"0\", NIL, s) THEN FALSE # EXIT #\n ELSE\n WHILE is prime(n) DO\n s := whole(n, 0);\n trunc(s);\n IF UPB s = 0 THEN true exit FI;\n n := string to int(s)\n OD;\n FALSE EXIT\n true exit: TRUE\n FI\n);\n\nPROC get trunc prime = (INT in n, PROC(REF STRING)VOID trunc)VOID:(\n FOR n FROM in n BY -1 TO 1 DO\n IF is trunc prime(n, trunc) THEN\n printf(($g(0)l$, n));\n break\n FI\n OD;\n break: ~\n);\n\nmain:(\n INT limit = 1000000;\n printf(($g g(0) gl$,\"Highest left- and right-truncatable primes under \",limit,\":\"));\n get trunc prime(limit, (REF STRING s)VOID: s := s[LWB s+1:]);\n get trunc prime(limit, (REF STRING s)VOID: s := s[:UPB s-1]);\n write(\"Press Enter\");\n read(newline)\n)\n","language":"ALGOL-68"},{"code":"leftTruncatable?: function [n][\n every? map 0..(size s)-1 'z -> to :integer slice s z (size s)-1\n => prime?\n]\n\nrightTruncatable?: function [n][\n every? map 0..(size s)-1 'z -> to :integer slice s 0 z\n => prime?\n]\n\nupperLimit: 999999\n\nloop range upperLimit .step:2 0 'x [\n s: to :string x\n if and? not? contains? s \"0\"\n leftTruncatable? x [\n print [\"highest left-truncatable:\" x]\n break\n ]\n]\n\nloop range upperLimit .step:2 0 'x [\n s: to :string x\n if and? not? contains? s \"0\"\n rightTruncatable? x [\n print [\"highest right-truncatable:\" x]\n break\n ]\n]\n","language":"Arturo"},{"code":"SetBatchLines, -1\nMsgBox, % \"Largest left-truncatable and right-truncatable primes less than one million:`n\"\n\t. \"Left:`t\" LTP(10 ** 6) \"`nRight:`t\" RTP(10 ** 6)\n\nLTP(n) {\n\twhile n {\n\t\tn--\n\t\tif (!Instr(n, \"0\") && IsPrime(n)) {\n\t\t\tLoop, % StrLen(n)\n\t\t\t\tif (!IsPrime(SubStr(n, A_Index)))\n\t\t\t\t\tcontinue, 2\n\t\t\tbreak\n\t\t}\n\t}\n\treturn, n\n}\n\nRTP(n) {\n\twhile n {\n\t\tn--\n\t\tif (!IsPrime(SubStr(n, 1, 1)))\n\t\t\tn -= 10 ** (StrLen(n) - 1)\n\t\tif (!Instr(n, \"0\") && IsPrime(n)) {\n\t\t\tLoop, % StrLen(n)\n\t\t\t\tif (!IsPrime(SubStr(n, 1, A_Index)))\n\t\t\t\t\tcontinue, 2\n\t\t\tbreak\n\t\t}\n\t}\n\treturn, n\n}\n\nIsPrime(n) {\n\tif (n < 2)\n\t\treturn, 0\n\telse if (n < 4)\n\t\treturn, 1\n\telse if (!Mod(n, 2))\n\t\treturn, 0\n\telse if (n < 9)\n\t\treturn 1\n\telse if (!Mod(n, 3))\n\t\treturn, 0\n\telse {\n\t\tr := Floor(Sqrt(n))\n\t\tf := 5\n\t\twhile (f <= r) {\n\t\t\tif (!Mod(n, f))\n\t\t\t\treturn, 0\n\t\t\tif (!Mod(n, (f + 2)))\n\t\t\t\treturn, 0\n\t\t\tf += 6\n\t\t}\n\t\treturn, 1\n\t}\n}\n","language":"AutoHotkey"},{"code":"# syntax: GAWK -f TRUNCATABLE_PRIMES.AWK\nBEGIN {\n limit = 1000000\n for (i=1; i<=limit; i++) {\n if (is_prime(i)) {\n prime_count++\n arr[i] = \"\"\n if (truncate_left(i) == 1) {\n max_left = max(max_left,i)\n }\n if (truncate_right(i) == 1) {\n max_right = max(max_right,i)\n }\n }\n }\n printf(\"1-%d: %d primes\\n\",limit,prime_count)\n printf(\"largest L truncatable: %d\\n\",max_left)\n printf(\"largest R truncatable: %d\\n\",max_right)\n exit(0)\n}\nfunction is_prime(x, i) {\n if (x <= 1) {\n return(0)\n }\n for (i=2; i<=int(sqrt(x)); i++) {\n if (x % i == 0) {\n return(0)\n }\n }\n return(1)\n}\nfunction truncate_left(n) {\n while (n != \"\") {\n if (!(n in arr)) {\n return(0)\n }\n n = substr(n,2)\n }\n return(1)\n}\nfunction truncate_right(n) {\n while (n != \"\") {\n if (!(n in arr)) {\n return(0)\n }\n n = substr(n,1,length(n)-1)\n }\n return(1)\n}\nfunction max(x,y) { return((x > y) ? x : y) }\n","language":"AWK"},{"code":"( 1000001:?i\n& whl\n ' ( !i+-2:>0:?i\n & !i:?L\n & whl'(!L^1/2:#?^1/2&@(!L:% ?L))\n & !L:~\n )\n& out$(\"left:\" !i)\n& 1000001:?i\n& whl\n ' ( !i+-2:>0:?i\n & !i:?R\n & whl'(!R^1/2:#?^1/2&@(!R:?R %@))\n & !R:~\n )\n& out$(\"right:\" !i)\n)\n","language":"Bracmat"},{"code":"#include <stdio.h>\n#include <stdlib.h>\n#include <string.h>\n\n#define MAX_PRIME 1000000\nchar *primes;\nint n_primes;\n\n/* Sieve. If we were to handle 10^9 range, use bit field. Regardless,\n * if a large amount of prime numbers need to be tested, sieve is fast.\n */\nvoid init_primes()\n{\n\tint j;\n\tprimes = malloc(sizeof(char) * MAX_PRIME);\n\tmemset(primes, 1, MAX_PRIME);\n\tprimes[0] = primes[1] = 0;\n\tint i = 2;\n\twhile (i * i < MAX_PRIME) {\n\t\tfor (j = i * 2; j < MAX_PRIME; j += i)\n\t\t\tprimes[j] = 0;\n\t\twhile (++i < MAX_PRIME && !primes[i]);\n\t}\n}\n\nint left_trunc(int n)\n{\n\tint tens = 1;\n\twhile (tens < n) tens *= 10;\n\n\twhile (n) {\n\t\tif (!primes[n]) return 0;\n\t\ttens /= 10;\n\t\tif (n < tens) return 0;\n\t\tn %= tens;\n\t}\n\treturn 1;\n}\n\nint right_trunc(int n)\n{\n\twhile (n) {\n\t\tif (!primes[n]) return 0;\n\t\tn /= 10;\n\t}\n\treturn 1;\n}\n\nint main()\n{\n\tint n;\n\tint max_left = 0, max_right = 0;\n\tinit_primes();\n\n\tfor (n = MAX_PRIME - 1; !max_left; n -= 2)\n\t\tif (left_trunc(n)) max_left = n;\n\n\tfor (n = MAX_PRIME - 1; !max_right; n -= 2)\n\t\tif (right_trunc(n)) max_right = n;\n\n\tprintf(\"Left: %d; right: %d\\n\", max_left, max_right);\n\treturn 0;\n}\n","language":"C"},{"code":"Left: 998443; right: 739399\n","language":"C"},{"code":"#include <stdio.h>\n\n#define MAXN 1000000\nint maxl, maxr;\n\nint is_prime(int n)\n{\n\tint p;\n\tif (n % 3 == 0) return 0;\n\n\tfor (p = 6; p * p <= n; p += 6)\n\t\tif (!(n % (p + 1) && n % (p + 5)))\n\t\t\treturn 0;\n\treturn 1;\n}\n\nvoid left(int n, int tens)\n{\n\tint i, nn;\n\n\tif (n > maxl) maxl = n;\n\tif (n < MAXN / 10)\n\t\tfor (tens *= 10, i = 1; i < 10; i++)\n\t\t\tif (is_prime(nn = i * tens + n))\n\t\t\t\tleft(nn, tens);\n}\n\nvoid right(int n)\n{\n\tint i, nn;\n\tstatic int d[] = {1,3,7,9};\n\n\tif (n > maxr) maxr = n;\n\tif (n < MAXN / 10)\n\t\tfor (i = 1; i < 4; i++)\n\t\t\tif (is_prime(nn = n * 10 + d[i])) right(nn);\n}\n\nint main(void)\n{\n\tleft(3, 1); left(7, 1);\n\tright(3); right(5); right(7);\n\n\tprintf(\"%d %d\\n\", maxl, maxr);\n\n\treturn 0;\n}\n","language":"C"},{"code":"#include <iostream>\n#include \"prime_sieve.hpp\"\n\nbool is_left_truncatable(const prime_sieve& sieve, int p) {\n for (int n = 10, q = p; p > n; n *= 10) {\n if (!sieve.is_prime(p % n) || q == p % n)\n return false;\n q = p % n;\n }\n return true;\n}\n\nbool is_right_truncatable(const prime_sieve& sieve, int p) {\n for (int q = p/10; q > 0; q /= 10) {\n if (!sieve.is_prime(q))\n return false;\n }\n return true;\n}\n\nint main() {\n const int limit = 1000000;\n\n // find the prime numbers up to the limit\n prime_sieve sieve(limit + 1);\n\n int largest_left = 0;\n int largest_right = 0;\n // find largest left truncatable prime\n for (int p = limit; p >= 2; --p) {\n if (sieve.is_prime(p) && is_left_truncatable(sieve, p)) {\n largest_left = p;\n break;\n }\n }\n // find largest right truncatable prime\n for (int p = limit; p >= 2; --p) {\n if (sieve.is_prime(p) && is_right_truncatable(sieve, p)) {\n largest_right = p;\n break;\n }\n }\n // write results to standard output\n std::cout << \"Largest left truncatable prime is \" << largest_left << '\\n';\n std::cout << \"Largest right truncatable prime is \" << largest_right << '\\n';\n return 0;\n}\n","language":"C++"},{"code":"#ifndef PRIME_SIEVE_HPP\n#define PRIME_SIEVE_HPP\n\n#include <algorithm>\n#include <vector>\n\n/**\n * A simple implementation of the Sieve of Eratosthenes.\n * See https://en.wikipedia.org/wiki/Sieve_of_Eratosthenes.\n */\nclass prime_sieve {\npublic:\n explicit prime_sieve(size_t);\n bool is_prime(size_t) const;\nprivate:\n std::vector<bool> is_prime_;\n};\n\n/**\n * Constructs a sieve with the given limit.\n *\n * @param limit the maximum integer that can be tested for primality\n */\ninline prime_sieve::prime_sieve(size_t limit) {\n limit = std::max(size_t(3), limit);\n is_prime_.resize(limit/2, true);\n for (size_t p = 3; p * p <= limit; p += 2) {\n if (is_prime_[p/2 - 1]) {\n size_t inc = 2 * p;\n for (size_t q = p * p; q <= limit; q += inc)\n is_prime_[q/2 - 1] = false;\n }\n }\n}\n\n/**\n * Returns true if the given integer is a prime number. The integer\n * must be less than or equal to the limit passed to the constructor.\n *\n * @param n an integer less than or equal to the limit passed to the\n * constructor\n * @return true if the integer is prime\n */\ninline bool prime_sieve::is_prime(size_t n) const {\n if (n == 2)\n return true;\n if (n < 2 || n % 2 == 0)\n return false;\n return is_prime_.at(n/2 - 1);\n}\n\n#endif\n","language":"C++"},{"code":"using System; // 4790@3.6\nusing System.Collections.Generic;\nclass truncatable_primes\n{\n static void Main()\n {\n uint m = 1000000;\n Console.Write(\"L \" + L(m) + \" R \" + R(m) + \" \");\n var sw = System.Diagnostics.Stopwatch.StartNew();\n for (int i = 1000; i > 0; i--) { L(m); R(m); }\n Console.Write(sw.Elapsed); Console.Read();\n }\n\n static uint L(uint n)\n {\n n -= n & 1; n--;\n for (uint d, d1 = 100; ; n -= 2)\n {\n while (n % 3 == 0 || n % 5 == 0 || n % 7 == 0) n -= 2;\n if ((d = n % 10) == 3 || d == 7)\n {\n while (d1 < n && d < (d = n % d1) && isP(d)) d1 *= 10;\n if (d1 > n && isP(n)) return n; d1 = 100;\n }\n }\n }\n\n static uint R(uint m)\n {\n var p = new List<uint>() { 2, 3, 5, 7 }; uint n = 20, np;\n for (int i = 1; i < p.Count; n = 10 * p[i++])\n {\n if ((np = n + 1) >= m) break; if (isP(np)) p.Add(np);\n if ((np = n + 3) >= m) break; if (isP(np)) p.Add(np);\n if ((np = n + 7) >= m) break; if (isP(np)) p.Add(np);\n if ((np = n + 9) >= m) break; if (isP(np)) p.Add(np);\n }\n return p[p.Count - 1];\n }\n\n static bool isP(uint n)\n {\n if (n < 7) return n == 2 || n == 3 || n == 5;\n if ((n & 1) == 0 || n % 3 == 0 || n % 5 == 0) return false;\n for (uint r = (uint)Math.Sqrt(n), d = 7; d <= r; d += 30)\n if (n % (d + 00) == 0 || n % (d + 04) == 0 ||\n n % (d + 06) == 0 || n % (d + 10) == 0 ||\n n % (d + 12) == 0 || n % (d + 16) == 0 ||\n n % (d + 22) == 0 || n % (d + 24) == 0) return false;\n return true;\n }\n}\n","language":"C-sharp"},{"code":"(use '[clojure.contrib.lazy-seqs :only [primes]])\n\n(def prime?\n (let [mem (ref #{})\n\tprimes (ref primes)]\n (fn [n]\n (dosync\n (if (< n (first @primes))\n\t (@mem n)\n\t (let [[mems ss] (split-with #(<= % n) @primes)]\n\t (ref-set primes ss)\n\t ((commute mem into mems) n)))))))\n\n(defn drop-lefts [n]\n (let [dropl #(if (< % 10) 0 (Integer. (subs (str %) 1)))]\n (->> (iterate dropl n)\n\t (take-while pos? ,)\n\t next)))\n\n(defn drop-rights [n]\n (->> (iterate #(quot % 10) n)\n next\n (take-while pos? ,)))\n\n(defn truncatable-left? [n]\n (every? prime? (drop-lefts n)))\n\n(defn truncatable-right? [n]\n (every? prime? (drop-rights n)))\n\nuser> (->> (for [p primes\n\t :while (< p 1000000)\n\t :when (not-any? #{\\0} (str p))\n\t :let [l? (if (truncatable-left? p) p 0)\n\t\t r? (if (truncatable-right? p) p 0)]\n\t :when (or l? r?)]\n [l? r?])\n ((juxt #(apply max-key first %) #(apply max-key second %)) ,)\n ((juxt ffirst (comp second second)) ,)\n (map vector [\"left truncatable: \" \"right truncatable: \"] ,))\n([\"left truncatable: \" 998443] [\"right truncatable: \" 739399])\n","language":"Clojure"},{"code":"# You could have symmetric algorithms for max right and left\n# truncatable numbers, but they lend themselves to slightly\n# different optimizations.\n\nmax_right_truncatable_number = (n, f) ->\n # This algorithm only evaluates 37 numbers for primeness to\n # get the max right truncatable prime < 1000000. Its\n # optimization is that it prunes candidates for\n # the first n-1 digits before having to iterate through\n # the 10 possibilities for the last digit.\n if n < 10\n candidate = n\n while candidate > 0\n return candidate if f(candidate)\n candidate -= 1\n else\n left = Math.floor n / 10\n while left > 0\n left = max_right_truncatable_number left, f\n right = 9\n while right > 0\n candidate = left * 10 + right\n return candidate if candidate <= n and f(candidate)\n right -= 1\n left -= 1\n throw Error \"none found\"\n\nmax_left_truncatable_number = (max, f) ->\n # This is a pretty straightforward countdown. The first\n # optimization here would probably be to cache results of\n # calling f on small numbers.\n is_left_truncatable = (n) ->\n candidate = 0\n power_of_ten = 1\n while n > 0\n r = n % 10\n return false if r == 0\n n = Math.floor n / 10\n candidate = r * power_of_ten + candidate\n power_of_ten *= 10\n return false unless f(candidate)\n true\n do ->\n n = max\n while n > 0\n return n if is_left_truncatable n, f\n n -= 1\n throw Error \"none found\"\n\nis_prime = (n) ->\n return false if n == 1\n return true if n == 2\n for d in [2..n]\n return false if n % d == 0\n return true if d * d >= n\n\n\nconsole.log \"right\", max_right_truncatable_number(999999, is_prime)\nconsole.log \"left\", max_left_truncatable_number(999999, is_prime)\n","language":"CoffeeScript"},{"code":"> coffee truncatable_prime.coffee\nright 739399\nleft 998443\n","language":"CoffeeScript"},{"code":"(defun start ()\n (format t \"Largest right-truncatable ~a~%\" (max-right-truncatable))\n (format t \"Largest left-truncatable ~a~%\" (max-left-truncatable)))\n\n(defun max-right-truncatable ()\n (loop for el in (6-digits-R-truncatables)\n maximizing el into max\n finally (return max)))\n\n(defun 6-digits-R-truncatables (&optional (lst '(2 3 5 7)) (n 5))\n (if (zerop n)\n lst\n (6-digits-R-truncatables (R-trunc lst) (- n 1))))\n\n(defun R-trunc (lst)\n (remove-if (lambda (x) (not (primep x)))\n\t (loop for el in lst\n\t\t append (mapcar (lambda (x) (+ (* 10 el) x)) '(1 3 7 9)))))\n\n(defun max-left-truncatable ()\n (loop for el in (6-digits-L-truncatables)\n maximizing el into max\n finally (return max)))\n\n(defun 6-digits-L-truncatables (&optional (lst '(3 7)) (n 5))\n (if (zerop n)\n lst\n (6-digits-L-truncatables (L-trunc lst (- 6 n)) (- n 1))))\n\n(defun L-trunc (lst n)\n (remove-if (lambda (x) (not (primep x)))\n\t (loop for el in lst\n\t\t append (mapcar (lambda (x) (+ (* (expt 10 n) x) el)) '(1 2 3 4 5 6 7 8 9)))))\n\n(defun primep (n)\n (primep-aux n 2))\n\n(defun primep-aux (n d)\n (cond ((> d (sqrt n)) t)\n ((zerop (rem n d)) nil)\n (t (primep-aux n (+ d 1)))))\n","language":"Common-Lisp"},{"code":"import std.stdio, std.math, std.string, std.conv, std.algorithm,\n std.range;\n\nbool isPrime(in int n) pure nothrow {\n if (n <= 1)\n return false;\n foreach (immutable i; 2 .. cast(int)sqrt(real(n)) + 1)\n if (!(n % i))\n return false;\n return true;\n}\n\nbool isTruncatablePrime(bool left)(in int n) pure {\n immutable s = n.text;\n if (s.canFind('0'))\n return false;\n foreach (immutable i; 0 .. s.length)\n static if (left) {\n if (!s[i .. $].to!int.isPrime)\n return false;\n } else {\n if (!s[0 .. i + 1].to!int.isPrime)\n return false;\n }\n return true;\n}\n\nvoid main() {\n enum n = 1_000_000;\n writeln(\"Largest left-truncatable prime in 2 .. \", n, \": \",\n iota(n, 1, -1).filter!(isTruncatablePrime!true).front);\n writeln(\"Largest right-truncatable prime in 2 .. \", n, \": \",\n iota(n, 1, -1).filter!(isTruncatablePrime!false).front);\n}\n","language":"D"},{"code":"procedure TruncatablePrimes(Memo: TMemo);\nvar Sieve: TPrimeSieve;\nvar I,P: integer;\n\n\n\tfunction IsLeftTruncatable(P: integer): boolean;\n\t{A prime is Left truncatable, if you can remove digits}\n\t{one at a time from the left and it is still prime}\n\tvar S: string;\n\tvar P2: integer;\n\tbegin\n\tResult:=False;\n\t{Conver number to string}\n\tS:=IntToStr(P);\n\t{Delete one char from the left}\n\tDelete(S,1,1);\n\twhile Length(S)>0 do\n\t\tbegin\n\t\t{Zeros no allowed}\n\t\tif S[1]='0' then exit;\n\t\t{Convert back to number}\n\t\tP2:=StrToInt(S);\n\t\t{Exit if it is not prime}\n\t\tif not Sieve.Flags[P2] then exit;\n\t\t{Delete next char from left}\n\t\tDelete(S,1,1);\n\t\tend;\n\t{If all truncated numbers are prime}\n\tResult:=True;\n\tend;\n\n\n\tfunction IsRightTruncatable(P: integer): boolean;\n\t{A prime is right truncatable, if you can remove digits}\n\t{one at a time from the right and it is still prime}\n\tvar S: string;\n\tvar P2: integer;\n\tbegin\n\tResult:=False;\n\t{Conver number to string}\n\tS:=IntToStr(P);\n\t{Delete one char from the right}\n\tDelete(S,Length(S),1);\n\twhile Length(S)>0 do\n\t\tbegin\n\t\t{No zeros allowed}\n\t\tif S[1]='0' then exit;\n\t\t{Convert back to number}\n\t\tP2:=StrToInt(S);\n\t\t{exit if it is not prime}\n\t\tif not Sieve.Flags[P2] then exit;\n\t\t{Delete next char from the right}\n\t\tDelete(S,Length(S),1);\n\t\tend;\n\t{If all truncated numbers are prime}\n\tResult:=True;\n\tend;\n\n\n\nbegin\nSieve:=TPrimeSieve.Create;\ntry\n{Look at primes under 1 million}\nSieve.Intialize(1000000);\n{Look for the highest Left Truncatable prime}\n{Test all primes from 1 million down}\nfor I:=Sieve.PrimeCount-1 downto 0 do\n\tbegin\n\tP:=Sieve.Primes[I];\n\t{The first number that is Left Truncatable, will be the highest}\n\tif IsLeftTruncatable(P) then\n\t\tbegin\n\t\tMemo.Lines.Add(IntToStr(P));\n\t\tbreak;\n\t\tend;\n\tend;\n{Look for the highest Right Truncatable prime}\n{Test all primes from 1 million down}\nfor I:=Sieve.PrimeCount-1 downto 0 do\n\tbegin\n\tP:=Sieve.Primes[I];\n\tif IsRightTruncatable(P) then\n\t\tbegin\n\t\tMemo.Lines.Add(IntToStr(P));\n\t\tbreak;\n\t\tend;\n\tend;\nfinally Sieve.Free; end;\nend;\n","language":"Delphi"},{"code":"fastfunc isprim num .\n if num < 2\n return 0\n .\n i = 2\n while i <= sqrt num\n if num mod i = 0\n return 0\n .\n i += 1\n .\n return 1\n.\nfunc isright h .\n while h > 0\n if isprim h = 0\n return 0\n .\n h = h div 10\n .\n return 1\n.\nfunc isleft h .\n d = pow 10 (floor log10 h)\n while h > 0\n if isprim h = 0\n return 0\n .\n if h div d = 0\n return 0\n .\n h = h mod d\n d /= 10\n .\n return 1\n.\np = 999999\nwhile isleft p = 0\n p -= 2\n.\nprint p\np = 999999\nwhile isright p = 0\n p -= 2\n.\nprint p\n","language":"EasyLang"},{"code":";; does p include a 0 in its decimal representation ?\n(define (nozero? n) (= -1 (string-index (number->string n) \"0\")))\n\n;; right truncate : p and successive quotients by 10 (integer division) must be primes\n(define (right-trunc p) (unless (zero? p)\n\t(and (prime? p) (right-trunc (quotient p 10)))))\n(remember 'right-trunc)\n\n;; left truncate : p and successive modulo by 10, 100, .. must be prime\n(define (left-trunc p (mod 1000000))\n\t(unless (< mod 1)\n\t(and (prime? p) (nozero? p) (left-trunc (modulo p mod) (/ mod 10)))))\n\n;; start from 999999. stop on first found\n(define (fact-trunc trunc)\n(for ((p (in-range 999999 100000 -1))) #:break (when (trunc p) (writeln p) #t)))\n","language":"EchoLisp"},{"code":"(fact-trunc left-trunc)\n998443\n(fact-trunc right-trunc)\n739399\n","language":"EchoLisp"},{"code":"class\n\tAPPLICATION\n\ncreate\n\tmake\n\nfeature\n\n\tmake\n\t\tdo\n\t\t\tio.put_string (\"Largest right truncatable prime: \" + find_right_truncatable_primes.out)\n\t\t\tio.new_line\n\t\t\tio.put_string (\"Largest left truncatable prime: \" + find_left_truncatable_primes.out)\n\t\tend\n\n\tfind_right_truncatable_primes: INTEGER\n\t\t\t-- Largest right truncatable prime below 1000000.\n\t\tlocal\n\t\t\ti, maybe_prime: INTEGER\n\t\t\tfound, is_one: BOOLEAN\n\t\tdo\n\t\t\tfrom\n\t\t\t\ti := 999999\n\t\t\tuntil\n\t\t\t\tfound\n\t\t\tloop\n\t\t\t\tis_one := True\n\t\t\t\tfrom\n\t\t\t\t\tmaybe_prime := i\n\t\t\t\tuntil\n\t\t\t\t\tnot is_one or maybe_prime.out.count = 1\n\t\t\t\tloop\n\t\t\t\t\tif maybe_prime.out.has ('0') or maybe_prime.out.has ('2') or maybe_prime.out.has ('4') or maybe_prime.out.has ('6') or maybe_prime.out.has ('8') then\n\t\t\t\t\t\tis_one := False\n\t\t\t\t\telse\n\t\t\t\t\t\tif not is_prime (maybe_prime) then\n\t\t\t\t\t\t\tis_one := False\n\t\t\t\t\t\telseif is_prime (maybe_prime) and maybe_prime.out.count > 1 then\n\t\t\t\t\t\t\tmaybe_prime := truncate_right (maybe_prime)\n\t\t\t\t\t\tend\n\t\t\t\t\tend\n\t\t\t\tend\n\t\t\t\tif is_one then\n\t\t\t\t\tfound := True\n\t\t\t\t\tResult := i\n\t\t\t\tend\n\t\t\t\ti := i - 2\n\t\t\tend\n\t\tensure\n\t\t\tResult_is_smaller: Result < 1000000\n\t\tend\n\n\tfind_left_truncatable_primes: INTEGER\n\t\t\t-- Largest left truncatable prime below 1000000.\n\t\tlocal\n\t\t\ti, maybe_prime: INTEGER\n\t\t\tfound, is_one: BOOLEAN\n\t\tdo\n\t\t\tfrom\n\t\t\t\ti := 999999\n\t\t\tuntil\n\t\t\t\tfound\n\t\t\tloop\n\t\t\t\tis_one := True\n\t\t\t\tfrom\n\t\t\t\t\tmaybe_prime := i\n\t\t\t\tuntil\n\t\t\t\t\tnot is_one or maybe_prime.out.count = 1\n\t\t\t\tloop\n\t\t\t\t\tif not is_prime (maybe_prime) then\n\t\t\t\t\t\tis_one := False\n\t\t\t\t\telseif is_prime (maybe_prime) and maybe_prime.out.count > 1 then\n\t\t\t\t\t\tif maybe_prime.out.at (2) = '0' then\n\t\t\t\t\t\t\tis_one := False\n\t\t\t\t\t\telse\n\t\t\t\t\t\t\tmaybe_prime := truncate_left (maybe_prime)\n\t\t\t\t\t\tend\n\t\t\t\t\tend\n\t\t\t\tend\n\t\t\t\tif is_one then\n\t\t\t\t\tfound := True\n\t\t\t\t\tResult := i\n\t\t\t\tend\n\t\t\t\ti := i - 2\n\t\t\tend\n\t\tensure\n\t\t\tResult_is_smaller: Result < 1000000\n\t\tend\n\nfeature {NONE}\n\n\tis_prime (n: INTEGER): BOOLEAN\n\t\t\t--Is 'n' a prime number?\n\t\trequire\n\t\t\tpositiv_input: n > 0\n\t\tlocal\n\t\t\ti: INTEGER\n\t\t\tmax: REAL_64\n\t\t\tmath: DOUBLE_MATH\n\t\tdo\n\t\t\tcreate math\n\t\t\tif n = 2 then\n\t\t\t\tResult := True\n\t\t\telseif n <= 1 or n \\\\ 2 = 0 then\n\t\t\t\tResult := False\n\t\t\telse\n\t\t\t\tResult := True\n\t\t\t\tmax := math.sqrt (n)\n\t\t\t\tfrom\n\t\t\t\t\ti := 3\n\t\t\t\tuntil\n\t\t\t\t\ti > max\n\t\t\t\tloop\n\t\t\t\t\tif n \\\\ i = 0 then\n\t\t\t\t\t\tResult := False\n\t\t\t\t\tend\n\t\t\t\t\ti := i + 2\n\t\t\t\tend\n\t\t\tend\n\t\tend\n\n\ttruncate_left (n: INTEGER): INTEGER\n\t\t\t-- 'n' truncated by one digit from the left side.\n\t\trequire\n\t\t\ttruncatable: n.out.count > 1\n\t\tlocal\n\t\t\tst: STRING\n\t\tdo\n\t\t\tst := n.out\n\t\t\tst.remove_head (1)\n\t\t\tResult := st.to_integer\n\t\tensure\n\t\t\tResult_truncated: Result.out.count = n.out.count - 1\n\t\tend\n\n\ttruncate_right (n: INTEGER): INTEGER\n\t\t\t-- 'n' truncated by one digit from the right side.\n\t\trequire\n\t\t\ttruncatable: n.out.count > 1\n\t\tlocal\n\t\t\tst: STRING\n\t\tdo\n\t\t\tst := n.out\n\t\t\tst.remove_tail (1)\n\t\t\tResult := st.to_integer\n\t\tensure\n\t\t\tResult_truncated: Result.out.count = n.out.count - 1\n\t\tend\n\nend\n","language":"Eiffel"},{"code":"import extensions;\n\nconst MAXN = 1000000;\n\nextension mathOp\n{\n isPrime()\n {\n int n := cast int(self);\n\n if (n < 2) { ^ false };\n if (n < 4) { ^ true };\n if (n.mod(2) == 0) { ^ false };\n if (n < 9) { ^ true };\n if (n.mod(3) == 0) { ^ false };\n\n int r := n.sqrt();\n int f := 5;\n while (f <= r)\n {\n if ((n.mod(f) == 0) || (n.mod(f + 2) == 0))\n { ^ false };\n\n f := f + 6\n };\n\n ^ true\n }\n\n isRightTruncatable()\n {\n int n := self;\n\n while (n != 0)\n {\n ifnot (n.isPrime())\n { ^ false };\n\n n := n / 10\n };\n\n ^ true\n }\n\n isLeftTruncatable()\n {\n int n := self;\n int tens := 1;\n\n while (tens < n)\n { tens := tens * 10 };\n\n while (n != 0)\n {\n ifnot (n.isPrime())\n { ^ false };\n\n tens := tens / 10;\n n := n - (n / tens * tens)\n };\n\n ^ true\n }\n}\n\npublic program()\n{\n var n := MAXN;\n var max_lt := 0;\n var max_rt := 0;\n\n while (max_lt == 0 || max_rt == 0)\n {\n if(n.toString().indexOf(\"0\") == -1)\n {\n if ((max_lt == 0) && (n.isLeftTruncatable()))\n {\n max_lt := n\n };\n\n if ((max_rt == 0) && (n.isRightTruncatable()))\n {\n max_rt := n\n }\n };\n\n n := n - 1\n };\n\n console.printLine(\"Largest truncable left is \",max_lt);\n console.printLine(\"Largest truncable right is \",max_rt);\n\n console.readChar()\n}\n","language":"Elena"},{"code":"defmodule Prime do\n defp left_truncatable?(n, prime) do\n func = fn i when i<=9 -> 0\n i -> to_string(i) |> String.slice(1..-1) |> String.to_integer end\n truncatable?(n, prime, func)\n end\n\n defp right_truncatable?(n, prime) do\n truncatable?(n, prime, fn i -> div(i, 10) end)\n end\n\n defp truncatable?(n, prime, trunc_func) do\n if to_string(n) |> String.match?(~r/0/),\n do: false,\n else: trunc_loop(trunc_func.(n), prime, trunc_func)\n end\n\n defp trunc_loop(0, _prime, _trunc_func), do: true\n defp trunc_loop(n, prime, trunc_func) do\n if elem(prime,n), do: trunc_loop(trunc_func.(n), prime, trunc_func), else: false\n end\n\n def eratosthenes(limit) do # descending order\n Enum.to_list(2..limit) |> sieve(:math.sqrt(limit), [])\n end\n\n defp sieve([h|_]=list, max, sieved) when h>max, do: Enum.reverse(list, sieved)\n defp sieve([h | t], max, sieved) do\n list = for x <- t, rem(x,h)>0, do: x\n sieve(list, max, [h | sieved])\n end\n\n defp prime_table(_, [], list), do: [false, false | list]\n defp prime_table(n, [n|t], list), do: prime_table(n-1, t, [true|list])\n defp prime_table(n, prime, list), do: prime_table(n-1, prime, [false|list])\n\n def task(limit \\\\ 1000000) do\n prime = eratosthenes(limit)\n prime_tuple = prime_table(limit, prime, []) |> List.to_tuple\n left = Enum.find(prime, fn n -> left_truncatable?(n, prime_tuple) end)\n IO.puts \"Largest left-truncatable prime : #{left}\"\n right = Enum.find(prime, fn n -> right_truncatable?(n, prime_tuple) end)\n IO.puts \"Largest right-truncatable prime: #{right}\"\n end\nend\n\nPrime.task\n","language":"Elixir"},{"code":"USING: formatting fry grouping.extras kernel literals math\nmath.parser math.primes sequences ;\nIN: rosetta-code.truncatable-primes\n\nCONSTANT: primes $[ 1,000,000 primes-upto reverse ]\n\n: number>digits ( n -- B{} ) number>string string>digits ;\n\n: no-zeros? ( seq -- ? ) [ zero? not ] all? ;\n\n: all-prime? ( seq -- ? ) [ prime? ] all? ;\n\n: truncate ( seq quot -- seq' ) call( seq -- seq' )\n [ 10 digits>integer ] map ;\n\n: truncate-right ( seq -- seq' ) [ head-clump ] truncate ;\n\n: truncate-left ( seq -- seq' ) [ tail-clump ] truncate ;\n\n: truncatable-prime? ( n quot -- ? ) [ number>digits ] dip\n '[ @ all-prime? ] [ no-zeros? ] bi and ; inline\n\n: right-truncatable-prime? ( n -- ? ) [ truncate-right ]\n truncatable-prime? ;\n\n: left-truncatable-prime? ( n -- ? ) [ truncate-left ]\n truncatable-prime? ;\n\n: find-truncatable-primes ( -- ltp rtp )\n primes [ [ left-truncatable-prime? ] find nip ]\n [ [ right-truncatable-prime? ] find nip ] bi ;\n\n: main ( -- ) find-truncatable-primes\n \"Left: %d\\nRight: %d\\n\" printf ;\n\nMAIN: main\n","language":"Factor"},{"code":": prime? ( n -- ? ) here + c@ 0= ;\n: notprime! ( n -- ) here + 1 swap c! ;\n\n: sieve ( n -- )\n here over erase\n 0 notprime!\n 1 notprime!\n 2\n begin\n 2dup dup * >\n while\n dup prime? if\n 2dup dup * do\n i notprime!\n dup +loop\n then\n 1+\n repeat\n 2drop ;\n\n: left_truncatable_prime? ( n -- flag )\n dup prime? invert if\n drop false exit\n then\n dup >r\n 10\n begin\n 2dup >\n while\n 2dup mod\n dup r> = if\n 2drop drop false exit\n then\n dup prime? invert if\n 2drop drop false exit\n then\n >r\n 10 *\n repeat\n 2drop rdrop true ;\n\n: right_truncatable_prime? ( n -- flag )\n dup prime? invert if\n drop false exit\n then\n begin\n 10 / dup 0 >\n while\n dup prime? invert if\n drop false exit\n then\n repeat\n drop true ;\n\n: max_left_truncatable_prime ( n -- )\n begin\n dup 0 >\n while\n dup left_truncatable_prime? if . cr exit then\n 1-\n repeat drop ;\n\n: max_right_truncatable_prime ( n -- )\n begin\n dup 0 >\n while\n dup right_truncatable_prime? if . cr exit then\n 1-\n repeat drop ;\n\n1000000 constant limit\n\nlimit 1+ sieve\n\n.\" Largest left truncatable prime: \"\nlimit max_left_truncatable_prime\n\n.\" Largest right truncatable prime: \"\nlimit max_right_truncatable_prime\n\nbye\n","language":"Forth"},{"code":"module primes_mod\n implicit none\n\n logical, allocatable :: primes(:)\n\ncontains\n\nsubroutine Genprimes(parr)\n logical, intent(in out) :: parr(:)\n integer :: i\n! Prime sieve\n parr = .true.\n parr (1) = .false.\n parr (4 : size(parr) : 2) = .false.\n do i = 3, int (sqrt (real (size(parr)))), 2\n if (parr(i)) parr(i * i : size(parr) : i) = .false.\n end do\n\nend subroutine\n\nfunction is_rtp(candidate)\n logical :: is_rtp\n integer, intent(in) :: candidate\n integer :: n\n\n is_rtp = .true.\n n = candidate / 10\n do while(n > 0)\n if(.not. primes(n)) then\n is_rtp = .false.\n return\n end if\n n = n / 10\n end do\n\nend function\n\nfunction is_ltp(candidate)\n logical :: is_ltp\n integer, intent(in) :: candidate\n integer :: i, n\n character(10) :: nstr\n\n write(nstr, \"(i10)\") candidate\n is_ltp = .true.\n do i = len_trim(nstr)-1, 1, -1\n n = mod(candidate, 10**i)\n if(.not. primes(n)) then\n is_ltp = .false.\n return\n end if\n end do\nend function\n\nend module primes_mod\n\nprogram Truncatable_Primes\n use primes_mod\n implicit none\n\n integer, parameter :: limit = 999999\n integer :: i\n character(10) :: nstr\n\n! Generate an array of prime flags up to limit of search\n allocate(primes(limit))\n call Genprimes(primes)\n\n! Find left truncatable prime\n do i = limit, 1, -1\n write(nstr, \"(i10)\") i\n if(index(trim(nstr), \"0\") /= 0) cycle ! check for 0 in number\n if(is_ltp(i)) then\n write(*, \"(a, i0)\") \"Largest left truncatable prime below 1000000 is \", i\n exit\n end if\n end do\n\n! Find right truncatable prime\n do i = limit, 1, -1\n write(nstr, \"(i10)\") i\n if(index(trim(nstr), \"0\") /= 0) cycle ! check for 0 in number\n if(is_rtp(i)) then\n write(*, \"(a, i0)\") \"Largest right truncatable prime below 1000000 is \", i\n exit\n end if\n end do\nend program\n","language":"Fortran"},{"code":"' FB 1.05.0 Win64\n\nFunction isPrime(n As Integer) As Boolean\n If n Mod 2 = 0 Then Return n = 2\n If n Mod 3 = 0 Then Return n = 3\n Dim d As Integer = 5\n While d * d <= n\n If n Mod d = 0 Then Return False\n d += 2\n If n Mod d = 0 Then Return False\n d += 4\n Wend\n Return True\nEnd Function\n\nDim As UInteger i, j, p, pow, lMax = 2, rMax = 2\nDim s As String\n\n' largest left truncatable prime less than 1000000\n' It can't end with 1, 4, 6, 8 or 9 as these numbers are not prime\n' Nor can it end in 2 if it has more than one digit as such a number would divide by 2\nFor i = 3 To 999997 Step 2\n s = Str(i)\n If Instr(s, \"0\") > 1 Then Continue For '' cannot contain 0\n j = s[Len(s) - 1] - 48\n If j = 1 OrElse j = 9 Then Continue For\n p = i\n pow = 10 ^ (Len(s) - 1)\n While pow > 1\n If Not isPrime(p) Then Continue For\n p Mod= pow\n pow \\= 10\n Wend\n lMax = i\nNext\n\n' largest right truncatable prime less than 1000000\n' It can't begin with 1, 4, 6, 8 or 9 as these numbers are not prime\nFor i = 3 To 799999 Step 2\n s = Str(i)\n If Instr(s, \"0\") > 1 Then Continue For '' cannot contain 0\n j = s[0] - 48\n If j = 1 OrElse j = 4 OrElse j = 6 Then Continue For\n p = i\n While p > 0\n If Not isPrime(p) Then Continue For\n p \\= 10\n Wend\n rMax = i\nNext\n\nPrint \"Largest left truncatable prime : \"; lMax\nPrint \"Largest right truncatable prime : \"; rMax\nPrint\nPrint \"Press any key to quit\"\nSleep\n","language":"FreeBASIC"},{"code":"' version 10-12-2016\n' compile with: fbc -s console\n\nDim Shared As Byte isPrime()\n\nSub sieve(m As UInteger)\n\n Dim As Integer i, j\n ReDim isPrime(m)\n\n For i = 4 To m Step 2\n isPrime(i) = 1\n Next\n\n For i = 3 To Sqr(m) Step 2\n If isPrime(i) = 0 Then\n For j = i * i To m Step i * 2\n isPrime(j) = 1\n Next\n End If\n Next\n\nEnd Sub\n\n' ------=< MAIN >=------\n\n#Define max 1000000 'upto 2^30 max for 32bit OS\n\nDim As UInteger a(), lt_prime(5000), rt_prime(100)\nDim As UInteger i, j, j1, p1, p2, left_max, right_max\n\nsieve(max)\n\n' left truncatable primes\n' if odd and ends with 3 or 7, never ends 1 or 9 (no prime\n' never ends on a 2 or 5 and starts with 1 to 9\nlt_prime(1) = 3 : lt_prime(2) = 7\np1 = 1 : p2 = 2\n\nDo\n For i = 1 To 9\n j = Val( Str(i) + Str(lt_prime(p1)) )\n If j > max Then Exit Do\n If isPrime(j) = 0 Then ' if prime then add to the list\n p2 += 1\n lt_prime(p2) = j\n If Left_max < j Then left_max = j\n End If\n Next\n p1 += 1\nLoop Until p1 > p2 ' no more numbers to process\n\n' right truncatable prime\n' start with 2, 3, 5 or 7 and end with 1, 3, 7 or 9\nrt_prime(1) = 2 : rt_prime(2) = 3 : rt_prime(3) = 5 : rt_prime(4) = 7\np1 = 1 : p2 = 4\nDim As UInteger end_num(1 To 4) => {1, 3, 7, 9}\n\nDo\n j1 = rt_prime(p1) * 10\n If j1 > max Then Exit Do\n For i = 1 To 4\n j = j1 + End_num(i)\n If isprime(j) = 0 Then ' if prime then add to the list\n p2 += 1\n rt_prime(p2) = j\n ' If right_max < j Then right_max = j\n End If\n Next\n p1 += 1\nLoop Until p1 > p2 ' no more numbers to process\n' the last one added is the biggest\nright_max = rt_prime(p2)\n\nPrint\nPrint \"The biggest left truncatable prime below\"; max; \" is \"; left_max\nPrint \"The biggest right truncatable prime below\"; max; \" is \"; right_max\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 sieve(1e6)\n if !search(6, 1e6, \"left\", func(n, pot int) int { return n % pot }) {\n panic(\"997?\")\n }\n if !search(6, 1e6, \"right\", func(n, _ int) int { return n / 10 }) {\n panic(\"7393?\")\n }\n}\n\nvar c []bool\n\nfunc sieve(ss int) {\n c = make([]bool, ss)\n c[1] = true\n for p := 2; ; {\n p2 := p * p\n if p2 >= ss {\n break\n }\n for i := p2; i < ss; i += p {\n c[i] = true\n }\n for {\n p++\n if !c[p] {\n break\n }\n }\n }\n}\n\nfunc search(digits, pot int, s string, truncFunc func(n, pot int) int) bool {\n n := pot - 1\n pot /= 10\nsmaller:\n for ; n >= pot; n -= 2 {\n for tn, tp := n, pot; tp > 0; tp /= 10 {\n if tn < tp || c[tn] {\n continue smaller\n }\n tn = truncFunc(tn, tp)\n }\n fmt.Println(\"max\", s, \"truncatable:\", n)\n return true\n }\n if digits > 1 {\n return search(digits-1, pot, s, truncFunc)\n }\n return false\n}\n","language":"Go"},{"code":"import Data.Numbers.Primes(primes, isPrime)\nimport Data.List\nimport Control.Arrow\n\nprimes1e6 = reverse. filter (notElem '0'. show) $ takeWhile(<=1000000) primes\n\nrightT, leftT :: Int -> Bool\nrightT = all isPrime. takeWhile(>0). drop 1. iterate (`div`10)\nleftT x = all isPrime. takeWhile(<x).map (x`mod`) $ iterate (*10) 10\n\nmain = do\n let (ltp, rtp) = (head. filter leftT &&& head. filter rightT) primes1e6\n putStrLn $ \"Left truncatable \" ++ show ltp\n putStrLn $ \"Right truncatable \" ++ show rtp\n","language":"Haskell"},{"code":"*Main> main\nLeft truncatable 998443\nRight truncatable 739399\n","language":"Haskell"},{"code":"digits = [1..9] :: [Integer]\nsmallPrimes = filter isPrime digits\npow10 = iterate (*10) 1\nmul10 = (pow10!!). length. show\nrighT = (+) . (10 *)\nlefT = liftM2 (.) (+) ((*) . mul10)\n\nprimesTruncatable f = iterate (concatMap (filter isPrime.flip map digits. f)) smallPrimes\n","language":"Haskell"},{"code":"*Main> maximum $ primesTruncatable righT !! 5\n739399\n\n*Main> maximum $ primesTruncatable lefT !! 5\n998443\n","language":"Haskell"},{"code":"procedure main(arglist)\n N := 0 < integer(\\arglist[1]) | 1000000 # primes to generator 1 to ... (1M or 1st arglist)\n D := (0 < integer(\\arglist[2]) | 10) / 2 # primes to display (10 or 2nd arglist)\n P := sieve(N) # from sieve task (modified)\n write(\"There are \",*P,\" prime numbers in the range 1 to \",N)\n if *P <= 2*D then\n every writes( \"Primes: \"|!sort(P)||\" \"|\"\\n\" )\n else\n every writes( \"Primes: \"|(L := sort(P))[1 to D]||\" \"|\"... \"|L[*L-D+1 to *L]||\" \"|\"\\n\" )\n largesttruncateable(P)\nend\n\nprocedure largesttruncateable(P) #: find the largest left and right trucatable numbers in P\nlocal ltp,rtp\n\n every x := sort(P)[*P to 1 by -1] do # largest to smallest\n if not find('0',x) then {\n /ltp := islefttrunc(P,x)\n /rtp := isrighttrunc(P,x)\n if \\ltp & \\rtp then break # until both found\n }\n write(\"Largest left truncatable prime = \", ltp)\n write(\"Largest right truncatable prime = \", rtp)\n return\nend\n\nprocedure isrighttrunc(P,x) #: return integer x if x and all right truncations of x are in P or fails\nif x = 0 | (member(P,x) & isrighttrunc(P,x / 10)) then return x\nend\n\nprocedure islefttrunc(P,x) #: return integer x if x and all left truncations of x are in P or fails\nif *x = 0 | ( (x := integer(x)) & member(P,x) & islefttrunc(P,x[2:0]) ) then return x\nend\n","language":"Icon"},{"code":"selPrime=: #~ 1&p:\nseed=: selPrime digits=: 1+i.9\nstep=: selPrime@,@:(,&.\":/&>)@{@;\n","language":"J"},{"code":" >./ digits&step^:5 seed NB. left truncatable\n998443\n >./ step&digits^:5 seed NB. right truncatable\n739399\n","language":"J"},{"code":"import java.util.BitSet;\n\npublic class Main {\n\n\tpublic static void main(String[] args){\n\n\t\tfinal int MAX = 1000000;\n\n\t\t//Sieve of Eratosthenes (using BitSet only for odd numbers)\n\t\tBitSet primeList = new BitSet(MAX>>1);\n\t\tprimeList.set(0,primeList.size(),true);\n\n\t\tint sqroot = (int) Math.sqrt(MAX);\n\t\tprimeList.clear(0);\n\t\tfor(int num = 3; num <= sqroot; num+=2)\n\t\t{\n\t\t\tif( primeList.get(num >> 1) )\n\t\t\t{\n\t\t\t\tint inc = num << 1;\n\t\t\t\tfor(int factor = num * num; factor < MAX; factor += inc)\n\t\t\t\t{\n\t\t\t\t\t//if( ((factor) & 1) == 1)\n\t\t\t\t\t//{\n\t\t\t\t\tprimeList.clear(factor >> 1);\n\t\t\t\t\t//}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\t//Sieve ends...\n\n\t\t//Find Largest Truncatable Prime. (so we start from 1000000 - 1\n\t\tint rightTrunc = -1, leftTrunc = -1;\n\t\tfor(int prime = (MAX - 1) | 1; prime >= 3; prime -= 2)\n\t\t{\n\t\t\tif(primeList.get(prime>>1))\n\t\t\t{\n\t\t\t\t//Already found Right Truncatable Prime?\n\t\t\t\tif(rightTrunc == -1)\n\t\t\t\t{\n\t\t\t\t\tint right = prime;\n\t\t\t\t\twhile(right > 0 && right % 2 != 0 && primeList.get(right >> 1)) right /= 10;\n\t\t\t\t\tif(right == 0) rightTrunc = prime;\n\t\t\t\t}\n\n\t\t\t\t//Already found Left Truncatable Prime?\n\t\t\t\tif(leftTrunc == -1 )\n\t\t\t\t{\n\t\t\t\t\t//Left Truncation\n\t\t\t\t\tString left = Integer.toString(prime);\n\t\t\t\t\tif(!left.contains(\"0\"))\n\t\t\t\t\t{\n\t\t\t\t\t\twhile( left.length() > 0 ){\n\t\t\t\t\t\t\tint iLeft = Integer.parseInt(left);\n\t\t\t\t\t\t\tif(!primeList.get( iLeft >> 1)) break;\n\t\t\t\t\t\t\tleft = left.substring(1);\n\t\t\t\t\t\t}\n\t\t\t\t\t\tif(left.length() == 0) leftTrunc = prime;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tif(leftTrunc != -1 && rightTrunc != -1) //Found both? then Stop loop\n\t\t\t\t{\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tSystem.out.println(\"Left Truncatable : \" + leftTrunc);\n\t\tSystem.out.println(\"Right Truncatable : \" + rightTrunc);\n\t}\n}\n","language":"Java"},{"code":"def is_left_truncatable_prime:\n def removeleft: recurse(if length <= 1 then empty else .[1:] end);\n tostring\n | index(\"0\") == null and\n all(removeleft|tonumber; is_prime);\n\ndef is_right_truncatable_prime:\n def removeright: recurse(if length <= 1 then empty else .[:-1] end);\n tostring\n | index(\"0\") == null and\n all(removeright|tonumber; is_prime);\n\nfirst( range(999999; 1; -2) | select(is_left_truncatable_prime)),\n\nfirst( range(999999; 1; -2) | select(is_right_truncatable_prime))\n","language":"Jq"},{"code":"function isltruncprime{T<:Integer}(n::T, base::T=10)\n isprime(n) || return false\n p = n\n f = prevpow(base, p)\n while 1 < f\n (d, p) = divrem(p, f)\n isprime(p) || return false\n d != 0 || return false\n f = div(f, base)\n end\n return true\nend\n\nfunction isrtruncprime{T<:Integer}(n::T, base::T=10)\n isprime(n) || return false\n p = n\n while base < p\n p = div(p, base)\n isprime(p) || return false\n end\n return true\nend\n\nhi = 10^6\n\nfor i in reverse(primes(hi))\n isltruncprime(i) || continue\n println(\"The largest left truncatable prime ≤ \", hi, \" is \", i, \".\")\n break\nend\n\nfor i in reverse(primes(hi))\n isrtruncprime(i) || continue\n println(\"The largest right truncatable prime ≤ \", hi, \" is \", i, \".\")\n break\nend\n","language":"Julia"},{"code":"// version 1.0.5-2\n\nfun isPrime(n: Int) : Boolean {\n if (n < 2) return false\n if (n % 2 == 0) return n == 2\n if (n % 3 == 0) return n == 3\n var d : Int = 5\n while (d * d <= n) {\n if (n % d == 0) return false\n d += 2\n if (n % d == 0) return false\n d += 4\n }\n return true\n}\n\nfun main(args: Array<String>) {\n var j: Char\n var p: Int\n var pow: Int\n var lMax: Int = 2\n var rMax: Int = 2\n var s: String\n\n // calculate maximum left truncatable prime less than 1 million\n loop@ for( i in 3..999997 step 2) {\n s = i.toString()\n if ('0' in s) continue\n j = s[s.length - 1]\n if (j == '1' || j == '9') continue\n p = i\n pow = 1\n for (k in 1..s.length - 1) pow *= 10\n while(pow > 1) {\n if (!isPrime(p)) continue@loop\n p %= pow\n pow /= 10\n }\n lMax = i\n }\n\n // calculate maximum right truncatable prime less than 1 million\n loop@ for( i in 3..799999 step 2) {\n s = i.toString()\n if ('0' in s) continue\n j = s[0]\n if (j == '1' || j == '4' || j == '6') continue\n p = i\n while(p > 0) {\n if (!isPrime(p)) continue@loop\n p /= 10\n }\n rMax = i\n }\n\n println(\"Largest left truncatable prime : \" + lMax.toString())\n println(\"Largest right truncatable prime : \" + rMax.toString())\n}\n","language":"Kotlin"},{"code":"max_number = 1000000\n\nnumbers = {}\nfor i = 2, max_number do\n numbers[i] = i;\nend\n\nfor i = 2, max_number do\n for j = i+1, max_number do\n if numbers[j] ~= 0 and j % i == 0 then numbers[j] = 0 end\n end\nend\n\nmax_prime_left, max_prime_right = 2, 2\nfor i = 2, max_number do\n if numbers[i] ~= 0 then\n local is_prime = true\n\n local l = math.floor( i / 10 )\n while l > 1 do\n if numbers[l] == 0 then\n is_prime = false\n break\n end\n l = math.floor( l / 10 )\n end\n if is_prime then\n max_prime_left = i\n end\n\n is_prime = true\n local n = 10;\n while math.floor( i % 10 ) ~= 0 and n < max_number do\n if numbers[ math.floor( i % 10 ) ] ~= 0 then\n is_prime = false\n break\n end\n n = n * 10\n end\n if is_prime then\n max_prime_right = i\n end\n end\nend\n\nprint( \"max_prime_left = \", max_prime_left )\nprint( \"max_prime_right = \", max_prime_right )\n","language":"Lua"},{"code":"MaxTruncatablePrime := proc({left::truefalse:=FAIL, right::truefalse:=FAIL}, $)\nlocal i, j, c, p, b, n, sdprimes, dir;\nlocal tprimes := table();\n if left = true and right = true then\n error \"invalid input\";\n elif right = true then\n dir := \"right\";\n else\n dir := \"left\";\n end if;\n b := 10;\n n := 6;\n sdprimes := select(isprime, [seq(1..b-1)]);\n for p in sdprimes do\n if assigned(tprimes[p]) then\n next;\n end if;\n i := ilog[b](p)+1;\n j := 1;\n while p < b^n do\n if dir = \"left\" then\n c := j*b^i + p;\n else\n c := p*b + j;\n end if;\n if j >= b or c > b^n then # we have tried all 1 digit extensions of p, add p to tprimes and move back 1 digit\n tprimes[p] := p;\n if i = 1 then # if we are at the first digit, go to the next 1 digit prime\n break;\n end if;\n i := i - 1;\n j := 1;\n if dir = \"left\" then\n p := p - iquo(p, b^i)*b^i;\n else\n p := iquo(p, b);\n end if;\n elif assigned(tprimes[c]) then\n j := j + 1;\n elif isprime(c) then\n p := c;\n i := i + 1;\n j := 1;\n else\n j := j+1;\n end if;\n end do;\n end do;\n return max(indices(tprimes, 'nolist'));\nend proc;\n","language":"Maple"},{"code":"LeftTruncatablePrimeQ[n_] := Times @@ IntegerDigits[n] > 0 &&\n And @@ PrimeQ /@ ToExpression /@ StringJoin /@\n Rest[Most[NestList[Rest, #, Length[#]] &[Characters[ToString[n]]]]]\nRightTruncatablePrimeQ[n_] := Times @@ IntegerDigits[n] > 0 &&\n And @@ PrimeQ /@ ToExpression /@ StringJoin /@\n Rest[Most[NestList[Most, #, Length[#]] &[Characters[ToString[n]]]]]\n","language":"Mathematica"},{"code":"function largestTruncatablePrimes(boundary)\n\n %Helper function for checking if a prime is left of right truncatable\n function [leftTruncatable,rightTruncatable] = isTruncatable(prime,checkLeftTruncatable,checkRightTruncatable)\n\n numDigits = ceil(log10(prime)); %calculate the number of digits in the prime less one\n powersOfTen = 10.^(0:numDigits); %cache the needed powers of ten\n\n leftTruncated = mod(prime,powersOfTen); %generate a list of numbers by repeatedly left truncating the prime\n\n %leading zeros will cause duplicate entries thus it is possible to\n %detect leading zeros if we rotate the list to the left or right\n %and check for any equivalences with the original list\n hasLeadingZeros = any( circshift(leftTruncated,[0 1]) == leftTruncated );\n\n if( hasLeadingZeros || not(checkLeftTruncatable) )\n leftTruncatable = false;\n else\n %check if all of the left truncated numbers are prime\n leftTruncatable = all(isprime(leftTruncated(2:end)));\n end\n\n if( checkRightTruncatable )\n rightTruncated = (prime - leftTruncated) ./ powersOfTen; %generate a list of right truncated numbers\n rightTruncatable = all(isprime(rightTruncated(1:end-1))); %check if all the right truncated numbers are prime\n else\n rightTruncatable = false;\n end\n\n end %isTruncatable()\n\n nums = primes(boundary); %generate all primes <= boundary\n\n %Flags that indicate if the largest left or right truncatable prime has not\n %been found\n leftTruncateNotFound = true;\n rightTruncateNotFound = true;\n\n for prime = nums(end:-1:1) %Search through primes in reverse order\n\n %Get if the prime is left and/or right truncatable, ignoring\n %checking for right truncatable if it has already been found\n [leftTruncatable,rightTruncatable] = isTruncatable(prime,leftTruncateNotFound,rightTruncateNotFound);\n\n if( leftTruncateNotFound && leftTruncatable ) %print out largest left truncatable prime\n display([num2str(prime) ' is the largest left truncatable prime <= ' num2str(boundary) '.']);\n leftTruncateNotFound = false;\n end\n\n if( rightTruncateNotFound && rightTruncatable ) %print out largest right truncatable prime\n display([num2str(prime) ' is the largest right truncatable prime <= ' num2str(boundary) '.']);\n rightTruncateNotFound = false;\n end\n\n %Terminate loop when the largest left and right truncatable primes have\n %been found\n if( not(leftTruncateNotFound || rightTruncateNotFound) )\n break;\n end\n end\nend\n","language":"MATLAB"},{"code":">> largestTruncatablePrimes(1e6)\n998443 is the largest left truncatable prime <= 1000000.\n739399 is the largest right truncatable prime <= 1000000.\n","language":"MATLAB"},{"code":"import sets, strutils, algorithm\n\nproc primes(n: int64): seq[int64] =\n var multiples: HashSet[int64]\n for i in 2..n:\n if i notin multiples:\n result.add i\n for j in countup(i*i, n, i.int):\n multiples.incl j\n\nproc truncatablePrime(n: int64): tuple[left, right: int64] =\n var\n primelist: seq[string]\n for x in primes(n):\n primelist.add($x)\n reverse primelist\n var primeset = primelist.toHashSet\n for n in primelist:\n var alltruncs: HashSet[string]\n for i in 0..n.high:\n alltruncs.incl n[i..n.high]\n if alltruncs <= primeset:\n result.left = parseInt(n)\n break\n for n in primelist:\n var alltruncs: HashSet[string]\n for i in 0..n.high:\n alltruncs.incl n[0..i]\n if alltruncs <= primeset:\n result.right = parseInt(n)\n break\n\necho truncatablePrime(1000000i64)\n","language":"Nim"},{"code":"-- find largest left- & right-truncatable primes < 1 million.\n-- an initial set of primes (not, at this time, we leave out 2 because\n-- we'll automatically skip the even numbers. No point in doing a needless\n-- test each time through\nprimes = .array~of(3, 5, 7, 11)\n\n-- check all of the odd numbers up to 1,000,000\nloop j = 13 by 2 to 1000000\n loop i = 1 to primes~size\n prime = primes[i]\n -- found an even prime divisor\n if j // prime == 0 then iterate j\n -- only check up to the square root\n if prime*prime > j then leave\n end\n -- we only get here if we don't find a divisor\n primes~append(j)\nend\n\n-- get a set of the primes that we can test more efficiently\nprimeSet = .set~of(2)\nprimeSet~putall(primes)\n\n\nsay 'The last prime is' primes[primes~last] \"(\"primeSet~items 'primes under one million).'\nsay copies('-',66)\n\nlastLeft = 0\n\n-- we're going to use the array version to do these in order. We're still\n-- missing \"2\", but that's not going to be the largest\nloop prime over primes\n\n -- values containing 0 can never work\n if prime~pos(0) \\= 0 then iterate\n -- now start the truncations, checking against our set of\n -- known primes\n loop i = 1 for prime~length - 1\n subprime = prime~right(i)\n -- not in our known set, this can't work\n if \\primeset~hasIndex(subprime) then iterate prime\n end\n -- this, by definition, with be the largest left-trunc prime\n lastLeft = prime\nend\n-- now look for right-trunc primes\nlastRight = 0\nloop prime over primes\n\n -- values containing 0 can never work\n if prime~pos(0) \\= 0 then iterate\n -- now start the truncations, checking against our set of\n -- known primes\n loop i = 1 for prime~length - 1\n subprime = prime~left(i)\n -- not in our known set, this can't work\n if \\primeset~hasIndex(subprime) then iterate prime\n end\n -- this, by definition, with be the largest left-trunc prime\n lastRight = prime\nend\n\nsay 'The largest left-truncatable prime is' lastLeft '(under one million).'\nsay 'The largest right-truncatable prime is' lastRight '(under one million).'\n","language":"OoRexx"},{"code":"FUNCTION isPrime RETURNS LOGICAL (\n i_i AS INT\n):\n\n DEF VAR ii AS INT.\n\n DO ii = 2 TO SQRT( i_i ):\n\n IF i_i MODULO ii = 0 THEN\n RETURN FALSE.\n\n END.\n\n RETURN TRUE AND i_i > 1.\n\nEND FUNCTION. /* isPrime */\n\nFUNCTION isLeftTruncatablePrime RETURNS LOGICAL (\n i_i AS INT\n):\n\n DEF VAR ii AS INT.\n DEF VAR cc AS CHAR.\n DEF VAR lresult AS LOGICAL INITIAL TRUE.\n\n cc = STRING( i_i ).\n\n DO WHILE cc > \"\":\n lresult = lresult AND isPrime( INTEGER( cc ) ).\n cc = SUBSTRING( cc, 2 ).\n END.\n\n RETURN lresult.\n\nEND FUNCTION. /* isLeftTruncatablePrime */\n\nFUNCTION isRightTruncatablePrime RETURNS LOGICAL (\n i_i AS INT\n):\n\n DEF VAR ii AS INT.\n DEF VAR cc AS CHAR.\n DEF VAR lresult AS LOGICAL INITIAL TRUE.\n\n cc = STRING( i_i ).\n\n DO WHILE cc > \"\":\n lresult = lresult AND isPrime( INTEGER( cc ) ).\n cc = SUBSTRING( cc, 1, LENGTH( cc ) - 1 ).\n END.\n\n RETURN lresult.\n\nEND FUNCTION. /* isRightTruncatablePrime */\n\nFUNCTION getHighestTruncatablePrimes RETURNS CHARACTER (\n i_imax AS INTEGER\n):\n\n DEF VAR ii AS INT.\n DEF VAR ileft AS INT.\n DEF VAR iright AS INT.\n\n DO ii = i_imax TO 1 BY -1 WHILE ileft = 0 OR iright = 0:\n\n IF INDEX( STRING( ii ), \"0\" ) = 0 THEN DO:\n IF ileft = 0 AND isLeftTruncatablePrime( ii ) THEN\n ileft = ii.\n IF iright = 0 AND isRightTruncatablePrime( ii ) THEN\n iright = ii.\n END.\n\n END.\n\n RETURN SUBSTITUTE(\"Left: &1~nRight: &2\", ileft, iright ).\n\nEND FUNCTION. /* getHighestTruncatablePrimes */\n\nMESSAGE\n getHighestTruncatablePrimes( 1000000 )\nVIEW-AS ALERT-BOX.\n","language":"OpenEdge-Progress"},{"code":"left(n)={\n\tmy(v=[2,3,5,7],u,t=1,out=0);\n\tfor(i=1,n,\n\t\tt*=10;\n\t\tu=[];\n\t\tfor(j=1,#v,\n\t\t\tforstep(a=t,t*9,t,\n\t\t\t\tif(isprime(a+v[j]),u=concat(u,a+v[j]))\n\t\t\t)\n\t\t);\n\t\tout=v[#v];\n\t\tv=vecsort(u)\n\t);\n\tout\n};\nright(n)={\n\tmy(v=[2,3,5,7],u,out=0);\n\tfor(i=1,n,\n\t\tu=[];\n\t\tfor(j=1,#v,\n\t\t\tforstep(a=1,9,[2,4],\n\t\t\t\tif(isprime(10*v[j]+a),u=concat(u,10*v[j]+a))\n\t\t\t)\n\t\t);\n\t\tout=v[#v];\n\t\tv=u\n\t);\n\tout\n};\n[left(6),right(6)]\n","language":"PARI-GP"},{"code":"use ntheory \":all\";\nsub isltrunc {\n my $n = shift;\n return (is_prime($n) && $n !~ /0/ && ($n < 10 || isltrunc(substr($n,1))));\n}\nsub isrtrunc {\n my $n = shift;\n return (is_prime($n) && $n !~ /0/ && ($n < 10 || isrtrunc(substr($n,0,-1))));\n}\nfor (reverse @{primes(1e6)}) {\n if (isltrunc($_)) { print \"ltrunc: $_\\n\"; last; }\n}\nfor (reverse @{primes(1e6)}) {\n if (isrtrunc($_)) { print \"rtrunc: $_\\n\"; last; }\n}\n","language":"Perl"},{"code":"use ntheory \":all\";\n\nmy @lprimes = my @rprimes = (2,3,5,7);\n\n@lprimes = sort { $a <=> $b }\n map { my $p=$_; map { is_prime($_.$p) ? $_.$p : () } 1..9 } @lprimes\n for 2..6;\n\n@rprimes = sort { $a <=> $b }\n map { my $p=$_; map { is_prime($p.$_) ? $p.$_ : () } 1..9 } @rprimes\n for 2..6;\n\nprint \"ltrunc: $lprimes[-1]\\nrtrunc: $rprimes[-1]\\n\";\n","language":"Perl"},{"code":"#!/usr/bin/perl\nuse warnings;\nuse strict;\n\nuse constant {\n LEFT => 0,\n RIGHT => 1,\n};\n\n{ my @primes = (2, 3);\n\n sub is_prime {\n my $n = shift;\n return if $n < 2;\n\n for my $prime (@primes) {\n last if $prime >= $n;\n return unless $n % $prime;\n }\n\n my $sqrt = sqrt $n;\n while ($primes[-1] < $sqrt) {\n my $new = 2 + $primes[-1];\n $new += 2 until is_prime($new);\n push @primes, $new;\n return unless $n % $new;\n }\n\n return 1;\n }\n}\n\n\nsub trunc {\n my ($n, $side) = @_;\n substr $n, $side == LEFT ? 0 : -1, 1, q();\n return $n;\n}\n\n\nsub is_tprime { # Absence of zeroes is tested outside the sub.\n my ($n, $side) = @_;\n return (is_prime($n)\n and (1 == length $n or is_tprime(trunc($n, $side), $side)));\n}\n\n\nmy $length = 6;\nmy @tprimes = ('9' x $length) x 2;\nfor my $side (LEFT, RIGHT) {\n $tprimes[$side] -= 2 until -1 == index $tprimes[$side], '0'\n and is_tprime($tprimes[$side], $side);\n}\n\nprint 'left ', join(', right ', @tprimes), \"\\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;\">N</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">6</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">limit</span> <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: #000000;\">N</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #000080;font-style:italic;\">-- standard sieve:</span>\n <span style=\"color: #008080;\">enum</span> <span style=\"color: #000000;\">L</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">R</span> <span style=\"color: #000080;font-style:italic;\">-- (with primes[i] as mini bit-field)</span>\n <span style=\"color: #004080;\">sequence</span> <span style=\"color: #000000;\">primes</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">repeat</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">L</span><span style=\"color: #0000FF;\">+</span><span style=\"color: #000000;\">R</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">limit</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #000000;\">primes</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;\">0</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;\">floor</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #7060A8;\">sqrt</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">limit</span><span style=\"color: #0000FF;\">))</span> <span style=\"color: #008080;\">do</span>\n <span style=\"color: #008080;\">if</span> <span style=\"color: #000000;\">primes</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: #008080;\">for</span> <span style=\"color: #000000;\">k</span><span style=\"color: #0000FF;\">=</span><span style=\"color: #000000;\">i</span><span style=\"color: #0000FF;\">*</span><span style=\"color: #000000;\">i</span> <span style=\"color: #008080;\">to</span> <span style=\"color: #000000;\">limit</span> <span style=\"color: #008080;\">by</span> <span style=\"color: #000000;\">i</span> <span style=\"color: #008080;\">do</span>\n <span style=\"color: #000000;\">primes</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;\">0</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\n <span style=\"color: #000080;font-style:italic;\">-- propagate non-truncateables up the prime table:</span>\n <span style=\"color: #008080;\">for</span> <span style=\"color: #000000;\">p</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: #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;\">p10</span> <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: #000000;\">p</span><span style=\"color: #0000FF;\">)</span> <span style=\"color: #000080;font-style:italic;\">-- ie 10, 100, .. 100_000</span>\n <span style=\"color: #008080;\">for</span> <span style=\"color: #000000;\">i</span><span style=\"color: #0000FF;\">=</span><span style=\"color: #000000;\">p10</span><span style=\"color: #0000FF;\">+</span><span style=\"color: #000000;\">1</span> <span style=\"color: #008080;\">to</span> <span style=\"color: #000000;\">p10</span><span style=\"color: #0000FF;\">*</span><span style=\"color: #000000;\">10</span><span style=\"color: #0000FF;\">-</span><span style=\"color: #000000;\">1</span> <span style=\"color: #008080;\">by</span> <span style=\"color: #000000;\">2</span> <span style=\"color: #008080;\">do</span> <span style=\"color: #000080;font-style:italic;\">-- to 99, 999, .. 999_999</span>\n <span style=\"color: #008080;\">if</span> <span style=\"color: #000000;\">primes</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: #004080;\">integer</span> <span style=\"color: #000000;\">l</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">remainder</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">i</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">p10</span><span style=\"color: #0000FF;\">),</span>\n <span style=\"color: #000000;\">r</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">floor</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">i</span><span style=\"color: #0000FF;\">/</span><span style=\"color: #000000;\">10</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #004080;\">integer</span> <span style=\"color: #000000;\">pi</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">and_bits</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">primes</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">l</span><span style=\"color: #0000FF;\">],</span><span style=\"color: #000000;\">L</span><span style=\"color: #0000FF;\">)+</span><span style=\"color: #7060A8;\">and_bits</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">primes</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">r</span><span style=\"color: #0000FF;\">],</span><span style=\"color: #000000;\">R</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #008080;\">if</span> <span style=\"color: #000000;\">pi</span> <span style=\"color: #008080;\">and</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: #7060A8;\">sprint</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">i</span><span style=\"color: #0000FF;\">))</span> <span style=\"color: #008080;\">then</span> <span style=\"color: #000000;\">pi</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: #000000;\">primes</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;\">pi</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\n <span style=\"color: #004080;\">integer</span> <span style=\"color: #000000;\">maxl</span><span style=\"color: #0000FF;\">=</span><span style=\"color: #000000;\">0</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">maxr</span><span style=\"color: #0000FF;\">=</span><span style=\"color: #000000;\">0</span>\n\n <span style=\"color: #008080;\">for</span> <span style=\"color: #000000;\">i</span><span style=\"color: #0000FF;\">=</span><span style=\"color: #000000;\">limit</span><span style=\"color: #0000FF;\">-</span><span style=\"color: #000000;\">1</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;\">2</span> <span style=\"color: #008080;\">do</span>\n <span style=\"color: #004080;\">integer</span> <span style=\"color: #000000;\">pi</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">primes</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;\">pi</span> <span style=\"color: #008080;\">then</span>\n <span style=\"color: #008080;\">if</span> <span style=\"color: #000000;\">maxl</span><span style=\"color: #0000FF;\">=</span><span style=\"color: #000000;\">0</span> <span style=\"color: #008080;\">and</span> <span style=\"color: #7060A8;\">and_bits</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">pi</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">L</span><span style=\"color: #0000FF;\">)</span> <span style=\"color: #008080;\">then</span> <span style=\"color: #000000;\">maxl</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">i</span> <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">if</span>\n <span style=\"color: #008080;\">if</span> <span style=\"color: #000000;\">maxr</span><span style=\"color: #0000FF;\">=</span><span style=\"color: #000000;\">0</span> <span style=\"color: #008080;\">and</span> <span style=\"color: #7060A8;\">and_bits</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">pi</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">R</span><span style=\"color: #0000FF;\">)</span> <span style=\"color: #008080;\">then</span> <span style=\"color: #000000;\">maxr</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">i</span> <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">if</span>\n <span style=\"color: #008080;\">if</span> <span style=\"color: #000000;\">maxl</span><span style=\"color: #0000FF;\">!=</span><span style=\"color: #000000;\">0</span> <span style=\"color: #008080;\">and</span> <span style=\"color: #000000;\">maxr</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: #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: #0000FF;\">?{</span><span style=\"color: #000000;\">maxl</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">maxr</span><span style=\"color: #0000FF;\">}</span>\n<!--\n","language":"Phix"},{"code":"(load \"@lib/rsa.l\") # Use the 'prime?' function from RSA package\n\n(de truncatablePrime? (N Fun)\n (for (L (chop N) L (Fun L))\n (T (= \"0\" (car L)))\n (NIL (prime? (format L)))\n T ) )\n\n(let (Left 1000000 Right 1000000)\n (until (truncatablePrime? (dec 'Left) cdr))\n (until (truncatablePrime? (dec 'Right) '((L) (cdr (rot L)))))\n (cons Left Right) )\n","language":"PicoLisp"},{"code":"bool is_trunc_prime(int p, string direction)\n{\n while(p) {\n\tif( !p->probably_prime_p() )\n\t return false;\n\tif(direction == \"l\")\n\t p = (int)p->digits()[1..];\n\telse\n\t p = (int)p->digits()[..<1];\n }\n return true;\n}\n\nvoid main()\n{\n bool ltp_found, rtp_found;\n for(int prime = 10->pow(6); prime--; prime > 0) {\n\tif( !ltp_found && is_trunc_prime(prime, \"l\") ) {\n\t ltp_found = true;\n\t write(\"Largest LTP: %d\\n\", prime);\n\t}\n\tif( !rtp_found && is_trunc_prime(prime, \"r\") ) {\n\t rtp_found = true;\n\t write(\"Largest RTP: %d\\n\", prime);\n\t}\n\tif(ltp_found && rtp_found)\n\t break;\n }\n}\n","language":"Pike"},{"code":"tp: procedure options (main);\n declare primes(1000000) bit (1);\n declare max_primes fixed binary (31);\n declare (i, k) fixed binary (31);\n\n max_primes = hbound(primes, 1);\n call sieve;\n\n /* Now search for primes that are right-truncatable. */\n call right_truncatable;\n\n /* Now search for primes that are left-truncatable. */\n call left_truncatable;\n\nright_truncatable: procedure;\n declare direction bit (1);\n declare (i, k) fixed binary (31);\n\ntest_truncatable:\n do i = max_primes to 2 by -1;\n if primes(i) then /* it's a prime */\n do;\n k = i/10;\n do while (k > 0);\n if ^primes(k) then iterate test_truncatable;\n k = k/10;\n end;\n put skip list (i || ' is right-truncatable');\n return;\n end;\n end;\nend right_truncatable;\n\nleft_truncatable: procedure;\n declare direction bit (1);\n declare (i, k, d, e) fixed binary (31);\n\ntest_truncatable:\n do i = max_primes to 2 by -1;\n if primes(i) then /* it's a prime */\n do;\n k = i;\n do d = 100000 repeat d/10 until (d = 10);\n e = k/d;\n k = k - e*d;\n if e = 0 then iterate test_truncatable;\n if ^primes(k) then iterate test_truncatable;\n end;\n put skip list (i || ' is left-truncatable');\n return;\n end;\n end;\nend left_truncatable;\n\nsieve: procedure;\n declare (i, j) fixed binary (31);\n\n primes = '1'b; primes(1) = '0'b;\n\n do i = 2 to sqrt(max_primes);\n do j = i+i to max_primes by i;\n primes(j) = '0'b;\n end;\n end;\nend sieve;\n\nend tp;\n","language":"PL-I"},{"code":"function IsPrime ( [int] $num )\n{\n $isprime = @{}\n 2..[math]::sqrt($num) | Where-Object {\n $isprime[$_] -eq $null } | ForEach-Object {\n $_\n $isprime[$_] = $true\n for ( $i=$_*$_ ; $i -le $num; $i += $_ )\n { $isprime[$i] = $false }\n }\n 2..$num | Where-Object { $isprime[$_] -eq $null }\n}\n\nfunction Truncatable ( [int] $num )\n{\n $declen = [math]::abs($num).ToString().Length\n $primes = @()\n $ltprimes = @{}\n $rtprimes = @{}\n 1..$declen | ForEach-Object { $ltprimes[$_]=@{}; $rtprimes[$_]=@{} }\n IsPrime $num | ForEach-Object {\n $lastltprime = 2\n $lastrtprime = 2\n } {\n $curprim = $_\n $curdeclen = $curprim.ToString().Length\n $primes += $curprim\n if( $curdeclen -eq 1 ) {\n $ltprimes[1][$curprim] = $true\n $rtprimes[1][$curprim] = $true\n $lastltprime = $curprim\n $lastrtprime = $curprim\n } else {\n $curmod = $curprim % [math]::pow(10,$curdeclen - 1)\n $curdiv = [math]::floor($curprim / 10)\n if( $ltprimes[$curdeclen - 1][[int]$curmod] ) {\n $ltprimes[$curdeclen][$curprim] = $true\n $lastltprime = $curprim\n }\n if( $rtprimes[$curdeclen - 1][[int]$curdiv] ) {\n $rtprimes[$curdeclen][$curprim] = $true\n $lastrtprime = $curprim\n }\n }\n if( ( $ltprimes[$curdeclen - 2].Keys.count -gt 0 ) -and ( $ltprimes[$curdeclen - 1].Keys.count -gt 0 ) ) { $ltprimes[$curdeclen -2] = @{} }\n if( ( $rtprimes[$curdeclen - 2].Keys.count -gt 0 ) -and ( $rtprimes[$curdeclen - 1].Keys.count -gt 0 ) ) { $rtprimes[$curdeclen -2] = @{} }\n } {\n \"Largest Left Truncatable Prime: $lastltprime\"\n \"Largest Right Truncatable Prime: $lastrtprime\"\n }\n}\n","language":"PowerShell"},{"code":"largest_left_truncatable_prime(N, N):-\n is_left_truncatable_prime(N),\n !.\nlargest_left_truncatable_prime(N, P):-\n N > 1,\n N1 is N - 1,\n largest_left_truncatable_prime(N1, P).\n\nis_left_truncatable_prime(P):-\n is_prime(P),\n is_left_truncatable_prime(P, P, 10).\n\nis_left_truncatable_prime(P, _, N):-\n P =< N,\n !.\nis_left_truncatable_prime(P, Q, N):-\n Q1 is P mod N,\n is_prime(Q1),\n Q \\= Q1,\n N1 is N * 10,\n is_left_truncatable_prime(P, Q1, N1).\n\nlargest_right_truncatable_prime(N, N):-\n is_right_truncatable_prime(N),\n !.\nlargest_right_truncatable_prime(N, P):-\n N > 1,\n N1 is N - 1,\n largest_right_truncatable_prime(N1, P).\n\nis_right_truncatable_prime(P):-\n is_prime(P),\n Q is P // 10,\n (Q == 0, ! ; is_right_truncatable_prime(Q)).\n\nmain(N):-\n find_prime_numbers(N),\n largest_left_truncatable_prime(N, L),\n writef('Largest left-truncatable prime less than %t: %t\\n', [N, L]),\n largest_right_truncatable_prime(N, R),\n writef('Largest right-truncatable prime less than %t: %t\\n', [N, R]).\n\nmain:-\n main(1000000).\n","language":"Prolog"},{"code":":- module(prime_numbers, [find_prime_numbers/1, is_prime/1]).\n:- dynamic is_prime/1.\n\nfind_prime_numbers(N):-\n retractall(is_prime(_)),\n assertz(is_prime(2)),\n init_sieve(N, 3),\n sieve(N, 3).\n\ninit_sieve(N, P):-\n P > N,\n !.\ninit_sieve(N, P):-\n assertz(is_prime(P)),\n Q is P + 2,\n init_sieve(N, Q).\n\nsieve(N, P):-\n P * P > N,\n !.\nsieve(N, P):-\n is_prime(P),\n !,\n S is P * P,\n cross_out(S, N, P),\n Q is P + 2,\n sieve(N, Q).\nsieve(N, P):-\n Q is P + 2,\n sieve(N, Q).\n\ncross_out(S, N, _):-\n S > N,\n !.\ncross_out(S, N, P):-\n retract(is_prime(S)),\n !,\n Q is S + 2 * P,\n cross_out(Q, N, P).\ncross_out(S, N, P):-\n Q is S + 2 * P,\n cross_out(Q, N, P).\n","language":"Prolog"},{"code":"#MaxLim = 999999\n\nProcedure is_Prime(n)\n If n<=1 : ProcedureReturn #False\n ElseIf n<4 : ProcedureReturn #True\n ElseIf n%2=0: ProcedureReturn #False\n ElseIf n<9 : ProcedureReturn #True\n ElseIf n%3=0: ProcedureReturn #False\n Else\n Protected r=Round(Sqr(n),#PB_Round_Down)\n Protected f=5\n While f<=r\n If n%f=0 Or n%(f+2)=0\n ProcedureReturn #False\n EndIf\n f+6\n Wend\n EndIf\n ProcedureReturn #True\nEndProcedure\n\nProcedure TruncateLeft(n)\n Protected s.s=Str(n), l=Len(s)-1\n If Not FindString(s,\"0\",1)\n While l>0\n s=Right(s,l)\n If Not is_Prime(Val(s))\n ProcedureReturn #False\n EndIf\n l-1\n Wend\n ProcedureReturn #True\n EndIf\nEndProcedure\n\nProcedure TruncateRight(a)\n Repeat\n a/10\n If Not a\n Break\n ElseIf Not is_Prime(a) Or a%10=0\n ProcedureReturn #False\n EndIf\n ForEver\n ProcedureReturn #True\nEndProcedure\n\ni=#MaxLim\nRepeat\n If is_Prime(i)\n If Not truncateleft And TruncateLeft(i)\n truncateleft=i\n EndIf\n If Not truncateright And TruncateRight(i)\n truncateright=i\n EndIf\n EndIf\n If truncateleft And truncateright\n Break\n Else\n i-2\n EndIf\nUntil i<=0\n\nx.s=\"Largest TruncateLeft= \"+Str(truncateleft)\ny.s=\"Largest TruncateRight= \"+Str(truncateright)\n\nMessageRequester(\"Truncatable primes\",x+#CRLF$+y)\n","language":"PureBasic"},{"code":"maxprime = 1000000\n\ndef primes(n):\n multiples = set()\n prime = []\n for i in range(2, n+1):\n if i not in multiples:\n prime.append(i)\n multiples.update(set(range(i*i, n+1, i)))\n return prime\n\ndef truncatableprime(n):\n 'Return a longest left and right truncatable primes below n'\n primelist = [str(x) for x in primes(n)[::-1]]\n primeset = set(primelist)\n for n in primelist:\n # n = 'abc'; [n[i:] for i in range(len(n))] -> ['abc', 'bc', 'c']\n alltruncs = set(n[i:] for i in range(len(n)))\n if alltruncs.issubset(primeset):\n truncateleft = int(n)\n break\n for n in primelist:\n # n = 'abc'; [n[:i+1] for i in range(len(n))] -> ['a', 'ab', 'abc']\n alltruncs = set([n[:i+1] for i in range(len(n))])\n if alltruncs.issubset(primeset):\n truncateright = int(n)\n break\n return truncateleft, truncateright\n\nprint(truncatableprime(maxprime))\n","language":"Python"},{"code":" 1000000 eratosthenes\n\n [ false swap\n number$ witheach\n [ char 0 =\n if [ conclude not ] ] ] is haszero ( n --> b )\n\n [ 10 / ] is truncright ( n --> n )\n\n [ number$\n behead drop $->n drop ] is truncleft ( n --> n )\n\n [ dup isprime not iff\n [ drop false ] done\n dup haszero iff\n [ drop false ] done\n true swap\n [ truncleft\n dup 0 > while\n dup isprime not iff\n [ dip not ] done\n again ] drop ] is ltruncatable ( n --> b )\n\n [ dup isprime not iff\n [ drop false ] done\n dup haszero iff\n [ drop false ] done\n true swap\n [ truncright\n dup 0 > while\n dup isprime not iff\n [ dip not ] done\n again ] drop ] is rtruncatable ( n --> b )\n\n say \"Left: \"\n 1000000 times [ i ltruncatable if [ i echo conclude ] ]\n cr\n say \"Right: \"\n 1000000 times [ i rtruncatable if [ i echo conclude ] ]\n cr\n","language":"Quackery"},{"code":"#lang racket\n(require math/number-theory)\n\n(define (truncate-right n)\n (quotient n 10))\n\n(define (truncate-left n)\n (define s (number->string n))\n (string->number (substring s 1 (string-length s))))\n\n(define (contains-zero? n)\n (member #\\0 (string->list (number->string n))))\n\n(define (truncatable? truncate n)\n (and (prime? n)\n (not (contains-zero? n))\n (or (< n 10)\n (truncatable? truncate (truncate n)))))\n\n; largest left truncatable prime\n(for/first ([n (in-range 1000000 1 -1)]\n #:when (truncatable? truncate-left n))\n n)\n\n; largest right truncatable prime\n(for/first ([n (in-range 1000000 1 -1)]\n #:when (truncatable? truncate-right n))\n n)\n\n; Output:\n998443\n739399\n","language":"Racket"},{"code":"constant ltp = $[2, 3, 5, 7], -> @ltp {\n $[ grep { .&is-prime }, ((1..9) X~ @ltp) ]\n} ... *;\n\nconstant rtp = $[2, 3, 5, 7], -> @rtp {\n $[ grep { .&is-prime }, (@rtp X~ (1..9)) ]\n} ... *;\n\nsay \"Highest ltp = \", ltp[5][*-1];\nsay \"Highest rtp = \", rtp[5][*-1];\n","language":"Raku"},{"code":"/*REXX program finds largest left─ and right─truncatable primes ≤ 1m (or argument 1).*/\nparse arg hi .; if hi=='' then hi= 1000000 /*Not specified? Then use default of 1m*/\ncall genP /*generate some primes, about hi ÷ 2 */\n /* [↓] find largest left truncatable P*/\n do L=# by -1 for # /*search from top end; get the length.*/\n do k=1 for length(@.L); _= right(@.L, k) /*validate all left truncatable primes.*/\n if \\!._ then iterate L /*Truncated number not prime? Skip it.*/\n end /*k*/\n leave /*egress, found left truncatable prime.*/\n end /*L*/\n /* [↓] find largest right truncated P.*/\n do R=# by -1 for # /*search from top end; get the length.*/\n do k=1 for length(@.R); _= left(@.R, k) /*validate all right truncatable primes*/\n if \\!._ then iterate R /*Truncated number not prime? Skip it.*/\n end /*k*/\n leave /*egress, found right truncatable prime*/\n end /*R*/\n\nsay 'The largest left─truncatable prime ≤' hi \" is \" right(@.L, w)\nsay 'The largest right─truncatable prime ≤' hi \" is \" right(@.R, w)\nexit /*stick a fork in it, we're all done. */\n/*──────────────────────────────────────────────────────────────────────────────────────*/\ngenP: !.= 0; w= length(hi) /*placeholders for primes; max width. */\n @.1=2; @.2=3; @.3=5; @.4=7; @.5=11 /*define some low primes. */\n !.2=1; !.3=1; !.5=1; !.7=1; !.11=1 /* \" \" \" \" flags. */\n #=5; s.#= @.# **2 /*number of primes so far; prime². */\n /* [↓] generate more primes ≤ high.*/\n do j=@.#+2 by 2 for max(0, hi%2-@.#%2-1) /*find odd primes from here on. */\n parse var j '' -1 _; if _==5 then iterate /*J divisible by 5? (right dig)*/\n if j// 3==0 then iterate /*\" \" \" 3? */\n if j// 7==0 then iterate /*\" \" \" 7? */\n /* [↑] the above five lines saves time*/\n do k=5 while s.k<=j /* [↓] divide by the known odd primes.*/\n if j // @.k == 0 then iterate j /*Is J ÷ X? Then not prime. ___ */\n end /*k*/ /* [↑] only process numbers ≤ √ J */\n #= #+1; @.#= j; s.#= j*j; !.j= 1 /*bump # of Ps; assign next P; P²; P# */\n end /*j*/\n return\n","language":"REXX"},{"code":"# Project : Truncatable primes\n\nfor n = 1000000 to 1 step -1\n flag = 1\n flag2 = 1\n strn = string(n)\n for nr = 1 to len(strn)\n if strn[nr] = \"0\"\n flag2 = 0\n ok\n next\n if flag2 = 1\n for m = 1 to len(strn)\n strp = right(strn, m)\n if isprime(number(strp))\n else\n flag = 0\n exit\n ok\n next\n if flag = 1\n nend = n\n exit\n ok\n ok\nnext\nsee \"Largest left truncatable prime : \" + nend + nl\n\nfor n = 1000000 to 1 step -1\n flag = 1\n strn = string(n)\n for m = 1 to len(strn)\n strp = left(strn, len(strn) - m + 1)\n if isprime(number(strp))\n else\n flag = 0\n exit\n ok\n next\n if flag = 1\n nend = n\n exit\n ok\nnext\nsee \"Largest right truncatable prime : \" + nend + nl\n\nfunc isprime num\n if (num <= 1) return 0 ok\n if (num % 2 = 0 and num != 2) return 0 ok\n for i = 3 to floor(num / 2) -1 step 2\n if (num % i = 0) return 0 ok\n next\n return 1\n","language":"Ring"},{"code":"def left_truncatable?(n)\n truncatable?(n) {|i| i.to_s[1..-1].to_i}\nend\n\n\ndef right_truncatable?(n)\n truncatable?(n) {|i| i/10}\nend\n\ndef truncatable?(n, &trunc_func)\n return false if n.to_s.include? \"0\"\n loop do\n n = trunc_func.call(n)\n return true if n.zero?\n return false unless Prime.prime?(n)\n end\nend\n\nrequire 'prime'\nprimes = Prime.each(1_000_000).to_a.reverse\n\np primes.detect {|p| left_truncatable? p}\np primes.detect {|p| right_truncatable? p}\n","language":"Ruby"},{"code":"fn 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_left_truncatable(p: u32) -> bool {\n let mut n = 10;\n let mut q = p;\n while p > n {\n if !is_prime(p % n) || q == p % n {\n return false;\n }\n q = p % n;\n n *= 10;\n }\n true\n}\n\nfn is_right_truncatable(p: u32) -> bool {\n let mut q = p / 10;\n while q > 0 {\n if !is_prime(q) {\n return false;\n }\n q /= 10;\n }\n true\n}\n\nfn main() {\n let limit = 1000000;\n let mut largest_left = 0;\n let mut largest_right = 0;\n let mut p = limit;\n while p >= 2 {\n if is_prime(p) && is_left_truncatable(p) {\n largest_left = p;\n break;\n }\n p -= 1;\n }\n println!(\"Largest left truncatable prime is {}\", largest_left);\n p = limit;\n while p >= 2 {\n if is_prime(p) && is_right_truncatable(p) {\n largest_right = p;\n break;\n }\n p -= 1;\n }\n println!(\"Largest right truncatable prime is {}\", largest_right);\n}\n","language":"Rust"},{"code":"object TruncatablePrimes {\n def main(args: Array[String]): Unit = {\n val max = 1000000\n\n println(\n s\"\"\"|ltPrime: ${ltPrimes.takeWhile(_ <= max).last}\n |rtPrime: ${rtPrimes.takeWhile(_ <= max).last}\n |\"\"\".stripMargin)\n }\n\n def ltPrimes: LazyList[Int] = 2 #:: LazyList.from(3, 2).filter(isLeftTruncPrime)\n def rtPrimes: LazyList[Int] = 2 #:: LazyList.from(3, 2).filter(isRightTruncPrime)\n\n def isPrime(num: Int): Boolean = (num > 1) && !LazyList.range(3, math.sqrt(num).toInt + 1, 2).exists(num%_ == 0)\n def isLeftTruncPrime(num: Int): Boolean = !num.toString.contains('0') && Iterator.unfold(num.toString){str => if(str.nonEmpty) Some((str.toInt, str.tail)) else None}.forall(isPrime)\n def isRightTruncPrime(num: Int): Boolean = !num.toString.exists(_.asDigit%2 == 0) && Iterator.unfold(num.toString){str => if(str.nonEmpty) Some((str.toInt, str.init)) else None}.forall(isPrime)\n}\n","language":"Scala"},{"code":"func t_prime(n, left=true) {\n var p = %w(2 3 5 7);\n var f = (\n left ? { '1'..'9' ~X+ p }\n : { p ~X+ '1'..'9' }\n )\n n.times {\n p = f().grep{ .to_i.is_prime }\n }\n p.map{.to_i}.max\n}\n\nsay t_prime(5, left: true)\nsay t_prime(5, left: false)\n","language":"Sidef"},{"code":"func 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 isLeftTruncatable(_ p: Int) -> Bool {\n var n = 10\n var q = p\n while p > n {\n if !isPrime(p % n) || q == p % n {\n return false\n }\n q = p % n\n n *= 10\n }\n return true\n}\n\nfunc isRightTruncatable(_ p: Int) -> Bool {\n var q = p / 10\n while q > 0 {\n if !isPrime(q) {\n return false\n }\n q /= 10\n }\n return true\n}\n\nlet limit = 1000000\nvar largestLeft = 0\nvar largestRight = 0\nvar p = limit\nwhile p >= 2 {\n if isPrime(p) && isLeftTruncatable(p) {\n largestLeft = p\n break\n }\n p -= 1\n}\nprint(\"Largest left truncatable prime is \\(largestLeft)\")\np = limit\nwhile p >= 2 {\n if isPrime(p) && isRightTruncatable(p) {\n largestRight = p\n break\n }\n p -= 1\n}\nprint(\"Largest right truncatable prime is \\(largestRight)\")\n","language":"Swift"},{"code":"package require Tcl 8.5\n\n# Optimized version of the Sieve-of-Eratosthenes task solution\nproc sieve n {\n set primes [list]\n if {$n < 2} {return $primes}\n set nums [dict create]\n for {set i 2} {$i <= $n} {incr i} {\n dict set nums $i \"\"\n }\n set next 2\n set limit [expr {sqrt($n)}]\n while {$next <= $limit} {\n for {set i $next} {$i <= $n} {incr i $next} {dict unset nums $i}\n lappend primes $next\n\tdict for {next -} $nums break\n }\n return [concat $primes [dict keys $nums]]\n}\n\nproc isLeftTruncatable n {\n global isPrime\n while {[string length $n] > 0} {\n\tif {![info exist isPrime($n)]} {\n\t return false\n\t}\n\tset n [string range $n 1 end]\n }\n return true\n}\nproc isRightTruncatable n {\n global isPrime\n while {[string length $n] > 0} {\n\tif {![info exist isPrime($n)]} {\n\t return false\n\t}\n\tset n [string range $n 0 end-1]\n }\n return true\n}\n\n# Demo code\nset limit 1000000\nputs \"calculating primes up to $limit\"\nset primes [sieve $limit]\nputs \"search space contains [llength $primes] members\"\nforeach p $primes {\n set isPrime($p) \"yes\"\n}\nset primes [lreverse $primes]\n\nputs \"searching for largest left-truncatable prime\"\nforeach p $primes {\n if {[isLeftTruncatable $p]} {\n\tputs FOUND:$p\n\tbreak\n }\n}\n\nputs \"searching for largest right-truncatable prime\"\nforeach p $primes {\n if {[isRightTruncatable $p]} {\n\tputs FOUND:$p\n\tbreak\n }\n}\n","language":"Tcl"},{"code":"start_time = Now\n\nlt = 0\nrt = 0\n\nFor h = 1 To 1000000\n\tIf IsLeftTruncatable(h) And h > lt Then\n\t\tlt = h\n\tEnd If\n\tIf IsRightTruncatable(h) And h > rt Then\n\t\trt = h\n\tEnd If\nNext\n\nend_time = now\n\nWScript.StdOut.WriteLine \"Largest LTP from 1..1000000: \" & lt\nWScript.StdOut.WriteLine \"Largest RTP from 1..1000000: \" & rt\nWScript.StdOut.WriteLine \"Elapse Time(seconds) : \" & DateDiff(\"s\",start_time,end_time)\n\n'------------\nFunction IsLeftTruncatable(n)\n\tIsLeftTruncatable = False\n\tc = 0\n\tFor i = Len(n) To 1 Step -1\n\t\tIf InStr(1,n,\"0\") > 0 Then\n\t\t\tExit For\n\t\tEnd If\n\t\tIf IsPrime(Right(n,i)) Then\n\t\t\tc = c + 1\n\t\tEnd If\n\tNext\n\tIf c = Len(n) Then\n\t\tIsLeftTruncatable = True\n\tEnd If\nEnd Function\n\nFunction IsRightTruncatable(n)\n\tIsRightTruncatable = False\n\tc = 0\n\tFor i = Len(n) To 1 Step -1\n\t\tIf InStr(1,n,\"0\") > 0 Then\n\t\t\tExit For\n\t\tEnd If\n\t\tIf IsPrime(Left(n,i)) Then\n\t\t\tc = c + 1\n\t\tEnd If\n\tNext\n\tIf c = Len(n) Then\n\t\tIsRightTruncatable = True\n\tEnd If\nEnd Function\n\nFunction IsPrime(n)\n\tIf n = 2 Then\n\t\tIsPrime = True\n\tElseIf n <= 1 Or n Mod 2 = 0 Then\n\t\tIsPrime = False\n\tElse\n\t\tIsPrime = True\n\t\tFor i = 3 To Int(Sqr(n)) Step 2\n\t\t\tIf n Mod i = 0 Then\n\t\t\t\tIsPrime = False\n\t\t\t\tExit For\n\t\t\tEnd If\n\t\tNext\n\tEnd If\nEnd Function\n","language":"VBScript"},{"code":"import \"./fmt\" for Fmt\nimport \"./math\" for Int\n\nvar limit = 999999\nvar c = Int.primeSieve(limit, false)\nvar leftFound = false\nvar rightFound = false\nSystem.print(\"Largest truncatable primes less than a million:\")\nvar i = limit\nwhile (i > 2) {\n if (!c[i]) {\n if (!rightFound) {\n var p = (i/10).floor\n while (p > 0) {\n if (p%2 == 0 || c[p]) break\n p = (p/10).floor\n }\n if (p == 0) {\n System.print(\" Right truncatable prime = %(Fmt.dc(0, i))\")\n rightFound = true\n if (leftFound) return\n }\n }\n if (!leftFound) {\n var q = i.toString[1..-1]\n if (!q.contains(\"0\")) {\n var p = Num.fromString(q)\n while (q.count > 0) {\n if (p%2 == 0 || c[p]) break\n q = q[1..-1]\n p = Num.fromString(q)\n }\n if (q == \"\") {\n System.print(\" Left truncatable prime = %(Fmt.dc(0, i))\")\n leftFound = true\n if (rightFound) return\n }\n }\n }\n }\n i = i - 2\n}\n","language":"Wren"},{"code":"code CrLf=9, IntOut=11;\n\nfunc Prime(P); \\Return true if P is a prime number\nint P; \\(1 is not prime, but 2 is, etc.)\nint I;\n[if P<=1 then return false; \\negative numbers are not prime\nfor I:= 2 to sqrt(P) do\n if rem(P/I) = 0 then return false;\nreturn true;\n];\n\nfunc RightTrunc(N); \\Return largest right-truncatable prime < one million\nint N;\nint M;\n[for N:= 1_000_000-1 downto 2 do\n [M:= N;\n loop [if not Prime(M) then quit;\n M:= M/10;\n if rem(0) = 0 then quit; \\no zeros allowed\n if M=0 then return N;\n ];\n ];\n];\n\nfunc LeftTrunc(N); \\Return largest left-truncatable prime < one million\nint N;\nint M, P;\n[for N:= 1_000_000-1 downto 2 do\n [M:= N;\n P:=100_000;\n loop [if not Prime(M) then quit;\n M:= rem(M/P);\n P:= P/10;\n if M<P then quit; \\no zeros allowed\n if M=0 then return N;\n ];\n ];\n];\n\n[IntOut(0, LeftTrunc); CrLf(0);\n IntOut(0, RightTrunc); CrLf(0);\n]\n","language":"XPL0"},{"code":"const million=0d1_000_000;\n\nvar pTable=Data(million+1,Int).fill(0);\t// actually bytes, all zero\nprimes:=Utils.Generator(Import(\"sieve\").postponed_sieve);\nwhile((p:=primes.next())<million){ pTable[p]=1; }\n\nfcn rightTrunc(n){\n while(n){ if(not pTable[n]) return(False); n/=10; }\n True\n}\nfcn leftTrunc(n){ // 999,907 is not allowed\n ns:=n.toString(); if (ns.holds(\"0\")) return(False);\n while(ns){ if(not pTable[ns]) return(False); ns=ns[1,*]; }\n True\n}\n","language":"Zkl"},{"code":"[million..0,-1].filter1(rightTrunc):\n \"%,d is a right truncatable prime\".fmt(_).println();\n[million..0,-1].filter1(leftTrunc):\n \"%,d is a left truncatable prime\".fmt(_).println();\n","language":"Zkl"}],"string":"[\n {\n \"code\": \"---\\nfrom: http://rosettacode.org/wiki/Truncatable_primes\\nnote: Prime Numbers\\n\",\n \"language\": \"00-META\"\n },\n {\n \"code\": \"A truncatable prime is a prime number that when you successively remove digits from one end of the prime, you are left with a new prime number.\\n\\n\\n;Examples:\\nThe number '''997''' is called a ''left-truncatable prime'' as the numbers '''997''', '''97''', and '''7''' are all prime. \\n\\nThe number '''7393''' is a ''right-truncatable prime'' as the numbers '''7393''', '''739''', '''73''', and '''7''' formed by removing digits from its right are also prime. \\n\\nNo zeroes are allowed in truncatable primes.\\n\\n\\n;Task:\\nThe task is to find the largest left-truncatable and right-truncatable primes less than one million (base 10 is implied).\\n\\n\\n;Related tasks: \\n* [[Find largest left truncatable prime in a given base]]\\n* [[Sieve of Eratosthenes]]\\n\\n\\n;See also:\\n* [http://mathworld.wolfram.com/TruncatablePrime.html Truncatable Prime] from MathWorld.]\\n<br><br>\\n\\n\",\n \"language\": \"00-TASK\"\n },\n {\n \"code\": \"V MAX_PRIME = 1000000\\nV primes = [1B] * MAX_PRIME\\nprimes[0] = primes[1] = 0B\\n\\nV i = 2\\nL i * i < MAX_PRIME\\n L(j) (i * i .< MAX_PRIME).step(i)\\n primes[j] = 0B\\n i++\\n L i < MAX_PRIME & !primes[i]\\n i++\\n\\nF left_trunc(=n)\\n V tens = 1\\n L tens < n\\n tens *= 10\\n\\n L n != 0\\n I !:primes[n]\\n R 0B\\n tens I/= 10\\n I n < tens\\n R 0B\\n n %= tens\\n\\n R 1B\\n\\nF right_trunc(=n)\\n L n != 0\\n I !:primes[n]\\n R 0B\\n n I/= 10\\n R 1B\\n\\nL(n) (MAX_PRIME - 1 .< 0).step(-2)\\n I left_trunc(n)\\n print(‘Left: ’n)\\n L.break\\n\\nL(n) (MAX_PRIME - 1 .< 0).step(-2)\\n I right_trunc(n)\\n print(‘Right: ’n)\\n L.break\\n\",\n \"language\": \"11l\"\n },\n {\n \"code\": \"with Ada.Text_IO; use Ada.Text_IO;\\nwith Ada.Containers.Ordered_Sets;\\n\\nprocedure Truncatable_Primes is\\n package Natural_Set is new Ada.Containers.Ordered_Sets (Natural);\\n use Natural_Set;\\n\\n Primes : Set;\\n\\n function Is_Prime (N : Natural) return Boolean is\\n Position : Cursor := First (Primes);\\n begin\\n while Has_Element (Position) loop\\n if N mod Element (Position) = 0 then\\n return False;\\n end if;\\n Position := Next (Position);\\n end loop;\\n return True;\\n end Is_Prime;\\n\\n function Is_Left_Trucatable_Prime (N : Positive) return Boolean is\\n M : Natural := 1;\\n begin\\n while Contains (Primes, N mod (M * 10)) and (N / M) mod 10 > 0 loop\\n M := M * 10;\\n if N <= M then\\n return True;\\n end if;\\n end loop;\\n return False;\\n end Is_Left_Trucatable_Prime;\\n\\n function Is_Right_Trucatable_Prime (N : Positive) return Boolean is\\n M : Natural := N;\\n begin\\n while Contains (Primes, M) and M mod 10 > 0 loop\\n M := M / 10;\\n if M <= 1 then\\n return True;\\n end if;\\n end loop;\\n return False;\\n end Is_Right_Trucatable_Prime;\\n\\n Position : Cursor;\\nbegin\\n for N in 2..1_000_000 loop\\n if Is_Prime (N) then\\n Insert (Primes, N);\\n end if;\\n end loop;\\n Position := Last (Primes);\\n while Has_Element (Position) loop\\n if Is_Left_Trucatable_Prime (Element (Position)) then\\n Put_Line (\\\"Largest LTP from 1..1000000:\\\" & Integer'Image (Element (Position)));\\n exit;\\n end if;\\n Previous (Position);\\n end loop;\\n Position := Last (Primes);\\n while Has_Element (Position) loop\\n if Is_Right_Trucatable_Prime (Element (Position)) then\\n Put_Line (\\\"Largest RTP from 1..1000000:\\\" & Integer'Image (Element (Position)));\\n exit;\\n end if;\\n Previous (Position);\\n end loop;\\nend Truncatable_Primes;\\n\",\n \"language\": \"Ada\"\n },\n {\n \"code\": \"#!/usr/local/bin/a68g --script #\\n\\nPROC is prime = (INT n)BOOL:(\\n []BOOL is short prime=(FALSE, TRUE, TRUE, FALSE, TRUE, FALSE, TRUE, FALSE, FALSE);\\n IF n<=UPB is short prime THEN is short prime[n] # EXIT # ELSE\\n IF ( NOT ODD n | TRUE | n MOD 3 = 0 ) THEN FALSE # EXIT # ELSE\\n INT h := ENTIER sqrt(n)+3;\\n FOR a FROM 7 BY 6 WHILE a<h DO\\n IF ( n MOD a = 0 | TRUE | n MOD (a-2) = 0 ) THEN false exit FI\\n OD;\\n TRUE # EXIT #\\n FI\\n FI EXIT\\n false exit: FALSE\\n);\\n\\nPROC string to int = (STRING in a)INT:(\\n FILE f; STRING a := in a; associate(f, a);\\n INT i; get(f, i); close(f);\\n i\\n);\\n\\nPROC is trunc prime = (INT in n, PROC(REF STRING)VOID trunc)BOOL: (\\n INT n := in n;\\n STRING s := whole(n, 0);\\n IF char in string(\\\"0\\\", NIL, s) THEN FALSE # EXIT #\\n ELSE\\n WHILE is prime(n) DO\\n s := whole(n, 0);\\n trunc(s);\\n IF UPB s = 0 THEN true exit FI;\\n n := string to int(s)\\n OD;\\n FALSE EXIT\\n true exit: TRUE\\n FI\\n);\\n\\nPROC get trunc prime = (INT in n, PROC(REF STRING)VOID trunc)VOID:(\\n FOR n FROM in n BY -1 TO 1 DO\\n IF is trunc prime(n, trunc) THEN\\n printf(($g(0)l$, n));\\n break\\n FI\\n OD;\\n break: ~\\n);\\n\\nmain:(\\n INT limit = 1000000;\\n printf(($g g(0) gl$,\\\"Highest left- and right-truncatable primes under \\\",limit,\\\":\\\"));\\n get trunc prime(limit, (REF STRING s)VOID: s := s[LWB s+1:]);\\n get trunc prime(limit, (REF STRING s)VOID: s := s[:UPB s-1]);\\n write(\\\"Press Enter\\\");\\n read(newline)\\n)\\n\",\n \"language\": \"ALGOL-68\"\n },\n {\n \"code\": \"leftTruncatable?: function [n][\\n every? map 0..(size s)-1 'z -> to :integer slice s z (size s)-1\\n => prime?\\n]\\n\\nrightTruncatable?: function [n][\\n every? map 0..(size s)-1 'z -> to :integer slice s 0 z\\n => prime?\\n]\\n\\nupperLimit: 999999\\n\\nloop range upperLimit .step:2 0 'x [\\n s: to :string x\\n if and? not? contains? s \\\"0\\\"\\n leftTruncatable? x [\\n print [\\\"highest left-truncatable:\\\" x]\\n break\\n ]\\n]\\n\\nloop range upperLimit .step:2 0 'x [\\n s: to :string x\\n if and? not? contains? s \\\"0\\\"\\n rightTruncatable? x [\\n print [\\\"highest right-truncatable:\\\" x]\\n break\\n ]\\n]\\n\",\n \"language\": \"Arturo\"\n },\n {\n \"code\": \"SetBatchLines, -1\\nMsgBox, % \\\"Largest left-truncatable and right-truncatable primes less than one million:`n\\\"\\n\\t. \\\"Left:`t\\\" LTP(10 ** 6) \\\"`nRight:`t\\\" RTP(10 ** 6)\\n\\nLTP(n) {\\n\\twhile n {\\n\\t\\tn--\\n\\t\\tif (!Instr(n, \\\"0\\\") && IsPrime(n)) {\\n\\t\\t\\tLoop, % StrLen(n)\\n\\t\\t\\t\\tif (!IsPrime(SubStr(n, A_Index)))\\n\\t\\t\\t\\t\\tcontinue, 2\\n\\t\\t\\tbreak\\n\\t\\t}\\n\\t}\\n\\treturn, n\\n}\\n\\nRTP(n) {\\n\\twhile n {\\n\\t\\tn--\\n\\t\\tif (!IsPrime(SubStr(n, 1, 1)))\\n\\t\\t\\tn -= 10 ** (StrLen(n) - 1)\\n\\t\\tif (!Instr(n, \\\"0\\\") && IsPrime(n)) {\\n\\t\\t\\tLoop, % StrLen(n)\\n\\t\\t\\t\\tif (!IsPrime(SubStr(n, 1, A_Index)))\\n\\t\\t\\t\\t\\tcontinue, 2\\n\\t\\t\\tbreak\\n\\t\\t}\\n\\t}\\n\\treturn, n\\n}\\n\\nIsPrime(n) {\\n\\tif (n < 2)\\n\\t\\treturn, 0\\n\\telse if (n < 4)\\n\\t\\treturn, 1\\n\\telse if (!Mod(n, 2))\\n\\t\\treturn, 0\\n\\telse if (n < 9)\\n\\t\\treturn 1\\n\\telse if (!Mod(n, 3))\\n\\t\\treturn, 0\\n\\telse {\\n\\t\\tr := Floor(Sqrt(n))\\n\\t\\tf := 5\\n\\t\\twhile (f <= r) {\\n\\t\\t\\tif (!Mod(n, f))\\n\\t\\t\\t\\treturn, 0\\n\\t\\t\\tif (!Mod(n, (f + 2)))\\n\\t\\t\\t\\treturn, 0\\n\\t\\t\\tf += 6\\n\\t\\t}\\n\\t\\treturn, 1\\n\\t}\\n}\\n\",\n \"language\": \"AutoHotkey\"\n },\n {\n \"code\": \"# syntax: GAWK -f TRUNCATABLE_PRIMES.AWK\\nBEGIN {\\n limit = 1000000\\n for (i=1; i<=limit; i++) {\\n if (is_prime(i)) {\\n prime_count++\\n arr[i] = \\\"\\\"\\n if (truncate_left(i) == 1) {\\n max_left = max(max_left,i)\\n }\\n if (truncate_right(i) == 1) {\\n max_right = max(max_right,i)\\n }\\n }\\n }\\n printf(\\\"1-%d: %d primes\\\\n\\\",limit,prime_count)\\n printf(\\\"largest L truncatable: %d\\\\n\\\",max_left)\\n printf(\\\"largest R truncatable: %d\\\\n\\\",max_right)\\n exit(0)\\n}\\nfunction is_prime(x, i) {\\n if (x <= 1) {\\n return(0)\\n }\\n for (i=2; i<=int(sqrt(x)); i++) {\\n if (x % i == 0) {\\n return(0)\\n }\\n }\\n return(1)\\n}\\nfunction truncate_left(n) {\\n while (n != \\\"\\\") {\\n if (!(n in arr)) {\\n return(0)\\n }\\n n = substr(n,2)\\n }\\n return(1)\\n}\\nfunction truncate_right(n) {\\n while (n != \\\"\\\") {\\n if (!(n in arr)) {\\n return(0)\\n }\\n n = substr(n,1,length(n)-1)\\n }\\n return(1)\\n}\\nfunction max(x,y) { return((x > y) ? x : y) }\\n\",\n \"language\": \"AWK\"\n },\n {\n \"code\": \"( 1000001:?i\\n& whl\\n ' ( !i+-2:>0:?i\\n & !i:?L\\n & whl'(!L^1/2:#?^1/2&@(!L:% ?L))\\n & !L:~\\n )\\n& out$(\\\"left:\\\" !i)\\n& 1000001:?i\\n& whl\\n ' ( !i+-2:>0:?i\\n & !i:?R\\n & whl'(!R^1/2:#?^1/2&@(!R:?R %@))\\n & !R:~\\n )\\n& out$(\\\"right:\\\" !i)\\n)\\n\",\n \"language\": \"Bracmat\"\n },\n {\n \"code\": \"#include <stdio.h>\\n#include <stdlib.h>\\n#include <string.h>\\n\\n#define MAX_PRIME 1000000\\nchar *primes;\\nint n_primes;\\n\\n/* Sieve. If we were to handle 10^9 range, use bit field. Regardless,\\n * if a large amount of prime numbers need to be tested, sieve is fast.\\n */\\nvoid init_primes()\\n{\\n\\tint j;\\n\\tprimes = malloc(sizeof(char) * MAX_PRIME);\\n\\tmemset(primes, 1, MAX_PRIME);\\n\\tprimes[0] = primes[1] = 0;\\n\\tint i = 2;\\n\\twhile (i * i < MAX_PRIME) {\\n\\t\\tfor (j = i * 2; j < MAX_PRIME; j += i)\\n\\t\\t\\tprimes[j] = 0;\\n\\t\\twhile (++i < MAX_PRIME && !primes[i]);\\n\\t}\\n}\\n\\nint left_trunc(int n)\\n{\\n\\tint tens = 1;\\n\\twhile (tens < n) tens *= 10;\\n\\n\\twhile (n) {\\n\\t\\tif (!primes[n]) return 0;\\n\\t\\ttens /= 10;\\n\\t\\tif (n < tens) return 0;\\n\\t\\tn %= tens;\\n\\t}\\n\\treturn 1;\\n}\\n\\nint right_trunc(int n)\\n{\\n\\twhile (n) {\\n\\t\\tif (!primes[n]) return 0;\\n\\t\\tn /= 10;\\n\\t}\\n\\treturn 1;\\n}\\n\\nint main()\\n{\\n\\tint n;\\n\\tint max_left = 0, max_right = 0;\\n\\tinit_primes();\\n\\n\\tfor (n = MAX_PRIME - 1; !max_left; n -= 2)\\n\\t\\tif (left_trunc(n)) max_left = n;\\n\\n\\tfor (n = MAX_PRIME - 1; !max_right; n -= 2)\\n\\t\\tif (right_trunc(n)) max_right = n;\\n\\n\\tprintf(\\\"Left: %d; right: %d\\\\n\\\", max_left, max_right);\\n\\treturn 0;\\n}\\n\",\n \"language\": \"C\"\n },\n {\n \"code\": \"Left: 998443; right: 739399\\n\",\n \"language\": \"C\"\n },\n {\n \"code\": \"#include <stdio.h>\\n\\n#define MAXN 1000000\\nint maxl, maxr;\\n\\nint is_prime(int n)\\n{\\n\\tint p;\\n\\tif (n % 3 == 0) return 0;\\n\\n\\tfor (p = 6; p * p <= n; p += 6)\\n\\t\\tif (!(n % (p + 1) && n % (p + 5)))\\n\\t\\t\\treturn 0;\\n\\treturn 1;\\n}\\n\\nvoid left(int n, int tens)\\n{\\n\\tint i, nn;\\n\\n\\tif (n > maxl) maxl = n;\\n\\tif (n < MAXN / 10)\\n\\t\\tfor (tens *= 10, i = 1; i < 10; i++)\\n\\t\\t\\tif (is_prime(nn = i * tens + n))\\n\\t\\t\\t\\tleft(nn, tens);\\n}\\n\\nvoid right(int n)\\n{\\n\\tint i, nn;\\n\\tstatic int d[] = {1,3,7,9};\\n\\n\\tif (n > maxr) maxr = n;\\n\\tif (n < MAXN / 10)\\n\\t\\tfor (i = 1; i < 4; i++)\\n\\t\\t\\tif (is_prime(nn = n * 10 + d[i])) right(nn);\\n}\\n\\nint main(void)\\n{\\n\\tleft(3, 1); left(7, 1);\\n\\tright(3); right(5); right(7);\\n\\n\\tprintf(\\\"%d %d\\\\n\\\", maxl, maxr);\\n\\n\\treturn 0;\\n}\\n\",\n \"language\": \"C\"\n },\n {\n \"code\": \"#include <iostream>\\n#include \\\"prime_sieve.hpp\\\"\\n\\nbool is_left_truncatable(const prime_sieve& sieve, int p) {\\n for (int n = 10, q = p; p > n; n *= 10) {\\n if (!sieve.is_prime(p % n) || q == p % n)\\n return false;\\n q = p % n;\\n }\\n return true;\\n}\\n\\nbool is_right_truncatable(const prime_sieve& sieve, int p) {\\n for (int q = p/10; q > 0; q /= 10) {\\n if (!sieve.is_prime(q))\\n return false;\\n }\\n return true;\\n}\\n\\nint main() {\\n const int limit = 1000000;\\n\\n // find the prime numbers up to the limit\\n prime_sieve sieve(limit + 1);\\n\\n int largest_left = 0;\\n int largest_right = 0;\\n // find largest left truncatable prime\\n for (int p = limit; p >= 2; --p) {\\n if (sieve.is_prime(p) && is_left_truncatable(sieve, p)) {\\n largest_left = p;\\n break;\\n }\\n }\\n // find largest right truncatable prime\\n for (int p = limit; p >= 2; --p) {\\n if (sieve.is_prime(p) && is_right_truncatable(sieve, p)) {\\n largest_right = p;\\n break;\\n }\\n }\\n // write results to standard output\\n std::cout << \\\"Largest left truncatable prime is \\\" << largest_left << '\\\\n';\\n std::cout << \\\"Largest right truncatable prime is \\\" << largest_right << '\\\\n';\\n return 0;\\n}\\n\",\n \"language\": \"C++\"\n },\n {\n \"code\": \"#ifndef PRIME_SIEVE_HPP\\n#define PRIME_SIEVE_HPP\\n\\n#include <algorithm>\\n#include <vector>\\n\\n/**\\n * A simple implementation of the Sieve of Eratosthenes.\\n * See https://en.wikipedia.org/wiki/Sieve_of_Eratosthenes.\\n */\\nclass prime_sieve {\\npublic:\\n explicit prime_sieve(size_t);\\n bool is_prime(size_t) const;\\nprivate:\\n std::vector<bool> is_prime_;\\n};\\n\\n/**\\n * Constructs a sieve with the given limit.\\n *\\n * @param limit the maximum integer that can be tested for primality\\n */\\ninline prime_sieve::prime_sieve(size_t limit) {\\n limit = std::max(size_t(3), limit);\\n is_prime_.resize(limit/2, true);\\n for (size_t p = 3; p * p <= limit; p += 2) {\\n if (is_prime_[p/2 - 1]) {\\n size_t inc = 2 * p;\\n for (size_t q = p * p; q <= limit; q += inc)\\n is_prime_[q/2 - 1] = false;\\n }\\n }\\n}\\n\\n/**\\n * Returns true if the given integer is a prime number. The integer\\n * must be less than or equal to the limit passed to the constructor.\\n *\\n * @param n an integer less than or equal to the limit passed to the\\n * constructor\\n * @return true if the integer is prime\\n */\\ninline bool prime_sieve::is_prime(size_t n) const {\\n if (n == 2)\\n return true;\\n if (n < 2 || n % 2 == 0)\\n return false;\\n return is_prime_.at(n/2 - 1);\\n}\\n\\n#endif\\n\",\n \"language\": \"C++\"\n },\n {\n \"code\": \"using System; // 4790@3.6\\nusing System.Collections.Generic;\\nclass truncatable_primes\\n{\\n static void Main()\\n {\\n uint m = 1000000;\\n Console.Write(\\\"L \\\" + L(m) + \\\" R \\\" + R(m) + \\\" \\\");\\n var sw = System.Diagnostics.Stopwatch.StartNew();\\n for (int i = 1000; i > 0; i--) { L(m); R(m); }\\n Console.Write(sw.Elapsed); Console.Read();\\n }\\n\\n static uint L(uint n)\\n {\\n n -= n & 1; n--;\\n for (uint d, d1 = 100; ; n -= 2)\\n {\\n while (n % 3 == 0 || n % 5 == 0 || n % 7 == 0) n -= 2;\\n if ((d = n % 10) == 3 || d == 7)\\n {\\n while (d1 < n && d < (d = n % d1) && isP(d)) d1 *= 10;\\n if (d1 > n && isP(n)) return n; d1 = 100;\\n }\\n }\\n }\\n\\n static uint R(uint m)\\n {\\n var p = new List<uint>() { 2, 3, 5, 7 }; uint n = 20, np;\\n for (int i = 1; i < p.Count; n = 10 * p[i++])\\n {\\n if ((np = n + 1) >= m) break; if (isP(np)) p.Add(np);\\n if ((np = n + 3) >= m) break; if (isP(np)) p.Add(np);\\n if ((np = n + 7) >= m) break; if (isP(np)) p.Add(np);\\n if ((np = n + 9) >= m) break; if (isP(np)) p.Add(np);\\n }\\n return p[p.Count - 1];\\n }\\n\\n static bool isP(uint n)\\n {\\n if (n < 7) return n == 2 || n == 3 || n == 5;\\n if ((n & 1) == 0 || n % 3 == 0 || n % 5 == 0) return false;\\n for (uint r = (uint)Math.Sqrt(n), d = 7; d <= r; d += 30)\\n if (n % (d + 00) == 0 || n % (d + 04) == 0 ||\\n n % (d + 06) == 0 || n % (d + 10) == 0 ||\\n n % (d + 12) == 0 || n % (d + 16) == 0 ||\\n n % (d + 22) == 0 || n % (d + 24) == 0) return false;\\n return true;\\n }\\n}\\n\",\n \"language\": \"C-sharp\"\n },\n {\n \"code\": \"(use '[clojure.contrib.lazy-seqs :only [primes]])\\n\\n(def prime?\\n (let [mem (ref #{})\\n\\tprimes (ref primes)]\\n (fn [n]\\n (dosync\\n (if (< n (first @primes))\\n\\t (@mem n)\\n\\t (let [[mems ss] (split-with #(<= % n) @primes)]\\n\\t (ref-set primes ss)\\n\\t ((commute mem into mems) n)))))))\\n\\n(defn drop-lefts [n]\\n (let [dropl #(if (< % 10) 0 (Integer. (subs (str %) 1)))]\\n (->> (iterate dropl n)\\n\\t (take-while pos? ,)\\n\\t next)))\\n\\n(defn drop-rights [n]\\n (->> (iterate #(quot % 10) n)\\n next\\n (take-while pos? ,)))\\n\\n(defn truncatable-left? [n]\\n (every? prime? (drop-lefts n)))\\n\\n(defn truncatable-right? [n]\\n (every? prime? (drop-rights n)))\\n\\nuser> (->> (for [p primes\\n\\t :while (< p 1000000)\\n\\t :when (not-any? #{\\\\0} (str p))\\n\\t :let [l? (if (truncatable-left? p) p 0)\\n\\t\\t r? (if (truncatable-right? p) p 0)]\\n\\t :when (or l? r?)]\\n [l? r?])\\n ((juxt #(apply max-key first %) #(apply max-key second %)) ,)\\n ((juxt ffirst (comp second second)) ,)\\n (map vector [\\\"left truncatable: \\\" \\\"right truncatable: \\\"] ,))\\n([\\\"left truncatable: \\\" 998443] [\\\"right truncatable: \\\" 739399])\\n\",\n \"language\": \"Clojure\"\n },\n {\n \"code\": \"# You could have symmetric algorithms for max right and left\\n# truncatable numbers, but they lend themselves to slightly\\n# different optimizations.\\n\\nmax_right_truncatable_number = (n, f) ->\\n # This algorithm only evaluates 37 numbers for primeness to\\n # get the max right truncatable prime < 1000000. Its\\n # optimization is that it prunes candidates for\\n # the first n-1 digits before having to iterate through\\n # the 10 possibilities for the last digit.\\n if n < 10\\n candidate = n\\n while candidate > 0\\n return candidate if f(candidate)\\n candidate -= 1\\n else\\n left = Math.floor n / 10\\n while left > 0\\n left = max_right_truncatable_number left, f\\n right = 9\\n while right > 0\\n candidate = left * 10 + right\\n return candidate if candidate <= n and f(candidate)\\n right -= 1\\n left -= 1\\n throw Error \\\"none found\\\"\\n\\nmax_left_truncatable_number = (max, f) ->\\n # This is a pretty straightforward countdown. The first\\n # optimization here would probably be to cache results of\\n # calling f on small numbers.\\n is_left_truncatable = (n) ->\\n candidate = 0\\n power_of_ten = 1\\n while n > 0\\n r = n % 10\\n return false if r == 0\\n n = Math.floor n / 10\\n candidate = r * power_of_ten + candidate\\n power_of_ten *= 10\\n return false unless f(candidate)\\n true\\n do ->\\n n = max\\n while n > 0\\n return n if is_left_truncatable n, f\\n n -= 1\\n throw Error \\\"none found\\\"\\n\\nis_prime = (n) ->\\n return false if n == 1\\n return true if n == 2\\n for d in [2..n]\\n return false if n % d == 0\\n return true if d * d >= n\\n\\n\\nconsole.log \\\"right\\\", max_right_truncatable_number(999999, is_prime)\\nconsole.log \\\"left\\\", max_left_truncatable_number(999999, is_prime)\\n\",\n \"language\": \"CoffeeScript\"\n },\n {\n \"code\": \"> coffee truncatable_prime.coffee\\nright 739399\\nleft 998443\\n\",\n \"language\": \"CoffeeScript\"\n },\n {\n \"code\": \"(defun start ()\\n (format t \\\"Largest right-truncatable ~a~%\\\" (max-right-truncatable))\\n (format t \\\"Largest left-truncatable ~a~%\\\" (max-left-truncatable)))\\n\\n(defun max-right-truncatable ()\\n (loop for el in (6-digits-R-truncatables)\\n maximizing el into max\\n finally (return max)))\\n\\n(defun 6-digits-R-truncatables (&optional (lst '(2 3 5 7)) (n 5))\\n (if (zerop n)\\n lst\\n (6-digits-R-truncatables (R-trunc lst) (- n 1))))\\n\\n(defun R-trunc (lst)\\n (remove-if (lambda (x) (not (primep x)))\\n\\t (loop for el in lst\\n\\t\\t append (mapcar (lambda (x) (+ (* 10 el) x)) '(1 3 7 9)))))\\n\\n(defun max-left-truncatable ()\\n (loop for el in (6-digits-L-truncatables)\\n maximizing el into max\\n finally (return max)))\\n\\n(defun 6-digits-L-truncatables (&optional (lst '(3 7)) (n 5))\\n (if (zerop n)\\n lst\\n (6-digits-L-truncatables (L-trunc lst (- 6 n)) (- n 1))))\\n\\n(defun L-trunc (lst n)\\n (remove-if (lambda (x) (not (primep x)))\\n\\t (loop for el in lst\\n\\t\\t append (mapcar (lambda (x) (+ (* (expt 10 n) x) el)) '(1 2 3 4 5 6 7 8 9)))))\\n\\n(defun primep (n)\\n (primep-aux n 2))\\n\\n(defun primep-aux (n d)\\n (cond ((> d (sqrt n)) t)\\n ((zerop (rem n d)) nil)\\n (t (primep-aux n (+ d 1)))))\\n\",\n \"language\": \"Common-Lisp\"\n },\n {\n \"code\": \"import std.stdio, std.math, std.string, std.conv, std.algorithm,\\n std.range;\\n\\nbool isPrime(in int n) pure nothrow {\\n if (n <= 1)\\n return false;\\n foreach (immutable i; 2 .. cast(int)sqrt(real(n)) + 1)\\n if (!(n % i))\\n return false;\\n return true;\\n}\\n\\nbool isTruncatablePrime(bool left)(in int n) pure {\\n immutable s = n.text;\\n if (s.canFind('0'))\\n return false;\\n foreach (immutable i; 0 .. s.length)\\n static if (left) {\\n if (!s[i .. $].to!int.isPrime)\\n return false;\\n } else {\\n if (!s[0 .. i + 1].to!int.isPrime)\\n return false;\\n }\\n return true;\\n}\\n\\nvoid main() {\\n enum n = 1_000_000;\\n writeln(\\\"Largest left-truncatable prime in 2 .. \\\", n, \\\": \\\",\\n iota(n, 1, -1).filter!(isTruncatablePrime!true).front);\\n writeln(\\\"Largest right-truncatable prime in 2 .. \\\", n, \\\": \\\",\\n iota(n, 1, -1).filter!(isTruncatablePrime!false).front);\\n}\\n\",\n \"language\": \"D\"\n },\n {\n \"code\": \"procedure TruncatablePrimes(Memo: TMemo);\\nvar Sieve: TPrimeSieve;\\nvar I,P: integer;\\n\\n\\n\\tfunction IsLeftTruncatable(P: integer): boolean;\\n\\t{A prime is Left truncatable, if you can remove digits}\\n\\t{one at a time from the left and it is still prime}\\n\\tvar S: string;\\n\\tvar P2: integer;\\n\\tbegin\\n\\tResult:=False;\\n\\t{Conver number to string}\\n\\tS:=IntToStr(P);\\n\\t{Delete one char from the left}\\n\\tDelete(S,1,1);\\n\\twhile Length(S)>0 do\\n\\t\\tbegin\\n\\t\\t{Zeros no allowed}\\n\\t\\tif S[1]='0' then exit;\\n\\t\\t{Convert back to number}\\n\\t\\tP2:=StrToInt(S);\\n\\t\\t{Exit if it is not prime}\\n\\t\\tif not Sieve.Flags[P2] then exit;\\n\\t\\t{Delete next char from left}\\n\\t\\tDelete(S,1,1);\\n\\t\\tend;\\n\\t{If all truncated numbers are prime}\\n\\tResult:=True;\\n\\tend;\\n\\n\\n\\tfunction IsRightTruncatable(P: integer): boolean;\\n\\t{A prime is right truncatable, if you can remove digits}\\n\\t{one at a time from the right and it is still prime}\\n\\tvar S: string;\\n\\tvar P2: integer;\\n\\tbegin\\n\\tResult:=False;\\n\\t{Conver number to string}\\n\\tS:=IntToStr(P);\\n\\t{Delete one char from the right}\\n\\tDelete(S,Length(S),1);\\n\\twhile Length(S)>0 do\\n\\t\\tbegin\\n\\t\\t{No zeros allowed}\\n\\t\\tif S[1]='0' then exit;\\n\\t\\t{Convert back to number}\\n\\t\\tP2:=StrToInt(S);\\n\\t\\t{exit if it is not prime}\\n\\t\\tif not Sieve.Flags[P2] then exit;\\n\\t\\t{Delete next char from the right}\\n\\t\\tDelete(S,Length(S),1);\\n\\t\\tend;\\n\\t{If all truncated numbers are prime}\\n\\tResult:=True;\\n\\tend;\\n\\n\\n\\nbegin\\nSieve:=TPrimeSieve.Create;\\ntry\\n{Look at primes under 1 million}\\nSieve.Intialize(1000000);\\n{Look for the highest Left Truncatable prime}\\n{Test all primes from 1 million down}\\nfor I:=Sieve.PrimeCount-1 downto 0 do\\n\\tbegin\\n\\tP:=Sieve.Primes[I];\\n\\t{The first number that is Left Truncatable, will be the highest}\\n\\tif IsLeftTruncatable(P) then\\n\\t\\tbegin\\n\\t\\tMemo.Lines.Add(IntToStr(P));\\n\\t\\tbreak;\\n\\t\\tend;\\n\\tend;\\n{Look for the highest Right Truncatable prime}\\n{Test all primes from 1 million down}\\nfor I:=Sieve.PrimeCount-1 downto 0 do\\n\\tbegin\\n\\tP:=Sieve.Primes[I];\\n\\tif IsRightTruncatable(P) then\\n\\t\\tbegin\\n\\t\\tMemo.Lines.Add(IntToStr(P));\\n\\t\\tbreak;\\n\\t\\tend;\\n\\tend;\\nfinally Sieve.Free; end;\\nend;\\n\",\n \"language\": \"Delphi\"\n },\n {\n \"code\": \"fastfunc isprim num .\\n if num < 2\\n return 0\\n .\\n i = 2\\n while i <= sqrt num\\n if num mod i = 0\\n return 0\\n .\\n i += 1\\n .\\n return 1\\n.\\nfunc isright h .\\n while h > 0\\n if isprim h = 0\\n return 0\\n .\\n h = h div 10\\n .\\n return 1\\n.\\nfunc isleft h .\\n d = pow 10 (floor log10 h)\\n while h > 0\\n if isprim h = 0\\n return 0\\n .\\n if h div d = 0\\n return 0\\n .\\n h = h mod d\\n d /= 10\\n .\\n return 1\\n.\\np = 999999\\nwhile isleft p = 0\\n p -= 2\\n.\\nprint p\\np = 999999\\nwhile isright p = 0\\n p -= 2\\n.\\nprint p\\n\",\n \"language\": \"EasyLang\"\n },\n {\n \"code\": \";; does p include a 0 in its decimal representation ?\\n(define (nozero? n) (= -1 (string-index (number->string n) \\\"0\\\")))\\n\\n;; right truncate : p and successive quotients by 10 (integer division) must be primes\\n(define (right-trunc p) (unless (zero? p)\\n\\t(and (prime? p) (right-trunc (quotient p 10)))))\\n(remember 'right-trunc)\\n\\n;; left truncate : p and successive modulo by 10, 100, .. must be prime\\n(define (left-trunc p (mod 1000000))\\n\\t(unless (< mod 1)\\n\\t(and (prime? p) (nozero? p) (left-trunc (modulo p mod) (/ mod 10)))))\\n\\n;; start from 999999. stop on first found\\n(define (fact-trunc trunc)\\n(for ((p (in-range 999999 100000 -1))) #:break (when (trunc p) (writeln p) #t)))\\n\",\n \"language\": \"EchoLisp\"\n },\n {\n \"code\": \"(fact-trunc left-trunc)\\n998443\\n(fact-trunc right-trunc)\\n739399\\n\",\n \"language\": \"EchoLisp\"\n },\n {\n \"code\": \"class\\n\\tAPPLICATION\\n\\ncreate\\n\\tmake\\n\\nfeature\\n\\n\\tmake\\n\\t\\tdo\\n\\t\\t\\tio.put_string (\\\"Largest right truncatable prime: \\\" + find_right_truncatable_primes.out)\\n\\t\\t\\tio.new_line\\n\\t\\t\\tio.put_string (\\\"Largest left truncatable prime: \\\" + find_left_truncatable_primes.out)\\n\\t\\tend\\n\\n\\tfind_right_truncatable_primes: INTEGER\\n\\t\\t\\t-- Largest right truncatable prime below 1000000.\\n\\t\\tlocal\\n\\t\\t\\ti, maybe_prime: INTEGER\\n\\t\\t\\tfound, is_one: BOOLEAN\\n\\t\\tdo\\n\\t\\t\\tfrom\\n\\t\\t\\t\\ti := 999999\\n\\t\\t\\tuntil\\n\\t\\t\\t\\tfound\\n\\t\\t\\tloop\\n\\t\\t\\t\\tis_one := True\\n\\t\\t\\t\\tfrom\\n\\t\\t\\t\\t\\tmaybe_prime := i\\n\\t\\t\\t\\tuntil\\n\\t\\t\\t\\t\\tnot is_one or maybe_prime.out.count = 1\\n\\t\\t\\t\\tloop\\n\\t\\t\\t\\t\\tif maybe_prime.out.has ('0') or maybe_prime.out.has ('2') or maybe_prime.out.has ('4') or maybe_prime.out.has ('6') or maybe_prime.out.has ('8') then\\n\\t\\t\\t\\t\\t\\tis_one := False\\n\\t\\t\\t\\t\\telse\\n\\t\\t\\t\\t\\t\\tif not is_prime (maybe_prime) then\\n\\t\\t\\t\\t\\t\\t\\tis_one := False\\n\\t\\t\\t\\t\\t\\telseif is_prime (maybe_prime) and maybe_prime.out.count > 1 then\\n\\t\\t\\t\\t\\t\\t\\tmaybe_prime := truncate_right (maybe_prime)\\n\\t\\t\\t\\t\\t\\tend\\n\\t\\t\\t\\t\\tend\\n\\t\\t\\t\\tend\\n\\t\\t\\t\\tif is_one then\\n\\t\\t\\t\\t\\tfound := True\\n\\t\\t\\t\\t\\tResult := i\\n\\t\\t\\t\\tend\\n\\t\\t\\t\\ti := i - 2\\n\\t\\t\\tend\\n\\t\\tensure\\n\\t\\t\\tResult_is_smaller: Result < 1000000\\n\\t\\tend\\n\\n\\tfind_left_truncatable_primes: INTEGER\\n\\t\\t\\t-- Largest left truncatable prime below 1000000.\\n\\t\\tlocal\\n\\t\\t\\ti, maybe_prime: INTEGER\\n\\t\\t\\tfound, is_one: BOOLEAN\\n\\t\\tdo\\n\\t\\t\\tfrom\\n\\t\\t\\t\\ti := 999999\\n\\t\\t\\tuntil\\n\\t\\t\\t\\tfound\\n\\t\\t\\tloop\\n\\t\\t\\t\\tis_one := True\\n\\t\\t\\t\\tfrom\\n\\t\\t\\t\\t\\tmaybe_prime := i\\n\\t\\t\\t\\tuntil\\n\\t\\t\\t\\t\\tnot is_one or maybe_prime.out.count = 1\\n\\t\\t\\t\\tloop\\n\\t\\t\\t\\t\\tif not is_prime (maybe_prime) then\\n\\t\\t\\t\\t\\t\\tis_one := False\\n\\t\\t\\t\\t\\telseif is_prime (maybe_prime) and maybe_prime.out.count > 1 then\\n\\t\\t\\t\\t\\t\\tif maybe_prime.out.at (2) = '0' then\\n\\t\\t\\t\\t\\t\\t\\tis_one := False\\n\\t\\t\\t\\t\\t\\telse\\n\\t\\t\\t\\t\\t\\t\\tmaybe_prime := truncate_left (maybe_prime)\\n\\t\\t\\t\\t\\t\\tend\\n\\t\\t\\t\\t\\tend\\n\\t\\t\\t\\tend\\n\\t\\t\\t\\tif is_one then\\n\\t\\t\\t\\t\\tfound := True\\n\\t\\t\\t\\t\\tResult := i\\n\\t\\t\\t\\tend\\n\\t\\t\\t\\ti := i - 2\\n\\t\\t\\tend\\n\\t\\tensure\\n\\t\\t\\tResult_is_smaller: Result < 1000000\\n\\t\\tend\\n\\nfeature {NONE}\\n\\n\\tis_prime (n: INTEGER): BOOLEAN\\n\\t\\t\\t--Is 'n' a prime number?\\n\\t\\trequire\\n\\t\\t\\tpositiv_input: n > 0\\n\\t\\tlocal\\n\\t\\t\\ti: INTEGER\\n\\t\\t\\tmax: REAL_64\\n\\t\\t\\tmath: DOUBLE_MATH\\n\\t\\tdo\\n\\t\\t\\tcreate math\\n\\t\\t\\tif n = 2 then\\n\\t\\t\\t\\tResult := True\\n\\t\\t\\telseif n <= 1 or n \\\\\\\\ 2 = 0 then\\n\\t\\t\\t\\tResult := False\\n\\t\\t\\telse\\n\\t\\t\\t\\tResult := True\\n\\t\\t\\t\\tmax := math.sqrt (n)\\n\\t\\t\\t\\tfrom\\n\\t\\t\\t\\t\\ti := 3\\n\\t\\t\\t\\tuntil\\n\\t\\t\\t\\t\\ti > max\\n\\t\\t\\t\\tloop\\n\\t\\t\\t\\t\\tif n \\\\\\\\ i = 0 then\\n\\t\\t\\t\\t\\t\\tResult := False\\n\\t\\t\\t\\t\\tend\\n\\t\\t\\t\\t\\ti := i + 2\\n\\t\\t\\t\\tend\\n\\t\\t\\tend\\n\\t\\tend\\n\\n\\ttruncate_left (n: INTEGER): INTEGER\\n\\t\\t\\t-- 'n' truncated by one digit from the left side.\\n\\t\\trequire\\n\\t\\t\\ttruncatable: n.out.count > 1\\n\\t\\tlocal\\n\\t\\t\\tst: STRING\\n\\t\\tdo\\n\\t\\t\\tst := n.out\\n\\t\\t\\tst.remove_head (1)\\n\\t\\t\\tResult := st.to_integer\\n\\t\\tensure\\n\\t\\t\\tResult_truncated: Result.out.count = n.out.count - 1\\n\\t\\tend\\n\\n\\ttruncate_right (n: INTEGER): INTEGER\\n\\t\\t\\t-- 'n' truncated by one digit from the right side.\\n\\t\\trequire\\n\\t\\t\\ttruncatable: n.out.count > 1\\n\\t\\tlocal\\n\\t\\t\\tst: STRING\\n\\t\\tdo\\n\\t\\t\\tst := n.out\\n\\t\\t\\tst.remove_tail (1)\\n\\t\\t\\tResult := st.to_integer\\n\\t\\tensure\\n\\t\\t\\tResult_truncated: Result.out.count = n.out.count - 1\\n\\t\\tend\\n\\nend\\n\",\n \"language\": \"Eiffel\"\n },\n {\n \"code\": \"import extensions;\\n\\nconst MAXN = 1000000;\\n\\nextension mathOp\\n{\\n isPrime()\\n {\\n int n := cast int(self);\\n\\n if (n < 2) { ^ false };\\n if (n < 4) { ^ true };\\n if (n.mod(2) == 0) { ^ false };\\n if (n < 9) { ^ true };\\n if (n.mod(3) == 0) { ^ false };\\n\\n int r := n.sqrt();\\n int f := 5;\\n while (f <= r)\\n {\\n if ((n.mod(f) == 0) || (n.mod(f + 2) == 0))\\n { ^ false };\\n\\n f := f + 6\\n };\\n\\n ^ true\\n }\\n\\n isRightTruncatable()\\n {\\n int n := self;\\n\\n while (n != 0)\\n {\\n ifnot (n.isPrime())\\n { ^ false };\\n\\n n := n / 10\\n };\\n\\n ^ true\\n }\\n\\n isLeftTruncatable()\\n {\\n int n := self;\\n int tens := 1;\\n\\n while (tens < n)\\n { tens := tens * 10 };\\n\\n while (n != 0)\\n {\\n ifnot (n.isPrime())\\n { ^ false };\\n\\n tens := tens / 10;\\n n := n - (n / tens * tens)\\n };\\n\\n ^ true\\n }\\n}\\n\\npublic program()\\n{\\n var n := MAXN;\\n var max_lt := 0;\\n var max_rt := 0;\\n\\n while (max_lt == 0 || max_rt == 0)\\n {\\n if(n.toString().indexOf(\\\"0\\\") == -1)\\n {\\n if ((max_lt == 0) && (n.isLeftTruncatable()))\\n {\\n max_lt := n\\n };\\n\\n if ((max_rt == 0) && (n.isRightTruncatable()))\\n {\\n max_rt := n\\n }\\n };\\n\\n n := n - 1\\n };\\n\\n console.printLine(\\\"Largest truncable left is \\\",max_lt);\\n console.printLine(\\\"Largest truncable right is \\\",max_rt);\\n\\n console.readChar()\\n}\\n\",\n \"language\": \"Elena\"\n },\n {\n \"code\": \"defmodule Prime do\\n defp left_truncatable?(n, prime) do\\n func = fn i when i<=9 -> 0\\n i -> to_string(i) |> String.slice(1..-1) |> String.to_integer end\\n truncatable?(n, prime, func)\\n end\\n\\n defp right_truncatable?(n, prime) do\\n truncatable?(n, prime, fn i -> div(i, 10) end)\\n end\\n\\n defp truncatable?(n, prime, trunc_func) do\\n if to_string(n) |> String.match?(~r/0/),\\n do: false,\\n else: trunc_loop(trunc_func.(n), prime, trunc_func)\\n end\\n\\n defp trunc_loop(0, _prime, _trunc_func), do: true\\n defp trunc_loop(n, prime, trunc_func) do\\n if elem(prime,n), do: trunc_loop(trunc_func.(n), prime, trunc_func), else: false\\n end\\n\\n def eratosthenes(limit) do # descending order\\n Enum.to_list(2..limit) |> sieve(:math.sqrt(limit), [])\\n end\\n\\n defp sieve([h|_]=list, max, sieved) when h>max, do: Enum.reverse(list, sieved)\\n defp sieve([h | t], max, sieved) do\\n list = for x <- t, rem(x,h)>0, do: x\\n sieve(list, max, [h | sieved])\\n end\\n\\n defp prime_table(_, [], list), do: [false, false | list]\\n defp prime_table(n, [n|t], list), do: prime_table(n-1, t, [true|list])\\n defp prime_table(n, prime, list), do: prime_table(n-1, prime, [false|list])\\n\\n def task(limit \\\\\\\\ 1000000) do\\n prime = eratosthenes(limit)\\n prime_tuple = prime_table(limit, prime, []) |> List.to_tuple\\n left = Enum.find(prime, fn n -> left_truncatable?(n, prime_tuple) end)\\n IO.puts \\\"Largest left-truncatable prime : #{left}\\\"\\n right = Enum.find(prime, fn n -> right_truncatable?(n, prime_tuple) end)\\n IO.puts \\\"Largest right-truncatable prime: #{right}\\\"\\n end\\nend\\n\\nPrime.task\\n\",\n \"language\": \"Elixir\"\n },\n {\n \"code\": \"USING: formatting fry grouping.extras kernel literals math\\nmath.parser math.primes sequences ;\\nIN: rosetta-code.truncatable-primes\\n\\nCONSTANT: primes $[ 1,000,000 primes-upto reverse ]\\n\\n: number>digits ( n -- B{} ) number>string string>digits ;\\n\\n: no-zeros? ( seq -- ? ) [ zero? not ] all? ;\\n\\n: all-prime? ( seq -- ? ) [ prime? ] all? ;\\n\\n: truncate ( seq quot -- seq' ) call( seq -- seq' )\\n [ 10 digits>integer ] map ;\\n\\n: truncate-right ( seq -- seq' ) [ head-clump ] truncate ;\\n\\n: truncate-left ( seq -- seq' ) [ tail-clump ] truncate ;\\n\\n: truncatable-prime? ( n quot -- ? ) [ number>digits ] dip\\n '[ @ all-prime? ] [ no-zeros? ] bi and ; inline\\n\\n: right-truncatable-prime? ( n -- ? ) [ truncate-right ]\\n truncatable-prime? ;\\n\\n: left-truncatable-prime? ( n -- ? ) [ truncate-left ]\\n truncatable-prime? ;\\n\\n: find-truncatable-primes ( -- ltp rtp )\\n primes [ [ left-truncatable-prime? ] find nip ]\\n [ [ right-truncatable-prime? ] find nip ] bi ;\\n\\n: main ( -- ) find-truncatable-primes\\n \\\"Left: %d\\\\nRight: %d\\\\n\\\" printf ;\\n\\nMAIN: main\\n\",\n \"language\": \"Factor\"\n },\n {\n \"code\": \": prime? ( n -- ? ) here + c@ 0= ;\\n: notprime! ( n -- ) here + 1 swap c! ;\\n\\n: sieve ( n -- )\\n here over erase\\n 0 notprime!\\n 1 notprime!\\n 2\\n begin\\n 2dup dup * >\\n while\\n dup prime? if\\n 2dup dup * do\\n i notprime!\\n dup +loop\\n then\\n 1+\\n repeat\\n 2drop ;\\n\\n: left_truncatable_prime? ( n -- flag )\\n dup prime? invert if\\n drop false exit\\n then\\n dup >r\\n 10\\n begin\\n 2dup >\\n while\\n 2dup mod\\n dup r> = if\\n 2drop drop false exit\\n then\\n dup prime? invert if\\n 2drop drop false exit\\n then\\n >r\\n 10 *\\n repeat\\n 2drop rdrop true ;\\n\\n: right_truncatable_prime? ( n -- flag )\\n dup prime? invert if\\n drop false exit\\n then\\n begin\\n 10 / dup 0 >\\n while\\n dup prime? invert if\\n drop false exit\\n then\\n repeat\\n drop true ;\\n\\n: max_left_truncatable_prime ( n -- )\\n begin\\n dup 0 >\\n while\\n dup left_truncatable_prime? if . cr exit then\\n 1-\\n repeat drop ;\\n\\n: max_right_truncatable_prime ( n -- )\\n begin\\n dup 0 >\\n while\\n dup right_truncatable_prime? if . cr exit then\\n 1-\\n repeat drop ;\\n\\n1000000 constant limit\\n\\nlimit 1+ sieve\\n\\n.\\\" Largest left truncatable prime: \\\"\\nlimit max_left_truncatable_prime\\n\\n.\\\" Largest right truncatable prime: \\\"\\nlimit max_right_truncatable_prime\\n\\nbye\\n\",\n \"language\": \"Forth\"\n },\n {\n \"code\": \"module primes_mod\\n implicit none\\n\\n logical, allocatable :: primes(:)\\n\\ncontains\\n\\nsubroutine Genprimes(parr)\\n logical, intent(in out) :: parr(:)\\n integer :: i\\n! Prime sieve\\n parr = .true.\\n parr (1) = .false.\\n parr (4 : size(parr) : 2) = .false.\\n do i = 3, int (sqrt (real (size(parr)))), 2\\n if (parr(i)) parr(i * i : size(parr) : i) = .false.\\n end do\\n\\nend subroutine\\n\\nfunction is_rtp(candidate)\\n logical :: is_rtp\\n integer, intent(in) :: candidate\\n integer :: n\\n\\n is_rtp = .true.\\n n = candidate / 10\\n do while(n > 0)\\n if(.not. primes(n)) then\\n is_rtp = .false.\\n return\\n end if\\n n = n / 10\\n end do\\n\\nend function\\n\\nfunction is_ltp(candidate)\\n logical :: is_ltp\\n integer, intent(in) :: candidate\\n integer :: i, n\\n character(10) :: nstr\\n\\n write(nstr, \\\"(i10)\\\") candidate\\n is_ltp = .true.\\n do i = len_trim(nstr)-1, 1, -1\\n n = mod(candidate, 10**i)\\n if(.not. primes(n)) then\\n is_ltp = .false.\\n return\\n end if\\n end do\\nend function\\n\\nend module primes_mod\\n\\nprogram Truncatable_Primes\\n use primes_mod\\n implicit none\\n\\n integer, parameter :: limit = 999999\\n integer :: i\\n character(10) :: nstr\\n\\n! Generate an array of prime flags up to limit of search\\n allocate(primes(limit))\\n call Genprimes(primes)\\n\\n! Find left truncatable prime\\n do i = limit, 1, -1\\n write(nstr, \\\"(i10)\\\") i\\n if(index(trim(nstr), \\\"0\\\") /= 0) cycle ! check for 0 in number\\n if(is_ltp(i)) then\\n write(*, \\\"(a, i0)\\\") \\\"Largest left truncatable prime below 1000000 is \\\", i\\n exit\\n end if\\n end do\\n\\n! Find right truncatable prime\\n do i = limit, 1, -1\\n write(nstr, \\\"(i10)\\\") i\\n if(index(trim(nstr), \\\"0\\\") /= 0) cycle ! check for 0 in number\\n if(is_rtp(i)) then\\n write(*, \\\"(a, i0)\\\") \\\"Largest right truncatable prime below 1000000 is \\\", i\\n exit\\n end if\\n end do\\nend program\\n\",\n \"language\": \"Fortran\"\n },\n {\n \"code\": \"' FB 1.05.0 Win64\\n\\nFunction isPrime(n As Integer) As Boolean\\n If n Mod 2 = 0 Then Return n = 2\\n If n Mod 3 = 0 Then Return n = 3\\n Dim d As Integer = 5\\n While d * d <= n\\n If n Mod d = 0 Then Return False\\n d += 2\\n If n Mod d = 0 Then Return False\\n d += 4\\n Wend\\n Return True\\nEnd Function\\n\\nDim As UInteger i, j, p, pow, lMax = 2, rMax = 2\\nDim s As String\\n\\n' largest left truncatable prime less than 1000000\\n' It can't end with 1, 4, 6, 8 or 9 as these numbers are not prime\\n' Nor can it end in 2 if it has more than one digit as such a number would divide by 2\\nFor i = 3 To 999997 Step 2\\n s = Str(i)\\n If Instr(s, \\\"0\\\") > 1 Then Continue For '' cannot contain 0\\n j = s[Len(s) - 1] - 48\\n If j = 1 OrElse j = 9 Then Continue For\\n p = i\\n pow = 10 ^ (Len(s) - 1)\\n While pow > 1\\n If Not isPrime(p) Then Continue For\\n p Mod= pow\\n pow \\\\= 10\\n Wend\\n lMax = i\\nNext\\n\\n' largest right truncatable prime less than 1000000\\n' It can't begin with 1, 4, 6, 8 or 9 as these numbers are not prime\\nFor i = 3 To 799999 Step 2\\n s = Str(i)\\n If Instr(s, \\\"0\\\") > 1 Then Continue For '' cannot contain 0\\n j = s[0] - 48\\n If j = 1 OrElse j = 4 OrElse j = 6 Then Continue For\\n p = i\\n While p > 0\\n If Not isPrime(p) Then Continue For\\n p \\\\= 10\\n Wend\\n rMax = i\\nNext\\n\\nPrint \\\"Largest left truncatable prime : \\\"; lMax\\nPrint \\\"Largest right truncatable prime : \\\"; rMax\\nPrint\\nPrint \\\"Press any key to quit\\\"\\nSleep\\n\",\n \"language\": \"FreeBASIC\"\n },\n {\n \"code\": \"' version 10-12-2016\\n' compile with: fbc -s console\\n\\nDim Shared As Byte isPrime()\\n\\nSub sieve(m As UInteger)\\n\\n Dim As Integer i, j\\n ReDim isPrime(m)\\n\\n For i = 4 To m Step 2\\n isPrime(i) = 1\\n Next\\n\\n For i = 3 To Sqr(m) Step 2\\n If isPrime(i) = 0 Then\\n For j = i * i To m Step i * 2\\n isPrime(j) = 1\\n Next\\n End If\\n Next\\n\\nEnd Sub\\n\\n' ------=< MAIN >=------\\n\\n#Define max 1000000 'upto 2^30 max for 32bit OS\\n\\nDim As UInteger a(), lt_prime(5000), rt_prime(100)\\nDim As UInteger i, j, j1, p1, p2, left_max, right_max\\n\\nsieve(max)\\n\\n' left truncatable primes\\n' if odd and ends with 3 or 7, never ends 1 or 9 (no prime\\n' never ends on a 2 or 5 and starts with 1 to 9\\nlt_prime(1) = 3 : lt_prime(2) = 7\\np1 = 1 : p2 = 2\\n\\nDo\\n For i = 1 To 9\\n j = Val( Str(i) + Str(lt_prime(p1)) )\\n If j > max Then Exit Do\\n If isPrime(j) = 0 Then ' if prime then add to the list\\n p2 += 1\\n lt_prime(p2) = j\\n If Left_max < j Then left_max = j\\n End If\\n Next\\n p1 += 1\\nLoop Until p1 > p2 ' no more numbers to process\\n\\n' right truncatable prime\\n' start with 2, 3, 5 or 7 and end with 1, 3, 7 or 9\\nrt_prime(1) = 2 : rt_prime(2) = 3 : rt_prime(3) = 5 : rt_prime(4) = 7\\np1 = 1 : p2 = 4\\nDim As UInteger end_num(1 To 4) => {1, 3, 7, 9}\\n\\nDo\\n j1 = rt_prime(p1) * 10\\n If j1 > max Then Exit Do\\n For i = 1 To 4\\n j = j1 + End_num(i)\\n If isprime(j) = 0 Then ' if prime then add to the list\\n p2 += 1\\n rt_prime(p2) = j\\n ' If right_max < j Then right_max = j\\n End If\\n Next\\n p1 += 1\\nLoop Until p1 > p2 ' no more numbers to process\\n' the last one added is the biggest\\nright_max = rt_prime(p2)\\n\\nPrint\\nPrint \\\"The biggest left truncatable prime below\\\"; max; \\\" is \\\"; left_max\\nPrint \\\"The biggest right truncatable prime below\\\"; max; \\\" is \\\"; right_max\\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 sieve(1e6)\\n if !search(6, 1e6, \\\"left\\\", func(n, pot int) int { return n % pot }) {\\n panic(\\\"997?\\\")\\n }\\n if !search(6, 1e6, \\\"right\\\", func(n, _ int) int { return n / 10 }) {\\n panic(\\\"7393?\\\")\\n }\\n}\\n\\nvar c []bool\\n\\nfunc sieve(ss int) {\\n c = make([]bool, ss)\\n c[1] = true\\n for p := 2; ; {\\n p2 := p * p\\n if p2 >= ss {\\n break\\n }\\n for i := p2; i < ss; i += p {\\n c[i] = true\\n }\\n for {\\n p++\\n if !c[p] {\\n break\\n }\\n }\\n }\\n}\\n\\nfunc search(digits, pot int, s string, truncFunc func(n, pot int) int) bool {\\n n := pot - 1\\n pot /= 10\\nsmaller:\\n for ; n >= pot; n -= 2 {\\n for tn, tp := n, pot; tp > 0; tp /= 10 {\\n if tn < tp || c[tn] {\\n continue smaller\\n }\\n tn = truncFunc(tn, tp)\\n }\\n fmt.Println(\\\"max\\\", s, \\\"truncatable:\\\", n)\\n return true\\n }\\n if digits > 1 {\\n return search(digits-1, pot, s, truncFunc)\\n }\\n return false\\n}\\n\",\n \"language\": \"Go\"\n },\n {\n \"code\": \"import Data.Numbers.Primes(primes, isPrime)\\nimport Data.List\\nimport Control.Arrow\\n\\nprimes1e6 = reverse. filter (notElem '0'. show) $ takeWhile(<=1000000) primes\\n\\nrightT, leftT :: Int -> Bool\\nrightT = all isPrime. takeWhile(>0). drop 1. iterate (`div`10)\\nleftT x = all isPrime. takeWhile(<x).map (x`mod`) $ iterate (*10) 10\\n\\nmain = do\\n let (ltp, rtp) = (head. filter leftT &&& head. filter rightT) primes1e6\\n putStrLn $ \\\"Left truncatable \\\" ++ show ltp\\n putStrLn $ \\\"Right truncatable \\\" ++ show rtp\\n\",\n \"language\": \"Haskell\"\n },\n {\n \"code\": \"*Main> main\\nLeft truncatable 998443\\nRight truncatable 739399\\n\",\n \"language\": \"Haskell\"\n },\n {\n \"code\": \"digits = [1..9] :: [Integer]\\nsmallPrimes = filter isPrime digits\\npow10 = iterate (*10) 1\\nmul10 = (pow10!!). length. show\\nrighT = (+) . (10 *)\\nlefT = liftM2 (.) (+) ((*) . mul10)\\n\\nprimesTruncatable f = iterate (concatMap (filter isPrime.flip map digits. f)) smallPrimes\\n\",\n \"language\": \"Haskell\"\n },\n {\n \"code\": \"*Main> maximum $ primesTruncatable righT !! 5\\n739399\\n\\n*Main> maximum $ primesTruncatable lefT !! 5\\n998443\\n\",\n \"language\": \"Haskell\"\n },\n {\n \"code\": \"procedure main(arglist)\\n N := 0 < integer(\\\\arglist[1]) | 1000000 # primes to generator 1 to ... (1M or 1st arglist)\\n D := (0 < integer(\\\\arglist[2]) | 10) / 2 # primes to display (10 or 2nd arglist)\\n P := sieve(N) # from sieve task (modified)\\n write(\\\"There are \\\",*P,\\\" prime numbers in the range 1 to \\\",N)\\n if *P <= 2*D then\\n every writes( \\\"Primes: \\\"|!sort(P)||\\\" \\\"|\\\"\\\\n\\\" )\\n else\\n every writes( \\\"Primes: \\\"|(L := sort(P))[1 to D]||\\\" \\\"|\\\"... \\\"|L[*L-D+1 to *L]||\\\" \\\"|\\\"\\\\n\\\" )\\n largesttruncateable(P)\\nend\\n\\nprocedure largesttruncateable(P) #: find the largest left and right trucatable numbers in P\\nlocal ltp,rtp\\n\\n every x := sort(P)[*P to 1 by -1] do # largest to smallest\\n if not find('0',x) then {\\n /ltp := islefttrunc(P,x)\\n /rtp := isrighttrunc(P,x)\\n if \\\\ltp & \\\\rtp then break # until both found\\n }\\n write(\\\"Largest left truncatable prime = \\\", ltp)\\n write(\\\"Largest right truncatable prime = \\\", rtp)\\n return\\nend\\n\\nprocedure isrighttrunc(P,x) #: return integer x if x and all right truncations of x are in P or fails\\nif x = 0 | (member(P,x) & isrighttrunc(P,x / 10)) then return x\\nend\\n\\nprocedure islefttrunc(P,x) #: return integer x if x and all left truncations of x are in P or fails\\nif *x = 0 | ( (x := integer(x)) & member(P,x) & islefttrunc(P,x[2:0]) ) then return x\\nend\\n\",\n \"language\": \"Icon\"\n },\n {\n \"code\": \"selPrime=: #~ 1&p:\\nseed=: selPrime digits=: 1+i.9\\nstep=: selPrime@,@:(,&.\\\":/&>)@{@;\\n\",\n \"language\": \"J\"\n },\n {\n \"code\": \" >./ digits&step^:5 seed NB. left truncatable\\n998443\\n >./ step&digits^:5 seed NB. right truncatable\\n739399\\n\",\n \"language\": \"J\"\n },\n {\n \"code\": \"import java.util.BitSet;\\n\\npublic class Main {\\n\\n\\tpublic static void main(String[] args){\\n\\n\\t\\tfinal int MAX = 1000000;\\n\\n\\t\\t//Sieve of Eratosthenes (using BitSet only for odd numbers)\\n\\t\\tBitSet primeList = new BitSet(MAX>>1);\\n\\t\\tprimeList.set(0,primeList.size(),true);\\n\\n\\t\\tint sqroot = (int) Math.sqrt(MAX);\\n\\t\\tprimeList.clear(0);\\n\\t\\tfor(int num = 3; num <= sqroot; num+=2)\\n\\t\\t{\\n\\t\\t\\tif( primeList.get(num >> 1) )\\n\\t\\t\\t{\\n\\t\\t\\t\\tint inc = num << 1;\\n\\t\\t\\t\\tfor(int factor = num * num; factor < MAX; factor += inc)\\n\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\t//if( ((factor) & 1) == 1)\\n\\t\\t\\t\\t\\t//{\\n\\t\\t\\t\\t\\tprimeList.clear(factor >> 1);\\n\\t\\t\\t\\t\\t//}\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\t//Sieve ends...\\n\\n\\t\\t//Find Largest Truncatable Prime. (so we start from 1000000 - 1\\n\\t\\tint rightTrunc = -1, leftTrunc = -1;\\n\\t\\tfor(int prime = (MAX - 1) | 1; prime >= 3; prime -= 2)\\n\\t\\t{\\n\\t\\t\\tif(primeList.get(prime>>1))\\n\\t\\t\\t{\\n\\t\\t\\t\\t//Already found Right Truncatable Prime?\\n\\t\\t\\t\\tif(rightTrunc == -1)\\n\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\tint right = prime;\\n\\t\\t\\t\\t\\twhile(right > 0 && right % 2 != 0 && primeList.get(right >> 1)) right /= 10;\\n\\t\\t\\t\\t\\tif(right == 0) rightTrunc = prime;\\n\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\t//Already found Left Truncatable Prime?\\n\\t\\t\\t\\tif(leftTrunc == -1 )\\n\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\t//Left Truncation\\n\\t\\t\\t\\t\\tString left = Integer.toString(prime);\\n\\t\\t\\t\\t\\tif(!left.contains(\\\"0\\\"))\\n\\t\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\t\\twhile( left.length() > 0 ){\\n\\t\\t\\t\\t\\t\\t\\tint iLeft = Integer.parseInt(left);\\n\\t\\t\\t\\t\\t\\t\\tif(!primeList.get( iLeft >> 1)) break;\\n\\t\\t\\t\\t\\t\\t\\tleft = left.substring(1);\\n\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\tif(left.length() == 0) leftTrunc = prime;\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tif(leftTrunc != -1 && rightTrunc != -1) //Found both? then Stop loop\\n\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\tbreak;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tSystem.out.println(\\\"Left Truncatable : \\\" + leftTrunc);\\n\\t\\tSystem.out.println(\\\"Right Truncatable : \\\" + rightTrunc);\\n\\t}\\n}\\n\",\n \"language\": \"Java\"\n },\n {\n \"code\": \"def is_left_truncatable_prime:\\n def removeleft: recurse(if length <= 1 then empty else .[1:] end);\\n tostring\\n | index(\\\"0\\\") == null and\\n all(removeleft|tonumber; is_prime);\\n\\ndef is_right_truncatable_prime:\\n def removeright: recurse(if length <= 1 then empty else .[:-1] end);\\n tostring\\n | index(\\\"0\\\") == null and\\n all(removeright|tonumber; is_prime);\\n\\nfirst( range(999999; 1; -2) | select(is_left_truncatable_prime)),\\n\\nfirst( range(999999; 1; -2) | select(is_right_truncatable_prime))\\n\",\n \"language\": \"Jq\"\n },\n {\n \"code\": \"function isltruncprime{T<:Integer}(n::T, base::T=10)\\n isprime(n) || return false\\n p = n\\n f = prevpow(base, p)\\n while 1 < f\\n (d, p) = divrem(p, f)\\n isprime(p) || return false\\n d != 0 || return false\\n f = div(f, base)\\n end\\n return true\\nend\\n\\nfunction isrtruncprime{T<:Integer}(n::T, base::T=10)\\n isprime(n) || return false\\n p = n\\n while base < p\\n p = div(p, base)\\n isprime(p) || return false\\n end\\n return true\\nend\\n\\nhi = 10^6\\n\\nfor i in reverse(primes(hi))\\n isltruncprime(i) || continue\\n println(\\\"The largest left truncatable prime ≤ \\\", hi, \\\" is \\\", i, \\\".\\\")\\n break\\nend\\n\\nfor i in reverse(primes(hi))\\n isrtruncprime(i) || continue\\n println(\\\"The largest right truncatable prime ≤ \\\", hi, \\\" is \\\", i, \\\".\\\")\\n break\\nend\\n\",\n \"language\": \"Julia\"\n },\n {\n \"code\": \"// version 1.0.5-2\\n\\nfun isPrime(n: Int) : Boolean {\\n if (n < 2) return false\\n if (n % 2 == 0) return n == 2\\n if (n % 3 == 0) return n == 3\\n var d : Int = 5\\n while (d * d <= n) {\\n if (n % d == 0) return false\\n d += 2\\n if (n % d == 0) return false\\n d += 4\\n }\\n return true\\n}\\n\\nfun main(args: Array<String>) {\\n var j: Char\\n var p: Int\\n var pow: Int\\n var lMax: Int = 2\\n var rMax: Int = 2\\n var s: String\\n\\n // calculate maximum left truncatable prime less than 1 million\\n loop@ for( i in 3..999997 step 2) {\\n s = i.toString()\\n if ('0' in s) continue\\n j = s[s.length - 1]\\n if (j == '1' || j == '9') continue\\n p = i\\n pow = 1\\n for (k in 1..s.length - 1) pow *= 10\\n while(pow > 1) {\\n if (!isPrime(p)) continue@loop\\n p %= pow\\n pow /= 10\\n }\\n lMax = i\\n }\\n\\n // calculate maximum right truncatable prime less than 1 million\\n loop@ for( i in 3..799999 step 2) {\\n s = i.toString()\\n if ('0' in s) continue\\n j = s[0]\\n if (j == '1' || j == '4' || j == '6') continue\\n p = i\\n while(p > 0) {\\n if (!isPrime(p)) continue@loop\\n p /= 10\\n }\\n rMax = i\\n }\\n\\n println(\\\"Largest left truncatable prime : \\\" + lMax.toString())\\n println(\\\"Largest right truncatable prime : \\\" + rMax.toString())\\n}\\n\",\n \"language\": \"Kotlin\"\n },\n {\n \"code\": \"max_number = 1000000\\n\\nnumbers = {}\\nfor i = 2, max_number do\\n numbers[i] = i;\\nend\\n\\nfor i = 2, max_number do\\n for j = i+1, max_number do\\n if numbers[j] ~= 0 and j % i == 0 then numbers[j] = 0 end\\n end\\nend\\n\\nmax_prime_left, max_prime_right = 2, 2\\nfor i = 2, max_number do\\n if numbers[i] ~= 0 then\\n local is_prime = true\\n\\n local l = math.floor( i / 10 )\\n while l > 1 do\\n if numbers[l] == 0 then\\n is_prime = false\\n break\\n end\\n l = math.floor( l / 10 )\\n end\\n if is_prime then\\n max_prime_left = i\\n end\\n\\n is_prime = true\\n local n = 10;\\n while math.floor( i % 10 ) ~= 0 and n < max_number do\\n if numbers[ math.floor( i % 10 ) ] ~= 0 then\\n is_prime = false\\n break\\n end\\n n = n * 10\\n end\\n if is_prime then\\n max_prime_right = i\\n end\\n end\\nend\\n\\nprint( \\\"max_prime_left = \\\", max_prime_left )\\nprint( \\\"max_prime_right = \\\", max_prime_right )\\n\",\n \"language\": \"Lua\"\n },\n {\n \"code\": \"MaxTruncatablePrime := proc({left::truefalse:=FAIL, right::truefalse:=FAIL}, $)\\nlocal i, j, c, p, b, n, sdprimes, dir;\\nlocal tprimes := table();\\n if left = true and right = true then\\n error \\\"invalid input\\\";\\n elif right = true then\\n dir := \\\"right\\\";\\n else\\n dir := \\\"left\\\";\\n end if;\\n b := 10;\\n n := 6;\\n sdprimes := select(isprime, [seq(1..b-1)]);\\n for p in sdprimes do\\n if assigned(tprimes[p]) then\\n next;\\n end if;\\n i := ilog[b](p)+1;\\n j := 1;\\n while p < b^n do\\n if dir = \\\"left\\\" then\\n c := j*b^i + p;\\n else\\n c := p*b + j;\\n end if;\\n if j >= b or c > b^n then # we have tried all 1 digit extensions of p, add p to tprimes and move back 1 digit\\n tprimes[p] := p;\\n if i = 1 then # if we are at the first digit, go to the next 1 digit prime\\n break;\\n end if;\\n i := i - 1;\\n j := 1;\\n if dir = \\\"left\\\" then\\n p := p - iquo(p, b^i)*b^i;\\n else\\n p := iquo(p, b);\\n end if;\\n elif assigned(tprimes[c]) then\\n j := j + 1;\\n elif isprime(c) then\\n p := c;\\n i := i + 1;\\n j := 1;\\n else\\n j := j+1;\\n end if;\\n end do;\\n end do;\\n return max(indices(tprimes, 'nolist'));\\nend proc;\\n\",\n \"language\": \"Maple\"\n },\n {\n \"code\": \"LeftTruncatablePrimeQ[n_] := Times @@ IntegerDigits[n] > 0 &&\\n And @@ PrimeQ /@ ToExpression /@ StringJoin /@\\n Rest[Most[NestList[Rest, #, Length[#]] &[Characters[ToString[n]]]]]\\nRightTruncatablePrimeQ[n_] := Times @@ IntegerDigits[n] > 0 &&\\n And @@ PrimeQ /@ ToExpression /@ StringJoin /@\\n Rest[Most[NestList[Most, #, Length[#]] &[Characters[ToString[n]]]]]\\n\",\n \"language\": \"Mathematica\"\n },\n {\n \"code\": \"function largestTruncatablePrimes(boundary)\\n\\n %Helper function for checking if a prime is left of right truncatable\\n function [leftTruncatable,rightTruncatable] = isTruncatable(prime,checkLeftTruncatable,checkRightTruncatable)\\n\\n numDigits = ceil(log10(prime)); %calculate the number of digits in the prime less one\\n powersOfTen = 10.^(0:numDigits); %cache the needed powers of ten\\n\\n leftTruncated = mod(prime,powersOfTen); %generate a list of numbers by repeatedly left truncating the prime\\n\\n %leading zeros will cause duplicate entries thus it is possible to\\n %detect leading zeros if we rotate the list to the left or right\\n %and check for any equivalences with the original list\\n hasLeadingZeros = any( circshift(leftTruncated,[0 1]) == leftTruncated );\\n\\n if( hasLeadingZeros || not(checkLeftTruncatable) )\\n leftTruncatable = false;\\n else\\n %check if all of the left truncated numbers are prime\\n leftTruncatable = all(isprime(leftTruncated(2:end)));\\n end\\n\\n if( checkRightTruncatable )\\n rightTruncated = (prime - leftTruncated) ./ powersOfTen; %generate a list of right truncated numbers\\n rightTruncatable = all(isprime(rightTruncated(1:end-1))); %check if all the right truncated numbers are prime\\n else\\n rightTruncatable = false;\\n end\\n\\n end %isTruncatable()\\n\\n nums = primes(boundary); %generate all primes <= boundary\\n\\n %Flags that indicate if the largest left or right truncatable prime has not\\n %been found\\n leftTruncateNotFound = true;\\n rightTruncateNotFound = true;\\n\\n for prime = nums(end:-1:1) %Search through primes in reverse order\\n\\n %Get if the prime is left and/or right truncatable, ignoring\\n %checking for right truncatable if it has already been found\\n [leftTruncatable,rightTruncatable] = isTruncatable(prime,leftTruncateNotFound,rightTruncateNotFound);\\n\\n if( leftTruncateNotFound && leftTruncatable ) %print out largest left truncatable prime\\n display([num2str(prime) ' is the largest left truncatable prime <= ' num2str(boundary) '.']);\\n leftTruncateNotFound = false;\\n end\\n\\n if( rightTruncateNotFound && rightTruncatable ) %print out largest right truncatable prime\\n display([num2str(prime) ' is the largest right truncatable prime <= ' num2str(boundary) '.']);\\n rightTruncateNotFound = false;\\n end\\n\\n %Terminate loop when the largest left and right truncatable primes have\\n %been found\\n if( not(leftTruncateNotFound || rightTruncateNotFound) )\\n break;\\n end\\n end\\nend\\n\",\n \"language\": \"MATLAB\"\n },\n {\n \"code\": \">> largestTruncatablePrimes(1e6)\\n998443 is the largest left truncatable prime <= 1000000.\\n739399 is the largest right truncatable prime <= 1000000.\\n\",\n \"language\": \"MATLAB\"\n },\n {\n \"code\": \"import sets, strutils, algorithm\\n\\nproc primes(n: int64): seq[int64] =\\n var multiples: HashSet[int64]\\n for i in 2..n:\\n if i notin multiples:\\n result.add i\\n for j in countup(i*i, n, i.int):\\n multiples.incl j\\n\\nproc truncatablePrime(n: int64): tuple[left, right: int64] =\\n var\\n primelist: seq[string]\\n for x in primes(n):\\n primelist.add($x)\\n reverse primelist\\n var primeset = primelist.toHashSet\\n for n in primelist:\\n var alltruncs: HashSet[string]\\n for i in 0..n.high:\\n alltruncs.incl n[i..n.high]\\n if alltruncs <= primeset:\\n result.left = parseInt(n)\\n break\\n for n in primelist:\\n var alltruncs: HashSet[string]\\n for i in 0..n.high:\\n alltruncs.incl n[0..i]\\n if alltruncs <= primeset:\\n result.right = parseInt(n)\\n break\\n\\necho truncatablePrime(1000000i64)\\n\",\n \"language\": \"Nim\"\n },\n {\n \"code\": \"-- find largest left- & right-truncatable primes < 1 million.\\n-- an initial set of primes (not, at this time, we leave out 2 because\\n-- we'll automatically skip the even numbers. No point in doing a needless\\n-- test each time through\\nprimes = .array~of(3, 5, 7, 11)\\n\\n-- check all of the odd numbers up to 1,000,000\\nloop j = 13 by 2 to 1000000\\n loop i = 1 to primes~size\\n prime = primes[i]\\n -- found an even prime divisor\\n if j // prime == 0 then iterate j\\n -- only check up to the square root\\n if prime*prime > j then leave\\n end\\n -- we only get here if we don't find a divisor\\n primes~append(j)\\nend\\n\\n-- get a set of the primes that we can test more efficiently\\nprimeSet = .set~of(2)\\nprimeSet~putall(primes)\\n\\n\\nsay 'The last prime is' primes[primes~last] \\\"(\\\"primeSet~items 'primes under one million).'\\nsay copies('-',66)\\n\\nlastLeft = 0\\n\\n-- we're going to use the array version to do these in order. We're still\\n-- missing \\\"2\\\", but that's not going to be the largest\\nloop prime over primes\\n\\n -- values containing 0 can never work\\n if prime~pos(0) \\\\= 0 then iterate\\n -- now start the truncations, checking against our set of\\n -- known primes\\n loop i = 1 for prime~length - 1\\n subprime = prime~right(i)\\n -- not in our known set, this can't work\\n if \\\\primeset~hasIndex(subprime) then iterate prime\\n end\\n -- this, by definition, with be the largest left-trunc prime\\n lastLeft = prime\\nend\\n-- now look for right-trunc primes\\nlastRight = 0\\nloop prime over primes\\n\\n -- values containing 0 can never work\\n if prime~pos(0) \\\\= 0 then iterate\\n -- now start the truncations, checking against our set of\\n -- known primes\\n loop i = 1 for prime~length - 1\\n subprime = prime~left(i)\\n -- not in our known set, this can't work\\n if \\\\primeset~hasIndex(subprime) then iterate prime\\n end\\n -- this, by definition, with be the largest left-trunc prime\\n lastRight = prime\\nend\\n\\nsay 'The largest left-truncatable prime is' lastLeft '(under one million).'\\nsay 'The largest right-truncatable prime is' lastRight '(under one million).'\\n\",\n \"language\": \"OoRexx\"\n },\n {\n \"code\": \"FUNCTION isPrime RETURNS LOGICAL (\\n i_i AS INT\\n):\\n\\n DEF VAR ii AS INT.\\n\\n DO ii = 2 TO SQRT( i_i ):\\n\\n IF i_i MODULO ii = 0 THEN\\n RETURN FALSE.\\n\\n END.\\n\\n RETURN TRUE AND i_i > 1.\\n\\nEND FUNCTION. /* isPrime */\\n\\nFUNCTION isLeftTruncatablePrime RETURNS LOGICAL (\\n i_i AS INT\\n):\\n\\n DEF VAR ii AS INT.\\n DEF VAR cc AS CHAR.\\n DEF VAR lresult AS LOGICAL INITIAL TRUE.\\n\\n cc = STRING( i_i ).\\n\\n DO WHILE cc > \\\"\\\":\\n lresult = lresult AND isPrime( INTEGER( cc ) ).\\n cc = SUBSTRING( cc, 2 ).\\n END.\\n\\n RETURN lresult.\\n\\nEND FUNCTION. /* isLeftTruncatablePrime */\\n\\nFUNCTION isRightTruncatablePrime RETURNS LOGICAL (\\n i_i AS INT\\n):\\n\\n DEF VAR ii AS INT.\\n DEF VAR cc AS CHAR.\\n DEF VAR lresult AS LOGICAL INITIAL TRUE.\\n\\n cc = STRING( i_i ).\\n\\n DO WHILE cc > \\\"\\\":\\n lresult = lresult AND isPrime( INTEGER( cc ) ).\\n cc = SUBSTRING( cc, 1, LENGTH( cc ) - 1 ).\\n END.\\n\\n RETURN lresult.\\n\\nEND FUNCTION. /* isRightTruncatablePrime */\\n\\nFUNCTION getHighestTruncatablePrimes RETURNS CHARACTER (\\n i_imax AS INTEGER\\n):\\n\\n DEF VAR ii AS INT.\\n DEF VAR ileft AS INT.\\n DEF VAR iright AS INT.\\n\\n DO ii = i_imax TO 1 BY -1 WHILE ileft = 0 OR iright = 0:\\n\\n IF INDEX( STRING( ii ), \\\"0\\\" ) = 0 THEN DO:\\n IF ileft = 0 AND isLeftTruncatablePrime( ii ) THEN\\n ileft = ii.\\n IF iright = 0 AND isRightTruncatablePrime( ii ) THEN\\n iright = ii.\\n END.\\n\\n END.\\n\\n RETURN SUBSTITUTE(\\\"Left: &1~nRight: &2\\\", ileft, iright ).\\n\\nEND FUNCTION. /* getHighestTruncatablePrimes */\\n\\nMESSAGE\\n getHighestTruncatablePrimes( 1000000 )\\nVIEW-AS ALERT-BOX.\\n\",\n \"language\": \"OpenEdge-Progress\"\n },\n {\n \"code\": \"left(n)={\\n\\tmy(v=[2,3,5,7],u,t=1,out=0);\\n\\tfor(i=1,n,\\n\\t\\tt*=10;\\n\\t\\tu=[];\\n\\t\\tfor(j=1,#v,\\n\\t\\t\\tforstep(a=t,t*9,t,\\n\\t\\t\\t\\tif(isprime(a+v[j]),u=concat(u,a+v[j]))\\n\\t\\t\\t)\\n\\t\\t);\\n\\t\\tout=v[#v];\\n\\t\\tv=vecsort(u)\\n\\t);\\n\\tout\\n};\\nright(n)={\\n\\tmy(v=[2,3,5,7],u,out=0);\\n\\tfor(i=1,n,\\n\\t\\tu=[];\\n\\t\\tfor(j=1,#v,\\n\\t\\t\\tforstep(a=1,9,[2,4],\\n\\t\\t\\t\\tif(isprime(10*v[j]+a),u=concat(u,10*v[j]+a))\\n\\t\\t\\t)\\n\\t\\t);\\n\\t\\tout=v[#v];\\n\\t\\tv=u\\n\\t);\\n\\tout\\n};\\n[left(6),right(6)]\\n\",\n \"language\": \"PARI-GP\"\n },\n {\n \"code\": \"use ntheory \\\":all\\\";\\nsub isltrunc {\\n my $n = shift;\\n return (is_prime($n) && $n !~ /0/ && ($n < 10 || isltrunc(substr($n,1))));\\n}\\nsub isrtrunc {\\n my $n = shift;\\n return (is_prime($n) && $n !~ /0/ && ($n < 10 || isrtrunc(substr($n,0,-1))));\\n}\\nfor (reverse @{primes(1e6)}) {\\n if (isltrunc($_)) { print \\\"ltrunc: $_\\\\n\\\"; last; }\\n}\\nfor (reverse @{primes(1e6)}) {\\n if (isrtrunc($_)) { print \\\"rtrunc: $_\\\\n\\\"; last; }\\n}\\n\",\n \"language\": \"Perl\"\n },\n {\n \"code\": \"use ntheory \\\":all\\\";\\n\\nmy @lprimes = my @rprimes = (2,3,5,7);\\n\\n@lprimes = sort { $a <=> $b }\\n map { my $p=$_; map { is_prime($_.$p) ? $_.$p : () } 1..9 } @lprimes\\n for 2..6;\\n\\n@rprimes = sort { $a <=> $b }\\n map { my $p=$_; map { is_prime($p.$_) ? $p.$_ : () } 1..9 } @rprimes\\n for 2..6;\\n\\nprint \\\"ltrunc: $lprimes[-1]\\\\nrtrunc: $rprimes[-1]\\\\n\\\";\\n\",\n \"language\": \"Perl\"\n },\n {\n \"code\": \"#!/usr/bin/perl\\nuse warnings;\\nuse strict;\\n\\nuse constant {\\n LEFT => 0,\\n RIGHT => 1,\\n};\\n\\n{ my @primes = (2, 3);\\n\\n sub is_prime {\\n my $n = shift;\\n return if $n < 2;\\n\\n for my $prime (@primes) {\\n last if $prime >= $n;\\n return unless $n % $prime;\\n }\\n\\n my $sqrt = sqrt $n;\\n while ($primes[-1] < $sqrt) {\\n my $new = 2 + $primes[-1];\\n $new += 2 until is_prime($new);\\n push @primes, $new;\\n return unless $n % $new;\\n }\\n\\n return 1;\\n }\\n}\\n\\n\\nsub trunc {\\n my ($n, $side) = @_;\\n substr $n, $side == LEFT ? 0 : -1, 1, q();\\n return $n;\\n}\\n\\n\\nsub is_tprime { # Absence of zeroes is tested outside the sub.\\n my ($n, $side) = @_;\\n return (is_prime($n)\\n and (1 == length $n or is_tprime(trunc($n, $side), $side)));\\n}\\n\\n\\nmy $length = 6;\\nmy @tprimes = ('9' x $length) x 2;\\nfor my $side (LEFT, RIGHT) {\\n $tprimes[$side] -= 2 until -1 == index $tprimes[$side], '0'\\n and is_tprime($tprimes[$side], $side);\\n}\\n\\nprint 'left ', join(', right ', @tprimes), \\\"\\\\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;\\\">N</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">6</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">limit</span> <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: #000000;\\\">N</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #000080;font-style:italic;\\\">-- standard sieve:</span>\\n <span style=\\\"color: #008080;\\\">enum</span> <span style=\\\"color: #000000;\\\">L</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">R</span> <span style=\\\"color: #000080;font-style:italic;\\\">-- (with primes[i] as mini bit-field)</span>\\n <span style=\\\"color: #004080;\\\">sequence</span> <span style=\\\"color: #000000;\\\">primes</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">repeat</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">L</span><span style=\\\"color: #0000FF;\\\">+</span><span style=\\\"color: #000000;\\\">R</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">limit</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #000000;\\\">primes</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;\\\">0</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;\\\">floor</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #7060A8;\\\">sqrt</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">limit</span><span style=\\\"color: #0000FF;\\\">))</span> <span style=\\\"color: #008080;\\\">do</span>\\n <span style=\\\"color: #008080;\\\">if</span> <span style=\\\"color: #000000;\\\">primes</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: #008080;\\\">for</span> <span style=\\\"color: #000000;\\\">k</span><span style=\\\"color: #0000FF;\\\">=</span><span style=\\\"color: #000000;\\\">i</span><span style=\\\"color: #0000FF;\\\">*</span><span style=\\\"color: #000000;\\\">i</span> <span style=\\\"color: #008080;\\\">to</span> <span style=\\\"color: #000000;\\\">limit</span> <span style=\\\"color: #008080;\\\">by</span> <span style=\\\"color: #000000;\\\">i</span> <span style=\\\"color: #008080;\\\">do</span>\\n <span style=\\\"color: #000000;\\\">primes</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;\\\">0</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\\n <span style=\\\"color: #000080;font-style:italic;\\\">-- propagate non-truncateables up the prime table:</span>\\n <span style=\\\"color: #008080;\\\">for</span> <span style=\\\"color: #000000;\\\">p</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: #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;\\\">p10</span> <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: #000000;\\\">p</span><span style=\\\"color: #0000FF;\\\">)</span> <span style=\\\"color: #000080;font-style:italic;\\\">-- ie 10, 100, .. 100_000</span>\\n <span style=\\\"color: #008080;\\\">for</span> <span style=\\\"color: #000000;\\\">i</span><span style=\\\"color: #0000FF;\\\">=</span><span style=\\\"color: #000000;\\\">p10</span><span style=\\\"color: #0000FF;\\\">+</span><span style=\\\"color: #000000;\\\">1</span> <span style=\\\"color: #008080;\\\">to</span> <span style=\\\"color: #000000;\\\">p10</span><span style=\\\"color: #0000FF;\\\">*</span><span style=\\\"color: #000000;\\\">10</span><span style=\\\"color: #0000FF;\\\">-</span><span style=\\\"color: #000000;\\\">1</span> <span style=\\\"color: #008080;\\\">by</span> <span style=\\\"color: #000000;\\\">2</span> <span style=\\\"color: #008080;\\\">do</span> <span style=\\\"color: #000080;font-style:italic;\\\">-- to 99, 999, .. 999_999</span>\\n <span style=\\\"color: #008080;\\\">if</span> <span style=\\\"color: #000000;\\\">primes</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: #004080;\\\">integer</span> <span style=\\\"color: #000000;\\\">l</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">remainder</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">i</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">p10</span><span style=\\\"color: #0000FF;\\\">),</span>\\n <span style=\\\"color: #000000;\\\">r</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">floor</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">i</span><span style=\\\"color: #0000FF;\\\">/</span><span style=\\\"color: #000000;\\\">10</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #004080;\\\">integer</span> <span style=\\\"color: #000000;\\\">pi</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">and_bits</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">primes</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">l</span><span style=\\\"color: #0000FF;\\\">],</span><span style=\\\"color: #000000;\\\">L</span><span style=\\\"color: #0000FF;\\\">)+</span><span style=\\\"color: #7060A8;\\\">and_bits</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">primes</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">r</span><span style=\\\"color: #0000FF;\\\">],</span><span style=\\\"color: #000000;\\\">R</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #008080;\\\">if</span> <span style=\\\"color: #000000;\\\">pi</span> <span style=\\\"color: #008080;\\\">and</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: #7060A8;\\\">sprint</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">i</span><span style=\\\"color: #0000FF;\\\">))</span> <span style=\\\"color: #008080;\\\">then</span> <span style=\\\"color: #000000;\\\">pi</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: #000000;\\\">primes</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;\\\">pi</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\\n <span style=\\\"color: #004080;\\\">integer</span> <span style=\\\"color: #000000;\\\">maxl</span><span style=\\\"color: #0000FF;\\\">=</span><span style=\\\"color: #000000;\\\">0</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">maxr</span><span style=\\\"color: #0000FF;\\\">=</span><span style=\\\"color: #000000;\\\">0</span>\\n\\n <span style=\\\"color: #008080;\\\">for</span> <span style=\\\"color: #000000;\\\">i</span><span style=\\\"color: #0000FF;\\\">=</span><span style=\\\"color: #000000;\\\">limit</span><span style=\\\"color: #0000FF;\\\">-</span><span style=\\\"color: #000000;\\\">1</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;\\\">2</span> <span style=\\\"color: #008080;\\\">do</span>\\n <span style=\\\"color: #004080;\\\">integer</span> <span style=\\\"color: #000000;\\\">pi</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">primes</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;\\\">pi</span> <span style=\\\"color: #008080;\\\">then</span>\\n <span style=\\\"color: #008080;\\\">if</span> <span style=\\\"color: #000000;\\\">maxl</span><span style=\\\"color: #0000FF;\\\">=</span><span style=\\\"color: #000000;\\\">0</span> <span style=\\\"color: #008080;\\\">and</span> <span style=\\\"color: #7060A8;\\\">and_bits</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">pi</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">L</span><span style=\\\"color: #0000FF;\\\">)</span> <span style=\\\"color: #008080;\\\">then</span> <span style=\\\"color: #000000;\\\">maxl</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">i</span> <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">if</span>\\n <span style=\\\"color: #008080;\\\">if</span> <span style=\\\"color: #000000;\\\">maxr</span><span style=\\\"color: #0000FF;\\\">=</span><span style=\\\"color: #000000;\\\">0</span> <span style=\\\"color: #008080;\\\">and</span> <span style=\\\"color: #7060A8;\\\">and_bits</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">pi</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">R</span><span style=\\\"color: #0000FF;\\\">)</span> <span style=\\\"color: #008080;\\\">then</span> <span style=\\\"color: #000000;\\\">maxr</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">i</span> <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">if</span>\\n <span style=\\\"color: #008080;\\\">if</span> <span style=\\\"color: #000000;\\\">maxl</span><span style=\\\"color: #0000FF;\\\">!=</span><span style=\\\"color: #000000;\\\">0</span> <span style=\\\"color: #008080;\\\">and</span> <span style=\\\"color: #000000;\\\">maxr</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: #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: #0000FF;\\\">?{</span><span style=\\\"color: #000000;\\\">maxl</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">maxr</span><span style=\\\"color: #0000FF;\\\">}</span>\\n<!--\\n\",\n \"language\": \"Phix\"\n },\n {\n \"code\": \"(load \\\"@lib/rsa.l\\\") # Use the 'prime?' function from RSA package\\n\\n(de truncatablePrime? (N Fun)\\n (for (L (chop N) L (Fun L))\\n (T (= \\\"0\\\" (car L)))\\n (NIL (prime? (format L)))\\n T ) )\\n\\n(let (Left 1000000 Right 1000000)\\n (until (truncatablePrime? (dec 'Left) cdr))\\n (until (truncatablePrime? (dec 'Right) '((L) (cdr (rot L)))))\\n (cons Left Right) )\\n\",\n \"language\": \"PicoLisp\"\n },\n {\n \"code\": \"bool is_trunc_prime(int p, string direction)\\n{\\n while(p) {\\n\\tif( !p->probably_prime_p() )\\n\\t return false;\\n\\tif(direction == \\\"l\\\")\\n\\t p = (int)p->digits()[1..];\\n\\telse\\n\\t p = (int)p->digits()[..<1];\\n }\\n return true;\\n}\\n\\nvoid main()\\n{\\n bool ltp_found, rtp_found;\\n for(int prime = 10->pow(6); prime--; prime > 0) {\\n\\tif( !ltp_found && is_trunc_prime(prime, \\\"l\\\") ) {\\n\\t ltp_found = true;\\n\\t write(\\\"Largest LTP: %d\\\\n\\\", prime);\\n\\t}\\n\\tif( !rtp_found && is_trunc_prime(prime, \\\"r\\\") ) {\\n\\t rtp_found = true;\\n\\t write(\\\"Largest RTP: %d\\\\n\\\", prime);\\n\\t}\\n\\tif(ltp_found && rtp_found)\\n\\t break;\\n }\\n}\\n\",\n \"language\": \"Pike\"\n },\n {\n \"code\": \"tp: procedure options (main);\\n declare primes(1000000) bit (1);\\n declare max_primes fixed binary (31);\\n declare (i, k) fixed binary (31);\\n\\n max_primes = hbound(primes, 1);\\n call sieve;\\n\\n /* Now search for primes that are right-truncatable. */\\n call right_truncatable;\\n\\n /* Now search for primes that are left-truncatable. */\\n call left_truncatable;\\n\\nright_truncatable: procedure;\\n declare direction bit (1);\\n declare (i, k) fixed binary (31);\\n\\ntest_truncatable:\\n do i = max_primes to 2 by -1;\\n if primes(i) then /* it's a prime */\\n do;\\n k = i/10;\\n do while (k > 0);\\n if ^primes(k) then iterate test_truncatable;\\n k = k/10;\\n end;\\n put skip list (i || ' is right-truncatable');\\n return;\\n end;\\n end;\\nend right_truncatable;\\n\\nleft_truncatable: procedure;\\n declare direction bit (1);\\n declare (i, k, d, e) fixed binary (31);\\n\\ntest_truncatable:\\n do i = max_primes to 2 by -1;\\n if primes(i) then /* it's a prime */\\n do;\\n k = i;\\n do d = 100000 repeat d/10 until (d = 10);\\n e = k/d;\\n k = k - e*d;\\n if e = 0 then iterate test_truncatable;\\n if ^primes(k) then iterate test_truncatable;\\n end;\\n put skip list (i || ' is left-truncatable');\\n return;\\n end;\\n end;\\nend left_truncatable;\\n\\nsieve: procedure;\\n declare (i, j) fixed binary (31);\\n\\n primes = '1'b; primes(1) = '0'b;\\n\\n do i = 2 to sqrt(max_primes);\\n do j = i+i to max_primes by i;\\n primes(j) = '0'b;\\n end;\\n end;\\nend sieve;\\n\\nend tp;\\n\",\n \"language\": \"PL-I\"\n },\n {\n \"code\": \"function IsPrime ( [int] $num )\\n{\\n $isprime = @{}\\n 2..[math]::sqrt($num) | Where-Object {\\n $isprime[$_] -eq $null } | ForEach-Object {\\n $_\\n $isprime[$_] = $true\\n for ( $i=$_*$_ ; $i -le $num; $i += $_ )\\n { $isprime[$i] = $false }\\n }\\n 2..$num | Where-Object { $isprime[$_] -eq $null }\\n}\\n\\nfunction Truncatable ( [int] $num )\\n{\\n $declen = [math]::abs($num).ToString().Length\\n $primes = @()\\n $ltprimes = @{}\\n $rtprimes = @{}\\n 1..$declen | ForEach-Object { $ltprimes[$_]=@{}; $rtprimes[$_]=@{} }\\n IsPrime $num | ForEach-Object {\\n $lastltprime = 2\\n $lastrtprime = 2\\n } {\\n $curprim = $_\\n $curdeclen = $curprim.ToString().Length\\n $primes += $curprim\\n if( $curdeclen -eq 1 ) {\\n $ltprimes[1][$curprim] = $true\\n $rtprimes[1][$curprim] = $true\\n $lastltprime = $curprim\\n $lastrtprime = $curprim\\n } else {\\n $curmod = $curprim % [math]::pow(10,$curdeclen - 1)\\n $curdiv = [math]::floor($curprim / 10)\\n if( $ltprimes[$curdeclen - 1][[int]$curmod] ) {\\n $ltprimes[$curdeclen][$curprim] = $true\\n $lastltprime = $curprim\\n }\\n if( $rtprimes[$curdeclen - 1][[int]$curdiv] ) {\\n $rtprimes[$curdeclen][$curprim] = $true\\n $lastrtprime = $curprim\\n }\\n }\\n if( ( $ltprimes[$curdeclen - 2].Keys.count -gt 0 ) -and ( $ltprimes[$curdeclen - 1].Keys.count -gt 0 ) ) { $ltprimes[$curdeclen -2] = @{} }\\n if( ( $rtprimes[$curdeclen - 2].Keys.count -gt 0 ) -and ( $rtprimes[$curdeclen - 1].Keys.count -gt 0 ) ) { $rtprimes[$curdeclen -2] = @{} }\\n } {\\n \\\"Largest Left Truncatable Prime: $lastltprime\\\"\\n \\\"Largest Right Truncatable Prime: $lastrtprime\\\"\\n }\\n}\\n\",\n \"language\": \"PowerShell\"\n },\n {\n \"code\": \"largest_left_truncatable_prime(N, N):-\\n is_left_truncatable_prime(N),\\n !.\\nlargest_left_truncatable_prime(N, P):-\\n N > 1,\\n N1 is N - 1,\\n largest_left_truncatable_prime(N1, P).\\n\\nis_left_truncatable_prime(P):-\\n is_prime(P),\\n is_left_truncatable_prime(P, P, 10).\\n\\nis_left_truncatable_prime(P, _, N):-\\n P =< N,\\n !.\\nis_left_truncatable_prime(P, Q, N):-\\n Q1 is P mod N,\\n is_prime(Q1),\\n Q \\\\= Q1,\\n N1 is N * 10,\\n is_left_truncatable_prime(P, Q1, N1).\\n\\nlargest_right_truncatable_prime(N, N):-\\n is_right_truncatable_prime(N),\\n !.\\nlargest_right_truncatable_prime(N, P):-\\n N > 1,\\n N1 is N - 1,\\n largest_right_truncatable_prime(N1, P).\\n\\nis_right_truncatable_prime(P):-\\n is_prime(P),\\n Q is P // 10,\\n (Q == 0, ! ; is_right_truncatable_prime(Q)).\\n\\nmain(N):-\\n find_prime_numbers(N),\\n largest_left_truncatable_prime(N, L),\\n writef('Largest left-truncatable prime less than %t: %t\\\\n', [N, L]),\\n largest_right_truncatable_prime(N, R),\\n writef('Largest right-truncatable prime less than %t: %t\\\\n', [N, R]).\\n\\nmain:-\\n main(1000000).\\n\",\n \"language\": \"Prolog\"\n },\n {\n \"code\": \":- module(prime_numbers, [find_prime_numbers/1, is_prime/1]).\\n:- dynamic is_prime/1.\\n\\nfind_prime_numbers(N):-\\n retractall(is_prime(_)),\\n assertz(is_prime(2)),\\n init_sieve(N, 3),\\n sieve(N, 3).\\n\\ninit_sieve(N, P):-\\n P > N,\\n !.\\ninit_sieve(N, P):-\\n assertz(is_prime(P)),\\n Q is P + 2,\\n init_sieve(N, Q).\\n\\nsieve(N, P):-\\n P * P > N,\\n !.\\nsieve(N, P):-\\n is_prime(P),\\n !,\\n S is P * P,\\n cross_out(S, N, P),\\n Q is P + 2,\\n sieve(N, Q).\\nsieve(N, P):-\\n Q is P + 2,\\n sieve(N, Q).\\n\\ncross_out(S, N, _):-\\n S > N,\\n !.\\ncross_out(S, N, P):-\\n retract(is_prime(S)),\\n !,\\n Q is S + 2 * P,\\n cross_out(Q, N, P).\\ncross_out(S, N, P):-\\n Q is S + 2 * P,\\n cross_out(Q, N, P).\\n\",\n \"language\": \"Prolog\"\n },\n {\n \"code\": \"#MaxLim = 999999\\n\\nProcedure is_Prime(n)\\n If n<=1 : ProcedureReturn #False\\n ElseIf n<4 : ProcedureReturn #True\\n ElseIf n%2=0: ProcedureReturn #False\\n ElseIf n<9 : ProcedureReturn #True\\n ElseIf n%3=0: ProcedureReturn #False\\n Else\\n Protected r=Round(Sqr(n),#PB_Round_Down)\\n Protected f=5\\n While f<=r\\n If n%f=0 Or n%(f+2)=0\\n ProcedureReturn #False\\n EndIf\\n f+6\\n Wend\\n EndIf\\n ProcedureReturn #True\\nEndProcedure\\n\\nProcedure TruncateLeft(n)\\n Protected s.s=Str(n), l=Len(s)-1\\n If Not FindString(s,\\\"0\\\",1)\\n While l>0\\n s=Right(s,l)\\n If Not is_Prime(Val(s))\\n ProcedureReturn #False\\n EndIf\\n l-1\\n Wend\\n ProcedureReturn #True\\n EndIf\\nEndProcedure\\n\\nProcedure TruncateRight(a)\\n Repeat\\n a/10\\n If Not a\\n Break\\n ElseIf Not is_Prime(a) Or a%10=0\\n ProcedureReturn #False\\n EndIf\\n ForEver\\n ProcedureReturn #True\\nEndProcedure\\n\\ni=#MaxLim\\nRepeat\\n If is_Prime(i)\\n If Not truncateleft And TruncateLeft(i)\\n truncateleft=i\\n EndIf\\n If Not truncateright And TruncateRight(i)\\n truncateright=i\\n EndIf\\n EndIf\\n If truncateleft And truncateright\\n Break\\n Else\\n i-2\\n EndIf\\nUntil i<=0\\n\\nx.s=\\\"Largest TruncateLeft= \\\"+Str(truncateleft)\\ny.s=\\\"Largest TruncateRight= \\\"+Str(truncateright)\\n\\nMessageRequester(\\\"Truncatable primes\\\",x+#CRLF$+y)\\n\",\n \"language\": \"PureBasic\"\n },\n {\n \"code\": \"maxprime = 1000000\\n\\ndef primes(n):\\n multiples = set()\\n prime = []\\n for i in range(2, n+1):\\n if i not in multiples:\\n prime.append(i)\\n multiples.update(set(range(i*i, n+1, i)))\\n return prime\\n\\ndef truncatableprime(n):\\n 'Return a longest left and right truncatable primes below n'\\n primelist = [str(x) for x in primes(n)[::-1]]\\n primeset = set(primelist)\\n for n in primelist:\\n # n = 'abc'; [n[i:] for i in range(len(n))] -> ['abc', 'bc', 'c']\\n alltruncs = set(n[i:] for i in range(len(n)))\\n if alltruncs.issubset(primeset):\\n truncateleft = int(n)\\n break\\n for n in primelist:\\n # n = 'abc'; [n[:i+1] for i in range(len(n))] -> ['a', 'ab', 'abc']\\n alltruncs = set([n[:i+1] for i in range(len(n))])\\n if alltruncs.issubset(primeset):\\n truncateright = int(n)\\n break\\n return truncateleft, truncateright\\n\\nprint(truncatableprime(maxprime))\\n\",\n \"language\": \"Python\"\n },\n {\n \"code\": \" 1000000 eratosthenes\\n\\n [ false swap\\n number$ witheach\\n [ char 0 =\\n if [ conclude not ] ] ] is haszero ( n --> b )\\n\\n [ 10 / ] is truncright ( n --> n )\\n\\n [ number$\\n behead drop $->n drop ] is truncleft ( n --> n )\\n\\n [ dup isprime not iff\\n [ drop false ] done\\n dup haszero iff\\n [ drop false ] done\\n true swap\\n [ truncleft\\n dup 0 > while\\n dup isprime not iff\\n [ dip not ] done\\n again ] drop ] is ltruncatable ( n --> b )\\n\\n [ dup isprime not iff\\n [ drop false ] done\\n dup haszero iff\\n [ drop false ] done\\n true swap\\n [ truncright\\n dup 0 > while\\n dup isprime not iff\\n [ dip not ] done\\n again ] drop ] is rtruncatable ( n --> b )\\n\\n say \\\"Left: \\\"\\n 1000000 times [ i ltruncatable if [ i echo conclude ] ]\\n cr\\n say \\\"Right: \\\"\\n 1000000 times [ i rtruncatable if [ i echo conclude ] ]\\n cr\\n\",\n \"language\": \"Quackery\"\n },\n {\n \"code\": \"#lang racket\\n(require math/number-theory)\\n\\n(define (truncate-right n)\\n (quotient n 10))\\n\\n(define (truncate-left n)\\n (define s (number->string n))\\n (string->number (substring s 1 (string-length s))))\\n\\n(define (contains-zero? n)\\n (member #\\\\0 (string->list (number->string n))))\\n\\n(define (truncatable? truncate n)\\n (and (prime? n)\\n (not (contains-zero? n))\\n (or (< n 10)\\n (truncatable? truncate (truncate n)))))\\n\\n; largest left truncatable prime\\n(for/first ([n (in-range 1000000 1 -1)]\\n #:when (truncatable? truncate-left n))\\n n)\\n\\n; largest right truncatable prime\\n(for/first ([n (in-range 1000000 1 -1)]\\n #:when (truncatable? truncate-right n))\\n n)\\n\\n; Output:\\n998443\\n739399\\n\",\n \"language\": \"Racket\"\n },\n {\n \"code\": \"constant ltp = $[2, 3, 5, 7], -> @ltp {\\n $[ grep { .&is-prime }, ((1..9) X~ @ltp) ]\\n} ... *;\\n\\nconstant rtp = $[2, 3, 5, 7], -> @rtp {\\n $[ grep { .&is-prime }, (@rtp X~ (1..9)) ]\\n} ... *;\\n\\nsay \\\"Highest ltp = \\\", ltp[5][*-1];\\nsay \\\"Highest rtp = \\\", rtp[5][*-1];\\n\",\n \"language\": \"Raku\"\n },\n {\n \"code\": \"/*REXX program finds largest left─ and right─truncatable primes ≤ 1m (or argument 1).*/\\nparse arg hi .; if hi=='' then hi= 1000000 /*Not specified? Then use default of 1m*/\\ncall genP /*generate some primes, about hi ÷ 2 */\\n /* [↓] find largest left truncatable P*/\\n do L=# by -1 for # /*search from top end; get the length.*/\\n do k=1 for length(@.L); _= right(@.L, k) /*validate all left truncatable primes.*/\\n if \\\\!._ then iterate L /*Truncated number not prime? Skip it.*/\\n end /*k*/\\n leave /*egress, found left truncatable prime.*/\\n end /*L*/\\n /* [↓] find largest right truncated P.*/\\n do R=# by -1 for # /*search from top end; get the length.*/\\n do k=1 for length(@.R); _= left(@.R, k) /*validate all right truncatable primes*/\\n if \\\\!._ then iterate R /*Truncated number not prime? Skip it.*/\\n end /*k*/\\n leave /*egress, found right truncatable prime*/\\n end /*R*/\\n\\nsay 'The largest left─truncatable prime ≤' hi \\\" is \\\" right(@.L, w)\\nsay 'The largest right─truncatable prime ≤' hi \\\" is \\\" right(@.R, w)\\nexit /*stick a fork in it, we're all done. */\\n/*──────────────────────────────────────────────────────────────────────────────────────*/\\ngenP: !.= 0; w= length(hi) /*placeholders for primes; max width. */\\n @.1=2; @.2=3; @.3=5; @.4=7; @.5=11 /*define some low primes. */\\n !.2=1; !.3=1; !.5=1; !.7=1; !.11=1 /* \\\" \\\" \\\" \\\" flags. */\\n #=5; s.#= @.# **2 /*number of primes so far; prime². */\\n /* [↓] generate more primes ≤ high.*/\\n do j=@.#+2 by 2 for max(0, hi%2-@.#%2-1) /*find odd primes from here on. */\\n parse var j '' -1 _; if _==5 then iterate /*J divisible by 5? (right dig)*/\\n if j// 3==0 then iterate /*\\\" \\\" \\\" 3? */\\n if j// 7==0 then iterate /*\\\" \\\" \\\" 7? */\\n /* [↑] the above five lines saves time*/\\n do k=5 while s.k<=j /* [↓] divide by the known odd primes.*/\\n if j // @.k == 0 then iterate j /*Is J ÷ X? Then not prime. ___ */\\n end /*k*/ /* [↑] only process numbers ≤ √ J */\\n #= #+1; @.#= j; s.#= j*j; !.j= 1 /*bump # of Ps; assign next P; P²; P# */\\n end /*j*/\\n return\\n\",\n \"language\": \"REXX\"\n },\n {\n \"code\": \"# Project : Truncatable primes\\n\\nfor n = 1000000 to 1 step -1\\n flag = 1\\n flag2 = 1\\n strn = string(n)\\n for nr = 1 to len(strn)\\n if strn[nr] = \\\"0\\\"\\n flag2 = 0\\n ok\\n next\\n if flag2 = 1\\n for m = 1 to len(strn)\\n strp = right(strn, m)\\n if isprime(number(strp))\\n else\\n flag = 0\\n exit\\n ok\\n next\\n if flag = 1\\n nend = n\\n exit\\n ok\\n ok\\nnext\\nsee \\\"Largest left truncatable prime : \\\" + nend + nl\\n\\nfor n = 1000000 to 1 step -1\\n flag = 1\\n strn = string(n)\\n for m = 1 to len(strn)\\n strp = left(strn, len(strn) - m + 1)\\n if isprime(number(strp))\\n else\\n flag = 0\\n exit\\n ok\\n next\\n if flag = 1\\n nend = n\\n exit\\n ok\\nnext\\nsee \\\"Largest right truncatable prime : \\\" + nend + nl\\n\\nfunc isprime num\\n if (num <= 1) return 0 ok\\n if (num % 2 = 0 and num != 2) return 0 ok\\n for i = 3 to floor(num / 2) -1 step 2\\n if (num % i = 0) return 0 ok\\n next\\n return 1\\n\",\n \"language\": \"Ring\"\n },\n {\n \"code\": \"def left_truncatable?(n)\\n truncatable?(n) {|i| i.to_s[1..-1].to_i}\\nend\\n\\n\\ndef right_truncatable?(n)\\n truncatable?(n) {|i| i/10}\\nend\\n\\ndef truncatable?(n, &trunc_func)\\n return false if n.to_s.include? \\\"0\\\"\\n loop do\\n n = trunc_func.call(n)\\n return true if n.zero?\\n return false unless Prime.prime?(n)\\n end\\nend\\n\\nrequire 'prime'\\nprimes = Prime.each(1_000_000).to_a.reverse\\n\\np primes.detect {|p| left_truncatable? p}\\np primes.detect {|p| right_truncatable? p}\\n\",\n \"language\": \"Ruby\"\n },\n {\n \"code\": \"fn 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_left_truncatable(p: u32) -> bool {\\n let mut n = 10;\\n let mut q = p;\\n while p > n {\\n if !is_prime(p % n) || q == p % n {\\n return false;\\n }\\n q = p % n;\\n n *= 10;\\n }\\n true\\n}\\n\\nfn is_right_truncatable(p: u32) -> bool {\\n let mut q = p / 10;\\n while q > 0 {\\n if !is_prime(q) {\\n return false;\\n }\\n q /= 10;\\n }\\n true\\n}\\n\\nfn main() {\\n let limit = 1000000;\\n let mut largest_left = 0;\\n let mut largest_right = 0;\\n let mut p = limit;\\n while p >= 2 {\\n if is_prime(p) && is_left_truncatable(p) {\\n largest_left = p;\\n break;\\n }\\n p -= 1;\\n }\\n println!(\\\"Largest left truncatable prime is {}\\\", largest_left);\\n p = limit;\\n while p >= 2 {\\n if is_prime(p) && is_right_truncatable(p) {\\n largest_right = p;\\n break;\\n }\\n p -= 1;\\n }\\n println!(\\\"Largest right truncatable prime is {}\\\", largest_right);\\n}\\n\",\n \"language\": \"Rust\"\n },\n {\n \"code\": \"object TruncatablePrimes {\\n def main(args: Array[String]): Unit = {\\n val max = 1000000\\n\\n println(\\n s\\\"\\\"\\\"|ltPrime: ${ltPrimes.takeWhile(_ <= max).last}\\n |rtPrime: ${rtPrimes.takeWhile(_ <= max).last}\\n |\\\"\\\"\\\".stripMargin)\\n }\\n\\n def ltPrimes: LazyList[Int] = 2 #:: LazyList.from(3, 2).filter(isLeftTruncPrime)\\n def rtPrimes: LazyList[Int] = 2 #:: LazyList.from(3, 2).filter(isRightTruncPrime)\\n\\n def isPrime(num: Int): Boolean = (num > 1) && !LazyList.range(3, math.sqrt(num).toInt + 1, 2).exists(num%_ == 0)\\n def isLeftTruncPrime(num: Int): Boolean = !num.toString.contains('0') && Iterator.unfold(num.toString){str => if(str.nonEmpty) Some((str.toInt, str.tail)) else None}.forall(isPrime)\\n def isRightTruncPrime(num: Int): Boolean = !num.toString.exists(_.asDigit%2 == 0) && Iterator.unfold(num.toString){str => if(str.nonEmpty) Some((str.toInt, str.init)) else None}.forall(isPrime)\\n}\\n\",\n \"language\": \"Scala\"\n },\n {\n \"code\": \"func t_prime(n, left=true) {\\n var p = %w(2 3 5 7);\\n var f = (\\n left ? { '1'..'9' ~X+ p }\\n : { p ~X+ '1'..'9' }\\n )\\n n.times {\\n p = f().grep{ .to_i.is_prime }\\n }\\n p.map{.to_i}.max\\n}\\n\\nsay t_prime(5, left: true)\\nsay t_prime(5, left: false)\\n\",\n \"language\": \"Sidef\"\n },\n {\n \"code\": \"func 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 isLeftTruncatable(_ p: Int) -> Bool {\\n var n = 10\\n var q = p\\n while p > n {\\n if !isPrime(p % n) || q == p % n {\\n return false\\n }\\n q = p % n\\n n *= 10\\n }\\n return true\\n}\\n\\nfunc isRightTruncatable(_ p: Int) -> Bool {\\n var q = p / 10\\n while q > 0 {\\n if !isPrime(q) {\\n return false\\n }\\n q /= 10\\n }\\n return true\\n}\\n\\nlet limit = 1000000\\nvar largestLeft = 0\\nvar largestRight = 0\\nvar p = limit\\nwhile p >= 2 {\\n if isPrime(p) && isLeftTruncatable(p) {\\n largestLeft = p\\n break\\n }\\n p -= 1\\n}\\nprint(\\\"Largest left truncatable prime is \\\\(largestLeft)\\\")\\np = limit\\nwhile p >= 2 {\\n if isPrime(p) && isRightTruncatable(p) {\\n largestRight = p\\n break\\n }\\n p -= 1\\n}\\nprint(\\\"Largest right truncatable prime is \\\\(largestRight)\\\")\\n\",\n \"language\": \"Swift\"\n },\n {\n \"code\": \"package require Tcl 8.5\\n\\n# Optimized version of the Sieve-of-Eratosthenes task solution\\nproc sieve n {\\n set primes [list]\\n if {$n < 2} {return $primes}\\n set nums [dict create]\\n for {set i 2} {$i <= $n} {incr i} {\\n dict set nums $i \\\"\\\"\\n }\\n set next 2\\n set limit [expr {sqrt($n)}]\\n while {$next <= $limit} {\\n for {set i $next} {$i <= $n} {incr i $next} {dict unset nums $i}\\n lappend primes $next\\n\\tdict for {next -} $nums break\\n }\\n return [concat $primes [dict keys $nums]]\\n}\\n\\nproc isLeftTruncatable n {\\n global isPrime\\n while {[string length $n] > 0} {\\n\\tif {![info exist isPrime($n)]} {\\n\\t return false\\n\\t}\\n\\tset n [string range $n 1 end]\\n }\\n return true\\n}\\nproc isRightTruncatable n {\\n global isPrime\\n while {[string length $n] > 0} {\\n\\tif {![info exist isPrime($n)]} {\\n\\t return false\\n\\t}\\n\\tset n [string range $n 0 end-1]\\n }\\n return true\\n}\\n\\n# Demo code\\nset limit 1000000\\nputs \\\"calculating primes up to $limit\\\"\\nset primes [sieve $limit]\\nputs \\\"search space contains [llength $primes] members\\\"\\nforeach p $primes {\\n set isPrime($p) \\\"yes\\\"\\n}\\nset primes [lreverse $primes]\\n\\nputs \\\"searching for largest left-truncatable prime\\\"\\nforeach p $primes {\\n if {[isLeftTruncatable $p]} {\\n\\tputs FOUND:$p\\n\\tbreak\\n }\\n}\\n\\nputs \\\"searching for largest right-truncatable prime\\\"\\nforeach p $primes {\\n if {[isRightTruncatable $p]} {\\n\\tputs FOUND:$p\\n\\tbreak\\n }\\n}\\n\",\n \"language\": \"Tcl\"\n },\n {\n \"code\": \"start_time = Now\\n\\nlt = 0\\nrt = 0\\n\\nFor h = 1 To 1000000\\n\\tIf IsLeftTruncatable(h) And h > lt Then\\n\\t\\tlt = h\\n\\tEnd If\\n\\tIf IsRightTruncatable(h) And h > rt Then\\n\\t\\trt = h\\n\\tEnd If\\nNext\\n\\nend_time = now\\n\\nWScript.StdOut.WriteLine \\\"Largest LTP from 1..1000000: \\\" & lt\\nWScript.StdOut.WriteLine \\\"Largest RTP from 1..1000000: \\\" & rt\\nWScript.StdOut.WriteLine \\\"Elapse Time(seconds) : \\\" & DateDiff(\\\"s\\\",start_time,end_time)\\n\\n'------------\\nFunction IsLeftTruncatable(n)\\n\\tIsLeftTruncatable = False\\n\\tc = 0\\n\\tFor i = Len(n) To 1 Step -1\\n\\t\\tIf InStr(1,n,\\\"0\\\") > 0 Then\\n\\t\\t\\tExit For\\n\\t\\tEnd If\\n\\t\\tIf IsPrime(Right(n,i)) Then\\n\\t\\t\\tc = c + 1\\n\\t\\tEnd If\\n\\tNext\\n\\tIf c = Len(n) Then\\n\\t\\tIsLeftTruncatable = True\\n\\tEnd If\\nEnd Function\\n\\nFunction IsRightTruncatable(n)\\n\\tIsRightTruncatable = False\\n\\tc = 0\\n\\tFor i = Len(n) To 1 Step -1\\n\\t\\tIf InStr(1,n,\\\"0\\\") > 0 Then\\n\\t\\t\\tExit For\\n\\t\\tEnd If\\n\\t\\tIf IsPrime(Left(n,i)) Then\\n\\t\\t\\tc = c + 1\\n\\t\\tEnd If\\n\\tNext\\n\\tIf c = Len(n) Then\\n\\t\\tIsRightTruncatable = True\\n\\tEnd If\\nEnd Function\\n\\nFunction IsPrime(n)\\n\\tIf n = 2 Then\\n\\t\\tIsPrime = True\\n\\tElseIf n <= 1 Or n Mod 2 = 0 Then\\n\\t\\tIsPrime = False\\n\\tElse\\n\\t\\tIsPrime = True\\n\\t\\tFor i = 3 To Int(Sqr(n)) Step 2\\n\\t\\t\\tIf n Mod i = 0 Then\\n\\t\\t\\t\\tIsPrime = False\\n\\t\\t\\t\\tExit For\\n\\t\\t\\tEnd If\\n\\t\\tNext\\n\\tEnd If\\nEnd Function\\n\",\n \"language\": \"VBScript\"\n },\n {\n \"code\": \"import \\\"./fmt\\\" for Fmt\\nimport \\\"./math\\\" for Int\\n\\nvar limit = 999999\\nvar c = Int.primeSieve(limit, false)\\nvar leftFound = false\\nvar rightFound = false\\nSystem.print(\\\"Largest truncatable primes less than a million:\\\")\\nvar i = limit\\nwhile (i > 2) {\\n if (!c[i]) {\\n if (!rightFound) {\\n var p = (i/10).floor\\n while (p > 0) {\\n if (p%2 == 0 || c[p]) break\\n p = (p/10).floor\\n }\\n if (p == 0) {\\n System.print(\\\" Right truncatable prime = %(Fmt.dc(0, i))\\\")\\n rightFound = true\\n if (leftFound) return\\n }\\n }\\n if (!leftFound) {\\n var q = i.toString[1..-1]\\n if (!q.contains(\\\"0\\\")) {\\n var p = Num.fromString(q)\\n while (q.count > 0) {\\n if (p%2 == 0 || c[p]) break\\n q = q[1..-1]\\n p = Num.fromString(q)\\n }\\n if (q == \\\"\\\") {\\n System.print(\\\" Left truncatable prime = %(Fmt.dc(0, i))\\\")\\n leftFound = true\\n if (rightFound) return\\n }\\n }\\n }\\n }\\n i = i - 2\\n}\\n\",\n \"language\": \"Wren\"\n },\n {\n \"code\": \"code CrLf=9, IntOut=11;\\n\\nfunc Prime(P); \\\\Return true if P is a prime number\\nint P; \\\\(1 is not prime, but 2 is, etc.)\\nint I;\\n[if P<=1 then return false; \\\\negative numbers are not prime\\nfor I:= 2 to sqrt(P) do\\n if rem(P/I) = 0 then return false;\\nreturn true;\\n];\\n\\nfunc RightTrunc(N); \\\\Return largest right-truncatable prime < one million\\nint N;\\nint M;\\n[for N:= 1_000_000-1 downto 2 do\\n [M:= N;\\n loop [if not Prime(M) then quit;\\n M:= M/10;\\n if rem(0) = 0 then quit; \\\\no zeros allowed\\n if M=0 then return N;\\n ];\\n ];\\n];\\n\\nfunc LeftTrunc(N); \\\\Return largest left-truncatable prime < one million\\nint N;\\nint M, P;\\n[for N:= 1_000_000-1 downto 2 do\\n [M:= N;\\n P:=100_000;\\n loop [if not Prime(M) then quit;\\n M:= rem(M/P);\\n P:= P/10;\\n if M<P then quit; \\\\no zeros allowed\\n if M=0 then return N;\\n ];\\n ];\\n];\\n\\n[IntOut(0, LeftTrunc); CrLf(0);\\n IntOut(0, RightTrunc); CrLf(0);\\n]\\n\",\n \"language\": \"XPL0\"\n },\n {\n \"code\": \"const million=0d1_000_000;\\n\\nvar pTable=Data(million+1,Int).fill(0);\\t// actually bytes, all zero\\nprimes:=Utils.Generator(Import(\\\"sieve\\\").postponed_sieve);\\nwhile((p:=primes.next())<million){ pTable[p]=1; }\\n\\nfcn rightTrunc(n){\\n while(n){ if(not pTable[n]) return(False); n/=10; }\\n True\\n}\\nfcn leftTrunc(n){ // 999,907 is not allowed\\n ns:=n.toString(); if (ns.holds(\\\"0\\\")) return(False);\\n while(ns){ if(not pTable[ns]) return(False); ns=ns[1,*]; }\\n True\\n}\\n\",\n \"language\": \"Zkl\"\n },\n {\n \"code\": \"[million..0,-1].filter1(rightTrunc):\\n \\\"%,d is a right truncatable prime\\\".fmt(_).println();\\n[million..0,-1].filter1(leftTrunc):\\n \\\"%,d is a left truncatable prime\\\".fmt(_).println();\\n\",\n \"language\": \"Zkl\"\n }\n]","isConversational":false},"task_name":{"kind":"string","value":"Truncatable-primes"}}},{"rowIdx":1774,"cells":{"solutions":{"kind":"list like","value":[{"code":"---\ncategory:\n- File System Operations\nfrom: http://rosettacode.org/wiki/Truncate_a_file\n","language":"00-META"},{"code":";Task:\nTruncate a file to a specific length. This should be implemented as a routine that takes two parameters: the filename and the required file length (in bytes).\n\n\nTruncation can be achieved using system or library calls intended for such a task, if such methods exist, or by creating a temporary file of a reduced size and renaming it, after first deleting the original file, if no other method is available. The file may contain non human readable binary data in an unspecified format, so the routine should be \"binary safe\", leaving the contents of the untruncated part of the file unchanged.\n\nIf the specified filename does not exist, or the provided length is not less than the current file length, then the routine should raise an appropriate error condition. \n\nOn some systems, the provided file truncation facilities might not change the file or may extend the file, if the specified length is greater than the current length of the file. \n\nThis task permits the use of such facilities. However, such behaviour should be noted, or optionally a warning message relating to an non change or increase in file size may be implemented.\n<br><br>\n\n","language":"00-TASK"},{"code":"F truncate_file(name, length)\n I !fs:is_file(name)\n R 0B\n I length >= fs:file_size(name)\n R 0B\n fs:resize_file(name, length)\n R 1B\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\nBYTE FUNC Find(CHAR ARRAY text CHAR c)\n BYTE i\n\n i=1\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 MakeRenameCommand(CHAR ARRAY left,right,result)\n BYTE i,len,pos\n\n SCopy(result,left)\n len=left(0)+1\n result(len)=32\n pos=Find(right,':)\n FOR i=pos+1 TO right(0)\n DO\n len==+1\n result(len)=right(i)\n OD\n result(0)=len\nRETURN\n\nPROC DeleteFile(CHAR ARRAY fname)\n BYTE dev=[1]\n\n Close(dev)\n Xio(dev,0,33,0,0,fname)\nRETURN\n\nPROC TruncateFile(CHAR ARRAY fname CARD maxlen)\n DEFINE BUF_LEN=\"100\"\n CHAR ARRAY tmp=\"D:TEMP.TMP\",cmd(255)\n BYTE in=[1], out=[2]\n BYTE ARRAY buff(BUF_LEN)\n CARD len,size\n\n Close(in)\n Close(out)\n Open(in,fname,4)\n Open(out,tmp,8)\n\n DO\n IF maxlen>BUF_LEN THEN\n size=BUF_LEN\n ELSE\n size=maxlen\n FI\n len=Bget(in,buff,size)\n maxlen==-len\n IF len>0 THEN\n Bput(out,buff,len)\n FI\n UNTIL len#BUF_LEN\n OD\n\n Close(in)\n Close(out)\n\n MakeRenameCommand(tmp,fname,cmd)\n DeleteFile(fname)\n Rename(cmd)\nRETURN\n\nPROC Main()\n CHAR ARRAY filter=\"D:*.*\", fname=\"D:INPUT.TXT\"\n CARD len=[400]\n\n Put(125) PutE() ;clear screen\n\n PrintF(\"Dir \"\"%S\"\"%E\",filter)\n Dir(filter)\n\n PrintF(\"Truncate \"\"%S\"\" to %U bytes.%E%E\",fname,len)\n TruncateFile(fname,len)\n\n PrintF(\"Dir \"\"%S\"\"%E\",filter)\n Dir(filter)\nRETURN\n","language":"Action-"},{"code":"with Ada.Command_Line, Ada.Sequential_IO, Ada.Directories;\n\nprocedure Truncate_File is\n\n type Byte is mod 256;\n for Byte'Size use 8;\n\n package Byte_IO is new Ada.Sequential_IO(Byte);\n\n function Arg(N: Positive) return String renames Ada.Command_Line.Argument;\n function Args return Natural renames Ada.Command_Line.Argument_Count;\n\nbegin\n -- give help output if neccessary\n if Args < 2 or else Args > 3 then\n raise Program_Error\n with \"usage: truncate_file <filename> <length> [<temp_file>]\";\n end if;\n\n -- now do the real work\n declare\n File_Name: String := Arg(1);\n Temp_Name: String := (if Args = 2 then Arg(1) & \".tmp\" else Arg(3));\n -- an Ada 2012 conditional expression\n File, Temp: Byte_IO.File_Type;\n Count: Natural := Natural'Value(Arg(2));\n Value: Byte;\n begin\n -- open files\n Byte_IO.Open (File => File, Mode => Byte_IO.In_File, Name => File_Name);\n Byte_IO.Create(File => Temp, Mode => Byte_IO.Out_File, Name => Temp_Name);\n\n -- copy the required bytes (but at most as much as File has) from File to Temp\n while (not Byte_IO.End_Of_File(File)) and Count > 0 loop\n Byte_IO.Read (File, Value);\n Byte_IO.Write(Temp, Value);\n Count := Count - 1;\n end loop;\n\n -- close files\n Byte_IO.Close(Temp);\n Byte_IO.Close(File);\n\n if Count = 0 then -- File was at least Count bytes long\n -- remove File and rename Temp to File\n Ada.Directories.Delete_File(Name => File_Name);\n Ada.Directories.Rename(Old_Name => Temp_Name, New_Name => File_Name);\n else -- File was too short\n -- remove Temp and leave File as it is, output error\n Ada.Directories.Delete_File(Name => Temp_Name);\n raise Program_Error\n with \"Size of \"\"\" & File_Name & \"\"\" less than \" & Arg(2);\n end if;\n end;\nend Truncate_File;\n","language":"Ada"},{"code":"truncFile(\"S:\\Portables\\AutoHotkey\\My Scripts\\Other_Codes\\motion2.ahk\", 1200)\nreturn\n\ntruncFile(file, length_bytes){\n\tif !FileExist(file)\n\t\tmsgbox, File doesn't exists.\n\tFileGetSize, fsize, % file, B\n\tif (length_bytes>fsize)\n\t\tmsgbox, New truncated size more than current file size\n\tf := FileOpen(file, \"rw\")\n\tf.length := length_bytes\n\tf.close()\n}\n","language":"AutoHotkey"},{"code":"# syntax: GAWK -f TRUNCATE_A_FILE.AWK\nBEGIN {\n main(\"NOTHERE\",100)\n main(\"FILENAME.TMP\",-1)\n main(\"FILENAME.TMP\",500)\n exit(0)\n}\nfunction main(filename,size, ret) {\n ret = truncate_file(filename,size)\n if (ret != \"\") {\n printf(\"error: FILENAME=%s, %s\\n\",filename,ret)\n }\n}\nfunction truncate_file(filename,size, cmd,fnr,msg,old_BINMODE,old_RS,rec) {\n cmd = sprintf(\"ls --full-time -o %s\",filename)\n if (size < 0) {\n return(\"size cannot be negative\")\n }\n old_BINMODE = BINMODE\n old_RS = RS\n BINMODE = 3\n RS = \"[^\\x00-\\xFF]\"\n while (getline rec <filename > 0) {\n fnr++\n }\n close(filename)\n if (fnr == 0) {\n msg = \"file not found\"\n }\n if (fnr > 1) {\n msg = \"choose a different RecordSeparator\"\n }\n if (msg == \"\") { # no errors\n system(cmd) # optional: show filesize before truncation\n if (length(rec) > size) {\n rec = substr(rec,1,size)\n }\n printf(\"%s\",rec) >filename\n close(filename)\n system(cmd) # optional: show filesize after truncation\n }\n BINMODE = old_BINMODE\n RS = old_RS\n return(msg)\n}\n","language":"AWK"},{"code":"SUB truncateFile (file AS STRING, length AS LONG)\n IF LEN(DIR$(file)) THEN\n DIM f AS LONG, c AS STRING\n f = FREEFILE\n OPEN file FOR BINARY AS f\n IF length > LOF(f) THEN\n CLOSE f\n ERROR 62 'Input past end of file\n ELSE\n c = SPACE$(length)\n GET #f, 1, c\n CLOSE f\n OPEN file FOR OUTPUT AS f\n PRINT #f, c;\n CLOSE f\n END IF\n ELSE\n ERROR 53\n END IF\nEND SUB\n","language":"BASIC"},{"code":" DEF PROCtruncate(file$, size%)\n LOCAL file%\n file% = OPENUP(file$)\n IF file%=0 ERROR 100, \"Could not open file\"\n EXT#file% = size%\n CLOSE #file%\n ENDPROC\n","language":"BBC-BASIC"},{"code":"( ( trunc\n = name length elif file c\n . !arg:(?name,?length)\n & fil$(!name,rb)\n & fil$(,DEC,1)\n & :?elif\n & whl\n ' ( !length+-1:?length:~<0\n & fil$() !elif:?elif\n )\n & (fil$(,SET,-1)|)\n & whl'(!elif:%?c ?elif&!c !file:?file)\n & fil$(!name,wb)\n & fil$(,DEC,1)\n & whl'(!file:%?c ?file&fil$(,,1,!c))\n & (fil$(,SET,-1)|)\n & !length:<0\n )\n& put$(\"I have a secret to tell you. Listen:\",\"test.txt\",NEW)\n& ( trunc$(\"test.txt\",20)&out$(get$(\"test.txt\",STR))\n | out$\"File too short\"\n )\n);\n","language":"Bracmat"},{"code":"#include <windows.h>\n#include <stdio.h>\n#include <wchar.h>\n\n/* Print \"message: last Win32 error\" to stderr. */\nvoid\noops(const wchar_t *message)\n{\n\twchar_t *buf;\n\tDWORD error;\n\n\tbuf = NULL;\n\terror = GetLastError();\n\tFormatMessageW(FORMAT_MESSAGE_ALLOCATE_BUFFER |\n\t FORMAT_MESSAGE_FROM_SYSTEM | FORMAT_MESSAGE_IGNORE_INSERTS,\n\t NULL, error, 0, (wchar_t *)&buf, 0, NULL);\n\n\tif (buf) {\n\t\tfwprintf(stderr, L\"%ls: %ls\", message, buf);\n\t\tLocalFree(buf);\n\t} else {\n\t\t/* FormatMessageW failed. */\n\t\tfwprintf(stderr, L\"%ls: unknown error 0x%x\\n\",\n\t\t message, error);\n\t}\n}\n\nint\ndotruncate(wchar_t *fn, LARGE_INTEGER fp)\n{\n\tHANDLE fh;\n\n\tfh = CreateFileW(fn, GENERIC_WRITE, 0, NULL, OPEN_EXISTING, 0, NULL);\n\tif (fh == INVALID_HANDLE_VALUE) {\n\t\toops(fn);\n\t\treturn 1;\n\t}\n\n\tif (SetFilePointerEx(fh, fp, NULL, FILE_BEGIN) == 0 ||\n\t SetEndOfFile(fh) == 0) {\n\t\toops(fn);\n\t\tCloseHandle(fh);\n\t\treturn 1;\n\t}\n\n\tCloseHandle(fh);\n\treturn 0;\n}\n\n/*\n * Truncate or extend a file to the given length.\n */\nint\nmain()\n{\n\tLARGE_INTEGER fp;\n\tint argc;\n\twchar_t **argv, *fn, junk[2];\n\n\t/* MinGW never provides wmain(argc, argv). */\n\targv = CommandLineToArgvW(GetCommandLineW(), &argc);\n\tif (argv == NULL) {\n\t\toops(L\"CommandLineToArgvW\");\n\t\treturn 1;\n\t}\n\n\tif (argc != 3) {\n\t\tfwprintf(stderr, L\"usage: %ls filename length\\n\", argv[0]);\n\t\treturn 1;\n\t}\n\n\tfn = argv[1];\n\n\t/* fp = argv[2] converted to a LARGE_INTEGER. */\n\tif (swscanf(argv[2], L\"%lld%1ls\", &fp.QuadPart, &junk) != 1) {\n\t\tfwprintf(stderr, L\"%ls: not a number\\n\", argv[2]);\n\t\treturn 1;\n\t}\n\n\treturn dotruncate(fn, fp);\n}\n","language":"C"},{"code":"#include <unistd.h>\n#include <sys/types.h>\n\n...\ntruncate(filename, length);\nftruncate(fd, length);\n...\n","language":"C"},{"code":"#include <string>\n#include <fstream>\n\nusing namespace std;\n\nvoid truncateFile(string filename, int max_size) {\n std::ifstream input( filename, std::ios::binary );\n char buffer;\n string outfile = filename + \".trunc\";\n ofstream appendFile(outfile, ios_base::out);\n for(int i=0; i<max_size; i++) {\n input.read( &buffer, sizeof(buffer) );\n appendFile.write(&buffer,1);\n }\n appendFile.close(); }\n\nint main () {\n truncateFile(\"test.txt\", 5);\n return 0;\n}\n","language":"C++"},{"code":"using System;\nusing System.IO;\n\nnamespace TruncateFile\n{\n internal class Program\n {\n private static void Main(string[] args)\n {\n TruncateFile(args[0], long.Parse(args[1]));\n }\n\n private static void TruncateFile(string path, long length)\n {\n if (!File.Exists(path))\n throw new ArgumentException(\"No file found at specified path.\", \"path\");\n\n using (var fileStream = new FileStream(path, FileMode.Open, FileAccess.Write))\n {\n if (fileStream.Length < length)\n throw new ArgumentOutOfRangeException(\"length\",\n \"The specified length is greater than that of the file.\");\n\n fileStream.SetLength(length);\n }\n }\n }\n}\n","language":"C-sharp"},{"code":"(defn truncate [file size]\n (with-open [chan (.getChannel (java.io.FileOutputStream. file true))]\n (.truncate chan size)))\n\n(truncate \"truncate_test.txt\" 2)\n","language":"Clojure"},{"code":"import std.file, std.exception;\n\nvoid truncateFile(in string name, in size_t newSize) {\n if (!exists(name) || !isFile(name))\n throw new Exception(\"File not found.\");\n\n auto size = getSize(name);\n if (size <= newSize)\n throw new Exception(\n \"New size must be smaller than original size.\");\n\n auto content = cast(ubyte[])read(name, newSize);\n if (content.length != newSize)\n throw new Exception(\"Reading file failed.\");\n\n write(name, content);\n enforce(getSize(name) == newSize);\n}\n\nvoid main() {\n truncateFile(\"truncate_test.txt\", 0);\n}\n","language":"D"},{"code":"procedure TruncateFile(FileName : string; NewSize : integer);\nvar\n aFile: file of byte;\nbegin\n Assign(aFile, FileName);\n Reset(aFile);\n try\n Seek(afile, NewSize);\n Truncate(aFile);\n finally\n Close(afile);\n end;\nend;\n","language":"Delphi"},{"code":"procedure TruncateFile(FileName : string; NewSize : integer);\nvar\n Stream : TFileStream;\nbegin\n Stream := TFileStream.Create(FileName, fmOpenReadWrite, fmShareExclusive);\n try\n Stream.Size := NewSize;\n finally\n Stream.Free;\n end;\nend;\n","language":"Delphi"},{"code":"import system'io;\nimport extensions;\n\nextension fileOp : File\n{\n set Length(int len)\n {\n auto stream := FileStream.openForEdit(self);\n\n stream.Length := len;\n\n stream.close()\n }\n}\n\npublic program()\n{\n if (program_arguments.Length != 3)\n { console.printLine(\"Please provide the path to the file and a new length\"); AbortException.raise() };\n\n auto file := File.assign(program_arguments[1]);\n var length := program_arguments[2].toInt();\n\n ifnot(file.Available)\n { console.printLine(\"File \",file,\" does not exist\"); AbortException.raise() };\n\n file.Length := length\n}\n","language":"Elena"},{"code":"-module( truncate ).\n\n-export( [file/2] ).\n\nfile( Name, Size ) ->\n\t{file_exists, true} = {file_exists, filelib:is_file( Name )},\n\t{ok, IO} = file:open( Name, [read, write] ),\n\t{ok, Max} = file:position( IO, eof ),\n\t{correct_size, true} = {correct_size, (Size < Max)},\n\t{ok, Size} = file:position( IO, {bof, Size} ),\n\tok = file:truncate( IO ).\n","language":"Erlang"},{"code":"open System\nopen System.IO\n\nlet truncateFile path length =\n if not (File.Exists(path)) then failwith (\"File not found: \" + path)\n use fileStream = new FileStream(path, FileMode.Open, FileAccess.Write)\n if (fileStream.Length < length) then failwith \"The specified length is greater than the current file length.\"\n fileStream.SetLength(length)\n\n[<EntryPoint>]\nlet main args =\n truncateFile args.[0] (Int64.Parse(args.[1]))\n 0\n","language":"F-Sharp"},{"code":": truncate-file ( fname fnamelen fsize -- )\n 0 2swap r/w open-file throw\n dup >r resize-file throw\n r> close-file throw ;\n","language":"Forth"},{"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,NB)\n CHARACTER*(*) FNAME\t!Name for the file.\n INTEGER NB\t\t!Number of bytes to survive.\n INTEGER L\t\t!A counter for te length of the file.\n INTEGER F,T\t\t!Mnemonics for file unit numbers.\n PARAMETER (F=66,T=67)\t!These should do.\n LOGICAL EXIST\t\t!Same as the mnemonic so left/right can be forgotten.\n CHARACTER*1 B\t\t!The worker!\n IF (FNAME.EQ.\"\") CALL CROAK(\"Blank file name!\")\n IF (NB.LE.0) CALL CROAK(\"Chop 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=\"READWRITE\",\t!Grab the source file.\n 1 FORM=\"UNFORMATTED\",RECL=1,ACCESS=\"DIRECT\")\t\t!Oh dear.\n OPEN (T,STATUS=\"SCRATCH\",FORM=\"UNFORMATTED\",RECL=1)\t!Request a temporary file.\n\nCopy the desired \"records\" to the temporary file.\n 10 DO L = 1,NB\t!Only up to a point.\n READ (F,REC = L,ERR = 20) B\t!One whole byte!\n WRITE (T) B\t\t\t!And, write it too!\n END DO\t\t!Again.\n 20 IF (L.LE.NB) CALL CROAK(\"Short file!\")\t!Should end the loop with L = NB + 1.\nConvert from input to output...\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 DO L = 1,NB\t!A certain number only.\n READ (T) B\t\t!One at at timne.\n WRITE (F,\"(A1,$)\") B\t!The $, obviously, means no end-of-record appendage.\n END DO\t\t!And again.\nCompleted.\n 30 CLOSE(T)\t!Abandon the temporary file.\n CLOSE(F)\t!Finished with the source file.\n END\t\t!Done.\n\n PROGRAM CHOPPER\n CALL FILEHACK(\"foobar.txt\",12)\n END\n","language":"Fortran"},{"code":"Sub truncateFile (archivo As String, longitud As Long)\n If Len(Dir(archivo)) Then\n Dim f As Long, c As String\n f = Freefile\n Open archivo For Binary As #f\n If longitud > Lof(f) Then\n Close #f\n Error 62 'Input past end of file\n Else\n c = Space(longitud)\n Get #f, 1, c\n Close f\n Open archivo For Output As #f\n Print #f, c;\n Close #f\n End If\n Else\n Error 53 'File not found\n End If\nEnd Sub\n","language":"FreeBASIC"},{"code":"import (\n \"fmt\"\n \"os\"\n)\n\nif err := os.Truncate(\"filename\", newSize); err != nil {\n fmt.Println(err)\n}\n","language":"Go"},{"code":"setFileSize :: FilePath -> FileOffset -> IO ()\n-- Truncates the file down to the specified length.\n-- If the file was larger than the given length\n-- before this operation was performed the extra is lost.\n-- Note: calls truncate.\n","language":"Haskell"},{"code":"truncate(f := open(filename, \"bu\"), newsizeinbytes) & close(f)\n","language":"Icon"},{"code":"require 'files' NB. needed for versions prior to J7\nftruncate=: ] fwrite~ ] fread@; 0 , [\n","language":"J"},{"code":" (1000$ 'abcdefg') fwrite 'text.txt' NB. create test file\n 567 ftruncate 'test.txt' NB. truncate test file\n567\n fsize 'test.txt' NB. check new file size\n567\n","language":"J"},{"code":"import java.io.FileOutputStream;\nimport java.io.IOException;\nimport java.nio.channels.FileChannel;\n\npublic class TruncFile {\n\tpublic static void main(String[] args) throws IOException{\n\t\tif(args.length < 2){\n\t\t\tSystem.out.println(\"Usage: java TruncFile fileName newSize\");\n\t\t\treturn;\n\t\t}\n\t\t//turn on \"append\" so it doesn't clear the file\n\t\tFileChannel outChan = new FileOutputStream(args[0], true).getChannel();\n\t\tlong newSize = Long.parseLong(args[1]);\n\t\toutChan.truncate(newSize);\n\t\toutChan.close();\n\t}\n}\n","language":"Java"},{"code":"function truncate_file(fname, size):\n open(fname, \"r+\") do f\n truncate(f, size)\n end\nend\n","language":"Julia"},{"code":"// version 1.1.2\n\nimport java.io.FileOutputStream\nimport java.nio.channels.FileChannel\n\nfun truncateFile(fileName: String, newSize: Long) {\n var fc: FileChannel? = null\n try {\n fc = FileOutputStream(fileName, true).channel\n if (newSize >= fc.size())\n println(\"Requested file size isn't less than existing size\")\n else\n fc.truncate(newSize)\n }\n catch (ex: Exception) {\n println(ex.message)\n }\n finally {\n fc!!.close()\n }\n}\n\nfun main(args: Array<String>) {\n truncateFile(\"test.txt\", 10)\n}\n","language":"Kotlin"},{"code":"define file_truncate(path::string, size::integer) => {\n\n\tlocal(file = file(#path))\n\n\tfail_if(not(#file -> exists), -1, 'There is no file at the given path')\n\tfail_if(#file -> size < #size, -1, 'No point in truncating a file to a larger size than it already is')\n\n\t#file -> setSize(#size)\n\n}\nlocal(filepath = '//Library/WebServer/Documents/Lasso9cli/trunk/testing/lorem_ipsum_long.txt')\n\nstdoutnl(file(#filepath) -> readbytes)\nstdoutnl('Original size: ' + file(#filepath) -> size)\n\nfile_truncate(#filepath, 300)\n\nstdoutnl(file(#filepath) -> readbytes)\nstdout(file('Truncated size: ' + #filepath) -> size)\n","language":"Lasso"},{"code":"dim info$( 50, 50) ' NB pre-dimension before calling file-exists\n ' needed for file-exists function\nopen \"test.dat\" for output as #1 'create file\n for i = 1 to 10000\n #1 chr$( int( 256 *rnd( 1)));\n next\nclose #1\n\ncall truncateFile, \"test.dat\", 5000\n\nwait\n\nsub truncateFile fn$, length\n if fileExists( DefaultDir$, fn$) =0 then notice \"No such file\": exit sub\n open fn$ for input as #i\n file$ =input$( #i, lof( #i))\n if len( file$) <length then notice \"Too short\": close #i: exit sub\n file$ =left$( file$, length)\n close #i\n open \"test.dat\" for output as #o\n #o file$\n close #o\nend sub\n\nfunction fileExists( path$, filename$)\n files path$, filename$, info$()\n fileExists =val( info$( 0, 0)) 'non zero is true\nend function\n\nend\n","language":"Liberty-BASIC"},{"code":"----------------------------------------\n-- Truncates file\n-- @param {string} filename\n-- @param {integer} length\n-- @return {bool} success\n----------------------------------------\non truncate (filename, length)\n fp = xtra(\"fileIO\").new()\n fp.openFile(filename, 0)\n if fp.status() then return false\n if fp.getLength()=length then\n -- nothing to do\n fp.closeFile()\n return true\n end if\n data = fp.readByteArray(length)\n if data.length<>length then\n fp.closeFile()\n return false\n end if\n fp.delete()\n fp.createFile(filename)\n fp.openFile(filename, 2)\n fp.writeByteArray(data)\n ok = fp.status()=0\n fp.closeFile()\n return ok\nend\n","language":"Lingo"},{"code":"-- truncates file to 10 KB length\nbx_file_truncate(_movie.path&\"foo.dat\", 10240)\n","language":"Lingo"},{"code":"function truncate (filename, length)\n local inFile = io.open(filename, 'r')\n if not inFile then\n error(\"Specified filename does not exist\")\n end\n local wholeFile = inFile:read(\"*all\")\n inFile:close()\n if length >= wholeFile:len() then\n error(\"Provided length is not less than current file length\")\n end\n local outFile = io.open(filename, 'w')\n outFile:write(wholeFile:sub(1, length))\n outFile:close()\nend\n","language":"Lua"},{"code":"Truncate[file_, n_] := Module[{filename = file, nbbytes = n, temp},\n temp = $TemporaryPrefix <> filename;\n BinaryWrite[temp, BinaryReadList[filename, \"Byte\", nbbytes]];\n Close[temp]; DeleteFile[filename]; RenameFile[temp, filename];\n ]\n","language":"Mathematica"},{"code":"function truncate_a_file(fn,count);\n\nfid=fopen(fn,'r');\ns = fread(fid,count,'uint8');\nfclose(fid);\n\nfid=fopen(fn,'w');\ns = fwrite(fid,s,'uint8');\nfclose(fid);\n","language":"MATLAB"},{"code":"import posix\n\ndiscard truncate(\"filename\", 1024)\n","language":"Nim"},{"code":"val truncate : string -> int -> unit\n(** Truncates the named file to the given size. *)\n","language":"OCaml"},{"code":"val ftruncate : file_descr -> int -> unit\n(** Truncates the file corresponding to the given descriptor to the given size. *)\n","language":"OCaml"},{"code":"install(\"truncate\", \"isL\", \"trunc\")\n\ntrunc(\"/tmp/test.file\", 20)\n","language":"PARI-GP"},{"code":"Program FileTruncate;\n\nuses\n SysUtils;\n\nvar\n myfile: file of byte;\n filename: string;\n position: integer;\n\nbegin\n write('File for truncation: ');\n readln(filename);\n if not FileExists(filename) then\n begin\n writeln('Error: File does not exist.');\n exit;\n end;\n\n write('Truncate position: ');\n readln(position);\n\n Assign(myfile, filename);\n Reset(myfile);\n if FileSize(myfile) < position then\n begin\n writeln('Warning: The file \"', filename, '\" is too short. No need to truncate at position ', position);\n Close(myfile);\n exit;\n end;\n\n Seek(myfile, position);\n Truncate(myfile);\n Close(myfile);\n writeln('File \"', filename, '\" truncated at position ', position, '.');\nend.\n","language":"Pascal"},{"code":"# Open a file for writing, and truncate it to 1234 bytes.\nopen FOO, \">>file\" or die;\ntruncate(FOO, 1234);\nclose FOO;\n\n# Truncate a file to 567 bytes.\ntruncate(\"file\", 567);\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: #7060A8;\">get_file_size</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #008000;\">\"test.txt\"</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #0000FF;\">?</span><span style=\"color: #000000;\">set_file_size</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #008000;\">\"test.txt\"</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">100</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #0000FF;\">?</span><span style=\"color: #7060A8;\">get_file_size</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #008000;\">\"test.txt\"</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #0000FF;\">?</span><span style=\"color: #000000;\">set_file_size</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #008000;\">\"test.txt\"</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">1024</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #0000FF;\">?</span><span style=\"color: #7060A8;\">get_file_size</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #008000;\">\"test.txt\"</span><span style=\"color: #0000FF;\">)</span>\n<!--\n","language":"Phix"},{"code":"(de truncate (File Len)\n (native \"@\" \"truncate\" 'I File Len) )\n","language":"PicoLisp"},{"code":"(de truncate (File Len)\n (call \"truncate\" \"-s\" Len File) )\n","language":"PicoLisp"},{"code":"/* Parameters to be read in by the program are: */\n/* 1. the name of the file to be truncated, and */\n/* 2. the size of file after truncation. */\n\ntruncate_file: procedure options (main); /* 12 July 2012 */\n declare (i, n) fixed binary (31);\n declare filename character(50) varying;\n declare in file record input, out file record output;\n\n put ('What is the name of the file to be truncated?');\n get edit (filename) (L);\n put ('What is the length of file to be retained?');\n get (n);\n\n begin;\n declare c(n) character (1), ch character (1);\n\n open file (in) title ('/' || filename || ',type(fixed),recsize(1)' )\n input;\n do i = 1 to n; read file (in) into (ch); c(i) = ch; end;\n close file (in);\n\n open file (out) title ('/' || filename || ',append(n),type(fixed),\n recsize(' || trim(n) || ')' );\n write file (out) from (c);\n close file (out);\n end;\nend truncate_file;\n","language":"PL-I"},{"code":"SUB truncateFile (file AS STRING, length AS DWORD)\n IF LEN(DIR$(file)) THEN\n DIM f AS LONG\n f = FREEFILE\n OPEN file FOR BINARY AS f\n IF length > LOF(f) THEN\n CLOSE f\n ERROR 62 'Input past end\n ELSE\n SEEK f, length + 1\n SETEOF f\n CLOSE f\n END IF\n ELSE\n ERROR 53 'File not found\n END IF\nEND SUB\n","language":"PowerBASIC"},{"code":"Function Truncate-File(fname) {\n $null | Set-Content -Path \"$fname\"\n}\n","language":"PowerShell"},{"code":"Procedure SetFileSize(File$, length.q)\n Protected fh, pos, i\n If FileSize(File$) < length\n Debug \"File to small, is a directory or does not exist.\"\n ProcedureReturn #False\n Else\n fh = OpenFile(#PB_Any, File$)\n FileSeek(fh, length)\n TruncateFile(fh)\n CloseFile(fh)\n EndIf\n ProcedureReturn #True\nEndProcedure\n","language":"PureBasic"},{"code":"def truncate_file(name, length):\n if not os.path.isfile(name):\n return False\n if length >= os.path.getsize(name):\n return False\n with open(name, 'ab') as f:\n f.truncate(length)\n return True\n","language":"Python"},{"code":"truncate_file <- function(filename, n_bytes) {\n\n # check file exists and size is greater than n_bytes\n stopifnot(\n \"file does not exist\"= file.exists(filename),\n \"not enough bytes in file\"= file.size(filename) >= n_bytes\n )\n\n # read bytes from input file\n input.con <- file(filename, \"rb\")\n bindata <- readBin(input.con, integer(), n=n_bytes/4)\n close(input.con)\n\n # write bytes to temporary file\n tmp.filename <- tempfile()\n output.con <- file(tmp.filename, \"wb\")\n writeBin(bindata, output.con)\n close(output.con)\n\n # double check that everything worked before overwriting original file\n stopifnot(\n \"temp file is not expected size\"= file.size(tmp.filename) == n_bytes\n )\n\n # overwrite input file with temporary file\n file.rename(tmp.filename, filename)\n\n}\n","language":"R"},{"code":"#lang racket\n\n(define (truncate file size)\n (unless (file-exists? file) (error 'truncat \"missing file: ~a\" file))\n (when (> size (file-size file)) (printf \"Warning: extending file size.\\n\"))\n (call-with-output-file* file #:exists 'update\n (λ(o) (file-truncate o size))))\n","language":"Racket"},{"code":"use NativeCall;\n\nsub truncate(Str, int32 --> int32) is native {*}\n\nsub MAIN (Str $file, Int $to) {\n given $file.IO {\n .e or die \"$file doesn't exist\";\n .w or die \"$file isn't writable\";\n .s >= $to or die \"$file is not big enough to truncate\";\n }\n truncate($file, $to) == 0 or die \"Truncation was unsuccessful\";\n}\n","language":"Raku"},{"code":"spurt $file, slurp($file).substr($to);\n","language":"Raku"},{"code":"/*REXX program truncates a file to a specified (and smaller) number of bytes. */\nparse arg siz FID /*obtain required arguments from the CL*/\nFID=strip(FID) /*elide FID leading/trailing blanks. */\nif siz=='' then call ser \"No truncation size was specified (1st argument).\"\nif FID=='' then call ser \"No fileID was specified (2nd argument).\"\nif \\datatype(siz,'W') then call ser \"trunc size isn't an integer: \" siz\nif siz<1 then call ser \"trunc size isn't a positive integer: \" siz\n_=charin(FID,1,siz+1) /*position file and read a wee bit more*/\n#=length(_) /*get the length of the part just read.*/\nif #==0 then call ser \"the specified file doesn't exist: \" FID\nif #<siz then call ser \"the file is smaller than trunc size: \" #\ncall lineout FID /*close the file used, just to be safe.*/\n'ERASE' FID /*invoke a command to delete the file */\ncall lineout FID /*close the file, maybe for REXX's use.*/\ncall charout FID, left(_,siz), 1 /*write a truncated version of the file*/\ncall lineout FID /*close the file used, just to be safe.*/\nsay 'file ' FID \" truncated to \" siz 'bytes.' /*display some information to terminal.*/\nexit /*stick a fork in it, we're all done. */\n/*──────────────────────────────────────────────────────────────────────────────────────*/\nser: say '***error***' arg(1); exit 13 /*display an error message and exit. */\n","language":"REXX"},{"code":"/*REXX program truncates a file to a specified (and smaller) number of bytes. */\nparse arg siz FID /*obtain required arguments from the CL*/\nFID=strip(FID) /*elide FID leading/trailing blanks. */\nif siz=='' then call ser \"No truncation size was specified (1st argument).\"\nif FID=='' then call ser \"No fileID was specified (2nd argument).\"\nif \\datatype(siz,'W') then call ser \"trunc size isn't an integer: \" siz\nif siz<1 then call ser \"trunc size isn't a positive integer: \" siz\nchunk=4000 /*read the file with this \"buffer\" size*/\ncall charin fid,1,0 /*position the file pointer to byte # 1*/\n_= /* [↓] read while the length data<siz.*/\n do while length(_)<=siz /* [↓] have we reached End-Of-File ? */\n buffer=charin(FID,,chunk)\n if length(buffer)==0 then leave /*Nothing read? Then we're done reading*/\n _=_ || buffer /*append the chunk to the _ input data*/\n end /*while*/\n#=length(_) /*get the length of the part just read.*/\nif #==0 then call ser \"the specified file doesn't exist: \" FID\nif #<siz then call ser \"the file is smaller than trunc size: \" #\ncall lineout FID /*close the file used, just to be safe.*/\n'ERASE' FID /*invoke a command to delete the file */\ncall lineout FID /*close the file, maybe for REXX's use.*/\ncall charout FID, left(_,siz), 1 /*write a truncated version of the file*/\ncall lineout FID /*close the file used, just to be safe.*/\nsay 'file ' FID \" truncated to \" siz 'bytes.' /*display some information to terminal.*/\nexit /*stick a fork in it, we're all done. */\n/*──────────────────────────────────────────────────────────────────────────────────────*/\nser: say '***error***' arg(1); exit 13 /*display an error message and exit. */\n","language":"REXX"},{"code":"file = \"C:\\Ring\\ReadMe.txt\"\nfp = read(file)\nfpstr = left(fp, 100)\nsee fpstr + nl\nwrite(file, fpstr)\n","language":"Ring"},{"code":"# Open a file for writing, and truncate it to 1234 bytes.\nFile.open(\"file\", \"ab\") do |f|\n f.truncate(1234)\n f << \"Killroy was here\" # write to file\nend # file is closed now.\n\n# Just truncate a file to 567 bytes.\nFile.truncate(\"file\", 567)\n","language":"Ruby"},{"code":"use std::path::Path;\nuse std::fs;\n\nfn truncate_file<P: AsRef<Path>>(filename: P, filesize: usize) -> Result<(), Error> {\n use Error::*;\n let file = fs::read(&filename).or(Err(NotFound))?;\n\n if filesize > file.len() {\n return Err(FilesizeTooSmall)\n }\n\n fs::write(&filename, &file[..filesize]).or(Err(UnableToWrite))?;\n Ok(())\n}\n\n#[derive(Debug)]\nenum Error {\n /// File not found\n NotFound,\n /// Truncated size would be larger than the current size\n FilesizeTooSmall,\n /// Likely due to having read but not write permissions\n UnableToWrite,\n}\n","language":"Rust"},{"code":"import java.io.FileOutputStream\n\nobject TruncFile extends App {\n if (args.length < 2) println(\"Usage: java TruncFile fileName newSize\")\n else { //turn on \"append\" so it doesn't clear the file\n val outChan = new FileOutputStream(args(0), true).getChannel()\n val newSize = args(1).toLong\n outChan.truncate(newSize)\n }\n}\n","language":"Scala"},{"code":"func truncate(filename, len) {\n var file = File(filename);\n len > file.size ->\n && die \"The provided length is greater than the length of the file\";\n file.truncate(len);\n}\n\n# truncate \"file.ext\" to 1234 bytes\ntruncate(\"file.ext\", 1234);\n","language":"Sidef"},{"code":"local\n open Posix.FileSys\n val perm = S.flags [S.irusr, S.iwusr, S.irgrp, S.iwgrp, S.iroth, S.iwoth]\nin\n fun truncate (path, len) =\n let\n val fd = createf (path, O_WRONLY, O.noctty, perm)\n in\n ftruncate (fd, len); Posix.IO.close fd\n end\nend\n","language":"Standard-ML"},{"code":"package require Tcl 8.5\n\nset f [open \"file\" r+];\t# Truncation is done on channels\nchan truncate $f 1234;\t\t# Truncate at a particular length (in bytes)\nclose $f\n","language":"Tcl"},{"code":"# Truncate a file named \"myfile\" to 1440 kilobytes.\nls myfile >/dev/null &&\n dd if=/dev/null of=myfile bs=1 seek=1440k\n","language":"UNIX-Shell"},{"code":"# Truncate a file named \"myfile\" to 1440 kilobytes.\ntruncate -s 1440k myfile\n","language":"UNIX-Shell"},{"code":"# 1. simplest one-liner\n-bash$ >file\n\n# or the more clear/verbose:\necho -n>file\n\n# 2. checks for file as input prior to truncate:\nf=\"file\";echo -n<$f>$f\n\n# double-check file size\nls -1 file # it's trunc\n\n# 3. multiple files (glob)\nglob=$(ls -1 file[0-9]); for f in $glob; do echo -n<$f>$f; done\n\n\n## OUTPUT:\n# 1. one-liner\n-bash-4.2$ echo -n>bad\n+ echo -n\n-bash-4.2$ ls -l bad; cat bad\n+ ls -l bad\n-rw-r--r-- 1 fieldsa fieldsa 0 Dec 4 20:07 bad\n+ cat bad\n-bash-4.2$\n\n# 2. checks\n-bash-4.2$ set -x; f=\"bad\"; echo -n<$f>$f\n+ f=bad\n+ echo -n\n-bash: bad: No such file or directory\n\n# Try again with the shortest version: f=\"bad\"<$f>$f\n+ ls -l bad\n-rw-r--r-- 1 fieldsa fieldsa 8192 Dec 5 01:04 bad\n-bash-4.2$ f=\"bad\" <$f>$f\n+ f=bad\n-bash-4.2$ ls -l\n+ ls -l\n-rw-r--r-- 1 fieldsa fieldsa 0 Dec 5 01:04 bad\n-bash-4.2$ rm bad\n+ rm bad\n-bash-4.2$ f=\"bad\" <$f>$f\n+ f=bad\n-bash: bad: No such file or directory\n\n# Now a bad file exists\n-bash-4.2$ echo 'abc'>bad\n+ echo abc\n-bash-4.2$ ls -l bad;cat<bad\n+ ls -l bad\n-rw-r--r-- 1 fieldsa fieldsa 4 Dec 4 19:21 bad\n+ cat\nabc\n\n-bash-4.2$ f=\"bad\"; echo -n<$f>$f\n+ f=bad\n+ echo -n\n-bash-4.2$ ls -l bad;cat<bad;echo \"_EOF_\"\n+ ls -l bad\n-rw-r--r-- 1 fieldsa fieldsa 0 Dec 4 19:23 bad\n+ cat\n+ echo _EOF_\n_EOF_\n\n-bash-4.2$ rm bad\n+ rm bad\n-bash-4.2$ f=\"bad\" <$f&&echo -n>$f\n+ f=bad\n-bash: bad: No such file or directory\n\n# 4. trunc(): trunc file size # truncate at length\n-bash-4.2$ trunc() { IFS= read -N $2 b<\"$1\"; echo -n \"$b\">\"$1\"; }\n-bash-4.2$ echo \"abcdef\">bad; ls -l bad; cat bad; trunc bad 3; ls -l bad; cat bad; echo \"_EOF_\"\n+ echo abcdef\n+ ls -l bad\n-rw-r--r-- 1 fieldsa fieldsa 7 Dec 4 19:59 bad\n+ cat bad\nabcdef\n+ trunc bad 3\n+ read -N 3 b\n+ echo -n abc\n+ ls -l bad\n-rw-r--r-- 1 fieldsa fieldsa 3 Dec 4 19:59 bad\n+ cat bad\nabc+ echo _EOF_\n_EOF_\n","language":"UNIX-Shell"},{"code":"Sub truncate(fpath,n)\n\t'Check if file exist\n\tSet objfso = CreateObject(\"Scripting.FileSystemObject\")\n\tIf objfso.FileExists(fpath) = False Then\n\t\tWScript.Echo fpath & \" does not exist\"\n\t\tExit Sub\n\tEnd If\n\tcontent = \"\"\n\t'stream the input file\n\tSet objinstream = CreateObject(\"Adodb.Stream\")\n\tWith objinstream\n\t\t.Type = 1\n\t\t.Open\n\t\t.LoadFromFile(fpath)\n\t\t'check if the specified size is larger than the file content\n\t\tIf n <= .Size Then\n\t\t\tcontent = .Read(n)\n\t\tElse\n\t\t\tWScript.Echo \"The specified size is larger than the file content\"\n\t\t\tExit Sub\n\t\tEnd If\n\t\t.Close\n\tEnd With\n\t'write the truncated version\n\tSet objoutstream = CreateObject(\"Adodb.Stream\")\n\tWith objoutstream\n\t\t.Type = 1\n\t\t.Open\n\t\t.Write content\n\t\t.SaveToFile fpath,2\n\t\t.Close\n\tEnd With\n\tSet objinstream = Nothing\n\tSet objoutstream = Nothing\n\tSet objfso = Nothing\nEnd Sub\n\n'testing\nCall truncate(\"C:\\temp\\test.txt\",30)\n","language":"VBScript"},{"code":"import \"./ioutil\" for FileUtil\n\nvar fileName = \"temp.txt\"\n\n// create a file of length 26 bytes\nFileUtil.write(fileName, \"abcdefghijklmnopqrstuvwxyz\")\nSystem.print(\"Contents before truncation: %(FileUtil.read(fileName))\")\n\n// truncate file to 13 bytes\nFileUtil.truncate(fileName, 13)\nSystem.print(\"Contents after truncation : %(FileUtil.read(fileName))\")\n\n// attempt to truncate file to 20 bytes\nFileUtil.truncate(fileName, 20)\nSystem.print(\"Contents are still : %(FileUtil.read(fileName))\")\n","language":"Wren"},{"code":"int I, Size, FD;\nchar C, FN(80), Array;\n[I:= 0; \\get file name from command line\nloop [C:= ChIn(8);\n if C = $20 \\space\\ then quit;\n FN(I):= C;\n I:= I+1;\n ];\nFN(I):= 0;\nSize:= IntIn(8); \\get number of bytes from command line\nif Size = 0 then [Text(0, \"Length not found (or zero)\"); exit 1];\n\nTrap(false); \\disable abort on errors\nFD:= FOpen(FN, 0); \\open specified file for input\nFSet(FD, ^i);\nOpenI(3);\nif GetErr then [Text(0, \"File not found\"); exit 1];\n\nArray:= Reserve(0); \\64MB available if no procedures are called\nfor I:= 0 to Size-1 do \\read specified number of bytes\n [Array(I):= ChIn(3);\n if GetErr then [Text(0, \"File is too short\"); exit 1];\n ]; \\if end of file encountered, show error\nFClose(FD);\n\nFD:= FOpen(FN, 1); \\open file by same name for output\nFSet(FD, ^o);\nOpenO(3);\nif GetErr then [Text(0, \"Output error\"); exit 1];\nfor I:= 0 to Size-1 do ChOut(3, Array(I));\nClose(3);\n]\n","language":"XPL0"},{"code":"10 CLEAR 29999\n20 INPUT \"Which file do you want to truncate?\";f$\n30 PRINT \"Start tape to load file to truncate.\"\n40 LOAD f$ CODE 30000\n50 \"Input how many bytes do you want to keep?\";n\n60 PRINT \"Please rewind the tape and press record.\"\n70 SAVE f$ CODE 30000,n\n80 STOP\n","language":"ZX-Spectrum-Basic"}],"string":"[\n {\n \"code\": \"---\\ncategory:\\n- File System Operations\\nfrom: http://rosettacode.org/wiki/Truncate_a_file\\n\",\n \"language\": \"00-META\"\n },\n {\n \"code\": \";Task:\\nTruncate a file to a specific length. This should be implemented as a routine that takes two parameters: the filename and the required file length (in bytes).\\n\\n\\nTruncation can be achieved using system or library calls intended for such a task, if such methods exist, or by creating a temporary file of a reduced size and renaming it, after first deleting the original file, if no other method is available. The file may contain non human readable binary data in an unspecified format, so the routine should be \\\"binary safe\\\", leaving the contents of the untruncated part of the file unchanged.\\n\\nIf the specified filename does not exist, or the provided length is not less than the current file length, then the routine should raise an appropriate error condition. \\n\\nOn some systems, the provided file truncation facilities might not change the file or may extend the file, if the specified length is greater than the current length of the file. \\n\\nThis task permits the use of such facilities. However, such behaviour should be noted, or optionally a warning message relating to an non change or increase in file size may be implemented.\\n<br><br>\\n\\n\",\n \"language\": \"00-TASK\"\n },\n {\n \"code\": \"F truncate_file(name, length)\\n I !fs:is_file(name)\\n R 0B\\n I length >= fs:file_size(name)\\n R 0B\\n fs:resize_file(name, length)\\n R 1B\\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\\nBYTE FUNC Find(CHAR ARRAY text CHAR c)\\n BYTE i\\n\\n i=1\\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 MakeRenameCommand(CHAR ARRAY left,right,result)\\n BYTE i,len,pos\\n\\n SCopy(result,left)\\n len=left(0)+1\\n result(len)=32\\n pos=Find(right,':)\\n FOR i=pos+1 TO right(0)\\n DO\\n len==+1\\n result(len)=right(i)\\n OD\\n result(0)=len\\nRETURN\\n\\nPROC DeleteFile(CHAR ARRAY fname)\\n BYTE dev=[1]\\n\\n Close(dev)\\n Xio(dev,0,33,0,0,fname)\\nRETURN\\n\\nPROC TruncateFile(CHAR ARRAY fname CARD maxlen)\\n DEFINE BUF_LEN=\\\"100\\\"\\n CHAR ARRAY tmp=\\\"D:TEMP.TMP\\\",cmd(255)\\n BYTE in=[1], out=[2]\\n BYTE ARRAY buff(BUF_LEN)\\n CARD len,size\\n\\n Close(in)\\n Close(out)\\n Open(in,fname,4)\\n Open(out,tmp,8)\\n\\n DO\\n IF maxlen>BUF_LEN THEN\\n size=BUF_LEN\\n ELSE\\n size=maxlen\\n FI\\n len=Bget(in,buff,size)\\n maxlen==-len\\n IF len>0 THEN\\n Bput(out,buff,len)\\n FI\\n UNTIL len#BUF_LEN\\n OD\\n\\n Close(in)\\n Close(out)\\n\\n MakeRenameCommand(tmp,fname,cmd)\\n DeleteFile(fname)\\n Rename(cmd)\\nRETURN\\n\\nPROC Main()\\n CHAR ARRAY filter=\\\"D:*.*\\\", fname=\\\"D:INPUT.TXT\\\"\\n CARD len=[400]\\n\\n Put(125) PutE() ;clear screen\\n\\n PrintF(\\\"Dir \\\"\\\"%S\\\"\\\"%E\\\",filter)\\n Dir(filter)\\n\\n PrintF(\\\"Truncate \\\"\\\"%S\\\"\\\" to %U bytes.%E%E\\\",fname,len)\\n TruncateFile(fname,len)\\n\\n PrintF(\\\"Dir \\\"\\\"%S\\\"\\\"%E\\\",filter)\\n Dir(filter)\\nRETURN\\n\",\n \"language\": \"Action-\"\n },\n {\n \"code\": \"with Ada.Command_Line, Ada.Sequential_IO, Ada.Directories;\\n\\nprocedure Truncate_File is\\n\\n type Byte is mod 256;\\n for Byte'Size use 8;\\n\\n package Byte_IO is new Ada.Sequential_IO(Byte);\\n\\n function Arg(N: Positive) return String renames Ada.Command_Line.Argument;\\n function Args return Natural renames Ada.Command_Line.Argument_Count;\\n\\nbegin\\n -- give help output if neccessary\\n if Args < 2 or else Args > 3 then\\n raise Program_Error\\n with \\\"usage: truncate_file <filename> <length> [<temp_file>]\\\";\\n end if;\\n\\n -- now do the real work\\n declare\\n File_Name: String := Arg(1);\\n Temp_Name: String := (if Args = 2 then Arg(1) & \\\".tmp\\\" else Arg(3));\\n -- an Ada 2012 conditional expression\\n File, Temp: Byte_IO.File_Type;\\n Count: Natural := Natural'Value(Arg(2));\\n Value: Byte;\\n begin\\n -- open files\\n Byte_IO.Open (File => File, Mode => Byte_IO.In_File, Name => File_Name);\\n Byte_IO.Create(File => Temp, Mode => Byte_IO.Out_File, Name => Temp_Name);\\n\\n -- copy the required bytes (but at most as much as File has) from File to Temp\\n while (not Byte_IO.End_Of_File(File)) and Count > 0 loop\\n Byte_IO.Read (File, Value);\\n Byte_IO.Write(Temp, Value);\\n Count := Count - 1;\\n end loop;\\n\\n -- close files\\n Byte_IO.Close(Temp);\\n Byte_IO.Close(File);\\n\\n if Count = 0 then -- File was at least Count bytes long\\n -- remove File and rename Temp to File\\n Ada.Directories.Delete_File(Name => File_Name);\\n Ada.Directories.Rename(Old_Name => Temp_Name, New_Name => File_Name);\\n else -- File was too short\\n -- remove Temp and leave File as it is, output error\\n Ada.Directories.Delete_File(Name => Temp_Name);\\n raise Program_Error\\n with \\\"Size of \\\"\\\"\\\" & File_Name & \\\"\\\"\\\" less than \\\" & Arg(2);\\n end if;\\n end;\\nend Truncate_File;\\n\",\n \"language\": \"Ada\"\n },\n {\n \"code\": \"truncFile(\\\"S:\\\\Portables\\\\AutoHotkey\\\\My Scripts\\\\Other_Codes\\\\motion2.ahk\\\", 1200)\\nreturn\\n\\ntruncFile(file, length_bytes){\\n\\tif !FileExist(file)\\n\\t\\tmsgbox, File doesn't exists.\\n\\tFileGetSize, fsize, % file, B\\n\\tif (length_bytes>fsize)\\n\\t\\tmsgbox, New truncated size more than current file size\\n\\tf := FileOpen(file, \\\"rw\\\")\\n\\tf.length := length_bytes\\n\\tf.close()\\n}\\n\",\n \"language\": \"AutoHotkey\"\n },\n {\n \"code\": \"# syntax: GAWK -f TRUNCATE_A_FILE.AWK\\nBEGIN {\\n main(\\\"NOTHERE\\\",100)\\n main(\\\"FILENAME.TMP\\\",-1)\\n main(\\\"FILENAME.TMP\\\",500)\\n exit(0)\\n}\\nfunction main(filename,size, ret) {\\n ret = truncate_file(filename,size)\\n if (ret != \\\"\\\") {\\n printf(\\\"error: FILENAME=%s, %s\\\\n\\\",filename,ret)\\n }\\n}\\nfunction truncate_file(filename,size, cmd,fnr,msg,old_BINMODE,old_RS,rec) {\\n cmd = sprintf(\\\"ls --full-time -o %s\\\",filename)\\n if (size < 0) {\\n return(\\\"size cannot be negative\\\")\\n }\\n old_BINMODE = BINMODE\\n old_RS = RS\\n BINMODE = 3\\n RS = \\\"[^\\\\x00-\\\\xFF]\\\"\\n while (getline rec <filename > 0) {\\n fnr++\\n }\\n close(filename)\\n if (fnr == 0) {\\n msg = \\\"file not found\\\"\\n }\\n if (fnr > 1) {\\n msg = \\\"choose a different RecordSeparator\\\"\\n }\\n if (msg == \\\"\\\") { # no errors\\n system(cmd) # optional: show filesize before truncation\\n if (length(rec) > size) {\\n rec = substr(rec,1,size)\\n }\\n printf(\\\"%s\\\",rec) >filename\\n close(filename)\\n system(cmd) # optional: show filesize after truncation\\n }\\n BINMODE = old_BINMODE\\n RS = old_RS\\n return(msg)\\n}\\n\",\n \"language\": \"AWK\"\n },\n {\n \"code\": \"SUB truncateFile (file AS STRING, length AS LONG)\\n IF LEN(DIR$(file)) THEN\\n DIM f AS LONG, c AS STRING\\n f = FREEFILE\\n OPEN file FOR BINARY AS f\\n IF length > LOF(f) THEN\\n CLOSE f\\n ERROR 62 'Input past end of file\\n ELSE\\n c = SPACE$(length)\\n GET #f, 1, c\\n CLOSE f\\n OPEN file FOR OUTPUT AS f\\n PRINT #f, c;\\n CLOSE f\\n END IF\\n ELSE\\n ERROR 53\\n END IF\\nEND SUB\\n\",\n \"language\": \"BASIC\"\n },\n {\n \"code\": \" DEF PROCtruncate(file$, size%)\\n LOCAL file%\\n file% = OPENUP(file$)\\n IF file%=0 ERROR 100, \\\"Could not open file\\\"\\n EXT#file% = size%\\n CLOSE #file%\\n ENDPROC\\n\",\n \"language\": \"BBC-BASIC\"\n },\n {\n \"code\": \"( ( trunc\\n = name length elif file c\\n . !arg:(?name,?length)\\n & fil$(!name,rb)\\n & fil$(,DEC,1)\\n & :?elif\\n & whl\\n ' ( !length+-1:?length:~<0\\n & fil$() !elif:?elif\\n )\\n & (fil$(,SET,-1)|)\\n & whl'(!elif:%?c ?elif&!c !file:?file)\\n & fil$(!name,wb)\\n & fil$(,DEC,1)\\n & whl'(!file:%?c ?file&fil$(,,1,!c))\\n & (fil$(,SET,-1)|)\\n & !length:<0\\n )\\n& put$(\\\"I have a secret to tell you. Listen:\\\",\\\"test.txt\\\",NEW)\\n& ( trunc$(\\\"test.txt\\\",20)&out$(get$(\\\"test.txt\\\",STR))\\n | out$\\\"File too short\\\"\\n )\\n);\\n\",\n \"language\": \"Bracmat\"\n },\n {\n \"code\": \"#include <windows.h>\\n#include <stdio.h>\\n#include <wchar.h>\\n\\n/* Print \\\"message: last Win32 error\\\" to stderr. */\\nvoid\\noops(const wchar_t *message)\\n{\\n\\twchar_t *buf;\\n\\tDWORD error;\\n\\n\\tbuf = NULL;\\n\\terror = GetLastError();\\n\\tFormatMessageW(FORMAT_MESSAGE_ALLOCATE_BUFFER |\\n\\t FORMAT_MESSAGE_FROM_SYSTEM | FORMAT_MESSAGE_IGNORE_INSERTS,\\n\\t NULL, error, 0, (wchar_t *)&buf, 0, NULL);\\n\\n\\tif (buf) {\\n\\t\\tfwprintf(stderr, L\\\"%ls: %ls\\\", message, buf);\\n\\t\\tLocalFree(buf);\\n\\t} else {\\n\\t\\t/* FormatMessageW failed. */\\n\\t\\tfwprintf(stderr, L\\\"%ls: unknown error 0x%x\\\\n\\\",\\n\\t\\t message, error);\\n\\t}\\n}\\n\\nint\\ndotruncate(wchar_t *fn, LARGE_INTEGER fp)\\n{\\n\\tHANDLE fh;\\n\\n\\tfh = CreateFileW(fn, GENERIC_WRITE, 0, NULL, OPEN_EXISTING, 0, NULL);\\n\\tif (fh == INVALID_HANDLE_VALUE) {\\n\\t\\toops(fn);\\n\\t\\treturn 1;\\n\\t}\\n\\n\\tif (SetFilePointerEx(fh, fp, NULL, FILE_BEGIN) == 0 ||\\n\\t SetEndOfFile(fh) == 0) {\\n\\t\\toops(fn);\\n\\t\\tCloseHandle(fh);\\n\\t\\treturn 1;\\n\\t}\\n\\n\\tCloseHandle(fh);\\n\\treturn 0;\\n}\\n\\n/*\\n * Truncate or extend a file to the given length.\\n */\\nint\\nmain()\\n{\\n\\tLARGE_INTEGER fp;\\n\\tint argc;\\n\\twchar_t **argv, *fn, junk[2];\\n\\n\\t/* MinGW never provides wmain(argc, argv). */\\n\\targv = CommandLineToArgvW(GetCommandLineW(), &argc);\\n\\tif (argv == NULL) {\\n\\t\\toops(L\\\"CommandLineToArgvW\\\");\\n\\t\\treturn 1;\\n\\t}\\n\\n\\tif (argc != 3) {\\n\\t\\tfwprintf(stderr, L\\\"usage: %ls filename length\\\\n\\\", argv[0]);\\n\\t\\treturn 1;\\n\\t}\\n\\n\\tfn = argv[1];\\n\\n\\t/* fp = argv[2] converted to a LARGE_INTEGER. */\\n\\tif (swscanf(argv[2], L\\\"%lld%1ls\\\", &fp.QuadPart, &junk) != 1) {\\n\\t\\tfwprintf(stderr, L\\\"%ls: not a number\\\\n\\\", argv[2]);\\n\\t\\treturn 1;\\n\\t}\\n\\n\\treturn dotruncate(fn, fp);\\n}\\n\",\n \"language\": \"C\"\n },\n {\n \"code\": \"#include <unistd.h>\\n#include <sys/types.h>\\n\\n...\\ntruncate(filename, length);\\nftruncate(fd, length);\\n...\\n\",\n \"language\": \"C\"\n },\n {\n \"code\": \"#include <string>\\n#include <fstream>\\n\\nusing namespace std;\\n\\nvoid truncateFile(string filename, int max_size) {\\n std::ifstream input( filename, std::ios::binary );\\n char buffer;\\n string outfile = filename + \\\".trunc\\\";\\n ofstream appendFile(outfile, ios_base::out);\\n for(int i=0; i<max_size; i++) {\\n input.read( &buffer, sizeof(buffer) );\\n appendFile.write(&buffer,1);\\n }\\n appendFile.close(); }\\n\\nint main () {\\n truncateFile(\\\"test.txt\\\", 5);\\n return 0;\\n}\\n\",\n \"language\": \"C++\"\n },\n {\n \"code\": \"using System;\\nusing System.IO;\\n\\nnamespace TruncateFile\\n{\\n internal class Program\\n {\\n private static void Main(string[] args)\\n {\\n TruncateFile(args[0], long.Parse(args[1]));\\n }\\n\\n private static void TruncateFile(string path, long length)\\n {\\n if (!File.Exists(path))\\n throw new ArgumentException(\\\"No file found at specified path.\\\", \\\"path\\\");\\n\\n using (var fileStream = new FileStream(path, FileMode.Open, FileAccess.Write))\\n {\\n if (fileStream.Length < length)\\n throw new ArgumentOutOfRangeException(\\\"length\\\",\\n \\\"The specified length is greater than that of the file.\\\");\\n\\n fileStream.SetLength(length);\\n }\\n }\\n }\\n}\\n\",\n \"language\": \"C-sharp\"\n },\n {\n \"code\": \"(defn truncate [file size]\\n (with-open [chan (.getChannel (java.io.FileOutputStream. file true))]\\n (.truncate chan size)))\\n\\n(truncate \\\"truncate_test.txt\\\" 2)\\n\",\n \"language\": \"Clojure\"\n },\n {\n \"code\": \"import std.file, std.exception;\\n\\nvoid truncateFile(in string name, in size_t newSize) {\\n if (!exists(name) || !isFile(name))\\n throw new Exception(\\\"File not found.\\\");\\n\\n auto size = getSize(name);\\n if (size <= newSize)\\n throw new Exception(\\n \\\"New size must be smaller than original size.\\\");\\n\\n auto content = cast(ubyte[])read(name, newSize);\\n if (content.length != newSize)\\n throw new Exception(\\\"Reading file failed.\\\");\\n\\n write(name, content);\\n enforce(getSize(name) == newSize);\\n}\\n\\nvoid main() {\\n truncateFile(\\\"truncate_test.txt\\\", 0);\\n}\\n\",\n \"language\": \"D\"\n },\n {\n \"code\": \"procedure TruncateFile(FileName : string; NewSize : integer);\\nvar\\n aFile: file of byte;\\nbegin\\n Assign(aFile, FileName);\\n Reset(aFile);\\n try\\n Seek(afile, NewSize);\\n Truncate(aFile);\\n finally\\n Close(afile);\\n end;\\nend;\\n\",\n \"language\": \"Delphi\"\n },\n {\n \"code\": \"procedure TruncateFile(FileName : string; NewSize : integer);\\nvar\\n Stream : TFileStream;\\nbegin\\n Stream := TFileStream.Create(FileName, fmOpenReadWrite, fmShareExclusive);\\n try\\n Stream.Size := NewSize;\\n finally\\n Stream.Free;\\n end;\\nend;\\n\",\n \"language\": \"Delphi\"\n },\n {\n \"code\": \"import system'io;\\nimport extensions;\\n\\nextension fileOp : File\\n{\\n set Length(int len)\\n {\\n auto stream := FileStream.openForEdit(self);\\n\\n stream.Length := len;\\n\\n stream.close()\\n }\\n}\\n\\npublic program()\\n{\\n if (program_arguments.Length != 3)\\n { console.printLine(\\\"Please provide the path to the file and a new length\\\"); AbortException.raise() };\\n\\n auto file := File.assign(program_arguments[1]);\\n var length := program_arguments[2].toInt();\\n\\n ifnot(file.Available)\\n { console.printLine(\\\"File \\\",file,\\\" does not exist\\\"); AbortException.raise() };\\n\\n file.Length := length\\n}\\n\",\n \"language\": \"Elena\"\n },\n {\n \"code\": \"-module( truncate ).\\n\\n-export( [file/2] ).\\n\\nfile( Name, Size ) ->\\n\\t{file_exists, true} = {file_exists, filelib:is_file( Name )},\\n\\t{ok, IO} = file:open( Name, [read, write] ),\\n\\t{ok, Max} = file:position( IO, eof ),\\n\\t{correct_size, true} = {correct_size, (Size < Max)},\\n\\t{ok, Size} = file:position( IO, {bof, Size} ),\\n\\tok = file:truncate( IO ).\\n\",\n \"language\": \"Erlang\"\n },\n {\n \"code\": \"open System\\nopen System.IO\\n\\nlet truncateFile path length =\\n if not (File.Exists(path)) then failwith (\\\"File not found: \\\" + path)\\n use fileStream = new FileStream(path, FileMode.Open, FileAccess.Write)\\n if (fileStream.Length < length) then failwith \\\"The specified length is greater than the current file length.\\\"\\n fileStream.SetLength(length)\\n\\n[<EntryPoint>]\\nlet main args =\\n truncateFile args.[0] (Int64.Parse(args.[1]))\\n 0\\n\",\n \"language\": \"F-Sharp\"\n },\n {\n \"code\": \": truncate-file ( fname fnamelen fsize -- )\\n 0 2swap r/w open-file throw\\n dup >r resize-file throw\\n r> close-file throw ;\\n\",\n \"language\": \"Forth\"\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,NB)\\n CHARACTER*(*) FNAME\\t!Name for the file.\\n INTEGER NB\\t\\t!Number of bytes to survive.\\n INTEGER L\\t\\t!A counter for te length of the file.\\n INTEGER F,T\\t\\t!Mnemonics for file unit numbers.\\n PARAMETER (F=66,T=67)\\t!These should do.\\n LOGICAL EXIST\\t\\t!Same as the mnemonic so left/right can be forgotten.\\n CHARACTER*1 B\\t\\t!The worker!\\n IF (FNAME.EQ.\\\"\\\") CALL CROAK(\\\"Blank file name!\\\")\\n IF (NB.LE.0) CALL CROAK(\\\"Chop 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=\\\"READWRITE\\\",\\t!Grab the source file.\\n 1 FORM=\\\"UNFORMATTED\\\",RECL=1,ACCESS=\\\"DIRECT\\\")\\t\\t!Oh dear.\\n OPEN (T,STATUS=\\\"SCRATCH\\\",FORM=\\\"UNFORMATTED\\\",RECL=1)\\t!Request a temporary file.\\n\\nCopy the desired \\\"records\\\" to the temporary file.\\n 10 DO L = 1,NB\\t!Only up to a point.\\n READ (F,REC = L,ERR = 20) B\\t!One whole byte!\\n WRITE (T) B\\t\\t\\t!And, write it too!\\n END DO\\t\\t!Again.\\n 20 IF (L.LE.NB) CALL CROAK(\\\"Short file!\\\")\\t!Should end the loop with L = NB + 1.\\nConvert from input to output...\\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 DO L = 1,NB\\t!A certain number only.\\n READ (T) B\\t\\t!One at at timne.\\n WRITE (F,\\\"(A1,$)\\\") B\\t!The $, obviously, means no end-of-record appendage.\\n END DO\\t\\t!And again.\\nCompleted.\\n 30 CLOSE(T)\\t!Abandon the temporary file.\\n CLOSE(F)\\t!Finished with the source file.\\n END\\t\\t!Done.\\n\\n PROGRAM CHOPPER\\n CALL FILEHACK(\\\"foobar.txt\\\",12)\\n END\\n\",\n \"language\": \"Fortran\"\n },\n {\n \"code\": \"Sub truncateFile (archivo As String, longitud As Long)\\n If Len(Dir(archivo)) Then\\n Dim f As Long, c As String\\n f = Freefile\\n Open archivo For Binary As #f\\n If longitud > Lof(f) Then\\n Close #f\\n Error 62 'Input past end of file\\n Else\\n c = Space(longitud)\\n Get #f, 1, c\\n Close f\\n Open archivo For Output As #f\\n Print #f, c;\\n Close #f\\n End If\\n Else\\n Error 53 'File not found\\n End If\\nEnd Sub\\n\",\n \"language\": \"FreeBASIC\"\n },\n {\n \"code\": \"import (\\n \\\"fmt\\\"\\n \\\"os\\\"\\n)\\n\\nif err := os.Truncate(\\\"filename\\\", newSize); err != nil {\\n fmt.Println(err)\\n}\\n\",\n \"language\": \"Go\"\n },\n {\n \"code\": \"setFileSize :: FilePath -> FileOffset -> IO ()\\n-- Truncates the file down to the specified length.\\n-- If the file was larger than the given length\\n-- before this operation was performed the extra is lost.\\n-- Note: calls truncate.\\n\",\n \"language\": \"Haskell\"\n },\n {\n \"code\": \"truncate(f := open(filename, \\\"bu\\\"), newsizeinbytes) & close(f)\\n\",\n \"language\": \"Icon\"\n },\n {\n \"code\": \"require 'files' NB. needed for versions prior to J7\\nftruncate=: ] fwrite~ ] fread@; 0 , [\\n\",\n \"language\": \"J\"\n },\n {\n \"code\": \" (1000$ 'abcdefg') fwrite 'text.txt' NB. create test file\\n 567 ftruncate 'test.txt' NB. truncate test file\\n567\\n fsize 'test.txt' NB. check new file size\\n567\\n\",\n \"language\": \"J\"\n },\n {\n \"code\": \"import java.io.FileOutputStream;\\nimport java.io.IOException;\\nimport java.nio.channels.FileChannel;\\n\\npublic class TruncFile {\\n\\tpublic static void main(String[] args) throws IOException{\\n\\t\\tif(args.length < 2){\\n\\t\\t\\tSystem.out.println(\\\"Usage: java TruncFile fileName newSize\\\");\\n\\t\\t\\treturn;\\n\\t\\t}\\n\\t\\t//turn on \\\"append\\\" so it doesn't clear the file\\n\\t\\tFileChannel outChan = new FileOutputStream(args[0], true).getChannel();\\n\\t\\tlong newSize = Long.parseLong(args[1]);\\n\\t\\toutChan.truncate(newSize);\\n\\t\\toutChan.close();\\n\\t}\\n}\\n\",\n \"language\": \"Java\"\n },\n {\n \"code\": \"function truncate_file(fname, size):\\n open(fname, \\\"r+\\\") do f\\n truncate(f, size)\\n end\\nend\\n\",\n \"language\": \"Julia\"\n },\n {\n \"code\": \"// version 1.1.2\\n\\nimport java.io.FileOutputStream\\nimport java.nio.channels.FileChannel\\n\\nfun truncateFile(fileName: String, newSize: Long) {\\n var fc: FileChannel? = null\\n try {\\n fc = FileOutputStream(fileName, true).channel\\n if (newSize >= fc.size())\\n println(\\\"Requested file size isn't less than existing size\\\")\\n else\\n fc.truncate(newSize)\\n }\\n catch (ex: Exception) {\\n println(ex.message)\\n }\\n finally {\\n fc!!.close()\\n }\\n}\\n\\nfun main(args: Array<String>) {\\n truncateFile(\\\"test.txt\\\", 10)\\n}\\n\",\n \"language\": \"Kotlin\"\n },\n {\n \"code\": \"define file_truncate(path::string, size::integer) => {\\n\\n\\tlocal(file = file(#path))\\n\\n\\tfail_if(not(#file -> exists), -1, 'There is no file at the given path')\\n\\tfail_if(#file -> size < #size, -1, 'No point in truncating a file to a larger size than it already is')\\n\\n\\t#file -> setSize(#size)\\n\\n}\\nlocal(filepath = '//Library/WebServer/Documents/Lasso9cli/trunk/testing/lorem_ipsum_long.txt')\\n\\nstdoutnl(file(#filepath) -> readbytes)\\nstdoutnl('Original size: ' + file(#filepath) -> size)\\n\\nfile_truncate(#filepath, 300)\\n\\nstdoutnl(file(#filepath) -> readbytes)\\nstdout(file('Truncated size: ' + #filepath) -> size)\\n\",\n \"language\": \"Lasso\"\n },\n {\n \"code\": \"dim info$( 50, 50) ' NB pre-dimension before calling file-exists\\n ' needed for file-exists function\\nopen \\\"test.dat\\\" for output as #1 'create file\\n for i = 1 to 10000\\n #1 chr$( int( 256 *rnd( 1)));\\n next\\nclose #1\\n\\ncall truncateFile, \\\"test.dat\\\", 5000\\n\\nwait\\n\\nsub truncateFile fn$, length\\n if fileExists( DefaultDir$, fn$) =0 then notice \\\"No such file\\\": exit sub\\n open fn$ for input as #i\\n file$ =input$( #i, lof( #i))\\n if len( file$) <length then notice \\\"Too short\\\": close #i: exit sub\\n file$ =left$( file$, length)\\n close #i\\n open \\\"test.dat\\\" for output as #o\\n #o file$\\n close #o\\nend sub\\n\\nfunction fileExists( path$, filename$)\\n files path$, filename$, info$()\\n fileExists =val( info$( 0, 0)) 'non zero is true\\nend function\\n\\nend\\n\",\n \"language\": \"Liberty-BASIC\"\n },\n {\n \"code\": \"----------------------------------------\\n-- Truncates file\\n-- @param {string} filename\\n-- @param {integer} length\\n-- @return {bool} success\\n----------------------------------------\\non truncate (filename, length)\\n fp = xtra(\\\"fileIO\\\").new()\\n fp.openFile(filename, 0)\\n if fp.status() then return false\\n if fp.getLength()=length then\\n -- nothing to do\\n fp.closeFile()\\n return true\\n end if\\n data = fp.readByteArray(length)\\n if data.length<>length then\\n fp.closeFile()\\n return false\\n end if\\n fp.delete()\\n fp.createFile(filename)\\n fp.openFile(filename, 2)\\n fp.writeByteArray(data)\\n ok = fp.status()=0\\n fp.closeFile()\\n return ok\\nend\\n\",\n \"language\": \"Lingo\"\n },\n {\n \"code\": \"-- truncates file to 10 KB length\\nbx_file_truncate(_movie.path&\\\"foo.dat\\\", 10240)\\n\",\n \"language\": \"Lingo\"\n },\n {\n \"code\": \"function truncate (filename, length)\\n local inFile = io.open(filename, 'r')\\n if not inFile then\\n error(\\\"Specified filename does not exist\\\")\\n end\\n local wholeFile = inFile:read(\\\"*all\\\")\\n inFile:close()\\n if length >= wholeFile:len() then\\n error(\\\"Provided length is not less than current file length\\\")\\n end\\n local outFile = io.open(filename, 'w')\\n outFile:write(wholeFile:sub(1, length))\\n outFile:close()\\nend\\n\",\n \"language\": \"Lua\"\n },\n {\n \"code\": \"Truncate[file_, n_] := Module[{filename = file, nbbytes = n, temp},\\n temp = $TemporaryPrefix <> filename;\\n BinaryWrite[temp, BinaryReadList[filename, \\\"Byte\\\", nbbytes]];\\n Close[temp]; DeleteFile[filename]; RenameFile[temp, filename];\\n ]\\n\",\n \"language\": \"Mathematica\"\n },\n {\n \"code\": \"function truncate_a_file(fn,count);\\n\\nfid=fopen(fn,'r');\\ns = fread(fid,count,'uint8');\\nfclose(fid);\\n\\nfid=fopen(fn,'w');\\ns = fwrite(fid,s,'uint8');\\nfclose(fid);\\n\",\n \"language\": \"MATLAB\"\n },\n {\n \"code\": \"import posix\\n\\ndiscard truncate(\\\"filename\\\", 1024)\\n\",\n \"language\": \"Nim\"\n },\n {\n \"code\": \"val truncate : string -> int -> unit\\n(** Truncates the named file to the given size. *)\\n\",\n \"language\": \"OCaml\"\n },\n {\n \"code\": \"val ftruncate : file_descr -> int -> unit\\n(** Truncates the file corresponding to the given descriptor to the given size. *)\\n\",\n \"language\": \"OCaml\"\n },\n {\n \"code\": \"install(\\\"truncate\\\", \\\"isL\\\", \\\"trunc\\\")\\n\\ntrunc(\\\"/tmp/test.file\\\", 20)\\n\",\n \"language\": \"PARI-GP\"\n },\n {\n \"code\": \"Program FileTruncate;\\n\\nuses\\n SysUtils;\\n\\nvar\\n myfile: file of byte;\\n filename: string;\\n position: integer;\\n\\nbegin\\n write('File for truncation: ');\\n readln(filename);\\n if not FileExists(filename) then\\n begin\\n writeln('Error: File does not exist.');\\n exit;\\n end;\\n\\n write('Truncate position: ');\\n readln(position);\\n\\n Assign(myfile, filename);\\n Reset(myfile);\\n if FileSize(myfile) < position then\\n begin\\n writeln('Warning: The file \\\"', filename, '\\\" is too short. No need to truncate at position ', position);\\n Close(myfile);\\n exit;\\n end;\\n\\n Seek(myfile, position);\\n Truncate(myfile);\\n Close(myfile);\\n writeln('File \\\"', filename, '\\\" truncated at position ', position, '.');\\nend.\\n\",\n \"language\": \"Pascal\"\n },\n {\n \"code\": \"# Open a file for writing, and truncate it to 1234 bytes.\\nopen FOO, \\\">>file\\\" or die;\\ntruncate(FOO, 1234);\\nclose FOO;\\n\\n# Truncate a file to 567 bytes.\\ntruncate(\\\"file\\\", 567);\\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: #7060A8;\\\">get_file_size</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #008000;\\\">\\\"test.txt\\\"</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #0000FF;\\\">?</span><span style=\\\"color: #000000;\\\">set_file_size</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #008000;\\\">\\\"test.txt\\\"</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">100</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #0000FF;\\\">?</span><span style=\\\"color: #7060A8;\\\">get_file_size</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #008000;\\\">\\\"test.txt\\\"</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #0000FF;\\\">?</span><span style=\\\"color: #000000;\\\">set_file_size</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #008000;\\\">\\\"test.txt\\\"</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">1024</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #0000FF;\\\">?</span><span style=\\\"color: #7060A8;\\\">get_file_size</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #008000;\\\">\\\"test.txt\\\"</span><span style=\\\"color: #0000FF;\\\">)</span>\\n<!--\\n\",\n \"language\": \"Phix\"\n },\n {\n \"code\": \"(de truncate (File Len)\\n (native \\\"@\\\" \\\"truncate\\\" 'I File Len) )\\n\",\n \"language\": \"PicoLisp\"\n },\n {\n \"code\": \"(de truncate (File Len)\\n (call \\\"truncate\\\" \\\"-s\\\" Len File) )\\n\",\n \"language\": \"PicoLisp\"\n },\n {\n \"code\": \"/* Parameters to be read in by the program are: */\\n/* 1. the name of the file to be truncated, and */\\n/* 2. the size of file after truncation. */\\n\\ntruncate_file: procedure options (main); /* 12 July 2012 */\\n declare (i, n) fixed binary (31);\\n declare filename character(50) varying;\\n declare in file record input, out file record output;\\n\\n put ('What is the name of the file to be truncated?');\\n get edit (filename) (L);\\n put ('What is the length of file to be retained?');\\n get (n);\\n\\n begin;\\n declare c(n) character (1), ch character (1);\\n\\n open file (in) title ('/' || filename || ',type(fixed),recsize(1)' )\\n input;\\n do i = 1 to n; read file (in) into (ch); c(i) = ch; end;\\n close file (in);\\n\\n open file (out) title ('/' || filename || ',append(n),type(fixed),\\n recsize(' || trim(n) || ')' );\\n write file (out) from (c);\\n close file (out);\\n end;\\nend truncate_file;\\n\",\n \"language\": \"PL-I\"\n },\n {\n \"code\": \"SUB truncateFile (file AS STRING, length AS DWORD)\\n IF LEN(DIR$(file)) THEN\\n DIM f AS LONG\\n f = FREEFILE\\n OPEN file FOR BINARY AS f\\n IF length > LOF(f) THEN\\n CLOSE f\\n ERROR 62 'Input past end\\n ELSE\\n SEEK f, length + 1\\n SETEOF f\\n CLOSE f\\n END IF\\n ELSE\\n ERROR 53 'File not found\\n END IF\\nEND SUB\\n\",\n \"language\": \"PowerBASIC\"\n },\n {\n \"code\": \"Function Truncate-File(fname) {\\n $null | Set-Content -Path \\\"$fname\\\"\\n}\\n\",\n \"language\": \"PowerShell\"\n },\n {\n \"code\": \"Procedure SetFileSize(File$, length.q)\\n Protected fh, pos, i\\n If FileSize(File$) < length\\n Debug \\\"File to small, is a directory or does not exist.\\\"\\n ProcedureReturn #False\\n Else\\n fh = OpenFile(#PB_Any, File$)\\n FileSeek(fh, length)\\n TruncateFile(fh)\\n CloseFile(fh)\\n EndIf\\n ProcedureReturn #True\\nEndProcedure\\n\",\n \"language\": \"PureBasic\"\n },\n {\n \"code\": \"def truncate_file(name, length):\\n if not os.path.isfile(name):\\n return False\\n if length >= os.path.getsize(name):\\n return False\\n with open(name, 'ab') as f:\\n f.truncate(length)\\n return True\\n\",\n \"language\": \"Python\"\n },\n {\n \"code\": \"truncate_file <- function(filename, n_bytes) {\\n\\n # check file exists and size is greater than n_bytes\\n stopifnot(\\n \\\"file does not exist\\\"= file.exists(filename),\\n \\\"not enough bytes in file\\\"= file.size(filename) >= n_bytes\\n )\\n\\n # read bytes from input file\\n input.con <- file(filename, \\\"rb\\\")\\n bindata <- readBin(input.con, integer(), n=n_bytes/4)\\n close(input.con)\\n\\n # write bytes to temporary file\\n tmp.filename <- tempfile()\\n output.con <- file(tmp.filename, \\\"wb\\\")\\n writeBin(bindata, output.con)\\n close(output.con)\\n\\n # double check that everything worked before overwriting original file\\n stopifnot(\\n \\\"temp file is not expected size\\\"= file.size(tmp.filename) == n_bytes\\n )\\n\\n # overwrite input file with temporary file\\n file.rename(tmp.filename, filename)\\n\\n}\\n\",\n \"language\": \"R\"\n },\n {\n \"code\": \"#lang racket\\n\\n(define (truncate file size)\\n (unless (file-exists? file) (error 'truncat \\\"missing file: ~a\\\" file))\\n (when (> size (file-size file)) (printf \\\"Warning: extending file size.\\\\n\\\"))\\n (call-with-output-file* file #:exists 'update\\n (λ(o) (file-truncate o size))))\\n\",\n \"language\": \"Racket\"\n },\n {\n \"code\": \"use NativeCall;\\n\\nsub truncate(Str, int32 --> int32) is native {*}\\n\\nsub MAIN (Str $file, Int $to) {\\n given $file.IO {\\n .e or die \\\"$file doesn't exist\\\";\\n .w or die \\\"$file isn't writable\\\";\\n .s >= $to or die \\\"$file is not big enough to truncate\\\";\\n }\\n truncate($file, $to) == 0 or die \\\"Truncation was unsuccessful\\\";\\n}\\n\",\n \"language\": \"Raku\"\n },\n {\n \"code\": \"spurt $file, slurp($file).substr($to);\\n\",\n \"language\": \"Raku\"\n },\n {\n \"code\": \"/*REXX program truncates a file to a specified (and smaller) number of bytes. */\\nparse arg siz FID /*obtain required arguments from the CL*/\\nFID=strip(FID) /*elide FID leading/trailing blanks. */\\nif siz=='' then call ser \\\"No truncation size was specified (1st argument).\\\"\\nif FID=='' then call ser \\\"No fileID was specified (2nd argument).\\\"\\nif \\\\datatype(siz,'W') then call ser \\\"trunc size isn't an integer: \\\" siz\\nif siz<1 then call ser \\\"trunc size isn't a positive integer: \\\" siz\\n_=charin(FID,1,siz+1) /*position file and read a wee bit more*/\\n#=length(_) /*get the length of the part just read.*/\\nif #==0 then call ser \\\"the specified file doesn't exist: \\\" FID\\nif #<siz then call ser \\\"the file is smaller than trunc size: \\\" #\\ncall lineout FID /*close the file used, just to be safe.*/\\n'ERASE' FID /*invoke a command to delete the file */\\ncall lineout FID /*close the file, maybe for REXX's use.*/\\ncall charout FID, left(_,siz), 1 /*write a truncated version of the file*/\\ncall lineout FID /*close the file used, just to be safe.*/\\nsay 'file ' FID \\\" truncated to \\\" siz 'bytes.' /*display some information to terminal.*/\\nexit /*stick a fork in it, we're all done. */\\n/*──────────────────────────────────────────────────────────────────────────────────────*/\\nser: say '***error***' arg(1); exit 13 /*display an error message and exit. */\\n\",\n \"language\": \"REXX\"\n },\n {\n \"code\": \"/*REXX program truncates a file to a specified (and smaller) number of bytes. */\\nparse arg siz FID /*obtain required arguments from the CL*/\\nFID=strip(FID) /*elide FID leading/trailing blanks. */\\nif siz=='' then call ser \\\"No truncation size was specified (1st argument).\\\"\\nif FID=='' then call ser \\\"No fileID was specified (2nd argument).\\\"\\nif \\\\datatype(siz,'W') then call ser \\\"trunc size isn't an integer: \\\" siz\\nif siz<1 then call ser \\\"trunc size isn't a positive integer: \\\" siz\\nchunk=4000 /*read the file with this \\\"buffer\\\" size*/\\ncall charin fid,1,0 /*position the file pointer to byte # 1*/\\n_= /* [↓] read while the length data<siz.*/\\n do while length(_)<=siz /* [↓] have we reached End-Of-File ? */\\n buffer=charin(FID,,chunk)\\n if length(buffer)==0 then leave /*Nothing read? Then we're done reading*/\\n _=_ || buffer /*append the chunk to the _ input data*/\\n end /*while*/\\n#=length(_) /*get the length of the part just read.*/\\nif #==0 then call ser \\\"the specified file doesn't exist: \\\" FID\\nif #<siz then call ser \\\"the file is smaller than trunc size: \\\" #\\ncall lineout FID /*close the file used, just to be safe.*/\\n'ERASE' FID /*invoke a command to delete the file */\\ncall lineout FID /*close the file, maybe for REXX's use.*/\\ncall charout FID, left(_,siz), 1 /*write a truncated version of the file*/\\ncall lineout FID /*close the file used, just to be safe.*/\\nsay 'file ' FID \\\" truncated to \\\" siz 'bytes.' /*display some information to terminal.*/\\nexit /*stick a fork in it, we're all done. */\\n/*──────────────────────────────────────────────────────────────────────────────────────*/\\nser: say '***error***' arg(1); exit 13 /*display an error message and exit. */\\n\",\n \"language\": \"REXX\"\n },\n {\n \"code\": \"file = \\\"C:\\\\Ring\\\\ReadMe.txt\\\"\\nfp = read(file)\\nfpstr = left(fp, 100)\\nsee fpstr + nl\\nwrite(file, fpstr)\\n\",\n \"language\": \"Ring\"\n },\n {\n \"code\": \"# Open a file for writing, and truncate it to 1234 bytes.\\nFile.open(\\\"file\\\", \\\"ab\\\") do |f|\\n f.truncate(1234)\\n f << \\\"Killroy was here\\\" # write to file\\nend # file is closed now.\\n\\n# Just truncate a file to 567 bytes.\\nFile.truncate(\\\"file\\\", 567)\\n\",\n \"language\": \"Ruby\"\n },\n {\n \"code\": \"use std::path::Path;\\nuse std::fs;\\n\\nfn truncate_file<P: AsRef<Path>>(filename: P, filesize: usize) -> Result<(), Error> {\\n use Error::*;\\n let file = fs::read(&filename).or(Err(NotFound))?;\\n\\n if filesize > file.len() {\\n return Err(FilesizeTooSmall)\\n }\\n\\n fs::write(&filename, &file[..filesize]).or(Err(UnableToWrite))?;\\n Ok(())\\n}\\n\\n#[derive(Debug)]\\nenum Error {\\n /// File not found\\n NotFound,\\n /// Truncated size would be larger than the current size\\n FilesizeTooSmall,\\n /// Likely due to having read but not write permissions\\n UnableToWrite,\\n}\\n\",\n \"language\": \"Rust\"\n },\n {\n \"code\": \"import java.io.FileOutputStream\\n\\nobject TruncFile extends App {\\n if (args.length < 2) println(\\\"Usage: java TruncFile fileName newSize\\\")\\n else { //turn on \\\"append\\\" so it doesn't clear the file\\n val outChan = new FileOutputStream(args(0), true).getChannel()\\n val newSize = args(1).toLong\\n outChan.truncate(newSize)\\n }\\n}\\n\",\n \"language\": \"Scala\"\n },\n {\n \"code\": \"func truncate(filename, len) {\\n var file = File(filename);\\n len > file.size ->\\n && die \\\"The provided length is greater than the length of the file\\\";\\n file.truncate(len);\\n}\\n\\n# truncate \\\"file.ext\\\" to 1234 bytes\\ntruncate(\\\"file.ext\\\", 1234);\\n\",\n \"language\": \"Sidef\"\n },\n {\n \"code\": \"local\\n open Posix.FileSys\\n val perm = S.flags [S.irusr, S.iwusr, S.irgrp, S.iwgrp, S.iroth, S.iwoth]\\nin\\n fun truncate (path, len) =\\n let\\n val fd = createf (path, O_WRONLY, O.noctty, perm)\\n in\\n ftruncate (fd, len); Posix.IO.close fd\\n end\\nend\\n\",\n \"language\": \"Standard-ML\"\n },\n {\n \"code\": \"package require Tcl 8.5\\n\\nset f [open \\\"file\\\" r+];\\t# Truncation is done on channels\\nchan truncate $f 1234;\\t\\t# Truncate at a particular length (in bytes)\\nclose $f\\n\",\n \"language\": \"Tcl\"\n },\n {\n \"code\": \"# Truncate a file named \\\"myfile\\\" to 1440 kilobytes.\\nls myfile >/dev/null &&\\n dd if=/dev/null of=myfile bs=1 seek=1440k\\n\",\n \"language\": \"UNIX-Shell\"\n },\n {\n \"code\": \"# Truncate a file named \\\"myfile\\\" to 1440 kilobytes.\\ntruncate -s 1440k myfile\\n\",\n \"language\": \"UNIX-Shell\"\n },\n {\n \"code\": \"# 1. simplest one-liner\\n-bash$ >file\\n\\n# or the more clear/verbose:\\necho -n>file\\n\\n# 2. checks for file as input prior to truncate:\\nf=\\\"file\\\";echo -n<$f>$f\\n\\n# double-check file size\\nls -1 file # it's trunc\\n\\n# 3. multiple files (glob)\\nglob=$(ls -1 file[0-9]); for f in $glob; do echo -n<$f>$f; done\\n\\n\\n## OUTPUT:\\n# 1. one-liner\\n-bash-4.2$ echo -n>bad\\n+ echo -n\\n-bash-4.2$ ls -l bad; cat bad\\n+ ls -l bad\\n-rw-r--r-- 1 fieldsa fieldsa 0 Dec 4 20:07 bad\\n+ cat bad\\n-bash-4.2$\\n\\n# 2. checks\\n-bash-4.2$ set -x; f=\\\"bad\\\"; echo -n<$f>$f\\n+ f=bad\\n+ echo -n\\n-bash: bad: No such file or directory\\n\\n# Try again with the shortest version: f=\\\"bad\\\"<$f>$f\\n+ ls -l bad\\n-rw-r--r-- 1 fieldsa fieldsa 8192 Dec 5 01:04 bad\\n-bash-4.2$ f=\\\"bad\\\" <$f>$f\\n+ f=bad\\n-bash-4.2$ ls -l\\n+ ls -l\\n-rw-r--r-- 1 fieldsa fieldsa 0 Dec 5 01:04 bad\\n-bash-4.2$ rm bad\\n+ rm bad\\n-bash-4.2$ f=\\\"bad\\\" <$f>$f\\n+ f=bad\\n-bash: bad: No such file or directory\\n\\n# Now a bad file exists\\n-bash-4.2$ echo 'abc'>bad\\n+ echo abc\\n-bash-4.2$ ls -l bad;cat<bad\\n+ ls -l bad\\n-rw-r--r-- 1 fieldsa fieldsa 4 Dec 4 19:21 bad\\n+ cat\\nabc\\n\\n-bash-4.2$ f=\\\"bad\\\"; echo -n<$f>$f\\n+ f=bad\\n+ echo -n\\n-bash-4.2$ ls -l bad;cat<bad;echo \\\"_EOF_\\\"\\n+ ls -l bad\\n-rw-r--r-- 1 fieldsa fieldsa 0 Dec 4 19:23 bad\\n+ cat\\n+ echo _EOF_\\n_EOF_\\n\\n-bash-4.2$ rm bad\\n+ rm bad\\n-bash-4.2$ f=\\\"bad\\\" <$f&&echo -n>$f\\n+ f=bad\\n-bash: bad: No such file or directory\\n\\n# 4. trunc(): trunc file size # truncate at length\\n-bash-4.2$ trunc() { IFS= read -N $2 b<\\\"$1\\\"; echo -n \\\"$b\\\">\\\"$1\\\"; }\\n-bash-4.2$ echo \\\"abcdef\\\">bad; ls -l bad; cat bad; trunc bad 3; ls -l bad; cat bad; echo \\\"_EOF_\\\"\\n+ echo abcdef\\n+ ls -l bad\\n-rw-r--r-- 1 fieldsa fieldsa 7 Dec 4 19:59 bad\\n+ cat bad\\nabcdef\\n+ trunc bad 3\\n+ read -N 3 b\\n+ echo -n abc\\n+ ls -l bad\\n-rw-r--r-- 1 fieldsa fieldsa 3 Dec 4 19:59 bad\\n+ cat bad\\nabc+ echo _EOF_\\n_EOF_\\n\",\n \"language\": \"UNIX-Shell\"\n },\n {\n \"code\": \"Sub truncate(fpath,n)\\n\\t'Check if file exist\\n\\tSet objfso = CreateObject(\\\"Scripting.FileSystemObject\\\")\\n\\tIf objfso.FileExists(fpath) = False Then\\n\\t\\tWScript.Echo fpath & \\\" does not exist\\\"\\n\\t\\tExit Sub\\n\\tEnd If\\n\\tcontent = \\\"\\\"\\n\\t'stream the input file\\n\\tSet objinstream = CreateObject(\\\"Adodb.Stream\\\")\\n\\tWith objinstream\\n\\t\\t.Type = 1\\n\\t\\t.Open\\n\\t\\t.LoadFromFile(fpath)\\n\\t\\t'check if the specified size is larger than the file content\\n\\t\\tIf n <= .Size Then\\n\\t\\t\\tcontent = .Read(n)\\n\\t\\tElse\\n\\t\\t\\tWScript.Echo \\\"The specified size is larger than the file content\\\"\\n\\t\\t\\tExit Sub\\n\\t\\tEnd If\\n\\t\\t.Close\\n\\tEnd With\\n\\t'write the truncated version\\n\\tSet objoutstream = CreateObject(\\\"Adodb.Stream\\\")\\n\\tWith objoutstream\\n\\t\\t.Type = 1\\n\\t\\t.Open\\n\\t\\t.Write content\\n\\t\\t.SaveToFile fpath,2\\n\\t\\t.Close\\n\\tEnd With\\n\\tSet objinstream = Nothing\\n\\tSet objoutstream = Nothing\\n\\tSet objfso = Nothing\\nEnd Sub\\n\\n'testing\\nCall truncate(\\\"C:\\\\temp\\\\test.txt\\\",30)\\n\",\n \"language\": \"VBScript\"\n },\n {\n \"code\": \"import \\\"./ioutil\\\" for FileUtil\\n\\nvar fileName = \\\"temp.txt\\\"\\n\\n// create a file of length 26 bytes\\nFileUtil.write(fileName, \\\"abcdefghijklmnopqrstuvwxyz\\\")\\nSystem.print(\\\"Contents before truncation: %(FileUtil.read(fileName))\\\")\\n\\n// truncate file to 13 bytes\\nFileUtil.truncate(fileName, 13)\\nSystem.print(\\\"Contents after truncation : %(FileUtil.read(fileName))\\\")\\n\\n// attempt to truncate file to 20 bytes\\nFileUtil.truncate(fileName, 20)\\nSystem.print(\\\"Contents are still : %(FileUtil.read(fileName))\\\")\\n\",\n \"language\": \"Wren\"\n },\n {\n \"code\": \"int I, Size, FD;\\nchar C, FN(80), Array;\\n[I:= 0; \\\\get file name from command line\\nloop [C:= ChIn(8);\\n if C = $20 \\\\space\\\\ then quit;\\n FN(I):= C;\\n I:= I+1;\\n ];\\nFN(I):= 0;\\nSize:= IntIn(8); \\\\get number of bytes from command line\\nif Size = 0 then [Text(0, \\\"Length not found (or zero)\\\"); exit 1];\\n\\nTrap(false); \\\\disable abort on errors\\nFD:= FOpen(FN, 0); \\\\open specified file for input\\nFSet(FD, ^i);\\nOpenI(3);\\nif GetErr then [Text(0, \\\"File not found\\\"); exit 1];\\n\\nArray:= Reserve(0); \\\\64MB available if no procedures are called\\nfor I:= 0 to Size-1 do \\\\read specified number of bytes\\n [Array(I):= ChIn(3);\\n if GetErr then [Text(0, \\\"File is too short\\\"); exit 1];\\n ]; \\\\if end of file encountered, show error\\nFClose(FD);\\n\\nFD:= FOpen(FN, 1); \\\\open file by same name for output\\nFSet(FD, ^o);\\nOpenO(3);\\nif GetErr then [Text(0, \\\"Output error\\\"); exit 1];\\nfor I:= 0 to Size-1 do ChOut(3, Array(I));\\nClose(3);\\n]\\n\",\n \"language\": \"XPL0\"\n },\n {\n \"code\": \"10 CLEAR 29999\\n20 INPUT \\\"Which file do you want to truncate?\\\";f$\\n30 PRINT \\\"Start tape to load file to truncate.\\\"\\n40 LOAD f$ CODE 30000\\n50 \\\"Input how many bytes do you want to keep?\\\";n\\n60 PRINT \\\"Please rewind the tape and press record.\\\"\\n70 SAVE f$ CODE 30000,n\\n80 STOP\\n\",\n \"language\": \"ZX-Spectrum-Basic\"\n }\n]","isConversational":false},"task_name":{"kind":"string","value":"Truncate-a-file"}}},{"rowIdx":1775,"cells":{"solutions":{"kind":"list like","value":[{"code":"---\ncategory:\n- CHR\nfrom: http://rosettacode.org/wiki/Twelve_statements\nnote: Puzzles\n","language":"00-META"},{"code":"This puzzle is borrowed from [http://math-frolic.blogspot.co.uk/2012/08/mind-wrenching.html math-frolic.blogspot].\n\n\nGiven the following twelve statements, which of them are true?\n<pre>\n 1. This is a numbered list of twelve statements.\n 2. Exactly 3 of the last 6 statements are true.\n 3. Exactly 2 of the even-numbered statements are true.\n 4. If statement 5 is true, then statements 6 and 7 are both true.\n 5. The 3 preceding statements are all false.\n 6. Exactly 4 of the odd-numbered statements are true.\n 7. Either statement 2 or 3 is true, but not both.\n 8. If statement 7 is true, then 5 and 6 are both true.\n 9. Exactly 3 of the first 6 statements are true.\n10. The next two statements are both true.\n11. Exactly 1 of statements 7, 8 and 9 are true.\n12. Exactly 4 of the preceding statements are true.\n</pre>\n\n\n;Task:\nWhen you get tired of trying to figure it out in your head, \nwrite a program to solve it, and print the correct answer or answers.\n\n\n;Extra credit:\nPrint out a table of near misses, that is, solutions that are contradicted by only a single statement.\n<br><br>\n\n","language":"00-TASK"},{"code":"[([Int] -> Bool)] predicates\npredicates [+]= st -> st.len == 12\npredicates [+]= st -> sum(st[(len)-6 ..]) == 3\npredicates [+]= st -> sum(st[(1..).step(2)]) == 2\npredicates [+]= st -> I st[4] {(st[5] [&] st[6])} E 1\npredicates [+]= st -> sum(st[1.<4]) == 0\npredicates [+]= st -> sum(st[(0..).step(2)]) == 4\npredicates [+]= st -> sum(st[1.<3]) == 1\npredicates [+]= st -> I st[6] {(st[4] [&] st[5])} E 1\npredicates [+]= st -> sum(st[0.<6]) == 3\npredicates [+]= st -> (st[10] [&] st[11])\npredicates [+]= st -> sum(st[6.<9]) == 1\npredicates [+]= st -> sum(st[0.<11]) == 4\n\nF to_str(b)\n R (0.<12).filter(i -> @b[i]).map(i -> i + 1).join(‘ ’)\n\nprint(‘Exact hits:’)\nL(n) 0 .< (1 << 12)\n V bools = [0] * 12\n L(i) 12\n I n [&] (1 << (11 - i)) != 0\n bools[i] = 1\n\n L(predicate) predicates\n I Int(predicate(bools)) != bools[L.index]\n L.break\n L.was_no_break\n print(‘ ’to_str(bools))\n\nprint(\"\\nNear misses:\")\nL(n) 0 .< (1 << 12)\n V bools = [0] * 12\n L(i) 12\n I n [&] (1 << (11 - i)) != 0\n bools[i] = 1\n\n V count = 0\n L(predicate) predicates\n I Int(predicate(bools)) == bools[L.index]\n count++\n I count == 11\n L(predicate) predicates\n V i = L.index\n I Int(predicate(bools)) != bools[i]\n print(f:‘ (Fails at statement {i + 1:2}) {to_str(bools)}’)\n L.break\n","language":"11l"},{"code":"with Ada.Text_IO, Logic;\n\nprocedure Twelve_Statements is\n\n package L is new Logic(Number_Of_Statements => 12); use L;\n\n -- formally define the 12 statements as expression function predicates\n function P01(T: Table) return Boolean is (T'Length = 12); -- list of 12 statements\n function P02(T: Table) return Boolean is (Sum(T(7 .. 12)) = 3); -- three of last six\n function P03(T: Table) return Boolean is (Sum(Half(T, Even)) = 2); -- two of the even\n function P04(T: Table) return Boolean is (if T(5) then T(6) and T(7)); -- if 5 is true, then ...\n function P05(T: Table) return Boolean is\n ( (not T(2)) and (not T(3)) and (not T(4)) ); -- none of preceding three\n function P06(T: Table) return Boolean is (Sum(Half(T, Odd)) = 4); -- four of the odd\n function P07(T: Table) return Boolean is (T(2) xor T(3)); -- either 2 or 3, not both\n function P08(T: Table) return Boolean is (if T(7) then T(5) and T(6)); -- if 7 is true, then ...\n function P09(T: Table) return Boolean is (Sum(T(1 .. 6)) = 3); -- three of first six\n function P10(T: Table) return Boolean is (T(11) and T(12)); -- next two\n function P11(T: Table) return Boolean is (Sum(T(7..9)) = 1); -- one of 7, 8, 9\n function P12(T: Table) return Boolean is (Sum(T(1 .. 11)) = 4); -- four of the preding\n\n -- define a global list of statements\n Statement_List: constant Statements :=\n (P01'Access, P02'Access, P03'Access, P04'Access, P05'Access, P06'Access,\n P07'Access, P08'Access, P09'Access, P10'Access, P11'Access, P12'Access);\n\n -- try out all 2^12 possible choices for the table\n procedure Try(T: Table; Fail: Natural; Idx: Indices'Base := Indices'First) is\n\n procedure Print_Table(T: Table) is\n\t use Ada.Text_IO;\n begin\n\t Put(\" \");\n\t if Fail > 0 then\n\t Put(\"(wrong at\");\n\t for J in T'Range loop\n\t if Statement_List(J)(T) /= T(J) then\n\t\t Put(Integer'Image(J) & (if J < 10 then \") \" else \") \"));\n\t end if;\n\t end loop;\n\t end if;\n\t if T = (1..12 => False) then\n\t Put_Line(\"All false!\");\n\t else\n\t Put(\"True are\");\n\t for J in T'Range loop\n\t if T(J) then\n\t\t Put(Integer'Image(J));\n\t end if;\n\t end loop;\n\t New_Line;\n\t end if;\n end Print_Table;\n\n Wrong_Entries: Natural := 0;\n\t\n begin\n if Idx <= T'Last then\n\t Try(T(T'First .. Idx-1) & False & T(Idx+1 .. T'Last), Fail, Idx+1);\n\t Try(T(T'First .. Idx-1) & True & T(Idx+1 .. T'Last), Fail, Idx+1);\n else -- now Index > T'Last and we have one of the 2^12 choices to test\n\t for J in T'Range loop \t\n\t if Statement_List(J)(T) /= T(J) then\n\t Wrong_Entries := Wrong_Entries + 1;\n\t end if;\n\t end loop;\n\t if Wrong_Entries = Fail then\n\t Print_Table(T);\n\t end if;\n end if;\n end Try;\n\t\t\t\nbegin\n Ada.Text_IO.Put_Line(\"Exact hits:\");\n Try(T => (1..12 => False), Fail => 0);\n Ada.Text_IO.New_Line;\n Ada.Text_IO.Put_Line(\"Near Misses:\");\n Try(T => (1..12 => False), Fail => 1);\nend Twelve_Statements;\n","language":"Ada"},{"code":"generic\n Number_Of_Statements: Positive;\npackage Logic is\n\n --types\n subtype Indices is Natural range 1 .. Number_Of_Statements;\n type Table is array(Indices range <>) of Boolean;\n type Predicate is access function(T: Table) return Boolean;\n type Statements is array(Indices) of Predicate;\n type Even_Odd is (Even, Odd);\n\n -- convenience functions\n function Sum(T: Table) return Natural;\n function Half(T: Table; Which: Even_Odd) return Table;\n\nend Logic;\n","language":"Ada"},{"code":"package body Logic is\n\n function Sum(T: Table) return Natural is\n Result: Natural := 0;\n begin\n for I in T'Range loop\n if T(I) then\n Result := Result + 1;\n end if;\n end loop;\n return Result;\n end Sum;\n\n function Half(T: Table; Which: Even_Odd) return Table is\n Result: Table(T'Range);\n Last: Natural := Result'First - 1;\n begin\n for I in T'Range loop\n if I mod 2 = (if (Which=Odd) then 1 else 0) then\n Last := Last+1;\n Result(Last) := T(I);\n end if;\n end loop;\n return Result(Result'First .. Last);\n end Half;\n\nend Logic;\n","language":"Ada"},{"code":"begin\n % we have 12 statements to determine the truth/falsehood of (see task) %\n\n logical array stmt, expected( 1 :: 12 );\n\n % logical (boolean) to integer utility procedure %\n integer procedure toInteger ( logical value v ) ; if v then 1 else 0;\n\n % procedure to determine whether the statements are true or not %\n procedure findExpectedValues ;\n begin\n expected( 1 ) := true;\n expected( 2 ) := 3 = ( toInteger( stmt( 7 ) ) + toInteger( stmt( 8 ) )\n + toInteger( stmt( 9 ) ) + toInteger( stmt( 10 ) )\n + toInteger( stmt( 11 ) ) + toInteger( stmt( 12 ) )\n );\n expected( 3 ) := 2 = ( toInteger( stmt( 2 ) ) + toInteger( stmt( 4 ) )\n + toInteger( stmt( 6 ) ) + toInteger( stmt( 8 ) )\n + toInteger( stmt( 10 ) ) + toInteger( stmt( 12 ) )\n );\n expected( 4 ) := ( not stmt( 5 ) ) or ( stmt( 6 ) and stmt( 7 ) );\n expected( 5 ) := not ( stmt( 2 ) or stmt( 3 ) or stmt( 4 ) );\n expected( 6 ) := 4 = ( toInteger( stmt( 1 ) ) + toInteger( stmt( 3 ) )\n + toInteger( stmt( 5 ) ) + toInteger( stmt( 7 ) )\n + toInteger( stmt( 9 ) ) + toInteger( stmt( 11 ) )\n );\n expected( 7 ) := stmt( 2 ) not = stmt( 3 );\n expected( 8 ) := ( not stmt( 7 ) ) or ( stmt( 5 ) and stmt( 6 ) );\n expected( 9 ) := 3 = ( toInteger( stmt( 1 ) ) + toInteger( stmt( 2 ) )\n + toInteger( stmt( 3 ) ) + toInteger( stmt( 4 ) )\n + toInteger( stmt( 5 ) ) + toInteger( stmt( 6 ) )\n );\n expected( 10 ) := stmt( 11 ) and stmt( 12 );\n expected( 11 ) := 1 = ( toInteger( stmt( 7 ) )\n + toInteger( stmt( 8 ) )\n + toInteger( stmt( 9 ) )\n );\n expected( 12 ) := 4 = ( toInteger( stmt( 1 ) ) + toInteger( stmt( 2 ) )\n + toInteger( stmt( 3 ) ) + toInteger( stmt( 4 ) )\n + toInteger( stmt( 5 ) ) + toInteger( stmt( 6 ) )\n + toInteger( stmt( 7 ) ) + toInteger( stmt( 8 ) )\n + toInteger( stmt( 9 ) ) + toInteger( stmt( 10 ) )\n + toInteger( stmt( 11 ) )\n );\n end expected ;\n\n % clearly, statement 1 is true, however to enumerate the near %\n % solutions, we need to consider \"solutions\" where statement 1 is false %\n % we iterate through the possibilities for the statements, %\n % looking for a non-contradictory set of values %\n % we print the solutions with allowedContradictions contradictions %\n procedure printSolutions ( integer value allowedContradictions\n ; string(60) value heading\n ) ;\n begin\n logical array wrong( 1 :: 12 );\n write( heading );\n write( \" 1 2 3 4 5 6 7 8 9 10 11 12\" );\n write( \" ====================================\" );\n % there are 12 statements, so we have 2^12 possible combinations %\n for solution := 1 until 4096 do begin\n integer n, incorrect;\n % convert the number to the set of true/false values %\n n := solution;\n for dPos := 1 until 12 do begin\n stmt( dPos ) := odd( n );\n n := n div 2;\n end for_dPos ;\n % get the expected values of the statements, based on the %\n % suggested values %\n findExpectedValues;\n % count the contradictions, if we have the required number, %\n % print the solution %\n incorrect := 0;\n for dPos := 1 until 12 do begin\n wrong( dPos ) := expected( dPos ) not = stmt( dPos );\n incorrect := incorrect + toInteger( wrong( dPos ) );\n end for_dPos ;\n if incorrect = allowedContradictions then begin\n % have a solution %\n write( \" \" );\n for s := 1 until 12 do writeon( s_w := 0\n , \" \"\n , if stmt( s ) then \"T\" else \"-\"\n , if wrong( s ) then \"*\" else \" \"\n );\n end ;\n end for_solution ;\n end printSolutions ;\n\n % find complete solutions %\n printSolutions( 0, \"Solutions\" );\n % find near solutions %\n printSolutions( 1, \"Near solutions (incorrect values marked \"\"*\"\")\" );\n\nend.\n","language":"ALGOL-W"},{"code":"on twelveStatements()\n set statements to \" 1. This is a numbered list of twelve statements.\n 2. Exactly 3 of the last 6 statements are true.\n 3. Exactly 2 of the even-numbered statements are true.\n 4. If statement 5 is true, then statements 6 and 7 are both true.\n 5. The 3 preceding statements are all false.\n 6. Exactly 4 of the odd-numbered statements are true.\n 7. Either statement 2 or 3 is true, but not both.\n 8. If statement 7 is true, then 5 and 6 are both true.\n 9. Exactly 3 of the first 6 statements are true.\n10. The next two statements are both true.\n11. Exactly 1 of statements 7, 8 and 9 are true.\n12. Exactly 4 of the preceding statements are true.\"\n\n script o\n property posits : {}\n property upshots : missing value\n\n on countTrues(indexList)\n set sum to 0\n repeat with i in indexList\n if (my posits's item i) then set sum to sum + 1\n end repeat\n return sum\n end countTrues\n end script\n -- While setting up, test statement 1, whose truth isn't about the others' truths.\n set statements to statements's paragraphs\n set nStatements to (count statements)\n set statement1Truth to (nStatements = 12)\n repeat with stmt from 1 to nStatements\n set end of o's o's posits to false\n tell (statements's item stmt's words) to set statement1Truth to ¬\n ((statement1Truth) and ((count) > 1) and (beginning = stmt as text))\n end repeat\n\n set output to {}\n set firstIteration to true\n repeat (2 ^ nStatements) times\n -- Postulate answer:\n if (firstIteration) then\n set firstIteration to false\n else -- \"Increment\" the 'posits' boolean array binarily.\n repeat with stmt from 1 to nStatements\n set o's posits's item stmt to (not (o's posits's item stmt))\n if (result) then exit repeat -- No carry.\n end repeat\n end if\n\n -- Test consistency:\n tell o's posits to set o's upshots to {statement1Truth, ¬\n (o's countTrues({7, 8, 9, 10, 11, 12}) = 3), ¬\n (o's countTrues({2, 4, 6, 8, 10, 12}) = 2), ¬\n ((not (item 5)) or ((item 6) and (item 7))), ¬\n (not ((item 2) or (item 3) or (item 4))), ¬\n (o's countTrues({1, 3, 5, 7, 9, 11}) = 4), ¬\n ((item 2) ≠ (item 3)), ¬\n ((not (item 7)) or ((item 5) and (item 6))), ¬\n (o's countTrues({1, 2, 3, 4, 5, 6}) = 3), ¬\n ((item 11) and (item 12)), ¬\n (o's countTrues({7, 8, 9}) = 1), ¬\n (o's countTrues({1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11}) = 4)}\n\n set nMatches to 0\n repeat with stmt from 1 to nStatements\n if ((o's posits's item stmt) = (o's upshots's item stmt)) then set nMatches to nMatches + 1\n end repeat\n if (nMatches > nStatements - 2) then\n set statementsPositedTrue to {}\n repeat with stmt from 1 to nStatements\n set thisPosit to o's posits's item stmt\n if (thisPosit) then set end of statementsPositedTrue to stmt\n if ((thisPosit) ≠ (o's upshots's item stmt)) then set failure to stmt\n end repeat\n set statementsPositedTrue's last item to \"and \" & statementsPositedTrue's end\n if ((count statementsPositedTrue) > 2) then\n set statementsPositedTrue to join(statementsPositedTrue, \", \")\n else\n set statementsPositedTrue to join(statementsPositedTrue, space)\n end if\n if (nMatches = nStatements) then\n set output's end to \"SOLUTION: statements \" & statementsPositedTrue & \" are true.\"\n else\n set output's end to \"Near miss when statements \" & statementsPositedTrue & ¬\n \" are posited true: posit for statement \" & failure & \" fails.\"\n end if\n end if\n end repeat\n\n return join(output, linefeed)\nend twelveStatements\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\ntwelveStatements()\n","language":"AppleScript"},{"code":"\"Near miss when statements 1 and 4 are posited true: posit for statement 8 fails.\nNear miss when statements 1 and 5 are posited true: posit for statement 8 fails.\nNear miss when statements 1, 5, and 8 are posited true: posit for statement 11 fails.\nNear miss when statements 1, 3, 4, 6, 7, and 9 are posited true: posit for statement 9 fails.\nNear miss when statements 1, 3, 4, 8, and 9 are posited true: posit for statement 7 fails.\nNear miss when statements 1, 4, 6, 8, and 9 are posited true: posit for statement 6 fails.\nNear miss when statements 1, 2, 4, 7, 8, and 9 are posited true: posit for statement 8 fails.\nNear miss when statements 1, 2, 4, 7, 9, and 10 are posited true: posit for statement 10 fails.\nSOLUTION: statements 1, 3, 4, 6, 7, and 11 are true.\nNear miss when statements 5, 8, and 11 are posited true: posit for statement 1 fails.\nNear miss when statements 1, 5, 8, and 11 are posited true: posit for statement 12 fails.\nNear miss when statements 1, 5, 6, 9, and 11 are posited true: posit for statement 8 fails.\nNear miss when statements 1, 2, 4, 7, 9, and 12 are posited true: posit for statement 12 fails.\nNear miss when statements 4, 8, 10, 11, and 12 are posited true: posit for statement 1 fails.\nNear miss when statements 1, 4, 8, 10, 11, and 12 are posited true: posit for statement 12 fails.\nNear miss when statements 5, 8, 10, 11, and 12 are posited true: posit for statement 1 fails.\nNear miss when statements 1, 5, 8, 10, 11, and 12 are posited true: posit for statement 12 fails.\"\n","language":"AppleScript"},{"code":"; Note: the original puzzle provides 12 statements and starts with\n; \"Given the following twelve statements...\", so the first statement\n; should ignore the F1 flag and always be true (see \"( N == 1 )\").\n\nS := 12 ; number of statements\nOutput := \"\"\nLoop, % 2**S {\n\t;;If !Mod(A_Index,100) ;; optional 'if' to show the loop progress\n\t;;\tToolTip, Index: %A_Index%\n\tSetFlags(A_Index-1), Current := \"\", Count := 0\n\tLoop, %S%\n\t\tR := TestStatement(A_Index), Current .= \" \" R, Count += (R == F%A_Index%)\n\tIf ( Count >= S-1 )\n\t\tOutput .= Count \" ->\" Current \"`n\"\n\tIf ( Count = S )\n\t\tSolution := \"`nSolution = \" Current\n}\nToolTip\nMsgBox, % Output . Solution\nReturn\n\n;-------------------------------------------------------------------------------------\n\nSetFlags(D) {\n\tLocal I\n\tLoop, %S%\n\t\tI := S-A_Index+1 , F%I% := (D >> (S-A_Index)) & 1\n}\n\n;-------------------------------------------------------------------------------------\n\nTestStatement(N) {\n\tLocal I, C := 0\n\tIf ( N == 1 ) ; This is a numbered list of twelve statements.\n\t\tReturn ( S == 12 ) ; should always be true\n\tIf ( N == 2 ) { ; Exactly 3 of the last 6 statements are true.\n\t\tLoop, 6\n\t\t\tI := S-A_Index+1 , C += F%I%\n\t\tReturn ( C == 3 )\n\t}\n\tIf ( N == 3 ) { ; Exactly 2 of the even-numbered statements are true.\n\t\tLoop, %S%\n\t\t\tC += ( !Mod(A_Index,2) & F%A_Index% )\n\t\tReturn ( C == 2 )\n\t}\n\tIf ( N == 4 ) ; If statement 5 is true, then statements 6 and 7 are both true.\n\t\tReturn ( F5 ? F6 & F7 : 1 )\n\tIf ( N == 5 ) { ; The 3 preceding statements are all false.\n\t\tLoop, 3\n\t\t\tI := N-A_Index , C += F%I%\n\t\tReturn ( C == 0 )\n\t}\n\tIf ( N == 6 ) { ; Exactly 4 of the odd-numbered statements are true.\n\t\tLoop, %S%\n\t\t\tC += ( !!Mod(A_Index,2) & F%A_Index% )\n\t\tReturn ( C == 4 )\n\t}\n\tIf ( N == 7 ) ; Either statement 2 or 3 is true, but not both.\n\t\tReturn ( F2 ^ F3 )\n\tIf ( N == 8 ) ; If statement 7 is true, then 5 and 6 are both true.\n\t\tReturn ( F7 ? F5 & F6 : 1 )\n\tIf ( N == 9 ) { ; Exactly 3 of the first 6 statements are true.\n\t\tLoop, 6\n\t\t\tC += F%A_Index%\n\t\tReturn ( C == 3 )\n\t}\n\tIf ( N == 10 ) ; The next two statements are both true.\n\t\tReturn ( F11 & F12 )\n\tIf ( N == 11 ) ; Exactly 1 of statements 7, 8 and 9 are true\n\t\tReturn ( F7+F8+F9 == 1 )\n\tIf ( N == 12 ) { ; Exactly 4 of the preceding statements are true\n\t\tLoop, % N-1\n\t\t\tC += F%A_Index%\n\t\tReturn ( C == 4 )\n\t}\n}\n","language":"AutoHotkey"},{"code":" nStatements% = 12\n DIM Pass%(nStatements%), T%(nStatements%)\n\n FOR try% = 0 TO 2^nStatements%-1\n\n REM Postulate answer:\n FOR stmt% = 1 TO 12\n T%(stmt%) = (try% AND 2^(stmt%-1)) <> 0\n NEXT\n\n REM Test consistency:\n Pass%(1) = T%(1) = (nStatements% = 12)\n Pass%(2) = T%(2) = ((T%(7)+T%(8)+T%(9)+T%(10)+T%(11)+T%(12)) = -3)\n Pass%(3) = T%(3) = ((T%(2)+T%(4)+T%(6)+T%(8)+T%(10)+T%(12)) = -2)\n Pass%(4) = T%(4) = ((NOT T%(5) OR (T%(6) AND T%(7))))\n Pass%(5) = T%(5) = (NOT T%(2) AND NOT T%(3) AND NOT T%(4))\n Pass%(6) = T%(6) = ((T%(1)+T%(3)+T%(5)+T%(7)+T%(9)+T%(11)) = -4)\n Pass%(7) = T%(7) = ((T%(2) EOR T%(3)))\n Pass%(8) = T%(8) = ((NOT T%(7) OR (T%(5) AND T%(6))))\n Pass%(9) = T%(9) = ((T%(1)+T%(2)+T%(3)+T%(4)+T%(5)+T%(6)) = -3)\n Pass%(10) = T%(10) = (T%(11) AND T%(12))\n Pass%(11) = T%(11) = ((T%(7)+T%(8)+T%(9)) = -1)\n Pass%(12) = T%(12) = ((T%(1)+T%(2)+T%(3)+T%(4)+T%(5)+T%(6) + \\\n \\ T%(7)+T%(8)+T%(9)+T%(10)+T%(11)) = -4)\n\n CASE SUM(Pass%()) OF\n WHEN -11:\n PRINT \"Near miss with statements \";\n FOR stmt% = 1 TO 12\n IF T%(stmt%) PRINT ; stmt% \" \";\n IF NOT Pass%(stmt%) miss% = stmt%\n NEXT\n PRINT \"true (failed \" ;miss% \").\"\n WHEN -12:\n PRINT \"Solution! with statements \";\n FOR stmt% = 1 TO 12\n IF T%(stmt%) PRINT ; stmt% \" \";\n NEXT\n PRINT \"true.\"\n ENDCASE\n\n NEXT try%\n END\n","language":"BBC-BASIC"},{"code":"(\n ( number\n = n done ntest oldFT\n . !arg:(?done.(=?ntest).?oldFT)\n & 0:?n\n & ( !done\n : ?\n ( !ntest\n . !oldFT&1+!n:?n&~\n )\n ?\n | !n\n )\n )\n & ( STATEMENTS\n = ( (1.\"This is a numbered list of twelve statements.\")\n . 1\n . (\n = n nr done toDo\n . !arg:(?done.?toDo)\n & 0:?n\n & whl\n ' ( !done:(?nr.?) ?done\n & 1+!n:!nr:?n\n )\n & whl\n ' ( !toDo:((?nr.?).?) ?toDo\n & 1+!n:!nr:?n\n )\n & (!n:12&true|false)\n )\n )\n ( (2.\"Exactly 3 of the last 6 statements are true.\")\n . end\n . (\n = done toDo lastSix\n . !arg:(?done.?toDo)\n & !done:? [-7 ?lastSix\n & ( number$(!lastSix.(=?).true):3\n & true\n | false\n )\n )\n )\n ( (3.\"Exactly 2 of the even-numbered statements are true.\")\n . end\n . (\n = done toDo ii\n . !arg:(?done.?toDo)\n & ( number\n $ ( !done\n . (=?ii&!ii*1/2:~/)\n . true\n )\n : 2\n & true\n | false\n )\n )\n )\n ( (4.\"If statement 5 is true, then statements 6 and 7 are both true.\")\n . 7\n . (\n = done toDo\n . !arg:(?done.?toDo)\n & ( !done\n : ( ? (5.false) ?\n | ? (6.true) ?\n : ? (7.true) ?\n )\n & true\n | false\n )\n )\n )\n ( (5.\"The 3 preceding statements are all false.\")\n . 5\n . (\n = done toDo\n . !arg:(?done.?toDo)\n & ( !done\n : ?\n (?.false)\n (?.false)\n (?.false)\n (?.?)\n & true\n | false\n )\n )\n )\n ( (6.\"Exactly 4 of the odd-numbered statements are true.\")\n . end\n . (\n = done toDo i\n . !arg:(?done.?toDo)\n & ( number\n $ ( !done\n . (=?i&!i*1/2:/)\n . true\n )\n : 4\n & true\n | false\n )\n )\n )\n ( (7.\"Either statement 2 or 3 is true, but not both.\")\n . 7\n . (\n = done toDo\n . !arg:(?done.?toDo)\n & ( number\n $ (!done.(=2|3).true)\n : 1\n & true\n | false\n )\n )\n )\n ( (8.\"If statement 7 is true, then 5 and 6 are both true.\")\n . 8\n . (\n = done toDo\n . !arg:(?done.?toDo)\n & ( !done\n : ( ? (7.false) ?\n | ? (5.true) ?\n : ? (6.true) ?\n )\n & true\n | false\n )\n )\n )\n ( (9.\"Exactly 3 of the first 6 statements are true.\")\n . 9\n . (\n = done toDo firstSix\n . !arg:(?done.?toDo)\n & !done:?firstSix [6 ?\n & ( number$(!firstSix.(=?).true):3\n & true\n | false\n )\n )\n )\n ( (10.\"The next two statements are both true.\")\n . 12\n . (\n = done toDo\n . !arg:(?done.?toDo)\n & ( !done:? (?.true) (?.true)\n & true\n | false\n )\n )\n )\n ( (11.\"Exactly 1 of statements 7, 8 and 9 are true.\")\n . 11\n . (\n = done toDo\n . !arg:(?done.?toDo)\n & ( number\n $ ( !done\n . (=7|8|9)\n . true\n )\n : 1\n & true\n | false\n )\n )\n )\n ( (12.\"Exactly 4 of the preceding statements are true.\")\n . 12\n . (\n = done toDo preceding\n . !arg:(?done.?toDo)\n & !done:?preceding (?.?)\n & ( number$(!preceding.(=?).true):4\n & true\n | false\n )\n )\n )\n )\n & ( TestTruth\n = done toDo postponedTests testToBePostponed\n , n when test FT oldFT A Z text\n , postponedTest testNow\n . !arg:(?done.?toDo.?postponedTests)\n & ( !toDo:\n & \"We have come to the end of the list of tests.\n Perform any tests that had to be postponed until now.\"\n & whl\n ' ( !postponedTests\n : (?.?oldFT.(=?postponedTest)) ?A\n & postponedTest$(!done.):!oldFT\n & !A:?postponedTests\n )\n & !postponedTests:\n & out$(\"Solution:\" !done)\n & ~\n | !toDo\n : ((?n.?text).?when.(=?test)) ?toDo\n & \"'false' and 'true' are just two symbols, not 'boolean values'.\n You can choose other symbols if you like.\n The program first guesses the first symbol and assigns it to the variable FT.\n After backtracking, the second symbol is guessed and assigned to FT.\n This is done for each statement.\"\n & false true\n : ?\n %@?FT\n ( ?\n & 1+!guesses:?guesses\n & (!n.!FT):?testNow\n & \"Do all tests that had to be postponed until now, unless one of those tests\n fails. Remove the successful tests from the list of postponed tests.\"\n & whl\n ' ( !postponedTests\n : ?A\n (!n.?oldFT.(=?postponedTest))\n ?Z\n & postponedTest$(!done !testNow.!toDo)\n : !oldFT\n & !A !Z:?postponedTests\n )\n & \"Check that all tests that had to be postponed until now are removed from\n the list of postponed tests. Only then go on with looking at testing\n the current statement. Backtrack if a test failed.\"\n & !postponedTests:~(? (!n.?) ?)\n & ( !when:>!n\n & \"The current statement cannot be tested right now. Postpone it to\n the earliest coming statement where the current statement can be\n tested.\n (The earliest statement, denoted by 'when', is computed manually.)\"\n & (!when.!FT.'$test):?testToBePostponed\n | \"No need to postpone. Test the current statement now.\"\n & :?testToBePostponed\n & \"If the test fails, backtrack. If it succeeds, go on to the next\n statement.\"\n & test$(!done !testNow.!toDo):!FT\n )\n & \"So far so good. Test the next statements. (recursively)\"\n & TestTruth\n $ ( !done !testNow\n . !toDo\n . !testToBePostponed !postponedTests\n )\n )\n )\n )\n & 0:?guesses\n & TestTruth$(.!STATEMENTS.)\n| out\n $ ( str\n $ ( \"That's it. I made \"\n !guesses\n \" true/false guesses in all. (A brute force method needs 2^12=\"\n 2^12\n \" guesses.\"\n )\n )\n);\n","language":"Bracmat"},{"code":"#include <iostream>\n#include <vector>\n#include <string>\n#include <cmath>\n\nusing namespace std;\n\n// convert int (0 or 1) to string (F or T)\ninline\nstring str(int n)\n{\n return n ? \"T\": \"F\";\n}\n\nint main(void)\n{\n int solution_list_number = 1;\n vector<string> st;\n st = {\n \" 1. This is a numbered list of twelve statements.\",\n \" 2. Exactly 3 of the last 6 statements are true.\",\n \" 3. Exactly 2 of the even-numbered statements are true.\",\n \" 4. If statement 5 is true, then statements 6 and 7 are both true.\",\n \" 5. The 3 preceding statements are all false.\",\n \" 6. Exactly 4 of the odd-numbered statements are true.\",\n \" 7. Either statement 2 or 3 is true, but not both.\",\n \" 8. If statement 7 is true, then 5 and 6 are both true.\",\n \" 9. Exactly 3 of the first 6 statements are true.\",\n \" 10. The next two statements are both true.\",\n \" 11. Exactly 1 of statements 7, 8 and 9 are true.\",\n \" 12. Exactly 4 of the preceding statements are true.\"\n }; // Good solution is: 1 3 4 6 7 11 are true\n\n int n = 12; // Number of statements.\n int nTemp = (int)pow(2, n); // Number of solutions to check.\n for (int counter = 0; counter < nTemp; counter++)\n {\n vector<int> s;\n for (int k = 0; k < n; k++)\n {\n s.push_back((counter >> k) & 0x1);\n }\n vector<int> test(12);\n int sum = 0;\n // check each of the nTemp solutions for match.\n // 1. This is a numbered list of twelve statements.\n test[0] = s[0];\n\n // 2. Exactly 3 of the last 6 statements are true.\n sum = s[6]+ s[7]+s[8]+s[9]+s[10]+s[11];\n test[1] = ((sum == 3) == s[1]);\n\n // 3. Exactly 2 of the even-numbered statements are true.\n sum = s[1]+s[3]+s[5]+s[7]+s[9]+s[11];\n test[2] = ((sum == 2) == s[2]);\n\n // 4. If statement 5 is true, then statements 6 and 7 are both true.\n test[3] = ((s[4] ? (s[5] && s[6]) : true) == s[3]);\n\n // 5. The 3 preceding statements are all false.\n test[4] = (((s[1] + s[2] + s[3]) == 0) == s[4]);\n\n // 6. Exactly 4 of the odd-numbered statements are true.\n sum = s[0] + s[2] + s[4] + s[6] + s[8] + s[10];\n test[5] = ((sum == 4) == s[5]);\n\n // 7. Either statement 2 or 3 is true, but not both.\n test[6] = (((s[1] + s[2]) == 1) == s[6]);\n\n // 8. If statement 7 is true, then 5 and 6 are both true.\n test[7] = ((s[6] ? (s[4] && s[5]) : true) == s[7]);\n\n // 9. Exactly 3 of the first 6 statements are true.\n sum = s[0]+s[1]+s[2]+s[3]+s[4]+s[5];\n test[8] = ((sum == 3) == s[8]);\n\n // 10. The next two statements are both true.\n test[9] = ((s[10] && s[11]) == s[9]);\n\n // 11. Exactly 1 of statements 7, 8 and 9 are true.\n sum = s[6]+ s[7] + s[8];\n test[10] = ((sum == 1) == s[10]);\n\n // 12. Exactly 4 of the preceding statements are true.\n sum = s[0]+s[1]+s[2]+s[3]+s[4]+s[5]+s[6]+s[7]+s[8]+s[9]+s[10];\n test[11] = ((sum == 4) == s[11]);\n\n // Check test results and print solution if 11 or 12 are true\n int resultsTrue = 0;\n for(unsigned int i = 0; i < test.size(); i++){\n resultsTrue += test[i];\n }\n if(resultsTrue == 11 || resultsTrue == 12){\n cout << solution_list_number++ << \". \" ;\n string output = \"1:\"+str(s[0])+\" 2:\"+str(s[1])+\" 3:\"+str(s[2])\n +\" 4:\"+str(s[3])+\" 5:\"+str(s[4])+\" 6:\"+ str(s[5])\n +\" 7:\"+str(s[6])+\" 8:\"+str(s[7])+\" 9:\"+str(s[8])\n +\" 10:\"+str(s[9])+\" 11:\"+str(s[10])+\" 12:\"+ str(s[11]);\n\n if (resultsTrue == 12) {\n cout << \"Full Match, good solution!\" << endl;\n cout << \"\\t\" << output << endl;\n }\n else if(resultsTrue == 11){\n int i;\n for(i = 0; i < 12; i++){\n if(test[i] == 0){\n break;\n }\n }\n cout << \"Missed by one statement: \" << st[i] << endl;\n cout << \"\\t\" << output << endl;\n }\n }\n }\n}\n","language":"C++"},{"code":"using System;\nusing System.Collections.Generic;\nusing System.Linq;\n\npublic static class TwelveStatements\n{\n public static void Main() {\n Func<Statements, bool>[] checks = {\n st => st[1],\n st => st[2] == (7.To(12).Count(i => st[i]) == 3),\n st => st[3] == (2.To(12, by: 2).Count(i => st[i]) == 2),\n st => st[4] == st[5].Implies(st[6] && st[7]),\n st => st[5] == (!st[2] && !st[3] && !st[4]),\n st => st[6] == (1.To(12, by: 2).Count(i => st[i]) == 4),\n st => st[7] == (st[2] != st[3]),\n st => st[8] == st[7].Implies(st[5] && st[6]),\n st => st[9] == (1.To(6).Count(i => st[i]) == 3),\n st => st[10] == (st[11] && st[12]),\n st => st[11] == (7.To(9).Count(i => st[i]) == 1),\n st => st[12] == (1.To(11).Count(i => st[i]) == 4)\n };\n\n for (Statements statements = new Statements(0); statements.Value < 4096; statements++) {\n int count = 0;\n int falseIndex = 0;\n for (int i = 0; i < checks.Length; i++) {\n if (checks[i](statements)) count++;\n else falseIndex = i;\n }\n if (count == 0) Console.WriteLine($\"{\"All wrong:\", -13}{statements}\");\n else if (count == 11) Console.WriteLine($\"{$\"Wrong at {falseIndex + 1}:\", -13}{statements}\");\n else if (count == 12) Console.WriteLine($\"{\"All correct:\", -13}{statements}\");\n }\n }\n\n struct Statements\n {\n public Statements(int value) : this() { Value = value; }\n\n public int Value { get; }\n\n public bool this[int index] => (Value & (1 << index - 1)) != 0;\n\n public static Statements operator ++(Statements statements) => new Statements(statements.Value + 1);\n\n public override string ToString() {\n Statements copy = this; //Cannot access 'this' in anonymous method...\n return string.Join(\" \", from i in 1.To(12) select copy[i] ? \"T\" : \"F\");\n }\n\n }\n\n //Extension methods\n static bool Implies(this bool x, bool y) => !x || y;\n\n static IEnumerable<int> To(this int start, int end, int by = 1) {\n while (start <= end) {\n yield return start;\n start += by;\n }\n }\n\n}\n","language":"C-sharp"},{"code":"(use '[clojure.math.combinatorics]\n\n(defn xor? [& args]\n (odd? (count (filter identity args))))\n\n(defn twelve-statements []\n (for [[a b c d e f g h i j k l] (selections [true false] 12)\n :when (true? a)\n :when (if (= 3 (count (filter true? [g h i j k l]))) (true? b) (false? b))\n :when (if (= 2 (count (filter true? [b d f h j l]))) (true? c) (false? c))\n :when (if (or (false? e) (every? true? [e f g])) (true? d) (false? d))\n :when (if (every? false? [b c d]) (true? e) (false? e))\n :when (if (= 4 (count (filter true? [a c e g i k]))) (true? f) (false? f))\n :when (if (xor? (true? b) (true? c)) (true? g) (false? g))\n :when (if (or (false? g) (every? true? [e f g])) (true? h) (false? h))\n :when (if (= 3 (count (filter true? [a b c d e f]))) (true? i) (false? i))\n :when (if (every? true? [k l]) (true? j) (false? j))\n :when (if (= 1 (count (filter true? [g h i]))) (true? k) (false? k))\n :when (if (= 4 (count (filter true? [a b c d e f g h i j k]))) (true? l) (false? l))]\n [a b c d e f g h i j k l]))\n","language":"Clojure"},{"code":"(defparameter *state* (make-list 12))\n\n(defparameter *statements* '(t ; 1\n (= (count-true '(7 8 9 10 11 12)) 3) ; 2\n (= (count-true '(2 4 6 8 10 12)) 2) ; 3\n (or (not (p 5)) (and (p 6) (p 7))) ; 4\n (and (not (p 2)) (not (p 3)) (not (p 4))) ; 5\n (= (count-true '(1 3 5 7 9 11)) 4) ; 6\n (or (and (p 2) (not (p 3))) (and (not (p 2)) (p 3))) ; 7\n (or (not (p 7)) (and (p 5) (p 6))) ; 8\n (= (count-true '(1 2 3 4 5 6)) 3) ; 9\n (and (p 11) (p 12)) ;10\n (= (count-true '(7 8 9)) 1) ;11\n (= (count-true '(1 2 3 4 5 6 7 8 9 10 11)) 4))) ;12\n\n(defun start ()\n (loop while (not (equal *state* '(t t t t t t t t t t t t)))\n do (progn (let ((true-stats (check)))\n\t\t (cond ((= true-stats 11) (result nil))\n\t\t\t ((= true-stats 12) (result t))))\n\t\t (new-state))))\n\n(defun check ()\n (loop for el in *state*\n for stat in *statements*\n counting (eq el (eval stat)) into true-stats\n finally (return true-stats)))\n\n(defun count-true (lst)\n (loop for i in lst\n counting (nth (- i 1) *state*) into total\n finally (return total)))\n\n(defun p (n)\n (nth (- n 1) *state*))\n\n(defun new-state ()\n (let ((contr t))\n (loop for i from 0 to 11\n do (progn (setf (nth i *state*) (not (eq (nth i *state*) contr)))\n (setq contr (and contr (not (nth i *state*))))))))\n\n(defun result (?)\n (format t \"~:[Missed by one~;Solution:~] ~%~{~:[F~;T~] ~}~%\" ? *state*))\n","language":"Common-Lisp"},{"code":"import std.stdio, std.algorithm, std.range, std.functional;\n\nimmutable texts = [\n \"this is a numbered list of twelve statements\",\n \"exactly 3 of the last 6 statements are true\",\n \"exactly 2 of the even-numbered statements are true\",\n \"if statement 5 is true, then statements 6 and 7 are both true\",\n \"the 3 preceding statements are all false\",\n \"exactly 4 of the odd-numbered statements are true\",\n \"either statement 2 or 3 is true, but not both\",\n \"if statement 7 is true, then 5 and 6 are both true\",\n \"exactly 3 of the first 6 statements are true\",\n \"the next two statements are both true\",\n \"exactly 1 of statements 7, 8 and 9 are true\",\n \"exactly 4 of the preceding statements are true\"];\n\nimmutable pure @safe @nogc bool function(in bool[])[12] predicates = [\n s => s.length == 12,\n s => s[$ - 6 .. $].sum == 3,\n s => s.dropOne.stride(2).sum == 2,\n s => s[4] ? (s[5] && s[6]) : true,\n s => s[1 .. 4].sum == 0,\n s => s.stride(2).sum == 4,\n s => s[1 .. 3].sum == 1,\n s => s[6] ? (s[4] && s[5]) : true,\n s => s[0 .. 6].sum == 3,\n s => s[10] && s[11],\n s => s[6 .. 9].sum == 1,\n s => s[0 .. 11].sum == 4];\n\nvoid main() @safe {\n enum nStats = predicates.length;\n\n foreach (immutable n; 0 .. 2 ^^ nStats) {\n bool[nStats] st, matches;\n nStats.iota.map!(i => !!(n & (2 ^^ i))).copy(st[]);\n st[].zip(predicates[].map!(f => f(st)))\n .map!(s_t => s_t[0] == s_t[1]).copy(matches[]);\n if (matches[].sum >= nStats - 1) {\n if (matches[].all)\n \">>> Solution:\".writeln;\n else\n writefln(\"Missed by statement: %d\",\n matches[].countUntil(false) + 1);\n writefln(\"%-(%s %)\", st[].map!q{ \"FT\"[a] });\n }\n }\n}\n","language":"D"},{"code":"len t[] 12\nfunc f n .\n if n = 1\n return if 12 = 12\n elif n = 2\n for i = 7 to 12\n s += t[i]\n .\n return if s = 3\n elif n = 3\n for i = 2 step 2 to 12\n s += t[i]\n .\n return if s = 2\n elif n = 4\n if t[5] = 1\n return if t[6] + t[7] = 2\n .\n return 1\n elif n = 5\n for i = 2 to 4\n s += t[i]\n .\n return if s = 0\n elif n = 6\n for i = 1 step 2 to 11\n s += t[i]\n .\n return if s = 4\n elif n = 7\n return if t[2] + t[3] = 1\n elif n = 8\n if t[7] = 1\n return if t[5] + t[6] = 2\n .\n return 1\n elif n = 9\n for i = 1 to 6\n s += t[i]\n .\n return if s = 3\n elif n = 10\n return if t[11] + t[12] = 2\n elif n = 11\n for i = 7 to 9\n s += t[i]\n .\n return if s = 1\n elif n = 12\n for i = 1 to 11\n s += t[i]\n .\n return if s = 4\n .\n.\nfor tst = 0 to 4095\n h = tst\n for i to 12\n t[i] = h mod 2\n h = h div 2\n .\n s = 0\n for i to 12\n s += if f i = t[i]\n .\n if s = 12\n print t[]\n .\n.\n","language":"EasyLang"},{"code":"class\n\tAPPLICATION\n\ncreate\n\tmake\n\nfeature\n\n\tmake\n\t\t\t-- Possible solutions.\n\t\tdo\n\t\t\tcreate s.make_filled (False, 1, 12)\n\t\t\ts [1] := True\n\t\t\trecurseAll (2)\n\t\t\tio.put_string (counter.out + \" solution found. \")\n\t\tend\n\nfeature {NONE}\n\n\ts: ARRAY [BOOLEAN]\n\n\tcheck2: BOOLEAN\n\t\t\t-- Is statement 2 fulfilled?\n\t\tlocal\n\t\t\tcount: INTEGER\n\t\tdo\n\t\t\tacross\n\t\t\t\t7 |..| 12 as c\n\t\t\tloop\n\t\t\t\tif s [c.item] then\n\t\t\t\t\tcount := count + 1\n\t\t\t\tend\n\t\t\tend\n\t\t\tResult := s [2] = (count = 3)\n\t\tend\n\n\tcheck3: BOOLEAN\n\t\t\t-- Is statement 3 fulfilled?\n\t\tlocal\n\t\t\tcount, i: INTEGER\n\t\tdo\n\t\t\tfrom\n\t\t\t\ti := 2\n\t\t\tuntil\n\t\t\t\ti > 12\n\t\t\tloop\n\t\t\t\tif s [i] then\n\t\t\t\t\tcount := count + 1\n\t\t\t\tend\n\t\t\t\ti := i + 2\n\t\t\tend\n\t\t\tResult := s [3] = (count = 2)\n\t\tend\n\n\tcheck4: BOOLEAN\n\t\t\t-- Is statement 4 fulfilled?\n\t\tdo\n\t\t\tResult := s [4] = ((not s [5]) or (s [6] and s [7]))\n\t\tend\n\n\tcheck5: BOOLEAN\n\t\t\t-- Is statement 5 fulfilled?\n\t\tdo\n\t\t\tResult := s [5] = ((not s [2]) and (not s [3]) and (not s [4]))\n\t\tend\n\n\tcheck6: BOOLEAN\n\t\t\t-- Is statement 6 fulfilled?\n\t\tlocal\n\t\t\tcount, i: INTEGER\n\t\tdo\n\t\t\tfrom\n\t\t\t\ti := 1\n\t\t\tuntil\n\t\t\t\ti > 11\n\t\t\tloop\n\t\t\t\tif s [i] then\n\t\t\t\t\tcount := count + 1\n\t\t\t\tend\n\t\t\t\ti := i + 2\n\t\t\tend\n\t\t\tResult := s [6] = (count = 4)\n\t\tend\n\n\tcheck7: BOOLEAN\n\t\t\t-- Is statement 7 fulfilled?\n\t\tdo\n\t\t\tResult := s [7] = ((s [2] or s [3]) and not (s [2] and s [3]))\n\t\tend\n\n\tcheck8: BOOLEAN\n\t\t\t-- Is statement 8 fulfilled?\n\t\tdo\n\t\t\tResult := s [8] = (not s [7] or (s [5] and s [6]))\n\t\tend\n\n\tcheck9: BOOLEAN\n\t\t\t-- Is statement 9 fulfilled?\n\t\tlocal\n\t\t\tcount: INTEGER\n\t\tdo\n\t\t\tacross\n\t\t\t\t1 |..| 6 as c\n\t\t\tloop\n\t\t\t\tif s [c.item] then\n\t\t\t\t\tcount := count + 1\n\t\t\t\tend\n\t\t\tend\n\t\t\tResult := s [9] = (count = 3)\n\t\tend\n\n\tcheck10: BOOLEAN\n\t\t\t-- Is statement 10 fulfilled?\n\t\tdo\n\t\t\tResult := s [10] = (s [11] and s [12])\n\t\tend\n\n\tcheck11: BOOLEAN\n\t\t\t-- Is statement 11 fulfilled?\n\t\tlocal\n\t\t\tcount: INTEGER\n\t\tdo\n\t\t\tacross\n\t\t\t\t7 |..| 9 as c\n\t\t\tloop\n\t\t\t\tif s [c.item] then\n\t\t\t\t\tcount := count + 1\n\t\t\t\tend\n\t\t\tend\n\t\t\tResult := s [11] = (count = 1)\n\t\tend\n\n\tcheck12: BOOLEAN\n\t\t\t-- Is statement 12 fulfilled?\n\t\tlocal\n\t\t\tcount: INTEGER\n\t\tdo\n\t\t\tacross\n\t\t\t\t1 |..| 11 as c\n\t\t\tloop\n\t\t\t\tif s [c.item] then\n\t\t\t\t\tcount := count + 1\n\t\t\t\tend\n\t\t\tend\n\t\t\tResult := (s [12] = (count = 4))\n\t\tend\n\n\tcounter: INTEGER\n\n\tcheckit\n\t\t\t-- Check if all statements are correctly solved.\n\t\tdo\n\t\t\tif check2 and check3 and check4 and check5 and check6 and check7 and check8 and check9 and check10 and check11 and check12 then\n\t\t\t\tacross\n\t\t\t\t\t1 |..| 12 as c\n\t\t\t\tloop\n\t\t\t\t\tif s [c.item] then\n\t\t\t\t\t\tio.put_string (c.item.out + \"%T\")\n\t\t\t\t\tend\n\t\t\t\tend\n\t\t\t\tio.new_line\n\t\t\t\tcounter := counter + 1\n\t\t\tend\n\t\tend\n\n\trecurseAll (k: INTEGER)\n\t\t\t-- All possible True and False combinations to check for a solution.\n\t\tdo\n\t\t\tif k = 13 then\n\t\t\t\tcheckit\n\t\t\telse\n\t\t\t\ts [k] := False\n\t\t\t\trecurseAll (k + 1)\n\t\t\t\ts [k] := True\n\t\t\t\trecurseAll (k + 1)\n\t\t\tend\n\t\tend\n\nend\n","language":"Eiffel"},{"code":"import system'routines;\nimport extensions;\nimport extensions'text;\n\nextension op\n{\n printSolution(bits)\n = self.zipBy(bits,\n (s,b => s.iif(\"T\",\"F\") + (s.xor(b)).iif(\"* \",\" \"))).summarize(new StringWriter());\n\n toBit()\n = self.iif(1,0);\n}\n\npuzzle = new Func1[]\n{\n (bits => bits.Length == 12),\n\n (bits => bits.last(6).selectBy::(x => x.toBit()).summarize() == 3 ),\n\n (bits => bits.zipBy(new Range(1, 12),\n (x,i => (i.toInt().isEven()).and(x).toBit())).summarize() == 2 ),\n\n (bits => bits[4].iif(bits[5] && bits[6],true) ),\n\n (bits => ((bits[1] || bits[2]) || bits[3]).Inverted ),\n\n (bits => bits.zipBy(new Range(1, 12),\n (x,i => (i.toInt().isOdd()).and(x).toBit() )).summarize() == 4 ),\n\n (bits => bits[1].xor(bits[2]) ),\n\n (bits => bits[6].iif(bits[5] && bits[4],true) ),\n\n (bits => bits.top(6).selectBy::(x => x.toBit() ).summarize() == 3 ),\n\n (bits => bits[10] && bits[11] ),\n\n (bits => (bits[6].toBit() + bits[7].toBit() + bits[8].toBit())==1 ),\n\n (bits => bits.top(11).selectBy::(x => x.toBit()).summarize() == 4 )\n};\n\npublic program()\n{\n console.writeLine();\n\n for(int n := 0; n < 2.power(12); n += 1)\n {\n var bits := BitArray32.load(n).top(12).toArray();\n var results := puzzle.selectBy::(r => r(bits)).toArray();\n\n var counts := bits.zipBy(results, (b,r => b.xor(r).toBit() )).summarize();\n\n counts =>\n 0 { console.printLine(\"Total hit :\",results.printSolution(bits)) }\n 1 { console.printLine(\"Near miss :\",results.printSolution(bits)) }\n 12 { console.printLine(\"Total miss:\",results.printSolution(bits)) };\n };\n\n console.readChar()\n}\n","language":"Elena"},{"code":"PROGRAM TWELVE_STMS\n\n!$DYNAMIC\nDIM PASS%[0],T%[0]\n\nFUNCTION EOR(X,Y)\n EOR=(X AND NOT(Y)) OR (NOT(X) AND Y)\nEND FUNCTION\n\nBEGIN\n NSTATEMENTS%=12\n !$DIM PASS%[NSTATEMENTS%],T%[NSTATEMENTS%]\n\n FOR TRY%=0 TO 2^NSTATEMENTS%-1 DO\n\n ! Postulate answer:\n FOR STMT%=1 TO 12 DO\n T%[STMT%]=(TRY% AND 2^(STMT%-1))<>0\n END FOR\n\n ! Test consistency:\n PASS%[1]=T%[1]=(NSTATEMENTS%=12)\n PASS%[2]=T%[2]=((T%[7]+T%[8]+T%[9]+T%[10]+T%[11]+T%[12])=-3)\n PASS%[3]=T%[3]=((T%[2]+T%[4]+T%[6]+T%[8]+T%[10]+T%[12])=-2)\n PASS%[4]=T%[4]=((NOT T%[5] OR (T%[6] AND T%[7])))\n PASS%[5]=T%[5]=(NOT T%[2] AND NOT T%[3] AND NOT T%[4])\n PASS%[6]=T%[6]=((T%[1]+T%[3]+T%[5]+T%[7]+T%[9]+T%[11])=-4)\n PASS%[7]=T%[7]=(EOR(T%[2],T%[3]))\n PASS%[8]=T%[8]=((NOT T%[7] OR (T%[5] AND T%[6])))\n PASS%[9]=T%[9]=((T%[1]+T%[2]+T%[3]+T%[4]+T%[5]+T%[6])=-3)\n PASS%[10]=T%[10]=(T%[11] AND T%[12])\n PASS%[11]=T%[11]=((T%[7]+T%[8]+T%[9])=-1)\n PASS%[12]=T%[12]=((T%[1]+T%[2]+T%[3]+T%[4]+T%[5]+T%[6]+T%[7]+T%[8]+T%[9]+T%[10]+T%[11])=-4)\n\n SUM=0\n FOR I%=1 TO 12 DO\n SUM=SUM+PASS%[I%]\n END FOR\n\n CASE SUM OF\n -11->\n PRINT(\"Near miss with statements \";)\n FOR STMT%=1 TO 12 DO\n IF T%[STMT%] THEN PRINT(STMT%;) END IF\n IF NOT PASS%[STMT%] THEN MISS%=STMT% END IF\n END FOR\n PRINT(\"true (failed \";MISS%;\").\")\n END ->\n -12->\n PRINT(\"Solution! with statements \";)\n FOR STMT%=1 TO 12 DO\n IF T%[STMT%] THEN PRINT(STMT%;) END IF\n END FOR\n PRINT(\"true.\")\n END ->\n END CASE\n\n END FOR ! TRY%\nEND PROGRAM\n","language":"ERRE"},{"code":": lastbit ( n1 -- n2)\n dup if 1 swap begin dup 1 <> while swap 1+ swap 1 rshift repeat drop then\n;\n\n: bit 1 swap lshift and 0<> ; ( n1 n2 -- f)\n: bitcount 0 swap begin dup while dup 1- and swap 1+ swap repeat drop ;\n\n12 constant #stat \\ number of statements\n \\ encoding of the statements\n: s1 >r #stat 12 = r> 0 bit = ; \\ heavy use of binary\n: s2 >r r@ 4032 and bitcount 3 = r> 1 bit = ;\n: s3 >r r@ 2730 and bitcount 2 = r> 2 bit = ;\n: s4 >r r@ 4 bit 0= 96 r@ over and = or r> 3 bit = ;\n: s5 >r r@ 14 and 0= r> 4 bit = ;\n: s6 >r r@ 1365 and bitcount 4 = r> 5 bit = ;\n: s7 >r r@ 1 bit r@ 2 bit xor r> 6 bit = ;\n: s8 >r r@ 6 bit 0= 48 r@ over and = or r> 7 bit = ;\n: s9 >r r@ 63 and bitcount 3 = r> 8 bit = ;\n: s10 >r 3072 r@ over and = r> 9 bit = ;\n: s11 >r r@ 448 and bitcount 1 = r> 10 bit = ;\n: s12 >r r@ 2047 and bitcount 4 = r> 11 bit = ;\n: list #stat 0 do dup i bit if i 1+ . then loop drop ;\n\n: nearmiss? \\ do we have a near miss?\n over #stat 1- = if ( true-pattern #true stat-pattern)\n .\" Near miss with statements \" dup list .\" true (failed \"\n >r over invert 1 #stat lshift 1- and lastbit 0 .r .\" )\" cr r>\n then \\ extract the failed statement\n;\n \\ have we found a solution?\n: solution? ( true-pattern #true stat-pattern)\n over #stat = if .\" Solution! with statements \" dup list .\" true.\" cr then\n;\n\n: 12statements \\ test the twelve patterns\n 1 #stat lshift 0 do \\ create another bit pattern\n i s12 2* i s11 + 2* i s10 + 2* i s9 + 2* i s8 + 2* i s7 + 2*\n i s6 + 2* i s5 + 2* i s4 + 2* i s3 + 2* i s2 + 2* i s1 +\n abs dup bitcount i solution? nearmiss? drop drop drop\n loop \\ count number of bytes and evaluate\n;\n\n12statements\n","language":"Forth"},{"code":"Dim As Integer nEnunciados = 12, intento, enun, errado\nDim As Integer Afirm(nEnunciados), T(nEnunciados)\n\nFor intento = 0 To 2^nEnunciados-1\n REM Postular respuesta:\n For enun = 1 To 12\n T(enun) = (intento And 2^(enun-1)) <> 0\n Next enum\n\n REM Prueba de consistencia:\n Afirm(1) = T(1) = (nEnunciados = 12)\n Afirm(2) = T(2) = ((T(7)+T(8)+T(9)+T(10)+T(11)+T(12)) = -3)\n Afirm(3) = T(3) = ((T(2)+T(4)+T(6)+T(8)+T(10)+T(12)) = -2)\n Afirm(4) = T(4) = ((Not T(5) Or (T(6) And T(7))))\n Afirm(5) = T(5) = (Not T(2) And Not T(3) And Not T(4))\n Afirm(6) = T(6) = ((T(1)+T(3)+T(5)+T(7)+T(9)+T(11)) = -4)\n Afirm(7) = T(7) = ((T(2) Or T(3)))\n Afirm(8) = T(8) = ((Not T(7) Or (T(5) And T(6))))\n Afirm(9) = T(9) = ((T(1)+T(2)+T(3)+T(4)+T(5)+T(6)) = -3)\n Afirm(10) = T(10) = (T(11) And T(12))\n Afirm(11) = T(11) = ((T(7)+T(8)+T(9)) = -1)\n Afirm(12) = T(12) = ((T(1)+T(2)+T(3)+T(4)+T(5)+T(6) + T(7)+T(8)+T(9)+T(10)+T(11)) = -4)\n\n Dim As Integer suma = 0\n For cont As Integer = 1 To 12\n suma += Afirm(cont)\n Next cont\n\n Select Case suma\n Case -11\n Color 7: Print \"Casi resuelto, con los enunciados \";\n For enun = 1 To 12\n If T(enun) Then Print ; enun; \" \";\n If Not Afirm(enun) Then errado = enun\n Next enun\n Print \"verdaderos (falsos\"; errado; \").\"\n Case -12\n Color 10: Print \"Resuelto! con los enunciados \";\n For enun = 1 To 12\n If T(enun) Then Print ; enun; \" \";\n Next enun\n Print \"verdaderos.\"\n End Select\nNext intento\nSleep\n","language":"FreeBASIC"},{"code":"package main\n\nimport \"fmt\"\n\n// its' not too much more work to check all the permutations concurrently\nvar solution = make(chan int)\nvar nearMiss = make(chan int)\nvar done = make(chan bool)\n\nfunc main() {\n // iterate and use the bits as the permutation\n for i := 0; i < 4096; i++ {\n go checkPerm(i)\n }\n // collect the misses and list them after the complete solution(s)\n var ms []int\n for i := 0; i < 4096; {\n select {\n case <-done:\n i++\n case s := <-solution:\n print12(\"solution\", s)\n case m := <-nearMiss:\n ms = append(ms, m)\n }\n }\n for _, m := range ms {\n print12(\"near miss\", m)\n }\n}\n\nfunc print12(label string, bits int) {\n fmt.Print(label, \":\")\n for i := 1; i <= 12; i++ {\n if bits&1 == 1 {\n fmt.Print(\" \", i)\n }\n bits >>= 1\n }\n fmt.Println()\n}\n\nfunc checkPerm(tz int) {\n // closure returns true if tz bit corresponding to\n // 1-based statement number is 1.\n ts := func(n uint) bool {\n return tz>>(n-1)&1 == 1\n }\n // variadic closure returns number of statements listed as arguments\n // which have corresponding tz bit == 1.\n ntrue := func(xs ...uint) int {\n nt := 0\n for _, x := range xs {\n if ts(x) {\n nt++\n }\n }\n return nt\n }\n // a flag used on repeated calls to test.\n // set to true when first contradiction is found.\n // if another is found, this function (checkPerm) can \"short circuit\"\n // and return immediately without checking additional statements.\n var con bool\n // closure called to test each statement\n test := func(statement uint, b bool) {\n switch {\n case ts(statement) == b:\n case con:\n panic(\"bail\")\n default:\n con = true\n }\n }\n // short circuit mechanism\n defer func() {\n if x := recover(); x != nil {\n if msg, ok := x.(string); !ok && msg != \"bail\" {\n panic(x)\n }\n }\n done <- true\n }()\n\n // 1. This is a numbered list of twelve statements.\n test(1, true)\n\n // 2. Exactly 3 of the last 6 statements are true.\n test(2, ntrue(7, 8, 9, 10, 11, 12) == 3)\n\n // 3. Exactly 2 of the even-numbered statements are true.\n test(3, ntrue(2, 4, 6, 8, 10, 12) == 2)\n\n // 4. If statement 5 is true, then statements 6 and 7 are both true.\n test(4, !ts(5) || ts(6) && ts(7))\n\n // 5. The 3 preceding statements are all false.\n test(5, !ts(4) && !ts(3) && !ts(2))\n\n // 6. Exactly 4 of the odd-numbered statements are true.\n test(6, ntrue(1, 3, 5, 7, 9, 11) == 4)\n\n // 7. Either statement 2 or 3 is true, but not both.\n test(7, ts(2) != ts(3))\n\n // 8. If statement 7 is true, then 5 and 6 are both true.\n test(8, !ts(7) || ts(5) && ts(6))\n\n // 9. Exactly 3 of the first 6 statements are true.\n test(9, ntrue(1, 2, 3, 4, 5, 6) == 3)\n\n // 10. The next two statements are both true.\n test(10, ts(11) && ts(12))\n\n // 11. Exactly 1 of statements 7, 8 and 9 are true.\n test(11, ntrue(7, 8, 9) == 1)\n\n // 12. Exactly 4 of the preceding statements are true.\n test(12, ntrue(1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11) == 4)\n\n // no short circuit? send permutation as either near miss or solution\n if con {\n nearMiss <- tz\n } else {\n solution <- tz\n }\n}\n","language":"Go"},{"code":"enum Rule {\n r01( 1, { r()*.num == (1..12) }),\n r02( 2, { r(7..12).count { it.truth } == 3 }),\n r03( 3, { r(2..12, 2).count { it.truth } == 2 }),\n r04( 4, { r(5).truth ? r(6).truth && r(7).truth : true }),\n r05( 5, { r(2..4).count { it.truth } == 0 }),\n r06( 6, { r(1..11, 2).count { it.truth } == 4 }),\n r07( 7, { r(2).truth != r(3).truth }),\n r08( 8, { r(7).truth ? r(5).truth && r(6).truth : true }),\n r09( 9, { r(1..6).count { it.truth } == 3 }),\n r10(10, { r(11).truth && r(12).truth }),\n r11(11, { r(7..9).count { it.truth } == 1 }),\n r12(12, { r(1..11).count { it.truth } == 4 });\n\n final int num\n final Closure statement\n boolean truth\n\n static final List<Rule> rules = [ null, r01, r02, r03, r04, r05, r06, r07, r08, r09, r10, r11, r12]\n\n private Rule(num, statement) {\n this.num = num\n this.statement = statement\n }\n\n public static Rule r(int index) { rules[index] }\n public static List<Rule> r() { rules[1..12] }\n public static List<Rule> r(List<Integer> indices) { rules[indices] }\n public static List<Rule> r(IntRange indices) { rules[indices] }\n public static List<Rule> r(IntRange indices, int step) { r(indices.step(step)) }\n\n public static void setAllTruth(int bits) {\n (1..12).each { r(it).truth = !(bits & (1 << (12 - it))) }\n }\n\n public static void evaluate() {\n def nearMisses = [:]\n (0..<(2**12)).each { i ->\n setAllTruth(i)\n def truthCandidates = r().findAll { it.truth }\n def truthMatchCount = r().count { it.statement() == it.truth }\n if (truthMatchCount == 12) {\n println \">Solution< ${truthCandidates*.num}\"\n } else if (truthMatchCount == 11) {\n def miss = (1..12).find { r(it).statement() != r(it).truth }\n nearMisses << [(truthCandidates): miss]\n }\n }\n nearMisses.each { truths, miss ->\n printf (\"Near Miss: %-21s (failed %2d)\\n\", \"${truths*.num}\", miss)\n }\n }\n}\n\nRule.evaluate()\n","language":"Groovy"},{"code":"import Data.List (findIndices)\n\ntf :: [[Int] -> Bool] -> [[Int]]\ntf = traverse (const [1, 0])\n\nwrongness :: [Int] -> [[Int] -> Bool] -> [Int]\nwrongness ns ps = findIndices id (zipWith (/=) ns (map (fromEnum . ($ ns)) ps))\n\nstatements :: [[Int] -> Bool]\nstatements =\n [ (== 12) . length\n , 3 ⊂ [length statements - 6 ..]\n , 2 ⊂ [1,3 ..]\n , 4 → [4 .. 6]\n , 0 ⊂ [1 .. 3]\n , 4 ⊂ [0,2 ..]\n , 1 ⊂ [1, 2]\n , 6 → [4 .. 6]\n , 3 ⊂ [0 .. 5]\n , 2 ⊂ [10, 11]\n , 1 ⊂ [6, 7, 8]\n , 4 ⊂ [0 .. 10]\n ]\n where\n (⊂), (→) :: Int -> [Int] -> [Int] -> Bool\n (s ⊂ x) b = s == (sum . map (b !!) . takeWhile (< length b)) x\n (a → x) b = (b !! a == 0) || all ((== 1) . (b !!)) x\n\ntestall :: [[Int] -> Bool] -> Int -> [([Int], [Int])]\ntestall s n =\n [ (b, w)\n | b <- tf s\n , w <- [wrongness b s]\n , length w == n ]\n\nmain :: IO ()\nmain =\n let t = testall statements\n in do putStrLn \"Answer\"\n mapM_ print $ t 0\n putStrLn \"Near misses\"\n mapM_ print $ t 1\n","language":"Haskell"},{"code":" apply\n128!:2\n\nNB. example\n '*:' apply 1 2 3\n1 4 9\n","language":"J"},{"code":" offby1=: 1=+/errors\n 'Statement ',\"1 (\":1+I.|: offby1 #\"1 errors),\"1 ' is inconsistent with exactly ',\"1 ((1\":@:+I.)\"1 #:I.offby1),\"1 ' being true'\nStatement 1 is inconsistent with exactly 5 8 11 being true\nStatement 1 is inconsistent with exactly 5 8 10 11 12 being true\nStatement 1 is inconsistent with exactly 4 8 10 11 12 being true\nStatement 8 is inconsistent with exactly 1 5 being true\nStatement 11 is inconsistent with exactly 1 5 8 being true\nStatement 12 is inconsistent with exactly 1 5 8 11 being true\nStatement 12 is inconsistent with exactly 1 5 8 10 11 12 being true\nStatement 8 is inconsistent with exactly 1 5 6 9 11 being true\nStatement 8 is inconsistent with exactly 1 4 being true\nStatement 12 is inconsistent with exactly 1 4 8 10 11 12 being true\nStatement 6 is inconsistent with exactly 1 4 6 8 9 being true\nStatement 7 is inconsistent with exactly 1 3 4 8 9 being true\nStatement 9 is inconsistent with exactly 1 3 4 6 7 9 being true\nStatement 12 is inconsistent with exactly 1 2 4 7 9 12 being true\nStatement 10 is inconsistent with exactly 1 2 4 7 9 10 being true\nStatement 8 is inconsistent with exactly 1 2 4 7 8 9 being true\n","language":"J"},{"code":"S=: <;._2 (0 :0)\n 12&=@# NB. 1. This is a numbered list of twelve statements.\n 3=+/@:{.~&_6 NB. 2. Exactly 3 of the last 6 statements are true.\n 2= +/@:{~&1 3 5 7 9 11 NB. 3. Exactly 2 of the even-numbered statements are true.\n 4&{=*./@:{~&4 5 6 NB. 4. If statement 5 is true, then statements 6 and 7 are both true.\n 0=+/@:{~&1 2 3 NB. 5. The 3 preceding statements are all false.\n 4=+/@:{~&0 2 4 6 8 10 NB. 6. Exactly 4 of the odd-numbered statements are true.\n 1=+/@:{~&1 2 NB. 7. Either statement 2 or 3 is true, but not both.\n 6&{=*./@:{~&4 5 6 NB. 8. If statement 7 is true, then 5 and 6 are both true.\n 3=+/@:{.~&6 NB. 9. Exactly 3 of the first 6 statements are true.\n 2=+/@:{~&10 11 NB. 10. The next two statements are both true.\n 1=+/@:{~&6 7 8 NB. 11. Exactly 1 of statements 7, 8 and 9 are true.\n 4=+/@:{.~&11 NB. 12. Exactly 4 of the preceding statements are true.\n)\n\ntestall=: (];\"1 0<@I.@:(]~:(apply&><))\"1) #:@i.@(2&^)@#\n","language":"J"},{"code":" (#~0=#@{::~&_1\"1) testall S\n┌───────────────────────┬┐\n│1 0 1 1 0 1 1 0 0 0 1 0││\n└───────────────────────┴┘\n","language":"J"},{"code":" 1+I.;(#~0=#@{::~&_1\"1) testall S\n1 3 4 6 7 11\n","language":"J"},{"code":" (#~1=#@{::~&_1\"1) testall S\n┌───────────────────────┬──┐\n│0 0 0 0 1 0 0 1 0 0 1 0│0 │\n├───────────────────────┼──┤\n│0 0 0 0 1 0 0 1 0 1 1 1│0 │\n├───────────────────────┼──┤\n│0 0 0 1 0 0 0 1 0 1 1 1│0 │\n├───────────────────────┼──┤\n│1 0 0 0 1 0 0 0 0 0 0 0│7 │\n├───────────────────────┼──┤\n│1 0 0 0 1 0 0 1 0 0 0 0│10│\n├───────────────────────┼──┤\n│1 0 0 0 1 0 0 1 0 0 1 0│11│\n├───────────────────────┼──┤\n│1 0 0 0 1 0 0 1 0 1 1 1│11│\n├───────────────────────┼──┤\n│1 0 0 0 1 1 0 0 1 0 1 0│7 │\n├───────────────────────┼──┤\n│1 0 0 1 0 0 0 0 0 0 0 0│7 │\n├───────────────────────┼──┤\n│1 0 0 1 0 0 0 1 0 1 1 1│11│\n├───────────────────────┼──┤\n│1 0 0 1 0 1 0 1 1 0 0 0│5 │\n├───────────────────────┼──┤\n│1 0 1 1 0 0 0 1 1 0 0 0│6 │\n├───────────────────────┼──┤\n│1 0 1 1 0 1 1 0 1 0 0 0│8 │\n├───────────────────────┼──┤\n│1 1 0 1 0 0 1 0 1 0 0 1│11│\n├───────────────────────┼──┤\n│1 1 0 1 0 0 1 0 1 1 0 0│9 │\n├───────────────────────┼──┤\n│1 1 0 1 0 0 1 1 1 0 0 0│7 │\n└───────────────────────┴──┘\n","language":"J"},{"code":" (-N)&{. #: S <:@]^:((]-.@-:(apply&><)\"1) (-N)&{.@#:@])^:(_) 2^N=.#S\n1 0 1 1 0 1 1 0 0 0 1 0\n","language":"J"},{"code":"true=:1 :'(m-1)&{'\n\nS=: <;._2 (0 :0)\n 12 = # NB. 1. This is a numbered list of twelve statements.\n 3 (= +/) _6&{. NB. 2. Exactly 3 of the last 6 statements are true.\n 2 (= +/) (12$0 1)&# NB. 3. Exactly 2 of the even-numbered statements are true.\n 5 true (<: */) 6 7 true NB. 4. If statement 5 is true, then statements 6 and 7 are both true.\n 0 (= +/) 2 3 4 true NB. 5. The 3 preceding statements are all false.\n 4 (= +/) (12$1 0)&# NB. 6. Exactly 4 of the odd-numbered statements are true.\n 1 (= +/) 2 3 true NB. 7. Either statement 2 or 3 is true, but not both.\n 7 true (<: */) 5 6 true NB. 8. If statement 7 is true, then 5 and 6 are both true.\n 3 (= +/) 6&{. NB. 9. Exactly 3 of the first 6 statements are true.\n */@(11 12 true) NB. 10. The next two statements are both true.\n 1 (= +/) 7 8 9 true NB. 11. Exactly 1 of statements 7, 8 and 9 are true.\n 4 (= +/) }: NB. 12. Exactly 4 of the preceding statements are true.\n)\n","language":"J"},{"code":"'sum not mask'=: |:\".;._2(0 :0)\n 0; 0; 0 0 0 0 0 0 0 0 0 0 0 0 NB. 1. This is a numbered list of twelve statements.\n 3; 0; 0 0 0 0 0 0 1 1 1 1 1 1 NB. 2. Exactly 3 of the last 6 statements are true.\n 2; 0; 0 1 0 1 0 1 0 1 0 1 0 1 NB. 3. Exactly 2 of the even-numbered statements are true.\n 2; 5; 0 0 0 0 0 1 1 0 0 0 0 0 NB. 4. If statement 5 is true, then statements 6 and 7 are both true.\n 0; 0; 0 1 1 1 0 0 0 0 0 0 0 0 NB. 5. The 3 preceding statements are all false.\n 4; 0; 1 0 1 0 1 0 1 0 1 0 1 0 NB. 6. Exactly 4 of the odd-numbered statements are true.\n 1; 0; 0 1 1 0 0 0 0 0 0 0 0 0 NB. 7. Either statement 2 or 3 is true, but not both.\n 2; 7; 0 0 0 0 1 1 0 0 0 0 0 0 NB. 8. If statement 7 is true, then 5 and 6 are both true.\n 3; 0; 1 1 1 1 1 1 0 0 0 0 0 0 NB. 9. Exactly 3 of the first 6 statements are true.\n 2; 0; 0 0 0 0 0 0 0 0 0 0 1 1 NB. 10. The next two statements are both true.\n 1; 0; 0 0 0 0 0 0 1 1 1 0 0 0 NB. 11. Exactly 1 of statements 7, 8 and 9 are true.\n 4; 0; 1 1 1 1 1 1 1 1 1 1 1 0 NB. 12. Exactly 4 of the preceding statements are true.\n)\npropositions=: |:#:i.2^#sum\n\nerrors=: propositions~:(1 - not { 1,propositions) >. sum = mask +/ .*propositions\n","language":"J"},{"code":" #:I.0=+/errors\n1 0 1 1 0 1 1 0 0 0 1 0\n 1+I.#:I.0=+/errors NB. true propositions for the consistent case\n1 3 4 6 7 11\n","language":"J"},{"code":"public class LogicPuzzle\n{\n boolean S[] = new boolean[13];\n int Count = 0;\n\n public boolean check2 ()\n {\n int count = 0;\n for (int k = 7; k <= 12; k++)\n if (S[k]) count++;\n return S[2] == (count == 3);\n }\n\n public boolean check3 ()\n {\n int count = 0;\n for (int k = 2; k <= 12; k += 2)\n if (S[k]) count++;\n return S[3] == (count == 2);\n }\n\n public boolean check4 ()\n {\n return S[4] == ( !S[5] || S[6] && S[7]);\n }\n\n public boolean check5 ()\n {\n return S[5] == ( !S[2] && !S[3] && !S[4]);\n }\n\n public boolean check6 ()\n {\n int count = 0;\n for (int k = 1; k <= 11; k += 2)\n if (S[k]) count++;\n return S[6] == (count == 4);\n }\n\n public boolean check7 ()\n {\n return S[7] == ((S[2] || S[3]) && !(S[2] && S[3]));\n }\n\n public boolean check8 ()\n {\n return S[8] == ( !S[7] || S[5] && S[6]);\n }\n\n public boolean check9 ()\n {\n int count = 0;\n for (int k = 1; k <= 6; k++)\n if (S[k]) count++;\n return S[9] == (count == 3);\n }\n\n public boolean check10 ()\n {\n return S[10] == (S[11] && S[12]);\n }\n\n public boolean check11 ()\n {\n int count = 0;\n for (int k = 7; k <= 9; k++)\n if (S[k]) count++;\n return S[11] == (count == 1);\n }\n\n public boolean check12 ()\n {\n int count = 0;\n for (int k = 1; k <= 11; k++)\n if (S[k]) count++;\n return S[12] == (count == 4);\n }\n\n public void check ()\n {\n if (check2() && check3() && check4() && check5() && check6()\n && check7() && check8() && check9() && check10() && check11()\n && check12())\n {\n for (int k = 1; k <= 12; k++)\n if (S[k]) System.out.print(k + \" \");\n System.out.println();\n Count++;\n }\n }\n\n public void recurseAll (int k)\n {\n if (k == 13)\n check();\n else\n {\n S[k] = false;\n recurseAll(k + 1);\n S[k] = true;\n recurseAll(k + 1);\n }\n }\n\n public static void main (String args[])\n {\n LogicPuzzle P = new LogicPuzzle();\n P.S[1] = true;\n P.recurseAll(2);\n System.out.println();\n System.out.println(P.Count + \" Solutions found.\");\n }\n}\n","language":"Java"},{"code":"def indexed(filter):\n . as $in\n | reduce range(0;length) as $i ([]; if ($i | filter) then . + [$in[$i]] else . end);\n\ndef count(value): map(select(. == value)) | length;\n\n# The truth or falsity of the 12 statements can be captured in an array of size 12:\ndef generate(k):\n if k == 1 then [true], [false]\n else generate(1) + generate(k-1)\n end;\n\n# Input: a boolean array\ndef evaluate:\n [ (length == 12), #1\n ((.[6:] | count(true)) == 3), #2\n ((indexed(. % 2 == 1) | count(true)) == 2), #3\n (if .[4] then .[5] and .[6] else true end), #4\n ((.[1:4] | count(false)) == 3), #5\n ((indexed(. % 2 == 0) | count(true)) == 4), #6\n (([.[1], .[2]] | count(true)) == 1), #7\n (if .[6] then .[4] and .[5] else true end), #8\n ((.[0:6] | count(true)) == 3), #9\n (.[10] and .[11]), #10\n ((.[6:9] | count(true)) == 1), #11\n ((.[0:11] | count(true)) == 4) #12\n ];\n\n# The following query generates the solution to the problem:\n# generate(12) | . as $vector | if evaluate == $vector then $vector else empty end\n\n# Running \"task\" as defined next would generate\n# both the general solution as well as the off-by-one solutions:\n\ndef task:\n\n # count agreements\n def agreed(x;y): reduce range(0;x|length) as $i (0; if x[$i] == y[$i] then .+1 else . end);\n\n reduce generate(12) as $vector\n ([]; ($vector | evaluate) as $e\n | agreed($vector; $e) as $agreed\n | if $agreed == 12 then [[12,$vector]] + .\n elif $agreed == 11 then . + [[11, $vector]]\n else .\n end);\n\n# Since the solutions have been given elsewhere, we simply count the\n# number of exact and off-by-one solutions:\n\ntask | length\n","language":"Jq"},{"code":"using Printf\n\nfunction showflaggedbits{T<:BitArray{1}}(a::T, f::T)\n tf = map(x->x ? \"T\" : \"F\", a)\n flg = map(x->x ? \"*\" : \" \", f)\n join(tf .* flg, \" \")\nend\n\nconst props = [s -> length(s) == 12,\n s -> sum(s[7:12]) == 3,\n s -> sum(s[2:2:end]) == 2,\n s -> !s[5] || (s[6] & s[7]),\n s -> !any(s[2:4]),\n s -> sum(s[1:2:end]) == 4,\n s -> s[2] $ s[3],\n s -> !s[7] || (s[5] & s[6]),\n s -> sum(s[1:6]) == 3,\n s -> s[11] & s[12],\n s -> sum(s[7:9]) == 1,\n s -> sum(s[1:end-1]) == 4]\n\nconst NDIG = length(props)\nNDIG < WORD_SIZE || println(\"WARNING, too many propositions!\")\n\nmhist = zeros(Int, NDIG+1)\n\nprintln(\"Checking the \", NDIG, \" statements against all possibilities.\\n\")\nprint(\" \"^15)\nfor i in 1:NDIG\n print(@sprintf \"%3d\" i)\nend\nprintln()\n\nfor i in 0:(2^NDIG-1)\n s = bitpack(digits(i, 2, NDIG))\n t = bitpack([p(s) for p in props])\n misses = s$t\n mcnt = sum(misses)\n mhist[NDIG-mcnt+1] += 1\n mcnt < 2 || mcnt == NDIG || continue\n if mcnt == 0\n print(\" Exact Match: \")\n elseif mcnt == NDIG\n print(\" Total Miss: \")\n else\n print(\" Near Miss: \")\n end\n println(showflaggedbits(t, misses))\nend\n\nprintln()\nprintln(\"Distribution of matches\")\nprintln(\" Matches Cases\")\nfor i in (NDIG+1):-1:1\n println(@sprintf \" %2d => %4d\" i-1 mhist[i])\nend\n","language":"Julia"},{"code":"// version 1.1.3\n\ntypealias Predicate = (String) -> Boolean\n\nval predicates = listOf<Predicate>(\n { it.length == 13 }, // indexing starts at 0 but first bit ignored\n { (7..12).count { i -> it[i] == '1' } == 3 },\n { (2..12 step 2).count { i -> it[i] == '1' } == 2 },\n { it[5] == '0' || (it[6] == '1' && it[7] == '1') },\n { it[2] == '0' && it[3] == '0' && it[4] == '0' },\n { (1..11 step 2).count { i -> it[i] == '1' } == 4 },\n { (it[2] == '1') xor (it[3] == '1') },\n { it[7] == '0' || (it[5] == '1' && it[6] == '1') },\n { (1..6).count { i -> it[i] == '1' } == 3 },\n { it[11] == '1' && it[12] == '1' },\n { (7..9).count { i -> it[i] == '1' } == 1 },\n { (1..11).count { i -> it[i] == '1' } == 4 }\n)\n\nfun show(s: String, indent: Boolean) {\n if (indent) print(\" \")\n for (i in s.indices) if (s[i] == '1') print(\"$i \")\n println()\n}\n\nfun main(args: Array<String>) {\n println(\"Exact hits:\")\n for (i in 0..4095) {\n val s = i.toString(2).padStart(13, '0')\n var j = 1\n if (predicates.all { it(s) == (s[j++] == '1') }) show(s, true)\n }\n\n println(\"\\nNear misses:\")\n for (i in 0..4095) {\n val s = i.toString(2).padStart(13, '0')\n var j = 1\n if (predicates.count { it(s) == (s[j++] == '1') } == 11) {\n var k = 1\n val iof = predicates.indexOfFirst { it(s) != (s[k++] == '1') } + 1\n print(\" (Fails at statement ${\"%2d\".format(iof)}) \")\n show(s, false)\n }\n }\n}\n","language":"Kotlin"},{"code":"Print[\"Answer:\\n\", Column@Cases[#, {s_, 0} :> s], \"\\nNear misses:\\n\",\n Column@Cases[#, {s_, 1} :> s]] &[{#,\n Count[Boole /@ {Length@# == 12, Total@#[[7 ;;]] == 3,\n Total@#[[2 ;; 12 ;; 2]] == 2, #[[5]] (#[[6]] + #[[7]] - 2) ==\n 0, Total@#[[2 ;; 4]] == 0,\n Total@#[[1 ;; 11 ;; 2]] == 4, #[[2]] + #[[3]] ==\n 1, #[[7]] (#[[5]] + #[[6]] - 2) == 0,\n Total@#[[;; 6]] == 3, #[[11]] + #[[12]] == 2,\n Total@#[[7 ;; 9]] == 1, Total@#[[;; 11]] == 4} - #,\n Except[0]]} & /@ Tuples[{1, 0}, 12]]\n","language":"Mathematica"},{"code":"import bitops, sequtils, strformat, strutils, sugar\n\ntype Bools = array[1..12, bool]\n\nconst Predicates = [1: (b: Bools) => b.len == 12,\n 2: (b: Bools) => b[7..12].count(true) == 3,\n 3: (b: Bools) => toSeq(countup(2, 12, 2)).mapIt(b[it]).count(true) == 2,\n 4: (b: Bools) => not b[5] or b[6] and b[7],\n 5: (b: Bools) => not b[2] and not b[3] and not b[4],\n 6: (b: Bools) => toSeq(countup(1, 12, 2)).mapIt(b[it]).count(true) == 4,\n 7: (b: Bools) => b[2] xor b[3],\n 8: (b: Bools) => not b[7] or b[5] and b[6],\n 9: (b: Bools) => b[1..6].count(true) == 3,\n 10: (b: Bools) => b[11] and b[12],\n 11: (b: Bools) => b[7..9].count(true) == 1,\n 12: (b: Bools) => b[1..11].count(true) == 4]\n\n\nproc `$`(b: Bools): string =\n toSeq(1..12).filterIt(b[it]).join(\" \")\n\n\necho \"Exacts hits:\"\nvar bools: Bools\nfor n in 0..4095:\n block check:\n for i in 1..12: bools[i] = n.testBit(12 - i)\n for i, predicate in Predicates:\n if predicate(bools) != bools[i]:\n break check\n echo \" \", bools\n\necho \"\\nNear misses:\"\nfor n in 0..4095:\n for i in 1..12: bools[i] = n.testBit(12 - i)\n var count = 0\n for i, predicate in Predicates:\n if predicate(bools) == bools[i]: inc count\n if count == 11:\n for i, predicate in Predicates:\n if predicate(bools) != bools[i]:\n echo &\" (Fails at statement {i:2}) {bools}\"\n break\n","language":"Nim"},{"code":"PROGRAM TwelveStatements;\n\n{\n This program searches through the 4095 possible sets\n of 12 statements for any which may be self-consistent.\n}\n\nCONST\n max12b = 4095; { Largest 12 byte number. }\n\nTYPE\n statnum = 1..12; { statement numbers }\n statset = set of statnum; { sets of statements }\n\nVAR { global variables for use in main algorithm }\n trialNumber: integer;\n trialSet, testResults: statset;\n\nfunction Convert(n: integer): statset;\n{\n Converts an integer into a set of statements.\n For each \"1\" in the last 12 bits of\n the integer's binary representation,\n a statement number is put into the set.\n}\nvar\n i: statnum;\n s: statset;\nbegin\n s := []; { Empty set. }\n for i := 12 downto 1 do begin\n if (n mod 2) = 1 then s := s + [i];\n n := n div 2\n end;\n Convert := s\nend;\n\nprocedure Express(truths: statset);\n{\n Writes the statement number of each \"truth\",\n with at least one space in front,\n all on one line.\n}\nvar n: statnum;\nbegin\n for n := 1 to 12 do\n if n in truths then write(n:3);\n writeln\nend;\n\nfunction Count(truths: statset): integer;\n{ Counts the statement numbers in the set. }\nvar\n s: statnum;\n i: integer;\nbegin\n i := 0;\n for s := 1 to 12 do if s in truths then i := i + 1;\n Count := i\nend;\n\nfunction Test(truths: statset): statset;\n{\n Starts with a set of supposedly true statements\n and checks which of the 12 statements can actually\n be confirmed about the set itself.\n}\nvar\n evens, odds, confirmations: statset;\nbegin\n evens := [2, 4, 6, 8, 10, 12];\n odds := [1, 3, 5, 7, 9, 11];\n\n { Statement 1 is necessarily true. }\n confirmations := [1];\n\n { Statement 2 }\n if Count(truths * [7..12]) = 3\n then confirmations := confirmations + [2];\n\n { Statement 3 }\n if Count(truths * evens) = 2\n then confirmations := confirmations + [3];\n\n { Statement 4 is true if 6 and 7 are true, or if 5 is false. }\n if ([6, 7] <= truths) or not (5 in truths)\n then confirmations := confirmations + [4];\n\n { Statement 5 }\n if [2, 3, 4] <= truths\n then confirmations := confirmations + [5];\n\n { Statement 6 }\n if Count(truths * odds) = 4\n then confirmations := confirmations + [6];\n\n { Statement 7 }\n if (2 in truths) xor (3 in truths)\n then confirmations := confirmations + [7];\n\n { Statement 8 is true if 5 and 6 are true, or if 7 is false. }\n if ([5, 6] <= truths) or not (7 in truths)\n then confirmations := confirmations + [8];\n\n { Statement 9 }\n if Count(truths * [1..6]) = 3\n then confirmations := confirmations + [9];\n\n { Statement 10 }\n if [11, 12] <= truths\n then confirmations := confirmations + [10];\n\n { Statement 11 }\n if Count(truths * [7, 8, 9]) = 1\n then confirmations := confirmations + [11];\n\n { Statement 12 }\n if Count(truths - [12]) = 4\n then confirmations := confirmations + [12];\n\n Test := confirmations\nend;\n\nBEGIN { Main algorithm. }\n for trialNumber := 1 to max12b do begin\n trialSet := Convert(trialNumber);\n testResults := Test(trialSet);\n if testResults = trialSet then Express(trialSet)\n end;\n writeln('Done. Press ENTER.');\n readln\nEND.\n","language":"Pascal"},{"code":"use List::Util 'sum';\n\nmy @condition = (\n sub { 0 }, # dummy sub for index 0\n sub { 13==@_ },\n sub { 3==sum @_[7..12] },\n sub { 2==sum @_[2,4,6,8,10,12] },\n sub { $_[5] ? ($_[6] and $_[7]) : 1 },\n sub { !$_[2] and !$_[3] and !$_[4] },\n sub { 4==sum @_[1,3,5,7,9,11] },\n sub { $_[2]==1-$_[3] },\n sub { $_[7] ? ($_[5] and $_[6]) : 1 },\n sub { 3==sum @_[1..6] },\n sub { 2==sum @_[11..12] },\n sub { 1==sum @_[7,8,9] },\n sub { 4==sum @_[1..11] },\n );\n\nsub miss {\n return grep { $condition[$_]->(@_) != $_[$_] } 1..12;\n}\n\nfor (0..2**12-1) {\n my @truth = split //, sprintf \"0%012b\", $_;\n my @no = miss @truth;\n print \"Solution: true statements are \", join( \" \", grep { $truth[$_] } 1..12), \"\\n\" if 0 == @no;\n print \"1 miss (\",$no[0],\"): true statements are \", join( \" \", grep { $truth[$_] } 1..12), \"\\n\" if 1 == @no;\n}\n","language":"Perl"},{"code":"(phixonline)-->\n <span style=\"color: #008080;\">function</span> <span style=\"color: #000000;\">s1</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: #008080;\">return</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;\">12</span> <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">function</span>\n <span style=\"color: #008080;\">function</span> <span style=\"color: #000000;\">s2</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: #008080;\">return</span> <span style=\"color: #7060A8;\">sum</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #7060A8;\">sq_eq</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">s</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">7</span><span style=\"color: #0000FF;\">..</span><span style=\"color: #000000;\">12</span><span style=\"color: #0000FF;\">],</span><span style=\"color: #008000;\">'1'</span><span style=\"color: #0000FF;\">))=</span><span style=\"color: #000000;\">3</span> <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">function</span>\n <span style=\"color: #008080;\">function</span> <span style=\"color: #000000;\">s3</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: #008080;\">return</span> <span style=\"color: #7060A8;\">sum</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #7060A8;\">sq_eq</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #7060A8;\">extract</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">s</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #7060A8;\">tagset</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">12</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: #008000;\">'1'</span><span style=\"color: #0000FF;\">))=</span><span style=\"color: #000000;\">2</span> <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">function</span>\n <span style=\"color: #008080;\">function</span> <span style=\"color: #000000;\">s4</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: #008080;\">return</span> <span style=\"color: #000000;\">s</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">5</span><span style=\"color: #0000FF;\">]=</span><span style=\"color: #008000;\">'0'</span> <span style=\"color: #008080;\">or</span> <span style=\"color: #000000;\">s</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: #008000;\">\"11\"</span> <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">function</span>\n <span style=\"color: #008080;\">function</span> <span style=\"color: #000000;\">s5</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: #008080;\">return</span> <span style=\"color: #000000;\">s</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: #008000;\">\"000\"</span> <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">function</span>\n <span style=\"color: #008080;\">function</span> <span style=\"color: #000000;\">s6</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: #008080;\">return</span> <span style=\"color: #7060A8;\">sum</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #7060A8;\">sq_eq</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #7060A8;\">extract</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">s</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #7060A8;\">tagset</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">12</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: #008000;\">'1'</span><span style=\"color: #0000FF;\">))=</span><span style=\"color: #000000;\">4</span> <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">function</span>\n <span style=\"color: #008080;\">function</span> <span style=\"color: #000000;\">s7</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: #008080;\">return</span> <span style=\"color: #000000;\">s</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">2</span><span style=\"color: #0000FF;\">]!=</span><span style=\"color: #000000;\">s</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">3</span><span style=\"color: #0000FF;\">]</span> <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">function</span>\n <span style=\"color: #008080;\">function</span> <span style=\"color: #000000;\">s8</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: #008080;\">return</span> <span style=\"color: #000000;\">s</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">7</span><span style=\"color: #0000FF;\">]=</span><span style=\"color: #008000;\">'0'</span> <span style=\"color: #008080;\">or</span> <span style=\"color: #000000;\">s</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">5</span><span style=\"color: #0000FF;\">..</span><span style=\"color: #000000;\">6</span><span style=\"color: #0000FF;\">]=</span><span style=\"color: #008000;\">\"11\"</span> <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">function</span>\n <span style=\"color: #008080;\">function</span> <span style=\"color: #000000;\">s9</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: #008080;\">return</span> <span style=\"color: #7060A8;\">sum</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #7060A8;\">sq_eq</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;\">6</span><span style=\"color: #0000FF;\">],</span><span style=\"color: #008000;\">'1'</span><span style=\"color: #0000FF;\">))=</span><span style=\"color: #000000;\">3</span> <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">function</span>\n <span style=\"color: #008080;\">function</span> <span style=\"color: #000000;\">s10</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: #008080;\">return</span> <span style=\"color: #000000;\">s</span><span style=\"color: #0000FF;\">[</span><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: #008000;\">\"11\"</span> <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">function</span>\n <span style=\"color: #008080;\">function</span> <span style=\"color: #000000;\">s11</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: #008080;\">return</span> <span style=\"color: #7060A8;\">sum</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #7060A8;\">sq_eq</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">s</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: #008000;\">'1'</span><span style=\"color: #0000FF;\">))=</span><span style=\"color: #000000;\">1</span> <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">function</span>\n <span style=\"color: #008080;\">function</span> <span style=\"color: #000000;\">s12</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: #008080;\">return</span> <span style=\"color: #7060A8;\">sum</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #7060A8;\">sq_eq</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;\">11</span><span style=\"color: #0000FF;\">],</span><span style=\"color: #008000;\">'1'</span><span style=\"color: #0000FF;\">))=</span><span style=\"color: #000000;\">4</span> <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">function</span>\n\n <span style=\"color: #004080;\">sequence</span> <span style=\"color: #000000;\">rtn</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #0000FF;\">{</span><span style=\"color: #000000;\">s1</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">s2</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">s3</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">s4</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">s5</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">s6</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">s7</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">s8</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">s9</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">s10</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">s11</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">s12</span><span style=\"color: #0000FF;\">}</span>\n <span style=\"color: #004080;\">string</span> <span style=\"color: #000000;\">misses</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #008000;\">\"\\n\"</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: #7060A8;\">power</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">2</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">12</span><span style=\"color: #0000FF;\">)-</span><span style=\"color: #000000;\">1</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: #7060A8;\">sprintf</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #008000;\">\"%012b\"</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;\">res</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">find_all</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #008000;\">'1'</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">s</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;\">0</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">pass</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">fail</span>\n <span style=\"color: #008080;\">for</span> <span style=\"color: #000000;\">b</span><span style=\"color: #0000FF;\">=</span><span style=\"color: #000000;\">1</span> <span style=\"color: #008080;\">to</span> <span style=\"color: #000000;\">12</span> <span style=\"color: #008080;\">do</span>\n <span style=\"color: #000000;\">pass</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">call_func</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">rtn</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">b</span><span style=\"color: #0000FF;\">],{</span><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;\">b</span><span style=\"color: #0000FF;\">]=</span><span style=\"color: #008000;\">'1'</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #008080;\">if</span> <span style=\"color: #008080;\">not</span> <span style=\"color: #000000;\">pass</span> <span style=\"color: #008080;\">then</span> <span style=\"color: #000000;\">fail</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">b</span> <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">if</span>\n <span style=\"color: #000000;\">t</span> <span style=\"color: #0000FF;\">+=</span> <span style=\"color: #000000;\">pass</span>\n <span style=\"color: #008080;\">if</span> <span style=\"color: #000000;\">b</span><span style=\"color: #0000FF;\">=</span><span style=\"color: #000000;\">12</span> <span style=\"color: #008080;\">and</span> <span style=\"color: #000000;\">t</span><span style=\"color: #0000FF;\">=</span><span style=\"color: #000000;\">12</span> <span style=\"color: #008080;\">then</span> <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;\">\"Solution: %v\\n\"</span><span style=\"color: #0000FF;\">,{</span><span style=\"color: #000000;\">res</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;\">for</span>\n <span style=\"color: #008080;\">if</span> <span style=\"color: #000000;\">t</span><span style=\"color: #0000FF;\">=</span><span style=\"color: #000000;\">11</span> <span style=\"color: #008080;\">then</span>\n <span style=\"color: #000000;\">misses</span> <span style=\"color: #0000FF;\">&=</span> <span style=\"color: #7060A8;\">sprintf</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #008000;\">\"Near miss: %v, fail on %d\\n\"</span><span style=\"color: #0000FF;\">,{</span><span style=\"color: #000000;\">res</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">fail</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: #7060A8;\">puts</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">misses</span><span style=\"color: #0000FF;\">)</span>\n<!--\n","language":"Phix"},{"code":"% {{trans|Prolog}}\ngo ?=>\n puzzle,\n fail, % check for more answers\n nl.\ngo => true.\n\npuzzle =>\n % 1. This is a numbered list of twelve statements.\n\tL = [A1, A2, A3, A4, A5, A6, A7, A8, A9, A10, A11, A12],\n\tL :: 0..1,\n\telement(1, L, 1),\n\n % 2. Exactly 3 of the last 6 statements are true.\n\tA2 #<=> sum(L[7..12]) #= 3,\n\n % 3. Exactly 2 of the even-numbered statements are true.\n\tA3 #<=> sum([L[I]:I in 1..12,I mod 2 == 0]) #= 2,\n\n % 4. If statement 5 is true, then statements 6 and 7 are both true.\n\tA4 #<=> (A5 #=> (A6 #/\\ A7)),\n\n % 5. The 3 preceding statements are all false.\n\tA5 #<=> sum(L[2..4]) #= 0,\n\n % 6. Exactly 4 of the odd-numbered statements are true.\n\tA6 #<=> sum([L[I]:I in 1..12,I mod 2 == 1]) #= 4,\n\n % 7. Either statement 2 or 3 is true, but not both.\n\tA7 #<=> (A2 + A3 #= 1),\n\n % 8. If statement 7 is true, then 5 and 6 are both true.\n\tA8 #<=> (A7 #=> A5 #/\\ A6),\n\n % 9. Exactly 3 of the first 6 statements are true.\n\tA9 #<=> sum(L[1..6]) #= 3,\n\n % 10. The next two statements are both true.\n\tA10 #<=> (A11 #/\\ A12),\n\n % 11. Exactly 1 of statements 7, 8 and 9 are true.\n\tA11 #<=> (A7 + A8 + A9 #= 1),\n\n % 12. Exactly 4 of the preceding statements are true.\n A12 #<=> sum(L[1..11]) #= 4,\n\n\tsolve(L),\n\n println('L'=L),\n\tprintf(\"Statements %w are true.\\n\", [I.to_string : I in 1..12, L[I] == 1].join(\" \")),\n\tnl.\n","language":"Picat"},{"code":"puzzle :-\n % 1. This is a numbered list of twelve statements.\n\tL = [A1, A2, A3, A4, A5, A6, A7, A8, A9, A10, A11, A12],\n\tL ins 0..1,\n\telement(1, L, 1),\n\n % 2. Exactly 3 of the last 6 statements are true.\n\tA2 #<==> A7 + A8 + A9 + A10 + A11 + A12 #= 3,\n\n % 3. Exactly 2 of the even-numbered statements are true.\n\tA3 #<==> A2 + A4 + A6 + A8 + A10 + A12 #= 2,\n\n % 4. If statement 5 is true, then statements 6 and 7 are both true.\n\tA4 #<==> (A5 #==> (A6 #/\\ A7)),\n\n % 5. The 3 preceding statements are all false.\n\tA5 #<==> A2 + A3 + A4 #= 0,\n\n % 6. Exactly 4 of the odd-numbered statements are true.\n\tA6 #==> A1 + A3 + A5 + A7 + A9 + A11 #= 4,\n\n % 7. Either statement 2 or 3 is true, but not both.\n\tA7 #<==> A2 + A3 #= 1,\n\n % 8. If statement 7 is true, then 5 and 6 are both true.\n\tA8 #<==> (A7 #==> A5 #/\\ A6),\n\n\n % 9. Exactly 3 of the first 6 statements are true.\n\tA9 #<==> A1 + A2 + A3 + A4 + A5 + A6 #= 3,\n\n % 10. The next two statements are both true.\n\tA10 #<==> A11 #/\\ A12,\n\n % 11. Exactly 1 of statements 7, 8 and 9 are true.\n\tA11 #<==> A7 + A8 + A9 #= 1,\n\n % 12. Exactly 4 of the preceding statements are true.\n\tA12 #<==> A1 + A2 + A3 + A4 + A5 + A6 + A7 +A8 + A9 + A10 + A11 #= 4,\n\n\tlabel(L),\n numlist(1, 12, NL),\n\twrite('Statements '),\n\tmaplist(my_write, NL, L),\n\twriteln('are true').\n\n\nmy_write(N, 1) :-\n\tformat('~w ', [N]).\n\nmy_write(_N, 0).\n","language":"Prolog"},{"code":"from itertools import product\n#from pprint import pprint as pp\n\nconstraintinfo = (\n (lambda st: len(st) == 12 ,(1, 'This is a numbered list of twelve statements')),\n (lambda st: sum(st[-6:]) == 3 ,(2, 'Exactly 3 of the last 6 statements are true')),\n (lambda st: sum(st[1::2]) == 2 ,(3, 'Exactly 2 of the even-numbered statements are true')),\n (lambda st: (st[5]&st[6]) if st[4] else 1 ,(4, 'If statement 5 is true, then statements 6 and 7 are both true')),\n (lambda st: sum(st[1:4]) == 0 ,(5, 'The 3 preceding statements are all false')),\n (lambda st: sum(st[0::2]) == 4 ,(6, 'Exactly 4 of the odd-numbered statements are true')),\n (lambda st: sum(st[1:3]) == 1 ,(7, 'Either statement 2 or 3 is true, but not both')),\n (lambda st: (st[4]&st[5]) if st[6] else 1 ,(8, 'If statement 7 is true, then 5 and 6 are both true')),\n (lambda st: sum(st[:6]) == 3 ,(9, 'Exactly 3 of the first 6 statements are true')),\n (lambda st: (st[10]&st[11]) ,(10, 'The next two statements are both true')),\n (lambda st: sum(st[6:9]) == 1 ,(11, 'Exactly 1 of statements 7, 8 and 9 are true')),\n (lambda st: sum(st[0:11]) == 4 ,(12, 'Exactly 4 of the preceding statements are true')),\n)\n\ndef printer(st, matches):\n if False in matches:\n print('Missed by one statement: %i, %s' % docs[matches.index(False)])\n else:\n print('Full match:')\n print(' ' + ', '.join('%i:%s' % (i, 'T' if t else 'F') for i, t in enumerate(st, 1)))\n\nfuncs, docs = zip(*constraintinfo)\n\nfull, partial = [], []\n\nfor st in product( *([(False, True)] * 12) ):\n truths = [bool(func(st)) for func in funcs]\n matches = [s == t for s,t in zip(st, truths)]\n mcount = sum(matches)\n if mcount == 12:\n full.append((st, matches))\n elif mcount == 11:\n partial.append((st, matches))\n\nfor stm in full + partial:\n printer(*stm)\n","language":"Python"},{"code":"#lang racket\n\n;; A quick `amb' implementation\n(define failures null)\n(define (fail)\n (if (pair? failures) ((first failures)) (error \"no more choices!\")))\n(define (amb/thunks choices)\n (let/cc k (set! failures (cons k failures)))\n (if (pair? choices)\n (let ([choice (first choices)]) (set! choices (rest choices)) (choice))\n (begin (set! failures (rest failures)) (fail))))\n(define-syntax-rule (amb E ...) (amb/thunks (list (lambda () E) ...)))\n(define (assert condition) (unless condition (fail)))\n\n;; just to make things more fun\n(define (⇔ x y) (assert (eq? x y)))\n(require (only-in racket [and ∧] [or ∨] [implies ⇒] [xor ⊻] [not ¬]))\n(define (count xs)\n (let loop ([n 0] [xs xs])\n (if (null? xs) n (loop (if (car xs) (add1 n) n) (cdr xs)))))\n;; even more fun, make []s infix\n(require (only-in racket [#%app r:app]))\n(define-syntax (#%app stx)\n (if (not (eq? #\\[ (syntax-property stx 'paren-shape)))\n (syntax-case stx () [(_ x ...) #'(r:app x ...)])\n (syntax-case stx ()\n ;; extreme hack on next two cases, so it works for macros too.\n [(_ x op y) (syntax-property #'(op x y) 'paren-shape #f)]\n [(_ x op y op1 z) (free-identifier=? #'op #'op1)\n (syntax-property #'(op x y z) 'paren-shape #f)])))\n;; might as well do more\n(define-syntax-rule (define-booleans all x ...)\n (begin (define x (amb #t #f)) ...\n (define all (list x ...))))\n\n(define (puzzle)\n (define-booleans all q1 q2 q3 q4 q5 q6 q7 q8 q9 q10 q11 q12)\n ;; 1. This is a numbered list of twelve statements.\n [q1 ⇔ [12 = (length all)]]\n ;; 2. Exactly 3 of the last 6 statements are true.\n [q2 ⇔ [3 = (count (take-right all 6))]]\n ;; 3. Exactly 2 of the even-numbered statements are true.\n [q3 ⇔ [2 = (count (list q2 q4 q6 q8 q10 q12))]]\n ;; 4. If statement 5 is true, then statements 6 and 7 are both true.\n [q4 ⇔ [q5 ⇒ [q6 ∧ q7]]]\n ;; 5. The 3 preceding statements are all false.\n [q5 ⇔ (¬ [q2 ∨ q3 ∨ q4])]\n ;; 6. Exactly 4 of the odd-numbered statements are true.\n [q6 ⇔ [4 = (count (list q1 q3 q5 q7 q9 q11))]]\n ;; 7. Either statement 2 or 3 is true, but not both.\n [q7 ⇔ [q2 ⊻ q3]]\n ;; 8. If statement 7 is true, then 5 and 6 are both true.\n [q8 ⇔ [q7 ⇒ (and q5 q6)]]\n ;; 9. Exactly 3 of the first 6 statements are true.\n [q9 ⇔ [3 = (count (take all 3))]]\n ;; 10. The next two statements are both true.\n [q10 ⇔ [q11 ∧ q12]]\n ;; 11. Exactly 1 of statements 7, 8 and 9 are true.\n [q11 ⇔ [1 = (count (list q7 q8 q9))]]\n ;; 12. Exactly 4 of the preceding statements are true.\n [q12 ⇔ [4 = (count (drop-right all 1))]]\n ;; done\n (for/list ([i (in-naturals 1)] [q all] #:when q) i))\n\n(puzzle)\n;; -> '(1 3 4 6 7 11)\n","language":"Racket"},{"code":"sub infix:<→> ($protasis, $apodosis) { !$protasis or $apodosis }\n\nmy @tests =\n { .end == 12 and all(.[1..12]) === any(True, False) },\n { 3 == [+] .[7..12] },\n { 2 == [+] .[2,4...12] },\n { .[5] → all .[6,7] },\n { none .[2,3,4] },\n { 4 == [+] .[1,3...11] },\n { one .[2,3] },\n { .[7] → all .[5,6] },\n { 3 == [+] .[1..6] },\n { all .[11,12] },\n { one .[7,8,9] },\n { 4 == [+] .[1..11] },\n;\n\nmy @solutions;\nmy @misses;\n\nfor [X] (True, False) xx 12 {\n my @assert = Nil, |$_;\n my @result = Nil, |@tests.map({ ?.(@assert) });\n my @true = @assert.grep(?*, :k);\n my @cons = (@assert Z=== @result).grep(!*, :k);\n given @cons {\n when 0 { push @solutions, \"<{@true}> is consistent.\"; }\n when 1 { push @misses, \"<{@true}> implies { \"¬\" if !@result[~$_] }$_.\" }\n }\n}\n\n.say for @solutions;\nsay \"\";\nsay \"Near misses:\";\n.say for @misses;\n","language":"Raku"},{"code":"/*REXX program solves the \"Twelve Statement Puzzle\". */\nq=12; @stmt=right('statement',20) /*number of statements in the puzzle. */\nm=0 /*[↓] statement one is TRUE by fiat.*/\n do pass=1 for 2 /*find the maximum number of \"trues\". */\n do e=0 for 2**(q-1); n = '1'right( x2b( d2x( e ) ), q-1, 0)\n do b=1 for q /*define various bits in the number Q.*/\n @.b=substr(n, b, 1) /*define a particular @ bit (in Q).*/\n end /*b*/\n if @.1 then if yeses(1, 1) \\==1 then iterate\n if @.2 then if yeses(7, 12) \\==3 then iterate\n if @.3 then if yeses(2, 12,2) \\==2 then iterate\n if @.4 then if yeses(5, 5) then if yeses(6, 7) \\==2 then iterate\n if @.5 then if yeses(2, 4) \\==0 then iterate\n if @.6 then if yeses(1, 12,2) \\==4 then iterate\n if @.7 then if yeses(2, 3) \\==1 then iterate\n if @.8 then if yeses(7, 7) then if yeses(5,6) \\==2 then iterate\n if @.9 then if yeses(1, 6) \\==3 then iterate\n if @.10 then if yeses(11,12) \\==2 then iterate\n if @.11 then if yeses(7, 9) \\==1 then iterate\n if @.12 then if yeses(1, 11) \\==4 then iterate\n g=yeses(1, 12)\n if pass==1 then do; m=max(m,g); iterate; end\n else if g\\==m then iterate\n do j=1 for q; z=substr(n, j, 1)\n if z then say @stmt right(j, 2) \" is \" word('false true', 1 + z)\n end /*tell*/\n end /*e*/\n end /*pass*/\nexit /*stick a fork in it, we're all done. */\n/*──────────────────────────────────────────────────────────────────────────────────────*/\nyeses: parse arg L,H,B; #=0; do i=L to H by word(B 1, 1); #=#+@.i; end; return #\n","language":"REXX"},{"code":"/*REXX program solves the \"Twelve Statement Puzzle\". */\nq=12; @stmt=right('statement',20) /*number of statements in the puzzle. */\nm=0 /*[↓] statement one is TRUE by fiat.*/\n do pass=1 for 2 /*find the maximum number of \"trues\". */\n do e=0 for 2**(q-1); n = '1'right( x2b( d2x( e ) ), q-1, 0)\n do b=1 for q /*define various bits in the number Q.*/\n @.b=substr(n, b, 1) /*define a particular @ bit (in Q).*/\n end /*b*/\n if @.1 then if \\ @.1 then iterate\n if @.2 then if @.7+@.8+@.9+@.10+@.11+@.12 \\==3 then iterate\n if @.3 then if @.2+@.4+@.6+@.8+@.10+@.12 \\==2 then iterate\n if @.4 then if @.5 then if \\(@.6 & @.7) then iterate\n if @.5 then if @.2 | @.3 | @.4 then iterate\n if @.6 then if @.1+@.3+@.5+@.7+@.9+@.11 \\==4 then iterate\n if @.7 then if \\ (@.2 && @.3 ) then iterate\n if @.8 then if @.7 then if \\(@.5 & @.6) then iterate\n if @.9 then if @.1+@.2+@.3+@.4+@.5+@.6 \\==3 then iterate\n if @.10 then if \\ (@.11 & @.12) then iterate\n if @.11 then if @.7+@.8+@.9 \\==1 then iterate\n g=@.1 +@.2 +@.3 +@.4 +@.5 +@.6 +@.7 +@.8+ @.9 +@.10 +@.11\n if @.12 then if g \\==4 then iterate\n g=g + @.12\n if pass==1 then do; m=max(m,g); iterate; end\n else if g\\==m then iterate\n do j=1 for q; z=substr(n, j, 1)\n if z then say @stmt right(j, 2) \" is \" word('false true', 1+z)\n end /*tell*/\n end /*e*/\n end /*pass*/ /*stick a fork in it, we're all done. */\n","language":"REXX"},{"code":"/*REXX program solves the \"Twelve Statement Puzzle\". */\nq=12; @stmt=right('statement',20) /*number of statements in the puzzle. */\nm=0 /*[↓] statement one is TRUE by fiat.*/\n do pass=1 for 2 /*find the maximum number of \"trues\". */\n do e=0 for 2**(q-1); n = '1'right( x2b( d2x( e ) ), q-1, 0)\n parse var n @1 2 @2 3 @3 4 @4 5 @5 6 @6 7 @7 8 @8 9 @9 10 @10 11 @11 12 @12\n/*▒▒▒▒ if @1 then if \\ @1 then iterate ▒▒▒▒*/\n if @2 then if @7+@8+@9+@10+@11+@12 \\==3 then iterate\n if @3 then if @2+@4+@6+@8+@10+@12 \\==2 then iterate\n if @4 then if @5 then if \\(@6 & @7) then iterate\n if @5 then if @2 | @3 | @4 then iterate\n if @6 then if @1+@3+@5+@7+@9+@11 \\==4 then iterate\n if @7 then if \\ (@2 && @3 ) then iterate\n if @8 then if @7 then if \\(@5 & @6) then iterate\n if @9 then if @1+@2+@3+@4+@5+@6 \\==3 then iterate\n if @10 then if \\ (@11 & @12) then iterate\n if @11 then if @7+@8+@9 \\==1 then iterate\n g=@1 + @2 + @3 + @4 + @5 + @6 + @7 + @8 + @9 + @10 + @11\n if @12 then if g \\==4 then iterate\n g=g + @12\n if pass==1 then do; m=max(m,g); iterate; end\n else if g\\==m then iterate\n do j=1 for q; z=substr(n, j, 1)\n if z then say @stmt right(j, 2) \" is \" word('false true', 1+z)\n end /*j*/\n end /*e*/\n end /*pass*/ /*stick a fork in it, we're all done. */\n","language":"REXX"},{"code":"constraints = [\n ->(st) { st.size == 12 },\n ->(st) { st.last(6).count(true) == 3 },\n ->(st) { st.each_slice(2).map(&:last).count(true) == 2 },\n ->(st) { st[4] ? (st[5] & st[6]) : true },\n ->(st) { st[1..3].none? },\n ->(st) { st.each_slice(2).map(&:first).count(true) == 4 },\n ->(st) { st[1] ^ st[2] },\n ->(st) { st[6] ? (st[4] & st[5]) : true },\n ->(st) { st.first(6).count(true) == 3 },\n ->(st) { st[10] & st[11] },\n ->(st) { st[6..8].one? },\n ->(st) { st[0,11].count(true) == 4 },\n]\n\nResult = Struct.new(:truths, :consistency)\n\nresults = [true, false].repeated_permutation(12).map do |truths|\n Result.new(truths, constraints.zip(truths).map {|cn,truth| cn[truths] == truth })\nend\n\nputs \"solution:\",\n results.find {|r| r.consistency.all? }.truths.to_s\n\nputs \"\\nnear misses: \"\nnear_misses = results.select {|r| r.consistency.count(false) == 1 }\nnear_misses.each do |r|\n puts \"missed by statement #{r.consistency.index(false) + 1}\", r.truths.to_s\nend\n","language":"Ruby"},{"code":"class LogicPuzzle {\n val s = new Array[Boolean](13)\n var count = 0\n\n def check2: Boolean = {\n var count = 0\n for (k <- 7 to 12) if (s(k)) count += 1\n\n s(2) == (count == 3)\n }\n\n def check3: Boolean = {\n var count = 0\n for (k <- 2 to 12 by 2) if (s(k)) count += 1\n\n s(3) == (count == 2)\n }\n\n def check4: Boolean = s(4) == (!s(5) || s(6) && s(7))\n\n def check5: Boolean = s(5) == (!s(2) && !s(3) && !s(4))\n\n def check6: Boolean = {\n var count = 0\n for (k <- 1 to 11 by 2) if (s(k)) count += 1\n s(6) == (count == 4)\n }\n\n def check7: Boolean = s(7) == ((s(2) || s(3)) && !(s(2) && s(3)))\n\n def check8: Boolean = s(8) == (!s(7) || s(5) && s(6))\n\n def check9: Boolean = {\n var count = 0\n for (k <- 1 to 6) if (s(k)) count += 1\n\n s(9) == (count == 3)\n }\n\n def check10: Boolean = s(10) == (s(11) && s(12))\n\n def check11: Boolean = {\n var count = 0\n for (k <- 7 to 9) if (s(k)) count += 1\n\n s(11) == (count == 1)\n }\n\n def check12: Boolean = {\n var count = 0\n for (k <- 1 to 11) if (s(k)) count += 1\n s(12) == (count == 4)\n }\n\n def check(): Unit = {\n if (check2 && check3 && check4 && check5 && check6 && check7 && check8 && check9 && check10 && check11 && check12) {\n for (k <- 1 to 12) if (s(k)) print(k + \" \")\n println()\n count += 1\n }\n }\n\n def recurseAll(k: Int): Unit = {\n if (k == 13) check()\n else {\n s(k) = false\n recurseAll(k + 1)\n s(k) = true\n recurseAll(k + 1)\n }\n }\n}\n\nobject LogicPuzzle extends App {\n val p = new LogicPuzzle\n p.s(1) = true\n p.recurseAll(2)\n println()\n println(s\"${p.count} Solutions found.\")\n\n}\n","language":"Scala"},{"code":"var conditions = [\n { false },\n {|a| a.len == 13 },\n {|a| [a[7..12]].count(true) == 3 },\n {|a| [a[2..12 `by` 2]].count(true) == 2 },\n {|a| a[5] ? (a[6] && a[7]) : true },\n {|a| !a[2] && !a[3] && !a[4] },\n {|a| [a[1..11 `by` 2]].count(true) == 4 },\n {|a| a[2] == true^a[3] },\n {|a| a[7] ? (a[5] && a[6]) : true },\n {|a| [a[1..6]].count(true) == 3 },\n {|a| [a[11,12]].count(true) == 2 },\n {|a| [a[7..9]].count(true) == 1 },\n {|a| [a[1..11]].count(true) == 4 },\n]\n\nfunc miss(args) {\n 1..12 -> grep {|i| conditions[i](args) != args[i] }\n}\n\nfor k in (^(1<<12)) {\n var t = (\"0%012b\" % k -> chars.map {|bit| bit == '1' })\n var no = miss(t)\n no.len == 0 && say \"Solution: true statements are #{1..12->grep{t[_]}.join(' ')}\"\n no.len == 1 && say \"1 miss (#{no[0]}): true statements are #{1..12->grep{t[_]}.join(' ')}\"\n}\n","language":"Sidef"},{"code":"package require Tcl 8.6\n\n# Function to evaluate the truth of a statement\nproc tcl::mathfunc::S {idx} {\n upvar 1 state s\n apply [lindex $s [expr {$idx - 1}]] $s\n}\n# Procedure to count the number of statements which are true\nproc S+ args {\n upvar 1 state state\n tcl::mathop::+ {*}[lmap i $args {expr {S($i)}}]\n}\n# Turn a list of expressions into a list of lambda terms\nproc lambdas items {lmap x $items {list state [list expr $x]}}\n\n# Find the truth assignment that produces consistency. And those that are\n# near misses too.\nproc findTruthMatch {statements} {\n set n [llength $statements]\n for {set i 0} {$i < 2**$n} {incr i} {\n\tset state [split [format %0.*b $n $i] \"\"]\n\tset truths [lmap f $statements {apply $f [lambdas $state]}]\n\tset counteq [tcl::mathop::+ {*}[lmap s $state t $truths {expr {\n\t $s == $t\n\t}}]]\n\tif {$counteq == $n} {\n\t lappend exact $state\n\t} elseif {$counteq == $n-1} {\n\t set j 0\n\t foreach s $state t $truths {\n\t\tincr j\n\t\tif {$s != $t} {\n\t\t lappend differ $state $j\n\t\t break\n\t\t}\n\t }\n\t}\n }\n return [list $exact $differ]\n}\n\n# Rendering code\nproc renderstate state {\n return ([join [lmap s $state {\n\tincr i\n\texpr {$s ? \"S($i)\" : \"\\u00acS($i)\"}\n }] \"\\u22c0\"])\n}\n\n# The statements, encoded as expressions\nset statements {\n {[llength $state] == 12}\n {[S+ 7 8 9 10 11 12] == 3}\n {[S+ 2 4 6 8 10 12] == 2}\n {S(5) ? S(6) && S(7) : 1}\n {[S+ 2 3 4] == 0}\n {[S+ 1 3 5 7 9 11] == 4}\n {S(2) != S(3)}\n {S(7) ? S(5) && S(6) : 1}\n {[S+ 1 2 3 4 5 6] == 3}\n {S(11) && S(12)}\n {[S+ 7 8 9] == 1}\n {[S+ 1 2 3 4 5 6 7 8 9 10 11] == 4}\n}\n# Find the truth assignment(s) that give consistency\nlassign [findTruthMatch [lambdas $statements]] exact differ\n# Print the results\nforeach state $exact {\n puts \"exact match\\t[renderstate $state ]\"\n}\nforeach {state j} $differ {\n puts \"almost found\\t[renderstate $state] \\u21d2 [expr {[lindex $state $j-1]?\"\\u00ac\":{}}]S($j)\"\n}\n","language":"Tcl"},{"code":"(defmacro defconstraints (name size-name (var) . forms)\n ^(progn (defvar ,size-name ,(length forms))\n (defun ,name (,var)\n (list ,*forms))))\n\n(defconstraints con con-count (s)\n (= (length s) con-count) ;; tautology\n (= (countq t [s -6..t]) 3)\n (= (countq t (mapcar (op if (evenp @1) @2) (range 1) s)) 2)\n (if [s 4] (and [s 5] [s 6]) t)\n (none [s 1..3])\n (= (countq t (mapcar (op if (oddp @1) @2) (range 1) s)) 4)\n (and (or [s 1] [s 2]) (not (and [s 1] [s 2])))\n (if [s 6] (and [s 4] [s 5]) t)\n (= (countq t [s 0..6]) 3)\n (and [s 10] [s 11])\n (= (countq t [s 6..9]) 1)\n (= (countq t [s 0..con-count]) 4))\n\n(defun true-indices (truths)\n (mappend (do if @1 ^(,@2)) truths (range 1)))\n\n(defvar results\n (append-each ((truths (rperm '(nil t) con-count)))\n (let* ((vals (con truths))\n (consist [mapcar eq truths vals])\n (wrong-count (countq nil consist))\n (pos-wrong (+ 1 (or (posq nil consist) -2))))\n (cond\n ((zerop wrong-count)\n ^((:----> ,*(true-indices truths))))\n ((= 1 wrong-count)\n ^((:close ,*(true-indices truths) (:wrong ,pos-wrong))))))))\n\n(each ((r results))\n (put-line `@r`))\n","language":"TXR"},{"code":"Even ← =1◿2⇡⧻ # nb indexes are zero-based\nSA ← =12⧻ # Total is always twelve (don't test)\nSB ← =3⧻⊚↘6 # Three of last six are true\nSC ← =2⧻⊚⊏⊚Even. # Exactly two even rules are true\nSD ← ⟨1◌|/×⟩⊢.↙3↘4 # If 5 is true so are 6 and 7\nSE ← /׬⊏[1 2 3] # 2, 3, 4 are all false\nSF ← =4⧻⊚⊏⊚¬Even. # Four odd rules are true\nSG ← =1/+↙2↘1 # 2 xor 3\nSH ← ⟨1◌|/×⟩⊢.⇌↙3↘4 # If 7 is true so are 6 and 5\nSI ← =3⧻⊚↙6 # Three of first six are true\nSJ ← /×⊏[10 11] # 11 and 12 are both true\nSK ← =1/+⊏[6 7 8] # Exactly one of 7, 8, 9 is true\nSL ← =4/+↘¯1 # Exactly four of above are true\n\n⋯+1×2⇡2048 # Brute force sensible combinations\n≡(\n # Test each rule against the data and concatenate\n :[⊃⊃⊃⊃⊃⊃⊃⊃⊃⊃⊃SA SB SC SD SE SF SG SH SI SJ SK SL].\n ⊟∩□:⊙(⊚⌵-). # Append hit-count\n)\n\n# Partition by fit, keep only hits and near-misses\n°⊟↙2⊕□≡(◇⧻⊢).\n\n# Print results\n&p\"\\nNear Misses\"&s+1◇⊚⊢↘1◇⊢&p\"Hits\"\n⊏⍏≡⊢.°□ # Sort misses\n≡(⊃(&p+1⊚°□⊢↘1)(&pf\"\\t\"&pf+1◇⊢⊢&pf\"Fails at \"))\n","language":"Uiua"},{"code":"Public s As String '-- (eg \"101101100010\")\nPublic t As Integer '-- scratch\n\nFunction s1()\n s1 = Len(s) = 12\nEnd Function\nFunction s2()\n t = 0\n For i = 7 To 12\n t = t - (Mid(s, i, 1) = \"1\")\n Next i\n s2 = t = 3\nEnd Function\nFunction s3()\n t = 0\n For i = 2 To 12 Step 2\n t = t - (Mid(s, i, 1) = \"1\")\n Next i\n s3 = t = 2\nEnd Function\nFunction s4()\n s4 = Mid(s, 5, 1) = \"0\" Or ((Mid(s, 6, 1) = \"1\" And Mid(s, 7, 1) = \"1\"))\nEnd Function\nFunction s5()\n s5 = Mid(s, 2, 1) = \"0\" And Mid(s, 3, 1) = \"0\" And Mid(s, 4, 1) = \"0\"\nEnd Function\nFunction s6()\n t = 0\n For i = 1 To 12 Step 2\n t = t - (Mid(s, i, 1) = \"1\")\n Next i\n s6 = t = 4\nEnd Function\nFunction s7()\n s7 = Mid(s, 2, 1) <> Mid(s, 3, 1)\nEnd Function\nFunction s8()\n s8 = Mid(s, 7, 1) = \"0\" Or (Mid(s, 5, 1) = \"1\" And Mid(s, 6, 1) = \"1\")\nEnd Function\nFunction s9()\n t = 0\n For i = 1 To 6\n t = t - (Mid(s, i, 1) = \"1\")\n Next i\n s9 = t = 3\nEnd Function\nFunction s10()\n s10 = Mid(s, 11, 1) = \"1\" And Mid(s, 12, 1) = \"1\"\nEnd Function\nFunction s11()\n t = 0\n For i = 7 To 9\n t = t - (Mid(s, i, 1) = \"1\")\n Next i\n s11 = t = 1\nEnd Function\nFunction s12()\n t = 0\n For i = 1 To 11\n t = t - (Mid(s, i, 1) = \"1\")\n Next i\n s12 = t = 4\nEnd Function\n\nPublic Sub twelve_statements()\n For i = 0 To 2 ^ 12 - 1\n s = Right(CStr(WorksheetFunction.Dec2Bin(64 + i \\ 128)), 5) _\n & Right(CStr(WorksheetFunction.Dec2Bin(256 + i Mod 128)), 7)\n For b = 1 To 12\n Select Case b\n Case 1: If s1 <> (Mid(s, b, 1) = \"1\") Then Exit For\n Case 2: If s2 <> (Mid(s, b, 1) = \"1\") Then Exit For\n Case 3: If s3 <> (Mid(s, b, 1) = \"1\") Then Exit For\n Case 4: If s4 <> (Mid(s, b, 1) = \"1\") Then Exit For\n Case 5: If s5 <> (Mid(s, b, 1) = \"1\") Then Exit For\n Case 6: If s6 <> (Mid(s, b, 1) = \"1\") Then Exit For\n Case 7: If s7 <> (Mid(s, b, 1) = \"1\") Then Exit For\n Case 8: If s8 <> (Mid(s, b, 1) = \"1\") Then Exit For\n Case 9: If s9 <> (Mid(s, b, 1) = \"1\") Then Exit For\n Case 10: If s10 <> (Mid(s, b, 1) = \"1\") Then Exit For\n Case 11: If s11 <> (Mid(s, b, 1) = \"1\") Then Exit For\n Case 12: If s12 <> (Mid(s, b, 1) = \"1\") Then Exit For\n End Select\n If b = 12 Then Debug.Print s\n Next\n Next\nEnd Sub\n","language":"VBA"},{"code":"import \"./fmt\" for Conv, Fmt\n\nvar predicates = [\n Fn.new { |s| s.count == 13 }, // indexing starts at 0 but first bit ignored\n Fn.new { |s| (7..12).count { |i| s[i] == \"1\" } == 3 },\n Fn.new { |s| [2, 4, 6, 8, 10, 12].count { |i| s[i] == \"1\" } == 2 },\n Fn.new { |s| s[5] == \"0\" || (s[6] == \"1\" && s[7] == \"1\") },\n Fn.new { |s| s[2] == \"0\" && s[3] == \"0\" && s[4] == \"0\" },\n Fn.new { |s| [1, 3, 5, 7, 9, 11].count { |i| s[i] == \"1\" } == 4 },\n Fn.new { |s| Conv.itob(Conv.btoi(s[2] == \"1\") ^ Conv.btoi(s[3] == \"1\")) },\n Fn.new { |s| s[7] == \"0\" || (s[5] == \"1\" && s[6] == \"1\") },\n Fn.new { |s| (1..6).count { |i| s[i] == \"1\" } == 3 },\n Fn.new { |s| s[11] == \"1\" && s[12] == \"1\" },\n Fn.new { |s| (7..9).count { |i| s[i] == \"1\" } == 1 },\n Fn.new { |s| (1..11).count { |i| s[i] == \"1\" } == 4 }\n]\n\nvar show = Fn.new { |s, indent|\n if (indent) System.write(\" \")\n for (i in 0...s.count) if (s[i] == \"1\") System.write(\"%(i) \")\n System.print()\n}\n\nSystem.print(\"Exact hits:\")\nfor (i in 0..4095) {\n var s = Fmt.swrite(\"$013b\", i)\n var j = 1\n if (predicates.all { |pred|\n var res = pred.call(s) == (s[j] == \"1\")\n j = j + 1\n return res\n }) show.call(s, true)\n}\n\nSystem.print(\"\\nNear misses:\")\nfor (i in 0..4095) {\n var s = Fmt.swrite(\"$013b\", i)\n var j = 1\n var c = predicates.count { |pred|\n var res = pred.call(s) == (s[j] == \"1\")\n j = j + 1\n return res\n }\n if (c == 11) {\n var k = 1\n for (pred in predicates) {\n if (pred.call(s) != (s[k] == \"1\") ) break\n k = k + 1\n }\n Fmt.write(\" (Fails at statement $2d) \", k)\n show.call(s, false)\n }\n}\n","language":"Wren"},{"code":" \\We have 12 statements to determine the truth/falsehood of (see task).\n integer Stmt( 1+12 ), Expected( 1+12 );\n\n \\Logical-to-integer utility procedure\n function ToInteger; int V ; return if V # 0 then 1 else 0;\n\n \\Procedure to determine whether the statements are true or not\n procedure FindExpectedValues;\n begin\n Expected( 1 ) := true;\n Expected( 2 ) := 3 = ( ToInteger( Stmt( 7 ) ) + ToInteger( Stmt( 8 ) )\n + ToInteger( Stmt( 9 ) ) + ToInteger( Stmt( 10 ) )\n + ToInteger( Stmt( 11 ) ) + ToInteger( Stmt( 12 ) )\n );\n Expected( 3 ) := 2 = ( ToInteger( Stmt( 2 ) ) + ToInteger( Stmt( 4 ) )\n + ToInteger( Stmt( 6 ) ) + ToInteger( Stmt( 8 ) )\n + ToInteger( Stmt( 10 ) ) + ToInteger( Stmt( 12 ) )\n );\n Expected( 4 ) := ( not Stmt( 5 ) ) or ( Stmt( 6 ) and Stmt( 7 ) );\n Expected( 5 ) := not ( Stmt( 2 ) or Stmt( 3 ) or Stmt( 4 ) );\n Expected( 6 ) := 4 = ( ToInteger( Stmt( 1 ) ) + ToInteger( Stmt( 3 ) )\n + ToInteger( Stmt( 5 ) ) + ToInteger( Stmt( 7 ) )\n + ToInteger( Stmt( 9 ) ) + ToInteger( Stmt( 11 ) )\n );\n Expected( 7 ) := Stmt( 2 ) # Stmt( 3 );\n Expected( 8 ) := ( not Stmt( 7 ) ) or ( Stmt( 5 ) and Stmt( 6 ) );\n Expected( 9 ) := 3 = ( ToInteger( Stmt( 1 ) ) + ToInteger( Stmt( 2 ) )\n + ToInteger( Stmt( 3 ) ) + ToInteger( Stmt( 4 ) )\n + ToInteger( Stmt( 5 ) ) + ToInteger( Stmt( 6 ) )\n );\n Expected( 10 ) := Stmt( 11 ) and Stmt( 12 );\n Expected( 11 ) := 1 = ( ToInteger( Stmt( 7 ) )\n + ToInteger( Stmt( 8 ) )\n + ToInteger( Stmt( 9 ) )\n );\n Expected( 12 ) := 4 = ( ToInteger( Stmt( 1 ) ) + ToInteger( Stmt( 2 ) )\n + ToInteger( Stmt( 3 ) ) + ToInteger( Stmt( 4 ) )\n + ToInteger( Stmt( 5 ) ) + ToInteger( Stmt( 6 ) )\n + ToInteger( Stmt( 7 ) ) + ToInteger( Stmt( 8 ) )\n + ToInteger( Stmt( 9 ) ) + ToInteger( Stmt( 10 ) )\n + ToInteger( Stmt( 11 ) )\n );\n end; \\FindExpectedValues\n\n \\Clearly, statement 1 is true. However to enumerate the near\n \\ solutions, we need to consider \"solutions\" where statement 1 is false.\n \\We iterate through the possibilities for the statements,\n \\ looking for a non-contradictory set of values.\n \\We print the solutions with allowedContradictions contradictions\n procedure PrintSolutions ( AllowedContradictions, Heading ) ;\n integer AllowedContradictions, Heading;\n integer Wrong( 1+12 );\n integer Solution, N, Incorrect, DPos, S;\n begin\n Text(0, Heading ); CrLf(0);\n Text(0, \" 1 2 3 4 5 6 7 8 9 10 11 12^m^j\" );\n Text(0, \" ====================================^m^j\" );\n \\There are 12 statements, so we have 2^12 possible combinations\n for Solution := 1 to 4096 do begin\n \\Convert the number to the set of true/false values\n N := Solution;\n for DPos := 1 to 12 do begin\n Stmt( DPos ) := (N & 1) # 0; \\very odd\n N := N / 2;\n end; \\for_DPos\n \\Get the expected values of the statements based on suggested values\n FindExpectedValues;\n \\Count contradictions. If the required number, print solution\n Incorrect := 0;\n for DPos := 1 to 12 do begin\n Wrong( DPos ) := Expected( DPos ) # Stmt( DPos );\n Incorrect := Incorrect + ToInteger( Wrong( DPos ) );\n end; \\for_DPos\n if Incorrect = AllowedContradictions then begin\n \\Have a solution\n Text(0, \" \" );\n for S := 1 to 12 do begin\n Text(0, \" \");\n Text(0, if Stmt( S ) then \"T\" else \"-\");\n Text(0, if Wrong( S ) then \"*\" else \" \");\n end;\n CrLf(0);\n end;\n end; \\for_solution\n end; \\PrintSolutions\n\nbegin\n \\Find complete solutions\n PrintSolutions( 0, \"Solutions\" );\n \\Find near solutions\n PrintSolutions( 1, \"Near solutions (incorrect values marked ^\"*^\")\" );\nend\n","language":"XPL0"},{"code":"sub s1() return len(s$)=12 end sub\nsub s2() local t, i : t=0 : for i=7 to 12 : t = t + (mid$(s$, i, 1) <> \"0\") : next : return t=3 end sub\nsub s3() local t, i : t=0 : for i=2 to 12 step 2 : t = t + (mid$(s$, i, 1) <> \"0\") : next : return t=2 end sub\nsub s4() return mid$(s$, 5, 1) = \"0\" or (mid$(s$, 6, 1) <> \"0\" and mid$(s$, 7, 1) <> \"0\") end sub\nsub s5() return mid$(s$, 2, 1) = \"0\" and mid$(s$, 3, 1) = \"0\" and mid$(s$, 4, 1) = \"0\" end sub\nsub s6() local t, i : t=0 : for i=1 to 12 step 2 : t = t + mid$(s$, i, 1) <> \"0\" : next : return t=4 end sub\nsub s7() return mid$(s$, 2, 1) <> mid$(s$, 3, 1) end sub\nsub s8() return mid$(s$, 7, 1) = \"0\" or (mid$(s$, 5, 1) <> \"0\" and mid$(s$, 6, 1) <> \"0\") end sub\nsub s9() local t, i : t=0 : for i=1 to 6 : t = t + mid$(s$, i, 1) <> \"0\" : next : return t=3 end sub\nsub s10() return mid$(s$, 11, 1) <> \"0\" and mid$(s$, 12, 1) <> \"0\" end sub\nsub s11() local t, i : t=0 : for i=7 to 9 : t = t + mid$(s$, i, 1) <> \"0\" : next : return t=1 end sub\nsub s12() local t, i : t=0 : for i=1 to 11 : t = t + mid$(s$, i, 1) <> \"0\" : next : return t=4 end sub\n\ndim r$(12)\n\nfor b=1 to 12\n r$(b) = \"s\"+str$(b)\nnext\nfor i=0 to 2^12-1\n s$ = right$(\"000000000000\" + bin$(i), 12)\n for b=1 to 12\n if execute(r$(b)) <> (mid$(s$, b, 1) <> \"0\") break\n if b=12 print s$\n next\nnext\n","language":"Yabasic"},{"code":"var statements; // list of 13 Bools, statements[0] is garbage to make 1 based\nfcn s0 { False } // dummy for padding\nfcn s1 { True }\nfcn s2 { statements[-6,*].filter().len()==3 }\nfcn s3 { [2..12,2].apply(statements.get).filter().len()==2 }\nfcn s4 { if(statements[5]) statements[6]==statements[7]==True else True }\nfcn s5 { statements[2,3].filter().len()==0 }\nfcn s6 { [1..12,2].apply(statements.get).filter().len()==4 }\nfcn s7 { statements[2]!=statements[3] }\nfcn s8 { if(statements[7]) statements[5]==statements[6]==True else True }\nfcn s9 { statements[1,6].filter().len()==3 }\nfcn s10{ statements[11]==statements[12]==True }\nfcn s11{ statements[7,3].filter().len()==1 }\nfcn s12{ statements[1,11].filter().len()==4 }\n\nfilters:=T(s0,s1,s2,s3,s4,s5,s6,s7,s8,s9,s10,s11,s12);\nforeach n in ((2).pow(12)){ // 4k\n // 5-->\"0000000000101\"-->(\"0\",\"0\"...\"1\")-->(F,F,...T)\n statements=\"%013.2B\".fmt(n).split(\"\").apply('==(\"1\"));\n r:=filters.run(True); // and return list of results\n if(r==statements) print(\"<<<<<<<<<<<<<<<<Solution\");\n else{\n diff:=r.zipWith('!=,statements);\n if(diff.sum(0)==1) print(\"Diff @\",diff.filter1n());\n }\n}\nfcn print(msg){\n (12).pump(List,'wrap(n){ statements[n] and n or Void.Skip })\n .concat(\",\").println(\" : \",vm.pasteArgs());\n}\n","language":"Zkl"}],"string":"[\n {\n \"code\": \"---\\ncategory:\\n- CHR\\nfrom: http://rosettacode.org/wiki/Twelve_statements\\nnote: Puzzles\\n\",\n \"language\": \"00-META\"\n },\n {\n \"code\": \"This puzzle is borrowed from [http://math-frolic.blogspot.co.uk/2012/08/mind-wrenching.html math-frolic.blogspot].\\n\\n\\nGiven the following twelve statements, which of them are true?\\n<pre>\\n 1. This is a numbered list of twelve statements.\\n 2. Exactly 3 of the last 6 statements are true.\\n 3. Exactly 2 of the even-numbered statements are true.\\n 4. If statement 5 is true, then statements 6 and 7 are both true.\\n 5. The 3 preceding statements are all false.\\n 6. Exactly 4 of the odd-numbered statements are true.\\n 7. Either statement 2 or 3 is true, but not both.\\n 8. If statement 7 is true, then 5 and 6 are both true.\\n 9. Exactly 3 of the first 6 statements are true.\\n10. The next two statements are both true.\\n11. Exactly 1 of statements 7, 8 and 9 are true.\\n12. Exactly 4 of the preceding statements are true.\\n</pre>\\n\\n\\n;Task:\\nWhen you get tired of trying to figure it out in your head, \\nwrite a program to solve it, and print the correct answer or answers.\\n\\n\\n;Extra credit:\\nPrint out a table of near misses, that is, solutions that are contradicted by only a single statement.\\n<br><br>\\n\\n\",\n \"language\": \"00-TASK\"\n },\n {\n \"code\": \"[([Int] -> Bool)] predicates\\npredicates [+]= st -> st.len == 12\\npredicates [+]= st -> sum(st[(len)-6 ..]) == 3\\npredicates [+]= st -> sum(st[(1..).step(2)]) == 2\\npredicates [+]= st -> I st[4] {(st[5] [&] st[6])} E 1\\npredicates [+]= st -> sum(st[1.<4]) == 0\\npredicates [+]= st -> sum(st[(0..).step(2)]) == 4\\npredicates [+]= st -> sum(st[1.<3]) == 1\\npredicates [+]= st -> I st[6] {(st[4] [&] st[5])} E 1\\npredicates [+]= st -> sum(st[0.<6]) == 3\\npredicates [+]= st -> (st[10] [&] st[11])\\npredicates [+]= st -> sum(st[6.<9]) == 1\\npredicates [+]= st -> sum(st[0.<11]) == 4\\n\\nF to_str(b)\\n R (0.<12).filter(i -> @b[i]).map(i -> i + 1).join(‘ ’)\\n\\nprint(‘Exact hits:’)\\nL(n) 0 .< (1 << 12)\\n V bools = [0] * 12\\n L(i) 12\\n I n [&] (1 << (11 - i)) != 0\\n bools[i] = 1\\n\\n L(predicate) predicates\\n I Int(predicate(bools)) != bools[L.index]\\n L.break\\n L.was_no_break\\n print(‘ ’to_str(bools))\\n\\nprint(\\\"\\\\nNear misses:\\\")\\nL(n) 0 .< (1 << 12)\\n V bools = [0] * 12\\n L(i) 12\\n I n [&] (1 << (11 - i)) != 0\\n bools[i] = 1\\n\\n V count = 0\\n L(predicate) predicates\\n I Int(predicate(bools)) == bools[L.index]\\n count++\\n I count == 11\\n L(predicate) predicates\\n V i = L.index\\n I Int(predicate(bools)) != bools[i]\\n print(f:‘ (Fails at statement {i + 1:2}) {to_str(bools)}’)\\n L.break\\n\",\n \"language\": \"11l\"\n },\n {\n \"code\": \"with Ada.Text_IO, Logic;\\n\\nprocedure Twelve_Statements is\\n\\n package L is new Logic(Number_Of_Statements => 12); use L;\\n\\n -- formally define the 12 statements as expression function predicates\\n function P01(T: Table) return Boolean is (T'Length = 12); -- list of 12 statements\\n function P02(T: Table) return Boolean is (Sum(T(7 .. 12)) = 3); -- three of last six\\n function P03(T: Table) return Boolean is (Sum(Half(T, Even)) = 2); -- two of the even\\n function P04(T: Table) return Boolean is (if T(5) then T(6) and T(7)); -- if 5 is true, then ...\\n function P05(T: Table) return Boolean is\\n ( (not T(2)) and (not T(3)) and (not T(4)) ); -- none of preceding three\\n function P06(T: Table) return Boolean is (Sum(Half(T, Odd)) = 4); -- four of the odd\\n function P07(T: Table) return Boolean is (T(2) xor T(3)); -- either 2 or 3, not both\\n function P08(T: Table) return Boolean is (if T(7) then T(5) and T(6)); -- if 7 is true, then ...\\n function P09(T: Table) return Boolean is (Sum(T(1 .. 6)) = 3); -- three of first six\\n function P10(T: Table) return Boolean is (T(11) and T(12)); -- next two\\n function P11(T: Table) return Boolean is (Sum(T(7..9)) = 1); -- one of 7, 8, 9\\n function P12(T: Table) return Boolean is (Sum(T(1 .. 11)) = 4); -- four of the preding\\n\\n -- define a global list of statements\\n Statement_List: constant Statements :=\\n (P01'Access, P02'Access, P03'Access, P04'Access, P05'Access, P06'Access,\\n P07'Access, P08'Access, P09'Access, P10'Access, P11'Access, P12'Access);\\n\\n -- try out all 2^12 possible choices for the table\\n procedure Try(T: Table; Fail: Natural; Idx: Indices'Base := Indices'First) is\\n\\n procedure Print_Table(T: Table) is\\n\\t use Ada.Text_IO;\\n begin\\n\\t Put(\\\" \\\");\\n\\t if Fail > 0 then\\n\\t Put(\\\"(wrong at\\\");\\n\\t for J in T'Range loop\\n\\t if Statement_List(J)(T) /= T(J) then\\n\\t\\t Put(Integer'Image(J) & (if J < 10 then \\\") \\\" else \\\") \\\"));\\n\\t end if;\\n\\t end loop;\\n\\t end if;\\n\\t if T = (1..12 => False) then\\n\\t Put_Line(\\\"All false!\\\");\\n\\t else\\n\\t Put(\\\"True are\\\");\\n\\t for J in T'Range loop\\n\\t if T(J) then\\n\\t\\t Put(Integer'Image(J));\\n\\t end if;\\n\\t end loop;\\n\\t New_Line;\\n\\t end if;\\n end Print_Table;\\n\\n Wrong_Entries: Natural := 0;\\n\\t\\n begin\\n if Idx <= T'Last then\\n\\t Try(T(T'First .. Idx-1) & False & T(Idx+1 .. T'Last), Fail, Idx+1);\\n\\t Try(T(T'First .. Idx-1) & True & T(Idx+1 .. T'Last), Fail, Idx+1);\\n else -- now Index > T'Last and we have one of the 2^12 choices to test\\n\\t for J in T'Range loop \\t\\n\\t if Statement_List(J)(T) /= T(J) then\\n\\t Wrong_Entries := Wrong_Entries + 1;\\n\\t end if;\\n\\t end loop;\\n\\t if Wrong_Entries = Fail then\\n\\t Print_Table(T);\\n\\t end if;\\n end if;\\n end Try;\\n\\t\\t\\t\\nbegin\\n Ada.Text_IO.Put_Line(\\\"Exact hits:\\\");\\n Try(T => (1..12 => False), Fail => 0);\\n Ada.Text_IO.New_Line;\\n Ada.Text_IO.Put_Line(\\\"Near Misses:\\\");\\n Try(T => (1..12 => False), Fail => 1);\\nend Twelve_Statements;\\n\",\n \"language\": \"Ada\"\n },\n {\n \"code\": \"generic\\n Number_Of_Statements: Positive;\\npackage Logic is\\n\\n --types\\n subtype Indices is Natural range 1 .. Number_Of_Statements;\\n type Table is array(Indices range <>) of Boolean;\\n type Predicate is access function(T: Table) return Boolean;\\n type Statements is array(Indices) of Predicate;\\n type Even_Odd is (Even, Odd);\\n\\n -- convenience functions\\n function Sum(T: Table) return Natural;\\n function Half(T: Table; Which: Even_Odd) return Table;\\n\\nend Logic;\\n\",\n \"language\": \"Ada\"\n },\n {\n \"code\": \"package body Logic is\\n\\n function Sum(T: Table) return Natural is\\n Result: Natural := 0;\\n begin\\n for I in T'Range loop\\n if T(I) then\\n Result := Result + 1;\\n end if;\\n end loop;\\n return Result;\\n end Sum;\\n\\n function Half(T: Table; Which: Even_Odd) return Table is\\n Result: Table(T'Range);\\n Last: Natural := Result'First - 1;\\n begin\\n for I in T'Range loop\\n if I mod 2 = (if (Which=Odd) then 1 else 0) then\\n Last := Last+1;\\n Result(Last) := T(I);\\n end if;\\n end loop;\\n return Result(Result'First .. Last);\\n end Half;\\n\\nend Logic;\\n\",\n \"language\": \"Ada\"\n },\n {\n \"code\": \"begin\\n % we have 12 statements to determine the truth/falsehood of (see task) %\\n\\n logical array stmt, expected( 1 :: 12 );\\n\\n % logical (boolean) to integer utility procedure %\\n integer procedure toInteger ( logical value v ) ; if v then 1 else 0;\\n\\n % procedure to determine whether the statements are true or not %\\n procedure findExpectedValues ;\\n begin\\n expected( 1 ) := true;\\n expected( 2 ) := 3 = ( toInteger( stmt( 7 ) ) + toInteger( stmt( 8 ) )\\n + toInteger( stmt( 9 ) ) + toInteger( stmt( 10 ) )\\n + toInteger( stmt( 11 ) ) + toInteger( stmt( 12 ) )\\n );\\n expected( 3 ) := 2 = ( toInteger( stmt( 2 ) ) + toInteger( stmt( 4 ) )\\n + toInteger( stmt( 6 ) ) + toInteger( stmt( 8 ) )\\n + toInteger( stmt( 10 ) ) + toInteger( stmt( 12 ) )\\n );\\n expected( 4 ) := ( not stmt( 5 ) ) or ( stmt( 6 ) and stmt( 7 ) );\\n expected( 5 ) := not ( stmt( 2 ) or stmt( 3 ) or stmt( 4 ) );\\n expected( 6 ) := 4 = ( toInteger( stmt( 1 ) ) + toInteger( stmt( 3 ) )\\n + toInteger( stmt( 5 ) ) + toInteger( stmt( 7 ) )\\n + toInteger( stmt( 9 ) ) + toInteger( stmt( 11 ) )\\n );\\n expected( 7 ) := stmt( 2 ) not = stmt( 3 );\\n expected( 8 ) := ( not stmt( 7 ) ) or ( stmt( 5 ) and stmt( 6 ) );\\n expected( 9 ) := 3 = ( toInteger( stmt( 1 ) ) + toInteger( stmt( 2 ) )\\n + toInteger( stmt( 3 ) ) + toInteger( stmt( 4 ) )\\n + toInteger( stmt( 5 ) ) + toInteger( stmt( 6 ) )\\n );\\n expected( 10 ) := stmt( 11 ) and stmt( 12 );\\n expected( 11 ) := 1 = ( toInteger( stmt( 7 ) )\\n + toInteger( stmt( 8 ) )\\n + toInteger( stmt( 9 ) )\\n );\\n expected( 12 ) := 4 = ( toInteger( stmt( 1 ) ) + toInteger( stmt( 2 ) )\\n + toInteger( stmt( 3 ) ) + toInteger( stmt( 4 ) )\\n + toInteger( stmt( 5 ) ) + toInteger( stmt( 6 ) )\\n + toInteger( stmt( 7 ) ) + toInteger( stmt( 8 ) )\\n + toInteger( stmt( 9 ) ) + toInteger( stmt( 10 ) )\\n + toInteger( stmt( 11 ) )\\n );\\n end expected ;\\n\\n % clearly, statement 1 is true, however to enumerate the near %\\n % solutions, we need to consider \\\"solutions\\\" where statement 1 is false %\\n % we iterate through the possibilities for the statements, %\\n % looking for a non-contradictory set of values %\\n % we print the solutions with allowedContradictions contradictions %\\n procedure printSolutions ( integer value allowedContradictions\\n ; string(60) value heading\\n ) ;\\n begin\\n logical array wrong( 1 :: 12 );\\n write( heading );\\n write( \\\" 1 2 3 4 5 6 7 8 9 10 11 12\\\" );\\n write( \\\" ====================================\\\" );\\n % there are 12 statements, so we have 2^12 possible combinations %\\n for solution := 1 until 4096 do begin\\n integer n, incorrect;\\n % convert the number to the set of true/false values %\\n n := solution;\\n for dPos := 1 until 12 do begin\\n stmt( dPos ) := odd( n );\\n n := n div 2;\\n end for_dPos ;\\n % get the expected values of the statements, based on the %\\n % suggested values %\\n findExpectedValues;\\n % count the contradictions, if we have the required number, %\\n % print the solution %\\n incorrect := 0;\\n for dPos := 1 until 12 do begin\\n wrong( dPos ) := expected( dPos ) not = stmt( dPos );\\n incorrect := incorrect + toInteger( wrong( dPos ) );\\n end for_dPos ;\\n if incorrect = allowedContradictions then begin\\n % have a solution %\\n write( \\\" \\\" );\\n for s := 1 until 12 do writeon( s_w := 0\\n , \\\" \\\"\\n , if stmt( s ) then \\\"T\\\" else \\\"-\\\"\\n , if wrong( s ) then \\\"*\\\" else \\\" \\\"\\n );\\n end ;\\n end for_solution ;\\n end printSolutions ;\\n\\n % find complete solutions %\\n printSolutions( 0, \\\"Solutions\\\" );\\n % find near solutions %\\n printSolutions( 1, \\\"Near solutions (incorrect values marked \\\"\\\"*\\\"\\\")\\\" );\\n\\nend.\\n\",\n \"language\": \"ALGOL-W\"\n },\n {\n \"code\": \"on twelveStatements()\\n set statements to \\\" 1. This is a numbered list of twelve statements.\\n 2. Exactly 3 of the last 6 statements are true.\\n 3. Exactly 2 of the even-numbered statements are true.\\n 4. If statement 5 is true, then statements 6 and 7 are both true.\\n 5. The 3 preceding statements are all false.\\n 6. Exactly 4 of the odd-numbered statements are true.\\n 7. Either statement 2 or 3 is true, but not both.\\n 8. If statement 7 is true, then 5 and 6 are both true.\\n 9. Exactly 3 of the first 6 statements are true.\\n10. The next two statements are both true.\\n11. Exactly 1 of statements 7, 8 and 9 are true.\\n12. Exactly 4 of the preceding statements are true.\\\"\\n\\n script o\\n property posits : {}\\n property upshots : missing value\\n\\n on countTrues(indexList)\\n set sum to 0\\n repeat with i in indexList\\n if (my posits's item i) then set sum to sum + 1\\n end repeat\\n return sum\\n end countTrues\\n end script\\n -- While setting up, test statement 1, whose truth isn't about the others' truths.\\n set statements to statements's paragraphs\\n set nStatements to (count statements)\\n set statement1Truth to (nStatements = 12)\\n repeat with stmt from 1 to nStatements\\n set end of o's o's posits to false\\n tell (statements's item stmt's words) to set statement1Truth to ¬\\n ((statement1Truth) and ((count) > 1) and (beginning = stmt as text))\\n end repeat\\n\\n set output to {}\\n set firstIteration to true\\n repeat (2 ^ nStatements) times\\n -- Postulate answer:\\n if (firstIteration) then\\n set firstIteration to false\\n else -- \\\"Increment\\\" the 'posits' boolean array binarily.\\n repeat with stmt from 1 to nStatements\\n set o's posits's item stmt to (not (o's posits's item stmt))\\n if (result) then exit repeat -- No carry.\\n end repeat\\n end if\\n\\n -- Test consistency:\\n tell o's posits to set o's upshots to {statement1Truth, ¬\\n (o's countTrues({7, 8, 9, 10, 11, 12}) = 3), ¬\\n (o's countTrues({2, 4, 6, 8, 10, 12}) = 2), ¬\\n ((not (item 5)) or ((item 6) and (item 7))), ¬\\n (not ((item 2) or (item 3) or (item 4))), ¬\\n (o's countTrues({1, 3, 5, 7, 9, 11}) = 4), ¬\\n ((item 2) ≠ (item 3)), ¬\\n ((not (item 7)) or ((item 5) and (item 6))), ¬\\n (o's countTrues({1, 2, 3, 4, 5, 6}) = 3), ¬\\n ((item 11) and (item 12)), ¬\\n (o's countTrues({7, 8, 9}) = 1), ¬\\n (o's countTrues({1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11}) = 4)}\\n\\n set nMatches to 0\\n repeat with stmt from 1 to nStatements\\n if ((o's posits's item stmt) = (o's upshots's item stmt)) then set nMatches to nMatches + 1\\n end repeat\\n if (nMatches > nStatements - 2) then\\n set statementsPositedTrue to {}\\n repeat with stmt from 1 to nStatements\\n set thisPosit to o's posits's item stmt\\n if (thisPosit) then set end of statementsPositedTrue to stmt\\n if ((thisPosit) ≠ (o's upshots's item stmt)) then set failure to stmt\\n end repeat\\n set statementsPositedTrue's last item to \\\"and \\\" & statementsPositedTrue's end\\n if ((count statementsPositedTrue) > 2) then\\n set statementsPositedTrue to join(statementsPositedTrue, \\\", \\\")\\n else\\n set statementsPositedTrue to join(statementsPositedTrue, space)\\n end if\\n if (nMatches = nStatements) then\\n set output's end to \\\"SOLUTION: statements \\\" & statementsPositedTrue & \\\" are true.\\\"\\n else\\n set output's end to \\\"Near miss when statements \\\" & statementsPositedTrue & ¬\\n \\\" are posited true: posit for statement \\\" & failure & \\\" fails.\\\"\\n end if\\n end if\\n end repeat\\n\\n return join(output, linefeed)\\nend twelveStatements\\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\\ntwelveStatements()\\n\",\n \"language\": \"AppleScript\"\n },\n {\n \"code\": \"\\\"Near miss when statements 1 and 4 are posited true: posit for statement 8 fails.\\nNear miss when statements 1 and 5 are posited true: posit for statement 8 fails.\\nNear miss when statements 1, 5, and 8 are posited true: posit for statement 11 fails.\\nNear miss when statements 1, 3, 4, 6, 7, and 9 are posited true: posit for statement 9 fails.\\nNear miss when statements 1, 3, 4, 8, and 9 are posited true: posit for statement 7 fails.\\nNear miss when statements 1, 4, 6, 8, and 9 are posited true: posit for statement 6 fails.\\nNear miss when statements 1, 2, 4, 7, 8, and 9 are posited true: posit for statement 8 fails.\\nNear miss when statements 1, 2, 4, 7, 9, and 10 are posited true: posit for statement 10 fails.\\nSOLUTION: statements 1, 3, 4, 6, 7, and 11 are true.\\nNear miss when statements 5, 8, and 11 are posited true: posit for statement 1 fails.\\nNear miss when statements 1, 5, 8, and 11 are posited true: posit for statement 12 fails.\\nNear miss when statements 1, 5, 6, 9, and 11 are posited true: posit for statement 8 fails.\\nNear miss when statements 1, 2, 4, 7, 9, and 12 are posited true: posit for statement 12 fails.\\nNear miss when statements 4, 8, 10, 11, and 12 are posited true: posit for statement 1 fails.\\nNear miss when statements 1, 4, 8, 10, 11, and 12 are posited true: posit for statement 12 fails.\\nNear miss when statements 5, 8, 10, 11, and 12 are posited true: posit for statement 1 fails.\\nNear miss when statements 1, 5, 8, 10, 11, and 12 are posited true: posit for statement 12 fails.\\\"\\n\",\n \"language\": \"AppleScript\"\n },\n {\n \"code\": \"; Note: the original puzzle provides 12 statements and starts with\\n; \\\"Given the following twelve statements...\\\", so the first statement\\n; should ignore the F1 flag and always be true (see \\\"( N == 1 )\\\").\\n\\nS := 12 ; number of statements\\nOutput := \\\"\\\"\\nLoop, % 2**S {\\n\\t;;If !Mod(A_Index,100) ;; optional 'if' to show the loop progress\\n\\t;;\\tToolTip, Index: %A_Index%\\n\\tSetFlags(A_Index-1), Current := \\\"\\\", Count := 0\\n\\tLoop, %S%\\n\\t\\tR := TestStatement(A_Index), Current .= \\\" \\\" R, Count += (R == F%A_Index%)\\n\\tIf ( Count >= S-1 )\\n\\t\\tOutput .= Count \\\" ->\\\" Current \\\"`n\\\"\\n\\tIf ( Count = S )\\n\\t\\tSolution := \\\"`nSolution = \\\" Current\\n}\\nToolTip\\nMsgBox, % Output . Solution\\nReturn\\n\\n;-------------------------------------------------------------------------------------\\n\\nSetFlags(D) {\\n\\tLocal I\\n\\tLoop, %S%\\n\\t\\tI := S-A_Index+1 , F%I% := (D >> (S-A_Index)) & 1\\n}\\n\\n;-------------------------------------------------------------------------------------\\n\\nTestStatement(N) {\\n\\tLocal I, C := 0\\n\\tIf ( N == 1 ) ; This is a numbered list of twelve statements.\\n\\t\\tReturn ( S == 12 ) ; should always be true\\n\\tIf ( N == 2 ) { ; Exactly 3 of the last 6 statements are true.\\n\\t\\tLoop, 6\\n\\t\\t\\tI := S-A_Index+1 , C += F%I%\\n\\t\\tReturn ( C == 3 )\\n\\t}\\n\\tIf ( N == 3 ) { ; Exactly 2 of the even-numbered statements are true.\\n\\t\\tLoop, %S%\\n\\t\\t\\tC += ( !Mod(A_Index,2) & F%A_Index% )\\n\\t\\tReturn ( C == 2 )\\n\\t}\\n\\tIf ( N == 4 ) ; If statement 5 is true, then statements 6 and 7 are both true.\\n\\t\\tReturn ( F5 ? F6 & F7 : 1 )\\n\\tIf ( N == 5 ) { ; The 3 preceding statements are all false.\\n\\t\\tLoop, 3\\n\\t\\t\\tI := N-A_Index , C += F%I%\\n\\t\\tReturn ( C == 0 )\\n\\t}\\n\\tIf ( N == 6 ) { ; Exactly 4 of the odd-numbered statements are true.\\n\\t\\tLoop, %S%\\n\\t\\t\\tC += ( !!Mod(A_Index,2) & F%A_Index% )\\n\\t\\tReturn ( C == 4 )\\n\\t}\\n\\tIf ( N == 7 ) ; Either statement 2 or 3 is true, but not both.\\n\\t\\tReturn ( F2 ^ F3 )\\n\\tIf ( N == 8 ) ; If statement 7 is true, then 5 and 6 are both true.\\n\\t\\tReturn ( F7 ? F5 & F6 : 1 )\\n\\tIf ( N == 9 ) { ; Exactly 3 of the first 6 statements are true.\\n\\t\\tLoop, 6\\n\\t\\t\\tC += F%A_Index%\\n\\t\\tReturn ( C == 3 )\\n\\t}\\n\\tIf ( N == 10 ) ; The next two statements are both true.\\n\\t\\tReturn ( F11 & F12 )\\n\\tIf ( N == 11 ) ; Exactly 1 of statements 7, 8 and 9 are true\\n\\t\\tReturn ( F7+F8+F9 == 1 )\\n\\tIf ( N == 12 ) { ; Exactly 4 of the preceding statements are true\\n\\t\\tLoop, % N-1\\n\\t\\t\\tC += F%A_Index%\\n\\t\\tReturn ( C == 4 )\\n\\t}\\n}\\n\",\n \"language\": \"AutoHotkey\"\n },\n {\n \"code\": \" nStatements% = 12\\n DIM Pass%(nStatements%), T%(nStatements%)\\n\\n FOR try% = 0 TO 2^nStatements%-1\\n\\n REM Postulate answer:\\n FOR stmt% = 1 TO 12\\n T%(stmt%) = (try% AND 2^(stmt%-1)) <> 0\\n NEXT\\n\\n REM Test consistency:\\n Pass%(1) = T%(1) = (nStatements% = 12)\\n Pass%(2) = T%(2) = ((T%(7)+T%(8)+T%(9)+T%(10)+T%(11)+T%(12)) = -3)\\n Pass%(3) = T%(3) = ((T%(2)+T%(4)+T%(6)+T%(8)+T%(10)+T%(12)) = -2)\\n Pass%(4) = T%(4) = ((NOT T%(5) OR (T%(6) AND T%(7))))\\n Pass%(5) = T%(5) = (NOT T%(2) AND NOT T%(3) AND NOT T%(4))\\n Pass%(6) = T%(6) = ((T%(1)+T%(3)+T%(5)+T%(7)+T%(9)+T%(11)) = -4)\\n Pass%(7) = T%(7) = ((T%(2) EOR T%(3)))\\n Pass%(8) = T%(8) = ((NOT T%(7) OR (T%(5) AND T%(6))))\\n Pass%(9) = T%(9) = ((T%(1)+T%(2)+T%(3)+T%(4)+T%(5)+T%(6)) = -3)\\n Pass%(10) = T%(10) = (T%(11) AND T%(12))\\n Pass%(11) = T%(11) = ((T%(7)+T%(8)+T%(9)) = -1)\\n Pass%(12) = T%(12) = ((T%(1)+T%(2)+T%(3)+T%(4)+T%(5)+T%(6) + \\\\\\n \\\\ T%(7)+T%(8)+T%(9)+T%(10)+T%(11)) = -4)\\n\\n CASE SUM(Pass%()) OF\\n WHEN -11:\\n PRINT \\\"Near miss with statements \\\";\\n FOR stmt% = 1 TO 12\\n IF T%(stmt%) PRINT ; stmt% \\\" \\\";\\n IF NOT Pass%(stmt%) miss% = stmt%\\n NEXT\\n PRINT \\\"true (failed \\\" ;miss% \\\").\\\"\\n WHEN -12:\\n PRINT \\\"Solution! with statements \\\";\\n FOR stmt% = 1 TO 12\\n IF T%(stmt%) PRINT ; stmt% \\\" \\\";\\n NEXT\\n PRINT \\\"true.\\\"\\n ENDCASE\\n\\n NEXT try%\\n END\\n\",\n \"language\": \"BBC-BASIC\"\n },\n {\n \"code\": \"(\\n ( number\\n = n done ntest oldFT\\n . !arg:(?done.(=?ntest).?oldFT)\\n & 0:?n\\n & ( !done\\n : ?\\n ( !ntest\\n . !oldFT&1+!n:?n&~\\n )\\n ?\\n | !n\\n )\\n )\\n & ( STATEMENTS\\n = ( (1.\\\"This is a numbered list of twelve statements.\\\")\\n . 1\\n . (\\n = n nr done toDo\\n . !arg:(?done.?toDo)\\n & 0:?n\\n & whl\\n ' ( !done:(?nr.?) ?done\\n & 1+!n:!nr:?n\\n )\\n & whl\\n ' ( !toDo:((?nr.?).?) ?toDo\\n & 1+!n:!nr:?n\\n )\\n & (!n:12&true|false)\\n )\\n )\\n ( (2.\\\"Exactly 3 of the last 6 statements are true.\\\")\\n . end\\n . (\\n = done toDo lastSix\\n . !arg:(?done.?toDo)\\n & !done:? [-7 ?lastSix\\n & ( number$(!lastSix.(=?).true):3\\n & true\\n | false\\n )\\n )\\n )\\n ( (3.\\\"Exactly 2 of the even-numbered statements are true.\\\")\\n . end\\n . (\\n = done toDo ii\\n . !arg:(?done.?toDo)\\n & ( number\\n $ ( !done\\n . (=?ii&!ii*1/2:~/)\\n . true\\n )\\n : 2\\n & true\\n | false\\n )\\n )\\n )\\n ( (4.\\\"If statement 5 is true, then statements 6 and 7 are both true.\\\")\\n . 7\\n . (\\n = done toDo\\n . !arg:(?done.?toDo)\\n & ( !done\\n : ( ? (5.false) ?\\n | ? (6.true) ?\\n : ? (7.true) ?\\n )\\n & true\\n | false\\n )\\n )\\n )\\n ( (5.\\\"The 3 preceding statements are all false.\\\")\\n . 5\\n . (\\n = done toDo\\n . !arg:(?done.?toDo)\\n & ( !done\\n : ?\\n (?.false)\\n (?.false)\\n (?.false)\\n (?.?)\\n & true\\n | false\\n )\\n )\\n )\\n ( (6.\\\"Exactly 4 of the odd-numbered statements are true.\\\")\\n . end\\n . (\\n = done toDo i\\n . !arg:(?done.?toDo)\\n & ( number\\n $ ( !done\\n . (=?i&!i*1/2:/)\\n . true\\n )\\n : 4\\n & true\\n | false\\n )\\n )\\n )\\n ( (7.\\\"Either statement 2 or 3 is true, but not both.\\\")\\n . 7\\n . (\\n = done toDo\\n . !arg:(?done.?toDo)\\n & ( number\\n $ (!done.(=2|3).true)\\n : 1\\n & true\\n | false\\n )\\n )\\n )\\n ( (8.\\\"If statement 7 is true, then 5 and 6 are both true.\\\")\\n . 8\\n . (\\n = done toDo\\n . !arg:(?done.?toDo)\\n & ( !done\\n : ( ? (7.false) ?\\n | ? (5.true) ?\\n : ? (6.true) ?\\n )\\n & true\\n | false\\n )\\n )\\n )\\n ( (9.\\\"Exactly 3 of the first 6 statements are true.\\\")\\n . 9\\n . (\\n = done toDo firstSix\\n . !arg:(?done.?toDo)\\n & !done:?firstSix [6 ?\\n & ( number$(!firstSix.(=?).true):3\\n & true\\n | false\\n )\\n )\\n )\\n ( (10.\\\"The next two statements are both true.\\\")\\n . 12\\n . (\\n = done toDo\\n . !arg:(?done.?toDo)\\n & ( !done:? (?.true) (?.true)\\n & true\\n | false\\n )\\n )\\n )\\n ( (11.\\\"Exactly 1 of statements 7, 8 and 9 are true.\\\")\\n . 11\\n . (\\n = done toDo\\n . !arg:(?done.?toDo)\\n & ( number\\n $ ( !done\\n . (=7|8|9)\\n . true\\n )\\n : 1\\n & true\\n | false\\n )\\n )\\n )\\n ( (12.\\\"Exactly 4 of the preceding statements are true.\\\")\\n . 12\\n . (\\n = done toDo preceding\\n . !arg:(?done.?toDo)\\n & !done:?preceding (?.?)\\n & ( number$(!preceding.(=?).true):4\\n & true\\n | false\\n )\\n )\\n )\\n )\\n & ( TestTruth\\n = done toDo postponedTests testToBePostponed\\n , n when test FT oldFT A Z text\\n , postponedTest testNow\\n . !arg:(?done.?toDo.?postponedTests)\\n & ( !toDo:\\n & \\\"We have come to the end of the list of tests.\\n Perform any tests that had to be postponed until now.\\\"\\n & whl\\n ' ( !postponedTests\\n : (?.?oldFT.(=?postponedTest)) ?A\\n & postponedTest$(!done.):!oldFT\\n & !A:?postponedTests\\n )\\n & !postponedTests:\\n & out$(\\\"Solution:\\\" !done)\\n & ~\\n | !toDo\\n : ((?n.?text).?when.(=?test)) ?toDo\\n & \\\"'false' and 'true' are just two symbols, not 'boolean values'.\\n You can choose other symbols if you like.\\n The program first guesses the first symbol and assigns it to the variable FT.\\n After backtracking, the second symbol is guessed and assigned to FT.\\n This is done for each statement.\\\"\\n & false true\\n : ?\\n %@?FT\\n ( ?\\n & 1+!guesses:?guesses\\n & (!n.!FT):?testNow\\n & \\\"Do all tests that had to be postponed until now, unless one of those tests\\n fails. Remove the successful tests from the list of postponed tests.\\\"\\n & whl\\n ' ( !postponedTests\\n : ?A\\n (!n.?oldFT.(=?postponedTest))\\n ?Z\\n & postponedTest$(!done !testNow.!toDo)\\n : !oldFT\\n & !A !Z:?postponedTests\\n )\\n & \\\"Check that all tests that had to be postponed until now are removed from\\n the list of postponed tests. Only then go on with looking at testing\\n the current statement. Backtrack if a test failed.\\\"\\n & !postponedTests:~(? (!n.?) ?)\\n & ( !when:>!n\\n & \\\"The current statement cannot be tested right now. Postpone it to\\n the earliest coming statement where the current statement can be\\n tested.\\n (The earliest statement, denoted by 'when', is computed manually.)\\\"\\n & (!when.!FT.'$test):?testToBePostponed\\n | \\\"No need to postpone. Test the current statement now.\\\"\\n & :?testToBePostponed\\n & \\\"If the test fails, backtrack. If it succeeds, go on to the next\\n statement.\\\"\\n & test$(!done !testNow.!toDo):!FT\\n )\\n & \\\"So far so good. Test the next statements. (recursively)\\\"\\n & TestTruth\\n $ ( !done !testNow\\n . !toDo\\n . !testToBePostponed !postponedTests\\n )\\n )\\n )\\n )\\n & 0:?guesses\\n & TestTruth$(.!STATEMENTS.)\\n| out\\n $ ( str\\n $ ( \\\"That's it. I made \\\"\\n !guesses\\n \\\" true/false guesses in all. (A brute force method needs 2^12=\\\"\\n 2^12\\n \\\" guesses.\\\"\\n )\\n )\\n);\\n\",\n \"language\": \"Bracmat\"\n },\n {\n \"code\": \"#include <iostream>\\n#include <vector>\\n#include <string>\\n#include <cmath>\\n\\nusing namespace std;\\n\\n// convert int (0 or 1) to string (F or T)\\ninline\\nstring str(int n)\\n{\\n return n ? \\\"T\\\": \\\"F\\\";\\n}\\n\\nint main(void)\\n{\\n int solution_list_number = 1;\\n vector<string> st;\\n st = {\\n \\\" 1. This is a numbered list of twelve statements.\\\",\\n \\\" 2. Exactly 3 of the last 6 statements are true.\\\",\\n \\\" 3. Exactly 2 of the even-numbered statements are true.\\\",\\n \\\" 4. If statement 5 is true, then statements 6 and 7 are both true.\\\",\\n \\\" 5. The 3 preceding statements are all false.\\\",\\n \\\" 6. Exactly 4 of the odd-numbered statements are true.\\\",\\n \\\" 7. Either statement 2 or 3 is true, but not both.\\\",\\n \\\" 8. If statement 7 is true, then 5 and 6 are both true.\\\",\\n \\\" 9. Exactly 3 of the first 6 statements are true.\\\",\\n \\\" 10. The next two statements are both true.\\\",\\n \\\" 11. Exactly 1 of statements 7, 8 and 9 are true.\\\",\\n \\\" 12. Exactly 4 of the preceding statements are true.\\\"\\n }; // Good solution is: 1 3 4 6 7 11 are true\\n\\n int n = 12; // Number of statements.\\n int nTemp = (int)pow(2, n); // Number of solutions to check.\\n for (int counter = 0; counter < nTemp; counter++)\\n {\\n vector<int> s;\\n for (int k = 0; k < n; k++)\\n {\\n s.push_back((counter >> k) & 0x1);\\n }\\n vector<int> test(12);\\n int sum = 0;\\n // check each of the nTemp solutions for match.\\n // 1. This is a numbered list of twelve statements.\\n test[0] = s[0];\\n\\n // 2. Exactly 3 of the last 6 statements are true.\\n sum = s[6]+ s[7]+s[8]+s[9]+s[10]+s[11];\\n test[1] = ((sum == 3) == s[1]);\\n\\n // 3. Exactly 2 of the even-numbered statements are true.\\n sum = s[1]+s[3]+s[5]+s[7]+s[9]+s[11];\\n test[2] = ((sum == 2) == s[2]);\\n\\n // 4. If statement 5 is true, then statements 6 and 7 are both true.\\n test[3] = ((s[4] ? (s[5] && s[6]) : true) == s[3]);\\n\\n // 5. The 3 preceding statements are all false.\\n test[4] = (((s[1] + s[2] + s[3]) == 0) == s[4]);\\n\\n // 6. Exactly 4 of the odd-numbered statements are true.\\n sum = s[0] + s[2] + s[4] + s[6] + s[8] + s[10];\\n test[5] = ((sum == 4) == s[5]);\\n\\n // 7. Either statement 2 or 3 is true, but not both.\\n test[6] = (((s[1] + s[2]) == 1) == s[6]);\\n\\n // 8. If statement 7 is true, then 5 and 6 are both true.\\n test[7] = ((s[6] ? (s[4] && s[5]) : true) == s[7]);\\n\\n // 9. Exactly 3 of the first 6 statements are true.\\n sum = s[0]+s[1]+s[2]+s[3]+s[4]+s[5];\\n test[8] = ((sum == 3) == s[8]);\\n\\n // 10. The next two statements are both true.\\n test[9] = ((s[10] && s[11]) == s[9]);\\n\\n // 11. Exactly 1 of statements 7, 8 and 9 are true.\\n sum = s[6]+ s[7] + s[8];\\n test[10] = ((sum == 1) == s[10]);\\n\\n // 12. Exactly 4 of the preceding statements are true.\\n sum = s[0]+s[1]+s[2]+s[3]+s[4]+s[5]+s[6]+s[7]+s[8]+s[9]+s[10];\\n test[11] = ((sum == 4) == s[11]);\\n\\n // Check test results and print solution if 11 or 12 are true\\n int resultsTrue = 0;\\n for(unsigned int i = 0; i < test.size(); i++){\\n resultsTrue += test[i];\\n }\\n if(resultsTrue == 11 || resultsTrue == 12){\\n cout << solution_list_number++ << \\\". \\\" ;\\n string output = \\\"1:\\\"+str(s[0])+\\\" 2:\\\"+str(s[1])+\\\" 3:\\\"+str(s[2])\\n +\\\" 4:\\\"+str(s[3])+\\\" 5:\\\"+str(s[4])+\\\" 6:\\\"+ str(s[5])\\n +\\\" 7:\\\"+str(s[6])+\\\" 8:\\\"+str(s[7])+\\\" 9:\\\"+str(s[8])\\n +\\\" 10:\\\"+str(s[9])+\\\" 11:\\\"+str(s[10])+\\\" 12:\\\"+ str(s[11]);\\n\\n if (resultsTrue == 12) {\\n cout << \\\"Full Match, good solution!\\\" << endl;\\n cout << \\\"\\\\t\\\" << output << endl;\\n }\\n else if(resultsTrue == 11){\\n int i;\\n for(i = 0; i < 12; i++){\\n if(test[i] == 0){\\n break;\\n }\\n }\\n cout << \\\"Missed by one statement: \\\" << st[i] << endl;\\n cout << \\\"\\\\t\\\" << output << endl;\\n }\\n }\\n }\\n}\\n\",\n \"language\": \"C++\"\n },\n {\n \"code\": \"using System;\\nusing System.Collections.Generic;\\nusing System.Linq;\\n\\npublic static class TwelveStatements\\n{\\n public static void Main() {\\n Func<Statements, bool>[] checks = {\\n st => st[1],\\n st => st[2] == (7.To(12).Count(i => st[i]) == 3),\\n st => st[3] == (2.To(12, by: 2).Count(i => st[i]) == 2),\\n st => st[4] == st[5].Implies(st[6] && st[7]),\\n st => st[5] == (!st[2] && !st[3] && !st[4]),\\n st => st[6] == (1.To(12, by: 2).Count(i => st[i]) == 4),\\n st => st[7] == (st[2] != st[3]),\\n st => st[8] == st[7].Implies(st[5] && st[6]),\\n st => st[9] == (1.To(6).Count(i => st[i]) == 3),\\n st => st[10] == (st[11] && st[12]),\\n st => st[11] == (7.To(9).Count(i => st[i]) == 1),\\n st => st[12] == (1.To(11).Count(i => st[i]) == 4)\\n };\\n\\n for (Statements statements = new Statements(0); statements.Value < 4096; statements++) {\\n int count = 0;\\n int falseIndex = 0;\\n for (int i = 0; i < checks.Length; i++) {\\n if (checks[i](statements)) count++;\\n else falseIndex = i;\\n }\\n if (count == 0) Console.WriteLine($\\\"{\\\"All wrong:\\\", -13}{statements}\\\");\\n else if (count == 11) Console.WriteLine($\\\"{$\\\"Wrong at {falseIndex + 1}:\\\", -13}{statements}\\\");\\n else if (count == 12) Console.WriteLine($\\\"{\\\"All correct:\\\", -13}{statements}\\\");\\n }\\n }\\n\\n struct Statements\\n {\\n public Statements(int value) : this() { Value = value; }\\n\\n public int Value { get; }\\n\\n public bool this[int index] => (Value & (1 << index - 1)) != 0;\\n\\n public static Statements operator ++(Statements statements) => new Statements(statements.Value + 1);\\n\\n public override string ToString() {\\n Statements copy = this; //Cannot access 'this' in anonymous method...\\n return string.Join(\\\" \\\", from i in 1.To(12) select copy[i] ? \\\"T\\\" : \\\"F\\\");\\n }\\n\\n }\\n\\n //Extension methods\\n static bool Implies(this bool x, bool y) => !x || y;\\n\\n static IEnumerable<int> To(this int start, int end, int by = 1) {\\n while (start <= end) {\\n yield return start;\\n start += by;\\n }\\n }\\n\\n}\\n\",\n \"language\": \"C-sharp\"\n },\n {\n \"code\": \"(use '[clojure.math.combinatorics]\\n\\n(defn xor? [& args]\\n (odd? (count (filter identity args))))\\n\\n(defn twelve-statements []\\n (for [[a b c d e f g h i j k l] (selections [true false] 12)\\n :when (true? a)\\n :when (if (= 3 (count (filter true? [g h i j k l]))) (true? b) (false? b))\\n :when (if (= 2 (count (filter true? [b d f h j l]))) (true? c) (false? c))\\n :when (if (or (false? e) (every? true? [e f g])) (true? d) (false? d))\\n :when (if (every? false? [b c d]) (true? e) (false? e))\\n :when (if (= 4 (count (filter true? [a c e g i k]))) (true? f) (false? f))\\n :when (if (xor? (true? b) (true? c)) (true? g) (false? g))\\n :when (if (or (false? g) (every? true? [e f g])) (true? h) (false? h))\\n :when (if (= 3 (count (filter true? [a b c d e f]))) (true? i) (false? i))\\n :when (if (every? true? [k l]) (true? j) (false? j))\\n :when (if (= 1 (count (filter true? [g h i]))) (true? k) (false? k))\\n :when (if (= 4 (count (filter true? [a b c d e f g h i j k]))) (true? l) (false? l))]\\n [a b c d e f g h i j k l]))\\n\",\n \"language\": \"Clojure\"\n },\n {\n \"code\": \"(defparameter *state* (make-list 12))\\n\\n(defparameter *statements* '(t ; 1\\n (= (count-true '(7 8 9 10 11 12)) 3) ; 2\\n (= (count-true '(2 4 6 8 10 12)) 2) ; 3\\n (or (not (p 5)) (and (p 6) (p 7))) ; 4\\n (and (not (p 2)) (not (p 3)) (not (p 4))) ; 5\\n (= (count-true '(1 3 5 7 9 11)) 4) ; 6\\n (or (and (p 2) (not (p 3))) (and (not (p 2)) (p 3))) ; 7\\n (or (not (p 7)) (and (p 5) (p 6))) ; 8\\n (= (count-true '(1 2 3 4 5 6)) 3) ; 9\\n (and (p 11) (p 12)) ;10\\n (= (count-true '(7 8 9)) 1) ;11\\n (= (count-true '(1 2 3 4 5 6 7 8 9 10 11)) 4))) ;12\\n\\n(defun start ()\\n (loop while (not (equal *state* '(t t t t t t t t t t t t)))\\n do (progn (let ((true-stats (check)))\\n\\t\\t (cond ((= true-stats 11) (result nil))\\n\\t\\t\\t ((= true-stats 12) (result t))))\\n\\t\\t (new-state))))\\n\\n(defun check ()\\n (loop for el in *state*\\n for stat in *statements*\\n counting (eq el (eval stat)) into true-stats\\n finally (return true-stats)))\\n\\n(defun count-true (lst)\\n (loop for i in lst\\n counting (nth (- i 1) *state*) into total\\n finally (return total)))\\n\\n(defun p (n)\\n (nth (- n 1) *state*))\\n\\n(defun new-state ()\\n (let ((contr t))\\n (loop for i from 0 to 11\\n do (progn (setf (nth i *state*) (not (eq (nth i *state*) contr)))\\n (setq contr (and contr (not (nth i *state*))))))))\\n\\n(defun result (?)\\n (format t \\\"~:[Missed by one~;Solution:~] ~%~{~:[F~;T~] ~}~%\\\" ? *state*))\\n\",\n \"language\": \"Common-Lisp\"\n },\n {\n \"code\": \"import std.stdio, std.algorithm, std.range, std.functional;\\n\\nimmutable texts = [\\n \\\"this is a numbered list of twelve statements\\\",\\n \\\"exactly 3 of the last 6 statements are true\\\",\\n \\\"exactly 2 of the even-numbered statements are true\\\",\\n \\\"if statement 5 is true, then statements 6 and 7 are both true\\\",\\n \\\"the 3 preceding statements are all false\\\",\\n \\\"exactly 4 of the odd-numbered statements are true\\\",\\n \\\"either statement 2 or 3 is true, but not both\\\",\\n \\\"if statement 7 is true, then 5 and 6 are both true\\\",\\n \\\"exactly 3 of the first 6 statements are true\\\",\\n \\\"the next two statements are both true\\\",\\n \\\"exactly 1 of statements 7, 8 and 9 are true\\\",\\n \\\"exactly 4 of the preceding statements are true\\\"];\\n\\nimmutable pure @safe @nogc bool function(in bool[])[12] predicates = [\\n s => s.length == 12,\\n s => s[$ - 6 .. $].sum == 3,\\n s => s.dropOne.stride(2).sum == 2,\\n s => s[4] ? (s[5] && s[6]) : true,\\n s => s[1 .. 4].sum == 0,\\n s => s.stride(2).sum == 4,\\n s => s[1 .. 3].sum == 1,\\n s => s[6] ? (s[4] && s[5]) : true,\\n s => s[0 .. 6].sum == 3,\\n s => s[10] && s[11],\\n s => s[6 .. 9].sum == 1,\\n s => s[0 .. 11].sum == 4];\\n\\nvoid main() @safe {\\n enum nStats = predicates.length;\\n\\n foreach (immutable n; 0 .. 2 ^^ nStats) {\\n bool[nStats] st, matches;\\n nStats.iota.map!(i => !!(n & (2 ^^ i))).copy(st[]);\\n st[].zip(predicates[].map!(f => f(st)))\\n .map!(s_t => s_t[0] == s_t[1]).copy(matches[]);\\n if (matches[].sum >= nStats - 1) {\\n if (matches[].all)\\n \\\">>> Solution:\\\".writeln;\\n else\\n writefln(\\\"Missed by statement: %d\\\",\\n matches[].countUntil(false) + 1);\\n writefln(\\\"%-(%s %)\\\", st[].map!q{ \\\"FT\\\"[a] });\\n }\\n }\\n}\\n\",\n \"language\": \"D\"\n },\n {\n \"code\": \"len t[] 12\\nfunc f n .\\n if n = 1\\n return if 12 = 12\\n elif n = 2\\n for i = 7 to 12\\n s += t[i]\\n .\\n return if s = 3\\n elif n = 3\\n for i = 2 step 2 to 12\\n s += t[i]\\n .\\n return if s = 2\\n elif n = 4\\n if t[5] = 1\\n return if t[6] + t[7] = 2\\n .\\n return 1\\n elif n = 5\\n for i = 2 to 4\\n s += t[i]\\n .\\n return if s = 0\\n elif n = 6\\n for i = 1 step 2 to 11\\n s += t[i]\\n .\\n return if s = 4\\n elif n = 7\\n return if t[2] + t[3] = 1\\n elif n = 8\\n if t[7] = 1\\n return if t[5] + t[6] = 2\\n .\\n return 1\\n elif n = 9\\n for i = 1 to 6\\n s += t[i]\\n .\\n return if s = 3\\n elif n = 10\\n return if t[11] + t[12] = 2\\n elif n = 11\\n for i = 7 to 9\\n s += t[i]\\n .\\n return if s = 1\\n elif n = 12\\n for i = 1 to 11\\n s += t[i]\\n .\\n return if s = 4\\n .\\n.\\nfor tst = 0 to 4095\\n h = tst\\n for i to 12\\n t[i] = h mod 2\\n h = h div 2\\n .\\n s = 0\\n for i to 12\\n s += if f i = t[i]\\n .\\n if s = 12\\n print t[]\\n .\\n.\\n\",\n \"language\": \"EasyLang\"\n },\n {\n \"code\": \"class\\n\\tAPPLICATION\\n\\ncreate\\n\\tmake\\n\\nfeature\\n\\n\\tmake\\n\\t\\t\\t-- Possible solutions.\\n\\t\\tdo\\n\\t\\t\\tcreate s.make_filled (False, 1, 12)\\n\\t\\t\\ts [1] := True\\n\\t\\t\\trecurseAll (2)\\n\\t\\t\\tio.put_string (counter.out + \\\" solution found. \\\")\\n\\t\\tend\\n\\nfeature {NONE}\\n\\n\\ts: ARRAY [BOOLEAN]\\n\\n\\tcheck2: BOOLEAN\\n\\t\\t\\t-- Is statement 2 fulfilled?\\n\\t\\tlocal\\n\\t\\t\\tcount: INTEGER\\n\\t\\tdo\\n\\t\\t\\tacross\\n\\t\\t\\t\\t7 |..| 12 as c\\n\\t\\t\\tloop\\n\\t\\t\\t\\tif s [c.item] then\\n\\t\\t\\t\\t\\tcount := count + 1\\n\\t\\t\\t\\tend\\n\\t\\t\\tend\\n\\t\\t\\tResult := s [2] = (count = 3)\\n\\t\\tend\\n\\n\\tcheck3: BOOLEAN\\n\\t\\t\\t-- Is statement 3 fulfilled?\\n\\t\\tlocal\\n\\t\\t\\tcount, i: INTEGER\\n\\t\\tdo\\n\\t\\t\\tfrom\\n\\t\\t\\t\\ti := 2\\n\\t\\t\\tuntil\\n\\t\\t\\t\\ti > 12\\n\\t\\t\\tloop\\n\\t\\t\\t\\tif s [i] then\\n\\t\\t\\t\\t\\tcount := count + 1\\n\\t\\t\\t\\tend\\n\\t\\t\\t\\ti := i + 2\\n\\t\\t\\tend\\n\\t\\t\\tResult := s [3] = (count = 2)\\n\\t\\tend\\n\\n\\tcheck4: BOOLEAN\\n\\t\\t\\t-- Is statement 4 fulfilled?\\n\\t\\tdo\\n\\t\\t\\tResult := s [4] = ((not s [5]) or (s [6] and s [7]))\\n\\t\\tend\\n\\n\\tcheck5: BOOLEAN\\n\\t\\t\\t-- Is statement 5 fulfilled?\\n\\t\\tdo\\n\\t\\t\\tResult := s [5] = ((not s [2]) and (not s [3]) and (not s [4]))\\n\\t\\tend\\n\\n\\tcheck6: BOOLEAN\\n\\t\\t\\t-- Is statement 6 fulfilled?\\n\\t\\tlocal\\n\\t\\t\\tcount, i: INTEGER\\n\\t\\tdo\\n\\t\\t\\tfrom\\n\\t\\t\\t\\ti := 1\\n\\t\\t\\tuntil\\n\\t\\t\\t\\ti > 11\\n\\t\\t\\tloop\\n\\t\\t\\t\\tif s [i] then\\n\\t\\t\\t\\t\\tcount := count + 1\\n\\t\\t\\t\\tend\\n\\t\\t\\t\\ti := i + 2\\n\\t\\t\\tend\\n\\t\\t\\tResult := s [6] = (count = 4)\\n\\t\\tend\\n\\n\\tcheck7: BOOLEAN\\n\\t\\t\\t-- Is statement 7 fulfilled?\\n\\t\\tdo\\n\\t\\t\\tResult := s [7] = ((s [2] or s [3]) and not (s [2] and s [3]))\\n\\t\\tend\\n\\n\\tcheck8: BOOLEAN\\n\\t\\t\\t-- Is statement 8 fulfilled?\\n\\t\\tdo\\n\\t\\t\\tResult := s [8] = (not s [7] or (s [5] and s [6]))\\n\\t\\tend\\n\\n\\tcheck9: BOOLEAN\\n\\t\\t\\t-- Is statement 9 fulfilled?\\n\\t\\tlocal\\n\\t\\t\\tcount: INTEGER\\n\\t\\tdo\\n\\t\\t\\tacross\\n\\t\\t\\t\\t1 |..| 6 as c\\n\\t\\t\\tloop\\n\\t\\t\\t\\tif s [c.item] then\\n\\t\\t\\t\\t\\tcount := count + 1\\n\\t\\t\\t\\tend\\n\\t\\t\\tend\\n\\t\\t\\tResult := s [9] = (count = 3)\\n\\t\\tend\\n\\n\\tcheck10: BOOLEAN\\n\\t\\t\\t-- Is statement 10 fulfilled?\\n\\t\\tdo\\n\\t\\t\\tResult := s [10] = (s [11] and s [12])\\n\\t\\tend\\n\\n\\tcheck11: BOOLEAN\\n\\t\\t\\t-- Is statement 11 fulfilled?\\n\\t\\tlocal\\n\\t\\t\\tcount: INTEGER\\n\\t\\tdo\\n\\t\\t\\tacross\\n\\t\\t\\t\\t7 |..| 9 as c\\n\\t\\t\\tloop\\n\\t\\t\\t\\tif s [c.item] then\\n\\t\\t\\t\\t\\tcount := count + 1\\n\\t\\t\\t\\tend\\n\\t\\t\\tend\\n\\t\\t\\tResult := s [11] = (count = 1)\\n\\t\\tend\\n\\n\\tcheck12: BOOLEAN\\n\\t\\t\\t-- Is statement 12 fulfilled?\\n\\t\\tlocal\\n\\t\\t\\tcount: INTEGER\\n\\t\\tdo\\n\\t\\t\\tacross\\n\\t\\t\\t\\t1 |..| 11 as c\\n\\t\\t\\tloop\\n\\t\\t\\t\\tif s [c.item] then\\n\\t\\t\\t\\t\\tcount := count + 1\\n\\t\\t\\t\\tend\\n\\t\\t\\tend\\n\\t\\t\\tResult := (s [12] = (count = 4))\\n\\t\\tend\\n\\n\\tcounter: INTEGER\\n\\n\\tcheckit\\n\\t\\t\\t-- Check if all statements are correctly solved.\\n\\t\\tdo\\n\\t\\t\\tif check2 and check3 and check4 and check5 and check6 and check7 and check8 and check9 and check10 and check11 and check12 then\\n\\t\\t\\t\\tacross\\n\\t\\t\\t\\t\\t1 |..| 12 as c\\n\\t\\t\\t\\tloop\\n\\t\\t\\t\\t\\tif s [c.item] then\\n\\t\\t\\t\\t\\t\\tio.put_string (c.item.out + \\\"%T\\\")\\n\\t\\t\\t\\t\\tend\\n\\t\\t\\t\\tend\\n\\t\\t\\t\\tio.new_line\\n\\t\\t\\t\\tcounter := counter + 1\\n\\t\\t\\tend\\n\\t\\tend\\n\\n\\trecurseAll (k: INTEGER)\\n\\t\\t\\t-- All possible True and False combinations to check for a solution.\\n\\t\\tdo\\n\\t\\t\\tif k = 13 then\\n\\t\\t\\t\\tcheckit\\n\\t\\t\\telse\\n\\t\\t\\t\\ts [k] := False\\n\\t\\t\\t\\trecurseAll (k + 1)\\n\\t\\t\\t\\ts [k] := True\\n\\t\\t\\t\\trecurseAll (k + 1)\\n\\t\\t\\tend\\n\\t\\tend\\n\\nend\\n\",\n \"language\": \"Eiffel\"\n },\n {\n \"code\": \"import system'routines;\\nimport extensions;\\nimport extensions'text;\\n\\nextension op\\n{\\n printSolution(bits)\\n = self.zipBy(bits,\\n (s,b => s.iif(\\\"T\\\",\\\"F\\\") + (s.xor(b)).iif(\\\"* \\\",\\\" \\\"))).summarize(new StringWriter());\\n\\n toBit()\\n = self.iif(1,0);\\n}\\n\\npuzzle = new Func1[]\\n{\\n (bits => bits.Length == 12),\\n\\n (bits => bits.last(6).selectBy::(x => x.toBit()).summarize() == 3 ),\\n\\n (bits => bits.zipBy(new Range(1, 12),\\n (x,i => (i.toInt().isEven()).and(x).toBit())).summarize() == 2 ),\\n\\n (bits => bits[4].iif(bits[5] && bits[6],true) ),\\n\\n (bits => ((bits[1] || bits[2]) || bits[3]).Inverted ),\\n\\n (bits => bits.zipBy(new Range(1, 12),\\n (x,i => (i.toInt().isOdd()).and(x).toBit() )).summarize() == 4 ),\\n\\n (bits => bits[1].xor(bits[2]) ),\\n\\n (bits => bits[6].iif(bits[5] && bits[4],true) ),\\n\\n (bits => bits.top(6).selectBy::(x => x.toBit() ).summarize() == 3 ),\\n\\n (bits => bits[10] && bits[11] ),\\n\\n (bits => (bits[6].toBit() + bits[7].toBit() + bits[8].toBit())==1 ),\\n\\n (bits => bits.top(11).selectBy::(x => x.toBit()).summarize() == 4 )\\n};\\n\\npublic program()\\n{\\n console.writeLine();\\n\\n for(int n := 0; n < 2.power(12); n += 1)\\n {\\n var bits := BitArray32.load(n).top(12).toArray();\\n var results := puzzle.selectBy::(r => r(bits)).toArray();\\n\\n var counts := bits.zipBy(results, (b,r => b.xor(r).toBit() )).summarize();\\n\\n counts =>\\n 0 { console.printLine(\\\"Total hit :\\\",results.printSolution(bits)) }\\n 1 { console.printLine(\\\"Near miss :\\\",results.printSolution(bits)) }\\n 12 { console.printLine(\\\"Total miss:\\\",results.printSolution(bits)) };\\n };\\n\\n console.readChar()\\n}\\n\",\n \"language\": \"Elena\"\n },\n {\n \"code\": \"PROGRAM TWELVE_STMS\\n\\n!$DYNAMIC\\nDIM PASS%[0],T%[0]\\n\\nFUNCTION EOR(X,Y)\\n EOR=(X AND NOT(Y)) OR (NOT(X) AND Y)\\nEND FUNCTION\\n\\nBEGIN\\n NSTATEMENTS%=12\\n !$DIM PASS%[NSTATEMENTS%],T%[NSTATEMENTS%]\\n\\n FOR TRY%=0 TO 2^NSTATEMENTS%-1 DO\\n\\n ! Postulate answer:\\n FOR STMT%=1 TO 12 DO\\n T%[STMT%]=(TRY% AND 2^(STMT%-1))<>0\\n END FOR\\n\\n ! Test consistency:\\n PASS%[1]=T%[1]=(NSTATEMENTS%=12)\\n PASS%[2]=T%[2]=((T%[7]+T%[8]+T%[9]+T%[10]+T%[11]+T%[12])=-3)\\n PASS%[3]=T%[3]=((T%[2]+T%[4]+T%[6]+T%[8]+T%[10]+T%[12])=-2)\\n PASS%[4]=T%[4]=((NOT T%[5] OR (T%[6] AND T%[7])))\\n PASS%[5]=T%[5]=(NOT T%[2] AND NOT T%[3] AND NOT T%[4])\\n PASS%[6]=T%[6]=((T%[1]+T%[3]+T%[5]+T%[7]+T%[9]+T%[11])=-4)\\n PASS%[7]=T%[7]=(EOR(T%[2],T%[3]))\\n PASS%[8]=T%[8]=((NOT T%[7] OR (T%[5] AND T%[6])))\\n PASS%[9]=T%[9]=((T%[1]+T%[2]+T%[3]+T%[4]+T%[5]+T%[6])=-3)\\n PASS%[10]=T%[10]=(T%[11] AND T%[12])\\n PASS%[11]=T%[11]=((T%[7]+T%[8]+T%[9])=-1)\\n PASS%[12]=T%[12]=((T%[1]+T%[2]+T%[3]+T%[4]+T%[5]+T%[6]+T%[7]+T%[8]+T%[9]+T%[10]+T%[11])=-4)\\n\\n SUM=0\\n FOR I%=1 TO 12 DO\\n SUM=SUM+PASS%[I%]\\n END FOR\\n\\n CASE SUM OF\\n -11->\\n PRINT(\\\"Near miss with statements \\\";)\\n FOR STMT%=1 TO 12 DO\\n IF T%[STMT%] THEN PRINT(STMT%;) END IF\\n IF NOT PASS%[STMT%] THEN MISS%=STMT% END IF\\n END FOR\\n PRINT(\\\"true (failed \\\";MISS%;\\\").\\\")\\n END ->\\n -12->\\n PRINT(\\\"Solution! with statements \\\";)\\n FOR STMT%=1 TO 12 DO\\n IF T%[STMT%] THEN PRINT(STMT%;) END IF\\n END FOR\\n PRINT(\\\"true.\\\")\\n END ->\\n END CASE\\n\\n END FOR ! TRY%\\nEND PROGRAM\\n\",\n \"language\": \"ERRE\"\n },\n {\n \"code\": \": lastbit ( n1 -- n2)\\n dup if 1 swap begin dup 1 <> while swap 1+ swap 1 rshift repeat drop then\\n;\\n\\n: bit 1 swap lshift and 0<> ; ( n1 n2 -- f)\\n: bitcount 0 swap begin dup while dup 1- and swap 1+ swap repeat drop ;\\n\\n12 constant #stat \\\\ number of statements\\n \\\\ encoding of the statements\\n: s1 >r #stat 12 = r> 0 bit = ; \\\\ heavy use of binary\\n: s2 >r r@ 4032 and bitcount 3 = r> 1 bit = ;\\n: s3 >r r@ 2730 and bitcount 2 = r> 2 bit = ;\\n: s4 >r r@ 4 bit 0= 96 r@ over and = or r> 3 bit = ;\\n: s5 >r r@ 14 and 0= r> 4 bit = ;\\n: s6 >r r@ 1365 and bitcount 4 = r> 5 bit = ;\\n: s7 >r r@ 1 bit r@ 2 bit xor r> 6 bit = ;\\n: s8 >r r@ 6 bit 0= 48 r@ over and = or r> 7 bit = ;\\n: s9 >r r@ 63 and bitcount 3 = r> 8 bit = ;\\n: s10 >r 3072 r@ over and = r> 9 bit = ;\\n: s11 >r r@ 448 and bitcount 1 = r> 10 bit = ;\\n: s12 >r r@ 2047 and bitcount 4 = r> 11 bit = ;\\n: list #stat 0 do dup i bit if i 1+ . then loop drop ;\\n\\n: nearmiss? \\\\ do we have a near miss?\\n over #stat 1- = if ( true-pattern #true stat-pattern)\\n .\\\" Near miss with statements \\\" dup list .\\\" true (failed \\\"\\n >r over invert 1 #stat lshift 1- and lastbit 0 .r .\\\" )\\\" cr r>\\n then \\\\ extract the failed statement\\n;\\n \\\\ have we found a solution?\\n: solution? ( true-pattern #true stat-pattern)\\n over #stat = if .\\\" Solution! with statements \\\" dup list .\\\" true.\\\" cr then\\n;\\n\\n: 12statements \\\\ test the twelve patterns\\n 1 #stat lshift 0 do \\\\ create another bit pattern\\n i s12 2* i s11 + 2* i s10 + 2* i s9 + 2* i s8 + 2* i s7 + 2*\\n i s6 + 2* i s5 + 2* i s4 + 2* i s3 + 2* i s2 + 2* i s1 +\\n abs dup bitcount i solution? nearmiss? drop drop drop\\n loop \\\\ count number of bytes and evaluate\\n;\\n\\n12statements\\n\",\n \"language\": \"Forth\"\n },\n {\n \"code\": \"Dim As Integer nEnunciados = 12, intento, enun, errado\\nDim As Integer Afirm(nEnunciados), T(nEnunciados)\\n\\nFor intento = 0 To 2^nEnunciados-1\\n REM Postular respuesta:\\n For enun = 1 To 12\\n T(enun) = (intento And 2^(enun-1)) <> 0\\n Next enum\\n\\n REM Prueba de consistencia:\\n Afirm(1) = T(1) = (nEnunciados = 12)\\n Afirm(2) = T(2) = ((T(7)+T(8)+T(9)+T(10)+T(11)+T(12)) = -3)\\n Afirm(3) = T(3) = ((T(2)+T(4)+T(6)+T(8)+T(10)+T(12)) = -2)\\n Afirm(4) = T(4) = ((Not T(5) Or (T(6) And T(7))))\\n Afirm(5) = T(5) = (Not T(2) And Not T(3) And Not T(4))\\n Afirm(6) = T(6) = ((T(1)+T(3)+T(5)+T(7)+T(9)+T(11)) = -4)\\n Afirm(7) = T(7) = ((T(2) Or T(3)))\\n Afirm(8) = T(8) = ((Not T(7) Or (T(5) And T(6))))\\n Afirm(9) = T(9) = ((T(1)+T(2)+T(3)+T(4)+T(5)+T(6)) = -3)\\n Afirm(10) = T(10) = (T(11) And T(12))\\n Afirm(11) = T(11) = ((T(7)+T(8)+T(9)) = -1)\\n Afirm(12) = T(12) = ((T(1)+T(2)+T(3)+T(4)+T(5)+T(6) + T(7)+T(8)+T(9)+T(10)+T(11)) = -4)\\n\\n Dim As Integer suma = 0\\n For cont As Integer = 1 To 12\\n suma += Afirm(cont)\\n Next cont\\n\\n Select Case suma\\n Case -11\\n Color 7: Print \\\"Casi resuelto, con los enunciados \\\";\\n For enun = 1 To 12\\n If T(enun) Then Print ; enun; \\\" \\\";\\n If Not Afirm(enun) Then errado = enun\\n Next enun\\n Print \\\"verdaderos (falsos\\\"; errado; \\\").\\\"\\n Case -12\\n Color 10: Print \\\"Resuelto! con los enunciados \\\";\\n For enun = 1 To 12\\n If T(enun) Then Print ; enun; \\\" \\\";\\n Next enun\\n Print \\\"verdaderos.\\\"\\n End Select\\nNext intento\\nSleep\\n\",\n \"language\": \"FreeBASIC\"\n },\n {\n \"code\": \"package main\\n\\nimport \\\"fmt\\\"\\n\\n// its' not too much more work to check all the permutations concurrently\\nvar solution = make(chan int)\\nvar nearMiss = make(chan int)\\nvar done = make(chan bool)\\n\\nfunc main() {\\n // iterate and use the bits as the permutation\\n for i := 0; i < 4096; i++ {\\n go checkPerm(i)\\n }\\n // collect the misses and list them after the complete solution(s)\\n var ms []int\\n for i := 0; i < 4096; {\\n select {\\n case <-done:\\n i++\\n case s := <-solution:\\n print12(\\\"solution\\\", s)\\n case m := <-nearMiss:\\n ms = append(ms, m)\\n }\\n }\\n for _, m := range ms {\\n print12(\\\"near miss\\\", m)\\n }\\n}\\n\\nfunc print12(label string, bits int) {\\n fmt.Print(label, \\\":\\\")\\n for i := 1; i <= 12; i++ {\\n if bits&1 == 1 {\\n fmt.Print(\\\" \\\", i)\\n }\\n bits >>= 1\\n }\\n fmt.Println()\\n}\\n\\nfunc checkPerm(tz int) {\\n // closure returns true if tz bit corresponding to\\n // 1-based statement number is 1.\\n ts := func(n uint) bool {\\n return tz>>(n-1)&1 == 1\\n }\\n // variadic closure returns number of statements listed as arguments\\n // which have corresponding tz bit == 1.\\n ntrue := func(xs ...uint) int {\\n nt := 0\\n for _, x := range xs {\\n if ts(x) {\\n nt++\\n }\\n }\\n return nt\\n }\\n // a flag used on repeated calls to test.\\n // set to true when first contradiction is found.\\n // if another is found, this function (checkPerm) can \\\"short circuit\\\"\\n // and return immediately without checking additional statements.\\n var con bool\\n // closure called to test each statement\\n test := func(statement uint, b bool) {\\n switch {\\n case ts(statement) == b:\\n case con:\\n panic(\\\"bail\\\")\\n default:\\n con = true\\n }\\n }\\n // short circuit mechanism\\n defer func() {\\n if x := recover(); x != nil {\\n if msg, ok := x.(string); !ok && msg != \\\"bail\\\" {\\n panic(x)\\n }\\n }\\n done <- true\\n }()\\n\\n // 1. This is a numbered list of twelve statements.\\n test(1, true)\\n\\n // 2. Exactly 3 of the last 6 statements are true.\\n test(2, ntrue(7, 8, 9, 10, 11, 12) == 3)\\n\\n // 3. Exactly 2 of the even-numbered statements are true.\\n test(3, ntrue(2, 4, 6, 8, 10, 12) == 2)\\n\\n // 4. If statement 5 is true, then statements 6 and 7 are both true.\\n test(4, !ts(5) || ts(6) && ts(7))\\n\\n // 5. The 3 preceding statements are all false.\\n test(5, !ts(4) && !ts(3) && !ts(2))\\n\\n // 6. Exactly 4 of the odd-numbered statements are true.\\n test(6, ntrue(1, 3, 5, 7, 9, 11) == 4)\\n\\n // 7. Either statement 2 or 3 is true, but not both.\\n test(7, ts(2) != ts(3))\\n\\n // 8. If statement 7 is true, then 5 and 6 are both true.\\n test(8, !ts(7) || ts(5) && ts(6))\\n\\n // 9. Exactly 3 of the first 6 statements are true.\\n test(9, ntrue(1, 2, 3, 4, 5, 6) == 3)\\n\\n // 10. The next two statements are both true.\\n test(10, ts(11) && ts(12))\\n\\n // 11. Exactly 1 of statements 7, 8 and 9 are true.\\n test(11, ntrue(7, 8, 9) == 1)\\n\\n // 12. Exactly 4 of the preceding statements are true.\\n test(12, ntrue(1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11) == 4)\\n\\n // no short circuit? send permutation as either near miss or solution\\n if con {\\n nearMiss <- tz\\n } else {\\n solution <- tz\\n }\\n}\\n\",\n \"language\": \"Go\"\n },\n {\n \"code\": \"enum Rule {\\n r01( 1, { r()*.num == (1..12) }),\\n r02( 2, { r(7..12).count { it.truth } == 3 }),\\n r03( 3, { r(2..12, 2).count { it.truth } == 2 }),\\n r04( 4, { r(5).truth ? r(6).truth && r(7).truth : true }),\\n r05( 5, { r(2..4).count { it.truth } == 0 }),\\n r06( 6, { r(1..11, 2).count { it.truth } == 4 }),\\n r07( 7, { r(2).truth != r(3).truth }),\\n r08( 8, { r(7).truth ? r(5).truth && r(6).truth : true }),\\n r09( 9, { r(1..6).count { it.truth } == 3 }),\\n r10(10, { r(11).truth && r(12).truth }),\\n r11(11, { r(7..9).count { it.truth } == 1 }),\\n r12(12, { r(1..11).count { it.truth } == 4 });\\n\\n final int num\\n final Closure statement\\n boolean truth\\n\\n static final List<Rule> rules = [ null, r01, r02, r03, r04, r05, r06, r07, r08, r09, r10, r11, r12]\\n\\n private Rule(num, statement) {\\n this.num = num\\n this.statement = statement\\n }\\n\\n public static Rule r(int index) { rules[index] }\\n public static List<Rule> r() { rules[1..12] }\\n public static List<Rule> r(List<Integer> indices) { rules[indices] }\\n public static List<Rule> r(IntRange indices) { rules[indices] }\\n public static List<Rule> r(IntRange indices, int step) { r(indices.step(step)) }\\n\\n public static void setAllTruth(int bits) {\\n (1..12).each { r(it).truth = !(bits & (1 << (12 - it))) }\\n }\\n\\n public static void evaluate() {\\n def nearMisses = [:]\\n (0..<(2**12)).each { i ->\\n setAllTruth(i)\\n def truthCandidates = r().findAll { it.truth }\\n def truthMatchCount = r().count { it.statement() == it.truth }\\n if (truthMatchCount == 12) {\\n println \\\">Solution< ${truthCandidates*.num}\\\"\\n } else if (truthMatchCount == 11) {\\n def miss = (1..12).find { r(it).statement() != r(it).truth }\\n nearMisses << [(truthCandidates): miss]\\n }\\n }\\n nearMisses.each { truths, miss ->\\n printf (\\\"Near Miss: %-21s (failed %2d)\\\\n\\\", \\\"${truths*.num}\\\", miss)\\n }\\n }\\n}\\n\\nRule.evaluate()\\n\",\n \"language\": \"Groovy\"\n },\n {\n \"code\": \"import Data.List (findIndices)\\n\\ntf :: [[Int] -> Bool] -> [[Int]]\\ntf = traverse (const [1, 0])\\n\\nwrongness :: [Int] -> [[Int] -> Bool] -> [Int]\\nwrongness ns ps = findIndices id (zipWith (/=) ns (map (fromEnum . ($ ns)) ps))\\n\\nstatements :: [[Int] -> Bool]\\nstatements =\\n [ (== 12) . length\\n , 3 ⊂ [length statements - 6 ..]\\n , 2 ⊂ [1,3 ..]\\n , 4 → [4 .. 6]\\n , 0 ⊂ [1 .. 3]\\n , 4 ⊂ [0,2 ..]\\n , 1 ⊂ [1, 2]\\n , 6 → [4 .. 6]\\n , 3 ⊂ [0 .. 5]\\n , 2 ⊂ [10, 11]\\n , 1 ⊂ [6, 7, 8]\\n , 4 ⊂ [0 .. 10]\\n ]\\n where\\n (⊂), (→) :: Int -> [Int] -> [Int] -> Bool\\n (s ⊂ x) b = s == (sum . map (b !!) . takeWhile (< length b)) x\\n (a → x) b = (b !! a == 0) || all ((== 1) . (b !!)) x\\n\\ntestall :: [[Int] -> Bool] -> Int -> [([Int], [Int])]\\ntestall s n =\\n [ (b, w)\\n | b <- tf s\\n , w <- [wrongness b s]\\n , length w == n ]\\n\\nmain :: IO ()\\nmain =\\n let t = testall statements\\n in do putStrLn \\\"Answer\\\"\\n mapM_ print $ t 0\\n putStrLn \\\"Near misses\\\"\\n mapM_ print $ t 1\\n\",\n \"language\": \"Haskell\"\n },\n {\n \"code\": \" apply\\n128!:2\\n\\nNB. example\\n '*:' apply 1 2 3\\n1 4 9\\n\",\n \"language\": \"J\"\n },\n {\n \"code\": \" offby1=: 1=+/errors\\n 'Statement ',\\\"1 (\\\":1+I.|: offby1 #\\\"1 errors),\\\"1 ' is inconsistent with exactly ',\\\"1 ((1\\\":@:+I.)\\\"1 #:I.offby1),\\\"1 ' being true'\\nStatement 1 is inconsistent with exactly 5 8 11 being true\\nStatement 1 is inconsistent with exactly 5 8 10 11 12 being true\\nStatement 1 is inconsistent with exactly 4 8 10 11 12 being true\\nStatement 8 is inconsistent with exactly 1 5 being true\\nStatement 11 is inconsistent with exactly 1 5 8 being true\\nStatement 12 is inconsistent with exactly 1 5 8 11 being true\\nStatement 12 is inconsistent with exactly 1 5 8 10 11 12 being true\\nStatement 8 is inconsistent with exactly 1 5 6 9 11 being true\\nStatement 8 is inconsistent with exactly 1 4 being true\\nStatement 12 is inconsistent with exactly 1 4 8 10 11 12 being true\\nStatement 6 is inconsistent with exactly 1 4 6 8 9 being true\\nStatement 7 is inconsistent with exactly 1 3 4 8 9 being true\\nStatement 9 is inconsistent with exactly 1 3 4 6 7 9 being true\\nStatement 12 is inconsistent with exactly 1 2 4 7 9 12 being true\\nStatement 10 is inconsistent with exactly 1 2 4 7 9 10 being true\\nStatement 8 is inconsistent with exactly 1 2 4 7 8 9 being true\\n\",\n \"language\": \"J\"\n },\n {\n \"code\": \"S=: <;._2 (0 :0)\\n 12&=@# NB. 1. This is a numbered list of twelve statements.\\n 3=+/@:{.~&_6 NB. 2. Exactly 3 of the last 6 statements are true.\\n 2= +/@:{~&1 3 5 7 9 11 NB. 3. Exactly 2 of the even-numbered statements are true.\\n 4&{=*./@:{~&4 5 6 NB. 4. If statement 5 is true, then statements 6 and 7 are both true.\\n 0=+/@:{~&1 2 3 NB. 5. The 3 preceding statements are all false.\\n 4=+/@:{~&0 2 4 6 8 10 NB. 6. Exactly 4 of the odd-numbered statements are true.\\n 1=+/@:{~&1 2 NB. 7. Either statement 2 or 3 is true, but not both.\\n 6&{=*./@:{~&4 5 6 NB. 8. If statement 7 is true, then 5 and 6 are both true.\\n 3=+/@:{.~&6 NB. 9. Exactly 3 of the first 6 statements are true.\\n 2=+/@:{~&10 11 NB. 10. The next two statements are both true.\\n 1=+/@:{~&6 7 8 NB. 11. Exactly 1 of statements 7, 8 and 9 are true.\\n 4=+/@:{.~&11 NB. 12. Exactly 4 of the preceding statements are true.\\n)\\n\\ntestall=: (];\\\"1 0<@I.@:(]~:(apply&><))\\\"1) #:@i.@(2&^)@#\\n\",\n \"language\": \"J\"\n },\n {\n \"code\": \" (#~0=#@{::~&_1\\\"1) testall S\\n┌───────────────────────┬┐\\n│1 0 1 1 0 1 1 0 0 0 1 0││\\n└───────────────────────┴┘\\n\",\n \"language\": \"J\"\n },\n {\n \"code\": \" 1+I.;(#~0=#@{::~&_1\\\"1) testall S\\n1 3 4 6 7 11\\n\",\n \"language\": \"J\"\n },\n {\n \"code\": \" (#~1=#@{::~&_1\\\"1) testall S\\n┌───────────────────────┬──┐\\n│0 0 0 0 1 0 0 1 0 0 1 0│0 │\\n├───────────────────────┼──┤\\n│0 0 0 0 1 0 0 1 0 1 1 1│0 │\\n├───────────────────────┼──┤\\n│0 0 0 1 0 0 0 1 0 1 1 1│0 │\\n├───────────────────────┼──┤\\n│1 0 0 0 1 0 0 0 0 0 0 0│7 │\\n├───────────────────────┼──┤\\n│1 0 0 0 1 0 0 1 0 0 0 0│10│\\n├───────────────────────┼──┤\\n│1 0 0 0 1 0 0 1 0 0 1 0│11│\\n├───────────────────────┼──┤\\n│1 0 0 0 1 0 0 1 0 1 1 1│11│\\n├───────────────────────┼──┤\\n│1 0 0 0 1 1 0 0 1 0 1 0│7 │\\n├───────────────────────┼──┤\\n│1 0 0 1 0 0 0 0 0 0 0 0│7 │\\n├───────────────────────┼──┤\\n│1 0 0 1 0 0 0 1 0 1 1 1│11│\\n├───────────────────────┼──┤\\n│1 0 0 1 0 1 0 1 1 0 0 0│5 │\\n├───────────────────────┼──┤\\n│1 0 1 1 0 0 0 1 1 0 0 0│6 │\\n├───────────────────────┼──┤\\n│1 0 1 1 0 1 1 0 1 0 0 0│8 │\\n├───────────────────────┼──┤\\n│1 1 0 1 0 0 1 0 1 0 0 1│11│\\n├───────────────────────┼──┤\\n│1 1 0 1 0 0 1 0 1 1 0 0│9 │\\n├───────────────────────┼──┤\\n│1 1 0 1 0 0 1 1 1 0 0 0│7 │\\n└───────────────────────┴──┘\\n\",\n \"language\": \"J\"\n },\n {\n \"code\": \" (-N)&{. #: S <:@]^:((]-.@-:(apply&><)\\\"1) (-N)&{.@#:@])^:(_) 2^N=.#S\\n1 0 1 1 0 1 1 0 0 0 1 0\\n\",\n \"language\": \"J\"\n },\n {\n \"code\": \"true=:1 :'(m-1)&{'\\n\\nS=: <;._2 (0 :0)\\n 12 = # NB. 1. This is a numbered list of twelve statements.\\n 3 (= +/) _6&{. NB. 2. Exactly 3 of the last 6 statements are true.\\n 2 (= +/) (12$0 1)&# NB. 3. Exactly 2 of the even-numbered statements are true.\\n 5 true (<: */) 6 7 true NB. 4. If statement 5 is true, then statements 6 and 7 are both true.\\n 0 (= +/) 2 3 4 true NB. 5. The 3 preceding statements are all false.\\n 4 (= +/) (12$1 0)&# NB. 6. Exactly 4 of the odd-numbered statements are true.\\n 1 (= +/) 2 3 true NB. 7. Either statement 2 or 3 is true, but not both.\\n 7 true (<: */) 5 6 true NB. 8. If statement 7 is true, then 5 and 6 are both true.\\n 3 (= +/) 6&{. NB. 9. Exactly 3 of the first 6 statements are true.\\n */@(11 12 true) NB. 10. The next two statements are both true.\\n 1 (= +/) 7 8 9 true NB. 11. Exactly 1 of statements 7, 8 and 9 are true.\\n 4 (= +/) }: NB. 12. Exactly 4 of the preceding statements are true.\\n)\\n\",\n \"language\": \"J\"\n },\n {\n \"code\": \"'sum not mask'=: |:\\\".;._2(0 :0)\\n 0; 0; 0 0 0 0 0 0 0 0 0 0 0 0 NB. 1. This is a numbered list of twelve statements.\\n 3; 0; 0 0 0 0 0 0 1 1 1 1 1 1 NB. 2. Exactly 3 of the last 6 statements are true.\\n 2; 0; 0 1 0 1 0 1 0 1 0 1 0 1 NB. 3. Exactly 2 of the even-numbered statements are true.\\n 2; 5; 0 0 0 0 0 1 1 0 0 0 0 0 NB. 4. If statement 5 is true, then statements 6 and 7 are both true.\\n 0; 0; 0 1 1 1 0 0 0 0 0 0 0 0 NB. 5. The 3 preceding statements are all false.\\n 4; 0; 1 0 1 0 1 0 1 0 1 0 1 0 NB. 6. Exactly 4 of the odd-numbered statements are true.\\n 1; 0; 0 1 1 0 0 0 0 0 0 0 0 0 NB. 7. Either statement 2 or 3 is true, but not both.\\n 2; 7; 0 0 0 0 1 1 0 0 0 0 0 0 NB. 8. If statement 7 is true, then 5 and 6 are both true.\\n 3; 0; 1 1 1 1 1 1 0 0 0 0 0 0 NB. 9. Exactly 3 of the first 6 statements are true.\\n 2; 0; 0 0 0 0 0 0 0 0 0 0 1 1 NB. 10. The next two statements are both true.\\n 1; 0; 0 0 0 0 0 0 1 1 1 0 0 0 NB. 11. Exactly 1 of statements 7, 8 and 9 are true.\\n 4; 0; 1 1 1 1 1 1 1 1 1 1 1 0 NB. 12. Exactly 4 of the preceding statements are true.\\n)\\npropositions=: |:#:i.2^#sum\\n\\nerrors=: propositions~:(1 - not { 1,propositions) >. sum = mask +/ .*propositions\\n\",\n \"language\": \"J\"\n },\n {\n \"code\": \" #:I.0=+/errors\\n1 0 1 1 0 1 1 0 0 0 1 0\\n 1+I.#:I.0=+/errors NB. true propositions for the consistent case\\n1 3 4 6 7 11\\n\",\n \"language\": \"J\"\n },\n {\n \"code\": \"public class LogicPuzzle\\n{\\n boolean S[] = new boolean[13];\\n int Count = 0;\\n\\n public boolean check2 ()\\n {\\n int count = 0;\\n for (int k = 7; k <= 12; k++)\\n if (S[k]) count++;\\n return S[2] == (count == 3);\\n }\\n\\n public boolean check3 ()\\n {\\n int count = 0;\\n for (int k = 2; k <= 12; k += 2)\\n if (S[k]) count++;\\n return S[3] == (count == 2);\\n }\\n\\n public boolean check4 ()\\n {\\n return S[4] == ( !S[5] || S[6] && S[7]);\\n }\\n\\n public boolean check5 ()\\n {\\n return S[5] == ( !S[2] && !S[3] && !S[4]);\\n }\\n\\n public boolean check6 ()\\n {\\n int count = 0;\\n for (int k = 1; k <= 11; k += 2)\\n if (S[k]) count++;\\n return S[6] == (count == 4);\\n }\\n\\n public boolean check7 ()\\n {\\n return S[7] == ((S[2] || S[3]) && !(S[2] && S[3]));\\n }\\n\\n public boolean check8 ()\\n {\\n return S[8] == ( !S[7] || S[5] && S[6]);\\n }\\n\\n public boolean check9 ()\\n {\\n int count = 0;\\n for (int k = 1; k <= 6; k++)\\n if (S[k]) count++;\\n return S[9] == (count == 3);\\n }\\n\\n public boolean check10 ()\\n {\\n return S[10] == (S[11] && S[12]);\\n }\\n\\n public boolean check11 ()\\n {\\n int count = 0;\\n for (int k = 7; k <= 9; k++)\\n if (S[k]) count++;\\n return S[11] == (count == 1);\\n }\\n\\n public boolean check12 ()\\n {\\n int count = 0;\\n for (int k = 1; k <= 11; k++)\\n if (S[k]) count++;\\n return S[12] == (count == 4);\\n }\\n\\n public void check ()\\n {\\n if (check2() && check3() && check4() && check5() && check6()\\n && check7() && check8() && check9() && check10() && check11()\\n && check12())\\n {\\n for (int k = 1; k <= 12; k++)\\n if (S[k]) System.out.print(k + \\\" \\\");\\n System.out.println();\\n Count++;\\n }\\n }\\n\\n public void recurseAll (int k)\\n {\\n if (k == 13)\\n check();\\n else\\n {\\n S[k] = false;\\n recurseAll(k + 1);\\n S[k] = true;\\n recurseAll(k + 1);\\n }\\n }\\n\\n public static void main (String args[])\\n {\\n LogicPuzzle P = new LogicPuzzle();\\n P.S[1] = true;\\n P.recurseAll(2);\\n System.out.println();\\n System.out.println(P.Count + \\\" Solutions found.\\\");\\n }\\n}\\n\",\n \"language\": \"Java\"\n },\n {\n \"code\": \"def indexed(filter):\\n . as $in\\n | reduce range(0;length) as $i ([]; if ($i | filter) then . + [$in[$i]] else . end);\\n\\ndef count(value): map(select(. == value)) | length;\\n\\n# The truth or falsity of the 12 statements can be captured in an array of size 12:\\ndef generate(k):\\n if k == 1 then [true], [false]\\n else generate(1) + generate(k-1)\\n end;\\n\\n# Input: a boolean array\\ndef evaluate:\\n [ (length == 12), #1\\n ((.[6:] | count(true)) == 3), #2\\n ((indexed(. % 2 == 1) | count(true)) == 2), #3\\n (if .[4] then .[5] and .[6] else true end), #4\\n ((.[1:4] | count(false)) == 3), #5\\n ((indexed(. % 2 == 0) | count(true)) == 4), #6\\n (([.[1], .[2]] | count(true)) == 1), #7\\n (if .[6] then .[4] and .[5] else true end), #8\\n ((.[0:6] | count(true)) == 3), #9\\n (.[10] and .[11]), #10\\n ((.[6:9] | count(true)) == 1), #11\\n ((.[0:11] | count(true)) == 4) #12\\n ];\\n\\n# The following query generates the solution to the problem:\\n# generate(12) | . as $vector | if evaluate == $vector then $vector else empty end\\n\\n# Running \\\"task\\\" as defined next would generate\\n# both the general solution as well as the off-by-one solutions:\\n\\ndef task:\\n\\n # count agreements\\n def agreed(x;y): reduce range(0;x|length) as $i (0; if x[$i] == y[$i] then .+1 else . end);\\n\\n reduce generate(12) as $vector\\n ([]; ($vector | evaluate) as $e\\n | agreed($vector; $e) as $agreed\\n | if $agreed == 12 then [[12,$vector]] + .\\n elif $agreed == 11 then . + [[11, $vector]]\\n else .\\n end);\\n\\n# Since the solutions have been given elsewhere, we simply count the\\n# number of exact and off-by-one solutions:\\n\\ntask | length\\n\",\n \"language\": \"Jq\"\n },\n {\n \"code\": \"using Printf\\n\\nfunction showflaggedbits{T<:BitArray{1}}(a::T, f::T)\\n tf = map(x->x ? \\\"T\\\" : \\\"F\\\", a)\\n flg = map(x->x ? \\\"*\\\" : \\\" \\\", f)\\n join(tf .* flg, \\\" \\\")\\nend\\n\\nconst props = [s -> length(s) == 12,\\n s -> sum(s[7:12]) == 3,\\n s -> sum(s[2:2:end]) == 2,\\n s -> !s[5] || (s[6] & s[7]),\\n s -> !any(s[2:4]),\\n s -> sum(s[1:2:end]) == 4,\\n s -> s[2] $ s[3],\\n s -> !s[7] || (s[5] & s[6]),\\n s -> sum(s[1:6]) == 3,\\n s -> s[11] & s[12],\\n s -> sum(s[7:9]) == 1,\\n s -> sum(s[1:end-1]) == 4]\\n\\nconst NDIG = length(props)\\nNDIG < WORD_SIZE || println(\\\"WARNING, too many propositions!\\\")\\n\\nmhist = zeros(Int, NDIG+1)\\n\\nprintln(\\\"Checking the \\\", NDIG, \\\" statements against all possibilities.\\\\n\\\")\\nprint(\\\" \\\"^15)\\nfor i in 1:NDIG\\n print(@sprintf \\\"%3d\\\" i)\\nend\\nprintln()\\n\\nfor i in 0:(2^NDIG-1)\\n s = bitpack(digits(i, 2, NDIG))\\n t = bitpack([p(s) for p in props])\\n misses = s$t\\n mcnt = sum(misses)\\n mhist[NDIG-mcnt+1] += 1\\n mcnt < 2 || mcnt == NDIG || continue\\n if mcnt == 0\\n print(\\\" Exact Match: \\\")\\n elseif mcnt == NDIG\\n print(\\\" Total Miss: \\\")\\n else\\n print(\\\" Near Miss: \\\")\\n end\\n println(showflaggedbits(t, misses))\\nend\\n\\nprintln()\\nprintln(\\\"Distribution of matches\\\")\\nprintln(\\\" Matches Cases\\\")\\nfor i in (NDIG+1):-1:1\\n println(@sprintf \\\" %2d => %4d\\\" i-1 mhist[i])\\nend\\n\",\n \"language\": \"Julia\"\n },\n {\n \"code\": \"// version 1.1.3\\n\\ntypealias Predicate = (String) -> Boolean\\n\\nval predicates = listOf<Predicate>(\\n { it.length == 13 }, // indexing starts at 0 but first bit ignored\\n { (7..12).count { i -> it[i] == '1' } == 3 },\\n { (2..12 step 2).count { i -> it[i] == '1' } == 2 },\\n { it[5] == '0' || (it[6] == '1' && it[7] == '1') },\\n { it[2] == '0' && it[3] == '0' && it[4] == '0' },\\n { (1..11 step 2).count { i -> it[i] == '1' } == 4 },\\n { (it[2] == '1') xor (it[3] == '1') },\\n { it[7] == '0' || (it[5] == '1' && it[6] == '1') },\\n { (1..6).count { i -> it[i] == '1' } == 3 },\\n { it[11] == '1' && it[12] == '1' },\\n { (7..9).count { i -> it[i] == '1' } == 1 },\\n { (1..11).count { i -> it[i] == '1' } == 4 }\\n)\\n\\nfun show(s: String, indent: Boolean) {\\n if (indent) print(\\\" \\\")\\n for (i in s.indices) if (s[i] == '1') print(\\\"$i \\\")\\n println()\\n}\\n\\nfun main(args: Array<String>) {\\n println(\\\"Exact hits:\\\")\\n for (i in 0..4095) {\\n val s = i.toString(2).padStart(13, '0')\\n var j = 1\\n if (predicates.all { it(s) == (s[j++] == '1') }) show(s, true)\\n }\\n\\n println(\\\"\\\\nNear misses:\\\")\\n for (i in 0..4095) {\\n val s = i.toString(2).padStart(13, '0')\\n var j = 1\\n if (predicates.count { it(s) == (s[j++] == '1') } == 11) {\\n var k = 1\\n val iof = predicates.indexOfFirst { it(s) != (s[k++] == '1') } + 1\\n print(\\\" (Fails at statement ${\\\"%2d\\\".format(iof)}) \\\")\\n show(s, false)\\n }\\n }\\n}\\n\",\n \"language\": \"Kotlin\"\n },\n {\n \"code\": \"Print[\\\"Answer:\\\\n\\\", Column@Cases[#, {s_, 0} :> s], \\\"\\\\nNear misses:\\\\n\\\",\\n Column@Cases[#, {s_, 1} :> s]] &[{#,\\n Count[Boole /@ {Length@# == 12, Total@#[[7 ;;]] == 3,\\n Total@#[[2 ;; 12 ;; 2]] == 2, #[[5]] (#[[6]] + #[[7]] - 2) ==\\n 0, Total@#[[2 ;; 4]] == 0,\\n Total@#[[1 ;; 11 ;; 2]] == 4, #[[2]] + #[[3]] ==\\n 1, #[[7]] (#[[5]] + #[[6]] - 2) == 0,\\n Total@#[[;; 6]] == 3, #[[11]] + #[[12]] == 2,\\n Total@#[[7 ;; 9]] == 1, Total@#[[;; 11]] == 4} - #,\\n Except[0]]} & /@ Tuples[{1, 0}, 12]]\\n\",\n \"language\": \"Mathematica\"\n },\n {\n \"code\": \"import bitops, sequtils, strformat, strutils, sugar\\n\\ntype Bools = array[1..12, bool]\\n\\nconst Predicates = [1: (b: Bools) => b.len == 12,\\n 2: (b: Bools) => b[7..12].count(true) == 3,\\n 3: (b: Bools) => toSeq(countup(2, 12, 2)).mapIt(b[it]).count(true) == 2,\\n 4: (b: Bools) => not b[5] or b[6] and b[7],\\n 5: (b: Bools) => not b[2] and not b[3] and not b[4],\\n 6: (b: Bools) => toSeq(countup(1, 12, 2)).mapIt(b[it]).count(true) == 4,\\n 7: (b: Bools) => b[2] xor b[3],\\n 8: (b: Bools) => not b[7] or b[5] and b[6],\\n 9: (b: Bools) => b[1..6].count(true) == 3,\\n 10: (b: Bools) => b[11] and b[12],\\n 11: (b: Bools) => b[7..9].count(true) == 1,\\n 12: (b: Bools) => b[1..11].count(true) == 4]\\n\\n\\nproc `$`(b: Bools): string =\\n toSeq(1..12).filterIt(b[it]).join(\\\" \\\")\\n\\n\\necho \\\"Exacts hits:\\\"\\nvar bools: Bools\\nfor n in 0..4095:\\n block check:\\n for i in 1..12: bools[i] = n.testBit(12 - i)\\n for i, predicate in Predicates:\\n if predicate(bools) != bools[i]:\\n break check\\n echo \\\" \\\", bools\\n\\necho \\\"\\\\nNear misses:\\\"\\nfor n in 0..4095:\\n for i in 1..12: bools[i] = n.testBit(12 - i)\\n var count = 0\\n for i, predicate in Predicates:\\n if predicate(bools) == bools[i]: inc count\\n if count == 11:\\n for i, predicate in Predicates:\\n if predicate(bools) != bools[i]:\\n echo &\\\" (Fails at statement {i:2}) {bools}\\\"\\n break\\n\",\n \"language\": \"Nim\"\n },\n {\n \"code\": \"PROGRAM TwelveStatements;\\n\\n{\\n This program searches through the 4095 possible sets\\n of 12 statements for any which may be self-consistent.\\n}\\n\\nCONST\\n max12b = 4095; { Largest 12 byte number. }\\n\\nTYPE\\n statnum = 1..12; { statement numbers }\\n statset = set of statnum; { sets of statements }\\n\\nVAR { global variables for use in main algorithm }\\n trialNumber: integer;\\n trialSet, testResults: statset;\\n\\nfunction Convert(n: integer): statset;\\n{\\n Converts an integer into a set of statements.\\n For each \\\"1\\\" in the last 12 bits of\\n the integer's binary representation,\\n a statement number is put into the set.\\n}\\nvar\\n i: statnum;\\n s: statset;\\nbegin\\n s := []; { Empty set. }\\n for i := 12 downto 1 do begin\\n if (n mod 2) = 1 then s := s + [i];\\n n := n div 2\\n end;\\n Convert := s\\nend;\\n\\nprocedure Express(truths: statset);\\n{\\n Writes the statement number of each \\\"truth\\\",\\n with at least one space in front,\\n all on one line.\\n}\\nvar n: statnum;\\nbegin\\n for n := 1 to 12 do\\n if n in truths then write(n:3);\\n writeln\\nend;\\n\\nfunction Count(truths: statset): integer;\\n{ Counts the statement numbers in the set. }\\nvar\\n s: statnum;\\n i: integer;\\nbegin\\n i := 0;\\n for s := 1 to 12 do if s in truths then i := i + 1;\\n Count := i\\nend;\\n\\nfunction Test(truths: statset): statset;\\n{\\n Starts with a set of supposedly true statements\\n and checks which of the 12 statements can actually\\n be confirmed about the set itself.\\n}\\nvar\\n evens, odds, confirmations: statset;\\nbegin\\n evens := [2, 4, 6, 8, 10, 12];\\n odds := [1, 3, 5, 7, 9, 11];\\n\\n { Statement 1 is necessarily true. }\\n confirmations := [1];\\n\\n { Statement 2 }\\n if Count(truths * [7..12]) = 3\\n then confirmations := confirmations + [2];\\n\\n { Statement 3 }\\n if Count(truths * evens) = 2\\n then confirmations := confirmations + [3];\\n\\n { Statement 4 is true if 6 and 7 are true, or if 5 is false. }\\n if ([6, 7] <= truths) or not (5 in truths)\\n then confirmations := confirmations + [4];\\n\\n { Statement 5 }\\n if [2, 3, 4] <= truths\\n then confirmations := confirmations + [5];\\n\\n { Statement 6 }\\n if Count(truths * odds) = 4\\n then confirmations := confirmations + [6];\\n\\n { Statement 7 }\\n if (2 in truths) xor (3 in truths)\\n then confirmations := confirmations + [7];\\n\\n { Statement 8 is true if 5 and 6 are true, or if 7 is false. }\\n if ([5, 6] <= truths) or not (7 in truths)\\n then confirmations := confirmations + [8];\\n\\n { Statement 9 }\\n if Count(truths * [1..6]) = 3\\n then confirmations := confirmations + [9];\\n\\n { Statement 10 }\\n if [11, 12] <= truths\\n then confirmations := confirmations + [10];\\n\\n { Statement 11 }\\n if Count(truths * [7, 8, 9]) = 1\\n then confirmations := confirmations + [11];\\n\\n { Statement 12 }\\n if Count(truths - [12]) = 4\\n then confirmations := confirmations + [12];\\n\\n Test := confirmations\\nend;\\n\\nBEGIN { Main algorithm. }\\n for trialNumber := 1 to max12b do begin\\n trialSet := Convert(trialNumber);\\n testResults := Test(trialSet);\\n if testResults = trialSet then Express(trialSet)\\n end;\\n writeln('Done. Press ENTER.');\\n readln\\nEND.\\n\",\n \"language\": \"Pascal\"\n },\n {\n \"code\": \"use List::Util 'sum';\\n\\nmy @condition = (\\n sub { 0 }, # dummy sub for index 0\\n sub { 13==@_ },\\n sub { 3==sum @_[7..12] },\\n sub { 2==sum @_[2,4,6,8,10,12] },\\n sub { $_[5] ? ($_[6] and $_[7]) : 1 },\\n sub { !$_[2] and !$_[3] and !$_[4] },\\n sub { 4==sum @_[1,3,5,7,9,11] },\\n sub { $_[2]==1-$_[3] },\\n sub { $_[7] ? ($_[5] and $_[6]) : 1 },\\n sub { 3==sum @_[1..6] },\\n sub { 2==sum @_[11..12] },\\n sub { 1==sum @_[7,8,9] },\\n sub { 4==sum @_[1..11] },\\n );\\n\\nsub miss {\\n return grep { $condition[$_]->(@_) != $_[$_] } 1..12;\\n}\\n\\nfor (0..2**12-1) {\\n my @truth = split //, sprintf \\\"0%012b\\\", $_;\\n my @no = miss @truth;\\n print \\\"Solution: true statements are \\\", join( \\\" \\\", grep { $truth[$_] } 1..12), \\\"\\\\n\\\" if 0 == @no;\\n print \\\"1 miss (\\\",$no[0],\\\"): true statements are \\\", join( \\\" \\\", grep { $truth[$_] } 1..12), \\\"\\\\n\\\" if 1 == @no;\\n}\\n\",\n \"language\": \"Perl\"\n },\n {\n \"code\": \"(phixonline)-->\\n <span style=\\\"color: #008080;\\\">function</span> <span style=\\\"color: #000000;\\\">s1</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: #008080;\\\">return</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;\\\">12</span> <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">function</span>\\n <span style=\\\"color: #008080;\\\">function</span> <span style=\\\"color: #000000;\\\">s2</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: #008080;\\\">return</span> <span style=\\\"color: #7060A8;\\\">sum</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #7060A8;\\\">sq_eq</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">s</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">7</span><span style=\\\"color: #0000FF;\\\">..</span><span style=\\\"color: #000000;\\\">12</span><span style=\\\"color: #0000FF;\\\">],</span><span style=\\\"color: #008000;\\\">'1'</span><span style=\\\"color: #0000FF;\\\">))=</span><span style=\\\"color: #000000;\\\">3</span> <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">function</span>\\n <span style=\\\"color: #008080;\\\">function</span> <span style=\\\"color: #000000;\\\">s3</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: #008080;\\\">return</span> <span style=\\\"color: #7060A8;\\\">sum</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #7060A8;\\\">sq_eq</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #7060A8;\\\">extract</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">s</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #7060A8;\\\">tagset</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">12</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: #008000;\\\">'1'</span><span style=\\\"color: #0000FF;\\\">))=</span><span style=\\\"color: #000000;\\\">2</span> <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">function</span>\\n <span style=\\\"color: #008080;\\\">function</span> <span style=\\\"color: #000000;\\\">s4</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: #008080;\\\">return</span> <span style=\\\"color: #000000;\\\">s</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">5</span><span style=\\\"color: #0000FF;\\\">]=</span><span style=\\\"color: #008000;\\\">'0'</span> <span style=\\\"color: #008080;\\\">or</span> <span style=\\\"color: #000000;\\\">s</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: #008000;\\\">\\\"11\\\"</span> <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">function</span>\\n <span style=\\\"color: #008080;\\\">function</span> <span style=\\\"color: #000000;\\\">s5</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: #008080;\\\">return</span> <span style=\\\"color: #000000;\\\">s</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: #008000;\\\">\\\"000\\\"</span> <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">function</span>\\n <span style=\\\"color: #008080;\\\">function</span> <span style=\\\"color: #000000;\\\">s6</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: #008080;\\\">return</span> <span style=\\\"color: #7060A8;\\\">sum</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #7060A8;\\\">sq_eq</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #7060A8;\\\">extract</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">s</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #7060A8;\\\">tagset</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">12</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: #008000;\\\">'1'</span><span style=\\\"color: #0000FF;\\\">))=</span><span style=\\\"color: #000000;\\\">4</span> <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">function</span>\\n <span style=\\\"color: #008080;\\\">function</span> <span style=\\\"color: #000000;\\\">s7</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: #008080;\\\">return</span> <span style=\\\"color: #000000;\\\">s</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">2</span><span style=\\\"color: #0000FF;\\\">]!=</span><span style=\\\"color: #000000;\\\">s</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">3</span><span style=\\\"color: #0000FF;\\\">]</span> <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">function</span>\\n <span style=\\\"color: #008080;\\\">function</span> <span style=\\\"color: #000000;\\\">s8</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: #008080;\\\">return</span> <span style=\\\"color: #000000;\\\">s</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">7</span><span style=\\\"color: #0000FF;\\\">]=</span><span style=\\\"color: #008000;\\\">'0'</span> <span style=\\\"color: #008080;\\\">or</span> <span style=\\\"color: #000000;\\\">s</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">5</span><span style=\\\"color: #0000FF;\\\">..</span><span style=\\\"color: #000000;\\\">6</span><span style=\\\"color: #0000FF;\\\">]=</span><span style=\\\"color: #008000;\\\">\\\"11\\\"</span> <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">function</span>\\n <span style=\\\"color: #008080;\\\">function</span> <span style=\\\"color: #000000;\\\">s9</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: #008080;\\\">return</span> <span style=\\\"color: #7060A8;\\\">sum</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #7060A8;\\\">sq_eq</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;\\\">6</span><span style=\\\"color: #0000FF;\\\">],</span><span style=\\\"color: #008000;\\\">'1'</span><span style=\\\"color: #0000FF;\\\">))=</span><span style=\\\"color: #000000;\\\">3</span> <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">function</span>\\n <span style=\\\"color: #008080;\\\">function</span> <span style=\\\"color: #000000;\\\">s10</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: #008080;\\\">return</span> <span style=\\\"color: #000000;\\\">s</span><span style=\\\"color: #0000FF;\\\">[</span><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: #008000;\\\">\\\"11\\\"</span> <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">function</span>\\n <span style=\\\"color: #008080;\\\">function</span> <span style=\\\"color: #000000;\\\">s11</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: #008080;\\\">return</span> <span style=\\\"color: #7060A8;\\\">sum</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #7060A8;\\\">sq_eq</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">s</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: #008000;\\\">'1'</span><span style=\\\"color: #0000FF;\\\">))=</span><span style=\\\"color: #000000;\\\">1</span> <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">function</span>\\n <span style=\\\"color: #008080;\\\">function</span> <span style=\\\"color: #000000;\\\">s12</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: #008080;\\\">return</span> <span style=\\\"color: #7060A8;\\\">sum</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #7060A8;\\\">sq_eq</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;\\\">11</span><span style=\\\"color: #0000FF;\\\">],</span><span style=\\\"color: #008000;\\\">'1'</span><span style=\\\"color: #0000FF;\\\">))=</span><span style=\\\"color: #000000;\\\">4</span> <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">function</span>\\n\\n <span style=\\\"color: #004080;\\\">sequence</span> <span style=\\\"color: #000000;\\\">rtn</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #0000FF;\\\">{</span><span style=\\\"color: #000000;\\\">s1</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">s2</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">s3</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">s4</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">s5</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">s6</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">s7</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">s8</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">s9</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">s10</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">s11</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">s12</span><span style=\\\"color: #0000FF;\\\">}</span>\\n <span style=\\\"color: #004080;\\\">string</span> <span style=\\\"color: #000000;\\\">misses</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #008000;\\\">\\\"\\\\n\\\"</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: #7060A8;\\\">power</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">2</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">12</span><span style=\\\"color: #0000FF;\\\">)-</span><span style=\\\"color: #000000;\\\">1</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: #7060A8;\\\">sprintf</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #008000;\\\">\\\"%012b\\\"</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;\\\">res</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">find_all</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #008000;\\\">'1'</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">s</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;\\\">0</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">pass</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">fail</span>\\n <span style=\\\"color: #008080;\\\">for</span> <span style=\\\"color: #000000;\\\">b</span><span style=\\\"color: #0000FF;\\\">=</span><span style=\\\"color: #000000;\\\">1</span> <span style=\\\"color: #008080;\\\">to</span> <span style=\\\"color: #000000;\\\">12</span> <span style=\\\"color: #008080;\\\">do</span>\\n <span style=\\\"color: #000000;\\\">pass</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">call_func</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">rtn</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">b</span><span style=\\\"color: #0000FF;\\\">],{</span><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;\\\">b</span><span style=\\\"color: #0000FF;\\\">]=</span><span style=\\\"color: #008000;\\\">'1'</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #008080;\\\">if</span> <span style=\\\"color: #008080;\\\">not</span> <span style=\\\"color: #000000;\\\">pass</span> <span style=\\\"color: #008080;\\\">then</span> <span style=\\\"color: #000000;\\\">fail</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">b</span> <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">if</span>\\n <span style=\\\"color: #000000;\\\">t</span> <span style=\\\"color: #0000FF;\\\">+=</span> <span style=\\\"color: #000000;\\\">pass</span>\\n <span style=\\\"color: #008080;\\\">if</span> <span style=\\\"color: #000000;\\\">b</span><span style=\\\"color: #0000FF;\\\">=</span><span style=\\\"color: #000000;\\\">12</span> <span style=\\\"color: #008080;\\\">and</span> <span style=\\\"color: #000000;\\\">t</span><span style=\\\"color: #0000FF;\\\">=</span><span style=\\\"color: #000000;\\\">12</span> <span style=\\\"color: #008080;\\\">then</span> <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;\\\">\\\"Solution: %v\\\\n\\\"</span><span style=\\\"color: #0000FF;\\\">,{</span><span style=\\\"color: #000000;\\\">res</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;\\\">for</span>\\n <span style=\\\"color: #008080;\\\">if</span> <span style=\\\"color: #000000;\\\">t</span><span style=\\\"color: #0000FF;\\\">=</span><span style=\\\"color: #000000;\\\">11</span> <span style=\\\"color: #008080;\\\">then</span>\\n <span style=\\\"color: #000000;\\\">misses</span> <span style=\\\"color: #0000FF;\\\">&=</span> <span style=\\\"color: #7060A8;\\\">sprintf</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #008000;\\\">\\\"Near miss: %v, fail on %d\\\\n\\\"</span><span style=\\\"color: #0000FF;\\\">,{</span><span style=\\\"color: #000000;\\\">res</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">fail</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: #7060A8;\\\">puts</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">misses</span><span style=\\\"color: #0000FF;\\\">)</span>\\n<!--\\n\",\n \"language\": \"Phix\"\n },\n {\n \"code\": \"% {{trans|Prolog}}\\ngo ?=>\\n puzzle,\\n fail, % check for more answers\\n nl.\\ngo => true.\\n\\npuzzle =>\\n % 1. This is a numbered list of twelve statements.\\n\\tL = [A1, A2, A3, A4, A5, A6, A7, A8, A9, A10, A11, A12],\\n\\tL :: 0..1,\\n\\telement(1, L, 1),\\n\\n % 2. Exactly 3 of the last 6 statements are true.\\n\\tA2 #<=> sum(L[7..12]) #= 3,\\n\\n % 3. Exactly 2 of the even-numbered statements are true.\\n\\tA3 #<=> sum([L[I]:I in 1..12,I mod 2 == 0]) #= 2,\\n\\n % 4. If statement 5 is true, then statements 6 and 7 are both true.\\n\\tA4 #<=> (A5 #=> (A6 #/\\\\ A7)),\\n\\n % 5. The 3 preceding statements are all false.\\n\\tA5 #<=> sum(L[2..4]) #= 0,\\n\\n % 6. Exactly 4 of the odd-numbered statements are true.\\n\\tA6 #<=> sum([L[I]:I in 1..12,I mod 2 == 1]) #= 4,\\n\\n % 7. Either statement 2 or 3 is true, but not both.\\n\\tA7 #<=> (A2 + A3 #= 1),\\n\\n % 8. If statement 7 is true, then 5 and 6 are both true.\\n\\tA8 #<=> (A7 #=> A5 #/\\\\ A6),\\n\\n % 9. Exactly 3 of the first 6 statements are true.\\n\\tA9 #<=> sum(L[1..6]) #= 3,\\n\\n % 10. The next two statements are both true.\\n\\tA10 #<=> (A11 #/\\\\ A12),\\n\\n % 11. Exactly 1 of statements 7, 8 and 9 are true.\\n\\tA11 #<=> (A7 + A8 + A9 #= 1),\\n\\n % 12. Exactly 4 of the preceding statements are true.\\n A12 #<=> sum(L[1..11]) #= 4,\\n\\n\\tsolve(L),\\n\\n println('L'=L),\\n\\tprintf(\\\"Statements %w are true.\\\\n\\\", [I.to_string : I in 1..12, L[I] == 1].join(\\\" \\\")),\\n\\tnl.\\n\",\n \"language\": \"Picat\"\n },\n {\n \"code\": \"puzzle :-\\n % 1. This is a numbered list of twelve statements.\\n\\tL = [A1, A2, A3, A4, A5, A6, A7, A8, A9, A10, A11, A12],\\n\\tL ins 0..1,\\n\\telement(1, L, 1),\\n\\n % 2. Exactly 3 of the last 6 statements are true.\\n\\tA2 #<==> A7 + A8 + A9 + A10 + A11 + A12 #= 3,\\n\\n % 3. Exactly 2 of the even-numbered statements are true.\\n\\tA3 #<==> A2 + A4 + A6 + A8 + A10 + A12 #= 2,\\n\\n % 4. If statement 5 is true, then statements 6 and 7 are both true.\\n\\tA4 #<==> (A5 #==> (A6 #/\\\\ A7)),\\n\\n % 5. The 3 preceding statements are all false.\\n\\tA5 #<==> A2 + A3 + A4 #= 0,\\n\\n % 6. Exactly 4 of the odd-numbered statements are true.\\n\\tA6 #==> A1 + A3 + A5 + A7 + A9 + A11 #= 4,\\n\\n % 7. Either statement 2 or 3 is true, but not both.\\n\\tA7 #<==> A2 + A3 #= 1,\\n\\n % 8. If statement 7 is true, then 5 and 6 are both true.\\n\\tA8 #<==> (A7 #==> A5 #/\\\\ A6),\\n\\n\\n % 9. Exactly 3 of the first 6 statements are true.\\n\\tA9 #<==> A1 + A2 + A3 + A4 + A5 + A6 #= 3,\\n\\n % 10. The next two statements are both true.\\n\\tA10 #<==> A11 #/\\\\ A12,\\n\\n % 11. Exactly 1 of statements 7, 8 and 9 are true.\\n\\tA11 #<==> A7 + A8 + A9 #= 1,\\n\\n % 12. Exactly 4 of the preceding statements are true.\\n\\tA12 #<==> A1 + A2 + A3 + A4 + A5 + A6 + A7 +A8 + A9 + A10 + A11 #= 4,\\n\\n\\tlabel(L),\\n numlist(1, 12, NL),\\n\\twrite('Statements '),\\n\\tmaplist(my_write, NL, L),\\n\\twriteln('are true').\\n\\n\\nmy_write(N, 1) :-\\n\\tformat('~w ', [N]).\\n\\nmy_write(_N, 0).\\n\",\n \"language\": \"Prolog\"\n },\n {\n \"code\": \"from itertools import product\\n#from pprint import pprint as pp\\n\\nconstraintinfo = (\\n (lambda st: len(st) == 12 ,(1, 'This is a numbered list of twelve statements')),\\n (lambda st: sum(st[-6:]) == 3 ,(2, 'Exactly 3 of the last 6 statements are true')),\\n (lambda st: sum(st[1::2]) == 2 ,(3, 'Exactly 2 of the even-numbered statements are true')),\\n (lambda st: (st[5]&st[6]) if st[4] else 1 ,(4, 'If statement 5 is true, then statements 6 and 7 are both true')),\\n (lambda st: sum(st[1:4]) == 0 ,(5, 'The 3 preceding statements are all false')),\\n (lambda st: sum(st[0::2]) == 4 ,(6, 'Exactly 4 of the odd-numbered statements are true')),\\n (lambda st: sum(st[1:3]) == 1 ,(7, 'Either statement 2 or 3 is true, but not both')),\\n (lambda st: (st[4]&st[5]) if st[6] else 1 ,(8, 'If statement 7 is true, then 5 and 6 are both true')),\\n (lambda st: sum(st[:6]) == 3 ,(9, 'Exactly 3 of the first 6 statements are true')),\\n (lambda st: (st[10]&st[11]) ,(10, 'The next two statements are both true')),\\n (lambda st: sum(st[6:9]) == 1 ,(11, 'Exactly 1 of statements 7, 8 and 9 are true')),\\n (lambda st: sum(st[0:11]) == 4 ,(12, 'Exactly 4 of the preceding statements are true')),\\n)\\n\\ndef printer(st, matches):\\n if False in matches:\\n print('Missed by one statement: %i, %s' % docs[matches.index(False)])\\n else:\\n print('Full match:')\\n print(' ' + ', '.join('%i:%s' % (i, 'T' if t else 'F') for i, t in enumerate(st, 1)))\\n\\nfuncs, docs = zip(*constraintinfo)\\n\\nfull, partial = [], []\\n\\nfor st in product( *([(False, True)] * 12) ):\\n truths = [bool(func(st)) for func in funcs]\\n matches = [s == t for s,t in zip(st, truths)]\\n mcount = sum(matches)\\n if mcount == 12:\\n full.append((st, matches))\\n elif mcount == 11:\\n partial.append((st, matches))\\n\\nfor stm in full + partial:\\n printer(*stm)\\n\",\n \"language\": \"Python\"\n },\n {\n \"code\": \"#lang racket\\n\\n;; A quick `amb' implementation\\n(define failures null)\\n(define (fail)\\n (if (pair? failures) ((first failures)) (error \\\"no more choices!\\\")))\\n(define (amb/thunks choices)\\n (let/cc k (set! failures (cons k failures)))\\n (if (pair? choices)\\n (let ([choice (first choices)]) (set! choices (rest choices)) (choice))\\n (begin (set! failures (rest failures)) (fail))))\\n(define-syntax-rule (amb E ...) (amb/thunks (list (lambda () E) ...)))\\n(define (assert condition) (unless condition (fail)))\\n\\n;; just to make things more fun\\n(define (⇔ x y) (assert (eq? x y)))\\n(require (only-in racket [and ∧] [or ∨] [implies ⇒] [xor ⊻] [not ¬]))\\n(define (count xs)\\n (let loop ([n 0] [xs xs])\\n (if (null? xs) n (loop (if (car xs) (add1 n) n) (cdr xs)))))\\n;; even more fun, make []s infix\\n(require (only-in racket [#%app r:app]))\\n(define-syntax (#%app stx)\\n (if (not (eq? #\\\\[ (syntax-property stx 'paren-shape)))\\n (syntax-case stx () [(_ x ...) #'(r:app x ...)])\\n (syntax-case stx ()\\n ;; extreme hack on next two cases, so it works for macros too.\\n [(_ x op y) (syntax-property #'(op x y) 'paren-shape #f)]\\n [(_ x op y op1 z) (free-identifier=? #'op #'op1)\\n (syntax-property #'(op x y z) 'paren-shape #f)])))\\n;; might as well do more\\n(define-syntax-rule (define-booleans all x ...)\\n (begin (define x (amb #t #f)) ...\\n (define all (list x ...))))\\n\\n(define (puzzle)\\n (define-booleans all q1 q2 q3 q4 q5 q6 q7 q8 q9 q10 q11 q12)\\n ;; 1. This is a numbered list of twelve statements.\\n [q1 ⇔ [12 = (length all)]]\\n ;; 2. Exactly 3 of the last 6 statements are true.\\n [q2 ⇔ [3 = (count (take-right all 6))]]\\n ;; 3. Exactly 2 of the even-numbered statements are true.\\n [q3 ⇔ [2 = (count (list q2 q4 q6 q8 q10 q12))]]\\n ;; 4. If statement 5 is true, then statements 6 and 7 are both true.\\n [q4 ⇔ [q5 ⇒ [q6 ∧ q7]]]\\n ;; 5. The 3 preceding statements are all false.\\n [q5 ⇔ (¬ [q2 ∨ q3 ∨ q4])]\\n ;; 6. Exactly 4 of the odd-numbered statements are true.\\n [q6 ⇔ [4 = (count (list q1 q3 q5 q7 q9 q11))]]\\n ;; 7. Either statement 2 or 3 is true, but not both.\\n [q7 ⇔ [q2 ⊻ q3]]\\n ;; 8. If statement 7 is true, then 5 and 6 are both true.\\n [q8 ⇔ [q7 ⇒ (and q5 q6)]]\\n ;; 9. Exactly 3 of the first 6 statements are true.\\n [q9 ⇔ [3 = (count (take all 3))]]\\n ;; 10. The next two statements are both true.\\n [q10 ⇔ [q11 ∧ q12]]\\n ;; 11. Exactly 1 of statements 7, 8 and 9 are true.\\n [q11 ⇔ [1 = (count (list q7 q8 q9))]]\\n ;; 12. Exactly 4 of the preceding statements are true.\\n [q12 ⇔ [4 = (count (drop-right all 1))]]\\n ;; done\\n (for/list ([i (in-naturals 1)] [q all] #:when q) i))\\n\\n(puzzle)\\n;; -> '(1 3 4 6 7 11)\\n\",\n \"language\": \"Racket\"\n },\n {\n \"code\": \"sub infix:<→> ($protasis, $apodosis) { !$protasis or $apodosis }\\n\\nmy @tests =\\n { .end == 12 and all(.[1..12]) === any(True, False) },\\n { 3 == [+] .[7..12] },\\n { 2 == [+] .[2,4...12] },\\n { .[5] → all .[6,7] },\\n { none .[2,3,4] },\\n { 4 == [+] .[1,3...11] },\\n { one .[2,3] },\\n { .[7] → all .[5,6] },\\n { 3 == [+] .[1..6] },\\n { all .[11,12] },\\n { one .[7,8,9] },\\n { 4 == [+] .[1..11] },\\n;\\n\\nmy @solutions;\\nmy @misses;\\n\\nfor [X] (True, False) xx 12 {\\n my @assert = Nil, |$_;\\n my @result = Nil, |@tests.map({ ?.(@assert) });\\n my @true = @assert.grep(?*, :k);\\n my @cons = (@assert Z=== @result).grep(!*, :k);\\n given @cons {\\n when 0 { push @solutions, \\\"<{@true}> is consistent.\\\"; }\\n when 1 { push @misses, \\\"<{@true}> implies { \\\"¬\\\" if !@result[~$_] }$_.\\\" }\\n }\\n}\\n\\n.say for @solutions;\\nsay \\\"\\\";\\nsay \\\"Near misses:\\\";\\n.say for @misses;\\n\",\n \"language\": \"Raku\"\n },\n {\n \"code\": \"/*REXX program solves the \\\"Twelve Statement Puzzle\\\". */\\nq=12; @stmt=right('statement',20) /*number of statements in the puzzle. */\\nm=0 /*[↓] statement one is TRUE by fiat.*/\\n do pass=1 for 2 /*find the maximum number of \\\"trues\\\". */\\n do e=0 for 2**(q-1); n = '1'right( x2b( d2x( e ) ), q-1, 0)\\n do b=1 for q /*define various bits in the number Q.*/\\n @.b=substr(n, b, 1) /*define a particular @ bit (in Q).*/\\n end /*b*/\\n if @.1 then if yeses(1, 1) \\\\==1 then iterate\\n if @.2 then if yeses(7, 12) \\\\==3 then iterate\\n if @.3 then if yeses(2, 12,2) \\\\==2 then iterate\\n if @.4 then if yeses(5, 5) then if yeses(6, 7) \\\\==2 then iterate\\n if @.5 then if yeses(2, 4) \\\\==0 then iterate\\n if @.6 then if yeses(1, 12,2) \\\\==4 then iterate\\n if @.7 then if yeses(2, 3) \\\\==1 then iterate\\n if @.8 then if yeses(7, 7) then if yeses(5,6) \\\\==2 then iterate\\n if @.9 then if yeses(1, 6) \\\\==3 then iterate\\n if @.10 then if yeses(11,12) \\\\==2 then iterate\\n if @.11 then if yeses(7, 9) \\\\==1 then iterate\\n if @.12 then if yeses(1, 11) \\\\==4 then iterate\\n g=yeses(1, 12)\\n if pass==1 then do; m=max(m,g); iterate; end\\n else if g\\\\==m then iterate\\n do j=1 for q; z=substr(n, j, 1)\\n if z then say @stmt right(j, 2) \\\" is \\\" word('false true', 1 + z)\\n end /*tell*/\\n end /*e*/\\n end /*pass*/\\nexit /*stick a fork in it, we're all done. */\\n/*──────────────────────────────────────────────────────────────────────────────────────*/\\nyeses: parse arg L,H,B; #=0; do i=L to H by word(B 1, 1); #=#+@.i; end; return #\\n\",\n \"language\": \"REXX\"\n },\n {\n \"code\": \"/*REXX program solves the \\\"Twelve Statement Puzzle\\\". */\\nq=12; @stmt=right('statement',20) /*number of statements in the puzzle. */\\nm=0 /*[↓] statement one is TRUE by fiat.*/\\n do pass=1 for 2 /*find the maximum number of \\\"trues\\\". */\\n do e=0 for 2**(q-1); n = '1'right( x2b( d2x( e ) ), q-1, 0)\\n do b=1 for q /*define various bits in the number Q.*/\\n @.b=substr(n, b, 1) /*define a particular @ bit (in Q).*/\\n end /*b*/\\n if @.1 then if \\\\ @.1 then iterate\\n if @.2 then if @.7+@.8+@.9+@.10+@.11+@.12 \\\\==3 then iterate\\n if @.3 then if @.2+@.4+@.6+@.8+@.10+@.12 \\\\==2 then iterate\\n if @.4 then if @.5 then if \\\\(@.6 & @.7) then iterate\\n if @.5 then if @.2 | @.3 | @.4 then iterate\\n if @.6 then if @.1+@.3+@.5+@.7+@.9+@.11 \\\\==4 then iterate\\n if @.7 then if \\\\ (@.2 && @.3 ) then iterate\\n if @.8 then if @.7 then if \\\\(@.5 & @.6) then iterate\\n if @.9 then if @.1+@.2+@.3+@.4+@.5+@.6 \\\\==3 then iterate\\n if @.10 then if \\\\ (@.11 & @.12) then iterate\\n if @.11 then if @.7+@.8+@.9 \\\\==1 then iterate\\n g=@.1 +@.2 +@.3 +@.4 +@.5 +@.6 +@.7 +@.8+ @.9 +@.10 +@.11\\n if @.12 then if g \\\\==4 then iterate\\n g=g + @.12\\n if pass==1 then do; m=max(m,g); iterate; end\\n else if g\\\\==m then iterate\\n do j=1 for q; z=substr(n, j, 1)\\n if z then say @stmt right(j, 2) \\\" is \\\" word('false true', 1+z)\\n end /*tell*/\\n end /*e*/\\n end /*pass*/ /*stick a fork in it, we're all done. */\\n\",\n \"language\": \"REXX\"\n },\n {\n \"code\": \"/*REXX program solves the \\\"Twelve Statement Puzzle\\\". */\\nq=12; @stmt=right('statement',20) /*number of statements in the puzzle. */\\nm=0 /*[↓] statement one is TRUE by fiat.*/\\n do pass=1 for 2 /*find the maximum number of \\\"trues\\\". */\\n do e=0 for 2**(q-1); n = '1'right( x2b( d2x( e ) ), q-1, 0)\\n parse var n @1 2 @2 3 @3 4 @4 5 @5 6 @6 7 @7 8 @8 9 @9 10 @10 11 @11 12 @12\\n/*▒▒▒▒ if @1 then if \\\\ @1 then iterate ▒▒▒▒*/\\n if @2 then if @7+@8+@9+@10+@11+@12 \\\\==3 then iterate\\n if @3 then if @2+@4+@6+@8+@10+@12 \\\\==2 then iterate\\n if @4 then if @5 then if \\\\(@6 & @7) then iterate\\n if @5 then if @2 | @3 | @4 then iterate\\n if @6 then if @1+@3+@5+@7+@9+@11 \\\\==4 then iterate\\n if @7 then if \\\\ (@2 && @3 ) then iterate\\n if @8 then if @7 then if \\\\(@5 & @6) then iterate\\n if @9 then if @1+@2+@3+@4+@5+@6 \\\\==3 then iterate\\n if @10 then if \\\\ (@11 & @12) then iterate\\n if @11 then if @7+@8+@9 \\\\==1 then iterate\\n g=@1 + @2 + @3 + @4 + @5 + @6 + @7 + @8 + @9 + @10 + @11\\n if @12 then if g \\\\==4 then iterate\\n g=g + @12\\n if pass==1 then do; m=max(m,g); iterate; end\\n else if g\\\\==m then iterate\\n do j=1 for q; z=substr(n, j, 1)\\n if z then say @stmt right(j, 2) \\\" is \\\" word('false true', 1+z)\\n end /*j*/\\n end /*e*/\\n end /*pass*/ /*stick a fork in it, we're all done. */\\n\",\n \"language\": \"REXX\"\n },\n {\n \"code\": \"constraints = [\\n ->(st) { st.size == 12 },\\n ->(st) { st.last(6).count(true) == 3 },\\n ->(st) { st.each_slice(2).map(&:last).count(true) == 2 },\\n ->(st) { st[4] ? (st[5] & st[6]) : true },\\n ->(st) { st[1..3].none? },\\n ->(st) { st.each_slice(2).map(&:first).count(true) == 4 },\\n ->(st) { st[1] ^ st[2] },\\n ->(st) { st[6] ? (st[4] & st[5]) : true },\\n ->(st) { st.first(6).count(true) == 3 },\\n ->(st) { st[10] & st[11] },\\n ->(st) { st[6..8].one? },\\n ->(st) { st[0,11].count(true) == 4 },\\n]\\n\\nResult = Struct.new(:truths, :consistency)\\n\\nresults = [true, false].repeated_permutation(12).map do |truths|\\n Result.new(truths, constraints.zip(truths).map {|cn,truth| cn[truths] == truth })\\nend\\n\\nputs \\\"solution:\\\",\\n results.find {|r| r.consistency.all? }.truths.to_s\\n\\nputs \\\"\\\\nnear misses: \\\"\\nnear_misses = results.select {|r| r.consistency.count(false) == 1 }\\nnear_misses.each do |r|\\n puts \\\"missed by statement #{r.consistency.index(false) + 1}\\\", r.truths.to_s\\nend\\n\",\n \"language\": \"Ruby\"\n },\n {\n \"code\": \"class LogicPuzzle {\\n val s = new Array[Boolean](13)\\n var count = 0\\n\\n def check2: Boolean = {\\n var count = 0\\n for (k <- 7 to 12) if (s(k)) count += 1\\n\\n s(2) == (count == 3)\\n }\\n\\n def check3: Boolean = {\\n var count = 0\\n for (k <- 2 to 12 by 2) if (s(k)) count += 1\\n\\n s(3) == (count == 2)\\n }\\n\\n def check4: Boolean = s(4) == (!s(5) || s(6) && s(7))\\n\\n def check5: Boolean = s(5) == (!s(2) && !s(3) && !s(4))\\n\\n def check6: Boolean = {\\n var count = 0\\n for (k <- 1 to 11 by 2) if (s(k)) count += 1\\n s(6) == (count == 4)\\n }\\n\\n def check7: Boolean = s(7) == ((s(2) || s(3)) && !(s(2) && s(3)))\\n\\n def check8: Boolean = s(8) == (!s(7) || s(5) && s(6))\\n\\n def check9: Boolean = {\\n var count = 0\\n for (k <- 1 to 6) if (s(k)) count += 1\\n\\n s(9) == (count == 3)\\n }\\n\\n def check10: Boolean = s(10) == (s(11) && s(12))\\n\\n def check11: Boolean = {\\n var count = 0\\n for (k <- 7 to 9) if (s(k)) count += 1\\n\\n s(11) == (count == 1)\\n }\\n\\n def check12: Boolean = {\\n var count = 0\\n for (k <- 1 to 11) if (s(k)) count += 1\\n s(12) == (count == 4)\\n }\\n\\n def check(): Unit = {\\n if (check2 && check3 && check4 && check5 && check6 && check7 && check8 && check9 && check10 && check11 && check12) {\\n for (k <- 1 to 12) if (s(k)) print(k + \\\" \\\")\\n println()\\n count += 1\\n }\\n }\\n\\n def recurseAll(k: Int): Unit = {\\n if (k == 13) check()\\n else {\\n s(k) = false\\n recurseAll(k + 1)\\n s(k) = true\\n recurseAll(k + 1)\\n }\\n }\\n}\\n\\nobject LogicPuzzle extends App {\\n val p = new LogicPuzzle\\n p.s(1) = true\\n p.recurseAll(2)\\n println()\\n println(s\\\"${p.count} Solutions found.\\\")\\n\\n}\\n\",\n \"language\": \"Scala\"\n },\n {\n \"code\": \"var conditions = [\\n { false },\\n {|a| a.len == 13 },\\n {|a| [a[7..12]].count(true) == 3 },\\n {|a| [a[2..12 `by` 2]].count(true) == 2 },\\n {|a| a[5] ? (a[6] && a[7]) : true },\\n {|a| !a[2] && !a[3] && !a[4] },\\n {|a| [a[1..11 `by` 2]].count(true) == 4 },\\n {|a| a[2] == true^a[3] },\\n {|a| a[7] ? (a[5] && a[6]) : true },\\n {|a| [a[1..6]].count(true) == 3 },\\n {|a| [a[11,12]].count(true) == 2 },\\n {|a| [a[7..9]].count(true) == 1 },\\n {|a| [a[1..11]].count(true) == 4 },\\n]\\n\\nfunc miss(args) {\\n 1..12 -> grep {|i| conditions[i](args) != args[i] }\\n}\\n\\nfor k in (^(1<<12)) {\\n var t = (\\\"0%012b\\\" % k -> chars.map {|bit| bit == '1' })\\n var no = miss(t)\\n no.len == 0 && say \\\"Solution: true statements are #{1..12->grep{t[_]}.join(' ')}\\\"\\n no.len == 1 && say \\\"1 miss (#{no[0]}): true statements are #{1..12->grep{t[_]}.join(' ')}\\\"\\n}\\n\",\n \"language\": \"Sidef\"\n },\n {\n \"code\": \"package require Tcl 8.6\\n\\n# Function to evaluate the truth of a statement\\nproc tcl::mathfunc::S {idx} {\\n upvar 1 state s\\n apply [lindex $s [expr {$idx - 1}]] $s\\n}\\n# Procedure to count the number of statements which are true\\nproc S+ args {\\n upvar 1 state state\\n tcl::mathop::+ {*}[lmap i $args {expr {S($i)}}]\\n}\\n# Turn a list of expressions into a list of lambda terms\\nproc lambdas items {lmap x $items {list state [list expr $x]}}\\n\\n# Find the truth assignment that produces consistency. And those that are\\n# near misses too.\\nproc findTruthMatch {statements} {\\n set n [llength $statements]\\n for {set i 0} {$i < 2**$n} {incr i} {\\n\\tset state [split [format %0.*b $n $i] \\\"\\\"]\\n\\tset truths [lmap f $statements {apply $f [lambdas $state]}]\\n\\tset counteq [tcl::mathop::+ {*}[lmap s $state t $truths {expr {\\n\\t $s == $t\\n\\t}}]]\\n\\tif {$counteq == $n} {\\n\\t lappend exact $state\\n\\t} elseif {$counteq == $n-1} {\\n\\t set j 0\\n\\t foreach s $state t $truths {\\n\\t\\tincr j\\n\\t\\tif {$s != $t} {\\n\\t\\t lappend differ $state $j\\n\\t\\t break\\n\\t\\t}\\n\\t }\\n\\t}\\n }\\n return [list $exact $differ]\\n}\\n\\n# Rendering code\\nproc renderstate state {\\n return ([join [lmap s $state {\\n\\tincr i\\n\\texpr {$s ? \\\"S($i)\\\" : \\\"\\\\u00acS($i)\\\"}\\n }] \\\"\\\\u22c0\\\"])\\n}\\n\\n# The statements, encoded as expressions\\nset statements {\\n {[llength $state] == 12}\\n {[S+ 7 8 9 10 11 12] == 3}\\n {[S+ 2 4 6 8 10 12] == 2}\\n {S(5) ? S(6) && S(7) : 1}\\n {[S+ 2 3 4] == 0}\\n {[S+ 1 3 5 7 9 11] == 4}\\n {S(2) != S(3)}\\n {S(7) ? S(5) && S(6) : 1}\\n {[S+ 1 2 3 4 5 6] == 3}\\n {S(11) && S(12)}\\n {[S+ 7 8 9] == 1}\\n {[S+ 1 2 3 4 5 6 7 8 9 10 11] == 4}\\n}\\n# Find the truth assignment(s) that give consistency\\nlassign [findTruthMatch [lambdas $statements]] exact differ\\n# Print the results\\nforeach state $exact {\\n puts \\\"exact match\\\\t[renderstate $state ]\\\"\\n}\\nforeach {state j} $differ {\\n puts \\\"almost found\\\\t[renderstate $state] \\\\u21d2 [expr {[lindex $state $j-1]?\\\"\\\\u00ac\\\":{}}]S($j)\\\"\\n}\\n\",\n \"language\": \"Tcl\"\n },\n {\n \"code\": \"(defmacro defconstraints (name size-name (var) . forms)\\n ^(progn (defvar ,size-name ,(length forms))\\n (defun ,name (,var)\\n (list ,*forms))))\\n\\n(defconstraints con con-count (s)\\n (= (length s) con-count) ;; tautology\\n (= (countq t [s -6..t]) 3)\\n (= (countq t (mapcar (op if (evenp @1) @2) (range 1) s)) 2)\\n (if [s 4] (and [s 5] [s 6]) t)\\n (none [s 1..3])\\n (= (countq t (mapcar (op if (oddp @1) @2) (range 1) s)) 4)\\n (and (or [s 1] [s 2]) (not (and [s 1] [s 2])))\\n (if [s 6] (and [s 4] [s 5]) t)\\n (= (countq t [s 0..6]) 3)\\n (and [s 10] [s 11])\\n (= (countq t [s 6..9]) 1)\\n (= (countq t [s 0..con-count]) 4))\\n\\n(defun true-indices (truths)\\n (mappend (do if @1 ^(,@2)) truths (range 1)))\\n\\n(defvar results\\n (append-each ((truths (rperm '(nil t) con-count)))\\n (let* ((vals (con truths))\\n (consist [mapcar eq truths vals])\\n (wrong-count (countq nil consist))\\n (pos-wrong (+ 1 (or (posq nil consist) -2))))\\n (cond\\n ((zerop wrong-count)\\n ^((:----> ,*(true-indices truths))))\\n ((= 1 wrong-count)\\n ^((:close ,*(true-indices truths) (:wrong ,pos-wrong))))))))\\n\\n(each ((r results))\\n (put-line `@r`))\\n\",\n \"language\": \"TXR\"\n },\n {\n \"code\": \"Even ← =1◿2⇡⧻ # nb indexes are zero-based\\nSA ← =12⧻ # Total is always twelve (don't test)\\nSB ← =3⧻⊚↘6 # Three of last six are true\\nSC ← =2⧻⊚⊏⊚Even. # Exactly two even rules are true\\nSD ← ⟨1◌|/×⟩⊢.↙3↘4 # If 5 is true so are 6 and 7\\nSE ← /׬⊏[1 2 3] # 2, 3, 4 are all false\\nSF ← =4⧻⊚⊏⊚¬Even. # Four odd rules are true\\nSG ← =1/+↙2↘1 # 2 xor 3\\nSH ← ⟨1◌|/×⟩⊢.⇌↙3↘4 # If 7 is true so are 6 and 5\\nSI ← =3⧻⊚↙6 # Three of first six are true\\nSJ ← /×⊏[10 11] # 11 and 12 are both true\\nSK ← =1/+⊏[6 7 8] # Exactly one of 7, 8, 9 is true\\nSL ← =4/+↘¯1 # Exactly four of above are true\\n\\n⋯+1×2⇡2048 # Brute force sensible combinations\\n≡(\\n # Test each rule against the data and concatenate\\n :[⊃⊃⊃⊃⊃⊃⊃⊃⊃⊃⊃SA SB SC SD SE SF SG SH SI SJ SK SL].\\n ⊟∩□:⊙(⊚⌵-). # Append hit-count\\n)\\n\\n# Partition by fit, keep only hits and near-misses\\n°⊟↙2⊕□≡(◇⧻⊢).\\n\\n# Print results\\n&p\\\"\\\\nNear Misses\\\"&s+1◇⊚⊢↘1◇⊢&p\\\"Hits\\\"\\n⊏⍏≡⊢.°□ # Sort misses\\n≡(⊃(&p+1⊚°□⊢↘1)(&pf\\\"\\\\t\\\"&pf+1◇⊢⊢&pf\\\"Fails at \\\"))\\n\",\n \"language\": \"Uiua\"\n },\n {\n \"code\": \"Public s As String '-- (eg \\\"101101100010\\\")\\nPublic t As Integer '-- scratch\\n\\nFunction s1()\\n s1 = Len(s) = 12\\nEnd Function\\nFunction s2()\\n t = 0\\n For i = 7 To 12\\n t = t - (Mid(s, i, 1) = \\\"1\\\")\\n Next i\\n s2 = t = 3\\nEnd Function\\nFunction s3()\\n t = 0\\n For i = 2 To 12 Step 2\\n t = t - (Mid(s, i, 1) = \\\"1\\\")\\n Next i\\n s3 = t = 2\\nEnd Function\\nFunction s4()\\n s4 = Mid(s, 5, 1) = \\\"0\\\" Or ((Mid(s, 6, 1) = \\\"1\\\" And Mid(s, 7, 1) = \\\"1\\\"))\\nEnd Function\\nFunction s5()\\n s5 = Mid(s, 2, 1) = \\\"0\\\" And Mid(s, 3, 1) = \\\"0\\\" And Mid(s, 4, 1) = \\\"0\\\"\\nEnd Function\\nFunction s6()\\n t = 0\\n For i = 1 To 12 Step 2\\n t = t - (Mid(s, i, 1) = \\\"1\\\")\\n Next i\\n s6 = t = 4\\nEnd Function\\nFunction s7()\\n s7 = Mid(s, 2, 1) <> Mid(s, 3, 1)\\nEnd Function\\nFunction s8()\\n s8 = Mid(s, 7, 1) = \\\"0\\\" Or (Mid(s, 5, 1) = \\\"1\\\" And Mid(s, 6, 1) = \\\"1\\\")\\nEnd Function\\nFunction s9()\\n t = 0\\n For i = 1 To 6\\n t = t - (Mid(s, i, 1) = \\\"1\\\")\\n Next i\\n s9 = t = 3\\nEnd Function\\nFunction s10()\\n s10 = Mid(s, 11, 1) = \\\"1\\\" And Mid(s, 12, 1) = \\\"1\\\"\\nEnd Function\\nFunction s11()\\n t = 0\\n For i = 7 To 9\\n t = t - (Mid(s, i, 1) = \\\"1\\\")\\n Next i\\n s11 = t = 1\\nEnd Function\\nFunction s12()\\n t = 0\\n For i = 1 To 11\\n t = t - (Mid(s, i, 1) = \\\"1\\\")\\n Next i\\n s12 = t = 4\\nEnd Function\\n\\nPublic Sub twelve_statements()\\n For i = 0 To 2 ^ 12 - 1\\n s = Right(CStr(WorksheetFunction.Dec2Bin(64 + i \\\\ 128)), 5) _\\n & Right(CStr(WorksheetFunction.Dec2Bin(256 + i Mod 128)), 7)\\n For b = 1 To 12\\n Select Case b\\n Case 1: If s1 <> (Mid(s, b, 1) = \\\"1\\\") Then Exit For\\n Case 2: If s2 <> (Mid(s, b, 1) = \\\"1\\\") Then Exit For\\n Case 3: If s3 <> (Mid(s, b, 1) = \\\"1\\\") Then Exit For\\n Case 4: If s4 <> (Mid(s, b, 1) = \\\"1\\\") Then Exit For\\n Case 5: If s5 <> (Mid(s, b, 1) = \\\"1\\\") Then Exit For\\n Case 6: If s6 <> (Mid(s, b, 1) = \\\"1\\\") Then Exit For\\n Case 7: If s7 <> (Mid(s, b, 1) = \\\"1\\\") Then Exit For\\n Case 8: If s8 <> (Mid(s, b, 1) = \\\"1\\\") Then Exit For\\n Case 9: If s9 <> (Mid(s, b, 1) = \\\"1\\\") Then Exit For\\n Case 10: If s10 <> (Mid(s, b, 1) = \\\"1\\\") Then Exit For\\n Case 11: If s11 <> (Mid(s, b, 1) = \\\"1\\\") Then Exit For\\n Case 12: If s12 <> (Mid(s, b, 1) = \\\"1\\\") Then Exit For\\n End Select\\n If b = 12 Then Debug.Print s\\n Next\\n Next\\nEnd Sub\\n\",\n \"language\": \"VBA\"\n },\n {\n \"code\": \"import \\\"./fmt\\\" for Conv, Fmt\\n\\nvar predicates = [\\n Fn.new { |s| s.count == 13 }, // indexing starts at 0 but first bit ignored\\n Fn.new { |s| (7..12).count { |i| s[i] == \\\"1\\\" } == 3 },\\n Fn.new { |s| [2, 4, 6, 8, 10, 12].count { |i| s[i] == \\\"1\\\" } == 2 },\\n Fn.new { |s| s[5] == \\\"0\\\" || (s[6] == \\\"1\\\" && s[7] == \\\"1\\\") },\\n Fn.new { |s| s[2] == \\\"0\\\" && s[3] == \\\"0\\\" && s[4] == \\\"0\\\" },\\n Fn.new { |s| [1, 3, 5, 7, 9, 11].count { |i| s[i] == \\\"1\\\" } == 4 },\\n Fn.new { |s| Conv.itob(Conv.btoi(s[2] == \\\"1\\\") ^ Conv.btoi(s[3] == \\\"1\\\")) },\\n Fn.new { |s| s[7] == \\\"0\\\" || (s[5] == \\\"1\\\" && s[6] == \\\"1\\\") },\\n Fn.new { |s| (1..6).count { |i| s[i] == \\\"1\\\" } == 3 },\\n Fn.new { |s| s[11] == \\\"1\\\" && s[12] == \\\"1\\\" },\\n Fn.new { |s| (7..9).count { |i| s[i] == \\\"1\\\" } == 1 },\\n Fn.new { |s| (1..11).count { |i| s[i] == \\\"1\\\" } == 4 }\\n]\\n\\nvar show = Fn.new { |s, indent|\\n if (indent) System.write(\\\" \\\")\\n for (i in 0...s.count) if (s[i] == \\\"1\\\") System.write(\\\"%(i) \\\")\\n System.print()\\n}\\n\\nSystem.print(\\\"Exact hits:\\\")\\nfor (i in 0..4095) {\\n var s = Fmt.swrite(\\\"$013b\\\", i)\\n var j = 1\\n if (predicates.all { |pred|\\n var res = pred.call(s) == (s[j] == \\\"1\\\")\\n j = j + 1\\n return res\\n }) show.call(s, true)\\n}\\n\\nSystem.print(\\\"\\\\nNear misses:\\\")\\nfor (i in 0..4095) {\\n var s = Fmt.swrite(\\\"$013b\\\", i)\\n var j = 1\\n var c = predicates.count { |pred|\\n var res = pred.call(s) == (s[j] == \\\"1\\\")\\n j = j + 1\\n return res\\n }\\n if (c == 11) {\\n var k = 1\\n for (pred in predicates) {\\n if (pred.call(s) != (s[k] == \\\"1\\\") ) break\\n k = k + 1\\n }\\n Fmt.write(\\\" (Fails at statement $2d) \\\", k)\\n show.call(s, false)\\n }\\n}\\n\",\n \"language\": \"Wren\"\n },\n {\n \"code\": \" \\\\We have 12 statements to determine the truth/falsehood of (see task).\\n integer Stmt( 1+12 ), Expected( 1+12 );\\n\\n \\\\Logical-to-integer utility procedure\\n function ToInteger; int V ; return if V # 0 then 1 else 0;\\n\\n \\\\Procedure to determine whether the statements are true or not\\n procedure FindExpectedValues;\\n begin\\n Expected( 1 ) := true;\\n Expected( 2 ) := 3 = ( ToInteger( Stmt( 7 ) ) + ToInteger( Stmt( 8 ) )\\n + ToInteger( Stmt( 9 ) ) + ToInteger( Stmt( 10 ) )\\n + ToInteger( Stmt( 11 ) ) + ToInteger( Stmt( 12 ) )\\n );\\n Expected( 3 ) := 2 = ( ToInteger( Stmt( 2 ) ) + ToInteger( Stmt( 4 ) )\\n + ToInteger( Stmt( 6 ) ) + ToInteger( Stmt( 8 ) )\\n + ToInteger( Stmt( 10 ) ) + ToInteger( Stmt( 12 ) )\\n );\\n Expected( 4 ) := ( not Stmt( 5 ) ) or ( Stmt( 6 ) and Stmt( 7 ) );\\n Expected( 5 ) := not ( Stmt( 2 ) or Stmt( 3 ) or Stmt( 4 ) );\\n Expected( 6 ) := 4 = ( ToInteger( Stmt( 1 ) ) + ToInteger( Stmt( 3 ) )\\n + ToInteger( Stmt( 5 ) ) + ToInteger( Stmt( 7 ) )\\n + ToInteger( Stmt( 9 ) ) + ToInteger( Stmt( 11 ) )\\n );\\n Expected( 7 ) := Stmt( 2 ) # Stmt( 3 );\\n Expected( 8 ) := ( not Stmt( 7 ) ) or ( Stmt( 5 ) and Stmt( 6 ) );\\n Expected( 9 ) := 3 = ( ToInteger( Stmt( 1 ) ) + ToInteger( Stmt( 2 ) )\\n + ToInteger( Stmt( 3 ) ) + ToInteger( Stmt( 4 ) )\\n + ToInteger( Stmt( 5 ) ) + ToInteger( Stmt( 6 ) )\\n );\\n Expected( 10 ) := Stmt( 11 ) and Stmt( 12 );\\n Expected( 11 ) := 1 = ( ToInteger( Stmt( 7 ) )\\n + ToInteger( Stmt( 8 ) )\\n + ToInteger( Stmt( 9 ) )\\n );\\n Expected( 12 ) := 4 = ( ToInteger( Stmt( 1 ) ) + ToInteger( Stmt( 2 ) )\\n + ToInteger( Stmt( 3 ) ) + ToInteger( Stmt( 4 ) )\\n + ToInteger( Stmt( 5 ) ) + ToInteger( Stmt( 6 ) )\\n + ToInteger( Stmt( 7 ) ) + ToInteger( Stmt( 8 ) )\\n + ToInteger( Stmt( 9 ) ) + ToInteger( Stmt( 10 ) )\\n + ToInteger( Stmt( 11 ) )\\n );\\n end; \\\\FindExpectedValues\\n\\n \\\\Clearly, statement 1 is true. However to enumerate the near\\n \\\\ solutions, we need to consider \\\"solutions\\\" where statement 1 is false.\\n \\\\We iterate through the possibilities for the statements,\\n \\\\ looking for a non-contradictory set of values.\\n \\\\We print the solutions with allowedContradictions contradictions\\n procedure PrintSolutions ( AllowedContradictions, Heading ) ;\\n integer AllowedContradictions, Heading;\\n integer Wrong( 1+12 );\\n integer Solution, N, Incorrect, DPos, S;\\n begin\\n Text(0, Heading ); CrLf(0);\\n Text(0, \\\" 1 2 3 4 5 6 7 8 9 10 11 12^m^j\\\" );\\n Text(0, \\\" ====================================^m^j\\\" );\\n \\\\There are 12 statements, so we have 2^12 possible combinations\\n for Solution := 1 to 4096 do begin\\n \\\\Convert the number to the set of true/false values\\n N := Solution;\\n for DPos := 1 to 12 do begin\\n Stmt( DPos ) := (N & 1) # 0; \\\\very odd\\n N := N / 2;\\n end; \\\\for_DPos\\n \\\\Get the expected values of the statements based on suggested values\\n FindExpectedValues;\\n \\\\Count contradictions. If the required number, print solution\\n Incorrect := 0;\\n for DPos := 1 to 12 do begin\\n Wrong( DPos ) := Expected( DPos ) # Stmt( DPos );\\n Incorrect := Incorrect + ToInteger( Wrong( DPos ) );\\n end; \\\\for_DPos\\n if Incorrect = AllowedContradictions then begin\\n \\\\Have a solution\\n Text(0, \\\" \\\" );\\n for S := 1 to 12 do begin\\n Text(0, \\\" \\\");\\n Text(0, if Stmt( S ) then \\\"T\\\" else \\\"-\\\");\\n Text(0, if Wrong( S ) then \\\"*\\\" else \\\" \\\");\\n end;\\n CrLf(0);\\n end;\\n end; \\\\for_solution\\n end; \\\\PrintSolutions\\n\\nbegin\\n \\\\Find complete solutions\\n PrintSolutions( 0, \\\"Solutions\\\" );\\n \\\\Find near solutions\\n PrintSolutions( 1, \\\"Near solutions (incorrect values marked ^\\\"*^\\\")\\\" );\\nend\\n\",\n \"language\": \"XPL0\"\n },\n {\n \"code\": \"sub s1() return len(s$)=12 end sub\\nsub s2() local t, i : t=0 : for i=7 to 12 : t = t + (mid$(s$, i, 1) <> \\\"0\\\") : next : return t=3 end sub\\nsub s3() local t, i : t=0 : for i=2 to 12 step 2 : t = t + (mid$(s$, i, 1) <> \\\"0\\\") : next : return t=2 end sub\\nsub s4() return mid$(s$, 5, 1) = \\\"0\\\" or (mid$(s$, 6, 1) <> \\\"0\\\" and mid$(s$, 7, 1) <> \\\"0\\\") end sub\\nsub s5() return mid$(s$, 2, 1) = \\\"0\\\" and mid$(s$, 3, 1) = \\\"0\\\" and mid$(s$, 4, 1) = \\\"0\\\" end sub\\nsub s6() local t, i : t=0 : for i=1 to 12 step 2 : t = t + mid$(s$, i, 1) <> \\\"0\\\" : next : return t=4 end sub\\nsub s7() return mid$(s$, 2, 1) <> mid$(s$, 3, 1) end sub\\nsub s8() return mid$(s$, 7, 1) = \\\"0\\\" or (mid$(s$, 5, 1) <> \\\"0\\\" and mid$(s$, 6, 1) <> \\\"0\\\") end sub\\nsub s9() local t, i : t=0 : for i=1 to 6 : t = t + mid$(s$, i, 1) <> \\\"0\\\" : next : return t=3 end sub\\nsub s10() return mid$(s$, 11, 1) <> \\\"0\\\" and mid$(s$, 12, 1) <> \\\"0\\\" end sub\\nsub s11() local t, i : t=0 : for i=7 to 9 : t = t + mid$(s$, i, 1) <> \\\"0\\\" : next : return t=1 end sub\\nsub s12() local t, i : t=0 : for i=1 to 11 : t = t + mid$(s$, i, 1) <> \\\"0\\\" : next : return t=4 end sub\\n\\ndim r$(12)\\n\\nfor b=1 to 12\\n r$(b) = \\\"s\\\"+str$(b)\\nnext\\nfor i=0 to 2^12-1\\n s$ = right$(\\\"000000000000\\\" + bin$(i), 12)\\n for b=1 to 12\\n if execute(r$(b)) <> (mid$(s$, b, 1) <> \\\"0\\\") break\\n if b=12 print s$\\n next\\nnext\\n\",\n \"language\": \"Yabasic\"\n },\n {\n \"code\": \"var statements; // list of 13 Bools, statements[0] is garbage to make 1 based\\nfcn s0 { False } // dummy for padding\\nfcn s1 { True }\\nfcn s2 { statements[-6,*].filter().len()==3 }\\nfcn s3 { [2..12,2].apply(statements.get).filter().len()==2 }\\nfcn s4 { if(statements[5]) statements[6]==statements[7]==True else True }\\nfcn s5 { statements[2,3].filter().len()==0 }\\nfcn s6 { [1..12,2].apply(statements.get).filter().len()==4 }\\nfcn s7 { statements[2]!=statements[3] }\\nfcn s8 { if(statements[7]) statements[5]==statements[6]==True else True }\\nfcn s9 { statements[1,6].filter().len()==3 }\\nfcn s10{ statements[11]==statements[12]==True }\\nfcn s11{ statements[7,3].filter().len()==1 }\\nfcn s12{ statements[1,11].filter().len()==4 }\\n\\nfilters:=T(s0,s1,s2,s3,s4,s5,s6,s7,s8,s9,s10,s11,s12);\\nforeach n in ((2).pow(12)){ // 4k\\n // 5-->\\\"0000000000101\\\"-->(\\\"0\\\",\\\"0\\\"...\\\"1\\\")-->(F,F,...T)\\n statements=\\\"%013.2B\\\".fmt(n).split(\\\"\\\").apply('==(\\\"1\\\"));\\n r:=filters.run(True); // and return list of results\\n if(r==statements) print(\\\"<<<<<<<<<<<<<<<<Solution\\\");\\n else{\\n diff:=r.zipWith('!=,statements);\\n if(diff.sum(0)==1) print(\\\"Diff @\\\",diff.filter1n());\\n }\\n}\\nfcn print(msg){\\n (12).pump(List,'wrap(n){ statements[n] and n or Void.Skip })\\n .concat(\\\",\\\").println(\\\" : \\\",vm.pasteArgs());\\n}\\n\",\n \"language\": \"Zkl\"\n }\n]","isConversational":false},"task_name":{"kind":"string","value":"Twelve-statements"}}},{"rowIdx":1776,"cells":{"solutions":{"kind":"list like","value":[{"code":"---\nfrom: http://rosettacode.org/wiki/Twin_primes\nnote: Prime Numbers\n","language":"00-META"},{"code":"Twin primes are pairs of natural numbers (P<sub>1</sub> and P<sub>2</sub>) that satisfy the following:\n\n::# P<sub>1</sub> and P<sub>2</sub> are primes\n::# P<sub>1</sub> + '''2''' = P<sub>2</sub>\n\n\n;Task:\nWrite a program that displays the number of <b>pairs of twin primes</b> that can be found <u>under</u> a user-specified number\n<br>(P<sub>1</sub> < <i>user-specified number</i> & P<sub>2</sub> < <i>user-specified number</i>).\n\n\n;Extension:\n::# Find all twin prime pairs under 100000, 10000000 and 1000000000.\n::# What is the time complexity of the program? Are there ways to reduce computation time?\n\n\n;Examples:\n<pre>\n> Search Size: 100\n> 8 twin prime pairs.\n</pre>\n\n<pre>\n> Search Size: 1000\n> 35 twin prime pairs.\n</pre>\n\n\n;Also see:\n* The OEIS entry: [[oeis:A001097|A001097: Twin primes]]. \n* The OEIS entry: [[oeis:A167874|A167874: The number of distinct primes < 10^n which are members of twin-prime pairs]]. \n* The OEIS entry: [[oeis:A077800|A077800: List of twin primes {p, p+2}, with repetition]]. \n* The OEIS entry: [[oeis:A007508|A007508: Number of twin prime pairs below 10^n]]. \n<br><br>\n\n","language":"00-TASK"},{"code":"BEGIN\n # count twin primes (where p and p - 2 are prime) #\n PR heap=128M PR # set heap memory size for Algol 68G #\n # sieve of Eratosthenes: sets s[i] to TRUE if i is a prime, FALSE otherwise #\n PROC sieve = ( REF[]BOOL s )VOID:\n BEGIN\n FOR i TO UPB s DO s[ i ] := TRUE OD;\n s[ 1 ] := FALSE;\n FOR i FROM 2 TO ENTIER sqrt( UPB s ) DO\n IF s[ i ] THEN FOR p FROM i * i BY i TO UPB s DO s[ p ] := FALSE OD FI\n OD\n END # sieve # ;\n # find the maximum number to search for twin primes #\n INT max;\n print( ( \"Maximum: \" ) );\n read( ( max, newline ) );\n INT max number = max;\n # construct a sieve of primes up to the maximum number #\n [ 1 : max number ]BOOL primes;\n sieve( primes );\n # count the twin primes #\n # note 2 cannot be one of the primes in a twin prime pair, so we start at 3 #\n INT twin count := 0;\n FOR p FROM 3 BY 2 TO max number - 1 DO IF primes[ p ] AND primes[ p - 2 ] THEN twin count +:= 1 FI OD;\n print( ( \"twin prime pairs below \", whole( max number, 0 ), \": \", whole( twin count, 0 ), newline ) )\nEND\n","language":"ALGOL-68"},{"code":" 0 INPUT \"SEARCH SIZE: \";S: FOR N = 1 TO S - 3 STEP 2:P = N: GOSUB 3: IF F THEN P = N + 2: GOSUB 3:C = C + F\n 1 J = J + (N > 5): IF J = 3 THEN N = N + 4:J = 0\n 2 NEXT N: PRINT C\" TWIN PRIME PAIRS.\": END\n 3 F = 0: IF P < 2 THEN RETURN\n 4 F = P = 2: IF F THEN RETURN\n 5 F = P - INT (P / 2) * 2: IF NOT F THEN RETURN\n 6 FOR B = 3 TO SQR (P) STEP 2: IF B > = P THEN NEXT B\n 7 IF B > = P THEN RETURN\n 8 F = 0: FOR I = B TO SQR (P) STEP 2: IF P - INT (P / I) * I = 0 THEN RETURN\n 9 NEXT I:F = 1: RETURN\n","language":"Applesoft-BASIC"},{"code":"pairsOfPrimes: function [upperLim][\n count: 0\n j: 0\n k: 1\n i: 0\n while [i=<upperLim][\n i: (6 * k) - 1\n j: i + 2\n if and? [prime? i] [prime? j] [\n count: count + 1\n ]\n k: k + 1\n ]\n return count + 1\n]\n\nToNum: 10\nwhile [ToNum =< 1000000][\n x: pairsOfPrimes ToNum\n print [\"From 2 to\" ToNum \": there are\" x \"pairs of twin primes\"]\n ToNum: ToNum * 10\n]\n","language":"Arturo"},{"code":"# syntax: GAWK -f TWIN_PRIMES.AWK\nBEGIN {\n n = 1\n for (i=1; i<=6; i++) {\n n *= 10\n printf(\"twin prime pairs < %8s : %d\\n\",n,count_twin_primes(n))\n }\n exit(0)\n}\nfunction count_twin_primes(limit, count,i,p1,p2,p3) {\n p1 = 0\n p2 = p3 = 1\n for (i=5; i<=limit; i++) {\n p3 = p2\n p2 = p1\n p1 = is_prime(i)\n if (p3 && p1) {\n count++\n }\n }\n return(count)\n}\nfunction is_prime(x, i) {\n if (x <= 1) {\n return(0)\n }\n for (i=2; i<=int(sqrt(x)); i++) {\n if (x % i == 0) {\n return(0)\n }\n }\n return(1)\n}\n","language":"AWK"},{"code":"function isPrime(v)\n if v < 2 then return False\n if v mod 2 = 0 then return v = 2\n if v mod 3 = 0 then return v = 3\n d = 5\n while d * d <= v\n if v mod d = 0 then return False else d += 2\n end while\n return True\nend function\n\nfunction paresDePrimos(limite)\n p1 = 0\n p2 = 1\n p3 = 1\n cont = 0\n for i = 5 to limite\n p3 = p2\n p2 = p1\n p1 = isPrime(i)\n if (p3 and p1) then cont += 1\n next i\n return cont\nend function\n\nn = 1\nfor i = 1 to 6\n n = n * 10\n print \"pares de primos gemelos por debajo de < \"; n; \" : \"; paresDePrimos(n)\nnext i\nend\n","language":"BASIC256"},{"code":"#include <stdbool.h>\n#include <stdint.h>\n#include <stdio.h>\n\nbool isPrime(int64_t n) {\n int64_t i;\n\n if (n < 2) return false;\n if (n % 2 == 0) return n == 2;\n if (n % 3 == 0) return n == 3;\n if (n % 5 == 0) return n == 5;\n if (n % 7 == 0) return n == 7;\n if (n % 11 == 0) return n == 11;\n if (n % 13 == 0) return n == 13;\n if (n % 17 == 0) return n == 17;\n if (n % 19 == 0) return n == 19;\n\n for (i = 23; i * i <= n; i += 2) {\n if (n % i == 0) return false;\n }\n\n return true;\n}\n\nint countTwinPrimes(int limit) {\n int count = 0;\n\n // 2 3 4\n int64_t p3 = true, p2 = true, p1 = false;\n int64_t i;\n\n for (i = 5; i <= limit; i++) {\n p3 = p2;\n p2 = p1;\n p1 = isPrime(i);\n if (p3 && p1) {\n count++;\n }\n }\n return count;\n}\n\nvoid test(int limit) {\n int count = countTwinPrimes(limit);\n printf(\"Number of twin prime pairs less than %d is %d\\n\", limit, count);\n}\n\nint main() {\n test(10);\n test(100);\n test(1000);\n test(10000);\n test(100000);\n test(1000000);\n test(10000000);\n test(100000000);\n return 0;\n}\n","language":"C"},{"code":"#include <cstdint>\n#include <iostream>\n#include <string>\n#include <primesieve.hpp>\n\nvoid print_twin_prime_count(long long limit) {\n std::cout << \"Number of twin prime pairs less than \" << limit\n << \" is \" << (limit > 0 ? primesieve::count_twins(0, limit - 1) : 0) << '\\n';\n}\n\nint main(int argc, char** argv) {\n std::cout.imbue(std::locale(\"\"));\n if (argc > 1) {\n // print number of twin prime pairs less than limits specified\n // on the command line\n for (int i = 1; i < argc; ++i) {\n try {\n print_twin_prime_count(std::stoll(argv[i]));\n } catch (const std::exception& ex) {\n std::cerr << \"Cannot parse limit from '\" << argv[i] << \"'\\n\";\n }\n }\n } else {\n // if no limit was specified then show the number of twin prime\n // pairs less than powers of 10 up to 100 billion\n uint64_t limit = 10;\n for (int power = 1; power < 12; ++power, limit *= 10)\n print_twin_prime_count(limit);\n }\n return 0;\n}\n","language":"C++"},{"code":"#include <bitset>\n#include <cstdint>\n#include <iomanip>\n#include <iostream>\n#include <vector>\n\nconst uint32_t limit = 1'000'000'000;\nstd::bitset<limit + 1> primes;\n\nvoid sieve_primes(uint32_t limit) {\n\tprimes.set();\n\tprimes.reset(0); primes.reset(1);\n\n\tfor ( uint32_t p = 2; p * p <= limit; ++p ) {\n\t\tif ( primes.test(p) ) {\n\t\t\tfor ( uint32_t i = p * p; i <= limit; i += p ) {\n\t\t\t\tprimes.reset(i);\n\t\t\t}\n\t\t}\n\t}\n}\n\nint main() {\n\tsieve_primes(limit);\n\n\tuint32_t target = 10;\n\tuint32_t count = 0;\n bool last = false;\n bool first = true;\n\n for ( uint32_t index = 5; index <= limit; index += 2 ) {\n last = first;\n first = primes[index];\n if ( last && first ) {\n count += 1;\n }\n if ( index + 1 == target ) {\n \tstd::cout << std::setw(8) << count << \" twin primes below \" << index + 1 << std::endl;\n \ttarget *= 10;\n }\n }\n}\n","language":"C++"},{"code":"using System;\n\nclass Program {\n\n static uint[] res = new uint[10];\n static uint ri = 1, p = 10, count = 0;\n\n static void TabulateTwinPrimes(uint bound) {\n if (bound < 5) return; count++;\n uint cl = (bound - 1) >> 1, i = 1, j,\n limit = (uint)(Math.Sqrt(bound) - 1) >> 1;\n var comp = new bool[cl]; bool lp;\n for (j = 3; j < cl; j += 3) comp[j] = true;\n while (i < limit) {\n if (lp = !comp[i]) {\n uint pr = (i << 1) + 3;\n for (j = (pr * pr - 2) >> 1; j < cl; j += pr)\n comp[j] = true;\n }\n if (!comp[++i]) {\n uint pr = (i << 1) + 3;\n if (lp) {\n if (pr > p) {\n res[ri++] = count;\n p *= 10;\n }\n count++;\n i++;\n }\n for (j = (pr * pr - 2) >> 1; j < cl; j += pr)\n comp[j] = true;\n }\n }\n cl--;\n while (i < cl) {\n lp = !comp[i++];\n if (!comp[i] && lp) {\n if ((i++ << 1) + 3 > p) {\n res[ri++] = count;\n p *= 10;\n }\n count++;\n }\n }\n res[ri] = count;\n }\n\n static void Main(string[] args) {\n var sw = System.Diagnostics.Stopwatch.StartNew();\n string fmt = \"{0,9:n0} twin primes below {1,-13:n0}\";\n TabulateTwinPrimes(1_000_000_000);\n sw.Stop();\n p = 1;\n for (var j = 1; j <= ri; j++)\n Console.WriteLine(fmt, res[j], p *= 10);\n Console.Write(\"{0} sec\", sw.Elapsed.TotalSeconds);\n }\n}\n","language":"C-sharp"},{"code":"using System;\nusing System.Linq;\nusing System.Collections;\nusing System.Collections.Generic;\n\npublic static class TwinPrimes\n{\n public static void Main()\n {\n CountTwinPrimes(Enumerable.Range(1, 9).Select(i => (int)Math.Pow(10, i)).ToArray());\n }\n\n private static void CountTwinPrimes(params int[] bounds)\n {\n Array.Sort(bounds);\n int b = 0;\n int count = 0;\n string format = \"There are {0:N0} twin primes below {1:N0}\";\n foreach (var twin in FindTwinPrimes(bounds[^1])) {\n if (twin.p2 >= bounds[b]) {\n Console.WriteLine(format, count, bounds[b]);\n b++;\n }\n count++;\n }\n Console.WriteLine(format, count, bounds[b]);\n }\n\n private static IEnumerable<(int p1, int p2)> FindTwinPrimes(int bound) =>\n PrimeSieve(bound).Pairwise().Where(pair => pair.p1 + 2 == pair.p2);\n\n private static IEnumerable<int> PrimeSieve(int bound)\n {\n if (bound < 2) yield break;\n yield return 2;\n\n var composite = new BitArray((bound - 1) / 2);\n int limit = (int)(Math.Sqrt(bound) - 1) / 2;\n for (int i = 0; i < limit; i++) {\n if (composite[i]) continue;\n int prime = 2 * i + 3;\n yield return prime;\n for (int j = (prime * prime - 2) / 2; j < composite.Count; j += prime) {\n composite[j] = true;\n }\n }\n for (int i = limit; i < composite.Count; i++) {\n if (!composite[i]) yield return 2 * i + 3;\n }\n }\n\n private static IEnumerable<(T p1, T p2)> Pairwise<T>(this IEnumerable<T> source)\n {\n using var e = numbers.GetEnumerator();\n if (!e.MoveNext()) yield break;\n T p1 = e.Current;\n while (e.MoveNext()) {\n T p2 = e.Current;\n yield return (p1, p2);\n p1 = p2;\n }\n }\n}\n","language":"C-sharp"},{"code":"program Primes;\n\n{$APPTYPE CONSOLE}\n\n{$R *.res}\n\nuses\n System.SysUtils;\n\nfunction IsPrime(a: UInt64): Boolean;\nvar\n d: UInt64;\nbegin\n if (a < 2) then\n exit(False);\n\n if (a mod 2) = 0 then\n exit(a = 2);\n\n if (a mod 3) = 0 then\n exit(a = 3);\n\n d := 5;\n\n while (d * d <= a) do\n begin\n if (a mod d = 0) then\n Exit(false);\n inc(d, 2);\n\n if (a mod d = 0) then\n Exit(false);\n inc(d, 4);\n end;\n\n Result := True;\nend;\n\n\nfunction Sieve(limit: UInt64): TArray<Boolean>;\nvar\n p, p2, i: UInt64;\nbegin\n inc(limit);\n SetLength(Result, limit);\n FillChar(Result[2], sizeof(Boolean) * limit - 2, 0); // all false except 1,2\n FillChar(Result[0], sizeof(Boolean) * 2, 1); // 1,2 are true\n\n p := 3;\n while true do\n begin\n p2 := p * p;\n if p2 >= limit then\n break;\n\n i := p2;\n while i < limit do\n begin\n Result[i] := true;\n inc(i, 2 * p);\n end;\n\n while true do\n begin\n inc(p, 2);\n if not Result[p] then\n Break;\n end;\n end;\nend;\n\nfunction Commatize(const n: UInt64): string;\nvar\n str: string;\n digits: Integer;\n i: Integer;\nbegin\n Result := '';\n str := n.ToString;\n digits := str.Length;\n\n for i := 1 to digits do\n begin\n if ((i > 1) and (((i - 1) mod 3) = (digits mod 3))) then\n Result := Result + ',';\n Result := Result + str[i];\n end;\nend;\n\nvar\n limit, start, twins: UInt64;\n c: TArray<Boolean>;\n i, j: UInt64;\n\nbegin\n\n c := Sieve(Trunc(1e9 - 1));\n limit := 10;\n start := 3;\n twins := 0;\n for i := 1 to 9 do\n begin\n j := start;\n while j < limit do\n begin\n if (not c[j]) and (not c[j - 2]) then\n inc(twins);\n inc(j, 2);\n end;\n Writeln(Format('Under %14s there are %10s pairs of twin primes.', [commatize\n (limit), commatize(twins)]));\n\n start := limit + 1;\n limit := 10 * limit;\n end;\n\n readln;\n\nend.\n","language":"Delphi"},{"code":"fastfunc isprim num .\n if num mod 2 = 0 and num > 2\n return 0\n .\n i = 3\n while i <= sqrt num\n if num mod i = 0\n return 0\n .\n i += 2\n .\n return 1\n.\nfunc count limit .\n p2 = 1\n p3 = 1\n for i = 5 to limit\n p3 = p2\n p2 = p1\n p1 = isprim i\n if p3 = 1 and p1 = 1\n cnt += 1\n .\n .\n return cnt\n.\nn = 1\nfor i = 1 to 6\n n *= 10\n print \"twin prime pairs < \" & n & \" : \" & count n\n.\n","language":"EasyLang"},{"code":"printfn \"twin primes below 100000: %d\" (primes64()|>Seq.takeWhile(fun n->n<=100000L)|>Seq.pairwise|>Seq.filter(fun(n,g)->g=n+2L)|>Seq.length)\nprintfn \"twin primes below 1000000: %d\" (primes64()|>Seq.takeWhile(fun n->n<=1000000L)|>Seq.pairwise|>Seq.filter(fun(n,g)->g=n+2L)|>Seq.length)\nprintfn \"twin primes below 10000000: %d\" (primes64()|>Seq.takeWhile(fun n->n<=10000000L)|>Seq.pairwise|>Seq.filter(fun(n,g)->g=n+2L)|>Seq.length)\nprintfn \"twin primes below 100000000: %d\" (primes64()|>Seq.takeWhile(fun n->n<=100000000L)|>Seq.pairwise|>Seq.filter(fun(n,g)->g=n+2L)|>Seq.length)\nprintfn \"twin primes below 1000000000: %d\" (primes64()|>Seq.takeWhile(fun n->n<=1000000000L)|>Seq.pairwise|>Seq.filter(fun(n,g)->g=n+2L)|>Seq.length)\nprintfn \"twin primes below 10000000000: %d\" (primes64()|>Seq.takeWhile(fun n->n<=10000000000L)|>Seq.pairwise|>Seq.filter(fun(n,g)->g=n+2L)|>Seq.length)\nprintfn \"twin primes below 100000000000: %d\" (primes64()|>Seq.takeWhile(fun n->n<=100000000000L)|>Seq.pairwise|>Seq.filter(fun(n,g)->g=n+2L)|>Seq.length)\n","language":"F-Sharp"},{"code":"USING: io kernel math math.parser math.primes.erato math.ranges\nsequences tools.memory.private ;\n\n: twin-pair-count ( n -- count )\n [ 5 swap 2 <range> ] [ sieve ] bi\n [ over 2 - over [ marked-prime? ] 2bi@ and ] curry count ;\n\n\"Search size: \" write flush readln string>number\ntwin-pair-count commas write \" twin prime pairs.\" print\n","language":"Factor"},{"code":"Function isPrime(Byval ValorEval As Integer) As Boolean\n If ValorEval <=1 Then Return False\n For i As Integer = 2 To Int(Sqr(ValorEval))\n If ValorEval Mod i = 0 Then Return False\n Next i\n Return True\nEnd Function\n\nFunction paresDePrimos(limite As Uinteger) As Uinteger\n Dim As Uinteger p1 = 0, p2 = 1, p3 = 1, count = 0\n For i As Uinteger = 5 To limite\n p3 = p2\n p2 = p1\n p1 = isPrime(i)\n If (p3 And p1) Then count += 1\n Next i\n Return count\nEnd Function\n\nDim As Uinteger n = 1\nFor i As Byte = 1 To 6\n n *= 10\n Print Using \"pares de primos gemelos por debajo de < ####### : ####\"; n; paresDePrimos(n)\nNext i\nPrint !\"\\n--- terminado, pulsa RETURN---\"\nSleep\n","language":"FreeBASIC"},{"code":"upper = eval[input[\"Enter upper bound:\"]]\ncountTwins[upper]\ncountTwins[100000]\ncountTwins[10000000]\ncountTwins[1000000000]\n\ncountTwins[upper] :=\n{\n count = 0\n for n = primes[2, upper-2]\n if isPrime[n+2]\n count = count + 1\n\n println[\"$count twin primes under $upper\"]\n}\n","language":"Frink"},{"code":"package main\n\nimport \"fmt\"\n\nfunc sieve(limit uint64) []bool {\n limit++\n // True denotes composite, false denotes prime.\n c := make([]bool, limit) // all false by default\n c[0] = true\n c[1] = true\n // no need to bother with even numbers over 2 for this task\n p := uint64(3) // Start from 3.\n for {\n p2 := p * p\n if p2 >= limit {\n break\n }\n for i := p2; i < limit; i += 2 * p {\n c[i] = true\n }\n for {\n p += 2\n if !c[p] {\n break\n }\n }\n }\n return c\n}\n\nfunc commatize(n int) string {\n s := fmt.Sprintf(\"%d\", n)\n if n < 0 {\n s = s[1:]\n }\n le := len(s)\n for i := le - 3; i >= 1; i -= 3 {\n s = s[0:i] + \",\" + s[i:]\n }\n if n >= 0 {\n return s\n }\n return \"-\" + s\n}\n\nfunc main() {\n c := sieve(1e10 - 1)\n limit := 10\n start := 3\n twins := 0\n for i := 1; i < 11; i++ {\n for i := start; i < limit; i += 2 {\n if !c[i] && !c[i-2] {\n twins++\n }\n }\n fmt.Printf(\"Under %14s there are %10s pairs of twin primes.\\n\", commatize(limit), commatize(twins))\n start = limit + 1\n limit *= 10\n }\n}\n","language":"Go"},{"code":"package main\n\nimport (\n \"fmt\"\n \"github.com/jbarham/primegen.go\"\n)\n\nfunc main() {\n p := primegen.New()\n count := 0\n previous := uint64(0)\n power := 1\n limit := uint64(10)\n for {\n prime := p.Next()\n if prime >= limit {\n fmt.Printf(\"Number of twin prime pairs less than %d: %d\\n\", limit, count)\n power++\n if power > 10 {\n break\n }\n limit *= 10\n }\n if previous > 0 && prime == previous + 2 {\n count++\n }\n previous = prime\n }\n}\n","language":"Go"},{"code":"tp=: (_2 +/@:= 2 -/\\ i.&.(p:inv))\"0\n\nNB. i.&.(p:inv) generate a list of primes below the given limit\nNB. 2 -/\\ pairwise subtract adjacent primes (create a list of differences)\nNB. _2 +/@:= compare these differences to -2, and\nNB. sum up the resulting boolean list (get the number of twin pairs)\n","language":"J"},{"code":"import java.math.BigInteger;\nimport java.util.Scanner;\n\npublic class twinPrimes {\n public static void main(String[] args) {\n Scanner input = new Scanner(System.in);\n System.out.println(\"Search Size: \");\n BigInteger max = input.nextBigInteger();\n int counter = 0;\n for(BigInteger x = new BigInteger(\"3\"); x.compareTo(max) <= 0; x = x.add(BigInteger.ONE)){\n BigInteger sqrtNum = x.sqrt().add(BigInteger.ONE);\n if(x.add(BigInteger.TWO).compareTo(max) <= 0) {\n counter += findPrime(x.add(BigInteger.TWO), x.add(BigInteger.TWO).sqrt().add(BigInteger.ONE)) && findPrime(x, sqrtNum) ? 1 : 0;\n }\n }\n System.out.println(counter + \" twin prime pairs.\");\n }\n public static boolean findPrime(BigInteger x, BigInteger sqrtNum){\n for(BigInteger divisor = BigInteger.TWO; divisor.compareTo(sqrtNum) <= 0; divisor = divisor.add(BigInteger.ONE)){\n if(x.remainder(divisor).compareTo(BigInteger.ZERO) == 0){\n return false;\n }\n }\n return true;\n }\n}\n","language":"Java"},{"code":"import java.util.BitSet;\n\npublic final class TwinPrimes {\n\n\tpublic static void main(String[] args) {\n\t\tfinal int limit = 1_000_000_000;\n\t\tsievePrimes(limit);\n\t\t\n\t\tint target = 10;\n\t\tint count = 0;\n\t boolean last = false;\n\t boolean first = true;\n\t\n\t for ( int index = 5; index <= limit; index += 2 ) {\n\t last = first;\n\t first = primes.get(index);\n\t if ( last && first ) {\n\t count += 1;\n\t }\n\t if ( index + 1 == target ) {\n\t \tSystem.out.println(String.format(\"%8d%s%d\", count, \" twin primes below \", index + 1));\n\t \ttarget *= 10;\n\t }\n\t }\t\t\n\t}\t\n\t\n\tprivate static void sievePrimes(int aLimit) {\n\t\tprimes = new BitSet(aLimit + 1);\n\t\tprimes.set(2, aLimit + 1);\n\t\tfor ( int i = 2; i <= Math.sqrt(aLimit); i = primes.nextSetBit(i + 1) ) {\n\t\t\tfor ( int j = i * i; j <= aLimit; j += i ) {\n\t\t\t\tprimes.clear(j);\n\t\t\t}\n\t\t}\t\t\n\t}\n\t\n\tprivate static BitSet primes;\t\n\n}\n","language":"Java"},{"code":"def odd_gt2_is_prime:\n . as $n\n | if ($n % 3 == 0) then $n == 3\n elif ($n % 5 == 0) then $n == 5\n elif ($n % 7 == 0) then $n == 7\n elif ($n % 11 == 0) then $n == 11\n elif ($n % 13 == 0) then $n == 13\n elif ($n % 17 == 0) then $n == 17\n elif ($n % 19 == 0) then $n == 19\n else {i:23}\n | until( (.i * .i) > $n or ($n % .i == 0); .i += 2)\n\t | .i * .i > $n\n end;\n\ndef twin_primes($max):\n {count:0, i:3, isprime:true}\n | until(.i >= $max;\n .i += 2\n | if .isprime\n then if .i|odd_gt2_is_prime then .count+=1 else .isprime = false end\n else .isprime = (.i|odd_gt2_is_prime)\n\t end )\n | .count;\n\npow(10; range(1;8)) | \"Number of twin primes less than \\(.) is \\(twin_primes(.)).\"\n","language":"Jq"},{"code":"using Formatting, Primes\n\nfunction counttwinprimepairsbetween(n1, n2)\n npairs, t = 0, nextprime(n1)\n while t < n2\n p = nextprime(t + 1)\n if p - t == 2\n npairs += 1\n end\n t = p\n end\n return npairs\nend\n\nfor t2 in (10).^collect(2:8)\n paircount = counttwinprimepairsbetween(1, t2)\n println(\"Under\", lpad(format(t2, commas=true), 12), \" there are\",\n lpad(format(paircount, commas=true), 8), \" pairs of twin primes.\")\nend\n","language":"Julia"},{"code":"using Formatting, Primes\n\nconst PMAX = 1_000_000_000\nconst pmb = primesmask(PMAX)\nconst primestoabillion = [i for i in 2:PMAX if pmb[i]]\n\ntuplefitsat(k, tup, arr) = all(i -> arr[k + i] - arr[k] == tup[i], 1:length(tup))\n\nfunction countprimetuples(tup, n)\n arr = filter(i -> i <= n, primestoabillion)\n return count(k -> tuplefitsat(k, tup, arr), 1:length(arr) - length(tup))\nend\n\nprintln(\"Count of prime pairs from 1 to 1 billion: \",\n format(countprimetuples((2,), 1000000000), commas=true))\nprintln(\"Count of a form of prime quads from 1 to 1 million: \",\n format(countprimetuples((2, 6, 8), 1000000), commas=true))\nprintln(\"Count of a form of prime octets from 1 to 1 million: \",\n format(countprimetuples((2, 6, 12, 14, 20, 24, 26), 1000000), commas=true))\n","language":"Julia"},{"code":"import java.math.BigInteger\nimport java.util.*\n\nfun main() {\n val input = Scanner(System.`in`)\n println(\"Search Size: \")\n val max = input.nextBigInteger()\n var counter = 0\n var x = BigInteger(\"3\")\n while (x <= max) {\n val sqrtNum = x.sqrt().add(BigInteger.ONE)\n if (x.add(BigInteger.TWO) <= max) {\n counter += if (findPrime(\n x.add(BigInteger.TWO),\n x.add(BigInteger.TWO).sqrt().add(BigInteger.ONE)\n ) && findPrime(x, sqrtNum)\n ) 1 else 0\n }\n x = x.add(BigInteger.ONE)\n }\n println(\"$counter twin prime pairs.\")\n}\n\nfun findPrime(x: BigInteger, sqrtNum: BigInteger?): Boolean {\n var divisor = BigInteger.TWO\n while (divisor <= sqrtNum) {\n if (x.remainder(divisor).compareTo(BigInteger.ZERO) == 0) {\n return false\n }\n divisor = divisor.add(BigInteger.ONE)\n }\n return true\n}\n","language":"Kotlin"},{"code":"ClearAll[TwinPrimeCount]\nTwinPrimeCount[mx_] := Module[{pmax, min, max, total},\n pmax = PrimePi[mx];\n total = 0;\n Do[\n min = 10^6 i;\n min = Max[min, 1];\n max = 10^6 (i + 1);\n max = Min[max, pmax];\n total += Count[Differences[Prime[Range[min, max]]], 2]\n ,\n {i, 0, Ceiling[pmax/10^6]}\n ];\n total\n ]\nDo[Print[{10^i, TwinPrimeCount[10^i]}], {i, 9}]\n","language":"Mathematica"},{"code":"/* Function to count the number of pairs below n */\ntwin_primes_under_n(n):=block(\n L:makelist([6*i-1,6*i+1],i,1,floor(n/6)),\n caching:length(L),\n L1:[],\n for i from 1 thru caching do if map(primep,L[i])=[true,true] then push(L[i],L1),\n append([[3,5]],reverse(L1)),\n length(%%));\n\n/* Test cases */\ntwin_primes_under_n(10);\ntwin_primes_under_n(100);\ntwin_primes_under_n(1000);\ntwin_primes_under_n(10000);\ntwin_primes_under_n(100000);\n","language":"Maxima"},{"code":"import math, strformat, strutils\n\nconst N = 1_000_000_000\n\nproc sieve(n: Positive): seq[bool] =\n ## Build and fill a sieve of Erathosthenes.\n result.setLen(n + 1) # Default to false which means prime.\n result[0] = true\n result[1] = true\n for n in countup(3, sqrt(N.toFloat).int, 2):\n if not result[n]:\n for k in countup(n * n, N, 2 * n):\n result[k] = true\n\nlet composite = sieve(N)\n\nproc findTwins(composite: openArray[bool]) =\n var\n lim = 10\n count = 1 # Start with 3, 5 which is a special case.\n n = 7 # First prime congruent to 1 modulo 3.\n while true:\n if not composite[n] and not composite[n - 2]: inc count\n inc n, 6 # Next odd number congruent to 1 modulo 3.\n if n > lim:\n echo &\"There are {insertSep($count)} pairs of twin primes under {insertSep($lim)}.\"\n lim *= 10\n if lim > N: break\n\ncomposite.findTwins()\n","language":"Nim"},{"code":"use strict;\nuse warnings;\n\nuse Primesieve;\n\nsub comma { reverse ((reverse shift) =~ s/(.{3})/$1,/gr) =~ s/^,//r }\n\nprintf \"Twin prime pairs less than %14s: %s\\n\", comma(10**$_), comma count_twins(1, 10**$_) for 1..10;\n","language":"Perl"},{"code":"with javascript_semantics\natom t0 = time()\nfunction twin_primes(integer maxp, bool both=true)\n integer n = 0, -- result\n pn = 2, -- next prime index\n p, -- a prime, <= maxp\n prev_p = 2\n while true do\n p = get_prime(pn)\n if both and p>=maxp then exit end if\n n += (prev_p = p-2)\n if (not both) and p>=maxp then exit end if\n prev_p = p\n pn += 1\n end while\n return n\nend function\ninteger mp = 6 -- prompt_number(\"Enter limit:\")\nprintf(1,\"Twin prime pairs less than %,d: %,d\\n\",{mp,twin_primes(mp)})\nprintf(1,\"Twin prime pairs less than %,d: %,d\\n\",{mp,twin_primes(mp,false)})\nfor p=1 to 9 do\n integer p10 = power(10,p)\n printf(1,\"Twin prime pairs less than %,d: %,d\\n\",{p10,twin_primes(p10)})\nend for\n?elapsed(time()-t0)\n","language":"Phix"},{"code":"requires(WINDOWS)\nrequires(64,true)\ninclude builtins/primesieve.e\natom t0 = time()\ninteger n = 0, p = 2, prev_p = 2\nfunction twin_primes(integer maxp, bool both=true)\n while true do\n if both and p>=maxp then exit end if\n n += (prev_p = p-2)\n if (not both) and p>=maxp then exit end if\n prev_p = p\n p = primesieve_next_prime()\n end while\n return n\nend function\nfor i=1 to 11 do\n integer p10 = power(10,i)\n printf(1,\"Twin prime pairs less than %,d: %,d\\n\",{p10,twin_primes(p10)})\nend for\n?elapsed(time()-t0)\n","language":"Phix"},{"code":"Procedure isPrime(v.i)\n If v <= 1 : ProcedureReturn #False\n ElseIf v < 4 : ProcedureReturn #True\n ElseIf v % 2 = 0 : ProcedureReturn #False\n ElseIf v < 9 : ProcedureReturn #True\n ElseIf v % 3 = 0 : ProcedureReturn #False\n Else\n Protected r = Round(Sqr(v), #PB_Round_Down)\n Protected f = 5\n While f <= r\n If v % f = 0 Or v % (f + 2) = 0\n ProcedureReturn #False\n EndIf\n f + 6\n Wend\n EndIf\n ProcedureReturn #True\nEndProcedure\n\nProcedure paresDePrimos(limite.d)\n p1.i = 0\n p2.i = 1\n p3.i = 1\n count.i = 0\n For i.i = 5 To limite\n p3 = p2\n p2 = p1\n p1 = isPrime(i)\n If p3 And p1\n count + 1\n EndIf\n Next i\n ProcedureReturn count\nEndProcedure\n\nOpenConsole()\nn.i = 1\nFor i.i = 1 To 6\n n = n * 10\n PrintN(\"pares de primos gemelos por debajo de < \" + Str(n) + \" : \" + Str(paresDePrimos(n)))\nNext i\nPrintN(#CRLF$ + \"--- terminado, pulsa RETURN---\"): Input()\nCloseConsole()\nEnd\n","language":"PureBasic"},{"code":"primes = [2, 3, 5, 7, 11, 13, 17, 19]\n\n\ndef count_twin_primes(limit: int) -> int:\n global primes\n if limit > primes[-1]:\n ram_limit = primes[-1] + 90000000 - len(primes)\n reasonable_limit = min(limit, primes[-1] ** 2, ram_limit) - 1\n\n while reasonable_limit < limit:\n ram_limit = primes[-1] + 90000000 - len(primes)\n if ram_limit > primes[-1]:\n reasonable_limit = min(limit, primes[-1] ** 2, ram_limit)\n else:\n reasonable_limit = min(limit, primes[-1] ** 2)\n\n sieve = list({x for prime in primes for x in\n range(primes[-1] + prime - (primes[-1] % prime), reasonable_limit, prime)})\n primes += [x - 1 for i, x in enumerate(sieve) if i and x - 1 != sieve[i - 1] and x - 1 < limit]\n\n count = len([(x, y) for (x, y) in zip(primes, primes[1:]) if x + 2 == y])\n\n return count\n\n\ndef test(limit: int):\n count = count_twin_primes(limit)\n print(f\"Number of twin prime pairs less than {limit} is {count}\\n\")\n\n\ntest(10)\ntest(100)\ntest(1000)\ntest(10000)\ntest(100000)\ntest(1000000)\ntest(10000000)\ntest(100000000)\n","language":"Python"},{"code":" [ dup dip\n [ eratosthenes\n 0 1 primes share ]\n bit 1 - & 1 >>\n [ dup while\n dup 5 & 5 = if\n [ rot 1+ unrot ]\n 2 >>\n dip [ 2 + ]\n again ]\n 2drop ] is twinprimes ( n --> [ )\n\n 5 times\n [ say \"Number of twin primes below \"\n 10 i^ 1+ ** dup echo\n say \" is \"\n twinprimes echo say \".\" cr ]\n","language":"Quackery"},{"code":"use Lingua::EN::Numbers;\n\nuse Math::Primesieve;\n\nmy $p = Math::Primesieve.new;\n\nprintf \"Twin prime pairs less than %17s: %s\\n\", comma(10**$_), comma $p.count(10**$_, :twins) for 1 .. 12;\nsay (now - INIT now).round(.01) ~ ' seconds';\n","language":"Raku"},{"code":"/*REXX pgm counts the number of twin prime pairs under a specified number N (or a list).*/\nparse arg $ . /*get optional number of primes to find*/\nif $='' | $=\",\" then $= 10 100 1000 10000 100000 1000000 10000000 /*No $? Use default.*/\nw= length( commas( word($, words($) ) ) ) /*get length of the last number in list*/\n@found= ' twin prime pairs found under ' /*literal used in the showing of output*/\n\n do i=1 for words($); x= word($, i) /*process each N─limit in the $ list.*/\n say right( commas(genP(x)), 20) @found right(commas(x), max(length(x), w) )\n end /*i*/\nexit 0 /*stick a fork in it, we're all done. */\n/*──────────────────────────────────────────────────────────────────────────────────────*/\ncommas: parse arg _; do ?=length(_)-3 to 1 by -3; _=insert(',', _, ?); end; return _\n/*──────────────────────────────────────────────────────────────────────────────────────*/\ngenP: parse arg y; @.1=2; @.2=3; @.3=5; @.4=7; @.5=11; @.6=13; #= 6; tp= 2; sq.6= 169\n if y>10 then tp= tp+1\n do j=@.#+2 by 2 for max(0, y%2-@.#%2-1) /*find odd primes from here on. */\n parse var j '' -1 _ /*obtain the last digit of the J var.*/\n if _==5 then iterate; if j// 3==0 then iterate /*J ÷ by 5? J ÷ by 3? */\n if j//7==0 then iterate; if j//11==0 then iterate /*\" \" \" 7? \" \" \" 11? */\n /* [↓] divide by the primes. ___ */\n do k=6 to # while sq.k<=j /*divide J by other primes ≤ √ J */\n if j//@.k == 0 then iterate j /*÷ by prev. prime? ¬prime ___ */\n end /*k*/ /* [↑] only divide up to √ J */\n prev= @.#; #= #+1; sq.#= j*j; @.#= j /*save prev. P; bump # primes; assign P*/\n if j-2==prev then tp= tp + 1 /*This & previous prime twins? Bump TP.*/\n end /*j*/; return tp\n","language":"REXX"},{"code":"/*REXX pgm counts the number of twin prime pairs under a specified number N (or a list).*/\nparse arg $ . /*get optional number of primes to find*/\nif $='' | $=\",\" then $= 100 1000 10000 100000 1000000 10000000 /*No $? Use default.*/\nw= length( commas( word($, words($) ) ) ) /*get length of the last number in list*/\n@found= ' twin prime pairs found under ' /*literal used in the showing of output*/\n\n do i=1 for words($); x= word($, i) /*process each N─limit in the $ list.*/\n say right( commas(genP(x)), 20) @found right(commas(x), max(length(x), w) )\n end /*i*/\nexit 0 /*stick a fork in it, we're all done. */\n/*──────────────────────────────────────────────────────────────────────────────────────*/\ncommas: parse arg _; do ?=length(_)-3 to 1 by -3; _=insert(',', _, ?); end; return _\n/*──────────────────────────────────────────────────────────────────────────────────────*/\ngenP: arg y; _= 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 tp=8; #= words(_); sq.103=103*103 /*#: number of prims; TP: # twin pairs.*/\n do aa=1 for #; @.aa= word(_, aa) /*assign some low primes for quick ÷'s.*/\n end /*aa*/\n\n do j=@.#+2 by 2 while j<y /*continue with the next prime past 101*/\n parse var j '' -1 _ /*obtain the last digit of the J var.*/\n if _ ==5 then iterate /*is this integer a multiple of five? */\n if j//3 ==0 then iterate /* \" \" \" \" \" \" three? */\n\n do a=4 for 23 /*divide low primes starting with seven*/\n if j//@.a ==0 then iterate j /*is integer a multiple of a low prime?*/\n end /*a*/\n /* [↓] divide by the primes. ___ */\n do k=27 to # while sq.k<= j /*divide J by other primes ≤ √ J */\n if j//@.k ==0 then iterate j /*÷ by prev. prime? ¬prime ___ */\n end /*k*/ /* [↑] only divide up to √ J */\n prev= @.#; #= #+1; sq.#= j*j; @.#= j /*save prev. P; bump # primes; assign P*/\n if j-2==prev then tp= tp + 1 /*This & previous prime twins? Bump TP.*/\n end /*j*/; return tp\n","language":"REXX"},{"code":"load \"stdlib.ring\"\n\nlimit = list(7)\nfor n = 1 to 7\n limit[n] = pow(10,n)\nnext\n\nTwinPrimes = []\n\nfor n = 1 to limit[7]-2\n bool1 = isprime(n)\n bool2 = isprime(n+2)\n bool = bool1 and bool2\n if bool =1\n add(TwinPrimes,[n,n+2])\n ok\nnext\n\nnumTwin = list(7)\nlen = len(TwinPrimes)\n\nfor n = 1 to len\n for p = 1 to 6\n if TwinPrimes[n][2] < pow(10,p) and TwinPrimes[n+1][1] > pow(10,p)-2\n numTwin[p] = n\n ok\n next\nnext\n\nnumTwin[7] = len\n\nfor n = 1 to 7\n see \"Maximum: \" + pow(10,n) + nl\n see \"twin prime pairs below \" + pow(10,n) + \": \" + numTwin[n] + nl + nl\nnext\n","language":"Ring"},{"code":"require 'prime'\n\n(1..8).each do |n|\n count = Prime.each(10**n).each_cons(2).count{|p1, p2| p2-p1 == 2}\n puts \"Twin primes below 10**#{n}: #{count}\"\nend\n","language":"Ruby"},{"code":"// [dependencies]\n// primal = \"0.3\"\n// num-format = \"0.4\"\n\nuse num_format::{Locale, ToFormattedString};\n\nfn twin_prime_count_for_powers_of_ten(max_power: u32) {\n let mut count = 0;\n let mut previous = 0;\n let mut power = 1;\n let mut limit = 10;\n for prime in primal::Primes::all() {\n if prime > limit {\n println!(\n \"Number of twin prime pairs less than {} is {}\",\n limit.to_formatted_string(&Locale::en),\n count.to_formatted_string(&Locale::en)\n );\n limit *= 10;\n power += 1;\n if power > max_power {\n break;\n }\n }\n if previous > 0 && prime == previous + 2 {\n count += 1;\n }\n previous = prime;\n }\n}\n\nfn twin_prime_count(limit: usize) {\n let mut count = 0;\n let mut previous = 0;\n for prime in primal::Primes::all().take_while(|x| *x < limit) {\n if previous > 0 && prime == previous + 2 {\n count += 1;\n }\n previous = prime;\n }\n println!(\n \"Number of twin prime pairs less than {} is {}\",\n limit.to_formatted_string(&Locale::en),\n count.to_formatted_string(&Locale::en)\n );\n}\n\nfn main() {\n let args: Vec<String> = std::env::args().collect();\n if args.len() > 1 {\n for i in 1..args.len() {\n if let Ok(limit) = args[i].parse::<usize>() {\n twin_prime_count(limit);\n } else {\n eprintln!(\"Cannot parse limit from string {}\", args[i]);\n }\n }\n } else {\n twin_prime_count_for_powers_of_ten(10);\n }\n}\n","language":"Rust"},{"code":"func twin_primes_count(upto) {\n var count = 0\n var p1 = 2\n each_prime(3, upto, {|p2|\n if (p2 - p1 == 2) {\n ++count\n }\n p1 = p2\n })\n return count\n}\n\nfor n in (1..9) {\n var count = twin_primes_count(10**n)\n say \"There are #{count} twin primes <= 10^#{n}\"\n}\n","language":"Sidef"},{"code":"Function IsPrime(x As Long) As Boolean\n Dim i As Long\n If x Mod 2 = 0 Then\n Exit Function\n Else\n For i = 3 To Int(Sqr(x)) Step 2\n If x Mod i = 0 Then Exit Function\n Next i\n End If\n IsPrime = True\nEnd Function\n\nFunction TwinPrimePairs(max As Long) As Long\n Dim p1 As Boolean, p2 As Boolean, count As Long, i As Long\n p2 = True\n For i = 5 To max Step 2\n p1 = p2\n p2 = IsPrime(i)\n If p1 And p2 Then count = count + 1\n Next i\n TwinPrimePairs = count\nEnd Function\n\nSub Test(x As Long)\n Debug.Print \"Twin prime pairs below\" + Str(x) + \":\" + Str(TwinPrimePairs(x))\nEnd Sub\n\nSub Main()\n Test 10\n Test 100\n Test 1000\n Test 10000\n Test 100000\n Test 1000000\n Test 10000000\nEnd Sub\n","language":"Visual-Basic"},{"code":"import \"./math\" for Int\nimport \"./fmt\" for Fmt\n\nvar c = Int.primeSieve(1e8-1, false)\nvar limit = 10\nvar start = 3\nvar twins = 0\nfor (i in 1..8) {\n var j = start\n while (j < limit) {\n if (!c[j] && !c[j-2]) twins = twins + 1\n j = j + 2\n }\n Fmt.print(\"Under $,11d there are $,7d pairs of twin primes.\", limit, twins)\n start = limit + 1\n limit = limit * 10\n}\n","language":"Wren"},{"code":"func IsPrime(N); \\Return 'true' if N is prime\nint N, I;\n[if N <= 2 then return N = 2;\nif (N&1) = 0 then \\even >2\\ return false;\nfor I:= 3 to sqrt(N) do\n [if rem(N/I) = 0 then return false;\n I:= I+1;\n ];\nreturn true;\n];\n\nfunc Twins(Limit);\nint Limit, C, N;\n[C:= 0; N:= 3;\nrepeat if IsPrime(N) then\n loop [N:= N+2;\n if N >= Limit then return C;\n if not IsPrime(N) then quit;\n C:= C+1;\n ];\n N:= N+2;\nuntil N >= Limit;\nreturn C;\n];\n\n[IntOut(0, Twins(100_000)); CrLf(0);\n IntOut(0, Twins(10_000_000)); CrLf(0);\n IntOut(0, Twins(100_000_000)); CrLf(0);\n]\n","language":"XPL0"},{"code":"sub isPrime(v)\n if v < 2 then return False : fi\n if mod(v, 2) = 0 then return v = 2 : fi\n if mod(v, 3) = 0 then return v = 3 : fi\n d = 5\n while d * d <= v\n if mod(v, d) = 0 then return False else d = d + 2 : fi\n wend\n return True\nend sub\n\nsub paresDePrimos(limite)\n p1 = 0 : p2 = 1 : p3 = 1 : count = 0\n for i = 5 to limite\n p3 = p2\n p2 = p1\n p1 = isPrime(i)\n if (p3 and p1) then count = count + 1 : fi\n next i\n return count\nend sub\n\nn = 1\nfor i = 1 to 6\n n = n * 10\n print \"pares de primos gemelos por debajo de < \", n, \" : \", paresDePrimos(n)\nnext i\nend\n","language":"Yabasic"}],"string":"[\n {\n \"code\": \"---\\nfrom: http://rosettacode.org/wiki/Twin_primes\\nnote: Prime Numbers\\n\",\n \"language\": \"00-META\"\n },\n {\n \"code\": \"Twin primes are pairs of natural numbers (P<sub>1</sub> and P<sub>2</sub>) that satisfy the following:\\n\\n::# P<sub>1</sub> and P<sub>2</sub> are primes\\n::# P<sub>1</sub> + '''2''' = P<sub>2</sub>\\n\\n\\n;Task:\\nWrite a program that displays the number of <b>pairs of twin primes</b> that can be found <u>under</u> a user-specified number\\n<br>(P<sub>1</sub> < <i>user-specified number</i> & P<sub>2</sub> < <i>user-specified number</i>).\\n\\n\\n;Extension:\\n::# Find all twin prime pairs under 100000, 10000000 and 1000000000.\\n::# What is the time complexity of the program? Are there ways to reduce computation time?\\n\\n\\n;Examples:\\n<pre>\\n> Search Size: 100\\n> 8 twin prime pairs.\\n</pre>\\n\\n<pre>\\n> Search Size: 1000\\n> 35 twin prime pairs.\\n</pre>\\n\\n\\n;Also see:\\n* The OEIS entry: [[oeis:A001097|A001097: Twin primes]]. \\n* The OEIS entry: [[oeis:A167874|A167874: The number of distinct primes < 10^n which are members of twin-prime pairs]]. \\n* The OEIS entry: [[oeis:A077800|A077800: List of twin primes {p, p+2}, with repetition]]. \\n* The OEIS entry: [[oeis:A007508|A007508: Number of twin prime pairs below 10^n]]. \\n<br><br>\\n\\n\",\n \"language\": \"00-TASK\"\n },\n {\n \"code\": \"BEGIN\\n # count twin primes (where p and p - 2 are prime) #\\n PR heap=128M PR # set heap memory size for Algol 68G #\\n # sieve of Eratosthenes: sets s[i] to TRUE if i is a prime, FALSE otherwise #\\n PROC sieve = ( REF[]BOOL s )VOID:\\n BEGIN\\n FOR i TO UPB s DO s[ i ] := TRUE OD;\\n s[ 1 ] := FALSE;\\n FOR i FROM 2 TO ENTIER sqrt( UPB s ) DO\\n IF s[ i ] THEN FOR p FROM i * i BY i TO UPB s DO s[ p ] := FALSE OD FI\\n OD\\n END # sieve # ;\\n # find the maximum number to search for twin primes #\\n INT max;\\n print( ( \\\"Maximum: \\\" ) );\\n read( ( max, newline ) );\\n INT max number = max;\\n # construct a sieve of primes up to the maximum number #\\n [ 1 : max number ]BOOL primes;\\n sieve( primes );\\n # count the twin primes #\\n # note 2 cannot be one of the primes in a twin prime pair, so we start at 3 #\\n INT twin count := 0;\\n FOR p FROM 3 BY 2 TO max number - 1 DO IF primes[ p ] AND primes[ p - 2 ] THEN twin count +:= 1 FI OD;\\n print( ( \\\"twin prime pairs below \\\", whole( max number, 0 ), \\\": \\\", whole( twin count, 0 ), newline ) )\\nEND\\n\",\n \"language\": \"ALGOL-68\"\n },\n {\n \"code\": \" 0 INPUT \\\"SEARCH SIZE: \\\";S: FOR N = 1 TO S - 3 STEP 2:P = N: GOSUB 3: IF F THEN P = N + 2: GOSUB 3:C = C + F\\n 1 J = J + (N > 5): IF J = 3 THEN N = N + 4:J = 0\\n 2 NEXT N: PRINT C\\\" TWIN PRIME PAIRS.\\\": END\\n 3 F = 0: IF P < 2 THEN RETURN\\n 4 F = P = 2: IF F THEN RETURN\\n 5 F = P - INT (P / 2) * 2: IF NOT F THEN RETURN\\n 6 FOR B = 3 TO SQR (P) STEP 2: IF B > = P THEN NEXT B\\n 7 IF B > = P THEN RETURN\\n 8 F = 0: FOR I = B TO SQR (P) STEP 2: IF P - INT (P / I) * I = 0 THEN RETURN\\n 9 NEXT I:F = 1: RETURN\\n\",\n \"language\": \"Applesoft-BASIC\"\n },\n {\n \"code\": \"pairsOfPrimes: function [upperLim][\\n count: 0\\n j: 0\\n k: 1\\n i: 0\\n while [i=<upperLim][\\n i: (6 * k) - 1\\n j: i + 2\\n if and? [prime? i] [prime? j] [\\n count: count + 1\\n ]\\n k: k + 1\\n ]\\n return count + 1\\n]\\n\\nToNum: 10\\nwhile [ToNum =< 1000000][\\n x: pairsOfPrimes ToNum\\n print [\\\"From 2 to\\\" ToNum \\\": there are\\\" x \\\"pairs of twin primes\\\"]\\n ToNum: ToNum * 10\\n]\\n\",\n \"language\": \"Arturo\"\n },\n {\n \"code\": \"# syntax: GAWK -f TWIN_PRIMES.AWK\\nBEGIN {\\n n = 1\\n for (i=1; i<=6; i++) {\\n n *= 10\\n printf(\\\"twin prime pairs < %8s : %d\\\\n\\\",n,count_twin_primes(n))\\n }\\n exit(0)\\n}\\nfunction count_twin_primes(limit, count,i,p1,p2,p3) {\\n p1 = 0\\n p2 = p3 = 1\\n for (i=5; i<=limit; i++) {\\n p3 = p2\\n p2 = p1\\n p1 = is_prime(i)\\n if (p3 && p1) {\\n count++\\n }\\n }\\n return(count)\\n}\\nfunction is_prime(x, i) {\\n if (x <= 1) {\\n return(0)\\n }\\n for (i=2; i<=int(sqrt(x)); i++) {\\n if (x % i == 0) {\\n return(0)\\n }\\n }\\n return(1)\\n}\\n\",\n \"language\": \"AWK\"\n },\n {\n \"code\": \"function isPrime(v)\\n if v < 2 then return False\\n if v mod 2 = 0 then return v = 2\\n if v mod 3 = 0 then return v = 3\\n d = 5\\n while d * d <= v\\n if v mod d = 0 then return False else d += 2\\n end while\\n return True\\nend function\\n\\nfunction paresDePrimos(limite)\\n p1 = 0\\n p2 = 1\\n p3 = 1\\n cont = 0\\n for i = 5 to limite\\n p3 = p2\\n p2 = p1\\n p1 = isPrime(i)\\n if (p3 and p1) then cont += 1\\n next i\\n return cont\\nend function\\n\\nn = 1\\nfor i = 1 to 6\\n n = n * 10\\n print \\\"pares de primos gemelos por debajo de < \\\"; n; \\\" : \\\"; paresDePrimos(n)\\nnext i\\nend\\n\",\n \"language\": \"BASIC256\"\n },\n {\n \"code\": \"#include <stdbool.h>\\n#include <stdint.h>\\n#include <stdio.h>\\n\\nbool isPrime(int64_t n) {\\n int64_t i;\\n\\n if (n < 2) return false;\\n if (n % 2 == 0) return n == 2;\\n if (n % 3 == 0) return n == 3;\\n if (n % 5 == 0) return n == 5;\\n if (n % 7 == 0) return n == 7;\\n if (n % 11 == 0) return n == 11;\\n if (n % 13 == 0) return n == 13;\\n if (n % 17 == 0) return n == 17;\\n if (n % 19 == 0) return n == 19;\\n\\n for (i = 23; i * i <= n; i += 2) {\\n if (n % i == 0) return false;\\n }\\n\\n return true;\\n}\\n\\nint countTwinPrimes(int limit) {\\n int count = 0;\\n\\n // 2 3 4\\n int64_t p3 = true, p2 = true, p1 = false;\\n int64_t i;\\n\\n for (i = 5; i <= limit; i++) {\\n p3 = p2;\\n p2 = p1;\\n p1 = isPrime(i);\\n if (p3 && p1) {\\n count++;\\n }\\n }\\n return count;\\n}\\n\\nvoid test(int limit) {\\n int count = countTwinPrimes(limit);\\n printf(\\\"Number of twin prime pairs less than %d is %d\\\\n\\\", limit, count);\\n}\\n\\nint main() {\\n test(10);\\n test(100);\\n test(1000);\\n test(10000);\\n test(100000);\\n test(1000000);\\n test(10000000);\\n test(100000000);\\n return 0;\\n}\\n\",\n \"language\": \"C\"\n },\n {\n \"code\": \"#include <cstdint>\\n#include <iostream>\\n#include <string>\\n#include <primesieve.hpp>\\n\\nvoid print_twin_prime_count(long long limit) {\\n std::cout << \\\"Number of twin prime pairs less than \\\" << limit\\n << \\\" is \\\" << (limit > 0 ? primesieve::count_twins(0, limit - 1) : 0) << '\\\\n';\\n}\\n\\nint main(int argc, char** argv) {\\n std::cout.imbue(std::locale(\\\"\\\"));\\n if (argc > 1) {\\n // print number of twin prime pairs less than limits specified\\n // on the command line\\n for (int i = 1; i < argc; ++i) {\\n try {\\n print_twin_prime_count(std::stoll(argv[i]));\\n } catch (const std::exception& ex) {\\n std::cerr << \\\"Cannot parse limit from '\\\" << argv[i] << \\\"'\\\\n\\\";\\n }\\n }\\n } else {\\n // if no limit was specified then show the number of twin prime\\n // pairs less than powers of 10 up to 100 billion\\n uint64_t limit = 10;\\n for (int power = 1; power < 12; ++power, limit *= 10)\\n print_twin_prime_count(limit);\\n }\\n return 0;\\n}\\n\",\n \"language\": \"C++\"\n },\n {\n \"code\": \"#include <bitset>\\n#include <cstdint>\\n#include <iomanip>\\n#include <iostream>\\n#include <vector>\\n\\nconst uint32_t limit = 1'000'000'000;\\nstd::bitset<limit + 1> primes;\\n\\nvoid sieve_primes(uint32_t limit) {\\n\\tprimes.set();\\n\\tprimes.reset(0); primes.reset(1);\\n\\n\\tfor ( uint32_t p = 2; p * p <= limit; ++p ) {\\n\\t\\tif ( primes.test(p) ) {\\n\\t\\t\\tfor ( uint32_t i = p * p; i <= limit; i += p ) {\\n\\t\\t\\t\\tprimes.reset(i);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n}\\n\\nint main() {\\n\\tsieve_primes(limit);\\n\\n\\tuint32_t target = 10;\\n\\tuint32_t count = 0;\\n bool last = false;\\n bool first = true;\\n\\n for ( uint32_t index = 5; index <= limit; index += 2 ) {\\n last = first;\\n first = primes[index];\\n if ( last && first ) {\\n count += 1;\\n }\\n if ( index + 1 == target ) {\\n \\tstd::cout << std::setw(8) << count << \\\" twin primes below \\\" << index + 1 << std::endl;\\n \\ttarget *= 10;\\n }\\n }\\n}\\n\",\n \"language\": \"C++\"\n },\n {\n \"code\": \"using System;\\n\\nclass Program {\\n\\n static uint[] res = new uint[10];\\n static uint ri = 1, p = 10, count = 0;\\n\\n static void TabulateTwinPrimes(uint bound) {\\n if (bound < 5) return; count++;\\n uint cl = (bound - 1) >> 1, i = 1, j,\\n limit = (uint)(Math.Sqrt(bound) - 1) >> 1;\\n var comp = new bool[cl]; bool lp;\\n for (j = 3; j < cl; j += 3) comp[j] = true;\\n while (i < limit) {\\n if (lp = !comp[i]) {\\n uint pr = (i << 1) + 3;\\n for (j = (pr * pr - 2) >> 1; j < cl; j += pr)\\n comp[j] = true;\\n }\\n if (!comp[++i]) {\\n uint pr = (i << 1) + 3;\\n if (lp) {\\n if (pr > p) {\\n res[ri++] = count;\\n p *= 10;\\n }\\n count++;\\n i++;\\n }\\n for (j = (pr * pr - 2) >> 1; j < cl; j += pr)\\n comp[j] = true;\\n }\\n }\\n cl--;\\n while (i < cl) {\\n lp = !comp[i++];\\n if (!comp[i] && lp) {\\n if ((i++ << 1) + 3 > p) {\\n res[ri++] = count;\\n p *= 10;\\n }\\n count++;\\n }\\n }\\n res[ri] = count;\\n }\\n\\n static void Main(string[] args) {\\n var sw = System.Diagnostics.Stopwatch.StartNew();\\n string fmt = \\\"{0,9:n0} twin primes below {1,-13:n0}\\\";\\n TabulateTwinPrimes(1_000_000_000);\\n sw.Stop();\\n p = 1;\\n for (var j = 1; j <= ri; j++)\\n Console.WriteLine(fmt, res[j], p *= 10);\\n Console.Write(\\\"{0} sec\\\", sw.Elapsed.TotalSeconds);\\n }\\n}\\n\",\n \"language\": \"C-sharp\"\n },\n {\n \"code\": \"using System;\\nusing System.Linq;\\nusing System.Collections;\\nusing System.Collections.Generic;\\n\\npublic static class TwinPrimes\\n{\\n public static void Main()\\n {\\n CountTwinPrimes(Enumerable.Range(1, 9).Select(i => (int)Math.Pow(10, i)).ToArray());\\n }\\n\\n private static void CountTwinPrimes(params int[] bounds)\\n {\\n Array.Sort(bounds);\\n int b = 0;\\n int count = 0;\\n string format = \\\"There are {0:N0} twin primes below {1:N0}\\\";\\n foreach (var twin in FindTwinPrimes(bounds[^1])) {\\n if (twin.p2 >= bounds[b]) {\\n Console.WriteLine(format, count, bounds[b]);\\n b++;\\n }\\n count++;\\n }\\n Console.WriteLine(format, count, bounds[b]);\\n }\\n\\n private static IEnumerable<(int p1, int p2)> FindTwinPrimes(int bound) =>\\n PrimeSieve(bound).Pairwise().Where(pair => pair.p1 + 2 == pair.p2);\\n\\n private static IEnumerable<int> PrimeSieve(int bound)\\n {\\n if (bound < 2) yield break;\\n yield return 2;\\n\\n var composite = new BitArray((bound - 1) / 2);\\n int limit = (int)(Math.Sqrt(bound) - 1) / 2;\\n for (int i = 0; i < limit; i++) {\\n if (composite[i]) continue;\\n int prime = 2 * i + 3;\\n yield return prime;\\n for (int j = (prime * prime - 2) / 2; j < composite.Count; j += prime) {\\n composite[j] = true;\\n }\\n }\\n for (int i = limit; i < composite.Count; i++) {\\n if (!composite[i]) yield return 2 * i + 3;\\n }\\n }\\n\\n private static IEnumerable<(T p1, T p2)> Pairwise<T>(this IEnumerable<T> source)\\n {\\n using var e = numbers.GetEnumerator();\\n if (!e.MoveNext()) yield break;\\n T p1 = e.Current;\\n while (e.MoveNext()) {\\n T p2 = e.Current;\\n yield return (p1, p2);\\n p1 = p2;\\n }\\n }\\n}\\n\",\n \"language\": \"C-sharp\"\n },\n {\n \"code\": \"program Primes;\\n\\n{$APPTYPE CONSOLE}\\n\\n{$R *.res}\\n\\nuses\\n System.SysUtils;\\n\\nfunction IsPrime(a: UInt64): Boolean;\\nvar\\n d: UInt64;\\nbegin\\n if (a < 2) then\\n exit(False);\\n\\n if (a mod 2) = 0 then\\n exit(a = 2);\\n\\n if (a mod 3) = 0 then\\n exit(a = 3);\\n\\n d := 5;\\n\\n while (d * d <= a) do\\n begin\\n if (a mod d = 0) then\\n Exit(false);\\n inc(d, 2);\\n\\n if (a mod d = 0) then\\n Exit(false);\\n inc(d, 4);\\n end;\\n\\n Result := True;\\nend;\\n\\n\\nfunction Sieve(limit: UInt64): TArray<Boolean>;\\nvar\\n p, p2, i: UInt64;\\nbegin\\n inc(limit);\\n SetLength(Result, limit);\\n FillChar(Result[2], sizeof(Boolean) * limit - 2, 0); // all false except 1,2\\n FillChar(Result[0], sizeof(Boolean) * 2, 1); // 1,2 are true\\n\\n p := 3;\\n while true do\\n begin\\n p2 := p * p;\\n if p2 >= limit then\\n break;\\n\\n i := p2;\\n while i < limit do\\n begin\\n Result[i] := true;\\n inc(i, 2 * p);\\n end;\\n\\n while true do\\n begin\\n inc(p, 2);\\n if not Result[p] then\\n Break;\\n end;\\n end;\\nend;\\n\\nfunction Commatize(const n: UInt64): string;\\nvar\\n str: string;\\n digits: Integer;\\n i: Integer;\\nbegin\\n Result := '';\\n str := n.ToString;\\n digits := str.Length;\\n\\n for i := 1 to digits do\\n begin\\n if ((i > 1) and (((i - 1) mod 3) = (digits mod 3))) then\\n Result := Result + ',';\\n Result := Result + str[i];\\n end;\\nend;\\n\\nvar\\n limit, start, twins: UInt64;\\n c: TArray<Boolean>;\\n i, j: UInt64;\\n\\nbegin\\n\\n c := Sieve(Trunc(1e9 - 1));\\n limit := 10;\\n start := 3;\\n twins := 0;\\n for i := 1 to 9 do\\n begin\\n j := start;\\n while j < limit do\\n begin\\n if (not c[j]) and (not c[j - 2]) then\\n inc(twins);\\n inc(j, 2);\\n end;\\n Writeln(Format('Under %14s there are %10s pairs of twin primes.', [commatize\\n (limit), commatize(twins)]));\\n\\n start := limit + 1;\\n limit := 10 * limit;\\n end;\\n\\n readln;\\n\\nend.\\n\",\n \"language\": \"Delphi\"\n },\n {\n \"code\": \"fastfunc isprim num .\\n if num mod 2 = 0 and num > 2\\n return 0\\n .\\n i = 3\\n while i <= sqrt num\\n if num mod i = 0\\n return 0\\n .\\n i += 2\\n .\\n return 1\\n.\\nfunc count limit .\\n p2 = 1\\n p3 = 1\\n for i = 5 to limit\\n p3 = p2\\n p2 = p1\\n p1 = isprim i\\n if p3 = 1 and p1 = 1\\n cnt += 1\\n .\\n .\\n return cnt\\n.\\nn = 1\\nfor i = 1 to 6\\n n *= 10\\n print \\\"twin prime pairs < \\\" & n & \\\" : \\\" & count n\\n.\\n\",\n \"language\": \"EasyLang\"\n },\n {\n \"code\": \"printfn \\\"twin primes below 100000: %d\\\" (primes64()|>Seq.takeWhile(fun n->n<=100000L)|>Seq.pairwise|>Seq.filter(fun(n,g)->g=n+2L)|>Seq.length)\\nprintfn \\\"twin primes below 1000000: %d\\\" (primes64()|>Seq.takeWhile(fun n->n<=1000000L)|>Seq.pairwise|>Seq.filter(fun(n,g)->g=n+2L)|>Seq.length)\\nprintfn \\\"twin primes below 10000000: %d\\\" (primes64()|>Seq.takeWhile(fun n->n<=10000000L)|>Seq.pairwise|>Seq.filter(fun(n,g)->g=n+2L)|>Seq.length)\\nprintfn \\\"twin primes below 100000000: %d\\\" (primes64()|>Seq.takeWhile(fun n->n<=100000000L)|>Seq.pairwise|>Seq.filter(fun(n,g)->g=n+2L)|>Seq.length)\\nprintfn \\\"twin primes below 1000000000: %d\\\" (primes64()|>Seq.takeWhile(fun n->n<=1000000000L)|>Seq.pairwise|>Seq.filter(fun(n,g)->g=n+2L)|>Seq.length)\\nprintfn \\\"twin primes below 10000000000: %d\\\" (primes64()|>Seq.takeWhile(fun n->n<=10000000000L)|>Seq.pairwise|>Seq.filter(fun(n,g)->g=n+2L)|>Seq.length)\\nprintfn \\\"twin primes below 100000000000: %d\\\" (primes64()|>Seq.takeWhile(fun n->n<=100000000000L)|>Seq.pairwise|>Seq.filter(fun(n,g)->g=n+2L)|>Seq.length)\\n\",\n \"language\": \"F-Sharp\"\n },\n {\n \"code\": \"USING: io kernel math math.parser math.primes.erato math.ranges\\nsequences tools.memory.private ;\\n\\n: twin-pair-count ( n -- count )\\n [ 5 swap 2 <range> ] [ sieve ] bi\\n [ over 2 - over [ marked-prime? ] 2bi@ and ] curry count ;\\n\\n\\\"Search size: \\\" write flush readln string>number\\ntwin-pair-count commas write \\\" twin prime pairs.\\\" print\\n\",\n \"language\": \"Factor\"\n },\n {\n \"code\": \"Function isPrime(Byval ValorEval As Integer) As Boolean\\n If ValorEval <=1 Then Return False\\n For i As Integer = 2 To Int(Sqr(ValorEval))\\n If ValorEval Mod i = 0 Then Return False\\n Next i\\n Return True\\nEnd Function\\n\\nFunction paresDePrimos(limite As Uinteger) As Uinteger\\n Dim As Uinteger p1 = 0, p2 = 1, p3 = 1, count = 0\\n For i As Uinteger = 5 To limite\\n p3 = p2\\n p2 = p1\\n p1 = isPrime(i)\\n If (p3 And p1) Then count += 1\\n Next i\\n Return count\\nEnd Function\\n\\nDim As Uinteger n = 1\\nFor i As Byte = 1 To 6\\n n *= 10\\n Print Using \\\"pares de primos gemelos por debajo de < ####### : ####\\\"; n; paresDePrimos(n)\\nNext i\\nPrint !\\\"\\\\n--- terminado, pulsa RETURN---\\\"\\nSleep\\n\",\n \"language\": \"FreeBASIC\"\n },\n {\n \"code\": \"upper = eval[input[\\\"Enter upper bound:\\\"]]\\ncountTwins[upper]\\ncountTwins[100000]\\ncountTwins[10000000]\\ncountTwins[1000000000]\\n\\ncountTwins[upper] :=\\n{\\n count = 0\\n for n = primes[2, upper-2]\\n if isPrime[n+2]\\n count = count + 1\\n\\n println[\\\"$count twin primes under $upper\\\"]\\n}\\n\",\n \"language\": \"Frink\"\n },\n {\n \"code\": \"package main\\n\\nimport \\\"fmt\\\"\\n\\nfunc sieve(limit uint64) []bool {\\n limit++\\n // True denotes composite, false denotes prime.\\n c := make([]bool, limit) // all false by default\\n c[0] = true\\n c[1] = true\\n // no need to bother with even numbers over 2 for this task\\n p := uint64(3) // Start from 3.\\n for {\\n p2 := p * p\\n if p2 >= limit {\\n break\\n }\\n for i := p2; i < limit; i += 2 * p {\\n c[i] = true\\n }\\n for {\\n p += 2\\n if !c[p] {\\n break\\n }\\n }\\n }\\n return c\\n}\\n\\nfunc commatize(n int) string {\\n s := fmt.Sprintf(\\\"%d\\\", n)\\n if n < 0 {\\n s = s[1:]\\n }\\n le := len(s)\\n for i := le - 3; i >= 1; i -= 3 {\\n s = s[0:i] + \\\",\\\" + s[i:]\\n }\\n if n >= 0 {\\n return s\\n }\\n return \\\"-\\\" + s\\n}\\n\\nfunc main() {\\n c := sieve(1e10 - 1)\\n limit := 10\\n start := 3\\n twins := 0\\n for i := 1; i < 11; i++ {\\n for i := start; i < limit; i += 2 {\\n if !c[i] && !c[i-2] {\\n twins++\\n }\\n }\\n fmt.Printf(\\\"Under %14s there are %10s pairs of twin primes.\\\\n\\\", commatize(limit), commatize(twins))\\n start = limit + 1\\n limit *= 10\\n }\\n}\\n\",\n \"language\": \"Go\"\n },\n {\n \"code\": \"package main\\n\\nimport (\\n \\\"fmt\\\"\\n \\\"github.com/jbarham/primegen.go\\\"\\n)\\n\\nfunc main() {\\n p := primegen.New()\\n count := 0\\n previous := uint64(0)\\n power := 1\\n limit := uint64(10)\\n for {\\n prime := p.Next()\\n if prime >= limit {\\n fmt.Printf(\\\"Number of twin prime pairs less than %d: %d\\\\n\\\", limit, count)\\n power++\\n if power > 10 {\\n break\\n }\\n limit *= 10\\n }\\n if previous > 0 && prime == previous + 2 {\\n count++\\n }\\n previous = prime\\n }\\n}\\n\",\n \"language\": \"Go\"\n },\n {\n \"code\": \"tp=: (_2 +/@:= 2 -/\\\\ i.&.(p:inv))\\\"0\\n\\nNB. i.&.(p:inv) generate a list of primes below the given limit\\nNB. 2 -/\\\\ pairwise subtract adjacent primes (create a list of differences)\\nNB. _2 +/@:= compare these differences to -2, and\\nNB. sum up the resulting boolean list (get the number of twin pairs)\\n\",\n \"language\": \"J\"\n },\n {\n \"code\": \"import java.math.BigInteger;\\nimport java.util.Scanner;\\n\\npublic class twinPrimes {\\n public static void main(String[] args) {\\n Scanner input = new Scanner(System.in);\\n System.out.println(\\\"Search Size: \\\");\\n BigInteger max = input.nextBigInteger();\\n int counter = 0;\\n for(BigInteger x = new BigInteger(\\\"3\\\"); x.compareTo(max) <= 0; x = x.add(BigInteger.ONE)){\\n BigInteger sqrtNum = x.sqrt().add(BigInteger.ONE);\\n if(x.add(BigInteger.TWO).compareTo(max) <= 0) {\\n counter += findPrime(x.add(BigInteger.TWO), x.add(BigInteger.TWO).sqrt().add(BigInteger.ONE)) && findPrime(x, sqrtNum) ? 1 : 0;\\n }\\n }\\n System.out.println(counter + \\\" twin prime pairs.\\\");\\n }\\n public static boolean findPrime(BigInteger x, BigInteger sqrtNum){\\n for(BigInteger divisor = BigInteger.TWO; divisor.compareTo(sqrtNum) <= 0; divisor = divisor.add(BigInteger.ONE)){\\n if(x.remainder(divisor).compareTo(BigInteger.ZERO) == 0){\\n return false;\\n }\\n }\\n return true;\\n }\\n}\\n\",\n \"language\": \"Java\"\n },\n {\n \"code\": \"import java.util.BitSet;\\n\\npublic final class TwinPrimes {\\n\\n\\tpublic static void main(String[] args) {\\n\\t\\tfinal int limit = 1_000_000_000;\\n\\t\\tsievePrimes(limit);\\n\\t\\t\\n\\t\\tint target = 10;\\n\\t\\tint count = 0;\\n\\t boolean last = false;\\n\\t boolean first = true;\\n\\t\\n\\t for ( int index = 5; index <= limit; index += 2 ) {\\n\\t last = first;\\n\\t first = primes.get(index);\\n\\t if ( last && first ) {\\n\\t count += 1;\\n\\t }\\n\\t if ( index + 1 == target ) {\\n\\t \\tSystem.out.println(String.format(\\\"%8d%s%d\\\", count, \\\" twin primes below \\\", index + 1));\\n\\t \\ttarget *= 10;\\n\\t }\\n\\t }\\t\\t\\n\\t}\\t\\n\\t\\n\\tprivate static void sievePrimes(int aLimit) {\\n\\t\\tprimes = new BitSet(aLimit + 1);\\n\\t\\tprimes.set(2, aLimit + 1);\\n\\t\\tfor ( int i = 2; i <= Math.sqrt(aLimit); i = primes.nextSetBit(i + 1) ) {\\n\\t\\t\\tfor ( int j = i * i; j <= aLimit; j += i ) {\\n\\t\\t\\t\\tprimes.clear(j);\\n\\t\\t\\t}\\n\\t\\t}\\t\\t\\n\\t}\\n\\t\\n\\tprivate static BitSet primes;\\t\\n\\n}\\n\",\n \"language\": \"Java\"\n },\n {\n \"code\": \"def odd_gt2_is_prime:\\n . as $n\\n | if ($n % 3 == 0) then $n == 3\\n elif ($n % 5 == 0) then $n == 5\\n elif ($n % 7 == 0) then $n == 7\\n elif ($n % 11 == 0) then $n == 11\\n elif ($n % 13 == 0) then $n == 13\\n elif ($n % 17 == 0) then $n == 17\\n elif ($n % 19 == 0) then $n == 19\\n else {i:23}\\n | until( (.i * .i) > $n or ($n % .i == 0); .i += 2)\\n\\t | .i * .i > $n\\n end;\\n\\ndef twin_primes($max):\\n {count:0, i:3, isprime:true}\\n | until(.i >= $max;\\n .i += 2\\n | if .isprime\\n then if .i|odd_gt2_is_prime then .count+=1 else .isprime = false end\\n else .isprime = (.i|odd_gt2_is_prime)\\n\\t end )\\n | .count;\\n\\npow(10; range(1;8)) | \\\"Number of twin primes less than \\\\(.) is \\\\(twin_primes(.)).\\\"\\n\",\n \"language\": \"Jq\"\n },\n {\n \"code\": \"using Formatting, Primes\\n\\nfunction counttwinprimepairsbetween(n1, n2)\\n npairs, t = 0, nextprime(n1)\\n while t < n2\\n p = nextprime(t + 1)\\n if p - t == 2\\n npairs += 1\\n end\\n t = p\\n end\\n return npairs\\nend\\n\\nfor t2 in (10).^collect(2:8)\\n paircount = counttwinprimepairsbetween(1, t2)\\n println(\\\"Under\\\", lpad(format(t2, commas=true), 12), \\\" there are\\\",\\n lpad(format(paircount, commas=true), 8), \\\" pairs of twin primes.\\\")\\nend\\n\",\n \"language\": \"Julia\"\n },\n {\n \"code\": \"using Formatting, Primes\\n\\nconst PMAX = 1_000_000_000\\nconst pmb = primesmask(PMAX)\\nconst primestoabillion = [i for i in 2:PMAX if pmb[i]]\\n\\ntuplefitsat(k, tup, arr) = all(i -> arr[k + i] - arr[k] == tup[i], 1:length(tup))\\n\\nfunction countprimetuples(tup, n)\\n arr = filter(i -> i <= n, primestoabillion)\\n return count(k -> tuplefitsat(k, tup, arr), 1:length(arr) - length(tup))\\nend\\n\\nprintln(\\\"Count of prime pairs from 1 to 1 billion: \\\",\\n format(countprimetuples((2,), 1000000000), commas=true))\\nprintln(\\\"Count of a form of prime quads from 1 to 1 million: \\\",\\n format(countprimetuples((2, 6, 8), 1000000), commas=true))\\nprintln(\\\"Count of a form of prime octets from 1 to 1 million: \\\",\\n format(countprimetuples((2, 6, 12, 14, 20, 24, 26), 1000000), commas=true))\\n\",\n \"language\": \"Julia\"\n },\n {\n \"code\": \"import java.math.BigInteger\\nimport java.util.*\\n\\nfun main() {\\n val input = Scanner(System.`in`)\\n println(\\\"Search Size: \\\")\\n val max = input.nextBigInteger()\\n var counter = 0\\n var x = BigInteger(\\\"3\\\")\\n while (x <= max) {\\n val sqrtNum = x.sqrt().add(BigInteger.ONE)\\n if (x.add(BigInteger.TWO) <= max) {\\n counter += if (findPrime(\\n x.add(BigInteger.TWO),\\n x.add(BigInteger.TWO).sqrt().add(BigInteger.ONE)\\n ) && findPrime(x, sqrtNum)\\n ) 1 else 0\\n }\\n x = x.add(BigInteger.ONE)\\n }\\n println(\\\"$counter twin prime pairs.\\\")\\n}\\n\\nfun findPrime(x: BigInteger, sqrtNum: BigInteger?): Boolean {\\n var divisor = BigInteger.TWO\\n while (divisor <= sqrtNum) {\\n if (x.remainder(divisor).compareTo(BigInteger.ZERO) == 0) {\\n return false\\n }\\n divisor = divisor.add(BigInteger.ONE)\\n }\\n return true\\n}\\n\",\n \"language\": \"Kotlin\"\n },\n {\n \"code\": \"ClearAll[TwinPrimeCount]\\nTwinPrimeCount[mx_] := Module[{pmax, min, max, total},\\n pmax = PrimePi[mx];\\n total = 0;\\n Do[\\n min = 10^6 i;\\n min = Max[min, 1];\\n max = 10^6 (i + 1);\\n max = Min[max, pmax];\\n total += Count[Differences[Prime[Range[min, max]]], 2]\\n ,\\n {i, 0, Ceiling[pmax/10^6]}\\n ];\\n total\\n ]\\nDo[Print[{10^i, TwinPrimeCount[10^i]}], {i, 9}]\\n\",\n \"language\": \"Mathematica\"\n },\n {\n \"code\": \"/* Function to count the number of pairs below n */\\ntwin_primes_under_n(n):=block(\\n L:makelist([6*i-1,6*i+1],i,1,floor(n/6)),\\n caching:length(L),\\n L1:[],\\n for i from 1 thru caching do if map(primep,L[i])=[true,true] then push(L[i],L1),\\n append([[3,5]],reverse(L1)),\\n length(%%));\\n\\n/* Test cases */\\ntwin_primes_under_n(10);\\ntwin_primes_under_n(100);\\ntwin_primes_under_n(1000);\\ntwin_primes_under_n(10000);\\ntwin_primes_under_n(100000);\\n\",\n \"language\": \"Maxima\"\n },\n {\n \"code\": \"import math, strformat, strutils\\n\\nconst N = 1_000_000_000\\n\\nproc sieve(n: Positive): seq[bool] =\\n ## Build and fill a sieve of Erathosthenes.\\n result.setLen(n + 1) # Default to false which means prime.\\n result[0] = true\\n result[1] = true\\n for n in countup(3, sqrt(N.toFloat).int, 2):\\n if not result[n]:\\n for k in countup(n * n, N, 2 * n):\\n result[k] = true\\n\\nlet composite = sieve(N)\\n\\nproc findTwins(composite: openArray[bool]) =\\n var\\n lim = 10\\n count = 1 # Start with 3, 5 which is a special case.\\n n = 7 # First prime congruent to 1 modulo 3.\\n while true:\\n if not composite[n] and not composite[n - 2]: inc count\\n inc n, 6 # Next odd number congruent to 1 modulo 3.\\n if n > lim:\\n echo &\\\"There are {insertSep($count)} pairs of twin primes under {insertSep($lim)}.\\\"\\n lim *= 10\\n if lim > N: break\\n\\ncomposite.findTwins()\\n\",\n \"language\": \"Nim\"\n },\n {\n \"code\": \"use strict;\\nuse warnings;\\n\\nuse Primesieve;\\n\\nsub comma { reverse ((reverse shift) =~ s/(.{3})/$1,/gr) =~ s/^,//r }\\n\\nprintf \\\"Twin prime pairs less than %14s: %s\\\\n\\\", comma(10**$_), comma count_twins(1, 10**$_) for 1..10;\\n\",\n \"language\": \"Perl\"\n },\n {\n \"code\": \"with javascript_semantics\\natom t0 = time()\\nfunction twin_primes(integer maxp, bool both=true)\\n integer n = 0, -- result\\n pn = 2, -- next prime index\\n p, -- a prime, <= maxp\\n prev_p = 2\\n while true do\\n p = get_prime(pn)\\n if both and p>=maxp then exit end if\\n n += (prev_p = p-2)\\n if (not both) and p>=maxp then exit end if\\n prev_p = p\\n pn += 1\\n end while\\n return n\\nend function\\ninteger mp = 6 -- prompt_number(\\\"Enter limit:\\\")\\nprintf(1,\\\"Twin prime pairs less than %,d: %,d\\\\n\\\",{mp,twin_primes(mp)})\\nprintf(1,\\\"Twin prime pairs less than %,d: %,d\\\\n\\\",{mp,twin_primes(mp,false)})\\nfor p=1 to 9 do\\n integer p10 = power(10,p)\\n printf(1,\\\"Twin prime pairs less than %,d: %,d\\\\n\\\",{p10,twin_primes(p10)})\\nend for\\n?elapsed(time()-t0)\\n\",\n \"language\": \"Phix\"\n },\n {\n \"code\": \"requires(WINDOWS)\\nrequires(64,true)\\ninclude builtins/primesieve.e\\natom t0 = time()\\ninteger n = 0, p = 2, prev_p = 2\\nfunction twin_primes(integer maxp, bool both=true)\\n while true do\\n if both and p>=maxp then exit end if\\n n += (prev_p = p-2)\\n if (not both) and p>=maxp then exit end if\\n prev_p = p\\n p = primesieve_next_prime()\\n end while\\n return n\\nend function\\nfor i=1 to 11 do\\n integer p10 = power(10,i)\\n printf(1,\\\"Twin prime pairs less than %,d: %,d\\\\n\\\",{p10,twin_primes(p10)})\\nend for\\n?elapsed(time()-t0)\\n\",\n \"language\": \"Phix\"\n },\n {\n \"code\": \"Procedure isPrime(v.i)\\n If v <= 1 : ProcedureReturn #False\\n ElseIf v < 4 : ProcedureReturn #True\\n ElseIf v % 2 = 0 : ProcedureReturn #False\\n ElseIf v < 9 : ProcedureReturn #True\\n ElseIf v % 3 = 0 : ProcedureReturn #False\\n Else\\n Protected r = Round(Sqr(v), #PB_Round_Down)\\n Protected f = 5\\n While f <= r\\n If v % f = 0 Or v % (f + 2) = 0\\n ProcedureReturn #False\\n EndIf\\n f + 6\\n Wend\\n EndIf\\n ProcedureReturn #True\\nEndProcedure\\n\\nProcedure paresDePrimos(limite.d)\\n p1.i = 0\\n p2.i = 1\\n p3.i = 1\\n count.i = 0\\n For i.i = 5 To limite\\n p3 = p2\\n p2 = p1\\n p1 = isPrime(i)\\n If p3 And p1\\n count + 1\\n EndIf\\n Next i\\n ProcedureReturn count\\nEndProcedure\\n\\nOpenConsole()\\nn.i = 1\\nFor i.i = 1 To 6\\n n = n * 10\\n PrintN(\\\"pares de primos gemelos por debajo de < \\\" + Str(n) + \\\" : \\\" + Str(paresDePrimos(n)))\\nNext i\\nPrintN(#CRLF$ + \\\"--- terminado, pulsa RETURN---\\\"): Input()\\nCloseConsole()\\nEnd\\n\",\n \"language\": \"PureBasic\"\n },\n {\n \"code\": \"primes = [2, 3, 5, 7, 11, 13, 17, 19]\\n\\n\\ndef count_twin_primes(limit: int) -> int:\\n global primes\\n if limit > primes[-1]:\\n ram_limit = primes[-1] + 90000000 - len(primes)\\n reasonable_limit = min(limit, primes[-1] ** 2, ram_limit) - 1\\n\\n while reasonable_limit < limit:\\n ram_limit = primes[-1] + 90000000 - len(primes)\\n if ram_limit > primes[-1]:\\n reasonable_limit = min(limit, primes[-1] ** 2, ram_limit)\\n else:\\n reasonable_limit = min(limit, primes[-1] ** 2)\\n\\n sieve = list({x for prime in primes for x in\\n range(primes[-1] + prime - (primes[-1] % prime), reasonable_limit, prime)})\\n primes += [x - 1 for i, x in enumerate(sieve) if i and x - 1 != sieve[i - 1] and x - 1 < limit]\\n\\n count = len([(x, y) for (x, y) in zip(primes, primes[1:]) if x + 2 == y])\\n\\n return count\\n\\n\\ndef test(limit: int):\\n count = count_twin_primes(limit)\\n print(f\\\"Number of twin prime pairs less than {limit} is {count}\\\\n\\\")\\n\\n\\ntest(10)\\ntest(100)\\ntest(1000)\\ntest(10000)\\ntest(100000)\\ntest(1000000)\\ntest(10000000)\\ntest(100000000)\\n\",\n \"language\": \"Python\"\n },\n {\n \"code\": \" [ dup dip\\n [ eratosthenes\\n 0 1 primes share ]\\n bit 1 - & 1 >>\\n [ dup while\\n dup 5 & 5 = if\\n [ rot 1+ unrot ]\\n 2 >>\\n dip [ 2 + ]\\n again ]\\n 2drop ] is twinprimes ( n --> [ )\\n\\n 5 times\\n [ say \\\"Number of twin primes below \\\"\\n 10 i^ 1+ ** dup echo\\n say \\\" is \\\"\\n twinprimes echo say \\\".\\\" cr ]\\n\",\n \"language\": \"Quackery\"\n },\n {\n \"code\": \"use Lingua::EN::Numbers;\\n\\nuse Math::Primesieve;\\n\\nmy $p = Math::Primesieve.new;\\n\\nprintf \\\"Twin prime pairs less than %17s: %s\\\\n\\\", comma(10**$_), comma $p.count(10**$_, :twins) for 1 .. 12;\\nsay (now - INIT now).round(.01) ~ ' seconds';\\n\",\n \"language\": \"Raku\"\n },\n {\n \"code\": \"/*REXX pgm counts the number of twin prime pairs under a specified number N (or a list).*/\\nparse arg $ . /*get optional number of primes to find*/\\nif $='' | $=\\\",\\\" then $= 10 100 1000 10000 100000 1000000 10000000 /*No $? Use default.*/\\nw= length( commas( word($, words($) ) ) ) /*get length of the last number in list*/\\n@found= ' twin prime pairs found under ' /*literal used in the showing of output*/\\n\\n do i=1 for words($); x= word($, i) /*process each N─limit in the $ list.*/\\n say right( commas(genP(x)), 20) @found right(commas(x), max(length(x), w) )\\n end /*i*/\\nexit 0 /*stick a fork in it, we're all done. */\\n/*──────────────────────────────────────────────────────────────────────────────────────*/\\ncommas: parse arg _; do ?=length(_)-3 to 1 by -3; _=insert(',', _, ?); end; return _\\n/*──────────────────────────────────────────────────────────────────────────────────────*/\\ngenP: parse arg y; @.1=2; @.2=3; @.3=5; @.4=7; @.5=11; @.6=13; #= 6; tp= 2; sq.6= 169\\n if y>10 then tp= tp+1\\n do j=@.#+2 by 2 for max(0, y%2-@.#%2-1) /*find odd primes from here on. */\\n parse var j '' -1 _ /*obtain the last digit of the J var.*/\\n if _==5 then iterate; if j// 3==0 then iterate /*J ÷ by 5? J ÷ by 3? */\\n if j//7==0 then iterate; if j//11==0 then iterate /*\\\" \\\" \\\" 7? \\\" \\\" \\\" 11? */\\n /* [↓] divide by the primes. ___ */\\n do k=6 to # while sq.k<=j /*divide J by other primes ≤ √ J */\\n if j//@.k == 0 then iterate j /*÷ by prev. prime? ¬prime ___ */\\n end /*k*/ /* [↑] only divide up to √ J */\\n prev= @.#; #= #+1; sq.#= j*j; @.#= j /*save prev. P; bump # primes; assign P*/\\n if j-2==prev then tp= tp + 1 /*This & previous prime twins? Bump TP.*/\\n end /*j*/; return tp\\n\",\n \"language\": \"REXX\"\n },\n {\n \"code\": \"/*REXX pgm counts the number of twin prime pairs under a specified number N (or a list).*/\\nparse arg $ . /*get optional number of primes to find*/\\nif $='' | $=\\\",\\\" then $= 100 1000 10000 100000 1000000 10000000 /*No $? Use default.*/\\nw= length( commas( word($, words($) ) ) ) /*get length of the last number in list*/\\n@found= ' twin prime pairs found under ' /*literal used in the showing of output*/\\n\\n do i=1 for words($); x= word($, i) /*process each N─limit in the $ list.*/\\n say right( commas(genP(x)), 20) @found right(commas(x), max(length(x), w) )\\n end /*i*/\\nexit 0 /*stick a fork in it, we're all done. */\\n/*──────────────────────────────────────────────────────────────────────────────────────*/\\ncommas: parse arg _; do ?=length(_)-3 to 1 by -3; _=insert(',', _, ?); end; return _\\n/*──────────────────────────────────────────────────────────────────────────────────────*/\\ngenP: arg y; _= 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 tp=8; #= words(_); sq.103=103*103 /*#: number of prims; TP: # twin pairs.*/\\n do aa=1 for #; @.aa= word(_, aa) /*assign some low primes for quick ÷'s.*/\\n end /*aa*/\\n\\n do j=@.#+2 by 2 while j<y /*continue with the next prime past 101*/\\n parse var j '' -1 _ /*obtain the last digit of the J var.*/\\n if _ ==5 then iterate /*is this integer a multiple of five? */\\n if j//3 ==0 then iterate /* \\\" \\\" \\\" \\\" \\\" \\\" three? */\\n\\n do a=4 for 23 /*divide low primes starting with seven*/\\n if j//@.a ==0 then iterate j /*is integer a multiple of a low prime?*/\\n end /*a*/\\n /* [↓] divide by the primes. ___ */\\n do k=27 to # while sq.k<= j /*divide J by other primes ≤ √ J */\\n if j//@.k ==0 then iterate j /*÷ by prev. prime? ¬prime ___ */\\n end /*k*/ /* [↑] only divide up to √ J */\\n prev= @.#; #= #+1; sq.#= j*j; @.#= j /*save prev. P; bump # primes; assign P*/\\n if j-2==prev then tp= tp + 1 /*This & previous prime twins? Bump TP.*/\\n end /*j*/; return tp\\n\",\n \"language\": \"REXX\"\n },\n {\n \"code\": \"load \\\"stdlib.ring\\\"\\n\\nlimit = list(7)\\nfor n = 1 to 7\\n limit[n] = pow(10,n)\\nnext\\n\\nTwinPrimes = []\\n\\nfor n = 1 to limit[7]-2\\n bool1 = isprime(n)\\n bool2 = isprime(n+2)\\n bool = bool1 and bool2\\n if bool =1\\n add(TwinPrimes,[n,n+2])\\n ok\\nnext\\n\\nnumTwin = list(7)\\nlen = len(TwinPrimes)\\n\\nfor n = 1 to len\\n for p = 1 to 6\\n if TwinPrimes[n][2] < pow(10,p) and TwinPrimes[n+1][1] > pow(10,p)-2\\n numTwin[p] = n\\n ok\\n next\\nnext\\n\\nnumTwin[7] = len\\n\\nfor n = 1 to 7\\n see \\\"Maximum: \\\" + pow(10,n) + nl\\n see \\\"twin prime pairs below \\\" + pow(10,n) + \\\": \\\" + numTwin[n] + nl + nl\\nnext\\n\",\n \"language\": \"Ring\"\n },\n {\n \"code\": \"require 'prime'\\n\\n(1..8).each do |n|\\n count = Prime.each(10**n).each_cons(2).count{|p1, p2| p2-p1 == 2}\\n puts \\\"Twin primes below 10**#{n}: #{count}\\\"\\nend\\n\",\n \"language\": \"Ruby\"\n },\n {\n \"code\": \"// [dependencies]\\n// primal = \\\"0.3\\\"\\n// num-format = \\\"0.4\\\"\\n\\nuse num_format::{Locale, ToFormattedString};\\n\\nfn twin_prime_count_for_powers_of_ten(max_power: u32) {\\n let mut count = 0;\\n let mut previous = 0;\\n let mut power = 1;\\n let mut limit = 10;\\n for prime in primal::Primes::all() {\\n if prime > limit {\\n println!(\\n \\\"Number of twin prime pairs less than {} is {}\\\",\\n limit.to_formatted_string(&Locale::en),\\n count.to_formatted_string(&Locale::en)\\n );\\n limit *= 10;\\n power += 1;\\n if power > max_power {\\n break;\\n }\\n }\\n if previous > 0 && prime == previous + 2 {\\n count += 1;\\n }\\n previous = prime;\\n }\\n}\\n\\nfn twin_prime_count(limit: usize) {\\n let mut count = 0;\\n let mut previous = 0;\\n for prime in primal::Primes::all().take_while(|x| *x < limit) {\\n if previous > 0 && prime == previous + 2 {\\n count += 1;\\n }\\n previous = prime;\\n }\\n println!(\\n \\\"Number of twin prime pairs less than {} is {}\\\",\\n limit.to_formatted_string(&Locale::en),\\n count.to_formatted_string(&Locale::en)\\n );\\n}\\n\\nfn main() {\\n let args: Vec<String> = std::env::args().collect();\\n if args.len() > 1 {\\n for i in 1..args.len() {\\n if let Ok(limit) = args[i].parse::<usize>() {\\n twin_prime_count(limit);\\n } else {\\n eprintln!(\\\"Cannot parse limit from string {}\\\", args[i]);\\n }\\n }\\n } else {\\n twin_prime_count_for_powers_of_ten(10);\\n }\\n}\\n\",\n \"language\": \"Rust\"\n },\n {\n \"code\": \"func twin_primes_count(upto) {\\n var count = 0\\n var p1 = 2\\n each_prime(3, upto, {|p2|\\n if (p2 - p1 == 2) {\\n ++count\\n }\\n p1 = p2\\n })\\n return count\\n}\\n\\nfor n in (1..9) {\\n var count = twin_primes_count(10**n)\\n say \\\"There are #{count} twin primes <= 10^#{n}\\\"\\n}\\n\",\n \"language\": \"Sidef\"\n },\n {\n \"code\": \"Function IsPrime(x As Long) As Boolean\\n Dim i As Long\\n If x Mod 2 = 0 Then\\n Exit Function\\n Else\\n For i = 3 To Int(Sqr(x)) Step 2\\n If x Mod i = 0 Then Exit Function\\n Next i\\n End If\\n IsPrime = True\\nEnd Function\\n\\nFunction TwinPrimePairs(max As Long) As Long\\n Dim p1 As Boolean, p2 As Boolean, count As Long, i As Long\\n p2 = True\\n For i = 5 To max Step 2\\n p1 = p2\\n p2 = IsPrime(i)\\n If p1 And p2 Then count = count + 1\\n Next i\\n TwinPrimePairs = count\\nEnd Function\\n\\nSub Test(x As Long)\\n Debug.Print \\\"Twin prime pairs below\\\" + Str(x) + \\\":\\\" + Str(TwinPrimePairs(x))\\nEnd Sub\\n\\nSub Main()\\n Test 10\\n Test 100\\n Test 1000\\n Test 10000\\n Test 100000\\n Test 1000000\\n Test 10000000\\nEnd Sub\\n\",\n \"language\": \"Visual-Basic\"\n },\n {\n \"code\": \"import \\\"./math\\\" for Int\\nimport \\\"./fmt\\\" for Fmt\\n\\nvar c = Int.primeSieve(1e8-1, false)\\nvar limit = 10\\nvar start = 3\\nvar twins = 0\\nfor (i in 1..8) {\\n var j = start\\n while (j < limit) {\\n if (!c[j] && !c[j-2]) twins = twins + 1\\n j = j + 2\\n }\\n Fmt.print(\\\"Under $,11d there are $,7d pairs of twin primes.\\\", limit, twins)\\n start = limit + 1\\n limit = limit * 10\\n}\\n\",\n \"language\": \"Wren\"\n },\n {\n \"code\": \"func IsPrime(N); \\\\Return 'true' if N is prime\\nint N, I;\\n[if N <= 2 then return N = 2;\\nif (N&1) = 0 then \\\\even >2\\\\ return false;\\nfor I:= 3 to sqrt(N) do\\n [if rem(N/I) = 0 then return false;\\n I:= I+1;\\n ];\\nreturn true;\\n];\\n\\nfunc Twins(Limit);\\nint Limit, C, N;\\n[C:= 0; N:= 3;\\nrepeat if IsPrime(N) then\\n loop [N:= N+2;\\n if N >= Limit then return C;\\n if not IsPrime(N) then quit;\\n C:= C+1;\\n ];\\n N:= N+2;\\nuntil N >= Limit;\\nreturn C;\\n];\\n\\n[IntOut(0, Twins(100_000)); CrLf(0);\\n IntOut(0, Twins(10_000_000)); CrLf(0);\\n IntOut(0, Twins(100_000_000)); CrLf(0);\\n]\\n\",\n \"language\": \"XPL0\"\n },\n {\n \"code\": \"sub isPrime(v)\\n if v < 2 then return False : fi\\n if mod(v, 2) = 0 then return v = 2 : fi\\n if mod(v, 3) = 0 then return v = 3 : fi\\n d = 5\\n while d * d <= v\\n if mod(v, d) = 0 then return False else d = d + 2 : fi\\n wend\\n return True\\nend sub\\n\\nsub paresDePrimos(limite)\\n p1 = 0 : p2 = 1 : p3 = 1 : count = 0\\n for i = 5 to limite\\n p3 = p2\\n p2 = p1\\n p1 = isPrime(i)\\n if (p3 and p1) then count = count + 1 : fi\\n next i\\n return count\\nend sub\\n\\nn = 1\\nfor i = 1 to 6\\n n = n * 10\\n print \\\"pares de primos gemelos por debajo de < \\\", n, \\\" : \\\", paresDePrimos(n)\\nnext i\\nend\\n\",\n \"language\": \"Yabasic\"\n }\n]","isConversational":false},"task_name":{"kind":"string","value":"Twin-primes"}}},{"rowIdx":1777,"cells":{"solutions":{"kind":"list like","value":[{"code":"---\nfrom: http://rosettacode.org/wiki/Two_bullet_roulette\n","language":"00-META"},{"code":"The following is supposedly a question given to mathematics graduates seeking jobs on Wall Street:\n<blockquote>\n A revolver handgun has a revolving cylinder with six chambers for bullets.\n \n It is loaded with the following procedure:\n\n 1. Check the first chamber to the right of the trigger for a bullet. If a bullet\n is seen, the cylinder is rotated one chamber clockwise and the next chamber\n checked until an empty chamber is found.\n\n 2. A cartridge containing a bullet is placed in the empty chamber.\n\n 3. The cylinder is then rotated one chamber clockwise.\n \n To randomize the cylinder's position, the cylinder is spun, which causes the cylinder to take\n a random position from 1 to 6 chamber rotations clockwise from its starting position.\n \n When the trigger is pulled the gun will fire if there is a bullet in position 0, which is just\n counterclockwise from the loading position.\n \n The gun is unloaded by removing all cartridges from the cylinder.\n \n According to the legend, a suicidal Russian imperial military officer plays a game of Russian\n roulette by putting two bullets in a six-chamber cylinder and pulls the trigger twice.\n If the gun fires with a trigger pull, this is considered a successful suicide.\n \n The cylinder is always spun before the first shot, but it may or may not be spun after putting\n in the first bullet and may or may not be spun after taking the first shot.\n \n Which of the following situations produces the highest probability of suicide?\n \n A. Spinning the cylinder after loading the first bullet, and spinning again after the first shot.\n\n B. Spinning the cylinder after loading the first bullet only.\n\n C. Spinning the cylinder after firing the first shot only.\n\n D. Not spinning the cylinder either after loading the first bullet or after the first shot.\n\n E. The probability is the same for all cases.\n\n</blockquote>\n;Task:\n# Run a repeated simulation of each of the above scenario, calculating the percentage of suicide with a randomization of the four spinning, loading and firing order scenarios.\n# Show the results as a percentage of deaths for each type of scenario.\n# The hand calculated probabilities are 5/9, 7/12, 5/9, and 1/2. A correct program should produce results close enough to those to allow a correct response to the interview question. \n\n\n;Reference:\nYoutube video on the Russian 1895 Nagant revolver [[https://www.youtube.com/watch?v=Dh1mojMaEtM]]\n<br><br>\n\n","language":"00-TASK"},{"code":"UInt32 seed = 0\nF nonrandom(n)\n :seed = 1664525 * :seed + 1013904223\n R Int(:seed >> 16) % n\n\nV cylinder = [0B] * 6\n\nF rshift()\n V t = :cylinder[5]\n L(i) (4..0).step(-1)\n :cylinder[i + 1] = :cylinder[i]\n :cylinder[0] = t\n\nF unload()\n L(i) 6\n :cylinder[i] = 0B\n\nF load()\n L :cylinder[0]\n rshift()\n :cylinder[0] = 1B\n rshift()\n\nF spin()\n L 1..nonrandom(6)\n rshift()\n\nF fire()\n V shot = :cylinder[0]\n rshift()\n R shot\n\nF method(s)\n unload()\n L(c) s\n S c\n ‘L’\n load()\n ‘S’\n spin()\n ‘F’\n I fire()\n R 1\n R 0\n\nF mstring(s)\n [String] l\n L(c) s\n S c\n ‘L’\n l [+]= ‘load’\n ‘S’\n l [+]= ‘spin’\n ‘F’\n l [+]= ‘fire’\n R l.join(‘, ’)\n\nV tests = 100000\nL(m) [‘LSLSFSF’, ‘LSLSFF’, ‘LLSFSF’, ‘LLSFF’]\n V sum = 0\n L 0 .< tests\n sum += method(m)\n V pc = Float(sum) * 100 / tests\n print(‘#<40 produces #2.3% deaths.’.format(mstring(m), pc))\n","language":"11l"},{"code":"methods =\n(\nload, spin, load, spin, fire, spin, fire\nload, spin, load, spin, fire, fire\nload, load, spin, fire, spin, fire\nload, load, spin, fire, fire\n)\n\nfor i, method in StrSplit(methods, \"`n\", \"`r\"){\n\tdeath := 0\n\tmain:\n\tloop 100000\t{\n\t\tsixGun := []\n\t\tfor i, v in StrSplit(StrReplace(method,\" \"), \",\")\n\t\t\tif %v%()\n\t\t\t\tcontinue, main\n\t}\n\toutput .= Format(\"{1:0.3f}\", death/1000) \"% Deaths for : \"\"\" method \"\"\"`n\"\n}\nMsgBox % output\nreturn\n\nload(){\n\tglobal\n\tif !sixGun.Count()\n\t\tsixGun := [0,1,0,0,0,0]\n\telse\n\t\tif sixGun[2]\n\t\t\tsixGun[1] := 1\n\tsixGun[2] := 1\n}\nfire(){\n\tglobal\n\tif bullet := sixGun[1]\n\t\tdeath++\n\ttemp := sixGun[6]\n\tloop, 5\n\t\tsixGun[7-A_Index] := sixGun[6-A_Index]\n\tsixGun[1] := temp\n\treturn bullet\n}\nspin(){\n\tglobal\n\tRandom, rnd, 1, 12\n\tloop, % rnd\t{\n\t\ttemp := sixGun[6]\n\t\tloop, 5\n\t\t\tsixGun[7-A_Index] := sixGun[6-A_Index]\n\t\tsixGun[1] := temp\n\t}\n}\n","language":"AutoHotkey"},{"code":"#include <stdbool.h>\n#include <stdio.h>\n#include <stdlib.h>\n#include <string.h>\n#include <time.h>\n\nstatic int nextInt(int size) {\n return rand() % size;\n}\n\nstatic bool cylinder[6];\n\nstatic void rshift() {\n bool t = cylinder[5];\n int i;\n for (i = 4; i >= 0; i--) {\n cylinder[i + 1] = cylinder[i];\n }\n cylinder[0] = t;\n}\n\nstatic void unload() {\n int i;\n for (i = 0; i < 6; i++) {\n cylinder[i] = false;\n }\n}\n\nstatic void load() {\n while (cylinder[0]) {\n rshift();\n }\n cylinder[0] = true;\n rshift();\n}\n\nstatic void spin() {\n int lim = nextInt(6) + 1;\n int i;\n for (i = 1; i < lim; i++) {\n rshift();\n }\n}\n\nstatic bool fire() {\n bool shot = cylinder[0];\n rshift();\n return shot;\n}\n\nstatic int method(const char *s) {\n unload();\n for (; *s != '\\0'; s++) {\n switch (*s) {\n case 'L':\n load();\n break;\n case 'S':\n spin();\n break;\n case 'F':\n if (fire()) {\n return 1;\n }\n break;\n }\n }\n return 0;\n}\n\nstatic void append(char *out, const char *txt) {\n if (*out != '\\0') {\n strcat(out, \", \");\n }\n strcat(out, txt);\n}\n\nstatic void mstring(const char *s, char *out) {\n for (; *s != '\\0'; s++) {\n switch (*s) {\n case 'L':\n append(out, \"load\");\n break;\n case 'S':\n append(out, \"spin\");\n break;\n case 'F':\n append(out, \"fire\");\n break;\n }\n }\n}\n\nstatic void test(char *src) {\n char buffer[41] = \"\";\n const int tests = 100000;\n int sum = 0;\n int t;\n double pc;\n\n for (t = 0; t < tests; t++) {\n sum += method(src);\n }\n\n mstring(src, buffer);\n pc = 100.0 * sum / tests;\n\n printf(\"%-40s produces %6.3f%% deaths.\\n\", buffer, pc);\n}\n\nint main() {\n srand(time(0));\n\n test(\"LSLSFSF\");\n test(\"LSLSFF\");\n test(\"LLSFSF\");\n test(\"LLSFF\");\n\n return 0;\n}\n","language":"C"},{"code":"#include <array>\n#include <iomanip>\n#include <iostream>\n#include <random>\n#include <sstream>\n\nclass Roulette {\nprivate:\n std::array<bool, 6> cylinder;\n\n std::mt19937 gen;\n std::uniform_int_distribution<> distrib;\n\n int next_int() {\n return distrib(gen);\n }\n\n void rshift() {\n std::rotate(cylinder.begin(), cylinder.begin() + 1, cylinder.end());\n }\n\n void unload() {\n std::fill(cylinder.begin(), cylinder.end(), false);\n }\n\n void load() {\n while (cylinder[0]) {\n rshift();\n }\n cylinder[0] = true;\n rshift();\n }\n\n void spin() {\n int lim = next_int();\n for (int i = 1; i < lim; i++) {\n rshift();\n }\n }\n\n bool fire() {\n auto shot = cylinder[0];\n rshift();\n return shot;\n }\n\npublic:\n Roulette() {\n std::random_device rd;\n gen = std::mt19937(rd());\n distrib = std::uniform_int_distribution<>(1, 6);\n\n unload();\n }\n\n int method(const std::string &s) {\n unload();\n for (auto c : s) {\n switch (c) {\n case 'L':\n load();\n break;\n case 'S':\n spin();\n break;\n case 'F':\n if (fire()) {\n return 1;\n }\n break;\n }\n }\n return 0;\n }\n};\n\nstd::string mstring(const std::string &s) {\n std::stringstream ss;\n bool first = true;\n\n auto append = [&ss, &first](const std::string s) {\n if (first) {\n first = false;\n } else {\n ss << \", \";\n }\n ss << s;\n };\n\n for (auto c : s) {\n switch (c) {\n case 'L':\n append(\"load\");\n break;\n case 'S':\n append(\"spin\");\n break;\n case 'F':\n append(\"fire\");\n break;\n }\n }\n\n return ss.str();\n}\n\nvoid test(const std::string &src) {\n const int tests = 100000;\n int sum = 0;\n\n Roulette r;\n for (int t = 0; t < tests; t++) {\n sum += r.method(src);\n }\n\n double pc = 100.0 * sum / tests;\n\n std::cout << std::left << std::setw(40) << mstring(src) << \" produces \" << pc << \"% deaths.\\n\";\n}\n\nint main() {\n test(\"LSLSFSF\");\n test(\"LSLSFF\");\n test(\"LLSFSF\");\n test(\"LLSFF\");\n\n return 0;\n}\n","language":"C++"},{"code":"len cyl[] 6\nproc rshift . .\n h = cyl[6]\n for i = 6 downto 2\n cyl[i] = cyl[i - 1]\n .\n cyl[1] = h\n.\nproc unload . .\n for i = 1 to 6\n cyl[i] = 0\n .\n.\nproc load . .\n while cyl[1] = 1\n rshift\n .\n cyl[1] = 1\n rshift\n.\nproc spin . .\n lim = randint 6\n for i = 1 to lim - 1\n rshift\n .\n.\nfunc fire .\n shot = cyl[1]\n rshift\n return shot\n.\nfunc method m[] .\n unload\n for m in m[]\n if m = 1\n load\n elif m = 2\n spin\n elif m = 3\n if fire = 1\n return 1\n .\n .\n .\n return 0\n.\nmethod$[] = [ \"load\" \"spin\" \"fire\" ]\nproc test m[] . .\n n = 100000\n for i = 1 to n\n sum += method m[]\n .\n for i = 1 to len m[]\n write method$[m[i]] & \" \"\n .\n print \"-> \" & 100 * sum / n & \"% death\"\n.\ntest [ 1 2 1 2 3 2 3 ]\ntest [ 1 2 1 2 3 3 ]\ntest [ 1 1 2 3 2 3 ]\ntest [ 1 1 2 3 3 ]\n","language":"EasyLang"},{"code":"USING: accessors assocs circular formatting fry kernel literals\nmath random sequences ;\nIN: rosetta-code.roulette\n\nCONSTANT: cyl $[ { f f f f f f } <circular> ]\n\n: cylinder ( -- seq ) cyl [ drop f ] map! ;\n\n: load ( seq -- seq' )\n 0 over nth [ dup rotate-circular ] when\n t 0 rot [ set-nth ] [ rotate-circular ] [ ] tri ;\n\n: spin ( seq -- seq' ) [ 6 random 1 + + ] change-start ;\n\n: fire ( seq -- ? seq' )\n [ 0 swap nth ] [ rotate-circular ] [ ] tri ;\n\n: LSLSFSF ( -- ? ) cylinder load spin load spin fire spin fire drop or ;\n: LSLSFF ( -- ? ) cylinder load spin load spin fire fire drop or ;\n: LLSFSF ( -- ? ) cylinder load load spin fire spin fire drop or ;\n: LLSFF ( -- ? ) cylinder load load spin fire fire drop or ;\n\n: percent ( ... n quot: ( ... -- ... ? ) -- ... x )\n 0 -rot '[ _ call( -- ? ) 1 0 ? + ] [ times ] keepd /f 100 * ; inline\n\n: run-test ( description quot -- )\n 100,000 swap percent\n \"Method <%s> produces %.3f%% deaths.\\n\" printf ;\n\n: main ( -- )\n {\n { \"load, spin, load, spin, fire, spin, fire\" [ LSLSFSF ] }\n { \"load, spin, load, spin, fire, fire\" [ LSLSFF ] }\n { \"load, load, spin, fire, spin, fire\" [ LLSFSF ] }\n { \"load, load, spin, fire, fire\" [ LLSFF ] }\n } [ run-test ] assoc-each ;\n\nMAIN: main\n","language":"Factor"},{"code":"Type Revolver\n cylinder(0 To 5) As Integer\nEnd Type\n\nSub rshift(r As Revolver)\n Dim t As Integer = r.cylinder(5)\n For i As Integer = 4 To 0 Step -1\n r.cylinder(i + 1) = r.cylinder(i)\n Next i\n r.cylinder(0) = t\nEnd Sub\n\nSub unload(r As Revolver)\n For i As Integer = 0 To 5\n r.cylinder(i) = 0\n Next i\nEnd Sub\n\nSub load(r As Revolver)\n While r.cylinder(0) <> 0\n rshift(r)\n Wend\n r.cylinder(0) = -1\n rshift(r)\nEnd Sub\n\nSub spin(r As Revolver)\n For i As Integer = 1 To Int(Rnd * 6) + 1\n rshift(r)\n Next i\nEnd Sub\n\nFunction fire(r As Revolver) As Integer\n Dim As Integer shot = r.cylinder(0)\n rshift(r)\n Return shot\nEnd Function\n\nFunction method(r As Revolver, s As String) As Integer\n unload(r)\n For i As Integer = 1 To Len(s)\n Dim c As String = Mid(s, i, 1)\n If c = \"L\" Then\n load(r)\n Elseif c = \"S\" Then\n spin(r)\n Elseif c = \"F\" Then\n If fire(r) <> 0 Then Return 1\n End If\n Next i\n Return 0\nEnd Function\n\nFunction mstring(s As String) As String\n Dim As String l = \"\"\n For i As Integer = 1 To Len(s)\n Dim As String c = Mid(s, i, 1)\n If c = \"L\" Then\n l &= \"load, \"\n Elseif c = \"S\" Then\n l &= \"spin, \"\n Elseif c = \"F\" Then\n l &= \"fire, \"\n End If\n Next i\n Return Left(l, Len(l) - 2)\nEnd Function\n\nDim As Revolver rev\nDim As Integer tests = 100000\nDim As String methods(0 To 3) = {\"LSLSFSF\", \"LSLSFF\", \"LLSFSF\", \"LLSFF\"}\n\nFor m As Integer = 0 To 3 'In methods\n Dim sum As Integer = 0\n For t As Integer = 1 To tests\n sum += method(rev, methods(m))\n Next t\n Print mstring(methods(m)), \" produces \"; sum * 100.0 / tests; \"% deaths.\"\nNext m\n\nSleep\n","language":"FreeBASIC"},{"code":"package main\n\nimport (\n \"fmt\"\n \"math/rand\"\n \"strings\"\n \"time\"\n)\n\nvar cylinder = [6]bool{}\n\nfunc rshift() {\n t := cylinder[5]\n for i := 4; i >= 0; i-- {\n cylinder[i+1] = cylinder[i]\n }\n cylinder[0] = t\n}\n\nfunc unload() {\n for i := 0; i < 6; i++ {\n cylinder[i] = false\n }\n}\n\nfunc load() {\n for cylinder[0] {\n rshift()\n }\n cylinder[0] = true\n rshift()\n}\n\nfunc spin() {\n var lim = 1 + rand.Intn(6)\n for i := 1; i < lim; i++ {\n rshift()\n }\n}\n\nfunc fire() bool {\n shot := cylinder[0]\n rshift()\n return shot\n}\n\nfunc method(s string) int {\n unload()\n for _, c := range s {\n switch c {\n case 'L':\n load()\n case 'S':\n spin()\n case 'F':\n if fire() {\n return 1\n }\n }\n }\n return 0\n}\n\nfunc mstring(s string) string {\n var l []string\n for _, c := range s {\n switch c {\n case 'L':\n l = append(l, \"load\")\n case 'S':\n l = append(l, \"spin\")\n case 'F':\n l = append(l, \"fire\")\n }\n }\n return strings.Join(l, \", \")\n}\n\nfunc main() {\n rand.Seed(time.Now().UnixNano())\n tests := 100000\n for _, m := range []string{\"LSLSFSF\", \"LSLSFF\", \"LLSFSF\", \"LLSFF\"} {\n sum := 0\n for t := 1; t <= tests; t++ {\n sum += method(m)\n }\n pc := float64(sum) * 100 / float64(tests)\n fmt.Printf(\"%-40s produces %6.3f%% deaths.\\n\", mstring(m), pc)\n }\n}\n","language":"Go"},{"code":"import java.util.BitSet;\nimport java.util.concurrent.ThreadLocalRandom;\n\npublic class TwoBulletRoulette {\n\n\tpublic static void main(String[] aArgs) {\t\t\n\t\tRevolver handgun = new Revolver();\n\t\tfinal int simulationCount = 100_000;\t\t\n\t\n\t\tfor ( Situation situation : Situation.values() ) {\n\t\t\tdouble deaths = 0.0;\n\t\t\tfor ( int i = 0; i < simulationCount; i++ ) {\n\t\t\t\tResultState resultState = handgun.operateInMode(situation);\n\t\t\t\tif ( resultState == ResultState.DEAD) {\n\t\t\t\t\tdeaths += 1.0;\n\t\t\t\t}\n\t\t\t}\n\t\t\tfinal double deathRate = ( deaths / simulationCount ) * 100;\n\t\t\tString percentage = String.format(\"%4.1f%%\", deathRate);\n\t\t\tSystem.out.println(\"Situation \" + situation + \" produces \" + percentage + \" deaths\");\n\t\t}\n\t}\t\n\t\n}\n\nenum Situation { A, B, C, D }\n\nenum ResultState { ALIVE, DEAD }\n\n/**\n * Representation of a six cylinder revolving chamber pistol.\n */\nclass Revolver {\n\t\n\tpublic Revolver() {\n\t\tchambers = new BitSet(chamberCount);\t\t\t\n\t\trandom = ThreadLocalRandom.current();\n\t}\t\n\t\n\tpublic ResultState operateInMode(Situation aSituation) {\n\t\treturn switch ( aSituation ) {\n\t\t\tcase A -> useSituationA();\n\t\t\tcase B -> useSituationB();\n\t\t\tcase C -> useSituationC();\n\t\t\tcase D -> useSituationD();\n\t\t};\n\t}\n\t\n\t// PRIVATE //\n\t\n\tprivate void unload() {\t\t\n\t\tchambers.clear();\n\t}\n\t\n\tprivate void load() {\n\t\twhile ( chambers.get(loadingChamber) ) {\n\t\t\trotateClockwise();\n\t\t}\t\t\n\t\tchambers.set(loadingChamber);\n\t\trotateClockwise();\n\t}\t\n\t\n\tprivate void spin() {\n\t\tfinal int spins = random.nextInt(0, chamberCount);\n\t\tfor ( int i = 0; i < spins; i++ ) {\n\t\t\trotateClockwise();\n\t\t}\n\t}\n\t\n\tprivate boolean fire() {\n\t\tboolean fire = chambers.get(firingChamber);\n\t\tchambers.set(firingChamber, false);\n\t\trotateClockwise();\n\t\treturn fire;\t\t\t\n\t}\n\t\n\tprivate void rotateClockwise() {\t\t\n\t\tfinal boolean temp = chambers.get(chamberCount - 1);\n\t\tfor ( int i = chamberCount - 2; i >= 0; i-- ) {\n\t\t\tchambers.set(i + 1, chambers.get(i));\n\t\t}\n\t\tchambers.set(firingChamber, temp);\n\t}\n\t\t\n\tprivate ResultState useSituationA() {\n\t\tunload();\n\t\tload();\n\t\tspin();\n\t\tload();\n\t\tspin();\n\t\tif ( fire() ) {\n\t\t\treturn ResultState.DEAD;\n\t\t};\n\t\tspin();\n\t\tif ( fire() ) {\n\t\t\treturn ResultState.DEAD;\n\t\t};\n\t\t\n\t\treturn ResultState.ALIVE;\n\t}\n\t\n\tprivate ResultState useSituationB() {\n\t\tunload();\n\t\tload();\n\t\tspin();\n\t\tload();\n\t\tspin();\n\t\tif ( fire() ) {\n\t\t\treturn ResultState.DEAD;\n\t\t};\n\t\tif ( fire() ) {\n\t\t\treturn ResultState.DEAD;\n\t\t};\n\t\t\n\t\treturn ResultState.ALIVE;\n\t}\n\t\n\tprivate ResultState useSituationC() {\n\t\tunload();\n\t\tload();\n\t\tload();\n\t\tspin();\n\t\tif ( fire() ) {\n\t\t\treturn ResultState.DEAD;\n\t\t};\n\t\tspin();\n\t\tif ( fire() ) {\n\t\t\treturn ResultState.DEAD;\n\t\t};\n\t\t\n\t\treturn ResultState.ALIVE;\n\t}\n\t\n\tprivate ResultState useSituationD() {\n\t\tunload();\n\t\tload();\n\t\tload();\n\t\tspin();\n\t\tif ( fire() ) {\n\t\t\treturn ResultState.DEAD;\n\t\t};\n\t\tif ( fire() ) {\n\t\t\treturn ResultState.DEAD;\n\t\t};\n\t\t\n\t\treturn ResultState.ALIVE;\n\t}\t\n\t\n\tprivate BitSet chambers;\n\tprivate ThreadLocalRandom random;\n\t\n\tprivate final int firingChamber = 0;\n\tprivate final int loadingChamber = 1;\n\tprivate final int chamberCount = 6;\n\t\n}\n","language":"Java"},{"code":"let Pistol = function(method) {\n this.fired = false;\n this.cylinder = new Array(6).fill(false);\n this.trigger = 0;\n this.rshift = function() {\n this.trigger = this.trigger == 0 ? 5 : this.trigger-1;\n }\n this.load = function() {\n while (this.cylinder[this.trigger]) this.rshift();\n this.cylinder[this.trigger] = true;\n this.rshift();\n }\n // actually we don't need this here: just for completeness\n this.unload = function() { this.cylinder.fill(false); }\n\n this.spin = function() { this.trigger = Math.floor(Math.random() * 6); }\n this.fire = function() {\n if (this.cylinder[this.trigger]) this.fired = true;\n this.rshift();\n }\n this.exec = function() {\n if (!method) console.error('No method provided');\n else {\n method = method.toUpperCase();\n for (let x = 0; x < method.length; x++)\n switch (method[x]) {\n case 'F' : this.fire(); break;\n case 'L' : this.load(); break;\n case 'S' : this.spin(); break;\n case 'U' : this.unload(); break;\n default: console.error(`Unknown character in method: ${method[x]}`);\n }\n return this.fired;\n }\n }\n}\n\n// simulating\nconst ITERATIONS = 25e4;\nlet methods = 'lslsfsf lslsff llsfsf llsff'.split(' '),\n bodyCount;\nconsole.log(`@ ${ITERATIONS.toLocaleString('en')} iterations:`);\nconsole.log();\nfor (let x = 0; x < methods.length; x++) {\n bodyCount = 0;\n for (let y = 1; y <= ITERATIONS; y++)\n if (new Pistol(methods[x]).exec()) bodyCount++;\n console.log(`${methods[x]}:`);\n console.log(`deaths: ${bodyCount.toLocaleString('en')} (${(bodyCount / ITERATIONS * 100).toPrecision(3)} %) `);\n console.log();\n}\n","language":"JavaScript"},{"code":"const cyl = zeros(Bool, 6)\n\nfunction load()\n while cyl[1]\n cyl .= circshift(cyl, 1)\n end\n cyl[1] = true\n cyl .= circshift(cyl, 1)\nend\n\nspin() = (cyl .= circshift(cyl, rand(1:6)))\n\nfire() = (shot = cyl[1]; cyl .= circshift(cyl, 1); shot)\n\nfunction LSLSFSF()\n cyl .= 0\n load(); spin(); load(); spin()\n fire() && return true\n spin(); return fire()\nend\n\nfunction LSLSFF()\n cyl .= 0\n load(); spin(); load(); spin()\n fire() && return true\n return fire()\nend\n\nfunction LLSFSF()\n cyl .= 0\n load(); load(); spin()\n fire() && return true\n spin(); return fire()\nend\n\nfunction LLSFF()\n cyl .= 0\n load(); load(); spin()\n fire() && return true\n return fire()\nend\n\nfunction testmethods(N = 10000000)\n for (name, method) in [(\"load, spin, load, spin, fire, spin, fire\", LSLSFSF),\n (\"load, spin, load, spin, fire, fire\", LSLSFF),\n (\"load, load, spin, fire, spin, fire\", LLSFSF),\n (\"load, load, spin, fire, fire\", LLSFF)]\n percentage = 100 * sum([method() for _ in 1:N]) / N\n println(\"Method $name produces $percentage per cent deaths.\")\n end\nend\n\ntestmethods()\n","language":"Julia"},{"code":"import kotlin.random.Random\n\nval cylinder = Array(6) { false }\n\nfun rShift() {\n val t = cylinder[cylinder.size - 1]\n for (i in (0 until cylinder.size - 1).reversed()) {\n cylinder[i + 1] = cylinder[i]\n }\n cylinder[0] = t\n}\n\nfun unload() {\n for (i in cylinder.indices) {\n cylinder[i] = false\n }\n}\n\nfun load() {\n while (cylinder[0]) {\n rShift()\n }\n cylinder[0] = true\n rShift()\n}\n\nfun spin() {\n val lim = Random.nextInt(0, 6) + 1\n for (i in 1..lim) {\n rShift()\n }\n}\n\nfun fire(): Boolean {\n val shot = cylinder[0]\n rShift()\n return shot\n}\n\nfun method(s: String): Int {\n unload()\n for (c in s) {\n when (c) {\n 'L' -> {\n load()\n }\n 'S' -> {\n spin()\n }\n 'F' -> {\n if (fire()) {\n return 1\n }\n }\n }\n }\n return 0\n}\n\nfun mString(s: String): String {\n val buf = StringBuilder()\n fun append(txt: String) {\n if (buf.isNotEmpty()) {\n buf.append(\", \")\n }\n buf.append(txt)\n }\n for (c in s) {\n when (c) {\n 'L' -> {\n append(\"load\")\n }\n 'S' -> {\n append(\"spin\")\n }\n 'F' -> {\n append(\"fire\")\n }\n }\n }\n return buf.toString()\n}\n\nfun test(src: String) {\n val tests = 100000\n var sum = 0\n\n for (t in 0..tests) {\n sum += method(src)\n }\n\n val str = mString(src)\n val pc = 100.0 * sum / tests\n println(\"%-40s produces %6.3f%% deaths.\".format(str, pc))\n}\n\nfun main() {\n test(\"LSLSFSF\");\n test(\"LSLSFF\");\n test(\"LLSFSF\");\n test(\"LLSFF\");\n}\n","language":"Kotlin"},{"code":"ClearAll[Unload, Load, Spin, Fire]\nUnload[] := ConstantArray[False, 6]\nLoad[state_List] := Module[{s = state},\n While[s[[2]],\n s = RotateRight[s, 1]\n ];\n s[[2]] = True;\n s\n ]\nSpin[state_List] := RotateRight[state, RandomInteger[{1, 6}]]\nFire[state_List] := Module[{shot},\n shot = First[state];\n {RotateRight[state, 1], shot}\n ]\nClearAll[LSLSFSF]\nLSLSFSF[] := Module[{state, shot},\n state = Unload[];\n state = Load[state];\n state = Spin[state];\n state = Load[state];\n state = Spin[state];\n {state, shot} = Fire[state];\n If[shot,\n Return[True]\n ];\n state = Spin[state];\n {state, shot} = Fire[state];\n If[shot,\n Return[True]\n ];\n Return[False]\n ]\nClearAll[LSLSFF]\nLSLSFF[] := Module[{state, shot},\n state = Unload[];\n state = Load[state];\n state = Spin[state];\n state = Load[state];\n state = Spin[state];\n {state, shot} = Fire[state];\n If[shot,\n Return[True]\n ];\n {state, shot} = Fire[state];\n If[shot,\n Return[True]\n ];\n Return[False]\n ]\nClearAll[LLSFSF]\nLLSFSF[] := Module[{state, shot},\n state = Unload[];\n state = Load[state];\n state = Load[state];\n state = Spin[state];\n {state, shot} = Fire[state];\n If[shot,\n Return[True]\n ];\n state = Spin[state];\n {state, shot} = Fire[state];\n If[shot,\n Return[True]\n ];\n Return[False]\n ]\nClearAll[LLSFF]\nLLSFF[] := Module[{state, shot},\n state = Unload[];\n state = Load[state];\n state = Load[state];\n state = Spin[state];\n {state, shot} = Fire[state];\n If[shot,\n Return[True]\n ];\n {state, shot} = Fire[state];\n If[shot,\n Return[True]\n ];\n Return[False]\n ]\nn = 10^5;\nCount[Table[LSLSFSF[], n], True]/N[n]\nCount[Table[LSLSFF[], n], True]/N[n]\nCount[Table[LLSFSF[], n], True]/N[n]\nCount[Table[LLSFF[], n], True]/N[n]\n","language":"Mathematica"},{"code":"import algorithm, random, sequtils, strformat, strutils, tables\n\ntype\n Revolver = array[6, bool]\n Action {.pure.} = enum Load, Spin, Fire, Error\n\nconst Actions = {'L': Load, 'S': Spin, 'F': Fire}.toTable\n\nfunc spin(revolver: var Revolver; count: Positive) =\n revolver.rotateLeft(-count)\n\nfunc load(revolver: var Revolver) =\n while revolver[1]:\n revolver.spin(1)\n revolver[1] = true\n revolver.spin(1)\n\nfunc fire(revolver: var Revolver): bool =\n result = revolver[0]\n revolver.spin(1)\n\nproc test(scenario: string) =\n let actions = scenario.mapIt(Actions.getOrDefault(it, Error))\n var deaths = 0\n var count = 100_000\n for _ in 1..count:\n var revolver: Revolver\n for action in actions:\n case action\n of Load:\n revolver.load()\n of Spin:\n revolver.spin(rand(1..6))\n of Fire:\n if revolver.fire():\n inc deaths\n break\n of Error:\n raise newException(ValueError, \"encountered an unknown action.\")\n echo &\"\"\"{100 * deaths / count:5.2f}% deaths for scenario {actions.join(\", \")}.\"\"\"\n\nrandomize()\nfor scenario in [\"LSLSFSF\", \"LSLSFF\", \"LLSFSF\", \"LLSFF\"]:\n test(scenario)\n","language":"Nim"},{"code":"/* imports */\nimport \"core:fmt\"\nimport \"core:strings\"\nimport \"core:math/rand\"\n/* globals */\ncylinder := [6]bool{}\n/* main block */\nmain :: proc() {\n\trand.set_global_seed(42)\n\ttests := 100000\n\tsequence := [?]string{\"LSLSFSF\", \"LSLSFF\", \"LLSFSF\", \"LLSFF\"}\n\tfor m in sequence {\n\t\tsum := 0\n\t\tfor t in 0 ..< tests {\n\t\t\tsum += method(m)\n\t\t}\n\t\tpc: f64 = cast(f64)sum * 100 / cast(f64)tests\n\t\tfmt.printf(\"%-40s produces %6.3f%% deaths.\\n\", mstring(m), pc)\n\t}\n}\n/* definitions */\nrshift :: proc() {\n\tt := cylinder[len(cylinder) - 1]\n\tcopy(cylinder[1:], cylinder[0:])\n\tcylinder[0] = t\n}\nunload :: proc() {\n\tcylinder = false // array programming\n}\nload :: proc() {\n\tfor cylinder[0] {\n\t\trshift()\n\t}\n\tcylinder[0] = true\n\trshift()\n}\nspin :: proc() {\n\tdata: []int = {1, 2, 3, 4, 5, 6}\n\tlim := rand.choice(data[:])\n\tfor i in 0 ..< lim {\n\t\trshift()\n\t}\n}\nfire :: proc() -> bool {\n\tshot := cylinder[0]\n\trshift()\n\treturn shot\n}\nmethod :: proc(s: string) -> int {\n\tunload()\n\tfor character in s {\n\t\tswitch character {\n\t\tcase 'L':\n\t\t\tload()\n\t\tcase 'S':\n\t\t\tspin()\n\t\tcase 'F':\n\t\t\tif fire() {\n\t\t\t\treturn 1\n\t\t\t}\n\t\t}\n\t}\n\treturn 0\n}\nmstring :: proc(s: string) -> string {\n\tl: [dynamic]string\n\tfor character in s {\n\t\tswitch character {\n\t\tcase 'L':\n\t\t\tappend(&l, \"load\")\n\t\tcase 'S':\n\t\t\tappend(&l, \"spin\")\n\t\tcase 'F':\n\t\t\tappend(&l, \"fire\")\n\t\t}\n\t}\n\treturn strings.join(l[:], \", \")\n}\n","language":"Odin"},{"code":"use strict;\nuse warnings;\nuse feature 'say';\n\nmy @cyl;\nmy $shots = 6;\n\nsub load {\n push @cyl, shift @cyl while $cyl[1];\n $cyl[1] = 1;\n push @cyl, shift @cyl\n}\n\nsub spin { push @cyl, shift @cyl for 0 .. int rand @cyl }\nsub fire { push @cyl, shift @cyl; $cyl[0] }\n\nsub LSLSFSF {\n @cyl = (0) x $shots;\n load, spin, load, spin;\n return 1 if fire;\n spin;\n fire\n}\n\nsub LSLSFF {\n @cyl = (0) x $shots;\n load, spin, load, spin;\n fire or fire\n}\n\nsub LLSFSF {\n @cyl = (0) x $shots;\n load, load, spin;\n return 1 if fire;\n spin;\n fire\n}\n\nsub LLSFF {\n @cyl = (0) x $shots;\n load, load, spin;\n fire or fire\n}\n\nmy $trials = 10000;\n\nfor my $ref (<LSLSFSF LSLSFF LLSFSF LLSFF>) {\n no strict 'refs';\n my $total = 0;\n $total += &$ref for 1..$trials;\n printf \"%7s %.2f%%\\n\", $ref, $total / $trials * 100;\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;\">spin</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #004080;\">sequence</span> <span style=\"color: #000000;\">revolver</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #004080;\">integer</span> <span style=\"color: #000000;\">count</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #008080;\">while</span> <span style=\"color: #000000;\">count</span> <span style=\"color: #008080;\">do</span>\n <span style=\"color: #000000;\">revolver</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">revolver</span><span style=\"color: #0000FF;\">[$]&</span><span style=\"color: #000000;\">revolver</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;\">count</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;\">revolver</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;\">load</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #004080;\">sequence</span> <span style=\"color: #000000;\">revolver</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #008080;\">while</span> <span style=\"color: #000000;\">revolver</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;\">revolver</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">spin</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">revolver</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;\">while</span>\n <span style=\"color: #000000;\">revolver</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: #004600;\">true</span>\n <span style=\"color: #000000;\">revolver</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">spin</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">revolver</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #008080;\">return</span> <span style=\"color: #000000;\">revolver</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;\">fire</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #004080;\">sequence</span> <span style=\"color: #000000;\">revolver</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #004080;\">bool</span> <span style=\"color: #000000;\">dead</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #008080;\">if</span> <span style=\"color: #000000;\">revolver</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">]</span> <span style=\"color: #008080;\">then</span> <span style=\"color: #000000;\">dead</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #004600;\">true</span> <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">if</span>\n <span style=\"color: #000000;\">revolver</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">spin</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">revolver</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #008080;\">return</span> <span style=\"color: #0000FF;\">{</span><span style=\"color: #000000;\">revolver</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">dead</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;\">procedure</span> <span style=\"color: #000000;\">test</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #004080;\">sequence</span> <span style=\"color: #000000;\">me</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #0000FF;\">{</span><span style=\"color: #004080;\">string</span> <span style=\"color: #000000;\">method</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #004080;\">atom</span> <span style=\"color: #000000;\">expected</span><span style=\"color: #0000FF;\">}</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">me</span>\n <span style=\"color: #004080;\">integer</span> <span style=\"color: #000000;\">deaths</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">0</span><span style=\"color: #0000FF;\">,</span>\n <span style=\"color: #000000;\">limit</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">100_000</span>\n <span style=\"color: #008080;\">for</span> <span style=\"color: #000000;\">n</span><span style=\"color: #0000FF;\">=</span><span style=\"color: #000000;\">1</span> <span style=\"color: #008080;\">to</span> <span style=\"color: #000000;\">limit</span> <span style=\"color: #008080;\">do</span>\n <span style=\"color: #004080;\">sequence</span> <span style=\"color: #000000;\">revolver</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;\">6</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #004080;\">bool</span> <span style=\"color: #000000;\">dead</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;\">method</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;\">method</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">i</span><span style=\"color: #0000FF;\">]</span>\n <span style=\"color: #008080;\">switch</span> <span style=\"color: #000000;\">ch</span>\n <span style=\"color: #008080;\">case</span> <span style=\"color: #008000;\">'L'</span><span style=\"color: #0000FF;\">:</span> <span style=\"color: #000000;\">revolver</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">load</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">revolver</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #008080;\">case</span> <span style=\"color: #008000;\">'S'</span><span style=\"color: #0000FF;\">:</span> <span style=\"color: #000000;\">revolver</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">spin</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">revolver</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #7060A8;\">rand</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">6</span><span style=\"color: #0000FF;\">))</span>\n <span style=\"color: #008080;\">case</span> <span style=\"color: #008000;\">'F'</span><span style=\"color: #0000FF;\">:</span> <span style=\"color: #0000FF;\">{</span><span style=\"color: #000000;\">revolver</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">dead</span><span style=\"color: #0000FF;\">}</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">fire</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">revolver</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">dead</span><span style=\"color: #0000FF;\">)</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;\">for</span>\n <span style=\"color: #000000;\">deaths</span> <span style=\"color: #0000FF;\">+=</span> <span style=\"color: #000000;\">dead</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;\">\"%s: %5.2f (expected %.2f%%)\\n\"</span><span style=\"color: #0000FF;\">,{</span><span style=\"color: #000000;\">method</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">100</span><span style=\"color: #0000FF;\">*</span><span style=\"color: #000000;\">deaths</span><span style=\"color: #0000FF;\">/</span><span style=\"color: #000000;\">limit</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">expected</span><span style=\"color: #0000FF;\">*</span><span style=\"color: #000000;\">100</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;\">\"Load/Spin/Fire method percentage fatalities:\\n\"</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #7060A8;\">papply</span><span style=\"color: #0000FF;\">({{</span><span style=\"color: #008000;\">\"LSLSFSF\"</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">5</span><span style=\"color: #0000FF;\">/</span><span style=\"color: #000000;\">9</span><span style=\"color: #0000FF;\">},{</span><span style=\"color: #008000;\">\"LSLSFF\"</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">7</span><span style=\"color: #0000FF;\">/</span><span style=\"color: #000000;\">12</span><span style=\"color: #0000FF;\">},{</span><span style=\"color: #008000;\">\"LLSFSF\"</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">5</span><span style=\"color: #0000FF;\">/</span><span style=\"color: #000000;\">9</span><span style=\"color: #0000FF;\">},{</span><span style=\"color: #008000;\">\"LLSFF\"</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;\">test</span><span style=\"color: #0000FF;\">)</span>\n<!--\n","language":"Phix"},{"code":"\"\"\" Russian roulette problem \"\"\"\nimport numpy as np\n\nclass Revolver:\n \"\"\" simulates 6-shot revolving cylinger pistol \"\"\"\n\n def __init__(self):\n \"\"\" start unloaded \"\"\"\n self.cylinder = np.array([False] * 6)\n\n def unload(self):\n \"\"\" empty all chambers of cylinder \"\"\"\n self.cylinder[:] = False\n\n def load(self):\n \"\"\" load a chamber (advance til empty if full already), then advance once \"\"\"\n while self.cylinder[1]:\n self.cylinder[:] = np.roll(self.cylinder, 1)\n self.cylinder[1] = True\n\n def spin(self):\n \"\"\" spin cylinder, randomizing position of chamber to be fired \"\"\"\n self.cylinder[:] = np.roll(self.cylinder, np.random.randint(1, high=7))\n\n def fire(self):\n \"\"\" pull trigger of revolver, return True if fired, False if did not fire \"\"\"\n shot = self.cylinder[0]\n self.cylinder[:] = np.roll(self.cylinder, 1)\n return shot\n\n def LSLSFSF(self):\n \"\"\" load, spin, load, spin, fire, spin, fire \"\"\"\n self.unload()\n self.load()\n self.spin()\n self.load()\n self.spin()\n if self.fire():\n return True\n self.spin()\n if self.fire():\n return True\n return False\n\n def LSLSFF(self):\n \"\"\" load, spin, load, spin, fire, fire \"\"\"\n self.unload()\n self.load()\n self.spin()\n self.load()\n self.spin()\n if self.fire():\n return True\n if self.fire():\n return True\n return False\n\n def LLSFSF(self):\n \"\"\" load, load, spin, fire, spin, fire \"\"\"\n self.unload()\n self.load()\n self.load()\n self.spin()\n if self.fire():\n return True\n self.spin()\n if self.fire():\n return True\n return False\n\n def LLSFF(self):\n \"\"\" load, load, spin, fire, fire \"\"\"\n self.unload()\n self.load()\n self.load()\n self.spin()\n if self.fire():\n return True\n if self.fire():\n return True\n return False\n\n\nif __name__ == '__main__':\n\n REV = Revolver()\n TESTCOUNT = 100000\n for (name, method) in [['load, spin, load, spin, fire, spin, fire', REV.LSLSFSF],\n ['load, spin, load, spin, fire, fire', REV.LSLSFF],\n ['load, load, spin, fire, spin, fire', REV.LLSFSF],\n ['load, load, spin, fire, fire', REV.LLSFF]]:\n\n percentage = 100 * sum([method() for _ in range(TESTCOUNT)]) / TESTCOUNT\n print(\"Method\", name, \"produces\", percentage, \"per cent deaths.\")\n","language":"Python"},{"code":"unit sub MAIN ($shots = 6);\n\nmy @cyl;\n\nsub load () {\n @cyl.=rotate(-1) while @cyl[1];\n @cyl[1] = 1;\n @cyl.=rotate(-1);\n}\n\nsub spin () { @cyl.=rotate: (^@cyl).pick }\n\nsub fire () { @cyl.=rotate; @cyl[0] }\n\nsub LSLSFSF {\n @cyl = 0 xx $shots;\n load, spin, load, spin;\n return 1 if fire;\n spin;\n fire\n}\n\nsub LSLSFF {\n @cyl = 0 xx $shots;\n load, spin, load, spin;\n fire() || fire\n}\n\nsub LLSFSF {\n @cyl = 0 xx $shots;\n load, load, spin;\n return 1 if fire;\n spin;\n fire\n}\n\nsub LLSFF {\n @cyl = 0 xx $shots;\n load, load, spin;\n fire() || fire\n}\n\nmy %revolver;\nmy $trials = 100000;\n\nfor ^$trials {\n %revolver<LSLSFSF> += LSLSFSF;\n %revolver<LSLSFF> += LSLSFF;\n %revolver<LLSFSF> += LLSFSF;\n %revolver<LLSFF> += LLSFF;\n}\n\nsay \"{.fmt('%7s')}: %{(%revolver{$_} / $trials × 100).fmt('%.2f')}\"\n for <LSLSFSF LSLSFF LLSFSF LLSFF>\n","language":"Raku"},{"code":"/*REXX pgm simulates scenarios for a two─bullet Russian roulette game with a 6 cyl. gun.*/\nparse arg cyls tests seed . /*obtain optional arguments from the CL*/\nif cyls=='' | cyls==\",\" then cyls= 6 /*Not specified? Then use the default.*/\nif tests=='' | tests==\",\" then tests= 100000 /* \" \" \" \" \" \" */\nif datatype(seed, 'W') then call random ,,seed /* \" \" \" \" \" \" */\ncyls_ = cyls - 1; @0= copies(0, cyls) /*shortcut placeholder for cylinders-1 */\n@abc= 'ABCDEFGHIJKLMNOPQRSTUVWXYZ' /*indices for the various options used.*/\nscenarios= 'LSLSFsF LSLSFF LLSFSF LLSFF' /*the list of scenarios to be tested. */\n#= words(scenarios) /*the number of actions in a scenario. */\n /*The scenarios are case insensitive. */\n do m=1 for #; q= word(scenarios, m) /*test each of the scenarios specified.*/\n sum= 0 /*initialize the sum to zero. */\n do tests; sum= sum + method() /*added the sums up for the percentages*/\n end /*tests*/\n pc= left( (sum * 100 / tests)\"%\", 7)\n say act() ' (option' substr(@abc, m, 1)\") produces \" pc ' deaths.'\n end /*m*/\nexit 0 /*stick a fork in it, we're all done. */\n/*──────────────────────────────────────────────────────────────────────────────────────*/\nfire: != left(@, 1); @= right(@, cyls_)left(@, 1); /* ◄──── next cyl.*/ return !\nload: if left(@, 1) then @= right(@, cyls_)left(@, 1); @= 1||right(@, cyls_); return\nspin: ?= random(1, cyls); if ?\\==cyls then @= substr(@ || @, ? + 1, cyls); return\n/*──────────────────────────────────────────────────────────────────────────────────────*/\nmethod: @= @0; do a=1 for length(q); y= substr(q, a, 1)\n if y=='L' then call load\n else if y=='S' then call spin\n else if y=='F' then if fire() then return 1\n end /*a*/; return 0\n/*──────────────────────────────────────────────────────────────────────────────────────*/\nact: $=; do a=1 for length(q); y= substr(q, a, 1)\n if y=='L' then $= $\", load\"\n if y=='S' then $= $\", spin\"\n if y=='F' then $= $\", fire\"\n end /*a*/; return right( strip( strip($, , \",\") ), 45)\n","language":"REXX"},{"code":"class Revolver\n attr_accessor :strategy\n attr_reader :notches, :shot_count\n\n def initialize(strategy = [:load, :spin, :shoot], num_chambers = 6) # default like Deer hunter\n @chambers = Array.new(num_chambers) # by default 6 nils\n @strategy = strategy\n @notches, @shot_count, @loaded_count = 0, 0, 0\n end\n\n def load\n raise \"gun completely loaded \" if @chambers.all? :loaded\n @chambers.rotate! until @chambers[1] == nil #not sure about this; Raku rotates -1\n @chambers[1] = :loaded\n @chambers.rotate! #not sure about this; Raku rotates -1\n @loaded_count += 1\n end\n\n def spin\n @chambers.rotate!(rand(1..@chambers.size))\n end\n\n def unload\n @chambers.fill(nil)\n @loaded_count = 0\n end\n\n def shoot\n @chambers[0] = nil\n @chambers.rotate!\n end\n\n def play\n strategy.each{|action| send(action)}\n @shot_count += 1\n @notches += 1 unless @chambers.count(:loaded) == @loaded_count # all bullets still there?\n unload\n end\nend\n\nstrategies = {:A => [:load, :spin, :load, :spin, :shoot, :spin, :shoot],\n :B => [:load, :spin, :load, :spin, :shoot, :shoot],\n :C => [:load, :load, :spin, :shoot, :spin, :shoot],\n :D => [:load, :load, :spin, :shoot, :shoot],\n :E => [:load, :spin, :shoot, :load, :spin, :shoot]}\n\nn = 100_000\nputs \"simulation of #{n} runs:\"\nstrategies.each do |name, strategy|\n gun = Revolver.new(strategy) # Revolver.new(strategy, 10) for a 10-shooter\n n.times{gun.play}\n puts \"Strategy #{name}: #{gun.notches.fdiv(gun.shot_count)}\"\nend\n","language":"Ruby"},{"code":"import rand\n\n__global cylinder = []bool{len:6}\n\nfn main() {\n\ttest(\"LSLSFSF\")\n\ttest(\"LSLSFF\")\n\ttest(\"LLSFSF\")\n\ttest(\"LLSFF\")\n}\n\nfn test(src string) {\n\ttests := 100000\n\tmut sum := 0\n\tfor _ in 0..tests {\n\t\tsum += method(src)\n\t}\n\tprintln('${m_string(src)} produces ${100.0 * f32(sum) / f32(tests)}% deaths.')\n}\n\nfn rshift() {\n\tt := cylinder[5]\n\tfor i := 4; i >= 0; i-- {\n\t\tcylinder[i+1] = cylinder[i]\n\t}\n\tcylinder[0] = t\n}\n\nfn unload() {\n\tfor i := 0; i < 6; i++ {\n\t\tcylinder[i] = false\n\t}\n}\n\nfn load() {\n\tfor cylinder[0] {\n\t\trshift()\n\t}\n\tcylinder[0] = true\n\trshift()\n}\n\nfn spin() {\n\tmut lim := 1 + rand.intn(6) or {exit(1)}\n\tfor i := 1; i < lim; i++ {\n\t\trshift()\n\t}\n}\n\nfn fire() bool {\n\tshot := cylinder[0]\n\trshift()\n\treturn shot\n}\n\nfn method(s string) int {\n\tunload()\n\tfor c in s {\n\t\tmatch c.ascii_str() {\n\t\t\t'L' {load()}\n\t\t\t'S' {spin()}\n\t\t\t'F' {if fire() == true {return 1}}\n\t\t\telse {}\n\t\t}\n\t}\n\treturn 0\n}\n\nfn m_string(s string) string {\n\tmut l := []string{}\n\tfor c in s {\n\t\tmatch c.ascii_str() {\n\t\t 'L' {l << \"load\"}\n\t\t 'S' {l << \"spin\"}\n\t\t 'F' {l << \"fire\"}\n\t\t else {}\n\t\t}\n\t}\n\treturn l.join(', ')\n}\n","language":"V-(Vlang)"},{"code":"import \"random\" for Random\nimport \"./fmt\" for Fmt\n\nvar Rand = Random.new()\n\nclass Revolver {\n construct new() {\n _cylinder = List.filled(6, false)\n }\n\n rshift() {\n var t = _cylinder[-1]\n for (i in 4..0) _cylinder[i+1] = _cylinder[i]\n _cylinder[0] = t\n }\n\n unload() {\n for (i in 0..5) _cylinder[i] = false\n }\n\n load() {\n while (_cylinder[0]) rshift()\n _cylinder[0] = true\n rshift()\n }\n\n spin() {\n for (i in 1..Rand.int(1, 7)) rshift()\n }\n\n fire() {\n var shot = _cylinder[0]\n rshift()\n return shot\n }\n\n method(s) {\n unload()\n for (c in s) {\n if (c == \"L\") {\n load()\n } else if (c == \"S\") {\n spin()\n } else if (c == \"F\") {\n if (fire()) return 1\n }\n }\n return 0\n }\n\n static mstring(s) {\n var l = []\n for (c in s) {\n if (c == \"L\") {\n l.add(\"load\")\n } else if (c == \"S\") {\n l.add(\"spin\")\n } else if (c == \"F\") {\n l.add(\"fire\")\n }\n }\n return l.join(\", \")\n }\n}\n\nvar rev = Revolver.new()\nvar tests = 100000\nfor (m in [\"LSLSFSF\", \"LSLSFF\", \"LLSFSF\", \"LLSFF\"]) {\n var sum = 0\n for (t in 1..tests) sum = sum + rev.method(m)\n Fmt.print(\"$-40s produces $6.3f\\% deaths.\", Revolver.mstring(m), sum * 100 / tests)\n}\n","language":"Wren"}],"string":"[\n {\n \"code\": \"---\\nfrom: http://rosettacode.org/wiki/Two_bullet_roulette\\n\",\n \"language\": \"00-META\"\n },\n {\n \"code\": \"The following is supposedly a question given to mathematics graduates seeking jobs on Wall Street:\\n<blockquote>\\n A revolver handgun has a revolving cylinder with six chambers for bullets.\\n \\n It is loaded with the following procedure:\\n\\n 1. Check the first chamber to the right of the trigger for a bullet. If a bullet\\n is seen, the cylinder is rotated one chamber clockwise and the next chamber\\n checked until an empty chamber is found.\\n\\n 2. A cartridge containing a bullet is placed in the empty chamber.\\n\\n 3. The cylinder is then rotated one chamber clockwise.\\n \\n To randomize the cylinder's position, the cylinder is spun, which causes the cylinder to take\\n a random position from 1 to 6 chamber rotations clockwise from its starting position.\\n \\n When the trigger is pulled the gun will fire if there is a bullet in position 0, which is just\\n counterclockwise from the loading position.\\n \\n The gun is unloaded by removing all cartridges from the cylinder.\\n \\n According to the legend, a suicidal Russian imperial military officer plays a game of Russian\\n roulette by putting two bullets in a six-chamber cylinder and pulls the trigger twice.\\n If the gun fires with a trigger pull, this is considered a successful suicide.\\n \\n The cylinder is always spun before the first shot, but it may or may not be spun after putting\\n in the first bullet and may or may not be spun after taking the first shot.\\n \\n Which of the following situations produces the highest probability of suicide?\\n \\n A. Spinning the cylinder after loading the first bullet, and spinning again after the first shot.\\n\\n B. Spinning the cylinder after loading the first bullet only.\\n\\n C. Spinning the cylinder after firing the first shot only.\\n\\n D. Not spinning the cylinder either after loading the first bullet or after the first shot.\\n\\n E. The probability is the same for all cases.\\n\\n</blockquote>\\n;Task:\\n# Run a repeated simulation of each of the above scenario, calculating the percentage of suicide with a randomization of the four spinning, loading and firing order scenarios.\\n# Show the results as a percentage of deaths for each type of scenario.\\n# The hand calculated probabilities are 5/9, 7/12, 5/9, and 1/2. A correct program should produce results close enough to those to allow a correct response to the interview question. \\n\\n\\n;Reference:\\nYoutube video on the Russian 1895 Nagant revolver [[https://www.youtube.com/watch?v=Dh1mojMaEtM]]\\n<br><br>\\n\\n\",\n \"language\": \"00-TASK\"\n },\n {\n \"code\": \"UInt32 seed = 0\\nF nonrandom(n)\\n :seed = 1664525 * :seed + 1013904223\\n R Int(:seed >> 16) % n\\n\\nV cylinder = [0B] * 6\\n\\nF rshift()\\n V t = :cylinder[5]\\n L(i) (4..0).step(-1)\\n :cylinder[i + 1] = :cylinder[i]\\n :cylinder[0] = t\\n\\nF unload()\\n L(i) 6\\n :cylinder[i] = 0B\\n\\nF load()\\n L :cylinder[0]\\n rshift()\\n :cylinder[0] = 1B\\n rshift()\\n\\nF spin()\\n L 1..nonrandom(6)\\n rshift()\\n\\nF fire()\\n V shot = :cylinder[0]\\n rshift()\\n R shot\\n\\nF method(s)\\n unload()\\n L(c) s\\n S c\\n ‘L’\\n load()\\n ‘S’\\n spin()\\n ‘F’\\n I fire()\\n R 1\\n R 0\\n\\nF mstring(s)\\n [String] l\\n L(c) s\\n S c\\n ‘L’\\n l [+]= ‘load’\\n ‘S’\\n l [+]= ‘spin’\\n ‘F’\\n l [+]= ‘fire’\\n R l.join(‘, ’)\\n\\nV tests = 100000\\nL(m) [‘LSLSFSF’, ‘LSLSFF’, ‘LLSFSF’, ‘LLSFF’]\\n V sum = 0\\n L 0 .< tests\\n sum += method(m)\\n V pc = Float(sum) * 100 / tests\\n print(‘#<40 produces #2.3% deaths.’.format(mstring(m), pc))\\n\",\n \"language\": \"11l\"\n },\n {\n \"code\": \"methods =\\n(\\nload, spin, load, spin, fire, spin, fire\\nload, spin, load, spin, fire, fire\\nload, load, spin, fire, spin, fire\\nload, load, spin, fire, fire\\n)\\n\\nfor i, method in StrSplit(methods, \\\"`n\\\", \\\"`r\\\"){\\n\\tdeath := 0\\n\\tmain:\\n\\tloop 100000\\t{\\n\\t\\tsixGun := []\\n\\t\\tfor i, v in StrSplit(StrReplace(method,\\\" \\\"), \\\",\\\")\\n\\t\\t\\tif %v%()\\n\\t\\t\\t\\tcontinue, main\\n\\t}\\n\\toutput .= Format(\\\"{1:0.3f}\\\", death/1000) \\\"% Deaths for : \\\"\\\"\\\" method \\\"\\\"\\\"`n\\\"\\n}\\nMsgBox % output\\nreturn\\n\\nload(){\\n\\tglobal\\n\\tif !sixGun.Count()\\n\\t\\tsixGun := [0,1,0,0,0,0]\\n\\telse\\n\\t\\tif sixGun[2]\\n\\t\\t\\tsixGun[1] := 1\\n\\tsixGun[2] := 1\\n}\\nfire(){\\n\\tglobal\\n\\tif bullet := sixGun[1]\\n\\t\\tdeath++\\n\\ttemp := sixGun[6]\\n\\tloop, 5\\n\\t\\tsixGun[7-A_Index] := sixGun[6-A_Index]\\n\\tsixGun[1] := temp\\n\\treturn bullet\\n}\\nspin(){\\n\\tglobal\\n\\tRandom, rnd, 1, 12\\n\\tloop, % rnd\\t{\\n\\t\\ttemp := sixGun[6]\\n\\t\\tloop, 5\\n\\t\\t\\tsixGun[7-A_Index] := sixGun[6-A_Index]\\n\\t\\tsixGun[1] := temp\\n\\t}\\n}\\n\",\n \"language\": \"AutoHotkey\"\n },\n {\n \"code\": \"#include <stdbool.h>\\n#include <stdio.h>\\n#include <stdlib.h>\\n#include <string.h>\\n#include <time.h>\\n\\nstatic int nextInt(int size) {\\n return rand() % size;\\n}\\n\\nstatic bool cylinder[6];\\n\\nstatic void rshift() {\\n bool t = cylinder[5];\\n int i;\\n for (i = 4; i >= 0; i--) {\\n cylinder[i + 1] = cylinder[i];\\n }\\n cylinder[0] = t;\\n}\\n\\nstatic void unload() {\\n int i;\\n for (i = 0; i < 6; i++) {\\n cylinder[i] = false;\\n }\\n}\\n\\nstatic void load() {\\n while (cylinder[0]) {\\n rshift();\\n }\\n cylinder[0] = true;\\n rshift();\\n}\\n\\nstatic void spin() {\\n int lim = nextInt(6) + 1;\\n int i;\\n for (i = 1; i < lim; i++) {\\n rshift();\\n }\\n}\\n\\nstatic bool fire() {\\n bool shot = cylinder[0];\\n rshift();\\n return shot;\\n}\\n\\nstatic int method(const char *s) {\\n unload();\\n for (; *s != '\\\\0'; s++) {\\n switch (*s) {\\n case 'L':\\n load();\\n break;\\n case 'S':\\n spin();\\n break;\\n case 'F':\\n if (fire()) {\\n return 1;\\n }\\n break;\\n }\\n }\\n return 0;\\n}\\n\\nstatic void append(char *out, const char *txt) {\\n if (*out != '\\\\0') {\\n strcat(out, \\\", \\\");\\n }\\n strcat(out, txt);\\n}\\n\\nstatic void mstring(const char *s, char *out) {\\n for (; *s != '\\\\0'; s++) {\\n switch (*s) {\\n case 'L':\\n append(out, \\\"load\\\");\\n break;\\n case 'S':\\n append(out, \\\"spin\\\");\\n break;\\n case 'F':\\n append(out, \\\"fire\\\");\\n break;\\n }\\n }\\n}\\n\\nstatic void test(char *src) {\\n char buffer[41] = \\\"\\\";\\n const int tests = 100000;\\n int sum = 0;\\n int t;\\n double pc;\\n\\n for (t = 0; t < tests; t++) {\\n sum += method(src);\\n }\\n\\n mstring(src, buffer);\\n pc = 100.0 * sum / tests;\\n\\n printf(\\\"%-40s produces %6.3f%% deaths.\\\\n\\\", buffer, pc);\\n}\\n\\nint main() {\\n srand(time(0));\\n\\n test(\\\"LSLSFSF\\\");\\n test(\\\"LSLSFF\\\");\\n test(\\\"LLSFSF\\\");\\n test(\\\"LLSFF\\\");\\n\\n return 0;\\n}\\n\",\n \"language\": \"C\"\n },\n {\n \"code\": \"#include <array>\\n#include <iomanip>\\n#include <iostream>\\n#include <random>\\n#include <sstream>\\n\\nclass Roulette {\\nprivate:\\n std::array<bool, 6> cylinder;\\n\\n std::mt19937 gen;\\n std::uniform_int_distribution<> distrib;\\n\\n int next_int() {\\n return distrib(gen);\\n }\\n\\n void rshift() {\\n std::rotate(cylinder.begin(), cylinder.begin() + 1, cylinder.end());\\n }\\n\\n void unload() {\\n std::fill(cylinder.begin(), cylinder.end(), false);\\n }\\n\\n void load() {\\n while (cylinder[0]) {\\n rshift();\\n }\\n cylinder[0] = true;\\n rshift();\\n }\\n\\n void spin() {\\n int lim = next_int();\\n for (int i = 1; i < lim; i++) {\\n rshift();\\n }\\n }\\n\\n bool fire() {\\n auto shot = cylinder[0];\\n rshift();\\n return shot;\\n }\\n\\npublic:\\n Roulette() {\\n std::random_device rd;\\n gen = std::mt19937(rd());\\n distrib = std::uniform_int_distribution<>(1, 6);\\n\\n unload();\\n }\\n\\n int method(const std::string &s) {\\n unload();\\n for (auto c : s) {\\n switch (c) {\\n case 'L':\\n load();\\n break;\\n case 'S':\\n spin();\\n break;\\n case 'F':\\n if (fire()) {\\n return 1;\\n }\\n break;\\n }\\n }\\n return 0;\\n }\\n};\\n\\nstd::string mstring(const std::string &s) {\\n std::stringstream ss;\\n bool first = true;\\n\\n auto append = [&ss, &first](const std::string s) {\\n if (first) {\\n first = false;\\n } else {\\n ss << \\\", \\\";\\n }\\n ss << s;\\n };\\n\\n for (auto c : s) {\\n switch (c) {\\n case 'L':\\n append(\\\"load\\\");\\n break;\\n case 'S':\\n append(\\\"spin\\\");\\n break;\\n case 'F':\\n append(\\\"fire\\\");\\n break;\\n }\\n }\\n\\n return ss.str();\\n}\\n\\nvoid test(const std::string &src) {\\n const int tests = 100000;\\n int sum = 0;\\n\\n Roulette r;\\n for (int t = 0; t < tests; t++) {\\n sum += r.method(src);\\n }\\n\\n double pc = 100.0 * sum / tests;\\n\\n std::cout << std::left << std::setw(40) << mstring(src) << \\\" produces \\\" << pc << \\\"% deaths.\\\\n\\\";\\n}\\n\\nint main() {\\n test(\\\"LSLSFSF\\\");\\n test(\\\"LSLSFF\\\");\\n test(\\\"LLSFSF\\\");\\n test(\\\"LLSFF\\\");\\n\\n return 0;\\n}\\n\",\n \"language\": \"C++\"\n },\n {\n \"code\": \"len cyl[] 6\\nproc rshift . .\\n h = cyl[6]\\n for i = 6 downto 2\\n cyl[i] = cyl[i - 1]\\n .\\n cyl[1] = h\\n.\\nproc unload . .\\n for i = 1 to 6\\n cyl[i] = 0\\n .\\n.\\nproc load . .\\n while cyl[1] = 1\\n rshift\\n .\\n cyl[1] = 1\\n rshift\\n.\\nproc spin . .\\n lim = randint 6\\n for i = 1 to lim - 1\\n rshift\\n .\\n.\\nfunc fire .\\n shot = cyl[1]\\n rshift\\n return shot\\n.\\nfunc method m[] .\\n unload\\n for m in m[]\\n if m = 1\\n load\\n elif m = 2\\n spin\\n elif m = 3\\n if fire = 1\\n return 1\\n .\\n .\\n .\\n return 0\\n.\\nmethod$[] = [ \\\"load\\\" \\\"spin\\\" \\\"fire\\\" ]\\nproc test m[] . .\\n n = 100000\\n for i = 1 to n\\n sum += method m[]\\n .\\n for i = 1 to len m[]\\n write method$[m[i]] & \\\" \\\"\\n .\\n print \\\"-> \\\" & 100 * sum / n & \\\"% death\\\"\\n.\\ntest [ 1 2 1 2 3 2 3 ]\\ntest [ 1 2 1 2 3 3 ]\\ntest [ 1 1 2 3 2 3 ]\\ntest [ 1 1 2 3 3 ]\\n\",\n \"language\": \"EasyLang\"\n },\n {\n \"code\": \"USING: accessors assocs circular formatting fry kernel literals\\nmath random sequences ;\\nIN: rosetta-code.roulette\\n\\nCONSTANT: cyl $[ { f f f f f f } <circular> ]\\n\\n: cylinder ( -- seq ) cyl [ drop f ] map! ;\\n\\n: load ( seq -- seq' )\\n 0 over nth [ dup rotate-circular ] when\\n t 0 rot [ set-nth ] [ rotate-circular ] [ ] tri ;\\n\\n: spin ( seq -- seq' ) [ 6 random 1 + + ] change-start ;\\n\\n: fire ( seq -- ? seq' )\\n [ 0 swap nth ] [ rotate-circular ] [ ] tri ;\\n\\n: LSLSFSF ( -- ? ) cylinder load spin load spin fire spin fire drop or ;\\n: LSLSFF ( -- ? ) cylinder load spin load spin fire fire drop or ;\\n: LLSFSF ( -- ? ) cylinder load load spin fire spin fire drop or ;\\n: LLSFF ( -- ? ) cylinder load load spin fire fire drop or ;\\n\\n: percent ( ... n quot: ( ... -- ... ? ) -- ... x )\\n 0 -rot '[ _ call( -- ? ) 1 0 ? + ] [ times ] keepd /f 100 * ; inline\\n\\n: run-test ( description quot -- )\\n 100,000 swap percent\\n \\\"Method <%s> produces %.3f%% deaths.\\\\n\\\" printf ;\\n\\n: main ( -- )\\n {\\n { \\\"load, spin, load, spin, fire, spin, fire\\\" [ LSLSFSF ] }\\n { \\\"load, spin, load, spin, fire, fire\\\" [ LSLSFF ] }\\n { \\\"load, load, spin, fire, spin, fire\\\" [ LLSFSF ] }\\n { \\\"load, load, spin, fire, fire\\\" [ LLSFF ] }\\n } [ run-test ] assoc-each ;\\n\\nMAIN: main\\n\",\n \"language\": \"Factor\"\n },\n {\n \"code\": \"Type Revolver\\n cylinder(0 To 5) As Integer\\nEnd Type\\n\\nSub rshift(r As Revolver)\\n Dim t As Integer = r.cylinder(5)\\n For i As Integer = 4 To 0 Step -1\\n r.cylinder(i + 1) = r.cylinder(i)\\n Next i\\n r.cylinder(0) = t\\nEnd Sub\\n\\nSub unload(r As Revolver)\\n For i As Integer = 0 To 5\\n r.cylinder(i) = 0\\n Next i\\nEnd Sub\\n\\nSub load(r As Revolver)\\n While r.cylinder(0) <> 0\\n rshift(r)\\n Wend\\n r.cylinder(0) = -1\\n rshift(r)\\nEnd Sub\\n\\nSub spin(r As Revolver)\\n For i As Integer = 1 To Int(Rnd * 6) + 1\\n rshift(r)\\n Next i\\nEnd Sub\\n\\nFunction fire(r As Revolver) As Integer\\n Dim As Integer shot = r.cylinder(0)\\n rshift(r)\\n Return shot\\nEnd Function\\n\\nFunction method(r As Revolver, s As String) As Integer\\n unload(r)\\n For i As Integer = 1 To Len(s)\\n Dim c As String = Mid(s, i, 1)\\n If c = \\\"L\\\" Then\\n load(r)\\n Elseif c = \\\"S\\\" Then\\n spin(r)\\n Elseif c = \\\"F\\\" Then\\n If fire(r) <> 0 Then Return 1\\n End If\\n Next i\\n Return 0\\nEnd Function\\n\\nFunction mstring(s As String) As String\\n Dim As String l = \\\"\\\"\\n For i As Integer = 1 To Len(s)\\n Dim As String c = Mid(s, i, 1)\\n If c = \\\"L\\\" Then\\n l &= \\\"load, \\\"\\n Elseif c = \\\"S\\\" Then\\n l &= \\\"spin, \\\"\\n Elseif c = \\\"F\\\" Then\\n l &= \\\"fire, \\\"\\n End If\\n Next i\\n Return Left(l, Len(l) - 2)\\nEnd Function\\n\\nDim As Revolver rev\\nDim As Integer tests = 100000\\nDim As String methods(0 To 3) = {\\\"LSLSFSF\\\", \\\"LSLSFF\\\", \\\"LLSFSF\\\", \\\"LLSFF\\\"}\\n\\nFor m As Integer = 0 To 3 'In methods\\n Dim sum As Integer = 0\\n For t As Integer = 1 To tests\\n sum += method(rev, methods(m))\\n Next t\\n Print mstring(methods(m)), \\\" produces \\\"; sum * 100.0 / tests; \\\"% deaths.\\\"\\nNext m\\n\\nSleep\\n\",\n \"language\": \"FreeBASIC\"\n },\n {\n \"code\": \"package main\\n\\nimport (\\n \\\"fmt\\\"\\n \\\"math/rand\\\"\\n \\\"strings\\\"\\n \\\"time\\\"\\n)\\n\\nvar cylinder = [6]bool{}\\n\\nfunc rshift() {\\n t := cylinder[5]\\n for i := 4; i >= 0; i-- {\\n cylinder[i+1] = cylinder[i]\\n }\\n cylinder[0] = t\\n}\\n\\nfunc unload() {\\n for i := 0; i < 6; i++ {\\n cylinder[i] = false\\n }\\n}\\n\\nfunc load() {\\n for cylinder[0] {\\n rshift()\\n }\\n cylinder[0] = true\\n rshift()\\n}\\n\\nfunc spin() {\\n var lim = 1 + rand.Intn(6)\\n for i := 1; i < lim; i++ {\\n rshift()\\n }\\n}\\n\\nfunc fire() bool {\\n shot := cylinder[0]\\n rshift()\\n return shot\\n}\\n\\nfunc method(s string) int {\\n unload()\\n for _, c := range s {\\n switch c {\\n case 'L':\\n load()\\n case 'S':\\n spin()\\n case 'F':\\n if fire() {\\n return 1\\n }\\n }\\n }\\n return 0\\n}\\n\\nfunc mstring(s string) string {\\n var l []string\\n for _, c := range s {\\n switch c {\\n case 'L':\\n l = append(l, \\\"load\\\")\\n case 'S':\\n l = append(l, \\\"spin\\\")\\n case 'F':\\n l = append(l, \\\"fire\\\")\\n }\\n }\\n return strings.Join(l, \\\", \\\")\\n}\\n\\nfunc main() {\\n rand.Seed(time.Now().UnixNano())\\n tests := 100000\\n for _, m := range []string{\\\"LSLSFSF\\\", \\\"LSLSFF\\\", \\\"LLSFSF\\\", \\\"LLSFF\\\"} {\\n sum := 0\\n for t := 1; t <= tests; t++ {\\n sum += method(m)\\n }\\n pc := float64(sum) * 100 / float64(tests)\\n fmt.Printf(\\\"%-40s produces %6.3f%% deaths.\\\\n\\\", mstring(m), pc)\\n }\\n}\\n\",\n \"language\": \"Go\"\n },\n {\n \"code\": \"import java.util.BitSet;\\nimport java.util.concurrent.ThreadLocalRandom;\\n\\npublic class TwoBulletRoulette {\\n\\n\\tpublic static void main(String[] aArgs) {\\t\\t\\n\\t\\tRevolver handgun = new Revolver();\\n\\t\\tfinal int simulationCount = 100_000;\\t\\t\\n\\t\\n\\t\\tfor ( Situation situation : Situation.values() ) {\\n\\t\\t\\tdouble deaths = 0.0;\\n\\t\\t\\tfor ( int i = 0; i < simulationCount; i++ ) {\\n\\t\\t\\t\\tResultState resultState = handgun.operateInMode(situation);\\n\\t\\t\\t\\tif ( resultState == ResultState.DEAD) {\\n\\t\\t\\t\\t\\tdeaths += 1.0;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\tfinal double deathRate = ( deaths / simulationCount ) * 100;\\n\\t\\t\\tString percentage = String.format(\\\"%4.1f%%\\\", deathRate);\\n\\t\\t\\tSystem.out.println(\\\"Situation \\\" + situation + \\\" produces \\\" + percentage + \\\" deaths\\\");\\n\\t\\t}\\n\\t}\\t\\n\\t\\n}\\n\\nenum Situation { A, B, C, D }\\n\\nenum ResultState { ALIVE, DEAD }\\n\\n/**\\n * Representation of a six cylinder revolving chamber pistol.\\n */\\nclass Revolver {\\n\\t\\n\\tpublic Revolver() {\\n\\t\\tchambers = new BitSet(chamberCount);\\t\\t\\t\\n\\t\\trandom = ThreadLocalRandom.current();\\n\\t}\\t\\n\\t\\n\\tpublic ResultState operateInMode(Situation aSituation) {\\n\\t\\treturn switch ( aSituation ) {\\n\\t\\t\\tcase A -> useSituationA();\\n\\t\\t\\tcase B -> useSituationB();\\n\\t\\t\\tcase C -> useSituationC();\\n\\t\\t\\tcase D -> useSituationD();\\n\\t\\t};\\n\\t}\\n\\t\\n\\t// PRIVATE //\\n\\t\\n\\tprivate void unload() {\\t\\t\\n\\t\\tchambers.clear();\\n\\t}\\n\\t\\n\\tprivate void load() {\\n\\t\\twhile ( chambers.get(loadingChamber) ) {\\n\\t\\t\\trotateClockwise();\\n\\t\\t}\\t\\t\\n\\t\\tchambers.set(loadingChamber);\\n\\t\\trotateClockwise();\\n\\t}\\t\\n\\t\\n\\tprivate void spin() {\\n\\t\\tfinal int spins = random.nextInt(0, chamberCount);\\n\\t\\tfor ( int i = 0; i < spins; i++ ) {\\n\\t\\t\\trotateClockwise();\\n\\t\\t}\\n\\t}\\n\\t\\n\\tprivate boolean fire() {\\n\\t\\tboolean fire = chambers.get(firingChamber);\\n\\t\\tchambers.set(firingChamber, false);\\n\\t\\trotateClockwise();\\n\\t\\treturn fire;\\t\\t\\t\\n\\t}\\n\\t\\n\\tprivate void rotateClockwise() {\\t\\t\\n\\t\\tfinal boolean temp = chambers.get(chamberCount - 1);\\n\\t\\tfor ( int i = chamberCount - 2; i >= 0; i-- ) {\\n\\t\\t\\tchambers.set(i + 1, chambers.get(i));\\n\\t\\t}\\n\\t\\tchambers.set(firingChamber, temp);\\n\\t}\\n\\t\\t\\n\\tprivate ResultState useSituationA() {\\n\\t\\tunload();\\n\\t\\tload();\\n\\t\\tspin();\\n\\t\\tload();\\n\\t\\tspin();\\n\\t\\tif ( fire() ) {\\n\\t\\t\\treturn ResultState.DEAD;\\n\\t\\t};\\n\\t\\tspin();\\n\\t\\tif ( fire() ) {\\n\\t\\t\\treturn ResultState.DEAD;\\n\\t\\t};\\n\\t\\t\\n\\t\\treturn ResultState.ALIVE;\\n\\t}\\n\\t\\n\\tprivate ResultState useSituationB() {\\n\\t\\tunload();\\n\\t\\tload();\\n\\t\\tspin();\\n\\t\\tload();\\n\\t\\tspin();\\n\\t\\tif ( fire() ) {\\n\\t\\t\\treturn ResultState.DEAD;\\n\\t\\t};\\n\\t\\tif ( fire() ) {\\n\\t\\t\\treturn ResultState.DEAD;\\n\\t\\t};\\n\\t\\t\\n\\t\\treturn ResultState.ALIVE;\\n\\t}\\n\\t\\n\\tprivate ResultState useSituationC() {\\n\\t\\tunload();\\n\\t\\tload();\\n\\t\\tload();\\n\\t\\tspin();\\n\\t\\tif ( fire() ) {\\n\\t\\t\\treturn ResultState.DEAD;\\n\\t\\t};\\n\\t\\tspin();\\n\\t\\tif ( fire() ) {\\n\\t\\t\\treturn ResultState.DEAD;\\n\\t\\t};\\n\\t\\t\\n\\t\\treturn ResultState.ALIVE;\\n\\t}\\n\\t\\n\\tprivate ResultState useSituationD() {\\n\\t\\tunload();\\n\\t\\tload();\\n\\t\\tload();\\n\\t\\tspin();\\n\\t\\tif ( fire() ) {\\n\\t\\t\\treturn ResultState.DEAD;\\n\\t\\t};\\n\\t\\tif ( fire() ) {\\n\\t\\t\\treturn ResultState.DEAD;\\n\\t\\t};\\n\\t\\t\\n\\t\\treturn ResultState.ALIVE;\\n\\t}\\t\\n\\t\\n\\tprivate BitSet chambers;\\n\\tprivate ThreadLocalRandom random;\\n\\t\\n\\tprivate final int firingChamber = 0;\\n\\tprivate final int loadingChamber = 1;\\n\\tprivate final int chamberCount = 6;\\n\\t\\n}\\n\",\n \"language\": \"Java\"\n },\n {\n \"code\": \"let Pistol = function(method) {\\n this.fired = false;\\n this.cylinder = new Array(6).fill(false);\\n this.trigger = 0;\\n this.rshift = function() {\\n this.trigger = this.trigger == 0 ? 5 : this.trigger-1;\\n }\\n this.load = function() {\\n while (this.cylinder[this.trigger]) this.rshift();\\n this.cylinder[this.trigger] = true;\\n this.rshift();\\n }\\n // actually we don't need this here: just for completeness\\n this.unload = function() { this.cylinder.fill(false); }\\n\\n this.spin = function() { this.trigger = Math.floor(Math.random() * 6); }\\n this.fire = function() {\\n if (this.cylinder[this.trigger]) this.fired = true;\\n this.rshift();\\n }\\n this.exec = function() {\\n if (!method) console.error('No method provided');\\n else {\\n method = method.toUpperCase();\\n for (let x = 0; x < method.length; x++)\\n switch (method[x]) {\\n case 'F' : this.fire(); break;\\n case 'L' : this.load(); break;\\n case 'S' : this.spin(); break;\\n case 'U' : this.unload(); break;\\n default: console.error(`Unknown character in method: ${method[x]}`);\\n }\\n return this.fired;\\n }\\n }\\n}\\n\\n// simulating\\nconst ITERATIONS = 25e4;\\nlet methods = 'lslsfsf lslsff llsfsf llsff'.split(' '),\\n bodyCount;\\nconsole.log(`@ ${ITERATIONS.toLocaleString('en')} iterations:`);\\nconsole.log();\\nfor (let x = 0; x < methods.length; x++) {\\n bodyCount = 0;\\n for (let y = 1; y <= ITERATIONS; y++)\\n if (new Pistol(methods[x]).exec()) bodyCount++;\\n console.log(`${methods[x]}:`);\\n console.log(`deaths: ${bodyCount.toLocaleString('en')} (${(bodyCount / ITERATIONS * 100).toPrecision(3)} %) `);\\n console.log();\\n}\\n\",\n \"language\": \"JavaScript\"\n },\n {\n \"code\": \"const cyl = zeros(Bool, 6)\\n\\nfunction load()\\n while cyl[1]\\n cyl .= circshift(cyl, 1)\\n end\\n cyl[1] = true\\n cyl .= circshift(cyl, 1)\\nend\\n\\nspin() = (cyl .= circshift(cyl, rand(1:6)))\\n\\nfire() = (shot = cyl[1]; cyl .= circshift(cyl, 1); shot)\\n\\nfunction LSLSFSF()\\n cyl .= 0\\n load(); spin(); load(); spin()\\n fire() && return true\\n spin(); return fire()\\nend\\n\\nfunction LSLSFF()\\n cyl .= 0\\n load(); spin(); load(); spin()\\n fire() && return true\\n return fire()\\nend\\n\\nfunction LLSFSF()\\n cyl .= 0\\n load(); load(); spin()\\n fire() && return true\\n spin(); return fire()\\nend\\n\\nfunction LLSFF()\\n cyl .= 0\\n load(); load(); spin()\\n fire() && return true\\n return fire()\\nend\\n\\nfunction testmethods(N = 10000000)\\n for (name, method) in [(\\\"load, spin, load, spin, fire, spin, fire\\\", LSLSFSF),\\n (\\\"load, spin, load, spin, fire, fire\\\", LSLSFF),\\n (\\\"load, load, spin, fire, spin, fire\\\", LLSFSF),\\n (\\\"load, load, spin, fire, fire\\\", LLSFF)]\\n percentage = 100 * sum([method() for _ in 1:N]) / N\\n println(\\\"Method $name produces $percentage per cent deaths.\\\")\\n end\\nend\\n\\ntestmethods()\\n\",\n \"language\": \"Julia\"\n },\n {\n \"code\": \"import kotlin.random.Random\\n\\nval cylinder = Array(6) { false }\\n\\nfun rShift() {\\n val t = cylinder[cylinder.size - 1]\\n for (i in (0 until cylinder.size - 1).reversed()) {\\n cylinder[i + 1] = cylinder[i]\\n }\\n cylinder[0] = t\\n}\\n\\nfun unload() {\\n for (i in cylinder.indices) {\\n cylinder[i] = false\\n }\\n}\\n\\nfun load() {\\n while (cylinder[0]) {\\n rShift()\\n }\\n cylinder[0] = true\\n rShift()\\n}\\n\\nfun spin() {\\n val lim = Random.nextInt(0, 6) + 1\\n for (i in 1..lim) {\\n rShift()\\n }\\n}\\n\\nfun fire(): Boolean {\\n val shot = cylinder[0]\\n rShift()\\n return shot\\n}\\n\\nfun method(s: String): Int {\\n unload()\\n for (c in s) {\\n when (c) {\\n 'L' -> {\\n load()\\n }\\n 'S' -> {\\n spin()\\n }\\n 'F' -> {\\n if (fire()) {\\n return 1\\n }\\n }\\n }\\n }\\n return 0\\n}\\n\\nfun mString(s: String): String {\\n val buf = StringBuilder()\\n fun append(txt: String) {\\n if (buf.isNotEmpty()) {\\n buf.append(\\\", \\\")\\n }\\n buf.append(txt)\\n }\\n for (c in s) {\\n when (c) {\\n 'L' -> {\\n append(\\\"load\\\")\\n }\\n 'S' -> {\\n append(\\\"spin\\\")\\n }\\n 'F' -> {\\n append(\\\"fire\\\")\\n }\\n }\\n }\\n return buf.toString()\\n}\\n\\nfun test(src: String) {\\n val tests = 100000\\n var sum = 0\\n\\n for (t in 0..tests) {\\n sum += method(src)\\n }\\n\\n val str = mString(src)\\n val pc = 100.0 * sum / tests\\n println(\\\"%-40s produces %6.3f%% deaths.\\\".format(str, pc))\\n}\\n\\nfun main() {\\n test(\\\"LSLSFSF\\\");\\n test(\\\"LSLSFF\\\");\\n test(\\\"LLSFSF\\\");\\n test(\\\"LLSFF\\\");\\n}\\n\",\n \"language\": \"Kotlin\"\n },\n {\n \"code\": \"ClearAll[Unload, Load, Spin, Fire]\\nUnload[] := ConstantArray[False, 6]\\nLoad[state_List] := Module[{s = state},\\n While[s[[2]],\\n s = RotateRight[s, 1]\\n ];\\n s[[2]] = True;\\n s\\n ]\\nSpin[state_List] := RotateRight[state, RandomInteger[{1, 6}]]\\nFire[state_List] := Module[{shot},\\n shot = First[state];\\n {RotateRight[state, 1], shot}\\n ]\\nClearAll[LSLSFSF]\\nLSLSFSF[] := Module[{state, shot},\\n state = Unload[];\\n state = Load[state];\\n state = Spin[state];\\n state = Load[state];\\n state = Spin[state];\\n {state, shot} = Fire[state];\\n If[shot,\\n Return[True]\\n ];\\n state = Spin[state];\\n {state, shot} = Fire[state];\\n If[shot,\\n Return[True]\\n ];\\n Return[False]\\n ]\\nClearAll[LSLSFF]\\nLSLSFF[] := Module[{state, shot},\\n state = Unload[];\\n state = Load[state];\\n state = Spin[state];\\n state = Load[state];\\n state = Spin[state];\\n {state, shot} = Fire[state];\\n If[shot,\\n Return[True]\\n ];\\n {state, shot} = Fire[state];\\n If[shot,\\n Return[True]\\n ];\\n Return[False]\\n ]\\nClearAll[LLSFSF]\\nLLSFSF[] := Module[{state, shot},\\n state = Unload[];\\n state = Load[state];\\n state = Load[state];\\n state = Spin[state];\\n {state, shot} = Fire[state];\\n If[shot,\\n Return[True]\\n ];\\n state = Spin[state];\\n {state, shot} = Fire[state];\\n If[shot,\\n Return[True]\\n ];\\n Return[False]\\n ]\\nClearAll[LLSFF]\\nLLSFF[] := Module[{state, shot},\\n state = Unload[];\\n state = Load[state];\\n state = Load[state];\\n state = Spin[state];\\n {state, shot} = Fire[state];\\n If[shot,\\n Return[True]\\n ];\\n {state, shot} = Fire[state];\\n If[shot,\\n Return[True]\\n ];\\n Return[False]\\n ]\\nn = 10^5;\\nCount[Table[LSLSFSF[], n], True]/N[n]\\nCount[Table[LSLSFF[], n], True]/N[n]\\nCount[Table[LLSFSF[], n], True]/N[n]\\nCount[Table[LLSFF[], n], True]/N[n]\\n\",\n \"language\": \"Mathematica\"\n },\n {\n \"code\": \"import algorithm, random, sequtils, strformat, strutils, tables\\n\\ntype\\n Revolver = array[6, bool]\\n Action {.pure.} = enum Load, Spin, Fire, Error\\n\\nconst Actions = {'L': Load, 'S': Spin, 'F': Fire}.toTable\\n\\nfunc spin(revolver: var Revolver; count: Positive) =\\n revolver.rotateLeft(-count)\\n\\nfunc load(revolver: var Revolver) =\\n while revolver[1]:\\n revolver.spin(1)\\n revolver[1] = true\\n revolver.spin(1)\\n\\nfunc fire(revolver: var Revolver): bool =\\n result = revolver[0]\\n revolver.spin(1)\\n\\nproc test(scenario: string) =\\n let actions = scenario.mapIt(Actions.getOrDefault(it, Error))\\n var deaths = 0\\n var count = 100_000\\n for _ in 1..count:\\n var revolver: Revolver\\n for action in actions:\\n case action\\n of Load:\\n revolver.load()\\n of Spin:\\n revolver.spin(rand(1..6))\\n of Fire:\\n if revolver.fire():\\n inc deaths\\n break\\n of Error:\\n raise newException(ValueError, \\\"encountered an unknown action.\\\")\\n echo &\\\"\\\"\\\"{100 * deaths / count:5.2f}% deaths for scenario {actions.join(\\\", \\\")}.\\\"\\\"\\\"\\n\\nrandomize()\\nfor scenario in [\\\"LSLSFSF\\\", \\\"LSLSFF\\\", \\\"LLSFSF\\\", \\\"LLSFF\\\"]:\\n test(scenario)\\n\",\n \"language\": \"Nim\"\n },\n {\n \"code\": \"/* imports */\\nimport \\\"core:fmt\\\"\\nimport \\\"core:strings\\\"\\nimport \\\"core:math/rand\\\"\\n/* globals */\\ncylinder := [6]bool{}\\n/* main block */\\nmain :: proc() {\\n\\trand.set_global_seed(42)\\n\\ttests := 100000\\n\\tsequence := [?]string{\\\"LSLSFSF\\\", \\\"LSLSFF\\\", \\\"LLSFSF\\\", \\\"LLSFF\\\"}\\n\\tfor m in sequence {\\n\\t\\tsum := 0\\n\\t\\tfor t in 0 ..< tests {\\n\\t\\t\\tsum += method(m)\\n\\t\\t}\\n\\t\\tpc: f64 = cast(f64)sum * 100 / cast(f64)tests\\n\\t\\tfmt.printf(\\\"%-40s produces %6.3f%% deaths.\\\\n\\\", mstring(m), pc)\\n\\t}\\n}\\n/* definitions */\\nrshift :: proc() {\\n\\tt := cylinder[len(cylinder) - 1]\\n\\tcopy(cylinder[1:], cylinder[0:])\\n\\tcylinder[0] = t\\n}\\nunload :: proc() {\\n\\tcylinder = false // array programming\\n}\\nload :: proc() {\\n\\tfor cylinder[0] {\\n\\t\\trshift()\\n\\t}\\n\\tcylinder[0] = true\\n\\trshift()\\n}\\nspin :: proc() {\\n\\tdata: []int = {1, 2, 3, 4, 5, 6}\\n\\tlim := rand.choice(data[:])\\n\\tfor i in 0 ..< lim {\\n\\t\\trshift()\\n\\t}\\n}\\nfire :: proc() -> bool {\\n\\tshot := cylinder[0]\\n\\trshift()\\n\\treturn shot\\n}\\nmethod :: proc(s: string) -> int {\\n\\tunload()\\n\\tfor character in s {\\n\\t\\tswitch character {\\n\\t\\tcase 'L':\\n\\t\\t\\tload()\\n\\t\\tcase 'S':\\n\\t\\t\\tspin()\\n\\t\\tcase 'F':\\n\\t\\t\\tif fire() {\\n\\t\\t\\t\\treturn 1\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\treturn 0\\n}\\nmstring :: proc(s: string) -> string {\\n\\tl: [dynamic]string\\n\\tfor character in s {\\n\\t\\tswitch character {\\n\\t\\tcase 'L':\\n\\t\\t\\tappend(&l, \\\"load\\\")\\n\\t\\tcase 'S':\\n\\t\\t\\tappend(&l, \\\"spin\\\")\\n\\t\\tcase 'F':\\n\\t\\t\\tappend(&l, \\\"fire\\\")\\n\\t\\t}\\n\\t}\\n\\treturn strings.join(l[:], \\\", \\\")\\n}\\n\",\n \"language\": \"Odin\"\n },\n {\n \"code\": \"use strict;\\nuse warnings;\\nuse feature 'say';\\n\\nmy @cyl;\\nmy $shots = 6;\\n\\nsub load {\\n push @cyl, shift @cyl while $cyl[1];\\n $cyl[1] = 1;\\n push @cyl, shift @cyl\\n}\\n\\nsub spin { push @cyl, shift @cyl for 0 .. int rand @cyl }\\nsub fire { push @cyl, shift @cyl; $cyl[0] }\\n\\nsub LSLSFSF {\\n @cyl = (0) x $shots;\\n load, spin, load, spin;\\n return 1 if fire;\\n spin;\\n fire\\n}\\n\\nsub LSLSFF {\\n @cyl = (0) x $shots;\\n load, spin, load, spin;\\n fire or fire\\n}\\n\\nsub LLSFSF {\\n @cyl = (0) x $shots;\\n load, load, spin;\\n return 1 if fire;\\n spin;\\n fire\\n}\\n\\nsub LLSFF {\\n @cyl = (0) x $shots;\\n load, load, spin;\\n fire or fire\\n}\\n\\nmy $trials = 10000;\\n\\nfor my $ref (<LSLSFSF LSLSFF LLSFSF LLSFF>) {\\n no strict 'refs';\\n my $total = 0;\\n $total += &$ref for 1..$trials;\\n printf \\\"%7s %.2f%%\\\\n\\\", $ref, $total / $trials * 100;\\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;\\\">spin</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #004080;\\\">sequence</span> <span style=\\\"color: #000000;\\\">revolver</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #004080;\\\">integer</span> <span style=\\\"color: #000000;\\\">count</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #008080;\\\">while</span> <span style=\\\"color: #000000;\\\">count</span> <span style=\\\"color: #008080;\\\">do</span>\\n <span style=\\\"color: #000000;\\\">revolver</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">revolver</span><span style=\\\"color: #0000FF;\\\">[$]&</span><span style=\\\"color: #000000;\\\">revolver</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;\\\">count</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;\\\">revolver</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;\\\">load</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #004080;\\\">sequence</span> <span style=\\\"color: #000000;\\\">revolver</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #008080;\\\">while</span> <span style=\\\"color: #000000;\\\">revolver</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;\\\">revolver</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">spin</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">revolver</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;\\\">while</span>\\n <span style=\\\"color: #000000;\\\">revolver</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: #004600;\\\">true</span>\\n <span style=\\\"color: #000000;\\\">revolver</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">spin</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">revolver</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #008080;\\\">return</span> <span style=\\\"color: #000000;\\\">revolver</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;\\\">fire</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #004080;\\\">sequence</span> <span style=\\\"color: #000000;\\\">revolver</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #004080;\\\">bool</span> <span style=\\\"color: #000000;\\\">dead</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #008080;\\\">if</span> <span style=\\\"color: #000000;\\\">revolver</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">]</span> <span style=\\\"color: #008080;\\\">then</span> <span style=\\\"color: #000000;\\\">dead</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #004600;\\\">true</span> <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">if</span>\\n <span style=\\\"color: #000000;\\\">revolver</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">spin</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">revolver</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #008080;\\\">return</span> <span style=\\\"color: #0000FF;\\\">{</span><span style=\\\"color: #000000;\\\">revolver</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">dead</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;\\\">procedure</span> <span style=\\\"color: #000000;\\\">test</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #004080;\\\">sequence</span> <span style=\\\"color: #000000;\\\">me</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #0000FF;\\\">{</span><span style=\\\"color: #004080;\\\">string</span> <span style=\\\"color: #000000;\\\">method</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #004080;\\\">atom</span> <span style=\\\"color: #000000;\\\">expected</span><span style=\\\"color: #0000FF;\\\">}</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">me</span>\\n <span style=\\\"color: #004080;\\\">integer</span> <span style=\\\"color: #000000;\\\">deaths</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">0</span><span style=\\\"color: #0000FF;\\\">,</span>\\n <span style=\\\"color: #000000;\\\">limit</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">100_000</span>\\n <span style=\\\"color: #008080;\\\">for</span> <span style=\\\"color: #000000;\\\">n</span><span style=\\\"color: #0000FF;\\\">=</span><span style=\\\"color: #000000;\\\">1</span> <span style=\\\"color: #008080;\\\">to</span> <span style=\\\"color: #000000;\\\">limit</span> <span style=\\\"color: #008080;\\\">do</span>\\n <span style=\\\"color: #004080;\\\">sequence</span> <span style=\\\"color: #000000;\\\">revolver</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;\\\">6</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #004080;\\\">bool</span> <span style=\\\"color: #000000;\\\">dead</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;\\\">method</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;\\\">method</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">i</span><span style=\\\"color: #0000FF;\\\">]</span>\\n <span style=\\\"color: #008080;\\\">switch</span> <span style=\\\"color: #000000;\\\">ch</span>\\n <span style=\\\"color: #008080;\\\">case</span> <span style=\\\"color: #008000;\\\">'L'</span><span style=\\\"color: #0000FF;\\\">:</span> <span style=\\\"color: #000000;\\\">revolver</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">load</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">revolver</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #008080;\\\">case</span> <span style=\\\"color: #008000;\\\">'S'</span><span style=\\\"color: #0000FF;\\\">:</span> <span style=\\\"color: #000000;\\\">revolver</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">spin</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">revolver</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #7060A8;\\\">rand</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">6</span><span style=\\\"color: #0000FF;\\\">))</span>\\n <span style=\\\"color: #008080;\\\">case</span> <span style=\\\"color: #008000;\\\">'F'</span><span style=\\\"color: #0000FF;\\\">:</span> <span style=\\\"color: #0000FF;\\\">{</span><span style=\\\"color: #000000;\\\">revolver</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">dead</span><span style=\\\"color: #0000FF;\\\">}</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">fire</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">revolver</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">dead</span><span style=\\\"color: #0000FF;\\\">)</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;\\\">for</span>\\n <span style=\\\"color: #000000;\\\">deaths</span> <span style=\\\"color: #0000FF;\\\">+=</span> <span style=\\\"color: #000000;\\\">dead</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;\\\">\\\"%s: %5.2f (expected %.2f%%)\\\\n\\\"</span><span style=\\\"color: #0000FF;\\\">,{</span><span style=\\\"color: #000000;\\\">method</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">100</span><span style=\\\"color: #0000FF;\\\">*</span><span style=\\\"color: #000000;\\\">deaths</span><span style=\\\"color: #0000FF;\\\">/</span><span style=\\\"color: #000000;\\\">limit</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">expected</span><span style=\\\"color: #0000FF;\\\">*</span><span style=\\\"color: #000000;\\\">100</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;\\\">\\\"Load/Spin/Fire method percentage fatalities:\\\\n\\\"</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #7060A8;\\\">papply</span><span style=\\\"color: #0000FF;\\\">({{</span><span style=\\\"color: #008000;\\\">\\\"LSLSFSF\\\"</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">5</span><span style=\\\"color: #0000FF;\\\">/</span><span style=\\\"color: #000000;\\\">9</span><span style=\\\"color: #0000FF;\\\">},{</span><span style=\\\"color: #008000;\\\">\\\"LSLSFF\\\"</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">7</span><span style=\\\"color: #0000FF;\\\">/</span><span style=\\\"color: #000000;\\\">12</span><span style=\\\"color: #0000FF;\\\">},{</span><span style=\\\"color: #008000;\\\">\\\"LLSFSF\\\"</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">5</span><span style=\\\"color: #0000FF;\\\">/</span><span style=\\\"color: #000000;\\\">9</span><span style=\\\"color: #0000FF;\\\">},{</span><span style=\\\"color: #008000;\\\">\\\"LLSFF\\\"</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;\\\">test</span><span style=\\\"color: #0000FF;\\\">)</span>\\n<!--\\n\",\n \"language\": \"Phix\"\n },\n {\n \"code\": \"\\\"\\\"\\\" Russian roulette problem \\\"\\\"\\\"\\nimport numpy as np\\n\\nclass Revolver:\\n \\\"\\\"\\\" simulates 6-shot revolving cylinger pistol \\\"\\\"\\\"\\n\\n def __init__(self):\\n \\\"\\\"\\\" start unloaded \\\"\\\"\\\"\\n self.cylinder = np.array([False] * 6)\\n\\n def unload(self):\\n \\\"\\\"\\\" empty all chambers of cylinder \\\"\\\"\\\"\\n self.cylinder[:] = False\\n\\n def load(self):\\n \\\"\\\"\\\" load a chamber (advance til empty if full already), then advance once \\\"\\\"\\\"\\n while self.cylinder[1]:\\n self.cylinder[:] = np.roll(self.cylinder, 1)\\n self.cylinder[1] = True\\n\\n def spin(self):\\n \\\"\\\"\\\" spin cylinder, randomizing position of chamber to be fired \\\"\\\"\\\"\\n self.cylinder[:] = np.roll(self.cylinder, np.random.randint(1, high=7))\\n\\n def fire(self):\\n \\\"\\\"\\\" pull trigger of revolver, return True if fired, False if did not fire \\\"\\\"\\\"\\n shot = self.cylinder[0]\\n self.cylinder[:] = np.roll(self.cylinder, 1)\\n return shot\\n\\n def LSLSFSF(self):\\n \\\"\\\"\\\" load, spin, load, spin, fire, spin, fire \\\"\\\"\\\"\\n self.unload()\\n self.load()\\n self.spin()\\n self.load()\\n self.spin()\\n if self.fire():\\n return True\\n self.spin()\\n if self.fire():\\n return True\\n return False\\n\\n def LSLSFF(self):\\n \\\"\\\"\\\" load, spin, load, spin, fire, fire \\\"\\\"\\\"\\n self.unload()\\n self.load()\\n self.spin()\\n self.load()\\n self.spin()\\n if self.fire():\\n return True\\n if self.fire():\\n return True\\n return False\\n\\n def LLSFSF(self):\\n \\\"\\\"\\\" load, load, spin, fire, spin, fire \\\"\\\"\\\"\\n self.unload()\\n self.load()\\n self.load()\\n self.spin()\\n if self.fire():\\n return True\\n self.spin()\\n if self.fire():\\n return True\\n return False\\n\\n def LLSFF(self):\\n \\\"\\\"\\\" load, load, spin, fire, fire \\\"\\\"\\\"\\n self.unload()\\n self.load()\\n self.load()\\n self.spin()\\n if self.fire():\\n return True\\n if self.fire():\\n return True\\n return False\\n\\n\\nif __name__ == '__main__':\\n\\n REV = Revolver()\\n TESTCOUNT = 100000\\n for (name, method) in [['load, spin, load, spin, fire, spin, fire', REV.LSLSFSF],\\n ['load, spin, load, spin, fire, fire', REV.LSLSFF],\\n ['load, load, spin, fire, spin, fire', REV.LLSFSF],\\n ['load, load, spin, fire, fire', REV.LLSFF]]:\\n\\n percentage = 100 * sum([method() for _ in range(TESTCOUNT)]) / TESTCOUNT\\n print(\\\"Method\\\", name, \\\"produces\\\", percentage, \\\"per cent deaths.\\\")\\n\",\n \"language\": \"Python\"\n },\n {\n \"code\": \"unit sub MAIN ($shots = 6);\\n\\nmy @cyl;\\n\\nsub load () {\\n @cyl.=rotate(-1) while @cyl[1];\\n @cyl[1] = 1;\\n @cyl.=rotate(-1);\\n}\\n\\nsub spin () { @cyl.=rotate: (^@cyl).pick }\\n\\nsub fire () { @cyl.=rotate; @cyl[0] }\\n\\nsub LSLSFSF {\\n @cyl = 0 xx $shots;\\n load, spin, load, spin;\\n return 1 if fire;\\n spin;\\n fire\\n}\\n\\nsub LSLSFF {\\n @cyl = 0 xx $shots;\\n load, spin, load, spin;\\n fire() || fire\\n}\\n\\nsub LLSFSF {\\n @cyl = 0 xx $shots;\\n load, load, spin;\\n return 1 if fire;\\n spin;\\n fire\\n}\\n\\nsub LLSFF {\\n @cyl = 0 xx $shots;\\n load, load, spin;\\n fire() || fire\\n}\\n\\nmy %revolver;\\nmy $trials = 100000;\\n\\nfor ^$trials {\\n %revolver<LSLSFSF> += LSLSFSF;\\n %revolver<LSLSFF> += LSLSFF;\\n %revolver<LLSFSF> += LLSFSF;\\n %revolver<LLSFF> += LLSFF;\\n}\\n\\nsay \\\"{.fmt('%7s')}: %{(%revolver{$_} / $trials × 100).fmt('%.2f')}\\\"\\n for <LSLSFSF LSLSFF LLSFSF LLSFF>\\n\",\n \"language\": \"Raku\"\n },\n {\n \"code\": \"/*REXX pgm simulates scenarios for a two─bullet Russian roulette game with a 6 cyl. gun.*/\\nparse arg cyls tests seed . /*obtain optional arguments from the CL*/\\nif cyls=='' | cyls==\\\",\\\" then cyls= 6 /*Not specified? Then use the default.*/\\nif tests=='' | tests==\\\",\\\" then tests= 100000 /* \\\" \\\" \\\" \\\" \\\" \\\" */\\nif datatype(seed, 'W') then call random ,,seed /* \\\" \\\" \\\" \\\" \\\" \\\" */\\ncyls_ = cyls - 1; @0= copies(0, cyls) /*shortcut placeholder for cylinders-1 */\\n@abc= 'ABCDEFGHIJKLMNOPQRSTUVWXYZ' /*indices for the various options used.*/\\nscenarios= 'LSLSFsF LSLSFF LLSFSF LLSFF' /*the list of scenarios to be tested. */\\n#= words(scenarios) /*the number of actions in a scenario. */\\n /*The scenarios are case insensitive. */\\n do m=1 for #; q= word(scenarios, m) /*test each of the scenarios specified.*/\\n sum= 0 /*initialize the sum to zero. */\\n do tests; sum= sum + method() /*added the sums up for the percentages*/\\n end /*tests*/\\n pc= left( (sum * 100 / tests)\\\"%\\\", 7)\\n say act() ' (option' substr(@abc, m, 1)\\\") produces \\\" pc ' deaths.'\\n end /*m*/\\nexit 0 /*stick a fork in it, we're all done. */\\n/*──────────────────────────────────────────────────────────────────────────────────────*/\\nfire: != left(@, 1); @= right(@, cyls_)left(@, 1); /* ◄──── next cyl.*/ return !\\nload: if left(@, 1) then @= right(@, cyls_)left(@, 1); @= 1||right(@, cyls_); return\\nspin: ?= random(1, cyls); if ?\\\\==cyls then @= substr(@ || @, ? + 1, cyls); return\\n/*──────────────────────────────────────────────────────────────────────────────────────*/\\nmethod: @= @0; do a=1 for length(q); y= substr(q, a, 1)\\n if y=='L' then call load\\n else if y=='S' then call spin\\n else if y=='F' then if fire() then return 1\\n end /*a*/; return 0\\n/*──────────────────────────────────────────────────────────────────────────────────────*/\\nact: $=; do a=1 for length(q); y= substr(q, a, 1)\\n if y=='L' then $= $\\\", load\\\"\\n if y=='S' then $= $\\\", spin\\\"\\n if y=='F' then $= $\\\", fire\\\"\\n end /*a*/; return right( strip( strip($, , \\\",\\\") ), 45)\\n\",\n \"language\": \"REXX\"\n },\n {\n \"code\": \"class Revolver\\n attr_accessor :strategy\\n attr_reader :notches, :shot_count\\n\\n def initialize(strategy = [:load, :spin, :shoot], num_chambers = 6) # default like Deer hunter\\n @chambers = Array.new(num_chambers) # by default 6 nils\\n @strategy = strategy\\n @notches, @shot_count, @loaded_count = 0, 0, 0\\n end\\n\\n def load\\n raise \\\"gun completely loaded \\\" if @chambers.all? :loaded\\n @chambers.rotate! until @chambers[1] == nil #not sure about this; Raku rotates -1\\n @chambers[1] = :loaded\\n @chambers.rotate! #not sure about this; Raku rotates -1\\n @loaded_count += 1\\n end\\n\\n def spin\\n @chambers.rotate!(rand(1..@chambers.size))\\n end\\n\\n def unload\\n @chambers.fill(nil)\\n @loaded_count = 0\\n end\\n\\n def shoot\\n @chambers[0] = nil\\n @chambers.rotate!\\n end\\n\\n def play\\n strategy.each{|action| send(action)}\\n @shot_count += 1\\n @notches += 1 unless @chambers.count(:loaded) == @loaded_count # all bullets still there?\\n unload\\n end\\nend\\n\\nstrategies = {:A => [:load, :spin, :load, :spin, :shoot, :spin, :shoot],\\n :B => [:load, :spin, :load, :spin, :shoot, :shoot],\\n :C => [:load, :load, :spin, :shoot, :spin, :shoot],\\n :D => [:load, :load, :spin, :shoot, :shoot],\\n :E => [:load, :spin, :shoot, :load, :spin, :shoot]}\\n\\nn = 100_000\\nputs \\\"simulation of #{n} runs:\\\"\\nstrategies.each do |name, strategy|\\n gun = Revolver.new(strategy) # Revolver.new(strategy, 10) for a 10-shooter\\n n.times{gun.play}\\n puts \\\"Strategy #{name}: #{gun.notches.fdiv(gun.shot_count)}\\\"\\nend\\n\",\n \"language\": \"Ruby\"\n },\n {\n \"code\": \"import rand\\n\\n__global cylinder = []bool{len:6}\\n\\nfn main() {\\n\\ttest(\\\"LSLSFSF\\\")\\n\\ttest(\\\"LSLSFF\\\")\\n\\ttest(\\\"LLSFSF\\\")\\n\\ttest(\\\"LLSFF\\\")\\n}\\n\\nfn test(src string) {\\n\\ttests := 100000\\n\\tmut sum := 0\\n\\tfor _ in 0..tests {\\n\\t\\tsum += method(src)\\n\\t}\\n\\tprintln('${m_string(src)} produces ${100.0 * f32(sum) / f32(tests)}% deaths.')\\n}\\n\\nfn rshift() {\\n\\tt := cylinder[5]\\n\\tfor i := 4; i >= 0; i-- {\\n\\t\\tcylinder[i+1] = cylinder[i]\\n\\t}\\n\\tcylinder[0] = t\\n}\\n\\nfn unload() {\\n\\tfor i := 0; i < 6; i++ {\\n\\t\\tcylinder[i] = false\\n\\t}\\n}\\n\\nfn load() {\\n\\tfor cylinder[0] {\\n\\t\\trshift()\\n\\t}\\n\\tcylinder[0] = true\\n\\trshift()\\n}\\n\\nfn spin() {\\n\\tmut lim := 1 + rand.intn(6) or {exit(1)}\\n\\tfor i := 1; i < lim; i++ {\\n\\t\\trshift()\\n\\t}\\n}\\n\\nfn fire() bool {\\n\\tshot := cylinder[0]\\n\\trshift()\\n\\treturn shot\\n}\\n\\nfn method(s string) int {\\n\\tunload()\\n\\tfor c in s {\\n\\t\\tmatch c.ascii_str() {\\n\\t\\t\\t'L' {load()}\\n\\t\\t\\t'S' {spin()}\\n\\t\\t\\t'F' {if fire() == true {return 1}}\\n\\t\\t\\telse {}\\n\\t\\t}\\n\\t}\\n\\treturn 0\\n}\\n\\nfn m_string(s string) string {\\n\\tmut l := []string{}\\n\\tfor c in s {\\n\\t\\tmatch c.ascii_str() {\\n\\t\\t 'L' {l << \\\"load\\\"}\\n\\t\\t 'S' {l << \\\"spin\\\"}\\n\\t\\t 'F' {l << \\\"fire\\\"}\\n\\t\\t else {}\\n\\t\\t}\\n\\t}\\n\\treturn l.join(', ')\\n}\\n\",\n \"language\": \"V-(Vlang)\"\n },\n {\n \"code\": \"import \\\"random\\\" for Random\\nimport \\\"./fmt\\\" for Fmt\\n\\nvar Rand = Random.new()\\n\\nclass Revolver {\\n construct new() {\\n _cylinder = List.filled(6, false)\\n }\\n\\n rshift() {\\n var t = _cylinder[-1]\\n for (i in 4..0) _cylinder[i+1] = _cylinder[i]\\n _cylinder[0] = t\\n }\\n\\n unload() {\\n for (i in 0..5) _cylinder[i] = false\\n }\\n\\n load() {\\n while (_cylinder[0]) rshift()\\n _cylinder[0] = true\\n rshift()\\n }\\n\\n spin() {\\n for (i in 1..Rand.int(1, 7)) rshift()\\n }\\n\\n fire() {\\n var shot = _cylinder[0]\\n rshift()\\n return shot\\n }\\n\\n method(s) {\\n unload()\\n for (c in s) {\\n if (c == \\\"L\\\") {\\n load()\\n } else if (c == \\\"S\\\") {\\n spin()\\n } else if (c == \\\"F\\\") {\\n if (fire()) return 1\\n }\\n }\\n return 0\\n }\\n\\n static mstring(s) {\\n var l = []\\n for (c in s) {\\n if (c == \\\"L\\\") {\\n l.add(\\\"load\\\")\\n } else if (c == \\\"S\\\") {\\n l.add(\\\"spin\\\")\\n } else if (c == \\\"F\\\") {\\n l.add(\\\"fire\\\")\\n }\\n }\\n return l.join(\\\", \\\")\\n }\\n}\\n\\nvar rev = Revolver.new()\\nvar tests = 100000\\nfor (m in [\\\"LSLSFSF\\\", \\\"LSLSFF\\\", \\\"LLSFSF\\\", \\\"LLSFF\\\"]) {\\n var sum = 0\\n for (t in 1..tests) sum = sum + rev.method(m)\\n Fmt.print(\\\"$-40s produces $6.3f\\\\% deaths.\\\", Revolver.mstring(m), sum * 100 / tests)\\n}\\n\",\n \"language\": \"Wren\"\n }\n]","isConversational":false},"task_name":{"kind":"string","value":"Two-bullet-roulette"}}},{"rowIdx":1778,"cells":{"solutions":{"kind":"list like","value":[{"code":"---\ncategory:\n- String algorithms\nfrom: http://rosettacode.org/wiki/Ukkonen’s_suffix_tree_construction\n","language":"00-META"},{"code":"Suffix Trees are very useful in numerous string processing and computational biology problems.\n\nThe task is to create a function which implements Ukkonen’s algorithm to create a useful Suffix Tree as described:\n\n [http://www.geeksforgeeks.org/ukkonens-suffix-tree-construction-part-1/ Part 1]\n [http://www.geeksforgeeks.org/ukkonens-suffix-tree-construction-part-2/ Part 2]\n [http://www.geeksforgeeks.org/ukkonens-suffix-tree-construction-part-3/ Part 3]\n [http://www.geeksforgeeks.org/ukkonens-suffix-tree-construction-part-4/ Part 4]\n [http://www.geeksforgeeks.org/ukkonens-suffix-tree-construction-part-5/ Part 5]\n [http://www.geeksforgeeks.org/ukkonens-suffix-tree-construction-part-6/ Part 6]\n\nUsing [[Arithmetic-geometric mean/Calculate Pi]] generate the first 1000, 10000, and 100000 decimal places of pi. Using your implementation with an alphabet of 0 through 9 (plus $ say to make the tree explicit) find the longest repeated string in each list. Time your results and demonstrate that your implementation is linear (i.e. that 10000 takes approx. 10 times as long as 1000). You may vary the size of the lists of decimal places of pi to give reasonable answers.\n\n","language":"00-TASK"},{"code":"package main\n\nimport (\n \"fmt\"\n \"math/big\"\n \"time\"\n)\n\nvar maxChar = 128\n\ntype Node struct {\n children []*Node\n suffixLink *Node\n start int\n end *int\n suffixIndex int\n}\n\nvar (\n text string\n root *Node\n lastNewNode *Node\n activeNode *Node\n activeEdge = -1\n activeLength = 0\n remainingSuffixCount = 0\n leafEnd = -1\n rootEnd *int\n splitEnd *int\n size = -1\n)\n\nfunc newNode(start int, end *int) *Node {\n node := new(Node)\n node.children = make([]*Node, maxChar)\n node.suffixLink = root\n node.start = start\n node.end = end\n node.suffixIndex = -1\n return node\n}\n\nfunc edgeLength(n *Node) int {\n if n == root {\n return 0\n }\n return *(n.end) - n.start + 1\n}\n\nfunc walkDown(currNode *Node) bool {\n if activeLength >= edgeLength(currNode) {\n activeEdge += edgeLength(currNode)\n activeLength -= edgeLength(currNode)\n activeNode = currNode\n return true\n }\n return false\n}\n\nfunc extendSuffixTree(pos int) {\n leafEnd = pos\n remainingSuffixCount++\n lastNewNode = nil\n for remainingSuffixCount > 0 {\n if activeLength == 0 {\n activeEdge = pos\n }\n if activeNode.children[text[activeEdge]] == nil {\n activeNode.children[text[activeEdge]] = newNode(pos, &leafEnd)\n if lastNewNode != nil {\n lastNewNode.suffixLink = activeNode\n lastNewNode = nil\n }\n } else {\n next := activeNode.children[text[activeEdge]]\n if walkDown(next) {\n continue\n }\n if text[next.start+activeLength] == text[pos] {\n if lastNewNode != nil && activeNode != root {\n lastNewNode.suffixLink = activeNode\n lastNewNode = nil\n }\n activeLength++\n break\n }\n temp := next.start + activeLength - 1\n splitEnd = &temp\n split := newNode(next.start, splitEnd)\n activeNode.children[text[activeEdge]] = split\n split.children[text[pos]] = newNode(pos, &leafEnd)\n next.start += activeLength\n split.children[text[next.start]] = next\n if lastNewNode != nil {\n lastNewNode.suffixLink = split\n }\n lastNewNode = split\n }\n remainingSuffixCount--\n if activeNode == root && activeLength > 0 {\n activeLength--\n activeEdge = pos - remainingSuffixCount + 1\n } else if activeNode != root {\n activeNode = activeNode.suffixLink\n }\n }\n}\n\nfunc setSuffixIndexByDFS(n *Node, labelHeight int) {\n if n == nil {\n return\n }\n if n.start != -1 {\n // Uncomment line below to print suffix tree\n // fmt.Print(text[n.start: *(n.end) +1])\n }\n leaf := 1\n for i := 0; i < maxChar; i++ {\n if n.children[i] != nil {\n // Uncomment the 3 lines below to print suffix index\n //if leaf == 1 && n.start != -1 {\n // fmt.Printf(\" [%d]\\n\", n.suffixIndex)\n //}\n leaf = 0\n setSuffixIndexByDFS(n.children[i], labelHeight+edgeLength(n.children[i]))\n }\n }\n if leaf == 1 {\n n.suffixIndex = size - labelHeight\n // Uncomment line below to print suffix index\n //fmt.Printf(\" [%d]\\n\", n.suffixIndex)\n }\n}\n\nfunc buildSuffixTree() {\n size = len(text)\n temp := -1\n rootEnd = &temp\n root = newNode(-1, rootEnd)\n activeNode = root\n for i := 0; i < size; i++ {\n extendSuffixTree(i)\n }\n labelHeight := 0\n setSuffixIndexByDFS(root, labelHeight)\n}\n\nfunc doTraversal(n *Node, labelHeight int, maxHeight, substringStartIndex *int) {\n if n == nil {\n return\n }\n if n.suffixIndex == -1 {\n for i := 0; i < maxChar; i++ {\n if n.children[i] != nil {\n doTraversal(n.children[i], labelHeight+edgeLength(n.children[i]),\n maxHeight, substringStartIndex)\n }\n }\n } else if n.suffixIndex > -1 && (*maxHeight < labelHeight-edgeLength(n)) {\n *maxHeight = labelHeight - edgeLength(n)\n *substringStartIndex = n.suffixIndex\n }\n}\n\nfunc getLongestRepeatedSubstring(s string) {\n maxHeight := 0\n substringStartIndex := 0\n doTraversal(root, 0, &maxHeight, &substringStartIndex)\n // Uncomment line below to print maxHeight and substringStartIndex\n // fmt.Printf(\"maxHeight %d, substringStartIndex %d\\n\", maxHeight, substringStartIndex)\n if s == \"\" {\n fmt.Printf(\" %s is: \", text)\n } else {\n fmt.Printf(\" %s is: \", s)\n }\n k := 0\n for ; k < maxHeight; k++ {\n fmt.Printf(\"%c\", text[k+substringStartIndex])\n }\n if k == 0 {\n fmt.Print(\"No repeated substring\")\n }\n fmt.Println()\n}\n\nfunc calculatePi() *big.Float {\n one := big.NewFloat(1)\n two := big.NewFloat(2)\n four := big.NewFloat(4)\n prec := uint(325 * 1024) // enough to calculate Pi to 100,182 decimal digits\n\n a := big.NewFloat(1).SetPrec(prec)\n g := new(big.Float).SetPrec(prec)\n\n // temporary variables\n t := new(big.Float).SetPrec(prec)\n u := new(big.Float).SetPrec(prec)\n\n g.Quo(a, t.Sqrt(two))\n sum := new(big.Float)\n pow := big.NewFloat(2)\n\n for a.Cmp(g) != 0 {\n t.Add(a, g)\n t.Quo(t, two)\n g.Sqrt(u.Mul(a, g))\n a.Set(t)\n pow.Mul(pow, two)\n t.Sub(t.Mul(a, a), u.Mul(g, g))\n sum.Add(sum, t.Mul(t, pow))\n }\n\n t.Mul(a, a)\n t.Mul(t, four)\n pi := t.Quo(t, u.Sub(one, sum))\n return pi\n}\n\nfunc main() {\n tests := []string{\n \"GEEKSFORGEEKS$\",\n \"AAAAAAAAAA$\",\n \"ABCDEFG$\",\n \"ABABABA$\",\n \"ATCGATCGA$\",\n \"banana$\",\n \"abcpqrabpqpq$\",\n \"pqrpqpqabab$\",\n }\n fmt.Println(\"Longest Repeated Substring in:\\n\")\n for _, test := range tests {\n text = test\n buildSuffixTree()\n getLongestRepeatedSubstring(\"\")\n }\n fmt.Println()\n\n pi := calculatePi()\n piStr := fmt.Sprintf(\"%v\", pi)\n piStr = piStr[2:] // remove initial 3.\n numbers := []int{1e3, 1e4, 1e5}\n maxChar = 58\n for _, number := range numbers {\n start := time.Now()\n text = piStr[0:number] + \"$\"\n buildSuffixTree()\n getLongestRepeatedSubstring(fmt.Sprintf(\"first %d d.p. of Pi\", number))\n elapsed := time.Now().Sub(start)\n fmt.Printf(\" (this took %s)\\n\\n\", elapsed)\n }\n}\n","language":"Go"},{"code":"import java.io.IOException;\nimport java.nio.file.Files;\nimport java.nio.file.Path;\nimport java.util.ArrayList;\nimport java.util.Arrays;\nimport java.util.HashMap;\nimport java.util.Iterator;\nimport java.util.List;\nimport java.util.Map;\nimport java.util.Set;\nimport java.util.TreeSet;\n\npublic final class UkkonenSuffixTree {\n\n\tpublic static void main(String[] aArgs) throws IOException {\t\t\n\t\tList<Integer> limits = List.of( 1_000, 10_000, 100_000 );\n\t\t\n\t\tfor ( int limit : limits ) {\n\t\t\tString contents = Files.readString(Path.of(\"piDigits.txt\"));\n\t\t\tString piDigits = contents.substring(0, limit + 1);\n\t\t\t\n\t\t\tfinal long start = System.currentTimeMillis();\t\t\t\n\t\t\tSuffixTree tree = new SuffixTree(piDigits);\t\t\t\n\t\t\tMap<String, Set<Integer>> substrings = tree.getLongestRepeatedSubstrings();\t\t\t\n\t\t\tfinal long finish = System.currentTimeMillis();\n\t\t\t\n\t\t\tSystem.out.println(\"First \" + limit + \" digits of pi has longest repeated characters:\");\n\t\t\tfor ( String substring : substrings.keySet() ) {\n\t\t\t\tSystem.out.print(\" '\" + substring + \"' starting at index \");\n\t\t\t\tfor ( Iterator<Integer> iterator = substrings.get(substring).iterator(); iterator.hasNext(); ) {\n\t\t\t\t\tSystem.out.print(iterator.next());\n\t\t\t\t\tif ( iterator.hasNext() ) {\n\t\t\t\t\t\tSystem.out.print(\" and \");\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tSystem.out.println();\n\t\t\t}\n\t\t\t\n\t\t\tSystem.out.println(\"Time taken: \" + ( finish - start ) + \" milliseconds.\" + System.lineSeparator());\n\t\t}\n\t\t\n\t\tSystem.out.println(\"The timings show that the implementation has approximately linear performance.\");\n\t}\n\n\tprivate final static class SuffixTree {\n\t\t\n\t\tpublic SuffixTree(String aWord) {\n\t\t\ttext = Arrays.copyOfRange(aWord.toCharArray(), 0, aWord.length() + 1);\n\t\t\ttext[aWord.length()] = '\\uF123'; // Terminal character\n\t\t\t\n\t\t\tnodes = new Node[2 * aWord.length() + 2];\n\t root = newNode(UNDEFINED, UNDEFINED);\n\t activeNode = root;\n\t\n\t\t\tfor ( char character : text ) {\n\t\t\t\textendSuffixTree(character);\n\t\t\t}\t\t\t\t\n\t\t}\n\t\t\n\t\tpublic Map<String, Set<Integer>> getLongestRepeatedSubstrings() {\n\t\t\tList<Integer> indexes = doTraversal();\n\t\t\tString word = String.valueOf(text).substring(0, text.length - 1);\n\t\t\tMap<String, Set<Integer>> result = new HashMap<String, Set<Integer>>();\n\t\t\t\n\t\t\tif ( indexes.get(0) > 0 ) {\n\t\t\t\tfor ( int i = 1; i < indexes.size(); i++ ) {\n\t\t\t\t\tString substring = word.substring(indexes.get(i), indexes.get(i) + indexes.get(0));\t\t\t\n\t\t\t\t\tresult.computeIfAbsent(substring, k -> new TreeSet<Integer>()).add(indexes.get(i));\t\n\t\t\t\t}\n\t\t\t}\n\t\t\t\n\t\t\treturn result;\n\t\t}\t\n\t\n\t\t// PRIVATE //\n\t\t\n\t\tprivate void extendSuffixTree(char aCharacter) {\n\t needParentLink = UNDEFINED;\n\t remainder++;\n\t\n\t while ( remainder > 0 ) {\n\t if ( activeLength == 0 ) {\n\t \tactiveEdge = textIndex;\n\t }\n\t\n\t if ( ! nodes[activeNode].children.containsKey(text[activeEdge]) ) {\n\t final int leaf = newNode(textIndex, LEAF_NODE);\n\t nodes[activeNode].children.put(text[activeEdge], leaf);\n\t addSuffixLink(activeNode);\n\t } else {\n\t final int next = nodes[activeNode].children.get(text[activeEdge]);\n\t if ( walkDown(next) ) {\n\t \tcontinue;\n\t }\n\t\n\t if ( text[nodes[next].start + activeLength] == aCharacter ) {\n\t activeLength++;\n\t addSuffixLink(activeNode);\n\t break;\n\t }\n\t\n\t final int split = newNode(nodes[next].start, nodes[next].start + activeLength);\n\t nodes[activeNode].children.put(text[activeEdge], split);\n\t final int leaf = newNode(textIndex, LEAF_NODE);\n\t nodes[split].children.put(aCharacter, leaf);\n\t nodes[next].start += activeLength;\n\t nodes[split].children.put(text[nodes[next].start], next);\n\t addSuffixLink(split);\n\t }\n\t\n\t remainder--;\n\t\n\t if ( activeNode == root && activeLength > 0 ) {\n\t activeLength--;\n\t activeEdge = textIndex - remainder + 1;\n\t } else {\n\t activeNode = ( nodes[activeNode].parentLink > 0 ) ? nodes[activeNode].parentLink : root;\n\t }\n\t }\n\t\n\t textIndex++;\n\t }\n\t\t\n\t\tprivate boolean walkDown(int aNode) {\n\t if ( activeLength >= nodes[aNode].edgeLength() ) {\n\t activeEdge += nodes[aNode].edgeLength();\n\t activeLength -= nodes[aNode].edgeLength();\n\t activeNode = aNode;\n\t\n\t return true;\n\t }\n\t\n\t return false;\n\t }\n\t\t\n\t\tprivate void addSuffixLink(int aNode) {\n\t if ( needParentLink != UNDEFINED ) {\n\t nodes[needParentLink].parentLink = aNode;\n\t }\n\t\n\t needParentLink = aNode;\n\t }\n\t\t\n\t\tprivate int newNode(int aStart, int aEnd) {\n\t\t\tNode node = new Node(aStart, aEnd);\n\t\t\tnode.leafIndex = ( aEnd == LEAF_NODE ) ? leafIndexGenerator++ : UNDEFINED;\n\t\t\tnodes[currentNode] = node;\n\t\n\t return currentNode++;\n\t }\n\t\n\t\tprivate List<Integer> doTraversal() {\n\t\t\tList<Integer> indexes = new ArrayList<Integer>();\n\t\t\tindexes.add(UNDEFINED);\t\t\n\t\n\t\t\treturn traversal(indexes, nodes[root], 0);\n\t\t}\t\t\n\t\t\n\t\tprivate List<Integer> traversal(List<Integer> aIndexes, Node aNode, int aHeight) {\n\t\t\tif ( aNode.leafIndex == UNDEFINED ) {\n\t\t\t\tfor ( int index : aNode.children.values() ) {\n\t\t\t Node child = nodes[index];\n\t\t\t traversal(aIndexes, child, aHeight + child.edgeLength());\n\t\t\t\t}\n\t\t\t} else if ( aIndexes.get(0) < aHeight - aNode.edgeLength() ) {\n\t\t\t\taIndexes.clear();\n\t\t\t\taIndexes.add(aHeight - aNode.edgeLength());\n\t\t\t\taIndexes.add(aNode.leafIndex);\n\t\t\t} else if ( aIndexes.get(0) == aHeight - aNode.edgeLength() ) {\n\t\t\t aIndexes.add(aNode.leafIndex);\n\t\t\t}\t\t\n\t\t\t\n\t\t\treturn aIndexes;\n\t\t}\n\t\n\t private final class Node {\n\t \t\n\t \tpublic Node(int aStart, int aEnd) {\n\t start = aStart;\n\t end = aEnd;\n\t }\n\t \t\n\t \tpublic int edgeLength() {\n\t return Math.min(end, textIndex + 1) - start;\n\t }\n\t\n\t private int start, end, parentLink, leafIndex;\n\t private Map<Character, Integer> children = new HashMap<Character, Integer>();\n\t\n\t }\n\t\n\t private Node[] nodes;\n\t private char[] text;\n\t private int activeNode, activeLength, activeEdge;\n\t private int root, textIndex, currentNode, needParentLink, remainder, leafIndexGenerator;\n\t\n\t private static final int UNDEFINED = -1;\n\t private static final int LEAF_NODE = Integer.MAX_VALUE;\n\t\n\t}\n\n}\n","language":"Java"},{"code":"const oo = typemax(Int)\n\n\"\"\"The suffix-tree's node.\"\"\"\nmutable struct Node\n children::Dict{Char, Int}\n start::Int\n ending::Int\n suffixlink::Int\n suffixindex::Int\nend\n\nNode() = Node(Dict(), 0, oo, 0, -1)\nNode(start, ending) = Node(Dict(), start, ending, 0, -1)\n\n\"\"\" Ukkonen Suffix-Tree \"\"\"\nmutable struct SuffixTree\n nodes::Vector{Node}\n text::Vector{Char}\n root::Int\n position::Int\n currentnode::Int\n needsuffixlink::Int\n remainder::Int\n activenode::Int\n activelength::Int\n activeedge::Int\nend\n\nedgelength(st, n::Node) = min(n.ending, st.position + 1) - n.start\n\nfunction newnode(st, start, ending)\n st.currentnode += 1\n st.nodes[st.currentnode] = Node(start, ending)\n return st.currentnode\nend\n\nfunction SuffixTree(str::String)\n nodes = [Node() for _ in 1:length(str) * 2]\n st = SuffixTree(nodes, [c for c in str], 1, 0, 0, 0, 0, 1, 1, 1)\n st.root = newnode(st, 0, 0)\n st.activenode = st.root\n for i in 1:length(st.text)\n extendsuffixtree(st, i)\n end\n setsuffixindexbyDFS(st, st.nodes[st.root], 0)\n return st\nend\n\nfunction addsuffixlink(st, nodenum::Int)\n if st.needsuffixlink > 0\n st.nodes[st.needsuffixlink].suffixlink = nodenum\n end\n st.needsuffixlink = nodenum\nend\n\nactiveedge(st) = st.text[st.activeedge]\n\nfunction walkdown!(st, currnode::Int)\n len = edgelength(st, st.nodes[currnode])\n st.activelength < len && return false\n st.activeedge += len\n st.activelength -= len\n st.activenode = currnode\n return true\nend\n\nfunction extendsuffixtree(st, pos)\n st.position = pos\n st.needsuffixlink = 0\n st.remainder += 1\n while st.remainder > 0\n st.activelength == 0 && (st.activeedge = st.position)\n if !haskey(st.nodes[st.activenode].children, activeedge(st))\n nodenum = newnode(st, st.position, oo)\n st.nodes[st.activenode].children[activeedge(st)] = nodenum\n addsuffixlink(st, st.activenode)\n else\n next = st.nodes[st.activenode].children[activeedge(st)]\n walkdown!(st, next) && continue\n if st.text[st.nodes[next].start + st.activelength] == st.text[pos]\n addsuffixlink(st, st.activenode)\n st.activelength += 1\n break\n end\n splt = newnode(st, st.nodes[next].start, st.nodes[next].start + st.activelength)\n st.nodes[st.activenode].children[activeedge(st)] = splt\n nodenum = newnode(st, st.position, oo)\n st.nodes[splt].children[st.text[pos]] = nodenum\n st.nodes[next].start += st.activelength\n st.nodes[splt].children[st.text[st.nodes[next].start]] = next\n addsuffixlink(st, splt)\n end\n st.remainder -= 1\n if st.activenode == st.root && st.activelength > 0\n st.activelength -= 1\n st.activeedge = st.position - st.remainder + 1\n elseif st.activenode != st.root\n st.activenode = st.nodes[st.activenode].suffixlink\n end\n end\nend\n\nfunction setsuffixindexbyDFS(st, node, labelheight, verbose=false)\n verbose && node.start > 0 && print(st.text[node.start:min(node.ending, length(st.text))])\n isleaf = true\n for child in map(v -> st.nodes[v], collect(values(node.children)))\n verbose && isleaf && node.start > 0 && println(\" [\", node.suffixindex, \"]\")\n isleaf = false\n setsuffixindexbyDFS(st, child, labelheight + edgelength(st, child))\n end\n if isleaf\n idx = length(st.text) - labelheight\n node.suffixindex = idx\n verbose && println(\" [$idx]\")\n end\nend\n\nfunction dotraversal(st)\n maxheight, substringstartindices = 0, [0]\n function traversal(node::Node, labelheight)\n if node.suffixindex == -1\n for child in map(v -> st.nodes[v], collect(values(node.children)))\n traversal(child, labelheight + edgelength(st, child))\n end\n elseif maxheight < labelheight - edgelength(st, node)\n maxheight = labelheight - edgelength(st, node)\n substringstartindices = [node.suffixindex + 1]\n elseif maxheight == labelheight - edgelength(st, node)\n push!(substringstartindices, node.suffixindex + 1)\n end\n end\n traversal(st.nodes[st.root], 0)\n return maxheight, substringstartindices\nend\n\nfunction getlongestrepeatedsubstring(st::SuffixTree, label=\"\", printresult=true)\n len, starts = dotraversal(st)\n substring = len == 0 ? \"\" :\n join(unique(map(x -> String(st.text[x:x+len-1]), starts)), \" (or) \")\n if printresult\n print(\" \", label == \"\" ? String(st.text) : label, \": \")\n println(len == 0 ? \"No repeated substring.\" : substring)\n end\n return substring\nend\n\nfunction testsuffixtree()\n tests = [\n \"CAAAABAAAABD\\$\",\n \"GEEKSFORGEEKS\\$\",\n \"AAAAAAAAAA\\$\",\n \"ABCDEFG\\$\",\n \"ABABABA\\$\",\n \"ATCGATCGA\\$\",\n \"banana\\$\",\n \"abcpqrabpqpq\\$\",\n \"pqrpqpqabab\\$\",\n ]\n println(\"Longest Repeated Substring in:\\n\")\n for test in tests\n st = SuffixTree(test)\n getlongestrepeatedsubstring(st)\n end\n println()\n sπ = \"\"\n setprecision(4000000) do\n sπ = string(BigFloat(π))[3:end]\n end\n for number in [1000, 10000, 100000, 1000000]\n text = sπ[1:number] * \"\\$\"\n @time begin\n st = SuffixTree(text)\n getlongestrepeatedsubstring(st, \"first $number d.p. of π\")\n end\n end\nend\n\ntestsuffixtree()\n","language":"Julia"},{"code":"import std/[sequtils, strformat, strutils, tables]\n\nconst ∞ = int.high\n\ntype\n\n # Suffix-tree node.\n Node = ref object\n children: Table[char, int]\n first: int\n last: int\n suffixLink: int\n suffixIndex: int\n\n # Ukkonen suffix-tree.\n SuffixTree = object\n nodes: seq[Node]\n text: string\n root: int\n position: int\n currentNode: int\n needSuffixLink: int\n remainder: int\n activeNode: int\n activeLength: int\n activeEdge: int\n\n\nfunc newNode(): Node =\n Node(first: -1, last: ∞, suffixLink: -1, suffixIndex: -1)\n\nfunc newNode(first, last: int): Node =\n Node(first: first, last: last, suffixLink: 0, suffixIndex: -1)\n\nfunc newNode(st: var SuffixTree; first, last: int): int =\n inc st.currentNode\n st.nodes[st.currentNode] = newNode(first, last)\n result = st.currentNode\n\n\nfunc activeEdgeChar(st: SuffixTree): char {.inline.} = st.text[st.activeedge]\n\n\nfunc edgeLength(st: SuffixTree; n: Node): int =\n min(n.last, st.position + 1) - n.first\n\n\nfunc addSuffixLink(st: var SuffixTree; nodenum: int) =\n if st.needSuffixLink >= 0:\n st.nodes[st.needSuffixLink].suffixLink = nodenum\n st.needSuffixLink = nodenum\n\nfunc walkdown(st: var SuffixTree; currNode: int): bool =\n let length = st.edgeLength(st.nodes[currNode])\n if st.activeLength < length: return false\n inc st.activeEdge, length\n dec st.activeLength, length\n st.activeNode = currnode\n result = true\n\n\nfunc extendSuffixTree(st: var SuffixTree; pos: int) =\n st.position = pos\n st.needSuffixLink = -1\n inc st.remainder\n while st.remainder > 0:\n if st.activeLength == 0: st.activeEdge = st.position\n if st.activeEdgeChar() notin st.nodes[st.activeNode].children:\n let nodeNum = st.newNode(st.position, ∞)\n st.nodes[st.activeNode].children[st.activeEdgeChar()] = nodeNum\n st.addSuffixLink(st.activeNode)\n else:\n let next = st.nodes[st.activeNode].children[st.activeEdgeChar()]\n if st.walkdown(next): continue\n if st.text[st.nodes[next].first + st.activeLength] == st.text[pos]:\n st.addSuffixLink(st.activeNode)\n inc st.activeLength\n break\n let split = st.newNode(st.nodes[next].first, st.nodes[next].first + st.activeLength)\n st.nodes[st.activeNode].children[st.activeEdgeChar()] = split\n let nodeNum = st.newNode(st.position, ∞)\n st.nodes[split].children[st.text[pos]] = nodeNum\n st.nodes[next].first += st.activelength\n st.nodes[split].children[st.text[st.nodes[next].first]] = next\n st.addSuffixLink(split)\n\n dec st.remainder\n if st.activeNode == st.root and st.activeLength > 0:\n dec st.activelength\n st.activeEdge = st.position - st.remainder + 1\n elif st.activeNode != st.root:\n st.activeNode = st.nodes[st.activeNode].suffixLink\n\n\nproc setSuffixIndexByDFS(st: var SuffixTree; node: Node; labelHeight: Natural; verbose = false) =\n if verbose and node.first >= 0:\n echo st.text[node.first..<min(node.last, st.text.len)]\n var isLeaf = true\n for ichild in node.children.values:\n let child = st.nodes[ichild]\n if verbose and isLeaf and node.first >= 0:\n echo &\" [{node.suffixindex}]\"\n isLeaf = false\n st.setSuffixIndexbyDFS(child, labelHeight + st.edgeLength(child))\n if isleaf:\n node.suffixindex = st.text.len - labelHeight\n if verbose: echo &\" [{node.suffixindex}]\"\n\nproc initSuffixTree(str: string): SuffixTree =\n var nodes = newSeqWith(str.len * 2, newNode())\n result = SuffixTree(nodes: nodes, text: str, position: -1, currentNode: -1,\n needSuffixLink: -1, remainder: 0, activeLength: 1, activeEdge: 0)\n result.root = result.newNode(0, 0)\n result.activeNode = result.root\n for i in 0..result.text.high:\n result.extendSuffixTree(i)\n result.setSuffixIndexByDFS(result.nodes[result.root], 0)\n\n\nfunc doTraversal(st: SuffixTree): (int, seq[int]) =\n var maxHeight = 0\n var substringStartIndices = @[-1]\n\n func traversal(node: Node; labelHeight: int) =\n if node.suffixIndex == -1:\n for ichild in node.children.values:\n let child = st.nodes[ichild]\n traversal(child, labelHeight + st.edgeLength(child))\n elif maxHeight < labelHeight - st.edgeLength(node):\n maxHeight = labelHeight - st.edgeLength(node)\n substringStartIndices = @[node.suffixIndex]\n elif maxHeight == labelHeight - st.edgelength(node):\n substringStartIndices.add node.suffixIndex\n\n traversal(st.nodes[st.root], 0)\n result = (maxHeight, move(substringStartIndices))\n\n\nproc getLongestRepeatedSubstring(st: SuffixTree; label = \"\"; printResult = true): string =\n let (length, starts) = st.dotraversal()\n result = if length == 0: \"\"\n else: starts.mapIt(st.text[it..it+length-1]).deduplicate().join(\" (or) \")\n if printResult:\n stdout.write \" \", if label.len == 0: join(st.text) else: label, \": \"\n echo if length == 0: \"No repeated substring.\" else: result\n\n\n\nconst Tests = [\"CAAAABAAAABD$\",\n \"GEEKSFORGEEKS$\",\n \"AAAAAAAAAA$\",\n \"ABCDEFG$\",\n \"ABABABA$\",\n \"ATCGATCGA$\",\n \"banana$\",\n \"abcpqrabpqpq$\",\n \"pqrpqpqabab$\"]\n\necho \"Longest Repeated Substring in:\\n\"\nfor test in Tests:\n var st = initSuffixTree(test)\n discard st.getLongestRepeatedSubstring()\necho()\n\n\n#############################################################################\n# Pi calculation.\n\nimport std/[monotimes, times]\nimport integers\n\nfunc isr(term, guess: Integer): Integer =\n var term = term\n result = guess\n let value = term * result\n while true:\n if abs(term - result) <= 1:\n break\n result = (result + term) shr 1\n term = value div result\n\nfunc calcAgm(lam, gm: Integer; z: var Integer; ep: Integer): Integer =\n var am: Integer\n var lam = lam\n var gm = gm\n var n = 1\n while true:\n am = (lam + gm) shr 1\n gm = isr(lam, gm)\n let v = am - lam\n let zi = v * v * n\n if zi < ep:\n break\n z -= zi\n inc n, n\n lam = am\n result = am\n\nfunc bip(exp: int; man = 1): Integer {.inline.} = man * 10^exp\n\nfunc calculatePi(): string =\n const Digits = 4_000_000\n let am = bip(Digits)\n let gm = isqrt(bip(Digits + Digits - 1, 5))\n var z = bip(Digits + Digits - 2, 25)\n let agm = calcAGM(am, gm, z, bip(Digits + 1))\n let pi = agm * agm * bip(Digits - 2) div z\n result = $pi\n\nlet sπ = calculatePi()\nfor number in [1000, 10000, 100000, 1000000]:\n let text = sπ[2..<number] & '$'\n let start = getMonoTime()\n var st = initSuffixTree(text)\n discard st.getlongestrepeatedsubstring(&\"first {number} d.p. of π\")\n echo &\" → Temps: {(getMonoTime() - start).inMicroseconds} µs\"\n","language":"Nim"},{"code":"(phixonline)-->\n <span style=\"color: #000080;font-style:italic;\">-- demo/rosetta/Ukkonens_Suffix_Tree.exw</span>\n <span style=\"color: #008080;\">with</span> <span style=\"color: #008080;\">javascript_semantics</span>\n <span style=\"color: #004080;\">integer</span> <span style=\"color: #000000;\">maxChar</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #008000;\">'z'</span>\n\n <span style=\"color: #004080;\">sequence</span> <span style=\"color: #000000;\">children</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #0000FF;\">{},</span>\n <span style=\"color: #000000;\">suffixLinks</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #0000FF;\">{},</span>\n <span style=\"color: #000000;\">starts</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #0000FF;\">{},</span>\n <span style=\"color: #000000;\">endIndices</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #0000FF;\">{},</span>\n <span style=\"color: #000000;\">suffixIndices</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #0000FF;\">{},</span>\n <span style=\"color: #000000;\">leaves</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #0000FF;\">{}</span>\n\n <span style=\"color: #008080;\">function</span> <span style=\"color: #000000;\">new_leaf</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #004080;\">integer</span> <span style=\"color: #000000;\">v</span><span style=\"color: #0000FF;\">=</span><span style=\"color: #000000;\">0</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #000000;\">leaves</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">append</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">leaves</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">v</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #008080;\">return</span> <span style=\"color: #7060A8;\">length</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">leaves</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;\">string</span> <span style=\"color: #000000;\">text</span>\n <span style=\"color: #004080;\">integer</span> <span style=\"color: #000000;\">splitEndIdx</span><span style=\"color: #0000FF;\">,</span>\n <span style=\"color: #000000;\">rootEndIdx</span><span style=\"color: #0000FF;\">,</span>\n <span style=\"color: #000000;\">leafEndIdx</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">new_leaf</span><span style=\"color: #0000FF;\">(),</span>\n <span style=\"color: #000000;\">root</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #004600;\">NULL</span><span style=\"color: #0000FF;\">,</span>\n <span style=\"color: #000000;\">lastNewNode</span><span style=\"color: #0000FF;\">,</span>\n <span style=\"color: #000000;\">activeNode</span><span style=\"color: #0000FF;\">,</span>\n <span style=\"color: #000000;\">activeEdge</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: #000000;\">activeLength</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">0</span><span style=\"color: #0000FF;\">,</span>\n <span style=\"color: #000000;\">remainingSuffixCount</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">0</span><span style=\"color: #0000FF;\">,</span>\n <span style=\"color: #000000;\">size</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #0000FF;\">-</span><span style=\"color: #000000;\">1</span>\n\n <span style=\"color: #008080;\">function</span> <span style=\"color: #000000;\">newNode</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;\">finishIdx</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #004080;\">bool</span> <span style=\"color: #000000;\">bKids</span><span style=\"color: #0000FF;\">=</span><span style=\"color: #004600;\">false</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #000000;\">children</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">append</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">children</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #008080;\">iff</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">bKids</span><span style=\"color: #0000FF;\">?</span><span style=\"color: #7060A8;\">repeat</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #004600;\">NULL</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">maxChar</span><span style=\"color: #0000FF;\">):</span><span style=\"color: #000000;\">0</span><span style=\"color: #0000FF;\">))</span>\n <span style=\"color: #000000;\">suffixLinks</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">append</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">suffixLinks</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">root</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #000000;\">starts</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">append</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">starts</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">start</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #000000;\">endIndices</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">append</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">endIndices</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">finishIdx</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #000000;\">suffixIndices</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">append</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">suffixIndices</span><span style=\"color: #0000FF;\">,-</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #008080;\">return</span> <span style=\"color: #7060A8;\">length</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">children</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;\">function</span> <span style=\"color: #000000;\">edgeLength</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;\">return</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: #000000;\">root</span><span style=\"color: #0000FF;\">?</span><span style=\"color: #000000;\">0</span><span style=\"color: #0000FF;\">:</span><span style=\"color: #000000;\">leaves</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">endIndices</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">n</span><span style=\"color: #0000FF;\">]]</span> <span style=\"color: #0000FF;\">-</span> <span style=\"color: #000000;\">starts</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">n</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: #008080;\">end</span> <span style=\"color: #008080;\">function</span>\n\n <span style=\"color: #008080;\">function</span> <span style=\"color: #000000;\">walkDown</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #004080;\">integer</span> <span style=\"color: #000000;\">currNode</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: #000000;\">edgeLength</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">currNode</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #008080;\">if</span> <span style=\"color: #000000;\">activeLength</span> <span style=\"color: #0000FF;\">>=</span> <span style=\"color: #000000;\">l</span> <span style=\"color: #008080;\">then</span>\n <span style=\"color: #000000;\">activeEdge</span> <span style=\"color: #0000FF;\">+=</span> <span style=\"color: #000000;\">l</span>\n <span style=\"color: #000000;\">activeLength</span> <span style=\"color: #0000FF;\">-=</span> <span style=\"color: #000000;\">l</span>\n <span style=\"color: #000000;\">activeNode</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">currNode</span>\n <span style=\"color: #008080;\">return</span> <span style=\"color: #004600;\">true</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">if</span>\n <span style=\"color: #008080;\">return</span> <span style=\"color: #004600;\">false</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;\">extendSuffixTree</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #004080;\">integer</span> <span style=\"color: #000000;\">pos</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #000000;\">leaves</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">leafEndIdx</span><span style=\"color: #0000FF;\">]</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">pos</span>\n <span style=\"color: #000000;\">remainingSuffixCount</span> <span style=\"color: #0000FF;\">+=</span> <span style=\"color: #000000;\">1</span>\n <span style=\"color: #000000;\">lastNewNode</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #004600;\">NULL</span>\n <span style=\"color: #008080;\">while</span> <span style=\"color: #000000;\">remainingSuffixCount</span> <span style=\"color: #0000FF;\">></span> <span style=\"color: #000000;\">0</span> <span style=\"color: #008080;\">do</span>\n <span style=\"color: #008080;\">if</span> <span style=\"color: #000000;\">activeLength</span> <span style=\"color: #0000FF;\">==</span> <span style=\"color: #000000;\">0</span> <span style=\"color: #008080;\">then</span>\n <span style=\"color: #000000;\">activeEdge</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">pos</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;\">ta</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">text</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">activeEdge</span><span style=\"color: #0000FF;\">]</span>\n <span style=\"color: #004080;\">bool</span> <span style=\"color: #000000;\">ca0</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">children</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">activeNode</span><span style=\"color: #0000FF;\">]=</span><span style=\"color: #000000;\">0</span>\n <span style=\"color: #004080;\">integer</span> <span style=\"color: #000000;\">next</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #008080;\">iff</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">ca0</span><span style=\"color: #0000FF;\">?</span><span style=\"color: #004600;\">NULL</span><span style=\"color: #0000FF;\">:</span><span style=\"color: #000000;\">children</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">activeNode</span><span style=\"color: #0000FF;\">][</span><span style=\"color: #000000;\">ta</span><span style=\"color: #0000FF;\">])</span>\n <span style=\"color: #008080;\">if</span> <span style=\"color: #000000;\">next</span><span style=\"color: #0000FF;\">==</span><span style=\"color: #004600;\">null</span> <span style=\"color: #008080;\">then</span>\n <span style=\"color: #008080;\">if</span> <span style=\"color: #000000;\">ca0</span> <span style=\"color: #008080;\">then</span>\n <span style=\"color: #000000;\">children</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">activeNode</span><span style=\"color: #0000FF;\">]</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">repeat</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #004600;\">NULL</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">maxChar</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">if</span>\n <span style=\"color: #000000;\">children</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">activeNode</span><span style=\"color: #0000FF;\">][</span><span style=\"color: #000000;\">ta</span><span style=\"color: #0000FF;\">]</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">newNode</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">pos</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">leafEndIdx</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #008080;\">if</span> <span style=\"color: #000000;\">lastNewNode</span><span style=\"color: #0000FF;\">!=</span><span style=\"color: #004600;\">NULL</span> <span style=\"color: #008080;\">then</span>\n <span style=\"color: #000000;\">suffixLinks</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">lastNewNode</span><span style=\"color: #0000FF;\">]</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">activeNode</span>\n <span style=\"color: #000000;\">lastNewNode</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;\">else</span>\n <span style=\"color: #008080;\">if</span> <span style=\"color: #000000;\">walkDown</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: #008080;\">continue</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;\">tp</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">text</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">pos</span><span style=\"color: #0000FF;\">]</span>\n <span style=\"color: #008080;\">if</span> <span style=\"color: #000000;\">text</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">starts</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">next</span><span style=\"color: #0000FF;\">]+</span><span style=\"color: #000000;\">activeLength</span><span style=\"color: #0000FF;\">]</span> <span style=\"color: #0000FF;\">==</span> <span style=\"color: #000000;\">tp</span> <span style=\"color: #008080;\">then</span>\n <span style=\"color: #008080;\">if</span> <span style=\"color: #000000;\">lastNewNode</span><span style=\"color: #0000FF;\">!=</span><span style=\"color: #004600;\">NULL</span> <span style=\"color: #008080;\">and</span> <span style=\"color: #000000;\">activeNode</span><span style=\"color: #0000FF;\">!=</span><span style=\"color: #000000;\">root</span> <span style=\"color: #008080;\">then</span>\n <span style=\"color: #000000;\">suffixLinks</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">lastNewNode</span><span style=\"color: #0000FF;\">]</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">activeNode</span>\n <span style=\"color: #000000;\">lastNewNode</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: #000000;\">activeLength</span> <span style=\"color: #0000FF;\">+=</span> <span style=\"color: #000000;\">1</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;\">temp</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">starts</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: #000000;\">activeLength</span> <span style=\"color: #0000FF;\">-</span> <span style=\"color: #000000;\">1</span>\n <span style=\"color: #000000;\">splitEndIdx</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">new_leaf</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">temp</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #004080;\">integer</span> <span style=\"color: #000000;\">splitnode</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">newNode</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">starts</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">next</span><span style=\"color: #0000FF;\">],</span> <span style=\"color: #000000;\">splitEndIdx</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #004600;\">true</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #000000;\">ta</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">text</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">activeEdge</span><span style=\"color: #0000FF;\">]</span>\n <span style=\"color: #000000;\">children</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">activeNode</span><span style=\"color: #0000FF;\">][</span><span style=\"color: #000000;\">ta</span><span style=\"color: #0000FF;\">]</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">splitnode</span>\n <span style=\"color: #000000;\">children</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">splitnode</span><span style=\"color: #0000FF;\">][</span><span style=\"color: #000000;\">tp</span><span style=\"color: #0000FF;\">]</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">newNode</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">pos</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">leafEndIdx</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #000000;\">starts</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: #000000;\">activeLength</span>\n <span style=\"color: #000000;\">children</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">splitnode</span><span style=\"color: #0000FF;\">][</span><span style=\"color: #000000;\">text</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">starts</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: #000000;\">next</span>\n <span style=\"color: #008080;\">if</span> <span style=\"color: #000000;\">lastNewNode</span><span style=\"color: #0000FF;\">!=</span><span style=\"color: #004600;\">NULL</span> <span style=\"color: #008080;\">then</span>\n <span style=\"color: #000000;\">suffixLinks</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">lastNewNode</span><span style=\"color: #0000FF;\">]</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">splitnode</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">if</span>\n <span style=\"color: #000000;\">lastNewNode</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">splitnode</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">if</span>\n <span style=\"color: #000000;\">remainingSuffixCount</span> <span style=\"color: #0000FF;\">-=</span> <span style=\"color: #000000;\">1</span>\n <span style=\"color: #008080;\">if</span> <span style=\"color: #000000;\">activeNode</span><span style=\"color: #0000FF;\">==</span><span style=\"color: #000000;\">root</span> <span style=\"color: #008080;\">and</span> <span style=\"color: #000000;\">activeLength</span><span style=\"color: #0000FF;\">></span><span style=\"color: #000000;\">0</span> <span style=\"color: #008080;\">then</span>\n <span style=\"color: #000000;\">activeLength</span> <span style=\"color: #0000FF;\">-=</span> <span style=\"color: #000000;\">1</span>\n <span style=\"color: #000000;\">activeEdge</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">pos</span> <span style=\"color: #0000FF;\">-</span> <span style=\"color: #000000;\">remainingSuffixCount</span> <span style=\"color: #0000FF;\">+</span> <span style=\"color: #000000;\">1</span>\n <span style=\"color: #008080;\">elsif</span> <span style=\"color: #000000;\">activeNode</span><span style=\"color: #0000FF;\">!=</span><span style=\"color: #000000;\">root</span> <span style=\"color: #008080;\">then</span>\n <span style=\"color: #000000;\">activeNode</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">suffixLinks</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">activeNode</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;\">while</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;\">setSuffixIndexByDFS</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #004080;\">integer</span> <span style=\"color: #000000;\">n</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">labelHeight</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: #004600;\">NULL</span> <span style=\"color: #008080;\">then</span>\n <span style=\"color: #008080;\">if</span> <span style=\"color: #000000;\">children</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>\n <span style=\"color: #000000;\">suffixIndices</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">n</span><span style=\"color: #0000FF;\">]</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">size</span> <span style=\"color: #0000FF;\">-</span> <span style=\"color: #000000;\">labelHeight</span>\n <span style=\"color: #008080;\">else</span>\n <span style=\"color: #004080;\">bool</span> <span style=\"color: #000000;\">leaf</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #004600;\">true</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;\">maxChar</span> <span style=\"color: #008080;\">do</span>\n <span style=\"color: #004080;\">integer</span> <span style=\"color: #000000;\">nci</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">children</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>\n <span style=\"color: #008080;\">if</span> <span style=\"color: #000000;\">nci</span><span style=\"color: #0000FF;\">!=</span><span style=\"color: #004600;\">NULL</span> <span style=\"color: #008080;\">then</span>\n <span style=\"color: #000000;\">leaf</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #004600;\">false</span>\n <span style=\"color: #000000;\">setSuffixIndexByDFS</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">nci</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">labelHeight</span><span style=\"color: #0000FF;\">+</span><span style=\"color: #000000;\">edgeLength</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">nci</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;\">leaf</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;\">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;\">procedure</span> <span style=\"color: #000000;\">buildSuffixTree</span><span style=\"color: #0000FF;\">()</span>\n <span style=\"color: #000000;\">size</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">length</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">text</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #000000;\">rootEndIdx</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">new_leaf</span><span style=\"color: #0000FF;\">(-</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #000000;\">root</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">newNode</span><span style=\"color: #0000FF;\">(-</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">rootEndIdx</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #000000;\">activeNode</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">root</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;\">size</span> <span style=\"color: #008080;\">do</span>\n <span style=\"color: #000000;\">extendSuffixTree</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: #004080;\">integer</span> <span style=\"color: #000000;\">labelHeight</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">0</span>\n <span style=\"color: #000000;\">setSuffixIndexByDFS</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">root</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">labelHeight</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;\">procedure</span> <span style=\"color: #000000;\">doTraversal</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #004080;\">integer</span> <span style=\"color: #000000;\">n</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">labelHeight</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">maxHeightIdx</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">substringStartIndex</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: #004600;\">NULL</span> <span style=\"color: #008080;\">then</span>\n <span style=\"color: #004080;\">integer</span> <span style=\"color: #000000;\">nsi</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">suffixIndices</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">n</span><span style=\"color: #0000FF;\">],</span> <span style=\"color: #000000;\">newHeight</span>\n <span style=\"color: #008080;\">if</span> <span style=\"color: #000000;\">nsi</span> <span style=\"color: #0000FF;\">==</span> <span style=\"color: #0000FF;\">-</span><span style=\"color: #000000;\">1</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;\">1</span> <span style=\"color: #008080;\">to</span> <span style=\"color: #000000;\">maxChar</span> <span style=\"color: #008080;\">do</span>\n <span style=\"color: #004080;\">integer</span> <span style=\"color: #000000;\">nci</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">children</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>\n <span style=\"color: #008080;\">if</span> <span style=\"color: #000000;\">nci</span><span style=\"color: #0000FF;\">!=</span><span style=\"color: #004600;\">NULL</span> <span style=\"color: #008080;\">then</span>\n <span style=\"color: #000000;\">newHeight</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">labelHeight</span><span style=\"color: #0000FF;\">+</span><span style=\"color: #000000;\">edgeLength</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">nci</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #000000;\">doTraversal</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">nci</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">newHeight</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">maxHeightIdx</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">substringStartIndex</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;\">elsif</span> <span style=\"color: #000000;\">nsi</span> <span style=\"color: #0000FF;\">></span> <span style=\"color: #0000FF;\">-</span><span style=\"color: #000000;\">1</span> <span style=\"color: #008080;\">then</span>\n <span style=\"color: #000000;\">newHeight</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">labelHeight</span><span style=\"color: #0000FF;\">-</span><span style=\"color: #000000;\">edgeLength</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: #000000;\">leaves</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">maxHeightIdx</span><span style=\"color: #0000FF;\">]<</span><span style=\"color: #000000;\">newHeight</span> <span style=\"color: #008080;\">then</span>\n <span style=\"color: #000000;\">leaves</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">maxHeightIdx</span><span style=\"color: #0000FF;\">]</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">newHeight</span>\n <span style=\"color: #000000;\">leaves</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">substringStartIndex</span><span style=\"color: #0000FF;\">]</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">nsi</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;\">end</span> <span style=\"color: #008080;\">procedure</span>\n\n <span style=\"color: #008080;\">function</span> <span style=\"color: #000000;\">getLongestRepeatedSubstring</span><span style=\"color: #0000FF;\">()</span>\n <span style=\"color: #004080;\">integer</span> <span style=\"color: #000000;\">maxHeightIdx</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">new_leaf</span><span style=\"color: #0000FF;\">(),</span>\n <span style=\"color: #000000;\">substringStartIndex</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">new_leaf</span><span style=\"color: #0000FF;\">()</span>\n <span style=\"color: #000000;\">doTraversal</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">root</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">0</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">maxHeightIdx</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">substringStartIndex</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #004080;\">integer</span> <span style=\"color: #000000;\">maxHeight</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">leaves</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">maxHeightIdx</span><span style=\"color: #0000FF;\">],</span>\n <span style=\"color: #000000;\">start</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">leaves</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">substringStartIndex</span><span style=\"color: #0000FF;\">]</span>\n <span style=\"color: #004080;\">string</span> <span style=\"color: #000000;\">t</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #008080;\">iff</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">maxHeight</span><span style=\"color: #0000FF;\">=</span><span style=\"color: #000000;\">0</span><span style=\"color: #0000FF;\">?</span><span style=\"color: #008000;\">\"No repeated substring\"</span>\n <span style=\"color: #0000FF;\">:</span><span style=\"color: #000000;\">text</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><span style=\"color: #000000;\">start</span><span style=\"color: #0000FF;\">+</span><span style=\"color: #000000;\">maxHeight</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: #008080;\">constant</span> <span style=\"color: #000000;\">tests</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #0000FF;\">{</span><span style=\"color: #008000;\">\"CAAAABAAAABD$\"</span><span style=\"color: #0000FF;\">,</span>\n <span style=\"color: #008000;\">\"GEEKSFORGEEKS$\"</span><span style=\"color: #0000FF;\">,</span>\n <span style=\"color: #008000;\">\"AAAAAAAAAA$\"</span><span style=\"color: #0000FF;\">,</span>\n <span style=\"color: #008000;\">\"ABCDEFG$\"</span><span style=\"color: #0000FF;\">,</span>\n <span style=\"color: #008000;\">\"ABABABA$\"</span><span style=\"color: #0000FF;\">,</span>\n <span style=\"color: #008000;\">\"ATCGATCGA$\"</span><span style=\"color: #0000FF;\">,</span>\n <span style=\"color: #008000;\">\"banana$\"</span><span style=\"color: #0000FF;\">,</span>\n <span style=\"color: #008000;\">\"abcpqrabpqpq$\"</span><span style=\"color: #0000FF;\">,</span>\n <span style=\"color: #008000;\">\"pqrpqpqabab$\"</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;\">\"Longest Repeated Substring in:\\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;\">tests</span><span style=\"color: #0000FF;\">)</span> <span style=\"color: #008080;\">do</span>\n <span style=\"color: #000000;\">text</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: #000000;\">buildSuffixTree</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 is: %s\\n\"</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #0000FF;\">{</span><span style=\"color: #000000;\">text</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">getLongestRepeatedSubstring</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\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: #004080;\">string</span> <span style=\"color: #000000;\">piStr</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: #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><span style=\"color: #000000;\">0</span><span style=\"color: #0000FF;\">,-</span><span style=\"color: #000000;\">1001</span><span style=\"color: #0000FF;\">)</span> <span style=\"color: #000080;font-style:italic;\">-- (set precision to 1,000 dp, plus the \"3.\")</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: #000000;\">piStr</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">mpfr_get_fixed</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">pi</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">1000</span><span style=\"color: #0000FF;\">)</span> <span style=\"color: #000080;font-style:italic;\">-- (all we can really manage under pwa/p2js)</span>\n <span style=\"color: #008080;\">else</span>\n <span style=\"color: #000080;font-style:italic;\">-- gmp crashes when I try 100,000 dp, so just get from file</span>\n <span style=\"color: #000000;\">piStr</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">get_text</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #008000;\">`E:\\downloads\\misc\\arm\\pi-10million.txt`</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">if</span>\n <span style=\"color: #000000;\">piStr</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">piStr</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">3</span><span style=\"color: #0000FF;\">..$]</span> <span style=\"color: #000080;font-style:italic;\">-- discard leading \"3.\"</span>\n <span style=\"color: #000000;\">maxChar</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #008000;\">'9'</span>\n <span style=\"color: #008080;\">for</span> <span style=\"color: #000000;\">i</span><span style=\"color: #0000FF;\">=</span><span style=\"color: #000000;\">3</span> <span style=\"color: #008080;\">to</span> <span style=\"color: #008080;\">iff</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #7060A8;\">platform</span><span style=\"color: #0000FF;\">()=</span><span style=\"color: #004600;\">JS</span><span style=\"color: #0000FF;\">?</span><span style=\"color: #000000;\">3</span><span style=\"color: #0000FF;\">:</span><span style=\"color: #000000;\">6</span><span style=\"color: #0000FF;\">)</span> <span style=\"color: #008080;\">do</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;\">integer</span> <span style=\"color: #000000;\">n</span> <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: #000000;\">i</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #000000;\">text</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">piStr</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: #0000FF;\">&</span> <span style=\"color: #008000;\">\"$\"</span>\n <span style=\"color: #000000;\">buildSuffixTree</span><span style=\"color: #0000FF;\">()</span>\n <span style=\"color: #004080;\">string</span> <span style=\"color: #000000;\">r</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">getLongestRepeatedSubstring</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;\">\" first %,d d.p. of Pi is: %s (%s)\\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;\">r</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">e</span><span style=\"color: #0000FF;\">})</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">for</span>\n<!--\n","language":"Phix"},{"code":"import \"./big\" for BigRat\nimport \"./dynamic\" for Struct\nimport \"./trait\" for ByRef\nimport \"io\" for File\n\nvar maxChar = 128\n\nvar Node = Struct.create(\"Node\", [\"children\", \"suffixLink\", \"start\", \"pEnd\", \"suffixIndex\"])\n\nvar text = \"\"\nvar root = null\nvar lastNewNode = null\nvar activeNode = null\nvar activeEdge = -1\nvar activeLength = 0\nvar remainingSuffixCount = 0\nvar pLeafEnd = ByRef.new(-1)\nvar pRootEnd = null\nvar pSplitEnd = null\nvar size = -1\n\nvar newNode = Fn.new { |start, pEnd|\n var children = List.filled(maxChar, null)\n var suffixLink = root\n var suffixIndex = -1\n return Node.new(children, suffixLink, start, pEnd, suffixIndex)\n}\n\nvar edgeLength = Fn.new { |n|\n if (n == root) return 0\n return n.pEnd.value - n.start + 1\n}\n\nvar walkDown = Fn.new { |currNode|\n var el = edgeLength.call(currNode)\n if (activeLength >= el) {\n activeEdge = activeEdge + el\n activeLength = activeLength - el\n activeNode = currNode\n return true\n }\n return false\n}\n\nvar extendSuffixTree = Fn.new { |pos|\n pLeafEnd.value = pos\n remainingSuffixCount = remainingSuffixCount + 1\n lastNewNode = null\n while (remainingSuffixCount > 0) {\n if (activeLength == 0) activeEdge = pos\n if (!activeNode.children[text[activeEdge].bytes[0]]) {\n activeNode.children[text[activeEdge].bytes[0]] = newNode.call(pos, pLeafEnd)\n if (lastNewNode) {\n lastNewNode.suffixLink = activeNode\n lastNewNode = null\n }\n } else {\n var next = activeNode.children[text[activeEdge].bytes[0]]\n if (walkDown.call(next)) continue\n if (text[next.start + activeLength] == text[pos]) {\n if (lastNewNode && activeNode != root) {\n lastNewNode.suffixLink = activeNode\n lastNewNode = null\n }\n activeLength = activeLength + 1\n break\n }\n var temp = next.start + activeLength - 1\n pSplitEnd = ByRef.new(temp)\n var split = newNode.call(next.start, pSplitEnd)\n activeNode.children[text[activeEdge].bytes[0]] = split\n split.children[text[pos].bytes[0]] = newNode.call(pos, pLeafEnd)\n next.start = next.start + activeLength\n split.children[text[next.start].bytes[0]] = next\n if (lastNewNode) lastNewNode.suffixLink = split\n lastNewNode = split\n }\n remainingSuffixCount = remainingSuffixCount - 1\n if (activeNode == root && activeLength > 0) {\n activeLength = activeLength - 1\n activeEdge = pos - remainingSuffixCount + 1\n } else if (activeNode != root) {\n activeNode = activeNode.suffixLink\n }\n }\n}\n\nvar setSuffixIndexByDFS // recursive\nsetSuffixIndexByDFS = Fn.new { |n, labelHeight|\n if (!n) return\n if (n.start != -1) {\n // Uncomment line below to print suffix tree\n // System.write(text[n.start..n.pEnd.value])\n }\n var leaf = 1\n for (i in 0...maxChar) {\n if (n.children[i]) {\n // Uncomment the 3 lines below to print suffix index\n // if (leaf == 1 && n.start != -1) {\n // System.print(\" [%(n.suffixIndex)]\")\n // }\n leaf = 0\n setSuffixIndexByDFS.call(n.children[i], labelHeight + edgeLength.call(n.children[i]))\n }\n }\n if (leaf == 1) {\n n.suffixIndex = size - labelHeight\n // Uncomment line below to print suffix index\n // System.print(\" [%(n.suffixIndex)]\")\n }\n}\n\nvar buildSuffixTree = Fn.new {\n size = text.count\n var temp = -1\n pRootEnd = ByRef.new(temp)\n root = newNode.call(-1, pRootEnd)\n activeNode = root\n for (i in 0...size) extendSuffixTree.call(i)\n var labelHeight = 0\n setSuffixIndexByDFS.call(root, labelHeight)\n}\n\nvar doTraversal // recursive\ndoTraversal = Fn.new { |n, labelHeight, pMaxHeight, pSubstringStartIndex|\n if (!n) return\n if (n.suffixIndex == -1) {\n for (i in 0...maxChar) {\n if (n.children[i]) {\n doTraversal.call(n.children[i], labelHeight + edgeLength.call(n.children[i]),\n pMaxHeight, pSubstringStartIndex)\n }\n }\n } else if (n.suffixIndex > -1 && (pMaxHeight.value < labelHeight - edgeLength.call(n))) {\n pMaxHeight.value = labelHeight - edgeLength.call(n)\n pSubstringStartIndex.value = n.suffixIndex\n }\n}\n\nvar getLongestRepeatedSubstring = Fn.new { |s|\n var maxHeight = 0\n var substringStartIndex = 0\n var pMaxHeight = ByRef.new(maxHeight)\n var pSubstringStartIndex = ByRef.new(substringStartIndex)\n doTraversal.call(root, 0, pMaxHeight, pSubstringStartIndex)\n maxHeight = pMaxHeight.value\n substringStartIndex = pSubstringStartIndex.value\n // Uncomment line below to print maxHeight and substringStartIndex\n // System.print(\"maxHeight %(maxHeight), substringStartIndex %(substringStartIndex)\")\n if (s == \"\") {\n System.write(\" %(text) is: \")\n } else {\n System.write(\" %(s) is: \")\n }\n var k = 0\n while (k < maxHeight) {\n System.write(text[k + substringStartIndex])\n k = k + 1\n }\n if (k == 0) {\n System.write(\"No repeated substring\")\n }\n System.print()\n}\n\nvar tests = [\n \"GEEKSFORGEEKS$\",\n \"AAAAAAAAAA$\",\n \"ABCDEFG$\",\n \"ABABABA$\",\n \"ATCGATCGA$\",\n \"banana$\",\n \"abcpqrabpqpq$\",\n \"pqrpqpqabab$\",\n]\nSystem.print(\"Longest Repeated Substring in:\\n\")\nfor (test in tests) {\n text = test\n buildSuffixTree.call()\n getLongestRepeatedSubstring.call(\"\")\n}\nSystem.print()\n\n// load pi to 100,182 digits\nvar piStr = File.read(\"pi_100000.txt\")\npiStr = piStr[2..-1] // remove initial 3.\nvar numbers = [1e3, 1e4, 1e5]\nmaxChar = 58\nfor (number in numbers) {\n var start = System.clock\n text = piStr[0...number] + \"$\"\n buildSuffixTree.call()\n getLongestRepeatedSubstring.call(\"first %(number) d.p. of Pi\")\n var elapsed = (System.clock - start) * 1000\n System.print(\" (this took %(elapsed) ms)\\n\")\n}\n","language":"Wren"}],"string":"[\n {\n \"code\": \"---\\ncategory:\\n- String algorithms\\nfrom: http://rosettacode.org/wiki/Ukkonen’s_suffix_tree_construction\\n\",\n \"language\": \"00-META\"\n },\n {\n \"code\": \"Suffix Trees are very useful in numerous string processing and computational biology problems.\\n\\nThe task is to create a function which implements Ukkonen’s algorithm to create a useful Suffix Tree as described:\\n\\n [http://www.geeksforgeeks.org/ukkonens-suffix-tree-construction-part-1/ Part 1]\\n [http://www.geeksforgeeks.org/ukkonens-suffix-tree-construction-part-2/ Part 2]\\n [http://www.geeksforgeeks.org/ukkonens-suffix-tree-construction-part-3/ Part 3]\\n [http://www.geeksforgeeks.org/ukkonens-suffix-tree-construction-part-4/ Part 4]\\n [http://www.geeksforgeeks.org/ukkonens-suffix-tree-construction-part-5/ Part 5]\\n [http://www.geeksforgeeks.org/ukkonens-suffix-tree-construction-part-6/ Part 6]\\n\\nUsing [[Arithmetic-geometric mean/Calculate Pi]] generate the first 1000, 10000, and 100000 decimal places of pi. Using your implementation with an alphabet of 0 through 9 (plus $ say to make the tree explicit) find the longest repeated string in each list. Time your results and demonstrate that your implementation is linear (i.e. that 10000 takes approx. 10 times as long as 1000). You may vary the size of the lists of decimal places of pi to give reasonable answers.\\n\\n\",\n \"language\": \"00-TASK\"\n },\n {\n \"code\": \"package main\\n\\nimport (\\n \\\"fmt\\\"\\n \\\"math/big\\\"\\n \\\"time\\\"\\n)\\n\\nvar maxChar = 128\\n\\ntype Node struct {\\n children []*Node\\n suffixLink *Node\\n start int\\n end *int\\n suffixIndex int\\n}\\n\\nvar (\\n text string\\n root *Node\\n lastNewNode *Node\\n activeNode *Node\\n activeEdge = -1\\n activeLength = 0\\n remainingSuffixCount = 0\\n leafEnd = -1\\n rootEnd *int\\n splitEnd *int\\n size = -1\\n)\\n\\nfunc newNode(start int, end *int) *Node {\\n node := new(Node)\\n node.children = make([]*Node, maxChar)\\n node.suffixLink = root\\n node.start = start\\n node.end = end\\n node.suffixIndex = -1\\n return node\\n}\\n\\nfunc edgeLength(n *Node) int {\\n if n == root {\\n return 0\\n }\\n return *(n.end) - n.start + 1\\n}\\n\\nfunc walkDown(currNode *Node) bool {\\n if activeLength >= edgeLength(currNode) {\\n activeEdge += edgeLength(currNode)\\n activeLength -= edgeLength(currNode)\\n activeNode = currNode\\n return true\\n }\\n return false\\n}\\n\\nfunc extendSuffixTree(pos int) {\\n leafEnd = pos\\n remainingSuffixCount++\\n lastNewNode = nil\\n for remainingSuffixCount > 0 {\\n if activeLength == 0 {\\n activeEdge = pos\\n }\\n if activeNode.children[text[activeEdge]] == nil {\\n activeNode.children[text[activeEdge]] = newNode(pos, &leafEnd)\\n if lastNewNode != nil {\\n lastNewNode.suffixLink = activeNode\\n lastNewNode = nil\\n }\\n } else {\\n next := activeNode.children[text[activeEdge]]\\n if walkDown(next) {\\n continue\\n }\\n if text[next.start+activeLength] == text[pos] {\\n if lastNewNode != nil && activeNode != root {\\n lastNewNode.suffixLink = activeNode\\n lastNewNode = nil\\n }\\n activeLength++\\n break\\n }\\n temp := next.start + activeLength - 1\\n splitEnd = &temp\\n split := newNode(next.start, splitEnd)\\n activeNode.children[text[activeEdge]] = split\\n split.children[text[pos]] = newNode(pos, &leafEnd)\\n next.start += activeLength\\n split.children[text[next.start]] = next\\n if lastNewNode != nil {\\n lastNewNode.suffixLink = split\\n }\\n lastNewNode = split\\n }\\n remainingSuffixCount--\\n if activeNode == root && activeLength > 0 {\\n activeLength--\\n activeEdge = pos - remainingSuffixCount + 1\\n } else if activeNode != root {\\n activeNode = activeNode.suffixLink\\n }\\n }\\n}\\n\\nfunc setSuffixIndexByDFS(n *Node, labelHeight int) {\\n if n == nil {\\n return\\n }\\n if n.start != -1 {\\n // Uncomment line below to print suffix tree\\n // fmt.Print(text[n.start: *(n.end) +1])\\n }\\n leaf := 1\\n for i := 0; i < maxChar; i++ {\\n if n.children[i] != nil {\\n // Uncomment the 3 lines below to print suffix index\\n //if leaf == 1 && n.start != -1 {\\n // fmt.Printf(\\\" [%d]\\\\n\\\", n.suffixIndex)\\n //}\\n leaf = 0\\n setSuffixIndexByDFS(n.children[i], labelHeight+edgeLength(n.children[i]))\\n }\\n }\\n if leaf == 1 {\\n n.suffixIndex = size - labelHeight\\n // Uncomment line below to print suffix index\\n //fmt.Printf(\\\" [%d]\\\\n\\\", n.suffixIndex)\\n }\\n}\\n\\nfunc buildSuffixTree() {\\n size = len(text)\\n temp := -1\\n rootEnd = &temp\\n root = newNode(-1, rootEnd)\\n activeNode = root\\n for i := 0; i < size; i++ {\\n extendSuffixTree(i)\\n }\\n labelHeight := 0\\n setSuffixIndexByDFS(root, labelHeight)\\n}\\n\\nfunc doTraversal(n *Node, labelHeight int, maxHeight, substringStartIndex *int) {\\n if n == nil {\\n return\\n }\\n if n.suffixIndex == -1 {\\n for i := 0; i < maxChar; i++ {\\n if n.children[i] != nil {\\n doTraversal(n.children[i], labelHeight+edgeLength(n.children[i]),\\n maxHeight, substringStartIndex)\\n }\\n }\\n } else if n.suffixIndex > -1 && (*maxHeight < labelHeight-edgeLength(n)) {\\n *maxHeight = labelHeight - edgeLength(n)\\n *substringStartIndex = n.suffixIndex\\n }\\n}\\n\\nfunc getLongestRepeatedSubstring(s string) {\\n maxHeight := 0\\n substringStartIndex := 0\\n doTraversal(root, 0, &maxHeight, &substringStartIndex)\\n // Uncomment line below to print maxHeight and substringStartIndex\\n // fmt.Printf(\\\"maxHeight %d, substringStartIndex %d\\\\n\\\", maxHeight, substringStartIndex)\\n if s == \\\"\\\" {\\n fmt.Printf(\\\" %s is: \\\", text)\\n } else {\\n fmt.Printf(\\\" %s is: \\\", s)\\n }\\n k := 0\\n for ; k < maxHeight; k++ {\\n fmt.Printf(\\\"%c\\\", text[k+substringStartIndex])\\n }\\n if k == 0 {\\n fmt.Print(\\\"No repeated substring\\\")\\n }\\n fmt.Println()\\n}\\n\\nfunc calculatePi() *big.Float {\\n one := big.NewFloat(1)\\n two := big.NewFloat(2)\\n four := big.NewFloat(4)\\n prec := uint(325 * 1024) // enough to calculate Pi to 100,182 decimal digits\\n\\n a := big.NewFloat(1).SetPrec(prec)\\n g := new(big.Float).SetPrec(prec)\\n\\n // temporary variables\\n t := new(big.Float).SetPrec(prec)\\n u := new(big.Float).SetPrec(prec)\\n\\n g.Quo(a, t.Sqrt(two))\\n sum := new(big.Float)\\n pow := big.NewFloat(2)\\n\\n for a.Cmp(g) != 0 {\\n t.Add(a, g)\\n t.Quo(t, two)\\n g.Sqrt(u.Mul(a, g))\\n a.Set(t)\\n pow.Mul(pow, two)\\n t.Sub(t.Mul(a, a), u.Mul(g, g))\\n sum.Add(sum, t.Mul(t, pow))\\n }\\n\\n t.Mul(a, a)\\n t.Mul(t, four)\\n pi := t.Quo(t, u.Sub(one, sum))\\n return pi\\n}\\n\\nfunc main() {\\n tests := []string{\\n \\\"GEEKSFORGEEKS$\\\",\\n \\\"AAAAAAAAAA$\\\",\\n \\\"ABCDEFG$\\\",\\n \\\"ABABABA$\\\",\\n \\\"ATCGATCGA$\\\",\\n \\\"banana$\\\",\\n \\\"abcpqrabpqpq$\\\",\\n \\\"pqrpqpqabab$\\\",\\n }\\n fmt.Println(\\\"Longest Repeated Substring in:\\\\n\\\")\\n for _, test := range tests {\\n text = test\\n buildSuffixTree()\\n getLongestRepeatedSubstring(\\\"\\\")\\n }\\n fmt.Println()\\n\\n pi := calculatePi()\\n piStr := fmt.Sprintf(\\\"%v\\\", pi)\\n piStr = piStr[2:] // remove initial 3.\\n numbers := []int{1e3, 1e4, 1e5}\\n maxChar = 58\\n for _, number := range numbers {\\n start := time.Now()\\n text = piStr[0:number] + \\\"$\\\"\\n buildSuffixTree()\\n getLongestRepeatedSubstring(fmt.Sprintf(\\\"first %d d.p. of Pi\\\", number))\\n elapsed := time.Now().Sub(start)\\n fmt.Printf(\\\" (this took %s)\\\\n\\\\n\\\", elapsed)\\n }\\n}\\n\",\n \"language\": \"Go\"\n },\n {\n \"code\": \"import java.io.IOException;\\nimport java.nio.file.Files;\\nimport java.nio.file.Path;\\nimport java.util.ArrayList;\\nimport java.util.Arrays;\\nimport java.util.HashMap;\\nimport java.util.Iterator;\\nimport java.util.List;\\nimport java.util.Map;\\nimport java.util.Set;\\nimport java.util.TreeSet;\\n\\npublic final class UkkonenSuffixTree {\\n\\n\\tpublic static void main(String[] aArgs) throws IOException {\\t\\t\\n\\t\\tList<Integer> limits = List.of( 1_000, 10_000, 100_000 );\\n\\t\\t\\n\\t\\tfor ( int limit : limits ) {\\n\\t\\t\\tString contents = Files.readString(Path.of(\\\"piDigits.txt\\\"));\\n\\t\\t\\tString piDigits = contents.substring(0, limit + 1);\\n\\t\\t\\t\\n\\t\\t\\tfinal long start = System.currentTimeMillis();\\t\\t\\t\\n\\t\\t\\tSuffixTree tree = new SuffixTree(piDigits);\\t\\t\\t\\n\\t\\t\\tMap<String, Set<Integer>> substrings = tree.getLongestRepeatedSubstrings();\\t\\t\\t\\n\\t\\t\\tfinal long finish = System.currentTimeMillis();\\n\\t\\t\\t\\n\\t\\t\\tSystem.out.println(\\\"First \\\" + limit + \\\" digits of pi has longest repeated characters:\\\");\\n\\t\\t\\tfor ( String substring : substrings.keySet() ) {\\n\\t\\t\\t\\tSystem.out.print(\\\" '\\\" + substring + \\\"' starting at index \\\");\\n\\t\\t\\t\\tfor ( Iterator<Integer> iterator = substrings.get(substring).iterator(); iterator.hasNext(); ) {\\n\\t\\t\\t\\t\\tSystem.out.print(iterator.next());\\n\\t\\t\\t\\t\\tif ( iterator.hasNext() ) {\\n\\t\\t\\t\\t\\t\\tSystem.out.print(\\\" and \\\");\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tSystem.out.println();\\n\\t\\t\\t}\\n\\t\\t\\t\\n\\t\\t\\tSystem.out.println(\\\"Time taken: \\\" + ( finish - start ) + \\\" milliseconds.\\\" + System.lineSeparator());\\n\\t\\t}\\n\\t\\t\\n\\t\\tSystem.out.println(\\\"The timings show that the implementation has approximately linear performance.\\\");\\n\\t}\\n\\n\\tprivate final static class SuffixTree {\\n\\t\\t\\n\\t\\tpublic SuffixTree(String aWord) {\\n\\t\\t\\ttext = Arrays.copyOfRange(aWord.toCharArray(), 0, aWord.length() + 1);\\n\\t\\t\\ttext[aWord.length()] = '\\\\uF123'; // Terminal character\\n\\t\\t\\t\\n\\t\\t\\tnodes = new Node[2 * aWord.length() + 2];\\n\\t root = newNode(UNDEFINED, UNDEFINED);\\n\\t activeNode = root;\\n\\t\\n\\t\\t\\tfor ( char character : text ) {\\n\\t\\t\\t\\textendSuffixTree(character);\\n\\t\\t\\t}\\t\\t\\t\\t\\n\\t\\t}\\n\\t\\t\\n\\t\\tpublic Map<String, Set<Integer>> getLongestRepeatedSubstrings() {\\n\\t\\t\\tList<Integer> indexes = doTraversal();\\n\\t\\t\\tString word = String.valueOf(text).substring(0, text.length - 1);\\n\\t\\t\\tMap<String, Set<Integer>> result = new HashMap<String, Set<Integer>>();\\n\\t\\t\\t\\n\\t\\t\\tif ( indexes.get(0) > 0 ) {\\n\\t\\t\\t\\tfor ( int i = 1; i < indexes.size(); i++ ) {\\n\\t\\t\\t\\t\\tString substring = word.substring(indexes.get(i), indexes.get(i) + indexes.get(0));\\t\\t\\t\\n\\t\\t\\t\\t\\tresult.computeIfAbsent(substring, k -> new TreeSet<Integer>()).add(indexes.get(i));\\t\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\t\\n\\t\\t\\treturn result;\\n\\t\\t}\\t\\n\\t\\n\\t\\t// PRIVATE //\\n\\t\\t\\n\\t\\tprivate void extendSuffixTree(char aCharacter) {\\n\\t needParentLink = UNDEFINED;\\n\\t remainder++;\\n\\t\\n\\t while ( remainder > 0 ) {\\n\\t if ( activeLength == 0 ) {\\n\\t \\tactiveEdge = textIndex;\\n\\t }\\n\\t\\n\\t if ( ! nodes[activeNode].children.containsKey(text[activeEdge]) ) {\\n\\t final int leaf = newNode(textIndex, LEAF_NODE);\\n\\t nodes[activeNode].children.put(text[activeEdge], leaf);\\n\\t addSuffixLink(activeNode);\\n\\t } else {\\n\\t final int next = nodes[activeNode].children.get(text[activeEdge]);\\n\\t if ( walkDown(next) ) {\\n\\t \\tcontinue;\\n\\t }\\n\\t\\n\\t if ( text[nodes[next].start + activeLength] == aCharacter ) {\\n\\t activeLength++;\\n\\t addSuffixLink(activeNode);\\n\\t break;\\n\\t }\\n\\t\\n\\t final int split = newNode(nodes[next].start, nodes[next].start + activeLength);\\n\\t nodes[activeNode].children.put(text[activeEdge], split);\\n\\t final int leaf = newNode(textIndex, LEAF_NODE);\\n\\t nodes[split].children.put(aCharacter, leaf);\\n\\t nodes[next].start += activeLength;\\n\\t nodes[split].children.put(text[nodes[next].start], next);\\n\\t addSuffixLink(split);\\n\\t }\\n\\t\\n\\t remainder--;\\n\\t\\n\\t if ( activeNode == root && activeLength > 0 ) {\\n\\t activeLength--;\\n\\t activeEdge = textIndex - remainder + 1;\\n\\t } else {\\n\\t activeNode = ( nodes[activeNode].parentLink > 0 ) ? nodes[activeNode].parentLink : root;\\n\\t }\\n\\t }\\n\\t\\n\\t textIndex++;\\n\\t }\\n\\t\\t\\n\\t\\tprivate boolean walkDown(int aNode) {\\n\\t if ( activeLength >= nodes[aNode].edgeLength() ) {\\n\\t activeEdge += nodes[aNode].edgeLength();\\n\\t activeLength -= nodes[aNode].edgeLength();\\n\\t activeNode = aNode;\\n\\t\\n\\t return true;\\n\\t }\\n\\t\\n\\t return false;\\n\\t }\\n\\t\\t\\n\\t\\tprivate void addSuffixLink(int aNode) {\\n\\t if ( needParentLink != UNDEFINED ) {\\n\\t nodes[needParentLink].parentLink = aNode;\\n\\t }\\n\\t\\n\\t needParentLink = aNode;\\n\\t }\\n\\t\\t\\n\\t\\tprivate int newNode(int aStart, int aEnd) {\\n\\t\\t\\tNode node = new Node(aStart, aEnd);\\n\\t\\t\\tnode.leafIndex = ( aEnd == LEAF_NODE ) ? leafIndexGenerator++ : UNDEFINED;\\n\\t\\t\\tnodes[currentNode] = node;\\n\\t\\n\\t return currentNode++;\\n\\t }\\n\\t\\n\\t\\tprivate List<Integer> doTraversal() {\\n\\t\\t\\tList<Integer> indexes = new ArrayList<Integer>();\\n\\t\\t\\tindexes.add(UNDEFINED);\\t\\t\\n\\t\\n\\t\\t\\treturn traversal(indexes, nodes[root], 0);\\n\\t\\t}\\t\\t\\n\\t\\t\\n\\t\\tprivate List<Integer> traversal(List<Integer> aIndexes, Node aNode, int aHeight) {\\n\\t\\t\\tif ( aNode.leafIndex == UNDEFINED ) {\\n\\t\\t\\t\\tfor ( int index : aNode.children.values() ) {\\n\\t\\t\\t Node child = nodes[index];\\n\\t\\t\\t traversal(aIndexes, child, aHeight + child.edgeLength());\\n\\t\\t\\t\\t}\\n\\t\\t\\t} else if ( aIndexes.get(0) < aHeight - aNode.edgeLength() ) {\\n\\t\\t\\t\\taIndexes.clear();\\n\\t\\t\\t\\taIndexes.add(aHeight - aNode.edgeLength());\\n\\t\\t\\t\\taIndexes.add(aNode.leafIndex);\\n\\t\\t\\t} else if ( aIndexes.get(0) == aHeight - aNode.edgeLength() ) {\\n\\t\\t\\t aIndexes.add(aNode.leafIndex);\\n\\t\\t\\t}\\t\\t\\n\\t\\t\\t\\n\\t\\t\\treturn aIndexes;\\n\\t\\t}\\n\\t\\n\\t private final class Node {\\n\\t \\t\\n\\t \\tpublic Node(int aStart, int aEnd) {\\n\\t start = aStart;\\n\\t end = aEnd;\\n\\t }\\n\\t \\t\\n\\t \\tpublic int edgeLength() {\\n\\t return Math.min(end, textIndex + 1) - start;\\n\\t }\\n\\t\\n\\t private int start, end, parentLink, leafIndex;\\n\\t private Map<Character, Integer> children = new HashMap<Character, Integer>();\\n\\t\\n\\t }\\n\\t\\n\\t private Node[] nodes;\\n\\t private char[] text;\\n\\t private int activeNode, activeLength, activeEdge;\\n\\t private int root, textIndex, currentNode, needParentLink, remainder, leafIndexGenerator;\\n\\t\\n\\t private static final int UNDEFINED = -1;\\n\\t private static final int LEAF_NODE = Integer.MAX_VALUE;\\n\\t\\n\\t}\\n\\n}\\n\",\n \"language\": \"Java\"\n },\n {\n \"code\": \"const oo = typemax(Int)\\n\\n\\\"\\\"\\\"The suffix-tree's node.\\\"\\\"\\\"\\nmutable struct Node\\n children::Dict{Char, Int}\\n start::Int\\n ending::Int\\n suffixlink::Int\\n suffixindex::Int\\nend\\n\\nNode() = Node(Dict(), 0, oo, 0, -1)\\nNode(start, ending) = Node(Dict(), start, ending, 0, -1)\\n\\n\\\"\\\"\\\" Ukkonen Suffix-Tree \\\"\\\"\\\"\\nmutable struct SuffixTree\\n nodes::Vector{Node}\\n text::Vector{Char}\\n root::Int\\n position::Int\\n currentnode::Int\\n needsuffixlink::Int\\n remainder::Int\\n activenode::Int\\n activelength::Int\\n activeedge::Int\\nend\\n\\nedgelength(st, n::Node) = min(n.ending, st.position + 1) - n.start\\n\\nfunction newnode(st, start, ending)\\n st.currentnode += 1\\n st.nodes[st.currentnode] = Node(start, ending)\\n return st.currentnode\\nend\\n\\nfunction SuffixTree(str::String)\\n nodes = [Node() for _ in 1:length(str) * 2]\\n st = SuffixTree(nodes, [c for c in str], 1, 0, 0, 0, 0, 1, 1, 1)\\n st.root = newnode(st, 0, 0)\\n st.activenode = st.root\\n for i in 1:length(st.text)\\n extendsuffixtree(st, i)\\n end\\n setsuffixindexbyDFS(st, st.nodes[st.root], 0)\\n return st\\nend\\n\\nfunction addsuffixlink(st, nodenum::Int)\\n if st.needsuffixlink > 0\\n st.nodes[st.needsuffixlink].suffixlink = nodenum\\n end\\n st.needsuffixlink = nodenum\\nend\\n\\nactiveedge(st) = st.text[st.activeedge]\\n\\nfunction walkdown!(st, currnode::Int)\\n len = edgelength(st, st.nodes[currnode])\\n st.activelength < len && return false\\n st.activeedge += len\\n st.activelength -= len\\n st.activenode = currnode\\n return true\\nend\\n\\nfunction extendsuffixtree(st, pos)\\n st.position = pos\\n st.needsuffixlink = 0\\n st.remainder += 1\\n while st.remainder > 0\\n st.activelength == 0 && (st.activeedge = st.position)\\n if !haskey(st.nodes[st.activenode].children, activeedge(st))\\n nodenum = newnode(st, st.position, oo)\\n st.nodes[st.activenode].children[activeedge(st)] = nodenum\\n addsuffixlink(st, st.activenode)\\n else\\n next = st.nodes[st.activenode].children[activeedge(st)]\\n walkdown!(st, next) && continue\\n if st.text[st.nodes[next].start + st.activelength] == st.text[pos]\\n addsuffixlink(st, st.activenode)\\n st.activelength += 1\\n break\\n end\\n splt = newnode(st, st.nodes[next].start, st.nodes[next].start + st.activelength)\\n st.nodes[st.activenode].children[activeedge(st)] = splt\\n nodenum = newnode(st, st.position, oo)\\n st.nodes[splt].children[st.text[pos]] = nodenum\\n st.nodes[next].start += st.activelength\\n st.nodes[splt].children[st.text[st.nodes[next].start]] = next\\n addsuffixlink(st, splt)\\n end\\n st.remainder -= 1\\n if st.activenode == st.root && st.activelength > 0\\n st.activelength -= 1\\n st.activeedge = st.position - st.remainder + 1\\n elseif st.activenode != st.root\\n st.activenode = st.nodes[st.activenode].suffixlink\\n end\\n end\\nend\\n\\nfunction setsuffixindexbyDFS(st, node, labelheight, verbose=false)\\n verbose && node.start > 0 && print(st.text[node.start:min(node.ending, length(st.text))])\\n isleaf = true\\n for child in map(v -> st.nodes[v], collect(values(node.children)))\\n verbose && isleaf && node.start > 0 && println(\\\" [\\\", node.suffixindex, \\\"]\\\")\\n isleaf = false\\n setsuffixindexbyDFS(st, child, labelheight + edgelength(st, child))\\n end\\n if isleaf\\n idx = length(st.text) - labelheight\\n node.suffixindex = idx\\n verbose && println(\\\" [$idx]\\\")\\n end\\nend\\n\\nfunction dotraversal(st)\\n maxheight, substringstartindices = 0, [0]\\n function traversal(node::Node, labelheight)\\n if node.suffixindex == -1\\n for child in map(v -> st.nodes[v], collect(values(node.children)))\\n traversal(child, labelheight + edgelength(st, child))\\n end\\n elseif maxheight < labelheight - edgelength(st, node)\\n maxheight = labelheight - edgelength(st, node)\\n substringstartindices = [node.suffixindex + 1]\\n elseif maxheight == labelheight - edgelength(st, node)\\n push!(substringstartindices, node.suffixindex + 1)\\n end\\n end\\n traversal(st.nodes[st.root], 0)\\n return maxheight, substringstartindices\\nend\\n\\nfunction getlongestrepeatedsubstring(st::SuffixTree, label=\\\"\\\", printresult=true)\\n len, starts = dotraversal(st)\\n substring = len == 0 ? \\\"\\\" :\\n join(unique(map(x -> String(st.text[x:x+len-1]), starts)), \\\" (or) \\\")\\n if printresult\\n print(\\\" \\\", label == \\\"\\\" ? String(st.text) : label, \\\": \\\")\\n println(len == 0 ? \\\"No repeated substring.\\\" : substring)\\n end\\n return substring\\nend\\n\\nfunction testsuffixtree()\\n tests = [\\n \\\"CAAAABAAAABD\\\\$\\\",\\n \\\"GEEKSFORGEEKS\\\\$\\\",\\n \\\"AAAAAAAAAA\\\\$\\\",\\n \\\"ABCDEFG\\\\$\\\",\\n \\\"ABABABA\\\\$\\\",\\n \\\"ATCGATCGA\\\\$\\\",\\n \\\"banana\\\\$\\\",\\n \\\"abcpqrabpqpq\\\\$\\\",\\n \\\"pqrpqpqabab\\\\$\\\",\\n ]\\n println(\\\"Longest Repeated Substring in:\\\\n\\\")\\n for test in tests\\n st = SuffixTree(test)\\n getlongestrepeatedsubstring(st)\\n end\\n println()\\n sπ = \\\"\\\"\\n setprecision(4000000) do\\n sπ = string(BigFloat(π))[3:end]\\n end\\n for number in [1000, 10000, 100000, 1000000]\\n text = sπ[1:number] * \\\"\\\\$\\\"\\n @time begin\\n st = SuffixTree(text)\\n getlongestrepeatedsubstring(st, \\\"first $number d.p. of π\\\")\\n end\\n end\\nend\\n\\ntestsuffixtree()\\n\",\n \"language\": \"Julia\"\n },\n {\n \"code\": \"import std/[sequtils, strformat, strutils, tables]\\n\\nconst ∞ = int.high\\n\\ntype\\n\\n # Suffix-tree node.\\n Node = ref object\\n children: Table[char, int]\\n first: int\\n last: int\\n suffixLink: int\\n suffixIndex: int\\n\\n # Ukkonen suffix-tree.\\n SuffixTree = object\\n nodes: seq[Node]\\n text: string\\n root: int\\n position: int\\n currentNode: int\\n needSuffixLink: int\\n remainder: int\\n activeNode: int\\n activeLength: int\\n activeEdge: int\\n\\n\\nfunc newNode(): Node =\\n Node(first: -1, last: ∞, suffixLink: -1, suffixIndex: -1)\\n\\nfunc newNode(first, last: int): Node =\\n Node(first: first, last: last, suffixLink: 0, suffixIndex: -1)\\n\\nfunc newNode(st: var SuffixTree; first, last: int): int =\\n inc st.currentNode\\n st.nodes[st.currentNode] = newNode(first, last)\\n result = st.currentNode\\n\\n\\nfunc activeEdgeChar(st: SuffixTree): char {.inline.} = st.text[st.activeedge]\\n\\n\\nfunc edgeLength(st: SuffixTree; n: Node): int =\\n min(n.last, st.position + 1) - n.first\\n\\n\\nfunc addSuffixLink(st: var SuffixTree; nodenum: int) =\\n if st.needSuffixLink >= 0:\\n st.nodes[st.needSuffixLink].suffixLink = nodenum\\n st.needSuffixLink = nodenum\\n\\nfunc walkdown(st: var SuffixTree; currNode: int): bool =\\n let length = st.edgeLength(st.nodes[currNode])\\n if st.activeLength < length: return false\\n inc st.activeEdge, length\\n dec st.activeLength, length\\n st.activeNode = currnode\\n result = true\\n\\n\\nfunc extendSuffixTree(st: var SuffixTree; pos: int) =\\n st.position = pos\\n st.needSuffixLink = -1\\n inc st.remainder\\n while st.remainder > 0:\\n if st.activeLength == 0: st.activeEdge = st.position\\n if st.activeEdgeChar() notin st.nodes[st.activeNode].children:\\n let nodeNum = st.newNode(st.position, ∞)\\n st.nodes[st.activeNode].children[st.activeEdgeChar()] = nodeNum\\n st.addSuffixLink(st.activeNode)\\n else:\\n let next = st.nodes[st.activeNode].children[st.activeEdgeChar()]\\n if st.walkdown(next): continue\\n if st.text[st.nodes[next].first + st.activeLength] == st.text[pos]:\\n st.addSuffixLink(st.activeNode)\\n inc st.activeLength\\n break\\n let split = st.newNode(st.nodes[next].first, st.nodes[next].first + st.activeLength)\\n st.nodes[st.activeNode].children[st.activeEdgeChar()] = split\\n let nodeNum = st.newNode(st.position, ∞)\\n st.nodes[split].children[st.text[pos]] = nodeNum\\n st.nodes[next].first += st.activelength\\n st.nodes[split].children[st.text[st.nodes[next].first]] = next\\n st.addSuffixLink(split)\\n\\n dec st.remainder\\n if st.activeNode == st.root and st.activeLength > 0:\\n dec st.activelength\\n st.activeEdge = st.position - st.remainder + 1\\n elif st.activeNode != st.root:\\n st.activeNode = st.nodes[st.activeNode].suffixLink\\n\\n\\nproc setSuffixIndexByDFS(st: var SuffixTree; node: Node; labelHeight: Natural; verbose = false) =\\n if verbose and node.first >= 0:\\n echo st.text[node.first..<min(node.last, st.text.len)]\\n var isLeaf = true\\n for ichild in node.children.values:\\n let child = st.nodes[ichild]\\n if verbose and isLeaf and node.first >= 0:\\n echo &\\\" [{node.suffixindex}]\\\"\\n isLeaf = false\\n st.setSuffixIndexbyDFS(child, labelHeight + st.edgeLength(child))\\n if isleaf:\\n node.suffixindex = st.text.len - labelHeight\\n if verbose: echo &\\\" [{node.suffixindex}]\\\"\\n\\nproc initSuffixTree(str: string): SuffixTree =\\n var nodes = newSeqWith(str.len * 2, newNode())\\n result = SuffixTree(nodes: nodes, text: str, position: -1, currentNode: -1,\\n needSuffixLink: -1, remainder: 0, activeLength: 1, activeEdge: 0)\\n result.root = result.newNode(0, 0)\\n result.activeNode = result.root\\n for i in 0..result.text.high:\\n result.extendSuffixTree(i)\\n result.setSuffixIndexByDFS(result.nodes[result.root], 0)\\n\\n\\nfunc doTraversal(st: SuffixTree): (int, seq[int]) =\\n var maxHeight = 0\\n var substringStartIndices = @[-1]\\n\\n func traversal(node: Node; labelHeight: int) =\\n if node.suffixIndex == -1:\\n for ichild in node.children.values:\\n let child = st.nodes[ichild]\\n traversal(child, labelHeight + st.edgeLength(child))\\n elif maxHeight < labelHeight - st.edgeLength(node):\\n maxHeight = labelHeight - st.edgeLength(node)\\n substringStartIndices = @[node.suffixIndex]\\n elif maxHeight == labelHeight - st.edgelength(node):\\n substringStartIndices.add node.suffixIndex\\n\\n traversal(st.nodes[st.root], 0)\\n result = (maxHeight, move(substringStartIndices))\\n\\n\\nproc getLongestRepeatedSubstring(st: SuffixTree; label = \\\"\\\"; printResult = true): string =\\n let (length, starts) = st.dotraversal()\\n result = if length == 0: \\\"\\\"\\n else: starts.mapIt(st.text[it..it+length-1]).deduplicate().join(\\\" (or) \\\")\\n if printResult:\\n stdout.write \\\" \\\", if label.len == 0: join(st.text) else: label, \\\": \\\"\\n echo if length == 0: \\\"No repeated substring.\\\" else: result\\n\\n\\n\\nconst Tests = [\\\"CAAAABAAAABD$\\\",\\n \\\"GEEKSFORGEEKS$\\\",\\n \\\"AAAAAAAAAA$\\\",\\n \\\"ABCDEFG$\\\",\\n \\\"ABABABA$\\\",\\n \\\"ATCGATCGA$\\\",\\n \\\"banana$\\\",\\n \\\"abcpqrabpqpq$\\\",\\n \\\"pqrpqpqabab$\\\"]\\n\\necho \\\"Longest Repeated Substring in:\\\\n\\\"\\nfor test in Tests:\\n var st = initSuffixTree(test)\\n discard st.getLongestRepeatedSubstring()\\necho()\\n\\n\\n#############################################################################\\n# Pi calculation.\\n\\nimport std/[monotimes, times]\\nimport integers\\n\\nfunc isr(term, guess: Integer): Integer =\\n var term = term\\n result = guess\\n let value = term * result\\n while true:\\n if abs(term - result) <= 1:\\n break\\n result = (result + term) shr 1\\n term = value div result\\n\\nfunc calcAgm(lam, gm: Integer; z: var Integer; ep: Integer): Integer =\\n var am: Integer\\n var lam = lam\\n var gm = gm\\n var n = 1\\n while true:\\n am = (lam + gm) shr 1\\n gm = isr(lam, gm)\\n let v = am - lam\\n let zi = v * v * n\\n if zi < ep:\\n break\\n z -= zi\\n inc n, n\\n lam = am\\n result = am\\n\\nfunc bip(exp: int; man = 1): Integer {.inline.} = man * 10^exp\\n\\nfunc calculatePi(): string =\\n const Digits = 4_000_000\\n let am = bip(Digits)\\n let gm = isqrt(bip(Digits + Digits - 1, 5))\\n var z = bip(Digits + Digits - 2, 25)\\n let agm = calcAGM(am, gm, z, bip(Digits + 1))\\n let pi = agm * agm * bip(Digits - 2) div z\\n result = $pi\\n\\nlet sπ = calculatePi()\\nfor number in [1000, 10000, 100000, 1000000]:\\n let text = sπ[2..<number] & '$'\\n let start = getMonoTime()\\n var st = initSuffixTree(text)\\n discard st.getlongestrepeatedsubstring(&\\\"first {number} d.p. of π\\\")\\n echo &\\\" → Temps: {(getMonoTime() - start).inMicroseconds} µs\\\"\\n\",\n \"language\": \"Nim\"\n },\n {\n \"code\": \"(phixonline)-->\\n <span style=\\\"color: #000080;font-style:italic;\\\">-- demo/rosetta/Ukkonens_Suffix_Tree.exw</span>\\n <span style=\\\"color: #008080;\\\">with</span> <span style=\\\"color: #008080;\\\">javascript_semantics</span>\\n <span style=\\\"color: #004080;\\\">integer</span> <span style=\\\"color: #000000;\\\">maxChar</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #008000;\\\">'z'</span>\\n\\n <span style=\\\"color: #004080;\\\">sequence</span> <span style=\\\"color: #000000;\\\">children</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #0000FF;\\\">{},</span>\\n <span style=\\\"color: #000000;\\\">suffixLinks</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #0000FF;\\\">{},</span>\\n <span style=\\\"color: #000000;\\\">starts</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #0000FF;\\\">{},</span>\\n <span style=\\\"color: #000000;\\\">endIndices</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #0000FF;\\\">{},</span>\\n <span style=\\\"color: #000000;\\\">suffixIndices</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #0000FF;\\\">{},</span>\\n <span style=\\\"color: #000000;\\\">leaves</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #0000FF;\\\">{}</span>\\n\\n <span style=\\\"color: #008080;\\\">function</span> <span style=\\\"color: #000000;\\\">new_leaf</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #004080;\\\">integer</span> <span style=\\\"color: #000000;\\\">v</span><span style=\\\"color: #0000FF;\\\">=</span><span style=\\\"color: #000000;\\\">0</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #000000;\\\">leaves</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">append</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">leaves</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">v</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #008080;\\\">return</span> <span style=\\\"color: #7060A8;\\\">length</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">leaves</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;\\\">string</span> <span style=\\\"color: #000000;\\\">text</span>\\n <span style=\\\"color: #004080;\\\">integer</span> <span style=\\\"color: #000000;\\\">splitEndIdx</span><span style=\\\"color: #0000FF;\\\">,</span>\\n <span style=\\\"color: #000000;\\\">rootEndIdx</span><span style=\\\"color: #0000FF;\\\">,</span>\\n <span style=\\\"color: #000000;\\\">leafEndIdx</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">new_leaf</span><span style=\\\"color: #0000FF;\\\">(),</span>\\n <span style=\\\"color: #000000;\\\">root</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #004600;\\\">NULL</span><span style=\\\"color: #0000FF;\\\">,</span>\\n <span style=\\\"color: #000000;\\\">lastNewNode</span><span style=\\\"color: #0000FF;\\\">,</span>\\n <span style=\\\"color: #000000;\\\">activeNode</span><span style=\\\"color: #0000FF;\\\">,</span>\\n <span style=\\\"color: #000000;\\\">activeEdge</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: #000000;\\\">activeLength</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">0</span><span style=\\\"color: #0000FF;\\\">,</span>\\n <span style=\\\"color: #000000;\\\">remainingSuffixCount</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">0</span><span style=\\\"color: #0000FF;\\\">,</span>\\n <span style=\\\"color: #000000;\\\">size</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #0000FF;\\\">-</span><span style=\\\"color: #000000;\\\">1</span>\\n\\n <span style=\\\"color: #008080;\\\">function</span> <span style=\\\"color: #000000;\\\">newNode</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;\\\">finishIdx</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #004080;\\\">bool</span> <span style=\\\"color: #000000;\\\">bKids</span><span style=\\\"color: #0000FF;\\\">=</span><span style=\\\"color: #004600;\\\">false</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #000000;\\\">children</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">append</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">children</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #008080;\\\">iff</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">bKids</span><span style=\\\"color: #0000FF;\\\">?</span><span style=\\\"color: #7060A8;\\\">repeat</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #004600;\\\">NULL</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">maxChar</span><span style=\\\"color: #0000FF;\\\">):</span><span style=\\\"color: #000000;\\\">0</span><span style=\\\"color: #0000FF;\\\">))</span>\\n <span style=\\\"color: #000000;\\\">suffixLinks</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">append</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">suffixLinks</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">root</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #000000;\\\">starts</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">append</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">starts</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">start</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #000000;\\\">endIndices</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">append</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">endIndices</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">finishIdx</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #000000;\\\">suffixIndices</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">append</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">suffixIndices</span><span style=\\\"color: #0000FF;\\\">,-</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #008080;\\\">return</span> <span style=\\\"color: #7060A8;\\\">length</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">children</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;\\\">function</span> <span style=\\\"color: #000000;\\\">edgeLength</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;\\\">return</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: #000000;\\\">root</span><span style=\\\"color: #0000FF;\\\">?</span><span style=\\\"color: #000000;\\\">0</span><span style=\\\"color: #0000FF;\\\">:</span><span style=\\\"color: #000000;\\\">leaves</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">endIndices</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">n</span><span style=\\\"color: #0000FF;\\\">]]</span> <span style=\\\"color: #0000FF;\\\">-</span> <span style=\\\"color: #000000;\\\">starts</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">n</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: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">function</span>\\n\\n <span style=\\\"color: #008080;\\\">function</span> <span style=\\\"color: #000000;\\\">walkDown</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #004080;\\\">integer</span> <span style=\\\"color: #000000;\\\">currNode</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: #000000;\\\">edgeLength</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">currNode</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #008080;\\\">if</span> <span style=\\\"color: #000000;\\\">activeLength</span> <span style=\\\"color: #0000FF;\\\">>=</span> <span style=\\\"color: #000000;\\\">l</span> <span style=\\\"color: #008080;\\\">then</span>\\n <span style=\\\"color: #000000;\\\">activeEdge</span> <span style=\\\"color: #0000FF;\\\">+=</span> <span style=\\\"color: #000000;\\\">l</span>\\n <span style=\\\"color: #000000;\\\">activeLength</span> <span style=\\\"color: #0000FF;\\\">-=</span> <span style=\\\"color: #000000;\\\">l</span>\\n <span style=\\\"color: #000000;\\\">activeNode</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">currNode</span>\\n <span style=\\\"color: #008080;\\\">return</span> <span style=\\\"color: #004600;\\\">true</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">if</span>\\n <span style=\\\"color: #008080;\\\">return</span> <span style=\\\"color: #004600;\\\">false</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;\\\">extendSuffixTree</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #004080;\\\">integer</span> <span style=\\\"color: #000000;\\\">pos</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #000000;\\\">leaves</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">leafEndIdx</span><span style=\\\"color: #0000FF;\\\">]</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">pos</span>\\n <span style=\\\"color: #000000;\\\">remainingSuffixCount</span> <span style=\\\"color: #0000FF;\\\">+=</span> <span style=\\\"color: #000000;\\\">1</span>\\n <span style=\\\"color: #000000;\\\">lastNewNode</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #004600;\\\">NULL</span>\\n <span style=\\\"color: #008080;\\\">while</span> <span style=\\\"color: #000000;\\\">remainingSuffixCount</span> <span style=\\\"color: #0000FF;\\\">></span> <span style=\\\"color: #000000;\\\">0</span> <span style=\\\"color: #008080;\\\">do</span>\\n <span style=\\\"color: #008080;\\\">if</span> <span style=\\\"color: #000000;\\\">activeLength</span> <span style=\\\"color: #0000FF;\\\">==</span> <span style=\\\"color: #000000;\\\">0</span> <span style=\\\"color: #008080;\\\">then</span>\\n <span style=\\\"color: #000000;\\\">activeEdge</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">pos</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;\\\">ta</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">text</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">activeEdge</span><span style=\\\"color: #0000FF;\\\">]</span>\\n <span style=\\\"color: #004080;\\\">bool</span> <span style=\\\"color: #000000;\\\">ca0</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">children</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">activeNode</span><span style=\\\"color: #0000FF;\\\">]=</span><span style=\\\"color: #000000;\\\">0</span>\\n <span style=\\\"color: #004080;\\\">integer</span> <span style=\\\"color: #000000;\\\">next</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #008080;\\\">iff</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">ca0</span><span style=\\\"color: #0000FF;\\\">?</span><span style=\\\"color: #004600;\\\">NULL</span><span style=\\\"color: #0000FF;\\\">:</span><span style=\\\"color: #000000;\\\">children</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">activeNode</span><span style=\\\"color: #0000FF;\\\">][</span><span style=\\\"color: #000000;\\\">ta</span><span style=\\\"color: #0000FF;\\\">])</span>\\n <span style=\\\"color: #008080;\\\">if</span> <span style=\\\"color: #000000;\\\">next</span><span style=\\\"color: #0000FF;\\\">==</span><span style=\\\"color: #004600;\\\">null</span> <span style=\\\"color: #008080;\\\">then</span>\\n <span style=\\\"color: #008080;\\\">if</span> <span style=\\\"color: #000000;\\\">ca0</span> <span style=\\\"color: #008080;\\\">then</span>\\n <span style=\\\"color: #000000;\\\">children</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">activeNode</span><span style=\\\"color: #0000FF;\\\">]</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">repeat</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #004600;\\\">NULL</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">maxChar</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">if</span>\\n <span style=\\\"color: #000000;\\\">children</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">activeNode</span><span style=\\\"color: #0000FF;\\\">][</span><span style=\\\"color: #000000;\\\">ta</span><span style=\\\"color: #0000FF;\\\">]</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">newNode</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">pos</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">leafEndIdx</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #008080;\\\">if</span> <span style=\\\"color: #000000;\\\">lastNewNode</span><span style=\\\"color: #0000FF;\\\">!=</span><span style=\\\"color: #004600;\\\">NULL</span> <span style=\\\"color: #008080;\\\">then</span>\\n <span style=\\\"color: #000000;\\\">suffixLinks</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">lastNewNode</span><span style=\\\"color: #0000FF;\\\">]</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">activeNode</span>\\n <span style=\\\"color: #000000;\\\">lastNewNode</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;\\\">else</span>\\n <span style=\\\"color: #008080;\\\">if</span> <span style=\\\"color: #000000;\\\">walkDown</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: #008080;\\\">continue</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;\\\">tp</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">text</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">pos</span><span style=\\\"color: #0000FF;\\\">]</span>\\n <span style=\\\"color: #008080;\\\">if</span> <span style=\\\"color: #000000;\\\">text</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">starts</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">next</span><span style=\\\"color: #0000FF;\\\">]+</span><span style=\\\"color: #000000;\\\">activeLength</span><span style=\\\"color: #0000FF;\\\">]</span> <span style=\\\"color: #0000FF;\\\">==</span> <span style=\\\"color: #000000;\\\">tp</span> <span style=\\\"color: #008080;\\\">then</span>\\n <span style=\\\"color: #008080;\\\">if</span> <span style=\\\"color: #000000;\\\">lastNewNode</span><span style=\\\"color: #0000FF;\\\">!=</span><span style=\\\"color: #004600;\\\">NULL</span> <span style=\\\"color: #008080;\\\">and</span> <span style=\\\"color: #000000;\\\">activeNode</span><span style=\\\"color: #0000FF;\\\">!=</span><span style=\\\"color: #000000;\\\">root</span> <span style=\\\"color: #008080;\\\">then</span>\\n <span style=\\\"color: #000000;\\\">suffixLinks</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">lastNewNode</span><span style=\\\"color: #0000FF;\\\">]</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">activeNode</span>\\n <span style=\\\"color: #000000;\\\">lastNewNode</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: #000000;\\\">activeLength</span> <span style=\\\"color: #0000FF;\\\">+=</span> <span style=\\\"color: #000000;\\\">1</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;\\\">temp</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">starts</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: #000000;\\\">activeLength</span> <span style=\\\"color: #0000FF;\\\">-</span> <span style=\\\"color: #000000;\\\">1</span>\\n <span style=\\\"color: #000000;\\\">splitEndIdx</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">new_leaf</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">temp</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #004080;\\\">integer</span> <span style=\\\"color: #000000;\\\">splitnode</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">newNode</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">starts</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">next</span><span style=\\\"color: #0000FF;\\\">],</span> <span style=\\\"color: #000000;\\\">splitEndIdx</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #004600;\\\">true</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #000000;\\\">ta</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">text</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">activeEdge</span><span style=\\\"color: #0000FF;\\\">]</span>\\n <span style=\\\"color: #000000;\\\">children</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">activeNode</span><span style=\\\"color: #0000FF;\\\">][</span><span style=\\\"color: #000000;\\\">ta</span><span style=\\\"color: #0000FF;\\\">]</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">splitnode</span>\\n <span style=\\\"color: #000000;\\\">children</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">splitnode</span><span style=\\\"color: #0000FF;\\\">][</span><span style=\\\"color: #000000;\\\">tp</span><span style=\\\"color: #0000FF;\\\">]</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">newNode</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">pos</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">leafEndIdx</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #000000;\\\">starts</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: #000000;\\\">activeLength</span>\\n <span style=\\\"color: #000000;\\\">children</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">splitnode</span><span style=\\\"color: #0000FF;\\\">][</span><span style=\\\"color: #000000;\\\">text</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">starts</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: #000000;\\\">next</span>\\n <span style=\\\"color: #008080;\\\">if</span> <span style=\\\"color: #000000;\\\">lastNewNode</span><span style=\\\"color: #0000FF;\\\">!=</span><span style=\\\"color: #004600;\\\">NULL</span> <span style=\\\"color: #008080;\\\">then</span>\\n <span style=\\\"color: #000000;\\\">suffixLinks</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">lastNewNode</span><span style=\\\"color: #0000FF;\\\">]</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">splitnode</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">if</span>\\n <span style=\\\"color: #000000;\\\">lastNewNode</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">splitnode</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">if</span>\\n <span style=\\\"color: #000000;\\\">remainingSuffixCount</span> <span style=\\\"color: #0000FF;\\\">-=</span> <span style=\\\"color: #000000;\\\">1</span>\\n <span style=\\\"color: #008080;\\\">if</span> <span style=\\\"color: #000000;\\\">activeNode</span><span style=\\\"color: #0000FF;\\\">==</span><span style=\\\"color: #000000;\\\">root</span> <span style=\\\"color: #008080;\\\">and</span> <span style=\\\"color: #000000;\\\">activeLength</span><span style=\\\"color: #0000FF;\\\">></span><span style=\\\"color: #000000;\\\">0</span> <span style=\\\"color: #008080;\\\">then</span>\\n <span style=\\\"color: #000000;\\\">activeLength</span> <span style=\\\"color: #0000FF;\\\">-=</span> <span style=\\\"color: #000000;\\\">1</span>\\n <span style=\\\"color: #000000;\\\">activeEdge</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">pos</span> <span style=\\\"color: #0000FF;\\\">-</span> <span style=\\\"color: #000000;\\\">remainingSuffixCount</span> <span style=\\\"color: #0000FF;\\\">+</span> <span style=\\\"color: #000000;\\\">1</span>\\n <span style=\\\"color: #008080;\\\">elsif</span> <span style=\\\"color: #000000;\\\">activeNode</span><span style=\\\"color: #0000FF;\\\">!=</span><span style=\\\"color: #000000;\\\">root</span> <span style=\\\"color: #008080;\\\">then</span>\\n <span style=\\\"color: #000000;\\\">activeNode</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">suffixLinks</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">activeNode</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;\\\">while</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;\\\">setSuffixIndexByDFS</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #004080;\\\">integer</span> <span style=\\\"color: #000000;\\\">n</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">labelHeight</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: #004600;\\\">NULL</span> <span style=\\\"color: #008080;\\\">then</span>\\n <span style=\\\"color: #008080;\\\">if</span> <span style=\\\"color: #000000;\\\">children</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>\\n <span style=\\\"color: #000000;\\\">suffixIndices</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">n</span><span style=\\\"color: #0000FF;\\\">]</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">size</span> <span style=\\\"color: #0000FF;\\\">-</span> <span style=\\\"color: #000000;\\\">labelHeight</span>\\n <span style=\\\"color: #008080;\\\">else</span>\\n <span style=\\\"color: #004080;\\\">bool</span> <span style=\\\"color: #000000;\\\">leaf</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #004600;\\\">true</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;\\\">maxChar</span> <span style=\\\"color: #008080;\\\">do</span>\\n <span style=\\\"color: #004080;\\\">integer</span> <span style=\\\"color: #000000;\\\">nci</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">children</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>\\n <span style=\\\"color: #008080;\\\">if</span> <span style=\\\"color: #000000;\\\">nci</span><span style=\\\"color: #0000FF;\\\">!=</span><span style=\\\"color: #004600;\\\">NULL</span> <span style=\\\"color: #008080;\\\">then</span>\\n <span style=\\\"color: #000000;\\\">leaf</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #004600;\\\">false</span>\\n <span style=\\\"color: #000000;\\\">setSuffixIndexByDFS</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">nci</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">labelHeight</span><span style=\\\"color: #0000FF;\\\">+</span><span style=\\\"color: #000000;\\\">edgeLength</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">nci</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;\\\">leaf</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;\\\">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;\\\">procedure</span> <span style=\\\"color: #000000;\\\">buildSuffixTree</span><span style=\\\"color: #0000FF;\\\">()</span>\\n <span style=\\\"color: #000000;\\\">size</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">length</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">text</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #000000;\\\">rootEndIdx</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">new_leaf</span><span style=\\\"color: #0000FF;\\\">(-</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #000000;\\\">root</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">newNode</span><span style=\\\"color: #0000FF;\\\">(-</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">rootEndIdx</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #000000;\\\">activeNode</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">root</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;\\\">size</span> <span style=\\\"color: #008080;\\\">do</span>\\n <span style=\\\"color: #000000;\\\">extendSuffixTree</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: #004080;\\\">integer</span> <span style=\\\"color: #000000;\\\">labelHeight</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">0</span>\\n <span style=\\\"color: #000000;\\\">setSuffixIndexByDFS</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">root</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">labelHeight</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;\\\">procedure</span> <span style=\\\"color: #000000;\\\">doTraversal</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #004080;\\\">integer</span> <span style=\\\"color: #000000;\\\">n</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">labelHeight</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">maxHeightIdx</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">substringStartIndex</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: #004600;\\\">NULL</span> <span style=\\\"color: #008080;\\\">then</span>\\n <span style=\\\"color: #004080;\\\">integer</span> <span style=\\\"color: #000000;\\\">nsi</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">suffixIndices</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">n</span><span style=\\\"color: #0000FF;\\\">],</span> <span style=\\\"color: #000000;\\\">newHeight</span>\\n <span style=\\\"color: #008080;\\\">if</span> <span style=\\\"color: #000000;\\\">nsi</span> <span style=\\\"color: #0000FF;\\\">==</span> <span style=\\\"color: #0000FF;\\\">-</span><span style=\\\"color: #000000;\\\">1</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;\\\">1</span> <span style=\\\"color: #008080;\\\">to</span> <span style=\\\"color: #000000;\\\">maxChar</span> <span style=\\\"color: #008080;\\\">do</span>\\n <span style=\\\"color: #004080;\\\">integer</span> <span style=\\\"color: #000000;\\\">nci</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">children</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>\\n <span style=\\\"color: #008080;\\\">if</span> <span style=\\\"color: #000000;\\\">nci</span><span style=\\\"color: #0000FF;\\\">!=</span><span style=\\\"color: #004600;\\\">NULL</span> <span style=\\\"color: #008080;\\\">then</span>\\n <span style=\\\"color: #000000;\\\">newHeight</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">labelHeight</span><span style=\\\"color: #0000FF;\\\">+</span><span style=\\\"color: #000000;\\\">edgeLength</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">nci</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #000000;\\\">doTraversal</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">nci</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">newHeight</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">maxHeightIdx</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">substringStartIndex</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;\\\">elsif</span> <span style=\\\"color: #000000;\\\">nsi</span> <span style=\\\"color: #0000FF;\\\">></span> <span style=\\\"color: #0000FF;\\\">-</span><span style=\\\"color: #000000;\\\">1</span> <span style=\\\"color: #008080;\\\">then</span>\\n <span style=\\\"color: #000000;\\\">newHeight</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">labelHeight</span><span style=\\\"color: #0000FF;\\\">-</span><span style=\\\"color: #000000;\\\">edgeLength</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: #000000;\\\">leaves</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">maxHeightIdx</span><span style=\\\"color: #0000FF;\\\">]<</span><span style=\\\"color: #000000;\\\">newHeight</span> <span style=\\\"color: #008080;\\\">then</span>\\n <span style=\\\"color: #000000;\\\">leaves</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">maxHeightIdx</span><span style=\\\"color: #0000FF;\\\">]</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">newHeight</span>\\n <span style=\\\"color: #000000;\\\">leaves</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">substringStartIndex</span><span style=\\\"color: #0000FF;\\\">]</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">nsi</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;\\\">end</span> <span style=\\\"color: #008080;\\\">procedure</span>\\n\\n <span style=\\\"color: #008080;\\\">function</span> <span style=\\\"color: #000000;\\\">getLongestRepeatedSubstring</span><span style=\\\"color: #0000FF;\\\">()</span>\\n <span style=\\\"color: #004080;\\\">integer</span> <span style=\\\"color: #000000;\\\">maxHeightIdx</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">new_leaf</span><span style=\\\"color: #0000FF;\\\">(),</span>\\n <span style=\\\"color: #000000;\\\">substringStartIndex</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">new_leaf</span><span style=\\\"color: #0000FF;\\\">()</span>\\n <span style=\\\"color: #000000;\\\">doTraversal</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">root</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">0</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">maxHeightIdx</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">substringStartIndex</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #004080;\\\">integer</span> <span style=\\\"color: #000000;\\\">maxHeight</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">leaves</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">maxHeightIdx</span><span style=\\\"color: #0000FF;\\\">],</span>\\n <span style=\\\"color: #000000;\\\">start</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">leaves</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">substringStartIndex</span><span style=\\\"color: #0000FF;\\\">]</span>\\n <span style=\\\"color: #004080;\\\">string</span> <span style=\\\"color: #000000;\\\">t</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #008080;\\\">iff</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">maxHeight</span><span style=\\\"color: #0000FF;\\\">=</span><span style=\\\"color: #000000;\\\">0</span><span style=\\\"color: #0000FF;\\\">?</span><span style=\\\"color: #008000;\\\">\\\"No repeated substring\\\"</span>\\n <span style=\\\"color: #0000FF;\\\">:</span><span style=\\\"color: #000000;\\\">text</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><span style=\\\"color: #000000;\\\">start</span><span style=\\\"color: #0000FF;\\\">+</span><span style=\\\"color: #000000;\\\">maxHeight</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: #008080;\\\">constant</span> <span style=\\\"color: #000000;\\\">tests</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #0000FF;\\\">{</span><span style=\\\"color: #008000;\\\">\\\"CAAAABAAAABD$\\\"</span><span style=\\\"color: #0000FF;\\\">,</span>\\n <span style=\\\"color: #008000;\\\">\\\"GEEKSFORGEEKS$\\\"</span><span style=\\\"color: #0000FF;\\\">,</span>\\n <span style=\\\"color: #008000;\\\">\\\"AAAAAAAAAA$\\\"</span><span style=\\\"color: #0000FF;\\\">,</span>\\n <span style=\\\"color: #008000;\\\">\\\"ABCDEFG$\\\"</span><span style=\\\"color: #0000FF;\\\">,</span>\\n <span style=\\\"color: #008000;\\\">\\\"ABABABA$\\\"</span><span style=\\\"color: #0000FF;\\\">,</span>\\n <span style=\\\"color: #008000;\\\">\\\"ATCGATCGA$\\\"</span><span style=\\\"color: #0000FF;\\\">,</span>\\n <span style=\\\"color: #008000;\\\">\\\"banana$\\\"</span><span style=\\\"color: #0000FF;\\\">,</span>\\n <span style=\\\"color: #008000;\\\">\\\"abcpqrabpqpq$\\\"</span><span style=\\\"color: #0000FF;\\\">,</span>\\n <span style=\\\"color: #008000;\\\">\\\"pqrpqpqabab$\\\"</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;\\\">\\\"Longest Repeated Substring in:\\\\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;\\\">tests</span><span style=\\\"color: #0000FF;\\\">)</span> <span style=\\\"color: #008080;\\\">do</span>\\n <span style=\\\"color: #000000;\\\">text</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: #000000;\\\">buildSuffixTree</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 is: %s\\\\n\\\"</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #0000FF;\\\">{</span><span style=\\\"color: #000000;\\\">text</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">getLongestRepeatedSubstring</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\\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: #004080;\\\">string</span> <span style=\\\"color: #000000;\\\">piStr</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: #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><span style=\\\"color: #000000;\\\">0</span><span style=\\\"color: #0000FF;\\\">,-</span><span style=\\\"color: #000000;\\\">1001</span><span style=\\\"color: #0000FF;\\\">)</span> <span style=\\\"color: #000080;font-style:italic;\\\">-- (set precision to 1,000 dp, plus the \\\"3.\\\")</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: #000000;\\\">piStr</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">mpfr_get_fixed</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">pi</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">1000</span><span style=\\\"color: #0000FF;\\\">)</span> <span style=\\\"color: #000080;font-style:italic;\\\">-- (all we can really manage under pwa/p2js)</span>\\n <span style=\\\"color: #008080;\\\">else</span>\\n <span style=\\\"color: #000080;font-style:italic;\\\">-- gmp crashes when I try 100,000 dp, so just get from file</span>\\n <span style=\\\"color: #000000;\\\">piStr</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">get_text</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #008000;\\\">`E:\\\\downloads\\\\misc\\\\arm\\\\pi-10million.txt`</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">if</span>\\n <span style=\\\"color: #000000;\\\">piStr</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">piStr</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">3</span><span style=\\\"color: #0000FF;\\\">..$]</span> <span style=\\\"color: #000080;font-style:italic;\\\">-- discard leading \\\"3.\\\"</span>\\n <span style=\\\"color: #000000;\\\">maxChar</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #008000;\\\">'9'</span>\\n <span style=\\\"color: #008080;\\\">for</span> <span style=\\\"color: #000000;\\\">i</span><span style=\\\"color: #0000FF;\\\">=</span><span style=\\\"color: #000000;\\\">3</span> <span style=\\\"color: #008080;\\\">to</span> <span style=\\\"color: #008080;\\\">iff</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #7060A8;\\\">platform</span><span style=\\\"color: #0000FF;\\\">()=</span><span style=\\\"color: #004600;\\\">JS</span><span style=\\\"color: #0000FF;\\\">?</span><span style=\\\"color: #000000;\\\">3</span><span style=\\\"color: #0000FF;\\\">:</span><span style=\\\"color: #000000;\\\">6</span><span style=\\\"color: #0000FF;\\\">)</span> <span style=\\\"color: #008080;\\\">do</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;\\\">integer</span> <span style=\\\"color: #000000;\\\">n</span> <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: #000000;\\\">i</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #000000;\\\">text</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">piStr</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: #0000FF;\\\">&</span> <span style=\\\"color: #008000;\\\">\\\"$\\\"</span>\\n <span style=\\\"color: #000000;\\\">buildSuffixTree</span><span style=\\\"color: #0000FF;\\\">()</span>\\n <span style=\\\"color: #004080;\\\">string</span> <span style=\\\"color: #000000;\\\">r</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">getLongestRepeatedSubstring</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;\\\">\\\" first %,d d.p. of Pi is: %s (%s)\\\\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;\\\">r</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">e</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\": \"import \\\"./big\\\" for BigRat\\nimport \\\"./dynamic\\\" for Struct\\nimport \\\"./trait\\\" for ByRef\\nimport \\\"io\\\" for File\\n\\nvar maxChar = 128\\n\\nvar Node = Struct.create(\\\"Node\\\", [\\\"children\\\", \\\"suffixLink\\\", \\\"start\\\", \\\"pEnd\\\", \\\"suffixIndex\\\"])\\n\\nvar text = \\\"\\\"\\nvar root = null\\nvar lastNewNode = null\\nvar activeNode = null\\nvar activeEdge = -1\\nvar activeLength = 0\\nvar remainingSuffixCount = 0\\nvar pLeafEnd = ByRef.new(-1)\\nvar pRootEnd = null\\nvar pSplitEnd = null\\nvar size = -1\\n\\nvar newNode = Fn.new { |start, pEnd|\\n var children = List.filled(maxChar, null)\\n var suffixLink = root\\n var suffixIndex = -1\\n return Node.new(children, suffixLink, start, pEnd, suffixIndex)\\n}\\n\\nvar edgeLength = Fn.new { |n|\\n if (n == root) return 0\\n return n.pEnd.value - n.start + 1\\n}\\n\\nvar walkDown = Fn.new { |currNode|\\n var el = edgeLength.call(currNode)\\n if (activeLength >= el) {\\n activeEdge = activeEdge + el\\n activeLength = activeLength - el\\n activeNode = currNode\\n return true\\n }\\n return false\\n}\\n\\nvar extendSuffixTree = Fn.new { |pos|\\n pLeafEnd.value = pos\\n remainingSuffixCount = remainingSuffixCount + 1\\n lastNewNode = null\\n while (remainingSuffixCount > 0) {\\n if (activeLength == 0) activeEdge = pos\\n if (!activeNode.children[text[activeEdge].bytes[0]]) {\\n activeNode.children[text[activeEdge].bytes[0]] = newNode.call(pos, pLeafEnd)\\n if (lastNewNode) {\\n lastNewNode.suffixLink = activeNode\\n lastNewNode = null\\n }\\n } else {\\n var next = activeNode.children[text[activeEdge].bytes[0]]\\n if (walkDown.call(next)) continue\\n if (text[next.start + activeLength] == text[pos]) {\\n if (lastNewNode && activeNode != root) {\\n lastNewNode.suffixLink = activeNode\\n lastNewNode = null\\n }\\n activeLength = activeLength + 1\\n break\\n }\\n var temp = next.start + activeLength - 1\\n pSplitEnd = ByRef.new(temp)\\n var split = newNode.call(next.start, pSplitEnd)\\n activeNode.children[text[activeEdge].bytes[0]] = split\\n split.children[text[pos].bytes[0]] = newNode.call(pos, pLeafEnd)\\n next.start = next.start + activeLength\\n split.children[text[next.start].bytes[0]] = next\\n if (lastNewNode) lastNewNode.suffixLink = split\\n lastNewNode = split\\n }\\n remainingSuffixCount = remainingSuffixCount - 1\\n if (activeNode == root && activeLength > 0) {\\n activeLength = activeLength - 1\\n activeEdge = pos - remainingSuffixCount + 1\\n } else if (activeNode != root) {\\n activeNode = activeNode.suffixLink\\n }\\n }\\n}\\n\\nvar setSuffixIndexByDFS // recursive\\nsetSuffixIndexByDFS = Fn.new { |n, labelHeight|\\n if (!n) return\\n if (n.start != -1) {\\n // Uncomment line below to print suffix tree\\n // System.write(text[n.start..n.pEnd.value])\\n }\\n var leaf = 1\\n for (i in 0...maxChar) {\\n if (n.children[i]) {\\n // Uncomment the 3 lines below to print suffix index\\n // if (leaf == 1 && n.start != -1) {\\n // System.print(\\\" [%(n.suffixIndex)]\\\")\\n // }\\n leaf = 0\\n setSuffixIndexByDFS.call(n.children[i], labelHeight + edgeLength.call(n.children[i]))\\n }\\n }\\n if (leaf == 1) {\\n n.suffixIndex = size - labelHeight\\n // Uncomment line below to print suffix index\\n // System.print(\\\" [%(n.suffixIndex)]\\\")\\n }\\n}\\n\\nvar buildSuffixTree = Fn.new {\\n size = text.count\\n var temp = -1\\n pRootEnd = ByRef.new(temp)\\n root = newNode.call(-1, pRootEnd)\\n activeNode = root\\n for (i in 0...size) extendSuffixTree.call(i)\\n var labelHeight = 0\\n setSuffixIndexByDFS.call(root, labelHeight)\\n}\\n\\nvar doTraversal // recursive\\ndoTraversal = Fn.new { |n, labelHeight, pMaxHeight, pSubstringStartIndex|\\n if (!n) return\\n if (n.suffixIndex == -1) {\\n for (i in 0...maxChar) {\\n if (n.children[i]) {\\n doTraversal.call(n.children[i], labelHeight + edgeLength.call(n.children[i]),\\n pMaxHeight, pSubstringStartIndex)\\n }\\n }\\n } else if (n.suffixIndex > -1 && (pMaxHeight.value < labelHeight - edgeLength.call(n))) {\\n pMaxHeight.value = labelHeight - edgeLength.call(n)\\n pSubstringStartIndex.value = n.suffixIndex\\n }\\n}\\n\\nvar getLongestRepeatedSubstring = Fn.new { |s|\\n var maxHeight = 0\\n var substringStartIndex = 0\\n var pMaxHeight = ByRef.new(maxHeight)\\n var pSubstringStartIndex = ByRef.new(substringStartIndex)\\n doTraversal.call(root, 0, pMaxHeight, pSubstringStartIndex)\\n maxHeight = pMaxHeight.value\\n substringStartIndex = pSubstringStartIndex.value\\n // Uncomment line below to print maxHeight and substringStartIndex\\n // System.print(\\\"maxHeight %(maxHeight), substringStartIndex %(substringStartIndex)\\\")\\n if (s == \\\"\\\") {\\n System.write(\\\" %(text) is: \\\")\\n } else {\\n System.write(\\\" %(s) is: \\\")\\n }\\n var k = 0\\n while (k < maxHeight) {\\n System.write(text[k + substringStartIndex])\\n k = k + 1\\n }\\n if (k == 0) {\\n System.write(\\\"No repeated substring\\\")\\n }\\n System.print()\\n}\\n\\nvar tests = [\\n \\\"GEEKSFORGEEKS$\\\",\\n \\\"AAAAAAAAAA$\\\",\\n \\\"ABCDEFG$\\\",\\n \\\"ABABABA$\\\",\\n \\\"ATCGATCGA$\\\",\\n \\\"banana$\\\",\\n \\\"abcpqrabpqpq$\\\",\\n \\\"pqrpqpqabab$\\\",\\n]\\nSystem.print(\\\"Longest Repeated Substring in:\\\\n\\\")\\nfor (test in tests) {\\n text = test\\n buildSuffixTree.call()\\n getLongestRepeatedSubstring.call(\\\"\\\")\\n}\\nSystem.print()\\n\\n// load pi to 100,182 digits\\nvar piStr = File.read(\\\"pi_100000.txt\\\")\\npiStr = piStr[2..-1] // remove initial 3.\\nvar numbers = [1e3, 1e4, 1e5]\\nmaxChar = 58\\nfor (number in numbers) {\\n var start = System.clock\\n text = piStr[0...number] + \\\"$\\\"\\n buildSuffixTree.call()\\n getLongestRepeatedSubstring.call(\\\"first %(number) d.p. of Pi\\\")\\n var elapsed = (System.clock - start) * 1000\\n System.print(\\\" (this took %(elapsed) ms)\\\\n\\\")\\n}\\n\",\n \"language\": \"Wren\"\n }\n]","isConversational":false},"task_name":{"kind":"string","value":"Ukkonen-s-suffix-tree-construction"}}},{"rowIdx":1779,"cells":{"solutions":{"kind":"list like","value":[{"code":"---\nfrom: http://rosettacode.org/wiki/Ulam_spiral_(for_primes)\nnote: Prime Numbers\n","language":"00-META"},{"code":"An Ulam spiral (of primes) is a method of visualizing primes when expressed in a (normally counter-clockwise) outward spiral (usually starting at <big>'''1'''</big>), constructed on a square grid, starting at the \"center\". \n\nAn Ulam spiral is also known as a ''prime spiral''. \n\nThe first grid (green) is shown with sequential integers, starting at <big>'''1'''</big>. \n\nIn an Ulam spiral of primes, only the primes are shown (usually indicated by some glyph such as a dot or asterisk), and all non-primes as shown as a blank (or some other whitespace). \n\nOf course, the grid and border are not to be displayed (but they are displayed here when using these Wiki HTML tables).\n\nNormally, the spiral starts in the \"center\", and the 2<sup>nd</sup> number is to the viewer's right and the number spiral starts from there in a counter-clockwise direction. \n\nThere are other geometric shapes that are used as well, including clock-wise spirals. \n\nAlso, some spirals (for the 2<sup>nd</sup> number) is viewed upwards from the 1<sup>st</sup> number instead of to the right, but that is just a matter of orientation.\n\nSometimes, the starting number can be specified to show more visual striking patterns (of prime densities).\n\n[A larger than necessary grid (numbers wise) is shown here to illustrate the pattern of numbers on the diagonals (which may be used by the method to orientate the direction of spiral-construction algorithm within the example computer programs)]. \n\nThen, in the next phase in the transformation of the Ulam prime spiral, the non-primes are translated to blanks. \n\nIn the orange grid below, the primes are left intact, and all non-primes are changed to blanks. \n\nThen, in the final transformation of the Ulam spiral (the yellow grid), translate the primes to a glyph such as a <big><big><b> • </b></big></big> or some other suitable glyph.\n<br>\n\n{| class=\"wikitable\" style=\"float:left;border: 2px solid black; background:lightgreen; color:black; margin-left:0;margin-right:auto;text-align:center;width:34em;height:34em;table-layout:fixed;font-size:70%\"\n|-\n| <big><big>'''65'''</big></big> || <big><big>'''64'''</big></big> || <big><big>'''63'''</big></big> || <big><big>'''62'''</big></big> || <big><big>'''61'''</big></big> || <big><big>'''60'''</big></big> || <big><big>'''59'''</big></big> || <big><big>'''58'''</big></big> || <big><big>'''57'''</big></big>\n|->\n| <big><big>'''66'''</big></big> || <big><big>'''37'''</big></big> || <big><big>'''36'''</big></big> || <big><big>'''35'''</big></big> || <big><big>'''34'''</big></big> || <big><big>'''33'''</big></big> || <big><big>'''32'''</big></big> || <big><big>'''31'''</big></big> || <big><big>'''56'''</big></big>\n|-\n| <big><big>'''67'''</big></big> || <big><big>'''38'''</big></big> || <big><big>'''17'''</big></big> || <big><big>'''16'''</big></big> || <big><big>'''15'''</big></big> || <big><big>'''14'''</big></big> || <big><big>'''13'''</big></big> || <big><big>'''30'''</big></big> || <big><big>'''55'''</big></big>\n|-\n| <big><big>'''68'''</big></big> || <big><big>'''39'''</big></big> || <big><big>'''18'''</big></big> || <big><big>''' 5'''</big></big> || <big><big>''' 4'''</big></big> || <big><big>''' 3'''</big></big> || <big><big>'''12'''</big></big> || <big><big>'''29'''</big></big> || <big><big>'''54'''</big></big>\n|-\n| <big><big>'''69'''</big></big> || <big><big>'''40'''</big></big> || <big><big>'''19'''</big></big> || <big><big>''' 6'''</big></big> || <big><big>''' 1'''</big></big> || <big><big>''' 2'''</big></big> || <big><big>'''11'''</big></big> || <big><big>'''28'''</big></big> || <big><big>'''53'''</big></big>\n|-\n| <big><big>'''70'''</big></big> || <big><big>'''41'''</big></big> || <big><big>'''20'''</big></big> || <big><big>''' 7'''</big></big> || <big><big>''' 8'''</big></big> || <big><big>''' 9'''</big></big> || <big><big>'''10'''</big></big> || <big><big>'''27'''</big></big> || <big><big>'''52'''</big></big>\n|-\n| <big><big>'''71'''</big></big> || <big><big>'''42'''</big></big> || <big><big>'''21'''</big></big> || <big><big>'''22'''</big></big> || <big><big>'''23'''</big></big> || <big><big>'''24'''</big></big> || <big><big>'''25'''</big></big> || <big><big>'''26'''</big></big> || <big><big>'''51'''</big></big>\n|-\n| <big><big>'''72'''</big></big> || <big><big>'''43'''</big></big> || <big><big>'''44'''</big></big> || <big><big>'''45'''</big></big> || <big><big>'''46'''</big></big> || <big><big>'''47'''</big></big> || <big><big>'''48'''</big></big> || <big><big>'''49'''</big></big> || <big><big>'''50'''</big></big>\n|-\n| <big><big>'''73'''</big></big> || <big><big>'''74'''</big></big> || <big><big>'''75'''</big></big> || <big><big>'''76'''</big></big> || <big><big>'''77'''</big></big> || <big><big>'''78'''</big></big> || <big><big>'''79'''</big></big> || <big><big>'''80'''</big></big> || <big><big>'''81'''</big></big>\n|}\n\n{| class=\"wikitable\" style=\"float:left;border: 2px solid black; background:orange; color:black; margin-left:20px;margin-right:auto;text-align:center;width:34em;height:34em;table-layout:fixed;font-size:70%\"\n|-\n| <big><big>''' '''</big></big> || <big><big>''' '''</big></big> || <big><big>''' '''</big></big> || <big><big>''' '''</big></big> || <big><big>'''61'''</big></big> || <big><big>''' '''</big></big> || <big><big>'''59'''</big></big> || <big><big>''' '''</big></big> || <big><big>''' '''</big></big>\n|-\n| <big><big>''' '''</big></big> || <big><big>'''37'''</big></big> || <big><big>''' '''</big></big> || <big><big>''' '''</big></big> || <big><big>''' '''</big></big> || <big><big>''' '''</big></big> || <big><big>''' '''</big></big> || <big><big>'''31'''</big></big> || <big><big>''' '''</big></big>\n|-\n| <big><big>'''67'''</big></big> || <big><big>''' '''</big></big> || <big><big>'''17'''</big></big> || <big><big>''' '''</big></big> || <big><big>''' '''</big></big> || <big><big>''' '''</big></big> || <big><big>'''13'''</big></big> || <big><big>''' '''</big></big> || <big><big>''' '''</big></big>\n|-\n| <big><big>''' '''</big></big> || <big><big>''' '''</big></big> || <big><big>''' '''</big></big> || <big><big>''' 5'''</big></big> || <big><big>''' '''</big></big> || <big><big>''' 3'''</big></big> || <big><big>''' '''</big></big> || <big><big>'''29'''</big></big> || <big><big>''' '''</big></big>\n|-\n| <big><big>''' '''</big></big> || <big><big>''' '''</big></big> || <big><big>'''19'''</big></big> || <big><big>''' '''</big></big> || <big><big>''' '''</big></big> || <big><big>''' 2'''</big></big> || <big><big>'''11'''</big></big> || <big><big>''' '''</big></big> || <big><big>'''53'''</big></big>\n|-\n| <big><big>''' '''</big></big> || <big><big>'''41'''</big></big> || <big><big>''' '''</big></big> || <big><big>''' 7'''</big></big> || <big><big>''' '''</big></big> || <big><big>''' '''</big></big> || <big><big>''' '''</big></big> || <big><big>''' '''</big></big> || <big><big>''' '''</big></big>\n|-\n| <big><big>'''71'''</big></big> || <big><big>''' '''</big></big> || <big><big>''' '''</big></big> || <big><big>''' '''</big></big> || <big><big>'''23'''</big></big> || <big><big>''' '''</big></big> || <big><big>''' '''</big></big> || <big><big>''' '''</big></big> || <big><big>''' '''</big></big>\n|-\n| <big><big>''' '''</big></big> || <big><big>'''43'''</big></big> || <big><big>''' '''</big></big> || <big><big>''' '''</big></big> || <big><big>''' '''</big></big> || <big><big>'''47'''</big></big> || <big><big>''' '''</big></big> || <big><big>''' '''</big></big> || <big><big>''' '''</big></big>\n|-\n| <big><big>'''73'''</big></big> || <big><big>''' '''</big></big> || <big><big>''' '''</big></big> || <big><big>''' '''</big></big> || <big><big>''' '''</big></big> || <big><big>''' '''</big></big> || <big><big>'''79'''</big></big> || <big><big>''' '''</big></big> || <big><big>''' '''</big></big>\n|}\n\n{| class=\"wikitable\" style=\"float:left;border: 2px solid black; background:yellow; color:black; margin-left:20px;margin-right:auto;text-align:center;width:34em;height:34em;table-layout:fixed;font-size:70%\"\n|-\n| <big><big>''' '''</big></big> || <big><big>''' '''</big></big> || <big><big>''' '''</big></big> || <big><big>''' '''</big></big> || <big><big>''' •'''</big></big> || <big><big>''' '''</big></big> || <big><big>''' •'''</big></big> || <big><big>''' '''</big></big> || <big><big>''' '''</big></big>\n|-\n| <big><big>''' '''</big></big> || <big><big>''' •'''</big></big> || <big><big>''' '''</big></big> || <big><big>''' '''</big></big> || <big><big>''' '''</big></big> || <big><big>''' '''</big></big> || <big><big>''' '''</big></big> || <big><big>''' •'''</big></big> || <big><big>''' '''</big></big>\n|-\n| <big><big>''' •'''</big></big> || <big><big>''' '''</big></big> || <big><big>''' •'''</big></big> || <big><big>''' '''</big></big> || <big><big>''' '''</big></big> || <big><big>''' '''</big></big> || <big><big>''' •'''</big></big> || <big><big>''' '''</big></big> || <big><big>''' '''</big></big>\n|-\n| <big><big>''' '''</big></big> || <big><big>''' '''</big></big> || <big><big>''' '''</big></big> || <big><big>''' •'''</big></big> || <big><big>''' '''</big></big> || <big><big>''' •'''</big></big> || <big><big>''' '''</big></big> || <big><big>''' •'''</big></big> || <big><big>''' '''</big></big>\n|-\n| <big><big>''' '''</big></big> || <big><big>''' '''</big></big> || <big><big>''' •'''</big></big> || <big><big>''' '''</big></big> || <big><big>''' '''</big></big> || <big><big>''' •'''</big></big> || <big><big>''' •'''</big></big> || <big><big>''' '''</big></big> || <big><big>''' •'''</big></big>\n|-\n| <big><big>''' '''</big></big> || <big><big>''' •'''</big></big> || <big><big>''' '''</big></big> || <big><big>''' •'''</big></big> || <big><big>''' '''</big></big> || <big><big>''' '''</big></big> || <big><big>''' '''</big></big> || <big><big>''' '''</big></big> || <big><big>''' '''</big></big>\n|-\n| <big><big>''' •'''</big></big> || <big><big>''' '''</big></big> || <big><big>''' '''</big></big> || <big><big>''' '''</big></big> || <big><big>''' •'''</big></big> || <big><big>''' '''</big></big> || <big><big>''' '''</big></big> || <big><big>''' '''</big></big> || <big><big>''' '''</big></big>\n|-\n| <big><big>''' '''</big></big> || <big><big>''' •'''</big></big> || <big><big>''' '''</big></big> || <big><big>''' '''</big></big> || <big><big>''' '''</big></big> || <big><big>''' •'''</big></big> || <big><big>''' '''</big></big> || <big><big>''' '''</big></big> || <big><big>''' '''</big></big>\n|-\n| <big><big>''' •'''</big></big> || <big><big>''' '''</big></big> || <big><big>''' '''</big></big> || <big><big>''' '''</big></big> || <big><big>''' '''</big></big> || <big><big>''' '''</big></big> || <big><big>''' •'''</big></big> || <big><big>''' '''</big></big> || <big><big>''' '''</big></big>\n|}\n\n\n<br style=\"clear:both\">\nThe Ulam spiral becomes more visually obvious as the grid increases in size. \n\n\n;Task\nFor any sized <big>'''N × N'''</big> grid, construct and show an Ulam spiral (counter-clockwise) of primes starting at some specified initial number (the default would be '''1'''), with some suitably ''dotty'' (glyph) representation to indicate primes, and the absence of dots to indicate non-primes. \n\nYou should demonstrate the generator by showing at Ulam prime spiral large enough to (almost) fill your terminal screen.\n\n\n;Related tasks:\n* [[Spiral matrix]]\n* [[Zig-zag matrix]]\n* [[Identity matrix]] \n* [[Sequence of primes by Trial Division]]\n\n\n;See also\n* Wikipedia entry: [http://en.wikipedia.org/wiki/Ulam_spiral Ulam spiral] \n* MathWorld™ entry: [http://mathworld.wolfram.com/PrimeSpiral.html Prime Spiral]\n<br><br>\n\n","language":"00-TASK"},{"code":"F cell(n, =x, =y, start = 1)\n V d = 0\n y = y - n I/ 2\n x = x - (n - 1) I/ 2\n V l = 2 * max(abs(x), abs(y))\n d = I y >= x {(l * 3 + x + y)} E (l - x - y)\n R (l - 1) ^ 2 + d + start - 1\n\nF show_spiral(n, symbol = ‘# ’, start = 1, =space = ‘’)\n V top = start + n * n + 1\n V is_prime = [0B, 0B, 1B] [+] [1B, 0B] * (top I/ 2)\n L(x) 3 .< 1 + Int(sqrt(top))\n I !is_prime[x]\n L.continue\n L(i) (x * x .< top).step(x * 2)\n is_prime[i] = 0B\n\n (Int -> String) f = _ -> @symbol\n\n I space == ‘’\n space = ‘ ’ * symbol.len\n\n I symbol.empty\n V max_str = String(n * n + start - 1).len\n I space == ‘’\n space = (‘.’ * max_str)‘ ’\n f = x -> String(x).rjust(@max_str)‘ ’\n\n V cell_str = x -> I @is_prime[x] {@f(x)} E @space\n\n L(y) 0 .< n\n print((0 .< n).map(x -> cell(@n, x, @y, @start)).map(v -> @cell_str(v)).join(‘’))\n print()\n\nshow_spiral(10, symbol' ‘# ’, space' ‘ ’)\nshow_spiral(9, symbol' ‘’, space' ‘ - ’)\n","language":"11l"},{"code":"* Ulam spiral 26/04/2016\nULAM CSECT\n USING ULAM,R13 set base register\nSAVEAREA B STM-SAVEAREA(R15) skip savearea\n DC 17F'0' savearea\nSTM STM R14,R12,12(R13) prolog\n ST R13,4(R15) save previous SA\n ST R15,8(R13) linkage in previous SA\n LR R13,R15 establish addressability\n LA R5,1 n=1\n LH R8,NSIZE x=nsize\n SRA R8,1\n LA R8,1(R8) x=nsize/2+1\n LR R9,R8 y=x\n LR R1,R5 n\n BAL R14,ISPRIME\n C R0,=F'1' if isprime(n)\n BNE NPRMJ0\n BAL R14,SPIRALO spiral(x,y)=o\nNPRMJ0 LA R5,1(R5) n=n+1\n LA R6,1 i=1\nLOOPI1 LH R2,NSIZE do i=1 to nsize-1 by 2\n BCTR R2,0\n CR R6,R2 if i>nsize-1\n BH ELOOPI1\n LR R7,R6 j=i; do j=1 to i\nLOOPJ1 LA R8,1(R8) x=x+1\n LR R1,R5 n\n BAL R14,ISPRIME\n C R0,=F'1' if isprime(n)\n BNE NPRMJ1\n BAL R14,SPIRALO spiral(x,y)=o\nNPRMJ1 LA R5,1(R5) n=n+1\n BCT R7,LOOPJ1 next j\nELOOPJ1 LR R7,R6 j=i; do j=1 to i\nLOOPJ2 BCTR R9,0 y=y-1\n LR R1,R5 n\n BAL R14,ISPRIME\n C R0,=F'1' if isprime(n)\n BNE NPRMJ2\n BAL R14,SPIRALO spiral(x,y)=o\nNPRMJ2 LA R5,1(R5) n=n+1\n BCT R7,LOOPJ2 next j\nELOOPJ2 LR R7,R6 j=i\n LA R7,1(R7) j=i+1; do j=1 to i+1\nLOOPJ3 BCTR R8,0 x=x-1\n LR R1,R5 n\n BAL R14,ISPRIME\n C R0,=F'1' if isprime(n)\n BNE NPRMJ3\n BAL R14,SPIRALO spiral(x,y)=o\nNPRMJ3 LA R5,1(R5) n=n+1\n BCT R7,LOOPJ3 next j\nELOOPJ3 LR R7,R6 j=i\n LA R7,1(R7) j=i+1; do j=1 to i+1\nLOOPJ4 LA R9,1(R9) y=y+1\n LR R1,R5 n\n BAL R14,ISPRIME\n C R0,=F'1' if isprime(n)\n BNE NPRMJ4\n BAL R14,SPIRALO spiral(x,y)=o\nNPRMJ4 LA R5,1(R5) n=n+1\n BCT R7,LOOPJ4 next j\nELOOPJ4 LA R6,2(R6) i=i+2\n B LOOPI1\nELOOPI1 LH R7,NSIZE j=nsize\n BCTR R7,0 j=nsize-1; do j=1 to nsize-1\nLOOPJ5 LA R8,1(R8) x=x+1\n LR R1,R5 n\n BAL R14,ISPRIME\n C R0,=F'1' if isprime(n)\n BNE NPRMJ5\n BAL R14,SPIRALO spiral(x,y)=o\nNPRMJ5 LA R5,1(R5) n=n+1\n BCT R7,LOOPJ5 next j\nELOOPJ5 LA R6,1 i=1\nLOOPI2 CH R6,NSIZE do i=1 to nsize\n BH ELOOPI2\n LA R10,PG reset buffer\n LA R7,1 j=1\nLOOPJ6 CH R7,NSIZE do j=1 to nsize\n BH ELOOPJ6\n LR R1,R7 j\n BCTR R1,0 (j-1)\n MH R1,NSIZE (j-1)*nsize\n AR R1,R6 r1=(j-1)*nsize+i\n LA R14,SPIRAL-1(R1) @spiral(j,i)\n MVC 0(1,R10),0(R14) output spiral(j,i)\n LA R10,1(R10) pgi=pgi+1\n LA R7,1(R7) j=j+1\n B LOOPJ6\nELOOPJ6 XPRNT PG,80 print\n LA R6,1(R6) i=i+1\n B LOOPI2\nELOOPI2 L R13,4(0,R13) reset previous SA\n LM R14,R12,12(R13) restore previous env\n XR R15,R15 set return code\n BR R14 call back\nISPRIME CNOP 0,4 ---------- isprime function\n C R1,=F'2' if nn=2\n BNE NOT2\n LA R0,1 rr=1\n B ELOOPII\nNOT2 C R1,=F'2' if nn<2\n BL RRZERO\n LR R2,R1 nn\n LA R4,2 2\n SRDA R2,32 shift\n DR R2,R4 nn/2\n C R2,=F'0' if nn//2=0\n BNE TAGII\nRRZERO SR R0,R0 rr=0\n B ELOOPII\nTAGII LA R0,1 rr=1\n LA R4,3 ii=3\nLOOPII LR R3,R4 ii\n MR R2,R4 ii*ii\n CR R3,R1 if ii*ii<=nn\n BH ELOOPII\n LR R3,R1 nn\n LA R2,0 clear\n DR R2,R4 nn/ii\n LTR R2,R2 if nn//ii=0\n BNZ NEXTII\n SR R0,R0 rr=0\n B ELOOPII\nNEXTII LA R4,2(R4) ii=ii+2\n B LOOPII\nELOOPII BR R14 ---------- end isprime return rr\nSPIRALO CNOP 0,4 ---------- spiralo subroutine\n LR R1,R8 x\n BCTR R1,0 x-1\n MH R1,NSIZE (x-1)*nsize\n AR R1,R9 r1=(x-1)*nsize+y\n LA R10,SPIRAL-1(R1) r10=@spiral(x,y)\n MVC 0(1,R10),O spiral(x,y)=o\n BR R14 ---------- end spiralo\nNS EQU 79 4n+1\nNSIZE DC AL2(NS) =H'ns'\nO DC CL1'*' if prime\nPG DC CL80' ' buffer\n LTORG\nSPIRAL DC (NS*NS)CL1' '\n YREGS\n END ULAM\n","language":"360-Assembly"},{"code":"generic\n Size: Positive;\n -- determines the size of the square\n with function Represent(N: Natural) return String;\n -- this turns a number into a string to be printed\n -- the length of the output should not change\n -- e.g., Represent(N) may return \" #\" if N is a prime\n -- and \" \" else\n with procedure Put_String(S: String);\n -- outputs a string, no new line\n with procedure New_Line;\n -- the name says all\npackage Generic_Ulam is\n\n procedure Print_Spiral;\n -- calls Put_String(Represent(I)) N^2 times\n -- and New_Line N times\n\nend Generic_Ulam;\n","language":"Ada"},{"code":"package body Generic_Ulam is\n\n subtype Index is Natural range 0 .. Size-1;\n subtype Number is Positive range 1 .. Size**2;\n\n function Cell(Row, Column: Index) return Number is\n -- outputs the number at the given position in the square\n -- taken from the Python solution\n X: Integer := Column - (Size-1)/2;\n Y: Integer := Row - Size/2;\n MX: Natural := abs(X);\n MY: Natural := abs(Y);\n L: Natural := 2 * Natural'Max(MX, MY);\n D: Integer;\n begin\n if Y >= X then\n D := 3 * L + X + Y;\n else\n D := L - X - Y;\n end if;\n return (L-1) ** 2 + D;\n end Cell;\n\n procedure Print_Spiral is\n N: Number;\n begin\n for R in Index'Range loop\n for C in Index'Range loop\n N := Cell(R, C);\n Put_String(Represent(N));\n end loop;\n New_Line;\n end loop;\n end Print_Spiral;\n\nend Generic_Ulam;\n","language":"Ada"},{"code":"with Generic_Ulam, Ada.Text_IO, Prime_Numbers;\n\nprocedure Ulam is\n\n package P is new Prime_Numbers(Natural, 0, 1, 2);\n\n function Vis(N: Natural) return String is\n (if P.Is_Prime(N) then \" <>\" else \" \");\n\n function Num(N: Natural) return String is\n (if P.Is_Prime(N) then\n\t(if N < 10 then \" \" elsif N < 100 then \" \" else \"\") & Natural'Image(N)\n else \" ---\");\n\n procedure NL is\n begin\n Ada.Text_IO.New_Line;\n end NL;\n\n package Numeric is new Generic_Ulam(29, Num, Ada.Text_IO.Put, NL);\n package Visual is new Generic_Ulam(10, Vis, Ada.Text_IO.Put, NL);\n\nbegin\n Numeric.Print_Spiral;\n NL;\n Visual.Print_Spiral;\nend Ulam;\n","language":"Ada"},{"code":"BEGIN # construct a Ulam spiral for primes #\n PR read \"primes.incl.a68\" PR # include prime utilities #\n # prints a Ulam spiral for primes with the specified width, #\n # starting from init. Primes will be indicated by prime char and #\n # non-primes by composite char. The center of the spiral will be #\n # indicated by center char - unless the center value is prime #\n PROC print ulam spiral for primes = ( INT width, init, CHAR prime char, composite char, center char )VOID:\n IF width >= 1 THEN\n INT n = IF ODD width THEN width ELSE width + 1 FI;\n []BOOL prime = PRIMESIEVE ( init + ( n * n ) );\n [ 1 : n, 1 : n ]CHAR spiral; FOR i TO n DO FOR j TO n DO spiral[ i, j ] := \"_\" OD OD;\n INT y := ( n + 1 ) OVER 2;\n INT x := y;\n INT v := init;\n spiral[ x, y ] := IF prime[ init ] THEN prime char ELSE center char FI;\n INT w := 0;\n WHILE x < 1 UPB spiral DO\n w +:= 2;\n x +:= 1;\n y +:= 1;\n FOR i TO w DO # right edge #\n spiral[ x, y -:= 1 ] := IF prime[ v +:= 1 ] THEN prime char ELSE composite char FI\n OD;\n FOR i TO w DO # top edge #\n spiral[ x -:= 1, y ] := IF prime[ v +:= 1 ] THEN prime char ELSE composite char FI\n OD;\n FOR i TO w DO # left edge #\n spiral[ x, y +:= 1 ] := IF prime[ v +:= 1 ] THEN prime char ELSE composite char FI\n OD;\n FOR i TO w DO # bottom edge #\n spiral[ x +:= 1, y ] := IF prime[ v +:= 1 ] THEN prime char ELSE composite char FI\n OD\n OD;\n FOR v pos TO width DO\n FOR h pos TO width DO\n print( ( spiral[ h pos, v pos ] ) )\n OD;\n print( ( newline ) )\n OD\n FI # ulam spiral for primes # ;\n\n print ulam spiral for primes( 35, 1, \"#\", \" \", \"+\" )\nEND\n","language":"ALGOL-68"},{"code":"#include <stdio.h>\n#include <stdint.h>\n#include <stdlib.h>\n#include <math.h>\n\ntypedef uint32_t bitsieve;\n\nunsigned sieve_check(bitsieve *b, const unsigned v)\n{\n if ((v != 2 && !(v & 1)) || (v < 2))\n return 0;\n else\n return !(b[v >> 6] & (1 << (v >> 1 & 31)));\n}\n\nbitsieve* sieve(const unsigned v)\n{\n unsigned i, j;\n bitsieve *b = calloc((v >> 6) + 1, sizeof(uint32_t));\n\n for (i = 3; i <= sqrt(v); i += 2)\n if (!(b[i >> 6] & (1 << (i >> 1 & 31))))\n for (j = i*i; j < v; j += (i << 1))\n b[j >> 6] |= (1 << (j >> 1 & 31));\n\n return b;\n}\n\n#define max(x,y) ((x) > (y) ? (x) : (y))\n\n/* This mapping taken from python solution */\nint ulam_get_map(int x, int y, int n)\n{\n x -= (n - 1) / 2;\n y -= n / 2;\n\n int mx = abs(x), my = abs(y);\n int l = 2 * max(mx, my);\n int d = y >= x ? l * 3 + x + y : l - x - y;\n\n return pow(l - 1, 2) + d;\n}\n\n/* Passing a value of 0 as glyph will print numbers */\nvoid output_ulam_spiral(int n, const char glyph)\n{\n /* An even side length does not make sense, use greatest odd value < n */\n n -= n % 2 == 0 ? 1 : 0;\n\n const char *spaces = \".................\";\n int mwidth = log10(n * n) + 1;\n\n bitsieve *b = sieve(n * n + 1);\n int x, y;\n\n for (x = 0; x < n; ++x) {\n for (y = 0; y < n; ++y) {\n int z = ulam_get_map(y, x, n);\n\n if (glyph == 0) {\n if (sieve_check(b, z))\n printf(\"%*d \", mwidth, z);\n else\n printf(\"%.*s \", mwidth, spaces);\n }\n else {\n printf(\"%c\", sieve_check(b, z) ? glyph : spaces[0]);\n }\n }\n printf(\"\\n\");\n }\n\n free(b);\n}\n\nint main(int argc, char *argv[])\n{\n const int n = argc < 2 ? 9 : atoi(argv[1]);\n\n output_ulam_spiral(n, 0);\n printf(\"\\n\");\n\n output_ulam_spiral(n, '#');\n printf(\"\\n\");\n\n return 0;\n}\n","language":"C"},{"code":"#include <stdio.h>\n#include <stdlib.h>\n\nint isprime(int n)\n{\n\tint p;\n\tfor (p = 2; p*p <= n; p++)\n\t\tif (n%p == 0) return 0;\n\treturn n > 2;\n}\n\nint spiral(int w, int h, int x, int y)\n{\n\treturn y ? w + spiral(h - 1, w, y - 1, w - x - 1) : x;\n}\n\nint main(int c, char **v)\n{\n\tint i, j, w = 50, h = 50, s = 1;\n\tif (c > 1 && (w = atoi(v[1])) <= 0) w = 50;\n\tif (c > 2 && (h = atoi(v[2])) <= 0) h = w;\n\tif (c > 3 && (s = atoi(v[3])) <= 0) s = 1;\n\n\tfor (i = 0; i < h; i++) {\n\t\tfor (j = 0; j < w; j++)\n\t\t\tputchar(isprime(w*h + s - 1 - spiral(w, h, j, i))[\" #\"]);\n\t\tputchar('\\n');\n\t}\n\treturn 0;\n}\n","language":"C"},{"code":"#include <cmath>\n#include <iostream>\n#include <string>\n#include <iomanip>\n#include <vector>\n\nclass ulamSpiral {\npublic:\n void create( unsigned n, unsigned startWith = 1 ) {\n _lst.clear();\n if( !( n & 1 ) ) n++;\n _mx = n;\n unsigned v = n * n;\n _wd = static_cast<unsigned>( log10( static_cast<long double>( v ) ) ) + 1;\n for( unsigned u = 0; u < v; u++ )\n _lst.push_back( -1 );\n\n arrange( startWith );\n\n }\n void display( char c ) {\n if( !c ) displayNumbers();\n else displaySymbol( c );\n }\n\nprivate:\n bool isPrime( unsigned u ) {\n if( u < 4 ) return u > 1;\n if( !( u % 2 ) || !( u % 3 ) ) return false;\n\n unsigned q = static_cast<unsigned>( sqrt( static_cast<long double>( u ) ) ),\n c = 5;\n while( c <= q ) {\n if( !( u % c ) || !( u % ( c + 2 ) ) ) return false;\n c += 6;\n }\n return true;\n }\n void arrange( unsigned s ) {\n unsigned stp = 1, n = 1, posX = _mx >> 1,\n posY = posX, stC = 0;\n int dx = 1, dy = 0;\n\n while( posX < _mx && posY < _mx ) {\n _lst.at( posX + posY * _mx ) = isPrime( s ) ? s : 0;\n s++;\n\n if( dx ) {\n posX += dx;\n if( ++stC == stp ) {\n dy = -dx;\n dx = stC = 0;\n }\n } else {\n posY += dy;\n if( ++stC == stp ) {\n dx = dy;\n dy = stC = 0;\n stp++;\n }\n }\n }\n }\n void displayNumbers() {\n unsigned ct = 0;\n for( std::vector<unsigned>::iterator i = _lst.begin(); i != _lst.end(); i++ ) {\n if( *i ) std::cout << std::setw( _wd ) << *i << \" \";\n else std::cout << std::string( _wd, '*' ) << \" \";\n if( ++ct >= _mx ) {\n std::cout << \"\\n\";\n ct = 0;\n }\n }\n std::cout << \"\\n\\n\";\n }\n void displaySymbol( char c ) {\n unsigned ct = 0;\n for( std::vector<unsigned>::iterator i = _lst.begin(); i != _lst.end(); i++ ) {\n if( *i ) std::cout << c;\n else std::cout << \" \";\n if( ++ct >= _mx ) {\n std::cout << \"\\n\";\n ct = 0;\n }\n }\n std::cout << \"\\n\\n\";\n }\n\n std::vector<unsigned> _lst;\n unsigned _mx, _wd;\n};\n\nint main( int argc, char* argv[] )\n{\n ulamSpiral ulam;\n ulam.create( 9 );\n ulam.display( 0 );\n ulam.create( 35 );\n ulam.display( '#' );\n return 0;\n}\n","language":"C++"},{"code":"#pragma once\n\n#include <cmath>\n#include <sstream>\n#include <iomanip>\n\ninline bool is_prime(unsigned a) {\n if (a == 2) return true;\n if (a <= 1 || a % 2 == 0) return false;\n const unsigned max(std::sqrt(a));\n for (unsigned n = 3; n <= max; n += 2) if (a % n == 0) return false;\n return true;\n}\n\nenum direction { RIGHT, UP, LEFT, DOWN };\nconst char* N = \" ---\";\n\ntemplate<const unsigned SIZE>\nclass Ulam\n{\npublic:\n Ulam(unsigned start = 1, const char c = '\\0') {\n direction dir = RIGHT;\n unsigned y = SIZE / 2;\n unsigned x = SIZE % 2 == 0 ? y - 1 : y; // shift left for even n's\n for (unsigned j = start; j <= SIZE * SIZE - 1 + start; j++) {\n if (is_prime(j)) {\n std::ostringstream os(\"\");\n if (c == '\\0') os << std::setw(4) << j;\n else os << \" \" << c << ' ';\n s[y][x] = os.str();\n }\n else s[y][x] = N;\n\n switch (dir) {\n case RIGHT : if (x <= SIZE - 1 && s[y - 1][x].empty() && j > start) { dir = UP; }; break;\n case UP : if (s[y][x - 1].empty()) { dir = LEFT; }; break;\n case LEFT : if (x == 0 || s[y + 1][x].empty()) { dir = DOWN; }; break;\n case DOWN : if (s[y][x + 1].empty()) { dir = RIGHT; }; break;\n }\n\n switch (dir) {\n case RIGHT : x += 1; break;\n case UP : y -= 1; break;\n case LEFT : x -= 1; break;\n case DOWN : y += 1; break;\n }\n }\n }\n\n template<const unsigned S> friend std::ostream& operator <<(std::ostream&, const Ulam<S>&);\n\nprivate:\n std::string s[SIZE][SIZE];\n};\n\ntemplate<const unsigned SIZE>\nstd::ostream& operator <<(std::ostream& os, const Ulam<SIZE>& u) {\n for (unsigned i = 0; i < SIZE; i++) {\n os << '[';\n for (unsigned j = 0; j < SIZE; j++) os << u.s[i][j];\n os << ']' << std::endl;\n }\n return os;\n}\n","language":"C++"},{"code":"#include <cstdlib>\n#include <iostream>\n#include \"ulam.hpp\"\n\nint main(const int argc, const char* argv[]) {\n using namespace std;\n\n cout << Ulam<9>() << endl;\n const Ulam<9> v(1, '*');\n cout << v << endl;\n\n\treturn EXIT_SUCCESS;\n}\n","language":"C++"},{"code":"(defun ulam-spiral (n)\n (loop for a in (spiral n n (* n n)) do\n (format t \"~{~d~}~%\" a)))\n\n(defun spiral\n (n m b &aux (row (loop for a below n\n collect (if (primep (- b a))\n '* '#\\space))))\n (if (= m 1) (list row)\n (cons row (mapcar #'reverse\n (apply #'mapcar #'list\n (spiral (1- m) n\n (- b n)))))))\n(defun primep (n)\n (when (> n 1) (loop for a from 2 to (isqrt n)\n never (zerop (mod n a)))))\n","language":"Common-Lisp"},{"code":"enum Direction\n RIGHT\n UP\n LEFT\n DOWN\nend\n\ndef generate(n : Int32, i : Int32, c : Int32 | String)\n s = Array.new(n) { Array.new(n) { \"\" } }\n\n dir = Direction::RIGHT\n y = n // 2\n x = n % 2 == 0 ? y - 1 : y\n\n j = 1\n while j <= n * n - 1 + i\n s[y][x] = is_prime(j) ? j.to_s : c.to_s\n\n # printf \"j: %s, x: %s, y: %s \\n\", j, x, y\n\n case dir\n when Direction::RIGHT\n dir = Direction::UP if x <= n - 1 && s[y - 1][x] == \"\" && j > i\n when Direction::UP\n dir = Direction::LEFT if s[y][x - 1] == \"\"\n when Direction::LEFT\n dir = Direction::DOWN if x == 0 || s[y + 1][x] == \"\"\n when Direction::DOWN\n dir = Direction::RIGHT if s[y][x + 1] == \"\"\n end\n\n case dir\n when Direction::RIGHT\n x += 1\n when Direction::UP\n y -= 1\n when Direction::LEFT\n x -= 1\n when Direction::DOWN\n y += 1\n end\n\n j += 1\n end\n\n s.map(&.join(\"\\t\")).join(\"\\n\")\nend\n\ndef is_prime(n : Int32) : Bool\n return true if n == 2\n return false if n % 2 == 0 || n < 1\n\n i = 3\n while i <= Math.sqrt(n)\n return false if n % i == 0\n i += 2\n end\n\n true\nend\n\nputs generate 7, 1, \"*\"\n","language":"Crystal"},{"code":"import std.stdio, std.math, std.algorithm, std.array, std.range;\n\nint cell(in int n, int x, int y, in int start=1) pure nothrow @safe @nogc {\n x = x - (n - 1) / 2;\n y = y - n / 2;\n immutable l = 2 * max(x.abs, y.abs);\n immutable d = (y > x) ? (l * 3 + x + y) : (l - x - y);\n return (l - 1) ^^ 2 + d + start - 1;\n}\n\nvoid showSpiral(in int n, in string symbol=\"# \", in int start=1, string space=null) /*@safe*/ {\n if (space is null)\n space = \" \".replicate(symbol.length);\n\n immutable top = start + n ^^ 2 + 1;\n auto isPrime = [false, false, true] ~ [true, false].replicate(top / 2);\n foreach (immutable x; 3 .. 1 + cast(int)real(top).sqrt) {\n if (!isPrime[x])\n continue;\n foreach (immutable i; iota(x ^^ 2, top, x * 2))\n isPrime[i] = false;\n }\n\n string cellStr(in int x) pure nothrow @safe @nogc {\n return isPrime[x] ? symbol : space;\n }\n\n foreach (immutable y; 0 .. n)\n n.iota.map!(x => cell(n, x, y, start)).map!cellStr.joiner.writeln;\n}\n\nvoid main() {\n 35.showSpiral;\n}\n","language":"D"},{"code":"import std.stdio, std.math, std.algorithm, std.array, grayscale_image;\n\nuint cell(in uint n, int x, int y, in uint start=1) pure nothrow @safe @nogc {\n x = x - (n - 1) / 2;\n y = y - n / 2;\n immutable l = 2 * max(x.abs, y.abs);\n immutable d = (y > x) ? (l * 3 + x + y) : (l - x - y);\n return (l - 1) ^^ 2 + d + start - 1;\n}\n\nbool[] primes(in uint n, in uint top, in uint start=1) pure nothrow @safe {\n auto isPrime = [false, false, true] ~ [true, false].replicate(top / 2);\n\n foreach (immutable x; 3 .. 1 + cast(uint)real(top).sqrt)\n if (isPrime[x])\n for (uint i = x ^^ 2; i < top; i += x * 2)\n isPrime[i] = false;\n return isPrime;\n}\n\nvoid main() {\n enum n = 512;\n enum start = 1;\n immutable top = start + n ^^ 2 + 1;\n immutable isPrime = primes(n, top, start);\n auto img = new Image!Gray(n, n);\n\n foreach (immutable y; 0 .. n)\n foreach (immutable x; 0 .. n)\n img[x, y] = isPrime[cell(n, x, y, start)] ? Gray.black : Gray.white;\n\n img.savePGM(\"ulam_spiral.pgm\");\n}\n","language":"D"},{"code":"procedure DrawMatrixPrimes(Image: TImage; Mat: TMatrix);\n{Display spiral, only marking cells that contain prime numbers}\nvar X,Y: integer;\nvar S: string;\nvar Size,Step: integer;\nvar Off: TSize;\nvar R: TRect;\nbegin\n{Calculate size of grid}\nSize:=Min(Image.Width,Image.Height);\nStep:=Size div Length(Mat);\n{Draw border rectangle}\nImage.Canvas.Brush.Color:=clGreen;\nImage.Canvas.Pen.Width:=4;\nImage.Canvas.Rectangle(2,2,Length(Mat)*Step,Length(Mat)*Step);\n{Setup font}\nImage.Canvas.Font.Name:='Arial';\nImage.Canvas.Font.Style:=[fsBold];\nImage.Canvas.Font.Size:=14;\n{Draw grid}\nImage.Canvas.Pen.Width:=1;\n{Draw vertical lines}\nfor X:=0 to Length(Mat) do\n\tbegin\n\tImage.Canvas.MoveTo(X*Step,0);\n\tImage.Canvas.LineTo(X*Step,Step*Length(Mat));\n\tend;\n{Draw horizontal lines}\nfor Y:=0 to Length(Mat) do\n\tbegin\n\tImage.Canvas.MoveTo(0,Y*Step);\n\tImage.Canvas.LineTo(Step*Length(Mat),Y*Step);\n\tend;\n{Label cells that contain primes}\nfor Y:=0 to High(Mat[0]) do\n for X:=0 to High(Mat) do\n if IsPrime(trunc(Mat[X,Y])) then\n\tbegin\n\t{Color cells}\n\tR:=Rect((X*Step)+2,(Y*Step)+2,X*Step+Step,Y*Step+Step);\n\tInflateRect(R,-1,-1);\n\tImage.Canvas.Pen.Width:=4;\n\tImage.Canvas.Pen.Color:=clBlue;\n\tImage.Canvas.Brush.Color:=clLime;\n\tImage.Canvas.Rectangle(R);\n\t{Label cell}\n\tS:=Format('%0.0f',[Mat[X,Y]]);\n\tOff:=Image.Canvas.TextExtent(S);\n\tOff.CX:=(Step-Off.CX) div 2;\n\tOff.CY:=(Step-Off.CY) div 2;\n\tImage.Canvas.TextOut(X*Step+Off.CX,Y*Step+Off.CY,S);\n\tend;\nImage.Invalidate;\nend;\n\n\n\nprocedure MakeSqrSpiralMatrix(var Mat: TMatrix; MatSize: integer);\n{Create a spiral matrix of specified size}\nvar Inx: integer;\nvar R: TRect;\n\n\n\n\tprocedure DoTopRect(Off1,Off2: integer);\n\t{Do top part of rectangle}\n\tvar X,Y: integer;\n\tbegin\n\tfor X:=R.Left+Off1 to R.Right+Off2 do\n\t\tbegin\n\t\tMat[X,R.Top]:=Inx;\n\t\tDec(Inx);\n\t\tend;\n\tend;\n\n\tprocedure DoRightRect(Off1,Off2: integer);\n\t{Do Right part of rectangle}\n\tvar X,Y: integer;\n\tbegin\n\tfor Y:=R.Top+Off1 to R.Bottom+Off2 do\n\t\tbegin\n\t\tMat[R.Right,Y]:=Inx;\n\t\tDec(Inx);\n\t\tend;\n\tend;\n\n\n\tprocedure DoBottomRect(Off1,Off2: integer);\n\t{Do bottom part of rectangle}\n\tvar X,Y: integer;\n\tbegin\n\tfor X:= R.Right+Off1 downto R.Left+Off2 do\n\t\tbegin\n\t\tMat[X,R.Bottom]:=Inx;\n\t\tDec(Inx);\n\t\tend;\n\tend;\n\n\tprocedure DoLeftRect(Off1,Off2: integer);\n\t{Do left part of rectangle}\n\tvar X,Y: integer;\n\tbegin\n\tfor Y:=R.Bottom+Off1 downto R.Top+Off2 do\n\t\tbegin\n\t\tMat[R.Left,Y]:=Inx;\n\t\tDec(Inx);\n\t\tend;\n\tend;\n\n\n\tprocedure DoRect(R: TRect; var Inx: integer);\n\t{Create one rotation of spiral around the rectangle}\n\tbegin\n\t{The orientation of spiral is based in the size}\n\tif (MatSize and 1)=0 then\n\t\tbegin\n\t\t{Handle even sizes}\n\t\tDoTopRect(0,0);\n\t\tDoRightRect(1,0);\n\t\tDoBottomRect(-1,0);\n\t\tDoLeftRect(-1,1);\n\t\tend\n\telse\n\t\tbegin\n\t\t{Handle odd sizes}\n\t\tDoBottomRect(0,0);\n\t\tDoLeftRect(-1,0);\n\t\tDoTopRect(1,0);\n\t\tDoRightRect(1,-1);\n\t\tend\n\tend;\n\n\n\nbegin\n{Set matrix size}\nSetLength(Mat,MatSize,MatSize);\n{create matching rectangle}\nR:=Rect(0,0,MatSize-1,MatSize-1);\nInx:=MatSize*MatSize;\n{draw spiral around retangle and deflate rectanle until spiral is done}\nwhile (R.Left<=R.Right) and (R.Top<=R.Bottom) do\n\tbegin\n\tDoRect(R,Inx);\n\tInflateRect(R,-1,-1);\n\tend;\nend;\n\n\n\nprocedure UlamPrimeSpiral(Image: TImage);\nvar Mat: TMatrix;\nbegin\nMakeSqrSpiralMatrix(Mat,9);\nDrawMatrixPrimes(Image,Mat);\nend;\n","language":"Delphi"},{"code":"func isprim num .\n if num < 2\n return 0\n .\n i = 2\n while i <= sqrt num\n if num mod i = 0\n return 0\n .\n i += 1\n .\n return 1\n.\nn = 1\nx = 50\ny = 50\ndx = 1\ndy = 0\n#\nproc turn . .\n if dx = 1\n dx = 0\n dy = 1\n elif dy = 1\n dy = 0\n dx = -1\n elif dx = -1\n dx = 0\n dy = -1\n else\n dx = 1\n dy = 0\n .\n.\nproc step . .\n n += 1\n x += dx * 1\n y += dy * 1\n move x y\n if isprim n = 1\n circle 0.5\n .\n.\ntextsize 3\nmove x y\nlng = 0\n#\nfor k to 49\n step\n lng += 2\n turn\n for j to lng - 1\n step\n .\n for i to 3\n turn\n for j to lng\n step\n .\n .\n.\n","language":"EasyLang"},{"code":"(lib 'plot)\n\n(define *red* (rgb 1 0 0))\n(define (ulam n nmax) (if ( prime? n) *red* (gray (// n nmax))))\n(plot-spiral ulam 1000) ;; range [0...1000]\n","language":"EchoLisp"},{"code":"defmodule Ulam do\n defp cell(n, x, y, start) do\n y = y - div(n, 2)\n x = x - div(n - 1, 2)\n l = 2 * max(abs(x), abs(y))\n d = if y >= x, do: l*3 + x + y, else: l - x - y\n (l - 1)*(l - 1) + d + start - 1\n end\n\n def show_spiral(n, symbol\\\\nil, start\\\\1) do\n IO.puts \"\\nN : #{n}\"\n if symbol==nil, do: format = \"~#{length(to_char_list(start + n*n - 1))}s \"\n prime = prime(n*n + start)\n Enum.each(0..n-1, fn y ->\n Enum.each(0..n-1, fn x ->\n i = cell(n, x, y, start)\n if symbol do\n IO.write if i in prime, do: Enum.at(symbol,0), else: Enum.at(symbol,1)\n else\n :io.fwrite format, [if i in prime do to_char_list(i) else \"\" end]\n end\n end)\n IO.puts \"\"\n end)\n end\n\n defp prime(num), do: prime(Enum.to_list(2..num), [])\n defp prime([], p), do: Enum.reverse(p)\n defp prime([h|t], p), do: prime((for i <- t, rem(i,h)>0, do: i), [h|p])\nend\n\nUlam.show_spiral(9)\nUlam.show_spiral(25)\nUlam.show_spiral(25, [\"#\",\" \"])\n","language":"Elixir"},{"code":"PROGRAM SPIRAL\n\n!$INTEGER\n\nCONST RIGHT=1,UP=2,LEFT=3,DOWN=4\n\n!$DYNAMIC\nDIM SPIRAL$[0,0]\n\nPROCEDURE PRT_ULAM(N)\n FOR ROW=0 TO N DO\n FOR COL=0 TO N DO\n PRINT(SPIRAL$[ROW,COL];)\n END FOR\n PRINT\n END FOR\n PRINT\n GET(K$)\n FOR ROW=0 TO N DO\n FOR COL=0 TO N DO\n IF VAL(SPIRAL$[ROW,COL])<>0 THEN PRINT(\" * \";) ELSE PRINT(SPIRAL$[ROW,COL];) END IF\n END FOR\n PRINT\n END FOR\nEND PROCEDURE\n\nPROCEDURE IS_PRIME(A->RES%)\n LOCAL N\n IF A=2 THEN RES%=TRUE EXIT PROCEDURE END IF\n IF A<=1 OR (A MOD 2=0) THEN RES%=FALSE EXIT PROCEDURE END IF\n MAX=SQR(A)\n FOR N=3 TO MAX STEP 2 DO\n IF (A MOD N=0) THEN RES%=FALSE EXIT PROCEDURE END IF\n END FOR\n RES%=TRUE\nEND PROCEDURE\n\nPROCEDURE GEN_ULAM(N,I)\n DIR=RIGHT\n J=I\n Y=INT(N/2)\n IF (N MOD 2=0) THEN X=Y-1 ELSE X=Y END IF ! shift left for even n's\n WHILE J<=(N*N)-1+I DO\n\n IS_PRIME(J->RES%)\n IF RES% THEN SPIRAL$[Y,X]=RIGHT$(\" \"+STR$(J),4) ELSE SPIRAL$[Y,X]=\" ---\" END IF\n\n CASE DIR OF\n RIGHT->\n IF (X<=(N-1) AND SPIRAL$[Y-1,X]=\"\" AND J>I) THEN DIR=UP END IF\n END ->\n UP->\n IF SPIRAL$[Y,X-1]=\"\" THEN DIR=LEFT END IF\n END ->\n LEFT->\n IF (X=0) OR SPIRAL$[Y+1,X]=\"\" THEN DIR=DOWN END IF\n END ->\n DOWN->\n IF SPIRAL$[Y,X+1]=\"\" THEN DIR=RIGHT END IF\n END ->\n END CASE\n\n CASE DIR OF\n RIGHT-> X=X+1 END ->\n UP-> Y=Y-1 END ->\n LEFT-> X=X-1 END ->\n DOWN-> Y=Y+1 END ->\n END CASE\n J=J+1\n END WHILE\n PRT_ULAM(N)\nEND PROCEDURE\n\nBEGIN\n N=9\n !$DIM SPIRAL$[N,N]\n GEN_ULAM(N,1)\nEND PROGRAM\n","language":"ERRE"},{"code":"USING: arrays grouping kernel math math.combinatorics\nmath.matrices math.primes math.ranges math.statistics\nprettyprint sequences sequences.repeating ;\nIN: rosetta-code.ulam-spiral\n\n: counts ( n -- seq ) 1 [a,b] 2 repeat rest ;\n\n: vals ( n -- seq )\n [ -1 swap neg 2dup [ neg ] bi@ 4array ] [ 2 * 1 - cycle ] bi ;\n\n: evJKT2 ( n -- seq )\n [ counts ] [ vals ] bi [ <array> ] 2map concat ;\n\n: spiral ( n -- matrix )\n [ evJKT2 cum-sum inverse-permutation ] [ group ] bi ;\n\n: ulam-spiral ( n -- matrix )\n spiral dup dim first sq 1 -\n [ swap - 1 + prime? \"o \" \" \" ? ] curry matrix-map ;\n\n: ulam-demo ( -- ) 21 ulam-spiral simple-table. ;\n\nMAIN: ulam-demo\n","language":"Factor"},{"code":" 43 constant border \\ grid size is border x border\n border border * constant size\n\n variable crawler \\ position of the crawler\n\n : set.crawler border 2 mod 0= if \\ positions the crawler in the middle of the grid\n\t size 2 / border 2/ + 1 - crawler !\n\t else\n\t size 2 / crawler ! then ;\n\t\n set.crawler\n create Grid size cells allot \\ creates the grid\n here constant GridEnd \\ used for debugging\n\n : is.divisor\n\tover 2over\n\tmod 0= swap drop + ;\n\n : sub.one\n\t swap 1 - swap ;\n\n : next.div\n\t is.divisor sub.one ;\n\n : three.test \\ counts divisors for numbers bigger than 2\n\t dup 0\n begin\n\t next.div\n over 1 = until\n\t swap drop\n\t swap drop 1 + ;\n\t\n : not.prime \\ counts the number of divisors. Primes have exactly two.\n dup\n 2 < if drop true else\n\tthree.test then ;\n\n : sub.four \\ the crawler takes a number from the stack as direction\n\t dup 4 > if 4 - then ; \\ this word makes the number roll over.\n \\ 1-right 2-up 3-left 4-down\n : craw.left \\ rotates the crawler 90 degrees counter-clockwise\n\t 1 + sub.four ;\n\n : scan.right\n\t grid crawler @ 1 + cells + @ 0= ; \\ checks if cell to the right of the crawler is zero\n\n : scan.left\n\t grid crawler @ 1 - cells + @ 0= ; \\ cell to the left\n\n : scan.up\n\t grid crawler @ border - cells + @ 0= ; \\ cell above\n\n : scan.down\n\t grid crawler @ border + cells + @ 0= ; \\ and cell below\n\n : crawler.go \\ moves crawler one cell ahead checks cell to the left...\n\t dup \\ ...of the direction the crawler is facing, if zero, turns\n\t 1 = if crawler @ 1 + crawler ! scan.up if craw.left then else\n\t dup\n\t 2 = if crawler @ border - crawler ! scan.left if craw.left then else\n\t dup\n\t 3 = if crawler @ 1 - crawler ! scan.down if craw.left then else\n\t dup\n\t 4 = if crawler @ border + crawler ! scan.right if craw.left then else\n\t\n\t then then then then ;\n\t\n : run.crawler \\ crawler moves through the grid and fills it with numbers\n\t border 2 < if 1 grid 0 cells + ! else \\ if the grid is a single cell, puts 1 in it\n\t crawler @ border - crawler !\t \\ crawler moves one step and turn before setting the first...\n\t 4 \\ ...number so it is repositioned one cell up facing down\n \t size -1 * 0 do i\n\t i -1 * grid crawler @ cells + ! drop\n\t crawler.go\n\t -1 +loop then drop ;\n\n : leave.primes \\ removes non-primes from the grid\n\t size 0 do i\n\t grid i cells + @ not.prime if 0 grid i cells + ! then drop\n\t loop ;\n\n : star.draw1 \\ draws a \"*\" where number is not zero\n\t 0> if 42 emit else 32 emit\n\t then ;\n\n : star.draw2\n\t 0> if 42 emit 32 emit else 32 emit 32 emit \\ same but adds a space for better presentation\n\t then ;\n\n : star.draw3\n\t 0> if 32 emit 42 emit 32 emit else 32 emit 32 emit 32 emit \\ adds two spaces\n\t then ;\n\n : draw.grid \\ cuts the array into lines and displays it\n\tpage\n\tsize 0 do i\n\ti border mod 0= if cr then\n\tgrid i cells + @ star.draw2 drop \\ may use star.draw1 or 3 here\n\tloop ;\n\t\n : ulam.spiral run.crawler leave.primes draw.grid ; \\ draws the spiral. Execute this word to run.\n","language":"Forth"},{"code":"program ulam\n implicit none\n\n integer, parameter :: nsize = 49\n integer :: i, j, n, x, y\n integer :: a(nsize*nsize) = (/ (i, i = 1, nsize*nsize) /)\n character(1) :: spiral(nsize, nsize) = \" \"\n character(2) :: sstr\n character(10) :: fmt\n\n n = 1\n x = nsize / 2 + 1\n y = x\n if(isprime(a(n))) spiral(x, y) = \"O\"\n n = n + 1\n\n do i = 1, nsize-1, 2\n do j = 1, i\n x = x + 1\n if(isprime(a(n))) spiral(x, y) = \"O\"\n n = n + 1\n end do\n\n do j = 1, i\n y = y - 1\n if(isprime(a(n))) spiral(x, y) = \"O\"\n n = n + 1\n end do\n\n do j = 1, i+1\n x = x - 1\n if(isprime(a(n))) spiral(x, y) = \"O\"\n n = n + 1\n end do\n\n do j = 1, i+1\n y = y + 1\n if(isprime(a(n))) spiral(x, y) = \"O\"\n n = n + 1\n end do\n end do\n\n do j = 1, nsize-1\n x = x + 1\n if(isprime(a(n))) spiral(x, y) = \"O\"\n n = n + 1\n end do\n\n write(sstr, \"(i0)\") nsize\n fmt = \"(\" // sstr // \"(a,1x))\"\n do i = 1, nsize\n write(*, fmt) spiral(:, i)\n end do\n\ncontains\n\nfunction isprime(number)\n logical :: isprime\n integer, intent(in) :: number\n integer :: i\n\n if(number == 2) then\n isprime = .true.\n else if(number < 2 .or. mod(number,2) == 0) then\n isprime = .false.\n else\n isprime = .true.\n do i = 3, int(sqrt(real(number))), 2\n if(mod(number,i) == 0) then\n isprime = .false.\n exit\n end if\n end do\n end if\nend function\nend program\n","language":"Fortran"},{"code":" SUBROUTINE ULAMSPIRAL(START,ORDER)\t!Idle scribbles can lead to new ideas.\nCareful with phasing: each lunge's first number is the second placed along its direction.\n INTEGER START\t!Usually 1.\n INTEGER ORDER\t!MUST be an odd number, so there is a middle.\n INTEGER L,M,N\t!Counters.\n INTEGER STEP,LUNGE\t!In some direction.\n COMPLEX WAY,PLACE\t!Just so.\n CHARACTER*1 SPLOT(0:1)\t!Tricks for output.\n PARAMETER (SPLOT = (/\" \",\"*\"/))\t!Selected according to ISPRIME(n)\n INTEGER TILE(ORDER,ORDER)\t!Work area.\n WRITE (6,1) START,ORDER\t!Here we go.\n 1 FORMAT (\"Ulam spiral starting with \",I0,\", of order \",I0,/)\n IF (MOD(ORDER,2) .NE. 1) STOP \"The order must be odd!\"\t!Otherwise, out of bounds.\n M = ORDER/2 + 1\t\t!Find the number of the middle.\n PLACE = CMPLX(M,M)\t!Start there.\n WAY = (1,0)\t\t!Thence in the +x direction.\n N = START\t\t!Different start, different layout.\n DO L = 1,ORDER\t\t!Advance one step, then two, then three, etc.\n DO LUNGE = 1,2\t\t!But two lunges for each length.\n DO STEP = 1,L\t\t\t!Take the steps.\n TILE(INT(REAL(PLACE)),INT(AIMAG(PLACE))) = N\t!This number for this square.\n PLACE = PLACE + WAY\t\t!Make another step.\n N = N + 1\t\t\t\t!Count another step.\n END DO\t\t\t\t!And consider making another.\n IF (N .GE. ORDER**2) EXIT\t!Otherwise, one lunge too many!\n WAY = WAY*(0,1)\t\t!Rotate a quarter-turn counter-clockwise.\n END DO\t\t\t!And make another lunge.\n END DO\t\t\t!Until finished.\nCast forth the numbers.\nc DO L = ORDER,1,-1\t!From the top of the grid to the bottom.\nc WRITE (6,66) TILE(1:ORDER,L)\t!One row at at time.\nc 66 FORMAT (666I6)\t!This will do for reassurance.\nc END DO\t\t\t!Line by line.\nCast forth the splots.\n DO L = ORDER,1,-1\t!Just put out a marker.\n WRITE (6,67) (SPLOT(ISPRIME(TILE(M,L))),M = 1,ORDER)\t!One line at a time.\n 67 FORMAT (666A1)\t!A single character at each position.\n END DO\t\t\t!On to the next row.\n END SUBROUTINE ULAMSPIRAL\t!So much for a boring lecture.\n\n INTEGER FUNCTION ISPRIME(N)\t!Returns 0 or 1.\n INTEGER N\t!The number.\n INTEGER F,Q\t!Factor and quotient.\n ISPRIME = 0\t\t!The more likely outcome.\n IF (N.LE.1) RETURN\t!Just in case the start is peculiar.\n IF (N.LE.3) GO TO 2\t!Oops! I forgot this!\n IF (MOD(N,2).EQ.0) RETURN\t!Special case.\n F = 1\t\t\t!Now get stuck in to testing odd numbers.\n 1 F = F + 2\t\t!A trial factor.\n Q = N/F\t\t\t!The quotient.\n IF (N .EQ. Q*F) RETURN\t!No remainder? Not a prime.\n IF (Q.GT.F) GO TO 1\t!Thus chug up to the square root.\n 2 ISPRIME = 1\t\t!Well!\n END FUNCTION ISPRIME\t!Simple enough.\n\n PROGRAM TWIRL\n CALL ULAMSPIRAL(1,49)\n END\n","language":"Fortran"},{"code":"#define SIZE 639\n\nscreenres SIZE, SIZE, 4\n\nfunction is_prime( n as ulongint ) as boolean\n if n < 2 then return false\n if n = 2 then return true\n if n mod 2 = 0 then return false\n for i as uinteger = 3 to int(sqr(n))+1 step 2\n if n mod i = 0 then return false\n next i\n return true\nend function\n\nfunction is_turn( byval n as unsigned integer ) as boolean\n n -= 1\n if int(sqr(n))^2 = n then return true\n n = n - int(sqr(n))\n if int(sqr(n))^2 = n then return true\n return false\nend function\n\ndim as integer n = 1, x=SIZE/2, y=SIZE/2, dx = 1, dy = 0\n\ndo\n if is_prime(n) then pset (x, y), 15\n x = x + dx\n y = y + dy\n if x >= SIZE orelse y >= SIZE orelse x < 0 orelse y < 0 then exit do\n n = n + 1\n if is_turn(n) then\n dx = -dx\n swap dx, dy\n end if\nloop\n\nsleep\nend\n","language":"FreeBASIC"},{"code":"package main\n\nimport (\n\t\"math\"\n\t\"fmt\"\n)\n\ntype Direction byte\n\nconst (\n\tRIGHT Direction = iota\n\tUP\n\tLEFT\n\tDOWN\n)\n\nfunc generate(n,i int, c byte) {\n\ts := make([][]string, n)\n\tfor i := 0; i < n; i++ { s[i] = make([]string, n) }\n\tdir := RIGHT\n\ty := n / 2\n\tvar x int\n\tif (n % 2 == 0) { x = y - 1 } else { x = y } // shift left for even n's\n\n\tfor j := i; j <= n * n - 1 + i; j++ {\n\t\tif (isPrime(j)) {\n\t\t\tif (c == 0) { s[y][x] = fmt.Sprintf(\"%3d\", j) } else { s[y][x] = fmt.Sprintf(\"%2c \", c) }\n\t\t} else { s[y][x] = \"---\" }\n\n\t\tswitch dir {\n\t\tcase RIGHT : if (x <= n - 1 && s[y - 1][x] == \"\" && j > i) { dir = UP }\n\t\tcase UP : if (s[y][x - 1] == \"\") { dir = LEFT }\n\t\tcase LEFT : if (x == 0 || s[y + 1][x] == \"\") { dir = DOWN }\n\t\tcase DOWN : if (s[y][x + 1] == \"\") { dir = RIGHT }\n\t\t}\n\n\t\tswitch dir {\n\t\tcase RIGHT : x += 1\n\t\tcase UP : y -= 1\n\t\tcase LEFT : x -= 1\n\t\tcase DOWN : y += 1\n\t\t}\n\t}\n\n\tfor _, row := range s { fmt.Println(fmt.Sprintf(\"%v\", row)) }\n\tfmt.Println()\n}\n\nfunc isPrime(a int) bool {\n\tif (a == 2) { return true }\n\tif (a <= 1 || a % 2 == 0) { return false }\n\tmax := int(math.Sqrt(float64(a)))\n\tfor n := 3; n <= max; n += 2 { if (a % n == 0) { return false } }\n\treturn true\n}\n\nfunc main() {\n\tgenerate(9, 1, 0) // with digits\n\tgenerate(9, 1, '*') // with *\n}\n","language":"Go"},{"code":"import Data.List\nimport Data.Numbers.Primes\n\nulam n representation = swirl n . map representation\n","language":"Haskell"},{"code":"swirl n = spool . take (2*(n-1)+1) . chop 1\n\nchop n lst = let (x,(y,z)) = splitAt n <$> splitAt n lst\n in x:y:chop (n+1) z\n\nspool = foldl (\\table piece -> piece : rotate table) [[]]\n where rotate = reverse . transpose\n","language":"Haskell"},{"code":"showTable w = foldMap (putStrLn . foldMap pad)\n where pad s = take w $ s ++ repeat ' '\n","language":"Haskell"},{"code":"import Diagrams.Prelude\nimport Diagrams.Backend.SVG.CmdLine\n\ndrawTable tbl = foldl1 (===) $ map (foldl1 (|||)) tbl :: Diagram B\n\ndots x = (circle 1 # if isPrime x then fc black else fc white) :: Diagram B\n\nmain = mainWith $ drawTable $ ulam 100 dots [1..]\n","language":"Haskell"},{"code":"spiral =: ,~ $ [: /: }.@(2 # >:@i.@-) +/\\@# <:@+: $ (, -)@(1&,)\n","language":"J"},{"code":" spiral 5\n 0 1 2 3 4\n15 16 17 18 5\n14 23 24 19 6\n13 22 21 20 7\n12 11 10 9 8\n (*: - spiral) 5\n25 24 23 22 21\n10 9 8 7 20\n11 2 1 6 19\n12 3 4 5 18\n13 14 15 16 17\n","language":"J"},{"code":" (1 p: *: - spiral) 5\n0 0 1 0 0\n0 0 0 1 0\n1 1 0 0 1\n0 1 0 1 0\n1 0 0 0 1\n","language":"J"},{"code":" (' o' {~ 1 p: *: - spiral) 5\n o\n o\noo o\n o o\no o\n","language":"J"},{"code":" (0: :(<:@[)) ''\n0\n 3 (0: :(<:@[)) ''\n2\n","language":"J"},{"code":"ulam=: 1j1 #\"1 ' o' {~ 1 p: 0: :(<:@[) + *:@] - spiral@]\n","language":"J"},{"code":" ulam 16\n o o\no o o\n o o o\no o o o\n o o o\n o o o o o\n o o o o\n o o o\n o o o o o o o\n o o o\n o o\n o o o o o\n o o o\n o\n o o o o\no o\n 9 ulam 12\n o o\no o o o\n o o o o\n o o o\n o o\no o o o o\n o o\n o\n o o o o\n o\n o o o\n","language":"J"},{"code":"import java.util.Arrays;\n\npublic class Ulam{\n\tenum Direction{\n\t\tRIGHT, UP, LEFT, DOWN;\n\t}\n\t\n\tprivate static String[][] genUlam(int n){\n\t\treturn genUlam(n, 1);\n\t}\n\n\tprivate static String[][] genUlam(int n, int i){\n\t\tString[][] spiral = new String[n][n];\n\t\tDirection dir = Direction.RIGHT;\n\t\tint j = i;\n\t\tint y = n / 2;\n\t\tint x = (n % 2 == 0) ? y - 1 : y; //shift left for even n's\n\t\twhile(j <= ((n * n) - 1 + i)){\n\t\t\tspiral[y][x] = isPrime(j) ? String.format(\"%4d\", j) : \" ---\";\n\n\t\t\tswitch(dir){\n\t\t\tcase RIGHT:\n\t\t\t\tif(x <= (n - 1) && spiral[y - 1][x] == null && j > i) dir = Direction.UP; break;\n\t\t\tcase UP:\n\t\t\t\tif(spiral[y][x - 1] == null) dir = Direction.LEFT; break;\n\t\t\tcase LEFT:\n\t\t\t\tif(x == 0 || spiral[y + 1][x] == null) dir = Direction.DOWN; break;\n\t\t\tcase DOWN:\n\t\t\t\tif(spiral[y][x + 1] == null) dir = Direction.RIGHT; break;\n\t\t\t}\n\t\t\t\n\t\t\tswitch(dir){\n\t\t\t\tcase RIGHT:\tx++; break;\n\t\t\t\tcase UP: \ty--; break;\n\t\t\t\tcase LEFT:\tx--; break;\n\t\t\t\tcase DOWN:\ty++; break;\n\t\t\t}\n\t\t\tj++;\n\t\t}\n\t\treturn spiral;\n\t}\n\t\n\tpublic static boolean isPrime(int a){\n\t\t if(a == 2) return true;\n\t\t if(a <= 1 || a % 2 == 0) return false;\n\t\t long max = (long)Math.sqrt(a);\n\t\t for(long n = 3; n <= max; n += 2){\n\t\t if(a % n == 0) return false;\n\t\t }\n\t\t return true;\n\t\t}\n\t\n\tpublic static void main(String[] args){\n\t\tString[][] ulam = genUlam(9);\n\t\tfor(String[] row : ulam){\n\t\t\tSystem.out.println(Arrays.toString(row).replaceAll(\",\", \"\"));\n\t\t}\n\t\tSystem.out.println();\n\t\t\n\t\tfor(String[] row : ulam){\n\t\t\tSystem.out.println(Arrays.toString(row).replaceAll(\"\\\\[\\\\s+\\\\d+\", \"[ * \").replaceAll(\"\\\\s+\\\\d+\", \" * \").replaceAll(\",\", \"\"));\n\t\t}\n\t}\n}\n","language":"Java"},{"code":"import java.awt.*;\nimport javax.swing.*;\n\npublic class LargeUlamSpiral extends JPanel {\n\n public LargeUlamSpiral() {\n setPreferredSize(new Dimension(605, 605));\n setBackground(Color.white);\n }\n\n private boolean isPrime(int n) {\n if (n <= 2 || n % 2 == 0)\n return n == 2;\n for (int i = 3; i * i <= n; i += 2)\n if (n % i == 0)\n return false;\n return true;\n }\n\n @Override\n public void paintComponent(Graphics gg) {\n super.paintComponent(gg);\n Graphics2D g = (Graphics2D) gg;\n g.setRenderingHint(RenderingHints.KEY_ANTIALIASING,\n RenderingHints.VALUE_ANTIALIAS_ON);\n\n g.setColor(getForeground());\n\n double angle = 0.0;\n int x = 300, y = 300, dx = 1, dy = 0;\n\n for (int i = 1, step = 1, turn = 1; i < 40_000; i++) {\n\n if (isPrime(i))\n g.fillRect(x, y, 2, 2);\n\n x += dx * 3;\n y += dy * 3;\n\n if (i == turn) {\n\n angle += 90.0;\n\n if ((dx == 0 && dy == -1) || (dx == 0 && dy == 1))\n step++;\n\n turn += step;\n\n dx = (int) Math.cos(Math.toRadians(angle));\n dy = (int) Math.sin(Math.toRadians(-angle));\n }\n }\n }\n\n public static void main(String[] args) {\n SwingUtilities.invokeLater(() -> {\n JFrame f = new JFrame();\n f.setDefaultCloseOperation(JFrame.EXIT_ON_CLOSE);\n f.setTitle(\"Large Ulam Spiral\");\n f.setResizable(false);\n f.add(new LargeUlamSpiral(), BorderLayout.CENTER);\n f.pack();\n f.setLocationRelativeTo(null);\n f.setVisible(true);\n });\n }\n}\n","language":"Java"},{"code":"import java.awt.*;\nimport javax.swing.*;\n\npublic class UlamSpiral extends JPanel {\n\n Font primeFont = new Font(\"Arial\", Font.BOLD, 20);\n Font compositeFont = new Font(\"Arial\", Font.PLAIN, 16);\n\n public UlamSpiral() {\n setPreferredSize(new Dimension(640, 640));\n setBackground(Color.white);\n }\n\n private boolean isPrime(int n) {\n if (n <= 2 || n % 2 == 0)\n return n == 2;\n for (int i = 3; i * i <= n; i += 2)\n if (n % i == 0)\n return false;\n return true;\n }\n\n @Override\n public void paintComponent(Graphics gg) {\n super.paintComponent(gg);\n Graphics2D g = (Graphics2D) gg;\n g.setRenderingHint(RenderingHints.KEY_ANTIALIASING,\n RenderingHints.VALUE_ANTIALIAS_ON);\n\n g.setStroke(new BasicStroke(2));\n\n double angle = 0.0;\n int x = 280, y = 330, dx = 1, dy = 0;\n\n g.setColor(getForeground());\n g.drawLine(x, y - 5, x + 50, y - 5);\n\n for (int i = 1, step = 1, turn = 1; i < 100; i++) {\n\n g.setColor(getBackground());\n g.fillRect(x - 5, y - 20, 30, 30);\n g.setColor(getForeground());\n g.setFont(isPrime(i) ? primeFont : compositeFont);\n g.drawString(String.valueOf(i), x + (i < 10 ? 4 : 0), y);\n\n x += dx * 50;\n y += dy * 50;\n\n if (i == turn) {\n angle += 90.0;\n\n if ((dx == 0 && dy == -1) || (dx == 0 && dy == 1))\n step++;\n\n turn += step;\n\n dx = (int) Math.cos(Math.toRadians(angle));\n dy = (int) Math.sin(Math.toRadians(-angle));\n\n g.translate(9, -5);\n g.drawLine(x, y, x + dx * step * 50, y + dy * step * 50);\n g.translate(-9, 5);\n }\n }\n }\n\n public static void main(String[] args) {\n SwingUtilities.invokeLater(() -> {\n JFrame f = new JFrame();\n f.setDefaultCloseOperation(JFrame.EXIT_ON_CLOSE);\n f.setTitle(\"Ulam Spiral\");\n f.setResizable(false);\n f.add(new UlamSpiral(), BorderLayout.CENTER);\n f.pack();\n f.setLocationRelativeTo(null);\n f.setVisible(true);\n });\n }\n}\n","language":"Java"},{"code":"<!-- UlamSpiral.html -->\n<html>\n<head><title>Ulam Spiral</title>\n <script src=\"VOE.js\"></script>\n<script>\n// http://rosettacode.org/wiki/User:AnatolV/Helper_Functions\n// Use v.2.0\nvar pst;\n\n// ***** Additional helper functions\n// Pad number from left\nfunction padLeft(n,ns) {\n return (\" \" + n).slice(-ns);\n}\n\n// Is number n a prime?\nfunction isPrime(n) {\n var n2=Math.sqrt(n);\n for(var i=2; i<=n2; i++) {\n if(n%i === 0) return false;\n }//fend i\n return n !== 1;\n}\n\nfunction insm(mat,x,y) {\n var xz=mat[0].length, yz=xz;\n return(x>=0 && x<xz && y>=0 && y<yz)\n}\n// *****\n\nfunction rbCheck() {\n if (document.getElementById('rbDef').checked) {pst=0}\n if (document.getElementById('rbAst').checked) {pst=1}\n if (document.getElementById('rbNum').checked) {pst=2}\n}\nfunction rbSet() {\n document.getElementById(\"rbDef\").checked = true;\n rbCheck();\n}\n\n// The Ulam Spiral\nfunction pspUlam() {\n var i, j, x, y, xmx, ymx, cnt, dir, M, Mij, sp=\" \", sc=3;\n // Setting basic vars for canvas and matrix\n var cvs = document.getElementById('cvsId');\n var ctx = cvs.getContext(\"2d\");\n if(pst<0||pst>2) {pst=0}\n if(pst==0) {n=100; sc=3} else {n=10; sc=5}\n console.log(\"sc\", typeof(sc));\n if(n%2==0) {n++};\n var n2=n*n, pch, sz=n2.toString().length, pch2=sp.repeat(sz);\n var fgc=\"navy\", bgc=\"white\";\n // Create matrix, finding number of rows and columns\n var M=new Array(n);\n for (i=0; i<n; i++) { M[i]=new Array(n);\n for (j=0; j<n; j++) {M[i][j]=0} }\n var r = M[0].length, c = M.length, k=0, dsz=1;\n // Logging init parameters\n var ttl=\"Matrix (\"+r+\",\"+c+\")\";\n console.log(\" *** Ulam spiral: \",n,\"x\",n,\"p-flag=\",pst, \"sc\", sc);\n // Generating and plotting Ulam spiral\n x=y=Math.floor(n/2)+1; xmx=ymx=cnt=1; dir=\"R\";\n for(var i=1; i<=n2; i++) { //\n if(isPrime(i)) // if prime\n { if(!insm(M,x,y)) {break};\n if(pst==2) {M[y][x]=i} else {M[y][x]=1};\n }\n // all numbers\n if(dir==\"R\") {if(xmx>0){x++;xmx--} else {dir=\"U\";ymx=cnt;y--;ymx--} continue};\n if(dir==\"U\") {if(ymx>0){y--;ymx--} else {dir=\"L\";cnt++;xmx=cnt;x--;xmx--} continue};\n if(dir==\"L\") {if(xmx>0){x--;xmx--} else {dir=\"D\";ymx=cnt;y++;ymx--} continue};\n if(dir==\"D\") {if(ymx>0){y++;ymx--} else {dir=\"R\";cnt++;xmx=cnt;x++;xmx--}; continue};\n }//fend i\n //Plot/Print according to the p-flag(0-real plot,1-\"*\",2-primes)\n if(pst==0) {pmat01(M, fgc, bgc, sc, 0); return};\n var logs;\n if(pst==1) {for(i=1;i<n;i++) {logs=\"|\";\n for(j=1;j<n;j++) { Mij=M[i][j]; if(Mij>0) {pch=\"*\"} else {pch=\" \"};\n logs+=\" \"+pch;}\n logs+=\"|\"; console.log(logs);}//fiend\n pmat01(M, fgc, bgc, sc, 0); console.log(\"sc\", sc);\n return;\n }//ifend\n //console.log(\" \",pch);} console.log(\" \")}; return};\n if(pst==2) {for(i=1;i<n;i++) {logs=\"|\";\n for(j=1;j<n;j++) {Mij=M[i][j];\n if(Mij==0) {pch=pch2}\n else {pch=padLeft(Mij,sz)};\n logs+=pch; } //\" \"+\n logs+=\" |\"; console.log(logs);}//fiend\n pmat01(M, fgc, bgc, sc, 0); console.log(\"sc\", sc);\n\t\t\t return;\n\t\t\t }//ifend\n\n}//func end\n// ******************************************\n</script></head>\n<body onload='rbSet();' style=\"font-family: arial, helvatica, sans-serif;\">\n <b>Plot/print style:</b>\n <input type=\"radio\" onclick=\"rbCheck();\" name=\"rb\" id=\"rbDef\"/><b>Plot</b> \n <input type=\"radio\" onclick=\"rbCheck();\" name=\"rb\" id=\"rbAst\"/><b>Print *</b> \n <input type=\"radio\" onclick=\"rbCheck();\" name=\"rb\" id=\"rbNum\"/><b>Print numbers</b> \n <input type=\"button\" value=\"Plot it!\" onclick=\"pspUlam();\">\n <h3>Ulam Spiral</h3>\n <canvas id=\"cvsId\" width=\"300\" height=\"300\" style=\"border: 2px inset;\"></canvas>\n</body>\n</html>\n","language":"JavaScript"},{"code":"def array($init): [range(0; .) | $init];\n\n# Test if input is a one-character string holding a digit\ndef isDigit:\n type==\"string\" and length==1 and explode[0] as $c | (48 <= $c and $c <= 57);\n\ndef lpad($len): tostring | ($len - length) as $l | (\" \" * $l)[:$l] + .;\n\ndef generate($n; $i; $c):\n if $n <= 1 then \"'n' must be more than 1.\" | error\n else { s: ($n|array(array(\"\"))),\n dir: \"right\",\n y: (($n/2)|floor) }\n | .x = if ($n % 2 == 0) then .y - 1 else .y end # shift left for even n\n | reduce range($i; $n * $n + $i) as $j (.;\n .s[.y][.x] = (\n if $j | is_prime\n\t then (if $c|isDigit then $j|lpad(4) else \" \\($c) \" end)\n\t else \" ---\"\n\t end)\n | if .dir == \"right\"\n then if (.x <= $n - 1 and .s[.y - 1][.x] == \"\" and $j > i) then .dir = \"up\" else . end\n elif .dir == \"up\"\n then if (.s[.y][.x - 1] == \"\") then .dir = \"left\" else . end\n elif .dir == \"left\"\n then if (.x == 0 or .s[.y + 1][.x] == \"\") then .dir = \"down\" else . end\n elif .dir == \"down\"\n then if (.s[.y][.x + 1] == \"\") then .dir = \"right\" else . end\n else .\n\tend\n | if .dir == \"right\" then .x += 1\n elif .dir == \"up\" then .y += -1\n elif .dir == \"left\" then .x += -1\n elif .dir == \"down\" then .y += 1\n else .\n end )\n | .s[] | join(\" \")\n end ;\n\n# with digits\ngenerate(9; 1; \"0\"), \"\",\n\n# with *\ngenerate(9; 1; \"*\")\n","language":"Jq"},{"code":"using Primes\n\nfunction ulamspiral(ord::Int)\n # Possible directions\n dirs = [[0, 1], [-1, 0], [0, -1], [1, 0]]\n # fdir = [\"→\", \"↑\", \"←\", \"↓\"] # for debug pourpose\n cur = maxsteps = 1 # starting direction & starting max steps\n steps = n = 0 # starting steps & starting number in cell\n pos = [ord ÷ 2 + 1, isodd(ord) ? ord ÷ 2 + 1 : ord ÷ 2] # starting position\n M = Matrix{Bool}(ord, ord) # result matrix\n while n < ord ^ 2 # main loop (stop when the matrix is filled)\n n += 1\n M[pos[1], pos[2]] = isprime(n)\n steps += 1\n # Debug print\n # @printf(\"M[%i, %i] = %5s (%2i), step %i/%i, nxt %s\\n\", pos[1], pos[2], isprime(n), n, steps, maxsteps, fdir[cur])\n pos .+= dirs[cur] # increment position\n if steps == maxsteps # if reached max number of steps in that direction...\n steps = 0 # ...reset steps\n if iseven(cur) maxsteps += 1 end # if the current direction is even increase the number of steps\n cur += 1 # change direction\n if cur > 4 cur -= 4 end # correct overflow\n end\n end\n return M\nend\n\nmprint(m::Matrix) = for i in 1:size(m, 1) println(join(el ? \" ∙ \" : \" \" for el in m[i, :]), '\\n') end\n\nM = ulamspiral(9)\nmprint(M)\n","language":"Julia"},{"code":"object Ulam {\n fun generate(n: Int, i: Int = 1, c: Char = '*') {\n require(n > 1)\n val s = Array(n) { Array(n, { \"\" }) }\n var dir = Direction.RIGHT\n var y = n / 2\n var x = if (n % 2 == 0) y - 1 else y // shift left for even n's\n for (j in i..n * n - 1 + i) {\n s[y][x] = if (isPrime(j)) if (c.isDigit()) \"%4d\".format(j) else \" $c \" else \" ---\"\n\n when (dir) {\n Direction.RIGHT -> if (x <= n - 1 && s[y - 1][x].none() && j > i) dir = Direction.UP\n Direction.UP -> if (s[y][x - 1].none()) dir = Direction.LEFT\n Direction.LEFT -> if (x == 0 || s[y + 1][x].none()) dir = Direction.DOWN\n Direction.DOWN -> if (s[y][x + 1].none()) dir = Direction.RIGHT\n }\n\n when (dir) {\n Direction.RIGHT -> x++\n Direction.UP -> y--\n Direction.LEFT -> x--\n Direction.DOWN -> y++\n }\n }\n for (row in s) println(\"[\" + row.joinToString(\"\") + ']')\n println()\n }\n\n private enum class Direction { RIGHT, UP, LEFT, DOWN }\n\n private fun isPrime(a: Int): Boolean {\n when {\n a == 2 -> return true\n a <= 1 || a % 2 == 0 -> return false\n else -> {\n val max = Math.sqrt(a.toDouble()).toInt()\n for (n in 3..max step 2)\n if (a % n == 0) return false\n return true\n }\n }\n }\n}\n\nfun main(args: Array<String>) {\n Ulam.generate(9, c = '0')\n Ulam.generate(9)\n}\n","language":"Kotlin"},{"code":"local function ulamspiral(n, f)\n print(\"n = \" .. n)\n local function isprime(p)\n if p < 2 then return false end\n if p % 2 == 0 then return p==2 end\n if p % 3 == 0 then return p==3 end\n local limit = math.sqrt(p)\n for f = 5, limit, 6 do\n if p % f == 0 or p % (f+2) == 0 then return false end\n end\n return true\n end\n local function spiral(x, y)\n if n%2==1 then x, y = n-1-x, n-1-y end\n local m = math.min(x, y, n-1-x, n-1-y)\n return x<y and (n-2*m-2)^2+(x-m)+(y-m) or (n-2*m)^2-(x-m)-(y-m)\n end\n for y = 0, n-1 do\n for x = 0, n-1 do\n io.write(f(isprime(spiral(x,y))))\n end\n print()\n end\n print()\nend\n\n-- filling a 132 column terminal (with a 2-wide glyph to better preserve aspect ratio)\nulamspiral(132/2, function(b) return b and \"██\" or \" \" end)\n","language":"Lua"},{"code":"Module Ulam_Spiral {\n\tbuild_spiral(9)\n\tSub build_spiral(n)\n\t\tif n mod 2=0 then n++\n\t\tLocal matrix(n,n) as string\n\t\tLocal x = (n-1)/2, y = (n-1)/2\n\t\tLocal x_max = 1, y_max = 1, count = 1\n\t\tLocal dir = \"R\", i, l=Len(n*n+\"\")\n\t\t\n\t\tFor i = 1 To n*n\n\t\t\tIf @IsPrime(i) Then\n\t\t\t\tmatrix(x,y) = Right$(\"000\"+i,l)\n\t\t\tElse\n\t\t\t\tmatrix(x,y) = String$(\"-\", l) // this is different from VbScript\n\t\t\tEnd If\n\t\t\tSelect Case dir\n\t\t\t\tCase \"R\"\n\t\t\t\t{\n\t\t\t\t\t\tIf x_max > 0 Then\n\t\t\t\t\t\t\tx++:x_max--\n\t\t\t\t\t\tElse\n\t\t\t\t\t\t\tdir = \"U\" : y_max = count\n\t\t\t\t\t\t\ty--:y_max--\n\t\t\t\t\t\tEnd If\n\t\t\t\t}\n\t\t\t\tCase \"U\"\n\t\t\t\t{\n\t\t\t\t\t\tIf y_max > 0 Then\n\t\t\t\t\t\t\ty-- :y_max--\n\t\t\t\t\t\tElse\n\t\t\t\t\t\t\tdir = \"L\" : count++: x_max = count\n\t\t\t\t\t\t\tx--:x_max--\n\t\t\t\t\t\tEnd If\n\t\t\t\t}\n\t\t\t\tCase \"L\"\n\t\t\t\t{\n\t\t\t\t\t\tIf x_max > 0 Then\n\t\t\t\t\t\t\tx--:x_max--\n\t\t\t\t\t\tElse\n\t\t\t\t\t\t\tdir = \"D\" : y_max = count\n\t\t\t\t\t\t\ty++:y_max--\n\t\t\t\t\t\tEnd If\n\t\t\t\t}\n\t\t\t\tCase \"D\"\n\t\t\t\t{\n\t\t\t\t\t\tIf y_max > 0 Then\n\t\t\t\t\t\t\ty++:y_max--\n\t\t\t\t\t\tElse\n\t\t\t\t\t\t\tdir = \"R\" : count++: x_max = count\n\t\t\t\t\t\t\tx++:x_max--\n\t\t\t\t\t\tEnd If\n\t\t\t\t}\n\t\t\tEnd Select\n\t\tNext\n\t\tFor y = 0 To n - 1\n\t\t\tFor x = 0 To n - 1\n\t\t\t\tIf x = n - 1 Then\n\t\t\t\t\tPrint matrix(x,y)\n\t\t\t\tElse\n\t\t\t\t\tprint matrix(x,y)+\" \";\n\t\t\t\tEnd If\n\t\t\tNext\n\t\t\tprint\n\t\tNext\n\tEnd Sub\n\tFunction IsPrime(n)\n\t\tIf n = 2 Then\n\t\t\t= True\n\t\tElse.If n <= 1 Or n Mod 2 = 0 Then\n\t\t\t= False\n\t\tElse\n\t\t\t= True\n\t\t\tif 3>Int(Sqrt(n)) then exit function\n // for/next in M2000 always executed (from step used the absolute value)\n\t\t\tlocal i\n\t\t\tFor i = 3 To Int(Sqrt(n)) Step 2\n\t\t\t\tIf n Mod i = 0 Then\n\t\t\t\t\t= False\n\t\t\t\t\tExit For\n\t\t\t\tEnd If\n\t\t\tNext\n\t\tEnd If\n\tEnd Function\n}\nUlam_Spiral\n","language":"M2000-Interpreter"},{"code":"ClearAll[iCCWSpiralEast]\niCCWSpiralEast[n_Integer]:=Table[(1/2 (-1)^# ({1,-1} (Abs[#^2-t]-#)+#^2-t-Mod[#,2])&)[Round[Sqrt[t]]],{t,0,n-1}]\nn=20\nstart=1;\npts=iCCWSpiralEast[n^2];\npts=Pick[pts,PrimeQ[start+Range[n^2]-1],True];\ngrid=Table[({i,j}/.(Alternatives@@pts)->\"#\")/.{_,_}->\" \",{j,Round[n/2],-Round[n/2],-1},{i,-Round[n/2],Round[n/2],1}];\nGrid[grid]\n","language":"Mathematica"},{"code":"/* Adapting the spiral to the problem requirements */\nspiral_from_center(n):=(n^2+1)*matrixmap(lambda([x],x+1),zeromatrix(n,n))-spiral(n)$\n\n/* Testing */\nspiral_from_center(35)$\nmatrixmap(lambda([x],if primep(x) then \"O\" else \"\"),%);\n","language":"Maxima"},{"code":"import strutils\n\nconst N = 51 # Grid width and height.\n\ntype\n Vec2 = tuple[x, y: int]\n Grid = array[N, array[N, string]]\n\nconst Deltas: array[4, Vec2] = [(0, 1), (-1, 0), (0, -1), (1, 0)]\n\n\nproc `+`(v1, v2: Vec2): Vec2 =\n ## Vector addition.\n (v1.x + v2.x, v1.y + v2.y)\n\n\nproc isPrime(n: Positive): bool =\n ## Check if a number is prime.\n if n == 1: return false\n if (n and 1) == 0: return n == 2\n if (n mod 3) == 0: return n == 3\n var delta = 2\n var d = 5\n while d * d <= n:\n if n mod d == 0: return false\n inc d, delta\n delta = 6 - delta\n return true\n\n\nproc fill(grid: var Grid; start: Positive = 1) =\n ## Fill the grid using Ulam algorithm.\n\n template isEmpty(pos: Vec2): bool = grid[pos.x][pos.y].len == 0\n\n # Fill the grid with successive numbers (as strings).\n var pos: Vec2 = (N div 2, N div 2)\n grid[pos.x][pos.y] = $start\n var currIdx = 3\n for n in (start + 1)..<(start + N * N):\n let nextIdx = (currIdx + 1) and 3\n var nextPos = pos + Deltas[nextIdx]\n if nextPos.isEmpty():\n # Direction change is OK.\n currIdx = nextIdx\n else:\n # Continue in same direction.\n nextPos = pos + Deltas[currIdx]\n pos = move(nextPos)\n grid[pos.x][pos.y] = $n\n\n # Replace the values with a symbol (if prime) or a space (if composite).\n for row in 0..<N:\n for col in 0..<N:\n grid[row][col] = if grid[row][col].parseInt().isPrime(): \"• \" else: \" \"\n\n\nvar grid: Grid\ngrid.fill()\nfor row in grid:\n echo row.join()\n","language":"Nim"},{"code":"import imageman\n\nconst\n N = 501 # Grid width and height.\n FG = ColorRGBU [byte 255, 255, 255]\n BG = ColorRGBU [byte 0, 0, 0]\n\ntype\n Vec2 = tuple[x, y: int]\n Grid = array[N, array[N, int32]]\n\nconst Deltas: array[4, Vec2] = [(0, 1), (-1, 0), (0, -1), (1, 0)]\n\n\nproc `+`(v1, v2: Vec2): Vec2 =\n ## Vector addition.\n (v1.x + v2.x, v1.y + v2.y)\n\n\nproc isPrime(n: Positive): bool =\n ## Check if a number is prime.\n if n == 1: return false\n if (n and 1) == 0: return n == 2\n if (n mod 3) == 0: return n == 3\n var delta = 2\n var d = 5\n while d * d <= n:\n if n mod d == 0: return false\n inc d, delta\n delta = 6 - delta\n return true\n\n\nproc fill(grid: var Grid; start: Positive = 1) =\n ## Fill the grid using Ulam algorithm.\n\n template isEmpty(pos: Vec2): bool = grid[pos.x][pos.y] == 0\n\n let start = start.int32\n\n # Fill the grid with successive numbers (as strings).\n var pos: Vec2 = (N div 2, N div 2)\n grid[pos.x][pos.y] = start\n var currIdx = 3\n for n in (start + 1)..<(start + N * N):\n let nextIdx = (currIdx + 1) and 3\n var nextPos = pos + Deltas[nextIdx]\n if nextPos.isEmpty():\n # Direction change is OK.\n currIdx = nextIdx\n else:\n # Continue in same direction.\n nextPos = pos + Deltas[currIdx]\n pos = move(nextPos)\n grid[pos.x][pos.y] = n\n\nproc apply(img: var Image; grid: Grid) =\n ## Fill the image with foreground pixel (for primes) or nothing (for composites).\n for row in 0..<N:\n for col in 0..<N:\n if grid[row][col].isPrime():\n img[row, col] = FG\n\n\nvar grid: Grid\ngrid.fill()\n\nvar image = initImage[ColorRGBU](N, N)\nimage.fill(BG)\nimage.apply(grid)\nimage.savePNG(\"ulam_spiral.png\", compression = 9)\n","language":"Nim"},{"code":"\\\\ Ulam spiral (plotting/printing)\n\\\\ 4/19/16 aev\nplotulamspir(n,pflg=0)={\nmy(n=if(n%2==0,n++,n),M=matrix(n,n),x,y,xmx,ymx,cnt,dir,n2=n*n,pch,sz=#Str(n2),pch2=srepeat(\" \",sz));\nif(pflg<0||pflg>2,pflg=0);\nprint(\" *** Ulam spiral: \",n,\"x\",n,\" matrix, p-flag=\",pflg);\nx=y=n\\2+1; xmx=ymx=cnt=1; dir=\"R\";\nfor(i=1,n2,\n if(isprime(i), if(!insm(M,x,y), break); if(pflg==2, M[y,x]=i, M[y,x]=1));\n if(dir==\"R\", if(xmx>0, x++;xmx--, dir=\"U\";ymx=cnt;y--;ymx--); next);\n if(dir==\"U\", if(ymx>0, y--;ymx--, dir=\"L\";cnt++;xmx=cnt;x--;xmx--); next);\n if(dir==\"L\", if(xmx>0, x--;xmx--, dir=\"D\";ymx=cnt;y++;ymx--); next);\n if(dir==\"D\", if(ymx>0, y++;ymx--, dir=\"R\";cnt++;xmx=cnt;x++;xmx--); next);\n );\\\\fend\n\\\\Plot/Print according to the p-flag(0-real plot,1-\"*\",2-primes)\nif(pflg==0, plotmat(M));\nif(pflg==1, for(i=1,n,\n for(j=1,n, if(M[i,j]==1, pch=\"*\", pch=\" \");\n print1(\" \",pch)); print(\" \")));\nif(pflg==2, for(i=1,n,\n for(j=1,n, if(M[i,j]==0, pch=pch2, pch=spad(Str(M[i,j]),sz,,1));\n print1(\" \",pch)); print(\" \")));\n}\n\n{\\\\ Executing:\nplotulamspir(9,1); \\\\ (see output)\nplotulamspir(9,2); \\\\ (see output)\nplotulamspir(100); \\\\ ULAMspiral1.png\nplotulamspir(200); \\\\ ULAMspiral2.png\n}\n","language":"PARI-GP"},{"code":"Program Ulam; Uses crt;\n{Concocted by R.N.McLean (whom God preserve), ex Victoria university, NZ.}\n{$B- evaluate boolean expressions only so far as necessary.}\n{$R+ range checking...}\n\n FUNCTION Trim(S : string) : string;\n var L1,L2 : integer;\n BEGIN\n L1 := 1;\n WHILE (L1 <= LENGTH(S)) AND (S[L1] = ' ') DO INC(L1);\n L2 := LENGTH(S);\n WHILE (S[L2] = ' ') AND (L2 > L1) DO DEC(L2);\n IF L2 >= L1 THEN Trim := COPY(S,L1,L2 - L1 + 1) ELSE Trim := '';\n END; {Of Trim.}\n\nFUNCTION Ifmt(Digits : integer) : string;\n var S : string[255];\n BEGIN\n STR(Digits,S);\n Ifmt := Trim(S);\n END; { Ifmt }\n Function min(i,j: integer): integer;\n begin\n if i <= j then min:=i else min:=j;\n end;\n Procedure Croak(Gasp: string); {A lethal word.}\n Begin\n WriteLn;\n WriteLn(Gasp);\n HALT; {This way to the egress...}\n End;\n var ScreenLine,ScreenColumn: byte;\t{Line and column position.}\n{=========================enough support===================}\n const Mstyle = 6;\t{Display different results.}\n const StyleName: array[1..Mstyle] of string = ('IsPrime','First Prime Factor Index',\n 'First Prime Factor','Number of Prime Factors',\n 'Sum of Prime Factors','Sum of Proper Factors');\n const OrderLimit = 49; Limit2 = OrderLimit*OrderLimit;\t\t{A 50-line screen has room for a heading.}\n var Tile: array[1..OrderLimit,1..OrderLimit] of integer; \t{Alas, can't put [Order,Order], only constants.}\n var FirstPrimeFactorIndex,FirstPrimeFactor,NumPFactor,SumPFactor,SumFactor: array[1..Limit2] of integer;\n const enuffP = 17;\t{Given the value of Limit2.}\n const Prime: array[1..enuffP] of integer = (1,2,3,5,7,11,13,17,19,23,29,31,37,41,43,47,53);\n Procedure Prepare;\t{Various arrays are to be filled for the different styles.}\n var i,j,p: integer;\n Begin\n for i:=1 to limit2 do\t{Alas, can't just put A:=0;}\n begin\t\t\t{Nor clear A;}\n FirstPrimeFactorIndex[i]:=1;\t{Prime[1] = 1, so this means no other divisor.}\n FirstPrimeFactor[i]:=0;\n NumPFactor[i]:=0;\n SumPFactor[i]:=0;\n SumFactor[i]:=1;\t\t{1 is counted as a proper factor.}\n end;\n FirstPrimeFactorIndex[1]:=0;\t{Fiddle, as 1 is not a prime number.}\n SumFactor[1]:=0;\t\t{N is not a proper factor of N, so 1 has no proper factors...}\n for i:=2 to enuffP do\t{Prime[1] = 1, Prime[2] = 2, so start with i = 2.}\n begin\n p:=Prime[i];\n j:=p + p;\n while j <= Limit2 do\n begin\n if FirstPrimeFactorIndex[j] = 1 then FirstPrimeFactorIndex[j]:=i;\n if FirstPrimeFactor[j] = 0 then FirstPrimeFactor[j]:=p;\n SumPFactor[j]:=SumPFactor[j] + p;\n inc(NumPFactor[j]);\n j:=j + p;\n end;\n end;\n for i:=2 to Limit2 div 2 do\t{Step through all possible proper factors.}\n begin\t\t\t{N is not a proper factor of N, so start at 2N,}\n j:=2*i;\t \t\t{for which N is a proper factor of 2N.}\n while j <= Limit2 do\t{Sigh. for j:=2*i:Limit2:i do ... Next i;}\n begin\n SumFactor[j]:=SumFactor[j] + i;\n j:=j + i;\n end;\n end;\n End;\t{Enough preparation.}\n\n const enuffC = 11;\t{Perhaps the colours will highlight interesting patterns.}\n const colour:array[0..enuffC] of byte = (black,white,LightRed,\n LightMagenta,Yellow,LightGreen,LightCyan,LightBlue,LightGray,\n Red,Green,DarkGray);\t\t{Colours on the screen don't always match their name!}\n\n Procedure UlamSpiral(Order,Start,Style: integer);\t{Generate the numbers, then display.}\n Function Encode(N: integer): integer;\t{Acording to Style, choose a result to show.}\n Begin\n if N <= 1 then Encode:=0\n else\n case style of\n 1:if FirstPrimeFactorIndex[N] = 1 then Encode:=1 else Encode:=0;\t{1 = Prime.}\n 2:Encode:=FirstPrimeFactorIndex[N];\n 3:Encode:=FirstPrimeFactor[N];\n 4:Encode:=NumPFactor[N];\n 5:Encode:=SumPFactor[N];\n 6:Encode:=SumFactor[N];\n end;\n End;\t{So much for encoding.}\n var Place,Way: array[1..2] of integer;\t{Complex numbers.}\n var m,\t{Middle.}\n N,\t{Counter.}\n length,\t{length of a side.}\n lunge,\t{two lunges for each length.}\n step\t{steps to make up a lunge of some length.}\n : integer;\n var i,j: integer;\t{Steppers.}\n var code,it: integer;\t{Mess with the results.}\n label XX;\t\t{Escape the second lunge.}\n var OutF: text;\t{Utter drivel. It is a disc file.}\n Begin\n Write('Ulam Spiral, order ',Order,', start ',Start,', style ',style);\t{Start the heading.}\n if style <= 0 then Croak('Must be a positive style');\n if style > Mstyle then croak('Last known style is '+ifmt(Mstyle));\n if Order > OrderLimit then Croak('Array OrderLimit is order '+IFmt(OrderLimit));\n if Order mod 2 <>1 then Croak('The order must be an odd number!');\n writeln(': ',StyleName[Style]);\t{Finish the heading. The pattern starts with line two.}\n Assign(OutF,'Ulam.txt'); Rewrite(OutF); Writeln(OutF,'Ulam spiral: the codes for ',StyleName[style]);\n m:=order div 2 + 1;\t\t{This is why Order must be odd.}\n Place[1]:=m; Place[2]:=m;\t{Start at the middle.}\n way[1]:=1; way[2]:=0;\t{Initial direction is along the x-axis.}\n n:=Start;\n for length:=1 to Order do\t{Advance through the lengths.}\n for lunge:=1 to 2 do\t\t{Two lunges for each length.}\n begin\n for step:=1 to length do\t\t\t{Make the steps.}\n begin\n Tile[Place[1],Place[2]]:=N;\n for i:=1 to 2 do Place[i]:=Place[i] + Way[i]; {Place:=Place + Way;}\n N:=N + 1;\n end;\n if N >= Order*Order then goto XX;\t{Each corner piece is part of two lunges.}\n i:=Way[1]; Way[1]:=-Way[2]; Way[2]:=i;\t{Way:=Way*(0,1) in complex numbers: (x,y)*(0,1) = (-y,x).}\n end;\nXX:for i:=order downto 1 do {Output: Lines count downwards, y runs upwards.}\n begin\t\t\t{The first line is the topmost y.}\n for j:=1 to order do\t{(line,column) = (y,x).}\n begin\t\t\t\t{Work along the line.}\n it:=Tile[j,i];\t\t\t{Grab the number.}\n code:=Encode(it);\t\t{Presentation scheme.}\n Write(OutF,'(',it:4,':',code:2,')');\t{Debugging...}\n if FirstPrimeFactorIndex[it] > 1 then TextBackGround(Black)\t{Not a prime.}\n else if it = 1 then TextBackGround(Black)\t{Darkness for one, also.}\n else TextBackGround(White);\t\t{A prime number!}\n TextColor(Colour[min(code,enuffC)]);\t{A lot of fuss for this!}\n {Write(code:2);}\n {Write(it:3);}\n if it <= 9 then write(it) else Write('*');\t{Thus mark the centre.}\n end;\t\t\t\t\t{Next position along the line.}\n if i > 1 then WriteLn;\t\t{Ending the last line would scroll the heading up.}\n WriteLn(OutF);\t\t\t{But this is good for the text file.}\n end;\t\t\t{On to the next line.}\n Close(OutF);\t\t{Finished with the trace.}\n{Some revelations to help in choosing a colour sequence.}\n ScreenLine:=WhereY; ScreenColumn:=WhereX;\t{Gibberish to find the location.}\n if Style > 1 then\t{Only the fancier styles go beyond 0 and 1.}\n begin\t\t\t{So explain only for them.}\n GoToXY(ScreenColumn + 1,ScreenLine - 4);\t\t{Unused space is to the right.}\n TextColor(White); write('Colour sequence');\t{Given 80-column displays.}\n GoToXY(ScreenColumn + 1,ScreenLine - 3);\t\t{And no more than 50 lines.}\n for i:=1 to enuffC do begin TextColor(Colour[i]); write(i); end;\t{My sequence.}\n GoToXY(ScreenColumn + 1,ScreenLine - 2);\n TextColor(White); write('From options');\n GoToXY(ScreenColumn + 1,ScreenLine - 1);\n for i:=1 to 15 do begin TextColor(i);write(i); end;\t\t{The options.}\n end;\n End; {of UlamSpiral.}\n\n var start,wot,order: integer;\t{A selector.}\n BEGIN\t{After all that.}\n TextMode(Lo(LastMode) + Font8x8);\t{Gibberish sets 43 lines on EGA and 50 on VGA.}\n ClrScr; TextColor(White);\t\t{This also gives character blocks that are almost square...}\n WriteLn('Presents consecutive integers in a spiral, as per Stanislaw Ulam.');\n WriteLn('Starting with 1, runs up to Order*Order.');\n Write('What value for Order? (Limit ' + Ifmt(OrderLimit),'): ');\n ReadLn(Order);\t\t\t{ReadKey needs no \"enter\", but requires decoding.}\n if (order < 1) or (order > OrderLimit) then Croak('Out of range!');\t{Oh dear.}\n Prepare;\n wot:=1;\t{The original task.}\n Repeat\t\t{Until bored?}\n ClrScr;\t\t\t{Scrub any previous stuff.}\n UlamSpiral(Order,1,wot);\t\t{The deed!}\n GoToXY(ScreenColumn + 1,ScreenLine);\t\t{Note that the last WriteLn was skipped.}\n TextColor(White); Write('Enter 0, or 1 to '+Ifmt(Mstyle),': ');\t{Wot now?}\n ReadLn(wot);\t\t\t\t\t\t{Receive.}\n Until (wot <= 0) or (wot > Mstyle);\t\t{Alas, \"Enter\" must be pressed.}\n END.\n","language":"Pascal"},{"code":"PROGRAM Ulam.pas;\n\n\n{$IFDEF FPC}\n {$mode objfpc}{$H+}{$J-}{R+}\n{$ELSE}\n {$APPTYPE CONSOLE}\n{$ENDIF}\n\n\n(*)\n Free Pascal Compiler version 3.2.0 [2020/06/14] for x86_64\n The free and readable alternative at C/C++ speeds\n compiles natively to almost any platform, including raspberry PI\n\n https://www.freepascal.org/advantage.var\n(*)\n\n USES\n Crt,\n SysUtils ;\n\n CONST\n (*)\n Only odd numbers work\n (*)\n SIZE = 9 ;\n MSIZE = SIZE * ord ( Odd ( SIZE ) ) ;\n\n TYPE\n D2Arr = array of array of string ;\n\n\n FUNCTION IsPrime ( n: integer ): boolean ;\n\n VAR\n i: integer;\n\n BEGIN\n\n IF ( n < 2 ) THEN Exit ( False ) ;\n IF ( n = 2 ) THEN Exit ( True ) ;\n IF ( n mod 2 = 0 ) THEN Exit ( False ) ;\n\n FOR i := 3 TO Trunc ( Sqrt ( n ) ) DO\n IF ( n mod i = 0 ) THEN Exit( False ) ;\n\n IsPrime := True ;\n\n END;\n\n\n PROCEDURE Init2DArr ( Arr: D2Arr ) ;\n\n VAR\n j: integer;\n mid: integer = MSIZE div 2 ;\n\n BEGIN\n\n FOR j:= 1 to MSIZE - mid - 1 DO\n BEGIN\n Arr [ mid - j ] [ mid - j ] := '.' ;\n Arr [ mid - j ] [ mid + j ] := '.' ;\n Arr [ mid + j ] [ mid - j ] := '.' ;\n Arr [ mid + j ] [ mid + j - 1 ] := '.' ;\n END;\n\n END;\n\n\n PROCEDURE Advance ( var Turn_cnt, x, y: integer ) ;\n\n VAR\n dir: array [ 0..3, 0..1 ] of shortint =\n ( ( 1, 0 ), ( 0, -1 ), ( -1, 0 ), ( 0, 1 ) ) ;\n\n BEGIN\n\n x := Abs ( x + dir [ Turn_cnt mod 4 ][ 0 ] ) ;\n y := Abs ( y + dir [ Turn_cnt mod 4 ][ 1 ] ) ;\n\n END;\n\n\n PROCEDURE Add2DArr ( Arr: D2Arr ) ;\n\n VAR\n\n cnt: integer = 1 ;\n Turn_cnt: integer = 0 ;\n x: integer = MSIZE div 2 ;\n y: integer = MSIZE div 2 ;\n\n BEGIN\n\n WHILE ( cnt < MSIZE * MSIZE ) DO\n BEGIN\n\n Advance ( Turn_cnt , x , y ) ;\n Inc ( cnt ) ;\n\n IF ( Arr [ x ] [ y ] = '.' ) THEN\n BEGIN\n Arr [ x ] [ y ] := '' ;\n inc ( Turn_cnt ) ;\n END;\n\n IF ( IsPrime ( cnt ) ) THEN\n Arr [ x ] [ y ] := IntToStr ( cnt ) ;\n\n END;\n\n END;\n\n\n PROCEDURE Show2DArr ( Arr: D2Arr ; glyph : Boolean ) ;\n\n VAR\n x, y: integer ;\n\n BEGIN\n\n WriteLn ;\n\n FOR y := Low ( Arr ) TO High ( Arr ) DO\n BEGIN\n FOR x := Low ( Arr [ y ] ) to High ( Arr [ y ] ) DO\n\n IF length ( Arr [ x ] [ y ] ) > 0 THEN\n IF glyph THEN Write ( '′' : 3 )\n ELSE Write ( Arr [ x ] [ y ] : 3 )\n ELSE Write ( ' ' : 3) ;\n\n WriteLn;\n END;\n\n WriteLn;\n\n END;\n\n\nVAR\n Arr: D2Arr ;\n\nBEGIN\n\n IF ( MSIZE = 0 ) THEN\n BEGIN\n WriteLn ( 'Only odd numbers work for SIZE' ) ;\n Exit;\n END;\n SetLength ( Arr, MSIZE, MSIZE ) ;\n Init2DArr ( Arr ) ;\n Add2DArr ( Arr ) ;\n Show2DArr ( Arr , False ) ;\n Show2DArr ( Arr , True ) ;\n\nEND.\n","language":"Pascal"},{"code":"PROGRAM Ulam8.pas;\n\n{$IFDEF FPC}\n {$mode objfpc}{$H+}{$J-}{R+}\n{$ELSE}\n {$APPTYPE CONSOLE}\n{$ENDIF}\n\n(*)\n Free `translation` from PHIX for the Spiral part\n\n Free Pascal Compiler version 3.2.0 [2020/06/14] for x86_64\n The free and readable alternative at C/C++ speeds\n compiles natively to almost any platform, including raspberry PI *\n Can run independently from DELPHI / Lazarus\n\n For debian Linux: apt -y install fpc\n\t\tIt contains a text IDE called fp\n\n https://www.freepascal.org/advantage.var\n\n(*)\n\nUSES\n\n crt;\n\nCONST\n\n SIZE = 9 ; // `SIZE = 9 : \"The Iceskater\" ( Obvious when Dutch ) `\n n = SIZE * ord ( Odd ( SIZE ) ) ;\n\n CrLf = #13#10 ;\n\n\n FUNCTION IsPrime ( n: integer ): boolean ;\n\n VAR\n i: integer;\n\n BEGIN\n\n IF ( n < 2 ) THEN Exit ( False ) ;\n IF ( n = 2 ) THEN Exit ( True ) ;\n IF ( n mod 2 = 0 ) THEN Exit ( False ) ;\n\n FOR i := 3 TO Trunc ( Sqrt ( n ) ) DO\n IF ( n mod i = 0 ) THEN Exit( False ) ;\n\n IsPrime := True ;\n\n END;\n\n\n FUNCTION Spiral ( w, h, x, y : integer ) : integer ;\n\n BEGIN\n\n IF ( y > 0 ) THEN\n Spiral := w + Spiral ( h - 1, w, y - 1, w - x - 1 )\n ELSE\n Spiral := x\n\n END ;\n\n PROCEDURE PrintSpiral ( s : string ) ;\n\n VAR\n\n h : integer = n ;\n i : integer ;\n j : integer ;\n p : integer ;\n w : integer = n ;\n\n BEGIN\n\n FOR i := h - 1 DOWNTO 0 DO\n BEGIN\n FOR j := w - 1 DOWNTO 0 DO\n BEGIN\n\n p := w * h - Spiral ( w, h, j, i ) ;\n IF IsPrime ( p ) THEN\n IF ( s = '' ) THEN Write ( p:3 ) ELSE Write ( '`':3 )\n ELSE Write ( ' ':3 )\n\n END;\n WriteLn ;\n END ;\n END ;\n\nBEGIN\n\n IF ( n = 0 ) THEN\n BEGIN\n WriteLn ( 'Only odd numbers work for SIZE' ) ;\n Exit;\n END;\n\n PrintSpiral ( '' ) ;\n WriteLn ( CrLf ) ;\n PrintSpiral ( 'Symbol' ) ;\n\nEND.\n","language":"Pascal"},{"code":"use ntheory qw/is_prime/;\nuse Imager;\n\nmy $n = shift || 512;\nmy $start = shift || 1;\nmy $file = \"ulam.png\";\n\nsub cell {\n my($n, $x, $y, $start) = @_;\n $y -= $n>>1;\n $x -= ($n-1)>>1;\n my $l = 2*(abs($x) > abs($y) ? abs($x) : abs($y));\n my $d = ($y > $x) ? $l*3 + $x + $y : $l-$x-$y;\n ($l-1)**2 + $d + $start - 1;\n}\n\nmy $black = Imager::Color->new('#000000');\nmy $white = Imager::Color->new('#FFFFFF');\nmy $img = Imager->new(xsize => $n, ysize => $n, channels => 1);\n$img->box(filled=>1, color=>$white);\n\nfor my $y (0 .. $n-1) {\n for my $x (0 .. $n-1) {\n my $v = cell($n, $x, $y, $start);\n $img->setpixel(x => $x, y => $y, color => $black) if is_prime($v);\n }\n}\n\n$img->write(file => $file) or die \"Cannot write $file: \", $img->errstr, \"\\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;\">spiral</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #004080;\">integer</span> <span style=\"color: #000000;\">w</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">h</span><span style=\"color: #0000FF;\">,</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: #008080;\">return</span> <span style=\"color: #008080;\">iff</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">y</span><span style=\"color: #0000FF;\">?</span><span style=\"color: #000000;\">w</span><span style=\"color: #0000FF;\">+</span><span style=\"color: #000000;\">spiral</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">h</span><span style=\"color: #0000FF;\">-</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">w</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">y</span><span style=\"color: #0000FF;\">-</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">w</span><span style=\"color: #0000FF;\">-</span><span style=\"color: #000000;\">x</span><span style=\"color: #0000FF;\">-</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">):</span><span style=\"color: #000000;\">x</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;\">integer</span> <span style=\"color: #000000;\">w</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">9</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">h</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">9</span>\n <span style=\"color: #008080;\">for</span> <span style=\"color: #000000;\">i</span><span style=\"color: #0000FF;\">=</span><span style=\"color: #000000;\">h</span><span style=\"color: #0000FF;\">-</span><span style=\"color: #000000;\">1</span> <span style=\"color: #008080;\">to</span> <span style=\"color: #000000;\">0</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: #008080;\">for</span> <span style=\"color: #000000;\">j</span><span style=\"color: #0000FF;\">=</span><span style=\"color: #000000;\">w</span><span style=\"color: #0000FF;\">-</span><span style=\"color: #000000;\">1</span> <span style=\"color: #008080;\">to</span> <span style=\"color: #000000;\">0</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;\">p</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">w</span><span style=\"color: #0000FF;\">*</span><span style=\"color: #000000;\">h</span><span style=\"color: #0000FF;\">-</span><span style=\"color: #000000;\">spiral</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">w</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">h</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">j</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">i</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;\">\"o \"</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">2</span><span style=\"color: #0000FF;\">-</span><span style=\"color: #7060A8;\">is_prime</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">p</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: #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":"-->\n <span style=\"color: #004080;\">sequence</span> <span style=\"color: #000000;\">vc</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">video_config</span><span style=\"color: #0000FF;\">()</span>\n <span style=\"color: #004080;\">integer</span> <span style=\"color: #000000;\">w</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">vc</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">VC_SCRNCOLS</span><span style=\"color: #0000FF;\">]-</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">h</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">vc</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #004600;\">VC_SCRNLINES</span><span style=\"color: #0000FF;\">]-</span><span style=\"color: #000000;\">1</span>\n<!--\n","language":"Phix"},{"code":"(load \"@lib/simul.l\")\n\n(de ceil (A)\n (/ (+ A 1) 2) )\n\n(de prime? (N)\n (or\n (= N 2)\n (and\n (> N 1)\n (bit? 1 N)\n (let S (sqrt N)\n (for (D 3 T (+ D 2))\n (T (> D S) T)\n (T (=0 (% N D)) NIL) ) ) ) ) )\n\n(de ulam (N)\n (let\n (G (grid N N)\n D '(north west south east .)\n M (ceil N) )\n (setq This\n (intern\n (pack\n (char\n (+ 96 (if (bit? 1 N) M (inc M))) )\n M ) ) )\n (=: V '_)\n (with ((car D) This)\n (for (X 2 (>= (* N N) X) (inc X))\n (=: V (if (prime? X) '. '_))\n (setq This\n (or\n (with ((cadr D) This)\n (unless (: V) (pop 'D) This) )\n ((pop D) This) ) ) ) )\n G ) )\n\n(mapc\n '((L)\n (for This L\n (prin (align 3 (: V))) )\n (prinl) )\n (ulam 9) )\n\n(bye)\n","language":"PicoLisp"},{"code":"function New-UlamSpiral ( [int]$N )\n {\n # Generate list of primes\n $Primes = @( 2 )\n For ( $X = 3; $X -le $N*$N; $X += 2 )\n {\n If ( -not ( $Primes | Where { $X % $_ -eq 0 } | Select -First 1 ) ) { $Primes += $X }\n }\n\n # Initialize variables\n $X = 0\n $Y = -1\n $i = $N * $N + 1\n $Sign = 1\n\n # Intialize array\n $A = New-Object 'boolean[,]' $N, $N\n\n # Set top row\n 1..$N | ForEach { $Y += $Sign; $A[$X,$Y] = --$i -in $Primes }\n\n # For each remaining half spiral...\n ForEach ( $M in ($N-1)..1 )\n {\n # Set the vertical quarter spiral\n 1..$M | ForEach { $X += $Sign; $A[$X,$Y] = --$i -in $Primes }\n\n # Curve the spiral\n $Sign = -$Sign\n\n # Set the horizontal quarter spiral\n 1..$M | ForEach { $Y += $Sign; $A[$X,$Y] = --$i -in $Primes }\n }\n\n # Convert the array of booleans to text output of dots and spaces\n $Spiral = ForEach ( $X in 1..$N ) { ( 1..$N | ForEach { ( ' ', '.' )[$A[($X-1),($_-1)]] } ) -join '' }\n return $Spiral\n }\n\nNew-UlamSpiral 100\n","language":"PowerShell"},{"code":"# coding=UTF-8\nfrom __future__ import print_function, division\nfrom math import sqrt\n\ndef cell(n, x, y, start=1):\n d, y, x = 0, y - n//2, x - (n - 1)//2\n l = 2*max(abs(x), abs(y))\n d = (l*3 + x + y) if y >= x else (l - x - y)\n return (l - 1)**2 + d + start - 1\n\ndef show_spiral(n, symbol='# ', start=1, space=None):\n top = start + n*n + 1\n is_prime = [False,False,True] + [True,False]*(top//2)\n for x in range(3, 1 + int(sqrt(top))):\n if not is_prime[x]: continue\n for i in range(x*x, top, x*2):\n is_prime[i] = False\n\n cell_str = lambda x: f(x) if is_prime[x] else space\n f = lambda _: symbol # how to show prime cells\n\n if space == None: space = ' '*len(symbol)\n\n if not len(symbol): # print numbers instead\n max_str = len(str(n*n + start - 1))\n if space == None: space = '.'*max_str + ' '\n f = lambda x: ('%' + str(max_str) + 'd ')%x\n\n for y in range(n):\n print(''.join(cell_str(v) for v in [cell(n, x, y, start) for x in range(n)]))\n print()\n\nshow_spiral(10, symbol=u'♞', space=u'♘') # black are the primes\nshow_spiral(9, symbol='', space=' - ')\n# for filling giant terminals\n#show_spiral(1001, symbol='*', start=42)\n","language":"Python"},{"code":" 32 spiral\n witheach\n [ witheach\n [ 1024 swap -\n isprime iff\n say \" o\"\n else say \" .\" ]\n cr ]\n","language":"Quackery"},{"code":"## Plotting Ulam spiral (for primes) 2/12/17 aev\n## plotulamspirR(n, clr, fn, ttl, psz=600), where: n - initial size;\n## clr - color; fn - file name; ttl - plot title; psz - picture size.\n##\nrequire(numbers);\nplotulamspirR <- function(n, clr, fn, ttl, psz=600) {\n cat(\" *** START:\", date(), \"n=\",n, \"clr=\",clr, \"psz=\", psz, \"\\n\");\n if (n%%2==0) {n=n+1}; n2=n*n;\n x=y=floor(n/2); xmx=ymx=cnt=1; dir=\"R\";\n ttl= paste(c(ttl, n,\"x\",n,\" matrix.\"), sep=\"\", collapse=\"\");\n cat(\" ***\", ttl, \"\\n\");\n M <- matrix(c(0), ncol=n, nrow=n, byrow=TRUE);\n for (i in 1:n2) {\n if(isPrime(i)) {M[x,y]=1};\n if(dir==\"R\") {if(xmx>0) {x=x+1;xmx=xmx-1}\n else {dir=\"U\";ymx=cnt;y=y-1;ymx=ymx-1}; next};\n if(dir==\"U\") {if(ymx>0) {y=y-1;ymx=ymx-1}\n else {dir=\"L\";cnt=cnt+1;xmx=cnt;x=x-1;xmx=xmx-1}; next};\n if(dir==\"L\") {if(xmx>0) {x=x-1;xmx=xmx-1}\n else {dir=\"D\";ymx=cnt;y=y+1;ymx=ymx-1}; next};\n if(dir==\"D\") {if(ymx>0) {y=y+1;ymx=ymx-1}\n else {dir=\"R\";cnt=cnt+1;xmx=cnt;x=x+1;xmx=xmx-1}; next};\n };\n plotmat(M, fn, clr, ttl,,psz);\n cat(\" *** END:\",date(),\"\\n\");\n}\n\n## Executing:\nplotulamspirR(100, \"red\", \"UlamSpiralR1\", \"Ulam Spiral: \");\nplotulamspirR(200, \"red\", \"UlamSpiralR2\", \"Ulam Spiral: \",1240);\n","language":"R"},{"code":"#lang racket\n(require (only-in math/number-theory prime?))\n\n(define ((cell-fn n (start 1)) x y)\n (let* ((y (- y (quotient n 2)))\n (x (- x (quotient (sub1 n) 2)))\n (l (* 2 (if (> (abs x) (abs y)) (abs x) (abs y))))\n (d (if (>= y x) (+ (* l 3) x y) (- l x y))))\n (+ (sqr (- l 1)) d start -1)))\n\n(define (show-spiral n\n #:symbol (smb \"# \")\n #:start (start 1)\n #:space (space (and smb (make-string (string-length smb) #\\space))))\n (define top (+ start (* n n) 1))\n (define cell (cell-fn n start))\n (define print-cell\n (if smb\n (λ (i p?) (display (if p? smb space)))\n (let* ((max-len (string-length (~a (+ (sqr n) start -1))))\n (space (or space (make-string (string-length (~a (+ (sqr n) start -1))) #\\_))))\n (λ (i p?)\n (display (if p? (~a #:width max-len i #:align 'right) space))\n (display #\\space)))))\n\n (for* ((y (in-range 0 n)) #:when (unless (= y 0) (newline)) (x (in-range 0 n)))\n (define c (cell x y))\n (define p? (prime? c))\n (print-cell c p?))\n (newline))\n\n(show-spiral 9 #:symbol #f)\n(show-spiral 10 #:symbol \"♞\" #:space \"♘\") ; black are the primes\n(show-spiral 50 #:symbol \"*\" #:start 42)\n; for filling giant terminals\n; (show-spiral 1001 #:symbol \"*\" #:start 42)\n","language":"Racket"},{"code":"sub MAIN($max = 160, $start = 1) {\n (my %world){0}{0} = 0;\n my ($n, $dir, $side, $loc) = $start, 1, 0, 0+0i;\n\n while ++$side < $max {\n\tstep for ^$side; turn-left;\n\tstep for ^$side; turn-left;\n }\n\n braille-graphics %world;\n\n sub step {\n\t$loc += $dir;\n\t%world{$loc.im}{$loc.re} = $n if (++$n).is-prime;\n }\n\n sub turn-left { $dir ×= -i }\n sub turn-right { $dir ×= i }\n}\n\nsub braille-graphics (%a) {\n my ($y-lo, $y-hi, $x-lo, $x-hi);\n for %a.keys.map(+*) -> \\y {\n for %a{y}.keys.map(+*) -> \\x {\n $y-lo min= y; $y-hi max= y;\n $x-lo min= x; $x-hi max= x;\n }\n }\n\n for $y-lo, $y-lo + 4 ...^ $y-hi -> \\y {\n\tfor $x-lo, $x-lo + 2 ...^ $x-hi -> \\x {\n\t my $cell = 0x2800;\n $cell += 2⁰ if %a{y + 0}{x + 0};\n $cell += 2¹ if %a{y + 1}{x + 0};\n $cell += 2² if %a{y + 2}{x + 0};\n $cell += 2³ if %a{y + 0}{x + 1};\n $cell += 2⁴ if %a{y + 1}{x + 1};\n $cell += 2⁵ if %a{y + 2}{x + 1};\n $cell += 2⁶ if %a{y + 3}{x + 0};\n $cell += 2⁷ if %a{y + 3}{x + 1};\n print chr($cell);\n\t}\n\tprint \"\\n\";\n }\n}\n","language":"Raku"},{"code":"/*REXX program shows counter─clockwise Ulam spiral of primes shown in a square matrix.*/\nparse arg size init char . /*obtain optional arguments from the CL*/\nif size=='' | size==\",\" then size= 79 /*Not specified? Then use the default.*/\nif init=='' | init==\",\" then init= 1 /* \" \" \" \" \" \" */\nif char=='' then char= \"█\" /* \" \" \" \" \" \" */\ntot=size**2 /*the total number of numbers in spiral*/\n /*define the upper/bottom right corners*/\nuR.=0; bR.=0; do od=1 by 2 to tot; _=od**2+1; uR._=1; _=_+od; bR._=1; end /*od*/\n /*define the bottom/upper left corners.*/\nbL.=0; uL.=0; do ev=2 by 2 to tot; _=ev**2+1; bL._=1; _=_+ev; uL._=1; end /*ev*/\n\napp=1; bigP=0; #p=0; inc=0; minR=1; maxR=1; r=1; $=0; $.=; !.=\n /*▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒ construct the spiral #s.*/\n do i=init for tot; r= r + inc; minR= min(minR, r); maxR= max(maxR, r)\n x= isPrime(i); if x then bigP= max(bigP, i); #p= #p + x /*bigP, #primes.*/\n if app then $.r= $.r || x /*append token.*/\n else $.r= x || $.r /*prepend token.*/\n if uR.i then do; app= 1; inc= +1; iterate /*i*/; end /*advance ↓ */\n if bL.i then do; app= 0; inc= -1; iterate /*i*/; end /* \" ↑ */\n if bR.i then do; app= 0; inc= 0; iterate /*i*/; end /* \" ► */\n if uL.i then do; app= 1; inc= 0; iterate /*i*/; end /* \" ◄ */\n end /*i*/ /* [↓] pack two */\n /*lines ──► one.*/\n do j=minR to maxR by 2; jp= j + 1; $= $ + 1 /*fold two lines*/\n do k=1 for length($.j); top= substr($.j, k, 1) /*the 1st line.*/\n bot= word( substr($.jp, k, 1) 0, 1) /*the 2nd line.*/\n if top then if bot then !.$= !.$'█' /*has top & bot.*/\n else !.$= !.$'▀' /*has top,¬ bot.*/\n else if bot then !.$= !.$'▄' /*¬ top, has bot*/\n else !.$= !.$' ' /*¬ top, ¬ bot*/\n end /*k*/\n end /*j*/ /* [↓] show the prime spiral matrix.*/\n do m=1 for $; say !.m; end /*m*/\nsay; say init 'is the starting point,' ,\n tot 'numbers used,' #p \"primes found, largest prime:\" bigP\nexit /*stick a fork in it, we're all done. */\n/*──────────────────────────────────────────────────────────────────────────────────────*/\nisPrime: procedure; parse arg x; if wordpos(x, '2 3 5 7 11 13 17 19') \\==0 then return 1\n if x<17 then return 0; if x// 2 ==0 then return 0\n if x// 3 ==0 then return 0\n /*get the last digit*/ parse var x '' -1 _; if _==5 then return 0\n if x// 7 ==0 then return 0\n if x//11 ==0 then return 0\n if x//13 ==0 then return 0\n\n do j=17 by 6 until j*j > x; if x//j ==0 then return 0\n if x//(j+2) ==0 then return 0\n end /*j*/; return 1\n","language":"REXX"},{"code":"/*REXX program shows a clockwise Ulam spiral of primes shown in a square matrix.*/\nparse arg size init char . /*obtain optional arguments from the CL*/\nif size=='' | size==\",\" then size= 79 /*Not specified? Then use the default.*/\nif init=='' | init==\",\" then init= 1 /* \" \" \" \" \" \" */\nif char=='' then char= \"█\" /* \" \" \" \" \" \" */\ntot=size**2 /*the total number of numbers in spiral*/\n /*define the upper/bottom right corners*/\nuR.=0; bR.=0; do od=1 by 2 to tot; _=od**2+init; uR._=1; _=_+od; bR._=1; end /*od*/\n /*define the bottom/upper left corners.*/\nbL.=0; uL.=0; do ev=2 by 2 to tot; _=ev**2+init; bL._=1; _=_+ev; uL._=1; end /*ev*/\n\napp=1; bigP=0; #p=0; inc=0; minR=1; maxR=1; r=1; $=0; $.=; !.=\n /*▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒ construct the spiral #s.*/\n do i=init for tot; r= r + inc; minR= min(minR, r); maxR= max(maxR, r)\n x= isPrime(i); if x then bigP= max(bigP, i); #p= #p + x /*bigP, #primes.*/\n if app then $.r= $.r || x /*append token.*/\n else $.r= x || $.r /*prepend token.*/\n if uR.i then do; app= 1; inc= +1; iterate /*i*/; end /*advance ↓ */\n if bL.i then do; app= 0; inc= -1; iterate /*i*/; end /* \" ↑ */\n if bR.i then do; app= 0; inc= 0; iterate /*i*/; end /* \" ► */\n if uL.i then do; app= 1; inc= 0; iterate /*i*/; end /* \" ◄ */\n end /*i*/ /* [↓] pack two */\n /*lines ──► one.*/\n do j=minR to maxR by 2; jp= j + 1; $= $ + 1 /*fold two lines*/\n do k=1 for length($.j); top= substr($.j, k, 1) /*the 1st line.*/\n bot= word( substr($.jp, k, 1) 0, 1) /*the 2nd line.*/\n if top then if bot then !.$= !.$'█' /*has top & bot.*/\n else !.$= !.$'▀' /*has top,¬ bot.*/\n else if bot then !.$= !.$'▄' /*¬ top, has bot*/\n else !.$= !.$' ' /*¬ top, ¬ bot*/\n end /*k*/\n end /*j*/ /* [↓] show the prime spiral matrix.*/\n do m=1 for $; say !.m; end /*m*/\nsay; say init 'is the starting point,' ,\n tot 'numbers used,' #p \"primes found, largest prime:\" bigP\nexit /*stick a fork in it, we're all done. */\n/*──────────────────────────────────────────────────────────────────────────────────────*/\nisPrime: procedure; parse arg x; if wordpos(x, '2 3 5 7 11 13 17 19') \\==0 then return 1\n if x<17 then return 0; if x// 2 ==0 then return 0\n if x// 3 ==0 then return 0\n /*get the last digit*/ parse var x '' -1 _; if _==5 then return 0\n if x// 7 ==0 then return 0\n if x//11 ==0 then return 0\n if x//13 ==0 then return 0\n\n do j=17 by 6 until j*j > x; if x//j ==0 then return 0\n if x//(j+2) ==0 then return 0\n end /*j*/; return 1\n","language":"REXX"},{"code":"# Project : Ulam spiral (for primes)\n\nload \"guilib.ring\"\nload \"stdlib.ring\"\n\npaint = null\n\nnew qapp\n {\n win1 = new qwidget() {\n setwindowtitle(\"Ulam spiral\")\n setgeometry(100,100,560,600)\n label1 = new qlabel(win1) {\n setgeometry(10,10,800,600)\n settext(\"\")\n }\n new qpushbutton(win1) {\n setgeometry(220,500,100,30)\n settext(\"draw\")\n setclickevent(\"draw()\")\n }\n show()\n }\n exec()\n }\n\nfunc draw\n p1 = new qpicture()\n color = new qcolor() {\n setrgb(0,0,255,255)\n }\n pen = new qpen() {\n setcolor(color)\n setwidth(1)\n }\n paint = new qpainter() {\n begin(p1)\n setpen(pen)\n\n usn = 81\n ulamspiral(usn)\n\n endpaint()\n }\n label1 { setpicture(p1) show() }\n return\n\nfunc ulamspiral(nr)\n button = list(nr)\n win1{\n sizenew = sqrt(nr)\n for n = 1 to nr\n col = n%9\n if col = 0 col = 9 ok\n row = ceil(n/9)\n\n button[n] = new qpushbutton(win1)\n {\n setgeometry(60+col*40,60+row*40,40,40)\n setclickevent(\"movetile(\" + string(n) +\")\")\n show()\n }\n next\n n = 9\n result = newlist(n,n)\n k = 1\n top = 1\n bottom = n\n left = 1\n right = n\n while (k<=n*n)\n for i=left to right\n result[top][i]=k\n k = k + 1\n next\n top = top + 1\n for i=top to bottom\n result[i][right]=k\n k = k + 1\n next\n right = right - 1\n for i=right to left step -1\n result[bottom][i]=k\n k = k + 1\n next\n bottom = bottom - 1\n for i=bottom to top step -1\n result[i][left] = k\n k = k + 1\n next\n left = left + 1\n end\n for m = 1 to n\n for p = 1 to n\n pos = (m-1)*n + p\n if isprime(result[m][p])\n button[pos] {settext(string(result[m][p]))}\n ok\n next\n next\n }\n","language":"Ring"},{"code":"require 'prime'\n\ndef cell(n, x, y, start=1)\n y, x = y - n/2, x - (n - 1)/2\n l = 2 * [x.abs, y.abs].max\n d = y >= x ? l*3 + x + y : l - x - y\n (l - 1)**2 + d + start - 1\nend\n\ndef show_spiral(n, symbol=nil, start=1)\n puts \"\\nN : #{n}\"\n format = \"%#{(start + n*n - 1).to_s.size}s \"\n n.times do |y|\n n.times do |x|\n i = cell(n,x,y,start)\n if symbol\n print i.prime? ? symbol[0] : symbol[1]\n else\n print format % (i.prime? ? i : '')\n end\n end\n puts\n end\nend\n\nshow_spiral(9)\nshow_spiral(25)\nshow_spiral(25, \"# \")\n","language":"Ruby"},{"code":"require 'prime'\n\ndef spiral_generator(x=0, y=0)\n Enumerator.new do |yielder|\n yielder << [x, y] # start position\n dx, dy = 0, 1 # first direction\n yielder << [x+=dx, y+=dy] # second position\n 0.step do |i|\n 2.times do\n i.times{ yielder << [x+=dx, y+=dy] } # going straight\n dx, dy = -dy, dx # 90 degree turn\n yielder << [x+=dx, y+=dy]\n end\n end\n end\nend\n\ndef ulam_spiral(n, start=1)\n h = Hash.new(0)\n position = spiral_generator\n (start ... start+n*n).each do |i|\n pos = position.next\n h[pos] = 1 if i.prime?\n end\n\n chr = [[' ', '▄'], ['▀', '█']]\n (xmin, xmax), (ymin, ymax) = h.keys.transpose.map(&:minmax)\n (xmin..xmax).step(2).each do |x|\n puts (ymin..ymax).map{|y| chr[h[[x,y]]][h[[x+1,y]]]}.join\n end\nend\n\n[11, 122].each do |n|\n puts \"\\nN : #{n}\"\n ulam_spiral(n)\nend\n","language":"Ruby"},{"code":"use std::fmt;\n\nenum Direction { RIGHT, UP, LEFT, DOWN }\nuse ulam::Direction::*;\n\n/// Indicates whether an integer is a prime number or not.\nfn is_prime(a: u32) -> bool {\n match a {\n 2 => true,\n x if x <= 1 || x % 2 == 0 => false,\n _ => {\n let max = f64::sqrt(a as f64) as u32;\n let mut x = 3;\n while x <= max {\n if a % x == 0 { return false; }\n x += 2;\n }\n true\n }\n }\n}\n\npub struct Ulam { u : Vec<Vec<String>> }\n\nimpl Ulam {\n /// Generates one `Ulam` object.\n pub fn new(n: u32, s: u32, c: char) -> Ulam {\n let mut spiral = vec![vec![String::new(); n as usize]; n as usize];\n let mut dir = RIGHT;\n let mut y = (n / 2) as usize;\n let mut x = if n % 2 == 0 { y - 1 } else { y }; // shift left for even n's\n for j in s..n * n + s {\n spiral[y][x] = if is_prime(j) {\n if c == '\\0' { format!(\"{:4}\", j) } else { format!(\" {} \", c) }\n }\n else { String::from(\" ---\") };\n\n match dir {\n RIGHT => if x as u32 <= n - 1 && spiral[y - 1][x].is_empty() && j > s { dir = UP; },\n UP => if spiral[y][x - 1].is_empty() { dir = LEFT; },\n LEFT => if x == 0 || spiral[y + 1][x].is_empty() { dir = DOWN; },\n DOWN => if spiral[y][x + 1].is_empty() { dir = RIGHT; }\n };\n\n match dir { RIGHT => x += 1, UP => y -= 1, LEFT => x -= 1, DOWN => y += 1 };\n }\n Ulam { u: spiral }\n }\n}\n\nimpl fmt::Display for Ulam {\n fn fmt(&self, f: &mut fmt::Formatter) -> fmt::Result {\n for row in &self.u {\n writeln!(f, \"{}\", format!(\"{:?}\", row).replace(\"\\\"\", \"\").replace(\", \", \"\"));\n };\n writeln!(f, \"\")\n }\n}\n","language":"Rust"},{"code":"mod ulam;\nuse ulam::*;\n\n// Program entry point.\nfn main() {\n print!(\"{}\", Ulam::new(9, 1, '\\0'));\n print!(\"{}\", Ulam::new(9, 1, '*'));\n}\n","language":"Rust"},{"code":"object Ulam extends App {\n generate(9)()\n generate(9)('*')\n\n private object Direction extends Enumeration { val RIGHT, UP, LEFT, DOWN = Value }\n\n private def generate(n: Int, i: Int = 1)(c: Char = 0) {\n assert(n > 1, \"n > 1\")\n val s = new Array[Array[String]](n).transform {_ => new Array[String](n) }\n\n import Direction._\n var dir = RIGHT\n var y = n / 2\n var x = if (n % 2 == 0) y - 1 else y // shift left for even n's\n for (j <- i to n * n - 1 + i) {\n s(y)(x) = if (isPrime(j)) if (c == 0) \"%4d\".format(j) else s\" $c \" else \" ---\"\n\n dir match {\n case RIGHT => if (x <= n - 1 && s(y - 1)(x) == null && j > i) dir = UP\n case UP => if (s(y)(x - 1) == null) dir = LEFT\n case LEFT => if (x == 0 || s(y + 1)(x) == null) dir = DOWN\n case DOWN => if (s(y)(x + 1) == null) dir = RIGHT\n }\n\n dir match {\n case RIGHT => x += 1\n case UP => y -= 1\n case LEFT => x -= 1\n case DOWN => y += 1\n }\n }\n println(\"[\" + s.map(_.mkString(\"\")).reduceLeft(_ + \"]\\n[\" + _) + \"]\\n\")\n }\n\n private def isPrime(a: Int): Boolean = {\n if (a == 2) return true\n if (a <= 1 || a % 2 == 0) return false\n val max = Math.sqrt(a.toDouble).toInt\n for (n <- 3 to max by 2)\n if (a % n == 0) return false\n true\n }\n}\n","language":"Scala"},{"code":"require('Imager')\n \nvar (n=512, start=1, file='ulam.png')\n\nARGV.getopt(\n 'n=i' => \\n,\n 's=i' => \\start,\n 'f=s' => \\file,\n)\n \nfunc cell(n, x, y, start) {\n y -= (n >> 1)\n x -= (n-1 >> 1)\n var l = 2*(x.abs > y.abs ? x.abs : y.abs)\n var d = (y > x ? (l*3 + x + y) : (l - x - y))\n (l-1)**2 + d + start - 1\n}\n \nvar black = %O<Imager::Color>.new('#000000')\nvar white = %O<Imager::Color>.new('#FFFFFF')\n \nvar img = %O<Imager>.new(xsize => n, ysize => n, channels => 1)\nimg.box(filled => 1, color => white)\n \nfor y=(^n), x=(^n) {\n if (cell(n, x, y, start).is_prime) {\n img.setpixel(x => x, y => y, color => black)\n }\n}\n \nimg.write(file => file)\n","language":"Sidef"},{"code":"proc is_prime {n} {\n if {$n == 1} {return 0}\n if {$n in {2 3 5}} {return 1}\n for {set i 2} {$i*$i <= $n} {incr i} {\n if {$n % $i == 0} {return 0}\n }\n return 1\n}\n\nproc spiral {w h} {\n yield [info coroutine]\n set x [expr {$w / 2}]\n set y [expr {$h / 2}]\n set n 1\n set dir 0\n set steps 1\n set step 1\n while {1} {\n yield [list $x $y]\n switch $dir {\n 0 {incr x}\n 1 {incr y -1}\n 2 {incr x -1}\n 3 {incr y}\n }\n if {![incr step -1]} {\n set dir [expr {($dir+1)%4}]\n if {$dir % 2 == 0} {\n incr steps\n }\n set step $steps\n }\n }\n}\n\nset radius 16\nset side [expr {1 + 2 * $radius}]\nset n [expr {$side * $side}]\nset cells [lrepeat $side [lrepeat $side \"\"]]\nset i 1\n\ncoroutine spin spiral $side $side\n\nwhile {$i < $n} {\n lassign [spin] y x\n set c [expr {[is_prime $i] ? \"\\u169b\" : \" \"}]\n lset cells $x $y $c\n incr i\n}\n\nputs [join [lmap row $cells {join $row \" \"}] \\n]\n","language":"Tcl"},{"code":"Function build_spiral(n)\n\t'declare a two dimentional array\n\tDim matrix()\n\tReDim matrix(n-1,n-1)\n\t'determine starting point\n\tx = (n-1)/2 : y = (n-1)/2\n\t'set the initial iterations\n\tx_max = 1 : y_max = 1 : count = 1\n\t'set initial direction\n\tdir = \"R\"\n\t'populate the array\n\tFor i = 1 To n*n\n\t\tl = Len(n*n)\n\t\tIf IsPrime(i) Then\n\t\t\tmatrix(x,y) = Right(\"000\" & i,l)\n\t\tElse\n\t\t\tmatrix(x,y) = String(l,\"-\")\n\t\tEnd If\n\t\tSelect Case dir\n\t\t\tCase \"R\"\n\t\t\t\tIf x_max > 0 Then\n\t\t\t\t\tx = x + 1 : x_max = x_max - 1\n\t\t\t\tElse\n\t\t\t\t\tdir = \"U\" : y_max = count\n\t\t\t\t\ty = y - 1 : y_max = y_max - 1\n\t\t\t\tEnd If\n\t\t\tCase \"U\"\n\t\t\t\tIf y_max > 0 Then\n\t\t\t\t\ty = y - 1 : y_max = y_max - 1\n\t\t\t\tElse\n\t\t\t\t\tdir = \"L\" : count = count + 1 : x_max = count\n\t\t\t\t\tx = x - 1 : x_max = x_max - 1\n\t\t\t\tEnd If\n\t\t\tCase \"L\"\n\t\t\t\tIf x_max > 0 Then\n\t\t\t\t\tx = x - 1 : x_max = x_max - 1\n\t\t\t\tElse\n\t\t\t\t\tdir = \"D\" : y_max = count\n\t\t\t\t\ty = y + 1 : y_max = y_max - 1\n\t\t\t\tEnd If\n\t\t\tCase \"D\"\n\t\t\t\tIf y_max > 0 Then\n\t\t\t\t\ty = y + 1 : y_max = y_max - 1\n\t\t\t\tElse\n\t\t\t\t\tdir = \"R\" : count = count + 1 : x_max = count\n\t\t\t\t\tx = x + 1 : x_max = x_max - 1\n\t\t\t\tEnd If\n\t\tEnd Select\n\tNext\n\t'print the matrix\n\tFor y = 0 To n - 1\n\t\tFor x = 0 To n - 1\n\t\t\tIf x = n - 1 Then\n\t\t\t\tWScript.StdOut.Write matrix(x,y)\n\t\t\tElse\n\t\t\t\tWScript.StdOut.Write matrix(x,y) & vbTab\n\t\t\tEnd If\n\t\tNext\n\t\tWScript.StdOut.WriteLine\n\tNext\nEnd Function\n\nFunction IsPrime(n)\n\tIf n = 2 Then\n\t\tIsPrime = True\n\tElseIf n <= 1 Or n Mod 2 = 0 Then\n\t\tIsPrime = False\n\tElse\n\t\tIsPrime = True\n\t\tFor i = 3 To Int(Sqr(n)) Step 2\n\t\t\tIf n Mod i = 0 Then\n\t\t\t\tIsPrime = False\n\t\t\t\tExit For\n\t\t\tEnd If\n\t\tNext\n\tEnd If\nEnd Function\n\n'test with 9\nbuild_spiral(9)\n","language":"VBScript"},{"code":"import \"./dynamic\" for Enum\nimport \"./math\" for Int\nimport \"./str\" for Char\nimport \"./fmt\" for Fmt\n\nvar Direction = Enum.create(\"Direction\", [\"right\", \"up\", \"left\", \"down\"])\n\nclass Ulam {\n static generate(n, i, c) {\n if (n <= 1) Fiber.abort (\"'n' must be more than 1.\")\n var s = List.filled(n, null)\n for (i in 0...n) s[i] = List.filled(n, \"\")\n var dir = Direction.right\n var y = (n/2).floor\n var x = (n % 2 == 0) ? y - 1 : y // shift left for even n's\n for (j in i..n * n - 1 + i) {\n s[y][x] = Int.isPrime(j) ? (Char.isDigit(c) ? Fmt.d(4, j) : \" %(c) \") : \" ---\"\n if (dir == Direction.right) {\n if (x <= n - 1 && s[y - 1][x] == \"\" && j > i) dir = Direction.up\n } else if (dir == Direction.up) {\n if (s[y][x - 1] == \"\") dir = Direction.left\n } else if (dir == Direction.left) {\n if (x == 0 || s[y + 1][x] == \"\") dir = Direction.down\n } else if (dir == Direction.down) {\n if (s[y][x + 1] == \"\") dir = Direction.right\n }\n\n if (dir == Direction.right) {\n x = x + 1\n } else if (dir == Direction.up) {\n y = y - 1\n } else if (dir == Direction.left) {\n x = x - 1\n } else if (dir == Direction.down) {\n y = y + 1\n }\n }\n\n for (row in s) Fmt.print(\"$s\", row)\n System.print()\n }\n}\n\nUlam.generate(9, 1, \"0\") // with digits\nUlam.generate(9, 1, \"*\") // with *\n","language":"Wren"},{"code":"func IsPrime(N); \\Return 'true' if N is prime\nint N, I;\n[if N <= 2 then return N = 2;\nif (N&1) = 0 then \\even >2\\ return false;\nfor I:= 3 to sqrt(N) do\n [if rem(N/I) = 0 then return false;\n I:= I+1;\n ];\nreturn true;\n];\n\nint N, X, Y, Len, Dir, DX, DY, Side, Step;\n[SetVid($13);\nX:= 320/2; Y:= 200/2;\nN:= 1;\nLen:= 1;\nDir:= 0; \\Rt, Up, Lt, Dn\nDX:= [1, 0, -1, 0];\nDY:= [0, -1, 0, 1];\nrepeat for Side:= 1 to 2 do\n [for Step:= 1 to Len do\n [if IsPrime(N) then Point(X, Y, $F);\n N:= N+1;\n X:= X + DX(Dir); \\move in current direction\n Y:= Y + DY(Dir);\n ];\n Dir:= (Dir+1) & 3; \\set next direction\n ];\n Len:= Len+1;\nuntil Y = 0; \\reached top\n]\n","language":"XPL0"},{"code":"sub is_prime(n)\n local p\n\n for p=2 to n\n if p*p>n break\n if mod(n,p)=0 return false\n next\n return n>=2\nend sub\n\nsub spiral(w, h, x, y)\n if y then\n return w+spiral(h-1,w,y-1,w-x-1)\n else\n return x\n end if\nend sub\n\nw = 9 : h = 9\nfor i=h-1 to 0 step -1\n for j=w-1 to 0 step -1\n p = w*h-spiral(w,h,j,i)\n print mid$(\" o\", is_prime(p) + 1, 1);\n next\n print\nnext\n","language":"Yabasic"},{"code":"var primes =Utils.Generator(Import(\"sieve.zkl\").postponed_sieve); // lazy\nvar offsets=Utils.cycle( T(0,1),T(-1,0),T(0,-1),T(1,0) ); // (N,E,S,W), lazy\nconst BLACK=0, WHITE=0xff|ff|ff, GREEN=0x00|ff|00, EMPTY=0x080|80|80;\nfcn uspiral(N){\n if((M:=N).isEven) M+=1; // need odd width, height\n img,p := PPM(M,M,EMPTY), primes.next(); // 2 .. 250,007: 22,045 primes\n x,y,n := N/2,x,2; img[x,y]=GREEN; x+=1; // start on 2 facing \"north\"\n while(True){\n ox,oy:=offsets.next(); leftx,lefty:=offsets.peek(); // set direction\n while(True){\n\t img[x,y]=( if(n==p){ p=primes.next(); WHITE } else BLACK );\n\t if(n==N*N) break(2); // all done\n\t n+=1;\n\t if(img[x+leftx,y+lefty]==EMPTY) // nothing to my left, turn left\n\t { x+=leftx; y+=lefty; break; }\n\t x+=ox; y+=oy;\t// move in a straight line\n }\n }\n img\n}\n\nuspiral(500).write(File(\"ulamSpiral.ppm\",\"wb\"));\n","language":"Zkl"},{"code":" 1 IF n<max THEN LET n=n+1: FOR p=2 TO n-1: LET r= (INT (n/p)<>n/p): IF r THEN NEXT p\n 2 IF p=n THEN LET pr=pr+1: LET kx=(255-xx AND k<3)+(xx AND k>2): LET ky=(175-yy AND (k=1 OR k=3)+(yy AND (k=2 OR k=4))): PLOT kx,ky: PRINT #0;AT 0,0;n;\" pr\";pr\n 3 RETURN\n 10 CLS : PRINT \"ULAM SPIRAL OF PRIME's\"'''\"it takes DAYS at max level\"'\"and 3.5MHz\"\n 12 INPUT \"square size= LxL\"'\"l: \";l: IF l<>INT l OR l<1 OR l>176 THEN GO TO 12\n 13 LET max=l*l: PRINT ''l;\"x\";l;\"=\";max;\" positive integers\"\n 15 INPUT \"0,0 orientation 1-4: \";k: IF k<1 OR k>4 THEN GO TO 15\n 20 CLS : LET xx=127: LET yy=88: LET n=0: LET pr=0: PRINT #0;AT 0,15;max\n 40 FOR q=0 TO l: LET m=INT (q/2)=q/2: LET m=-1*m+NOT m\n 60 FOR x=0 TO q*m STEP m: GO SUB 1 : LET xx=xx+m: NEXT x\n 80 FOR y=0 TO q*m STEP m: GO SUB 1 : LET yy=yy+m: NEXT y: NEXT q\n","language":"ZX-Spectrum-Basic"}],"string":"[\n {\n \"code\": \"---\\nfrom: http://rosettacode.org/wiki/Ulam_spiral_(for_primes)\\nnote: Prime Numbers\\n\",\n \"language\": \"00-META\"\n },\n {\n \"code\": \"An Ulam spiral (of primes) is a method of visualizing primes when expressed in a (normally counter-clockwise) outward spiral (usually starting at <big>'''1'''</big>), constructed on a square grid, starting at the \\\"center\\\". \\n\\nAn Ulam spiral is also known as a ''prime spiral''. \\n\\nThe first grid (green) is shown with sequential integers, starting at <big>'''1'''</big>. \\n\\nIn an Ulam spiral of primes, only the primes are shown (usually indicated by some glyph such as a dot or asterisk), and all non-primes as shown as a blank (or some other whitespace). \\n\\nOf course, the grid and border are not to be displayed (but they are displayed here when using these Wiki HTML tables).\\n\\nNormally, the spiral starts in the \\\"center\\\", and the 2<sup>nd</sup> number is to the viewer's right and the number spiral starts from there in a counter-clockwise direction. \\n\\nThere are other geometric shapes that are used as well, including clock-wise spirals. \\n\\nAlso, some spirals (for the 2<sup>nd</sup> number) is viewed upwards from the 1<sup>st</sup> number instead of to the right, but that is just a matter of orientation.\\n\\nSometimes, the starting number can be specified to show more visual striking patterns (of prime densities).\\n\\n[A larger than necessary grid (numbers wise) is shown here to illustrate the pattern of numbers on the diagonals (which may be used by the method to orientate the direction of spiral-construction algorithm within the example computer programs)]. \\n\\nThen, in the next phase in the transformation of the Ulam prime spiral, the non-primes are translated to blanks. \\n\\nIn the orange grid below, the primes are left intact, and all non-primes are changed to blanks. \\n\\nThen, in the final transformation of the Ulam spiral (the yellow grid), translate the primes to a glyph such as a <big><big><b> • </b></big></big> or some other suitable glyph.\\n<br>\\n\\n{| class=\\\"wikitable\\\" style=\\\"float:left;border: 2px solid black; background:lightgreen; color:black; margin-left:0;margin-right:auto;text-align:center;width:34em;height:34em;table-layout:fixed;font-size:70%\\\"\\n|-\\n| <big><big>'''65'''</big></big> || <big><big>'''64'''</big></big> || <big><big>'''63'''</big></big> || <big><big>'''62'''</big></big> || <big><big>'''61'''</big></big> || <big><big>'''60'''</big></big> || <big><big>'''59'''</big></big> || <big><big>'''58'''</big></big> || <big><big>'''57'''</big></big>\\n|->\\n| <big><big>'''66'''</big></big> || <big><big>'''37'''</big></big> || <big><big>'''36'''</big></big> || <big><big>'''35'''</big></big> || <big><big>'''34'''</big></big> || <big><big>'''33'''</big></big> || <big><big>'''32'''</big></big> || <big><big>'''31'''</big></big> || <big><big>'''56'''</big></big>\\n|-\\n| <big><big>'''67'''</big></big> || <big><big>'''38'''</big></big> || <big><big>'''17'''</big></big> || <big><big>'''16'''</big></big> || <big><big>'''15'''</big></big> || <big><big>'''14'''</big></big> || <big><big>'''13'''</big></big> || <big><big>'''30'''</big></big> || <big><big>'''55'''</big></big>\\n|-\\n| <big><big>'''68'''</big></big> || <big><big>'''39'''</big></big> || <big><big>'''18'''</big></big> || <big><big>''' 5'''</big></big> || <big><big>''' 4'''</big></big> || <big><big>''' 3'''</big></big> || <big><big>'''12'''</big></big> || <big><big>'''29'''</big></big> || <big><big>'''54'''</big></big>\\n|-\\n| <big><big>'''69'''</big></big> || <big><big>'''40'''</big></big> || <big><big>'''19'''</big></big> || <big><big>''' 6'''</big></big> || <big><big>''' 1'''</big></big> || <big><big>''' 2'''</big></big> || <big><big>'''11'''</big></big> || <big><big>'''28'''</big></big> || <big><big>'''53'''</big></big>\\n|-\\n| <big><big>'''70'''</big></big> || <big><big>'''41'''</big></big> || <big><big>'''20'''</big></big> || <big><big>''' 7'''</big></big> || <big><big>''' 8'''</big></big> || <big><big>''' 9'''</big></big> || <big><big>'''10'''</big></big> || <big><big>'''27'''</big></big> || <big><big>'''52'''</big></big>\\n|-\\n| <big><big>'''71'''</big></big> || <big><big>'''42'''</big></big> || <big><big>'''21'''</big></big> || <big><big>'''22'''</big></big> || <big><big>'''23'''</big></big> || <big><big>'''24'''</big></big> || <big><big>'''25'''</big></big> || <big><big>'''26'''</big></big> || <big><big>'''51'''</big></big>\\n|-\\n| <big><big>'''72'''</big></big> || <big><big>'''43'''</big></big> || <big><big>'''44'''</big></big> || <big><big>'''45'''</big></big> || <big><big>'''46'''</big></big> || <big><big>'''47'''</big></big> || <big><big>'''48'''</big></big> || <big><big>'''49'''</big></big> || <big><big>'''50'''</big></big>\\n|-\\n| <big><big>'''73'''</big></big> || <big><big>'''74'''</big></big> || <big><big>'''75'''</big></big> || <big><big>'''76'''</big></big> || <big><big>'''77'''</big></big> || <big><big>'''78'''</big></big> || <big><big>'''79'''</big></big> || <big><big>'''80'''</big></big> || <big><big>'''81'''</big></big>\\n|}\\n\\n{| class=\\\"wikitable\\\" style=\\\"float:left;border: 2px solid black; background:orange; color:black; margin-left:20px;margin-right:auto;text-align:center;width:34em;height:34em;table-layout:fixed;font-size:70%\\\"\\n|-\\n| <big><big>''' '''</big></big> || <big><big>''' '''</big></big> || <big><big>''' '''</big></big> || <big><big>''' '''</big></big> || <big><big>'''61'''</big></big> || <big><big>''' '''</big></big> || <big><big>'''59'''</big></big> || <big><big>''' '''</big></big> || <big><big>''' '''</big></big>\\n|-\\n| <big><big>''' '''</big></big> || <big><big>'''37'''</big></big> || <big><big>''' '''</big></big> || <big><big>''' '''</big></big> || <big><big>''' '''</big></big> || <big><big>''' '''</big></big> || <big><big>''' '''</big></big> || <big><big>'''31'''</big></big> || <big><big>''' '''</big></big>\\n|-\\n| <big><big>'''67'''</big></big> || <big><big>''' '''</big></big> || <big><big>'''17'''</big></big> || <big><big>''' '''</big></big> || <big><big>''' '''</big></big> || <big><big>''' '''</big></big> || <big><big>'''13'''</big></big> || <big><big>''' '''</big></big> || <big><big>''' '''</big></big>\\n|-\\n| <big><big>''' '''</big></big> || <big><big>''' '''</big></big> || <big><big>''' '''</big></big> || <big><big>''' 5'''</big></big> || <big><big>''' '''</big></big> || <big><big>''' 3'''</big></big> || <big><big>''' '''</big></big> || <big><big>'''29'''</big></big> || <big><big>''' '''</big></big>\\n|-\\n| <big><big>''' '''</big></big> || <big><big>''' '''</big></big> || <big><big>'''19'''</big></big> || <big><big>''' '''</big></big> || <big><big>''' '''</big></big> || <big><big>''' 2'''</big></big> || <big><big>'''11'''</big></big> || <big><big>''' '''</big></big> || <big><big>'''53'''</big></big>\\n|-\\n| <big><big>''' '''</big></big> || <big><big>'''41'''</big></big> || <big><big>''' '''</big></big> || <big><big>''' 7'''</big></big> || <big><big>''' '''</big></big> || <big><big>''' '''</big></big> || <big><big>''' '''</big></big> || <big><big>''' '''</big></big> || <big><big>''' '''</big></big>\\n|-\\n| <big><big>'''71'''</big></big> || <big><big>''' '''</big></big> || <big><big>''' '''</big></big> || <big><big>''' '''</big></big> || <big><big>'''23'''</big></big> || <big><big>''' '''</big></big> || <big><big>''' '''</big></big> || <big><big>''' '''</big></big> || <big><big>''' '''</big></big>\\n|-\\n| <big><big>''' '''</big></big> || <big><big>'''43'''</big></big> || <big><big>''' '''</big></big> || <big><big>''' '''</big></big> || <big><big>''' '''</big></big> || <big><big>'''47'''</big></big> || <big><big>''' '''</big></big> || <big><big>''' '''</big></big> || <big><big>''' '''</big></big>\\n|-\\n| <big><big>'''73'''</big></big> || <big><big>''' '''</big></big> || <big><big>''' '''</big></big> || <big><big>''' '''</big></big> || <big><big>''' '''</big></big> || <big><big>''' '''</big></big> || <big><big>'''79'''</big></big> || <big><big>''' '''</big></big> || <big><big>''' '''</big></big>\\n|}\\n\\n{| class=\\\"wikitable\\\" style=\\\"float:left;border: 2px solid black; background:yellow; color:black; margin-left:20px;margin-right:auto;text-align:center;width:34em;height:34em;table-layout:fixed;font-size:70%\\\"\\n|-\\n| <big><big>''' '''</big></big> || <big><big>''' '''</big></big> || <big><big>''' '''</big></big> || <big><big>''' '''</big></big> || <big><big>''' •'''</big></big> || <big><big>''' '''</big></big> || <big><big>''' •'''</big></big> || <big><big>''' '''</big></big> || <big><big>''' '''</big></big>\\n|-\\n| <big><big>''' '''</big></big> || <big><big>''' •'''</big></big> || <big><big>''' '''</big></big> || <big><big>''' '''</big></big> || <big><big>''' '''</big></big> || <big><big>''' '''</big></big> || <big><big>''' '''</big></big> || <big><big>''' •'''</big></big> || <big><big>''' '''</big></big>\\n|-\\n| <big><big>''' •'''</big></big> || <big><big>''' '''</big></big> || <big><big>''' •'''</big></big> || <big><big>''' '''</big></big> || <big><big>''' '''</big></big> || <big><big>''' '''</big></big> || <big><big>''' •'''</big></big> || <big><big>''' '''</big></big> || <big><big>''' '''</big></big>\\n|-\\n| <big><big>''' '''</big></big> || <big><big>''' '''</big></big> || <big><big>''' '''</big></big> || <big><big>''' •'''</big></big> || <big><big>''' '''</big></big> || <big><big>''' •'''</big></big> || <big><big>''' '''</big></big> || <big><big>''' •'''</big></big> || <big><big>''' '''</big></big>\\n|-\\n| <big><big>''' '''</big></big> || <big><big>''' '''</big></big> || <big><big>''' •'''</big></big> || <big><big>''' '''</big></big> || <big><big>''' '''</big></big> || <big><big>''' •'''</big></big> || <big><big>''' •'''</big></big> || <big><big>''' '''</big></big> || <big><big>''' •'''</big></big>\\n|-\\n| <big><big>''' '''</big></big> || <big><big>''' •'''</big></big> || <big><big>''' '''</big></big> || <big><big>''' •'''</big></big> || <big><big>''' '''</big></big> || <big><big>''' '''</big></big> || <big><big>''' '''</big></big> || <big><big>''' '''</big></big> || <big><big>''' '''</big></big>\\n|-\\n| <big><big>''' •'''</big></big> || <big><big>''' '''</big></big> || <big><big>''' '''</big></big> || <big><big>''' '''</big></big> || <big><big>''' •'''</big></big> || <big><big>''' '''</big></big> || <big><big>''' '''</big></big> || <big><big>''' '''</big></big> || <big><big>''' '''</big></big>\\n|-\\n| <big><big>''' '''</big></big> || <big><big>''' •'''</big></big> || <big><big>''' '''</big></big> || <big><big>''' '''</big></big> || <big><big>''' '''</big></big> || <big><big>''' •'''</big></big> || <big><big>''' '''</big></big> || <big><big>''' '''</big></big> || <big><big>''' '''</big></big>\\n|-\\n| <big><big>''' •'''</big></big> || <big><big>''' '''</big></big> || <big><big>''' '''</big></big> || <big><big>''' '''</big></big> || <big><big>''' '''</big></big> || <big><big>''' '''</big></big> || <big><big>''' •'''</big></big> || <big><big>''' '''</big></big> || <big><big>''' '''</big></big>\\n|}\\n\\n\\n<br style=\\\"clear:both\\\">\\nThe Ulam spiral becomes more visually obvious as the grid increases in size. \\n\\n\\n;Task\\nFor any sized <big>'''N × N'''</big> grid, construct and show an Ulam spiral (counter-clockwise) of primes starting at some specified initial number (the default would be '''1'''), with some suitably ''dotty'' (glyph) representation to indicate primes, and the absence of dots to indicate non-primes. \\n\\nYou should demonstrate the generator by showing at Ulam prime spiral large enough to (almost) fill your terminal screen.\\n\\n\\n;Related tasks:\\n* [[Spiral matrix]]\\n* [[Zig-zag matrix]]\\n* [[Identity matrix]] \\n* [[Sequence of primes by Trial Division]]\\n\\n\\n;See also\\n* Wikipedia entry: [http://en.wikipedia.org/wiki/Ulam_spiral Ulam spiral] \\n* MathWorld™ entry: [http://mathworld.wolfram.com/PrimeSpiral.html Prime Spiral]\\n<br><br>\\n\\n\",\n \"language\": \"00-TASK\"\n },\n {\n \"code\": \"F cell(n, =x, =y, start = 1)\\n V d = 0\\n y = y - n I/ 2\\n x = x - (n - 1) I/ 2\\n V l = 2 * max(abs(x), abs(y))\\n d = I y >= x {(l * 3 + x + y)} E (l - x - y)\\n R (l - 1) ^ 2 + d + start - 1\\n\\nF show_spiral(n, symbol = ‘# ’, start = 1, =space = ‘’)\\n V top = start + n * n + 1\\n V is_prime = [0B, 0B, 1B] [+] [1B, 0B] * (top I/ 2)\\n L(x) 3 .< 1 + Int(sqrt(top))\\n I !is_prime[x]\\n L.continue\\n L(i) (x * x .< top).step(x * 2)\\n is_prime[i] = 0B\\n\\n (Int -> String) f = _ -> @symbol\\n\\n I space == ‘’\\n space = ‘ ’ * symbol.len\\n\\n I symbol.empty\\n V max_str = String(n * n + start - 1).len\\n I space == ‘’\\n space = (‘.’ * max_str)‘ ’\\n f = x -> String(x).rjust(@max_str)‘ ’\\n\\n V cell_str = x -> I @is_prime[x] {@f(x)} E @space\\n\\n L(y) 0 .< n\\n print((0 .< n).map(x -> cell(@n, x, @y, @start)).map(v -> @cell_str(v)).join(‘’))\\n print()\\n\\nshow_spiral(10, symbol' ‘# ’, space' ‘ ’)\\nshow_spiral(9, symbol' ‘’, space' ‘ - ’)\\n\",\n \"language\": \"11l\"\n },\n {\n \"code\": \"* Ulam spiral 26/04/2016\\nULAM CSECT\\n USING ULAM,R13 set base register\\nSAVEAREA B STM-SAVEAREA(R15) skip savearea\\n DC 17F'0' savearea\\nSTM STM R14,R12,12(R13) prolog\\n ST R13,4(R15) save previous SA\\n ST R15,8(R13) linkage in previous SA\\n LR R13,R15 establish addressability\\n LA R5,1 n=1\\n LH R8,NSIZE x=nsize\\n SRA R8,1\\n LA R8,1(R8) x=nsize/2+1\\n LR R9,R8 y=x\\n LR R1,R5 n\\n BAL R14,ISPRIME\\n C R0,=F'1' if isprime(n)\\n BNE NPRMJ0\\n BAL R14,SPIRALO spiral(x,y)=o\\nNPRMJ0 LA R5,1(R5) n=n+1\\n LA R6,1 i=1\\nLOOPI1 LH R2,NSIZE do i=1 to nsize-1 by 2\\n BCTR R2,0\\n CR R6,R2 if i>nsize-1\\n BH ELOOPI1\\n LR R7,R6 j=i; do j=1 to i\\nLOOPJ1 LA R8,1(R8) x=x+1\\n LR R1,R5 n\\n BAL R14,ISPRIME\\n C R0,=F'1' if isprime(n)\\n BNE NPRMJ1\\n BAL R14,SPIRALO spiral(x,y)=o\\nNPRMJ1 LA R5,1(R5) n=n+1\\n BCT R7,LOOPJ1 next j\\nELOOPJ1 LR R7,R6 j=i; do j=1 to i\\nLOOPJ2 BCTR R9,0 y=y-1\\n LR R1,R5 n\\n BAL R14,ISPRIME\\n C R0,=F'1' if isprime(n)\\n BNE NPRMJ2\\n BAL R14,SPIRALO spiral(x,y)=o\\nNPRMJ2 LA R5,1(R5) n=n+1\\n BCT R7,LOOPJ2 next j\\nELOOPJ2 LR R7,R6 j=i\\n LA R7,1(R7) j=i+1; do j=1 to i+1\\nLOOPJ3 BCTR R8,0 x=x-1\\n LR R1,R5 n\\n BAL R14,ISPRIME\\n C R0,=F'1' if isprime(n)\\n BNE NPRMJ3\\n BAL R14,SPIRALO spiral(x,y)=o\\nNPRMJ3 LA R5,1(R5) n=n+1\\n BCT R7,LOOPJ3 next j\\nELOOPJ3 LR R7,R6 j=i\\n LA R7,1(R7) j=i+1; do j=1 to i+1\\nLOOPJ4 LA R9,1(R9) y=y+1\\n LR R1,R5 n\\n BAL R14,ISPRIME\\n C R0,=F'1' if isprime(n)\\n BNE NPRMJ4\\n BAL R14,SPIRALO spiral(x,y)=o\\nNPRMJ4 LA R5,1(R5) n=n+1\\n BCT R7,LOOPJ4 next j\\nELOOPJ4 LA R6,2(R6) i=i+2\\n B LOOPI1\\nELOOPI1 LH R7,NSIZE j=nsize\\n BCTR R7,0 j=nsize-1; do j=1 to nsize-1\\nLOOPJ5 LA R8,1(R8) x=x+1\\n LR R1,R5 n\\n BAL R14,ISPRIME\\n C R0,=F'1' if isprime(n)\\n BNE NPRMJ5\\n BAL R14,SPIRALO spiral(x,y)=o\\nNPRMJ5 LA R5,1(R5) n=n+1\\n BCT R7,LOOPJ5 next j\\nELOOPJ5 LA R6,1 i=1\\nLOOPI2 CH R6,NSIZE do i=1 to nsize\\n BH ELOOPI2\\n LA R10,PG reset buffer\\n LA R7,1 j=1\\nLOOPJ6 CH R7,NSIZE do j=1 to nsize\\n BH ELOOPJ6\\n LR R1,R7 j\\n BCTR R1,0 (j-1)\\n MH R1,NSIZE (j-1)*nsize\\n AR R1,R6 r1=(j-1)*nsize+i\\n LA R14,SPIRAL-1(R1) @spiral(j,i)\\n MVC 0(1,R10),0(R14) output spiral(j,i)\\n LA R10,1(R10) pgi=pgi+1\\n LA R7,1(R7) j=j+1\\n B LOOPJ6\\nELOOPJ6 XPRNT PG,80 print\\n LA R6,1(R6) i=i+1\\n B LOOPI2\\nELOOPI2 L R13,4(0,R13) reset previous SA\\n LM R14,R12,12(R13) restore previous env\\n XR R15,R15 set return code\\n BR R14 call back\\nISPRIME CNOP 0,4 ---------- isprime function\\n C R1,=F'2' if nn=2\\n BNE NOT2\\n LA R0,1 rr=1\\n B ELOOPII\\nNOT2 C R1,=F'2' if nn<2\\n BL RRZERO\\n LR R2,R1 nn\\n LA R4,2 2\\n SRDA R2,32 shift\\n DR R2,R4 nn/2\\n C R2,=F'0' if nn//2=0\\n BNE TAGII\\nRRZERO SR R0,R0 rr=0\\n B ELOOPII\\nTAGII LA R0,1 rr=1\\n LA R4,3 ii=3\\nLOOPII LR R3,R4 ii\\n MR R2,R4 ii*ii\\n CR R3,R1 if ii*ii<=nn\\n BH ELOOPII\\n LR R3,R1 nn\\n LA R2,0 clear\\n DR R2,R4 nn/ii\\n LTR R2,R2 if nn//ii=0\\n BNZ NEXTII\\n SR R0,R0 rr=0\\n B ELOOPII\\nNEXTII LA R4,2(R4) ii=ii+2\\n B LOOPII\\nELOOPII BR R14 ---------- end isprime return rr\\nSPIRALO CNOP 0,4 ---------- spiralo subroutine\\n LR R1,R8 x\\n BCTR R1,0 x-1\\n MH R1,NSIZE (x-1)*nsize\\n AR R1,R9 r1=(x-1)*nsize+y\\n LA R10,SPIRAL-1(R1) r10=@spiral(x,y)\\n MVC 0(1,R10),O spiral(x,y)=o\\n BR R14 ---------- end spiralo\\nNS EQU 79 4n+1\\nNSIZE DC AL2(NS) =H'ns'\\nO DC CL1'*' if prime\\nPG DC CL80' ' buffer\\n LTORG\\nSPIRAL DC (NS*NS)CL1' '\\n YREGS\\n END ULAM\\n\",\n \"language\": \"360-Assembly\"\n },\n {\n \"code\": \"generic\\n Size: Positive;\\n -- determines the size of the square\\n with function Represent(N: Natural) return String;\\n -- this turns a number into a string to be printed\\n -- the length of the output should not change\\n -- e.g., Represent(N) may return \\\" #\\\" if N is a prime\\n -- and \\\" \\\" else\\n with procedure Put_String(S: String);\\n -- outputs a string, no new line\\n with procedure New_Line;\\n -- the name says all\\npackage Generic_Ulam is\\n\\n procedure Print_Spiral;\\n -- calls Put_String(Represent(I)) N^2 times\\n -- and New_Line N times\\n\\nend Generic_Ulam;\\n\",\n \"language\": \"Ada\"\n },\n {\n \"code\": \"package body Generic_Ulam is\\n\\n subtype Index is Natural range 0 .. Size-1;\\n subtype Number is Positive range 1 .. Size**2;\\n\\n function Cell(Row, Column: Index) return Number is\\n -- outputs the number at the given position in the square\\n -- taken from the Python solution\\n X: Integer := Column - (Size-1)/2;\\n Y: Integer := Row - Size/2;\\n MX: Natural := abs(X);\\n MY: Natural := abs(Y);\\n L: Natural := 2 * Natural'Max(MX, MY);\\n D: Integer;\\n begin\\n if Y >= X then\\n D := 3 * L + X + Y;\\n else\\n D := L - X - Y;\\n end if;\\n return (L-1) ** 2 + D;\\n end Cell;\\n\\n procedure Print_Spiral is\\n N: Number;\\n begin\\n for R in Index'Range loop\\n for C in Index'Range loop\\n N := Cell(R, C);\\n Put_String(Represent(N));\\n end loop;\\n New_Line;\\n end loop;\\n end Print_Spiral;\\n\\nend Generic_Ulam;\\n\",\n \"language\": \"Ada\"\n },\n {\n \"code\": \"with Generic_Ulam, Ada.Text_IO, Prime_Numbers;\\n\\nprocedure Ulam is\\n\\n package P is new Prime_Numbers(Natural, 0, 1, 2);\\n\\n function Vis(N: Natural) return String is\\n (if P.Is_Prime(N) then \\\" <>\\\" else \\\" \\\");\\n\\n function Num(N: Natural) return String is\\n (if P.Is_Prime(N) then\\n\\t(if N < 10 then \\\" \\\" elsif N < 100 then \\\" \\\" else \\\"\\\") & Natural'Image(N)\\n else \\\" ---\\\");\\n\\n procedure NL is\\n begin\\n Ada.Text_IO.New_Line;\\n end NL;\\n\\n package Numeric is new Generic_Ulam(29, Num, Ada.Text_IO.Put, NL);\\n package Visual is new Generic_Ulam(10, Vis, Ada.Text_IO.Put, NL);\\n\\nbegin\\n Numeric.Print_Spiral;\\n NL;\\n Visual.Print_Spiral;\\nend Ulam;\\n\",\n \"language\": \"Ada\"\n },\n {\n \"code\": \"BEGIN # construct a Ulam spiral for primes #\\n PR read \\\"primes.incl.a68\\\" PR # include prime utilities #\\n # prints a Ulam spiral for primes with the specified width, #\\n # starting from init. Primes will be indicated by prime char and #\\n # non-primes by composite char. The center of the spiral will be #\\n # indicated by center char - unless the center value is prime #\\n PROC print ulam spiral for primes = ( INT width, init, CHAR prime char, composite char, center char )VOID:\\n IF width >= 1 THEN\\n INT n = IF ODD width THEN width ELSE width + 1 FI;\\n []BOOL prime = PRIMESIEVE ( init + ( n * n ) );\\n [ 1 : n, 1 : n ]CHAR spiral; FOR i TO n DO FOR j TO n DO spiral[ i, j ] := \\\"_\\\" OD OD;\\n INT y := ( n + 1 ) OVER 2;\\n INT x := y;\\n INT v := init;\\n spiral[ x, y ] := IF prime[ init ] THEN prime char ELSE center char FI;\\n INT w := 0;\\n WHILE x < 1 UPB spiral DO\\n w +:= 2;\\n x +:= 1;\\n y +:= 1;\\n FOR i TO w DO # right edge #\\n spiral[ x, y -:= 1 ] := IF prime[ v +:= 1 ] THEN prime char ELSE composite char FI\\n OD;\\n FOR i TO w DO # top edge #\\n spiral[ x -:= 1, y ] := IF prime[ v +:= 1 ] THEN prime char ELSE composite char FI\\n OD;\\n FOR i TO w DO # left edge #\\n spiral[ x, y +:= 1 ] := IF prime[ v +:= 1 ] THEN prime char ELSE composite char FI\\n OD;\\n FOR i TO w DO # bottom edge #\\n spiral[ x +:= 1, y ] := IF prime[ v +:= 1 ] THEN prime char ELSE composite char FI\\n OD\\n OD;\\n FOR v pos TO width DO\\n FOR h pos TO width DO\\n print( ( spiral[ h pos, v pos ] ) )\\n OD;\\n print( ( newline ) )\\n OD\\n FI # ulam spiral for primes # ;\\n\\n print ulam spiral for primes( 35, 1, \\\"#\\\", \\\" \\\", \\\"+\\\" )\\nEND\\n\",\n \"language\": \"ALGOL-68\"\n },\n {\n \"code\": \"#include <stdio.h>\\n#include <stdint.h>\\n#include <stdlib.h>\\n#include <math.h>\\n\\ntypedef uint32_t bitsieve;\\n\\nunsigned sieve_check(bitsieve *b, const unsigned v)\\n{\\n if ((v != 2 && !(v & 1)) || (v < 2))\\n return 0;\\n else\\n return !(b[v >> 6] & (1 << (v >> 1 & 31)));\\n}\\n\\nbitsieve* sieve(const unsigned v)\\n{\\n unsigned i, j;\\n bitsieve *b = calloc((v >> 6) + 1, sizeof(uint32_t));\\n\\n for (i = 3; i <= sqrt(v); i += 2)\\n if (!(b[i >> 6] & (1 << (i >> 1 & 31))))\\n for (j = i*i; j < v; j += (i << 1))\\n b[j >> 6] |= (1 << (j >> 1 & 31));\\n\\n return b;\\n}\\n\\n#define max(x,y) ((x) > (y) ? (x) : (y))\\n\\n/* This mapping taken from python solution */\\nint ulam_get_map(int x, int y, int n)\\n{\\n x -= (n - 1) / 2;\\n y -= n / 2;\\n\\n int mx = abs(x), my = abs(y);\\n int l = 2 * max(mx, my);\\n int d = y >= x ? l * 3 + x + y : l - x - y;\\n\\n return pow(l - 1, 2) + d;\\n}\\n\\n/* Passing a value of 0 as glyph will print numbers */\\nvoid output_ulam_spiral(int n, const char glyph)\\n{\\n /* An even side length does not make sense, use greatest odd value < n */\\n n -= n % 2 == 0 ? 1 : 0;\\n\\n const char *spaces = \\\".................\\\";\\n int mwidth = log10(n * n) + 1;\\n\\n bitsieve *b = sieve(n * n + 1);\\n int x, y;\\n\\n for (x = 0; x < n; ++x) {\\n for (y = 0; y < n; ++y) {\\n int z = ulam_get_map(y, x, n);\\n\\n if (glyph == 0) {\\n if (sieve_check(b, z))\\n printf(\\\"%*d \\\", mwidth, z);\\n else\\n printf(\\\"%.*s \\\", mwidth, spaces);\\n }\\n else {\\n printf(\\\"%c\\\", sieve_check(b, z) ? glyph : spaces[0]);\\n }\\n }\\n printf(\\\"\\\\n\\\");\\n }\\n\\n free(b);\\n}\\n\\nint main(int argc, char *argv[])\\n{\\n const int n = argc < 2 ? 9 : atoi(argv[1]);\\n\\n output_ulam_spiral(n, 0);\\n printf(\\\"\\\\n\\\");\\n\\n output_ulam_spiral(n, '#');\\n printf(\\\"\\\\n\\\");\\n\\n return 0;\\n}\\n\",\n \"language\": \"C\"\n },\n {\n \"code\": \"#include <stdio.h>\\n#include <stdlib.h>\\n\\nint isprime(int n)\\n{\\n\\tint p;\\n\\tfor (p = 2; p*p <= n; p++)\\n\\t\\tif (n%p == 0) return 0;\\n\\treturn n > 2;\\n}\\n\\nint spiral(int w, int h, int x, int y)\\n{\\n\\treturn y ? w + spiral(h - 1, w, y - 1, w - x - 1) : x;\\n}\\n\\nint main(int c, char **v)\\n{\\n\\tint i, j, w = 50, h = 50, s = 1;\\n\\tif (c > 1 && (w = atoi(v[1])) <= 0) w = 50;\\n\\tif (c > 2 && (h = atoi(v[2])) <= 0) h = w;\\n\\tif (c > 3 && (s = atoi(v[3])) <= 0) s = 1;\\n\\n\\tfor (i = 0; i < h; i++) {\\n\\t\\tfor (j = 0; j < w; j++)\\n\\t\\t\\tputchar(isprime(w*h + s - 1 - spiral(w, h, j, i))[\\\" #\\\"]);\\n\\t\\tputchar('\\\\n');\\n\\t}\\n\\treturn 0;\\n}\\n\",\n \"language\": \"C\"\n },\n {\n \"code\": \"#include <cmath>\\n#include <iostream>\\n#include <string>\\n#include <iomanip>\\n#include <vector>\\n\\nclass ulamSpiral {\\npublic:\\n void create( unsigned n, unsigned startWith = 1 ) {\\n _lst.clear();\\n if( !( n & 1 ) ) n++;\\n _mx = n;\\n unsigned v = n * n;\\n _wd = static_cast<unsigned>( log10( static_cast<long double>( v ) ) ) + 1;\\n for( unsigned u = 0; u < v; u++ )\\n _lst.push_back( -1 );\\n\\n arrange( startWith );\\n\\n }\\n void display( char c ) {\\n if( !c ) displayNumbers();\\n else displaySymbol( c );\\n }\\n\\nprivate:\\n bool isPrime( unsigned u ) {\\n if( u < 4 ) return u > 1;\\n if( !( u % 2 ) || !( u % 3 ) ) return false;\\n\\n unsigned q = static_cast<unsigned>( sqrt( static_cast<long double>( u ) ) ),\\n c = 5;\\n while( c <= q ) {\\n if( !( u % c ) || !( u % ( c + 2 ) ) ) return false;\\n c += 6;\\n }\\n return true;\\n }\\n void arrange( unsigned s ) {\\n unsigned stp = 1, n = 1, posX = _mx >> 1,\\n posY = posX, stC = 0;\\n int dx = 1, dy = 0;\\n\\n while( posX < _mx && posY < _mx ) {\\n _lst.at( posX + posY * _mx ) = isPrime( s ) ? s : 0;\\n s++;\\n\\n if( dx ) {\\n posX += dx;\\n if( ++stC == stp ) {\\n dy = -dx;\\n dx = stC = 0;\\n }\\n } else {\\n posY += dy;\\n if( ++stC == stp ) {\\n dx = dy;\\n dy = stC = 0;\\n stp++;\\n }\\n }\\n }\\n }\\n void displayNumbers() {\\n unsigned ct = 0;\\n for( std::vector<unsigned>::iterator i = _lst.begin(); i != _lst.end(); i++ ) {\\n if( *i ) std::cout << std::setw( _wd ) << *i << \\\" \\\";\\n else std::cout << std::string( _wd, '*' ) << \\\" \\\";\\n if( ++ct >= _mx ) {\\n std::cout << \\\"\\\\n\\\";\\n ct = 0;\\n }\\n }\\n std::cout << \\\"\\\\n\\\\n\\\";\\n }\\n void displaySymbol( char c ) {\\n unsigned ct = 0;\\n for( std::vector<unsigned>::iterator i = _lst.begin(); i != _lst.end(); i++ ) {\\n if( *i ) std::cout << c;\\n else std::cout << \\\" \\\";\\n if( ++ct >= _mx ) {\\n std::cout << \\\"\\\\n\\\";\\n ct = 0;\\n }\\n }\\n std::cout << \\\"\\\\n\\\\n\\\";\\n }\\n\\n std::vector<unsigned> _lst;\\n unsigned _mx, _wd;\\n};\\n\\nint main( int argc, char* argv[] )\\n{\\n ulamSpiral ulam;\\n ulam.create( 9 );\\n ulam.display( 0 );\\n ulam.create( 35 );\\n ulam.display( '#' );\\n return 0;\\n}\\n\",\n \"language\": \"C++\"\n },\n {\n \"code\": \"#pragma once\\n\\n#include <cmath>\\n#include <sstream>\\n#include <iomanip>\\n\\ninline bool is_prime(unsigned a) {\\n if (a == 2) return true;\\n if (a <= 1 || a % 2 == 0) return false;\\n const unsigned max(std::sqrt(a));\\n for (unsigned n = 3; n <= max; n += 2) if (a % n == 0) return false;\\n return true;\\n}\\n\\nenum direction { RIGHT, UP, LEFT, DOWN };\\nconst char* N = \\\" ---\\\";\\n\\ntemplate<const unsigned SIZE>\\nclass Ulam\\n{\\npublic:\\n Ulam(unsigned start = 1, const char c = '\\\\0') {\\n direction dir = RIGHT;\\n unsigned y = SIZE / 2;\\n unsigned x = SIZE % 2 == 0 ? y - 1 : y; // shift left for even n's\\n for (unsigned j = start; j <= SIZE * SIZE - 1 + start; j++) {\\n if (is_prime(j)) {\\n std::ostringstream os(\\\"\\\");\\n if (c == '\\\\0') os << std::setw(4) << j;\\n else os << \\\" \\\" << c << ' ';\\n s[y][x] = os.str();\\n }\\n else s[y][x] = N;\\n\\n switch (dir) {\\n case RIGHT : if (x <= SIZE - 1 && s[y - 1][x].empty() && j > start) { dir = UP; }; break;\\n case UP : if (s[y][x - 1].empty()) { dir = LEFT; }; break;\\n case LEFT : if (x == 0 || s[y + 1][x].empty()) { dir = DOWN; }; break;\\n case DOWN : if (s[y][x + 1].empty()) { dir = RIGHT; }; break;\\n }\\n\\n switch (dir) {\\n case RIGHT : x += 1; break;\\n case UP : y -= 1; break;\\n case LEFT : x -= 1; break;\\n case DOWN : y += 1; break;\\n }\\n }\\n }\\n\\n template<const unsigned S> friend std::ostream& operator <<(std::ostream&, const Ulam<S>&);\\n\\nprivate:\\n std::string s[SIZE][SIZE];\\n};\\n\\ntemplate<const unsigned SIZE>\\nstd::ostream& operator <<(std::ostream& os, const Ulam<SIZE>& u) {\\n for (unsigned i = 0; i < SIZE; i++) {\\n os << '[';\\n for (unsigned j = 0; j < SIZE; j++) os << u.s[i][j];\\n os << ']' << std::endl;\\n }\\n return os;\\n}\\n\",\n \"language\": \"C++\"\n },\n {\n \"code\": \"#include <cstdlib>\\n#include <iostream>\\n#include \\\"ulam.hpp\\\"\\n\\nint main(const int argc, const char* argv[]) {\\n using namespace std;\\n\\n cout << Ulam<9>() << endl;\\n const Ulam<9> v(1, '*');\\n cout << v << endl;\\n\\n\\treturn EXIT_SUCCESS;\\n}\\n\",\n \"language\": \"C++\"\n },\n {\n \"code\": \"(defun ulam-spiral (n)\\n (loop for a in (spiral n n (* n n)) do\\n (format t \\\"~{~d~}~%\\\" a)))\\n\\n(defun spiral\\n (n m b &aux (row (loop for a below n\\n collect (if (primep (- b a))\\n '* '#\\\\space))))\\n (if (= m 1) (list row)\\n (cons row (mapcar #'reverse\\n (apply #'mapcar #'list\\n (spiral (1- m) n\\n (- b n)))))))\\n(defun primep (n)\\n (when (> n 1) (loop for a from 2 to (isqrt n)\\n never (zerop (mod n a)))))\\n\",\n \"language\": \"Common-Lisp\"\n },\n {\n \"code\": \"enum Direction\\n RIGHT\\n UP\\n LEFT\\n DOWN\\nend\\n\\ndef generate(n : Int32, i : Int32, c : Int32 | String)\\n s = Array.new(n) { Array.new(n) { \\\"\\\" } }\\n\\n dir = Direction::RIGHT\\n y = n // 2\\n x = n % 2 == 0 ? y - 1 : y\\n\\n j = 1\\n while j <= n * n - 1 + i\\n s[y][x] = is_prime(j) ? j.to_s : c.to_s\\n\\n # printf \\\"j: %s, x: %s, y: %s \\\\n\\\", j, x, y\\n\\n case dir\\n when Direction::RIGHT\\n dir = Direction::UP if x <= n - 1 && s[y - 1][x] == \\\"\\\" && j > i\\n when Direction::UP\\n dir = Direction::LEFT if s[y][x - 1] == \\\"\\\"\\n when Direction::LEFT\\n dir = Direction::DOWN if x == 0 || s[y + 1][x] == \\\"\\\"\\n when Direction::DOWN\\n dir = Direction::RIGHT if s[y][x + 1] == \\\"\\\"\\n end\\n\\n case dir\\n when Direction::RIGHT\\n x += 1\\n when Direction::UP\\n y -= 1\\n when Direction::LEFT\\n x -= 1\\n when Direction::DOWN\\n y += 1\\n end\\n\\n j += 1\\n end\\n\\n s.map(&.join(\\\"\\\\t\\\")).join(\\\"\\\\n\\\")\\nend\\n\\ndef is_prime(n : Int32) : Bool\\n return true if n == 2\\n return false if n % 2 == 0 || n < 1\\n\\n i = 3\\n while i <= Math.sqrt(n)\\n return false if n % i == 0\\n i += 2\\n end\\n\\n true\\nend\\n\\nputs generate 7, 1, \\\"*\\\"\\n\",\n \"language\": \"Crystal\"\n },\n {\n \"code\": \"import std.stdio, std.math, std.algorithm, std.array, std.range;\\n\\nint cell(in int n, int x, int y, in int start=1) pure nothrow @safe @nogc {\\n x = x - (n - 1) / 2;\\n y = y - n / 2;\\n immutable l = 2 * max(x.abs, y.abs);\\n immutable d = (y > x) ? (l * 3 + x + y) : (l - x - y);\\n return (l - 1) ^^ 2 + d + start - 1;\\n}\\n\\nvoid showSpiral(in int n, in string symbol=\\\"# \\\", in int start=1, string space=null) /*@safe*/ {\\n if (space is null)\\n space = \\\" \\\".replicate(symbol.length);\\n\\n immutable top = start + n ^^ 2 + 1;\\n auto isPrime = [false, false, true] ~ [true, false].replicate(top / 2);\\n foreach (immutable x; 3 .. 1 + cast(int)real(top).sqrt) {\\n if (!isPrime[x])\\n continue;\\n foreach (immutable i; iota(x ^^ 2, top, x * 2))\\n isPrime[i] = false;\\n }\\n\\n string cellStr(in int x) pure nothrow @safe @nogc {\\n return isPrime[x] ? symbol : space;\\n }\\n\\n foreach (immutable y; 0 .. n)\\n n.iota.map!(x => cell(n, x, y, start)).map!cellStr.joiner.writeln;\\n}\\n\\nvoid main() {\\n 35.showSpiral;\\n}\\n\",\n \"language\": \"D\"\n },\n {\n \"code\": \"import std.stdio, std.math, std.algorithm, std.array, grayscale_image;\\n\\nuint cell(in uint n, int x, int y, in uint start=1) pure nothrow @safe @nogc {\\n x = x - (n - 1) / 2;\\n y = y - n / 2;\\n immutable l = 2 * max(x.abs, y.abs);\\n immutable d = (y > x) ? (l * 3 + x + y) : (l - x - y);\\n return (l - 1) ^^ 2 + d + start - 1;\\n}\\n\\nbool[] primes(in uint n, in uint top, in uint start=1) pure nothrow @safe {\\n auto isPrime = [false, false, true] ~ [true, false].replicate(top / 2);\\n\\n foreach (immutable x; 3 .. 1 + cast(uint)real(top).sqrt)\\n if (isPrime[x])\\n for (uint i = x ^^ 2; i < top; i += x * 2)\\n isPrime[i] = false;\\n return isPrime;\\n}\\n\\nvoid main() {\\n enum n = 512;\\n enum start = 1;\\n immutable top = start + n ^^ 2 + 1;\\n immutable isPrime = primes(n, top, start);\\n auto img = new Image!Gray(n, n);\\n\\n foreach (immutable y; 0 .. n)\\n foreach (immutable x; 0 .. n)\\n img[x, y] = isPrime[cell(n, x, y, start)] ? Gray.black : Gray.white;\\n\\n img.savePGM(\\\"ulam_spiral.pgm\\\");\\n}\\n\",\n \"language\": \"D\"\n },\n {\n \"code\": \"procedure DrawMatrixPrimes(Image: TImage; Mat: TMatrix);\\n{Display spiral, only marking cells that contain prime numbers}\\nvar X,Y: integer;\\nvar S: string;\\nvar Size,Step: integer;\\nvar Off: TSize;\\nvar R: TRect;\\nbegin\\n{Calculate size of grid}\\nSize:=Min(Image.Width,Image.Height);\\nStep:=Size div Length(Mat);\\n{Draw border rectangle}\\nImage.Canvas.Brush.Color:=clGreen;\\nImage.Canvas.Pen.Width:=4;\\nImage.Canvas.Rectangle(2,2,Length(Mat)*Step,Length(Mat)*Step);\\n{Setup font}\\nImage.Canvas.Font.Name:='Arial';\\nImage.Canvas.Font.Style:=[fsBold];\\nImage.Canvas.Font.Size:=14;\\n{Draw grid}\\nImage.Canvas.Pen.Width:=1;\\n{Draw vertical lines}\\nfor X:=0 to Length(Mat) do\\n\\tbegin\\n\\tImage.Canvas.MoveTo(X*Step,0);\\n\\tImage.Canvas.LineTo(X*Step,Step*Length(Mat));\\n\\tend;\\n{Draw horizontal lines}\\nfor Y:=0 to Length(Mat) do\\n\\tbegin\\n\\tImage.Canvas.MoveTo(0,Y*Step);\\n\\tImage.Canvas.LineTo(Step*Length(Mat),Y*Step);\\n\\tend;\\n{Label cells that contain primes}\\nfor Y:=0 to High(Mat[0]) do\\n for X:=0 to High(Mat) do\\n if IsPrime(trunc(Mat[X,Y])) then\\n\\tbegin\\n\\t{Color cells}\\n\\tR:=Rect((X*Step)+2,(Y*Step)+2,X*Step+Step,Y*Step+Step);\\n\\tInflateRect(R,-1,-1);\\n\\tImage.Canvas.Pen.Width:=4;\\n\\tImage.Canvas.Pen.Color:=clBlue;\\n\\tImage.Canvas.Brush.Color:=clLime;\\n\\tImage.Canvas.Rectangle(R);\\n\\t{Label cell}\\n\\tS:=Format('%0.0f',[Mat[X,Y]]);\\n\\tOff:=Image.Canvas.TextExtent(S);\\n\\tOff.CX:=(Step-Off.CX) div 2;\\n\\tOff.CY:=(Step-Off.CY) div 2;\\n\\tImage.Canvas.TextOut(X*Step+Off.CX,Y*Step+Off.CY,S);\\n\\tend;\\nImage.Invalidate;\\nend;\\n\\n\\n\\nprocedure MakeSqrSpiralMatrix(var Mat: TMatrix; MatSize: integer);\\n{Create a spiral matrix of specified size}\\nvar Inx: integer;\\nvar R: TRect;\\n\\n\\n\\n\\tprocedure DoTopRect(Off1,Off2: integer);\\n\\t{Do top part of rectangle}\\n\\tvar X,Y: integer;\\n\\tbegin\\n\\tfor X:=R.Left+Off1 to R.Right+Off2 do\\n\\t\\tbegin\\n\\t\\tMat[X,R.Top]:=Inx;\\n\\t\\tDec(Inx);\\n\\t\\tend;\\n\\tend;\\n\\n\\tprocedure DoRightRect(Off1,Off2: integer);\\n\\t{Do Right part of rectangle}\\n\\tvar X,Y: integer;\\n\\tbegin\\n\\tfor Y:=R.Top+Off1 to R.Bottom+Off2 do\\n\\t\\tbegin\\n\\t\\tMat[R.Right,Y]:=Inx;\\n\\t\\tDec(Inx);\\n\\t\\tend;\\n\\tend;\\n\\n\\n\\tprocedure DoBottomRect(Off1,Off2: integer);\\n\\t{Do bottom part of rectangle}\\n\\tvar X,Y: integer;\\n\\tbegin\\n\\tfor X:= R.Right+Off1 downto R.Left+Off2 do\\n\\t\\tbegin\\n\\t\\tMat[X,R.Bottom]:=Inx;\\n\\t\\tDec(Inx);\\n\\t\\tend;\\n\\tend;\\n\\n\\tprocedure DoLeftRect(Off1,Off2: integer);\\n\\t{Do left part of rectangle}\\n\\tvar X,Y: integer;\\n\\tbegin\\n\\tfor Y:=R.Bottom+Off1 downto R.Top+Off2 do\\n\\t\\tbegin\\n\\t\\tMat[R.Left,Y]:=Inx;\\n\\t\\tDec(Inx);\\n\\t\\tend;\\n\\tend;\\n\\n\\n\\tprocedure DoRect(R: TRect; var Inx: integer);\\n\\t{Create one rotation of spiral around the rectangle}\\n\\tbegin\\n\\t{The orientation of spiral is based in the size}\\n\\tif (MatSize and 1)=0 then\\n\\t\\tbegin\\n\\t\\t{Handle even sizes}\\n\\t\\tDoTopRect(0,0);\\n\\t\\tDoRightRect(1,0);\\n\\t\\tDoBottomRect(-1,0);\\n\\t\\tDoLeftRect(-1,1);\\n\\t\\tend\\n\\telse\\n\\t\\tbegin\\n\\t\\t{Handle odd sizes}\\n\\t\\tDoBottomRect(0,0);\\n\\t\\tDoLeftRect(-1,0);\\n\\t\\tDoTopRect(1,0);\\n\\t\\tDoRightRect(1,-1);\\n\\t\\tend\\n\\tend;\\n\\n\\n\\nbegin\\n{Set matrix size}\\nSetLength(Mat,MatSize,MatSize);\\n{create matching rectangle}\\nR:=Rect(0,0,MatSize-1,MatSize-1);\\nInx:=MatSize*MatSize;\\n{draw spiral around retangle and deflate rectanle until spiral is done}\\nwhile (R.Left<=R.Right) and (R.Top<=R.Bottom) do\\n\\tbegin\\n\\tDoRect(R,Inx);\\n\\tInflateRect(R,-1,-1);\\n\\tend;\\nend;\\n\\n\\n\\nprocedure UlamPrimeSpiral(Image: TImage);\\nvar Mat: TMatrix;\\nbegin\\nMakeSqrSpiralMatrix(Mat,9);\\nDrawMatrixPrimes(Image,Mat);\\nend;\\n\",\n \"language\": \"Delphi\"\n },\n {\n \"code\": \"func isprim num .\\n if num < 2\\n return 0\\n .\\n i = 2\\n while i <= sqrt num\\n if num mod i = 0\\n return 0\\n .\\n i += 1\\n .\\n return 1\\n.\\nn = 1\\nx = 50\\ny = 50\\ndx = 1\\ndy = 0\\n#\\nproc turn . .\\n if dx = 1\\n dx = 0\\n dy = 1\\n elif dy = 1\\n dy = 0\\n dx = -1\\n elif dx = -1\\n dx = 0\\n dy = -1\\n else\\n dx = 1\\n dy = 0\\n .\\n.\\nproc step . .\\n n += 1\\n x += dx * 1\\n y += dy * 1\\n move x y\\n if isprim n = 1\\n circle 0.5\\n .\\n.\\ntextsize 3\\nmove x y\\nlng = 0\\n#\\nfor k to 49\\n step\\n lng += 2\\n turn\\n for j to lng - 1\\n step\\n .\\n for i to 3\\n turn\\n for j to lng\\n step\\n .\\n .\\n.\\n\",\n \"language\": \"EasyLang\"\n },\n {\n \"code\": \"(lib 'plot)\\n\\n(define *red* (rgb 1 0 0))\\n(define (ulam n nmax) (if ( prime? n) *red* (gray (// n nmax))))\\n(plot-spiral ulam 1000) ;; range [0...1000]\\n\",\n \"language\": \"EchoLisp\"\n },\n {\n \"code\": \"defmodule Ulam do\\n defp cell(n, x, y, start) do\\n y = y - div(n, 2)\\n x = x - div(n - 1, 2)\\n l = 2 * max(abs(x), abs(y))\\n d = if y >= x, do: l*3 + x + y, else: l - x - y\\n (l - 1)*(l - 1) + d + start - 1\\n end\\n\\n def show_spiral(n, symbol\\\\\\\\nil, start\\\\\\\\1) do\\n IO.puts \\\"\\\\nN : #{n}\\\"\\n if symbol==nil, do: format = \\\"~#{length(to_char_list(start + n*n - 1))}s \\\"\\n prime = prime(n*n + start)\\n Enum.each(0..n-1, fn y ->\\n Enum.each(0..n-1, fn x ->\\n i = cell(n, x, y, start)\\n if symbol do\\n IO.write if i in prime, do: Enum.at(symbol,0), else: Enum.at(symbol,1)\\n else\\n :io.fwrite format, [if i in prime do to_char_list(i) else \\\"\\\" end]\\n end\\n end)\\n IO.puts \\\"\\\"\\n end)\\n end\\n\\n defp prime(num), do: prime(Enum.to_list(2..num), [])\\n defp prime([], p), do: Enum.reverse(p)\\n defp prime([h|t], p), do: prime((for i <- t, rem(i,h)>0, do: i), [h|p])\\nend\\n\\nUlam.show_spiral(9)\\nUlam.show_spiral(25)\\nUlam.show_spiral(25, [\\\"#\\\",\\\" \\\"])\\n\",\n \"language\": \"Elixir\"\n },\n {\n \"code\": \"PROGRAM SPIRAL\\n\\n!$INTEGER\\n\\nCONST RIGHT=1,UP=2,LEFT=3,DOWN=4\\n\\n!$DYNAMIC\\nDIM SPIRAL$[0,0]\\n\\nPROCEDURE PRT_ULAM(N)\\n FOR ROW=0 TO N DO\\n FOR COL=0 TO N DO\\n PRINT(SPIRAL$[ROW,COL];)\\n END FOR\\n PRINT\\n END FOR\\n PRINT\\n GET(K$)\\n FOR ROW=0 TO N DO\\n FOR COL=0 TO N DO\\n IF VAL(SPIRAL$[ROW,COL])<>0 THEN PRINT(\\\" * \\\";) ELSE PRINT(SPIRAL$[ROW,COL];) END IF\\n END FOR\\n PRINT\\n END FOR\\nEND PROCEDURE\\n\\nPROCEDURE IS_PRIME(A->RES%)\\n LOCAL N\\n IF A=2 THEN RES%=TRUE EXIT PROCEDURE END IF\\n IF A<=1 OR (A MOD 2=0) THEN RES%=FALSE EXIT PROCEDURE END IF\\n MAX=SQR(A)\\n FOR N=3 TO MAX STEP 2 DO\\n IF (A MOD N=0) THEN RES%=FALSE EXIT PROCEDURE END IF\\n END FOR\\n RES%=TRUE\\nEND PROCEDURE\\n\\nPROCEDURE GEN_ULAM(N,I)\\n DIR=RIGHT\\n J=I\\n Y=INT(N/2)\\n IF (N MOD 2=0) THEN X=Y-1 ELSE X=Y END IF ! shift left for even n's\\n WHILE J<=(N*N)-1+I DO\\n\\n IS_PRIME(J->RES%)\\n IF RES% THEN SPIRAL$[Y,X]=RIGHT$(\\\" \\\"+STR$(J),4) ELSE SPIRAL$[Y,X]=\\\" ---\\\" END IF\\n\\n CASE DIR OF\\n RIGHT->\\n IF (X<=(N-1) AND SPIRAL$[Y-1,X]=\\\"\\\" AND J>I) THEN DIR=UP END IF\\n END ->\\n UP->\\n IF SPIRAL$[Y,X-1]=\\\"\\\" THEN DIR=LEFT END IF\\n END ->\\n LEFT->\\n IF (X=0) OR SPIRAL$[Y+1,X]=\\\"\\\" THEN DIR=DOWN END IF\\n END ->\\n DOWN->\\n IF SPIRAL$[Y,X+1]=\\\"\\\" THEN DIR=RIGHT END IF\\n END ->\\n END CASE\\n\\n CASE DIR OF\\n RIGHT-> X=X+1 END ->\\n UP-> Y=Y-1 END ->\\n LEFT-> X=X-1 END ->\\n DOWN-> Y=Y+1 END ->\\n END CASE\\n J=J+1\\n END WHILE\\n PRT_ULAM(N)\\nEND PROCEDURE\\n\\nBEGIN\\n N=9\\n !$DIM SPIRAL$[N,N]\\n GEN_ULAM(N,1)\\nEND PROGRAM\\n\",\n \"language\": \"ERRE\"\n },\n {\n \"code\": \"USING: arrays grouping kernel math math.combinatorics\\nmath.matrices math.primes math.ranges math.statistics\\nprettyprint sequences sequences.repeating ;\\nIN: rosetta-code.ulam-spiral\\n\\n: counts ( n -- seq ) 1 [a,b] 2 repeat rest ;\\n\\n: vals ( n -- seq )\\n [ -1 swap neg 2dup [ neg ] bi@ 4array ] [ 2 * 1 - cycle ] bi ;\\n\\n: evJKT2 ( n -- seq )\\n [ counts ] [ vals ] bi [ <array> ] 2map concat ;\\n\\n: spiral ( n -- matrix )\\n [ evJKT2 cum-sum inverse-permutation ] [ group ] bi ;\\n\\n: ulam-spiral ( n -- matrix )\\n spiral dup dim first sq 1 -\\n [ swap - 1 + prime? \\\"o \\\" \\\" \\\" ? ] curry matrix-map ;\\n\\n: ulam-demo ( -- ) 21 ulam-spiral simple-table. ;\\n\\nMAIN: ulam-demo\\n\",\n \"language\": \"Factor\"\n },\n {\n \"code\": \" 43 constant border \\\\ grid size is border x border\\n border border * constant size\\n\\n variable crawler \\\\ position of the crawler\\n\\n : set.crawler border 2 mod 0= if \\\\ positions the crawler in the middle of the grid\\n\\t size 2 / border 2/ + 1 - crawler !\\n\\t else\\n\\t size 2 / crawler ! then ;\\n\\t\\n set.crawler\\n create Grid size cells allot \\\\ creates the grid\\n here constant GridEnd \\\\ used for debugging\\n\\n : is.divisor\\n\\tover 2over\\n\\tmod 0= swap drop + ;\\n\\n : sub.one\\n\\t swap 1 - swap ;\\n\\n : next.div\\n\\t is.divisor sub.one ;\\n\\n : three.test \\\\ counts divisors for numbers bigger than 2\\n\\t dup 0\\n begin\\n\\t next.div\\n over 1 = until\\n\\t swap drop\\n\\t swap drop 1 + ;\\n\\t\\n : not.prime \\\\ counts the number of divisors. Primes have exactly two.\\n dup\\n 2 < if drop true else\\n\\tthree.test then ;\\n\\n : sub.four \\\\ the crawler takes a number from the stack as direction\\n\\t dup 4 > if 4 - then ; \\\\ this word makes the number roll over.\\n \\\\ 1-right 2-up 3-left 4-down\\n : craw.left \\\\ rotates the crawler 90 degrees counter-clockwise\\n\\t 1 + sub.four ;\\n\\n : scan.right\\n\\t grid crawler @ 1 + cells + @ 0= ; \\\\ checks if cell to the right of the crawler is zero\\n\\n : scan.left\\n\\t grid crawler @ 1 - cells + @ 0= ; \\\\ cell to the left\\n\\n : scan.up\\n\\t grid crawler @ border - cells + @ 0= ; \\\\ cell above\\n\\n : scan.down\\n\\t grid crawler @ border + cells + @ 0= ; \\\\ and cell below\\n\\n : crawler.go \\\\ moves crawler one cell ahead checks cell to the left...\\n\\t dup \\\\ ...of the direction the crawler is facing, if zero, turns\\n\\t 1 = if crawler @ 1 + crawler ! scan.up if craw.left then else\\n\\t dup\\n\\t 2 = if crawler @ border - crawler ! scan.left if craw.left then else\\n\\t dup\\n\\t 3 = if crawler @ 1 - crawler ! scan.down if craw.left then else\\n\\t dup\\n\\t 4 = if crawler @ border + crawler ! scan.right if craw.left then else\\n\\t\\n\\t then then then then ;\\n\\t\\n : run.crawler \\\\ crawler moves through the grid and fills it with numbers\\n\\t border 2 < if 1 grid 0 cells + ! else \\\\ if the grid is a single cell, puts 1 in it\\n\\t crawler @ border - crawler !\\t \\\\ crawler moves one step and turn before setting the first...\\n\\t 4 \\\\ ...number so it is repositioned one cell up facing down\\n \\t size -1 * 0 do i\\n\\t i -1 * grid crawler @ cells + ! drop\\n\\t crawler.go\\n\\t -1 +loop then drop ;\\n\\n : leave.primes \\\\ removes non-primes from the grid\\n\\t size 0 do i\\n\\t grid i cells + @ not.prime if 0 grid i cells + ! then drop\\n\\t loop ;\\n\\n : star.draw1 \\\\ draws a \\\"*\\\" where number is not zero\\n\\t 0> if 42 emit else 32 emit\\n\\t then ;\\n\\n : star.draw2\\n\\t 0> if 42 emit 32 emit else 32 emit 32 emit \\\\ same but adds a space for better presentation\\n\\t then ;\\n\\n : star.draw3\\n\\t 0> if 32 emit 42 emit 32 emit else 32 emit 32 emit 32 emit \\\\ adds two spaces\\n\\t then ;\\n\\n : draw.grid \\\\ cuts the array into lines and displays it\\n\\tpage\\n\\tsize 0 do i\\n\\ti border mod 0= if cr then\\n\\tgrid i cells + @ star.draw2 drop \\\\ may use star.draw1 or 3 here\\n\\tloop ;\\n\\t\\n : ulam.spiral run.crawler leave.primes draw.grid ; \\\\ draws the spiral. Execute this word to run.\\n\",\n \"language\": \"Forth\"\n },\n {\n \"code\": \"program ulam\\n implicit none\\n\\n integer, parameter :: nsize = 49\\n integer :: i, j, n, x, y\\n integer :: a(nsize*nsize) = (/ (i, i = 1, nsize*nsize) /)\\n character(1) :: spiral(nsize, nsize) = \\\" \\\"\\n character(2) :: sstr\\n character(10) :: fmt\\n\\n n = 1\\n x = nsize / 2 + 1\\n y = x\\n if(isprime(a(n))) spiral(x, y) = \\\"O\\\"\\n n = n + 1\\n\\n do i = 1, nsize-1, 2\\n do j = 1, i\\n x = x + 1\\n if(isprime(a(n))) spiral(x, y) = \\\"O\\\"\\n n = n + 1\\n end do\\n\\n do j = 1, i\\n y = y - 1\\n if(isprime(a(n))) spiral(x, y) = \\\"O\\\"\\n n = n + 1\\n end do\\n\\n do j = 1, i+1\\n x = x - 1\\n if(isprime(a(n))) spiral(x, y) = \\\"O\\\"\\n n = n + 1\\n end do\\n\\n do j = 1, i+1\\n y = y + 1\\n if(isprime(a(n))) spiral(x, y) = \\\"O\\\"\\n n = n + 1\\n end do\\n end do\\n\\n do j = 1, nsize-1\\n x = x + 1\\n if(isprime(a(n))) spiral(x, y) = \\\"O\\\"\\n n = n + 1\\n end do\\n\\n write(sstr, \\\"(i0)\\\") nsize\\n fmt = \\\"(\\\" // sstr // \\\"(a,1x))\\\"\\n do i = 1, nsize\\n write(*, fmt) spiral(:, i)\\n end do\\n\\ncontains\\n\\nfunction isprime(number)\\n logical :: isprime\\n integer, intent(in) :: number\\n integer :: i\\n\\n if(number == 2) then\\n isprime = .true.\\n else if(number < 2 .or. mod(number,2) == 0) then\\n isprime = .false.\\n else\\n isprime = .true.\\n do i = 3, int(sqrt(real(number))), 2\\n if(mod(number,i) == 0) then\\n isprime = .false.\\n exit\\n end if\\n end do\\n end if\\nend function\\nend program\\n\",\n \"language\": \"Fortran\"\n },\n {\n \"code\": \" SUBROUTINE ULAMSPIRAL(START,ORDER)\\t!Idle scribbles can lead to new ideas.\\nCareful with phasing: each lunge's first number is the second placed along its direction.\\n INTEGER START\\t!Usually 1.\\n INTEGER ORDER\\t!MUST be an odd number, so there is a middle.\\n INTEGER L,M,N\\t!Counters.\\n INTEGER STEP,LUNGE\\t!In some direction.\\n COMPLEX WAY,PLACE\\t!Just so.\\n CHARACTER*1 SPLOT(0:1)\\t!Tricks for output.\\n PARAMETER (SPLOT = (/\\\" \\\",\\\"*\\\"/))\\t!Selected according to ISPRIME(n)\\n INTEGER TILE(ORDER,ORDER)\\t!Work area.\\n WRITE (6,1) START,ORDER\\t!Here we go.\\n 1 FORMAT (\\\"Ulam spiral starting with \\\",I0,\\\", of order \\\",I0,/)\\n IF (MOD(ORDER,2) .NE. 1) STOP \\\"The order must be odd!\\\"\\t!Otherwise, out of bounds.\\n M = ORDER/2 + 1\\t\\t!Find the number of the middle.\\n PLACE = CMPLX(M,M)\\t!Start there.\\n WAY = (1,0)\\t\\t!Thence in the +x direction.\\n N = START\\t\\t!Different start, different layout.\\n DO L = 1,ORDER\\t\\t!Advance one step, then two, then three, etc.\\n DO LUNGE = 1,2\\t\\t!But two lunges for each length.\\n DO STEP = 1,L\\t\\t\\t!Take the steps.\\n TILE(INT(REAL(PLACE)),INT(AIMAG(PLACE))) = N\\t!This number for this square.\\n PLACE = PLACE + WAY\\t\\t!Make another step.\\n N = N + 1\\t\\t\\t\\t!Count another step.\\n END DO\\t\\t\\t\\t!And consider making another.\\n IF (N .GE. ORDER**2) EXIT\\t!Otherwise, one lunge too many!\\n WAY = WAY*(0,1)\\t\\t!Rotate a quarter-turn counter-clockwise.\\n END DO\\t\\t\\t!And make another lunge.\\n END DO\\t\\t\\t!Until finished.\\nCast forth the numbers.\\nc DO L = ORDER,1,-1\\t!From the top of the grid to the bottom.\\nc WRITE (6,66) TILE(1:ORDER,L)\\t!One row at at time.\\nc 66 FORMAT (666I6)\\t!This will do for reassurance.\\nc END DO\\t\\t\\t!Line by line.\\nCast forth the splots.\\n DO L = ORDER,1,-1\\t!Just put out a marker.\\n WRITE (6,67) (SPLOT(ISPRIME(TILE(M,L))),M = 1,ORDER)\\t!One line at a time.\\n 67 FORMAT (666A1)\\t!A single character at each position.\\n END DO\\t\\t\\t!On to the next row.\\n END SUBROUTINE ULAMSPIRAL\\t!So much for a boring lecture.\\n\\n INTEGER FUNCTION ISPRIME(N)\\t!Returns 0 or 1.\\n INTEGER N\\t!The number.\\n INTEGER F,Q\\t!Factor and quotient.\\n ISPRIME = 0\\t\\t!The more likely outcome.\\n IF (N.LE.1) RETURN\\t!Just in case the start is peculiar.\\n IF (N.LE.3) GO TO 2\\t!Oops! I forgot this!\\n IF (MOD(N,2).EQ.0) RETURN\\t!Special case.\\n F = 1\\t\\t\\t!Now get stuck in to testing odd numbers.\\n 1 F = F + 2\\t\\t!A trial factor.\\n Q = N/F\\t\\t\\t!The quotient.\\n IF (N .EQ. Q*F) RETURN\\t!No remainder? Not a prime.\\n IF (Q.GT.F) GO TO 1\\t!Thus chug up to the square root.\\n 2 ISPRIME = 1\\t\\t!Well!\\n END FUNCTION ISPRIME\\t!Simple enough.\\n\\n PROGRAM TWIRL\\n CALL ULAMSPIRAL(1,49)\\n END\\n\",\n \"language\": \"Fortran\"\n },\n {\n \"code\": \"#define SIZE 639\\n\\nscreenres SIZE, SIZE, 4\\n\\nfunction is_prime( n as ulongint ) as boolean\\n if n < 2 then return false\\n if n = 2 then return true\\n if n mod 2 = 0 then return false\\n for i as uinteger = 3 to int(sqr(n))+1 step 2\\n if n mod i = 0 then return false\\n next i\\n return true\\nend function\\n\\nfunction is_turn( byval n as unsigned integer ) as boolean\\n n -= 1\\n if int(sqr(n))^2 = n then return true\\n n = n - int(sqr(n))\\n if int(sqr(n))^2 = n then return true\\n return false\\nend function\\n\\ndim as integer n = 1, x=SIZE/2, y=SIZE/2, dx = 1, dy = 0\\n\\ndo\\n if is_prime(n) then pset (x, y), 15\\n x = x + dx\\n y = y + dy\\n if x >= SIZE orelse y >= SIZE orelse x < 0 orelse y < 0 then exit do\\n n = n + 1\\n if is_turn(n) then\\n dx = -dx\\n swap dx, dy\\n end if\\nloop\\n\\nsleep\\nend\\n\",\n \"language\": \"FreeBASIC\"\n },\n {\n \"code\": \"package main\\n\\nimport (\\n\\t\\\"math\\\"\\n\\t\\\"fmt\\\"\\n)\\n\\ntype Direction byte\\n\\nconst (\\n\\tRIGHT Direction = iota\\n\\tUP\\n\\tLEFT\\n\\tDOWN\\n)\\n\\nfunc generate(n,i int, c byte) {\\n\\ts := make([][]string, n)\\n\\tfor i := 0; i < n; i++ { s[i] = make([]string, n) }\\n\\tdir := RIGHT\\n\\ty := n / 2\\n\\tvar x int\\n\\tif (n % 2 == 0) { x = y - 1 } else { x = y } // shift left for even n's\\n\\n\\tfor j := i; j <= n * n - 1 + i; j++ {\\n\\t\\tif (isPrime(j)) {\\n\\t\\t\\tif (c == 0) { s[y][x] = fmt.Sprintf(\\\"%3d\\\", j) } else { s[y][x] = fmt.Sprintf(\\\"%2c \\\", c) }\\n\\t\\t} else { s[y][x] = \\\"---\\\" }\\n\\n\\t\\tswitch dir {\\n\\t\\tcase RIGHT : if (x <= n - 1 && s[y - 1][x] == \\\"\\\" && j > i) { dir = UP }\\n\\t\\tcase UP : if (s[y][x - 1] == \\\"\\\") { dir = LEFT }\\n\\t\\tcase LEFT : if (x == 0 || s[y + 1][x] == \\\"\\\") { dir = DOWN }\\n\\t\\tcase DOWN : if (s[y][x + 1] == \\\"\\\") { dir = RIGHT }\\n\\t\\t}\\n\\n\\t\\tswitch dir {\\n\\t\\tcase RIGHT : x += 1\\n\\t\\tcase UP : y -= 1\\n\\t\\tcase LEFT : x -= 1\\n\\t\\tcase DOWN : y += 1\\n\\t\\t}\\n\\t}\\n\\n\\tfor _, row := range s { fmt.Println(fmt.Sprintf(\\\"%v\\\", row)) }\\n\\tfmt.Println()\\n}\\n\\nfunc isPrime(a int) bool {\\n\\tif (a == 2) { return true }\\n\\tif (a <= 1 || a % 2 == 0) { return false }\\n\\tmax := int(math.Sqrt(float64(a)))\\n\\tfor n := 3; n <= max; n += 2 { if (a % n == 0) { return false } }\\n\\treturn true\\n}\\n\\nfunc main() {\\n\\tgenerate(9, 1, 0) // with digits\\n\\tgenerate(9, 1, '*') // with *\\n}\\n\",\n \"language\": \"Go\"\n },\n {\n \"code\": \"import Data.List\\nimport Data.Numbers.Primes\\n\\nulam n representation = swirl n . map representation\\n\",\n \"language\": \"Haskell\"\n },\n {\n \"code\": \"swirl n = spool . take (2*(n-1)+1) . chop 1\\n\\nchop n lst = let (x,(y,z)) = splitAt n <$> splitAt n lst\\n in x:y:chop (n+1) z\\n\\nspool = foldl (\\\\table piece -> piece : rotate table) [[]]\\n where rotate = reverse . transpose\\n\",\n \"language\": \"Haskell\"\n },\n {\n \"code\": \"showTable w = foldMap (putStrLn . foldMap pad)\\n where pad s = take w $ s ++ repeat ' '\\n\",\n \"language\": \"Haskell\"\n },\n {\n \"code\": \"import Diagrams.Prelude\\nimport Diagrams.Backend.SVG.CmdLine\\n\\ndrawTable tbl = foldl1 (===) $ map (foldl1 (|||)) tbl :: Diagram B\\n\\ndots x = (circle 1 # if isPrime x then fc black else fc white) :: Diagram B\\n\\nmain = mainWith $ drawTable $ ulam 100 dots [1..]\\n\",\n \"language\": \"Haskell\"\n },\n {\n \"code\": \"spiral =: ,~ $ [: /: }.@(2 # >:@i.@-) +/\\\\@# <:@+: $ (, -)@(1&,)\\n\",\n \"language\": \"J\"\n },\n {\n \"code\": \" spiral 5\\n 0 1 2 3 4\\n15 16 17 18 5\\n14 23 24 19 6\\n13 22 21 20 7\\n12 11 10 9 8\\n (*: - spiral) 5\\n25 24 23 22 21\\n10 9 8 7 20\\n11 2 1 6 19\\n12 3 4 5 18\\n13 14 15 16 17\\n\",\n \"language\": \"J\"\n },\n {\n \"code\": \" (1 p: *: - spiral) 5\\n0 0 1 0 0\\n0 0 0 1 0\\n1 1 0 0 1\\n0 1 0 1 0\\n1 0 0 0 1\\n\",\n \"language\": \"J\"\n },\n {\n \"code\": \" (' o' {~ 1 p: *: - spiral) 5\\n o\\n o\\noo o\\n o o\\no o\\n\",\n \"language\": \"J\"\n },\n {\n \"code\": \" (0: :(<:@[)) ''\\n0\\n 3 (0: :(<:@[)) ''\\n2\\n\",\n \"language\": \"J\"\n },\n {\n \"code\": \"ulam=: 1j1 #\\\"1 ' o' {~ 1 p: 0: :(<:@[) + *:@] - spiral@]\\n\",\n \"language\": \"J\"\n },\n {\n \"code\": \" ulam 16\\n o o\\no o o\\n o o o\\no o o o\\n o o o\\n o o o o o\\n o o o o\\n o o o\\n o o o o o o o\\n o o o\\n o o\\n o o o o o\\n o o o\\n o\\n o o o o\\no o\\n 9 ulam 12\\n o o\\no o o o\\n o o o o\\n o o o\\n o o\\no o o o o\\n o o\\n o\\n o o o o\\n o\\n o o o\\n\",\n \"language\": \"J\"\n },\n {\n \"code\": \"import java.util.Arrays;\\n\\npublic class Ulam{\\n\\tenum Direction{\\n\\t\\tRIGHT, UP, LEFT, DOWN;\\n\\t}\\n\\t\\n\\tprivate static String[][] genUlam(int n){\\n\\t\\treturn genUlam(n, 1);\\n\\t}\\n\\n\\tprivate static String[][] genUlam(int n, int i){\\n\\t\\tString[][] spiral = new String[n][n];\\n\\t\\tDirection dir = Direction.RIGHT;\\n\\t\\tint j = i;\\n\\t\\tint y = n / 2;\\n\\t\\tint x = (n % 2 == 0) ? y - 1 : y; //shift left for even n's\\n\\t\\twhile(j <= ((n * n) - 1 + i)){\\n\\t\\t\\tspiral[y][x] = isPrime(j) ? String.format(\\\"%4d\\\", j) : \\\" ---\\\";\\n\\n\\t\\t\\tswitch(dir){\\n\\t\\t\\tcase RIGHT:\\n\\t\\t\\t\\tif(x <= (n - 1) && spiral[y - 1][x] == null && j > i) dir = Direction.UP; break;\\n\\t\\t\\tcase UP:\\n\\t\\t\\t\\tif(spiral[y][x - 1] == null) dir = Direction.LEFT; break;\\n\\t\\t\\tcase LEFT:\\n\\t\\t\\t\\tif(x == 0 || spiral[y + 1][x] == null) dir = Direction.DOWN; break;\\n\\t\\t\\tcase DOWN:\\n\\t\\t\\t\\tif(spiral[y][x + 1] == null) dir = Direction.RIGHT; break;\\n\\t\\t\\t}\\n\\t\\t\\t\\n\\t\\t\\tswitch(dir){\\n\\t\\t\\t\\tcase RIGHT:\\tx++; break;\\n\\t\\t\\t\\tcase UP: \\ty--; break;\\n\\t\\t\\t\\tcase LEFT:\\tx--; break;\\n\\t\\t\\t\\tcase DOWN:\\ty++; break;\\n\\t\\t\\t}\\n\\t\\t\\tj++;\\n\\t\\t}\\n\\t\\treturn spiral;\\n\\t}\\n\\t\\n\\tpublic static boolean isPrime(int a){\\n\\t\\t if(a == 2) return true;\\n\\t\\t if(a <= 1 || a % 2 == 0) return false;\\n\\t\\t long max = (long)Math.sqrt(a);\\n\\t\\t for(long n = 3; n <= max; n += 2){\\n\\t\\t if(a % n == 0) return false;\\n\\t\\t }\\n\\t\\t return true;\\n\\t\\t}\\n\\t\\n\\tpublic static void main(String[] args){\\n\\t\\tString[][] ulam = genUlam(9);\\n\\t\\tfor(String[] row : ulam){\\n\\t\\t\\tSystem.out.println(Arrays.toString(row).replaceAll(\\\",\\\", \\\"\\\"));\\n\\t\\t}\\n\\t\\tSystem.out.println();\\n\\t\\t\\n\\t\\tfor(String[] row : ulam){\\n\\t\\t\\tSystem.out.println(Arrays.toString(row).replaceAll(\\\"\\\\\\\\[\\\\\\\\s+\\\\\\\\d+\\\", \\\"[ * \\\").replaceAll(\\\"\\\\\\\\s+\\\\\\\\d+\\\", \\\" * \\\").replaceAll(\\\",\\\", \\\"\\\"));\\n\\t\\t}\\n\\t}\\n}\\n\",\n \"language\": \"Java\"\n },\n {\n \"code\": \"import java.awt.*;\\nimport javax.swing.*;\\n\\npublic class LargeUlamSpiral extends JPanel {\\n\\n public LargeUlamSpiral() {\\n setPreferredSize(new Dimension(605, 605));\\n setBackground(Color.white);\\n }\\n\\n private boolean isPrime(int n) {\\n if (n <= 2 || n % 2 == 0)\\n return n == 2;\\n for (int i = 3; i * i <= n; i += 2)\\n if (n % i == 0)\\n return false;\\n return true;\\n }\\n\\n @Override\\n public void paintComponent(Graphics gg) {\\n super.paintComponent(gg);\\n Graphics2D g = (Graphics2D) gg;\\n g.setRenderingHint(RenderingHints.KEY_ANTIALIASING,\\n RenderingHints.VALUE_ANTIALIAS_ON);\\n\\n g.setColor(getForeground());\\n\\n double angle = 0.0;\\n int x = 300, y = 300, dx = 1, dy = 0;\\n\\n for (int i = 1, step = 1, turn = 1; i < 40_000; i++) {\\n\\n if (isPrime(i))\\n g.fillRect(x, y, 2, 2);\\n\\n x += dx * 3;\\n y += dy * 3;\\n\\n if (i == turn) {\\n\\n angle += 90.0;\\n\\n if ((dx == 0 && dy == -1) || (dx == 0 && dy == 1))\\n step++;\\n\\n turn += step;\\n\\n dx = (int) Math.cos(Math.toRadians(angle));\\n dy = (int) Math.sin(Math.toRadians(-angle));\\n }\\n }\\n }\\n\\n public static void main(String[] args) {\\n SwingUtilities.invokeLater(() -> {\\n JFrame f = new JFrame();\\n f.setDefaultCloseOperation(JFrame.EXIT_ON_CLOSE);\\n f.setTitle(\\\"Large Ulam Spiral\\\");\\n f.setResizable(false);\\n f.add(new LargeUlamSpiral(), BorderLayout.CENTER);\\n f.pack();\\n f.setLocationRelativeTo(null);\\n f.setVisible(true);\\n });\\n }\\n}\\n\",\n \"language\": \"Java\"\n },\n {\n \"code\": \"import java.awt.*;\\nimport javax.swing.*;\\n\\npublic class UlamSpiral extends JPanel {\\n\\n Font primeFont = new Font(\\\"Arial\\\", Font.BOLD, 20);\\n Font compositeFont = new Font(\\\"Arial\\\", Font.PLAIN, 16);\\n\\n public UlamSpiral() {\\n setPreferredSize(new Dimension(640, 640));\\n setBackground(Color.white);\\n }\\n\\n private boolean isPrime(int n) {\\n if (n <= 2 || n % 2 == 0)\\n return n == 2;\\n for (int i = 3; i * i <= n; i += 2)\\n if (n % i == 0)\\n return false;\\n return true;\\n }\\n\\n @Override\\n public void paintComponent(Graphics gg) {\\n super.paintComponent(gg);\\n Graphics2D g = (Graphics2D) gg;\\n g.setRenderingHint(RenderingHints.KEY_ANTIALIASING,\\n RenderingHints.VALUE_ANTIALIAS_ON);\\n\\n g.setStroke(new BasicStroke(2));\\n\\n double angle = 0.0;\\n int x = 280, y = 330, dx = 1, dy = 0;\\n\\n g.setColor(getForeground());\\n g.drawLine(x, y - 5, x + 50, y - 5);\\n\\n for (int i = 1, step = 1, turn = 1; i < 100; i++) {\\n\\n g.setColor(getBackground());\\n g.fillRect(x - 5, y - 20, 30, 30);\\n g.setColor(getForeground());\\n g.setFont(isPrime(i) ? primeFont : compositeFont);\\n g.drawString(String.valueOf(i), x + (i < 10 ? 4 : 0), y);\\n\\n x += dx * 50;\\n y += dy * 50;\\n\\n if (i == turn) {\\n angle += 90.0;\\n\\n if ((dx == 0 && dy == -1) || (dx == 0 && dy == 1))\\n step++;\\n\\n turn += step;\\n\\n dx = (int) Math.cos(Math.toRadians(angle));\\n dy = (int) Math.sin(Math.toRadians(-angle));\\n\\n g.translate(9, -5);\\n g.drawLine(x, y, x + dx * step * 50, y + dy * step * 50);\\n g.translate(-9, 5);\\n }\\n }\\n }\\n\\n public static void main(String[] args) {\\n SwingUtilities.invokeLater(() -> {\\n JFrame f = new JFrame();\\n f.setDefaultCloseOperation(JFrame.EXIT_ON_CLOSE);\\n f.setTitle(\\\"Ulam Spiral\\\");\\n f.setResizable(false);\\n f.add(new UlamSpiral(), BorderLayout.CENTER);\\n f.pack();\\n f.setLocationRelativeTo(null);\\n f.setVisible(true);\\n });\\n }\\n}\\n\",\n \"language\": \"Java\"\n },\n {\n \"code\": \"<!-- UlamSpiral.html -->\\n<html>\\n<head><title>Ulam Spiral</title>\\n <script src=\\\"VOE.js\\\"></script>\\n<script>\\n// http://rosettacode.org/wiki/User:AnatolV/Helper_Functions\\n// Use v.2.0\\nvar pst;\\n\\n// ***** Additional helper functions\\n// Pad number from left\\nfunction padLeft(n,ns) {\\n return (\\\" \\\" + n).slice(-ns);\\n}\\n\\n// Is number n a prime?\\nfunction isPrime(n) {\\n var n2=Math.sqrt(n);\\n for(var i=2; i<=n2; i++) {\\n if(n%i === 0) return false;\\n }//fend i\\n return n !== 1;\\n}\\n\\nfunction insm(mat,x,y) {\\n var xz=mat[0].length, yz=xz;\\n return(x>=0 && x<xz && y>=0 && y<yz)\\n}\\n// *****\\n\\nfunction rbCheck() {\\n if (document.getElementById('rbDef').checked) {pst=0}\\n if (document.getElementById('rbAst').checked) {pst=1}\\n if (document.getElementById('rbNum').checked) {pst=2}\\n}\\nfunction rbSet() {\\n document.getElementById(\\\"rbDef\\\").checked = true;\\n rbCheck();\\n}\\n\\n// The Ulam Spiral\\nfunction pspUlam() {\\n var i, j, x, y, xmx, ymx, cnt, dir, M, Mij, sp=\\\" \\\", sc=3;\\n // Setting basic vars for canvas and matrix\\n var cvs = document.getElementById('cvsId');\\n var ctx = cvs.getContext(\\\"2d\\\");\\n if(pst<0||pst>2) {pst=0}\\n if(pst==0) {n=100; sc=3} else {n=10; sc=5}\\n console.log(\\\"sc\\\", typeof(sc));\\n if(n%2==0) {n++};\\n var n2=n*n, pch, sz=n2.toString().length, pch2=sp.repeat(sz);\\n var fgc=\\\"navy\\\", bgc=\\\"white\\\";\\n // Create matrix, finding number of rows and columns\\n var M=new Array(n);\\n for (i=0; i<n; i++) { M[i]=new Array(n);\\n for (j=0; j<n; j++) {M[i][j]=0} }\\n var r = M[0].length, c = M.length, k=0, dsz=1;\\n // Logging init parameters\\n var ttl=\\\"Matrix (\\\"+r+\\\",\\\"+c+\\\")\\\";\\n console.log(\\\" *** Ulam spiral: \\\",n,\\\"x\\\",n,\\\"p-flag=\\\",pst, \\\"sc\\\", sc);\\n // Generating and plotting Ulam spiral\\n x=y=Math.floor(n/2)+1; xmx=ymx=cnt=1; dir=\\\"R\\\";\\n for(var i=1; i<=n2; i++) { //\\n if(isPrime(i)) // if prime\\n { if(!insm(M,x,y)) {break};\\n if(pst==2) {M[y][x]=i} else {M[y][x]=1};\\n }\\n // all numbers\\n if(dir==\\\"R\\\") {if(xmx>0){x++;xmx--} else {dir=\\\"U\\\";ymx=cnt;y--;ymx--} continue};\\n if(dir==\\\"U\\\") {if(ymx>0){y--;ymx--} else {dir=\\\"L\\\";cnt++;xmx=cnt;x--;xmx--} continue};\\n if(dir==\\\"L\\\") {if(xmx>0){x--;xmx--} else {dir=\\\"D\\\";ymx=cnt;y++;ymx--} continue};\\n if(dir==\\\"D\\\") {if(ymx>0){y++;ymx--} else {dir=\\\"R\\\";cnt++;xmx=cnt;x++;xmx--}; continue};\\n }//fend i\\n //Plot/Print according to the p-flag(0-real plot,1-\\\"*\\\",2-primes)\\n if(pst==0) {pmat01(M, fgc, bgc, sc, 0); return};\\n var logs;\\n if(pst==1) {for(i=1;i<n;i++) {logs=\\\"|\\\";\\n for(j=1;j<n;j++) { Mij=M[i][j]; if(Mij>0) {pch=\\\"*\\\"} else {pch=\\\" \\\"};\\n logs+=\\\" \\\"+pch;}\\n logs+=\\\"|\\\"; console.log(logs);}//fiend\\n pmat01(M, fgc, bgc, sc, 0); console.log(\\\"sc\\\", sc);\\n return;\\n }//ifend\\n //console.log(\\\" \\\",pch);} console.log(\\\" \\\")}; return};\\n if(pst==2) {for(i=1;i<n;i++) {logs=\\\"|\\\";\\n for(j=1;j<n;j++) {Mij=M[i][j];\\n if(Mij==0) {pch=pch2}\\n else {pch=padLeft(Mij,sz)};\\n logs+=pch; } //\\\" \\\"+\\n logs+=\\\" |\\\"; console.log(logs);}//fiend\\n pmat01(M, fgc, bgc, sc, 0); console.log(\\\"sc\\\", sc);\\n\\t\\t\\t return;\\n\\t\\t\\t }//ifend\\n\\n}//func end\\n// ******************************************\\n</script></head>\\n<body onload='rbSet();' style=\\\"font-family: arial, helvatica, sans-serif;\\\">\\n <b>Plot/print style:</b>\\n <input type=\\\"radio\\\" onclick=\\\"rbCheck();\\\" name=\\\"rb\\\" id=\\\"rbDef\\\"/><b>Plot</b> \\n <input type=\\\"radio\\\" onclick=\\\"rbCheck();\\\" name=\\\"rb\\\" id=\\\"rbAst\\\"/><b>Print *</b> \\n <input type=\\\"radio\\\" onclick=\\\"rbCheck();\\\" name=\\\"rb\\\" id=\\\"rbNum\\\"/><b>Print numbers</b> \\n <input type=\\\"button\\\" value=\\\"Plot it!\\\" onclick=\\\"pspUlam();\\\">\\n <h3>Ulam Spiral</h3>\\n <canvas id=\\\"cvsId\\\" width=\\\"300\\\" height=\\\"300\\\" style=\\\"border: 2px inset;\\\"></canvas>\\n</body>\\n</html>\\n\",\n \"language\": \"JavaScript\"\n },\n {\n \"code\": \"def array($init): [range(0; .) | $init];\\n\\n# Test if input is a one-character string holding a digit\\ndef isDigit:\\n type==\\\"string\\\" and length==1 and explode[0] as $c | (48 <= $c and $c <= 57);\\n\\ndef lpad($len): tostring | ($len - length) as $l | (\\\" \\\" * $l)[:$l] + .;\\n\\ndef generate($n; $i; $c):\\n if $n <= 1 then \\\"'n' must be more than 1.\\\" | error\\n else { s: ($n|array(array(\\\"\\\"))),\\n dir: \\\"right\\\",\\n y: (($n/2)|floor) }\\n | .x = if ($n % 2 == 0) then .y - 1 else .y end # shift left for even n\\n | reduce range($i; $n * $n + $i) as $j (.;\\n .s[.y][.x] = (\\n if $j | is_prime\\n\\t then (if $c|isDigit then $j|lpad(4) else \\\" \\\\($c) \\\" end)\\n\\t else \\\" ---\\\"\\n\\t end)\\n | if .dir == \\\"right\\\"\\n then if (.x <= $n - 1 and .s[.y - 1][.x] == \\\"\\\" and $j > i) then .dir = \\\"up\\\" else . end\\n elif .dir == \\\"up\\\"\\n then if (.s[.y][.x - 1] == \\\"\\\") then .dir = \\\"left\\\" else . end\\n elif .dir == \\\"left\\\"\\n then if (.x == 0 or .s[.y + 1][.x] == \\\"\\\") then .dir = \\\"down\\\" else . end\\n elif .dir == \\\"down\\\"\\n then if (.s[.y][.x + 1] == \\\"\\\") then .dir = \\\"right\\\" else . end\\n else .\\n\\tend\\n | if .dir == \\\"right\\\" then .x += 1\\n elif .dir == \\\"up\\\" then .y += -1\\n elif .dir == \\\"left\\\" then .x += -1\\n elif .dir == \\\"down\\\" then .y += 1\\n else .\\n end )\\n | .s[] | join(\\\" \\\")\\n end ;\\n\\n# with digits\\ngenerate(9; 1; \\\"0\\\"), \\\"\\\",\\n\\n# with *\\ngenerate(9; 1; \\\"*\\\")\\n\",\n \"language\": \"Jq\"\n },\n {\n \"code\": \"using Primes\\n\\nfunction ulamspiral(ord::Int)\\n # Possible directions\\n dirs = [[0, 1], [-1, 0], [0, -1], [1, 0]]\\n # fdir = [\\\"→\\\", \\\"↑\\\", \\\"←\\\", \\\"↓\\\"] # for debug pourpose\\n cur = maxsteps = 1 # starting direction & starting max steps\\n steps = n = 0 # starting steps & starting number in cell\\n pos = [ord ÷ 2 + 1, isodd(ord) ? ord ÷ 2 + 1 : ord ÷ 2] # starting position\\n M = Matrix{Bool}(ord, ord) # result matrix\\n while n < ord ^ 2 # main loop (stop when the matrix is filled)\\n n += 1\\n M[pos[1], pos[2]] = isprime(n)\\n steps += 1\\n # Debug print\\n # @printf(\\\"M[%i, %i] = %5s (%2i), step %i/%i, nxt %s\\\\n\\\", pos[1], pos[2], isprime(n), n, steps, maxsteps, fdir[cur])\\n pos .+= dirs[cur] # increment position\\n if steps == maxsteps # if reached max number of steps in that direction...\\n steps = 0 # ...reset steps\\n if iseven(cur) maxsteps += 1 end # if the current direction is even increase the number of steps\\n cur += 1 # change direction\\n if cur > 4 cur -= 4 end # correct overflow\\n end\\n end\\n return M\\nend\\n\\nmprint(m::Matrix) = for i in 1:size(m, 1) println(join(el ? \\\" ∙ \\\" : \\\" \\\" for el in m[i, :]), '\\\\n') end\\n\\nM = ulamspiral(9)\\nmprint(M)\\n\",\n \"language\": \"Julia\"\n },\n {\n \"code\": \"object Ulam {\\n fun generate(n: Int, i: Int = 1, c: Char = '*') {\\n require(n > 1)\\n val s = Array(n) { Array(n, { \\\"\\\" }) }\\n var dir = Direction.RIGHT\\n var y = n / 2\\n var x = if (n % 2 == 0) y - 1 else y // shift left for even n's\\n for (j in i..n * n - 1 + i) {\\n s[y][x] = if (isPrime(j)) if (c.isDigit()) \\\"%4d\\\".format(j) else \\\" $c \\\" else \\\" ---\\\"\\n\\n when (dir) {\\n Direction.RIGHT -> if (x <= n - 1 && s[y - 1][x].none() && j > i) dir = Direction.UP\\n Direction.UP -> if (s[y][x - 1].none()) dir = Direction.LEFT\\n Direction.LEFT -> if (x == 0 || s[y + 1][x].none()) dir = Direction.DOWN\\n Direction.DOWN -> if (s[y][x + 1].none()) dir = Direction.RIGHT\\n }\\n\\n when (dir) {\\n Direction.RIGHT -> x++\\n Direction.UP -> y--\\n Direction.LEFT -> x--\\n Direction.DOWN -> y++\\n }\\n }\\n for (row in s) println(\\\"[\\\" + row.joinToString(\\\"\\\") + ']')\\n println()\\n }\\n\\n private enum class Direction { RIGHT, UP, LEFT, DOWN }\\n\\n private fun isPrime(a: Int): Boolean {\\n when {\\n a == 2 -> return true\\n a <= 1 || a % 2 == 0 -> return false\\n else -> {\\n val max = Math.sqrt(a.toDouble()).toInt()\\n for (n in 3..max step 2)\\n if (a % n == 0) return false\\n return true\\n }\\n }\\n }\\n}\\n\\nfun main(args: Array<String>) {\\n Ulam.generate(9, c = '0')\\n Ulam.generate(9)\\n}\\n\",\n \"language\": \"Kotlin\"\n },\n {\n \"code\": \"local function ulamspiral(n, f)\\n print(\\\"n = \\\" .. n)\\n local function isprime(p)\\n if p < 2 then return false end\\n if p % 2 == 0 then return p==2 end\\n if p % 3 == 0 then return p==3 end\\n local limit = math.sqrt(p)\\n for f = 5, limit, 6 do\\n if p % f == 0 or p % (f+2) == 0 then return false end\\n end\\n return true\\n end\\n local function spiral(x, y)\\n if n%2==1 then x, y = n-1-x, n-1-y end\\n local m = math.min(x, y, n-1-x, n-1-y)\\n return x<y and (n-2*m-2)^2+(x-m)+(y-m) or (n-2*m)^2-(x-m)-(y-m)\\n end\\n for y = 0, n-1 do\\n for x = 0, n-1 do\\n io.write(f(isprime(spiral(x,y))))\\n end\\n print()\\n end\\n print()\\nend\\n\\n-- filling a 132 column terminal (with a 2-wide glyph to better preserve aspect ratio)\\nulamspiral(132/2, function(b) return b and \\\"██\\\" or \\\" \\\" end)\\n\",\n \"language\": \"Lua\"\n },\n {\n \"code\": \"Module Ulam_Spiral {\\n\\tbuild_spiral(9)\\n\\tSub build_spiral(n)\\n\\t\\tif n mod 2=0 then n++\\n\\t\\tLocal matrix(n,n) as string\\n\\t\\tLocal x = (n-1)/2, y = (n-1)/2\\n\\t\\tLocal x_max = 1, y_max = 1, count = 1\\n\\t\\tLocal dir = \\\"R\\\", i, l=Len(n*n+\\\"\\\")\\n\\t\\t\\n\\t\\tFor i = 1 To n*n\\n\\t\\t\\tIf @IsPrime(i) Then\\n\\t\\t\\t\\tmatrix(x,y) = Right$(\\\"000\\\"+i,l)\\n\\t\\t\\tElse\\n\\t\\t\\t\\tmatrix(x,y) = String$(\\\"-\\\", l) // this is different from VbScript\\n\\t\\t\\tEnd If\\n\\t\\t\\tSelect Case dir\\n\\t\\t\\t\\tCase \\\"R\\\"\\n\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\t\\tIf x_max > 0 Then\\n\\t\\t\\t\\t\\t\\t\\tx++:x_max--\\n\\t\\t\\t\\t\\t\\tElse\\n\\t\\t\\t\\t\\t\\t\\tdir = \\\"U\\\" : y_max = count\\n\\t\\t\\t\\t\\t\\t\\ty--:y_max--\\n\\t\\t\\t\\t\\t\\tEnd If\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tCase \\\"U\\\"\\n\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\t\\tIf y_max > 0 Then\\n\\t\\t\\t\\t\\t\\t\\ty-- :y_max--\\n\\t\\t\\t\\t\\t\\tElse\\n\\t\\t\\t\\t\\t\\t\\tdir = \\\"L\\\" : count++: x_max = count\\n\\t\\t\\t\\t\\t\\t\\tx--:x_max--\\n\\t\\t\\t\\t\\t\\tEnd If\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tCase \\\"L\\\"\\n\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\t\\tIf x_max > 0 Then\\n\\t\\t\\t\\t\\t\\t\\tx--:x_max--\\n\\t\\t\\t\\t\\t\\tElse\\n\\t\\t\\t\\t\\t\\t\\tdir = \\\"D\\\" : y_max = count\\n\\t\\t\\t\\t\\t\\t\\ty++:y_max--\\n\\t\\t\\t\\t\\t\\tEnd If\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tCase \\\"D\\\"\\n\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\t\\tIf y_max > 0 Then\\n\\t\\t\\t\\t\\t\\t\\ty++:y_max--\\n\\t\\t\\t\\t\\t\\tElse\\n\\t\\t\\t\\t\\t\\t\\tdir = \\\"R\\\" : count++: x_max = count\\n\\t\\t\\t\\t\\t\\t\\tx++:x_max--\\n\\t\\t\\t\\t\\t\\tEnd If\\n\\t\\t\\t\\t}\\n\\t\\t\\tEnd Select\\n\\t\\tNext\\n\\t\\tFor y = 0 To n - 1\\n\\t\\t\\tFor x = 0 To n - 1\\n\\t\\t\\t\\tIf x = n - 1 Then\\n\\t\\t\\t\\t\\tPrint matrix(x,y)\\n\\t\\t\\t\\tElse\\n\\t\\t\\t\\t\\tprint matrix(x,y)+\\\" \\\";\\n\\t\\t\\t\\tEnd If\\n\\t\\t\\tNext\\n\\t\\t\\tprint\\n\\t\\tNext\\n\\tEnd Sub\\n\\tFunction IsPrime(n)\\n\\t\\tIf n = 2 Then\\n\\t\\t\\t= True\\n\\t\\tElse.If n <= 1 Or n Mod 2 = 0 Then\\n\\t\\t\\t= False\\n\\t\\tElse\\n\\t\\t\\t= True\\n\\t\\t\\tif 3>Int(Sqrt(n)) then exit function\\n // for/next in M2000 always executed (from step used the absolute value)\\n\\t\\t\\tlocal i\\n\\t\\t\\tFor i = 3 To Int(Sqrt(n)) Step 2\\n\\t\\t\\t\\tIf n Mod i = 0 Then\\n\\t\\t\\t\\t\\t= False\\n\\t\\t\\t\\t\\tExit For\\n\\t\\t\\t\\tEnd If\\n\\t\\t\\tNext\\n\\t\\tEnd If\\n\\tEnd Function\\n}\\nUlam_Spiral\\n\",\n \"language\": \"M2000-Interpreter\"\n },\n {\n \"code\": \"ClearAll[iCCWSpiralEast]\\niCCWSpiralEast[n_Integer]:=Table[(1/2 (-1)^# ({1,-1} (Abs[#^2-t]-#)+#^2-t-Mod[#,2])&)[Round[Sqrt[t]]],{t,0,n-1}]\\nn=20\\nstart=1;\\npts=iCCWSpiralEast[n^2];\\npts=Pick[pts,PrimeQ[start+Range[n^2]-1],True];\\ngrid=Table[({i,j}/.(Alternatives@@pts)->\\\"#\\\")/.{_,_}->\\\" \\\",{j,Round[n/2],-Round[n/2],-1},{i,-Round[n/2],Round[n/2],1}];\\nGrid[grid]\\n\",\n \"language\": \"Mathematica\"\n },\n {\n \"code\": \"/* Adapting the spiral to the problem requirements */\\nspiral_from_center(n):=(n^2+1)*matrixmap(lambda([x],x+1),zeromatrix(n,n))-spiral(n)$\\n\\n/* Testing */\\nspiral_from_center(35)$\\nmatrixmap(lambda([x],if primep(x) then \\\"O\\\" else \\\"\\\"),%);\\n\",\n \"language\": \"Maxima\"\n },\n {\n \"code\": \"import strutils\\n\\nconst N = 51 # Grid width and height.\\n\\ntype\\n Vec2 = tuple[x, y: int]\\n Grid = array[N, array[N, string]]\\n\\nconst Deltas: array[4, Vec2] = [(0, 1), (-1, 0), (0, -1), (1, 0)]\\n\\n\\nproc `+`(v1, v2: Vec2): Vec2 =\\n ## Vector addition.\\n (v1.x + v2.x, v1.y + v2.y)\\n\\n\\nproc isPrime(n: Positive): bool =\\n ## Check if a number is prime.\\n if n == 1: return false\\n if (n and 1) == 0: return n == 2\\n if (n mod 3) == 0: return n == 3\\n var delta = 2\\n var d = 5\\n while d * d <= n:\\n if n mod d == 0: return false\\n inc d, delta\\n delta = 6 - delta\\n return true\\n\\n\\nproc fill(grid: var Grid; start: Positive = 1) =\\n ## Fill the grid using Ulam algorithm.\\n\\n template isEmpty(pos: Vec2): bool = grid[pos.x][pos.y].len == 0\\n\\n # Fill the grid with successive numbers (as strings).\\n var pos: Vec2 = (N div 2, N div 2)\\n grid[pos.x][pos.y] = $start\\n var currIdx = 3\\n for n in (start + 1)..<(start + N * N):\\n let nextIdx = (currIdx + 1) and 3\\n var nextPos = pos + Deltas[nextIdx]\\n if nextPos.isEmpty():\\n # Direction change is OK.\\n currIdx = nextIdx\\n else:\\n # Continue in same direction.\\n nextPos = pos + Deltas[currIdx]\\n pos = move(nextPos)\\n grid[pos.x][pos.y] = $n\\n\\n # Replace the values with a symbol (if prime) or a space (if composite).\\n for row in 0..<N:\\n for col in 0..<N:\\n grid[row][col] = if grid[row][col].parseInt().isPrime(): \\\"• \\\" else: \\\" \\\"\\n\\n\\nvar grid: Grid\\ngrid.fill()\\nfor row in grid:\\n echo row.join()\\n\",\n \"language\": \"Nim\"\n },\n {\n \"code\": \"import imageman\\n\\nconst\\n N = 501 # Grid width and height.\\n FG = ColorRGBU [byte 255, 255, 255]\\n BG = ColorRGBU [byte 0, 0, 0]\\n\\ntype\\n Vec2 = tuple[x, y: int]\\n Grid = array[N, array[N, int32]]\\n\\nconst Deltas: array[4, Vec2] = [(0, 1), (-1, 0), (0, -1), (1, 0)]\\n\\n\\nproc `+`(v1, v2: Vec2): Vec2 =\\n ## Vector addition.\\n (v1.x + v2.x, v1.y + v2.y)\\n\\n\\nproc isPrime(n: Positive): bool =\\n ## Check if a number is prime.\\n if n == 1: return false\\n if (n and 1) == 0: return n == 2\\n if (n mod 3) == 0: return n == 3\\n var delta = 2\\n var d = 5\\n while d * d <= n:\\n if n mod d == 0: return false\\n inc d, delta\\n delta = 6 - delta\\n return true\\n\\n\\nproc fill(grid: var Grid; start: Positive = 1) =\\n ## Fill the grid using Ulam algorithm.\\n\\n template isEmpty(pos: Vec2): bool = grid[pos.x][pos.y] == 0\\n\\n let start = start.int32\\n\\n # Fill the grid with successive numbers (as strings).\\n var pos: Vec2 = (N div 2, N div 2)\\n grid[pos.x][pos.y] = start\\n var currIdx = 3\\n for n in (start + 1)..<(start + N * N):\\n let nextIdx = (currIdx + 1) and 3\\n var nextPos = pos + Deltas[nextIdx]\\n if nextPos.isEmpty():\\n # Direction change is OK.\\n currIdx = nextIdx\\n else:\\n # Continue in same direction.\\n nextPos = pos + Deltas[currIdx]\\n pos = move(nextPos)\\n grid[pos.x][pos.y] = n\\n\\nproc apply(img: var Image; grid: Grid) =\\n ## Fill the image with foreground pixel (for primes) or nothing (for composites).\\n for row in 0..<N:\\n for col in 0..<N:\\n if grid[row][col].isPrime():\\n img[row, col] = FG\\n\\n\\nvar grid: Grid\\ngrid.fill()\\n\\nvar image = initImage[ColorRGBU](N, N)\\nimage.fill(BG)\\nimage.apply(grid)\\nimage.savePNG(\\\"ulam_spiral.png\\\", compression = 9)\\n\",\n \"language\": \"Nim\"\n },\n {\n \"code\": \"\\\\\\\\ Ulam spiral (plotting/printing)\\n\\\\\\\\ 4/19/16 aev\\nplotulamspir(n,pflg=0)={\\nmy(n=if(n%2==0,n++,n),M=matrix(n,n),x,y,xmx,ymx,cnt,dir,n2=n*n,pch,sz=#Str(n2),pch2=srepeat(\\\" \\\",sz));\\nif(pflg<0||pflg>2,pflg=0);\\nprint(\\\" *** Ulam spiral: \\\",n,\\\"x\\\",n,\\\" matrix, p-flag=\\\",pflg);\\nx=y=n\\\\2+1; xmx=ymx=cnt=1; dir=\\\"R\\\";\\nfor(i=1,n2,\\n if(isprime(i), if(!insm(M,x,y), break); if(pflg==2, M[y,x]=i, M[y,x]=1));\\n if(dir==\\\"R\\\", if(xmx>0, x++;xmx--, dir=\\\"U\\\";ymx=cnt;y--;ymx--); next);\\n if(dir==\\\"U\\\", if(ymx>0, y--;ymx--, dir=\\\"L\\\";cnt++;xmx=cnt;x--;xmx--); next);\\n if(dir==\\\"L\\\", if(xmx>0, x--;xmx--, dir=\\\"D\\\";ymx=cnt;y++;ymx--); next);\\n if(dir==\\\"D\\\", if(ymx>0, y++;ymx--, dir=\\\"R\\\";cnt++;xmx=cnt;x++;xmx--); next);\\n );\\\\\\\\fend\\n\\\\\\\\Plot/Print according to the p-flag(0-real plot,1-\\\"*\\\",2-primes)\\nif(pflg==0, plotmat(M));\\nif(pflg==1, for(i=1,n,\\n for(j=1,n, if(M[i,j]==1, pch=\\\"*\\\", pch=\\\" \\\");\\n print1(\\\" \\\",pch)); print(\\\" \\\")));\\nif(pflg==2, for(i=1,n,\\n for(j=1,n, if(M[i,j]==0, pch=pch2, pch=spad(Str(M[i,j]),sz,,1));\\n print1(\\\" \\\",pch)); print(\\\" \\\")));\\n}\\n\\n{\\\\\\\\ Executing:\\nplotulamspir(9,1); \\\\\\\\ (see output)\\nplotulamspir(9,2); \\\\\\\\ (see output)\\nplotulamspir(100); \\\\\\\\ ULAMspiral1.png\\nplotulamspir(200); \\\\\\\\ ULAMspiral2.png\\n}\\n\",\n \"language\": \"PARI-GP\"\n },\n {\n \"code\": \"Program Ulam; Uses crt;\\n{Concocted by R.N.McLean (whom God preserve), ex Victoria university, NZ.}\\n{$B- evaluate boolean expressions only so far as necessary.}\\n{$R+ range checking...}\\n\\n FUNCTION Trim(S : string) : string;\\n var L1,L2 : integer;\\n BEGIN\\n L1 := 1;\\n WHILE (L1 <= LENGTH(S)) AND (S[L1] = ' ') DO INC(L1);\\n L2 := LENGTH(S);\\n WHILE (S[L2] = ' ') AND (L2 > L1) DO DEC(L2);\\n IF L2 >= L1 THEN Trim := COPY(S,L1,L2 - L1 + 1) ELSE Trim := '';\\n END; {Of Trim.}\\n\\nFUNCTION Ifmt(Digits : integer) : string;\\n var S : string[255];\\n BEGIN\\n STR(Digits,S);\\n Ifmt := Trim(S);\\n END; { Ifmt }\\n Function min(i,j: integer): integer;\\n begin\\n if i <= j then min:=i else min:=j;\\n end;\\n Procedure Croak(Gasp: string); {A lethal word.}\\n Begin\\n WriteLn;\\n WriteLn(Gasp);\\n HALT; {This way to the egress...}\\n End;\\n var ScreenLine,ScreenColumn: byte;\\t{Line and column position.}\\n{=========================enough support===================}\\n const Mstyle = 6;\\t{Display different results.}\\n const StyleName: array[1..Mstyle] of string = ('IsPrime','First Prime Factor Index',\\n 'First Prime Factor','Number of Prime Factors',\\n 'Sum of Prime Factors','Sum of Proper Factors');\\n const OrderLimit = 49; Limit2 = OrderLimit*OrderLimit;\\t\\t{A 50-line screen has room for a heading.}\\n var Tile: array[1..OrderLimit,1..OrderLimit] of integer; \\t{Alas, can't put [Order,Order], only constants.}\\n var FirstPrimeFactorIndex,FirstPrimeFactor,NumPFactor,SumPFactor,SumFactor: array[1..Limit2] of integer;\\n const enuffP = 17;\\t{Given the value of Limit2.}\\n const Prime: array[1..enuffP] of integer = (1,2,3,5,7,11,13,17,19,23,29,31,37,41,43,47,53);\\n Procedure Prepare;\\t{Various arrays are to be filled for the different styles.}\\n var i,j,p: integer;\\n Begin\\n for i:=1 to limit2 do\\t{Alas, can't just put A:=0;}\\n begin\\t\\t\\t{Nor clear A;}\\n FirstPrimeFactorIndex[i]:=1;\\t{Prime[1] = 1, so this means no other divisor.}\\n FirstPrimeFactor[i]:=0;\\n NumPFactor[i]:=0;\\n SumPFactor[i]:=0;\\n SumFactor[i]:=1;\\t\\t{1 is counted as a proper factor.}\\n end;\\n FirstPrimeFactorIndex[1]:=0;\\t{Fiddle, as 1 is not a prime number.}\\n SumFactor[1]:=0;\\t\\t{N is not a proper factor of N, so 1 has no proper factors...}\\n for i:=2 to enuffP do\\t{Prime[1] = 1, Prime[2] = 2, so start with i = 2.}\\n begin\\n p:=Prime[i];\\n j:=p + p;\\n while j <= Limit2 do\\n begin\\n if FirstPrimeFactorIndex[j] = 1 then FirstPrimeFactorIndex[j]:=i;\\n if FirstPrimeFactor[j] = 0 then FirstPrimeFactor[j]:=p;\\n SumPFactor[j]:=SumPFactor[j] + p;\\n inc(NumPFactor[j]);\\n j:=j + p;\\n end;\\n end;\\n for i:=2 to Limit2 div 2 do\\t{Step through all possible proper factors.}\\n begin\\t\\t\\t{N is not a proper factor of N, so start at 2N,}\\n j:=2*i;\\t \\t\\t{for which N is a proper factor of 2N.}\\n while j <= Limit2 do\\t{Sigh. for j:=2*i:Limit2:i do ... Next i;}\\n begin\\n SumFactor[j]:=SumFactor[j] + i;\\n j:=j + i;\\n end;\\n end;\\n End;\\t{Enough preparation.}\\n\\n const enuffC = 11;\\t{Perhaps the colours will highlight interesting patterns.}\\n const colour:array[0..enuffC] of byte = (black,white,LightRed,\\n LightMagenta,Yellow,LightGreen,LightCyan,LightBlue,LightGray,\\n Red,Green,DarkGray);\\t\\t{Colours on the screen don't always match their name!}\\n\\n Procedure UlamSpiral(Order,Start,Style: integer);\\t{Generate the numbers, then display.}\\n Function Encode(N: integer): integer;\\t{Acording to Style, choose a result to show.}\\n Begin\\n if N <= 1 then Encode:=0\\n else\\n case style of\\n 1:if FirstPrimeFactorIndex[N] = 1 then Encode:=1 else Encode:=0;\\t{1 = Prime.}\\n 2:Encode:=FirstPrimeFactorIndex[N];\\n 3:Encode:=FirstPrimeFactor[N];\\n 4:Encode:=NumPFactor[N];\\n 5:Encode:=SumPFactor[N];\\n 6:Encode:=SumFactor[N];\\n end;\\n End;\\t{So much for encoding.}\\n var Place,Way: array[1..2] of integer;\\t{Complex numbers.}\\n var m,\\t{Middle.}\\n N,\\t{Counter.}\\n length,\\t{length of a side.}\\n lunge,\\t{two lunges for each length.}\\n step\\t{steps to make up a lunge of some length.}\\n : integer;\\n var i,j: integer;\\t{Steppers.}\\n var code,it: integer;\\t{Mess with the results.}\\n label XX;\\t\\t{Escape the second lunge.}\\n var OutF: text;\\t{Utter drivel. It is a disc file.}\\n Begin\\n Write('Ulam Spiral, order ',Order,', start ',Start,', style ',style);\\t{Start the heading.}\\n if style <= 0 then Croak('Must be a positive style');\\n if style > Mstyle then croak('Last known style is '+ifmt(Mstyle));\\n if Order > OrderLimit then Croak('Array OrderLimit is order '+IFmt(OrderLimit));\\n if Order mod 2 <>1 then Croak('The order must be an odd number!');\\n writeln(': ',StyleName[Style]);\\t{Finish the heading. The pattern starts with line two.}\\n Assign(OutF,'Ulam.txt'); Rewrite(OutF); Writeln(OutF,'Ulam spiral: the codes for ',StyleName[style]);\\n m:=order div 2 + 1;\\t\\t{This is why Order must be odd.}\\n Place[1]:=m; Place[2]:=m;\\t{Start at the middle.}\\n way[1]:=1; way[2]:=0;\\t{Initial direction is along the x-axis.}\\n n:=Start;\\n for length:=1 to Order do\\t{Advance through the lengths.}\\n for lunge:=1 to 2 do\\t\\t{Two lunges for each length.}\\n begin\\n for step:=1 to length do\\t\\t\\t{Make the steps.}\\n begin\\n Tile[Place[1],Place[2]]:=N;\\n for i:=1 to 2 do Place[i]:=Place[i] + Way[i]; {Place:=Place + Way;}\\n N:=N + 1;\\n end;\\n if N >= Order*Order then goto XX;\\t{Each corner piece is part of two lunges.}\\n i:=Way[1]; Way[1]:=-Way[2]; Way[2]:=i;\\t{Way:=Way*(0,1) in complex numbers: (x,y)*(0,1) = (-y,x).}\\n end;\\nXX:for i:=order downto 1 do {Output: Lines count downwards, y runs upwards.}\\n begin\\t\\t\\t{The first line is the topmost y.}\\n for j:=1 to order do\\t{(line,column) = (y,x).}\\n begin\\t\\t\\t\\t{Work along the line.}\\n it:=Tile[j,i];\\t\\t\\t{Grab the number.}\\n code:=Encode(it);\\t\\t{Presentation scheme.}\\n Write(OutF,'(',it:4,':',code:2,')');\\t{Debugging...}\\n if FirstPrimeFactorIndex[it] > 1 then TextBackGround(Black)\\t{Not a prime.}\\n else if it = 1 then TextBackGround(Black)\\t{Darkness for one, also.}\\n else TextBackGround(White);\\t\\t{A prime number!}\\n TextColor(Colour[min(code,enuffC)]);\\t{A lot of fuss for this!}\\n {Write(code:2);}\\n {Write(it:3);}\\n if it <= 9 then write(it) else Write('*');\\t{Thus mark the centre.}\\n end;\\t\\t\\t\\t\\t{Next position along the line.}\\n if i > 1 then WriteLn;\\t\\t{Ending the last line would scroll the heading up.}\\n WriteLn(OutF);\\t\\t\\t{But this is good for the text file.}\\n end;\\t\\t\\t{On to the next line.}\\n Close(OutF);\\t\\t{Finished with the trace.}\\n{Some revelations to help in choosing a colour sequence.}\\n ScreenLine:=WhereY; ScreenColumn:=WhereX;\\t{Gibberish to find the location.}\\n if Style > 1 then\\t{Only the fancier styles go beyond 0 and 1.}\\n begin\\t\\t\\t{So explain only for them.}\\n GoToXY(ScreenColumn + 1,ScreenLine - 4);\\t\\t{Unused space is to the right.}\\n TextColor(White); write('Colour sequence');\\t{Given 80-column displays.}\\n GoToXY(ScreenColumn + 1,ScreenLine - 3);\\t\\t{And no more than 50 lines.}\\n for i:=1 to enuffC do begin TextColor(Colour[i]); write(i); end;\\t{My sequence.}\\n GoToXY(ScreenColumn + 1,ScreenLine - 2);\\n TextColor(White); write('From options');\\n GoToXY(ScreenColumn + 1,ScreenLine - 1);\\n for i:=1 to 15 do begin TextColor(i);write(i); end;\\t\\t{The options.}\\n end;\\n End; {of UlamSpiral.}\\n\\n var start,wot,order: integer;\\t{A selector.}\\n BEGIN\\t{After all that.}\\n TextMode(Lo(LastMode) + Font8x8);\\t{Gibberish sets 43 lines on EGA and 50 on VGA.}\\n ClrScr; TextColor(White);\\t\\t{This also gives character blocks that are almost square...}\\n WriteLn('Presents consecutive integers in a spiral, as per Stanislaw Ulam.');\\n WriteLn('Starting with 1, runs up to Order*Order.');\\n Write('What value for Order? (Limit ' + Ifmt(OrderLimit),'): ');\\n ReadLn(Order);\\t\\t\\t{ReadKey needs no \\\"enter\\\", but requires decoding.}\\n if (order < 1) or (order > OrderLimit) then Croak('Out of range!');\\t{Oh dear.}\\n Prepare;\\n wot:=1;\\t{The original task.}\\n Repeat\\t\\t{Until bored?}\\n ClrScr;\\t\\t\\t{Scrub any previous stuff.}\\n UlamSpiral(Order,1,wot);\\t\\t{The deed!}\\n GoToXY(ScreenColumn + 1,ScreenLine);\\t\\t{Note that the last WriteLn was skipped.}\\n TextColor(White); Write('Enter 0, or 1 to '+Ifmt(Mstyle),': ');\\t{Wot now?}\\n ReadLn(wot);\\t\\t\\t\\t\\t\\t{Receive.}\\n Until (wot <= 0) or (wot > Mstyle);\\t\\t{Alas, \\\"Enter\\\" must be pressed.}\\n END.\\n\",\n \"language\": \"Pascal\"\n },\n {\n \"code\": \"PROGRAM Ulam.pas;\\n\\n\\n{$IFDEF FPC}\\n {$mode objfpc}{$H+}{$J-}{R+}\\n{$ELSE}\\n {$APPTYPE CONSOLE}\\n{$ENDIF}\\n\\n\\n(*)\\n Free Pascal Compiler version 3.2.0 [2020/06/14] for x86_64\\n The free and readable alternative at C/C++ speeds\\n compiles natively to almost any platform, including raspberry PI\\n\\n https://www.freepascal.org/advantage.var\\n(*)\\n\\n USES\\n Crt,\\n SysUtils ;\\n\\n CONST\\n (*)\\n Only odd numbers work\\n (*)\\n SIZE = 9 ;\\n MSIZE = SIZE * ord ( Odd ( SIZE ) ) ;\\n\\n TYPE\\n D2Arr = array of array of string ;\\n\\n\\n FUNCTION IsPrime ( n: integer ): boolean ;\\n\\n VAR\\n i: integer;\\n\\n BEGIN\\n\\n IF ( n < 2 ) THEN Exit ( False ) ;\\n IF ( n = 2 ) THEN Exit ( True ) ;\\n IF ( n mod 2 = 0 ) THEN Exit ( False ) ;\\n\\n FOR i := 3 TO Trunc ( Sqrt ( n ) ) DO\\n IF ( n mod i = 0 ) THEN Exit( False ) ;\\n\\n IsPrime := True ;\\n\\n END;\\n\\n\\n PROCEDURE Init2DArr ( Arr: D2Arr ) ;\\n\\n VAR\\n j: integer;\\n mid: integer = MSIZE div 2 ;\\n\\n BEGIN\\n\\n FOR j:= 1 to MSIZE - mid - 1 DO\\n BEGIN\\n Arr [ mid - j ] [ mid - j ] := '.' ;\\n Arr [ mid - j ] [ mid + j ] := '.' ;\\n Arr [ mid + j ] [ mid - j ] := '.' ;\\n Arr [ mid + j ] [ mid + j - 1 ] := '.' ;\\n END;\\n\\n END;\\n\\n\\n PROCEDURE Advance ( var Turn_cnt, x, y: integer ) ;\\n\\n VAR\\n dir: array [ 0..3, 0..1 ] of shortint =\\n ( ( 1, 0 ), ( 0, -1 ), ( -1, 0 ), ( 0, 1 ) ) ;\\n\\n BEGIN\\n\\n x := Abs ( x + dir [ Turn_cnt mod 4 ][ 0 ] ) ;\\n y := Abs ( y + dir [ Turn_cnt mod 4 ][ 1 ] ) ;\\n\\n END;\\n\\n\\n PROCEDURE Add2DArr ( Arr: D2Arr ) ;\\n\\n VAR\\n\\n cnt: integer = 1 ;\\n Turn_cnt: integer = 0 ;\\n x: integer = MSIZE div 2 ;\\n y: integer = MSIZE div 2 ;\\n\\n BEGIN\\n\\n WHILE ( cnt < MSIZE * MSIZE ) DO\\n BEGIN\\n\\n Advance ( Turn_cnt , x , y ) ;\\n Inc ( cnt ) ;\\n\\n IF ( Arr [ x ] [ y ] = '.' ) THEN\\n BEGIN\\n Arr [ x ] [ y ] := '' ;\\n inc ( Turn_cnt ) ;\\n END;\\n\\n IF ( IsPrime ( cnt ) ) THEN\\n Arr [ x ] [ y ] := IntToStr ( cnt ) ;\\n\\n END;\\n\\n END;\\n\\n\\n PROCEDURE Show2DArr ( Arr: D2Arr ; glyph : Boolean ) ;\\n\\n VAR\\n x, y: integer ;\\n\\n BEGIN\\n\\n WriteLn ;\\n\\n FOR y := Low ( Arr ) TO High ( Arr ) DO\\n BEGIN\\n FOR x := Low ( Arr [ y ] ) to High ( Arr [ y ] ) DO\\n\\n IF length ( Arr [ x ] [ y ] ) > 0 THEN\\n IF glyph THEN Write ( '′' : 3 )\\n ELSE Write ( Arr [ x ] [ y ] : 3 )\\n ELSE Write ( ' ' : 3) ;\\n\\n WriteLn;\\n END;\\n\\n WriteLn;\\n\\n END;\\n\\n\\nVAR\\n Arr: D2Arr ;\\n\\nBEGIN\\n\\n IF ( MSIZE = 0 ) THEN\\n BEGIN\\n WriteLn ( 'Only odd numbers work for SIZE' ) ;\\n Exit;\\n END;\\n SetLength ( Arr, MSIZE, MSIZE ) ;\\n Init2DArr ( Arr ) ;\\n Add2DArr ( Arr ) ;\\n Show2DArr ( Arr , False ) ;\\n Show2DArr ( Arr , True ) ;\\n\\nEND.\\n\",\n \"language\": \"Pascal\"\n },\n {\n \"code\": \"PROGRAM Ulam8.pas;\\n\\n{$IFDEF FPC}\\n {$mode objfpc}{$H+}{$J-}{R+}\\n{$ELSE}\\n {$APPTYPE CONSOLE}\\n{$ENDIF}\\n\\n(*)\\n Free `translation` from PHIX for the Spiral part\\n\\n Free Pascal Compiler version 3.2.0 [2020/06/14] for x86_64\\n The free and readable alternative at C/C++ speeds\\n compiles natively to almost any platform, including raspberry PI *\\n Can run independently from DELPHI / Lazarus\\n\\n For debian Linux: apt -y install fpc\\n\\t\\tIt contains a text IDE called fp\\n\\n https://www.freepascal.org/advantage.var\\n\\n(*)\\n\\nUSES\\n\\n crt;\\n\\nCONST\\n\\n SIZE = 9 ; // `SIZE = 9 : \\\"The Iceskater\\\" ( Obvious when Dutch ) `\\n n = SIZE * ord ( Odd ( SIZE ) ) ;\\n\\n CrLf = #13#10 ;\\n\\n\\n FUNCTION IsPrime ( n: integer ): boolean ;\\n\\n VAR\\n i: integer;\\n\\n BEGIN\\n\\n IF ( n < 2 ) THEN Exit ( False ) ;\\n IF ( n = 2 ) THEN Exit ( True ) ;\\n IF ( n mod 2 = 0 ) THEN Exit ( False ) ;\\n\\n FOR i := 3 TO Trunc ( Sqrt ( n ) ) DO\\n IF ( n mod i = 0 ) THEN Exit( False ) ;\\n\\n IsPrime := True ;\\n\\n END;\\n\\n\\n FUNCTION Spiral ( w, h, x, y : integer ) : integer ;\\n\\n BEGIN\\n\\n IF ( y > 0 ) THEN\\n Spiral := w + Spiral ( h - 1, w, y - 1, w - x - 1 )\\n ELSE\\n Spiral := x\\n\\n END ;\\n\\n PROCEDURE PrintSpiral ( s : string ) ;\\n\\n VAR\\n\\n h : integer = n ;\\n i : integer ;\\n j : integer ;\\n p : integer ;\\n w : integer = n ;\\n\\n BEGIN\\n\\n FOR i := h - 1 DOWNTO 0 DO\\n BEGIN\\n FOR j := w - 1 DOWNTO 0 DO\\n BEGIN\\n\\n p := w * h - Spiral ( w, h, j, i ) ;\\n IF IsPrime ( p ) THEN\\n IF ( s = '' ) THEN Write ( p:3 ) ELSE Write ( '`':3 )\\n ELSE Write ( ' ':3 )\\n\\n END;\\n WriteLn ;\\n END ;\\n END ;\\n\\nBEGIN\\n\\n IF ( n = 0 ) THEN\\n BEGIN\\n WriteLn ( 'Only odd numbers work for SIZE' ) ;\\n Exit;\\n END;\\n\\n PrintSpiral ( '' ) ;\\n WriteLn ( CrLf ) ;\\n PrintSpiral ( 'Symbol' ) ;\\n\\nEND.\\n\",\n \"language\": \"Pascal\"\n },\n {\n \"code\": \"use ntheory qw/is_prime/;\\nuse Imager;\\n\\nmy $n = shift || 512;\\nmy $start = shift || 1;\\nmy $file = \\\"ulam.png\\\";\\n\\nsub cell {\\n my($n, $x, $y, $start) = @_;\\n $y -= $n>>1;\\n $x -= ($n-1)>>1;\\n my $l = 2*(abs($x) > abs($y) ? abs($x) : abs($y));\\n my $d = ($y > $x) ? $l*3 + $x + $y : $l-$x-$y;\\n ($l-1)**2 + $d + $start - 1;\\n}\\n\\nmy $black = Imager::Color->new('#000000');\\nmy $white = Imager::Color->new('#FFFFFF');\\nmy $img = Imager->new(xsize => $n, ysize => $n, channels => 1);\\n$img->box(filled=>1, color=>$white);\\n\\nfor my $y (0 .. $n-1) {\\n for my $x (0 .. $n-1) {\\n my $v = cell($n, $x, $y, $start);\\n $img->setpixel(x => $x, y => $y, color => $black) if is_prime($v);\\n }\\n}\\n\\n$img->write(file => $file) or die \\\"Cannot write $file: \\\", $img->errstr, \\\"\\\\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;\\\">spiral</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #004080;\\\">integer</span> <span style=\\\"color: #000000;\\\">w</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">h</span><span style=\\\"color: #0000FF;\\\">,</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: #008080;\\\">return</span> <span style=\\\"color: #008080;\\\">iff</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">y</span><span style=\\\"color: #0000FF;\\\">?</span><span style=\\\"color: #000000;\\\">w</span><span style=\\\"color: #0000FF;\\\">+</span><span style=\\\"color: #000000;\\\">spiral</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">h</span><span style=\\\"color: #0000FF;\\\">-</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">w</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">y</span><span style=\\\"color: #0000FF;\\\">-</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">w</span><span style=\\\"color: #0000FF;\\\">-</span><span style=\\\"color: #000000;\\\">x</span><span style=\\\"color: #0000FF;\\\">-</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">):</span><span style=\\\"color: #000000;\\\">x</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;\\\">integer</span> <span style=\\\"color: #000000;\\\">w</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">9</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">h</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">9</span>\\n <span style=\\\"color: #008080;\\\">for</span> <span style=\\\"color: #000000;\\\">i</span><span style=\\\"color: #0000FF;\\\">=</span><span style=\\\"color: #000000;\\\">h</span><span style=\\\"color: #0000FF;\\\">-</span><span style=\\\"color: #000000;\\\">1</span> <span style=\\\"color: #008080;\\\">to</span> <span style=\\\"color: #000000;\\\">0</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: #008080;\\\">for</span> <span style=\\\"color: #000000;\\\">j</span><span style=\\\"color: #0000FF;\\\">=</span><span style=\\\"color: #000000;\\\">w</span><span style=\\\"color: #0000FF;\\\">-</span><span style=\\\"color: #000000;\\\">1</span> <span style=\\\"color: #008080;\\\">to</span> <span style=\\\"color: #000000;\\\">0</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;\\\">p</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">w</span><span style=\\\"color: #0000FF;\\\">*</span><span style=\\\"color: #000000;\\\">h</span><span style=\\\"color: #0000FF;\\\">-</span><span style=\\\"color: #000000;\\\">spiral</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">w</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">h</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">j</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">i</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;\\\">\\\"o \\\"</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">2</span><span style=\\\"color: #0000FF;\\\">-</span><span style=\\\"color: #7060A8;\\\">is_prime</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">p</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: #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\": \"-->\\n <span style=\\\"color: #004080;\\\">sequence</span> <span style=\\\"color: #000000;\\\">vc</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">video_config</span><span style=\\\"color: #0000FF;\\\">()</span>\\n <span style=\\\"color: #004080;\\\">integer</span> <span style=\\\"color: #000000;\\\">w</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">vc</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">VC_SCRNCOLS</span><span style=\\\"color: #0000FF;\\\">]-</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">h</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">vc</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #004600;\\\">VC_SCRNLINES</span><span style=\\\"color: #0000FF;\\\">]-</span><span style=\\\"color: #000000;\\\">1</span>\\n<!--\\n\",\n \"language\": \"Phix\"\n },\n {\n \"code\": \"(load \\\"@lib/simul.l\\\")\\n\\n(de ceil (A)\\n (/ (+ A 1) 2) )\\n\\n(de prime? (N)\\n (or\\n (= N 2)\\n (and\\n (> N 1)\\n (bit? 1 N)\\n (let S (sqrt N)\\n (for (D 3 T (+ D 2))\\n (T (> D S) T)\\n (T (=0 (% N D)) NIL) ) ) ) ) )\\n\\n(de ulam (N)\\n (let\\n (G (grid N N)\\n D '(north west south east .)\\n M (ceil N) )\\n (setq This\\n (intern\\n (pack\\n (char\\n (+ 96 (if (bit? 1 N) M (inc M))) )\\n M ) ) )\\n (=: V '_)\\n (with ((car D) This)\\n (for (X 2 (>= (* N N) X) (inc X))\\n (=: V (if (prime? X) '. '_))\\n (setq This\\n (or\\n (with ((cadr D) This)\\n (unless (: V) (pop 'D) This) )\\n ((pop D) This) ) ) ) )\\n G ) )\\n\\n(mapc\\n '((L)\\n (for This L\\n (prin (align 3 (: V))) )\\n (prinl) )\\n (ulam 9) )\\n\\n(bye)\\n\",\n \"language\": \"PicoLisp\"\n },\n {\n \"code\": \"function New-UlamSpiral ( [int]$N )\\n {\\n # Generate list of primes\\n $Primes = @( 2 )\\n For ( $X = 3; $X -le $N*$N; $X += 2 )\\n {\\n If ( -not ( $Primes | Where { $X % $_ -eq 0 } | Select -First 1 ) ) { $Primes += $X }\\n }\\n\\n # Initialize variables\\n $X = 0\\n $Y = -1\\n $i = $N * $N + 1\\n $Sign = 1\\n\\n # Intialize array\\n $A = New-Object 'boolean[,]' $N, $N\\n\\n # Set top row\\n 1..$N | ForEach { $Y += $Sign; $A[$X,$Y] = --$i -in $Primes }\\n\\n # For each remaining half spiral...\\n ForEach ( $M in ($N-1)..1 )\\n {\\n # Set the vertical quarter spiral\\n 1..$M | ForEach { $X += $Sign; $A[$X,$Y] = --$i -in $Primes }\\n\\n # Curve the spiral\\n $Sign = -$Sign\\n\\n # Set the horizontal quarter spiral\\n 1..$M | ForEach { $Y += $Sign; $A[$X,$Y] = --$i -in $Primes }\\n }\\n\\n # Convert the array of booleans to text output of dots and spaces\\n $Spiral = ForEach ( $X in 1..$N ) { ( 1..$N | ForEach { ( ' ', '.' )[$A[($X-1),($_-1)]] } ) -join '' }\\n return $Spiral\\n }\\n\\nNew-UlamSpiral 100\\n\",\n \"language\": \"PowerShell\"\n },\n {\n \"code\": \"# coding=UTF-8\\nfrom __future__ import print_function, division\\nfrom math import sqrt\\n\\ndef cell(n, x, y, start=1):\\n d, y, x = 0, y - n//2, x - (n - 1)//2\\n l = 2*max(abs(x), abs(y))\\n d = (l*3 + x + y) if y >= x else (l - x - y)\\n return (l - 1)**2 + d + start - 1\\n\\ndef show_spiral(n, symbol='# ', start=1, space=None):\\n top = start + n*n + 1\\n is_prime = [False,False,True] + [True,False]*(top//2)\\n for x in range(3, 1 + int(sqrt(top))):\\n if not is_prime[x]: continue\\n for i in range(x*x, top, x*2):\\n is_prime[i] = False\\n\\n cell_str = lambda x: f(x) if is_prime[x] else space\\n f = lambda _: symbol # how to show prime cells\\n\\n if space == None: space = ' '*len(symbol)\\n\\n if not len(symbol): # print numbers instead\\n max_str = len(str(n*n + start - 1))\\n if space == None: space = '.'*max_str + ' '\\n f = lambda x: ('%' + str(max_str) + 'd ')%x\\n\\n for y in range(n):\\n print(''.join(cell_str(v) for v in [cell(n, x, y, start) for x in range(n)]))\\n print()\\n\\nshow_spiral(10, symbol=u'♞', space=u'♘') # black are the primes\\nshow_spiral(9, symbol='', space=' - ')\\n# for filling giant terminals\\n#show_spiral(1001, symbol='*', start=42)\\n\",\n \"language\": \"Python\"\n },\n {\n \"code\": \" 32 spiral\\n witheach\\n [ witheach\\n [ 1024 swap -\\n isprime iff\\n say \\\" o\\\"\\n else say \\\" .\\\" ]\\n cr ]\\n\",\n \"language\": \"Quackery\"\n },\n {\n \"code\": \"## Plotting Ulam spiral (for primes) 2/12/17 aev\\n## plotulamspirR(n, clr, fn, ttl, psz=600), where: n - initial size;\\n## clr - color; fn - file name; ttl - plot title; psz - picture size.\\n##\\nrequire(numbers);\\nplotulamspirR <- function(n, clr, fn, ttl, psz=600) {\\n cat(\\\" *** START:\\\", date(), \\\"n=\\\",n, \\\"clr=\\\",clr, \\\"psz=\\\", psz, \\\"\\\\n\\\");\\n if (n%%2==0) {n=n+1}; n2=n*n;\\n x=y=floor(n/2); xmx=ymx=cnt=1; dir=\\\"R\\\";\\n ttl= paste(c(ttl, n,\\\"x\\\",n,\\\" matrix.\\\"), sep=\\\"\\\", collapse=\\\"\\\");\\n cat(\\\" ***\\\", ttl, \\\"\\\\n\\\");\\n M <- matrix(c(0), ncol=n, nrow=n, byrow=TRUE);\\n for (i in 1:n2) {\\n if(isPrime(i)) {M[x,y]=1};\\n if(dir==\\\"R\\\") {if(xmx>0) {x=x+1;xmx=xmx-1}\\n else {dir=\\\"U\\\";ymx=cnt;y=y-1;ymx=ymx-1}; next};\\n if(dir==\\\"U\\\") {if(ymx>0) {y=y-1;ymx=ymx-1}\\n else {dir=\\\"L\\\";cnt=cnt+1;xmx=cnt;x=x-1;xmx=xmx-1}; next};\\n if(dir==\\\"L\\\") {if(xmx>0) {x=x-1;xmx=xmx-1}\\n else {dir=\\\"D\\\";ymx=cnt;y=y+1;ymx=ymx-1}; next};\\n if(dir==\\\"D\\\") {if(ymx>0) {y=y+1;ymx=ymx-1}\\n else {dir=\\\"R\\\";cnt=cnt+1;xmx=cnt;x=x+1;xmx=xmx-1}; next};\\n };\\n plotmat(M, fn, clr, ttl,,psz);\\n cat(\\\" *** END:\\\",date(),\\\"\\\\n\\\");\\n}\\n\\n## Executing:\\nplotulamspirR(100, \\\"red\\\", \\\"UlamSpiralR1\\\", \\\"Ulam Spiral: \\\");\\nplotulamspirR(200, \\\"red\\\", \\\"UlamSpiralR2\\\", \\\"Ulam Spiral: \\\",1240);\\n\",\n \"language\": \"R\"\n },\n {\n \"code\": \"#lang racket\\n(require (only-in math/number-theory prime?))\\n\\n(define ((cell-fn n (start 1)) x y)\\n (let* ((y (- y (quotient n 2)))\\n (x (- x (quotient (sub1 n) 2)))\\n (l (* 2 (if (> (abs x) (abs y)) (abs x) (abs y))))\\n (d (if (>= y x) (+ (* l 3) x y) (- l x y))))\\n (+ (sqr (- l 1)) d start -1)))\\n\\n(define (show-spiral n\\n #:symbol (smb \\\"# \\\")\\n #:start (start 1)\\n #:space (space (and smb (make-string (string-length smb) #\\\\space))))\\n (define top (+ start (* n n) 1))\\n (define cell (cell-fn n start))\\n (define print-cell\\n (if smb\\n (λ (i p?) (display (if p? smb space)))\\n (let* ((max-len (string-length (~a (+ (sqr n) start -1))))\\n (space (or space (make-string (string-length (~a (+ (sqr n) start -1))) #\\\\_))))\\n (λ (i p?)\\n (display (if p? (~a #:width max-len i #:align 'right) space))\\n (display #\\\\space)))))\\n\\n (for* ((y (in-range 0 n)) #:when (unless (= y 0) (newline)) (x (in-range 0 n)))\\n (define c (cell x y))\\n (define p? (prime? c))\\n (print-cell c p?))\\n (newline))\\n\\n(show-spiral 9 #:symbol #f)\\n(show-spiral 10 #:symbol \\\"♞\\\" #:space \\\"♘\\\") ; black are the primes\\n(show-spiral 50 #:symbol \\\"*\\\" #:start 42)\\n; for filling giant terminals\\n; (show-spiral 1001 #:symbol \\\"*\\\" #:start 42)\\n\",\n \"language\": \"Racket\"\n },\n {\n \"code\": \"sub MAIN($max = 160, $start = 1) {\\n (my %world){0}{0} = 0;\\n my ($n, $dir, $side, $loc) = $start, 1, 0, 0+0i;\\n\\n while ++$side < $max {\\n\\tstep for ^$side; turn-left;\\n\\tstep for ^$side; turn-left;\\n }\\n\\n braille-graphics %world;\\n\\n sub step {\\n\\t$loc += $dir;\\n\\t%world{$loc.im}{$loc.re} = $n if (++$n).is-prime;\\n }\\n\\n sub turn-left { $dir ×= -i }\\n sub turn-right { $dir ×= i }\\n}\\n\\nsub braille-graphics (%a) {\\n my ($y-lo, $y-hi, $x-lo, $x-hi);\\n for %a.keys.map(+*) -> \\\\y {\\n for %a{y}.keys.map(+*) -> \\\\x {\\n $y-lo min= y; $y-hi max= y;\\n $x-lo min= x; $x-hi max= x;\\n }\\n }\\n\\n for $y-lo, $y-lo + 4 ...^ $y-hi -> \\\\y {\\n\\tfor $x-lo, $x-lo + 2 ...^ $x-hi -> \\\\x {\\n\\t my $cell = 0x2800;\\n $cell += 2⁰ if %a{y + 0}{x + 0};\\n $cell += 2¹ if %a{y + 1}{x + 0};\\n $cell += 2² if %a{y + 2}{x + 0};\\n $cell += 2³ if %a{y + 0}{x + 1};\\n $cell += 2⁴ if %a{y + 1}{x + 1};\\n $cell += 2⁵ if %a{y + 2}{x + 1};\\n $cell += 2⁶ if %a{y + 3}{x + 0};\\n $cell += 2⁷ if %a{y + 3}{x + 1};\\n print chr($cell);\\n\\t}\\n\\tprint \\\"\\\\n\\\";\\n }\\n}\\n\",\n \"language\": \"Raku\"\n },\n {\n \"code\": \"/*REXX program shows counter─clockwise Ulam spiral of primes shown in a square matrix.*/\\nparse arg size init char . /*obtain optional arguments from the CL*/\\nif size=='' | size==\\\",\\\" then size= 79 /*Not specified? Then use the default.*/\\nif init=='' | init==\\\",\\\" then init= 1 /* \\\" \\\" \\\" \\\" \\\" \\\" */\\nif char=='' then char= \\\"█\\\" /* \\\" \\\" \\\" \\\" \\\" \\\" */\\ntot=size**2 /*the total number of numbers in spiral*/\\n /*define the upper/bottom right corners*/\\nuR.=0; bR.=0; do od=1 by 2 to tot; _=od**2+1; uR._=1; _=_+od; bR._=1; end /*od*/\\n /*define the bottom/upper left corners.*/\\nbL.=0; uL.=0; do ev=2 by 2 to tot; _=ev**2+1; bL._=1; _=_+ev; uL._=1; end /*ev*/\\n\\napp=1; bigP=0; #p=0; inc=0; minR=1; maxR=1; r=1; $=0; $.=; !.=\\n /*▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒ construct the spiral #s.*/\\n do i=init for tot; r= r + inc; minR= min(minR, r); maxR= max(maxR, r)\\n x= isPrime(i); if x then bigP= max(bigP, i); #p= #p + x /*bigP, #primes.*/\\n if app then $.r= $.r || x /*append token.*/\\n else $.r= x || $.r /*prepend token.*/\\n if uR.i then do; app= 1; inc= +1; iterate /*i*/; end /*advance ↓ */\\n if bL.i then do; app= 0; inc= -1; iterate /*i*/; end /* \\\" ↑ */\\n if bR.i then do; app= 0; inc= 0; iterate /*i*/; end /* \\\" ► */\\n if uL.i then do; app= 1; inc= 0; iterate /*i*/; end /* \\\" ◄ */\\n end /*i*/ /* [↓] pack two */\\n /*lines ──► one.*/\\n do j=minR to maxR by 2; jp= j + 1; $= $ + 1 /*fold two lines*/\\n do k=1 for length($.j); top= substr($.j, k, 1) /*the 1st line.*/\\n bot= word( substr($.jp, k, 1) 0, 1) /*the 2nd line.*/\\n if top then if bot then !.$= !.$'█' /*has top & bot.*/\\n else !.$= !.$'▀' /*has top,¬ bot.*/\\n else if bot then !.$= !.$'▄' /*¬ top, has bot*/\\n else !.$= !.$' ' /*¬ top, ¬ bot*/\\n end /*k*/\\n end /*j*/ /* [↓] show the prime spiral matrix.*/\\n do m=1 for $; say !.m; end /*m*/\\nsay; say init 'is the starting point,' ,\\n tot 'numbers used,' #p \\\"primes found, largest prime:\\\" bigP\\nexit /*stick a fork in it, we're all done. */\\n/*──────────────────────────────────────────────────────────────────────────────────────*/\\nisPrime: procedure; parse arg x; if wordpos(x, '2 3 5 7 11 13 17 19') \\\\==0 then return 1\\n if x<17 then return 0; if x// 2 ==0 then return 0\\n if x// 3 ==0 then return 0\\n /*get the last digit*/ parse var x '' -1 _; if _==5 then return 0\\n if x// 7 ==0 then return 0\\n if x//11 ==0 then return 0\\n if x//13 ==0 then return 0\\n\\n do j=17 by 6 until j*j > x; if x//j ==0 then return 0\\n if x//(j+2) ==0 then return 0\\n end /*j*/; return 1\\n\",\n \"language\": \"REXX\"\n },\n {\n \"code\": \"/*REXX program shows a clockwise Ulam spiral of primes shown in a square matrix.*/\\nparse arg size init char . /*obtain optional arguments from the CL*/\\nif size=='' | size==\\\",\\\" then size= 79 /*Not specified? Then use the default.*/\\nif init=='' | init==\\\",\\\" then init= 1 /* \\\" \\\" \\\" \\\" \\\" \\\" */\\nif char=='' then char= \\\"█\\\" /* \\\" \\\" \\\" \\\" \\\" \\\" */\\ntot=size**2 /*the total number of numbers in spiral*/\\n /*define the upper/bottom right corners*/\\nuR.=0; bR.=0; do od=1 by 2 to tot; _=od**2+init; uR._=1; _=_+od; bR._=1; end /*od*/\\n /*define the bottom/upper left corners.*/\\nbL.=0; uL.=0; do ev=2 by 2 to tot; _=ev**2+init; bL._=1; _=_+ev; uL._=1; end /*ev*/\\n\\napp=1; bigP=0; #p=0; inc=0; minR=1; maxR=1; r=1; $=0; $.=; !.=\\n /*▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒ construct the spiral #s.*/\\n do i=init for tot; r= r + inc; minR= min(minR, r); maxR= max(maxR, r)\\n x= isPrime(i); if x then bigP= max(bigP, i); #p= #p + x /*bigP, #primes.*/\\n if app then $.r= $.r || x /*append token.*/\\n else $.r= x || $.r /*prepend token.*/\\n if uR.i then do; app= 1; inc= +1; iterate /*i*/; end /*advance ↓ */\\n if bL.i then do; app= 0; inc= -1; iterate /*i*/; end /* \\\" ↑ */\\n if bR.i then do; app= 0; inc= 0; iterate /*i*/; end /* \\\" ► */\\n if uL.i then do; app= 1; inc= 0; iterate /*i*/; end /* \\\" ◄ */\\n end /*i*/ /* [↓] pack two */\\n /*lines ──► one.*/\\n do j=minR to maxR by 2; jp= j + 1; $= $ + 1 /*fold two lines*/\\n do k=1 for length($.j); top= substr($.j, k, 1) /*the 1st line.*/\\n bot= word( substr($.jp, k, 1) 0, 1) /*the 2nd line.*/\\n if top then if bot then !.$= !.$'█' /*has top & bot.*/\\n else !.$= !.$'▀' /*has top,¬ bot.*/\\n else if bot then !.$= !.$'▄' /*¬ top, has bot*/\\n else !.$= !.$' ' /*¬ top, ¬ bot*/\\n end /*k*/\\n end /*j*/ /* [↓] show the prime spiral matrix.*/\\n do m=1 for $; say !.m; end /*m*/\\nsay; say init 'is the starting point,' ,\\n tot 'numbers used,' #p \\\"primes found, largest prime:\\\" bigP\\nexit /*stick a fork in it, we're all done. */\\n/*──────────────────────────────────────────────────────────────────────────────────────*/\\nisPrime: procedure; parse arg x; if wordpos(x, '2 3 5 7 11 13 17 19') \\\\==0 then return 1\\n if x<17 then return 0; if x// 2 ==0 then return 0\\n if x// 3 ==0 then return 0\\n /*get the last digit*/ parse var x '' -1 _; if _==5 then return 0\\n if x// 7 ==0 then return 0\\n if x//11 ==0 then return 0\\n if x//13 ==0 then return 0\\n\\n do j=17 by 6 until j*j > x; if x//j ==0 then return 0\\n if x//(j+2) ==0 then return 0\\n end /*j*/; return 1\\n\",\n \"language\": \"REXX\"\n },\n {\n \"code\": \"# Project : Ulam spiral (for primes)\\n\\nload \\\"guilib.ring\\\"\\nload \\\"stdlib.ring\\\"\\n\\npaint = null\\n\\nnew qapp\\n {\\n win1 = new qwidget() {\\n setwindowtitle(\\\"Ulam spiral\\\")\\n setgeometry(100,100,560,600)\\n label1 = new qlabel(win1) {\\n setgeometry(10,10,800,600)\\n settext(\\\"\\\")\\n }\\n new qpushbutton(win1) {\\n setgeometry(220,500,100,30)\\n settext(\\\"draw\\\")\\n setclickevent(\\\"draw()\\\")\\n }\\n show()\\n }\\n exec()\\n }\\n\\nfunc draw\\n p1 = new qpicture()\\n color = new qcolor() {\\n setrgb(0,0,255,255)\\n }\\n pen = new qpen() {\\n setcolor(color)\\n setwidth(1)\\n }\\n paint = new qpainter() {\\n begin(p1)\\n setpen(pen)\\n\\n usn = 81\\n ulamspiral(usn)\\n\\n endpaint()\\n }\\n label1 { setpicture(p1) show() }\\n return\\n\\nfunc ulamspiral(nr)\\n button = list(nr)\\n win1{\\n sizenew = sqrt(nr)\\n for n = 1 to nr\\n col = n%9\\n if col = 0 col = 9 ok\\n row = ceil(n/9)\\n\\n button[n] = new qpushbutton(win1)\\n {\\n setgeometry(60+col*40,60+row*40,40,40)\\n setclickevent(\\\"movetile(\\\" + string(n) +\\\")\\\")\\n show()\\n }\\n next\\n n = 9\\n result = newlist(n,n)\\n k = 1\\n top = 1\\n bottom = n\\n left = 1\\n right = n\\n while (k<=n*n)\\n for i=left to right\\n result[top][i]=k\\n k = k + 1\\n next\\n top = top + 1\\n for i=top to bottom\\n result[i][right]=k\\n k = k + 1\\n next\\n right = right - 1\\n for i=right to left step -1\\n result[bottom][i]=k\\n k = k + 1\\n next\\n bottom = bottom - 1\\n for i=bottom to top step -1\\n result[i][left] = k\\n k = k + 1\\n next\\n left = left + 1\\n end\\n for m = 1 to n\\n for p = 1 to n\\n pos = (m-1)*n + p\\n if isprime(result[m][p])\\n button[pos] {settext(string(result[m][p]))}\\n ok\\n next\\n next\\n }\\n\",\n \"language\": \"Ring\"\n },\n {\n \"code\": \"require 'prime'\\n\\ndef cell(n, x, y, start=1)\\n y, x = y - n/2, x - (n - 1)/2\\n l = 2 * [x.abs, y.abs].max\\n d = y >= x ? l*3 + x + y : l - x - y\\n (l - 1)**2 + d + start - 1\\nend\\n\\ndef show_spiral(n, symbol=nil, start=1)\\n puts \\\"\\\\nN : #{n}\\\"\\n format = \\\"%#{(start + n*n - 1).to_s.size}s \\\"\\n n.times do |y|\\n n.times do |x|\\n i = cell(n,x,y,start)\\n if symbol\\n print i.prime? ? symbol[0] : symbol[1]\\n else\\n print format % (i.prime? ? i : '')\\n end\\n end\\n puts\\n end\\nend\\n\\nshow_spiral(9)\\nshow_spiral(25)\\nshow_spiral(25, \\\"# \\\")\\n\",\n \"language\": \"Ruby\"\n },\n {\n \"code\": \"require 'prime'\\n\\ndef spiral_generator(x=0, y=0)\\n Enumerator.new do |yielder|\\n yielder << [x, y] # start position\\n dx, dy = 0, 1 # first direction\\n yielder << [x+=dx, y+=dy] # second position\\n 0.step do |i|\\n 2.times do\\n i.times{ yielder << [x+=dx, y+=dy] } # going straight\\n dx, dy = -dy, dx # 90 degree turn\\n yielder << [x+=dx, y+=dy]\\n end\\n end\\n end\\nend\\n\\ndef ulam_spiral(n, start=1)\\n h = Hash.new(0)\\n position = spiral_generator\\n (start ... start+n*n).each do |i|\\n pos = position.next\\n h[pos] = 1 if i.prime?\\n end\\n\\n chr = [[' ', '▄'], ['▀', '█']]\\n (xmin, xmax), (ymin, ymax) = h.keys.transpose.map(&:minmax)\\n (xmin..xmax).step(2).each do |x|\\n puts (ymin..ymax).map{|y| chr[h[[x,y]]][h[[x+1,y]]]}.join\\n end\\nend\\n\\n[11, 122].each do |n|\\n puts \\\"\\\\nN : #{n}\\\"\\n ulam_spiral(n)\\nend\\n\",\n \"language\": \"Ruby\"\n },\n {\n \"code\": \"use std::fmt;\\n\\nenum Direction { RIGHT, UP, LEFT, DOWN }\\nuse ulam::Direction::*;\\n\\n/// Indicates whether an integer is a prime number or not.\\nfn is_prime(a: u32) -> bool {\\n match a {\\n 2 => true,\\n x if x <= 1 || x % 2 == 0 => false,\\n _ => {\\n let max = f64::sqrt(a as f64) as u32;\\n let mut x = 3;\\n while x <= max {\\n if a % x == 0 { return false; }\\n x += 2;\\n }\\n true\\n }\\n }\\n}\\n\\npub struct Ulam { u : Vec<Vec<String>> }\\n\\nimpl Ulam {\\n /// Generates one `Ulam` object.\\n pub fn new(n: u32, s: u32, c: char) -> Ulam {\\n let mut spiral = vec![vec![String::new(); n as usize]; n as usize];\\n let mut dir = RIGHT;\\n let mut y = (n / 2) as usize;\\n let mut x = if n % 2 == 0 { y - 1 } else { y }; // shift left for even n's\\n for j in s..n * n + s {\\n spiral[y][x] = if is_prime(j) {\\n if c == '\\\\0' { format!(\\\"{:4}\\\", j) } else { format!(\\\" {} \\\", c) }\\n }\\n else { String::from(\\\" ---\\\") };\\n\\n match dir {\\n RIGHT => if x as u32 <= n - 1 && spiral[y - 1][x].is_empty() && j > s { dir = UP; },\\n UP => if spiral[y][x - 1].is_empty() { dir = LEFT; },\\n LEFT => if x == 0 || spiral[y + 1][x].is_empty() { dir = DOWN; },\\n DOWN => if spiral[y][x + 1].is_empty() { dir = RIGHT; }\\n };\\n\\n match dir { RIGHT => x += 1, UP => y -= 1, LEFT => x -= 1, DOWN => y += 1 };\\n }\\n Ulam { u: spiral }\\n }\\n}\\n\\nimpl fmt::Display for Ulam {\\n fn fmt(&self, f: &mut fmt::Formatter) -> fmt::Result {\\n for row in &self.u {\\n writeln!(f, \\\"{}\\\", format!(\\\"{:?}\\\", row).replace(\\\"\\\\\\\"\\\", \\\"\\\").replace(\\\", \\\", \\\"\\\"));\\n };\\n writeln!(f, \\\"\\\")\\n }\\n}\\n\",\n \"language\": \"Rust\"\n },\n {\n \"code\": \"mod ulam;\\nuse ulam::*;\\n\\n// Program entry point.\\nfn main() {\\n print!(\\\"{}\\\", Ulam::new(9, 1, '\\\\0'));\\n print!(\\\"{}\\\", Ulam::new(9, 1, '*'));\\n}\\n\",\n \"language\": \"Rust\"\n },\n {\n \"code\": \"object Ulam extends App {\\n generate(9)()\\n generate(9)('*')\\n\\n private object Direction extends Enumeration { val RIGHT, UP, LEFT, DOWN = Value }\\n\\n private def generate(n: Int, i: Int = 1)(c: Char = 0) {\\n assert(n > 1, \\\"n > 1\\\")\\n val s = new Array[Array[String]](n).transform {_ => new Array[String](n) }\\n\\n import Direction._\\n var dir = RIGHT\\n var y = n / 2\\n var x = if (n % 2 == 0) y - 1 else y // shift left for even n's\\n for (j <- i to n * n - 1 + i) {\\n s(y)(x) = if (isPrime(j)) if (c == 0) \\\"%4d\\\".format(j) else s\\\" $c \\\" else \\\" ---\\\"\\n\\n dir match {\\n case RIGHT => if (x <= n - 1 && s(y - 1)(x) == null && j > i) dir = UP\\n case UP => if (s(y)(x - 1) == null) dir = LEFT\\n case LEFT => if (x == 0 || s(y + 1)(x) == null) dir = DOWN\\n case DOWN => if (s(y)(x + 1) == null) dir = RIGHT\\n }\\n\\n dir match {\\n case RIGHT => x += 1\\n case UP => y -= 1\\n case LEFT => x -= 1\\n case DOWN => y += 1\\n }\\n }\\n println(\\\"[\\\" + s.map(_.mkString(\\\"\\\")).reduceLeft(_ + \\\"]\\\\n[\\\" + _) + \\\"]\\\\n\\\")\\n }\\n\\n private def isPrime(a: Int): Boolean = {\\n if (a == 2) return true\\n if (a <= 1 || a % 2 == 0) return false\\n val max = Math.sqrt(a.toDouble).toInt\\n for (n <- 3 to max by 2)\\n if (a % n == 0) return false\\n true\\n }\\n}\\n\",\n \"language\": \"Scala\"\n },\n {\n \"code\": \"require('Imager')\\n \\nvar (n=512, start=1, file='ulam.png')\\n\\nARGV.getopt(\\n 'n=i' => \\\\n,\\n 's=i' => \\\\start,\\n 'f=s' => \\\\file,\\n)\\n \\nfunc cell(n, x, y, start) {\\n y -= (n >> 1)\\n x -= (n-1 >> 1)\\n var l = 2*(x.abs > y.abs ? x.abs : y.abs)\\n var d = (y > x ? (l*3 + x + y) : (l - x - y))\\n (l-1)**2 + d + start - 1\\n}\\n \\nvar black = %O<Imager::Color>.new('#000000')\\nvar white = %O<Imager::Color>.new('#FFFFFF')\\n \\nvar img = %O<Imager>.new(xsize => n, ysize => n, channels => 1)\\nimg.box(filled => 1, color => white)\\n \\nfor y=(^n), x=(^n) {\\n if (cell(n, x, y, start).is_prime) {\\n img.setpixel(x => x, y => y, color => black)\\n }\\n}\\n \\nimg.write(file => file)\\n\",\n \"language\": \"Sidef\"\n },\n {\n \"code\": \"proc is_prime {n} {\\n if {$n == 1} {return 0}\\n if {$n in {2 3 5}} {return 1}\\n for {set i 2} {$i*$i <= $n} {incr i} {\\n if {$n % $i == 0} {return 0}\\n }\\n return 1\\n}\\n\\nproc spiral {w h} {\\n yield [info coroutine]\\n set x [expr {$w / 2}]\\n set y [expr {$h / 2}]\\n set n 1\\n set dir 0\\n set steps 1\\n set step 1\\n while {1} {\\n yield [list $x $y]\\n switch $dir {\\n 0 {incr x}\\n 1 {incr y -1}\\n 2 {incr x -1}\\n 3 {incr y}\\n }\\n if {![incr step -1]} {\\n set dir [expr {($dir+1)%4}]\\n if {$dir % 2 == 0} {\\n incr steps\\n }\\n set step $steps\\n }\\n }\\n}\\n\\nset radius 16\\nset side [expr {1 + 2 * $radius}]\\nset n [expr {$side * $side}]\\nset cells [lrepeat $side [lrepeat $side \\\"\\\"]]\\nset i 1\\n\\ncoroutine spin spiral $side $side\\n\\nwhile {$i < $n} {\\n lassign [spin] y x\\n set c [expr {[is_prime $i] ? \\\"\\\\u169b\\\" : \\\" \\\"}]\\n lset cells $x $y $c\\n incr i\\n}\\n\\nputs [join [lmap row $cells {join $row \\\" \\\"}] \\\\n]\\n\",\n \"language\": \"Tcl\"\n },\n {\n \"code\": \"Function build_spiral(n)\\n\\t'declare a two dimentional array\\n\\tDim matrix()\\n\\tReDim matrix(n-1,n-1)\\n\\t'determine starting point\\n\\tx = (n-1)/2 : y = (n-1)/2\\n\\t'set the initial iterations\\n\\tx_max = 1 : y_max = 1 : count = 1\\n\\t'set initial direction\\n\\tdir = \\\"R\\\"\\n\\t'populate the array\\n\\tFor i = 1 To n*n\\n\\t\\tl = Len(n*n)\\n\\t\\tIf IsPrime(i) Then\\n\\t\\t\\tmatrix(x,y) = Right(\\\"000\\\" & i,l)\\n\\t\\tElse\\n\\t\\t\\tmatrix(x,y) = String(l,\\\"-\\\")\\n\\t\\tEnd If\\n\\t\\tSelect Case dir\\n\\t\\t\\tCase \\\"R\\\"\\n\\t\\t\\t\\tIf x_max > 0 Then\\n\\t\\t\\t\\t\\tx = x + 1 : x_max = x_max - 1\\n\\t\\t\\t\\tElse\\n\\t\\t\\t\\t\\tdir = \\\"U\\\" : y_max = count\\n\\t\\t\\t\\t\\ty = y - 1 : y_max = y_max - 1\\n\\t\\t\\t\\tEnd If\\n\\t\\t\\tCase \\\"U\\\"\\n\\t\\t\\t\\tIf y_max > 0 Then\\n\\t\\t\\t\\t\\ty = y - 1 : y_max = y_max - 1\\n\\t\\t\\t\\tElse\\n\\t\\t\\t\\t\\tdir = \\\"L\\\" : count = count + 1 : x_max = count\\n\\t\\t\\t\\t\\tx = x - 1 : x_max = x_max - 1\\n\\t\\t\\t\\tEnd If\\n\\t\\t\\tCase \\\"L\\\"\\n\\t\\t\\t\\tIf x_max > 0 Then\\n\\t\\t\\t\\t\\tx = x - 1 : x_max = x_max - 1\\n\\t\\t\\t\\tElse\\n\\t\\t\\t\\t\\tdir = \\\"D\\\" : y_max = count\\n\\t\\t\\t\\t\\ty = y + 1 : y_max = y_max - 1\\n\\t\\t\\t\\tEnd If\\n\\t\\t\\tCase \\\"D\\\"\\n\\t\\t\\t\\tIf y_max > 0 Then\\n\\t\\t\\t\\t\\ty = y + 1 : y_max = y_max - 1\\n\\t\\t\\t\\tElse\\n\\t\\t\\t\\t\\tdir = \\\"R\\\" : count = count + 1 : x_max = count\\n\\t\\t\\t\\t\\tx = x + 1 : x_max = x_max - 1\\n\\t\\t\\t\\tEnd If\\n\\t\\tEnd Select\\n\\tNext\\n\\t'print the matrix\\n\\tFor y = 0 To n - 1\\n\\t\\tFor x = 0 To n - 1\\n\\t\\t\\tIf x = n - 1 Then\\n\\t\\t\\t\\tWScript.StdOut.Write matrix(x,y)\\n\\t\\t\\tElse\\n\\t\\t\\t\\tWScript.StdOut.Write matrix(x,y) & vbTab\\n\\t\\t\\tEnd If\\n\\t\\tNext\\n\\t\\tWScript.StdOut.WriteLine\\n\\tNext\\nEnd Function\\n\\nFunction IsPrime(n)\\n\\tIf n = 2 Then\\n\\t\\tIsPrime = True\\n\\tElseIf n <= 1 Or n Mod 2 = 0 Then\\n\\t\\tIsPrime = False\\n\\tElse\\n\\t\\tIsPrime = True\\n\\t\\tFor i = 3 To Int(Sqr(n)) Step 2\\n\\t\\t\\tIf n Mod i = 0 Then\\n\\t\\t\\t\\tIsPrime = False\\n\\t\\t\\t\\tExit For\\n\\t\\t\\tEnd If\\n\\t\\tNext\\n\\tEnd If\\nEnd Function\\n\\n'test with 9\\nbuild_spiral(9)\\n\",\n \"language\": \"VBScript\"\n },\n {\n \"code\": \"import \\\"./dynamic\\\" for Enum\\nimport \\\"./math\\\" for Int\\nimport \\\"./str\\\" for Char\\nimport \\\"./fmt\\\" for Fmt\\n\\nvar Direction = Enum.create(\\\"Direction\\\", [\\\"right\\\", \\\"up\\\", \\\"left\\\", \\\"down\\\"])\\n\\nclass Ulam {\\n static generate(n, i, c) {\\n if (n <= 1) Fiber.abort (\\\"'n' must be more than 1.\\\")\\n var s = List.filled(n, null)\\n for (i in 0...n) s[i] = List.filled(n, \\\"\\\")\\n var dir = Direction.right\\n var y = (n/2).floor\\n var x = (n % 2 == 0) ? y - 1 : y // shift left for even n's\\n for (j in i..n * n - 1 + i) {\\n s[y][x] = Int.isPrime(j) ? (Char.isDigit(c) ? Fmt.d(4, j) : \\\" %(c) \\\") : \\\" ---\\\"\\n if (dir == Direction.right) {\\n if (x <= n - 1 && s[y - 1][x] == \\\"\\\" && j > i) dir = Direction.up\\n } else if (dir == Direction.up) {\\n if (s[y][x - 1] == \\\"\\\") dir = Direction.left\\n } else if (dir == Direction.left) {\\n if (x == 0 || s[y + 1][x] == \\\"\\\") dir = Direction.down\\n } else if (dir == Direction.down) {\\n if (s[y][x + 1] == \\\"\\\") dir = Direction.right\\n }\\n\\n if (dir == Direction.right) {\\n x = x + 1\\n } else if (dir == Direction.up) {\\n y = y - 1\\n } else if (dir == Direction.left) {\\n x = x - 1\\n } else if (dir == Direction.down) {\\n y = y + 1\\n }\\n }\\n\\n for (row in s) Fmt.print(\\\"$s\\\", row)\\n System.print()\\n }\\n}\\n\\nUlam.generate(9, 1, \\\"0\\\") // with digits\\nUlam.generate(9, 1, \\\"*\\\") // with *\\n\",\n \"language\": \"Wren\"\n },\n {\n \"code\": \"func IsPrime(N); \\\\Return 'true' if N is prime\\nint N, I;\\n[if N <= 2 then return N = 2;\\nif (N&1) = 0 then \\\\even >2\\\\ return false;\\nfor I:= 3 to sqrt(N) do\\n [if rem(N/I) = 0 then return false;\\n I:= I+1;\\n ];\\nreturn true;\\n];\\n\\nint N, X, Y, Len, Dir, DX, DY, Side, Step;\\n[SetVid($13);\\nX:= 320/2; Y:= 200/2;\\nN:= 1;\\nLen:= 1;\\nDir:= 0; \\\\Rt, Up, Lt, Dn\\nDX:= [1, 0, -1, 0];\\nDY:= [0, -1, 0, 1];\\nrepeat for Side:= 1 to 2 do\\n [for Step:= 1 to Len do\\n [if IsPrime(N) then Point(X, Y, $F);\\n N:= N+1;\\n X:= X + DX(Dir); \\\\move in current direction\\n Y:= Y + DY(Dir);\\n ];\\n Dir:= (Dir+1) & 3; \\\\set next direction\\n ];\\n Len:= Len+1;\\nuntil Y = 0; \\\\reached top\\n]\\n\",\n \"language\": \"XPL0\"\n },\n {\n \"code\": \"sub is_prime(n)\\n local p\\n\\n for p=2 to n\\n if p*p>n break\\n if mod(n,p)=0 return false\\n next\\n return n>=2\\nend sub\\n\\nsub spiral(w, h, x, y)\\n if y then\\n return w+spiral(h-1,w,y-1,w-x-1)\\n else\\n return x\\n end if\\nend sub\\n\\nw = 9 : h = 9\\nfor i=h-1 to 0 step -1\\n for j=w-1 to 0 step -1\\n p = w*h-spiral(w,h,j,i)\\n print mid$(\\\" o\\\", is_prime(p) + 1, 1);\\n next\\n print\\nnext\\n\",\n \"language\": \"Yabasic\"\n },\n {\n \"code\": \"var primes =Utils.Generator(Import(\\\"sieve.zkl\\\").postponed_sieve); // lazy\\nvar offsets=Utils.cycle( T(0,1),T(-1,0),T(0,-1),T(1,0) ); // (N,E,S,W), lazy\\nconst BLACK=0, WHITE=0xff|ff|ff, GREEN=0x00|ff|00, EMPTY=0x080|80|80;\\nfcn uspiral(N){\\n if((M:=N).isEven) M+=1; // need odd width, height\\n img,p := PPM(M,M,EMPTY), primes.next(); // 2 .. 250,007: 22,045 primes\\n x,y,n := N/2,x,2; img[x,y]=GREEN; x+=1; // start on 2 facing \\\"north\\\"\\n while(True){\\n ox,oy:=offsets.next(); leftx,lefty:=offsets.peek(); // set direction\\n while(True){\\n\\t img[x,y]=( if(n==p){ p=primes.next(); WHITE } else BLACK );\\n\\t if(n==N*N) break(2); // all done\\n\\t n+=1;\\n\\t if(img[x+leftx,y+lefty]==EMPTY) // nothing to my left, turn left\\n\\t { x+=leftx; y+=lefty; break; }\\n\\t x+=ox; y+=oy;\\t// move in a straight line\\n }\\n }\\n img\\n}\\n\\nuspiral(500).write(File(\\\"ulamSpiral.ppm\\\",\\\"wb\\\"));\\n\",\n \"language\": \"Zkl\"\n },\n {\n \"code\": \" 1 IF n<max THEN LET n=n+1: FOR p=2 TO n-1: LET r= (INT (n/p)<>n/p): IF r THEN NEXT p\\n 2 IF p=n THEN LET pr=pr+1: LET kx=(255-xx AND k<3)+(xx AND k>2): LET ky=(175-yy AND (k=1 OR k=3)+(yy AND (k=2 OR k=4))): PLOT kx,ky: PRINT #0;AT 0,0;n;\\\" pr\\\";pr\\n 3 RETURN\\n 10 CLS : PRINT \\\"ULAM SPIRAL OF PRIME's\\\"'''\\\"it takes DAYS at max level\\\"'\\\"and 3.5MHz\\\"\\n 12 INPUT \\\"square size= LxL\\\"'\\\"l: \\\";l: IF l<>INT l OR l<1 OR l>176 THEN GO TO 12\\n 13 LET max=l*l: PRINT ''l;\\\"x\\\";l;\\\"=\\\";max;\\\" positive integers\\\"\\n 15 INPUT \\\"0,0 orientation 1-4: \\\";k: IF k<1 OR k>4 THEN GO TO 15\\n 20 CLS : LET xx=127: LET yy=88: LET n=0: LET pr=0: PRINT #0;AT 0,15;max\\n 40 FOR q=0 TO l: LET m=INT (q/2)=q/2: LET m=-1*m+NOT m\\n 60 FOR x=0 TO q*m STEP m: GO SUB 1 : LET xx=xx+m: NEXT x\\n 80 FOR y=0 TO q*m STEP m: GO SUB 1 : LET yy=yy+m: NEXT y: NEXT q\\n\",\n \"language\": \"ZX-Spectrum-Basic\"\n }\n]","isConversational":false},"task_name":{"kind":"string","value":"Ulam-spiral-for-primes-"}}},{"rowIdx":1780,"cells":{"solutions":{"kind":"list like","value":[{"code":"---\nfrom: http://rosettacode.org/wiki/Ultra_useful_primes\n","language":"00-META"},{"code":"An '''ultra-useful prime''' is a member of the sequence where each <span style=\"font-size:125%;\">'''a(n)'''</span> is the smallest positive integer <span style=\"font-size:125%;\">'''k'''</span> such that <span style=\"font-size:125%;\">'''2<sup>(2<sup>n</sup>)</sup> - k'''</span> is prime.\n\n'''''k''' must always be an odd number since 2 to any power is always even.''\n\n\n;Task\n\n* Find and show here, on this page, the first '''10''' elements of the sequence.\n\n\n;Stretch \n\n* Find and show the next several elements. (The numbers get really big really fast. Only nineteen elements have been identified as of this writing.)\n\n\n;See also\n\n* [[oeis:A058220|OEIS:A058220 - Ultra-useful primes: smallest k such that 2^(2^n) - k is prime]]\n \n\n","language":"00-TASK"},{"code":"BEGIN # find members of the sequence a(n) = smallest k such that 2^(2^n) - k is prime #\n PR precision 650 PR # set number of digits for LONG LOMG INT #\n # 2^(2^10) has 308 digits but we need more for #\n # Miller Rabin primality testing #\n PR read \"primes.incl.a68\" PR # include the prime related utilities #\n FOR n TO 10 DO\n LONG LONG INT two up 2 up n = LONG LONG INT( 2 ) ^ ( 2 ^ n );\n FOR i BY 2\n WHILE IF is probably prime( two up 2 up n - i ) THEN\n # found a sequence member #\n print( ( \" \", whole( i, 0 ) ) );\n FALSE # stop looking #\n ELSE\n TRUE # haven't found a sequence member yet #\n FI\n DO SKIP OD\n OD\nEND\n","language":"ALGOL-68"},{"code":"ultraUseful: function [n][\n k: 1\n p: (2^2^n) - k\n while ø [\n if prime? p -> return k\n p: p-2\n k: k+2\n ]\n]\n\nprint [pad \"n\" 3 \"|\" pad.right \"k\" 4]\nprint repeat \"-\" 10\nloop 1..10 'x ->\n print [(pad to :string x 3) \"|\" (pad.right to :string ultraUseful x 4)]\n","language":"Arturo"},{"code":"#include <stdio.h>\n#include <gmp.h>\n\nint a(unsigned int n) {\n int k;\n mpz_t p;\n mpz_init_set_ui(p, 1);\n mpz_mul_2exp(p, p, 1 << n);\n mpz_sub_ui(p, p, 1);\n for (k = 1; ; k += 2) {\n if (mpz_probab_prime_p(p, 15) > 0) return k;\n mpz_sub_ui(p, p, 2);\n }\n}\n\nint main() {\n unsigned int n;\n printf(\" n k\\n\");\n printf(\"----------\\n\");\n for (n = 1; n < 15; ++n) printf(\"%2d %d\\n\", n, a(n));\n return 0;\n}\n","language":"C"},{"code":"for n = 1 to 10\n\n\tlet k = -1\n\n\tdo\n\n\t\tlet k = k + 2\n\t\twait\n\n\tloop prime(2 ^ (2 ^ n) - k) = 0\n\n\tprint \"n = \", n, \" k = \", k\n\nnext n\n","language":"Craft-Basic"},{"code":"USING: io kernel lists lists.lazy math math.primes prettyprint ;\n\n: useful ( -- list )\n 1 lfrom\n [ 2^ 2^ 1 lfrom [ - prime? ] with lfilter car ] lmap-lazy ;\n\n10 useful ltake [ pprint bl ] leach nl\n","language":"Factor"},{"code":"#include \"isprime.bas\"\n\nDim As Longint n, k, limit = 10\nDim As ulongint num\nFor n = 1 To limit\n k = -1\n Do\n k += 2\n num = (2 ^ (2 ^ n)) - k\n If isPrime(num) Then\n Print \"n = \"; n; \" k = \"; k\n Exit Do\n End If\n Loop\nNext\n\nSleep\n","language":"FreeBASIC"},{"code":"package main\n\nimport (\n \"fmt\"\n big \"github.com/ncw/gmp\"\n)\n\nvar two = big.NewInt(2)\n\nfunc a(n uint) int {\n one := big.NewInt(1)\n p := new(big.Int).Lsh(one, 1 << n)\n p.Sub(p, one)\n for k := 1; ; k += 2 {\n if p.ProbablyPrime(15) {\n return k\n }\n p.Sub(p, two)\n }\n}\n\nfunc main() {\n fmt.Println(\" n k\")\n fmt.Println(\"----------\")\n for n := uint(1); n < 14; n++ {\n fmt.Printf(\"%2d %d\\n\", n, a(n))\n }\n}\n","language":"Go"},{"code":"uup=: {{\n ref=. 2^2x^y+1\n k=. 1\n while. -. 1 p: ref-k do. k=. k+2 end.\n}}\"0\n","language":"J"},{"code":" uup i.10\n1 3 5 15 5 59 159 189 569 105\n","language":"J"},{"code":"import java.math.BigInteger;\n\npublic final class UltraUsefulPrimes {\n\n\tpublic static void main(String[] args) {\n\t\tfor ( int n = 1; n <= 10; n++ ) {\n\t\t\tshowUltraUsefulPrime(n);\n\t\t}\t\t\n\t}\n\t\n\tprivate static void showUltraUsefulPrime(int n) {\n\t\tBigInteger prime = BigInteger.ONE.shiftLeft(1 << n);\n\t\tBigInteger k = BigInteger.ONE;\n\t\twhile ( ! prime.subtract(k).isProbablePrime(20) ) {\n\t\t\tk = k.add(BigInteger.TWO);\n\t\t}\n\t\t\n\t\tSystem.out.print(k + \" \");\t\t\n\t}\n\n}\n","language":"Java"},{"code":"using Primes\n\nnearpow2pow2prime(n) = findfirst(k -> isprime(2^(big\"2\"^n) - k), 1:10000)\n\n@time println([nearpow2pow2prime(n) for n in 1:12])\n","language":"Julia"},{"code":"ClearAll[FindUltraUsefulPrimeK]\nFindUltraUsefulPrimeK[n_] := Module[{num, tmp},\n num = 2^(2^n);\n Do[\n If[PrimeQ[num - k],\n tmp = k;\n Break[];\n ]\n ,\n {k, 1, \\[Infinity], 2}\n ];\n tmp\n ]\nres = FindUltraUsefulPrimeK /@ Range[13];\nTableForm[res, TableHeadings -> Automatic]\n","language":"Mathematica"},{"code":"import std/strformat\nimport integers\n\nlet One = newInteger(1)\n\necho \" n k\"\nvar count = 1\nvar n = 1\nwhile count <= 13:\n var k = 1\n var p = One shl (1 shl n) - k\n while not p.isPrime:\n p -= 2\n k += 2\n echo &\"{n:2} {k}\"\n inc n\n inc count\n","language":"Nim"},{"code":"use strict;\nuse warnings;\nuse feature 'say';\nuse bigint;\nuse ntheory 'is_prime';\n\nsub useful {\n my @n = @_;\n my @u;\n for my $n (@n) {\n my $p = 2**(2**$n);\n LOOP: for (my $k = 1; $k < $p; $k += 2) {\n is_prime($p-$k) and push @u, $k and last LOOP;\n }\n }\n @u\n}\n\nsay join ' ', useful 1..13;\n","language":"Perl"},{"code":"(phixonline)-->\n <span style=\"color: #008080;\">with</span> <span style=\"color: #008080;\">javascript_semantics</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: #008080;\">include</span> <span style=\"color: #004080;\">mpfr</span><span style=\"color: #0000FF;\">.</span><span style=\"color: #000000;\">e</span>\n <span style=\"color: #004080;\">mpz</span> <span style=\"color: #000000;\">p</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">mpz_init</span><span style=\"color: #0000FF;\">()</span>\n\n <span style=\"color: #008080;\">function</span> <span style=\"color: #000000;\">a</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: #7060A8;\">mpz_ui_pow_ui</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">p</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">2</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #7060A8;\">power</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">2</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">n</span><span style=\"color: #0000FF;\">))</span>\n <span style=\"color: #7060A8;\">mpz_sub_si</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">p</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">p</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;\">k</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">1</span>\n <span style=\"color: #008080;\">while</span> <span style=\"color: #008080;\">not</span> <span style=\"color: #7060A8;\">mpz_prime</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">p</span><span style=\"color: #0000FF;\">)</span> <span style=\"color: #008080;\">do</span>\n <span style=\"color: #000000;\">k</span> <span style=\"color: #0000FF;\">+=</span> <span style=\"color: #000000;\">2</span>\n <span style=\"color: #7060A8;\">mpz_sub_si</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">p</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">p</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;\">while</span>\n <span style=\"color: #008080;\">return</span> <span style=\"color: #000000;\">k</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;\">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;\">\"%d \"</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">a</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: #008080;\">if</span> <span style=\"color: #7060A8;\">machine_bits</span><span style=\"color: #0000FF;\">()=</span><span style=\"color: #000000;\">64</span> <span style=\"color: #008080;\">then</span>\n <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: #008080;\">for</span> <span style=\"color: #000000;\">i</span><span style=\"color: #0000FF;\">=</span><span style=\"color: #000000;\">11</span> <span style=\"color: #008080;\">to</span> <span style=\"color: #000000;\">13</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 \"</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">a</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: #008080;\">end</span> <span style=\"color: #008080;\">if</span>\n <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<!--\n","language":"Phix"},{"code":"# useful.py by xing216\nfrom gmpy2 import is_prime\ndef useful(n):\n k = 1\n is_useful = False\n while is_useful == False:\n if is_prime(2**(2**n) - k):\n is_useful = True\n break\n k += 2\n return k\nif __name__ == \"__main__\":\n print(\"n | k\")\n for i in range(1,14):\n print(f\"{i:<4}{useful(i)}\")\n","language":"Python"},{"code":"sub useful ($n) {\n (|$n).map: {\n my $p = 1 +< ( 1 +< $_ );\n ^$p .first: ($p - *).is-prime\n }\n}\n\nput useful 1..10;\n\nput useful 11..13;\n","language":"Raku"},{"code":"see \"works...\" + nl\nlimit = 10\n\nfor n = 1 to limit\n k = -1\n while true\n k = k + 2\n num = pow(2,pow(2,n)) - k\n if isPrime(num)\n ? \"n = \" + n + \" k = \" + k\n exit\n ok\n end\nnext\nsee \"done..\" + nl\n\nfunc isPrime num\n if (num <= 1) return 0 ok\n if (num % 2 = 0 and num != 2) return 0 ok\n for i = 3 to floor(num / 2) -1 step 2\n if (num % i = 0) return 0 ok\n next\n return 1\n","language":"Ring"},{"code":"require 'openssl'\n\n(1..10).each do |n|\n pow = 2 ** (2 ** n)\n print \"#{n}:\\t\"\n puts (1..).step(2).detect{|k| OpenSSL::BN.new(pow-k).prime?}\nend\n","language":"Ruby"},{"code":"say(\" n k\")\nsay(\"----------\")\n\nfor n in (1..13) {\n var t = 2**(2**n)\n printf(\"%2d %d\\n\", n, {|k| t - k -> is_prob_prime }.first)\n}\n","language":"Sidef"},{"code":"import math\n\nfn main() {\n\tlimit := 10 // depending on computer, higher numbers = longer times\n\tmut num, mut k := i64(0), i64(0)\n\tprintln(\"n k\\n-------\")\n\tfor n in 1..limit {\n\t\tk = -1\n\t\tfor n < limit {\n\t\t\t k = k + 2\n\t\t\t num = math.powi(2, math.powi(2 , n)) - k\n\t\t\t if is_prime(num) == true {\n\t\t\t\t println(\"${n} ${k}\")\n\t\t\t\t break\n\t\t\t }\n\t\t}\n\t}\n}\n\nfn is_prime(num i64) bool {\n if num <= 1 {return false}\n if num % 2 == 0 && num != 2 {return false}\n\t for idx := 3; idx <= math.floor(num / 2) - 1; idx += 2 {\n if num % idx == 0 {return false}\n }\n return true\n}\n","language":"V-(Vlang)"},{"code":"import \"./big\" for BigInt\nimport \"./fmt\" for Fmt\n\nvar one = BigInt.one\nvar two = BigInt.two\n\nvar a = Fn.new { |n|\n var p = (BigInt.one << (1 << n)) - one\n var k = 1\n while (true) {\n if (p.isProbablePrime(5)) return k\n p = p - two\n k = k + 2\n }\n}\n\nSystem.print(\" n k\")\nSystem.print(\"----------\")\nfor (n in 1..10) Fmt.print(\"$2d $d\", n, a.call(n))\n","language":"Wren"},{"code":"import \"./gmp\" for Mpz\nimport \"./fmt\" for Fmt\n\nvar one = Mpz.one\nvar two = Mpz.two\n\nvar a = Fn.new { |n|\n var p = Mpz.one.lsh(1 << n).sub(one)\n var k = 1\n while (true) {\n if (p.probPrime(15) > 0) return k\n p.sub(two)\n k = k + 2\n }\n}\n\nSystem.print(\" n k\")\nSystem.print(\"----------\")\nfor (n in 1..14) Fmt.print(\"$2d $d\", n, a.call(n))\n","language":"Wren"}],"string":"[\n {\n \"code\": \"---\\nfrom: http://rosettacode.org/wiki/Ultra_useful_primes\\n\",\n \"language\": \"00-META\"\n },\n {\n \"code\": \"An '''ultra-useful prime''' is a member of the sequence where each <span style=\\\"font-size:125%;\\\">'''a(n)'''</span> is the smallest positive integer <span style=\\\"font-size:125%;\\\">'''k'''</span> such that <span style=\\\"font-size:125%;\\\">'''2<sup>(2<sup>n</sup>)</sup> - k'''</span> is prime.\\n\\n'''''k''' must always be an odd number since 2 to any power is always even.''\\n\\n\\n;Task\\n\\n* Find and show here, on this page, the first '''10''' elements of the sequence.\\n\\n\\n;Stretch \\n\\n* Find and show the next several elements. (The numbers get really big really fast. Only nineteen elements have been identified as of this writing.)\\n\\n\\n;See also\\n\\n* [[oeis:A058220|OEIS:A058220 - Ultra-useful primes: smallest k such that 2^(2^n) - k is prime]]\\n \\n\\n\",\n \"language\": \"00-TASK\"\n },\n {\n \"code\": \"BEGIN # find members of the sequence a(n) = smallest k such that 2^(2^n) - k is prime #\\n PR precision 650 PR # set number of digits for LONG LOMG INT #\\n # 2^(2^10) has 308 digits but we need more for #\\n # Miller Rabin primality testing #\\n PR read \\\"primes.incl.a68\\\" PR # include the prime related utilities #\\n FOR n TO 10 DO\\n LONG LONG INT two up 2 up n = LONG LONG INT( 2 ) ^ ( 2 ^ n );\\n FOR i BY 2\\n WHILE IF is probably prime( two up 2 up n - i ) THEN\\n # found a sequence member #\\n print( ( \\\" \\\", whole( i, 0 ) ) );\\n FALSE # stop looking #\\n ELSE\\n TRUE # haven't found a sequence member yet #\\n FI\\n DO SKIP OD\\n OD\\nEND\\n\",\n \"language\": \"ALGOL-68\"\n },\n {\n \"code\": \"ultraUseful: function [n][\\n k: 1\\n p: (2^2^n) - k\\n while ø [\\n if prime? p -> return k\\n p: p-2\\n k: k+2\\n ]\\n]\\n\\nprint [pad \\\"n\\\" 3 \\\"|\\\" pad.right \\\"k\\\" 4]\\nprint repeat \\\"-\\\" 10\\nloop 1..10 'x ->\\n print [(pad to :string x 3) \\\"|\\\" (pad.right to :string ultraUseful x 4)]\\n\",\n \"language\": \"Arturo\"\n },\n {\n \"code\": \"#include <stdio.h>\\n#include <gmp.h>\\n\\nint a(unsigned int n) {\\n int k;\\n mpz_t p;\\n mpz_init_set_ui(p, 1);\\n mpz_mul_2exp(p, p, 1 << n);\\n mpz_sub_ui(p, p, 1);\\n for (k = 1; ; k += 2) {\\n if (mpz_probab_prime_p(p, 15) > 0) return k;\\n mpz_sub_ui(p, p, 2);\\n }\\n}\\n\\nint main() {\\n unsigned int n;\\n printf(\\\" n k\\\\n\\\");\\n printf(\\\"----------\\\\n\\\");\\n for (n = 1; n < 15; ++n) printf(\\\"%2d %d\\\\n\\\", n, a(n));\\n return 0;\\n}\\n\",\n \"language\": \"C\"\n },\n {\n \"code\": \"for n = 1 to 10\\n\\n\\tlet k = -1\\n\\n\\tdo\\n\\n\\t\\tlet k = k + 2\\n\\t\\twait\\n\\n\\tloop prime(2 ^ (2 ^ n) - k) = 0\\n\\n\\tprint \\\"n = \\\", n, \\\" k = \\\", k\\n\\nnext n\\n\",\n \"language\": \"Craft-Basic\"\n },\n {\n \"code\": \"USING: io kernel lists lists.lazy math math.primes prettyprint ;\\n\\n: useful ( -- list )\\n 1 lfrom\\n [ 2^ 2^ 1 lfrom [ - prime? ] with lfilter car ] lmap-lazy ;\\n\\n10 useful ltake [ pprint bl ] leach nl\\n\",\n \"language\": \"Factor\"\n },\n {\n \"code\": \"#include \\\"isprime.bas\\\"\\n\\nDim As Longint n, k, limit = 10\\nDim As ulongint num\\nFor n = 1 To limit\\n k = -1\\n Do\\n k += 2\\n num = (2 ^ (2 ^ n)) - k\\n If isPrime(num) Then\\n Print \\\"n = \\\"; n; \\\" k = \\\"; k\\n Exit Do\\n End If\\n Loop\\nNext\\n\\nSleep\\n\",\n \"language\": \"FreeBASIC\"\n },\n {\n \"code\": \"package main\\n\\nimport (\\n \\\"fmt\\\"\\n big \\\"github.com/ncw/gmp\\\"\\n)\\n\\nvar two = big.NewInt(2)\\n\\nfunc a(n uint) int {\\n one := big.NewInt(1)\\n p := new(big.Int).Lsh(one, 1 << n)\\n p.Sub(p, one)\\n for k := 1; ; k += 2 {\\n if p.ProbablyPrime(15) {\\n return k\\n }\\n p.Sub(p, two)\\n }\\n}\\n\\nfunc main() {\\n fmt.Println(\\\" n k\\\")\\n fmt.Println(\\\"----------\\\")\\n for n := uint(1); n < 14; n++ {\\n fmt.Printf(\\\"%2d %d\\\\n\\\", n, a(n))\\n }\\n}\\n\",\n \"language\": \"Go\"\n },\n {\n \"code\": \"uup=: {{\\n ref=. 2^2x^y+1\\n k=. 1\\n while. -. 1 p: ref-k do. k=. k+2 end.\\n}}\\\"0\\n\",\n \"language\": \"J\"\n },\n {\n \"code\": \" uup i.10\\n1 3 5 15 5 59 159 189 569 105\\n\",\n \"language\": \"J\"\n },\n {\n \"code\": \"import java.math.BigInteger;\\n\\npublic final class UltraUsefulPrimes {\\n\\n\\tpublic static void main(String[] args) {\\n\\t\\tfor ( int n = 1; n <= 10; n++ ) {\\n\\t\\t\\tshowUltraUsefulPrime(n);\\n\\t\\t}\\t\\t\\n\\t}\\n\\t\\n\\tprivate static void showUltraUsefulPrime(int n) {\\n\\t\\tBigInteger prime = BigInteger.ONE.shiftLeft(1 << n);\\n\\t\\tBigInteger k = BigInteger.ONE;\\n\\t\\twhile ( ! prime.subtract(k).isProbablePrime(20) ) {\\n\\t\\t\\tk = k.add(BigInteger.TWO);\\n\\t\\t}\\n\\t\\t\\n\\t\\tSystem.out.print(k + \\\" \\\");\\t\\t\\n\\t}\\n\\n}\\n\",\n \"language\": \"Java\"\n },\n {\n \"code\": \"using Primes\\n\\nnearpow2pow2prime(n) = findfirst(k -> isprime(2^(big\\\"2\\\"^n) - k), 1:10000)\\n\\n@time println([nearpow2pow2prime(n) for n in 1:12])\\n\",\n \"language\": \"Julia\"\n },\n {\n \"code\": \"ClearAll[FindUltraUsefulPrimeK]\\nFindUltraUsefulPrimeK[n_] := Module[{num, tmp},\\n num = 2^(2^n);\\n Do[\\n If[PrimeQ[num - k],\\n tmp = k;\\n Break[];\\n ]\\n ,\\n {k, 1, \\\\[Infinity], 2}\\n ];\\n tmp\\n ]\\nres = FindUltraUsefulPrimeK /@ Range[13];\\nTableForm[res, TableHeadings -> Automatic]\\n\",\n \"language\": \"Mathematica\"\n },\n {\n \"code\": \"import std/strformat\\nimport integers\\n\\nlet One = newInteger(1)\\n\\necho \\\" n k\\\"\\nvar count = 1\\nvar n = 1\\nwhile count <= 13:\\n var k = 1\\n var p = One shl (1 shl n) - k\\n while not p.isPrime:\\n p -= 2\\n k += 2\\n echo &\\\"{n:2} {k}\\\"\\n inc n\\n inc count\\n\",\n \"language\": \"Nim\"\n },\n {\n \"code\": \"use strict;\\nuse warnings;\\nuse feature 'say';\\nuse bigint;\\nuse ntheory 'is_prime';\\n\\nsub useful {\\n my @n = @_;\\n my @u;\\n for my $n (@n) {\\n my $p = 2**(2**$n);\\n LOOP: for (my $k = 1; $k < $p; $k += 2) {\\n is_prime($p-$k) and push @u, $k and last LOOP;\\n }\\n }\\n @u\\n}\\n\\nsay join ' ', useful 1..13;\\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;\\\">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: #008080;\\\">include</span> <span style=\\\"color: #004080;\\\">mpfr</span><span style=\\\"color: #0000FF;\\\">.</span><span style=\\\"color: #000000;\\\">e</span>\\n <span style=\\\"color: #004080;\\\">mpz</span> <span style=\\\"color: #000000;\\\">p</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">mpz_init</span><span style=\\\"color: #0000FF;\\\">()</span>\\n\\n <span style=\\\"color: #008080;\\\">function</span> <span style=\\\"color: #000000;\\\">a</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: #7060A8;\\\">mpz_ui_pow_ui</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">p</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">2</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #7060A8;\\\">power</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">2</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">n</span><span style=\\\"color: #0000FF;\\\">))</span>\\n <span style=\\\"color: #7060A8;\\\">mpz_sub_si</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">p</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">p</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;\\\">k</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">1</span>\\n <span style=\\\"color: #008080;\\\">while</span> <span style=\\\"color: #008080;\\\">not</span> <span style=\\\"color: #7060A8;\\\">mpz_prime</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">p</span><span style=\\\"color: #0000FF;\\\">)</span> <span style=\\\"color: #008080;\\\">do</span>\\n <span style=\\\"color: #000000;\\\">k</span> <span style=\\\"color: #0000FF;\\\">+=</span> <span style=\\\"color: #000000;\\\">2</span>\\n <span style=\\\"color: #7060A8;\\\">mpz_sub_si</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">p</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">p</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;\\\">while</span>\\n <span style=\\\"color: #008080;\\\">return</span> <span style=\\\"color: #000000;\\\">k</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;\\\">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;\\\">\\\"%d \\\"</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">a</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: #008080;\\\">if</span> <span style=\\\"color: #7060A8;\\\">machine_bits</span><span style=\\\"color: #0000FF;\\\">()=</span><span style=\\\"color: #000000;\\\">64</span> <span style=\\\"color: #008080;\\\">then</span>\\n <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: #008080;\\\">for</span> <span style=\\\"color: #000000;\\\">i</span><span style=\\\"color: #0000FF;\\\">=</span><span style=\\\"color: #000000;\\\">11</span> <span style=\\\"color: #008080;\\\">to</span> <span style=\\\"color: #000000;\\\">13</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 \\\"</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">a</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: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">if</span>\\n <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<!--\\n\",\n \"language\": \"Phix\"\n },\n {\n \"code\": \"# useful.py by xing216\\nfrom gmpy2 import is_prime\\ndef useful(n):\\n k = 1\\n is_useful = False\\n while is_useful == False:\\n if is_prime(2**(2**n) - k):\\n is_useful = True\\n break\\n k += 2\\n return k\\nif __name__ == \\\"__main__\\\":\\n print(\\\"n | k\\\")\\n for i in range(1,14):\\n print(f\\\"{i:<4}{useful(i)}\\\")\\n\",\n \"language\": \"Python\"\n },\n {\n \"code\": \"sub useful ($n) {\\n (|$n).map: {\\n my $p = 1 +< ( 1 +< $_ );\\n ^$p .first: ($p - *).is-prime\\n }\\n}\\n\\nput useful 1..10;\\n\\nput useful 11..13;\\n\",\n \"language\": \"Raku\"\n },\n {\n \"code\": \"see \\\"works...\\\" + nl\\nlimit = 10\\n\\nfor n = 1 to limit\\n k = -1\\n while true\\n k = k + 2\\n num = pow(2,pow(2,n)) - k\\n if isPrime(num)\\n ? \\\"n = \\\" + n + \\\" k = \\\" + k\\n exit\\n ok\\n end\\nnext\\nsee \\\"done..\\\" + nl\\n\\nfunc isPrime num\\n if (num <= 1) return 0 ok\\n if (num % 2 = 0 and num != 2) return 0 ok\\n for i = 3 to floor(num / 2) -1 step 2\\n if (num % i = 0) return 0 ok\\n next\\n return 1\\n\",\n \"language\": \"Ring\"\n },\n {\n \"code\": \"require 'openssl'\\n\\n(1..10).each do |n|\\n pow = 2 ** (2 ** n)\\n print \\\"#{n}:\\\\t\\\"\\n puts (1..).step(2).detect{|k| OpenSSL::BN.new(pow-k).prime?}\\nend\\n\",\n \"language\": \"Ruby\"\n },\n {\n \"code\": \"say(\\\" n k\\\")\\nsay(\\\"----------\\\")\\n\\nfor n in (1..13) {\\n var t = 2**(2**n)\\n printf(\\\"%2d %d\\\\n\\\", n, {|k| t - k -> is_prob_prime }.first)\\n}\\n\",\n \"language\": \"Sidef\"\n },\n {\n \"code\": \"import math\\n\\nfn main() {\\n\\tlimit := 10 // depending on computer, higher numbers = longer times\\n\\tmut num, mut k := i64(0), i64(0)\\n\\tprintln(\\\"n k\\\\n-------\\\")\\n\\tfor n in 1..limit {\\n\\t\\tk = -1\\n\\t\\tfor n < limit {\\n\\t\\t\\t k = k + 2\\n\\t\\t\\t num = math.powi(2, math.powi(2 , n)) - k\\n\\t\\t\\t if is_prime(num) == true {\\n\\t\\t\\t\\t println(\\\"${n} ${k}\\\")\\n\\t\\t\\t\\t break\\n\\t\\t\\t }\\n\\t\\t}\\n\\t}\\n}\\n\\nfn is_prime(num i64) bool {\\n if num <= 1 {return false}\\n if num % 2 == 0 && num != 2 {return false}\\n\\t for idx := 3; idx <= math.floor(num / 2) - 1; idx += 2 {\\n if num % idx == 0 {return false}\\n }\\n return true\\n}\\n\",\n \"language\": \"V-(Vlang)\"\n },\n {\n \"code\": \"import \\\"./big\\\" for BigInt\\nimport \\\"./fmt\\\" for Fmt\\n\\nvar one = BigInt.one\\nvar two = BigInt.two\\n\\nvar a = Fn.new { |n|\\n var p = (BigInt.one << (1 << n)) - one\\n var k = 1\\n while (true) {\\n if (p.isProbablePrime(5)) return k\\n p = p - two\\n k = k + 2\\n }\\n}\\n\\nSystem.print(\\\" n k\\\")\\nSystem.print(\\\"----------\\\")\\nfor (n in 1..10) Fmt.print(\\\"$2d $d\\\", n, a.call(n))\\n\",\n \"language\": \"Wren\"\n },\n {\n \"code\": \"import \\\"./gmp\\\" for Mpz\\nimport \\\"./fmt\\\" for Fmt\\n\\nvar one = Mpz.one\\nvar two = Mpz.two\\n\\nvar a = Fn.new { |n|\\n var p = Mpz.one.lsh(1 << n).sub(one)\\n var k = 1\\n while (true) {\\n if (p.probPrime(15) > 0) return k\\n p.sub(two)\\n k = k + 2\\n }\\n}\\n\\nSystem.print(\\\" n k\\\")\\nSystem.print(\\\"----------\\\")\\nfor (n in 1..14) Fmt.print(\\\"$2d $d\\\", n, a.call(n))\\n\",\n \"language\": \"Wren\"\n }\n]","isConversational":false},"task_name":{"kind":"string","value":"Ultra-useful-primes"}}},{"rowIdx":1781,"cells":{"solutions":{"kind":"list like","value":[{"code":"---\nfrom: http://rosettacode.org/wiki/Undefined_values\nnote: Programming language concepts\n","language":"00-META"},{"code":"For languages which have an explicit notion of an undefined value, identify and exercise those language's mechanisms for identifying and manipulating a variable's value's status as being undefined.\n<br/><br/>\n","language":"00-TASK"},{"code":"var foo; // untyped\nvar bar:*; // explicitly untyped\n\ntrace(foo + \", \" + bar); // outputs \"undefined, undefined\"\n\nif (foo == undefined)\n trace(\"foo is undefined\"); // outputs \"foo is undefined\"\n","language":"ActionScript"},{"code":"pragma Initialize_Scalars;\nwith Ada.Text_IO; use Ada.Text_IO;\n\nprocedure Invalid_Value is\n type Color is (Red, Green, Blue);\n X : Float;\n Y : Color;\nbegin\n if not X'Valid then\n Put_Line (\"X is not valid\");\n end if;\n X := 1.0;\n if X'Valid then\n Put_Line (\"X is\" & Float'Image (X));\n end if;\n if not Y'Valid then\n Put_Line (\"Y is not valid\");\n end if;\n Y := Green;\n if Y'Valid then\n Put_Line (\"Y is \" & Color'Image (Y));\n end if;\nend Invalid_Value;\n","language":"Ada"},{"code":"MODE R = REF BOOL;\nR r := NIL;\n\nMODE U = UNION(BOOL, VOID);\nU u := EMPTY;\n\nIF r IS R(NIL) THEN\n print((\"r IS NIL\", new line))\nELSE\n print((\"r ISNT NIL\", new line))\nFI;\n\nCASE u IN\n (VOID):print((\"u is EMPTY\", new line))\n OUT print((\"u isnt EMPTY\", new line))\nESAC\n","language":"ALGOL-68"},{"code":"undef: null\n\nprint undef\n","language":"Arturo"},{"code":" ok% = TRUE\n ON ERROR LOCAL IF ERR<>26 REPORT : END ELSE ok% = FALSE\n IF ok% THEN\n PRINT variable$\n ELSE\n PRINT \"Not defined\"\n ENDIF\n RESTORE ERROR\n","language":"BBC-BASIC"},{"code":" PROCtest\n END\n\n DEF PROCtest\n LOCAL array()\n IF !^array() < 2 PRINT \"Array is undefined\"\n DIM array(1,2)\n IF !^array() > 1 PRINT \"Array is defined\"\n\n !^array() = 0 : REM Set array to undefined state\n ENDPROC\n","language":"BBC-BASIC"},{"code":"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n int junk, *junkp;\n\n /* Print an unitialized variable! */\n printf(\"junk: %d\\n\", junk);\n\n /* Follow a pointer to unitialized memory! */\n junkp = malloc(sizeof *junkp);\n if (junkp)\n printf(\"*junkp: %d\\n\", *junkp);\n return 0;\n}\n","language":"C"},{"code":"#include <iostream>\n\nint main()\n{\n int undefined;\n if (undefined == 42)\n {\n std::cout << \"42\";\n }\n\n if (undefined != 42)\n {\n std::cout << \"not 42\";\n }\n}\n","language":"C++"},{"code":"string foo = null;\n","language":"C-sharp"},{"code":"int i = null;\n","language":"C-sharp"},{"code":"int? answer = null;\nif (answer == null) {\n answer = 42;\n}\n","language":"C-sharp"},{"code":"Nullable<int> answer = new Nullable<int>();\nif (!answer.HasValue) {\n answer = new Nullable<int>(42);\n}\n","language":"C-sharp"},{"code":" ;; assumption: none of these variables initially exist\n\n (defvar *x*) ;; variable exists now, but has no value\n (defvar *y* 42) ;; variable exists now, and has a value\n\n (special-variable-p '*x*) -> T ;; Symbol *x* names a special variable\n (boundp '*x*) -> NIL ;; *x* has no binding\n (boundp '*y*) -> T\n\n (special-variable-p '*z*) -> NIL ;; *z* does not name a special variable\n","language":"Common-Lisp"},{"code":" (makunbound '*y*) ;; *y* no longer has a value; it is erroneous to evaluate *y*\n\n (setf *y* 43) ;; *y* is bound again.\n","language":"Common-Lisp"},{"code":" (defvar *dyn*) ;; special, no binding\n\n (let (*dyn* ;; locally scoped override, value is nil\n lex) ;; lexical, value is nil\n (list (boundp '*dyn*) *dyn* (boundp 'lex) lex)) -> (T NIL NIL NIL)\n\n (boundp '*global*) -> NIL\n","language":"Common-Lisp"},{"code":"void main() {\n // Initialized:\n int a = 5;\n double b = 5.0;\n char c = 'f';\n int[] d = [1, 2, 3];\n\n // Default initialized:\n int aa; // set to 0\n double bb; // set to double.init, that is a NaN\n char cc; // set to 0xFF\n int[] dd; // set to null\n int[3] ee; // set to [0, 0, 0]\n\n // Undefined (contain garbage):\n int aaa = void;\n double[] bbb = void;\n int[3] eee = void;\n}\n","language":"D"},{"code":"var\n P: PInteger;\nbegin\n New(P); //Allocate some memory\n try\n If Assigned(P) Then //...\n begin\n P^ := 42;\n end;\n finally\n Dispose(P); //Release memory allocated by New\n end;\nend;\n","language":"Delphi"},{"code":"if (foo == bar || (def baz := lookup(foo)) != null) {\n ...\n}\n","language":"E"},{"code":"-module( undefined_values ).\n\n-export( [task/0] ).\n\n-record( a_record, {member_1, member_2} ).\n\ntask() ->\n Record = #a_record{member_1=a_value},\n io:fwrite( \"Record member_1 ~p, member_2 ~p~n\", [Record#a_record.member_1, Record#a_record.member_2] ),\n io:fwrite( \"Member_2 is undefined ~p~n\", [Record#a_record.member_2 =:= undefined] ).\n","language":"Erlang"},{"code":"42 . ! 42\n","language":"Factor"},{"code":"TUPLE: foo bar ;\nfoo new bar>> . ! f\n\nTUPLE: my-tuple { n integer } ;\nmy-tuple new n>> . ! 0\n","language":"Factor"},{"code":"SYMBOL: n\nn get . ! f\n\n\\ + get . ! f\n","language":"Factor"},{"code":"[let\n 2 :> n ! There is no other way!\n 0 1 :> ( a b )\n]\n","language":"Factor"},{"code":"[undefined] var [if] .( var is undefined at first check) cr [then]\n\nmarker forget-var\n\nvariable var\n\n[defined] var [if] .( var is defined at second check) cr [then]\n\nforget-var\n\n[undefined] var [if] .( var is undefined at third check) cr [then]\n","language":"Forth"},{"code":"IsNaN(x)\n","language":"Fortran"},{"code":"' FB 1.05.0 Win64\n\nDim i As Integer '' initialized to 0 by default\nDim j As Integer = 3 '' initialized to 3\nDim k As Integer = Any '' left uninitialized (compiler warning but can be ignored)\n\nPrint i, j, k\nSleep\n","language":"FreeBASIC"},{"code":"IsBound(a);\n# true\n\nUnbind(a);\n\nIsBound(a);\n# false\n","language":"GAP"},{"code":"package main\n\nimport \"fmt\"\n\nvar (\n s []int\n p *int\n f func()\n i interface{}\n m map[int]int\n c chan int\n)\n\nfunc main() {\n fmt.Println(\"Exercise nil objects:\")\n status()\n\n // initialize objects\n s = make([]int, 1)\n p = &s[0] // yes, reference element of slice just created\n f = func() { fmt.Println(\"function call\") }\n i = user(0) // see user defined type just below\n m = make(map[int]int)\n c = make(chan int, 1)\n\n fmt.Println(\"\\nExercise objects after initialization:\")\n status()\n}\n\ntype user int\n\nfunc (user) m() {\n fmt.Println(\"method call\")\n}\n\nfunc status() {\n trySlice()\n tryPointer()\n tryFunction()\n tryInterface()\n tryMap()\n tryChannel()\n}\n\nfunc reportPanic() {\n if x := recover(); x != nil {\n fmt.Println(\"panic:\", x)\n }\n}\n\nfunc trySlice() {\n defer reportPanic()\n fmt.Println(\"s[0] =\", s[0])\n}\n\nfunc tryPointer() {\n defer reportPanic()\n fmt.Println(\"*p =\", *p)\n}\n\nfunc tryFunction() {\n defer reportPanic()\n f()\n}\n\nfunc tryInterface() {\n defer reportPanic()\n\n // normally the nil identifier accesses a nil value for one of\n // six predefined types. In a type switch however, nil can be used\n // as a type. In this case, it matches the nil interface.\n switch i.(type) {\n case nil:\n fmt.Println(\"i is nil interface\")\n case interface {\n m()\n }:\n fmt.Println(\"i has method m\")\n }\n\n // assert type with method and then call method\n i.(interface {\n m()\n }).m()\n}\n\nfunc tryMap() {\n defer reportPanic()\n m[0] = 0\n fmt.Println(\"m[0] =\", m[0])\n}\n\nfunc tryChannel() {\n defer reportPanic()\n close(c)\n fmt.Println(\"channel closed\")\n}\n","language":"Go"},{"code":"main = print $ \"Incoming error--\" ++ undefined\n-- When run in GHC:\n-- \"Incoming error--*** Exception: Prelude.undefined\n","language":"Haskell"},{"code":"main = print $ length [undefined, undefined, 1 `div` 0]\n","language":"Haskell"},{"code":"resurrect 0 = error \"I'm out of orange smoke!\"\n","language":"Haskell"},{"code":"undefined :: a\nundefined = error \"Prelude.undefined\"\n","language":"Haskell"},{"code":"import Control.Exception (catch, evaluate, ErrorCall)\nimport System.IO.Unsafe (unsafePerformIO)\nimport Prelude hiding (catch)\nimport Control.DeepSeq (NFData, deepseq)\n\nscoopError :: (NFData a) => a -> Either String a\nscoopError x = unsafePerformIO $ catch right left\n where right = deepseq x $ return $ Right x\n left e = return $ Left $ show (e :: ErrorCall)\n\nsafeHead :: (NFData a) => [a] -> Either String a\nsafeHead = scoopError . head\n\nmain = do\n print $ safeHead ([] :: String)\n print $ safeHead [\"str\"]\n","language":"Haskell"},{"code":" foo=: 3\n nc;:'foo bar'\n0 _1\n","language":"J"},{"code":" erase;:'foo bar'\n1 1\n nc;:'foo bar'\n_1 _1\n bar=:99\n nc;:'foo bar'\n_1 0\n","language":"J"},{"code":"String string = null; // the variable string is undefined\nSystem.out.println(string); //prints \"null\" to std out\nSystem.out.println(string.length()); // dereferencing null throws java.lang.NullPointerException\n","language":"Java"},{"code":"int i = null; // compilation error: incompatible types, required: int, found: <nulltype>\nif (i == null) { // compilation error: incomparable types: int and <nulltype>\n i = 1;\n}\n","language":"Java"},{"code":"Integer i = null; // variable i is undefined\nif (i == null) {\n i = 1;\n}\n","language":"Java"},{"code":"var a;\n\ntypeof(a) === \"undefined\";\ntypeof(b) === \"undefined\";\n\nvar obj = {}; // Empty object.\ntypeof(obj.c) === \"undefined\";\n\nobj.c = 42;\n\nobj.c === 42;\ndelete obj.c;\ntypeof(obj.c) === \"undefined\";\n","language":"JavaScript"},{"code":"var a;\na === void 0; // true\nb === void 0; // throws a ReferenceError\n","language":"JavaScript"},{"code":"{}[\"key\"] #=> null\n","language":"Jq"},{"code":"1/0 == null #=>false\n","language":"Jq"},{"code":"def sum: reduce .[] as $x (null; . + $x);\n","language":"Jq"},{"code":"julia> arr = [1, 2, nothing, 3]\n4-element Array{Union{Nothing, Int64},1}:\n 1\n 2\n nothing\n 3\n\njulia> x = arr .+ 5\nERROR: MethodError: no method matching +(::Nothing, ::Int64)\nClosest candidates are:\n +(::Any, ::Any, ::Any, ::Any...) at operators.jl:502\n +(::Complex{Bool}, ::Real) at complex.jl:292\n +(::Missing, ::Number) at missing.jl:93\n ...\n\njulia> arr = [1, 2, missing, 3]\n4-element Array{Union{Missing, Int64},1}:\n 1\n 2\n missing\n 3\n\njulia> x = arr .+ 5\n4-element Array{Union{Missing, Int64},1}:\n 6\n 7\n missing\n 8\n","language":"Julia"},{"code":"// version 1.1.2\n\nclass SomeClass\n\nclass SomeOtherClass {\n lateinit var sc: SomeClass\n\n fun initialize() {\n sc = SomeClass() // not initialized in place or in constructor\n }\n\n fun printSomething() {\n println(sc) // 'sc' may not have been initialized at this point\n }\n\n fun someFunc(): String {\n // for now calls a library function which throws an error and returns Nothing\n TODO(\"someFunc not yet implemented\")\n }\n}\n\nfun main(args: Array<String>) {\n val soc = SomeOtherClass()\n\n try {\n soc.printSomething()\n }\n catch (ex: Exception) {\n println(ex)\n }\n\n try {\n soc.someFunc()\n }\n catch (e: Error) {\n println(e)\n }\n}\n","language":"Kotlin"},{"code":"put var\n-- <Void>\nput var=VOID\n-- 1\nput voidP(var)\n-- 1\nvar = 23\nput voidP(var)\n-- 0\n","language":"Lingo"},{"code":"; procedures\nto square :x\n output :x * :x\nend\n\nshow defined? \"x ; true\nshow procedure? \"x ; true (also works for built-in primitives)\nerase \"x\nshow defined? \"x ; false\nshow square 3 ; I don't know how to square\n\n; names\n\nmake \"n 23\n\nshow name? \"n ; true\nern \"n\nshow name? \"n ; false\nshow :n ; n has no value\n","language":"Logo"},{"code":"HAI 1.3\n\nI HAS A foo BTW, INISHULIZD TO NOOB\nDIFFRINT foo AN FAIL, O RLY?\n YA RLY, VISIBLE \"FAIL != NOOB\"\nOIC\n\nI HAS A bar ITZ 42\nbar, O RLY?\n YA RLY, VISIBLE \"bar IZ DEFIND\"\nOIC\n\nbar R NOOB BTW, UNDEF bar\nbar, O RLY?\n YA RLY, VISIBLE \"SHUD NEVAR C DIS\"\nOIC\n\nKTHXBYE\n","language":"LOLCODE"},{"code":"print( a )\n\nlocal b\nprint( b )\n\nif b == nil then\n b = 5\nend\nprint( b )\n","language":"Lua"},{"code":"a\n-> a\na + a\n-> 2 a\nValueQ[a]\n-> False\na = 5\n-> 5\nValueQ[a]\n-> True\n","language":"Mathematica"},{"code":"ConditionalExpression[a, False]\n->Undefined\n","language":"Mathematica"},{"code":"Sin[Undefined]\n-> Undefined\n","language":"Mathematica"},{"code":"a = Undefined\n-> Undefined\na\n-> Undefined\nValueQ[a]\n-> True\n","language":"Mathematica"},{"code":" global var;\n","language":"MATLAB"},{"code":" isempty(var)\n","language":"MATLAB"},{"code":" var = [1, 2, NaN, 0/0, inf-inf, 5]\n","language":"MATLAB"},{"code":" isnan(var)\n","language":"MATLAB"},{"code":" IF $DATA(SOMEVAR)=0 DO UNDEF ; A result of 0 means the value is undefined\n SET LOCAL=$GET(^PATIENT(RECORDNUM,0)) ;If there isn't a defined item at that location, a null string is returned\n","language":"MUMPS"},{"code":"var a {.noInit.}: array[1_000_000, int]\n\n# For a proc, {.noInit.} means that the result is not initialized.\nproc p(): array[1000, int] {.noInit.} =\n for i in 0..999: result[i] = i\n","language":"Nim"},{"code":"(* There is no undefined value in OCaml,\n but if you really need this you can use the built-in \"option\" type.\n It is defined like this: type 'a option = None | Some of 'a *)\n\nlet inc = function\n Some n -> Some (n+1)\n| None -> failwith \"Undefined argument\";;\n\ninc (Some 0);;\n(* - : value = Some 1 *)\n\ninc None;;\n(* Exception: Failure \"Undefined argument\". *)\n","language":"OCaml"},{"code":"declare X in\n\nthread\n if {IsFree X} then {System.showInfo \"X is unbound.\"} end\n {Wait X}\n {System.showInfo \"Now X is determined.\"}\nend\n\n{System.showInfo \"Sleeping...\"}\n{Delay 1000}\n{System.showInfo \"Setting X.\"}\nX = 42\n","language":"Oz"},{"code":"v == 'v\n","language":"PARI-GP"},{"code":"is_entry(\"v\") == NULL;\n","language":"PARI-GP"},{"code":"#!/usr/bin/perl -w\nuse strict;\n\n# Declare the variable. It is initialized to the value \"undef\"\nour $var;\n\n# Check to see whether it is defined\nprint \"var contains an undefined value at first check\\n\" unless defined $var;\n\n# Give it a value\n$var = \"Chocolate\";\n\n# Check to see whether it is defined after we gave it the\n# value \"Chocolate\"\nprint \"var contains an undefined value at second check\\n\" unless defined $var;\n\n# Give the variable the value \"undef\".\n$var = undef;\n# or, equivalently:\nundef($var);\n\n# Check to see whether it is defined after we've explicitly\n# given it an undefined value.\nprint \"var contains an undefined value at third check\\n\" unless defined $var;\n\n# Give the variable a value of 42\n$var = 42;\n\n# Check to see whether the it is defined after we've given it\n# the value 42.\nprint \"var contains an undefined value at fourth check\\n\" unless defined $var;\n\n# Because most of the output is conditional, this serves as\n# a clear indicator that the program has run to completion.\nprint \"Done\\n\";\n","language":"Perl"},{"code":"-->\n <span style=\"color: #004080;\">object</span> <span style=\"color: #000000;\">x</span>\n\n <span style=\"color: #008080;\">procedure</span> <span style=\"color: #000000;\">test</span><span style=\"color: #0000FF;\">()</span>\n <span style=\"color: #008080;\">if</span> <span style=\"color: #004080;\">object</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">x</span><span style=\"color: #0000FF;\">)</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;\">\"x is an object\\n\"</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #008080;\">else</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;\">\"x is unassigned\\n\"</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;\">procedure</span>\n\n <span style=\"color: #000000;\">test</span><span style=\"color: #0000FF;\">()</span>\n <span style=\"color: #000000;\">x</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">1</span>\n <span style=\"color: #000000;\">test</span><span style=\"color: #0000FF;\">()</span>\n<!--\n","language":"Phix"},{"code":"<?php\n// Check to see whether it is defined\nif (!isset($var))\n echo \"var is undefined at first check\\n\";\n\n// Give it a value\n$var = \"Chocolate\";\n\n// Check to see whether it is defined after we gave it the\n// value \"Chocolate\"\nif (!isset($var))\n echo \"var is undefined at second check\\n\";\n\n// Give the variable an undefined value.\nunset($var);\n\n// Check to see whether it is defined after we've explicitly\n// given it an undefined value.\nif (!isset($var))\n echo \"var is undefined at third check\\n\";\n\n// Give the variable a value of 42\n$var = 42;\n\n// Check to see whether the it is defined after we've given it\n// the value 42.\nif (!isset($var))\n echo \"var is undefined at fourth check\\n\";\n\n// Because most of the output is conditional, this serves as\n// a clear indicator that the program has run to completion.\necho \"Done\\n\";\n?>\n","language":"PHP"},{"code":": (myfoo 3 4)\n!? (myfoo 3 4)\nmyfoo -- Undefined\n?\n","language":"PicoLisp"},{"code":": MyVar\n-> NIL\n\n: (default MyVar 7)\n-> 7\n\n: MyVar\n-> 7\n\n: (default MyVar 8)\n-> 7\n\n: MyVar\n-> 7\n","language":"PicoLisp"},{"code":"> zero_type(UNDEFINED);\nResult: 1\n> mapping bar = ([ \"foo\":\"hello\" ]);\n> zero_type(bar->foo);\nResult: 0\n> zero_type(bar->baz);\nResult: 1\n> bar->baz=UNDEFINED;\nResult: 0\n> zero_type(bar->baz);\nResult: 0\n","language":"Pike"},{"code":"if (Get-Variable -Name noSuchVariable -ErrorAction SilentlyContinue)\n{\n $true\n}\nelse\n{\n $false\n}\n","language":"PowerShell"},{"code":"Get-PSProvider\n","language":"PowerShell"},{"code":"Test-Path Variable:\\noSuchVariable\n","language":"PowerShell"},{"code":"$noSuchVariable -eq $null\n","language":"PowerShell"},{"code":"If OpenConsole()\n\n CompilerIf Defined(var, #PB_Variable)\n PrintN(\"var is defined at first check\")\n CompilerElse\n PrintN(\"var is undefined at first check\")\n Define var\n CompilerEndIf\n\n CompilerIf Defined(var, #PB_Variable)\n PrintN(\"var is defined at second check\")\n CompilerElse\n PrintN(\"var is undefined at second check\")\n Define var\n CompilerEndIf\n\n Print(#CRLF$ + #CRLF$ + \"Press ENTER to exit\")\n Input()\n CloseConsole()\n\nEndIf\n","language":"PureBasic"},{"code":"# Check to see whether a name is defined\ntry: name\nexcept NameError: print \"name is undefined at first check\"\n\n# Create a name, giving it a string value\nname = \"Chocolate\"\n\n# Check to see whether the name is defined now.\ntry: name\nexcept NameError: print \"name is undefined at second check\"\n\n# Remove the definition of the name.\ndel name\n\n# Check to see whether it is defined after the explicit removal.\ntry: name\nexcept NameError: print \"name is undefined at third check\"\n\n# Recreate the name, giving it a value of 42\nname = 42\n\n# Check to see whether the name is defined now.\ntry: name\nexcept NameError: print \"name is undefined at fourth check\"\n\n# Because most of the output is conditional, this serves as\n# a clear indicator that the program has run to completion.\nprint \"Done\"\n","language":"Python"},{"code":"exists(\"x\")\n","language":"R"},{"code":"x <- NULL\n","language":"R"},{"code":"y <- c(1, 4, 9, NA, 25)\nz <- c(\"foo\", NA, \"baz\")\n","language":"R"},{"code":"print_is_missing <- function(x)\n{\n print(missing(x))\n}\n\nprint_is_missing() # TRUE\nprint_is_missing(123) # FALSE\n","language":"R"},{"code":"-> (letrec ([x x]) x)\n#<undefined>\n","language":"Racket"},{"code":"my $x; $x = 42; $x = Nil; say $x.WHAT; # prints Any()\n","language":"Raku"},{"code":"say Method ~~ Routine; # Bool::True\n","language":"Raku"},{"code":"my $x; say $x.WHAT; # Any()\nmy Int $y; say $y.WHAT; # Int()\nmy Str $z; say $z.WHAT; # Str()\n","language":"Raku"},{"code":"my Int:D $i = 1; # if $i has to be defined you must provide a default value\nmulti sub foo(Int:D $i where * != 0){ (0..100).roll / $i } # we will never divide by 0\nmulti sub foo(Int:U $i){ die 'WELP! $i is undefined' } # because undefinedness is deadly\n\nwith $i { say 'defined' } # as \"if\" is looking for Bool::True, \"with\" is looking for *.defined\nwith 0 { say '0 may not divide but it is defined' }\n","language":"Raku"},{"code":"my $is-defined = 1;\nmy $ain't-defined = Any;\nmy $doesn't-matter;\nmy Any:D $will-be-defined = $ain't-defined // $is-defined // $doesn't-matter;\n\nmy @a-mixed-list = Any, 1, Any, 'a';\n$will-be-defined = [//] @a-mixed-list; # [//] will return the first defined value\n\nmy @a = Any,Any,1,1;\nmy @b = 2,Any,Any,2;\nmy @may-contain-any = @a >>//<< @b; # contains: [2, Any, 1, 1]\n\nsub f1(){Failure.new('WELP!')};\nsub f2(){ $_ ~~ Failure }; # orelse will kindly set the topic for us\nmy $s = (f1() orelse f2()); # Please note the parentheses, which are needed because orelse is\n # much looser then infix:<=> .\ndd $s; # this be Bool::False\n","language":"Raku"},{"code":"/*REXX program test if a (REXX) variable is defined or not defined. */\ntlaloc = \"rain god of the Aztecs.\" /*assign a value to the Aztec rain god.*/\n /*check if the rain god is defined. */\ny= 'tlaloc'\nif symbol(y)==\"VAR\" then say y ' is defined.'\n else say y \"isn't defined.\"\n\n /*check if the fire god is defined. */\n\ny= 'xiuhtecuhtli' /*assign a value to the Aztec file god.*/\nif symbol(y)==\"VAR\" then say y ' is defined.'\n else say y \"isn't defined.\"\n\n\ndrop tlaloc /*un─define the TLALOC REXX variable.*/\n /*check if the rain god is defined. */\ny= 'tlaloc'\nif symbol(y)==\"VAR\" then say y ' is defined.'\n else say y \"isn't defined.\"\n /*stick a fork in it, we're all done. */\n","language":"REXX"},{"code":"# Project : Undefined values\n\ntest()\nfunc test\n x=10 y=20\n see islocal(\"x\") + nl +\n islocal(\"y\") + nl +\n islocal(\"z\") + nl\n","language":"Ring"},{"code":"# Check to see whether it is defined\nputs \"var is undefined at first check\" unless defined? var\n\n# Give it a value\nvar = \"Chocolate\"\n\n# Check to see whether it is defined after we gave it the\n# value \"Chocolate\"\nputs \"var is undefined at second check\" unless defined? var\n\n# I don't know any way of undefining a variable in Ruby\n\n# Because most of the output is conditional, this serves as\n# a clear indicator that the program has run to completion.\nputs \"Done\"\n","language":"Ruby"},{"code":"use std::ptr;\n\nlet p: *const i32 = ptr::null();\nassert!(p.is_null());\n","language":"Rust"},{"code":"var x; # declared, but not defined\nx == nil && say \"nil value\";\ndefined(x) || say \"undefined\";\n\n# Give \"x\" some value\nx = 42;\n\ndefined(x) && say \"defined\";\n\n# Change \"x\" back to `nil`\nx = nil;\n\ndefined(x) || say \"undefined\";\n","language":"Sidef"},{"code":"Smalltalk includesKey: #FooBar\nmyNamespace includesKey: #Baz\n","language":"Smalltalk"},{"code":"# Variables are undefined by default and do not need explicit declaration\n\n# Check to see whether it is defined\nif {![info exists var]} {puts \"var is undefind at first check\"}\n\n# Give it a value\nset var \"Screwy Squirrel\"\n\n# Check to see whether it is defined\nif {![info exists var]} {puts \"var is undefind at second check\"}\n\n# Remove its value\nunset var\n\n# Check to see whether it is defined\nif {![info exists var]} {puts \"var is undefind at third check\"}\n\n# Give it a value again\nset var 12345\n\n# Check to see whether it is defined\nif {![info exists var]} {puts \"var is undefind at fourth check\"}\n\nputs \"Done\"\n","language":"Tcl"},{"code":"global G1\n\nprocedure main(arglist)\nlocal ML1\nstatic MS1\nundeftest()\nend\n\nprocedure undeftest(P1)\nstatic S1\nlocal L1,L2\nevery #write all local, parameter, static, and global variable names\n write((localnames|paramnames|staticnames|globalnames)(¤t,0)) # ... visible in the current co-expression at this calling level (0)\nreturn\nend\n","language":"Unicon"},{"code":"VAR1=\"VAR1\"\necho ${VAR1:-\"Not set.\"}\necho ${VAR2:-\"Not set.\"}\n","language":"UNIX-Shell"},{"code":"var f = Fn.new {\n System.print(\"'f' called.\") // note no return value\n}\n\nvar res = f.call()\nSystem.print(\"The value returned by 'f' is %(res).\")\n\nvar m = {} // empty map\nSystem.print(\"m[1] is %(m[1]).\")\n\nvar u // declared but not assigned a value\nSystem.print(\"u is %(u).\")\n\nvar v = null // explicitly assigned null\nif (!v) System.print(\"v is %(v).\")\n","language":"Wren"},{"code":"println(Void);\n1+Void\nif(Void){} else { 23 }\n","language":"Zkl"}],"string":"[\n {\n \"code\": \"---\\nfrom: http://rosettacode.org/wiki/Undefined_values\\nnote: Programming language concepts\\n\",\n \"language\": \"00-META\"\n },\n {\n \"code\": \"For languages which have an explicit notion of an undefined value, identify and exercise those language's mechanisms for identifying and manipulating a variable's value's status as being undefined.\\n<br/><br/>\\n\",\n \"language\": \"00-TASK\"\n },\n {\n \"code\": \"var foo; // untyped\\nvar bar:*; // explicitly untyped\\n\\ntrace(foo + \\\", \\\" + bar); // outputs \\\"undefined, undefined\\\"\\n\\nif (foo == undefined)\\n trace(\\\"foo is undefined\\\"); // outputs \\\"foo is undefined\\\"\\n\",\n \"language\": \"ActionScript\"\n },\n {\n \"code\": \"pragma Initialize_Scalars;\\nwith Ada.Text_IO; use Ada.Text_IO;\\n\\nprocedure Invalid_Value is\\n type Color is (Red, Green, Blue);\\n X : Float;\\n Y : Color;\\nbegin\\n if not X'Valid then\\n Put_Line (\\\"X is not valid\\\");\\n end if;\\n X := 1.0;\\n if X'Valid then\\n Put_Line (\\\"X is\\\" & Float'Image (X));\\n end if;\\n if not Y'Valid then\\n Put_Line (\\\"Y is not valid\\\");\\n end if;\\n Y := Green;\\n if Y'Valid then\\n Put_Line (\\\"Y is \\\" & Color'Image (Y));\\n end if;\\nend Invalid_Value;\\n\",\n \"language\": \"Ada\"\n },\n {\n \"code\": \"MODE R = REF BOOL;\\nR r := NIL;\\n\\nMODE U = UNION(BOOL, VOID);\\nU u := EMPTY;\\n\\nIF r IS R(NIL) THEN\\n print((\\\"r IS NIL\\\", new line))\\nELSE\\n print((\\\"r ISNT NIL\\\", new line))\\nFI;\\n\\nCASE u IN\\n (VOID):print((\\\"u is EMPTY\\\", new line))\\n OUT print((\\\"u isnt EMPTY\\\", new line))\\nESAC\\n\",\n \"language\": \"ALGOL-68\"\n },\n {\n \"code\": \"undef: null\\n\\nprint undef\\n\",\n \"language\": \"Arturo\"\n },\n {\n \"code\": \" ok% = TRUE\\n ON ERROR LOCAL IF ERR<>26 REPORT : END ELSE ok% = FALSE\\n IF ok% THEN\\n PRINT variable$\\n ELSE\\n PRINT \\\"Not defined\\\"\\n ENDIF\\n RESTORE ERROR\\n\",\n \"language\": \"BBC-BASIC\"\n },\n {\n \"code\": \" PROCtest\\n END\\n\\n DEF PROCtest\\n LOCAL array()\\n IF !^array() < 2 PRINT \\\"Array is undefined\\\"\\n DIM array(1,2)\\n IF !^array() > 1 PRINT \\\"Array is defined\\\"\\n\\n !^array() = 0 : REM Set array to undefined state\\n ENDPROC\\n\",\n \"language\": \"BBC-BASIC\"\n },\n {\n \"code\": \"#include <stdio.h>\\n#include <stdlib.h>\\n\\nint main()\\n{\\n int junk, *junkp;\\n\\n /* Print an unitialized variable! */\\n printf(\\\"junk: %d\\\\n\\\", junk);\\n\\n /* Follow a pointer to unitialized memory! */\\n junkp = malloc(sizeof *junkp);\\n if (junkp)\\n printf(\\\"*junkp: %d\\\\n\\\", *junkp);\\n return 0;\\n}\\n\",\n \"language\": \"C\"\n },\n {\n \"code\": \"#include <iostream>\\n\\nint main()\\n{\\n int undefined;\\n if (undefined == 42)\\n {\\n std::cout << \\\"42\\\";\\n }\\n\\n if (undefined != 42)\\n {\\n std::cout << \\\"not 42\\\";\\n }\\n}\\n\",\n \"language\": \"C++\"\n },\n {\n \"code\": \"string foo = null;\\n\",\n \"language\": \"C-sharp\"\n },\n {\n \"code\": \"int i = null;\\n\",\n \"language\": \"C-sharp\"\n },\n {\n \"code\": \"int? answer = null;\\nif (answer == null) {\\n answer = 42;\\n}\\n\",\n \"language\": \"C-sharp\"\n },\n {\n \"code\": \"Nullable<int> answer = new Nullable<int>();\\nif (!answer.HasValue) {\\n answer = new Nullable<int>(42);\\n}\\n\",\n \"language\": \"C-sharp\"\n },\n {\n \"code\": \" ;; assumption: none of these variables initially exist\\n\\n (defvar *x*) ;; variable exists now, but has no value\\n (defvar *y* 42) ;; variable exists now, and has a value\\n\\n (special-variable-p '*x*) -> T ;; Symbol *x* names a special variable\\n (boundp '*x*) -> NIL ;; *x* has no binding\\n (boundp '*y*) -> T\\n\\n (special-variable-p '*z*) -> NIL ;; *z* does not name a special variable\\n\",\n \"language\": \"Common-Lisp\"\n },\n {\n \"code\": \" (makunbound '*y*) ;; *y* no longer has a value; it is erroneous to evaluate *y*\\n\\n (setf *y* 43) ;; *y* is bound again.\\n\",\n \"language\": \"Common-Lisp\"\n },\n {\n \"code\": \" (defvar *dyn*) ;; special, no binding\\n\\n (let (*dyn* ;; locally scoped override, value is nil\\n lex) ;; lexical, value is nil\\n (list (boundp '*dyn*) *dyn* (boundp 'lex) lex)) -> (T NIL NIL NIL)\\n\\n (boundp '*global*) -> NIL\\n\",\n \"language\": \"Common-Lisp\"\n },\n {\n \"code\": \"void main() {\\n // Initialized:\\n int a = 5;\\n double b = 5.0;\\n char c = 'f';\\n int[] d = [1, 2, 3];\\n\\n // Default initialized:\\n int aa; // set to 0\\n double bb; // set to double.init, that is a NaN\\n char cc; // set to 0xFF\\n int[] dd; // set to null\\n int[3] ee; // set to [0, 0, 0]\\n\\n // Undefined (contain garbage):\\n int aaa = void;\\n double[] bbb = void;\\n int[3] eee = void;\\n}\\n\",\n \"language\": \"D\"\n },\n {\n \"code\": \"var\\n P: PInteger;\\nbegin\\n New(P); //Allocate some memory\\n try\\n If Assigned(P) Then //...\\n begin\\n P^ := 42;\\n end;\\n finally\\n Dispose(P); //Release memory allocated by New\\n end;\\nend;\\n\",\n \"language\": \"Delphi\"\n },\n {\n \"code\": \"if (foo == bar || (def baz := lookup(foo)) != null) {\\n ...\\n}\\n\",\n \"language\": \"E\"\n },\n {\n \"code\": \"-module( undefined_values ).\\n\\n-export( [task/0] ).\\n\\n-record( a_record, {member_1, member_2} ).\\n\\ntask() ->\\n Record = #a_record{member_1=a_value},\\n io:fwrite( \\\"Record member_1 ~p, member_2 ~p~n\\\", [Record#a_record.member_1, Record#a_record.member_2] ),\\n io:fwrite( \\\"Member_2 is undefined ~p~n\\\", [Record#a_record.member_2 =:= undefined] ).\\n\",\n \"language\": \"Erlang\"\n },\n {\n \"code\": \"42 . ! 42\\n\",\n \"language\": \"Factor\"\n },\n {\n \"code\": \"TUPLE: foo bar ;\\nfoo new bar>> . ! f\\n\\nTUPLE: my-tuple { n integer } ;\\nmy-tuple new n>> . ! 0\\n\",\n \"language\": \"Factor\"\n },\n {\n \"code\": \"SYMBOL: n\\nn get . ! f\\n\\n\\\\ + get . ! f\\n\",\n \"language\": \"Factor\"\n },\n {\n \"code\": \"[let\\n 2 :> n ! There is no other way!\\n 0 1 :> ( a b )\\n]\\n\",\n \"language\": \"Factor\"\n },\n {\n \"code\": \"[undefined] var [if] .( var is undefined at first check) cr [then]\\n\\nmarker forget-var\\n\\nvariable var\\n\\n[defined] var [if] .( var is defined at second check) cr [then]\\n\\nforget-var\\n\\n[undefined] var [if] .( var is undefined at third check) cr [then]\\n\",\n \"language\": \"Forth\"\n },\n {\n \"code\": \"IsNaN(x)\\n\",\n \"language\": \"Fortran\"\n },\n {\n \"code\": \"' FB 1.05.0 Win64\\n\\nDim i As Integer '' initialized to 0 by default\\nDim j As Integer = 3 '' initialized to 3\\nDim k As Integer = Any '' left uninitialized (compiler warning but can be ignored)\\n\\nPrint i, j, k\\nSleep\\n\",\n \"language\": \"FreeBASIC\"\n },\n {\n \"code\": \"IsBound(a);\\n# true\\n\\nUnbind(a);\\n\\nIsBound(a);\\n# false\\n\",\n \"language\": \"GAP\"\n },\n {\n \"code\": \"package main\\n\\nimport \\\"fmt\\\"\\n\\nvar (\\n s []int\\n p *int\\n f func()\\n i interface{}\\n m map[int]int\\n c chan int\\n)\\n\\nfunc main() {\\n fmt.Println(\\\"Exercise nil objects:\\\")\\n status()\\n\\n // initialize objects\\n s = make([]int, 1)\\n p = &s[0] // yes, reference element of slice just created\\n f = func() { fmt.Println(\\\"function call\\\") }\\n i = user(0) // see user defined type just below\\n m = make(map[int]int)\\n c = make(chan int, 1)\\n\\n fmt.Println(\\\"\\\\nExercise objects after initialization:\\\")\\n status()\\n}\\n\\ntype user int\\n\\nfunc (user) m() {\\n fmt.Println(\\\"method call\\\")\\n}\\n\\nfunc status() {\\n trySlice()\\n tryPointer()\\n tryFunction()\\n tryInterface()\\n tryMap()\\n tryChannel()\\n}\\n\\nfunc reportPanic() {\\n if x := recover(); x != nil {\\n fmt.Println(\\\"panic:\\\", x)\\n }\\n}\\n\\nfunc trySlice() {\\n defer reportPanic()\\n fmt.Println(\\\"s[0] =\\\", s[0])\\n}\\n\\nfunc tryPointer() {\\n defer reportPanic()\\n fmt.Println(\\\"*p =\\\", *p)\\n}\\n\\nfunc tryFunction() {\\n defer reportPanic()\\n f()\\n}\\n\\nfunc tryInterface() {\\n defer reportPanic()\\n\\n // normally the nil identifier accesses a nil value for one of\\n // six predefined types. In a type switch however, nil can be used\\n // as a type. In this case, it matches the nil interface.\\n switch i.(type) {\\n case nil:\\n fmt.Println(\\\"i is nil interface\\\")\\n case interface {\\n m()\\n }:\\n fmt.Println(\\\"i has method m\\\")\\n }\\n\\n // assert type with method and then call method\\n i.(interface {\\n m()\\n }).m()\\n}\\n\\nfunc tryMap() {\\n defer reportPanic()\\n m[0] = 0\\n fmt.Println(\\\"m[0] =\\\", m[0])\\n}\\n\\nfunc tryChannel() {\\n defer reportPanic()\\n close(c)\\n fmt.Println(\\\"channel closed\\\")\\n}\\n\",\n \"language\": \"Go\"\n },\n {\n \"code\": \"main = print $ \\\"Incoming error--\\\" ++ undefined\\n-- When run in GHC:\\n-- \\\"Incoming error--*** Exception: Prelude.undefined\\n\",\n \"language\": \"Haskell\"\n },\n {\n \"code\": \"main = print $ length [undefined, undefined, 1 `div` 0]\\n\",\n \"language\": \"Haskell\"\n },\n {\n \"code\": \"resurrect 0 = error \\\"I'm out of orange smoke!\\\"\\n\",\n \"language\": \"Haskell\"\n },\n {\n \"code\": \"undefined :: a\\nundefined = error \\\"Prelude.undefined\\\"\\n\",\n \"language\": \"Haskell\"\n },\n {\n \"code\": \"import Control.Exception (catch, evaluate, ErrorCall)\\nimport System.IO.Unsafe (unsafePerformIO)\\nimport Prelude hiding (catch)\\nimport Control.DeepSeq (NFData, deepseq)\\n\\nscoopError :: (NFData a) => a -> Either String a\\nscoopError x = unsafePerformIO $ catch right left\\n where right = deepseq x $ return $ Right x\\n left e = return $ Left $ show (e :: ErrorCall)\\n\\nsafeHead :: (NFData a) => [a] -> Either String a\\nsafeHead = scoopError . head\\n\\nmain = do\\n print $ safeHead ([] :: String)\\n print $ safeHead [\\\"str\\\"]\\n\",\n \"language\": \"Haskell\"\n },\n {\n \"code\": \" foo=: 3\\n nc;:'foo bar'\\n0 _1\\n\",\n \"language\": \"J\"\n },\n {\n \"code\": \" erase;:'foo bar'\\n1 1\\n nc;:'foo bar'\\n_1 _1\\n bar=:99\\n nc;:'foo bar'\\n_1 0\\n\",\n \"language\": \"J\"\n },\n {\n \"code\": \"String string = null; // the variable string is undefined\\nSystem.out.println(string); //prints \\\"null\\\" to std out\\nSystem.out.println(string.length()); // dereferencing null throws java.lang.NullPointerException\\n\",\n \"language\": \"Java\"\n },\n {\n \"code\": \"int i = null; // compilation error: incompatible types, required: int, found: <nulltype>\\nif (i == null) { // compilation error: incomparable types: int and <nulltype>\\n i = 1;\\n}\\n\",\n \"language\": \"Java\"\n },\n {\n \"code\": \"Integer i = null; // variable i is undefined\\nif (i == null) {\\n i = 1;\\n}\\n\",\n \"language\": \"Java\"\n },\n {\n \"code\": \"var a;\\n\\ntypeof(a) === \\\"undefined\\\";\\ntypeof(b) === \\\"undefined\\\";\\n\\nvar obj = {}; // Empty object.\\ntypeof(obj.c) === \\\"undefined\\\";\\n\\nobj.c = 42;\\n\\nobj.c === 42;\\ndelete obj.c;\\ntypeof(obj.c) === \\\"undefined\\\";\\n\",\n \"language\": \"JavaScript\"\n },\n {\n \"code\": \"var a;\\na === void 0; // true\\nb === void 0; // throws a ReferenceError\\n\",\n \"language\": \"JavaScript\"\n },\n {\n \"code\": \"{}[\\\"key\\\"] #=> null\\n\",\n \"language\": \"Jq\"\n },\n {\n \"code\": \"1/0 == null #=>false\\n\",\n \"language\": \"Jq\"\n },\n {\n \"code\": \"def sum: reduce .[] as $x (null; . + $x);\\n\",\n \"language\": \"Jq\"\n },\n {\n \"code\": \"julia> arr = [1, 2, nothing, 3]\\n4-element Array{Union{Nothing, Int64},1}:\\n 1\\n 2\\n nothing\\n 3\\n\\njulia> x = arr .+ 5\\nERROR: MethodError: no method matching +(::Nothing, ::Int64)\\nClosest candidates are:\\n +(::Any, ::Any, ::Any, ::Any...) at operators.jl:502\\n +(::Complex{Bool}, ::Real) at complex.jl:292\\n +(::Missing, ::Number) at missing.jl:93\\n ...\\n\\njulia> arr = [1, 2, missing, 3]\\n4-element Array{Union{Missing, Int64},1}:\\n 1\\n 2\\n missing\\n 3\\n\\njulia> x = arr .+ 5\\n4-element Array{Union{Missing, Int64},1}:\\n 6\\n 7\\n missing\\n 8\\n\",\n \"language\": \"Julia\"\n },\n {\n \"code\": \"// version 1.1.2\\n\\nclass SomeClass\\n\\nclass SomeOtherClass {\\n lateinit var sc: SomeClass\\n\\n fun initialize() {\\n sc = SomeClass() // not initialized in place or in constructor\\n }\\n\\n fun printSomething() {\\n println(sc) // 'sc' may not have been initialized at this point\\n }\\n\\n fun someFunc(): String {\\n // for now calls a library function which throws an error and returns Nothing\\n TODO(\\\"someFunc not yet implemented\\\")\\n }\\n}\\n\\nfun main(args: Array<String>) {\\n val soc = SomeOtherClass()\\n\\n try {\\n soc.printSomething()\\n }\\n catch (ex: Exception) {\\n println(ex)\\n }\\n\\n try {\\n soc.someFunc()\\n }\\n catch (e: Error) {\\n println(e)\\n }\\n}\\n\",\n \"language\": \"Kotlin\"\n },\n {\n \"code\": \"put var\\n-- <Void>\\nput var=VOID\\n-- 1\\nput voidP(var)\\n-- 1\\nvar = 23\\nput voidP(var)\\n-- 0\\n\",\n \"language\": \"Lingo\"\n },\n {\n \"code\": \"; procedures\\nto square :x\\n output :x * :x\\nend\\n\\nshow defined? \\\"x ; true\\nshow procedure? \\\"x ; true (also works for built-in primitives)\\nerase \\\"x\\nshow defined? \\\"x ; false\\nshow square 3 ; I don't know how to square\\n\\n; names\\n\\nmake \\\"n 23\\n\\nshow name? \\\"n ; true\\nern \\\"n\\nshow name? \\\"n ; false\\nshow :n ; n has no value\\n\",\n \"language\": \"Logo\"\n },\n {\n \"code\": \"HAI 1.3\\n\\nI HAS A foo BTW, INISHULIZD TO NOOB\\nDIFFRINT foo AN FAIL, O RLY?\\n YA RLY, VISIBLE \\\"FAIL != NOOB\\\"\\nOIC\\n\\nI HAS A bar ITZ 42\\nbar, O RLY?\\n YA RLY, VISIBLE \\\"bar IZ DEFIND\\\"\\nOIC\\n\\nbar R NOOB BTW, UNDEF bar\\nbar, O RLY?\\n YA RLY, VISIBLE \\\"SHUD NEVAR C DIS\\\"\\nOIC\\n\\nKTHXBYE\\n\",\n \"language\": \"LOLCODE\"\n },\n {\n \"code\": \"print( a )\\n\\nlocal b\\nprint( b )\\n\\nif b == nil then\\n b = 5\\nend\\nprint( b )\\n\",\n \"language\": \"Lua\"\n },\n {\n \"code\": \"a\\n-> a\\na + a\\n-> 2 a\\nValueQ[a]\\n-> False\\na = 5\\n-> 5\\nValueQ[a]\\n-> True\\n\",\n \"language\": \"Mathematica\"\n },\n {\n \"code\": \"ConditionalExpression[a, False]\\n->Undefined\\n\",\n \"language\": \"Mathematica\"\n },\n {\n \"code\": \"Sin[Undefined]\\n-> Undefined\\n\",\n \"language\": \"Mathematica\"\n },\n {\n \"code\": \"a = Undefined\\n-> Undefined\\na\\n-> Undefined\\nValueQ[a]\\n-> True\\n\",\n \"language\": \"Mathematica\"\n },\n {\n \"code\": \" global var;\\n\",\n \"language\": \"MATLAB\"\n },\n {\n \"code\": \" isempty(var)\\n\",\n \"language\": \"MATLAB\"\n },\n {\n \"code\": \" var = [1, 2, NaN, 0/0, inf-inf, 5]\\n\",\n \"language\": \"MATLAB\"\n },\n {\n \"code\": \" isnan(var)\\n\",\n \"language\": \"MATLAB\"\n },\n {\n \"code\": \" IF $DATA(SOMEVAR)=0 DO UNDEF ; A result of 0 means the value is undefined\\n SET LOCAL=$GET(^PATIENT(RECORDNUM,0)) ;If there isn't a defined item at that location, a null string is returned\\n\",\n \"language\": \"MUMPS\"\n },\n {\n \"code\": \"var a {.noInit.}: array[1_000_000, int]\\n\\n# For a proc, {.noInit.} means that the result is not initialized.\\nproc p(): array[1000, int] {.noInit.} =\\n for i in 0..999: result[i] = i\\n\",\n \"language\": \"Nim\"\n },\n {\n \"code\": \"(* There is no undefined value in OCaml,\\n but if you really need this you can use the built-in \\\"option\\\" type.\\n It is defined like this: type 'a option = None | Some of 'a *)\\n\\nlet inc = function\\n Some n -> Some (n+1)\\n| None -> failwith \\\"Undefined argument\\\";;\\n\\ninc (Some 0);;\\n(* - : value = Some 1 *)\\n\\ninc None;;\\n(* Exception: Failure \\\"Undefined argument\\\". *)\\n\",\n \"language\": \"OCaml\"\n },\n {\n \"code\": \"declare X in\\n\\nthread\\n if {IsFree X} then {System.showInfo \\\"X is unbound.\\\"} end\\n {Wait X}\\n {System.showInfo \\\"Now X is determined.\\\"}\\nend\\n\\n{System.showInfo \\\"Sleeping...\\\"}\\n{Delay 1000}\\n{System.showInfo \\\"Setting X.\\\"}\\nX = 42\\n\",\n \"language\": \"Oz\"\n },\n {\n \"code\": \"v == 'v\\n\",\n \"language\": \"PARI-GP\"\n },\n {\n \"code\": \"is_entry(\\\"v\\\") == NULL;\\n\",\n \"language\": \"PARI-GP\"\n },\n {\n \"code\": \"#!/usr/bin/perl -w\\nuse strict;\\n\\n# Declare the variable. It is initialized to the value \\\"undef\\\"\\nour $var;\\n\\n# Check to see whether it is defined\\nprint \\\"var contains an undefined value at first check\\\\n\\\" unless defined $var;\\n\\n# Give it a value\\n$var = \\\"Chocolate\\\";\\n\\n# Check to see whether it is defined after we gave it the\\n# value \\\"Chocolate\\\"\\nprint \\\"var contains an undefined value at second check\\\\n\\\" unless defined $var;\\n\\n# Give the variable the value \\\"undef\\\".\\n$var = undef;\\n# or, equivalently:\\nundef($var);\\n\\n# Check to see whether it is defined after we've explicitly\\n# given it an undefined value.\\nprint \\\"var contains an undefined value at third check\\\\n\\\" unless defined $var;\\n\\n# Give the variable a value of 42\\n$var = 42;\\n\\n# Check to see whether the it is defined after we've given it\\n# the value 42.\\nprint \\\"var contains an undefined value at fourth check\\\\n\\\" unless defined $var;\\n\\n# Because most of the output is conditional, this serves as\\n# a clear indicator that the program has run to completion.\\nprint \\\"Done\\\\n\\\";\\n\",\n \"language\": \"Perl\"\n },\n {\n \"code\": \"-->\\n <span style=\\\"color: #004080;\\\">object</span> <span style=\\\"color: #000000;\\\">x</span>\\n\\n <span style=\\\"color: #008080;\\\">procedure</span> <span style=\\\"color: #000000;\\\">test</span><span style=\\\"color: #0000FF;\\\">()</span>\\n <span style=\\\"color: #008080;\\\">if</span> <span style=\\\"color: #004080;\\\">object</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">x</span><span style=\\\"color: #0000FF;\\\">)</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;\\\">\\\"x is an object\\\\n\\\"</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #008080;\\\">else</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;\\\">\\\"x is unassigned\\\\n\\\"</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;\\\">procedure</span>\\n\\n <span style=\\\"color: #000000;\\\">test</span><span style=\\\"color: #0000FF;\\\">()</span>\\n <span style=\\\"color: #000000;\\\">x</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">1</span>\\n <span style=\\\"color: #000000;\\\">test</span><span style=\\\"color: #0000FF;\\\">()</span>\\n<!--\\n\",\n \"language\": \"Phix\"\n },\n {\n \"code\": \"<?php\\n// Check to see whether it is defined\\nif (!isset($var))\\n echo \\\"var is undefined at first check\\\\n\\\";\\n\\n// Give it a value\\n$var = \\\"Chocolate\\\";\\n\\n// Check to see whether it is defined after we gave it the\\n// value \\\"Chocolate\\\"\\nif (!isset($var))\\n echo \\\"var is undefined at second check\\\\n\\\";\\n\\n// Give the variable an undefined value.\\nunset($var);\\n\\n// Check to see whether it is defined after we've explicitly\\n// given it an undefined value.\\nif (!isset($var))\\n echo \\\"var is undefined at third check\\\\n\\\";\\n\\n// Give the variable a value of 42\\n$var = 42;\\n\\n// Check to see whether the it is defined after we've given it\\n// the value 42.\\nif (!isset($var))\\n echo \\\"var is undefined at fourth check\\\\n\\\";\\n\\n// Because most of the output is conditional, this serves as\\n// a clear indicator that the program has run to completion.\\necho \\\"Done\\\\n\\\";\\n?>\\n\",\n \"language\": \"PHP\"\n },\n {\n \"code\": \": (myfoo 3 4)\\n!? (myfoo 3 4)\\nmyfoo -- Undefined\\n?\\n\",\n \"language\": \"PicoLisp\"\n },\n {\n \"code\": \": MyVar\\n-> NIL\\n\\n: (default MyVar 7)\\n-> 7\\n\\n: MyVar\\n-> 7\\n\\n: (default MyVar 8)\\n-> 7\\n\\n: MyVar\\n-> 7\\n\",\n \"language\": \"PicoLisp\"\n },\n {\n \"code\": \"> zero_type(UNDEFINED);\\nResult: 1\\n> mapping bar = ([ \\\"foo\\\":\\\"hello\\\" ]);\\n> zero_type(bar->foo);\\nResult: 0\\n> zero_type(bar->baz);\\nResult: 1\\n> bar->baz=UNDEFINED;\\nResult: 0\\n> zero_type(bar->baz);\\nResult: 0\\n\",\n \"language\": \"Pike\"\n },\n {\n \"code\": \"if (Get-Variable -Name noSuchVariable -ErrorAction SilentlyContinue)\\n{\\n $true\\n}\\nelse\\n{\\n $false\\n}\\n\",\n \"language\": \"PowerShell\"\n },\n {\n \"code\": \"Get-PSProvider\\n\",\n \"language\": \"PowerShell\"\n },\n {\n \"code\": \"Test-Path Variable:\\\\noSuchVariable\\n\",\n \"language\": \"PowerShell\"\n },\n {\n \"code\": \"$noSuchVariable -eq $null\\n\",\n \"language\": \"PowerShell\"\n },\n {\n \"code\": \"If OpenConsole()\\n\\n CompilerIf Defined(var, #PB_Variable)\\n PrintN(\\\"var is defined at first check\\\")\\n CompilerElse\\n PrintN(\\\"var is undefined at first check\\\")\\n Define var\\n CompilerEndIf\\n\\n CompilerIf Defined(var, #PB_Variable)\\n PrintN(\\\"var is defined at second check\\\")\\n CompilerElse\\n PrintN(\\\"var is undefined at second check\\\")\\n Define var\\n CompilerEndIf\\n\\n Print(#CRLF$ + #CRLF$ + \\\"Press ENTER to exit\\\")\\n Input()\\n CloseConsole()\\n\\nEndIf\\n\",\n \"language\": \"PureBasic\"\n },\n {\n \"code\": \"# Check to see whether a name is defined\\ntry: name\\nexcept NameError: print \\\"name is undefined at first check\\\"\\n\\n# Create a name, giving it a string value\\nname = \\\"Chocolate\\\"\\n\\n# Check to see whether the name is defined now.\\ntry: name\\nexcept NameError: print \\\"name is undefined at second check\\\"\\n\\n# Remove the definition of the name.\\ndel name\\n\\n# Check to see whether it is defined after the explicit removal.\\ntry: name\\nexcept NameError: print \\\"name is undefined at third check\\\"\\n\\n# Recreate the name, giving it a value of 42\\nname = 42\\n\\n# Check to see whether the name is defined now.\\ntry: name\\nexcept NameError: print \\\"name is undefined at fourth check\\\"\\n\\n# Because most of the output is conditional, this serves as\\n# a clear indicator that the program has run to completion.\\nprint \\\"Done\\\"\\n\",\n \"language\": \"Python\"\n },\n {\n \"code\": \"exists(\\\"x\\\")\\n\",\n \"language\": \"R\"\n },\n {\n \"code\": \"x <- NULL\\n\",\n \"language\": \"R\"\n },\n {\n \"code\": \"y <- c(1, 4, 9, NA, 25)\\nz <- c(\\\"foo\\\", NA, \\\"baz\\\")\\n\",\n \"language\": \"R\"\n },\n {\n \"code\": \"print_is_missing <- function(x)\\n{\\n print(missing(x))\\n}\\n\\nprint_is_missing() # TRUE\\nprint_is_missing(123) # FALSE\\n\",\n \"language\": \"R\"\n },\n {\n \"code\": \"-> (letrec ([x x]) x)\\n#<undefined>\\n\",\n \"language\": \"Racket\"\n },\n {\n \"code\": \"my $x; $x = 42; $x = Nil; say $x.WHAT; # prints Any()\\n\",\n \"language\": \"Raku\"\n },\n {\n \"code\": \"say Method ~~ Routine; # Bool::True\\n\",\n \"language\": \"Raku\"\n },\n {\n \"code\": \"my $x; say $x.WHAT; # Any()\\nmy Int $y; say $y.WHAT; # Int()\\nmy Str $z; say $z.WHAT; # Str()\\n\",\n \"language\": \"Raku\"\n },\n {\n \"code\": \"my Int:D $i = 1; # if $i has to be defined you must provide a default value\\nmulti sub foo(Int:D $i where * != 0){ (0..100).roll / $i } # we will never divide by 0\\nmulti sub foo(Int:U $i){ die 'WELP! $i is undefined' } # because undefinedness is deadly\\n\\nwith $i { say 'defined' } # as \\\"if\\\" is looking for Bool::True, \\\"with\\\" is looking for *.defined\\nwith 0 { say '0 may not divide but it is defined' }\\n\",\n \"language\": \"Raku\"\n },\n {\n \"code\": \"my $is-defined = 1;\\nmy $ain't-defined = Any;\\nmy $doesn't-matter;\\nmy Any:D $will-be-defined = $ain't-defined // $is-defined // $doesn't-matter;\\n\\nmy @a-mixed-list = Any, 1, Any, 'a';\\n$will-be-defined = [//] @a-mixed-list; # [//] will return the first defined value\\n\\nmy @a = Any,Any,1,1;\\nmy @b = 2,Any,Any,2;\\nmy @may-contain-any = @a >>//<< @b; # contains: [2, Any, 1, 1]\\n\\nsub f1(){Failure.new('WELP!')};\\nsub f2(){ $_ ~~ Failure }; # orelse will kindly set the topic for us\\nmy $s = (f1() orelse f2()); # Please note the parentheses, which are needed because orelse is\\n # much looser then infix:<=> .\\ndd $s; # this be Bool::False\\n\",\n \"language\": \"Raku\"\n },\n {\n \"code\": \"/*REXX program test if a (REXX) variable is defined or not defined. */\\ntlaloc = \\\"rain god of the Aztecs.\\\" /*assign a value to the Aztec rain god.*/\\n /*check if the rain god is defined. */\\ny= 'tlaloc'\\nif symbol(y)==\\\"VAR\\\" then say y ' is defined.'\\n else say y \\\"isn't defined.\\\"\\n\\n /*check if the fire god is defined. */\\n\\ny= 'xiuhtecuhtli' /*assign a value to the Aztec file god.*/\\nif symbol(y)==\\\"VAR\\\" then say y ' is defined.'\\n else say y \\\"isn't defined.\\\"\\n\\n\\ndrop tlaloc /*un─define the TLALOC REXX variable.*/\\n /*check if the rain god is defined. */\\ny= 'tlaloc'\\nif symbol(y)==\\\"VAR\\\" then say y ' is defined.'\\n else say y \\\"isn't defined.\\\"\\n /*stick a fork in it, we're all done. */\\n\",\n \"language\": \"REXX\"\n },\n {\n \"code\": \"# Project : Undefined values\\n\\ntest()\\nfunc test\\n x=10 y=20\\n see islocal(\\\"x\\\") + nl +\\n islocal(\\\"y\\\") + nl +\\n islocal(\\\"z\\\") + nl\\n\",\n \"language\": \"Ring\"\n },\n {\n \"code\": \"# Check to see whether it is defined\\nputs \\\"var is undefined at first check\\\" unless defined? var\\n\\n# Give it a value\\nvar = \\\"Chocolate\\\"\\n\\n# Check to see whether it is defined after we gave it the\\n# value \\\"Chocolate\\\"\\nputs \\\"var is undefined at second check\\\" unless defined? var\\n\\n# I don't know any way of undefining a variable in Ruby\\n\\n# Because most of the output is conditional, this serves as\\n# a clear indicator that the program has run to completion.\\nputs \\\"Done\\\"\\n\",\n \"language\": \"Ruby\"\n },\n {\n \"code\": \"use std::ptr;\\n\\nlet p: *const i32 = ptr::null();\\nassert!(p.is_null());\\n\",\n \"language\": \"Rust\"\n },\n {\n \"code\": \"var x; # declared, but not defined\\nx == nil && say \\\"nil value\\\";\\ndefined(x) || say \\\"undefined\\\";\\n\\n# Give \\\"x\\\" some value\\nx = 42;\\n\\ndefined(x) && say \\\"defined\\\";\\n\\n# Change \\\"x\\\" back to `nil`\\nx = nil;\\n\\ndefined(x) || say \\\"undefined\\\";\\n\",\n \"language\": \"Sidef\"\n },\n {\n \"code\": \"Smalltalk includesKey: #FooBar\\nmyNamespace includesKey: #Baz\\n\",\n \"language\": \"Smalltalk\"\n },\n {\n \"code\": \"# Variables are undefined by default and do not need explicit declaration\\n\\n# Check to see whether it is defined\\nif {![info exists var]} {puts \\\"var is undefind at first check\\\"}\\n\\n# Give it a value\\nset var \\\"Screwy Squirrel\\\"\\n\\n# Check to see whether it is defined\\nif {![info exists var]} {puts \\\"var is undefind at second check\\\"}\\n\\n# Remove its value\\nunset var\\n\\n# Check to see whether it is defined\\nif {![info exists var]} {puts \\\"var is undefind at third check\\\"}\\n\\n# Give it a value again\\nset var 12345\\n\\n# Check to see whether it is defined\\nif {![info exists var]} {puts \\\"var is undefind at fourth check\\\"}\\n\\nputs \\\"Done\\\"\\n\",\n \"language\": \"Tcl\"\n },\n {\n \"code\": \"global G1\\n\\nprocedure main(arglist)\\nlocal ML1\\nstatic MS1\\nundeftest()\\nend\\n\\nprocedure undeftest(P1)\\nstatic S1\\nlocal L1,L2\\nevery #write all local, parameter, static, and global variable names\\n write((localnames|paramnames|staticnames|globalnames)(¤t,0)) # ... visible in the current co-expression at this calling level (0)\\nreturn\\nend\\n\",\n \"language\": \"Unicon\"\n },\n {\n \"code\": \"VAR1=\\\"VAR1\\\"\\necho ${VAR1:-\\\"Not set.\\\"}\\necho ${VAR2:-\\\"Not set.\\\"}\\n\",\n \"language\": \"UNIX-Shell\"\n },\n {\n \"code\": \"var f = Fn.new {\\n System.print(\\\"'f' called.\\\") // note no return value\\n}\\n\\nvar res = f.call()\\nSystem.print(\\\"The value returned by 'f' is %(res).\\\")\\n\\nvar m = {} // empty map\\nSystem.print(\\\"m[1] is %(m[1]).\\\")\\n\\nvar u // declared but not assigned a value\\nSystem.print(\\\"u is %(u).\\\")\\n\\nvar v = null // explicitly assigned null\\nif (!v) System.print(\\\"v is %(v).\\\")\\n\",\n \"language\": \"Wren\"\n },\n {\n \"code\": \"println(Void);\\n1+Void\\nif(Void){} else { 23 }\\n\",\n \"language\": \"Zkl\"\n }\n]","isConversational":false},"task_name":{"kind":"string","value":"Undefined-values"}}},{"rowIdx":1782,"cells":{"solutions":{"kind":"list like","value":[{"code":"---\nfrom: http://rosettacode.org/wiki/Unicode_strings\n","language":"00-META"},{"code":"As the world gets smaller each day, internationalization becomes more and more important. For handling multiple languages, [[Unicode]] is your best friend. \n\nIt is a very capable and [https://www.youtube.com/watch?v=MijmeoH9LT4 remarquable] tool, but also quite complex compared to older single- and double-byte character encodings. \n\nHow well prepared is your programming language for Unicode? \n\n\n;Task:\nDiscuss and demonstrate its unicode awareness and capabilities. \n\n\nSome suggested topics:\n:* How easy is it to present Unicode strings in source code? \n:* Can Unicode literals be written directly, or be part of identifiers/keywords/etc?\n:* How well can the language communicate with the rest of the world? \n:* Is it good at input/output with Unicode?\n:* Is it convenient to manipulate Unicode strings in the language?\n:* How broad/deep does the language support Unicode? \n:* What encodings (e.g. UTF-8, UTF-16, etc) can be used? \n:* Does it support normalization?\n\n\n;Note:\nThis task is a bit unusual in that it encourages general discussion rather than clever coding.\n\n\n;See also:\n* [[Unicode variable names]]\n* [[Terminal control/Display an extended character]]\n<br><br>\n\n","language":"00-TASK"},{"code":"#!/usr/local/bin/a68g --script #\n# -*- coding: utf-8 -*- #\n\n# UNICHAR/UNICODE must be printed using REPR to convert to UTF8 #\n\nMODE UNICHAR = STRUCT(BITS #31# bits); # assuming bits width >=31 #\nMODE UNICODE = FLEX[0]UNICHAR;\n\nOP INITUNICHAR = (BITS bits)UNICHAR: (UNICHAR out; bits OF out := #ABS# bits; out);\nOP INITUNICHAR = (CHAR char)UNICHAR: (UNICHAR out; bits OF out := BIN ABS char; out);\nOP INITBITS = (UNICHAR unichar)BITS: #BIN# bits OF unichar;\n\nPROC raise value error = ([]UNION(FORMAT,BITS,STRING)argv )VOID: (\n putf(stand error, argv); stop\n);\n\nMODE YIELDCHAR = PROC(CHAR)VOID; MODE GENCHAR = PROC(YIELDCHAR)VOID;\nMODE YIELDUNICHAR = PROC(UNICHAR)VOID; MODE GENUNICHAR = PROC(YIELDUNICHAR)VOID;\n\nPRIO DOCONV = 1;\n\n# Convert a stream of UNICHAR into a stream of UTFCHAR #\nOP DOCONV = (GENUNICHAR gen unichar, YIELDCHAR yield)VOID:(\n BITS non ascii = NOT 2r1111111;\n# FOR UNICHAR unichar IN # gen unichar( # ) DO ( #\n## (UNICHAR unichar)VOID: (\n BITS bits := INITBITS unichar;\n IF (bits AND non ascii) = 2r0 THEN # ascii #\n yield(REPR ABS bits)\n ELSE\n FLEX[6]CHAR buf := \"?\"*6; # initialise work around #\n INT bytes := 0;\n BITS byte lead bits = 2r10000000;\n FOR ofs FROM UPB buf BY -1 WHILE\n bytes +:= 1;\n buf[ofs]:= REPR ABS (byte lead bits OR bits AND 2r111111);\n bits := bits SHR 6;\n # WHILE # bits NE 2r0 DO\n SKIP\n OD;\n BITS first byte lead bits = BIN (ABS(2r1 SHL bytes)-2) SHL (UPB buf - bytes + 1);\n buf := buf[UPB buf-bytes+1:];\n buf[1] := REPR ABS(BIN ABS buf[1] OR first byte lead bits);\n FOR i TO UPB buf DO yield(buf[i]) OD\n FI\n# OD # ))\n);\n\n# Convert a STRING into a stream of UNICHAR #\nOP DOCONV = (STRING string, YIELDUNICHAR yield)VOID: (\n PROC gen char = (YIELDCHAR yield)VOID:\n FOR i FROM LWB string TO UPB string DO yield(string[i]) OD;\n gen char DOCONV yield\n);\n\nCO Prosser/Thompson UTF8 encoding scheme\nBits Last code point Byte 1 Byte 2 Byte 3 Byte 4 Byte 5 Byte 6\n 7 U+007F 0xxxxxxx\n11 U+07FF 110xxxxx 10xxxxxx\n16 U+FFFF 1110xxxx 10xxxxxx 10xxxxxx\n21 U+1FFFFF 11110xxx 10xxxxxx 10xxxxxx 10xxxxxx\n26 U+3FFFFFF 111110xx 10xxxxxx 10xxxxxx 10xxxxxx 10xxxxxx\n31 U+7FFFFFFF 1111110x 10xxxxxx 10xxxxxx 10xxxxxx 10xxxxxx 10xxxxxx\nEND CO\n\n# Quickly calculate the length of the UTF8 encoded string #\nPROC upb utf8 = (STRING utf8 string)INT:(\n INT bytes to go := 0;\n INT upb := 0;\n FOR i FROM LWB utf8 string TO UPB utf8 string DO\n CHAR byte := utf8 string[i];\n IF bytes to go = 0 THEN # start new utf char #\n bytes to go :=\n IF ABS byte <= ABS 2r01111111 THEN 1 # 7 bits #\n ELIF ABS byte <= ABS 2r11011111 THEN 2 # 11 bits #\n ELIF ABS byte <= ABS 2r11101111 THEN 3 # 16 bits #\n ELIF ABS byte <= ABS 2r11110111 THEN 4 # 21 bits #\n ELIF ABS byte <= ABS 2r11111011 THEN 5 # 26 bits #\n ELIF ABS byte <= ABS 2r11111101 THEN 6 # 31 bits #\n ELSE raise value error((\"Invalid UTF-8 bytes\", BIN ABS byte)); ~ FI\n FI;\n bytes to go -:= 1; # skip over trailing bytes #\n IF bytes to go = 0 THEN upb +:= 1 FI\n OD;\n upb\n);\n\n# Convert a stream of CHAR into a stream of UNICHAR #\nOP DOCONV = (GENCHAR gen char, YIELDUNICHAR yield)VOID: (\n INT bytes to go := 0;\n INT lshift;\n BITS mask, out;\n\n # FOR CHAR byte IN # gen char( # ) DO ( #\n ## (CHAR byte)VOID: (\n INT bits := ABS byte;\n IF bytes to go = 0 THEN # start new unichar #\n bytes to go :=\n IF bits <= ABS 2r01111111 THEN 1 # 7 bits #\n ELIF bits <= ABS 2r11011111 THEN 2 # 11 bits #\n ELIF bits <= ABS 2r11101111 THEN 3 # 16 bits #\n ELIF bits <= ABS 2r11110111 THEN 4 # 21 bits #\n ELIF bits <= ABS 2r11111011 THEN 5 # 26 bits #\n ELIF bits <= ABS 2r11111101 THEN 6 # 31 bits #\n ELSE raise value error((\"Invalid UTF-8 bytes\", BIN bits)); ~ FI;\n IF bytes to go = 1 THEN\n lshift := 7; mask := 2r1111111\n ELSE\n lshift := 7 - bytes to go; mask := BIN(ABS(2r1 SHL lshift)-1)\n FI;\n out := mask AND BIN bits;\n\n lshift := 6; mask := 2r111111 # subsequently pic 6 bits at a time #\n ELSE\n out := (out SHL lshift) OR ( mask AND BIN bits)\n FI;\n bytes to go -:= 1;\n IF bytes to go = 0 THEN yield(INITUNICHAR out) FI\n # OD # ))\n);\n\n# Convert a string of UNICHAR into a stream of UTFCHAR #\nOP DOCONV = (UNICODE unicode, YIELDCHAR yield)VOID:(\n PROC gen unichar = (YIELDUNICHAR yield)VOID:\n FOR i FROM LWB unicode TO UPB unicode DO yield(unicode[i]) OD;\n gen unichar DOCONV yield\n);\n\n# Some convenience/shorthand U operators #\n# Convert a BITS into a UNICODE char #\nOP U = (BITS bits)UNICHAR:\n INITUNICHAR bits;\n\n# Convert a []BITS into a UNICODE char #\nOP U = ([]BITS array bits)[]UNICHAR:(\n [LWB array bits:UPB array bits]UNICHAR out;\n FOR i FROM LWB array bits TO UPB array bits DO bits OF out[i]:=array bits[i] OD;\n out\n);\n\n# Convert a CHAR into a UNICODE char #\nOP U = (CHAR char)UNICHAR:\n INITUNICHAR char;\n\n# Convert a STRING into a UNICODE string #\nOP U = (STRING utf8 string)UNICODE: (\n FLEX[upb utf8(utf8 string)]UNICHAR out;\n INT i := 0;\n# FOR UNICHAR char IN # utf8 string DOCONV (\n## (UNICHAR char)VOID:\n out[i+:=1] := char\n# OD #);\n out\n);\n\n# Convert a UNICODE string into a UTF8 STRING #\nOP REPR = (UNICODE string)STRING: (\n STRING out;\n# FOR CHAR char IN # string DOCONV (\n## (CHAR char)VOID: (\n out +:= char\n# OD #));\n out\n);\n\n# define the most useful OPerators on UNICODE CHARacter arrays #\n# Note: LWB, UPB and slicing works as per normal #\n\nOP + = (UNICODE a,b)UNICODE: (\n [UPB a + UPB b]UNICHAR out;\n out[:UPB a]:= a; out[UPB a+1:]:= b;\n out\n);\n\nOP + = (UNICODE a, UNICHAR b)UNICODE: a+UNICODE(b);\nOP + = (UNICHAR a, UNICODE b)UNICODE: UNICODE(a)+b;\nOP + = (UNICHAR a,b)UNICODE: UNICODE(a)+b;\n\n# Suffix a character to the end of a UNICODE string #\nOP +:= = (REF UNICODE a, UNICODE b)VOID: a := a + b;\nOP +:= = (REF UNICODE a, UNICHAR b)VOID: a := a + b;\n\n# Prefix a character to the beginning of a UNICODE string #\nOP +=: = (UNICODE b, REF UNICODE a)VOID: a := b + a;\nOP +=: = (UNICHAR b, REF UNICODE a)VOID: a := b + a;\n\nOP * = (UNICODE a, INT n)UNICODE: (\n UNICODE out := a;\n FOR i FROM 2 TO n DO out +:= a OD;\n out\n);\nOP * = (INT n, UNICODE a)UNICODE: a * n;\n\nOP * = (UNICHAR a, INT n)UNICODE: UNICODE(a)*n;\nOP * = (INT n, UNICHAR a)UNICODE: n*UNICODE(a);\n\nOP *:= = (REF UNICODE a, INT b)VOID: a := a * b;\n\n# Wirthy Operators #\nOP LT = (UNICHAR a,b)BOOL: ABS bits OF a LT ABS bits OF b,\n LE = (UNICHAR a,b)BOOL: ABS bits OF a LE ABS bits OF b,\n EQ = (UNICHAR a,b)BOOL: ABS bits OF a EQ ABS bits OF b,\n NE = (UNICHAR a,b)BOOL: ABS bits OF a NE ABS bits OF b,\n GE = (UNICHAR a,b)BOOL: ABS bits OF a GE ABS bits OF b,\n GT = (UNICHAR a,b)BOOL: ABS bits OF a GT ABS bits OF b;\n\n# ASCII OPerators #\nOP < = (UNICHAR a,b)BOOL: a LT b,\n <= = (UNICHAR a,b)BOOL: a LE b,\n = = (UNICHAR a,b)BOOL: a EQ b,\n /= = (UNICHAR a,b)BOOL: a NE b,\n >= = (UNICHAR a,b)BOOL: a GE b,\n > = (UNICHAR a,b)BOOL: a GT b;\n\n# Non ASCII OPerators\nOP ≤ = (UNICHAR a,b)BOOL: a LE b,\n ≠ = (UNICHAR a,b)BOOL: a NE b,\n ≥ = (UNICHAR a,b)BOOL: a GE b;\n#\n\n# Compare two UNICODE strings for equality #\nPROC unicode cmp = (UNICODE str a,str b)INT: (\n\n IF LWB str a > LWB str b THEN exit lt ELIF LWB str a < LWB str b THEN exit gt FI;\n\n INT min upb = UPB(UPB str a < UPB str b | str a | str b );\n\n FOR i FROM LWB str a TO min upb DO\n UNICHAR a := str a[i], UNICHAR b := str b[i];\n IF a < b THEN exit lt ELIF a > b THEN exit gt FI\n OD;\n\n IF UPB str a > UPB str b THEN exit gt ELIF UPB str a < UPB str b THEN exit lt FI;\n\n exit eq: 0 EXIT\n exit lt: -1 EXIT\n exit gt: 1\n);\n\nOP LT = (UNICODE a,b)BOOL: unicode cmp(a,b)< 0,\n LE = (UNICODE a,b)BOOL: unicode cmp(a,b)<=0,\n EQ = (UNICODE a,b)BOOL: unicode cmp(a,b) =0,\n NE = (UNICODE a,b)BOOL: unicode cmp(a,b)/=0,\n GE = (UNICODE a,b)BOOL: unicode cmp(a,b)>=0,\n GT = (UNICODE a,b)BOOL: unicode cmp(a,b)> 0;\n\n# ASCII OPerators #\nOP < = (UNICODE a,b)BOOL: a LT b,\n <= = (UNICODE a,b)BOOL: a LE b,\n = = (UNICODE a,b)BOOL: a EQ b,\n /= = (UNICODE a,b)BOOL: a NE b,\n >= = (UNICODE a,b)BOOL: a GE b,\n > = (UNICODE a,b)BOOL: a GT b;\n\n# Non ASCII OPerators\nOP ≤ = (UNICODE a,b)BOOL: a LE b,\n ≠ = (UNICODE a,b)BOOL: a NE b,\n ≥ = (UNICODE a,b)BOOL: a GE b;\n#\n\nCOMMENT - Todo: for all UNICODE and UNICHAR\n Add NonASCII OPerators: ×, ×:=,\n Add ASCII Operators: &, &:=, &=:\n Add Wirthy OPerators: PLUSTO, PLUSAB, TIMESAB for UNICODE/UNICHAR,\n Add UNICODE against UNICHAR comparison OPerators,\n Add char_in_string and string_in_string PROCedures,\n Add standard Unicode functions:\n to_upper_case, to_lower_case, unicode_block, char_count,\n get_directionality, get_numeric_value, get_type, is_defined,\n is_digit, is_identifier_ignorable, is_iso_control,\n is_letter, is_letter_or_digit, is_lower_case, is_mirrored,\n is_space_char, is_supplementary_code_point, is_title_case,\n is_unicode_identifier_part, is_unicode_identifier_start,\n is_upper_case, is_valid_code_point, is_whitespace\nEND COMMENT\n\ntest:(\n\n UNICHAR aircraft := U16r 2708;\n printf(($\"aircraft: \"$, $\"16r\"16rdddd$, UNICODE(aircraft), $g$, \" => \", REPR UNICODE(aircraft), $l$));\n\n UNICODE chinese forty two = U16r 56db + U16r 5341 + U16r 4e8c;\n printf(($\"chinese forty two: \"$, $g$, REPR chinese forty two, \", length string = \", UPB chinese forty two, $l$));\n\n UNICODE poker = U \"A123456789♥♦♣♠JQK\";\n printf(($\"poker: \"$, $g$, REPR poker, \", length string = \", UPB poker, $l$));\n\n UNICODE selectric := U\"×÷≤≥≠¬∨∧⏨→↓↑□⌊⌈⎩⎧○⊥¢\";\n printf(($\"selectric: \"$, $g$, REPR selectric, $l$));\n printf(($\"selectric*4: \"$, $g$, REPR(selectric*4), $l$));\n\n print((\n \"1 < 2 is \", U\"1\" < U\"2\", \", \",\n \"111 < 11 is \",U\"111\" < U\"11\", \", \",\n \"111 < 12 is \",U\"111\" < U\"12\", \", \",\n \"♥ < ♦ is \", U\"♥\" < U\"♦\", \", \",\n \"♥Q < ♥K is \",U\"♥Q\" < U\"♥K\", \" & \",\n \"♥J < ♥K is \",U\"♥J\" < U\"♥K\", new line\n ))\n\n)\n","language":"ALGOL-68"},{"code":"text: \"你好\"\n\nprint [\"text:\" text]\nprint [\"length:\" size text]\nprint [\"contains string '好'?:\" contains? text \"好\"]\nprint [\"contains character '平'?:\" contains? text `平`]\nprint [\"text as ascii:\" as.ascii text]\n","language":"Arturo"},{"code":" VDU 23,22,640;512;8,16,16,128+8 : REM Select UTF-8 mode\n *FONT Times New Roman, 20\n\n PRINT \"Arabic:\"\n\n arabic1$ = \"هنا مثال يمكنك من الكتابة من اليمين\"\n arabic2$ = \"الى اليسار باللغة العربية\"\n\n VDU 23,16,2;0;0;0;13 : REM Select right-to-left printing\n PRINT FNarabic(arabic1$) ' FNarabic(arabic2$)\n VDU 23,16,0;0;0;0;13 : REM Select left-to-right printing\n\n PRINT '\"Hebrew:\"\n\n hebrew$ = \"זוהי הדגמה של כתיבת טקסט בעברית מימין לשמאל\"\n\n VDU 23,16,2;0;0;0;13 : REM Select right-to-left printing\n PRINT hebrew$\n VDU 23,16,0;0;0;0;13 : REM Select left-to-right printing\n\n END\n\n REM!Eject\n DEF FNarabic(A$)\n LOCAL A%, B%, L%, O%, P%, U%, B$\n A$ += CHR$0\n FOR A% = !^A$ TO !^A$+LENA$-1\n IF ?A%<&80 OR ?A%>=&C0 THEN\n L% = O% : O% = P% : P% = U%\n U% = ((?A% AND &3F) << 6) + (A%?1 AND &3F)\n IF ?A%<&80 U% = 0\n CASE TRUE OF\n WHEN U%=&60C OR U%=&61F: U% = 0\n WHEN U%<&622:\n WHEN U%<&626: U% = &01+2*(U%-&622)\n WHEN U%<&628: U% = &09+4*(U%-&626)\n WHEN U%<&62A: U% = &0F+4*(U%-&628)\n WHEN U%<&62F: U% = &15+4*(U%-&62A)\n WHEN U%<&633: U% = &29+2*(U%-&62F)\n WHEN U%<&63B: U% = &31+4*(U%-&633)\n WHEN U%<&641:\n WHEN U%<&648: U% = &51+4*(U%-&641)\n WHEN U%<&64B: U% = &6D+2*(U%-&648)\n ENDCASE\n IF P% IF P%<&80 THEN\n B% = P%\n IF O%=&5D IF P%<&5 B% += &74\n IF O%=&5D IF P%=&7 B% += &72\n IF O%=&5D IF P%=&D B% += &6E\n IF B%>P% B$=LEFT$(B$,LENB$-3) : O% = L%\n IF U% IF P%>7 IF P%<>&D IF P%<>&13 IF P%<>&29 IF P%<>&2B IF P%<>&2D IF P%<>&2F IF P%<>&6D IF P%<>&6F B% += 2\n IF O% IF O%>7 IF O%<>&D IF O%<>&13 IF O%<>&29 IF O%<>&2B IF O%<>&2D IF O%<>&2F IF O%<>&6D IF O%<>&6F B% += 1\n B$ = LEFT$(LEFT$(B$))+CHR$&EF+CHR$(&BA+(B%>>6))+CHR$(&80+(B%AND&3F))\n ENDIF\n ENDIF\n B$ += CHR$?A%\n NEXT\n = LEFT$(B$)\n","language":"BBC-BASIC"},{"code":"#include <stdio.h>\n#include <stdlib.h>\n#include <locale.h>\n\n/* wchar_t is the standard type for wide chars; what it is internally\n * depends on the compiler.\n */\nwchar_t poker[] = L\"♥♦♣♠\";\nwchar_t four_two[] = L\"\\x56db\\x5341\\x4e8c\";\n\nint main() {\n /* Set the locale to alert C's multibyte output routines */\n if (!setlocale(LC_CTYPE, \"\")) {\n fprintf(stderr, \"Locale failure, check your env vars\\n\");\n return 1;\n }\n\n#ifdef __STDC_ISO_10646__\n /* C99 compilers should understand these */\n printf(\"%lc\\n\", 0x2708); /* ✈ */\n printf(\"%ls\\n\", poker); /* ♥♦♣♠ */\n printf(\"%ls\\n\", four_two); /* 四十二 */\n#else\n /* oh well */\n printf(\"airplane\\n\");\n printf(\"club diamond club spade\\n\");\n printf(\"for ty two\\n\");\n#endif\n return 0;\n}\n","language":"C"},{"code":"(defvar ♥♦♣♠ \"♥♦♣♠\")\n(defun ✈ () \"a plane unicode function\")\n","language":"Common-Lisp"},{"code":"import std.stdio;\nimport std.uni; // standard package for normalization, composition/decomposition, etc..\nimport std.utf; // standard package for decoding/encoding, etc...\n\nvoid main() {\n // normal identifiers are allowed\n int a;\n // unicode characters are allowed for identifers\n int δ;\n\n char c; // 1 to 4 byte unicode character\n wchar w; // 2 or 4 byte unicode character\n dchar d; // 4 byte unicode character\n\n writeln(\"some text\"); // strings by default are UTF8\n writeln(\"some text\"c); // optional suffix for UTF8\n writeln(\"こんにちは\"c); // unicode charcters are just fine (stored in the string type)\n writeln(\"Здравствуйте\"w); // also avaiable are UTF16 string (stored in the wstring type)\n writeln(\"שלום\"d); // and UTF32 strings (stored in the dstring type)\n\n // escape sequences like what is defined in C are also allowed inside of strings and characters.\n}\n","language":"D"},{"code":"public program()\n{\n var 四十二 := \"♥♦♣♠\"; // UTF8 string\n var строка := \"Привет\"w; // UTF16 string\n\n console.writeLine(строка);\n console.writeLine(四十二);\n}\n","language":"Elena"},{"code":"' Define a Unicode string\nDim unicodeString As String\nunicodeString = \"こんにちは, 世界! 🌍\"\n\n' Print the Unicode string\nPrint unicodeString\n\n' Wait for the user to press a key before closing the console\nSleep\n","language":"FreeBASIC"},{"code":" var i int\n var u rune\n for i, u = range \"voilà\" {\n fmt.Println(i, u)\n }\n","language":"Go"},{"code":" w := \"voilà\"\n for i := 0; i < len(w); i++ {\n fmt.Println(i, w[i])\n }\n","language":"Go"},{"code":" '♥♦♣♠'\n♥♦♣♠\n","language":"J"},{"code":" #'♥♦♣♠'\n12\n","language":"J"},{"code":" 7 u:'♥♦♣♠'\n♥♦♣♠\n #7 u:'♥♦♣♠'\n4\n","language":"J"},{"code":" '♥♦♣♠' -: 7 u:'♥♦♣♠'\n0\n","language":"J"},{"code":" 'abcd'-:7 u:'abcd'\n1\n","language":"J"},{"code":" '♥♦♣♠' -:&(7&u:) 7 u:'♥♦♣♠'\n1\n '♥♦♣♠' -:&(8&u:) 7 u:'♥♦♣♠'\n1\n","language":"J"},{"code":"julia> 四十二 = \"voilà\";\njulia> println(四十二)\nvoilà\n","language":"Julia"},{"code":"julia>println(\"\\u2708\")\n✈\n","language":"Julia"},{"code":"// version 1.1.2\n\nfun main(args: Array<String>) {\n val åäö = \"as⃝df̅ ♥♦♣♠ 頰\"\n println(åäö)\n}\n","language":"Kotlin"},{"code":"local(unicode = '♥♦♣♠')\n#unicode -> append('\\u9830')\n#unicode\n'<br />'\n#unicode -> get (2)\n'<br />'\n#unicode -> get (4) -> integer\n","language":"Lasso"},{"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":"> (unicode:characters_to_list encoded 'utf8)\n\"åäö ð\"\n","language":"LFE"},{"code":"put _system.getInstalledCharSets()\n-- [\"big5\", \"cp1026\", \"cp866\", \"ebcdic-cp-us\", \"gb2312\", \"ibm437\", \"ibm737\",\n\"ibm775\", \"ibm850\", \"ibm852\", \"ibm857\", \"ibm861\", \"ibm869\", \"iso-8859-1\",\n\"iso-8859-15\", \"iso-8859-2\", \"iso-8859-4\", \"iso-8859-5\", \"iso-8859-7\",\n\"iso-8859-9\", \"johab\", \"koi8-r\", \"koi8-u\", \"ks_c_5601-1987\", \"macintosh\",\n\"shift_jis\", \"us-ascii\", \"utf-16\", \"utf-16be\", \"utf-7\", \"utf-8\", \"windows-1250\",\n\"windows-1251\", \"windows-1252\", \"windows-1253\", \"windows-1254\", \"windows-1255\",\n\"windows-1256\", \"windows-1257\", \"windows-1258\", \"windows-874\",\n\"x-ebcdic-greekmodern\", \"x-mac-ce\", \"x-mac-cyrillic\", \"x-mac-greek\",\n\"x-mac-icelandic\", \"x-mac-turkish\"]\n","language":"Lingo"},{"code":"10 CLS:DEFINT a-z\n20 ' define German umlauts as in Latin-1\n30 SYMBOL AFTER 196\n40 SYMBOL 196,&66,&18,&3C,&66,&7E,&66,&66,&0\n50 SYMBOL 214,&C6,&0,&7C,&C6,&C6,&C6,&7C,&0\n60 SYMBOL 220,&66,&0,&66,&66,&66,&66,&3C,&0\n70 SYMBOL 228,&6C,&0,&78,&C,&7C,&CC,&76,&0\n80 SYMBOL 246,&66,&0,&0,&3C,&66,&66,&3C,&0\n90 SYMBOL 252,&66,&0,&0,&66,&66,&66,&3E,&0\n100 SYMBOL 223,&38,&6C,&6C,&78,&6C,&78,&60,&0\n110 ' print string\n120 READ h\n130 IF h=0 THEN 180\n140 IF (h AND &X11100000)=&X11000000 THEN uc=(h AND &X11111)*2^6:GOTO 120\n150 IF (h AND &X11000000)=&X10000000 THEN uc=uc+(h AND &X111111):h=uc\n160 PRINT CHR$(h);\n170 GOTO 120\n180 PRINT\n190 END\n200 ' zero-terminated UTF-8 string\n210 DATA &48,&C3,&A4,&6C,&6C,&C3,&B6,&20,&4C,&C3,&BC,&64,&77,&69,&67,&2E,&20,&C3,&84,&C3,&96,&C3,&9C\n220 DATA &20,&C3,&A4,&C3,&B6,&C3,&BC,&20,&56,&69,&65,&6C,&65,&20,&47,&72,&C3,&BC,&C3,&9F,&65,&21,&00\n","language":"Locomotive-Basic"},{"code":"Font \"Arial\"\nMode 32\n' M2000 internal editor can display left to rigtht languages if text is in same line, and same color.\na$=\"لم أجد هذا الكتاب القديم\"\n' We can use console to display text, using proportional spacing\nPrint Part $(4), a$\nPrint\n' We can display right to left using\n' the legend statement which render text at a given\n' graphic point, specify the font type and font size\n' and optional:\n' rotation angle, justification (1 for right,2 for center, 3 for left)\n'quality (0 or non 0, which 0 no antialliasing)\n' letter spacing in twips (not good for arabic language)\nmove 6000,6000\nlegend a$, \"Arial\", 32, pi/4, 2, 0\n' Variables can use any unicode letter.\n' Here we can't display it as in M2000 editor.\n' in the editor we see at the left the variable name\n' and at the right the value\nالقديم=10\nPrint القديم+1=11 ' true\n","language":"M2000-Interpreter"},{"code":"use utf8;\n","language":"Perl"},{"code":"$四十二 = \"voilà\";\nprint \"$四十二\"; # voilà\nprint uc($四十二); # VOILÀ\n","language":"Perl"},{"code":"use charnames qw(greek);\n$x = \"\\N{sigma} \\U\\N{sigma}\";\n$y = \"\\x{2708}\";\nprint scalar reverse(\"$x $y\"); # ✈ Σ σ\n","language":"Perl"},{"code":"print \"Say עִבְרִית\" =~ /(\\p{BidiClass:R})/g; # עברית\n","language":"Perl"},{"code":"open IN, \"<:utf8\", \"file_utf\";\nopen OUT, \">:raw\", \"file_byte\";\n","language":"Perl"},{"code":"(in '(iconv \"-f\" \"ISO-8859-15\" \"file.txt\") (line))\n","language":"PicoLisp"},{"code":"#charset utf8\nvoid main()\n{\n string nånsense = \"\\u03bb \\0344 \\n\";\n string hello = \"你好\";\n string 水果 = \"pineapple\";\n string 真相 = sprintf(\"%s, %s goes really well on pizza\\n\", hello, 水果);\n write( string_to_utf8(真相) );\n write( string_to_utf8(nånsense) );\n}\n","language":"Pike"},{"code":"# `u{x}\n\"I`u{0307}\" # => İ\n","language":"PowerShell"},{"code":"#!/usr/bin/env python\n# -*- coding: latin-1 -*-\n\nu = 'abcdé'\nprint(ord(u[-1]))\n","language":"Python"},{"code":"#lang racket\n\n;; Unicode in strings, using ascii\n\"\\u03bb\" ; -> \"λ\"\n;; and since Racket source code is read in UTF-8, Unicode can be used\n;; directly\n\"λ\" ; -> same\n\n;; The same holds for character constants\n#\\u3bb ; -> #\\λ\n#\\λ ; -> same\n\n;; And of course Unicode can be used in identifiers,\n(define √ sqrt)\n(√ 256) ; -> 16\n;; and in fact the standard language makes use of some of these\n(λ(x) x) ; -> an identity function\n","language":"Racket"},{"code":"sub prefix:<∛> (\\𝐕) { 𝐕 ** ⅓ }\nsay ∛27; # prints 3\n","language":"Raku"},{"code":"see \"Hello, World!\"\n\nfunc ringvm_see cText\n ring_see(\"I can play with the string before displaying it\" + nl)\n ring_see(\"I can convert it :D\" + nl)\n ring_see(\"Original Text: \" + cText + nl)\n if cText = \"Hello, World!\"\n # Convert it from English to Hindi\n cText = \"नमस्ते दुनिया!\"\n ok\n ring_see(\"Converted To (Hindi): \" + cText + nl)\n","language":"Ring"},{"code":"str = \"你好\"\nstr.include?(\"好\") # => true\n","language":"Ruby"},{"code":"def Σ(array)\n array.inject(:+)\nend\n\nputs Σ([4,5,6]) #=>15\n","language":"Ruby"},{"code":"p bad = \"¿como\\u0301 esta\\u0301s?\" # => \"¿comó estás?\"\np bad.unicode_normalized? # => false\np bad.unicode_normalize! # => \"¿comó estás?\"\np bad.unicode_normalized? # => true\n","language":"Ruby"},{"code":"object UTF8 extends App {\n\n def charToInt(s: String) = {\n def charToInt0(c: Char, next: Char): Option[Int] = (c, next) match {\n case _ if (c.isHighSurrogate && next.isLowSurrogate) =>\n Some(java.lang.Character.toCodePoint(c, next))\n case _ if (c.isLowSurrogate) => None\n case _ => Some(c.toInt)\n }\n\n if (s.length > 1) charToInt0(s(0), s(1)) else Some(s.toInt)\n }\n\n def intToChars(n: Int) = java.lang.Character.toChars(n).mkString\n\n println('\\uD869'.isHighSurrogate + \" \" + '\\uDEA5'.isLowSurrogate)\n\n println(charToInt(\"\\uD869\\uDEA5\"))\n\n val b = \"\\uD869\\uDEA5\"\n println(b)\n\n val c = \"\\uD834\\uDD1E\"\n println(c)\n\n val a = \"$abcde¢£¤¥©ÇßçIJijŁłʒλπ•₠₡₢₣₤₥₦₧₨₩₪₫€₭₮₯₰₱₲₳₴₵₵←→⇒∙⌘☺☻ア字文𪚥\".\n map(c => \"%s\\t\\\\u%04X\".format(c, c.toInt)).foreach(println)\n}\n","language":"Scala"},{"code":"# International class; name and street\n class 国際( なまえ, Straße ) {\n\n # Say who am I!\n method 言え {\n say \"I am #{self.なまえ} from #{self.Straße}\";\n }\n}\n\n # all the people of the world!\n var 民族 = [\n 国際( \"高田 Friederich\", \"台湾\" ),\n 国際( \"Smith Σωκράτης\", \"Cantù\" ),\n 国際( \"Stanisław Lec\", \"południow\" ),\n ];\n\n民族.each { |garçon|\n garçon.言え;\n}\n","language":"Sidef"},{"code":"let flag = \"🇵🇷\"\nprint(flag.characters.count)\n// Prints \"1\"\nprint(flag.unicodeScalars.count)\n// Prints \"2\"\nprint(flag.utf16.count)\n// Prints \"4\"\nprint(flag.utf8.count)\n// Prints \"8\"\n\nlet nfc = \"\\u{01FA}\"//Ǻ LATIN CAPITAL LETTER A WITH RING ABOVE AND ACUTE\nlet nfd = \"\\u{0041}\\u{030A}\\u{0301}\"//Latin Capital Letter A + ◌̊ COMBINING RING ABOVE + ◌́ COMBINING ACUTE ACCENT\nlet nfkx = \"\\u{FF21}\\u{030A}\\u{0301}\"//Fullwidth Latin Capital Letter A + ◌̊ COMBINING RING ABOVE + ◌́ COMBINING ACUTE ACCENT\nprint(nfc == nfd) //NFx: true\nprint(nfc == nfkx) //NFKx: false\n","language":"Swift"},{"code":"@{TITLE /[あ-ん一-耙]+/} (@ROMAJI/@ENGLISH)\n@(freeform)\n@(coll)@{STANZA /[^\\n\\x3000 ]+/}@(end)@/.*/\n","language":"TXR"},{"code":"stdout.printf (\"UTF-8 encoded string. Let's go to a café!\");\n","language":"Vala"},{"code":"Module Module1\n\n Sub Main()\n Console.OutputEncoding = Text.Encoding.Unicode\n\n ' normal identifiers allowed\n Dim a = 0\n ' unicode characters allowed\n Dim δ = 1\n\n ' ascii strings\n Console.WriteLine(\"some text\")\n ' unicode strings strings\n Console.WriteLine(\"こんにちは\")\n Console.WriteLine(\"Здравствуйте\")\n Console.WriteLine(\"שלום\")\n ' escape sequences\n Console.WriteLine(vbTab + \"text\" + vbTab + ChrW(&H2708) + \"\"\"blue\")\n Console.ReadLine()\n End Sub\n\nEnd Module\n","language":"Visual-Basic-.NET"},{"code":"let プリント t => io.writeln io.stdout t;\n\nプリント 'これは実験です。';\n","language":"WDTE"},{"code":"import \"./upc\" for Graphemes\n\nvar w = \"voilà\"\nfor (c in w) {\n System.write(\"%(c) \") // prints the 5 Unicode 'characters'.\n}\nSystem.print(\"\\nThe length of %(w) is %(w.count)\")\n\n\nSystem.print(\"\\nIts code-points are:\")\nfor (cp in w.codePoints) {\n System.write(\"%(cp) \") // prints the code-points as numbers\n}\n\nSystem.print(\"\\n\\nIts bytes are: \")\nfor (b in w.bytes) {\n System.write(\"%(b) \") // prints the bytes as numbers\n}\n\nvar zwe = \"👨👩👧\"\nSystem.print(\"\\n\\n%(zwe) has:\")\nSystem.print(\" %(zwe.bytes.count) bytes: %(zwe.bytes.toList.join(\" \"))\")\nSystem.print(\" %(zwe.codePoints.count) code-points: %(zwe.codePoints.toList.join(\" \"))\")\nSystem.print(\" %(Graphemes.clusterCount(zwe)) grapheme\")\n","language":"Wren"}],"string":"[\n {\n \"code\": \"---\\nfrom: http://rosettacode.org/wiki/Unicode_strings\\n\",\n \"language\": \"00-META\"\n },\n {\n \"code\": \"As the world gets smaller each day, internationalization becomes more and more important. For handling multiple languages, [[Unicode]] is your best friend. \\n\\nIt is a very capable and [https://www.youtube.com/watch?v=MijmeoH9LT4 remarquable] tool, but also quite complex compared to older single- and double-byte character encodings. \\n\\nHow well prepared is your programming language for Unicode? \\n\\n\\n;Task:\\nDiscuss and demonstrate its unicode awareness and capabilities. \\n\\n\\nSome suggested topics:\\n:* How easy is it to present Unicode strings in source code? \\n:* Can Unicode literals be written directly, or be part of identifiers/keywords/etc?\\n:* How well can the language communicate with the rest of the world? \\n:* Is it good at input/output with Unicode?\\n:* Is it convenient to manipulate Unicode strings in the language?\\n:* How broad/deep does the language support Unicode? \\n:* What encodings (e.g. UTF-8, UTF-16, etc) can be used? \\n:* Does it support normalization?\\n\\n\\n;Note:\\nThis task is a bit unusual in that it encourages general discussion rather than clever coding.\\n\\n\\n;See also:\\n* [[Unicode variable names]]\\n* [[Terminal control/Display an extended character]]\\n<br><br>\\n\\n\",\n \"language\": \"00-TASK\"\n },\n {\n \"code\": \"#!/usr/local/bin/a68g --script #\\n# -*- coding: utf-8 -*- #\\n\\n# UNICHAR/UNICODE must be printed using REPR to convert to UTF8 #\\n\\nMODE UNICHAR = STRUCT(BITS #31# bits); # assuming bits width >=31 #\\nMODE UNICODE = FLEX[0]UNICHAR;\\n\\nOP INITUNICHAR = (BITS bits)UNICHAR: (UNICHAR out; bits OF out := #ABS# bits; out);\\nOP INITUNICHAR = (CHAR char)UNICHAR: (UNICHAR out; bits OF out := BIN ABS char; out);\\nOP INITBITS = (UNICHAR unichar)BITS: #BIN# bits OF unichar;\\n\\nPROC raise value error = ([]UNION(FORMAT,BITS,STRING)argv )VOID: (\\n putf(stand error, argv); stop\\n);\\n\\nMODE YIELDCHAR = PROC(CHAR)VOID; MODE GENCHAR = PROC(YIELDCHAR)VOID;\\nMODE YIELDUNICHAR = PROC(UNICHAR)VOID; MODE GENUNICHAR = PROC(YIELDUNICHAR)VOID;\\n\\nPRIO DOCONV = 1;\\n\\n# Convert a stream of UNICHAR into a stream of UTFCHAR #\\nOP DOCONV = (GENUNICHAR gen unichar, YIELDCHAR yield)VOID:(\\n BITS non ascii = NOT 2r1111111;\\n# FOR UNICHAR unichar IN # gen unichar( # ) DO ( #\\n## (UNICHAR unichar)VOID: (\\n BITS bits := INITBITS unichar;\\n IF (bits AND non ascii) = 2r0 THEN # ascii #\\n yield(REPR ABS bits)\\n ELSE\\n FLEX[6]CHAR buf := \\\"?\\\"*6; # initialise work around #\\n INT bytes := 0;\\n BITS byte lead bits = 2r10000000;\\n FOR ofs FROM UPB buf BY -1 WHILE\\n bytes +:= 1;\\n buf[ofs]:= REPR ABS (byte lead bits OR bits AND 2r111111);\\n bits := bits SHR 6;\\n # WHILE # bits NE 2r0 DO\\n SKIP\\n OD;\\n BITS first byte lead bits = BIN (ABS(2r1 SHL bytes)-2) SHL (UPB buf - bytes + 1);\\n buf := buf[UPB buf-bytes+1:];\\n buf[1] := REPR ABS(BIN ABS buf[1] OR first byte lead bits);\\n FOR i TO UPB buf DO yield(buf[i]) OD\\n FI\\n# OD # ))\\n);\\n\\n# Convert a STRING into a stream of UNICHAR #\\nOP DOCONV = (STRING string, YIELDUNICHAR yield)VOID: (\\n PROC gen char = (YIELDCHAR yield)VOID:\\n FOR i FROM LWB string TO UPB string DO yield(string[i]) OD;\\n gen char DOCONV yield\\n);\\n\\nCO Prosser/Thompson UTF8 encoding scheme\\nBits Last code point Byte 1 Byte 2 Byte 3 Byte 4 Byte 5 Byte 6\\n 7 U+007F 0xxxxxxx\\n11 U+07FF 110xxxxx 10xxxxxx\\n16 U+FFFF 1110xxxx 10xxxxxx 10xxxxxx\\n21 U+1FFFFF 11110xxx 10xxxxxx 10xxxxxx 10xxxxxx\\n26 U+3FFFFFF 111110xx 10xxxxxx 10xxxxxx 10xxxxxx 10xxxxxx\\n31 U+7FFFFFFF 1111110x 10xxxxxx 10xxxxxx 10xxxxxx 10xxxxxx 10xxxxxx\\nEND CO\\n\\n# Quickly calculate the length of the UTF8 encoded string #\\nPROC upb utf8 = (STRING utf8 string)INT:(\\n INT bytes to go := 0;\\n INT upb := 0;\\n FOR i FROM LWB utf8 string TO UPB utf8 string DO\\n CHAR byte := utf8 string[i];\\n IF bytes to go = 0 THEN # start new utf char #\\n bytes to go :=\\n IF ABS byte <= ABS 2r01111111 THEN 1 # 7 bits #\\n ELIF ABS byte <= ABS 2r11011111 THEN 2 # 11 bits #\\n ELIF ABS byte <= ABS 2r11101111 THEN 3 # 16 bits #\\n ELIF ABS byte <= ABS 2r11110111 THEN 4 # 21 bits #\\n ELIF ABS byte <= ABS 2r11111011 THEN 5 # 26 bits #\\n ELIF ABS byte <= ABS 2r11111101 THEN 6 # 31 bits #\\n ELSE raise value error((\\\"Invalid UTF-8 bytes\\\", BIN ABS byte)); ~ FI\\n FI;\\n bytes to go -:= 1; # skip over trailing bytes #\\n IF bytes to go = 0 THEN upb +:= 1 FI\\n OD;\\n upb\\n);\\n\\n# Convert a stream of CHAR into a stream of UNICHAR #\\nOP DOCONV = (GENCHAR gen char, YIELDUNICHAR yield)VOID: (\\n INT bytes to go := 0;\\n INT lshift;\\n BITS mask, out;\\n\\n # FOR CHAR byte IN # gen char( # ) DO ( #\\n ## (CHAR byte)VOID: (\\n INT bits := ABS byte;\\n IF bytes to go = 0 THEN # start new unichar #\\n bytes to go :=\\n IF bits <= ABS 2r01111111 THEN 1 # 7 bits #\\n ELIF bits <= ABS 2r11011111 THEN 2 # 11 bits #\\n ELIF bits <= ABS 2r11101111 THEN 3 # 16 bits #\\n ELIF bits <= ABS 2r11110111 THEN 4 # 21 bits #\\n ELIF bits <= ABS 2r11111011 THEN 5 # 26 bits #\\n ELIF bits <= ABS 2r11111101 THEN 6 # 31 bits #\\n ELSE raise value error((\\\"Invalid UTF-8 bytes\\\", BIN bits)); ~ FI;\\n IF bytes to go = 1 THEN\\n lshift := 7; mask := 2r1111111\\n ELSE\\n lshift := 7 - bytes to go; mask := BIN(ABS(2r1 SHL lshift)-1)\\n FI;\\n out := mask AND BIN bits;\\n\\n lshift := 6; mask := 2r111111 # subsequently pic 6 bits at a time #\\n ELSE\\n out := (out SHL lshift) OR ( mask AND BIN bits)\\n FI;\\n bytes to go -:= 1;\\n IF bytes to go = 0 THEN yield(INITUNICHAR out) FI\\n # OD # ))\\n);\\n\\n# Convert a string of UNICHAR into a stream of UTFCHAR #\\nOP DOCONV = (UNICODE unicode, YIELDCHAR yield)VOID:(\\n PROC gen unichar = (YIELDUNICHAR yield)VOID:\\n FOR i FROM LWB unicode TO UPB unicode DO yield(unicode[i]) OD;\\n gen unichar DOCONV yield\\n);\\n\\n# Some convenience/shorthand U operators #\\n# Convert a BITS into a UNICODE char #\\nOP U = (BITS bits)UNICHAR:\\n INITUNICHAR bits;\\n\\n# Convert a []BITS into a UNICODE char #\\nOP U = ([]BITS array bits)[]UNICHAR:(\\n [LWB array bits:UPB array bits]UNICHAR out;\\n FOR i FROM LWB array bits TO UPB array bits DO bits OF out[i]:=array bits[i] OD;\\n out\\n);\\n\\n# Convert a CHAR into a UNICODE char #\\nOP U = (CHAR char)UNICHAR:\\n INITUNICHAR char;\\n\\n# Convert a STRING into a UNICODE string #\\nOP U = (STRING utf8 string)UNICODE: (\\n FLEX[upb utf8(utf8 string)]UNICHAR out;\\n INT i := 0;\\n# FOR UNICHAR char IN # utf8 string DOCONV (\\n## (UNICHAR char)VOID:\\n out[i+:=1] := char\\n# OD #);\\n out\\n);\\n\\n# Convert a UNICODE string into a UTF8 STRING #\\nOP REPR = (UNICODE string)STRING: (\\n STRING out;\\n# FOR CHAR char IN # string DOCONV (\\n## (CHAR char)VOID: (\\n out +:= char\\n# OD #));\\n out\\n);\\n\\n# define the most useful OPerators on UNICODE CHARacter arrays #\\n# Note: LWB, UPB and slicing works as per normal #\\n\\nOP + = (UNICODE a,b)UNICODE: (\\n [UPB a + UPB b]UNICHAR out;\\n out[:UPB a]:= a; out[UPB a+1:]:= b;\\n out\\n);\\n\\nOP + = (UNICODE a, UNICHAR b)UNICODE: a+UNICODE(b);\\nOP + = (UNICHAR a, UNICODE b)UNICODE: UNICODE(a)+b;\\nOP + = (UNICHAR a,b)UNICODE: UNICODE(a)+b;\\n\\n# Suffix a character to the end of a UNICODE string #\\nOP +:= = (REF UNICODE a, UNICODE b)VOID: a := a + b;\\nOP +:= = (REF UNICODE a, UNICHAR b)VOID: a := a + b;\\n\\n# Prefix a character to the beginning of a UNICODE string #\\nOP +=: = (UNICODE b, REF UNICODE a)VOID: a := b + a;\\nOP +=: = (UNICHAR b, REF UNICODE a)VOID: a := b + a;\\n\\nOP * = (UNICODE a, INT n)UNICODE: (\\n UNICODE out := a;\\n FOR i FROM 2 TO n DO out +:= a OD;\\n out\\n);\\nOP * = (INT n, UNICODE a)UNICODE: a * n;\\n\\nOP * = (UNICHAR a, INT n)UNICODE: UNICODE(a)*n;\\nOP * = (INT n, UNICHAR a)UNICODE: n*UNICODE(a);\\n\\nOP *:= = (REF UNICODE a, INT b)VOID: a := a * b;\\n\\n# Wirthy Operators #\\nOP LT = (UNICHAR a,b)BOOL: ABS bits OF a LT ABS bits OF b,\\n LE = (UNICHAR a,b)BOOL: ABS bits OF a LE ABS bits OF b,\\n EQ = (UNICHAR a,b)BOOL: ABS bits OF a EQ ABS bits OF b,\\n NE = (UNICHAR a,b)BOOL: ABS bits OF a NE ABS bits OF b,\\n GE = (UNICHAR a,b)BOOL: ABS bits OF a GE ABS bits OF b,\\n GT = (UNICHAR a,b)BOOL: ABS bits OF a GT ABS bits OF b;\\n\\n# ASCII OPerators #\\nOP < = (UNICHAR a,b)BOOL: a LT b,\\n <= = (UNICHAR a,b)BOOL: a LE b,\\n = = (UNICHAR a,b)BOOL: a EQ b,\\n /= = (UNICHAR a,b)BOOL: a NE b,\\n >= = (UNICHAR a,b)BOOL: a GE b,\\n > = (UNICHAR a,b)BOOL: a GT b;\\n\\n# Non ASCII OPerators\\nOP ≤ = (UNICHAR a,b)BOOL: a LE b,\\n ≠ = (UNICHAR a,b)BOOL: a NE b,\\n ≥ = (UNICHAR a,b)BOOL: a GE b;\\n#\\n\\n# Compare two UNICODE strings for equality #\\nPROC unicode cmp = (UNICODE str a,str b)INT: (\\n\\n IF LWB str a > LWB str b THEN exit lt ELIF LWB str a < LWB str b THEN exit gt FI;\\n\\n INT min upb = UPB(UPB str a < UPB str b | str a | str b );\\n\\n FOR i FROM LWB str a TO min upb DO\\n UNICHAR a := str a[i], UNICHAR b := str b[i];\\n IF a < b THEN exit lt ELIF a > b THEN exit gt FI\\n OD;\\n\\n IF UPB str a > UPB str b THEN exit gt ELIF UPB str a < UPB str b THEN exit lt FI;\\n\\n exit eq: 0 EXIT\\n exit lt: -1 EXIT\\n exit gt: 1\\n);\\n\\nOP LT = (UNICODE a,b)BOOL: unicode cmp(a,b)< 0,\\n LE = (UNICODE a,b)BOOL: unicode cmp(a,b)<=0,\\n EQ = (UNICODE a,b)BOOL: unicode cmp(a,b) =0,\\n NE = (UNICODE a,b)BOOL: unicode cmp(a,b)/=0,\\n GE = (UNICODE a,b)BOOL: unicode cmp(a,b)>=0,\\n GT = (UNICODE a,b)BOOL: unicode cmp(a,b)> 0;\\n\\n# ASCII OPerators #\\nOP < = (UNICODE a,b)BOOL: a LT b,\\n <= = (UNICODE a,b)BOOL: a LE b,\\n = = (UNICODE a,b)BOOL: a EQ b,\\n /= = (UNICODE a,b)BOOL: a NE b,\\n >= = (UNICODE a,b)BOOL: a GE b,\\n > = (UNICODE a,b)BOOL: a GT b;\\n\\n# Non ASCII OPerators\\nOP ≤ = (UNICODE a,b)BOOL: a LE b,\\n ≠ = (UNICODE a,b)BOOL: a NE b,\\n ≥ = (UNICODE a,b)BOOL: a GE b;\\n#\\n\\nCOMMENT - Todo: for all UNICODE and UNICHAR\\n Add NonASCII OPerators: ×, ×:=,\\n Add ASCII Operators: &, &:=, &=:\\n Add Wirthy OPerators: PLUSTO, PLUSAB, TIMESAB for UNICODE/UNICHAR,\\n Add UNICODE against UNICHAR comparison OPerators,\\n Add char_in_string and string_in_string PROCedures,\\n Add standard Unicode functions:\\n to_upper_case, to_lower_case, unicode_block, char_count,\\n get_directionality, get_numeric_value, get_type, is_defined,\\n is_digit, is_identifier_ignorable, is_iso_control,\\n is_letter, is_letter_or_digit, is_lower_case, is_mirrored,\\n is_space_char, is_supplementary_code_point, is_title_case,\\n is_unicode_identifier_part, is_unicode_identifier_start,\\n is_upper_case, is_valid_code_point, is_whitespace\\nEND COMMENT\\n\\ntest:(\\n\\n UNICHAR aircraft := U16r 2708;\\n printf(($\\\"aircraft: \\\"$, $\\\"16r\\\"16rdddd$, UNICODE(aircraft), $g$, \\\" => \\\", REPR UNICODE(aircraft), $l$));\\n\\n UNICODE chinese forty two = U16r 56db + U16r 5341 + U16r 4e8c;\\n printf(($\\\"chinese forty two: \\\"$, $g$, REPR chinese forty two, \\\", length string = \\\", UPB chinese forty two, $l$));\\n\\n UNICODE poker = U \\\"A123456789♥♦♣♠JQK\\\";\\n printf(($\\\"poker: \\\"$, $g$, REPR poker, \\\", length string = \\\", UPB poker, $l$));\\n\\n UNICODE selectric := U\\\"×÷≤≥≠¬∨∧⏨→↓↑□⌊⌈⎩⎧○⊥¢\\\";\\n printf(($\\\"selectric: \\\"$, $g$, REPR selectric, $l$));\\n printf(($\\\"selectric*4: \\\"$, $g$, REPR(selectric*4), $l$));\\n\\n print((\\n \\\"1 < 2 is \\\", U\\\"1\\\" < U\\\"2\\\", \\\", \\\",\\n \\\"111 < 11 is \\\",U\\\"111\\\" < U\\\"11\\\", \\\", \\\",\\n \\\"111 < 12 is \\\",U\\\"111\\\" < U\\\"12\\\", \\\", \\\",\\n \\\"♥ < ♦ is \\\", U\\\"♥\\\" < U\\\"♦\\\", \\\", \\\",\\n \\\"♥Q < ♥K is \\\",U\\\"♥Q\\\" < U\\\"♥K\\\", \\\" & \\\",\\n \\\"♥J < ♥K is \\\",U\\\"♥J\\\" < U\\\"♥K\\\", new line\\n ))\\n\\n)\\n\",\n \"language\": \"ALGOL-68\"\n },\n {\n \"code\": \"text: \\\"你好\\\"\\n\\nprint [\\\"text:\\\" text]\\nprint [\\\"length:\\\" size text]\\nprint [\\\"contains string '好'?:\\\" contains? text \\\"好\\\"]\\nprint [\\\"contains character '平'?:\\\" contains? text `平`]\\nprint [\\\"text as ascii:\\\" as.ascii text]\\n\",\n \"language\": \"Arturo\"\n },\n {\n \"code\": \" VDU 23,22,640;512;8,16,16,128+8 : REM Select UTF-8 mode\\n *FONT Times New Roman, 20\\n\\n PRINT \\\"Arabic:\\\"\\n\\n arabic1$ = \\\"هنا مثال يمكنك من الكتابة من اليمين\\\"\\n arabic2$ = \\\"الى اليسار باللغة العربية\\\"\\n\\n VDU 23,16,2;0;0;0;13 : REM Select right-to-left printing\\n PRINT FNarabic(arabic1$) ' FNarabic(arabic2$)\\n VDU 23,16,0;0;0;0;13 : REM Select left-to-right printing\\n\\n PRINT '\\\"Hebrew:\\\"\\n\\n hebrew$ = \\\"זוהי הדגמה של כתיבת טקסט בעברית מימין לשמאל\\\"\\n\\n VDU 23,16,2;0;0;0;13 : REM Select right-to-left printing\\n PRINT hebrew$\\n VDU 23,16,0;0;0;0;13 : REM Select left-to-right printing\\n\\n END\\n\\n REM!Eject\\n DEF FNarabic(A$)\\n LOCAL A%, B%, L%, O%, P%, U%, B$\\n A$ += CHR$0\\n FOR A% = !^A$ TO !^A$+LENA$-1\\n IF ?A%<&80 OR ?A%>=&C0 THEN\\n L% = O% : O% = P% : P% = U%\\n U% = ((?A% AND &3F) << 6) + (A%?1 AND &3F)\\n IF ?A%<&80 U% = 0\\n CASE TRUE OF\\n WHEN U%=&60C OR U%=&61F: U% = 0\\n WHEN U%<&622:\\n WHEN U%<&626: U% = &01+2*(U%-&622)\\n WHEN U%<&628: U% = &09+4*(U%-&626)\\n WHEN U%<&62A: U% = &0F+4*(U%-&628)\\n WHEN U%<&62F: U% = &15+4*(U%-&62A)\\n WHEN U%<&633: U% = &29+2*(U%-&62F)\\n WHEN U%<&63B: U% = &31+4*(U%-&633)\\n WHEN U%<&641:\\n WHEN U%<&648: U% = &51+4*(U%-&641)\\n WHEN U%<&64B: U% = &6D+2*(U%-&648)\\n ENDCASE\\n IF P% IF P%<&80 THEN\\n B% = P%\\n IF O%=&5D IF P%<&5 B% += &74\\n IF O%=&5D IF P%=&7 B% += &72\\n IF O%=&5D IF P%=&D B% += &6E\\n IF B%>P% B$=LEFT$(B$,LENB$-3) : O% = L%\\n IF U% IF P%>7 IF P%<>&D IF P%<>&13 IF P%<>&29 IF P%<>&2B IF P%<>&2D IF P%<>&2F IF P%<>&6D IF P%<>&6F B% += 2\\n IF O% IF O%>7 IF O%<>&D IF O%<>&13 IF O%<>&29 IF O%<>&2B IF O%<>&2D IF O%<>&2F IF O%<>&6D IF O%<>&6F B% += 1\\n B$ = LEFT$(LEFT$(B$))+CHR$&EF+CHR$(&BA+(B%>>6))+CHR$(&80+(B%AND&3F))\\n ENDIF\\n ENDIF\\n B$ += CHR$?A%\\n NEXT\\n = LEFT$(B$)\\n\",\n \"language\": \"BBC-BASIC\"\n },\n {\n \"code\": \"#include <stdio.h>\\n#include <stdlib.h>\\n#include <locale.h>\\n\\n/* wchar_t is the standard type for wide chars; what it is internally\\n * depends on the compiler.\\n */\\nwchar_t poker[] = L\\\"♥♦♣♠\\\";\\nwchar_t four_two[] = L\\\"\\\\x56db\\\\x5341\\\\x4e8c\\\";\\n\\nint main() {\\n /* Set the locale to alert C's multibyte output routines */\\n if (!setlocale(LC_CTYPE, \\\"\\\")) {\\n fprintf(stderr, \\\"Locale failure, check your env vars\\\\n\\\");\\n return 1;\\n }\\n\\n#ifdef __STDC_ISO_10646__\\n /* C99 compilers should understand these */\\n printf(\\\"%lc\\\\n\\\", 0x2708); /* ✈ */\\n printf(\\\"%ls\\\\n\\\", poker); /* ♥♦♣♠ */\\n printf(\\\"%ls\\\\n\\\", four_two); /* 四十二 */\\n#else\\n /* oh well */\\n printf(\\\"airplane\\\\n\\\");\\n printf(\\\"club diamond club spade\\\\n\\\");\\n printf(\\\"for ty two\\\\n\\\");\\n#endif\\n return 0;\\n}\\n\",\n \"language\": \"C\"\n },\n {\n \"code\": \"(defvar ♥♦♣♠ \\\"♥♦♣♠\\\")\\n(defun ✈ () \\\"a plane unicode function\\\")\\n\",\n \"language\": \"Common-Lisp\"\n },\n {\n \"code\": \"import std.stdio;\\nimport std.uni; // standard package for normalization, composition/decomposition, etc..\\nimport std.utf; // standard package for decoding/encoding, etc...\\n\\nvoid main() {\\n // normal identifiers are allowed\\n int a;\\n // unicode characters are allowed for identifers\\n int δ;\\n\\n char c; // 1 to 4 byte unicode character\\n wchar w; // 2 or 4 byte unicode character\\n dchar d; // 4 byte unicode character\\n\\n writeln(\\\"some text\\\"); // strings by default are UTF8\\n writeln(\\\"some text\\\"c); // optional suffix for UTF8\\n writeln(\\\"こんにちは\\\"c); // unicode charcters are just fine (stored in the string type)\\n writeln(\\\"Здравствуйте\\\"w); // also avaiable are UTF16 string (stored in the wstring type)\\n writeln(\\\"שלום\\\"d); // and UTF32 strings (stored in the dstring type)\\n\\n // escape sequences like what is defined in C are also allowed inside of strings and characters.\\n}\\n\",\n \"language\": \"D\"\n },\n {\n \"code\": \"public program()\\n{\\n var 四十二 := \\\"♥♦♣♠\\\"; // UTF8 string\\n var строка := \\\"Привет\\\"w; // UTF16 string\\n\\n console.writeLine(строка);\\n console.writeLine(四十二);\\n}\\n\",\n \"language\": \"Elena\"\n },\n {\n \"code\": \"' Define a Unicode string\\nDim unicodeString As String\\nunicodeString = \\\"こんにちは, 世界! 🌍\\\"\\n\\n' Print the Unicode string\\nPrint unicodeString\\n\\n' Wait for the user to press a key before closing the console\\nSleep\\n\",\n \"language\": \"FreeBASIC\"\n },\n {\n \"code\": \" var i int\\n var u rune\\n for i, u = range \\\"voilà\\\" {\\n fmt.Println(i, u)\\n }\\n\",\n \"language\": \"Go\"\n },\n {\n \"code\": \" w := \\\"voilà\\\"\\n for i := 0; i < len(w); i++ {\\n fmt.Println(i, w[i])\\n }\\n\",\n \"language\": \"Go\"\n },\n {\n \"code\": \" '♥♦♣♠'\\n♥♦♣♠\\n\",\n \"language\": \"J\"\n },\n {\n \"code\": \" #'♥♦♣♠'\\n12\\n\",\n \"language\": \"J\"\n },\n {\n \"code\": \" 7 u:'♥♦♣♠'\\n♥♦♣♠\\n #7 u:'♥♦♣♠'\\n4\\n\",\n \"language\": \"J\"\n },\n {\n \"code\": \" '♥♦♣♠' -: 7 u:'♥♦♣♠'\\n0\\n\",\n \"language\": \"J\"\n },\n {\n \"code\": \" 'abcd'-:7 u:'abcd'\\n1\\n\",\n \"language\": \"J\"\n },\n {\n \"code\": \" '♥♦♣♠' -:&(7&u:) 7 u:'♥♦♣♠'\\n1\\n '♥♦♣♠' -:&(8&u:) 7 u:'♥♦♣♠'\\n1\\n\",\n \"language\": \"J\"\n },\n {\n \"code\": \"julia> 四十二 = \\\"voilà\\\";\\njulia> println(四十二)\\nvoilà\\n\",\n \"language\": \"Julia\"\n },\n {\n \"code\": \"julia>println(\\\"\\\\u2708\\\")\\n✈\\n\",\n \"language\": \"Julia\"\n },\n {\n \"code\": \"// version 1.1.2\\n\\nfun main(args: Array<String>) {\\n val åäö = \\\"as⃝df̅ ♥♦♣♠ 頰\\\"\\n println(åäö)\\n}\\n\",\n \"language\": \"Kotlin\"\n },\n {\n \"code\": \"local(unicode = '♥♦♣♠')\\n#unicode -> append('\\\\u9830')\\n#unicode\\n'<br />'\\n#unicode -> get (2)\\n'<br />'\\n#unicode -> get (4) -> integer\\n\",\n \"language\": \"Lasso\"\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\": \"> (unicode:characters_to_list encoded 'utf8)\\n\\\"åäö ð\\\"\\n\",\n \"language\": \"LFE\"\n },\n {\n \"code\": \"put _system.getInstalledCharSets()\\n-- [\\\"big5\\\", \\\"cp1026\\\", \\\"cp866\\\", \\\"ebcdic-cp-us\\\", \\\"gb2312\\\", \\\"ibm437\\\", \\\"ibm737\\\",\\n\\\"ibm775\\\", \\\"ibm850\\\", \\\"ibm852\\\", \\\"ibm857\\\", \\\"ibm861\\\", \\\"ibm869\\\", \\\"iso-8859-1\\\",\\n\\\"iso-8859-15\\\", \\\"iso-8859-2\\\", \\\"iso-8859-4\\\", \\\"iso-8859-5\\\", \\\"iso-8859-7\\\",\\n\\\"iso-8859-9\\\", \\\"johab\\\", \\\"koi8-r\\\", \\\"koi8-u\\\", \\\"ks_c_5601-1987\\\", \\\"macintosh\\\",\\n\\\"shift_jis\\\", \\\"us-ascii\\\", \\\"utf-16\\\", \\\"utf-16be\\\", \\\"utf-7\\\", \\\"utf-8\\\", \\\"windows-1250\\\",\\n\\\"windows-1251\\\", \\\"windows-1252\\\", \\\"windows-1253\\\", \\\"windows-1254\\\", \\\"windows-1255\\\",\\n\\\"windows-1256\\\", \\\"windows-1257\\\", \\\"windows-1258\\\", \\\"windows-874\\\",\\n\\\"x-ebcdic-greekmodern\\\", \\\"x-mac-ce\\\", \\\"x-mac-cyrillic\\\", \\\"x-mac-greek\\\",\\n\\\"x-mac-icelandic\\\", \\\"x-mac-turkish\\\"]\\n\",\n \"language\": \"Lingo\"\n },\n {\n \"code\": \"10 CLS:DEFINT a-z\\n20 ' define German umlauts as in Latin-1\\n30 SYMBOL AFTER 196\\n40 SYMBOL 196,&66,&18,&3C,&66,&7E,&66,&66,&0\\n50 SYMBOL 214,&C6,&0,&7C,&C6,&C6,&C6,&7C,&0\\n60 SYMBOL 220,&66,&0,&66,&66,&66,&66,&3C,&0\\n70 SYMBOL 228,&6C,&0,&78,&C,&7C,&CC,&76,&0\\n80 SYMBOL 246,&66,&0,&0,&3C,&66,&66,&3C,&0\\n90 SYMBOL 252,&66,&0,&0,&66,&66,&66,&3E,&0\\n100 SYMBOL 223,&38,&6C,&6C,&78,&6C,&78,&60,&0\\n110 ' print string\\n120 READ h\\n130 IF h=0 THEN 180\\n140 IF (h AND &X11100000)=&X11000000 THEN uc=(h AND &X11111)*2^6:GOTO 120\\n150 IF (h AND &X11000000)=&X10000000 THEN uc=uc+(h AND &X111111):h=uc\\n160 PRINT CHR$(h);\\n170 GOTO 120\\n180 PRINT\\n190 END\\n200 ' zero-terminated UTF-8 string\\n210 DATA &48,&C3,&A4,&6C,&6C,&C3,&B6,&20,&4C,&C3,&BC,&64,&77,&69,&67,&2E,&20,&C3,&84,&C3,&96,&C3,&9C\\n220 DATA &20,&C3,&A4,&C3,&B6,&C3,&BC,&20,&56,&69,&65,&6C,&65,&20,&47,&72,&C3,&BC,&C3,&9F,&65,&21,&00\\n\",\n \"language\": \"Locomotive-Basic\"\n },\n {\n \"code\": \"Font \\\"Arial\\\"\\nMode 32\\n' M2000 internal editor can display left to rigtht languages if text is in same line, and same color.\\na$=\\\"لم أجد هذا الكتاب القديم\\\"\\n' We can use console to display text, using proportional spacing\\nPrint Part $(4), a$\\nPrint\\n' We can display right to left using\\n' the legend statement which render text at a given\\n' graphic point, specify the font type and font size\\n' and optional:\\n' rotation angle, justification (1 for right,2 for center, 3 for left)\\n'quality (0 or non 0, which 0 no antialliasing)\\n' letter spacing in twips (not good for arabic language)\\nmove 6000,6000\\nlegend a$, \\\"Arial\\\", 32, pi/4, 2, 0\\n' Variables can use any unicode letter.\\n' Here we can't display it as in M2000 editor.\\n' in the editor we see at the left the variable name\\n' and at the right the value\\nالقديم=10\\nPrint القديم+1=11 ' true\\n\",\n \"language\": \"M2000-Interpreter\"\n },\n {\n \"code\": \"use utf8;\\n\",\n \"language\": \"Perl\"\n },\n {\n \"code\": \"$四十二 = \\\"voilà\\\";\\nprint \\\"$四十二\\\"; # voilà\\nprint uc($四十二); # VOILÀ\\n\",\n \"language\": \"Perl\"\n },\n {\n \"code\": \"use charnames qw(greek);\\n$x = \\\"\\\\N{sigma} \\\\U\\\\N{sigma}\\\";\\n$y = \\\"\\\\x{2708}\\\";\\nprint scalar reverse(\\\"$x $y\\\"); # ✈ Σ σ\\n\",\n \"language\": \"Perl\"\n },\n {\n \"code\": \"print \\\"Say עִבְרִית\\\" =~ /(\\\\p{BidiClass:R})/g; # עברית\\n\",\n \"language\": \"Perl\"\n },\n {\n \"code\": \"open IN, \\\"<:utf8\\\", \\\"file_utf\\\";\\nopen OUT, \\\">:raw\\\", \\\"file_byte\\\";\\n\",\n \"language\": \"Perl\"\n },\n {\n \"code\": \"(in '(iconv \\\"-f\\\" \\\"ISO-8859-15\\\" \\\"file.txt\\\") (line))\\n\",\n \"language\": \"PicoLisp\"\n },\n {\n \"code\": \"#charset utf8\\nvoid main()\\n{\\n string nånsense = \\\"\\\\u03bb \\\\0344 \\\\n\\\";\\n string hello = \\\"你好\\\";\\n string 水果 = \\\"pineapple\\\";\\n string 真相 = sprintf(\\\"%s, %s goes really well on pizza\\\\n\\\", hello, 水果);\\n write( string_to_utf8(真相) );\\n write( string_to_utf8(nånsense) );\\n}\\n\",\n \"language\": \"Pike\"\n },\n {\n \"code\": \"# `u{x}\\n\\\"I`u{0307}\\\" # => İ\\n\",\n \"language\": \"PowerShell\"\n },\n {\n \"code\": \"#!/usr/bin/env python\\n# -*- coding: latin-1 -*-\\n\\nu = 'abcdé'\\nprint(ord(u[-1]))\\n\",\n \"language\": \"Python\"\n },\n {\n \"code\": \"#lang racket\\n\\n;; Unicode in strings, using ascii\\n\\\"\\\\u03bb\\\" ; -> \\\"λ\\\"\\n;; and since Racket source code is read in UTF-8, Unicode can be used\\n;; directly\\n\\\"λ\\\" ; -> same\\n\\n;; The same holds for character constants\\n#\\\\u3bb ; -> #\\\\λ\\n#\\\\λ ; -> same\\n\\n;; And of course Unicode can be used in identifiers,\\n(define √ sqrt)\\n(√ 256) ; -> 16\\n;; and in fact the standard language makes use of some of these\\n(λ(x) x) ; -> an identity function\\n\",\n \"language\": \"Racket\"\n },\n {\n \"code\": \"sub prefix:<∛> (\\\\𝐕) { 𝐕 ** ⅓ }\\nsay ∛27; # prints 3\\n\",\n \"language\": \"Raku\"\n },\n {\n \"code\": \"see \\\"Hello, World!\\\"\\n\\nfunc ringvm_see cText\\n ring_see(\\\"I can play with the string before displaying it\\\" + nl)\\n ring_see(\\\"I can convert it :D\\\" + nl)\\n ring_see(\\\"Original Text: \\\" + cText + nl)\\n if cText = \\\"Hello, World!\\\"\\n # Convert it from English to Hindi\\n cText = \\\"नमस्ते दुनिया!\\\"\\n ok\\n ring_see(\\\"Converted To (Hindi): \\\" + cText + nl)\\n\",\n \"language\": \"Ring\"\n },\n {\n \"code\": \"str = \\\"你好\\\"\\nstr.include?(\\\"好\\\") # => true\\n\",\n \"language\": \"Ruby\"\n },\n {\n \"code\": \"def Σ(array)\\n array.inject(:+)\\nend\\n\\nputs Σ([4,5,6]) #=>15\\n\",\n \"language\": \"Ruby\"\n },\n {\n \"code\": \"p bad = \\\"¿como\\\\u0301 esta\\\\u0301s?\\\" # => \\\"¿comó estás?\\\"\\np bad.unicode_normalized? # => false\\np bad.unicode_normalize! # => \\\"¿comó estás?\\\"\\np bad.unicode_normalized? # => true\\n\",\n \"language\": \"Ruby\"\n },\n {\n \"code\": \"object UTF8 extends App {\\n\\n def charToInt(s: String) = {\\n def charToInt0(c: Char, next: Char): Option[Int] = (c, next) match {\\n case _ if (c.isHighSurrogate && next.isLowSurrogate) =>\\n Some(java.lang.Character.toCodePoint(c, next))\\n case _ if (c.isLowSurrogate) => None\\n case _ => Some(c.toInt)\\n }\\n\\n if (s.length > 1) charToInt0(s(0), s(1)) else Some(s.toInt)\\n }\\n\\n def intToChars(n: Int) = java.lang.Character.toChars(n).mkString\\n\\n println('\\\\uD869'.isHighSurrogate + \\\" \\\" + '\\\\uDEA5'.isLowSurrogate)\\n\\n println(charToInt(\\\"\\\\uD869\\\\uDEA5\\\"))\\n\\n val b = \\\"\\\\uD869\\\\uDEA5\\\"\\n println(b)\\n\\n val c = \\\"\\\\uD834\\\\uDD1E\\\"\\n println(c)\\n\\n val a = \\\"$abcde¢£¤¥©ÇßçIJijŁłʒλπ•₠₡₢₣₤₥₦₧₨₩₪₫€₭₮₯₰₱₲₳₴₵₵←→⇒∙⌘☺☻ア字文𪚥\\\".\\n map(c => \\\"%s\\\\t\\\\\\\\u%04X\\\".format(c, c.toInt)).foreach(println)\\n}\\n\",\n \"language\": \"Scala\"\n },\n {\n \"code\": \"# International class; name and street\\n class 国際( なまえ, Straße ) {\\n\\n # Say who am I!\\n method 言え {\\n say \\\"I am #{self.なまえ} from #{self.Straße}\\\";\\n }\\n}\\n\\n # all the people of the world!\\n var 民族 = [\\n 国際( \\\"高田 Friederich\\\", \\\"台湾\\\" ),\\n 国際( \\\"Smith Σωκράτης\\\", \\\"Cantù\\\" ),\\n 国際( \\\"Stanisław Lec\\\", \\\"południow\\\" ),\\n ];\\n\\n民族.each { |garçon|\\n garçon.言え;\\n}\\n\",\n \"language\": \"Sidef\"\n },\n {\n \"code\": \"let flag = \\\"🇵🇷\\\"\\nprint(flag.characters.count)\\n// Prints \\\"1\\\"\\nprint(flag.unicodeScalars.count)\\n// Prints \\\"2\\\"\\nprint(flag.utf16.count)\\n// Prints \\\"4\\\"\\nprint(flag.utf8.count)\\n// Prints \\\"8\\\"\\n\\nlet nfc = \\\"\\\\u{01FA}\\\"//Ǻ LATIN CAPITAL LETTER A WITH RING ABOVE AND ACUTE\\nlet nfd = \\\"\\\\u{0041}\\\\u{030A}\\\\u{0301}\\\"//Latin Capital Letter A + ◌̊ COMBINING RING ABOVE + ◌́ COMBINING ACUTE ACCENT\\nlet nfkx = \\\"\\\\u{FF21}\\\\u{030A}\\\\u{0301}\\\"//Fullwidth Latin Capital Letter A + ◌̊ COMBINING RING ABOVE + ◌́ COMBINING ACUTE ACCENT\\nprint(nfc == nfd) //NFx: true\\nprint(nfc == nfkx) //NFKx: false\\n\",\n \"language\": \"Swift\"\n },\n {\n \"code\": \"@{TITLE /[あ-ん一-耙]+/} (@ROMAJI/@ENGLISH)\\n@(freeform)\\n@(coll)@{STANZA /[^\\\\n\\\\x3000 ]+/}@(end)@/.*/\\n\",\n \"language\": \"TXR\"\n },\n {\n \"code\": \"stdout.printf (\\\"UTF-8 encoded string. Let's go to a café!\\\");\\n\",\n \"language\": \"Vala\"\n },\n {\n \"code\": \"Module Module1\\n\\n Sub Main()\\n Console.OutputEncoding = Text.Encoding.Unicode\\n\\n ' normal identifiers allowed\\n Dim a = 0\\n ' unicode characters allowed\\n Dim δ = 1\\n\\n ' ascii strings\\n Console.WriteLine(\\\"some text\\\")\\n ' unicode strings strings\\n Console.WriteLine(\\\"こんにちは\\\")\\n Console.WriteLine(\\\"Здравствуйте\\\")\\n Console.WriteLine(\\\"שלום\\\")\\n ' escape sequences\\n Console.WriteLine(vbTab + \\\"text\\\" + vbTab + ChrW(&H2708) + \\\"\\\"\\\"blue\\\")\\n Console.ReadLine()\\n End Sub\\n\\nEnd Module\\n\",\n \"language\": \"Visual-Basic-.NET\"\n },\n {\n \"code\": \"let プリント t => io.writeln io.stdout t;\\n\\nプリント 'これは実験です。';\\n\",\n \"language\": \"WDTE\"\n },\n {\n \"code\": \"import \\\"./upc\\\" for Graphemes\\n\\nvar w = \\\"voilà\\\"\\nfor (c in w) {\\n System.write(\\\"%(c) \\\") // prints the 5 Unicode 'characters'.\\n}\\nSystem.print(\\\"\\\\nThe length of %(w) is %(w.count)\\\")\\n\\n\\nSystem.print(\\\"\\\\nIts code-points are:\\\")\\nfor (cp in w.codePoints) {\\n System.write(\\\"%(cp) \\\") // prints the code-points as numbers\\n}\\n\\nSystem.print(\\\"\\\\n\\\\nIts bytes are: \\\")\\nfor (b in w.bytes) {\\n System.write(\\\"%(b) \\\") // prints the bytes as numbers\\n}\\n\\nvar zwe = \\\"👨👩👧\\\"\\nSystem.print(\\\"\\\\n\\\\n%(zwe) has:\\\")\\nSystem.print(\\\" %(zwe.bytes.count) bytes: %(zwe.bytes.toList.join(\\\" \\\"))\\\")\\nSystem.print(\\\" %(zwe.codePoints.count) code-points: %(zwe.codePoints.toList.join(\\\" \\\"))\\\")\\nSystem.print(\\\" %(Graphemes.clusterCount(zwe)) grapheme\\\")\\n\",\n \"language\": \"Wren\"\n }\n]","isConversational":false},"task_name":{"kind":"string","value":"Unicode-strings"}}},{"rowIdx":1783,"cells":{"solutions":{"kind":"list like","value":[{"code":"---\nfrom: http://rosettacode.org/wiki/Unicode_variable_names\nnote: Unicode\n","language":"00-META"},{"code":";Task:\n# Describe, and give a pointer to documentation on your languages use of characters ''beyond'' those of the ASCII character set in the naming of variables.\n# Show how to:\n:* Set a variable with a name including the 'Δ', (delta ''character''), to 1 \n:* Increment it\n:* Print its value.\n\n\n;Related task: \n* [[Case-sensitivity of identifiers]]\n<br><br>\n\n","language":"00-TASK"},{"code":"V Δx = 1\nΔx++\nprint(Δx)\n","language":"11l"},{"code":"1 var, Δ\n\nΔ @ n:1+ Δ !\n\nΔ @ . cr\n\n\\ unicode silliness\n\n: 念 ' G:@ w:exec ;\n: 店 ' G:! w:exec ;\n: ਵਾਧਾ ' n:1+ w:exec ;\n: الوداع ' G:bye w:exec ;\n: キャリッジリターン ' G:cr w:exec ;\n: प्रिंट ' G:. w:exec ;\n\nΔ 念 ਵਾਧਾ Δ 店\n\nΔ 念 प्रिंट キャリッジリターン\nالوداع\n","language":"8th"},{"code":"(let ((Δ 1))\n (1+ Δ))\n","language":"ACL2"},{"code":"with Ada.Text_IO;\nprocedure main is\n Δ : Integer;\nbegin\n Δ := 41;\n Δ := Δ + 1;\n Ada.Text_IO.Put_Line (Δ'Img);\nend main;\n","language":"Ada"},{"code":"set |Δ| to 1\nset |Δ| to |Δ| + 1\nreturn |Δ|\n","language":"AppleScript"},{"code":"2\n","language":"AppleScript"},{"code":"\"Δ\": 1\n\"Δ\": inc var \"Δ\"\n\nprint [\"Delta =>\" var \"Δ\"]\n","language":"Arturo"},{"code":"Δ = 1\nΔ++\nMsgBox, % Δ\n","language":"AutoHotkey"},{"code":"PRAGMA COMPILER clang\n\nDECLARE Δ TYPE int\n\nΔ = 1\n\nINCR Δ\n\nPRINT Δ\n","language":"BaCon"},{"code":"( (Δ=1)\n& 1+!Δ:?Δ\n& out$(\"Δ:\" !Δ)\n);\n","language":"Bracmat"},{"code":"// Works for clang and GCC 10+\n#include<stdio.h>\n\nint main() {\n int Δ = 1; // if unsupported, use \\u0394\n Δ++;\n printf(\"%d\",Δ);\n return 0;\n}\n","language":"C"},{"code":"#include <cstdint>\n#include <iostream>\n#include <string>\n\nint main() {\n\tuint32_t Δ = 1;\n\tdouble π = 3.14159;\n\tstd::string 你好 = \"Hello\";\n\tΔ++;\n\tstd::cout << Δ << \" :: \" << π << \" :: \" << 你好 << std::endl;\n}\n","language":"C++"},{"code":"class Program\n{\n static void Main()\n {\n var Δ = 1;\n Δ++;\n System.Console.WriteLine(Δ);\n }\n}\n","language":"C-sharp"},{"code":"(let [Δ 1]\n (inc Δ))\n","language":"Clojure"},{"code":"(let ((Δ 1))\n (incf Δ))\n","language":"Common-Lisp"},{"code":"Δ = 1\nΔ += 1\nputs Δ\n","language":"Crystal"},{"code":"import std.stdio;\n\nvoid main() {\n auto Δ = 1;\n Δ++;\n writeln(Δ);\n}\n","language":"D"},{"code":"(* Compiled with Delphi XE *)\nprogram UnicodeVariableName;\n\n{$APPTYPE CONSOLE}\n\nuses\n SysUtils;\n\nvar\n Δ: Integer;\n\nbegin\n Δ:= 1;\n Inc(Δ);\n Writeln(Δ);\n Readln;\nend.\n","language":"Delphi"},{"code":"var Δ : Integer;\n\nΔ := 1;\nInc(Δ);\nPrintLn(Δ);\n","language":"DWScript"},{"code":"(define ∆-🍒 1) → ∆-🍒\n(set! ∆-🍒 (1+ ∆-🍒)) → 2\n(printf \"🔦 Look at ∆-🍒 : %d\" ∆-🍒)\n🔦 Look at ∆-🍒 : 2\n","language":"EchoLisp"},{"code":"public program()\n{\n var Δ := 1;\n Δ := Δ + 1;\n\n console.writeLine(Δ)\n}\n","language":"Elena"},{"code":"(setq Δ 1)\n(setq Δ (1+ Δ))\n(message \"Δ is %d\" Δ)\n","language":"Emacs-Lisp"},{"code":"let mutable Δ = 1\nΔ <- Δ + 1\nprintfn \"%d\" Δ\n","language":"F-Sharp"},{"code":"USE: locals\n[let\n 1 :> Δ!\n Δ 1 + Δ!\n Δ .\n]\n","language":"Factor"},{"code":"variable ∆\n1 ∆ !\n1 ∆ +!\n∆ @ .\n","language":"Forth"},{"code":"'FB 1.05.0 Win64\n\nVar delta = 1\ndelta += 1\nPrint delta '' 2\nSleep\n","language":"FreeBASIC"},{"code":"Δ = 1\nΔ = Δ + 1\nprintln[Δ]\n","language":"Frink"},{"code":"package main\n\nimport \"fmt\"\n\nfunc main() {\n Δ := 1\n Δ++\n fmt.Println(Δ)\n}\n","language":"Go"},{"code":"main = print ψ\n where δΔ = 1\n ψ = δΔ + 1\n","language":"Haskell"},{"code":"(let Δ😄 1)\n(inc Δ😄)\n","language":"Haskell"},{"code":"int Δ = 1;\ndouble π = 3.141592;\nString 你好 = \"hello\";\nΔ++;\nSystem.out.println(Δ);\n","language":"Java"},{"code":"var ᾩ = \"something\";\nvar ĦĔĽĻŎ = \"hello\";\nvar 〱〱〱〱 = \"too less\";\nvar जावास्क्रिप्ट = \"javascript\"; // ok that's JavaScript in hindi\nvar KingGeorgeⅦ = \"Roman numerals.\";\n\nconsole.log([ᾩ, ĦĔĽĻŎ, 〱〱〱〱, जावास्क्रिप्ट, KingGeorgeⅦ])\n","language":"JavaScript"},{"code":"{ \"Δ\": 1 } | .[\"Δ\"]\n","language":"Jq"},{"code":".[\"Δ\"]\n","language":"Jq"},{"code":".\"Δ\"\n","language":"Jq"},{"code":"{ \"Δ\": 1 } # initialization\n| .[\"Δ\"] += 1 # increment by 1\n| .[\"Δ\"] # emit the incremented value\n","language":"Jq"},{"code":"julia> Δ = 1 ; Δ += 1 ; Δ\n2\n","language":"Julia"},{"code":"julia> Δ̂₂ = Δ^2\n4\n","language":"Julia"},{"code":"fun main(args: Array<String>) {\n var Δ = 1\n Δ++\n print(Δ)\n}\n","language":"Kotlin"},{"code":"var Δ = 1\nΔ += 1\nprint(Δ.to_s())\n","language":"Lily"},{"code":"Δ = 1\nΔ = Δ + 1\nput Δ\n-- 2\n","language":"Lingo"},{"code":"put 1 into Δ\nadd 1 to Δ\nput Δ\n-- result is 2\n","language":"LiveCode"},{"code":"I HAS A SRS \"Δ\" ITZ 1\nSRS \"Δ\" R SUM OF SRS \":(394)\" AN 1\nVISIBLE SRS \":[GREEK CAPITAL LETTER DELTA]\"\n","language":"LOLCODE"},{"code":"∆ = 1\n∆ = ∆ + 1\nprint(∆)\n","language":"Lua"},{"code":"Δ=1\nΔ++\nPrint Δ\nᾩ=3\nPrint ᾩ**2=ᾩ^2, ᾩ^2-1=8\nΤύπωσε ᾩ**2=ᾩ^2, ᾩ^2-1=8 ' this is Print statement too\nPrint ᾡ=3\nजावास्क्रिप्ट=100\nजावास्क्रिप्ट++\nPrint \"जावास्क्रिप्ट=\";जावास्क्रिप्ट\nĦĔĽĻŎ$=\"hello\"\nPrint ĦĔĽĻŎ$+ħĕľļŏ$=\"hellohello\"\n〱〱〱〱$=\"too less\"\nPrint Left$(〱〱〱〱$, 3)=\"too\"\n\nc͓͈̃͂̋̈̆̽h̥̪͕ͣ͛̊aͨͣ̍͞ơ̱͔̖͖̑̽ș̻̥ͬ̃̈ͩ =100 : Print \"c͓͈̃͂̋̈̆̽h̥̪͕ͣ͛̊aͨͣ̍͞ơ̱͔̖͖̑̽ș̻̥ͬ̃̈ͩ =\"; c͓͈̃͂̋̈̆̽h̥̪͕ͣ͛̊aͨͣ̍͞ơ̱͔̖͖̑̽ș̻̥ͬ̃̈ͩ\n","language":"M2000-Interpreter"},{"code":"Δ = 1;\nΔ++;\nPrint[Δ]\n","language":"Mathematica"},{"code":"using System.Console;\n\nmodule UnicodeVar\n{\n Main() : void\n {\n mutable Δ = 1;\n Δ++;\n WriteLine($\"Δ = $Δ\");\n }\n}\n","language":"Nemerle"},{"code":"/* NetRexx */\noptions replace format comments java crossref symbols nobinary\n\nupperΔ = 1\nΔupper = upperΔ\nlowerδ = 2\nδlower = lowerδ\n\nsay upperΔ '+' Δupper '= \\-'\nupperΔ = upperΔ + Δupper\nsay upperΔ\n\nsay lowerδ '+' δlower '= \\-'\nlowerδ = lowerδ + δlower\nsay lowerδ\nsay\n\n-- Unicode works with the NetRexx built-in functions\nΥππερ = '\\u0391'.sequence('\\u03a1') || '\\u03a3'.sequence('\\u03a9') -- ΑΒΓΔΕΖΗΘΙΚΛΜΝΞΟΠΡΣΤΥΦΧΨΩ\nΛοωερ = '\\u03b1'.sequence('\\u03c1') || '\\u03c3'.sequence('\\u03c9') -- αβγδεζηθικλμνξοπρστυφχψω\nsay Υππερ'.Lower =' Υππερ.lower()\nsay Λοωερ'.Upper =' Λοωερ.upper()\nsay\n\n-- Note: Even with unicode characters NetRexx variables are case-insensitive\nnumeric digits 12\nδ = 20.0\nπ = Math.PI\nθ = Π * Δ\nσ = Θ ** 2 / (Π * 4) -- == Π * (Δ / 2) ** 2\nsay 'Π =' π', diameter =' δ', circumference =' Θ', area =' Σ\n\nreturn\n","language":"NetRexx"},{"code":"var Δ = 1\ninc Δ\necho Δ\n","language":"Nim"},{"code":"class Test {\n function : Main(args : String[]) ~ Nil {\n Δ := 1;\n π := 3.141592;\n 你好 := \"hello\";\n Δ += 1;\n Δ->PrintLine();\n }\n}\n","language":"Objeck"},{"code":"(define Δ 1)\n(define Δ (+ Δ 1))\n(print Δ)\n","language":"Ol"},{"code":"<@ LETVARLIT>Δ|1</@>\n<@ ACTICRVAR>Δ</@>\n<@ SAYVAR>Δ</@>\n","language":"Peloton"},{"code":"<@ LETVARLIT>三角洲|1</@>\n<@ ACTICRVAR>三角洲</@>\n<@ SAYVAR>三角洲</@>\n","language":"Peloton"},{"code":"use utf8;\n\nmy $Δ = 1;\n$Δ++;\nprint $Δ, \"\\n\";\n","language":"Perl"},{"code":"use utf8;\n\nBEGIN {\n my $val;\n sub Δ () : lvalue {\n $val;\n }\n}\n\nΔ = 1;\nΔ++;\nprint Δ, \"\\n\";\n","language":"Perl"},{"code":"use utf8;\nuse v5.10;\n\nsub Δ () : lvalue {\n state $val;\n}\n\nΔ = 1;\nΔ++;\nsay Δ;\n","language":"Perl"},{"code":"(phixonline)-->\n <span style=\"color: #008080;\">with</span> <span style=\"color: #008080;\">javascript_semantics</span>\n <span style=\"color: #004080;\">integer</span> <span style=\"color: #000000;\">Δ</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">1</span>\n <span style=\"color: #000000;\">Δ</span> <span style=\"color: #0000FF;\">+=</span> <span style=\"color: #000000;\">1</span>\n <span style=\"color: #0000FF;\">?</span><span style=\"color: #000000;\">Δ</span>\n<!--\n","language":"Phix"},{"code":"<?php\n$Δ = 1;\n++$Δ;\necho $Δ;\n","language":"PHP"},{"code":": (setq Δ 1)\n-> 1\n: Δ\n-> 1\n: (inc 'Δ)\n-> 2\n: Δ\n-> 2\n","language":"PicoLisp"},{"code":"#charset utf8\nvoid main()\n{\n int Δ = 1;\n Δ++;\n write( Δ +\"\\n\");\n}\n","language":"Pike"},{"code":"$Δ = 2\n$π = 3.14\n$π*$Δ\n","language":"PowerShell"},{"code":"% Unicode in predicate names:\n是. % be: means, approximately, \"True\".\n不是 :- \\+ 是. % not be: means, approximately, \"False\". Defined as not 是.\n\n% Unicode in variable names:\ntest(Garçon, Δ) :-\n Garçon = boy,\n Δ = delta.\n\n% Call test2(1, Result) to have 2 assigned to Result.\ntest2(Δ, R) :- R is Δ + 1.\n","language":"Prolog"},{"code":"?- 是.\ntrue.\n\n?- 不是.\nfalse.\n\n?- test(X,Y).\nX = boy,\nY = delta.\n\n?- test2(1,Result).\nResult = 2.\n","language":"Prolog"},{"code":">>> Δx = 1\n>>> Δx += 1\n>>> print(Δx)\n2\n>>>\n","language":"Python"},{"code":"f <- function(`∆`=1) `∆`+1\n\nf(1)\n","language":"R"},{"code":"#lang racket\n\n;; Racket can use Unicode in identifier names\n(define √ sqrt)\n(√ 256) ; -> 16\n;; and in fact the standard language makes use of some of these\n(λ(x) x) ; -> an identity function\n\n;; The required binding:\n(define Δ 1)\n(set! Δ (add1 Δ))\n(printf \"Δ = ~s\\n\" Δ) ; prints \"Δ = 2\"\n","language":"Racket"},{"code":"my $Δ = 1;\n$Δ++;\nsay $Δ;\n","language":"Raku"},{"code":"my @ᐁ = (0, 45, 60, 90);\n\nsub π { pi };\n\nsub postfix:<°>($degrees) { $degrees * π / 180 };\n\nfor @ᐁ -> $ಠ_ಠ { say sin $ಠ_ಠ° };\n\nsub c͓͈̃͂̋̈̆̽h̥̪͕ͣ͛̊aͨͣ̍͞ơ̱͔̖͖̑̽ș̻̥ͬ̃̈ͩ { 'HE COMES' }\n","language":"Raku"},{"code":"'Δ var\n#1 !Δ\n@Δ n:put\n&Δ v:inc\n@Δ n:put\n","language":"Retro"},{"code":"/*REXX program (using the R4 REXX interpreter) which uses a Greek delta char).*/\n'chcp' 1253 \"> NUL\" /*ensure we're using correct code page.*/\nΔ=1 /*define delta (variable name Δ) to 1*/\nΔ=Δ+1 /*bump the delta REXX variable by unity*/\nsay 'Δ=' Δ /*stick a fork in it, we're all done. */\n","language":"REXX"},{"code":"# Project : Unicode variable names\n\nΔ = \"Ring Programming Language\"\nsee Δ + nl\n","language":"Ring"},{"code":"Δ = 1\nΔ += 1\nputs Δ # => 2\n","language":"Ruby"},{"code":"#![feature(non_ascii_idents)]\n#![allow(non_snake_case)]\n\nfn main() {\n let mut Δ: i32 = 1;\n Δ += 1;\n println!(\"{}\", Δ);\n}\n","language":"Rust"},{"code":"define ∆increment(∆ref) {\n @∆ref++;\n}\nvariable foo∆bar = 1;\nfoo∆bar++;\nvariable ∆bar = 1;\n∆bar++;\n∆increment(&∆bar);\n% foo∆bar should be 2 and ∆bar should be 3.\nprint(foo∆bar);\nprint(∆bar);\n","language":"S-lang"},{"code":"var Δ = 1\nval π = 3.141592\nval 你好 = \"hello\"\nΔ += 1\nprintln(Δ)\n","language":"Scala"},{"code":"put 1 into Δ\nadd 1 to Δ\nput Δ\n","language":"SenseTalk"},{"code":"var Δ = 1;\nΔ += 1;\nsay Δ;\n","language":"Sidef"},{"code":"sca Δ=10\nsca Δ=Δ+1\ndi Δ\n\nlocal Δ=20\nlocal ++Δ\ndi `Δ'\n\nmata\nΔ=30\nΔ++\nΔ\nend\n","language":"Stata"},{"code":"var Δ = 1\nlet π = 3.141592\nlet 你好 = \"hello\"\nΔ++\nprintln(Δ)\n","language":"Swift"},{"code":"set Δx 1\nincr Δx\nputs [set Δx]\nputs ${Δx}\n","language":"Tcl"},{"code":"Δ=1\nΔ=`expr $Δ + 1`\necho $Δ\n","language":"UNIX-Shell"},{"code":"Sub Main()\n Dim Δ As Integer\n Δ=1\n Δ=Δ+1\n Debug.Print Δ\nEnd Sub\n","language":"Visual-Basic"},{"code":"var a = 3\nvar b = 2\nvar delta = a - b // ok\nvar Δ = delta // not ok\n","language":"Wren"},{"code":"import \"./trait\" for Var\n\nVar[\"Δ\"] = 1\nVar[\"Δ\"] = Var[\"Δ\"] + 1\nSystem.print(Var[\"Δ\"])\n","language":"Wren"},{"code":"const std = @import(\"std\");\n\npub fn main() void {\n var @\"Δ\": i32 = 1;\n @\"Δ\" += 1;\n std.debug.print(\"{d}\\n\", .{@\"Δ\"});\n}\n","language":"Zig"},{"code":"delta:=\"\\U0394;\"; // UTF-8 delta\nklass:=\t// embryo(names, numFcns, numClasses, numParents, ...)\n self.embryo(L(\"\",\"\",delta),0,0,0).cook();\nklass.setVar(0,Ref(1)); // indirect set since delta not valid var name\nklass.vars.println();\n\ndv:=klass.setVar(0); // which actually gets the var, go figure\ndv.inc();\t // ie (*ptr)++\ndv.value.println();\n","language":"Zkl"}],"string":"[\n {\n \"code\": \"---\\nfrom: http://rosettacode.org/wiki/Unicode_variable_names\\nnote: Unicode\\n\",\n \"language\": \"00-META\"\n },\n {\n \"code\": \";Task:\\n# Describe, and give a pointer to documentation on your languages use of characters ''beyond'' those of the ASCII character set in the naming of variables.\\n# Show how to:\\n:* Set a variable with a name including the 'Δ', (delta ''character''), to 1 \\n:* Increment it\\n:* Print its value.\\n\\n\\n;Related task: \\n* [[Case-sensitivity of identifiers]]\\n<br><br>\\n\\n\",\n \"language\": \"00-TASK\"\n },\n {\n \"code\": \"V Δx = 1\\nΔx++\\nprint(Δx)\\n\",\n \"language\": \"11l\"\n },\n {\n \"code\": \"1 var, Δ\\n\\nΔ @ n:1+ Δ !\\n\\nΔ @ . cr\\n\\n\\\\ unicode silliness\\n\\n: 念 ' G:@ w:exec ;\\n: 店 ' G:! w:exec ;\\n: ਵਾਧਾ ' n:1+ w:exec ;\\n: الوداع ' G:bye w:exec ;\\n: キャリッジリターン ' G:cr w:exec ;\\n: प्रिंट ' G:. w:exec ;\\n\\nΔ 念 ਵਾਧਾ Δ 店\\n\\nΔ 念 प्रिंट キャリッジリターン\\nالوداع\\n\",\n \"language\": \"8th\"\n },\n {\n \"code\": \"(let ((Δ 1))\\n (1+ Δ))\\n\",\n \"language\": \"ACL2\"\n },\n {\n \"code\": \"with Ada.Text_IO;\\nprocedure main is\\n Δ : Integer;\\nbegin\\n Δ := 41;\\n Δ := Δ + 1;\\n Ada.Text_IO.Put_Line (Δ'Img);\\nend main;\\n\",\n \"language\": \"Ada\"\n },\n {\n \"code\": \"set |Δ| to 1\\nset |Δ| to |Δ| + 1\\nreturn |Δ|\\n\",\n \"language\": \"AppleScript\"\n },\n {\n \"code\": \"2\\n\",\n \"language\": \"AppleScript\"\n },\n {\n \"code\": \"\\\"Δ\\\": 1\\n\\\"Δ\\\": inc var \\\"Δ\\\"\\n\\nprint [\\\"Delta =>\\\" var \\\"Δ\\\"]\\n\",\n \"language\": \"Arturo\"\n },\n {\n \"code\": \"Δ = 1\\nΔ++\\nMsgBox, % Δ\\n\",\n \"language\": \"AutoHotkey\"\n },\n {\n \"code\": \"PRAGMA COMPILER clang\\n\\nDECLARE Δ TYPE int\\n\\nΔ = 1\\n\\nINCR Δ\\n\\nPRINT Δ\\n\",\n \"language\": \"BaCon\"\n },\n {\n \"code\": \"( (Δ=1)\\n& 1+!Δ:?Δ\\n& out$(\\\"Δ:\\\" !Δ)\\n);\\n\",\n \"language\": \"Bracmat\"\n },\n {\n \"code\": \"// Works for clang and GCC 10+\\n#include<stdio.h>\\n\\nint main() {\\n int Δ = 1; // if unsupported, use \\\\u0394\\n Δ++;\\n printf(\\\"%d\\\",Δ);\\n return 0;\\n}\\n\",\n \"language\": \"C\"\n },\n {\n \"code\": \"#include <cstdint>\\n#include <iostream>\\n#include <string>\\n\\nint main() {\\n\\tuint32_t Δ = 1;\\n\\tdouble π = 3.14159;\\n\\tstd::string 你好 = \\\"Hello\\\";\\n\\tΔ++;\\n\\tstd::cout << Δ << \\\" :: \\\" << π << \\\" :: \\\" << 你好 << std::endl;\\n}\\n\",\n \"language\": \"C++\"\n },\n {\n \"code\": \"class Program\\n{\\n static void Main()\\n {\\n var Δ = 1;\\n Δ++;\\n System.Console.WriteLine(Δ);\\n }\\n}\\n\",\n \"language\": \"C-sharp\"\n },\n {\n \"code\": \"(let [Δ 1]\\n (inc Δ))\\n\",\n \"language\": \"Clojure\"\n },\n {\n \"code\": \"(let ((Δ 1))\\n (incf Δ))\\n\",\n \"language\": \"Common-Lisp\"\n },\n {\n \"code\": \"Δ = 1\\nΔ += 1\\nputs Δ\\n\",\n \"language\": \"Crystal\"\n },\n {\n \"code\": \"import std.stdio;\\n\\nvoid main() {\\n auto Δ = 1;\\n Δ++;\\n writeln(Δ);\\n}\\n\",\n \"language\": \"D\"\n },\n {\n \"code\": \"(* Compiled with Delphi XE *)\\nprogram UnicodeVariableName;\\n\\n{$APPTYPE CONSOLE}\\n\\nuses\\n SysUtils;\\n\\nvar\\n Δ: Integer;\\n\\nbegin\\n Δ:= 1;\\n Inc(Δ);\\n Writeln(Δ);\\n Readln;\\nend.\\n\",\n \"language\": \"Delphi\"\n },\n {\n \"code\": \"var Δ : Integer;\\n\\nΔ := 1;\\nInc(Δ);\\nPrintLn(Δ);\\n\",\n \"language\": \"DWScript\"\n },\n {\n \"code\": \"(define ∆-🍒 1) → ∆-🍒\\n(set! ∆-🍒 (1+ ∆-🍒)) → 2\\n(printf \\\"🔦 Look at ∆-🍒 : %d\\\" ∆-🍒)\\n🔦 Look at ∆-🍒 : 2\\n\",\n \"language\": \"EchoLisp\"\n },\n {\n \"code\": \"public program()\\n{\\n var Δ := 1;\\n Δ := Δ + 1;\\n\\n console.writeLine(Δ)\\n}\\n\",\n \"language\": \"Elena\"\n },\n {\n \"code\": \"(setq Δ 1)\\n(setq Δ (1+ Δ))\\n(message \\\"Δ is %d\\\" Δ)\\n\",\n \"language\": \"Emacs-Lisp\"\n },\n {\n \"code\": \"let mutable Δ = 1\\nΔ <- Δ + 1\\nprintfn \\\"%d\\\" Δ\\n\",\n \"language\": \"F-Sharp\"\n },\n {\n \"code\": \"USE: locals\\n[let\\n 1 :> Δ!\\n Δ 1 + Δ!\\n Δ .\\n]\\n\",\n \"language\": \"Factor\"\n },\n {\n \"code\": \"variable ∆\\n1 ∆ !\\n1 ∆ +!\\n∆ @ .\\n\",\n \"language\": \"Forth\"\n },\n {\n \"code\": \"'FB 1.05.0 Win64\\n\\nVar delta = 1\\ndelta += 1\\nPrint delta '' 2\\nSleep\\n\",\n \"language\": \"FreeBASIC\"\n },\n {\n \"code\": \"Δ = 1\\nΔ = Δ + 1\\nprintln[Δ]\\n\",\n \"language\": \"Frink\"\n },\n {\n \"code\": \"package main\\n\\nimport \\\"fmt\\\"\\n\\nfunc main() {\\n Δ := 1\\n Δ++\\n fmt.Println(Δ)\\n}\\n\",\n \"language\": \"Go\"\n },\n {\n \"code\": \"main = print ψ\\n where δΔ = 1\\n ψ = δΔ + 1\\n\",\n \"language\": \"Haskell\"\n },\n {\n \"code\": \"(let Δ😄 1)\\n(inc Δ😄)\\n\",\n \"language\": \"Haskell\"\n },\n {\n \"code\": \"int Δ = 1;\\ndouble π = 3.141592;\\nString 你好 = \\\"hello\\\";\\nΔ++;\\nSystem.out.println(Δ);\\n\",\n \"language\": \"Java\"\n },\n {\n \"code\": \"var ᾩ = \\\"something\\\";\\nvar ĦĔĽĻŎ = \\\"hello\\\";\\nvar 〱〱〱〱 = \\\"too less\\\";\\nvar जावास्क्रिप्ट = \\\"javascript\\\"; // ok that's JavaScript in hindi\\nvar KingGeorgeⅦ = \\\"Roman numerals.\\\";\\n\\nconsole.log([ᾩ, ĦĔĽĻŎ, 〱〱〱〱, जावास्क्रिप्ट, KingGeorgeⅦ])\\n\",\n \"language\": \"JavaScript\"\n },\n {\n \"code\": \"{ \\\"Δ\\\": 1 } | .[\\\"Δ\\\"]\\n\",\n \"language\": \"Jq\"\n },\n {\n \"code\": \".[\\\"Δ\\\"]\\n\",\n \"language\": \"Jq\"\n },\n {\n \"code\": \".\\\"Δ\\\"\\n\",\n \"language\": \"Jq\"\n },\n {\n \"code\": \"{ \\\"Δ\\\": 1 } # initialization\\n| .[\\\"Δ\\\"] += 1 # increment by 1\\n| .[\\\"Δ\\\"] # emit the incremented value\\n\",\n \"language\": \"Jq\"\n },\n {\n \"code\": \"julia> Δ = 1 ; Δ += 1 ; Δ\\n2\\n\",\n \"language\": \"Julia\"\n },\n {\n \"code\": \"julia> Δ̂₂ = Δ^2\\n4\\n\",\n \"language\": \"Julia\"\n },\n {\n \"code\": \"fun main(args: Array<String>) {\\n var Δ = 1\\n Δ++\\n print(Δ)\\n}\\n\",\n \"language\": \"Kotlin\"\n },\n {\n \"code\": \"var Δ = 1\\nΔ += 1\\nprint(Δ.to_s())\\n\",\n \"language\": \"Lily\"\n },\n {\n \"code\": \"Δ = 1\\nΔ = Δ + 1\\nput Δ\\n-- 2\\n\",\n \"language\": \"Lingo\"\n },\n {\n \"code\": \"put 1 into Δ\\nadd 1 to Δ\\nput Δ\\n-- result is 2\\n\",\n \"language\": \"LiveCode\"\n },\n {\n \"code\": \"I HAS A SRS \\\"Δ\\\" ITZ 1\\nSRS \\\"Δ\\\" R SUM OF SRS \\\":(394)\\\" AN 1\\nVISIBLE SRS \\\":[GREEK CAPITAL LETTER DELTA]\\\"\\n\",\n \"language\": \"LOLCODE\"\n },\n {\n \"code\": \"∆ = 1\\n∆ = ∆ + 1\\nprint(∆)\\n\",\n \"language\": \"Lua\"\n },\n {\n \"code\": \"Δ=1\\nΔ++\\nPrint Δ\\nᾩ=3\\nPrint ᾩ**2=ᾩ^2, ᾩ^2-1=8\\nΤύπωσε ᾩ**2=ᾩ^2, ᾩ^2-1=8 ' this is Print statement too\\nPrint ᾡ=3\\nजावास्क्रिप्ट=100\\nजावास्क्रिप्ट++\\nPrint \\\"जावास्क्रिप्ट=\\\";जावास्क्रिप्ट\\nĦĔĽĻŎ$=\\\"hello\\\"\\nPrint ĦĔĽĻŎ$+ħĕľļŏ$=\\\"hellohello\\\"\\n〱〱〱〱$=\\\"too less\\\"\\nPrint Left$(〱〱〱〱$, 3)=\\\"too\\\"\\n\\nc͓͈̃͂̋̈̆̽h̥̪͕ͣ͛̊aͨͣ̍͞ơ̱͔̖͖̑̽ș̻̥ͬ̃̈ͩ =100 : Print \\\"c͓͈̃͂̋̈̆̽h̥̪͕ͣ͛̊aͨͣ̍͞ơ̱͔̖͖̑̽ș̻̥ͬ̃̈ͩ =\\\"; c͓͈̃͂̋̈̆̽h̥̪͕ͣ͛̊aͨͣ̍͞ơ̱͔̖͖̑̽ș̻̥ͬ̃̈ͩ\\n\",\n \"language\": \"M2000-Interpreter\"\n },\n {\n \"code\": \"Δ = 1;\\nΔ++;\\nPrint[Δ]\\n\",\n \"language\": \"Mathematica\"\n },\n {\n \"code\": \"using System.Console;\\n\\nmodule UnicodeVar\\n{\\n Main() : void\\n {\\n mutable Δ = 1;\\n Δ++;\\n WriteLine($\\\"Δ = $Δ\\\");\\n }\\n}\\n\",\n \"language\": \"Nemerle\"\n },\n {\n \"code\": \"/* NetRexx */\\noptions replace format comments java crossref symbols nobinary\\n\\nupperΔ = 1\\nΔupper = upperΔ\\nlowerδ = 2\\nδlower = lowerδ\\n\\nsay upperΔ '+' Δupper '= \\\\-'\\nupperΔ = upperΔ + Δupper\\nsay upperΔ\\n\\nsay lowerδ '+' δlower '= \\\\-'\\nlowerδ = lowerδ + δlower\\nsay lowerδ\\nsay\\n\\n-- Unicode works with the NetRexx built-in functions\\nΥππερ = '\\\\u0391'.sequence('\\\\u03a1') || '\\\\u03a3'.sequence('\\\\u03a9') -- ΑΒΓΔΕΖΗΘΙΚΛΜΝΞΟΠΡΣΤΥΦΧΨΩ\\nΛοωερ = '\\\\u03b1'.sequence('\\\\u03c1') || '\\\\u03c3'.sequence('\\\\u03c9') -- αβγδεζηθικλμνξοπρστυφχψω\\nsay Υππερ'.Lower =' Υππερ.lower()\\nsay Λοωερ'.Upper =' Λοωερ.upper()\\nsay\\n\\n-- Note: Even with unicode characters NetRexx variables are case-insensitive\\nnumeric digits 12\\nδ = 20.0\\nπ = Math.PI\\nθ = Π * Δ\\nσ = Θ ** 2 / (Π * 4) -- == Π * (Δ / 2) ** 2\\nsay 'Π =' π', diameter =' δ', circumference =' Θ', area =' Σ\\n\\nreturn\\n\",\n \"language\": \"NetRexx\"\n },\n {\n \"code\": \"var Δ = 1\\ninc Δ\\necho Δ\\n\",\n \"language\": \"Nim\"\n },\n {\n \"code\": \"class Test {\\n function : Main(args : String[]) ~ Nil {\\n Δ := 1;\\n π := 3.141592;\\n 你好 := \\\"hello\\\";\\n Δ += 1;\\n Δ->PrintLine();\\n }\\n}\\n\",\n \"language\": \"Objeck\"\n },\n {\n \"code\": \"(define Δ 1)\\n(define Δ (+ Δ 1))\\n(print Δ)\\n\",\n \"language\": \"Ol\"\n },\n {\n \"code\": \"<@ LETVARLIT>Δ|1</@>\\n<@ ACTICRVAR>Δ</@>\\n<@ SAYVAR>Δ</@>\\n\",\n \"language\": \"Peloton\"\n },\n {\n \"code\": \"<@ LETVARLIT>三角洲|1</@>\\n<@ ACTICRVAR>三角洲</@>\\n<@ SAYVAR>三角洲</@>\\n\",\n \"language\": \"Peloton\"\n },\n {\n \"code\": \"use utf8;\\n\\nmy $Δ = 1;\\n$Δ++;\\nprint $Δ, \\\"\\\\n\\\";\\n\",\n \"language\": \"Perl\"\n },\n {\n \"code\": \"use utf8;\\n\\nBEGIN {\\n my $val;\\n sub Δ () : lvalue {\\n $val;\\n }\\n}\\n\\nΔ = 1;\\nΔ++;\\nprint Δ, \\\"\\\\n\\\";\\n\",\n \"language\": \"Perl\"\n },\n {\n \"code\": \"use utf8;\\nuse v5.10;\\n\\nsub Δ () : lvalue {\\n state $val;\\n}\\n\\nΔ = 1;\\nΔ++;\\nsay Δ;\\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;\\\">integer</span> <span style=\\\"color: #000000;\\\">Δ</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">1</span>\\n <span style=\\\"color: #000000;\\\">Δ</span> <span style=\\\"color: #0000FF;\\\">+=</span> <span style=\\\"color: #000000;\\\">1</span>\\n <span style=\\\"color: #0000FF;\\\">?</span><span style=\\\"color: #000000;\\\">Δ</span>\\n<!--\\n\",\n \"language\": \"Phix\"\n },\n {\n \"code\": \"<?php\\n$Δ = 1;\\n++$Δ;\\necho $Δ;\\n\",\n \"language\": \"PHP\"\n },\n {\n \"code\": \": (setq Δ 1)\\n-> 1\\n: Δ\\n-> 1\\n: (inc 'Δ)\\n-> 2\\n: Δ\\n-> 2\\n\",\n \"language\": \"PicoLisp\"\n },\n {\n \"code\": \"#charset utf8\\nvoid main()\\n{\\n int Δ = 1;\\n Δ++;\\n write( Δ +\\\"\\\\n\\\");\\n}\\n\",\n \"language\": \"Pike\"\n },\n {\n \"code\": \"$Δ = 2\\n$π = 3.14\\n$π*$Δ\\n\",\n \"language\": \"PowerShell\"\n },\n {\n \"code\": \"% Unicode in predicate names:\\n是. % be: means, approximately, \\\"True\\\".\\n不是 :- \\\\+ 是. % not be: means, approximately, \\\"False\\\". Defined as not 是.\\n\\n% Unicode in variable names:\\ntest(Garçon, Δ) :-\\n Garçon = boy,\\n Δ = delta.\\n\\n% Call test2(1, Result) to have 2 assigned to Result.\\ntest2(Δ, R) :- R is Δ + 1.\\n\",\n \"language\": \"Prolog\"\n },\n {\n \"code\": \"?- 是.\\ntrue.\\n\\n?- 不是.\\nfalse.\\n\\n?- test(X,Y).\\nX = boy,\\nY = delta.\\n\\n?- test2(1,Result).\\nResult = 2.\\n\",\n \"language\": \"Prolog\"\n },\n {\n \"code\": \">>> Δx = 1\\n>>> Δx += 1\\n>>> print(Δx)\\n2\\n>>>\\n\",\n \"language\": \"Python\"\n },\n {\n \"code\": \"f <- function(`∆`=1) `∆`+1\\n\\nf(1)\\n\",\n \"language\": \"R\"\n },\n {\n \"code\": \"#lang racket\\n\\n;; Racket can use Unicode in identifier names\\n(define √ sqrt)\\n(√ 256) ; -> 16\\n;; and in fact the standard language makes use of some of these\\n(λ(x) x) ; -> an identity function\\n\\n;; The required binding:\\n(define Δ 1)\\n(set! Δ (add1 Δ))\\n(printf \\\"Δ = ~s\\\\n\\\" Δ) ; prints \\\"Δ = 2\\\"\\n\",\n \"language\": \"Racket\"\n },\n {\n \"code\": \"my $Δ = 1;\\n$Δ++;\\nsay $Δ;\\n\",\n \"language\": \"Raku\"\n },\n {\n \"code\": \"my @ᐁ = (0, 45, 60, 90);\\n\\nsub π { pi };\\n\\nsub postfix:<°>($degrees) { $degrees * π / 180 };\\n\\nfor @ᐁ -> $ಠ_ಠ { say sin $ಠ_ಠ° };\\n\\nsub c͓͈̃͂̋̈̆̽h̥̪͕ͣ͛̊aͨͣ̍͞ơ̱͔̖͖̑̽ș̻̥ͬ̃̈ͩ { 'HE COMES' }\\n\",\n \"language\": \"Raku\"\n },\n {\n \"code\": \"'Δ var\\n#1 !Δ\\n@Δ n:put\\n&Δ v:inc\\n@Δ n:put\\n\",\n \"language\": \"Retro\"\n },\n {\n \"code\": \"/*REXX program (using the R4 REXX interpreter) which uses a Greek delta char).*/\\n'chcp' 1253 \\\"> NUL\\\" /*ensure we're using correct code page.*/\\nΔ=1 /*define delta (variable name Δ) to 1*/\\nΔ=Δ+1 /*bump the delta REXX variable by unity*/\\nsay 'Δ=' Δ /*stick a fork in it, we're all done. */\\n\",\n \"language\": \"REXX\"\n },\n {\n \"code\": \"# Project : Unicode variable names\\n\\nΔ = \\\"Ring Programming Language\\\"\\nsee Δ + nl\\n\",\n \"language\": \"Ring\"\n },\n {\n \"code\": \"Δ = 1\\nΔ += 1\\nputs Δ # => 2\\n\",\n \"language\": \"Ruby\"\n },\n {\n \"code\": \"#![feature(non_ascii_idents)]\\n#![allow(non_snake_case)]\\n\\nfn main() {\\n let mut Δ: i32 = 1;\\n Δ += 1;\\n println!(\\\"{}\\\", Δ);\\n}\\n\",\n \"language\": \"Rust\"\n },\n {\n \"code\": \"define ∆increment(∆ref) {\\n @∆ref++;\\n}\\nvariable foo∆bar = 1;\\nfoo∆bar++;\\nvariable ∆bar = 1;\\n∆bar++;\\n∆increment(&∆bar);\\n% foo∆bar should be 2 and ∆bar should be 3.\\nprint(foo∆bar);\\nprint(∆bar);\\n\",\n \"language\": \"S-lang\"\n },\n {\n \"code\": \"var Δ = 1\\nval π = 3.141592\\nval 你好 = \\\"hello\\\"\\nΔ += 1\\nprintln(Δ)\\n\",\n \"language\": \"Scala\"\n },\n {\n \"code\": \"put 1 into Δ\\nadd 1 to Δ\\nput Δ\\n\",\n \"language\": \"SenseTalk\"\n },\n {\n \"code\": \"var Δ = 1;\\nΔ += 1;\\nsay Δ;\\n\",\n \"language\": \"Sidef\"\n },\n {\n \"code\": \"sca Δ=10\\nsca Δ=Δ+1\\ndi Δ\\n\\nlocal Δ=20\\nlocal ++Δ\\ndi `Δ'\\n\\nmata\\nΔ=30\\nΔ++\\nΔ\\nend\\n\",\n \"language\": \"Stata\"\n },\n {\n \"code\": \"var Δ = 1\\nlet π = 3.141592\\nlet 你好 = \\\"hello\\\"\\nΔ++\\nprintln(Δ)\\n\",\n \"language\": \"Swift\"\n },\n {\n \"code\": \"set Δx 1\\nincr Δx\\nputs [set Δx]\\nputs ${Δx}\\n\",\n \"language\": \"Tcl\"\n },\n {\n \"code\": \"Δ=1\\nΔ=`expr $Δ + 1`\\necho $Δ\\n\",\n \"language\": \"UNIX-Shell\"\n },\n {\n \"code\": \"Sub Main()\\n Dim Δ As Integer\\n Δ=1\\n Δ=Δ+1\\n Debug.Print Δ\\nEnd Sub\\n\",\n \"language\": \"Visual-Basic\"\n },\n {\n \"code\": \"var a = 3\\nvar b = 2\\nvar delta = a - b // ok\\nvar Δ = delta // not ok\\n\",\n \"language\": \"Wren\"\n },\n {\n \"code\": \"import \\\"./trait\\\" for Var\\n\\nVar[\\\"Δ\\\"] = 1\\nVar[\\\"Δ\\\"] = Var[\\\"Δ\\\"] + 1\\nSystem.print(Var[\\\"Δ\\\"])\\n\",\n \"language\": \"Wren\"\n },\n {\n \"code\": \"const std = @import(\\\"std\\\");\\n\\npub fn main() void {\\n var @\\\"Δ\\\": i32 = 1;\\n @\\\"Δ\\\" += 1;\\n std.debug.print(\\\"{d}\\\\n\\\", .{@\\\"Δ\\\"});\\n}\\n\",\n \"language\": \"Zig\"\n },\n {\n \"code\": \"delta:=\\\"\\\\U0394;\\\"; // UTF-8 delta\\nklass:=\\t// embryo(names, numFcns, numClasses, numParents, ...)\\n self.embryo(L(\\\"\\\",\\\"\\\",delta),0,0,0).cook();\\nklass.setVar(0,Ref(1)); // indirect set since delta not valid var name\\nklass.vars.println();\\n\\ndv:=klass.setVar(0); // which actually gets the var, go figure\\ndv.inc();\\t // ie (*ptr)++\\ndv.value.println();\\n\",\n \"language\": \"Zkl\"\n }\n]","isConversational":false},"task_name":{"kind":"string","value":"Unicode-variable-names"}}},{"rowIdx":1784,"cells":{"solutions":{"kind":"list like","value":[{"code":"---\nfrom: http://rosettacode.org/wiki/Unix/ls\n","language":"00-META"},{"code":";Task:\nWrite a program that will list everything in the current folder, similar to:\n:::* the Unix utility “<tt>ls</tt>” [http://man7.org/linux/man-pages/man1/ls.1.html] or \n:::* the Windows terminal command “<tt>DIR</tt>” \n\n<br>\nThe output must be sorted, but printing extended details and producing multi-column output is not required.\n\n\n;Example output\nFor the list of paths:\n<pre>\n/foo/bar\n/foo/bar/1\n/foo/bar/2\n/foo/bar/a\n/foo/bar/b\n</pre>\n\n\nWhen the program is executed in `/foo`, it should print:\n<pre>\nbar\n</pre>\nand when the program is executed in `/foo/bar`, it should print:\n<pre>\n1\n2\na\nb\n</pre>\n<br><br>\n\n","language":"00-TASK"},{"code":"print(sorted(fs:list_dir(‘.’)).join(\"\\n\"))\n","language":"11l"},{"code":"dma:\t\tequ\t80h\nputs:\t\tequ\t9h\t\t; Write string to console\nsfirst:\t\tequ\t11h\t\t; Find first matching file\nsnext:\t\tequ\t12h\t\t; Get next matching file\n\t\torg\t100h\n\t\t;;;\tFirst, retrieve all filenames in current directory\n\t\t;;;\tCP/M has function 11h (sfirst) and function 13h (snext)\n\t\t;;;\tto return the first, and then following, files that\n\t\t;;;\tmatch a wildcard.\n\t\tlxi\td,0\t\t; Amount of files\n\t\tpush\td \t\t; Push on stack\n\t\tlxi\th,fnames\t; Start of area to save names\n\t\tpush\th \t\t; Push on stack\n\t\tlxi\td,fcb\t\t; FCB that will match any file\n\t\tmvi\tc,sfirst\t; Get the first file\ngetnames:\tcall\t5\t\t; Call CP/M BDOS\n\t\tinr\ta\t\t\n\t\tjz\tnamesdone\t; FF = we have all files\n\t\tdcr\ta\t\t; Dir entry is at DMA+32*A\t\n\t\trrc\t\t\t; Rotate 3 right, same as\n\t\trrc\t\t\t; rotate 5 left, *32\n\t\trrc\n\t\tadi\tdma+1\t\t; Add DMA offset + 1 (filename offset)\n\t\tmov\te,a\t\t; Low byte of address\n\t\tmvi\td,0\t\t; High byte is 0\n\t\tmvi\tb,8\t\t; Filename is 8 bytes\n\t\tpop\th\t\t; Get pointer to name area\n\t\tcall\tmemcpy\t\t; Copy the name\n\t\tmvi\tm,' '\t\t; Separate name and extension\n\t\tinx\th\n\t\tmvi\tb,3\t\t; Extension is 3 bytes\n\t\tcall \tmemcpy\t\t; Copy the extension\n\t\tmvi\tm,13\t\t; While we're at it, terminate\n\t\tinx\th\t\t; the filename with \\r\\n\n\t\tmvi \tm,10\n\t\tinx\th\n\t\tpop\td\t\t; Get amount of files\n\t\tinx\td\t\t; Increment it (we've added a file)\n\t\tpush \td \t\t; Put it back onto the stack\n\t\tpush\th\t\t; Put the name pointer on the stack too\n\t\tmvi\tc,snext\t\t; Go get the next file\n\t\tjmp\tgetnames\nnamesdone:\tpop\th\t\t; Terminate the file list with $\n\t\tmvi\tm,'$'\t\t; so it can be printed with function 9\n\t\t;;;\tCP/M does not keep its directory in sorted order,\n\t\t;;;\tso we need to sort the list of files ourselves.\n\t\t;;;\tWhat follows is a simple insertion sort.\n\t\tlxi\td,1\t\t; DE (i) = 1\nsortouter:\tpop\th\t\t; Get amount of files\n\t\tpush\th\n\t\tcall \tcmpdehl\t\t; i < length(files)?\n\t\tjnc\tsortdone\t; If not, we're done\n\t\tpush\td\t\t; push i; DE (j) = i\nsortinner:\tpush\td\t\t; push j\t\n\t\tmov\ta,d\t\t; j > 0?\n\t\tora\te\n\t\tjz\tsortinnerdone\t; If not, inner loop is done\n\t\tdcx\td\t\t; DE = j-1\n\t\tcall\tlookup\t\t; HL = files[j-1]\n\t\tpush\th\t\t; push files[j-1]\n\t\tinx\td\t\t; DE = j\n\t\tcall \tlookup\t\t; HL = files[j]\n\t\tpop\td\t\t; pop DE = files[j-1]\n\t\tpush\td\t\t; keep them across comparison\n\t\tpush\th\n\t\tcall \tcmpentries\t; A[j] >= A[j-1]?\n\t\tpop\th\n\t\tpop\td\n\t\tjc\tsortinnerdone\t; Then inner loop is done.\n\t\tmvi\tb,12\t\t; Otherwise we should swap them\nswaploop:\tldax\td\t\t; Get byte from files[j-1]\n\t\tmov\tc,m\t\t; Get byte from files[j]\n\t\tmov\tm,a\t\t; files[j][x]=files[j-1][x]\n\t\tmov\ta,c\t\t; files[j-1][x]=files[j]-[x]\n\t\tstax\td\n\t\tinx\th\t\t; Increment pointers\n\t\tinx\td\n\t\tdcr\tb\t\t; all 12 bytes done yet?\n\t\tjnz\tswaploop\t; if not, swap next byte\n\t\tpop\td\t\t; DE = j\n\t\tdcx\td\t\t; j = j-1\n\t\tjmp\tsortinner\nsortinnerdone:\tpop\td\t\t; pop j\n\t\tpop\td\t\t; pop i\n\t\tinx\td\t\t; i = i + 1\n\t\tjmp\tsortouter\nsortdone:\tpop\th\t\t; Remove file count from stack \t\n\t\t;;;\tWe're done sorting the list, print it.\n\t\tlxi\td,fnames\t; Print the now sorted list of files\n\t\tmvi\tc,puts\n\t\tjmp\t5\n\t\t;;;\tSubroutine: compare entries under DE and HL\ncmpentries:\tmvi\tb,12\t\t; Each entry has 12 relevant bytes.\ncmploop:\tldax\td\t\t; Get byte from entry DE\n\t\tcmp\tm \t\t; Compare with byte from entry HL\n\t\trnz\t\t\t; If they differ, we know the ordering\n\t\tinx\th\t\t; Increment both pointers\n\t\tinx\td\n\t\tdcr\tb \t\t; Decrement byte counter\n\t\tjnz\tcmploop\t\t; Compare next byte\n\t\tret\n\t\t;;;\tSubroutine: look up filename entry (HL=DE*14+fnames)\nlookup:\t\tpush\td\t\t; Save entry number\n\t\tmov\th,d\n\t\tmov\tl,e\n\t\tdad\th\t\t; HL = HL' * 2\n\t\tdad\td\t\t; HL = HL' * 3\n\t\tdad\th\t\t; HL = HL' * 6\n\t\tdad\td\t\t; HL = HL' * 7\n\t\tdad\th\t\t; HL = HL' * 14\n\t\tlxi\td,fnames\t; Offset\n\t\tdad\td \t\t; Add the offset\n\t\tpop\td \t\t; Restore entry number\n\t\tret\n\t\t;;;\tSubroutine: compare DE and HL\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;;;\tSubroutine: copy B bytes from DE to HL\nmemcpy:\t\tldax\td\t\t; Get byte from source\n\t\tmov\tm,a\t\t; Store byte at destination\n\t\tinx\th\t\t; Increment both pointers\n\t\tinx\td\n\t\tdcr\tb\t\t; Done yet?\n\t\tjnz\tmemcpy\t\t; If not, copy next byte\n\t\tret\n\t\t;;;\tFile control block used to specify wildcard\nfcb:\t\tdb\t0,'???????????'\t; Accept any file\n\t\tds\tfcb+36-$\t; Pad the FCB out to 36 bytes\nfnames:\n","language":"8080-Assembly"},{"code":"\"*\" f:glob\n' s:cmp a:sort\n\"\\n\" a:join .\n","language":"8th"},{"code":"with Ada.Text_IO, Ada.Directories, Ada.Containers.Indefinite_Vectors;\n\nprocedure Directory_List is\n\n use Ada.Directories, Ada.Text_IO;\n Search: Search_Type; Found: Directory_Entry_Type;\n package SV is new Ada.Containers.Indefinite_Vectors(Natural, String);\n Result: SV.Vector;\n package Sorting is new SV.Generic_Sorting; use Sorting;\n function SName return String is (Simple_Name(Found));\n\nbegin\n -- search directory and store it in Result, a vector of strings\n Start_Search(Search, Directory => \".\", Pattern =>\"\");\n while More_Entries(Search) loop\n Get_Next_Entry(Search, Found);\n declare\n Name: String := Simple_Name(Found);\n begin\n if Name(Name'First) /= '.' then\n Result.Append(Name);\n end if; -- ingnore filenames beginning with \".\"\n end;\n end loop; -- Result holds the entire directory in arbitrary order\n\n Sort(Result); -- Result holds the directory in proper order\n\n -- print Result\n for I in Result.First_Index .. Result.Last_Index loop\n Put_Line(Result.Element(I));\n end loop;\nend Directory_List;\n","language":"Ada"},{"code":"record r;\nfile f;\ntext s;\n\nf.opendir(1.argv);\n\nwhile (~f.case(s)) {\n if (s != \".\" && s != \"..\") {\n r[s] = 0;\n }\n}\n\nr.vcall(o_, 0, \"\\n\");\n","language":"Aime"},{"code":"print list \".\"\n","language":"Arturo"},{"code":"# syntax: GAWK -f UNIX_LS.AWK * | SORT\nBEGINFILE {\n printf(\"%s\\n\",FILENAME)\n nextfile\n}\nEND {\n exit(0)\n}\n","language":"AWK"},{"code":"' Emulate ls\ncnt% = 0\nfiles$ = \"\"\nOPEN CURDIR$ FOR DIRECTORY AS mydir\nGETFILE myfile$ FROM mydir\nWHILE ISTRUE(LEN(myfile$))\n IF LEFT$(myfile$, 1) != \".\" THEN\n INCR cnt%\n files$ = APPEND$(files$, cnt%, UNFLATTEN$(myfile$))\n ENDIF\n GETFILE myfile$ FROM mydir\nWEND\nCLOSE DIRECTORY mydir\nIF cnt% > 0 THEN\n FOR f$ IN SORT$(files$)\n PRINT FLATTEN$(f$)\n NEXT\nENDIF\n","language":"BaCon"},{"code":"directory$ = dir(\"m:\\foo\\bar\\\")\t#Specified directory\n#directory$ = dir(currentdir)\t#Current directory\n\nwhile directory$ <> \"\"\n\tprint directory$\n\tdirectory$ = dir()\nend while\nend\n","language":"BASIC256"},{"code":"#include <stdio.h>\n#include <stdlib.h>\n#include <string.h>\n#include <limits.h>\n#include <sys/types.h>\n#include <dirent.h>\n#include <unistd.h>\n\nint cmpstr(const void *a, const void *b)\n{\n return strcmp(*(const char**)a, *(const char**)b);\n}\n\nint main(void)\n{\n DIR *basedir;\n char path[PATH_MAX];\n struct dirent *entry;\n char **dirnames;\n int diralloc = 128;\n int dirsize = 0;\n\n if (!(dirnames = malloc(diralloc * sizeof(char*)))) {\n perror(\"malloc error:\");\n return 1;\n }\n\n if (!getcwd(path, PATH_MAX)) {\n perror(\"getcwd error:\");\n return 1;\n }\n\n if (!(basedir = opendir(path))) {\n perror(\"opendir error:\");\n return 1;\n }\n\n while ((entry = readdir(basedir))) {\n if (dirsize >= diralloc) {\n diralloc *= 2;\n if (!(dirnames = realloc(dirnames, diralloc * sizeof(char*)))) {\n perror(\"realloc error:\");\n return 1;\n }\n }\n dirnames[dirsize++] = strdup(entry->d_name);\n }\n\n qsort(dirnames, dirsize, sizeof(char*), cmpstr);\n\n int i;\n for (i = 0; i < dirsize; ++i) {\n if (dirnames[i][0] != '.') {\n printf(\"%s\\n\", dirnames[i]);\n }\n }\n\n for (i = 0; i < dirsize; ++i)\n free(dirnames[i]);\n free(dirnames);\n closedir(basedir);\n return 0;\n}\n","language":"C"},{"code":"#include <iostream>\n#include <set>\n#include <boost/filesystem.hpp>\n\nnamespace fs = boost::filesystem;\n\nint main(void)\n{\n fs::path p(fs::current_path());\n std::set<std::string> tree;\n\n for (auto it = fs::directory_iterator(p); it != fs::directory_iterator(); ++it)\n tree.insert(it->path().filename().native());\n\n for (auto entry : tree)\n std::cout << entry << '\\n';\n}\n","language":"C++"},{"code":"using System;\nusing System.Collections.Generic;\nusing System.IO;\nusing System.Linq;\nusing System.Threading.Tasks;\n\nnamespace Unix_ls\n{\n public class UnixLS\n {\n public static void Main(string[] args)\n {\n UnixLS ls = new UnixLS();\n ls.list(args.Length.Equals(0) ? \".\" : args[0]);\n }\n\n private void list(string folder)\n {\n foreach (FileSystemInfo fileSystemInfo in new DirectoryInfo(folder).EnumerateFileSystemInfos(\"*\", SearchOption.TopDirectoryOnly))\n {\n Console.WriteLine(fileSystemInfo.Name);\n }\n }\n }\n}\n","language":"C-sharp"},{"code":"(def files (sort (filter #(= \".\" (.getParent %)) (file-seq (clojure.java.io/file \".\")))))\n\n(doseq [n files] (println (.getName n)))\n","language":"Clojure"},{"code":"(defun files-list (&optional (path \".\"))\n (let* ((dir (concatenate 'string path \"/\"))\n (abs-path (car (directory dir)))\n (file-pattern (concatenate 'string dir \"*\"))\n (subdir-pattern (concatenate 'string file-pattern \"/\")))\n (remove-duplicates\n (mapcar (lambda (p) (enough-namestring p abs-path))\n (mapcan #'directory (list file-pattern subdir-pattern)))\n :test #'string-equal)))\n\n(defun ls (&optional (path \".\"))\n (format t \"~{~a~%~}\" (sort (files-list path) #'string-lessp)))\n","language":"Common-Lisp"},{"code":"void main() {\n import std.stdio, std.file, std.path, std.array, std.algorithm;\n\n foreach (const string path; dirEntries(getcwd, SpanMode.shallow).array.sort)\n path.baseName.writeln;\n}\n","language":"D"},{"code":"program LsCommand;\n\n{$APPTYPE CONSOLE}\n\n\n\nuses\n System.SysUtils,\n System.IoUtils;\n\nprocedure Ls(folder: string = '.');\nvar\n offset: Integer;\n fileName: string;\n\n // simulate unix results in windows\n\n function ToUnix(path: string): string;\n begin\n Result := path.Replace('/', PathDelim, [rfReplaceAll])\n end;\n\nbegin\n folder := IncludeTrailingPathDelimiter(ToUnix(folder));\n offset := length(folder);\n\n for fileName in TDirectory.GetFileSystemEntries(folder, '*') do\n writeln(^I, ToUnix(fileName).Substring(offset));\nend;\n\nbegin\n writeln('cd foo'#10'ls');\n ls('foo');\n\n writeln(#10'cd bar'#10'ls');\n ls('foo/bar');\n\n {$IFNDEF LINUX} readln; {$ENDIF}\nend.\n","language":"Delphi"},{"code":";; ls of stores (kind of folders)\n(for-each writeln (list-sort < (local-stores))) →\n AGES\n NEMESIS\n info\n objects.dat\n reader\n system\n user\n words\n\n;; ls of \"NEMESIS\" store\n(for-each writeln (local-keys \"NEMESIS\")) →\n Alan\n Glory\n Jonah\n","language":"EchoLisp"},{"code":"iex(1)> ls = fn dir -> File.ls!(dir) |> Enum.each(&IO.puts &1) end\n#Function<6.54118792/1 in :erl_eval.expr/5>\niex(2)> ls.(\"foo\")\nbar\n:ok\niex(3)> ls.(\"foo/bar\")\n1\n2\na\nb\n:ok\n","language":"Elixir"},{"code":"1> Ls = fun(Dir) ->\n1> {ok, DirContents} = file:list_dir(Dir),\n1> [io:format(\"~s~n\", [X]) || X <- lists:sort(DirContents)]\n1> end.\n#Fun<erl_eval.6.36634728>\n2> Ls(\"foo\").\nbar\n[ok]\n3> Ls(\"foo/bar\").\n1\n2\na\nb\n[ok,ok,ok,ok]\n","language":"Erlang"},{"code":"let ls = DirectoryInfo(\".\").EnumerateFileSystemInfos() |> Seq.map (fun i -> i.Name) |> Seq.sort |> Seq.iter (printfn \"%s\")\n","language":"F-Sharp"},{"code":"256 buffer: filename-buf\n: each-filename { xt -- } \\ xt-consuming variant\n s\" .\" open-dir throw { d }\n begin filename-buf 256 d read-dir throw while\n filename-buf swap xt execute\n repeat d close-dir throw ;\n\n\\ immediate variant\n: each-filename[ s\" .\" postpone sliteral ]] open-dir throw >r begin filename-buf 256 r@ read-dir throw while filename-buf swap [[ ; immediate compile-only\n: ]each-filename ]] repeat drop r> close-dir throw [[ ; immediate compile-only\n\n: ls ( -- ) [: cr type ;] each-filename ;\n","language":"Forth"},{"code":": save-string ( c-addr u -- a )\n dup 1+ allocate throw dup >r place r> ;\n\nrequire ffl/car.fs\n: sorted-filenames ( -- car )\n 0 car-new { a }\n [: swap count rot count compare ;] a car-compare!\n each-filename[ save-string a car-insert-sorted ]each-filename\n a ;\n\n: each-sorted-filename ( xt -- )\n sorted-filenames { a } a car-execute [: free throw ;] a car-execute a car-free ;\n\n: ls ( -- )\n [: count cr type ;] each-sorted-filename ;\n","language":"Forth"},{"code":" PROGRAM LS\t\t!Names the files in the current directory.\n USE DFLIB\t\t\t!Mysterious library.\n TYPE(FILE$INFO) INFO\t!With mysterious content.\n NAMELIST /HIC/INFO\t!This enables annotated output.\n INTEGER MARK,L\t\t!Assistants.\n\n MARK = FILE$FIRST\t\t!Starting state.\nCall for the next file.\n 10 L = GETFILEINFOQQ(\"*\",INFO,MARK)\t!Mystery routine returns the length of the file name.\n IF (MARK.EQ.FILE$ERROR) THEN\t!Or possibly, not.\n WRITE (6,*) \"Error!\",L\t\t!Something went wrong.\n WRITE (6,HIC)\t\t\t!Reveal INFO, annotated.\n STOP \"That wasn't nice.\"\t!Quite.\n ELSE IF (IAND(INFO.PERMIT,FILE$DIR) .EQ. 0) THEN\t!Not a directory.\n IF (L.GT.0) WRITE (6,*) INFO.NAME(1:L)\t!The object of the exercise!\n END IF\t\t\t\t!So much for that entry.\n IF (MARK.NE.FILE$LAST) GO TO 10\t!Lastness is discovered after the last file is fingered.\n END\t!If FILE$LAST is not reached, \"system resources may be lost.\"\n","language":"Fortran"},{"code":" INTERFACE\n\tINTEGER*4 FUNCTION GETFILEINFOQQ(FILES, BUFFER,dwHANDLE)\n!DEC$ ATTRIBUTES DEFAULT :: GETFILEINFOQQ\n\t CHARACTER*(*) FILES\n\t STRUCTURE / FILE$INFO /\n\t INTEGER*4 CREATION ! Creation time (-1 on FAT)\n\t INTEGER*4 LASTWRITE ! Last write to file\n\t INTEGER*4 LASTACCESS ! Last access (-1 on FAT)\n\t INTEGER*4 LENGTH ! Length of file\n\t INTEGER*2 PERMIT ! File access mode\n\t CHARACTER*255 NAME ! File name\n\t END STRUCTURE\n\t RECORD / FILE$INFO / BUFFER\n\t INTEGER*4 dwHANDLE\n\tEND FUNCTION\n END INTERFACE\n","language":"Fortran"},{"code":"#include \"dir.bi\"\n\nSub ls(Byref filespec As String, Byval attrib As Integer)\n Dim As String filename = Dir(filespec, attrib)\n Do While Len(filename) > 0\n Print filename\n filename = Dir()\n Loop\nEnd Sub\n\nDim As String directory = \"\" ' Current directory\nls(directory & \"*\", fbDirectory)\nSleep\n","language":"FreeBASIC"},{"code":"for f = sort[files[\".\"], {|a,b| lexicalCompare[a.getName[], b.getName[]]}]\n println[f.getName[]]\n","language":"Frink"},{"code":"import io.File\n\nfor f <- sort( list(File( \".\" ).list()).filterNot(s -> s.startsWith(\".\")) )\n println( f )\n","language":"FunL"},{"code":"###sysinclude dir.uh\n###sysinclude stringextra.uh\n\n###define COLORS\n// delete the COLORS directive above if you do not want colored output!\n{ „vonal” __usebigbossnamespace myself \"-\" 90 makestring() }\n{ „points” __usebigbossnamespace myself \".\" 60 makestring() }\n#g argc 3 < { \".\" }{ 2 argv } sto mypath\n@mypath 'd !istrue { .\"The give directory doesn't exist! Exited.\\n\" end }\n@mypath getdir { .\"Cannot load the dir! Aborted.\\n\" end } sto mydir\n\n@mydir ~d {\n.\"Directories:\\n\"\n@mydir ~d {| #s\n@mydir 'd {} octalrights dup print free SPACE\n@mydir 'd {} getfilename dup 37 stub print SPACE drop\n@mydir 'd {} groupname ': !+\n@mydir 'd {} ownername dup sto temp + dup 10 stub print free @temp free\n@mydir 'd {} mtime dup print free\nNL |}\n@points sprint\n@mydir ~d { .\"Total: \" @mydir ~d #g print .\" subdirectories.\\n\" }\n@vonal sprint\n}\n@mydir ~r {\n.\"Regular files:\\n\"\n@mydir ~r {| #s\n@mydir 'r {} octalrights dup print free SPACE\n@mydir 'r {} getfilesize sbr §ifcolored\n@mydir 'r {} executable { .\" >\" }{ .\" \" } SPACE\n@mydir 'r {} getfilename dup 37 stub print SPACE drop\n@mydir 'r {} groupname ': !+\n@mydir 'r {} ownername dup sto temp + dup 10 stub print free @temp free\n@mydir 'r {} mtime dup print free\nNL |}\n@points sprint\n@mydir ~r { .\"Total: \" @mydir ~r #g print .\" regular files. \"\n.\"TotalSize = \" @mydir 'r totalsize sbr §ifcolored NL\n}\n@vonal sprint\n}\n@mydir ~L {\n.\"Symlinks:\\n\"\n@mydir ~L {| #s\n@mydir 'L {} octalrights dup print free SPACE\n@mydir 'L {} executable { .\">\" }{ SPACE } SPACE\n@mydir 'L {} getfilename dup 67 stub print SPACE drop\n@mydir 'L {} broken { .\"--->\" }{ .\"===>\" } SPACE\n@mydir 'L {} destination dup 30 stub print drop\nNL |}\n@points sprint\n@mydir ~L { .\"Total: \" @mydir ~L #g print .\" symlinks.\\n\"\n}\n}\n@vonal sprint\n.\"Size, alltogether = \" @mydir alltotal sbr §ifcolored NL\n@vonal sprint\n@mydir free\n.\"Free spaces: /* Total size of the filesystem is : \" @mypath filesystemsize dup sto filsize sbr §ifcolored .\" */\\n\"\n.\" for non-privilegized use: \" @mypath freenonpriv dup sbr §ifcolored\n#g 100 * @filsize / .\" ( \" print .\"% ) \" NL\n.\" All available free space: \" @mypath totalfree dup sbr §ifcolored\n#g 100 * @filsize / .\" ( \" print .\"% ) \" NL\nend\n\nifcolored:\n###ifdef COLORS\ncoloredsize\n###endif\n###ifndef COLORS\n#g !(#s) 21 >|\n###endif\ndup sprint free\nrts\n\n{ „filsize” }\n{ „mydir” }\n{ „mypath” }\n{ „temp” }\n{ „makestring” #s * dup 10 !+ swap free #g = }\n","language":"Furor"},{"code":"Public Sub Main()\nDim sDir As String[] = Dir(User.Home &/ \"test\").Sort()\n\nPrint sDir.Join(gb.NewLine)\n\nEnd\n","language":"Gambas"},{"code":"package main\n\nimport (\n\t\"fmt\"\n\t\"log\"\n\t\"os\"\n\t\"sort\"\n)\n\nfunc main() {\n\tf, err := os.Open(\".\")\n\tif err != nil {\n\t\tlog.Fatal(err)\n\t}\n\tfiles, err := f.Readdirnames(0)\n\tf.Close()\n\tif err != nil {\n\t\tlog.Fatal(err)\n\t}\n\tsort.Strings(files)\n\tfor _, n := range files {\n\t\tfmt.Println(n)\n\t}\n}\n","language":"Go"},{"code":"import Control.Monad\nimport Data.List\nimport System.Directory\n\ndontStartWith = flip $ (/=) . head\n\nmain = do\n files <- getDirectoryContents \".\"\n mapM_ putStrLn $ sort $ filter (dontStartWith '.') files\n","language":"Haskell"},{"code":" dir '' NB. includes properties\n >1 1 dir '' NB. plain filename as per task\n","language":"J"},{"code":"import java.io.File;\nimport java.util.ArrayList;\nimport java.util.Formatter;\nimport java.util.List;\n\npublic class Ls {\n public static void main(String[] args) throws Exception {\n Ls ls = new Ls(\"/\");\n System.out.println(ls);\n }\n\n private final File directory;\n private final List<File> list;\n\n public Ls(String path) throws Exception {\n directory = new File(path);\n if (!directory.exists())\n throw new Exception(\"Path not found '%s'\".formatted(directory));\n if (!directory.isDirectory())\n throw new Exception(\"Not a directory '%s'\".formatted(directory));\n list = new ArrayList<>(List.of(directory.listFiles()));\n /* place the directories first */\n list.sort((fileA, fileB) -> {\n if (fileA.isDirectory() && fileB.isFile()) {\n return -1;\n } else if (fileA.isFile() && fileB.isDirectory()) {\n return 1;\n }\n return 0;\n });\n }\n\n private String size(long bytes) {\n if (bytes > 1E9) {\n return \"%.1fG\".formatted(bytes / 1E9d);\n } else if (bytes > 1E6) {\n return \"%.1fM\".formatted(bytes / 1E6d);\n } else if (bytes > 1E3) {\n return \"%.1fK\".formatted(bytes / 1E3d);\n } else {\n return \"%d\".formatted(bytes);\n }\n }\n\n @Override\n public String toString() {\n StringBuilder string = new StringBuilder();\n Formatter formatter = new Formatter(string);\n /* add parent and current directory listings */\n list.add(0, directory.getParentFile());\n list.add(0, directory);\n /* generate total used space value */\n long total = 0;\n for (File file : list) {\n if (file == null) continue;\n total += file.length();\n }\n formatter.format(\"total %s%n\", size(total));\n /* generate output for each entry */\n int index = 0;\n for (File file : list) {\n if (file == null) continue;\n /* generate permission columns */\n formatter.format(file.isDirectory() ? \"d\" : \"-\");\n formatter.format(file.canRead() ? \"r\" : \"-\");\n formatter.format(file.canWrite() ? \"w\" : \"-\");\n formatter.format(file.canExecute() ? \"x\" : \"-\");\n /* include size */\n formatter.format(\"%7s \", size(file.length()));\n /* modification timestamp */\n formatter.format(\"%tb %1$td %1$tR \", file.lastModified());\n /* file or directory name */\n switch (index) {\n case 0 -> formatter.format(\".\");\n case 1 -> formatter.format(\"..\");\n default -> formatter.format(\"%s\", file.getName());\n }\n if (file.isDirectory())\n formatter.format(File.separator);\n formatter.format(\"%n\");\n index++;\n }\n formatter.flush();\n return string.toString();\n }\n}\n","language":"Java"},{"code":"package rosetta;\n\nimport java.io.IOException;\nimport java.nio.file.Files;\nimport java.nio.file.Path;\n\npublic class UnixLS {\n\n\tpublic static void main(String[] args) throws IOException {\n\t\tFiles.list(Path.of(\"\")).sorted().forEach(System.out::println);\n\t}\n}\n","language":"Java"},{"code":"Files.list(Path.of(\"\")).map(Path::toString).sorted(String.CASE_INSENSITIVE_ORDER).forEach(System.out::println);\n","language":"Java"},{"code":"const fs = require('fs');\nfs.readdir('.', (err, names) => names.sort().map( name => console.log(name) ));\n","language":"JavaScript"},{"code":"puts(File.glob().sort().join('\\n'));\n","language":"Jsish"},{"code":"# v0.6.0\n\nfor e in readdir() # Current directory\n println(e)\nend\n\n# Same for...\nreaddir(\"~\") # Read home directory\nreaddir(\"~/documents\")\n","language":"Julia"},{"code":"// Version 1.2.41\n\nimport java.io.File\n\nfun ls(directory: String) {\n val d = File(directory)\n if (!d.isDirectory) {\n println(\"$directory is not a directory\")\n return\n }\n d.listFiles().map { it.name }\n .sortedBy { it.toLowerCase() } // case insensitive\n .forEach { println(it) }\n}\n\nfun main(args: Array<String>) {\n ls(\".\") // list files in current directory, say\n}\n","language":"Kotlin"},{"code":"#!/bin/ksh\n\n# List everything in the current folder (sorted), similar to `ls`\n\n#\t# Variables:\n#\ntargetDir=${1:-/tmp/foo}\n\n ######\n# main #\n ######\n\ncd ${targetDir}\nfor obj in *; do\n\tprint ${obj}\ndone\n","language":"Ksh"},{"code":"set the defaultFolder to \"/foo\"\nput the folders & the files\nset the defaultFolder to \"/foo/bar\"\nput the folders & the files\n","language":"LiveCode"},{"code":"require(\"lfs\")\nfor file in lfs.dir(\".\") do print(file) end\n","language":"Lua"},{"code":"Column[FileNames[]]\n","language":"Mathematica"},{"code":"import Nanoquery.IO\nimport sort\n\nfnames = sort(new(File).listDir(\".\"))\n\nfor i in range(0, len(fnames) - 1)\n println fnames[i]\nend\n","language":"Nanoquery"},{"code":"from algorithm import sorted\nfrom os import walkPattern\nfrom sequtils import toSeq\n\nfor path in toSeq(walkPattern(\"*\")).sorted:\n echo path\n","language":"Nim"},{"code":"class Test {\n function : Main(args : String[]) ~ Nil {\n file_names := System.IO.File.Directory->List(\".\");\n each(i : file_names) {\n file_name := file_names[i];\n if(System.IO.File.Directory->Exists(file_name)) {\n file_name += '/';\n };\n file_name->PrintLine();\n };\n }\n}\n","language":"Objeck"},{"code":"let () =\n Array.iter print_endline (\n Sys.readdir Sys.argv.(1) )\n","language":"OCaml"},{"code":"system(\"dir/b/on\")\n","language":"PARI-GP"},{"code":"system(\"ls\")\n","language":"PARI-GP"},{"code":"Program ls;\t{To list the names of all files/directories in the current directory.}\n Uses DOS;\n var DirInfo: SearchRec;\t{Predefined. See page 403 of the Turbo Pascal 4 manual.}\n BEGIN\n FindFirst('*.*',AnyFile,DirInfo);\t{AnyFile means any file name OR directory name.}\n While DOSerror = 0 do\t\t\t{Result of FindFirst/Next not being a function, damnit.}\n begin\n WriteLn(DirInfo.Name);\n FindNext(DirInfo);\n end;\n END.\n","language":"Pascal"},{"code":"###sysinclude standard.uh\n###sysinclude args.uh\n###sysinclude io.uh\n###sysinclude str.uh\n\n###define COLORS\n// delete the COLORS directive above if you do not want colored output!\n#g argc 3 < { \".\" }{ 2 argv } sto mypath\n@mypath 'd inv istrue { .\"The given directory doesn't exist! Exited.\\n\" end }\n@mypath getdir { .\"Cannot load the dir! Aborted.\\n\" end } sto mydir\n'- 90 *... sto vonal\n'. 60 *... sto points\n\n@mydir ~d {\n.\"Directories:\\n\"\n@mydir ~d {{ #s\n@mydir 'd {{}} octalrights dup print inv mem SPACE\n@mydir 'd {{}} getfilename dup 67 mc print SPACE drop\n@mydir 'd {{}} groupname ': !+\n@mydir 'd {{}} ownername dup sto temp + dup 10 mc print inv mem @temp inv mem\n@mydir 'd {{}} mtime dup print inv mem\nNL }}\n@points sprintnl\n@mydir ~d { .\"Total: \" @mydir ~d #g print .\" subdirectories.\\n\" }\n@vonal sprintnl\n}\n\n@mydir ~r {\n.\"Regular files:\\n\"\n@mydir ~r {{ #s\n@mydir 'r {{}} octalrights dup print inv mem SPACE\n@mydir 'r {{}} getfilesize sbr §ifcolored\n@mydir 'r {{}} executable { .\" >\" }{ .\" \" } SPACE\n@mydir 'r {{}} getfilename dup 67 mc print SPACE drop\n@mydir 'r {{}} groupname ': !+\n@mydir 'r {{}} ownername dup sto temp + dup 10 mc print inv mem @temp inv mem\n@mydir 'r {{}} mtime dup print inv mem\nNL }}\n@points sprintnl\n@mydir ~r { .\"Total: \" @mydir ~r #g print .\" regular files. \"\n.\"TotalSize = \" @mydir 'r totalsize sbr §ifcolored NL\n}\n@vonal sprintnl\n}\n@mydir ~L {\n.\"Symlinks:\\n\"\n@mydir ~L {{ #s\n@mydir 'L {{}} octalrights dup print inv mem SPACE\n@mydir 'L {{}} executable { .\">\" }{ SPACE } SPACE\n@mydir 'L {{}} getfilename dup 67 mc print SPACE drop\n@mydir 'L {{}} broken { .\"--->\" }{ .\"===>\" } SPACE\n@mydir 'L {{}} destination dup 30 mc print drop\nNL }}\n@points sprintnl\n@mydir ~L { .\"Total: \" @mydir ~L #g print .\" symlinks.\\n\"\n}\n}\n@vonal sprintnl\n.\"Size, alltogether = \" @mydir alltotal sbr §ifcolored NL\n@vonal sprintnl\n\n\n@mydir inv mem\n\n.\"free spaces: /* Total size of the filesystem is : \" @mypath filesystemsize dup sto filsize sbr §ifcolored .\" */\\n\"\n.\" for non-privilegized use: \" @mypath freenonpriv dup sbr §ifcolored\n#g 100 * @filsize / .\" ( \" print .\"% ) \" NL\n.\" All available free space: \" @mypath totalfree dup sbr §ifcolored\n#g 100 * @filsize / .\" ( \" print .\"% ) \" NL\n@vonal inv mem\nend\n\nifcolored:\n###ifdef COLORS\ncoloredsize\n###endif\n###ifndef COLORS\n#g !(#s) 21 >|\n###endif\ndup sprint inv mem\nrts\n\n{ „filsize” }\n{ „mydir” }\n{ „mypath” }\n{ „temp” }\n{ „vonal” }\n{ „points” }\n","language":"Peri"},{"code":"opendir my $handle, '.' or die \"Couldnt open current directory: $!\";\nwhile (readdir $handle) {\n print \"$_\\n\";\n}\nclosedir $handle;\n","language":"Perl"},{"code":"print \"$_\\n\" for glob '*';\n","language":"Perl"},{"code":"print \"$_\\n\" for glob '* .*'; # If you want to include dot files\n","language":"Perl"},{"code":"-->\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: #7060A8;\">pp</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #7060A8;\">dir</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #008000;\">\".\"</span><span style=\"color: #0000FF;\">),{</span><span style=\"color: #004600;\">pp_Nest</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #004600;\">pp_IntCh</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #004600;\">false</span><span style=\"color: #0000FF;\">})</span>\n<!--\n","language":"Phix"},{"code":"-->\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: #7060A8;\">vslice</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #7060A8;\">dir</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #008000;\">\".\"</span><span style=\"color: #0000FF;\">),</span><span style=\"color: #004600;\">D_NAME</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;\">dirf</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #004080;\">string</span> <span style=\"color: #000000;\">path</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #004080;\">integer</span> <span style=\"color: #000000;\">date_type</span><span style=\"color: #0000FF;\">=</span><span style=\"color: #004600;\">D_MODIFICATION</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: #008080;\">return</span> <span style=\"color: #0000FF;\">{{</span><span style=\"color: #008000;\">`.`</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #008000;\">`d`</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">0</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">2022</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">2</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">11</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">01</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">09</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">13</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;\">`d`</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">0</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">2022</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">2</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">11</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">01</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">09</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">13</span><span style=\"color: #0000FF;\">},</span>\n <span style=\"color: #0000FF;\">{</span><span style=\"color: #008000;\">`.fake`</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #008000;\">`a`</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">5</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">2021</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">6</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><span style=\"color: #000000;\">42</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: #008000;\">`directory`</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #008000;\">`a`</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">18898</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">2020</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">4</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">4</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">13</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">57</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">37</span><span style=\"color: #0000FF;\">},</span>\n <span style=\"color: #0000FF;\">{</span><span style=\"color: #008000;\">`for.p2js`</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #008000;\">`a`</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">1024</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">2019</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">7</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">28</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">15</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">30</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">45</span><span style=\"color: #0000FF;\">}}</span>\n <span style=\"color: #008080;\">else</span>\n <span style=\"color: #008080;\">return</span> <span style=\"color: #7060A8;\">dir</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">path</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">date_type</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;\">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 <span style=\"color: #7060A8;\">set_timedate_formats</span><span style=\"color: #0000FF;\">({</span><span style=\"color: #008000;\">\"hh:mmpm Ddd Mmm ddth YYYY\"</span><span style=\"color: #0000FF;\">})</span>\n <span style=\"color: #004080;\">object</span> <span style=\"color: #000000;\">d</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">dirf</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #008000;\">\".\"</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;\">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;\">\"%-20s %s %10s %s\\n\"</span><span style=\"color: #0000FF;\">,{</span><span style=\"color: #008000;\">\"-- name --\"</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #008000;\">\"attr\"</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #008000;\">\"size\"</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #008000;\">\"-- time and date --\"</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;\">d</span><span style=\"color: #0000FF;\">)</span> <span style=\"color: #008080;\">do</span>\n <span style=\"color: #004080;\">sequence</span> <span style=\"color: #000000;\">di</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">d</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">i</span><span style=\"color: #0000FF;\">]</span>\n <span style=\"color: #004080;\">string</span> <span style=\"color: #000000;\">name</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">di</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #004600;\">D_NAME</span><span style=\"color: #0000FF;\">],</span>\n <span style=\"color: #000000;\">attr</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">di</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #004600;\">D_ATTRIBUTES</span><span style=\"color: #0000FF;\">],</span>\n <span style=\"color: #000000;\">size</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">file_size_k</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">d</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">i</span><span style=\"color: #0000FF;\">][</span><span style=\"color: #004600;\">D_SIZE</span><span style=\"color: #0000FF;\">]),</span>\n <span style=\"color: #000000;\">tdte</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">format_timedate</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">d</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">i</span><span style=\"color: #0000FF;\">][</span><span style=\"color: #004600;\">D_YEAR</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;\">\"%-20s %=4s %10s %s\\n\"</span><span style=\"color: #0000FF;\">,{</span><span style=\"color: #000000;\">name</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">attr</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">size</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">tdte</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<!--\n","language":"Phix"},{"code":"<?php\nforeach(scandir('.') as $fileName){\n echo $fileName.\"\\n\";\n}\n","language":"PHP"},{"code":"import os, util.\nmain =>\n println(ls()),\n println(ls(\"foo/bar\")).\n\nls() = ls(\".\").\nls(Path) = [F : F in listdir(Path), F != \".\",F != \"..\"].sort.join('\\n').\n","language":"Picat"},{"code":"(for F (sort (dir))\n (prinl F) )\n","language":"PicoLisp"},{"code":"foreach(sort(get_dir()), string file)\n write(file +\"\\n\");\n","language":"Pike"},{"code":"# Prints Name, Length, Mode, and LastWriteTime\nGet-ChildItem | Sort-Object Name | Write-Output\n\n# Prints only the name of each file in the directory\nGet-ChildItem | Sort-Object Name | ForEach-Object Name | Write-Output\n","language":"PowerShell"},{"code":"NewList lslist.s()\n\nIf OpenConsole(\"ls-sim\")\n If ExamineDirectory(0,GetCurrentDirectory(),\"*.*\")\n While NextDirectoryEntry(0)\n AddElement(lslist()) : lslist()=DirectoryEntryName(0)\n Wend\n FinishDirectory(0)\n SortList(lslist(),#PB_Sort_Ascending)\n ForEach lslist()\n PrintN(lslist())\n Next\n EndIf\n Input()\nEndIf\n","language":"PureBasic"},{"code":">>> import os\n>>> print('\\n'.join(sorted(os.listdir('.'))))\nDLLs\nDoc\nLICENSE.txt\nLib\nNEWS.txt\nREADME.txt\nScripts\nTools\ninclude\nlibs\npython.exe\npythonw.exe\ntcl\n>>>\n","language":"Python"},{"code":"cat(paste(list.files(), collapse = \"\\n\"), \"\\n\")\ncat(paste(list.files(\"bar\"), collapse = \"\\n\"), \"\\n\")\n","language":"R"},{"code":"#lang racket/base\n\n;; Racket's `directory-list' produces a sorted list of files\n(define (ls) (for-each displayln (directory-list)))\n\n;; Code to run when this file is running directly\n(module+ main\n (ls))\n\n(module+ test\n (require tests/eli-tester racket/port racket/file)\n (define (make-directory-tree)\n (make-directory* \"foo/bar\")\n (for ([f '(\"1\" \"2\" \"a\" \"b\")])\n (with-output-to-file (format \"foo/bar/~a\"f) #:exists 'replace newline)))\n (make-directory-tree)\n (define (ls/str dir)\n (parameterize ([current-directory dir]) (with-output-to-string ls)))\n (test (ls/str \"foo\") => \"bar\\n\"\n (ls/str \"foo/bar\") => \"1\\n2\\na\\nb\\n\"))\n","language":"Racket"},{"code":".say for sort ~«dir\n","language":"Raku"},{"code":"/*REXX program lists contents of current folder (ala mode UNIX's LS). */\n'DIR /b /oN' /*use Windows DIR: sorts & lists.*/\n /*stick a fork in it, we're done.*/\n","language":"REXX"},{"code":"Dir.foreach(\"./\"){|n| puts n}\n","language":"Ruby"},{"code":"files #f, DefaultDir$ + \"\\*.*\" \t' RunBasic Default directory.. Can be any directroy\nprint \"rowcount: \";#f ROWCOUNT()\t\t' how many rows in directory\n#f DATEFORMAT(\"mm/dd/yy\") \t\t\t'set format of file date or not\n#f TIMEFORMAT(\"hh:mm:ss\") \t\t\t'set format of file time or not\ncount = #f rowcount()\nfor i = 1 to count\t\t\t\t' loop thru the row count\nprint \"info: \";#f nextfile$()\t\t\t' file info\nprint \"name: \";#f NAME$()\t\t\t' Name of file\nprint \"size: \";#f SIZE()\t\t\t' size\nprint \"date: \";#f DATE$()\t\t\t' date\nprint \"time: \";#f TIME$()\t\t\t' time\nprint \"isdir: \";#f ISDIR()\t\t\t' 1 = is a directory\nnext\n","language":"Run-BASIC"},{"code":"use std::{env, fmt, fs, process};\nuse std::io::{self, Write};\nuse std::path::Path;\n\nfn main() {\n let cur = env::current_dir().unwrap_or_else(|e| exit_err(e, 1));\n let arg = env::args().nth(1);\n print_files(arg.as_ref().map_or(cur.as_path(), |p| Path::new(p)))\n .unwrap_or_else(|e| exit_err(e, 2));\n}\n\n#[inline]\nfn print_files(path: &Path) -> io::Result<()> {\n for x in try!(fs::read_dir(path)) {\n println!(\"{}\", try!(x).file_name().to_string_lossy());\n }\n Ok(())\n}\n\n#[inline]\nfn exit_err<T>(msg: T, code: i32) -> ! where T: fmt::Display {\n writeln!(&mut io::stderr(), \"{}\", msg).expect(\"Could not write to stderr\");\n process::exit(code)\n}\n","language":"Rust"},{"code":"variable d = listdir(getcwd()), p;\nforeach p (array_sort(d))\n () = printf(\"%s\\n\", d[p] );\n","language":"S-lang"},{"code":"$ include \"seed7_05.s7i\";\n include \"osfiles.s7i\";\n\nconst proc: main is func\n local\n var string: name is \"\";\n begin\n for name range readDir(\".\") do\n writeln(name);\n end for;\n end func;\n","language":"Seed7"},{"code":"var content = [];\nDir.cwd.open.each { |file|\n file ~~ < . .. > && next;\n content.append(file);\n}\n\ncontent.sort.each { |file|\n say file;\n}\n","language":"Sidef"},{"code":"'*'.glob.each { |file|\n say file;\n}\n","language":"Sidef"},{"code":"Stdout printCR: ( PipeStream outputFromCommand:'ls' )\n","language":"Smalltalk"},{"code":"Stdout printCR:('.' asFilename directoryContents sort asStringWith:Character cr)\n","language":"Smalltalk"},{"code":"'.' asFilename directoryContents sort do:#printCR\n","language":"Smalltalk"},{"code":"dir := '.' asFilename.\ndir directoryContentsAsFilenames sort do:[:fn |\n |line|\n \"\n generate a line of the form of ls -l:\n drwxrwxrwx user group size date time name\n where year is printed if not current, time of day otherwise\n \"\n line := String streamContents:[:s |\n |accessRights|\n\n s nextPut:(fn isDirectory ifTrue:[$d] ifFalse:[$-]).\n accessRights := fn symbolicAccessRights.\n #( readUser writeUser executeUser\n readGroup writeGroup executeGroup\n readOthers writeOthers executeOthers\n )\n with:'rwxrwxrwx'\n do:[:eachRight :charToPrint |\n s nextPut:((accessRights includes:eachRight) ifTrue:[charToPrint] ifFalse:[$-])\n ].\n (OperatingSystem getUserNameFromID:fn info uid) printOn:s leftPaddedTo:10.\n (OperatingSystem getGroupNameFromID:fn info gid) printOn:s leftPaddedTo:10.\n fn fileSize printOn:s leftPaddedTo:12.\n fn modificationTime year = Date today year ifTrue:[\n fn modificationTime printOn:s format:' %(dayPadded) %(ShortMonthName) %h:%m'.\n ] ifFalse:[\n fn modificationTime asDate printOn:s format:' %(dayPadded) %(ShortMonthName) %y'.\n ].\n s space.\n s nextPutAll:fn baseName\n ].\n line printCR\n].\n","language":"Smalltalk"},{"code":"OS.Process.system \"ls -a\"\n","language":"Standard-ML"},{"code":"local (* make a sort function *)\n val rec insert = fn s :string =>fn [] => [s]\n\t| ll as h::t => if s<=h then s::ll else h::insert s t;\nin\n val rec sort = fn [] => [] | h::t => insert h (sort t)\nend;\n\nopen Posix.FileSys ;\nval istream = opendir \".\" ;\nval ll = ref [readdir istream] ;\nwhile ( isSome (hd (!ll)) ) do ( ll:=readdir istream :: !ll );\nval result = List.map valOf (tl (!ll));\nclosedir istream ;\n\nsort result;\n","language":"Standard-ML"},{"code":". dir *.dta\n 6.3k 6/12/17 14:26 auto.dta\n 2.3k 8/10/17 7:34 titanium.dta\n 6.0k 8/12/17 9:28 trend.dta\n","language":"Stata"},{"code":"puts [join [lsort [glob -nocomplain *]] \"\\n\"]\n","language":"Tcl"},{"code":"echo *\n","language":"UNIX-Shell"},{"code":"for f in *; do echo \"$f\"; done\n","language":"UNIX-Shell"},{"code":"for f in *; do echo \"$f\"; done |sort\n","language":"UNIX-Shell"},{"code":"stat -c %n * |sort\n","language":"UNIX-Shell"},{"code":"decl file f\ndecl string<> fnames\nset fnames (sort (f.listdir \".\"))\n\nfor (decl int i) (< i (size fnames)) (inc i)\n out fnames<i> endl console\nend for\n","language":"Ursa"},{"code":"import os\n\nfn main() {\n\tcontents := os.ls('.')?\n println(contents)\n}\n","language":"V-(Vlang)"},{"code":"import \"io\" for Directory\n\nvar path = \"./\" // or whatever\n\n// Note that output is automatically sorted using this method.\nDirectory.list(path).each { |f| System.print(f) }\n","language":"Wren"},{"code":"string 0;\nchar S;\n[S:= \"ls\";\nasm { ldr r0, S\n bl system\n }\n]\n","language":"XPL0"},{"code":"File.glob(\"*\").sort()\n","language":"Zkl"},{"code":"File.glob(\"*\",0x8).sort()\n","language":"Zkl"},{"code":"File.globular(\"Src\",*,True,0x10,List).sort().concat(\"\\n\")\n","language":"Zkl"}],"string":"[\n {\n \"code\": \"---\\nfrom: http://rosettacode.org/wiki/Unix/ls\\n\",\n \"language\": \"00-META\"\n },\n {\n \"code\": \";Task:\\nWrite a program that will list everything in the current folder, similar to:\\n:::* the Unix utility “<tt>ls</tt>” [http://man7.org/linux/man-pages/man1/ls.1.html] or \\n:::* the Windows terminal command “<tt>DIR</tt>” \\n\\n<br>\\nThe output must be sorted, but printing extended details and producing multi-column output is not required.\\n\\n\\n;Example output\\nFor the list of paths:\\n<pre>\\n/foo/bar\\n/foo/bar/1\\n/foo/bar/2\\n/foo/bar/a\\n/foo/bar/b\\n</pre>\\n\\n\\nWhen the program is executed in `/foo`, it should print:\\n<pre>\\nbar\\n</pre>\\nand when the program is executed in `/foo/bar`, it should print:\\n<pre>\\n1\\n2\\na\\nb\\n</pre>\\n<br><br>\\n\\n\",\n \"language\": \"00-TASK\"\n },\n {\n \"code\": \"print(sorted(fs:list_dir(‘.’)).join(\\\"\\\\n\\\"))\\n\",\n \"language\": \"11l\"\n },\n {\n \"code\": \"dma:\\t\\tequ\\t80h\\nputs:\\t\\tequ\\t9h\\t\\t; Write string to console\\nsfirst:\\t\\tequ\\t11h\\t\\t; Find first matching file\\nsnext:\\t\\tequ\\t12h\\t\\t; Get next matching file\\n\\t\\torg\\t100h\\n\\t\\t;;;\\tFirst, retrieve all filenames in current directory\\n\\t\\t;;;\\tCP/M has function 11h (sfirst) and function 13h (snext)\\n\\t\\t;;;\\tto return the first, and then following, files that\\n\\t\\t;;;\\tmatch a wildcard.\\n\\t\\tlxi\\td,0\\t\\t; Amount of files\\n\\t\\tpush\\td \\t\\t; Push on stack\\n\\t\\tlxi\\th,fnames\\t; Start of area to save names\\n\\t\\tpush\\th \\t\\t; Push on stack\\n\\t\\tlxi\\td,fcb\\t\\t; FCB that will match any file\\n\\t\\tmvi\\tc,sfirst\\t; Get the first file\\ngetnames:\\tcall\\t5\\t\\t; Call CP/M BDOS\\n\\t\\tinr\\ta\\t\\t\\n\\t\\tjz\\tnamesdone\\t; FF = we have all files\\n\\t\\tdcr\\ta\\t\\t; Dir entry is at DMA+32*A\\t\\n\\t\\trrc\\t\\t\\t; Rotate 3 right, same as\\n\\t\\trrc\\t\\t\\t; rotate 5 left, *32\\n\\t\\trrc\\n\\t\\tadi\\tdma+1\\t\\t; Add DMA offset + 1 (filename offset)\\n\\t\\tmov\\te,a\\t\\t; Low byte of address\\n\\t\\tmvi\\td,0\\t\\t; High byte is 0\\n\\t\\tmvi\\tb,8\\t\\t; Filename is 8 bytes\\n\\t\\tpop\\th\\t\\t; Get pointer to name area\\n\\t\\tcall\\tmemcpy\\t\\t; Copy the name\\n\\t\\tmvi\\tm,' '\\t\\t; Separate name and extension\\n\\t\\tinx\\th\\n\\t\\tmvi\\tb,3\\t\\t; Extension is 3 bytes\\n\\t\\tcall \\tmemcpy\\t\\t; Copy the extension\\n\\t\\tmvi\\tm,13\\t\\t; While we're at it, terminate\\n\\t\\tinx\\th\\t\\t; the filename with \\\\r\\\\n\\n\\t\\tmvi \\tm,10\\n\\t\\tinx\\th\\n\\t\\tpop\\td\\t\\t; Get amount of files\\n\\t\\tinx\\td\\t\\t; Increment it (we've added a file)\\n\\t\\tpush \\td \\t\\t; Put it back onto the stack\\n\\t\\tpush\\th\\t\\t; Put the name pointer on the stack too\\n\\t\\tmvi\\tc,snext\\t\\t; Go get the next file\\n\\t\\tjmp\\tgetnames\\nnamesdone:\\tpop\\th\\t\\t; Terminate the file list with $\\n\\t\\tmvi\\tm,'$'\\t\\t; so it can be printed with function 9\\n\\t\\t;;;\\tCP/M does not keep its directory in sorted order,\\n\\t\\t;;;\\tso we need to sort the list of files ourselves.\\n\\t\\t;;;\\tWhat follows is a simple insertion sort.\\n\\t\\tlxi\\td,1\\t\\t; DE (i) = 1\\nsortouter:\\tpop\\th\\t\\t; Get amount of files\\n\\t\\tpush\\th\\n\\t\\tcall \\tcmpdehl\\t\\t; i < length(files)?\\n\\t\\tjnc\\tsortdone\\t; If not, we're done\\n\\t\\tpush\\td\\t\\t; push i; DE (j) = i\\nsortinner:\\tpush\\td\\t\\t; push j\\t\\n\\t\\tmov\\ta,d\\t\\t; j > 0?\\n\\t\\tora\\te\\n\\t\\tjz\\tsortinnerdone\\t; If not, inner loop is done\\n\\t\\tdcx\\td\\t\\t; DE = j-1\\n\\t\\tcall\\tlookup\\t\\t; HL = files[j-1]\\n\\t\\tpush\\th\\t\\t; push files[j-1]\\n\\t\\tinx\\td\\t\\t; DE = j\\n\\t\\tcall \\tlookup\\t\\t; HL = files[j]\\n\\t\\tpop\\td\\t\\t; pop DE = files[j-1]\\n\\t\\tpush\\td\\t\\t; keep them across comparison\\n\\t\\tpush\\th\\n\\t\\tcall \\tcmpentries\\t; A[j] >= A[j-1]?\\n\\t\\tpop\\th\\n\\t\\tpop\\td\\n\\t\\tjc\\tsortinnerdone\\t; Then inner loop is done.\\n\\t\\tmvi\\tb,12\\t\\t; Otherwise we should swap them\\nswaploop:\\tldax\\td\\t\\t; Get byte from files[j-1]\\n\\t\\tmov\\tc,m\\t\\t; Get byte from files[j]\\n\\t\\tmov\\tm,a\\t\\t; files[j][x]=files[j-1][x]\\n\\t\\tmov\\ta,c\\t\\t; files[j-1][x]=files[j]-[x]\\n\\t\\tstax\\td\\n\\t\\tinx\\th\\t\\t; Increment pointers\\n\\t\\tinx\\td\\n\\t\\tdcr\\tb\\t\\t; all 12 bytes done yet?\\n\\t\\tjnz\\tswaploop\\t; if not, swap next byte\\n\\t\\tpop\\td\\t\\t; DE = j\\n\\t\\tdcx\\td\\t\\t; j = j-1\\n\\t\\tjmp\\tsortinner\\nsortinnerdone:\\tpop\\td\\t\\t; pop j\\n\\t\\tpop\\td\\t\\t; pop i\\n\\t\\tinx\\td\\t\\t; i = i + 1\\n\\t\\tjmp\\tsortouter\\nsortdone:\\tpop\\th\\t\\t; Remove file count from stack \\t\\n\\t\\t;;;\\tWe're done sorting the list, print it.\\n\\t\\tlxi\\td,fnames\\t; Print the now sorted list of files\\n\\t\\tmvi\\tc,puts\\n\\t\\tjmp\\t5\\n\\t\\t;;;\\tSubroutine: compare entries under DE and HL\\ncmpentries:\\tmvi\\tb,12\\t\\t; Each entry has 12 relevant bytes.\\ncmploop:\\tldax\\td\\t\\t; Get byte from entry DE\\n\\t\\tcmp\\tm \\t\\t; Compare with byte from entry HL\\n\\t\\trnz\\t\\t\\t; If they differ, we know the ordering\\n\\t\\tinx\\th\\t\\t; Increment both pointers\\n\\t\\tinx\\td\\n\\t\\tdcr\\tb \\t\\t; Decrement byte counter\\n\\t\\tjnz\\tcmploop\\t\\t; Compare next byte\\n\\t\\tret\\n\\t\\t;;;\\tSubroutine: look up filename entry (HL=DE*14+fnames)\\nlookup:\\t\\tpush\\td\\t\\t; Save entry number\\n\\t\\tmov\\th,d\\n\\t\\tmov\\tl,e\\n\\t\\tdad\\th\\t\\t; HL = HL' * 2\\n\\t\\tdad\\td\\t\\t; HL = HL' * 3\\n\\t\\tdad\\th\\t\\t; HL = HL' * 6\\n\\t\\tdad\\td\\t\\t; HL = HL' * 7\\n\\t\\tdad\\th\\t\\t; HL = HL' * 14\\n\\t\\tlxi\\td,fnames\\t; Offset\\n\\t\\tdad\\td \\t\\t; Add the offset\\n\\t\\tpop\\td \\t\\t; Restore entry number\\n\\t\\tret\\n\\t\\t;;;\\tSubroutine: compare DE and HL\\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;;;\\tSubroutine: copy B bytes from DE to HL\\nmemcpy:\\t\\tldax\\td\\t\\t; Get byte from source\\n\\t\\tmov\\tm,a\\t\\t; Store byte at destination\\n\\t\\tinx\\th\\t\\t; Increment both pointers\\n\\t\\tinx\\td\\n\\t\\tdcr\\tb\\t\\t; Done yet?\\n\\t\\tjnz\\tmemcpy\\t\\t; If not, copy next byte\\n\\t\\tret\\n\\t\\t;;;\\tFile control block used to specify wildcard\\nfcb:\\t\\tdb\\t0,'???????????'\\t; Accept any file\\n\\t\\tds\\tfcb+36-$\\t; Pad the FCB out to 36 bytes\\nfnames:\\n\",\n \"language\": \"8080-Assembly\"\n },\n {\n \"code\": \"\\\"*\\\" f:glob\\n' s:cmp a:sort\\n\\\"\\\\n\\\" a:join .\\n\",\n \"language\": \"8th\"\n },\n {\n \"code\": \"with Ada.Text_IO, Ada.Directories, Ada.Containers.Indefinite_Vectors;\\n\\nprocedure Directory_List is\\n\\n use Ada.Directories, Ada.Text_IO;\\n Search: Search_Type; Found: Directory_Entry_Type;\\n package SV is new Ada.Containers.Indefinite_Vectors(Natural, String);\\n Result: SV.Vector;\\n package Sorting is new SV.Generic_Sorting; use Sorting;\\n function SName return String is (Simple_Name(Found));\\n\\nbegin\\n -- search directory and store it in Result, a vector of strings\\n Start_Search(Search, Directory => \\\".\\\", Pattern =>\\\"\\\");\\n while More_Entries(Search) loop\\n Get_Next_Entry(Search, Found);\\n declare\\n Name: String := Simple_Name(Found);\\n begin\\n if Name(Name'First) /= '.' then\\n Result.Append(Name);\\n end if; -- ingnore filenames beginning with \\\".\\\"\\n end;\\n end loop; -- Result holds the entire directory in arbitrary order\\n\\n Sort(Result); -- Result holds the directory in proper order\\n\\n -- print Result\\n for I in Result.First_Index .. Result.Last_Index loop\\n Put_Line(Result.Element(I));\\n end loop;\\nend Directory_List;\\n\",\n \"language\": \"Ada\"\n },\n {\n \"code\": \"record r;\\nfile f;\\ntext s;\\n\\nf.opendir(1.argv);\\n\\nwhile (~f.case(s)) {\\n if (s != \\\".\\\" && s != \\\"..\\\") {\\n r[s] = 0;\\n }\\n}\\n\\nr.vcall(o_, 0, \\\"\\\\n\\\");\\n\",\n \"language\": \"Aime\"\n },\n {\n \"code\": \"print list \\\".\\\"\\n\",\n \"language\": \"Arturo\"\n },\n {\n \"code\": \"# syntax: GAWK -f UNIX_LS.AWK * | SORT\\nBEGINFILE {\\n printf(\\\"%s\\\\n\\\",FILENAME)\\n nextfile\\n}\\nEND {\\n exit(0)\\n}\\n\",\n \"language\": \"AWK\"\n },\n {\n \"code\": \"' Emulate ls\\ncnt% = 0\\nfiles$ = \\\"\\\"\\nOPEN CURDIR$ FOR DIRECTORY AS mydir\\nGETFILE myfile$ FROM mydir\\nWHILE ISTRUE(LEN(myfile$))\\n IF LEFT$(myfile$, 1) != \\\".\\\" THEN\\n INCR cnt%\\n files$ = APPEND$(files$, cnt%, UNFLATTEN$(myfile$))\\n ENDIF\\n GETFILE myfile$ FROM mydir\\nWEND\\nCLOSE DIRECTORY mydir\\nIF cnt% > 0 THEN\\n FOR f$ IN SORT$(files$)\\n PRINT FLATTEN$(f$)\\n NEXT\\nENDIF\\n\",\n \"language\": \"BaCon\"\n },\n {\n \"code\": \"directory$ = dir(\\\"m:\\\\foo\\\\bar\\\\\\\")\\t#Specified directory\\n#directory$ = dir(currentdir)\\t#Current directory\\n\\nwhile directory$ <> \\\"\\\"\\n\\tprint directory$\\n\\tdirectory$ = dir()\\nend while\\nend\\n\",\n \"language\": \"BASIC256\"\n },\n {\n \"code\": \"#include <stdio.h>\\n#include <stdlib.h>\\n#include <string.h>\\n#include <limits.h>\\n#include <sys/types.h>\\n#include <dirent.h>\\n#include <unistd.h>\\n\\nint cmpstr(const void *a, const void *b)\\n{\\n return strcmp(*(const char**)a, *(const char**)b);\\n}\\n\\nint main(void)\\n{\\n DIR *basedir;\\n char path[PATH_MAX];\\n struct dirent *entry;\\n char **dirnames;\\n int diralloc = 128;\\n int dirsize = 0;\\n\\n if (!(dirnames = malloc(diralloc * sizeof(char*)))) {\\n perror(\\\"malloc error:\\\");\\n return 1;\\n }\\n\\n if (!getcwd(path, PATH_MAX)) {\\n perror(\\\"getcwd error:\\\");\\n return 1;\\n }\\n\\n if (!(basedir = opendir(path))) {\\n perror(\\\"opendir error:\\\");\\n return 1;\\n }\\n\\n while ((entry = readdir(basedir))) {\\n if (dirsize >= diralloc) {\\n diralloc *= 2;\\n if (!(dirnames = realloc(dirnames, diralloc * sizeof(char*)))) {\\n perror(\\\"realloc error:\\\");\\n return 1;\\n }\\n }\\n dirnames[dirsize++] = strdup(entry->d_name);\\n }\\n\\n qsort(dirnames, dirsize, sizeof(char*), cmpstr);\\n\\n int i;\\n for (i = 0; i < dirsize; ++i) {\\n if (dirnames[i][0] != '.') {\\n printf(\\\"%s\\\\n\\\", dirnames[i]);\\n }\\n }\\n\\n for (i = 0; i < dirsize; ++i)\\n free(dirnames[i]);\\n free(dirnames);\\n closedir(basedir);\\n return 0;\\n}\\n\",\n \"language\": \"C\"\n },\n {\n \"code\": \"#include <iostream>\\n#include <set>\\n#include <boost/filesystem.hpp>\\n\\nnamespace fs = boost::filesystem;\\n\\nint main(void)\\n{\\n fs::path p(fs::current_path());\\n std::set<std::string> tree;\\n\\n for (auto it = fs::directory_iterator(p); it != fs::directory_iterator(); ++it)\\n tree.insert(it->path().filename().native());\\n\\n for (auto entry : tree)\\n std::cout << entry << '\\\\n';\\n}\\n\",\n \"language\": \"C++\"\n },\n {\n \"code\": \"using System;\\nusing System.Collections.Generic;\\nusing System.IO;\\nusing System.Linq;\\nusing System.Threading.Tasks;\\n\\nnamespace Unix_ls\\n{\\n public class UnixLS\\n {\\n public static void Main(string[] args)\\n {\\n UnixLS ls = new UnixLS();\\n ls.list(args.Length.Equals(0) ? \\\".\\\" : args[0]);\\n }\\n\\n private void list(string folder)\\n {\\n foreach (FileSystemInfo fileSystemInfo in new DirectoryInfo(folder).EnumerateFileSystemInfos(\\\"*\\\", SearchOption.TopDirectoryOnly))\\n {\\n Console.WriteLine(fileSystemInfo.Name);\\n }\\n }\\n }\\n}\\n\",\n \"language\": \"C-sharp\"\n },\n {\n \"code\": \"(def files (sort (filter #(= \\\".\\\" (.getParent %)) (file-seq (clojure.java.io/file \\\".\\\")))))\\n\\n(doseq [n files] (println (.getName n)))\\n\",\n \"language\": \"Clojure\"\n },\n {\n \"code\": \"(defun files-list (&optional (path \\\".\\\"))\\n (let* ((dir (concatenate 'string path \\\"/\\\"))\\n (abs-path (car (directory dir)))\\n (file-pattern (concatenate 'string dir \\\"*\\\"))\\n (subdir-pattern (concatenate 'string file-pattern \\\"/\\\")))\\n (remove-duplicates\\n (mapcar (lambda (p) (enough-namestring p abs-path))\\n (mapcan #'directory (list file-pattern subdir-pattern)))\\n :test #'string-equal)))\\n\\n(defun ls (&optional (path \\\".\\\"))\\n (format t \\\"~{~a~%~}\\\" (sort (files-list path) #'string-lessp)))\\n\",\n \"language\": \"Common-Lisp\"\n },\n {\n \"code\": \"void main() {\\n import std.stdio, std.file, std.path, std.array, std.algorithm;\\n\\n foreach (const string path; dirEntries(getcwd, SpanMode.shallow).array.sort)\\n path.baseName.writeln;\\n}\\n\",\n \"language\": \"D\"\n },\n {\n \"code\": \"program LsCommand;\\n\\n{$APPTYPE CONSOLE}\\n\\n\\n\\nuses\\n System.SysUtils,\\n System.IoUtils;\\n\\nprocedure Ls(folder: string = '.');\\nvar\\n offset: Integer;\\n fileName: string;\\n\\n // simulate unix results in windows\\n\\n function ToUnix(path: string): string;\\n begin\\n Result := path.Replace('/', PathDelim, [rfReplaceAll])\\n end;\\n\\nbegin\\n folder := IncludeTrailingPathDelimiter(ToUnix(folder));\\n offset := length(folder);\\n\\n for fileName in TDirectory.GetFileSystemEntries(folder, '*') do\\n writeln(^I, ToUnix(fileName).Substring(offset));\\nend;\\n\\nbegin\\n writeln('cd foo'#10'ls');\\n ls('foo');\\n\\n writeln(#10'cd bar'#10'ls');\\n ls('foo/bar');\\n\\n {$IFNDEF LINUX} readln; {$ENDIF}\\nend.\\n\",\n \"language\": \"Delphi\"\n },\n {\n \"code\": \";; ls of stores (kind of folders)\\n(for-each writeln (list-sort < (local-stores))) →\\n AGES\\n NEMESIS\\n info\\n objects.dat\\n reader\\n system\\n user\\n words\\n\\n;; ls of \\\"NEMESIS\\\" store\\n(for-each writeln (local-keys \\\"NEMESIS\\\")) →\\n Alan\\n Glory\\n Jonah\\n\",\n \"language\": \"EchoLisp\"\n },\n {\n \"code\": \"iex(1)> ls = fn dir -> File.ls!(dir) |> Enum.each(&IO.puts &1) end\\n#Function<6.54118792/1 in :erl_eval.expr/5>\\niex(2)> ls.(\\\"foo\\\")\\nbar\\n:ok\\niex(3)> ls.(\\\"foo/bar\\\")\\n1\\n2\\na\\nb\\n:ok\\n\",\n \"language\": \"Elixir\"\n },\n {\n \"code\": \"1> Ls = fun(Dir) ->\\n1> {ok, DirContents} = file:list_dir(Dir),\\n1> [io:format(\\\"~s~n\\\", [X]) || X <- lists:sort(DirContents)]\\n1> end.\\n#Fun<erl_eval.6.36634728>\\n2> Ls(\\\"foo\\\").\\nbar\\n[ok]\\n3> Ls(\\\"foo/bar\\\").\\n1\\n2\\na\\nb\\n[ok,ok,ok,ok]\\n\",\n \"language\": \"Erlang\"\n },\n {\n \"code\": \"let ls = DirectoryInfo(\\\".\\\").EnumerateFileSystemInfos() |> Seq.map (fun i -> i.Name) |> Seq.sort |> Seq.iter (printfn \\\"%s\\\")\\n\",\n \"language\": \"F-Sharp\"\n },\n {\n \"code\": \"256 buffer: filename-buf\\n: each-filename { xt -- } \\\\ xt-consuming variant\\n s\\\" .\\\" open-dir throw { d }\\n begin filename-buf 256 d read-dir throw while\\n filename-buf swap xt execute\\n repeat d close-dir throw ;\\n\\n\\\\ immediate variant\\n: each-filename[ s\\\" .\\\" postpone sliteral ]] open-dir throw >r begin filename-buf 256 r@ read-dir throw while filename-buf swap [[ ; immediate compile-only\\n: ]each-filename ]] repeat drop r> close-dir throw [[ ; immediate compile-only\\n\\n: ls ( -- ) [: cr type ;] each-filename ;\\n\",\n \"language\": \"Forth\"\n },\n {\n \"code\": \": save-string ( c-addr u -- a )\\n dup 1+ allocate throw dup >r place r> ;\\n\\nrequire ffl/car.fs\\n: sorted-filenames ( -- car )\\n 0 car-new { a }\\n [: swap count rot count compare ;] a car-compare!\\n each-filename[ save-string a car-insert-sorted ]each-filename\\n a ;\\n\\n: each-sorted-filename ( xt -- )\\n sorted-filenames { a } a car-execute [: free throw ;] a car-execute a car-free ;\\n\\n: ls ( -- )\\n [: count cr type ;] each-sorted-filename ;\\n\",\n \"language\": \"Forth\"\n },\n {\n \"code\": \" PROGRAM LS\\t\\t!Names the files in the current directory.\\n USE DFLIB\\t\\t\\t!Mysterious library.\\n TYPE(FILE$INFO) INFO\\t!With mysterious content.\\n NAMELIST /HIC/INFO\\t!This enables annotated output.\\n INTEGER MARK,L\\t\\t!Assistants.\\n\\n MARK = FILE$FIRST\\t\\t!Starting state.\\nCall for the next file.\\n 10 L = GETFILEINFOQQ(\\\"*\\\",INFO,MARK)\\t!Mystery routine returns the length of the file name.\\n IF (MARK.EQ.FILE$ERROR) THEN\\t!Or possibly, not.\\n WRITE (6,*) \\\"Error!\\\",L\\t\\t!Something went wrong.\\n WRITE (6,HIC)\\t\\t\\t!Reveal INFO, annotated.\\n STOP \\\"That wasn't nice.\\\"\\t!Quite.\\n ELSE IF (IAND(INFO.PERMIT,FILE$DIR) .EQ. 0) THEN\\t!Not a directory.\\n IF (L.GT.0) WRITE (6,*) INFO.NAME(1:L)\\t!The object of the exercise!\\n END IF\\t\\t\\t\\t!So much for that entry.\\n IF (MARK.NE.FILE$LAST) GO TO 10\\t!Lastness is discovered after the last file is fingered.\\n END\\t!If FILE$LAST is not reached, \\\"system resources may be lost.\\\"\\n\",\n \"language\": \"Fortran\"\n },\n {\n \"code\": \" INTERFACE\\n\\tINTEGER*4 FUNCTION GETFILEINFOQQ(FILES, BUFFER,dwHANDLE)\\n!DEC$ ATTRIBUTES DEFAULT :: GETFILEINFOQQ\\n\\t CHARACTER*(*) FILES\\n\\t STRUCTURE / FILE$INFO /\\n\\t INTEGER*4 CREATION ! Creation time (-1 on FAT)\\n\\t INTEGER*4 LASTWRITE ! Last write to file\\n\\t INTEGER*4 LASTACCESS ! Last access (-1 on FAT)\\n\\t INTEGER*4 LENGTH ! Length of file\\n\\t INTEGER*2 PERMIT ! File access mode\\n\\t CHARACTER*255 NAME ! File name\\n\\t END STRUCTURE\\n\\t RECORD / FILE$INFO / BUFFER\\n\\t INTEGER*4 dwHANDLE\\n\\tEND FUNCTION\\n END INTERFACE\\n\",\n \"language\": \"Fortran\"\n },\n {\n \"code\": \"#include \\\"dir.bi\\\"\\n\\nSub ls(Byref filespec As String, Byval attrib As Integer)\\n Dim As String filename = Dir(filespec, attrib)\\n Do While Len(filename) > 0\\n Print filename\\n filename = Dir()\\n Loop\\nEnd Sub\\n\\nDim As String directory = \\\"\\\" ' Current directory\\nls(directory & \\\"*\\\", fbDirectory)\\nSleep\\n\",\n \"language\": \"FreeBASIC\"\n },\n {\n \"code\": \"for f = sort[files[\\\".\\\"], {|a,b| lexicalCompare[a.getName[], b.getName[]]}]\\n println[f.getName[]]\\n\",\n \"language\": \"Frink\"\n },\n {\n \"code\": \"import io.File\\n\\nfor f <- sort( list(File( \\\".\\\" ).list()).filterNot(s -> s.startsWith(\\\".\\\")) )\\n println( f )\\n\",\n \"language\": \"FunL\"\n },\n {\n \"code\": \"###sysinclude dir.uh\\n###sysinclude stringextra.uh\\n\\n###define COLORS\\n// delete the COLORS directive above if you do not want colored output!\\n{ „vonal” __usebigbossnamespace myself \\\"-\\\" 90 makestring() }\\n{ „points” __usebigbossnamespace myself \\\".\\\" 60 makestring() }\\n#g argc 3 < { \\\".\\\" }{ 2 argv } sto mypath\\n@mypath 'd !istrue { .\\\"The give directory doesn't exist! Exited.\\\\n\\\" end }\\n@mypath getdir { .\\\"Cannot load the dir! Aborted.\\\\n\\\" end } sto mydir\\n\\n@mydir ~d {\\n.\\\"Directories:\\\\n\\\"\\n@mydir ~d {| #s\\n@mydir 'd {} octalrights dup print free SPACE\\n@mydir 'd {} getfilename dup 37 stub print SPACE drop\\n@mydir 'd {} groupname ': !+\\n@mydir 'd {} ownername dup sto temp + dup 10 stub print free @temp free\\n@mydir 'd {} mtime dup print free\\nNL |}\\n@points sprint\\n@mydir ~d { .\\\"Total: \\\" @mydir ~d #g print .\\\" subdirectories.\\\\n\\\" }\\n@vonal sprint\\n}\\n@mydir ~r {\\n.\\\"Regular files:\\\\n\\\"\\n@mydir ~r {| #s\\n@mydir 'r {} octalrights dup print free SPACE\\n@mydir 'r {} getfilesize sbr §ifcolored\\n@mydir 'r {} executable { .\\\" >\\\" }{ .\\\" \\\" } SPACE\\n@mydir 'r {} getfilename dup 37 stub print SPACE drop\\n@mydir 'r {} groupname ': !+\\n@mydir 'r {} ownername dup sto temp + dup 10 stub print free @temp free\\n@mydir 'r {} mtime dup print free\\nNL |}\\n@points sprint\\n@mydir ~r { .\\\"Total: \\\" @mydir ~r #g print .\\\" regular files. \\\"\\n.\\\"TotalSize = \\\" @mydir 'r totalsize sbr §ifcolored NL\\n}\\n@vonal sprint\\n}\\n@mydir ~L {\\n.\\\"Symlinks:\\\\n\\\"\\n@mydir ~L {| #s\\n@mydir 'L {} octalrights dup print free SPACE\\n@mydir 'L {} executable { .\\\">\\\" }{ SPACE } SPACE\\n@mydir 'L {} getfilename dup 67 stub print SPACE drop\\n@mydir 'L {} broken { .\\\"--->\\\" }{ .\\\"===>\\\" } SPACE\\n@mydir 'L {} destination dup 30 stub print drop\\nNL |}\\n@points sprint\\n@mydir ~L { .\\\"Total: \\\" @mydir ~L #g print .\\\" symlinks.\\\\n\\\"\\n}\\n}\\n@vonal sprint\\n.\\\"Size, alltogether = \\\" @mydir alltotal sbr §ifcolored NL\\n@vonal sprint\\n@mydir free\\n.\\\"Free spaces: /* Total size of the filesystem is : \\\" @mypath filesystemsize dup sto filsize sbr §ifcolored .\\\" */\\\\n\\\"\\n.\\\" for non-privilegized use: \\\" @mypath freenonpriv dup sbr §ifcolored\\n#g 100 * @filsize / .\\\" ( \\\" print .\\\"% ) \\\" NL\\n.\\\" All available free space: \\\" @mypath totalfree dup sbr §ifcolored\\n#g 100 * @filsize / .\\\" ( \\\" print .\\\"% ) \\\" NL\\nend\\n\\nifcolored:\\n###ifdef COLORS\\ncoloredsize\\n###endif\\n###ifndef COLORS\\n#g !(#s) 21 >|\\n###endif\\ndup sprint free\\nrts\\n\\n{ „filsize” }\\n{ „mydir” }\\n{ „mypath” }\\n{ „temp” }\\n{ „makestring” #s * dup 10 !+ swap free #g = }\\n\",\n \"language\": \"Furor\"\n },\n {\n \"code\": \"Public Sub Main()\\nDim sDir As String[] = Dir(User.Home &/ \\\"test\\\").Sort()\\n\\nPrint sDir.Join(gb.NewLine)\\n\\nEnd\\n\",\n \"language\": \"Gambas\"\n },\n {\n \"code\": \"package main\\n\\nimport (\\n\\t\\\"fmt\\\"\\n\\t\\\"log\\\"\\n\\t\\\"os\\\"\\n\\t\\\"sort\\\"\\n)\\n\\nfunc main() {\\n\\tf, err := os.Open(\\\".\\\")\\n\\tif err != nil {\\n\\t\\tlog.Fatal(err)\\n\\t}\\n\\tfiles, err := f.Readdirnames(0)\\n\\tf.Close()\\n\\tif err != nil {\\n\\t\\tlog.Fatal(err)\\n\\t}\\n\\tsort.Strings(files)\\n\\tfor _, n := range files {\\n\\t\\tfmt.Println(n)\\n\\t}\\n}\\n\",\n \"language\": \"Go\"\n },\n {\n \"code\": \"import Control.Monad\\nimport Data.List\\nimport System.Directory\\n\\ndontStartWith = flip $ (/=) . head\\n\\nmain = do\\n files <- getDirectoryContents \\\".\\\"\\n mapM_ putStrLn $ sort $ filter (dontStartWith '.') files\\n\",\n \"language\": \"Haskell\"\n },\n {\n \"code\": \" dir '' NB. includes properties\\n >1 1 dir '' NB. plain filename as per task\\n\",\n \"language\": \"J\"\n },\n {\n \"code\": \"import java.io.File;\\nimport java.util.ArrayList;\\nimport java.util.Formatter;\\nimport java.util.List;\\n\\npublic class Ls {\\n public static void main(String[] args) throws Exception {\\n Ls ls = new Ls(\\\"/\\\");\\n System.out.println(ls);\\n }\\n\\n private final File directory;\\n private final List<File> list;\\n\\n public Ls(String path) throws Exception {\\n directory = new File(path);\\n if (!directory.exists())\\n throw new Exception(\\\"Path not found '%s'\\\".formatted(directory));\\n if (!directory.isDirectory())\\n throw new Exception(\\\"Not a directory '%s'\\\".formatted(directory));\\n list = new ArrayList<>(List.of(directory.listFiles()));\\n /* place the directories first */\\n list.sort((fileA, fileB) -> {\\n if (fileA.isDirectory() && fileB.isFile()) {\\n return -1;\\n } else if (fileA.isFile() && fileB.isDirectory()) {\\n return 1;\\n }\\n return 0;\\n });\\n }\\n\\n private String size(long bytes) {\\n if (bytes > 1E9) {\\n return \\\"%.1fG\\\".formatted(bytes / 1E9d);\\n } else if (bytes > 1E6) {\\n return \\\"%.1fM\\\".formatted(bytes / 1E6d);\\n } else if (bytes > 1E3) {\\n return \\\"%.1fK\\\".formatted(bytes / 1E3d);\\n } else {\\n return \\\"%d\\\".formatted(bytes);\\n }\\n }\\n\\n @Override\\n public String toString() {\\n StringBuilder string = new StringBuilder();\\n Formatter formatter = new Formatter(string);\\n /* add parent and current directory listings */\\n list.add(0, directory.getParentFile());\\n list.add(0, directory);\\n /* generate total used space value */\\n long total = 0;\\n for (File file : list) {\\n if (file == null) continue;\\n total += file.length();\\n }\\n formatter.format(\\\"total %s%n\\\", size(total));\\n /* generate output for each entry */\\n int index = 0;\\n for (File file : list) {\\n if (file == null) continue;\\n /* generate permission columns */\\n formatter.format(file.isDirectory() ? \\\"d\\\" : \\\"-\\\");\\n formatter.format(file.canRead() ? \\\"r\\\" : \\\"-\\\");\\n formatter.format(file.canWrite() ? \\\"w\\\" : \\\"-\\\");\\n formatter.format(file.canExecute() ? \\\"x\\\" : \\\"-\\\");\\n /* include size */\\n formatter.format(\\\"%7s \\\", size(file.length()));\\n /* modification timestamp */\\n formatter.format(\\\"%tb %1$td %1$tR \\\", file.lastModified());\\n /* file or directory name */\\n switch (index) {\\n case 0 -> formatter.format(\\\".\\\");\\n case 1 -> formatter.format(\\\"..\\\");\\n default -> formatter.format(\\\"%s\\\", file.getName());\\n }\\n if (file.isDirectory())\\n formatter.format(File.separator);\\n formatter.format(\\\"%n\\\");\\n index++;\\n }\\n formatter.flush();\\n return string.toString();\\n }\\n}\\n\",\n \"language\": \"Java\"\n },\n {\n \"code\": \"package rosetta;\\n\\nimport java.io.IOException;\\nimport java.nio.file.Files;\\nimport java.nio.file.Path;\\n\\npublic class UnixLS {\\n\\n\\tpublic static void main(String[] args) throws IOException {\\n\\t\\tFiles.list(Path.of(\\\"\\\")).sorted().forEach(System.out::println);\\n\\t}\\n}\\n\",\n \"language\": \"Java\"\n },\n {\n \"code\": \"Files.list(Path.of(\\\"\\\")).map(Path::toString).sorted(String.CASE_INSENSITIVE_ORDER).forEach(System.out::println);\\n\",\n \"language\": \"Java\"\n },\n {\n \"code\": \"const fs = require('fs');\\nfs.readdir('.', (err, names) => names.sort().map( name => console.log(name) ));\\n\",\n \"language\": \"JavaScript\"\n },\n {\n \"code\": \"puts(File.glob().sort().join('\\\\n'));\\n\",\n \"language\": \"Jsish\"\n },\n {\n \"code\": \"# v0.6.0\\n\\nfor e in readdir() # Current directory\\n println(e)\\nend\\n\\n# Same for...\\nreaddir(\\\"~\\\") # Read home directory\\nreaddir(\\\"~/documents\\\")\\n\",\n \"language\": \"Julia\"\n },\n {\n \"code\": \"// Version 1.2.41\\n\\nimport java.io.File\\n\\nfun ls(directory: String) {\\n val d = File(directory)\\n if (!d.isDirectory) {\\n println(\\\"$directory is not a directory\\\")\\n return\\n }\\n d.listFiles().map { it.name }\\n .sortedBy { it.toLowerCase() } // case insensitive\\n .forEach { println(it) }\\n}\\n\\nfun main(args: Array<String>) {\\n ls(\\\".\\\") // list files in current directory, say\\n}\\n\",\n \"language\": \"Kotlin\"\n },\n {\n \"code\": \"#!/bin/ksh\\n\\n# List everything in the current folder (sorted), similar to `ls`\\n\\n#\\t# Variables:\\n#\\ntargetDir=${1:-/tmp/foo}\\n\\n ######\\n# main #\\n ######\\n\\ncd ${targetDir}\\nfor obj in *; do\\n\\tprint ${obj}\\ndone\\n\",\n \"language\": \"Ksh\"\n },\n {\n \"code\": \"set the defaultFolder to \\\"/foo\\\"\\nput the folders & the files\\nset the defaultFolder to \\\"/foo/bar\\\"\\nput the folders & the files\\n\",\n \"language\": \"LiveCode\"\n },\n {\n \"code\": \"require(\\\"lfs\\\")\\nfor file in lfs.dir(\\\".\\\") do print(file) end\\n\",\n \"language\": \"Lua\"\n },\n {\n \"code\": \"Column[FileNames[]]\\n\",\n \"language\": \"Mathematica\"\n },\n {\n \"code\": \"import Nanoquery.IO\\nimport sort\\n\\nfnames = sort(new(File).listDir(\\\".\\\"))\\n\\nfor i in range(0, len(fnames) - 1)\\n println fnames[i]\\nend\\n\",\n \"language\": \"Nanoquery\"\n },\n {\n \"code\": \"from algorithm import sorted\\nfrom os import walkPattern\\nfrom sequtils import toSeq\\n\\nfor path in toSeq(walkPattern(\\\"*\\\")).sorted:\\n echo path\\n\",\n \"language\": \"Nim\"\n },\n {\n \"code\": \"class Test {\\n function : Main(args : String[]) ~ Nil {\\n file_names := System.IO.File.Directory->List(\\\".\\\");\\n each(i : file_names) {\\n file_name := file_names[i];\\n if(System.IO.File.Directory->Exists(file_name)) {\\n file_name += '/';\\n };\\n file_name->PrintLine();\\n };\\n }\\n}\\n\",\n \"language\": \"Objeck\"\n },\n {\n \"code\": \"let () =\\n Array.iter print_endline (\\n Sys.readdir Sys.argv.(1) )\\n\",\n \"language\": \"OCaml\"\n },\n {\n \"code\": \"system(\\\"dir/b/on\\\")\\n\",\n \"language\": \"PARI-GP\"\n },\n {\n \"code\": \"system(\\\"ls\\\")\\n\",\n \"language\": \"PARI-GP\"\n },\n {\n \"code\": \"Program ls;\\t{To list the names of all files/directories in the current directory.}\\n Uses DOS;\\n var DirInfo: SearchRec;\\t{Predefined. See page 403 of the Turbo Pascal 4 manual.}\\n BEGIN\\n FindFirst('*.*',AnyFile,DirInfo);\\t{AnyFile means any file name OR directory name.}\\n While DOSerror = 0 do\\t\\t\\t{Result of FindFirst/Next not being a function, damnit.}\\n begin\\n WriteLn(DirInfo.Name);\\n FindNext(DirInfo);\\n end;\\n END.\\n\",\n \"language\": \"Pascal\"\n },\n {\n \"code\": \"###sysinclude standard.uh\\n###sysinclude args.uh\\n###sysinclude io.uh\\n###sysinclude str.uh\\n\\n###define COLORS\\n// delete the COLORS directive above if you do not want colored output!\\n#g argc 3 < { \\\".\\\" }{ 2 argv } sto mypath\\n@mypath 'd inv istrue { .\\\"The given directory doesn't exist! Exited.\\\\n\\\" end }\\n@mypath getdir { .\\\"Cannot load the dir! Aborted.\\\\n\\\" end } sto mydir\\n'- 90 *... sto vonal\\n'. 60 *... sto points\\n\\n@mydir ~d {\\n.\\\"Directories:\\\\n\\\"\\n@mydir ~d {{ #s\\n@mydir 'd {{}} octalrights dup print inv mem SPACE\\n@mydir 'd {{}} getfilename dup 67 mc print SPACE drop\\n@mydir 'd {{}} groupname ': !+\\n@mydir 'd {{}} ownername dup sto temp + dup 10 mc print inv mem @temp inv mem\\n@mydir 'd {{}} mtime dup print inv mem\\nNL }}\\n@points sprintnl\\n@mydir ~d { .\\\"Total: \\\" @mydir ~d #g print .\\\" subdirectories.\\\\n\\\" }\\n@vonal sprintnl\\n}\\n\\n@mydir ~r {\\n.\\\"Regular files:\\\\n\\\"\\n@mydir ~r {{ #s\\n@mydir 'r {{}} octalrights dup print inv mem SPACE\\n@mydir 'r {{}} getfilesize sbr §ifcolored\\n@mydir 'r {{}} executable { .\\\" >\\\" }{ .\\\" \\\" } SPACE\\n@mydir 'r {{}} getfilename dup 67 mc print SPACE drop\\n@mydir 'r {{}} groupname ': !+\\n@mydir 'r {{}} ownername dup sto temp + dup 10 mc print inv mem @temp inv mem\\n@mydir 'r {{}} mtime dup print inv mem\\nNL }}\\n@points sprintnl\\n@mydir ~r { .\\\"Total: \\\" @mydir ~r #g print .\\\" regular files. \\\"\\n.\\\"TotalSize = \\\" @mydir 'r totalsize sbr §ifcolored NL\\n}\\n@vonal sprintnl\\n}\\n@mydir ~L {\\n.\\\"Symlinks:\\\\n\\\"\\n@mydir ~L {{ #s\\n@mydir 'L {{}} octalrights dup print inv mem SPACE\\n@mydir 'L {{}} executable { .\\\">\\\" }{ SPACE } SPACE\\n@mydir 'L {{}} getfilename dup 67 mc print SPACE drop\\n@mydir 'L {{}} broken { .\\\"--->\\\" }{ .\\\"===>\\\" } SPACE\\n@mydir 'L {{}} destination dup 30 mc print drop\\nNL }}\\n@points sprintnl\\n@mydir ~L { .\\\"Total: \\\" @mydir ~L #g print .\\\" symlinks.\\\\n\\\"\\n}\\n}\\n@vonal sprintnl\\n.\\\"Size, alltogether = \\\" @mydir alltotal sbr §ifcolored NL\\n@vonal sprintnl\\n\\n\\n@mydir inv mem\\n\\n.\\\"free spaces: /* Total size of the filesystem is : \\\" @mypath filesystemsize dup sto filsize sbr §ifcolored .\\\" */\\\\n\\\"\\n.\\\" for non-privilegized use: \\\" @mypath freenonpriv dup sbr §ifcolored\\n#g 100 * @filsize / .\\\" ( \\\" print .\\\"% ) \\\" NL\\n.\\\" All available free space: \\\" @mypath totalfree dup sbr §ifcolored\\n#g 100 * @filsize / .\\\" ( \\\" print .\\\"% ) \\\" NL\\n@vonal inv mem\\nend\\n\\nifcolored:\\n###ifdef COLORS\\ncoloredsize\\n###endif\\n###ifndef COLORS\\n#g !(#s) 21 >|\\n###endif\\ndup sprint inv mem\\nrts\\n\\n{ „filsize” }\\n{ „mydir” }\\n{ „mypath” }\\n{ „temp” }\\n{ „vonal” }\\n{ „points” }\\n\",\n \"language\": \"Peri\"\n },\n {\n \"code\": \"opendir my $handle, '.' or die \\\"Couldnt open current directory: $!\\\";\\nwhile (readdir $handle) {\\n print \\\"$_\\\\n\\\";\\n}\\nclosedir $handle;\\n\",\n \"language\": \"Perl\"\n },\n {\n \"code\": \"print \\\"$_\\\\n\\\" for glob '*';\\n\",\n \"language\": \"Perl\"\n },\n {\n \"code\": \"print \\\"$_\\\\n\\\" for glob '* .*'; # If you want to include dot files\\n\",\n \"language\": \"Perl\"\n },\n {\n \"code\": \"-->\\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: #7060A8;\\\">pp</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #7060A8;\\\">dir</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #008000;\\\">\\\".\\\"</span><span style=\\\"color: #0000FF;\\\">),{</span><span style=\\\"color: #004600;\\\">pp_Nest</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #004600;\\\">pp_IntCh</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #004600;\\\">false</span><span style=\\\"color: #0000FF;\\\">})</span>\\n<!--\\n\",\n \"language\": \"Phix\"\n },\n {\n \"code\": \"-->\\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: #7060A8;\\\">vslice</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #7060A8;\\\">dir</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #008000;\\\">\\\".\\\"</span><span style=\\\"color: #0000FF;\\\">),</span><span style=\\\"color: #004600;\\\">D_NAME</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;\\\">dirf</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #004080;\\\">string</span> <span style=\\\"color: #000000;\\\">path</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #004080;\\\">integer</span> <span style=\\\"color: #000000;\\\">date_type</span><span style=\\\"color: #0000FF;\\\">=</span><span style=\\\"color: #004600;\\\">D_MODIFICATION</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: #008080;\\\">return</span> <span style=\\\"color: #0000FF;\\\">{{</span><span style=\\\"color: #008000;\\\">`.`</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #008000;\\\">`d`</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">0</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">2022</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">2</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">11</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">01</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">09</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">13</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;\\\">`d`</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">0</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">2022</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">2</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">11</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">01</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">09</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">13</span><span style=\\\"color: #0000FF;\\\">},</span>\\n <span style=\\\"color: #0000FF;\\\">{</span><span style=\\\"color: #008000;\\\">`.fake`</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #008000;\\\">`a`</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">5</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">2021</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">6</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><span style=\\\"color: #000000;\\\">42</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: #008000;\\\">`directory`</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #008000;\\\">`a`</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">18898</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">2020</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">4</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">4</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">13</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">57</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">37</span><span style=\\\"color: #0000FF;\\\">},</span>\\n <span style=\\\"color: #0000FF;\\\">{</span><span style=\\\"color: #008000;\\\">`for.p2js`</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #008000;\\\">`a`</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">1024</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">2019</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">7</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">28</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">15</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">30</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">45</span><span style=\\\"color: #0000FF;\\\">}}</span>\\n <span style=\\\"color: #008080;\\\">else</span>\\n <span style=\\\"color: #008080;\\\">return</span> <span style=\\\"color: #7060A8;\\\">dir</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">path</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">date_type</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;\\\">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 <span style=\\\"color: #7060A8;\\\">set_timedate_formats</span><span style=\\\"color: #0000FF;\\\">({</span><span style=\\\"color: #008000;\\\">\\\"hh:mmpm Ddd Mmm ddth YYYY\\\"</span><span style=\\\"color: #0000FF;\\\">})</span>\\n <span style=\\\"color: #004080;\\\">object</span> <span style=\\\"color: #000000;\\\">d</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">dirf</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #008000;\\\">\\\".\\\"</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;\\\">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;\\\">\\\"%-20s %s %10s %s\\\\n\\\"</span><span style=\\\"color: #0000FF;\\\">,{</span><span style=\\\"color: #008000;\\\">\\\"-- name --\\\"</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #008000;\\\">\\\"attr\\\"</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #008000;\\\">\\\"size\\\"</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #008000;\\\">\\\"-- time and date --\\\"</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;\\\">d</span><span style=\\\"color: #0000FF;\\\">)</span> <span style=\\\"color: #008080;\\\">do</span>\\n <span style=\\\"color: #004080;\\\">sequence</span> <span style=\\\"color: #000000;\\\">di</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">d</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">i</span><span style=\\\"color: #0000FF;\\\">]</span>\\n <span style=\\\"color: #004080;\\\">string</span> <span style=\\\"color: #000000;\\\">name</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">di</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #004600;\\\">D_NAME</span><span style=\\\"color: #0000FF;\\\">],</span>\\n <span style=\\\"color: #000000;\\\">attr</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">di</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #004600;\\\">D_ATTRIBUTES</span><span style=\\\"color: #0000FF;\\\">],</span>\\n <span style=\\\"color: #000000;\\\">size</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">file_size_k</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">d</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">i</span><span style=\\\"color: #0000FF;\\\">][</span><span style=\\\"color: #004600;\\\">D_SIZE</span><span style=\\\"color: #0000FF;\\\">]),</span>\\n <span style=\\\"color: #000000;\\\">tdte</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">format_timedate</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">d</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">i</span><span style=\\\"color: #0000FF;\\\">][</span><span style=\\\"color: #004600;\\\">D_YEAR</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;\\\">\\\"%-20s %=4s %10s %s\\\\n\\\"</span><span style=\\\"color: #0000FF;\\\">,{</span><span style=\\\"color: #000000;\\\">name</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">attr</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">size</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">tdte</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<!--\\n\",\n \"language\": \"Phix\"\n },\n {\n \"code\": \"<?php\\nforeach(scandir('.') as $fileName){\\n echo $fileName.\\\"\\\\n\\\";\\n}\\n\",\n \"language\": \"PHP\"\n },\n {\n \"code\": \"import os, util.\\nmain =>\\n println(ls()),\\n println(ls(\\\"foo/bar\\\")).\\n\\nls() = ls(\\\".\\\").\\nls(Path) = [F : F in listdir(Path), F != \\\".\\\",F != \\\"..\\\"].sort.join('\\\\n').\\n\",\n \"language\": \"Picat\"\n },\n {\n \"code\": \"(for F (sort (dir))\\n (prinl F) )\\n\",\n \"language\": \"PicoLisp\"\n },\n {\n \"code\": \"foreach(sort(get_dir()), string file)\\n write(file +\\\"\\\\n\\\");\\n\",\n \"language\": \"Pike\"\n },\n {\n \"code\": \"# Prints Name, Length, Mode, and LastWriteTime\\nGet-ChildItem | Sort-Object Name | Write-Output\\n\\n# Prints only the name of each file in the directory\\nGet-ChildItem | Sort-Object Name | ForEach-Object Name | Write-Output\\n\",\n \"language\": \"PowerShell\"\n },\n {\n \"code\": \"NewList lslist.s()\\n\\nIf OpenConsole(\\\"ls-sim\\\")\\n If ExamineDirectory(0,GetCurrentDirectory(),\\\"*.*\\\")\\n While NextDirectoryEntry(0)\\n AddElement(lslist()) : lslist()=DirectoryEntryName(0)\\n Wend\\n FinishDirectory(0)\\n SortList(lslist(),#PB_Sort_Ascending)\\n ForEach lslist()\\n PrintN(lslist())\\n Next\\n EndIf\\n Input()\\nEndIf\\n\",\n \"language\": \"PureBasic\"\n },\n {\n \"code\": \">>> import os\\n>>> print('\\\\n'.join(sorted(os.listdir('.'))))\\nDLLs\\nDoc\\nLICENSE.txt\\nLib\\nNEWS.txt\\nREADME.txt\\nScripts\\nTools\\ninclude\\nlibs\\npython.exe\\npythonw.exe\\ntcl\\n>>>\\n\",\n \"language\": \"Python\"\n },\n {\n \"code\": \"cat(paste(list.files(), collapse = \\\"\\\\n\\\"), \\\"\\\\n\\\")\\ncat(paste(list.files(\\\"bar\\\"), collapse = \\\"\\\\n\\\"), \\\"\\\\n\\\")\\n\",\n \"language\": \"R\"\n },\n {\n \"code\": \"#lang racket/base\\n\\n;; Racket's `directory-list' produces a sorted list of files\\n(define (ls) (for-each displayln (directory-list)))\\n\\n;; Code to run when this file is running directly\\n(module+ main\\n (ls))\\n\\n(module+ test\\n (require tests/eli-tester racket/port racket/file)\\n (define (make-directory-tree)\\n (make-directory* \\\"foo/bar\\\")\\n (for ([f '(\\\"1\\\" \\\"2\\\" \\\"a\\\" \\\"b\\\")])\\n (with-output-to-file (format \\\"foo/bar/~a\\\"f) #:exists 'replace newline)))\\n (make-directory-tree)\\n (define (ls/str dir)\\n (parameterize ([current-directory dir]) (with-output-to-string ls)))\\n (test (ls/str \\\"foo\\\") => \\\"bar\\\\n\\\"\\n (ls/str \\\"foo/bar\\\") => \\\"1\\\\n2\\\\na\\\\nb\\\\n\\\"))\\n\",\n \"language\": \"Racket\"\n },\n {\n \"code\": \".say for sort ~«dir\\n\",\n \"language\": \"Raku\"\n },\n {\n \"code\": \"/*REXX program lists contents of current folder (ala mode UNIX's LS). */\\n'DIR /b /oN' /*use Windows DIR: sorts & lists.*/\\n /*stick a fork in it, we're done.*/\\n\",\n \"language\": \"REXX\"\n },\n {\n \"code\": \"Dir.foreach(\\\"./\\\"){|n| puts n}\\n\",\n \"language\": \"Ruby\"\n },\n {\n \"code\": \"files #f, DefaultDir$ + \\\"\\\\*.*\\\" \\t' RunBasic Default directory.. Can be any directroy\\nprint \\\"rowcount: \\\";#f ROWCOUNT()\\t\\t' how many rows in directory\\n#f DATEFORMAT(\\\"mm/dd/yy\\\") \\t\\t\\t'set format of file date or not\\n#f TIMEFORMAT(\\\"hh:mm:ss\\\") \\t\\t\\t'set format of file time or not\\ncount = #f rowcount()\\nfor i = 1 to count\\t\\t\\t\\t' loop thru the row count\\nprint \\\"info: \\\";#f nextfile$()\\t\\t\\t' file info\\nprint \\\"name: \\\";#f NAME$()\\t\\t\\t' Name of file\\nprint \\\"size: \\\";#f SIZE()\\t\\t\\t' size\\nprint \\\"date: \\\";#f DATE$()\\t\\t\\t' date\\nprint \\\"time: \\\";#f TIME$()\\t\\t\\t' time\\nprint \\\"isdir: \\\";#f ISDIR()\\t\\t\\t' 1 = is a directory\\nnext\\n\",\n \"language\": \"Run-BASIC\"\n },\n {\n \"code\": \"use std::{env, fmt, fs, process};\\nuse std::io::{self, Write};\\nuse std::path::Path;\\n\\nfn main() {\\n let cur = env::current_dir().unwrap_or_else(|e| exit_err(e, 1));\\n let arg = env::args().nth(1);\\n print_files(arg.as_ref().map_or(cur.as_path(), |p| Path::new(p)))\\n .unwrap_or_else(|e| exit_err(e, 2));\\n}\\n\\n#[inline]\\nfn print_files(path: &Path) -> io::Result<()> {\\n for x in try!(fs::read_dir(path)) {\\n println!(\\\"{}\\\", try!(x).file_name().to_string_lossy());\\n }\\n Ok(())\\n}\\n\\n#[inline]\\nfn exit_err<T>(msg: T, code: i32) -> ! where T: fmt::Display {\\n writeln!(&mut io::stderr(), \\\"{}\\\", msg).expect(\\\"Could not write to stderr\\\");\\n process::exit(code)\\n}\\n\",\n \"language\": \"Rust\"\n },\n {\n \"code\": \"variable d = listdir(getcwd()), p;\\nforeach p (array_sort(d))\\n () = printf(\\\"%s\\\\n\\\", d[p] );\\n\",\n \"language\": \"S-lang\"\n },\n {\n \"code\": \"$ include \\\"seed7_05.s7i\\\";\\n include \\\"osfiles.s7i\\\";\\n\\nconst proc: main is func\\n local\\n var string: name is \\\"\\\";\\n begin\\n for name range readDir(\\\".\\\") do\\n writeln(name);\\n end for;\\n end func;\\n\",\n \"language\": \"Seed7\"\n },\n {\n \"code\": \"var content = [];\\nDir.cwd.open.each { |file|\\n file ~~ < . .. > && next;\\n content.append(file);\\n}\\n\\ncontent.sort.each { |file|\\n say file;\\n}\\n\",\n \"language\": \"Sidef\"\n },\n {\n \"code\": \"'*'.glob.each { |file|\\n say file;\\n}\\n\",\n \"language\": \"Sidef\"\n },\n {\n \"code\": \"Stdout printCR: ( PipeStream outputFromCommand:'ls' )\\n\",\n \"language\": \"Smalltalk\"\n },\n {\n \"code\": \"Stdout printCR:('.' asFilename directoryContents sort asStringWith:Character cr)\\n\",\n \"language\": \"Smalltalk\"\n },\n {\n \"code\": \"'.' asFilename directoryContents sort do:#printCR\\n\",\n \"language\": \"Smalltalk\"\n },\n {\n \"code\": \"dir := '.' asFilename.\\ndir directoryContentsAsFilenames sort do:[:fn |\\n |line|\\n \\\"\\n generate a line of the form of ls -l:\\n drwxrwxrwx user group size date time name\\n where year is printed if not current, time of day otherwise\\n \\\"\\n line := String streamContents:[:s |\\n |accessRights|\\n\\n s nextPut:(fn isDirectory ifTrue:[$d] ifFalse:[$-]).\\n accessRights := fn symbolicAccessRights.\\n #( readUser writeUser executeUser\\n readGroup writeGroup executeGroup\\n readOthers writeOthers executeOthers\\n )\\n with:'rwxrwxrwx'\\n do:[:eachRight :charToPrint |\\n s nextPut:((accessRights includes:eachRight) ifTrue:[charToPrint] ifFalse:[$-])\\n ].\\n (OperatingSystem getUserNameFromID:fn info uid) printOn:s leftPaddedTo:10.\\n (OperatingSystem getGroupNameFromID:fn info gid) printOn:s leftPaddedTo:10.\\n fn fileSize printOn:s leftPaddedTo:12.\\n fn modificationTime year = Date today year ifTrue:[\\n fn modificationTime printOn:s format:' %(dayPadded) %(ShortMonthName) %h:%m'.\\n ] ifFalse:[\\n fn modificationTime asDate printOn:s format:' %(dayPadded) %(ShortMonthName) %y'.\\n ].\\n s space.\\n s nextPutAll:fn baseName\\n ].\\n line printCR\\n].\\n\",\n \"language\": \"Smalltalk\"\n },\n {\n \"code\": \"OS.Process.system \\\"ls -a\\\"\\n\",\n \"language\": \"Standard-ML\"\n },\n {\n \"code\": \"local (* make a sort function *)\\n val rec insert = fn s :string =>fn [] => [s]\\n\\t| ll as h::t => if s<=h then s::ll else h::insert s t;\\nin\\n val rec sort = fn [] => [] | h::t => insert h (sort t)\\nend;\\n\\nopen Posix.FileSys ;\\nval istream = opendir \\\".\\\" ;\\nval ll = ref [readdir istream] ;\\nwhile ( isSome (hd (!ll)) ) do ( ll:=readdir istream :: !ll );\\nval result = List.map valOf (tl (!ll));\\nclosedir istream ;\\n\\nsort result;\\n\",\n \"language\": \"Standard-ML\"\n },\n {\n \"code\": \". dir *.dta\\n 6.3k 6/12/17 14:26 auto.dta\\n 2.3k 8/10/17 7:34 titanium.dta\\n 6.0k 8/12/17 9:28 trend.dta\\n\",\n \"language\": \"Stata\"\n },\n {\n \"code\": \"puts [join [lsort [glob -nocomplain *]] \\\"\\\\n\\\"]\\n\",\n \"language\": \"Tcl\"\n },\n {\n \"code\": \"echo *\\n\",\n \"language\": \"UNIX-Shell\"\n },\n {\n \"code\": \"for f in *; do echo \\\"$f\\\"; done\\n\",\n \"language\": \"UNIX-Shell\"\n },\n {\n \"code\": \"for f in *; do echo \\\"$f\\\"; done |sort\\n\",\n \"language\": \"UNIX-Shell\"\n },\n {\n \"code\": \"stat -c %n * |sort\\n\",\n \"language\": \"UNIX-Shell\"\n },\n {\n \"code\": \"decl file f\\ndecl string<> fnames\\nset fnames (sort (f.listdir \\\".\\\"))\\n\\nfor (decl int i) (< i (size fnames)) (inc i)\\n out fnames<i> endl console\\nend for\\n\",\n \"language\": \"Ursa\"\n },\n {\n \"code\": \"import os\\n\\nfn main() {\\n\\tcontents := os.ls('.')?\\n println(contents)\\n}\\n\",\n \"language\": \"V-(Vlang)\"\n },\n {\n \"code\": \"import \\\"io\\\" for Directory\\n\\nvar path = \\\"./\\\" // or whatever\\n\\n// Note that output is automatically sorted using this method.\\nDirectory.list(path).each { |f| System.print(f) }\\n\",\n \"language\": \"Wren\"\n },\n {\n \"code\": \"string 0;\\nchar S;\\n[S:= \\\"ls\\\";\\nasm { ldr r0, S\\n bl system\\n }\\n]\\n\",\n \"language\": \"XPL0\"\n },\n {\n \"code\": \"File.glob(\\\"*\\\").sort()\\n\",\n \"language\": \"Zkl\"\n },\n {\n \"code\": \"File.glob(\\\"*\\\",0x8).sort()\\n\",\n \"language\": \"Zkl\"\n },\n {\n \"code\": \"File.globular(\\\"Src\\\",*,True,0x10,List).sort().concat(\\\"\\\\n\\\")\\n\",\n \"language\": \"Zkl\"\n }\n]","isConversational":false},"task_name":{"kind":"string","value":"Unix-ls"}}},{"rowIdx":1785,"cells":{"solutions":{"kind":"list like","value":[{"code":"---\nfrom: http://rosettacode.org/wiki/Unprimeable_numbers\nnote: Prime Numbers\n","language":"00-META"},{"code":";Definitions:\nAs used here, all unprimeable numbers (positive integers) are always expressed in base ten.\n\n\n───── Definition from OEIS ─────:\n<br>Unprimeable numbers are composite numbers that always remain composite when a single decimal digit of the number is changed.\n\n\n───── Definition from Wiktionary (referenced from Adam Spencer's book) ─────:\n<br>(''arithmetic'') that cannot be turned into a prime number by changing just one of its digits to any other\ndigit. (<small>sic</small>)\n\n\n\n'''Unprimeable''' numbers are also spelled: '''unprimable'''.\n\nAll one─ and two─digit numbers can be turned into primes by changing a single decimal digit.\n\n\n;Examples:\n'''190''' isn't unprimeable, because by changing the zero digit into a three yields '''193''', which is a prime.\n\n\n\nThe number '''200''' <u>is</u> unprimeable, since none of the numbers '''201, 202, 203, ··· 209''' are\nprime, and all the other numbers obtained by changing a single digit to\nproduce '''100, 300, 400, ··· 900''', or '''210, 220, 230, ··· 290''' which are all even.\n\n\nIt is valid to change '''189''' into '''089''' by changing the '''1''' (one) into\na '''0''' (zero), which then the leading zero can be removed, and then treated as if\nthe \"new\" number is '''89'''.\n\n\n;Task:\n::* show the first '''35''' unprimeable numbers (horizontally, on one line, preferably with a title)\n::* show the '''600<sup>th</sup>''' unprimeable number\n::* (optional) show the lowest unprimeable number ending in a specific decimal digit ('''0, 1, 2, 3, 4, 5, 6, 7, 8, 9''')\n::* (optional) use commas in the numbers where appropriate\n\n\nShow all output here, on this page.\n\n\n;Also see:\n:* the OEIS entry: [https://oeis.org/A118118 A118118 (unprimeable)]\n:* with some useful counts to compare [http://www.numbersaplenty.com/set/unprimeable_number/ unprimeable number]\n:* the Wiktionary entry (reference from below): [https://en.wiktionary.org/wiki/unprimeable (arithmetic definition) unprimeable]\n:* from the Adam Spencer book (page 200): ''Adam Spencer's World of Numbers'' (Xoum Publishing)\n<br><br>\n\n","language":"00-TASK"},{"code":"V limit = 10'000'000\nV is_prime = [0B] * 2 [+] [1B] * (limit - 1)\nL(n) 0 .< Int(limit ^ 0.5 + 1.5)\n I is_prime[n]\n L(i) (n * n .< limit + 1).step(n)\n is_prime[i] = 0B\n\nF unprimeable(a)\n I :is_prime[a]\n R 0B\n V d = 1\n L d <= a\n V base = (a I/ (d * 10)) * (d * 10) + (a % d)\n I any((base .< base + d * 10).step(d).map(y -> :is_prime[y]))\n R 0B\n d *= 10\n R 1B\n\nF unprime(n)\n [Int] r\n L(a) 1..\n I unprimeable(a)\n r [+]= a\n I r.len == n\n L.break\n R r\n\nprint(‘First 35:’)\nprint(unprime(35).map(i -> String(i)).join(‘ ’))\n\nprint(\"\\nThe 600-th:\")\nprint(unprime(600).last)\nprint()\n\nV first = [0] * 10\nV need = 10\nL(p) 1..\n I unprimeable(p)\n V i = p % 10\n I first[i] != 0\n L.continue\n\n first[i] = p\n I --need == 0\n L.break\n\nL(v) first\n print(L.index‘ ending: ’v)\n","language":"11l"},{"code":"BEGIN # find unprimable numbers - numbers which can't be made into a prime by changing one digit #\n # construct a sieve of primes up to max prime #\n PR read \"primes.incl.a68\" PR\n INT max prime = 9 999 999;\n []BOOL prime = PRIMESIEVE max prime;\n # returns TRUE if n is unprimeable, FALSE otherwise #\n PROC is unprimeable = ( INT n )BOOL:\n IF n < 100\n THEN FALSE\n ELIF prime[ n ]\n THEN FALSE\n ELIF\n # need to try changing a digit #\n INT last digit = n MOD 10;\n INT leading digits = n - last digit;\n prime[ leading digits + 1 ]\n THEN FALSE\n ELIF prime[ leading digits + 3 ] THEN FALSE\n ELIF prime[ leading digits + 7 ] THEN FALSE\n ELIF prime[ leading digits + 9 ] THEN FALSE\n ELIF last digit = 2 OR last digit = 5\n THEN\n # the final digit is 2 or 5, changing the other digits can't make a prime #\n # unless there is only one other digit which we change to 0 #\n INT v := leading digits;\n INT dc := 1;\n WHILE ( v OVERAB 10 ) > 0 DO IF v MOD 10 /= 0 THEN dc +:= 1 FI OD;\n dc /= 2\n ELIF NOT ODD last digit\n THEN TRUE # last digit is even - can't make a prime #\n ELSE\n # last digit is 1, 3, 7, 9: must try changing the other digoits #\n INT m10 := 10;\n INT r10 := 100;\n BOOL result := TRUE;\n WHILE result AND n > r10 DO\n INT base = ( ( n OVER r10 ) * r10 ) + ( n MOD m10 );\n FOR i FROM 0 BY m10 WHILE result AND i < r10 DO\n result := NOT prime[ base + i ]\n OD;\n m10 *:= 10;\n r10 *:= 10\n OD;\n IF result THEN\n # still not unprimeable, try changing the first digit #\n INT base = n MOD m10;\n FOR i FROM 0 BY m10 WHILE result AND i < r10 DO\n result := NOT prime[ base + i ]\n OD\n FI;\n result\n FI # is unprimeable # ;\n # returns a string representation of n with commas #\n PROC commatise = ( LONG LONG INT n )STRING:\n BEGIN\n STRING result := \"\";\n STRING unformatted = whole( n, 0 );\n INT ch count := 0;\n FOR c FROM UPB unformatted BY -1 TO LWB unformatted DO\n IF ch count <= 2 THEN ch count +:= 1\n ELSE ch count := 1; \",\" +=: result\n FI;\n unformatted[ c ] +=: result\n OD;\n result\n END; # commatise #\n # find unprimeable numbers #\n INT u count := 0;\n INT d count := 0;\n [ 0 : 9 ]INT first unprimeable := []INT( 0, 0, 0, 0, 0, 0, 0, 0, 0, 0 )[ AT 0 ];\n FOR i FROM 100 WHILE i < UPB prime AND d count < 10 DO\n IF is unprimeable( i ) THEN\n u count +:= 1;\n IF u count = 1 THEN\n print( ( \"First 35 unprimeable numbers: \", whole( i, 0 ) ) )\n ELIF u count <= 35 THEN\n print( ( \" \", whole( i, 0 ) ) )\n ELIF u count = 600 THEN\n print( ( newline, \"600th unprimeable number: \", commatise( i ) ) )\n FI;\n INT final digit = i MOD 10;\n IF first unprimeable[ final digit ] = 0 THEN\n # first unprimeable number with this final digit #\n d count +:= 1;\n first unprimeable[ final digit ] := i\n FI\n FI\n OD;\n # show the first unprimeable number that ends with each digit #\n print( ( newline ) );\n FOR i FROM 0 TO 9 DO\n print( ( \"First unprimeable number ending in \"\n , whole( i, 0 )\n , \": \"\n , commatise( first unprimeable[ i ] )\n , newline\n )\n )\n OD\nEND\n","language":"ALGOL-68"},{"code":"unprimeable?: function [n][\n if prime? n -> return false\n nd: to :string n\n loop.with:'i nd 'prevDigit [\n loop `0`..`9` 'newDigit [\n if newDigit <> prevDigit [\n nd\\[i]: newDigit\n if prime? to :integer nd -> return false\n ]\n ]\n nd\\[i]: prevDigit\n ]\n return true\n]\n\ncnt: 0\nx: 1\nunprimeables: []\nwhile [cnt < 600][\n if unprimeable? x [\n unprimeables: unprimeables ++ x\n cnt: cnt + 1\n ]\n x: x + 1\n]\n\nprint \"First 35 unprimeable numbers:\"\nprint first.n: 35 unprimeables\nprint \"\"\nprint [\"600th unprimeable number:\" last unprimeables]\n","language":"Arturo"},{"code":"#include <assert.h>\n#include <locale.h>\n#include <stdbool.h>\n#include <stdint.h>\n#include <stdio.h>\n#include <stdlib.h>\n\ntypedef struct bit_array_tag {\n uint32_t size;\n uint32_t* array;\n} bit_array;\n\nbool bit_array_create(bit_array* b, uint32_t size) {\n uint32_t* array = calloc((size + 31)/32, sizeof(uint32_t));\n if (array == NULL)\n return false;\n b->size = size;\n b->array = array;\n return true;\n}\n\nvoid bit_array_destroy(bit_array* b) {\n free(b->array);\n b->array = NULL;\n}\n\nvoid bit_array_set(bit_array* b, uint32_t index, bool value) {\n assert(index < b->size);\n uint32_t* p = &b->array[index >> 5];\n uint32_t bit = 1 << (index & 31);\n if (value)\n *p |= bit;\n else\n *p &= ~bit;\n}\n\nbool bit_array_get(const bit_array* b, uint32_t index) {\n assert(index < b->size);\n uint32_t* p = &b->array[index >> 5];\n uint32_t bit = 1 << (index & 31);\n return (*p & bit) != 0;\n}\n\ntypedef struct sieve_tag {\n uint32_t limit;\n bit_array not_prime;\n} sieve;\n\nbool sieve_create(sieve* s, uint32_t limit) {\n if (!bit_array_create(&s->not_prime, limit/2))\n return false;\n for (uint32_t p = 3; p * p <= limit; p += 2) {\n if (bit_array_get(&s->not_prime, p/2 - 1) == false) {\n uint32_t inc = 2 * p;\n for (uint32_t q = p * p; q <= limit; q += inc)\n bit_array_set(&s->not_prime, q/2 - 1, true);\n }\n }\n s->limit = limit;\n return true;\n}\n\nvoid sieve_destroy(sieve* s) {\n bit_array_destroy(&s->not_prime);\n}\n\nbool is_prime(const sieve* s, uint32_t n) {\n assert(n <= s->limit);\n if (n == 2)\n return true;\n if (n < 2 || n % 2 == 0)\n return false;\n return bit_array_get(&s->not_prime, n/2 - 1) == false;\n}\n\n// return number of decimal digits\nuint32_t count_digits(uint32_t n) {\n uint32_t digits = 0;\n for (; n > 0; ++digits)\n n /= 10;\n return digits;\n}\n\n// return the number with one digit replaced\nuint32_t change_digit(uint32_t n, uint32_t index, uint32_t new_digit) {\n uint32_t p = 1;\n uint32_t changed = 0;\n for (; index > 0; p *= 10, n /= 10, --index)\n changed += p * (n % 10);\n changed += (10 * (n/10) + new_digit) * p;\n return changed;\n}\n\n// returns true if n unprimeable\nbool unprimeable(const sieve* s, uint32_t n) {\n if (is_prime(s, n))\n return false;\n uint32_t d = count_digits(n);\n for (uint32_t i = 0; i < d; ++i) {\n for (uint32_t j = 0; j <= 9; ++j) {\n uint32_t m = change_digit(n, i, j);\n if (m != n && is_prime(s, m))\n return false;\n }\n }\n return true;\n}\n\nint main() {\n const uint32_t limit = 10000000;\n setlocale(LC_ALL, \"\");\n sieve s = { 0 };\n if (!sieve_create(&s, limit)) {\n fprintf(stderr, \"Out of memory\\n\");\n return 1;\n }\n printf(\"First 35 unprimeable numbers:\\n\");\n uint32_t n = 100;\n uint32_t lowest[10] = { 0 };\n for (uint32_t count = 0, found = 0; n < limit && (found < 10 || count < 600); ++n) {\n if (unprimeable(&s, n)) {\n if (count < 35) {\n if (count != 0)\n printf(\", \");\n printf(\"%'u\", n);\n }\n ++count;\n if (count == 600)\n printf(\"\\n600th unprimeable number: %'u\\n\", n);\n uint32_t last_digit = n % 10;\n if (lowest[last_digit] == 0) {\n lowest[last_digit] = n;\n ++found;\n }\n }\n }\n sieve_destroy(&s);\n for (uint32_t i = 0; i < 10; ++i)\n printf(\"Least unprimeable number ending in %u: %'u\\n\" , i, lowest[i]);\n return 0;\n}\n","language":"C"},{"code":"#include <iostream>\n#include <cstdint>\n#include \"prime_sieve.hpp\"\n\ntypedef uint32_t integer;\n\n// return number of decimal digits\nint count_digits(integer n) {\n int digits = 0;\n for (; n > 0; ++digits)\n n /= 10;\n return digits;\n}\n\n// return the number with one digit replaced\ninteger change_digit(integer n, int index, int new_digit) {\n integer p = 1;\n integer changed = 0;\n for (; index > 0; p *= 10, n /= 10, --index)\n changed += p * (n % 10);\n changed += (10 * (n/10) + new_digit) * p;\n return changed;\n}\n\n// returns true if n unprimeable\nbool unprimeable(const prime_sieve& sieve, integer n) {\n if (sieve.is_prime(n))\n return false;\n int d = count_digits(n);\n for (int i = 0; i < d; ++i) {\n for (int j = 0; j <= 9; ++j) {\n integer m = change_digit(n, i, j);\n if (m != n && sieve.is_prime(m))\n return false;\n }\n }\n return true;\n}\n\nint main() {\n const integer limit = 10000000;\n prime_sieve sieve(limit);\n\n // print numbers with commas\n std::cout.imbue(std::locale(\"\"));\n\n std::cout << \"First 35 unprimeable numbers:\\n\";\n integer n = 100;\n integer lowest[10] = { 0 };\n for (int count = 0, found = 0; n < limit && (found < 10 || count < 600); ++n) {\n if (unprimeable(sieve, n)) {\n if (count < 35) {\n if (count != 0)\n std::cout << \", \";\n std::cout << n;\n }\n ++count;\n if (count == 600)\n std::cout << \"\\n600th unprimeable number: \" << n << '\\n';\n int last_digit = n % 10;\n if (lowest[last_digit] == 0) {\n lowest[last_digit] = n;\n ++found;\n }\n }\n }\n for (int i = 0; i < 10; ++i)\n std::cout << \"Least unprimeable number ending in \" << i << \": \" << lowest[i] << '\\n';\n return 0;\n}\n","language":"C++"},{"code":"#ifndef PRIME_SIEVE_HPP\n#define PRIME_SIEVE_HPP\n\n#include <algorithm>\n#include <vector>\n\n/**\n * A simple implementation of the Sieve of Eratosthenes.\n * See https://en.wikipedia.org/wiki/Sieve_of_Eratosthenes.\n */\nclass prime_sieve {\npublic:\n explicit prime_sieve(size_t);\n bool is_prime(size_t) const;\nprivate:\n std::vector<bool> is_prime_;\n};\n\n/**\n * Constructs a sieve with the given limit.\n *\n * @param limit the maximum integer that can be tested for primality\n */\ninline prime_sieve::prime_sieve(size_t limit) {\n limit = std::max(size_t(3), limit);\n is_prime_.resize(limit/2, true);\n for (size_t p = 3; p * p <= limit; p += 2) {\n if (is_prime_[p/2 - 1]) {\n size_t inc = 2 * p;\n for (size_t q = p * p; q <= limit; q += inc)\n is_prime_[q/2 - 1] = false;\n }\n }\n}\n\n/**\n * Returns true if the given integer is a prime number. The integer\n * must be less than or equal to the limit passed to the constructor.\n *\n * @param n an integer less than or equal to the limit passed to the\n * constructor\n * @return true if the integer is prime\n */\ninline bool prime_sieve::is_prime(size_t n) const {\n if (n == 2)\n return true;\n if (n < 2 || n % 2 == 0)\n return false;\n return is_prime_.at(n/2 - 1);\n}\n\n#endif\n","language":"C++"},{"code":"import std.algorithm;\nimport std.array;\nimport std.conv;\nimport std.range;\nimport std.stdio;\n\nimmutable MAX = 10_000_000;\nbool[] primes;\n\nbool[] sieve(int limit) {\n bool[] p = uninitializedArray!(bool[])(limit);\n p[0..2] = false;\n p[2..$] = true;\n foreach (i; 2..limit) {\n if (p[i]) {\n for (int j = 2 * i; j < limit; j += i) {\n p[j] = false;\n }\n }\n }\n return p;\n}\n\nstring replace(CHAR)(CHAR[] str, int position, CHAR value) {\n str[position] = value;\n return str.idup;\n}\n\nbool unPrimeable(int n) {\n if (primes[n]) {\n return false;\n }\n auto test = n.to!string;\n foreach (i; 0 .. test.length) {\n for (char j = '0'; j <= '9'; j++) {\n auto r = replace(test.dup, i, j);\n if (primes[r.to!int]) {\n return false;\n }\n }\n }\n return true;\n}\n\nvoid displayUnprimeableNumbers(int maxCount) {\n int test = 1;\n for (int count = 0; count < maxCount;) {\n test++;\n if (unPrimeable(test)) {\n count++;\n write(test, ' ');\n }\n }\n writeln;\n}\n\nint nthUnprimeableNumber(int maxCount) {\n int test = 1;\n for (int count = 0; count < maxCount;) {\n test++;\n if (unPrimeable(test)) {\n count++;\n }\n }\n return test;\n}\n\nint[] genLowest() {\n int[] lowest = uninitializedArray!(int[])(10);\n lowest[] = 0;\n\n int count = 0;\n int test = 1;\n while (count < 10) {\n test++;\n if (unPrimeable(test) && lowest[test % 10] == 0) {\n lowest[test % 10] = test;\n count++;\n }\n }\n\n return lowest;\n}\n\nvoid main() {\n primes = sieve(MAX);\n\n writeln(\"First 35 unprimeable numbers:\");\n displayUnprimeableNumbers(35);\n writeln;\n\n int n = 600;\n writefln(\"The %dth unprimeable number = %,d\", n, nthUnprimeableNumber(n));\n writeln;\n\n writeln(\"Least unprimeable number that ends in:\");\n foreach (i,v; genLowest()) {\n writefln(\" %d is %,d\", i, v);\n }\n}\n","language":"D"},{"code":"// Unprimeable numbers. Nigel Galloway: May 4th., 2021\nlet rec fN i g e l=seq{yield! [0..9]|>Seq.map(fun n->n*g+e+l); if g>1 then let g=g/10 in yield! fN(i+g*(e/g)) g (e%g) i}\nlet fG(n,g)=fN(n*(g/n)) n (g%n) 0|>Seq.exists(isPrime)\nlet uP()=let rec fN n g=seq{yield! {n..g-1}|>Seq.map(fun g->(n,g)); yield! fN(g)(g*10)} in fN 1 10|>Seq.filter(fG>>not)|>Seq.map snd\n","language":"F-Sharp"},{"code":"uP()|>Seq.take 35|>Seq.iter(printf \"%d \"); printfn \"\"\n","language":"F-Sharp"},{"code":"printfn \"600th unprimable number is %d\" (uP()|>Seq.item 599)\n","language":"F-Sharp"},{"code":"[0..9]|>Seq.iter(fun n->printfn \"first umprimable number ending in %d is %d\" n (uP()|>Seq.find(fun g->n=g%10)))\n","language":"F-Sharp"},{"code":"let uPx x=let rec fN n g=seq{yield! {n+x..10..g-1}|>Seq.map(fun g->(max 1 n,g)); yield! fN(g)(g*10)} in fN 0 10|>Seq.filter(fG>>not)|>Seq.map snd\n[0..9]|>Seq.iter(fun n->printfn \"first umprimable number ending in %d is %d\" n (uPx n|>Seq.head))\n","language":"F-Sharp"},{"code":"USING: assocs formatting io kernel lists lists.lazy\nlists.lazy.examples math math.functions math.primes math.ranges\nmath.text.utils prettyprint sequences tools.memory.private ;\n\n: one-offs ( n -- seq )\n dup 1 digit-groups [\n swapd 10^ [ * ] keep [ - ] dip\n 2dup [ 9 * ] [ + ] [ <range> ] tri*\n ] with map-index concat ;\n\n: (unprimeable?) ( n -- ? )\n [ f ] [ one-offs [ prime? ] none? ] if-zero ;\n\n: unprimeable? ( n -- ? )\n dup prime? [ drop f ] [ (unprimeable?) ] if ;\n\n: unprimeables ( -- list ) naturals [ unprimeable? ] lfilter ;\n\n: ?set-at ( value key assoc -- )\n 2dup key? [ 3drop ] [ set-at ] if ;\n\n: first-digits ( -- assoc )\n unprimeables H{ } clone [ dup assoc-size 10 = ]\n [ [ unswons dup 10 mod ] dip [ ?set-at ] keep ] until nip ;\n\n\"The first 35 unprimeable numbers:\" print bl bl\n35 unprimeables ltake [ pprint bl ] leach nl nl\n\n\"The 600th unprimeable number:\" print bl bl\n599 unprimeables lnth commas print nl\n\n\"The first unprimeable number ending with\" print\nfirst-digits [ commas \" %d: %9s\\n\" printf ] assoc-each\n","language":"Factor"},{"code":"Function isprime(n As Ulongint) As boolean\n If (n=2) Or (n=3) Then Return 1\n If n Mod 2 = 0 Then Return 0\n If n Mod 3 = 0 Then Return 0\n Dim As Ulongint limit=Sqr(N)+1\n For I As Ulongint = 6 To limit Step 6\n If N Mod (i-1) = 0 Then Return 0\n If N Mod (i+1) = 0 Then Return 0\n Next I\n Return 1\nEnd Function\n\nSub getnonprimeables(a() As Long)\n Dim As String s,g\n Dim As Long count,lim=1300000\n Redim a(1 To lim)\n For num As Long=1 To lim\n g=Str(num)\n s=g\n For n As Long=0 To Len(s)-1\n For m As Long=48 To 57\n s[n]=m\n If isprime(Vallng(s)) Then Goto lbl\n Next m\n s=g\n Next n\n count+=1\n a(count)=num\n lbl:\n Next num\n Redim Preserve a(1 To count)\nEnd Sub\n\nFunction endings(n As String,a() As Long) As Long\n For m As Long=1 To Ubound(a)\n If Right(Str(a(m)),1)=n Then Return a(m)\n Next m\nEnd Function\n\nRedim As Long n()\ngetnonprimeables(n())\nprint \" First 35\"\nFor m As Long=1 To 35\n Print n(m);\nNext\nPrint\nPrint \"600th number \";n(600)\nFor z As Long=0 To 9\n Print \"first umprimable number ending in \";z; \" is \";endings(Str(z),n())\nNext z\nsleep\n","language":"FreeBASIC"},{"code":"package main\n\nimport (\n \"fmt\"\n \"strconv\"\n)\n\nfunc isPrime(n int) bool {\n switch {\n case n < 2:\n return false\n case n%2 == 0:\n return n == 2\n case n%3 == 0:\n return n == 3\n default:\n d := 5\n for d*d <= n {\n if n%d == 0 {\n return false\n }\n d += 2\n if n%d == 0 {\n return false\n }\n d += 4\n }\n return true\n }\n}\n\nfunc commatize(n int) string {\n s := fmt.Sprintf(\"%d\", n)\n le := len(s)\n for i := le - 3; i >= 1; i -= 3 {\n s = s[0:i] + \",\" + s[i:]\n }\n return s\n}\n\nfunc main() {\n fmt.Println(\"The first 35 unprimeable numbers are:\")\n count := 0 // counts all unprimeable numbers\n var firstNum [10]int // stores the first unprimeable number ending with each digit\nouter:\n for i, countFirst := 100, 0; countFirst < 10; i++ {\n if isPrime(i) {\n continue // unprimeable number must be composite\n }\n s := strconv.Itoa(i)\n le := len(s)\n b := []byte(s)\n for j := 0; j < le; j++ {\n for k := byte('0'); k <= '9'; k++ {\n if s[j] == k {\n continue\n }\n b[j] = k\n n, _ := strconv.Atoi(string(b))\n if isPrime(n) {\n continue outer\n }\n }\n b[j] = s[j] // restore j'th digit to what it was originally\n }\n lastDigit := s[le-1] - '0'\n if firstNum[lastDigit] == 0 {\n firstNum[lastDigit] = i\n countFirst++\n }\n count++\n if count <= 35 {\n fmt.Printf(\"%d \", i)\n }\n if count == 35 {\n fmt.Print(\"\\n\\nThe 600th unprimeable number is: \")\n }\n if count == 600 {\n fmt.Printf(\"%s\\n\\n\", commatize(i))\n }\n }\n\n fmt.Println(\"The first unprimeable number that ends in:\")\n for i := 0; i < 10; i++ {\n fmt.Printf(\" %d is: %9s\\n\", i, commatize(firstNum[i]))\n }\n}\n","language":"Go"},{"code":"import Control.Lens ((.~), ix, (&))\nimport Data.Numbers.Primes (isPrime)\nimport Data.List (find, intercalate)\nimport Data.Char (intToDigit)\nimport Data.Maybe (mapMaybe)\nimport Data.List.Split (chunksOf)\nimport Text.Printf (printf)\n\nisUnprimable :: Int -> Bool\nisUnprimable = all (not . isPrime) . swapdigits\n\nswapdigits :: Int -> [Int]\nswapdigits n = map read $ go $ pred $ length digits\n where\n digits = show n\n go (-1) = []\n go n'' = map (\\x -> digits & (ix n'') .~ intToDigit x) [0..9] <> go (pred n'')\n\nunPrimeable :: [Int]\nunPrimeable = filter isUnprimable [1..]\n\nmain :: IO ()\nmain = do\n printf \"First 35 unprimeable numbers:\\n%s\\n\\n\" $ show $ take 35 unPrimeable\n printf \"600th unprimeable number: %d\\n\\n\" $ unPrimeable !! 599\n mapM_ (uncurry (printf \"Lowest unprimeable number ending with %d: %10s\\n\")) $ mapMaybe lowest [0..9]\n where\n thousands = reverse . intercalate \",\" . chunksOf 3 . reverse\n lowest n = do\n x <- find (\\x -> x `mod` 10 == n) unPrimeable\n pure (n, thousands $ show x)\n","language":"Haskell"},{"code":"NB. replace concatenates at various ranks and in boxes to avoid fill\nNB. the curtailed prefixes (}:\\) with all of 0..9 (i.10) with the beheaded suffixes (}.\\.)\nNB. under the antibase 10 representation (10&#.inv)\nreplace=: ([: ; <@}:\\ ,\"1 L:_1 ([: < (i.10) ,\"0 1 }.)\\.)&.(10&#.inv)\n\nNB. primable tests if one of the replacements is prime\nprimable=: (1 e. 1 p: replace)&>\n\nunprimable=: -.@:primable\n\nassert 0 1 -: unprimable 193 200\n","language":"J"},{"code":"public class UnprimeableNumbers {\n\n private static int MAX = 10_000_000;\n private static boolean[] primes = new boolean[MAX];\n\n public static void main(String[] args) {\n sieve();\n System.out.println(\"First 35 unprimeable numbers:\");\n displayUnprimeableNumbers(35);\n int n = 600;\n System.out.printf(\"%nThe %dth unprimeable number = %,d%n%n\", n, nthUnprimeableNumber(n));\n int[] lowest = genLowest();\n System.out.println(\"Least unprimeable number that ends in:\");\n for ( int i = 0 ; i <= 9 ; i++ ) {\n System.out.printf(\" %d is %,d%n\", i, lowest[i]);\n }\n }\n\n private static int[] genLowest() {\n int[] lowest = new int[10];\n int count = 0;\n int test = 1;\n while ( count < 10 ) {\n test++;\n if ( unPrimable(test) && lowest[test % 10] == 0 ) {\n lowest[test % 10] = test;\n count++;\n }\n }\n return lowest;\n }\n\n private static int nthUnprimeableNumber(int maxCount) {\n int test = 1;\n int count = 0;\n int result = 0;\n while ( count < maxCount ) {\n test++;\n if ( unPrimable(test) ) {\n count++;\n result = test;\n }\n }\n return result;\n }\n\n private static void displayUnprimeableNumbers(int maxCount) {\n int test = 1;\n int count = 0;\n while ( count < maxCount ) {\n test++;\n if ( unPrimable(test) ) {\n count++;\n System.out.printf(\"%d \", test);\n }\n }\n System.out.println();\n }\n\n private static boolean unPrimable(int test) {\n if ( primes[test] ) {\n return false;\n }\n String s = test + \"\";\n for ( int i = 0 ; i < s.length() ; i++ ) {\n for ( int j = 0 ; j <= 9 ; j++ ) {\n if ( primes[Integer.parseInt(replace(s, i, j))] ) {\n return false;\n }\n }\n }\n return true;\n }\n\n private static String replace(String str, int position, int value) {\n char[] sChar = str.toCharArray();\n sChar[position] = (char) value;\n return str.substring(0, position) + value + str.substring(position + 1);\n }\n\n private static final void sieve() {\n // primes\n for ( int i = 2 ; i < MAX ; i++ ) {\n primes[i] = true;\n }\n for ( int i = 2 ; i < MAX ; i++ ) {\n if ( primes[i] ) {\n for ( int j = 2*i ; j < MAX ; j += i ) {\n primes[j] = false;\n }\n }\n }\n }\n\n}\n","language":"Java"},{"code":"Number.prototype.isPrime = function() {\n let i = 2, num = this;\n if (num == 0 || num == 1) return false;\n if (num == 2) return true;\n while (i <= Math.ceil(Math.sqrt(num))) {\n if (num % i == 0) return false;\n i++;\n }\n return true;\n}\n","language":"JavaScript"},{"code":"function isUnprimable(num) {\n if (num < 100 || num.isPrime()) return false;\n let arr = num.toString().split('');\n for (let x = 0; x < arr.length; x++) {\n let lft = arr.slice(0, x),\n rgt = arr.slice(x + 1);\n for (let y = 0; y < 10; y++) {\n let test = lft.join('') + y.toString() + rgt.join('');\n if (parseInt(test).isPrime()) return false;\n }\n }\n return true;\n}\n","language":"JavaScript"},{"code":"let unprimeables = [],\n endings = new Array(10).fill('-'),\n c = 1;\nfunction chkEnds(n) {\n let e = n % 10;\n if (endings[e] == '-') endings[e] = n;\n}\nconsole.time('I');\nwhile (unprimeables.length < 1000) {\n if (isUnprimable(c)) {\n unprimeables.push(c);\n chkEnds(c)\n }\n c++;\n}\nconsole.log('The first 35 unprimeables:');\nconsole.log(unprimeables.slice(0,35).join(', '));\nconsole.log(`The 600th unprimeable: ${unprimeables[599].toLocaleString('en')}`);\nconsole.log(`The 1000th unprimable: ${unprimeables[999].toLocaleString('en')}`);\nconsole.timeEnd('I');\nconsole.time('II');\nwhile (endings.includes('-')) {\n c++;\n if (isUnprimable(c)) chkEnds(c);\n}\nfor (c = 0; c < endings.length; c++) {\n console.log(`First unprimeable ending with ${c}: ${endings[c].toLocaleString('en')}`);\n}\nconsole.timeEnd('II');\n","language":"JavaScript"},{"code":"def digits: tostring | explode | map([.] | implode | tonumber);\n\ndef lpad($len): tostring | ($len - length) as $l | (\" \" * $l)[:$l] + .;\n","language":"Jq"},{"code":"def variants:\n digits\n | range(0; length) as $pos\n | range(0;10) as $newdigit\n | if .[$pos] == $newdigit then empty\n else .[$pos] = $newdigit\n | join(\"\")|tonumber\n end;\n\ndef is_unprimeable:\n if is_prime or any(variants; is_prime) then false\n else true\n end;\n\ndef unprimeables:\n range(4; infinite) | select(is_unprimeable);\n","language":"Jq"},{"code":"def task:\n \"First 35 unprimeables: \",\n [limit(35; range(0;infinite) | select(is_unprimeable))],\n\n \"\\nThe 600th unprimeable is \\( nth(600 - 1; unprimeables) ).\",\n\n \"\\nDigit First unprimeable ending with that digit\",\n \"-----------------------------------------------\",\n (range(0;10) as $dig\n | first( range(0;infinite) | select((. % 10 == $dig) and is_unprimeable))\n | \" \\($dig) \\(lpad(9))\" )\n ;\n\ntask\n","language":"Jq"},{"code":"using Primes, Lazy, Formatting\n\nfunction isunprimeable(n)\n dvec = digits(n)\n for pos in 1:length(dvec), newdigit in 0:9\n olddigit, dvec[pos] = dvec[pos], newdigit\n isprime(foldr((i, j) -> i + 10j, dvec)) && return false\n dvec[pos] = olddigit\n end\n return true\nend\n\nprintln(\"First 35 unprimeables: \", take(35, filter(isunprimeable, Lazy.range())))\n\nprintln(\"\\nThe 600th unprimeable is \",\n collect(take(600, filter(isunprimeable, Lazy.range())))[end])\n\nprintln(\"\\nDigit First unprimeable ending with that digit\")\nprintln(\"-----------------------------------------\")\n\nfor dig in 0:9\n n = first(filter(x -> (x % 10 == dig) && isunprimeable(x), Lazy.range()))\n println(\" $dig \", lpad(format(n, commas=true), 9))\nend\n","language":"Julia"},{"code":"private const val MAX = 10000000\nprivate val primes = BooleanArray(MAX)\n\nfun main() {\n sieve()\n println(\"First 35 unprimeable numbers:\")\n displayUnprimeableNumbers(35)\n val n = 600\n println()\n println(\"The ${n}th unprimeable number = ${nthUnprimeableNumber(n)}\")\n println()\n val lowest = genLowest()\n println(\"Least unprimeable number that ends in:\")\n for (i in 0..9) {\n println(\" $i is ${lowest[i]}\")\n }\n}\n\nprivate fun genLowest(): IntArray {\n val lowest = IntArray(10)\n var count = 0\n var test = 1\n while (count < 10) {\n test++\n if (unPrimable(test) && lowest[test % 10] == 0) {\n lowest[test % 10] = test\n count++\n }\n }\n return lowest\n}\n\nprivate fun nthUnprimeableNumber(maxCount: Int): Int {\n var test = 1\n var count = 0\n var result = 0\n while (count < maxCount) {\n test++\n if (unPrimable(test)) {\n count++\n result = test\n }\n }\n return result\n}\n\nprivate fun displayUnprimeableNumbers(maxCount: Int) {\n var test = 1\n var count = 0\n while (count < maxCount) {\n test++\n if (unPrimable(test)) {\n count++\n print(\"$test \")\n }\n }\n println()\n}\n\nprivate fun unPrimable(test: Int): Boolean {\n if (primes[test]) {\n return false\n }\n val s = test.toString() + \"\"\n for (i in s.indices) {\n for (j in 0..9) {\n if (primes[replace(s, i, j).toInt()]) {\n return false\n }\n }\n }\n return true\n}\n\nprivate fun replace(str: String, position: Int, value: Int): String {\n val sChar = str.toCharArray()\n sChar[position] = value.toChar()\n return str.substring(0, position) + value + str.substring(position + 1)\n}\n\nprivate fun sieve() {\n // primes\n for (i in 2 until MAX) {\n primes[i] = true\n }\n for (i in 2 until MAX) {\n if (primes[i]) {\n var j = 2 * i\n while (j < MAX) {\n primes[j] = false\n j += i\n }\n }\n }\n}\n","language":"Kotlin"},{"code":"-- FUNCS:\nlocal function T(t) return setmetatable(t, {__index=table}) end\ntable.filter = function(t,f) local s=T{} for _,v in ipairs(t) do if f(v) then s[#s+1]=v end end return s end\ntable.firstn = function(t,n) local s=T{} n=n>#t and #t or n for i = 1,n do s[i]=t[i] end return s end\n\n-- SIEVE:\nlocal sieve, S = {}, 10000000\nfor i = 2,S do sieve[i]=true end\nfor i = 2,S do if sieve[i] then for j=i*i,S,i do sieve[j]=nil end end end\n\n-- UNPRIMABLE:\nlocal unprimables, lowests = T{}, T{}\nlocal floor, log10 = math.floor, math.log10\n\nlocal function unprimable(n)\n if sieve[n] then return false end\n local nd = floor(log10(n))+1\n for i = 1, nd do\n local pow10 = 10^(nd-i)\n for j = 0, 9 do\n local p = (floor(n/10/pow10) * 10 + j) * pow10 + (n % pow10)\n if sieve[p] then return false end\n end\n end\n return true\nend\n\nlocal n, done = 1, 0\nwhile done < 10 do\n if unprimable(n) then\n unprimables:insert(n)\n if not lowests[n%10] then\n lowests[n%10] = n\n done = done + 1\n end\n end\n n = n + 1\nend\n\n-- OUTPUT:\nlocal function commafy(i) return tostring(i):reverse():gsub(\"(%d%d%d)\",\"%1,\"):reverse():gsub(\"^,\",\"\") end\nprint(\"The first 35 unprimable numbers are:\")\nprint(unprimables:firstn(35):concat(\" \"))\nprint()\nprint(\"The 600th unprimable number is: \" .. commafy(unprimables[600]))\nprint()\nprint(\"The lowest unprimable number that ends in..\")\nfor i = 0, 9 do\n print(\" \" .. i .. \" is: \" .. commafy(lowests[i]))\nend\n","language":"Lua"},{"code":"ClearAll[Unprimeable]\nUnprimeable[in_Integer] := Module[{id, new, pos},\n id = IntegerDigits[in];\n pos = Catenate@Table[\n Table[\n new = id;\n new[[d]] = n;\n new\n ,\n {n, 0, 9}\n ]\n ,\n {d, Length[id]}\n ];\n pos //= Map[FromDigits];\n NoneTrue[pos, PrimeQ]\n ]\nres = {};\nPrintTemporary[Dynamic[{Length[res], i}]];\ni = 0;\nWhile[Length[res] < 600,\n If[Unprimeable[i],\n AppendTo[res, i]\n ];\n i++\n ];\n\nPrintTemporary[Dynamic[{lastdig, i}]];\nout = Table[\n i = lastdig;\n While[! Unprimeable[i],\n i += 10\n ];\n i\n ,\n {lastdig, 0, 9}\n ];\n\nres[[;; 35]]\nres[[600]]\n\nlastdigit = IntegerDigits /* Last;\nPrint[\"Least unprimeable number ending in \", lastdigit[#], \": \", #] & /@ SortBy[out, lastdigit];\n","language":"Mathematica"},{"code":"import strutils\n\nconst N = 10_000_000\n\n# Erastosthenes sieve.\nvar composite: array[0..N, bool] # Defualt is false i.e. composite.\ncomposite[0] = true\ncomposite[1] = true\nfor n in 2..N:\n if not composite[n]:\n for k in countup(n * n, N, n):\n composite[k] = true\n\ntemplate isPrime(n: int): bool = not composite[n]\n\n\nproc isUmprimeable(n: Positive): bool =\n if n.isPrime: return false\n var nd = $n\n for i, prevDigit in nd:\n for newDigit in '0'..'9':\n if newDigit != prevDigit:\n nd[i] = newDigit\n if nd.parseInt.isPrime: return false\n nd[i] = prevDigit # Restore initial digit.\n result = true\n\n\necho \"First 35 unprimeable numbers:\"\nvar n = 100\nvar list: seq[int]\nwhile list.len < 35:\n if n.isUmprimeable:\n list.add n\n inc n\necho list.join(\" \"), '\\n'\n\nvar count = 0\nn = 199\nwhile count != 600:\n inc n\n if n.isUmprimeable: inc count\necho \"600th unprimeable number: \", ($n).insertSep(','), '\\n'\n\nfor d in 0..9:\n var n = 200 + d\n while not n.isUmprimeable:\n inc n, 10\n echo \"Lowest unprimeable number ending in \", d, \" is \", ($n).insertSep(',')\n","language":"Nim"},{"code":"program unprimable;\n{$IFDEF FPC}{$Mode Delphi}{$ELSE}{$APPTYPE CONSOLE}{$ENDIF}\n\nconst\n base = 10;\n\ntype\n TNumVal = array[0..base-1] of NativeUint;\n TConvNum = record\n NumRest : TNumVal;\n LowDgt,\n MaxIdx : NativeUint;\n end;\n\nvar //global\n PotBase,\n EndDgtFound : TNumVal;\n TotalCnt,\n EndDgtCnt :NativeUint;\n\nprocedure Init;\nvar\n i,val : NativeUint;\nBegin\n val := 1;\n For i := low(TNumVal) to High(TNumVal) do\n Begin\n EndDgtFound[i] :=0;\n PotBase[i] := val;\n val := val * Base;\n end;\n TotalCnt := 0;\n EndDgtCnt := 0;\nend;\n\nProcedure ConvertNum(n: NativeUint;var NConv:TConvNum);\n//extract digit position replace by \"0\" to get NumRest\n// 173 -> 170 -> 103 -> 073\nvar\n i, dgt,n_red,n_mod: NativeUint;\nbegin\n i := 0;\n n_red := n;\n with NConv do\n Begin\n repeat\n n_mod := n_red DIV Base;\n dgt := n_red-Base*n_mod;\n n_red := n_mod;\n IF i = 0 then\n LowDgt := dgt;\n NumRest[i]:= n-dgt*PotBase[i];\n inc(i);\n until (i > High(TNumVal)) OR (n<PotBase[i]);\n MaxIdx := i-1;\n end;\nend;\n\nprocedure CheckOutPut(n: NativeUint);\nBegin\n IF TotalCnt > 600 then\n EXIT;\n IF TotalCnt <= 35 then\n write(n,' ');\n IF TotalCnt = 600 then\n Begin\n writeln;\n writeln;\n writeln('the 600.th unprimable number: ',n);\n end;\nend;\n\nfunction isPrime(n : NativeUint):boolean;inline;\nvar\n p : NativeUint;\nBegin\n result := (N=2) OR (N=3);\n IF result then\n EXIT;\n //now result = false\n IF (n<2) OR (NOT(ODD(n))) or (n mod 3= 0) then\n EXIT;\n p := 5;\n while p*p <= n do\n Begin\n if n mod p = 0 then\n Exit;\n inc(p,2);\n if n mod p = 0 then\n Exit;\n inc(p,4);\n end;\n result := true;\nend;\n\nprocedure InsertFound(LowDgt,n:NativeUInt);\nBegin\n inc(TotalCnt);\n IF EndDgtFound[LowDgt] = 0 then\n Begin\n EndDgtFound[LowDgt] := n;\n inc(EndDgtCnt);\n end;\nend;\n\nfunction CheckUnprimable(n:NativeInt):boolean;\nvar\n ConvNum : TConvNum;\n val,dgt,i,dtfac: NativeUint;\nBegin\n ConvertNum(n,ConvNum);\n result := false;\n //lowest digit\n with ConvNum do\n Begin\n val := NumRest[0];\n For dgt := 0 to Base-1 do\n IF isPrime(val+dgt) then\n EXIT;\n dgt := LowDgt;\n\n result := true;\n i := MaxIdx;\n IF NumRest[i] >= Base then\n Begin\n//****Only for base=10 if even or divisible by 5***\n IF Not(ODD(dgt)) OR (dgt=5) then\n Begin\n InsertFound(dgt,n);\n EXIT;\n end;\n end;\n\n result := false;\n For i := MaxIdx downto 1 do\n Begin\n dtfac := PotBase[i];\n val := NumRest[i];\n For dgt := 0 to Base-1 do\n Begin\n IF isPrime(val) then\n EXIT;\n inc(val,dtfac);\n end;\n end;\n InsertFound(LowDgt,n);\n result := true;\n end;\nend;\n\nfunction CheckUnprimableReduced(n:NativeInt):boolean;\n//lowest digit already tested before\nvar\n ConvNum : TConvNum;\n val,dgt,i,dtfac: NativeUint;\nBegin\n ConvertNum(n,ConvNum);\n result := true;\n with ConvNum do\n Begin\n i := MaxIdx;\n IF NumRest[i] >= Base then\n Begin\n dgt := LowDgt;\n IF Not(ODD(dgt)) OR (dgt=5) then\n Begin\n InsertFound(dgt,n);\n EXIT;\n end;\n end;\n\n result := false;\n For i := i downto 1 do\n Begin\n dtfac := PotBase[i];\n val := NumRest[i];\n For dgt := 0 to Base-1 do\n Begin\n IF isPrime(val) then\n EXIT;\n inc(val,dtfac);\n end;\n end;\n InsertFound(LowDgt,n);\n result := true;\n end;\nend;\n\nvar\n n,i : NativeUint;\nBegin\n init;\n n := Base;\n repeat\n If CheckUnprimable(n) then\n Begin\n CheckOutPut(n);\n For i := 1 to Base-1 do\n Begin\n IF CheckUnprimableReduced(n+i) then\n CheckOutPut(n+i);\n end;\n end;\n inc(n,Base);\n until EndDgtCnt = Base;\n writeln;\n For i := 0 to Base-1 do\n Writeln ('lowest digit ',i:2,' found first ',EndDgtFound[i]:7);\n writeln;\n writeln('There are ',TotalCnt,' unprimable numbers upto ',n);\n {$IFNDEF UNIX}readln;{$ENDIF}\nend.\n","language":"Pascal"},{"code":"program unprimable;\n{$IFDEF FPC}\n {$Mode Delphi}\n {$OPTIMIZATION ON,ALL}\n{$ELSE}\n //Delphi\n {$APPTYPE CONSOLE}\n{$ENDIF}\nuses\n sysutils;\nconst\n Base = 10;\n dgtcnt = 9;\n Limit = Base* Base*Base*Base*Base* Base*Base*Base*Base;\n{\n Base = 18;\n dgtcnt = 8;\n Limit = Base*Base*Base*Base* Base*Base*Base*Base;\n * }\n\n PrimeLimit = Limit+Base;\n{\n Limit = 1000*1000*1000;\n dgtcnt = trunc(ln(Limit-1)/ln(Base));\n PrimeLimit = Trunc(exp(ln(base)*(dgtcnt+1)))+Base;\n}\ntype\n TNumVal = array[0..dgtcnt] of NativeUint;\n TConvNum = record\n NumRest,\n Digits : TNumVal;\n num,\n MaxIdx : NativeUint;\n end;\n\nvar //global\n ConvNum:TConvNum;\n PotBase: TNumVal;\n EndDgtFound : array[0..Base-1] of NativeUint;\n TotalCnt,\n EndDgtCnt :NativeUint;\n\n//http://rosettacode.org/wiki/Sieve_of_Eratosthenes#alternative_using_wheel\n\nvar\n pPrimes : pBoolean;\n //always initialized with 0 => false at startup\n primes: array of boolean;\n\nfunction BuildWheel: NativeUint;\nvar\n myPrimes : pBoolean;\n wheelprimes :array[0..31] of byte;\n wheelSize,wpno,\n pr,pw,i, k: NativeUint;\nbegin\n myPrimes := @primes[0];\n pr := 1;\n myPrimes[1]:= true;\n WheelSize := 1;\n\n wpno := 0;\n repeat\n inc(pr);\n\n pw := pr;\n if pw > wheelsize then\n dec(pw,wheelsize);\n If myPrimes[pw] then\n begin\n k := WheelSize+1;\n //turn the wheel (pr-1)-times\n for i := 1 to pr-1 do\n begin\n inc(k,WheelSize);\n if k<primeLimit then\n move(myPrimes[1],myPrimes[k-WheelSize],WheelSize)\n else\n begin\n move(myPrimes[1],myPrimes[k-WheelSize],PrimeLimit-WheelSize*i);\n break;\n end;\n end;\n dec(k);\n IF k > primeLimit then\n k := primeLimit;\n wheelPrimes[wpno] := pr;\n myPrimes[pr] := false;\n\n inc(wpno);\n //the new wheelsize\n WheelSize := k;\n\n //sieve multiples of the new found prime\n i:= pr;\n i := i*i;\n while i <= k do\n begin\n myPrimes[i] := false;\n inc(i,pr);\n end;\n end;\n until WheelSize >= PrimeLimit;\n\n //re-insert wheel-primes 1 still stays prime\n while wpno > 0 do\n begin\n dec(wpno);\n myPrimes[wheelPrimes[wpno]] := true;\n end;\n myPrimes[0] := false;\n myPrimes[1] := false;\n\n BuildWheel := pr+1;\n writeln;\nend;\n\nprocedure Sieve;\nvar\n myPrimes : pBoolean;\n sieveprime,\n fakt : NativeUint;\nbegin\n setlength(Primes,PrimeLimit+1);\n pPrimes := @Primes[0];\n myPrimes := pPrimes;\n//pPrimes[1] = true is needed to stop for sieveprime = 2\n// at //Search next smaller possible prime\n sieveprime := BuildWheel;\n//alternative here\n //fillchar(pPrimes,SizeOf(pPrimes),chr(ord(true)));sieveprime := 2;\n repeat\n if myPrimes[sieveprime] then\n begin\n //eliminate 'possible prime' multiples of sieveprime\n //must go downwards\n //2*2 would unmark 4 -> 4*2 = 8 wouldnt be unmarked\n fakt := PrimeLimit DIV sieveprime;\n IF fakt < sieveprime then\n BREAK;\n repeat\n //Unmark\n myPrimes[sieveprime*fakt] := false;\n //Search next smaller possible prime\n repeat\n dec(fakt);\n until myPrimes[fakt];\n until fakt < sieveprime;\n end;\n inc(sieveprime);\n until false;\n //remove 1\n myPrimes[1] := false;\nend;\n\nprocedure Init;\nvar\n i,val : NativeUint;\nBegin\n val := 1;\n For i := low(TNumVal) to High(TNumVal) do\n Begin\n EndDgtFound[i] :=0;\n PotBase[i] := val;\n val := val * Base;\n end;\n TotalCnt := 0;\n EndDgtCnt := 0;\nend;\n\nprocedure OutConvNum(const NConv:TConvNum);\nvar\n i : NativeInt;\nBegin\n with NConv do\n begin\n writeln(num,MaxIdx:10);\n For i := MaxIdx Downto MaxIdx do\n write(Digits[i]);\n writeln;\n For i := MaxIdx Downto MaxIdx do\n write(NumRest[i]:8);\n end\nend;\n\nprocedure IncConvertNum(var NConv:TConvNum);\nvar\n i,k : NativeInt;\nBegin\n with NConv do\n begin\n i := 0;\n repeat\n k := Digits[i]+1;\n IF k < Base then\n Begin\n Digits[i] := k;\n BREAK;\n end\n else\n Begin\n Digits[i] := k-Base;\n inc(i);\n end;\n until i > MaxIdx;\n IF i > MaxIdx then\n Begin\n Digits[i] := 1;\n MaxIdx := i;\n end;\n\n k := num+1;\n i := MaxIdx;\n repeat\n NumRest[i]:= k-Digits[i]*PotBase[i];\n dec(i);\n until i < 0;\n num := k;\n end;\nend;\n\nprocedure IncConvertNumBase(var NConv:TConvNum);\nvar\n i,k : NativeInt;\nBegin\n with NConv do\n begin\n i := 1;\n Digits[0] := 0;\n repeat\n k := Digits[i]+1;\n IF k < Base then\n Begin\n Digits[i] := k;\n BREAK;\n end\n else\n Begin\n Digits[i] := k-Base;\n inc(i);\n end;\n until i > MaxIdx;\n IF i > MaxIdx then\n Begin\n Digits[i] := 1;\n MaxIdx := i;\n end;\n k := num+Base;\n i := MaxIdx;\n repeat\n NumRest[i]:= k-Digits[i]*PotBase[i];\n dec(i);\n until i < 0;\n num := k;\n end;\nend;\n\nProcedure ConvertNum(n: NativeUint;var NConv:TConvNum);\n//extract digit position replace by \"0\" to get NumRest\n// 173 -> 170 -> 103 -> 073\nvar\n i, dgt,n_red,n_div: NativeUint;\nbegin\n i := 0;\n with NConv do\n Begin\n num := n;\n n_red := n;\n repeat\n n_div := n_red DIV Base;\n dgt := n_red-Base*n_div;\n n_red := n_div;\n Digits[i] := dgt;\n NumRest[i]:= n-dgt*PotBase[i];\n inc(i);\n until (n_red= 0)OR (i > High(TNumVal));\n MaxIdx := i-1;\n end;\nend;\n\nprocedure InsertFound(dgt,n:NativeUInt);\nBegin\n IF EndDgtFound[dgt] = 0 then\n Begin\n EndDgtFound[dgt] := n;\n inc(EndDgtCnt);\n end;\nend;\n\nfunction CheckUnprimable(const ConvNum:TConvNum):boolean;\nvar\n myPrimes : pBoolean;\n val,dgt,i,dtfac: NativeUint;\nBegin\n myPrimes := pPrimes;\n result := false;\n with ConvNum do\n Begin\n //lowest digit. Check only resulting odd numbers num > base\n val := NumRest[0];\n dgt := 1- (val AND 1);\n repeat\n IF myPrimes[val+dgt] then\n EXIT;\n inc(dgt,2);\n until dgt >= Base;\n\n For i := 1 to MaxIdx do\n Begin\n val := NumRest[i];\n dtfac := PotBase[i];\n IF (val >= BASE) then\n Begin\n IF NOt(Odd(val)) AND NOT(ODD(dtfac)) then\n continue;\n For dgt := 0 to Base-1 do\n Begin\n IF myPrimes[val] then\n EXIT;\n inc(val,dtfac);\n end;\n end\n else\n Begin\n For dgt := 0 to Base-1 do\n Begin\n IF myPrimes[val] then\n EXIT;\n inc(val,dtfac);\n end;\n end\n end;\n inc(TotalCnt);\n result := true;\n end;\nend;\n\nvar\n n,i,Lmt,Lmt10 : NativeUint;\nBegin\n init;\n Sieve;\n n := Base;\n Lmt10 := 10;\n Lmt := Base;\n ConvertNum(n,ConvNum);\n writeln('Base ',ConvNum.num);\n //InsertFound takes a lot of time.So check it as long as neccessary\n while EndDgtCnt <Base do\n Begin\n If CheckUnprimable(ConvNum) then\n Begin\n InsertFound(ConvNum.Digits[0],n);\n For i := 1 to Base-1 do\n Begin\n inc(n);\n IncConvertNum(ConvNum);\n IF CheckUnprimable(ConvNum) then\n InsertFound(ConvNum.Digits[0],n);\n end;\n inc(n);\n IncConvertNum(ConvNum);\n end\n else\n Begin\n inc(n,Base);\n IncConvertNumBase(ConvNum);\n end;\n if n >= Lmt10 then\n Begin\n writeln('There are ',TotalCnt,' unprimable numbers upto ',n);\n Lmt10 := Lmt10*10;\n end;\n if (Base <> 10) AND (n >= Lmt) then\n Begin\n writeln('There are ',TotalCnt,' unprimable numbers upto ',n);\n Lmt := Lmt*Base;\n end;\n end;\n //All found\n repeat\n If CheckUnprimable(ConvNum) then\n Begin\n For i := 1 to Base-1 do\n Begin\n inc(n);\n IncConvertNum(ConvNum);\n CheckUnprimable(ConvNum)\n end;\n inc(n);\n IncConvertNum(ConvNum);\n end\n else\n Begin\n inc(n,Base);\n IncConvertNumBase(ConvNum);\n end;\n\n if n >= Lmt10 then\n Begin\n writeln('There are ',TotalCnt,' unprimable numbers upto ',n);\n Lmt10 := Lmt10*10;\n end;\n\n if (Base <> 10) AND (n >= Lmt) then\n Begin\n writeln('There are ',TotalCnt,' unprimable numbers upto ',n);\n Lmt := Lmt*Base;\n end;\n until n >= Limit;\n writeln;\n For i := 0 to Base-1 do\n Writeln ('lowest digit ',i:2,' found first ',EndDgtFound[i]:7);\n writeln;\n writeln('There are ',TotalCnt,' unprimable numbers upto ',n);\n setlength(Primes,0);\nend.\n","language":"Pascal"},{"code":"use strict;\nuse warnings;\nuse feature 'say';\nuse ntheory 'is_prime';\nuse enum qw(False True);\n\nsub comma { reverse ((reverse shift) =~ s/(.{3})/$1,/gr) =~ s/^,//r }\n\nsub is_unprimeable {\n my($n) = @_;\n return False if is_prime($n);\n my $chrs = length $n;\n for my $place (0..$chrs-1) {\n my $pow = 10**($chrs - $place - 1);\n my $this = substr($n, $place, 1) * $pow;\n map { return False if $this != $_ and is_prime($n - $this + $_ * $pow) } 0..9;\n }\n True\n}\n\nmy($n, @ups);\ndo { push @ups, $n if is_unprimeable(++$n); } until @ups == 600;\nsay \"First 35 unprimeables:\\n\" . join ' ', @ups[0..34];\nprintf \"\\n600th unprimeable: %s\\n\", comma $ups[599];\n\nmap {\n my $x = $_;\n while ($x += 10) { last if is_unprimeable($x) }\n say \"First unprimeable that ends with $_: \" . sprintf \"%9s\", comma $x;\n} 0..9;\n","language":"Perl"},{"code":"(phixonline)-->\n <span style=\"color: #008080;\">with</span> <span style=\"color: #008080;\">javascript_semantics</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 35 unprimeable numbers are:\\n\"</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;\">0</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000080;font-style:italic;\">-- counts all unprimeable numbers</span>\n <span style=\"color: #000000;\">countFirst</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">0</span><span style=\"color: #0000FF;\">,</span>\n <span style=\"color: #000000;\">i</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">100</span>\n <span style=\"color: #004080;\">sequence</span> <span style=\"color: #000000;\">firstNum</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;\">10</span><span style=\"color: #0000FF;\">)</span> <span style=\"color: #000080;font-style:italic;\">-- stores the first unprimeable number ending with each digit</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> <span style=\"color: #000000;\">t1</span><span style=\"color: #0000FF;\">=</span><span style=\"color: #000000;\">t0</span><span style=\"color: #0000FF;\">+</span><span style=\"color: #000000;\">1</span>\n <span style=\"color: #008080;\">while</span> <span style=\"color: #000000;\">countFirst</span><span style=\"color: #0000FF;\"><</span><span style=\"color: #000000;\">10</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;\">i</span><span style=\"color: #0000FF;\">)</span> <span style=\"color: #008080;\">then</span> <span style=\"color: #000080;font-style:italic;\">-- unprimeable number must be composite</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;\">\"%d\"</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">i</span><span style=\"color: #0000FF;\">),</span> <span style=\"color: #000000;\">b</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">s</span>\n <span style=\"color: #004080;\">integer</span> <span style=\"color: #000000;\">le</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>\n <span style=\"color: #004080;\">bool</span> <span style=\"color: #000000;\">primeable</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #004600;\">false</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;\">le</span> <span style=\"color: #008080;\">do</span>\n <span style=\"color: #008080;\">for</span> <span style=\"color: #000000;\">k</span><span style=\"color: #0000FF;\">=</span><span style=\"color: #008000;\">'0'</span> <span style=\"color: #008080;\">to</span> <span style=\"color: #008000;\">'9'</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;\">j</span><span style=\"color: #0000FF;\">]!=</span><span style=\"color: #000000;\">k</span> <span style=\"color: #008080;\">then</span>\n <span style=\"color: #000000;\">b</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">j</span><span style=\"color: #0000FF;\">]</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">k</span>\n <span style=\"color: #004080;\">integer</span> <span style=\"color: #000000;\">n</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">to_integer</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">b</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #008080;\">if</span> <span style=\"color: #7060A8;\">is_prime</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">n</span><span style=\"color: #0000FF;\">)</span> <span style=\"color: #008080;\">then</span>\n <span style=\"color: #000000;\">primeable</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: #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;\">primeable</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;\">b</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">j</span><span style=\"color: #0000FF;\">]</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">s</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">j</span><span style=\"color: #0000FF;\">]</span> <span style=\"color: #000080;font-style:italic;\">-- restore j'th digit to what it was originally</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;\">primeable</span> <span style=\"color: #008080;\">then</span>\n <span style=\"color: #004080;\">integer</span> <span style=\"color: #000000;\">lastDigit</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">s</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">le</span><span style=\"color: #0000FF;\">]-</span><span style=\"color: #008000;\">'0'</span><span style=\"color: #0000FF;\">+</span><span style=\"color: #000000;\">1</span>\n <span style=\"color: #008080;\">if</span> <span style=\"color: #000000;\">firstNum</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">lastDigit</span><span style=\"color: #0000FF;\">]</span> <span style=\"color: #0000FF;\">==</span> <span style=\"color: #000000;\">0</span> <span style=\"color: #008080;\">then</span>\n <span style=\"color: #000000;\">firstNum</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">lastDigit</span><span style=\"color: #0000FF;\">]</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">i</span>\n <span style=\"color: #000000;\">countFirst</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;\">count</span> <span style=\"color: #0000FF;\">+=</span> <span style=\"color: #000000;\">1</span>\n <span style=\"color: #008080;\">if</span> <span style=\"color: #000000;\">count</span> <span style=\"color: #0000FF;\"><=</span> <span style=\"color: #000000;\">35</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;\">\"%d \"</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">i</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #008080;\">elsif</span> <span style=\"color: #000000;\">count</span> <span style=\"color: #0000FF;\">==</span> <span style=\"color: #000000;\">600</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;\">\"\\n\\nThe 600th unprimeable number is: %,d\\n\\n\"</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;\">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: #7060A8;\">platform</span><span style=\"color: #0000FF;\">()!=</span><span style=\"color: #004600;\">JS</span> <span style=\"color: #008080;\">and</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;\">\"checking %d, %d `endswiths` found\\r\"</span><span style=\"color: #0000FF;\">,{</span><span style=\"color: #000000;\">i</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">countFirst</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: #000000;\">i</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 <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 unprimeable number that ends in:\\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;\">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;\">\" %d is: %,9d\\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: #000000;\">1</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">firstNum</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: #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<!--\n","language":"Phix"},{"code":"bool is_unprimeable(int i)\n{\n string s = i->digits();\n for(int offset; offset < sizeof(s); offset++) {\n\tforeach(\"0123456789\"/1, string repl) {\n\t array chars = s/1;\n\t chars[offset] = repl;\n\t int testme = (int)(chars*\"\");\n\t if( testme->probably_prime_p() )\n\t\treturn false;\n\t}\n }\n return true;\n}\n\nvoid main()\n{\n int i, count;\n array unprimes = ({});\n mapping first_enders = ([]); // first unprimeable ending with each digit\n while(sizeof(first_enders) != 10) {\n\ti++;\n\tif( is_unprimeable(i) ) {\n\t count++;\n\t unprimes += ({ i });\n\t string last_digit = i->digits()[<0..];\n\t if( !first_enders[last_digit] )\n\t\tfirst_enders[last_digit] = i;\n\t}\n\twerror(\"%d\\r\", i); // Progress output\n }\n\n write(\"First 35 unprimeables: %s\\n\\n\", (array(string))unprimes[0..34]*\" \");\n write(\"The 600th unprimeable is %d\\n\\n\", unprimes[599]);\n write(\"The first unprimeable number that ends in\\n\");\n foreach(sort(indices(first_enders)), string e) {\n\twrite(\" %s is: %9d\\n\", e, first_enders[e]);\n }\n}\n","language":"Pike"},{"code":"from itertools import count, islice\n\ndef primes(_cache=[2, 3]):\n yield from _cache\n for n in count(_cache[-1]+2, 2):\n if isprime(n):\n _cache.append(n)\n yield n\n\ndef isprime(n, _seen={0: False, 1: False}):\n def _isprime(n):\n for p in primes():\n if p*p > n:\n return True\n if n%p == 0:\n return False\n\n if n not in _seen:\n _seen[n] = _isprime(n)\n return _seen[n]\n\ndef unprime():\n for a in count(1):\n d = 1\n while d <= a:\n base = (a//(d*10))*(d*10) + (a%d) # remove current digit\n if any(isprime(y) for y in range(base, base + d*10, d)):\n break\n d *= 10\n else:\n yield a\n\n\nprint('First 35:')\nprint(' '.join(str(i) for i in islice(unprime(), 35)))\n\nprint('\\nThe 600-th:')\nprint(list(islice(unprime(), 599, 600))[0])\nprint()\n\nfirst, need = [False]*10, 10\nfor p in unprime():\n i = p%10\n if first[i]: continue\n\n first[i] = p\n need -= 1\n if not need:\n break\n\nfor i,v in enumerate(first):\n print(f'{i} ending: {v}')\n","language":"Python"},{"code":"#lang racket\n\n(require math/number-theory)\n\n(define cached-prime?\n (let ((hsh# (make-hash))) (λ (p) (hash-ref! hsh# p (λ () (prime? p))))))\n\n(define (zero-digit n d)\n (define p (expt 10 d))\n (+ (remainder n p) (* 10 p (quotient n (* p 10)))))\n\n(define (primeable? n)\n (or (cached-prime? n)\n (for*/first ((d (in-range (add1 (order-of-magnitude n))))\n (n0 (in-value (zero-digit n d)))\n (p (in-value (expt 10 d)))\n (r (in-range 10))\n (n+ (in-value (+ n0 (* r p))))\n #:when (cached-prime? n+))\n n+)))\n\n(define unprimeable? (negate primeable?))\n\n(module+\n main\n (printf \"First 35 unprimeable numbers: ~a~%\"\n (let recur ((i 0) (n 1) (acc null))\n (cond [(= i 35) (reverse acc)]\n [(unprimeable? n) (recur (add1 i) (add1 n) (cons n acc))]\n [else (recur i (add1 n) acc)])))\n\n (printf \"600th unprimeable number: ~a~%\"\n (let recur ((i 0) (n 1) (u #f))\n (cond [(= i 600) u]\n [(unprimeable? n) (recur (add1 i) (add1 n) n)]\n [else (recur i (add1 n) u)])))\n\n (for ((d 10))\n (printf \"Least unprimeable number ending in ~a = ~a~%\" d\n (for/first ((i (in-range (+ 100 d) +Inf.0 10)) #:when (unprimeable? i)) i))))\n\n(module+ test\n (require rackunit)\n (check-equal? (zero-digit 1234 2) 1034)\n (check-equal? (primeable? 10) 11)\n (check-true (unprimeable? 200))\n (check-false (unprimeable? 201)))\n","language":"Racket"},{"code":"use ntheory:from<Perl5> <is_prime>;\nuse Lingua::EN::Numbers;\n\nsub is-unprimeable (\\n) {\n return False if n.&is_prime;\n my \\chrs = n.chars;\n for ^chrs -> \\place {\n my \\pow = 10**(chrs - place - 1);\n my \\this = n.substr(place, 1) × pow;\n ^10 .map: -> \\dgt {\n next if this == dgt;\n return False if is_prime(n - this + dgt × pow)\n }\n }\n True\n}\n\nmy @ups = lazy ^∞ .grep: { .&is-unprimeable };\n\nsay \"First 35 unprimeables:\\n\" ~ @ups[^35];\n\nsay \"\\n{ordinal-digit(600, :u)} unprimeable: \" ~ comma( @ups[599] ) ~ \"\\n\";\n\n^10 .map: -> \\n {\n print \"First unprimeable that ends with {n}: \" ~\n sprintf \"%9s\\n\", comma (n, *+10 … *).race.first: { .&is-unprimeable }\n}\n","language":"Raku"},{"code":"/*REXX program finds and displays unprimeable numbers (non─negative integers). */\nparse arg n x hp . /*obtain optional arguments from the CL*/\nif n=='' | n==\",\" then n= 35 /*Not specified? Then use the default.*/\nif x=='' | x==\",\" then x= 600 /* \" \" \" \" \" \" */\nif hp=='' | hp==\",\" then hp= 10000000 /* \" \" \" \" \" \" */\nu= 0 /*number of unprimeable numbers so far.*/\neds=4; ed.1= 1; ed.2= 3; ed.3= 7; ed.4= 9 /*\"end\" digits which are prime; prime>9*/\ncall genP hp /*generate primes up to & including HP.*/\n$$=; $.=. /*a list \" \" \" \" \" */\n do j=100; if !.j then iterate /*Prime? Unprimeable must be composite*/\n Lm= length(j) /*obtain the length-1 of the number J. */\n meat= left(j, Lm) /*obtain the first Lm digits of J. */\n /* [↑] examine the \"end\" digit of J. */\n do e_=1 for eds; new= meat || ed.e_ /*obtain a different number (than J).*/\n if new==j then iterate /*Is it the original number? Then skip.*/\n if !.new then iterate j /*This new number a prime? \" \" */\n end /*e_*/\n /* [↑] examine a new 1st digit of J. */\n do f_=0 for 10; new= (f_||meat) + 0 /*obtain a different number (than J).*/\n if new==j then iterate /*Is it the original number? Then skip.*/\n if !.new then iterate j /*This new number a prime? \" \" */\n end /*f_*/ /* [↑] examine the front digit of J. */\n do a_= 2 for Lm-1 /*traipse through the middle digits. */\n meat= left(j, a_ - 1) /*use a number of left─most dec. digits*/\n rest= substr(j, a_ + 1) /* \" \" \" \" right─most \" \" */\n do n_=0 for 10 /*traipse through all 1─digit numbers. */\n new= meat || n_ || rest /*construct new number, like a phoenix.*/\n if new==j then iterate /*Is it the original number? Then skip.*/\n if !.new then iterate j /*This new number a prime? \" \" */\n end /*n_*/\n end /*a_*/\n u= u + 1 /*bump the count of unprimeable numbers*/\n if u<=n then $$= $$ commas(j) /*maybe add unprimeable # to $$ list.*/\n if u==x then $.ox= commas(j) /*assign the Xth unprimeable number.*/\n parse var j '' -1 _ /*obtain the right─most dec digit of J.*/\n if $._==. then $._= j /*the 1st unprimeable # that ends in _.*/\n if $.3==. then iterate; if $.7==. then iterate /*test if specific #'s found.*/\n if $.1==. then iterate; if $.9==. then iterate /* \" \" \" \" \" */\n leave /*if here, then we're done. */\n end /*j*/\n\nif n>0 then do; say center(' first ' n \"unprimeable numbers \", 139, '═')\n say strip($$); say\n end\nif x>0 then say ' the ' th(x) \" unprimeable number is: \" $.ox\nsay\n do o=0 for 10; if length($.o)==0 then iterate\n say ' the first unprimeable number that ends in ' o \" is:\"right(commas($.o),11)\n end /*o*/\nexit /*stick a fork in it, we're all done. */\n/*──────────────────────────────────────────────────────────────────────────────────────*/\ncommas: parse arg ?; do c=length(?)-3 to 1 by -3; ?=insert(',', ?, c); end; return ?\nth:procedure;parse arg x;return x||word('th st nd rd',1+(x//10)*(x//100%10\\==1)*(x//10<4))\n/*──────────────────────────────────────────────────────────────────────────────────────*/\ngenP: @.1=2; @.2=3; @.3=5; @.4=7; @.5=11; @.6=13; @.7=17; @.8=19; @.9=23; @.10=29; @.11=31\n !.=0; !.2=1; !.3=1; !.5=1; !.7=1; !.11=1; !.13=1; !.17=1; !.19=1; !.23=1; !.29=1\n #= 11; sq.#= @.# **2\n do lim=100 until lim*lim>=hp /*only keep primes up to the sqrt(hp). */\n end /*lim*/ /* [↑] find limit for storing primes. */\n do j=@.#+2 by 2 to hp; parse var j '' -1 _; if _==5 then iterate /*÷ by 5?*/\n if j// 3==0 then iterate; if j// 7==0 then iterate; if j//11==0 then iterate\n if j//13==0 then iterate; if j//17==0 then iterate; if j//19==0 then iterate\n if j//23==0 then iterate; if j//29==0 then iterate\n do k=11 while sq.k<=j /*divide by some generated odd primes. */\n if j//@.k==0 then iterate j /*Is J divisible by P? Then not prime*/\n end /*k*/ /* [↓] a prime (J) has been found. */\n #= #+1; if #<=lim then @.#=j; !.j=1 /*bump prime count; assign prime to @. */\n sq.#= j*j /*calculate square of J for fast WHILE.*/\n","language":"REXX"},{"code":"require 'prime'\n\ndef unprimable?(n)\n digits = %w(0 1 2 3 4 5 6 7 8 9)\n s = n.to_s\n size = s.size\n (size-1).downto(0) do |i|\n digits.each do |d|\n cand = s.dup\n cand[i]=d\n return false if cand.to_i.prime?\n end\n end\n true\nend\nups = Enumerator.new {|y| (1..).each{|n| y << n if unprimable?(n)} }\n\nar = ups.first(600)\nputs \"First 35 unprimables:\", ar[0,35].join(\" \")\nputs \"\\n600th unprimable:\", ar.last, \"\"\n(0..9).each do |d|\n print \"First unprimeable with last digit #{d}: \"\n puts (1..).detect{|k| unprimable?(k*10+d)}*10 + d\nend\n","language":"Ruby"},{"code":"// main.rs\nmod bit_array;\nmod prime_sieve;\n\nuse prime_sieve::PrimeSieve;\n\n// return number of decimal digits\nfn count_digits(mut n: u32) -> u32 {\n let mut digits = 0;\n while n > 0 {\n n /= 10;\n digits += 1;\n }\n digits\n}\n\n// return the number with one digit replaced\nfn change_digit(mut n: u32, mut index: u32, new_digit: u32) -> u32 {\n let mut p = 1;\n let mut changed = 0;\n while index > 0 {\n changed += p * (n % 10);\n p *= 10;\n n /= 10;\n index -= 1;\n }\n changed += (10 * (n / 10) + new_digit) * p;\n changed\n}\n\nfn unprimeable(sieve: &PrimeSieve, n: u32) -> bool {\n if sieve.is_prime(n as usize) {\n return false;\n }\n let d = count_digits(n);\n for i in 0..d {\n for j in 0..10 {\n let m = change_digit(n, i, j);\n if m != n && sieve.is_prime(m as usize) {\n return false;\n }\n }\n }\n true\n}\n\nfn main() {\n let mut count = 0;\n let mut n = 100;\n let mut lowest = vec![0; 10];\n let mut found = 0;\n let sieve = PrimeSieve::new(10000000);\n println!(\"First 35 unprimeable numbers:\");\n while count < 600 || found < 10 {\n if unprimeable(&sieve, n) {\n if count < 35 {\n if count > 0 {\n print!(\", \");\n }\n print!(\"{}\", n);\n }\n count += 1;\n if count == 600 {\n println!(\"\\n600th unprimeable number: {}\", n);\n }\n let last_digit = n as usize % 10;\n if lowest[last_digit] == 0 {\n lowest[last_digit] = n;\n found += 1;\n }\n }\n n += 1;\n }\n for i in 0..10 {\n println!(\"Least unprimeable number ending in {}: {}\", i, lowest[i]);\n }\n}\n","language":"Rust"},{"code":"// prime_sieve.rs\nuse crate::bit_array;\n\npub struct PrimeSieve {\n composite: bit_array::BitArray,\n}\n\nimpl PrimeSieve {\n pub fn new(limit: usize) -> PrimeSieve {\n let mut sieve = PrimeSieve {\n composite: bit_array::BitArray::new(limit / 2),\n };\n let mut p = 3;\n while p * p <= limit {\n if !sieve.composite.get(p / 2 - 1) {\n let inc = p * 2;\n let mut q = p * p;\n while q <= limit {\n sieve.composite.set(q / 2 - 1, true);\n q += inc;\n }\n }\n p += 2;\n }\n sieve\n }\n pub fn is_prime(&self, n: usize) -> bool {\n if n < 2 {\n return false;\n }\n if n % 2 == 0 {\n return n == 2;\n }\n !self.composite.get(n / 2 - 1)\n }\n}\n","language":"Rust"},{"code":"// bit_array.rs\npub struct BitArray {\n array: Vec<u32>,\n}\n\nimpl BitArray {\n pub fn new(size: usize) -> BitArray {\n BitArray {\n array: vec![0; (size + 31) / 32],\n }\n }\n pub fn get(&self, index: usize) -> bool {\n let bit = 1 << (index & 31);\n (self.array[index >> 5] & bit) != 0\n }\n pub fn set(&mut self, index: usize, new_val: bool) {\n let bit = 1 << (index & 31);\n if new_val {\n self.array[index >> 5] |= bit;\n } else {\n self.array[index >> 5] &= !bit;\n }\n }\n}\n","language":"Rust"},{"code":"func is_unprimeable(n) {\n var t = 10*floor(n/10)\n for k in (t+1 .. t+9 `by` 2) {\n return false if k.is_prime\n }\n\n if (n.is_div(2) || n.is_div(5)) {\n return true if !is_prime(n%10)\n return true if (n % 10**n.ilog(10) > 9)\n }\n\n for k in (1 .. n.ilog(10)) {\n var u = 10**k\n var v = (n - (u * (floor(n/u) % 10)))\n 0..9 -> any {|d| is_prime(v + d*u) } && return false\n }\n\n return true\n}\n\nwith (35) {|n|\n say (\"First #{n} unprimeables:\\n\", is_unprimeable.first(n).join(' '))\n}\n\nwith (600) {|n|\n say (\"\\n#{n}th unprimeable: \", is_unprimeable.nth(n), \"\\n\")\n}\n\nfor d in (0..9) {\n say (\"First unprimeable that ends with #{d}: \",\n 1..Inf -> lazy.map {|k| k*10 + d }.grep(is_unprimeable).first)\n}\n","language":"Sidef"},{"code":"import Foundation\n\nclass BitArray {\n var array: [UInt32]\n\n init(size: Int) {\n array = Array(repeating: 0, count: (size + 31)/32)\n }\n\n func get(index: Int) -> Bool {\n let bit = UInt32(1) << (index & 31)\n return (array[index >> 5] & bit) != 0\n }\n\n func set(index: Int, value: Bool) {\n let bit = UInt32(1) << (index & 31)\n if value {\n array[index >> 5] |= bit\n } else {\n array[index >> 5] &= ~bit\n }\n }\n}\n\nclass PrimeSieve {\n let composite: BitArray\n\n init(size: Int) {\n composite = BitArray(size: size/2)\n var p = 3\n while p * p <= size {\n if !composite.get(index: p/2 - 1) {\n let inc = p * 2\n var q = p * p\n while q <= size {\n composite.set(index: q/2 - 1, value: true)\n q += inc\n }\n }\n p += 2\n }\n }\n\n func isPrime(number: Int) -> Bool {\n if number < 2 {\n return false\n }\n if (number & 1) == 0 {\n return number == 2\n }\n return !composite.get(index: number/2 - 1)\n }\n}\n\n// return number of decimal digits\nfunc countDigits(number: Int) -> Int {\n var digits = 0\n var n = number\n while n > 0 {\n n /= 10\n digits += 1\n }\n return digits\n}\n\n// return the number with one digit replaced\nfunc changeDigit(number: Int, index: Int, digit: Int) -> Int {\n var p = 1\n var changed = 0\n var n = number\n var i = index\n while i > 0 {\n changed += p * (n % 10)\n p *= 10\n n /= 10\n i -= 1\n }\n changed += (10 * (n / 10) + digit) * p\n return changed\n}\n\nfunc unprimeable(sieve: PrimeSieve, number: Int) -> Bool {\n if sieve.isPrime(number: number) {\n return false\n }\n for i in 0..<countDigits(number: number) {\n for j in 0..<10 {\n let n = changeDigit(number: number, index: i, digit: j)\n if n != number && sieve.isPrime(number: n) {\n return false\n }\n }\n }\n return true\n}\n\nvar count = 0\nvar n = 100\nvar lowest = Array(repeating: 0, count: 10)\nvar found = 0\nlet sieve = PrimeSieve(size: 10000000)\nprint(\"First 35 unprimeable numbers:\")\nwhile count < 600 || found < 10 {\n if unprimeable(sieve: sieve, number: n) {\n if count < 35 {\n if count > 0 {\n print(\", \", terminator: \"\")\n }\n print(n, terminator: \"\")\n }\n count += 1\n if count == 600 {\n print(\"\\n600th unprimeable number: \\(n)\")\n }\n let lastDigit = n % 10\n if lowest[lastDigit] == 0 {\n lowest[lastDigit] = n\n found += 1\n }\n }\n n += 1\n}\nfor i in 0..<10 {\n let number = NSNumber(value: lowest[i])\n let str = NumberFormatter.localizedString(from: number, number: .decimal)\n print(\"Least unprimeable number ending in \\(i): \\(str)\")\n}\n","language":"Swift"},{"code":"import \"./fmt\" for Fmt\nimport \"./math\" for Int\n\nSystem.print(\"The first 35 unprimeable numbers are:\")\nvar count = 0 // counts all unprimeable numbers\nvar firstNum = List.filled(10, 0) // stores the first unprimeable number ending with each digit\nvar i = 100\nvar countFirst = 0\nwhile (countFirst < 10) {\n if (!Int.isPrime(i)) { // unprimeable number must be composite\n var s = \"%(i)\"\n var le = s.count\n var b = s.bytes.toList\n var outer = false\n for (j in 0...le) {\n for (k in 48..57) {\n if (s[j].bytes[0] != k) {\n b[j] = k\n var bb = b.reduce(\"\") { |acc, byte| acc + String.fromByte(byte) }\n var n = Num.fromString(bb)\n if (Int.isPrime(n)) {\n outer = true\n break\n }\n }\n }\n if (outer) break\n b[j] = s[j].bytes[0] // restore j'th digit to what it was originally\n }\n if (!outer) {\n var lastDigit = s[-1].bytes[0] - 48\n if (firstNum[lastDigit] == 0) {\n firstNum[lastDigit] = i\n countFirst = countFirst + 1\n }\n count = count + 1\n if (count <= 35) System.write(\"%(i) \")\n if (count == 35) System.write(\"\\n\\nThe 600th unprimeable number is: \")\n if (count == 600) System.print(\"%(Fmt.dc(0, i))\\n\")\n }\n }\n i = i + 1\n}\n\nSystem.print(\"The first unprimeable number that ends in:\")\nfor (i in 0...10) System.print(\" %(i) is: %(Fmt.dc(9, firstNum[i]))\")\n","language":"Wren"},{"code":"func IsPrime(N); \\Return 'true' if N is prime\nint N, I;\n[if N <= 2 then return N = 2;\nif (N&1) = 0 then \\even >2\\ return false;\nfor I:= 3 to sqrt(N) do\n [if rem(N/I) = 0 then return false;\n I:= I+1;\n ];\nreturn true;\n];\n\nfunc Unprimeable(N); \\Return 'true' if N is unprimeable\nint N, I, J, Len, D, SD;\nchar Num(10);\n[I:= 0; \\take N apart\nrepeat N:= N/10;\n Num(I):= rem(0);\n I:= I+1;\nuntil N = 0;\nLen:= I; \\number of digits in N (length)\nfor J:= 0 to Len-1 do\n [SD:= Num(J); \\save digit\n for D:= 0 to 9 do \\replace with all digits\n [Num(J):= D;\n N:= 0; \\rebuild N\n for I:= Len-1 downto 0 do\n N:= N*10 + Num(I);\n if IsPrime(N) then return false;\n ];\n Num(J):= SD; \\restore saved digit\n ];\nreturn true;\n];\n\nint C, N, D;\n[Text(0, \"First 35 unprimeables:^m^j\");\nC:= 0;\nN:= 100;\nloop [if Unprimeable(N) then\n [C:= C+1;\n if C <= 35 then\n [IntOut(0, N); ChOut(0, ^ )];\n if C = 600 then quit;\n ];\n N:= N+1;\n ];\nText(0, \"^m^j600th unprimeable: \");\nIntOut(0, N); CrLf(0);\nfor D:= 0 to 9 do\n [IntOut(0, D); Text(0, \": \");\n N:= 100 + D;\n loop [if Unprimeable(N) then\n [IntOut(0, N); CrLf(0);\n quit;\n ];\n N:= N+10;\n ];\n ];\n]\n","language":"XPL0"},{"code":"var [const] BI=Import(\"zklBigNum\"); // libGMP\n\nfcn isUnprimeable(n){ //--> n (!0) or Void, a filter\n bn,t := BI(0),n/10*10;\n foreach k in ([t+1..t+9,2]){ if(bn.set(k).probablyPrime()) return(Void.Skip) }\n if(n==n/2*2 or n==n/5*5){\n if(not bn.set(n%10).probablyPrime()) return(n);\n if( (n % (10).pow(n.toFloat().log10()) ) > 9) return(n);\n }\n foreach k in ([1 .. n.toFloat().log10()]){\n u,v := (10).pow(k), (n - (u * ((n/u) % 10)));\n foreach d in (10){ if(bn.set(v + d*u).probablyPrime()) return(Void.Skip); }\n }\n n\n}\nfcn isUnprimeableW{ [100..].tweak(isUnprimeable) }\t// --> iterator\n","language":"Zkl"},{"code":"isUnprimeableW().walk(35).concat(\" \").println();\nprintln(\"The 600th unprimeable number is: %,d\".fmt(isUnprimeableW().drop(600).value));\n\ns,ups := 10, List.createLong(10,0);\nforeach up in (isUnprimeableW())\n { d:=up%10; if(ups[d]==0){ ups[d]=up; if((s-=1)<=0) break; } }\nprintln(\"The first unprimeable number that ends in:\");\nforeach n in (10){ println(\"%d is %8,d\".fmt(n,ups[n])) }\n","language":"Zkl"}],"string":"[\n {\n \"code\": \"---\\nfrom: http://rosettacode.org/wiki/Unprimeable_numbers\\nnote: Prime Numbers\\n\",\n \"language\": \"00-META\"\n },\n {\n \"code\": \";Definitions:\\nAs used here, all unprimeable numbers (positive integers) are always expressed in base ten.\\n\\n\\n───── Definition from OEIS ─────:\\n<br>Unprimeable numbers are composite numbers that always remain composite when a single decimal digit of the number is changed.\\n\\n\\n───── Definition from Wiktionary (referenced from Adam Spencer's book) ─────:\\n<br>(''arithmetic'') that cannot be turned into a prime number by changing just one of its digits to any other\\ndigit. (<small>sic</small>)\\n\\n\\n\\n'''Unprimeable''' numbers are also spelled: '''unprimable'''.\\n\\nAll one─ and two─digit numbers can be turned into primes by changing a single decimal digit.\\n\\n\\n;Examples:\\n'''190''' isn't unprimeable, because by changing the zero digit into a three yields '''193''', which is a prime.\\n\\n\\n\\nThe number '''200''' <u>is</u> unprimeable, since none of the numbers '''201, 202, 203, ··· 209''' are\\nprime, and all the other numbers obtained by changing a single digit to\\nproduce '''100, 300, 400, ··· 900''', or '''210, 220, 230, ··· 290''' which are all even.\\n\\n\\nIt is valid to change '''189''' into '''089''' by changing the '''1''' (one) into\\na '''0''' (zero), which then the leading zero can be removed, and then treated as if\\nthe \\\"new\\\" number is '''89'''.\\n\\n\\n;Task:\\n::* show the first '''35''' unprimeable numbers (horizontally, on one line, preferably with a title)\\n::* show the '''600<sup>th</sup>''' unprimeable number\\n::* (optional) show the lowest unprimeable number ending in a specific decimal digit ('''0, 1, 2, 3, 4, 5, 6, 7, 8, 9''')\\n::* (optional) use commas in the numbers where appropriate\\n\\n\\nShow all output here, on this page.\\n\\n\\n;Also see:\\n:* the OEIS entry: [https://oeis.org/A118118 A118118 (unprimeable)]\\n:* with some useful counts to compare [http://www.numbersaplenty.com/set/unprimeable_number/ unprimeable number]\\n:* the Wiktionary entry (reference from below): [https://en.wiktionary.org/wiki/unprimeable (arithmetic definition) unprimeable]\\n:* from the Adam Spencer book (page 200): ''Adam Spencer's World of Numbers'' (Xoum Publishing)\\n<br><br>\\n\\n\",\n \"language\": \"00-TASK\"\n },\n {\n \"code\": \"V limit = 10'000'000\\nV is_prime = [0B] * 2 [+] [1B] * (limit - 1)\\nL(n) 0 .< Int(limit ^ 0.5 + 1.5)\\n I is_prime[n]\\n L(i) (n * n .< limit + 1).step(n)\\n is_prime[i] = 0B\\n\\nF unprimeable(a)\\n I :is_prime[a]\\n R 0B\\n V d = 1\\n L d <= a\\n V base = (a I/ (d * 10)) * (d * 10) + (a % d)\\n I any((base .< base + d * 10).step(d).map(y -> :is_prime[y]))\\n R 0B\\n d *= 10\\n R 1B\\n\\nF unprime(n)\\n [Int] r\\n L(a) 1..\\n I unprimeable(a)\\n r [+]= a\\n I r.len == n\\n L.break\\n R r\\n\\nprint(‘First 35:’)\\nprint(unprime(35).map(i -> String(i)).join(‘ ’))\\n\\nprint(\\\"\\\\nThe 600-th:\\\")\\nprint(unprime(600).last)\\nprint()\\n\\nV first = [0] * 10\\nV need = 10\\nL(p) 1..\\n I unprimeable(p)\\n V i = p % 10\\n I first[i] != 0\\n L.continue\\n\\n first[i] = p\\n I --need == 0\\n L.break\\n\\nL(v) first\\n print(L.index‘ ending: ’v)\\n\",\n \"language\": \"11l\"\n },\n {\n \"code\": \"BEGIN # find unprimable numbers - numbers which can't be made into a prime by changing one digit #\\n # construct a sieve of primes up to max prime #\\n PR read \\\"primes.incl.a68\\\" PR\\n INT max prime = 9 999 999;\\n []BOOL prime = PRIMESIEVE max prime;\\n # returns TRUE if n is unprimeable, FALSE otherwise #\\n PROC is unprimeable = ( INT n )BOOL:\\n IF n < 100\\n THEN FALSE\\n ELIF prime[ n ]\\n THEN FALSE\\n ELIF\\n # need to try changing a digit #\\n INT last digit = n MOD 10;\\n INT leading digits = n - last digit;\\n prime[ leading digits + 1 ]\\n THEN FALSE\\n ELIF prime[ leading digits + 3 ] THEN FALSE\\n ELIF prime[ leading digits + 7 ] THEN FALSE\\n ELIF prime[ leading digits + 9 ] THEN FALSE\\n ELIF last digit = 2 OR last digit = 5\\n THEN\\n # the final digit is 2 or 5, changing the other digits can't make a prime #\\n # unless there is only one other digit which we change to 0 #\\n INT v := leading digits;\\n INT dc := 1;\\n WHILE ( v OVERAB 10 ) > 0 DO IF v MOD 10 /= 0 THEN dc +:= 1 FI OD;\\n dc /= 2\\n ELIF NOT ODD last digit\\n THEN TRUE # last digit is even - can't make a prime #\\n ELSE\\n # last digit is 1, 3, 7, 9: must try changing the other digoits #\\n INT m10 := 10;\\n INT r10 := 100;\\n BOOL result := TRUE;\\n WHILE result AND n > r10 DO\\n INT base = ( ( n OVER r10 ) * r10 ) + ( n MOD m10 );\\n FOR i FROM 0 BY m10 WHILE result AND i < r10 DO\\n result := NOT prime[ base + i ]\\n OD;\\n m10 *:= 10;\\n r10 *:= 10\\n OD;\\n IF result THEN\\n # still not unprimeable, try changing the first digit #\\n INT base = n MOD m10;\\n FOR i FROM 0 BY m10 WHILE result AND i < r10 DO\\n result := NOT prime[ base + i ]\\n OD\\n FI;\\n result\\n FI # is unprimeable # ;\\n # returns a string representation of n with commas #\\n PROC commatise = ( LONG LONG INT n )STRING:\\n BEGIN\\n STRING result := \\\"\\\";\\n STRING unformatted = whole( n, 0 );\\n INT ch count := 0;\\n FOR c FROM UPB unformatted BY -1 TO LWB unformatted DO\\n IF ch count <= 2 THEN ch count +:= 1\\n ELSE ch count := 1; \\\",\\\" +=: result\\n FI;\\n unformatted[ c ] +=: result\\n OD;\\n result\\n END; # commatise #\\n # find unprimeable numbers #\\n INT u count := 0;\\n INT d count := 0;\\n [ 0 : 9 ]INT first unprimeable := []INT( 0, 0, 0, 0, 0, 0, 0, 0, 0, 0 )[ AT 0 ];\\n FOR i FROM 100 WHILE i < UPB prime AND d count < 10 DO\\n IF is unprimeable( i ) THEN\\n u count +:= 1;\\n IF u count = 1 THEN\\n print( ( \\\"First 35 unprimeable numbers: \\\", whole( i, 0 ) ) )\\n ELIF u count <= 35 THEN\\n print( ( \\\" \\\", whole( i, 0 ) ) )\\n ELIF u count = 600 THEN\\n print( ( newline, \\\"600th unprimeable number: \\\", commatise( i ) ) )\\n FI;\\n INT final digit = i MOD 10;\\n IF first unprimeable[ final digit ] = 0 THEN\\n # first unprimeable number with this final digit #\\n d count +:= 1;\\n first unprimeable[ final digit ] := i\\n FI\\n FI\\n OD;\\n # show the first unprimeable number that ends with each digit #\\n print( ( newline ) );\\n FOR i FROM 0 TO 9 DO\\n print( ( \\\"First unprimeable number ending in \\\"\\n , whole( i, 0 )\\n , \\\": \\\"\\n , commatise( first unprimeable[ i ] )\\n , newline\\n )\\n )\\n OD\\nEND\\n\",\n \"language\": \"ALGOL-68\"\n },\n {\n \"code\": \"unprimeable?: function [n][\\n if prime? n -> return false\\n nd: to :string n\\n loop.with:'i nd 'prevDigit [\\n loop `0`..`9` 'newDigit [\\n if newDigit <> prevDigit [\\n nd\\\\[i]: newDigit\\n if prime? to :integer nd -> return false\\n ]\\n ]\\n nd\\\\[i]: prevDigit\\n ]\\n return true\\n]\\n\\ncnt: 0\\nx: 1\\nunprimeables: []\\nwhile [cnt < 600][\\n if unprimeable? x [\\n unprimeables: unprimeables ++ x\\n cnt: cnt + 1\\n ]\\n x: x + 1\\n]\\n\\nprint \\\"First 35 unprimeable numbers:\\\"\\nprint first.n: 35 unprimeables\\nprint \\\"\\\"\\nprint [\\\"600th unprimeable number:\\\" last unprimeables]\\n\",\n \"language\": \"Arturo\"\n },\n {\n \"code\": \"#include <assert.h>\\n#include <locale.h>\\n#include <stdbool.h>\\n#include <stdint.h>\\n#include <stdio.h>\\n#include <stdlib.h>\\n\\ntypedef struct bit_array_tag {\\n uint32_t size;\\n uint32_t* array;\\n} bit_array;\\n\\nbool bit_array_create(bit_array* b, uint32_t size) {\\n uint32_t* array = calloc((size + 31)/32, sizeof(uint32_t));\\n if (array == NULL)\\n return false;\\n b->size = size;\\n b->array = array;\\n return true;\\n}\\n\\nvoid bit_array_destroy(bit_array* b) {\\n free(b->array);\\n b->array = NULL;\\n}\\n\\nvoid bit_array_set(bit_array* b, uint32_t index, bool value) {\\n assert(index < b->size);\\n uint32_t* p = &b->array[index >> 5];\\n uint32_t bit = 1 << (index & 31);\\n if (value)\\n *p |= bit;\\n else\\n *p &= ~bit;\\n}\\n\\nbool bit_array_get(const bit_array* b, uint32_t index) {\\n assert(index < b->size);\\n uint32_t* p = &b->array[index >> 5];\\n uint32_t bit = 1 << (index & 31);\\n return (*p & bit) != 0;\\n}\\n\\ntypedef struct sieve_tag {\\n uint32_t limit;\\n bit_array not_prime;\\n} sieve;\\n\\nbool sieve_create(sieve* s, uint32_t limit) {\\n if (!bit_array_create(&s->not_prime, limit/2))\\n return false;\\n for (uint32_t p = 3; p * p <= limit; p += 2) {\\n if (bit_array_get(&s->not_prime, p/2 - 1) == false) {\\n uint32_t inc = 2 * p;\\n for (uint32_t q = p * p; q <= limit; q += inc)\\n bit_array_set(&s->not_prime, q/2 - 1, true);\\n }\\n }\\n s->limit = limit;\\n return true;\\n}\\n\\nvoid sieve_destroy(sieve* s) {\\n bit_array_destroy(&s->not_prime);\\n}\\n\\nbool is_prime(const sieve* s, uint32_t n) {\\n assert(n <= s->limit);\\n if (n == 2)\\n return true;\\n if (n < 2 || n % 2 == 0)\\n return false;\\n return bit_array_get(&s->not_prime, n/2 - 1) == false;\\n}\\n\\n// return number of decimal digits\\nuint32_t count_digits(uint32_t n) {\\n uint32_t digits = 0;\\n for (; n > 0; ++digits)\\n n /= 10;\\n return digits;\\n}\\n\\n// return the number with one digit replaced\\nuint32_t change_digit(uint32_t n, uint32_t index, uint32_t new_digit) {\\n uint32_t p = 1;\\n uint32_t changed = 0;\\n for (; index > 0; p *= 10, n /= 10, --index)\\n changed += p * (n % 10);\\n changed += (10 * (n/10) + new_digit) * p;\\n return changed;\\n}\\n\\n// returns true if n unprimeable\\nbool unprimeable(const sieve* s, uint32_t n) {\\n if (is_prime(s, n))\\n return false;\\n uint32_t d = count_digits(n);\\n for (uint32_t i = 0; i < d; ++i) {\\n for (uint32_t j = 0; j <= 9; ++j) {\\n uint32_t m = change_digit(n, i, j);\\n if (m != n && is_prime(s, m))\\n return false;\\n }\\n }\\n return true;\\n}\\n\\nint main() {\\n const uint32_t limit = 10000000;\\n setlocale(LC_ALL, \\\"\\\");\\n sieve s = { 0 };\\n if (!sieve_create(&s, limit)) {\\n fprintf(stderr, \\\"Out of memory\\\\n\\\");\\n return 1;\\n }\\n printf(\\\"First 35 unprimeable numbers:\\\\n\\\");\\n uint32_t n = 100;\\n uint32_t lowest[10] = { 0 };\\n for (uint32_t count = 0, found = 0; n < limit && (found < 10 || count < 600); ++n) {\\n if (unprimeable(&s, n)) {\\n if (count < 35) {\\n if (count != 0)\\n printf(\\\", \\\");\\n printf(\\\"%'u\\\", n);\\n }\\n ++count;\\n if (count == 600)\\n printf(\\\"\\\\n600th unprimeable number: %'u\\\\n\\\", n);\\n uint32_t last_digit = n % 10;\\n if (lowest[last_digit] == 0) {\\n lowest[last_digit] = n;\\n ++found;\\n }\\n }\\n }\\n sieve_destroy(&s);\\n for (uint32_t i = 0; i < 10; ++i)\\n printf(\\\"Least unprimeable number ending in %u: %'u\\\\n\\\" , i, lowest[i]);\\n return 0;\\n}\\n\",\n \"language\": \"C\"\n },\n {\n \"code\": \"#include <iostream>\\n#include <cstdint>\\n#include \\\"prime_sieve.hpp\\\"\\n\\ntypedef uint32_t integer;\\n\\n// return number of decimal digits\\nint count_digits(integer n) {\\n int digits = 0;\\n for (; n > 0; ++digits)\\n n /= 10;\\n return digits;\\n}\\n\\n// return the number with one digit replaced\\ninteger change_digit(integer n, int index, int new_digit) {\\n integer p = 1;\\n integer changed = 0;\\n for (; index > 0; p *= 10, n /= 10, --index)\\n changed += p * (n % 10);\\n changed += (10 * (n/10) + new_digit) * p;\\n return changed;\\n}\\n\\n// returns true if n unprimeable\\nbool unprimeable(const prime_sieve& sieve, integer n) {\\n if (sieve.is_prime(n))\\n return false;\\n int d = count_digits(n);\\n for (int i = 0; i < d; ++i) {\\n for (int j = 0; j <= 9; ++j) {\\n integer m = change_digit(n, i, j);\\n if (m != n && sieve.is_prime(m))\\n return false;\\n }\\n }\\n return true;\\n}\\n\\nint main() {\\n const integer limit = 10000000;\\n prime_sieve sieve(limit);\\n\\n // print numbers with commas\\n std::cout.imbue(std::locale(\\\"\\\"));\\n\\n std::cout << \\\"First 35 unprimeable numbers:\\\\n\\\";\\n integer n = 100;\\n integer lowest[10] = { 0 };\\n for (int count = 0, found = 0; n < limit && (found < 10 || count < 600); ++n) {\\n if (unprimeable(sieve, n)) {\\n if (count < 35) {\\n if (count != 0)\\n std::cout << \\\", \\\";\\n std::cout << n;\\n }\\n ++count;\\n if (count == 600)\\n std::cout << \\\"\\\\n600th unprimeable number: \\\" << n << '\\\\n';\\n int last_digit = n % 10;\\n if (lowest[last_digit] == 0) {\\n lowest[last_digit] = n;\\n ++found;\\n }\\n }\\n }\\n for (int i = 0; i < 10; ++i)\\n std::cout << \\\"Least unprimeable number ending in \\\" << i << \\\": \\\" << lowest[i] << '\\\\n';\\n return 0;\\n}\\n\",\n \"language\": \"C++\"\n },\n {\n \"code\": \"#ifndef PRIME_SIEVE_HPP\\n#define PRIME_SIEVE_HPP\\n\\n#include <algorithm>\\n#include <vector>\\n\\n/**\\n * A simple implementation of the Sieve of Eratosthenes.\\n * See https://en.wikipedia.org/wiki/Sieve_of_Eratosthenes.\\n */\\nclass prime_sieve {\\npublic:\\n explicit prime_sieve(size_t);\\n bool is_prime(size_t) const;\\nprivate:\\n std::vector<bool> is_prime_;\\n};\\n\\n/**\\n * Constructs a sieve with the given limit.\\n *\\n * @param limit the maximum integer that can be tested for primality\\n */\\ninline prime_sieve::prime_sieve(size_t limit) {\\n limit = std::max(size_t(3), limit);\\n is_prime_.resize(limit/2, true);\\n for (size_t p = 3; p * p <= limit; p += 2) {\\n if (is_prime_[p/2 - 1]) {\\n size_t inc = 2 * p;\\n for (size_t q = p * p; q <= limit; q += inc)\\n is_prime_[q/2 - 1] = false;\\n }\\n }\\n}\\n\\n/**\\n * Returns true if the given integer is a prime number. The integer\\n * must be less than or equal to the limit passed to the constructor.\\n *\\n * @param n an integer less than or equal to the limit passed to the\\n * constructor\\n * @return true if the integer is prime\\n */\\ninline bool prime_sieve::is_prime(size_t n) const {\\n if (n == 2)\\n return true;\\n if (n < 2 || n % 2 == 0)\\n return false;\\n return is_prime_.at(n/2 - 1);\\n}\\n\\n#endif\\n\",\n \"language\": \"C++\"\n },\n {\n \"code\": \"import std.algorithm;\\nimport std.array;\\nimport std.conv;\\nimport std.range;\\nimport std.stdio;\\n\\nimmutable MAX = 10_000_000;\\nbool[] primes;\\n\\nbool[] sieve(int limit) {\\n bool[] p = uninitializedArray!(bool[])(limit);\\n p[0..2] = false;\\n p[2..$] = true;\\n foreach (i; 2..limit) {\\n if (p[i]) {\\n for (int j = 2 * i; j < limit; j += i) {\\n p[j] = false;\\n }\\n }\\n }\\n return p;\\n}\\n\\nstring replace(CHAR)(CHAR[] str, int position, CHAR value) {\\n str[position] = value;\\n return str.idup;\\n}\\n\\nbool unPrimeable(int n) {\\n if (primes[n]) {\\n return false;\\n }\\n auto test = n.to!string;\\n foreach (i; 0 .. test.length) {\\n for (char j = '0'; j <= '9'; j++) {\\n auto r = replace(test.dup, i, j);\\n if (primes[r.to!int]) {\\n return false;\\n }\\n }\\n }\\n return true;\\n}\\n\\nvoid displayUnprimeableNumbers(int maxCount) {\\n int test = 1;\\n for (int count = 0; count < maxCount;) {\\n test++;\\n if (unPrimeable(test)) {\\n count++;\\n write(test, ' ');\\n }\\n }\\n writeln;\\n}\\n\\nint nthUnprimeableNumber(int maxCount) {\\n int test = 1;\\n for (int count = 0; count < maxCount;) {\\n test++;\\n if (unPrimeable(test)) {\\n count++;\\n }\\n }\\n return test;\\n}\\n\\nint[] genLowest() {\\n int[] lowest = uninitializedArray!(int[])(10);\\n lowest[] = 0;\\n\\n int count = 0;\\n int test = 1;\\n while (count < 10) {\\n test++;\\n if (unPrimeable(test) && lowest[test % 10] == 0) {\\n lowest[test % 10] = test;\\n count++;\\n }\\n }\\n\\n return lowest;\\n}\\n\\nvoid main() {\\n primes = sieve(MAX);\\n\\n writeln(\\\"First 35 unprimeable numbers:\\\");\\n displayUnprimeableNumbers(35);\\n writeln;\\n\\n int n = 600;\\n writefln(\\\"The %dth unprimeable number = %,d\\\", n, nthUnprimeableNumber(n));\\n writeln;\\n\\n writeln(\\\"Least unprimeable number that ends in:\\\");\\n foreach (i,v; genLowest()) {\\n writefln(\\\" %d is %,d\\\", i, v);\\n }\\n}\\n\",\n \"language\": \"D\"\n },\n {\n \"code\": \"// Unprimeable numbers. Nigel Galloway: May 4th., 2021\\nlet rec fN i g e l=seq{yield! [0..9]|>Seq.map(fun n->n*g+e+l); if g>1 then let g=g/10 in yield! fN(i+g*(e/g)) g (e%g) i}\\nlet fG(n,g)=fN(n*(g/n)) n (g%n) 0|>Seq.exists(isPrime)\\nlet uP()=let rec fN n g=seq{yield! {n..g-1}|>Seq.map(fun g->(n,g)); yield! fN(g)(g*10)} in fN 1 10|>Seq.filter(fG>>not)|>Seq.map snd\\n\",\n \"language\": \"F-Sharp\"\n },\n {\n \"code\": \"uP()|>Seq.take 35|>Seq.iter(printf \\\"%d \\\"); printfn \\\"\\\"\\n\",\n \"language\": \"F-Sharp\"\n },\n {\n \"code\": \"printfn \\\"600th unprimable number is %d\\\" (uP()|>Seq.item 599)\\n\",\n \"language\": \"F-Sharp\"\n },\n {\n \"code\": \"[0..9]|>Seq.iter(fun n->printfn \\\"first umprimable number ending in %d is %d\\\" n (uP()|>Seq.find(fun g->n=g%10)))\\n\",\n \"language\": \"F-Sharp\"\n },\n {\n \"code\": \"let uPx x=let rec fN n g=seq{yield! {n+x..10..g-1}|>Seq.map(fun g->(max 1 n,g)); yield! fN(g)(g*10)} in fN 0 10|>Seq.filter(fG>>not)|>Seq.map snd\\n[0..9]|>Seq.iter(fun n->printfn \\\"first umprimable number ending in %d is %d\\\" n (uPx n|>Seq.head))\\n\",\n \"language\": \"F-Sharp\"\n },\n {\n \"code\": \"USING: assocs formatting io kernel lists lists.lazy\\nlists.lazy.examples math math.functions math.primes math.ranges\\nmath.text.utils prettyprint sequences tools.memory.private ;\\n\\n: one-offs ( n -- seq )\\n dup 1 digit-groups [\\n swapd 10^ [ * ] keep [ - ] dip\\n 2dup [ 9 * ] [ + ] [ <range> ] tri*\\n ] with map-index concat ;\\n\\n: (unprimeable?) ( n -- ? )\\n [ f ] [ one-offs [ prime? ] none? ] if-zero ;\\n\\n: unprimeable? ( n -- ? )\\n dup prime? [ drop f ] [ (unprimeable?) ] if ;\\n\\n: unprimeables ( -- list ) naturals [ unprimeable? ] lfilter ;\\n\\n: ?set-at ( value key assoc -- )\\n 2dup key? [ 3drop ] [ set-at ] if ;\\n\\n: first-digits ( -- assoc )\\n unprimeables H{ } clone [ dup assoc-size 10 = ]\\n [ [ unswons dup 10 mod ] dip [ ?set-at ] keep ] until nip ;\\n\\n\\\"The first 35 unprimeable numbers:\\\" print bl bl\\n35 unprimeables ltake [ pprint bl ] leach nl nl\\n\\n\\\"The 600th unprimeable number:\\\" print bl bl\\n599 unprimeables lnth commas print nl\\n\\n\\\"The first unprimeable number ending with\\\" print\\nfirst-digits [ commas \\\" %d: %9s\\\\n\\\" printf ] assoc-each\\n\",\n \"language\": \"Factor\"\n },\n {\n \"code\": \"Function isprime(n As Ulongint) As boolean\\n If (n=2) Or (n=3) Then Return 1\\n If n Mod 2 = 0 Then Return 0\\n If n Mod 3 = 0 Then Return 0\\n Dim As Ulongint limit=Sqr(N)+1\\n For I As Ulongint = 6 To limit Step 6\\n If N Mod (i-1) = 0 Then Return 0\\n If N Mod (i+1) = 0 Then Return 0\\n Next I\\n Return 1\\nEnd Function\\n\\nSub getnonprimeables(a() As Long)\\n Dim As String s,g\\n Dim As Long count,lim=1300000\\n Redim a(1 To lim)\\n For num As Long=1 To lim\\n g=Str(num)\\n s=g\\n For n As Long=0 To Len(s)-1\\n For m As Long=48 To 57\\n s[n]=m\\n If isprime(Vallng(s)) Then Goto lbl\\n Next m\\n s=g\\n Next n\\n count+=1\\n a(count)=num\\n lbl:\\n Next num\\n Redim Preserve a(1 To count)\\nEnd Sub\\n\\nFunction endings(n As String,a() As Long) As Long\\n For m As Long=1 To Ubound(a)\\n If Right(Str(a(m)),1)=n Then Return a(m)\\n Next m\\nEnd Function\\n\\nRedim As Long n()\\ngetnonprimeables(n())\\nprint \\\" First 35\\\"\\nFor m As Long=1 To 35\\n Print n(m);\\nNext\\nPrint\\nPrint \\\"600th number \\\";n(600)\\nFor z As Long=0 To 9\\n Print \\\"first umprimable number ending in \\\";z; \\\" is \\\";endings(Str(z),n())\\nNext z\\nsleep\\n\",\n \"language\": \"FreeBASIC\"\n },\n {\n \"code\": \"package main\\n\\nimport (\\n \\\"fmt\\\"\\n \\\"strconv\\\"\\n)\\n\\nfunc isPrime(n int) bool {\\n switch {\\n case n < 2:\\n return false\\n case n%2 == 0:\\n return n == 2\\n case n%3 == 0:\\n return n == 3\\n default:\\n d := 5\\n for d*d <= n {\\n if n%d == 0 {\\n return false\\n }\\n d += 2\\n if n%d == 0 {\\n return false\\n }\\n d += 4\\n }\\n return true\\n }\\n}\\n\\nfunc commatize(n int) string {\\n s := fmt.Sprintf(\\\"%d\\\", n)\\n le := len(s)\\n for i := le - 3; i >= 1; i -= 3 {\\n s = s[0:i] + \\\",\\\" + s[i:]\\n }\\n return s\\n}\\n\\nfunc main() {\\n fmt.Println(\\\"The first 35 unprimeable numbers are:\\\")\\n count := 0 // counts all unprimeable numbers\\n var firstNum [10]int // stores the first unprimeable number ending with each digit\\nouter:\\n for i, countFirst := 100, 0; countFirst < 10; i++ {\\n if isPrime(i) {\\n continue // unprimeable number must be composite\\n }\\n s := strconv.Itoa(i)\\n le := len(s)\\n b := []byte(s)\\n for j := 0; j < le; j++ {\\n for k := byte('0'); k <= '9'; k++ {\\n if s[j] == k {\\n continue\\n }\\n b[j] = k\\n n, _ := strconv.Atoi(string(b))\\n if isPrime(n) {\\n continue outer\\n }\\n }\\n b[j] = s[j] // restore j'th digit to what it was originally\\n }\\n lastDigit := s[le-1] - '0'\\n if firstNum[lastDigit] == 0 {\\n firstNum[lastDigit] = i\\n countFirst++\\n }\\n count++\\n if count <= 35 {\\n fmt.Printf(\\\"%d \\\", i)\\n }\\n if count == 35 {\\n fmt.Print(\\\"\\\\n\\\\nThe 600th unprimeable number is: \\\")\\n }\\n if count == 600 {\\n fmt.Printf(\\\"%s\\\\n\\\\n\\\", commatize(i))\\n }\\n }\\n\\n fmt.Println(\\\"The first unprimeable number that ends in:\\\")\\n for i := 0; i < 10; i++ {\\n fmt.Printf(\\\" %d is: %9s\\\\n\\\", i, commatize(firstNum[i]))\\n }\\n}\\n\",\n \"language\": \"Go\"\n },\n {\n \"code\": \"import Control.Lens ((.~), ix, (&))\\nimport Data.Numbers.Primes (isPrime)\\nimport Data.List (find, intercalate)\\nimport Data.Char (intToDigit)\\nimport Data.Maybe (mapMaybe)\\nimport Data.List.Split (chunksOf)\\nimport Text.Printf (printf)\\n\\nisUnprimable :: Int -> Bool\\nisUnprimable = all (not . isPrime) . swapdigits\\n\\nswapdigits :: Int -> [Int]\\nswapdigits n = map read $ go $ pred $ length digits\\n where\\n digits = show n\\n go (-1) = []\\n go n'' = map (\\\\x -> digits & (ix n'') .~ intToDigit x) [0..9] <> go (pred n'')\\n\\nunPrimeable :: [Int]\\nunPrimeable = filter isUnprimable [1..]\\n\\nmain :: IO ()\\nmain = do\\n printf \\\"First 35 unprimeable numbers:\\\\n%s\\\\n\\\\n\\\" $ show $ take 35 unPrimeable\\n printf \\\"600th unprimeable number: %d\\\\n\\\\n\\\" $ unPrimeable !! 599\\n mapM_ (uncurry (printf \\\"Lowest unprimeable number ending with %d: %10s\\\\n\\\")) $ mapMaybe lowest [0..9]\\n where\\n thousands = reverse . intercalate \\\",\\\" . chunksOf 3 . reverse\\n lowest n = do\\n x <- find (\\\\x -> x `mod` 10 == n) unPrimeable\\n pure (n, thousands $ show x)\\n\",\n \"language\": \"Haskell\"\n },\n {\n \"code\": \"NB. replace concatenates at various ranks and in boxes to avoid fill\\nNB. the curtailed prefixes (}:\\\\) with all of 0..9 (i.10) with the beheaded suffixes (}.\\\\.)\\nNB. under the antibase 10 representation (10&#.inv)\\nreplace=: ([: ; <@}:\\\\ ,\\\"1 L:_1 ([: < (i.10) ,\\\"0 1 }.)\\\\.)&.(10&#.inv)\\n\\nNB. primable tests if one of the replacements is prime\\nprimable=: (1 e. 1 p: replace)&>\\n\\nunprimable=: -.@:primable\\n\\nassert 0 1 -: unprimable 193 200\\n\",\n \"language\": \"J\"\n },\n {\n \"code\": \"public class UnprimeableNumbers {\\n\\n private static int MAX = 10_000_000;\\n private static boolean[] primes = new boolean[MAX];\\n\\n public static void main(String[] args) {\\n sieve();\\n System.out.println(\\\"First 35 unprimeable numbers:\\\");\\n displayUnprimeableNumbers(35);\\n int n = 600;\\n System.out.printf(\\\"%nThe %dth unprimeable number = %,d%n%n\\\", n, nthUnprimeableNumber(n));\\n int[] lowest = genLowest();\\n System.out.println(\\\"Least unprimeable number that ends in:\\\");\\n for ( int i = 0 ; i <= 9 ; i++ ) {\\n System.out.printf(\\\" %d is %,d%n\\\", i, lowest[i]);\\n }\\n }\\n\\n private static int[] genLowest() {\\n int[] lowest = new int[10];\\n int count = 0;\\n int test = 1;\\n while ( count < 10 ) {\\n test++;\\n if ( unPrimable(test) && lowest[test % 10] == 0 ) {\\n lowest[test % 10] = test;\\n count++;\\n }\\n }\\n return lowest;\\n }\\n\\n private static int nthUnprimeableNumber(int maxCount) {\\n int test = 1;\\n int count = 0;\\n int result = 0;\\n while ( count < maxCount ) {\\n test++;\\n if ( unPrimable(test) ) {\\n count++;\\n result = test;\\n }\\n }\\n return result;\\n }\\n\\n private static void displayUnprimeableNumbers(int maxCount) {\\n int test = 1;\\n int count = 0;\\n while ( count < maxCount ) {\\n test++;\\n if ( unPrimable(test) ) {\\n count++;\\n System.out.printf(\\\"%d \\\", test);\\n }\\n }\\n System.out.println();\\n }\\n\\n private static boolean unPrimable(int test) {\\n if ( primes[test] ) {\\n return false;\\n }\\n String s = test + \\\"\\\";\\n for ( int i = 0 ; i < s.length() ; i++ ) {\\n for ( int j = 0 ; j <= 9 ; j++ ) {\\n if ( primes[Integer.parseInt(replace(s, i, j))] ) {\\n return false;\\n }\\n }\\n }\\n return true;\\n }\\n\\n private static String replace(String str, int position, int value) {\\n char[] sChar = str.toCharArray();\\n sChar[position] = (char) value;\\n return str.substring(0, position) + value + str.substring(position + 1);\\n }\\n\\n private static final void sieve() {\\n // primes\\n for ( int i = 2 ; i < MAX ; i++ ) {\\n primes[i] = true;\\n }\\n for ( int i = 2 ; i < MAX ; i++ ) {\\n if ( primes[i] ) {\\n for ( int j = 2*i ; j < MAX ; j += i ) {\\n primes[j] = false;\\n }\\n }\\n }\\n }\\n\\n}\\n\",\n \"language\": \"Java\"\n },\n {\n \"code\": \"Number.prototype.isPrime = function() {\\n let i = 2, num = this;\\n if (num == 0 || num == 1) return false;\\n if (num == 2) return true;\\n while (i <= Math.ceil(Math.sqrt(num))) {\\n if (num % i == 0) return false;\\n i++;\\n }\\n return true;\\n}\\n\",\n \"language\": \"JavaScript\"\n },\n {\n \"code\": \"function isUnprimable(num) {\\n if (num < 100 || num.isPrime()) return false;\\n let arr = num.toString().split('');\\n for (let x = 0; x < arr.length; x++) {\\n let lft = arr.slice(0, x),\\n rgt = arr.slice(x + 1);\\n for (let y = 0; y < 10; y++) {\\n let test = lft.join('') + y.toString() + rgt.join('');\\n if (parseInt(test).isPrime()) return false;\\n }\\n }\\n return true;\\n}\\n\",\n \"language\": \"JavaScript\"\n },\n {\n \"code\": \"let unprimeables = [],\\n endings = new Array(10).fill('-'),\\n c = 1;\\nfunction chkEnds(n) {\\n let e = n % 10;\\n if (endings[e] == '-') endings[e] = n;\\n}\\nconsole.time('I');\\nwhile (unprimeables.length < 1000) {\\n if (isUnprimable(c)) {\\n unprimeables.push(c);\\n chkEnds(c)\\n }\\n c++;\\n}\\nconsole.log('The first 35 unprimeables:');\\nconsole.log(unprimeables.slice(0,35).join(', '));\\nconsole.log(`The 600th unprimeable: ${unprimeables[599].toLocaleString('en')}`);\\nconsole.log(`The 1000th unprimable: ${unprimeables[999].toLocaleString('en')}`);\\nconsole.timeEnd('I');\\nconsole.time('II');\\nwhile (endings.includes('-')) {\\n c++;\\n if (isUnprimable(c)) chkEnds(c);\\n}\\nfor (c = 0; c < endings.length; c++) {\\n console.log(`First unprimeable ending with ${c}: ${endings[c].toLocaleString('en')}`);\\n}\\nconsole.timeEnd('II');\\n\",\n \"language\": \"JavaScript\"\n },\n {\n \"code\": \"def digits: tostring | explode | map([.] | implode | tonumber);\\n\\ndef lpad($len): tostring | ($len - length) as $l | (\\\" \\\" * $l)[:$l] + .;\\n\",\n \"language\": \"Jq\"\n },\n {\n \"code\": \"def variants:\\n digits\\n | range(0; length) as $pos\\n | range(0;10) as $newdigit\\n | if .[$pos] == $newdigit then empty\\n else .[$pos] = $newdigit\\n | join(\\\"\\\")|tonumber\\n end;\\n\\ndef is_unprimeable:\\n if is_prime or any(variants; is_prime) then false\\n else true\\n end;\\n\\ndef unprimeables:\\n range(4; infinite) | select(is_unprimeable);\\n\",\n \"language\": \"Jq\"\n },\n {\n \"code\": \"def task:\\n \\\"First 35 unprimeables: \\\",\\n [limit(35; range(0;infinite) | select(is_unprimeable))],\\n\\n \\\"\\\\nThe 600th unprimeable is \\\\( nth(600 - 1; unprimeables) ).\\\",\\n\\n \\\"\\\\nDigit First unprimeable ending with that digit\\\",\\n \\\"-----------------------------------------------\\\",\\n (range(0;10) as $dig\\n | first( range(0;infinite) | select((. % 10 == $dig) and is_unprimeable))\\n | \\\" \\\\($dig) \\\\(lpad(9))\\\" )\\n ;\\n\\ntask\\n\",\n \"language\": \"Jq\"\n },\n {\n \"code\": \"using Primes, Lazy, Formatting\\n\\nfunction isunprimeable(n)\\n dvec = digits(n)\\n for pos in 1:length(dvec), newdigit in 0:9\\n olddigit, dvec[pos] = dvec[pos], newdigit\\n isprime(foldr((i, j) -> i + 10j, dvec)) && return false\\n dvec[pos] = olddigit\\n end\\n return true\\nend\\n\\nprintln(\\\"First 35 unprimeables: \\\", take(35, filter(isunprimeable, Lazy.range())))\\n\\nprintln(\\\"\\\\nThe 600th unprimeable is \\\",\\n collect(take(600, filter(isunprimeable, Lazy.range())))[end])\\n\\nprintln(\\\"\\\\nDigit First unprimeable ending with that digit\\\")\\nprintln(\\\"-----------------------------------------\\\")\\n\\nfor dig in 0:9\\n n = first(filter(x -> (x % 10 == dig) && isunprimeable(x), Lazy.range()))\\n println(\\\" $dig \\\", lpad(format(n, commas=true), 9))\\nend\\n\",\n \"language\": \"Julia\"\n },\n {\n \"code\": \"private const val MAX = 10000000\\nprivate val primes = BooleanArray(MAX)\\n\\nfun main() {\\n sieve()\\n println(\\\"First 35 unprimeable numbers:\\\")\\n displayUnprimeableNumbers(35)\\n val n = 600\\n println()\\n println(\\\"The ${n}th unprimeable number = ${nthUnprimeableNumber(n)}\\\")\\n println()\\n val lowest = genLowest()\\n println(\\\"Least unprimeable number that ends in:\\\")\\n for (i in 0..9) {\\n println(\\\" $i is ${lowest[i]}\\\")\\n }\\n}\\n\\nprivate fun genLowest(): IntArray {\\n val lowest = IntArray(10)\\n var count = 0\\n var test = 1\\n while (count < 10) {\\n test++\\n if (unPrimable(test) && lowest[test % 10] == 0) {\\n lowest[test % 10] = test\\n count++\\n }\\n }\\n return lowest\\n}\\n\\nprivate fun nthUnprimeableNumber(maxCount: Int): Int {\\n var test = 1\\n var count = 0\\n var result = 0\\n while (count < maxCount) {\\n test++\\n if (unPrimable(test)) {\\n count++\\n result = test\\n }\\n }\\n return result\\n}\\n\\nprivate fun displayUnprimeableNumbers(maxCount: Int) {\\n var test = 1\\n var count = 0\\n while (count < maxCount) {\\n test++\\n if (unPrimable(test)) {\\n count++\\n print(\\\"$test \\\")\\n }\\n }\\n println()\\n}\\n\\nprivate fun unPrimable(test: Int): Boolean {\\n if (primes[test]) {\\n return false\\n }\\n val s = test.toString() + \\\"\\\"\\n for (i in s.indices) {\\n for (j in 0..9) {\\n if (primes[replace(s, i, j).toInt()]) {\\n return false\\n }\\n }\\n }\\n return true\\n}\\n\\nprivate fun replace(str: String, position: Int, value: Int): String {\\n val sChar = str.toCharArray()\\n sChar[position] = value.toChar()\\n return str.substring(0, position) + value + str.substring(position + 1)\\n}\\n\\nprivate fun sieve() {\\n // primes\\n for (i in 2 until MAX) {\\n primes[i] = true\\n }\\n for (i in 2 until MAX) {\\n if (primes[i]) {\\n var j = 2 * i\\n while (j < MAX) {\\n primes[j] = false\\n j += i\\n }\\n }\\n }\\n}\\n\",\n \"language\": \"Kotlin\"\n },\n {\n \"code\": \"-- FUNCS:\\nlocal function T(t) return setmetatable(t, {__index=table}) end\\ntable.filter = function(t,f) local s=T{} for _,v in ipairs(t) do if f(v) then s[#s+1]=v end end return s end\\ntable.firstn = function(t,n) local s=T{} n=n>#t and #t or n for i = 1,n do s[i]=t[i] end return s end\\n\\n-- SIEVE:\\nlocal sieve, S = {}, 10000000\\nfor i = 2,S do sieve[i]=true end\\nfor i = 2,S do if sieve[i] then for j=i*i,S,i do sieve[j]=nil end end end\\n\\n-- UNPRIMABLE:\\nlocal unprimables, lowests = T{}, T{}\\nlocal floor, log10 = math.floor, math.log10\\n\\nlocal function unprimable(n)\\n if sieve[n] then return false end\\n local nd = floor(log10(n))+1\\n for i = 1, nd do\\n local pow10 = 10^(nd-i)\\n for j = 0, 9 do\\n local p = (floor(n/10/pow10) * 10 + j) * pow10 + (n % pow10)\\n if sieve[p] then return false end\\n end\\n end\\n return true\\nend\\n\\nlocal n, done = 1, 0\\nwhile done < 10 do\\n if unprimable(n) then\\n unprimables:insert(n)\\n if not lowests[n%10] then\\n lowests[n%10] = n\\n done = done + 1\\n end\\n end\\n n = n + 1\\nend\\n\\n-- OUTPUT:\\nlocal function commafy(i) return tostring(i):reverse():gsub(\\\"(%d%d%d)\\\",\\\"%1,\\\"):reverse():gsub(\\\"^,\\\",\\\"\\\") end\\nprint(\\\"The first 35 unprimable numbers are:\\\")\\nprint(unprimables:firstn(35):concat(\\\" \\\"))\\nprint()\\nprint(\\\"The 600th unprimable number is: \\\" .. commafy(unprimables[600]))\\nprint()\\nprint(\\\"The lowest unprimable number that ends in..\\\")\\nfor i = 0, 9 do\\n print(\\\" \\\" .. i .. \\\" is: \\\" .. commafy(lowests[i]))\\nend\\n\",\n \"language\": \"Lua\"\n },\n {\n \"code\": \"ClearAll[Unprimeable]\\nUnprimeable[in_Integer] := Module[{id, new, pos},\\n id = IntegerDigits[in];\\n pos = Catenate@Table[\\n Table[\\n new = id;\\n new[[d]] = n;\\n new\\n ,\\n {n, 0, 9}\\n ]\\n ,\\n {d, Length[id]}\\n ];\\n pos //= Map[FromDigits];\\n NoneTrue[pos, PrimeQ]\\n ]\\nres = {};\\nPrintTemporary[Dynamic[{Length[res], i}]];\\ni = 0;\\nWhile[Length[res] < 600,\\n If[Unprimeable[i],\\n AppendTo[res, i]\\n ];\\n i++\\n ];\\n\\nPrintTemporary[Dynamic[{lastdig, i}]];\\nout = Table[\\n i = lastdig;\\n While[! Unprimeable[i],\\n i += 10\\n ];\\n i\\n ,\\n {lastdig, 0, 9}\\n ];\\n\\nres[[;; 35]]\\nres[[600]]\\n\\nlastdigit = IntegerDigits /* Last;\\nPrint[\\\"Least unprimeable number ending in \\\", lastdigit[#], \\\": \\\", #] & /@ SortBy[out, lastdigit];\\n\",\n \"language\": \"Mathematica\"\n },\n {\n \"code\": \"import strutils\\n\\nconst N = 10_000_000\\n\\n# Erastosthenes sieve.\\nvar composite: array[0..N, bool] # Defualt is false i.e. composite.\\ncomposite[0] = true\\ncomposite[1] = true\\nfor n in 2..N:\\n if not composite[n]:\\n for k in countup(n * n, N, n):\\n composite[k] = true\\n\\ntemplate isPrime(n: int): bool = not composite[n]\\n\\n\\nproc isUmprimeable(n: Positive): bool =\\n if n.isPrime: return false\\n var nd = $n\\n for i, prevDigit in nd:\\n for newDigit in '0'..'9':\\n if newDigit != prevDigit:\\n nd[i] = newDigit\\n if nd.parseInt.isPrime: return false\\n nd[i] = prevDigit # Restore initial digit.\\n result = true\\n\\n\\necho \\\"First 35 unprimeable numbers:\\\"\\nvar n = 100\\nvar list: seq[int]\\nwhile list.len < 35:\\n if n.isUmprimeable:\\n list.add n\\n inc n\\necho list.join(\\\" \\\"), '\\\\n'\\n\\nvar count = 0\\nn = 199\\nwhile count != 600:\\n inc n\\n if n.isUmprimeable: inc count\\necho \\\"600th unprimeable number: \\\", ($n).insertSep(','), '\\\\n'\\n\\nfor d in 0..9:\\n var n = 200 + d\\n while not n.isUmprimeable:\\n inc n, 10\\n echo \\\"Lowest unprimeable number ending in \\\", d, \\\" is \\\", ($n).insertSep(',')\\n\",\n \"language\": \"Nim\"\n },\n {\n \"code\": \"program unprimable;\\n{$IFDEF FPC}{$Mode Delphi}{$ELSE}{$APPTYPE CONSOLE}{$ENDIF}\\n\\nconst\\n base = 10;\\n\\ntype\\n TNumVal = array[0..base-1] of NativeUint;\\n TConvNum = record\\n NumRest : TNumVal;\\n LowDgt,\\n MaxIdx : NativeUint;\\n end;\\n\\nvar //global\\n PotBase,\\n EndDgtFound : TNumVal;\\n TotalCnt,\\n EndDgtCnt :NativeUint;\\n\\nprocedure Init;\\nvar\\n i,val : NativeUint;\\nBegin\\n val := 1;\\n For i := low(TNumVal) to High(TNumVal) do\\n Begin\\n EndDgtFound[i] :=0;\\n PotBase[i] := val;\\n val := val * Base;\\n end;\\n TotalCnt := 0;\\n EndDgtCnt := 0;\\nend;\\n\\nProcedure ConvertNum(n: NativeUint;var NConv:TConvNum);\\n//extract digit position replace by \\\"0\\\" to get NumRest\\n// 173 -> 170 -> 103 -> 073\\nvar\\n i, dgt,n_red,n_mod: NativeUint;\\nbegin\\n i := 0;\\n n_red := n;\\n with NConv do\\n Begin\\n repeat\\n n_mod := n_red DIV Base;\\n dgt := n_red-Base*n_mod;\\n n_red := n_mod;\\n IF i = 0 then\\n LowDgt := dgt;\\n NumRest[i]:= n-dgt*PotBase[i];\\n inc(i);\\n until (i > High(TNumVal)) OR (n<PotBase[i]);\\n MaxIdx := i-1;\\n end;\\nend;\\n\\nprocedure CheckOutPut(n: NativeUint);\\nBegin\\n IF TotalCnt > 600 then\\n EXIT;\\n IF TotalCnt <= 35 then\\n write(n,' ');\\n IF TotalCnt = 600 then\\n Begin\\n writeln;\\n writeln;\\n writeln('the 600.th unprimable number: ',n);\\n end;\\nend;\\n\\nfunction isPrime(n : NativeUint):boolean;inline;\\nvar\\n p : NativeUint;\\nBegin\\n result := (N=2) OR (N=3);\\n IF result then\\n EXIT;\\n //now result = false\\n IF (n<2) OR (NOT(ODD(n))) or (n mod 3= 0) then\\n EXIT;\\n p := 5;\\n while p*p <= n do\\n Begin\\n if n mod p = 0 then\\n Exit;\\n inc(p,2);\\n if n mod p = 0 then\\n Exit;\\n inc(p,4);\\n end;\\n result := true;\\nend;\\n\\nprocedure InsertFound(LowDgt,n:NativeUInt);\\nBegin\\n inc(TotalCnt);\\n IF EndDgtFound[LowDgt] = 0 then\\n Begin\\n EndDgtFound[LowDgt] := n;\\n inc(EndDgtCnt);\\n end;\\nend;\\n\\nfunction CheckUnprimable(n:NativeInt):boolean;\\nvar\\n ConvNum : TConvNum;\\n val,dgt,i,dtfac: NativeUint;\\nBegin\\n ConvertNum(n,ConvNum);\\n result := false;\\n //lowest digit\\n with ConvNum do\\n Begin\\n val := NumRest[0];\\n For dgt := 0 to Base-1 do\\n IF isPrime(val+dgt) then\\n EXIT;\\n dgt := LowDgt;\\n\\n result := true;\\n i := MaxIdx;\\n IF NumRest[i] >= Base then\\n Begin\\n//****Only for base=10 if even or divisible by 5***\\n IF Not(ODD(dgt)) OR (dgt=5) then\\n Begin\\n InsertFound(dgt,n);\\n EXIT;\\n end;\\n end;\\n\\n result := false;\\n For i := MaxIdx downto 1 do\\n Begin\\n dtfac := PotBase[i];\\n val := NumRest[i];\\n For dgt := 0 to Base-1 do\\n Begin\\n IF isPrime(val) then\\n EXIT;\\n inc(val,dtfac);\\n end;\\n end;\\n InsertFound(LowDgt,n);\\n result := true;\\n end;\\nend;\\n\\nfunction CheckUnprimableReduced(n:NativeInt):boolean;\\n//lowest digit already tested before\\nvar\\n ConvNum : TConvNum;\\n val,dgt,i,dtfac: NativeUint;\\nBegin\\n ConvertNum(n,ConvNum);\\n result := true;\\n with ConvNum do\\n Begin\\n i := MaxIdx;\\n IF NumRest[i] >= Base then\\n Begin\\n dgt := LowDgt;\\n IF Not(ODD(dgt)) OR (dgt=5) then\\n Begin\\n InsertFound(dgt,n);\\n EXIT;\\n end;\\n end;\\n\\n result := false;\\n For i := i downto 1 do\\n Begin\\n dtfac := PotBase[i];\\n val := NumRest[i];\\n For dgt := 0 to Base-1 do\\n Begin\\n IF isPrime(val) then\\n EXIT;\\n inc(val,dtfac);\\n end;\\n end;\\n InsertFound(LowDgt,n);\\n result := true;\\n end;\\nend;\\n\\nvar\\n n,i : NativeUint;\\nBegin\\n init;\\n n := Base;\\n repeat\\n If CheckUnprimable(n) then\\n Begin\\n CheckOutPut(n);\\n For i := 1 to Base-1 do\\n Begin\\n IF CheckUnprimableReduced(n+i) then\\n CheckOutPut(n+i);\\n end;\\n end;\\n inc(n,Base);\\n until EndDgtCnt = Base;\\n writeln;\\n For i := 0 to Base-1 do\\n Writeln ('lowest digit ',i:2,' found first ',EndDgtFound[i]:7);\\n writeln;\\n writeln('There are ',TotalCnt,' unprimable numbers upto ',n);\\n {$IFNDEF UNIX}readln;{$ENDIF}\\nend.\\n\",\n \"language\": \"Pascal\"\n },\n {\n \"code\": \"program unprimable;\\n{$IFDEF FPC}\\n {$Mode Delphi}\\n {$OPTIMIZATION ON,ALL}\\n{$ELSE}\\n //Delphi\\n {$APPTYPE CONSOLE}\\n{$ENDIF}\\nuses\\n sysutils;\\nconst\\n Base = 10;\\n dgtcnt = 9;\\n Limit = Base* Base*Base*Base*Base* Base*Base*Base*Base;\\n{\\n Base = 18;\\n dgtcnt = 8;\\n Limit = Base*Base*Base*Base* Base*Base*Base*Base;\\n * }\\n\\n PrimeLimit = Limit+Base;\\n{\\n Limit = 1000*1000*1000;\\n dgtcnt = trunc(ln(Limit-1)/ln(Base));\\n PrimeLimit = Trunc(exp(ln(base)*(dgtcnt+1)))+Base;\\n}\\ntype\\n TNumVal = array[0..dgtcnt] of NativeUint;\\n TConvNum = record\\n NumRest,\\n Digits : TNumVal;\\n num,\\n MaxIdx : NativeUint;\\n end;\\n\\nvar //global\\n ConvNum:TConvNum;\\n PotBase: TNumVal;\\n EndDgtFound : array[0..Base-1] of NativeUint;\\n TotalCnt,\\n EndDgtCnt :NativeUint;\\n\\n//http://rosettacode.org/wiki/Sieve_of_Eratosthenes#alternative_using_wheel\\n\\nvar\\n pPrimes : pBoolean;\\n //always initialized with 0 => false at startup\\n primes: array of boolean;\\n\\nfunction BuildWheel: NativeUint;\\nvar\\n myPrimes : pBoolean;\\n wheelprimes :array[0..31] of byte;\\n wheelSize,wpno,\\n pr,pw,i, k: NativeUint;\\nbegin\\n myPrimes := @primes[0];\\n pr := 1;\\n myPrimes[1]:= true;\\n WheelSize := 1;\\n\\n wpno := 0;\\n repeat\\n inc(pr);\\n\\n pw := pr;\\n if pw > wheelsize then\\n dec(pw,wheelsize);\\n If myPrimes[pw] then\\n begin\\n k := WheelSize+1;\\n //turn the wheel (pr-1)-times\\n for i := 1 to pr-1 do\\n begin\\n inc(k,WheelSize);\\n if k<primeLimit then\\n move(myPrimes[1],myPrimes[k-WheelSize],WheelSize)\\n else\\n begin\\n move(myPrimes[1],myPrimes[k-WheelSize],PrimeLimit-WheelSize*i);\\n break;\\n end;\\n end;\\n dec(k);\\n IF k > primeLimit then\\n k := primeLimit;\\n wheelPrimes[wpno] := pr;\\n myPrimes[pr] := false;\\n\\n inc(wpno);\\n //the new wheelsize\\n WheelSize := k;\\n\\n //sieve multiples of the new found prime\\n i:= pr;\\n i := i*i;\\n while i <= k do\\n begin\\n myPrimes[i] := false;\\n inc(i,pr);\\n end;\\n end;\\n until WheelSize >= PrimeLimit;\\n\\n //re-insert wheel-primes 1 still stays prime\\n while wpno > 0 do\\n begin\\n dec(wpno);\\n myPrimes[wheelPrimes[wpno]] := true;\\n end;\\n myPrimes[0] := false;\\n myPrimes[1] := false;\\n\\n BuildWheel := pr+1;\\n writeln;\\nend;\\n\\nprocedure Sieve;\\nvar\\n myPrimes : pBoolean;\\n sieveprime,\\n fakt : NativeUint;\\nbegin\\n setlength(Primes,PrimeLimit+1);\\n pPrimes := @Primes[0];\\n myPrimes := pPrimes;\\n//pPrimes[1] = true is needed to stop for sieveprime = 2\\n// at //Search next smaller possible prime\\n sieveprime := BuildWheel;\\n//alternative here\\n //fillchar(pPrimes,SizeOf(pPrimes),chr(ord(true)));sieveprime := 2;\\n repeat\\n if myPrimes[sieveprime] then\\n begin\\n //eliminate 'possible prime' multiples of sieveprime\\n //must go downwards\\n //2*2 would unmark 4 -> 4*2 = 8 wouldnt be unmarked\\n fakt := PrimeLimit DIV sieveprime;\\n IF fakt < sieveprime then\\n BREAK;\\n repeat\\n //Unmark\\n myPrimes[sieveprime*fakt] := false;\\n //Search next smaller possible prime\\n repeat\\n dec(fakt);\\n until myPrimes[fakt];\\n until fakt < sieveprime;\\n end;\\n inc(sieveprime);\\n until false;\\n //remove 1\\n myPrimes[1] := false;\\nend;\\n\\nprocedure Init;\\nvar\\n i,val : NativeUint;\\nBegin\\n val := 1;\\n For i := low(TNumVal) to High(TNumVal) do\\n Begin\\n EndDgtFound[i] :=0;\\n PotBase[i] := val;\\n val := val * Base;\\n end;\\n TotalCnt := 0;\\n EndDgtCnt := 0;\\nend;\\n\\nprocedure OutConvNum(const NConv:TConvNum);\\nvar\\n i : NativeInt;\\nBegin\\n with NConv do\\n begin\\n writeln(num,MaxIdx:10);\\n For i := MaxIdx Downto MaxIdx do\\n write(Digits[i]);\\n writeln;\\n For i := MaxIdx Downto MaxIdx do\\n write(NumRest[i]:8);\\n end\\nend;\\n\\nprocedure IncConvertNum(var NConv:TConvNum);\\nvar\\n i,k : NativeInt;\\nBegin\\n with NConv do\\n begin\\n i := 0;\\n repeat\\n k := Digits[i]+1;\\n IF k < Base then\\n Begin\\n Digits[i] := k;\\n BREAK;\\n end\\n else\\n Begin\\n Digits[i] := k-Base;\\n inc(i);\\n end;\\n until i > MaxIdx;\\n IF i > MaxIdx then\\n Begin\\n Digits[i] := 1;\\n MaxIdx := i;\\n end;\\n\\n k := num+1;\\n i := MaxIdx;\\n repeat\\n NumRest[i]:= k-Digits[i]*PotBase[i];\\n dec(i);\\n until i < 0;\\n num := k;\\n end;\\nend;\\n\\nprocedure IncConvertNumBase(var NConv:TConvNum);\\nvar\\n i,k : NativeInt;\\nBegin\\n with NConv do\\n begin\\n i := 1;\\n Digits[0] := 0;\\n repeat\\n k := Digits[i]+1;\\n IF k < Base then\\n Begin\\n Digits[i] := k;\\n BREAK;\\n end\\n else\\n Begin\\n Digits[i] := k-Base;\\n inc(i);\\n end;\\n until i > MaxIdx;\\n IF i > MaxIdx then\\n Begin\\n Digits[i] := 1;\\n MaxIdx := i;\\n end;\\n k := num+Base;\\n i := MaxIdx;\\n repeat\\n NumRest[i]:= k-Digits[i]*PotBase[i];\\n dec(i);\\n until i < 0;\\n num := k;\\n end;\\nend;\\n\\nProcedure ConvertNum(n: NativeUint;var NConv:TConvNum);\\n//extract digit position replace by \\\"0\\\" to get NumRest\\n// 173 -> 170 -> 103 -> 073\\nvar\\n i, dgt,n_red,n_div: NativeUint;\\nbegin\\n i := 0;\\n with NConv do\\n Begin\\n num := n;\\n n_red := n;\\n repeat\\n n_div := n_red DIV Base;\\n dgt := n_red-Base*n_div;\\n n_red := n_div;\\n Digits[i] := dgt;\\n NumRest[i]:= n-dgt*PotBase[i];\\n inc(i);\\n until (n_red= 0)OR (i > High(TNumVal));\\n MaxIdx := i-1;\\n end;\\nend;\\n\\nprocedure InsertFound(dgt,n:NativeUInt);\\nBegin\\n IF EndDgtFound[dgt] = 0 then\\n Begin\\n EndDgtFound[dgt] := n;\\n inc(EndDgtCnt);\\n end;\\nend;\\n\\nfunction CheckUnprimable(const ConvNum:TConvNum):boolean;\\nvar\\n myPrimes : pBoolean;\\n val,dgt,i,dtfac: NativeUint;\\nBegin\\n myPrimes := pPrimes;\\n result := false;\\n with ConvNum do\\n Begin\\n //lowest digit. Check only resulting odd numbers num > base\\n val := NumRest[0];\\n dgt := 1- (val AND 1);\\n repeat\\n IF myPrimes[val+dgt] then\\n EXIT;\\n inc(dgt,2);\\n until dgt >= Base;\\n\\n For i := 1 to MaxIdx do\\n Begin\\n val := NumRest[i];\\n dtfac := PotBase[i];\\n IF (val >= BASE) then\\n Begin\\n IF NOt(Odd(val)) AND NOT(ODD(dtfac)) then\\n continue;\\n For dgt := 0 to Base-1 do\\n Begin\\n IF myPrimes[val] then\\n EXIT;\\n inc(val,dtfac);\\n end;\\n end\\n else\\n Begin\\n For dgt := 0 to Base-1 do\\n Begin\\n IF myPrimes[val] then\\n EXIT;\\n inc(val,dtfac);\\n end;\\n end\\n end;\\n inc(TotalCnt);\\n result := true;\\n end;\\nend;\\n\\nvar\\n n,i,Lmt,Lmt10 : NativeUint;\\nBegin\\n init;\\n Sieve;\\n n := Base;\\n Lmt10 := 10;\\n Lmt := Base;\\n ConvertNum(n,ConvNum);\\n writeln('Base ',ConvNum.num);\\n //InsertFound takes a lot of time.So check it as long as neccessary\\n while EndDgtCnt <Base do\\n Begin\\n If CheckUnprimable(ConvNum) then\\n Begin\\n InsertFound(ConvNum.Digits[0],n);\\n For i := 1 to Base-1 do\\n Begin\\n inc(n);\\n IncConvertNum(ConvNum);\\n IF CheckUnprimable(ConvNum) then\\n InsertFound(ConvNum.Digits[0],n);\\n end;\\n inc(n);\\n IncConvertNum(ConvNum);\\n end\\n else\\n Begin\\n inc(n,Base);\\n IncConvertNumBase(ConvNum);\\n end;\\n if n >= Lmt10 then\\n Begin\\n writeln('There are ',TotalCnt,' unprimable numbers upto ',n);\\n Lmt10 := Lmt10*10;\\n end;\\n if (Base <> 10) AND (n >= Lmt) then\\n Begin\\n writeln('There are ',TotalCnt,' unprimable numbers upto ',n);\\n Lmt := Lmt*Base;\\n end;\\n end;\\n //All found\\n repeat\\n If CheckUnprimable(ConvNum) then\\n Begin\\n For i := 1 to Base-1 do\\n Begin\\n inc(n);\\n IncConvertNum(ConvNum);\\n CheckUnprimable(ConvNum)\\n end;\\n inc(n);\\n IncConvertNum(ConvNum);\\n end\\n else\\n Begin\\n inc(n,Base);\\n IncConvertNumBase(ConvNum);\\n end;\\n\\n if n >= Lmt10 then\\n Begin\\n writeln('There are ',TotalCnt,' unprimable numbers upto ',n);\\n Lmt10 := Lmt10*10;\\n end;\\n\\n if (Base <> 10) AND (n >= Lmt) then\\n Begin\\n writeln('There are ',TotalCnt,' unprimable numbers upto ',n);\\n Lmt := Lmt*Base;\\n end;\\n until n >= Limit;\\n writeln;\\n For i := 0 to Base-1 do\\n Writeln ('lowest digit ',i:2,' found first ',EndDgtFound[i]:7);\\n writeln;\\n writeln('There are ',TotalCnt,' unprimable numbers upto ',n);\\n setlength(Primes,0);\\nend.\\n\",\n \"language\": \"Pascal\"\n },\n {\n \"code\": \"use strict;\\nuse warnings;\\nuse feature 'say';\\nuse ntheory 'is_prime';\\nuse enum qw(False True);\\n\\nsub comma { reverse ((reverse shift) =~ s/(.{3})/$1,/gr) =~ s/^,//r }\\n\\nsub is_unprimeable {\\n my($n) = @_;\\n return False if is_prime($n);\\n my $chrs = length $n;\\n for my $place (0..$chrs-1) {\\n my $pow = 10**($chrs - $place - 1);\\n my $this = substr($n, $place, 1) * $pow;\\n map { return False if $this != $_ and is_prime($n - $this + $_ * $pow) } 0..9;\\n }\\n True\\n}\\n\\nmy($n, @ups);\\ndo { push @ups, $n if is_unprimeable(++$n); } until @ups == 600;\\nsay \\\"First 35 unprimeables:\\\\n\\\" . join ' ', @ups[0..34];\\nprintf \\\"\\\\n600th unprimeable: %s\\\\n\\\", comma $ups[599];\\n\\nmap {\\n my $x = $_;\\n while ($x += 10) { last if is_unprimeable($x) }\\n say \\\"First unprimeable that ends with $_: \\\" . sprintf \\\"%9s\\\", comma $x;\\n} 0..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: #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 35 unprimeable numbers are:\\\\n\\\"</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;\\\">0</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000080;font-style:italic;\\\">-- counts all unprimeable numbers</span>\\n <span style=\\\"color: #000000;\\\">countFirst</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">0</span><span style=\\\"color: #0000FF;\\\">,</span>\\n <span style=\\\"color: #000000;\\\">i</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">100</span>\\n <span style=\\\"color: #004080;\\\">sequence</span> <span style=\\\"color: #000000;\\\">firstNum</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;\\\">10</span><span style=\\\"color: #0000FF;\\\">)</span> <span style=\\\"color: #000080;font-style:italic;\\\">-- stores the first unprimeable number ending with each digit</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> <span style=\\\"color: #000000;\\\">t1</span><span style=\\\"color: #0000FF;\\\">=</span><span style=\\\"color: #000000;\\\">t0</span><span style=\\\"color: #0000FF;\\\">+</span><span style=\\\"color: #000000;\\\">1</span>\\n <span style=\\\"color: #008080;\\\">while</span> <span style=\\\"color: #000000;\\\">countFirst</span><span style=\\\"color: #0000FF;\\\"><</span><span style=\\\"color: #000000;\\\">10</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;\\\">i</span><span style=\\\"color: #0000FF;\\\">)</span> <span style=\\\"color: #008080;\\\">then</span> <span style=\\\"color: #000080;font-style:italic;\\\">-- unprimeable number must be composite</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;\\\">\\\"%d\\\"</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">i</span><span style=\\\"color: #0000FF;\\\">),</span> <span style=\\\"color: #000000;\\\">b</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">s</span>\\n <span style=\\\"color: #004080;\\\">integer</span> <span style=\\\"color: #000000;\\\">le</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>\\n <span style=\\\"color: #004080;\\\">bool</span> <span style=\\\"color: #000000;\\\">primeable</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #004600;\\\">false</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;\\\">le</span> <span style=\\\"color: #008080;\\\">do</span>\\n <span style=\\\"color: #008080;\\\">for</span> <span style=\\\"color: #000000;\\\">k</span><span style=\\\"color: #0000FF;\\\">=</span><span style=\\\"color: #008000;\\\">'0'</span> <span style=\\\"color: #008080;\\\">to</span> <span style=\\\"color: #008000;\\\">'9'</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;\\\">j</span><span style=\\\"color: #0000FF;\\\">]!=</span><span style=\\\"color: #000000;\\\">k</span> <span style=\\\"color: #008080;\\\">then</span>\\n <span style=\\\"color: #000000;\\\">b</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">j</span><span style=\\\"color: #0000FF;\\\">]</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">k</span>\\n <span style=\\\"color: #004080;\\\">integer</span> <span style=\\\"color: #000000;\\\">n</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">to_integer</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">b</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #008080;\\\">if</span> <span style=\\\"color: #7060A8;\\\">is_prime</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">n</span><span style=\\\"color: #0000FF;\\\">)</span> <span style=\\\"color: #008080;\\\">then</span>\\n <span style=\\\"color: #000000;\\\">primeable</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: #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;\\\">primeable</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;\\\">b</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">j</span><span style=\\\"color: #0000FF;\\\">]</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">s</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">j</span><span style=\\\"color: #0000FF;\\\">]</span> <span style=\\\"color: #000080;font-style:italic;\\\">-- restore j'th digit to what it was originally</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;\\\">primeable</span> <span style=\\\"color: #008080;\\\">then</span>\\n <span style=\\\"color: #004080;\\\">integer</span> <span style=\\\"color: #000000;\\\">lastDigit</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">s</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">le</span><span style=\\\"color: #0000FF;\\\">]-</span><span style=\\\"color: #008000;\\\">'0'</span><span style=\\\"color: #0000FF;\\\">+</span><span style=\\\"color: #000000;\\\">1</span>\\n <span style=\\\"color: #008080;\\\">if</span> <span style=\\\"color: #000000;\\\">firstNum</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">lastDigit</span><span style=\\\"color: #0000FF;\\\">]</span> <span style=\\\"color: #0000FF;\\\">==</span> <span style=\\\"color: #000000;\\\">0</span> <span style=\\\"color: #008080;\\\">then</span>\\n <span style=\\\"color: #000000;\\\">firstNum</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">lastDigit</span><span style=\\\"color: #0000FF;\\\">]</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">i</span>\\n <span style=\\\"color: #000000;\\\">countFirst</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;\\\">count</span> <span style=\\\"color: #0000FF;\\\">+=</span> <span style=\\\"color: #000000;\\\">1</span>\\n <span style=\\\"color: #008080;\\\">if</span> <span style=\\\"color: #000000;\\\">count</span> <span style=\\\"color: #0000FF;\\\"><=</span> <span style=\\\"color: #000000;\\\">35</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;\\\">\\\"%d \\\"</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">i</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #008080;\\\">elsif</span> <span style=\\\"color: #000000;\\\">count</span> <span style=\\\"color: #0000FF;\\\">==</span> <span style=\\\"color: #000000;\\\">600</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;\\\">\\\"\\\\n\\\\nThe 600th unprimeable number is: %,d\\\\n\\\\n\\\"</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;\\\">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: #7060A8;\\\">platform</span><span style=\\\"color: #0000FF;\\\">()!=</span><span style=\\\"color: #004600;\\\">JS</span> <span style=\\\"color: #008080;\\\">and</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;\\\">\\\"checking %d, %d `endswiths` found\\\\r\\\"</span><span style=\\\"color: #0000FF;\\\">,{</span><span style=\\\"color: #000000;\\\">i</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">countFirst</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: #000000;\\\">i</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 <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 unprimeable number that ends in:\\\\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;\\\">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;\\\">\\\" %d is: %,9d\\\\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: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">firstNum</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: #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<!--\\n\",\n \"language\": \"Phix\"\n },\n {\n \"code\": \"bool is_unprimeable(int i)\\n{\\n string s = i->digits();\\n for(int offset; offset < sizeof(s); offset++) {\\n\\tforeach(\\\"0123456789\\\"/1, string repl) {\\n\\t array chars = s/1;\\n\\t chars[offset] = repl;\\n\\t int testme = (int)(chars*\\\"\\\");\\n\\t if( testme->probably_prime_p() )\\n\\t\\treturn false;\\n\\t}\\n }\\n return true;\\n}\\n\\nvoid main()\\n{\\n int i, count;\\n array unprimes = ({});\\n mapping first_enders = ([]); // first unprimeable ending with each digit\\n while(sizeof(first_enders) != 10) {\\n\\ti++;\\n\\tif( is_unprimeable(i) ) {\\n\\t count++;\\n\\t unprimes += ({ i });\\n\\t string last_digit = i->digits()[<0..];\\n\\t if( !first_enders[last_digit] )\\n\\t\\tfirst_enders[last_digit] = i;\\n\\t}\\n\\twerror(\\\"%d\\\\r\\\", i); // Progress output\\n }\\n\\n write(\\\"First 35 unprimeables: %s\\\\n\\\\n\\\", (array(string))unprimes[0..34]*\\\" \\\");\\n write(\\\"The 600th unprimeable is %d\\\\n\\\\n\\\", unprimes[599]);\\n write(\\\"The first unprimeable number that ends in\\\\n\\\");\\n foreach(sort(indices(first_enders)), string e) {\\n\\twrite(\\\" %s is: %9d\\\\n\\\", e, first_enders[e]);\\n }\\n}\\n\",\n \"language\": \"Pike\"\n },\n {\n \"code\": \"from itertools import count, islice\\n\\ndef primes(_cache=[2, 3]):\\n yield from _cache\\n for n in count(_cache[-1]+2, 2):\\n if isprime(n):\\n _cache.append(n)\\n yield n\\n\\ndef isprime(n, _seen={0: False, 1: False}):\\n def _isprime(n):\\n for p in primes():\\n if p*p > n:\\n return True\\n if n%p == 0:\\n return False\\n\\n if n not in _seen:\\n _seen[n] = _isprime(n)\\n return _seen[n]\\n\\ndef unprime():\\n for a in count(1):\\n d = 1\\n while d <= a:\\n base = (a//(d*10))*(d*10) + (a%d) # remove current digit\\n if any(isprime(y) for y in range(base, base + d*10, d)):\\n break\\n d *= 10\\n else:\\n yield a\\n\\n\\nprint('First 35:')\\nprint(' '.join(str(i) for i in islice(unprime(), 35)))\\n\\nprint('\\\\nThe 600-th:')\\nprint(list(islice(unprime(), 599, 600))[0])\\nprint()\\n\\nfirst, need = [False]*10, 10\\nfor p in unprime():\\n i = p%10\\n if first[i]: continue\\n\\n first[i] = p\\n need -= 1\\n if not need:\\n break\\n\\nfor i,v in enumerate(first):\\n print(f'{i} ending: {v}')\\n\",\n \"language\": \"Python\"\n },\n {\n \"code\": \"#lang racket\\n\\n(require math/number-theory)\\n\\n(define cached-prime?\\n (let ((hsh# (make-hash))) (λ (p) (hash-ref! hsh# p (λ () (prime? p))))))\\n\\n(define (zero-digit n d)\\n (define p (expt 10 d))\\n (+ (remainder n p) (* 10 p (quotient n (* p 10)))))\\n\\n(define (primeable? n)\\n (or (cached-prime? n)\\n (for*/first ((d (in-range (add1 (order-of-magnitude n))))\\n (n0 (in-value (zero-digit n d)))\\n (p (in-value (expt 10 d)))\\n (r (in-range 10))\\n (n+ (in-value (+ n0 (* r p))))\\n #:when (cached-prime? n+))\\n n+)))\\n\\n(define unprimeable? (negate primeable?))\\n\\n(module+\\n main\\n (printf \\\"First 35 unprimeable numbers: ~a~%\\\"\\n (let recur ((i 0) (n 1) (acc null))\\n (cond [(= i 35) (reverse acc)]\\n [(unprimeable? n) (recur (add1 i) (add1 n) (cons n acc))]\\n [else (recur i (add1 n) acc)])))\\n\\n (printf \\\"600th unprimeable number: ~a~%\\\"\\n (let recur ((i 0) (n 1) (u #f))\\n (cond [(= i 600) u]\\n [(unprimeable? n) (recur (add1 i) (add1 n) n)]\\n [else (recur i (add1 n) u)])))\\n\\n (for ((d 10))\\n (printf \\\"Least unprimeable number ending in ~a = ~a~%\\\" d\\n (for/first ((i (in-range (+ 100 d) +Inf.0 10)) #:when (unprimeable? i)) i))))\\n\\n(module+ test\\n (require rackunit)\\n (check-equal? (zero-digit 1234 2) 1034)\\n (check-equal? (primeable? 10) 11)\\n (check-true (unprimeable? 200))\\n (check-false (unprimeable? 201)))\\n\",\n \"language\": \"Racket\"\n },\n {\n \"code\": \"use ntheory:from<Perl5> <is_prime>;\\nuse Lingua::EN::Numbers;\\n\\nsub is-unprimeable (\\\\n) {\\n return False if n.&is_prime;\\n my \\\\chrs = n.chars;\\n for ^chrs -> \\\\place {\\n my \\\\pow = 10**(chrs - place - 1);\\n my \\\\this = n.substr(place, 1) × pow;\\n ^10 .map: -> \\\\dgt {\\n next if this == dgt;\\n return False if is_prime(n - this + dgt × pow)\\n }\\n }\\n True\\n}\\n\\nmy @ups = lazy ^∞ .grep: { .&is-unprimeable };\\n\\nsay \\\"First 35 unprimeables:\\\\n\\\" ~ @ups[^35];\\n\\nsay \\\"\\\\n{ordinal-digit(600, :u)} unprimeable: \\\" ~ comma( @ups[599] ) ~ \\\"\\\\n\\\";\\n\\n^10 .map: -> \\\\n {\\n print \\\"First unprimeable that ends with {n}: \\\" ~\\n sprintf \\\"%9s\\\\n\\\", comma (n, *+10 … *).race.first: { .&is-unprimeable }\\n}\\n\",\n \"language\": \"Raku\"\n },\n {\n \"code\": \"/*REXX program finds and displays unprimeable numbers (non─negative integers). */\\nparse arg n x hp . /*obtain optional arguments from the CL*/\\nif n=='' | n==\\\",\\\" then n= 35 /*Not specified? Then use the default.*/\\nif x=='' | x==\\\",\\\" then x= 600 /* \\\" \\\" \\\" \\\" \\\" \\\" */\\nif hp=='' | hp==\\\",\\\" then hp= 10000000 /* \\\" \\\" \\\" \\\" \\\" \\\" */\\nu= 0 /*number of unprimeable numbers so far.*/\\neds=4; ed.1= 1; ed.2= 3; ed.3= 7; ed.4= 9 /*\\\"end\\\" digits which are prime; prime>9*/\\ncall genP hp /*generate primes up to & including HP.*/\\n$$=; $.=. /*a list \\\" \\\" \\\" \\\" \\\" */\\n do j=100; if !.j then iterate /*Prime? Unprimeable must be composite*/\\n Lm= length(j) /*obtain the length-1 of the number J. */\\n meat= left(j, Lm) /*obtain the first Lm digits of J. */\\n /* [↑] examine the \\\"end\\\" digit of J. */\\n do e_=1 for eds; new= meat || ed.e_ /*obtain a different number (than J).*/\\n if new==j then iterate /*Is it the original number? Then skip.*/\\n if !.new then iterate j /*This new number a prime? \\\" \\\" */\\n end /*e_*/\\n /* [↑] examine a new 1st digit of J. */\\n do f_=0 for 10; new= (f_||meat) + 0 /*obtain a different number (than J).*/\\n if new==j then iterate /*Is it the original number? Then skip.*/\\n if !.new then iterate j /*This new number a prime? \\\" \\\" */\\n end /*f_*/ /* [↑] examine the front digit of J. */\\n do a_= 2 for Lm-1 /*traipse through the middle digits. */\\n meat= left(j, a_ - 1) /*use a number of left─most dec. digits*/\\n rest= substr(j, a_ + 1) /* \\\" \\\" \\\" \\\" right─most \\\" \\\" */\\n do n_=0 for 10 /*traipse through all 1─digit numbers. */\\n new= meat || n_ || rest /*construct new number, like a phoenix.*/\\n if new==j then iterate /*Is it the original number? Then skip.*/\\n if !.new then iterate j /*This new number a prime? \\\" \\\" */\\n end /*n_*/\\n end /*a_*/\\n u= u + 1 /*bump the count of unprimeable numbers*/\\n if u<=n then $$= $$ commas(j) /*maybe add unprimeable # to $$ list.*/\\n if u==x then $.ox= commas(j) /*assign the Xth unprimeable number.*/\\n parse var j '' -1 _ /*obtain the right─most dec digit of J.*/\\n if $._==. then $._= j /*the 1st unprimeable # that ends in _.*/\\n if $.3==. then iterate; if $.7==. then iterate /*test if specific #'s found.*/\\n if $.1==. then iterate; if $.9==. then iterate /* \\\" \\\" \\\" \\\" \\\" */\\n leave /*if here, then we're done. */\\n end /*j*/\\n\\nif n>0 then do; say center(' first ' n \\\"unprimeable numbers \\\", 139, '═')\\n say strip($$); say\\n end\\nif x>0 then say ' the ' th(x) \\\" unprimeable number is: \\\" $.ox\\nsay\\n do o=0 for 10; if length($.o)==0 then iterate\\n say ' the first unprimeable number that ends in ' o \\\" is:\\\"right(commas($.o),11)\\n end /*o*/\\nexit /*stick a fork in it, we're all done. */\\n/*──────────────────────────────────────────────────────────────────────────────────────*/\\ncommas: parse arg ?; do c=length(?)-3 to 1 by -3; ?=insert(',', ?, c); end; return ?\\nth:procedure;parse arg x;return x||word('th st nd rd',1+(x//10)*(x//100%10\\\\==1)*(x//10<4))\\n/*──────────────────────────────────────────────────────────────────────────────────────*/\\ngenP: @.1=2; @.2=3; @.3=5; @.4=7; @.5=11; @.6=13; @.7=17; @.8=19; @.9=23; @.10=29; @.11=31\\n !.=0; !.2=1; !.3=1; !.5=1; !.7=1; !.11=1; !.13=1; !.17=1; !.19=1; !.23=1; !.29=1\\n #= 11; sq.#= @.# **2\\n do lim=100 until lim*lim>=hp /*only keep primes up to the sqrt(hp). */\\n end /*lim*/ /* [↑] find limit for storing primes. */\\n do j=@.#+2 by 2 to hp; parse var j '' -1 _; if _==5 then iterate /*÷ by 5?*/\\n if j// 3==0 then iterate; if j// 7==0 then iterate; if j//11==0 then iterate\\n if j//13==0 then iterate; if j//17==0 then iterate; if j//19==0 then iterate\\n if j//23==0 then iterate; if j//29==0 then iterate\\n do k=11 while sq.k<=j /*divide by some generated odd primes. */\\n if j//@.k==0 then iterate j /*Is J divisible by P? Then not prime*/\\n end /*k*/ /* [↓] a prime (J) has been found. */\\n #= #+1; if #<=lim then @.#=j; !.j=1 /*bump prime count; assign prime to @. */\\n sq.#= j*j /*calculate square of J for fast WHILE.*/\\n\",\n \"language\": \"REXX\"\n },\n {\n \"code\": \"require 'prime'\\n\\ndef unprimable?(n)\\n digits = %w(0 1 2 3 4 5 6 7 8 9)\\n s = n.to_s\\n size = s.size\\n (size-1).downto(0) do |i|\\n digits.each do |d|\\n cand = s.dup\\n cand[i]=d\\n return false if cand.to_i.prime?\\n end\\n end\\n true\\nend\\nups = Enumerator.new {|y| (1..).each{|n| y << n if unprimable?(n)} }\\n\\nar = ups.first(600)\\nputs \\\"First 35 unprimables:\\\", ar[0,35].join(\\\" \\\")\\nputs \\\"\\\\n600th unprimable:\\\", ar.last, \\\"\\\"\\n(0..9).each do |d|\\n print \\\"First unprimeable with last digit #{d}: \\\"\\n puts (1..).detect{|k| unprimable?(k*10+d)}*10 + d\\nend\\n\",\n \"language\": \"Ruby\"\n },\n {\n \"code\": \"// main.rs\\nmod bit_array;\\nmod prime_sieve;\\n\\nuse prime_sieve::PrimeSieve;\\n\\n// return number of decimal digits\\nfn count_digits(mut n: u32) -> u32 {\\n let mut digits = 0;\\n while n > 0 {\\n n /= 10;\\n digits += 1;\\n }\\n digits\\n}\\n\\n// return the number with one digit replaced\\nfn change_digit(mut n: u32, mut index: u32, new_digit: u32) -> u32 {\\n let mut p = 1;\\n let mut changed = 0;\\n while index > 0 {\\n changed += p * (n % 10);\\n p *= 10;\\n n /= 10;\\n index -= 1;\\n }\\n changed += (10 * (n / 10) + new_digit) * p;\\n changed\\n}\\n\\nfn unprimeable(sieve: &PrimeSieve, n: u32) -> bool {\\n if sieve.is_prime(n as usize) {\\n return false;\\n }\\n let d = count_digits(n);\\n for i in 0..d {\\n for j in 0..10 {\\n let m = change_digit(n, i, j);\\n if m != n && sieve.is_prime(m as usize) {\\n return false;\\n }\\n }\\n }\\n true\\n}\\n\\nfn main() {\\n let mut count = 0;\\n let mut n = 100;\\n let mut lowest = vec![0; 10];\\n let mut found = 0;\\n let sieve = PrimeSieve::new(10000000);\\n println!(\\\"First 35 unprimeable numbers:\\\");\\n while count < 600 || found < 10 {\\n if unprimeable(&sieve, n) {\\n if count < 35 {\\n if count > 0 {\\n print!(\\\", \\\");\\n }\\n print!(\\\"{}\\\", n);\\n }\\n count += 1;\\n if count == 600 {\\n println!(\\\"\\\\n600th unprimeable number: {}\\\", n);\\n }\\n let last_digit = n as usize % 10;\\n if lowest[last_digit] == 0 {\\n lowest[last_digit] = n;\\n found += 1;\\n }\\n }\\n n += 1;\\n }\\n for i in 0..10 {\\n println!(\\\"Least unprimeable number ending in {}: {}\\\", i, lowest[i]);\\n }\\n}\\n\",\n \"language\": \"Rust\"\n },\n {\n \"code\": \"// prime_sieve.rs\\nuse crate::bit_array;\\n\\npub struct PrimeSieve {\\n composite: bit_array::BitArray,\\n}\\n\\nimpl PrimeSieve {\\n pub fn new(limit: usize) -> PrimeSieve {\\n let mut sieve = PrimeSieve {\\n composite: bit_array::BitArray::new(limit / 2),\\n };\\n let mut p = 3;\\n while p * p <= limit {\\n if !sieve.composite.get(p / 2 - 1) {\\n let inc = p * 2;\\n let mut q = p * p;\\n while q <= limit {\\n sieve.composite.set(q / 2 - 1, true);\\n q += inc;\\n }\\n }\\n p += 2;\\n }\\n sieve\\n }\\n pub fn is_prime(&self, n: usize) -> bool {\\n if n < 2 {\\n return false;\\n }\\n if n % 2 == 0 {\\n return n == 2;\\n }\\n !self.composite.get(n / 2 - 1)\\n }\\n}\\n\",\n \"language\": \"Rust\"\n },\n {\n \"code\": \"// bit_array.rs\\npub struct BitArray {\\n array: Vec<u32>,\\n}\\n\\nimpl BitArray {\\n pub fn new(size: usize) -> BitArray {\\n BitArray {\\n array: vec![0; (size + 31) / 32],\\n }\\n }\\n pub fn get(&self, index: usize) -> bool {\\n let bit = 1 << (index & 31);\\n (self.array[index >> 5] & bit) != 0\\n }\\n pub fn set(&mut self, index: usize, new_val: bool) {\\n let bit = 1 << (index & 31);\\n if new_val {\\n self.array[index >> 5] |= bit;\\n } else {\\n self.array[index >> 5] &= !bit;\\n }\\n }\\n}\\n\",\n \"language\": \"Rust\"\n },\n {\n \"code\": \"func is_unprimeable(n) {\\n var t = 10*floor(n/10)\\n for k in (t+1 .. t+9 `by` 2) {\\n return false if k.is_prime\\n }\\n\\n if (n.is_div(2) || n.is_div(5)) {\\n return true if !is_prime(n%10)\\n return true if (n % 10**n.ilog(10) > 9)\\n }\\n\\n for k in (1 .. n.ilog(10)) {\\n var u = 10**k\\n var v = (n - (u * (floor(n/u) % 10)))\\n 0..9 -> any {|d| is_prime(v + d*u) } && return false\\n }\\n\\n return true\\n}\\n\\nwith (35) {|n|\\n say (\\\"First #{n} unprimeables:\\\\n\\\", is_unprimeable.first(n).join(' '))\\n}\\n\\nwith (600) {|n|\\n say (\\\"\\\\n#{n}th unprimeable: \\\", is_unprimeable.nth(n), \\\"\\\\n\\\")\\n}\\n\\nfor d in (0..9) {\\n say (\\\"First unprimeable that ends with #{d}: \\\",\\n 1..Inf -> lazy.map {|k| k*10 + d }.grep(is_unprimeable).first)\\n}\\n\",\n \"language\": \"Sidef\"\n },\n {\n \"code\": \"import Foundation\\n\\nclass BitArray {\\n var array: [UInt32]\\n\\n init(size: Int) {\\n array = Array(repeating: 0, count: (size + 31)/32)\\n }\\n\\n func get(index: Int) -> Bool {\\n let bit = UInt32(1) << (index & 31)\\n return (array[index >> 5] & bit) != 0\\n }\\n\\n func set(index: Int, value: Bool) {\\n let bit = UInt32(1) << (index & 31)\\n if value {\\n array[index >> 5] |= bit\\n } else {\\n array[index >> 5] &= ~bit\\n }\\n }\\n}\\n\\nclass PrimeSieve {\\n let composite: BitArray\\n\\n init(size: Int) {\\n composite = BitArray(size: size/2)\\n var p = 3\\n while p * p <= size {\\n if !composite.get(index: p/2 - 1) {\\n let inc = p * 2\\n var q = p * p\\n while q <= size {\\n composite.set(index: q/2 - 1, value: true)\\n q += inc\\n }\\n }\\n p += 2\\n }\\n }\\n\\n func isPrime(number: Int) -> Bool {\\n if number < 2 {\\n return false\\n }\\n if (number & 1) == 0 {\\n return number == 2\\n }\\n return !composite.get(index: number/2 - 1)\\n }\\n}\\n\\n// return number of decimal digits\\nfunc countDigits(number: Int) -> Int {\\n var digits = 0\\n var n = number\\n while n > 0 {\\n n /= 10\\n digits += 1\\n }\\n return digits\\n}\\n\\n// return the number with one digit replaced\\nfunc changeDigit(number: Int, index: Int, digit: Int) -> Int {\\n var p = 1\\n var changed = 0\\n var n = number\\n var i = index\\n while i > 0 {\\n changed += p * (n % 10)\\n p *= 10\\n n /= 10\\n i -= 1\\n }\\n changed += (10 * (n / 10) + digit) * p\\n return changed\\n}\\n\\nfunc unprimeable(sieve: PrimeSieve, number: Int) -> Bool {\\n if sieve.isPrime(number: number) {\\n return false\\n }\\n for i in 0..<countDigits(number: number) {\\n for j in 0..<10 {\\n let n = changeDigit(number: number, index: i, digit: j)\\n if n != number && sieve.isPrime(number: n) {\\n return false\\n }\\n }\\n }\\n return true\\n}\\n\\nvar count = 0\\nvar n = 100\\nvar lowest = Array(repeating: 0, count: 10)\\nvar found = 0\\nlet sieve = PrimeSieve(size: 10000000)\\nprint(\\\"First 35 unprimeable numbers:\\\")\\nwhile count < 600 || found < 10 {\\n if unprimeable(sieve: sieve, number: n) {\\n if count < 35 {\\n if count > 0 {\\n print(\\\", \\\", terminator: \\\"\\\")\\n }\\n print(n, terminator: \\\"\\\")\\n }\\n count += 1\\n if count == 600 {\\n print(\\\"\\\\n600th unprimeable number: \\\\(n)\\\")\\n }\\n let lastDigit = n % 10\\n if lowest[lastDigit] == 0 {\\n lowest[lastDigit] = n\\n found += 1\\n }\\n }\\n n += 1\\n}\\nfor i in 0..<10 {\\n let number = NSNumber(value: lowest[i])\\n let str = NumberFormatter.localizedString(from: number, number: .decimal)\\n print(\\\"Least unprimeable number ending in \\\\(i): \\\\(str)\\\")\\n}\\n\",\n \"language\": \"Swift\"\n },\n {\n \"code\": \"import \\\"./fmt\\\" for Fmt\\nimport \\\"./math\\\" for Int\\n\\nSystem.print(\\\"The first 35 unprimeable numbers are:\\\")\\nvar count = 0 // counts all unprimeable numbers\\nvar firstNum = List.filled(10, 0) // stores the first unprimeable number ending with each digit\\nvar i = 100\\nvar countFirst = 0\\nwhile (countFirst < 10) {\\n if (!Int.isPrime(i)) { // unprimeable number must be composite\\n var s = \\\"%(i)\\\"\\n var le = s.count\\n var b = s.bytes.toList\\n var outer = false\\n for (j in 0...le) {\\n for (k in 48..57) {\\n if (s[j].bytes[0] != k) {\\n b[j] = k\\n var bb = b.reduce(\\\"\\\") { |acc, byte| acc + String.fromByte(byte) }\\n var n = Num.fromString(bb)\\n if (Int.isPrime(n)) {\\n outer = true\\n break\\n }\\n }\\n }\\n if (outer) break\\n b[j] = s[j].bytes[0] // restore j'th digit to what it was originally\\n }\\n if (!outer) {\\n var lastDigit = s[-1].bytes[0] - 48\\n if (firstNum[lastDigit] == 0) {\\n firstNum[lastDigit] = i\\n countFirst = countFirst + 1\\n }\\n count = count + 1\\n if (count <= 35) System.write(\\\"%(i) \\\")\\n if (count == 35) System.write(\\\"\\\\n\\\\nThe 600th unprimeable number is: \\\")\\n if (count == 600) System.print(\\\"%(Fmt.dc(0, i))\\\\n\\\")\\n }\\n }\\n i = i + 1\\n}\\n\\nSystem.print(\\\"The first unprimeable number that ends in:\\\")\\nfor (i in 0...10) System.print(\\\" %(i) is: %(Fmt.dc(9, firstNum[i]))\\\")\\n\",\n \"language\": \"Wren\"\n },\n {\n \"code\": \"func IsPrime(N); \\\\Return 'true' if N is prime\\nint N, I;\\n[if N <= 2 then return N = 2;\\nif (N&1) = 0 then \\\\even >2\\\\ return false;\\nfor I:= 3 to sqrt(N) do\\n [if rem(N/I) = 0 then return false;\\n I:= I+1;\\n ];\\nreturn true;\\n];\\n\\nfunc Unprimeable(N); \\\\Return 'true' if N is unprimeable\\nint N, I, J, Len, D, SD;\\nchar Num(10);\\n[I:= 0; \\\\take N apart\\nrepeat N:= N/10;\\n Num(I):= rem(0);\\n I:= I+1;\\nuntil N = 0;\\nLen:= I; \\\\number of digits in N (length)\\nfor J:= 0 to Len-1 do\\n [SD:= Num(J); \\\\save digit\\n for D:= 0 to 9 do \\\\replace with all digits\\n [Num(J):= D;\\n N:= 0; \\\\rebuild N\\n for I:= Len-1 downto 0 do\\n N:= N*10 + Num(I);\\n if IsPrime(N) then return false;\\n ];\\n Num(J):= SD; \\\\restore saved digit\\n ];\\nreturn true;\\n];\\n\\nint C, N, D;\\n[Text(0, \\\"First 35 unprimeables:^m^j\\\");\\nC:= 0;\\nN:= 100;\\nloop [if Unprimeable(N) then\\n [C:= C+1;\\n if C <= 35 then\\n [IntOut(0, N); ChOut(0, ^ )];\\n if C = 600 then quit;\\n ];\\n N:= N+1;\\n ];\\nText(0, \\\"^m^j600th unprimeable: \\\");\\nIntOut(0, N); CrLf(0);\\nfor D:= 0 to 9 do\\n [IntOut(0, D); Text(0, \\\": \\\");\\n N:= 100 + D;\\n loop [if Unprimeable(N) then\\n [IntOut(0, N); CrLf(0);\\n quit;\\n ];\\n N:= N+10;\\n ];\\n ];\\n]\\n\",\n \"language\": \"XPL0\"\n },\n {\n \"code\": \"var [const] BI=Import(\\\"zklBigNum\\\"); // libGMP\\n\\nfcn isUnprimeable(n){ //--> n (!0) or Void, a filter\\n bn,t := BI(0),n/10*10;\\n foreach k in ([t+1..t+9,2]){ if(bn.set(k).probablyPrime()) return(Void.Skip) }\\n if(n==n/2*2 or n==n/5*5){\\n if(not bn.set(n%10).probablyPrime()) return(n);\\n if( (n % (10).pow(n.toFloat().log10()) ) > 9) return(n);\\n }\\n foreach k in ([1 .. n.toFloat().log10()]){\\n u,v := (10).pow(k), (n - (u * ((n/u) % 10)));\\n foreach d in (10){ if(bn.set(v + d*u).probablyPrime()) return(Void.Skip); }\\n }\\n n\\n}\\nfcn isUnprimeableW{ [100..].tweak(isUnprimeable) }\\t// --> iterator\\n\",\n \"language\": \"Zkl\"\n },\n {\n \"code\": \"isUnprimeableW().walk(35).concat(\\\" \\\").println();\\nprintln(\\\"The 600th unprimeable number is: %,d\\\".fmt(isUnprimeableW().drop(600).value));\\n\\ns,ups := 10, List.createLong(10,0);\\nforeach up in (isUnprimeableW())\\n { d:=up%10; if(ups[d]==0){ ups[d]=up; if((s-=1)<=0) break; } }\\nprintln(\\\"The first unprimeable number that ends in:\\\");\\nforeach n in (10){ println(\\\"%d is %8,d\\\".fmt(n,ups[n])) }\\n\",\n \"language\": \"Zkl\"\n }\n]","isConversational":false},"task_name":{"kind":"string","value":"Unprimeable-numbers"}}},{"rowIdx":1786,"cells":{"solutions":{"kind":"list like","value":[{"code":"---\nfrom: http://rosettacode.org/wiki/Untouchable_numbers\nnote: Prime Numbers\n","language":"00-META"},{"code":";Definitions:\n:* ''Untouchable numbers'' are also known as ''nonaliquot numbers''.\n\n:* An untouchable number is a positive integer that <u>cannot</u> be expressed as the sum of all the proper divisors of any positive integer. <small>(From Wikipedia)</small>\n\n:* The ''sum of all the proper divisors'' is also known as the ''aliquot sum''.\n\n:* An untouchable are those numbers that are not in the image of the aliquot sum function. <small>(From Wikipedia)</small>\n\n:* Untouchable numbers: impossible values for the sum of all aliquot parts function. <small>(From OEIS: The On-line Encyclopedia of Integer Sequences®)</small>\n\n:* An untouchable number is a positive integer that is not the sum of the proper divisors of any number. <small>(From MathWorld™)</small>\n\n\n;Observations and conjectures:\nAll untouchable numbers <big>></big> '''5''' are composite numbers.\n\nNo untouchable number is perfect.\n\nNo untouchable number is sociable.\n\nNo untouchable number is a Mersenne prime.\n\nNo untouchable number is one more than a prime number, since if '''p''' is prime, then\nthe sum of the proper divisors of '''p<sup>2</sup>''' is '''p + 1'''.\n\nNo untouchable number is three more than an odd prime number, since if '''p''' is an odd prime, then the \nsum of the proper divisors of '''2p''' is '''p + 3'''.\n\nThe number '''5''' is believed to be the only odd untouchable number, but this has not been proven: it would follow from a\nslightly stronger version of the [https://en.wikipedia.org/wiki/Goldbach%27s_conjecture Goldbach's conjecture], since the sum of the\nproper divisors of '''pq''' (with '''p''', '''q''' being\ndistinct primes) is '''1 + p + q'''.\n\nThere are infinitely many untouchable numbers, a fact that was proven\nby [https://en.wikipedia.org/wiki/Paul_Erd%C5%91s Paul Erdős].\n\nAccording to Chen & Zhao, their natural density is at least '''d > 0.06'''.\n\n\n;Task:\n:* show (in a grid format) all untouchable numbers ≤ 2,000.\n:* show (for the above) the ''count'' of untouchable numbers.\n:* show the ''count'' of untouchable numbers from unity up to (inclusive):\n::::* 10\n::::* 100\n::::* 1,000\n::::* 10,000\n::::* 100,000\n::::* ... or as high as is you think is practical.\n:* all output is to be shown here, on this page.\n\n\n;See also:\n:* Wolfram MathWorld: [https://mathworld.wolfram.com/UntouchableNumber.html untouchable number].\n:* OEIS: [https://oeis.org/A005114 A005114 untouchable numbers].\n:* OEIS: [https://oeis.org/A005114/b005114.txt a list of all untouchable numbers below 100,000 (inclusive)].\n:* Wikipedia: [https://en.wikipedia.org/wiki/Untouchable_number untouchable number].\n:* Wikipedia: [https://en.wikipedia.org/wiki/Goldbach%27s_conjecture Goldbach's conjecture].\n<br><br>\n\n","language":"00-TASK"},{"code":"BEGIN # find some untouchable numbers - numbers not equal to the sum of the #\n # proper divisors of any +ve integer #\n INT max untouchable = 1 000 000;\n # a table of the untouchable numbers #\n [ 1 : max untouchable ]BOOL untouchable; FOR i TO UPB untouchable DO untouchable[ i ] := TRUE OD;\n # show the counts of untouchable numbers found #\n PROC show untouchable statistics = VOID:\n BEGIN\n print( ( \"Untouchable numbers:\", newline ) );\n INT u count := 0;\n FOR i TO UPB untouchable DO\n IF untouchable[ i ] THEN u count +:= 1 FI;\n IF i = 10\n OR i = 100\n OR i = 1 000\n OR i = 10 000\n OR i = 100 000\n OR i = 1 000 000\n THEN\n print( ( whole( u count, -7 ), \" to \", whole( i, -8 ), newline ) )\n FI\n OD\n END; # show untouchable counts #\n # prints the untouchable numbers up to n #\n PROC print untouchables = ( INT n )VOID:\n BEGIN\n print( ( \"Untouchable numbers up to \", whole( n, 0 ), newline ) );\n INT u count := 0;\n FOR i TO n DO\n IF untouchable[ i ] THEN\n print( ( whole( i, -4 ) ) );\n IF u count +:= 1;\n u count MOD 16 = 0\n THEN print( ( newline ) )\n ELSE print( ( \" \" ) )\n FI\n FI\n OD;\n print( ( newline ) );\n print( ( whole( u count, -7 ), \" to \", whole( n, -8 ), newline ) )\n END; # print untouchables #\n # find the untouchable numbers #\n # to find untouchable numbers up to e.g.: 10 000, we need to sieve up to #\n # 10 000 ^2 i.e. 100 000 000 #\n # however if we also use the facts that no untouchable = prime + 1 #\n # and no untouchable = odd prime + 3 and 5 is (very probably) the only #\n # odd untouchable, other samples suggest we can use limit * 64 to find #\n # untlouchables up to 1 000 000 - experimentation reveals this to be true #\n # assume the conjecture that there are no odd untouchables except 5 #\n BEGIN\n untouchable[ 1 ] := FALSE;\n untouchable[ 3 ] := FALSE;\n FOR i FROM 7 BY 2 TO UPB untouchable DO untouchable[ i ] := FALSE OD\n END;\n # sieve the primes to max untouchable and flag the non untouchables #\n BEGIN\n PR read \"primes.incl.a68\" PR\n []BOOL prime = PRIMESIEVE max untouchable;\n FOR i FROM 3 BY 2 TO UPB prime DO\n IF prime[ i ] THEN\n IF i < max untouchable THEN\n untouchable[ i + 1 ] := FALSE;\n IF i < ( max untouchable - 2 ) THEN\n untouchable[ i + 3 ] := FALSE\n FI\n FI\n FI\n OD;\n untouchable[ 2 + 1 ] := FALSE # special case for the only even prime #\n END;\n # construct the proper divisor sums and flag the non untouchables #\n BEGIN\n [ 1 : max untouchable * 64 ]INT spd;\n FOR i TO UPB spd DO spd[ i ] := 1 OD;\n FOR i FROM 2 TO UPB spd DO\n FOR j FROM i + i BY i TO UPB spd DO spd[ j ] +:= i OD\n OD;\n FOR i TO UPB spd DO\n IF spd[ i ] <= UPB untouchable THEN untouchable[ spd[ i ] ] := FALSE FI\n OD\n END;\n # show the untouchable numbers up to 2000 #\n print untouchables( 2 000 );\n # show the counts of untouchable numbers #\n show untouchable statistics\nEND\n","language":"ALGOL-68"},{"code":"#include <stdio.h>\n#include <stdlib.h>\n#include <stdbool.h>\n#include <locale.h>\n\nbool *primeSieve(int limit) {\n int i, p;\n limit++;\n // True denotes composite, false denotes prime.\n bool *c = calloc(limit, sizeof(bool)); // all false by default\n c[0] = true;\n c[1] = true;\n for (i = 4; i < limit; i += 2) c[i] = true;\n p = 3; // Start from 3.\n while (true) {\n int p2 = p * p;\n if (p2 >= limit) break;\n for (i = p2; i < limit; i += 2 * p) c[i] = true;\n while (true) {\n p += 2;\n if (!c[p]) break;\n }\n }\n return c;\n}\n\nint main() {\n const int limit = 1000000;\n int i, j, n, uc = 2, p = 10, m = 63, ul = 151000;\n bool *c = primeSieve(limit);\n n = m * limit + 1;\n int *sumDivs = (int *)calloc(n, sizeof(int));\n for (i = 1; i < n; ++i) {\n for (j = i; j < n; j += i) sumDivs[j] += i;\n }\n bool *s = (bool *)calloc(n, sizeof(bool)); // all false\n for (i = 1; i < n; ++i) {\n int sum = sumDivs[i] - i; // proper divs sum\n if (sum <= n) s[sum] = true;\n }\n free(sumDivs);\n int *untouchable = (int *)malloc(ul * sizeof(int));\n untouchable[0] = 2;\n untouchable[1] = 5;\n for (n = 6; n <= limit; n += 2) {\n if (!s[n] && c[n-1] && c[n-3]) untouchable[uc++] = n;\n }\n setlocale(LC_NUMERIC, \"\");\n printf(\"List of untouchable numbers <= 2,000:\\n\");\n for (i = 0; i < uc; ++i) {\n j = untouchable[i];\n if (j > 2000) break;\n printf(\"%'6d \", j);\n if (!((i+1) % 10)) printf(\"\\n\");\n }\n printf(\"\\n\\n%'7d untouchable numbers were found <= 2,000\\n\", i);\n for (i = 0; i < uc; ++i) {\n j = untouchable[i];\n if (j > p) {\n printf(\"%'7d untouchable numbers were found <= %'9d\\n\", i, p);\n p *= 10;\n if (p == limit) break;\n }\n }\n printf(\"%'7d untouchable numbers were found <= %'d\\n\", uc, limit);\n free(c);\n free(s);\n free(untouchable);\n return 0;\n}\n","language":"C"},{"code":"// Untouchable Numbers : Nigel Galloway - March 4th., 2021;\n#include <functional>\n#include <bitset>\n#include <iostream>\n#include <cmath>\nusing namespace std; using Z0=long long; using Z1=optional<Z0>; using Z2=optional<array<int,3>>; using Z3=function<Z2()>;\nconst int maxUT{3000000}, dL{(int)log2(maxUT)};\nstruct uT{\n bitset<maxUT+1>N; vector<int> G{}; array<Z3,int(dL+1)>L{Z3{}}; int sG{0},mUT{};\n void _g(int n,int g){if(g<=mUT){N[g]=false; return _g(n,n+g);}}\n Z1 nxt(const int n){if(n>mUT) return Z1{}; if(N[n]) return Z1(n); return nxt(n+1);}\n Z3 fN(const Z0 n,const Z0 i,int g){return [=]()mutable{if(g<sG && ((n+i)*(1+G[g])-n*G[g]<=mUT)) return Z2{{n,i,g++}}; return Z2{};};}\n Z3 fG(Z0 n,Z0 i,const int g){Z0 e{n+i},l{1},p{1}; return [=]()mutable{n=n*G[g]; p=p*G[g]; l=l+p; i=e*l-n; if(i<=mUT) return Z2{{n,i,g}}; return Z2{};};}\n void fL(Z3 n, int g){for(;;){\n if(auto i=n()){N[(*i)[1]]=false; L[g+1]=fN((*i)[0],(*i)[1],(*i)[2]+1); g=g+1; continue;}\n if(auto i=L[g]()){n=fG((*i)[0],(*i)[1],(*i)[2]); continue;}\n if(g>0) if(auto i=L[g-1]()){ g=g-1; n=fG((*i)[0],(*i)[1],(*i)[2]); continue;}\n if(g>0){ n=[](){return Z2{};}; g=g-1; continue;} break;}\n }\n int count(){int g{0}; for(auto n=nxt(0); n; n=nxt(*n+1)) ++g; return g;}\n uT(const int n):mUT{n}{\n N.set(); N[0]=false; N[1]=false; for(auto n=nxt(0);*n<=sqrt(mUT);n=nxt(*n+1)) _g(*n,*n+*n); for(auto n=nxt(0); n; n=nxt(*n+1)) G.push_back(*n); sG=G.size();\n N.set(); N[0]=false; L[0]=fN(1,0,0); fL([](){return Z2{};},0);\n }\n};\n","language":"C++"},{"code":"int main(int argc, char *argv[]) {\n int c{0}; auto n{uT{2000}}; for(auto g=n.nxt(0); g; g=n.nxt(*g+1)){if(c++==30){c=1; printf(\"\\n\");} printf(\"%4d \",*g);} printf(\"\\n\");\n}\n","language":"C++"},{"code":"int main(int argc, char *argv[]) {\n int z{100000}; auto n{uT{z}}; cout<<\"untouchables below \"<<z<<\"->\"<<n.count()<<endl;\n}\n","language":"C++"},{"code":"int main(int argc, char *argv[]) {\n int z{1000000}; auto n{uT{z}}; cout<<\"untouchables below \"<<z<<\"->\"<<n.count()<<endl;\n}\n","language":"C++"},{"code":"int main(int argc, char *argv[]) {\n int z{2000000}; auto n{uT{z}}; cout<<\"untouchables below \"<<z<<\"->\"<<n.count()<<endl;\n}\n","language":"C++"},{"code":"program Untouchable_numbers;\n\n{$APPTYPE CONSOLE}\n\nuses\n System.SysUtils;\n\nfunction SumDivisors(n: Integer): Integer;\nbegin\n Result := 1;\n var k := 2;\n if not odd(n) then\n k := 1;\n var i := 1 + k;\n while i * i <= n do\n begin\n if (n mod i) = 0 then\n begin\n inc(Result, i);\n var j := n div i;\n if j <> i then\n inc(Result, j);\n end;\n inc(i, k);\n end;\nend;\n\nfunction Sieve(n: Integer): TArray<Boolean>;\nbegin\n inc(n);\n SetLength(result, n + 1);\n for var i := 6 to n do\n begin\n var sd := SumDivisors(i);\n if sd <= n then\n result[sd] := True;\n end;\nend;\n\nfunction PrimeSieve(limit: Integer): TArray<Boolean>;\nbegin\n inc(limit);\n SetLength(result, limit);\n Result[0] := True;\n Result[1] := True;\n\n var p := 3;\n repeat\n var p2 := p * p;\n if p2 >= limit then\n Break;\n var i := p2;\n while i < limit do\n begin\n\n Result[i] := True;\n inc(i, 2 * p);\n end;\n\n repeat\n inc(p, 2);\n until not Result[p];\n\n until (False);\n\nend;\n\nfunction Commatize(n: Double): string;\nvar\n fmt: TFormatSettings;\nbegin\n fmt := TFormatSettings.Create('en-US');\n Result := n.ToString(ffNumber, 64, 0, fmt);\nend;\n\nbegin\n var limit := 1000000;\n var c := primeSieve(limit);\n var s := sieve(63 * limit);\n var untouchable: TArray<Integer> := [2, 5];\n var n := 6;\n while n <= limit do\n begin\n if not s[n] and c[n - 1] and c[n - 3] then\n begin\n SetLength(untouchable, Length(untouchable) + 1);\n untouchable[High(untouchable)] := n;\n end;\n inc(n, 2);\n end;\n writeln('List of untouchable numbers <= 2,000:');\n var count := 0;\n var i := 0;\n while untouchable[i] <= 2000 do\n begin\n write(commatize(untouchable[i]): 6);\n if ((i + 1) mod 10) = 0 then\n writeln;\n inc(i);\n end;\n writeln(#10#10, commatize(count): 7, ' untouchable numbers were found <= 2,000');\n\n var p := 10;\n count := 0;\n for n in untouchable do\n begin\n inc(count);\n if n > p then\n begin\n var cc := commatize(count - 1);\n var cp := commatize(p);\n writeln(cc, ' untouchable numbers were found <= ', cp);\n p := p * 10;\n if p = limit then\n Break;\n end;\n end;\n\n var cu := commatize(Length(untouchable));\n var cl := commatize(limit);\n writeln(cu:7, ' untouchable numbers were found <= ', cl);\n readln;\nend.\n","language":"Delphi"},{"code":"// Applied dendrology. Nigel Galloway: February 15., 2021\nlet uT a=let N,G=Array.create(a+1) true, [|yield! primes64()|>Seq.takeWhile((>)(int64 a))|]\n let fN n i e=let mutable p=e-1 in (fun()->p<-p+1; if p<G.Length && (n+i)*(1L+G.[p])-n*G.[p]<=(int64 a) then Some(n,i,p) else None)\n let fG n i e=let g=n+i in let mutable n,l,p=n,1L,1L\n (fun()->n<-n*G.[e]; p<-p*G.[e]; l<-l+p; let i=g*l-n in if i<=(int64 a) then Some(n,i,e) else None)\n let rec fL n g=match n() with Some(f,i,e)->N.[(int i)]<-false; fL n ((fN f i (e+1))::g)\n |_->match g with n::t->match n() with Some (n,i,e)->fL (fG n i e) g |_->fL n t\n |_->N.[0]<-false; N\n fL (fG 1L 0L 0) [fN 1L 0L 1]\n","language":"F-Sharp"},{"code":"uT 2000|>Array.mapi(fun n g->(n,g))|>Array.filter(fun(_,n)->n)|>Array.chunkBySize 30|>Array.iter(fun n->n|>Array.iter(fst>>printf \"%5d\");printfn \"\")\n","language":"F-Sharp"},{"code":"printfn \"%d\" (uT 100000|>Array.filter id|>Array.length)\n","language":"F-Sharp"},{"code":"printfn \"%d\" (uT 1000000|>Array.filter id|>Array.length)\n","language":"F-Sharp"},{"code":"printfn \"%d\" (uT 2000000|>Array.filter id|>Array.length)\n","language":"F-Sharp"},{"code":"printfn \"%d\" (uT 3000000|>Array.filter id|>Array.length)\n","language":"F-Sharp"},{"code":"Const max_untouchable = 1e6\n\nDim Shared untouchable(1 To max_untouchable) As Uinteger\nFor i As Uinteger = 1 To Ubound(untouchable)\n untouchable(i) = True\nNext i\n\nSub show_untouchable_statistics()\n Dim As Uinteger i, cnt = 0\n For i = 1 To Ubound(untouchable)\n If untouchable(i) Then cnt += 1\n If i = 10 Orelse i = 100 Orelse i = 1000 Orelse i = 10000 Orelse i = 1e5 Then\n Print Using \"###,### untouchable numbers were found <= #,###,###\"; cnt; i\n End If\n Next i\nEnd Sub\n\nSub print_untouchables(n As Uinteger)\n Print Using \"List of untouchable numbers <= #,###:\"; n\n Dim As Uinteger i, cnt = 0\n For i = 1 To n\n If untouchable(i) Then\n Print Using \"##,###\"; i;\n cnt += 1\n Print Iif(cnt Mod 16 = 0, !\"\\n\", \" \");\n End If\n Next i\n Print: Print\n Print Using \"###,### untouchable numbers were found <= #,###,###\"; cnt; n\nEnd Sub\n\nDim As Uinteger i, j\nuntouchable(1) = False\nuntouchable(3) = False\nFor i = 7 To Ubound(untouchable) Step 2\n untouchable(i) = False\nNext i\n\nDim Shared spd(1 To max_untouchable * 64) As Uinteger\nDim As Uinteger ub = Ubound(spd)\nFor i = 1 To ub\n spd(i) = 1\nNext i\nFor i = 2 To ub\n For j = i + i To ub Step i\n spd(j) += i\n Next j\nNext i\nFor i = 1 To ub\n If spd(i) <= Ubound(untouchable) Then untouchable(spd(i)) = False\nNext i\n\n' Show the untouchable numbers up to 2000\nprint_untouchables(2000)\n' Show the counts of untouchable numbers\nshow_untouchable_statistics()\n\nSleep\n","language":"FreeBASIC"},{"code":"package main\n\nimport \"fmt\"\n\nfunc sumDivisors(n int) int {\n sum := 1\n k := 2\n if n%2 == 0 {\n k = 1\n }\n for i := 1 + k; i*i <= n; i += k {\n if n%i == 0 {\n sum += i\n j := n / i\n if j != i {\n sum += j\n }\n }\n }\n return sum\n}\n\nfunc sieve(n int) []bool {\n n++\n s := make([]bool, n+1) // all false by default\n for i := 6; i <= n; i++ {\n sd := sumDivisors(i)\n if sd <= n {\n s[sd] = true\n }\n }\n return s\n}\n\nfunc primeSieve(limit int) []bool {\n limit++\n // True denotes composite, false denotes prime.\n c := make([]bool, limit) // all false by default\n c[0] = true\n c[1] = true\n // no need to bother with even numbers over 2 for this task\n p := 3 // Start from 3.\n for {\n p2 := p * p\n if p2 >= limit {\n break\n }\n for i := p2; i < limit; i += 2 * p {\n c[i] = true\n }\n for {\n p += 2\n if !c[p] {\n break\n }\n }\n }\n return c\n}\n\nfunc commatize(n int) string {\n s := fmt.Sprintf(\"%d\", n)\n if n < 0 {\n s = s[1:]\n }\n le := len(s)\n for i := le - 3; i >= 1; i -= 3 {\n s = s[0:i] + \",\" + s[i:]\n }\n if n >= 0 {\n return s\n }\n return \"-\" + s\n}\n\nfunc main() {\n limit := 1000000\n c := primeSieve(limit)\n s := sieve(63 * limit)\n untouchable := []int{2, 5}\n for n := 6; n <= limit; n += 2 {\n if !s[n] && c[n-1] && c[n-3] {\n untouchable = append(untouchable, n)\n }\n }\n fmt.Println(\"List of untouchable numbers <= 2,000:\")\n count := 0\n for i := 0; untouchable[i] <= 2000; i++ {\n fmt.Printf(\"%6s\", commatize(untouchable[i]))\n if (i+1)%10 == 0 {\n fmt.Println()\n }\n count++\n }\n fmt.Printf(\"\\n\\n%7s untouchable numbers were found <= 2,000\\n\", commatize(count))\n p := 10\n count = 0\n for _, n := range untouchable {\n count++\n if n > p {\n cc := commatize(count - 1)\n cp := commatize(p)\n fmt.Printf(\"%7s untouchable numbers were found <= %9s\\n\", cc, cp)\n p = p * 10\n if p == limit {\n break\n }\n }\n }\n cu := commatize(len(untouchable))\n cl := commatize(limit)\n fmt.Printf(\"%7s untouchable numbers were found <= %s\\n\", cu, cl)\n}\n","language":"Go"},{"code":"package main\n\nimport (\n \"fmt\"\n \"rcu\"\n)\n\nfunc main() {\n limit := 1000000\n m := 63\n c := rcu.PrimeSieve(limit, false)\n n := m*limit + 1\n sumDivs := make([]int, n)\n for i := 1; i < n; i++ {\n for j := i; j < n; j += i {\n sumDivs[j] += i\n }\n }\n s := make([]bool, n) // all false\n for i := 1; i < n; i++ {\n sum := sumDivs[i] - i // proper divs sum\n if sum <= n {\n s[sum] = true\n }\n }\n untouchable := []int{2, 5}\n for n := 6; n <= limit; n += 2 {\n if !s[n] && c[n-1] && c[n-3] {\n untouchable = append(untouchable, n)\n }\n }\n fmt.Println(\"List of untouchable numbers <= 2,000:\")\n count := 0\n for i := 0; untouchable[i] <= 2000; i++ {\n fmt.Printf(\"%6s\", rcu.Commatize(untouchable[i]))\n if (i+1)%10 == 0 {\n fmt.Println()\n }\n count++\n }\n fmt.Printf(\"\\n\\n%7s untouchable numbers were found <= 2,000\\n\", rcu.Commatize(count))\n p := 10\n count = 0\n for _, n := range untouchable {\n count++\n if n > p {\n cc := rcu.Commatize(count - 1)\n cp := rcu.Commatize(p)\n fmt.Printf(\"%7s untouchable numbers were found <= %9s\\n\", cc, cp)\n p = p * 10\n if p == limit {\n break\n }\n }\n }\n cu := rcu.Commatize(len(untouchable))\n cl := rcu.Commatize(limit)\n fmt.Printf(\"%7s untouchable numbers were found <= %s\\n\", cu, cl)\n}\n","language":"Go"},{"code":"factor=: 3 : 0 NB. explicit\n 'primes powers'=. __&q: y\n input_to_cartesian_product=. primes ^&.> i.&.> >: powers\n cartesian_product=. , { input_to_cartesian_product\n , */&> cartesian_product\n)\n\nfactor=: [: , [: */&> [: { [: (^&.> i.&.>@>:)/ __&q: NB. tacit\n\n\nproper_divisors=: [: }: factor\nsum_of_proper_divisors=: +/@proper_divisors\n\ncandidates=: 5 , [: +: [: #\\@i. >.@-: NB. within considered range, all but one candidate are even.\nspds=:([:sum_of_proper_divisors\"0(#\\@i.-.i.&.:(p:inv))@*:)f. NB. remove primes which contribute 1\n","language":"J"},{"code":"using Primes\n\nfunction properfactorsum(n)\n f = [one(n)]\n for (p,e) in factor(n)\n f = reduce(vcat, [f*p^j for j in 1:e], init=f)\n end\n pop!(f)\n return sum(f)\nend\n\nconst maxtarget, sievelimit = 1_000_000, 512_000_000\nconst untouchables = ones(Bool, maxtarget)\n\nfor i in 2:sievelimit\n n = properfactorsum(i)\n if n <= maxtarget\n untouchables[n] = false\n end\nend\nfor i in 6:maxtarget\n if untouchables[i] && (isprime(i - 1) || isprime(i - 3))\n untouchables[i] = false\n end\nend\n\nprintln(\"The untouchable numbers ≤ 2000 are: \")\nfor (i, n) in enumerate(filter(x -> untouchables[x], 1:2000))\n print(rpad(n, 5), i % 10 == 0 || i == 196 ? \"\\n\" : \"\")\nend\nfor N in [2000, 10, 100, 1000, 10_000, 100_000, 1_000_000]\n println(\"The count of untouchable numbers ≤ $N is: \", count(x -> untouchables[x], 1:N))\nend\n","language":"Julia"},{"code":"f = DivisorSigma[1, #] - # &;\nlimit = 10^5;\nc = Not /@ PrimeQ[Range[limit]];\nslimit = 15 limit;\ns = ConstantArray[False, slimit + 1];\nuntouchable = {2, 5};\nDo[\n val = f[i];\n If[val <= slimit,\n s[[val]] = True\n ]\n ,\n {i, 6, slimit}\n]\nDo[\n If[! s[[n]],\n If[c[[n - 1]],\n If[c[[n - 3]],\n AppendTo[untouchable, n]\n ]\n ]\n ]\n ,\n {n, 6, limit, 2}\n]\nMulticolumn[Select[untouchable, LessEqualThan[2000]]]\nCount[untouchable, _?(LessEqualThan[2000])]\nCount[untouchable, _?(LessEqualThan[10])]\nCount[untouchable, _?(LessEqualThan[100])]\nCount[untouchable, _?(LessEqualThan[1000])]\nCount[untouchable, _?(LessEqualThan[10000])]\nCount[untouchable, _?(LessEqualThan[100000])]\n","language":"Mathematica"},{"code":"import math, strutils\n\nconst\n Lim1 = 100_000 # Limit for untouchable numbers.\n Lim2 = 14 * Lim1 # Limit for computation of sum of divisors.\n\nproc sumdiv(n: uint): uint =\n ## Return the sum of the strict divisors of \"n\".\n result = 1\n let r = sqrt(n.float).uint\n let k = if (n and 1) == 0: 1u else: 2u\n for d in countup(k + 1, r, k):\n if n mod d == 0:\n result += d\n let q = n div d\n if q != d: result += q\n\nvar\n isSumDiv: array[1..Lim2, bool]\n isPrime: array[1..Lim1, bool]\n\n# Fill both sieves in a single pass.\nfor n in 1u..Lim2:\n let s = sumdiv(n)\n if s <= Lim2:\n isSumDiv[s] = true\n if s == 1 and n <= Lim1:\n isPrime[n] = true\nisPrime[1] = false\n\n# Build list of untouchable numbers.\nvar list = @[2, 5]\nfor n in countup(6, Lim1, 2):\n if not (isSumDiv[n] or isPrime[n - 1] or isPrime[n - 3]):\n list.add n\n\necho \"Untouchable numbers ≤ 2000:\"\nvar count, lcount = 0\nfor n in list:\n if n <= 2000:\n stdout.write ($n).align(5)\n inc count\n inc lcount\n if lcount == 20:\n echo()\n lcount = 0\n else:\n if lcount > 0: echo()\n break\n\nconst CountMessage = \"There are $1 untouchable numbers ≤ $2.\"\necho CountMessage.format(count, 2000), '\\n'\n\ncount = 0\nvar lim = 10\nfor n in list:\n if n > lim:\n echo CountMessage.format(count, lim)\n lim *= 10\n inc count\nif lim == Lim1:\n # Emit last message.\n echo CountMessage.format(count, lim)\n","language":"Nim"},{"code":"program UntouchableNumbers;\nprogram UntouchableNumbers;\n{$IFDEF FPC}\n {$MODE DELPHI} {$OPTIMIZATION ON,ALL} {$COPERATORS ON}\n {$CODEALIGN proc=16,loop=4}\n{$ELSE}\n {$APPTYPE CONSOLE}\n{$ENDIF}\nuses\n sysutils,strutils\n{$IFDEF WINDOWS},Windows{$ENDIF}\n ;\nconst\n MAXPRIME = 1742537;\n //sqr(MaxPrime) = 3e12\n LIMIT = 5*1000*1000;\n LIMIT_mul = trunc(exp(ln(LIMIT)/3))+1;\n\nconst\n SizePrDeFe = 16*8192;//*size of(tprimeFac) =16 byte 2 Mb ~ level 3 cache\ntype\n tdigits = array [0..31] of Uint32;\n tprimeFac = packed record\n pfSumOfDivs,\n pfRemain : Uint64;\n end;\n tpPrimeFac = ^tprimeFac;\n\n tPrimeDecompField = array[0..SizePrDeFe-1] of tprimeFac;\n\n tPrimes = array[0..1 shl 17-1] of Uint32;\n\nvar\n {$ALIGN 16}\n PrimeDecompField :tPrimeDecompField;\n {$ALIGN 16}\n SmallPrimes: tPrimes;\n pdfIDX,pdfOfs: NativeInt;\n TD : Int64;\n\nprocedure OutCounts(pUntouch:pByte);\nvar\n n,cnt,lim,deltaLim : NativeInt;\nBegin\n n := 0;\n cnt := 0;\n deltaLim := 100;\n lim := deltaLim;\n repeat\n cnt += 1-pUntouch[n];\n if n = lim then\n Begin\n writeln(Numb2USA(IntToStr(lim)):13,' ',Numb2USA(IntToStr(cnt)):12);\n lim += deltaLim;\n if lim = 10*deltaLim then\n begin\n deltaLim *=10;\n lim := deltaLim;\n writeln;\n end;\n end;\n\n inc(n);\n until n > LIMIT;\nend;\n\nfunction OutN(n:UInt64):UInt64;\nbegin\n write(Numb2USA(IntToStr(n)):15,' dt ',(GettickCount64-TD)/1000:5:3,' s'#13);\n TD := GettickCount64;\n result := n+LIMIT;\nend;\n\n//######################################################################\n//gets sum of divisors of consecutive integers fast\nprocedure InitSmallPrimes;\n//get primes. Sieving only odd numbers\nvar\n pr : array[0..MAXPRIME] of byte;\n p,j,d,flipflop :NativeUInt;\nBegin\n SmallPrimes[0] := 2;\n fillchar(pr[0],SizeOf(pr),#0);\n p := 0;\n repeat\n repeat\n p +=1\n until pr[p]= 0;\n j := (p+1)*p*2;\n if j>MAXPRIME then\n BREAK;\n d := 2*p+1;\n repeat\n pr[j] := 1;\n j += d;\n until j>MAXPRIME;\n until false;\n\n SmallPrimes[1] := 3;\n SmallPrimes[2] := 5;\n j := 3;\n flipflop := (2+1)-1;//7+2*2->11+2*1->13 ,17 ,19 , 23\n p := 3;\n repeat\n if pr[p] = 0 then\n begin\n SmallPrimes[j] := 2*p+1;\n inc(j);\n end;\n p+=flipflop;\n flipflop := 3-flipflop;\n until (p > MAXPRIME) OR (j>High(SmallPrimes));\nend;\n\nfunction CnvtoBASE(var dgt:tDigits;n:Uint64;base:NativeUint):NativeInt;\n//n must be multiple of base aka n mod base must be 0\nvar\n q,r: Uint64;\n i : NativeInt;\nBegin\n fillchar(dgt,SizeOf(dgt),#0);\n i := 0;\n n := n div base;\n result := 0;\n repeat\n r := n;\n q := n div base;\n r -= q*base;\n n := q;\n dgt[i] := r;\n inc(i);\n until (q = 0);\n //searching lowest pot in base\n result := 0;\n while (result<i) AND (dgt[result] = 0) do\n inc(result);\n inc(result);\nend;\n\nfunction IncByOneInBase(var dgt:tDigits;base:NativeInt):NativeInt;\nvar\n q :NativeInt;\nBegin\n result := 0;\n q := dgt[result]+1;\n if q = base then\n repeat\n dgt[result] := 0;\n inc(result);\n q := dgt[result]+1;\n until q <> base;\n dgt[result] := q;\n result +=1;\nend;\n\nprocedure CalcSumOfDivs(var pdf:tPrimeDecompField;var dgt:tDigits;n,k,pr:Uint64);\nvar\n fac,s :Uint64;\n j : Int32;\nBegin\n //j is power of prime\n j := CnvtoBASE(dgt,n+k,pr);\n repeat\n fac := 1;\n s := 1;\n repeat\n fac *= pr;\n dec(j);\n s += fac;\n until j<= 0;\n with pdf[k] do\n Begin\n pfSumOfDivs *= s;\n pfRemain := pfRemain DIV fac;\n end;\n j := IncByOneInBase(dgt,pr);\n k += pr;\n until k >= SizePrDeFe;\nend;\n\nfunction SieveOneSieve(var pdf:tPrimeDecompField):boolean;\nvar\n dgt:tDigits;\n i,j,k,pr,n,MaxP : Uint64;\nbegin\n n := pdfOfs;\n if n+SizePrDeFe >= sqr(SmallPrimes[High(SmallPrimes)]) then\n EXIT(FALSE);\n //init\n for i := 0 to SizePrDeFe-1 do\n begin\n with pdf[i] do\n Begin\n pfSumOfDivs := 1;\n pfRemain := n+i;\n end;\n end;\n //first factor 2. Make n+i even\n i := (pdfIdx+n) AND 1;\n IF (n = 0) AND (pdfIdx<2) then\n i := 2;\n\n repeat\n with pdf[i] do\n begin\n j := BsfQWord(n+i);\n pfRemain := (n+i) shr j;\n pfSumOfDivs := (Uint64(1) shl (j+1))-1;\n end;\n i += 2;\n until i >=SizePrDeFe;\n //i now index in SmallPrimes\n i := 0;\n maxP := trunc(sqrt(n+SizePrDeFe))+1;\n repeat\n //search next prime that is in bounds of sieve\n if n = 0 then\n begin\n repeat\n inc(i);\n pr := SmallPrimes[i];\n k := pr-n MOD pr;\n if k < SizePrDeFe then\n break;\n until pr > MaxP;\n end\n else\n begin\n repeat\n inc(i);\n pr := SmallPrimes[i];\n k := pr-n MOD pr;\n if (k = pr) AND (n>0) then\n k:= 0;\n if k < SizePrDeFe then\n break;\n until pr > MaxP;\n end;\n\n //no need to use higher primes\n if pr > maxP then\n BREAK;\n\n CalcSumOfDivs(pdf,dgt,n,k,pr);\n until false;\n\n //correct sum of & count of divisors\n for i := 0 to High(pdf) do\n Begin\n with pdf[i] do\n begin\n j := pfRemain;\n if j <> 1 then\n pfSumOFDivs *= (j+1);\n end;\n end;\n result := true;\nend;\n\nfunction NextSieve:boolean;\nbegin\n dec(pdfIDX,SizePrDeFe);\n inc(pdfOfs,SizePrDeFe);\n result := SieveOneSieve(PrimeDecompField);\nend;\n\nfunction GetNextPrimeDecomp:tpPrimeFac;\nbegin\n if pdfIDX >= SizePrDeFe then\n if Not(NextSieve) then\n Begin\n writeln('of limits ');\n EXIT(NIL);\n end;\n result := @PrimeDecompField[pdfIDX];\n inc(pdfIDX);\nend;\n\nfunction Init_Sieve(n:NativeUint):boolean;\n//Init Sieve pdfIdx,pdfOfs are Global\nbegin\n pdfIdx := n MOD SizePrDeFe;\n pdfOfs := n-pdfIdx;\n result := SieveOneSieve(PrimeDecompField);\nend;\n//gets sum of divisors of consecutive integers fast\n//######################################################################\n\nprocedure CheckRest(n: Uint64;pUntouch:pByte);\nvar\n k,lim : Uint64;\nbegin\n lim := 2*LIMIT;\n repeat\n k := GetNextPrimeDecomp^.pfSumOfDivs-n;\n inc(n);\n if Not(ODD(k)) AND (k<=LIMIT) then\n pUntouch[k] := 1;\n // showing still alive not for TIO.RUN\n// if n >= lim then lim := OutN(n);\n until n >LIMIT_mul*LIMIT;\nend;\n\nvar\n Untouch : array of byte;\n pUntouch: pByte;\n puQW : pQword;\n T0:Int64;\n n,k : NativeInt;\nBegin\n if sqrt(LIMIT_mul*LIMIT) >=MAXPRIME then\n Begin\n writeln('Need to extend count of primes > ',\n trunc(sqrt(LIMIT_mul*LIMIT))+1);\n HALT(0);\n end;\n\n setlength(untouch,LIMIT+8+1);\n pUntouch := @untouch[0];\n //Mark all odd as touchable\n puQW := @pUntouch[0];\n For n := 0 to LIMIT DIV 8 do puQW[n] := $0100010001000100;\n\n InitSmallPrimes;\n T0 := GetTickCount64;\n writeln('LIMIT = ',Numb2USA(IntToStr(LIMIT)));\n writeln('factor beyond LIMIT ',LIMIT_mul);\n\n n := 0;\n Init_Sieve(n);\n\n pUntouch[1] := 1;//all primes\n repeat\n k := GetNextPrimeDecomp^.pfSumOfDivs-n;\n inc(n);//n-> n+1\n if k <= LIMIT then\n begin\n If k <> 1 then\n pUntouch[k] := 1\n else\n begin\n //n-1 is prime p\n //mark p*p\n pUntouch[n] := 1;\n //mark 2*p\n //5 marked by prime 2 but that is p*p, but 4 has factor sum = 3\n pUntouch[n+2] := 1;\n end;\n end;\n until n > LIMIT-2;\n //unmark 5 and mark 0\n puntouch[5] := 0;\n pUntouch[0] := 1;\n\n //n=limit-1\n k := GetNextPrimeDecomp^.pfSumOfDivs-n;\n inc(n);\n If (k <> 1) AND (k<=LIMIT) then\n pUntouch[k] := 1\n else\n pUntouch[n] := 1;\n //n=limit\n k := GetNextPrimeDecomp^.pfSumOfDivs-n;\n If Not(odd(k)) AND (k<=LIMIT) then\n pUntouch[k] := 1;\n\n\n n:= limit+1;\n writeln('runtime for n<= LIMIT ',(GetTickCount64-T0)/1000:0:3,' s');\n writeln('Check the rest ',Numb2USA(IntToStr((LIMIT_mul-1)*Limit)));\n TD := GettickCount64;\n CheckRest(n,pUntouch);\n writeln('runtime ',(GetTickCount64-T0)/1000:0:3,' s');\n T0 := GetTickCount64-T0;\n\n OutCounts(pUntouch);\nend.\n","language":"Pascal"},{"code":"use strict;\nuse warnings;\nuse enum qw(False True);\nuse ntheory qw/divisor_sum is_prime/;\n\nsub sieve {\n my($n) = @_;\n my %s;\n for my $k (0 .. $n+1) {\n my $sum = divisor_sum($k) - $k;\n $s{$sum} = True if $sum <= $n+1;\n }\n %s\n}\n\nmy(%s,%c);\nmy($max, $limit, $cnt) = (2000, 1e5, 0);\n\n%s = sieve 14 * $limit;\n!is_prime($_) and $c{$_} = True for 1..$limit;\nmy @untouchable = (2, 5);\nfor ( my $n = 6; $n <= $limit; $n += 2 ) {\n push @untouchable, $n if !$s{$n} and $c{$n-1} and $c{$n-3};\n}\nmap { $cnt++ if $_ <= $max } @untouchable;\nprint \"Number of untouchable numbers ≤ $max : $cnt \\n\\n\" .\n (sprintf \"@{['%6d' x $cnt]}\", @untouchable[0..$cnt-1]) =~ s/(.{84})/$1\\n/gr . \"\\n\";\n\nmy($p, $count) = (10, 0);\nmy $fmt = \"%6d untouchable numbers were found ≤ %7d\\n\";\nfor my $n (@untouchable) {\n $count++;\n if ($n > $p) {\n printf $fmt, $count-1, $p;\n printf($fmt, scalar @untouchable, $limit) and last if $limit == ($p *= 10)\n }\n}\n","language":"Perl"},{"code":"(phixonline)-->\n <span style=\"color: #008080;\">constant</span> <span style=\"color: #000000;\">limz</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;\">1</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: #000000;\">18</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">64</span><span style=\"color: #0000FF;\">}</span> <span style=\"color: #000080;font-style:italic;\">-- found by experiment</span>\n\n <span style=\"color: #008080;\">procedure</span> <span style=\"color: #000000;\">untouchable</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #004080;\">integer</span> <span style=\"color: #000000;\">n</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">cols</span><span style=\"color: #0000FF;\">=</span><span style=\"color: #000000;\">0</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">tens</span><span style=\"color: #0000FF;\">=</span><span style=\"color: #000000;\">0</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> <span style=\"color: #000000;\">t1</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">t0</span><span style=\"color: #0000FF;\">+</span><span style=\"color: #000000;\">1</span>\n <span style=\"color: #004080;\">bool</span> <span style=\"color: #000000;\">tell</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">n</span><span style=\"color: #0000FF;\">></span><span style=\"color: #000000;\">0</span>\n <span style=\"color: #000000;\">n</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">abs</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">n</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #004080;\">sequence</span> <span style=\"color: #000000;\">sums</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;\">3</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: #004080;\">integer</span> <span style=\"color: #000000;\">p</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">get_prime</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;\">p</span><span style=\"color: #0000FF;\">></span><span style=\"color: #000000;\">n</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;\">sums</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">p</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;\">sums</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">p</span><span style=\"color: #0000FF;\">+</span><span style=\"color: #000000;\">3</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;\">for</span>\n <span style=\"color: #000000;\">sums</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;\">0</span>\n\n <span style=\"color: #004080;\">integer</span> <span style=\"color: #000000;\">m</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">floor</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #7060A8;\">log10</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;\">lim</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">limz</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">m</span><span style=\"color: #0000FF;\">]*</span><span style=\"color: #000000;\">n</span>\n <span style=\"color: #008080;\">for</span> <span style=\"color: #000000;\">j</span><span style=\"color: #0000FF;\">=</span><span style=\"color: #000000;\">2</span> <span style=\"color: #008080;\">to</span> <span style=\"color: #000000;\">lim</span> <span style=\"color: #008080;\">do</span>\n <span style=\"color: #004080;\">integer</span> <span style=\"color: #000000;\">y</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">sum</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #7060A8;\">factors</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">j</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;\">y</span><span style=\"color: #0000FF;\"><=</span><span style=\"color: #000000;\">n</span> <span style=\"color: #008080;\">then</span>\n <span style=\"color: #000000;\">sums</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">y</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: #008080;\">if</span> <span style=\"color: #7060A8;\">platform</span><span style=\"color: #0000FF;\">()!=</span><span style=\"color: #004600;\">JS</span> <span style=\"color: #008080;\">and</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;\">progress</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #008000;\">\"j:%,d/%,d (%3.2f%%)\\r\"</span><span style=\"color: #0000FF;\">,{</span><span style=\"color: #000000;\">j</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">lim</span><span style=\"color: #0000FF;\">,(</span><span style=\"color: #000000;\">j</span><span style=\"color: #0000FF;\">/</span><span style=\"color: #000000;\">lim</span><span style=\"color: #0000FF;\">)*</span><span style=\"color: #000000;\">100</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;\">for</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> <span style=\"color: #7060A8;\">progress</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #008000;\">\"\"</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;\">tell</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 list of all untouchable numbers <= %d:\\n\"</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: #004080;\">string</span> <span style=\"color: #000000;\">line</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #008000;\">\" 2 5\"</span>\n <span style=\"color: #004080;\">integer</span> <span style=\"color: #000000;\">cnt</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">2</span>\n <span style=\"color: #008080;\">for</span> <span style=\"color: #000000;\">t</span><span style=\"color: #0000FF;\">=</span><span style=\"color: #000000;\">6</span> <span style=\"color: #008080;\">to</span> <span style=\"color: #000000;\">n</span> <span style=\"color: #008080;\">by</span> <span style=\"color: #000000;\">2</span> <span style=\"color: #008080;\">do</span>\n <span style=\"color: #008080;\">if</span> <span style=\"color: #000000;\">sums</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">t</span><span style=\"color: #0000FF;\">]=</span><span style=\"color: #000000;\">0</span> <span style=\"color: #008080;\">then</span>\n <span style=\"color: #000000;\">cnt</span> <span style=\"color: #0000FF;\">+=</span> <span style=\"color: #000000;\">1</span>\n <span style=\"color: #008080;\">if</span> <span style=\"color: #000000;\">tell</span> <span style=\"color: #008080;\">then</span>\n <span style=\"color: #000000;\">line</span> <span style=\"color: #0000FF;\">&=</span> <span style=\"color: #7060A8;\">sprintf</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #008000;\">\"%,8d\"</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">t</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #008080;\">if</span> <span style=\"color: #7060A8;\">remainder</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">cnt</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">cols</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;\">\"%s\\n\"</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">line</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #000000;\">line</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #008000;\">\"\"</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;\">end</span> <span style=\"color: #008080;\">for</span>\n <span style=\"color: #008080;\">if</span> <span style=\"color: #000000;\">tell</span> <span style=\"color: #008080;\">then</span>\n <span style=\"color: #008080;\">if</span> <span style=\"color: #000000;\">line</span><span style=\"color: #0000FF;\">!=</span><span style=\"color: #008000;\">\"\"</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;\">\"%s\\n\"</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">line</span><span style=\"color: #0000FF;\">)</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;\">if</span>\n <span style=\"color: #004080;\">string</span> <span style=\"color: #000000;\">t</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><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #008000;\">\" (%s)\"</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;\">\"%,20d untouchable numbers were found <= %,d%s\\n\"</span><span style=\"color: #0000FF;\">,{</span><span style=\"color: #000000;\">cnt</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">n</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">t</span><span style=\"color: #0000FF;\">})</span>\n <span style=\"color: #008080;\">for</span> <span style=\"color: #000000;\">p</span><span style=\"color: #0000FF;\">=</span><span style=\"color: #000000;\">1</span> <span style=\"color: #008080;\">to</span> <span style=\"color: #000000;\">tens</span> <span style=\"color: #008080;\">do</span>\n <span style=\"color: #000000;\">untouchable</span><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: #000000;\">p</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: #000000;\">untouchable</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">2000</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">10</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">6</span><span style=\"color: #0000FF;\">-(</span><span style=\"color: #7060A8;\">platform</span><span style=\"color: #0000FF;\">()==</span><span style=\"color: #004600;\">JS</span><span style=\"color: #0000FF;\">))</span>\n<!--\n","language":"Phix"},{"code":"# 20210220 Raku programming solution\n\nsub propdiv (\\x) {\n my @l = 1 if x > 1;\n (2 .. x.sqrt.floor).map: -> \\d {\n unless x % d { @l.push: d; my \\y = x div d; @l.push: y if y != d }\n }\n @l\n}\n\nsub sieve (\\n) {\n my %s;\n for (0..(n+1)) -> \\k {\n given ( [+] propdiv k ) { %s{$_} = True if $_ ≤ (n+1) }\n }\n %s;\n}\n\nmy \\limit = 1e5;\nmy %c = ( grep { !.is-prime }, 1..limit ).Set; # store composites\nmy %s = sieve(14 * limit);\nmy @untouchable = 2, 5;\n\nloop ( my \\n = $ = 6 ; n ≤ limit ; n += 2 ) {\n @untouchable.append(n) if (!%s{n} && %c{n-1} && %c{n-3})\n}\n\nmy ($c, $last) = 0, False;\nfor @untouchable.rotor(10) {\n say [~] @_».&{$c++ ; $_ > 2000 ?? ( $last = True and last ) !! .fmt: \"%6d \"}\n $c-- and last if $last\n}\n\nsay \"\\nList of untouchable numbers ≤ 2,000 : $c \\n\";\n\nmy ($p, $count) = 10,0;\nBREAK: for @untouchable -> \\n {\n $count++;\n if (n > $p) {\n printf \"%6d untouchable numbers were found ≤ %7d\\n\", $count-1, $p;\n last BREAK if limit == ($p *= 10)\n }\n}\nprintf \"%6d untouchable numbers were found ≤ %7d\\n\", +@untouchable, limit\n","language":"Raku"},{"code":"/*REXX pgm finds N untouchable numbers (numbers that can't be equal to any aliquot sum).*/\nparse arg n cols tens over . /*obtain optional arguments from the CL*/\nif n='' | n==\",\" then n=2000 /*Not specified? Then use the default.*/\nif cols='' | cols==\",\" | cols==0 then cols= 10 /* \" \" \" \" \" \" */\nif tens='' | tens==\",\" then tens= 0 /* \" \" \" \" \" \" */\nif over='' | over==\",\" then over= 20 /* \" \" \" \" \" \" */\ntell= n>0; n= abs(n) /*N>0? Then display the untouchable #s*/\ncall genP n * over /*call routine to generate some primes.*/\nu.= 0 /*define all possible aliquot sums ≡ 0.*/\n do p=1 for #; _= @.p + 1; u._= 1 /*any prime+1 is not an untouchable.*/\n _= @.p + 3; u._= 1 /* \" prime+3 \" \" \" \" */\n end /*p*/ /* [↑] this will also rule out 5. */\nu.5= 0 /*special case as prime 2 + 3 sum to 5.*/\n do j=2 for lim; if !.j then iterate /*Is J a prime? Yes, then skip it. */\n y= sigmaP() /*compute: aliquot sum (sigma P) of J.*/\n if y<=n then u.y= 1 /*mark Y as a touchable if in range. */\n end /*j*/\ncall show /*maybe show untouchable #s and a count*/\nif tens>0 then call powers /*Any \"tens\" specified? Calculate 'em.*/\nexit cnt /*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 ?\ngenSq: do _=1 until _*_>lim; q._= _*_; end; q._= _*_; _= _+1; q._= _*_; return\ngrid: $= $ right( commas(t), w); if cnt//cols==0 then do; say $; $=; end; return\npowers: do pr=1 for tens; call 'UNTOUCHA' -(10**pr); end /*recurse*/; return\n/*──────────────────────────────────────────────────────────────────────────────────────*/\ngenP: #= 9; @.1=2; @.2=3; @.3=5; @.4=7; @.5=11; @.6=13; @.7=17; @.8=19; @.9=23 /*a list*/\n !.=0; !.2=1; !.3=1; !.5=1; !.7=1; !.11=1; !.13=1; !.17=1; !.19=1 !.23=1 /*primes*/\n parse arg lim; call genSq /*define the (high) limit for searching*/\n qq.10= 100 /*define square of the 10th prime index*/\n do j=@.#+6 by 2 to lim /*find odd primes from here on forward.*/\n parse var j '' -1 _; if _==5 then iterate; if j// 3==0 then iterate\n if j// 7==0 then iterate; if j//11==0 then iterate; if j//13==0 then iterate\n if j//17==0 then iterate; if j//19==0 then iterate; if j//23==0 then iterate\n /*start dividing by the tenth prime: 29*/\n do k=10 while qq.k <= j /* [↓] divide J by known odd primes.*/\n if j//@.k==0 then iterate j /*J ÷ by a prime? Then ¬prime. ___ */\n end /*k*/ /* [↑] only process numbers ≤ √ J */\n #= #+1; @.#= j /*bump prime count; assign a new prime.*/\n !.j= 1; qq.#= j*j /*mark prime; compute square of prime.*/\n end /*j*/; return /*#: is the number of primes generated*/\n/*──────────────────────────────────────────────────────────────────────────────────────*/\nshow: w=7; $= right(2, w+1) right(5, w) /*start the list of an even prime and 5*/\n cnt= 2 /*count of the only two primes in list.*/\n do t=6 by 2 to n; if u.t then iterate /*Is T touchable? Then skip it. */\n cnt= cnt + 1; if tell then call grid /*bump count; maybe show a grid line. */\n end /*t*/\n if tell & $\\=='' then say $ /*display a residual grid line, if any.*/\n if tell then say /*show a spacing blank line for output.*/\n if n>0 then say right( commas(cnt), 20) , /*indent the output a bit.*/\n ' untouchable numbers were found ≤ ' commas(n); return\n/*──────────────────────────────────────────────────────────────────────────────────────*/\nsigmaP: s= 1 /*set initial sigma sum (S) to 1. ___*/\n if j//2 then do m=3 by 2 while q.m<j /*divide by odd integers up to the √ J */\n if j//m==0 then s=s+m+j%m /*add the two divisors to the sum. */\n end /*m*/ /* [↑] process an odd integer. ___*/\n else do m=2 while q.m<j /*divide by all integers up to the √ J */\n if j//m==0 then s=s+m+j%m /*add the two divisors to the sum. */\n end /*m*/ /* [↑] process an even integer. ___*/\n if q.m==j then return s + m /*Was J a square? If so, add √ J */\n return s /* No, just return. */\n","language":"REXX"},{"code":"import \"./math\" for Int, Nums\nimport \"./fmt\" for Fmt\n\nvar sieve = Fn.new { |n|\n n = n + 1\n var s = List.filled(n+1, false)\n for (i in 0..n) {\n var sum = Nums.sum(Int.properDivisors(i))\n if (sum <= n) s[sum] = true\n }\n return s\n}\n\nvar limit = 1e5\nvar c = Int.primeSieve(limit, false)\nvar s = sieve.call(14 * limit)\nvar untouchable = [2, 5]\nvar n = 6\nwhile (n <= limit) {\n if (!s[n] && c[n-1] && c[n-3]) untouchable.add(n)\n n = n + 2\n}\n\nSystem.print(\"List of untouchable numbers <= 2,000:\")\nFmt.tprint(\"$,6d\", untouchable.where { |n| n <= 2000 }, 10)\nSystem.print()\nFmt.print(\"$,6d untouchable numbers were found <= 2,000\", untouchable.count { |n| n <= 2000 })\nvar p = 10\nvar count = 0\nfor (n in untouchable) {\n count = count + 1\n if (n > p) {\n Fmt.print(\"$,6d untouchable numbers were found <= $,7d\", count-1, p)\n p = p * 10\n if (p == limit) break\n }\n}\nFmt.print(\"$,6d untouchable numbers were found <= $,d\", untouchable.count, limit)\n","language":"Wren"},{"code":"import \"./math\" for Int, Nums\nimport \"./fmt\" for Fmt\n\nvar limit = 1e6\nvar m = 63\nvar c = Int.primeSieve(limit, false)\nvar n = m * limit + 1\nvar sumDivs = List.filled(n, 0)\nfor (i in 1...n) {\n var j = i\n while (j < n) {\n sumDivs[j] = sumDivs[j] + i\n j = j + i\n }\n}\nvar s = List.filled(n, false)\nfor (i in 1...n) {\n var sum = sumDivs[i] - i // proper divs sum\n if (sum <= n) s[sum] = true\n}\nvar untouchable = [2, 5]\nn = 6\nwhile (n <= limit) {\n if (!s[n] && c[n-1] && c[n-3]) untouchable.add(n)\n n = n + 2\n}\nSystem.print(\"List of untouchable numbers <= 2,000:\")\nFmt.tprint(\"$,6d\", untouchable.where { |n| n <= 2000 }, 10)\nSystem.print()\nFmt.print(\"$,7d untouchable numbers were found <= 2,000\", untouchable.count { |n| n <= 2000 })\nvar p = 10\nvar count = 0\nfor (n in untouchable) {\n count = count + 1\n if (n > p) {\n Fmt.print(\"$,7d untouchable numbers were found <= $,9d\", count-1, p)\n p = p * 10\n if (p == limit) break\n }\n}\nFmt.print(\"$,7d untouchable numbers were found <= $,d\", untouchable.count, limit)\n","language":"Wren"}],"string":"[\n {\n \"code\": \"---\\nfrom: http://rosettacode.org/wiki/Untouchable_numbers\\nnote: Prime Numbers\\n\",\n \"language\": \"00-META\"\n },\n {\n \"code\": \";Definitions:\\n:* ''Untouchable numbers'' are also known as ''nonaliquot numbers''.\\n\\n:* An untouchable number is a positive integer that <u>cannot</u> be expressed as the sum of all the proper divisors of any positive integer. <small>(From Wikipedia)</small>\\n\\n:* The ''sum of all the proper divisors'' is also known as the ''aliquot sum''.\\n\\n:* An untouchable are those numbers that are not in the image of the aliquot sum function. <small>(From Wikipedia)</small>\\n\\n:* Untouchable numbers: impossible values for the sum of all aliquot parts function. <small>(From OEIS: The On-line Encyclopedia of Integer Sequences®)</small>\\n\\n:* An untouchable number is a positive integer that is not the sum of the proper divisors of any number. <small>(From MathWorld™)</small>\\n\\n\\n;Observations and conjectures:\\nAll untouchable numbers <big>></big> '''5''' are composite numbers.\\n\\nNo untouchable number is perfect.\\n\\nNo untouchable number is sociable.\\n\\nNo untouchable number is a Mersenne prime.\\n\\nNo untouchable number is one more than a prime number, since if '''p''' is prime, then\\nthe sum of the proper divisors of '''p<sup>2</sup>''' is '''p + 1'''.\\n\\nNo untouchable number is three more than an odd prime number, since if '''p''' is an odd prime, then the \\nsum of the proper divisors of '''2p''' is '''p + 3'''.\\n\\nThe number '''5''' is believed to be the only odd untouchable number, but this has not been proven: it would follow from a\\nslightly stronger version of the [https://en.wikipedia.org/wiki/Goldbach%27s_conjecture Goldbach's conjecture], since the sum of the\\nproper divisors of '''pq''' (with '''p''', '''q''' being\\ndistinct primes) is '''1 + p + q'''.\\n\\nThere are infinitely many untouchable numbers, a fact that was proven\\nby [https://en.wikipedia.org/wiki/Paul_Erd%C5%91s Paul Erdős].\\n\\nAccording to Chen & Zhao, their natural density is at least '''d > 0.06'''.\\n\\n\\n;Task:\\n:* show (in a grid format) all untouchable numbers ≤ 2,000.\\n:* show (for the above) the ''count'' of untouchable numbers.\\n:* show the ''count'' of untouchable numbers from unity up to (inclusive):\\n::::* 10\\n::::* 100\\n::::* 1,000\\n::::* 10,000\\n::::* 100,000\\n::::* ... or as high as is you think is practical.\\n:* all output is to be shown here, on this page.\\n\\n\\n;See also:\\n:* Wolfram MathWorld: [https://mathworld.wolfram.com/UntouchableNumber.html untouchable number].\\n:* OEIS: [https://oeis.org/A005114 A005114 untouchable numbers].\\n:* OEIS: [https://oeis.org/A005114/b005114.txt a list of all untouchable numbers below 100,000 (inclusive)].\\n:* Wikipedia: [https://en.wikipedia.org/wiki/Untouchable_number untouchable number].\\n:* Wikipedia: [https://en.wikipedia.org/wiki/Goldbach%27s_conjecture Goldbach's conjecture].\\n<br><br>\\n\\n\",\n \"language\": \"00-TASK\"\n },\n {\n \"code\": \"BEGIN # find some untouchable numbers - numbers not equal to the sum of the #\\n # proper divisors of any +ve integer #\\n INT max untouchable = 1 000 000;\\n # a table of the untouchable numbers #\\n [ 1 : max untouchable ]BOOL untouchable; FOR i TO UPB untouchable DO untouchable[ i ] := TRUE OD;\\n # show the counts of untouchable numbers found #\\n PROC show untouchable statistics = VOID:\\n BEGIN\\n print( ( \\\"Untouchable numbers:\\\", newline ) );\\n INT u count := 0;\\n FOR i TO UPB untouchable DO\\n IF untouchable[ i ] THEN u count +:= 1 FI;\\n IF i = 10\\n OR i = 100\\n OR i = 1 000\\n OR i = 10 000\\n OR i = 100 000\\n OR i = 1 000 000\\n THEN\\n print( ( whole( u count, -7 ), \\\" to \\\", whole( i, -8 ), newline ) )\\n FI\\n OD\\n END; # show untouchable counts #\\n # prints the untouchable numbers up to n #\\n PROC print untouchables = ( INT n )VOID:\\n BEGIN\\n print( ( \\\"Untouchable numbers up to \\\", whole( n, 0 ), newline ) );\\n INT u count := 0;\\n FOR i TO n DO\\n IF untouchable[ i ] THEN\\n print( ( whole( i, -4 ) ) );\\n IF u count +:= 1;\\n u count MOD 16 = 0\\n THEN print( ( newline ) )\\n ELSE print( ( \\\" \\\" ) )\\n FI\\n FI\\n OD;\\n print( ( newline ) );\\n print( ( whole( u count, -7 ), \\\" to \\\", whole( n, -8 ), newline ) )\\n END; # print untouchables #\\n # find the untouchable numbers #\\n # to find untouchable numbers up to e.g.: 10 000, we need to sieve up to #\\n # 10 000 ^2 i.e. 100 000 000 #\\n # however if we also use the facts that no untouchable = prime + 1 #\\n # and no untouchable = odd prime + 3 and 5 is (very probably) the only #\\n # odd untouchable, other samples suggest we can use limit * 64 to find #\\n # untlouchables up to 1 000 000 - experimentation reveals this to be true #\\n # assume the conjecture that there are no odd untouchables except 5 #\\n BEGIN\\n untouchable[ 1 ] := FALSE;\\n untouchable[ 3 ] := FALSE;\\n FOR i FROM 7 BY 2 TO UPB untouchable DO untouchable[ i ] := FALSE OD\\n END;\\n # sieve the primes to max untouchable and flag the non untouchables #\\n BEGIN\\n PR read \\\"primes.incl.a68\\\" PR\\n []BOOL prime = PRIMESIEVE max untouchable;\\n FOR i FROM 3 BY 2 TO UPB prime DO\\n IF prime[ i ] THEN\\n IF i < max untouchable THEN\\n untouchable[ i + 1 ] := FALSE;\\n IF i < ( max untouchable - 2 ) THEN\\n untouchable[ i + 3 ] := FALSE\\n FI\\n FI\\n FI\\n OD;\\n untouchable[ 2 + 1 ] := FALSE # special case for the only even prime #\\n END;\\n # construct the proper divisor sums and flag the non untouchables #\\n BEGIN\\n [ 1 : max untouchable * 64 ]INT spd;\\n FOR i TO UPB spd DO spd[ i ] := 1 OD;\\n FOR i FROM 2 TO UPB spd DO\\n FOR j FROM i + i BY i TO UPB spd DO spd[ j ] +:= i OD\\n OD;\\n FOR i TO UPB spd DO\\n IF spd[ i ] <= UPB untouchable THEN untouchable[ spd[ i ] ] := FALSE FI\\n OD\\n END;\\n # show the untouchable numbers up to 2000 #\\n print untouchables( 2 000 );\\n # show the counts of untouchable numbers #\\n show untouchable statistics\\nEND\\n\",\n \"language\": \"ALGOL-68\"\n },\n {\n \"code\": \"#include <stdio.h>\\n#include <stdlib.h>\\n#include <stdbool.h>\\n#include <locale.h>\\n\\nbool *primeSieve(int limit) {\\n int i, p;\\n limit++;\\n // True denotes composite, false denotes prime.\\n bool *c = calloc(limit, sizeof(bool)); // all false by default\\n c[0] = true;\\n c[1] = true;\\n for (i = 4; i < limit; i += 2) c[i] = true;\\n p = 3; // Start from 3.\\n while (true) {\\n int p2 = p * p;\\n if (p2 >= limit) break;\\n for (i = p2; i < limit; i += 2 * p) c[i] = true;\\n while (true) {\\n p += 2;\\n if (!c[p]) break;\\n }\\n }\\n return c;\\n}\\n\\nint main() {\\n const int limit = 1000000;\\n int i, j, n, uc = 2, p = 10, m = 63, ul = 151000;\\n bool *c = primeSieve(limit);\\n n = m * limit + 1;\\n int *sumDivs = (int *)calloc(n, sizeof(int));\\n for (i = 1; i < n; ++i) {\\n for (j = i; j < n; j += i) sumDivs[j] += i;\\n }\\n bool *s = (bool *)calloc(n, sizeof(bool)); // all false\\n for (i = 1; i < n; ++i) {\\n int sum = sumDivs[i] - i; // proper divs sum\\n if (sum <= n) s[sum] = true;\\n }\\n free(sumDivs);\\n int *untouchable = (int *)malloc(ul * sizeof(int));\\n untouchable[0] = 2;\\n untouchable[1] = 5;\\n for (n = 6; n <= limit; n += 2) {\\n if (!s[n] && c[n-1] && c[n-3]) untouchable[uc++] = n;\\n }\\n setlocale(LC_NUMERIC, \\\"\\\");\\n printf(\\\"List of untouchable numbers <= 2,000:\\\\n\\\");\\n for (i = 0; i < uc; ++i) {\\n j = untouchable[i];\\n if (j > 2000) break;\\n printf(\\\"%'6d \\\", j);\\n if (!((i+1) % 10)) printf(\\\"\\\\n\\\");\\n }\\n printf(\\\"\\\\n\\\\n%'7d untouchable numbers were found <= 2,000\\\\n\\\", i);\\n for (i = 0; i < uc; ++i) {\\n j = untouchable[i];\\n if (j > p) {\\n printf(\\\"%'7d untouchable numbers were found <= %'9d\\\\n\\\", i, p);\\n p *= 10;\\n if (p == limit) break;\\n }\\n }\\n printf(\\\"%'7d untouchable numbers were found <= %'d\\\\n\\\", uc, limit);\\n free(c);\\n free(s);\\n free(untouchable);\\n return 0;\\n}\\n\",\n \"language\": \"C\"\n },\n {\n \"code\": \"// Untouchable Numbers : Nigel Galloway - March 4th., 2021;\\n#include <functional>\\n#include <bitset>\\n#include <iostream>\\n#include <cmath>\\nusing namespace std; using Z0=long long; using Z1=optional<Z0>; using Z2=optional<array<int,3>>; using Z3=function<Z2()>;\\nconst int maxUT{3000000}, dL{(int)log2(maxUT)};\\nstruct uT{\\n bitset<maxUT+1>N; vector<int> G{}; array<Z3,int(dL+1)>L{Z3{}}; int sG{0},mUT{};\\n void _g(int n,int g){if(g<=mUT){N[g]=false; return _g(n,n+g);}}\\n Z1 nxt(const int n){if(n>mUT) return Z1{}; if(N[n]) return Z1(n); return nxt(n+1);}\\n Z3 fN(const Z0 n,const Z0 i,int g){return [=]()mutable{if(g<sG && ((n+i)*(1+G[g])-n*G[g]<=mUT)) return Z2{{n,i,g++}}; return Z2{};};}\\n Z3 fG(Z0 n,Z0 i,const int g){Z0 e{n+i},l{1},p{1}; return [=]()mutable{n=n*G[g]; p=p*G[g]; l=l+p; i=e*l-n; if(i<=mUT) return Z2{{n,i,g}}; return Z2{};};}\\n void fL(Z3 n, int g){for(;;){\\n if(auto i=n()){N[(*i)[1]]=false; L[g+1]=fN((*i)[0],(*i)[1],(*i)[2]+1); g=g+1; continue;}\\n if(auto i=L[g]()){n=fG((*i)[0],(*i)[1],(*i)[2]); continue;}\\n if(g>0) if(auto i=L[g-1]()){ g=g-1; n=fG((*i)[0],(*i)[1],(*i)[2]); continue;}\\n if(g>0){ n=[](){return Z2{};}; g=g-1; continue;} break;}\\n }\\n int count(){int g{0}; for(auto n=nxt(0); n; n=nxt(*n+1)) ++g; return g;}\\n uT(const int n):mUT{n}{\\n N.set(); N[0]=false; N[1]=false; for(auto n=nxt(0);*n<=sqrt(mUT);n=nxt(*n+1)) _g(*n,*n+*n); for(auto n=nxt(0); n; n=nxt(*n+1)) G.push_back(*n); sG=G.size();\\n N.set(); N[0]=false; L[0]=fN(1,0,0); fL([](){return Z2{};},0);\\n }\\n};\\n\",\n \"language\": \"C++\"\n },\n {\n \"code\": \"int main(int argc, char *argv[]) {\\n int c{0}; auto n{uT{2000}}; for(auto g=n.nxt(0); g; g=n.nxt(*g+1)){if(c++==30){c=1; printf(\\\"\\\\n\\\");} printf(\\\"%4d \\\",*g);} printf(\\\"\\\\n\\\");\\n}\\n\",\n \"language\": \"C++\"\n },\n {\n \"code\": \"int main(int argc, char *argv[]) {\\n int z{100000}; auto n{uT{z}}; cout<<\\\"untouchables below \\\"<<z<<\\\"->\\\"<<n.count()<<endl;\\n}\\n\",\n \"language\": \"C++\"\n },\n {\n \"code\": \"int main(int argc, char *argv[]) {\\n int z{1000000}; auto n{uT{z}}; cout<<\\\"untouchables below \\\"<<z<<\\\"->\\\"<<n.count()<<endl;\\n}\\n\",\n \"language\": \"C++\"\n },\n {\n \"code\": \"int main(int argc, char *argv[]) {\\n int z{2000000}; auto n{uT{z}}; cout<<\\\"untouchables below \\\"<<z<<\\\"->\\\"<<n.count()<<endl;\\n}\\n\",\n \"language\": \"C++\"\n },\n {\n \"code\": \"program Untouchable_numbers;\\n\\n{$APPTYPE CONSOLE}\\n\\nuses\\n System.SysUtils;\\n\\nfunction SumDivisors(n: Integer): Integer;\\nbegin\\n Result := 1;\\n var k := 2;\\n if not odd(n) then\\n k := 1;\\n var i := 1 + k;\\n while i * i <= n do\\n begin\\n if (n mod i) = 0 then\\n begin\\n inc(Result, i);\\n var j := n div i;\\n if j <> i then\\n inc(Result, j);\\n end;\\n inc(i, k);\\n end;\\nend;\\n\\nfunction Sieve(n: Integer): TArray<Boolean>;\\nbegin\\n inc(n);\\n SetLength(result, n + 1);\\n for var i := 6 to n do\\n begin\\n var sd := SumDivisors(i);\\n if sd <= n then\\n result[sd] := True;\\n end;\\nend;\\n\\nfunction PrimeSieve(limit: Integer): TArray<Boolean>;\\nbegin\\n inc(limit);\\n SetLength(result, limit);\\n Result[0] := True;\\n Result[1] := True;\\n\\n var p := 3;\\n repeat\\n var p2 := p * p;\\n if p2 >= limit then\\n Break;\\n var i := p2;\\n while i < limit do\\n begin\\n\\n Result[i] := True;\\n inc(i, 2 * p);\\n end;\\n\\n repeat\\n inc(p, 2);\\n until not Result[p];\\n\\n until (False);\\n\\nend;\\n\\nfunction Commatize(n: Double): string;\\nvar\\n fmt: TFormatSettings;\\nbegin\\n fmt := TFormatSettings.Create('en-US');\\n Result := n.ToString(ffNumber, 64, 0, fmt);\\nend;\\n\\nbegin\\n var limit := 1000000;\\n var c := primeSieve(limit);\\n var s := sieve(63 * limit);\\n var untouchable: TArray<Integer> := [2, 5];\\n var n := 6;\\n while n <= limit do\\n begin\\n if not s[n] and c[n - 1] and c[n - 3] then\\n begin\\n SetLength(untouchable, Length(untouchable) + 1);\\n untouchable[High(untouchable)] := n;\\n end;\\n inc(n, 2);\\n end;\\n writeln('List of untouchable numbers <= 2,000:');\\n var count := 0;\\n var i := 0;\\n while untouchable[i] <= 2000 do\\n begin\\n write(commatize(untouchable[i]): 6);\\n if ((i + 1) mod 10) = 0 then\\n writeln;\\n inc(i);\\n end;\\n writeln(#10#10, commatize(count): 7, ' untouchable numbers were found <= 2,000');\\n\\n var p := 10;\\n count := 0;\\n for n in untouchable do\\n begin\\n inc(count);\\n if n > p then\\n begin\\n var cc := commatize(count - 1);\\n var cp := commatize(p);\\n writeln(cc, ' untouchable numbers were found <= ', cp);\\n p := p * 10;\\n if p = limit then\\n Break;\\n end;\\n end;\\n\\n var cu := commatize(Length(untouchable));\\n var cl := commatize(limit);\\n writeln(cu:7, ' untouchable numbers were found <= ', cl);\\n readln;\\nend.\\n\",\n \"language\": \"Delphi\"\n },\n {\n \"code\": \"// Applied dendrology. Nigel Galloway: February 15., 2021\\nlet uT a=let N,G=Array.create(a+1) true, [|yield! primes64()|>Seq.takeWhile((>)(int64 a))|]\\n let fN n i e=let mutable p=e-1 in (fun()->p<-p+1; if p<G.Length && (n+i)*(1L+G.[p])-n*G.[p]<=(int64 a) then Some(n,i,p) else None)\\n let fG n i e=let g=n+i in let mutable n,l,p=n,1L,1L\\n (fun()->n<-n*G.[e]; p<-p*G.[e]; l<-l+p; let i=g*l-n in if i<=(int64 a) then Some(n,i,e) else None)\\n let rec fL n g=match n() with Some(f,i,e)->N.[(int i)]<-false; fL n ((fN f i (e+1))::g)\\n |_->match g with n::t->match n() with Some (n,i,e)->fL (fG n i e) g |_->fL n t\\n |_->N.[0]<-false; N\\n fL (fG 1L 0L 0) [fN 1L 0L 1]\\n\",\n \"language\": \"F-Sharp\"\n },\n {\n \"code\": \"uT 2000|>Array.mapi(fun n g->(n,g))|>Array.filter(fun(_,n)->n)|>Array.chunkBySize 30|>Array.iter(fun n->n|>Array.iter(fst>>printf \\\"%5d\\\");printfn \\\"\\\")\\n\",\n \"language\": \"F-Sharp\"\n },\n {\n \"code\": \"printfn \\\"%d\\\" (uT 100000|>Array.filter id|>Array.length)\\n\",\n \"language\": \"F-Sharp\"\n },\n {\n \"code\": \"printfn \\\"%d\\\" (uT 1000000|>Array.filter id|>Array.length)\\n\",\n \"language\": \"F-Sharp\"\n },\n {\n \"code\": \"printfn \\\"%d\\\" (uT 2000000|>Array.filter id|>Array.length)\\n\",\n \"language\": \"F-Sharp\"\n },\n {\n \"code\": \"printfn \\\"%d\\\" (uT 3000000|>Array.filter id|>Array.length)\\n\",\n \"language\": \"F-Sharp\"\n },\n {\n \"code\": \"Const max_untouchable = 1e6\\n\\nDim Shared untouchable(1 To max_untouchable) As Uinteger\\nFor i As Uinteger = 1 To Ubound(untouchable)\\n untouchable(i) = True\\nNext i\\n\\nSub show_untouchable_statistics()\\n Dim As Uinteger i, cnt = 0\\n For i = 1 To Ubound(untouchable)\\n If untouchable(i) Then cnt += 1\\n If i = 10 Orelse i = 100 Orelse i = 1000 Orelse i = 10000 Orelse i = 1e5 Then\\n Print Using \\\"###,### untouchable numbers were found <= #,###,###\\\"; cnt; i\\n End If\\n Next i\\nEnd Sub\\n\\nSub print_untouchables(n As Uinteger)\\n Print Using \\\"List of untouchable numbers <= #,###:\\\"; n\\n Dim As Uinteger i, cnt = 0\\n For i = 1 To n\\n If untouchable(i) Then\\n Print Using \\\"##,###\\\"; i;\\n cnt += 1\\n Print Iif(cnt Mod 16 = 0, !\\\"\\\\n\\\", \\\" \\\");\\n End If\\n Next i\\n Print: Print\\n Print Using \\\"###,### untouchable numbers were found <= #,###,###\\\"; cnt; n\\nEnd Sub\\n\\nDim As Uinteger i, j\\nuntouchable(1) = False\\nuntouchable(3) = False\\nFor i = 7 To Ubound(untouchable) Step 2\\n untouchable(i) = False\\nNext i\\n\\nDim Shared spd(1 To max_untouchable * 64) As Uinteger\\nDim As Uinteger ub = Ubound(spd)\\nFor i = 1 To ub\\n spd(i) = 1\\nNext i\\nFor i = 2 To ub\\n For j = i + i To ub Step i\\n spd(j) += i\\n Next j\\nNext i\\nFor i = 1 To ub\\n If spd(i) <= Ubound(untouchable) Then untouchable(spd(i)) = False\\nNext i\\n\\n' Show the untouchable numbers up to 2000\\nprint_untouchables(2000)\\n' Show the counts of untouchable numbers\\nshow_untouchable_statistics()\\n\\nSleep\\n\",\n \"language\": \"FreeBASIC\"\n },\n {\n \"code\": \"package main\\n\\nimport \\\"fmt\\\"\\n\\nfunc sumDivisors(n int) int {\\n sum := 1\\n k := 2\\n if n%2 == 0 {\\n k = 1\\n }\\n for i := 1 + k; i*i <= n; i += k {\\n if n%i == 0 {\\n sum += i\\n j := n / i\\n if j != i {\\n sum += j\\n }\\n }\\n }\\n return sum\\n}\\n\\nfunc sieve(n int) []bool {\\n n++\\n s := make([]bool, n+1) // all false by default\\n for i := 6; i <= n; i++ {\\n sd := sumDivisors(i)\\n if sd <= n {\\n s[sd] = true\\n }\\n }\\n return s\\n}\\n\\nfunc primeSieve(limit int) []bool {\\n limit++\\n // True denotes composite, false denotes prime.\\n c := make([]bool, limit) // all false by default\\n c[0] = true\\n c[1] = true\\n // no need to bother with even numbers over 2 for this task\\n p := 3 // Start from 3.\\n for {\\n p2 := p * p\\n if p2 >= limit {\\n break\\n }\\n for i := p2; i < limit; i += 2 * p {\\n c[i] = true\\n }\\n for {\\n p += 2\\n if !c[p] {\\n break\\n }\\n }\\n }\\n return c\\n}\\n\\nfunc commatize(n int) string {\\n s := fmt.Sprintf(\\\"%d\\\", n)\\n if n < 0 {\\n s = s[1:]\\n }\\n le := len(s)\\n for i := le - 3; i >= 1; i -= 3 {\\n s = s[0:i] + \\\",\\\" + s[i:]\\n }\\n if n >= 0 {\\n return s\\n }\\n return \\\"-\\\" + s\\n}\\n\\nfunc main() {\\n limit := 1000000\\n c := primeSieve(limit)\\n s := sieve(63 * limit)\\n untouchable := []int{2, 5}\\n for n := 6; n <= limit; n += 2 {\\n if !s[n] && c[n-1] && c[n-3] {\\n untouchable = append(untouchable, n)\\n }\\n }\\n fmt.Println(\\\"List of untouchable numbers <= 2,000:\\\")\\n count := 0\\n for i := 0; untouchable[i] <= 2000; i++ {\\n fmt.Printf(\\\"%6s\\\", commatize(untouchable[i]))\\n if (i+1)%10 == 0 {\\n fmt.Println()\\n }\\n count++\\n }\\n fmt.Printf(\\\"\\\\n\\\\n%7s untouchable numbers were found <= 2,000\\\\n\\\", commatize(count))\\n p := 10\\n count = 0\\n for _, n := range untouchable {\\n count++\\n if n > p {\\n cc := commatize(count - 1)\\n cp := commatize(p)\\n fmt.Printf(\\\"%7s untouchable numbers were found <= %9s\\\\n\\\", cc, cp)\\n p = p * 10\\n if p == limit {\\n break\\n }\\n }\\n }\\n cu := commatize(len(untouchable))\\n cl := commatize(limit)\\n fmt.Printf(\\\"%7s untouchable numbers were found <= %s\\\\n\\\", cu, cl)\\n}\\n\",\n \"language\": \"Go\"\n },\n {\n \"code\": \"package main\\n\\nimport (\\n \\\"fmt\\\"\\n \\\"rcu\\\"\\n)\\n\\nfunc main() {\\n limit := 1000000\\n m := 63\\n c := rcu.PrimeSieve(limit, false)\\n n := m*limit + 1\\n sumDivs := make([]int, n)\\n for i := 1; i < n; i++ {\\n for j := i; j < n; j += i {\\n sumDivs[j] += i\\n }\\n }\\n s := make([]bool, n) // all false\\n for i := 1; i < n; i++ {\\n sum := sumDivs[i] - i // proper divs sum\\n if sum <= n {\\n s[sum] = true\\n }\\n }\\n untouchable := []int{2, 5}\\n for n := 6; n <= limit; n += 2 {\\n if !s[n] && c[n-1] && c[n-3] {\\n untouchable = append(untouchable, n)\\n }\\n }\\n fmt.Println(\\\"List of untouchable numbers <= 2,000:\\\")\\n count := 0\\n for i := 0; untouchable[i] <= 2000; i++ {\\n fmt.Printf(\\\"%6s\\\", rcu.Commatize(untouchable[i]))\\n if (i+1)%10 == 0 {\\n fmt.Println()\\n }\\n count++\\n }\\n fmt.Printf(\\\"\\\\n\\\\n%7s untouchable numbers were found <= 2,000\\\\n\\\", rcu.Commatize(count))\\n p := 10\\n count = 0\\n for _, n := range untouchable {\\n count++\\n if n > p {\\n cc := rcu.Commatize(count - 1)\\n cp := rcu.Commatize(p)\\n fmt.Printf(\\\"%7s untouchable numbers were found <= %9s\\\\n\\\", cc, cp)\\n p = p * 10\\n if p == limit {\\n break\\n }\\n }\\n }\\n cu := rcu.Commatize(len(untouchable))\\n cl := rcu.Commatize(limit)\\n fmt.Printf(\\\"%7s untouchable numbers were found <= %s\\\\n\\\", cu, cl)\\n}\\n\",\n \"language\": \"Go\"\n },\n {\n \"code\": \"factor=: 3 : 0 NB. explicit\\n 'primes powers'=. __&q: y\\n input_to_cartesian_product=. primes ^&.> i.&.> >: powers\\n cartesian_product=. , { input_to_cartesian_product\\n , */&> cartesian_product\\n)\\n\\nfactor=: [: , [: */&> [: { [: (^&.> i.&.>@>:)/ __&q: NB. tacit\\n\\n\\nproper_divisors=: [: }: factor\\nsum_of_proper_divisors=: +/@proper_divisors\\n\\ncandidates=: 5 , [: +: [: #\\\\@i. >.@-: NB. within considered range, all but one candidate are even.\\nspds=:([:sum_of_proper_divisors\\\"0(#\\\\@i.-.i.&.:(p:inv))@*:)f. NB. remove primes which contribute 1\\n\",\n \"language\": \"J\"\n },\n {\n \"code\": \"using Primes\\n\\nfunction properfactorsum(n)\\n f = [one(n)]\\n for (p,e) in factor(n)\\n f = reduce(vcat, [f*p^j for j in 1:e], init=f)\\n end\\n pop!(f)\\n return sum(f)\\nend\\n\\nconst maxtarget, sievelimit = 1_000_000, 512_000_000\\nconst untouchables = ones(Bool, maxtarget)\\n\\nfor i in 2:sievelimit\\n n = properfactorsum(i)\\n if n <= maxtarget\\n untouchables[n] = false\\n end\\nend\\nfor i in 6:maxtarget\\n if untouchables[i] && (isprime(i - 1) || isprime(i - 3))\\n untouchables[i] = false\\n end\\nend\\n\\nprintln(\\\"The untouchable numbers ≤ 2000 are: \\\")\\nfor (i, n) in enumerate(filter(x -> untouchables[x], 1:2000))\\n print(rpad(n, 5), i % 10 == 0 || i == 196 ? \\\"\\\\n\\\" : \\\"\\\")\\nend\\nfor N in [2000, 10, 100, 1000, 10_000, 100_000, 1_000_000]\\n println(\\\"The count of untouchable numbers ≤ $N is: \\\", count(x -> untouchables[x], 1:N))\\nend\\n\",\n \"language\": \"Julia\"\n },\n {\n \"code\": \"f = DivisorSigma[1, #] - # &;\\nlimit = 10^5;\\nc = Not /@ PrimeQ[Range[limit]];\\nslimit = 15 limit;\\ns = ConstantArray[False, slimit + 1];\\nuntouchable = {2, 5};\\nDo[\\n val = f[i];\\n If[val <= slimit,\\n s[[val]] = True\\n ]\\n ,\\n {i, 6, slimit}\\n]\\nDo[\\n If[! s[[n]],\\n If[c[[n - 1]],\\n If[c[[n - 3]],\\n AppendTo[untouchable, n]\\n ]\\n ]\\n ]\\n ,\\n {n, 6, limit, 2}\\n]\\nMulticolumn[Select[untouchable, LessEqualThan[2000]]]\\nCount[untouchable, _?(LessEqualThan[2000])]\\nCount[untouchable, _?(LessEqualThan[10])]\\nCount[untouchable, _?(LessEqualThan[100])]\\nCount[untouchable, _?(LessEqualThan[1000])]\\nCount[untouchable, _?(LessEqualThan[10000])]\\nCount[untouchable, _?(LessEqualThan[100000])]\\n\",\n \"language\": \"Mathematica\"\n },\n {\n \"code\": \"import math, strutils\\n\\nconst\\n Lim1 = 100_000 # Limit for untouchable numbers.\\n Lim2 = 14 * Lim1 # Limit for computation of sum of divisors.\\n\\nproc sumdiv(n: uint): uint =\\n ## Return the sum of the strict divisors of \\\"n\\\".\\n result = 1\\n let r = sqrt(n.float).uint\\n let k = if (n and 1) == 0: 1u else: 2u\\n for d in countup(k + 1, r, k):\\n if n mod d == 0:\\n result += d\\n let q = n div d\\n if q != d: result += q\\n\\nvar\\n isSumDiv: array[1..Lim2, bool]\\n isPrime: array[1..Lim1, bool]\\n\\n# Fill both sieves in a single pass.\\nfor n in 1u..Lim2:\\n let s = sumdiv(n)\\n if s <= Lim2:\\n isSumDiv[s] = true\\n if s == 1 and n <= Lim1:\\n isPrime[n] = true\\nisPrime[1] = false\\n\\n# Build list of untouchable numbers.\\nvar list = @[2, 5]\\nfor n in countup(6, Lim1, 2):\\n if not (isSumDiv[n] or isPrime[n - 1] or isPrime[n - 3]):\\n list.add n\\n\\necho \\\"Untouchable numbers ≤ 2000:\\\"\\nvar count, lcount = 0\\nfor n in list:\\n if n <= 2000:\\n stdout.write ($n).align(5)\\n inc count\\n inc lcount\\n if lcount == 20:\\n echo()\\n lcount = 0\\n else:\\n if lcount > 0: echo()\\n break\\n\\nconst CountMessage = \\\"There are $1 untouchable numbers ≤ $2.\\\"\\necho CountMessage.format(count, 2000), '\\\\n'\\n\\ncount = 0\\nvar lim = 10\\nfor n in list:\\n if n > lim:\\n echo CountMessage.format(count, lim)\\n lim *= 10\\n inc count\\nif lim == Lim1:\\n # Emit last message.\\n echo CountMessage.format(count, lim)\\n\",\n \"language\": \"Nim\"\n },\n {\n \"code\": \"program UntouchableNumbers;\\nprogram UntouchableNumbers;\\n{$IFDEF FPC}\\n {$MODE DELPHI} {$OPTIMIZATION ON,ALL} {$COPERATORS ON}\\n {$CODEALIGN proc=16,loop=4}\\n{$ELSE}\\n {$APPTYPE CONSOLE}\\n{$ENDIF}\\nuses\\n sysutils,strutils\\n{$IFDEF WINDOWS},Windows{$ENDIF}\\n ;\\nconst\\n MAXPRIME = 1742537;\\n //sqr(MaxPrime) = 3e12\\n LIMIT = 5*1000*1000;\\n LIMIT_mul = trunc(exp(ln(LIMIT)/3))+1;\\n\\nconst\\n SizePrDeFe = 16*8192;//*size of(tprimeFac) =16 byte 2 Mb ~ level 3 cache\\ntype\\n tdigits = array [0..31] of Uint32;\\n tprimeFac = packed record\\n pfSumOfDivs,\\n pfRemain : Uint64;\\n end;\\n tpPrimeFac = ^tprimeFac;\\n\\n tPrimeDecompField = array[0..SizePrDeFe-1] of tprimeFac;\\n\\n tPrimes = array[0..1 shl 17-1] of Uint32;\\n\\nvar\\n {$ALIGN 16}\\n PrimeDecompField :tPrimeDecompField;\\n {$ALIGN 16}\\n SmallPrimes: tPrimes;\\n pdfIDX,pdfOfs: NativeInt;\\n TD : Int64;\\n\\nprocedure OutCounts(pUntouch:pByte);\\nvar\\n n,cnt,lim,deltaLim : NativeInt;\\nBegin\\n n := 0;\\n cnt := 0;\\n deltaLim := 100;\\n lim := deltaLim;\\n repeat\\n cnt += 1-pUntouch[n];\\n if n = lim then\\n Begin\\n writeln(Numb2USA(IntToStr(lim)):13,' ',Numb2USA(IntToStr(cnt)):12);\\n lim += deltaLim;\\n if lim = 10*deltaLim then\\n begin\\n deltaLim *=10;\\n lim := deltaLim;\\n writeln;\\n end;\\n end;\\n\\n inc(n);\\n until n > LIMIT;\\nend;\\n\\nfunction OutN(n:UInt64):UInt64;\\nbegin\\n write(Numb2USA(IntToStr(n)):15,' dt ',(GettickCount64-TD)/1000:5:3,' s'#13);\\n TD := GettickCount64;\\n result := n+LIMIT;\\nend;\\n\\n//######################################################################\\n//gets sum of divisors of consecutive integers fast\\nprocedure InitSmallPrimes;\\n//get primes. Sieving only odd numbers\\nvar\\n pr : array[0..MAXPRIME] of byte;\\n p,j,d,flipflop :NativeUInt;\\nBegin\\n SmallPrimes[0] := 2;\\n fillchar(pr[0],SizeOf(pr),#0);\\n p := 0;\\n repeat\\n repeat\\n p +=1\\n until pr[p]= 0;\\n j := (p+1)*p*2;\\n if j>MAXPRIME then\\n BREAK;\\n d := 2*p+1;\\n repeat\\n pr[j] := 1;\\n j += d;\\n until j>MAXPRIME;\\n until false;\\n\\n SmallPrimes[1] := 3;\\n SmallPrimes[2] := 5;\\n j := 3;\\n flipflop := (2+1)-1;//7+2*2->11+2*1->13 ,17 ,19 , 23\\n p := 3;\\n repeat\\n if pr[p] = 0 then\\n begin\\n SmallPrimes[j] := 2*p+1;\\n inc(j);\\n end;\\n p+=flipflop;\\n flipflop := 3-flipflop;\\n until (p > MAXPRIME) OR (j>High(SmallPrimes));\\nend;\\n\\nfunction CnvtoBASE(var dgt:tDigits;n:Uint64;base:NativeUint):NativeInt;\\n//n must be multiple of base aka n mod base must be 0\\nvar\\n q,r: Uint64;\\n i : NativeInt;\\nBegin\\n fillchar(dgt,SizeOf(dgt),#0);\\n i := 0;\\n n := n div base;\\n result := 0;\\n repeat\\n r := n;\\n q := n div base;\\n r -= q*base;\\n n := q;\\n dgt[i] := r;\\n inc(i);\\n until (q = 0);\\n //searching lowest pot in base\\n result := 0;\\n while (result<i) AND (dgt[result] = 0) do\\n inc(result);\\n inc(result);\\nend;\\n\\nfunction IncByOneInBase(var dgt:tDigits;base:NativeInt):NativeInt;\\nvar\\n q :NativeInt;\\nBegin\\n result := 0;\\n q := dgt[result]+1;\\n if q = base then\\n repeat\\n dgt[result] := 0;\\n inc(result);\\n q := dgt[result]+1;\\n until q <> base;\\n dgt[result] := q;\\n result +=1;\\nend;\\n\\nprocedure CalcSumOfDivs(var pdf:tPrimeDecompField;var dgt:tDigits;n,k,pr:Uint64);\\nvar\\n fac,s :Uint64;\\n j : Int32;\\nBegin\\n //j is power of prime\\n j := CnvtoBASE(dgt,n+k,pr);\\n repeat\\n fac := 1;\\n s := 1;\\n repeat\\n fac *= pr;\\n dec(j);\\n s += fac;\\n until j<= 0;\\n with pdf[k] do\\n Begin\\n pfSumOfDivs *= s;\\n pfRemain := pfRemain DIV fac;\\n end;\\n j := IncByOneInBase(dgt,pr);\\n k += pr;\\n until k >= SizePrDeFe;\\nend;\\n\\nfunction SieveOneSieve(var pdf:tPrimeDecompField):boolean;\\nvar\\n dgt:tDigits;\\n i,j,k,pr,n,MaxP : Uint64;\\nbegin\\n n := pdfOfs;\\n if n+SizePrDeFe >= sqr(SmallPrimes[High(SmallPrimes)]) then\\n EXIT(FALSE);\\n //init\\n for i := 0 to SizePrDeFe-1 do\\n begin\\n with pdf[i] do\\n Begin\\n pfSumOfDivs := 1;\\n pfRemain := n+i;\\n end;\\n end;\\n //first factor 2. Make n+i even\\n i := (pdfIdx+n) AND 1;\\n IF (n = 0) AND (pdfIdx<2) then\\n i := 2;\\n\\n repeat\\n with pdf[i] do\\n begin\\n j := BsfQWord(n+i);\\n pfRemain := (n+i) shr j;\\n pfSumOfDivs := (Uint64(1) shl (j+1))-1;\\n end;\\n i += 2;\\n until i >=SizePrDeFe;\\n //i now index in SmallPrimes\\n i := 0;\\n maxP := trunc(sqrt(n+SizePrDeFe))+1;\\n repeat\\n //search next prime that is in bounds of sieve\\n if n = 0 then\\n begin\\n repeat\\n inc(i);\\n pr := SmallPrimes[i];\\n k := pr-n MOD pr;\\n if k < SizePrDeFe then\\n break;\\n until pr > MaxP;\\n end\\n else\\n begin\\n repeat\\n inc(i);\\n pr := SmallPrimes[i];\\n k := pr-n MOD pr;\\n if (k = pr) AND (n>0) then\\n k:= 0;\\n if k < SizePrDeFe then\\n break;\\n until pr > MaxP;\\n end;\\n\\n //no need to use higher primes\\n if pr > maxP then\\n BREAK;\\n\\n CalcSumOfDivs(pdf,dgt,n,k,pr);\\n until false;\\n\\n //correct sum of & count of divisors\\n for i := 0 to High(pdf) do\\n Begin\\n with pdf[i] do\\n begin\\n j := pfRemain;\\n if j <> 1 then\\n pfSumOFDivs *= (j+1);\\n end;\\n end;\\n result := true;\\nend;\\n\\nfunction NextSieve:boolean;\\nbegin\\n dec(pdfIDX,SizePrDeFe);\\n inc(pdfOfs,SizePrDeFe);\\n result := SieveOneSieve(PrimeDecompField);\\nend;\\n\\nfunction GetNextPrimeDecomp:tpPrimeFac;\\nbegin\\n if pdfIDX >= SizePrDeFe then\\n if Not(NextSieve) then\\n Begin\\n writeln('of limits ');\\n EXIT(NIL);\\n end;\\n result := @PrimeDecompField[pdfIDX];\\n inc(pdfIDX);\\nend;\\n\\nfunction Init_Sieve(n:NativeUint):boolean;\\n//Init Sieve pdfIdx,pdfOfs are Global\\nbegin\\n pdfIdx := n MOD SizePrDeFe;\\n pdfOfs := n-pdfIdx;\\n result := SieveOneSieve(PrimeDecompField);\\nend;\\n//gets sum of divisors of consecutive integers fast\\n//######################################################################\\n\\nprocedure CheckRest(n: Uint64;pUntouch:pByte);\\nvar\\n k,lim : Uint64;\\nbegin\\n lim := 2*LIMIT;\\n repeat\\n k := GetNextPrimeDecomp^.pfSumOfDivs-n;\\n inc(n);\\n if Not(ODD(k)) AND (k<=LIMIT) then\\n pUntouch[k] := 1;\\n // showing still alive not for TIO.RUN\\n// if n >= lim then lim := OutN(n);\\n until n >LIMIT_mul*LIMIT;\\nend;\\n\\nvar\\n Untouch : array of byte;\\n pUntouch: pByte;\\n puQW : pQword;\\n T0:Int64;\\n n,k : NativeInt;\\nBegin\\n if sqrt(LIMIT_mul*LIMIT) >=MAXPRIME then\\n Begin\\n writeln('Need to extend count of primes > ',\\n trunc(sqrt(LIMIT_mul*LIMIT))+1);\\n HALT(0);\\n end;\\n\\n setlength(untouch,LIMIT+8+1);\\n pUntouch := @untouch[0];\\n //Mark all odd as touchable\\n puQW := @pUntouch[0];\\n For n := 0 to LIMIT DIV 8 do puQW[n] := $0100010001000100;\\n\\n InitSmallPrimes;\\n T0 := GetTickCount64;\\n writeln('LIMIT = ',Numb2USA(IntToStr(LIMIT)));\\n writeln('factor beyond LIMIT ',LIMIT_mul);\\n\\n n := 0;\\n Init_Sieve(n);\\n\\n pUntouch[1] := 1;//all primes\\n repeat\\n k := GetNextPrimeDecomp^.pfSumOfDivs-n;\\n inc(n);//n-> n+1\\n if k <= LIMIT then\\n begin\\n If k <> 1 then\\n pUntouch[k] := 1\\n else\\n begin\\n //n-1 is prime p\\n //mark p*p\\n pUntouch[n] := 1;\\n //mark 2*p\\n //5 marked by prime 2 but that is p*p, but 4 has factor sum = 3\\n pUntouch[n+2] := 1;\\n end;\\n end;\\n until n > LIMIT-2;\\n //unmark 5 and mark 0\\n puntouch[5] := 0;\\n pUntouch[0] := 1;\\n\\n //n=limit-1\\n k := GetNextPrimeDecomp^.pfSumOfDivs-n;\\n inc(n);\\n If (k <> 1) AND (k<=LIMIT) then\\n pUntouch[k] := 1\\n else\\n pUntouch[n] := 1;\\n //n=limit\\n k := GetNextPrimeDecomp^.pfSumOfDivs-n;\\n If Not(odd(k)) AND (k<=LIMIT) then\\n pUntouch[k] := 1;\\n\\n\\n n:= limit+1;\\n writeln('runtime for n<= LIMIT ',(GetTickCount64-T0)/1000:0:3,' s');\\n writeln('Check the rest ',Numb2USA(IntToStr((LIMIT_mul-1)*Limit)));\\n TD := GettickCount64;\\n CheckRest(n,pUntouch);\\n writeln('runtime ',(GetTickCount64-T0)/1000:0:3,' s');\\n T0 := GetTickCount64-T0;\\n\\n OutCounts(pUntouch);\\nend.\\n\",\n \"language\": \"Pascal\"\n },\n {\n \"code\": \"use strict;\\nuse warnings;\\nuse enum qw(False True);\\nuse ntheory qw/divisor_sum is_prime/;\\n\\nsub sieve {\\n my($n) = @_;\\n my %s;\\n for my $k (0 .. $n+1) {\\n my $sum = divisor_sum($k) - $k;\\n $s{$sum} = True if $sum <= $n+1;\\n }\\n %s\\n}\\n\\nmy(%s,%c);\\nmy($max, $limit, $cnt) = (2000, 1e5, 0);\\n\\n%s = sieve 14 * $limit;\\n!is_prime($_) and $c{$_} = True for 1..$limit;\\nmy @untouchable = (2, 5);\\nfor ( my $n = 6; $n <= $limit; $n += 2 ) {\\n push @untouchable, $n if !$s{$n} and $c{$n-1} and $c{$n-3};\\n}\\nmap { $cnt++ if $_ <= $max } @untouchable;\\nprint \\\"Number of untouchable numbers ≤ $max : $cnt \\\\n\\\\n\\\" .\\n (sprintf \\\"@{['%6d' x $cnt]}\\\", @untouchable[0..$cnt-1]) =~ s/(.{84})/$1\\\\n/gr . \\\"\\\\n\\\";\\n\\nmy($p, $count) = (10, 0);\\nmy $fmt = \\\"%6d untouchable numbers were found ≤ %7d\\\\n\\\";\\nfor my $n (@untouchable) {\\n $count++;\\n if ($n > $p) {\\n printf $fmt, $count-1, $p;\\n printf($fmt, scalar @untouchable, $limit) and last if $limit == ($p *= 10)\\n }\\n}\\n\",\n \"language\": \"Perl\"\n },\n {\n \"code\": \"(phixonline)-->\\n <span style=\\\"color: #008080;\\\">constant</span> <span style=\\\"color: #000000;\\\">limz</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;\\\">1</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: #000000;\\\">18</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">64</span><span style=\\\"color: #0000FF;\\\">}</span> <span style=\\\"color: #000080;font-style:italic;\\\">-- found by experiment</span>\\n\\n <span style=\\\"color: #008080;\\\">procedure</span> <span style=\\\"color: #000000;\\\">untouchable</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #004080;\\\">integer</span> <span style=\\\"color: #000000;\\\">n</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">cols</span><span style=\\\"color: #0000FF;\\\">=</span><span style=\\\"color: #000000;\\\">0</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">tens</span><span style=\\\"color: #0000FF;\\\">=</span><span style=\\\"color: #000000;\\\">0</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> <span style=\\\"color: #000000;\\\">t1</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">t0</span><span style=\\\"color: #0000FF;\\\">+</span><span style=\\\"color: #000000;\\\">1</span>\\n <span style=\\\"color: #004080;\\\">bool</span> <span style=\\\"color: #000000;\\\">tell</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">n</span><span style=\\\"color: #0000FF;\\\">></span><span style=\\\"color: #000000;\\\">0</span>\\n <span style=\\\"color: #000000;\\\">n</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">abs</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">n</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #004080;\\\">sequence</span> <span style=\\\"color: #000000;\\\">sums</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;\\\">3</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: #004080;\\\">integer</span> <span style=\\\"color: #000000;\\\">p</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">get_prime</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;\\\">p</span><span style=\\\"color: #0000FF;\\\">></span><span style=\\\"color: #000000;\\\">n</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;\\\">sums</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">p</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;\\\">sums</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">p</span><span style=\\\"color: #0000FF;\\\">+</span><span style=\\\"color: #000000;\\\">3</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;\\\">for</span>\\n <span style=\\\"color: #000000;\\\">sums</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;\\\">0</span>\\n\\n <span style=\\\"color: #004080;\\\">integer</span> <span style=\\\"color: #000000;\\\">m</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">floor</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #7060A8;\\\">log10</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;\\\">lim</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">limz</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">m</span><span style=\\\"color: #0000FF;\\\">]*</span><span style=\\\"color: #000000;\\\">n</span>\\n <span style=\\\"color: #008080;\\\">for</span> <span style=\\\"color: #000000;\\\">j</span><span style=\\\"color: #0000FF;\\\">=</span><span style=\\\"color: #000000;\\\">2</span> <span style=\\\"color: #008080;\\\">to</span> <span style=\\\"color: #000000;\\\">lim</span> <span style=\\\"color: #008080;\\\">do</span>\\n <span style=\\\"color: #004080;\\\">integer</span> <span style=\\\"color: #000000;\\\">y</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">sum</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #7060A8;\\\">factors</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">j</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;\\\">y</span><span style=\\\"color: #0000FF;\\\"><=</span><span style=\\\"color: #000000;\\\">n</span> <span style=\\\"color: #008080;\\\">then</span>\\n <span style=\\\"color: #000000;\\\">sums</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">y</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: #008080;\\\">if</span> <span style=\\\"color: #7060A8;\\\">platform</span><span style=\\\"color: #0000FF;\\\">()!=</span><span style=\\\"color: #004600;\\\">JS</span> <span style=\\\"color: #008080;\\\">and</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;\\\">progress</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #008000;\\\">\\\"j:%,d/%,d (%3.2f%%)\\\\r\\\"</span><span style=\\\"color: #0000FF;\\\">,{</span><span style=\\\"color: #000000;\\\">j</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">lim</span><span style=\\\"color: #0000FF;\\\">,(</span><span style=\\\"color: #000000;\\\">j</span><span style=\\\"color: #0000FF;\\\">/</span><span style=\\\"color: #000000;\\\">lim</span><span style=\\\"color: #0000FF;\\\">)*</span><span style=\\\"color: #000000;\\\">100</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;\\\">for</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> <span style=\\\"color: #7060A8;\\\">progress</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #008000;\\\">\\\"\\\"</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;\\\">tell</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 list of all untouchable numbers <= %d:\\\\n\\\"</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: #004080;\\\">string</span> <span style=\\\"color: #000000;\\\">line</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #008000;\\\">\\\" 2 5\\\"</span>\\n <span style=\\\"color: #004080;\\\">integer</span> <span style=\\\"color: #000000;\\\">cnt</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">2</span>\\n <span style=\\\"color: #008080;\\\">for</span> <span style=\\\"color: #000000;\\\">t</span><span style=\\\"color: #0000FF;\\\">=</span><span style=\\\"color: #000000;\\\">6</span> <span style=\\\"color: #008080;\\\">to</span> <span style=\\\"color: #000000;\\\">n</span> <span style=\\\"color: #008080;\\\">by</span> <span style=\\\"color: #000000;\\\">2</span> <span style=\\\"color: #008080;\\\">do</span>\\n <span style=\\\"color: #008080;\\\">if</span> <span style=\\\"color: #000000;\\\">sums</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">t</span><span style=\\\"color: #0000FF;\\\">]=</span><span style=\\\"color: #000000;\\\">0</span> <span style=\\\"color: #008080;\\\">then</span>\\n <span style=\\\"color: #000000;\\\">cnt</span> <span style=\\\"color: #0000FF;\\\">+=</span> <span style=\\\"color: #000000;\\\">1</span>\\n <span style=\\\"color: #008080;\\\">if</span> <span style=\\\"color: #000000;\\\">tell</span> <span style=\\\"color: #008080;\\\">then</span>\\n <span style=\\\"color: #000000;\\\">line</span> <span style=\\\"color: #0000FF;\\\">&=</span> <span style=\\\"color: #7060A8;\\\">sprintf</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #008000;\\\">\\\"%,8d\\\"</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">t</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #008080;\\\">if</span> <span style=\\\"color: #7060A8;\\\">remainder</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">cnt</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">cols</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;\\\">\\\"%s\\\\n\\\"</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">line</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #000000;\\\">line</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #008000;\\\">\\\"\\\"</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;\\\">end</span> <span style=\\\"color: #008080;\\\">for</span>\\n <span style=\\\"color: #008080;\\\">if</span> <span style=\\\"color: #000000;\\\">tell</span> <span style=\\\"color: #008080;\\\">then</span>\\n <span style=\\\"color: #008080;\\\">if</span> <span style=\\\"color: #000000;\\\">line</span><span style=\\\"color: #0000FF;\\\">!=</span><span style=\\\"color: #008000;\\\">\\\"\\\"</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;\\\">\\\"%s\\\\n\\\"</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">line</span><span style=\\\"color: #0000FF;\\\">)</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;\\\">if</span>\\n <span style=\\\"color: #004080;\\\">string</span> <span style=\\\"color: #000000;\\\">t</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><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #008000;\\\">\\\" (%s)\\\"</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;\\\">\\\"%,20d untouchable numbers were found <= %,d%s\\\\n\\\"</span><span style=\\\"color: #0000FF;\\\">,{</span><span style=\\\"color: #000000;\\\">cnt</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">n</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">t</span><span style=\\\"color: #0000FF;\\\">})</span>\\n <span style=\\\"color: #008080;\\\">for</span> <span style=\\\"color: #000000;\\\">p</span><span style=\\\"color: #0000FF;\\\">=</span><span style=\\\"color: #000000;\\\">1</span> <span style=\\\"color: #008080;\\\">to</span> <span style=\\\"color: #000000;\\\">tens</span> <span style=\\\"color: #008080;\\\">do</span>\\n <span style=\\\"color: #000000;\\\">untouchable</span><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: #000000;\\\">p</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: #000000;\\\">untouchable</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">2000</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">10</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">6</span><span style=\\\"color: #0000FF;\\\">-(</span><span style=\\\"color: #7060A8;\\\">platform</span><span style=\\\"color: #0000FF;\\\">()==</span><span style=\\\"color: #004600;\\\">JS</span><span style=\\\"color: #0000FF;\\\">))</span>\\n<!--\\n\",\n \"language\": \"Phix\"\n },\n {\n \"code\": \"# 20210220 Raku programming solution\\n\\nsub propdiv (\\\\x) {\\n my @l = 1 if x > 1;\\n (2 .. x.sqrt.floor).map: -> \\\\d {\\n unless x % d { @l.push: d; my \\\\y = x div d; @l.push: y if y != d }\\n }\\n @l\\n}\\n\\nsub sieve (\\\\n) {\\n my %s;\\n for (0..(n+1)) -> \\\\k {\\n given ( [+] propdiv k ) { %s{$_} = True if $_ ≤ (n+1) }\\n }\\n %s;\\n}\\n\\nmy \\\\limit = 1e5;\\nmy %c = ( grep { !.is-prime }, 1..limit ).Set; # store composites\\nmy %s = sieve(14 * limit);\\nmy @untouchable = 2, 5;\\n\\nloop ( my \\\\n = $ = 6 ; n ≤ limit ; n += 2 ) {\\n @untouchable.append(n) if (!%s{n} && %c{n-1} && %c{n-3})\\n}\\n\\nmy ($c, $last) = 0, False;\\nfor @untouchable.rotor(10) {\\n say [~] @_».&{$c++ ; $_ > 2000 ?? ( $last = True and last ) !! .fmt: \\\"%6d \\\"}\\n $c-- and last if $last\\n}\\n\\nsay \\\"\\\\nList of untouchable numbers ≤ 2,000 : $c \\\\n\\\";\\n\\nmy ($p, $count) = 10,0;\\nBREAK: for @untouchable -> \\\\n {\\n $count++;\\n if (n > $p) {\\n printf \\\"%6d untouchable numbers were found ≤ %7d\\\\n\\\", $count-1, $p;\\n last BREAK if limit == ($p *= 10)\\n }\\n}\\nprintf \\\"%6d untouchable numbers were found ≤ %7d\\\\n\\\", +@untouchable, limit\\n\",\n \"language\": \"Raku\"\n },\n {\n \"code\": \"/*REXX pgm finds N untouchable numbers (numbers that can't be equal to any aliquot sum).*/\\nparse arg n cols tens over . /*obtain optional arguments from the CL*/\\nif n='' | n==\\\",\\\" then n=2000 /*Not specified? Then use the default.*/\\nif cols='' | cols==\\\",\\\" | cols==0 then cols= 10 /* \\\" \\\" \\\" \\\" \\\" \\\" */\\nif tens='' | tens==\\\",\\\" then tens= 0 /* \\\" \\\" \\\" \\\" \\\" \\\" */\\nif over='' | over==\\\",\\\" then over= 20 /* \\\" \\\" \\\" \\\" \\\" \\\" */\\ntell= n>0; n= abs(n) /*N>0? Then display the untouchable #s*/\\ncall genP n * over /*call routine to generate some primes.*/\\nu.= 0 /*define all possible aliquot sums ≡ 0.*/\\n do p=1 for #; _= @.p + 1; u._= 1 /*any prime+1 is not an untouchable.*/\\n _= @.p + 3; u._= 1 /* \\\" prime+3 \\\" \\\" \\\" \\\" */\\n end /*p*/ /* [↑] this will also rule out 5. */\\nu.5= 0 /*special case as prime 2 + 3 sum to 5.*/\\n do j=2 for lim; if !.j then iterate /*Is J a prime? Yes, then skip it. */\\n y= sigmaP() /*compute: aliquot sum (sigma P) of J.*/\\n if y<=n then u.y= 1 /*mark Y as a touchable if in range. */\\n end /*j*/\\ncall show /*maybe show untouchable #s and a count*/\\nif tens>0 then call powers /*Any \\\"tens\\\" specified? Calculate 'em.*/\\nexit cnt /*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 ?\\ngenSq: do _=1 until _*_>lim; q._= _*_; end; q._= _*_; _= _+1; q._= _*_; return\\ngrid: $= $ right( commas(t), w); if cnt//cols==0 then do; say $; $=; end; return\\npowers: do pr=1 for tens; call 'UNTOUCHA' -(10**pr); end /*recurse*/; return\\n/*──────────────────────────────────────────────────────────────────────────────────────*/\\ngenP: #= 9; @.1=2; @.2=3; @.3=5; @.4=7; @.5=11; @.6=13; @.7=17; @.8=19; @.9=23 /*a list*/\\n !.=0; !.2=1; !.3=1; !.5=1; !.7=1; !.11=1; !.13=1; !.17=1; !.19=1 !.23=1 /*primes*/\\n parse arg lim; call genSq /*define the (high) limit for searching*/\\n qq.10= 100 /*define square of the 10th prime index*/\\n do j=@.#+6 by 2 to lim /*find odd primes from here on forward.*/\\n parse var j '' -1 _; if _==5 then iterate; if j// 3==0 then iterate\\n if j// 7==0 then iterate; if j//11==0 then iterate; if j//13==0 then iterate\\n if j//17==0 then iterate; if j//19==0 then iterate; if j//23==0 then iterate\\n /*start dividing by the tenth prime: 29*/\\n do k=10 while qq.k <= j /* [↓] divide J by known odd primes.*/\\n if j//@.k==0 then iterate j /*J ÷ by a prime? Then ¬prime. ___ */\\n end /*k*/ /* [↑] only process numbers ≤ √ J */\\n #= #+1; @.#= j /*bump prime count; assign a new prime.*/\\n !.j= 1; qq.#= j*j /*mark prime; compute square of prime.*/\\n end /*j*/; return /*#: is the number of primes generated*/\\n/*──────────────────────────────────────────────────────────────────────────────────────*/\\nshow: w=7; $= right(2, w+1) right(5, w) /*start the list of an even prime and 5*/\\n cnt= 2 /*count of the only two primes in list.*/\\n do t=6 by 2 to n; if u.t then iterate /*Is T touchable? Then skip it. */\\n cnt= cnt + 1; if tell then call grid /*bump count; maybe show a grid line. */\\n end /*t*/\\n if tell & $\\\\=='' then say $ /*display a residual grid line, if any.*/\\n if tell then say /*show a spacing blank line for output.*/\\n if n>0 then say right( commas(cnt), 20) , /*indent the output a bit.*/\\n ' untouchable numbers were found ≤ ' commas(n); return\\n/*──────────────────────────────────────────────────────────────────────────────────────*/\\nsigmaP: s= 1 /*set initial sigma sum (S) to 1. ___*/\\n if j//2 then do m=3 by 2 while q.m<j /*divide by odd integers up to the √ J */\\n if j//m==0 then s=s+m+j%m /*add the two divisors to the sum. */\\n end /*m*/ /* [↑] process an odd integer. ___*/\\n else do m=2 while q.m<j /*divide by all integers up to the √ J */\\n if j//m==0 then s=s+m+j%m /*add the two divisors to the sum. */\\n end /*m*/ /* [↑] process an even integer. ___*/\\n if q.m==j then return s + m /*Was J a square? If so, add √ J */\\n return s /* No, just return. */\\n\",\n \"language\": \"REXX\"\n },\n {\n \"code\": \"import \\\"./math\\\" for Int, Nums\\nimport \\\"./fmt\\\" for Fmt\\n\\nvar sieve = Fn.new { |n|\\n n = n + 1\\n var s = List.filled(n+1, false)\\n for (i in 0..n) {\\n var sum = Nums.sum(Int.properDivisors(i))\\n if (sum <= n) s[sum] = true\\n }\\n return s\\n}\\n\\nvar limit = 1e5\\nvar c = Int.primeSieve(limit, false)\\nvar s = sieve.call(14 * limit)\\nvar untouchable = [2, 5]\\nvar n = 6\\nwhile (n <= limit) {\\n if (!s[n] && c[n-1] && c[n-3]) untouchable.add(n)\\n n = n + 2\\n}\\n\\nSystem.print(\\\"List of untouchable numbers <= 2,000:\\\")\\nFmt.tprint(\\\"$,6d\\\", untouchable.where { |n| n <= 2000 }, 10)\\nSystem.print()\\nFmt.print(\\\"$,6d untouchable numbers were found <= 2,000\\\", untouchable.count { |n| n <= 2000 })\\nvar p = 10\\nvar count = 0\\nfor (n in untouchable) {\\n count = count + 1\\n if (n > p) {\\n Fmt.print(\\\"$,6d untouchable numbers were found <= $,7d\\\", count-1, p)\\n p = p * 10\\n if (p == limit) break\\n }\\n}\\nFmt.print(\\\"$,6d untouchable numbers were found <= $,d\\\", untouchable.count, limit)\\n\",\n \"language\": \"Wren\"\n },\n {\n \"code\": \"import \\\"./math\\\" for Int, Nums\\nimport \\\"./fmt\\\" for Fmt\\n\\nvar limit = 1e6\\nvar m = 63\\nvar c = Int.primeSieve(limit, false)\\nvar n = m * limit + 1\\nvar sumDivs = List.filled(n, 0)\\nfor (i in 1...n) {\\n var j = i\\n while (j < n) {\\n sumDivs[j] = sumDivs[j] + i\\n j = j + i\\n }\\n}\\nvar s = List.filled(n, false)\\nfor (i in 1...n) {\\n var sum = sumDivs[i] - i // proper divs sum\\n if (sum <= n) s[sum] = true\\n}\\nvar untouchable = [2, 5]\\nn = 6\\nwhile (n <= limit) {\\n if (!s[n] && c[n-1] && c[n-3]) untouchable.add(n)\\n n = n + 2\\n}\\nSystem.print(\\\"List of untouchable numbers <= 2,000:\\\")\\nFmt.tprint(\\\"$,6d\\\", untouchable.where { |n| n <= 2000 }, 10)\\nSystem.print()\\nFmt.print(\\\"$,7d untouchable numbers were found <= 2,000\\\", untouchable.count { |n| n <= 2000 })\\nvar p = 10\\nvar count = 0\\nfor (n in untouchable) {\\n count = count + 1\\n if (n > p) {\\n Fmt.print(\\\"$,7d untouchable numbers were found <= $,9d\\\", count-1, p)\\n p = p * 10\\n if (p == limit) break\\n }\\n}\\nFmt.print(\\\"$,7d untouchable numbers were found <= $,d\\\", untouchable.count, limit)\\n\",\n \"language\": \"Wren\"\n }\n]","isConversational":false},"task_name":{"kind":"string","value":"Untouchable-numbers"}}},{"rowIdx":1787,"cells":{"solutions":{"kind":"list like","value":[{"code":"---\nfrom: http://rosettacode.org/wiki/Update_a_configuration_file\nnote: File handling\n","language":"00-META"},{"code":"We have a configuration file as follows:\n\n # This is a configuration file in standard configuration file format\n #\n # Lines begininning with a hash or a semicolon are ignored by the application\n # program. Blank lines are also ignored by the application program.\n \n # The first word on each non comment line is the configuration option.\n # Remaining words or numbers on the line are configuration parameter\n # data fields.\n \n # Note that configuration option names are not case sensitive. However,\n # configuration parameter data is case sensitive and the lettercase must\n # be preserved.\n \n # This is a favourite fruit\n FAVOURITEFRUIT banana\n \n # This is a boolean that should be set\n NEEDSPEELING\n \n # This boolean is commented out\n ; SEEDSREMOVED\n \n # How many bananas we have\n NUMBEROFBANANAS 48\n\nThe task is to manipulate the configuration file as follows:\n\n* Disable the needspeeling option (using a semicolon prefix)\n* Enable the seedsremoved option by removing the semicolon and any leading whitespace\n* Change the numberofbananas parameter to 1024\n* Enable (or create if it does not exist in the file) a parameter for numberofstrawberries with a value of 62000\n\n<br>\nNote that configuration option names are not case sensitive. This means that changes should be effected, regardless of the case.\n\nOptions should always be disabled by prefixing them with a semicolon.\n\nLines beginning with hash symbols should not be manipulated and left unchanged in the revised file.\n\nIf a configuration option does not exist within the file (in either enabled or disabled form), it should be added during this update. Duplicate configuration option names in the file should be removed, leaving just the first entry.\n\nFor the purpose of this task, the revised file should contain appropriate entries, whether enabled or not for needspeeling,seedsremoved,numberofbananas and numberofstrawberries.)\n\nThe update should rewrite configuration option names in capital letters. However lines beginning with hashes and any parameter data must not be altered (eg the banana for favourite fruit must not become capitalized). The update process should also replace double semicolon prefixes with just a single semicolon (unless it is uncommenting the option, in which case it should remove all leading semicolons). \n\nAny lines beginning with a semicolon or groups of semicolons, but no following option should be removed, as should any leading or trailing whitespace on the lines. Whitespace between the option and parameters should consist only of a single\nspace, and any non-ASCII extended characters, tabs characters, or control codes\n(other than end of line markers), should also be removed.\n\n\n;Related tasks\n* [[Read a configuration file]]\n<br><br>\n\n","language":"00-TASK"},{"code":"T.enum EntryType\n EMPTY\n ENABLED\n DISABLED\n COMMENT\n IGNORE\n\nT Entry\n EntryType etype\n String name\n String value\n\n F (etype, name = ‘’, value = ‘’)\n .etype = etype\n .name = name\n .value = value\n\nT Config\n String path\n [Entry] entries\n\n F (path)\n .path = path\n L(=line) File(path).read_lines()\n line = line.ltrim(‘ ’)\n I line.empty\n .entries.append(Entry(EntryType.EMPTY))\n E I line[0] == ‘#’\n .entries.append(Entry(EntryType.COMMENT, line))\n E\n line = line.replace(re:‘[^a-zA-Z0-9\\x20;]’, ‘’)\n V m = re:‘^(;*)\\s*([a-zA-Z0-9]+)\\s*([a-zA-Z0-9]*)’.search(line)\n I m & !m.group(2).empty\n V t = I m.group(1).empty {EntryType.ENABLED} E EntryType.DISABLED\n .addOption(m.group(2), m.group(3), t)\n\n F enableOption(name)\n Int? i = .getOptionIndex(name)\n I i != N\n .entries[i].etype = EntryType.ENABLED\n\n F disableOption(name)\n Int? i = .getOptionIndex(name)\n I i != N\n .entries[i].etype = EntryType.DISABLED\n\n F setOption(name, value)\n Int? i = .getOptionIndex(name)\n I i != N\n .entries[i].value = value\n\n F addOption(name, val, t = EntryType.ENABLED)\n .entries.append(Entry(t, name.uppercase(), val))\n\n F removeOption(name)\n Int? i = .getOptionIndex(name)\n I i != N\n .entries[i].etype = EntryType.IGNORE\n\n F getOptionIndex(name) -> Int?\n L(e) .entries\n I e.etype !C (EntryType.ENABLED, EntryType.DISABLED)\n L.continue\n I e.name == name.uppercase()\n R L.index\n R N\n\n F store()\n V f = File(.path, WRITE)\n L(e) .entries\n I e.etype == EMPTY\n f.write(\"\\n\")\n E I e.etype == ENABLED\n f.write(\"#. #.\\n\".format(e.name, e.value))\n E I e.etype == DISABLED\n f.write(\"; #. #.\\n\".format(e.name, e.value))\n E I e.etype == COMMENT\n f.write(e.name\"\\n\")\n\nV cfg = Config(‘config.txt’)\ncfg.enableOption(‘seedsremoved’)\ncfg.disableOption(‘needspeeling’)\ncfg.setOption(‘numberofbananas’, ‘1024’)\ncfg.addOption(‘numberofstrawberries’, ‘62000’)\ncfg.store()\n","language":"11l"},{"code":"; Author: AlephX, Aug 17 2011\ndata = %A_scriptdir%\\rosettaconfig.txt\noutdata = %A_scriptdir%\\rosettaconfig.tmp\nFileDelete, %outdata%\n\nNUMBEROFBANANAS := 1024\nnumberofstrawberries := 560\nNEEDSPEELING = \"0\"\nFAVOURITEFRUIT := \"bananas\"\nSEEDSREMOVED = \"1\"\nBOOL0 = \"0\"\nBOOL1 = \"1\"\nNUMBER1 := 1\nnumber0 := 0\nSTRINGA := \"string here\"\n\nparameters = bool0|bool1|NUMBER1|number0|stringa|NEEDSPEELING|seedsremoved|numberofbananas|numberofstrawberries\n\nLoop, Read, %data%, %outdata%\n\t{\n\tif (instr(A_LoopReadLine, \"#\") == 1 OR A_LoopReadLine == \"\")\n\t\t{\n\t\tLine := A_LoopReadLine\n\t\t}\n\telse\n\t\t{\n\t\tif instr(A_LoopReadLine, \";\") == 1\n\t\t\t{\n\t\t\tparameter := RegExReplace(Substr(A_LoopReadLine,2), \"^[ \\s]+|[ \\s]+$\", \"\")\n\n\t\t\tparametervalue = %parameter%\n\t\t\tvalue := %parametervalue%\n\t\t\tif value == 0\n\t\t\t\tLine := A_loopReadLine\n\t\t\telse\n\t\t\t\tLine := Parameter\n\t\t\t}\n\t\telse\n\t\t\t{\n\t\t\tparameter := RegExReplace(A_LoopReadLine, \"^[ \\s]+|[ \\s]+$\", \"\")\n\t\t\tif instr(parameter, A_Space)\n\t\t\t\tparameter := substr(parameter, 1, instr(parameter, A_Space)-1)\n\t\t\t\n\t\t\tif instr(parameters, parameter) > 0\n\t\t\t\t{\n\t\t\t\tparametervalue = %parameter%\n\t\t\t\tvalue := %parametervalue%\n\t\t\t\t\n\t\t\t\tif (value = chr(34) . \"0\" . chr(34))\n\t\t\t\t\tLine := \"; \" . Parameter\n\t\t\t\telse\t\n\t\t\t\t\t{\n\t\t\t\t\tif (value = chr(34) . \"1\" . chr(34))\n\t\t\t\t\t\tLine := Parameter\n\t\t\t\t\telse\n\t\t\t\t\t\tLine = %parametervalue% %value%\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\telse\n\t\t\t\tLine := A_LoopReadLine\n\t\t\t}\n\t\t\t\n\t\t}\n\tStringReplace, parameters, parameters, %parametervalue%,,\n\tStringReplace, parameters, parameters,||,|\n\t\n\tFileAppend, %Line%`n\n\t}\n\nLoop, parse, parameters,|\n\t{\n\tif (A_Loopfield <> \"\")\n\t\t{\n\t\tStringUpper, parameter, A_LoopField\n\t\tparametervalue = %parameter%\n\t\tvalue := %parametervalue%\n\t\t\t\t\n\t\tif (value = chr(34) . \"0\" . chr(34))\n\t\t\tLine := \"; \" . parameter\n\t\telse\t\n\t\t\t{\n\t\t\tif (value = chr(34) . \"1\" . chr(34))\n\t\t\t\tLine := parameter\n\t\t\telse\n\t\t\t\tLine = %parametervalue% %value%\n\t\t\t}\n\t\t\t\t\n\t\tFileAppend, %Line%`n, %outdata%\t\t\n\t\t}\n\t}\n\nFileCopy, %A_scriptdir%\\rosettaconfig.tmp, %A_scriptdir%\\rosettaconfig.txt, 1\n","language":"AutoHotkey"},{"code":"' ' ' ' ' ' ' ' ' ' ' ' ' ' ' ' ' ' ' ' ' ' ' ' ' ' '\n' Read a Configuration File V1.0 '\n' '\n' Developed by A. David Garza Marín in VB-DOS for '\n' RosettaCode. December 2, 2016. '\n' ' ' ' ' ' ' ' ' ' ' ' ' ' ' ' ' ' ' ' ' ' ' ' ' ' '\n\n' OPTION EXPLICIT ' For VB-DOS, PDS 7.1\n' OPTION _EXPLICIT ' For QB64\n\n' SUBs and FUNCTIONs\nDECLARE SUB AppendCommentToConfFile (WhichFile AS STRING, WhichComment AS STRING, LeaveALine AS INTEGER)\nDECLARE SUB setNValToVarArr (WhichVariable AS STRING, WhichIndex AS INTEGER, WhatValue AS DOUBLE)\nDECLARE SUB setSValToVar (WhichVariable AS STRING, WhatValue AS STRING)\nDECLARE SUB setSValToVarArr (WhichVariable AS STRING, WhichIndex AS INTEGER, WhatValue AS STRING)\nDECLARE SUB doModifyArrValueFromConfFile (WhichFile AS STRING, WhichVariable AS STRING, WhichIndex AS INTEGER, WhatValue AS STRING, Separator AS STRING, ToComment AS INTEGER)\nDECLARE SUB doModifyValueFromConfFile (WhichFile AS STRING, WhichVariable AS STRING, WhatValue AS STRING, Separator AS STRING, ToComment AS INTEGER)\nDECLARE FUNCTION CreateConfFile% (WhichFile AS STRING)\nDECLARE FUNCTION ErrorMessage$ (WhichError AS INTEGER)\nDECLARE FUNCTION FileExists% (WhichFile AS STRING)\nDECLARE FUNCTION FindVarPos% (WhichVariable AS STRING)\nDECLARE FUNCTION FindVarPosArr% (WhichVariable AS STRING, WhichIndex AS INTEGER)\nDECLARE FUNCTION getArrayVariable$ (WhichVariable AS STRING, WhichIndex AS INTEGER)\nDECLARE FUNCTION getVariable$ (WhichVariable AS STRING)\nDECLARE FUNCTION getVarType% (WhatValue AS STRING)\nDECLARE FUNCTION GetDummyFile$ (WhichFile AS STRING)\nDECLARE FUNCTION HowManyElementsInTheArray% (WhichVariable AS STRING)\nDECLARE FUNCTION IsItAnArray% (WhichVariable AS STRING)\nDECLARE FUNCTION IsItTheVariableImLookingFor% (TextToAnalyze AS STRING, WhichVariable AS STRING)\nDECLARE FUNCTION NewValueForTheVariable$ (WhichVariable AS STRING, WhichIndex AS INTEGER, WhatValue AS STRING, Separator AS STRING)\nDECLARE FUNCTION ReadConfFile% (NameOfConfFile AS STRING)\nDECLARE FUNCTION YorN$ ()\n\n' Register for values located\nTYPE regVarValue\n VarName AS STRING * 20\n VarType AS INTEGER ' 1=String, 2=Integer, 3=Real, 4=Comment\n VarValue AS STRING * 30\nEND TYPE\n\n' Var\nDIM rVarValue() AS regVarValue, iErr AS INTEGER, i AS INTEGER, iHMV AS INTEGER\nDIM iArrayElements AS INTEGER, iWhichElement AS INTEGER, iCommentStat AS INTEGER\nDIM iAnArray AS INTEGER, iSave AS INTEGER\nDIM otherfamily(1 TO 2) AS STRING\nDIM sVar AS STRING, sVal AS STRING, sComment AS STRING\nCONST ConfFileName = \"config2.fil\"\nCONST False = 0, True = NOT False\n\n' ------------------- Main Program ------------------------\nDO\n CLS\n ERASE rVarValue\n PRINT \"This program reads a configuration file and shows the result.\"\n PRINT\n PRINT \"Default file name: \"; ConfFileName\n PRINT\n iErr = ReadConfFile(ConfFileName)\n IF iErr = 0 THEN\n iHMV = UBOUND(rVarValue)\n PRINT \"Variables found in file:\"\n FOR i = 1 TO iHMV\n PRINT RTRIM$(rVarValue(i).VarName); \" = \"; RTRIM$(rVarValue(i).VarValue); \" (\";\n SELECT CASE rVarValue(i).VarType\n CASE 0: PRINT \"Undefined\";\n CASE 1: PRINT \"String\";\n CASE 2: PRINT \"Integer\";\n CASE 3: PRINT \"Real\";\n CASE 4: PRINT \"Is a commented variable\";\n END SELECT\n PRINT \")\"\n NEXT i\n PRINT\n\n INPUT \"Type the variable name to modify (Blank=End)\"; sVar\n sVar = RTRIM$(LTRIM$(sVar))\n IF LEN(sVar) > 0 THEN\n i = FindVarPos%(sVar)\n IF i > 0 THEN ' Variable found\n iAnArray = IsItAnArray%(sVar)\n IF iAnArray THEN\n iArrayElements = HowManyElementsInTheArray%(sVar)\n PRINT \"This is an array of\"; iArrayElements; \" elements.\"\n INPUT \"Which one do you want to modify (Default=1)\"; iWhichElement\n IF iWhichElement = 0 THEN iWhichElement = 1\n ELSE\n iArrayElements = 1\n iWhichElement = 1\n END IF\n PRINT \"The current value of the variable is: \"\n IF iAnArray THEN\n PRINT sVar; \"(\"; iWhichElement; \") = \"; RTRIM$(rVarValue(i + (iWhichElement - 1)).VarValue)\n ELSE\n PRINT sVar; \" = \"; RTRIM$(rVarValue(i + (iWhichElement - 1)).VarValue)\n END IF\n ELSE\n PRINT \"The variable was not found. It will be added.\"\n END IF\n PRINT\n INPUT \"Please, set the new value for the variable (Blank=Unmodified)\"; sVal\n sVal = RTRIM$(LTRIM$(sVal))\n IF i > 0 THEN\n IF rVarValue(i + (iWhichElement - 1)).VarType = 4 THEN\n PRINT \"Do you want to remove the comment status to the variable? (Y/N)\"\n iCommentStat = NOT (YorN = \"Y\")\n iCommentStat = ABS(iCommentStat) ' Gets 0 (Toggle) or 1 (Leave unmodified)\n iSave = (iCommentStat = 0)\n ELSE\n PRINT \"Do you want to toggle the variable as a comment? (Y/N)\"\n iCommentStat = (YorN = \"Y\") ' Gets 0 (Uncommented) or -1 (Toggle as a Comment)\n iSave = iCommentStat\n END IF\n END IF\n\n ' Now, update or add the variable to the conf file\n IF i > 0 THEN\n IF sVal = \"\" THEN\n sVal = RTRIM$(rVarValue(i).VarValue)\n END IF\n ELSE\n PRINT \"The variable will be added to the configuration file.\"\n PRINT \"Do you want to add a remark for it? (Y/N)\"\n IF YorN$ = \"Y\" THEN\n LINE INPUT \"Please, write your remark: \", sComment\n sComment = LTRIM$(RTRIM$(sComment))\n IF sComment <> \"\" THEN\n AppendCommentToConfFile ConfFileName, sComment, True\n END IF\n END IF\n END IF\n\n ' Verifies if the variable will be modified, and applies the modification\n IF sVal <> \"\" OR iSave THEN\n IF iWhichElement > 1 THEN\n setSValToVarArr sVar, iWhichElement, sVal\n doModifyArrValueFromConfFile ConfFileName, sVar, iWhichElement, sVal, \" \", iCommentStat\n ELSE\n setSValToVar sVar, sVal\n doModifyValueFromConfFile ConfFileName, sVar, sVal, \" \", iCommentStat\n END IF\n END IF\n\n END IF\n ELSE\n PRINT ErrorMessage$(iErr)\n END IF\n PRINT\n PRINT \"Do you want to add or modify another variable? (Y/N)\"\nLOOP UNTIL YorN$ = \"N\"\n' --------- End of Main Program -----------------------\nPRINT\nPRINT \"End of program.\"\nEND\n\nFileError:\n iErr = ERR\nRESUME NEXT\n\nSUB AppendCommentToConfFile (WhichFile AS STRING, WhichComment AS STRING, LeaveALine AS INTEGER)\n ' Parameters:\n ' WhichFile: Name of the file where a comment will be appended.\n ' WhichComment: A comment. It is suggested to add a comment no larger than 75 characters.\n ' This procedure adds a # at the beginning of the string if there is no #\n ' sign on it in order to ensure it will be added as a comment.\n\n ' Var\n DIM iFil AS INTEGER\n\n iFil = FileExists%(WhichFile)\n IF NOT iFil THEN\n iFil = CreateConfFile%(WhichFile) ' Here, iFil is used as dummy to save memory\n END IF\n\n IF iFil THEN ' Everything is Ok\n iFil = FREEFILE ' Now, iFil is used to be the ID of the file\n WhichComment = LTRIM$(RTRIM$(WhichComment))\n\n IF LEFT$(WhichComment, 1) <> \"#\" THEN ' Is it in comment format?\n WhichComment = \"# \" + WhichComment\n END IF\n\n ' Append the comment to the file\n OPEN WhichFile FOR APPEND AS #iFil\n IF LeaveALine THEN\n PRINT #iFil, \"\"\n END IF\n PRINT #iFil, WhichComment\n CLOSE #iFil\n END IF\n\nEND SUB\n\nFUNCTION CreateConfFile% (WhichFile AS STRING)\n ' Var\n DIM iFile AS INTEGER\n\n ON ERROR GOTO FileError\n\n iFile = FREEFILE\n OPEN WhichFile FOR OUTPUT AS #iFile\n CLOSE iFile\n\n ON ERROR GOTO 0\n\n CreateConfFile = FileExists%(WhichFile)\nEND FUNCTION\n\nSUB doModifyArrValueFromConfFile (WhichFile AS STRING, WhichVariable AS STRING, WhichIndex AS INTEGER, WhatValue AS STRING, Separator AS STRING, ToComment AS INTEGER)\n ' Parameters:\n ' WhichFile: The name of the Configuration File. It can include the full path.\n ' WhichVariable: The name of the variable to be modified or added to the conf file.\n ' WhichIndex: The index number of the element to be modified in a matrix (Default=1)\n ' WhatValue: The new value to set in the variable specified in WhichVariable.\n ' Separator: The separator between the variable name and its value in the conf file. Defaults to a space \" \".\n ' ToComment: A value to set or remove the comment mode of a variable: -1=Toggle to Comment, 0=Toggle to not comment, 1=Leave as it is.\n\n ' Var\n DIM iFile AS INTEGER, iFile2 AS INTEGER, iError AS INTEGER\n DIM iMod AS INTEGER, iIsComment AS INTEGER\n DIM sLine AS STRING, sDummyFile AS STRING, sChar AS STRING\n\n ' If conf file doesn't exists, create one.\n iError = 0\n iMod = 0\n IF NOT FileExists%(WhichFile) THEN\n iError = CreateConfFile%(WhichFile)\n END IF\n\n IF NOT iError THEN ' File exists or it was created\n Separator = RTRIM$(LTRIM$(Separator))\n IF Separator = \"\" THEN\n Separator = \" \" ' Defaults to Space\n END IF\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 ' Goes through the file to find the variable\n DO WHILE NOT EOF(iFile)\n LINE INPUT #iFile, sLine\n sLine = RTRIM$(LTRIM$(sLine))\n sChar = LEFT$(sLine, 1)\n iIsComment = (sChar = \";\")\n IF iIsComment THEN ' Variable is commented\n sLine = LTRIM$(MID$(sLine, 2))\n END IF\n\n IF sChar <> \"#\" AND LEN(sLine) > 0 THEN ' Is not a comment?\n IF IsItTheVariableImLookingFor%(sLine, WhichVariable) THEN\n sLine = NewValueForTheVariable$(WhichVariable, WhichIndex, WhatValue, Separator)\n iMod = True\n IF ToComment = True THEN\n sLine = \"; \" + sLine\n END IF\n ELSEIF iIsComment THEN\n sLine = \"; \" + sLine\n END IF\n\n END IF\n\n PRINT #iFile2, sLine\n LOOP\n\n ' Reviews if a modification was done, if not, then it will\n ' add the variable to the file.\n IF NOT iMod THEN\n sLine = NewValueForTheVariable$(WhichVariable, 1, WhatValue, Separator)\n PRINT #iFile2, sLine\n END IF\n CLOSE iFile2, iFile\n\n ' Removes the conf file and sets the dummy file as the conf file\n KILL WhichFile\n NAME sDummyFile AS WhichFile\n END IF\n\nEND SUB\n\nSUB doModifyValueFromConfFile (WhichFile AS STRING, WhichVariable AS STRING, WhatValue AS STRING, Separator AS STRING, ToComment AS INTEGER)\n ' To see details of parameters, please see doModifyArrValueFromConfFile\n doModifyArrValueFromConfFile WhichFile, WhichVariable, 1, WhatValue, Separator, ToComment\nEND SUB\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.\"\n CASE 1: sError = \"Configuration file doesn't exist.\"\n CASE 2: sError = \"There are no variables in the given file.\"\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 FindVarPos% (WhichVariable AS STRING)\n ' Will find the position of the variable\n FindVarPos% = FindVarPosArr%(WhichVariable, 1)\nEND FUNCTION\n\nFUNCTION FindVarPosArr% (WhichVariable AS STRING, WhichIndex AS INTEGER)\n ' Var\n DIM i AS INTEGER, iHMV AS INTEGER, iCount AS INTEGER, iPos AS INTEGER\n DIM sVar AS STRING, sVal AS STRING, sWV AS STRING\n SHARED rVarValue() AS regVarValue\n\n ' Looks for a variable name and returns its position\n iHMV = UBOUND(rVarValue)\n sWV = UCASE$(LTRIM$(RTRIM$(WhichVariable)))\n sVal = \"\"\n iCount = 0\n DO\n i = i + 1\n sVar = UCASE$(RTRIM$(rVarValue(i).VarName))\n IF sVar = sWV THEN\n iCount = iCount + 1\n IF iCount = WhichIndex THEN\n iPos = i\n END IF\n END IF\n LOOP UNTIL i >= iHMV OR iPos > 0\n\n FindVarPosArr% = iPos\nEND FUNCTION\n\nFUNCTION getArrayVariable$ (WhichVariable AS STRING, WhichIndex AS INTEGER)\n ' Var\n DIM i AS INTEGER\n DIM sVal AS STRING\n SHARED rVarValue() AS regVarValue\n\n i = FindVarPosArr%(WhichVariable, WhichIndex)\n sVal = \"\"\n IF i > 0 THEN\n sVal = RTRIM$(rVarValue(i).VarValue)\n END IF\n\n ' Found it or not, it will return the result.\n ' If the result is \"\" then it didn't found the requested variable.\n getArrayVariable$ = sVal\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 getVariable$ (WhichVariable AS STRING)\n ' Var\n DIM i AS INTEGER, iHMV AS INTEGER\n DIM sVal AS STRING\n\n ' For a single variable, looks in the first (and only)\n ' element of the array that contains the name requested.\n sVal = getArrayVariable$(WhichVariable, 1)\n\n getVariable$ = sVal\nEND FUNCTION\n\nFUNCTION getVarType% (WhatValue AS STRING)\n ' Var\n DIM sValue AS STRING, dValue AS DOUBLE, iType AS INTEGER\n\n sValue = RTRIM$(WhatValue)\n iType = 0\n IF LEN(sValue) > 0 THEN\n IF ASC(LEFT$(sValue, 1)) < 48 OR ASC(LEFT$(sValue, 1)) > 57 THEN\n iType = 1 ' String\n ELSE\n dValue = VAL(sValue)\n IF CLNG(dValue) = dValue THEN\n iType = 2 ' Integer\n ELSE\n iType = 3 ' Real\n END IF\n END IF\n END IF\n\n getVarType% = iType\nEND FUNCTION\n\nFUNCTION HowManyElementsInTheArray% (WhichVariable AS STRING)\n ' Var\n DIM i AS INTEGER, iHMV AS INTEGER, iCount AS INTEGER, iPos AS INTEGER, iQuit AS INTEGER\n DIM sVar AS STRING, sVal AS STRING, sWV AS STRING\n SHARED rVarValue() AS regVarValue\n\n ' Looks for a variable name and returns its value\n iHMV = UBOUND(rVarValue)\n sWV = UCASE$(LTRIM$(RTRIM$(WhichVariable)))\n sVal = \"\"\n\n ' Look for all instances of WhichVariable in the\n ' list. This is because elements of an array will not alwasy\n ' be one after another, but alternate.\n FOR i = 1 TO iHMV\n sVar = UCASE$(RTRIM$(rVarValue(i).VarName))\n IF sVar = sWV THEN\n iCount = iCount + 1\n END IF\n NEXT i\n\n HowManyElementsInTheArray = iCount\nEND FUNCTION\n\nFUNCTION IsItAnArray% (WhichVariable AS STRING)\n ' Returns if a Variable is an Array\n IsItAnArray% = (HowManyElementsInTheArray%(WhichVariable) > 1)\n\nEND FUNCTION\n\nFUNCTION IsItTheVariableImLookingFor% (TextToAnalyze AS STRING, WhichVariable AS STRING)\n ' Var\n DIM sVar AS STRING, sDT AS STRING, sDV AS STRING\n DIM iSep AS INTEGER\n\n sDT = UCASE$(RTRIM$(LTRIM$(TextToAnalyze)))\n sDV = UCASE$(RTRIM$(LTRIM$(WhichVariable)))\n iSep = INSTR(sDT, \"=\")\n IF iSep = 0 THEN iSep = INSTR(sDT, \" \")\n IF iSep > 0 THEN\n sVar = RTRIM$(LEFT$(sDT, iSep - 1))\n ELSE\n sVar = sDT\n END IF\n\n ' It will return True or False\n IsItTheVariableImLookingFor% = (sVar = sDV)\nEND FUNCTION\n\nFUNCTION NewValueForTheVariable$ (WhichVariable AS STRING, WhichIndex AS INTEGER, WhatValue AS STRING, Separator AS STRING)\n ' Var\n DIM iItem AS INTEGER, iItems AS INTEGER, iFirstItem AS INTEGER\n DIM i AS INTEGER, iCount AS INTEGER, iHMV AS INTEGER\n DIM sLine AS STRING, sVar AS STRING, sVar2 AS STRING\n SHARED rVarValue() AS regVarValue\n\n IF IsItAnArray%(WhichVariable) THEN\n iItems = HowManyElementsInTheArray(WhichVariable)\n iFirstItem = FindVarPosArr%(WhichVariable, 1)\n ELSE\n iItems = 1\n iFirstItem = FindVarPos%(WhichVariable)\n END IF\n iItem = FindVarPosArr%(WhichVariable, WhichIndex)\n sLine = \"\"\n sVar = UCASE$(WhichVariable)\n iHMV = UBOUND(rVarValue)\n\n IF iItem > 0 THEN\n i = iFirstItem\n DO\n sVar2 = UCASE$(RTRIM$(rVarValue(i).VarName))\n\n IF sVar = sVar2 THEN ' Does it found an element of the array?\n iCount = iCount + 1\n IF LEN(sLine) > 0 THEN ' Add a comma\n sLine = sLine + \", \"\n END IF\n IF i = iItem THEN\n sLine = sLine + WhatValue\n ELSE\n sLine = sLine + RTRIM$(rVarValue(i).VarValue)\n END IF\n END IF\n i = i + 1\n LOOP UNTIL i > iHMV OR iCount = iItems\n\n sLine = WhichVariable + Separator + sLine\n ELSE\n sLine = WhichVariable + Separator + WhatValue\n END IF\n\n NewValueForTheVariable$ = sLine\nEND FUNCTION\n\nFUNCTION ReadConfFile% (NameOfConfFile AS STRING)\n ' Var\n DIM iFile AS INTEGER, iType AS INTEGER, iVar AS INTEGER, iHMV AS INTEGER\n DIM iVal AS INTEGER, iCurVar AS INTEGER, i AS INTEGER, iErr AS INTEGER\n DIM dValue AS DOUBLE, iIsComment AS INTEGER\n DIM sLine AS STRING, sVar AS STRING, sValue AS STRING\n SHARED rVarValue() AS regVarValue\n\n ' This procedure reads a configuration file with variables\n ' and values separated by the equal sign (=) or a space.\n ' It needs the FileExists% function.\n ' Lines begining with # or blank will be ignored.\n IF FileExists%(NameOfConfFile) THEN\n iFile = FREEFILE\n REDIM rVarValue(1 TO 10) AS regVarValue\n OPEN NameOfConfFile FOR INPUT AS #iFile\n WHILE NOT EOF(iFile)\n LINE INPUT #iFile, sLine\n sLine = RTRIM$(LTRIM$(sLine))\n IF LEN(sLine) > 0 THEN ' Does it have any content?\n IF LEFT$(sLine, 1) <> \"#\" THEN ' Is not a comment?\n iIsComment = (LEFT$(sLine, 1) = \";\")\n IF iIsComment THEN ' It is a commented variable\n sLine = LTRIM$(MID$(sLine, 2))\n END IF\n iVar = INSTR(sLine, \"=\") ' Is there an equal sign?\n IF iVar = 0 THEN iVar = INSTR(sLine, \" \") ' if not then is there a space?\n\n GOSUB AddASpaceForAVariable\n iCurVar = iHMV\n IF iVar > 0 THEN ' Is a variable and a value\n rVarValue(iHMV).VarName = LEFT$(sLine, iVar - 1)\n ELSE ' Is just a variable name\n rVarValue(iHMV).VarName = sLine\n rVarValue(iHMV).VarValue = \"\"\n END IF\n\n IF iVar > 0 THEN ' Get the value(s)\n sLine = LTRIM$(MID$(sLine, iVar + 1))\n DO ' Look for commas\n iVal = INSTR(sLine, \",\")\n IF iVal > 0 THEN ' There is a comma\n rVarValue(iHMV).VarValue = RTRIM$(LEFT$(sLine, iVal - 1))\n GOSUB AddASpaceForAVariable\n rVarValue(iHMV).VarName = rVarValue(iHMV - 1).VarName ' Repeats the variable name\n sLine = LTRIM$(MID$(sLine, iVal + 1))\n END IF\n LOOP UNTIL iVal = 0\n rVarValue(iHMV).VarValue = sLine\n\n END IF\n\n ' Determine the variable type of each variable found in this step\n FOR i = iCurVar TO iHMV\n IF iIsComment THEN\n rVarValue(i).VarType = 4 ' Is a comment\n ELSE\n GOSUB DetermineVariableType\n END IF\n NEXT i\n\n END IF\n END IF\n WEND\n CLOSE iFile\n IF iHMV > 0 THEN\n REDIM PRESERVE rVarValue(1 TO iHMV) AS regVarValue\n iErr = 0 ' Everything ran ok.\n ELSE\n REDIM rVarValue(1 TO 1) AS regVarValue\n iErr = 2 ' No variables found in configuration file\n END IF\n ELSE\n iErr = 1 ' File doesn't exist\n END IF\n\n ReadConfFile = iErr\n\nEXIT FUNCTION\n\nAddASpaceForAVariable:\n iHMV = iHMV + 1\n\n IF UBOUND(rVarValue) < iHMV THEN ' Are there space for a new one?\n REDIM PRESERVE rVarValue(1 TO iHMV + 9) AS regVarValue\n END IF\nRETURN\n\nDetermineVariableType:\n sValue = RTRIM$(rVarValue(i).VarValue)\n IF LEN(sValue) > 0 THEN\n IF ASC(LEFT$(sValue, 1)) < 48 OR ASC(LEFT$(sValue, 1)) > 57 THEN\n rVarValue(i).VarType = 1 ' String\n ELSE\n dValue = VAL(sValue)\n IF CLNG(dValue) = dValue THEN\n rVarValue(i).VarType = 2 ' Integer\n ELSE\n rVarValue(i).VarType = 3 ' Real\n END IF\n END IF\n END IF\nRETURN\n\nEND FUNCTION\n\nSUB setNValToVar (WhichVariable AS STRING, WhatValue AS DOUBLE)\n ' Sets a numeric value to a variable\n setNValToVarArr WhichVariable, 1, WhatValue\nEND SUB\n\nSUB setNValToVarArr (WhichVariable AS STRING, WhichIndex AS INTEGER, WhatValue AS DOUBLE)\n ' Sets a numeric value to a variable array\n ' Var\n DIM sVal AS STRING\n sVal = FORMAT$(WhatValue)\n setSValToVarArr WhichVariable, WhichIndex, sVal\nEND SUB\n\nSUB setSValToVar (WhichVariable AS STRING, WhatValue AS STRING)\n ' Sets a string value to a variable\n setSValToVarArr WhichVariable, 1, WhatValue\nEND SUB\n\nSUB setSValToVarArr (WhichVariable AS STRING, WhichIndex AS INTEGER, WhatValue AS STRING)\n ' Sets a string value to a variable array\n ' Var\n DIM i AS INTEGER\n DIM sVar AS STRING\n SHARED rVarValue() AS regVarValue\n\n i = FindVarPosArr%(WhichVariable, WhichIndex)\n IF i = 0 THEN ' Should add the variable\n IF UBOUND(rVarValue) > 0 THEN\n sVar = RTRIM$(rVarValue(1).VarName)\n IF sVar <> \"\" THEN\n i = UBOUND(rVarValue) + 1\n REDIM PRESERVE rVarValue(1 TO i) AS regVarValue\n ELSE\n i = 1\n END IF\n ELSE\n REDIM rVarValue(1 TO i) AS regVarValue\n END IF\n rVarValue(i).VarName = WhichVariable\n END IF\n\n ' Sets the new value to the variable\n rVarValue(i).VarValue = WhatValue\n rVarValue(i).VarType = getVarType%(WhatValue)\nEND SUB\n\nFUNCTION YorN$ ()\n ' Var\n DIM sYorN AS STRING\n\n DO\n sYorN = UCASE$(INPUT$(1))\n IF INSTR(\"YN\", sYorN) = 0 THEN\n BEEP\n END IF\n LOOP UNTIL sYorN = \"Y\" OR sYorN = \"N\"\n\n YorN$ = sYorN\nEND FUNCTION\n","language":"BASIC"},{"code":"#include <stdio.h>\n#include <stdlib.h>\n#include <string.h>\n\n#define strcomp(X, Y) strcasecmp(X, Y)\n\nstruct option\n{ const char *name, *value;\n int flag; };\n\n/* TODO: dynamically obtain these */\nstruct option updlist[] =\n{ { \"NEEDSPEELING\", NULL },\n { \"SEEDSREMOVED\", \"\" },\n { \"NUMBEROFBANANAS\", \"1024\" },\n { \"NUMBEROFSTRAWBERRIES\", \"62000\" },\n { NULL, NULL } };\n\nint output_opt(FILE *to, struct option *opt)\n{ if (opt->value == NULL)\n return fprintf(to, \"; %s\\n\", opt->name);\n else if (opt->value[0] == 0)\n return fprintf(to, \"%s\\n\", opt->name);\n else\n return fprintf(to, \"%s %s\\n\", opt->name, opt->value); }\n\nint update(FILE *from, FILE *to, struct option *updlist)\n{ char line_buf[256], opt_name[128];\n int i;\n for (;;)\n { size_t len, space_span, span_to_hash;\n if (fgets(line_buf, sizeof line_buf, from) == NULL)\n break;\n len = strlen(line_buf);\n space_span = strspn(line_buf, \"\\t \");\n span_to_hash = strcspn(line_buf, \"#\");\n if (space_span == span_to_hash)\n goto line_out;\n if (space_span == len)\n goto line_out;\n if ((sscanf(line_buf, \"; %127s\", opt_name) == 1) ||\n (sscanf(line_buf, \"%127s\", opt_name) == 1))\n { int flag = 0;\n for (i = 0; updlist[i].name; i++)\n { if (strcomp(updlist[i].name, opt_name) == 0)\n { if (output_opt(to, &updlist[i]) < 0)\n return -1;\n updlist[i].flag = 1;\n flag = 1; } }\n if (flag == 0)\n goto line_out; }\n else\n line_out:\n if (fprintf(to, \"%s\", line_buf) < 0)\n return -1;\n continue; }\n { for (i = 0; updlist[i].name; i++)\n { if (!updlist[i].flag)\n if (output_opt(to, &updlist[i]) < 0)\n return -1; } }\n return feof(from) ? 0 : -1; }\n\nint main(void)\n{ if (update(stdin, stdout, updlist) < 0)\n { fprintf(stderr, \"failed\\n\");\n return (EXIT_FAILURE); }\n return 0; }\n","language":"C"},{"code":"import std.stdio, std.file, std.string, std.regex, std.path,\n std.typecons;\n\nfinal class Config {\n enum EntryType { empty, enabled, disabled, comment, ignore }\n\n static protected struct Entry {\n EntryType type;\n string name, value;\n }\n protected Entry[] entries;\n protected string path;\n\n this(in string path) {\n if (!isValidPath(path) || (exists(path) && !isFile(path)))\n throw new Exception(\"Invalid filename\");\n\n this.path = path;\n if (!exists(path))\n return;\n\n auto r = regex(r\"^(;*)\\s*([A-Z0-9]+)\\s*([A-Z0-9]*)\", \"i\");\n auto f = File(path, \"r\");\n foreach (const buf; f.byLine()) {\n auto line = buf.strip().idup;\n if (!line.length)\n entries ~= Entry(EntryType.empty);\n else if (line[0] == '#')\n entries ~= Entry(EntryType.comment, line);\n else {\n line = line.removechars(\"^a-zA-Z0-9\\x20;\");\n auto m = match(line, r);\n if (!m.empty && m.front[2].length) {\n EntryType t = EntryType.enabled;\n if (m.front[1].length)\n t = EntryType.disabled;\n addOption(m.front[2], m.front[3], t);\n }\n }\n }\n }\n\n void enableOption(in string name) pure {\n immutable i = getOptionIndex(name);\n if (!i.isNull)\n entries[i].type = EntryType.enabled;\n }\n\n void disableOption(in string name) pure {\n immutable i = getOptionIndex(name);\n if (!i.isNull)\n entries[i].type = EntryType.disabled;\n }\n\n void setOption(in string name, in string value) pure {\n immutable i = getOptionIndex(name);\n if (!i.isNull)\n entries[i].value = value;\n }\n\n void addOption(in string name, in string val,\n in EntryType t = EntryType.enabled) pure {\n entries ~= Entry(t, name.toUpper(), val);\n }\n\n void removeOption(in string name) pure {\n immutable i = getOptionIndex(name);\n if (!i.isNull)\n entries[i].type = EntryType.ignore;\n }\n\n Nullable!size_t getOptionIndex(in string name) const pure {\n foreach (immutable i, const ref e; entries) {\n if (e.type != EntryType.enabled &&\n e.type != EntryType.disabled)\n continue;\n if (e.name == name.toUpper())\n return typeof(return)(i);\n }\n return typeof(return).init;\n }\n\n void store() {\n auto f = File(path, \"w+\");\n foreach (immutable e; entries) {\n final switch (e.type) {\n case EntryType.empty:\n f.writeln();\n break;\n case EntryType.enabled:\n f.writefln(\"%s %s\", e.name, e.value);\n break;\n case EntryType.disabled:\n f.writefln(\"; %s %s\", e.name, e.value);\n break;\n case EntryType.comment:\n f.writeln(e.name);\n break;\n case EntryType.ignore:\n continue;\n }\n }\n }\n}\n\nvoid main() {\n auto cfg = new Config(\"config.txt\");\n cfg.enableOption(\"seedsremoved\");\n cfg.disableOption(\"needspeeling\");\n cfg.setOption(\"numberofbananas\", \"1024\");\n cfg.addOption(\"numberofstrawberries\", \"62000\");\n cfg.store();\n}\n","language":"D"},{"code":"program uConfigFile;\n\n{$APPTYPE CONSOLE}\n\nuses\n System.SysUtils,\n uSettings;\n\nconst\n FileName = 'uConf.txt';\n\nvar\n Settings: TSettings;\n\nprocedure show(key: string; value: string);\nbegin\n writeln(format('%14s = %s', [key, value]));\nend;\n\nbegin\n Settings := TSettings.Create;\n Settings.LoadFromFile(FileName);\n Settings['NEEDSPEELING'] := False;\n Settings['SEEDSREMOVED'] := True;\n Settings['NUMBEROFBANANAS'] := 1024;\n Settings['numberofstrawberries'] := 62000;\n\n for var k in Settings.Keys do\n show(k, Settings[k]);\n Settings.SaveToFile(FileName);\n Settings.Free;\n Readln;\nend.\n","language":"Delphi"},{"code":"-module( update_configuration_file ).\n\n-export( [add/3, change/3, disable/2, enable/2, read/1, task/0, write/2] ).\n\nadd( Option, Value, Lines ) ->\n\tUpper = string:to_upper( Option ),\n\t[string:join( [Upper, Value], \" \" ) | Lines].\n\nchange( Option, Value, Lines ) ->\n\tUpper = string:to_upper( Option ),\n\tchange_done( Option, Value, Lines, [change_option(Upper, Value, X) || X <- Lines] ).\n\ndisable( Option, Lines ) ->\n\tUpper = string:to_upper( Option ),\n\t[disable_option(Upper, X) || X <- Lines].\n\nenable( Option, Lines ) ->\n\tUpper = string:to_upper( Option ),\n\t[enable_option(Upper, X) || X <- Lines].\n\nread( Name ) ->\n\t{ok, Binary} = file:read_file( Name ),\n\tLines = [binary:bin_to_list(X) || X <- binary:split( Binary, <<\"\\n\">>, [global] )],\n\tLines_no_white = [string:strip(X) || X <- Lines],\n\tLines_no_control = [strip_control(X) || X <- Lines_no_white],\n\tLines_no_consecutive_space = [string:join(string:tokens(X, \" \"), \" \") || X <- Lines_no_control],\n\tLines_no_consecutive_semicolon = [strip_semicolon(X) || X <- Lines_no_consecutive_space],\n\tLines_no_empty = lists:filter( fun strip_empty/1, Lines_no_consecutive_semicolon ),\n\tLines_upper = [to_upper(X) || X <- Lines_no_empty],\n\tlists:reverse( lists:foldl(fun remove_duplicates/2, [], Lines_upper) ).\n\ntask() ->\n\tLines = read( \"priv/configuration_file2\" ),\n\tDisabled_lines = disable( \"needspeeling\", Lines ),\n\tEnabled_lines = enable( \"SEEDSREMOVED\", Disabled_lines ),\n\tChanged_lines1 = change( \"NUMBEROFBANANAS\", \"1024\", Enabled_lines ),\n\tChanged_lines2 = change( \"numberofstrawberries\", \"62000\", Changed_lines1 ),\n\twrite( \"configuration_file\", Changed_lines2 ),\n\t[io:fwrite( \"Wrote this line: ~s~n\", [X]) || X <- Changed_lines2].\n\nwrite( Name, Lines ) -> file:write_file( Name, binary:list_to_bin(string:join(Lines, \"\\n\")) ).\n\n\n\nchange_done( Option, Value, Lines, Lines ) -> add( Option, Value, Lines );\nchange_done( _Option, _Value, _Lines, New_lines ) -> New_lines.\n\nchange_option( Option, Value, String ) -> change_option_same( string:str(String, Option), Value, String ).\n\nchange_option_same( 1, Value, String ) ->\n\t[Option | _T] = string:tokens( String, \" \" ),\n\tstring:join( [Option, Value], \" \" );\nchange_option_same( _N, _Value, String ) -> String.\n\ndisable_option( Option, String ) -> disable_option_same( string:str(String, Option), String ).\n\ndisable_option_same( 1, String ) -> \"; \" ++ String;\ndisable_option_same( _N, String ) -> String.\n\nenable_option( Option, String ) -> enable_option_same( string:str(String, \"; \" ++ Option), String ).\n\nenable_option_same( 1, \"; \" ++ String ) -> String;\nenable_option_same( _N, String ) -> String.\n\nis_semicolon( $; ) -> true;\nis_semicolon( _C ) -> false.\n\nremove_duplicates( \"#\" ++_T=Line, Lines ) -> [Line | Lines];\nremove_duplicates( Line, Lines ) ->\n\tDuplicates = [X || X <-Lines, 1 =:= string:str(Line, X)],\n\tremove_duplicates( Duplicates, Line, Lines ).\n\nremove_duplicates( [], Line, Lines ) -> [Line | Lines];\nremove_duplicates( _Duplicates, _Line, Lines ) -> Lines.\n\nstrip_control( \"\" ) -> \"\";\nstrip_control( \";\" ++ _T=String ) -> lists:filter( fun strip_control_codes:is_not_control_code_nor_extended_character/1, String );\nstrip_control( String ) -> String.\n\nstrip_empty( \";\" ) -> false;\nstrip_empty( _String ) -> true.\n\n\nstrip_semicolon( \";\" ++ _T=String ) -> \";\" ++ lists:dropwhile( fun is_semicolon/1, String );\nstrip_semicolon( String ) -> String.\n\nto_upper( \"\" ) -> \"\";\nto_upper( \"#\" ++ _T=String ) -> String;\nto_upper( \"; \" ++ _T=String ) ->\n\t[\";\", Option | T] = string:tokens( String, \" \" ),\n\tstring:join( [\";\", string:to_upper(Option) | T], \" \" );\nto_upper( String ) ->\n\t[Option | T] = string:tokens( String, \" \" ),\n\tstring:join( [string:to_upper(Option) | T], \" \" ).\n","language":"Erlang"},{"code":" PROGRAM TEST\t!Define some data aggregates, then write and read them.\n CHARACTER*28 FAVOURITEFRUIT\n LOGICAL NEEDSPEELING\n LOGICAL SEEDSREMOVED\n INTEGER NUMBEROFBANANAS\n NAMELIST /FRUIT/ FAVOURITEFRUIT,NEEDSPEELING,SEEDSREMOVED,\n 1 NUMBEROFBANANAS\n INTEGER F\t!An I/O unit number.\n F = 10\t!This will do.\n\nCreate an example file to show its format.\n OPEN(F,FILE=\"Basket.txt\",STATUS=\"REPLACE\",ACTION=\"WRITE\",\t!First, prepare a recipient file.\n 1 DELIM=\"QUOTE\")\t!CHARACTER variables will be enquoted.\n FAVOURITEFRUIT = \"Banana\"\n NEEDSPEELING = .TRUE.\n SEEDSREMOVED = .FALSE.\n NUMBEROFBANANAS = 48\n WRITE (F,FRUIT)\t\t!Write the lot in one go.\n CLOSE (F)\t\t\t!Finished with output.\nCan now read from the file.\n OPEN(F,FILE=\"Basket.txt\",STATUS=\"OLD\",ACTION=\"READ\",\t!Get it back.\n 1 DELIM=\"QUOTE\")\n READ (F,FRUIT)\t\t\t!Read who knows what.\n WRITE (6,FRUIT)\n END\n","language":"Fortran"},{"code":" MODULE MONKEYFODDER\n INTEGER FIELD\t!An I/O unit number.\n CHARACTER*28 FAVOURITEFRUIT\n LOGICAL NEEDSPEELING\n INTEGER NUMBEROFBANANAS\n CONTAINS\n SUBROUTINE GETVALS(FNAME)\t!Reads values from some file.\n CHARACTER*(*) FNAME\t!The file name.\n LOGICAL SEEDSREMOVED\t!This variable is no longer wanted.\n NAMELIST /FRUIT/ FAVOURITEFRUIT,NEEDSPEELING,SEEDSREMOVED,\t!But still appears in this list.\n 1 NUMBEROFBANANAS\n OPEN(FIELD,FILE=FNAME,STATUS=\"OLD\",ACTION=\"READ\",\t!Hopefully, the file exists.\n 1 DELIM=\"QUOTE\")\t!Expect quoting for CHARACTER variables.\n READ (FIELD,FRUIT,ERR = 666)\t!Read who knows what.\n 666 CLOSE (FIELD)\t\t\t!Ignoring any misformats.\n END SUBROUTINE GETVALS\t!A proper routine would offer error messages.\n\n SUBROUTINE PUTVALS(FNAME)\t!Writes values to some file.\n CHARACTER*(*) FNAME\t!The file name.\n NAMELIST /FRUIT/ FAVOURITEFRUIT,NEEDSPEELING,NUMBEROFBANANAS\n OPEN(FIELD,FILE=FNAME,STATUS=\"REPLACE\",ACTION=\"WRITE\",\t!Prepare a recipient file.\n 1 DELIM=\"QUOTE\")\t!CHARACTER variables will be enquoted.\n WRITE (FIELD,FRUIT)\t!Write however much is needed.\n CLOSE (FIELD)\t\t!Finished for now.\n END SUBROUTINE PUTVALS\n END MODULE MONKEYFODDER\n\n PROGRAM TEST\t!Updates the file created by an earlier version.\n USE MONKEYFODDER\n FIELD = 10\t!This will do.\n CALL GETVALS(\"Basket.txt\")\t!Read the values, allowing for the previous version.\n CALL PUTVALS(\"Basket.txt\")\t!Save the values, as per the new version.\n END\n","language":"Fortran"},{"code":"' FB 1.05.0 Win64\n\nType ConfigData\n favouriteFruit As String\n needsPeeling As Boolean\n seedsRemoved As Boolean\n numberOfBananas As UInteger\n numberOfStrawberries As UInteger\nEnd Type\n\nSub updateConfigData(fileName As String, cData As ConfigData)\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 Sleep\n End\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 As Boolean hadFruit, hadPeeling, hadSeeds, hadBananas, hadStrawberries '' all false by default\n Dim As String ln\n While Not Eof(fileNum)\n Line Input #fileNum, ln\n If ln = \"\" OrElse Left(ln, 1) = \"#\" Then\n Print #fileNum2, ln\n Continue While\n End If\n ln = Trim(LTrim(ln, \";\"), Any !\" \\t\")\n If ln = \"\" Then Continue While\n If UCase(Left(ln, 14)) = \"FAVOURITEFRUIT\" Then\n If hadFruit Then Continue While\n hadFruit = True\n Print #fileNum2, \"FAVOURITEFRUIT \" + cData.favouriteFruit\n ElseIf UCase(Left(ln, 12)) = \"NEEDSPEELING\" Then\n If hadPeeling Then Continue While\n hadPeeling = True\n If cData.needsPeeling Then\n Print #fileNum2, \"NEEDSPEELING\"\n Else\n Print #fileNum2, \"; NEEDSPEELING\"\n End If\n ElseIf UCase(Left(ln, 12)) = \"SEEDSREMOVED\" Then\n If hadSeeds Then Continue While\n hadSeeds = True\n If cData.seedsRemoved Then\n Print #fileNum2, \"SEEDSREMOVED\"\n Else\n Print #fileNum2, \"; SEEDSREMOVED\"\n End If\n ElseIf UCase(Left(ln, 15)) = \"NUMBEROFBANANAS\" Then\n If hadBananas Then Continue While\n hadBananas = True\n Print #fileNum2, \"NUMBEROFBANANAS \" + Str(cData.numberOfBananas)\n ElseIf UCase(Left(ln, 20)) = \"NUMBEROFSTRAWBERRIES\" Then\n If hadStrawberries Then Continue While\n hadStrawberries = True\n Print #fileNum2, \"NUMBEROFSTRAWBERRIES \" + Str(cData.numberOfStrawBerries)\n End If\n Wend\n\n If Not hadFruit Then\n Print #fileNum2, \"FAVOURITEFRUIT \" + cData.favouriteFruit\n End If\n If Not hadPeeling Then\n If cData.needsPeeling Then\n Print #fileNum2, \"NEEDSPEELING\"\n Else\n Print #fileNum2, \"; NEEDSPEELING\"\n End If\n End If\n If Not hadSeeds Then\n If cData.seedsRemoved Then\n Print #fileNum2, \"SEEDSREMOVED\"\n Else\n Print #fileNum2, \"; SEEDSREMOVED\"\n End If\n End If\n If Not hadBananas Then\n Print #fileNum2, \"NUMBEROFBANANAS \" + Str(cData.numberOfBananas)\n End If\n If Not hadStrawberries Then\n Print #fileNum2, \"NUMBEROFSTRAWBERRIES \" + Str(cData.numberOfStrawBerries)\n End If\n\n Close #fileNum : Close #fileNum2\n Kill(fileName)\n Name (tempFileName fileName)\nEnd Sub\n\nDim fileName As String = \"config2.txt\"\nDim cData As ConfigData\nWith cData\n .favouriteFruit = \"banana\"\n .needsPeeling = False\n .seedsRemoved = True\n .numberOfBananas = 1024\n .numberOfStrawberries = 62000\nEnd With\n\nupdateConfigData fileName, cData\nPrint\nPrint \"Press any key to quit\"\nSleep\n","language":"FreeBASIC"},{"code":"package main\n\nimport (\n\t\"bufio\"\n\t\"fmt\"\n\t\"io\"\n\t\"log\"\n\t\"os\"\n\t\"strings\"\n\t\"unicode\"\n)\n\n// line represents a single line in the configuration file.\ntype line struct {\n\tkind lineKind\n\toption string\n\tvalue string\n\tdisabled bool\n}\n\n// lineKind represents the different kinds of configuration line.\ntype lineKind int\n\nconst (\n\t_ lineKind = iota\n\tignore\n\tparseError\n\tcomment\n\tblank\n\tvalue\n)\n\nfunc (l line) String() string {\n\tswitch l.kind {\n\tcase ignore, parseError, comment, blank:\n\t\treturn l.value\n\tcase value:\n\t\ts := l.option\n\t\tif l.disabled {\n\t\t\ts = \"; \" + s\n\t\t}\n\t\tif l.value != \"\" {\n\t\t\ts += \" \" + l.value\n\t\t}\n\t\treturn s\n\t}\n\tpanic(\"unexpected line kind\")\n}\n\nfunc removeDross(s string) string {\n\treturn strings.Map(func(r rune) rune {\n\t\tif r < 32 || r > 0x7f || unicode.IsControl(r) {\n\t\t\treturn -1\n\t\t}\n\t\treturn r\n\t}, s)\n}\n\nfunc parseLine(s string) line {\n\tif s == \"\" {\n\t\treturn line{kind: blank}\n\t}\n\tif s[0] == '#' {\n\t\treturn line{kind: comment, value: s}\n\t}\n\ts = removeDross(s)\n\tfields := strings.Fields(s)\n\tif len(fields) == 0 {\n\t\treturn line{kind: blank}\n\t}\n\t// Strip leading semicolons (but record that we found them)\n\tsemi := false\n\tfor len(fields[0]) > 0 && fields[0][0] == ';' {\n\t\tsemi = true\n\t\tfields[0] = fields[0][1:]\n\t}\n\t// Lose the first field if it was all semicolons\n\tif fields[0] == \"\" {\n\t\tfields = fields[1:]\n\t}\n\tswitch len(fields) {\n\tcase 0:\n\t\t// This can only happen if the line starts\n\t\t// with a semicolon but has no other information\n\t\treturn line{kind: ignore}\n\tcase 1:\n\t\treturn line{\n\t\t\tkind: value,\n\t\t\toption: strings.ToUpper(fields[0]),\n\t\t\tdisabled: semi,\n\t\t}\n\tcase 2:\n\t\treturn line{\n\t\t\tkind: value,\n\t\t\toption: strings.ToUpper(fields[0]),\n\t\t\tvalue: fields[1],\n\t\t\tdisabled: semi,\n\t\t}\n\t}\n\treturn line{kind: parseError, value: s}\n}\n\n// Config represents a \"standard\" configuration file.\ntype Config struct {\n\toptions map[string]int\t\t// index of each option in lines.\n\tlines []line\n}\n\n// index returns the index of the given option in\n// c.lines, or -1 if not found.\nfunc (c *Config) index(option string) int {\n\tif i, ok := c.options[option]; ok {\n\t\treturn i\n\t}\n\treturn -1\n}\n\n// addLine adds a line to the config, ignoring\n// duplicate options and \"ignore\" lines.\nfunc (c *Config) addLine(l line) {\n\tswitch l.kind {\n\tcase ignore:\n\t\treturn\n\tcase value:\n\t\tif c.index(l.option) >= 0 {\n\t\t\treturn\n\t\t}\n\t\tc.options[l.option] = len(c.lines)\n\t\tc.lines = append(c.lines, l)\n\tdefault:\n\t\tc.lines = append(c.lines, l)\n\t}\n}\n\n// ReadConfig reads a configuration file from path and returns it.\nfunc ReadConfig(path string) (*Config, error) {\n\tf, err := os.Open(path)\n\tif err != nil {\n\t\treturn nil, err\n\t}\n\tdefer f.Close()\n\tr := bufio.NewReader(f)\n\tc := &Config{options: make(map[string]int)}\n\tfor {\n\t\ts, err := r.ReadString('\\n')\n\t\tif s != \"\" {\n\t\t\tif err == nil {\n\t\t\t\t// strip newline unless we encountered an error without finding one.\n\t\t\t\ts = s[:len(s)-1]\n\t\t\t}\n\t\t\tc.addLine(parseLine(s))\n\t\t}\n\t\tif err == io.EOF {\n\t\t\tbreak\n\t\t}\n\t\tif err != nil {\n\t\t\treturn nil, err\n\t\t}\n\t}\n\treturn c, nil\n}\n\n// Set sets an option to a value, adding the option if necessary. If\n// the option was previously disabled, it will be enabled.\nfunc (c *Config) Set(option string, val string) {\n\tif i := c.index(option); i >= 0 {\n\t\tline := &c.lines[i]\n\t\tline.disabled = false\n\t\tline.value = val\n\t\treturn\n\t}\n\tc.addLine(line{\n\t\tkind: value,\n\t\toption: option,\n\t\tvalue: val,\n\t})\n}\n\n// Enable sets the enabled status of an option. It is\n// ignored if the option does not already exist.\nfunc (c *Config) Enable(option string, enabled bool) {\n\tif i := c.index(option); i >= 0 {\n\t\tc.lines[i].disabled = !enabled\n\t}\n}\n\n// Write writes the configuration file to the writer.\nfunc (c *Config) Write(w io.Writer) {\n\tfor _, line := range c.lines {\n\t\tfmt.Println(line)\n\t}\n}\n\nfunc main() {\n\tc, err := ReadConfig(\"/tmp/cfg\")\n\tif err != nil {\n\t\tlog.Fatalln(err)\n\t}\n\tc.Enable(\"NEEDSPEELING\", false)\n\tc.Set(\"SEEDSREMOVED\", \"\")\n\tc.Set(\"NUMBEROFBANANAS\", \"1024\")\n\tc.Set(\"NUMBEROFSTRAWBERRIES\", \"62000\")\n\tc.Write(os.Stdout)\n}\n","language":"Go"},{"code":"import Data.Char (toUpper)\nimport qualified System.IO.Strict as S\n","language":"Haskell"},{"code":"data INI = INI { entries :: [Entry] } deriving Show\n\ndata Entry = Comment String\n | Field String String\n | Flag String Bool\n | EmptyLine\n\ninstance Show Entry where\n show entry = case entry of\n Comment text -> \"# \" ++ text\n Field f v -> f ++ \" \" ++ v\n Flag f True -> f\n Flag f False -> \"; \" ++ f\n EmptyLine -> \"\"\n\ninstance Read Entry where\n readsPrec _ s = [(interprete (clean \" \" s), \"\")]\n where\n clean chs = dropWhile (`elem` chs)\n interprete ('#' : text) = Comment text\n interprete (';' : f)= flag (clean \" ;\" f) False\n interprete entry = case words entry of\n [] -> EmptyLine\n [f] -> flag f True\n f : v -> field f (unwords v)\n field f = Field (toUpper <$> f)\n flag f = Flag (toUpper <$> f)\n","language":"Haskell"},{"code":"setValue :: String -> String -> INI -> INI\nsetValue f v = INI . replaceOn (eqv f) (Field f v) . entries\n\nsetFlag :: String -> Bool -> INI -> INI\nsetFlag f v = INI . replaceOn (eqv f) (Flag f v) . entries\n\nenable f = setFlag f True\ndisable f = setFlag f False\n\neqv f entry = (toUpper <$> f) == (toUpper <$> field entry)\n where field (Field f _) = f\n field (Flag f _) = f\n field _ = \"\"\n\nreplaceOn p x lst = prev ++ x : post\n where\n (prev,post) = case break p lst of\n (lst, []) -> (lst, [])\n (lst, _:xs) -> (lst, xs)\n","language":"Haskell"},{"code":"readIni :: String -> IO INI\nreadIni file = INI . map read . lines <$> S.readFile file\n\nwriteIni :: String -> INI -> IO ()\nwriteIni file = writeFile file . unlines . map show . entries\n\nupdateIni :: String -> (INI -> INI) -> IO ()\nupdateIni file f = readIni file >>= writeIni file . f\n\nmain = updateIni \"test.ini\" $\n disable \"NeedsPeeling\" .\n enable \"SeedsRemoved\" .\n setValue \"NumberOfBananas\" \"1024\" .\n setValue \"NumberOfStrawberries\" \"62000\"\n","language":"Haskell"},{"code":"require 'regex strings'\n\nnormalize=:3 :0\n seen=. a:\n eol=. {:;y\n t=. ''\n for_line.<;._2;y do. lin=. deb line=.>line\n if. '#'={.line do. t=.t,line,eol\n elseif. ''-:lin do. t =. t,eol\n elseif. do.\n line=. 1 u:([-.-.)&(32+i.95)&.(3&u:) line\n base=. ('^ *;;* *';'') rxrplc line\n nm=. ;name=. {.;:toupper base\n if. -. name e. seen do.\n seen=. seen, name\n t=. t,eol,~dtb ('; '#~';'={.lin),(('^(?i) *',nm,'\\b *');(nm,' ')) rxrplc base\n end.\n end.\n end.t\n)\n\nenable=:1 :0\n (<m) 1!:2~ normalize (,y,{:);<@rxrplc~&(y;~'^; *(?i)',y,'\\b');.2]1!:1<m\n)\n\ndisable=:1 :0\n (<m) 1!:2~ normalize (,'; ',y,{:);<@rxrplc~&(('; ',y);~'^ *(?i)',y,'\\b');.2]1!:1<m\n)\n\nset=:1 :0\n:\n t=. 1!:1<m\n pat=. '^ *(?i)',y,'\\b.*'\n upd=. y,' ',\":x\n (<m) 1!:2~ normalize (,upd,{:);<@rxrplc~&(pat;upd) t\n)\n","language":"J"},{"code":" 'example.file' disable 'needspeeling'\n 'example.file' enable 'seedsremoved'\n 1024 'example.file' set 'numberofbananas'\n 62000 'example.file' set 'numberofstrawberries'\n","language":"J"},{"code":"import java.io.*;\nimport java.util.*;\nimport java.util.regex.*;\n\npublic class UpdateConfig {\n\n public static void main(String[] args) {\n if (args[0] == null) {\n System.out.println(\"filename required\");\n\n } else if (readConfig(args[0])) {\n enableOption(\"seedsremoved\");\n disableOption(\"needspeeling\");\n setOption(\"numberofbananas\", \"1024\");\n addOption(\"numberofstrawberries\", \"62000\");\n store();\n }\n }\n\n private enum EntryType {\n EMPTY, ENABLED, DISABLED, COMMENT\n }\n\n private static class Entry {\n EntryType type;\n String name, value;\n\n Entry(EntryType t, String n, String v) {\n type = t;\n name = n;\n value = v;\n }\n }\n\n private static Map<String, Entry> entries = new LinkedHashMap<>();\n private static String path;\n\n private static boolean readConfig(String p) {\n path = p;\n\n File f = new File(path);\n if (!f.exists() || f.isDirectory())\n return false;\n\n String regexString = \"^(;*)\\\\s*([A-Za-z0-9]+)\\\\s*([A-Za-z0-9]*)\";\n Pattern regex = Pattern.compile(regexString);\n\n try (Scanner sc = new Scanner(new FileReader(f))){\n int emptyLines = 0;\n String line;\n while (sc.hasNext()) {\n line = sc.nextLine().trim();\n\n if (line.isEmpty()) {\n addOption(\"\" + emptyLines++, null, EntryType.EMPTY);\n\n } else if (line.charAt(0) == '#') {\n entries.put(line, new Entry(EntryType.COMMENT, line, null));\n\n } else {\n line = line.replaceAll(\"[^a-zA-Z0-9\\\\x20;]\", \"\");\n Matcher m = regex.matcher(line);\n\n if (m.find() && !m.group(2).isEmpty()) {\n\n EntryType t = EntryType.ENABLED;\n if (!m.group(1).isEmpty())\n t = EntryType.DISABLED;\n\n addOption(m.group(2), m.group(3), t);\n }\n }\n }\n } catch (IOException e) {\n System.out.println(e);\n }\n return true;\n }\n\n private static void addOption(String name, String value) {\n addOption(name, value, EntryType.ENABLED);\n }\n\n private static void addOption(String name, String value, EntryType t) {\n name = name.toUpperCase();\n entries.put(name, new Entry(t, name, value));\n }\n\n private static void enableOption(String name) {\n Entry e = entries.get(name.toUpperCase());\n if (e != null)\n e.type = EntryType.ENABLED;\n }\n\n private static void disableOption(String name) {\n Entry e = entries.get(name.toUpperCase());\n if (e != null)\n e.type = EntryType.DISABLED;\n }\n\n private static void setOption(String name, String value) {\n Entry e = entries.get(name.toUpperCase());\n if (e != null)\n e.value = value;\n }\n\n private static void store() {\n try (PrintWriter pw = new PrintWriter(path)) {\n for (Entry e : entries.values()) {\n switch (e.type) {\n case EMPTY:\n pw.println();\n break;\n case ENABLED:\n pw.format(\"%s %s%n\", e.name, e.value);\n break;\n case DISABLED:\n pw.format(\"; %s %s%n\", e.name, e.value);\n break;\n case COMMENT:\n pw.println(e.name);\n break;\n default:\n break;\n }\n }\n if (pw.checkError()) {\n throw new IOException(\"writing to file failed\");\n }\n } catch (IOException e) {\n System.out.println(e);\n }\n }\n}\n","language":"Java"},{"code":"function cleansyntax(line)\n line = strip(line)\n if line == \"\"\n return \"#=blank line=#\"\n elseif line[1] == '#'\n return line\n elseif line[1] == ';'\n line = replace(line, r\"^;[;]+\" => \";\")\n else # active option\n o, p = splitline(line)\n line = p == nothing ? uppercase(o) : uppercase(o) * \" \" * p\n end\n join(filter(c -> isascii(c[1]) && !iscntrl(c[1]), split(line, \"\")), \"\")\nend\n\n\"\"\"\n Run to clean up the configuration file lines prior to other function application.\n\"\"\"\ncleansyntax!(lines) = (for (i, li) in enumerate(lines) lines[i] = cleansyntax(li) end; lines)\n\nisdisabled(line) = startswith(line, [';', '#'])\nisenabled(line) = !isdisabled(line)\n\nfunction splitline(line)\n arr = split(line, r\"\\s+\", limit=2)\n if length(arr) < 2\n return (arr[1], nothing)\n end\n return (arr[1], arr[2])\nend\n\nfunction disable!(lines, opt)\n for (i, li) in enumerate(lines)\n if isenabled(li) && splitline(li)[1] == uppercase(opt)\n lines[i] = \";\" * li\n break # note: only first one found is disabled\n end\n end\n lines\nend\n\nfunction enable!(lines, opt)\n for (i, li) in enumerate(lines)\n if isdisabled(li)\n s = li[2:end]\n if splitline(s)[1] == uppercase(opt)\n lines[i] = s\n break # note: only first one found is enabled\n end\n end\n end\n lines\nend\n\nfunction changeparam!(lines, opt, newparam)\n for (i, li) in enumerate(lines)\n if isenabled(li)\n o, p = splitline(li)\n if o == opt\n lines[i] = o * \" \" * string(newparam)\n break # note: only first one found is changed\n end\n end\n end\n lines\nend\n\nfunction activecfg(lines)\n cfgdict = Dict()\n for li in lines\n if isenabled(li)\n o, p = splitline(li)\n cfgdict[o] = p\n end\n end\n cfgdict\nend\n\nconst filename = \"fruit.cfg\"\nconst cfh = open(filename)\nconst cfglines = cleansyntax!(readlines(cfh))\nclose(cfh)\n\nconst cfg = activecfg(cfglines)\n\ndisable!(cfglines, \"NEEDSPEELING\")\nenable!(cfglines, \"SEEDSREMOVED\")\nchangeparam!(cfglines, \"NUMBEROFBANANAS\", 1024)\n\nif !haskey(cfg, \"NUMBEROFSTRAWBERRIES\")\n push!(cfglines, \"NUMBEROFSTRAWBERRIES 62000\")\nend\ncfg[\"NUMBEROFSTRAWBERRIES\"] = 62000\nchangeparam!(cfglines, \"NUMBEROFSTRAWBERRIES\", 62000)\n\nconst cfw = open(filename, \"w\")\nfor li in cfglines\n if li != \"\"\n if li == \"#=blank line=#\"\n li = \"\"\n end\n write(cfw, li * \"\\n\")\n end\nend\n","language":"Julia"},{"code":"// version 1.2.0\n\nimport java.io.File\n\nclass ConfigData(\n val favouriteFruit: String,\n val needsPeeling: Boolean,\n val seedsRemoved: Boolean,\n val numberOfBananas: Int,\n val numberOfStrawberries: Int\n)\n\nfun updateConfigFile(fileName: String, cData: ConfigData) {\n val inp = File(fileName)\n val lines = inp.readLines()\n val tempFileName = \"temp_$fileName\"\n val out = File(tempFileName)\n val pw = out.printWriter()\n var hadFruit = false\n var hadPeeling = false\n var hadSeeds = false\n var hadBananas = false\n var hadStrawberries = false\n\n for (line in lines) {\n if (line.isEmpty() || line[0] == '#') {\n pw.println(line)\n continue\n }\n val ln = line.trimStart(';').trim(' ', '\\t').toUpperCase()\n if (ln.isEmpty()) continue\n if (ln.take(14) == \"FAVOURITEFRUIT\") {\n if (hadFruit) continue\n hadFruit = true\n pw.println(\"FAVOURITEFRUIT ${cData.favouriteFruit}\")\n }\n else if (ln.take(12) == \"NEEDSPEELING\") {\n if (hadPeeling) continue\n hadPeeling = true\n if (cData.needsPeeling)\n pw.println(\"NEEDSPEELING\")\n else\n pw.println(\"; NEEDSPEELING\")\n }\n else if (ln.take(12) == \"SEEDSREMOVED\") {\n if (hadSeeds) continue\n hadSeeds = true\n if (cData.seedsRemoved)\n pw.println(\"SEEDSREMOVED\")\n else\n pw.println(\"; SEEDSREMOVED\")\n }\n else if(ln.take(15) == \"NUMBEROFBANANAS\") {\n if (hadBananas) continue\n hadBananas = true\n pw.println(\"NUMBEROFBANANAS ${cData.numberOfBananas}\")\n }\n else if(ln.take(20) == \"NUMBEROFSTRAWBERRIES\") {\n if (hadStrawberries) continue\n hadStrawberries = true\n pw.println(\"NUMBEROFSTRAWBERRIES ${cData.numberOfStrawberries}\")\n }\n }\n\n if (!hadFruit) {\n pw.println(\"FAVOURITEFRUIT ${cData.favouriteFruit}\")\n }\n\n if (!hadPeeling) {\n if (cData.needsPeeling)\n pw.println(\"NEEDSPEELING\")\n else\n pw.println(\"; NEEDSPEELING\")\n }\n\n if (!hadSeeds) {\n if (cData.seedsRemoved)\n pw.println(\"SEEDSREMOVED\")\n else\n pw.println(\"; SEEDSREMOVED\")\n }\n\n if (!hadBananas) {\n pw.println(\"NUMBEROFBANANAS ${cData.numberOfBananas}\")\n }\n\n if (!hadStrawberries) {\n pw.println(\"NUMBEROFSTRAWBERRIES ${cData.numberOfStrawberries}\")\n }\n\n pw.close()\n inp.delete()\n out.renameTo(inp)\n}\n\nfun main(args: Array<String>) {\n val fileName = \"config.txt\"\n val cData = ConfigData(\"banana\", false, true, 1024, 62000)\n updateConfigFile(fileName, cData)\n}\n","language":"Kotlin"},{"code":"#!/usr/bin/lasso9\n\ndefine config => type {\n\n\tdata public configtxt, public path\n\n\tpublic oncreate(\n\t\tpath::string = 'testing/configuration.txt'\n\t) => {\n\t\t.configtxt = file(#path) -> readstring\n\t\t.path = #path\n\t}\n\n\tpublic get(term::string) => {\n\t\t.clean\n\t\tlocal(\n\t\t\tregexp\t= regexp(-find = `(?m)^` + #term + `($|\\s*=\\s*|\\s+)(.*)$`, -input = .configtxt, -ignorecase),\n\t\t\tresult\n\t\t)\n\n\t\twhile(#regexp -> find) => {\n\t\t\t#result = (#regexp -> groupcount > 1 ? (#regexp -> matchString(2) -> trim& || true))\n\t\t\tif(#result -> asstring >> ',') => {\n\t\t\t\t#result = #result -> split(',')\n\t\t\t\t#result -> foreach => {#1 -> trim}\n\t\t\t}\n\t\t\treturn #result\n\t\t}\n\t\treturn false\n\t}\n\n\tpublic set(term::string, value) => {\n\t\tif(#value === false) => {\n\t\t\t.disable(#term)\n\t\t\treturn\n\t\t}\n\t\t.enable(#term)\n\t\tif(#value -> isanyof(::string, ::integer, ::decimal)) => {\n\t\t\t.configtxt = regexp(-find = `(?m)^(` + #term + `) ?(.*?)$`, -replace = `$1 ` + #value, -input = .configtxt, -ignorecase) -> replaceall\n\t\t}\n\t}\n\n\tpublic disable(term::string) => {\n\t\t.clean\n\t\tlocal(regexp = regexp(-find = `(?m)^(` + #term + `)`, -replace = `; $1`, -input = .configtxt, -ignorecase))\n\t\t.configtxt = #regexp -> replaceall\n\t}\n\n\tpublic enable(term::string, -comment::string = '# Added ' + date) => {\n\t\t.clean\n\t\tlocal(regexp = regexp(-find = `(?m)^(; )?(` + #term + `)`, -replace = `$2`, -input = .configtxt, -ignorecase))\n\t\tif(#regexp -> find) => {\n\t\t\t.configtxt = #regexp -> replaceall\n\t\telse\n\t\t\t.configtxt -> append('\\n' + (not #comment -> beginswith('#') ? '# ') +\n\t\t\t\t#comment + '\\n' +\n\t\t\t\tstring_uppercase(#term) + '\\n'\n\t\t\t)\n\t\t}\n\t}\n\n\tpublic write => {\n\t\tlocal(config = file(.path))\n\t\t#config -> opentruncate\n\t\t#config -> dowithclose => {\n\t\t\t#config -> writestring(.configtxt)\n\t\t}\n\n\t}\n\n\tpublic clean => {\n\n\t\tlocal(\n\t\t\tcleaned = array,\n\t\t\tregexp\t= regexp(-find = `^(;+)\\W*$`)\n\t\t)\n\n\t\twith line in .configtxt -> split('\\n') do {\n\t\t\t#line -> trim\n\t\t\t#regexp -> input = #line\n\n\t\t\tif(#line -> beginswith('#') or #line == '') => {\n\t\t\t\t#cleaned -> insert(#line)\n\t\t\telse(not (#regexp -> find))\n\t\t\t\tif(#line -> beginswith(';')) => {\n\t\t\t\t\t#line -> replace(regexp(`^;+ *`), `; `)\n\t\t\t\telse\n\t\t\t\t\t#line -> replace(regexp(`^(.*?) +(.*?)`), `$1 $2`)\n\t\t\t\t}\n\t\t\t\t#line -> replace(regexp(`\\t`))\n\t\t\t\t#cleaned -> insert(#line)\n\t\t\t}\n\t\t}\n\n\t\t.configtxt = #cleaned -> join('\\n')\n\n\t}\n\n}\n","language":"Lasso"},{"code":"local(\n\tconfig\t\t= config,\n)\n\nstdoutnl(#config -> get('FAVOURITEFRUIT'))\nstdoutnl(#config -> get('SEEDSREMOVED'))\nstdoutnl(#config -> get('NUMBEROFBANANAS'))\n\n#config -> enable('seedsremoved')\n#config -> enable('PARAMWITHCOMMENT', -comment = 'This param was added to demonstrate the possibility to also have comments associated with it')\n#config -> disable('needspeeling')\n#config -> set('numberofstrawberries', 62000)\n#config -> set('numberofbananas', 1024)\n\n#config -> write\n","language":"Lasso"},{"code":"import os, re, strutils\n\nlet regex = re(r\"^(;*)\\s*([A-Z0-9]+)\\s*([A-Z0-9]*)\", {reIgnoreCase, reStudy})\n\ntype\n\n EntryType {.pure.} = enum Empty, Enabled, Disabled, Comment, Ignore\n\n Entry = object\n etype: EntryType\n name: string\n value: string\n\n Config = object\n entries: seq[Entry]\n path: string\n\n\n# Forward reference.\nproc addOption*(config: var Config; name, value: string; etype = Enabled)\n\n\nproc initConfig*(path: string): Config =\n\n if not path.isValidFilename:\n raise newException(IOError, \"invalid file name.\")\n\n result.path = path\n if not path.fileExists: return\n\n for line in path.lines:\n var line = line.strip\n if line.len == 0:\n result.entries.add Entry(etype: Empty)\n elif line[0] == '#':\n result.entries.add Entry(etype: Comment, value: line)\n else:\n line = line.replace(re\"^a-zA-Z0-9\\x20;\")\n var matches = newSeq[string](3)\n if line.match(regex, matches) and matches[1].len != 0:\n let etype = if matches[0].len == 0: Enabled else: Disabled\n result.addOption(matches[1], matches[2], etype)\n\n\nproc getOptionIndex(config: Config; name: string): int =\n for i, e in config.entries:\n if e.etype notin [Enabled, Disabled]: continue\n if e.name == name.toUpperAscii:\n return i\n result = -1\n\n\nproc enableOption*(config: var Config; name: string) =\n let i = config.getOptionIndex(name)\n if i >= 0:\n config.entries[i].etype = Enabled\n\n\nproc disableOption*(config: var Config; name: string) =\n let i = config.getOptionIndex(name)\n if i >= 0:\n config.entries[i].etype = Disabled\n\n\nproc setOption*(config: var Config; name, value: string) =\n let i = config.getOptionIndex(name)\n if i >= 0:\n config.entries[i].value = value\n\n\nproc addOption*(config: var Config; name, value: string; etype = Enabled) =\n config.entries.add Entry(etype: etype, name: name.toUpperAscii, value: value)\n\n\nproc removeOption*(config: var Config; name: string) =\n let i = config.getOptionIndex(name)\n if i >= 0:\n config.entries[i].etype = Ignore\n\n\nproc store*(config: Config) =\n let f = open(config.path, fmWrite)\n for e in config.entries:\n case e.etype\n of Empty: f.writeLine(\"\")\n of Enabled: f.writeLine(e.name, ' ', e.value)\n of Disabled: f.writeLine(\"; \", e.name, ' ', e.value)\n of Comment: f.writeLine(e.value)\n of Ignore: discard\n\n\nwhen isMainModule:\n\n var cfg = initConfig(\"update_demo.config\")\n cfg.enableOption(\"seedsremoved\")\n cfg.disableOption(\"needspeeling\")\n cfg.setOption(\"numberofbananas\", \"1024\")\n cfg.addOption(\"numberofstrawberries\", \"62000\")\n cfg.store()\n","language":"Nim"},{"code":"use warnings;\nuse strict;\n\nmy $needspeeling = 0;\nmy $seedsremoved = 1;\nmy $numberofstrawberries = 62000;\nmy $numberofbananas = 1024;\nmy $favouritefruit = 'bananas';\n\nmy @out;\n\nsub config {\n my (@config) = <DATA>;\n push @config, \"NUMBEROFSTRAWBERRIES $numberofstrawberries\\n\"\n unless grep { /^;*[ \\t]*NUMBEROFSTRAWBERRIES\\b/; } @config;\n\n foreach my $line (@config) {\n\n if (substr($line, 0, 1) eq '#') {\n push @out, $line;\n next;\n }\n\n next if $line =~ /^[;\\t ]+$/;\n\n my ($option, $option_name);\n\n if ($line =~ /^([A-Z]+[0-9]*)/) {\n $option_name = lc $1;\n $option = eval \"\\\\\\$$option_name\";\n my $value = eval \"\\${$option_name}\";\n\n if ($value) {\n $$option = $value;\n }\n else {\n $line = '; ' . $line;\n $$option = undef;\n }\n }\n elsif ($line =~ /^;+\\s*([A-Z]+[0-9]*)/) {\n $option_name = lc $1;\n $option = eval \"\\\\\\$$option_name\";\n my $value = eval \"\\${$option_name}\";\n\n if ($value) {\n $line =~ s/^;+\\s*//;\n $$option = $value == 1 ? '' : $value;\n }\n else {\n $$option = undef;\n }\n }\n\n if (defined $$option) {\n push @out, \"\\U$option_name\\E $$option\\n\"\n unless grep { /^\\U$option_name\\E\\b/; } @out;\n }\n else {\n $line =~ s/\\s*[^[:ascii:]]+\\s*$//;\n $line =~ s/[[:cntrl:]\\s]+$//;\n push(@out, \"$line\\n\");\n }\n }\n}\n\nconfig();\n\nmy $file = join('', @out);\n$file =~ s/\\n{3,}/\\n\\n/g;\n\nprint $file;\n\n__DATA__\n# This is a configuration file in standard configuration file format\n#\n# Lines begininning with a hash or a semicolon are ignored by the application\n# program. Blank lines are also ignored by the application program.\n\n# The first word on each non comment line is the configuration option.\n# Remaining words or numbers on the line are configuration parameter\n# data fields.\n\n# Note that configuration option names are not case sensitive. However,\n# configuration parameter data is case sensitive and the lettercase must\n# be preserved.\n\n# This is a favourite fruit\nFAVOURITEFRUIT banana\n\n# This is a boolean that should be set\nNEEDSPEELING\n\n# This boolean is commented out\n; SEEDSREMOVED\n\n# How many bananas we have\nNUMBEROFBANANAS 48\n","language":"Perl"},{"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;\">\"RCTEST.INI\"</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #008000;\">\"r\"</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;\">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;\">constant</span> <span style=\"color: #000000;\">dini</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">new_dict</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: #004080;\">string</span> <span style=\"color: #000000;\">li</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">trim</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;\">if</span> <span style=\"color: #7060A8;\">length</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">li</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #008080;\">and</span> <span style=\"color: #008080;\">not</span> <span style=\"color: #7060A8;\">find</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">li</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: #008080;\">then</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;\">li</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: #004080;\">string</span> <span style=\"color: #000000;\">rest</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">li</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;\">li</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">upper</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">li</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: #7060A8;\">putd</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">li</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">rest</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">dini</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #008080;\">else</span>\n <span style=\"color: #7060A8;\">putd</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #7060A8;\">upper</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">li</span><span style=\"color: #0000FF;\">),</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">dini</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;\">for</span>\n\n <span style=\"color: #7060A8;\">deld</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #008000;\">\"NEEDSPEELING\"</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">dini</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #7060A8;\">setd</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #008000;\">\"SEEDSREMOVED\"</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">dini</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #7060A8;\">setd</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #008000;\">\"NUMBEROFBANANAS\"</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">1024</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">dini</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #7060A8;\">setd</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #008000;\">\"NUMBEROFSTRAWBERRIES\"</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">62000</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">dini</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;\">lines</span><span style=\"color: #0000FF;\">)</span> <span style=\"color: #008080;\">do</span>\n <span style=\"color: #004080;\">string</span> <span style=\"color: #000000;\">li</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">trim</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;\">if</span> <span style=\"color: #7060A8;\">length</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">li</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #008080;\">and</span> <span style=\"color: #000000;\">li</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: #008080;\">then</span>\n <span style=\"color: #008080;\">if</span> <span style=\"color: #000000;\">li</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: #008080;\">then</span>\n <span style=\"color: #000000;\">li</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">trim</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">li</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: #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;\">li</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: #004080;\">string</span> <span style=\"color: #000000;\">rest</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">li</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;\">li</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">upper</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">li</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;\">k</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">getd_index</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">li</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">dini</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;\">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: #008000;\">\"; \"</span><span style=\"color: #0000FF;\">&</span><span style=\"color: #000000;\">li</span><span style=\"color: #0000FF;\">&</span><span style=\"color: #008000;\">\" \"</span><span style=\"color: #0000FF;\">&</span><span style=\"color: #000000;\">rest</span>\n <span style=\"color: #008080;\">else</span>\n <span style=\"color: #004080;\">object</span> <span style=\"color: #000000;\">o</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">getd_by_index</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">k</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">dini</span><span style=\"color: #0000FF;\">)</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;\">o</span><span style=\"color: #0000FF;\">)</span> <span style=\"color: #008080;\">then</span> <span style=\"color: #000000;\">o</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">sprint</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">o</span><span style=\"color: #0000FF;\">)</span> <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">if</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: #000000;\">li</span><span style=\"color: #0000FF;\">&</span><span style=\"color: #008000;\">\" \"</span><span style=\"color: #0000FF;\">&</span><span style=\"color: #000000;\">o</span>\n <span style=\"color: #7060A8;\">deld</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">li</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">dini</span><span style=\"color: #0000FF;\">)</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: #008080;\">if</span> <span style=\"color: #7060A8;\">getd</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">li</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">dini</span><span style=\"color: #0000FF;\">)</span> <span style=\"color: #008080;\">then</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: #000000;\">li</span>\n <span style=\"color: #7060A8;\">deld</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">li</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">dini</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;\">i</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;\">li</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;\">end</span> <span style=\"color: #008080;\">for</span>\n <span style=\"color: #008080;\">function</span> <span style=\"color: #000000;\">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: #000000;\">data</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #004080;\">object</span> <span style=\"color: #000080;font-style:italic;\">/*user_data*/</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #000000;\">lines</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">append</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">lines</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">key</span><span style=\"color: #0000FF;\">&</span><span style=\"color: #008000;\">\" \"</span><span style=\"color: #0000FF;\">&</span><span style=\"color: #7060A8;\">sprint</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">data</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 <span style=\"color: #7060A8;\">traverse_dict</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #7060A8;\">routine_id</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #008000;\">\"visitor\"</span><span style=\"color: #0000FF;\">),</span><span style=\"color: #000000;\">0</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">dini</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;\">\"RCTEST.INI\"</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<!--\n","language":"Phix"},{"code":"<?php\n\n$conf = file_get_contents('update-conf-file.txt');\n\n// Disable the needspeeling option (using a semicolon prefix)\n$conf = preg_replace('/^(needspeeling)(|\\s*\\S*)$/mi', '; $1', $conf);\n\n// Enable the seedsremoved option by removing the semicolon and any leading whitespace\n$conf = preg_replace('/^;?\\s*(seedsremoved)/mi', '$1', $conf);\n\n// Change the numberofbananas parameter to 1024\n$conf = preg_replace('/^(numberofbananas)(|\\s*\\S*)$/mi', '$1 1024', $conf);\n\n// Enable (or create if it does not exist in the file) a parameter for numberofstrawberries with a value of 62000\nif (preg_match('/^;?\\s*(numberofstrawberries)/mi', $conf, $matches)) {\n $conf = preg_replace('/^(numberofstrawberries)(|\\s*\\S*)$/mi', '$1 62000', $conf);\n} else {\n $conf .= 'NUMBEROFSTRAWBERRIES 62000' . PHP_EOL;\n}\n\necho $conf;\n","language":"PHP"},{"code":"(let Data # Read all data\n (in \"config\"\n (make\n (until (eof)\n (link (trim (split (line) \" \"))) ) ) )\n (setq Data # Fix comments\n (mapcar\n '((L)\n (while (head '(\";\" \";\") (car L))\n (pop L) )\n (if (= '(\";\") (car L))\n L\n (cons NIL L) ) )\n Data ) )\n (let (Need NIL Seed NIL NBan NIL NStr NIL Favo NIL)\n (map\n '((L)\n (let D (mapcar uppc (cadar L))\n (cond\n ((= '`(chop \"NEEDSPEELING\") D)\n (if Need\n (set L)\n (on Need)\n (unless (caar L)\n (set (car L) '(\";\")) ) ) )\n ((= '`(chop \"SEEDSREMOVED\") D)\n (if Seed\n (set L)\n (on Seed)\n (when (caar L)\n (set (car L)) ) ) )\n ((= '`(chop \"NUMBEROFBANANAS\") D)\n (if NBan\n (set L)\n (on NBan)\n (set (cddar L) 1024) ) )\n ((= '`(chop \"NUMBEROFSTRAWBERRIES\") D)\n (if NStr\n (set L)\n (on NStr) ) )\n ((= '`(chop \"FAVOURITEFRUIT\") D)\n (if Favo\n (set L)\n (on Favo) ) ) ) ) )\n Data )\n (unless Need\n (conc Data (cons (list NIL \"NEEDSPEELING\"))) )\n (unless Seed\n (conc Data (cons (list NIL \"SEEDSREMOVED\"))) )\n (unless NBan\n (conc Data (cons (list NIL \"NUMBEROFBANANAS\" 1024))) )\n (unless NStr\n (conc Data (cons (list NIL \"NUMBEROFSTRAWBERRIES\" 62000))) ) )\n (out \"config\"\n (for L Data\n (prinl (glue \" \" (if (car L) L (cdr L)))) ) ) )\n","language":"PicoLisp"},{"code":"function Update-ConfigurationFile\n{\n [CmdletBinding()]\n Param\n (\n [Parameter(Mandatory=$false,\n Position=0)]\n [ValidateScript({Test-Path $_})]\n [string]\n $Path = \".\\config.txt\",\n\n [Parameter(Mandatory=$false)]\n [string]\n $FavouriteFruit,\n\n [Parameter(Mandatory=$false)]\n [int]\n $NumberOfBananas,\n\n [Parameter(Mandatory=$false)]\n [int]\n $NumberOfStrawberries,\n\n [Parameter(Mandatory=$false)]\n [ValidateSet(\"On\", \"Off\")]\n [string]\n $NeedsPeeling,\n\n [Parameter(Mandatory=$false)]\n [ValidateSet(\"On\", \"Off\")]\n [string]\n $SeedsRemoved\n )\n\n [string[]]$lines = Get-Content $Path\n\n Clear-Content $Path\n\n if (-not ($lines | Select-String -Pattern \"^\\s*NumberOfStrawberries\" -Quiet))\n {\n \"\", \"# How many strawberries we have\", \"NumberOfStrawberries 0\" | ForEach-Object {$lines += $_}\n }\n\n foreach ($line in $lines)\n {\n $line = $line -replace \"^\\s*\",\"\" ## Strip leading whitespace\n\n if ($line -match \"[;].*\\s*\") {continue} ## Strip semicolons\n\n switch -Regex ($line)\n {\n \"(^$)|(^#\\s.*)\" ## Blank line or comment\n {\n $line = $line\n }\n \"^FavouriteFruit\\s*.*\" ## Parameter FavouriteFruit\n {\n if ($FavouriteFruit)\n {\n $line = \"FAVOURITEFRUIT $FavouriteFruit\"\n }\n }\n \"^NumberOfBananas\\s*.*\" ## Parameter NumberOfBananas\n {\n if ($NumberOfBananas)\n {\n $line = \"NUMBEROFBANANAS $NumberOfBananas\"\n }\n }\n \"^NumberOfStrawberries\\s*.*\" ## Parameter NumberOfStrawberries\n {\n if ($NumberOfStrawberries)\n {\n $line = \"NUMBEROFSTRAWBERRIES $NumberOfStrawberries\"\n }\n }\n \".*NeedsPeeling\\s*.*\" ## Parameter NeedsPeeling\n {\n if ($NeedsPeeling -eq \"On\")\n {\n $line = \"NEEDSPEELING\"\n }\n elseif ($NeedsPeeling -eq \"Off\")\n {\n $line = \"; NEEDSPEELING\"\n }\n }\n \".*SeedsRemoved\\s*.*\" ## Parameter SeedsRemoved\n {\n if ($SeedsRemoved -eq \"On\")\n {\n $line = \"SEEDSREMOVED\"\n }\n elseif ($SeedsRemoved -eq \"Off\")\n {\n $line = \"; SEEDSREMOVED\"\n }\n }\n Default ## Whatever...\n {\n $line = $line\n }\n }\n\n Add-Content $Path -Value $line -Force\n }\n}\n","language":"PowerShell"},{"code":"Update-ConfigurationFile -NumberOfStrawberries 62000 -NumberOfBananas 1024 -SeedsRemoved On -NeedsPeeling Off\n\nInvoke-Item -Path \".\\config.txt\"\n","language":"PowerShell"},{"code":"#!/usr/bin/env python\n\n#----------------------------------------------------------------------------\n# STANDARD MODULES\n#----------------------------------------------------------------------------\nimport re\nimport string\n\n\n#----------------------------------------------------------------------------\n# GLOBAL: VARIABLES\n#----------------------------------------------------------------------------\nDISABLED_PREFIX = ';'\n\n\n#----------------------------------------------------------------------------\n# CLASS Option\n#----------------------------------------------------------------------------\nclass Option(object):\n \"\"\"An option, characterized by its name and its (optional) value. and by\n its status, which can be enabled or disabled.\n If its value is None, it is regarded to as a boolean option with a\n value of true.\n \"\"\"\n\n #------------------------------------------------------------------------\n def __init__(self, name, value=None, disabled=False,\n disabled_prefix=DISABLED_PREFIX):\n \"\"\"Create an Option instance, setting its name to 'name' (always\n converted to a string) and its value to 'value'. If 'disabled' is\n True, the option is considered disabled, otherwise enabled.\n The string 'disabled_prefix' is used as a prefix when generating the\n string representation of the option.\n \"\"\"\n self.name = str(name)\n self.value = value\n self.disabled = bool(disabled)\n self.disabled_prefix = disabled_prefix\n\n #------------------------------------------------------------------------\n def __str__(self):\n \"\"\"Return a string representation of the Option instance.\n This always includes the option name, followed by a space and the\n option value (if it is not None). If the option is disabled, the\n whole string is preprendend by the string stored in the instance\n attribute 'disabled_prefix' and a space.\n \"\"\"\n disabled = ('', '%s ' % self.disabled_prefix)[self.disabled]\n value = (' %s' % self.value, '')[self.value is None]\n return ''.join((disabled, self.name, value))\n\n #------------------------------------------------------------------------\n def get(self):\n \"\"\"Return the option value.\n If the stored value is None, the option is regarded to as a\n boolean one and its enabled status is returned. Othrwise its value\n is returned.\n \"\"\"\n enabled = not bool(self.disabled)\n if self.value is None:\n value = enabled\n else:\n value = enabled and self.value\n return value\n\n\n#----------------------------------------------------------------------------\n# CLASS Config\n#----------------------------------------------------------------------------\nclass Config(object):\n \"\"\"A set of configuration options and comment strings.\n \"\"\"\n # Regular expression matching a valid option line.\n reOPTION = r'^\\s*(?P<disabled>%s*)\\s*(?P<name>\\w+)(?:\\s+(?P<value>.+?))?\\s*$'\n\n #------------------------------------------------------------------------\n def __init__(self, fname=None, disabled_prefix=DISABLED_PREFIX):\n \"\"\"Initialize a Config instance, optionally reading the contents of\n the configuration file 'fname'.\n The string 'disabled_prefix' is used as a prefix when generating the\n string representation of the options.\n \"\"\"\n self.disabled_prefix = disabled_prefix\n self.contents = [] # Sequence of strings and Option instances.\n self.options = {} # Map an option name to an Option instance.\n self.creOPTION = re.compile(self.reOPTION % self.disabled_prefix)\n if fname:\n self.parse_file(fname)\n\n #------------------------------------------------------------------------\n def __str__(self):\n \"\"\"Return a string representation of the Config instance.\n This is just the concatenation of all the items stored in the\n attribute 'contents'.\n \"\"\"\n return '\\n'.join(map(str, self.contents))\n\n #------------------------------------------------------------------------\n def parse_file(self, fname):\n \"\"\"Parse all the lines of file 'fname' by applying the method\n 'parser_lines' on the file contents.\n \"\"\"\n with open(fname) as f:\n self.parse_lines(f)\n return self\n\n #------------------------------------------------------------------------\n def parse_lines(self, lines):\n \"\"\"Parse all the lines of iterable 'lines' by invoking the method\n 'parse_line' for each line in 'lines'.\n \"\"\"\n for line in lines:\n self.parse_line(line)\n return self\n\n #------------------------------------------------------------------------\n def parse_line(self, line):\n \"\"\"Parse the line 'line', looking for options.\n If an option line is found, spaces are stripped from the start and\n the end of 'line' and any non-printable character is removed as well.\n Only the first occurrence of an option is processed, all the other\n occurrences are ignored. A valid option is added to the instance\n attribute 'contents' (in order to preserve its position among the\n other lines). It is also added to the mapping stored in the instance\n attribute 'options'.\n Any non-option string is added the the instance attribute 'contents',\n except those lines starting with the string stored into the instance\n attribute 'disabled_prefix' which are not followed by any option\n name.\n \"\"\"\n s = ''.join(c for c in line.strip() if c in string.printable)\n moOPTION = self.creOPTION.match(s)\n if moOPTION:\n name = moOPTION.group('name').upper()\n if not name in self.options:\n self.add_option(name, moOPTION.group('value'),\n moOPTION.group('disabled'))\n else:\n if not s.startswith(self.disabled_prefix):\n self.contents.append(line.rstrip())\n return self\n\n #------------------------------------------------------------------------\n def add_option(self, name, value=None, disabled=False):\n \"\"\"Create a new Option instance, named 'name' (always converted to\n uppercase) with value 'value' and set its disabled status to\n 'disabled'.\n The Option instance is added to the instance attribute 'contents'.\n It is also added to the mapping stored in the instance attribute\n 'options'.\n \"\"\"\n name = name.upper()\n opt = Option(name, value, disabled)\n self.options[name] = opt\n self.contents.append(opt)\n return opt\n\n #------------------------------------------------------------------------\n def set_option(self, name, value=None, disabled=False):\n \"\"\"Look for an option named 'name' (always converted to\n uppercase) among the options stored in the instance\n attribute 'options'.\n If it is not found, a new Option instance is created.\n In any case its value is set to 'value' and its disabled\n status to 'disabled'.\n \"\"\"\n name = name.upper()\n opt = self.options.get(name)\n if opt:\n opt.value = value\n opt.disabled = disabled\n else:\n opt = self.add_option(name, value, disabled)\n return opt\n\n #------------------------------------------------------------------------\n def enable_option(self, name, value=None):\n \"\"\"Enable the option named 'name' (always converted to\n uppercase) and set its value to 'value'.\n If the option is not found, it is created and added to the\n end of the instance attribute 'contents'.\n \"\"\"\n return self.set_option(name, value, False)\n\n #------------------------------------------------------------------------\n def disable_option(self, name, value=None):\n \"\"\"Disable the option named 'name' (always converted to\n uppercase) and set its value to 'value'.\n If the option is not found, it is created and added to the\n end of the instance attribute 'contents'.\n \"\"\"\n return self.set_option(name, value, True)\n\n #------------------------------------------------------------------------\n def get_option(self, name):\n \"\"\"Return the value of the option named 'name' (always\n converted to uppercase).\n If the option is not found in the instance attribute\n 'options', None is returned. If the stored value is None,\n it is regarded to as a boolean option and its enable status\n is returned. Otherwise its value is returned.\n \"\"\"\n opt = self.options.get(name.upper())\n value = opt.get() if opt else None\n return value\n\n\n#----------------------------------------------------------------------------\n# MAIN\n#----------------------------------------------------------------------------\nif __name__ == '__main__':\n import sys\n cfg = Config(sys.argv[1] if len(sys.argv) > 1 else None)\n cfg.disable_option('needspeeling')\n cfg.enable_option('seedsremoved')\n cfg.enable_option('numberofbananas', 1024)\n cfg.enable_option('numberofstrawberries', 62000)\n print cfg\n","language":"Python"},{"code":"#lang racket\n\n(require \"options.rkt\")\n\n\n(read-options \"options-file\")\n(define-options needspeeling seedsremoved numberofbananas numberofstrawberries)\n\n;; Disable the needspeeling option (using a semicolon prefix)\n(set! needspeeling #f)\n;; Enable the seedsremoved option by removing the semicolon and any\n;; leading whitespace\n(set! seedsremoved ENABLE)\n;; Change the numberofbananas parameter to 1024\n(set! numberofbananas 1024)\n;; Enable (or create if it does not exist in the file) a parameter for\n;; numberofstrawberries with a value of 62000\n(set! numberofstrawberries 62000)\n","language":"Racket"},{"code":"use File::Temp;\n\nmy ($tmpfile, $out) = tempfile;\n\nsub MAIN ($file, *%changes) {\n %changes.=map({; .key.uc => .value });\n my %seen;\n\n for $file.IO.lines {\n when /:s ^ ('#' .* | '') $/ {\n say $out: ~$0;\n }\n when /:s ^ (';'+)? [(\\w+) (\\w+)?]? $/ {\n next if !$1 or %seen{$1.uc}++;\n my $new = %changes{$1.uc}:delete;\n say $out: format-line $1, |( !defined($new) ?? ($2, !$0) !!\n $new ~~ Bool ?? ($2, $new) !! ($new, True) );\n }\n default {\n note \"Malformed line: $_\\nAborting.\";\n exit 1;\n }\n }\n\n say $out: format-line .key, |(.value ~~ Bool ?? (Nil, .value) !! (.value, True))\n for %changes;\n\n $out.close;\n\n copy $tmpfile, $file;\n}\n\nsub format-line ($key, $value, $enabled) {\n (\"; \" if !$enabled) ~ $key.uc ~ (\" $value\" if defined $value);\n}\n","language":"Raku"},{"code":"/*REXX program demonstrates how to update a configuration file (four specific tasks).*/\nparse arg iFID oFID . /*obtain optional arguments from the CL*/\nif iFID=='' | iFID==\",\" then iFID= 'UPDATECF.TXT' /*Not given? Then use default.*/\nif oFID=='' | oFID==\",\" then oFID='\\TEMP\\UPDATECF.$$$' /* \" \" \" \" \" */\ncall lineout iFID; call lineout oFID /*close the input and the output files.*/\n$.=0 /*placeholder of the options detected. */\ncall dos 'ERASE' oFID /*erase a file (with no error message).*/\nchanged=0 /*nothing changed in the file (so far).*/\n /* [↓] read the entire config file. */\n do rec=0 while lines(iFID)\\==0 /*read a record; bump the record count.*/\n z=linein(iFID); zz=space(z) /*get record; elide extraneous blanks.*/\n say '───────── record:' z /*echo the record just read ──► console*/\n a=left(zz,1); _=space( translate(zz, ,';') ) /*_: is used to elide multiple \";\" */\n if zz=='' | a=='#' then do; call cpy z; iterate; end /*blank or a comment.*/\n if _=='' then do; changed=1; iterate; end /*elide any semicolons; empty records.*/\n parse upper var z op . /*obtain the option from the record. */\n /* [↓] option may have leading or ···*/\n if a==';' then do; parse upper var z 2 op . /*trailing blanks.*/\n if op='SEEDSREMOVED' then call new space( substr(z, 2) )\n call cpy z; $.op=1 /*write the Z record to the output file*/\n iterate /*rec*/ /* ··· and then go read the next record*/\n end\n if $.op then do; changed=1; iterate; end /*is the option already defined? */\n $.op=1 /* [↑] Yes? Then delete it. */\n if op=='NEEDSPEELING' then call new \";\" z\n if op=='NUMBEROFBANANAS' then call new op 1024\n if op=='NUMBEROFSTRAWBERRIES' then call new op 62000\n call cpy z /*write the Z record to the output file*/\n end /*rec*/\n\n nos='NUMBEROFSTRAWBERRIES' /* [↓] Does NOS option need updating? */\nif \\$.nos then do; call new nos 62000; call cpy z; end /*update option.*/\ncall lineout iFID; call lineout oFID /*close the input and the output files.*/\nif rec==0 then do; say \"ERROR: input file wasn't found:\" iFID; exit; end\nif changed then do /*possibly overwrite the input file. */\n call dos 'XCOPY' oFID iFID '/y /q',\">nul\" /*quietly*/\n say; say center('output file', 79, \"▒\") /*title. */\n call dos 'TYPE' oFID /*display content of the output file. */\n end\ncall dos 'ERASE' oFID /*erase a file (with no error message).*/\nexit /*stick a fork in it, we're all done. */\n/*──────────────────────────────────────────────────────────────────────────────────────*/\ncpy: call lineout oFID, arg(1); return /*write one line of text ───► oFID. */\ndos: ''arg(1) word(arg(2) \"2>nul\",1); return /*execute a DOS command (quietly). */\nnew: z=arg(1); changed=1; return /*use new Z, indicate changed record. */\n","language":"REXX"},{"code":"fid='updatecf.txt'\noid='updatecf.xxx'; 'erase' oid\noptions=translate('FAVOURITEFRUIT NEEDSPEELING SEEDSREMOVED NUMBEROFBANANAS numberofstrawberries')\ndone.=0\nDo While lines(fid)>0\n l=linein(fid)\n c=left(l,1)\n option=''\n If c='#' | l='' Then\n call o l\n Else Do\n If c=';' Then l=substr(l,3)\n Parse Upper Var l option value\n Select\n When option='NEEDSPEELING' Then\n Call o ';' option\n When option='SEEDSREMOVED' Then\n Call o option\n When option='NUMBEROFBANANAS' Then\n Call o option 1024\n When option='FAVOURITEFRUIT' Then\n Call o l\n When option='NUMBEROFSTRAWBERRIES' Then\n Call o option 62000\n Otherwise\n Call o '>>>' l\n End\n End\n End\nDo while options<>''\n Parse Var options option options\n If done.option=0 Then\n Call o option 62000\n End\nExit\no:\nIf option<>'' & done.option Then\n Say 'Duplicate' option 'ignored'\nElse Do\n Call lineout oid,arg(1)\n done.option=1\n End\nReturn\n","language":"REXX"},{"code":"require 'stringio'\n\nclass ConfigFile\n\n # create a ConfigFile object from a file\n def self.file(filename)\n fh = File.open(filename)\n obj = self.new(fh)\n obj.filename = filename\n fh.close\n obj\n end\n\n # create a ConfigFile object from a string\n def self.data(string)\n fh = StringIO.new(string)\n obj = self.new(fh)\n fh.close\n obj\n end\n\n def initialize(filehandle)\n @lines = filehandle.readlines\n @filename = nil\n tidy_file\n end\n attr :filename\n\n def save()\n if @filename\n File.open(@filename, \"w\") {|f| f.write(self)}\n end\n end\n\n def tidy_file()\n @lines.map! do |line|\n # remove leading whitespace\n line.lstrip!\n\n if line.match(/^#/)\n # Lines beginning with hash symbols should not be manipulated and left\n # unchanged in the revised file.\n line\n else\n # replace double semicolon prefixes with just a single semicolon\n line.sub!(/^;+\\s+/, \"; \")\n\n if line.match(/^; \\s*$/)\n # Any lines beginning with a semicolon or groups of semicolons, but no\n # following option should be removed\n line = \"\"\n else\n # remove ... any trailing whitespace on the lines\n line = line.rstrip + \"\\n\"\n\n # Whitespace between the option and paramters should consist only of a\n # single space\n if m = line.match(/^(; )?([[:upper:]]+)\\s+(.*)/)\n line = (m[1].nil? ? \"\" : m[1]) + format_line(m[2], m[3])\n end\n end\n\n line\n end\n end\n end\n\n def format_line(option, value)\n \"%s%s\\n\" % [option.upcase.strip, value.nil? ? \"\" : \" \" + value.to_s.strip]\n end\n\n # returns the index of the option, or nil if not found\n def find_option(option)\n @lines.find_index {|line| line.match(/^#{option.upcase.strip}\\b/)}\n end\n\n # uncomments a disabled option\n def enable_option(option)\n if idx = find_option(\"; \" + option)\n @lines[idx][/^; /] = \"\"\n end\n end\n\n # comment a line with a semi-colon\n def disable_option(option)\n if idx = find_option(option)\n @lines[idx][/^/] = \"; \"\n end\n end\n\n # add an option, or change the value of an existing option.\n # use nil for the value to set a boolean option\n def set_value(option, value)\n if idx = find_option(option)\n @lines[idx] = format_line(option, value)\n else\n @lines << format_line(option, value)\n end\n end\n\n def to_s\n @lines.join('')\n end\nend\n\n\nconfig = ConfigFile.data(DATA.read)\nconfig.disable_option('needspeeling')\nconfig.enable_option('seedsremoved')\nconfig.set_value('numberofbananas', 1024)\nconfig.set_value('numberofstrawberries', 62000)\nputs config\n\n\n__END__\n# This is a configuration file in standard configuration file format\n#\n# Lines begininning with a hash or a semicolon are ignored by the application\n# program. Blank lines are also ignored by the application program.\n\n# The first word on each non comment line is the configuration option.\n# Remaining words or numbers on the line are configuration parameter\n# data fields.\n\n# Note that configuration option names are not case sensitive. However,\n# configuration parameter data is case sensitive and the lettercase must\n# be preserved.\n\n# This is a favourite fruit\nFAVOURITEFRUIT \t\tbanana\n\n# This is a boolean that should be set\n NEEDSPEELING\n\n# This boolean is commented out\n;;; SEEDSREMOVED\n;;;\n\n# How many bananas we have\nNUMBEROFBANANAS 48\n","language":"Ruby"},{"code":"package require Tcl 8.6\noo::class create Config {\n variable filename contents\n constructor fileName {\n\tset filename $fileName\n\tset contents {}\n\ttry {\n\t set f [open $filename]\n\t ### Sanitize during input\n\t foreach line [split [read $f] \\n] {\n\t\tif {[string match \"#*\" $line]} {\n\t\t lappend contents $line\n\t\t continue\n\t\t}\n\t\tif {[regexp {^;\\W*$} $line]} continue\n\t\tset line [string trim [regsub -all {[^\\u0020-\\u007e]} $line {}]]\n\t\tif {[regexp {^(\\W*)(\\w+)(.*)$} $line -> a b c]} {\n\t\t set line \"[regsub -all {^;+} $a {;}][string toupper $b]$c\"\n\t\t}\n\t\tlappend contents $line\n\t }\n\t} finally {\n\t if {[info exists f]} {\n\t\tclose $f\n\t }\n\t}\n }\n method save {} {\n\tset f [open $filename w]\n\tputs $f [join $contents \\n]\n\tclose $f\n }\n\n # Utility methods (not exposed API)\n method Transform {pattern vars replacement} {\n\tset matched 0\n\tset line -1\n\tset RE \"(?i)^$pattern$\"\n\tforeach l $contents {\n\t incr line\n\t if {[uplevel 1 [list regexp $RE $l -> {*}$vars]]} {\n\t\tif {$matched} {\n\t\t set contents [lreplace $contents $line $line]\n\t\t incr line -1\n\t\t} else {\n\t\t lset contents $line [uplevel 1 [list subst $replacement]]\n\t\t}\n\t\tset matched 1\n\t }\n\t}\n\treturn $matched\n }\n method Format {k v} {\n\tset v \" [string trimleft $v]\"\n\treturn \"[string toupper $k][string trimright $v]\"\n }\n\n # Public API for modifying options\n method enable {option} {\n\tif {![my Transform \";?\\\\s*($option)\\\\M\\s*(.*)\" {k v} \\\n\t\t {[my Format $k $v]}]} {\n\t lappend contents [my Format $option \"\"]\n\t}\n }\n method disable {option} {\n\tif {![my Transform \";?\\\\s*($option)\\\\M\\s*(.*)\" {k v} \\\n\t\t {; [my Format $k $v]}]} {\n\t lappend contents \"; [my Format $option \"\"]\"\n\t}\n }\n method set {option {value \"\"}} {\n\tif {![my Transform \";?\\\\s*($option)\\\\M.*\" k {[my Format $k $value]}]} {\n\t lappend contents [my Format $option $value]\n\t}\n }\n}\n","language":"Tcl"},{"code":"set cfg [Config new \"sample.cfg\"]\n$cfg disable needspeeling\n$cfg enable seedsremoved\n$cfg set numberofbananas 1024\n$cfg set numberofstrawberries 62000\n$cfg save\n","language":"Tcl"},{"code":"@(next :args)\n@configfile\n@(maybe)\n@ (next configfile)\n@ (collect :vars (config))\n@config\n@ (end)\n@(end)\n@(collect)\n@ (cases)\n@option=\n@ (output :into new_opt_line :filter :upcase)\n; @option\n@ (end)\n@ (or)\n@option=@val\n@ (output :into new_opt_line :filter :upcase)\n@option @val\n@ (end)\n@ (or)\n@option\n@ (output :into new_opt_line :filter :upcase)\n@option\n@ (end)\n@ (end)\n@ (next :var config)\n@ (local new_config)\n@ (bind new_config ())\n@ (collect :vars ((opt_there \"\")))\n@ (block)\n@ (cases)\n@ (cases)\n@{line /[ \\t]*/}\n@ (or)\n@{line /#.*/}\n@ (end)\n@ (output :append :into new_config)\n@line\n@ (end)\n@ (accept)\n@ (or)\n@ (maybe)\n; @opt_there\n@ (or)\n@opt_there @(skip)\n@ (or)\n@opt_there\n@ (or)\n@original_line\n@ (end)\n@ (end)\n@ (cases)\n@ (bind opt_there option :filter :upcase)\n@ (output :append :into new_config)\n@new_opt_line\n@ (end)\n@ (or)\n@ (output :append :into new_config)\n@original_line\n@ (end)\n@ (end)\n@ (end)\n@ (cases)\n@ (bind opt_there option :filter :upcase)\n@ (or)\n@ (output :append :into new_config)\n@new_opt_line\n@ (end)\n@ (end)\n@ (set config new_config)\n@(end)\n@(output)\n@ (repeat)\n@config\n@ (end)\n@(end)\n","language":"TXR"},{"code":"Set objFSO = CreateObject(\"Scripting.FileSystemObject\")\n\n'Paramater lookups\nSet objParamLookup = CreateObject(\"Scripting.Dictionary\")\nWith objParamLookup\n\t.Add \"FAVOURITEFRUIT\", \"banana\"\n\t.Add \"NEEDSPEELING\", \"\"\n\t.Add \"SEEDSREMOVED\", \"\"\n\t.Add \"NUMBEROFBANANAS\", \"1024\"\n\t.Add \"NUMBEROFSTRAWBERRIES\", \"62000\"\nEnd With\n\n'Open the config file for reading.\nSet objInFile = objFSO.OpenTextFile(objFSO.GetParentFolderName(WScript.ScriptFullName) &_\n\t\"\\IN_config.txt\",1)\n'Initialize output.\nOutput = \"\"\t\nIsnumberofstrawberries = False\nWith objInFile\n\tDo Until .AtEndOfStream\n\t\tline = .ReadLine\n\t\tIf Left(line,1) = \"#\" Or line = \"\" Then\n\t\t\tOutput = Output & line & vbCrLf\n\t\tElseIf Left(line,1) = \" \" And InStr(line,\"#\") Then\n\t\t\tOutput = Output & Mid(line,InStr(1,line,\"#\"),1000) & vbCrLf\n\t\tElseIf Replace(Replace(line,\";\",\"\"),\" \",\"\") <> \"\" Then\n\t\t\tIf InStr(1,line,\"FAVOURITEFRUIT\",1) Then\n\t\t\t\tOutput = Output & \"FAVOURITEFRUIT\" & \" \" & objParamLookup.Item(\"FAVOURITEFRUIT\") & vbCrLf\n\t\t\tElseIf InStr(1,line,\"NEEDSPEELING\",1) Then\n\t\t\t\tOutput = Output & \"; \" & \"NEEDSPEELING\" & vbCrLf\n\t\t\tElseIf InStr(1,line,\"SEEDSREMOVED\",1) Then\n\t\t\t\tOutput = Output & \"SEEDSREMOVED\" & vbCrLf\n\t\t\tElseIf InStr(1,line,\"NUMBEROFBANANAS\",1) Then\n\t\t\t\tOutput = Output & \"NUMBEROFBANANAS\" & \" \" & objParamLookup.Item(\"NUMBEROFBANANAS\") & vbCrLf\n\t\t\tElseIf InStr(1,line,\"NUMBEROFSTRAWBERRIES\",1) Then\n\t\t\t\tOutput = Output & \"NUMBEROFSTRAWBERRIES\" & \" \" & objParamLookup.Item(\"NUMBEROFSTRAWBERRIES\") & vbCrLf\n\t\t\t\tIsnumberofstrawberries = True\n\t\t\tEnd If\n\t\tEnd If\n\tLoop\n\tIf Isnumberofstrawberries = False Then\n\t\tOutput = Output & \"NUMBEROFSTRAWBERRIES\" & \" \" & objParamLookup.Item(\"NUMBEROFSTRAWBERRIES\") & vbCrLf\n\t\tIsnumberofstrawberries = True\n\tEnd If\n\t.Close\nEnd With\n\t\n'Create a new config file.\nSet objOutFile = objFSO.OpenTextFile(objFSO.GetParentFolderName(WScript.ScriptFullName) &_\n\t\"\\OUT_config.txt\",2,True)\nWith objOutFile\n\t.Write Output\n\t.Close\nEnd With\n\nSet objFSO = Nothing\nSet objParamLookup = Nothing\n","language":"VBScript"},{"code":"import \"io\" for File\nimport \"./ioutil\" for FileUtil\nimport \"./dynamic\" for Tuple\nimport \"./str\" for Str\n\nvar fields = [\"favouriteFruit\", \"needsPeeling\", \"seedsRemoved\", \"numberOfBananas\", \"numberOfStrawberries\"]\nvar ConfigData = Tuple.create(\"ConfigData\", fields)\n\nvar updateConfigFile = Fn.new { |fileName, cData|\n var lines = File.read(fileName).trimEnd().split(FileUtil.lineBreak)\n var tempFileName = \"temp_%(fileName)\"\n var out = File.create(tempFileName)\n var hadFruit = false\n var hadPeeling = false\n var hadSeeds = false\n var hadBananas = false\n var hadStrawberries = false\n\n for (line in lines) {\n var cont = false\n if (line.isEmpty || line[0] == \"#\") {\n out.writeBytes(line + \"\\n\")\n cont = true\n }\n if (!cont) {\n var ln = Str.upper(line.trimStart(\";\").trim())\n if (!ln.isEmpty) {\n if (ln.take(14).join() == \"FAVOURITEFRUIT\") {\n if (!hadFruit) {\n hadFruit = true\n out.writeBytes(\"FAVOURITEFRUIT %(cData.favouriteFruit)\\n\")\n }\n } else if (ln.take(12).join() == \"NEEDSPEELING\") {\n if (!hadPeeling) {\n hadPeeling = true\n if (cData.needsPeeling) {\n out.writeBytes(\"NEEDSPEELING\\n\")\n } else {\n out.writeBytes(\"; NEEDSPEELING\\n\")\n }\n }\n } else if (ln.take(12).join() == \"SEEDSREMOVED\") {\n if (!hadSeeds) {\n hadSeeds = true\n if (cData.seedsRemoved) {\n out.writeBytes(\"SEEDSREMOVED\\n\")\n } else {\n out.writeBytes(\"; SEEDSREMOVED\\n\")\n }\n }\n } else if (ln.take(15).join() == \"NUMBEROFBANANAS\") {\n if (!hadBananas) {\n hadBananas = true\n out.writeBytes(\"NUMBEROFBANANAS %(cData.numberOfBananas)\\n\")\n }\n } else if (ln.take(20).join() == \"NUMBEROFSTRAWBERRIES\") {\n if (!hadStrawberries) {\n hadStrawberries = true\n out.writeBytes(\"NUMBEROFSTRAWBERRIES %(cData.numberOfStrawberries)\\n\")\n }\n }\n }\n }\n }\n\n if (!hadFruit) {\n out.writeBytes(\"FAVOURITEFRUIT %(cData.favouriteFruit)\\n\")\n }\n\n if (!hadPeeling) {\n if (cData.needsPeeling) {\n out.writeBytes(\"NEEDSPEELING\\n\")\n } else {\n out.writeBytes(\"; NEEDSPEELING\\n\")\n }\n }\n\n if (!hadSeeds) {\n if (cData.seedsRemoved) {\n out.writeBytes(\"SEEDSREMOVED\\n\")\n } else {\n out.writeBytes(\"; SEEDSREMOVED\\n\")\n }\n }\n\n if (!hadBananas) {\n out.writeBytes(\"NUMBEROFBANANAS %(cData.numberOfBananas)\\n\")\n }\n\n if (!hadStrawberries) {\n out.writeBytes(\"NUMBEROFSTRAWBERRIES %(cData.numberOfStrawberries)\\n\")\n }\n\n out.close()\n FileUtil.move(tempFileName, fileName, true)\n}\n\nvar fileName = \"config.txt\"\nvar cData = ConfigData.new(\"banana\", false, true, 1024, 62000)\nupdateConfigFile.call(fileName, cData)\n","language":"Wren"}],"string":"[\n {\n \"code\": \"---\\nfrom: http://rosettacode.org/wiki/Update_a_configuration_file\\nnote: File handling\\n\",\n \"language\": \"00-META\"\n },\n {\n \"code\": \"We have a configuration file as follows:\\n\\n # This is a configuration file in standard configuration file format\\n #\\n # Lines begininning with a hash or a semicolon are ignored by the application\\n # program. Blank lines are also ignored by the application program.\\n \\n # The first word on each non comment line is the configuration option.\\n # Remaining words or numbers on the line are configuration parameter\\n # data fields.\\n \\n # Note that configuration option names are not case sensitive. However,\\n # configuration parameter data is case sensitive and the lettercase must\\n # be preserved.\\n \\n # This is a favourite fruit\\n FAVOURITEFRUIT banana\\n \\n # This is a boolean that should be set\\n NEEDSPEELING\\n \\n # This boolean is commented out\\n ; SEEDSREMOVED\\n \\n # How many bananas we have\\n NUMBEROFBANANAS 48\\n\\nThe task is to manipulate the configuration file as follows:\\n\\n* Disable the needspeeling option (using a semicolon prefix)\\n* Enable the seedsremoved option by removing the semicolon and any leading whitespace\\n* Change the numberofbananas parameter to 1024\\n* Enable (or create if it does not exist in the file) a parameter for numberofstrawberries with a value of 62000\\n\\n<br>\\nNote that configuration option names are not case sensitive. This means that changes should be effected, regardless of the case.\\n\\nOptions should always be disabled by prefixing them with a semicolon.\\n\\nLines beginning with hash symbols should not be manipulated and left unchanged in the revised file.\\n\\nIf a configuration option does not exist within the file (in either enabled or disabled form), it should be added during this update. Duplicate configuration option names in the file should be removed, leaving just the first entry.\\n\\nFor the purpose of this task, the revised file should contain appropriate entries, whether enabled or not for needspeeling,seedsremoved,numberofbananas and numberofstrawberries.)\\n\\nThe update should rewrite configuration option names in capital letters. However lines beginning with hashes and any parameter data must not be altered (eg the banana for favourite fruit must not become capitalized). The update process should also replace double semicolon prefixes with just a single semicolon (unless it is uncommenting the option, in which case it should remove all leading semicolons). \\n\\nAny lines beginning with a semicolon or groups of semicolons, but no following option should be removed, as should any leading or trailing whitespace on the lines. Whitespace between the option and parameters should consist only of a single\\nspace, and any non-ASCII extended characters, tabs characters, or control codes\\n(other than end of line markers), should also be removed.\\n\\n\\n;Related tasks\\n* [[Read a configuration file]]\\n<br><br>\\n\\n\",\n \"language\": \"00-TASK\"\n },\n {\n \"code\": \"T.enum EntryType\\n EMPTY\\n ENABLED\\n DISABLED\\n COMMENT\\n IGNORE\\n\\nT Entry\\n EntryType etype\\n String name\\n String value\\n\\n F (etype, name = ‘’, value = ‘’)\\n .etype = etype\\n .name = name\\n .value = value\\n\\nT Config\\n String path\\n [Entry] entries\\n\\n F (path)\\n .path = path\\n L(=line) File(path).read_lines()\\n line = line.ltrim(‘ ’)\\n I line.empty\\n .entries.append(Entry(EntryType.EMPTY))\\n E I line[0] == ‘#’\\n .entries.append(Entry(EntryType.COMMENT, line))\\n E\\n line = line.replace(re:‘[^a-zA-Z0-9\\\\x20;]’, ‘’)\\n V m = re:‘^(;*)\\\\s*([a-zA-Z0-9]+)\\\\s*([a-zA-Z0-9]*)’.search(line)\\n I m & !m.group(2).empty\\n V t = I m.group(1).empty {EntryType.ENABLED} E EntryType.DISABLED\\n .addOption(m.group(2), m.group(3), t)\\n\\n F enableOption(name)\\n Int? i = .getOptionIndex(name)\\n I i != N\\n .entries[i].etype = EntryType.ENABLED\\n\\n F disableOption(name)\\n Int? i = .getOptionIndex(name)\\n I i != N\\n .entries[i].etype = EntryType.DISABLED\\n\\n F setOption(name, value)\\n Int? i = .getOptionIndex(name)\\n I i != N\\n .entries[i].value = value\\n\\n F addOption(name, val, t = EntryType.ENABLED)\\n .entries.append(Entry(t, name.uppercase(), val))\\n\\n F removeOption(name)\\n Int? i = .getOptionIndex(name)\\n I i != N\\n .entries[i].etype = EntryType.IGNORE\\n\\n F getOptionIndex(name) -> Int?\\n L(e) .entries\\n I e.etype !C (EntryType.ENABLED, EntryType.DISABLED)\\n L.continue\\n I e.name == name.uppercase()\\n R L.index\\n R N\\n\\n F store()\\n V f = File(.path, WRITE)\\n L(e) .entries\\n I e.etype == EMPTY\\n f.write(\\\"\\\\n\\\")\\n E I e.etype == ENABLED\\n f.write(\\\"#. #.\\\\n\\\".format(e.name, e.value))\\n E I e.etype == DISABLED\\n f.write(\\\"; #. #.\\\\n\\\".format(e.name, e.value))\\n E I e.etype == COMMENT\\n f.write(e.name\\\"\\\\n\\\")\\n\\nV cfg = Config(‘config.txt’)\\ncfg.enableOption(‘seedsremoved’)\\ncfg.disableOption(‘needspeeling’)\\ncfg.setOption(‘numberofbananas’, ‘1024’)\\ncfg.addOption(‘numberofstrawberries’, ‘62000’)\\ncfg.store()\\n\",\n \"language\": \"11l\"\n },\n {\n \"code\": \"; Author: AlephX, Aug 17 2011\\ndata = %A_scriptdir%\\\\rosettaconfig.txt\\noutdata = %A_scriptdir%\\\\rosettaconfig.tmp\\nFileDelete, %outdata%\\n\\nNUMBEROFBANANAS := 1024\\nnumberofstrawberries := 560\\nNEEDSPEELING = \\\"0\\\"\\nFAVOURITEFRUIT := \\\"bananas\\\"\\nSEEDSREMOVED = \\\"1\\\"\\nBOOL0 = \\\"0\\\"\\nBOOL1 = \\\"1\\\"\\nNUMBER1 := 1\\nnumber0 := 0\\nSTRINGA := \\\"string here\\\"\\n\\nparameters = bool0|bool1|NUMBER1|number0|stringa|NEEDSPEELING|seedsremoved|numberofbananas|numberofstrawberries\\n\\nLoop, Read, %data%, %outdata%\\n\\t{\\n\\tif (instr(A_LoopReadLine, \\\"#\\\") == 1 OR A_LoopReadLine == \\\"\\\")\\n\\t\\t{\\n\\t\\tLine := A_LoopReadLine\\n\\t\\t}\\n\\telse\\n\\t\\t{\\n\\t\\tif instr(A_LoopReadLine, \\\";\\\") == 1\\n\\t\\t\\t{\\n\\t\\t\\tparameter := RegExReplace(Substr(A_LoopReadLine,2), \\\"^[ \\\\s]+|[ \\\\s]+$\\\", \\\"\\\")\\n\\n\\t\\t\\tparametervalue = %parameter%\\n\\t\\t\\tvalue := %parametervalue%\\n\\t\\t\\tif value == 0\\n\\t\\t\\t\\tLine := A_loopReadLine\\n\\t\\t\\telse\\n\\t\\t\\t\\tLine := Parameter\\n\\t\\t\\t}\\n\\t\\telse\\n\\t\\t\\t{\\n\\t\\t\\tparameter := RegExReplace(A_LoopReadLine, \\\"^[ \\\\s]+|[ \\\\s]+$\\\", \\\"\\\")\\n\\t\\t\\tif instr(parameter, A_Space)\\n\\t\\t\\t\\tparameter := substr(parameter, 1, instr(parameter, A_Space)-1)\\n\\t\\t\\t\\n\\t\\t\\tif instr(parameters, parameter) > 0\\n\\t\\t\\t\\t{\\n\\t\\t\\t\\tparametervalue = %parameter%\\n\\t\\t\\t\\tvalue := %parametervalue%\\n\\t\\t\\t\\t\\n\\t\\t\\t\\tif (value = chr(34) . \\\"0\\\" . chr(34))\\n\\t\\t\\t\\t\\tLine := \\\"; \\\" . Parameter\\n\\t\\t\\t\\telse\\t\\n\\t\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\tif (value = chr(34) . \\\"1\\\" . chr(34))\\n\\t\\t\\t\\t\\t\\tLine := Parameter\\n\\t\\t\\t\\t\\telse\\n\\t\\t\\t\\t\\t\\tLine = %parametervalue% %value%\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\telse\\n\\t\\t\\t\\tLine := A_LoopReadLine\\n\\t\\t\\t}\\n\\t\\t\\t\\n\\t\\t}\\n\\tStringReplace, parameters, parameters, %parametervalue%,,\\n\\tStringReplace, parameters, parameters,||,|\\n\\t\\n\\tFileAppend, %Line%`n\\n\\t}\\n\\nLoop, parse, parameters,|\\n\\t{\\n\\tif (A_Loopfield <> \\\"\\\")\\n\\t\\t{\\n\\t\\tStringUpper, parameter, A_LoopField\\n\\t\\tparametervalue = %parameter%\\n\\t\\tvalue := %parametervalue%\\n\\t\\t\\t\\t\\n\\t\\tif (value = chr(34) . \\\"0\\\" . chr(34))\\n\\t\\t\\tLine := \\\"; \\\" . parameter\\n\\t\\telse\\t\\n\\t\\t\\t{\\n\\t\\t\\tif (value = chr(34) . \\\"1\\\" . chr(34))\\n\\t\\t\\t\\tLine := parameter\\n\\t\\t\\telse\\n\\t\\t\\t\\tLine = %parametervalue% %value%\\n\\t\\t\\t}\\n\\t\\t\\t\\t\\n\\t\\tFileAppend, %Line%`n, %outdata%\\t\\t\\n\\t\\t}\\n\\t}\\n\\nFileCopy, %A_scriptdir%\\\\rosettaconfig.tmp, %A_scriptdir%\\\\rosettaconfig.txt, 1\\n\",\n \"language\": \"AutoHotkey\"\n },\n {\n \"code\": \"' ' ' ' ' ' ' ' ' ' ' ' ' ' ' ' ' ' ' ' ' ' ' ' ' ' '\\n' Read a Configuration File V1.0 '\\n' '\\n' Developed by A. David Garza Marín in VB-DOS for '\\n' RosettaCode. December 2, 2016. '\\n' ' ' ' ' ' ' ' ' ' ' ' ' ' ' ' ' ' ' ' ' ' ' ' ' ' '\\n\\n' OPTION EXPLICIT ' For VB-DOS, PDS 7.1\\n' OPTION _EXPLICIT ' For QB64\\n\\n' SUBs and FUNCTIONs\\nDECLARE SUB AppendCommentToConfFile (WhichFile AS STRING, WhichComment AS STRING, LeaveALine AS INTEGER)\\nDECLARE SUB setNValToVarArr (WhichVariable AS STRING, WhichIndex AS INTEGER, WhatValue AS DOUBLE)\\nDECLARE SUB setSValToVar (WhichVariable AS STRING, WhatValue AS STRING)\\nDECLARE SUB setSValToVarArr (WhichVariable AS STRING, WhichIndex AS INTEGER, WhatValue AS STRING)\\nDECLARE SUB doModifyArrValueFromConfFile (WhichFile AS STRING, WhichVariable AS STRING, WhichIndex AS INTEGER, WhatValue AS STRING, Separator AS STRING, ToComment AS INTEGER)\\nDECLARE SUB doModifyValueFromConfFile (WhichFile AS STRING, WhichVariable AS STRING, WhatValue AS STRING, Separator AS STRING, ToComment AS INTEGER)\\nDECLARE FUNCTION CreateConfFile% (WhichFile AS STRING)\\nDECLARE FUNCTION ErrorMessage$ (WhichError AS INTEGER)\\nDECLARE FUNCTION FileExists% (WhichFile AS STRING)\\nDECLARE FUNCTION FindVarPos% (WhichVariable AS STRING)\\nDECLARE FUNCTION FindVarPosArr% (WhichVariable AS STRING, WhichIndex AS INTEGER)\\nDECLARE FUNCTION getArrayVariable$ (WhichVariable AS STRING, WhichIndex AS INTEGER)\\nDECLARE FUNCTION getVariable$ (WhichVariable AS STRING)\\nDECLARE FUNCTION getVarType% (WhatValue AS STRING)\\nDECLARE FUNCTION GetDummyFile$ (WhichFile AS STRING)\\nDECLARE FUNCTION HowManyElementsInTheArray% (WhichVariable AS STRING)\\nDECLARE FUNCTION IsItAnArray% (WhichVariable AS STRING)\\nDECLARE FUNCTION IsItTheVariableImLookingFor% (TextToAnalyze AS STRING, WhichVariable AS STRING)\\nDECLARE FUNCTION NewValueForTheVariable$ (WhichVariable AS STRING, WhichIndex AS INTEGER, WhatValue AS STRING, Separator AS STRING)\\nDECLARE FUNCTION ReadConfFile% (NameOfConfFile AS STRING)\\nDECLARE FUNCTION YorN$ ()\\n\\n' Register for values located\\nTYPE regVarValue\\n VarName AS STRING * 20\\n VarType AS INTEGER ' 1=String, 2=Integer, 3=Real, 4=Comment\\n VarValue AS STRING * 30\\nEND TYPE\\n\\n' Var\\nDIM rVarValue() AS regVarValue, iErr AS INTEGER, i AS INTEGER, iHMV AS INTEGER\\nDIM iArrayElements AS INTEGER, iWhichElement AS INTEGER, iCommentStat AS INTEGER\\nDIM iAnArray AS INTEGER, iSave AS INTEGER\\nDIM otherfamily(1 TO 2) AS STRING\\nDIM sVar AS STRING, sVal AS STRING, sComment AS STRING\\nCONST ConfFileName = \\\"config2.fil\\\"\\nCONST False = 0, True = NOT False\\n\\n' ------------------- Main Program ------------------------\\nDO\\n CLS\\n ERASE rVarValue\\n PRINT \\\"This program reads a configuration file and shows the result.\\\"\\n PRINT\\n PRINT \\\"Default file name: \\\"; ConfFileName\\n PRINT\\n iErr = ReadConfFile(ConfFileName)\\n IF iErr = 0 THEN\\n iHMV = UBOUND(rVarValue)\\n PRINT \\\"Variables found in file:\\\"\\n FOR i = 1 TO iHMV\\n PRINT RTRIM$(rVarValue(i).VarName); \\\" = \\\"; RTRIM$(rVarValue(i).VarValue); \\\" (\\\";\\n SELECT CASE rVarValue(i).VarType\\n CASE 0: PRINT \\\"Undefined\\\";\\n CASE 1: PRINT \\\"String\\\";\\n CASE 2: PRINT \\\"Integer\\\";\\n CASE 3: PRINT \\\"Real\\\";\\n CASE 4: PRINT \\\"Is a commented variable\\\";\\n END SELECT\\n PRINT \\\")\\\"\\n NEXT i\\n PRINT\\n\\n INPUT \\\"Type the variable name to modify (Blank=End)\\\"; sVar\\n sVar = RTRIM$(LTRIM$(sVar))\\n IF LEN(sVar) > 0 THEN\\n i = FindVarPos%(sVar)\\n IF i > 0 THEN ' Variable found\\n iAnArray = IsItAnArray%(sVar)\\n IF iAnArray THEN\\n iArrayElements = HowManyElementsInTheArray%(sVar)\\n PRINT \\\"This is an array of\\\"; iArrayElements; \\\" elements.\\\"\\n INPUT \\\"Which one do you want to modify (Default=1)\\\"; iWhichElement\\n IF iWhichElement = 0 THEN iWhichElement = 1\\n ELSE\\n iArrayElements = 1\\n iWhichElement = 1\\n END IF\\n PRINT \\\"The current value of the variable is: \\\"\\n IF iAnArray THEN\\n PRINT sVar; \\\"(\\\"; iWhichElement; \\\") = \\\"; RTRIM$(rVarValue(i + (iWhichElement - 1)).VarValue)\\n ELSE\\n PRINT sVar; \\\" = \\\"; RTRIM$(rVarValue(i + (iWhichElement - 1)).VarValue)\\n END IF\\n ELSE\\n PRINT \\\"The variable was not found. It will be added.\\\"\\n END IF\\n PRINT\\n INPUT \\\"Please, set the new value for the variable (Blank=Unmodified)\\\"; sVal\\n sVal = RTRIM$(LTRIM$(sVal))\\n IF i > 0 THEN\\n IF rVarValue(i + (iWhichElement - 1)).VarType = 4 THEN\\n PRINT \\\"Do you want to remove the comment status to the variable? (Y/N)\\\"\\n iCommentStat = NOT (YorN = \\\"Y\\\")\\n iCommentStat = ABS(iCommentStat) ' Gets 0 (Toggle) or 1 (Leave unmodified)\\n iSave = (iCommentStat = 0)\\n ELSE\\n PRINT \\\"Do you want to toggle the variable as a comment? (Y/N)\\\"\\n iCommentStat = (YorN = \\\"Y\\\") ' Gets 0 (Uncommented) or -1 (Toggle as a Comment)\\n iSave = iCommentStat\\n END IF\\n END IF\\n\\n ' Now, update or add the variable to the conf file\\n IF i > 0 THEN\\n IF sVal = \\\"\\\" THEN\\n sVal = RTRIM$(rVarValue(i).VarValue)\\n END IF\\n ELSE\\n PRINT \\\"The variable will be added to the configuration file.\\\"\\n PRINT \\\"Do you want to add a remark for it? (Y/N)\\\"\\n IF YorN$ = \\\"Y\\\" THEN\\n LINE INPUT \\\"Please, write your remark: \\\", sComment\\n sComment = LTRIM$(RTRIM$(sComment))\\n IF sComment <> \\\"\\\" THEN\\n AppendCommentToConfFile ConfFileName, sComment, True\\n END IF\\n END IF\\n END IF\\n\\n ' Verifies if the variable will be modified, and applies the modification\\n IF sVal <> \\\"\\\" OR iSave THEN\\n IF iWhichElement > 1 THEN\\n setSValToVarArr sVar, iWhichElement, sVal\\n doModifyArrValueFromConfFile ConfFileName, sVar, iWhichElement, sVal, \\\" \\\", iCommentStat\\n ELSE\\n setSValToVar sVar, sVal\\n doModifyValueFromConfFile ConfFileName, sVar, sVal, \\\" \\\", iCommentStat\\n END IF\\n END IF\\n\\n END IF\\n ELSE\\n PRINT ErrorMessage$(iErr)\\n END IF\\n PRINT\\n PRINT \\\"Do you want to add or modify another variable? (Y/N)\\\"\\nLOOP UNTIL YorN$ = \\\"N\\\"\\n' --------- End of Main Program -----------------------\\nPRINT\\nPRINT \\\"End of program.\\\"\\nEND\\n\\nFileError:\\n iErr = ERR\\nRESUME NEXT\\n\\nSUB AppendCommentToConfFile (WhichFile AS STRING, WhichComment AS STRING, LeaveALine AS INTEGER)\\n ' Parameters:\\n ' WhichFile: Name of the file where a comment will be appended.\\n ' WhichComment: A comment. It is suggested to add a comment no larger than 75 characters.\\n ' This procedure adds a # at the beginning of the string if there is no #\\n ' sign on it in order to ensure it will be added as a comment.\\n\\n ' Var\\n DIM iFil AS INTEGER\\n\\n iFil = FileExists%(WhichFile)\\n IF NOT iFil THEN\\n iFil = CreateConfFile%(WhichFile) ' Here, iFil is used as dummy to save memory\\n END IF\\n\\n IF iFil THEN ' Everything is Ok\\n iFil = FREEFILE ' Now, iFil is used to be the ID of the file\\n WhichComment = LTRIM$(RTRIM$(WhichComment))\\n\\n IF LEFT$(WhichComment, 1) <> \\\"#\\\" THEN ' Is it in comment format?\\n WhichComment = \\\"# \\\" + WhichComment\\n END IF\\n\\n ' Append the comment to the file\\n OPEN WhichFile FOR APPEND AS #iFil\\n IF LeaveALine THEN\\n PRINT #iFil, \\\"\\\"\\n END IF\\n PRINT #iFil, WhichComment\\n CLOSE #iFil\\n END IF\\n\\nEND SUB\\n\\nFUNCTION CreateConfFile% (WhichFile AS STRING)\\n ' Var\\n DIM iFile AS INTEGER\\n\\n ON ERROR GOTO FileError\\n\\n iFile = FREEFILE\\n OPEN WhichFile FOR OUTPUT AS #iFile\\n CLOSE iFile\\n\\n ON ERROR GOTO 0\\n\\n CreateConfFile = FileExists%(WhichFile)\\nEND FUNCTION\\n\\nSUB doModifyArrValueFromConfFile (WhichFile AS STRING, WhichVariable AS STRING, WhichIndex AS INTEGER, WhatValue AS STRING, Separator AS STRING, ToComment AS INTEGER)\\n ' Parameters:\\n ' WhichFile: The name of the Configuration File. It can include the full path.\\n ' WhichVariable: The name of the variable to be modified or added to the conf file.\\n ' WhichIndex: The index number of the element to be modified in a matrix (Default=1)\\n ' WhatValue: The new value to set in the variable specified in WhichVariable.\\n ' Separator: The separator between the variable name and its value in the conf file. Defaults to a space \\\" \\\".\\n ' ToComment: A value to set or remove the comment mode of a variable: -1=Toggle to Comment, 0=Toggle to not comment, 1=Leave as it is.\\n\\n ' Var\\n DIM iFile AS INTEGER, iFile2 AS INTEGER, iError AS INTEGER\\n DIM iMod AS INTEGER, iIsComment AS INTEGER\\n DIM sLine AS STRING, sDummyFile AS STRING, sChar AS STRING\\n\\n ' If conf file doesn't exists, create one.\\n iError = 0\\n iMod = 0\\n IF NOT FileExists%(WhichFile) THEN\\n iError = CreateConfFile%(WhichFile)\\n END IF\\n\\n IF NOT iError THEN ' File exists or it was created\\n Separator = RTRIM$(LTRIM$(Separator))\\n IF Separator = \\\"\\\" THEN\\n Separator = \\\" \\\" ' Defaults to Space\\n END IF\\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 ' Goes through the file to find the variable\\n DO WHILE NOT EOF(iFile)\\n LINE INPUT #iFile, sLine\\n sLine = RTRIM$(LTRIM$(sLine))\\n sChar = LEFT$(sLine, 1)\\n iIsComment = (sChar = \\\";\\\")\\n IF iIsComment THEN ' Variable is commented\\n sLine = LTRIM$(MID$(sLine, 2))\\n END IF\\n\\n IF sChar <> \\\"#\\\" AND LEN(sLine) > 0 THEN ' Is not a comment?\\n IF IsItTheVariableImLookingFor%(sLine, WhichVariable) THEN\\n sLine = NewValueForTheVariable$(WhichVariable, WhichIndex, WhatValue, Separator)\\n iMod = True\\n IF ToComment = True THEN\\n sLine = \\\"; \\\" + sLine\\n END IF\\n ELSEIF iIsComment THEN\\n sLine = \\\"; \\\" + sLine\\n END IF\\n\\n END IF\\n\\n PRINT #iFile2, sLine\\n LOOP\\n\\n ' Reviews if a modification was done, if not, then it will\\n ' add the variable to the file.\\n IF NOT iMod THEN\\n sLine = NewValueForTheVariable$(WhichVariable, 1, WhatValue, Separator)\\n PRINT #iFile2, sLine\\n END IF\\n CLOSE iFile2, iFile\\n\\n ' Removes the conf file and sets the dummy file as the conf file\\n KILL WhichFile\\n NAME sDummyFile AS WhichFile\\n END IF\\n\\nEND SUB\\n\\nSUB doModifyValueFromConfFile (WhichFile AS STRING, WhichVariable AS STRING, WhatValue AS STRING, Separator AS STRING, ToComment AS INTEGER)\\n ' To see details of parameters, please see doModifyArrValueFromConfFile\\n doModifyArrValueFromConfFile WhichFile, WhichVariable, 1, WhatValue, Separator, ToComment\\nEND SUB\\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.\\\"\\n CASE 1: sError = \\\"Configuration file doesn't exist.\\\"\\n CASE 2: sError = \\\"There are no variables in the given file.\\\"\\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 FindVarPos% (WhichVariable AS STRING)\\n ' Will find the position of the variable\\n FindVarPos% = FindVarPosArr%(WhichVariable, 1)\\nEND FUNCTION\\n\\nFUNCTION FindVarPosArr% (WhichVariable AS STRING, WhichIndex AS INTEGER)\\n ' Var\\n DIM i AS INTEGER, iHMV AS INTEGER, iCount AS INTEGER, iPos AS INTEGER\\n DIM sVar AS STRING, sVal AS STRING, sWV AS STRING\\n SHARED rVarValue() AS regVarValue\\n\\n ' Looks for a variable name and returns its position\\n iHMV = UBOUND(rVarValue)\\n sWV = UCASE$(LTRIM$(RTRIM$(WhichVariable)))\\n sVal = \\\"\\\"\\n iCount = 0\\n DO\\n i = i + 1\\n sVar = UCASE$(RTRIM$(rVarValue(i).VarName))\\n IF sVar = sWV THEN\\n iCount = iCount + 1\\n IF iCount = WhichIndex THEN\\n iPos = i\\n END IF\\n END IF\\n LOOP UNTIL i >= iHMV OR iPos > 0\\n\\n FindVarPosArr% = iPos\\nEND FUNCTION\\n\\nFUNCTION getArrayVariable$ (WhichVariable AS STRING, WhichIndex AS INTEGER)\\n ' Var\\n DIM i AS INTEGER\\n DIM sVal AS STRING\\n SHARED rVarValue() AS regVarValue\\n\\n i = FindVarPosArr%(WhichVariable, WhichIndex)\\n sVal = \\\"\\\"\\n IF i > 0 THEN\\n sVal = RTRIM$(rVarValue(i).VarValue)\\n END IF\\n\\n ' Found it or not, it will return the result.\\n ' If the result is \\\"\\\" then it didn't found the requested variable.\\n getArrayVariable$ = sVal\\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 getVariable$ (WhichVariable AS STRING)\\n ' Var\\n DIM i AS INTEGER, iHMV AS INTEGER\\n DIM sVal AS STRING\\n\\n ' For a single variable, looks in the first (and only)\\n ' element of the array that contains the name requested.\\n sVal = getArrayVariable$(WhichVariable, 1)\\n\\n getVariable$ = sVal\\nEND FUNCTION\\n\\nFUNCTION getVarType% (WhatValue AS STRING)\\n ' Var\\n DIM sValue AS STRING, dValue AS DOUBLE, iType AS INTEGER\\n\\n sValue = RTRIM$(WhatValue)\\n iType = 0\\n IF LEN(sValue) > 0 THEN\\n IF ASC(LEFT$(sValue, 1)) < 48 OR ASC(LEFT$(sValue, 1)) > 57 THEN\\n iType = 1 ' String\\n ELSE\\n dValue = VAL(sValue)\\n IF CLNG(dValue) = dValue THEN\\n iType = 2 ' Integer\\n ELSE\\n iType = 3 ' Real\\n END IF\\n END IF\\n END IF\\n\\n getVarType% = iType\\nEND FUNCTION\\n\\nFUNCTION HowManyElementsInTheArray% (WhichVariable AS STRING)\\n ' Var\\n DIM i AS INTEGER, iHMV AS INTEGER, iCount AS INTEGER, iPos AS INTEGER, iQuit AS INTEGER\\n DIM sVar AS STRING, sVal AS STRING, sWV AS STRING\\n SHARED rVarValue() AS regVarValue\\n\\n ' Looks for a variable name and returns its value\\n iHMV = UBOUND(rVarValue)\\n sWV = UCASE$(LTRIM$(RTRIM$(WhichVariable)))\\n sVal = \\\"\\\"\\n\\n ' Look for all instances of WhichVariable in the\\n ' list. This is because elements of an array will not alwasy\\n ' be one after another, but alternate.\\n FOR i = 1 TO iHMV\\n sVar = UCASE$(RTRIM$(rVarValue(i).VarName))\\n IF sVar = sWV THEN\\n iCount = iCount + 1\\n END IF\\n NEXT i\\n\\n HowManyElementsInTheArray = iCount\\nEND FUNCTION\\n\\nFUNCTION IsItAnArray% (WhichVariable AS STRING)\\n ' Returns if a Variable is an Array\\n IsItAnArray% = (HowManyElementsInTheArray%(WhichVariable) > 1)\\n\\nEND FUNCTION\\n\\nFUNCTION IsItTheVariableImLookingFor% (TextToAnalyze AS STRING, WhichVariable AS STRING)\\n ' Var\\n DIM sVar AS STRING, sDT AS STRING, sDV AS STRING\\n DIM iSep AS INTEGER\\n\\n sDT = UCASE$(RTRIM$(LTRIM$(TextToAnalyze)))\\n sDV = UCASE$(RTRIM$(LTRIM$(WhichVariable)))\\n iSep = INSTR(sDT, \\\"=\\\")\\n IF iSep = 0 THEN iSep = INSTR(sDT, \\\" \\\")\\n IF iSep > 0 THEN\\n sVar = RTRIM$(LEFT$(sDT, iSep - 1))\\n ELSE\\n sVar = sDT\\n END IF\\n\\n ' It will return True or False\\n IsItTheVariableImLookingFor% = (sVar = sDV)\\nEND FUNCTION\\n\\nFUNCTION NewValueForTheVariable$ (WhichVariable AS STRING, WhichIndex AS INTEGER, WhatValue AS STRING, Separator AS STRING)\\n ' Var\\n DIM iItem AS INTEGER, iItems AS INTEGER, iFirstItem AS INTEGER\\n DIM i AS INTEGER, iCount AS INTEGER, iHMV AS INTEGER\\n DIM sLine AS STRING, sVar AS STRING, sVar2 AS STRING\\n SHARED rVarValue() AS regVarValue\\n\\n IF IsItAnArray%(WhichVariable) THEN\\n iItems = HowManyElementsInTheArray(WhichVariable)\\n iFirstItem = FindVarPosArr%(WhichVariable, 1)\\n ELSE\\n iItems = 1\\n iFirstItem = FindVarPos%(WhichVariable)\\n END IF\\n iItem = FindVarPosArr%(WhichVariable, WhichIndex)\\n sLine = \\\"\\\"\\n sVar = UCASE$(WhichVariable)\\n iHMV = UBOUND(rVarValue)\\n\\n IF iItem > 0 THEN\\n i = iFirstItem\\n DO\\n sVar2 = UCASE$(RTRIM$(rVarValue(i).VarName))\\n\\n IF sVar = sVar2 THEN ' Does it found an element of the array?\\n iCount = iCount + 1\\n IF LEN(sLine) > 0 THEN ' Add a comma\\n sLine = sLine + \\\", \\\"\\n END IF\\n IF i = iItem THEN\\n sLine = sLine + WhatValue\\n ELSE\\n sLine = sLine + RTRIM$(rVarValue(i).VarValue)\\n END IF\\n END IF\\n i = i + 1\\n LOOP UNTIL i > iHMV OR iCount = iItems\\n\\n sLine = WhichVariable + Separator + sLine\\n ELSE\\n sLine = WhichVariable + Separator + WhatValue\\n END IF\\n\\n NewValueForTheVariable$ = sLine\\nEND FUNCTION\\n\\nFUNCTION ReadConfFile% (NameOfConfFile AS STRING)\\n ' Var\\n DIM iFile AS INTEGER, iType AS INTEGER, iVar AS INTEGER, iHMV AS INTEGER\\n DIM iVal AS INTEGER, iCurVar AS INTEGER, i AS INTEGER, iErr AS INTEGER\\n DIM dValue AS DOUBLE, iIsComment AS INTEGER\\n DIM sLine AS STRING, sVar AS STRING, sValue AS STRING\\n SHARED rVarValue() AS regVarValue\\n\\n ' This procedure reads a configuration file with variables\\n ' and values separated by the equal sign (=) or a space.\\n ' It needs the FileExists% function.\\n ' Lines begining with # or blank will be ignored.\\n IF FileExists%(NameOfConfFile) THEN\\n iFile = FREEFILE\\n REDIM rVarValue(1 TO 10) AS regVarValue\\n OPEN NameOfConfFile FOR INPUT AS #iFile\\n WHILE NOT EOF(iFile)\\n LINE INPUT #iFile, sLine\\n sLine = RTRIM$(LTRIM$(sLine))\\n IF LEN(sLine) > 0 THEN ' Does it have any content?\\n IF LEFT$(sLine, 1) <> \\\"#\\\" THEN ' Is not a comment?\\n iIsComment = (LEFT$(sLine, 1) = \\\";\\\")\\n IF iIsComment THEN ' It is a commented variable\\n sLine = LTRIM$(MID$(sLine, 2))\\n END IF\\n iVar = INSTR(sLine, \\\"=\\\") ' Is there an equal sign?\\n IF iVar = 0 THEN iVar = INSTR(sLine, \\\" \\\") ' if not then is there a space?\\n\\n GOSUB AddASpaceForAVariable\\n iCurVar = iHMV\\n IF iVar > 0 THEN ' Is a variable and a value\\n rVarValue(iHMV).VarName = LEFT$(sLine, iVar - 1)\\n ELSE ' Is just a variable name\\n rVarValue(iHMV).VarName = sLine\\n rVarValue(iHMV).VarValue = \\\"\\\"\\n END IF\\n\\n IF iVar > 0 THEN ' Get the value(s)\\n sLine = LTRIM$(MID$(sLine, iVar + 1))\\n DO ' Look for commas\\n iVal = INSTR(sLine, \\\",\\\")\\n IF iVal > 0 THEN ' There is a comma\\n rVarValue(iHMV).VarValue = RTRIM$(LEFT$(sLine, iVal - 1))\\n GOSUB AddASpaceForAVariable\\n rVarValue(iHMV).VarName = rVarValue(iHMV - 1).VarName ' Repeats the variable name\\n sLine = LTRIM$(MID$(sLine, iVal + 1))\\n END IF\\n LOOP UNTIL iVal = 0\\n rVarValue(iHMV).VarValue = sLine\\n\\n END IF\\n\\n ' Determine the variable type of each variable found in this step\\n FOR i = iCurVar TO iHMV\\n IF iIsComment THEN\\n rVarValue(i).VarType = 4 ' Is a comment\\n ELSE\\n GOSUB DetermineVariableType\\n END IF\\n NEXT i\\n\\n END IF\\n END IF\\n WEND\\n CLOSE iFile\\n IF iHMV > 0 THEN\\n REDIM PRESERVE rVarValue(1 TO iHMV) AS regVarValue\\n iErr = 0 ' Everything ran ok.\\n ELSE\\n REDIM rVarValue(1 TO 1) AS regVarValue\\n iErr = 2 ' No variables found in configuration file\\n END IF\\n ELSE\\n iErr = 1 ' File doesn't exist\\n END IF\\n\\n ReadConfFile = iErr\\n\\nEXIT FUNCTION\\n\\nAddASpaceForAVariable:\\n iHMV = iHMV + 1\\n\\n IF UBOUND(rVarValue) < iHMV THEN ' Are there space for a new one?\\n REDIM PRESERVE rVarValue(1 TO iHMV + 9) AS regVarValue\\n END IF\\nRETURN\\n\\nDetermineVariableType:\\n sValue = RTRIM$(rVarValue(i).VarValue)\\n IF LEN(sValue) > 0 THEN\\n IF ASC(LEFT$(sValue, 1)) < 48 OR ASC(LEFT$(sValue, 1)) > 57 THEN\\n rVarValue(i).VarType = 1 ' String\\n ELSE\\n dValue = VAL(sValue)\\n IF CLNG(dValue) = dValue THEN\\n rVarValue(i).VarType = 2 ' Integer\\n ELSE\\n rVarValue(i).VarType = 3 ' Real\\n END IF\\n END IF\\n END IF\\nRETURN\\n\\nEND FUNCTION\\n\\nSUB setNValToVar (WhichVariable AS STRING, WhatValue AS DOUBLE)\\n ' Sets a numeric value to a variable\\n setNValToVarArr WhichVariable, 1, WhatValue\\nEND SUB\\n\\nSUB setNValToVarArr (WhichVariable AS STRING, WhichIndex AS INTEGER, WhatValue AS DOUBLE)\\n ' Sets a numeric value to a variable array\\n ' Var\\n DIM sVal AS STRING\\n sVal = FORMAT$(WhatValue)\\n setSValToVarArr WhichVariable, WhichIndex, sVal\\nEND SUB\\n\\nSUB setSValToVar (WhichVariable AS STRING, WhatValue AS STRING)\\n ' Sets a string value to a variable\\n setSValToVarArr WhichVariable, 1, WhatValue\\nEND SUB\\n\\nSUB setSValToVarArr (WhichVariable AS STRING, WhichIndex AS INTEGER, WhatValue AS STRING)\\n ' Sets a string value to a variable array\\n ' Var\\n DIM i AS INTEGER\\n DIM sVar AS STRING\\n SHARED rVarValue() AS regVarValue\\n\\n i = FindVarPosArr%(WhichVariable, WhichIndex)\\n IF i = 0 THEN ' Should add the variable\\n IF UBOUND(rVarValue) > 0 THEN\\n sVar = RTRIM$(rVarValue(1).VarName)\\n IF sVar <> \\\"\\\" THEN\\n i = UBOUND(rVarValue) + 1\\n REDIM PRESERVE rVarValue(1 TO i) AS regVarValue\\n ELSE\\n i = 1\\n END IF\\n ELSE\\n REDIM rVarValue(1 TO i) AS regVarValue\\n END IF\\n rVarValue(i).VarName = WhichVariable\\n END IF\\n\\n ' Sets the new value to the variable\\n rVarValue(i).VarValue = WhatValue\\n rVarValue(i).VarType = getVarType%(WhatValue)\\nEND SUB\\n\\nFUNCTION YorN$ ()\\n ' Var\\n DIM sYorN AS STRING\\n\\n DO\\n sYorN = UCASE$(INPUT$(1))\\n IF INSTR(\\\"YN\\\", sYorN) = 0 THEN\\n BEEP\\n END IF\\n LOOP UNTIL sYorN = \\\"Y\\\" OR sYorN = \\\"N\\\"\\n\\n YorN$ = sYorN\\nEND FUNCTION\\n\",\n \"language\": \"BASIC\"\n },\n {\n \"code\": \"#include <stdio.h>\\n#include <stdlib.h>\\n#include <string.h>\\n\\n#define strcomp(X, Y) strcasecmp(X, Y)\\n\\nstruct option\\n{ const char *name, *value;\\n int flag; };\\n\\n/* TODO: dynamically obtain these */\\nstruct option updlist[] =\\n{ { \\\"NEEDSPEELING\\\", NULL },\\n { \\\"SEEDSREMOVED\\\", \\\"\\\" },\\n { \\\"NUMBEROFBANANAS\\\", \\\"1024\\\" },\\n { \\\"NUMBEROFSTRAWBERRIES\\\", \\\"62000\\\" },\\n { NULL, NULL } };\\n\\nint output_opt(FILE *to, struct option *opt)\\n{ if (opt->value == NULL)\\n return fprintf(to, \\\"; %s\\\\n\\\", opt->name);\\n else if (opt->value[0] == 0)\\n return fprintf(to, \\\"%s\\\\n\\\", opt->name);\\n else\\n return fprintf(to, \\\"%s %s\\\\n\\\", opt->name, opt->value); }\\n\\nint update(FILE *from, FILE *to, struct option *updlist)\\n{ char line_buf[256], opt_name[128];\\n int i;\\n for (;;)\\n { size_t len, space_span, span_to_hash;\\n if (fgets(line_buf, sizeof line_buf, from) == NULL)\\n break;\\n len = strlen(line_buf);\\n space_span = strspn(line_buf, \\\"\\\\t \\\");\\n span_to_hash = strcspn(line_buf, \\\"#\\\");\\n if (space_span == span_to_hash)\\n goto line_out;\\n if (space_span == len)\\n goto line_out;\\n if ((sscanf(line_buf, \\\"; %127s\\\", opt_name) == 1) ||\\n (sscanf(line_buf, \\\"%127s\\\", opt_name) == 1))\\n { int flag = 0;\\n for (i = 0; updlist[i].name; i++)\\n { if (strcomp(updlist[i].name, opt_name) == 0)\\n { if (output_opt(to, &updlist[i]) < 0)\\n return -1;\\n updlist[i].flag = 1;\\n flag = 1; } }\\n if (flag == 0)\\n goto line_out; }\\n else\\n line_out:\\n if (fprintf(to, \\\"%s\\\", line_buf) < 0)\\n return -1;\\n continue; }\\n { for (i = 0; updlist[i].name; i++)\\n { if (!updlist[i].flag)\\n if (output_opt(to, &updlist[i]) < 0)\\n return -1; } }\\n return feof(from) ? 0 : -1; }\\n\\nint main(void)\\n{ if (update(stdin, stdout, updlist) < 0)\\n { fprintf(stderr, \\\"failed\\\\n\\\");\\n return (EXIT_FAILURE); }\\n return 0; }\\n\",\n \"language\": \"C\"\n },\n {\n \"code\": \"import std.stdio, std.file, std.string, std.regex, std.path,\\n std.typecons;\\n\\nfinal class Config {\\n enum EntryType { empty, enabled, disabled, comment, ignore }\\n\\n static protected struct Entry {\\n EntryType type;\\n string name, value;\\n }\\n protected Entry[] entries;\\n protected string path;\\n\\n this(in string path) {\\n if (!isValidPath(path) || (exists(path) && !isFile(path)))\\n throw new Exception(\\\"Invalid filename\\\");\\n\\n this.path = path;\\n if (!exists(path))\\n return;\\n\\n auto r = regex(r\\\"^(;*)\\\\s*([A-Z0-9]+)\\\\s*([A-Z0-9]*)\\\", \\\"i\\\");\\n auto f = File(path, \\\"r\\\");\\n foreach (const buf; f.byLine()) {\\n auto line = buf.strip().idup;\\n if (!line.length)\\n entries ~= Entry(EntryType.empty);\\n else if (line[0] == '#')\\n entries ~= Entry(EntryType.comment, line);\\n else {\\n line = line.removechars(\\\"^a-zA-Z0-9\\\\x20;\\\");\\n auto m = match(line, r);\\n if (!m.empty && m.front[2].length) {\\n EntryType t = EntryType.enabled;\\n if (m.front[1].length)\\n t = EntryType.disabled;\\n addOption(m.front[2], m.front[3], t);\\n }\\n }\\n }\\n }\\n\\n void enableOption(in string name) pure {\\n immutable i = getOptionIndex(name);\\n if (!i.isNull)\\n entries[i].type = EntryType.enabled;\\n }\\n\\n void disableOption(in string name) pure {\\n immutable i = getOptionIndex(name);\\n if (!i.isNull)\\n entries[i].type = EntryType.disabled;\\n }\\n\\n void setOption(in string name, in string value) pure {\\n immutable i = getOptionIndex(name);\\n if (!i.isNull)\\n entries[i].value = value;\\n }\\n\\n void addOption(in string name, in string val,\\n in EntryType t = EntryType.enabled) pure {\\n entries ~= Entry(t, name.toUpper(), val);\\n }\\n\\n void removeOption(in string name) pure {\\n immutable i = getOptionIndex(name);\\n if (!i.isNull)\\n entries[i].type = EntryType.ignore;\\n }\\n\\n Nullable!size_t getOptionIndex(in string name) const pure {\\n foreach (immutable i, const ref e; entries) {\\n if (e.type != EntryType.enabled &&\\n e.type != EntryType.disabled)\\n continue;\\n if (e.name == name.toUpper())\\n return typeof(return)(i);\\n }\\n return typeof(return).init;\\n }\\n\\n void store() {\\n auto f = File(path, \\\"w+\\\");\\n foreach (immutable e; entries) {\\n final switch (e.type) {\\n case EntryType.empty:\\n f.writeln();\\n break;\\n case EntryType.enabled:\\n f.writefln(\\\"%s %s\\\", e.name, e.value);\\n break;\\n case EntryType.disabled:\\n f.writefln(\\\"; %s %s\\\", e.name, e.value);\\n break;\\n case EntryType.comment:\\n f.writeln(e.name);\\n break;\\n case EntryType.ignore:\\n continue;\\n }\\n }\\n }\\n}\\n\\nvoid main() {\\n auto cfg = new Config(\\\"config.txt\\\");\\n cfg.enableOption(\\\"seedsremoved\\\");\\n cfg.disableOption(\\\"needspeeling\\\");\\n cfg.setOption(\\\"numberofbananas\\\", \\\"1024\\\");\\n cfg.addOption(\\\"numberofstrawberries\\\", \\\"62000\\\");\\n cfg.store();\\n}\\n\",\n \"language\": \"D\"\n },\n {\n \"code\": \"program uConfigFile;\\n\\n{$APPTYPE CONSOLE}\\n\\nuses\\n System.SysUtils,\\n uSettings;\\n\\nconst\\n FileName = 'uConf.txt';\\n\\nvar\\n Settings: TSettings;\\n\\nprocedure show(key: string; value: string);\\nbegin\\n writeln(format('%14s = %s', [key, value]));\\nend;\\n\\nbegin\\n Settings := TSettings.Create;\\n Settings.LoadFromFile(FileName);\\n Settings['NEEDSPEELING'] := False;\\n Settings['SEEDSREMOVED'] := True;\\n Settings['NUMBEROFBANANAS'] := 1024;\\n Settings['numberofstrawberries'] := 62000;\\n\\n for var k in Settings.Keys do\\n show(k, Settings[k]);\\n Settings.SaveToFile(FileName);\\n Settings.Free;\\n Readln;\\nend.\\n\",\n \"language\": \"Delphi\"\n },\n {\n \"code\": \"-module( update_configuration_file ).\\n\\n-export( [add/3, change/3, disable/2, enable/2, read/1, task/0, write/2] ).\\n\\nadd( Option, Value, Lines ) ->\\n\\tUpper = string:to_upper( Option ),\\n\\t[string:join( [Upper, Value], \\\" \\\" ) | Lines].\\n\\nchange( Option, Value, Lines ) ->\\n\\tUpper = string:to_upper( Option ),\\n\\tchange_done( Option, Value, Lines, [change_option(Upper, Value, X) || X <- Lines] ).\\n\\ndisable( Option, Lines ) ->\\n\\tUpper = string:to_upper( Option ),\\n\\t[disable_option(Upper, X) || X <- Lines].\\n\\nenable( Option, Lines ) ->\\n\\tUpper = string:to_upper( Option ),\\n\\t[enable_option(Upper, X) || X <- Lines].\\n\\nread( Name ) ->\\n\\t{ok, Binary} = file:read_file( Name ),\\n\\tLines = [binary:bin_to_list(X) || X <- binary:split( Binary, <<\\\"\\\\n\\\">>, [global] )],\\n\\tLines_no_white = [string:strip(X) || X <- Lines],\\n\\tLines_no_control = [strip_control(X) || X <- Lines_no_white],\\n\\tLines_no_consecutive_space = [string:join(string:tokens(X, \\\" \\\"), \\\" \\\") || X <- Lines_no_control],\\n\\tLines_no_consecutive_semicolon = [strip_semicolon(X) || X <- Lines_no_consecutive_space],\\n\\tLines_no_empty = lists:filter( fun strip_empty/1, Lines_no_consecutive_semicolon ),\\n\\tLines_upper = [to_upper(X) || X <- Lines_no_empty],\\n\\tlists:reverse( lists:foldl(fun remove_duplicates/2, [], Lines_upper) ).\\n\\ntask() ->\\n\\tLines = read( \\\"priv/configuration_file2\\\" ),\\n\\tDisabled_lines = disable( \\\"needspeeling\\\", Lines ),\\n\\tEnabled_lines = enable( \\\"SEEDSREMOVED\\\", Disabled_lines ),\\n\\tChanged_lines1 = change( \\\"NUMBEROFBANANAS\\\", \\\"1024\\\", Enabled_lines ),\\n\\tChanged_lines2 = change( \\\"numberofstrawberries\\\", \\\"62000\\\", Changed_lines1 ),\\n\\twrite( \\\"configuration_file\\\", Changed_lines2 ),\\n\\t[io:fwrite( \\\"Wrote this line: ~s~n\\\", [X]) || X <- Changed_lines2].\\n\\nwrite( Name, Lines ) -> file:write_file( Name, binary:list_to_bin(string:join(Lines, \\\"\\\\n\\\")) ).\\n\\n\\n\\nchange_done( Option, Value, Lines, Lines ) -> add( Option, Value, Lines );\\nchange_done( _Option, _Value, _Lines, New_lines ) -> New_lines.\\n\\nchange_option( Option, Value, String ) -> change_option_same( string:str(String, Option), Value, String ).\\n\\nchange_option_same( 1, Value, String ) ->\\n\\t[Option | _T] = string:tokens( String, \\\" \\\" ),\\n\\tstring:join( [Option, Value], \\\" \\\" );\\nchange_option_same( _N, _Value, String ) -> String.\\n\\ndisable_option( Option, String ) -> disable_option_same( string:str(String, Option), String ).\\n\\ndisable_option_same( 1, String ) -> \\\"; \\\" ++ String;\\ndisable_option_same( _N, String ) -> String.\\n\\nenable_option( Option, String ) -> enable_option_same( string:str(String, \\\"; \\\" ++ Option), String ).\\n\\nenable_option_same( 1, \\\"; \\\" ++ String ) -> String;\\nenable_option_same( _N, String ) -> String.\\n\\nis_semicolon( $; ) -> true;\\nis_semicolon( _C ) -> false.\\n\\nremove_duplicates( \\\"#\\\" ++_T=Line, Lines ) -> [Line | Lines];\\nremove_duplicates( Line, Lines ) ->\\n\\tDuplicates = [X || X <-Lines, 1 =:= string:str(Line, X)],\\n\\tremove_duplicates( Duplicates, Line, Lines ).\\n\\nremove_duplicates( [], Line, Lines ) -> [Line | Lines];\\nremove_duplicates( _Duplicates, _Line, Lines ) -> Lines.\\n\\nstrip_control( \\\"\\\" ) -> \\\"\\\";\\nstrip_control( \\\";\\\" ++ _T=String ) -> lists:filter( fun strip_control_codes:is_not_control_code_nor_extended_character/1, String );\\nstrip_control( String ) -> String.\\n\\nstrip_empty( \\\";\\\" ) -> false;\\nstrip_empty( _String ) -> true.\\n\\n\\nstrip_semicolon( \\\";\\\" ++ _T=String ) -> \\\";\\\" ++ lists:dropwhile( fun is_semicolon/1, String );\\nstrip_semicolon( String ) -> String.\\n\\nto_upper( \\\"\\\" ) -> \\\"\\\";\\nto_upper( \\\"#\\\" ++ _T=String ) -> String;\\nto_upper( \\\"; \\\" ++ _T=String ) ->\\n\\t[\\\";\\\", Option | T] = string:tokens( String, \\\" \\\" ),\\n\\tstring:join( [\\\";\\\", string:to_upper(Option) | T], \\\" \\\" );\\nto_upper( String ) ->\\n\\t[Option | T] = string:tokens( String, \\\" \\\" ),\\n\\tstring:join( [string:to_upper(Option) | T], \\\" \\\" ).\\n\",\n \"language\": \"Erlang\"\n },\n {\n \"code\": \" PROGRAM TEST\\t!Define some data aggregates, then write and read them.\\n CHARACTER*28 FAVOURITEFRUIT\\n LOGICAL NEEDSPEELING\\n LOGICAL SEEDSREMOVED\\n INTEGER NUMBEROFBANANAS\\n NAMELIST /FRUIT/ FAVOURITEFRUIT,NEEDSPEELING,SEEDSREMOVED,\\n 1 NUMBEROFBANANAS\\n INTEGER F\\t!An I/O unit number.\\n F = 10\\t!This will do.\\n\\nCreate an example file to show its format.\\n OPEN(F,FILE=\\\"Basket.txt\\\",STATUS=\\\"REPLACE\\\",ACTION=\\\"WRITE\\\",\\t!First, prepare a recipient file.\\n 1 DELIM=\\\"QUOTE\\\")\\t!CHARACTER variables will be enquoted.\\n FAVOURITEFRUIT = \\\"Banana\\\"\\n NEEDSPEELING = .TRUE.\\n SEEDSREMOVED = .FALSE.\\n NUMBEROFBANANAS = 48\\n WRITE (F,FRUIT)\\t\\t!Write the lot in one go.\\n CLOSE (F)\\t\\t\\t!Finished with output.\\nCan now read from the file.\\n OPEN(F,FILE=\\\"Basket.txt\\\",STATUS=\\\"OLD\\\",ACTION=\\\"READ\\\",\\t!Get it back.\\n 1 DELIM=\\\"QUOTE\\\")\\n READ (F,FRUIT)\\t\\t\\t!Read who knows what.\\n WRITE (6,FRUIT)\\n END\\n\",\n \"language\": \"Fortran\"\n },\n {\n \"code\": \" MODULE MONKEYFODDER\\n INTEGER FIELD\\t!An I/O unit number.\\n CHARACTER*28 FAVOURITEFRUIT\\n LOGICAL NEEDSPEELING\\n INTEGER NUMBEROFBANANAS\\n CONTAINS\\n SUBROUTINE GETVALS(FNAME)\\t!Reads values from some file.\\n CHARACTER*(*) FNAME\\t!The file name.\\n LOGICAL SEEDSREMOVED\\t!This variable is no longer wanted.\\n NAMELIST /FRUIT/ FAVOURITEFRUIT,NEEDSPEELING,SEEDSREMOVED,\\t!But still appears in this list.\\n 1 NUMBEROFBANANAS\\n OPEN(FIELD,FILE=FNAME,STATUS=\\\"OLD\\\",ACTION=\\\"READ\\\",\\t!Hopefully, the file exists.\\n 1 DELIM=\\\"QUOTE\\\")\\t!Expect quoting for CHARACTER variables.\\n READ (FIELD,FRUIT,ERR = 666)\\t!Read who knows what.\\n 666 CLOSE (FIELD)\\t\\t\\t!Ignoring any misformats.\\n END SUBROUTINE GETVALS\\t!A proper routine would offer error messages.\\n\\n SUBROUTINE PUTVALS(FNAME)\\t!Writes values to some file.\\n CHARACTER*(*) FNAME\\t!The file name.\\n NAMELIST /FRUIT/ FAVOURITEFRUIT,NEEDSPEELING,NUMBEROFBANANAS\\n OPEN(FIELD,FILE=FNAME,STATUS=\\\"REPLACE\\\",ACTION=\\\"WRITE\\\",\\t!Prepare a recipient file.\\n 1 DELIM=\\\"QUOTE\\\")\\t!CHARACTER variables will be enquoted.\\n WRITE (FIELD,FRUIT)\\t!Write however much is needed.\\n CLOSE (FIELD)\\t\\t!Finished for now.\\n END SUBROUTINE PUTVALS\\n END MODULE MONKEYFODDER\\n\\n PROGRAM TEST\\t!Updates the file created by an earlier version.\\n USE MONKEYFODDER\\n FIELD = 10\\t!This will do.\\n CALL GETVALS(\\\"Basket.txt\\\")\\t!Read the values, allowing for the previous version.\\n CALL PUTVALS(\\\"Basket.txt\\\")\\t!Save the values, as per the new version.\\n END\\n\",\n \"language\": \"Fortran\"\n },\n {\n \"code\": \"' FB 1.05.0 Win64\\n\\nType ConfigData\\n favouriteFruit As String\\n needsPeeling As Boolean\\n seedsRemoved As Boolean\\n numberOfBananas As UInteger\\n numberOfStrawberries As UInteger\\nEnd Type\\n\\nSub updateConfigData(fileName As String, cData As ConfigData)\\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 Sleep\\n End\\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 As Boolean hadFruit, hadPeeling, hadSeeds, hadBananas, hadStrawberries '' all false by default\\n Dim As String ln\\n While Not Eof(fileNum)\\n Line Input #fileNum, ln\\n If ln = \\\"\\\" OrElse Left(ln, 1) = \\\"#\\\" Then\\n Print #fileNum2, ln\\n Continue While\\n End If\\n ln = Trim(LTrim(ln, \\\";\\\"), Any !\\\" \\\\t\\\")\\n If ln = \\\"\\\" Then Continue While\\n If UCase(Left(ln, 14)) = \\\"FAVOURITEFRUIT\\\" Then\\n If hadFruit Then Continue While\\n hadFruit = True\\n Print #fileNum2, \\\"FAVOURITEFRUIT \\\" + cData.favouriteFruit\\n ElseIf UCase(Left(ln, 12)) = \\\"NEEDSPEELING\\\" Then\\n If hadPeeling Then Continue While\\n hadPeeling = True\\n If cData.needsPeeling Then\\n Print #fileNum2, \\\"NEEDSPEELING\\\"\\n Else\\n Print #fileNum2, \\\"; NEEDSPEELING\\\"\\n End If\\n ElseIf UCase(Left(ln, 12)) = \\\"SEEDSREMOVED\\\" Then\\n If hadSeeds Then Continue While\\n hadSeeds = True\\n If cData.seedsRemoved Then\\n Print #fileNum2, \\\"SEEDSREMOVED\\\"\\n Else\\n Print #fileNum2, \\\"; SEEDSREMOVED\\\"\\n End If\\n ElseIf UCase(Left(ln, 15)) = \\\"NUMBEROFBANANAS\\\" Then\\n If hadBananas Then Continue While\\n hadBananas = True\\n Print #fileNum2, \\\"NUMBEROFBANANAS \\\" + Str(cData.numberOfBananas)\\n ElseIf UCase(Left(ln, 20)) = \\\"NUMBEROFSTRAWBERRIES\\\" Then\\n If hadStrawberries Then Continue While\\n hadStrawberries = True\\n Print #fileNum2, \\\"NUMBEROFSTRAWBERRIES \\\" + Str(cData.numberOfStrawBerries)\\n End If\\n Wend\\n\\n If Not hadFruit Then\\n Print #fileNum2, \\\"FAVOURITEFRUIT \\\" + cData.favouriteFruit\\n End If\\n If Not hadPeeling Then\\n If cData.needsPeeling Then\\n Print #fileNum2, \\\"NEEDSPEELING\\\"\\n Else\\n Print #fileNum2, \\\"; NEEDSPEELING\\\"\\n End If\\n End If\\n If Not hadSeeds Then\\n If cData.seedsRemoved Then\\n Print #fileNum2, \\\"SEEDSREMOVED\\\"\\n Else\\n Print #fileNum2, \\\"; SEEDSREMOVED\\\"\\n End If\\n End If\\n If Not hadBananas Then\\n Print #fileNum2, \\\"NUMBEROFBANANAS \\\" + Str(cData.numberOfBananas)\\n End If\\n If Not hadStrawberries Then\\n Print #fileNum2, \\\"NUMBEROFSTRAWBERRIES \\\" + Str(cData.numberOfStrawBerries)\\n End If\\n\\n Close #fileNum : Close #fileNum2\\n Kill(fileName)\\n Name (tempFileName fileName)\\nEnd Sub\\n\\nDim fileName As String = \\\"config2.txt\\\"\\nDim cData As ConfigData\\nWith cData\\n .favouriteFruit = \\\"banana\\\"\\n .needsPeeling = False\\n .seedsRemoved = True\\n .numberOfBananas = 1024\\n .numberOfStrawberries = 62000\\nEnd With\\n\\nupdateConfigData fileName, cData\\nPrint\\nPrint \\\"Press any key to quit\\\"\\nSleep\\n\",\n \"language\": \"FreeBASIC\"\n },\n {\n \"code\": \"package main\\n\\nimport (\\n\\t\\\"bufio\\\"\\n\\t\\\"fmt\\\"\\n\\t\\\"io\\\"\\n\\t\\\"log\\\"\\n\\t\\\"os\\\"\\n\\t\\\"strings\\\"\\n\\t\\\"unicode\\\"\\n)\\n\\n// line represents a single line in the configuration file.\\ntype line struct {\\n\\tkind lineKind\\n\\toption string\\n\\tvalue string\\n\\tdisabled bool\\n}\\n\\n// lineKind represents the different kinds of configuration line.\\ntype lineKind int\\n\\nconst (\\n\\t_ lineKind = iota\\n\\tignore\\n\\tparseError\\n\\tcomment\\n\\tblank\\n\\tvalue\\n)\\n\\nfunc (l line) String() string {\\n\\tswitch l.kind {\\n\\tcase ignore, parseError, comment, blank:\\n\\t\\treturn l.value\\n\\tcase value:\\n\\t\\ts := l.option\\n\\t\\tif l.disabled {\\n\\t\\t\\ts = \\\"; \\\" + s\\n\\t\\t}\\n\\t\\tif l.value != \\\"\\\" {\\n\\t\\t\\ts += \\\" \\\" + l.value\\n\\t\\t}\\n\\t\\treturn s\\n\\t}\\n\\tpanic(\\\"unexpected line kind\\\")\\n}\\n\\nfunc removeDross(s string) string {\\n\\treturn strings.Map(func(r rune) rune {\\n\\t\\tif r < 32 || r > 0x7f || unicode.IsControl(r) {\\n\\t\\t\\treturn -1\\n\\t\\t}\\n\\t\\treturn r\\n\\t}, s)\\n}\\n\\nfunc parseLine(s string) line {\\n\\tif s == \\\"\\\" {\\n\\t\\treturn line{kind: blank}\\n\\t}\\n\\tif s[0] == '#' {\\n\\t\\treturn line{kind: comment, value: s}\\n\\t}\\n\\ts = removeDross(s)\\n\\tfields := strings.Fields(s)\\n\\tif len(fields) == 0 {\\n\\t\\treturn line{kind: blank}\\n\\t}\\n\\t// Strip leading semicolons (but record that we found them)\\n\\tsemi := false\\n\\tfor len(fields[0]) > 0 && fields[0][0] == ';' {\\n\\t\\tsemi = true\\n\\t\\tfields[0] = fields[0][1:]\\n\\t}\\n\\t// Lose the first field if it was all semicolons\\n\\tif fields[0] == \\\"\\\" {\\n\\t\\tfields = fields[1:]\\n\\t}\\n\\tswitch len(fields) {\\n\\tcase 0:\\n\\t\\t// This can only happen if the line starts\\n\\t\\t// with a semicolon but has no other information\\n\\t\\treturn line{kind: ignore}\\n\\tcase 1:\\n\\t\\treturn line{\\n\\t\\t\\tkind: value,\\n\\t\\t\\toption: strings.ToUpper(fields[0]),\\n\\t\\t\\tdisabled: semi,\\n\\t\\t}\\n\\tcase 2:\\n\\t\\treturn line{\\n\\t\\t\\tkind: value,\\n\\t\\t\\toption: strings.ToUpper(fields[0]),\\n\\t\\t\\tvalue: fields[1],\\n\\t\\t\\tdisabled: semi,\\n\\t\\t}\\n\\t}\\n\\treturn line{kind: parseError, value: s}\\n}\\n\\n// Config represents a \\\"standard\\\" configuration file.\\ntype Config struct {\\n\\toptions map[string]int\\t\\t// index of each option in lines.\\n\\tlines []line\\n}\\n\\n// index returns the index of the given option in\\n// c.lines, or -1 if not found.\\nfunc (c *Config) index(option string) int {\\n\\tif i, ok := c.options[option]; ok {\\n\\t\\treturn i\\n\\t}\\n\\treturn -1\\n}\\n\\n// addLine adds a line to the config, ignoring\\n// duplicate options and \\\"ignore\\\" lines.\\nfunc (c *Config) addLine(l line) {\\n\\tswitch l.kind {\\n\\tcase ignore:\\n\\t\\treturn\\n\\tcase value:\\n\\t\\tif c.index(l.option) >= 0 {\\n\\t\\t\\treturn\\n\\t\\t}\\n\\t\\tc.options[l.option] = len(c.lines)\\n\\t\\tc.lines = append(c.lines, l)\\n\\tdefault:\\n\\t\\tc.lines = append(c.lines, l)\\n\\t}\\n}\\n\\n// ReadConfig reads a configuration file from path and returns it.\\nfunc ReadConfig(path string) (*Config, error) {\\n\\tf, err := os.Open(path)\\n\\tif err != nil {\\n\\t\\treturn nil, err\\n\\t}\\n\\tdefer f.Close()\\n\\tr := bufio.NewReader(f)\\n\\tc := &Config{options: make(map[string]int)}\\n\\tfor {\\n\\t\\ts, err := r.ReadString('\\\\n')\\n\\t\\tif s != \\\"\\\" {\\n\\t\\t\\tif err == nil {\\n\\t\\t\\t\\t// strip newline unless we encountered an error without finding one.\\n\\t\\t\\t\\ts = s[:len(s)-1]\\n\\t\\t\\t}\\n\\t\\t\\tc.addLine(parseLine(s))\\n\\t\\t}\\n\\t\\tif err == io.EOF {\\n\\t\\t\\tbreak\\n\\t\\t}\\n\\t\\tif err != nil {\\n\\t\\t\\treturn nil, err\\n\\t\\t}\\n\\t}\\n\\treturn c, nil\\n}\\n\\n// Set sets an option to a value, adding the option if necessary. If\\n// the option was previously disabled, it will be enabled.\\nfunc (c *Config) Set(option string, val string) {\\n\\tif i := c.index(option); i >= 0 {\\n\\t\\tline := &c.lines[i]\\n\\t\\tline.disabled = false\\n\\t\\tline.value = val\\n\\t\\treturn\\n\\t}\\n\\tc.addLine(line{\\n\\t\\tkind: value,\\n\\t\\toption: option,\\n\\t\\tvalue: val,\\n\\t})\\n}\\n\\n// Enable sets the enabled status of an option. It is\\n// ignored if the option does not already exist.\\nfunc (c *Config) Enable(option string, enabled bool) {\\n\\tif i := c.index(option); i >= 0 {\\n\\t\\tc.lines[i].disabled = !enabled\\n\\t}\\n}\\n\\n// Write writes the configuration file to the writer.\\nfunc (c *Config) Write(w io.Writer) {\\n\\tfor _, line := range c.lines {\\n\\t\\tfmt.Println(line)\\n\\t}\\n}\\n\\nfunc main() {\\n\\tc, err := ReadConfig(\\\"/tmp/cfg\\\")\\n\\tif err != nil {\\n\\t\\tlog.Fatalln(err)\\n\\t}\\n\\tc.Enable(\\\"NEEDSPEELING\\\", false)\\n\\tc.Set(\\\"SEEDSREMOVED\\\", \\\"\\\")\\n\\tc.Set(\\\"NUMBEROFBANANAS\\\", \\\"1024\\\")\\n\\tc.Set(\\\"NUMBEROFSTRAWBERRIES\\\", \\\"62000\\\")\\n\\tc.Write(os.Stdout)\\n}\\n\",\n \"language\": \"Go\"\n },\n {\n \"code\": \"import Data.Char (toUpper)\\nimport qualified System.IO.Strict as S\\n\",\n \"language\": \"Haskell\"\n },\n {\n \"code\": \"data INI = INI { entries :: [Entry] } deriving Show\\n\\ndata Entry = Comment String\\n | Field String String\\n | Flag String Bool\\n | EmptyLine\\n\\ninstance Show Entry where\\n show entry = case entry of\\n Comment text -> \\\"# \\\" ++ text\\n Field f v -> f ++ \\\" \\\" ++ v\\n Flag f True -> f\\n Flag f False -> \\\"; \\\" ++ f\\n EmptyLine -> \\\"\\\"\\n\\ninstance Read Entry where\\n readsPrec _ s = [(interprete (clean \\\" \\\" s), \\\"\\\")]\\n where\\n clean chs = dropWhile (`elem` chs)\\n interprete ('#' : text) = Comment text\\n interprete (';' : f)= flag (clean \\\" ;\\\" f) False\\n interprete entry = case words entry of\\n [] -> EmptyLine\\n [f] -> flag f True\\n f : v -> field f (unwords v)\\n field f = Field (toUpper <$> f)\\n flag f = Flag (toUpper <$> f)\\n\",\n \"language\": \"Haskell\"\n },\n {\n \"code\": \"setValue :: String -> String -> INI -> INI\\nsetValue f v = INI . replaceOn (eqv f) (Field f v) . entries\\n\\nsetFlag :: String -> Bool -> INI -> INI\\nsetFlag f v = INI . replaceOn (eqv f) (Flag f v) . entries\\n\\nenable f = setFlag f True\\ndisable f = setFlag f False\\n\\neqv f entry = (toUpper <$> f) == (toUpper <$> field entry)\\n where field (Field f _) = f\\n field (Flag f _) = f\\n field _ = \\\"\\\"\\n\\nreplaceOn p x lst = prev ++ x : post\\n where\\n (prev,post) = case break p lst of\\n (lst, []) -> (lst, [])\\n (lst, _:xs) -> (lst, xs)\\n\",\n \"language\": \"Haskell\"\n },\n {\n \"code\": \"readIni :: String -> IO INI\\nreadIni file = INI . map read . lines <$> S.readFile file\\n\\nwriteIni :: String -> INI -> IO ()\\nwriteIni file = writeFile file . unlines . map show . entries\\n\\nupdateIni :: String -> (INI -> INI) -> IO ()\\nupdateIni file f = readIni file >>= writeIni file . f\\n\\nmain = updateIni \\\"test.ini\\\" $\\n disable \\\"NeedsPeeling\\\" .\\n enable \\\"SeedsRemoved\\\" .\\n setValue \\\"NumberOfBananas\\\" \\\"1024\\\" .\\n setValue \\\"NumberOfStrawberries\\\" \\\"62000\\\"\\n\",\n \"language\": \"Haskell\"\n },\n {\n \"code\": \"require 'regex strings'\\n\\nnormalize=:3 :0\\n seen=. a:\\n eol=. {:;y\\n t=. ''\\n for_line.<;._2;y do. lin=. deb line=.>line\\n if. '#'={.line do. t=.t,line,eol\\n elseif. ''-:lin do. t =. t,eol\\n elseif. do.\\n line=. 1 u:([-.-.)&(32+i.95)&.(3&u:) line\\n base=. ('^ *;;* *';'') rxrplc line\\n nm=. ;name=. {.;:toupper base\\n if. -. name e. seen do.\\n seen=. seen, name\\n t=. t,eol,~dtb ('; '#~';'={.lin),(('^(?i) *',nm,'\\\\b *');(nm,' ')) rxrplc base\\n end.\\n end.\\n end.t\\n)\\n\\nenable=:1 :0\\n (<m) 1!:2~ normalize (,y,{:);<@rxrplc~&(y;~'^; *(?i)',y,'\\\\b');.2]1!:1<m\\n)\\n\\ndisable=:1 :0\\n (<m) 1!:2~ normalize (,'; ',y,{:);<@rxrplc~&(('; ',y);~'^ *(?i)',y,'\\\\b');.2]1!:1<m\\n)\\n\\nset=:1 :0\\n:\\n t=. 1!:1<m\\n pat=. '^ *(?i)',y,'\\\\b.*'\\n upd=. y,' ',\\\":x\\n (<m) 1!:2~ normalize (,upd,{:);<@rxrplc~&(pat;upd) t\\n)\\n\",\n \"language\": \"J\"\n },\n {\n \"code\": \" 'example.file' disable 'needspeeling'\\n 'example.file' enable 'seedsremoved'\\n 1024 'example.file' set 'numberofbananas'\\n 62000 'example.file' set 'numberofstrawberries'\\n\",\n \"language\": \"J\"\n },\n {\n \"code\": \"import java.io.*;\\nimport java.util.*;\\nimport java.util.regex.*;\\n\\npublic class UpdateConfig {\\n\\n public static void main(String[] args) {\\n if (args[0] == null) {\\n System.out.println(\\\"filename required\\\");\\n\\n } else if (readConfig(args[0])) {\\n enableOption(\\\"seedsremoved\\\");\\n disableOption(\\\"needspeeling\\\");\\n setOption(\\\"numberofbananas\\\", \\\"1024\\\");\\n addOption(\\\"numberofstrawberries\\\", \\\"62000\\\");\\n store();\\n }\\n }\\n\\n private enum EntryType {\\n EMPTY, ENABLED, DISABLED, COMMENT\\n }\\n\\n private static class Entry {\\n EntryType type;\\n String name, value;\\n\\n Entry(EntryType t, String n, String v) {\\n type = t;\\n name = n;\\n value = v;\\n }\\n }\\n\\n private static Map<String, Entry> entries = new LinkedHashMap<>();\\n private static String path;\\n\\n private static boolean readConfig(String p) {\\n path = p;\\n\\n File f = new File(path);\\n if (!f.exists() || f.isDirectory())\\n return false;\\n\\n String regexString = \\\"^(;*)\\\\\\\\s*([A-Za-z0-9]+)\\\\\\\\s*([A-Za-z0-9]*)\\\";\\n Pattern regex = Pattern.compile(regexString);\\n\\n try (Scanner sc = new Scanner(new FileReader(f))){\\n int emptyLines = 0;\\n String line;\\n while (sc.hasNext()) {\\n line = sc.nextLine().trim();\\n\\n if (line.isEmpty()) {\\n addOption(\\\"\\\" + emptyLines++, null, EntryType.EMPTY);\\n\\n } else if (line.charAt(0) == '#') {\\n entries.put(line, new Entry(EntryType.COMMENT, line, null));\\n\\n } else {\\n line = line.replaceAll(\\\"[^a-zA-Z0-9\\\\\\\\x20;]\\\", \\\"\\\");\\n Matcher m = regex.matcher(line);\\n\\n if (m.find() && !m.group(2).isEmpty()) {\\n\\n EntryType t = EntryType.ENABLED;\\n if (!m.group(1).isEmpty())\\n t = EntryType.DISABLED;\\n\\n addOption(m.group(2), m.group(3), t);\\n }\\n }\\n }\\n } catch (IOException e) {\\n System.out.println(e);\\n }\\n return true;\\n }\\n\\n private static void addOption(String name, String value) {\\n addOption(name, value, EntryType.ENABLED);\\n }\\n\\n private static void addOption(String name, String value, EntryType t) {\\n name = name.toUpperCase();\\n entries.put(name, new Entry(t, name, value));\\n }\\n\\n private static void enableOption(String name) {\\n Entry e = entries.get(name.toUpperCase());\\n if (e != null)\\n e.type = EntryType.ENABLED;\\n }\\n\\n private static void disableOption(String name) {\\n Entry e = entries.get(name.toUpperCase());\\n if (e != null)\\n e.type = EntryType.DISABLED;\\n }\\n\\n private static void setOption(String name, String value) {\\n Entry e = entries.get(name.toUpperCase());\\n if (e != null)\\n e.value = value;\\n }\\n\\n private static void store() {\\n try (PrintWriter pw = new PrintWriter(path)) {\\n for (Entry e : entries.values()) {\\n switch (e.type) {\\n case EMPTY:\\n pw.println();\\n break;\\n case ENABLED:\\n pw.format(\\\"%s %s%n\\\", e.name, e.value);\\n break;\\n case DISABLED:\\n pw.format(\\\"; %s %s%n\\\", e.name, e.value);\\n break;\\n case COMMENT:\\n pw.println(e.name);\\n break;\\n default:\\n break;\\n }\\n }\\n if (pw.checkError()) {\\n throw new IOException(\\\"writing to file failed\\\");\\n }\\n } catch (IOException e) {\\n System.out.println(e);\\n }\\n }\\n}\\n\",\n \"language\": \"Java\"\n },\n {\n \"code\": \"function cleansyntax(line)\\n line = strip(line)\\n if line == \\\"\\\"\\n return \\\"#=blank line=#\\\"\\n elseif line[1] == '#'\\n return line\\n elseif line[1] == ';'\\n line = replace(line, r\\\"^;[;]+\\\" => \\\";\\\")\\n else # active option\\n o, p = splitline(line)\\n line = p == nothing ? uppercase(o) : uppercase(o) * \\\" \\\" * p\\n end\\n join(filter(c -> isascii(c[1]) && !iscntrl(c[1]), split(line, \\\"\\\")), \\\"\\\")\\nend\\n\\n\\\"\\\"\\\"\\n Run to clean up the configuration file lines prior to other function application.\\n\\\"\\\"\\\"\\ncleansyntax!(lines) = (for (i, li) in enumerate(lines) lines[i] = cleansyntax(li) end; lines)\\n\\nisdisabled(line) = startswith(line, [';', '#'])\\nisenabled(line) = !isdisabled(line)\\n\\nfunction splitline(line)\\n arr = split(line, r\\\"\\\\s+\\\", limit=2)\\n if length(arr) < 2\\n return (arr[1], nothing)\\n end\\n return (arr[1], arr[2])\\nend\\n\\nfunction disable!(lines, opt)\\n for (i, li) in enumerate(lines)\\n if isenabled(li) && splitline(li)[1] == uppercase(opt)\\n lines[i] = \\\";\\\" * li\\n break # note: only first one found is disabled\\n end\\n end\\n lines\\nend\\n\\nfunction enable!(lines, opt)\\n for (i, li) in enumerate(lines)\\n if isdisabled(li)\\n s = li[2:end]\\n if splitline(s)[1] == uppercase(opt)\\n lines[i] = s\\n break # note: only first one found is enabled\\n end\\n end\\n end\\n lines\\nend\\n\\nfunction changeparam!(lines, opt, newparam)\\n for (i, li) in enumerate(lines)\\n if isenabled(li)\\n o, p = splitline(li)\\n if o == opt\\n lines[i] = o * \\\" \\\" * string(newparam)\\n break # note: only first one found is changed\\n end\\n end\\n end\\n lines\\nend\\n\\nfunction activecfg(lines)\\n cfgdict = Dict()\\n for li in lines\\n if isenabled(li)\\n o, p = splitline(li)\\n cfgdict[o] = p\\n end\\n end\\n cfgdict\\nend\\n\\nconst filename = \\\"fruit.cfg\\\"\\nconst cfh = open(filename)\\nconst cfglines = cleansyntax!(readlines(cfh))\\nclose(cfh)\\n\\nconst cfg = activecfg(cfglines)\\n\\ndisable!(cfglines, \\\"NEEDSPEELING\\\")\\nenable!(cfglines, \\\"SEEDSREMOVED\\\")\\nchangeparam!(cfglines, \\\"NUMBEROFBANANAS\\\", 1024)\\n\\nif !haskey(cfg, \\\"NUMBEROFSTRAWBERRIES\\\")\\n push!(cfglines, \\\"NUMBEROFSTRAWBERRIES 62000\\\")\\nend\\ncfg[\\\"NUMBEROFSTRAWBERRIES\\\"] = 62000\\nchangeparam!(cfglines, \\\"NUMBEROFSTRAWBERRIES\\\", 62000)\\n\\nconst cfw = open(filename, \\\"w\\\")\\nfor li in cfglines\\n if li != \\\"\\\"\\n if li == \\\"#=blank line=#\\\"\\n li = \\\"\\\"\\n end\\n write(cfw, li * \\\"\\\\n\\\")\\n end\\nend\\n\",\n \"language\": \"Julia\"\n },\n {\n \"code\": \"// version 1.2.0\\n\\nimport java.io.File\\n\\nclass ConfigData(\\n val favouriteFruit: String,\\n val needsPeeling: Boolean,\\n val seedsRemoved: Boolean,\\n val numberOfBananas: Int,\\n val numberOfStrawberries: Int\\n)\\n\\nfun updateConfigFile(fileName: String, cData: ConfigData) {\\n val inp = File(fileName)\\n val lines = inp.readLines()\\n val tempFileName = \\\"temp_$fileName\\\"\\n val out = File(tempFileName)\\n val pw = out.printWriter()\\n var hadFruit = false\\n var hadPeeling = false\\n var hadSeeds = false\\n var hadBananas = false\\n var hadStrawberries = false\\n\\n for (line in lines) {\\n if (line.isEmpty() || line[0] == '#') {\\n pw.println(line)\\n continue\\n }\\n val ln = line.trimStart(';').trim(' ', '\\\\t').toUpperCase()\\n if (ln.isEmpty()) continue\\n if (ln.take(14) == \\\"FAVOURITEFRUIT\\\") {\\n if (hadFruit) continue\\n hadFruit = true\\n pw.println(\\\"FAVOURITEFRUIT ${cData.favouriteFruit}\\\")\\n }\\n else if (ln.take(12) == \\\"NEEDSPEELING\\\") {\\n if (hadPeeling) continue\\n hadPeeling = true\\n if (cData.needsPeeling)\\n pw.println(\\\"NEEDSPEELING\\\")\\n else\\n pw.println(\\\"; NEEDSPEELING\\\")\\n }\\n else if (ln.take(12) == \\\"SEEDSREMOVED\\\") {\\n if (hadSeeds) continue\\n hadSeeds = true\\n if (cData.seedsRemoved)\\n pw.println(\\\"SEEDSREMOVED\\\")\\n else\\n pw.println(\\\"; SEEDSREMOVED\\\")\\n }\\n else if(ln.take(15) == \\\"NUMBEROFBANANAS\\\") {\\n if (hadBananas) continue\\n hadBananas = true\\n pw.println(\\\"NUMBEROFBANANAS ${cData.numberOfBananas}\\\")\\n }\\n else if(ln.take(20) == \\\"NUMBEROFSTRAWBERRIES\\\") {\\n if (hadStrawberries) continue\\n hadStrawberries = true\\n pw.println(\\\"NUMBEROFSTRAWBERRIES ${cData.numberOfStrawberries}\\\")\\n }\\n }\\n\\n if (!hadFruit) {\\n pw.println(\\\"FAVOURITEFRUIT ${cData.favouriteFruit}\\\")\\n }\\n\\n if (!hadPeeling) {\\n if (cData.needsPeeling)\\n pw.println(\\\"NEEDSPEELING\\\")\\n else\\n pw.println(\\\"; NEEDSPEELING\\\")\\n }\\n\\n if (!hadSeeds) {\\n if (cData.seedsRemoved)\\n pw.println(\\\"SEEDSREMOVED\\\")\\n else\\n pw.println(\\\"; SEEDSREMOVED\\\")\\n }\\n\\n if (!hadBananas) {\\n pw.println(\\\"NUMBEROFBANANAS ${cData.numberOfBananas}\\\")\\n }\\n\\n if (!hadStrawberries) {\\n pw.println(\\\"NUMBEROFSTRAWBERRIES ${cData.numberOfStrawberries}\\\")\\n }\\n\\n pw.close()\\n inp.delete()\\n out.renameTo(inp)\\n}\\n\\nfun main(args: Array<String>) {\\n val fileName = \\\"config.txt\\\"\\n val cData = ConfigData(\\\"banana\\\", false, true, 1024, 62000)\\n updateConfigFile(fileName, cData)\\n}\\n\",\n \"language\": \"Kotlin\"\n },\n {\n \"code\": \"#!/usr/bin/lasso9\\n\\ndefine config => type {\\n\\n\\tdata public configtxt, public path\\n\\n\\tpublic oncreate(\\n\\t\\tpath::string = 'testing/configuration.txt'\\n\\t) => {\\n\\t\\t.configtxt = file(#path) -> readstring\\n\\t\\t.path = #path\\n\\t}\\n\\n\\tpublic get(term::string) => {\\n\\t\\t.clean\\n\\t\\tlocal(\\n\\t\\t\\tregexp\\t= regexp(-find = `(?m)^` + #term + `($|\\\\s*=\\\\s*|\\\\s+)(.*)$`, -input = .configtxt, -ignorecase),\\n\\t\\t\\tresult\\n\\t\\t)\\n\\n\\t\\twhile(#regexp -> find) => {\\n\\t\\t\\t#result = (#regexp -> groupcount > 1 ? (#regexp -> matchString(2) -> trim& || true))\\n\\t\\t\\tif(#result -> asstring >> ',') => {\\n\\t\\t\\t\\t#result = #result -> split(',')\\n\\t\\t\\t\\t#result -> foreach => {#1 -> trim}\\n\\t\\t\\t}\\n\\t\\t\\treturn #result\\n\\t\\t}\\n\\t\\treturn false\\n\\t}\\n\\n\\tpublic set(term::string, value) => {\\n\\t\\tif(#value === false) => {\\n\\t\\t\\t.disable(#term)\\n\\t\\t\\treturn\\n\\t\\t}\\n\\t\\t.enable(#term)\\n\\t\\tif(#value -> isanyof(::string, ::integer, ::decimal)) => {\\n\\t\\t\\t.configtxt = regexp(-find = `(?m)^(` + #term + `) ?(.*?)$`, -replace = `$1 ` + #value, -input = .configtxt, -ignorecase) -> replaceall\\n\\t\\t}\\n\\t}\\n\\n\\tpublic disable(term::string) => {\\n\\t\\t.clean\\n\\t\\tlocal(regexp = regexp(-find = `(?m)^(` + #term + `)`, -replace = `; $1`, -input = .configtxt, -ignorecase))\\n\\t\\t.configtxt = #regexp -> replaceall\\n\\t}\\n\\n\\tpublic enable(term::string, -comment::string = '# Added ' + date) => {\\n\\t\\t.clean\\n\\t\\tlocal(regexp = regexp(-find = `(?m)^(; )?(` + #term + `)`, -replace = `$2`, -input = .configtxt, -ignorecase))\\n\\t\\tif(#regexp -> find) => {\\n\\t\\t\\t.configtxt = #regexp -> replaceall\\n\\t\\telse\\n\\t\\t\\t.configtxt -> append('\\\\n' + (not #comment -> beginswith('#') ? '# ') +\\n\\t\\t\\t\\t#comment + '\\\\n' +\\n\\t\\t\\t\\tstring_uppercase(#term) + '\\\\n'\\n\\t\\t\\t)\\n\\t\\t}\\n\\t}\\n\\n\\tpublic write => {\\n\\t\\tlocal(config = file(.path))\\n\\t\\t#config -> opentruncate\\n\\t\\t#config -> dowithclose => {\\n\\t\\t\\t#config -> writestring(.configtxt)\\n\\t\\t}\\n\\n\\t}\\n\\n\\tpublic clean => {\\n\\n\\t\\tlocal(\\n\\t\\t\\tcleaned = array,\\n\\t\\t\\tregexp\\t= regexp(-find = `^(;+)\\\\W*$`)\\n\\t\\t)\\n\\n\\t\\twith line in .configtxt -> split('\\\\n') do {\\n\\t\\t\\t#line -> trim\\n\\t\\t\\t#regexp -> input = #line\\n\\n\\t\\t\\tif(#line -> beginswith('#') or #line == '') => {\\n\\t\\t\\t\\t#cleaned -> insert(#line)\\n\\t\\t\\telse(not (#regexp -> find))\\n\\t\\t\\t\\tif(#line -> beginswith(';')) => {\\n\\t\\t\\t\\t\\t#line -> replace(regexp(`^;+ *`), `; `)\\n\\t\\t\\t\\telse\\n\\t\\t\\t\\t\\t#line -> replace(regexp(`^(.*?) +(.*?)`), `$1 $2`)\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\t#line -> replace(regexp(`\\\\t`))\\n\\t\\t\\t\\t#cleaned -> insert(#line)\\n\\t\\t\\t}\\n\\t\\t}\\n\\n\\t\\t.configtxt = #cleaned -> join('\\\\n')\\n\\n\\t}\\n\\n}\\n\",\n \"language\": \"Lasso\"\n },\n {\n \"code\": \"local(\\n\\tconfig\\t\\t= config,\\n)\\n\\nstdoutnl(#config -> get('FAVOURITEFRUIT'))\\nstdoutnl(#config -> get('SEEDSREMOVED'))\\nstdoutnl(#config -> get('NUMBEROFBANANAS'))\\n\\n#config -> enable('seedsremoved')\\n#config -> enable('PARAMWITHCOMMENT', -comment = 'This param was added to demonstrate the possibility to also have comments associated with it')\\n#config -> disable('needspeeling')\\n#config -> set('numberofstrawberries', 62000)\\n#config -> set('numberofbananas', 1024)\\n\\n#config -> write\\n\",\n \"language\": \"Lasso\"\n },\n {\n \"code\": \"import os, re, strutils\\n\\nlet regex = re(r\\\"^(;*)\\\\s*([A-Z0-9]+)\\\\s*([A-Z0-9]*)\\\", {reIgnoreCase, reStudy})\\n\\ntype\\n\\n EntryType {.pure.} = enum Empty, Enabled, Disabled, Comment, Ignore\\n\\n Entry = object\\n etype: EntryType\\n name: string\\n value: string\\n\\n Config = object\\n entries: seq[Entry]\\n path: string\\n\\n\\n# Forward reference.\\nproc addOption*(config: var Config; name, value: string; etype = Enabled)\\n\\n\\nproc initConfig*(path: string): Config =\\n\\n if not path.isValidFilename:\\n raise newException(IOError, \\\"invalid file name.\\\")\\n\\n result.path = path\\n if not path.fileExists: return\\n\\n for line in path.lines:\\n var line = line.strip\\n if line.len == 0:\\n result.entries.add Entry(etype: Empty)\\n elif line[0] == '#':\\n result.entries.add Entry(etype: Comment, value: line)\\n else:\\n line = line.replace(re\\\"^a-zA-Z0-9\\\\x20;\\\")\\n var matches = newSeq[string](3)\\n if line.match(regex, matches) and matches[1].len != 0:\\n let etype = if matches[0].len == 0: Enabled else: Disabled\\n result.addOption(matches[1], matches[2], etype)\\n\\n\\nproc getOptionIndex(config: Config; name: string): int =\\n for i, e in config.entries:\\n if e.etype notin [Enabled, Disabled]: continue\\n if e.name == name.toUpperAscii:\\n return i\\n result = -1\\n\\n\\nproc enableOption*(config: var Config; name: string) =\\n let i = config.getOptionIndex(name)\\n if i >= 0:\\n config.entries[i].etype = Enabled\\n\\n\\nproc disableOption*(config: var Config; name: string) =\\n let i = config.getOptionIndex(name)\\n if i >= 0:\\n config.entries[i].etype = Disabled\\n\\n\\nproc setOption*(config: var Config; name, value: string) =\\n let i = config.getOptionIndex(name)\\n if i >= 0:\\n config.entries[i].value = value\\n\\n\\nproc addOption*(config: var Config; name, value: string; etype = Enabled) =\\n config.entries.add Entry(etype: etype, name: name.toUpperAscii, value: value)\\n\\n\\nproc removeOption*(config: var Config; name: string) =\\n let i = config.getOptionIndex(name)\\n if i >= 0:\\n config.entries[i].etype = Ignore\\n\\n\\nproc store*(config: Config) =\\n let f = open(config.path, fmWrite)\\n for e in config.entries:\\n case e.etype\\n of Empty: f.writeLine(\\\"\\\")\\n of Enabled: f.writeLine(e.name, ' ', e.value)\\n of Disabled: f.writeLine(\\\"; \\\", e.name, ' ', e.value)\\n of Comment: f.writeLine(e.value)\\n of Ignore: discard\\n\\n\\nwhen isMainModule:\\n\\n var cfg = initConfig(\\\"update_demo.config\\\")\\n cfg.enableOption(\\\"seedsremoved\\\")\\n cfg.disableOption(\\\"needspeeling\\\")\\n cfg.setOption(\\\"numberofbananas\\\", \\\"1024\\\")\\n cfg.addOption(\\\"numberofstrawberries\\\", \\\"62000\\\")\\n cfg.store()\\n\",\n \"language\": \"Nim\"\n },\n {\n \"code\": \"use warnings;\\nuse strict;\\n\\nmy $needspeeling = 0;\\nmy $seedsremoved = 1;\\nmy $numberofstrawberries = 62000;\\nmy $numberofbananas = 1024;\\nmy $favouritefruit = 'bananas';\\n\\nmy @out;\\n\\nsub config {\\n my (@config) = <DATA>;\\n push @config, \\\"NUMBEROFSTRAWBERRIES $numberofstrawberries\\\\n\\\"\\n unless grep { /^;*[ \\\\t]*NUMBEROFSTRAWBERRIES\\\\b/; } @config;\\n\\n foreach my $line (@config) {\\n\\n if (substr($line, 0, 1) eq '#') {\\n push @out, $line;\\n next;\\n }\\n\\n next if $line =~ /^[;\\\\t ]+$/;\\n\\n my ($option, $option_name);\\n\\n if ($line =~ /^([A-Z]+[0-9]*)/) {\\n $option_name = lc $1;\\n $option = eval \\\"\\\\\\\\\\\\$$option_name\\\";\\n my $value = eval \\\"\\\\${$option_name}\\\";\\n\\n if ($value) {\\n $$option = $value;\\n }\\n else {\\n $line = '; ' . $line;\\n $$option = undef;\\n }\\n }\\n elsif ($line =~ /^;+\\\\s*([A-Z]+[0-9]*)/) {\\n $option_name = lc $1;\\n $option = eval \\\"\\\\\\\\\\\\$$option_name\\\";\\n my $value = eval \\\"\\\\${$option_name}\\\";\\n\\n if ($value) {\\n $line =~ s/^;+\\\\s*//;\\n $$option = $value == 1 ? '' : $value;\\n }\\n else {\\n $$option = undef;\\n }\\n }\\n\\n if (defined $$option) {\\n push @out, \\\"\\\\U$option_name\\\\E $$option\\\\n\\\"\\n unless grep { /^\\\\U$option_name\\\\E\\\\b/; } @out;\\n }\\n else {\\n $line =~ s/\\\\s*[^[:ascii:]]+\\\\s*$//;\\n $line =~ s/[[:cntrl:]\\\\s]+$//;\\n push(@out, \\\"$line\\\\n\\\");\\n }\\n }\\n}\\n\\nconfig();\\n\\nmy $file = join('', @out);\\n$file =~ s/\\\\n{3,}/\\\\n\\\\n/g;\\n\\nprint $file;\\n\\n__DATA__\\n# This is a configuration file in standard configuration file format\\n#\\n# Lines begininning with a hash or a semicolon are ignored by the application\\n# program. Blank lines are also ignored by the application program.\\n\\n# The first word on each non comment line is the configuration option.\\n# Remaining words or numbers on the line are configuration parameter\\n# data fields.\\n\\n# Note that configuration option names are not case sensitive. However,\\n# configuration parameter data is case sensitive and the lettercase must\\n# be preserved.\\n\\n# This is a favourite fruit\\nFAVOURITEFRUIT banana\\n\\n# This is a boolean that should be set\\nNEEDSPEELING\\n\\n# This boolean is commented out\\n; SEEDSREMOVED\\n\\n# How many bananas we have\\nNUMBEROFBANANAS 48\\n\",\n \"language\": \"Perl\"\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;\\\">\\\"RCTEST.INI\\\"</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #008000;\\\">\\\"r\\\"</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;\\\">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;\\\">constant</span> <span style=\\\"color: #000000;\\\">dini</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">new_dict</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: #004080;\\\">string</span> <span style=\\\"color: #000000;\\\">li</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">trim</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;\\\">if</span> <span style=\\\"color: #7060A8;\\\">length</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">li</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #008080;\\\">and</span> <span style=\\\"color: #008080;\\\">not</span> <span style=\\\"color: #7060A8;\\\">find</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">li</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: #008080;\\\">then</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;\\\">li</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: #004080;\\\">string</span> <span style=\\\"color: #000000;\\\">rest</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">li</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;\\\">li</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">upper</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">li</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: #7060A8;\\\">putd</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">li</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">rest</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">dini</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #008080;\\\">else</span>\\n <span style=\\\"color: #7060A8;\\\">putd</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #7060A8;\\\">upper</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">li</span><span style=\\\"color: #0000FF;\\\">),</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">dini</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;\\\">for</span>\\n\\n <span style=\\\"color: #7060A8;\\\">deld</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #008000;\\\">\\\"NEEDSPEELING\\\"</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">dini</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #7060A8;\\\">setd</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #008000;\\\">\\\"SEEDSREMOVED\\\"</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">dini</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #7060A8;\\\">setd</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #008000;\\\">\\\"NUMBEROFBANANAS\\\"</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">1024</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">dini</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #7060A8;\\\">setd</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #008000;\\\">\\\"NUMBEROFSTRAWBERRIES\\\"</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">62000</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">dini</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;\\\">lines</span><span style=\\\"color: #0000FF;\\\">)</span> <span style=\\\"color: #008080;\\\">do</span>\\n <span style=\\\"color: #004080;\\\">string</span> <span style=\\\"color: #000000;\\\">li</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">trim</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;\\\">if</span> <span style=\\\"color: #7060A8;\\\">length</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">li</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #008080;\\\">and</span> <span style=\\\"color: #000000;\\\">li</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: #008080;\\\">then</span>\\n <span style=\\\"color: #008080;\\\">if</span> <span style=\\\"color: #000000;\\\">li</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: #008080;\\\">then</span>\\n <span style=\\\"color: #000000;\\\">li</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">trim</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">li</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: #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;\\\">li</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: #004080;\\\">string</span> <span style=\\\"color: #000000;\\\">rest</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">li</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;\\\">li</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">upper</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">li</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;\\\">k</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">getd_index</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">li</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">dini</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;\\\">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: #008000;\\\">\\\"; \\\"</span><span style=\\\"color: #0000FF;\\\">&</span><span style=\\\"color: #000000;\\\">li</span><span style=\\\"color: #0000FF;\\\">&</span><span style=\\\"color: #008000;\\\">\\\" \\\"</span><span style=\\\"color: #0000FF;\\\">&</span><span style=\\\"color: #000000;\\\">rest</span>\\n <span style=\\\"color: #008080;\\\">else</span>\\n <span style=\\\"color: #004080;\\\">object</span> <span style=\\\"color: #000000;\\\">o</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">getd_by_index</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">k</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">dini</span><span style=\\\"color: #0000FF;\\\">)</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;\\\">o</span><span style=\\\"color: #0000FF;\\\">)</span> <span style=\\\"color: #008080;\\\">then</span> <span style=\\\"color: #000000;\\\">o</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">sprint</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">o</span><span style=\\\"color: #0000FF;\\\">)</span> <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">if</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: #000000;\\\">li</span><span style=\\\"color: #0000FF;\\\">&</span><span style=\\\"color: #008000;\\\">\\\" \\\"</span><span style=\\\"color: #0000FF;\\\">&</span><span style=\\\"color: #000000;\\\">o</span>\\n <span style=\\\"color: #7060A8;\\\">deld</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">li</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">dini</span><span style=\\\"color: #0000FF;\\\">)</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: #008080;\\\">if</span> <span style=\\\"color: #7060A8;\\\">getd</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">li</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">dini</span><span style=\\\"color: #0000FF;\\\">)</span> <span style=\\\"color: #008080;\\\">then</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: #000000;\\\">li</span>\\n <span style=\\\"color: #7060A8;\\\">deld</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">li</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">dini</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;\\\">i</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;\\\">li</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;\\\">end</span> <span style=\\\"color: #008080;\\\">for</span>\\n <span style=\\\"color: #008080;\\\">function</span> <span style=\\\"color: #000000;\\\">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: #000000;\\\">data</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #004080;\\\">object</span> <span style=\\\"color: #000080;font-style:italic;\\\">/*user_data*/</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #000000;\\\">lines</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">append</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">lines</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">key</span><span style=\\\"color: #0000FF;\\\">&</span><span style=\\\"color: #008000;\\\">\\\" \\\"</span><span style=\\\"color: #0000FF;\\\">&</span><span style=\\\"color: #7060A8;\\\">sprint</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">data</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 <span style=\\\"color: #7060A8;\\\">traverse_dict</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #7060A8;\\\">routine_id</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #008000;\\\">\\\"visitor\\\"</span><span style=\\\"color: #0000FF;\\\">),</span><span style=\\\"color: #000000;\\\">0</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">dini</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;\\\">\\\"RCTEST.INI\\\"</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<!--\\n\",\n \"language\": \"Phix\"\n },\n {\n \"code\": \"<?php\\n\\n$conf = file_get_contents('update-conf-file.txt');\\n\\n// Disable the needspeeling option (using a semicolon prefix)\\n$conf = preg_replace('/^(needspeeling)(|\\\\s*\\\\S*)$/mi', '; $1', $conf);\\n\\n// Enable the seedsremoved option by removing the semicolon and any leading whitespace\\n$conf = preg_replace('/^;?\\\\s*(seedsremoved)/mi', '$1', $conf);\\n\\n// Change the numberofbananas parameter to 1024\\n$conf = preg_replace('/^(numberofbananas)(|\\\\s*\\\\S*)$/mi', '$1 1024', $conf);\\n\\n// Enable (or create if it does not exist in the file) a parameter for numberofstrawberries with a value of 62000\\nif (preg_match('/^;?\\\\s*(numberofstrawberries)/mi', $conf, $matches)) {\\n $conf = preg_replace('/^(numberofstrawberries)(|\\\\s*\\\\S*)$/mi', '$1 62000', $conf);\\n} else {\\n $conf .= 'NUMBEROFSTRAWBERRIES 62000' . PHP_EOL;\\n}\\n\\necho $conf;\\n\",\n \"language\": \"PHP\"\n },\n {\n \"code\": \"(let Data # Read all data\\n (in \\\"config\\\"\\n (make\\n (until (eof)\\n (link (trim (split (line) \\\" \\\"))) ) ) )\\n (setq Data # Fix comments\\n (mapcar\\n '((L)\\n (while (head '(\\\";\\\" \\\";\\\") (car L))\\n (pop L) )\\n (if (= '(\\\";\\\") (car L))\\n L\\n (cons NIL L) ) )\\n Data ) )\\n (let (Need NIL Seed NIL NBan NIL NStr NIL Favo NIL)\\n (map\\n '((L)\\n (let D (mapcar uppc (cadar L))\\n (cond\\n ((= '`(chop \\\"NEEDSPEELING\\\") D)\\n (if Need\\n (set L)\\n (on Need)\\n (unless (caar L)\\n (set (car L) '(\\\";\\\")) ) ) )\\n ((= '`(chop \\\"SEEDSREMOVED\\\") D)\\n (if Seed\\n (set L)\\n (on Seed)\\n (when (caar L)\\n (set (car L)) ) ) )\\n ((= '`(chop \\\"NUMBEROFBANANAS\\\") D)\\n (if NBan\\n (set L)\\n (on NBan)\\n (set (cddar L) 1024) ) )\\n ((= '`(chop \\\"NUMBEROFSTRAWBERRIES\\\") D)\\n (if NStr\\n (set L)\\n (on NStr) ) )\\n ((= '`(chop \\\"FAVOURITEFRUIT\\\") D)\\n (if Favo\\n (set L)\\n (on Favo) ) ) ) ) )\\n Data )\\n (unless Need\\n (conc Data (cons (list NIL \\\"NEEDSPEELING\\\"))) )\\n (unless Seed\\n (conc Data (cons (list NIL \\\"SEEDSREMOVED\\\"))) )\\n (unless NBan\\n (conc Data (cons (list NIL \\\"NUMBEROFBANANAS\\\" 1024))) )\\n (unless NStr\\n (conc Data (cons (list NIL \\\"NUMBEROFSTRAWBERRIES\\\" 62000))) ) )\\n (out \\\"config\\\"\\n (for L Data\\n (prinl (glue \\\" \\\" (if (car L) L (cdr L)))) ) ) )\\n\",\n \"language\": \"PicoLisp\"\n },\n {\n \"code\": \"function Update-ConfigurationFile\\n{\\n [CmdletBinding()]\\n Param\\n (\\n [Parameter(Mandatory=$false,\\n Position=0)]\\n [ValidateScript({Test-Path $_})]\\n [string]\\n $Path = \\\".\\\\config.txt\\\",\\n\\n [Parameter(Mandatory=$false)]\\n [string]\\n $FavouriteFruit,\\n\\n [Parameter(Mandatory=$false)]\\n [int]\\n $NumberOfBananas,\\n\\n [Parameter(Mandatory=$false)]\\n [int]\\n $NumberOfStrawberries,\\n\\n [Parameter(Mandatory=$false)]\\n [ValidateSet(\\\"On\\\", \\\"Off\\\")]\\n [string]\\n $NeedsPeeling,\\n\\n [Parameter(Mandatory=$false)]\\n [ValidateSet(\\\"On\\\", \\\"Off\\\")]\\n [string]\\n $SeedsRemoved\\n )\\n\\n [string[]]$lines = Get-Content $Path\\n\\n Clear-Content $Path\\n\\n if (-not ($lines | Select-String -Pattern \\\"^\\\\s*NumberOfStrawberries\\\" -Quiet))\\n {\\n \\\"\\\", \\\"# How many strawberries we have\\\", \\\"NumberOfStrawberries 0\\\" | ForEach-Object {$lines += $_}\\n }\\n\\n foreach ($line in $lines)\\n {\\n $line = $line -replace \\\"^\\\\s*\\\",\\\"\\\" ## Strip leading whitespace\\n\\n if ($line -match \\\"[;].*\\\\s*\\\") {continue} ## Strip semicolons\\n\\n switch -Regex ($line)\\n {\\n \\\"(^$)|(^#\\\\s.*)\\\" ## Blank line or comment\\n {\\n $line = $line\\n }\\n \\\"^FavouriteFruit\\\\s*.*\\\" ## Parameter FavouriteFruit\\n {\\n if ($FavouriteFruit)\\n {\\n $line = \\\"FAVOURITEFRUIT $FavouriteFruit\\\"\\n }\\n }\\n \\\"^NumberOfBananas\\\\s*.*\\\" ## Parameter NumberOfBananas\\n {\\n if ($NumberOfBananas)\\n {\\n $line = \\\"NUMBEROFBANANAS $NumberOfBananas\\\"\\n }\\n }\\n \\\"^NumberOfStrawberries\\\\s*.*\\\" ## Parameter NumberOfStrawberries\\n {\\n if ($NumberOfStrawberries)\\n {\\n $line = \\\"NUMBEROFSTRAWBERRIES $NumberOfStrawberries\\\"\\n }\\n }\\n \\\".*NeedsPeeling\\\\s*.*\\\" ## Parameter NeedsPeeling\\n {\\n if ($NeedsPeeling -eq \\\"On\\\")\\n {\\n $line = \\\"NEEDSPEELING\\\"\\n }\\n elseif ($NeedsPeeling -eq \\\"Off\\\")\\n {\\n $line = \\\"; NEEDSPEELING\\\"\\n }\\n }\\n \\\".*SeedsRemoved\\\\s*.*\\\" ## Parameter SeedsRemoved\\n {\\n if ($SeedsRemoved -eq \\\"On\\\")\\n {\\n $line = \\\"SEEDSREMOVED\\\"\\n }\\n elseif ($SeedsRemoved -eq \\\"Off\\\")\\n {\\n $line = \\\"; SEEDSREMOVED\\\"\\n }\\n }\\n Default ## Whatever...\\n {\\n $line = $line\\n }\\n }\\n\\n Add-Content $Path -Value $line -Force\\n }\\n}\\n\",\n \"language\": \"PowerShell\"\n },\n {\n \"code\": \"Update-ConfigurationFile -NumberOfStrawberries 62000 -NumberOfBananas 1024 -SeedsRemoved On -NeedsPeeling Off\\n\\nInvoke-Item -Path \\\".\\\\config.txt\\\"\\n\",\n \"language\": \"PowerShell\"\n },\n {\n \"code\": \"#!/usr/bin/env python\\n\\n#----------------------------------------------------------------------------\\n# STANDARD MODULES\\n#----------------------------------------------------------------------------\\nimport re\\nimport string\\n\\n\\n#----------------------------------------------------------------------------\\n# GLOBAL: VARIABLES\\n#----------------------------------------------------------------------------\\nDISABLED_PREFIX = ';'\\n\\n\\n#----------------------------------------------------------------------------\\n# CLASS Option\\n#----------------------------------------------------------------------------\\nclass Option(object):\\n \\\"\\\"\\\"An option, characterized by its name and its (optional) value. and by\\n its status, which can be enabled or disabled.\\n If its value is None, it is regarded to as a boolean option with a\\n value of true.\\n \\\"\\\"\\\"\\n\\n #------------------------------------------------------------------------\\n def __init__(self, name, value=None, disabled=False,\\n disabled_prefix=DISABLED_PREFIX):\\n \\\"\\\"\\\"Create an Option instance, setting its name to 'name' (always\\n converted to a string) and its value to 'value'. If 'disabled' is\\n True, the option is considered disabled, otherwise enabled.\\n The string 'disabled_prefix' is used as a prefix when generating the\\n string representation of the option.\\n \\\"\\\"\\\"\\n self.name = str(name)\\n self.value = value\\n self.disabled = bool(disabled)\\n self.disabled_prefix = disabled_prefix\\n\\n #------------------------------------------------------------------------\\n def __str__(self):\\n \\\"\\\"\\\"Return a string representation of the Option instance.\\n This always includes the option name, followed by a space and the\\n option value (if it is not None). If the option is disabled, the\\n whole string is preprendend by the string stored in the instance\\n attribute 'disabled_prefix' and a space.\\n \\\"\\\"\\\"\\n disabled = ('', '%s ' % self.disabled_prefix)[self.disabled]\\n value = (' %s' % self.value, '')[self.value is None]\\n return ''.join((disabled, self.name, value))\\n\\n #------------------------------------------------------------------------\\n def get(self):\\n \\\"\\\"\\\"Return the option value.\\n If the stored value is None, the option is regarded to as a\\n boolean one and its enabled status is returned. Othrwise its value\\n is returned.\\n \\\"\\\"\\\"\\n enabled = not bool(self.disabled)\\n if self.value is None:\\n value = enabled\\n else:\\n value = enabled and self.value\\n return value\\n\\n\\n#----------------------------------------------------------------------------\\n# CLASS Config\\n#----------------------------------------------------------------------------\\nclass Config(object):\\n \\\"\\\"\\\"A set of configuration options and comment strings.\\n \\\"\\\"\\\"\\n # Regular expression matching a valid option line.\\n reOPTION = r'^\\\\s*(?P<disabled>%s*)\\\\s*(?P<name>\\\\w+)(?:\\\\s+(?P<value>.+?))?\\\\s*$'\\n\\n #------------------------------------------------------------------------\\n def __init__(self, fname=None, disabled_prefix=DISABLED_PREFIX):\\n \\\"\\\"\\\"Initialize a Config instance, optionally reading the contents of\\n the configuration file 'fname'.\\n The string 'disabled_prefix' is used as a prefix when generating the\\n string representation of the options.\\n \\\"\\\"\\\"\\n self.disabled_prefix = disabled_prefix\\n self.contents = [] # Sequence of strings and Option instances.\\n self.options = {} # Map an option name to an Option instance.\\n self.creOPTION = re.compile(self.reOPTION % self.disabled_prefix)\\n if fname:\\n self.parse_file(fname)\\n\\n #------------------------------------------------------------------------\\n def __str__(self):\\n \\\"\\\"\\\"Return a string representation of the Config instance.\\n This is just the concatenation of all the items stored in the\\n attribute 'contents'.\\n \\\"\\\"\\\"\\n return '\\\\n'.join(map(str, self.contents))\\n\\n #------------------------------------------------------------------------\\n def parse_file(self, fname):\\n \\\"\\\"\\\"Parse all the lines of file 'fname' by applying the method\\n 'parser_lines' on the file contents.\\n \\\"\\\"\\\"\\n with open(fname) as f:\\n self.parse_lines(f)\\n return self\\n\\n #------------------------------------------------------------------------\\n def parse_lines(self, lines):\\n \\\"\\\"\\\"Parse all the lines of iterable 'lines' by invoking the method\\n 'parse_line' for each line in 'lines'.\\n \\\"\\\"\\\"\\n for line in lines:\\n self.parse_line(line)\\n return self\\n\\n #------------------------------------------------------------------------\\n def parse_line(self, line):\\n \\\"\\\"\\\"Parse the line 'line', looking for options.\\n If an option line is found, spaces are stripped from the start and\\n the end of 'line' and any non-printable character is removed as well.\\n Only the first occurrence of an option is processed, all the other\\n occurrences are ignored. A valid option is added to the instance\\n attribute 'contents' (in order to preserve its position among the\\n other lines). It is also added to the mapping stored in the instance\\n attribute 'options'.\\n Any non-option string is added the the instance attribute 'contents',\\n except those lines starting with the string stored into the instance\\n attribute 'disabled_prefix' which are not followed by any option\\n name.\\n \\\"\\\"\\\"\\n s = ''.join(c for c in line.strip() if c in string.printable)\\n moOPTION = self.creOPTION.match(s)\\n if moOPTION:\\n name = moOPTION.group('name').upper()\\n if not name in self.options:\\n self.add_option(name, moOPTION.group('value'),\\n moOPTION.group('disabled'))\\n else:\\n if not s.startswith(self.disabled_prefix):\\n self.contents.append(line.rstrip())\\n return self\\n\\n #------------------------------------------------------------------------\\n def add_option(self, name, value=None, disabled=False):\\n \\\"\\\"\\\"Create a new Option instance, named 'name' (always converted to\\n uppercase) with value 'value' and set its disabled status to\\n 'disabled'.\\n The Option instance is added to the instance attribute 'contents'.\\n It is also added to the mapping stored in the instance attribute\\n 'options'.\\n \\\"\\\"\\\"\\n name = name.upper()\\n opt = Option(name, value, disabled)\\n self.options[name] = opt\\n self.contents.append(opt)\\n return opt\\n\\n #------------------------------------------------------------------------\\n def set_option(self, name, value=None, disabled=False):\\n \\\"\\\"\\\"Look for an option named 'name' (always converted to\\n uppercase) among the options stored in the instance\\n attribute 'options'.\\n If it is not found, a new Option instance is created.\\n In any case its value is set to 'value' and its disabled\\n status to 'disabled'.\\n \\\"\\\"\\\"\\n name = name.upper()\\n opt = self.options.get(name)\\n if opt:\\n opt.value = value\\n opt.disabled = disabled\\n else:\\n opt = self.add_option(name, value, disabled)\\n return opt\\n\\n #------------------------------------------------------------------------\\n def enable_option(self, name, value=None):\\n \\\"\\\"\\\"Enable the option named 'name' (always converted to\\n uppercase) and set its value to 'value'.\\n If the option is not found, it is created and added to the\\n end of the instance attribute 'contents'.\\n \\\"\\\"\\\"\\n return self.set_option(name, value, False)\\n\\n #------------------------------------------------------------------------\\n def disable_option(self, name, value=None):\\n \\\"\\\"\\\"Disable the option named 'name' (always converted to\\n uppercase) and set its value to 'value'.\\n If the option is not found, it is created and added to the\\n end of the instance attribute 'contents'.\\n \\\"\\\"\\\"\\n return self.set_option(name, value, True)\\n\\n #------------------------------------------------------------------------\\n def get_option(self, name):\\n \\\"\\\"\\\"Return the value of the option named 'name' (always\\n converted to uppercase).\\n If the option is not found in the instance attribute\\n 'options', None is returned. If the stored value is None,\\n it is regarded to as a boolean option and its enable status\\n is returned. Otherwise its value is returned.\\n \\\"\\\"\\\"\\n opt = self.options.get(name.upper())\\n value = opt.get() if opt else None\\n return value\\n\\n\\n#----------------------------------------------------------------------------\\n# MAIN\\n#----------------------------------------------------------------------------\\nif __name__ == '__main__':\\n import sys\\n cfg = Config(sys.argv[1] if len(sys.argv) > 1 else None)\\n cfg.disable_option('needspeeling')\\n cfg.enable_option('seedsremoved')\\n cfg.enable_option('numberofbananas', 1024)\\n cfg.enable_option('numberofstrawberries', 62000)\\n print cfg\\n\",\n \"language\": \"Python\"\n },\n {\n \"code\": \"#lang racket\\n\\n(require \\\"options.rkt\\\")\\n\\n\\n(read-options \\\"options-file\\\")\\n(define-options needspeeling seedsremoved numberofbananas numberofstrawberries)\\n\\n;; Disable the needspeeling option (using a semicolon prefix)\\n(set! needspeeling #f)\\n;; Enable the seedsremoved option by removing the semicolon and any\\n;; leading whitespace\\n(set! seedsremoved ENABLE)\\n;; Change the numberofbananas parameter to 1024\\n(set! numberofbananas 1024)\\n;; Enable (or create if it does not exist in the file) a parameter for\\n;; numberofstrawberries with a value of 62000\\n(set! numberofstrawberries 62000)\\n\",\n \"language\": \"Racket\"\n },\n {\n \"code\": \"use File::Temp;\\n\\nmy ($tmpfile, $out) = tempfile;\\n\\nsub MAIN ($file, *%changes) {\\n %changes.=map({; .key.uc => .value });\\n my %seen;\\n\\n for $file.IO.lines {\\n when /:s ^ ('#' .* | '') $/ {\\n say $out: ~$0;\\n }\\n when /:s ^ (';'+)? [(\\\\w+) (\\\\w+)?]? $/ {\\n next if !$1 or %seen{$1.uc}++;\\n my $new = %changes{$1.uc}:delete;\\n say $out: format-line $1, |( !defined($new) ?? ($2, !$0) !!\\n $new ~~ Bool ?? ($2, $new) !! ($new, True) );\\n }\\n default {\\n note \\\"Malformed line: $_\\\\nAborting.\\\";\\n exit 1;\\n }\\n }\\n\\n say $out: format-line .key, |(.value ~~ Bool ?? (Nil, .value) !! (.value, True))\\n for %changes;\\n\\n $out.close;\\n\\n copy $tmpfile, $file;\\n}\\n\\nsub format-line ($key, $value, $enabled) {\\n (\\\"; \\\" if !$enabled) ~ $key.uc ~ (\\\" $value\\\" if defined $value);\\n}\\n\",\n \"language\": \"Raku\"\n },\n {\n \"code\": \"/*REXX program demonstrates how to update a configuration file (four specific tasks).*/\\nparse arg iFID oFID . /*obtain optional arguments from the CL*/\\nif iFID=='' | iFID==\\\",\\\" then iFID= 'UPDATECF.TXT' /*Not given? Then use default.*/\\nif oFID=='' | oFID==\\\",\\\" then oFID='\\\\TEMP\\\\UPDATECF.$$$' /* \\\" \\\" \\\" \\\" \\\" */\\ncall lineout iFID; call lineout oFID /*close the input and the output files.*/\\n$.=0 /*placeholder of the options detected. */\\ncall dos 'ERASE' oFID /*erase a file (with no error message).*/\\nchanged=0 /*nothing changed in the file (so far).*/\\n /* [↓] read the entire config file. */\\n do rec=0 while lines(iFID)\\\\==0 /*read a record; bump the record count.*/\\n z=linein(iFID); zz=space(z) /*get record; elide extraneous blanks.*/\\n say '───────── record:' z /*echo the record just read ──► console*/\\n a=left(zz,1); _=space( translate(zz, ,';') ) /*_: is used to elide multiple \\\";\\\" */\\n if zz=='' | a=='#' then do; call cpy z; iterate; end /*blank or a comment.*/\\n if _=='' then do; changed=1; iterate; end /*elide any semicolons; empty records.*/\\n parse upper var z op . /*obtain the option from the record. */\\n /* [↓] option may have leading or ···*/\\n if a==';' then do; parse upper var z 2 op . /*trailing blanks.*/\\n if op='SEEDSREMOVED' then call new space( substr(z, 2) )\\n call cpy z; $.op=1 /*write the Z record to the output file*/\\n iterate /*rec*/ /* ··· and then go read the next record*/\\n end\\n if $.op then do; changed=1; iterate; end /*is the option already defined? */\\n $.op=1 /* [↑] Yes? Then delete it. */\\n if op=='NEEDSPEELING' then call new \\\";\\\" z\\n if op=='NUMBEROFBANANAS' then call new op 1024\\n if op=='NUMBEROFSTRAWBERRIES' then call new op 62000\\n call cpy z /*write the Z record to the output file*/\\n end /*rec*/\\n\\n nos='NUMBEROFSTRAWBERRIES' /* [↓] Does NOS option need updating? */\\nif \\\\$.nos then do; call new nos 62000; call cpy z; end /*update option.*/\\ncall lineout iFID; call lineout oFID /*close the input and the output files.*/\\nif rec==0 then do; say \\\"ERROR: input file wasn't found:\\\" iFID; exit; end\\nif changed then do /*possibly overwrite the input file. */\\n call dos 'XCOPY' oFID iFID '/y /q',\\\">nul\\\" /*quietly*/\\n say; say center('output file', 79, \\\"▒\\\") /*title. */\\n call dos 'TYPE' oFID /*display content of the output file. */\\n end\\ncall dos 'ERASE' oFID /*erase a file (with no error message).*/\\nexit /*stick a fork in it, we're all done. */\\n/*──────────────────────────────────────────────────────────────────────────────────────*/\\ncpy: call lineout oFID, arg(1); return /*write one line of text ───► oFID. */\\ndos: ''arg(1) word(arg(2) \\\"2>nul\\\",1); return /*execute a DOS command (quietly). */\\nnew: z=arg(1); changed=1; return /*use new Z, indicate changed record. */\\n\",\n \"language\": \"REXX\"\n },\n {\n \"code\": \"fid='updatecf.txt'\\noid='updatecf.xxx'; 'erase' oid\\noptions=translate('FAVOURITEFRUIT NEEDSPEELING SEEDSREMOVED NUMBEROFBANANAS numberofstrawberries')\\ndone.=0\\nDo While lines(fid)>0\\n l=linein(fid)\\n c=left(l,1)\\n option=''\\n If c='#' | l='' Then\\n call o l\\n Else Do\\n If c=';' Then l=substr(l,3)\\n Parse Upper Var l option value\\n Select\\n When option='NEEDSPEELING' Then\\n Call o ';' option\\n When option='SEEDSREMOVED' Then\\n Call o option\\n When option='NUMBEROFBANANAS' Then\\n Call o option 1024\\n When option='FAVOURITEFRUIT' Then\\n Call o l\\n When option='NUMBEROFSTRAWBERRIES' Then\\n Call o option 62000\\n Otherwise\\n Call o '>>>' l\\n End\\n End\\n End\\nDo while options<>''\\n Parse Var options option options\\n If done.option=0 Then\\n Call o option 62000\\n End\\nExit\\no:\\nIf option<>'' & done.option Then\\n Say 'Duplicate' option 'ignored'\\nElse Do\\n Call lineout oid,arg(1)\\n done.option=1\\n End\\nReturn\\n\",\n \"language\": \"REXX\"\n },\n {\n \"code\": \"require 'stringio'\\n\\nclass ConfigFile\\n\\n # create a ConfigFile object from a file\\n def self.file(filename)\\n fh = File.open(filename)\\n obj = self.new(fh)\\n obj.filename = filename\\n fh.close\\n obj\\n end\\n\\n # create a ConfigFile object from a string\\n def self.data(string)\\n fh = StringIO.new(string)\\n obj = self.new(fh)\\n fh.close\\n obj\\n end\\n\\n def initialize(filehandle)\\n @lines = filehandle.readlines\\n @filename = nil\\n tidy_file\\n end\\n attr :filename\\n\\n def save()\\n if @filename\\n File.open(@filename, \\\"w\\\") {|f| f.write(self)}\\n end\\n end\\n\\n def tidy_file()\\n @lines.map! do |line|\\n # remove leading whitespace\\n line.lstrip!\\n\\n if line.match(/^#/)\\n # Lines beginning with hash symbols should not be manipulated and left\\n # unchanged in the revised file.\\n line\\n else\\n # replace double semicolon prefixes with just a single semicolon\\n line.sub!(/^;+\\\\s+/, \\\"; \\\")\\n\\n if line.match(/^; \\\\s*$/)\\n # Any lines beginning with a semicolon or groups of semicolons, but no\\n # following option should be removed\\n line = \\\"\\\"\\n else\\n # remove ... any trailing whitespace on the lines\\n line = line.rstrip + \\\"\\\\n\\\"\\n\\n # Whitespace between the option and paramters should consist only of a\\n # single space\\n if m = line.match(/^(; )?([[:upper:]]+)\\\\s+(.*)/)\\n line = (m[1].nil? ? \\\"\\\" : m[1]) + format_line(m[2], m[3])\\n end\\n end\\n\\n line\\n end\\n end\\n end\\n\\n def format_line(option, value)\\n \\\"%s%s\\\\n\\\" % [option.upcase.strip, value.nil? ? \\\"\\\" : \\\" \\\" + value.to_s.strip]\\n end\\n\\n # returns the index of the option, or nil if not found\\n def find_option(option)\\n @lines.find_index {|line| line.match(/^#{option.upcase.strip}\\\\b/)}\\n end\\n\\n # uncomments a disabled option\\n def enable_option(option)\\n if idx = find_option(\\\"; \\\" + option)\\n @lines[idx][/^; /] = \\\"\\\"\\n end\\n end\\n\\n # comment a line with a semi-colon\\n def disable_option(option)\\n if idx = find_option(option)\\n @lines[idx][/^/] = \\\"; \\\"\\n end\\n end\\n\\n # add an option, or change the value of an existing option.\\n # use nil for the value to set a boolean option\\n def set_value(option, value)\\n if idx = find_option(option)\\n @lines[idx] = format_line(option, value)\\n else\\n @lines << format_line(option, value)\\n end\\n end\\n\\n def to_s\\n @lines.join('')\\n end\\nend\\n\\n\\nconfig = ConfigFile.data(DATA.read)\\nconfig.disable_option('needspeeling')\\nconfig.enable_option('seedsremoved')\\nconfig.set_value('numberofbananas', 1024)\\nconfig.set_value('numberofstrawberries', 62000)\\nputs config\\n\\n\\n__END__\\n# This is a configuration file in standard configuration file format\\n#\\n# Lines begininning with a hash or a semicolon are ignored by the application\\n# program. Blank lines are also ignored by the application program.\\n\\n# The first word on each non comment line is the configuration option.\\n# Remaining words or numbers on the line are configuration parameter\\n# data fields.\\n\\n# Note that configuration option names are not case sensitive. However,\\n# configuration parameter data is case sensitive and the lettercase must\\n# be preserved.\\n\\n# This is a favourite fruit\\nFAVOURITEFRUIT \\t\\tbanana\\n\\n# This is a boolean that should be set\\n NEEDSPEELING\\n\\n# This boolean is commented out\\n;;; SEEDSREMOVED\\n;;;\\n\\n# How many bananas we have\\nNUMBEROFBANANAS 48\\n\",\n \"language\": \"Ruby\"\n },\n {\n \"code\": \"package require Tcl 8.6\\noo::class create Config {\\n variable filename contents\\n constructor fileName {\\n\\tset filename $fileName\\n\\tset contents {}\\n\\ttry {\\n\\t set f [open $filename]\\n\\t ### Sanitize during input\\n\\t foreach line [split [read $f] \\\\n] {\\n\\t\\tif {[string match \\\"#*\\\" $line]} {\\n\\t\\t lappend contents $line\\n\\t\\t continue\\n\\t\\t}\\n\\t\\tif {[regexp {^;\\\\W*$} $line]} continue\\n\\t\\tset line [string trim [regsub -all {[^\\\\u0020-\\\\u007e]} $line {}]]\\n\\t\\tif {[regexp {^(\\\\W*)(\\\\w+)(.*)$} $line -> a b c]} {\\n\\t\\t set line \\\"[regsub -all {^;+} $a {;}][string toupper $b]$c\\\"\\n\\t\\t}\\n\\t\\tlappend contents $line\\n\\t }\\n\\t} finally {\\n\\t if {[info exists f]} {\\n\\t\\tclose $f\\n\\t }\\n\\t}\\n }\\n method save {} {\\n\\tset f [open $filename w]\\n\\tputs $f [join $contents \\\\n]\\n\\tclose $f\\n }\\n\\n # Utility methods (not exposed API)\\n method Transform {pattern vars replacement} {\\n\\tset matched 0\\n\\tset line -1\\n\\tset RE \\\"(?i)^$pattern$\\\"\\n\\tforeach l $contents {\\n\\t incr line\\n\\t if {[uplevel 1 [list regexp $RE $l -> {*}$vars]]} {\\n\\t\\tif {$matched} {\\n\\t\\t set contents [lreplace $contents $line $line]\\n\\t\\t incr line -1\\n\\t\\t} else {\\n\\t\\t lset contents $line [uplevel 1 [list subst $replacement]]\\n\\t\\t}\\n\\t\\tset matched 1\\n\\t }\\n\\t}\\n\\treturn $matched\\n }\\n method Format {k v} {\\n\\tset v \\\" [string trimleft $v]\\\"\\n\\treturn \\\"[string toupper $k][string trimright $v]\\\"\\n }\\n\\n # Public API for modifying options\\n method enable {option} {\\n\\tif {![my Transform \\\";?\\\\\\\\s*($option)\\\\\\\\M\\\\s*(.*)\\\" {k v} \\\\\\n\\t\\t {[my Format $k $v]}]} {\\n\\t lappend contents [my Format $option \\\"\\\"]\\n\\t}\\n }\\n method disable {option} {\\n\\tif {![my Transform \\\";?\\\\\\\\s*($option)\\\\\\\\M\\\\s*(.*)\\\" {k v} \\\\\\n\\t\\t {; [my Format $k $v]}]} {\\n\\t lappend contents \\\"; [my Format $option \\\"\\\"]\\\"\\n\\t}\\n }\\n method set {option {value \\\"\\\"}} {\\n\\tif {![my Transform \\\";?\\\\\\\\s*($option)\\\\\\\\M.*\\\" k {[my Format $k $value]}]} {\\n\\t lappend contents [my Format $option $value]\\n\\t}\\n }\\n}\\n\",\n \"language\": \"Tcl\"\n },\n {\n \"code\": \"set cfg [Config new \\\"sample.cfg\\\"]\\n$cfg disable needspeeling\\n$cfg enable seedsremoved\\n$cfg set numberofbananas 1024\\n$cfg set numberofstrawberries 62000\\n$cfg save\\n\",\n \"language\": \"Tcl\"\n },\n {\n \"code\": \"@(next :args)\\n@configfile\\n@(maybe)\\n@ (next configfile)\\n@ (collect :vars (config))\\n@config\\n@ (end)\\n@(end)\\n@(collect)\\n@ (cases)\\n@option=\\n@ (output :into new_opt_line :filter :upcase)\\n; @option\\n@ (end)\\n@ (or)\\n@option=@val\\n@ (output :into new_opt_line :filter :upcase)\\n@option @val\\n@ (end)\\n@ (or)\\n@option\\n@ (output :into new_opt_line :filter :upcase)\\n@option\\n@ (end)\\n@ (end)\\n@ (next :var config)\\n@ (local new_config)\\n@ (bind new_config ())\\n@ (collect :vars ((opt_there \\\"\\\")))\\n@ (block)\\n@ (cases)\\n@ (cases)\\n@{line /[ \\\\t]*/}\\n@ (or)\\n@{line /#.*/}\\n@ (end)\\n@ (output :append :into new_config)\\n@line\\n@ (end)\\n@ (accept)\\n@ (or)\\n@ (maybe)\\n; @opt_there\\n@ (or)\\n@opt_there @(skip)\\n@ (or)\\n@opt_there\\n@ (or)\\n@original_line\\n@ (end)\\n@ (end)\\n@ (cases)\\n@ (bind opt_there option :filter :upcase)\\n@ (output :append :into new_config)\\n@new_opt_line\\n@ (end)\\n@ (or)\\n@ (output :append :into new_config)\\n@original_line\\n@ (end)\\n@ (end)\\n@ (end)\\n@ (cases)\\n@ (bind opt_there option :filter :upcase)\\n@ (or)\\n@ (output :append :into new_config)\\n@new_opt_line\\n@ (end)\\n@ (end)\\n@ (set config new_config)\\n@(end)\\n@(output)\\n@ (repeat)\\n@config\\n@ (end)\\n@(end)\\n\",\n \"language\": \"TXR\"\n },\n {\n \"code\": \"Set objFSO = CreateObject(\\\"Scripting.FileSystemObject\\\")\\n\\n'Paramater lookups\\nSet objParamLookup = CreateObject(\\\"Scripting.Dictionary\\\")\\nWith objParamLookup\\n\\t.Add \\\"FAVOURITEFRUIT\\\", \\\"banana\\\"\\n\\t.Add \\\"NEEDSPEELING\\\", \\\"\\\"\\n\\t.Add \\\"SEEDSREMOVED\\\", \\\"\\\"\\n\\t.Add \\\"NUMBEROFBANANAS\\\", \\\"1024\\\"\\n\\t.Add \\\"NUMBEROFSTRAWBERRIES\\\", \\\"62000\\\"\\nEnd With\\n\\n'Open the config file for reading.\\nSet objInFile = objFSO.OpenTextFile(objFSO.GetParentFolderName(WScript.ScriptFullName) &_\\n\\t\\\"\\\\IN_config.txt\\\",1)\\n'Initialize output.\\nOutput = \\\"\\\"\\t\\nIsnumberofstrawberries = False\\nWith objInFile\\n\\tDo Until .AtEndOfStream\\n\\t\\tline = .ReadLine\\n\\t\\tIf Left(line,1) = \\\"#\\\" Or line = \\\"\\\" Then\\n\\t\\t\\tOutput = Output & line & vbCrLf\\n\\t\\tElseIf Left(line,1) = \\\" \\\" And InStr(line,\\\"#\\\") Then\\n\\t\\t\\tOutput = Output & Mid(line,InStr(1,line,\\\"#\\\"),1000) & vbCrLf\\n\\t\\tElseIf Replace(Replace(line,\\\";\\\",\\\"\\\"),\\\" \\\",\\\"\\\") <> \\\"\\\" Then\\n\\t\\t\\tIf InStr(1,line,\\\"FAVOURITEFRUIT\\\",1) Then\\n\\t\\t\\t\\tOutput = Output & \\\"FAVOURITEFRUIT\\\" & \\\" \\\" & objParamLookup.Item(\\\"FAVOURITEFRUIT\\\") & vbCrLf\\n\\t\\t\\tElseIf InStr(1,line,\\\"NEEDSPEELING\\\",1) Then\\n\\t\\t\\t\\tOutput = Output & \\\"; \\\" & \\\"NEEDSPEELING\\\" & vbCrLf\\n\\t\\t\\tElseIf InStr(1,line,\\\"SEEDSREMOVED\\\",1) Then\\n\\t\\t\\t\\tOutput = Output & \\\"SEEDSREMOVED\\\" & vbCrLf\\n\\t\\t\\tElseIf InStr(1,line,\\\"NUMBEROFBANANAS\\\",1) Then\\n\\t\\t\\t\\tOutput = Output & \\\"NUMBEROFBANANAS\\\" & \\\" \\\" & objParamLookup.Item(\\\"NUMBEROFBANANAS\\\") & vbCrLf\\n\\t\\t\\tElseIf InStr(1,line,\\\"NUMBEROFSTRAWBERRIES\\\",1) Then\\n\\t\\t\\t\\tOutput = Output & \\\"NUMBEROFSTRAWBERRIES\\\" & \\\" \\\" & objParamLookup.Item(\\\"NUMBEROFSTRAWBERRIES\\\") & vbCrLf\\n\\t\\t\\t\\tIsnumberofstrawberries = True\\n\\t\\t\\tEnd If\\n\\t\\tEnd If\\n\\tLoop\\n\\tIf Isnumberofstrawberries = False Then\\n\\t\\tOutput = Output & \\\"NUMBEROFSTRAWBERRIES\\\" & \\\" \\\" & objParamLookup.Item(\\\"NUMBEROFSTRAWBERRIES\\\") & vbCrLf\\n\\t\\tIsnumberofstrawberries = True\\n\\tEnd If\\n\\t.Close\\nEnd With\\n\\t\\n'Create a new config file.\\nSet objOutFile = objFSO.OpenTextFile(objFSO.GetParentFolderName(WScript.ScriptFullName) &_\\n\\t\\\"\\\\OUT_config.txt\\\",2,True)\\nWith objOutFile\\n\\t.Write Output\\n\\t.Close\\nEnd With\\n\\nSet objFSO = Nothing\\nSet objParamLookup = Nothing\\n\",\n \"language\": \"VBScript\"\n },\n {\n \"code\": \"import \\\"io\\\" for File\\nimport \\\"./ioutil\\\" for FileUtil\\nimport \\\"./dynamic\\\" for Tuple\\nimport \\\"./str\\\" for Str\\n\\nvar fields = [\\\"favouriteFruit\\\", \\\"needsPeeling\\\", \\\"seedsRemoved\\\", \\\"numberOfBananas\\\", \\\"numberOfStrawberries\\\"]\\nvar ConfigData = Tuple.create(\\\"ConfigData\\\", fields)\\n\\nvar updateConfigFile = Fn.new { |fileName, cData|\\n var lines = File.read(fileName).trimEnd().split(FileUtil.lineBreak)\\n var tempFileName = \\\"temp_%(fileName)\\\"\\n var out = File.create(tempFileName)\\n var hadFruit = false\\n var hadPeeling = false\\n var hadSeeds = false\\n var hadBananas = false\\n var hadStrawberries = false\\n\\n for (line in lines) {\\n var cont = false\\n if (line.isEmpty || line[0] == \\\"#\\\") {\\n out.writeBytes(line + \\\"\\\\n\\\")\\n cont = true\\n }\\n if (!cont) {\\n var ln = Str.upper(line.trimStart(\\\";\\\").trim())\\n if (!ln.isEmpty) {\\n if (ln.take(14).join() == \\\"FAVOURITEFRUIT\\\") {\\n if (!hadFruit) {\\n hadFruit = true\\n out.writeBytes(\\\"FAVOURITEFRUIT %(cData.favouriteFruit)\\\\n\\\")\\n }\\n } else if (ln.take(12).join() == \\\"NEEDSPEELING\\\") {\\n if (!hadPeeling) {\\n hadPeeling = true\\n if (cData.needsPeeling) {\\n out.writeBytes(\\\"NEEDSPEELING\\\\n\\\")\\n } else {\\n out.writeBytes(\\\"; NEEDSPEELING\\\\n\\\")\\n }\\n }\\n } else if (ln.take(12).join() == \\\"SEEDSREMOVED\\\") {\\n if (!hadSeeds) {\\n hadSeeds = true\\n if (cData.seedsRemoved) {\\n out.writeBytes(\\\"SEEDSREMOVED\\\\n\\\")\\n } else {\\n out.writeBytes(\\\"; SEEDSREMOVED\\\\n\\\")\\n }\\n }\\n } else if (ln.take(15).join() == \\\"NUMBEROFBANANAS\\\") {\\n if (!hadBananas) {\\n hadBananas = true\\n out.writeBytes(\\\"NUMBEROFBANANAS %(cData.numberOfBananas)\\\\n\\\")\\n }\\n } else if (ln.take(20).join() == \\\"NUMBEROFSTRAWBERRIES\\\") {\\n if (!hadStrawberries) {\\n hadStrawberries = true\\n out.writeBytes(\\\"NUMBEROFSTRAWBERRIES %(cData.numberOfStrawberries)\\\\n\\\")\\n }\\n }\\n }\\n }\\n }\\n\\n if (!hadFruit) {\\n out.writeBytes(\\\"FAVOURITEFRUIT %(cData.favouriteFruit)\\\\n\\\")\\n }\\n\\n if (!hadPeeling) {\\n if (cData.needsPeeling) {\\n out.writeBytes(\\\"NEEDSPEELING\\\\n\\\")\\n } else {\\n out.writeBytes(\\\"; NEEDSPEELING\\\\n\\\")\\n }\\n }\\n\\n if (!hadSeeds) {\\n if (cData.seedsRemoved) {\\n out.writeBytes(\\\"SEEDSREMOVED\\\\n\\\")\\n } else {\\n out.writeBytes(\\\"; SEEDSREMOVED\\\\n\\\")\\n }\\n }\\n\\n if (!hadBananas) {\\n out.writeBytes(\\\"NUMBEROFBANANAS %(cData.numberOfBananas)\\\\n\\\")\\n }\\n\\n if (!hadStrawberries) {\\n out.writeBytes(\\\"NUMBEROFSTRAWBERRIES %(cData.numberOfStrawberries)\\\\n\\\")\\n }\\n\\n out.close()\\n FileUtil.move(tempFileName, fileName, true)\\n}\\n\\nvar fileName = \\\"config.txt\\\"\\nvar cData = ConfigData.new(\\\"banana\\\", false, true, 1024, 62000)\\nupdateConfigFile.call(fileName, cData)\\n\",\n \"language\": \"Wren\"\n }\n]","isConversational":false},"task_name":{"kind":"string","value":"Update-a-configuration-file"}}},{"rowIdx":1788,"cells":{"solutions":{"kind":"list like","value":[{"code":"---\ncategory:\n- String manipulation\nfrom: http://rosettacode.org/wiki/URL_decoding\n","language":"00-META"},{"code":"This task (the reverse of [[URL encoding]] and distinct from [[URL parser]]) is to provide a function \nor mechanism to convert an URL-encoded string into its original unencoded form.\n\n\n;Test cases:\n* The encoded string \"<code><nowiki>http%3A%2F%2Ffoo%20bar%2F</nowiki></code>\" should be reverted to the unencoded form \"<code><nowiki>http://foo bar/</nowiki></code>\".\n\n* The encoded string \"<code><nowiki>google.com/search?q=%60Abdu%27l-Bah%C3%A1</nowiki></code>\" should revert to the unencoded form \"<code><nowiki>google.com/search?q=`Abdu'l-Bahá</nowiki></code>\".\n\n* The encoded string \"<code><nowiki>%25%32%35</nowiki></code>\" should revert to the unencoded form \"<code><nowiki>%25</nowiki></code>\" and '''not''' \"<code><nowiki>%</nowiki></code>\".\n<br><br>\n\n","language":"00-TASK"},{"code":"F url_decode(s)\n V r = ‘’\n V i = 0\n L i < s.len\n I s[i] == ‘%’\n [Byte] b\n L i < s.len & s[i] == ‘%’\n i++\n b.append(Int(s[i.+2], radix' 16))\n i += 2\n r ‘’= b.decode(‘utf-8’)\n E\n r ‘’= s[i]\n i++\n R r\n\nprint(url_decode(‘http%3A%2F%2Ffoo%20bar%2F’))\nprint(url_decode(‘https://ru.wikipedia.org/wiki/%D0%A2%D1%80%D0%B0%D0%BD%D1%81%D0%BF%D0%B0%D0%B9%D0%BB%D0%B5%D1%80’))\n","language":"11l"},{"code":"REPORT Z_DECODE_URL.\n\nDATA: lv_encoded_url TYPE string VALUE 'http%3A%2F%2Ffoo%20bar%2F',\n lv_decoded_url TYPE string.\n\nCALL METHOD CL_HTTP_UTILITY=>UNESCAPE_URL\n EXPORTING\n ESCAPED = lv_encoded_url\n RECEIVING\n UNESCAPED = lv_decoded_url.\n\nWRITE: 'Encoded URL: ', lv_encoded_url, /, 'Decoded URL: ', lv_decoded_url.\n","language":"ABAP"},{"code":"PROC Append(CHAR ARRAY s CHAR c)\n s(0)==+1\n s(s(0))=c\nRETURN\n\nCHAR FUNC GetCharFromHex(CHAR c1,c2)\n CHAR ARRAY hex=['0 '1 '2 '3 '4 '5 '6 '7 '8 '9 'A 'B 'C 'D 'E 'F]\n BYTE i,res\n\n res=0\n FOR i=0 TO 15\n DO\n IF c1=hex(i) THEN res==+i LSH 4 FI\n IF c2=hex(i) THEN res==+i FI\n OD\nRETURN (res)\n\nPROC Decode(CHAR ARRAY in,out)\n BYTE i\n CHAR c\n\n out(0)=0\n i=1\n WHILE i<=in(0)\n DO\n c=in(i)\n i==+1\n IF c='+ THEN\n Append(out,' )\n ELSEIF c='% THEN\n c=GetCharFromHex(in(i),in(i+1))\n i==+2\n Append(out,c)\n ELSE\n Append(out,c)\n FI\n OD\nRETURN\n\nPROC PrintInv(CHAR ARRAY a)\n BYTE i\n\n IF a(0)>0 THEN\n FOR i=1 TO a(0)\n DO\n Put(a(i)%$80)\n OD\n FI\nRETURN\n\nPROC Test(CHAR ARRAY in)\n CHAR ARRAY out(256)\n\n PrintInv(\"input \")\n PrintF(\" %S%E\",in)\n\n Decode(in,out)\n PrintInv(\"decoded\")\n PrintF(\" %S%E%E\",out)\nRETURN\n\nPROC Main()\n Test(\"http%3A%2F%2Ffoo%20bar%2F\")\n Test(\"http%3A%2F%2Ffoo+bar%2F*_-.html\")\nRETURN\n","language":"Action-"},{"code":"with AWS.URL;\nwith Ada.Text_IO; use Ada.Text_IO;\nprocedure Decode is\n Encoded : constant String := \"http%3A%2F%2Ffoo%20bar%2F\";\nbegin\n Put_Line (AWS.URL.Decode (Encoded));\nend Decode;\n","language":"Ada"},{"code":"package URL is\n function Decode (URL : in String) return String;\nend URL;\n","language":"Ada"},{"code":"package body URL is\n function Decode (URL : in String) return String is\n Buffer : String (1 .. URL'Length);\n Filled : Natural := 0;\n Position : Positive := URL'First;\n begin\n while Position in URL'Range loop\n Filled := Filled + 1;\n\n case URL (Position) is\n when '+' =>\n Buffer (Filled) := ' ';\n Position := Position + 1;\n when '%' =>\n Buffer (Filled) :=\n Character'Val\n (Natural'Value\n (\"16#\" & URL (Position + 1 .. Position + 2) & \"#\"));\n Position := Position + 3;\n when others =>\n Buffer (Filled) := URL (Position);\n Position := Position + 1;\n end case;\n end loop;\n\n return Buffer (1 .. Filled);\n end Decode;\nend URL;\n","language":"Ada"},{"code":"with Ada.Command_Line,\n Ada.Text_IO;\n\nwith URL;\n\nprocedure Test_URL_Decode is\n use Ada.Command_Line, Ada.Text_IO;\nbegin\n if Argument_Count = 0 then\n Put_Line (URL.Decode (\"http%3A%2F%2Ffoo%20bar%2F\"));\n else\n for I in 1 .. Argument_Count loop\n Put_Line (URL.Decode (Argument (I)));\n end loop;\n end if;\nend Test_URL_Decode;\n","language":"Ada"},{"code":"# returns c decoded as a hex digit #\nPROC hex value = ( CHAR c )INT: IF c >= \"0\" AND c <= \"9\" THEN ABS c - ABS \"0\"\n ELIF c >= \"A\" AND c <= \"F\" THEN 10 + ( ABS c - ABS \"A\" )\n ELSE 10 + ( ABS c - ABS \"a\" )\n FI;\n\n# returns the URL encoded string decoded - minimal error handling #\nPROC url decode = ( STRING encoded )STRING:\n BEGIN\n [ LWB encoded : UPB encoded ]CHAR result;\n INT result pos := LWB encoded;\n INT pos := LWB encoded;\n INT max pos := UPB encoded;\n INT max encoded := max pos - 3;\n WHILE pos <= UPB encoded\n DO\n IF encoded[ pos ] /= \"%\" AND pos <= max encoded\n THEN\n # not a coded character #\n result[ result pos ] := encoded[ pos ];\n pos +:= 1\n ELSE\n # have an encoded character #\n result[ result pos ] := REPR ( ( 16 * hex value( encoded[ pos + 1 ] ) )\n + hex value( encoded[ pos + 2 ] )\n );\n pos +:= 3\n FI;\n result pos +:= 1\n OD;\n result[ LWB result : result pos - 1 ]\n END # url decode # ;\n\n# test the url decode procedure #\nprint( ( url decode( \"http%3A%2F%2Ffoo%20bar%2F\" ), newline ) );\nprint( ( url decode( \"google.com/search?q=%60Abdu%27l-Bah%C3%A1\" ), newline ) )\n","language":"ALGOL-68"},{"code":"EncodingUtil.urlDecode('http%3A%2F%2Ffoo%20bar%2F', 'UTF-8');\nEncodingUtil.urlDecode('google.com/search?q=%60Abdu%27l-Bah%C3%A1', 'UTF-8');\n","language":"Apex"},{"code":"AST URL decode \"google.com/search?q=%60Abdu%27l-Bah%C3%A1\"\n","language":"AppleScript"},{"code":"print decode.url \"http%3A%2F%2Ffoo%20bar%2F\"\nprint decode.url \"google.com/search?q=%60Abdu%27l-Bah%C3%A1\"\n","language":"Arturo"},{"code":"UriDecode(Uri) {\n LoopOffset := 0\n VarLength := 0\n VarSetCapacity(Var, StrPut(Uri, \"UTF-8\"), 0)\n Loop Parse, Uri\n {\n If (A_Index < LoopOffset) {\n Continue\n }\n If (A_LoopField = Chr(37)) {\n Number := \"0x\" . SubStr(Uri, A_Index + 1, 2)\n LoopOffset := A_Index + 3\n }\n Else {\n Number := Ord(A_LoopField)\n }\n NumPut(Number, Var, VarLength++, \"UChar\")\n }\n Return StrGet(&Var, VarLength, \"UTF-8\")\n}\nMsgBox % UriDecode(\"http%3A%2F%2Ffoo%20bar%2F\")\nMsgBox % UriDecode(\"google.com/search?q=%60Abdu%27l-Bah%C3%A1\")\nMsgBox % UriDecode(\"%25%32%35\")\n","language":"AutoHotkey"},{"code":"# syntax:\nawk '\nBEGIN {\n str = \"http%3A%2F%2Ffoo%20bar%2F\" # \"http://foo bar/\"\n printf(\"%s\\n\",str)\n len=length(str)\n for (i=1;i<=len;i++) {\n if ( substr(str,i,1) == \"%\") {\n L = substr(str,1,i-1) # chars to left of \"%\"\n M = substr(str,i+1,2) # 2 chars to right of \"%\"\n R = substr(str,i+3) # chars to right of \"%xx\"\n str = sprintf(\"%s%c%s\",L,hex2dec(M),R)\n }\n }\n printf(\"%s\\n\",str)\n exit(0)\n}\nfunction hex2dec(s, num) {\n num = index(\"0123456789ABCDEF\",toupper(substr(s,length(s)))) - 1\n sub(/.$/,\"\",s)\n return num + (length(s) ? 16*hex2dec(s) : 0)\n} '\n","language":"AWK"},{"code":"LC_ALL=C\n echo \"http%3A%2F%2Ffoo%20bar%2F\" | gawk -vRS='%[[:xdigit:]]{2}' '\n RT {RT = sprintf(\"%c\",strtonum(\"0x\" substr(RT, 2)))}\n {gsub(/+/,\" \");printf \"%s\", $0 RT}'\n","language":"AWK"},{"code":"FUNCTION Url_Decode$(url$)\n\n LOCAL result$\n\n SPLIT url$ BY \"%\" TO item$ SIZE total\n FOR x = 1 TO total-1\n result$ = result$ & CHR$(DEC(LEFT$(item$[x], 2))) & MID$(item$[x], 3)\n NEXT\n RETURN item$[0] & result$\n\nEND FUNCTION\n\nPRINT Url_Decode$(\"http%3A%2F%2Ffoo%20bar%2F\")\nPRINT Url_Decode$(\"google.com/search?q=%60Abdu%27l-Bah%C3%A1\")\n","language":"BaCon"},{"code":" PRINT FNurldecode(\"http%3A%2F%2Ffoo%20bar%2F\")\n END\n\n DEF FNurldecode(url$)\n LOCAL i%\n REPEAT\n i% = INSTR(url$, \"%\", i%+1)\n IF i% THEN\n url$ = LEFT$(url$,i%-1) + \\\n \\ CHR$EVAL(\"&\"+FNupper(MID$(url$,i%+1,2))) + \\\n \\ MID$(url$,i%+3)\n ENDIF\n UNTIL i% = 0\n = url$\n\n DEF FNupper(A$)\n LOCAL A%,C%\n FOR A% = 1 TO LEN(A$)\n C% = ASCMID$(A$,A%)\n IF C% >= 97 IF C% <= 122 MID$(A$,A%,1) = CHR$(C%-32)\n NEXT\n = A$\n","language":"BBC-BASIC"},{"code":"( ( decode\n = decoded hexcode notencoded\n . :?decoded\n & whl\n ' ( @(!arg:?notencoded \"%\" (% %:?hexcode) ?arg)\n & !decoded !notencoded chr$(x2d$!hexcode):?decoded\n )\n & str$(!decoded !arg)\n )\n & out$(decode$http%3A%2F%2Ffoo%20bar%2F)\n);\n","language":"Bracmat"},{"code":"#include <stdio.h>\n#include <string.h>\n\ninline int ishex(int x)\n{\n\treturn\t(x >= '0' && x <= '9')\t||\n\t\t(x >= 'a' && x <= 'f')\t||\n\t\t(x >= 'A' && x <= 'F');\n}\n\nint decode(const char *s, char *dec)\n{\n\tchar *o;\n\tconst char *end = s + strlen(s);\n\tint c;\n\n\tfor (o = dec; s <= end; o++) {\n\t\tc = *s++;\n\t\tif (c == '+') c = ' ';\n\t\telse if (c == '%' && (\t!ishex(*s++)\t||\n\t\t\t\t\t!ishex(*s++)\t||\n\t\t\t\t\t!sscanf(s - 2, \"%2x\", &c)))\n\t\t\treturn -1;\n\n\t\tif (dec) *o = c;\n\t}\n\n\treturn o - dec;\n}\n\nint main()\n{\n\tconst char *url = \"http%3A%2F%2ffoo+bar%2fabcd\";\n\tchar out[strlen(url) + 1];\n\n\tprintf(\"length: %d\\n\", decode(url, 0));\n\tputs(decode(url, out) < 0 ? \"bad string\" : out);\n\n\treturn 0;\n}\n","language":"C"},{"code":"#include <string>\n#include \"Poco/URI.h\"\n#include <iostream>\n\nint main( ) {\n std::string encoded( \"http%3A%2F%2Ffoo%20bar%2F\" ) ;\n std::string decoded ;\n Poco::URI::decode ( encoded , decoded ) ;\n std::cout << encoded << \" is decoded: \" << decoded << \" !\" << std::endl ;\n return 0 ;\n}\n","language":"C++"},{"code":"using System;\n\nnamespace URLEncode\n{\n internal class Program\n {\n private static void Main(string[] args)\n {\n Console.WriteLine(Decode(\"http%3A%2F%2Ffoo%20bar%2F\"));\n }\n\n private static string Decode(string uri)\n {\n return Uri.UnescapeDataString(uri);\n }\n }\n}\n","language":"C-sharp"},{"code":"(java.net.URLDecoder/decode \"http%3A%2F%2Ffoo%20bar%2F\")\n","language":"Clojure"},{"code":"console.log decodeURIComponent \"http%3A%2F%2Ffoo%20bar%2F?name=Foo%20Barson\"\n","language":"CoffeeScript"},{"code":"> coffee foo.coffee\nhttp://foo bar/?name=Foo Barson\n","language":"CoffeeScript"},{"code":"(defun decode (string &key start)\n (assert (char= (char string start) #\\%))\n (if (>= (length string) (+ start 3))\n (multiple-value-bind (code pos)\n (parse-integer string :start (1+ start) :end (+ start 3) :radix 16 :junk-allowed t)\n (if (= pos (+ start 3))\n (values (code-char code) pos)\n (values #\\% (1+ start))))\n (values #\\% (1+ start))))\n\n(defun url-decode (url)\n (loop with start = 0\n for pos = (position #\\% url :start start)\n collect (subseq url start pos) into chunks\n when pos\n collect (multiple-value-bind (decoded next) (decode url :start pos)\n (setf start next)\n (string decoded))\n into chunks\n while pos\n finally (return (apply #'concatenate 'string chunks))))\n\n(url-decode \"http%3A%2F%2Ffoo%20bar%2F\")\n","language":"Common-Lisp"},{"code":"require \"uri\"\n\nputs URI.decode \"http%3A%2F%2Ffoo%20bar%2F\"\nputs URI.decode \"google.com/search?q=%60Abdu%27l-Bah%C3%A1\"\n","language":"Crystal"},{"code":"import std.stdio, std.uri;\n\nvoid main() {\n writeln(decodeComponent(\"http%3A%2F%2Ffoo%20bar%2F\"));\n}\n","language":"D"},{"code":"program URLEncoding;\n\n{$APPTYPE CONSOLE}\n\nuses IdURI;\n\nbegin\n Writeln(TIdURI.URLDecode('http%3A%2F%2Ffoo%20bar%2F'));\nend.\n","language":"Delphi"},{"code":"IO.inspect URI.decode(\"http%3A%2F%2Ffoo%20bar%2F\")\nIO.inspect URI.decode(\"google.com/search?q=%60Abdu%27l-Bah%C3%A1\")\n","language":"Elixir"},{"code":"open System\n\nlet decode uri = Uri.UnescapeDataString(uri)\n\n[<EntryPoint>]\nlet main argv =\n printfn \"%s\" (decode \"http%3A%2F%2Ffoo%20bar%2F\")\n 0\n","language":"F-Sharp"},{"code":"USING: io kernel urls.encoding ;\nIN: rosetta-code.url-decoding\n\n\"http%3A%2F%2Ffoo%20bar%2F\"\n\"google.com/search?q=%60Abdu%27l-Bah%C3%A1\"\n[ url-decode print ] bi@\n","language":"Factor"},{"code":"function urlDecode(data: String): AnsiString;\nvar\n ch: Char;\n pos, skip: Integer;\n\nbegin\n pos := 0;\n skip := 0;\n Result := '';\n\n for ch in data do begin\n if skip = 0 then begin\n if (ch = '%') and (pos < data.length -2) then begin\n skip := 2;\n Result := Result + AnsiChar(Hex2Dec('$' + data[pos+2] + data[pos+3]));\n\n end else begin\n Result := Result + ch;\n end;\n\n end else begin\n skip := skip - 1;\n end;\n pos := pos +1;\n end;\nend;\n","language":"Free-Pascal-Lazarus"},{"code":"Const alphanum = \"0123456789abcdefghijklmnopqrstuvwxyz\"\n\nFunction ToDecimal (cadena As String, base_ As Uinteger) As Uinteger\n Dim As Uinteger i, n, result = 0\n Dim As Uinteger inlength = Len(cadena)\n\n For i = 1 To inlength\n n = Instr(alphanum, Mid(Lcase(cadena),i,1)) - 1\n n *= (base_^(inlength-i))\n result += n\n Next\n Return result\nEnd Function\n\nFunction url2string(cadena As String) As String\n Dim As String c, nc, res\n\n For j As Integer = 1 To Len(cadena)\n c = Mid(cadena, j, 1)\n If c = \"%\" Then\n nc = Chr(ToDecimal((Mid(cadena, j+1, 2)), 16))\n res &= nc\n j += 2\n Else\n res &= c\n End If\n Next j\n Return res\nEnd Function\n\nDim As String URL = \"http%3A%2F%2Ffoo%20bar%2F\"\n\nPrint \"Supplied URL '\"; URL; \"'\"\nPrint \"URL decoding '\"; url2string(URL); \"'\"\n\nURL = \"google.com/search?q=%60Abdu%27l-Bah%C3%A1\"\nPrint !\"\\nSupplied URL '\"; URL; \"'\"\nPrint \"URL decoding '\"; url2string(URL); \"'\"\nSleep\n","language":"FreeBASIC"},{"code":"URLDecode[\"google.com/search?q=%60Abdu%27l-Bah%C3%A1\",\"UTF8\"]\n","language":"Frink"},{"code":"package main\n\nimport (\n\t\"fmt\"\n\t\"log\"\n\t\"net/url\"\n)\n\nfunc main() {\n\tfor _, escaped := range []string{\n\t\t\"http%3A%2F%2Ffoo%20bar%2F\",\n\t\t\"google.com/search?q=%60Abdu%27l-Bah%C3%A1\",\n\t} {\n\t\tu, err := url.QueryUnescape(escaped)\n\t\tif err != nil {\n\t\t\tlog.Println(err)\n\t\t\tcontinue\n\t\t}\n\t\tfmt.Println(u)\n\t}\n}\n","language":"Go"},{"code":"assert URLDecoder.decode('http%3A%2F%2Ffoo%20bar%2F') == 'http://foo bar/'\n","language":"Groovy"},{"code":"import qualified Data.Char as Char\n\nurlDecode :: String -> Maybe String\nurlDecode [] = Just []\nurlDecode ('%':xs) =\n case xs of\n (a:b:xss) ->\n urlDecode xss\n >>= return . ((Char.chr . read $ \"0x\" ++ [a,b]) :)\n _ -> Nothing\nurlDecode ('+':xs) = urlDecode xs >>= return . (' ' :)\nurlDecode (x:xs) = urlDecode xs >>= return . (x :)\n\nmain :: IO ()\nmain = putStrLn . maybe \"Bad decode\" id $ urlDecode \"http%3A%2F%2Ffoo%20bar%2F\"\n","language":"Haskell"},{"code":"import Data.Char (chr)\nimport Data.List.Split (splitOn)\n\ndeCode :: String -> String\ndeCode url =\n let ps = splitOn \"%\" url\n in concat $\n head ps :\n ((\\(a, b) -> (chr . read) (mappend \"0x\" a) : b) <$> (splitAt 2 <$> tail ps))\n\n-- TEST ------------------------------------------------------------------------\nmain :: IO ()\nmain = putStrLn $ deCode \"http%3A%2F%2Ffoo%20bar%2F\"\n","language":"Haskell"},{"code":"link hexcvt\n\nprocedure main()\nue := \"http%3A%2F%2Ffoo%20bar%2F\"\nud := decodeURL(ue) | stop(\"Improperly encoded string \",image(ue))\nwrite(\"encoded = \",image(ue))\nwrite(\"decoded = \",image(ue))\nend\n\nprocedure decodeURL(s) #: decode URL/URI encoded data\nstatic de\ninitial { # build lookup table for everything\n de := table()\n every de[hexstring(ord(c := !string(&ascii)),2)] := c\n }\n\nc := \"\"\ns ? until pos(0) do # decode every %xx or fail\n c ||:= if =\"%\" then \\de[move(2)] | fail\n else move(1)\nreturn c\nend\n","language":"Icon"},{"code":"require'strings convert'\nurldecode=: rplc&(~.,/;\"_1&a.\"2(,:tolower)'%',.toupper hfd i.#a.)\n","language":"J"},{"code":" urldecode 'http%3A%2F%2Ffoo%20bar%2F'\nhttp://foo bar/\n","language":"J"},{"code":" urldecode 'google.com/search?q=%60Abdu%27l-Bah%C3%A1'\ngoogle.com/search?q=`Abdu'l-Bahá\n","language":"J"},{"code":"import java.net.URLDecoder;\nimport java.nio.charset.StandardCharsets;\n","language":"Java"},{"code":"URLDecoder.decode(\"http%3A%2F%2Ffoo%20bar%2F\", StandardCharsets.UTF_8)\n","language":"Java"},{"code":"import java.util.regex.Matcher;\nimport java.util.regex.Pattern;\n","language":"Java"},{"code":"String decode(String string) {\n Pattern pattern = Pattern.compile(\"%([A-Za-z\\\\d]{2})\");\n Matcher matcher = pattern.matcher(string);\n StringBuilder decoded = new StringBuilder(string);\n char character;\n int start, end, offset = 0;\n while (matcher.find()) {\n character = (char) Integer.parseInt(matcher.group(1), 16);\n /* offset the matched index since were adjusting the string */\n start = matcher.start() - offset;\n end = matcher.end() - offset;\n decoded.replace(start, end, String.valueOf(character));\n offset += 2;\n }\n return decoded.toString();\n}\n","language":"Java"},{"code":"decodeURIComponent(\"http%3A%2F%2Ffoo%20bar%2F\")\n","language":"JavaScript"},{"code":"# Emit . and stop as soon as \"condition\" is true.\ndef until(condition; next):\n def u: if condition then . else (next|u) end;\n u;\n\ndef url_decode:\n # The helper function converts the input string written in the given\n # \"base\" to an integer\n def to_i(base):\n explode\n | reverse\n | map(if 65 <= . and . <= 90 then . + 32 else . end) # downcase\n | map(if . > 96 then . - 87 else . - 48 end) # \"a\" ~ 97 => 10 ~ 87\n | reduce .[] as $c\n # base: [power, ans]\n ([1,0]; (.[0] * base) as $b | [$b, .[1] + (.[0] * $c)]) | .[1];\n\n . as $in\n | length as $length\n | [0, \"\"] # i, answer\n | until ( .[0] >= $length;\n .[0] as $i\n | if $in[$i:$i+1] == \"%\"\n then [ $i + 3, .[1] + ([$in[$i+1:$i+3] | to_i(16)] | implode) ]\n else [ $i + 1, .[1] + $in[$i:$i+1] ]\n end)\n | .[1]; # answer\n","language":"Jq"},{"code":"\"http%3A%2F%2Ffoo%20bar%2F\" | url_decode\n","language":"Jq"},{"code":"\"http://foo bar/\"\n","language":"Jq"},{"code":"using URIParser\n\nenc = \"http%3A%2F%2Ffoo%20bar%2F\"\n\ndcd = unescape(enc)\n\nprintln(enc, \" => \", dcd)\n","language":"Julia"},{"code":"// version 1.1.2\n\nimport java.net.URLDecoder\n\nfun main(args: Array<String>) {\n val encoded = arrayOf(\"http%3A%2F%2Ffoo%20bar%2F\", \"google.com/search?q=%60Abdu%27l-Bah%C3%A1\")\n for (e in encoded) println(URLDecoder.decode(e, \"UTF-8\"))\n}\n","language":"Kotlin"},{"code":"url_decode()\n{\n decode=\"${*//+/ }\"\n eval print -r -- \"\\$'${decode//'%'@(??)/'\\'x\\1\"'\\$'\"}'\" 2>/dev/null\n}\n\nurl_decode \"http%3A%2F%2Ffoo%20bar%2F\"\nurl_decode \"google.com/search?q=%60Abdu%27l-Bah%C3%A1\"\n","language":"Ksh"},{"code":"1) define a new javascript primitive:\n{script\n LAMBDATALK.DICT['decodeURIComponent'] = function() {\n return decodeURIComponent( arguments[0].trim() );\n };\n}\n\n2) and use it:\n{decodeURIComponent http%3A%2F%2Ffoo%20bar%2F}\n-> http://foo bar/\n","language":"Lambdatalk"},{"code":"val .finish = fn(.s) b2s map fn(.x) number(.x, 16), rest split \"%\", .s\nval .decode = fn(.s) replace .s, re/(%[0-9A-Fa-f]{2})+/, .finish\n\nwriteln .decode(\"http%3A%2F%2Ffoo%20bar%2F\")\nwriteln .decode(\"google.com/search?q=%60Abdu%27l-Bah%C3%A1\")\n","language":"Langur"},{"code":"bytes('http%3A%2F%2Ffoo%20bar%2F') -> decodeurl\n","language":"Lasso"},{"code":" dim lookUp$( 256)\n\n for i =0 to 256\n lookUp$( i) =\"%\" +dechex$( i)\n next i\n\n url$ =\"http%3A%2F%2Ffoo%20bar%2F\"\n\n print \"Supplied URL '\"; url$; \"'\"\n print \"As string '\"; url2string$( url$); \"'\"\n\n end\n\nfunction url2string$( i$)\n for j =1 to len( i$)\n c$ =mid$( i$, j, 1)\n if c$ =\"%\" then\n nc$ =chr$( hexdec( mid$( i$, j +1, 2)))\n url2string$ =url2string$ +nc$\n j =j +2\n else\n url2string$ =url2string$ +c$\n end if\n next j\nend function\n","language":"Liberty-BASIC"},{"code":"----------------------------------------\n-- URL decodes a string\n-- @param {string} str\n-- @return {string}\n----------------------------------------\non urldecode (str)\n res = \"\"\n ba = bytearray()\n len = str.length\n repeat with i = 1 to len\n c = str.char[i]\n if (c = \"%\") then\n -- fastest hex-to-dec conversion hack based on Lingo's rgb object\n ba.writeInt8(rgb(str.char[i+1..i+2]).blue)\n i = i + 2\n else if (c = \"+\") then\n ba.writeInt8(32)\n else\n ba.writeInt8(chartonum(c))\n end if\n end repeat\n ba.position = 1\n return ba.readRawString(ba.length)\nend\n","language":"Lingo"},{"code":"put urldecode(\"http%3A%2F%2Ffoo%20bar%2F\")\nput urldecode(\"google.com/search?q=%60Abdu%27l-Bah%C3%A1\")\n","language":"Lingo"},{"code":"put urlDecode(\"http%3A%2F%2Ffoo%20bar%2F\") & cr & \\\n urlDecode(\"google.com/search?q=%60Abdu%27l-Bah%C3%A1\")\n","language":"LiveCode"},{"code":"http://foo bar/\ngoogle.com/search?q=`Abdu'l-Bah√°\n","language":"LiveCode"},{"code":"function decodeChar(hex)\n\treturn string.char(tonumber(hex,16))\nend\n\nfunction decodeString(str)\n\tlocal output, t = string.gsub(str,\"%%(%x%x)\",decodeChar)\n\treturn output\nend\n\n-- will print \"http://foo bar/\"\nprint(decodeString(\"http%3A%2F%2Ffoo%20bar%2F\"))\n","language":"Lua"},{"code":"Module CheckIt {\n Function decodeUrl$(a$) {\n DIM a$()\n a$()=Piece$(a$, \"%\")\n if len(a$())=1 then =str$(a$):exit\n k=each(a$(),2)\n \\\\ convert to one byte per character using str$(string)\n acc$=str$(a$(0))\n While k {\n \\\\ chr$() convert to UTF16LE\n \\\\ str$() convert to ANSI using locale (can be 1033 we can set it before as Locale 1033)\n \\\\ so chr$(0x93) give 0x201C\n \\\\ str$(chr$(0x93)) return one byte 93 in ANSI as string of one byte length\n \\\\ numbers are for UTF-8 so we have to preserve them\n acc$+=str$(Chr$(Eval(\"0x\"+left$(a$(k^),2)))+Mid$(a$(k^),3))\n }\n =acc$\n }\n \\\\ decode from utf8\n final$=DecodeUrl$(\"google.com/search?q=%60Abdu%27l-Bah%C3%A1\")\n Print string$(final$ as utf8dec)=\"google.com/search?q=`Abdu'l-Bahá\"\n final$=DecodeUrl$(\"http%3A%2F%2Ffoo%20bar%2F\")\n Print string$(final$ as utf8dec)=\"http://foo bar/\"\n}\nCheckIt\n","language":"M2000-Interpreter"},{"code":"StringTools:-Decode(\"http%3A%2F%2Ffoo%20bar%2F\", encoding=percent);\n","language":"Maple"},{"code":"URLDecoding[url_] :=\n StringReplace[url, \"%\" ~~ x_ ~~ y_ :> FromDigits[x ~~ y, 16]] //.\n StringExpression[x___, Longest[n__Integer], y___] :>\n StringExpression[x, FromCharacterCode[{n}, \"UTF8\"], y]\n","language":"Mathematica"},{"code":"URLDecoding[\"http%3A%2F%2Ffoo%20bar%2F\"]\n","language":"Mathematica"},{"code":"function u = urldecoding(s)\n u = '';\n k = 1;\n while k<=length(s)\n if s(k) == '%' && k+2 <= length(s)\n u = sprintf('%s%c', u, char(hex2dec(s((k+1):(k+2)))));\n k = k + 3;\n else\n u = sprintf('%s%c', u, s(k));\n k = k + 1;\n end\n end\nend\n","language":"MATLAB"},{"code":"/* NetRexx */\noptions replace format comments java crossref savelog symbols nobinary\n\nurl = [ -\n 'http%3A%2F%2Ffoo%20bar%2F', -\n 'mailto%3A%22Ivan%20Aim%22%20%3Civan%2Eaim%40email%2Ecom%3E', -\n '%6D%61%69%6C%74%6F%3A%22%49%72%6D%61%20%55%73%65%72%22%20%3C%69%72%6D%61%2E%75%73%65%72%40%6D%61%69%6C%2E%63%6F%6D%3E' -\n ]\n\nloop u_ = 0 to url.length - 1\n say url[u_]\n say DecodeURL(url[u_])\n say\n end u_\n\nreturn\n\nmethod DecodeURL(arg) public static\n\n Parse arg encoded\n decoded = ''\n PCT = '%'\n\n loop label e_ while encoded.length() > 0\n parse encoded head (PCT) +1 code +2 tail\n decoded = decoded || head\n select\n when code.strip('T').length() = 2 & code.datatype('X') then do\n code = code.x2c()\n decoded = decoded || code\n end\n when code.strip('T').length() \\= 0 then do\n decoded = decoded || PCT\n tail = code || tail\n end\n otherwise do\n nop\n end\n end\n encoded = tail\n end e_\n\n return decoded\n","language":"NetRexx"},{"code":";; universal decoder, works for ASCII and UTF-8\n;; (source http://www.newlisp.org/index.cgi?page=Code_Snippets)\n(define (url-decode url (opt nil))\n (if opt (replace \"+\" url \" \"))\n (replace \"%([0-9a-f][0-9a-f])\" url (pack \"b\" (int $1 0 16)) 1))\n\n(url-decode \"http%3A%2F%2Ffoo%20bar%2F\")\n","language":"NewLISP"},{"code":"import cgi\n\necho decodeUrl(\"http%3A%2F%2Ffoo%20bar%2F\")\n","language":"Nim"},{"code":"MODULE URLDecoding;\nIMPORT\n URI := URI:String,\n Out := NPCT:Console;\nBEGIN\n Out.String(URI.Unescape(\"http%3A%2F%2Ffoo%20bar%2F\"));Out.Ln;\n Out.String(URI.Unescape(\"google.com/search?q=%60Abdu%27l-Bah%C3%A1\"));Out.Ln;\nEND URLDecoding.\n","language":"Oberon"},{"code":"class UrlDecode {\n function : Main(args : String[]) ~ Nil {\n Net.UrlUtility->Decode(\"http%3A%2F%2Ffoo%20bar%2F\")->PrintLine();\n }\n}\n","language":"Objeck"},{"code":"NSString *encoded = @\"http%3A%2F%2Ffoo%20bar%2F\";\nNSString *normal = [encoded stringByReplacingPercentEscapesUsingEncoding:NSUTF8StringEncoding];\nNSLog(@\"%@\", normal);\n","language":"Objective-C"},{"code":"NSString *encoded = @\"http%3A%2F%2Ffoo%20bar%2F\";\nNSString *normal = [encoded stringByRemovingPercentEncoding];\nNSLog(@\"%@\", normal);\n","language":"Objective-C"},{"code":"$ ocaml\n# #use \"topfind\";;\n# #require \"netstring\";;\n\n# Netencoding.Url.decode \"http%3A%2F%2Ffoo%20bar%2F\" ;;\n- : string = \"http://foo bar/\"\n","language":"OCaml"},{"code":"/* Rexx */\n X = 0\n url. = ''\n X = X + 1; url.0 = X; url.X = 'http%3A%2F%2Ffoo%20bar%2F'\n X = X + 1; url.0 = X; url.X = 'mailto%3A%22Ivan%20Aim%22%20%3Civan%2Eaim%40email%2Ecom%3E'\n X = X + 1; url.0 = X; url.X = '%6D%61%69%6C%74%6F%3A%22%49%72%6D%61%20%55%73%65%72%22%20%3C%69%72%6D%61%2E%75%73%65%72%40%6D%61%69%6C%2E%63%6F%6D%3E'\n\n Do u_ = 1 to url.0\n Say url.u_\n Say DecodeURL(url.u_)\n Say\n End u_\n\nExit\n\nDecodeURL: Procedure\n\n Parse Arg encoded\n decoded = ''\n PCT = '%'\n\n Do label e_ while encoded~length() > 0\n Parse Var encoded head (PCT) +1 code +2 tail\n decoded = decoded || head\n Select\n when code~strip('T')~length() = 2 & code~datatype('X') then Do\n code = code~x2c()\n decoded = decoded || code\n End\n when code~strip('T')~length() \\= 0 then Do\n decoded = decoded || PCT\n tail = code || tail\n End\n otherwise\n Nop\n End\n encoded = tail\n End e_\n\n Return decoded\n","language":"OoRexx"},{"code":"sub urldecode {\n my $s = shift;\n $s =~ tr/\\+/ /;\n $s =~ s/\\%([A-Fa-f0-9]{2})/pack('C', hex($1))/eg;\n return $s;\n}\n\nprint urldecode('http%3A%2F%2Ffoo+bar%2F').\"\\n\";\n","language":"Perl"},{"code":"#!/usr/bin/perl -w\nuse strict ;\nuse URI::Escape ;\n\nmy $encoded = \"http%3A%2F%2Ffoo%20bar%2F\" ;\nmy $unencoded = uri_unescape( $encoded ) ;\nprint \"The unencoded string is $unencoded !\\n\" ;\n","language":"Perl"},{"code":"(phixonline)-->\n <span style=\"color: #000080;font-style:italic;\">--\n -- demo\\rosetta\\decode_url.exw\n -- ===========================\n --</span>\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;\">decode_url</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;\">skip</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">0</span>\n <span style=\"color: #004080;\">string</span> <span style=\"color: #000000;\">res</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #008000;\">\"\"</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: #008080;\">if</span> <span style=\"color: #000000;\">skip</span> <span style=\"color: #008080;\">then</span>\n <span style=\"color: #000000;\">skip</span> <span style=\"color: #0000FF;\">-=</span> <span style=\"color: #000000;\">1</span>\n <span style=\"color: #008080;\">else</span>\n <span style=\"color: #004080;\">integer</span> <span style=\"color: #000000;\">ch</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;\">'%'</span> <span style=\"color: #008080;\">then</span>\n <span style=\"color: #004080;\">sequence</span> <span style=\"color: #000000;\">scanres</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #0000FF;\">{}</span>\n <span style=\"color: #008080;\">if</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: #7060A8;\">length</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">s</span><span style=\"color: #0000FF;\">)</span> <span style=\"color: #008080;\">then</span>\n <span style=\"color: #000000;\">scanres</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">scanf</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;\">i</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: #008000;\">\"%x\"</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;\">scanres</span><span style=\"color: #0000FF;\">)!=</span><span style=\"color: #000000;\">1</span> <span style=\"color: #008080;\">then</span>\n <span style=\"color: #008080;\">return</span> <span style=\"color: #008000;\">\"decode error\"</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">if</span>\n <span style=\"color: #000000;\">skip</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">2</span>\n <span style=\"color: #000000;\">ch</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">scanres</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;\">elsif</span> <span style=\"color: #000000;\">ch</span><span style=\"color: #0000FF;\">=</span><span style=\"color: #008000;\">'+'</span> <span style=\"color: #008080;\">then</span>\n <span style=\"color: #000000;\">ch</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #008000;\">' '</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;\">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: #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: #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;\">decode_url</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #008000;\">\"http%3A%2F%2Ffoo%20bar%2F\"</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;\">decode_url</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #008000;\">\"google.com/search?q=%60Abdu%27l-Bah%C3%A1\"</span><span style=\"color: #0000FF;\">)})</span>\n\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":"<?php\n$encoded = \"http%3A%2F%2Ffoo%20bar%2F\";\n$unencoded = rawurldecode($encoded);\necho \"The unencoded string is $unencoded !\\n\";\n?>\n","language":"PHP"},{"code":"void main()\n{\n array encoded_urls = ({\n \"http%3A%2F%2Ffoo%20bar%2F\",\n \"google.com/search?q=%60Abdu%27l-Bah%C3%A1\"\n });\n\n\n foreach(encoded_urls, string url) {\n string decoded = Protocols.HTTP.uri_decode( url );\n write( string_to_utf8(decoded) +\"\\n\" ); // Assume sink does UTF8\n }\n}\n","language":"Pike"},{"code":"[System.Web.HttpUtility]::UrlDecode(\"http%3A%2F%2Ffoo%20bar%2F\")\n","language":"PowerShell"},{"code":"URL$ = URLDecoder(\"http%3A%2F%2Ffoo%20bar%2F\")\n\nDebug URL$ ; http://foo bar/\n","language":"PureBasic"},{"code":"#Python 2.X\nimport urllib\nprint urllib.unquote(\"http%3A%2F%2Ffoo%20bar%2F\")\n#Python 3.5+\nfrom urllib.parse import unquote\nprint(unquote('http%3A%2F%2Ffoo%20bar%2F'))\n","language":"Python"},{"code":"URLdecode(\"http%3A%2F%2Ffoo%20bar%2F\")\n","language":"R"},{"code":"#lang racket\n(require net/uri-codec)\n(uri-decode \"http%3A%2F%2Ffoo%20bar%2F\")\n","language":"Racket"},{"code":"my @urls = < http%3A%2F%2Ffoo%20bar%2F\n google.com/search?q=%60Abdu%27l-Bah%C3%A1 >;\n\nsay .subst( :g,\n / [ '%' ( <xdigit> ** 2 ) ]+ / ,\n { Blob.new((:16(~$_) for $0)).decode }\n ) for @urls;\n","language":"Raku"},{"code":">> dehex \"http%3A%2F%2Ffoo%20bar%2F\"\n== \"http://foo bar/\"\n>> dehex \"google.com/search?q=%60Abdu%27l-Bah%C3%A1\"\n== \"google.com/search?q=`Abdu'l-Bahá\"\n","language":"Red"},{"code":"create buffer 32000 allot\n\n{{\n create bit 5 allot\n : extract ( $c-$a ) drop @+ bit ! @+ bit 1+ ! bit ;\n : render ( $c-$n )\n dup '+ = [ drop 32 ] ifTrue\n dup 13 = [ drop 32 ] ifTrue\n dup 10 = [ drop 32 ] ifTrue\n dup '% = [ extract hex toNumber decimal ] ifTrue ;\n : <decode> ( $-$ ) repeat @+ 0; render ^buffer'add again ;\n---reveal---\n : decode ( $- ) buffer ^buffer'set <decode> drop ;\n}}\n\n\"http%3A%2F%2Ffoo%20bar%2F\" decode buffer puts\n","language":"Retro"},{"code":"/* Rexx */\n\nDo\n X = 0\n url. = ''\n X = X + 1; url.0 = X; url.X = 'http%3A%2F%2Ffoo%20bar%2F'\n X = X + 1; url.0 = X; url.X = 'mailto%3A%22Ivan%20Aim%22%20%3Civan%2Eaim%40email%2Ecom%3E'\n X = X + 1; url.0 = X; url.X = '%6D%61%69%6C%74%6F%3A%22%49%72%6D%61%20%55%73%65%72%22%20%3C%69%72%6D%61%2E%75%73%65%72%40%6D%61%69%6C%2E%63%6F%6D%3E'\n\n Do u_ = 1 to url.0\n Say url.u_\n Say DecodeURL(url.u_)\n Say\n End u_\n\n Return\nEnd\nExit\n\nDecodeURL:\nProcedure\nDo\n Parse Arg encoded\n decoded = ''\n PCT = '%'\n\n Do while length(encoded) > 0\n Parse Var encoded head (PCT) +1 code +2 tail\n decoded = decoded || head\n Select\n When length(strip(code, 'T')) = 2 & datatype(code, 'X') then Do\n code = x2c(code)\n decoded = decoded || code\n End\n When length(strip(code, 'T')) \\= 0 then Do\n decoded = decoded || PCT\n tail = code || tail\n End\n Otherwise Do\n Nop\n End\n End\n encoded = tail\n End\n\n Return decoded\nEnd\nExit\n","language":"REXX"},{"code":"/*REXX program converts a URL─encoded string ──► its original unencoded form. */\nurl.1='http%3A%2F%2Ffoo%20bar%2F'\nurl.2='mailto%3A%22Ivan%20Aim%22%20%3Civan%2Eaim%40email%2Ecom%3E'\nurl.3='%6D%61%69%6C%74%6F%3A%22%49%72%6D%61%20%55%73%65%72%22%20%3C%69%72%6D%61%2E%75%73%65%72%40%6D%61%69%6C%2E%63%6F%6D%3E'\nURLs =3\n do j=1 for URLs\n say url.j\n say decodeURL(url.j)\n say\n end /*j*/\nexit\n/*──────────────────────────────────────────────────────────────────────────────────────*/\ndecodeURL: procedure; parse arg encoded; decoded= ''\n\n do while encoded\\==''\n parse var encoded head '%' +1 code +2 tail\n decoded= decoded || head\n L= length( strip( code, 'T') )\n select\n when L==2 & datatype(code, \"X\") then decoded= decoded || x2c(code)\n when L\\==0 then do; decoded= decoded'%'\n tail= code || tail\n end\n otherwise nop\n end /*select*/\n encoded= tail\n end /*while*/\n\n return decoded\n","language":"REXX"},{"code":"/*REXX program converts & displays a URL─encoded string ──► its original unencoded form.*/\nurl. =\nurl.1='http%3A%2F%2Ffoo%20bar%2F'\nurl.2='mailto%3A%22Ivan%20Aim%22%20%3Civan%2Eaim%40email%2Ecom%3E'\nurl.3='%6D%61%69%6C%74%6F%3A%22%49%72%6D%61%20%55%73%65%72%22%20%3C%69%72%6D%61%2E%75%73%65%72%40%6D%61%69%6C%2E%63%6F%6D%3E'\n\n do j=1 until url.j==''; say /*process each URL; display blank line.*/\n say url.j /*display the original URL. */\n say URLdecode(url.j) /* \" \" decoded \" */\n end /*j*/\nexit /*stick a fork in it, we're all done. */\n/*──────────────────────────────────────────────────────────────────────────────────────*/\nURLdecode: procedure; parse arg yyy /*get encoded URL from argument list. */\n yyy= translate(yyy, , '+') /*a special case for an encoded blank. */\n URL=\n do until yyy==''\n parse var yyy plain '%' +1 code +2 yyy\n URL= URL || plain\n if datatype(code, 'X') then URL= URL || x2c(code)\n else URL= URL'%'code\n end /*until*/\n return URL\n","language":"REXX"},{"code":"require 'cgi'\nputs CGI.unescape(\"http%3A%2F%2Ffoo%20bar%2F\")\n# => \"http://foo bar/\"\n","language":"Ruby"},{"code":"require 'uri'\nputs URI.decode_www_form_component(\"http%3A%2F%2Ffoo%20bar%2F\")\n# => \"http://foo bar/\"\n","language":"Ruby"},{"code":"const INPUT1: &str = \"http%3A%2F%2Ffoo%20bar%2F\";\nconst INPUT2: &str = \"google.com/search?q=%60Abdu%27l-Bah%C3%A1\";\n\nfn append_frag(text: &mut String, frag: &mut String) {\n if !frag.is_empty() {\n let encoded = frag.chars()\n .collect::<Vec<char>>()\n .chunks(2)\n .map(|ch| {\n u8::from_str_radix(&ch.iter().collect::<String>(), 16).unwrap()\n }).collect::<Vec<u8>>();\n text.push_str(&std::str::from_utf8(&encoded).unwrap());\n frag.clear();\n }\n}\n\nfn decode(text: &str) -> String {\n let mut output = String::new();\n let mut encoded_ch = String::new();\n let mut iter = text.chars();\n while let Some(ch) = iter.next() {\n if ch == '%' {\n encoded_ch.push_str(&format!(\"{}{}\", iter.next().unwrap(), iter.next().unwrap()));\n } else {\n append_frag(&mut output, &mut encoded_ch);\n output.push(ch);\n }\n }\n append_frag(&mut output, &mut encoded_ch);\n output\n}\n\nfn main() {\n println!(\"{}\", decode(INPUT1));\n println!(\"{}\", decode(INPUT2));\n}\n","language":"Rust"},{"code":"import java.net.{URLDecoder, URLEncoder}\nimport scala.compat.Platform.currentTime\n\nobject UrlCoded extends App {\n val original = \"\"\"http://foo bar/\"\"\"\n val encoded: String = URLEncoder.encode(original, \"UTF-8\")\n\n assert(encoded == \"http%3A%2F%2Ffoo+bar%2F\", s\"Original: $original not properly encoded: $encoded\")\n\n val percentEncoding = encoded.replace(\"+\", \"%20\")\n assert(percentEncoding == \"http%3A%2F%2Ffoo%20bar%2F\", s\"Original: $original not properly percent-encoded: $percentEncoding\")\n\n assert(URLDecoder.decode(encoded, \"UTF-8\") == URLDecoder.decode(percentEncoding, \"UTF-8\"))\n\n println(s\"Successfully completed without errors. [total ${currentTime - executionStart} ms]\")\n}\n","language":"Scala"},{"code":"$ include \"seed7_05.s7i\";\n include \"encoding.s7i\";\n\nconst proc: main is func\n begin\n writeln(fromPercentEncoded(\"http%3A%2F%2Ffoo%20bar%2F\"));\n writeln(fromUrlEncoded(\"http%3A%2F%2Ffoo+bar%2F\"));\n end func;\n","language":"Seed7"},{"code":"func urldecode(str) {\n str.gsub!('+', ' ');\n str.gsub!(/\\%([A-Fa-f0-9]{2})/, {|a| 'C'.pack(a.hex)});\n return str;\n}\n\nsay urldecode('http%3A%2F%2Ffoo+bar%2F'); # => \"http://foo bar/\"\n","language":"Sidef"},{"code":"import Foundation\n\nlet encoded = \"http%3A%2F%2Ffoo%20bar%2F\"\nif let normal = encoded.stringByReplacingPercentEscapesUsingEncoding(NSUTF8StringEncoding) {\n println(normal)\n}\n","language":"Swift"},{"code":"proc urlDecode {str} {\n set specialMap {\"[\" \"%5B\" \"]\" \"%5D\"}\n set seqRE {%([0-9a-fA-F]{2})}\n set replacement {[format \"%c\" [scan \"\\1\" \"%2x\"]]}\n set modStr [regsub -all $seqRE [string map $specialMap $str] $replacement]\n return [encoding convertfrom utf-8 [subst -nobackslash -novariable $modStr]]\n}\n","language":"Tcl"},{"code":"puts [urlDecode \"http%3A%2F%2Ffoo%20bar%2F\"]\n","language":"Tcl"},{"code":"$$ MODE TUSCRIPT\nurl_encoded=\"http%3A%2F%2Ffoo%20bar%2F\"\nBUILD S_TABLE hex=\":%><:><2<>2<%:\"\nhex=STRINGS (url_encoded,hex), hex=SPLIT(hex)\nhex=DECODE (hex,hex)\nurl_decoded=SUBSTITUTE(url_encoded,\":%><2<>2<%:\",0,0,hex)\nPRINT \"encoded: \", url_encoded\nPRINT \"decoded: \", url_decoded\n","language":"TUSCRIPT"},{"code":"urldecode() { local u=\"${1//+/ }\"; printf '%b' \"${u//%/\\\\x}\"; }\n","language":"UNIX-Shell"},{"code":"urldecode http%3A%2F%2Ffoo%20bar%2F\nhttp://foo bar/\n\nurldecode google.com/search?q=%60Abdu%27l-Bah%C3%A1\ngoogle.com/search?q=`Abdu'l-Bahároot@\n","language":"UNIX-Shell"},{"code":"function urldecode\n{\n typeset encoded=$1 decoded= rest= c= c1= c2=\n typeset rest2= bug='rest2=${rest}'\n\n if [[ -z ${BASH_VERSION:-} ]]; then\n typeset -i16 hex=0; typeset -i8 oct=0\n\n # bug /usr/bin/sh HP-UX 11.00\n typeset _encoded='xyz%26xyz'\n rest=\"${_encoded#?}\"\n c=\"${_encoded%%${rest}}\"\n if (( ${#c} != 1 )); then\n typeset qm='????????????????????????????????????????????????????????????????????????'\n typeset bug='(( ${#rest} > 0 )) && typeset -L${#rest} rest2=\"${qm}\" || rest2=${rest}'\n fi\n fi\n\n\trest=\"${encoded#?}\"\n\teval ${bug}\n\tc=\"${encoded%%${rest2}}\"\n\tencoded=\"${rest}\"\n\n\twhile [[ -n ${c} ]]; do\n\t\tif [[ ${c} = '%' ]]; then\n\t\t\trest=\"${encoded#?}\"\n\t\t\teval ${bug}\n\t\t\tc1=\"${encoded%%${rest2}}\"\n\t\t\tencoded=\"${rest}\"\n\n\t\t\trest=\"${encoded#?}\"\n\t\t\teval ${bug}\n\t\t\tc2=\"${encoded%%${rest2}}\"\n\t\t\tencoded=\"${rest}\"\n\n\t\t\tif [[ -z ${c1} || -z ${c2} ]]; then\n\t\t\t\tc=\"%${c1}${c2}\"\n\t\t\t\techo \"WARNING: invalid % encoding: ${c}\" >&2\n\t\t\telif [[ -n ${BASH_VERSION:-} ]]; then\n\t\t\t\tc=\"\\\\x${c1}${c2}\"\n\t\t\t\tc=$(\\echo -e \"${c}\")\n\t\t\telse\n\t\t\t\thex=\"16#${c1}${c2}\"; oct=hex\n\t\t\t\tc=\"\\\\0${oct#8\\#}\"\n\t\t\t\tc=$(print -- \"${c}\")\n\t\t\tfi\n\t\telif [[ ${c} = '+' ]]; then\n\t\t\tc=' '\n\t\tfi\n\n\t\tdecoded=\"${decoded}${c}\"\n\n\t\trest=\"${encoded#?}\"\n\t\teval ${bug}\n\t\tc=\"${encoded%%${rest2}}\"\n\t\tencoded=\"${rest}\"\n\tdone\n\n\tif [[ -n ${BASH_VERSION:-} ]]; then\n\t\t\\echo -E \"${decoded}\"\n\telse\n\t\tprint -r -- \"${decoded}\"\n\tfi\n}\n","language":"UNIX-Shell"},{"code":"import net.urllib\nfn main() {\n\tfor escaped in [\n\t\t\"http%3A%2F%2Ffoo%20bar%2F\",\n\t\t\"google.com/search?q=%60Abdu%27l-Bah%C3%A1\",\n ] {\n\t\tu := urllib.query_unescape(escaped)?\n\t\tprintln(u)\n\t}\n}\n","language":"V-(Vlang)"},{"code":"Function RegExTest(str,patrn)\n Dim regEx\n Set regEx = New RegExp\n regEx.IgnoreCase = True\n regEx.Pattern = patrn\n RegExTest = regEx.Test(str)\nEnd Function\n\nFunction URLDecode(sStr)\n Dim str,code,a0\n str=\"\"\n code=sStr\n code=Replace(code,\"+\",\" \")\n While len(code)>0\n If InStr(code,\"%\")>0 Then\n str = str & Mid(code,1,InStr(code,\"%\")-1)\n code = Mid(code,InStr(code,\"%\"))\n a0 = UCase(Mid(code,2,1))\n If a0=\"U\" And RegExTest(code,\"^%u[0-9A-F]{4}\") Then\n str = str & ChrW((Int(\"&H\" & Mid(code,3,4))))\n code = Mid(code,7)\n ElseIf a0=\"E\" And RegExTest(code,\"^(%[0-9A-F]{2}){3}\") Then\n str = str & ChrW((Int(\"&H\" & Mid(code,2,2)) And 15) * 4096 + (Int(\"&H\" & Mid(code,5,2)) And 63) * 64 + (Int(\"&H\" & Mid(code,8,2)) And 63))\n code = Mid(code,10)\n ElseIf a0>=\"C\" And a0<=\"D\" And RegExTest(code,\"^(%[0-9A-F]{2}){2}\") Then\n str = str & ChrW((Int(\"&H\" & Mid(code,2,2)) And 3) * 64 + (Int(\"&H\" & Mid(code,5,2)) And 63))\n code = Mid(code,7)\n ElseIf (a0<=\"B\" Or a0=\"F\") And RegExTest(code,\"^%[0-9A-F]{2}\") Then\n str = str & Chr(Int(\"&H\" & Mid(code,2,2)))\n code = Mid(code,4)\n Else\n str = str & \"%\"\n code = Mid(code,2)\n End If\n Else\n str = str & code\n code = \"\"\n End If\n Wend\n URLDecode = str\nEnd Function\n\nurl = \"http%3A%2F%2Ffoo%20bar%C3%A8%2F\"\nWScript.Echo \"Encoded URL: \" & url & vbCrLf &_\n\t\"Decoded URL: \" & UrlDecode(url)\n","language":"VBScript"},{"code":"import \"./fmt\" for Conv\n\nvar urlDecode = Fn.new { |enc|\n var res = \"\"\n var i = 0\n while (i < enc.count) {\n var c = enc[i]\n if (c == \"\\%\") {\n var b = Conv.atoi(enc[i+1..i+2], 16)\n res = res + String.fromByte(b)\n i = i + 3\n } else {\n res = res + c\n i = i + 1\n }\n }\n return res\n}\n\n// We need to escape % characters in Wren as % is otherwise used for string interpolation.\nvar encs = [\n \"http\\%3A\\%2F\\%2Ffoo\\%20bar\\%2F\",\n \"google.com/search?q=\\%60Abdu\\%27l-Bah\\%C3\\%A1\"\n]\nfor (enc in encs)System.print(urlDecode.call(enc))\n","language":"Wren"},{"code":"code Text=12;\nstring 0; \\use zero-terminated strings\n\nfunc Decode(S0); \\Decode URL string and return its address\nchar S0;\nchar S1(80); \\BEWARE: very temporary string space returned\nint C, N, I, J;\n[I:= 0; J:= 0;\nrepeat C:= S0(I); I:= I+1; \\get char\n if C=^% then \\convert hex to char\n [C:= S0(I); I:= I+1;\n if C>=^a then C:= C & ~$20; \\convert to uppercase\n N:= C - (if C<=^9 then ^0 else ^A-10);\n C:= S0(I); I:= I+1;\n if C>=^a then C:= C & ~$20;\n C:= N*16 + C - (if C<=^9 then ^0 else ^A-10);\n ];\n S1(J):= C; J:= J+1; \\put char in output string\nuntil C=0;\nreturn S1;\n];\n\nText(0, Decode(\"http%3A%2F%2Ffoo%20bar%2f\"))\n","language":"XPL0"},{"code":"sub decode_url$(s$)\n local res$, ch$\n\t\n while(s$ <> \"\")\n ch$ = left$(s$, 1)\n if ch$ = \"%\" then\n ch$ = chr$(dec(mid$(s$, 2, 2)))\n s$ = right$(s$, len(s$) - 3)\n else\n if ch$ = \"+\" ch$ = \" \"\n s$ = right$(s$, len(s$) - 1)\n\tendif\n res$ = res$ + ch$\n wend\n return res$\nend sub\n\nprint decode_url$(\"http%3A%2F%2Ffoo%20bar%2F\")\nprint decode_url$(\"google.com/search?q=%60Abdu%27l-Bah%C3%A1\")\n","language":"Yabasic"},{"code":"\"http%3A%2F%2Ffoo%20bar%2F\".pump(String, // push each char through these fcns:\n fcn(c){ if(c==\"%\") return(Void.Read,2); return(Void.Skip,c) },// %-->read 2 chars else pass through\n fcn(_,b,c){ (b+c).toInt(16).toChar() }) // \"%\" (ignored) \"3\"+\"1\"-->0x31-->\"1\"\n","language":"Zkl"},{"code":"var Curl=Import.lib(\"zklCurl\");\nCurl.urlDecode(\"http%3A%2F%2Ffoo%20bar%2F\");\n","language":"Zkl"}],"string":"[\n {\n \"code\": \"---\\ncategory:\\n- String manipulation\\nfrom: http://rosettacode.org/wiki/URL_decoding\\n\",\n \"language\": \"00-META\"\n },\n {\n \"code\": \"This task (the reverse of [[URL encoding]] and distinct from [[URL parser]]) is to provide a function \\nor mechanism to convert an URL-encoded string into its original unencoded form.\\n\\n\\n;Test cases:\\n* The encoded string \\\"<code><nowiki>http%3A%2F%2Ffoo%20bar%2F</nowiki></code>\\\" should be reverted to the unencoded form \\\"<code><nowiki>http://foo bar/</nowiki></code>\\\".\\n\\n* The encoded string \\\"<code><nowiki>google.com/search?q=%60Abdu%27l-Bah%C3%A1</nowiki></code>\\\" should revert to the unencoded form \\\"<code><nowiki>google.com/search?q=`Abdu'l-Bahá</nowiki></code>\\\".\\n\\n* The encoded string \\\"<code><nowiki>%25%32%35</nowiki></code>\\\" should revert to the unencoded form \\\"<code><nowiki>%25</nowiki></code>\\\" and '''not''' \\\"<code><nowiki>%</nowiki></code>\\\".\\n<br><br>\\n\\n\",\n \"language\": \"00-TASK\"\n },\n {\n \"code\": \"F url_decode(s)\\n V r = ‘’\\n V i = 0\\n L i < s.len\\n I s[i] == ‘%’\\n [Byte] b\\n L i < s.len & s[i] == ‘%’\\n i++\\n b.append(Int(s[i.+2], radix' 16))\\n i += 2\\n r ‘’= b.decode(‘utf-8’)\\n E\\n r ‘’= s[i]\\n i++\\n R r\\n\\nprint(url_decode(‘http%3A%2F%2Ffoo%20bar%2F’))\\nprint(url_decode(‘https://ru.wikipedia.org/wiki/%D0%A2%D1%80%D0%B0%D0%BD%D1%81%D0%BF%D0%B0%D0%B9%D0%BB%D0%B5%D1%80’))\\n\",\n \"language\": \"11l\"\n },\n {\n \"code\": \"REPORT Z_DECODE_URL.\\n\\nDATA: lv_encoded_url TYPE string VALUE 'http%3A%2F%2Ffoo%20bar%2F',\\n lv_decoded_url TYPE string.\\n\\nCALL METHOD CL_HTTP_UTILITY=>UNESCAPE_URL\\n EXPORTING\\n ESCAPED = lv_encoded_url\\n RECEIVING\\n UNESCAPED = lv_decoded_url.\\n\\nWRITE: 'Encoded URL: ', lv_encoded_url, /, 'Decoded URL: ', lv_decoded_url.\\n\",\n \"language\": \"ABAP\"\n },\n {\n \"code\": \"PROC Append(CHAR ARRAY s CHAR c)\\n s(0)==+1\\n s(s(0))=c\\nRETURN\\n\\nCHAR FUNC GetCharFromHex(CHAR c1,c2)\\n CHAR ARRAY hex=['0 '1 '2 '3 '4 '5 '6 '7 '8 '9 'A 'B 'C 'D 'E 'F]\\n BYTE i,res\\n\\n res=0\\n FOR i=0 TO 15\\n DO\\n IF c1=hex(i) THEN res==+i LSH 4 FI\\n IF c2=hex(i) THEN res==+i FI\\n OD\\nRETURN (res)\\n\\nPROC Decode(CHAR ARRAY in,out)\\n BYTE i\\n CHAR c\\n\\n out(0)=0\\n i=1\\n WHILE i<=in(0)\\n DO\\n c=in(i)\\n i==+1\\n IF c='+ THEN\\n Append(out,' )\\n ELSEIF c='% THEN\\n c=GetCharFromHex(in(i),in(i+1))\\n i==+2\\n Append(out,c)\\n ELSE\\n Append(out,c)\\n FI\\n OD\\nRETURN\\n\\nPROC PrintInv(CHAR ARRAY a)\\n BYTE i\\n\\n IF a(0)>0 THEN\\n FOR i=1 TO a(0)\\n DO\\n Put(a(i)%$80)\\n OD\\n FI\\nRETURN\\n\\nPROC Test(CHAR ARRAY in)\\n CHAR ARRAY out(256)\\n\\n PrintInv(\\\"input \\\")\\n PrintF(\\\" %S%E\\\",in)\\n\\n Decode(in,out)\\n PrintInv(\\\"decoded\\\")\\n PrintF(\\\" %S%E%E\\\",out)\\nRETURN\\n\\nPROC Main()\\n Test(\\\"http%3A%2F%2Ffoo%20bar%2F\\\")\\n Test(\\\"http%3A%2F%2Ffoo+bar%2F*_-.html\\\")\\nRETURN\\n\",\n \"language\": \"Action-\"\n },\n {\n \"code\": \"with AWS.URL;\\nwith Ada.Text_IO; use Ada.Text_IO;\\nprocedure Decode is\\n Encoded : constant String := \\\"http%3A%2F%2Ffoo%20bar%2F\\\";\\nbegin\\n Put_Line (AWS.URL.Decode (Encoded));\\nend Decode;\\n\",\n \"language\": \"Ada\"\n },\n {\n \"code\": \"package URL is\\n function Decode (URL : in String) return String;\\nend URL;\\n\",\n \"language\": \"Ada\"\n },\n {\n \"code\": \"package body URL is\\n function Decode (URL : in String) return String is\\n Buffer : String (1 .. URL'Length);\\n Filled : Natural := 0;\\n Position : Positive := URL'First;\\n begin\\n while Position in URL'Range loop\\n Filled := Filled + 1;\\n\\n case URL (Position) is\\n when '+' =>\\n Buffer (Filled) := ' ';\\n Position := Position + 1;\\n when '%' =>\\n Buffer (Filled) :=\\n Character'Val\\n (Natural'Value\\n (\\\"16#\\\" & URL (Position + 1 .. Position + 2) & \\\"#\\\"));\\n Position := Position + 3;\\n when others =>\\n Buffer (Filled) := URL (Position);\\n Position := Position + 1;\\n end case;\\n end loop;\\n\\n return Buffer (1 .. Filled);\\n end Decode;\\nend URL;\\n\",\n \"language\": \"Ada\"\n },\n {\n \"code\": \"with Ada.Command_Line,\\n Ada.Text_IO;\\n\\nwith URL;\\n\\nprocedure Test_URL_Decode is\\n use Ada.Command_Line, Ada.Text_IO;\\nbegin\\n if Argument_Count = 0 then\\n Put_Line (URL.Decode (\\\"http%3A%2F%2Ffoo%20bar%2F\\\"));\\n else\\n for I in 1 .. Argument_Count loop\\n Put_Line (URL.Decode (Argument (I)));\\n end loop;\\n end if;\\nend Test_URL_Decode;\\n\",\n \"language\": \"Ada\"\n },\n {\n \"code\": \"# returns c decoded as a hex digit #\\nPROC hex value = ( CHAR c )INT: IF c >= \\\"0\\\" AND c <= \\\"9\\\" THEN ABS c - ABS \\\"0\\\"\\n ELIF c >= \\\"A\\\" AND c <= \\\"F\\\" THEN 10 + ( ABS c - ABS \\\"A\\\" )\\n ELSE 10 + ( ABS c - ABS \\\"a\\\" )\\n FI;\\n\\n# returns the URL encoded string decoded - minimal error handling #\\nPROC url decode = ( STRING encoded )STRING:\\n BEGIN\\n [ LWB encoded : UPB encoded ]CHAR result;\\n INT result pos := LWB encoded;\\n INT pos := LWB encoded;\\n INT max pos := UPB encoded;\\n INT max encoded := max pos - 3;\\n WHILE pos <= UPB encoded\\n DO\\n IF encoded[ pos ] /= \\\"%\\\" AND pos <= max encoded\\n THEN\\n # not a coded character #\\n result[ result pos ] := encoded[ pos ];\\n pos +:= 1\\n ELSE\\n # have an encoded character #\\n result[ result pos ] := REPR ( ( 16 * hex value( encoded[ pos + 1 ] ) )\\n + hex value( encoded[ pos + 2 ] )\\n );\\n pos +:= 3\\n FI;\\n result pos +:= 1\\n OD;\\n result[ LWB result : result pos - 1 ]\\n END # url decode # ;\\n\\n# test the url decode procedure #\\nprint( ( url decode( \\\"http%3A%2F%2Ffoo%20bar%2F\\\" ), newline ) );\\nprint( ( url decode( \\\"google.com/search?q=%60Abdu%27l-Bah%C3%A1\\\" ), newline ) )\\n\",\n \"language\": \"ALGOL-68\"\n },\n {\n \"code\": \"EncodingUtil.urlDecode('http%3A%2F%2Ffoo%20bar%2F', 'UTF-8');\\nEncodingUtil.urlDecode('google.com/search?q=%60Abdu%27l-Bah%C3%A1', 'UTF-8');\\n\",\n \"language\": \"Apex\"\n },\n {\n \"code\": \"AST URL decode \\\"google.com/search?q=%60Abdu%27l-Bah%C3%A1\\\"\\n\",\n \"language\": \"AppleScript\"\n },\n {\n \"code\": \"print decode.url \\\"http%3A%2F%2Ffoo%20bar%2F\\\"\\nprint decode.url \\\"google.com/search?q=%60Abdu%27l-Bah%C3%A1\\\"\\n\",\n \"language\": \"Arturo\"\n },\n {\n \"code\": \"UriDecode(Uri) {\\n LoopOffset := 0\\n VarLength := 0\\n VarSetCapacity(Var, StrPut(Uri, \\\"UTF-8\\\"), 0)\\n Loop Parse, Uri\\n {\\n If (A_Index < LoopOffset) {\\n Continue\\n }\\n If (A_LoopField = Chr(37)) {\\n Number := \\\"0x\\\" . SubStr(Uri, A_Index + 1, 2)\\n LoopOffset := A_Index + 3\\n }\\n Else {\\n Number := Ord(A_LoopField)\\n }\\n NumPut(Number, Var, VarLength++, \\\"UChar\\\")\\n }\\n Return StrGet(&Var, VarLength, \\\"UTF-8\\\")\\n}\\nMsgBox % UriDecode(\\\"http%3A%2F%2Ffoo%20bar%2F\\\")\\nMsgBox % UriDecode(\\\"google.com/search?q=%60Abdu%27l-Bah%C3%A1\\\")\\nMsgBox % UriDecode(\\\"%25%32%35\\\")\\n\",\n \"language\": \"AutoHotkey\"\n },\n {\n \"code\": \"# syntax:\\nawk '\\nBEGIN {\\n str = \\\"http%3A%2F%2Ffoo%20bar%2F\\\" # \\\"http://foo bar/\\\"\\n printf(\\\"%s\\\\n\\\",str)\\n len=length(str)\\n for (i=1;i<=len;i++) {\\n if ( substr(str,i,1) == \\\"%\\\") {\\n L = substr(str,1,i-1) # chars to left of \\\"%\\\"\\n M = substr(str,i+1,2) # 2 chars to right of \\\"%\\\"\\n R = substr(str,i+3) # chars to right of \\\"%xx\\\"\\n str = sprintf(\\\"%s%c%s\\\",L,hex2dec(M),R)\\n }\\n }\\n printf(\\\"%s\\\\n\\\",str)\\n exit(0)\\n}\\nfunction hex2dec(s, num) {\\n num = index(\\\"0123456789ABCDEF\\\",toupper(substr(s,length(s)))) - 1\\n sub(/.$/,\\\"\\\",s)\\n return num + (length(s) ? 16*hex2dec(s) : 0)\\n} '\\n\",\n \"language\": \"AWK\"\n },\n {\n \"code\": \"LC_ALL=C\\n echo \\\"http%3A%2F%2Ffoo%20bar%2F\\\" | gawk -vRS='%[[:xdigit:]]{2}' '\\n RT {RT = sprintf(\\\"%c\\\",strtonum(\\\"0x\\\" substr(RT, 2)))}\\n {gsub(/+/,\\\" \\\");printf \\\"%s\\\", $0 RT}'\\n\",\n \"language\": \"AWK\"\n },\n {\n \"code\": \"FUNCTION Url_Decode$(url$)\\n\\n LOCAL result$\\n\\n SPLIT url$ BY \\\"%\\\" TO item$ SIZE total\\n FOR x = 1 TO total-1\\n result$ = result$ & CHR$(DEC(LEFT$(item$[x], 2))) & MID$(item$[x], 3)\\n NEXT\\n RETURN item$[0] & result$\\n\\nEND FUNCTION\\n\\nPRINT Url_Decode$(\\\"http%3A%2F%2Ffoo%20bar%2F\\\")\\nPRINT Url_Decode$(\\\"google.com/search?q=%60Abdu%27l-Bah%C3%A1\\\")\\n\",\n \"language\": \"BaCon\"\n },\n {\n \"code\": \" PRINT FNurldecode(\\\"http%3A%2F%2Ffoo%20bar%2F\\\")\\n END\\n\\n DEF FNurldecode(url$)\\n LOCAL i%\\n REPEAT\\n i% = INSTR(url$, \\\"%\\\", i%+1)\\n IF i% THEN\\n url$ = LEFT$(url$,i%-1) + \\\\\\n \\\\ CHR$EVAL(\\\"&\\\"+FNupper(MID$(url$,i%+1,2))) + \\\\\\n \\\\ MID$(url$,i%+3)\\n ENDIF\\n UNTIL i% = 0\\n = url$\\n\\n DEF FNupper(A$)\\n LOCAL A%,C%\\n FOR A% = 1 TO LEN(A$)\\n C% = ASCMID$(A$,A%)\\n IF C% >= 97 IF C% <= 122 MID$(A$,A%,1) = CHR$(C%-32)\\n NEXT\\n = A$\\n\",\n \"language\": \"BBC-BASIC\"\n },\n {\n \"code\": \"( ( decode\\n = decoded hexcode notencoded\\n . :?decoded\\n & whl\\n ' ( @(!arg:?notencoded \\\"%\\\" (% %:?hexcode) ?arg)\\n & !decoded !notencoded chr$(x2d$!hexcode):?decoded\\n )\\n & str$(!decoded !arg)\\n )\\n & out$(decode$http%3A%2F%2Ffoo%20bar%2F)\\n);\\n\",\n \"language\": \"Bracmat\"\n },\n {\n \"code\": \"#include <stdio.h>\\n#include <string.h>\\n\\ninline int ishex(int x)\\n{\\n\\treturn\\t(x >= '0' && x <= '9')\\t||\\n\\t\\t(x >= 'a' && x <= 'f')\\t||\\n\\t\\t(x >= 'A' && x <= 'F');\\n}\\n\\nint decode(const char *s, char *dec)\\n{\\n\\tchar *o;\\n\\tconst char *end = s + strlen(s);\\n\\tint c;\\n\\n\\tfor (o = dec; s <= end; o++) {\\n\\t\\tc = *s++;\\n\\t\\tif (c == '+') c = ' ';\\n\\t\\telse if (c == '%' && (\\t!ishex(*s++)\\t||\\n\\t\\t\\t\\t\\t!ishex(*s++)\\t||\\n\\t\\t\\t\\t\\t!sscanf(s - 2, \\\"%2x\\\", &c)))\\n\\t\\t\\treturn -1;\\n\\n\\t\\tif (dec) *o = c;\\n\\t}\\n\\n\\treturn o - dec;\\n}\\n\\nint main()\\n{\\n\\tconst char *url = \\\"http%3A%2F%2ffoo+bar%2fabcd\\\";\\n\\tchar out[strlen(url) + 1];\\n\\n\\tprintf(\\\"length: %d\\\\n\\\", decode(url, 0));\\n\\tputs(decode(url, out) < 0 ? \\\"bad string\\\" : out);\\n\\n\\treturn 0;\\n}\\n\",\n \"language\": \"C\"\n },\n {\n \"code\": \"#include <string>\\n#include \\\"Poco/URI.h\\\"\\n#include <iostream>\\n\\nint main( ) {\\n std::string encoded( \\\"http%3A%2F%2Ffoo%20bar%2F\\\" ) ;\\n std::string decoded ;\\n Poco::URI::decode ( encoded , decoded ) ;\\n std::cout << encoded << \\\" is decoded: \\\" << decoded << \\\" !\\\" << std::endl ;\\n return 0 ;\\n}\\n\",\n \"language\": \"C++\"\n },\n {\n \"code\": \"using System;\\n\\nnamespace URLEncode\\n{\\n internal class Program\\n {\\n private static void Main(string[] args)\\n {\\n Console.WriteLine(Decode(\\\"http%3A%2F%2Ffoo%20bar%2F\\\"));\\n }\\n\\n private static string Decode(string uri)\\n {\\n return Uri.UnescapeDataString(uri);\\n }\\n }\\n}\\n\",\n \"language\": \"C-sharp\"\n },\n {\n \"code\": \"(java.net.URLDecoder/decode \\\"http%3A%2F%2Ffoo%20bar%2F\\\")\\n\",\n \"language\": \"Clojure\"\n },\n {\n \"code\": \"console.log decodeURIComponent \\\"http%3A%2F%2Ffoo%20bar%2F?name=Foo%20Barson\\\"\\n\",\n \"language\": \"CoffeeScript\"\n },\n {\n \"code\": \"> coffee foo.coffee\\nhttp://foo bar/?name=Foo Barson\\n\",\n \"language\": \"CoffeeScript\"\n },\n {\n \"code\": \"(defun decode (string &key start)\\n (assert (char= (char string start) #\\\\%))\\n (if (>= (length string) (+ start 3))\\n (multiple-value-bind (code pos)\\n (parse-integer string :start (1+ start) :end (+ start 3) :radix 16 :junk-allowed t)\\n (if (= pos (+ start 3))\\n (values (code-char code) pos)\\n (values #\\\\% (1+ start))))\\n (values #\\\\% (1+ start))))\\n\\n(defun url-decode (url)\\n (loop with start = 0\\n for pos = (position #\\\\% url :start start)\\n collect (subseq url start pos) into chunks\\n when pos\\n collect (multiple-value-bind (decoded next) (decode url :start pos)\\n (setf start next)\\n (string decoded))\\n into chunks\\n while pos\\n finally (return (apply #'concatenate 'string chunks))))\\n\\n(url-decode \\\"http%3A%2F%2Ffoo%20bar%2F\\\")\\n\",\n \"language\": \"Common-Lisp\"\n },\n {\n \"code\": \"require \\\"uri\\\"\\n\\nputs URI.decode \\\"http%3A%2F%2Ffoo%20bar%2F\\\"\\nputs URI.decode \\\"google.com/search?q=%60Abdu%27l-Bah%C3%A1\\\"\\n\",\n \"language\": \"Crystal\"\n },\n {\n \"code\": \"import std.stdio, std.uri;\\n\\nvoid main() {\\n writeln(decodeComponent(\\\"http%3A%2F%2Ffoo%20bar%2F\\\"));\\n}\\n\",\n \"language\": \"D\"\n },\n {\n \"code\": \"program URLEncoding;\\n\\n{$APPTYPE CONSOLE}\\n\\nuses IdURI;\\n\\nbegin\\n Writeln(TIdURI.URLDecode('http%3A%2F%2Ffoo%20bar%2F'));\\nend.\\n\",\n \"language\": \"Delphi\"\n },\n {\n \"code\": \"IO.inspect URI.decode(\\\"http%3A%2F%2Ffoo%20bar%2F\\\")\\nIO.inspect URI.decode(\\\"google.com/search?q=%60Abdu%27l-Bah%C3%A1\\\")\\n\",\n \"language\": \"Elixir\"\n },\n {\n \"code\": \"open System\\n\\nlet decode uri = Uri.UnescapeDataString(uri)\\n\\n[<EntryPoint>]\\nlet main argv =\\n printfn \\\"%s\\\" (decode \\\"http%3A%2F%2Ffoo%20bar%2F\\\")\\n 0\\n\",\n \"language\": \"F-Sharp\"\n },\n {\n \"code\": \"USING: io kernel urls.encoding ;\\nIN: rosetta-code.url-decoding\\n\\n\\\"http%3A%2F%2Ffoo%20bar%2F\\\"\\n\\\"google.com/search?q=%60Abdu%27l-Bah%C3%A1\\\"\\n[ url-decode print ] bi@\\n\",\n \"language\": \"Factor\"\n },\n {\n \"code\": \"function urlDecode(data: String): AnsiString;\\nvar\\n ch: Char;\\n pos, skip: Integer;\\n\\nbegin\\n pos := 0;\\n skip := 0;\\n Result := '';\\n\\n for ch in data do begin\\n if skip = 0 then begin\\n if (ch = '%') and (pos < data.length -2) then begin\\n skip := 2;\\n Result := Result + AnsiChar(Hex2Dec('$' + data[pos+2] + data[pos+3]));\\n\\n end else begin\\n Result := Result + ch;\\n end;\\n\\n end else begin\\n skip := skip - 1;\\n end;\\n pos := pos +1;\\n end;\\nend;\\n\",\n \"language\": \"Free-Pascal-Lazarus\"\n },\n {\n \"code\": \"Const alphanum = \\\"0123456789abcdefghijklmnopqrstuvwxyz\\\"\\n\\nFunction ToDecimal (cadena As String, base_ As Uinteger) As Uinteger\\n Dim As Uinteger i, n, result = 0\\n Dim As Uinteger inlength = Len(cadena)\\n\\n For i = 1 To inlength\\n n = Instr(alphanum, Mid(Lcase(cadena),i,1)) - 1\\n n *= (base_^(inlength-i))\\n result += n\\n Next\\n Return result\\nEnd Function\\n\\nFunction url2string(cadena As String) As String\\n Dim As String c, nc, res\\n\\n For j As Integer = 1 To Len(cadena)\\n c = Mid(cadena, j, 1)\\n If c = \\\"%\\\" Then\\n nc = Chr(ToDecimal((Mid(cadena, j+1, 2)), 16))\\n res &= nc\\n j += 2\\n Else\\n res &= c\\n End If\\n Next j\\n Return res\\nEnd Function\\n\\nDim As String URL = \\\"http%3A%2F%2Ffoo%20bar%2F\\\"\\n\\nPrint \\\"Supplied URL '\\\"; URL; \\\"'\\\"\\nPrint \\\"URL decoding '\\\"; url2string(URL); \\\"'\\\"\\n\\nURL = \\\"google.com/search?q=%60Abdu%27l-Bah%C3%A1\\\"\\nPrint !\\\"\\\\nSupplied URL '\\\"; URL; \\\"'\\\"\\nPrint \\\"URL decoding '\\\"; url2string(URL); \\\"'\\\"\\nSleep\\n\",\n \"language\": \"FreeBASIC\"\n },\n {\n \"code\": \"URLDecode[\\\"google.com/search?q=%60Abdu%27l-Bah%C3%A1\\\",\\\"UTF8\\\"]\\n\",\n \"language\": \"Frink\"\n },\n {\n \"code\": \"package main\\n\\nimport (\\n\\t\\\"fmt\\\"\\n\\t\\\"log\\\"\\n\\t\\\"net/url\\\"\\n)\\n\\nfunc main() {\\n\\tfor _, escaped := range []string{\\n\\t\\t\\\"http%3A%2F%2Ffoo%20bar%2F\\\",\\n\\t\\t\\\"google.com/search?q=%60Abdu%27l-Bah%C3%A1\\\",\\n\\t} {\\n\\t\\tu, err := url.QueryUnescape(escaped)\\n\\t\\tif err != nil {\\n\\t\\t\\tlog.Println(err)\\n\\t\\t\\tcontinue\\n\\t\\t}\\n\\t\\tfmt.Println(u)\\n\\t}\\n}\\n\",\n \"language\": \"Go\"\n },\n {\n \"code\": \"assert URLDecoder.decode('http%3A%2F%2Ffoo%20bar%2F') == 'http://foo bar/'\\n\",\n \"language\": \"Groovy\"\n },\n {\n \"code\": \"import qualified Data.Char as Char\\n\\nurlDecode :: String -> Maybe String\\nurlDecode [] = Just []\\nurlDecode ('%':xs) =\\n case xs of\\n (a:b:xss) ->\\n urlDecode xss\\n >>= return . ((Char.chr . read $ \\\"0x\\\" ++ [a,b]) :)\\n _ -> Nothing\\nurlDecode ('+':xs) = urlDecode xs >>= return . (' ' :)\\nurlDecode (x:xs) = urlDecode xs >>= return . (x :)\\n\\nmain :: IO ()\\nmain = putStrLn . maybe \\\"Bad decode\\\" id $ urlDecode \\\"http%3A%2F%2Ffoo%20bar%2F\\\"\\n\",\n \"language\": \"Haskell\"\n },\n {\n \"code\": \"import Data.Char (chr)\\nimport Data.List.Split (splitOn)\\n\\ndeCode :: String -> String\\ndeCode url =\\n let ps = splitOn \\\"%\\\" url\\n in concat $\\n head ps :\\n ((\\\\(a, b) -> (chr . read) (mappend \\\"0x\\\" a) : b) <$> (splitAt 2 <$> tail ps))\\n\\n-- TEST ------------------------------------------------------------------------\\nmain :: IO ()\\nmain = putStrLn $ deCode \\\"http%3A%2F%2Ffoo%20bar%2F\\\"\\n\",\n \"language\": \"Haskell\"\n },\n {\n \"code\": \"link hexcvt\\n\\nprocedure main()\\nue := \\\"http%3A%2F%2Ffoo%20bar%2F\\\"\\nud := decodeURL(ue) | stop(\\\"Improperly encoded string \\\",image(ue))\\nwrite(\\\"encoded = \\\",image(ue))\\nwrite(\\\"decoded = \\\",image(ue))\\nend\\n\\nprocedure decodeURL(s) #: decode URL/URI encoded data\\nstatic de\\ninitial { # build lookup table for everything\\n de := table()\\n every de[hexstring(ord(c := !string(&ascii)),2)] := c\\n }\\n\\nc := \\\"\\\"\\ns ? until pos(0) do # decode every %xx or fail\\n c ||:= if =\\\"%\\\" then \\\\de[move(2)] | fail\\n else move(1)\\nreturn c\\nend\\n\",\n \"language\": \"Icon\"\n },\n {\n \"code\": \"require'strings convert'\\nurldecode=: rplc&(~.,/;\\\"_1&a.\\\"2(,:tolower)'%',.toupper hfd i.#a.)\\n\",\n \"language\": \"J\"\n },\n {\n \"code\": \" urldecode 'http%3A%2F%2Ffoo%20bar%2F'\\nhttp://foo bar/\\n\",\n \"language\": \"J\"\n },\n {\n \"code\": \" urldecode 'google.com/search?q=%60Abdu%27l-Bah%C3%A1'\\ngoogle.com/search?q=`Abdu'l-Bahá\\n\",\n \"language\": \"J\"\n },\n {\n \"code\": \"import java.net.URLDecoder;\\nimport java.nio.charset.StandardCharsets;\\n\",\n \"language\": \"Java\"\n },\n {\n \"code\": \"URLDecoder.decode(\\\"http%3A%2F%2Ffoo%20bar%2F\\\", StandardCharsets.UTF_8)\\n\",\n \"language\": \"Java\"\n },\n {\n \"code\": \"import java.util.regex.Matcher;\\nimport java.util.regex.Pattern;\\n\",\n \"language\": \"Java\"\n },\n {\n \"code\": \"String decode(String string) {\\n Pattern pattern = Pattern.compile(\\\"%([A-Za-z\\\\\\\\d]{2})\\\");\\n Matcher matcher = pattern.matcher(string);\\n StringBuilder decoded = new StringBuilder(string);\\n char character;\\n int start, end, offset = 0;\\n while (matcher.find()) {\\n character = (char) Integer.parseInt(matcher.group(1), 16);\\n /* offset the matched index since were adjusting the string */\\n start = matcher.start() - offset;\\n end = matcher.end() - offset;\\n decoded.replace(start, end, String.valueOf(character));\\n offset += 2;\\n }\\n return decoded.toString();\\n}\\n\",\n \"language\": \"Java\"\n },\n {\n \"code\": \"decodeURIComponent(\\\"http%3A%2F%2Ffoo%20bar%2F\\\")\\n\",\n \"language\": \"JavaScript\"\n },\n {\n \"code\": \"# Emit . and stop as soon as \\\"condition\\\" is true.\\ndef until(condition; next):\\n def u: if condition then . else (next|u) end;\\n u;\\n\\ndef url_decode:\\n # The helper function converts the input string written in the given\\n # \\\"base\\\" to an integer\\n def to_i(base):\\n explode\\n | reverse\\n | map(if 65 <= . and . <= 90 then . + 32 else . end) # downcase\\n | map(if . > 96 then . - 87 else . - 48 end) # \\\"a\\\" ~ 97 => 10 ~ 87\\n | reduce .[] as $c\\n # base: [power, ans]\\n ([1,0]; (.[0] * base) as $b | [$b, .[1] + (.[0] * $c)]) | .[1];\\n\\n . as $in\\n | length as $length\\n | [0, \\\"\\\"] # i, answer\\n | until ( .[0] >= $length;\\n .[0] as $i\\n | if $in[$i:$i+1] == \\\"%\\\"\\n then [ $i + 3, .[1] + ([$in[$i+1:$i+3] | to_i(16)] | implode) ]\\n else [ $i + 1, .[1] + $in[$i:$i+1] ]\\n end)\\n | .[1]; # answer\\n\",\n \"language\": \"Jq\"\n },\n {\n \"code\": \"\\\"http%3A%2F%2Ffoo%20bar%2F\\\" | url_decode\\n\",\n \"language\": \"Jq\"\n },\n {\n \"code\": \"\\\"http://foo bar/\\\"\\n\",\n \"language\": \"Jq\"\n },\n {\n \"code\": \"using URIParser\\n\\nenc = \\\"http%3A%2F%2Ffoo%20bar%2F\\\"\\n\\ndcd = unescape(enc)\\n\\nprintln(enc, \\\" => \\\", dcd)\\n\",\n \"language\": \"Julia\"\n },\n {\n \"code\": \"// version 1.1.2\\n\\nimport java.net.URLDecoder\\n\\nfun main(args: Array<String>) {\\n val encoded = arrayOf(\\\"http%3A%2F%2Ffoo%20bar%2F\\\", \\\"google.com/search?q=%60Abdu%27l-Bah%C3%A1\\\")\\n for (e in encoded) println(URLDecoder.decode(e, \\\"UTF-8\\\"))\\n}\\n\",\n \"language\": \"Kotlin\"\n },\n {\n \"code\": \"url_decode()\\n{\\n decode=\\\"${*//+/ }\\\"\\n eval print -r -- \\\"\\\\$'${decode//'%'@(??)/'\\\\'x\\\\1\\\"'\\\\$'\\\"}'\\\" 2>/dev/null\\n}\\n\\nurl_decode \\\"http%3A%2F%2Ffoo%20bar%2F\\\"\\nurl_decode \\\"google.com/search?q=%60Abdu%27l-Bah%C3%A1\\\"\\n\",\n \"language\": \"Ksh\"\n },\n {\n \"code\": \"1) define a new javascript primitive:\\n{script\\n LAMBDATALK.DICT['decodeURIComponent'] = function() {\\n return decodeURIComponent( arguments[0].trim() );\\n };\\n}\\n\\n2) and use it:\\n{decodeURIComponent http%3A%2F%2Ffoo%20bar%2F}\\n-> http://foo bar/\\n\",\n \"language\": \"Lambdatalk\"\n },\n {\n \"code\": \"val .finish = fn(.s) b2s map fn(.x) number(.x, 16), rest split \\\"%\\\", .s\\nval .decode = fn(.s) replace .s, re/(%[0-9A-Fa-f]{2})+/, .finish\\n\\nwriteln .decode(\\\"http%3A%2F%2Ffoo%20bar%2F\\\")\\nwriteln .decode(\\\"google.com/search?q=%60Abdu%27l-Bah%C3%A1\\\")\\n\",\n \"language\": \"Langur\"\n },\n {\n \"code\": \"bytes('http%3A%2F%2Ffoo%20bar%2F') -> decodeurl\\n\",\n \"language\": \"Lasso\"\n },\n {\n \"code\": \" dim lookUp$( 256)\\n\\n for i =0 to 256\\n lookUp$( i) =\\\"%\\\" +dechex$( i)\\n next i\\n\\n url$ =\\\"http%3A%2F%2Ffoo%20bar%2F\\\"\\n\\n print \\\"Supplied URL '\\\"; url$; \\\"'\\\"\\n print \\\"As string '\\\"; url2string$( url$); \\\"'\\\"\\n\\n end\\n\\nfunction url2string$( i$)\\n for j =1 to len( i$)\\n c$ =mid$( i$, j, 1)\\n if c$ =\\\"%\\\" then\\n nc$ =chr$( hexdec( mid$( i$, j +1, 2)))\\n url2string$ =url2string$ +nc$\\n j =j +2\\n else\\n url2string$ =url2string$ +c$\\n end if\\n next j\\nend function\\n\",\n \"language\": \"Liberty-BASIC\"\n },\n {\n \"code\": \"----------------------------------------\\n-- URL decodes a string\\n-- @param {string} str\\n-- @return {string}\\n----------------------------------------\\non urldecode (str)\\n res = \\\"\\\"\\n ba = bytearray()\\n len = str.length\\n repeat with i = 1 to len\\n c = str.char[i]\\n if (c = \\\"%\\\") then\\n -- fastest hex-to-dec conversion hack based on Lingo's rgb object\\n ba.writeInt8(rgb(str.char[i+1..i+2]).blue)\\n i = i + 2\\n else if (c = \\\"+\\\") then\\n ba.writeInt8(32)\\n else\\n ba.writeInt8(chartonum(c))\\n end if\\n end repeat\\n ba.position = 1\\n return ba.readRawString(ba.length)\\nend\\n\",\n \"language\": \"Lingo\"\n },\n {\n \"code\": \"put urldecode(\\\"http%3A%2F%2Ffoo%20bar%2F\\\")\\nput urldecode(\\\"google.com/search?q=%60Abdu%27l-Bah%C3%A1\\\")\\n\",\n \"language\": \"Lingo\"\n },\n {\n \"code\": \"put urlDecode(\\\"http%3A%2F%2Ffoo%20bar%2F\\\") & cr & \\\\\\n urlDecode(\\\"google.com/search?q=%60Abdu%27l-Bah%C3%A1\\\")\\n\",\n \"language\": \"LiveCode\"\n },\n {\n \"code\": \"http://foo bar/\\ngoogle.com/search?q=`Abdu'l-Bah√°\\n\",\n \"language\": \"LiveCode\"\n },\n {\n \"code\": \"function decodeChar(hex)\\n\\treturn string.char(tonumber(hex,16))\\nend\\n\\nfunction decodeString(str)\\n\\tlocal output, t = string.gsub(str,\\\"%%(%x%x)\\\",decodeChar)\\n\\treturn output\\nend\\n\\n-- will print \\\"http://foo bar/\\\"\\nprint(decodeString(\\\"http%3A%2F%2Ffoo%20bar%2F\\\"))\\n\",\n \"language\": \"Lua\"\n },\n {\n \"code\": \"Module CheckIt {\\n Function decodeUrl$(a$) {\\n DIM a$()\\n a$()=Piece$(a$, \\\"%\\\")\\n if len(a$())=1 then =str$(a$):exit\\n k=each(a$(),2)\\n \\\\\\\\ convert to one byte per character using str$(string)\\n acc$=str$(a$(0))\\n While k {\\n \\\\\\\\ chr$() convert to UTF16LE\\n \\\\\\\\ str$() convert to ANSI using locale (can be 1033 we can set it before as Locale 1033)\\n \\\\\\\\ so chr$(0x93) give 0x201C\\n \\\\\\\\ str$(chr$(0x93)) return one byte 93 in ANSI as string of one byte length\\n \\\\\\\\ numbers are for UTF-8 so we have to preserve them\\n acc$+=str$(Chr$(Eval(\\\"0x\\\"+left$(a$(k^),2)))+Mid$(a$(k^),3))\\n }\\n =acc$\\n }\\n \\\\\\\\ decode from utf8\\n final$=DecodeUrl$(\\\"google.com/search?q=%60Abdu%27l-Bah%C3%A1\\\")\\n Print string$(final$ as utf8dec)=\\\"google.com/search?q=`Abdu'l-Bahá\\\"\\n final$=DecodeUrl$(\\\"http%3A%2F%2Ffoo%20bar%2F\\\")\\n Print string$(final$ as utf8dec)=\\\"http://foo bar/\\\"\\n}\\nCheckIt\\n\",\n \"language\": \"M2000-Interpreter\"\n },\n {\n \"code\": \"StringTools:-Decode(\\\"http%3A%2F%2Ffoo%20bar%2F\\\", encoding=percent);\\n\",\n \"language\": \"Maple\"\n },\n {\n \"code\": \"URLDecoding[url_] :=\\n StringReplace[url, \\\"%\\\" ~~ x_ ~~ y_ :> FromDigits[x ~~ y, 16]] //.\\n StringExpression[x___, Longest[n__Integer], y___] :>\\n StringExpression[x, FromCharacterCode[{n}, \\\"UTF8\\\"], y]\\n\",\n \"language\": \"Mathematica\"\n },\n {\n \"code\": \"URLDecoding[\\\"http%3A%2F%2Ffoo%20bar%2F\\\"]\\n\",\n \"language\": \"Mathematica\"\n },\n {\n \"code\": \"function u = urldecoding(s)\\n u = '';\\n k = 1;\\n while k<=length(s)\\n if s(k) == '%' && k+2 <= length(s)\\n u = sprintf('%s%c', u, char(hex2dec(s((k+1):(k+2)))));\\n k = k + 3;\\n else\\n u = sprintf('%s%c', u, s(k));\\n k = k + 1;\\n end\\n end\\nend\\n\",\n \"language\": \"MATLAB\"\n },\n {\n \"code\": \"/* NetRexx */\\noptions replace format comments java crossref savelog symbols nobinary\\n\\nurl = [ -\\n 'http%3A%2F%2Ffoo%20bar%2F', -\\n 'mailto%3A%22Ivan%20Aim%22%20%3Civan%2Eaim%40email%2Ecom%3E', -\\n '%6D%61%69%6C%74%6F%3A%22%49%72%6D%61%20%55%73%65%72%22%20%3C%69%72%6D%61%2E%75%73%65%72%40%6D%61%69%6C%2E%63%6F%6D%3E' -\\n ]\\n\\nloop u_ = 0 to url.length - 1\\n say url[u_]\\n say DecodeURL(url[u_])\\n say\\n end u_\\n\\nreturn\\n\\nmethod DecodeURL(arg) public static\\n\\n Parse arg encoded\\n decoded = ''\\n PCT = '%'\\n\\n loop label e_ while encoded.length() > 0\\n parse encoded head (PCT) +1 code +2 tail\\n decoded = decoded || head\\n select\\n when code.strip('T').length() = 2 & code.datatype('X') then do\\n code = code.x2c()\\n decoded = decoded || code\\n end\\n when code.strip('T').length() \\\\= 0 then do\\n decoded = decoded || PCT\\n tail = code || tail\\n end\\n otherwise do\\n nop\\n end\\n end\\n encoded = tail\\n end e_\\n\\n return decoded\\n\",\n \"language\": \"NetRexx\"\n },\n {\n \"code\": \";; universal decoder, works for ASCII and UTF-8\\n;; (source http://www.newlisp.org/index.cgi?page=Code_Snippets)\\n(define (url-decode url (opt nil))\\n (if opt (replace \\\"+\\\" url \\\" \\\"))\\n (replace \\\"%([0-9a-f][0-9a-f])\\\" url (pack \\\"b\\\" (int $1 0 16)) 1))\\n\\n(url-decode \\\"http%3A%2F%2Ffoo%20bar%2F\\\")\\n\",\n \"language\": \"NewLISP\"\n },\n {\n \"code\": \"import cgi\\n\\necho decodeUrl(\\\"http%3A%2F%2Ffoo%20bar%2F\\\")\\n\",\n \"language\": \"Nim\"\n },\n {\n \"code\": \"MODULE URLDecoding;\\nIMPORT\\n URI := URI:String,\\n Out := NPCT:Console;\\nBEGIN\\n Out.String(URI.Unescape(\\\"http%3A%2F%2Ffoo%20bar%2F\\\"));Out.Ln;\\n Out.String(URI.Unescape(\\\"google.com/search?q=%60Abdu%27l-Bah%C3%A1\\\"));Out.Ln;\\nEND URLDecoding.\\n\",\n \"language\": \"Oberon\"\n },\n {\n \"code\": \"class UrlDecode {\\n function : Main(args : String[]) ~ Nil {\\n Net.UrlUtility->Decode(\\\"http%3A%2F%2Ffoo%20bar%2F\\\")->PrintLine();\\n }\\n}\\n\",\n \"language\": \"Objeck\"\n },\n {\n \"code\": \"NSString *encoded = @\\\"http%3A%2F%2Ffoo%20bar%2F\\\";\\nNSString *normal = [encoded stringByReplacingPercentEscapesUsingEncoding:NSUTF8StringEncoding];\\nNSLog(@\\\"%@\\\", normal);\\n\",\n \"language\": \"Objective-C\"\n },\n {\n \"code\": \"NSString *encoded = @\\\"http%3A%2F%2Ffoo%20bar%2F\\\";\\nNSString *normal = [encoded stringByRemovingPercentEncoding];\\nNSLog(@\\\"%@\\\", normal);\\n\",\n \"language\": \"Objective-C\"\n },\n {\n \"code\": \"$ ocaml\\n# #use \\\"topfind\\\";;\\n# #require \\\"netstring\\\";;\\n\\n# Netencoding.Url.decode \\\"http%3A%2F%2Ffoo%20bar%2F\\\" ;;\\n- : string = \\\"http://foo bar/\\\"\\n\",\n \"language\": \"OCaml\"\n },\n {\n \"code\": \"/* Rexx */\\n X = 0\\n url. = ''\\n X = X + 1; url.0 = X; url.X = 'http%3A%2F%2Ffoo%20bar%2F'\\n X = X + 1; url.0 = X; url.X = 'mailto%3A%22Ivan%20Aim%22%20%3Civan%2Eaim%40email%2Ecom%3E'\\n X = X + 1; url.0 = X; url.X = '%6D%61%69%6C%74%6F%3A%22%49%72%6D%61%20%55%73%65%72%22%20%3C%69%72%6D%61%2E%75%73%65%72%40%6D%61%69%6C%2E%63%6F%6D%3E'\\n\\n Do u_ = 1 to url.0\\n Say url.u_\\n Say DecodeURL(url.u_)\\n Say\\n End u_\\n\\nExit\\n\\nDecodeURL: Procedure\\n\\n Parse Arg encoded\\n decoded = ''\\n PCT = '%'\\n\\n Do label e_ while encoded~length() > 0\\n Parse Var encoded head (PCT) +1 code +2 tail\\n decoded = decoded || head\\n Select\\n when code~strip('T')~length() = 2 & code~datatype('X') then Do\\n code = code~x2c()\\n decoded = decoded || code\\n End\\n when code~strip('T')~length() \\\\= 0 then Do\\n decoded = decoded || PCT\\n tail = code || tail\\n End\\n otherwise\\n Nop\\n End\\n encoded = tail\\n End e_\\n\\n Return decoded\\n\",\n \"language\": \"OoRexx\"\n },\n {\n \"code\": \"sub urldecode {\\n my $s = shift;\\n $s =~ tr/\\\\+/ /;\\n $s =~ s/\\\\%([A-Fa-f0-9]{2})/pack('C', hex($1))/eg;\\n return $s;\\n}\\n\\nprint urldecode('http%3A%2F%2Ffoo+bar%2F').\\\"\\\\n\\\";\\n\",\n \"language\": \"Perl\"\n },\n {\n \"code\": \"#!/usr/bin/perl -w\\nuse strict ;\\nuse URI::Escape ;\\n\\nmy $encoded = \\\"http%3A%2F%2Ffoo%20bar%2F\\\" ;\\nmy $unencoded = uri_unescape( $encoded ) ;\\nprint \\\"The unencoded string is $unencoded !\\\\n\\\" ;\\n\",\n \"language\": \"Perl\"\n },\n {\n \"code\": \"(phixonline)-->\\n <span style=\\\"color: #000080;font-style:italic;\\\">--\\n -- demo\\\\rosetta\\\\decode_url.exw\\n -- ===========================\\n --</span>\\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;\\\">decode_url</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;\\\">skip</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">0</span>\\n <span style=\\\"color: #004080;\\\">string</span> <span style=\\\"color: #000000;\\\">res</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #008000;\\\">\\\"\\\"</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: #008080;\\\">if</span> <span style=\\\"color: #000000;\\\">skip</span> <span style=\\\"color: #008080;\\\">then</span>\\n <span style=\\\"color: #000000;\\\">skip</span> <span style=\\\"color: #0000FF;\\\">-=</span> <span style=\\\"color: #000000;\\\">1</span>\\n <span style=\\\"color: #008080;\\\">else</span>\\n <span style=\\\"color: #004080;\\\">integer</span> <span style=\\\"color: #000000;\\\">ch</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;\\\">'%'</span> <span style=\\\"color: #008080;\\\">then</span>\\n <span style=\\\"color: #004080;\\\">sequence</span> <span style=\\\"color: #000000;\\\">scanres</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #0000FF;\\\">{}</span>\\n <span style=\\\"color: #008080;\\\">if</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: #7060A8;\\\">length</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">s</span><span style=\\\"color: #0000FF;\\\">)</span> <span style=\\\"color: #008080;\\\">then</span>\\n <span style=\\\"color: #000000;\\\">scanres</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">scanf</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;\\\">i</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: #008000;\\\">\\\"%x\\\"</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;\\\">scanres</span><span style=\\\"color: #0000FF;\\\">)!=</span><span style=\\\"color: #000000;\\\">1</span> <span style=\\\"color: #008080;\\\">then</span>\\n <span style=\\\"color: #008080;\\\">return</span> <span style=\\\"color: #008000;\\\">\\\"decode error\\\"</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">if</span>\\n <span style=\\\"color: #000000;\\\">skip</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">2</span>\\n <span style=\\\"color: #000000;\\\">ch</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">scanres</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;\\\">elsif</span> <span style=\\\"color: #000000;\\\">ch</span><span style=\\\"color: #0000FF;\\\">=</span><span style=\\\"color: #008000;\\\">'+'</span> <span style=\\\"color: #008080;\\\">then</span>\\n <span style=\\\"color: #000000;\\\">ch</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #008000;\\\">' '</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;\\\">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: #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: #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;\\\">decode_url</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #008000;\\\">\\\"http%3A%2F%2Ffoo%20bar%2F\\\"</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;\\\">decode_url</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #008000;\\\">\\\"google.com/search?q=%60Abdu%27l-Bah%C3%A1\\\"</span><span style=\\\"color: #0000FF;\\\">)})</span>\\n\\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\": \"<?php\\n$encoded = \\\"http%3A%2F%2Ffoo%20bar%2F\\\";\\n$unencoded = rawurldecode($encoded);\\necho \\\"The unencoded string is $unencoded !\\\\n\\\";\\n?>\\n\",\n \"language\": \"PHP\"\n },\n {\n \"code\": \"void main()\\n{\\n array encoded_urls = ({\\n \\\"http%3A%2F%2Ffoo%20bar%2F\\\",\\n \\\"google.com/search?q=%60Abdu%27l-Bah%C3%A1\\\"\\n });\\n\\n\\n foreach(encoded_urls, string url) {\\n string decoded = Protocols.HTTP.uri_decode( url );\\n write( string_to_utf8(decoded) +\\\"\\\\n\\\" ); // Assume sink does UTF8\\n }\\n}\\n\",\n \"language\": \"Pike\"\n },\n {\n \"code\": \"[System.Web.HttpUtility]::UrlDecode(\\\"http%3A%2F%2Ffoo%20bar%2F\\\")\\n\",\n \"language\": \"PowerShell\"\n },\n {\n \"code\": \"URL$ = URLDecoder(\\\"http%3A%2F%2Ffoo%20bar%2F\\\")\\n\\nDebug URL$ ; http://foo bar/\\n\",\n \"language\": \"PureBasic\"\n },\n {\n \"code\": \"#Python 2.X\\nimport urllib\\nprint urllib.unquote(\\\"http%3A%2F%2Ffoo%20bar%2F\\\")\\n#Python 3.5+\\nfrom urllib.parse import unquote\\nprint(unquote('http%3A%2F%2Ffoo%20bar%2F'))\\n\",\n \"language\": \"Python\"\n },\n {\n \"code\": \"URLdecode(\\\"http%3A%2F%2Ffoo%20bar%2F\\\")\\n\",\n \"language\": \"R\"\n },\n {\n \"code\": \"#lang racket\\n(require net/uri-codec)\\n(uri-decode \\\"http%3A%2F%2Ffoo%20bar%2F\\\")\\n\",\n \"language\": \"Racket\"\n },\n {\n \"code\": \"my @urls = < http%3A%2F%2Ffoo%20bar%2F\\n google.com/search?q=%60Abdu%27l-Bah%C3%A1 >;\\n\\nsay .subst( :g,\\n / [ '%' ( <xdigit> ** 2 ) ]+ / ,\\n { Blob.new((:16(~$_) for $0)).decode }\\n ) for @urls;\\n\",\n \"language\": \"Raku\"\n },\n {\n \"code\": \">> dehex \\\"http%3A%2F%2Ffoo%20bar%2F\\\"\\n== \\\"http://foo bar/\\\"\\n>> dehex \\\"google.com/search?q=%60Abdu%27l-Bah%C3%A1\\\"\\n== \\\"google.com/search?q=`Abdu'l-Bahá\\\"\\n\",\n \"language\": \"Red\"\n },\n {\n \"code\": \"create buffer 32000 allot\\n\\n{{\\n create bit 5 allot\\n : extract ( $c-$a ) drop @+ bit ! @+ bit 1+ ! bit ;\\n : render ( $c-$n )\\n dup '+ = [ drop 32 ] ifTrue\\n dup 13 = [ drop 32 ] ifTrue\\n dup 10 = [ drop 32 ] ifTrue\\n dup '% = [ extract hex toNumber decimal ] ifTrue ;\\n : <decode> ( $-$ ) repeat @+ 0; render ^buffer'add again ;\\n---reveal---\\n : decode ( $- ) buffer ^buffer'set <decode> drop ;\\n}}\\n\\n\\\"http%3A%2F%2Ffoo%20bar%2F\\\" decode buffer puts\\n\",\n \"language\": \"Retro\"\n },\n {\n \"code\": \"/* Rexx */\\n\\nDo\\n X = 0\\n url. = ''\\n X = X + 1; url.0 = X; url.X = 'http%3A%2F%2Ffoo%20bar%2F'\\n X = X + 1; url.0 = X; url.X = 'mailto%3A%22Ivan%20Aim%22%20%3Civan%2Eaim%40email%2Ecom%3E'\\n X = X + 1; url.0 = X; url.X = '%6D%61%69%6C%74%6F%3A%22%49%72%6D%61%20%55%73%65%72%22%20%3C%69%72%6D%61%2E%75%73%65%72%40%6D%61%69%6C%2E%63%6F%6D%3E'\\n\\n Do u_ = 1 to url.0\\n Say url.u_\\n Say DecodeURL(url.u_)\\n Say\\n End u_\\n\\n Return\\nEnd\\nExit\\n\\nDecodeURL:\\nProcedure\\nDo\\n Parse Arg encoded\\n decoded = ''\\n PCT = '%'\\n\\n Do while length(encoded) > 0\\n Parse Var encoded head (PCT) +1 code +2 tail\\n decoded = decoded || head\\n Select\\n When length(strip(code, 'T')) = 2 & datatype(code, 'X') then Do\\n code = x2c(code)\\n decoded = decoded || code\\n End\\n When length(strip(code, 'T')) \\\\= 0 then Do\\n decoded = decoded || PCT\\n tail = code || tail\\n End\\n Otherwise Do\\n Nop\\n End\\n End\\n encoded = tail\\n End\\n\\n Return decoded\\nEnd\\nExit\\n\",\n \"language\": \"REXX\"\n },\n {\n \"code\": \"/*REXX program converts a URL─encoded string ──► its original unencoded form. */\\nurl.1='http%3A%2F%2Ffoo%20bar%2F'\\nurl.2='mailto%3A%22Ivan%20Aim%22%20%3Civan%2Eaim%40email%2Ecom%3E'\\nurl.3='%6D%61%69%6C%74%6F%3A%22%49%72%6D%61%20%55%73%65%72%22%20%3C%69%72%6D%61%2E%75%73%65%72%40%6D%61%69%6C%2E%63%6F%6D%3E'\\nURLs =3\\n do j=1 for URLs\\n say url.j\\n say decodeURL(url.j)\\n say\\n end /*j*/\\nexit\\n/*──────────────────────────────────────────────────────────────────────────────────────*/\\ndecodeURL: procedure; parse arg encoded; decoded= ''\\n\\n do while encoded\\\\==''\\n parse var encoded head '%' +1 code +2 tail\\n decoded= decoded || head\\n L= length( strip( code, 'T') )\\n select\\n when L==2 & datatype(code, \\\"X\\\") then decoded= decoded || x2c(code)\\n when L\\\\==0 then do; decoded= decoded'%'\\n tail= code || tail\\n end\\n otherwise nop\\n end /*select*/\\n encoded= tail\\n end /*while*/\\n\\n return decoded\\n\",\n \"language\": \"REXX\"\n },\n {\n \"code\": \"/*REXX program converts & displays a URL─encoded string ──► its original unencoded form.*/\\nurl. =\\nurl.1='http%3A%2F%2Ffoo%20bar%2F'\\nurl.2='mailto%3A%22Ivan%20Aim%22%20%3Civan%2Eaim%40email%2Ecom%3E'\\nurl.3='%6D%61%69%6C%74%6F%3A%22%49%72%6D%61%20%55%73%65%72%22%20%3C%69%72%6D%61%2E%75%73%65%72%40%6D%61%69%6C%2E%63%6F%6D%3E'\\n\\n do j=1 until url.j==''; say /*process each URL; display blank line.*/\\n say url.j /*display the original URL. */\\n say URLdecode(url.j) /* \\\" \\\" decoded \\\" */\\n end /*j*/\\nexit /*stick a fork in it, we're all done. */\\n/*──────────────────────────────────────────────────────────────────────────────────────*/\\nURLdecode: procedure; parse arg yyy /*get encoded URL from argument list. */\\n yyy= translate(yyy, , '+') /*a special case for an encoded blank. */\\n URL=\\n do until yyy==''\\n parse var yyy plain '%' +1 code +2 yyy\\n URL= URL || plain\\n if datatype(code, 'X') then URL= URL || x2c(code)\\n else URL= URL'%'code\\n end /*until*/\\n return URL\\n\",\n \"language\": \"REXX\"\n },\n {\n \"code\": \"require 'cgi'\\nputs CGI.unescape(\\\"http%3A%2F%2Ffoo%20bar%2F\\\")\\n# => \\\"http://foo bar/\\\"\\n\",\n \"language\": \"Ruby\"\n },\n {\n \"code\": \"require 'uri'\\nputs URI.decode_www_form_component(\\\"http%3A%2F%2Ffoo%20bar%2F\\\")\\n# => \\\"http://foo bar/\\\"\\n\",\n \"language\": \"Ruby\"\n },\n {\n \"code\": \"const INPUT1: &str = \\\"http%3A%2F%2Ffoo%20bar%2F\\\";\\nconst INPUT2: &str = \\\"google.com/search?q=%60Abdu%27l-Bah%C3%A1\\\";\\n\\nfn append_frag(text: &mut String, frag: &mut String) {\\n if !frag.is_empty() {\\n let encoded = frag.chars()\\n .collect::<Vec<char>>()\\n .chunks(2)\\n .map(|ch| {\\n u8::from_str_radix(&ch.iter().collect::<String>(), 16).unwrap()\\n }).collect::<Vec<u8>>();\\n text.push_str(&std::str::from_utf8(&encoded).unwrap());\\n frag.clear();\\n }\\n}\\n\\nfn decode(text: &str) -> String {\\n let mut output = String::new();\\n let mut encoded_ch = String::new();\\n let mut iter = text.chars();\\n while let Some(ch) = iter.next() {\\n if ch == '%' {\\n encoded_ch.push_str(&format!(\\\"{}{}\\\", iter.next().unwrap(), iter.next().unwrap()));\\n } else {\\n append_frag(&mut output, &mut encoded_ch);\\n output.push(ch);\\n }\\n }\\n append_frag(&mut output, &mut encoded_ch);\\n output\\n}\\n\\nfn main() {\\n println!(\\\"{}\\\", decode(INPUT1));\\n println!(\\\"{}\\\", decode(INPUT2));\\n}\\n\",\n \"language\": \"Rust\"\n },\n {\n \"code\": \"import java.net.{URLDecoder, URLEncoder}\\nimport scala.compat.Platform.currentTime\\n\\nobject UrlCoded extends App {\\n val original = \\\"\\\"\\\"http://foo bar/\\\"\\\"\\\"\\n val encoded: String = URLEncoder.encode(original, \\\"UTF-8\\\")\\n\\n assert(encoded == \\\"http%3A%2F%2Ffoo+bar%2F\\\", s\\\"Original: $original not properly encoded: $encoded\\\")\\n\\n val percentEncoding = encoded.replace(\\\"+\\\", \\\"%20\\\")\\n assert(percentEncoding == \\\"http%3A%2F%2Ffoo%20bar%2F\\\", s\\\"Original: $original not properly percent-encoded: $percentEncoding\\\")\\n\\n assert(URLDecoder.decode(encoded, \\\"UTF-8\\\") == URLDecoder.decode(percentEncoding, \\\"UTF-8\\\"))\\n\\n println(s\\\"Successfully completed without errors. [total ${currentTime - executionStart} ms]\\\")\\n}\\n\",\n \"language\": \"Scala\"\n },\n {\n \"code\": \"$ include \\\"seed7_05.s7i\\\";\\n include \\\"encoding.s7i\\\";\\n\\nconst proc: main is func\\n begin\\n writeln(fromPercentEncoded(\\\"http%3A%2F%2Ffoo%20bar%2F\\\"));\\n writeln(fromUrlEncoded(\\\"http%3A%2F%2Ffoo+bar%2F\\\"));\\n end func;\\n\",\n \"language\": \"Seed7\"\n },\n {\n \"code\": \"func urldecode(str) {\\n str.gsub!('+', ' ');\\n str.gsub!(/\\\\%([A-Fa-f0-9]{2})/, {|a| 'C'.pack(a.hex)});\\n return str;\\n}\\n\\nsay urldecode('http%3A%2F%2Ffoo+bar%2F'); # => \\\"http://foo bar/\\\"\\n\",\n \"language\": \"Sidef\"\n },\n {\n \"code\": \"import Foundation\\n\\nlet encoded = \\\"http%3A%2F%2Ffoo%20bar%2F\\\"\\nif let normal = encoded.stringByReplacingPercentEscapesUsingEncoding(NSUTF8StringEncoding) {\\n println(normal)\\n}\\n\",\n \"language\": \"Swift\"\n },\n {\n \"code\": \"proc urlDecode {str} {\\n set specialMap {\\\"[\\\" \\\"%5B\\\" \\\"]\\\" \\\"%5D\\\"}\\n set seqRE {%([0-9a-fA-F]{2})}\\n set replacement {[format \\\"%c\\\" [scan \\\"\\\\1\\\" \\\"%2x\\\"]]}\\n set modStr [regsub -all $seqRE [string map $specialMap $str] $replacement]\\n return [encoding convertfrom utf-8 [subst -nobackslash -novariable $modStr]]\\n}\\n\",\n \"language\": \"Tcl\"\n },\n {\n \"code\": \"puts [urlDecode \\\"http%3A%2F%2Ffoo%20bar%2F\\\"]\\n\",\n \"language\": \"Tcl\"\n },\n {\n \"code\": \"$$ MODE TUSCRIPT\\nurl_encoded=\\\"http%3A%2F%2Ffoo%20bar%2F\\\"\\nBUILD S_TABLE hex=\\\":%><:><2<>2<%:\\\"\\nhex=STRINGS (url_encoded,hex), hex=SPLIT(hex)\\nhex=DECODE (hex,hex)\\nurl_decoded=SUBSTITUTE(url_encoded,\\\":%><2<>2<%:\\\",0,0,hex)\\nPRINT \\\"encoded: \\\", url_encoded\\nPRINT \\\"decoded: \\\", url_decoded\\n\",\n \"language\": \"TUSCRIPT\"\n },\n {\n \"code\": \"urldecode() { local u=\\\"${1//+/ }\\\"; printf '%b' \\\"${u//%/\\\\\\\\x}\\\"; }\\n\",\n \"language\": \"UNIX-Shell\"\n },\n {\n \"code\": \"urldecode http%3A%2F%2Ffoo%20bar%2F\\nhttp://foo bar/\\n\\nurldecode google.com/search?q=%60Abdu%27l-Bah%C3%A1\\ngoogle.com/search?q=`Abdu'l-Bahároot@\\n\",\n \"language\": \"UNIX-Shell\"\n },\n {\n \"code\": \"function urldecode\\n{\\n typeset encoded=$1 decoded= rest= c= c1= c2=\\n typeset rest2= bug='rest2=${rest}'\\n\\n if [[ -z ${BASH_VERSION:-} ]]; then\\n typeset -i16 hex=0; typeset -i8 oct=0\\n\\n # bug /usr/bin/sh HP-UX 11.00\\n typeset _encoded='xyz%26xyz'\\n rest=\\\"${_encoded#?}\\\"\\n c=\\\"${_encoded%%${rest}}\\\"\\n if (( ${#c} != 1 )); then\\n typeset qm='????????????????????????????????????????????????????????????????????????'\\n typeset bug='(( ${#rest} > 0 )) && typeset -L${#rest} rest2=\\\"${qm}\\\" || rest2=${rest}'\\n fi\\n fi\\n\\n\\trest=\\\"${encoded#?}\\\"\\n\\teval ${bug}\\n\\tc=\\\"${encoded%%${rest2}}\\\"\\n\\tencoded=\\\"${rest}\\\"\\n\\n\\twhile [[ -n ${c} ]]; do\\n\\t\\tif [[ ${c} = '%' ]]; then\\n\\t\\t\\trest=\\\"${encoded#?}\\\"\\n\\t\\t\\teval ${bug}\\n\\t\\t\\tc1=\\\"${encoded%%${rest2}}\\\"\\n\\t\\t\\tencoded=\\\"${rest}\\\"\\n\\n\\t\\t\\trest=\\\"${encoded#?}\\\"\\n\\t\\t\\teval ${bug}\\n\\t\\t\\tc2=\\\"${encoded%%${rest2}}\\\"\\n\\t\\t\\tencoded=\\\"${rest}\\\"\\n\\n\\t\\t\\tif [[ -z ${c1} || -z ${c2} ]]; then\\n\\t\\t\\t\\tc=\\\"%${c1}${c2}\\\"\\n\\t\\t\\t\\techo \\\"WARNING: invalid % encoding: ${c}\\\" >&2\\n\\t\\t\\telif [[ -n ${BASH_VERSION:-} ]]; then\\n\\t\\t\\t\\tc=\\\"\\\\\\\\x${c1}${c2}\\\"\\n\\t\\t\\t\\tc=$(\\\\echo -e \\\"${c}\\\")\\n\\t\\t\\telse\\n\\t\\t\\t\\thex=\\\"16#${c1}${c2}\\\"; oct=hex\\n\\t\\t\\t\\tc=\\\"\\\\\\\\0${oct#8\\\\#}\\\"\\n\\t\\t\\t\\tc=$(print -- \\\"${c}\\\")\\n\\t\\t\\tfi\\n\\t\\telif [[ ${c} = '+' ]]; then\\n\\t\\t\\tc=' '\\n\\t\\tfi\\n\\n\\t\\tdecoded=\\\"${decoded}${c}\\\"\\n\\n\\t\\trest=\\\"${encoded#?}\\\"\\n\\t\\teval ${bug}\\n\\t\\tc=\\\"${encoded%%${rest2}}\\\"\\n\\t\\tencoded=\\\"${rest}\\\"\\n\\tdone\\n\\n\\tif [[ -n ${BASH_VERSION:-} ]]; then\\n\\t\\t\\\\echo -E \\\"${decoded}\\\"\\n\\telse\\n\\t\\tprint -r -- \\\"${decoded}\\\"\\n\\tfi\\n}\\n\",\n \"language\": \"UNIX-Shell\"\n },\n {\n \"code\": \"import net.urllib\\nfn main() {\\n\\tfor escaped in [\\n\\t\\t\\\"http%3A%2F%2Ffoo%20bar%2F\\\",\\n\\t\\t\\\"google.com/search?q=%60Abdu%27l-Bah%C3%A1\\\",\\n ] {\\n\\t\\tu := urllib.query_unescape(escaped)?\\n\\t\\tprintln(u)\\n\\t}\\n}\\n\",\n \"language\": \"V-(Vlang)\"\n },\n {\n \"code\": \"Function RegExTest(str,patrn)\\n Dim regEx\\n Set regEx = New RegExp\\n regEx.IgnoreCase = True\\n regEx.Pattern = patrn\\n RegExTest = regEx.Test(str)\\nEnd Function\\n\\nFunction URLDecode(sStr)\\n Dim str,code,a0\\n str=\\\"\\\"\\n code=sStr\\n code=Replace(code,\\\"+\\\",\\\" \\\")\\n While len(code)>0\\n If InStr(code,\\\"%\\\")>0 Then\\n str = str & Mid(code,1,InStr(code,\\\"%\\\")-1)\\n code = Mid(code,InStr(code,\\\"%\\\"))\\n a0 = UCase(Mid(code,2,1))\\n If a0=\\\"U\\\" And RegExTest(code,\\\"^%u[0-9A-F]{4}\\\") Then\\n str = str & ChrW((Int(\\\"&H\\\" & Mid(code,3,4))))\\n code = Mid(code,7)\\n ElseIf a0=\\\"E\\\" And RegExTest(code,\\\"^(%[0-9A-F]{2}){3}\\\") Then\\n str = str & ChrW((Int(\\\"&H\\\" & Mid(code,2,2)) And 15) * 4096 + (Int(\\\"&H\\\" & Mid(code,5,2)) And 63) * 64 + (Int(\\\"&H\\\" & Mid(code,8,2)) And 63))\\n code = Mid(code,10)\\n ElseIf a0>=\\\"C\\\" And a0<=\\\"D\\\" And RegExTest(code,\\\"^(%[0-9A-F]{2}){2}\\\") Then\\n str = str & ChrW((Int(\\\"&H\\\" & Mid(code,2,2)) And 3) * 64 + (Int(\\\"&H\\\" & Mid(code,5,2)) And 63))\\n code = Mid(code,7)\\n ElseIf (a0<=\\\"B\\\" Or a0=\\\"F\\\") And RegExTest(code,\\\"^%[0-9A-F]{2}\\\") Then\\n str = str & Chr(Int(\\\"&H\\\" & Mid(code,2,2)))\\n code = Mid(code,4)\\n Else\\n str = str & \\\"%\\\"\\n code = Mid(code,2)\\n End If\\n Else\\n str = str & code\\n code = \\\"\\\"\\n End If\\n Wend\\n URLDecode = str\\nEnd Function\\n\\nurl = \\\"http%3A%2F%2Ffoo%20bar%C3%A8%2F\\\"\\nWScript.Echo \\\"Encoded URL: \\\" & url & vbCrLf &_\\n\\t\\\"Decoded URL: \\\" & UrlDecode(url)\\n\",\n \"language\": \"VBScript\"\n },\n {\n \"code\": \"import \\\"./fmt\\\" for Conv\\n\\nvar urlDecode = Fn.new { |enc|\\n var res = \\\"\\\"\\n var i = 0\\n while (i < enc.count) {\\n var c = enc[i]\\n if (c == \\\"\\\\%\\\") {\\n var b = Conv.atoi(enc[i+1..i+2], 16)\\n res = res + String.fromByte(b)\\n i = i + 3\\n } else {\\n res = res + c\\n i = i + 1\\n }\\n }\\n return res\\n}\\n\\n// We need to escape % characters in Wren as % is otherwise used for string interpolation.\\nvar encs = [\\n \\\"http\\\\%3A\\\\%2F\\\\%2Ffoo\\\\%20bar\\\\%2F\\\",\\n \\\"google.com/search?q=\\\\%60Abdu\\\\%27l-Bah\\\\%C3\\\\%A1\\\"\\n]\\nfor (enc in encs)System.print(urlDecode.call(enc))\\n\",\n \"language\": \"Wren\"\n },\n {\n \"code\": \"code Text=12;\\nstring 0; \\\\use zero-terminated strings\\n\\nfunc Decode(S0); \\\\Decode URL string and return its address\\nchar S0;\\nchar S1(80); \\\\BEWARE: very temporary string space returned\\nint C, N, I, J;\\n[I:= 0; J:= 0;\\nrepeat C:= S0(I); I:= I+1; \\\\get char\\n if C=^% then \\\\convert hex to char\\n [C:= S0(I); I:= I+1;\\n if C>=^a then C:= C & ~$20; \\\\convert to uppercase\\n N:= C - (if C<=^9 then ^0 else ^A-10);\\n C:= S0(I); I:= I+1;\\n if C>=^a then C:= C & ~$20;\\n C:= N*16 + C - (if C<=^9 then ^0 else ^A-10);\\n ];\\n S1(J):= C; J:= J+1; \\\\put char in output string\\nuntil C=0;\\nreturn S1;\\n];\\n\\nText(0, Decode(\\\"http%3A%2F%2Ffoo%20bar%2f\\\"))\\n\",\n \"language\": \"XPL0\"\n },\n {\n \"code\": \"sub decode_url$(s$)\\n local res$, ch$\\n\\t\\n while(s$ <> \\\"\\\")\\n ch$ = left$(s$, 1)\\n if ch$ = \\\"%\\\" then\\n ch$ = chr$(dec(mid$(s$, 2, 2)))\\n s$ = right$(s$, len(s$) - 3)\\n else\\n if ch$ = \\\"+\\\" ch$ = \\\" \\\"\\n s$ = right$(s$, len(s$) - 1)\\n\\tendif\\n res$ = res$ + ch$\\n wend\\n return res$\\nend sub\\n\\nprint decode_url$(\\\"http%3A%2F%2Ffoo%20bar%2F\\\")\\nprint decode_url$(\\\"google.com/search?q=%60Abdu%27l-Bah%C3%A1\\\")\\n\",\n \"language\": \"Yabasic\"\n },\n {\n \"code\": \"\\\"http%3A%2F%2Ffoo%20bar%2F\\\".pump(String, // push each char through these fcns:\\n fcn(c){ if(c==\\\"%\\\") return(Void.Read,2); return(Void.Skip,c) },// %-->read 2 chars else pass through\\n fcn(_,b,c){ (b+c).toInt(16).toChar() }) // \\\"%\\\" (ignored) \\\"3\\\"+\\\"1\\\"-->0x31-->\\\"1\\\"\\n\",\n \"language\": \"Zkl\"\n },\n {\n \"code\": \"var Curl=Import.lib(\\\"zklCurl\\\");\\nCurl.urlDecode(\\\"http%3A%2F%2Ffoo%20bar%2F\\\");\\n\",\n \"language\": \"Zkl\"\n }\n]","isConversational":false},"task_name":{"kind":"string","value":"URL-decoding"}}},{"rowIdx":1789,"cells":{"solutions":{"kind":"list like","value":[{"code":"---\ncategory:\n- String manipulation\n- Encodings\nfrom: http://rosettacode.org/wiki/URL_encoding\n","language":"00-META"},{"code":";Task:\nProvide a function or mechanism to convert a provided string into URL encoding representation.\n\nIn URL encoding, special characters, control characters and extended characters \nare converted into a percent symbol followed by a two digit hexadecimal code, \nSo a space character encodes into %20 within the string.\n\nFor the purposes of this task, every character except 0-9, A-Z and a-z requires conversion, so the following characters all require conversion by default:\n\n* ASCII control codes (Character ranges 00-1F hex (0-31 decimal) and 7F (127 decimal).\n* ASCII symbols (Character ranges 32-47 decimal (20-2F hex))\n* ASCII symbols (Character ranges 58-64 decimal (3A-40 hex))\n* ASCII symbols (Character ranges 91-96 decimal (5B-60 hex))\n* ASCII symbols (Character ranges 123-126 decimal (7B-7E hex))\n* Extended characters with character codes of 128 decimal (80 hex) and above.\n\n<br>\n;Example:\nThe string \"<code><nowiki>http://foo bar/</nowiki></code>\" would be encoded as \"<code><nowiki>http%3A%2F%2Ffoo%20bar%2F</nowiki></code>\".\n\n\n;Variations:\n* Lowercase escapes are legal, as in \"<code><nowiki>http%3a%2f%2ffoo%20bar%2f</nowiki></code>\".\n* Special characters have different encodings for different standards:\n** RFC 3986, ''Uniform Resource Identifier (URI): Generic Syntax'', section 2.3, says to preserve \"-._~\".\n** HTML 5, section [http://www.whatwg.org/specs/web-apps/current-work/multipage/association-of-controls-and-forms.html#url-encoded-form-data 4.10.22.5 URL-encoded form data], says to preserve \"-._*\", and to encode space \" \" to \"+\".\n** [https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/encodeURI#description encodeURI] function in Javascript will preserve \"-._~\" (RFC 3986) and \";,/?:@&=+$!*'()#\".\n\n;Options:\nIt is permissible to use an exception string (containing a set of symbols \nthat do not need to be converted). \nHowever, this is an optional feature and is not a requirement of this task.\n\n\n;Related tasks: \n* [[URL decoding]]\n* [[URL parser]]\n<br><br>\n\n","language":"00-TASK"},{"code":"F url_encode(s)\n V r = ‘’\n V buf = ‘’\n\n F flush_buf() // this function is needed because strings in 11l are UTF-16 encoded\n I @buf != ‘’\n V bytes = @buf.encode(‘utf-8’)\n L(b) bytes\n @r ‘’= ‘%’hex(b).zfill(2)\n @buf = ‘’\n\n L(c) s\n I c C (‘0’..‘9’, ‘a’..‘z’, ‘A’..‘Z’, ‘_’, ‘.’, ‘-’, ‘~’)\n flush_buf()\n r ‘’= c\n E\n buf ‘’= c\n\n flush_buf()\n R r\n\nprint(url_encode(‘http://foo bar/’))\nprint(url_encode(‘https://ru.wikipedia.org/wiki/Транспайлер’))\n","language":"11l"},{"code":"BYTE FUNC MustEncode(CHAR c CHAR ARRAY ex)\n BYTE i\n\n IF c>='a AND c<='z OR c>='A AND c<='Z OR c>='0 AND c<='9 THEN\n RETURN (0)\n FI\n IF ex(0)>0 THEN\n FOR i=1 TO ex(0)\n DO\n IF ex(i)=c THEN\n RETURN (0)\n FI\n OD\n FI\nRETURN (1)\n\nPROC Append(CHAR ARRAY s CHAR c)\n s(0)==+1\n s(s(0))=c\nRETURN\n\nPROC Encode(CHAR ARRAY in,out,ex BYTE spaceToPlus)\n CHAR ARRAY hex=['0 '1 '2 '3 '4 '5 '6 '7 '8 '9 'A 'B 'C 'D 'E 'F]\n BYTE i\n CHAR c\n\n out(0)=0\n FOR i=1 TO in(0)\n DO\n c=in(i)\n IF spaceToPlus=1 AND c=32 THEN\n Append(out,'+)\n ELSEIF MustEncode(c,ex) THEN\n Append(out,'%)\n Append(out,hex(c RSH 4))\n Append(out,hex(c&$0F))\n ELSE\n Append(out,c)\n FI\n OD\nRETURN\n\nPROC EncodeRaw(CHAR ARRAY in,out)\n Encode(in,out,\"\",0)\nRETURN\n\nPROC EncodeRFC3986(CHAR ARRAY in,out)\n Encode(in,out,\"-._~\",0)\nRETURN\n\nPROC EncodeHTML5(CHAR ARRAY in,out)\n Encode(in,out,\"-._*\",1)\nRETURN\n\nPROC PrintInv(CHAR ARRAY a)\n BYTE i\n\n IF a(0)>0 THEN\n FOR i=1 TO a(0)\n DO\n Put(a(i)%$80)\n OD\n FI\nRETURN\n\nPROC Test(CHAR ARRAY in)\n CHAR ARRAY out(256)\n\n PrintInv(\"input \")\n PrintF(\" %S%E\",in)\n\n EncodeRaw(in,out)\n PrintInv(\"encoded \")\n PrintF(\" %S%E\",out)\n\n EncodeRFC3986(in,out)\n PrintInv(\"RFC 3986\")\n PrintF(\" %S%E\",out)\n\n EncodeHTML5(in,out)\n PrintInv(\"HTML 5 \")\n PrintF(\" %S%E%E\",out)\nRETURN\n\nPROC Main()\n Test(\"http://foo bar/\")\n Test(\"http://www.rosettacode.org/wiki/URL_encoding\")\n Test(\"http://foo bar/*_-.html\")\nRETURN\n","language":"Action-"},{"code":"with AWS.URL;\nwith Ada.Text_IO; use Ada.Text_IO;\nprocedure Encode is\n Normal : constant String := \"http://foo bar/\";\nbegin\n Put_Line (AWS.URL.Encode (Normal));\nend Encode;\n","language":"Ada"},{"code":"BEGIN\n # encodes the specified url - 0-9, A-Z and a-z are unchanged, #\n # everything else is converted to %xx where xx are hex-digits #\n PROC encode url = ( STRING url )STRING:\n IF url = \"\" THEN \"\" # empty string #\n ELSE\n # non-empty string #\n # ensure result will be big enough for a string of all encodable #\n # characters #\n STRING hex digits = \"0123456789ABCDEF\";\n [ 1 : ( ( UPB url - LWB url ) + 1 ) * 3 ]CHAR result;\n INT r pos := 0;\n FOR u pos FROM LWB url TO UPB url DO\n CHAR c = url[ u pos ];\n IF ( c >= \"0\" AND c <= \"9\" )\n OR ( c >= \"A\" AND c <= \"Z\" )\n OR ( c >= \"a\" AND c <= \"z\" )\n THEN\n # no need to encode this character #\n result[ r pos +:= 1 ] := c\n ELSE\n # must encode #\n INT c code = ABS c;\n result[ r pos +:= 1 ] := \"%\";\n result[ r pos +:= 1 ] := hex digits[ ( c code OVER 16 ) + 1 ];\n result[ r pos +:= 1 ] := hex digits[ ( c code MOD 16 ) + 1 ]\n FI\n OD;\n result[ 1 : r pos ]\n FI; # encode url #\n # task test case #\n print( ( encode url( \"http://foo bar/\" ), newline ) )\nEND\n","language":"ALGOL-68"},{"code":"EncodingUtil.urlEncode('http://foo bar/', 'UTF-8')\n","language":"Apex"},{"code":"AST URL encode \"http://foo bar/\"\n","language":"AppleScript"},{"code":" 100 URL$ = \"http://foo bar/\"\n 110 GOSUB 140\"URL ENCODE URL$ RETURNS R$\n 120 PRINT R$;\n 130 END\n 140 LET R$ = \"\"\n 150 LET L = LEN (URL$)\n 160 IF NOT L THEN RETURN\n 170 LET H$ = \"0123456789ABCDEF\"\n 180 FOR I = 1 TO L\n 190 LET C$ = MID$ (URL$,I,1)\n 200 LET C = ASC (C$)\n 210 IF C < ASC (\"0\") OR C > ASC (\"Z\") + 32 OR C > ASC (\"9\") AND C < ASC (\"A\") OR C > ASC (\"Z\") AND C < ASC (\"A\") + 32 THEN H = INT (C / 16):C$ = \"%\" + MID$ (H$,H + 1,1) + MID$ (H$,C - H * 16 + 1,1)\n 220 LET R$ = R$ + C$\n 230 NEXT I\n 240 RETURN\n","language":"Applesoft-BASIC"},{"code":"encoded: encode.url.slashes \"http://foo bar/\"\nprint encoded\n","language":"Arturo"},{"code":"MsgBox, % UriEncode(\"http://foo bar/\")\n\n; Modified from http://goo.gl/0a0iJq\nUriEncode(Uri, Reserved:=\"!#$&'()*+,/:;=?@[]\") {\n Unreserved := \"ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789-_.~\"\n\tVarSetCapacity(Var, StrPut(Uri, \"UTF-8\"), 0)\n\tStrPut(Uri, &Var, \"UTF-8\")\n\tWhile (Code := NumGet(Var, A_Index - 1, \"UChar\")) {\n\t\tIf InStr(Unreserved . Reserved, Chr(Code)) {\n\t\t\tEncoded .= Chr(Code)\n }\n\t\tElse {\n\t\t\tEncoded .= Format(\"%{:02X}\", Code)\n }\n }\n\tReturn Encoded\n}\n","language":"AutoHotkey"},{"code":"BEGIN {\n\tfor (i = 0; i <= 255; i++)\n\t\tord[sprintf(\"%c\", i)] = i\n}\n\n# Encode string with application/x-www-form-urlencoded escapes.\nfunction escape(str, c, len, res) {\n\tlen = length(str)\n\tres = \"\"\n\tfor (i = 1; i <= len; i++) {\n\t\tc = substr(str, i, 1);\n\t\tif (c ~ /[0-9A-Za-z]/)\n\t\t#if (c ~ /[-._*0-9A-Za-z]/)\n\t\t\tres = res c\n\t\t#else if (c == \" \")\n\t\t#\tres = res \"+\"\n\t\telse\n\t\t\tres = res \"%\" sprintf(\"%02X\", ord[c])\n\t}\n\treturn res\n}\n\n# Escape every line of input.\n{ print escape($0) }\n","language":"AWK"},{"code":" PRINT FNurlencode(\"http://foo bar/\")\n END\n\n DEF FNurlencode(url$)\n LOCAL c%, i%\n WHILE i% < LEN(url$)\n i% += 1\n c% = ASCMID$(url$, i%)\n IF c%<&30 OR c%>&7A OR c%>&39 AND c%<&41 OR c%>&5A AND c%<&61 THEN\n url$ = LEFT$(url$,i%-1) + \"%\" + RIGHT$(\"0\"+STR$~c%,2) + MID$(url$,i%+1)\n ENDIF\n ENDWHILE\n = url$\n","language":"BBC-BASIC"},{"code":"( ( encode\n = encoded exceptions octet string\n . !arg:(?exceptions.?string)\n & :?encoded\n & @( !string\n : ?\n ( %@?octet ?\n & !encoded\n ( !octet\n : ( ~<0:~>9\n | ~<A:~>Z\n | ~<a:~>z\n )\n | @(!exceptions:? !octet ?)\n & !octet\n | \"%\" d2x$(asc$!octet)\n )\n : ?encoded\n & ~\n )\n )\n | str$!encoded\n )\n & out$\"without exceptions:\n\"\n & out$(encode$(.\"http://foo bar/\"))\n & out$(encode$(.\"mailto:Ivan\"))\n & out$(encode$(.\"Aim <ivan.aim@email.com>\"))\n & out$(encode$(.\"mailto:Irma\"))\n & out$(encode$(.\"User <irma.user@mail.com>\"))\n & out$(encode$(.\"http://foo.bar.com/~user-name/_subdir/*~.html\"))\n & out$\"\nwith RFC 3986 rules:\n\"\n & out$(encode$(\"-._~\".\"http://foo bar/\"))\n & out$(encode$(\"-._~\".\"mailto:Ivan\"))\n & out$(encode$(\"-._~\".\"Aim <ivan.aim@email.com>\"))\n & out$(encode$(\"-._~\".\"mailto:Irma\"))\n & out$(encode$(\"-._~\".\"User <irma.user@mail.com>\"))\n & out$(encode$(\"-._~\".\"http://foo.bar.com/~user-name/_subdir/*~.html\"))\n);\n","language":"Bracmat"},{"code":"#include <stdio.h>\n#include <ctype.h>\n\nchar rfc3986[256] = {0};\nchar html5[256] = {0};\n\n/* caller responsible for memory */\nvoid encode(const char *s, char *enc, char *tb)\n{\n\tfor (; *s; s++) {\n\t\tif (tb[*s]) sprintf(enc, \"%c\", tb[*s]);\n\t\telse sprintf(enc, \"%%%02X\", *s);\n\t\twhile (*++enc);\n\t}\n}\n\nint main()\n{\n\tconst char url[] = \"http://foo bar/\";\n\tchar enc[(strlen(url) * 3) + 1];\n\n\tint i;\n\tfor (i = 0; i < 256; i++) {\n\t\trfc3986[i] = isalnum(i)||i == '~'||i == '-'||i == '.'||i == '_'\n\t\t\t? i : 0;\n\t\thtml5[i] = isalnum(i)||i == '*'||i == '-'||i == '.'||i == '_'\n\t\t\t? i : (i == ' ') ? '+' : 0;\n\t}\n\n\tencode(url, enc, rfc3986);\n\tputs(enc);\n\n\treturn 0;\n}\n","language":"C"},{"code":"#include <QByteArray>\n#include <iostream>\n\nint main( ) {\n QByteArray text ( \"http://foo bar/\" ) ;\n QByteArray encoded( text.toPercentEncoding( ) ) ;\n std::cout << encoded.data( ) << '\\n' ;\n return 0 ;\n}\n","language":"C++"},{"code":"using System;\n\nnamespace URLEncode\n{\n internal class Program\n {\n private static void Main(string[] args)\n {\n Console.WriteLine(Encode(\"http://foo bar/\"));\n }\n\n private static string Encode(string uri)\n {\n return Uri.EscapeDataString(uri);\n }\n }\n}\n","language":"C-sharp"},{"code":"(import 'java.net.URLEncoder)\n(URLEncoder/encode \"http://foo bar/\" \"UTF-8\")\n","language":"Clojure"},{"code":"(defun needs-encoding-p (char)\n (not (digit-char-p char 36)))\n\n(defun encode-char (char)\n (format nil \"%~2,'0X\" (char-code char)))\n\n(defun url-encode (url)\n (apply #'concatenate 'string\n (map 'list (lambda (char)\n (if (needs-encoding-p char)\n (encode-char char)\n (string char)))\n url)))\n\n(url-encode \"http://foo bar/\")\n","language":"Common-Lisp"},{"code":"require \"uri\"\n\nputs URI.encode(\"http://foo bar/\")\nputs URI.encode(\"http://foo bar/\", space_to_plus: true)\nputs URI.encode_www_form(\"http://foo bar/\")\nputs URI.encode_www_form(\"http://foo bar/\", space_to_plus: false)\n","language":"Crystal"},{"code":"import std.stdio, std.uri;\n\nvoid main() {\n writeln(encodeComponent(\"http://foo bar/\"));\n}\n","language":"D"},{"code":"function EncodeURL(URL: string): string;\nvar I: integer;\nbegin\nResult:='';\nfor I:=1 to Length(URL) do\n if URL[I] in ['0'..'9', 'A'..'Z', 'a'..'z'] then Result:=Result+URL[I]\n else Result:=Result+'%'+IntToHex(byte(URL[I]),2);\nend;\n\nprocedure EncodeAndShowURL(Memo: TMemo; URL: string);\nvar ES: string;\nbegin\nMemo.Lines.Add('Unencoded URL: '+URL);\nES:=EncodeURL(URL);\nMemo.Lines.Add('Encoded URL: '+ES);\nMemo.Lines.Add('');\nend;\n\nprocedure ShowEncodedURLs(Memo: TMemo);\nbegin\nEncodeAndShowURL(Memo,'http://foo bar/');\nEncodeAndShowURL(Memo,'https://rosettacode.org/wiki/URL_encoding');\nEncodeAndShowURL(Memo,'https://en.wikipedia.org/wiki/Pikes_Peak_granite');\nend;\n","language":"Delphi"},{"code":"iex(1)> URI.encode(\"http://foo bar/\", &URI.char_unreserved?/1)\n\"http%3A%2F%2Ffoo%20bar%2F\"\n","language":"Elixir"},{"code":"open System\n\n[<EntryPoint>]\nlet main args =\n printfn \"%s\" (Uri.EscapeDataString(args.[0]))\n 0\n","language":"F-Sharp"},{"code":"USING: combinators.short-circuit unicode urls.encoding.private ;\n\n: my-url-encode ( str -- encoded )\n [ { [ alpha? ] [ \"-._~\" member? ] } 1|| ] (url-encode) ;\n\n\"http://foo bar/\" my-url-encode print\n","language":"Factor"},{"code":"function urlEncode(data: string): AnsiString;\nvar\n ch: AnsiChar;\nbegin\n Result := '';\n for ch in data do begin\n if ((Ord(ch) < 65) or (Ord(ch) > 90)) and ((Ord(ch) < 97) or (Ord(ch) > 122)) then begin\n Result := Result + '%' + IntToHex(Ord(ch), 2);\n end else\n Result := Result + ch;\n end;\nend;\n","language":"Free-Pascal-Lazarus"},{"code":"Dim Shared As String lookUp(256)\nFor cadena As Integer = 0 To 256\n lookUp(cadena) = \"%\" + Hex(cadena)\nNext cadena\n\nFunction string2url(cadena As String) As String\n Dim As String cadTemp, cadDevu\n For j As Integer = 1 To Len(cadena)\n cadTemp = Mid(cadena, j, 1)\n If Instr( \"0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz\", cadTemp) Then\n cadDevu &= cadTemp\n Else\n cadDevu &= lookUp(Asc(cadTemp))\n End If\n Next j\n Return cadDevu\nEnd Function\n\nDim As String URL = \"http://foo bar/\"\n\nPrint \"Supplied URL '\"; URL; \"'\"\nPrint \"URL encoding '\"; string2url(URL); \"'\"\nSleep\n","language":"FreeBASIC"},{"code":"println[URLEncode[\"http://foo bar/\"]]\n","language":"Frink"},{"code":"include \"NSLog.incl\"\n\nlocal fn PercentEncodeURLString( urlStr as CFStringRef ) as CFStringRef\n CFStringRef encodedStr = fn StringByAddingPercentEncodingWithAllowedCharacters( urlStr, fn CharacterSetAlphanumericSet )\nend fn = encodedStr\n\nNSLog( @\"%@\", fn PercentEncodeURLString( @\"http://foo bar/\" ) )\nNSLog( @\"%@\", fn PercentEncodeURLString( @\"http://www.rosettacode.org/wiki/URL_encoding\" ) )\n\nHandleEvents\n","language":"FutureBasic"},{"code":"package main\n\nimport (\n \"fmt\"\n \"net/url\"\n)\n\nfunc main() {\n fmt.Println(url.QueryEscape(\"http://foo bar/\"))\n}\n","language":"Go"},{"code":"def normal = \"http://foo bar/\"\ndef encoded = URLEncoder.encode(normal, \"utf-8\")\nprintln encoded\n","language":"Groovy"},{"code":"import qualified Data.Char as Char\nimport Text.Printf\n\nencode :: Char -> String\nencode c\n | c == ' ' = \"+\"\n | Char.isAlphaNum c || c `elem` \"-._~\" = [c]\n | otherwise = printf \"%%%02X\" c\n\nurlEncode :: String -> String\nurlEncode = concatMap encode\n\nmain :: IO ()\nmain = putStrLn $ urlEncode \"http://foo bar/\"\n","language":"Haskell"},{"code":"link hexcvt\n\nprocedure main()\nwrite(\"text = \",image(u := \"http://foo bar/\"))\nwrite(\"encoded = \",image(ue := encodeURL(u)))\nend\n\nprocedure encodeURL(s) #: encode data for inclusion in a URL/URI\nstatic en\ninitial { # build lookup table for everything\n en := table()\n every en[c := !string(~(&digits++&letters))] := \"%\"||hexstring(ord(c),2)\n every /en[c := !string(&cset)] := c\n }\n\nevery (c := \"\") ||:= en[!s] # re-encode everything\nreturn c\nend\n","language":"Icon"},{"code":"require'strings convert'\nurlencode=: rplc&((#~2|_1 47 57 64 90 96 122 I.i.@#)a.;\"_1'%',.hfd i.#a.)\n","language":"J"},{"code":" urlencode 'http://foo bar/'\nhttp%3A%2F%2Ffoo%20bar%2F\n","language":"J"},{"code":"import java.net.URLEncoder;\nimport java.nio.charset.StandardCharsets;\n","language":"Java"},{"code":"URLEncoder.encode(\"http://foo bar/\", StandardCharsets.UTF_8)\n","language":"Java"},{"code":"String encode(String string) {\n StringBuilder encoded = new StringBuilder();\n for (char character : string.toCharArray()) {\n switch (character) {\n /* rfc3986 and html5 */\n case '-', '.', '_', '~', '*' -> encoded.append(character);\n case ' ' -> encoded.append('+');\n default -> {\n if (alphanumeric(character))\n encoded.append(character);\n else {\n encoded.append(\"%\");\n encoded.append(\"%02x\".formatted((int) character));\n }\n }\n }\n }\n return encoded.toString();\n}\n\nboolean alphanumeric(char character) {\n return (character >= 'A' && character <= 'Z')\n || (character >= 'a' && character <= 'z')\n || (character >= '0' && character <= '9');\n}\n","language":"Java"},{"code":"var normal = 'http://foo/bar/';\nvar encoded = encodeURIComponent(normal);\n","language":"JavaScript"},{"code":"\"á\" | @uri\n","language":"Jq"},{"code":"def url_encode:\n # The helper function checks whether the input corresponds to one of the characters: !'()*\n def recode: . as $c | [33,39,40,41,42] | index($c);\n def hex: if . < 10 then 48 + . else 55 + . end;\n @uri\n | explode\n # 37 ==> \"%\", 50 ==> \"2\"\n | map( if recode then (37, 50, ((. - 32) | hex)) else . end )\n | implode;\n","language":"Jq"},{"code":"\"http://foo bar/\" | @uri\n","language":"Jq"},{"code":"\"http://foo bar/\" | @uri == url_encode\n","language":"Jq"},{"code":"[range(0;1024) | [.] | implode | if @uri == . then . else empty end] | join(null)\n","language":"Jq"},{"code":"[range(0;1024) | [.] | implode | if url_encode == . then . else empty end] | join(null)\n","language":"Jq"},{"code":"//version 1.0.1\nimport HTTP.URIs: escapeuri\n\ndcd = \"http://foo bar/\"\nenc = escapeuri(dcd)\n\nprintln(dcd, \" => \", enc)\n","language":"Julia"},{"code":"// version 1.1.2\n\nimport java.net.URLEncoder\n\nfun main(args: Array<String>) {\n val url = \"http://foo bar/\"\n println(URLEncoder.encode(url, \"utf-8\")) // note: encodes space to + not %20\n}\n","language":"Kotlin"},{"code":"url_encode()\n{\n printf \"%(url)q\\n\" \"$*\"\n}\n\n\nurl_encode \"http://foo bar/\"\nurl_encode \"https://ru.wikipedia.org/wiki/Транспайлер\"\nurl_encode \"google.com/search?q=`Abdu'l-Bahá\"\n","language":"Ksh"},{"code":"val .urlEncode = fn(.s) replace(\n .s, re/[^A-Za-z0-9]/,\n fn(.s2) join \"\", map fn(.b) $\"%\\.b:X02;\", s2b .s2,\n)\n\nwriteln .urlEncode(\"https://some website.com/\")\n","language":"Langur"},{"code":"bytes('http://foo bar/') -> encodeurl\n","language":"Lasso"},{"code":" dim lookUp$( 256)\n\n for i =0 to 256\n lookUp$( i) =\"%\" +dechex$( i)\n next i\n\n string$ =\"http://foo bar/\"\n\n print \"Supplied string '\"; string$; \"'\"\n print \"As URL '\"; url$( string$); \"'\"\n\n end\n\nfunction url$( i$)\n for j =1 to len( i$)\n c$ =mid$( i$, j, 1)\n if instr( \"0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz\", c$) then\n url$ =url$ +c$\n else\n url$ =url$ +lookUp$( asc( c$))\n end if\n next j\nend function\n","language":"Liberty-BASIC"},{"code":"put urlencode(\"http://foo bar/\")\n-- \"http%3a%2f%2ffoo+bar%2f\"\n","language":"Lingo"},{"code":"urlEncode(\"http://foo bar/\")\n-- http%3A%2F%2Ffoo+bar%2F\n","language":"LiveCode"},{"code":"function encodeChar(chr)\n\treturn string.format(\"%%%X\",string.byte(chr))\nend\n\nfunction encodeString(str)\n\tlocal output, t = string.gsub(str,\"[^%w]\",encodeChar)\n\treturn output\nend\n\n-- will print \"http%3A%2F%2Ffoo%20bar%2F\"\nprint(encodeString(\"http://foo bar/\"))\n","language":"Lua"},{"code":"Module Checkit {\n Function decodeUrl$(a$) {\n DIM a$()\n a$()=Piece$(a$, \"%\")\n if len(a$())=1 then =str$(a$):exit\n k=each(a$(),2)\n acc$=str$(a$(0))\n While k {\n acc$+=str$(Chr$(Eval(\"0x\"+left$(a$(k^),2)))+Mid$(a$(k^),3))\n }\n =string$(acc$ as utf8dec)\n }\n Group Parse$ {\n all$, c=1\n tc$=\"\"\n Enum UrlType {None=0, RFC3986, HTML5}\n variation\n TypeData=(\"\",\"-._~\",\"-._*\")\n Function Next {\n .tc$<=mid$(.all$,.c,1)\n .c++\n =.tc$<>\"\"\n }\n Value {\n =.tc$\n }\n Function DecodeOne$ {\n if .tc$=\"\" then exit\n if .tc$ ~\"[A-Za-z0-9]\" then =.tc$ : exit\n If .tc$=\" \" Then =if$(.variation=.HTML5->\"+\",\"%20\") :exit\n if instr(.TypeData#val$(.variation),.tc$)>0 then =.tc$ :exit\n =\"%\"+hex$(asc(.tc$), 1)\n }\n Function Decode$ {\n acc$=\"\"\n .c<=1\n While .Next() {\n acc$+=.DecodeOne$()\n }\n =acc$\n }\n Set () {\n \\\\ using optional argument\n var=.None\n Read a$, ? var\n a$=chr$(string$(a$ as utf8enc))\n .variation<=var\n .all$<=a$\n .c<=1\n }\n }\n \\\\ MAIN\n Parse$()=\"http://foo bar/\"\n Print Quote$(Parse.Decode$())\n Parse.variation=Parse.HTML5\n Print Quote$(Parse.Decode$())\n Parse.variation=Parse.RFC3986\n Print Quote$(Parse.Decode$())\n Parse$(Parse.RFC3986) ={mailto:\"Irma User\" <irma.user@mail.com>}\n Print Quote$(Parse.Decode$())\n Parse$(Parse.RFC3986) ={http://foo.bar.com/~user-name/_subdir/*~.html}\n m=each(Parse.UrlType)\n while m {\n Parse.variation=eval(m)\n Print Quote$(Parse.Decode$())\n Print decodeUrl$(Parse.Decode$())\n }\n}\nCheckIt\n","language":"M2000-Interpreter"},{"code":"URL:-Escape(\"http://foo bar/\");\n","language":"Maple"},{"code":"URLEncoding[url_] :=\n StringReplace[url,\n x : Except[\n Join[CharacterRange[\"0\", \"9\"], CharacterRange[\"a\", \"z\"],\n CharacterRange[\"A\", \"Z\"]]] :>\n StringJoin[(\"%\" ~~ #) & /@\n IntegerString[ToCharacterCode[x, \"UTF8\"], 16]]]\n","language":"Mathematica"},{"code":"URLEncoding[\"http://foo bar/\"]\n","language":"Mathematica"},{"code":"function u = urlencoding(s)\n\tu = '';\n\tfor k = 1:length(s),\n\t\tif isalnum(s(k))\n\t\t\tu(end+1) = s(k);\n\t\telse\n\t\t\tu=[u,'%',dec2hex(s(k)+0)];\n\t\tend; \t\n\tend\nend\n","language":"MATLAB"},{"code":"/* NetRexx */\noptions replace format comments java crossref symbols nobinary\n\n/* -------------------------------------------------------------------------- */\n testcase()\n say\n say 'RFC3986'\n testcase('RFC3986')\n say\n say 'HTML5'\n testcase('HTML5')\n say\n return\n\n/* -------------------------------------------------------------------------- */\nmethod encode(url, varn) public static\n\n variation = varn.upper\n opts = ''\n opts['RFC3986'] = '-._~'\n opts['HTML5'] = '-._*'\n\n rp = ''\n loop while url.length > 0\n parse url tc +1 url\n select\n when tc.datatype('A') then do\n rp = rp || tc\n end\n when tc == ' ' then do\n if variation = 'HTML5' then\n rp = rp || '+'\n else\n rp = rp || '%' || tc.c2x\n end\n otherwise do\n if opts[variation].pos(tc) > 0 then do\n rp = rp || tc\n end\n else do\n rp = rp || '%' || tc.c2x\n end\n end\n end\n end\n\n return rp\n\n/* -------------------------------------------------------------------------- */\nmethod testcase(variation = '') public static\n\n url = [ -\n 'http://foo bar/' -\n , 'mailto:\"Ivan Aim\" <ivan.aim@email.com>' -\n , 'mailto:\"Irma User\" <irma.user@mail.com>' -\n , 'http://foo.bar.com/~user-name/_subdir/*~.html' -\n ]\n\n loop i_ = 0 to url.length - 1\n say url[i_]\n say encode(url[i_], variation)\n end i_\n\n return\n","language":"NetRexx"},{"code":";; simple encoder\n;; (source http://www.newlisp.org/index.cgi?page=Code_Snippets)\n(define (url-encode str)\n (replace {([^a-zA-Z0-9])} str (format \"%%%2X\" (char $1)) 0))\n\n(url-encode \"http://foo bar/\")\n","language":"NewLISP"},{"code":"import cgi\n\necho encodeUrl(\"http://foo/bar/\")\n","language":"Nim"},{"code":"MODULE URLEncoding;\nIMPORT\n Out := NPCT:Console,\n ADT:StringBuffer,\n URI := URI:String;\nVAR\n encodedUrl: StringBuffer.StringBuffer;\nBEGIN\n encodedUrl := NEW(StringBuffer.StringBuffer,512);\n URI.AppendEscaped(\"http://foo bar/\",\"\",encodedUrl);\n Out.String(encodedUrl.ToString());Out.Ln\nEND URLEncoding.\n","language":"Oberon"},{"code":"use FastCgi;\n\nbundle Default {\n class UrlEncode {\n function : Main(args : String[]) ~ Nil {\n url := \"http://foo bar/\";\n UrlUtility->Encode(url)->PrintLine();\n }\n }\n}\n","language":"Objeck"},{"code":"NSString *normal = @\"http://foo bar/\";\nNSString *encoded = [normal stringByAddingPercentEscapesUsingEncoding:NSUTF8StringEncoding];\nNSLog(@\"%@\", encoded);\n","language":"Objective-C"},{"code":"NSString *normal = @\"http://foo bar/\";\nNSString *encoded = [normal stringByAddingPercentEncodingWithAllowedCharacters:[NSCharacterSet alphanumericCharacterSet]];\nNSLog(@\"%@\", encoded);\n","language":"Objective-C"},{"code":"$ ocaml\n# #use \"topfind\";;\n# #require \"netstring\";;\n\n# Netencoding.Url.encode \"http://foo bar/\" ;;\n- : string = \"http%3A%2F%2Ffoo+bar%2F\"\n","language":"OCaml"},{"code":"sub urlencode {\n my $s = shift;\n $s =~ s/([^-A-Za-z0-9_.!~*'() ])/sprintf(\"%%%02X\", ord($1))/eg;\n $s =~ tr/ /+/;\n return $s;\n}\n\nprint urlencode('http://foo bar/').\"\\n\";\n","language":"Perl"},{"code":"use URI::Escape;\n\nmy $s = 'http://foo/bar/';\nprint uri_escape($s);\n","language":"Perl"},{"code":"use 5.10.0;\nuse CGI;\n\nmy $s = 'http://foo/bar/';\nsay $s = CGI::escape($s);\nsay $s = CGI::unescape($s);\n","language":"Perl"},{"code":"(phixonline)-->\n <span style=\"color: #000080;font-style:italic;\">--\n -- demo\\rosetta\\encode_url.exw\n -- ===========================\n --</span>\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;\">nib</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #004080;\">integer</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: #008080;\">iff</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">b</span><span style=\"color: #0000FF;\"><=</span><span style=\"color: #000000;\">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>\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;\">encode_url</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;\">string</span> <span style=\"color: #000000;\">exclusions</span><span style=\"color: #0000FF;\">=</span><span style=\"color: #008000;\">\"\"</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #004080;\">integer</span> <span style=\"color: #000000;\">spaceplus</span><span style=\"color: #0000FF;\">=</span><span style=\"color: #000000;\">0</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: #008000;\">\"\"</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;\">integer</span> <span style=\"color: #000000;\">ch</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;\">' '</span> <span style=\"color: #008080;\">and</span> <span style=\"color: #000000;\">spaceplus</span> <span style=\"color: #008080;\">then</span>\n <span style=\"color: #000000;\">ch</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #008000;\">'+'</span>\n <span style=\"color: #008080;\">elsif</span> <span style=\"color: #008080;\">not</span> <span style=\"color: #7060A8;\">find</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">ch</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">exclusions</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #008080;\">and</span> <span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">ch</span><span style=\"color: #0000FF;\"><</span><span style=\"color: #008000;\">'0'</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: #008000;\">'9'</span> <span style=\"color: #008080;\">and</span> <span style=\"color: #000000;\">ch</span><span style=\"color: #0000FF;\"><</span><span style=\"color: #008000;\">'A'</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: #008000;\">'Z'</span> <span style=\"color: #008080;\">and</span> <span style=\"color: #000000;\">ch</span><span style=\"color: #0000FF;\"><</span><span style=\"color: #008000;\">'a'</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #008080;\">or</span> <span style=\"color: #000000;\">ch</span><span style=\"color: #0000FF;\">></span><span style=\"color: #008000;\">'z'</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: #008000;\">'%'</span>\n <span style=\"color: #000000;\">res</span> <span style=\"color: #0000FF;\">&=</span> <span style=\"color: #000000;\">nib</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #7060A8;\">floor</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">ch</span><span style=\"color: #0000FF;\">/</span><span style=\"color: #000000;\">#10</span><span style=\"color: #0000FF;\">))</span>\n <span style=\"color: #000000;\">ch</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">nib</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #7060A8;\">and_bits</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">ch</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">#0F</span><span style=\"color: #0000FF;\">))</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;\">ch</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: #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;\">encode_url</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #008000;\">\"http://foo bar/\"</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":"<?php\n$s = 'http://foo/bar/';\n$s = rawurlencode($s);\n?>\n","language":"PHP"},{"code":"(de urlEncodeTooMuch (Str)\n (pack\n (mapcar\n '((C)\n (if (or (>= \"9\" C \"0\") (>= \"Z\" (uppc C) \"A\"))\n C\n (list '% (hex (char C))) ) )\n (chop Str) ) ) )\n","language":"PicoLisp"},{"code":"Protocols.HTTP.uri_encode( \"http://foo bar/\" );\n","language":"Pike"},{"code":"[uri]::EscapeDataString('http://foo bar/')\n\nhttp%3A%2F%2Ffoo%20bar%2F\n","language":"PowerShell"},{"code":"URL$ = URLEncoder(\"http://foo bar/\")\n","language":"PureBasic"},{"code":"import urllib\ns = 'http://foo/bar/'\ns = urllib.quote(s)\n","language":"Python"},{"code":"URLencode(\"http://foo bar/\")\n","language":"R"},{"code":"library(RCurl)\ncurlEscape(\"http://foo bar/\")\n","language":"R"},{"code":"#lang racket\n(require net/uri-codec)\n(uri-encode \"http://foo bar/\")\n","language":"Racket"},{"code":"my $url = 'http://foo bar/';\n\nsay $url.subst(/<-alnum>/, *.ord.fmt(\"%%%02X\"), :g);\n","language":"Raku"},{"code":" Dim URL As String = \"http://foo bar/\"\n URL = EncodeURLComponent(URL)\n Print(URL)\n","language":"REALbasic"},{"code":"Function URLEncode(Data As String, ParamArray Exceptions() As String) As String\n Dim buf As String\n For i As Integer = 1 To Data.Len\n Dim char As String = Data.Mid(i, 1)\n Select Case Asc(char)\n Case 48 To 57, 65 To 90, 97 To 122, 45, 46, 95\n buf = buf + char\n Else\n If Exceptions.IndexOf(char) > -1 Then\n buf = buf + char\n Else\n buf = buf + \"%\" + Left(Hex(Asc(char)) + \"00\", 2)\n End If\n End Select\n Next\n Return buf\nEnd Function\n\n 'usage\n Dim s As String = URLEncode(\"http://foo bar/\") ' no exceptions\n Dim t As String = URLEncode(\"http://foo bar/\", \"!\", \"?\", \",\") ' with exceptions\n","language":"REALbasic"},{"code":"/* Rexx */\ndo\n call testcase\n say\n say RFC3986\n call testcase RFC3986\n say\n say HTML5\n call testcase HTML5\n say\n return\nend\nexit\n\n/* -------------------------------------------------------------------------- */\nencode:\nprocedure\ndo\n parse arg url, varn .\n parse upper var varn variation\n drop RFC3986 HTML5\n opts. = ''\n opts.RFC3986 = '-._~'\n opts.HTML5 = '-._*'\n\n rp = ''\n do while length(url) > 0\n parse var url tc +1 url\n select\n when datatype(tc, 'A') then do\n rp = rp || tc\n end\n when tc == ' ' then do\n if variation = HTML5 then\n rp = rp || '+'\n else\n rp = rp || '%' || c2x(tc)\n end\n otherwise do\n if pos(tc, opts.variation) > 0 then do\n rp = rp || tc\n end\n else do\n rp = rp || '%' || c2x(tc)\n end\n end\n end\n end\n\n return rp\nend\nexit\n\n/* -------------------------------------------------------------------------- */\ntestcase:\nprocedure\ndo\n parse arg variation\n X = 0\n url. = ''\n X = X + 1; url.0 = X; url.X = 'http://foo bar/'\n X = X + 1; url.0 = X; url.X = 'mailto:\"Ivan Aim\" <ivan.aim@email.com>'\n X = X + 1; url.0 = X; url.X = 'mailto:\"Irma User\" <irma.user@mail.com>'\n X = X + 1; url.0 = X; url.X = 'http://foo.bar.com/~user-name/_subdir/*~.html'\n\n do i_ = 1 to url.0\n say url.i_\n say encode(url.i_, variation)\n end i_\n\n return\nend\n","language":"REXX"},{"code":"/*REXX program encodes a URL text, blanks ──► +, preserves -._* and -._~ */\nurl.=; url.1= 'http://foo bar/'\n url.2= 'mailto:\"Ivan Aim\" <ivan.aim@email.com>'\n url.3= 'mailto:\"Irma User\" <irma.user@mail.com>'\n url.4= 'http://foo.bar.com/~user-name/_subdir/*~.html'\n do j=1 while url.j\\==''; say\n say ' original: ' url.j\n say ' encoded: ' URLencode(url.j)\n end /*j*/\nexit /*stick a fork in it, we're all done. */\n/*──────────────────────────────────────────────────────────────────────────────────────*/\nURLencode: procedure; parse arg $,,z; t1= '-._~' /*get args, null Z.*/\n skip=0; t2= '-._*'\n do k=1 for length($); _=substr($, k, 1) /*get a character. */\n if skip\\==0 then do; skip=skip-1 /*skip t1 or t2 ? */\n iterate /*skip a character.*/\n end\n select\n when datatype(_, 'A') then z=z || _ /*is alphanumeric ?*/\n when _==' ' then z=z'+' /*is it a blank ?*/\n when substr($, k, 4)==t1 |, /*is it t1 or t2 ?*/\n substr($, k, 4)==t2 then do; skip=3 /*skip 3 characters*/\n z=z || substr($, k, 4)\n end\n otherwise z=z'%'c2x(_) /*special character*/\n end /*select*/\n end /*k*/\n return z\n","language":"REXX"},{"code":"require 'cgi'\nputs CGI.escape(\"http://foo bar/\").gsub(\"+\", \"%20\")\n# => \"http%3A%2F%2Ffoo%20bar%2F\"\n","language":"Ruby"},{"code":"require 'uri'\nputs URI.encode_www_form_component(\"http://foo bar/\").gsub(\"+\", \"%20\")\n# => \"http%3A%2F%2Ffoo%20bar%2F\"\n","language":"Ruby"},{"code":"urlIn$ = \"http://foo bar/\"\n\nfor i = 1 to len(urlIn$)\n a$ = mid$(urlIn$,i,1)\n if (a$ >= \"0\" and a$ <= \"9\") _\n or (a$ >= \"A\" and a$ <= \"Z\") _\n or (a$ >= \"a\" and a$ <= \"z\") then url$ = url$ + a$ else url$ = url$ + \"%\"+dechex$(asc(a$))\nnext i\nprint urlIn$;\" -> \";url$\n","language":"Run-BASIC"},{"code":"const INPUT: &str = \"http://foo bar/\";\nconst MAX_CHAR_VAL: u32 = std::char::MAX as u32;\n\nfn main() {\n let mut buff = [0; 4];\n println!(\"{}\", INPUT.chars()\n .map(|ch| {\n match ch as u32 {\n 0 ..= 47 | 58 ..= 64 | 91 ..= 96 | 123 ..= MAX_CHAR_VAL => {\n ch.encode_utf8(&mut buff);\n buff[0..ch.len_utf8()].iter().map(|&byte| format!(\"%{:X}\", byte)).collect::<String>()\n },\n _ => ch.to_string(),\n }\n })\n .collect::<String>()\n );\n}\n","language":"Rust"},{"code":"import java.net.{URLDecoder, URLEncoder}\nimport scala.compat.Platform.currentTime\n\nobject UrlCoded extends App {\n val original = \"\"\"http://foo bar/\"\"\"\n val encoded: String = URLEncoder.encode(original, \"UTF-8\")\n\n assert(encoded == \"http%3A%2F%2Ffoo+bar%2F\", s\"Original: $original not properly encoded: $encoded\")\n\n val percentEncoding = encoded.replace(\"+\", \"%20\")\n assert(percentEncoding == \"http%3A%2F%2Ffoo%20bar%2F\", s\"Original: $original not properly percent-encoded: $percentEncoding\")\n\n assert(URLDecoder.decode(encoded, \"UTF-8\") == URLDecoder.decode(percentEncoding, \"UTF-8\"))\n\n println(s\"Successfully completed without errors. [total ${currentTime - executionStart} ms]\")\n}\n","language":"Scala"},{"code":"$ include \"seed7_05.s7i\";\n include \"encoding.s7i\";\n\nconst proc: main is func\n begin\n writeln(toPercentEncoded(\"http://foo bar/\"));\n writeln(toUrlEncoded(\"http://foo bar/\"));\n end func;\n","language":"Seed7"},{"code":"func urlencode(str) {\n str.gsub!(%r\"([^-A-Za-z0-9_.!~*'() ])\", {|a| \"%%%02X\" % a.ord});\n str.gsub!(' ', '+');\n return str;\n}\n\nsay urlencode('http://foo bar/');\n","language":"Sidef"},{"code":"# Encode all except \"unreserved\" characters; use UTF-8 for extended chars.\n# See http://tools.ietf.org/html/rfc3986 §2.4 and §2.5\nproc urlEncode {str} {\n set uStr [encoding convertto utf-8 $str]\n set chRE {[^-A-Za-z0-9._~\\n]};\t\t# Newline is special case!\n set replacement {%[format \"%02X\" [scan \"\\\\\\0\" \"%c\"]]}\n return [string map {\"\\n\" \"%0A\"} [subst [regsub -all $chRE $uStr $replacement]]]\n}\n","language":"Tcl"},{"code":"puts [urlEncode \"http://foo bar/\"]\n","language":"Tcl"},{"code":"$$ MODE TUSCRIPT\ntext=\"http://foo bar/\"\nBUILD S_TABLE spez_char=\"::>/:</::<%:\"\nspez_char=STRINGS (text,spez_char)\nLOOP/CLEAR c=spez_char\nc=ENCODE(c,hex),c=concat(\"%\",c),spez_char=APPEND(spez_char,c)\nENDLOOP\nurl_encoded=SUBSTITUTE(text,spez_char,0,0,spez_char)\nprint \"text: \", text\nPRINT \"encoded: \", url_encoded\n","language":"TUSCRIPT"},{"code":"function urlencode\n{\n\ttypeset decoded=$1 encoded= rest= c=\n\ttypeset rest2= bug='rest2=${rest}'\n\n\tif [[ -z ${BASH_VERSION} ]]; then\n\t\t# bug /usr/bin/sh HP-UX 11.00\n\t\ttypeset _decoded='xyz%26xyz'\n\t\trest=\"${_decoded#?}\"\n\t\tc=\"${_decoded%%${rest}}\"\n\t\tif (( ${#c} != 1 )); then\n\t\t\ttypeset qm='????????????????????????????????????????????????????????????????????????'\n\t\t\ttypeset bug='(( ${#rest} > 0 )) && typeset -L${#rest} rest2=\"${qm}\" || rest2=${rest}'\n\t\tfi\n\tfi\n\n\trest=\"${decoded#?}\"\n\teval ${bug}\n\tc=\"${decoded%%${rest2}}\"\n\tdecoded=\"${rest}\"\n\n\twhile [[ -n ${c} ]]; do\n\t\tcase ${c} in\n\t\t[-a-zA-z0-9.])\n\t\t\t;;\n\t\t' ')\n\t\t\tc='+'\n\t\t\t;;\n\t\t*)\n\t\t\tc=$(printf \"%%%02X\" \"'$c\")\n\t\t\t;;\n\t\tesac\n\n\t\tencoded=\"${encoded}${c}\"\n\n\t\trest=\"${decoded#?}\"\n\t\teval ${bug}\n\t\tc=\"${decoded%%${rest2}}\"\n\t\tdecoded=\"${rest}\"\n\tdone\n\n\tif [[ -n ${BASH_VERSION:-} ]]; then\n\t\t\\echo -E \"${encoded}\"\n\telse\n\t\tprint -r -- \"${encoded}\"\n\tfi\n}\n","language":"UNIX-Shell"},{"code":"import net.urllib\nfn main() {\n\tprintln(urllib.query_escape(\"http://foo bar/\"))\n}\n","language":"V-(Vlang)"},{"code":"Function UrlEncode(url)\n\tFor i = 1 To Len(url)\n\t\tn = Asc(Mid(url,i,1))\n\t\tIf (n >= 48 And n <= 57) Or (n >= 65 And n <= 90) _\n\t\t\tOr (n >= 97 And n <= 122) Then\n\t\t\tUrlEncode = UrlEncode & Mid(url,i,1)\n\t\tElse\n\t\t\tChrHex = Hex(Asc(Mid(url,i,1)))\n For j = 0 to (Len(ChrHex) / 2) - 1\n\t\t\t UrlEncode = UrlEncode & \"%\" & Mid(ChrHex,(2*j) + 1,2)\n Next\n\t\tEnd If\n\tNext\nEnd Function\n\nWScript.Echo UrlEncode(\"http://foo baré/\")\n","language":"VBScript"},{"code":"import \"./fmt\" for Fmt\n\nvar urlEncode = Fn.new { |url|\n var res = \"\"\n for (b in url.bytes) {\n if ((b >= 48 && b <= 57) || (b >= 65 && b <= 90) || (b >= 97 && b <= 122)) {\n res = res + String.fromByte(b)\n } else {\n res = res + Fmt.swrite(\"\\%$2X\", b)\n }\n }\n return res\n}\n\nvar urls = [\n \"http://foo bar/\",\n \"mailto:\\\"Ivan Aim\\\" <ivan.aim@email.com>\",\n \"mailto:\\\"Irma User\\\" <irma.user@mail.com>\",\n \"http://foo.bar.com/~user-name/_subdir/*~.html\"\n]\nfor (url in urls) System.print(urlEncode.call(url))\n","language":"Wren"},{"code":"code Text=12;\nstring 0; \\use zero-terminated strings\n\nfunc Encode(S0); \\Encode URL string and return its address\nchar S0;\nchar HD, S1(80); \\BEWARE: very temporary string space returned\nint C, I, J;\n[HD:= \"0123456789ABCDEF\"; \\hex digits\nI:= 0; J:= 0;\nrepeat C:= S0(I); I:= I+1;\n if C>=^0 & C<=^9 ! C>=^A & C<=^Z ! C>=^a & C<=^z ! C=0\n then [S1(J):= C; J:= J+1] \\simply pass char to S1\n else [S1(J):= ^%; J:= J+1; \\encode char into S1\n S1(J):= HD(C>>4); J:= J+1;\n S1(J):= HD(C&$0F); J:= J+1;\n ];\nuntil C=0;\nreturn S1;\n];\n\nText(0, Encode(\"http://foo bar/\"))\n","language":"XPL0"},{"code":"sub encode_url$(s$, exclusions$, spaceplus)\n local res$, i, ch$\n\t\n for i=1 to len(s$)\n ch$ = mid$(s$, i, 1)\n if ch$ = \" \" and spaceplus then\n ch$ = \"+\"\n elsif not instr(esclusions$, ch$) and (ch$ < \"0\" or (ch$ > \"9\" and ch$ < \"A\") or (ch$ > \"Z\" and ch$ < \"a\") or ch$ > \"z\") then\n res$ = res$ + \"%\"\n ch$ = upper$(hex$(asc(ch$)))\n end if\n res$ = res$ + ch$\n next i\n return res$\nend sub\n\nprint encode_url$(\"http://foo bar/\")\n","language":"Yabasic"},{"code":"var CURL=Import(\"zklCurl\");\nCURL.urlEncode(\"http://foo bar/\") //--> \"http%3A%2F%2Ffoo%20bar%2F\"\n","language":"Zkl"}],"string":"[\n {\n \"code\": \"---\\ncategory:\\n- String manipulation\\n- Encodings\\nfrom: http://rosettacode.org/wiki/URL_encoding\\n\",\n \"language\": \"00-META\"\n },\n {\n \"code\": \";Task:\\nProvide a function or mechanism to convert a provided string into URL encoding representation.\\n\\nIn URL encoding, special characters, control characters and extended characters \\nare converted into a percent symbol followed by a two digit hexadecimal code, \\nSo a space character encodes into %20 within the string.\\n\\nFor the purposes of this task, every character except 0-9, A-Z and a-z requires conversion, so the following characters all require conversion by default:\\n\\n* ASCII control codes (Character ranges 00-1F hex (0-31 decimal) and 7F (127 decimal).\\n* ASCII symbols (Character ranges 32-47 decimal (20-2F hex))\\n* ASCII symbols (Character ranges 58-64 decimal (3A-40 hex))\\n* ASCII symbols (Character ranges 91-96 decimal (5B-60 hex))\\n* ASCII symbols (Character ranges 123-126 decimal (7B-7E hex))\\n* Extended characters with character codes of 128 decimal (80 hex) and above.\\n\\n<br>\\n;Example:\\nThe string \\\"<code><nowiki>http://foo bar/</nowiki></code>\\\" would be encoded as \\\"<code><nowiki>http%3A%2F%2Ffoo%20bar%2F</nowiki></code>\\\".\\n\\n\\n;Variations:\\n* Lowercase escapes are legal, as in \\\"<code><nowiki>http%3a%2f%2ffoo%20bar%2f</nowiki></code>\\\".\\n* Special characters have different encodings for different standards:\\n** RFC 3986, ''Uniform Resource Identifier (URI): Generic Syntax'', section 2.3, says to preserve \\\"-._~\\\".\\n** HTML 5, section [http://www.whatwg.org/specs/web-apps/current-work/multipage/association-of-controls-and-forms.html#url-encoded-form-data 4.10.22.5 URL-encoded form data], says to preserve \\\"-._*\\\", and to encode space \\\" \\\" to \\\"+\\\".\\n** [https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/encodeURI#description encodeURI] function in Javascript will preserve \\\"-._~\\\" (RFC 3986) and \\\";,/?:@&=+$!*'()#\\\".\\n\\n;Options:\\nIt is permissible to use an exception string (containing a set of symbols \\nthat do not need to be converted). \\nHowever, this is an optional feature and is not a requirement of this task.\\n\\n\\n;Related tasks: \\n* [[URL decoding]]\\n* [[URL parser]]\\n<br><br>\\n\\n\",\n \"language\": \"00-TASK\"\n },\n {\n \"code\": \"F url_encode(s)\\n V r = ‘’\\n V buf = ‘’\\n\\n F flush_buf() // this function is needed because strings in 11l are UTF-16 encoded\\n I @buf != ‘’\\n V bytes = @buf.encode(‘utf-8’)\\n L(b) bytes\\n @r ‘’= ‘%’hex(b).zfill(2)\\n @buf = ‘’\\n\\n L(c) s\\n I c C (‘0’..‘9’, ‘a’..‘z’, ‘A’..‘Z’, ‘_’, ‘.’, ‘-’, ‘~’)\\n flush_buf()\\n r ‘’= c\\n E\\n buf ‘’= c\\n\\n flush_buf()\\n R r\\n\\nprint(url_encode(‘http://foo bar/’))\\nprint(url_encode(‘https://ru.wikipedia.org/wiki/Транспайлер’))\\n\",\n \"language\": \"11l\"\n },\n {\n \"code\": \"BYTE FUNC MustEncode(CHAR c CHAR ARRAY ex)\\n BYTE i\\n\\n IF c>='a AND c<='z OR c>='A AND c<='Z OR c>='0 AND c<='9 THEN\\n RETURN (0)\\n FI\\n IF ex(0)>0 THEN\\n FOR i=1 TO ex(0)\\n DO\\n IF ex(i)=c THEN\\n RETURN (0)\\n FI\\n OD\\n FI\\nRETURN (1)\\n\\nPROC Append(CHAR ARRAY s CHAR c)\\n s(0)==+1\\n s(s(0))=c\\nRETURN\\n\\nPROC Encode(CHAR ARRAY in,out,ex BYTE spaceToPlus)\\n CHAR ARRAY hex=['0 '1 '2 '3 '4 '5 '6 '7 '8 '9 'A 'B 'C 'D 'E 'F]\\n BYTE i\\n CHAR c\\n\\n out(0)=0\\n FOR i=1 TO in(0)\\n DO\\n c=in(i)\\n IF spaceToPlus=1 AND c=32 THEN\\n Append(out,'+)\\n ELSEIF MustEncode(c,ex) THEN\\n Append(out,'%)\\n Append(out,hex(c RSH 4))\\n Append(out,hex(c&$0F))\\n ELSE\\n Append(out,c)\\n FI\\n OD\\nRETURN\\n\\nPROC EncodeRaw(CHAR ARRAY in,out)\\n Encode(in,out,\\\"\\\",0)\\nRETURN\\n\\nPROC EncodeRFC3986(CHAR ARRAY in,out)\\n Encode(in,out,\\\"-._~\\\",0)\\nRETURN\\n\\nPROC EncodeHTML5(CHAR ARRAY in,out)\\n Encode(in,out,\\\"-._*\\\",1)\\nRETURN\\n\\nPROC PrintInv(CHAR ARRAY a)\\n BYTE i\\n\\n IF a(0)>0 THEN\\n FOR i=1 TO a(0)\\n DO\\n Put(a(i)%$80)\\n OD\\n FI\\nRETURN\\n\\nPROC Test(CHAR ARRAY in)\\n CHAR ARRAY out(256)\\n\\n PrintInv(\\\"input \\\")\\n PrintF(\\\" %S%E\\\",in)\\n\\n EncodeRaw(in,out)\\n PrintInv(\\\"encoded \\\")\\n PrintF(\\\" %S%E\\\",out)\\n\\n EncodeRFC3986(in,out)\\n PrintInv(\\\"RFC 3986\\\")\\n PrintF(\\\" %S%E\\\",out)\\n\\n EncodeHTML5(in,out)\\n PrintInv(\\\"HTML 5 \\\")\\n PrintF(\\\" %S%E%E\\\",out)\\nRETURN\\n\\nPROC Main()\\n Test(\\\"http://foo bar/\\\")\\n Test(\\\"http://www.rosettacode.org/wiki/URL_encoding\\\")\\n Test(\\\"http://foo bar/*_-.html\\\")\\nRETURN\\n\",\n \"language\": \"Action-\"\n },\n {\n \"code\": \"with AWS.URL;\\nwith Ada.Text_IO; use Ada.Text_IO;\\nprocedure Encode is\\n Normal : constant String := \\\"http://foo bar/\\\";\\nbegin\\n Put_Line (AWS.URL.Encode (Normal));\\nend Encode;\\n\",\n \"language\": \"Ada\"\n },\n {\n \"code\": \"BEGIN\\n # encodes the specified url - 0-9, A-Z and a-z are unchanged, #\\n # everything else is converted to %xx where xx are hex-digits #\\n PROC encode url = ( STRING url )STRING:\\n IF url = \\\"\\\" THEN \\\"\\\" # empty string #\\n ELSE\\n # non-empty string #\\n # ensure result will be big enough for a string of all encodable #\\n # characters #\\n STRING hex digits = \\\"0123456789ABCDEF\\\";\\n [ 1 : ( ( UPB url - LWB url ) + 1 ) * 3 ]CHAR result;\\n INT r pos := 0;\\n FOR u pos FROM LWB url TO UPB url DO\\n CHAR c = url[ u pos ];\\n IF ( c >= \\\"0\\\" AND c <= \\\"9\\\" )\\n OR ( c >= \\\"A\\\" AND c <= \\\"Z\\\" )\\n OR ( c >= \\\"a\\\" AND c <= \\\"z\\\" )\\n THEN\\n # no need to encode this character #\\n result[ r pos +:= 1 ] := c\\n ELSE\\n # must encode #\\n INT c code = ABS c;\\n result[ r pos +:= 1 ] := \\\"%\\\";\\n result[ r pos +:= 1 ] := hex digits[ ( c code OVER 16 ) + 1 ];\\n result[ r pos +:= 1 ] := hex digits[ ( c code MOD 16 ) + 1 ]\\n FI\\n OD;\\n result[ 1 : r pos ]\\n FI; # encode url #\\n # task test case #\\n print( ( encode url( \\\"http://foo bar/\\\" ), newline ) )\\nEND\\n\",\n \"language\": \"ALGOL-68\"\n },\n {\n \"code\": \"EncodingUtil.urlEncode('http://foo bar/', 'UTF-8')\\n\",\n \"language\": \"Apex\"\n },\n {\n \"code\": \"AST URL encode \\\"http://foo bar/\\\"\\n\",\n \"language\": \"AppleScript\"\n },\n {\n \"code\": \" 100 URL$ = \\\"http://foo bar/\\\"\\n 110 GOSUB 140\\\"URL ENCODE URL$ RETURNS R$\\n 120 PRINT R$;\\n 130 END\\n 140 LET R$ = \\\"\\\"\\n 150 LET L = LEN (URL$)\\n 160 IF NOT L THEN RETURN\\n 170 LET H$ = \\\"0123456789ABCDEF\\\"\\n 180 FOR I = 1 TO L\\n 190 LET C$ = MID$ (URL$,I,1)\\n 200 LET C = ASC (C$)\\n 210 IF C < ASC (\\\"0\\\") OR C > ASC (\\\"Z\\\") + 32 OR C > ASC (\\\"9\\\") AND C < ASC (\\\"A\\\") OR C > ASC (\\\"Z\\\") AND C < ASC (\\\"A\\\") + 32 THEN H = INT (C / 16):C$ = \\\"%\\\" + MID$ (H$,H + 1,1) + MID$ (H$,C - H * 16 + 1,1)\\n 220 LET R$ = R$ + C$\\n 230 NEXT I\\n 240 RETURN\\n\",\n \"language\": \"Applesoft-BASIC\"\n },\n {\n \"code\": \"encoded: encode.url.slashes \\\"http://foo bar/\\\"\\nprint encoded\\n\",\n \"language\": \"Arturo\"\n },\n {\n \"code\": \"MsgBox, % UriEncode(\\\"http://foo bar/\\\")\\n\\n; Modified from http://goo.gl/0a0iJq\\nUriEncode(Uri, Reserved:=\\\"!#$&'()*+,/:;=?@[]\\\") {\\n Unreserved := \\\"ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789-_.~\\\"\\n\\tVarSetCapacity(Var, StrPut(Uri, \\\"UTF-8\\\"), 0)\\n\\tStrPut(Uri, &Var, \\\"UTF-8\\\")\\n\\tWhile (Code := NumGet(Var, A_Index - 1, \\\"UChar\\\")) {\\n\\t\\tIf InStr(Unreserved . Reserved, Chr(Code)) {\\n\\t\\t\\tEncoded .= Chr(Code)\\n }\\n\\t\\tElse {\\n\\t\\t\\tEncoded .= Format(\\\"%{:02X}\\\", Code)\\n }\\n }\\n\\tReturn Encoded\\n}\\n\",\n \"language\": \"AutoHotkey\"\n },\n {\n \"code\": \"BEGIN {\\n\\tfor (i = 0; i <= 255; i++)\\n\\t\\tord[sprintf(\\\"%c\\\", i)] = i\\n}\\n\\n# Encode string with application/x-www-form-urlencoded escapes.\\nfunction escape(str, c, len, res) {\\n\\tlen = length(str)\\n\\tres = \\\"\\\"\\n\\tfor (i = 1; i <= len; i++) {\\n\\t\\tc = substr(str, i, 1);\\n\\t\\tif (c ~ /[0-9A-Za-z]/)\\n\\t\\t#if (c ~ /[-._*0-9A-Za-z]/)\\n\\t\\t\\tres = res c\\n\\t\\t#else if (c == \\\" \\\")\\n\\t\\t#\\tres = res \\\"+\\\"\\n\\t\\telse\\n\\t\\t\\tres = res \\\"%\\\" sprintf(\\\"%02X\\\", ord[c])\\n\\t}\\n\\treturn res\\n}\\n\\n# Escape every line of input.\\n{ print escape($0) }\\n\",\n \"language\": \"AWK\"\n },\n {\n \"code\": \" PRINT FNurlencode(\\\"http://foo bar/\\\")\\n END\\n\\n DEF FNurlencode(url$)\\n LOCAL c%, i%\\n WHILE i% < LEN(url$)\\n i% += 1\\n c% = ASCMID$(url$, i%)\\n IF c%<&30 OR c%>&7A OR c%>&39 AND c%<&41 OR c%>&5A AND c%<&61 THEN\\n url$ = LEFT$(url$,i%-1) + \\\"%\\\" + RIGHT$(\\\"0\\\"+STR$~c%,2) + MID$(url$,i%+1)\\n ENDIF\\n ENDWHILE\\n = url$\\n\",\n \"language\": \"BBC-BASIC\"\n },\n {\n \"code\": \"( ( encode\\n = encoded exceptions octet string\\n . !arg:(?exceptions.?string)\\n & :?encoded\\n & @( !string\\n : ?\\n ( %@?octet ?\\n & !encoded\\n ( !octet\\n : ( ~<0:~>9\\n | ~<A:~>Z\\n | ~<a:~>z\\n )\\n | @(!exceptions:? !octet ?)\\n & !octet\\n | \\\"%\\\" d2x$(asc$!octet)\\n )\\n : ?encoded\\n & ~\\n )\\n )\\n | str$!encoded\\n )\\n & out$\\\"without exceptions:\\n\\\"\\n & out$(encode$(.\\\"http://foo bar/\\\"))\\n & out$(encode$(.\\\"mailto:Ivan\\\"))\\n & out$(encode$(.\\\"Aim <ivan.aim@email.com>\\\"))\\n & out$(encode$(.\\\"mailto:Irma\\\"))\\n & out$(encode$(.\\\"User <irma.user@mail.com>\\\"))\\n & out$(encode$(.\\\"http://foo.bar.com/~user-name/_subdir/*~.html\\\"))\\n & out$\\\"\\nwith RFC 3986 rules:\\n\\\"\\n & out$(encode$(\\\"-._~\\\".\\\"http://foo bar/\\\"))\\n & out$(encode$(\\\"-._~\\\".\\\"mailto:Ivan\\\"))\\n & out$(encode$(\\\"-._~\\\".\\\"Aim <ivan.aim@email.com>\\\"))\\n & out$(encode$(\\\"-._~\\\".\\\"mailto:Irma\\\"))\\n & out$(encode$(\\\"-._~\\\".\\\"User <irma.user@mail.com>\\\"))\\n & out$(encode$(\\\"-._~\\\".\\\"http://foo.bar.com/~user-name/_subdir/*~.html\\\"))\\n);\\n\",\n \"language\": \"Bracmat\"\n },\n {\n \"code\": \"#include <stdio.h>\\n#include <ctype.h>\\n\\nchar rfc3986[256] = {0};\\nchar html5[256] = {0};\\n\\n/* caller responsible for memory */\\nvoid encode(const char *s, char *enc, char *tb)\\n{\\n\\tfor (; *s; s++) {\\n\\t\\tif (tb[*s]) sprintf(enc, \\\"%c\\\", tb[*s]);\\n\\t\\telse sprintf(enc, \\\"%%%02X\\\", *s);\\n\\t\\twhile (*++enc);\\n\\t}\\n}\\n\\nint main()\\n{\\n\\tconst char url[] = \\\"http://foo bar/\\\";\\n\\tchar enc[(strlen(url) * 3) + 1];\\n\\n\\tint i;\\n\\tfor (i = 0; i < 256; i++) {\\n\\t\\trfc3986[i] = isalnum(i)||i == '~'||i == '-'||i == '.'||i == '_'\\n\\t\\t\\t? i : 0;\\n\\t\\thtml5[i] = isalnum(i)||i == '*'||i == '-'||i == '.'||i == '_'\\n\\t\\t\\t? i : (i == ' ') ? '+' : 0;\\n\\t}\\n\\n\\tencode(url, enc, rfc3986);\\n\\tputs(enc);\\n\\n\\treturn 0;\\n}\\n\",\n \"language\": \"C\"\n },\n {\n \"code\": \"#include <QByteArray>\\n#include <iostream>\\n\\nint main( ) {\\n QByteArray text ( \\\"http://foo bar/\\\" ) ;\\n QByteArray encoded( text.toPercentEncoding( ) ) ;\\n std::cout << encoded.data( ) << '\\\\n' ;\\n return 0 ;\\n}\\n\",\n \"language\": \"C++\"\n },\n {\n \"code\": \"using System;\\n\\nnamespace URLEncode\\n{\\n internal class Program\\n {\\n private static void Main(string[] args)\\n {\\n Console.WriteLine(Encode(\\\"http://foo bar/\\\"));\\n }\\n\\n private static string Encode(string uri)\\n {\\n return Uri.EscapeDataString(uri);\\n }\\n }\\n}\\n\",\n \"language\": \"C-sharp\"\n },\n {\n \"code\": \"(import 'java.net.URLEncoder)\\n(URLEncoder/encode \\\"http://foo bar/\\\" \\\"UTF-8\\\")\\n\",\n \"language\": \"Clojure\"\n },\n {\n \"code\": \"(defun needs-encoding-p (char)\\n (not (digit-char-p char 36)))\\n\\n(defun encode-char (char)\\n (format nil \\\"%~2,'0X\\\" (char-code char)))\\n\\n(defun url-encode (url)\\n (apply #'concatenate 'string\\n (map 'list (lambda (char)\\n (if (needs-encoding-p char)\\n (encode-char char)\\n (string char)))\\n url)))\\n\\n(url-encode \\\"http://foo bar/\\\")\\n\",\n \"language\": \"Common-Lisp\"\n },\n {\n \"code\": \"require \\\"uri\\\"\\n\\nputs URI.encode(\\\"http://foo bar/\\\")\\nputs URI.encode(\\\"http://foo bar/\\\", space_to_plus: true)\\nputs URI.encode_www_form(\\\"http://foo bar/\\\")\\nputs URI.encode_www_form(\\\"http://foo bar/\\\", space_to_plus: false)\\n\",\n \"language\": \"Crystal\"\n },\n {\n \"code\": \"import std.stdio, std.uri;\\n\\nvoid main() {\\n writeln(encodeComponent(\\\"http://foo bar/\\\"));\\n}\\n\",\n \"language\": \"D\"\n },\n {\n \"code\": \"function EncodeURL(URL: string): string;\\nvar I: integer;\\nbegin\\nResult:='';\\nfor I:=1 to Length(URL) do\\n if URL[I] in ['0'..'9', 'A'..'Z', 'a'..'z'] then Result:=Result+URL[I]\\n else Result:=Result+'%'+IntToHex(byte(URL[I]),2);\\nend;\\n\\nprocedure EncodeAndShowURL(Memo: TMemo; URL: string);\\nvar ES: string;\\nbegin\\nMemo.Lines.Add('Unencoded URL: '+URL);\\nES:=EncodeURL(URL);\\nMemo.Lines.Add('Encoded URL: '+ES);\\nMemo.Lines.Add('');\\nend;\\n\\nprocedure ShowEncodedURLs(Memo: TMemo);\\nbegin\\nEncodeAndShowURL(Memo,'http://foo bar/');\\nEncodeAndShowURL(Memo,'https://rosettacode.org/wiki/URL_encoding');\\nEncodeAndShowURL(Memo,'https://en.wikipedia.org/wiki/Pikes_Peak_granite');\\nend;\\n\",\n \"language\": \"Delphi\"\n },\n {\n \"code\": \"iex(1)> URI.encode(\\\"http://foo bar/\\\", &URI.char_unreserved?/1)\\n\\\"http%3A%2F%2Ffoo%20bar%2F\\\"\\n\",\n \"language\": \"Elixir\"\n },\n {\n \"code\": \"open System\\n\\n[<EntryPoint>]\\nlet main args =\\n printfn \\\"%s\\\" (Uri.EscapeDataString(args.[0]))\\n 0\\n\",\n \"language\": \"F-Sharp\"\n },\n {\n \"code\": \"USING: combinators.short-circuit unicode urls.encoding.private ;\\n\\n: my-url-encode ( str -- encoded )\\n [ { [ alpha? ] [ \\\"-._~\\\" member? ] } 1|| ] (url-encode) ;\\n\\n\\\"http://foo bar/\\\" my-url-encode print\\n\",\n \"language\": \"Factor\"\n },\n {\n \"code\": \"function urlEncode(data: string): AnsiString;\\nvar\\n ch: AnsiChar;\\nbegin\\n Result := '';\\n for ch in data do begin\\n if ((Ord(ch) < 65) or (Ord(ch) > 90)) and ((Ord(ch) < 97) or (Ord(ch) > 122)) then begin\\n Result := Result + '%' + IntToHex(Ord(ch), 2);\\n end else\\n Result := Result + ch;\\n end;\\nend;\\n\",\n \"language\": \"Free-Pascal-Lazarus\"\n },\n {\n \"code\": \"Dim Shared As String lookUp(256)\\nFor cadena As Integer = 0 To 256\\n lookUp(cadena) = \\\"%\\\" + Hex(cadena)\\nNext cadena\\n\\nFunction string2url(cadena As String) As String\\n Dim As String cadTemp, cadDevu\\n For j As Integer = 1 To Len(cadena)\\n cadTemp = Mid(cadena, j, 1)\\n If Instr( \\\"0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz\\\", cadTemp) Then\\n cadDevu &= cadTemp\\n Else\\n cadDevu &= lookUp(Asc(cadTemp))\\n End If\\n Next j\\n Return cadDevu\\nEnd Function\\n\\nDim As String URL = \\\"http://foo bar/\\\"\\n\\nPrint \\\"Supplied URL '\\\"; URL; \\\"'\\\"\\nPrint \\\"URL encoding '\\\"; string2url(URL); \\\"'\\\"\\nSleep\\n\",\n \"language\": \"FreeBASIC\"\n },\n {\n \"code\": \"println[URLEncode[\\\"http://foo bar/\\\"]]\\n\",\n \"language\": \"Frink\"\n },\n {\n \"code\": \"include \\\"NSLog.incl\\\"\\n\\nlocal fn PercentEncodeURLString( urlStr as CFStringRef ) as CFStringRef\\n CFStringRef encodedStr = fn StringByAddingPercentEncodingWithAllowedCharacters( urlStr, fn CharacterSetAlphanumericSet )\\nend fn = encodedStr\\n\\nNSLog( @\\\"%@\\\", fn PercentEncodeURLString( @\\\"http://foo bar/\\\" ) )\\nNSLog( @\\\"%@\\\", fn PercentEncodeURLString( @\\\"http://www.rosettacode.org/wiki/URL_encoding\\\" ) )\\n\\nHandleEvents\\n\",\n \"language\": \"FutureBasic\"\n },\n {\n \"code\": \"package main\\n\\nimport (\\n \\\"fmt\\\"\\n \\\"net/url\\\"\\n)\\n\\nfunc main() {\\n fmt.Println(url.QueryEscape(\\\"http://foo bar/\\\"))\\n}\\n\",\n \"language\": \"Go\"\n },\n {\n \"code\": \"def normal = \\\"http://foo bar/\\\"\\ndef encoded = URLEncoder.encode(normal, \\\"utf-8\\\")\\nprintln encoded\\n\",\n \"language\": \"Groovy\"\n },\n {\n \"code\": \"import qualified Data.Char as Char\\nimport Text.Printf\\n\\nencode :: Char -> String\\nencode c\\n | c == ' ' = \\\"+\\\"\\n | Char.isAlphaNum c || c `elem` \\\"-._~\\\" = [c]\\n | otherwise = printf \\\"%%%02X\\\" c\\n\\nurlEncode :: String -> String\\nurlEncode = concatMap encode\\n\\nmain :: IO ()\\nmain = putStrLn $ urlEncode \\\"http://foo bar/\\\"\\n\",\n \"language\": \"Haskell\"\n },\n {\n \"code\": \"link hexcvt\\n\\nprocedure main()\\nwrite(\\\"text = \\\",image(u := \\\"http://foo bar/\\\"))\\nwrite(\\\"encoded = \\\",image(ue := encodeURL(u)))\\nend\\n\\nprocedure encodeURL(s) #: encode data for inclusion in a URL/URI\\nstatic en\\ninitial { # build lookup table for everything\\n en := table()\\n every en[c := !string(~(&digits++&letters))] := \\\"%\\\"||hexstring(ord(c),2)\\n every /en[c := !string(&cset)] := c\\n }\\n\\nevery (c := \\\"\\\") ||:= en[!s] # re-encode everything\\nreturn c\\nend\\n\",\n \"language\": \"Icon\"\n },\n {\n \"code\": \"require'strings convert'\\nurlencode=: rplc&((#~2|_1 47 57 64 90 96 122 I.i.@#)a.;\\\"_1'%',.hfd i.#a.)\\n\",\n \"language\": \"J\"\n },\n {\n \"code\": \" urlencode 'http://foo bar/'\\nhttp%3A%2F%2Ffoo%20bar%2F\\n\",\n \"language\": \"J\"\n },\n {\n \"code\": \"import java.net.URLEncoder;\\nimport java.nio.charset.StandardCharsets;\\n\",\n \"language\": \"Java\"\n },\n {\n \"code\": \"URLEncoder.encode(\\\"http://foo bar/\\\", StandardCharsets.UTF_8)\\n\",\n \"language\": \"Java\"\n },\n {\n \"code\": \"String encode(String string) {\\n StringBuilder encoded = new StringBuilder();\\n for (char character : string.toCharArray()) {\\n switch (character) {\\n /* rfc3986 and html5 */\\n case '-', '.', '_', '~', '*' -> encoded.append(character);\\n case ' ' -> encoded.append('+');\\n default -> {\\n if (alphanumeric(character))\\n encoded.append(character);\\n else {\\n encoded.append(\\\"%\\\");\\n encoded.append(\\\"%02x\\\".formatted((int) character));\\n }\\n }\\n }\\n }\\n return encoded.toString();\\n}\\n\\nboolean alphanumeric(char character) {\\n return (character >= 'A' && character <= 'Z')\\n || (character >= 'a' && character <= 'z')\\n || (character >= '0' && character <= '9');\\n}\\n\",\n \"language\": \"Java\"\n },\n {\n \"code\": \"var normal = 'http://foo/bar/';\\nvar encoded = encodeURIComponent(normal);\\n\",\n \"language\": \"JavaScript\"\n },\n {\n \"code\": \"\\\"á\\\" | @uri\\n\",\n \"language\": \"Jq\"\n },\n {\n \"code\": \"def url_encode:\\n # The helper function checks whether the input corresponds to one of the characters: !'()*\\n def recode: . as $c | [33,39,40,41,42] | index($c);\\n def hex: if . < 10 then 48 + . else 55 + . end;\\n @uri\\n | explode\\n # 37 ==> \\\"%\\\", 50 ==> \\\"2\\\"\\n | map( if recode then (37, 50, ((. - 32) | hex)) else . end )\\n | implode;\\n\",\n \"language\": \"Jq\"\n },\n {\n \"code\": \"\\\"http://foo bar/\\\" | @uri\\n\",\n \"language\": \"Jq\"\n },\n {\n \"code\": \"\\\"http://foo bar/\\\" | @uri == url_encode\\n\",\n \"language\": \"Jq\"\n },\n {\n \"code\": \"[range(0;1024) | [.] | implode | if @uri == . then . else empty end] | join(null)\\n\",\n \"language\": \"Jq\"\n },\n {\n \"code\": \"[range(0;1024) | [.] | implode | if url_encode == . then . else empty end] | join(null)\\n\",\n \"language\": \"Jq\"\n },\n {\n \"code\": \"//version 1.0.1\\nimport HTTP.URIs: escapeuri\\n\\ndcd = \\\"http://foo bar/\\\"\\nenc = escapeuri(dcd)\\n\\nprintln(dcd, \\\" => \\\", enc)\\n\",\n \"language\": \"Julia\"\n },\n {\n \"code\": \"// version 1.1.2\\n\\nimport java.net.URLEncoder\\n\\nfun main(args: Array<String>) {\\n val url = \\\"http://foo bar/\\\"\\n println(URLEncoder.encode(url, \\\"utf-8\\\")) // note: encodes space to + not %20\\n}\\n\",\n \"language\": \"Kotlin\"\n },\n {\n \"code\": \"url_encode()\\n{\\n printf \\\"%(url)q\\\\n\\\" \\\"$*\\\"\\n}\\n\\n\\nurl_encode \\\"http://foo bar/\\\"\\nurl_encode \\\"https://ru.wikipedia.org/wiki/Транспайлер\\\"\\nurl_encode \\\"google.com/search?q=`Abdu'l-Bahá\\\"\\n\",\n \"language\": \"Ksh\"\n },\n {\n \"code\": \"val .urlEncode = fn(.s) replace(\\n .s, re/[^A-Za-z0-9]/,\\n fn(.s2) join \\\"\\\", map fn(.b) $\\\"%\\\\.b:X02;\\\", s2b .s2,\\n)\\n\\nwriteln .urlEncode(\\\"https://some website.com/\\\")\\n\",\n \"language\": \"Langur\"\n },\n {\n \"code\": \"bytes('http://foo bar/') -> encodeurl\\n\",\n \"language\": \"Lasso\"\n },\n {\n \"code\": \" dim lookUp$( 256)\\n\\n for i =0 to 256\\n lookUp$( i) =\\\"%\\\" +dechex$( i)\\n next i\\n\\n string$ =\\\"http://foo bar/\\\"\\n\\n print \\\"Supplied string '\\\"; string$; \\\"'\\\"\\n print \\\"As URL '\\\"; url$( string$); \\\"'\\\"\\n\\n end\\n\\nfunction url$( i$)\\n for j =1 to len( i$)\\n c$ =mid$( i$, j, 1)\\n if instr( \\\"0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz\\\", c$) then\\n url$ =url$ +c$\\n else\\n url$ =url$ +lookUp$( asc( c$))\\n end if\\n next j\\nend function\\n\",\n \"language\": \"Liberty-BASIC\"\n },\n {\n \"code\": \"put urlencode(\\\"http://foo bar/\\\")\\n-- \\\"http%3a%2f%2ffoo+bar%2f\\\"\\n\",\n \"language\": \"Lingo\"\n },\n {\n \"code\": \"urlEncode(\\\"http://foo bar/\\\")\\n-- http%3A%2F%2Ffoo+bar%2F\\n\",\n \"language\": \"LiveCode\"\n },\n {\n \"code\": \"function encodeChar(chr)\\n\\treturn string.format(\\\"%%%X\\\",string.byte(chr))\\nend\\n\\nfunction encodeString(str)\\n\\tlocal output, t = string.gsub(str,\\\"[^%w]\\\",encodeChar)\\n\\treturn output\\nend\\n\\n-- will print \\\"http%3A%2F%2Ffoo%20bar%2F\\\"\\nprint(encodeString(\\\"http://foo bar/\\\"))\\n\",\n \"language\": \"Lua\"\n },\n {\n \"code\": \"Module Checkit {\\n Function decodeUrl$(a$) {\\n DIM a$()\\n a$()=Piece$(a$, \\\"%\\\")\\n if len(a$())=1 then =str$(a$):exit\\n k=each(a$(),2)\\n acc$=str$(a$(0))\\n While k {\\n acc$+=str$(Chr$(Eval(\\\"0x\\\"+left$(a$(k^),2)))+Mid$(a$(k^),3))\\n }\\n =string$(acc$ as utf8dec)\\n }\\n Group Parse$ {\\n all$, c=1\\n tc$=\\\"\\\"\\n Enum UrlType {None=0, RFC3986, HTML5}\\n variation\\n TypeData=(\\\"\\\",\\\"-._~\\\",\\\"-._*\\\")\\n Function Next {\\n .tc$<=mid$(.all$,.c,1)\\n .c++\\n =.tc$<>\\\"\\\"\\n }\\n Value {\\n =.tc$\\n }\\n Function DecodeOne$ {\\n if .tc$=\\\"\\\" then exit\\n if .tc$ ~\\\"[A-Za-z0-9]\\\" then =.tc$ : exit\\n If .tc$=\\\" \\\" Then =if$(.variation=.HTML5->\\\"+\\\",\\\"%20\\\") :exit\\n if instr(.TypeData#val$(.variation),.tc$)>0 then =.tc$ :exit\\n =\\\"%\\\"+hex$(asc(.tc$), 1)\\n }\\n Function Decode$ {\\n acc$=\\\"\\\"\\n .c<=1\\n While .Next() {\\n acc$+=.DecodeOne$()\\n }\\n =acc$\\n }\\n Set () {\\n \\\\\\\\ using optional argument\\n var=.None\\n Read a$, ? var\\n a$=chr$(string$(a$ as utf8enc))\\n .variation<=var\\n .all$<=a$\\n .c<=1\\n }\\n }\\n \\\\\\\\ MAIN\\n Parse$()=\\\"http://foo bar/\\\"\\n Print Quote$(Parse.Decode$())\\n Parse.variation=Parse.HTML5\\n Print Quote$(Parse.Decode$())\\n Parse.variation=Parse.RFC3986\\n Print Quote$(Parse.Decode$())\\n Parse$(Parse.RFC3986) ={mailto:\\\"Irma User\\\" <irma.user@mail.com>}\\n Print Quote$(Parse.Decode$())\\n Parse$(Parse.RFC3986) ={http://foo.bar.com/~user-name/_subdir/*~.html}\\n m=each(Parse.UrlType)\\n while m {\\n Parse.variation=eval(m)\\n Print Quote$(Parse.Decode$())\\n Print decodeUrl$(Parse.Decode$())\\n }\\n}\\nCheckIt\\n\",\n \"language\": \"M2000-Interpreter\"\n },\n {\n \"code\": \"URL:-Escape(\\\"http://foo bar/\\\");\\n\",\n \"language\": \"Maple\"\n },\n {\n \"code\": \"URLEncoding[url_] :=\\n StringReplace[url,\\n x : Except[\\n Join[CharacterRange[\\\"0\\\", \\\"9\\\"], CharacterRange[\\\"a\\\", \\\"z\\\"],\\n CharacterRange[\\\"A\\\", \\\"Z\\\"]]] :>\\n StringJoin[(\\\"%\\\" ~~ #) & /@\\n IntegerString[ToCharacterCode[x, \\\"UTF8\\\"], 16]]]\\n\",\n \"language\": \"Mathematica\"\n },\n {\n \"code\": \"URLEncoding[\\\"http://foo bar/\\\"]\\n\",\n \"language\": \"Mathematica\"\n },\n {\n \"code\": \"function u = urlencoding(s)\\n\\tu = '';\\n\\tfor k = 1:length(s),\\n\\t\\tif isalnum(s(k))\\n\\t\\t\\tu(end+1) = s(k);\\n\\t\\telse\\n\\t\\t\\tu=[u,'%',dec2hex(s(k)+0)];\\n\\t\\tend; \\t\\n\\tend\\nend\\n\",\n \"language\": \"MATLAB\"\n },\n {\n \"code\": \"/* NetRexx */\\noptions replace format comments java crossref symbols nobinary\\n\\n/* -------------------------------------------------------------------------- */\\n testcase()\\n say\\n say 'RFC3986'\\n testcase('RFC3986')\\n say\\n say 'HTML5'\\n testcase('HTML5')\\n say\\n return\\n\\n/* -------------------------------------------------------------------------- */\\nmethod encode(url, varn) public static\\n\\n variation = varn.upper\\n opts = ''\\n opts['RFC3986'] = '-._~'\\n opts['HTML5'] = '-._*'\\n\\n rp = ''\\n loop while url.length > 0\\n parse url tc +1 url\\n select\\n when tc.datatype('A') then do\\n rp = rp || tc\\n end\\n when tc == ' ' then do\\n if variation = 'HTML5' then\\n rp = rp || '+'\\n else\\n rp = rp || '%' || tc.c2x\\n end\\n otherwise do\\n if opts[variation].pos(tc) > 0 then do\\n rp = rp || tc\\n end\\n else do\\n rp = rp || '%' || tc.c2x\\n end\\n end\\n end\\n end\\n\\n return rp\\n\\n/* -------------------------------------------------------------------------- */\\nmethod testcase(variation = '') public static\\n\\n url = [ -\\n 'http://foo bar/' -\\n , 'mailto:\\\"Ivan Aim\\\" <ivan.aim@email.com>' -\\n , 'mailto:\\\"Irma User\\\" <irma.user@mail.com>' -\\n , 'http://foo.bar.com/~user-name/_subdir/*~.html' -\\n ]\\n\\n loop i_ = 0 to url.length - 1\\n say url[i_]\\n say encode(url[i_], variation)\\n end i_\\n\\n return\\n\",\n \"language\": \"NetRexx\"\n },\n {\n \"code\": \";; simple encoder\\n;; (source http://www.newlisp.org/index.cgi?page=Code_Snippets)\\n(define (url-encode str)\\n (replace {([^a-zA-Z0-9])} str (format \\\"%%%2X\\\" (char $1)) 0))\\n\\n(url-encode \\\"http://foo bar/\\\")\\n\",\n \"language\": \"NewLISP\"\n },\n {\n \"code\": \"import cgi\\n\\necho encodeUrl(\\\"http://foo/bar/\\\")\\n\",\n \"language\": \"Nim\"\n },\n {\n \"code\": \"MODULE URLEncoding;\\nIMPORT\\n Out := NPCT:Console,\\n ADT:StringBuffer,\\n URI := URI:String;\\nVAR\\n encodedUrl: StringBuffer.StringBuffer;\\nBEGIN\\n encodedUrl := NEW(StringBuffer.StringBuffer,512);\\n URI.AppendEscaped(\\\"http://foo bar/\\\",\\\"\\\",encodedUrl);\\n Out.String(encodedUrl.ToString());Out.Ln\\nEND URLEncoding.\\n\",\n \"language\": \"Oberon\"\n },\n {\n \"code\": \"use FastCgi;\\n\\nbundle Default {\\n class UrlEncode {\\n function : Main(args : String[]) ~ Nil {\\n url := \\\"http://foo bar/\\\";\\n UrlUtility->Encode(url)->PrintLine();\\n }\\n }\\n}\\n\",\n \"language\": \"Objeck\"\n },\n {\n \"code\": \"NSString *normal = @\\\"http://foo bar/\\\";\\nNSString *encoded = [normal stringByAddingPercentEscapesUsingEncoding:NSUTF8StringEncoding];\\nNSLog(@\\\"%@\\\", encoded);\\n\",\n \"language\": \"Objective-C\"\n },\n {\n \"code\": \"NSString *normal = @\\\"http://foo bar/\\\";\\nNSString *encoded = [normal stringByAddingPercentEncodingWithAllowedCharacters:[NSCharacterSet alphanumericCharacterSet]];\\nNSLog(@\\\"%@\\\", encoded);\\n\",\n \"language\": \"Objective-C\"\n },\n {\n \"code\": \"$ ocaml\\n# #use \\\"topfind\\\";;\\n# #require \\\"netstring\\\";;\\n\\n# Netencoding.Url.encode \\\"http://foo bar/\\\" ;;\\n- : string = \\\"http%3A%2F%2Ffoo+bar%2F\\\"\\n\",\n \"language\": \"OCaml\"\n },\n {\n \"code\": \"sub urlencode {\\n my $s = shift;\\n $s =~ s/([^-A-Za-z0-9_.!~*'() ])/sprintf(\\\"%%%02X\\\", ord($1))/eg;\\n $s =~ tr/ /+/;\\n return $s;\\n}\\n\\nprint urlencode('http://foo bar/').\\\"\\\\n\\\";\\n\",\n \"language\": \"Perl\"\n },\n {\n \"code\": \"use URI::Escape;\\n\\nmy $s = 'http://foo/bar/';\\nprint uri_escape($s);\\n\",\n \"language\": \"Perl\"\n },\n {\n \"code\": \"use 5.10.0;\\nuse CGI;\\n\\nmy $s = 'http://foo/bar/';\\nsay $s = CGI::escape($s);\\nsay $s = CGI::unescape($s);\\n\",\n \"language\": \"Perl\"\n },\n {\n \"code\": \"(phixonline)-->\\n <span style=\\\"color: #000080;font-style:italic;\\\">--\\n -- demo\\\\rosetta\\\\encode_url.exw\\n -- ===========================\\n --</span>\\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;\\\">nib</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #004080;\\\">integer</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: #008080;\\\">iff</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">b</span><span style=\\\"color: #0000FF;\\\"><=</span><span style=\\\"color: #000000;\\\">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>\\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;\\\">encode_url</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;\\\">string</span> <span style=\\\"color: #000000;\\\">exclusions</span><span style=\\\"color: #0000FF;\\\">=</span><span style=\\\"color: #008000;\\\">\\\"\\\"</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #004080;\\\">integer</span> <span style=\\\"color: #000000;\\\">spaceplus</span><span style=\\\"color: #0000FF;\\\">=</span><span style=\\\"color: #000000;\\\">0</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: #008000;\\\">\\\"\\\"</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;\\\">integer</span> <span style=\\\"color: #000000;\\\">ch</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;\\\">' '</span> <span style=\\\"color: #008080;\\\">and</span> <span style=\\\"color: #000000;\\\">spaceplus</span> <span style=\\\"color: #008080;\\\">then</span>\\n <span style=\\\"color: #000000;\\\">ch</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #008000;\\\">'+'</span>\\n <span style=\\\"color: #008080;\\\">elsif</span> <span style=\\\"color: #008080;\\\">not</span> <span style=\\\"color: #7060A8;\\\">find</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">ch</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">exclusions</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #008080;\\\">and</span> <span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">ch</span><span style=\\\"color: #0000FF;\\\"><</span><span style=\\\"color: #008000;\\\">'0'</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: #008000;\\\">'9'</span> <span style=\\\"color: #008080;\\\">and</span> <span style=\\\"color: #000000;\\\">ch</span><span style=\\\"color: #0000FF;\\\"><</span><span style=\\\"color: #008000;\\\">'A'</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: #008000;\\\">'Z'</span> <span style=\\\"color: #008080;\\\">and</span> <span style=\\\"color: #000000;\\\">ch</span><span style=\\\"color: #0000FF;\\\"><</span><span style=\\\"color: #008000;\\\">'a'</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #008080;\\\">or</span> <span style=\\\"color: #000000;\\\">ch</span><span style=\\\"color: #0000FF;\\\">></span><span style=\\\"color: #008000;\\\">'z'</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: #008000;\\\">'%'</span>\\n <span style=\\\"color: #000000;\\\">res</span> <span style=\\\"color: #0000FF;\\\">&=</span> <span style=\\\"color: #000000;\\\">nib</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #7060A8;\\\">floor</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">ch</span><span style=\\\"color: #0000FF;\\\">/</span><span style=\\\"color: #000000;\\\">#10</span><span style=\\\"color: #0000FF;\\\">))</span>\\n <span style=\\\"color: #000000;\\\">ch</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">nib</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #7060A8;\\\">and_bits</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">ch</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">#0F</span><span style=\\\"color: #0000FF;\\\">))</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;\\\">ch</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: #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;\\\">encode_url</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #008000;\\\">\\\"http://foo bar/\\\"</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\": \"<?php\\n$s = 'http://foo/bar/';\\n$s = rawurlencode($s);\\n?>\\n\",\n \"language\": \"PHP\"\n },\n {\n \"code\": \"(de urlEncodeTooMuch (Str)\\n (pack\\n (mapcar\\n '((C)\\n (if (or (>= \\\"9\\\" C \\\"0\\\") (>= \\\"Z\\\" (uppc C) \\\"A\\\"))\\n C\\n (list '% (hex (char C))) ) )\\n (chop Str) ) ) )\\n\",\n \"language\": \"PicoLisp\"\n },\n {\n \"code\": \"Protocols.HTTP.uri_encode( \\\"http://foo bar/\\\" );\\n\",\n \"language\": \"Pike\"\n },\n {\n \"code\": \"[uri]::EscapeDataString('http://foo bar/')\\n\\nhttp%3A%2F%2Ffoo%20bar%2F\\n\",\n \"language\": \"PowerShell\"\n },\n {\n \"code\": \"URL$ = URLEncoder(\\\"http://foo bar/\\\")\\n\",\n \"language\": \"PureBasic\"\n },\n {\n \"code\": \"import urllib\\ns = 'http://foo/bar/'\\ns = urllib.quote(s)\\n\",\n \"language\": \"Python\"\n },\n {\n \"code\": \"URLencode(\\\"http://foo bar/\\\")\\n\",\n \"language\": \"R\"\n },\n {\n \"code\": \"library(RCurl)\\ncurlEscape(\\\"http://foo bar/\\\")\\n\",\n \"language\": \"R\"\n },\n {\n \"code\": \"#lang racket\\n(require net/uri-codec)\\n(uri-encode \\\"http://foo bar/\\\")\\n\",\n \"language\": \"Racket\"\n },\n {\n \"code\": \"my $url = 'http://foo bar/';\\n\\nsay $url.subst(/<-alnum>/, *.ord.fmt(\\\"%%%02X\\\"), :g);\\n\",\n \"language\": \"Raku\"\n },\n {\n \"code\": \" Dim URL As String = \\\"http://foo bar/\\\"\\n URL = EncodeURLComponent(URL)\\n Print(URL)\\n\",\n \"language\": \"REALbasic\"\n },\n {\n \"code\": \"Function URLEncode(Data As String, ParamArray Exceptions() As String) As String\\n Dim buf As String\\n For i As Integer = 1 To Data.Len\\n Dim char As String = Data.Mid(i, 1)\\n Select Case Asc(char)\\n Case 48 To 57, 65 To 90, 97 To 122, 45, 46, 95\\n buf = buf + char\\n Else\\n If Exceptions.IndexOf(char) > -1 Then\\n buf = buf + char\\n Else\\n buf = buf + \\\"%\\\" + Left(Hex(Asc(char)) + \\\"00\\\", 2)\\n End If\\n End Select\\n Next\\n Return buf\\nEnd Function\\n\\n 'usage\\n Dim s As String = URLEncode(\\\"http://foo bar/\\\") ' no exceptions\\n Dim t As String = URLEncode(\\\"http://foo bar/\\\", \\\"!\\\", \\\"?\\\", \\\",\\\") ' with exceptions\\n\",\n \"language\": \"REALbasic\"\n },\n {\n \"code\": \"/* Rexx */\\ndo\\n call testcase\\n say\\n say RFC3986\\n call testcase RFC3986\\n say\\n say HTML5\\n call testcase HTML5\\n say\\n return\\nend\\nexit\\n\\n/* -------------------------------------------------------------------------- */\\nencode:\\nprocedure\\ndo\\n parse arg url, varn .\\n parse upper var varn variation\\n drop RFC3986 HTML5\\n opts. = ''\\n opts.RFC3986 = '-._~'\\n opts.HTML5 = '-._*'\\n\\n rp = ''\\n do while length(url) > 0\\n parse var url tc +1 url\\n select\\n when datatype(tc, 'A') then do\\n rp = rp || tc\\n end\\n when tc == ' ' then do\\n if variation = HTML5 then\\n rp = rp || '+'\\n else\\n rp = rp || '%' || c2x(tc)\\n end\\n otherwise do\\n if pos(tc, opts.variation) > 0 then do\\n rp = rp || tc\\n end\\n else do\\n rp = rp || '%' || c2x(tc)\\n end\\n end\\n end\\n end\\n\\n return rp\\nend\\nexit\\n\\n/* -------------------------------------------------------------------------- */\\ntestcase:\\nprocedure\\ndo\\n parse arg variation\\n X = 0\\n url. = ''\\n X = X + 1; url.0 = X; url.X = 'http://foo bar/'\\n X = X + 1; url.0 = X; url.X = 'mailto:\\\"Ivan Aim\\\" <ivan.aim@email.com>'\\n X = X + 1; url.0 = X; url.X = 'mailto:\\\"Irma User\\\" <irma.user@mail.com>'\\n X = X + 1; url.0 = X; url.X = 'http://foo.bar.com/~user-name/_subdir/*~.html'\\n\\n do i_ = 1 to url.0\\n say url.i_\\n say encode(url.i_, variation)\\n end i_\\n\\n return\\nend\\n\",\n \"language\": \"REXX\"\n },\n {\n \"code\": \"/*REXX program encodes a URL text, blanks ──► +, preserves -._* and -._~ */\\nurl.=; url.1= 'http://foo bar/'\\n url.2= 'mailto:\\\"Ivan Aim\\\" <ivan.aim@email.com>'\\n url.3= 'mailto:\\\"Irma User\\\" <irma.user@mail.com>'\\n url.4= 'http://foo.bar.com/~user-name/_subdir/*~.html'\\n do j=1 while url.j\\\\==''; say\\n say ' original: ' url.j\\n say ' encoded: ' URLencode(url.j)\\n end /*j*/\\nexit /*stick a fork in it, we're all done. */\\n/*──────────────────────────────────────────────────────────────────────────────────────*/\\nURLencode: procedure; parse arg $,,z; t1= '-._~' /*get args, null Z.*/\\n skip=0; t2= '-._*'\\n do k=1 for length($); _=substr($, k, 1) /*get a character. */\\n if skip\\\\==0 then do; skip=skip-1 /*skip t1 or t2 ? */\\n iterate /*skip a character.*/\\n end\\n select\\n when datatype(_, 'A') then z=z || _ /*is alphanumeric ?*/\\n when _==' ' then z=z'+' /*is it a blank ?*/\\n when substr($, k, 4)==t1 |, /*is it t1 or t2 ?*/\\n substr($, k, 4)==t2 then do; skip=3 /*skip 3 characters*/\\n z=z || substr($, k, 4)\\n end\\n otherwise z=z'%'c2x(_) /*special character*/\\n end /*select*/\\n end /*k*/\\n return z\\n\",\n \"language\": \"REXX\"\n },\n {\n \"code\": \"require 'cgi'\\nputs CGI.escape(\\\"http://foo bar/\\\").gsub(\\\"+\\\", \\\"%20\\\")\\n# => \\\"http%3A%2F%2Ffoo%20bar%2F\\\"\\n\",\n \"language\": \"Ruby\"\n },\n {\n \"code\": \"require 'uri'\\nputs URI.encode_www_form_component(\\\"http://foo bar/\\\").gsub(\\\"+\\\", \\\"%20\\\")\\n# => \\\"http%3A%2F%2Ffoo%20bar%2F\\\"\\n\",\n \"language\": \"Ruby\"\n },\n {\n \"code\": \"urlIn$ = \\\"http://foo bar/\\\"\\n\\nfor i = 1 to len(urlIn$)\\n a$ = mid$(urlIn$,i,1)\\n if (a$ >= \\\"0\\\" and a$ <= \\\"9\\\") _\\n or (a$ >= \\\"A\\\" and a$ <= \\\"Z\\\") _\\n or (a$ >= \\\"a\\\" and a$ <= \\\"z\\\") then url$ = url$ + a$ else url$ = url$ + \\\"%\\\"+dechex$(asc(a$))\\nnext i\\nprint urlIn$;\\\" -> \\\";url$\\n\",\n \"language\": \"Run-BASIC\"\n },\n {\n \"code\": \"const INPUT: &str = \\\"http://foo bar/\\\";\\nconst MAX_CHAR_VAL: u32 = std::char::MAX as u32;\\n\\nfn main() {\\n let mut buff = [0; 4];\\n println!(\\\"{}\\\", INPUT.chars()\\n .map(|ch| {\\n match ch as u32 {\\n 0 ..= 47 | 58 ..= 64 | 91 ..= 96 | 123 ..= MAX_CHAR_VAL => {\\n ch.encode_utf8(&mut buff);\\n buff[0..ch.len_utf8()].iter().map(|&byte| format!(\\\"%{:X}\\\", byte)).collect::<String>()\\n },\\n _ => ch.to_string(),\\n }\\n })\\n .collect::<String>()\\n );\\n}\\n\",\n \"language\": \"Rust\"\n },\n {\n \"code\": \"import java.net.{URLDecoder, URLEncoder}\\nimport scala.compat.Platform.currentTime\\n\\nobject UrlCoded extends App {\\n val original = \\\"\\\"\\\"http://foo bar/\\\"\\\"\\\"\\n val encoded: String = URLEncoder.encode(original, \\\"UTF-8\\\")\\n\\n assert(encoded == \\\"http%3A%2F%2Ffoo+bar%2F\\\", s\\\"Original: $original not properly encoded: $encoded\\\")\\n\\n val percentEncoding = encoded.replace(\\\"+\\\", \\\"%20\\\")\\n assert(percentEncoding == \\\"http%3A%2F%2Ffoo%20bar%2F\\\", s\\\"Original: $original not properly percent-encoded: $percentEncoding\\\")\\n\\n assert(URLDecoder.decode(encoded, \\\"UTF-8\\\") == URLDecoder.decode(percentEncoding, \\\"UTF-8\\\"))\\n\\n println(s\\\"Successfully completed without errors. [total ${currentTime - executionStart} ms]\\\")\\n}\\n\",\n \"language\": \"Scala\"\n },\n {\n \"code\": \"$ include \\\"seed7_05.s7i\\\";\\n include \\\"encoding.s7i\\\";\\n\\nconst proc: main is func\\n begin\\n writeln(toPercentEncoded(\\\"http://foo bar/\\\"));\\n writeln(toUrlEncoded(\\\"http://foo bar/\\\"));\\n end func;\\n\",\n \"language\": \"Seed7\"\n },\n {\n \"code\": \"func urlencode(str) {\\n str.gsub!(%r\\\"([^-A-Za-z0-9_.!~*'() ])\\\", {|a| \\\"%%%02X\\\" % a.ord});\\n str.gsub!(' ', '+');\\n return str;\\n}\\n\\nsay urlencode('http://foo bar/');\\n\",\n \"language\": \"Sidef\"\n },\n {\n \"code\": \"# Encode all except \\\"unreserved\\\" characters; use UTF-8 for extended chars.\\n# See http://tools.ietf.org/html/rfc3986 §2.4 and §2.5\\nproc urlEncode {str} {\\n set uStr [encoding convertto utf-8 $str]\\n set chRE {[^-A-Za-z0-9._~\\\\n]};\\t\\t# Newline is special case!\\n set replacement {%[format \\\"%02X\\\" [scan \\\"\\\\\\\\\\\\0\\\" \\\"%c\\\"]]}\\n return [string map {\\\"\\\\n\\\" \\\"%0A\\\"} [subst [regsub -all $chRE $uStr $replacement]]]\\n}\\n\",\n \"language\": \"Tcl\"\n },\n {\n \"code\": \"puts [urlEncode \\\"http://foo bar/\\\"]\\n\",\n \"language\": \"Tcl\"\n },\n {\n \"code\": \"$$ MODE TUSCRIPT\\ntext=\\\"http://foo bar/\\\"\\nBUILD S_TABLE spez_char=\\\"::>/:</::<%:\\\"\\nspez_char=STRINGS (text,spez_char)\\nLOOP/CLEAR c=spez_char\\nc=ENCODE(c,hex),c=concat(\\\"%\\\",c),spez_char=APPEND(spez_char,c)\\nENDLOOP\\nurl_encoded=SUBSTITUTE(text,spez_char,0,0,spez_char)\\nprint \\\"text: \\\", text\\nPRINT \\\"encoded: \\\", url_encoded\\n\",\n \"language\": \"TUSCRIPT\"\n },\n {\n \"code\": \"function urlencode\\n{\\n\\ttypeset decoded=$1 encoded= rest= c=\\n\\ttypeset rest2= bug='rest2=${rest}'\\n\\n\\tif [[ -z ${BASH_VERSION} ]]; then\\n\\t\\t# bug /usr/bin/sh HP-UX 11.00\\n\\t\\ttypeset _decoded='xyz%26xyz'\\n\\t\\trest=\\\"${_decoded#?}\\\"\\n\\t\\tc=\\\"${_decoded%%${rest}}\\\"\\n\\t\\tif (( ${#c} != 1 )); then\\n\\t\\t\\ttypeset qm='????????????????????????????????????????????????????????????????????????'\\n\\t\\t\\ttypeset bug='(( ${#rest} > 0 )) && typeset -L${#rest} rest2=\\\"${qm}\\\" || rest2=${rest}'\\n\\t\\tfi\\n\\tfi\\n\\n\\trest=\\\"${decoded#?}\\\"\\n\\teval ${bug}\\n\\tc=\\\"${decoded%%${rest2}}\\\"\\n\\tdecoded=\\\"${rest}\\\"\\n\\n\\twhile [[ -n ${c} ]]; do\\n\\t\\tcase ${c} in\\n\\t\\t[-a-zA-z0-9.])\\n\\t\\t\\t;;\\n\\t\\t' ')\\n\\t\\t\\tc='+'\\n\\t\\t\\t;;\\n\\t\\t*)\\n\\t\\t\\tc=$(printf \\\"%%%02X\\\" \\\"'$c\\\")\\n\\t\\t\\t;;\\n\\t\\tesac\\n\\n\\t\\tencoded=\\\"${encoded}${c}\\\"\\n\\n\\t\\trest=\\\"${decoded#?}\\\"\\n\\t\\teval ${bug}\\n\\t\\tc=\\\"${decoded%%${rest2}}\\\"\\n\\t\\tdecoded=\\\"${rest}\\\"\\n\\tdone\\n\\n\\tif [[ -n ${BASH_VERSION:-} ]]; then\\n\\t\\t\\\\echo -E \\\"${encoded}\\\"\\n\\telse\\n\\t\\tprint -r -- \\\"${encoded}\\\"\\n\\tfi\\n}\\n\",\n \"language\": \"UNIX-Shell\"\n },\n {\n \"code\": \"import net.urllib\\nfn main() {\\n\\tprintln(urllib.query_escape(\\\"http://foo bar/\\\"))\\n}\\n\",\n \"language\": \"V-(Vlang)\"\n },\n {\n \"code\": \"Function UrlEncode(url)\\n\\tFor i = 1 To Len(url)\\n\\t\\tn = Asc(Mid(url,i,1))\\n\\t\\tIf (n >= 48 And n <= 57) Or (n >= 65 And n <= 90) _\\n\\t\\t\\tOr (n >= 97 And n <= 122) Then\\n\\t\\t\\tUrlEncode = UrlEncode & Mid(url,i,1)\\n\\t\\tElse\\n\\t\\t\\tChrHex = Hex(Asc(Mid(url,i,1)))\\n For j = 0 to (Len(ChrHex) / 2) - 1\\n\\t\\t\\t UrlEncode = UrlEncode & \\\"%\\\" & Mid(ChrHex,(2*j) + 1,2)\\n Next\\n\\t\\tEnd If\\n\\tNext\\nEnd Function\\n\\nWScript.Echo UrlEncode(\\\"http://foo baré/\\\")\\n\",\n \"language\": \"VBScript\"\n },\n {\n \"code\": \"import \\\"./fmt\\\" for Fmt\\n\\nvar urlEncode = Fn.new { |url|\\n var res = \\\"\\\"\\n for (b in url.bytes) {\\n if ((b >= 48 && b <= 57) || (b >= 65 && b <= 90) || (b >= 97 && b <= 122)) {\\n res = res + String.fromByte(b)\\n } else {\\n res = res + Fmt.swrite(\\\"\\\\%$2X\\\", b)\\n }\\n }\\n return res\\n}\\n\\nvar urls = [\\n \\\"http://foo bar/\\\",\\n \\\"mailto:\\\\\\\"Ivan Aim\\\\\\\" <ivan.aim@email.com>\\\",\\n \\\"mailto:\\\\\\\"Irma User\\\\\\\" <irma.user@mail.com>\\\",\\n \\\"http://foo.bar.com/~user-name/_subdir/*~.html\\\"\\n]\\nfor (url in urls) System.print(urlEncode.call(url))\\n\",\n \"language\": \"Wren\"\n },\n {\n \"code\": \"code Text=12;\\nstring 0; \\\\use zero-terminated strings\\n\\nfunc Encode(S0); \\\\Encode URL string and return its address\\nchar S0;\\nchar HD, S1(80); \\\\BEWARE: very temporary string space returned\\nint C, I, J;\\n[HD:= \\\"0123456789ABCDEF\\\"; \\\\hex digits\\nI:= 0; J:= 0;\\nrepeat C:= S0(I); I:= I+1;\\n if C>=^0 & C<=^9 ! C>=^A & C<=^Z ! C>=^a & C<=^z ! C=0\\n then [S1(J):= C; J:= J+1] \\\\simply pass char to S1\\n else [S1(J):= ^%; J:= J+1; \\\\encode char into S1\\n S1(J):= HD(C>>4); J:= J+1;\\n S1(J):= HD(C&$0F); J:= J+1;\\n ];\\nuntil C=0;\\nreturn S1;\\n];\\n\\nText(0, Encode(\\\"http://foo bar/\\\"))\\n\",\n \"language\": \"XPL0\"\n },\n {\n \"code\": \"sub encode_url$(s$, exclusions$, spaceplus)\\n local res$, i, ch$\\n\\t\\n for i=1 to len(s$)\\n ch$ = mid$(s$, i, 1)\\n if ch$ = \\\" \\\" and spaceplus then\\n ch$ = \\\"+\\\"\\n elsif not instr(esclusions$, ch$) and (ch$ < \\\"0\\\" or (ch$ > \\\"9\\\" and ch$ < \\\"A\\\") or (ch$ > \\\"Z\\\" and ch$ < \\\"a\\\") or ch$ > \\\"z\\\") then\\n res$ = res$ + \\\"%\\\"\\n ch$ = upper$(hex$(asc(ch$)))\\n end if\\n res$ = res$ + ch$\\n next i\\n return res$\\nend sub\\n\\nprint encode_url$(\\\"http://foo bar/\\\")\\n\",\n \"language\": \"Yabasic\"\n },\n {\n \"code\": \"var CURL=Import(\\\"zklCurl\\\");\\nCURL.urlEncode(\\\"http://foo bar/\\\") //--> \\\"http%3A%2F%2Ffoo%20bar%2F\\\"\\n\",\n \"language\": \"Zkl\"\n }\n]","isConversational":false},"task_name":{"kind":"string","value":"URL-encoding"}}},{"rowIdx":1790,"cells":{"solutions":{"kind":"list like","value":[{"code":"---\nfrom: http://rosettacode.org/wiki/Use_another_language_to_call_a_function\nnote: Programming environment operations\n","language":"00-META"},{"code":"This task is inverse to the task [[Call foreign language function]]. Consider the following [[C]] program:\n<syntaxhighlight lang=\"c\">#include <stdio.h>\n\nextern int Query (char * Data, size_t * Length);\n\nint main (int argc, char * argv [])\n{\n char Buffer [1024];\n size_t Size = sizeof (Buffer);\n \n if (0 == Query (Buffer, &Size))\n {\n printf (\"failed to call Query\\n\");\n }\n else\n {\n char * Ptr = Buffer;\n while (Size-- > 0) putchar (*Ptr++);\n putchar ('\\n');\n }\n}</syntaxhighlight>\n\nImplement the missing <code>Query</code> function in your language, and let this C program call it. The function should place the string ''<tt style=\"margin:0 0.5em\">Here am I</tt>'' into the buffer which is passed to it as the parameter <code>Data</code>. The buffer size in bytes is passed as the parameter <code>Length</code>. When there is no room in the buffer, <code>Query</code> shall return 0. Otherwise it overwrites the beginning of <code>Buffer</code>, sets the number of overwritten bytes into <code>Length</code> and returns 1.\n\n","language":"00-TASK"},{"code":"with Interfaces.C; use Interfaces.C;\nwith Interfaces.C.Strings; use Interfaces.C.Strings;\n\npackage Exported is\n function Query (Data : chars_ptr; Size : access size_t)\n return int;\n pragma Export (C, Query, \"Query\");\nend Exported;\n","language":"Ada"},{"code":"package body Exported is\n function Query (Data : chars_ptr; Size : access size_t)\n return int is\n Result : char_array := \"Here am I\";\n begin\n if Size.all < Result'Length then\n return 0;\n else\n Update (Data, 0, Result);\n Size.all := Result'Length;\n return 1;\n end if;\n end Query;\nend Exported;\n","language":"Ada"},{"code":"gcc -c main.c\ngnatmake -c exported.adb\ngnatbind -n exported.ali\ngnatlink exported.ali main.o -o main\n","language":"Ada"},{"code":"; Example: The following is a working script that displays a summary of all top-level windows.\n\n; For performance and memory conservation, call RegisterCallback() only once for a given callback:\nif not EnumAddress ; Fast-mode is okay because it will be called only from this thread:\n EnumAddress := RegisterCallback(\"EnumWindowsProc\", \"Fast\")\n\nDetectHiddenWindows On ; Due to fast-mode, this setting will go into effect for the callback too.\n\n; Pass control to EnumWindows(), which calls the callback repeatedly:\nDllCall(\"EnumWindows\", UInt, EnumAddress, UInt, 0)\nMsgBox %Output% ; Display the information accumulated by the callback.\n\nEnumWindowsProc(hwnd, lParam)\n{\n global Output\n WinGetTitle, title, ahk_id %hwnd%\n WinGetClass, class, ahk_id %hwnd%\n if title\n Output .= \"HWND: \" . hwnd . \"`tTitle: \" . title . \"`tClass: \" . class . \"`n\"\n return true ; Tell EnumWindows() to continue until all windows have been enumerated.\n}\n","language":"AutoHotkey"},{"code":"#if 0\nI rewrote the driver according to good sense, my style,\nand discussion.\n\nThis is file main.c on Autumn 2011 ubuntu linux release.\nThe emacs compile command output:\n\n-*- mode: compilation; default-directory: \"/tmp/\" -*-\nCompilation started at Mon Mar 12 20:25:27\n\nmake -k CFLAGS=-Wall main.o\ncc -Wall -c -o main.o main.c\n\nCompilation finished at Mon Mar 12 20:25:27\n#endif\n\n#include <stdio.h>\n#include <stdlib.h>\n\nextern int Query(char *Data, unsigned *Length);\n\nint main(int argc, char *argv[]) {\n char Buffer[1024], *pc;\n unsigned Size = sizeof(Buffer);\n if (!Query(Buffer, &Size))\n fputs(\"failed to call Query\", stdout);\n else\n for (pc = Buffer; Size--; ++pc)\n putchar(*pc);\n putchar('\\n');\n return EXIT_SUCCESS;\n}\n","language":"C"},{"code":"#if 0\nThis is file query.c\n\n-*- mode: compilation; default-directory: \"/tmp/\" -*-\nCompilation started at Mon Mar 12 20:36:25\n\nmake -k CFLAGS=-Wall query.o\ncc -Wall -c -o query.o query.c\n\nCompilation finished at Mon Mar 12 20:36:26\n#endif\n\n#include<string.h>\n\nint Query(char *Data, unsigned *Length) {\n const char *message = \"Here am I\";\n unsigned n = strlen(message);\n if (n <= *Length)\n return strncpy(Data, message, (size_t)n), *Length = n, 1;\n return 0;\n}\n","language":"C"},{"code":"$ gcc main.c query.o -o main && ./main\nHere am I\n$\n","language":"C"},{"code":"#include <string>\nusing std::string;\n\n// C++ functions with extern \"C\" can get called from C.\nextern \"C\" int\nQuery (char *Data, size_t *Length)\n{\n const string Message = \"Here am I\";\n\n // Check that Message fits in Data.\n if (*Length < Message.length())\n return false; // C++ converts bool to int.\n\n *Length = Message.length();\n Message.copy(Data, *Length);\n return true;\n}\n","language":"C++"},{"code":"$ gcc -c main.c\n$ g++ -c query.cpp\n$ g++ -o main main.o query.o\n$ ./main\nHere am I\n","language":"C++"},{"code":" identification division.\n program-id. Query.\n\n environment division.\n configuration section.\n special-names.\n call-convention 0 is extern.\n\n repository.\n function all intrinsic.\n\n data division.\n working-storage section.\n 01 query-result.\n 05 filler value \"Here I am\".\n\n linkage section.\n 01 data-reference.\n 05 data-buffer pic x occurs 0 to 8192 times\n depending on length-reference.\n 01 length-reference usage binary-long.\n\n procedure division extern using data-reference length-reference.\n\n if length(query-result) less than or equal to length-reference\n and length-reference less than 8193 then\n move query-result to data-reference\n move length(query-result) to length-reference\n move 1 to return-code\n end-if\n\n goback.\n end program Query.\n","language":"COBOL"},{"code":"import core.stdc.string;\n\nextern(C) bool query(char *data, size_t *length) pure nothrow {\n immutable text = \"Here am I\";\n\n if (*length < text.length) {\n *length = 0; // Also clears length.\n return false;\n } else {\n memcpy(data, text.ptr, text.length);\n *length = text.length;\n return true;\n }\n}\n","language":"D"},{"code":"#include <stdio.h>\n#include <stdbool.h>\n\nextern bool query(char *data, size_t *length);\n\nint main() {\n char buffer[1024];\n size_t size = sizeof(buffer);\n\n if (query(buffer, &size))\n printf(\"%.*s\\n\", size, buffer);\n else\n puts(\"The call to query has failed.\");\n\n return 0;\n}\n","language":"D"},{"code":"function Query(Buffer: PChar; var Size: Int64): LongBool;\nconst\n Text = 'Hello World!';\nbegin\n If not Assigned(Buffer) Then\n begin\n Size := 0;\n Result := False;\n Exit;\n end;\n If Size < Length(Text) Then\n begin\n Size := 0;\n Result := False;\n Exit;\n end;\n\n Size := Length(Text);\n Move(Text[1], Buffer^, Size);\n Result := True;\nend;\n","language":"Delphi"},{"code":"!-----------------------------------------------------------------------\n!Function\n!-----------------------------------------------------------------------\nfunction fortran_query(data, length) result(answer) bind(c, name='Query')\n use, intrinsic :: iso_c_binding, only: c_char, c_int, c_size_t, c_null_char\n implicit none\n character(len=1,kind=c_char), dimension(length), intent(inout) :: data\n integer(c_size_t), intent(inout) :: length\n integer(c_int) :: answer\n answer = 0\n if(length<10) return\n data = transfer(\"Here I am\"//c_null_char, data)\n length = 10_c_size_t\n answer = 1\nend function fortran_query\n","language":"Fortran"},{"code":"#include <stdio.h>\n#include \"_cgo_export.h\"\n\nvoid Run()\n{\n char Buffer [1024];\n size_t Size = sizeof (Buffer);\n\n if (0 == Query (Buffer, &Size))\n ...\n","language":"Go"},{"code":"package main\n\n// #include <stdlib.h>\n// extern void Run();\nimport \"C\"\nimport \"unsafe\"\n\nfunc main() {\n C.Run()\n}\n\nconst msg = \"Here am I\"\n\n//export Query\nfunc Query(cbuf *C.char, csiz *C.size_t) C.int {\n if int(*csiz) <= len(msg) {\n return 0\n }\n pbuf := uintptr(unsafe.Pointer(cbuf))\n for i := 0; i < len(msg); i++ {\n *((*byte)(unsafe.Pointer(pbuf))) = msg[i]\n pbuf++\n }\n *((*byte)(unsafe.Pointer(pbuf))) = 0\n *csiz = C.size_t(len(msg) + 1)\n return 1\n}\n","language":"Go"},{"code":"// This buildmode requires the package to be main\npackage main\n\n// Import C so we can export the function to C and use C types\n\n//#include <stdlib.h> // for size_t\nimport \"C\"\n\n// Import reflect and unsafe so we can wrap the C array in a Go slice\nimport \"reflect\"\nimport \"unsafe\"\n\n// This buildmode also requires a main function, but it is never actually called\nfunc main() {}\n\n// The message to copy into the buffer\nconst msg = \"Here am I\"\n\n// Here we declare the Query function using C types and export it to C\n\n//export Query\nfunc Query(buffer *C.char, length *C.size_t) C.int {\n // Check there is enough space in the buffer\n if int(*length) < len(msg) {\n return 0\n }\n\n // Wrap the buffer in a slice to make it easier to copy into\n sliceHeader := reflect.SliceHeader {\n Data: uintptr(unsafe.Pointer(buffer)),\n Len: len(msg),\n Cap: len(msg),\n }\n bufferSlice := *(*[]byte)(unsafe.Pointer(&sliceHeader))\n\n // Iterate through the message and copy it to the buffer, byte by byte\n for i:=0;i<len(msg);i++ {\n bufferSlice[i] = msg[i]\n }\n\n // Set length to the amount of bytes we copied\n (*length) = C.size_t(len(msg))\n\n return 1\n}\n","language":"Go"},{"code":"#ifdef __GLASGOW_HASKELL__\n#include \"Called_stub.h\"\nextern void __stginit_Called(void);\n#endif\n#include <stdio.h>\n#include <HsFFI.h>\n\nint main (int argc, char * argv [])\n{\n char Buffer [1024];\n size_t Size = sizeof (Buffer);\n\n hs_init(&argc, &argv);\n#ifdef __GLASGOW_HASKELL__\n hs_add_root(__stginit_Called);\n#endif\n\n if (0 == query_hs (Buffer, &Size))\n {\n printf (\"failed to call Query\\n\");\n }\n else\n {\n char * Ptr = Buffer;\n while (Size-- > 0) putchar (*Ptr++);\n putchar ('\\n');\n }\n\n hs_exit();\n return 0;\n}\n","language":"Haskell"},{"code":"{-# LANGUAGE ForeignFunctionInterface #-}\n\nmodule Called where\n\nimport Foreign\nimport Foreign.C.String (CString, withCStringLen)\nimport Foreign.C.Types\n\n-- place a string into the buffer pointed to by ptrBuff (with size\n-- pointed to by ptrSize). If successful, sets number of overwritten\n-- bytes in ptrSize and returns 1, otherwise, it does nothing and\n-- returns 0\nquery_hs :: CString -> Ptr CSize -> IO CInt\nquery_hs ptrBuff ptrSize = withCStringLen \"Here I am\"\n (\\(str, len) -> do\n buffSize <- peek ptrSize\n if sizeOf str > (fromIntegral buffSize)\n then do\n poke ptrSize 0\n return 0\n else do\n poke ptrSize (fromIntegral len)\n copyArray ptrBuff str len\n return 1)\n\nforeign export ccall query_hs :: CString -> Ptr CSize -> IO CInt\n","language":"Haskell"},{"code":"ghc -c -O Called.hs\n","language":"Haskell"},{"code":"ghc -optc-O calling.c Called.o Called_stub.o -o calling\n","language":"Haskell"},{"code":"untyped __call__(\"functionName\", args);\n","language":"Haxe"},{"code":"query=:3 :'0&#^:(y < #)''Here am I'''\n","language":"J"},{"code":"#include<stdio.h>\n#include<stdlib.h>\n#include<string.h>\n\nint Query(char*,unsigned*);\n\nint main(int argc,char*argv[]) {\n char Buffer[1024], *pc;\n unsigned Size = (unsigned)sizeof(Buffer);\n if (!Query(Buffer,&Size))\n fputs(\"Failed to call Query\",stdout);\n else\n for (pc = Buffer; Size--; ++pc)\n putchar(*pc);\n putchar('\\n');\n return EXIT_SUCCESS;\n}\n","language":"J"},{"code":"// J Front End Example\n// define _WIN32 for Windows, __MACH__ for MAC, J64 for 64-bit\n// JE is loaded from current working directory\n\n//make jfex && LD_LIBRARY_PATH=/usr/local/j64-701/bin ./jfex\n\n#ifdef _WIN32\n#define _CRT_SECURE_NO_WARNINGS\n#include <windows.h>\n#include <direct.h>\n#define GETPROCADDRESS(h,p) GetProcAddress(h,p)\n#define JDLLNAME \"\\\\j.dll\"\n#else\n#define _stdcall\n#include <dlfcn.h>\n#define GETPROCADDRESS(h,p)\tdlsym(h,p)\n#ifdef __MACH__\n#define JDLLNAME \"/libj.dylib\"\n#else\n#define JDLLNAME \"/libj.so\"\n#endif\n#define _getcwd getcwd\n#endif\n\n#include<stdio.h>\n#include<signal.h>\n#include<stdlib.h>\n#include<string.h>\n#include\"jfex.h\"\n#include\"jlib.h\"\n\nstatic JDoType jdo;\nstatic JFreeType jfree;\nstatic JgaType jga;\nstatic JGetLocaleType jgetlocale;\n\nstatic J jt;\nstatic void* hjdll;\n\nstatic char **adadbreak;\nstatic void sigint(int k){**adadbreak+=1;signal(SIGINT,sigint);}\nstatic char input[1000];\n\n// J calls for input (debug suspension and 1!:1[1) and we call for input\nchar* _stdcall Jinput(J jt,char* prompt)\n{\n fputs(prompt,stdout);\n if(fgets(input, sizeof(input), stdin))\n {\n fputs(\"\\n\",stdout);\n **adadbreak+=1;\n }\n return input;\n}\n\nstatic char*buffer = NULL; /**************************************/\nstatic unsigned length = 0; /**************************************/\nstatic int Jouts = 0; /**************************************/\n\n// J calls for output\n#define LINEFEED 10 /**************************************/\nvoid _stdcall Joutput(J jt,int type, char* s) /********************/\n{\n size_t L;\n if(MTYOEXIT==type) exit((int)(I)s);\n L = strlen(s);\n L -= (L && (LINEFEED==s[L-1])); /* CRLF not handled. */\n if (L && (!Jouts)) {\n length = L;\n strncpy(buffer,s,L);\n Jouts = 1;\n }\n}\n\nint Query(char*Data,unsigned*Length)\n{\n void* callbacks[] = {Joutput,NULL,Jinput,0,(void*)SMCON};\n char pathdll[1000];\n _getcwd(pathdll,sizeof(pathdll));\n strcat(pathdll,JDLLNAME);\n#ifdef _WIN32\n hjdll=LoadLibraryA(pathdll);\n#else\n hjdll=dlopen(pathdll,RTLD_LAZY);\n if (NULL == hjdll)\n hjdll=dlopen(JDLLNAME+1,RTLD_LAZY); /* use LD_LIBRARY_PATH */\n#endif\n if(NULL == hjdll)\n {\n fprintf(stderr,\"Unix use: $ LD_LIBRARY_PATH=path/to/libj.so %s\\n\",\"programName\");//*argv);\n fputs(\"Load library failed: \",stderr);\n fputs(pathdll,stderr);\n fputs(\"\\n\",stderr);\n return 0; // load library failed\n }\n jt=((JInitType)GETPROCADDRESS(hjdll,\"JInit\"))();\n if(!jt) return 0; // JE init failed\n ((JSMType)GETPROCADDRESS(hjdll,\"JSM\"))(jt,callbacks);\n jdo=(JDoType)GETPROCADDRESS(hjdll,\"JDo\");\n jfree=(JFreeType)GETPROCADDRESS(hjdll,\"JFree\");\n jga=(JgaType)GETPROCADDRESS(hjdll,\"Jga\");\n jgetlocale=(JGetLocaleType)GETPROCADDRESS(hjdll,\"JGetLocale\");\n adadbreak=(char**)jt; // first address in jt is address of breakdata\n signal(SIGINT,sigint);\n {\n char input[999];\n //memset(input,0,sizeof input);\n buffer = Data;\n sprintf(input,\"query %u [ 0!:110<'rc_embed.ijs'\\n\",*Length); /***deceptive input routine, a hard coded string*********/\n jdo(jt,input);\n if (!Jouts)\n return 0;\n *Length = length;\n }\n jfree(jt);\n return 1;\n}\n","language":"J"},{"code":"# jfe makefile info\n# customize to create makefile suitable for your platform\n# 32bit builds on 64bit systems require -m32 in CFLAGS and FLAGS\n# Unix requires -ldl in FLAGS and Windows does not\n\nCPPFLAGS= -I/usr/local/j64-602/system/examples/jfe\nCFLAGS= -O0 -g\nLOADLIBES= -ldl\n\nmain: main.o Query.o\n","language":"J"},{"code":"$ make main && LD_LIBRARY_PATH=~/Downloads/jgplsrc/j/bin ./main\nHere am I\n$\n","language":"J"},{"code":"/* Query.java */\npublic class Query {\n public static boolean call(byte[] data, int[] length)\n\tthrows java.io.UnsupportedEncodingException\n {\n\tString message = \"Here am I\";\n\tbyte[] mb = message.getBytes(\"utf-8\");\n\tif (length[0] < mb.length)\n\t return false;\n\tlength[0] = mb.length;\n\tSystem.arraycopy(mb, 0, data, 0, mb.length);\n\treturn true;\n }\n}\n","language":"Java"},{"code":"/* query-jni.c */\n#include <stdio.h>\n#include <stdlib.h>\n#include <jni.h>\n\nstatic JavaVM *jvm = NULL;\nstatic JNIEnv *jenv = NULL;\n\nstatic void die(const char *message) {\n fprintf(stderr, \"%s\\n\", message);\n exit(1);\n}\n\nstatic void oom(void) {\n die(\"Query: out of memory\");\n}\n\nstatic void except(void) {\n if ((*jenv)->ExceptionCheck(jenv))\n\tdie(\"Query: unexpected Java exception\");\n}\n\nstatic void do_at_exit(void) {\n (*jvm)->DestroyJavaVM(jvm);\n}\n\nstatic void require_jvm(void) {\n JavaVMInitArgs args;\n\n if (jvm)\n\treturn;\n\n args.version = JNI_VERSION_1_4;\n args.nOptions = 0;\n args.options = NULL;\n args.ignoreUnrecognized = JNI_FALSE;\n if (JNI_CreateJavaVM(&jvm, (void **)&jenv, &args) != JNI_OK)\n\tdie(\"Query: can't create Java VM\");\n atexit(do_at_exit);\n}\n\nint Query(char *data, size_t *length) {\n jclass cQuery;\n jmethodID mcall;\n jintArray jlength;\n jint jlength0;\n jbyteArray jdata;\n jboolean result;\n\n jlength0 = (jint)length[0];\n if ((size_t)jlength0 != length[0])\n\tdie(\"Query: length is too large for Java array\");\n\n require_jvm();\n\n /* Create a local frame for references to Java objects. */\n if ((*jenv)->PushLocalFrame(jenv, 16))\n\toom();\n\n /* Look for class Query, static boolean call(byte[], int[]) */\n cQuery = (*jenv)->FindClass(jenv, \"Query\");\n if (cQuery == NULL)\n\tdie(\"Query: can't find Query.class\");\n mcall = (*jenv)->GetStaticMethodID(jenv, cQuery, \"call\", \"([B[I)Z\");\n if (mcall == NULL)\n\tdie(\"Query: missing call() method\");\n\n /*\n * Make arguments to Query.call(). We can't pass data[] and\n * length[] to Java, so we make new Java arrays jdata[] and\n * jlength[].\n */\n jdata = (*jenv)->NewByteArray(jenv, (jsize)jlength0);\n if (jdata == NULL)\n\toom();\n jlength = (*jenv)->NewIntArray(jenv, 1);\n if (jlength == NULL)\n\toom();\n\n /* Set jlength[0] = length[0]. */\n (*jenv)->SetIntArrayRegion(jenv, jlength, 0, 1, &jlength0);\n except();\n\n /*\n * Call our Java method.\n */\n result = (*jenv)->CallStaticBooleanMethod\n\t(jenv, cQuery, mcall, jdata, jlength);\n except();\n\n /*\n * Set length[0] = jlength[0].\n * Copy length[0] bytes from jdata[] to data[].\n */\n (*jenv)->GetIntArrayRegion(jenv, jlength, 0, 1, &jlength0);\n except();\n length[0] = (size_t)jlength0;\n (*jenv)->GetByteArrayRegion\n\t(jenv, jdata, 0, (jsize)jlength0, (jbyte *)data);\n\n /* Drop our local frame and its references. */\n (*jenv)->PopLocalFrame(jenv, NULL);\n\n return (int)result;\n}\n","language":"Java"},{"code":"# Makefile\n\n# Edit these lines to match your JDK.\nJAVA_HOME = /Library/Java/Home\nCPPFLAGS = -I$(JAVA_HOME)/include\nLIBS = -framework JavaVM\nJAVAC = $(JAVA_HOME)/bin/javac\nCC = cc\n\nall: calljava Query.class\n\ncalljava: main.o query-jni.o\n\t$(CC) -o calljava main.o query-jni.o $(LIBS)\n\n.SUFFIXES: .c .class .java .o\n.c.o:\n\t$(CC) $(CPPFLAGS) -c $<\n.java.class:\n\t$(JAVAC) $<\n\nclean:\n\trm -f calljava main.o query-jni.o Query.class\n","language":"Java"},{"code":"// Kotlin Native v0.6\n\nimport kotlinx.cinterop.*\nimport platform.posix.*\n\nfun query(data: CPointer<ByteVar>, length: CPointer<size_tVar>): Int {\n val s = \"Here am I\"\n val strLen = s.length\n val bufferSize = length.pointed.value\n if (strLen > bufferSize) return 0 // buffer not large enough\n for (i in 0 until strLen) data[i] = s[i].toByte()\n length.pointed.value = strLen.signExtend<size_t>()\n return 1\n}\n","language":"Kotlin"},{"code":"#ifndef KONAN_LIBQUERY_H\n#define KONAN_LIBQUERY_H\n#ifdef __cplusplus\nextern \"C\" {\n#endif\ntypedef unsigned char libQuery_KBoolean;\ntypedef char libQuery_KByte;\ntypedef unsigned short libQuery_KChar;\ntypedef short libQuery_KShort;\ntypedef int libQuery_KInt;\ntypedef long long libQuery_KLong;\ntypedef float libQuery_KFloat;\ntypedef double libQuery_KDouble;\ntypedef void* libQuery_KNativePtr;\nstruct libQuery_KType;\ntypedef struct libQuery_KType libQuery_KType;\n\ntypedef struct {\n /* Service functions. */\n void (*DisposeStablePointer)(libQuery_KNativePtr ptr);\n void (*DisposeString)(const char* string);\n libQuery_KBoolean (*IsInstance)(libQuery_KNativePtr ref, const libQuery_KType* type);\n\n /* User functions. */\n struct {\n struct {\n libQuery_KInt (*query)(void* data, void* length);\n } root;\n } kotlin;\n} libQuery_ExportedSymbols;\nextern libQuery_ExportedSymbols* libQuery_symbols(void);\n#ifdef __cplusplus\n} /* extern \"C\" */\n#endif\n#endif /* KONAN_LIBQUERY_H */\n","language":"Kotlin"},{"code":"#include <stdio.h>\n#include <stdlib.h>\n#include \"libQuery_api.h\"\n\nstatic int Query (char * Data, size_t * Length)\n{\n return libQuery_symbols() -> kotlin.root.query(Data, Length);\n}\n\nint main (int argc, char * argv [])\n{\n char Buffer [1024];\n size_t Size = sizeof (Buffer);\n\n if (0 == Query (Buffer, &Size))\n {\n printf (\"failed to call Query\\n\");\n }\n else\n {\n char * Ptr = Buffer;\n while (Size-- > 0) putchar (*Ptr++);\n putchar ('\\n');\n }\n}\n","language":"Kotlin"},{"code":"Section Header\n\n+ name := QUERY;\n- external := `#define main _query_main`;\n- external := `#define query Query`;\n\nSection External\n\n- query(buffer : NATIVE_ARRAY[CHARACTER], size : NATIVE_ARRAY[INTEGER]) : INTEGER <- (\n + s : STRING_CONSTANT;\n + len, result : INTEGER;\n s := \"Here am I\";\n len := s.count;\n (len > size.item(0)).if {\n result := 0;\n } else {\n 1.to len do { i : INTEGER;\n buffer.put (s @ i) to (i - 1);\n };\n size.put len to 0;\n result := 1;\n };\n result\n);\n\nSection Public\n\n- main <- (\n + buffer : NATIVE_ARRAY[CHARACTER];\n + size : NATIVE_ARRAY[INTEGER];\n query(buffer, size); // need this to pull the query() method\n);\n","language":"Lisaac"},{"code":"TARGET=test_query\n\nall: $(TARGET)\n\n$(TARGET): main.o query.o\n\tgcc -o $@ main.o query.o\n\n.c.o:\n\tgcc -c $<\n\nquery.c: query.li\n\t-lisaac $<\n\nclean:\n\trm -f $(TARGET) *.o query.c\n","language":"Lisaac"},{"code":":- module query.\n:- interface.\n\n:- pred query(string::in, string::out) is det.\n\n:- implementation.\n\nquery(_, \"Hello, world!\").\n\n:- pragma foreign_export(\"C\", query(in, out), \"query\").\n\n:- pragma foreign_decl(\"C\",\n\"\n#include <string.h>\nint Query (char * Data, size_t * Length);\n\").\n:- pragma foreign_code(\"C\",\n\"\nint Query (char *Data, size_t *Length) {\n MR_String input, result;\n MR_allocate_aligned_string_msg(input, *Length, MR_ALLOC_ID);\n memmove(input, Data, *Length);\n query(input, &result);\n *Length = strlen(result);\n memmove(Data, result, *Length);\n return 1;\n}\n\").\n","language":"Mercury"},{"code":"proc Query*(data: var array[1024, char], length: var cint): cint {.exportc.} =\n const text = \"Here am I\"\n if length < text.len:\n return 0\n\n for i in 0 .. text.high:\n data[i] = text[i]\n length = text.len\n return 1\n","language":"Nim"},{"code":"#include <stdio.h>\n\nextern int Query (char * Data, size_t * Length);\n\nint main (int argc, char * argv [])\n{\n char Buffer [1024];\n size_t Size = sizeof (Buffer);\n\n if (0 == Query (Buffer, &Size))\n {\n printf (\"failed to call Query\\n\");\n }\n else\n {\n char * Ptr = Buffer;\n while (Size-- > 0) putchar (*Ptr++);\n putchar ('\\n');\n }\n}\n","language":"Nim"},{"code":"#include <stdio.h>\n#include <string.h>\n#include <caml/mlvalues.h>\n#include <caml/callback.h>\n\nextern int Query (char * Data, size_t * Length)\n{\n static value * closure_f = NULL;\n if (closure_f == NULL) {\n closure_f = caml_named_value(\"Query function cb\");\n }\n value ret = caml_callback(*closure_f, Val_unit);\n *Length = Int_val(Field(ret, 1));\n strncpy(Data, String_val(Field(ret, 0)), *Length);\n return 1;\n}\n\nint main (int argc, char * argv [])\n{\n char Buffer [1024];\n unsigned Size = 0;\n\n caml_main(argv); /* added from the original main */\n\n if (0 == Query (Buffer, &Size))\n {\n printf (\"failed to call Query\\n\");\n }\n else\n {\n char * Ptr = Buffer;\n printf(\"size: %d\\n\", Size);\n while (Size-- > 0) putchar (*Ptr++);\n putchar ('\\n');\n }\n}\n","language":"OCaml"},{"code":"let caml_query () =\n let s = \"Here am I\" in\n (s, String.length s)\n;;\n\nlet () =\n Callback.register \"Query function cb\" caml_query;\n;;\n","language":"OCaml"},{"code":"#include <extensions/embed.h>\n\n#define min(x,y) (x < y ? x : y)\n\nextern unsigned char repl[];\nint Query(char *Data, size_t *Length) {\n\tol_t ol;\n\tembed_new(&ol, repl, 0);\n\n\tword s = embed_eval(&ol, new_string(&ol,\n\t\t\"(define sample \\\"Here am I\\\")\"\n\t\t\"sample\"\n\t), 0);\n\tif (!is_string(s))\n\t\tgoto fail;\n\n\tint i = *Length = min(string_length(s), *Length);\n\n\tmemcpy(Data, string_value(s), i);\n\t*Length = i;\n\n\tOL_free(ol.vm);\n\treturn 1;\nfail:\n\tOL_free(ol.vm);\n\treturn 0;\n}\n","language":"Ol"},{"code":"#include <extensions/embed.h>\n\nextern unsigned char repl[];\nint Query(char *Data, size_t *Length) {\n\tol_t ol;\n\tembed_new(&ol, repl, 0);\n\n\tembed_eval(&ol, new_string(&ol,\n\t\t\"(import (otus ffi))\"\n\t\t\"(define lib (load-dynamic-library #f))\"\n\t\t\"(define memcpy (lib fft-void* \\\"memcpy\\\" fft-void* type-string fft-int))\"\n\t\t\"(define (Query Data Length)\"\n\t\t\" (define sample (c-string \\\"Here am I\\\"))\"\n\t\t\" (when (memcpy Data sample (min (string-length sample) Length))\"\n\t\t\" (min (string-length sample) Length)))\"\n\t), 0);\n\tword r =\n\tembed_eval(&ol, new_string(&ol, \"Query\"), new_vptr(&ol, Data), make_integer(*Length), 0);\n\tif (!is_number(r))\n\t\tgoto fail;\n\t*Length = ol2int(r);\n\t\n\tOL_free(ol.vm);\n\treturn 1;\n\nfail:\n\tOL_free(ol.vm);\n\treturn 0;\n}\n","language":"Ol"},{"code":"Strchr(Vecsmall(apply(k->if(k>96&&k<123,(k-84)%26+97,if(k>64&&k<91,(k-52)%26+65,k)),Vec(Vecsmall(s)))))\n","language":"PARI-GP"},{"code":"#include <pari/pari.h>\n\n#define PARI_SECRET \"s=\\\"Urer V nz\\\";Strchr(Vecsmall(apply(k->if(k>96&&k<123,(k-84)%26+97,if(k>64&&k<91,(k-52)%26+65,k)),Vec(Vecsmall(s)))))\"\n\nint Query(char *Data, size_t *Length)\n{\n int rc = 0;\n GEN result;\n\n pari_init(1000000, 2);\n\n result = geval(strtoGENstr(PARI_SECRET)); /* solve the secret */\n\n if (result) {\n strncpy(Data, GSTR(result), *Length);\t/* return secret */\n rc = 1;\n }\n\n pari_close();\n\n return rc;\n}\n","language":"PARI-GP"},{"code":"(notonline)-->\n <span style=\"color: #008080;\">without</span> <span style=\"color: #008080;\">js</span> <span style=\"color: #000080;font-style:italic;\">-- (peek/poke, call_back)</span>\n <span style=\"color: #008080;\">constant</span> <span style=\"color: #000000;\">Here_am_I</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #008000;\">\"Here am I\"</span>\n <span style=\"color: #008080;\">function</span> <span style=\"color: #000000;\">Query</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: #000000;\">pLength</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #004080;\">integer</span> <span style=\"color: #000000;\">len</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">peekNS</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">pLength</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #7060A8;\">machine_word</span><span style=\"color: #0000FF;\">(),</span><span style=\"color: #000000;\">0</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #008080;\">if</span> <span style=\"color: #7060A8;\">poke_string</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">pData</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">len</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">Here_am_I</span><span style=\"color: #0000FF;\">)</span> <span style=\"color: #008080;\">then</span>\n <span style=\"color: #008080;\">return</span> <span style=\"color: #000000;\">0</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">if</span>\n <span style=\"color: #7060A8;\">pokeN</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">pLength</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #7060A8;\">length</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">Here_am_I</span><span style=\"color: #0000FF;\">)+</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #7060A8;\">machine_word</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 <span style=\"color: #008080;\">constant</span> <span style=\"color: #000000;\">Query_cb</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">call_back</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">Query</span><span style=\"color: #0000FF;\">)</span>\n<!--\n","language":"Phix"},{"code":"(let (Str \"Here am I\" Len (format (opt))) # Get length from command line\n (unless (>= (size Str) Len) # Check buffer size\n (prinl Str) ) ) # Return string if OK\n","language":"PicoLisp"},{"code":"int Query(char *Data, size_t *Length) {\n FILE *fp;\n char buf[64];\n\n sprintf(buf, \"/usr/bin/picolisp query.l %d -bye\", *Length);\n if (!(fp = popen(buf, \"r\")))\n return 0;\n fgets(Data, *Length, fp);\n *Length = strlen(Data);\n return pclose(fp) >= 0 && *Length != 0;\n}\n","language":"PicoLisp"},{"code":"# store this in file rc_embed.py\n# store this in file rc_embed.py\ndef query(buffer_length):\n message = b'Here am I'\n L = len(message)\n return message[0:L*(L <= buffer_length)]\n","language":"Python"},{"code":"#if 0\n//I rewrote the driver according to good sense, my style,\n//and discussion --Kernigh 15:45, 12 February 2011 (UTC).\n#endif\n\n#include<stdio.h>\n#include<stdlib.h>\n#include<string.h>\n\nextern int Query(char*,unsigned*);\n\nint main(int argc,char*argv[]) {\n char Buffer[1024], *pc;\n unsigned Size = sizeof(Buffer);\n if (!Query(Buffer,&Size))\n fputs(\"Failed to call Query\",stdout);\n else\n for (pc = Buffer; Size--; ++pc)\n putchar(*pc);\n putchar('\\n');\n return EXIT_SUCCESS;\n}\n","language":"Python"},{"code":"#include<stdio.h>\n#include<stdlib.h>\n#include<string.h>\n#include<Python.h>\n\nint Query(char*Data,unsigned*Length) {\n char *module = \"rc_embed\", *function = \"query\";\n PyObject *pName, *pModule, *pFunc, *pResult, *pArgs, *pLength;\n long result = 0;\n if (!Py_IsInitialized())\n Py_Initialize();\n pName = PyUnicode_FromString(module);\n pModule = PyImport_Import(pName);\n Py_DECREF(pName);\n if (NULL == pModule) {\n PyErr_Print();\n fprintf(stderr,\"Failed to load \\\"%s\\\"\\n\",module);\n return 0;\n }\n pFunc = PyObject_GetAttrString(pModule,function);\n if ((NULL == pFunc) || (!PyCallable_Check(pFunc))) {\n if (PyErr_Occurred())\n PyErr_Print();\n fprintf(stderr,\"Cannot find function \\\"%s\\\"\\n\",function);\n if (NULL != pFunc)\n Py_DECREF(pFunc);\n Py_DECREF(pModule);\n return 0;\n }\t\n pArgs = PyTuple_New(1);\n pLength = PyLong_FromUnsignedLong((unsigned long)(*Length));\n if (NULL == pLength) {\n Py_DECREF(pArgs);\n Py_DECREF(pFunc);\n Py_DECREF(pModule);\n return 0;\n }\n PyTuple_SetItem(pArgs,0,pLength);\n pResult = PyObject_CallObject(pFunc, pArgs);\n if (NULL == pResult)\n result = 0;\n else if (!PyBytes_Check(pResult)) {\n result = 0;\n Py_DECREF(pResult);\n } else {\n if (! PyBytes_Size(pResult))\n result = 0;\n else {\n *Length = (unsigned)PyBytes_Size(pResult);\n strncpy(Data,PyBytes_AsString(pResult),*Length);\n Py_DECREF(pResult);\n result = 1;\n }\n }\n Py_DECREF(pArgs);\n Py_DECREF(pFunc);\n Py_DECREF(pModule);\n Py_Finalize();\n return result;\n}\n","language":"Python"},{"code":"$ make main.o\ncc -c -o main.o main.c\n$ D=$( dirname $( which python3 ) )\n$ gcc $( $D/python3.2-config --cflags ) -c Query.c\nIn file included from /usr/include/python3.2mu/Python.h:8:0,\n from Q.c:18:\n/usr/include/python3.2mu/pyconfig.h:1173:0: warning: \"_POSIX_C_SOURCE\" redefined [enabled by default]\n/usr/include/features.h:214:0: note: this is the location of the previous definition\n$ gcc -o main main.o Query.o $( $D/python3.2-config --ldflags )\n$ ./main\nHere am I\n$\n","language":"Python"},{"code":"typedef int strfun (char * Data, size_t * Length);\nstrfun *Query = NULL;\n","language":"Racket"},{"code":"#lang racket\n\n(require ffi/unsafe)\n\n(define xlib (ffi-lib \"./x.so\"))\n\n(set-ffi-obj! \"Query\" xlib (_fun _pointer _pointer -> _bool)\n (λ(bs len)\n (define out #\"Here I am\")\n (let ([bs (make-sized-byte-string bs (ptr-ref len _int))])\n (and ((bytes-length out) . <= . (bytes-length bs))\n (begin (bytes-copy! bs 0 out)\n (ptr-set! len _int (bytes-length out))\n #t)))))\n\n((get-ffi-obj \"main\" xlib (_fun _int (_list i _bytes) -> _void))\n 0 '())\n","language":"Racket"},{"code":"#!/usr/bin/env raku\n\nsub MAIN (Int :l(:len(:$length))) {\n my Str $String = \"Here am I\";\n $*OUT.print: $String if $String.codes ≤ $length\n}\n","language":"Raku"},{"code":"#include<stdio.h>\n#include<stddef.h>\n#include<string.h>\n\nint Query(char *Data, size_t *Length) {\n FILE *fp;\n char buf[64];\n\n sprintf(buf, \"/home/user/query.raku --len=%zu\", *Length);\n if (!(fp = popen(buf, \"r\")))\n return 0;\n fgets(Data, *Length, fp);\n *Length = strlen(Data);\n return pclose(fp) >= 0 && *Length != 0;\n}\n","language":"Raku"},{"code":"# query.rb\nrequire 'fiddle'\n\n# Look for a C variable named QueryPointer.\n# Raise an error if it is missing.\nc_var = Fiddle.dlopen(nil)['QueryPointer']\n\nint = Fiddle::TYPE_INT\nvoidp = Fiddle::TYPE_VOIDP\nsz_voidp = Fiddle::SIZEOF_VOIDP\n\n# Implement the C function\n# int Query(void *data, size_t *length)\n# in Ruby code. Store it in a global constant in Ruby (named Query)\n# to protect it from Ruby's garbage collector.\n#\nQuery = Fiddle::Closure::BlockCaller\n .new(int, [voidp, voidp]) do |datap, lengthp|\n message = \"Here am I\"\n\n # We got datap and lengthp as Fiddle::Pointer objects.\n # Read length, assuming sizeof(size_t) == sizeof(void *).\n length = lengthp[0, sz_voidp].unpack('J').first\n\n # Does the message fit in length bytes?\n if length < message.bytesize\n 0 # failure\n else\n length = message.bytesize\n datap[0, length] = message # Copy the message.\n lengthp[0, sz_voidp] = [length].pack('J') # Update the length.\n 1 # success\n end\nend\n\n# Set the C variable to our Query.\nFiddle::Pointer.new(c_var)[0, sz_voidp] = [Query.to_i].pack('J')\n","language":"Ruby"},{"code":"/* query-rb.c */\n#include <stdlib.h>\n#include <ruby.h>\n\n/*\n * QueryPointer() uses Ruby and may raise a Ruby error. Query() is a\n * C wrapper around QueryPointer() that loads Ruby, sets QueryPointer,\n * and protects against Ruby errors.\n */\nint (*QueryPointer)(char *, size_t *) = NULL;\n\nstatic int in_bad_exit = 0;\n\nstatic void\ndo_at_exit(void)\n{\n RUBY_INIT_STACK;\n\n if (!in_bad_exit)\n\truby_cleanup(0);\n}\n\nstatic void\nbad_exit(int state)\n{\n in_bad_exit = 1;\n ruby_stop(state); /* Clean up Ruby and exit the process. */\n}\n\nstatic void\nrequire_query(void)\n{\n static int done = 0;\n int state;\n\n if (done)\n\treturn;\n done = 1;\n\n ruby_init();\n atexit(do_at_exit);\n ruby_init_loadpath(); /* needed to require 'fiddle' */\n\n /* Require query.rb in current directory. */\n rb_eval_string_protect(\"require_relative 'query'\", &state);\n if (!state && !QueryPointer)\n\trb_eval_string_protect(\"fail 'missing QueryPointer'\", &state);\n if (state)\n\tbad_exit(state); /* Ruby will report the error. */\n}\n\nstruct args {\n char *data;\n size_t *length;\n int result;\n};\n\nstatic VALUE\nQuery1(VALUE v) {\n struct args *a = (struct args *)v;\n a->result = QueryPointer(a->data, a->length);\n return Qnil;\n}\n\nint\nQuery(char *data, size_t *length)\n{\n struct args a;\n int state;\n RUBY_INIT_STACK;\n\n require_query();\n\n /* Call QueryPointer(), protect against errors. */\n a.data = data;\n a.length = length;\n rb_protect(Query1, (VALUE)&a, &state);\n if (state)\n\tbad_exit(state);\n return a.result;\n}\n","language":"Ruby"},{"code":"# Rakefile\n\n# To build and run:\n# $ rake\n# $ ./callruby\n\n# Must link with cc -Wl,-E so query.c exports QueryPointer.\nCC = ENV.fetch('CC', 'cc')\nLDFLAGS = '-Wl,-E'\nCPPFLAGS = RbConfig.expand('-I$(rubyarchhdrdir) -I$(rubyhdrdir)')\nLIBS = RbConfig.expand('$(LIBRUBYARG) $(LIBS)')\n\ntask 'default' => 'callruby'\n\ndesc 'compiles callruby'\nfile 'callruby' => %w[main.o query-rb.o] do |t|\n sh \"#{CC} #{LDFLAGS} -o #{t.name} #{t.sources.join(' ')} #{LIBS}\"\nend\n\nrule '.o' => %w[.c] do |t|\n sh \"#{CC} #{CPPFLAGS} -o #{t.name} -c #{t.source}\"\nend\n\ndesc 'removes callruby and .o files'\ntask 'clean' do\n rm_f %w[callruby main.o query-rb.o]\nend\n","language":"Ruby"},{"code":"//! In order to run this task, you will need to compile the C program locating in the task linked\n//! above. The C program will need to be linked with the library produced by this file.\n//!\n//! 1. Compile this library:\n//!\n//! ```bash\n//! $ cargo build --release\n//! ```\n//!\n//! 2. Copy the C program into query.c.\n//! 3. Compile and link the C program with the produced library:\n//!\n//! ```bash\n//! $ LD_LIBRARY_PATH=/path/to/library gcc query.c -o query -Wall -Werror libquery\n//! ```\n//! 4. Run the resulting binary.\n//!\n//! ```bash\n//! $ LD_LIBRARY_PATH=/path/to/library ./query\n//! Here am I\n//! ```\n\n#![crate_type = \"cdylib\"]\n\nextern crate libc;\n\nuse std::ffi::CString;\n\nuse libc::{c_char, c_int, size_t};\n\n#[no_mangle]\n#[allow(non_snake_case)]\n#[allow(clippy::missing_safety_doc)]\npub unsafe extern \"C\" fn Query(data: *mut c_char, length: *mut size_t) -> c_int {\n let string = \"Here am I\";\n if *length + 1 < string.len() {\n 0\n } else {\n let c_string = CString::new(string).unwrap();\n libc::strcpy(data, c_string.as_ptr());\n *length = string.len();\n 1\n }\n}\n","language":"Rust"},{"code":"/* Query.scala */\nobject Query {\n def call(data: Array[Byte], length: Array[Int]): Boolean = {\n val message = \"Here am I\"\n val mb = message.getBytes(\"utf-8\")\n if (length(0) >= mb.length) {\n length(0) = mb.length\n System.arraycopy(mb, 0, data, 0, mb.length)\n true\n } else false\n }\n}\n","language":"Scala"},{"code":"/* query-jni.c */\n#include <stdio.h>\n#include <stdlib.h>\n#include <jni.h>\n\nstatic JavaVM *jvm = NULL;\nstatic JNIEnv *jenv = NULL;\n\nstatic void die(const char *message) {\n fprintf(stderr, \"%s\\n\", message);\n exit(1);\n}\n\nstatic void oom(void) {\n die(\"Query: out of memory\");\n}\n\nstatic void except(void) {\n if ((*jenv)->ExceptionCheck(jenv))\n\tdie(\"Query: unexpected Java exception\");\n}\n\nstatic void do_at_exit(void) {\n (*jvm)->DestroyJavaVM(jvm);\n}\n\nstatic void require_jvm(void) {\n JavaVMInitArgs args;\n\n if (jvm)\n\treturn;\n\n args.version = JNI_VERSION_1_4;\n args.nOptions = 0;\n args.options = NULL;\n args.ignoreUnrecognized = JNI_FALSE;\n if (JNI_CreateJavaVM(&jvm, (void **)&jenv, &args) != JNI_OK)\n\tdie(\"Query: can't create Java VM\");\n atexit(do_at_exit);\n}\n\nint Query(char *data, size_t *length) {\n jclass cQuery;\n jmethodID mcall;\n jintArray jlength;\n jint jlength0;\n jbyteArray jdata;\n jboolean result;\n\n jlength0 = (jint)length[0];\n if ((size_t)jlength0 != length[0])\n\tdie(\"Query: length is too large for Scala array\");\n\n require_jvm();\n\n /* Create a local frame for references to Scala objects. */\n if ((*jenv)->PushLocalFrame(jenv, 16))\n\toom();\n\n /* Look for class Query, static boolean call(byte[], int[]) */\n cQuery = (*jenv)->FindClass(jenv, \"Query\");\n if (cQuery == NULL)\n\tdie(\"Query: can't find Query.class\");\n mcall = (*jenv)->GetStaticMethodID(jenv, cQuery, \"call\", \"([B[I)Z\");\n if (mcall == NULL)\n\tdie(\"Query: missing call() method\");\n\n /*\n * Make arguments to Query.call(). We can't pass data[] and\n * length[] to Scala, so we make new Scala arrays jdata[] and\n * jlength[].\n */\n jdata = (*jenv)->NewByteArray(jenv, (jsize)jlength0);\n if (jdata == NULL)\n\toom();\n jlength = (*jenv)->NewIntArray(jenv, 1);\n if (jlength == NULL)\n\toom();\n\n /* Set jlength[0] = length[0]. */\n (*jenv)->SetIntArrayRegion(jenv, jlength, 0, 1, &jlength0);\n except();\n\n /*\n * Call our Scala method.\n */\n result = (*jenv)->CallStaticBooleanMethod\n\t(jenv, cQuery, mcall, jdata, jlength);\n except();\n\n /*\n * Set length[0] = jlength[0].\n * Copy length[0] bytes from jdata[] to data[].\n */\n (*jenv)->GetIntArrayRegion(jenv, jlength, 0, 1, &jlength0);\n except();\n length[0] = (size_t)jlength0;\n (*jenv)->GetByteArrayRegion\n\t(jenv, jdata, 0, (jsize)jlength0, (jbyte *)data);\n\n /* Drop our local frame and its references. */\n (*jenv)->PopLocalFrame(jenv, NULL);\n\n return (int)result;\n}\n","language":"Scala"},{"code":"# Makefile\n\n# Edit these lines to match your JDK.\nJAVA_HOME = /Library/Java/Home\nCPPFLAGS = -I$(JAVA_HOME)/include\nLIBS = -framework JavaVM\nJAVAC = $(JAVA_HOME)/bin/javac\nCC = cc\n\nall: calljava Query.class\n\ncalljava: main.o query-jni.o\n\t$(CC) -o calljava main.o query-jni.o $(LIBS)\n\n.SUFFIXES: .c .class .java .o\n.c.o:\n\t$(CC) $(CPPFLAGS) -c $<\n.java.class:\n\t$(JAVAC) $<\n\nclean:\n\trm -f calljava main.o query-jni.o Query.class\n","language":"Scala"},{"code":"int Query (char * Data, size_t * Length) {\n Tcl_Obj *arguments[2];\n int code;\n\n arguments[0] = Tcl_NewStringObj(\"Query\", -1); /* -1 for \"use up to zero byte\" */\n arguments[1] = Tcl_NewStringObj(Data, Length);\n Tcl_IncrRefCount(arguments[0]);\n Tcl_IncrRefCount(arguments[1]);\n if (Tcl_EvalObjv(interp, 2, arguments, 0) != TCL_OK) {\n /* Was an error or other exception; report here... */\n Tcl_DecrRefCount(arguments[0]);\n Tcl_DecrRefCount(arguments[1]);\n return 0;\n }\n Tcl_DecrRefCount(arguments[0]);\n Tcl_DecrRefCount(arguments[1]);\n if (Tcl_GetObjResult(NULL, Tcl_GetObjResult(interp), &code) != TCL_OK) {\n /* Not an integer result */\n return 0;\n }\n return code;\n}\n","language":"Tcl"},{"code":"proc Query data {\n puts \"Query was $data\"\n return 1;\n}\n","language":"Tcl"},{"code":"int Query (char * Data, size_t * Length) {\n const char *str;\n int len;\n\n if (Tcl_Eval(interp, \"Query\") != TCL_OK) {\n return 0;\n }\n str = Tcl_GetStringFromObj(Tcl_GetObjResult(interp), &len);\n if (len+1 > Length) {\n return 0;\n }\n memcpy(Data, str, len+1);\n return 1;\n}\n","language":"Tcl"},{"code":"proc Query {} {\n return \"Here am I\"\n}\n","language":"Tcl"},{"code":"#include <tcl.h>\nTcl_Interp *interp;\n\nint main(int argc, char **argv) {\n Tcl_FindExecutable(argv[0]); /* Initializes library */\n interp = Tcl_CreateInterp(); /* Make an interpreter */\n\n /* Rest of contents of main() from task header... */\n}\n","language":"Tcl"},{"code":"#include <stdio.h>\n\nint query(int (*callback)(char *, size_t *))\n{\n char buffer[1024];\n size_t size = sizeof buffer;\n\n if (callback(buffer, &size) == 0) {\n puts(\"query: callback failed\");\n } else {\n char *ptr = buffer;\n\n while (size-- > 0)\n putchar (*ptr++);\n putchar('\\n');\n }\n}\n","language":"TXR"},{"code":"gcc -g -fPIC query.c -c\ngcc -g --shared query.c -o query.c\n","language":"TXR"},{"code":"(with-dyn-lib \"./query.so\"\n (deffi query \"query\" void (closure)))\n\n(deffi-cb query-cb int ((carray char) (ptr (array 1 size-t))))\n\n(query (query-cb (lambda (buf sizeptr)\n (symacrolet ((size [sizeptr 0]))\n (let* ((s \"Here am I\")\n (l (length s)))\n (cond\n ((> l size) 0)\n (t (carray-set-length buf size)\n (carray-put buf s)\n (set size l))))))))\n","language":"TXR"},{"code":"(with-dyn-lib \"./query.so\"\n (deffi query \"query\" void (closure)))\n\n(with-dyn-lib nil\n (deffi memcpy \"memcpy\" cptr (cptr str size-t)))\n\n(deffi-cb query-cb int (cptr (ptr (array 1 size-t))))\n\n(query (query-cb (lambda (buf sizeptr) ; int lambda(void *buf, siz\n (symacrolet ((size [sizeptr 0])) ; { #define size sizeptr[0]\n (let* ((s \"Here am I\") ; char *s = \"Here am I\";\n (l (length s))) ; size_t l = strlen(s);\n (cond ; if (length > size)\n ((> l size) 0) ; { return 0; } else\n (t (memcpy buf s l) ; { memcpy(buf, s, l);\n (set size l)))))))) ; return size = l; } }\n","language":"TXR"},{"code":"(deffi-cb query-cb int (cptr (ptr (array 1 size-t))) -1)\n","language":"TXR"},{"code":"/* Use_another_language_to_call_a_function.wren */\n\nclass RCQuery {\n // Both arguments are lists as we need pass by reference here\n static query(Data, Length) {\n var s = \"Here am I\"\n var sc = s.count\n if (sc > Length[0]) return 0 // buffer too small\n for (i in 0...sc) Data[i] = s[i].bytes[0]\n Length[0] = sc\n return 1\n }\n}\n","language":"Wren"},{"code":"/* gcc Use_another_language_to_call_a_function.c -o Use_another_language_to_call_a_function -lwren -lm */\n\n#include <stdio.h>\n#include \"wren.h\"\n\nchar *script;\nWrenVM * vm;\n\nWrenForeignMethodFn bindForeignMethod(\n WrenVM* vm,\n const char* module,\n const char* className,\n bool isStatic,\n const char* signature) {\n return NULL; // nothing needed here\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 configWrenVM() {\n WrenConfiguration config;\n wrenInitConfiguration(&config);\n config.writeFn = &writeFn;\n config.errorFn = &errorFn;\n config.bindForeignMethodFn = &bindForeignMethod;\n vm = wrenNewVM(&config);\n const char* module = \"main\";\n const char* fileName = \"Use_another_language_to_call_a_function.wren\";\n 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 return -1;\n case WREN_RESULT_RUNTIME_ERROR:\n printf(\"Runtime Error!\\n\");\n return -1;\n case WREN_RESULT_SUCCESS:\n break;\n }\n return 0;\n}\n\nint Query(char *Data, size_t *Length) {\n int i, r;\n wrenEnsureSlots(vm, 4);\n\n // create list for Data, fill with zeros and put in slot 1\n wrenSetSlotNewList(vm, 1);\n wrenSetSlotDouble(vm, 2, 0.0);\n for (i = 0; i < *Length; ++i) wrenInsertInList(vm, 1, i, 2);\n\n // create list for Length and put in slot 2\n wrenSetSlotNewList(vm, 2);\n wrenSetSlotDouble(vm, 3, (double)*Length);\n wrenInsertInList(vm, 2, 0, 3);\n\n // get handle to Wren's query method\n WrenHandle* method = wrenMakeCallHandle(vm, \"query(_,_)\");\n\n // get its class and put in slot 0\n wrenGetVariable(vm, \"main\", \"RCQuery\", 0);\n\n // call the Wren method\n wrenCall(vm, method);\n\n // get the result and check it's 1\n r = (int)wrenGetSlotDouble(vm, 0);\n if (r) {\n // get the length of the string from slot 2\n wrenGetListElement(vm, 2, 0, 3);\n *Length = (int)wrenGetSlotDouble(vm, 3);\n\n // copy the bytes from the list in slot 1 to the C buffer\n for (i = 0; i < *Length; ++i) {\n wrenGetListElement(vm, 1, i, 3);\n Data[i] = (char)wrenGetSlotDouble(vm, 3);\n }\n }\n return r;\n}\n\nint main() {\n int e = configWrenVM();\n if (!e) {\n char Buffer [1024];\n size_t Size = sizeof(Buffer);\n if (0 == Query(Buffer, &Size)) {\n printf (\"failed to call Query\\n\");\n e = 1;\n } else {\n char * Ptr = Buffer;\n while (Size-- > 0) putchar (*Ptr++);\n putchar ('\\n');\n }\n }\n wrenFreeVM(vm);\n free(script);\n return e;\n}\n","language":"Wren"},{"code":"option casemap:none\n\n\nstrlen proto :qword\nstrncpy proto :qword, :qword, :dword\n\nQuery proto :qword, :qword\n\n.data\nszstr db \"Here am I\",0\n\n.code\nQuery proc Data:qword, len:qword\n local d:qword, l:qword, s:dword\n\n mov d, Data\n mov l, len\n invoke strlen, addr szstr\n .if rax <= l\n mov s, eax\n invoke strncpy, d, addr szstr, s\n mov eax, s\n mov rax, l\n mov dword ptr [rax], ecx\n mov rax, 1\n ret\n .endif\n mov rax, 0\n ret\nQuery endp\nend\n","language":"X86-64-Assembly"},{"code":"section .data\nszmsg db \"Here I am\",0\n\nsection .text\n global Query\n\n strlen:\n push rbp\n mov rbp, rsp\n mov rsi, rdi\n mov rcx, -1\n _1:\n inc rcx\n cmp byte [rsi+rcx], 0\n jne _1\n mov rax, rcx\n pop rbp\n ret\n\n Query:\n push rbp\n mov rbp, rsp\n ;;mov r9, rcx ;;Arg 1, windows\n ;;mov r8, rdx ;;Arg 2, windows\n mov r9, rdi ;;Arg 1, Linux\n mov r8, rsi ;;Arg 2, Linux\n lea rdi, szmsg\n call strlen\n cmp rax, r8\n jg _err\n mov r10d, eax\n mov rdi, r9\n lea rsi, szmsg\n rep movsb\n mov rax, r8\n mov dword [rax], r10d\n jmp _exit\n\n _err:\n mov rax, 0\n\n _exit:\n pop rbp\n ret\n","language":"X86-64-Assembly"},{"code":"const std = @import(\"std\");\n\nexport fn Query(Data: [*c]u8, Length: *usize) callconv(.C) c_int {\n const value = \"Here I am\";\n\n if (Length.* >= value.len) {\n @memcpy(@ptrCast([*]u8, Data), value, value.len);\n Length.* = value.len;\n return 1;\n }\n\n return 0;\n}\n","language":"Zig"},{"code":"// query.c\n// export zklRoot=/home/ZKL\n// clang query.c -I $zklRoot/VM -L $zklRoot/Lib -lzkl -pthread -lncurses -o query\n// LD_LIBRARY_PATH=$zklRoot/Lib ./query\n\n#include <stdio.h>\n#include <string.h>\n\n#include \"zklObject.h\"\n#include \"zklImports.h\"\n#include \"zklClass.h\"\n#include \"zklFcn.h\"\n#include \"zklString.h\"\n\nint query(char *buf, size_t *sz)\n{\n Instance *r;\n pVM vm;\n MLIST(mlist,10);\n\n // Bad practice: not protecting things from the garbage collector\n\n // build the call parameters: (\"query.zkl\",False,False,True)\n mlistBuild(mlist,stringCreate(\"query.zkl\",I_OWNED,NoVM),\n BoolFalse,BoolFalse,BoolTrue,ZNIL);\n // Import is in the Vault, a store of useful stuff\n // We want to call TheVault.Import.import(\"query.zkl\",False,False,True)\n // which will load/compile/run query.zkl\n r = fcnRunith(\"Import\",\"import\",(Instance *)mlist,NoVM);\n // query.zkl is a class with a var that has the query result\n r = classFindVar(r,\"query\",0,NoVM); // -->the var contents\n strcpy(buf,stringText(r)); // decode the string into a char *\n *sz = strlen(buf); // screw overflow checking\n return 1;\n}\n\nint main(int argc, char* argv[])\n{\n char buf[100];\n size_t sz = sizeof(buf);\n\n zklConstruct(argc,argv);\t// initialize the zkl shared library\n query(buf,&sz);\n printf(\"Query() --> \\\"%s\\\"\\n\",buf);\n\n return 0;\n}\n","language":"Zkl"},{"code":"// query.zkl\nvar query=\"Here am I\";\n","language":"Zkl"}],"string":"[\n {\n \"code\": \"---\\nfrom: http://rosettacode.org/wiki/Use_another_language_to_call_a_function\\nnote: Programming environment operations\\n\",\n \"language\": \"00-META\"\n },\n {\n \"code\": \"This task is inverse to the task [[Call foreign language function]]. Consider the following [[C]] program:\\n<syntaxhighlight lang=\\\"c\\\">#include <stdio.h>\\n\\nextern int Query (char * Data, size_t * Length);\\n\\nint main (int argc, char * argv [])\\n{\\n char Buffer [1024];\\n size_t Size = sizeof (Buffer);\\n \\n if (0 == Query (Buffer, &Size))\\n {\\n printf (\\\"failed to call Query\\\\n\\\");\\n }\\n else\\n {\\n char * Ptr = Buffer;\\n while (Size-- > 0) putchar (*Ptr++);\\n putchar ('\\\\n');\\n }\\n}</syntaxhighlight>\\n\\nImplement the missing <code>Query</code> function in your language, and let this C program call it. The function should place the string ''<tt style=\\\"margin:0 0.5em\\\">Here am I</tt>'' into the buffer which is passed to it as the parameter <code>Data</code>. The buffer size in bytes is passed as the parameter <code>Length</code>. When there is no room in the buffer, <code>Query</code> shall return 0. Otherwise it overwrites the beginning of <code>Buffer</code>, sets the number of overwritten bytes into <code>Length</code> and returns 1.\\n\\n\",\n \"language\": \"00-TASK\"\n },\n {\n \"code\": \"with Interfaces.C; use Interfaces.C;\\nwith Interfaces.C.Strings; use Interfaces.C.Strings;\\n\\npackage Exported is\\n function Query (Data : chars_ptr; Size : access size_t)\\n return int;\\n pragma Export (C, Query, \\\"Query\\\");\\nend Exported;\\n\",\n \"language\": \"Ada\"\n },\n {\n \"code\": \"package body Exported is\\n function Query (Data : chars_ptr; Size : access size_t)\\n return int is\\n Result : char_array := \\\"Here am I\\\";\\n begin\\n if Size.all < Result'Length then\\n return 0;\\n else\\n Update (Data, 0, Result);\\n Size.all := Result'Length;\\n return 1;\\n end if;\\n end Query;\\nend Exported;\\n\",\n \"language\": \"Ada\"\n },\n {\n \"code\": \"gcc -c main.c\\ngnatmake -c exported.adb\\ngnatbind -n exported.ali\\ngnatlink exported.ali main.o -o main\\n\",\n \"language\": \"Ada\"\n },\n {\n \"code\": \"; Example: The following is a working script that displays a summary of all top-level windows.\\n\\n; For performance and memory conservation, call RegisterCallback() only once for a given callback:\\nif not EnumAddress ; Fast-mode is okay because it will be called only from this thread:\\n EnumAddress := RegisterCallback(\\\"EnumWindowsProc\\\", \\\"Fast\\\")\\n\\nDetectHiddenWindows On ; Due to fast-mode, this setting will go into effect for the callback too.\\n\\n; Pass control to EnumWindows(), which calls the callback repeatedly:\\nDllCall(\\\"EnumWindows\\\", UInt, EnumAddress, UInt, 0)\\nMsgBox %Output% ; Display the information accumulated by the callback.\\n\\nEnumWindowsProc(hwnd, lParam)\\n{\\n global Output\\n WinGetTitle, title, ahk_id %hwnd%\\n WinGetClass, class, ahk_id %hwnd%\\n if title\\n Output .= \\\"HWND: \\\" . hwnd . \\\"`tTitle: \\\" . title . \\\"`tClass: \\\" . class . \\\"`n\\\"\\n return true ; Tell EnumWindows() to continue until all windows have been enumerated.\\n}\\n\",\n \"language\": \"AutoHotkey\"\n },\n {\n \"code\": \"#if 0\\nI rewrote the driver according to good sense, my style,\\nand discussion.\\n\\nThis is file main.c on Autumn 2011 ubuntu linux release.\\nThe emacs compile command output:\\n\\n-*- mode: compilation; default-directory: \\\"/tmp/\\\" -*-\\nCompilation started at Mon Mar 12 20:25:27\\n\\nmake -k CFLAGS=-Wall main.o\\ncc -Wall -c -o main.o main.c\\n\\nCompilation finished at Mon Mar 12 20:25:27\\n#endif\\n\\n#include <stdio.h>\\n#include <stdlib.h>\\n\\nextern int Query(char *Data, unsigned *Length);\\n\\nint main(int argc, char *argv[]) {\\n char Buffer[1024], *pc;\\n unsigned Size = sizeof(Buffer);\\n if (!Query(Buffer, &Size))\\n fputs(\\\"failed to call Query\\\", stdout);\\n else\\n for (pc = Buffer; Size--; ++pc)\\n putchar(*pc);\\n putchar('\\\\n');\\n return EXIT_SUCCESS;\\n}\\n\",\n \"language\": \"C\"\n },\n {\n \"code\": \"#if 0\\nThis is file query.c\\n\\n-*- mode: compilation; default-directory: \\\"/tmp/\\\" -*-\\nCompilation started at Mon Mar 12 20:36:25\\n\\nmake -k CFLAGS=-Wall query.o\\ncc -Wall -c -o query.o query.c\\n\\nCompilation finished at Mon Mar 12 20:36:26\\n#endif\\n\\n#include<string.h>\\n\\nint Query(char *Data, unsigned *Length) {\\n const char *message = \\\"Here am I\\\";\\n unsigned n = strlen(message);\\n if (n <= *Length)\\n return strncpy(Data, message, (size_t)n), *Length = n, 1;\\n return 0;\\n}\\n\",\n \"language\": \"C\"\n },\n {\n \"code\": \"$ gcc main.c query.o -o main && ./main\\nHere am I\\n$\\n\",\n \"language\": \"C\"\n },\n {\n \"code\": \"#include <string>\\nusing std::string;\\n\\n// C++ functions with extern \\\"C\\\" can get called from C.\\nextern \\\"C\\\" int\\nQuery (char *Data, size_t *Length)\\n{\\n const string Message = \\\"Here am I\\\";\\n\\n // Check that Message fits in Data.\\n if (*Length < Message.length())\\n return false; // C++ converts bool to int.\\n\\n *Length = Message.length();\\n Message.copy(Data, *Length);\\n return true;\\n}\\n\",\n \"language\": \"C++\"\n },\n {\n \"code\": \"$ gcc -c main.c\\n$ g++ -c query.cpp\\n$ g++ -o main main.o query.o\\n$ ./main\\nHere am I\\n\",\n \"language\": \"C++\"\n },\n {\n \"code\": \" identification division.\\n program-id. Query.\\n\\n environment division.\\n configuration section.\\n special-names.\\n call-convention 0 is extern.\\n\\n repository.\\n function all intrinsic.\\n\\n data division.\\n working-storage section.\\n 01 query-result.\\n 05 filler value \\\"Here I am\\\".\\n\\n linkage section.\\n 01 data-reference.\\n 05 data-buffer pic x occurs 0 to 8192 times\\n depending on length-reference.\\n 01 length-reference usage binary-long.\\n\\n procedure division extern using data-reference length-reference.\\n\\n if length(query-result) less than or equal to length-reference\\n and length-reference less than 8193 then\\n move query-result to data-reference\\n move length(query-result) to length-reference\\n move 1 to return-code\\n end-if\\n\\n goback.\\n end program Query.\\n\",\n \"language\": \"COBOL\"\n },\n {\n \"code\": \"import core.stdc.string;\\n\\nextern(C) bool query(char *data, size_t *length) pure nothrow {\\n immutable text = \\\"Here am I\\\";\\n\\n if (*length < text.length) {\\n *length = 0; // Also clears length.\\n return false;\\n } else {\\n memcpy(data, text.ptr, text.length);\\n *length = text.length;\\n return true;\\n }\\n}\\n\",\n \"language\": \"D\"\n },\n {\n \"code\": \"#include <stdio.h>\\n#include <stdbool.h>\\n\\nextern bool query(char *data, size_t *length);\\n\\nint main() {\\n char buffer[1024];\\n size_t size = sizeof(buffer);\\n\\n if (query(buffer, &size))\\n printf(\\\"%.*s\\\\n\\\", size, buffer);\\n else\\n puts(\\\"The call to query has failed.\\\");\\n\\n return 0;\\n}\\n\",\n \"language\": \"D\"\n },\n {\n \"code\": \"function Query(Buffer: PChar; var Size: Int64): LongBool;\\nconst\\n Text = 'Hello World!';\\nbegin\\n If not Assigned(Buffer) Then\\n begin\\n Size := 0;\\n Result := False;\\n Exit;\\n end;\\n If Size < Length(Text) Then\\n begin\\n Size := 0;\\n Result := False;\\n Exit;\\n end;\\n\\n Size := Length(Text);\\n Move(Text[1], Buffer^, Size);\\n Result := True;\\nend;\\n\",\n \"language\": \"Delphi\"\n },\n {\n \"code\": \"!-----------------------------------------------------------------------\\n!Function\\n!-----------------------------------------------------------------------\\nfunction fortran_query(data, length) result(answer) bind(c, name='Query')\\n use, intrinsic :: iso_c_binding, only: c_char, c_int, c_size_t, c_null_char\\n implicit none\\n character(len=1,kind=c_char), dimension(length), intent(inout) :: data\\n integer(c_size_t), intent(inout) :: length\\n integer(c_int) :: answer\\n answer = 0\\n if(length<10) return\\n data = transfer(\\\"Here I am\\\"//c_null_char, data)\\n length = 10_c_size_t\\n answer = 1\\nend function fortran_query\\n\",\n \"language\": \"Fortran\"\n },\n {\n \"code\": \"#include <stdio.h>\\n#include \\\"_cgo_export.h\\\"\\n\\nvoid Run()\\n{\\n char Buffer [1024];\\n size_t Size = sizeof (Buffer);\\n\\n if (0 == Query (Buffer, &Size))\\n ...\\n\",\n \"language\": \"Go\"\n },\n {\n \"code\": \"package main\\n\\n// #include <stdlib.h>\\n// extern void Run();\\nimport \\\"C\\\"\\nimport \\\"unsafe\\\"\\n\\nfunc main() {\\n C.Run()\\n}\\n\\nconst msg = \\\"Here am I\\\"\\n\\n//export Query\\nfunc Query(cbuf *C.char, csiz *C.size_t) C.int {\\n if int(*csiz) <= len(msg) {\\n return 0\\n }\\n pbuf := uintptr(unsafe.Pointer(cbuf))\\n for i := 0; i < len(msg); i++ {\\n *((*byte)(unsafe.Pointer(pbuf))) = msg[i]\\n pbuf++\\n }\\n *((*byte)(unsafe.Pointer(pbuf))) = 0\\n *csiz = C.size_t(len(msg) + 1)\\n return 1\\n}\\n\",\n \"language\": \"Go\"\n },\n {\n \"code\": \"// This buildmode requires the package to be main\\npackage main\\n\\n// Import C so we can export the function to C and use C types\\n\\n//#include <stdlib.h> // for size_t\\nimport \\\"C\\\"\\n\\n// Import reflect and unsafe so we can wrap the C array in a Go slice\\nimport \\\"reflect\\\"\\nimport \\\"unsafe\\\"\\n\\n// This buildmode also requires a main function, but it is never actually called\\nfunc main() {}\\n\\n// The message to copy into the buffer\\nconst msg = \\\"Here am I\\\"\\n\\n// Here we declare the Query function using C types and export it to C\\n\\n//export Query\\nfunc Query(buffer *C.char, length *C.size_t) C.int {\\n // Check there is enough space in the buffer\\n if int(*length) < len(msg) {\\n return 0\\n }\\n\\n // Wrap the buffer in a slice to make it easier to copy into\\n sliceHeader := reflect.SliceHeader {\\n Data: uintptr(unsafe.Pointer(buffer)),\\n Len: len(msg),\\n Cap: len(msg),\\n }\\n bufferSlice := *(*[]byte)(unsafe.Pointer(&sliceHeader))\\n\\n // Iterate through the message and copy it to the buffer, byte by byte\\n for i:=0;i<len(msg);i++ {\\n bufferSlice[i] = msg[i]\\n }\\n\\n // Set length to the amount of bytes we copied\\n (*length) = C.size_t(len(msg))\\n\\n return 1\\n}\\n\",\n \"language\": \"Go\"\n },\n {\n \"code\": \"#ifdef __GLASGOW_HASKELL__\\n#include \\\"Called_stub.h\\\"\\nextern void __stginit_Called(void);\\n#endif\\n#include <stdio.h>\\n#include <HsFFI.h>\\n\\nint main (int argc, char * argv [])\\n{\\n char Buffer [1024];\\n size_t Size = sizeof (Buffer);\\n\\n hs_init(&argc, &argv);\\n#ifdef __GLASGOW_HASKELL__\\n hs_add_root(__stginit_Called);\\n#endif\\n\\n if (0 == query_hs (Buffer, &Size))\\n {\\n printf (\\\"failed to call Query\\\\n\\\");\\n }\\n else\\n {\\n char * Ptr = Buffer;\\n while (Size-- > 0) putchar (*Ptr++);\\n putchar ('\\\\n');\\n }\\n\\n hs_exit();\\n return 0;\\n}\\n\",\n \"language\": \"Haskell\"\n },\n {\n \"code\": \"{-# LANGUAGE ForeignFunctionInterface #-}\\n\\nmodule Called where\\n\\nimport Foreign\\nimport Foreign.C.String (CString, withCStringLen)\\nimport Foreign.C.Types\\n\\n-- place a string into the buffer pointed to by ptrBuff (with size\\n-- pointed to by ptrSize). If successful, sets number of overwritten\\n-- bytes in ptrSize and returns 1, otherwise, it does nothing and\\n-- returns 0\\nquery_hs :: CString -> Ptr CSize -> IO CInt\\nquery_hs ptrBuff ptrSize = withCStringLen \\\"Here I am\\\"\\n (\\\\(str, len) -> do\\n buffSize <- peek ptrSize\\n if sizeOf str > (fromIntegral buffSize)\\n then do\\n poke ptrSize 0\\n return 0\\n else do\\n poke ptrSize (fromIntegral len)\\n copyArray ptrBuff str len\\n return 1)\\n\\nforeign export ccall query_hs :: CString -> Ptr CSize -> IO CInt\\n\",\n \"language\": \"Haskell\"\n },\n {\n \"code\": \"ghc -c -O Called.hs\\n\",\n \"language\": \"Haskell\"\n },\n {\n \"code\": \"ghc -optc-O calling.c Called.o Called_stub.o -o calling\\n\",\n \"language\": \"Haskell\"\n },\n {\n \"code\": \"untyped __call__(\\\"functionName\\\", args);\\n\",\n \"language\": \"Haxe\"\n },\n {\n \"code\": \"query=:3 :'0&#^:(y < #)''Here am I'''\\n\",\n \"language\": \"J\"\n },\n {\n \"code\": \"#include<stdio.h>\\n#include<stdlib.h>\\n#include<string.h>\\n\\nint Query(char*,unsigned*);\\n\\nint main(int argc,char*argv[]) {\\n char Buffer[1024], *pc;\\n unsigned Size = (unsigned)sizeof(Buffer);\\n if (!Query(Buffer,&Size))\\n fputs(\\\"Failed to call Query\\\",stdout);\\n else\\n for (pc = Buffer; Size--; ++pc)\\n putchar(*pc);\\n putchar('\\\\n');\\n return EXIT_SUCCESS;\\n}\\n\",\n \"language\": \"J\"\n },\n {\n \"code\": \"// J Front End Example\\n// define _WIN32 for Windows, __MACH__ for MAC, J64 for 64-bit\\n// JE is loaded from current working directory\\n\\n//make jfex && LD_LIBRARY_PATH=/usr/local/j64-701/bin ./jfex\\n\\n#ifdef _WIN32\\n#define _CRT_SECURE_NO_WARNINGS\\n#include <windows.h>\\n#include <direct.h>\\n#define GETPROCADDRESS(h,p) GetProcAddress(h,p)\\n#define JDLLNAME \\\"\\\\\\\\j.dll\\\"\\n#else\\n#define _stdcall\\n#include <dlfcn.h>\\n#define GETPROCADDRESS(h,p)\\tdlsym(h,p)\\n#ifdef __MACH__\\n#define JDLLNAME \\\"/libj.dylib\\\"\\n#else\\n#define JDLLNAME \\\"/libj.so\\\"\\n#endif\\n#define _getcwd getcwd\\n#endif\\n\\n#include<stdio.h>\\n#include<signal.h>\\n#include<stdlib.h>\\n#include<string.h>\\n#include\\\"jfex.h\\\"\\n#include\\\"jlib.h\\\"\\n\\nstatic JDoType jdo;\\nstatic JFreeType jfree;\\nstatic JgaType jga;\\nstatic JGetLocaleType jgetlocale;\\n\\nstatic J jt;\\nstatic void* hjdll;\\n\\nstatic char **adadbreak;\\nstatic void sigint(int k){**adadbreak+=1;signal(SIGINT,sigint);}\\nstatic char input[1000];\\n\\n// J calls for input (debug suspension and 1!:1[1) and we call for input\\nchar* _stdcall Jinput(J jt,char* prompt)\\n{\\n fputs(prompt,stdout);\\n if(fgets(input, sizeof(input), stdin))\\n {\\n fputs(\\\"\\\\n\\\",stdout);\\n **adadbreak+=1;\\n }\\n return input;\\n}\\n\\nstatic char*buffer = NULL; /**************************************/\\nstatic unsigned length = 0; /**************************************/\\nstatic int Jouts = 0; /**************************************/\\n\\n// J calls for output\\n#define LINEFEED 10 /**************************************/\\nvoid _stdcall Joutput(J jt,int type, char* s) /********************/\\n{\\n size_t L;\\n if(MTYOEXIT==type) exit((int)(I)s);\\n L = strlen(s);\\n L -= (L && (LINEFEED==s[L-1])); /* CRLF not handled. */\\n if (L && (!Jouts)) {\\n length = L;\\n strncpy(buffer,s,L);\\n Jouts = 1;\\n }\\n}\\n\\nint Query(char*Data,unsigned*Length)\\n{\\n void* callbacks[] = {Joutput,NULL,Jinput,0,(void*)SMCON};\\n char pathdll[1000];\\n _getcwd(pathdll,sizeof(pathdll));\\n strcat(pathdll,JDLLNAME);\\n#ifdef _WIN32\\n hjdll=LoadLibraryA(pathdll);\\n#else\\n hjdll=dlopen(pathdll,RTLD_LAZY);\\n if (NULL == hjdll)\\n hjdll=dlopen(JDLLNAME+1,RTLD_LAZY); /* use LD_LIBRARY_PATH */\\n#endif\\n if(NULL == hjdll)\\n {\\n fprintf(stderr,\\\"Unix use: $ LD_LIBRARY_PATH=path/to/libj.so %s\\\\n\\\",\\\"programName\\\");//*argv);\\n fputs(\\\"Load library failed: \\\",stderr);\\n fputs(pathdll,stderr);\\n fputs(\\\"\\\\n\\\",stderr);\\n return 0; // load library failed\\n }\\n jt=((JInitType)GETPROCADDRESS(hjdll,\\\"JInit\\\"))();\\n if(!jt) return 0; // JE init failed\\n ((JSMType)GETPROCADDRESS(hjdll,\\\"JSM\\\"))(jt,callbacks);\\n jdo=(JDoType)GETPROCADDRESS(hjdll,\\\"JDo\\\");\\n jfree=(JFreeType)GETPROCADDRESS(hjdll,\\\"JFree\\\");\\n jga=(JgaType)GETPROCADDRESS(hjdll,\\\"Jga\\\");\\n jgetlocale=(JGetLocaleType)GETPROCADDRESS(hjdll,\\\"JGetLocale\\\");\\n adadbreak=(char**)jt; // first address in jt is address of breakdata\\n signal(SIGINT,sigint);\\n {\\n char input[999];\\n //memset(input,0,sizeof input);\\n buffer = Data;\\n sprintf(input,\\\"query %u [ 0!:110<'rc_embed.ijs'\\\\n\\\",*Length); /***deceptive input routine, a hard coded string*********/\\n jdo(jt,input);\\n if (!Jouts)\\n return 0;\\n *Length = length;\\n }\\n jfree(jt);\\n return 1;\\n}\\n\",\n \"language\": \"J\"\n },\n {\n \"code\": \"# jfe makefile info\\n# customize to create makefile suitable for your platform\\n# 32bit builds on 64bit systems require -m32 in CFLAGS and FLAGS\\n# Unix requires -ldl in FLAGS and Windows does not\\n\\nCPPFLAGS= -I/usr/local/j64-602/system/examples/jfe\\nCFLAGS= -O0 -g\\nLOADLIBES= -ldl\\n\\nmain: main.o Query.o\\n\",\n \"language\": \"J\"\n },\n {\n \"code\": \"$ make main && LD_LIBRARY_PATH=~/Downloads/jgplsrc/j/bin ./main\\nHere am I\\n$\\n\",\n \"language\": \"J\"\n },\n {\n \"code\": \"/* Query.java */\\npublic class Query {\\n public static boolean call(byte[] data, int[] length)\\n\\tthrows java.io.UnsupportedEncodingException\\n {\\n\\tString message = \\\"Here am I\\\";\\n\\tbyte[] mb = message.getBytes(\\\"utf-8\\\");\\n\\tif (length[0] < mb.length)\\n\\t return false;\\n\\tlength[0] = mb.length;\\n\\tSystem.arraycopy(mb, 0, data, 0, mb.length);\\n\\treturn true;\\n }\\n}\\n\",\n \"language\": \"Java\"\n },\n {\n \"code\": \"/* query-jni.c */\\n#include <stdio.h>\\n#include <stdlib.h>\\n#include <jni.h>\\n\\nstatic JavaVM *jvm = NULL;\\nstatic JNIEnv *jenv = NULL;\\n\\nstatic void die(const char *message) {\\n fprintf(stderr, \\\"%s\\\\n\\\", message);\\n exit(1);\\n}\\n\\nstatic void oom(void) {\\n die(\\\"Query: out of memory\\\");\\n}\\n\\nstatic void except(void) {\\n if ((*jenv)->ExceptionCheck(jenv))\\n\\tdie(\\\"Query: unexpected Java exception\\\");\\n}\\n\\nstatic void do_at_exit(void) {\\n (*jvm)->DestroyJavaVM(jvm);\\n}\\n\\nstatic void require_jvm(void) {\\n JavaVMInitArgs args;\\n\\n if (jvm)\\n\\treturn;\\n\\n args.version = JNI_VERSION_1_4;\\n args.nOptions = 0;\\n args.options = NULL;\\n args.ignoreUnrecognized = JNI_FALSE;\\n if (JNI_CreateJavaVM(&jvm, (void **)&jenv, &args) != JNI_OK)\\n\\tdie(\\\"Query: can't create Java VM\\\");\\n atexit(do_at_exit);\\n}\\n\\nint Query(char *data, size_t *length) {\\n jclass cQuery;\\n jmethodID mcall;\\n jintArray jlength;\\n jint jlength0;\\n jbyteArray jdata;\\n jboolean result;\\n\\n jlength0 = (jint)length[0];\\n if ((size_t)jlength0 != length[0])\\n\\tdie(\\\"Query: length is too large for Java array\\\");\\n\\n require_jvm();\\n\\n /* Create a local frame for references to Java objects. */\\n if ((*jenv)->PushLocalFrame(jenv, 16))\\n\\toom();\\n\\n /* Look for class Query, static boolean call(byte[], int[]) */\\n cQuery = (*jenv)->FindClass(jenv, \\\"Query\\\");\\n if (cQuery == NULL)\\n\\tdie(\\\"Query: can't find Query.class\\\");\\n mcall = (*jenv)->GetStaticMethodID(jenv, cQuery, \\\"call\\\", \\\"([B[I)Z\\\");\\n if (mcall == NULL)\\n\\tdie(\\\"Query: missing call() method\\\");\\n\\n /*\\n * Make arguments to Query.call(). We can't pass data[] and\\n * length[] to Java, so we make new Java arrays jdata[] and\\n * jlength[].\\n */\\n jdata = (*jenv)->NewByteArray(jenv, (jsize)jlength0);\\n if (jdata == NULL)\\n\\toom();\\n jlength = (*jenv)->NewIntArray(jenv, 1);\\n if (jlength == NULL)\\n\\toom();\\n\\n /* Set jlength[0] = length[0]. */\\n (*jenv)->SetIntArrayRegion(jenv, jlength, 0, 1, &jlength0);\\n except();\\n\\n /*\\n * Call our Java method.\\n */\\n result = (*jenv)->CallStaticBooleanMethod\\n\\t(jenv, cQuery, mcall, jdata, jlength);\\n except();\\n\\n /*\\n * Set length[0] = jlength[0].\\n * Copy length[0] bytes from jdata[] to data[].\\n */\\n (*jenv)->GetIntArrayRegion(jenv, jlength, 0, 1, &jlength0);\\n except();\\n length[0] = (size_t)jlength0;\\n (*jenv)->GetByteArrayRegion\\n\\t(jenv, jdata, 0, (jsize)jlength0, (jbyte *)data);\\n\\n /* Drop our local frame and its references. */\\n (*jenv)->PopLocalFrame(jenv, NULL);\\n\\n return (int)result;\\n}\\n\",\n \"language\": \"Java\"\n },\n {\n \"code\": \"# Makefile\\n\\n# Edit these lines to match your JDK.\\nJAVA_HOME = /Library/Java/Home\\nCPPFLAGS = -I$(JAVA_HOME)/include\\nLIBS = -framework JavaVM\\nJAVAC = $(JAVA_HOME)/bin/javac\\nCC = cc\\n\\nall: calljava Query.class\\n\\ncalljava: main.o query-jni.o\\n\\t$(CC) -o calljava main.o query-jni.o $(LIBS)\\n\\n.SUFFIXES: .c .class .java .o\\n.c.o:\\n\\t$(CC) $(CPPFLAGS) -c $<\\n.java.class:\\n\\t$(JAVAC) $<\\n\\nclean:\\n\\trm -f calljava main.o query-jni.o Query.class\\n\",\n \"language\": \"Java\"\n },\n {\n \"code\": \"// Kotlin Native v0.6\\n\\nimport kotlinx.cinterop.*\\nimport platform.posix.*\\n\\nfun query(data: CPointer<ByteVar>, length: CPointer<size_tVar>): Int {\\n val s = \\\"Here am I\\\"\\n val strLen = s.length\\n val bufferSize = length.pointed.value\\n if (strLen > bufferSize) return 0 // buffer not large enough\\n for (i in 0 until strLen) data[i] = s[i].toByte()\\n length.pointed.value = strLen.signExtend<size_t>()\\n return 1\\n}\\n\",\n \"language\": \"Kotlin\"\n },\n {\n \"code\": \"#ifndef KONAN_LIBQUERY_H\\n#define KONAN_LIBQUERY_H\\n#ifdef __cplusplus\\nextern \\\"C\\\" {\\n#endif\\ntypedef unsigned char libQuery_KBoolean;\\ntypedef char libQuery_KByte;\\ntypedef unsigned short libQuery_KChar;\\ntypedef short libQuery_KShort;\\ntypedef int libQuery_KInt;\\ntypedef long long libQuery_KLong;\\ntypedef float libQuery_KFloat;\\ntypedef double libQuery_KDouble;\\ntypedef void* libQuery_KNativePtr;\\nstruct libQuery_KType;\\ntypedef struct libQuery_KType libQuery_KType;\\n\\ntypedef struct {\\n /* Service functions. */\\n void (*DisposeStablePointer)(libQuery_KNativePtr ptr);\\n void (*DisposeString)(const char* string);\\n libQuery_KBoolean (*IsInstance)(libQuery_KNativePtr ref, const libQuery_KType* type);\\n\\n /* User functions. */\\n struct {\\n struct {\\n libQuery_KInt (*query)(void* data, void* length);\\n } root;\\n } kotlin;\\n} libQuery_ExportedSymbols;\\nextern libQuery_ExportedSymbols* libQuery_symbols(void);\\n#ifdef __cplusplus\\n} /* extern \\\"C\\\" */\\n#endif\\n#endif /* KONAN_LIBQUERY_H */\\n\",\n \"language\": \"Kotlin\"\n },\n {\n \"code\": \"#include <stdio.h>\\n#include <stdlib.h>\\n#include \\\"libQuery_api.h\\\"\\n\\nstatic int Query (char * Data, size_t * Length)\\n{\\n return libQuery_symbols() -> kotlin.root.query(Data, Length);\\n}\\n\\nint main (int argc, char * argv [])\\n{\\n char Buffer [1024];\\n size_t Size = sizeof (Buffer);\\n\\n if (0 == Query (Buffer, &Size))\\n {\\n printf (\\\"failed to call Query\\\\n\\\");\\n }\\n else\\n {\\n char * Ptr = Buffer;\\n while (Size-- > 0) putchar (*Ptr++);\\n putchar ('\\\\n');\\n }\\n}\\n\",\n \"language\": \"Kotlin\"\n },\n {\n \"code\": \"Section Header\\n\\n+ name := QUERY;\\n- external := `#define main _query_main`;\\n- external := `#define query Query`;\\n\\nSection External\\n\\n- query(buffer : NATIVE_ARRAY[CHARACTER], size : NATIVE_ARRAY[INTEGER]) : INTEGER <- (\\n + s : STRING_CONSTANT;\\n + len, result : INTEGER;\\n s := \\\"Here am I\\\";\\n len := s.count;\\n (len > size.item(0)).if {\\n result := 0;\\n } else {\\n 1.to len do { i : INTEGER;\\n buffer.put (s @ i) to (i - 1);\\n };\\n size.put len to 0;\\n result := 1;\\n };\\n result\\n);\\n\\nSection Public\\n\\n- main <- (\\n + buffer : NATIVE_ARRAY[CHARACTER];\\n + size : NATIVE_ARRAY[INTEGER];\\n query(buffer, size); // need this to pull the query() method\\n);\\n\",\n \"language\": \"Lisaac\"\n },\n {\n \"code\": \"TARGET=test_query\\n\\nall: $(TARGET)\\n\\n$(TARGET): main.o query.o\\n\\tgcc -o $@ main.o query.o\\n\\n.c.o:\\n\\tgcc -c $<\\n\\nquery.c: query.li\\n\\t-lisaac $<\\n\\nclean:\\n\\trm -f $(TARGET) *.o query.c\\n\",\n \"language\": \"Lisaac\"\n },\n {\n \"code\": \":- module query.\\n:- interface.\\n\\n:- pred query(string::in, string::out) is det.\\n\\n:- implementation.\\n\\nquery(_, \\\"Hello, world!\\\").\\n\\n:- pragma foreign_export(\\\"C\\\", query(in, out), \\\"query\\\").\\n\\n:- pragma foreign_decl(\\\"C\\\",\\n\\\"\\n#include <string.h>\\nint Query (char * Data, size_t * Length);\\n\\\").\\n:- pragma foreign_code(\\\"C\\\",\\n\\\"\\nint Query (char *Data, size_t *Length) {\\n MR_String input, result;\\n MR_allocate_aligned_string_msg(input, *Length, MR_ALLOC_ID);\\n memmove(input, Data, *Length);\\n query(input, &result);\\n *Length = strlen(result);\\n memmove(Data, result, *Length);\\n return 1;\\n}\\n\\\").\\n\",\n \"language\": \"Mercury\"\n },\n {\n \"code\": \"proc Query*(data: var array[1024, char], length: var cint): cint {.exportc.} =\\n const text = \\\"Here am I\\\"\\n if length < text.len:\\n return 0\\n\\n for i in 0 .. text.high:\\n data[i] = text[i]\\n length = text.len\\n return 1\\n\",\n \"language\": \"Nim\"\n },\n {\n \"code\": \"#include <stdio.h>\\n\\nextern int Query (char * Data, size_t * Length);\\n\\nint main (int argc, char * argv [])\\n{\\n char Buffer [1024];\\n size_t Size = sizeof (Buffer);\\n\\n if (0 == Query (Buffer, &Size))\\n {\\n printf (\\\"failed to call Query\\\\n\\\");\\n }\\n else\\n {\\n char * Ptr = Buffer;\\n while (Size-- > 0) putchar (*Ptr++);\\n putchar ('\\\\n');\\n }\\n}\\n\",\n \"language\": \"Nim\"\n },\n {\n \"code\": \"#include <stdio.h>\\n#include <string.h>\\n#include <caml/mlvalues.h>\\n#include <caml/callback.h>\\n\\nextern int Query (char * Data, size_t * Length)\\n{\\n static value * closure_f = NULL;\\n if (closure_f == NULL) {\\n closure_f = caml_named_value(\\\"Query function cb\\\");\\n }\\n value ret = caml_callback(*closure_f, Val_unit);\\n *Length = Int_val(Field(ret, 1));\\n strncpy(Data, String_val(Field(ret, 0)), *Length);\\n return 1;\\n}\\n\\nint main (int argc, char * argv [])\\n{\\n char Buffer [1024];\\n unsigned Size = 0;\\n\\n caml_main(argv); /* added from the original main */\\n\\n if (0 == Query (Buffer, &Size))\\n {\\n printf (\\\"failed to call Query\\\\n\\\");\\n }\\n else\\n {\\n char * Ptr = Buffer;\\n printf(\\\"size: %d\\\\n\\\", Size);\\n while (Size-- > 0) putchar (*Ptr++);\\n putchar ('\\\\n');\\n }\\n}\\n\",\n \"language\": \"OCaml\"\n },\n {\n \"code\": \"let caml_query () =\\n let s = \\\"Here am I\\\" in\\n (s, String.length s)\\n;;\\n\\nlet () =\\n Callback.register \\\"Query function cb\\\" caml_query;\\n;;\\n\",\n \"language\": \"OCaml\"\n },\n {\n \"code\": \"#include <extensions/embed.h>\\n\\n#define min(x,y) (x < y ? x : y)\\n\\nextern unsigned char repl[];\\nint Query(char *Data, size_t *Length) {\\n\\tol_t ol;\\n\\tembed_new(&ol, repl, 0);\\n\\n\\tword s = embed_eval(&ol, new_string(&ol,\\n\\t\\t\\\"(define sample \\\\\\\"Here am I\\\\\\\")\\\"\\n\\t\\t\\\"sample\\\"\\n\\t), 0);\\n\\tif (!is_string(s))\\n\\t\\tgoto fail;\\n\\n\\tint i = *Length = min(string_length(s), *Length);\\n\\n\\tmemcpy(Data, string_value(s), i);\\n\\t*Length = i;\\n\\n\\tOL_free(ol.vm);\\n\\treturn 1;\\nfail:\\n\\tOL_free(ol.vm);\\n\\treturn 0;\\n}\\n\",\n \"language\": \"Ol\"\n },\n {\n \"code\": \"#include <extensions/embed.h>\\n\\nextern unsigned char repl[];\\nint Query(char *Data, size_t *Length) {\\n\\tol_t ol;\\n\\tembed_new(&ol, repl, 0);\\n\\n\\tembed_eval(&ol, new_string(&ol,\\n\\t\\t\\\"(import (otus ffi))\\\"\\n\\t\\t\\\"(define lib (load-dynamic-library #f))\\\"\\n\\t\\t\\\"(define memcpy (lib fft-void* \\\\\\\"memcpy\\\\\\\" fft-void* type-string fft-int))\\\"\\n\\t\\t\\\"(define (Query Data Length)\\\"\\n\\t\\t\\\" (define sample (c-string \\\\\\\"Here am I\\\\\\\"))\\\"\\n\\t\\t\\\" (when (memcpy Data sample (min (string-length sample) Length))\\\"\\n\\t\\t\\\" (min (string-length sample) Length)))\\\"\\n\\t), 0);\\n\\tword r =\\n\\tembed_eval(&ol, new_string(&ol, \\\"Query\\\"), new_vptr(&ol, Data), make_integer(*Length), 0);\\n\\tif (!is_number(r))\\n\\t\\tgoto fail;\\n\\t*Length = ol2int(r);\\n\\t\\n\\tOL_free(ol.vm);\\n\\treturn 1;\\n\\nfail:\\n\\tOL_free(ol.vm);\\n\\treturn 0;\\n}\\n\",\n \"language\": \"Ol\"\n },\n {\n \"code\": \"Strchr(Vecsmall(apply(k->if(k>96&&k<123,(k-84)%26+97,if(k>64&&k<91,(k-52)%26+65,k)),Vec(Vecsmall(s)))))\\n\",\n \"language\": \"PARI-GP\"\n },\n {\n \"code\": \"#include <pari/pari.h>\\n\\n#define PARI_SECRET \\\"s=\\\\\\\"Urer V nz\\\\\\\";Strchr(Vecsmall(apply(k->if(k>96&&k<123,(k-84)%26+97,if(k>64&&k<91,(k-52)%26+65,k)),Vec(Vecsmall(s)))))\\\"\\n\\nint Query(char *Data, size_t *Length)\\n{\\n int rc = 0;\\n GEN result;\\n\\n pari_init(1000000, 2);\\n\\n result = geval(strtoGENstr(PARI_SECRET)); /* solve the secret */\\n\\n if (result) {\\n strncpy(Data, GSTR(result), *Length);\\t/* return secret */\\n rc = 1;\\n }\\n\\n pari_close();\\n\\n return rc;\\n}\\n\",\n \"language\": \"PARI-GP\"\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;\\\">-- (peek/poke, call_back)</span>\\n <span style=\\\"color: #008080;\\\">constant</span> <span style=\\\"color: #000000;\\\">Here_am_I</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #008000;\\\">\\\"Here am I\\\"</span>\\n <span style=\\\"color: #008080;\\\">function</span> <span style=\\\"color: #000000;\\\">Query</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: #000000;\\\">pLength</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #004080;\\\">integer</span> <span style=\\\"color: #000000;\\\">len</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">peekNS</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">pLength</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #7060A8;\\\">machine_word</span><span style=\\\"color: #0000FF;\\\">(),</span><span style=\\\"color: #000000;\\\">0</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #008080;\\\">if</span> <span style=\\\"color: #7060A8;\\\">poke_string</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">pData</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">len</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">Here_am_I</span><span style=\\\"color: #0000FF;\\\">)</span> <span style=\\\"color: #008080;\\\">then</span>\\n <span style=\\\"color: #008080;\\\">return</span> <span style=\\\"color: #000000;\\\">0</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">if</span>\\n <span style=\\\"color: #7060A8;\\\">pokeN</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">pLength</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #7060A8;\\\">length</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">Here_am_I</span><span style=\\\"color: #0000FF;\\\">)+</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #7060A8;\\\">machine_word</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 <span style=\\\"color: #008080;\\\">constant</span> <span style=\\\"color: #000000;\\\">Query_cb</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">call_back</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">Query</span><span style=\\\"color: #0000FF;\\\">)</span>\\n<!--\\n\",\n \"language\": \"Phix\"\n },\n {\n \"code\": \"(let (Str \\\"Here am I\\\" Len (format (opt))) # Get length from command line\\n (unless (>= (size Str) Len) # Check buffer size\\n (prinl Str) ) ) # Return string if OK\\n\",\n \"language\": \"PicoLisp\"\n },\n {\n \"code\": \"int Query(char *Data, size_t *Length) {\\n FILE *fp;\\n char buf[64];\\n\\n sprintf(buf, \\\"/usr/bin/picolisp query.l %d -bye\\\", *Length);\\n if (!(fp = popen(buf, \\\"r\\\")))\\n return 0;\\n fgets(Data, *Length, fp);\\n *Length = strlen(Data);\\n return pclose(fp) >= 0 && *Length != 0;\\n}\\n\",\n \"language\": \"PicoLisp\"\n },\n {\n \"code\": \"# store this in file rc_embed.py\\n# store this in file rc_embed.py\\ndef query(buffer_length):\\n message = b'Here am I'\\n L = len(message)\\n return message[0:L*(L <= buffer_length)]\\n\",\n \"language\": \"Python\"\n },\n {\n \"code\": \"#if 0\\n//I rewrote the driver according to good sense, my style,\\n//and discussion --Kernigh 15:45, 12 February 2011 (UTC).\\n#endif\\n\\n#include<stdio.h>\\n#include<stdlib.h>\\n#include<string.h>\\n\\nextern int Query(char*,unsigned*);\\n\\nint main(int argc,char*argv[]) {\\n char Buffer[1024], *pc;\\n unsigned Size = sizeof(Buffer);\\n if (!Query(Buffer,&Size))\\n fputs(\\\"Failed to call Query\\\",stdout);\\n else\\n for (pc = Buffer; Size--; ++pc)\\n putchar(*pc);\\n putchar('\\\\n');\\n return EXIT_SUCCESS;\\n}\\n\",\n \"language\": \"Python\"\n },\n {\n \"code\": \"#include<stdio.h>\\n#include<stdlib.h>\\n#include<string.h>\\n#include<Python.h>\\n\\nint Query(char*Data,unsigned*Length) {\\n char *module = \\\"rc_embed\\\", *function = \\\"query\\\";\\n PyObject *pName, *pModule, *pFunc, *pResult, *pArgs, *pLength;\\n long result = 0;\\n if (!Py_IsInitialized())\\n Py_Initialize();\\n pName = PyUnicode_FromString(module);\\n pModule = PyImport_Import(pName);\\n Py_DECREF(pName);\\n if (NULL == pModule) {\\n PyErr_Print();\\n fprintf(stderr,\\\"Failed to load \\\\\\\"%s\\\\\\\"\\\\n\\\",module);\\n return 0;\\n }\\n pFunc = PyObject_GetAttrString(pModule,function);\\n if ((NULL == pFunc) || (!PyCallable_Check(pFunc))) {\\n if (PyErr_Occurred())\\n PyErr_Print();\\n fprintf(stderr,\\\"Cannot find function \\\\\\\"%s\\\\\\\"\\\\n\\\",function);\\n if (NULL != pFunc)\\n Py_DECREF(pFunc);\\n Py_DECREF(pModule);\\n return 0;\\n }\\t\\n pArgs = PyTuple_New(1);\\n pLength = PyLong_FromUnsignedLong((unsigned long)(*Length));\\n if (NULL == pLength) {\\n Py_DECREF(pArgs);\\n Py_DECREF(pFunc);\\n Py_DECREF(pModule);\\n return 0;\\n }\\n PyTuple_SetItem(pArgs,0,pLength);\\n pResult = PyObject_CallObject(pFunc, pArgs);\\n if (NULL == pResult)\\n result = 0;\\n else if (!PyBytes_Check(pResult)) {\\n result = 0;\\n Py_DECREF(pResult);\\n } else {\\n if (! PyBytes_Size(pResult))\\n result = 0;\\n else {\\n *Length = (unsigned)PyBytes_Size(pResult);\\n strncpy(Data,PyBytes_AsString(pResult),*Length);\\n Py_DECREF(pResult);\\n result = 1;\\n }\\n }\\n Py_DECREF(pArgs);\\n Py_DECREF(pFunc);\\n Py_DECREF(pModule);\\n Py_Finalize();\\n return result;\\n}\\n\",\n \"language\": \"Python\"\n },\n {\n \"code\": \"$ make main.o\\ncc -c -o main.o main.c\\n$ D=$( dirname $( which python3 ) )\\n$ gcc $( $D/python3.2-config --cflags ) -c Query.c\\nIn file included from /usr/include/python3.2mu/Python.h:8:0,\\n from Q.c:18:\\n/usr/include/python3.2mu/pyconfig.h:1173:0: warning: \\\"_POSIX_C_SOURCE\\\" redefined [enabled by default]\\n/usr/include/features.h:214:0: note: this is the location of the previous definition\\n$ gcc -o main main.o Query.o $( $D/python3.2-config --ldflags )\\n$ ./main\\nHere am I\\n$\\n\",\n \"language\": \"Python\"\n },\n {\n \"code\": \"typedef int strfun (char * Data, size_t * Length);\\nstrfun *Query = NULL;\\n\",\n \"language\": \"Racket\"\n },\n {\n \"code\": \"#lang racket\\n\\n(require ffi/unsafe)\\n\\n(define xlib (ffi-lib \\\"./x.so\\\"))\\n\\n(set-ffi-obj! \\\"Query\\\" xlib (_fun _pointer _pointer -> _bool)\\n (λ(bs len)\\n (define out #\\\"Here I am\\\")\\n (let ([bs (make-sized-byte-string bs (ptr-ref len _int))])\\n (and ((bytes-length out) . <= . (bytes-length bs))\\n (begin (bytes-copy! bs 0 out)\\n (ptr-set! len _int (bytes-length out))\\n #t)))))\\n\\n((get-ffi-obj \\\"main\\\" xlib (_fun _int (_list i _bytes) -> _void))\\n 0 '())\\n\",\n \"language\": \"Racket\"\n },\n {\n \"code\": \"#!/usr/bin/env raku\\n\\nsub MAIN (Int :l(:len(:$length))) {\\n my Str $String = \\\"Here am I\\\";\\n $*OUT.print: $String if $String.codes ≤ $length\\n}\\n\",\n \"language\": \"Raku\"\n },\n {\n \"code\": \"#include<stdio.h>\\n#include<stddef.h>\\n#include<string.h>\\n\\nint Query(char *Data, size_t *Length) {\\n FILE *fp;\\n char buf[64];\\n\\n sprintf(buf, \\\"/home/user/query.raku --len=%zu\\\", *Length);\\n if (!(fp = popen(buf, \\\"r\\\")))\\n return 0;\\n fgets(Data, *Length, fp);\\n *Length = strlen(Data);\\n return pclose(fp) >= 0 && *Length != 0;\\n}\\n\",\n \"language\": \"Raku\"\n },\n {\n \"code\": \"# query.rb\\nrequire 'fiddle'\\n\\n# Look for a C variable named QueryPointer.\\n# Raise an error if it is missing.\\nc_var = Fiddle.dlopen(nil)['QueryPointer']\\n\\nint = Fiddle::TYPE_INT\\nvoidp = Fiddle::TYPE_VOIDP\\nsz_voidp = Fiddle::SIZEOF_VOIDP\\n\\n# Implement the C function\\n# int Query(void *data, size_t *length)\\n# in Ruby code. Store it in a global constant in Ruby (named Query)\\n# to protect it from Ruby's garbage collector.\\n#\\nQuery = Fiddle::Closure::BlockCaller\\n .new(int, [voidp, voidp]) do |datap, lengthp|\\n message = \\\"Here am I\\\"\\n\\n # We got datap and lengthp as Fiddle::Pointer objects.\\n # Read length, assuming sizeof(size_t) == sizeof(void *).\\n length = lengthp[0, sz_voidp].unpack('J').first\\n\\n # Does the message fit in length bytes?\\n if length < message.bytesize\\n 0 # failure\\n else\\n length = message.bytesize\\n datap[0, length] = message # Copy the message.\\n lengthp[0, sz_voidp] = [length].pack('J') # Update the length.\\n 1 # success\\n end\\nend\\n\\n# Set the C variable to our Query.\\nFiddle::Pointer.new(c_var)[0, sz_voidp] = [Query.to_i].pack('J')\\n\",\n \"language\": \"Ruby\"\n },\n {\n \"code\": \"/* query-rb.c */\\n#include <stdlib.h>\\n#include <ruby.h>\\n\\n/*\\n * QueryPointer() uses Ruby and may raise a Ruby error. Query() is a\\n * C wrapper around QueryPointer() that loads Ruby, sets QueryPointer,\\n * and protects against Ruby errors.\\n */\\nint (*QueryPointer)(char *, size_t *) = NULL;\\n\\nstatic int in_bad_exit = 0;\\n\\nstatic void\\ndo_at_exit(void)\\n{\\n RUBY_INIT_STACK;\\n\\n if (!in_bad_exit)\\n\\truby_cleanup(0);\\n}\\n\\nstatic void\\nbad_exit(int state)\\n{\\n in_bad_exit = 1;\\n ruby_stop(state); /* Clean up Ruby and exit the process. */\\n}\\n\\nstatic void\\nrequire_query(void)\\n{\\n static int done = 0;\\n int state;\\n\\n if (done)\\n\\treturn;\\n done = 1;\\n\\n ruby_init();\\n atexit(do_at_exit);\\n ruby_init_loadpath(); /* needed to require 'fiddle' */\\n\\n /* Require query.rb in current directory. */\\n rb_eval_string_protect(\\\"require_relative 'query'\\\", &state);\\n if (!state && !QueryPointer)\\n\\trb_eval_string_protect(\\\"fail 'missing QueryPointer'\\\", &state);\\n if (state)\\n\\tbad_exit(state); /* Ruby will report the error. */\\n}\\n\\nstruct args {\\n char *data;\\n size_t *length;\\n int result;\\n};\\n\\nstatic VALUE\\nQuery1(VALUE v) {\\n struct args *a = (struct args *)v;\\n a->result = QueryPointer(a->data, a->length);\\n return Qnil;\\n}\\n\\nint\\nQuery(char *data, size_t *length)\\n{\\n struct args a;\\n int state;\\n RUBY_INIT_STACK;\\n\\n require_query();\\n\\n /* Call QueryPointer(), protect against errors. */\\n a.data = data;\\n a.length = length;\\n rb_protect(Query1, (VALUE)&a, &state);\\n if (state)\\n\\tbad_exit(state);\\n return a.result;\\n}\\n\",\n \"language\": \"Ruby\"\n },\n {\n \"code\": \"# Rakefile\\n\\n# To build and run:\\n# $ rake\\n# $ ./callruby\\n\\n# Must link with cc -Wl,-E so query.c exports QueryPointer.\\nCC = ENV.fetch('CC', 'cc')\\nLDFLAGS = '-Wl,-E'\\nCPPFLAGS = RbConfig.expand('-I$(rubyarchhdrdir) -I$(rubyhdrdir)')\\nLIBS = RbConfig.expand('$(LIBRUBYARG) $(LIBS)')\\n\\ntask 'default' => 'callruby'\\n\\ndesc 'compiles callruby'\\nfile 'callruby' => %w[main.o query-rb.o] do |t|\\n sh \\\"#{CC} #{LDFLAGS} -o #{t.name} #{t.sources.join(' ')} #{LIBS}\\\"\\nend\\n\\nrule '.o' => %w[.c] do |t|\\n sh \\\"#{CC} #{CPPFLAGS} -o #{t.name} -c #{t.source}\\\"\\nend\\n\\ndesc 'removes callruby and .o files'\\ntask 'clean' do\\n rm_f %w[callruby main.o query-rb.o]\\nend\\n\",\n \"language\": \"Ruby\"\n },\n {\n \"code\": \"//! In order to run this task, you will need to compile the C program locating in the task linked\\n//! above. The C program will need to be linked with the library produced by this file.\\n//!\\n//! 1. Compile this library:\\n//!\\n//! ```bash\\n//! $ cargo build --release\\n//! ```\\n//!\\n//! 2. Copy the C program into query.c.\\n//! 3. Compile and link the C program with the produced library:\\n//!\\n//! ```bash\\n//! $ LD_LIBRARY_PATH=/path/to/library gcc query.c -o query -Wall -Werror libquery\\n//! ```\\n//! 4. Run the resulting binary.\\n//!\\n//! ```bash\\n//! $ LD_LIBRARY_PATH=/path/to/library ./query\\n//! Here am I\\n//! ```\\n\\n#![crate_type = \\\"cdylib\\\"]\\n\\nextern crate libc;\\n\\nuse std::ffi::CString;\\n\\nuse libc::{c_char, c_int, size_t};\\n\\n#[no_mangle]\\n#[allow(non_snake_case)]\\n#[allow(clippy::missing_safety_doc)]\\npub unsafe extern \\\"C\\\" fn Query(data: *mut c_char, length: *mut size_t) -> c_int {\\n let string = \\\"Here am I\\\";\\n if *length + 1 < string.len() {\\n 0\\n } else {\\n let c_string = CString::new(string).unwrap();\\n libc::strcpy(data, c_string.as_ptr());\\n *length = string.len();\\n 1\\n }\\n}\\n\",\n \"language\": \"Rust\"\n },\n {\n \"code\": \"/* Query.scala */\\nobject Query {\\n def call(data: Array[Byte], length: Array[Int]): Boolean = {\\n val message = \\\"Here am I\\\"\\n val mb = message.getBytes(\\\"utf-8\\\")\\n if (length(0) >= mb.length) {\\n length(0) = mb.length\\n System.arraycopy(mb, 0, data, 0, mb.length)\\n true\\n } else false\\n }\\n}\\n\",\n \"language\": \"Scala\"\n },\n {\n \"code\": \"/* query-jni.c */\\n#include <stdio.h>\\n#include <stdlib.h>\\n#include <jni.h>\\n\\nstatic JavaVM *jvm = NULL;\\nstatic JNIEnv *jenv = NULL;\\n\\nstatic void die(const char *message) {\\n fprintf(stderr, \\\"%s\\\\n\\\", message);\\n exit(1);\\n}\\n\\nstatic void oom(void) {\\n die(\\\"Query: out of memory\\\");\\n}\\n\\nstatic void except(void) {\\n if ((*jenv)->ExceptionCheck(jenv))\\n\\tdie(\\\"Query: unexpected Java exception\\\");\\n}\\n\\nstatic void do_at_exit(void) {\\n (*jvm)->DestroyJavaVM(jvm);\\n}\\n\\nstatic void require_jvm(void) {\\n JavaVMInitArgs args;\\n\\n if (jvm)\\n\\treturn;\\n\\n args.version = JNI_VERSION_1_4;\\n args.nOptions = 0;\\n args.options = NULL;\\n args.ignoreUnrecognized = JNI_FALSE;\\n if (JNI_CreateJavaVM(&jvm, (void **)&jenv, &args) != JNI_OK)\\n\\tdie(\\\"Query: can't create Java VM\\\");\\n atexit(do_at_exit);\\n}\\n\\nint Query(char *data, size_t *length) {\\n jclass cQuery;\\n jmethodID mcall;\\n jintArray jlength;\\n jint jlength0;\\n jbyteArray jdata;\\n jboolean result;\\n\\n jlength0 = (jint)length[0];\\n if ((size_t)jlength0 != length[0])\\n\\tdie(\\\"Query: length is too large for Scala array\\\");\\n\\n require_jvm();\\n\\n /* Create a local frame for references to Scala objects. */\\n if ((*jenv)->PushLocalFrame(jenv, 16))\\n\\toom();\\n\\n /* Look for class Query, static boolean call(byte[], int[]) */\\n cQuery = (*jenv)->FindClass(jenv, \\\"Query\\\");\\n if (cQuery == NULL)\\n\\tdie(\\\"Query: can't find Query.class\\\");\\n mcall = (*jenv)->GetStaticMethodID(jenv, cQuery, \\\"call\\\", \\\"([B[I)Z\\\");\\n if (mcall == NULL)\\n\\tdie(\\\"Query: missing call() method\\\");\\n\\n /*\\n * Make arguments to Query.call(). We can't pass data[] and\\n * length[] to Scala, so we make new Scala arrays jdata[] and\\n * jlength[].\\n */\\n jdata = (*jenv)->NewByteArray(jenv, (jsize)jlength0);\\n if (jdata == NULL)\\n\\toom();\\n jlength = (*jenv)->NewIntArray(jenv, 1);\\n if (jlength == NULL)\\n\\toom();\\n\\n /* Set jlength[0] = length[0]. */\\n (*jenv)->SetIntArrayRegion(jenv, jlength, 0, 1, &jlength0);\\n except();\\n\\n /*\\n * Call our Scala method.\\n */\\n result = (*jenv)->CallStaticBooleanMethod\\n\\t(jenv, cQuery, mcall, jdata, jlength);\\n except();\\n\\n /*\\n * Set length[0] = jlength[0].\\n * Copy length[0] bytes from jdata[] to data[].\\n */\\n (*jenv)->GetIntArrayRegion(jenv, jlength, 0, 1, &jlength0);\\n except();\\n length[0] = (size_t)jlength0;\\n (*jenv)->GetByteArrayRegion\\n\\t(jenv, jdata, 0, (jsize)jlength0, (jbyte *)data);\\n\\n /* Drop our local frame and its references. */\\n (*jenv)->PopLocalFrame(jenv, NULL);\\n\\n return (int)result;\\n}\\n\",\n \"language\": \"Scala\"\n },\n {\n \"code\": \"# Makefile\\n\\n# Edit these lines to match your JDK.\\nJAVA_HOME = /Library/Java/Home\\nCPPFLAGS = -I$(JAVA_HOME)/include\\nLIBS = -framework JavaVM\\nJAVAC = $(JAVA_HOME)/bin/javac\\nCC = cc\\n\\nall: calljava Query.class\\n\\ncalljava: main.o query-jni.o\\n\\t$(CC) -o calljava main.o query-jni.o $(LIBS)\\n\\n.SUFFIXES: .c .class .java .o\\n.c.o:\\n\\t$(CC) $(CPPFLAGS) -c $<\\n.java.class:\\n\\t$(JAVAC) $<\\n\\nclean:\\n\\trm -f calljava main.o query-jni.o Query.class\\n\",\n \"language\": \"Scala\"\n },\n {\n \"code\": \"int Query (char * Data, size_t * Length) {\\n Tcl_Obj *arguments[2];\\n int code;\\n\\n arguments[0] = Tcl_NewStringObj(\\\"Query\\\", -1); /* -1 for \\\"use up to zero byte\\\" */\\n arguments[1] = Tcl_NewStringObj(Data, Length);\\n Tcl_IncrRefCount(arguments[0]);\\n Tcl_IncrRefCount(arguments[1]);\\n if (Tcl_EvalObjv(interp, 2, arguments, 0) != TCL_OK) {\\n /* Was an error or other exception; report here... */\\n Tcl_DecrRefCount(arguments[0]);\\n Tcl_DecrRefCount(arguments[1]);\\n return 0;\\n }\\n Tcl_DecrRefCount(arguments[0]);\\n Tcl_DecrRefCount(arguments[1]);\\n if (Tcl_GetObjResult(NULL, Tcl_GetObjResult(interp), &code) != TCL_OK) {\\n /* Not an integer result */\\n return 0;\\n }\\n return code;\\n}\\n\",\n \"language\": \"Tcl\"\n },\n {\n \"code\": \"proc Query data {\\n puts \\\"Query was $data\\\"\\n return 1;\\n}\\n\",\n \"language\": \"Tcl\"\n },\n {\n \"code\": \"int Query (char * Data, size_t * Length) {\\n const char *str;\\n int len;\\n\\n if (Tcl_Eval(interp, \\\"Query\\\") != TCL_OK) {\\n return 0;\\n }\\n str = Tcl_GetStringFromObj(Tcl_GetObjResult(interp), &len);\\n if (len+1 > Length) {\\n return 0;\\n }\\n memcpy(Data, str, len+1);\\n return 1;\\n}\\n\",\n \"language\": \"Tcl\"\n },\n {\n \"code\": \"proc Query {} {\\n return \\\"Here am I\\\"\\n}\\n\",\n \"language\": \"Tcl\"\n },\n {\n \"code\": \"#include <tcl.h>\\nTcl_Interp *interp;\\n\\nint main(int argc, char **argv) {\\n Tcl_FindExecutable(argv[0]); /* Initializes library */\\n interp = Tcl_CreateInterp(); /* Make an interpreter */\\n\\n /* Rest of contents of main() from task header... */\\n}\\n\",\n \"language\": \"Tcl\"\n },\n {\n \"code\": \"#include <stdio.h>\\n\\nint query(int (*callback)(char *, size_t *))\\n{\\n char buffer[1024];\\n size_t size = sizeof buffer;\\n\\n if (callback(buffer, &size) == 0) {\\n puts(\\\"query: callback failed\\\");\\n } else {\\n char *ptr = buffer;\\n\\n while (size-- > 0)\\n putchar (*ptr++);\\n putchar('\\\\n');\\n }\\n}\\n\",\n \"language\": \"TXR\"\n },\n {\n \"code\": \"gcc -g -fPIC query.c -c\\ngcc -g --shared query.c -o query.c\\n\",\n \"language\": \"TXR\"\n },\n {\n \"code\": \"(with-dyn-lib \\\"./query.so\\\"\\n (deffi query \\\"query\\\" void (closure)))\\n\\n(deffi-cb query-cb int ((carray char) (ptr (array 1 size-t))))\\n\\n(query (query-cb (lambda (buf sizeptr)\\n (symacrolet ((size [sizeptr 0]))\\n (let* ((s \\\"Here am I\\\")\\n (l (length s)))\\n (cond\\n ((> l size) 0)\\n (t (carray-set-length buf size)\\n (carray-put buf s)\\n (set size l))))))))\\n\",\n \"language\": \"TXR\"\n },\n {\n \"code\": \"(with-dyn-lib \\\"./query.so\\\"\\n (deffi query \\\"query\\\" void (closure)))\\n\\n(with-dyn-lib nil\\n (deffi memcpy \\\"memcpy\\\" cptr (cptr str size-t)))\\n\\n(deffi-cb query-cb int (cptr (ptr (array 1 size-t))))\\n\\n(query (query-cb (lambda (buf sizeptr) ; int lambda(void *buf, siz\\n (symacrolet ((size [sizeptr 0])) ; { #define size sizeptr[0]\\n (let* ((s \\\"Here am I\\\") ; char *s = \\\"Here am I\\\";\\n (l (length s))) ; size_t l = strlen(s);\\n (cond ; if (length > size)\\n ((> l size) 0) ; { return 0; } else\\n (t (memcpy buf s l) ; { memcpy(buf, s, l);\\n (set size l)))))))) ; return size = l; } }\\n\",\n \"language\": \"TXR\"\n },\n {\n \"code\": \"(deffi-cb query-cb int (cptr (ptr (array 1 size-t))) -1)\\n\",\n \"language\": \"TXR\"\n },\n {\n \"code\": \"/* Use_another_language_to_call_a_function.wren */\\n\\nclass RCQuery {\\n // Both arguments are lists as we need pass by reference here\\n static query(Data, Length) {\\n var s = \\\"Here am I\\\"\\n var sc = s.count\\n if (sc > Length[0]) return 0 // buffer too small\\n for (i in 0...sc) Data[i] = s[i].bytes[0]\\n Length[0] = sc\\n return 1\\n }\\n}\\n\",\n \"language\": \"Wren\"\n },\n {\n \"code\": \"/* gcc Use_another_language_to_call_a_function.c -o Use_another_language_to_call_a_function -lwren -lm */\\n\\n#include <stdio.h>\\n#include \\\"wren.h\\\"\\n\\nchar *script;\\nWrenVM * vm;\\n\\nWrenForeignMethodFn bindForeignMethod(\\n WrenVM* vm,\\n const char* module,\\n const char* className,\\n bool isStatic,\\n const char* signature) {\\n return NULL; // nothing needed here\\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 configWrenVM() {\\n WrenConfiguration config;\\n wrenInitConfiguration(&config);\\n config.writeFn = &writeFn;\\n config.errorFn = &errorFn;\\n config.bindForeignMethodFn = &bindForeignMethod;\\n vm = wrenNewVM(&config);\\n const char* module = \\\"main\\\";\\n const char* fileName = \\\"Use_another_language_to_call_a_function.wren\\\";\\n 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 return -1;\\n case WREN_RESULT_RUNTIME_ERROR:\\n printf(\\\"Runtime Error!\\\\n\\\");\\n return -1;\\n case WREN_RESULT_SUCCESS:\\n break;\\n }\\n return 0;\\n}\\n\\nint Query(char *Data, size_t *Length) {\\n int i, r;\\n wrenEnsureSlots(vm, 4);\\n\\n // create list for Data, fill with zeros and put in slot 1\\n wrenSetSlotNewList(vm, 1);\\n wrenSetSlotDouble(vm, 2, 0.0);\\n for (i = 0; i < *Length; ++i) wrenInsertInList(vm, 1, i, 2);\\n\\n // create list for Length and put in slot 2\\n wrenSetSlotNewList(vm, 2);\\n wrenSetSlotDouble(vm, 3, (double)*Length);\\n wrenInsertInList(vm, 2, 0, 3);\\n\\n // get handle to Wren's query method\\n WrenHandle* method = wrenMakeCallHandle(vm, \\\"query(_,_)\\\");\\n\\n // get its class and put in slot 0\\n wrenGetVariable(vm, \\\"main\\\", \\\"RCQuery\\\", 0);\\n\\n // call the Wren method\\n wrenCall(vm, method);\\n\\n // get the result and check it's 1\\n r = (int)wrenGetSlotDouble(vm, 0);\\n if (r) {\\n // get the length of the string from slot 2\\n wrenGetListElement(vm, 2, 0, 3);\\n *Length = (int)wrenGetSlotDouble(vm, 3);\\n\\n // copy the bytes from the list in slot 1 to the C buffer\\n for (i = 0; i < *Length; ++i) {\\n wrenGetListElement(vm, 1, i, 3);\\n Data[i] = (char)wrenGetSlotDouble(vm, 3);\\n }\\n }\\n return r;\\n}\\n\\nint main() {\\n int e = configWrenVM();\\n if (!e) {\\n char Buffer [1024];\\n size_t Size = sizeof(Buffer);\\n if (0 == Query(Buffer, &Size)) {\\n printf (\\\"failed to call Query\\\\n\\\");\\n e = 1;\\n } else {\\n char * Ptr = Buffer;\\n while (Size-- > 0) putchar (*Ptr++);\\n putchar ('\\\\n');\\n }\\n }\\n wrenFreeVM(vm);\\n free(script);\\n return e;\\n}\\n\",\n \"language\": \"Wren\"\n },\n {\n \"code\": \"option casemap:none\\n\\n\\nstrlen proto :qword\\nstrncpy proto :qword, :qword, :dword\\n\\nQuery proto :qword, :qword\\n\\n.data\\nszstr db \\\"Here am I\\\",0\\n\\n.code\\nQuery proc Data:qword, len:qword\\n local d:qword, l:qword, s:dword\\n\\n mov d, Data\\n mov l, len\\n invoke strlen, addr szstr\\n .if rax <= l\\n mov s, eax\\n invoke strncpy, d, addr szstr, s\\n mov eax, s\\n mov rax, l\\n mov dword ptr [rax], ecx\\n mov rax, 1\\n ret\\n .endif\\n mov rax, 0\\n ret\\nQuery endp\\nend\\n\",\n \"language\": \"X86-64-Assembly\"\n },\n {\n \"code\": \"section .data\\nszmsg db \\\"Here I am\\\",0\\n\\nsection .text\\n global Query\\n\\n strlen:\\n push rbp\\n mov rbp, rsp\\n mov rsi, rdi\\n mov rcx, -1\\n _1:\\n inc rcx\\n cmp byte [rsi+rcx], 0\\n jne _1\\n mov rax, rcx\\n pop rbp\\n ret\\n\\n Query:\\n push rbp\\n mov rbp, rsp\\n ;;mov r9, rcx ;;Arg 1, windows\\n ;;mov r8, rdx ;;Arg 2, windows\\n mov r9, rdi ;;Arg 1, Linux\\n mov r8, rsi ;;Arg 2, Linux\\n lea rdi, szmsg\\n call strlen\\n cmp rax, r8\\n jg _err\\n mov r10d, eax\\n mov rdi, r9\\n lea rsi, szmsg\\n rep movsb\\n mov rax, r8\\n mov dword [rax], r10d\\n jmp _exit\\n\\n _err:\\n mov rax, 0\\n\\n _exit:\\n pop rbp\\n ret\\n\",\n \"language\": \"X86-64-Assembly\"\n },\n {\n \"code\": \"const std = @import(\\\"std\\\");\\n\\nexport fn Query(Data: [*c]u8, Length: *usize) callconv(.C) c_int {\\n const value = \\\"Here I am\\\";\\n\\n if (Length.* >= value.len) {\\n @memcpy(@ptrCast([*]u8, Data), value, value.len);\\n Length.* = value.len;\\n return 1;\\n }\\n\\n return 0;\\n}\\n\",\n \"language\": \"Zig\"\n },\n {\n \"code\": \"// query.c\\n// export zklRoot=/home/ZKL\\n// clang query.c -I $zklRoot/VM -L $zklRoot/Lib -lzkl -pthread -lncurses -o query\\n// LD_LIBRARY_PATH=$zklRoot/Lib ./query\\n\\n#include <stdio.h>\\n#include <string.h>\\n\\n#include \\\"zklObject.h\\\"\\n#include \\\"zklImports.h\\\"\\n#include \\\"zklClass.h\\\"\\n#include \\\"zklFcn.h\\\"\\n#include \\\"zklString.h\\\"\\n\\nint query(char *buf, size_t *sz)\\n{\\n Instance *r;\\n pVM vm;\\n MLIST(mlist,10);\\n\\n // Bad practice: not protecting things from the garbage collector\\n\\n // build the call parameters: (\\\"query.zkl\\\",False,False,True)\\n mlistBuild(mlist,stringCreate(\\\"query.zkl\\\",I_OWNED,NoVM),\\n BoolFalse,BoolFalse,BoolTrue,ZNIL);\\n // Import is in the Vault, a store of useful stuff\\n // We want to call TheVault.Import.import(\\\"query.zkl\\\",False,False,True)\\n // which will load/compile/run query.zkl\\n r = fcnRunith(\\\"Import\\\",\\\"import\\\",(Instance *)mlist,NoVM);\\n // query.zkl is a class with a var that has the query result\\n r = classFindVar(r,\\\"query\\\",0,NoVM); // -->the var contents\\n strcpy(buf,stringText(r)); // decode the string into a char *\\n *sz = strlen(buf); // screw overflow checking\\n return 1;\\n}\\n\\nint main(int argc, char* argv[])\\n{\\n char buf[100];\\n size_t sz = sizeof(buf);\\n\\n zklConstruct(argc,argv);\\t// initialize the zkl shared library\\n query(buf,&sz);\\n printf(\\\"Query() --> \\\\\\\"%s\\\\\\\"\\\\n\\\",buf);\\n\\n return 0;\\n}\\n\",\n \"language\": \"Zkl\"\n },\n {\n \"code\": \"// query.zkl\\nvar query=\\\"Here am I\\\";\\n\",\n \"language\": \"Zkl\"\n }\n]","isConversational":false},"task_name":{"kind":"string","value":"Use-another-language-to-call-a-function"}}},{"rowIdx":1791,"cells":{"solutions":{"kind":"list like","value":[{"code":"---\ncategory:\n- GUI\n- Basic language learning\nfrom: http://rosettacode.org/wiki/User_input/Graphical\nnote: Text processing\nrequires:\n- Graphics\n","language":"00-META"},{"code":"In this task, the goal is to input a string and the integer 75000, from [[graphical user interface]].\n\n\nSee also: [[User input/Text]]\n<br><br>\n\n","language":"00-TASK"},{"code":"/* ARM assembly AARCH64 Raspberry PI 3B */\n/* program inputWin64.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 YPOSTEXTINPUT, 18\n.equ LGBUFFER, 50\n.equ FONTSIZE, 6\n/* constantes X11 */\n.equ KeyPressed, 2\n.equ ButtonPress, 4\n.equ ButtonPress, 4\n.equ EnterNotify, 7\n.equ LeaveNotify, 8\n.equ ClientMessage, 33\n.equ KeyPressMask, 1\n.equ ButtonPressMask, 4\n.equ ButtonReleaseMask, 8\n.equ ExposureMask, 1<<15\n.equ StructureNotifyMask, 1<<17\n.equ EnterWindowMask, 1<<4\n.equ LeaveWindowMask, 1<<5\n\n.equ CWBorderWidth, 1<<4\n\n\n/* structures descriptions are in end oh this program */\n\n/*******************************************/\n/* Initialized data */\n/*******************************************/\n.data\nszRetourligne: .asciz \"\\n\"\nszMessErreur: .asciz \"Server X11 not found.\\n\"\nszMessErrfen: .asciz \"Error create X11 window.\\n\"\nszMessErrGC: .asciz \"Error create Graphic Context.\\n\"\nszMessErrButton: .asciz \"Error create button.\\n\"\nszMessErrButtonGC: .asciz \"Error create button Graphic Context.\\n\"\nszMessErrInput: .asciz \"Error create input window.\\n\"\nszMessErrInputGC: .asciz \"Error create input Graphic Context.\\n\"\n//szMessGoodBye: .asciz \"There have been no clicks yet\"\nszCursor: .asciz \"_\"\nszTextButton: .asciz \"PUSH\"\nszMessResult: .asciz \"Text : @ Value @ \"\nszLibText: .asciz \"Text :\"\nszLibValue: .asciz \"Value : \"\n\nszLibDW: .asciz \"WM_DELETE_WINDOW\" // message close window\n\n/*******************************************/\n/* UnInitialized data */\n/*******************************************/\n.bss\n.align 4\nqDisplay: .skip 8 // Display address\nqDefScreen: .skip 8 // Default screen address\nidentWin: .skip 8 // window ident\nqCounterClic: .skip 8 // counter clic button\n//qLongTexte: .skip 8\n//ptZoneS: .skip 8 // pointeur zone saisie\nptMessage: .skip 8 // final message pointer\nsZoneConv: .skip 24\nwmDeleteMessage: .skip 16 // ident close message\nstEvent: .skip 400 // provisional size\n\nstButton: .skip BT_fin\nbuffer: .skip 500\nstInputText: .skip Input_fin\nstInputValue: .skip Input_fin\nstWindowChge: .skip XWCH_fin\nsSaisieCar: .skip LGBUFFER\nsTexteSaisi: .skip LGBUFFER\nsValueSaisi: .skip LGBUFFER\nkey: .skip 4 // code touche\n/**********************************************/\n/* -- Code section */\n/**********************************************/\n.text\n.global main // program entry\nmain: // INFO: main\n mov x0,#0 // open server X\n bl XOpenDisplay\n cmp x0,#0\n beq erreur\n // Ok return Display address\n ldr x1,qAdrqDisplay\n str x0,[x1] // store Display address for future use\n mov x28,x0 // and in register 28\n\n ldr x2,[x28,Disp_default_screen] // load default screen\n ldr x1,qAdrqDefScreen\n str x2,[x1] //store default_screen\n mov x2,x28\n ldr x0,[x2,Disp_screens] // screen list\n //screen areas\n ldr x5,[x0,Screen_white_pixel] // white pixel\n ldr x3,[x0,Screen_black_pixel] // black pixel\n ldr x4,[x0,Screen_root_depth] // bits par pixel\n ldr x1,[x0,Screen_root] // root windows\n // create window x11\n mov x0,x28 //display\n mov x2,#0 // position X\n mov x3,#0 // position Y\n mov x4,600 // weight\n mov x5,400 // height\n mov x6,0 // bordure ???\n ldr x7,0 // ?\n ldr x8,qBlanc // background\n str x8,[sp,-16]! // argument fot stack\n bl XCreateSimpleWindow\n add sp,sp,16 // for stack alignement\n cmp x0,#0 // error ?\n beq erreurF\n ldr x1,qAdridentWin\n str x0,[x1] // store window ident for future use\n mov x27,x0 // and in register 27\n\n // Correction of window closing error\n mov x0,x28 // Display address\n ldr x1,qAdrszLibDW // atom name address\n mov x2,#1 // False create atom if not exist\n bl XInternAtom\n cmp x0,#0\n ble erreurF\n ldr x1,qAdrwmDeleteMessage // address message\n str x0,[x1]\n mov x2,x1 // address atom create\n mov x0,x28 // display address\n mov x1,x27 // window ident\n mov x3,#1 // number of protocoles\n bl XSetWMProtocols\n cmp x0,#0\n ble erreurF\n // authorization of seizures\n mov x0,x28 // display address\n mov x1,x27 // window ident\n ldr x2,qFenetreMask // mask\n bl XSelectInput\n cmp x0,#0\n ble 99f\n // create Graphic Context\n mov x0,x28 // display address\n mov x1,x27 // window ident\n bl createGC // GC address -> x26\n cbz x0,erreurF\n // create Graphic Context 1\n mov x0,x28 // display address\n mov x1,x27 // window ident\n bl createGC1 // GC address -> x25\n cbz x0,erreurF\n // Display window\n mov x1,x27 // ident window\n mov x0,x28 // Display address\n bl XMapWindow\n\n ldr x0,qAdrszLibText\n mov x1,x27\n mov x2,5\n mov x3,70\n bl displayText\n ldr x0,qAdrszLibValue\n mov x1,x27\n mov x2,280\n mov x3,70\n bl displayText\n bl createButton // create button on screen\n\n bl createInputText // create input text window\n\n bl createInputValue // create input value window\n\n1: // events loop\n bl traitEvents\n // other events\n cbz x0,1b // and loop\n //TODO: close ??\n mov x0,0 // end Ok\n b 100f\n //TODO: close ??\n\n3:\n ldr x0,qAdrstEvent // events structure address\n bl evtButtonMouse\n b 1b\n\nerreurF: // error create window\n ldr x0,qAdrszMessErrfen\n bl affichageMess\n mov x0,1\n b 100f\nerreur: // error no server x11 active\n ldr x0,qAdrszMessErreur\n bl affichageMess\n mov x0,1\n100: // program standard end\n mov x8,EXIT\n svc 0\nqBlanc: .quad 0xF0F0F0F0\nqAdrqDisplay: .quad qDisplay\nqAdrqDefScreen: .quad qDefScreen\nqAdridentWin: .quad identWin\nqAdrstEvent: .quad stEvent\nqAdrszMessErrfen: .quad szMessErrfen\nqAdrszMessErreur: .quad szMessErreur\nqAdrwmDeleteMessage: .quad wmDeleteMessage\nqAdrszLibDW: .quad szLibDW\n//qAdrszMessGoodBye: .quad szMessGoodBye\nqAdrszLibText: .quad szLibText\nqAdrszLibValue: .quad szLibValue\nqFenetreMask: .quad KeyPressMask|ButtonPressMask|StructureNotifyMask|ExposureMask|EnterWindowMask\n/********************************************************************/\n/* Events ***/\n/********************************************************************/\ntraitEvents: // INFO: traitEvents\n stp x20,lr,[sp,-16]! // save registers\n mov x0,x28 // Display address\n ldr x1,qAdrstEvent // events structure address\n bl XNextEvent\n ldr x0,qAdrstEvent // events structure address\n ldr x1,[x0,#XAny_window] // what window ?\n cmp x1,x27 // main window ?\n bne 1f\n bl evtMainWindow // yes\n b 100f\n1:\n ldr x10,qAdrstInputText // input text window ?\n ldr x11,[x10,Input_adresse]\n cmp x1,x11\n bne 2f\n bl evtInputWindowText\n mov x0,0 // other events\n b 100f\n2:\n ldr x10,qAdrstInputValue // input value window\n ldr x11,[x10,Input_adresse]\n cmp x1,x11\n bne 3f\n bl evtInputWindowValue\n mov x0,0 // other events\n b 100f\n3:\n ldr x10,[x0,XAny_window] // window of event\n ldr x11,qAdrstButton // load button ident\n ldr x12,[x11,BT_adresse]\n cmp x10,x12 // equal ?\n bne 4f // no\n bl evtButton\n mov x0,0 // other events\n b 100f\n4: // other windows\n mov x0,0 // other events\n100:\n ldp x20,lr,[sp],16 // restaur 2 registers\n ret // return to address lr x30\n/******************************************************************/\n/* main windows events */\n/******************************************************************/\n/* x0 contains the events */\n/* x1 contains the ident Window */\n/* x0 return 0 if continue , 1 if program end */\nevtMainWindow: // INFO: evtMainWindow\n stp x20,lr,[sp,-16]! // save registers\n ldr w0,[x0] // type in 4 first bytes\n cmp w0,#ClientMessage // message for close window\n beq 2f // yes -> end\n mov x0,0 // other events\n b 100f // and loop\n2:\n ldr x0,qAdrstEvent // events structure address\n ldr x1,[x0,56] // location message code\n ldr x2,qAdrwmDeleteMessage // equal ?\n ldr x2,[x2]\n mov x0,0\n cmp x1,x2\n bne 100f // no loop\n mov x0,1 // end program\n100:\n ldp x20,lr,[sp],16 // restaur 2 registers\n ret // return to address lr x30\n/******************************************************************/\n/* input text windows events */\n/******************************************************************/\n/* x0 contains the events */\n/* x1 contains the ident Window */\nevtButton: // INFO: evtButton\n stp x20,lr,[sp,-16]! // save registers\n ldr x10,[x0,#XAny_type]\n cmp x10,ButtonPress\n bne 1f\n bl evtButtonMouse\n b 100f\n1:\n cmp x10,#EnterNotify // mouse is on the button\n bne 2f\n ldr x3,qAdrstWindowChge // and change window border\n mov x2,3\n str x2,[x3,#XWCH_border_width]\n mov x0,x28 // display\n ldr x2,qFenSMask\n bl XConfigureWindow\n b 100f\n2:\n cmp x10,#LeaveNotify // mouse is off the button\n bne 3f\n ldr x3,qAdrstWindowChge // and change window border\n mov x2,1\n str x2,[x3,#XWCH_border_width]\n mov x0,x28 // display\n ldr x2,qFenSMask\n bl XConfigureWindow\n b 100f\n3: // other event\n100:\n ldp x20,lr,[sp],16 // restaur 2 registers\n ret // return to address lr x30\n/******************************************************************/\n/* input text windows events */\n/******************************************************************/\n/* x0 contains the events */\n/* x1 contains the ident Window */\nevtInputWindowText: // INFO: evtInputWindowText\n stp x20,lr,[sp,-16]! // save registers\n ldr x10,[x0,#XAny_type]\n mov x20,x1\n cmp x10,#KeyPressed // key character ?\n bne 2f\n // x0 events x1 window ident\n ldr x2,qAdrstInputText\n bl traitImput\n b 100f\n2:\n cmp x10,#EnterNotify // mouse is on the window\n bne 3f\n ldr x0,qAdrstInputText // display text and cursor\n bl displayInput\n mov x1,x20\n ldr x3,qAdrstWindowChge // and change window border\n mov x2,3\n str x2,[x3,#XWCH_border_width]\n mov x0,x28 // display\n ldr x2,qFenSMask\n bl XConfigureWindow\n b 100f\n3:\n cmp x10,#LeaveNotify // the mouse is out the window\n bne 4f\n ldr x0,qAdrszCursor // erase the cursor\n ldr x2,qAdrstInputText\n ldr x2,[x2,Input_cursor]\n mov x10,FONTSIZE\n mul x2,x2,x10\n mov x3,YPOSTEXTINPUT\n bl eraseText1\n mov x1,x20\n ldr x3,qAdrstWindowChge // and chane window border\n mov x2,1\n str x2,[x3,#XWCH_border_width]\n mov x0,x28 // display\n ldr x2,qFenSMask\n bl XConfigureWindow\n b 100f\n4: // other event\n100:\n ldp x20,lr,[sp],16 // restaur 2 registers\n ret // return to address lr x30\nqFenSMask: .quad CWBorderWidth\nqAdrstWindowChge: .quad stWindowChge\n/******************************************************************/\n/* input text windows events */\n/******************************************************************/\n/* x0 contains the events */\n/* x1 contains the ident Window */\nevtInputWindowValue: // INFO: evtInputWindowValue\n stp x20,lr,[sp,-16]! // save registers\n ldr x10,[x0,#XAny_type]\n mov x20,x1\n cmp x10,#KeyPressed // cas d'une touche\n bne 2f\n // x0 events x1 window ident\n ldr x2,qAdrstInputValue\n bl traitImput\n b 100f\n2:\n cmp x10,#EnterNotify // mouse is on the window\n bne 3f\n ldr x0,qAdrstInputValue // display text and cursor\n bl displayInput\n mov x1,x20\n ldr x3,qAdrstWindowChge // and change window border\n mov x2,3\n str x2,[x3,#XWCH_border_width]\n mov x0,x28 // display\n ldr x2,qFenSMask\n bl XConfigureWindow\n b 100f\n3:\n cmp x10,#LeaveNotify // the mouse is out the window\n bne 4f\n ldr x0,qAdrszCursor // erase the cursor\n ldr x2,qAdrstInputValue\n ldr x2,[x2,Input_cursor]\n mov x10,FONTSIZE\n mul x2,x2,x10\n mov x3,YPOSTEXTINPUT\n bl eraseText1\n mov x1,x20\n ldr x3,qAdrstWindowChge // and chane window border\n mov x2,1\n str x2,[x3,#XWCH_border_width]\n mov x0,x28 // display\n ldr x2,qFenSMask\n bl XConfigureWindow\n b 100f\n4: // other event\n100:\n ldp x20,lr,[sp],16 // restaur 2 registers\n ret // return to address lr x30\n\n/******************************************************************/\n/* traitement Key pressed */\n/******************************************************************/\n/* x0 contains the event */\n/* x1 contains the ident Window */\n/* x2 contains address structure window*/\ntraitImput: // INFO: traitImput\n stp x20,lr,[sp,-16]! // save registers\n mov x20,x2 // save structure address\n mov x21,x1 // save ident window\n ldr x1,qAdrsSaisieCar // character input buffer\n mov x2,#4 // buffer lenght\n ldr x3,qAdrkey // code character\n mov x4,0 // Specifies or returns the XComposeStatus structure or NULL.\n bl XLookupString\n cmp x0,#1 // character key ?\n bne 1f\n ldr x0,qAdrsSaisieCar // input character area\n ldrb w22,[x0] // load byte\n cmp x22,#13 // enter ?\n beq 1f\n ldr x0,[x20,Input_text] // erase input area\n mov x1,x21\n mov x2,0\n mov x3,YPOSTEXTINPUT\n bl eraseText1\n ldr x0,qAdrszCursor\n ldr x2,[x20,Input_cursor] // erase cursor\n mov x1,x21\n mov x10,FONTSIZE // Font size\n mul x2,x2,x10\n mov x3,YPOSTEXTINPUT\n bl eraseText1\n ldr x13,[x20,Input_text]\n cmp x22,#8 // back\n beq back\n // voir autre touche\n ldr x4,[x20,Input_cursor] //\n strb w22,[x13,x4] // store input character at text end\n add x4,x4,1\n str x4,[x20,Input_cursor] // maj cursor location\n b suiteaff\nback:\n ldr x4,[x20,Input_cursor] // text size\n sub x4,x4,#1\n str x4,[x20,Input_cursor] // maj cursor location\nsuiteaff:\n strb wzr,[x13,x4] // zero -> text end\n mov x0,x20\n bl displayInput\n b 100f\n1: // other key\n mov x0,x28\n mov x1,#50\n bl XBell // sound on\n\n100:\n ldp x20,lr,[sp],16 // restaur 2 registers\n ret // return to address lr x30\nqAdrsSaisieCar: .quad sSaisieCar\nqAdrkey: .quad key\nqAdrsTexteSaisi: .quad sTexteSaisi\n/******************************************************************/\n/* create Graphic Context */\n/******************************************************************/\n/* x0 contains the Display address */\n/* x1 contains the ident Window */\ncreateGC: // INFO: createGC\n stp x20,lr,[sp,-16]! // save registers\n mov x20,x0 // save display address\n mov x2,#0\n mov x3,#0\n bl XCreateGC\n cbz x0,99f\n mov x26,x0 // save GC\n mov x0,x20 // display address\n mov x1,x26\n ldr x2,qRed // code RGB color\n bl XSetForeground\n cbz x0,99f\n mov x0,x26 // return GC\n b 100f\n99:\n ldr x0,qAdrszMessErrGC\n bl affichageMess\n mov x0,0\n100:\n ldp x20,lr,[sp],16 // restaur 2 registers\n ret // return to address lr x30\nqAdrszMessErrGC: .quad szMessErrGC\nqRed: .quad 0xFF0000\nqGreen: .quad 0xFF00\nqBlue: .quad 0xFF\nqBlack: .quad 0x0\n/******************************************************************/\n/* create Graphic Context 1 */\n/******************************************************************/\n/* x0 contains the Display address */\n/* x1 contains the ident Window */\ncreateGC1: // INFO: createGC1\n stp x20,lr,[sp,-16]! // save registers\n mov x20,x0 // save display address\n mov x2,#0\n mov x3,#0\n bl XCreateGC\n cbz x0,99f\n mov x25,x0 // save GC\n mov x0,x20 // display address\n mov x1,x25\n ldr x2,qBlanc // code RGB color\n bl XSetForeground\n cbz x0,99f\n mov x0,x25 // return GC1\n b 100f\n99:\n ldr x0,qAdrszMessErrGC\n bl affichageMess\n mov x0,0\n100:\n ldp x20,lr,[sp],16 // restaur 2 registers\n ret // return to address lr x30\n/******************************************************************/\n/* create button on screen */\n/******************************************************************/\ncreateButton: // INFO: createButton\n stp x21,lr,[sp,-16]! // save registers\n // create button window\n mov x0,x28 // display address\n mov x1,x27 // ident window\n mov x2,500 // X position\n mov x3,50 // Y position\n mov x4,60 // weight\n mov x5,30 // height\n mov x6,1 // border\n ldr x7,qBlack\n ldr x8,qBlanc // background\n str x8,[sp,-16]! // argument fot stack\n bl XCreateSimpleWindow\n add sp,sp,16 // for stack alignement\n cmp x0,#0 // error ?\n beq 99f\n ldr x21,qAdrstButton\n str x0,[x21,BT_adresse] // save ident button\n str xzr,[x21,BT_cbdata] // for next use\n\n // autorisation des saisies\n mov x0,x28 // display address\n ldr x1,[x21,BT_adresse] // button address\n ldr x2,qButtonMask // mask\n bl XSelectInput\n // create Graphic Contexte of button\n mov x0,x28 // display address\n ldr x1,[x21,BT_adresse] // button ident\n mov x2,#0\n mov x3,#0\n bl XCreateGC\n cmp x0,#0\n beq 98f\n str x0,[x21,BT_GC] // store GC\n // display button\n mov x0,x28 // display address\n ldr x1,[x21,BT_adresse] // button address\n bl XMapWindow\n ldr x0,qAdrszTextButton // text address\n ldr x1,[x21,BT_adresse] // ident button\n mov x2,#18 // position x\n mov x3,#18 // position y\n bl displayText\n\n b 100f\n98:\n ldr x0,qAdrszMessErrButtonGC\n bl affichageMess\n b 100f\n99:\n ldr x0,qAdrszMessErrButton\n bl affichageMess\n100:\n ldp x1,lr,[sp],16 // restaur 2 registers\n ret // return to address lr x30\nqAdrstButton: .quad stButton\nqAdrszTextButton: .quad szTextButton\nqAdrszMessErrButtonGC: .quad szMessErrButtonGC\nqAdrszMessErrButton: .quad szMessErrButton\nqButtonMask: .quad ButtonPressMask|ButtonReleaseMask|StructureNotifyMask|ExposureMask|LeaveWindowMask|EnterWindowMask\n/******************************************************************/\n/* create window input text */\n/******************************************************************/\ncreateInputText: // INFO: createInputText\n stp x21,lr,[sp,-16]! // save registers\n // create button window\n mov x0,x28 // display address\n mov x1,x27 // ident window\n mov x2,50 // X position\n mov x3,50 // Y position\n mov x4,200 // weight\n mov x5,30 // height\n mov x6,1 // border\n ldr x7,qBlack\n ldr x8,qBlanc // background\n str x8,[sp,-16]! // argument fot stack\n bl XCreateSimpleWindow\n add sp,sp,16 // for stack alignement\n cmp x0,#0 // error ?\n beq 99f\n ldr x21,qAdrstInputText\n str x0,[x21,Input_adresse] // save ident button\n\n // autorisation des saisies\n mov x0,x28 // display address\n ldr x1,[x21,Input_adresse] // button address\n ldr x2,qInputMask // mask\n bl XSelectInput\n // create Graphic Contexte of button\n mov x0,x28 // display address\n ldr x1,[x21,Input_adresse] // button ident\n mov x2,#0\n mov x3,#0\n bl XCreateGC\n cmp x0,#0\n beq 98f\n str x0,[x21,Input_GC] // store GC\n // display button\n mov x0,x28 // display address\n ldr x1,[x21,Input_adresse] // button address\n bl XMapWindow\n\n ldr x6,qAdrsTexteSaisi\n\n str x6,[x21,Input_text]\n str xzr,[x21,Input_cursor]\n\n b 100f\n98:\n ldr x0,qAdrszMessErrInputGC\n bl affichageMess\n b 100f\n99:\n ldr x0,qAdrszMessErrInput\n bl affichageMess\n100:\n ldp x1,lr,[sp],16 // restaur 2 registers\n ret // return to address lr x30\nqAdrstInputText: .quad stInputText\nqAdrszMessErrInputGC: .quad szMessErrInputGC\nqAdrszMessErrInput: .quad szMessErrInput\nqInputMask: .quad KeyPressMask|StructureNotifyMask|ExposureMask|LeaveWindowMask|EnterWindowMask\n/******************************************************************/\n/* create window input text */\n/******************************************************************/\ncreateInputValue: // INFO: createInputValue\n stp x21,lr,[sp,-16]! // save registers\n // create window\n mov x0,x28 // display address\n mov x1,x27 // ident main window\n mov x2,340 // X position\n mov x3,50 // Y position\n mov x4,50 // weight\n mov x5,30 // height\n mov x6,1 // border\n ldr x7,qBlack\n ldr x8,qBlanc // background\n str x8,[sp,-16]! // argument fot stack\n bl XCreateSimpleWindow\n add sp,sp,16 // for stack alignement\n cmp x0,#0 // error ?\n beq 99f\n ldr x21,qAdrstInputValue\n str x0,[x21,Input_adresse] // save ident button\n\n // autorisation des saisies\n mov x0,x28 // display address\n ldr x1,[x21,Input_adresse] // button address\n ldr x2,qInputMask // mask\n bl XSelectInput\n // create Graphic Contexte of button\n mov x0,x28 // display address\n ldr x1,[x21,Input_adresse] // button ident\n mov x2,#0\n mov x3,#0\n bl XCreateGC\n cmp x0,#0\n beq 98f\n str x0,[x21,Input_GC] // store GC\n // display button\n mov x0,x28 // display address\n ldr x1,[x21,Input_adresse] // button address\n bl XMapWindow\n\n ldr x6,qAdrsValueSaisi\n\n str x6,[x21,Input_text]\n str xzr,[x21,Input_cursor]\n\n b 100f\n98:\n ldr x0,qAdrszMessErrInputGC\n bl affichageMess\n b 100f\n99:\n ldr x0,qAdrszMessErrInput\n bl affichageMess\n100:\n ldp x1,lr,[sp],16 // restaur 2 registers\n ret // return to address lr x30\nqAdrstInputValue: .quad stInputValue\nqAdrsValueSaisi: .quad sValueSaisi\n/******************************************************************/\n/* display text on screen */\n/******************************************************************/\n/* x0 contains the address of text */\n/* x1 contains ident window */\n/* x2 position X */\n/* x3 position Y */\ndisplayText: // INFO: displayText\n stp x1,lr,[sp,-16]! // save registers\n mov x5,x0 // text address\n mov x6,0 // text size\n1: // loop compute text size\n ldrb w10,[x5,x6] // load text byte\n cbz x10,2f // zero -> end\n add x6,x6,1 // increment size\n b 1b // and loop\n2:\n mov x0,x28 // display address\n mov x4,x3 // position y\n mov x3,x2 // position x\n mov x2,x26 // GC address\n\n bl XDrawString\n100:\n ldp x1,lr,[sp],16 // restaur 2 registers\n ret // return to address lr x30\n/******************************************************************/\n/* erase text on screen */\n/******************************************************************/\n/* x0 contains the address of text */\n/* x1 window ident */\n/* x2 position x */\n/* x3 position y */\neraseText1: // INFO: eraseText1\n stp x1,lr,[sp,-16]! // save registers\n mov x5,x0 // text address\n mov x6,0 // text size\n1: // loop compute text size\n ldrb w10,[x5,x6] // load text byte\n cbz x10,2f // zero -> end\n add x6,x6,1 // increment size\n b 1b // and loop\n2:\n mov x0,x28 // display address\n mov x4,x3\n mov x3,x2\n mov x2,x25 // GC1 address\n bl XDrawString\n100:\n ldp x1,lr,[sp],16 // restaur 2 registers\n ret // return to address lr x30\n/******************************************************************/\n/* events clic mouse button */\n/******************************************************************/\n/* x0 contains the address of event */\nevtButtonMouse: // INFO: evtButtonMouse\n stp x20,lr,[sp,-16]! // save registers\n ldr x10,[x0,XBE_window] // windows of event\n ldr x11,qAdrstButton // load button ident\n ldr x12,[x11,BT_adresse]\n cmp x10,x12 // equal ?\n bne 100f // no\n ldr x20,qAdrptMessage // first entry\n ldr x0,[x20]\n cbz x0,1f\n mov x1,x27\n mov x2,50\n mov x3,200\n bl eraseText1 // yes erase the text\n1:\n ldr x1,qAdrstInputText // input text\n ldr x1,[x1,Input_text]\n ldrb w2,[x1]\n cbz w2,100f // no input text\n ldr x0,qAdrszMessResult\n bl strInsertAtCharInc // insert text at @ character\n mov x5,x0\n ldr x1,qAdrstInputValue // input text\n ldr x0,[x1,Input_text]\n bl conversionAtoD // conversion value to decimal\n // x0 contains the input value\n\n ldr x1,qAdrsZoneConv // and decimal conversion\n bl conversion10\n mov x0,x5\n ldr x1,qAdrsZoneConv\n bl strInsertAtCharInc // and insert result at @ character\n str x0,[x20] // save message address\n mov x1,x27\n mov x2,50\n mov x3,200\n bl displayText // and display new text\n\n100:\n ldp x20,lr,[sp],16 // restaur 2 registers\n ret // return to address lr x30\nqAdrqCounterClic: .quad qCounterClic\nqAdrsZoneConv: .quad sZoneConv\nqAdrszMessResult: .quad szMessResult\nqAdrptMessage: .quad ptMessage\n\n/******************************************************************/\n/* display input area */\n/******************************************************************/\n/* x0 contains area structure */\ndisplayInput: // INFO: displayInput\n stp x1,lr,[sp,-16]! // save registers\n mov x10,x0 // save structure\n ldr x0,[x10,Input_text] // text\n ldr x6,[x10,Input_cursor] // position curseur\n cbz x6,1f // if zero no text\n mov x0,x28 // display address\n ldr x1,[x10,Input_adresse] // ident window\n ldr x2,[x10,Input_GC] // GC address\n mov x3,0 // position x\n mov x4,YPOSTEXTINPUT // position y\n ldr x5,[x10,Input_text] // text\n bl XDrawString\n1: // display cursor\n mov x0,x28 // Display address\n ldr x1,[x10,Input_adresse] // ident window\n ldr x2,[x10,Input_GC] // GC address\n ldr x3,[x10,Input_cursor] // position x\n mov x10,FONTSIZE\n mul x3,x3,x10\n mov x4,YPOSTEXTINPUT // position y\n ldr x5,qAdrszCursor // cursor text\n mov x6,1 // length\n bl XDrawString\n100:\n ldp x1,lr,[sp],16 // restaur 2 registers\n ret // return to address lr x30\nqAdrszCursor: .quad szCursor\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/* Structures */\n/********************************************/\n/*************************************************/\n/* INFO: Structures */\n/*********************************************/\n/* Display définition */\n .struct 0\nDisp_ext_data: /* hook for extension to hang data */\n .struct Disp_ext_data + 8\nDisp_private1:\n .struct Disp_private1 + 8\nDisp_fd: /* Network socket. */\n .struct Disp_fd + 4\nDisp_private2:\n .struct Disp_private2 + 4\nDisp_proto_major_version: /* major version of server's X protocol */\n .struct Disp_proto_major_version + 4\nDisp_proto_minor_version: /* minor version of servers X protocol */\n .struct Disp_proto_minor_version + 4\nDisp_vendor: /* vendor of the server hardware OK*/\n .struct Disp_vendor + 8\nDisp_private3:\n .struct Disp_private3 + 8\nDisp_private8:\n .struct Disp_private8 + 8\nDisp_private5:\n .struct Disp_private5 + 8\nDisp_private6:\n .struct Disp_private6 + 8\nDisp_resource_alloc:\n .struct Disp_resource_alloc + 8\nDisp_byte_order: /* screen byte order, LSBFirst, MSBFirst */\n .struct Disp_byte_order+ 4\nDisp_bitmap_unit: /* padding and data requirements */\n .struct Disp_bitmap_unit + 4\nDisp_bitmap_pad: /* padding requirements on bitmaps */\n .struct Disp_bitmap_pad + 4\nDisp_bitmap_bit_order: /* LeastSignificant or MostSignificant */\n .struct Disp_bitmap_bit_order + 4\nDisp_nformats: /* number of pixmap formats in list */\n .struct Disp_nformats + 8\nDisp_pixmap_format: /* pixmap format list */\n .struct Disp_pixmap_format + 8\nDisp_private28:\n .struct Disp_private28 + 4\nDisp_release: /* release of the server */\n .struct Disp_release + 4\nDisp_private9:\n .struct Disp_private9 + 8\nDisp_private10:\n .struct Disp_private10 + 8\nDisp_qlen: /* Length of input event queue */\n .struct Disp_qlen + 8 /* correction dec19 */\nDisp_last_request_read: /* seq number of last event read */\n .struct Disp_last_request_read + 8\nDisp_request: /* sequence number of last request. */\n .struct Disp_request + 8\nDisp_private11:\n .struct Disp_private11 + 8\nDisp_private12:\n .struct Disp_private12 + 8\nDisp_private13:\n .struct Disp_private13 + 8\nDisp_private14:\n .struct Disp_private14 + 8 /* correction Vim */\nDisp_max_request_size: /* maximum number 32 bit words in request*/\n .struct Disp_max_request_size + 8\nDisp_db:\n .struct Disp_db + 8 /* correction Vim */\nDisp_private15:\n .struct Disp_private15 + 8 /* correction Vim */\nDisp_display_name: /* \"host:display\" string used on this connect*/\n .struct Disp_display_name + 8\nDisp_default_screen: /* default screen for operations */\n .struct Disp_default_screen + 4\nDisp_nscreens: /* number of screens on this server*/\n .struct Disp_nscreens + 4\nDisp_screens: /* pointer to list of screens */\n .struct Disp_screens + 8\nDisp_motion_buffer: /* size of motion buffer */\n .struct Disp_motion_buffer + 8\nDisp_private16:\n .struct Disp_private16 + 8\nDisp_min_keycode: /* minimum defined keycode */\n .struct Disp_min_keycode + 4\nDisp_max_keycode: /* maximum defined keycode */\n .struct Disp_max_keycode + 4\nDisp_private17:\n .struct Disp_private17 + 8\nDisp_private18:\n .struct Disp_private18 + 8\nDisp_private19:\n .struct Disp_private19 + 8\nDisp_xdefaults: /* contents of defaults from server */\n .struct Disp_xdefaults + 8\nDisp_fin:\n/*****************************************/\n/* Screen définition */\n .struct 0\nScreen_ext_data: /* hook for extension to hang data */\n .struct Screen_ext_data + 8\nScreen_Xdisplay: /* back pointer to display structure */\n .struct Screen_Xdisplay + 8\nScreen_root: /* Root window id. */\n .struct Screen_root + 8\nScreen_width:\n .struct Screen_width + 4\nScreen_height:\n .struct Screen_height + 4\nScreen_mwidth: /* width and height of in millimeters */\n .struct Screen_mwidth + 4\nScreen_mheight:\n .struct Screen_mheight + 4\nScreen_ndepths: /* number of depths possible */\n .struct Screen_ndepths + 8\nScreen_depths: /* list of allowable depths on the screen */\n .struct Screen_depths + 8\nScreen_root_depth: /* bits per pixel */\n .struct Screen_root_depth + 8\nScreen_root_visual: /* root visual */\n .struct Screen_root_visual + 8\nScreen_default_gc: /* GC for the root root visual */\n .struct Screen_default_gc + 8\nScreen_cmap: /* default color map */\n .struct Screen_cmap + 8\nScreen_white_pixel:\n .struct Screen_white_pixel + 8\nScreen_black_pixel:\n .struct Screen_black_pixel + 8\nScreen_max_maps: /* max and min color maps */\n .struct Screen_max_maps + 4\nScreen_min_maps:\n .struct Screen_min_maps + 4\nScreen_backing_store: /* Never, WhenMapped, Always */\n .struct Screen_backing_store + 8\nScreen_save_unders:\n .struct Screen_save_unders + 8\nScreen_root_input_mask: /* initial root input mask */\n .struct Screen_root_input_mask + 8\nScreen_fin:\n/**********************************************/\n/* Button structure */\n .struct 0\nBT_cbdata:\n .struct BT_cbdata + 8\nBT_adresse:\n .struct BT_adresse + 8\nBT_GC:\n .struct BT_GC + 8\nBT_Font:\n .struct BT_Font + 8\nBT_fin:\n/****************************************/\n/* Input text structure */\n .struct 0\n\nInput_adresse:\n .struct Input_adresse + 8\nInput_GC:\n .struct Input_GC + 8\nInput_text:\n .struct Input_text + 8\nInput_cursor:\n .struct Input_cursor + 8\nInput_Font:\n .struct Input_Font + 8\nInput_fin:\n/***************************************************/\n/* structure XButtonEvent */\n .struct 0\nXBE_type: //event type\n .struct XBE_type + 8\nXBE_serial: // No last request processed server */\n .struct XBE_serial + 8\nXBE_send_event: // true if this came from a SendEvent request */\n .struct XBE_send_event + 8\nXBE_display: // Display the event was read from\n .struct XBE_display + 8\nXBE_window: // \"event\" window it is reported relative to\n .struct XBE_window + 8\nXBE_root: // root window that the event occurred on\n .struct XBE_root + 8\nXBE_subwindow: // child window\n .struct XBE_subwindow + 8\nXBE_time: // milliseconds\n .struct XBE_time + 8\nXBE_x: // pointer x, y coordinates in event window\n .struct XBE_x + 8\nXBE_y:\n .struct XBE_y + 8\nXBE_x_root: // coordinates relative to root\n .struct XBE_x_root + 8\nXBE_y_root:\n .struct XBE_y_root + 8\nXBE_state: // key or button mask\n .struct XBE_state + 8\nXBE_button: // detail\n .struct XBE_button + 8\nXBE_same_screen: // same screen flag\n .struct XBE_same_screen + 8\nXBE_fin:\n/***************************************************/\n/* structure XAnyEvent */\n .struct 0\nXAny_type:\n .struct XAny_type + 8\nXAny_serial:\n .struct XAny_serial + 8 /* # of last request processed by server */\nXAny_send_event:\n .struct XAny_send_event + 8 /* true if this came from a SendEvent request */\nXAny_display:\n .struct XAny_display + 8 /* Display the event was read from */\nXAny_window:\n .struct XAny_window + 8 /* window on which event was requested in event mask */\nXany_fin:\n/****************************************/\n/* structure de type XWindowChanges */\n .struct 0\nXWCH_x:\n .struct XWCH_x + 4\nXWCH_y:\n .struct XWCH_y + 4\nXWCH_width:\n .struct XWCH_width + 4\nXWCH_height:\n .struct XWCH_height + 4\nXWCH_border_width:\n .struct XWCH_border_width + 4\nXWCH_sibling:\n .struct XWCH_sibling + 4\nXWCH_stack_mode:\n .struct XWCH_stack_mode + 4\nXWCH_fin:\n","language":"AArch64-Assembly"},{"code":"with Gtk.Button; use Gtk.Button;\nwith Gtk.GEntry; use Gtk.GEntry;\nwith Gtk.Label; use Gtk.Label;\nwith Gtk.Window; use Gtk.Window;\nwith Gtk.Widget; use Gtk.Widget;\nwith Gtk.Table; use Gtk.Table;\n\nwith Gtk.Handlers;\nwith Gtk.Main;\n\nprocedure Graphic_Input is\n Window : Gtk_Window;\n Grid : Gtk_Tnetable;\n Label : Gtk_Label;\n Message : Gtk_Label;\n Edit : Gtk_GEntry;\n Button : Gtk_Button;\n\n package Handlers is new Gtk.Handlers.Callback (Gtk_Widget_Record);\n package Return_Handlers is\n new Gtk.Handlers.Return_Callback (Gtk_Widget_Record, Boolean);\n\n function Delete_Event (Widget : access Gtk_Widget_Record'Class)\n return Boolean is\n begin\n return False;\n end Delete_Event;\n\n procedure Destroy (Widget : access Gtk_Widget_Record'Class) is\n begin\n Gtk.Main.Main_Quit;\n end Destroy;\n\n procedure Clicked (Widget : access Gtk_Widget_Record'Class) is\n begin\n if Get_Text (Label) = \"Enter integer:\" then\n Set_Text (Message, \"Entered:\" & Integer'Image (Integer'Value (Get_Text (Edit))));\n Set_Sensitive (Button, False);\n else\n Set_Text (Message, \"Entered:\" & Get_Text (Edit));\n Set_Text (Label, \"Enter integer:\");\n end if;\n exception\n when Constraint_Error =>\n Set_Text (Message, \"Error integer input\");\n end Clicked;\n\nbegin\n Gtk.Main.Init;\n Gtk.Window.Gtk_New (Window);\n Gtk_New (Grid, 2, 3, False);\n Add (Window, Grid);\n Gtk_New (Label, \"Enter string:\");\n Attach (Grid, Label, 0, 1, 0, 1);\n Gtk_New (Edit);\n Attach (Grid, Edit, 1, 2, 0, 1);\n Gtk_New (Button, \"OK\");\n Attach (Grid, Button, 2, 3, 0, 1);\n Gtk_New (Message);\n Attach (Grid, Message, 0, 3, 1, 2);\n Return_Handlers.Connect\n ( Window,\n \"delete_event\",\n Return_Handlers.To_Marshaller (Delete_Event'Access)\n );\n Handlers.Connect\n ( Window,\n \"destroy\",\n Handlers.To_Marshaller (Destroy'Access)\n );\n Handlers.Connect\n ( Button,\n \"clicked\",\n Handlers.To_Marshaller (Clicked'Access)\n );\n Show_All (Grid);\n Show (Window);\n\n Gtk.Main.Main;\nend Graphic_Input;\n","language":"Ada"},{"code":"set input to text returned of (display dialog \"Enter text:\" default answer \"\")\n","language":"AppleScript"},{"code":"set input to text returned of (display dialog \"Enter a number:\" default answer \"\") as integer\n","language":"AppleScript"},{"code":"InputBox, String, Input, Enter a string:\nInputBox, Int, Input, Enter an int:\nMsgbox, You entered \"%String%\" and \"%Int%\"\n","language":"AutoHotkey"},{"code":"Gui, Add, Text,, String:\nGui, Add, Text,, Int:\nGui, Add, Button, gGo, Go!\nGui, Add, Edit, vString ym\nGui, Add, Edit, VInt\nGui, Show, Center, Input\nReturn\n\nGo:\nGui, Submit, NoHide\nMsgbox, You entered \"%String%\" and \"%Int%\"\nExitApp\nReturn\n","language":"AutoHotkey"},{"code":"OPTION GUI TRUE\nPRAGMA GUI gtk3\n\nDECLARE text TYPE STRING\nDECLARE data TYPE FLOATING\n\ngui = GUIDEFINE(\" \\\n { type=WINDOW name=window callback=delete-event title=\\\"Rosetta Code\\\" width-request=300 } \\\n { type=BOX name=box parent=window orientation=GTK_ORIENTATION_VERTICAL } \\\n { type=ENTRY name=entry parent=box margin=4 callback=activate } \\\n { type=SPIN_BUTTON name=spin parent=box margin=4 numeric=TRUE } \\\n { type=BUTTON_BOX name=bbox parent=box } \\\n { type=BUTTON name=button parent=bbox margin=4 callback=clicked label=\\\"Exit\\\" }\")\n\nCALL GUISET(gui, \"spin\", \"adjustment\", gtk_adjustment_new(75000, 0, 100000, 1, 1, 0))\n\nREPEAT\n event$ = GUIEVENT$(gui)\nUNTIL event$ = \"button\" OR event$ = \"window\"\n\nCALL GUIGET(gui, \"entry\", \"text\", &text)\nPRINT text FORMAT \"Entered: %s\\n\"\n\nCALL GUIGET(gui, \"spin\", \"value\", &data)\nPRINT data FORMAT \"Entered: %g\\n\"\n","language":"BaCon"},{"code":" INSTALL @lib$+\"WINLIB2\"\n INSTALL @lib$+\"WINLIB5\"\n ES_NUMBER = 8192\n\n form% = FN_newdialog(\"Rosetta Code\", 100, 100, 100, 64, 8, 1000)\n PROC_static(form%, \"String:\", 100, 8, 8, 30, 14, 0)\n PROC_editbox(form%, \"Example\", 101, 40, 6, 52, 14, 0)\n PROC_static(form%, \"Number:\", 102, 8, 26, 30, 14, 0)\n PROC_editbox(form%, \"75000\", 103, 40, 24, 52, 14, ES_NUMBER)\n PROC_pushbutton(form%, \"Read\", FN_setproc(PROCread), 30, 43, 40, 16, 0)\n PROC_showdialog(form%)\n\n REPEAT\n WAIT 1\n UNTIL !form% = 0\n QUIT\n\n DEF PROCread\n LOCAL buffer%, number%\n DIM buffer% LOCAL 255\n SYS \"GetDlgItemText\", !form%, 101, buffer%, 255\n SYS \"GetDlgItemInt\", !form%, 103, 0, 1 TO number%\n PRINT \"String = \"\"\" $$buffer% \"\"\"\"\n PRINT \"Number = \" ; number%\n ENDPROC\n","language":"BBC-BASIC"},{"code":"#include <gtk/gtk.h>\n\nvoid ok_hit(GtkButton *o, GtkWidget **w)\n{\n GtkMessageDialog *msg;\n\n gdouble v = gtk_spin_button_get_value((GtkSpinButton *)w[1]);\n const gchar *c = gtk_entry_get_text((GtkEntry *)w[0]);\n\n msg = (GtkMessageDialog *)\n gtk_message_dialog_new(NULL,\n\t\t\t GTK_DIALOG_MODAL,\n\t\t\t (v==75000) ? GTK_MESSAGE_INFO : GTK_MESSAGE_ERROR,\n\t\t\t GTK_BUTTONS_OK,\n\t\t\t \"You wrote '%s' and selected the number %d%s\",\n\t\t\t c, (gint)v,\n\t\t\t (v==75000) ? \"\" : \" which is wrong (75000 expected)!\");\n gtk_widget_show_all(GTK_WIDGET(msg));\n (void)gtk_dialog_run(GTK_DIALOG(msg));\n gtk_widget_destroy(GTK_WIDGET(msg));\n if ( v==75000 ) gtk_main_quit();\n}\n\nint main(int argc, char **argv)\n{\n GtkWindow *win;\n GtkEntry *entry;\n GtkSpinButton *spin;\n GtkButton *okbutton;\n GtkLabel *entry_l, *spin_l;\n GtkHBox *hbox[2];\n GtkVBox *vbox;\n GtkWidget *widgs[2];\n\n gtk_init(&argc, &argv);\n\n win = (GtkWindow *)gtk_window_new(GTK_WINDOW_TOPLEVEL);\n gtk_window_set_title(win, \"Insert values\");\n\n entry_l = (GtkLabel *)gtk_label_new(\"Insert a string\");\n spin_l = (GtkLabel *)gtk_label_new(\"Insert 75000\");\n\n entry = (GtkEntry *)gtk_entry_new();\n spin = (GtkSpinButton *)gtk_spin_button_new_with_range(0, 80000, 1);\n\n widgs[0] = GTK_WIDGET(entry);\n widgs[1] = GTK_WIDGET(spin);\n\n okbutton = (GtkButton *)gtk_button_new_with_label(\"Ok\");\n\n hbox[0] = (GtkHBox *)gtk_hbox_new(FALSE, 1);\n hbox[1] = (GtkHBox *)gtk_hbox_new(FALSE, 1);\n\n vbox = (GtkVBox *)gtk_vbox_new(TRUE, 1);\n\n gtk_container_add(GTK_CONTAINER(hbox[0]), GTK_WIDGET(entry_l));\n gtk_container_add(GTK_CONTAINER(hbox[0]), GTK_WIDGET(entry));\n gtk_container_add(GTK_CONTAINER(hbox[1]), GTK_WIDGET(spin_l));\n gtk_container_add(GTK_CONTAINER(hbox[1]), GTK_WIDGET(spin));\n\n gtk_container_add(GTK_CONTAINER(vbox), GTK_WIDGET(hbox[0]));\n gtk_container_add(GTK_CONTAINER(vbox), GTK_WIDGET(hbox[1]));\n gtk_container_add(GTK_CONTAINER(vbox), GTK_WIDGET(okbutton));\n\n gtk_container_add(GTK_CONTAINER(win), GTK_WIDGET(vbox));\n\n g_signal_connect(G_OBJECT(win), \"delete-event\", (GCallback)gtk_main_quit, NULL);\n g_signal_connect(G_OBJECT(okbutton), \"clicked\", (GCallback)ok_hit, widgs);\n\n gtk_widget_show_all(GTK_WIDGET(win));\n gtk_main();\n\n return 0;\n}\n","language":"C"},{"code":"#ifndef TASK_H\n#define TASK_H\n\n#include <QWidget>\n\nclass QLabel ;\nclass QLineEdit ;\nclass QVBoxLayout ;\nclass QHBoxLayout ;\n\nclass EntryWidget : public QWidget {\n\n Q_OBJECT\npublic :\n EntryWidget( QWidget *parent = 0 ) ;\nprivate :\n QHBoxLayout *upperpart , *lowerpart ;\n QVBoxLayout *entryLayout ;\n QLineEdit *stringinput ;\n QLineEdit *numberinput ;\n QLabel *stringlabel ;\n QLabel *numberlabel ;\n} ;\n\n#endif\n","language":"C++"},{"code":"#include <QLineEdit>\n#include <QLabel>\n#include <QHBoxLayout>\n#include <QVBoxLayout>\n#include <QString>\n#include \"task.h\"\n\nEntryWidget::EntryWidget ( QWidget *parent )\n : QWidget( parent ) {\n entryLayout = new QVBoxLayout( this ) ;\n stringlabel = new QLabel( \"Enter a string!\" ) ;\n stringinput = new QLineEdit( \"\" ) ;\n stringinput->setMaxLength( 20 ) ;\n stringinput->setInputMask( QString( \"AAAAAAAAAAAAAAAAAAA\" ) ) ;\n upperpart = new QHBoxLayout ;\n upperpart->addWidget( stringlabel ) ;\n upperpart->addWidget( stringinput ) ;\n numberlabel = new QLabel( \"Enter a number!\" ) ;\n numberinput = new QLineEdit( \"0\" ) ;\n numberinput->setMaxLength( 5 ) ;\n numberinput->setInputMask( QString( \"99999\" ) ) ;\n lowerpart = new QHBoxLayout ;\n lowerpart->addWidget( numberlabel ) ;\n lowerpart->addWidget( numberinput ) ;\n entryLayout->addLayout( upperpart ) ;\n entryLayout->addLayout( lowerpart ) ;\n setLayout( entryLayout ) ;\n}\n","language":"C++"},{"code":"#include <QApplication>\n#include \"task.h\"\n\nint main( int argc , char *argv[ ] ) {\n QApplication app( argc , argv ) ;\n EntryWidget theWidget ;\n theWidget.show( ) ;\n return app.exec( ) ;\n}\n","language":"C++"},{"code":"(import 'javax.swing.JOptionPane)\n(let [number (-> \"Enter an Integer\"\n JOptionPane/showInputDialog\n Integer/parseInt)\n string (JOptionPane/showInputDialog \"Enter a String\")]\n [number string])\n","language":"Clojure"},{"code":"(capi:prompt-for-string \"Enter a string:\")\n","language":"Common-Lisp"},{"code":"(do ((number 0) (okp t))\n ((or (not okp) (= 75000 number)))\n (multiple-value-setq (number okp)\n (capi:prompt-for-integer \"Enter an integer:\")))\n","language":"Common-Lisp"},{"code":"(capi:prompt-for-integer \"Enter an integer:\"\n :ok-check #'(lambda (n) (= n 75000)))\n","language":"Common-Lisp"},{"code":"(capi:define-interface string/integer-prompt () ()\n (:panes\n (string-pane\n capi:text-input-pane\n :title \"Enter a string:\")\n (integer-pane\n capi:text-input-pane\n :title \"Enter an integer:\"\n :change-callback :redisplay-interface))\n (:layouts\n (main\n capi:column-layout\n '(string-pane integer-pane))))\n","language":"Common-Lisp"},{"code":"(defun string/integer-prompt-value (pane)\n (with-slots (string-pane integer-pane) pane\n (let* ((string (capi:text-input-pane-text string-pane))\n (integer-string (capi:text-input-pane-text integer-pane))\n (integer (when (every 'digit-char-p integer-string)\n (parse-integer integer-string :junk-allowed t))))\n (values (cons string integer)))))\n","language":"Common-Lisp"},{"code":"(defun do-prompting ()\n (capi:popup-confirmer\n (make-instance 'string/integer-prompt)\n \"Enter some values:\"\n :value-function 'string/integer-prompt-value\n :ok-check #'(lambda (result) (eql (cdr result) 75000))))\n","language":"Common-Lisp"},{"code":"import 'package:flutter/material.dart';\n\nmain() => runApp( OutputLabel() );\n\nclass OutputLabel extends StatefulWidget {\n @override\n _OutputLabelState createState() => _OutputLabelState();\n}\n\nclass _OutputLabelState extends State<OutputLabel> {\n String output = \"output\"; // This will be displayed in an output text field\n\n TextEditingController _stringInputController = TextEditingController(); // Allows us to get the text from a text field\n TextEditingController _numberInputController = TextEditingController();\n\n @override\n Widget build( BuildContext context ) {\n return MaterialApp(\n debugShowCheckedModeBanner: false, // Disable debug banner in top right\n home: Scaffold ( // Scaffold provides a layout for the app\n body: Center ( // Everything in the center widget will be centered\n child: Column ( // All the widgets will be in a column\n children: <Widget> [\n SizedBox( height: 25 ), // Space between top and text field\n\n TextField ( // String input Text Field\n controller: _stringInputController, // Add input controller so we can grab text\n textAlign: TextAlign.center, // Center text\n decoration: InputDecoration( border: OutlineInputBorder(), labelText: 'Enter a string...'), // Border and default text\n ), // end TextField\n\n SizedBox( height: 10 ), // Space between text fields\n\n TextField ( // Number input Text Field\n controller: _numberInputController, // Add input controller so we can grab text\n textAlign: TextAlign.center, // Center text\n decoration: InputDecoration( border: OutlineInputBorder(), labelText: 'Enter 75000'), // Border and default text\n ), // end TextField\n\n FlatButton ( // Submit Button\n child: Text('Submit Data'), // Button Text\n color: Colors.blue[400] // button color\n onPressed: () { // On pressed Callback for button\n setState( () {\n output = ''; // Reset output\n\n int number; // Int to store number in\n\n var stringInput = _stringInputController.text ?? ''; // Get the input from the first field, if it is null set it to an empty string\n\n var numberString = _numberInputController.text ?? ''; // Get the input from the second field, if it is null set it to an empty string\n\n if ( stringInput == '') { // If first field is empty\n output = 'Please enter something in field 1\\n';\n return;\n }\n\n if (_numberInputController.text == '') { // If second field is empty\n output += 'Please enter something in field 2';\n return;\n } else { // If we got an input in the second field\n\n try {\n number = int.parse( numberString ); // Parse numberString into an int\n\n if ( number == 75000 )\n output = 'text output: $stringInput\\nnumber: $number'; // Grabs the text from the input controllers and changes the string\n else\n output = '$number is not 75000!';\n\n } on FormatException { // If a number is not entered in second field\n output = '$numberString is not a number!';\n }\n\n }\n\n });\n }\n ), // End FlatButton\n\n Text( output ) // displays output\n\n ]\n )\n )\n )\n );\n }\n}\n","language":"Dart"},{"code":"program UserInputGraphical;\n\n{$APPTYPE CONSOLE}\n\nuses SysUtils, Dialogs;\n\nvar\n s: string;\n lStringValue: string;\n lIntegerValue: Integer;\nbegin\n lStringValue := InputBox('User input/Graphical', 'Enter a string', '');\n\n repeat\n s := InputBox('User input/Graphical', 'Enter the number 75000', '75000');\n lIntegerValue := StrToIntDef(s, 0);\n if lIntegerValue <> 75000 then\n ShowMessage('Invalid entry: ' + s);\n until lIntegerValue = 75000;\nend.\n","language":"Delphi"},{"code":"s = input[\"Enter a string: \"]\ni = parseInt[input[\"Enter an integer: \"]]\n","language":"Frink"},{"code":"[s,i] = input[\"Dialog title\", [\"Enter a string\", \"Enter an integer\"]]\ni = parseInt[i]\n","language":"Frink"},{"code":"hTextBox As TextBox\nhValueBox As ValueBox\nhLabel As Label\n\nPublic Sub Form_Open()\n\nWith Me\n .Height = 100\n .Width = 300\n .padding = 5\n .Arrangement = Arrange.Vertical\n .Title = \"User input/Graphical\"\nEnd With\n\nhTextBox = New TextBox(Me) As \"TextBox1\"\nhTextBox.Expand = True\n\nhValueBox = New ValueBox(Me) As \"ValueBox1\"\nhValueBox.Expand = True\n\nhLabel = New Label(Me)\nhLabel.expand = True\n\nEnd\n\nPublic Sub TextBox1_Change()\n\nhLabel.text = hTextBox.Text & \" - \" & Str(hValueBox.value)\n\nEnd\n\nPublic Sub valueBox1_Change()\n\nTextBox1_Change\n\nEnd\n","language":"Gambas"},{"code":"package main\n\nimport (\n \"github.com/gotk3/gotk3/gtk\"\n \"log\"\n \"math/rand\"\n \"strconv\"\n \"time\"\n)\n\nfunc validateInput(window *gtk.Window, str1, str2 string) bool {\n n, err := strconv.ParseFloat(str2, 64)\n if len(str1) == 0 || err != nil || n != 75000 {\n dialog := gtk.MessageDialogNew(\n window,\n gtk.DIALOG_MODAL,\n gtk.MESSAGE_ERROR,\n gtk.BUTTONS_OK,\n \"Invalid input\",\n )\n dialog.Run()\n dialog.Destroy()\n return false\n }\n return true\n}\n\nfunc check(err error, msg string) {\n if err != nil {\n log.Fatal(msg, err)\n }\n}\n\nfunc main() {\n rand.Seed(time.Now().UnixNano())\n gtk.Init(nil)\n\n window, err := gtk.WindowNew(gtk.WINDOW_TOPLEVEL)\n check(err, \"Unable to create window:\")\n window.SetTitle(\"Rosetta Code\")\n window.SetPosition(gtk.WIN_POS_CENTER)\n window.Connect(\"destroy\", func() {\n gtk.MainQuit()\n })\n\n vbox, err := gtk.BoxNew(gtk.ORIENTATION_VERTICAL, 1)\n check(err, \"Unable to create vertical box:\")\n vbox.SetBorderWidth(1)\n\n hbox1, err := gtk.BoxNew(gtk.ORIENTATION_HORIZONTAL, 1)\n check(err, \"Unable to create first horizontal box:\")\n\n hbox2, err := gtk.BoxNew(gtk.ORIENTATION_HORIZONTAL, 1)\n check(err, \"Unable to create second horizontal box:\")\n\n label, err := gtk.LabelNew(\"Enter a string and the number 75000 \\n\")\n check(err, \"Unable to create label:\")\n\n sel, err := gtk.LabelNew(\"String: \")\n check(err, \"Unable to create string entry label:\")\n\n nel, err := gtk.LabelNew(\"Number: \")\n check(err, \"Unable to create number entry label:\")\n\n se, err := gtk.EntryNew()\n check(err, \"Unable to create string entry:\")\n\n ne, err := gtk.EntryNew()\n check(err, \"Unable to create number entry:\")\n\n hbox1.PackStart(sel, false, false, 2)\n hbox1.PackStart(se, false, false, 2)\n\n hbox2.PackStart(nel, false, false, 2)\n hbox2.PackStart(ne, false, false, 2)\n\n // button to accept\n ab, err := gtk.ButtonNewWithLabel(\"Accept\")\n check(err, \"Unable to create accept button:\")\n ab.Connect(\"clicked\", func() {\n // read and validate the entered values\n str1, _ := se.GetText()\n str2, _ := ne.GetText()\n if validateInput(window, str1, str2) {\n window.Destroy() // close window if input is OK\n }\n })\n\n vbox.Add(label)\n vbox.Add(hbox1)\n vbox.Add(hbox2)\n vbox.Add(ab)\n window.Add(vbox)\n\n window.ShowAll()\n gtk.Main()\n}\n","language":"Go"},{"code":"import javax.swing.JOptionPane\n\ndef number = JOptionPane.showInputDialog (\"Enter an Integer\") as Integer\ndef string = JOptionPane.showInputDialog (\"Enter a String\")\n\nassert number instanceof Integer\nassert string instanceof String\n","language":"Groovy"},{"code":"import Graphics.UI.Gtk\nimport Control.Monad\n\nmain = do\n initGUI\n\n window <- windowNew\n set window [windowTitle := \"Graphical user input\", containerBorderWidth := 10]\n\n vb <- vBoxNew False 0\n containerAdd window vb\n\n hb1 <- hBoxNew False 0\n boxPackStart vb hb1 PackNatural 0\n hb2 <- hBoxNew False 0\n boxPackStart vb hb2 PackNatural 0\n\n lab1 <- labelNew (Just \"Enter number 75000\")\n boxPackStart hb1 lab1 PackNatural 0\n nrfield <- entryNew\n entrySetText nrfield \"75000\"\n boxPackStart hb1 nrfield PackNatural 5\n\n strfield <- entryNew\n boxPackEnd hb2 strfield PackNatural 5\n lab2 <- labelNew (Just \"Enter a text\")\n boxPackEnd hb2 lab2 PackNatural 0\n\n accbox <- hBoxNew False 0\n boxPackStart vb accbox PackNatural 5\n im <- imageNewFromStock stockApply IconSizeButton\n acceptButton <- buttonNewWithLabel \"Accept\"\n buttonSetImage acceptButton im\n boxPackStart accbox acceptButton PackRepel 0\n\n txtstack <- statusbarNew\n boxPackStart vb txtstack PackNatural 0\n id <- statusbarGetContextId txtstack \"Line\"\n\n widgetShowAll window\n\n onEntryActivate nrfield (showStat nrfield txtstack id)\n onEntryActivate strfield (showStat strfield txtstack id)\n\n onPressed acceptButton $ do\n g <- entryGetText nrfield\n if g==\"75000\" then\n widgetDestroy window\n else do\n msgid <- statusbarPush txtstack id \"You didn't enter 75000. Try again\"\n return ()\n\n onDestroy window mainQuit\n mainGUI\n\nshowStat :: Entry -> Statusbar -> ContextId -> IO ()\nshowStat fld stk id = do\n txt <- entryGetText fld\n let mesg = \"You entered \\\"\" ++ txt ++ \"\\\"\"\n msgid <- statusbarPush stk id mesg\n return ()\n","language":"Haskell"},{"code":"*Main> main\n","language":"Haskell"},{"code":"CHARACTER string*100\n\nDLG(Edit=string, Edit=num_value, Button='&OK', TItle='Enter 75000 for num_value')\nWRITE(Messagebox, Name) \"You entered\", string, num_value\n","language":"HicEst"},{"code":"procedure main()\nWOpen(\"size=800,800\") | stop(\"Unable to open window\")\nWWrite(\"Enter a string:\")\ns := WRead()\nWWrite(\"You entered \",image(s))\nWWrite(\"Enter the integer 75000:\")\ni := WRead()\nif i := integer(i) then\n WWrite(\"You entered: \",i)\nelse\n WWrite(image(i),\" isn't an integer\")\nWDone()\nend\n\nlink graphics\n","language":"Icon"},{"code":"SIMPLEGUI=: noun define\npc simpleGui;\ncc IntegerLabel static;cn \"Enter the integer 75000\";\ncc integer edit;\ncc TextLabel static;cn \"Enter text\";\ncc text edit;\ncc accept button;cn \"Accept\";\npshow;\n)\n\nsimpleGui_run=: wd bind SIMPLEGUI\nsimpleGui_close=: wd bind 'pclose'\nsimpleGui_cancel=: simpleGui_close\n\nsimpleGui_accept_button=: verb define\n ttxt=. text\n tint=. _\". integer\n if. tint ~: 75000 do.\n wdinfo 'Integer entered was not 75000.'\n else.\n simpleGui_close ''\n 'simpleGui_text simpleGui_integer'=: ttxt;tint\n end.\n)\n\nsimpleGui_run''\n","language":"J"},{"code":"SIMPLEGUI=: noun define\npc simpleGui;\nxywh 136 39 44 12;cc accept button;cn \"Accept\";\nxywh 0 14 60 11;cc IntegerLabel static ss_right;cn \"Enter an integer\";\nxywh 65 13 60 12;cc integer edit;\nxywh 0 39 60 11;cc TextLabel static ss_right;cn \"Enter text\";\nxywh 64 38 60 12;cc text edit;\npas 6 6;pcenter;\nrem form end;\n)\n\nsimpleGui_run=: verb define\n wd SIMPLEGUI\n wd 'set integer *', \": 75000\n wd 'pshow;'\n)\n\nsimpleGui_accept_button=: verb define\n ttxt=. text\n tint=. _\". integer NB. invalid integers assigned value _\n if. tint ~: 75000 do.\n wdinfo 'Integer entered was not 75000.'\n else.\n simpleGui_close ''\n 'simpleGui_text simpleGui_integer'=: ttxt;tint\n end.\n)\n\nsimpleGui_close=: wd bind 'pclose'\nsimpleGui_cancel=: simpleGui_close\n\nsimpleGui_run''\n","language":"J"},{"code":"import javax.swing.*;\n\npublic class GetInputSwing {\n public static void main(String[] args) throws Exception {\n int number = Integer.parseInt(\n JOptionPane.showInputDialog (\"Enter an Integer\"));\n String string = JOptionPane.showInputDialog (\"Enter a String\");\n }\n}\n","language":"Java"},{"code":"var str = prompt(\"Enter a string\");\nvar value = 0;\nwhile (value != 75000) {\n value = parseInt( prompt(\"Enter the number 75000\") );\n}\n","language":"JavaScript"},{"code":"using Gtk\n\nfunction twoentrywindow()\n txt = \"Enter Text Here\"\n txtchanged = false\n\n win = GtkWindow(\"Keypress Test\", 500, 100) |> (GtkFrame() |> (vbox = GtkBox(:v)))\n lab = GtkLabel(\"Enter some text in the first box and 7500 into the second box.\")\n txtent = GtkEntry()\n set_gtk_property!(txtent,:text,\"Enter Some Text Here\")\n nument = GtkEntry()\n set_gtk_property!(nument,:text,\"Enter the number seventy-five thousand here\")\n push!(vbox, lab, txtent, nument)\n\n function keycall(w, event)\n strtxt = get_gtk_property(txtent, :text, String)\n numtxt = get_gtk_property(nument, :text, String)\n if strtxt != txt && occursin(\"75000\", numtxt)\n set_gtk_property!(lab, :label, \"You have accomplished the task.\")\n end\n end\n signal_connect(keycall, win, \"key-press-event\")\n\n cond = Condition()\n endit(w) = notify(cond)\n signal_connect(endit, win, :destroy)\n showall(win)\n wait(cond)\nend\n\ntwoentrywindow()\n","language":"Julia"},{"code":"// version 1.1\n\nimport javax.swing.JOptionPane\n\nfun main(args: Array<String>) {\n do {\n val number = JOptionPane.showInputDialog(\"Enter 75000\").toInt()\n } while (number != 75000)\n}\n","language":"Kotlin"},{"code":"' [RC] User input/graphical\n\n ' Typical LB graphical input/output example.This shows how LB takes user input.\n ' You'd usually do more validating of input.\n\n\n nomainwin ' No console window needed.\n\n textbox#w.tb1, 100, 20, 200, 30\n textbox#w.tb2, 100, 60, 200, 30\n textbox#w.tb3, 100,160, 200, 30\n\n statictext #w.st1, \"String =\", 10, 30, 90, 30\n statictext #w.st2, \"Integer =\", 10, 70, 90, 30\n\n button #w.b1, \"Read and Show\", [buttonClicked], LR, 180, 70\n\n WindowWidth =360\n WindowHeight =240\n UpperLeftX = 40\n UpperLeftY = 40\n\n open \"User input of integer & string\" for window as #w\n\n #w \"trapclose [quit]\" ' Clean exit routine.\n #w.tb1 \"!font courier 12\"\n #w.tb2 \"!font courier 12\"\n #w.tb3 \"!font courier 12 bold\"\n #w.st1 \"!font courier 12\"\n #w.st2 \"!font courier 12\"\n\n #w.tb1 \"Change this string.\"\n #w.tb2 \"Enter an integer here.\"\n #w.tb3 \"Display will be here.\"\n\n #w.tb1 \"!selectall\"\n\n wait\n\n [buttonClicked] ' Button-clicked routine collects data\n #w.tb1 \"!contents? in1$\"\n #w.tb2 \"!contents? in2$\"\n #w.tb3 in1$; \" \"; int( val( in2$))\n wait\n\n [quit]\n close #w\n end\n","language":"Liberty-BASIC"},{"code":"Module CheckIt {\n Def aName$=\"No Name\", Num$\n \\\\ we open a new stack, and hold old\n Stack New {\n If Ask$(\"Give your name:\",,,,,aName$)=\"OK\" Then Read aName$\n If Ask$(\"Give a Number: (75000)\",,,,,\"\")=\"OK\" Then Read Num$\n if Num$<>\"75000\" or aName$=\"\" Then loop\n }\n \\ now old stack came back\n Print Num$, aName$\n Print Letter$ \\\\ Letter$ pop a string from stack\n}\nCheckIt \"Thank You\"\n","language":"M2000-Interpreter"},{"code":"Module Checkit {\n Declare Form1 Form\n Declare Inp1 Textbox Form Form1\n Declare Inp2 Textbox Form Form1\n With Inp1, \"Prompt\", \"String: \", \"MaxCharLength\", 30+8, \"ShowAlways\", 1, \"ThisKind\" as info$, \"VarText\" as Aname$\n info$=\" <write your name>\"\n With Inp2, \"Prompt\", \"Integer: \", \"MaxCharLength\", 10+9, \"VarText\" as Feed$, \"ThisKind\",\" sec\", \"ShowAlways\", 1\n feed$=\"0\"\n\n \\\\ local1, and Event service functions have module visibility.\n \\\\ So they have to use Read New to make new references (shadow old), and use local (the same for SUBS)\n \\\\ Event's service functions can't use parents Subs, but Local1 can be used (exist in a list visible to Events)\n Function Local1 (new Feed$) {\n \\\\ this function can be used from other Integer\n \\\\ this$ and thispos, exist just before the call of this function\n local sgn$\n if feed$=\"\" and this$=\"-\" then thispos-- : exit\n if left$(this$,1)=\"-\" then sgn$=\"-\": this$=mid$(this$, 2)\n if this$<>Trim$(this$) then this$=Feed$ : thispos-- : exit\n If Trim$(this$)=\"\" then this$=\"0\" : thispos=2 : exit\n if instr(this$,\"+\")>0 and sgn$=\"-\" then this$=filter$(this$, \"+\") : sgn$=\"\"\n if instr(this$,\"-\")>0 and sgn$=\"\" then this$=filter$(this$, \"-\") : sgn$=\"-\"\n if filter$(this$,\"0123456789\")<>\"\" then this$=Feed$ : thispos-- : exit\n if len(this$)>1 then While left$(this$,1)=\"0\" {this$=mid$(this$, 2)}\n this$=sgn$+this$\n if this$=\"-0\" then this$=\"-\" : thispos=2\n }\n Function Inp1.ValidString {\n Read New &this$\n While left$(this$, 1)=\" \" { this$=mid$(this$, 2)}\n info$=str$(30-Len(This$), \"\\<0\\>\")\n }\n Function Inp2.ValidString {\n \\\\ this function called direct from textbox\n Read New &this$, &thispos\n Call Local local1(Feed$)\n }\n Function Form1.Unload {\n Read New &Quit\n If feed$<>\"75000\" Or Aname$=\"\" then {\n \\\\ open messagebox, pressing cancel quit Unload\n Quit=Ask(\"Data isn't correct\")=2\n }\n }\n Method Inp1, \"Move\", 2000,2000, 6000, 600\n Method Inp2, \"Move\", 2000,3000, 6000, 600\n Method Form1, \"Show\", 1\n If Feed$=\"75000\" and Aname$<>\"\" Then Print \"Thank You\"\n Declare Form1 Nothing\n}\nCheckit\n","language":"M2000-Interpreter"},{"code":"str = InputString[\"Input a string\"]; nb =\n InputString[\"Input a number\"]; Print[str, \" \" , ToString@nb]\n","language":"Mathematica"},{"code":"import Nanoquery.Util.Windows\n\n// a function to handle the main window closing\ndef finish(caller, event)\n\texit\nend\n\n// create a window\nw = new(Window, \"Input\").setTitle(\"Input\")\nw.setSize(320, 190)\nw.setHandler(w.closing, finish)\n\n// create two labels to go next to the input boxes\nstringlabel = new(Label).setParent(w)\nintlabel = new(Label).setParent(w)\n\nstringlabel.setText(\"String: \"); stringlabel.setPosition(20, 25)\nintlabel.setText(\"Integer: \"); intlabel.setPosition(20, 75)\n\n// create two textboxes for input\nstringbox = new(Textbox).setParent(w)\nintbox = new(Textbox).setParent(w)\n\nstringbox.setPosition(100, 20); stringbox.setWidth(200); stringbox.setHeight(30)\nintbox.setPosition(100, 70); intbox.setWidth(200); intbox.setHeight(30)\n\n// a function that handles when the 'done' button is clicked\ndef done_clicked(caller, event)\n\tglobal stringbox\n\tglobal intbox\n\tglobal w\n\n\ts = stringbox.getText()\n\ti = intbox.getText()\n\n\ttry\n\t\tif int(i) = 75000\n\t\t\tprintln \"String: \" + s\n\t\t\tprintln \"Integer: \" + i\n\t\t\texit\n\t\telse\n\t\t\tw.showMessageBox(\"Please enter 75000 for the integer value\")\n\t\tend\n\tcatch\n\t\tw.showMessageBox(\"Please enter 75000 for the integer value\")\n\tend\nend\n\n// create the 'done' button\ndone = new(Button).setParent(w)\n\ndone.setText(\"Done\"); done.setPosition(250,120)\ndone.setHandler(done.clicked, done_clicked)\n\n// display the window\nw.show()\n","language":"Nanoquery"},{"code":"/* NetRexx */\noptions replace format comments java crossref symbols nobinary\nimport javax.swing.JOptionPane\n\nunumber = 0\nustring = ''\n\ndo\n unumber = Integer.parseInt(JOptionPane.showInputDialog(\"Enter an Integer\"))\n ustring = JOptionPane.showInputDialog(\"Enter a String\")\ncatch ex = Exception\n ex.printStackTrace\nend\n\nunumber = unumber * 1.0 -- just to prove unumber is really a number\nsay 'Number:' unumber.right(10)', String:' ustring\n\nreturn\n","language":"NetRexx"},{"code":"; file: input-gui.lsp\n; url: http://rosettacode.org/wiki/User_input/Graphical\n; author: oofoe 2012-02-02\n\n; Colours\n(setq ok '(.8 1 .8) fail '(1 .5 .5))\n\n; Load library and initialize GUI server:\n(load (append (env \"NEWLISPDIR\") \"/guiserver.lsp\"))\n(gs:init)\n\n; Validation Callback\n\n; There is a bug in the \"gs:get-text\" function that causes it to fail\n; silently if the text field is empty. Therfore, I set the field\n; background to red first and only clear it if the field returns\n; correctly.\n(define (validate)\n (gs:set-color 'string fail)\n (if (not (empty? (gs:get-text 'string)))\n (gs:set-color 'string ok))\n\n (gs:set-color 'number fail)\n (if (= 75000 (int (gs:get-text 'number)))\n (gs:set-color 'number ok))\n )\n\n; Create main window frame and set layout.\n(gs:frame 'main 100 100 256 128 \"User Input/Graphical\")\n(gs:set-flow-layout 'main \"left\" 4 4)\n\n; Create and add widgets.\n(gs:label 'instructions \"Please enter a string and the number 75000:\")\n(gs:text-field 'string 'validate 32)\n(gs:text-field 'number 'validate 8)\n(gs:button 'check 'validate \"validate...\")\n(gs:add-to 'main 'instructions 'string 'number 'check)\n\n; Show main window.\n(gs:set-visible 'main true)\n\n; Start event loop.\n(gs:listen)\n\n; No (exit) needed -- guiserver kills program on window close.\n","language":"NewLISP"},{"code":"import strutils\nimport gintro/[glib, gobject, gtk, gio]\n\ntype MainWindow = ref object of ApplicationWindow\n strEntry: Entry\n intEntry: SpinButton\n\n#---------------------------------------------------------------------------------------------------\n\nproc displayValues(strval: string; intval: int) =\n ## Display a dialog window with the values entered by the user.\n\n let dialog = newDialog()\n dialog.setModal(true)\n let label1 = newLabel(\" String value is “$1”.\".format(strval))\n label1.setHalign(Align.start)\n dialog.contentArea.packStart(label1, true, true, 5)\n let msg = \" Integer value is $1 which is \".format(intval) &\n (if intval == 75000: \"right. \" else: \"wrong (expected 75000). \")\n let label2 = newLabel(msg)\n dialog.contentArea.packStart(label2, true, true, 5)\n discard dialog.addButton(\"OK\", ord(ResponseType.ok))\n dialog.showAll()\n discard dialog.run()\n dialog.destroy()\n\n#---------------------------------------------------------------------------------------------------\n\nproc onOk(button: Button; window: MainWindow) =\n ## Callback executed when the OK button has been clicked.\n let strval = window.strEntry.text()\n let intval = window.intEntry.value().toInt\n displayValues(strval, intval)\n if intval == 75_000:\n window.destroy()\n\n#---------------------------------------------------------------------------------------------------\n\nproc activate(app: Application) =\n ## Activate the application.\n\n let window = newApplicationWindow(MainWindow, app)\n window.setTitle(\"User input\")\n\n let content = newBox(Orientation.vertical, 10)\n content.setHomogeneous(true)\n let grid = newGrid()\n grid.setColumnSpacing(30)\n let bbox = newButtonBox(Orientation.horizontal)\n bbox.setLayout(ButtonBoxStyle.spread)\n\n let strLabel = newLabel(\"Enter some text\")\n strLabel.setHalign(Align.start)\n window.strEntry = newEntry()\n grid.attach(strLabel, 0, 0, 1, 1)\n grid.attach(window.strEntry, 1, 0, 1, 1)\n\n let intLabel = newLabel(\"Enter 75000\")\n intLabel.setHalign(Align.start)\n window.intEntry = newSpinButtonWithRange(0, 80_000, 1)\n grid.attach(intLabel, 0, 1, 1, 1)\n grid.attach(window.intEntry, 1, 1, 1, 1)\n\n let btnOk = newButton(\"OK\")\n\n bbox.add(btnOk)\n\n content.packStart(grid, true, true, 0)\n content.packEnd(bbox, true, true, 0)\n\n window.setBorderWidth(5)\n window.add(content)\n\n discard btnOk.connect(\"clicked\", onOk, window)\n\n window.showAll()\n\n#———————————————————————————————————————————————————————————————————————————————————————————————————\n\nlet app = newApplication(Application, \"Rosetta.UserInput\")\ndiscard app.connect(\"activate\", activate)\ndiscard app.run()\n","language":"Nim"},{"code":"functor\nimport\n Application\n QTk at 'x-oz://system/wp/QTk.ozf'\n System\ndefine\n Number NumberWidget\n Text\n StatusLabel\n WindowClosed\n GUI = td(action:OnClose\n\t return:WindowClosed\n\t lr(label(text:\"Enter some text:\" width:20)\n\t entry(return:Text glue:ew)\n\t glue:ew)\n\t lr(label(text:\"Enter a number:\" width:20)\n\t numberentry(max:100000 return:Number handle:NumberWidget)\n\t label(handle:StatusLabel width:20)\n\t glue:ew\n\t )\n\t button(text:\"Ok\" glue:ew\n\t\t action:OnClose\n\t\t )\n\t )\n proc {OnClose}\n if {NumberWidget get($)} \\= 75000 then\n\t {StatusLabel set(text:\"Invalid value\")}\n else\n\t {Window close}\n end\n end\n Window = {QTk.build GUI}\n {Window show}\n {Wait WindowClosed}\n {System.showInfo \"You entered; \"#Text#\", \"#Number}\n {Application.exit 0}\nend\n","language":"Oz"},{"code":"use Wx;\n\npackage MyApp;\nuse base 'Wx::App';\nuse Wx qw(wxHORIZONTAL wxVERTICAL wxALL wxALIGN_CENTER);\nuse Wx::Event 'EVT_BUTTON';\n\nour ($frame, $text_input, $integer_input);\n\nsub OnInit\n {$frame = new Wx::Frame\n (undef, -1, 'Input window', [-1, -1], [250, 150]);\n\n my $panel = new Wx::Panel($frame, -1);\n $text_input = new Wx::TextCtrl($panel, -1, '');\n $integer_input = new Wx::SpinCtrl\n ($panel, -1, '', [-1, -1], [-1, -1],\n 0, 0, 100_000);\n\n my $okay_button = new Wx::Button($panel, -1, 'OK');\n EVT_BUTTON($frame, $okay_button, \\&OnQuit);\n\n my $sizer = new Wx::BoxSizer(wxVERTICAL);\n $sizer->Add($_, 0, wxALL | wxALIGN_CENTER, 5)\n foreach $text_input, $integer_input, $okay_button;\n $panel->SetSizer($sizer);\n\n $frame->Show(1);}\n\nsub OnQuit\n {print 'String: ', $text_input->GetValue, \"\\n\";\n print 'Integer: ', $integer_input->GetValue, \"\\n\";\n $frame->Close;}\n\n# ---------------------------------------------------------------\n\npackage main;\n\nMyApp->new->MainLoop;\n","language":"Perl"},{"code":"(phixonline)-->\n <span style=\"color: #000080;font-style:italic;\">-- demo\\rosetta\\User_Input_Graphical.exw</span>\n <span style=\"color: #008080;\">include</span> <span style=\"color: #000000;\">pGUI</span><span style=\"color: #0000FF;\">.</span><span style=\"color: #000000;\">e</span>\n\n <span style=\"color: #004080;\">Ihandle</span> <span style=\"color: #000000;\">dlg</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">label1</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">input1</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">label2</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">input2</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">OK</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">Cancel</span>\n\n <span style=\"color: #008080;\">function</span> <span style=\"color: #000000;\">ok_cb</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #004080;\">Ihandle</span> <span style=\"color: #000000;\">self</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #008080;\">if</span> <span style=\"color: #000000;\">self</span><span style=\"color: #0000FF;\">=</span><span style=\"color: #000000;\">OK</span> <span style=\"color: #008080;\">then</span>\n <span style=\"color: #004080;\">string</span> <span style=\"color: #000000;\">in1</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">IupGetAttribute</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">input1</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #008000;\">\"VALUE\"</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #004080;\">integer</span> <span style=\"color: #000000;\">in2</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">IupGetInt</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">input2</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #008000;\">\"VALUE\"</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #004080;\">string</span> <span style=\"color: #000000;\">msg</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">sprintf</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #008000;\">`\"%s\" and %d`</span><span style=\"color: #0000FF;\">,{</span><span style=\"color: #000000;\">in1</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">in2</span><span style=\"color: #0000FF;\">})</span>\n <span style=\"color: #7060A8;\">IupMessage</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #008000;\">\"You entered\"</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">msg</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #000080;font-style:italic;\">-- (return IUP_CONTINUE if unhappy with input)</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">if</span>\n <span style=\"color: #008080;\">return</span> <span style=\"color: #004600;\">IUP_CLOSE</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">function</span>\n\n <span style=\"color: #7060A8;\">IupOpen</span><span style=\"color: #0000FF;\">()</span>\n <span style=\"color: #000000;\">label1</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">IupLabel</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #008000;\">\"Please enter a string\"</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #000000;\">input1</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">IupText</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #008000;\">`VALUE=\"a string\", EXPAND=HORIZONTAL`</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #000000;\">label2</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">IupLabel</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #008000;\">\"and the number 75000\"</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #000000;\">input2</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">IupText</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #008000;\">\"VALUE=75000, EXPAND=HORIZONTAL, MASK=\"</span><span style=\"color: #0000FF;\">&</span><span style=\"color: #004600;\">IUP_MASK_INT</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #000000;\">OK</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">IupButton</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #008000;\">\"OK\"</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #008000;\">\"ACTION\"</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #7060A8;\">Icallback</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #008000;\">\"ok_cb\"</span><span style=\"color: #0000FF;\">))</span>\n <span style=\"color: #000000;\">Cancel</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">IupButton</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #008000;\">\"Cancel\"</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #008000;\">\"ACTION\"</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #7060A8;\">Icallback</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #008000;\">\"ok_cb\"</span><span style=\"color: #0000FF;\">))</span>\n <span style=\"color: #004080;\">sequence</span> <span style=\"color: #000000;\">buttons</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #0000FF;\">{</span><span style=\"color: #7060A8;\">IupFill</span><span style=\"color: #0000FF;\">(),</span><span style=\"color: #000000;\">OK</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">Cancel</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #7060A8;\">IupFill</span><span style=\"color: #0000FF;\">()}</span>\n <span style=\"color: #004080;\">Ihandle</span> <span style=\"color: #000000;\">strbox</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">IupHbox</span><span style=\"color: #0000FF;\">({</span><span style=\"color: #000000;\">label1</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">input1</span><span style=\"color: #0000FF;\">},</span><span style=\"color: #008000;\">\"ALIGNMENT=ACENTER, PADDING=5\"</span><span style=\"color: #0000FF;\">),</span>\n <span style=\"color: #000000;\">numbox</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">IupHbox</span><span style=\"color: #0000FF;\">({</span><span style=\"color: #000000;\">label2</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">input2</span><span style=\"color: #0000FF;\">},</span><span style=\"color: #008000;\">\"ALIGNMENT=ACENTER, PADDING=5\"</span><span style=\"color: #0000FF;\">),</span>\n <span style=\"color: #000000;\">btnbox</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">IupHbox</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">buttons</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #008000;\">\"PADDING=40\"</span><span style=\"color: #0000FF;\">),</span>\n <span style=\"color: #000000;\">vbox</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">IupVbox</span><span style=\"color: #0000FF;\">({</span><span style=\"color: #000000;\">strbox</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">numbox</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">btnbox</span><span style=\"color: #0000FF;\">},</span> <span style=\"color: #008000;\">\"MARGIN=5x5\"</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: #7060A8;\">IupSetAttribute</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">btnbox</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #008000;\">\"NORMALIZESIZE\"</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #008000;\">\"BOTH\"</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #7060A8;\">IupSetAttribute</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">vbox</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #008000;\">\"GAP\"</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #008000;\">\"5\"</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">if</span>\n <span style=\"color: #000000;\">dlg</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">IupDialog</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">vbox</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #008000;\">`TITLE=\"User Input/Graphical\"`</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #7060A8;\">IupShow</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">dlg</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: #7060A8;\">IupMainLoop</span><span style=\"color: #0000FF;\">()</span>\n <span style=\"color: #7060A8;\">IupClose</span><span style=\"color: #0000FF;\">()</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">if</span>\n<!--\n","language":"Phix"},{"code":"(and\n (call 'sh \"-c\"\n (pack\n \"dialog \\\n --inputbox 'Input a string' 8 60 \\\n --inputbox 'Input a number' 8 20 \\\n 2>\"\n (tmp \"dlg\") ) )\n (split (in (tmp \"dlg\") (line)) \"^I\")\n (cons (pack (car @)) (format (cadr @))) )\n","language":"PicoLisp"},{"code":"FUNCTION PBMAIN () AS LONG\n result$ = INPUTBOX$(\"Enter a string.\")\n MSGBOX result$\n DO\n 'This assumes that 75000 is the ONLY valid input.\n result$ = INPUTBOX$(\"Enter the number 75000.\")\n IF VAL(result$) <> 75000 THEN\n MSGBOX \"You need to enter 75000!\"\n ELSE\n MSGBOX \"You entered the right number.\"\n EXIT DO\n END IF\n LOOP\nEND FUNCTION\n","language":"PowerBASIC"},{"code":"#region Define the Windows Form\n[Void][Reflection.Assembly]::LoadWithPartialName(\"System.Windows.Forms\")\n\n$Form1 = New-Object System.Windows.Forms.Form\n$label1 = New-Object System.Windows.Forms.Label\n$label2 = New-Object System.Windows.Forms.Label\n$txtInputText = New-Object System.Windows.Forms.TextBox\n$txtInputNumber = New-Object System.Windows.Forms.TextBox\n$btnAccept = New-Object System.Windows.Forms.Button\n$label3 = New-Object System.Windows.Forms.Label\n$btnCancel = New-Object System.Windows.Forms.Button\n$SuspendLayout\n#\n# label1\n#\n$label1.AutoSize = $true\n$label1.Location = New-Object System.Drawing.Point(23, 36)\n$label1.Name = \"label1\"\n$label1.Size = New-Object System.Drawing.Size(34, 13)\n$label1.TabIndex = 0\n$label1.Text = \"String\"\n#\n# label2\n#\n$label2.AutoSize = $true\n$label2.Location = New-Object System.Drawing.Point(13, 62)\n$label2.Name = \"label2\"\n$label2.Size = New-Object System.Drawing.Size(44, 13)\n$label2.TabIndex = 1\n$label2.Text = \"Number\"\n#\n# txtInputText\n#\n$txtInputText.Location = New-Object System.Drawing.Point(63, 33)\n$txtInputText.Name = \"txtInputText\"\n$txtInputText.Size = New-Object System.Drawing.Size(100, 20)\n$txtInputText.TabIndex = 0\n#\n# txtInputNumber\n#\n$txtInputNumber.Location = New-Object System.Drawing.Point(63, 59)\n$txtInputNumber.Name = \"txtInputNumber\"\n$txtInputNumber.Size = New-Object System.Drawing.Size(100, 20)\n$txtInputNumber.TabIndex = 1\n$txtInputNumber.Text = \"75000\"\n#\n# btnAccept\n#\n$btnAccept.DialogResult = [System.Windows.Forms.DialogResult]::OK\n$btnAccept.Location = New-Object System.Drawing.Point(16, 94)\n$btnAccept.Name = \"btnAccept\"\n$btnAccept.Size = New-Object System.Drawing.Size(75, 23)\n$btnAccept.TabIndex = 2\n$btnAccept.Text = \"Accept\"\n$btnAccept.UseVisualStyleBackColor = $true\n$btnAccept.add_Click({$rc=\"Accept\"; $Form1.Close()})\n#\n# label3\n#\n$label3.AutoSize = $true\n$label3.Location = New-Object System.Drawing.Point(13, 9)\n$label3.Name = \"label3\"\n$label3.Size = New-Object System.Drawing.Size(173, 13)\n$label3.TabIndex = 5\n$label3.Text = \"Please input a string and a number:\"\n#\n# btnCancel\n#\n$btnCancel.DialogResult = [System.Windows.Forms.DialogResult]::Cancel\n$btnCancel.Location = New-Object System.Drawing.Point(97, 94)\n$btnCancel.Name = \"btnCancel\"\n$btnCancel.Size = New-Object System.Drawing.Size(75, 23)\n$btnCancel.TabIndex = 3\n$btnCancel.Text = \"Cancel\"\n$btnCancel.UseVisualStyleBackColor = $true\n#\n# Form1\n#\n$Form1.AcceptButton = $btnAccept\n$Form1.CancelButton = $btnCancel\n$Form1.ClientSize = New-Object System.Drawing.Size(196, 129)\n$Form1.ControlBox = $false\n$Form1.Controls.Add($btnCancel)\n$Form1.Controls.Add($label3)\n$Form1.Controls.Add($btnAccept)\n$Form1.Controls.Add($txtInputNumber)\n$Form1.Controls.Add($txtInputText)\n$Form1.Controls.Add($label2)\n$Form1.Controls.Add($label1)\n$Form1.Name = \"Form1\"\n$Form1.Text = \"RosettaCode\"\n\n#endregion Define the Windows Form\n\n### Show the input form\n$f = $Form1.ShowDialog()\nif ( $f -eq [System.Windows.Forms.DialogResult]::Cancel ) { \"User selected Cancel\" }\nelse { \"User entered `\"{0}`\" for the text and {1} for the number\" -f $txtInputText.Text, $txtInputNumber.Text }\n","language":"PowerShell"},{"code":"import javax.swing.JOptionPane;\n\nint number = int(JOptionPane.showInputDialog (\"Enter an Integer\"));\nprintln(number);\n\nString string = JOptionPane.showInputDialog (\"Enter a String\");\nprintln(string);\n","language":"Processing"},{"code":"from javax.swing import JOptionPane\n\ndef to_int(n, default=0):\n try:\n return int(n)\n except ValueError:\n return default\n\nnumber = to_int(JOptionPane.showInputDialog (\"Enter an Integer\"))\nprintln(number)\n\na_string = JOptionPane.showInputDialog (\"Enter a String\")\nprintln(a_string)\n","language":"Processing-Python-mode"},{"code":"string$=InputRequester(\"Some Title\",\"Enter a string\",\"\")\nvariable=Val(InputRequester(\"Some other Title\",\"Enter a Number\",\"75000\"))\n","language":"PureBasic"},{"code":"import Tkinter,tkSimpleDialog\n\nroot = Tkinter.Tk()\nroot.withdraw()\n\nnumber = tkSimpleDialog.askinteger(\"Integer\", \"Enter a Number\")\nstring = tkSimpleDialog.askstring(\"String\", \"Enter a String\")\n","language":"Python"},{"code":"import tkinter\nimport tkinter.simpledialog as tks\n\nroot = tkinter.Tk()\nroot.withdraw()\n\nnumber = tks.askinteger(\"Integer\", \"Enter a Number\")\nstring = tks.askstring(\"String\", \"Enter a String\")\n\ntkinter.messagebox.showinfo(\"Results\", f\"Your input:\\n {number} {string}\")\n","language":"Python"},{"code":"$ \\\nimport tkinter\nimport tkinter.simpledialog as tks\n\nroot = tkinter.Tk()\nroot.withdraw()\n\nto_stack(tks.askinteger(\"Integer\", \"Enter a Number\"))\nstring_to_stack(tks.askstring(\"String\", \"Enter a String\"))\n\n \\ python\n\nswap echo cr echo$\n","language":"Quackery"},{"code":"library(gWidgets)\noptions(guiToolkit=\"RGtk2\") ## using gWidgtsRGtk2\n\nw <- gwindow(\"Enter a string and a number\")\nlyt <- glayout(cont=w)\nlyt[1,1] <- \"Enter a string\"\nlyt[1,2] <- gedit(\"\", cont=lyt)\nlyt[2,1] <- \"Enter 75000\"\nlyt[2,2] <- gedit(\"\", cont=lyt)\nlyt[3,2] <- gbutton(\"validate\", cont=lyt, handler=function(h,...) {\n txt <- svalue(lyt[1,2])\n x <- svalue(lyt[2,2])\n x <- gsub(\",\", \"\", x)\n x <- as.integer(x)\n\n if(nchar(txt) > 0 && x == 75000)\n gmessage(\"Congratulations, you followed directions\", parent=w)\n else\n gmessage(\"You failed this simple task\", parent=w)\n})\n","language":"R"},{"code":"#lang racket\n(require racket/gui)\n\n(define str (get-text-from-user \"Hi\" \"Enter a string\"))\n(message-box \"Hi\" (format \"You entered: ~a\" str))\n\n(define n (get-text-from-user \"Hi\" \"Enter a number\"))\n(message-box \"Hi\" (format \"You entered: ~a\"\n (or (string->number n) \"bogus text\")))\n","language":"Racket"},{"code":"use GTK::Simple;\nuse GTK::Simple::App;\n\nmy GTK::Simple::App $app .= new( title => 'User Interaction' );\n\n$app.border-width = 20;\n\n$app.set-content(\n GTK::Simple::VBox.new(\n my $ = GTK::Simple::Label.new( text => 'Enter a string.' ),\n my $str = GTK::Simple::Entry.new,\n my $string = GTK::Simple::Label.new,\n my $ = GTK::Simple::Label.new( text => 'Enter the number 75000' ),\n my $val = GTK::Simple::Entry.new,\n my $correct = GTK::Simple::Label.new,\n )\n);\n\n$str.changed.tap: {\n $string.text = \"You entered: { $str.text }\"\n}\n\n$val.changed.tap: {\n $correct.text = \"That's { 'not' unless $val.text ~~ / ^^ <ws> 75000 <ws> $$ / } 75000!\"\n}\n\n$app.run;\n","language":"Raku"},{"code":"import vis::Render;\nimport vis::Figure;\n\npublic void UserInput2(){\n\tinteger = \"\";\n\tstring = \"\";\n\trow1 = [text(\"Enter a string \"),\n\t\t\ttextfield(\"\",void(str s){string = s;}),\n\t\t\ttext(str(){return \" This input box will give a string by definition.\\n You entered <string>\";})];\n\trow2 = [text(\"Enter 75000\"),\n\t\t\ttextfield(\"\",void(str v){integer = v;}),\n\t\t\ttext(str(){return \" <integer == \"75000\" ? \"Correct\" : \"Wrong\">\";})];\n\trender(grid([row1, row2]));\n}\n","language":"Rascal"},{"code":"REBOL [\n\tTitle: \"Graphical User Input\"\n\tURL: http://rosettacode.org/wiki/User_Input_-_graphical\n]\n\n; Simple GUI's can be defined with 'layout', a special purpose dialect\n; for specifying interfaces. In this case, I describe a gradient\n; background with an instruction label, followed by the input fields\n; and a validation button. It's possible to check dynamically as the\n; user types but I wanted to keep this example as clear as possible.\n\nview layout [\n\n; You can define new widget styles. Here I create a padded label style\n; (so that everything will line up) and a simple indicator light to\n; show if there's a problem with an input field.\n\n\tstyle label vtext 60 \"unlabeled\"\n\tstyle indicator box maroon 24x24\n\n\tbackdrop effect [gradient 0x1 black coal]\n\n\tvtext \"Please enter a string, and the number 75000:\"\n\n; By default, GUI widgets are arranged top down. The 'across' word\n; starts stacking widgets from left to right. 'return' starts a new\n; line -- just like on a typewriter!\n\n\tacross\n\n; Notice I'm using my new label and indicator styles here. Widgets\n; that I need to access later (the input field and the indicator) are\n; assigned to variables.\n\n\tlabel \"string:\" s: field 240 si: indicator return\n\n\tlabel \"number:\" n: field 50 ni: indicator return\n\n\tpad 66\n\tbutton \"validate\" [\n\n; The user may have entered bogus values, so I reset the indicators:\n\n\t\tsi/color: ni/color: maroon\n\n; Now I check to see if the values are correct. For the string, I just\n; care that there is one. For the integer, I make sure that it\n; evaluates to an integer and that it's value is 75000. Because I've\n; already set the indicator colour, I don't care the integer\n; conversion raises an error or not, so I ignore it if anything goes\n; wrong.\n\n\t\tif 0 < length? get-face s [si/color: green]\n\t\terror? try [if 75000 = to-integer get-face n [ni/color: green]]\n\n\t\tshow [si ni] ; Repainting multiple objects at once.\n\t]\n]\n","language":"REBOL"},{"code":"/*REXX pgm prompts (using the OS GUI) for a string & then prompts for a specific number.*/\n#= 75000 /*the number that must be entered. */\nx=\nN=\n do while x=' '; say /*string can't be blanks or null string*/\n say 'Please enter a string: '\n parse pull x\n if x='' then say '***error*** No string entered.'\n end /*while x···*/\n\n do while N\\=#; say /*the number (below) may be ill formed.*/\n say 'Please enter the number:' #\n parse pull N\n if datatype(N, 'N') then N= N / 1 /*normalize the number: 007 4.0 +2 */\n if N\\=# then say '***error*** The number is not correct: ' N.\n end /*while N···*/\nsay\nsay 'The string entered is:' x /*echo the values (string and number. */\nsay 'The number entered is:' N /*stick a fork in it, we're all done. */\n","language":"REXX"},{"code":"Load \"guilib.ring\"\n\nMyApp = New qApp {\n num = 0\n win1 = new qWidget() {\n setwindowtitle(\"Hello World\")\n setGeometry(100,100,370,250)\n\n btn1 = new qpushbutton(win1) {\n setGeometry(130,200,100,30)\n settext(\"Validate\")\n setclickevent(\"Validate()\")}\n\n lineedit1 = new qlineedit(win1) {\n setGeometry(10,100,250,30)\n settext(\"\")}\n\n lineedit2 = new qlineedit(win1) {\n setGeometry(10,150,50,30)\n settext(\"0\")}\n\n label1 = new qLabel(win1) {\n setGeometry(270,100,50,30)\n\t\t setText(\"\")}\n\n label2 = new qLabel(win1) {\n setGeometry(70,150,50,30)\n\t\t setText(\"\")}\n\t\n label3 = new qLabel(win1) {\n setGeometry(10,50,250,30)\n\t\t setText(\"Please enter a string, and the number 75000 :\")}\n show()}\n exec()}\n\nfunc Validate\n lineedit1{temp1 = text()}\n num1 = isdigit(temp1)\n if num1 = 0 label1{settext(\"OK\")} else label1{settext(\"NOT OK\")} ok\n\n lineedit2{temp2 = text()}\n num2 = number(temp2)\n if num2 = 75000 label2{settext(\"OK\")} else label2{settext(\"NOT OK\")} ok\n","language":"Ring"},{"code":"require 'tk'\n\ndef main\n root = TkRoot.new\n l1 = TkLabel.new(root, \"text\" => \"input a string\")\n e1 = TkEntry.new(root)\n l2 = TkLabel.new(root, \"text\" => \"input the number 75000\")\n e2 = TkEntry.new(root) do\n validate \"focusout\"\n validatecommand lambda {e2.value.to_i == 75_000}\n invalidcommand lambda {focus_number_entry(e2)}\n end\n ok = TkButton.new(root) do\n text \"OK\"\n command lambda {validate_input(e1, e2)}\n end\n Tk.grid(l1, e1)\n Tk.grid(l2, e2)\n Tk.grid(\"x\",ok, \"sticky\" => \"w\")\n Tk.mainloop\nend\n\ndef validate_input(text_entry, number_entry)\n if number_entry.value.to_i != 75_000\n focus_number_entry(number_entry)\n else\n puts %Q{You entered: \"#{text_entry.value}\" and \"#{number_entry.value}\"}\n root.destroy\n end\nend\n\ndef focus_number_entry(widget)\n widget \\\n .configure(\"background\" => \"red\", \"foreground\" => \"white\") \\\n .selection_range(0, \"end\") \\\n .focus\nend\n\nmain\n","language":"Ruby"},{"code":"Shoes.app do\n string = ask('Enter a string:')\n begin\n number = ask('Enter the number 75000:')\n end while number.to_i != 75000\n para %Q{you entered the string \"#{string}\" and the number #{number}}\nend\n","language":"Ruby"},{"code":"html \"<TABLE BORDER=1 BGCOLOR=silver>\n<TR><TD colspan=2>Please input a string and a number</TD></TR>\n\n<TR><TD align=right>String</TD><TD><input type=text name=str size=18></TD></TR>\n<TR><TD align=right>Number</TD><TD><input type=number name=num size=18 value=75000></TD></TR>\n\n<TR><TD colspan=2 align=center>\"\n\nbutton #go, \"Accept\", [go]\nbutton #ex, \"Exit\", [ex]\n\nhtml \"</TD></TR></TABLE>\"\nWait\n\n[go]\nprint #request get$(\"str\")\nprint val(#request get$(\"num\"))\nwait\n\n[ex]\nend\n","language":"Run-BASIC"},{"code":"import swing.Dialog.{Message, showInput}\nimport scala.swing.Swing\n\nobject UserInput extends App {\n def responce = showInput(null,\n \"Complete the sentence:\\n\\\"Green eggs and...\\\"\",\n \"Customized Dialog\",\n Message.Plain,\n Swing.EmptyIcon,\n Nil, \"ham\")\n println(responce)\n}\n","language":"Scala"},{"code":"var gtk2 = require('Gtk2') -> init;\n\nvar gui = %s'Gtk2::Builder'.new;\ngui.add_from_string(DATA.slurp);\n\nfunc clicked_ok(*_) {\n var entry = gui.get_object('entry1');\n var text = entry.get_text;\n\n var spinner = gui.get_object('spinbutton1');\n var number = spinner.get_text;\n\n say \"string: #{text}\";\n say \"number: #{number}\";\n\n number == 75000 ? gtk2.main_quit : warn \"Invalid number!\";\n}\n\nfunc clicked_cancel(*_) {\n gtk2.main_quit;\n}\n\ngui.get_object('button1').signal_connect('clicked', clicked_ok);\ngui.get_object('button2').signal_connect('clicked', clicked_cancel);\n\ngtk2.main;\n\n__DATA__\n<?xml version=\"1.0\" encoding=\"UTF-8\"?>\n<interface>\n <requires lib=\"gtk+\" version=\"2.24\"/>\n <!-- interface-naming-policy project-wide -->\n <object class=\"GtkAdjustment\" id=\"adjustment1\">\n <property name=\"upper\">100000</property>\n <property name=\"value\">75000</property>\n <property name=\"step_increment\">1</property>\n <property name=\"page_increment\">10</property>\n </object>\n <object class=\"GtkWindow\" id=\"window1\">\n <property name=\"visible\">True</property>\n <property name=\"can_focus\">False</property>\n <child>\n <object class=\"GtkVBox\" id=\"vbox1\">\n <property name=\"visible\">True</property>\n <property name=\"can_focus\">False</property>\n <child>\n <object class=\"GtkLabel\" id=\"label1\">\n <property name=\"visible\">True</property>\n <property name=\"can_focus\">False</property>\n <property name=\"label\" translatable=\"yes\">Please insert a string and a number:</property>\n </object>\n <packing>\n <property name=\"expand\">True</property>\n <property name=\"fill\">True</property>\n <property name=\"position\">0</property>\n </packing>\n </child>\n <child>\n <object class=\"GtkHBox\" id=\"hbox1\">\n <property name=\"visible\">True</property>\n <property name=\"can_focus\">False</property>\n <child>\n <object class=\"GtkLabel\" id=\"label2\">\n <property name=\"visible\">True</property>\n <property name=\"can_focus\">False</property>\n <property name=\"label\" translatable=\"yes\">string:</property>\n </object>\n <packing>\n <property name=\"expand\">True</property>\n <property name=\"fill\">True</property>\n <property name=\"padding\">55</property>\n <property name=\"position\">0</property>\n </packing>\n </child>\n <child>\n <object class=\"GtkEntry\" id=\"entry1\">\n <property name=\"visible\">True</property>\n <property name=\"can_focus\">True</property>\n <property name=\"invisible_char\">•</property>\n <property name=\"primary_icon_activatable\">False</property>\n <property name=\"secondary_icon_activatable\">False</property>\n <property name=\"primary_icon_sensitive\">True</property>\n <property name=\"secondary_icon_sensitive\">True</property>\n </object>\n <packing>\n <property name=\"expand\">True</property>\n <property name=\"fill\">True</property>\n <property name=\"position\">1</property>\n </packing>\n </child>\n </object>\n <packing>\n <property name=\"expand\">True</property>\n <property name=\"fill\">True</property>\n <property name=\"position\">1</property>\n </packing>\n </child>\n <child>\n <object class=\"GtkHBox\" id=\"hbox2\">\n <property name=\"visible\">True</property>\n <property name=\"can_focus\">False</property>\n <child>\n <object class=\"GtkLabel\" id=\"label3\">\n <property name=\"visible\">True</property>\n <property name=\"can_focus\">False</property>\n <property name=\"label\" translatable=\"yes\">number:</property>\n </object>\n <packing>\n <property name=\"expand\">True</property>\n <property name=\"fill\">True</property>\n <property name=\"position\">0</property>\n </packing>\n </child>\n <child>\n <object class=\"GtkSpinButton\" id=\"spinbutton1\">\n <property name=\"visible\">True</property>\n <property name=\"can_focus\">True</property>\n <property name=\"invisible_char\">•</property>\n <property name=\"primary_icon_activatable\">False</property>\n <property name=\"secondary_icon_activatable\">False</property>\n <property name=\"primary_icon_sensitive\">True</property>\n <property name=\"secondary_icon_sensitive\">True</property>\n <property name=\"adjustment\">adjustment1</property>\n <property name=\"numeric\">True</property>\n </object>\n <packing>\n <property name=\"expand\">True</property>\n <property name=\"fill\">True</property>\n <property name=\"position\">1</property>\n </packing>\n </child>\n </object>\n <packing>\n <property name=\"expand\">True</property>\n <property name=\"fill\">True</property>\n <property name=\"position\">2</property>\n </packing>\n </child>\n <child>\n <object class=\"GtkHButtonBox\" id=\"hbuttonbox1\">\n <property name=\"visible\">True</property>\n <property name=\"can_focus\">False</property>\n <property name=\"layout_style\">spread</property>\n <child>\n <object class=\"GtkButton\" id=\"button1\">\n <property name=\"label\">gtk-ok</property>\n <property name=\"visible\">True</property>\n <property name=\"can_focus\">True</property>\n <property name=\"receives_default\">True</property>\n <property name=\"use_stock\">True</property>\n </object>\n <packing>\n <property name=\"expand\">False</property>\n <property name=\"fill\">False</property>\n <property name=\"position\">0</property>\n </packing>\n </child>\n <child>\n <object class=\"GtkButton\" id=\"button2\">\n <property name=\"label\">gtk-cancel</property>\n <property name=\"visible\">True</property>\n <property name=\"can_focus\">True</property>\n <property name=\"receives_default\">True</property>\n <property name=\"use_stock\">True</property>\n </object>\n <packing>\n <property name=\"expand\">False</property>\n <property name=\"fill\">False</property>\n <property name=\"position\">1</property>\n </packing>\n </child>\n </object>\n <packing>\n <property name=\"expand\">True</property>\n <property name=\"fill\">True</property>\n <property name=\"position\">3</property>\n </packing>\n </child>\n </object>\n </child>\n </object>\n</interface>\n","language":"Sidef"},{"code":"open XWindows ;\nopen Motif ;\n\nval store : string list ref = ref [] ;\n\nval inputWindow = fn () =>\nlet\n val shell = XtAppInitialise \"\" \"demo\" \"top\" [] [ XmNwidth 320, XmNheight 100 ] ;\n val main = XmCreateMainWindow shell \"main\" [ XmNmappedWhenManaged true ] ;\n val enter = XmCreateText main \"inputarea\" [ XmNeditMode XmSINGLE_LINE_EDIT,\n XmNscrollHorizontal false ] ;\n val getinp = fn (w,s,t) => ( store := XmTextGetString enter :: !store ; t )\nin\n\n (\n XtSetCallbacks enter [ (XmNactivateCallback , getinp) ] XmNarmCallback ;\n XtManageChild enter ;\n XtManageChild main ;\n XtRealizeWidget shell\n )\n\nend ;\n\ninputWindow () ;\n","language":"Standard-ML"},{"code":"# create entry widget:\npack [entry .e1]\n\n# read its content:\nset input [.e get]\n","language":"Tcl"},{"code":"pack [entry .e1 -textvar input]\n\n# show the content at any time by\nputs $input\n","language":"Tcl"},{"code":"Prgm\n Dialog\n Title \"Rosetta Code\"\n Request \"A string\", s\n DropDown \"An integer\", {\"75000\"}, n\n EndDlog\n 74999 + n → n\nEndPrgm\n","language":"TI-89-BASIC"},{"code":"strUserIn = InputBox(\"Enter Data\")\nWscript.Echo strUserIn\n","language":"VBScript"},{"code":"Dialog_Input_1(1, \"`User Input example`,\n `??Enter a string `,\n `??Enter a number `\")\n","language":"Vedit-macro-language"},{"code":"import \"graphics\" for Canvas, Color\nimport \"input\" for Keyboard, Clipboard\nimport \"dome\" for Window, Process\n\nvar X = 10\nvar Y = 28\n\nclass Main {\n construct new() {}\n\n init() {\n _text = \"\"\n _enterNum = false\n Keyboard.handleText = true\n Keyboard.textRegion(X, Y, 8, 8)\n }\n\n update() {\n var change = false\n if (Keyboard.text.count > 0) {\n _text = _text + Keyboard.text\n change = true\n }\n\n // enable backspace key to delete last character entered\n if (Keyboard[\"backspace\"].justPressed && _text.count > 0) {\n var codePoints = _text.codePoints\n codePoints = codePoints.take(codePoints.count - 1)\n _text = \"\"\n for (point in codePoints) {\n _text = _text + String.fromCodePoint(point)\n }\n change = true\n }\n\n // enable return key to terminate input\n if (Keyboard[\"return\"].justPressed) {\n System.print(\"'%(_text)' was entered.\")\n if (!_enterNum) {\n _text = \"\"\n _enterNum = true\n change = true\n } else if (_text == \"75000\") {\n Process.exit()\n } else {\n _text = \"\"\n change = true\n }\n }\n\n if (change) {\n Keyboard.textRegion(X.min(_text.count * 8), Y, 8, 8)\n }\n }\n\n draw(dt) {\n Canvas.cls()\n Canvas.rect(X, Y, 8, 8, Color.red)\n if (!_enterNum) {\n Canvas.print(\"Enter Text and press return:\", 10, 10, Color.white)\n } else {\n Canvas.print(\"Enter 75000 and press return:\", 10, 10, Color.white)\n }\n Canvas.print(_text, 10, 20, Color.white)\n }\n}\n\nvar Game = Main.new()\n","language":"Wren"}],"string":"[\n {\n \"code\": \"---\\ncategory:\\n- GUI\\n- Basic language learning\\nfrom: http://rosettacode.org/wiki/User_input/Graphical\\nnote: Text processing\\nrequires:\\n- Graphics\\n\",\n \"language\": \"00-META\"\n },\n {\n \"code\": \"In this task, the goal is to input a string and the integer 75000, from [[graphical user interface]].\\n\\n\\nSee also: [[User input/Text]]\\n<br><br>\\n\\n\",\n \"language\": \"00-TASK\"\n },\n {\n \"code\": \"/* ARM assembly AARCH64 Raspberry PI 3B */\\n/* program inputWin64.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 YPOSTEXTINPUT, 18\\n.equ LGBUFFER, 50\\n.equ FONTSIZE, 6\\n/* constantes X11 */\\n.equ KeyPressed, 2\\n.equ ButtonPress, 4\\n.equ ButtonPress, 4\\n.equ EnterNotify, 7\\n.equ LeaveNotify, 8\\n.equ ClientMessage, 33\\n.equ KeyPressMask, 1\\n.equ ButtonPressMask, 4\\n.equ ButtonReleaseMask, 8\\n.equ ExposureMask, 1<<15\\n.equ StructureNotifyMask, 1<<17\\n.equ EnterWindowMask, 1<<4\\n.equ LeaveWindowMask, 1<<5\\n\\n.equ CWBorderWidth, 1<<4\\n\\n\\n/* structures descriptions are in end oh this program */\\n\\n/*******************************************/\\n/* Initialized data */\\n/*******************************************/\\n.data\\nszRetourligne: .asciz \\\"\\\\n\\\"\\nszMessErreur: .asciz \\\"Server X11 not found.\\\\n\\\"\\nszMessErrfen: .asciz \\\"Error create X11 window.\\\\n\\\"\\nszMessErrGC: .asciz \\\"Error create Graphic Context.\\\\n\\\"\\nszMessErrButton: .asciz \\\"Error create button.\\\\n\\\"\\nszMessErrButtonGC: .asciz \\\"Error create button Graphic Context.\\\\n\\\"\\nszMessErrInput: .asciz \\\"Error create input window.\\\\n\\\"\\nszMessErrInputGC: .asciz \\\"Error create input Graphic Context.\\\\n\\\"\\n//szMessGoodBye: .asciz \\\"There have been no clicks yet\\\"\\nszCursor: .asciz \\\"_\\\"\\nszTextButton: .asciz \\\"PUSH\\\"\\nszMessResult: .asciz \\\"Text : @ Value @ \\\"\\nszLibText: .asciz \\\"Text :\\\"\\nszLibValue: .asciz \\\"Value : \\\"\\n\\nszLibDW: .asciz \\\"WM_DELETE_WINDOW\\\" // message close window\\n\\n/*******************************************/\\n/* UnInitialized data */\\n/*******************************************/\\n.bss\\n.align 4\\nqDisplay: .skip 8 // Display address\\nqDefScreen: .skip 8 // Default screen address\\nidentWin: .skip 8 // window ident\\nqCounterClic: .skip 8 // counter clic button\\n//qLongTexte: .skip 8\\n//ptZoneS: .skip 8 // pointeur zone saisie\\nptMessage: .skip 8 // final message pointer\\nsZoneConv: .skip 24\\nwmDeleteMessage: .skip 16 // ident close message\\nstEvent: .skip 400 // provisional size\\n\\nstButton: .skip BT_fin\\nbuffer: .skip 500\\nstInputText: .skip Input_fin\\nstInputValue: .skip Input_fin\\nstWindowChge: .skip XWCH_fin\\nsSaisieCar: .skip LGBUFFER\\nsTexteSaisi: .skip LGBUFFER\\nsValueSaisi: .skip LGBUFFER\\nkey: .skip 4 // code touche\\n/**********************************************/\\n/* -- Code section */\\n/**********************************************/\\n.text\\n.global main // program entry\\nmain: // INFO: main\\n mov x0,#0 // open server X\\n bl XOpenDisplay\\n cmp x0,#0\\n beq erreur\\n // Ok return Display address\\n ldr x1,qAdrqDisplay\\n str x0,[x1] // store Display address for future use\\n mov x28,x0 // and in register 28\\n\\n ldr x2,[x28,Disp_default_screen] // load default screen\\n ldr x1,qAdrqDefScreen\\n str x2,[x1] //store default_screen\\n mov x2,x28\\n ldr x0,[x2,Disp_screens] // screen list\\n //screen areas\\n ldr x5,[x0,Screen_white_pixel] // white pixel\\n ldr x3,[x0,Screen_black_pixel] // black pixel\\n ldr x4,[x0,Screen_root_depth] // bits par pixel\\n ldr x1,[x0,Screen_root] // root windows\\n // create window x11\\n mov x0,x28 //display\\n mov x2,#0 // position X\\n mov x3,#0 // position Y\\n mov x4,600 // weight\\n mov x5,400 // height\\n mov x6,0 // bordure ???\\n ldr x7,0 // ?\\n ldr x8,qBlanc // background\\n str x8,[sp,-16]! // argument fot stack\\n bl XCreateSimpleWindow\\n add sp,sp,16 // for stack alignement\\n cmp x0,#0 // error ?\\n beq erreurF\\n ldr x1,qAdridentWin\\n str x0,[x1] // store window ident for future use\\n mov x27,x0 // and in register 27\\n\\n // Correction of window closing error\\n mov x0,x28 // Display address\\n ldr x1,qAdrszLibDW // atom name address\\n mov x2,#1 // False create atom if not exist\\n bl XInternAtom\\n cmp x0,#0\\n ble erreurF\\n ldr x1,qAdrwmDeleteMessage // address message\\n str x0,[x1]\\n mov x2,x1 // address atom create\\n mov x0,x28 // display address\\n mov x1,x27 // window ident\\n mov x3,#1 // number of protocoles\\n bl XSetWMProtocols\\n cmp x0,#0\\n ble erreurF\\n // authorization of seizures\\n mov x0,x28 // display address\\n mov x1,x27 // window ident\\n ldr x2,qFenetreMask // mask\\n bl XSelectInput\\n cmp x0,#0\\n ble 99f\\n // create Graphic Context\\n mov x0,x28 // display address\\n mov x1,x27 // window ident\\n bl createGC // GC address -> x26\\n cbz x0,erreurF\\n // create Graphic Context 1\\n mov x0,x28 // display address\\n mov x1,x27 // window ident\\n bl createGC1 // GC address -> x25\\n cbz x0,erreurF\\n // Display window\\n mov x1,x27 // ident window\\n mov x0,x28 // Display address\\n bl XMapWindow\\n\\n ldr x0,qAdrszLibText\\n mov x1,x27\\n mov x2,5\\n mov x3,70\\n bl displayText\\n ldr x0,qAdrszLibValue\\n mov x1,x27\\n mov x2,280\\n mov x3,70\\n bl displayText\\n bl createButton // create button on screen\\n\\n bl createInputText // create input text window\\n\\n bl createInputValue // create input value window\\n\\n1: // events loop\\n bl traitEvents\\n // other events\\n cbz x0,1b // and loop\\n //TODO: close ??\\n mov x0,0 // end Ok\\n b 100f\\n //TODO: close ??\\n\\n3:\\n ldr x0,qAdrstEvent // events structure address\\n bl evtButtonMouse\\n b 1b\\n\\nerreurF: // error create window\\n ldr x0,qAdrszMessErrfen\\n bl affichageMess\\n mov x0,1\\n b 100f\\nerreur: // error no server x11 active\\n ldr x0,qAdrszMessErreur\\n bl affichageMess\\n mov x0,1\\n100: // program standard end\\n mov x8,EXIT\\n svc 0\\nqBlanc: .quad 0xF0F0F0F0\\nqAdrqDisplay: .quad qDisplay\\nqAdrqDefScreen: .quad qDefScreen\\nqAdridentWin: .quad identWin\\nqAdrstEvent: .quad stEvent\\nqAdrszMessErrfen: .quad szMessErrfen\\nqAdrszMessErreur: .quad szMessErreur\\nqAdrwmDeleteMessage: .quad wmDeleteMessage\\nqAdrszLibDW: .quad szLibDW\\n//qAdrszMessGoodBye: .quad szMessGoodBye\\nqAdrszLibText: .quad szLibText\\nqAdrszLibValue: .quad szLibValue\\nqFenetreMask: .quad KeyPressMask|ButtonPressMask|StructureNotifyMask|ExposureMask|EnterWindowMask\\n/********************************************************************/\\n/* Events ***/\\n/********************************************************************/\\ntraitEvents: // INFO: traitEvents\\n stp x20,lr,[sp,-16]! // save registers\\n mov x0,x28 // Display address\\n ldr x1,qAdrstEvent // events structure address\\n bl XNextEvent\\n ldr x0,qAdrstEvent // events structure address\\n ldr x1,[x0,#XAny_window] // what window ?\\n cmp x1,x27 // main window ?\\n bne 1f\\n bl evtMainWindow // yes\\n b 100f\\n1:\\n ldr x10,qAdrstInputText // input text window ?\\n ldr x11,[x10,Input_adresse]\\n cmp x1,x11\\n bne 2f\\n bl evtInputWindowText\\n mov x0,0 // other events\\n b 100f\\n2:\\n ldr x10,qAdrstInputValue // input value window\\n ldr x11,[x10,Input_adresse]\\n cmp x1,x11\\n bne 3f\\n bl evtInputWindowValue\\n mov x0,0 // other events\\n b 100f\\n3:\\n ldr x10,[x0,XAny_window] // window of event\\n ldr x11,qAdrstButton // load button ident\\n ldr x12,[x11,BT_adresse]\\n cmp x10,x12 // equal ?\\n bne 4f // no\\n bl evtButton\\n mov x0,0 // other events\\n b 100f\\n4: // other windows\\n mov x0,0 // other events\\n100:\\n ldp x20,lr,[sp],16 // restaur 2 registers\\n ret // return to address lr x30\\n/******************************************************************/\\n/* main windows events */\\n/******************************************************************/\\n/* x0 contains the events */\\n/* x1 contains the ident Window */\\n/* x0 return 0 if continue , 1 if program end */\\nevtMainWindow: // INFO: evtMainWindow\\n stp x20,lr,[sp,-16]! // save registers\\n ldr w0,[x0] // type in 4 first bytes\\n cmp w0,#ClientMessage // message for close window\\n beq 2f // yes -> end\\n mov x0,0 // other events\\n b 100f // and loop\\n2:\\n ldr x0,qAdrstEvent // events structure address\\n ldr x1,[x0,56] // location message code\\n ldr x2,qAdrwmDeleteMessage // equal ?\\n ldr x2,[x2]\\n mov x0,0\\n cmp x1,x2\\n bne 100f // no loop\\n mov x0,1 // end program\\n100:\\n ldp x20,lr,[sp],16 // restaur 2 registers\\n ret // return to address lr x30\\n/******************************************************************/\\n/* input text windows events */\\n/******************************************************************/\\n/* x0 contains the events */\\n/* x1 contains the ident Window */\\nevtButton: // INFO: evtButton\\n stp x20,lr,[sp,-16]! // save registers\\n ldr x10,[x0,#XAny_type]\\n cmp x10,ButtonPress\\n bne 1f\\n bl evtButtonMouse\\n b 100f\\n1:\\n cmp x10,#EnterNotify // mouse is on the button\\n bne 2f\\n ldr x3,qAdrstWindowChge // and change window border\\n mov x2,3\\n str x2,[x3,#XWCH_border_width]\\n mov x0,x28 // display\\n ldr x2,qFenSMask\\n bl XConfigureWindow\\n b 100f\\n2:\\n cmp x10,#LeaveNotify // mouse is off the button\\n bne 3f\\n ldr x3,qAdrstWindowChge // and change window border\\n mov x2,1\\n str x2,[x3,#XWCH_border_width]\\n mov x0,x28 // display\\n ldr x2,qFenSMask\\n bl XConfigureWindow\\n b 100f\\n3: // other event\\n100:\\n ldp x20,lr,[sp],16 // restaur 2 registers\\n ret // return to address lr x30\\n/******************************************************************/\\n/* input text windows events */\\n/******************************************************************/\\n/* x0 contains the events */\\n/* x1 contains the ident Window */\\nevtInputWindowText: // INFO: evtInputWindowText\\n stp x20,lr,[sp,-16]! // save registers\\n ldr x10,[x0,#XAny_type]\\n mov x20,x1\\n cmp x10,#KeyPressed // key character ?\\n bne 2f\\n // x0 events x1 window ident\\n ldr x2,qAdrstInputText\\n bl traitImput\\n b 100f\\n2:\\n cmp x10,#EnterNotify // mouse is on the window\\n bne 3f\\n ldr x0,qAdrstInputText // display text and cursor\\n bl displayInput\\n mov x1,x20\\n ldr x3,qAdrstWindowChge // and change window border\\n mov x2,3\\n str x2,[x3,#XWCH_border_width]\\n mov x0,x28 // display\\n ldr x2,qFenSMask\\n bl XConfigureWindow\\n b 100f\\n3:\\n cmp x10,#LeaveNotify // the mouse is out the window\\n bne 4f\\n ldr x0,qAdrszCursor // erase the cursor\\n ldr x2,qAdrstInputText\\n ldr x2,[x2,Input_cursor]\\n mov x10,FONTSIZE\\n mul x2,x2,x10\\n mov x3,YPOSTEXTINPUT\\n bl eraseText1\\n mov x1,x20\\n ldr x3,qAdrstWindowChge // and chane window border\\n mov x2,1\\n str x2,[x3,#XWCH_border_width]\\n mov x0,x28 // display\\n ldr x2,qFenSMask\\n bl XConfigureWindow\\n b 100f\\n4: // other event\\n100:\\n ldp x20,lr,[sp],16 // restaur 2 registers\\n ret // return to address lr x30\\nqFenSMask: .quad CWBorderWidth\\nqAdrstWindowChge: .quad stWindowChge\\n/******************************************************************/\\n/* input text windows events */\\n/******************************************************************/\\n/* x0 contains the events */\\n/* x1 contains the ident Window */\\nevtInputWindowValue: // INFO: evtInputWindowValue\\n stp x20,lr,[sp,-16]! // save registers\\n ldr x10,[x0,#XAny_type]\\n mov x20,x1\\n cmp x10,#KeyPressed // cas d'une touche\\n bne 2f\\n // x0 events x1 window ident\\n ldr x2,qAdrstInputValue\\n bl traitImput\\n b 100f\\n2:\\n cmp x10,#EnterNotify // mouse is on the window\\n bne 3f\\n ldr x0,qAdrstInputValue // display text and cursor\\n bl displayInput\\n mov x1,x20\\n ldr x3,qAdrstWindowChge // and change window border\\n mov x2,3\\n str x2,[x3,#XWCH_border_width]\\n mov x0,x28 // display\\n ldr x2,qFenSMask\\n bl XConfigureWindow\\n b 100f\\n3:\\n cmp x10,#LeaveNotify // the mouse is out the window\\n bne 4f\\n ldr x0,qAdrszCursor // erase the cursor\\n ldr x2,qAdrstInputValue\\n ldr x2,[x2,Input_cursor]\\n mov x10,FONTSIZE\\n mul x2,x2,x10\\n mov x3,YPOSTEXTINPUT\\n bl eraseText1\\n mov x1,x20\\n ldr x3,qAdrstWindowChge // and chane window border\\n mov x2,1\\n str x2,[x3,#XWCH_border_width]\\n mov x0,x28 // display\\n ldr x2,qFenSMask\\n bl XConfigureWindow\\n b 100f\\n4: // other event\\n100:\\n ldp x20,lr,[sp],16 // restaur 2 registers\\n ret // return to address lr x30\\n\\n/******************************************************************/\\n/* traitement Key pressed */\\n/******************************************************************/\\n/* x0 contains the event */\\n/* x1 contains the ident Window */\\n/* x2 contains address structure window*/\\ntraitImput: // INFO: traitImput\\n stp x20,lr,[sp,-16]! // save registers\\n mov x20,x2 // save structure address\\n mov x21,x1 // save ident window\\n ldr x1,qAdrsSaisieCar // character input buffer\\n mov x2,#4 // buffer lenght\\n ldr x3,qAdrkey // code character\\n mov x4,0 // Specifies or returns the XComposeStatus structure or NULL.\\n bl XLookupString\\n cmp x0,#1 // character key ?\\n bne 1f\\n ldr x0,qAdrsSaisieCar // input character area\\n ldrb w22,[x0] // load byte\\n cmp x22,#13 // enter ?\\n beq 1f\\n ldr x0,[x20,Input_text] // erase input area\\n mov x1,x21\\n mov x2,0\\n mov x3,YPOSTEXTINPUT\\n bl eraseText1\\n ldr x0,qAdrszCursor\\n ldr x2,[x20,Input_cursor] // erase cursor\\n mov x1,x21\\n mov x10,FONTSIZE // Font size\\n mul x2,x2,x10\\n mov x3,YPOSTEXTINPUT\\n bl eraseText1\\n ldr x13,[x20,Input_text]\\n cmp x22,#8 // back\\n beq back\\n // voir autre touche\\n ldr x4,[x20,Input_cursor] //\\n strb w22,[x13,x4] // store input character at text end\\n add x4,x4,1\\n str x4,[x20,Input_cursor] // maj cursor location\\n b suiteaff\\nback:\\n ldr x4,[x20,Input_cursor] // text size\\n sub x4,x4,#1\\n str x4,[x20,Input_cursor] // maj cursor location\\nsuiteaff:\\n strb wzr,[x13,x4] // zero -> text end\\n mov x0,x20\\n bl displayInput\\n b 100f\\n1: // other key\\n mov x0,x28\\n mov x1,#50\\n bl XBell // sound on\\n\\n100:\\n ldp x20,lr,[sp],16 // restaur 2 registers\\n ret // return to address lr x30\\nqAdrsSaisieCar: .quad sSaisieCar\\nqAdrkey: .quad key\\nqAdrsTexteSaisi: .quad sTexteSaisi\\n/******************************************************************/\\n/* create Graphic Context */\\n/******************************************************************/\\n/* x0 contains the Display address */\\n/* x1 contains the ident Window */\\ncreateGC: // INFO: createGC\\n stp x20,lr,[sp,-16]! // save registers\\n mov x20,x0 // save display address\\n mov x2,#0\\n mov x3,#0\\n bl XCreateGC\\n cbz x0,99f\\n mov x26,x0 // save GC\\n mov x0,x20 // display address\\n mov x1,x26\\n ldr x2,qRed // code RGB color\\n bl XSetForeground\\n cbz x0,99f\\n mov x0,x26 // return GC\\n b 100f\\n99:\\n ldr x0,qAdrszMessErrGC\\n bl affichageMess\\n mov x0,0\\n100:\\n ldp x20,lr,[sp],16 // restaur 2 registers\\n ret // return to address lr x30\\nqAdrszMessErrGC: .quad szMessErrGC\\nqRed: .quad 0xFF0000\\nqGreen: .quad 0xFF00\\nqBlue: .quad 0xFF\\nqBlack: .quad 0x0\\n/******************************************************************/\\n/* create Graphic Context 1 */\\n/******************************************************************/\\n/* x0 contains the Display address */\\n/* x1 contains the ident Window */\\ncreateGC1: // INFO: createGC1\\n stp x20,lr,[sp,-16]! // save registers\\n mov x20,x0 // save display address\\n mov x2,#0\\n mov x3,#0\\n bl XCreateGC\\n cbz x0,99f\\n mov x25,x0 // save GC\\n mov x0,x20 // display address\\n mov x1,x25\\n ldr x2,qBlanc // code RGB color\\n bl XSetForeground\\n cbz x0,99f\\n mov x0,x25 // return GC1\\n b 100f\\n99:\\n ldr x0,qAdrszMessErrGC\\n bl affichageMess\\n mov x0,0\\n100:\\n ldp x20,lr,[sp],16 // restaur 2 registers\\n ret // return to address lr x30\\n/******************************************************************/\\n/* create button on screen */\\n/******************************************************************/\\ncreateButton: // INFO: createButton\\n stp x21,lr,[sp,-16]! // save registers\\n // create button window\\n mov x0,x28 // display address\\n mov x1,x27 // ident window\\n mov x2,500 // X position\\n mov x3,50 // Y position\\n mov x4,60 // weight\\n mov x5,30 // height\\n mov x6,1 // border\\n ldr x7,qBlack\\n ldr x8,qBlanc // background\\n str x8,[sp,-16]! // argument fot stack\\n bl XCreateSimpleWindow\\n add sp,sp,16 // for stack alignement\\n cmp x0,#0 // error ?\\n beq 99f\\n ldr x21,qAdrstButton\\n str x0,[x21,BT_adresse] // save ident button\\n str xzr,[x21,BT_cbdata] // for next use\\n\\n // autorisation des saisies\\n mov x0,x28 // display address\\n ldr x1,[x21,BT_adresse] // button address\\n ldr x2,qButtonMask // mask\\n bl XSelectInput\\n // create Graphic Contexte of button\\n mov x0,x28 // display address\\n ldr x1,[x21,BT_adresse] // button ident\\n mov x2,#0\\n mov x3,#0\\n bl XCreateGC\\n cmp x0,#0\\n beq 98f\\n str x0,[x21,BT_GC] // store GC\\n // display button\\n mov x0,x28 // display address\\n ldr x1,[x21,BT_adresse] // button address\\n bl XMapWindow\\n ldr x0,qAdrszTextButton // text address\\n ldr x1,[x21,BT_adresse] // ident button\\n mov x2,#18 // position x\\n mov x3,#18 // position y\\n bl displayText\\n\\n b 100f\\n98:\\n ldr x0,qAdrszMessErrButtonGC\\n bl affichageMess\\n b 100f\\n99:\\n ldr x0,qAdrszMessErrButton\\n bl affichageMess\\n100:\\n ldp x1,lr,[sp],16 // restaur 2 registers\\n ret // return to address lr x30\\nqAdrstButton: .quad stButton\\nqAdrszTextButton: .quad szTextButton\\nqAdrszMessErrButtonGC: .quad szMessErrButtonGC\\nqAdrszMessErrButton: .quad szMessErrButton\\nqButtonMask: .quad ButtonPressMask|ButtonReleaseMask|StructureNotifyMask|ExposureMask|LeaveWindowMask|EnterWindowMask\\n/******************************************************************/\\n/* create window input text */\\n/******************************************************************/\\ncreateInputText: // INFO: createInputText\\n stp x21,lr,[sp,-16]! // save registers\\n // create button window\\n mov x0,x28 // display address\\n mov x1,x27 // ident window\\n mov x2,50 // X position\\n mov x3,50 // Y position\\n mov x4,200 // weight\\n mov x5,30 // height\\n mov x6,1 // border\\n ldr x7,qBlack\\n ldr x8,qBlanc // background\\n str x8,[sp,-16]! // argument fot stack\\n bl XCreateSimpleWindow\\n add sp,sp,16 // for stack alignement\\n cmp x0,#0 // error ?\\n beq 99f\\n ldr x21,qAdrstInputText\\n str x0,[x21,Input_adresse] // save ident button\\n\\n // autorisation des saisies\\n mov x0,x28 // display address\\n ldr x1,[x21,Input_adresse] // button address\\n ldr x2,qInputMask // mask\\n bl XSelectInput\\n // create Graphic Contexte of button\\n mov x0,x28 // display address\\n ldr x1,[x21,Input_adresse] // button ident\\n mov x2,#0\\n mov x3,#0\\n bl XCreateGC\\n cmp x0,#0\\n beq 98f\\n str x0,[x21,Input_GC] // store GC\\n // display button\\n mov x0,x28 // display address\\n ldr x1,[x21,Input_adresse] // button address\\n bl XMapWindow\\n\\n ldr x6,qAdrsTexteSaisi\\n\\n str x6,[x21,Input_text]\\n str xzr,[x21,Input_cursor]\\n\\n b 100f\\n98:\\n ldr x0,qAdrszMessErrInputGC\\n bl affichageMess\\n b 100f\\n99:\\n ldr x0,qAdrszMessErrInput\\n bl affichageMess\\n100:\\n ldp x1,lr,[sp],16 // restaur 2 registers\\n ret // return to address lr x30\\nqAdrstInputText: .quad stInputText\\nqAdrszMessErrInputGC: .quad szMessErrInputGC\\nqAdrszMessErrInput: .quad szMessErrInput\\nqInputMask: .quad KeyPressMask|StructureNotifyMask|ExposureMask|LeaveWindowMask|EnterWindowMask\\n/******************************************************************/\\n/* create window input text */\\n/******************************************************************/\\ncreateInputValue: // INFO: createInputValue\\n stp x21,lr,[sp,-16]! // save registers\\n // create window\\n mov x0,x28 // display address\\n mov x1,x27 // ident main window\\n mov x2,340 // X position\\n mov x3,50 // Y position\\n mov x4,50 // weight\\n mov x5,30 // height\\n mov x6,1 // border\\n ldr x7,qBlack\\n ldr x8,qBlanc // background\\n str x8,[sp,-16]! // argument fot stack\\n bl XCreateSimpleWindow\\n add sp,sp,16 // for stack alignement\\n cmp x0,#0 // error ?\\n beq 99f\\n ldr x21,qAdrstInputValue\\n str x0,[x21,Input_adresse] // save ident button\\n\\n // autorisation des saisies\\n mov x0,x28 // display address\\n ldr x1,[x21,Input_adresse] // button address\\n ldr x2,qInputMask // mask\\n bl XSelectInput\\n // create Graphic Contexte of button\\n mov x0,x28 // display address\\n ldr x1,[x21,Input_adresse] // button ident\\n mov x2,#0\\n mov x3,#0\\n bl XCreateGC\\n cmp x0,#0\\n beq 98f\\n str x0,[x21,Input_GC] // store GC\\n // display button\\n mov x0,x28 // display address\\n ldr x1,[x21,Input_adresse] // button address\\n bl XMapWindow\\n\\n ldr x6,qAdrsValueSaisi\\n\\n str x6,[x21,Input_text]\\n str xzr,[x21,Input_cursor]\\n\\n b 100f\\n98:\\n ldr x0,qAdrszMessErrInputGC\\n bl affichageMess\\n b 100f\\n99:\\n ldr x0,qAdrszMessErrInput\\n bl affichageMess\\n100:\\n ldp x1,lr,[sp],16 // restaur 2 registers\\n ret // return to address lr x30\\nqAdrstInputValue: .quad stInputValue\\nqAdrsValueSaisi: .quad sValueSaisi\\n/******************************************************************/\\n/* display text on screen */\\n/******************************************************************/\\n/* x0 contains the address of text */\\n/* x1 contains ident window */\\n/* x2 position X */\\n/* x3 position Y */\\ndisplayText: // INFO: displayText\\n stp x1,lr,[sp,-16]! // save registers\\n mov x5,x0 // text address\\n mov x6,0 // text size\\n1: // loop compute text size\\n ldrb w10,[x5,x6] // load text byte\\n cbz x10,2f // zero -> end\\n add x6,x6,1 // increment size\\n b 1b // and loop\\n2:\\n mov x0,x28 // display address\\n mov x4,x3 // position y\\n mov x3,x2 // position x\\n mov x2,x26 // GC address\\n\\n bl XDrawString\\n100:\\n ldp x1,lr,[sp],16 // restaur 2 registers\\n ret // return to address lr x30\\n/******************************************************************/\\n/* erase text on screen */\\n/******************************************************************/\\n/* x0 contains the address of text */\\n/* x1 window ident */\\n/* x2 position x */\\n/* x3 position y */\\neraseText1: // INFO: eraseText1\\n stp x1,lr,[sp,-16]! // save registers\\n mov x5,x0 // text address\\n mov x6,0 // text size\\n1: // loop compute text size\\n ldrb w10,[x5,x6] // load text byte\\n cbz x10,2f // zero -> end\\n add x6,x6,1 // increment size\\n b 1b // and loop\\n2:\\n mov x0,x28 // display address\\n mov x4,x3\\n mov x3,x2\\n mov x2,x25 // GC1 address\\n bl XDrawString\\n100:\\n ldp x1,lr,[sp],16 // restaur 2 registers\\n ret // return to address lr x30\\n/******************************************************************/\\n/* events clic mouse button */\\n/******************************************************************/\\n/* x0 contains the address of event */\\nevtButtonMouse: // INFO: evtButtonMouse\\n stp x20,lr,[sp,-16]! // save registers\\n ldr x10,[x0,XBE_window] // windows of event\\n ldr x11,qAdrstButton // load button ident\\n ldr x12,[x11,BT_adresse]\\n cmp x10,x12 // equal ?\\n bne 100f // no\\n ldr x20,qAdrptMessage // first entry\\n ldr x0,[x20]\\n cbz x0,1f\\n mov x1,x27\\n mov x2,50\\n mov x3,200\\n bl eraseText1 // yes erase the text\\n1:\\n ldr x1,qAdrstInputText // input text\\n ldr x1,[x1,Input_text]\\n ldrb w2,[x1]\\n cbz w2,100f // no input text\\n ldr x0,qAdrszMessResult\\n bl strInsertAtCharInc // insert text at @ character\\n mov x5,x0\\n ldr x1,qAdrstInputValue // input text\\n ldr x0,[x1,Input_text]\\n bl conversionAtoD // conversion value to decimal\\n // x0 contains the input value\\n\\n ldr x1,qAdrsZoneConv // and decimal conversion\\n bl conversion10\\n mov x0,x5\\n ldr x1,qAdrsZoneConv\\n bl strInsertAtCharInc // and insert result at @ character\\n str x0,[x20] // save message address\\n mov x1,x27\\n mov x2,50\\n mov x3,200\\n bl displayText // and display new text\\n\\n100:\\n ldp x20,lr,[sp],16 // restaur 2 registers\\n ret // return to address lr x30\\nqAdrqCounterClic: .quad qCounterClic\\nqAdrsZoneConv: .quad sZoneConv\\nqAdrszMessResult: .quad szMessResult\\nqAdrptMessage: .quad ptMessage\\n\\n/******************************************************************/\\n/* display input area */\\n/******************************************************************/\\n/* x0 contains area structure */\\ndisplayInput: // INFO: displayInput\\n stp x1,lr,[sp,-16]! // save registers\\n mov x10,x0 // save structure\\n ldr x0,[x10,Input_text] // text\\n ldr x6,[x10,Input_cursor] // position curseur\\n cbz x6,1f // if zero no text\\n mov x0,x28 // display address\\n ldr x1,[x10,Input_adresse] // ident window\\n ldr x2,[x10,Input_GC] // GC address\\n mov x3,0 // position x\\n mov x4,YPOSTEXTINPUT // position y\\n ldr x5,[x10,Input_text] // text\\n bl XDrawString\\n1: // display cursor\\n mov x0,x28 // Display address\\n ldr x1,[x10,Input_adresse] // ident window\\n ldr x2,[x10,Input_GC] // GC address\\n ldr x3,[x10,Input_cursor] // position x\\n mov x10,FONTSIZE\\n mul x3,x3,x10\\n mov x4,YPOSTEXTINPUT // position y\\n ldr x5,qAdrszCursor // cursor text\\n mov x6,1 // length\\n bl XDrawString\\n100:\\n ldp x1,lr,[sp],16 // restaur 2 registers\\n ret // return to address lr x30\\nqAdrszCursor: .quad szCursor\\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/* Structures */\\n/********************************************/\\n/*************************************************/\\n/* INFO: Structures */\\n/*********************************************/\\n/* Display définition */\\n .struct 0\\nDisp_ext_data: /* hook for extension to hang data */\\n .struct Disp_ext_data + 8\\nDisp_private1:\\n .struct Disp_private1 + 8\\nDisp_fd: /* Network socket. */\\n .struct Disp_fd + 4\\nDisp_private2:\\n .struct Disp_private2 + 4\\nDisp_proto_major_version: /* major version of server's X protocol */\\n .struct Disp_proto_major_version + 4\\nDisp_proto_minor_version: /* minor version of servers X protocol */\\n .struct Disp_proto_minor_version + 4\\nDisp_vendor: /* vendor of the server hardware OK*/\\n .struct Disp_vendor + 8\\nDisp_private3:\\n .struct Disp_private3 + 8\\nDisp_private8:\\n .struct Disp_private8 + 8\\nDisp_private5:\\n .struct Disp_private5 + 8\\nDisp_private6:\\n .struct Disp_private6 + 8\\nDisp_resource_alloc:\\n .struct Disp_resource_alloc + 8\\nDisp_byte_order: /* screen byte order, LSBFirst, MSBFirst */\\n .struct Disp_byte_order+ 4\\nDisp_bitmap_unit: /* padding and data requirements */\\n .struct Disp_bitmap_unit + 4\\nDisp_bitmap_pad: /* padding requirements on bitmaps */\\n .struct Disp_bitmap_pad + 4\\nDisp_bitmap_bit_order: /* LeastSignificant or MostSignificant */\\n .struct Disp_bitmap_bit_order + 4\\nDisp_nformats: /* number of pixmap formats in list */\\n .struct Disp_nformats + 8\\nDisp_pixmap_format: /* pixmap format list */\\n .struct Disp_pixmap_format + 8\\nDisp_private28:\\n .struct Disp_private28 + 4\\nDisp_release: /* release of the server */\\n .struct Disp_release + 4\\nDisp_private9:\\n .struct Disp_private9 + 8\\nDisp_private10:\\n .struct Disp_private10 + 8\\nDisp_qlen: /* Length of input event queue */\\n .struct Disp_qlen + 8 /* correction dec19 */\\nDisp_last_request_read: /* seq number of last event read */\\n .struct Disp_last_request_read + 8\\nDisp_request: /* sequence number of last request. */\\n .struct Disp_request + 8\\nDisp_private11:\\n .struct Disp_private11 + 8\\nDisp_private12:\\n .struct Disp_private12 + 8\\nDisp_private13:\\n .struct Disp_private13 + 8\\nDisp_private14:\\n .struct Disp_private14 + 8 /* correction Vim */\\nDisp_max_request_size: /* maximum number 32 bit words in request*/\\n .struct Disp_max_request_size + 8\\nDisp_db:\\n .struct Disp_db + 8 /* correction Vim */\\nDisp_private15:\\n .struct Disp_private15 + 8 /* correction Vim */\\nDisp_display_name: /* \\\"host:display\\\" string used on this connect*/\\n .struct Disp_display_name + 8\\nDisp_default_screen: /* default screen for operations */\\n .struct Disp_default_screen + 4\\nDisp_nscreens: /* number of screens on this server*/\\n .struct Disp_nscreens + 4\\nDisp_screens: /* pointer to list of screens */\\n .struct Disp_screens + 8\\nDisp_motion_buffer: /* size of motion buffer */\\n .struct Disp_motion_buffer + 8\\nDisp_private16:\\n .struct Disp_private16 + 8\\nDisp_min_keycode: /* minimum defined keycode */\\n .struct Disp_min_keycode + 4\\nDisp_max_keycode: /* maximum defined keycode */\\n .struct Disp_max_keycode + 4\\nDisp_private17:\\n .struct Disp_private17 + 8\\nDisp_private18:\\n .struct Disp_private18 + 8\\nDisp_private19:\\n .struct Disp_private19 + 8\\nDisp_xdefaults: /* contents of defaults from server */\\n .struct Disp_xdefaults + 8\\nDisp_fin:\\n/*****************************************/\\n/* Screen définition */\\n .struct 0\\nScreen_ext_data: /* hook for extension to hang data */\\n .struct Screen_ext_data + 8\\nScreen_Xdisplay: /* back pointer to display structure */\\n .struct Screen_Xdisplay + 8\\nScreen_root: /* Root window id. */\\n .struct Screen_root + 8\\nScreen_width:\\n .struct Screen_width + 4\\nScreen_height:\\n .struct Screen_height + 4\\nScreen_mwidth: /* width and height of in millimeters */\\n .struct Screen_mwidth + 4\\nScreen_mheight:\\n .struct Screen_mheight + 4\\nScreen_ndepths: /* number of depths possible */\\n .struct Screen_ndepths + 8\\nScreen_depths: /* list of allowable depths on the screen */\\n .struct Screen_depths + 8\\nScreen_root_depth: /* bits per pixel */\\n .struct Screen_root_depth + 8\\nScreen_root_visual: /* root visual */\\n .struct Screen_root_visual + 8\\nScreen_default_gc: /* GC for the root root visual */\\n .struct Screen_default_gc + 8\\nScreen_cmap: /* default color map */\\n .struct Screen_cmap + 8\\nScreen_white_pixel:\\n .struct Screen_white_pixel + 8\\nScreen_black_pixel:\\n .struct Screen_black_pixel + 8\\nScreen_max_maps: /* max and min color maps */\\n .struct Screen_max_maps + 4\\nScreen_min_maps:\\n .struct Screen_min_maps + 4\\nScreen_backing_store: /* Never, WhenMapped, Always */\\n .struct Screen_backing_store + 8\\nScreen_save_unders:\\n .struct Screen_save_unders + 8\\nScreen_root_input_mask: /* initial root input mask */\\n .struct Screen_root_input_mask + 8\\nScreen_fin:\\n/**********************************************/\\n/* Button structure */\\n .struct 0\\nBT_cbdata:\\n .struct BT_cbdata + 8\\nBT_adresse:\\n .struct BT_adresse + 8\\nBT_GC:\\n .struct BT_GC + 8\\nBT_Font:\\n .struct BT_Font + 8\\nBT_fin:\\n/****************************************/\\n/* Input text structure */\\n .struct 0\\n\\nInput_adresse:\\n .struct Input_adresse + 8\\nInput_GC:\\n .struct Input_GC + 8\\nInput_text:\\n .struct Input_text + 8\\nInput_cursor:\\n .struct Input_cursor + 8\\nInput_Font:\\n .struct Input_Font + 8\\nInput_fin:\\n/***************************************************/\\n/* structure XButtonEvent */\\n .struct 0\\nXBE_type: //event type\\n .struct XBE_type + 8\\nXBE_serial: // No last request processed server */\\n .struct XBE_serial + 8\\nXBE_send_event: // true if this came from a SendEvent request */\\n .struct XBE_send_event + 8\\nXBE_display: // Display the event was read from\\n .struct XBE_display + 8\\nXBE_window: // \\\"event\\\" window it is reported relative to\\n .struct XBE_window + 8\\nXBE_root: // root window that the event occurred on\\n .struct XBE_root + 8\\nXBE_subwindow: // child window\\n .struct XBE_subwindow + 8\\nXBE_time: // milliseconds\\n .struct XBE_time + 8\\nXBE_x: // pointer x, y coordinates in event window\\n .struct XBE_x + 8\\nXBE_y:\\n .struct XBE_y + 8\\nXBE_x_root: // coordinates relative to root\\n .struct XBE_x_root + 8\\nXBE_y_root:\\n .struct XBE_y_root + 8\\nXBE_state: // key or button mask\\n .struct XBE_state + 8\\nXBE_button: // detail\\n .struct XBE_button + 8\\nXBE_same_screen: // same screen flag\\n .struct XBE_same_screen + 8\\nXBE_fin:\\n/***************************************************/\\n/* structure XAnyEvent */\\n .struct 0\\nXAny_type:\\n .struct XAny_type + 8\\nXAny_serial:\\n .struct XAny_serial + 8 /* # of last request processed by server */\\nXAny_send_event:\\n .struct XAny_send_event + 8 /* true if this came from a SendEvent request */\\nXAny_display:\\n .struct XAny_display + 8 /* Display the event was read from */\\nXAny_window:\\n .struct XAny_window + 8 /* window on which event was requested in event mask */\\nXany_fin:\\n/****************************************/\\n/* structure de type XWindowChanges */\\n .struct 0\\nXWCH_x:\\n .struct XWCH_x + 4\\nXWCH_y:\\n .struct XWCH_y + 4\\nXWCH_width:\\n .struct XWCH_width + 4\\nXWCH_height:\\n .struct XWCH_height + 4\\nXWCH_border_width:\\n .struct XWCH_border_width + 4\\nXWCH_sibling:\\n .struct XWCH_sibling + 4\\nXWCH_stack_mode:\\n .struct XWCH_stack_mode + 4\\nXWCH_fin:\\n\",\n \"language\": \"AArch64-Assembly\"\n },\n {\n \"code\": \"with Gtk.Button; use Gtk.Button;\\nwith Gtk.GEntry; use Gtk.GEntry;\\nwith Gtk.Label; use Gtk.Label;\\nwith Gtk.Window; use Gtk.Window;\\nwith Gtk.Widget; use Gtk.Widget;\\nwith Gtk.Table; use Gtk.Table;\\n\\nwith Gtk.Handlers;\\nwith Gtk.Main;\\n\\nprocedure Graphic_Input is\\n Window : Gtk_Window;\\n Grid : Gtk_Tnetable;\\n Label : Gtk_Label;\\n Message : Gtk_Label;\\n Edit : Gtk_GEntry;\\n Button : Gtk_Button;\\n\\n package Handlers is new Gtk.Handlers.Callback (Gtk_Widget_Record);\\n package Return_Handlers is\\n new Gtk.Handlers.Return_Callback (Gtk_Widget_Record, Boolean);\\n\\n function Delete_Event (Widget : access Gtk_Widget_Record'Class)\\n return Boolean is\\n begin\\n return False;\\n end Delete_Event;\\n\\n procedure Destroy (Widget : access Gtk_Widget_Record'Class) is\\n begin\\n Gtk.Main.Main_Quit;\\n end Destroy;\\n\\n procedure Clicked (Widget : access Gtk_Widget_Record'Class) is\\n begin\\n if Get_Text (Label) = \\\"Enter integer:\\\" then\\n Set_Text (Message, \\\"Entered:\\\" & Integer'Image (Integer'Value (Get_Text (Edit))));\\n Set_Sensitive (Button, False);\\n else\\n Set_Text (Message, \\\"Entered:\\\" & Get_Text (Edit));\\n Set_Text (Label, \\\"Enter integer:\\\");\\n end if;\\n exception\\n when Constraint_Error =>\\n Set_Text (Message, \\\"Error integer input\\\");\\n end Clicked;\\n\\nbegin\\n Gtk.Main.Init;\\n Gtk.Window.Gtk_New (Window);\\n Gtk_New (Grid, 2, 3, False);\\n Add (Window, Grid);\\n Gtk_New (Label, \\\"Enter string:\\\");\\n Attach (Grid, Label, 0, 1, 0, 1);\\n Gtk_New (Edit);\\n Attach (Grid, Edit, 1, 2, 0, 1);\\n Gtk_New (Button, \\\"OK\\\");\\n Attach (Grid, Button, 2, 3, 0, 1);\\n Gtk_New (Message);\\n Attach (Grid, Message, 0, 3, 1, 2);\\n Return_Handlers.Connect\\n ( Window,\\n \\\"delete_event\\\",\\n Return_Handlers.To_Marshaller (Delete_Event'Access)\\n );\\n Handlers.Connect\\n ( Window,\\n \\\"destroy\\\",\\n Handlers.To_Marshaller (Destroy'Access)\\n );\\n Handlers.Connect\\n ( Button,\\n \\\"clicked\\\",\\n Handlers.To_Marshaller (Clicked'Access)\\n );\\n Show_All (Grid);\\n Show (Window);\\n\\n Gtk.Main.Main;\\nend Graphic_Input;\\n\",\n \"language\": \"Ada\"\n },\n {\n \"code\": \"set input to text returned of (display dialog \\\"Enter text:\\\" default answer \\\"\\\")\\n\",\n \"language\": \"AppleScript\"\n },\n {\n \"code\": \"set input to text returned of (display dialog \\\"Enter a number:\\\" default answer \\\"\\\") as integer\\n\",\n \"language\": \"AppleScript\"\n },\n {\n \"code\": \"InputBox, String, Input, Enter a string:\\nInputBox, Int, Input, Enter an int:\\nMsgbox, You entered \\\"%String%\\\" and \\\"%Int%\\\"\\n\",\n \"language\": \"AutoHotkey\"\n },\n {\n \"code\": \"Gui, Add, Text,, String:\\nGui, Add, Text,, Int:\\nGui, Add, Button, gGo, Go!\\nGui, Add, Edit, vString ym\\nGui, Add, Edit, VInt\\nGui, Show, Center, Input\\nReturn\\n\\nGo:\\nGui, Submit, NoHide\\nMsgbox, You entered \\\"%String%\\\" and \\\"%Int%\\\"\\nExitApp\\nReturn\\n\",\n \"language\": \"AutoHotkey\"\n },\n {\n \"code\": \"OPTION GUI TRUE\\nPRAGMA GUI gtk3\\n\\nDECLARE text TYPE STRING\\nDECLARE data TYPE FLOATING\\n\\ngui = GUIDEFINE(\\\" \\\\\\n { type=WINDOW name=window callback=delete-event title=\\\\\\\"Rosetta Code\\\\\\\" width-request=300 } \\\\\\n { type=BOX name=box parent=window orientation=GTK_ORIENTATION_VERTICAL } \\\\\\n { type=ENTRY name=entry parent=box margin=4 callback=activate } \\\\\\n { type=SPIN_BUTTON name=spin parent=box margin=4 numeric=TRUE } \\\\\\n { type=BUTTON_BOX name=bbox parent=box } \\\\\\n { type=BUTTON name=button parent=bbox margin=4 callback=clicked label=\\\\\\\"Exit\\\\\\\" }\\\")\\n\\nCALL GUISET(gui, \\\"spin\\\", \\\"adjustment\\\", gtk_adjustment_new(75000, 0, 100000, 1, 1, 0))\\n\\nREPEAT\\n event$ = GUIEVENT$(gui)\\nUNTIL event$ = \\\"button\\\" OR event$ = \\\"window\\\"\\n\\nCALL GUIGET(gui, \\\"entry\\\", \\\"text\\\", &text)\\nPRINT text FORMAT \\\"Entered: %s\\\\n\\\"\\n\\nCALL GUIGET(gui, \\\"spin\\\", \\\"value\\\", &data)\\nPRINT data FORMAT \\\"Entered: %g\\\\n\\\"\\n\",\n \"language\": \"BaCon\"\n },\n {\n \"code\": \" INSTALL @lib$+\\\"WINLIB2\\\"\\n INSTALL @lib$+\\\"WINLIB5\\\"\\n ES_NUMBER = 8192\\n\\n form% = FN_newdialog(\\\"Rosetta Code\\\", 100, 100, 100, 64, 8, 1000)\\n PROC_static(form%, \\\"String:\\\", 100, 8, 8, 30, 14, 0)\\n PROC_editbox(form%, \\\"Example\\\", 101, 40, 6, 52, 14, 0)\\n PROC_static(form%, \\\"Number:\\\", 102, 8, 26, 30, 14, 0)\\n PROC_editbox(form%, \\\"75000\\\", 103, 40, 24, 52, 14, ES_NUMBER)\\n PROC_pushbutton(form%, \\\"Read\\\", FN_setproc(PROCread), 30, 43, 40, 16, 0)\\n PROC_showdialog(form%)\\n\\n REPEAT\\n WAIT 1\\n UNTIL !form% = 0\\n QUIT\\n\\n DEF PROCread\\n LOCAL buffer%, number%\\n DIM buffer% LOCAL 255\\n SYS \\\"GetDlgItemText\\\", !form%, 101, buffer%, 255\\n SYS \\\"GetDlgItemInt\\\", !form%, 103, 0, 1 TO number%\\n PRINT \\\"String = \\\"\\\"\\\" $$buffer% \\\"\\\"\\\"\\\"\\n PRINT \\\"Number = \\\" ; number%\\n ENDPROC\\n\",\n \"language\": \"BBC-BASIC\"\n },\n {\n \"code\": \"#include <gtk/gtk.h>\\n\\nvoid ok_hit(GtkButton *o, GtkWidget **w)\\n{\\n GtkMessageDialog *msg;\\n\\n gdouble v = gtk_spin_button_get_value((GtkSpinButton *)w[1]);\\n const gchar *c = gtk_entry_get_text((GtkEntry *)w[0]);\\n\\n msg = (GtkMessageDialog *)\\n gtk_message_dialog_new(NULL,\\n\\t\\t\\t GTK_DIALOG_MODAL,\\n\\t\\t\\t (v==75000) ? GTK_MESSAGE_INFO : GTK_MESSAGE_ERROR,\\n\\t\\t\\t GTK_BUTTONS_OK,\\n\\t\\t\\t \\\"You wrote '%s' and selected the number %d%s\\\",\\n\\t\\t\\t c, (gint)v,\\n\\t\\t\\t (v==75000) ? \\\"\\\" : \\\" which is wrong (75000 expected)!\\\");\\n gtk_widget_show_all(GTK_WIDGET(msg));\\n (void)gtk_dialog_run(GTK_DIALOG(msg));\\n gtk_widget_destroy(GTK_WIDGET(msg));\\n if ( v==75000 ) gtk_main_quit();\\n}\\n\\nint main(int argc, char **argv)\\n{\\n GtkWindow *win;\\n GtkEntry *entry;\\n GtkSpinButton *spin;\\n GtkButton *okbutton;\\n GtkLabel *entry_l, *spin_l;\\n GtkHBox *hbox[2];\\n GtkVBox *vbox;\\n GtkWidget *widgs[2];\\n\\n gtk_init(&argc, &argv);\\n\\n win = (GtkWindow *)gtk_window_new(GTK_WINDOW_TOPLEVEL);\\n gtk_window_set_title(win, \\\"Insert values\\\");\\n\\n entry_l = (GtkLabel *)gtk_label_new(\\\"Insert a string\\\");\\n spin_l = (GtkLabel *)gtk_label_new(\\\"Insert 75000\\\");\\n\\n entry = (GtkEntry *)gtk_entry_new();\\n spin = (GtkSpinButton *)gtk_spin_button_new_with_range(0, 80000, 1);\\n\\n widgs[0] = GTK_WIDGET(entry);\\n widgs[1] = GTK_WIDGET(spin);\\n\\n okbutton = (GtkButton *)gtk_button_new_with_label(\\\"Ok\\\");\\n\\n hbox[0] = (GtkHBox *)gtk_hbox_new(FALSE, 1);\\n hbox[1] = (GtkHBox *)gtk_hbox_new(FALSE, 1);\\n\\n vbox = (GtkVBox *)gtk_vbox_new(TRUE, 1);\\n\\n gtk_container_add(GTK_CONTAINER(hbox[0]), GTK_WIDGET(entry_l));\\n gtk_container_add(GTK_CONTAINER(hbox[0]), GTK_WIDGET(entry));\\n gtk_container_add(GTK_CONTAINER(hbox[1]), GTK_WIDGET(spin_l));\\n gtk_container_add(GTK_CONTAINER(hbox[1]), GTK_WIDGET(spin));\\n\\n gtk_container_add(GTK_CONTAINER(vbox), GTK_WIDGET(hbox[0]));\\n gtk_container_add(GTK_CONTAINER(vbox), GTK_WIDGET(hbox[1]));\\n gtk_container_add(GTK_CONTAINER(vbox), GTK_WIDGET(okbutton));\\n\\n gtk_container_add(GTK_CONTAINER(win), GTK_WIDGET(vbox));\\n\\n g_signal_connect(G_OBJECT(win), \\\"delete-event\\\", (GCallback)gtk_main_quit, NULL);\\n g_signal_connect(G_OBJECT(okbutton), \\\"clicked\\\", (GCallback)ok_hit, widgs);\\n\\n gtk_widget_show_all(GTK_WIDGET(win));\\n gtk_main();\\n\\n return 0;\\n}\\n\",\n \"language\": \"C\"\n },\n {\n \"code\": \"#ifndef TASK_H\\n#define TASK_H\\n\\n#include <QWidget>\\n\\nclass QLabel ;\\nclass QLineEdit ;\\nclass QVBoxLayout ;\\nclass QHBoxLayout ;\\n\\nclass EntryWidget : public QWidget {\\n\\n Q_OBJECT\\npublic :\\n EntryWidget( QWidget *parent = 0 ) ;\\nprivate :\\n QHBoxLayout *upperpart , *lowerpart ;\\n QVBoxLayout *entryLayout ;\\n QLineEdit *stringinput ;\\n QLineEdit *numberinput ;\\n QLabel *stringlabel ;\\n QLabel *numberlabel ;\\n} ;\\n\\n#endif\\n\",\n \"language\": \"C++\"\n },\n {\n \"code\": \"#include <QLineEdit>\\n#include <QLabel>\\n#include <QHBoxLayout>\\n#include <QVBoxLayout>\\n#include <QString>\\n#include \\\"task.h\\\"\\n\\nEntryWidget::EntryWidget ( QWidget *parent )\\n : QWidget( parent ) {\\n entryLayout = new QVBoxLayout( this ) ;\\n stringlabel = new QLabel( \\\"Enter a string!\\\" ) ;\\n stringinput = new QLineEdit( \\\"\\\" ) ;\\n stringinput->setMaxLength( 20 ) ;\\n stringinput->setInputMask( QString( \\\"AAAAAAAAAAAAAAAAAAA\\\" ) ) ;\\n upperpart = new QHBoxLayout ;\\n upperpart->addWidget( stringlabel ) ;\\n upperpart->addWidget( stringinput ) ;\\n numberlabel = new QLabel( \\\"Enter a number!\\\" ) ;\\n numberinput = new QLineEdit( \\\"0\\\" ) ;\\n numberinput->setMaxLength( 5 ) ;\\n numberinput->setInputMask( QString( \\\"99999\\\" ) ) ;\\n lowerpart = new QHBoxLayout ;\\n lowerpart->addWidget( numberlabel ) ;\\n lowerpart->addWidget( numberinput ) ;\\n entryLayout->addLayout( upperpart ) ;\\n entryLayout->addLayout( lowerpart ) ;\\n setLayout( entryLayout ) ;\\n}\\n\",\n \"language\": \"C++\"\n },\n {\n \"code\": \"#include <QApplication>\\n#include \\\"task.h\\\"\\n\\nint main( int argc , char *argv[ ] ) {\\n QApplication app( argc , argv ) ;\\n EntryWidget theWidget ;\\n theWidget.show( ) ;\\n return app.exec( ) ;\\n}\\n\",\n \"language\": \"C++\"\n },\n {\n \"code\": \"(import 'javax.swing.JOptionPane)\\n(let [number (-> \\\"Enter an Integer\\\"\\n JOptionPane/showInputDialog\\n Integer/parseInt)\\n string (JOptionPane/showInputDialog \\\"Enter a String\\\")]\\n [number string])\\n\",\n \"language\": \"Clojure\"\n },\n {\n \"code\": \"(capi:prompt-for-string \\\"Enter a string:\\\")\\n\",\n \"language\": \"Common-Lisp\"\n },\n {\n \"code\": \"(do ((number 0) (okp t))\\n ((or (not okp) (= 75000 number)))\\n (multiple-value-setq (number okp)\\n (capi:prompt-for-integer \\\"Enter an integer:\\\")))\\n\",\n \"language\": \"Common-Lisp\"\n },\n {\n \"code\": \"(capi:prompt-for-integer \\\"Enter an integer:\\\"\\n :ok-check #'(lambda (n) (= n 75000)))\\n\",\n \"language\": \"Common-Lisp\"\n },\n {\n \"code\": \"(capi:define-interface string/integer-prompt () ()\\n (:panes\\n (string-pane\\n capi:text-input-pane\\n :title \\\"Enter a string:\\\")\\n (integer-pane\\n capi:text-input-pane\\n :title \\\"Enter an integer:\\\"\\n :change-callback :redisplay-interface))\\n (:layouts\\n (main\\n capi:column-layout\\n '(string-pane integer-pane))))\\n\",\n \"language\": \"Common-Lisp\"\n },\n {\n \"code\": \"(defun string/integer-prompt-value (pane)\\n (with-slots (string-pane integer-pane) pane\\n (let* ((string (capi:text-input-pane-text string-pane))\\n (integer-string (capi:text-input-pane-text integer-pane))\\n (integer (when (every 'digit-char-p integer-string)\\n (parse-integer integer-string :junk-allowed t))))\\n (values (cons string integer)))))\\n\",\n \"language\": \"Common-Lisp\"\n },\n {\n \"code\": \"(defun do-prompting ()\\n (capi:popup-confirmer\\n (make-instance 'string/integer-prompt)\\n \\\"Enter some values:\\\"\\n :value-function 'string/integer-prompt-value\\n :ok-check #'(lambda (result) (eql (cdr result) 75000))))\\n\",\n \"language\": \"Common-Lisp\"\n },\n {\n \"code\": \"import 'package:flutter/material.dart';\\n\\nmain() => runApp( OutputLabel() );\\n\\nclass OutputLabel extends StatefulWidget {\\n @override\\n _OutputLabelState createState() => _OutputLabelState();\\n}\\n\\nclass _OutputLabelState extends State<OutputLabel> {\\n String output = \\\"output\\\"; // This will be displayed in an output text field\\n\\n TextEditingController _stringInputController = TextEditingController(); // Allows us to get the text from a text field\\n TextEditingController _numberInputController = TextEditingController();\\n\\n @override\\n Widget build( BuildContext context ) {\\n return MaterialApp(\\n debugShowCheckedModeBanner: false, // Disable debug banner in top right\\n home: Scaffold ( // Scaffold provides a layout for the app\\n body: Center ( // Everything in the center widget will be centered\\n child: Column ( // All the widgets will be in a column\\n children: <Widget> [\\n SizedBox( height: 25 ), // Space between top and text field\\n\\n TextField ( // String input Text Field\\n controller: _stringInputController, // Add input controller so we can grab text\\n textAlign: TextAlign.center, // Center text\\n decoration: InputDecoration( border: OutlineInputBorder(), labelText: 'Enter a string...'), // Border and default text\\n ), // end TextField\\n\\n SizedBox( height: 10 ), // Space between text fields\\n\\n TextField ( // Number input Text Field\\n controller: _numberInputController, // Add input controller so we can grab text\\n textAlign: TextAlign.center, // Center text\\n decoration: InputDecoration( border: OutlineInputBorder(), labelText: 'Enter 75000'), // Border and default text\\n ), // end TextField\\n\\n FlatButton ( // Submit Button\\n child: Text('Submit Data'), // Button Text\\n color: Colors.blue[400] // button color\\n onPressed: () { // On pressed Callback for button\\n setState( () {\\n output = ''; // Reset output\\n\\n int number; // Int to store number in\\n\\n var stringInput = _stringInputController.text ?? ''; // Get the input from the first field, if it is null set it to an empty string\\n\\n var numberString = _numberInputController.text ?? ''; // Get the input from the second field, if it is null set it to an empty string\\n\\n if ( stringInput == '') { // If first field is empty\\n output = 'Please enter something in field 1\\\\n';\\n return;\\n }\\n\\n if (_numberInputController.text == '') { // If second field is empty\\n output += 'Please enter something in field 2';\\n return;\\n } else { // If we got an input in the second field\\n\\n try {\\n number = int.parse( numberString ); // Parse numberString into an int\\n\\n if ( number == 75000 )\\n output = 'text output: $stringInput\\\\nnumber: $number'; // Grabs the text from the input controllers and changes the string\\n else\\n output = '$number is not 75000!';\\n\\n } on FormatException { // If a number is not entered in second field\\n output = '$numberString is not a number!';\\n }\\n\\n }\\n\\n });\\n }\\n ), // End FlatButton\\n\\n Text( output ) // displays output\\n\\n ]\\n )\\n )\\n )\\n );\\n }\\n}\\n\",\n \"language\": \"Dart\"\n },\n {\n \"code\": \"program UserInputGraphical;\\n\\n{$APPTYPE CONSOLE}\\n\\nuses SysUtils, Dialogs;\\n\\nvar\\n s: string;\\n lStringValue: string;\\n lIntegerValue: Integer;\\nbegin\\n lStringValue := InputBox('User input/Graphical', 'Enter a string', '');\\n\\n repeat\\n s := InputBox('User input/Graphical', 'Enter the number 75000', '75000');\\n lIntegerValue := StrToIntDef(s, 0);\\n if lIntegerValue <> 75000 then\\n ShowMessage('Invalid entry: ' + s);\\n until lIntegerValue = 75000;\\nend.\\n\",\n \"language\": \"Delphi\"\n },\n {\n \"code\": \"s = input[\\\"Enter a string: \\\"]\\ni = parseInt[input[\\\"Enter an integer: \\\"]]\\n\",\n \"language\": \"Frink\"\n },\n {\n \"code\": \"[s,i] = input[\\\"Dialog title\\\", [\\\"Enter a string\\\", \\\"Enter an integer\\\"]]\\ni = parseInt[i]\\n\",\n \"language\": \"Frink\"\n },\n {\n \"code\": \"hTextBox As TextBox\\nhValueBox As ValueBox\\nhLabel As Label\\n\\nPublic Sub Form_Open()\\n\\nWith Me\\n .Height = 100\\n .Width = 300\\n .padding = 5\\n .Arrangement = Arrange.Vertical\\n .Title = \\\"User input/Graphical\\\"\\nEnd With\\n\\nhTextBox = New TextBox(Me) As \\\"TextBox1\\\"\\nhTextBox.Expand = True\\n\\nhValueBox = New ValueBox(Me) As \\\"ValueBox1\\\"\\nhValueBox.Expand = True\\n\\nhLabel = New Label(Me)\\nhLabel.expand = True\\n\\nEnd\\n\\nPublic Sub TextBox1_Change()\\n\\nhLabel.text = hTextBox.Text & \\\" - \\\" & Str(hValueBox.value)\\n\\nEnd\\n\\nPublic Sub valueBox1_Change()\\n\\nTextBox1_Change\\n\\nEnd\\n\",\n \"language\": \"Gambas\"\n },\n {\n \"code\": \"package main\\n\\nimport (\\n \\\"github.com/gotk3/gotk3/gtk\\\"\\n \\\"log\\\"\\n \\\"math/rand\\\"\\n \\\"strconv\\\"\\n \\\"time\\\"\\n)\\n\\nfunc validateInput(window *gtk.Window, str1, str2 string) bool {\\n n, err := strconv.ParseFloat(str2, 64)\\n if len(str1) == 0 || err != nil || n != 75000 {\\n dialog := gtk.MessageDialogNew(\\n window,\\n gtk.DIALOG_MODAL,\\n gtk.MESSAGE_ERROR,\\n gtk.BUTTONS_OK,\\n \\\"Invalid input\\\",\\n )\\n dialog.Run()\\n dialog.Destroy()\\n return false\\n }\\n return true\\n}\\n\\nfunc check(err error, msg string) {\\n if err != nil {\\n log.Fatal(msg, err)\\n }\\n}\\n\\nfunc main() {\\n rand.Seed(time.Now().UnixNano())\\n gtk.Init(nil)\\n\\n window, err := gtk.WindowNew(gtk.WINDOW_TOPLEVEL)\\n check(err, \\\"Unable to create window:\\\")\\n window.SetTitle(\\\"Rosetta Code\\\")\\n window.SetPosition(gtk.WIN_POS_CENTER)\\n window.Connect(\\\"destroy\\\", func() {\\n gtk.MainQuit()\\n })\\n\\n vbox, err := gtk.BoxNew(gtk.ORIENTATION_VERTICAL, 1)\\n check(err, \\\"Unable to create vertical box:\\\")\\n vbox.SetBorderWidth(1)\\n\\n hbox1, err := gtk.BoxNew(gtk.ORIENTATION_HORIZONTAL, 1)\\n check(err, \\\"Unable to create first horizontal box:\\\")\\n\\n hbox2, err := gtk.BoxNew(gtk.ORIENTATION_HORIZONTAL, 1)\\n check(err, \\\"Unable to create second horizontal box:\\\")\\n\\n label, err := gtk.LabelNew(\\\"Enter a string and the number 75000 \\\\n\\\")\\n check(err, \\\"Unable to create label:\\\")\\n\\n sel, err := gtk.LabelNew(\\\"String: \\\")\\n check(err, \\\"Unable to create string entry label:\\\")\\n\\n nel, err := gtk.LabelNew(\\\"Number: \\\")\\n check(err, \\\"Unable to create number entry label:\\\")\\n\\n se, err := gtk.EntryNew()\\n check(err, \\\"Unable to create string entry:\\\")\\n\\n ne, err := gtk.EntryNew()\\n check(err, \\\"Unable to create number entry:\\\")\\n\\n hbox1.PackStart(sel, false, false, 2)\\n hbox1.PackStart(se, false, false, 2)\\n\\n hbox2.PackStart(nel, false, false, 2)\\n hbox2.PackStart(ne, false, false, 2)\\n\\n // button to accept\\n ab, err := gtk.ButtonNewWithLabel(\\\"Accept\\\")\\n check(err, \\\"Unable to create accept button:\\\")\\n ab.Connect(\\\"clicked\\\", func() {\\n // read and validate the entered values\\n str1, _ := se.GetText()\\n str2, _ := ne.GetText()\\n if validateInput(window, str1, str2) {\\n window.Destroy() // close window if input is OK\\n }\\n })\\n\\n vbox.Add(label)\\n vbox.Add(hbox1)\\n vbox.Add(hbox2)\\n vbox.Add(ab)\\n window.Add(vbox)\\n\\n window.ShowAll()\\n gtk.Main()\\n}\\n\",\n \"language\": \"Go\"\n },\n {\n \"code\": \"import javax.swing.JOptionPane\\n\\ndef number = JOptionPane.showInputDialog (\\\"Enter an Integer\\\") as Integer\\ndef string = JOptionPane.showInputDialog (\\\"Enter a String\\\")\\n\\nassert number instanceof Integer\\nassert string instanceof String\\n\",\n \"language\": \"Groovy\"\n },\n {\n \"code\": \"import Graphics.UI.Gtk\\nimport Control.Monad\\n\\nmain = do\\n initGUI\\n\\n window <- windowNew\\n set window [windowTitle := \\\"Graphical user input\\\", containerBorderWidth := 10]\\n\\n vb <- vBoxNew False 0\\n containerAdd window vb\\n\\n hb1 <- hBoxNew False 0\\n boxPackStart vb hb1 PackNatural 0\\n hb2 <- hBoxNew False 0\\n boxPackStart vb hb2 PackNatural 0\\n\\n lab1 <- labelNew (Just \\\"Enter number 75000\\\")\\n boxPackStart hb1 lab1 PackNatural 0\\n nrfield <- entryNew\\n entrySetText nrfield \\\"75000\\\"\\n boxPackStart hb1 nrfield PackNatural 5\\n\\n strfield <- entryNew\\n boxPackEnd hb2 strfield PackNatural 5\\n lab2 <- labelNew (Just \\\"Enter a text\\\")\\n boxPackEnd hb2 lab2 PackNatural 0\\n\\n accbox <- hBoxNew False 0\\n boxPackStart vb accbox PackNatural 5\\n im <- imageNewFromStock stockApply IconSizeButton\\n acceptButton <- buttonNewWithLabel \\\"Accept\\\"\\n buttonSetImage acceptButton im\\n boxPackStart accbox acceptButton PackRepel 0\\n\\n txtstack <- statusbarNew\\n boxPackStart vb txtstack PackNatural 0\\n id <- statusbarGetContextId txtstack \\\"Line\\\"\\n\\n widgetShowAll window\\n\\n onEntryActivate nrfield (showStat nrfield txtstack id)\\n onEntryActivate strfield (showStat strfield txtstack id)\\n\\n onPressed acceptButton $ do\\n g <- entryGetText nrfield\\n if g==\\\"75000\\\" then\\n widgetDestroy window\\n else do\\n msgid <- statusbarPush txtstack id \\\"You didn't enter 75000. Try again\\\"\\n return ()\\n\\n onDestroy window mainQuit\\n mainGUI\\n\\nshowStat :: Entry -> Statusbar -> ContextId -> IO ()\\nshowStat fld stk id = do\\n txt <- entryGetText fld\\n let mesg = \\\"You entered \\\\\\\"\\\" ++ txt ++ \\\"\\\\\\\"\\\"\\n msgid <- statusbarPush stk id mesg\\n return ()\\n\",\n \"language\": \"Haskell\"\n },\n {\n \"code\": \"*Main> main\\n\",\n \"language\": \"Haskell\"\n },\n {\n \"code\": \"CHARACTER string*100\\n\\nDLG(Edit=string, Edit=num_value, Button='&OK', TItle='Enter 75000 for num_value')\\nWRITE(Messagebox, Name) \\\"You entered\\\", string, num_value\\n\",\n \"language\": \"HicEst\"\n },\n {\n \"code\": \"procedure main()\\nWOpen(\\\"size=800,800\\\") | stop(\\\"Unable to open window\\\")\\nWWrite(\\\"Enter a string:\\\")\\ns := WRead()\\nWWrite(\\\"You entered \\\",image(s))\\nWWrite(\\\"Enter the integer 75000:\\\")\\ni := WRead()\\nif i := integer(i) then\\n WWrite(\\\"You entered: \\\",i)\\nelse\\n WWrite(image(i),\\\" isn't an integer\\\")\\nWDone()\\nend\\n\\nlink graphics\\n\",\n \"language\": \"Icon\"\n },\n {\n \"code\": \"SIMPLEGUI=: noun define\\npc simpleGui;\\ncc IntegerLabel static;cn \\\"Enter the integer 75000\\\";\\ncc integer edit;\\ncc TextLabel static;cn \\\"Enter text\\\";\\ncc text edit;\\ncc accept button;cn \\\"Accept\\\";\\npshow;\\n)\\n\\nsimpleGui_run=: wd bind SIMPLEGUI\\nsimpleGui_close=: wd bind 'pclose'\\nsimpleGui_cancel=: simpleGui_close\\n\\nsimpleGui_accept_button=: verb define\\n ttxt=. text\\n tint=. _\\\". integer\\n if. tint ~: 75000 do.\\n wdinfo 'Integer entered was not 75000.'\\n else.\\n simpleGui_close ''\\n 'simpleGui_text simpleGui_integer'=: ttxt;tint\\n end.\\n)\\n\\nsimpleGui_run''\\n\",\n \"language\": \"J\"\n },\n {\n \"code\": \"SIMPLEGUI=: noun define\\npc simpleGui;\\nxywh 136 39 44 12;cc accept button;cn \\\"Accept\\\";\\nxywh 0 14 60 11;cc IntegerLabel static ss_right;cn \\\"Enter an integer\\\";\\nxywh 65 13 60 12;cc integer edit;\\nxywh 0 39 60 11;cc TextLabel static ss_right;cn \\\"Enter text\\\";\\nxywh 64 38 60 12;cc text edit;\\npas 6 6;pcenter;\\nrem form end;\\n)\\n\\nsimpleGui_run=: verb define\\n wd SIMPLEGUI\\n wd 'set integer *', \\\": 75000\\n wd 'pshow;'\\n)\\n\\nsimpleGui_accept_button=: verb define\\n ttxt=. text\\n tint=. _\\\". integer NB. invalid integers assigned value _\\n if. tint ~: 75000 do.\\n wdinfo 'Integer entered was not 75000.'\\n else.\\n simpleGui_close ''\\n 'simpleGui_text simpleGui_integer'=: ttxt;tint\\n end.\\n)\\n\\nsimpleGui_close=: wd bind 'pclose'\\nsimpleGui_cancel=: simpleGui_close\\n\\nsimpleGui_run''\\n\",\n \"language\": \"J\"\n },\n {\n \"code\": \"import javax.swing.*;\\n\\npublic class GetInputSwing {\\n public static void main(String[] args) throws Exception {\\n int number = Integer.parseInt(\\n JOptionPane.showInputDialog (\\\"Enter an Integer\\\"));\\n String string = JOptionPane.showInputDialog (\\\"Enter a String\\\");\\n }\\n}\\n\",\n \"language\": \"Java\"\n },\n {\n \"code\": \"var str = prompt(\\\"Enter a string\\\");\\nvar value = 0;\\nwhile (value != 75000) {\\n value = parseInt( prompt(\\\"Enter the number 75000\\\") );\\n}\\n\",\n \"language\": \"JavaScript\"\n },\n {\n \"code\": \"using Gtk\\n\\nfunction twoentrywindow()\\n txt = \\\"Enter Text Here\\\"\\n txtchanged = false\\n\\n win = GtkWindow(\\\"Keypress Test\\\", 500, 100) |> (GtkFrame() |> (vbox = GtkBox(:v)))\\n lab = GtkLabel(\\\"Enter some text in the first box and 7500 into the second box.\\\")\\n txtent = GtkEntry()\\n set_gtk_property!(txtent,:text,\\\"Enter Some Text Here\\\")\\n nument = GtkEntry()\\n set_gtk_property!(nument,:text,\\\"Enter the number seventy-five thousand here\\\")\\n push!(vbox, lab, txtent, nument)\\n\\n function keycall(w, event)\\n strtxt = get_gtk_property(txtent, :text, String)\\n numtxt = get_gtk_property(nument, :text, String)\\n if strtxt != txt && occursin(\\\"75000\\\", numtxt)\\n set_gtk_property!(lab, :label, \\\"You have accomplished the task.\\\")\\n end\\n end\\n signal_connect(keycall, win, \\\"key-press-event\\\")\\n\\n cond = Condition()\\n endit(w) = notify(cond)\\n signal_connect(endit, win, :destroy)\\n showall(win)\\n wait(cond)\\nend\\n\\ntwoentrywindow()\\n\",\n \"language\": \"Julia\"\n },\n {\n \"code\": \"// version 1.1\\n\\nimport javax.swing.JOptionPane\\n\\nfun main(args: Array<String>) {\\n do {\\n val number = JOptionPane.showInputDialog(\\\"Enter 75000\\\").toInt()\\n } while (number != 75000)\\n}\\n\",\n \"language\": \"Kotlin\"\n },\n {\n \"code\": \"' [RC] User input/graphical\\n\\n ' Typical LB graphical input/output example.This shows how LB takes user input.\\n ' You'd usually do more validating of input.\\n\\n\\n nomainwin ' No console window needed.\\n\\n textbox#w.tb1, 100, 20, 200, 30\\n textbox#w.tb2, 100, 60, 200, 30\\n textbox#w.tb3, 100,160, 200, 30\\n\\n statictext #w.st1, \\\"String =\\\", 10, 30, 90, 30\\n statictext #w.st2, \\\"Integer =\\\", 10, 70, 90, 30\\n\\n button #w.b1, \\\"Read and Show\\\", [buttonClicked], LR, 180, 70\\n\\n WindowWidth =360\\n WindowHeight =240\\n UpperLeftX = 40\\n UpperLeftY = 40\\n\\n open \\\"User input of integer & string\\\" for window as #w\\n\\n #w \\\"trapclose [quit]\\\" ' Clean exit routine.\\n #w.tb1 \\\"!font courier 12\\\"\\n #w.tb2 \\\"!font courier 12\\\"\\n #w.tb3 \\\"!font courier 12 bold\\\"\\n #w.st1 \\\"!font courier 12\\\"\\n #w.st2 \\\"!font courier 12\\\"\\n\\n #w.tb1 \\\"Change this string.\\\"\\n #w.tb2 \\\"Enter an integer here.\\\"\\n #w.tb3 \\\"Display will be here.\\\"\\n\\n #w.tb1 \\\"!selectall\\\"\\n\\n wait\\n\\n [buttonClicked] ' Button-clicked routine collects data\\n #w.tb1 \\\"!contents? in1$\\\"\\n #w.tb2 \\\"!contents? in2$\\\"\\n #w.tb3 in1$; \\\" \\\"; int( val( in2$))\\n wait\\n\\n [quit]\\n close #w\\n end\\n\",\n \"language\": \"Liberty-BASIC\"\n },\n {\n \"code\": \"Module CheckIt {\\n Def aName$=\\\"No Name\\\", Num$\\n \\\\\\\\ we open a new stack, and hold old\\n Stack New {\\n If Ask$(\\\"Give your name:\\\",,,,,aName$)=\\\"OK\\\" Then Read aName$\\n If Ask$(\\\"Give a Number: (75000)\\\",,,,,\\\"\\\")=\\\"OK\\\" Then Read Num$\\n if Num$<>\\\"75000\\\" or aName$=\\\"\\\" Then loop\\n }\\n \\\\ now old stack came back\\n Print Num$, aName$\\n Print Letter$ \\\\\\\\ Letter$ pop a string from stack\\n}\\nCheckIt \\\"Thank You\\\"\\n\",\n \"language\": \"M2000-Interpreter\"\n },\n {\n \"code\": \"Module Checkit {\\n Declare Form1 Form\\n Declare Inp1 Textbox Form Form1\\n Declare Inp2 Textbox Form Form1\\n With Inp1, \\\"Prompt\\\", \\\"String: \\\", \\\"MaxCharLength\\\", 30+8, \\\"ShowAlways\\\", 1, \\\"ThisKind\\\" as info$, \\\"VarText\\\" as Aname$\\n info$=\\\" <write your name>\\\"\\n With Inp2, \\\"Prompt\\\", \\\"Integer: \\\", \\\"MaxCharLength\\\", 10+9, \\\"VarText\\\" as Feed$, \\\"ThisKind\\\",\\\" sec\\\", \\\"ShowAlways\\\", 1\\n feed$=\\\"0\\\"\\n\\n \\\\\\\\ local1, and Event service functions have module visibility.\\n \\\\\\\\ So they have to use Read New to make new references (shadow old), and use local (the same for SUBS)\\n \\\\\\\\ Event's service functions can't use parents Subs, but Local1 can be used (exist in a list visible to Events)\\n Function Local1 (new Feed$) {\\n \\\\\\\\ this function can be used from other Integer\\n \\\\\\\\ this$ and thispos, exist just before the call of this function\\n local sgn$\\n if feed$=\\\"\\\" and this$=\\\"-\\\" then thispos-- : exit\\n if left$(this$,1)=\\\"-\\\" then sgn$=\\\"-\\\": this$=mid$(this$, 2)\\n if this$<>Trim$(this$) then this$=Feed$ : thispos-- : exit\\n If Trim$(this$)=\\\"\\\" then this$=\\\"0\\\" : thispos=2 : exit\\n if instr(this$,\\\"+\\\")>0 and sgn$=\\\"-\\\" then this$=filter$(this$, \\\"+\\\") : sgn$=\\\"\\\"\\n if instr(this$,\\\"-\\\")>0 and sgn$=\\\"\\\" then this$=filter$(this$, \\\"-\\\") : sgn$=\\\"-\\\"\\n if filter$(this$,\\\"0123456789\\\")<>\\\"\\\" then this$=Feed$ : thispos-- : exit\\n if len(this$)>1 then While left$(this$,1)=\\\"0\\\" {this$=mid$(this$, 2)}\\n this$=sgn$+this$\\n if this$=\\\"-0\\\" then this$=\\\"-\\\" : thispos=2\\n }\\n Function Inp1.ValidString {\\n Read New &this$\\n While left$(this$, 1)=\\\" \\\" { this$=mid$(this$, 2)}\\n info$=str$(30-Len(This$), \\\"\\\\<0\\\\>\\\")\\n }\\n Function Inp2.ValidString {\\n \\\\\\\\ this function called direct from textbox\\n Read New &this$, &thispos\\n Call Local local1(Feed$)\\n }\\n Function Form1.Unload {\\n Read New &Quit\\n If feed$<>\\\"75000\\\" Or Aname$=\\\"\\\" then {\\n \\\\\\\\ open messagebox, pressing cancel quit Unload\\n Quit=Ask(\\\"Data isn't correct\\\")=2\\n }\\n }\\n Method Inp1, \\\"Move\\\", 2000,2000, 6000, 600\\n Method Inp2, \\\"Move\\\", 2000,3000, 6000, 600\\n Method Form1, \\\"Show\\\", 1\\n If Feed$=\\\"75000\\\" and Aname$<>\\\"\\\" Then Print \\\"Thank You\\\"\\n Declare Form1 Nothing\\n}\\nCheckit\\n\",\n \"language\": \"M2000-Interpreter\"\n },\n {\n \"code\": \"str = InputString[\\\"Input a string\\\"]; nb =\\n InputString[\\\"Input a number\\\"]; Print[str, \\\" \\\" , ToString@nb]\\n\",\n \"language\": \"Mathematica\"\n },\n {\n \"code\": \"import Nanoquery.Util.Windows\\n\\n// a function to handle the main window closing\\ndef finish(caller, event)\\n\\texit\\nend\\n\\n// create a window\\nw = new(Window, \\\"Input\\\").setTitle(\\\"Input\\\")\\nw.setSize(320, 190)\\nw.setHandler(w.closing, finish)\\n\\n// create two labels to go next to the input boxes\\nstringlabel = new(Label).setParent(w)\\nintlabel = new(Label).setParent(w)\\n\\nstringlabel.setText(\\\"String: \\\"); stringlabel.setPosition(20, 25)\\nintlabel.setText(\\\"Integer: \\\"); intlabel.setPosition(20, 75)\\n\\n// create two textboxes for input\\nstringbox = new(Textbox).setParent(w)\\nintbox = new(Textbox).setParent(w)\\n\\nstringbox.setPosition(100, 20); stringbox.setWidth(200); stringbox.setHeight(30)\\nintbox.setPosition(100, 70); intbox.setWidth(200); intbox.setHeight(30)\\n\\n// a function that handles when the 'done' button is clicked\\ndef done_clicked(caller, event)\\n\\tglobal stringbox\\n\\tglobal intbox\\n\\tglobal w\\n\\n\\ts = stringbox.getText()\\n\\ti = intbox.getText()\\n\\n\\ttry\\n\\t\\tif int(i) = 75000\\n\\t\\t\\tprintln \\\"String: \\\" + s\\n\\t\\t\\tprintln \\\"Integer: \\\" + i\\n\\t\\t\\texit\\n\\t\\telse\\n\\t\\t\\tw.showMessageBox(\\\"Please enter 75000 for the integer value\\\")\\n\\t\\tend\\n\\tcatch\\n\\t\\tw.showMessageBox(\\\"Please enter 75000 for the integer value\\\")\\n\\tend\\nend\\n\\n// create the 'done' button\\ndone = new(Button).setParent(w)\\n\\ndone.setText(\\\"Done\\\"); done.setPosition(250,120)\\ndone.setHandler(done.clicked, done_clicked)\\n\\n// display the window\\nw.show()\\n\",\n \"language\": \"Nanoquery\"\n },\n {\n \"code\": \"/* NetRexx */\\noptions replace format comments java crossref symbols nobinary\\nimport javax.swing.JOptionPane\\n\\nunumber = 0\\nustring = ''\\n\\ndo\\n unumber = Integer.parseInt(JOptionPane.showInputDialog(\\\"Enter an Integer\\\"))\\n ustring = JOptionPane.showInputDialog(\\\"Enter a String\\\")\\ncatch ex = Exception\\n ex.printStackTrace\\nend\\n\\nunumber = unumber * 1.0 -- just to prove unumber is really a number\\nsay 'Number:' unumber.right(10)', String:' ustring\\n\\nreturn\\n\",\n \"language\": \"NetRexx\"\n },\n {\n \"code\": \"; file: input-gui.lsp\\n; url: http://rosettacode.org/wiki/User_input/Graphical\\n; author: oofoe 2012-02-02\\n\\n; Colours\\n(setq ok '(.8 1 .8) fail '(1 .5 .5))\\n\\n; Load library and initialize GUI server:\\n(load (append (env \\\"NEWLISPDIR\\\") \\\"/guiserver.lsp\\\"))\\n(gs:init)\\n\\n; Validation Callback\\n\\n; There is a bug in the \\\"gs:get-text\\\" function that causes it to fail\\n; silently if the text field is empty. Therfore, I set the field\\n; background to red first and only clear it if the field returns\\n; correctly.\\n(define (validate)\\n (gs:set-color 'string fail)\\n (if (not (empty? (gs:get-text 'string)))\\n (gs:set-color 'string ok))\\n\\n (gs:set-color 'number fail)\\n (if (= 75000 (int (gs:get-text 'number)))\\n (gs:set-color 'number ok))\\n )\\n\\n; Create main window frame and set layout.\\n(gs:frame 'main 100 100 256 128 \\\"User Input/Graphical\\\")\\n(gs:set-flow-layout 'main \\\"left\\\" 4 4)\\n\\n; Create and add widgets.\\n(gs:label 'instructions \\\"Please enter a string and the number 75000:\\\")\\n(gs:text-field 'string 'validate 32)\\n(gs:text-field 'number 'validate 8)\\n(gs:button 'check 'validate \\\"validate...\\\")\\n(gs:add-to 'main 'instructions 'string 'number 'check)\\n\\n; Show main window.\\n(gs:set-visible 'main true)\\n\\n; Start event loop.\\n(gs:listen)\\n\\n; No (exit) needed -- guiserver kills program on window close.\\n\",\n \"language\": \"NewLISP\"\n },\n {\n \"code\": \"import strutils\\nimport gintro/[glib, gobject, gtk, gio]\\n\\ntype MainWindow = ref object of ApplicationWindow\\n strEntry: Entry\\n intEntry: SpinButton\\n\\n#---------------------------------------------------------------------------------------------------\\n\\nproc displayValues(strval: string; intval: int) =\\n ## Display a dialog window with the values entered by the user.\\n\\n let dialog = newDialog()\\n dialog.setModal(true)\\n let label1 = newLabel(\\\" String value is “$1”.\\\".format(strval))\\n label1.setHalign(Align.start)\\n dialog.contentArea.packStart(label1, true, true, 5)\\n let msg = \\\" Integer value is $1 which is \\\".format(intval) &\\n (if intval == 75000: \\\"right. \\\" else: \\\"wrong (expected 75000). \\\")\\n let label2 = newLabel(msg)\\n dialog.contentArea.packStart(label2, true, true, 5)\\n discard dialog.addButton(\\\"OK\\\", ord(ResponseType.ok))\\n dialog.showAll()\\n discard dialog.run()\\n dialog.destroy()\\n\\n#---------------------------------------------------------------------------------------------------\\n\\nproc onOk(button: Button; window: MainWindow) =\\n ## Callback executed when the OK button has been clicked.\\n let strval = window.strEntry.text()\\n let intval = window.intEntry.value().toInt\\n displayValues(strval, intval)\\n if intval == 75_000:\\n window.destroy()\\n\\n#---------------------------------------------------------------------------------------------------\\n\\nproc activate(app: Application) =\\n ## Activate the application.\\n\\n let window = newApplicationWindow(MainWindow, app)\\n window.setTitle(\\\"User input\\\")\\n\\n let content = newBox(Orientation.vertical, 10)\\n content.setHomogeneous(true)\\n let grid = newGrid()\\n grid.setColumnSpacing(30)\\n let bbox = newButtonBox(Orientation.horizontal)\\n bbox.setLayout(ButtonBoxStyle.spread)\\n\\n let strLabel = newLabel(\\\"Enter some text\\\")\\n strLabel.setHalign(Align.start)\\n window.strEntry = newEntry()\\n grid.attach(strLabel, 0, 0, 1, 1)\\n grid.attach(window.strEntry, 1, 0, 1, 1)\\n\\n let intLabel = newLabel(\\\"Enter 75000\\\")\\n intLabel.setHalign(Align.start)\\n window.intEntry = newSpinButtonWithRange(0, 80_000, 1)\\n grid.attach(intLabel, 0, 1, 1, 1)\\n grid.attach(window.intEntry, 1, 1, 1, 1)\\n\\n let btnOk = newButton(\\\"OK\\\")\\n\\n bbox.add(btnOk)\\n\\n content.packStart(grid, true, true, 0)\\n content.packEnd(bbox, true, true, 0)\\n\\n window.setBorderWidth(5)\\n window.add(content)\\n\\n discard btnOk.connect(\\\"clicked\\\", onOk, window)\\n\\n window.showAll()\\n\\n#———————————————————————————————————————————————————————————————————————————————————————————————————\\n\\nlet app = newApplication(Application, \\\"Rosetta.UserInput\\\")\\ndiscard app.connect(\\\"activate\\\", activate)\\ndiscard app.run()\\n\",\n \"language\": \"Nim\"\n },\n {\n \"code\": \"functor\\nimport\\n Application\\n QTk at 'x-oz://system/wp/QTk.ozf'\\n System\\ndefine\\n Number NumberWidget\\n Text\\n StatusLabel\\n WindowClosed\\n GUI = td(action:OnClose\\n\\t return:WindowClosed\\n\\t lr(label(text:\\\"Enter some text:\\\" width:20)\\n\\t entry(return:Text glue:ew)\\n\\t glue:ew)\\n\\t lr(label(text:\\\"Enter a number:\\\" width:20)\\n\\t numberentry(max:100000 return:Number handle:NumberWidget)\\n\\t label(handle:StatusLabel width:20)\\n\\t glue:ew\\n\\t )\\n\\t button(text:\\\"Ok\\\" glue:ew\\n\\t\\t action:OnClose\\n\\t\\t )\\n\\t )\\n proc {OnClose}\\n if {NumberWidget get($)} \\\\= 75000 then\\n\\t {StatusLabel set(text:\\\"Invalid value\\\")}\\n else\\n\\t {Window close}\\n end\\n end\\n Window = {QTk.build GUI}\\n {Window show}\\n {Wait WindowClosed}\\n {System.showInfo \\\"You entered; \\\"#Text#\\\", \\\"#Number}\\n {Application.exit 0}\\nend\\n\",\n \"language\": \"Oz\"\n },\n {\n \"code\": \"use Wx;\\n\\npackage MyApp;\\nuse base 'Wx::App';\\nuse Wx qw(wxHORIZONTAL wxVERTICAL wxALL wxALIGN_CENTER);\\nuse Wx::Event 'EVT_BUTTON';\\n\\nour ($frame, $text_input, $integer_input);\\n\\nsub OnInit\\n {$frame = new Wx::Frame\\n (undef, -1, 'Input window', [-1, -1], [250, 150]);\\n\\n my $panel = new Wx::Panel($frame, -1);\\n $text_input = new Wx::TextCtrl($panel, -1, '');\\n $integer_input = new Wx::SpinCtrl\\n ($panel, -1, '', [-1, -1], [-1, -1],\\n 0, 0, 100_000);\\n\\n my $okay_button = new Wx::Button($panel, -1, 'OK');\\n EVT_BUTTON($frame, $okay_button, \\\\&OnQuit);\\n\\n my $sizer = new Wx::BoxSizer(wxVERTICAL);\\n $sizer->Add($_, 0, wxALL | wxALIGN_CENTER, 5)\\n foreach $text_input, $integer_input, $okay_button;\\n $panel->SetSizer($sizer);\\n\\n $frame->Show(1);}\\n\\nsub OnQuit\\n {print 'String: ', $text_input->GetValue, \\\"\\\\n\\\";\\n print 'Integer: ', $integer_input->GetValue, \\\"\\\\n\\\";\\n $frame->Close;}\\n\\n# ---------------------------------------------------------------\\n\\npackage main;\\n\\nMyApp->new->MainLoop;\\n\",\n \"language\": \"Perl\"\n },\n {\n \"code\": \"(phixonline)-->\\n <span style=\\\"color: #000080;font-style:italic;\\\">-- demo\\\\rosetta\\\\User_Input_Graphical.exw</span>\\n <span style=\\\"color: #008080;\\\">include</span> <span style=\\\"color: #000000;\\\">pGUI</span><span style=\\\"color: #0000FF;\\\">.</span><span style=\\\"color: #000000;\\\">e</span>\\n\\n <span style=\\\"color: #004080;\\\">Ihandle</span> <span style=\\\"color: #000000;\\\">dlg</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">label1</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">input1</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">label2</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">input2</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">OK</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">Cancel</span>\\n\\n <span style=\\\"color: #008080;\\\">function</span> <span style=\\\"color: #000000;\\\">ok_cb</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #004080;\\\">Ihandle</span> <span style=\\\"color: #000000;\\\">self</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #008080;\\\">if</span> <span style=\\\"color: #000000;\\\">self</span><span style=\\\"color: #0000FF;\\\">=</span><span style=\\\"color: #000000;\\\">OK</span> <span style=\\\"color: #008080;\\\">then</span>\\n <span style=\\\"color: #004080;\\\">string</span> <span style=\\\"color: #000000;\\\">in1</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">IupGetAttribute</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">input1</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #008000;\\\">\\\"VALUE\\\"</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #004080;\\\">integer</span> <span style=\\\"color: #000000;\\\">in2</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">IupGetInt</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">input2</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #008000;\\\">\\\"VALUE\\\"</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #004080;\\\">string</span> <span style=\\\"color: #000000;\\\">msg</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">sprintf</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #008000;\\\">`\\\"%s\\\" and %d`</span><span style=\\\"color: #0000FF;\\\">,{</span><span style=\\\"color: #000000;\\\">in1</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">in2</span><span style=\\\"color: #0000FF;\\\">})</span>\\n <span style=\\\"color: #7060A8;\\\">IupMessage</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #008000;\\\">\\\"You entered\\\"</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">msg</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #000080;font-style:italic;\\\">-- (return IUP_CONTINUE if unhappy with input)</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">if</span>\\n <span style=\\\"color: #008080;\\\">return</span> <span style=\\\"color: #004600;\\\">IUP_CLOSE</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">function</span>\\n\\n <span style=\\\"color: #7060A8;\\\">IupOpen</span><span style=\\\"color: #0000FF;\\\">()</span>\\n <span style=\\\"color: #000000;\\\">label1</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">IupLabel</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #008000;\\\">\\\"Please enter a string\\\"</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #000000;\\\">input1</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">IupText</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #008000;\\\">`VALUE=\\\"a string\\\", EXPAND=HORIZONTAL`</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #000000;\\\">label2</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">IupLabel</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #008000;\\\">\\\"and the number 75000\\\"</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #000000;\\\">input2</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">IupText</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #008000;\\\">\\\"VALUE=75000, EXPAND=HORIZONTAL, MASK=\\\"</span><span style=\\\"color: #0000FF;\\\">&</span><span style=\\\"color: #004600;\\\">IUP_MASK_INT</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #000000;\\\">OK</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">IupButton</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #008000;\\\">\\\"OK\\\"</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #008000;\\\">\\\"ACTION\\\"</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #7060A8;\\\">Icallback</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #008000;\\\">\\\"ok_cb\\\"</span><span style=\\\"color: #0000FF;\\\">))</span>\\n <span style=\\\"color: #000000;\\\">Cancel</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">IupButton</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #008000;\\\">\\\"Cancel\\\"</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #008000;\\\">\\\"ACTION\\\"</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #7060A8;\\\">Icallback</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #008000;\\\">\\\"ok_cb\\\"</span><span style=\\\"color: #0000FF;\\\">))</span>\\n <span style=\\\"color: #004080;\\\">sequence</span> <span style=\\\"color: #000000;\\\">buttons</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #0000FF;\\\">{</span><span style=\\\"color: #7060A8;\\\">IupFill</span><span style=\\\"color: #0000FF;\\\">(),</span><span style=\\\"color: #000000;\\\">OK</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">Cancel</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #7060A8;\\\">IupFill</span><span style=\\\"color: #0000FF;\\\">()}</span>\\n <span style=\\\"color: #004080;\\\">Ihandle</span> <span style=\\\"color: #000000;\\\">strbox</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">IupHbox</span><span style=\\\"color: #0000FF;\\\">({</span><span style=\\\"color: #000000;\\\">label1</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">input1</span><span style=\\\"color: #0000FF;\\\">},</span><span style=\\\"color: #008000;\\\">\\\"ALIGNMENT=ACENTER, PADDING=5\\\"</span><span style=\\\"color: #0000FF;\\\">),</span>\\n <span style=\\\"color: #000000;\\\">numbox</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">IupHbox</span><span style=\\\"color: #0000FF;\\\">({</span><span style=\\\"color: #000000;\\\">label2</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">input2</span><span style=\\\"color: #0000FF;\\\">},</span><span style=\\\"color: #008000;\\\">\\\"ALIGNMENT=ACENTER, PADDING=5\\\"</span><span style=\\\"color: #0000FF;\\\">),</span>\\n <span style=\\\"color: #000000;\\\">btnbox</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">IupHbox</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">buttons</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #008000;\\\">\\\"PADDING=40\\\"</span><span style=\\\"color: #0000FF;\\\">),</span>\\n <span style=\\\"color: #000000;\\\">vbox</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">IupVbox</span><span style=\\\"color: #0000FF;\\\">({</span><span style=\\\"color: #000000;\\\">strbox</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">numbox</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">btnbox</span><span style=\\\"color: #0000FF;\\\">},</span> <span style=\\\"color: #008000;\\\">\\\"MARGIN=5x5\\\"</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: #7060A8;\\\">IupSetAttribute</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">btnbox</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #008000;\\\">\\\"NORMALIZESIZE\\\"</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #008000;\\\">\\\"BOTH\\\"</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #7060A8;\\\">IupSetAttribute</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">vbox</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #008000;\\\">\\\"GAP\\\"</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #008000;\\\">\\\"5\\\"</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">if</span>\\n <span style=\\\"color: #000000;\\\">dlg</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">IupDialog</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">vbox</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #008000;\\\">`TITLE=\\\"User Input/Graphical\\\"`</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #7060A8;\\\">IupShow</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">dlg</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: #7060A8;\\\">IupMainLoop</span><span style=\\\"color: #0000FF;\\\">()</span>\\n <span style=\\\"color: #7060A8;\\\">IupClose</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\": \"(and\\n (call 'sh \\\"-c\\\"\\n (pack\\n \\\"dialog \\\\\\n --inputbox 'Input a string' 8 60 \\\\\\n --inputbox 'Input a number' 8 20 \\\\\\n 2>\\\"\\n (tmp \\\"dlg\\\") ) )\\n (split (in (tmp \\\"dlg\\\") (line)) \\\"^I\\\")\\n (cons (pack (car @)) (format (cadr @))) )\\n\",\n \"language\": \"PicoLisp\"\n },\n {\n \"code\": \"FUNCTION PBMAIN () AS LONG\\n result$ = INPUTBOX$(\\\"Enter a string.\\\")\\n MSGBOX result$\\n DO\\n 'This assumes that 75000 is the ONLY valid input.\\n result$ = INPUTBOX$(\\\"Enter the number 75000.\\\")\\n IF VAL(result$) <> 75000 THEN\\n MSGBOX \\\"You need to enter 75000!\\\"\\n ELSE\\n MSGBOX \\\"You entered the right number.\\\"\\n EXIT DO\\n END IF\\n LOOP\\nEND FUNCTION\\n\",\n \"language\": \"PowerBASIC\"\n },\n {\n \"code\": \"#region Define the Windows Form\\n[Void][Reflection.Assembly]::LoadWithPartialName(\\\"System.Windows.Forms\\\")\\n\\n$Form1 = New-Object System.Windows.Forms.Form\\n$label1 = New-Object System.Windows.Forms.Label\\n$label2 = New-Object System.Windows.Forms.Label\\n$txtInputText = New-Object System.Windows.Forms.TextBox\\n$txtInputNumber = New-Object System.Windows.Forms.TextBox\\n$btnAccept = New-Object System.Windows.Forms.Button\\n$label3 = New-Object System.Windows.Forms.Label\\n$btnCancel = New-Object System.Windows.Forms.Button\\n$SuspendLayout\\n#\\n# label1\\n#\\n$label1.AutoSize = $true\\n$label1.Location = New-Object System.Drawing.Point(23, 36)\\n$label1.Name = \\\"label1\\\"\\n$label1.Size = New-Object System.Drawing.Size(34, 13)\\n$label1.TabIndex = 0\\n$label1.Text = \\\"String\\\"\\n#\\n# label2\\n#\\n$label2.AutoSize = $true\\n$label2.Location = New-Object System.Drawing.Point(13, 62)\\n$label2.Name = \\\"label2\\\"\\n$label2.Size = New-Object System.Drawing.Size(44, 13)\\n$label2.TabIndex = 1\\n$label2.Text = \\\"Number\\\"\\n#\\n# txtInputText\\n#\\n$txtInputText.Location = New-Object System.Drawing.Point(63, 33)\\n$txtInputText.Name = \\\"txtInputText\\\"\\n$txtInputText.Size = New-Object System.Drawing.Size(100, 20)\\n$txtInputText.TabIndex = 0\\n#\\n# txtInputNumber\\n#\\n$txtInputNumber.Location = New-Object System.Drawing.Point(63, 59)\\n$txtInputNumber.Name = \\\"txtInputNumber\\\"\\n$txtInputNumber.Size = New-Object System.Drawing.Size(100, 20)\\n$txtInputNumber.TabIndex = 1\\n$txtInputNumber.Text = \\\"75000\\\"\\n#\\n# btnAccept\\n#\\n$btnAccept.DialogResult = [System.Windows.Forms.DialogResult]::OK\\n$btnAccept.Location = New-Object System.Drawing.Point(16, 94)\\n$btnAccept.Name = \\\"btnAccept\\\"\\n$btnAccept.Size = New-Object System.Drawing.Size(75, 23)\\n$btnAccept.TabIndex = 2\\n$btnAccept.Text = \\\"Accept\\\"\\n$btnAccept.UseVisualStyleBackColor = $true\\n$btnAccept.add_Click({$rc=\\\"Accept\\\"; $Form1.Close()})\\n#\\n# label3\\n#\\n$label3.AutoSize = $true\\n$label3.Location = New-Object System.Drawing.Point(13, 9)\\n$label3.Name = \\\"label3\\\"\\n$label3.Size = New-Object System.Drawing.Size(173, 13)\\n$label3.TabIndex = 5\\n$label3.Text = \\\"Please input a string and a number:\\\"\\n#\\n# btnCancel\\n#\\n$btnCancel.DialogResult = [System.Windows.Forms.DialogResult]::Cancel\\n$btnCancel.Location = New-Object System.Drawing.Point(97, 94)\\n$btnCancel.Name = \\\"btnCancel\\\"\\n$btnCancel.Size = New-Object System.Drawing.Size(75, 23)\\n$btnCancel.TabIndex = 3\\n$btnCancel.Text = \\\"Cancel\\\"\\n$btnCancel.UseVisualStyleBackColor = $true\\n#\\n# Form1\\n#\\n$Form1.AcceptButton = $btnAccept\\n$Form1.CancelButton = $btnCancel\\n$Form1.ClientSize = New-Object System.Drawing.Size(196, 129)\\n$Form1.ControlBox = $false\\n$Form1.Controls.Add($btnCancel)\\n$Form1.Controls.Add($label3)\\n$Form1.Controls.Add($btnAccept)\\n$Form1.Controls.Add($txtInputNumber)\\n$Form1.Controls.Add($txtInputText)\\n$Form1.Controls.Add($label2)\\n$Form1.Controls.Add($label1)\\n$Form1.Name = \\\"Form1\\\"\\n$Form1.Text = \\\"RosettaCode\\\"\\n\\n#endregion Define the Windows Form\\n\\n### Show the input form\\n$f = $Form1.ShowDialog()\\nif ( $f -eq [System.Windows.Forms.DialogResult]::Cancel ) { \\\"User selected Cancel\\\" }\\nelse { \\\"User entered `\\\"{0}`\\\" for the text and {1} for the number\\\" -f $txtInputText.Text, $txtInputNumber.Text }\\n\",\n \"language\": \"PowerShell\"\n },\n {\n \"code\": \"import javax.swing.JOptionPane;\\n\\nint number = int(JOptionPane.showInputDialog (\\\"Enter an Integer\\\"));\\nprintln(number);\\n\\nString string = JOptionPane.showInputDialog (\\\"Enter a String\\\");\\nprintln(string);\\n\",\n \"language\": \"Processing\"\n },\n {\n \"code\": \"from javax.swing import JOptionPane\\n\\ndef to_int(n, default=0):\\n try:\\n return int(n)\\n except ValueError:\\n return default\\n\\nnumber = to_int(JOptionPane.showInputDialog (\\\"Enter an Integer\\\"))\\nprintln(number)\\n\\na_string = JOptionPane.showInputDialog (\\\"Enter a String\\\")\\nprintln(a_string)\\n\",\n \"language\": \"Processing-Python-mode\"\n },\n {\n \"code\": \"string$=InputRequester(\\\"Some Title\\\",\\\"Enter a string\\\",\\\"\\\")\\nvariable=Val(InputRequester(\\\"Some other Title\\\",\\\"Enter a Number\\\",\\\"75000\\\"))\\n\",\n \"language\": \"PureBasic\"\n },\n {\n \"code\": \"import Tkinter,tkSimpleDialog\\n\\nroot = Tkinter.Tk()\\nroot.withdraw()\\n\\nnumber = tkSimpleDialog.askinteger(\\\"Integer\\\", \\\"Enter a Number\\\")\\nstring = tkSimpleDialog.askstring(\\\"String\\\", \\\"Enter a String\\\")\\n\",\n \"language\": \"Python\"\n },\n {\n \"code\": \"import tkinter\\nimport tkinter.simpledialog as tks\\n\\nroot = tkinter.Tk()\\nroot.withdraw()\\n\\nnumber = tks.askinteger(\\\"Integer\\\", \\\"Enter a Number\\\")\\nstring = tks.askstring(\\\"String\\\", \\\"Enter a String\\\")\\n\\ntkinter.messagebox.showinfo(\\\"Results\\\", f\\\"Your input:\\\\n {number} {string}\\\")\\n\",\n \"language\": \"Python\"\n },\n {\n \"code\": \"$ \\\\\\nimport tkinter\\nimport tkinter.simpledialog as tks\\n\\nroot = tkinter.Tk()\\nroot.withdraw()\\n\\nto_stack(tks.askinteger(\\\"Integer\\\", \\\"Enter a Number\\\"))\\nstring_to_stack(tks.askstring(\\\"String\\\", \\\"Enter a String\\\"))\\n\\n \\\\ python\\n\\nswap echo cr echo$\\n\",\n \"language\": \"Quackery\"\n },\n {\n \"code\": \"library(gWidgets)\\noptions(guiToolkit=\\\"RGtk2\\\") ## using gWidgtsRGtk2\\n\\nw <- gwindow(\\\"Enter a string and a number\\\")\\nlyt <- glayout(cont=w)\\nlyt[1,1] <- \\\"Enter a string\\\"\\nlyt[1,2] <- gedit(\\\"\\\", cont=lyt)\\nlyt[2,1] <- \\\"Enter 75000\\\"\\nlyt[2,2] <- gedit(\\\"\\\", cont=lyt)\\nlyt[3,2] <- gbutton(\\\"validate\\\", cont=lyt, handler=function(h,...) {\\n txt <- svalue(lyt[1,2])\\n x <- svalue(lyt[2,2])\\n x <- gsub(\\\",\\\", \\\"\\\", x)\\n x <- as.integer(x)\\n\\n if(nchar(txt) > 0 && x == 75000)\\n gmessage(\\\"Congratulations, you followed directions\\\", parent=w)\\n else\\n gmessage(\\\"You failed this simple task\\\", parent=w)\\n})\\n\",\n \"language\": \"R\"\n },\n {\n \"code\": \"#lang racket\\n(require racket/gui)\\n\\n(define str (get-text-from-user \\\"Hi\\\" \\\"Enter a string\\\"))\\n(message-box \\\"Hi\\\" (format \\\"You entered: ~a\\\" str))\\n\\n(define n (get-text-from-user \\\"Hi\\\" \\\"Enter a number\\\"))\\n(message-box \\\"Hi\\\" (format \\\"You entered: ~a\\\"\\n (or (string->number n) \\\"bogus text\\\")))\\n\",\n \"language\": \"Racket\"\n },\n {\n \"code\": \"use GTK::Simple;\\nuse GTK::Simple::App;\\n\\nmy GTK::Simple::App $app .= new( title => 'User Interaction' );\\n\\n$app.border-width = 20;\\n\\n$app.set-content(\\n GTK::Simple::VBox.new(\\n my $ = GTK::Simple::Label.new( text => 'Enter a string.' ),\\n my $str = GTK::Simple::Entry.new,\\n my $string = GTK::Simple::Label.new,\\n my $ = GTK::Simple::Label.new( text => 'Enter the number 75000' ),\\n my $val = GTK::Simple::Entry.new,\\n my $correct = GTK::Simple::Label.new,\\n )\\n);\\n\\n$str.changed.tap: {\\n $string.text = \\\"You entered: { $str.text }\\\"\\n}\\n\\n$val.changed.tap: {\\n $correct.text = \\\"That's { 'not' unless $val.text ~~ / ^^ <ws> 75000 <ws> $$ / } 75000!\\\"\\n}\\n\\n$app.run;\\n\",\n \"language\": \"Raku\"\n },\n {\n \"code\": \"import vis::Render;\\nimport vis::Figure;\\n\\npublic void UserInput2(){\\n\\tinteger = \\\"\\\";\\n\\tstring = \\\"\\\";\\n\\trow1 = [text(\\\"Enter a string \\\"),\\n\\t\\t\\ttextfield(\\\"\\\",void(str s){string = s;}),\\n\\t\\t\\ttext(str(){return \\\" This input box will give a string by definition.\\\\n You entered <string>\\\";})];\\n\\trow2 = [text(\\\"Enter 75000\\\"),\\n\\t\\t\\ttextfield(\\\"\\\",void(str v){integer = v;}),\\n\\t\\t\\ttext(str(){return \\\" <integer == \\\"75000\\\" ? \\\"Correct\\\" : \\\"Wrong\\\">\\\";})];\\n\\trender(grid([row1, row2]));\\n}\\n\",\n \"language\": \"Rascal\"\n },\n {\n \"code\": \"REBOL [\\n\\tTitle: \\\"Graphical User Input\\\"\\n\\tURL: http://rosettacode.org/wiki/User_Input_-_graphical\\n]\\n\\n; Simple GUI's can be defined with 'layout', a special purpose dialect\\n; for specifying interfaces. In this case, I describe a gradient\\n; background with an instruction label, followed by the input fields\\n; and a validation button. It's possible to check dynamically as the\\n; user types but I wanted to keep this example as clear as possible.\\n\\nview layout [\\n\\n; You can define new widget styles. Here I create a padded label style\\n; (so that everything will line up) and a simple indicator light to\\n; show if there's a problem with an input field.\\n\\n\\tstyle label vtext 60 \\\"unlabeled\\\"\\n\\tstyle indicator box maroon 24x24\\n\\n\\tbackdrop effect [gradient 0x1 black coal]\\n\\n\\tvtext \\\"Please enter a string, and the number 75000:\\\"\\n\\n; By default, GUI widgets are arranged top down. The 'across' word\\n; starts stacking widgets from left to right. 'return' starts a new\\n; line -- just like on a typewriter!\\n\\n\\tacross\\n\\n; Notice I'm using my new label and indicator styles here. Widgets\\n; that I need to access later (the input field and the indicator) are\\n; assigned to variables.\\n\\n\\tlabel \\\"string:\\\" s: field 240 si: indicator return\\n\\n\\tlabel \\\"number:\\\" n: field 50 ni: indicator return\\n\\n\\tpad 66\\n\\tbutton \\\"validate\\\" [\\n\\n; The user may have entered bogus values, so I reset the indicators:\\n\\n\\t\\tsi/color: ni/color: maroon\\n\\n; Now I check to see if the values are correct. For the string, I just\\n; care that there is one. For the integer, I make sure that it\\n; evaluates to an integer and that it's value is 75000. Because I've\\n; already set the indicator colour, I don't care the integer\\n; conversion raises an error or not, so I ignore it if anything goes\\n; wrong.\\n\\n\\t\\tif 0 < length? get-face s [si/color: green]\\n\\t\\terror? try [if 75000 = to-integer get-face n [ni/color: green]]\\n\\n\\t\\tshow [si ni] ; Repainting multiple objects at once.\\n\\t]\\n]\\n\",\n \"language\": \"REBOL\"\n },\n {\n \"code\": \"/*REXX pgm prompts (using the OS GUI) for a string & then prompts for a specific number.*/\\n#= 75000 /*the number that must be entered. */\\nx=\\nN=\\n do while x=' '; say /*string can't be blanks or null string*/\\n say 'Please enter a string: '\\n parse pull x\\n if x='' then say '***error*** No string entered.'\\n end /*while x···*/\\n\\n do while N\\\\=#; say /*the number (below) may be ill formed.*/\\n say 'Please enter the number:' #\\n parse pull N\\n if datatype(N, 'N') then N= N / 1 /*normalize the number: 007 4.0 +2 */\\n if N\\\\=# then say '***error*** The number is not correct: ' N.\\n end /*while N···*/\\nsay\\nsay 'The string entered is:' x /*echo the values (string and number. */\\nsay 'The number entered is:' N /*stick a fork in it, we're all done. */\\n\",\n \"language\": \"REXX\"\n },\n {\n \"code\": \"Load \\\"guilib.ring\\\"\\n\\nMyApp = New qApp {\\n num = 0\\n win1 = new qWidget() {\\n setwindowtitle(\\\"Hello World\\\")\\n setGeometry(100,100,370,250)\\n\\n btn1 = new qpushbutton(win1) {\\n setGeometry(130,200,100,30)\\n settext(\\\"Validate\\\")\\n setclickevent(\\\"Validate()\\\")}\\n\\n lineedit1 = new qlineedit(win1) {\\n setGeometry(10,100,250,30)\\n settext(\\\"\\\")}\\n\\n lineedit2 = new qlineedit(win1) {\\n setGeometry(10,150,50,30)\\n settext(\\\"0\\\")}\\n\\n label1 = new qLabel(win1) {\\n setGeometry(270,100,50,30)\\n\\t\\t setText(\\\"\\\")}\\n\\n label2 = new qLabel(win1) {\\n setGeometry(70,150,50,30)\\n\\t\\t setText(\\\"\\\")}\\n\\t\\n label3 = new qLabel(win1) {\\n setGeometry(10,50,250,30)\\n\\t\\t setText(\\\"Please enter a string, and the number 75000 :\\\")}\\n show()}\\n exec()}\\n\\nfunc Validate\\n lineedit1{temp1 = text()}\\n num1 = isdigit(temp1)\\n if num1 = 0 label1{settext(\\\"OK\\\")} else label1{settext(\\\"NOT OK\\\")} ok\\n\\n lineedit2{temp2 = text()}\\n num2 = number(temp2)\\n if num2 = 75000 label2{settext(\\\"OK\\\")} else label2{settext(\\\"NOT OK\\\")} ok\\n\",\n \"language\": \"Ring\"\n },\n {\n \"code\": \"require 'tk'\\n\\ndef main\\n root = TkRoot.new\\n l1 = TkLabel.new(root, \\\"text\\\" => \\\"input a string\\\")\\n e1 = TkEntry.new(root)\\n l2 = TkLabel.new(root, \\\"text\\\" => \\\"input the number 75000\\\")\\n e2 = TkEntry.new(root) do\\n validate \\\"focusout\\\"\\n validatecommand lambda {e2.value.to_i == 75_000}\\n invalidcommand lambda {focus_number_entry(e2)}\\n end\\n ok = TkButton.new(root) do\\n text \\\"OK\\\"\\n command lambda {validate_input(e1, e2)}\\n end\\n Tk.grid(l1, e1)\\n Tk.grid(l2, e2)\\n Tk.grid(\\\"x\\\",ok, \\\"sticky\\\" => \\\"w\\\")\\n Tk.mainloop\\nend\\n\\ndef validate_input(text_entry, number_entry)\\n if number_entry.value.to_i != 75_000\\n focus_number_entry(number_entry)\\n else\\n puts %Q{You entered: \\\"#{text_entry.value}\\\" and \\\"#{number_entry.value}\\\"}\\n root.destroy\\n end\\nend\\n\\ndef focus_number_entry(widget)\\n widget \\\\\\n .configure(\\\"background\\\" => \\\"red\\\", \\\"foreground\\\" => \\\"white\\\") \\\\\\n .selection_range(0, \\\"end\\\") \\\\\\n .focus\\nend\\n\\nmain\\n\",\n \"language\": \"Ruby\"\n },\n {\n \"code\": \"Shoes.app do\\n string = ask('Enter a string:')\\n begin\\n number = ask('Enter the number 75000:')\\n end while number.to_i != 75000\\n para %Q{you entered the string \\\"#{string}\\\" and the number #{number}}\\nend\\n\",\n \"language\": \"Ruby\"\n },\n {\n \"code\": \"html \\\"<TABLE BORDER=1 BGCOLOR=silver>\\n<TR><TD colspan=2>Please input a string and a number</TD></TR>\\n\\n<TR><TD align=right>String</TD><TD><input type=text name=str size=18></TD></TR>\\n<TR><TD align=right>Number</TD><TD><input type=number name=num size=18 value=75000></TD></TR>\\n\\n<TR><TD colspan=2 align=center>\\\"\\n\\nbutton #go, \\\"Accept\\\", [go]\\nbutton #ex, \\\"Exit\\\", [ex]\\n\\nhtml \\\"</TD></TR></TABLE>\\\"\\nWait\\n\\n[go]\\nprint #request get$(\\\"str\\\")\\nprint val(#request get$(\\\"num\\\"))\\nwait\\n\\n[ex]\\nend\\n\",\n \"language\": \"Run-BASIC\"\n },\n {\n \"code\": \"import swing.Dialog.{Message, showInput}\\nimport scala.swing.Swing\\n\\nobject UserInput extends App {\\n def responce = showInput(null,\\n \\\"Complete the sentence:\\\\n\\\\\\\"Green eggs and...\\\\\\\"\\\",\\n \\\"Customized Dialog\\\",\\n Message.Plain,\\n Swing.EmptyIcon,\\n Nil, \\\"ham\\\")\\n println(responce)\\n}\\n\",\n \"language\": \"Scala\"\n },\n {\n \"code\": \"var gtk2 = require('Gtk2') -> init;\\n\\nvar gui = %s'Gtk2::Builder'.new;\\ngui.add_from_string(DATA.slurp);\\n\\nfunc clicked_ok(*_) {\\n var entry = gui.get_object('entry1');\\n var text = entry.get_text;\\n\\n var spinner = gui.get_object('spinbutton1');\\n var number = spinner.get_text;\\n\\n say \\\"string: #{text}\\\";\\n say \\\"number: #{number}\\\";\\n\\n number == 75000 ? gtk2.main_quit : warn \\\"Invalid number!\\\";\\n}\\n\\nfunc clicked_cancel(*_) {\\n gtk2.main_quit;\\n}\\n\\ngui.get_object('button1').signal_connect('clicked', clicked_ok);\\ngui.get_object('button2').signal_connect('clicked', clicked_cancel);\\n\\ngtk2.main;\\n\\n__DATA__\\n<?xml version=\\\"1.0\\\" encoding=\\\"UTF-8\\\"?>\\n<interface>\\n <requires lib=\\\"gtk+\\\" version=\\\"2.24\\\"/>\\n <!-- interface-naming-policy project-wide -->\\n <object class=\\\"GtkAdjustment\\\" id=\\\"adjustment1\\\">\\n <property name=\\\"upper\\\">100000</property>\\n <property name=\\\"value\\\">75000</property>\\n <property name=\\\"step_increment\\\">1</property>\\n <property name=\\\"page_increment\\\">10</property>\\n </object>\\n <object class=\\\"GtkWindow\\\" id=\\\"window1\\\">\\n <property name=\\\"visible\\\">True</property>\\n <property name=\\\"can_focus\\\">False</property>\\n <child>\\n <object class=\\\"GtkVBox\\\" id=\\\"vbox1\\\">\\n <property name=\\\"visible\\\">True</property>\\n <property name=\\\"can_focus\\\">False</property>\\n <child>\\n <object class=\\\"GtkLabel\\\" id=\\\"label1\\\">\\n <property name=\\\"visible\\\">True</property>\\n <property name=\\\"can_focus\\\">False</property>\\n <property name=\\\"label\\\" translatable=\\\"yes\\\">Please insert a string and a number:</property>\\n </object>\\n <packing>\\n <property name=\\\"expand\\\">True</property>\\n <property name=\\\"fill\\\">True</property>\\n <property name=\\\"position\\\">0</property>\\n </packing>\\n </child>\\n <child>\\n <object class=\\\"GtkHBox\\\" id=\\\"hbox1\\\">\\n <property name=\\\"visible\\\">True</property>\\n <property name=\\\"can_focus\\\">False</property>\\n <child>\\n <object class=\\\"GtkLabel\\\" id=\\\"label2\\\">\\n <property name=\\\"visible\\\">True</property>\\n <property name=\\\"can_focus\\\">False</property>\\n <property name=\\\"label\\\" translatable=\\\"yes\\\">string:</property>\\n </object>\\n <packing>\\n <property name=\\\"expand\\\">True</property>\\n <property name=\\\"fill\\\">True</property>\\n <property name=\\\"padding\\\">55</property>\\n <property name=\\\"position\\\">0</property>\\n </packing>\\n </child>\\n <child>\\n <object class=\\\"GtkEntry\\\" id=\\\"entry1\\\">\\n <property name=\\\"visible\\\">True</property>\\n <property name=\\\"can_focus\\\">True</property>\\n <property name=\\\"invisible_char\\\">•</property>\\n <property name=\\\"primary_icon_activatable\\\">False</property>\\n <property name=\\\"secondary_icon_activatable\\\">False</property>\\n <property name=\\\"primary_icon_sensitive\\\">True</property>\\n <property name=\\\"secondary_icon_sensitive\\\">True</property>\\n </object>\\n <packing>\\n <property name=\\\"expand\\\">True</property>\\n <property name=\\\"fill\\\">True</property>\\n <property name=\\\"position\\\">1</property>\\n </packing>\\n </child>\\n </object>\\n <packing>\\n <property name=\\\"expand\\\">True</property>\\n <property name=\\\"fill\\\">True</property>\\n <property name=\\\"position\\\">1</property>\\n </packing>\\n </child>\\n <child>\\n <object class=\\\"GtkHBox\\\" id=\\\"hbox2\\\">\\n <property name=\\\"visible\\\">True</property>\\n <property name=\\\"can_focus\\\">False</property>\\n <child>\\n <object class=\\\"GtkLabel\\\" id=\\\"label3\\\">\\n <property name=\\\"visible\\\">True</property>\\n <property name=\\\"can_focus\\\">False</property>\\n <property name=\\\"label\\\" translatable=\\\"yes\\\">number:</property>\\n </object>\\n <packing>\\n <property name=\\\"expand\\\">True</property>\\n <property name=\\\"fill\\\">True</property>\\n <property name=\\\"position\\\">0</property>\\n </packing>\\n </child>\\n <child>\\n <object class=\\\"GtkSpinButton\\\" id=\\\"spinbutton1\\\">\\n <property name=\\\"visible\\\">True</property>\\n <property name=\\\"can_focus\\\">True</property>\\n <property name=\\\"invisible_char\\\">•</property>\\n <property name=\\\"primary_icon_activatable\\\">False</property>\\n <property name=\\\"secondary_icon_activatable\\\">False</property>\\n <property name=\\\"primary_icon_sensitive\\\">True</property>\\n <property name=\\\"secondary_icon_sensitive\\\">True</property>\\n <property name=\\\"adjustment\\\">adjustment1</property>\\n <property name=\\\"numeric\\\">True</property>\\n </object>\\n <packing>\\n <property name=\\\"expand\\\">True</property>\\n <property name=\\\"fill\\\">True</property>\\n <property name=\\\"position\\\">1</property>\\n </packing>\\n </child>\\n </object>\\n <packing>\\n <property name=\\\"expand\\\">True</property>\\n <property name=\\\"fill\\\">True</property>\\n <property name=\\\"position\\\">2</property>\\n </packing>\\n </child>\\n <child>\\n <object class=\\\"GtkHButtonBox\\\" id=\\\"hbuttonbox1\\\">\\n <property name=\\\"visible\\\">True</property>\\n <property name=\\\"can_focus\\\">False</property>\\n <property name=\\\"layout_style\\\">spread</property>\\n <child>\\n <object class=\\\"GtkButton\\\" id=\\\"button1\\\">\\n <property name=\\\"label\\\">gtk-ok</property>\\n <property name=\\\"visible\\\">True</property>\\n <property name=\\\"can_focus\\\">True</property>\\n <property name=\\\"receives_default\\\">True</property>\\n <property name=\\\"use_stock\\\">True</property>\\n </object>\\n <packing>\\n <property name=\\\"expand\\\">False</property>\\n <property name=\\\"fill\\\">False</property>\\n <property name=\\\"position\\\">0</property>\\n </packing>\\n </child>\\n <child>\\n <object class=\\\"GtkButton\\\" id=\\\"button2\\\">\\n <property name=\\\"label\\\">gtk-cancel</property>\\n <property name=\\\"visible\\\">True</property>\\n <property name=\\\"can_focus\\\">True</property>\\n <property name=\\\"receives_default\\\">True</property>\\n <property name=\\\"use_stock\\\">True</property>\\n </object>\\n <packing>\\n <property name=\\\"expand\\\">False</property>\\n <property name=\\\"fill\\\">False</property>\\n <property name=\\\"position\\\">1</property>\\n </packing>\\n </child>\\n </object>\\n <packing>\\n <property name=\\\"expand\\\">True</property>\\n <property name=\\\"fill\\\">True</property>\\n <property name=\\\"position\\\">3</property>\\n </packing>\\n </child>\\n </object>\\n </child>\\n </object>\\n</interface>\\n\",\n \"language\": \"Sidef\"\n },\n {\n \"code\": \"open XWindows ;\\nopen Motif ;\\n\\nval store : string list ref = ref [] ;\\n\\nval inputWindow = fn () =>\\nlet\\n val shell = XtAppInitialise \\\"\\\" \\\"demo\\\" \\\"top\\\" [] [ XmNwidth 320, XmNheight 100 ] ;\\n val main = XmCreateMainWindow shell \\\"main\\\" [ XmNmappedWhenManaged true ] ;\\n val enter = XmCreateText main \\\"inputarea\\\" [ XmNeditMode XmSINGLE_LINE_EDIT,\\n XmNscrollHorizontal false ] ;\\n val getinp = fn (w,s,t) => ( store := XmTextGetString enter :: !store ; t )\\nin\\n\\n (\\n XtSetCallbacks enter [ (XmNactivateCallback , getinp) ] XmNarmCallback ;\\n XtManageChild enter ;\\n XtManageChild main ;\\n XtRealizeWidget shell\\n )\\n\\nend ;\\n\\ninputWindow () ;\\n\",\n \"language\": \"Standard-ML\"\n },\n {\n \"code\": \"# create entry widget:\\npack [entry .e1]\\n\\n# read its content:\\nset input [.e get]\\n\",\n \"language\": \"Tcl\"\n },\n {\n \"code\": \"pack [entry .e1 -textvar input]\\n\\n# show the content at any time by\\nputs $input\\n\",\n \"language\": \"Tcl\"\n },\n {\n \"code\": \"Prgm\\n Dialog\\n Title \\\"Rosetta Code\\\"\\n Request \\\"A string\\\", s\\n DropDown \\\"An integer\\\", {\\\"75000\\\"}, n\\n EndDlog\\n 74999 + n → n\\nEndPrgm\\n\",\n \"language\": \"TI-89-BASIC\"\n },\n {\n \"code\": \"strUserIn = InputBox(\\\"Enter Data\\\")\\nWscript.Echo strUserIn\\n\",\n \"language\": \"VBScript\"\n },\n {\n \"code\": \"Dialog_Input_1(1, \\\"`User Input example`,\\n `??Enter a string `,\\n `??Enter a number `\\\")\\n\",\n \"language\": \"Vedit-macro-language\"\n },\n {\n \"code\": \"import \\\"graphics\\\" for Canvas, Color\\nimport \\\"input\\\" for Keyboard, Clipboard\\nimport \\\"dome\\\" for Window, Process\\n\\nvar X = 10\\nvar Y = 28\\n\\nclass Main {\\n construct new() {}\\n\\n init() {\\n _text = \\\"\\\"\\n _enterNum = false\\n Keyboard.handleText = true\\n Keyboard.textRegion(X, Y, 8, 8)\\n }\\n\\n update() {\\n var change = false\\n if (Keyboard.text.count > 0) {\\n _text = _text + Keyboard.text\\n change = true\\n }\\n\\n // enable backspace key to delete last character entered\\n if (Keyboard[\\\"backspace\\\"].justPressed && _text.count > 0) {\\n var codePoints = _text.codePoints\\n codePoints = codePoints.take(codePoints.count - 1)\\n _text = \\\"\\\"\\n for (point in codePoints) {\\n _text = _text + String.fromCodePoint(point)\\n }\\n change = true\\n }\\n\\n // enable return key to terminate input\\n if (Keyboard[\\\"return\\\"].justPressed) {\\n System.print(\\\"'%(_text)' was entered.\\\")\\n if (!_enterNum) {\\n _text = \\\"\\\"\\n _enterNum = true\\n change = true\\n } else if (_text == \\\"75000\\\") {\\n Process.exit()\\n } else {\\n _text = \\\"\\\"\\n change = true\\n }\\n }\\n\\n if (change) {\\n Keyboard.textRegion(X.min(_text.count * 8), Y, 8, 8)\\n }\\n }\\n\\n draw(dt) {\\n Canvas.cls()\\n Canvas.rect(X, Y, 8, 8, Color.red)\\n if (!_enterNum) {\\n Canvas.print(\\\"Enter Text and press return:\\\", 10, 10, Color.white)\\n } else {\\n Canvas.print(\\\"Enter 75000 and press return:\\\", 10, 10, Color.white)\\n }\\n Canvas.print(_text, 10, 20, Color.white)\\n }\\n}\\n\\nvar Game = Main.new()\\n\",\n \"language\": \"Wren\"\n }\n]","isConversational":false},"task_name":{"kind":"string","value":"User-input-Graphical"}}},{"rowIdx":1792,"cells":{"solutions":{"kind":"list like","value":[{"code":"---\nfrom: http://rosettacode.org/wiki/User_input/Text\nnote: Text processing\n","language":"00-META"},{"code":"{{selection|Short Circuit|Console Program Basics}}\n[[Category:Basic language learning]]\n[[Category:Keyboard input]] \n[[Category:Simple]]\n\n;Task: \nInput a string and the integer '''75000''' from the text console.\n\nSee also: [[User input/Graphical]]\n<br><br>\n\n","language":"00-TASK"},{"code":"V string = input(‘Input a string: ’)\nV number = Float(input(‘Input a number: ’))\n","language":"11l"},{"code":"//Consts\n.equ BUFFERSIZE, 100\n.equ STDIN, 0 // linux input console\n.equ STDOUT, 1 // linux output console\n.equ READ, 63\n.equ WRITE, 64\n.equ EXIT, 93\n\n.data\nenterText:\t\t.asciz \"Enter text: \"\ncarriageReturn: \t.asciz \"\\n\"\n\n//Read Buffer\n.bss\nbuffer: .skip BUFFERSIZE\n\n.text\n.global _start\n\nquadEnterText: \t.quad enterText\nquadBuffer: \t.quad buffer\nquadCarriageReturn:\t.quad carriageReturn\n\nwriteMessage:\n mov x2,0 // reset size counter to 0\n\ncheckSize: // get size of input\n ldrb w1,[x0,x2] // load char with offset of x2\n add x2,x2,#1 // add 1 char read legnth\n cbz w1,output // if char found\n b checkSize // loop\n\noutput:\n mov x1,x0 // move string address into system call func parm\n mov x0,STDOUT\n mov x8,WRITE\n svc 0 // trigger system write\n ret\n\n\n_start:\n //Output enter text\n ldr x0,quadEnterText\t// load enter message\n bl writeMessage\t\t// output enter message\n\n //Read User Input\n mov x0,STDIN \t// linux input console\n ldr x1,quadBuffer \t// load buffer address\n mov x2,BUFFERSIZE \t// load buffer size\n mov x8,READ \t// request to read data\n svc 0 \t// trigger system read input\n\n //Output User Message\n mov x2, #0\t\t\t// prep end of string\n ldr x1,quadBuffer \t// load buffer address\n strb w2,[x1, x0] \t// store x2 0 byte at the end of input string, offset x0\n ldr x0,quadBuffer \t// load buffer address\n bl writeMessage\n\n //Output newline\n ldr x0,quadCarriageReturn\n bl writeMessage\n\n //End Program\n mov x0, #0 \t// return code\n mov x8, #EXIT \t// request to exit program\n svc 0 \t// trigger end of program\n","language":"AArch64-Assembly"},{"code":"INCLUDE \"H6:REALMATH.ACT\"\n\nPROC Main()\n CHAR ARRAY sUser(255)\n REAL r75000,rUser\n\n Put(125) PutE() ;clear the screen\n ValR(\"75000\",r75000)\n\n Print(\"Please enter a text: \")\n InputS(sUser)\n\n DO\n Print(\"Please enter number \")\n PrintR(r75000) Print(\": \")\n InputR(rUser)\n UNTIL RealEqual(rUser,r75000)\n OD\n\n PutE()\n Print(\"Text: \") PrintE(sUser)\n Print(\"Number: \") PrintRE(rUser)\nRETURN\n","language":"Action-"},{"code":"function Get_String return String is\n Line : String (1 .. 1_000);\n Last : Natural;\nbegin\n Get_Line (Line, Last);\n return Line (1 .. Last);\nend Get_String;\n\nfunction Get_Integer return Integer is\n S : constant String := Get_String;\nbegin\n return Integer'Value (S);\n -- may raise exception Constraint_Error if value entered is not a well-formed integer\nend Get_Integer;\n","language":"Ada"},{"code":"My_String : String := Get_String;\nMy_Integer : Integer := Get_Integer;\n","language":"Ada"},{"code":"with Ada.Text_IO, Ada.Integer_Text_IO;\n\nprocedure User_Input is\n I : Integer;\nbegin\n Ada.Text_IO.Put (\"Enter a string: \");\n declare\n S : String := Ada.Text_IO.Get_Line;\n begin\n Ada.Text_IO.Put_Line (S);\n end;\n Ada.Text_IO.Put (\"Enter an integer: \");\n Ada.Integer_Text_IO.Get(I);\n Ada.Text_IO.Put_Line (Integer'Image(I));\nend User_Input;\n","language":"Ada"},{"code":"with\n Ada.Text_IO,\n Ada.Integer_Text_IO,\n Ada.Strings.Unbounded,\n Ada.Text_IO.Unbounded_IO;\n\nprocedure User_Input2 is\n S : Ada.Strings.Unbounded.Unbounded_String;\n I : Integer;\nbegin\n Ada.Text_IO.Put(\"Enter a string: \");\n S := Ada.Strings.Unbounded.To_Unbounded_String(Ada.Text_IO.Get_Line);\n Ada.Text_IO.Put_Line(Ada.Strings.Unbounded.To_String(S));\n Ada.Text_IO.Unbounded_IO.Put_Line(S);\n Ada.Text_IO.Put(\"Enter an integer: \");\n Ada.Integer_Text_IO.Get(I);\n Ada.Text_IO.Put_Line(Integer'Image(I));\nend User_Input2;\n","language":"Ada"},{"code":"print(\"Enter a string: \");\nSTRING s := read string;\nprint(\"Enter a number: \");\nINT i := read int;\n~\n","language":"ALGOL-68"},{"code":"begin\n string(80) s;\n integer n;\n write( \"Enter a string > \" );\n read( s );\n write( \"Enter an integer> \" );\n read( n )\nend.\n","language":"ALGOL-W"},{"code":"#include <flow.h>\n\n#import lib/input.bas.lib\n#include include/flow-input.h\n\nDEF-MAIN(argv,argc)\n CLR-SCR\n MSET( número, cadena )\n LOCATE(2,2), PRNL( \"Input an string : \"), LOC-COL(20), LET( cadena := READ-STRING( cadena ) )\n LOCATE(3,2), PRNL( \"Input an integer: \"), LOC-COL(20), LET( número := INT( VAL(READ-NUMBER( número )) ) )\n LOCATE(5,2), PRNL( cadena, \"\\n \",número )\nEND\n","language":"Amazing-Hopper"},{"code":"str←⍞\nint←⎕\n","language":"APL"},{"code":"10 INPUT \"ENTER A STRING: \"; S$\n20 INPUT \"ENTER A NUMBER: \"; I : I = INT(I)\n","language":"Applesoft-BASIC"},{"code":"/* ARM assembly Raspberry PI */\n/* program inputText.s */\n\n/* Constantes */\n.equ BUFFERSIZE, 100\n.equ STDIN, 0 @ Linux input console\n.equ STDOUT, 1 @ Linux output console\n.equ EXIT, 1 @ Linux syscall\n.equ READ, 3 @ Linux syscall\n.equ WRITE, 4 @ Linux syscall\n/* Initialized data */\n.data\nszMessDeb: .asciz \"Enter text : \\n\"\nszMessNum: .asciz \"Enter number : \\n\"\nszCarriageReturn: .asciz \"\\n\"\n\n/* UnInitialized data */\n.bss\nsBuffer: .skip BUFFERSIZE\n\n/* code section */\n.text\n.global main\nmain: /* entry of program */\n push {fp,lr} /* saves 2 registers */\n ldr r0,iAdrszMessDeb\n bl affichageMess\n mov r0,#STDIN @ Linux input console\n ldr r1,iAdrsBuffer @ buffer address\n mov r2,#BUFFERSIZE @ buffer size\n mov r7, #READ @ request to read datas\n swi 0 @ call system\n ldr r1,iAdrsBuffer @ buffer address\n mov r2,#0 @ end of string\n strb r2,[r1,r0] @ store byte at the end of input string (r0 contains number of characters)\n\n ldr r0,iAdrsBuffer @ buffer address\n bl affichageMess\n ldr r0,iAdrszCarriageReturn\n bl affichageMess\n\n ldr r0,iAdrszMessNum\n bl affichageMess\n mov r0,#STDIN @ Linux input console\n ldr r1,iAdrsBuffer @ buffer address\n mov r2,#BUFFERSIZE @ buffer size\n mov r7, #READ @ request to read datas\n swi 0 @ call system\n ldr r1,iAdrsBuffer @ buffer address\n mov r2,#0 @ end of string\n strb r2,[r1,r0] @ store byte at the end of input string (r0\n @\n ldr r0,iAdrsBuffer @ buffer address\n bl conversionAtoD @ conversion string in number in r0\n\n100: /* standard end of the program */\n mov r0, #0 @ return code\n pop {fp,lr} @restaur 2 registers\n mov r7, #EXIT @ request to exit program\n swi 0 @ perform the system call\n\niAdrszMessDeb: .int szMessDeb\niAdrszMessNum: .int szMessNum\niAdrsBuffer: .int sBuffer\niAdrszCarriageReturn: .int szCarriageReturn\n/******************************************************************/\n/* display text with size calculation */\n/******************************************************************/\n/* r0 contains the address of the message */\naffichageMess:\n push {fp,lr} \t\t\t/* save registres */\n push {r0,r1,r2,r7} \t\t/* save others registers */\n mov r2,#0 \t\t\t\t/* counter length */\n1: \t/* loop length calculation */\n ldrb r1,[r0,r2] \t\t\t/* read octet start position + index */\n cmp r1,#0 \t\t\t/* if 0 its over */\n addne r2,r2,#1 \t\t\t/* else add 1 in the length */\n bne 1b \t\t\t/* and loop */\n /* so here r2 contains the length of the message */\n mov r1,r0 \t\t\t/* address message in r1 */\n mov r0,#STDOUT \t\t/* code to write to the standard output Linux */\n mov r7, #WRITE /* code call system \"write\" */\n swi #0 /* call systeme */\n pop {r0,r1,r2,r7} \t\t/* restaur others registers */\n pop {fp,lr} \t\t\t\t/* restaur des 2 registres */\n bx lr\t \t\t\t/* return */\n\n/******************************************************************/\n/* Convert a string to a number stored in a registry */\n/******************************************************************/\n/* r0 contains the address of the area terminated by 0 or 0A */\n/* r0 returns a number */\nconversionAtoD:\n push {fp,lr} @ save 2 registers\n push {r1-r7} @ save others registers\n mov r1,#0\n mov r2,#10 @ factor\n mov r3,#0 @ counter\n mov r4,r0 @ save address string -> r4\n mov r6,#0 @ positive sign by default\n mov r0,#0 @ initialization to 0\n1: /* early space elimination loop */\n ldrb r5,[r4,r3] @ loading in r5 of the byte located at the beginning + the position\n cmp r5,#0 @ end of string -> end routine\n beq 100f\n cmp r5,#0x0A @ end of string -> end routine\n beq 100f\n cmp r5,#' ' @ space ?\n addeq r3,r3,#1 @ yes we loop by moving one byte\n beq 1b\n cmp r5,#'-' @ first character is -\n moveq r6,#1 @ 1 -> r6\n beq 3f @ then move on to the next position\n2: /* beginning of digit processing loop */\n cmp r5,#'0' @ character is not a number\n blt 3f\n cmp r5,#'9' @ character is not a number\n bgt 3f\n /* character is a number */\n sub r5,#48\n ldr r1,iMaxi @ check the overflow of the register\n cmp r0,r1\n bgt 99f @ overflow error\n mul r0,r2,r0 @ multiply par factor 10\n add r0,r5 @ add to r0\n3:\n add r3,r3,#1 @ advance to the next position\n ldrb r5,[r4,r3] @ load byte\n cmp r5,#0 @ end of string -> end routine\n beq 4f\n cmp r5,#0x0A @ end of string -> end routine\n beq 4f\n b 2b @ loop\n4:\n cmp r6,#1 @ test r6 for sign\n moveq r1,#-1\n muleq r0,r1,r0 @ if negatif, multiply par -1\n b 100f\n99: /* overflow error */\n ldr r0,=szMessErrDep\n bl affichageMess\n mov r0,#0 @ return zero if error\n100:\n pop {r1-r7} @ restaur other registers\n pop {fp,lr} @ restaur 2 registers\n bx lr @return procedure\n/* constante program */\t\niMaxi: .int 1073741824\t\nszMessErrDep: .asciz \"Too large: overflow 32 bits.\\n\"\n","language":"ARM-Assembly"},{"code":"str: input \"Enter a string: \"\nnum: to :integer input \"Enter an integer: \"\n\nprint [\"Got:\" str \",\" num]\n","language":"Arturo"},{"code":"DllCall(\"AllocConsole\")\nFileAppend, please type something`n, CONOUT$\nFileReadLine, line, CONIN$, 1\nmsgbox % line\nFileAppend, please type '75000'`n, CONOUT$\nFileReadLine, line, CONIN$, 1\nmsgbox % line\n","language":"AutoHotkey"},{"code":"TrayTip, Input:, Type a string:\nInput(String)\nTrayTip, Input:, Type an int:\nInput(Int)\nTrayTip, Done!, Input was recieved.\nMsgbox, You entered \"%String%\" and \"%Int%\"\nExitApp\nReturn\n\nInput(ByRef Output)\n{\n Loop\n {\n Input, Char, L1, {Enter}{Space}\n If ErrorLevel contains Enter\n Break\n Else If ErrorLevel contains Space\n Output .= \" \"\n Else\n Output .= Char\n TrayTip, Input:, %Output%\n }\n}\n","language":"AutoHotkey"},{"code":"~/src/opt/run $ awk 'BEGIN{printf \"enter a string: \"}{s=$0;i=$0+0;print \"ok,\"s\"/\"i}'\nenter a string: hello world\nok,hello world/0\n75000\nok,75000/75000\n","language":"AWK"},{"code":"Disp \"String:\"\ninput→A\nlength(A)→L\n\n.Copy the string to a safe location\nCopy(A,L₁,L)\n\n.Display the string\nDisp \"You entered:\",i\nFor(I,0,L-1)\n Disp {L₁+I}►Char\nEnd\nDisp i\n\nDisp \"Integer:\",i\ninput→B\nlength(B)→L\n\n.Parse the string and convert to an integer\n0→C\nFor(I,0,L-1)\n {B+I}-'0'→N\n If N>10\n .Error checking\n Disp \"Not a number\",i\n Return\n End\n C*10+N→C\nEnd\n\n.Display and check the integer\nDisp \"You entered:\",i,C►Dec,i\nIf C≠7500\nDisp \"That isn't 7500\"\nEnd\n","language":"Axe"},{"code":" * NB: whitespace insignificance and case insensitivity\n * are used in the field name.\n IDENTIFICATION DIVISION.\n PROGRAM-ID. USER INPUT.\n DATA DIVISION.\n 01 HUNDRED CHAR STRING PICTURE IS X(100).\n 01 FIVE DIGIT NUMBER PICTURE IS 9(5).\n PROCEDURE DIVISION.\n DISPLAY \"Enter a string of appropriate length: \" WITH NO ADVANCING\n ACCEPT HundredChar String.\n DISPLAY \"Enter a number (preferably 75000): \" WITH NO ADVANCING\n ACCEPT FiveDigit Number.\n","language":"BabyCobol"},{"code":"INPUT \"Enter a string\"; s$\nINPUT \"Enter a number: \", i%\n","language":"BASIC"},{"code":"input string \"Please enter a string: \", s\ndo\n input \"Please enter 75000 : \", i\nuntil i = 75000\nprint\nprint s, i\n","language":"BASIC256"},{"code":"@echo off\nset /p var=\necho %var% 75000\n","language":"Batch-File"},{"code":" INPUT LINE \"Enter a string: \" string$\n INPUT \"Enter a number: \" number\n\n PRINT \"String = \"\"\" string$ \"\"\"\"\n PRINT \"Number = \" ; number\n","language":"BBC-BASIC"},{"code":"<>:v:\"Enter a string: \"\n ^,_ >~:1+v\n ^ _@\n","language":"Befunge"},{"code":"<>:v:\"Enter a number: \"\n ^,_ & @\n","language":"Befunge"},{"code":"( doit\n= out'\"Enter a string\"\n & get':?mystring\n & whl\n ' ( out'\"Enter a number\"\n & get':?mynumber\n & !mynumber:~#\n & out'\"I said:\\\"a number\\\"!\"\n )\n & out$(mystring is !mystring \\nmynumber is !mynumber \\n)\n);\n","language":"Bracmat"},{"code":"#include <stdio.h>\n#include <stdlib.h>\n\nint main(void)\n{\n // Get a string from stdin\n char str[BUFSIZ];\n puts(\"Enter a string: \");\n fgets(str, sizeof(str), stdin);\n\n // Get 75000 from stdin\n long num;\n char buf[BUFSIZ];\n do\n {\n puts(\"Enter 75000: \");\n fgets(buf, sizeof(buf), stdin);\n num = strtol(buf, NULL, 10);\n } while (num != 75000);\n\n return EXIT_SUCCESS;\n}\n","language":"C"},{"code":"#include <gadget/gadget.h>\n\nLIB_GADGET_START\n\nMain\n Cls;\n\n String text;\n int number=0;\n\n At 5,5; Print \"Enter text : \";\n Atrow 7; Print \"Enter ‘75000’: \";\n Atcol 20;\n\n Atrow 5; Fn_let(text, Input ( text, 30 ) );\n Free secure text;\n\n Atrow 7; Stack{\n while (number!=75000 )\n /*into stack, Input() not need var*/\n number = Str2int( Input ( NULL, 6 ) );\n }Stack_off;\n\n Prnl;\nEnd\n","language":"C"},{"code":"#include <iostream>\n#include <string>\nusing namespace std;\n\nint main()\n{\n // while probably all current implementations have int wide enough for 75000, the C++ standard\n // only guarantees this for long int.\n long int integer_input;\n string string_input;\n cout << \"Enter an integer: \";\n cin >> integer_input;\n cout << \"Enter a string: \";\n cin >> string_input;\n return 0;\n}\n","language":"C++"},{"code":" cin >> string_input;\n","language":"C++"},{"code":" getline(cin, string_input);\n","language":"C++"},{"code":"using System;\n\nnamespace C_Sharp_Console {\n\n class example {\n\n static void Main() {\n string word;\n int num;\n\n Console.Write(\"Enter an integer: \");\n num = Console.Read();\n Console.Write(\"Enter a String: \");\n word = Console.ReadLine();\n }\n }\n}\n","language":"C-sharp"},{"code":"shared void run() {\n\tprint(\"enter any text here\");\n\tvalue text = process.readLine();\n\tprint(text);\n\tprint(\"enter the number 75000 here\");\n\tif (is Integer number = Integer.parse(process.readLine() else \"\")) {\n\t\tprint(\"``number == 75k then number else \"close enough\"``\");\n\t}\n\telse {\n\t\tprint(\"That was not a number per se.\");\n\t}\n}\n","language":"Ceylon"},{"code":"(import '(java.util Scanner))\n(def scan (Scanner. *in*))\n(def s (.nextLine scan))\n(def n (.nextInt scan))\n","language":"Clojure"},{"code":" IDENTIFICATION DIVISION.\n PROGRAM-ID. Get-Input.\n\n DATA DIVISION.\n WORKING-STORAGE SECTION.\n 01 Input-String PIC X(30).\n 01 Input-Int PIC 9(5).\n\n PROCEDURE DIVISION.\n DISPLAY \"Enter a string:\"\n ACCEPT Input-String\n\n DISPLAY \"Enter a number:\"\n ACCEPT Input-Int\n\n GOBACK\n .\n","language":"COBOL"},{"code":"10 input \"what is a word i should remember\";a$\n20 print \"thank you.\"\n30 input \"will you please type the number 75000\";nn\n40 if nn<>75000 then print \"i'm sorry, that's not right.\":goto 30\n50 print \"thank you.\":print \"you provided the following values:\"\n60 print a$\n70 print nn\n80 end\n","language":"Commodore-BASIC"},{"code":"(format t \"Enter some text: \")\n(let ((s (read-line)))\n (format t \"You entered ~s~%\" s))\n\n(format t \"Enter a number: \")\n(let ((n (read)))\n (if (numberp n)\n (format t \"You entered ~d.~%\" n)\n (format t \"That was not a number.\")))\n","language":"Common-Lisp"},{"code":"puts \"You entered: #{gets}\"\n\nbegin\n puts \"You entered: #{gets.not_nil!.chomp.to_i}\"\nrescue ex\n puts ex\nend\n","language":"Crystal"},{"code":"import std.stdio;\n\nvoid main() {\n long number;\n write(\"Enter an integer: \");\n readf(\"%d\", &number);\n\n char[] str;\n write(\"Enter a string: \");\n readf(\" %s\\n\", &str);\n\n writeln(\"Read in '\", number, \"' and '\", str, \"'\");\n}\n","language":"D"},{"code":"import 'dart:io' show stdout, stdin;\n\nmain() {\n\tstdout.write('Enter a string: ');\n\tfinal string_input = stdin.readLineSync();\n\n\tint number_input;\t\n\n\tdo {\n\t\tstdout.write('Enter the number 75000: ');\n\t\tvar number_input_string = stdin.readLineSync();\n\n\t\ttry {\n\t\t\tnumber_input = int.parse(number_input_string);\n\t\t\tif (number_input != 75000)\n\t\t\t\tstdout.writeln('$number_input is not 75000!');\n\t\t} on FormatException {\n\t\t\tstdout.writeln('$number_input_string is not a valid number!');\n\t\t} catch ( e ) {\n\t\t\tstdout.writeln(e);\n\t\t}\n\n\t} while ( number_input != 75000 );\n\n\tstdout.writeln('input: $string_input\\nnumber: $number_input');\n}\n","language":"Dart"},{"code":"program UserInputText;\n\n{$APPTYPE CONSOLE}\n\nuses SysUtils;\n\nvar\n s: string;\n lStringValue: string;\n lIntegerValue: Integer;\nbegin\n WriteLn('Enter a string:');\n Readln(lStringValue);\n\n repeat\n WriteLn('Enter the number 75000');\n Readln(s);\n lIntegerValue := StrToIntDef(s, 0);\n if lIntegerValue <> 75000 then\n Writeln('Invalid entry: ' + s);\n until lIntegerValue = 75000;\nend.\n","language":"Delphi"},{"code":"write \"Enter a string: \"\na$ = input\nprint \"\"\nrepeat\n write \"Enter the number 75000: \"\n h = number input\n print \"\"\n until h = 75000\n.\nprint a$ & \" \" & h\n","language":"EasyLang"},{"code":"import extensions;\n\npublic program()\n{\n var num := new Integer();\n console.write(\"Enter an integer: \").loadLineTo(num);\n\n var word := console.write(\"Enter a String: \").readLine()\n}\n","language":"Elena"},{"code":"a = IO.gets(\"Enter a string: \") |> String.strip\nb = IO.gets(\"Enter an integer: \") |> String.strip |> String.to_integer\nf = IO.gets(\"Enter a real number: \") |> String.strip |> String.to_float\nIO.puts \"String = #{a}\"\nIO.puts \"Integer = #{b}\"\nIO.puts \"Float = #{f}\"\n","language":"Elixir"},{"code":"{ok, [String]} = io:fread(\"Enter a string: \",\"~s\").\n{ok, [Number]} = io:fread(\"Enter a number: \",\"~d\").\n","language":"Erlang"},{"code":" String = io:get_line(\"Enter a string: \").\n","language":"Erlang"},{"code":"include get.e\n\nsequence s\natom n\n\ns = prompt_string(\"Enter a string:\")\nputs(1, s & '\\n')\nn = prompt_number(\"Enter a number:\",{})\nprintf(1, \"%d\", n)\n","language":"Euphoria"},{"code":"open System\n\nlet ask_for_input s =\n printf \"%s (End with Return): \" s\n Console.ReadLine()\n\n[<EntryPoint>]\nlet main argv =\n ask_for_input \"Input a string\" |> ignore\n ask_for_input \"Enter the number 75000\" |> ignore\n 0\n","language":"F-Sharp"},{"code":"\"Enter a string: \" write\nreadln\n\"Enter a number: \" write\nreadln string>number\n","language":"Factor"},{"code":"printl(\"Enter a string:\")\nstr = input()\nprintl(\"Enter a number:\")\nn = int(input())\n","language":"Falcon"},{"code":"[[^$' =~][,]#,]w:\n[0[^'0-$$9>0@>|~][\\10*+]#%]d:\nw;! d;!.\n","language":"FALSE"},{"code":"class Main\n{\n public static Void main ()\n {\n Env.cur.out.print (\"Enter a string: \").flush\n str := Env.cur.in.readLine\n echo (\"Entered :$str:\")\n Env.cur.out.print (\"Enter 75000: \").flush\n Int n\n try n = Env.cur.in.readLine.toInt\n catch (Err e)\n {\n echo (\"You had to enter a number\")\n return\n }\n echo (\"Entered :$n: which is \" + ((n == 75000) ? \"correct\" : \"wrong\"))\n }\n}\n","language":"Fantom"},{"code":": INPUT$ ( n -- addr n )\n PAD SWAP ACCEPT\n PAD SWAP ;\n","language":"Forth"},{"code":": INPUT# ( -- u true | false )\n 0. 16 INPUT$ DUP >R\n >NUMBER NIP NIP\n R> <> DUP 0= IF NIP THEN ;\n","language":"Forth"},{"code":": INPUT# ( -- n true | d 1 | false )\n 16 INPUT$ SNUMBER? ;\n","language":"Forth"},{"code":": INPUT# ( -- n true | false )\n 16 INPUT$ NUMBER? NIP\n DUP 0= IF NIP THEN ;\n","language":"Forth"},{"code":": input#\n begin\n refill drop bl parse-word ( a n)\n number error? ( n f)\n while ( n)\n drop ( --)\n repeat ( n)\n;\n","language":"Forth"},{"code":": TEST\n .\" Enter your name: \" 80 INPUT$ CR\n .\" Hello there, \" TYPE CR\n .\" Enter a number: \" INPUT# CR\n IF .\" Your number is \" .\n ELSE .\" That's not a number!\" THEN CR ;\n","language":"Forth"},{"code":"character(20) :: s\ninteger :: i\n\nprint*, \"Enter a string (max 20 characters)\"\nread*, s\nprint*, \"Enter the integer 75000\"\nread*, i\n","language":"Fortran"},{"code":"' FB 1.05.0 Win64\n\nDim s As String\nDim i AS Integer\nInput \"Please enter a string : \"; s\nDo\n Input \"Please enter 75000 : \"; i\nLoop Until i = 75000\nPrint\nPrint s, i\nSleep\n","language":"FreeBASIC"},{"code":"s = input[\"Enter a string: \"]\ni = parseInt[input[\"Enter an integer: \"]]\n","language":"Frink"},{"code":"extends MainLoop\n\nfunc _process(_delta: float) -> bool:\n\tprintraw(\"Input a string: \")\n\tvar read_line := OS.read_string_from_stdin() # Mote that this retains the newline.\n\n\tprintraw(\"Input an integer: \")\n\tvar read_integer := int(OS.read_string_from_stdin())\n\n\tprint(\"read_line = %s\" % read_line.trim_suffix(\"\\n\"))\n\tprint(\"read_integer = %d\" % read_integer)\n\n\treturn true # Exit instead of looping\n","language":"GDScript"},{"code":"package main\n\nimport \"fmt\"\n\nfunc main() {\n var s string\n var i int\n if _, err := fmt.Scan(&s, &i); err == nil && i == 75000 {\n fmt.Println(\"good\")\n } else {\n fmt.Println(\"wrong\")\n }\n}\n","language":"Go"},{"code":"package main\n\nimport (\n \"bufio\"\n \"fmt\"\n \"os\"\n \"strconv\"\n \"strings\"\n)\n\nfunc main() {\n in := bufio.NewReader(os.Stdin)\n\n fmt.Print(\"Enter string: \")\n s, err := in.ReadString('\\n')\n if err != nil {\n fmt.Println(err)\n return\n }\n s = strings.TrimSpace(s)\n\n fmt.Print(\"Enter 75000: \")\n s, err = in.ReadString('\\n')\n if err != nil {\n fmt.Println(err)\n return\n }\n n, err := strconv.Atoi(strings.TrimSpace(s))\n if err != nil {\n fmt.Println(err)\n return\n }\n if n != 75000 {\n fmt.Println(\"fail: not 75000\")\n return\n }\n fmt.Println(\"Good\")\n}\n","language":"Go"},{"code":"word = System.in.readLine()\nnum = System.in.readLine().toInteger()\n","language":"Groovy"},{"code":"import System.IO (hFlush, stdout)\nmain = do\n putStr \"Enter a string: \"\n hFlush stdout\n str <- getLine\n putStr \"Enter an integer: \"\n hFlush stdout\n num <- readLn :: IO Int\n putStrLn $ str ++ (show num)\n","language":"Haskell"},{"code":"print \"Enter a string: \"\nlet s scan str\nprint \"Enter a number: \"\nlet n scan int\n","language":"Hexiscript"},{"code":"U8 *s;\ns = GetStr(\"Enter a string: \");\n\nU32 *n;\ndo {\n n = GetStr(\"Enter 75000: \");\n} while(Str2I64(n) != 75000);\n\nPrint(\"Your string: %s\\n\", s);\nPrint(\"75000: %d\\n\", Str2I64(n));\n","language":"HolyC"},{"code":"procedure main ()\n writes (\"Enter something: \")\n s := read ()\n write (\"You entered: \" || s)\n\n writes (\"Enter 75000: \")\n if (i := integer (read ())) then\n write (if (i = 75000) then \"correct\" else \"incorrect\")\n else write (\"you must enter a number\")\nend\n","language":"Icon"},{"code":"string := File clone standardInput readLine(\"Enter a string: \")\ninteger := File clone standardInput readLine(\"Enter 75000: \") asNumber\n","language":"Io"},{"code":"100 INPUT PROMPT \"Enter a number: \":NUM\n110 INPUT PROMPT \"Enter a string: \":ST$\n","language":"IS-BASIC"},{"code":" require 'misc' NB. load system script\n prompt 'Enter string: '\n 0\".prompt 'Enter an integer: '\n","language":"J"},{"code":" prompt 'Enter string: ' NB. output string to session\nEnter string: Hello World\nHello World\n 0\".prompt 'Enter an integer: ' NB. output integer to session\nEnter an integer: 75000\n75000\n mystring=: prompt 'Enter string: ' NB. store string as noun\nEnter string: Hello Rosetta Code\n myinteger=: 0\".prompt 'Enter an integer: ' NB. store integer as noun\nEnter an integer: 75000\n mystring;myinteger NB. show contents of nouns\n┌──────────────────┬─────┐\n│Hello Rosetta Code│75000│\n└──────────────────┴─────┘\n","language":"J"},{"code":"import java.util.Scanner;\n\npublic class GetInput {\n public static void main(String[] args) throws Exception {\n Scanner s = new Scanner(System.in);\n System.out.print(\"Enter a string: \");\n String str = s.nextLine();\n System.out.print(\"Enter an integer: \");\n int i = Integer.parseInt(s.next());\n }\n}\n","language":"Java"},{"code":"import java.util.Scanner;\n\npublic class GetInput {\n public static void main(String[] args) {\n Scanner stdin = new Scanner(System.in);\n String string = stdin.nextLine();\n int number = stdin.nextInt();\n }\n}\n","language":"Java"},{"code":"WScript.Echo(\"Enter a string\");\nvar str = WScript.StdIn.ReadLine();\n\nvar val = 0;\nwhile (val != 75000) {\n WScript.Echo(\"Enter the integer 75000\");\n val = parseInt( WScript.StdIn.ReadLine() );\n}\n","language":"JavaScript"},{"code":"print(\"Enter a string\");\nvar str = readline();\n\nvar val = 0;\nwhile (val != 75000) {\n print(\"Enter the integer 75000\");\n val = parseInt( readline() );\n}\n","language":"JavaScript"},{"code":"\"Enter a string: \" putchars\nstdin fgets\n\"Enter a number: \" putchars\nstdin fgets 10 strtol.\n","language":"Joy"},{"code":"def read(int):\n null | until( . == int; \"Expecting \\(int)\" | stderr | input);\n\ndef read_string:\n null | until( type == \"string\"; \"Please enter a string\" | stderr | input);\n\n(read_string | \"I see the string: \\(.)\"),\n(read(75000) | \"I see the expected integer: \\(.)\")\n","language":"Jq"},{"code":"$ jq -n -r -f User_input.jq\n\"Please enter a string\"\n1\n\"Please enter a string\"\n\"ok\"\nI see the string: ok\n\"Expecting 75000\"\n1\n\"Expecting 75000\"\n\"ok\"\n\"Expecting 75000\"\n75000\nI see the expected integer: 75000\n","language":"Jq"},{"code":"print(\"String? \")\ny = readline()\nprintln(\"Your input was \\\"\", y, \"\\\".\\n\")\nprint(\"Integer? \")\ny = readline()\ntry\n y = parse(Int, y)\n println(\"Your input was \\\"\", y, \"\\\".\\n\")\ncatch\n println(\"Sorry, but \\\"\", y, \"\\\" does not compute as an integer.\")\nend\n","language":"Julia"},{"code":"System.file.stdout|write(\"Enter a String \");\nstring = System.file.stdin|readline();\n","language":"Kite"},{"code":"// version 1.1\n\nfun main(args: Array<String>) {\n print(\"Enter a string : \")\n val s = readLine()!!\n println(s)\n do {\n print(\"Enter 75000 : \")\n val number = readLine()!!.toInt()\n } while (number != 75000)\n}\n","language":"Kotlin"},{"code":"{input\n {@ type=\"text\"\n placeholder=\"Please enter a string and dblclick\"\n ondblclick=\"alert( 'You wrote « ' +\n this.value +\n ' » and it is ' +\n ((isNaN(this.value)) ? 'not' : '') +\n ' a number.' )\"\n}}\n\nPlease enter a string and dblclick\n\nInput: Hello World\nOutput: You wrote « Hello World » and it is not a number.\n\nInput: 123\nOutput: You wrote « 123 » and it is a number.\n","language":"Lambdatalk"},{"code":"#!/usr/bin/lasso9\n\ndefine read_input(prompt::string) => {\n\n\tlocal(string)\n\n\t// display prompt\n\tstdout(#prompt)\n\t// the following bits wait until the terminal gives you back a line of input\n\twhile(not #string or #string -> size == 0) => {\n\t\t#string = file_stdin -> readsomebytes(1024, 1000)\n\t}\n\t#string -> replace(bytes('\\n'), bytes(''))\n\n\treturn #string -> asstring\n\n}\n\nlocal(\n\tstring,\n\tnumber\n)\n\n// get string\n#string = read_input('Enter the string: ')\n\n// get number\n#number = integer(read_input('Enter the number: '))\n\n// deliver the result\nstdoutnl(#string + ' (' + #string -> type + ') | ' + #number + ' (' + #number -> type + ')')\n","language":"Lasso"},{"code":"data:\nmyText is text\nmyNumber is number\n\nprocedure:\ndisplay \"Enter some text: \"\naccept myText\ndisplay \"Enter a number: \"\naccept myNumber\n","language":"LDPL"},{"code":"Input \"Enter a string. \";string$\nInput \"Enter the value 75000.\";num\n","language":"Liberty-BASIC"},{"code":"# User input/text, in LIL\nwrite \"Enter a string: \"\nset text [readline]\n\nset num 0\nwhile {[canread] && $num != 75000} {\n write \"Enter the number 75000: \"\n set num [readline]\n}\n\nprint $text\nprint $num\n","language":"LIL"},{"code":"make \"input readlist ; in: string 75000\nshow map \"number? :input ; [false true]\n\nmake \"input readword ; in: 75000\nshow :input + 123 ; 75123\nmake \"input readword ; in: string 75000\nshow :input ; string 75000\n","language":"Logo"},{"code":":- object(user_input).\n\n :- public(test/0).\n test :-\n repeat,\n write('Enter an integer: '),\n read(Integer),\n integer(Integer),\n !,\n repeat,\n write('Enter an atom: '),\n read(Atom),\n atom(Atom),\n !.\n\n:- end_object.\n","language":"Logtalk"},{"code":"| ?- user_input::test.\nEnter an integer: 75000.\nEnter an atom: 'Hello world!'.\nyes\n","language":"Logtalk"},{"code":"HAI 1.4\nI HAS A string\nGIMMEH string\nI HAS A number\nGIMMEH number\nBTW converts number input to an integer\nMAEK number A NUMBR\nKTHXBYE\n","language":"LOLCODE"},{"code":"print('Enter a string: ')\ns = io.stdin:read()\nprint('Enter a number: ')\ni = tonumber(io.stdin:read())\n","language":"Lua"},{"code":"Module CheckIt {\n Keyboard \"75000\"+chr$(13)\n Input \"Integer:\", A%\n \\\\ Input erase keyboard buffer, we can't place in first Keyboard keys for second input\n Keyboard \"Hello World\"+Chr$(13)\n Input \"String:\", A$\n Print A%, A$\n}\nCheckIt\n","language":"M2000-Interpreter"},{"code":"printf(\"String:\"); string_value := readline();\nprintf(\"Integer: \"); int_value := parse(readline());\n","language":"Maple"},{"code":"mystring = InputString[\"give me a string please\"];\nmyinteger = Input[\"give me an integer please\"];\n","language":"Mathematica"},{"code":">> input('Input string: ')\nInput string: 'Hello'\n\nans =\n\nHello\n\n>> input('Input number: ')\nInput number: 75000\n\nans =\n\n 75000\n\n>> input('Input number, the number will be stored as a string: ','s')\nInput number, the number will be stored as a string: 75000\n\nans =\n\n75000\n","language":"MATLAB"},{"code":"/* String routine */\nblock(\ns:read(\"enter a string\"),\nif stringp(s) then print(s,\"is an actual string\") else \"that is not a string\")$\n\n/* Number routine */\nblock(\nn:read(\"enter a number\"),\nif numberp(n) then print(n,\"is an actual number\") else \"that is not a number\")$\n","language":"Maxima"},{"code":"string s;\nmessage \"write a string: \";\ns := readstring;\nmessage s;\nmessage \"write a number now: \";\nb := scantokens readstring;\nif b = 750:\n message \"You've got it!\"\nelse:\n message \"Sorry...\"\nfi;\nend\n","language":"Metafont"},{"code":"\"Enter a string\" ask\n\"Enter an integer\" ask int\n","language":"Min"},{"code":"s = System.console.readLine()\n\nputs s\n","language":"Mirah"},{"code":"alias askmesomething {\n echo -a You answered: $input(What's your name?, e)\n}\n","language":"MIRC-Scripting-Language"},{"code":"MODULE Input EXPORTS Main;\n\nIMPORT IO, Fmt;\n\nVAR string: TEXT;\n number: INTEGER;\n\nBEGIN\n IO.Put(\"Enter a string: \");\n string := IO.GetLine();\n IO.Put(\"Enter a number: \");\n number := IO.GetInt();\n IO.Put(\"You entered: \" & string & \" and \" & Fmt.Int(number) & \"\\n\");\nEND Input.\n","language":"Modula-3"},{"code":"TXTINP\n NEW S,N\n WRITE \"Enter a string: \"\n READ S,!\n WRITE \"Enter the number 75000: \"\n READ N,!\n KILL S,N\n QUIT\n","language":"MUMPS"},{"code":"string = str(input(\"Enter a string: \"))\ninteger = int(input(\"Enter an integer: \"))\n","language":"Nanoquery"},{"code":"/**\n User input/Text, in Neko\n Tectonics:\n nekoc userinput.neko\n neko userinput\n*/\n\nvar stdin = $loader.loadprim(\"std@file_stdin\", 0)()\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 NEWLINE = 10\nvar readline = function(f, s) {\n var len = 0\n var ch\n while true {\n try ch = file_read_char(f) catch a break;\n if ch == NEWLINE break;\n if $sset(s, len, ch) == null break; else len += 1\n }\n return $ssub(s, 0, len)\n}\n\n$print(\"Enter a line of text, then the number 75000\\n\")\n\ntry {\n var RECL = 132\n var str = $smake(RECL)\n var userstring = readline(stdin, str)\n $print(\":\", userstring, \":\\n\")\n\n var num = $int(readline(stdin, str))\n if num == 75000 $print(\"Rosetta Code 75000, for the win!\\n\")\n else $print(\"Sorry, need 75000\\n\")\n} catch problem $print(\"Exception: \", problem, \"\\n\")\n","language":"Neko"},{"code":"using System;\nusing System.Console;\n\nmodule Input\n{\n Main() : void\n {\n Write(\"Enter a string:\");\n _ = ReadLine()\n\n mutable entry = 0;\n mutable numeric = false;\n\n do\n {\n Write(\"Enter 75000:\");\n numeric = int.TryParse(ReadLine(), out entry);\n } while ((!numeric) || (entry != 75000))\n }\n}\n","language":"Nemerle"},{"code":"/* NetRexx */\noptions replace format comments java crossref symbols nobinary\n\ncheckVal = 75000\nsay 'Input a string then the number' checkVal\nparse ask inString\nparse ask inNumber .\n\nsay 'Input string:' inString\nsay 'Input number:' inNumber\nif inNumber == checkVal then do\n say 'Success! Input number is as requested'\n end\nelse do\n say 'Failure! Number' inNumber 'is not' checkVal\n end\nreturn\n","language":"NetRexx"},{"code":"(print \"Enter an integer: \")\n(set 'x (read-line))\n(print \"Enter a string: \")\n(set 'y (read-line))\n","language":"NewLISP"},{"code":"import rdstdin, strutils\n\nlet str = readLineFromStdin \"Input a string: \"\nlet num = parseInt(readLineFromStdin \"Input an integer: \")\n","language":"Nim"},{"code":"10 INPUT \"ENTER A STRING: \",STRING$\n20 PRINT \"YOU ENTERED \";STRING$;\".\"\n30 INPUT \"ENTER AN INTEGER: \",INTEGER\n40 PRINT \"YOU ENTERED\";INTEGER;\".\"\n","language":"NS-HUBASIC"},{"code":"{\n\tString: (input \"Enter a string: \")\n\tNumber: (input \"Enter an integer: \")\n}\n","language":"Nu"},{"code":"MODULE InputText;\nIMPORT\n In,\n Out;\nVAR\n i: INTEGER;\n str: ARRAY 512 OF CHAR;\nBEGIN\n Out.String(\"Enter a integer: \");Out.Flush();In.Int(i);\n Out.String(\"Enter a string: \");Out.Flush();In.String(str);\nEND InputText.\n","language":"Oberon"},{"code":"use IO;\n\nbundle Default {\n class Hello {\n function : Main(args : String[]) ~ Nil {\n string := Console->GetInstance()->ReadString();\n string->PrintLine();\n\n number := Console->GetInstance()->ReadString()->ToInt();\n number->PrintLine();\n }\n }\n}\n","language":"Objeck"},{"code":"print_string \"Enter a string: \";\nlet str = read_line () in\n print_string \"Enter an integer: \";\n let num = read_int () in\n Printf.printf \"%s%d\\n\" str num\n","language":"OCaml"},{"code":"% read a string (\"s\")\ns = input(\"Enter a string: \", \"s\");\n\n% read a GNU Octave expression, which is evaluated; e.g.\n% 5/7 gives 0.71429\ni = input(\"Enter an expression: \");\n\n% parse the input for an integer\nprintf(\"Enter an integer: \");\nri = scanf(\"%d\");\n\n% show the values\ndisp(s);\ndisp(i);\ndisp(ri);\n","language":"Octave"},{"code":"import: console\n\n: testInput{\n| s n |\n System.Console askln ->s\n while (System.Console askln asInteger dup ->n isNull) [ \"Not an integer\" println ]\n\n System.Out \"Received : \" << s << \" and \" << n << cr ;\n","language":"Oforth"},{"code":"declare\n StdIn = {New class $ from Open.file Open.text end init(name:stdin)}\n StringInput\n Num = {NewCell 0}\nin\n {System.printInfo \"Enter a string: \"}\n StringInput = {StdIn getS($)}\n\n for until:@Num == 75000 do\n {System.printInfo \"Enter 75000: \"}\n Line = {StdIn getS($)}\n in\n Num := try {String.toInt Line} catch _ then 0 end\n end\n","language":"Oz"},{"code":"s=input();\nn=eval(input());\n","language":"PARI-GP"},{"code":"program UserInput(input, output);\nvar i : Integer;\n s : String;\nbegin\n write('Enter an integer: ');\n readln(i);\n write('Enter a string: ');\n readln(s)\nend.\n","language":"Pascal"},{"code":"print \"Enter a string: \";\nmy $string = <>;\nprint \"Enter an integer: \";\nmy $integer = <>;\n","language":"Perl"},{"code":"(notonline)-->\n <span style=\"color: #0000FF;\">?</span><span style=\"color: #7060A8;\">prompt_string</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #008000;\">\"Enter any string:\"</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #0000FF;\">?</span><span style=\"color: #7060A8;\">prompt_number</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #008000;\">\"Enter the number 75000:\"</span><span style=\"color: #0000FF;\">,{</span><span style=\"color: #000000;\">75000</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">75000</span><span style=\"color: #0000FF;\">})</span>\n<!--\n","language":"Phix"},{"code":"/# Rosetta Code problem: https://rosettacode.org/wiki/User_input/Text\nby Galileo, 10/2022 #/\n\n\"Enter any string: \" input nl\ntrue while\n 75000 \"Enter the number \" over tostr chain \": \" chain input\n nl tonum over == not\nendwhile\ndrop pstack\n","language":"Phixmonti"},{"code":"#!/usr/bin/php\n<?php\n$string = fgets(STDIN);\n$integer = (int) fgets(STDIN);\n","language":"PHP"},{"code":"main =>\n print(\"Enter a string: \"),\n String = read_line(),\n print(\"Enter a number: \"),\n Number = read_int(),\n println([string=String,number=Number]).\n","language":"Picat"},{"code":"(in NIL # Guarantee reading from standard input\n (let (Str (read) Num (read))\n (prinl \"The string is: \\\"\" Str \"\\\"\")\n (prinl \"The number is: \" Num) ) )\n","language":"PicoLisp"},{"code":"int main(){\n write(\"Enter a String: \");\n string str = Stdio.stdin->gets();\n write(\"Enter 75000: \");\n int num = Stdio.stdin->gets();\n}\n","language":"Pike"},{"code":"declare s character (100) varying;\ndeclare k fixed decimal (15);\n\nput ('please type a string:');\nget edit (s) (L);\nput skip list (s);\n\nput skip list ('please type the integer 75000');\nget list (k);\nput skip list (k);\nput skip list ('Thanks');\n","language":"PL-I"},{"code":"To run:\nStart up.\nDemonstrate input.\nWait for the escape key.\nShut down.\n\nTo demonstrate input:\nWrite \"Enter a string: \" to the console without advancing.\nRead a string from the console.\nWrite \"Enter a number: \" to the console without advancing.\nRead a number from the console.\n\\Now show the input values\nWrite \"The string: \" then the string to the console.\nWrite \"The number: \" then the number to the console.\n","language":"Plain-English"},{"code":";;; Setup item reader\nlvars itemrep = incharitem(charin);\nlvars s, c, j = 0;\n;;; read chars up to a newline and put them on the stack\nwhile (charin() ->> c) /= `\\n` do j + 1 -> j ; c endwhile;\n;;; build the string\nconsstring(j) -> s;\n;;; read the integer\nlvars i = itemrep();\n","language":"Pop11"},{"code":"%open stdin for reading (and name the channel \"kbd\"):\n/kbd (%stdin) (r) file def\n%make ten-char buffer to read string into:\n/buf (..........) def\n%read string into buffer:\nkbd buf readline\n","language":"PostScript"},{"code":"%if the read was successful, convert the string to integer:\n{cvi} if\n","language":"PostScript"},{"code":"$string = Read-Host \"Input a string\"\n[int]$number = Read-Host \"Input a number\"\n","language":"PowerShell"},{"code":"If OpenConsole()\n ; Declare a string and a integer to be used\n Define txt.s, num.i\n\n Print(\"Enter a string: \")\n txt=Input()\n\n Repeat\n Print(\"Enter the number 75000: \")\n num=Val(Input()) ; Converts the Input to a Value with Val()\n Until num=75000\n ; Check that the user really gives us 75000!\n\n Print(\"You made it!\")\n Delay(3000): CloseConsole()\nEndIf\n","language":"PureBasic"},{"code":" string = raw_input(\"Input a string: \")\n","language":"Python"},{"code":" string = input(\"Input a string: \")\n","language":"Python"},{"code":" number = input(\"Input a number: \") # Deprecated, please don't use.\n","language":"Python"},{"code":" number = eval(input(\"Input a number: \")) # Evil, please don't use.\n","language":"Python"},{"code":" number = float(raw_input(\"Input a number: \"))\n","language":"Python"},{"code":" number = float(input(\"Input a number: \"))\n","language":"Python"},{"code":"Input \"Enter text and a number\", s$, l&\nPrint s$\nPrint l&\n","language":"QB64"},{"code":"$ \"Please enter a string: \" input\nsay 'You entered: \"' echo$ say '\"' cr cr\n\n$ \"Please enter an integer: \" input\ntrim reverse trim reverse\n$->n iff\n [ say \"You entered: \" echo cr ]\nelse\n [ say \"That was not an integer.\" cr\n drop ]\n","language":"Quackery"},{"code":"stringval <- readline(\"String: \")\nintval <- as.integer(readline(\"Integer: \"))\n","language":"R"},{"code":"#lang racket\n(printf \"Input a string: \")\n(define s (read-line))\n(printf \"You entered: ~a\\n\" s)\n\n(printf \"Input a number: \")\n(define m (or (string->number (read-line))\n (error \"I said a number!\")))\n(printf \"You entered: ~a\\n\" m)\n\n;; alternatively, use the generic `read'\n(printf \"Input a number: \")\n(define n (read))\n(unless (number? n) (error \"I said a number!\"))\n(printf \"You entered: ~a\\n\" n)\n","language":"Racket"},{"code":"my $str = prompt(\"Enter a string: \");\nmy $int = prompt(\"Enter a integer: \");\n","language":"Raku"},{"code":"import util::IDE;\npublic void InputConsole(){\n x = \"\";\n createConsole(\"Input Console\",\n \"Welcome to the Input Console\\nInput\\> \",\n str (str inp) {x = \"<inp == \"75000\" ? \"You entered 75000\" : \"You entered a string\">\";\n \t\t return \"<x>\\n<inp>\\nInput\\>\";});\n}\n","language":"Rascal"},{"code":"'Input a string: ' print expect as str\n'Input an integer: ' print expect 0 prefer as num\n","language":"Raven"},{"code":"REBOL [\n\tTitle: \"Textual User Input\"\n\tURL: http://rosettacode.org/wiki/User_Input_-_text\n]\n\ns: n: \"\"\n\n; Because I have several things to check for, I've made a function to\n; handle it. Note the question mark in the function name, this convention\n; is often used in Forth to indicate test of some sort.\n\nvalid?: func [s n][\n\terror? try [n: to-integer n] ; Ignore error if conversion fails.\n\tall [0 < length? s 75000 = n]]\n\n; I don't want to give up until I've gotten something useful, so I\n; loop until the user enters valid data.\n\nwhile [not valid? s n][\n\tprint \"Please enter a string, and the number 75000:\"\n\ts: ask \"string: \"\n\tn: ask \"number: \"\n]\n\n; It always pays to be polite...\n\nprint rejoin [ \"Thank you. Your string was '\" s \"'.\"]\n","language":"REBOL"},{"code":"n: ask \"Please enter # 75000: \" str: ask \"Please enter any string: \"\n","language":"Red"},{"code":":example (\"-)\n 'Enter_a_string:_ s:put s:get s:keep\n [ 'Enter_75000:_ s:put s:get-word s:to-number nl #75000 eq? ] until\n 'Your_string_was:_'%s'\\n s:format s:put ;\n","language":"Retro"},{"code":"/*REXX program prompts & reads/obtains a string, and also the number 75000 from terminal*/\nsay 'Please enter a string:' /*issue a prompt message to the term. */\nparse pull userString /*the (char) string can be any length. */\n /* [↑] the string could be null/empty.*/\n do until userNumber=75000 /*repeat this loop until satisfied. */\n say /*display a blank line to the terminal.*/\n say 'Please enter the number 75000' /*display a nice prompt message to term*/\n parse pull userNumber /*obtain the user text from terminal. */\n end /*until*/ /*check if the response is legitimate. */\n /*stick a fork in it, we're all done. */\n","language":"REXX"},{"code":"see \"Enter a string : \" give s\nsee \"Enter an integer : \" give i\nsee \"String = \" + s + nl\nsee \"Integer = \" + i + nl\n","language":"Ring"},{"code":"input string \"Enter string:\"\nset \"$str\" to \"input\"\ninput string \"Enter number:\"\nset \"number\" to \"input\"\n[ \"You entered:\"\n[ \"&$str&\"\n[ \"&number&\"\nend\n","language":"Robotic"},{"code":"input string \"Enter string:\"\nset \"$str\" to \"input\"\n: \"incorrect\"\ninput string \"Enter number:\"\nset \"number\" to \"input\"\nif \"number\" != \"(75000)\" then \"incorrect\"\n[ \"You entered:\"\n[ \"&$str&\"\n[ \"&number&\"\nend\n","language":"Robotic"},{"code":"print \"Enter a string: \"\ns = gets\nprintf \"Enter an integer: \"\ni = gets.to_i # If string entered, will return zero\nprintf \"Enter a real number: \"\nf = Float(gets) rescue nil # converts a floating point number or returns nil\nputs \"String = #{s}\"\nputs \"Integer = #{i}\"\nputs \"Float = #{f}\"\n","language":"Ruby"},{"code":"input \"Please enter a string: \"; s$\nwhile i <> 75000\n input \"Please enter 75000 : \"; i\nwend\nprint\nprint s$; chr$(9); i\n","language":"Run-BASIC"},{"code":"use std::io::{self, Write};\nuse std::fmt::Display;\nuse std::process;\n\nfn main() {\n let s = grab_input(\"Give me a string\")\n .unwrap_or_else(|e| exit_err(&e, e.raw_os_error().unwrap_or(-1)));\n\n println!(\"You entered: {}\", s.trim());\n\n let n: i32 = grab_input(\"Give me an integer\")\n .unwrap_or_else(|e| exit_err(&e, e.raw_os_error().unwrap_or(-1)))\n .trim()\n .parse()\n .unwrap_or_else(|e| exit_err(&e, 2));\n\n println!(\"You entered: {}\", n);\n}\n\nfn grab_input(msg: &str) -> io::Result<String> {\n let mut buf = String::new();\n print!(\"{}: \", msg);\n try!(io::stdout().flush());\n\n try!(io::stdin().read_line(&mut buf));\n Ok(buf)\n}\n\nfn exit_err<T: Display>(msg: T, code: i32) -> ! {\n let _ = writeln!(&mut io::stderr(), \"Error: {}\", msg);\n process::exit(code)\n}\n","language":"Rust"},{"code":"print(\"Enter a number: \")\nval i=Console.readLong // Task says to enter 75000\nprint(\"Enter a string: \")\nval s=Console.readLine\n","language":"Scala"},{"code":"(define str (read))\n(define num (read))\n(display \"String = \") (display str)\n(display \"Integer = \") (display num)\n","language":"Scheme"},{"code":"$ include \"seed7_05.s7i\";\n\nconst proc: main is func\n local\n var integer: integer_input is 0;\n var string: string_input is \"\";\n begin\n write(\"Enter an integer: \");\n readln(integer_input);\n write(\"Enter a string: \");\n readln(string_input);\n end func;\n","language":"Seed7"},{"code":"var s = read(String);\nvar i = read(Number); # auto-conversion to a number\n","language":"Sidef"},{"code":"var s = Sys.readln(\"Enter a string: \");\nvar i = Sys.readln(\"Enter a number: \").to_i;\n","language":"Sidef"},{"code":"10 PRINT \"ENTER A STRING\"\n20 INPUT S$\n30 PRINT \"YOU ENTERED: \";S$\n40 PRINT \"NOW ENTER THE NUMBER 75000\"\n50 INPUT N\n60 IF N=75000 THEN STOP\n70 PRINT \"NO, \";\n80 GOTO 40\n","language":"Sinclair-ZX81-BASIC"},{"code":"print: (query: 'Enter a String: ').\n[| n |\n n: (Integer readFrom: (query: 'Enter an Integer: ')).\n (n is: Integer)\n ifTrue: [print: n]\n ifFalse: [inform: 'Not an integer: ' ; n printString]\n] do.\n","language":"Slate"},{"code":"'Enter a number: ' display.\na := stdin nextLine asInteger.\n\n'Enter a string: ' display.\nb := stdin nextLine.\n","language":"Smalltalk"},{"code":"INPUT \"Enter a string.\":a$\nINPUT \"Enter the value 75000.\":n\n","language":"Smart-BASIC"},{"code":" output = \"Enter a string:\"\n str = trim(input)\n output = \"Enter an integer:\"\n int = trim(input)\n output = \"String: \" str \" Integer: \" int\nend\n","language":"SNOBOL4"},{"code":"#!/usr/local/bin/spar\n\npragma annotate( summary, \"get_string\" )\n @( description, \"Input a string and the integer 75000 from the text console.\" )\n @( see_also, \"https://rosettacode.org/wiki/User_input/Text\" )\n @( author, \"Ken O. Burtch\" );\npragma license( unrestricted );\n\npragma restriction( no_external_commands );\n\nprocedure get_string is\n s : unbounded_string;\n i : integer;\nbegin\n s := get_line;\n i := integer( numerics.value( get_line ) );\n ? s @ i;\nexception when others =>\n put_line( standard_error, \"the value is not valid\" );\nend get_string;\n","language":"SparForte"},{"code":"s := get_line;\ni := numerics.value( get_line );\n? s @ i;\n","language":"SparForte"},{"code":"text = #.input(\"Input a string\")\nnumber = #.val(#.input(\"Input a number\"))\n","language":"SPL"},{"code":"print \"Enter a string: \";\nlet val str = valOf (TextIO.inputLine TextIO.stdIn) in (* note: this keeps the trailing newline *)\n print \"Enter an integer: \";\n let val num = valOf (TextIO.scanStream (Int.scan StringCvt.DEC) TextIO.stdIn) in\n print (str ^ Int.toString num ^ \"\\n\")\n end\nend\n","language":"Standard-ML"},{"code":"print(\"Enter a string: \", terminator: \"\")\nif let str = readLine() {\n print(str)\n}\n","language":"Swift"},{"code":"print(\"Enter a string: \", terminator: \"\")\nguard let str = readLine() else {\n fatalError(\"Nothing read!\")\n}\nprint(str)\nprint(\"Enter a number: \", terminator: \"\")\nguard let nstr = readLine(), let num = Int(nstr) else {\n fatalError(\"Not a number!\")\n}\nprint(num)\n","language":"Swift"},{"code":"set str [gets stdin]\nset num [gets stdin]\n","language":"Tcl"},{"code":"if {![string is integer -strict $num]} then { ...do something here...}\n","language":"Tcl"},{"code":"set input 0\nwhile {$input != 75000} {\n puts -nonewline \"enter the number '75000': \"\n flush stdout\n set input [gets stdin]\n}\n","language":"Tcl"},{"code":"proc question {var message} {\n upvar 1 $var v\n puts -nonewline \"$message: \"\n flush stdout\n gets stdin $v\n}\nquestion name \"What is your name\"\nquestion task \"What is your quest\"\nquestion doom \"What is the air-speed velocity of an unladen swallow\"\n","language":"Tcl"},{"code":" :Input \"Enter a string:\",Str1\n :Prompt i\n :If(i ≠ 75000): Then\n :Disp \"That isn't 75000\"\n :Else\n :Stop\n","language":"TI-83-BASIC"},{"code":"Prgm\n InputStr \"Enter a string\", s\n Loop\n Prompt integer\n If integer ≠ 75000 Then\n Disp \"That wasn't 75000.\"\n Else\n Exit\n EndIf\n EndLoop\nEndPrgm\n","language":"TI-89-BASIC"},{"code":"needs readline\n.\" Enter a string: \" readline is-data the-string\n.\" Enter a number: \" readline >number [ .\" Not a number!\" drop 0 ] ifFalse is-data the-number\n\nthe-string type cr\nthe-number . cr\n","language":"Toka"},{"code":"PRINT \"Please enter a string\";\nINPUT s$\nDO\n PRINT \"Please enter 75000 \";\n INPUT i\nLOOP Until i = 75000\nPRINT\nPRINT s$, i\nEND\n","language":"True-BASIC"},{"code":"$$ MODE TUSCRIPT\nLOOP\nASK \"Enter a string\": str=\"\"\nASK \"Enter an integer\": int=\"\"\nIF (int=='digits') THEN\nPRINT \"int=\",int,\" str=\",str\nEXIT\nELSE\nPRINT/ERROR int,\" is not an integer\"\nCYCLE\nENDIF\nENDLOOP\n","language":"TUSCRIPT"},{"code":"#!/bin/sh\n\nread string\nread integer\nread -p 'Enter a number: ' number\necho \"The number is $number\"\n","language":"UNIX-Shell"},{"code":"#\n# user input\n#\n\n# in ursa, the type of data expected must be specified\ndecl string str\ndecl int i\n\nout \"input a string: \" console\nset str (in string console)\nout \"input an int: \" console\nset i (in int console)\n\nout \"you entered \" str \" and \" i endl console\n","language":"Ursa"},{"code":"import os\n\nfn main() {\n s := os.input('Enter string').int()\n if s == 75000 {\n println('good')\n } else {\n println('bad')\n }\n}\n","language":"V-(Vlang)"},{"code":"import os\nimport strconv\n\nfn main() {\n s := strconv.atoi(os.input('Enter string')) ?\n if s == 75000 {\n println('good')\n } else {\n println('bad $s')\n }\n}\n","language":"V-(Vlang)"},{"code":"Public Sub text()\n Debug.Print InputBox(\"Input a string\")\n Debug.Print InputBox(\"Input the integer 75000\", \"Input an integer\", 75000, Context = \"Long\")\nEnd Sub\n","language":"VBA"},{"code":"Get_Input(1, \"Enter a string: \")\n#2 = Get_Num(\"Enter a number: \")\n","language":"Vedit-macro-language"},{"code":"Dim i As Integer\nConsole.WriteLine(\"Enter an Integer\")\ni = Console.ReadLine()\n","language":"Visual-Basic-.NET"},{"code":"Dim i As Integer\nDim iString As String\nConsole.WriteLine(\"Enter an Integer\")\niString = Console.ReadLine()\nTry\n i = Convert.ToInt32(iString)\nCatch ex As Exception\n Console.WriteLine(\"This is not an Integer\")\nEnd Try\n","language":"Visual-Basic-.NET"},{"code":"Dim i As String\nConsole.WriteLine(\"Enter a String\")\ni = Console.ReadLine()\n","language":"Visual-Basic-.NET"},{"code":"print 1 \"Enter a string.\"\ninput string$\nprint 1 \"Enter an integer.\"\ninput integer\n","language":"Wee-Basic"},{"code":"import \"io\" for Stdin, Stdout\n\nvar string\nwhile (true) {\n System.write(\"Enter a string : \")\n Stdout.flush()\n string = Stdin.readLine()\n if (string.count == 0) {\n System.print(\"String cannot be empty, try again.\")\n } else {\n break\n }\n}\n\nvar number\nwhile (true) {\n System.write(\"Enter a number : \")\n Stdout.flush()\n number = Num.fromString(Stdin.readLine())\n if (!number || !number.isInteger) {\n System.print(\"Please enter a vaid integer, try again.\")\n } else {\n break\n }\n}\n\nSystem.print(\"\\nYou entered:\")\nSystem.print(\" string: %(string)\")\nSystem.print(\" number: %(number)\")\n","language":"Wren"},{"code":"(display \"Enter a string: \")\n(define s (read-line))\n(display \"Yes, \")\n(write s)\n(display \" is a string.\") ;; no need to verify, because READ-LINE has to return a string\n(newline)\n(display \"Now enter the integer 75000: \")\n(define n (read))\n(display\n (cond\n ((not (integerp n))\n \"That's not even an integer.\" )\n ((/= n 75000)\n \"That is not the integer 75000.\" )\n (t\n \"Yes, that is the integer 75000.\" ) ) )\n","language":"XLISP"},{"code":"string 0; \\use zero-terminated strings, instead of MSb terminated\ninclude c:\\cxpl\\codes;\nint I;\nchar Name(128); \\the keyboard buffer limits input to 128 characters\n\n[Text(0, \"What's your name? \");\nI:= 0;\nloop [Name(I):= ChIn(0); \\buffered keyboard input\n if Name(I) = $0D\\CR\\ then quit; \\Carriage Return = Enter key\n I:= I+1;\n ];\nName(I):= 0; \\terminate string\nText(0, \"Howdy \"); Text(0, Name); Text(0, \"! Now please enter ^\"75000^\": \");\nIntOut(0, IntIn(0)); CrLf(0); \\echo the number\n]\n","language":"XPL0"},{"code":"input \"Please enter a string: \" s$\nrepeat\n input \"Please enter 75000 : \" i\nuntil i = 75000\nprint\nprint s$, chr$(9), i\n","language":"Yabasic"},{"code":"str:=ask(\"Gimmie a string: \");\nn:=ask(\"Type 75000: \").toInt();\n","language":"Zkl"},{"code":"10 INPUT \"Enter a string:\"; s$\n20 INPUT \"Enter a number: \"; n\n","language":"ZX-Spectrum-Basic"}],"string":"[\n {\n \"code\": \"---\\nfrom: http://rosettacode.org/wiki/User_input/Text\\nnote: Text processing\\n\",\n \"language\": \"00-META\"\n },\n {\n \"code\": \"{{selection|Short Circuit|Console Program Basics}}\\n[[Category:Basic language learning]]\\n[[Category:Keyboard input]] \\n[[Category:Simple]]\\n\\n;Task: \\nInput a string and the integer '''75000''' from the text console.\\n\\nSee also: [[User input/Graphical]]\\n<br><br>\\n\\n\",\n \"language\": \"00-TASK\"\n },\n {\n \"code\": \"V string = input(‘Input a string: ’)\\nV number = Float(input(‘Input a number: ’))\\n\",\n \"language\": \"11l\"\n },\n {\n \"code\": \"//Consts\\n.equ BUFFERSIZE, 100\\n.equ STDIN, 0 // linux input console\\n.equ STDOUT, 1 // linux output console\\n.equ READ, 63\\n.equ WRITE, 64\\n.equ EXIT, 93\\n\\n.data\\nenterText:\\t\\t.asciz \\\"Enter text: \\\"\\ncarriageReturn: \\t.asciz \\\"\\\\n\\\"\\n\\n//Read Buffer\\n.bss\\nbuffer: .skip BUFFERSIZE\\n\\n.text\\n.global _start\\n\\nquadEnterText: \\t.quad enterText\\nquadBuffer: \\t.quad buffer\\nquadCarriageReturn:\\t.quad carriageReturn\\n\\nwriteMessage:\\n mov x2,0 // reset size counter to 0\\n\\ncheckSize: // get size of input\\n ldrb w1,[x0,x2] // load char with offset of x2\\n add x2,x2,#1 // add 1 char read legnth\\n cbz w1,output // if char found\\n b checkSize // loop\\n\\noutput:\\n mov x1,x0 // move string address into system call func parm\\n mov x0,STDOUT\\n mov x8,WRITE\\n svc 0 // trigger system write\\n ret\\n\\n\\n_start:\\n //Output enter text\\n ldr x0,quadEnterText\\t// load enter message\\n bl writeMessage\\t\\t// output enter message\\n\\n //Read User Input\\n mov x0,STDIN \\t// linux input console\\n ldr x1,quadBuffer \\t// load buffer address\\n mov x2,BUFFERSIZE \\t// load buffer size\\n mov x8,READ \\t// request to read data\\n svc 0 \\t// trigger system read input\\n\\n //Output User Message\\n mov x2, #0\\t\\t\\t// prep end of string\\n ldr x1,quadBuffer \\t// load buffer address\\n strb w2,[x1, x0] \\t// store x2 0 byte at the end of input string, offset x0\\n ldr x0,quadBuffer \\t// load buffer address\\n bl writeMessage\\n\\n //Output newline\\n ldr x0,quadCarriageReturn\\n bl writeMessage\\n\\n //End Program\\n mov x0, #0 \\t// return code\\n mov x8, #EXIT \\t// request to exit program\\n svc 0 \\t// trigger end of program\\n\",\n \"language\": \"AArch64-Assembly\"\n },\n {\n \"code\": \"INCLUDE \\\"H6:REALMATH.ACT\\\"\\n\\nPROC Main()\\n CHAR ARRAY sUser(255)\\n REAL r75000,rUser\\n\\n Put(125) PutE() ;clear the screen\\n ValR(\\\"75000\\\",r75000)\\n\\n Print(\\\"Please enter a text: \\\")\\n InputS(sUser)\\n\\n DO\\n Print(\\\"Please enter number \\\")\\n PrintR(r75000) Print(\\\": \\\")\\n InputR(rUser)\\n UNTIL RealEqual(rUser,r75000)\\n OD\\n\\n PutE()\\n Print(\\\"Text: \\\") PrintE(sUser)\\n Print(\\\"Number: \\\") PrintRE(rUser)\\nRETURN\\n\",\n \"language\": \"Action-\"\n },\n {\n \"code\": \"function Get_String return String is\\n Line : String (1 .. 1_000);\\n Last : Natural;\\nbegin\\n Get_Line (Line, Last);\\n return Line (1 .. Last);\\nend Get_String;\\n\\nfunction Get_Integer return Integer is\\n S : constant String := Get_String;\\nbegin\\n return Integer'Value (S);\\n -- may raise exception Constraint_Error if value entered is not a well-formed integer\\nend Get_Integer;\\n\",\n \"language\": \"Ada\"\n },\n {\n \"code\": \"My_String : String := Get_String;\\nMy_Integer : Integer := Get_Integer;\\n\",\n \"language\": \"Ada\"\n },\n {\n \"code\": \"with Ada.Text_IO, Ada.Integer_Text_IO;\\n\\nprocedure User_Input is\\n I : Integer;\\nbegin\\n Ada.Text_IO.Put (\\\"Enter a string: \\\");\\n declare\\n S : String := Ada.Text_IO.Get_Line;\\n begin\\n Ada.Text_IO.Put_Line (S);\\n end;\\n Ada.Text_IO.Put (\\\"Enter an integer: \\\");\\n Ada.Integer_Text_IO.Get(I);\\n Ada.Text_IO.Put_Line (Integer'Image(I));\\nend User_Input;\\n\",\n \"language\": \"Ada\"\n },\n {\n \"code\": \"with\\n Ada.Text_IO,\\n Ada.Integer_Text_IO,\\n Ada.Strings.Unbounded,\\n Ada.Text_IO.Unbounded_IO;\\n\\nprocedure User_Input2 is\\n S : Ada.Strings.Unbounded.Unbounded_String;\\n I : Integer;\\nbegin\\n Ada.Text_IO.Put(\\\"Enter a string: \\\");\\n S := Ada.Strings.Unbounded.To_Unbounded_String(Ada.Text_IO.Get_Line);\\n Ada.Text_IO.Put_Line(Ada.Strings.Unbounded.To_String(S));\\n Ada.Text_IO.Unbounded_IO.Put_Line(S);\\n Ada.Text_IO.Put(\\\"Enter an integer: \\\");\\n Ada.Integer_Text_IO.Get(I);\\n Ada.Text_IO.Put_Line(Integer'Image(I));\\nend User_Input2;\\n\",\n \"language\": \"Ada\"\n },\n {\n \"code\": \"print(\\\"Enter a string: \\\");\\nSTRING s := read string;\\nprint(\\\"Enter a number: \\\");\\nINT i := read int;\\n~\\n\",\n \"language\": \"ALGOL-68\"\n },\n {\n \"code\": \"begin\\n string(80) s;\\n integer n;\\n write( \\\"Enter a string > \\\" );\\n read( s );\\n write( \\\"Enter an integer> \\\" );\\n read( n )\\nend.\\n\",\n \"language\": \"ALGOL-W\"\n },\n {\n \"code\": \"#include <flow.h>\\n\\n#import lib/input.bas.lib\\n#include include/flow-input.h\\n\\nDEF-MAIN(argv,argc)\\n CLR-SCR\\n MSET( número, cadena )\\n LOCATE(2,2), PRNL( \\\"Input an string : \\\"), LOC-COL(20), LET( cadena := READ-STRING( cadena ) )\\n LOCATE(3,2), PRNL( \\\"Input an integer: \\\"), LOC-COL(20), LET( número := INT( VAL(READ-NUMBER( número )) ) )\\n LOCATE(5,2), PRNL( cadena, \\\"\\\\n \\\",número )\\nEND\\n\",\n \"language\": \"Amazing-Hopper\"\n },\n {\n \"code\": \"str←⍞\\nint←⎕\\n\",\n \"language\": \"APL\"\n },\n {\n \"code\": \"10 INPUT \\\"ENTER A STRING: \\\"; S$\\n20 INPUT \\\"ENTER A NUMBER: \\\"; I : I = INT(I)\\n\",\n \"language\": \"Applesoft-BASIC\"\n },\n {\n \"code\": \"/* ARM assembly Raspberry PI */\\n/* program inputText.s */\\n\\n/* Constantes */\\n.equ BUFFERSIZE, 100\\n.equ STDIN, 0 @ Linux input console\\n.equ STDOUT, 1 @ Linux output console\\n.equ EXIT, 1 @ Linux syscall\\n.equ READ, 3 @ Linux syscall\\n.equ WRITE, 4 @ Linux syscall\\n/* Initialized data */\\n.data\\nszMessDeb: .asciz \\\"Enter text : \\\\n\\\"\\nszMessNum: .asciz \\\"Enter number : \\\\n\\\"\\nszCarriageReturn: .asciz \\\"\\\\n\\\"\\n\\n/* UnInitialized data */\\n.bss\\nsBuffer: .skip BUFFERSIZE\\n\\n/* code section */\\n.text\\n.global main\\nmain: /* entry of program */\\n push {fp,lr} /* saves 2 registers */\\n ldr r0,iAdrszMessDeb\\n bl affichageMess\\n mov r0,#STDIN @ Linux input console\\n ldr r1,iAdrsBuffer @ buffer address\\n mov r2,#BUFFERSIZE @ buffer size\\n mov r7, #READ @ request to read datas\\n swi 0 @ call system\\n ldr r1,iAdrsBuffer @ buffer address\\n mov r2,#0 @ end of string\\n strb r2,[r1,r0] @ store byte at the end of input string (r0 contains number of characters)\\n\\n ldr r0,iAdrsBuffer @ buffer address\\n bl affichageMess\\n ldr r0,iAdrszCarriageReturn\\n bl affichageMess\\n\\n ldr r0,iAdrszMessNum\\n bl affichageMess\\n mov r0,#STDIN @ Linux input console\\n ldr r1,iAdrsBuffer @ buffer address\\n mov r2,#BUFFERSIZE @ buffer size\\n mov r7, #READ @ request to read datas\\n swi 0 @ call system\\n ldr r1,iAdrsBuffer @ buffer address\\n mov r2,#0 @ end of string\\n strb r2,[r1,r0] @ store byte at the end of input string (r0\\n @\\n ldr r0,iAdrsBuffer @ buffer address\\n bl conversionAtoD @ conversion string in number in r0\\n\\n100: /* standard end of the program */\\n mov r0, #0 @ return code\\n pop {fp,lr} @restaur 2 registers\\n mov r7, #EXIT @ request to exit program\\n swi 0 @ perform the system call\\n\\niAdrszMessDeb: .int szMessDeb\\niAdrszMessNum: .int szMessNum\\niAdrsBuffer: .int sBuffer\\niAdrszCarriageReturn: .int szCarriageReturn\\n/******************************************************************/\\n/* display text with size calculation */\\n/******************************************************************/\\n/* r0 contains the address of the message */\\naffichageMess:\\n push {fp,lr} \\t\\t\\t/* save registres */\\n push {r0,r1,r2,r7} \\t\\t/* save others registers */\\n mov r2,#0 \\t\\t\\t\\t/* counter length */\\n1: \\t/* loop length calculation */\\n ldrb r1,[r0,r2] \\t\\t\\t/* read octet start position + index */\\n cmp r1,#0 \\t\\t\\t/* if 0 its over */\\n addne r2,r2,#1 \\t\\t\\t/* else add 1 in the length */\\n bne 1b \\t\\t\\t/* and loop */\\n /* so here r2 contains the length of the message */\\n mov r1,r0 \\t\\t\\t/* address message in r1 */\\n mov r0,#STDOUT \\t\\t/* code to write to the standard output Linux */\\n mov r7, #WRITE /* code call system \\\"write\\\" */\\n swi #0 /* call systeme */\\n pop {r0,r1,r2,r7} \\t\\t/* restaur others registers */\\n pop {fp,lr} \\t\\t\\t\\t/* restaur des 2 registres */\\n bx lr\\t \\t\\t\\t/* return */\\n\\n/******************************************************************/\\n/* Convert a string to a number stored in a registry */\\n/******************************************************************/\\n/* r0 contains the address of the area terminated by 0 or 0A */\\n/* r0 returns a number */\\nconversionAtoD:\\n push {fp,lr} @ save 2 registers\\n push {r1-r7} @ save others registers\\n mov r1,#0\\n mov r2,#10 @ factor\\n mov r3,#0 @ counter\\n mov r4,r0 @ save address string -> r4\\n mov r6,#0 @ positive sign by default\\n mov r0,#0 @ initialization to 0\\n1: /* early space elimination loop */\\n ldrb r5,[r4,r3] @ loading in r5 of the byte located at the beginning + the position\\n cmp r5,#0 @ end of string -> end routine\\n beq 100f\\n cmp r5,#0x0A @ end of string -> end routine\\n beq 100f\\n cmp r5,#' ' @ space ?\\n addeq r3,r3,#1 @ yes we loop by moving one byte\\n beq 1b\\n cmp r5,#'-' @ first character is -\\n moveq r6,#1 @ 1 -> r6\\n beq 3f @ then move on to the next position\\n2: /* beginning of digit processing loop */\\n cmp r5,#'0' @ character is not a number\\n blt 3f\\n cmp r5,#'9' @ character is not a number\\n bgt 3f\\n /* character is a number */\\n sub r5,#48\\n ldr r1,iMaxi @ check the overflow of the register\\n cmp r0,r1\\n bgt 99f @ overflow error\\n mul r0,r2,r0 @ multiply par factor 10\\n add r0,r5 @ add to r0\\n3:\\n add r3,r3,#1 @ advance to the next position\\n ldrb r5,[r4,r3] @ load byte\\n cmp r5,#0 @ end of string -> end routine\\n beq 4f\\n cmp r5,#0x0A @ end of string -> end routine\\n beq 4f\\n b 2b @ loop\\n4:\\n cmp r6,#1 @ test r6 for sign\\n moveq r1,#-1\\n muleq r0,r1,r0 @ if negatif, multiply par -1\\n b 100f\\n99: /* overflow error */\\n ldr r0,=szMessErrDep\\n bl affichageMess\\n mov r0,#0 @ return zero if error\\n100:\\n pop {r1-r7} @ restaur other registers\\n pop {fp,lr} @ restaur 2 registers\\n bx lr @return procedure\\n/* constante program */\\t\\niMaxi: .int 1073741824\\t\\nszMessErrDep: .asciz \\\"Too large: overflow 32 bits.\\\\n\\\"\\n\",\n \"language\": \"ARM-Assembly\"\n },\n {\n \"code\": \"str: input \\\"Enter a string: \\\"\\nnum: to :integer input \\\"Enter an integer: \\\"\\n\\nprint [\\\"Got:\\\" str \\\",\\\" num]\\n\",\n \"language\": \"Arturo\"\n },\n {\n \"code\": \"DllCall(\\\"AllocConsole\\\")\\nFileAppend, please type something`n, CONOUT$\\nFileReadLine, line, CONIN$, 1\\nmsgbox % line\\nFileAppend, please type '75000'`n, CONOUT$\\nFileReadLine, line, CONIN$, 1\\nmsgbox % line\\n\",\n \"language\": \"AutoHotkey\"\n },\n {\n \"code\": \"TrayTip, Input:, Type a string:\\nInput(String)\\nTrayTip, Input:, Type an int:\\nInput(Int)\\nTrayTip, Done!, Input was recieved.\\nMsgbox, You entered \\\"%String%\\\" and \\\"%Int%\\\"\\nExitApp\\nReturn\\n\\nInput(ByRef Output)\\n{\\n Loop\\n {\\n Input, Char, L1, {Enter}{Space}\\n If ErrorLevel contains Enter\\n Break\\n Else If ErrorLevel contains Space\\n Output .= \\\" \\\"\\n Else\\n Output .= Char\\n TrayTip, Input:, %Output%\\n }\\n}\\n\",\n \"language\": \"AutoHotkey\"\n },\n {\n \"code\": \"~/src/opt/run $ awk 'BEGIN{printf \\\"enter a string: \\\"}{s=$0;i=$0+0;print \\\"ok,\\\"s\\\"/\\\"i}'\\nenter a string: hello world\\nok,hello world/0\\n75000\\nok,75000/75000\\n\",\n \"language\": \"AWK\"\n },\n {\n \"code\": \"Disp \\\"String:\\\"\\ninput→A\\nlength(A)→L\\n\\n.Copy the string to a safe location\\nCopy(A,L₁,L)\\n\\n.Display the string\\nDisp \\\"You entered:\\\",i\\nFor(I,0,L-1)\\n Disp {L₁+I}►Char\\nEnd\\nDisp i\\n\\nDisp \\\"Integer:\\\",i\\ninput→B\\nlength(B)→L\\n\\n.Parse the string and convert to an integer\\n0→C\\nFor(I,0,L-1)\\n {B+I}-'0'→N\\n If N>10\\n .Error checking\\n Disp \\\"Not a number\\\",i\\n Return\\n End\\n C*10+N→C\\nEnd\\n\\n.Display and check the integer\\nDisp \\\"You entered:\\\",i,C►Dec,i\\nIf C≠7500\\nDisp \\\"That isn't 7500\\\"\\nEnd\\n\",\n \"language\": \"Axe\"\n },\n {\n \"code\": \" * NB: whitespace insignificance and case insensitivity\\n * are used in the field name.\\n IDENTIFICATION DIVISION.\\n PROGRAM-ID. USER INPUT.\\n DATA DIVISION.\\n 01 HUNDRED CHAR STRING PICTURE IS X(100).\\n 01 FIVE DIGIT NUMBER PICTURE IS 9(5).\\n PROCEDURE DIVISION.\\n DISPLAY \\\"Enter a string of appropriate length: \\\" WITH NO ADVANCING\\n ACCEPT HundredChar String.\\n DISPLAY \\\"Enter a number (preferably 75000): \\\" WITH NO ADVANCING\\n ACCEPT FiveDigit Number.\\n\",\n \"language\": \"BabyCobol\"\n },\n {\n \"code\": \"INPUT \\\"Enter a string\\\"; s$\\nINPUT \\\"Enter a number: \\\", i%\\n\",\n \"language\": \"BASIC\"\n },\n {\n \"code\": \"input string \\\"Please enter a string: \\\", s\\ndo\\n input \\\"Please enter 75000 : \\\", i\\nuntil i = 75000\\nprint\\nprint s, i\\n\",\n \"language\": \"BASIC256\"\n },\n {\n \"code\": \"@echo off\\nset /p var=\\necho %var% 75000\\n\",\n \"language\": \"Batch-File\"\n },\n {\n \"code\": \" INPUT LINE \\\"Enter a string: \\\" string$\\n INPUT \\\"Enter a number: \\\" number\\n\\n PRINT \\\"String = \\\"\\\"\\\" string$ \\\"\\\"\\\"\\\"\\n PRINT \\\"Number = \\\" ; number\\n\",\n \"language\": \"BBC-BASIC\"\n },\n {\n \"code\": \"<>:v:\\\"Enter a string: \\\"\\n ^,_ >~:1+v\\n ^ _@\\n\",\n \"language\": \"Befunge\"\n },\n {\n \"code\": \"<>:v:\\\"Enter a number: \\\"\\n ^,_ & @\\n\",\n \"language\": \"Befunge\"\n },\n {\n \"code\": \"( doit\\n= out'\\\"Enter a string\\\"\\n & get':?mystring\\n & whl\\n ' ( out'\\\"Enter a number\\\"\\n & get':?mynumber\\n & !mynumber:~#\\n & out'\\\"I said:\\\\\\\"a number\\\\\\\"!\\\"\\n )\\n & out$(mystring is !mystring \\\\nmynumber is !mynumber \\\\n)\\n);\\n\",\n \"language\": \"Bracmat\"\n },\n {\n \"code\": \"#include <stdio.h>\\n#include <stdlib.h>\\n\\nint main(void)\\n{\\n // Get a string from stdin\\n char str[BUFSIZ];\\n puts(\\\"Enter a string: \\\");\\n fgets(str, sizeof(str), stdin);\\n\\n // Get 75000 from stdin\\n long num;\\n char buf[BUFSIZ];\\n do\\n {\\n puts(\\\"Enter 75000: \\\");\\n fgets(buf, sizeof(buf), stdin);\\n num = strtol(buf, NULL, 10);\\n } while (num != 75000);\\n\\n return EXIT_SUCCESS;\\n}\\n\",\n \"language\": \"C\"\n },\n {\n \"code\": \"#include <gadget/gadget.h>\\n\\nLIB_GADGET_START\\n\\nMain\\n Cls;\\n\\n String text;\\n int number=0;\\n\\n At 5,5; Print \\\"Enter text : \\\";\\n Atrow 7; Print \\\"Enter ‘75000’: \\\";\\n Atcol 20;\\n\\n Atrow 5; Fn_let(text, Input ( text, 30 ) );\\n Free secure text;\\n\\n Atrow 7; Stack{\\n while (number!=75000 )\\n /*into stack, Input() not need var*/\\n number = Str2int( Input ( NULL, 6 ) );\\n }Stack_off;\\n\\n Prnl;\\nEnd\\n\",\n \"language\": \"C\"\n },\n {\n \"code\": \"#include <iostream>\\n#include <string>\\nusing namespace std;\\n\\nint main()\\n{\\n // while probably all current implementations have int wide enough for 75000, the C++ standard\\n // only guarantees this for long int.\\n long int integer_input;\\n string string_input;\\n cout << \\\"Enter an integer: \\\";\\n cin >> integer_input;\\n cout << \\\"Enter a string: \\\";\\n cin >> string_input;\\n return 0;\\n}\\n\",\n \"language\": \"C++\"\n },\n {\n \"code\": \" cin >> string_input;\\n\",\n \"language\": \"C++\"\n },\n {\n \"code\": \" getline(cin, string_input);\\n\",\n \"language\": \"C++\"\n },\n {\n \"code\": \"using System;\\n\\nnamespace C_Sharp_Console {\\n\\n class example {\\n\\n static void Main() {\\n string word;\\n int num;\\n\\n Console.Write(\\\"Enter an integer: \\\");\\n num = Console.Read();\\n Console.Write(\\\"Enter a String: \\\");\\n word = Console.ReadLine();\\n }\\n }\\n}\\n\",\n \"language\": \"C-sharp\"\n },\n {\n \"code\": \"shared void run() {\\n\\tprint(\\\"enter any text here\\\");\\n\\tvalue text = process.readLine();\\n\\tprint(text);\\n\\tprint(\\\"enter the number 75000 here\\\");\\n\\tif (is Integer number = Integer.parse(process.readLine() else \\\"\\\")) {\\n\\t\\tprint(\\\"``number == 75k then number else \\\"close enough\\\"``\\\");\\n\\t}\\n\\telse {\\n\\t\\tprint(\\\"That was not a number per se.\\\");\\n\\t}\\n}\\n\",\n \"language\": \"Ceylon\"\n },\n {\n \"code\": \"(import '(java.util Scanner))\\n(def scan (Scanner. *in*))\\n(def s (.nextLine scan))\\n(def n (.nextInt scan))\\n\",\n \"language\": \"Clojure\"\n },\n {\n \"code\": \" IDENTIFICATION DIVISION.\\n PROGRAM-ID. Get-Input.\\n\\n DATA DIVISION.\\n WORKING-STORAGE SECTION.\\n 01 Input-String PIC X(30).\\n 01 Input-Int PIC 9(5).\\n\\n PROCEDURE DIVISION.\\n DISPLAY \\\"Enter a string:\\\"\\n ACCEPT Input-String\\n\\n DISPLAY \\\"Enter a number:\\\"\\n ACCEPT Input-Int\\n\\n GOBACK\\n .\\n\",\n \"language\": \"COBOL\"\n },\n {\n \"code\": \"10 input \\\"what is a word i should remember\\\";a$\\n20 print \\\"thank you.\\\"\\n30 input \\\"will you please type the number 75000\\\";nn\\n40 if nn<>75000 then print \\\"i'm sorry, that's not right.\\\":goto 30\\n50 print \\\"thank you.\\\":print \\\"you provided the following values:\\\"\\n60 print a$\\n70 print nn\\n80 end\\n\",\n \"language\": \"Commodore-BASIC\"\n },\n {\n \"code\": \"(format t \\\"Enter some text: \\\")\\n(let ((s (read-line)))\\n (format t \\\"You entered ~s~%\\\" s))\\n\\n(format t \\\"Enter a number: \\\")\\n(let ((n (read)))\\n (if (numberp n)\\n (format t \\\"You entered ~d.~%\\\" n)\\n (format t \\\"That was not a number.\\\")))\\n\",\n \"language\": \"Common-Lisp\"\n },\n {\n \"code\": \"puts \\\"You entered: #{gets}\\\"\\n\\nbegin\\n puts \\\"You entered: #{gets.not_nil!.chomp.to_i}\\\"\\nrescue ex\\n puts ex\\nend\\n\",\n \"language\": \"Crystal\"\n },\n {\n \"code\": \"import std.stdio;\\n\\nvoid main() {\\n long number;\\n write(\\\"Enter an integer: \\\");\\n readf(\\\"%d\\\", &number);\\n\\n char[] str;\\n write(\\\"Enter a string: \\\");\\n readf(\\\" %s\\\\n\\\", &str);\\n\\n writeln(\\\"Read in '\\\", number, \\\"' and '\\\", str, \\\"'\\\");\\n}\\n\",\n \"language\": \"D\"\n },\n {\n \"code\": \"import 'dart:io' show stdout, stdin;\\n\\nmain() {\\n\\tstdout.write('Enter a string: ');\\n\\tfinal string_input = stdin.readLineSync();\\n\\n\\tint number_input;\\t\\n\\n\\tdo {\\n\\t\\tstdout.write('Enter the number 75000: ');\\n\\t\\tvar number_input_string = stdin.readLineSync();\\n\\n\\t\\ttry {\\n\\t\\t\\tnumber_input = int.parse(number_input_string);\\n\\t\\t\\tif (number_input != 75000)\\n\\t\\t\\t\\tstdout.writeln('$number_input is not 75000!');\\n\\t\\t} on FormatException {\\n\\t\\t\\tstdout.writeln('$number_input_string is not a valid number!');\\n\\t\\t} catch ( e ) {\\n\\t\\t\\tstdout.writeln(e);\\n\\t\\t}\\n\\n\\t} while ( number_input != 75000 );\\n\\n\\tstdout.writeln('input: $string_input\\\\nnumber: $number_input');\\n}\\n\",\n \"language\": \"Dart\"\n },\n {\n \"code\": \"program UserInputText;\\n\\n{$APPTYPE CONSOLE}\\n\\nuses SysUtils;\\n\\nvar\\n s: string;\\n lStringValue: string;\\n lIntegerValue: Integer;\\nbegin\\n WriteLn('Enter a string:');\\n Readln(lStringValue);\\n\\n repeat\\n WriteLn('Enter the number 75000');\\n Readln(s);\\n lIntegerValue := StrToIntDef(s, 0);\\n if lIntegerValue <> 75000 then\\n Writeln('Invalid entry: ' + s);\\n until lIntegerValue = 75000;\\nend.\\n\",\n \"language\": \"Delphi\"\n },\n {\n \"code\": \"write \\\"Enter a string: \\\"\\na$ = input\\nprint \\\"\\\"\\nrepeat\\n write \\\"Enter the number 75000: \\\"\\n h = number input\\n print \\\"\\\"\\n until h = 75000\\n.\\nprint a$ & \\\" \\\" & h\\n\",\n \"language\": \"EasyLang\"\n },\n {\n \"code\": \"import extensions;\\n\\npublic program()\\n{\\n var num := new Integer();\\n console.write(\\\"Enter an integer: \\\").loadLineTo(num);\\n\\n var word := console.write(\\\"Enter a String: \\\").readLine()\\n}\\n\",\n \"language\": \"Elena\"\n },\n {\n \"code\": \"a = IO.gets(\\\"Enter a string: \\\") |> String.strip\\nb = IO.gets(\\\"Enter an integer: \\\") |> String.strip |> String.to_integer\\nf = IO.gets(\\\"Enter a real number: \\\") |> String.strip |> String.to_float\\nIO.puts \\\"String = #{a}\\\"\\nIO.puts \\\"Integer = #{b}\\\"\\nIO.puts \\\"Float = #{f}\\\"\\n\",\n \"language\": \"Elixir\"\n },\n {\n \"code\": \"{ok, [String]} = io:fread(\\\"Enter a string: \\\",\\\"~s\\\").\\n{ok, [Number]} = io:fread(\\\"Enter a number: \\\",\\\"~d\\\").\\n\",\n \"language\": \"Erlang\"\n },\n {\n \"code\": \" String = io:get_line(\\\"Enter a string: \\\").\\n\",\n \"language\": \"Erlang\"\n },\n {\n \"code\": \"include get.e\\n\\nsequence s\\natom n\\n\\ns = prompt_string(\\\"Enter a string:\\\")\\nputs(1, s & '\\\\n')\\nn = prompt_number(\\\"Enter a number:\\\",{})\\nprintf(1, \\\"%d\\\", n)\\n\",\n \"language\": \"Euphoria\"\n },\n {\n \"code\": \"open System\\n\\nlet ask_for_input s =\\n printf \\\"%s (End with Return): \\\" s\\n Console.ReadLine()\\n\\n[<EntryPoint>]\\nlet main argv =\\n ask_for_input \\\"Input a string\\\" |> ignore\\n ask_for_input \\\"Enter the number 75000\\\" |> ignore\\n 0\\n\",\n \"language\": \"F-Sharp\"\n },\n {\n \"code\": \"\\\"Enter a string: \\\" write\\nreadln\\n\\\"Enter a number: \\\" write\\nreadln string>number\\n\",\n \"language\": \"Factor\"\n },\n {\n \"code\": \"printl(\\\"Enter a string:\\\")\\nstr = input()\\nprintl(\\\"Enter a number:\\\")\\nn = int(input())\\n\",\n \"language\": \"Falcon\"\n },\n {\n \"code\": \"[[^$' =~][,]#,]w:\\n[0[^'0-$$9>0@>|~][\\\\10*+]#%]d:\\nw;! d;!.\\n\",\n \"language\": \"FALSE\"\n },\n {\n \"code\": \"class Main\\n{\\n public static Void main ()\\n {\\n Env.cur.out.print (\\\"Enter a string: \\\").flush\\n str := Env.cur.in.readLine\\n echo (\\\"Entered :$str:\\\")\\n Env.cur.out.print (\\\"Enter 75000: \\\").flush\\n Int n\\n try n = Env.cur.in.readLine.toInt\\n catch (Err e)\\n {\\n echo (\\\"You had to enter a number\\\")\\n return\\n }\\n echo (\\\"Entered :$n: which is \\\" + ((n == 75000) ? \\\"correct\\\" : \\\"wrong\\\"))\\n }\\n}\\n\",\n \"language\": \"Fantom\"\n },\n {\n \"code\": \": INPUT$ ( n -- addr n )\\n PAD SWAP ACCEPT\\n PAD SWAP ;\\n\",\n \"language\": \"Forth\"\n },\n {\n \"code\": \": INPUT# ( -- u true | false )\\n 0. 16 INPUT$ DUP >R\\n >NUMBER NIP NIP\\n R> <> DUP 0= IF NIP THEN ;\\n\",\n \"language\": \"Forth\"\n },\n {\n \"code\": \": INPUT# ( -- n true | d 1 | false )\\n 16 INPUT$ SNUMBER? ;\\n\",\n \"language\": \"Forth\"\n },\n {\n \"code\": \": INPUT# ( -- n true | false )\\n 16 INPUT$ NUMBER? NIP\\n DUP 0= IF NIP THEN ;\\n\",\n \"language\": \"Forth\"\n },\n {\n \"code\": \": input#\\n begin\\n refill drop bl parse-word ( a n)\\n number error? ( n f)\\n while ( n)\\n drop ( --)\\n repeat ( n)\\n;\\n\",\n \"language\": \"Forth\"\n },\n {\n \"code\": \": TEST\\n .\\\" Enter your name: \\\" 80 INPUT$ CR\\n .\\\" Hello there, \\\" TYPE CR\\n .\\\" Enter a number: \\\" INPUT# CR\\n IF .\\\" Your number is \\\" .\\n ELSE .\\\" That's not a number!\\\" THEN CR ;\\n\",\n \"language\": \"Forth\"\n },\n {\n \"code\": \"character(20) :: s\\ninteger :: i\\n\\nprint*, \\\"Enter a string (max 20 characters)\\\"\\nread*, s\\nprint*, \\\"Enter the integer 75000\\\"\\nread*, i\\n\",\n \"language\": \"Fortran\"\n },\n {\n \"code\": \"' FB 1.05.0 Win64\\n\\nDim s As String\\nDim i AS Integer\\nInput \\\"Please enter a string : \\\"; s\\nDo\\n Input \\\"Please enter 75000 : \\\"; i\\nLoop Until i = 75000\\nPrint\\nPrint s, i\\nSleep\\n\",\n \"language\": \"FreeBASIC\"\n },\n {\n \"code\": \"s = input[\\\"Enter a string: \\\"]\\ni = parseInt[input[\\\"Enter an integer: \\\"]]\\n\",\n \"language\": \"Frink\"\n },\n {\n \"code\": \"extends MainLoop\\n\\nfunc _process(_delta: float) -> bool:\\n\\tprintraw(\\\"Input a string: \\\")\\n\\tvar read_line := OS.read_string_from_stdin() # Mote that this retains the newline.\\n\\n\\tprintraw(\\\"Input an integer: \\\")\\n\\tvar read_integer := int(OS.read_string_from_stdin())\\n\\n\\tprint(\\\"read_line = %s\\\" % read_line.trim_suffix(\\\"\\\\n\\\"))\\n\\tprint(\\\"read_integer = %d\\\" % read_integer)\\n\\n\\treturn true # Exit instead of looping\\n\",\n \"language\": \"GDScript\"\n },\n {\n \"code\": \"package main\\n\\nimport \\\"fmt\\\"\\n\\nfunc main() {\\n var s string\\n var i int\\n if _, err := fmt.Scan(&s, &i); err == nil && i == 75000 {\\n fmt.Println(\\\"good\\\")\\n } else {\\n fmt.Println(\\\"wrong\\\")\\n }\\n}\\n\",\n \"language\": \"Go\"\n },\n {\n \"code\": \"package main\\n\\nimport (\\n \\\"bufio\\\"\\n \\\"fmt\\\"\\n \\\"os\\\"\\n \\\"strconv\\\"\\n \\\"strings\\\"\\n)\\n\\nfunc main() {\\n in := bufio.NewReader(os.Stdin)\\n\\n fmt.Print(\\\"Enter string: \\\")\\n s, err := in.ReadString('\\\\n')\\n if err != nil {\\n fmt.Println(err)\\n return\\n }\\n s = strings.TrimSpace(s)\\n\\n fmt.Print(\\\"Enter 75000: \\\")\\n s, err = in.ReadString('\\\\n')\\n if err != nil {\\n fmt.Println(err)\\n return\\n }\\n n, err := strconv.Atoi(strings.TrimSpace(s))\\n if err != nil {\\n fmt.Println(err)\\n return\\n }\\n if n != 75000 {\\n fmt.Println(\\\"fail: not 75000\\\")\\n return\\n }\\n fmt.Println(\\\"Good\\\")\\n}\\n\",\n \"language\": \"Go\"\n },\n {\n \"code\": \"word = System.in.readLine()\\nnum = System.in.readLine().toInteger()\\n\",\n \"language\": \"Groovy\"\n },\n {\n \"code\": \"import System.IO (hFlush, stdout)\\nmain = do\\n putStr \\\"Enter a string: \\\"\\n hFlush stdout\\n str <- getLine\\n putStr \\\"Enter an integer: \\\"\\n hFlush stdout\\n num <- readLn :: IO Int\\n putStrLn $ str ++ (show num)\\n\",\n \"language\": \"Haskell\"\n },\n {\n \"code\": \"print \\\"Enter a string: \\\"\\nlet s scan str\\nprint \\\"Enter a number: \\\"\\nlet n scan int\\n\",\n \"language\": \"Hexiscript\"\n },\n {\n \"code\": \"U8 *s;\\ns = GetStr(\\\"Enter a string: \\\");\\n\\nU32 *n;\\ndo {\\n n = GetStr(\\\"Enter 75000: \\\");\\n} while(Str2I64(n) != 75000);\\n\\nPrint(\\\"Your string: %s\\\\n\\\", s);\\nPrint(\\\"75000: %d\\\\n\\\", Str2I64(n));\\n\",\n \"language\": \"HolyC\"\n },\n {\n \"code\": \"procedure main ()\\n writes (\\\"Enter something: \\\")\\n s := read ()\\n write (\\\"You entered: \\\" || s)\\n\\n writes (\\\"Enter 75000: \\\")\\n if (i := integer (read ())) then\\n write (if (i = 75000) then \\\"correct\\\" else \\\"incorrect\\\")\\n else write (\\\"you must enter a number\\\")\\nend\\n\",\n \"language\": \"Icon\"\n },\n {\n \"code\": \"string := File clone standardInput readLine(\\\"Enter a string: \\\")\\ninteger := File clone standardInput readLine(\\\"Enter 75000: \\\") asNumber\\n\",\n \"language\": \"Io\"\n },\n {\n \"code\": \"100 INPUT PROMPT \\\"Enter a number: \\\":NUM\\n110 INPUT PROMPT \\\"Enter a string: \\\":ST$\\n\",\n \"language\": \"IS-BASIC\"\n },\n {\n \"code\": \" require 'misc' NB. load system script\\n prompt 'Enter string: '\\n 0\\\".prompt 'Enter an integer: '\\n\",\n \"language\": \"J\"\n },\n {\n \"code\": \" prompt 'Enter string: ' NB. output string to session\\nEnter string: Hello World\\nHello World\\n 0\\\".prompt 'Enter an integer: ' NB. output integer to session\\nEnter an integer: 75000\\n75000\\n mystring=: prompt 'Enter string: ' NB. store string as noun\\nEnter string: Hello Rosetta Code\\n myinteger=: 0\\\".prompt 'Enter an integer: ' NB. store integer as noun\\nEnter an integer: 75000\\n mystring;myinteger NB. show contents of nouns\\n┌──────────────────┬─────┐\\n│Hello Rosetta Code│75000│\\n└──────────────────┴─────┘\\n\",\n \"language\": \"J\"\n },\n {\n \"code\": \"import java.util.Scanner;\\n\\npublic class GetInput {\\n public static void main(String[] args) throws Exception {\\n Scanner s = new Scanner(System.in);\\n System.out.print(\\\"Enter a string: \\\");\\n String str = s.nextLine();\\n System.out.print(\\\"Enter an integer: \\\");\\n int i = Integer.parseInt(s.next());\\n }\\n}\\n\",\n \"language\": \"Java\"\n },\n {\n \"code\": \"import java.util.Scanner;\\n\\npublic class GetInput {\\n public static void main(String[] args) {\\n Scanner stdin = new Scanner(System.in);\\n String string = stdin.nextLine();\\n int number = stdin.nextInt();\\n }\\n}\\n\",\n \"language\": \"Java\"\n },\n {\n \"code\": \"WScript.Echo(\\\"Enter a string\\\");\\nvar str = WScript.StdIn.ReadLine();\\n\\nvar val = 0;\\nwhile (val != 75000) {\\n WScript.Echo(\\\"Enter the integer 75000\\\");\\n val = parseInt( WScript.StdIn.ReadLine() );\\n}\\n\",\n \"language\": \"JavaScript\"\n },\n {\n \"code\": \"print(\\\"Enter a string\\\");\\nvar str = readline();\\n\\nvar val = 0;\\nwhile (val != 75000) {\\n print(\\\"Enter the integer 75000\\\");\\n val = parseInt( readline() );\\n}\\n\",\n \"language\": \"JavaScript\"\n },\n {\n \"code\": \"\\\"Enter a string: \\\" putchars\\nstdin fgets\\n\\\"Enter a number: \\\" putchars\\nstdin fgets 10 strtol.\\n\",\n \"language\": \"Joy\"\n },\n {\n \"code\": \"def read(int):\\n null | until( . == int; \\\"Expecting \\\\(int)\\\" | stderr | input);\\n\\ndef read_string:\\n null | until( type == \\\"string\\\"; \\\"Please enter a string\\\" | stderr | input);\\n\\n(read_string | \\\"I see the string: \\\\(.)\\\"),\\n(read(75000) | \\\"I see the expected integer: \\\\(.)\\\")\\n\",\n \"language\": \"Jq\"\n },\n {\n \"code\": \"$ jq -n -r -f User_input.jq\\n\\\"Please enter a string\\\"\\n1\\n\\\"Please enter a string\\\"\\n\\\"ok\\\"\\nI see the string: ok\\n\\\"Expecting 75000\\\"\\n1\\n\\\"Expecting 75000\\\"\\n\\\"ok\\\"\\n\\\"Expecting 75000\\\"\\n75000\\nI see the expected integer: 75000\\n\",\n \"language\": \"Jq\"\n },\n {\n \"code\": \"print(\\\"String? \\\")\\ny = readline()\\nprintln(\\\"Your input was \\\\\\\"\\\", y, \\\"\\\\\\\".\\\\n\\\")\\nprint(\\\"Integer? \\\")\\ny = readline()\\ntry\\n y = parse(Int, y)\\n println(\\\"Your input was \\\\\\\"\\\", y, \\\"\\\\\\\".\\\\n\\\")\\ncatch\\n println(\\\"Sorry, but \\\\\\\"\\\", y, \\\"\\\\\\\" does not compute as an integer.\\\")\\nend\\n\",\n \"language\": \"Julia\"\n },\n {\n \"code\": \"System.file.stdout|write(\\\"Enter a String \\\");\\nstring = System.file.stdin|readline();\\n\",\n \"language\": \"Kite\"\n },\n {\n \"code\": \"// version 1.1\\n\\nfun main(args: Array<String>) {\\n print(\\\"Enter a string : \\\")\\n val s = readLine()!!\\n println(s)\\n do {\\n print(\\\"Enter 75000 : \\\")\\n val number = readLine()!!.toInt()\\n } while (number != 75000)\\n}\\n\",\n \"language\": \"Kotlin\"\n },\n {\n \"code\": \"{input\\n {@ type=\\\"text\\\"\\n placeholder=\\\"Please enter a string and dblclick\\\"\\n ondblclick=\\\"alert( 'You wrote « ' +\\n this.value +\\n ' » and it is ' +\\n ((isNaN(this.value)) ? 'not' : '') +\\n ' a number.' )\\\"\\n}}\\n\\nPlease enter a string and dblclick\\n\\nInput: Hello World\\nOutput: You wrote « Hello World » and it is not a number.\\n\\nInput: 123\\nOutput: You wrote « 123 » and it is a number.\\n\",\n \"language\": \"Lambdatalk\"\n },\n {\n \"code\": \"#!/usr/bin/lasso9\\n\\ndefine read_input(prompt::string) => {\\n\\n\\tlocal(string)\\n\\n\\t// display prompt\\n\\tstdout(#prompt)\\n\\t// the following bits wait until the terminal gives you back a line of input\\n\\twhile(not #string or #string -> size == 0) => {\\n\\t\\t#string = file_stdin -> readsomebytes(1024, 1000)\\n\\t}\\n\\t#string -> replace(bytes('\\\\n'), bytes(''))\\n\\n\\treturn #string -> asstring\\n\\n}\\n\\nlocal(\\n\\tstring,\\n\\tnumber\\n)\\n\\n// get string\\n#string = read_input('Enter the string: ')\\n\\n// get number\\n#number = integer(read_input('Enter the number: '))\\n\\n// deliver the result\\nstdoutnl(#string + ' (' + #string -> type + ') | ' + #number + ' (' + #number -> type + ')')\\n\",\n \"language\": \"Lasso\"\n },\n {\n \"code\": \"data:\\nmyText is text\\nmyNumber is number\\n\\nprocedure:\\ndisplay \\\"Enter some text: \\\"\\naccept myText\\ndisplay \\\"Enter a number: \\\"\\naccept myNumber\\n\",\n \"language\": \"LDPL\"\n },\n {\n \"code\": \"Input \\\"Enter a string. \\\";string$\\nInput \\\"Enter the value 75000.\\\";num\\n\",\n \"language\": \"Liberty-BASIC\"\n },\n {\n \"code\": \"# User input/text, in LIL\\nwrite \\\"Enter a string: \\\"\\nset text [readline]\\n\\nset num 0\\nwhile {[canread] && $num != 75000} {\\n write \\\"Enter the number 75000: \\\"\\n set num [readline]\\n}\\n\\nprint $text\\nprint $num\\n\",\n \"language\": \"LIL\"\n },\n {\n \"code\": \"make \\\"input readlist ; in: string 75000\\nshow map \\\"number? :input ; [false true]\\n\\nmake \\\"input readword ; in: 75000\\nshow :input + 123 ; 75123\\nmake \\\"input readword ; in: string 75000\\nshow :input ; string 75000\\n\",\n \"language\": \"Logo\"\n },\n {\n \"code\": \":- object(user_input).\\n\\n :- public(test/0).\\n test :-\\n repeat,\\n write('Enter an integer: '),\\n read(Integer),\\n integer(Integer),\\n !,\\n repeat,\\n write('Enter an atom: '),\\n read(Atom),\\n atom(Atom),\\n !.\\n\\n:- end_object.\\n\",\n \"language\": \"Logtalk\"\n },\n {\n \"code\": \"| ?- user_input::test.\\nEnter an integer: 75000.\\nEnter an atom: 'Hello world!'.\\nyes\\n\",\n \"language\": \"Logtalk\"\n },\n {\n \"code\": \"HAI 1.4\\nI HAS A string\\nGIMMEH string\\nI HAS A number\\nGIMMEH number\\nBTW converts number input to an integer\\nMAEK number A NUMBR\\nKTHXBYE\\n\",\n \"language\": \"LOLCODE\"\n },\n {\n \"code\": \"print('Enter a string: ')\\ns = io.stdin:read()\\nprint('Enter a number: ')\\ni = tonumber(io.stdin:read())\\n\",\n \"language\": \"Lua\"\n },\n {\n \"code\": \"Module CheckIt {\\n Keyboard \\\"75000\\\"+chr$(13)\\n Input \\\"Integer:\\\", A%\\n \\\\\\\\ Input erase keyboard buffer, we can't place in first Keyboard keys for second input\\n Keyboard \\\"Hello World\\\"+Chr$(13)\\n Input \\\"String:\\\", A$\\n Print A%, A$\\n}\\nCheckIt\\n\",\n \"language\": \"M2000-Interpreter\"\n },\n {\n \"code\": \"printf(\\\"String:\\\"); string_value := readline();\\nprintf(\\\"Integer: \\\"); int_value := parse(readline());\\n\",\n \"language\": \"Maple\"\n },\n {\n \"code\": \"mystring = InputString[\\\"give me a string please\\\"];\\nmyinteger = Input[\\\"give me an integer please\\\"];\\n\",\n \"language\": \"Mathematica\"\n },\n {\n \"code\": \">> input('Input string: ')\\nInput string: 'Hello'\\n\\nans =\\n\\nHello\\n\\n>> input('Input number: ')\\nInput number: 75000\\n\\nans =\\n\\n 75000\\n\\n>> input('Input number, the number will be stored as a string: ','s')\\nInput number, the number will be stored as a string: 75000\\n\\nans =\\n\\n75000\\n\",\n \"language\": \"MATLAB\"\n },\n {\n \"code\": \"/* String routine */\\nblock(\\ns:read(\\\"enter a string\\\"),\\nif stringp(s) then print(s,\\\"is an actual string\\\") else \\\"that is not a string\\\")$\\n\\n/* Number routine */\\nblock(\\nn:read(\\\"enter a number\\\"),\\nif numberp(n) then print(n,\\\"is an actual number\\\") else \\\"that is not a number\\\")$\\n\",\n \"language\": \"Maxima\"\n },\n {\n \"code\": \"string s;\\nmessage \\\"write a string: \\\";\\ns := readstring;\\nmessage s;\\nmessage \\\"write a number now: \\\";\\nb := scantokens readstring;\\nif b = 750:\\n message \\\"You've got it!\\\"\\nelse:\\n message \\\"Sorry...\\\"\\nfi;\\nend\\n\",\n \"language\": \"Metafont\"\n },\n {\n \"code\": \"\\\"Enter a string\\\" ask\\n\\\"Enter an integer\\\" ask int\\n\",\n \"language\": \"Min\"\n },\n {\n \"code\": \"s = System.console.readLine()\\n\\nputs s\\n\",\n \"language\": \"Mirah\"\n },\n {\n \"code\": \"alias askmesomething {\\n echo -a You answered: $input(What's your name?, e)\\n}\\n\",\n \"language\": \"MIRC-Scripting-Language\"\n },\n {\n \"code\": \"MODULE Input EXPORTS Main;\\n\\nIMPORT IO, Fmt;\\n\\nVAR string: TEXT;\\n number: INTEGER;\\n\\nBEGIN\\n IO.Put(\\\"Enter a string: \\\");\\n string := IO.GetLine();\\n IO.Put(\\\"Enter a number: \\\");\\n number := IO.GetInt();\\n IO.Put(\\\"You entered: \\\" & string & \\\" and \\\" & Fmt.Int(number) & \\\"\\\\n\\\");\\nEND Input.\\n\",\n \"language\": \"Modula-3\"\n },\n {\n \"code\": \"TXTINP\\n NEW S,N\\n WRITE \\\"Enter a string: \\\"\\n READ S,!\\n WRITE \\\"Enter the number 75000: \\\"\\n READ N,!\\n KILL S,N\\n QUIT\\n\",\n \"language\": \"MUMPS\"\n },\n {\n \"code\": \"string = str(input(\\\"Enter a string: \\\"))\\ninteger = int(input(\\\"Enter an integer: \\\"))\\n\",\n \"language\": \"Nanoquery\"\n },\n {\n \"code\": \"/**\\n User input/Text, in Neko\\n Tectonics:\\n nekoc userinput.neko\\n neko userinput\\n*/\\n\\nvar stdin = $loader.loadprim(\\\"std@file_stdin\\\", 0)()\\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 NEWLINE = 10\\nvar readline = function(f, s) {\\n var len = 0\\n var ch\\n while true {\\n try ch = file_read_char(f) catch a break;\\n if ch == NEWLINE break;\\n if $sset(s, len, ch) == null break; else len += 1\\n }\\n return $ssub(s, 0, len)\\n}\\n\\n$print(\\\"Enter a line of text, then the number 75000\\\\n\\\")\\n\\ntry {\\n var RECL = 132\\n var str = $smake(RECL)\\n var userstring = readline(stdin, str)\\n $print(\\\":\\\", userstring, \\\":\\\\n\\\")\\n\\n var num = $int(readline(stdin, str))\\n if num == 75000 $print(\\\"Rosetta Code 75000, for the win!\\\\n\\\")\\n else $print(\\\"Sorry, need 75000\\\\n\\\")\\n} catch problem $print(\\\"Exception: \\\", problem, \\\"\\\\n\\\")\\n\",\n \"language\": \"Neko\"\n },\n {\n \"code\": \"using System;\\nusing System.Console;\\n\\nmodule Input\\n{\\n Main() : void\\n {\\n Write(\\\"Enter a string:\\\");\\n _ = ReadLine()\\n\\n mutable entry = 0;\\n mutable numeric = false;\\n\\n do\\n {\\n Write(\\\"Enter 75000:\\\");\\n numeric = int.TryParse(ReadLine(), out entry);\\n } while ((!numeric) || (entry != 75000))\\n }\\n}\\n\",\n \"language\": \"Nemerle\"\n },\n {\n \"code\": \"/* NetRexx */\\noptions replace format comments java crossref symbols nobinary\\n\\ncheckVal = 75000\\nsay 'Input a string then the number' checkVal\\nparse ask inString\\nparse ask inNumber .\\n\\nsay 'Input string:' inString\\nsay 'Input number:' inNumber\\nif inNumber == checkVal then do\\n say 'Success! Input number is as requested'\\n end\\nelse do\\n say 'Failure! Number' inNumber 'is not' checkVal\\n end\\nreturn\\n\",\n \"language\": \"NetRexx\"\n },\n {\n \"code\": \"(print \\\"Enter an integer: \\\")\\n(set 'x (read-line))\\n(print \\\"Enter a string: \\\")\\n(set 'y (read-line))\\n\",\n \"language\": \"NewLISP\"\n },\n {\n \"code\": \"import rdstdin, strutils\\n\\nlet str = readLineFromStdin \\\"Input a string: \\\"\\nlet num = parseInt(readLineFromStdin \\\"Input an integer: \\\")\\n\",\n \"language\": \"Nim\"\n },\n {\n \"code\": \"10 INPUT \\\"ENTER A STRING: \\\",STRING$\\n20 PRINT \\\"YOU ENTERED \\\";STRING$;\\\".\\\"\\n30 INPUT \\\"ENTER AN INTEGER: \\\",INTEGER\\n40 PRINT \\\"YOU ENTERED\\\";INTEGER;\\\".\\\"\\n\",\n \"language\": \"NS-HUBASIC\"\n },\n {\n \"code\": \"{\\n\\tString: (input \\\"Enter a string: \\\")\\n\\tNumber: (input \\\"Enter an integer: \\\")\\n}\\n\",\n \"language\": \"Nu\"\n },\n {\n \"code\": \"MODULE InputText;\\nIMPORT\\n In,\\n Out;\\nVAR\\n i: INTEGER;\\n str: ARRAY 512 OF CHAR;\\nBEGIN\\n Out.String(\\\"Enter a integer: \\\");Out.Flush();In.Int(i);\\n Out.String(\\\"Enter a string: \\\");Out.Flush();In.String(str);\\nEND InputText.\\n\",\n \"language\": \"Oberon\"\n },\n {\n \"code\": \"use IO;\\n\\nbundle Default {\\n class Hello {\\n function : Main(args : String[]) ~ Nil {\\n string := Console->GetInstance()->ReadString();\\n string->PrintLine();\\n\\n number := Console->GetInstance()->ReadString()->ToInt();\\n number->PrintLine();\\n }\\n }\\n}\\n\",\n \"language\": \"Objeck\"\n },\n {\n \"code\": \"print_string \\\"Enter a string: \\\";\\nlet str = read_line () in\\n print_string \\\"Enter an integer: \\\";\\n let num = read_int () in\\n Printf.printf \\\"%s%d\\\\n\\\" str num\\n\",\n \"language\": \"OCaml\"\n },\n {\n \"code\": \"% read a string (\\\"s\\\")\\ns = input(\\\"Enter a string: \\\", \\\"s\\\");\\n\\n% read a GNU Octave expression, which is evaluated; e.g.\\n% 5/7 gives 0.71429\\ni = input(\\\"Enter an expression: \\\");\\n\\n% parse the input for an integer\\nprintf(\\\"Enter an integer: \\\");\\nri = scanf(\\\"%d\\\");\\n\\n% show the values\\ndisp(s);\\ndisp(i);\\ndisp(ri);\\n\",\n \"language\": \"Octave\"\n },\n {\n \"code\": \"import: console\\n\\n: testInput{\\n| s n |\\n System.Console askln ->s\\n while (System.Console askln asInteger dup ->n isNull) [ \\\"Not an integer\\\" println ]\\n\\n System.Out \\\"Received : \\\" << s << \\\" and \\\" << n << cr ;\\n\",\n \"language\": \"Oforth\"\n },\n {\n \"code\": \"declare\\n StdIn = {New class $ from Open.file Open.text end init(name:stdin)}\\n StringInput\\n Num = {NewCell 0}\\nin\\n {System.printInfo \\\"Enter a string: \\\"}\\n StringInput = {StdIn getS($)}\\n\\n for until:@Num == 75000 do\\n {System.printInfo \\\"Enter 75000: \\\"}\\n Line = {StdIn getS($)}\\n in\\n Num := try {String.toInt Line} catch _ then 0 end\\n end\\n\",\n \"language\": \"Oz\"\n },\n {\n \"code\": \"s=input();\\nn=eval(input());\\n\",\n \"language\": \"PARI-GP\"\n },\n {\n \"code\": \"program UserInput(input, output);\\nvar i : Integer;\\n s : String;\\nbegin\\n write('Enter an integer: ');\\n readln(i);\\n write('Enter a string: ');\\n readln(s)\\nend.\\n\",\n \"language\": \"Pascal\"\n },\n {\n \"code\": \"print \\\"Enter a string: \\\";\\nmy $string = <>;\\nprint \\\"Enter an integer: \\\";\\nmy $integer = <>;\\n\",\n \"language\": \"Perl\"\n },\n {\n \"code\": \"(notonline)-->\\n <span style=\\\"color: #0000FF;\\\">?</span><span style=\\\"color: #7060A8;\\\">prompt_string</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #008000;\\\">\\\"Enter any string:\\\"</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #0000FF;\\\">?</span><span style=\\\"color: #7060A8;\\\">prompt_number</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #008000;\\\">\\\"Enter the number 75000:\\\"</span><span style=\\\"color: #0000FF;\\\">,{</span><span style=\\\"color: #000000;\\\">75000</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">75000</span><span style=\\\"color: #0000FF;\\\">})</span>\\n<!--\\n\",\n \"language\": \"Phix\"\n },\n {\n \"code\": \"/# Rosetta Code problem: https://rosettacode.org/wiki/User_input/Text\\nby Galileo, 10/2022 #/\\n\\n\\\"Enter any string: \\\" input nl\\ntrue while\\n 75000 \\\"Enter the number \\\" over tostr chain \\\": \\\" chain input\\n nl tonum over == not\\nendwhile\\ndrop pstack\\n\",\n \"language\": \"Phixmonti\"\n },\n {\n \"code\": \"#!/usr/bin/php\\n<?php\\n$string = fgets(STDIN);\\n$integer = (int) fgets(STDIN);\\n\",\n \"language\": \"PHP\"\n },\n {\n \"code\": \"main =>\\n print(\\\"Enter a string: \\\"),\\n String = read_line(),\\n print(\\\"Enter a number: \\\"),\\n Number = read_int(),\\n println([string=String,number=Number]).\\n\",\n \"language\": \"Picat\"\n },\n {\n \"code\": \"(in NIL # Guarantee reading from standard input\\n (let (Str (read) Num (read))\\n (prinl \\\"The string is: \\\\\\\"\\\" Str \\\"\\\\\\\"\\\")\\n (prinl \\\"The number is: \\\" Num) ) )\\n\",\n \"language\": \"PicoLisp\"\n },\n {\n \"code\": \"int main(){\\n write(\\\"Enter a String: \\\");\\n string str = Stdio.stdin->gets();\\n write(\\\"Enter 75000: \\\");\\n int num = Stdio.stdin->gets();\\n}\\n\",\n \"language\": \"Pike\"\n },\n {\n \"code\": \"declare s character (100) varying;\\ndeclare k fixed decimal (15);\\n\\nput ('please type a string:');\\nget edit (s) (L);\\nput skip list (s);\\n\\nput skip list ('please type the integer 75000');\\nget list (k);\\nput skip list (k);\\nput skip list ('Thanks');\\n\",\n \"language\": \"PL-I\"\n },\n {\n \"code\": \"To run:\\nStart up.\\nDemonstrate input.\\nWait for the escape key.\\nShut down.\\n\\nTo demonstrate input:\\nWrite \\\"Enter a string: \\\" to the console without advancing.\\nRead a string from the console.\\nWrite \\\"Enter a number: \\\" to the console without advancing.\\nRead a number from the console.\\n\\\\Now show the input values\\nWrite \\\"The string: \\\" then the string to the console.\\nWrite \\\"The number: \\\" then the number to the console.\\n\",\n \"language\": \"Plain-English\"\n },\n {\n \"code\": \";;; Setup item reader\\nlvars itemrep = incharitem(charin);\\nlvars s, c, j = 0;\\n;;; read chars up to a newline and put them on the stack\\nwhile (charin() ->> c) /= `\\\\n` do j + 1 -> j ; c endwhile;\\n;;; build the string\\nconsstring(j) -> s;\\n;;; read the integer\\nlvars i = itemrep();\\n\",\n \"language\": \"Pop11\"\n },\n {\n \"code\": \"%open stdin for reading (and name the channel \\\"kbd\\\"):\\n/kbd (%stdin) (r) file def\\n%make ten-char buffer to read string into:\\n/buf (..........) def\\n%read string into buffer:\\nkbd buf readline\\n\",\n \"language\": \"PostScript\"\n },\n {\n \"code\": \"%if the read was successful, convert the string to integer:\\n{cvi} if\\n\",\n \"language\": \"PostScript\"\n },\n {\n \"code\": \"$string = Read-Host \\\"Input a string\\\"\\n[int]$number = Read-Host \\\"Input a number\\\"\\n\",\n \"language\": \"PowerShell\"\n },\n {\n \"code\": \"If OpenConsole()\\n ; Declare a string and a integer to be used\\n Define txt.s, num.i\\n\\n Print(\\\"Enter a string: \\\")\\n txt=Input()\\n\\n Repeat\\n Print(\\\"Enter the number 75000: \\\")\\n num=Val(Input()) ; Converts the Input to a Value with Val()\\n Until num=75000\\n ; Check that the user really gives us 75000!\\n\\n Print(\\\"You made it!\\\")\\n Delay(3000): CloseConsole()\\nEndIf\\n\",\n \"language\": \"PureBasic\"\n },\n {\n \"code\": \" string = raw_input(\\\"Input a string: \\\")\\n\",\n \"language\": \"Python\"\n },\n {\n \"code\": \" string = input(\\\"Input a string: \\\")\\n\",\n \"language\": \"Python\"\n },\n {\n \"code\": \" number = input(\\\"Input a number: \\\") # Deprecated, please don't use.\\n\",\n \"language\": \"Python\"\n },\n {\n \"code\": \" number = eval(input(\\\"Input a number: \\\")) # Evil, please don't use.\\n\",\n \"language\": \"Python\"\n },\n {\n \"code\": \" number = float(raw_input(\\\"Input a number: \\\"))\\n\",\n \"language\": \"Python\"\n },\n {\n \"code\": \" number = float(input(\\\"Input a number: \\\"))\\n\",\n \"language\": \"Python\"\n },\n {\n \"code\": \"Input \\\"Enter text and a number\\\", s$, l&\\nPrint s$\\nPrint l&\\n\",\n \"language\": \"QB64\"\n },\n {\n \"code\": \"$ \\\"Please enter a string: \\\" input\\nsay 'You entered: \\\"' echo$ say '\\\"' cr cr\\n\\n$ \\\"Please enter an integer: \\\" input\\ntrim reverse trim reverse\\n$->n iff\\n [ say \\\"You entered: \\\" echo cr ]\\nelse\\n [ say \\\"That was not an integer.\\\" cr\\n drop ]\\n\",\n \"language\": \"Quackery\"\n },\n {\n \"code\": \"stringval <- readline(\\\"String: \\\")\\nintval <- as.integer(readline(\\\"Integer: \\\"))\\n\",\n \"language\": \"R\"\n },\n {\n \"code\": \"#lang racket\\n(printf \\\"Input a string: \\\")\\n(define s (read-line))\\n(printf \\\"You entered: ~a\\\\n\\\" s)\\n\\n(printf \\\"Input a number: \\\")\\n(define m (or (string->number (read-line))\\n (error \\\"I said a number!\\\")))\\n(printf \\\"You entered: ~a\\\\n\\\" m)\\n\\n;; alternatively, use the generic `read'\\n(printf \\\"Input a number: \\\")\\n(define n (read))\\n(unless (number? n) (error \\\"I said a number!\\\"))\\n(printf \\\"You entered: ~a\\\\n\\\" n)\\n\",\n \"language\": \"Racket\"\n },\n {\n \"code\": \"my $str = prompt(\\\"Enter a string: \\\");\\nmy $int = prompt(\\\"Enter a integer: \\\");\\n\",\n \"language\": \"Raku\"\n },\n {\n \"code\": \"import util::IDE;\\npublic void InputConsole(){\\n x = \\\"\\\";\\n createConsole(\\\"Input Console\\\",\\n \\\"Welcome to the Input Console\\\\nInput\\\\> \\\",\\n str (str inp) {x = \\\"<inp == \\\"75000\\\" ? \\\"You entered 75000\\\" : \\\"You entered a string\\\">\\\";\\n \\t\\t return \\\"<x>\\\\n<inp>\\\\nInput\\\\>\\\";});\\n}\\n\",\n \"language\": \"Rascal\"\n },\n {\n \"code\": \"'Input a string: ' print expect as str\\n'Input an integer: ' print expect 0 prefer as num\\n\",\n \"language\": \"Raven\"\n },\n {\n \"code\": \"REBOL [\\n\\tTitle: \\\"Textual User Input\\\"\\n\\tURL: http://rosettacode.org/wiki/User_Input_-_text\\n]\\n\\ns: n: \\\"\\\"\\n\\n; Because I have several things to check for, I've made a function to\\n; handle it. Note the question mark in the function name, this convention\\n; is often used in Forth to indicate test of some sort.\\n\\nvalid?: func [s n][\\n\\terror? try [n: to-integer n] ; Ignore error if conversion fails.\\n\\tall [0 < length? s 75000 = n]]\\n\\n; I don't want to give up until I've gotten something useful, so I\\n; loop until the user enters valid data.\\n\\nwhile [not valid? s n][\\n\\tprint \\\"Please enter a string, and the number 75000:\\\"\\n\\ts: ask \\\"string: \\\"\\n\\tn: ask \\\"number: \\\"\\n]\\n\\n; It always pays to be polite...\\n\\nprint rejoin [ \\\"Thank you. Your string was '\\\" s \\\"'.\\\"]\\n\",\n \"language\": \"REBOL\"\n },\n {\n \"code\": \"n: ask \\\"Please enter # 75000: \\\" str: ask \\\"Please enter any string: \\\"\\n\",\n \"language\": \"Red\"\n },\n {\n \"code\": \":example (\\\"-)\\n 'Enter_a_string:_ s:put s:get s:keep\\n [ 'Enter_75000:_ s:put s:get-word s:to-number nl #75000 eq? ] until\\n 'Your_string_was:_'%s'\\\\n s:format s:put ;\\n\",\n \"language\": \"Retro\"\n },\n {\n \"code\": \"/*REXX program prompts & reads/obtains a string, and also the number 75000 from terminal*/\\nsay 'Please enter a string:' /*issue a prompt message to the term. */\\nparse pull userString /*the (char) string can be any length. */\\n /* [↑] the string could be null/empty.*/\\n do until userNumber=75000 /*repeat this loop until satisfied. */\\n say /*display a blank line to the terminal.*/\\n say 'Please enter the number 75000' /*display a nice prompt message to term*/\\n parse pull userNumber /*obtain the user text from terminal. */\\n end /*until*/ /*check if the response is legitimate. */\\n /*stick a fork in it, we're all done. */\\n\",\n \"language\": \"REXX\"\n },\n {\n \"code\": \"see \\\"Enter a string : \\\" give s\\nsee \\\"Enter an integer : \\\" give i\\nsee \\\"String = \\\" + s + nl\\nsee \\\"Integer = \\\" + i + nl\\n\",\n \"language\": \"Ring\"\n },\n {\n \"code\": \"input string \\\"Enter string:\\\"\\nset \\\"$str\\\" to \\\"input\\\"\\ninput string \\\"Enter number:\\\"\\nset \\\"number\\\" to \\\"input\\\"\\n[ \\\"You entered:\\\"\\n[ \\\"&$str&\\\"\\n[ \\\"&number&\\\"\\nend\\n\",\n \"language\": \"Robotic\"\n },\n {\n \"code\": \"input string \\\"Enter string:\\\"\\nset \\\"$str\\\" to \\\"input\\\"\\n: \\\"incorrect\\\"\\ninput string \\\"Enter number:\\\"\\nset \\\"number\\\" to \\\"input\\\"\\nif \\\"number\\\" != \\\"(75000)\\\" then \\\"incorrect\\\"\\n[ \\\"You entered:\\\"\\n[ \\\"&$str&\\\"\\n[ \\\"&number&\\\"\\nend\\n\",\n \"language\": \"Robotic\"\n },\n {\n \"code\": \"print \\\"Enter a string: \\\"\\ns = gets\\nprintf \\\"Enter an integer: \\\"\\ni = gets.to_i # If string entered, will return zero\\nprintf \\\"Enter a real number: \\\"\\nf = Float(gets) rescue nil # converts a floating point number or returns nil\\nputs \\\"String = #{s}\\\"\\nputs \\\"Integer = #{i}\\\"\\nputs \\\"Float = #{f}\\\"\\n\",\n \"language\": \"Ruby\"\n },\n {\n \"code\": \"input \\\"Please enter a string: \\\"; s$\\nwhile i <> 75000\\n input \\\"Please enter 75000 : \\\"; i\\nwend\\nprint\\nprint s$; chr$(9); i\\n\",\n \"language\": \"Run-BASIC\"\n },\n {\n \"code\": \"use std::io::{self, Write};\\nuse std::fmt::Display;\\nuse std::process;\\n\\nfn main() {\\n let s = grab_input(\\\"Give me a string\\\")\\n .unwrap_or_else(|e| exit_err(&e, e.raw_os_error().unwrap_or(-1)));\\n\\n println!(\\\"You entered: {}\\\", s.trim());\\n\\n let n: i32 = grab_input(\\\"Give me an integer\\\")\\n .unwrap_or_else(|e| exit_err(&e, e.raw_os_error().unwrap_or(-1)))\\n .trim()\\n .parse()\\n .unwrap_or_else(|e| exit_err(&e, 2));\\n\\n println!(\\\"You entered: {}\\\", n);\\n}\\n\\nfn grab_input(msg: &str) -> io::Result<String> {\\n let mut buf = String::new();\\n print!(\\\"{}: \\\", msg);\\n try!(io::stdout().flush());\\n\\n try!(io::stdin().read_line(&mut buf));\\n Ok(buf)\\n}\\n\\nfn exit_err<T: Display>(msg: T, code: i32) -> ! {\\n let _ = writeln!(&mut io::stderr(), \\\"Error: {}\\\", msg);\\n process::exit(code)\\n}\\n\",\n \"language\": \"Rust\"\n },\n {\n \"code\": \"print(\\\"Enter a number: \\\")\\nval i=Console.readLong // Task says to enter 75000\\nprint(\\\"Enter a string: \\\")\\nval s=Console.readLine\\n\",\n \"language\": \"Scala\"\n },\n {\n \"code\": \"(define str (read))\\n(define num (read))\\n(display \\\"String = \\\") (display str)\\n(display \\\"Integer = \\\") (display num)\\n\",\n \"language\": \"Scheme\"\n },\n {\n \"code\": \"$ include \\\"seed7_05.s7i\\\";\\n\\nconst proc: main is func\\n local\\n var integer: integer_input is 0;\\n var string: string_input is \\\"\\\";\\n begin\\n write(\\\"Enter an integer: \\\");\\n readln(integer_input);\\n write(\\\"Enter a string: \\\");\\n readln(string_input);\\n end func;\\n\",\n \"language\": \"Seed7\"\n },\n {\n \"code\": \"var s = read(String);\\nvar i = read(Number); # auto-conversion to a number\\n\",\n \"language\": \"Sidef\"\n },\n {\n \"code\": \"var s = Sys.readln(\\\"Enter a string: \\\");\\nvar i = Sys.readln(\\\"Enter a number: \\\").to_i;\\n\",\n \"language\": \"Sidef\"\n },\n {\n \"code\": \"10 PRINT \\\"ENTER A STRING\\\"\\n20 INPUT S$\\n30 PRINT \\\"YOU ENTERED: \\\";S$\\n40 PRINT \\\"NOW ENTER THE NUMBER 75000\\\"\\n50 INPUT N\\n60 IF N=75000 THEN STOP\\n70 PRINT \\\"NO, \\\";\\n80 GOTO 40\\n\",\n \"language\": \"Sinclair-ZX81-BASIC\"\n },\n {\n \"code\": \"print: (query: 'Enter a String: ').\\n[| n |\\n n: (Integer readFrom: (query: 'Enter an Integer: ')).\\n (n is: Integer)\\n ifTrue: [print: n]\\n ifFalse: [inform: 'Not an integer: ' ; n printString]\\n] do.\\n\",\n \"language\": \"Slate\"\n },\n {\n \"code\": \"'Enter a number: ' display.\\na := stdin nextLine asInteger.\\n\\n'Enter a string: ' display.\\nb := stdin nextLine.\\n\",\n \"language\": \"Smalltalk\"\n },\n {\n \"code\": \"INPUT \\\"Enter a string.\\\":a$\\nINPUT \\\"Enter the value 75000.\\\":n\\n\",\n \"language\": \"Smart-BASIC\"\n },\n {\n \"code\": \" output = \\\"Enter a string:\\\"\\n str = trim(input)\\n output = \\\"Enter an integer:\\\"\\n int = trim(input)\\n output = \\\"String: \\\" str \\\" Integer: \\\" int\\nend\\n\",\n \"language\": \"SNOBOL4\"\n },\n {\n \"code\": \"#!/usr/local/bin/spar\\n\\npragma annotate( summary, \\\"get_string\\\" )\\n @( description, \\\"Input a string and the integer 75000 from the text console.\\\" )\\n @( see_also, \\\"https://rosettacode.org/wiki/User_input/Text\\\" )\\n @( author, \\\"Ken O. Burtch\\\" );\\npragma license( unrestricted );\\n\\npragma restriction( no_external_commands );\\n\\nprocedure get_string is\\n s : unbounded_string;\\n i : integer;\\nbegin\\n s := get_line;\\n i := integer( numerics.value( get_line ) );\\n ? s @ i;\\nexception when others =>\\n put_line( standard_error, \\\"the value is not valid\\\" );\\nend get_string;\\n\",\n \"language\": \"SparForte\"\n },\n {\n \"code\": \"s := get_line;\\ni := numerics.value( get_line );\\n? s @ i;\\n\",\n \"language\": \"SparForte\"\n },\n {\n \"code\": \"text = #.input(\\\"Input a string\\\")\\nnumber = #.val(#.input(\\\"Input a number\\\"))\\n\",\n \"language\": \"SPL\"\n },\n {\n \"code\": \"print \\\"Enter a string: \\\";\\nlet val str = valOf (TextIO.inputLine TextIO.stdIn) in (* note: this keeps the trailing newline *)\\n print \\\"Enter an integer: \\\";\\n let val num = valOf (TextIO.scanStream (Int.scan StringCvt.DEC) TextIO.stdIn) in\\n print (str ^ Int.toString num ^ \\\"\\\\n\\\")\\n end\\nend\\n\",\n \"language\": \"Standard-ML\"\n },\n {\n \"code\": \"print(\\\"Enter a string: \\\", terminator: \\\"\\\")\\nif let str = readLine() {\\n print(str)\\n}\\n\",\n \"language\": \"Swift\"\n },\n {\n \"code\": \"print(\\\"Enter a string: \\\", terminator: \\\"\\\")\\nguard let str = readLine() else {\\n fatalError(\\\"Nothing read!\\\")\\n}\\nprint(str)\\nprint(\\\"Enter a number: \\\", terminator: \\\"\\\")\\nguard let nstr = readLine(), let num = Int(nstr) else {\\n fatalError(\\\"Not a number!\\\")\\n}\\nprint(num)\\n\",\n \"language\": \"Swift\"\n },\n {\n \"code\": \"set str [gets stdin]\\nset num [gets stdin]\\n\",\n \"language\": \"Tcl\"\n },\n {\n \"code\": \"if {![string is integer -strict $num]} then { ...do something here...}\\n\",\n \"language\": \"Tcl\"\n },\n {\n \"code\": \"set input 0\\nwhile {$input != 75000} {\\n puts -nonewline \\\"enter the number '75000': \\\"\\n flush stdout\\n set input [gets stdin]\\n}\\n\",\n \"language\": \"Tcl\"\n },\n {\n \"code\": \"proc question {var message} {\\n upvar 1 $var v\\n puts -nonewline \\\"$message: \\\"\\n flush stdout\\n gets stdin $v\\n}\\nquestion name \\\"What is your name\\\"\\nquestion task \\\"What is your quest\\\"\\nquestion doom \\\"What is the air-speed velocity of an unladen swallow\\\"\\n\",\n \"language\": \"Tcl\"\n },\n {\n \"code\": \" :Input \\\"Enter a string:\\\",Str1\\n :Prompt i\\n :If(i ≠ 75000): Then\\n :Disp \\\"That isn't 75000\\\"\\n :Else\\n :Stop\\n\",\n \"language\": \"TI-83-BASIC\"\n },\n {\n \"code\": \"Prgm\\n InputStr \\\"Enter a string\\\", s\\n Loop\\n Prompt integer\\n If integer ≠ 75000 Then\\n Disp \\\"That wasn't 75000.\\\"\\n Else\\n Exit\\n EndIf\\n EndLoop\\nEndPrgm\\n\",\n \"language\": \"TI-89-BASIC\"\n },\n {\n \"code\": \"needs readline\\n.\\\" Enter a string: \\\" readline is-data the-string\\n.\\\" Enter a number: \\\" readline >number [ .\\\" Not a number!\\\" drop 0 ] ifFalse is-data the-number\\n\\nthe-string type cr\\nthe-number . cr\\n\",\n \"language\": \"Toka\"\n },\n {\n \"code\": \"PRINT \\\"Please enter a string\\\";\\nINPUT s$\\nDO\\n PRINT \\\"Please enter 75000 \\\";\\n INPUT i\\nLOOP Until i = 75000\\nPRINT\\nPRINT s$, i\\nEND\\n\",\n \"language\": \"True-BASIC\"\n },\n {\n \"code\": \"$$ MODE TUSCRIPT\\nLOOP\\nASK \\\"Enter a string\\\": str=\\\"\\\"\\nASK \\\"Enter an integer\\\": int=\\\"\\\"\\nIF (int=='digits') THEN\\nPRINT \\\"int=\\\",int,\\\" str=\\\",str\\nEXIT\\nELSE\\nPRINT/ERROR int,\\\" is not an integer\\\"\\nCYCLE\\nENDIF\\nENDLOOP\\n\",\n \"language\": \"TUSCRIPT\"\n },\n {\n \"code\": \"#!/bin/sh\\n\\nread string\\nread integer\\nread -p 'Enter a number: ' number\\necho \\\"The number is $number\\\"\\n\",\n \"language\": \"UNIX-Shell\"\n },\n {\n \"code\": \"#\\n# user input\\n#\\n\\n# in ursa, the type of data expected must be specified\\ndecl string str\\ndecl int i\\n\\nout \\\"input a string: \\\" console\\nset str (in string console)\\nout \\\"input an int: \\\" console\\nset i (in int console)\\n\\nout \\\"you entered \\\" str \\\" and \\\" i endl console\\n\",\n \"language\": \"Ursa\"\n },\n {\n \"code\": \"import os\\n\\nfn main() {\\n s := os.input('Enter string').int()\\n if s == 75000 {\\n println('good')\\n } else {\\n println('bad')\\n }\\n}\\n\",\n \"language\": \"V-(Vlang)\"\n },\n {\n \"code\": \"import os\\nimport strconv\\n\\nfn main() {\\n s := strconv.atoi(os.input('Enter string')) ?\\n if s == 75000 {\\n println('good')\\n } else {\\n println('bad $s')\\n }\\n}\\n\",\n \"language\": \"V-(Vlang)\"\n },\n {\n \"code\": \"Public Sub text()\\n Debug.Print InputBox(\\\"Input a string\\\")\\n Debug.Print InputBox(\\\"Input the integer 75000\\\", \\\"Input an integer\\\", 75000, Context = \\\"Long\\\")\\nEnd Sub\\n\",\n \"language\": \"VBA\"\n },\n {\n \"code\": \"Get_Input(1, \\\"Enter a string: \\\")\\n#2 = Get_Num(\\\"Enter a number: \\\")\\n\",\n \"language\": \"Vedit-macro-language\"\n },\n {\n \"code\": \"Dim i As Integer\\nConsole.WriteLine(\\\"Enter an Integer\\\")\\ni = Console.ReadLine()\\n\",\n \"language\": \"Visual-Basic-.NET\"\n },\n {\n \"code\": \"Dim i As Integer\\nDim iString As String\\nConsole.WriteLine(\\\"Enter an Integer\\\")\\niString = Console.ReadLine()\\nTry\\n i = Convert.ToInt32(iString)\\nCatch ex As Exception\\n Console.WriteLine(\\\"This is not an Integer\\\")\\nEnd Try\\n\",\n \"language\": \"Visual-Basic-.NET\"\n },\n {\n \"code\": \"Dim i As String\\nConsole.WriteLine(\\\"Enter a String\\\")\\ni = Console.ReadLine()\\n\",\n \"language\": \"Visual-Basic-.NET\"\n },\n {\n \"code\": \"print 1 \\\"Enter a string.\\\"\\ninput string$\\nprint 1 \\\"Enter an integer.\\\"\\ninput integer\\n\",\n \"language\": \"Wee-Basic\"\n },\n {\n \"code\": \"import \\\"io\\\" for Stdin, Stdout\\n\\nvar string\\nwhile (true) {\\n System.write(\\\"Enter a string : \\\")\\n Stdout.flush()\\n string = Stdin.readLine()\\n if (string.count == 0) {\\n System.print(\\\"String cannot be empty, try again.\\\")\\n } else {\\n break\\n }\\n}\\n\\nvar number\\nwhile (true) {\\n System.write(\\\"Enter a number : \\\")\\n Stdout.flush()\\n number = Num.fromString(Stdin.readLine())\\n if (!number || !number.isInteger) {\\n System.print(\\\"Please enter a vaid integer, try again.\\\")\\n } else {\\n break\\n }\\n}\\n\\nSystem.print(\\\"\\\\nYou entered:\\\")\\nSystem.print(\\\" string: %(string)\\\")\\nSystem.print(\\\" number: %(number)\\\")\\n\",\n \"language\": \"Wren\"\n },\n {\n \"code\": \"(display \\\"Enter a string: \\\")\\n(define s (read-line))\\n(display \\\"Yes, \\\")\\n(write s)\\n(display \\\" is a string.\\\") ;; no need to verify, because READ-LINE has to return a string\\n(newline)\\n(display \\\"Now enter the integer 75000: \\\")\\n(define n (read))\\n(display\\n (cond\\n ((not (integerp n))\\n \\\"That's not even an integer.\\\" )\\n ((/= n 75000)\\n \\\"That is not the integer 75000.\\\" )\\n (t\\n \\\"Yes, that is the integer 75000.\\\" ) ) )\\n\",\n \"language\": \"XLISP\"\n },\n {\n \"code\": \"string 0; \\\\use zero-terminated strings, instead of MSb terminated\\ninclude c:\\\\cxpl\\\\codes;\\nint I;\\nchar Name(128); \\\\the keyboard buffer limits input to 128 characters\\n\\n[Text(0, \\\"What's your name? \\\");\\nI:= 0;\\nloop [Name(I):= ChIn(0); \\\\buffered keyboard input\\n if Name(I) = $0D\\\\CR\\\\ then quit; \\\\Carriage Return = Enter key\\n I:= I+1;\\n ];\\nName(I):= 0; \\\\terminate string\\nText(0, \\\"Howdy \\\"); Text(0, Name); Text(0, \\\"! Now please enter ^\\\"75000^\\\": \\\");\\nIntOut(0, IntIn(0)); CrLf(0); \\\\echo the number\\n]\\n\",\n \"language\": \"XPL0\"\n },\n {\n \"code\": \"input \\\"Please enter a string: \\\" s$\\nrepeat\\n input \\\"Please enter 75000 : \\\" i\\nuntil i = 75000\\nprint\\nprint s$, chr$(9), i\\n\",\n \"language\": \"Yabasic\"\n },\n {\n \"code\": \"str:=ask(\\\"Gimmie a string: \\\");\\nn:=ask(\\\"Type 75000: \\\").toInt();\\n\",\n \"language\": \"Zkl\"\n },\n {\n \"code\": \"10 INPUT \\\"Enter a string:\\\"; s$\\n20 INPUT \\\"Enter a number: \\\"; n\\n\",\n \"language\": \"ZX-Spectrum-Basic\"\n }\n]","isConversational":false},"task_name":{"kind":"string","value":"User-input-Text"}}},{"rowIdx":1793,"cells":{"solutions":{"kind":"list like","value":[{"code":"---\nfrom: http://rosettacode.org/wiki/Validate_International_Securities_Identification_Number\n","language":"00-META"},{"code":"An [[wp:International_Securities_Identification_Number|International Securities Identification Number]] (ISIN) is a unique international identifier for a financial security such as a stock or bond. \n\n\n;Task:\nWrite a function or program that takes a string as input, and checks whether it is a valid ISIN.\n\nIt is only valid if it has the correct format, ''and'' the embedded checksum is correct.\n\nDemonstrate that your code passes the test-cases listed below.\n\n\n;Details:\nThe format of an ISIN is as follows:\n\n<!-- BEGIN DIAGRAM -->\n<div style=\"margin:3em; white-space:nowrap; line-height:20px\">\n<div><span style=\"font-size:20px; font-family:'Lucida Console',Monaco,monospace\"><span style=\"color:green; margin:0 0 0 10px\">┌───────────── </span></span><span style=\"color:green\">a 2-character ISO country code (A-Z)</span></div>\n<div><span style=\"font-size:20px; font-family:'Lucida Console',Monaco,monospace\"><span style=\"color:green; margin:0 -10px 0 10px\">│</span> <span style=\"color:blue; margin:0 0 0 10px\">┌─────────── </span></span><span style=\"color:blue\">a 9-character security code (A-Z, 0-9)</span></div>\n<div><span style=\"font-size:20px; font-family:'Lucida Console',Monaco,monospace\"><span style=\"color:green; margin:0 -10px 0 10px\">│</span> <span style=\"color:blue; margin:0 -5px 0 10px\">│</span> <span style=\"color:red; margin:0 0 0 5px\">┌── </span></span><span style=\"color:red\">a checksum digit (0-9)</span></div>\n<div style=\"font-size:20px; font-family:'Lucida Console',Monaco,monospace\"><span style=\"background: #d9ebd9; color:green; border:solid 1px green; margin:0 1px\">AU</span><span style=\"background:#e0e0ff; color:blue; border:solid 1px blue; margin:0 1px\">0000XVGZA</span><span style=\"background:#feefef; color:red; border:solid 1px red; margin:0 1px\">3</span></div>\n</div>\n<!-- END DIAGRAM -->\n\n\nFor this task, you may assume that any 2-character alphabetic sequence is a valid country code.\n\nThe checksum can be validated as follows:\n# '''Replace letters with digits''', by converting each character from base 36 to base 10, e.g. <code>AU0000XVGZA3</code> →<code>1030000033311635103</code>.\n# '''Perform the Luhn test on this base-10 number.'''<br>There is a separate task for this test: ''[[Luhn test of credit card numbers]]''.<br>You don't have to replicate the implementation of this test here ─── you can just call the existing function from that task. (Add a comment stating if you did this.)\n\n\n;Test cases:\n:::: {| class=\"wikitable\"\n! ISIN\n! Validity\n! Comment\n|-\n| <tt>US0378331005</tt> || valid || \n|-\n| <tt>US0373831005</tt> || not valid || The transposition typo is caught by the checksum constraint.\n|-\n| <tt>U50378331005</tt> || not valid || The substitution typo is caught by the format constraint.\n|-\n| <tt>US03378331005</tt> || not valid || The duplication typo is caught by the format constraint.\n|-\n| <tt>AU0000XVGZA3</tt> || valid || \n|-\n| <tt>AU0000VXGZA3</tt> || valid || Unfortunately, not ''all'' transposition typos are caught by the checksum constraint.\n|-\n| <tt>FR0000988040</tt> || valid || \n|}\n\n(The comments are just informational. Your function should simply return a Boolean result. See [[#Raku]] for a reference solution.)\n\n\nRelated task:\n* [[Luhn test of credit card numbers]]\n\n\n;Also see:\n* [https://www.isincodes.net/validate-isin/ Interactive online ISIN validator]\n* Wikipedia article: [[wp:International_Securities_Identification_Number|International Securities Identification Number]]\n<br><br>\n\n","language":"00-TASK"},{"code":"F check_isin(a)\n I a.len != 12\n R 0B\n [Int] s\n L(c) a\n I c.is_digit()\n I L.index < 2\n R 0B\n s.append(c.code - 48)\n E I c.is_uppercase()\n I L.index == 11\n R 0B\n V (d, m) = divmod(c.code - 55, 10)\n s [+]= [d, m]\n E\n R 0B\n V v = sum(s[((len)-1..).step(-2)])\n L(=k) s[((len)-2..).step(-2)]\n k = 2 * k\n v += I k > 9 {k - 9} E k\n R v % 10 == 0\n\nprint([‘US0378331005’, ‘US0373831005’, ‘U50378331005’, ‘US03378331005’,\n ‘AU0000XVGZA3’, ‘AU0000VXGZA3’, ‘FR0000988040’].map(s -> check_isin(s)))\n","language":"11l"},{"code":"* Validate ISIN 08/03/2019\nVALISIN CSECT\n USING VALISIN,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 R7,1 j=1\n DO WHILE=(C,R7,LE,=A(NN)) do j=1 to hbound(tt)\n LR R1,R7 j\n SLA R1,4 ~\n LA R4,TT-16(R1) @tt(j)\n MVC CC,0(R4) cc=tt(j)\n MVC C,=CL28' ' c=' '\n MVC R,=CL28' ' r=' '\n MVI ERR,X'00' err=false\n MVC LCC,=F'0' lcc=0\n LA R1,L'CC i=length(cc)\nLENTRIA LA R5,CC-1 @cc\n AR R5,R1 +i\n CLI 0(R5),C' ' if cc[i]=' '\n BE LENTRIB then iterate loop\n ST R1,LCC lcc=lentrim(cc)\n B LENTRIC leave loop\nLENTRIB BCT R1,LENTRIA i--; if i<>0 then loop\nLENTRIC L R4,LCC lcc\n IF CH,R4,EQ,=H'12' THEN if lcc=12 then\n MVC LC,=F'0' lc=0\n MVC WW,=CL28' ' ww=''\n LA R10,WW @ww\n LA R6,1 i=1\n DO WHILE=(C,R6,LE,LCC) do i=1 to lcc\n LA R4,CC-1 @cc\n AR R4,R6 +i\n MVC CI(1),0(R4) ci=substr(cc,i,1)\n LA R2,BASE36 @base36\n LA R3,L'BASE36 length(base36)\n BAL R14,INDEX r0=index(base36,ci)\n IF LTR,R0,NZ,R0 THEN if p<>0 then\n LR R1,R0 ip\n BCTR R1,0 -1\n XDECO R1,XDEC str(ip-1)\n MVC 0(2,R10),XDEC+10 ww=ww||str(p-1)\n ELSE , else\n MVI ERR,X'FF' err=true\n ENDIF , endif\n LA R10,2(R10) @ww+=2\n LA R6,1(R6) i++\n ENDDO , enddo i\n MVC C,=CL28' ' c=''\n LA R8,WW @ww\n LA R9,C @c\n LA R10,0 length(c)\n LA R6,1 i=1\n DO WHILE=(C,R6,LE,=A(L'WW)) do i=1 to length(ww)\n IF CLI,0(R8),NE,C' ' THEN if ww[i]<>' ' then\n MVC 0(1,R9),0(R8) c=ww[i]\n LA R9,1(R9) @c++\n LA R10,1(R10) length(c)++\n ENDIF , endif\n LA R8,1(R8) @ww++\n LA R6,1(R6) i++\n ENDDO , enddo i\n ST R10,LC lc=length(c)\n LA R6,1 i=1\n DO WHILE=(CH,R6,LE,=H'2') do i=1 to 2\n LA R4,CC-1 @cc\n AR R4,R6 +i\n MVC CI(1),0(R4) ci=substr(cc,i,1)\n LA R2,ALPHA @alpha\n LA R3,L'ALPHA length(alpha)\n BAL R14,INDEX r0=index(alpha,ci)\n IF LTR,R0,Z,R0 THEN if index(alpha,ci)=0 then\n MVI ERR,X'FF' err=true\n ENDIF , endif\n LA R6,1(R6) i++\n ENDDO , enddo i\n SR R8,R8 i1=0\n SR R9,R9 i2=0\n IF CLI,ERR,EQ,X'00' THEN if not err then\n SR R0,R0 0\n L R6,LC i=lc\n MVC R,=CL28' ' r=''\n LA R10,C @c\n LA R11,R-1 @r\n A R11,LC @r=@r+length(strip((c))\n DO WHILE=(CH,R6,GE,=H'1') do i=lc to 1 step -1\n MVC 0(1,R11),0(R10) r[k]=c[i]\n BCTR R11,0 @r--\n LA R10,1(R10) @c++\n BCTR R6,0 i--\n ENDDO , enddo i\n LA R6,1 i=1\n DO WHILE=(C,R6,LE,LC) do i=1 to lc step 2\n LA R4,R-1 @r\n AR R4,R6 +i\n MVC CI(1),0(R4) ci=substr(r,i,1)\n MVC XDEC,=CL12' ' ~\n MVC XDEC(L'CI),CI ci\n XDECI R2,XDEC int(ci)\n AR R8,R2 i1=i1+int(ci)\n LA R6,2(R6) i+=2\n ENDDO , enddo i\n LA R6,2 i=2\n DO WHILE=(C,R6,LE,LC) do i=2 to lc step 2\n LA R4,R-1 @r\n AR R4,R6 +i\n MVC CI(1),0(R4) ci=substr(r,i,1)\n MVC XDEC,=CL12' ' ~\n MVC XDEC(L'CI),CI ci\n XDECI R10,XDEC int(ci)\n SLA R10,1 ii=int(ci)*2\n IF CH,R10,GE,=H'10' THEN if ii>=10 then\n SH R10,=H'9' ii=ii-9\n ENDIF , endif\n AR R9,R10 i2=i2+ii\n LA R6,2(R6) i++\n ENDDO , enddo i\n LR R2,R8 i1\n AR R2,R9 +i2\n XDECO R2,XDEC s=str(i1+i2)\n IF CLI,XDEC+11,EQ,C'0' THEN if substr(s,length(s),1)='0' then\n MVC MSG,=CL6'OK' msg='ok'\n ELSE , else\n MVC MSG,=CL6'?err1' msg='?1'\n ENDIF , endif\n ELSE , else\n MVC MSG,=CL6'?err2' msg='?2'\n ENDIF , endif\n ELSE , else\n MVC MSG,=CL6'?err3' msg='?3'\n ENDIF , endif\n XDECO R7,XDEC edit j\n MVC PG(2),XDEC+10 j\n MVC PG+3(16),CC cc\n MVC PG+20(6),MSG msg\n XPRNT PG,L'PG print buffer\n LA R7,1(R7) j++\n ENDDO , enddo j\n L R13,4(0,R13) restore previous savearea pointer\n RETURN (14,12),RC=0 restore registers from calling sav\nMVCX MVC 0(0,R4),0(R5) pattern svc\nINDEX SR R0,R0 index(r2,ci) r3=len\n LA R1,1 k=1\nSINDEXA CR R1,R3 do k=1 to length(ca)\n BH SINDEXC ~\n CLC 0(1,R2),CI if ca[k]=ci\n BNE SINDEXB then iterate loop\n LR R0,R1 ii=k\n B SINDEXC exit loop\nSINDEXB LA R2,1(R2) @ca++\n LA R1,1(R1) k++\n B SINDEXA enddo\nSINDEXC BR R14 end index\nNN EQU (BASE36-TT)/16 number of items\nTT DC CL16'US0378331005',CL16'US0373831005'\n DC CL16'U50378331005',CL16'US03378331005'\n DC CL16'AU0000XVGZA3',CL16'AU0000VXGZA3'\n DC CL16'FR0000988040'\nBASE36 DC CL36'0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZ'\nALPHA DC CL26'ABCDEFGHIJKLMNOPQRSTUVWXYZ'\nERR DS X error\nLCC DS F length of cc\nLC DS F length of c\nCI DS CL1\nCC DS CL16 current element of tt\nC DS CL28\nR DS CL28\nWW DS CL28\nMSG DS CL6 message\nPG DC CL80' ' buffer\nXDEC DS CL12 temp for xdeco and xdeci\n REGEQU\n END VALISIN\n","language":"360-Assembly"},{"code":"procedure ISIN is\n -- Luhn_Test copied from other Task\n function Luhn_Test (Number: String) return Boolean is\n Sum : Natural := 0;\n Odd : Boolean := True;\n Digit: Natural range 0 .. 9;\n begin\n for p in reverse Number'Range loop\n Digit := Integer'Value (Number (p..p));\n if Odd then\n Sum := Sum + Digit;\n else\n Sum := Sum + (Digit*2 mod 10) + (Digit / 5);\n end if;\n Odd := not Odd;\n end loop;\n return (Sum mod 10) = 0;\n end Luhn_Test;\n\n subtype Decimal is Character range '0' .. '9';\n subtype Letter is Character range 'A' .. 'Z';\n subtype ISIN_Type is String(1..12);\n\n -- converts a string of decimals and letters into a string of decimals\n function To_Digits(S: String) return String is\n -- Character'Pos('A')-Offset=10, Character'Pos('B')-Offset=11, ...\n Offset: constant Integer := Character'Pos('A')-10;\n\n Invalid_Character: exception;\n begin\n if S = \"\" then\n return \"\";\n elsif S(S'First) = ' ' then -- skip blanks\n return To_Digits(S(S'First+1 .. S'Last));\n elsif S(S'First) in Decimal then\n return S(S'First) & To_Digits(S(S'First+1 .. S'Last));\n elsif S(S'First) in Letter then\n return To_Digits(Integer'Image(Character'Pos(S(S'First))-Offset))\n & To_Digits(S(S'First+1 .. S'Last));\n else\n raise Invalid_Character;\n end if;\n end To_Digits;\n\n function Is_Valid_ISIN(S: ISIN_Type) return Boolean is\n Number : String := To_Digits(S);\n begin\n return S(S'First) in Letter and\n S(S'First+1) in Letter and\n S(S'Last) in Decimal and\n Luhn_Test(Number);\n end Is_Valid_ISIN;\n\n Test_Cases : constant Array(1..6) of ISIN_Type :=\n (\"US0378331005\",\n \"US0373831005\",\n \"U50378331005\",\n -- excluded by type with fixed length\n -- \"US03378331005\",\n \"AU0000XVGZA3\",\n \"AU0000VXGZA3\",\n \"FR0000988040\");\nbegin\n for I in Test_Cases'Range loop\n Ada.Text_IO.Put_Line(Test_Cases(I) & \":\" &\n Boolean'Image(Is_Valid_ISIN(Test_Cases(I))));\n end loop;\n -- using wrong length will result in an exception:\n Ada.Text_IO.Put(\"US03378331005:\");\n Ada.Text_IO.Put_Line(Boolean'Image(Is_Valid_Isin(\"US03378331005\")));\nexception\n when others =>\n Ada.Text_IO.Put_Line(\"Exception occured\");\nend ISIN;\n","language":"Ada"},{"code":"begin\n % external procedure that returns true if ccNumber passes the Luhn test, false otherwise %\n logical procedure LuhnTest ( string(32) value ccNumber\n ; integer value ccLength\n ) ; algol \"LUHN\" ;\n\n % returns true if isin is a valid ISIN, false otherwise %\n logical procedure isIsin ( string(32) value isin ) ;\n if isin( 12 // 20 ) not = \"\" then false % code is too long %\n else begin\n % the first two characters must be upper-case letters %\n\n % returns the digit corresponding to a character of an ISIN %\n integer procedure isinDigit ( string(1) value iChar ) ;\n if iChar >= \"0\" and iChar <= \"9\" then ( decode( iChar ) - decode( \"0\" ) )\n else if iChar >= \"A\" and iChar <= \"Z\" then ( decode( iChar ) - decode( \"A\" ) ) + 10\n else begin % invalid digit %\n isValid := false;\n -1\n end isinDigit ;\n\n integer d1, d2;\n logical isValid;\n isValid := true;\n d1 := isinDigit( isin( 0 // 1 ) );\n d2 := isinDigit( isin( 1 // 1 ) );\n if d1 < 10 or d1 > 35 or d2 < 10 or d2 > 35 then false % invalid first two characters %\n else begin\n % ok so far - conveet from base 36 to base 10 %\n string(24) base10Isin;\n integer b10Pos;\n base10Isin := \"\";\n b10Pos := 0;\n for cPos := 0 until 10 do begin\n integer digit;\n digit := isinDigit( isin( cPos // 1 ) );\n if isValid then begin\n % valid digit %\n if digit > 9 then begin\n base10Isin( b10Pos // 1 ) := code( ( digit div 10 ) + decode( \"0\" ) );\n b10Pos := b10Pos + 1;\n end if_digit_gt_9 ;\n base10Isin( b10Pos // 1 ) := code( ( digit rem 10 ) + decode( \"0\" ) );\n b10Pos := b10Pos + 1\n end if_isValid\n end for_cPos ;\n % add the check digit as is %\n base10Isin( b10Pos // 1 ) := isin( 11 // 1 );\n isValid and LuhnTest( base10Isin, b10Pos + 1 )\n end\n end isIsin ;\n\n % task test cases %\n\n procedure testIsIsin ( string(32) value isin\n ; logical value expected\n ) ;\n begin\n logical isValid;\n isValid := isIsin( isin );\n write( s_w := 0\n , isin\n , if isValid then \" is valid\" else \" is invalid\"\n , if isValid = expected then \"\" else \" NOT as expected ??\"\n )\n end testIsin ;\n\n testIsIsin( \"US0378331005\", true );\n testIsIsin( \"US0373831005\",\t false );\n testIsIsin( \"U50378331005\", false );\n testIsIsin( \"US03378331005\", false );\n testIsIsin( \"AU0000XVGZA3\",\t true );\n testIsIsin( \"AU0000VXGZA3\",\t true );\n testIsIsin( \"FR0000988040\",\t true );\nend.\n","language":"ALGOL-W"},{"code":"use AppleScript version \"2.4\" -- OS X 10.10 (Yosemite) or later\nuse framework \"Foundation\"\n\non ISINTest(ISIN)\n -- Check that the input is both text and 12 characters long …\n if not ((ISIN's class is text) and ((count ISIN) is 12)) then return false\n -- … and that it has the required format.\n set ISIN to current application's class \"NSMutableString\"'s stringWithString:(ISIN)\n if ((ISIN's rangeOfString:(\"^[A-Z]{2}[0-9A-Z]{9}[0-9]$\") options:(current application's NSRegularExpressionSearch) range:({0, ISIN's |length|()}))'s |length|() is 0) then return false\n -- Replace all letters with text representations of equivalent decimal numbers in the range 10 to 35.\n set letterCharacters to characters of \"ABCDEFGHIJKLMNOPQRSTUVWXYZ\"\n repeat with i from 1 to 26\n tell ISIN to replaceOccurrencesOfString:(item i of letterCharacters) withString:((i + 9) as text) options:(0) range:({0, its |length|()})\n end repeat\n\n -- Apply the Luhn test handler from the \"Luhn test of credit card numbers\" task.\n -- <https://www.rosettacode.org/wiki/Luhn_test_of_credit_card_numbers#Straightforward>\n return luhnTest(ISIN as text)\nend ISINTest\n\n-- Test code:\nset testResults to {}\nrepeat with ISIN in {\"US0378331005\", \"US0373831005\", \"U50378331005\", \"US03378331005\", \"AU0000XVGZA3\", \"AU0000VXGZA3\", \"FR0000988040\"}\n set end of testResults to {testNumber:ISIN's contents, valid:ISINTest(ISIN)}\nend repeat\nreturn testResults\n","language":"AppleScript"},{"code":"{{testNumber:\"US0378331005\", valid:true}, {testNumber:\"US0373831005\", valid:false}, {testNumber:\"U50378331005\", valid:false}, {testNumber:\"US03378331005\", valid:false}, {testNumber:\"AU0000XVGZA3\", valid:true}, {testNumber:\"AU0000VXGZA3\", valid:true}, {testNumber:\"FR0000988040\", valid:true}}\n","language":"AppleScript"},{"code":"# syntax: GAWK -f VALIDATE_INTERNATIONAL_SECURITIES_IDENTIFICATION_NUMBER.AWK\n# converted from Fortran\nBEGIN {\n for (i=0; i<=255; i++) { ord_arr[sprintf(\"%c\",i)] = i } # build array[character]=ordinal_value\n n = split(\"US0378331005,US0373831005,U50378331005,US03378331005,AU0000XVGZA3,AU0000VXGZA3,FR0000988040\",arr,\",\")\n for (i=1; i<=n; i++) {\n printf(\"%s %s\\n\",is_isin(arr[i]),arr[i])\n }\n exit(0)\n}\nfunction is_isin(arg, i,j,k,s,v) {\n for (i=1; i<=12; i++) { # convert to an array of digits\n k = ord_arr[substr(arg,i,1)]\n if (k >= 48 && k <= 57) {\n if (i < 3) { return(0) }\n k -= 48\n s[++j] = k\n } else if (k >= 65 && k <= 90) {\n if (i == 12) { return(0) }\n k = k - 65 + 10\n s[++j] = int(k / 10)\n s[++j] = k % 10\n } else {\n return(0)\n }\n }\n for (i=j-1; i>=1; i-=2) { # compute checksum\n k = 2 * s[i]\n if (k > 9) { k -= 9 }\n v += k\n }\n for (i=j; i>=1; i-=2) {\n v += s[i]\n }\n return(v % 10 == 0)\n}\n","language":"AWK"},{"code":"array base 1\n\ndim test_set$(7)\ntest_set$ = {\"US0378331005\", \"US0373831005\", \"U50378331005\", \"US03378331005\", \"AU0000XVGZA3\", \"AU0000VXGZA3\", \"FR0000988040\"}\n\nfor i = 1 to test_set$[?]\n\ttest_str$ = \"\"\n\tl = length(test_set$[i])\n\tif l <> 12 then\n\t\tprint test_set$[i]; \" Invalid, length <> 12 char.\"\n\t\tcontinue for\n\tend if\n\tif asc(mid(test_set$[i], 1, 1)) < asc(\"A\") or asc(mid(test_set$[i], 2, 1)) < asc(\"A\") then\n\t\tprint test_set$[i]; \" Invalid, number needs to start with 2 characters\"\n\t\tcontinue for\n\tend if\n\tfor n = 1 to l\n\t\tx = asc(mid(test_set$[i], n, 1)) - asc(\"0\")\n\t\tif x > 9 then x -= 7\n\t\tif x < 10 then\n\t\t\ttest_str$ += string(x)\n\t\telse # two digest number\n\t\t\ttest_str$ += string(x \\ 10) + string(x mod 10)\n\t\tend if\n\tnext\n\tprint test_set$[i]; \" \";\n\tif luhntest(test_str$) = 1 then\n\t\tprint \"Invalid, checksum error\"\n\telse\n\t\tprint \"Valid\"\n\tend if\nnext\nend\n\nfunction luhntest(cardnr$)\n\tcardnr$ = trim(cardnr$) # remove spaces\n\tl = length(cardnr$)\n\ts1 = 0\n\ts2 = 0\n\n\t# sum odd numbers\n\tfor i = 1 to l step 2\n\t\ts1 += fromradix(asc(mid(cardnr$, i, 1)), 10)\n\tnext\n\t# sum even numbers\n\tfor i = 2 to l step 2\n\t\tj = fromradix(asc(mid(cardnr$, i, 1)), 10)\n\t\tj *= 2\n\t\tif j > 9 then j = (j mod 10) + 1\n\t\ts2 += j\n\tnext\n\n\treturn (s1 + s2) mod 10 = 0\nend function\n","language":"BASIC256"},{"code":":import luhn_test_of_credit_card_numbers .\n\n:import std/Number/Conversion .\n:import std/Combinator .\n:import std/String .\n:import std/Char .\n:import std/Logic .\n:import std/Number .\n\n# verifies ISIN format\nformat? [len ⋀? country ⋀? security ⋀? checksum]\n\tlen (length 0) =? (+12)\n\tcountry all? uppercase? (take (+2) 0)\n\tsecurity all? (φ or? uppercase? numeric?) (take (+9) (drop (+2) 0))\n\tchecksum numeric? _0\n\n# performs luhn test\nchecksum? (map (from-base36 → number→string)) → concat → string→number → luhn\n\tfrom-base36 binary→ternary → [(0 - (0 ≥? (+65) ((+65) - (+10)) (+48)))]\n\n# performs format and checksum test\nvalidate φ and? format? checksum?\n\n:test (validate \"US0378331005\") (true)\n:test (validate \"US0373831005\") (false)\n:test (validate \"U50378331005\") (false)\n:test (validate \"US03378331005\") (false)\n:test (validate \"AU0000XVGZA3\") (true)\n:test (validate \"AU0000VXGZA3\") (true)\n:test (validate \"FR0000988040\") (true)\n","language":"Bruijn"},{"code":"#include <stdio.h>\n\nint check_isin(char *a) {\n int i, j, k, v, s[24];\n\n j = 0;\n for(i = 0; i < 12; i++) {\n k = a[i];\n if(k >= '0' && k <= '9') {\n if(i < 2) return 0;\n s[j++] = k - '0';\n } else if(k >= 'A' && k <= 'Z') {\n if(i == 11) return 0;\n k -= 'A' - 10;\n s[j++] = k / 10;\n s[j++] = k % 10;\n } else {\n return 0;\n }\n }\n\n if(a[i]) return 0;\n\n v = 0;\n for(i = j - 2; i >= 0; i -= 2) {\n k = 2 * s[i];\n v += k > 9 ? k - 9 : k;\n }\n\n for(i = j - 1; i >= 0; i -= 2) {\n v += s[i];\n }\n\n return v % 10 == 0;\n}\n\nint main() {\n char *test[7] = {\"US0378331005\", \"US0373831005\", \"U50378331005\",\n \"US03378331005\", \"AU0000XVGZA3\", \"AU0000VXGZA3\",\n \"FR0000988040\"};\n int i;\n for(i = 0; i < 7; i++) printf(\"%c%c\", check_isin(test[i]) ? 'T' : 'F', i == 6 ? '\\n' : ' ');\n return 0;\n}\n\n/* will print: T F F F T T T */\n","language":"C"},{"code":"#include <string>\n#include <regex>\n#include <algorithm>\n#include <numeric>\n#include <sstream>\n\nbool CheckFormat(const std::string& isin)\n{\n\tstd::regex isinRegEpx(R\"([A-Z]{2}[A-Z0-9]{9}[0-9])\");\n\tstd::smatch match;\n\treturn std::regex_match(isin, match, isinRegEpx);\n}\n\nstd::string CodeISIN(const std::string& isin)\n{\n\tstd::string coded;\n\tint offset = 'A' - 10;\n\tfor (auto ch : isin)\n\t{\n\t\tif (ch >= 'A' && ch <= 'Z')\n\t\t{\n\t\t\tstd::stringstream ss;\n\t\t\tss << static_cast<int>(ch) - offset;\n\t\t\tcoded += ss.str();\n\t\t}\n\t\telse\n\t\t{\n\t\t\tcoded.push_back(ch);\n\t\t}\n\t}\n\n\treturn std::move(coded);\n}\n\nbool CkeckISIN(const std::string& isin)\n{\n\tif (!CheckFormat(isin))\n\t\treturn false;\n\n\tstd::string coded = CodeISIN(isin);\n// from http://rosettacode.org/wiki/Luhn_test_of_credit_card_numbers#C.2B.2B11\n\treturn luhn(coded);\n}\n\n\n#include <iomanip>\n#include <iostream>\n\nint main()\n{\n\tstd::string isins[] = { \"US0378331005\", \"US0373831005\", \"U50378331005\",\n\t\t\t\t\t\t\t\"US03378331005\", \"AU0000XVGZA3\", \"AU0000VXGZA3\",\n\t\t\t\t\t\t\t\"FR0000988040\" };\n\tfor (const auto& isin : isins)\n\t{\n\t\tstd::cout << isin << std::boolalpha << \" - \" << CkeckISIN(isin) <<std::endl;\n\t}\n\treturn 0;\n}\n","language":"C++"},{"code":"using System;\nusing System.Linq;\nusing System.Text.RegularExpressions;\n\nnamespace ValidateIsin\n{\n public static class IsinValidator\n {\n public static bool IsValidIsin(string isin) =>\n IsinRegex.IsMatch(isin) && LuhnTest(Digitize(isin));\n\n private static readonly Regex IsinRegex =\n new Regex(\"^[A-Z]{2}[A-Z0-9]{9}\\\\d$\", RegexOptions.Compiled);\n\n private static string Digitize(string isin) =>\n string.Join(\"\", isin.Select(c => $\"{DigitValue(c)}\"));\n\n private static bool LuhnTest(string number) =>\n number.Reverse().Select(DigitValue).Select(Summand).Sum() % 10 == 0;\n\n private static int Summand(int digit, int i) =>\n digit + (i % 2) * (digit - digit / 5 * 9);\n\n private static int DigitValue(char c) =>\n c >= '0' && c <= '9'\n ? c - '0'\n : c - 'A' + 10;\n }\n\t\n public class Program\n {\n public static void Main()\n {\n string[] isins =\n {\n \"US0378331005\",\n \"US0373831005\",\n \"U50378331005\",\n \"US03378331005\",\n \"AU0000XVGZA3\",\n \"AU0000VXGZA3\",\n \"FR0000988040\"\n };\n\n foreach (string isin in isins) {\n string validOrNot = IsinValidator.IsValidIsin(isin) ? \"valid\" : \"not valid\";\n Console.WriteLine($\"{isin} is {validOrNot}\");\n }\n }\n }\n}\n","language":"C-sharp"},{"code":"(defn luhn? [cc]\n (let [sum (->> cc\n (map #(Character/digit ^char % 10))\n reverse\n (map * (cycle [1 2]))\n (map #(+ (quot % 10) (mod % 10)))\n (reduce +))]\n (zero? (mod sum 10))))\n\n(defn is-valid-isin? [isin]\n (and (re-matches #\"^[A-Z]{2}[A-Z0-9]{9}[0-9]$\" isin)\n (->> isin\n (map #(Character/digit ^char % 36))\n (apply str)\n luhn?)))\n\n(use 'clojure.pprint)\n(doseq [isin [\"US0378331005\" \"US0373831005\" \"U50378331005\" \"US03378331005\"\n \"AU0000XVGZA3\" \"AU0000VXGZA3\" \"FR0000988040\"]]\n (cl-format *out* \"~A: ~:[invalid~;valid~]~%\" isin (is-valid-isin? isin)))\n","language":"Clojure"},{"code":" >>SOURCE FORMAT FREE\n*> this is gnucobol 2.0\nidentification division.\nprogram-id. callISINtest.\ndata division.\nworking-storage section.\n01 ISINtest-result binary-int.\nprocedure division.\nstart-callISINtest.\n display 'should be valid ' with no advancing\n call 'ISINtest' using 'US0378331005' ISINtest-result\n perform display-ISINtest-result\n display 'should not be valid ' with no advancing\n call 'ISINtest' using 'US0373831005' ISINtest-result\n perform display-ISINtest-result\n display 'should not be valid ' with no advancing\n call 'ISINtest' using 'U50378331005' ISINtest-result\n perform display-ISINtest-result\n display 'should not be valid ' with no advancing\n call 'ISINtest' using 'US03378331005' ISINtest-result\n perform display-ISINtest-result\n display 'should be valid ' with no advancing\n call 'ISINtest' using 'AU0000XVGZA3' ISINtest-result\n perform display-ISINtest-result\n display 'should be valid ' with no advancing\n call 'ISINtest' using 'AU0000VXGZA3' ISINtest-result\n perform display-ISINtest-result\n display 'should be valid ' with no advancing\n call 'ISINtest' using 'FR0000988040' ISINtest-result\n perform display-ISINtest-result\n stop run\n .\ndisplay-ISINtest-result.\n evaluate ISINtest-result\n when 0\n display ' is valid'\n when -1\n display ' invalid length '\n when -2\n display ' invalid countrycode '\n when -3\n display ' invalid base36 digit '\n when -4\n display ' luhn test failed'\n when other\n display ' invalid return code ' ISINtest-result\n end-evaluate\n .\nend program callISINtest.\n\nidentification division.\nprogram-id. ISINtest.\ndata division.\nworking-storage section.\n01 country-code-values value\n 'ADAEAFAGAIALAMAOAQARASATAUAWAXAZBABBBDBEBFBGBHBIBJBLBMBNBOBQBRBS'\n& 'BTBVBWBYBZCACCCDCFCGCHCICKCLCMCNCOCRCUCVCWCXCYCZDEDJDKDMDODZECEE'\n& 'EGEHERESETFIFJFKFMFOFRGAGBGDGEGFGGGHGIGLGMGNGPGQGRGSGTGUGWGYHKHM'\n& 'HNHRHTHUIDIEILIMINIOIQIRISITJEJMJOJPKEKGKHKIKMKNKPKRKWKYKZLALBLC'\n& 'LILKLRLSLTLULVLYMAMCMDMEMFMGMHMKMLMMMNMOMPMQMRMSMTMUMVMWMXMYMZNA'\n& 'NCNENFNGNINLNONPNRNUNZOMPAPEPFPGPHPKPLPMPNPRPSPTPWPYQARERORSRURW'\n& 'SASBSCSDSESGSHSISJSKSLSMSNSOSRSSSTSVSXSYSZTCTDTFTGTHTJTKTLTMTNTO'\n& 'TRTTTVTWTZUAUGUMUSUYUZVAVCVEVGVIVNVUWFWSYEYTZAZMZW'.\n 03 country-codes occurs 249\n ascending key country-code\n indexed by cc-idx.\n 05 country-code pic xx.\n\n01 b pic 99.\n01 base36-digits pic x(36) value\n '0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZ'.\n\n01 i pic 99.\n01 p pic 99.\n01 luhn-number pic x(20).\n01 luhntest-result binary-int.\n\nlinkage section.\n01 test-number any length.\n01 ISINtest-result binary-int.\n\nprocedure division using test-number ISINtest-result.\nstart-ISINtest.\n display space test-number with no advancing\n\n *> format test\n if function length(test-number) <> 12\n move -1 to ISINtest-result\n goback\n end-if\n\n *> countrycode test\n search all country-codes\n at end\n move -2 to ISINtest-result\n goback\n when test-number(1:2) = country-code(cc-idx)\n continue\n end-search\n\n *> convert each character from base 36 to base 10\n *> and add to the luhn-number\n move 0 to p\n perform varying i from 1 by 1 until i > 12\n if test-number(i:1) >= '0' and <= '9'\n move test-number(i:1) to luhn-number(p + 1:1)\n add 1 to p\n else\n perform varying b from 9 by 1 until b > 35\n or base36-digits(b + 1:1) = test-number(i:1)\n continue\n end-perform\n if b > 35\n move -3 to ISINtest-result\n goback\n end-if\n move b to luhn-number(p + 1:2)\n add 2 to p\n end-if\n end-perform\n\n call 'luhntest' using luhn-number(1:p) luhntest-result\n if luhntest-result <> 0\n move -4 to ISINtest-result\n goback\n end-if\n\n move 0 to ISINtest-result\n goback\n .\nend program ISINtest.\n\nidentification division.\nprogram-id. luhntest.\ndata division.\nworking-storage section.\n01 i pic S99.\n01 check-sum pic 999.\nlinkage section.\n01 test-number any length.\n01 luhntest-result binary-int.\nprocedure division using test-number luhntest-result.\nstart-luhntest.\n display space test-number with no advancing\n move 0 to check-sum\n\n *> right to left sum the odd numbered digits\n compute i = function length(test-number)\n perform varying i from i by -2 until i < 1\n add function numval(test-number(i:1)) to check-sum\n end-perform\n display space check-sum with no advancing\n\n *> right to left double sum the even numbered digits\n compute i = function length(test-number) - 1\n perform varying i from i by -2 until i < 1\n add function numval(test-number(i:1)) to check-sum\n add function numval(test-number(i:1)) to check-sum\n *> convert a two-digit double sum number to a single digit\n if test-number(i:1) >= '5'\n subtract 9 from check-sum\n end-if\n end-perform\n display space check-sum with no advancing\n\n if function mod(check-sum,10) = 0\n move 0 to luhntest-result *> success\n else\n move -1 to luhntest-result *> failure\n end-if\n goback\n .\nend program luhntest.\n","language":"COBOL"},{"code":"(defun alphap (char)\n (char<= #\\A char #\\Z))\n\n(defun alpha-digit-char-p (char)\n (or (alphap char) (digit-char-p char)))\n\n(defun valid-isin-format-p (isin)\n (and (= (length isin) 12)\n (alphap (char isin 0))\n (alphap (char isin 1))\n (loop for i from 2 to 10\n always (alpha-digit-char-p (char isin i)))\n (digit-char-p (char isin 11))))\n\n(defun isin->digits (isin)\n (apply #'concatenate 'string\n (loop for c across isin\n collect (princ-to-string (digit-char-p c 36)))))\n\n(defun luhn-test (string)\n (loop for c across (reverse string)\n for oddp = t then (not oddp)\n if oddp\n sum (digit-char-p c) into result\n else\n sum (let ((n (* 2 (digit-char-p c))))\n (if (> n 9) (- n 9) n))\n into result\n finally (return (zerop (mod result 10)))))\n\n(defun valid-isin-p (isin)\n (and (valid-isin-format-p isin)\n (luhn-test (isin->digits isin))))\n\n(defun test ()\n (dolist (isin '(\"US0378331005\" \"US0373831005\" \"U50378331005\" \"US03378331005\"\n \"AU0000XVGZA3\" \"AU0000VXGZA3\" \"FR0000988040\"))\n (format t \"~A: ~:[invalid~;valid~]~%\" isin (valid-isin-p isin))))\n","language":"Common-Lisp"},{"code":"import std.stdio;\n\nvoid main() {\n auto isins = [\n \"US0378331005\",\n \"US0373831005\",\n \"U50378331005\",\n \"US03378331005\",\n \"AU0000XVGZA3\",\n \"AU0000VXGZA3\",\n \"FR0000988040\",\n ];\n foreach (isin; isins) {\n writeln(isin, \" is \", ISINvalidate(isin) ? \"valid\" : \"not valid\");\n }\n}\n\nbool ISINvalidate(string isin) {\n import std.array : appender;\n import std.conv : to;\n import std.regex : matchFirst;\n import std.string : strip, toUpper;\n\n isin = isin.strip.toUpper;\n\n if (isin.matchFirst(`^[A-Z]{2}[A-Z0-9]{9}\\d$`).empty) {\n return false;\n }\n\n auto sb = appender!string;\n foreach (c; isin[0..12]) {\n sb.put(\n [c].to!int(36)\n .to!string\n );\n }\n\n import luhn;\n return luhnTest(sb.data);\n}\n","language":"D"},{"code":"bool checkISIN(String isin) {\n int j = 0, v = 0;\n List<int> s = List.filled(24, 0);\n\n for (int i = 0; i < 12; i++) {\n int k = isin.codeUnitAt(i);\n if (k >= '0'.codeUnitAt(0) && k <= '9'.codeUnitAt(0)) {\n if (i < 2) return false;\n s[j++] = k - '0'.codeUnitAt(0);\n } else if (k >= 'A'.codeUnitAt(0) && k <= 'Z'.codeUnitAt(0)) {\n if (i == 11) return false;\n k -= 'A'.codeUnitAt(0) - 10;\n s[j++] = k ~/ 10;\n s[j++] = k % 10;\n } else {\n return false;\n }\n }\n\n if (isin.length > 12) return false;\n\n for (int i = j - 2; i >= 0; i -= 2) {\n int k = 2 * s[i];\n v += k > 9 ? k - 9 : k;\n }\n\n for (int i = j - 1; i >= 0; i -= 2) {\n v += s[i];\n }\n\n return v % 10 == 0;\n}\n\nvoid main() {\n List<String> test = [\n \"US0378331005\",\n \"US0373831005\",\n \"U50378331005\",\n \"US03378331005\",\n \"AU0000XVGZA3\",\n \"AU0000VXGZA3\",\n \"FR0000988040\"\n ];\n\n for (String isin in test) {\n print('$isin - ${checkISIN(isin)}');\n }\n}\n","language":"Dart"},{"code":"function StrToBase10(S: string): TByteDynArray;\n{Convert ASCII string to Base-10}\n{ASCII Digits converted to integer 0..9 }\n{ASCII Chars convert to bytes \"A\"=10, \"B\"=11, etc }\nvar I: Integer;\nvar B: byte;\n\n\tprocedure StoreByte(B: byte);\n\tbegin\n\tSetLength(Result,Length(Result)+1);\n\tResult[High(Result)]:=B;\n\tend;\n\nbegin\nSetLength(Result,0);\nfor I:=1 to Length(S) do\n\tbegin\n\tif S[I] in ['0'..'9'] then StoreByte(Byte(S[I])-$30)\n\telse\n\t\tbegin\n\t\tB:=(Byte(S[I])-$41)+10;\n\t\tStoreByte(B div 10);\n\t\tStoreByte(B mod 10);\n\t\tend;\n\tend;\nend;\n\n{Simplifies cases where we have to sum a two digit number}\n\nconst DigitSum: array [0..18] of byte = (0,1,2,3,4,5,6,7,8,9,1,2,3,4,5,6,7,8,9);\n\nfunction LuhnTest(Nums: array of byte): boolean;\n{Perform Luhn Test of byte array}\nvar I,J,Len,Sum,Sum1,Sum2: integer;\nvar Rev: array of byte;\nbegin\nSum1:=0; Sum2:=0;\nLen:=High(Nums);\nfor I:=Len downto 0 do\n if ((I-Len) and 1)=0 then Sum1:=Sum1 + Nums[I]\n else Sum2:=Sum2 + DigitSum[Nums[I]*2];\nSum:=Sum1+Sum2;\nResult:=(Sum mod 10)=0;\nend;\n\n{String error types}\n\ntype TStringErrors = (seNone,seLength,seCountry);\n\nfunction ValidateStr(IDStr: string): TStringErrors;\n{Validate string checking for incorrectly length}\n{And invalid country code}\nbegin\nif Length(IDStr)<>12 then Result:=seLength\nelse if not (IDStr[1] in ['a'..'z','A'..'Z']) or\n not (IDStr[2] in ['a'..'z','A'..'Z']) then Result:=seCountry\nelse Result:=seNone;\nend;\n\n\n\nprocedure ValidateID(Memo: TMemo; IDStr: string);\n{Validate and display status of string}\nvar BA: TByteDynArray;\nvar LT: boolean;\nvar SE: TStringErrors;\nvar S: string;\nbegin\nSE:=ValidateStr(IDStr);\nBA:=StrToBase10(IDStr);\nLT:=LuhnTest(BA);\nif LT and (SE=seNone) then Memo.Lines.Add(IDStr+': Valid')\nelse\n\tbegin\n\tS:=IDStr+': Invalid';\n\tif not LT then S:=S+', Luhn Error';\n\tcase SE of\n\t seLength: S:=S+', Length Error';\n\t seCountry: S:=S+', Country Code Error';\n\t end;\n\tMemo.Lines.Add(S);\n\tend;\nend;\n\n\n\nprocedure ValidateSecuritiesID(Memo: TMemo);\nvar BA: TByteDynArray;\nvar I: integer;\nvar S: string;\nbegin\nValidateID(Memo,'US0378331005');\nValidateID(Memo,'US0373831005');\nValidateID(Memo,'U50378331005');\nValidateID(Memo,'US03378331005');\nValidateID(Memo,'AU0000XVGZA3');\nValidateID(Memo,'AU0000VXGZA3');\nValidateID(Memo,'FR0000988040');\nend;\n","language":"Delphi"},{"code":"func isin t$ .\n if len t$ <> 12\n return 0\n .\n for i to 12\n k = strcode substr t$ i 1\n if k >= 48 and k <= 57\n if i <= 2\n return 0\n .\n s[] &= k - 48\n elif k >= 65 and k <= 91\n if (i = 12)\n return 0\n .\n k -= 55\n s[] &= k div 10\n s[] &= k mod 10\n else\n return 0\n .\n .\n i = len s[] - 1\n while i >= 1\n k = 2 * s[i]\n if k > 9\n k -= 9\n .\n v += k\n i -= 2\n .\n i = len s[]\n while i >= 1\n v += s[i]\n i -= 2\n .\n if v mod 10 = 0\n return 1\n .\n.\ntest$[] = [ \"US0378331005\" \"US0373831005\" \"U50378331005\" \"US03378331005\" \"AU0000XVGZA3\" \"AU0000VXGZA3\" \"FR0000988040\" ]\nfor t$ in test$[]\n if isin t$ = 1\n print t$ & \" is valid\"\n else\n print t$ & \" is invalid\"\n .\n.\n","language":"EasyLang"},{"code":"isin? = fn str ->\n if str =~ ~r/\\A[A-Z]{2}[A-Z0-9]{9}\\d\\z/ do\n String.codepoints(str)\n |> Enum.map_join(&String.to_integer(&1, 36))\n |> Luhn.valid?\n else\n false\n end\n end\n\nIO.puts \" ISIN Valid?\"\n~w(US0378331005\n US0373831005\n U50378331005\n US03378331005\n AU0000XVGZA3\n AU0000VXGZA3\n FR0000988040)\n|> Enum.each(&IO.puts \"#{&1}\\t#{isin?.(&1)}\")\n","language":"Elixir"},{"code":"USING: combinators.short-circuit.smart formatting kernel luhn\nmath math.parser qw sequences strings unicode ;\nIN: rosetta-code.isin\n\nCONSTANT: test-cases qw{\n US0378331005 US0373831005 U50378331005 US03378331005\n AU0000XVGZA3 AU0000VXGZA3 FR0000988040\n}\n\n: valid-length? ( str -- ? ) length 12 = ;\n\n: valid-country-code? ( str -- ? ) first2 [ Letter? ] both? ;\n\n: valid-security-code? ( str -- ? )\n [ 2 11 ] dip subseq [ alpha? ] all? ;\n\n: valid-checksum-digit? ( str -- ? ) last digit? ;\n\n: valid-format? ( str -- ? ) {\n [ valid-length? ]\n [ valid-country-code? ]\n [ valid-security-code? ]\n [ valid-checksum-digit? ]\n } && ;\n\n: base36>base10 ( str -- n )\n >upper [ dup LETTER? [ 55 - number>string ] [ 1string ] if ]\n { } map-as concat string>number ;\n\n: isin? ( str -- ? )\n { [ valid-format? ] [ base36>base10 luhn? ] } && ;\n\n: main ( -- )\n test-cases [\n dup isin? \"\" \" not\" ? \"%s is%s valid\\n\" printf\n ] each ;\n\nMAIN: main\n","language":"Factor"},{"code":"program isin\n use ctype\n implicit none\n character(20) :: test(7) = [\"US0378331005 \", &\n \"US0373831005 \", &\n \"U50378331005 \", &\n \"US03378331005 \", &\n \"AU0000XVGZA3 \", &\n \"AU0000VXGZA3 \", &\n \"FR0000988040 \"]\n print *, check_isin(test)\ncontains\n elemental logical function check_isin(a)\n character(*), intent(in) :: a\n integer :: s(24)\n integer :: i, j, k, n, v\n\n check_isin = .false.\n\n n = len_trim(a)\n if (n /= 12) return\n\n ! Convert to an array of digits\n j = 0\n do i = 1, n\n k = iachar(a(i:i))\n if (k >= 48 .and. k <= 57) then\n if (i < 3) return\n k = k - 48\n j = j + 1\n s(j) = k\n else if (k >= 65 .and. k <= 90) then\n if (i == 12) return\n k = k - 65 + 10\n j = j + 1\n s(j) = k / 10\n j = j + 1\n s(j) = mod(k, 10)\n else\n return\n end if\n end do\n\n ! Compute checksum\n v = 0\n do i = j - 1, 1, -2\n k = 2 * s(i)\n if (k > 9) k = k - 9\n v = v + k\n end do\n do i = j, 1, -2\n v = v + s(i)\n end do\n\n check_isin = 0 == mod(v, 10)\n end function\nend program\n","language":"Fortran"},{"code":"' version 27-10-2016\n' compile with: fbc -s console\n\n#Ifndef TRUE ' define true and false for older freebasic versions\n #Define FALSE 0\n #Define TRUE Not FALSE\n#EndIf\n\nFunction luhntest(cardnr As String) As Long\n\n cardnr = Trim(cardnr) ' remove spaces\n\n Dim As String reverse_nr = cardnr\n Dim As Long i, j, s1, s2, l = Len(cardnr) -1\n\n ' reverse string\n For i = 0 To l\n reverse_nr[i] = cardnr[l - i]\n Next\n ' sum odd numbers\n For i = 0 To l Step 2\n s1 = s1 + (reverse_nr[i] - Asc(\"0\"))\n Next\n ' sum even numbers\n For i = 1 To l Step 2\n j = reverse_nr[i] - Asc(\"0\")\n j = j * 2\n If j > 9 Then j = j Mod 10 +1\n s2 = s2 + j\n Next\n\n If (s1 + s2) Mod 10 = 0 Then\n Return TRUE\n Else\n Return FALSE\n End If\n\nEnd Function\n\n' ------=< MAIN >=-----\n\nDim As String test_str\nDim As String test_set(1 To ...) = { \"US0378331005\", \"US0373831005\", _\n \"U50378331005\", \"US03378331005\", \"AU0000XVGZA3\", _\n \"AU0000VXGZA3\", \"FR0000988040\" }\n\nDim As Long i, l, n, x\n\nFor i = 1 To UBound(test_set)\n test_str = \"\"\n l = Len(test_set(i))\n If l <> 12 Then\n Print test_set(i), \"Invalid, length <> 12 char.\"\n Continue For\n End If\n If test_set(i)[0] < Asc(\"A\") Or test_set(i)[1] < Asc(\"A\") Then\n Print test_set(i), \"Invalid, number needs to start with 2 characters\"\n Continue For\n End If\n For n = 0 To l -1\n x = test_set(i)[n] - Asc(\"0\")\n ' if test_set(i)[i] is a letter we to correct for that\n If x > 9 Then x = x -7\n If x < 10 Then\n test_str = test_str + Str(x)\n Else ' two digest number\n test_str = test_str + Str(x \\ 10) + Str(x Mod 10)\n End If\n Next\n Print test_set(i), IIf(luhntest(test_str) = TRUE, \"Valid\",\"Invalid, checksum error\")\nNext\n\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 \"regexp\"\n\nvar r = regexp.MustCompile(`^[A-Z]{2}[A-Z0-9]{9}\\d$`)\n\nvar inc = [2][10]int{\n\t{0, 1, 2, 3, 4, 5, 6, 7, 8, 9},\n\t{0, 2, 4, 6, 8, 1, 3, 5, 7, 9},\n}\n\nfunc ValidISIN(n string) bool {\n\tif !r.MatchString(n) {\n\t\treturn false\n\t}\n\tvar sum, p int\n\tfor i := 10; i >= 0; i-- {\n\t\tp = 1 - p\n\t\tif d := n[i]; d < 'A' {\n\t\t\tsum += inc[p][d-'0']\n\t\t} else {\n\t\t\td -= 'A'\n\t\t\tsum += inc[p][d%10]\n\t\t\tp = 1 - p\n\t\t\tsum += inc[p][d/10+1]\n\t\t}\n\t}\n\tsum += int(n[11] - '0')\n\treturn sum%10 == 0\n}\n","language":"Go"},{"code":"package main\n\nimport \"testing\"\n\nfunc TestValidISIN(t *testing.T) {\n\ttestcases := []struct {\n\t\tisin string\n\t\tvalid bool\n\t}{\n\t\t{\"US0378331005\", true},\n\t\t{\"US0373831005\", false},\n\t\t{\"U50378331005\", false},\n\t\t{\"US03378331005\", false},\n\t\t{\"AU0000XVGZA3\", true},\n\t\t{\"AU0000VXGZA3\", true},\n\t\t{\"FR0000988040\", true},\n\t}\n\n\tfor _, testcase := range testcases {\n\t\tactual := ValidISIN(testcase.isin)\n\t\tif actual != testcase.valid {\n\t\t\tt.Errorf(\"expected %v for %q, got %v\",\n\t\t\t\ttestcase.valid, testcase.isin, actual)\n\t\t}\n\t}\n}\n","language":"Go"},{"code":"CHARS = '0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZ'\n\nint checksum(String prefix) {\n def digits = prefix.toUpperCase().collect { CHARS.indexOf(it).toString() }.sum()\n def groups = digits.collect { CHARS.indexOf(it) }.inject([[], []]) { acc, i -> [acc[1], acc[0] + i] }\n def ds = groups[1].collect { (2 * it).toString() }.sum().collect { CHARS.indexOf(it) } + groups[0]\n (10 - ds.sum() % 10) % 10\n}\n\nassert checksum('AU0000VXGZA') == 3\nassert checksum('GB000263494') == 6\nassert checksum('US037833100') == 5\nassert checksum('US037833107') == 0\n","language":"Groovy"},{"code":"module ISINVerification2 where\n\nimport Data.Char (isUpper, isDigit, digitToInt)\n\nverifyISIN :: String -> Bool\nverifyISIN isin =\n correctFormat isin && mod (oddsum + multiplied_even_sum) 10 == 0\n where\n reverted = reverse $ convertToNumber isin\n theOdds = fst $ collectOddandEven reverted\n theEvens = snd $ collectOddandEven reverted\n oddsum = sum $ map digitToInt theOdds\n multiplied_even_sum = addUpDigits $ map ((* 2) . digitToInt) theEvens\n\ncapitalLetters :: String\ncapitalLetters = ['A','B' .. 'Z']\n\nnumbers :: String\nnumbers = ['0', '1', '2', '3', '4', '5', '6', '7', '8', '9']\n\ncorrectFormat :: String -> Bool\ncorrectFormat isin =\n (length isin == 12) &&\n all (`elem` capitalLetters) (take 2 isin) &&\n all (\\c -> elem c capitalLetters || elem c numbers) (drop 2 $ take 11 isin) &&\n elem (last isin) numbers\n\nconvertToNumber :: String -> String\nconvertToNumber = concatMap convert\n where\n convert :: Char -> String\n convert c =\n if isDigit c\n then show $ digitToInt c\n else show (fromEnum c - 55)\n\ncollectOddandEven :: String -> (String, String)\ncollectOddandEven term\n | odd $ length term =\n ( concat\n [ take 1 $ drop n term\n | n <- [0,2 .. length term - 1] ]\n , concat\n [ take 1 $ drop d term\n | d <- [1,3 .. length term - 2] ])\n | otherwise =\n ( concat\n [ take 1 $ drop n term\n | n <- [0,2 .. length term - 2] ]\n , concat\n [ take 1 $ drop d term\n | d <- [1,3 .. length term - 1] ])\n\naddUpDigits :: [Int] -> Int\naddUpDigits list =\n sum $\n map\n (\\d ->\n if d > 9\n then sum $ map digitToInt $ show d\n else d)\n list\n\nprintSolution :: String -> IO ()\nprintSolution str = do\n putStr $ str ++ \" is\"\n if verifyISIN str\n then putStrLn \" valid\"\n else putStrLn \" not valid\"\n\nmain :: IO ()\nmain = do\n let isinnumbers =\n [ \"US0378331005\"\n , \"US0373831005\"\n , \"U50378331005\"\n , \"US03378331005\"\n , \"AU0000XVGZA3\"\n , \"AU0000VXGZA3\"\n , \"FR0000988040\"\n ]\n mapM_ printSolution isinnumbers\n","language":"Haskell"},{"code":"import Control.Monad ((<=<))\nimport Data.Bifunctor (first)\nimport Data.List (foldl') -- '\nimport qualified Data.Map as M\nimport Data.Maybe (fromMaybe)\n\n-------------------- VALID ISIN STRING -------------------\n\nvalidISIN :: String -> Bool\nvalidISIN =\n (&&) . isinPattern\n <*> luhn . (show <=< stringInts)\n\nisinPattern :: String -> Bool\nisinPattern s =\n 12 == length s\n && all (`elem` capitals) l\n && all (`elem` (capitals <> digits)) m\n && head r `elem` digits\n where\n [l, m, r] = bites s [2, 9, 1]\n\nluhn :: String -> Bool\nluhn x = 0 == rem (s1 + s2) 10\n where\n odds = [(: []), const []]\n evens = reverse odds\n stream f =\n concat $\n zipWith ($) (cycle f) (stringInts $ reverse x)\n s1 = sum (stream odds)\n s2 =\n sum $\n sum . stringInts . show . (2 *) <$> stream evens\n\ncharMap :: M.Map Char Int\ncharMap = M.fromList $ zip (digits <> capitals) [0 ..]\n\nstringInts :: String -> [Int]\nstringInts = fromMaybe [] . traverse (`M.lookup` charMap)\n\nbites :: [a] -> [Int] -> [[a]]\nbites xs =\n (reverse . fst)\n . foldl' -- '\n (\\(a, r) x -> first (: a) (splitAt x r))\n ([], xs)\n\ncapitals, digits :: String\ncapitals = ['A' .. 'Z']\ndigits = ['0' .. '9']\n\n--------------------------- TEST -------------------------\nmain :: IO ()\nmain =\n mapM_\n (print . ((,) <*> validISIN))\n [ \"US0378331005\",\n \"US0373831005\",\n \"U50378331005\",\n \"US03378331005\",\n \"AU0000XVGZA3\",\n \"AU0000VXGZA3\",\n \"FR0000988040\"\n ]\n","language":"Haskell"},{"code":"require'regex'\nvalidFmt=: 0 -: '^[A-Z]{2}[A-Z0-9]{9}[0-9]{1}$'&rxindex\n\ndf36=: ;@([: <@\":\"0 '0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZ'&i.) NB. decimal from base 36\nluhn=: 0 = 10 (| +/@,) 10 #.inv 1 2 *&|: _2 \".\"0\\ |. NB. as per task Luhn_test_of_credit_card_numbers#J\n\nvalidISIN=: validFmt *. luhn@df36\n","language":"J"},{"code":" Tests=: 'US0378331005';'US0373831005';'U50378331005';'US03378331005';'AU0000XVGZA3';'AU0000VXGZA3';'FR0000988040'\n validISIN&> Tests\n1 0 0 0 1 1 1\n","language":"J"},{"code":"public class ISIN {\n\n public static void main(String[] args) {\n String[] isins = {\n \"US0378331005\",\n \"US0373831005\",\n \"U50378331005\",\n \"US03378331005\",\n \"AU0000XVGZA3\",\n \"AU0000VXGZA3\",\n \"FR0000988040\"\n };\n for (String isin : isins)\n System.out.printf(\"%s is %s\\n\", isin, ISINtest(isin) ? \"valid\" : \"not valid\");\n }\n\n static boolean ISINtest(String isin) {\n isin = isin.trim().toUpperCase();\n\n if (!isin.matches(\"^[A-Z]{2}[A-Z0-9]{9}\\\\d$\"))\n return false;\n\n StringBuilder sb = new StringBuilder();\n for (char c : isin.substring(0, 12).toCharArray())\n sb.append(Character.digit(c, 36));\n\n return luhnTest(sb.toString());\n }\n\n static boolean luhnTest(String number) {\n int s1 = 0, s2 = 0;\n String reverse = new StringBuffer(number).reverse().toString();\n for (int i = 0; i < reverse.length(); i++){\n int digit = Character.digit(reverse.charAt(i), 10);\n //This is for odd digits, they are 1-indexed in the algorithm.\n if (i % 2 == 0){\n s1 += digit;\n } else { // Add 2 * digit for 0-4, add 2 * digit - 9 for 5-9.\n s2 += 2 * digit;\n if(digit >= 5){\n s2 -= 9;\n }\n }\n }\n return (s1 + s2) % 10 == 0;\n }\n}\n","language":"Java"},{"code":"# This filter may be applied to integers or integer-valued strings\ndef luhntest:\n def digits: tostring | explode | map([.]|implode|tonumber);\n (digits | reverse)\n | ( [.[range(0;length;2)]] | add ) as $sum1\n | [.[range(1;length;2)]]\n | (map( (2 * .) | if . > 9 then (digits|add) else . end) | add) as $sum2\n | ($sum1 + $sum2) % 10 == 0;\n\ndef decodeBase36:\n # decode a single character\n def d1:\n explode[0]\n # \"0\" is 48; \"A\" is 65\n | if . < 65 then . - 48\n else . - 55\n end;\n def chars: explode | map([.]|implode);\n chars | map(d1) | join(\"\");\n\ndef is_ISIN:\n type == \"string\"\n and test(\"^(?<cc>[A-Z][A-Z])(?<sc>[0-9A-Z]{9})(?<cs>[0-9])$\")\n and (decodeBase36 | luhntest);\n","language":"Jq"},{"code":"def task:\n \"US0378331005\",\n \"US0373831005\",\n \"U50378331005\",\n \"US03378331005\",\n \"AU0000XVGZA3\",\n \"AU0000VXGZA3\",\n \"FR0000988040\"\n | . + \" => \" + (if is_ISIN then \"valid\" else \"invalid\" end);\n\ntask\n","language":"Jq"},{"code":"using Printf\n\nluhntest(x) = luhntest(parse(Int, x))\n\nfunction checkISIN(inum::AbstractString)\n if length(inum) != 12 || !all(isalpha, inum[1:2]) return false end\n return parse.(Int, collect(inum), 36) |> join |> luhntest\nend\n\nfor inum in [\"US0378331005\", \"US0373831005\", \"U50378331005\",\n \"US03378331005\", \"AU0000XVGZA3\", \"AU0000VXGZA3\", \"FR0000988040\"]\n @printf(\"%-15s %5s\\n\", inum, ifelse(checkISIN(inum), \"pass\", \"fail\"))\nend\n","language":"Julia"},{"code":"// version 1.1\n\nobject Isin {\n val r = Regex(\"^[A-Z]{2}[A-Z0-9]{9}[0-9]$\")\n\n fun isValid(s: String): Boolean {\n // check format\n if (!s.matches(r)) return false\n // validate checksum\n val sb = StringBuilder()\n for (c in s) {\n when (c) {\n in '0'..'9' -> sb.append(c)\n in 'A'..'Z' -> sb.append((c.toInt() - 55).toString().padStart(2, '0'))\n }\n }\n return luhn(sb.toString())\n }\n\n private fun luhn(s: String): Boolean {\n fun sumDigits(n: Int) = n / 10 + n % 10\n val t = s.reversed()\n val s1 = t.filterIndexed { i, _ -> i % 2 == 0 }.sumBy { it - '0' }\n val s2 = t.filterIndexed { i, _ -> i % 2 == 1 }.map { sumDigits((it - '0') * 2) }.sum()\n return (s1 + s2) % 10 == 0\n }\n}\n\nfun main(args: Array<String>) {\n val isins = arrayOf(\n \"US0378331005\", \"US0373831005\", \"U50378331005\", \"US03378331005\",\n \"AU0000XVGZA3\", \"AU0000VXGZA3\", \"FR0000988040\"\n )\n for (isin in isins) {\n println(\"$isin\\t -> ${if (Isin.isValid(isin)) \"valid\" else \"not valid\"}\")\n }\n}\n","language":"Kotlin"},{"code":"val .luhntest = fn(.s) {\n val .t = [0, 2, 4, 6, 8, 1, 3, 5, 7, 9]\n val .numbers = s2n .s\n val .oddeven = len(.numbers) rem 2\n\n for[=0] .i of .numbers {\n _for += if .i rem 2 == .oddeven {\n \t.numbers[.i]\n } else {\n \t.t[.numbers[.i]+1]\n }\n } div 10\n}\n\nval .isintest = fn(.s) {\n .s -> re/^[A-Z][A-Z][0-9A-Z]{9}[0-9]$/ and\n .luhntest(join s2n .s)\n}\n\nval .tests = h{\n \"US0378331005\": true,\n \"US0373831005\": false,\n \"U50378331005\": false,\n \"AU0000XVGZA3\": true,\n \"AU0000VXGZA3\": true,\n \"FR0000988040\": true,\n \"US03378331005\": false,\n}\n\nfor .key in sort(keys .tests) {\n val .pass = .isintest(.key)\n write .key, \": \", .pass\n writeln if(.pass == .tests[.key]: \"\"; \" (ISIN TEST FAILED)\")\n}\n","language":"Langur"},{"code":"function luhn (n)\n local revStr, s1, s2, digit, mod = n:reverse(), 0, 0\n for pos = 1, #revStr do\n digit = tonumber(revStr:sub(pos, pos))\n if pos % 2 == 1 then\n s1 = s1 + digit\n else\n digit = digit * 2\n if digit > 9 then\n mod = digit % 10\n digit = mod + ((digit - mod) / 10)\n end\n s2 = s2 + digit\n end\n end\n return (s1 + s2) % 10 == 0\nend\n\nfunction checkISIN (inStr)\n if #inStr ~= 12 then return false end\n local numStr = \"\"\n for pos = 1, #inStr do\n numStr = numStr .. tonumber(inStr:sub(pos, pos), 36)\n end\n return luhn(numStr)\nend\n\nlocal testCases = {\n \"US0378331005\",\n \"US0373831005\",\n \"US0373831005\",\n \"US03378331005\",\n \"AU0000XVGZA3\",\n \"AU0000VXGZA3\",\n \"FR0000988040\"\n}\nfor _, ISIN in pairs(testCases) do print(ISIN, checkISIN(ISIN)) end\n","language":"Lua"},{"code":"ClearAll[LuhnQ, VakudISINQ]\nLuhnQ[n_Integer] := Block[{digits = Reverse@IntegerDigits@n}, Mod[Total[{digits[[;; ;; 2]], IntegerDigits[2 #] & /@ digits[[2 ;; ;; 2]]}, -1], 10] == 0]\nVakudISINQ[sin_String] := Module[{s = ToUpperCase[sin]},\n If[StringMatchQ[s,\n LetterCharacter ~~ LetterCharacter ~~\n Repeated[DigitCharacter | LetterCharacter, {9}] ~~\n DigitCharacter],\n s = StringJoin[\n Characters[s] /.\n Thread[CharacterRange[\"A\", \"Z\"] -> ToString /@ Range[10, 35]]];\n LuhnQ[ToExpression[s]]\n ,\n False\n ]\n ]\nVakudISINQ /@ {\"US0378331005\", \"US0373831005\", \"U50378331005\", \"US03378331005\", \"AU0000XVGZA3\", \"AU0000VXGZA3\", \"FR0000988040\"}\n","language":"Mathematica"},{"code":"import strformat\n\nconst\n DigitRange = '0'..'9'\n UpperCaseRange = 'A'..'Z'\n\ntype ISINError = object of ValueError\n\n\nproc luhn(s: string): bool =\n const m = [0, 2, 4, 6, 8, 1, 3, 5, 7, 9]\n var sum = 0\n var odd = true\n for i in countdown(s.high, 0):\n let digit = ord(s[i]) - ord('0')\n sum += (if odd: digit else: m[digit])\n odd = not odd\n result = sum mod 10 == 0\n\n\nproc validateISIN(s: string) =\n if s.len != 12:\n raise newException(ISINError, \"wrong length\")\n if s[0] notin UpperCaseRange or s[1] notin UpperCaseRange:\n raise newException(ISINError, \"wrong country code\")\n if s[11] notin DigitRange:\n raise newException(ISINError, \"wrong checksum character\")\n var t: string\n for ch in s:\n case ch\n of '0'..'9': t.add ch\n of 'A'..'Z': t.addInt ord(ch) - ord('A') + 10\n else: raise newException(ISINError, \"invalid characters in code\")\n if not t.luhn():\n raise newException(ISINError, \"checksum error\")\n\n\nwhen isMainModule:\n\n for isin in [\"US0378331005\", \"US0373831005\", \"U50378331005\",\n \"US03378331005\", \"AU0000XVGZA3\", \"AU0000VXGZA3\", \"FR0000988040\"]:\n try:\n isin.validateISIN()\n echo &\"{isin} is valid.\"\n except ISINError:\n echo &\"{isin} is not valid: {getCurrentExceptionMsg()}.\"\n","language":"Nim"},{"code":"use strict;\nuse English;\nuse POSIX;\nuse Test::Simple tests => 7;\n\nok( validate_isin('US0378331005'), 'Test 1');\t\nok( ! validate_isin('US0373831005'), 'Test 2');\nok( ! validate_isin('U50378331005'), 'Test 3');\nok( ! validate_isin('US03378331005'), 'Test 4');\nok( validate_isin('AU0000XVGZA3'), 'Test 5');\t\nok( validate_isin('AU0000VXGZA3'), 'Test 6');\nok( validate_isin('FR0000988040'), 'Test 7');\t\nexit 0;\n\nsub validate_isin {\n my $isin = shift;\n $isin =~ /\\A[A-Z]{2}[A-Z\\d]{9}\\d\\z/s or return 0;\n my $base10 = join(q{}, map {scalar(POSIX::strtol($ARG, 36))}\n split(//s, $isin));\n return luhn_test($base10);\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;\">Luhn</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #004080;\">string</span> <span style=\"color: #000000;\">st</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #004080;\">integer</span> <span style=\"color: #000000;\">s</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">0</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">d</span>\n <span style=\"color: #000000;\">st</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">reverse</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">st</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;\">st</span><span style=\"color: #0000FF;\">)</span> <span style=\"color: #008080;\">do</span>\n <span style=\"color: #000000;\">d</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">st</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">i</span><span style=\"color: #0000FF;\">]-</span><span style=\"color: #008000;\">'0'</span>\n <span style=\"color: #000000;\">s</span> <span style=\"color: #0000FF;\">+=</span> <span style=\"color: #008080;\">iff</span><span style=\"color: #0000FF;\">(</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;\">2</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: #000000;\">2</span><span style=\"color: #0000FF;\">-(</span><span style=\"color: #000000;\">d</span><span style=\"color: #0000FF;\">></span><span style=\"color: #000000;\">4</span><span style=\"color: #0000FF;\">)*</span><span style=\"color: #000000;\">9</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: #7060A8;\">remainder</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">s</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">10</span><span style=\"color: #0000FF;\">)=</span><span style=\"color: #000000;\">0</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;\">valid_ISIN</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #004080;\">string</span> <span style=\"color: #000000;\">st</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #000080;font-style:italic;\">-- returns 1 if valid, else 0/2/3/4.\n -- (feel free to return 0 instead of 2/3/4)</span>\n <span style=\"color: #008080;\">if</span> <span style=\"color: #7060A8;\">length</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">st</span><span style=\"color: #0000FF;\">)!=</span><span style=\"color: #000000;\">12</span> <span style=\"color: #008080;\">then</span> <span style=\"color: #008080;\">return</span> <span style=\"color: #000000;\">2</span> <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: #7060A8;\">length</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">st</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;\">ch</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">st</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;\">then</span>\n <span style=\"color: #008080;\">if</span> <span style=\"color: #000000;\">ch</span><span style=\"color: #0000FF;\">></span><span style=\"color: #008000;\">'Z'</span> <span style=\"color: #008080;\">then</span> <span style=\"color: #008080;\">return</span> <span style=\"color: #000000;\">3</span> <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">if</span>\n <span style=\"color: #000000;\">st</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">i</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;\">sprintf</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #008000;\">\"%d\"</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">ch</span><span style=\"color: #0000FF;\">-</span><span style=\"color: #000000;\">55</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;\">2</span> <span style=\"color: #008080;\">then</span>\n <span style=\"color: #008080;\">return</span> <span style=\"color: #000000;\">4</span>\n <span style=\"color: #008080;\">elsif</span> <span style=\"color: #000000;\">ch</span><span style=\"color: #0000FF;\"><</span><span style=\"color: #008000;\">'0'</span> <span style=\"color: #008080;\">or</span> <span style=\"color: #000000;\">ch</span><span style=\"color: #0000FF;\">></span><span style=\"color: #008000;\">'9'</span> <span style=\"color: #008080;\">then</span>\n <span style=\"color: #008080;\">return</span> <span style=\"color: #000000;\">3</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;\">Luhn</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">st</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;\">tests</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #0000FF;\">{</span><span style=\"color: #008000;\">\"US0378331005\"</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000080;font-style:italic;\">-- valid </span>\n <span style=\"color: #008000;\">\"US0373831005\"</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000080;font-style:italic;\">-- not valid The transposition typo is caught by the checksum constraint.</span>\n <span style=\"color: #008000;\">\"U50378331005\"</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000080;font-style:italic;\">-- not valid The substitution typo is caught by the format constraint.</span>\n <span style=\"color: #008000;\">\"US03378331005\"</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000080;font-style:italic;\">-- not valid The duplication typo is caught by the format constraint.</span>\n <span style=\"color: #008000;\">\"AU0000XVGZA3\"</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000080;font-style:italic;\">-- valid </span>\n <span style=\"color: #008000;\">\"AU0000VXGZA3\"</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000080;font-style:italic;\">-- valid Unfortunately, not all transposition typos are caught by the checksum constraint.</span>\n <span style=\"color: #008000;\">\"FR0000988040\"</span><span style=\"color: #0000FF;\">},</span> <span style=\"color: #000080;font-style:italic;\">-- valid</span>\n\n <span style=\"color: #000000;\">reasons</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #0000FF;\">{</span><span style=\"color: #008000;\">\"wrong checksum\"</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #008000;\">\"valid\"</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #008000;\">\"wrong length\"</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #008000;\">\"bad char\"</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #008000;\">\"wrong country\"</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 : %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><span style=\"color: #000000;\">reasons</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">valid_ISIN</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><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">]})</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">for</span>\n<!--\n","language":"Phix"},{"code":"(de isin (Str)\n (let Str (mapcar char (chop Str))\n (and\n (= 12 (length Str))\n (<= 65 (car Str) 90)\n (<= 65 (cadr Str) 90)\n (luhn\n (pack\n (mapcar\n '((N)\n (- N (if (<= 48 N 57) 48 55)) )\n Str ) ) ) ) ) )\n(println\n (mapcar\n isin\n (quote\n \"US0378331005\"\n \"US0373831005\"\n \"U50378331005\"\n \"US03783310005\"\n \"AU0000XVGZA3\"\n \"AU0000VXGZA3\"\n \"FR0000988040\" ) ) )\n","language":"PicoLisp"},{"code":"function Test-ISIN\n{\n [CmdletBinding()]\n [OutputType([bool])]\n Param\n (\n [Parameter(Mandatory=$true, Position=0)]\n [ValidatePattern(\"[A-Z]{2}\\w{9}\\d\")]\n [ValidateScript({$_.Length -eq 12})]\n [string]\n $Number\n )\n\n function Split-Array\n {\n $array = @(), @()\n $input | ForEach-Object {$array[($index = -not $index)] += $_}\n $array[1], $array[0]\n }\n\n filter ConvertTo-Digit\n {\n if ($_ -gt 9)\n {\n $_.ToString().ToCharArray() | ForEach-Object -Begin {$n = 0} -Process {$n += [Char]::GetNumericValue($_)} -End {$n}\n }\n else\n {\n $_\n }\n }\n\n\n $checkDigit = $Number[-1]\n\n $digits = ($Number -replace \".$\").ToCharArray() | ForEach-Object {\n if ([Char]::IsDigit($_))\n {\n [Char]::GetNumericValue($_)\n }\n else\n {\n [int][char]$_ - 55\n }\n }\n\n $odds, $evens = ($digits -join \"\").ToCharArray() | Split-Array\n\n if ($odds.Count -gt $evens.Count)\n {\n $odds = $odds | ForEach-Object {[Char]::GetNumericValue($_) * 2} | ConvertTo-Digit\n $evens = $evens | ForEach-Object {[Char]::GetNumericValue($_)}\n }\n else\n {\n $odds = $odds | ForEach-Object {[Char]::GetNumericValue($_)}\n $evens = $evens | ForEach-Object {[Char]::GetNumericValue($_) * 2} | ConvertTo-Digit\n }\n\n $sum = ($odds | Measure-Object -Sum).Sum + ($evens | Measure-Object -Sum).Sum\n\n (10 - ($sum % 10)) % 10 -match $checkDigit\n}\n","language":"PowerShell"},{"code":"\"US0378331005\",\"US0373831005\",\"US0337833103\",\"AU0000XVGZA3\",\"AU0000VXGZA3\",\"FR0000988040\" | ForEach-Object {\n [PSCustomObject]@{\n ISIN = $_\n IsValid = Test-ISIN -Number $_\n }\n}\n","language":"PowerShell"},{"code":"EnableExplicit\n\nProcedure.b Check_ISIN(*c.Character)\n Define count.i=0, Idx.i=1, v.i=0, i.i\n Dim s.i(24)\n\n If MemoryStringLength(*c) > 12 : ProcedureReturn #False : EndIf\n\n While *c\\c\n count+1\n If *c\\c>='0' And *c\\c<='9'\n If count<=2 : ProcedureReturn #False : EndIf\n s(Idx)= *c\\c - '0'\n Idx+1\n ElseIf *c\\c>='A' And *c\\c<='Z'\n s(Idx)= (*c\\c - ('A'-10)) / 10\n Idx+1\n s(Idx)= (*c\\c - ('A'-10)) % 10\n Idx+1\n Else\n ProcedureReturn #False\n EndIf\n *c + SizeOf(Character)\n Wend\n\n For i=Idx-2 To 0 Step -2\n If s(i)*2 > 9\n v+ s(i)*2 -9\n Else\n v+ s(i)*2\n EndIf\n v+s(i+1)\n Next\n\n ProcedureReturn Bool(v%10=0)\nEndProcedure\n\nDefine.s s\nOpenConsole(\"Validate_International_Securities_Identification_Number (ISIN)\")\n\nIf ReadFile(0,\"c:\\code_pb\\rosettacode\\data\\isin.txt\")\n While Not Eof(0)\n s=ReadString(0)\n Print(s+~\"\\t\")\n If Check_ISIN(@s) : PrintN(\"TRUE\") : Else : PrintN(\"FALSE\") : EndIf\n Wend\n CloseFile(0)\nEndIf\nInput()\n","language":"PureBasic"},{"code":"def check_isin(a):\n if len(a) != 12 or not all(c.isalpha() for c in a[:2]) or not all(c.isalnum() for c in a[2:]):\n return False\n s = \"\".join(str(int(c, 36)) for c in a)\n return 0 == (sum(sum(divmod(2 * (ord(c) - 48), 10)) for c in s[-2::-2]) +\n sum(ord(c) - 48 for c in s[::-2])) % 10\n\n# A more readable version\ndef check_isin_alt(a):\n if len(a) != 12:\n return False\n s = []\n for i, c in enumerate(a):\n if c.isdigit():\n if i < 2:\n return False\n s.append(ord(c) - 48)\n elif c.isupper():\n if i == 11:\n return False\n s += divmod(ord(c) - 55, 10)\n else:\n return False\n v = sum(s[::-2])\n for k in s[-2::-2]:\n k = 2 * k\n v += k - 9 if k > 9 else k\n return v % 10 == 0\n\n[check_isin(s) for s in [\"US0378331005\", \"US0373831005\", \"U50378331005\", \"US03378331005\",\n \"AU0000XVGZA3\", \"AU0000VXGZA3\", \"FR0000988040\"]]\n\n# [True, False, False, False, True, True, True]\n","language":"Python"},{"code":" [ 2 split drop do\n char A char z 1+ within\n swap\n char A char z 1+ within\n and ] is 2chars ( $ --> b )\n\n [ dup size 12 != iff\n [ drop false ] done\n dup 2chars not iff\n [ drop false ] done\n [] swap\n witheach\n [ 36 base put\n char->n\n base release\n number$ join ]\n $->n drop luhn ] is isin ( n --> b )\n\n [ dup echo$\n say \" is \"\n isin not if\n [ say \"not \" ]\n say \"valid.\" cr ] is task ( n --> )\n\n $ \"US0378331005\" task\n $ \"US0373831005\" task\n $ \"U50378331005\" task\n $ \"US03378331005\" task\n $ \"AU0000XVGZA3\" task\n $ \"AU0000VXGZA3\" task\n $ \"FR0000988040\" task\n","language":"Quackery"},{"code":"#lang racket\n\n;; convert a base36 character (#\\0 - #\\Z) to its equivalent\n;; in base 10 as a string (\"0\" - \"35\")\n(define (base36-char->base10-string c)\n (let ([char-int (char->integer (char-upcase c))]\n [zero-int (char->integer #\\0)]\n [nine-int (char->integer #\\9)]\n [A-int (char->integer #\\A)]\n [Z-int (char->integer #\\Z)])\n (cond [(and (>= char-int zero-int) (<= char-int nine-int)) (~a c)]\n [(and (>= char-int A-int) (<= char-int Z-int)) (~a (+ (- char-int A-int) 10))]\n [else null])))\n\n;; substitute equivalent base 10 numbers for base 36 characters in string\n;; this is a character-by-character substitution not a conversion\n;; of a base36 number to a base10 number\n(define (base36-string-characters->base10-string-characters s)\n (for/fold ([joined \"\"])\n ([tenstr (map base36-char->base10-string (string->list (string-upcase s)))])\n (values (string-append joined tenstr))))\n\n;; This uses the Racket Luhn solution\n(define [isin-test? s]\n (let ([RE (pregexp \"^[A-Z]{2}[A-Z0-9]{9}[0-9]{1}$\")])\n (and\n (regexp-match? RE s)\n (luhn-test (string->number (base36-string-characters->base10-string-characters s))))))\n\n(define test-cases '(\"US0378331005\" \"US0373831005\" \"U50378331005\" \"US03378331005\" \"AU0000XVGZA3\" \"AU0000VXGZA3\" \"FR0000988040\"))\n\n(map isin-test? test-cases)\n;; -> '(#t #f #f #f #t #t #t)\n","language":"Racket"},{"code":"my $ISIN = /\n ^ <[A..Z]>**2 <[A..Z0..9]>**9 <[0..9]> $\n <?{ luhn-test $/.comb.map({ :36($_) }).join }>\n/;\n\nsub luhn-test ($number --> Bool) {\n my @digits = $number.comb.reverse;\n my $sum = @digits[0,2...*].sum\n + @digits[1,3...*].map({ |($_ * 2).comb }).sum;\n return $sum %% 10;\n}\n\n# Testing:\n\nsay \"$_ is { m/$ISIN/ ?? \"valid\" !! \"not valid\"}\" for <\nUS0378331005\nUS0373831005\nU50378331005\nUS03378331005\nAU0000XVGZA3\nAU0000VXGZA3\nFR0000988040\n>;\n","language":"Raku"},{"code":"/*REXX program validates the checksum digit for an International Securities ID number.*/\nparse arg z /*obtain optional ISINs from the C.L.*/\nif z='' then z= \"US0378331005 US0373831005 U50378331005 US03378331005 AU0000XVGZA3\" ,\n 'AU0000VXGZA3 FR0000988040' /* [↑] use the default list of ISINs.*/\n /* [↓] process all specified ISINs.*/\n do n=1 for words(z); x=word(z, n); y= x /*obtain an ISIN from the Z list. */\n $= /* [↓] construct list of ISIN digits. */\n do k=1 for length(x); _= substr(x,k,1) /*the ISIN may contain alphabetic chars*/\n p= pos(_, 0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZ) /*X must contain A──►Z, 0──►9.*/\n if p==0 then y= /*trigger \"not\" valid below.*/\n else $= $ || p-1 /*convert X string (base 36 ──► dec).*/\n end /*k*/ /* [↑] convert alphabetic ──► digits.*/\n @= /*placeholder for the \"not\" in message.*/\n if length(y)\\==12 then @= \"not\" /*see if the ISIN is exactly 12 chars. */\n if \\datatype( left(x,2),'U') then @= \"not\" /* \" \" \" \" 1st 2 chars cap. let.*/\n if \\datatype(right(x,1),'W') then @= \"not\" /* \" \" \" \" last char not a digit*/\n if @=='' then if \\luhn($) then @= \"not\" /* \" \" \" \" passed the Luhn test.*/\n say right(x, 30) right(@, 5) \"valid\" /*display the yea or nay message.*/\n end /*n*/ /* [↑] 1st 3 IFs could've been combined*/\nexit /*stick a fork in it, we're all done. */\n/*──────────────────────────────────────────────────────────────────────────────────────*/\nLuhn: procedure; parse arg x; $= 0 /*get credit card number; zero $ sum. */\n y= reverse( left(0, length(x) // 2)x) /*add leading zero if needed, & reverse*/\n do j=1 to length(y)-1 by 2; _= 2 * substr(y, j+1, 1)\n $= $ + substr(y, j, 1) + left(_, 1) + substr(_, 2 , 1, 0)\n end /*j*/ /* [↑] sum the odd and even digits.*/\n return right($, 1)==0 /*return \"1\" if number passed Luhn test*/\n","language":"REXX"},{"code":"# Project : Validate International Securities Identification Number\n\ndecimals(0)\n\ntest = [\"US0378331005\",\n \"US0373831005\",\n \"U50378331005\",\n \"US03378331005\",\n \"AU0000XVGZA3\",\n \"AU0000VXGZA3\",\n \"FR0000988040\"]\n\nfor n = 1 to len(test)\n testold = test[n]\n ascii1 = ascii(left(test[n],1))\n ascii2 = ascii(substr(test[n],2,1))\n if len(test[n]) != 12 or (ascii1 < 65 or ascii1 > 90) or (ascii2 < 65 or ascii2 > 90)\n see test[n] + \" -> Invalid\" + nl\n loop\n ok\n for m = 1 to len(test[n])\n if ascii(test[n][m]) > 64 and ascii(test[n][m]) < 91\n asc = ascii(test[n][m]) - 55\n test[n] = left(test[n],m-1) + string(asc) + right(test[n],len(test[n])-m)\n ok\n next\n see testold + \" -> \" + cardtest(test[n]) + nl\nnext\n\nfunc cardtest(numstr)\n revstring = revstr(numstr)\n s1 = revodd(revstring)\n s2 = reveven(revstring)\n s3 =right(string(s1+s2), 1)\n if s3 = \"0\"\n return \"Valid\"\n else\n return \"Invalid\"\n ok\n\nfunc revstr(str)\n strnew = \"\"\n for nr = len(str) to 1 step -1\n strnew = strnew + str[nr]\n next\n return strnew\n\nfunc revodd(str)\n strnew = \"\"\n for nr = 1 to len(str) step 2\n strnew = strnew + str[nr]\n next\n sumodd = 0\n for p = 1 to len(strnew)\n sumodd = sumodd + number(strnew[p])\n next\n return sumodd\n\nfunc reveven(str)\n strnew = \"\"\n for nr = 2 to len(str) step 2\n strnew = strnew + str[nr]\n next\n lsteven = []\n for p = 1 to len(strnew)\n add(lsteven, string(2*number(strnew[p])))\n next\n arreven = list(len(lsteven))\n for q = 1 to len(lsteven)\n sum = 0\n for w = 1 to len(lsteven[q])\n sum = sum + lsteven[q][w]\n next\n arreven[q] = sum\n next\n sumarr = 0\n for x = 1 to len(arreven)\n sumarr = sumarr + arreven[x]\n next\n return sumarr\n","language":"Ring"},{"code":"RE = /\\A[A-Z]{2}[A-Z0-9]{9}[0-9]{1}\\z/\n\ndef valid_isin?(str)\n return false unless str =~ RE\n luhn(str.chars.map{|c| c.to_i(36)}.join)\nend\n\np %w(US0378331005\nUS0373831005\nU50378331005\nUS03378331005\nAU0000XVGZA3\nAU0000VXGZA3\nFR0000988040).map{|tc| valid_isin?(tc) }\t\n\n# => [true, false, false, false, true, true, true]\n","language":"Ruby"},{"code":"extern crate luhn_cc;\n\nuse luhn_cc::compute_luhn;\n\nfn main() {\n assert_eq!(validate_isin(\"US0378331005\"), true);\n assert_eq!(validate_isin(\"US0373831005\"), false);\n assert_eq!(validate_isin(\"U50378331005\"), false);\n assert_eq!(validate_isin(\"US03378331005\"), false);\n assert_eq!(validate_isin(\"AU0000XVGZA3\"), true);\n assert_eq!(validate_isin(\"AU0000VXGZA3\"), true);\n assert_eq!(validate_isin(\"FR0000988040\"), true);\n}\n\nfn validate_isin(isin: &str) -> bool {\n // Preliminary checks to avoid working on non-ASCII stuff\n if !isin.chars().all(|x| x.is_alphanumeric()) || isin.len() != 12 {\n return false;\n }\n if !isin[..2].chars().all(|x| x.is_alphabetic())\n || !isin[2..12].chars().all(|x| x.is_alphanumeric())\n || !isin.chars().last().unwrap().is_numeric()\n {\n return false;\n }\n\n // Converts the alphanumeric string in a numeric-only string\n let bytes = isin.as_bytes();\n\n let s2 = bytes.iter()\n .flat_map(|&c| {\n if c.is_ascii_digit() {\n vec![c]\n }\n else {\n (c + 10 - ('A' as u8)).to_string().into_bytes()\n }\n }).collect::<Vec<u8>>();\n\n let string = std::str::from_utf8(&s2).unwrap();\n let number = string.parse::<usize>().unwrap();\n\n return compute_luhn(number);\n}\n","language":"Rust"},{"code":"data test;\nlength isin $20 ok $1;\ninput isin;\nkeep isin ok;\narray s{24};\nlink isin;\nreturn;\nisin:\nok=\"N\";\nn=length(isin);\nif n=12 then do;\n j=0;\n do i=1 to n;\n k=rank(substr(isin,i,1));\n if k>=48 & k<=57 then do;\n if i<3 then return;\n j+1;\n s{j}=k-48;\n end;\n else if k>=65 & k<=90 then do;\n if i=12 then return;\n k+-55;\n j+1;\n s{j}=int(k/10);\n j+1;\n s{j}=mod(k,10);\n end;\n else return;\n end;\n\n v=sum(of s{*});\n do i=j-1 to 1 by -2;\n v+s{i}-9*(s{i}>4);\n end;\n\nif mod(v,10)=0 then ok=\"Y\";\nend;\nreturn;\ncards;\nUS0378331005\nUS0373831005\nU50378331005\nUS03378331005\nAU0000XVGZA3\nAU0000VXGZA3\nFR0000988040\n;\nrun;\n","language":"SAS"},{"code":"object Isin extends App {\n val isins = Seq(\"US0378331005\", \"US0373831005\", \"U50378331005\",\n \"US03378331005\", \"AU0000XVGZA3\",\"AU0000VXGZA3\", \"FR0000988040\")\n\n private def ISINtest(isin: String): Boolean = {\n val isin0 = isin.trim.toUpperCase\n\n def luhnTestS(number: String): Boolean = {\n\n def luhnTestN(digits: Seq[Int]): Boolean = {\n\n def checksum(digits: Seq[Int]): Int = {\n digits.reverse.zipWithIndex\n .foldLeft(0) {\n case (sum, (digit, i)) =>\n if (i % 2 == 0) sum + digit\n else sum + (digit * 2) / 10 + (digit * 2) % 10\n } % 10\n }\n\n checksum(digits) == 0\n }\n\n luhnTestN(number.map { c =>\n assert(c.isDigit, s\"$number has a non-digit error\")\n c.asDigit\n })\n }\n\n if (!isin0.matches(\"^[A-Z]{2}[A-Z0-9]{9}\\\\d$\")) false\n else {\n val sb = new StringBuilder\n for (c <- isin0.substring(0, 12)) sb.append(Character.digit(c, 36))\n luhnTestS(sb.toString)\n }\n }\n\n isins.foreach(isin => println(f\"$isin is ${if (ISINtest(isin)) \"\" else \"not\"}%s valid\"))\n\n}\n","language":"Scala"},{"code":"--#SET TERMINATOR @\n\nSET SERVEROUTPUT ON @\n\nCREATE OR REPLACE FUNCTION VALIDATE_ISIN (\n IN IDENTIFIER VARCHAR(12)\n ) RETURNS SMALLINT\n -- ) RETURNS BOOLEAN\n BEGIN\n DECLARE CHECKSUM_FUNC CHAR(1);\n DECLARE CONVERTED VARCHAR(24);\n DECLARE I SMALLINT;\n DECLARE LENGTH SMALLINT;\n DECLARE RET SMALLINT DEFAULT 1;\n --DECLARE RET BOOLEAN DEFAULT FALSE;\n DECLARE CHAR_AT CHAR(1);\n DECLARE INVALID_CHAR CONDITION FOR SQLSTATE 'ISIN1';\n\n SET CHAR_AT = SUBSTR(IDENTIFIER, 1, 1);\n IF (ASCII(CHAR_AT) < 65 OR 90 < ASCII(CHAR_AT)) THEN\n SIGNAL INVALID_CHAR SET MESSAGE_TEXT = 'Country code with invalid characters';\n END IF;\n SET CHAR_AT = SUBSTR(IDENTIFIER, 2, 1);\n IF (ASCII(CHAR_AT) < 65 OR 90 < ASCII(CHAR_AT)) THEN\n SIGNAL INVALID_CHAR SET MESSAGE_TEXT = 'Country code with invalid characters';\n END IF;\n\n -- Convert letters to numbers.\n SET I = 1;\n SET CONVERTED = '';\n SET LENGTH = LENGTH(IDENTIFIER);\n WHILE (I <= LENGTH) DO\n SET CHAR_AT = SUBSTR(IDENTIFIER, I, 1);\n IF (48 <= ASCII(CHAR_AT) AND ASCII(CHAR_AT) <= 57) THEN\n SET CONVERTED = CONVERTED || CHAR_AT;\n ELSE\n SET CONVERTED = CONVERTED || (ASCII(CHAR_AT) - 55);\n END IF;\n SET I = I + 1;\n END WHILE;\n\n CALL DBMS_OUTPUT.PUT_LINE(CONVERTED);\n\n -- This function is implemented in Rosetta code.\n SET CHECKSUM_FUNC = LUHN_TEST(CONVERTED);\n IF (CHECKSUM_FUNC = 0) THEN\n SET RET = 0;\n --SET RET = TRUE;\n END IF;\n\n RETURN RET;\n END @\n","language":"SQL-PL"},{"code":"package require Tcl 8.6 ;# mostly needed for [assert]. Substitute a simpler one or a NOP if required.\n","language":"Tcl"},{"code":"proc assert {expr} { ;# for \"static\" assertions that throw nice errors\n if {![uplevel 1 [list expr $expr]]} {\n set msg \"{$expr}\"\n catch {append msg \" {[uplevel 1 [list subst -noc $expr]]}\"}\n tailcall throw {ASSERT ERROR} $msg\n }\n}\n","language":"Tcl"},{"code":"namespace eval isin {\n proc _init {} { ;# sets up the map used on every call\n variable map\n set alphabet abcdefghijklmnopqrstuvwxyz\n set n 9\n lmap c [split $alphabet \"\"] {\n lappend map $c [incr n]\n }\n }\n _init\n\n proc normalize {isin} {\n variable map\n string map $map [string tolower [string trim $isin]]\n }\n\n # copied from \"Luhn test of credit card numbers\"\n # included here for ease of testing, and because it is short\n proc luhn digitString {\n if {[regexp {[^0-9]} $digitString]} {error \"not a number\"}\n set sum 0\n set flip 1\n foreach ch [lreverse [split $digitString {}]] {\n incr sum [lindex {\n {0 1 2 3 4 5 6 7 8 9}\n {0 2 4 6 8 1 3 5 7 9}\n } [expr {[incr flip] & 1}] $ch]\n }\n return [expr {($sum % 10) == 0}]\n }\n\n proc validate {isin} {\n if {![regexp {^[A-Z]{2}[A-Z0-9]{9}[0-9]$} $isin]} {return false}\n luhn [normalize $isin]\n }\n\n}\n","language":"Tcl"},{"code":"package require tcltest\n\ntcltest::test isin-1 \"Test isin validation\" -body {\n foreach {isin ok} {\n US0378331005 yes\n US0373831005 no\n U50378331005 no\n US03378331005 no\n AU0000XVGZA3 yes\n AU0000VXGZA3 yes\n FR0000988040 yes\n } {\n if {$ok} {\n assert {[isin::validate $isin]}\n } else {\n assert {![isin::validate $isin]}\n }\n }\n return ok\n} -result ok\n","language":"Tcl"},{"code":"CREATE FUNCTION dbo._ISINCheck( @strISIN VarChar(40) )\nRETURNS bit\nAS\nBEGIN\n--*** Test an ISIN code and return 1 if it is valid, 0 if invalid.\nDECLARE @bValid\t bit;\n\nSET @bValid = CASE WHEN @strISIN LIKE '[A-Z][A-Z][A-Z,0-9][A-Z,0-9][A-Z,0-9][A-Z,0-9][A-Z,0-9][A-Z,0-9][A-Z,0-9][A-Z,0-9][A-Z,0-9][0-9]' THEN 1 ELSE 0 END\nIF @bValid = 1\n\tBEGIN\n\t\tDECLARE @strTest VarChar(40) = '';\n\t\tDECLARE @strAdd VarChar(2);\n\t\tDECLARE @p INT = 0;\n\t\tWHILE @p < LEN(@strISIN)\n\t\t\tBEGIN\n\t\t\t\tSET @p = @p+1;\n\t\t\t\tSET @strAdd = SUBSTRING(@strISIN,@p,1);\n\t\t\t\tIF @strAdd LIKE '[A-Z]' SET @strAdd = CONVERT(VarChar(2),ASCII(UPPER(@strAdd))-55);\n\t\t\t\tSET @strTest = @strTest + @strAdd;\n\t\t\tEND;\n\n\t\t-- Proceed with Luhn test\n\t\tDECLARE @strLuhn VarChar(40) = REVERSE(@strTest); -- usage: set once, never changed\n\t\tDECLARE @strS2Values VarChar(10) = '0246813579'; -- constant: maps digits to their S2 summed values\n\t\tSET @p = 0; -- reset loop counter\n\t\tDECLARE @intValue INT;\n\t\tDECLARE @intSum\tINT = 0;\n\t\t-- loop through the reversed string, get the value (even-positioned digits are mapped) and add it to @intSum\n\t\tWHILE @p < LEN(@strLuhn)\n\t\t\tBEGIN\n\t\t\t\tSET @p = @p+1;\n\t\t\t\tSET @intValue = CONVERT(INT, SUBSTRING(@strLuhn,@p,1) ) -- value of the digit at position @p in the string\n\t\t\t\tIF @p % 2 = 0\tSET @intValue = CONVERT(INT,SUBSTRING(@strS2Values,@intValue+1,1))\n\t\t\t\tSET @intSum = @intSum + @intValue\n\t\t\tEND\n\t\t-- If the of the digits' mapped values ends in 0 (modulo 10 = 0) then the Luhn test succeeds\n\t\tSET @bValid = CASE WHEN @intSum % 10 = 0 THEN 1 ELSE 0 END\n\tEND;\n\nRETURN @bValid\nEND\n","language":"Transact-SQL"},{"code":"-- Testing. The following tests all pass.\n;WITH ISIN_Tests AS\n( SELECT 'US0378331005' AS ISIN, 1 Expected\n UNION SELECT 'US0373831005',0\n UNION SELECT 'U50378331005',0\n UNION SELECT 'US03378331005',0\n UNION SELECT 'AU0000XVGZA3',1\n UNION SELECT 'AU0000VXGZA3',1\n UNION SELECT 'FR0000988040',1\n UNION SELECT '0___garbage',0\n UNION SELECT '',0\n)\nSELECT ISIN, Expected, dbo._ISINCheck(ISIN) AS TestResult FROM ISIN_Tests ORDER BY ISIN\n","language":"Transact-SQL"},{"code":"import regex\n\nconst (\n inc = [\n [0, 1, 2, 3, 4, 5, 6, 7, 8, 9],\n [0, 2, 4, 6, 8, 1, 3, 5, 7, 9],\n ]\n)\n\nfn valid_isin(n string) bool {\n mut r,_,_ := regex.regex_base('^[A-Z]{2}[A-Z0-9]{9}\\d$')\n if !r.matches_string(n) {\n return false\n }\n mut sum := 0\n mut p := 0\n for i := 10; i >= 0; i-- {\n p = 1 - p\n mut d := n[i..i+1].int()\n if d < 'A'.int() {\n sum += inc[p][d-'0'.int()]\n } else {\n d -= 'A'.int()\n sum += inc[p][d%10]\n p = 1 - p\n sum += inc[p][d/10+1]\n }\n }\n sum += n[11..12].int() - '0'.int()\n return sum%10 == 0\n}\n\nstruct Testcases {\n isin string\n valid bool\n}\n\nfn main(){\n testcases := [\n Testcases{\"US0378331005\", true},\n Testcases{\"US0373831005\", false},\n Testcases{\"U50378331005\", false},\n Testcases{\"US03378331005\", false},\n Testcases{\"AU0000XVGZA3\", true},\n Testcases{\"AU0000VXGZA3\", true},\n Testcases{\"FR0000988040\", true},\n ]\n\n for testcase in testcases {\n actual := valid_isin(testcase.isin)\n if actual != testcase.valid {\n println(\"expected ${testcase.valid} for ${testcase.isin}, got $actual\")\n }\n }\n}\n","language":"V-(Vlang)"},{"code":"' Validate International Securities Identification Number - 03/03/2019\n\nbuf=buf&test(\"US0378331005\")&vbCrLf\nbuf=buf&test(\"US0373831005\")&vbCrLf\nbuf=buf&test(\"U50378331005\")&vbCrLf\nbuf=buf&test(\"US03378331005\")&vbCrLf\nbuf=buf&test(\"AU0000XVGZA3\")&vbCrLf\nbuf=buf&test(\"AU0000VXGZA3\")&vbCrLf\nbuf=buf&test(\"FR0000988040\")&vbCrLf\nmsgbox buf,,\"Validate International Securities Identification Number\"\n\nfunction test(cc)\n\tdim err,c,r,s,i1,i2\n\tif len(cc)=12 then\n\t\tfor i=1 to len(cc)\n\t\t\tp=instr(\"0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZ\",mid(cc,i,1))\n\t\t\tif p<>0 then c=c&(p-1) else err=1\n\t\tnext 'i\n\t\tfor i=1 to 2\n\t\t\tif instr(\"ABCDEFGHIJKLMNOPQRSTUVWXYZ\",mid(cc,i,1))=0 then err=1\n\t\tnext 'i\n\t\tif err=0 then\n\t\t\tfor i=len(c) to 1 step -1\n\t\t\t\tr=r&mid(c,i,1)\n\t\t\tnext 'i\n\t\t\tfor i=1 to len(r) step 2\n\t\t\t\ti1=i1+cint(mid(r,i,1))\n\t\t\tnext 'i\n\t\t\tfor i=2 to len(r) step 2\n\t\t\t\tii=cint(mid(r,i,1))*2\n\t\t\t\tif ii>=10 then ii=ii-9\n\t\t\t\ti2=i2+ii\n\t\t\tnext 'i\n\t\t\ts=cstr(i1+i2)\n\t\t\tif mid(s,len(s),1)=\"0\" then\n\t\t\t\tmsg=\"valid\"\n\t\t\telse\n\t\t\t\tmsg=\"invalid ??1\"\n\t\t\tend if\n\t\telse\n\t\t\tmsg=\"invalid ??2\"\n\t\tend if\n\telse\n\t\tmsg=\"invalid ??3\"\n\tend if\n\ttest=cc&\" \"&msg\nend function 'test\n","language":"VBScript"},{"code":"Function IsValidISIN(ByVal ISIN As String) As Boolean\nDim s As String, c As String\nDim i As Long\n If Len(ISIN) = 12 Then\n For i = 1 To Len(ISIN)\n c = UCase$(Mid(ISIN, i, 1))\n Select Case c\n Case \"A\" To \"Z\"\n If i = 12 Then Exit Function\n s = s & CStr(Asc(c) - 55)\n Case \"0\" To \"9\"\n If i < 3 Then Exit Function\n s = s & c\n Case Else\n Exit Function\n End Select\n Next i\n IsValidISIN = LuhnCheckPassed(s)\n End If\nEnd Function\n","language":"Visual-Basic"},{"code":"Sub Main()\n Debug.Assert IsValidISIN(\"US0378331005\")\n Debug.Assert Not IsValidISIN(\"US0373831005\")\n Debug.Assert Not IsValidISIN(\"U50378331005\")\n Debug.Assert Not IsValidISIN(\"US03378331005\")\n Debug.Assert IsValidISIN(\"AU0000XVGZA3\")\n Debug.Assert IsValidISIN(\"AU0000VXGZA3\")\n Debug.Assert IsValidISIN(\"FR0000988040\")\n Debug.Assert Not IsValidISIN(\"FR000098804O\")\nEnd Sub\n","language":"Visual-Basic"},{"code":"Option Strict On\nImports System.Text.RegularExpressions\n\nModule Module1\n ReadOnly IsinRegex As New Regex(\"^[A-Z]{2}[A-Z0-9]{9}\\d$\", RegexOptions.Compiled)\n\n Function DigitValue(c As Char) As Integer\n Dim temp As Integer\n If Asc(c) >= Asc(\"0\"c) AndAlso Asc(c) <= Asc(\"9\"c) Then\n temp = Asc(c) - Asc(\"0\"c)\n Else\n temp = Asc(c) - Asc(\"A\"c) + 10\n End If\n Return temp\n End Function\n\n Function LuhnTest(number As String) As Boolean\n Return number.Select(Function(c, i) (AscW(c) - 48) << ((number.Length - i - 1) And 1)).Sum(Function(n) If(n > 9, n - 9, n)) Mod 10 = 0\n End Function\n\n Function Digitize(isin As String) As String\n Return String.Join(\"\", isin.Select(Function(c) $\"{DigitValue(c)}\"))\n End Function\n\n Function IsValidIsin(isin As String) As Boolean\n Return IsinRegex.IsMatch(isin) AndAlso LuhnTest(Digitize(isin))\n End Function\n\n Sub Main()\n Dim isins() = {\n \"US0378331005\",\n \"US0373831005\",\n \"U50378331005\",\n \"US03378331005\",\n \"AU0000XVGZA3\",\n \"AU0000VXGZA3\",\n \"FR0000988040\"\n }\n\n For Each isin In isins\n If IsValidIsin(isin) Then\n Console.WriteLine(\"{0} is valid\", isin)\n Else\n Console.WriteLine(\"{0} is not valid\", isin)\n End If\n Next\n End Sub\n\nEnd Module\n","language":"Visual-Basic-.NET"},{"code":"import \"./str\" for Char\nimport \"./iterate\" for Stepped\nimport \"./fmt\" for Conv, Fmt\n\nvar luhn = Fn.new { |s|\n s = s[-1..0]\n var s1 = Stepped.new(s, 2).reduce(0) { |sum, d| sum + d.bytes[0] - 48 }\n var s2 = Stepped.new(s[1..-1], 2).reduce(0) { |sum, d|\n var d2 = (d.bytes[0] - 48) * 2\n return sum + ((d2 > 9) ? d2%10 + 1 : d2)\n }\n return (s1 + s2)%10 == 0\n}\n\nvar isin = Fn.new { |s|\n if (!(s is String && s.count == 12)) return false\n for (i in 0..11) {\n var c = s[i]\n if (i <= 1) {\n if (!Char.isUpper(c)) return false\n } else if (i >= 2 && i <= 10) {\n if (!Char.isUpper(c) && !Char.isDigit(c)) return false\n } else {\n if (!Char.isDigit(c)) return false\n }\n }\n var dec = \"\"\n for (i in 0...s.count) dec = dec + \"%(Conv.atoi(s[i], 36))\"\n return luhn.call(dec)\n}\n\nvar tests = [\n \"US0378331005\", \"US0373831005\", \"U50378331005\", \"US03378331005\",\n \"AU0000XVGZA3\", \"AU0000VXGZA3\", \"FR0000988040\"\n]\n\nfor (test in tests) {\n var ans = (isin.call(test)) ? \"valid\" : \"not valid\"\n System.print(\"%(Fmt.s(-13, test)) -> %(ans)\")\n}\n","language":"Wren"},{"code":"string 0; \\use zero-terminated strings\n\nfunc Luhn(Str); \\Return 'true' if digits in Str pass Luhn test\nchar Str;\nint Len, Sum, I, Dig;\n[Len:= 0; \\find length of Str\nwhile Str(Len) do Len:= Len+1;\nSum:= 0; \\sum even and odd digits\nfor I:= 0 to Len-1 do \\(no need to reverse)\n [if (I xor Len) & 1 then\n Sum:= Sum + Str(I) - ^0\n else [Dig:= Str(I) - ^0;\n Dig:= Dig*2;\n Sum:= Sum + Dig/10 + rem(0);\n ];\n ];\nreturn rem(Sum/10) = 0;\n]; \\Luhn\n\nfunc Valid(Str); \\Return 'true' if valid ISIN code\nchar Str, Str2(100);\nint Sum, I, J, C, V;\n[J:= 0;\nfor I:= 0 to 12-1 do \\convert letters in Str to digits in Str2\n [C:= Str(I);\n case of\n C>=^0 & C<=^9: [Str2(J):= C; J:= J+1];\n C>=^A & C<=^Z: [Str2(J):= (C-^A+10)/10 + ^0; J:= J+1;\n Str2(J):= rem(0) + ^0; J:= J+1]\n other return false;\n if I=1 & J#4 then return false; \\first two chars not letters\n ];\nif Str(I) # 0 then return false; \\too long\nStr2(J):= 0; \\terminate string\nreturn Luhn(Str2);\n]; \\Valid\n\nint ISIN, N;\n[ISIN:= [\"US0378331005\",\n \"US0373831005\",\n \"U50378331005\",\n \"US03378331005\",\n \"AU0000XVGZA3\",\n \"AU0000VXGZA3\",\n \"FR0000988040\"];\nfor N:= 0 to 7-1 do\n [Text(0, ISIN(N));\n Text(0, if Valid(ISIN(N))\n then \" is valid\"\n else \" is not valid\");\n CrLf(0);\n ];\n]\n","language":"XPL0"},{"code":"sub luhntest(cardnr$)\n local i, j, s1, s2, l\n\n cardnr$ = Trim$(cardnr$) // remove spaces\n\n l = Len(cardnr$)\n\n // sum odd numbers\n For i = l To 1 Step -2\n s1 = s1 + (asc(mid$(cardnr$, i, 1)) - Asc(\"0\"))\n Next\n // sum even numbers\n For i = l-1 To 1 Step -2\n j = asc(mid$(cardnr$, i, 1)) - Asc(\"0\")\n j = j * 2\n If j > 9 j = mod(j, 10) + 1\n s2 = s2 + j\n Next\n\n return mod(s1 + s2, 10) = 0\nEnd sub\n\n// ------=< MAIN >=-----\n\ndata \"US0378331005\", \"US0373831005\", \"U50378331005\", \"US03378331005\", \"AU0000XVGZA3\", \"AU0000VXGZA3\", \"FR0000988040\", \"\"\n\ndo\n read test_item$\n if test_item$ = \"\" break\n\n l = Len(test_item$)\n If l <> 12 Then\n Print test_item$, \" Invalid, length <> 12 char.\"\n Continue\n End If\n c1$ = mid$(test_item$, 1, 1) : c2$ = mid$(test_item$, 2, 1)\n If c1$ < \"A\" Or c1$ > \"Z\" or c2$ < \"A\" or c2$ > \"Z\" Then\n Print test_item$, \" Invalid, number needs to start with 2 characters\"\n Continue\n End If\n test_str$ = \"\"\n For n = 1 To l\n x = asc(mid$(test_item$, n, 1)) - Asc(\"0\")\n // if is a letter we to correct for that\n If x > 9 x = x - 7\n If x < 10 Then\n test_str$ = test_str$ + Str$(x)\n Else // two digest number\n test_str$ = test_str$ + Str$(int(x / 10)) + Str$(mod(x, 10))\n End If\n Next\n Print test_item$;\n if luhntest(test_str$) then print \" Valid\" else print \" Invalid, checksum error\" end if\nloop\n","language":"Yabasic"},{"code":"fcn validateISIN(isin){\n RegExp(String(\"^\",\"[A-Z]\"*2,\"[A-Z0-9]\"*9,\"[0-9]$\")).matches(isin) and\n luhnTest(isin.split(\"\").apply(\"toInt\",36).concat().toInt())\n}\nfcn luhnTest(n){\n 0 == (n.split().reverse().reduce(fcn(s,n,clk){\n s + if(clk.inc()%2) n else 2*n%10 + n/5 },0,Ref(1)) %10)\n}\n","language":"Zkl"},{"code":"println(\" ISIN Valid?\");\nforeach isin in (T(\"US0378331005\",\"US0373831005\",\"U50378331005\",\n\t \"US03378331005\",\"AU0000XVGZA3\",\"AU0000VXGZA3\",\"FR0000988040\")){\n println(isin,\" --> \",validateISIN(isin));\n}\n","language":"Zkl"}],"string":"[\n {\n \"code\": \"---\\nfrom: http://rosettacode.org/wiki/Validate_International_Securities_Identification_Number\\n\",\n \"language\": \"00-META\"\n },\n {\n \"code\": \"An [[wp:International_Securities_Identification_Number|International Securities Identification Number]] (ISIN) is a unique international identifier for a financial security such as a stock or bond. \\n\\n\\n;Task:\\nWrite a function or program that takes a string as input, and checks whether it is a valid ISIN.\\n\\nIt is only valid if it has the correct format, ''and'' the embedded checksum is correct.\\n\\nDemonstrate that your code passes the test-cases listed below.\\n\\n\\n;Details:\\nThe format of an ISIN is as follows:\\n\\n<!-- BEGIN DIAGRAM -->\\n<div style=\\\"margin:3em; white-space:nowrap; line-height:20px\\\">\\n<div><span style=\\\"font-size:20px; font-family:'Lucida Console',Monaco,monospace\\\"><span style=\\\"color:green; margin:0 0 0 10px\\\">┌───────────── </span></span><span style=\\\"color:green\\\">a 2-character ISO country code (A-Z)</span></div>\\n<div><span style=\\\"font-size:20px; font-family:'Lucida Console',Monaco,monospace\\\"><span style=\\\"color:green; margin:0 -10px 0 10px\\\">│</span> <span style=\\\"color:blue; margin:0 0 0 10px\\\">┌─────────── </span></span><span style=\\\"color:blue\\\">a 9-character security code (A-Z, 0-9)</span></div>\\n<div><span style=\\\"font-size:20px; font-family:'Lucida Console',Monaco,monospace\\\"><span style=\\\"color:green; margin:0 -10px 0 10px\\\">│</span> <span style=\\\"color:blue; margin:0 -5px 0 10px\\\">│</span> <span style=\\\"color:red; margin:0 0 0 5px\\\">┌── </span></span><span style=\\\"color:red\\\">a checksum digit (0-9)</span></div>\\n<div style=\\\"font-size:20px; font-family:'Lucida Console',Monaco,monospace\\\"><span style=\\\"background: #d9ebd9; color:green; border:solid 1px green; margin:0 1px\\\">AU</span><span style=\\\"background:#e0e0ff; color:blue; border:solid 1px blue; margin:0 1px\\\">0000XVGZA</span><span style=\\\"background:#feefef; color:red; border:solid 1px red; margin:0 1px\\\">3</span></div>\\n</div>\\n<!-- END DIAGRAM -->\\n\\n\\nFor this task, you may assume that any 2-character alphabetic sequence is a valid country code.\\n\\nThe checksum can be validated as follows:\\n# '''Replace letters with digits''', by converting each character from base 36 to base 10, e.g. <code>AU0000XVGZA3</code> →<code>1030000033311635103</code>.\\n# '''Perform the Luhn test on this base-10 number.'''<br>There is a separate task for this test: ''[[Luhn test of credit card numbers]]''.<br>You don't have to replicate the implementation of this test here ─── you can just call the existing function from that task. (Add a comment stating if you did this.)\\n\\n\\n;Test cases:\\n:::: {| class=\\\"wikitable\\\"\\n! ISIN\\n! Validity\\n! Comment\\n|-\\n| <tt>US0378331005</tt> || valid || \\n|-\\n| <tt>US0373831005</tt> || not valid || The transposition typo is caught by the checksum constraint.\\n|-\\n| <tt>U50378331005</tt> || not valid || The substitution typo is caught by the format constraint.\\n|-\\n| <tt>US03378331005</tt> || not valid || The duplication typo is caught by the format constraint.\\n|-\\n| <tt>AU0000XVGZA3</tt> || valid || \\n|-\\n| <tt>AU0000VXGZA3</tt> || valid || Unfortunately, not ''all'' transposition typos are caught by the checksum constraint.\\n|-\\n| <tt>FR0000988040</tt> || valid || \\n|}\\n\\n(The comments are just informational. Your function should simply return a Boolean result. See [[#Raku]] for a reference solution.)\\n\\n\\nRelated task:\\n* [[Luhn test of credit card numbers]]\\n\\n\\n;Also see:\\n* [https://www.isincodes.net/validate-isin/ Interactive online ISIN validator]\\n* Wikipedia article: [[wp:International_Securities_Identification_Number|International Securities Identification Number]]\\n<br><br>\\n\\n\",\n \"language\": \"00-TASK\"\n },\n {\n \"code\": \"F check_isin(a)\\n I a.len != 12\\n R 0B\\n [Int] s\\n L(c) a\\n I c.is_digit()\\n I L.index < 2\\n R 0B\\n s.append(c.code - 48)\\n E I c.is_uppercase()\\n I L.index == 11\\n R 0B\\n V (d, m) = divmod(c.code - 55, 10)\\n s [+]= [d, m]\\n E\\n R 0B\\n V v = sum(s[((len)-1..).step(-2)])\\n L(=k) s[((len)-2..).step(-2)]\\n k = 2 * k\\n v += I k > 9 {k - 9} E k\\n R v % 10 == 0\\n\\nprint([‘US0378331005’, ‘US0373831005’, ‘U50378331005’, ‘US03378331005’,\\n ‘AU0000XVGZA3’, ‘AU0000VXGZA3’, ‘FR0000988040’].map(s -> check_isin(s)))\\n\",\n \"language\": \"11l\"\n },\n {\n \"code\": \"* Validate ISIN 08/03/2019\\nVALISIN CSECT\\n USING VALISIN,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 R7,1 j=1\\n DO WHILE=(C,R7,LE,=A(NN)) do j=1 to hbound(tt)\\n LR R1,R7 j\\n SLA R1,4 ~\\n LA R4,TT-16(R1) @tt(j)\\n MVC CC,0(R4) cc=tt(j)\\n MVC C,=CL28' ' c=' '\\n MVC R,=CL28' ' r=' '\\n MVI ERR,X'00' err=false\\n MVC LCC,=F'0' lcc=0\\n LA R1,L'CC i=length(cc)\\nLENTRIA LA R5,CC-1 @cc\\n AR R5,R1 +i\\n CLI 0(R5),C' ' if cc[i]=' '\\n BE LENTRIB then iterate loop\\n ST R1,LCC lcc=lentrim(cc)\\n B LENTRIC leave loop\\nLENTRIB BCT R1,LENTRIA i--; if i<>0 then loop\\nLENTRIC L R4,LCC lcc\\n IF CH,R4,EQ,=H'12' THEN if lcc=12 then\\n MVC LC,=F'0' lc=0\\n MVC WW,=CL28' ' ww=''\\n LA R10,WW @ww\\n LA R6,1 i=1\\n DO WHILE=(C,R6,LE,LCC) do i=1 to lcc\\n LA R4,CC-1 @cc\\n AR R4,R6 +i\\n MVC CI(1),0(R4) ci=substr(cc,i,1)\\n LA R2,BASE36 @base36\\n LA R3,L'BASE36 length(base36)\\n BAL R14,INDEX r0=index(base36,ci)\\n IF LTR,R0,NZ,R0 THEN if p<>0 then\\n LR R1,R0 ip\\n BCTR R1,0 -1\\n XDECO R1,XDEC str(ip-1)\\n MVC 0(2,R10),XDEC+10 ww=ww||str(p-1)\\n ELSE , else\\n MVI ERR,X'FF' err=true\\n ENDIF , endif\\n LA R10,2(R10) @ww+=2\\n LA R6,1(R6) i++\\n ENDDO , enddo i\\n MVC C,=CL28' ' c=''\\n LA R8,WW @ww\\n LA R9,C @c\\n LA R10,0 length(c)\\n LA R6,1 i=1\\n DO WHILE=(C,R6,LE,=A(L'WW)) do i=1 to length(ww)\\n IF CLI,0(R8),NE,C' ' THEN if ww[i]<>' ' then\\n MVC 0(1,R9),0(R8) c=ww[i]\\n LA R9,1(R9) @c++\\n LA R10,1(R10) length(c)++\\n ENDIF , endif\\n LA R8,1(R8) @ww++\\n LA R6,1(R6) i++\\n ENDDO , enddo i\\n ST R10,LC lc=length(c)\\n LA R6,1 i=1\\n DO WHILE=(CH,R6,LE,=H'2') do i=1 to 2\\n LA R4,CC-1 @cc\\n AR R4,R6 +i\\n MVC CI(1),0(R4) ci=substr(cc,i,1)\\n LA R2,ALPHA @alpha\\n LA R3,L'ALPHA length(alpha)\\n BAL R14,INDEX r0=index(alpha,ci)\\n IF LTR,R0,Z,R0 THEN if index(alpha,ci)=0 then\\n MVI ERR,X'FF' err=true\\n ENDIF , endif\\n LA R6,1(R6) i++\\n ENDDO , enddo i\\n SR R8,R8 i1=0\\n SR R9,R9 i2=0\\n IF CLI,ERR,EQ,X'00' THEN if not err then\\n SR R0,R0 0\\n L R6,LC i=lc\\n MVC R,=CL28' ' r=''\\n LA R10,C @c\\n LA R11,R-1 @r\\n A R11,LC @r=@r+length(strip((c))\\n DO WHILE=(CH,R6,GE,=H'1') do i=lc to 1 step -1\\n MVC 0(1,R11),0(R10) r[k]=c[i]\\n BCTR R11,0 @r--\\n LA R10,1(R10) @c++\\n BCTR R6,0 i--\\n ENDDO , enddo i\\n LA R6,1 i=1\\n DO WHILE=(C,R6,LE,LC) do i=1 to lc step 2\\n LA R4,R-1 @r\\n AR R4,R6 +i\\n MVC CI(1),0(R4) ci=substr(r,i,1)\\n MVC XDEC,=CL12' ' ~\\n MVC XDEC(L'CI),CI ci\\n XDECI R2,XDEC int(ci)\\n AR R8,R2 i1=i1+int(ci)\\n LA R6,2(R6) i+=2\\n ENDDO , enddo i\\n LA R6,2 i=2\\n DO WHILE=(C,R6,LE,LC) do i=2 to lc step 2\\n LA R4,R-1 @r\\n AR R4,R6 +i\\n MVC CI(1),0(R4) ci=substr(r,i,1)\\n MVC XDEC,=CL12' ' ~\\n MVC XDEC(L'CI),CI ci\\n XDECI R10,XDEC int(ci)\\n SLA R10,1 ii=int(ci)*2\\n IF CH,R10,GE,=H'10' THEN if ii>=10 then\\n SH R10,=H'9' ii=ii-9\\n ENDIF , endif\\n AR R9,R10 i2=i2+ii\\n LA R6,2(R6) i++\\n ENDDO , enddo i\\n LR R2,R8 i1\\n AR R2,R9 +i2\\n XDECO R2,XDEC s=str(i1+i2)\\n IF CLI,XDEC+11,EQ,C'0' THEN if substr(s,length(s),1)='0' then\\n MVC MSG,=CL6'OK' msg='ok'\\n ELSE , else\\n MVC MSG,=CL6'?err1' msg='?1'\\n ENDIF , endif\\n ELSE , else\\n MVC MSG,=CL6'?err2' msg='?2'\\n ENDIF , endif\\n ELSE , else\\n MVC MSG,=CL6'?err3' msg='?3'\\n ENDIF , endif\\n XDECO R7,XDEC edit j\\n MVC PG(2),XDEC+10 j\\n MVC PG+3(16),CC cc\\n MVC PG+20(6),MSG msg\\n XPRNT PG,L'PG print buffer\\n LA R7,1(R7) j++\\n ENDDO , enddo j\\n L R13,4(0,R13) restore previous savearea pointer\\n RETURN (14,12),RC=0 restore registers from calling sav\\nMVCX MVC 0(0,R4),0(R5) pattern svc\\nINDEX SR R0,R0 index(r2,ci) r3=len\\n LA R1,1 k=1\\nSINDEXA CR R1,R3 do k=1 to length(ca)\\n BH SINDEXC ~\\n CLC 0(1,R2),CI if ca[k]=ci\\n BNE SINDEXB then iterate loop\\n LR R0,R1 ii=k\\n B SINDEXC exit loop\\nSINDEXB LA R2,1(R2) @ca++\\n LA R1,1(R1) k++\\n B SINDEXA enddo\\nSINDEXC BR R14 end index\\nNN EQU (BASE36-TT)/16 number of items\\nTT DC CL16'US0378331005',CL16'US0373831005'\\n DC CL16'U50378331005',CL16'US03378331005'\\n DC CL16'AU0000XVGZA3',CL16'AU0000VXGZA3'\\n DC CL16'FR0000988040'\\nBASE36 DC CL36'0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZ'\\nALPHA DC CL26'ABCDEFGHIJKLMNOPQRSTUVWXYZ'\\nERR DS X error\\nLCC DS F length of cc\\nLC DS F length of c\\nCI DS CL1\\nCC DS CL16 current element of tt\\nC DS CL28\\nR DS CL28\\nWW DS CL28\\nMSG DS CL6 message\\nPG DC CL80' ' buffer\\nXDEC DS CL12 temp for xdeco and xdeci\\n REGEQU\\n END VALISIN\\n\",\n \"language\": \"360-Assembly\"\n },\n {\n \"code\": \"procedure ISIN is\\n -- Luhn_Test copied from other Task\\n function Luhn_Test (Number: String) return Boolean is\\n Sum : Natural := 0;\\n Odd : Boolean := True;\\n Digit: Natural range 0 .. 9;\\n begin\\n for p in reverse Number'Range loop\\n Digit := Integer'Value (Number (p..p));\\n if Odd then\\n Sum := Sum + Digit;\\n else\\n Sum := Sum + (Digit*2 mod 10) + (Digit / 5);\\n end if;\\n Odd := not Odd;\\n end loop;\\n return (Sum mod 10) = 0;\\n end Luhn_Test;\\n\\n subtype Decimal is Character range '0' .. '9';\\n subtype Letter is Character range 'A' .. 'Z';\\n subtype ISIN_Type is String(1..12);\\n\\n -- converts a string of decimals and letters into a string of decimals\\n function To_Digits(S: String) return String is\\n -- Character'Pos('A')-Offset=10, Character'Pos('B')-Offset=11, ...\\n Offset: constant Integer := Character'Pos('A')-10;\\n\\n Invalid_Character: exception;\\n begin\\n if S = \\\"\\\" then\\n return \\\"\\\";\\n elsif S(S'First) = ' ' then -- skip blanks\\n return To_Digits(S(S'First+1 .. S'Last));\\n elsif S(S'First) in Decimal then\\n return S(S'First) & To_Digits(S(S'First+1 .. S'Last));\\n elsif S(S'First) in Letter then\\n return To_Digits(Integer'Image(Character'Pos(S(S'First))-Offset))\\n & To_Digits(S(S'First+1 .. S'Last));\\n else\\n raise Invalid_Character;\\n end if;\\n end To_Digits;\\n\\n function Is_Valid_ISIN(S: ISIN_Type) return Boolean is\\n Number : String := To_Digits(S);\\n begin\\n return S(S'First) in Letter and\\n S(S'First+1) in Letter and\\n S(S'Last) in Decimal and\\n Luhn_Test(Number);\\n end Is_Valid_ISIN;\\n\\n Test_Cases : constant Array(1..6) of ISIN_Type :=\\n (\\\"US0378331005\\\",\\n \\\"US0373831005\\\",\\n \\\"U50378331005\\\",\\n -- excluded by type with fixed length\\n -- \\\"US03378331005\\\",\\n \\\"AU0000XVGZA3\\\",\\n \\\"AU0000VXGZA3\\\",\\n \\\"FR0000988040\\\");\\nbegin\\n for I in Test_Cases'Range loop\\n Ada.Text_IO.Put_Line(Test_Cases(I) & \\\":\\\" &\\n Boolean'Image(Is_Valid_ISIN(Test_Cases(I))));\\n end loop;\\n -- using wrong length will result in an exception:\\n Ada.Text_IO.Put(\\\"US03378331005:\\\");\\n Ada.Text_IO.Put_Line(Boolean'Image(Is_Valid_Isin(\\\"US03378331005\\\")));\\nexception\\n when others =>\\n Ada.Text_IO.Put_Line(\\\"Exception occured\\\");\\nend ISIN;\\n\",\n \"language\": \"Ada\"\n },\n {\n \"code\": \"begin\\n % external procedure that returns true if ccNumber passes the Luhn test, false otherwise %\\n logical procedure LuhnTest ( string(32) value ccNumber\\n ; integer value ccLength\\n ) ; algol \\\"LUHN\\\" ;\\n\\n % returns true if isin is a valid ISIN, false otherwise %\\n logical procedure isIsin ( string(32) value isin ) ;\\n if isin( 12 // 20 ) not = \\\"\\\" then false % code is too long %\\n else begin\\n % the first two characters must be upper-case letters %\\n\\n % returns the digit corresponding to a character of an ISIN %\\n integer procedure isinDigit ( string(1) value iChar ) ;\\n if iChar >= \\\"0\\\" and iChar <= \\\"9\\\" then ( decode( iChar ) - decode( \\\"0\\\" ) )\\n else if iChar >= \\\"A\\\" and iChar <= \\\"Z\\\" then ( decode( iChar ) - decode( \\\"A\\\" ) ) + 10\\n else begin % invalid digit %\\n isValid := false;\\n -1\\n end isinDigit ;\\n\\n integer d1, d2;\\n logical isValid;\\n isValid := true;\\n d1 := isinDigit( isin( 0 // 1 ) );\\n d2 := isinDigit( isin( 1 // 1 ) );\\n if d1 < 10 or d1 > 35 or d2 < 10 or d2 > 35 then false % invalid first two characters %\\n else begin\\n % ok so far - conveet from base 36 to base 10 %\\n string(24) base10Isin;\\n integer b10Pos;\\n base10Isin := \\\"\\\";\\n b10Pos := 0;\\n for cPos := 0 until 10 do begin\\n integer digit;\\n digit := isinDigit( isin( cPos // 1 ) );\\n if isValid then begin\\n % valid digit %\\n if digit > 9 then begin\\n base10Isin( b10Pos // 1 ) := code( ( digit div 10 ) + decode( \\\"0\\\" ) );\\n b10Pos := b10Pos + 1;\\n end if_digit_gt_9 ;\\n base10Isin( b10Pos // 1 ) := code( ( digit rem 10 ) + decode( \\\"0\\\" ) );\\n b10Pos := b10Pos + 1\\n end if_isValid\\n end for_cPos ;\\n % add the check digit as is %\\n base10Isin( b10Pos // 1 ) := isin( 11 // 1 );\\n isValid and LuhnTest( base10Isin, b10Pos + 1 )\\n end\\n end isIsin ;\\n\\n % task test cases %\\n\\n procedure testIsIsin ( string(32) value isin\\n ; logical value expected\\n ) ;\\n begin\\n logical isValid;\\n isValid := isIsin( isin );\\n write( s_w := 0\\n , isin\\n , if isValid then \\\" is valid\\\" else \\\" is invalid\\\"\\n , if isValid = expected then \\\"\\\" else \\\" NOT as expected ??\\\"\\n )\\n end testIsin ;\\n\\n testIsIsin( \\\"US0378331005\\\", true );\\n testIsIsin( \\\"US0373831005\\\",\\t false );\\n testIsIsin( \\\"U50378331005\\\", false );\\n testIsIsin( \\\"US03378331005\\\", false );\\n testIsIsin( \\\"AU0000XVGZA3\\\",\\t true );\\n testIsIsin( \\\"AU0000VXGZA3\\\",\\t true );\\n testIsIsin( \\\"FR0000988040\\\",\\t true );\\nend.\\n\",\n \"language\": \"ALGOL-W\"\n },\n {\n \"code\": \"use AppleScript version \\\"2.4\\\" -- OS X 10.10 (Yosemite) or later\\nuse framework \\\"Foundation\\\"\\n\\non ISINTest(ISIN)\\n -- Check that the input is both text and 12 characters long …\\n if not ((ISIN's class is text) and ((count ISIN) is 12)) then return false\\n -- … and that it has the required format.\\n set ISIN to current application's class \\\"NSMutableString\\\"'s stringWithString:(ISIN)\\n if ((ISIN's rangeOfString:(\\\"^[A-Z]{2}[0-9A-Z]{9}[0-9]$\\\") options:(current application's NSRegularExpressionSearch) range:({0, ISIN's |length|()}))'s |length|() is 0) then return false\\n -- Replace all letters with text representations of equivalent decimal numbers in the range 10 to 35.\\n set letterCharacters to characters of \\\"ABCDEFGHIJKLMNOPQRSTUVWXYZ\\\"\\n repeat with i from 1 to 26\\n tell ISIN to replaceOccurrencesOfString:(item i of letterCharacters) withString:((i + 9) as text) options:(0) range:({0, its |length|()})\\n end repeat\\n\\n -- Apply the Luhn test handler from the \\\"Luhn test of credit card numbers\\\" task.\\n -- <https://www.rosettacode.org/wiki/Luhn_test_of_credit_card_numbers#Straightforward>\\n return luhnTest(ISIN as text)\\nend ISINTest\\n\\n-- Test code:\\nset testResults to {}\\nrepeat with ISIN in {\\\"US0378331005\\\", \\\"US0373831005\\\", \\\"U50378331005\\\", \\\"US03378331005\\\", \\\"AU0000XVGZA3\\\", \\\"AU0000VXGZA3\\\", \\\"FR0000988040\\\"}\\n set end of testResults to {testNumber:ISIN's contents, valid:ISINTest(ISIN)}\\nend repeat\\nreturn testResults\\n\",\n \"language\": \"AppleScript\"\n },\n {\n \"code\": \"{{testNumber:\\\"US0378331005\\\", valid:true}, {testNumber:\\\"US0373831005\\\", valid:false}, {testNumber:\\\"U50378331005\\\", valid:false}, {testNumber:\\\"US03378331005\\\", valid:false}, {testNumber:\\\"AU0000XVGZA3\\\", valid:true}, {testNumber:\\\"AU0000VXGZA3\\\", valid:true}, {testNumber:\\\"FR0000988040\\\", valid:true}}\\n\",\n \"language\": \"AppleScript\"\n },\n {\n \"code\": \"# syntax: GAWK -f VALIDATE_INTERNATIONAL_SECURITIES_IDENTIFICATION_NUMBER.AWK\\n# converted from Fortran\\nBEGIN {\\n for (i=0; i<=255; i++) { ord_arr[sprintf(\\\"%c\\\",i)] = i } # build array[character]=ordinal_value\\n n = split(\\\"US0378331005,US0373831005,U50378331005,US03378331005,AU0000XVGZA3,AU0000VXGZA3,FR0000988040\\\",arr,\\\",\\\")\\n for (i=1; i<=n; i++) {\\n printf(\\\"%s %s\\\\n\\\",is_isin(arr[i]),arr[i])\\n }\\n exit(0)\\n}\\nfunction is_isin(arg, i,j,k,s,v) {\\n for (i=1; i<=12; i++) { # convert to an array of digits\\n k = ord_arr[substr(arg,i,1)]\\n if (k >= 48 && k <= 57) {\\n if (i < 3) { return(0) }\\n k -= 48\\n s[++j] = k\\n } else if (k >= 65 && k <= 90) {\\n if (i == 12) { return(0) }\\n k = k - 65 + 10\\n s[++j] = int(k / 10)\\n s[++j] = k % 10\\n } else {\\n return(0)\\n }\\n }\\n for (i=j-1; i>=1; i-=2) { # compute checksum\\n k = 2 * s[i]\\n if (k > 9) { k -= 9 }\\n v += k\\n }\\n for (i=j; i>=1; i-=2) {\\n v += s[i]\\n }\\n return(v % 10 == 0)\\n}\\n\",\n \"language\": \"AWK\"\n },\n {\n \"code\": \"array base 1\\n\\ndim test_set$(7)\\ntest_set$ = {\\\"US0378331005\\\", \\\"US0373831005\\\", \\\"U50378331005\\\", \\\"US03378331005\\\", \\\"AU0000XVGZA3\\\", \\\"AU0000VXGZA3\\\", \\\"FR0000988040\\\"}\\n\\nfor i = 1 to test_set$[?]\\n\\ttest_str$ = \\\"\\\"\\n\\tl = length(test_set$[i])\\n\\tif l <> 12 then\\n\\t\\tprint test_set$[i]; \\\" Invalid, length <> 12 char.\\\"\\n\\t\\tcontinue for\\n\\tend if\\n\\tif asc(mid(test_set$[i], 1, 1)) < asc(\\\"A\\\") or asc(mid(test_set$[i], 2, 1)) < asc(\\\"A\\\") then\\n\\t\\tprint test_set$[i]; \\\" Invalid, number needs to start with 2 characters\\\"\\n\\t\\tcontinue for\\n\\tend if\\n\\tfor n = 1 to l\\n\\t\\tx = asc(mid(test_set$[i], n, 1)) - asc(\\\"0\\\")\\n\\t\\tif x > 9 then x -= 7\\n\\t\\tif x < 10 then\\n\\t\\t\\ttest_str$ += string(x)\\n\\t\\telse # two digest number\\n\\t\\t\\ttest_str$ += string(x \\\\ 10) + string(x mod 10)\\n\\t\\tend if\\n\\tnext\\n\\tprint test_set$[i]; \\\" \\\";\\n\\tif luhntest(test_str$) = 1 then\\n\\t\\tprint \\\"Invalid, checksum error\\\"\\n\\telse\\n\\t\\tprint \\\"Valid\\\"\\n\\tend if\\nnext\\nend\\n\\nfunction luhntest(cardnr$)\\n\\tcardnr$ = trim(cardnr$) # remove spaces\\n\\tl = length(cardnr$)\\n\\ts1 = 0\\n\\ts2 = 0\\n\\n\\t# sum odd numbers\\n\\tfor i = 1 to l step 2\\n\\t\\ts1 += fromradix(asc(mid(cardnr$, i, 1)), 10)\\n\\tnext\\n\\t# sum even numbers\\n\\tfor i = 2 to l step 2\\n\\t\\tj = fromradix(asc(mid(cardnr$, i, 1)), 10)\\n\\t\\tj *= 2\\n\\t\\tif j > 9 then j = (j mod 10) + 1\\n\\t\\ts2 += j\\n\\tnext\\n\\n\\treturn (s1 + s2) mod 10 = 0\\nend function\\n\",\n \"language\": \"BASIC256\"\n },\n {\n \"code\": \":import luhn_test_of_credit_card_numbers .\\n\\n:import std/Number/Conversion .\\n:import std/Combinator .\\n:import std/String .\\n:import std/Char .\\n:import std/Logic .\\n:import std/Number .\\n\\n# verifies ISIN format\\nformat? [len ⋀? country ⋀? security ⋀? checksum]\\n\\tlen (length 0) =? (+12)\\n\\tcountry all? uppercase? (take (+2) 0)\\n\\tsecurity all? (φ or? uppercase? numeric?) (take (+9) (drop (+2) 0))\\n\\tchecksum numeric? _0\\n\\n# performs luhn test\\nchecksum? (map (from-base36 → number→string)) → concat → string→number → luhn\\n\\tfrom-base36 binary→ternary → [(0 - (0 ≥? (+65) ((+65) - (+10)) (+48)))]\\n\\n# performs format and checksum test\\nvalidate φ and? format? checksum?\\n\\n:test (validate \\\"US0378331005\\\") (true)\\n:test (validate \\\"US0373831005\\\") (false)\\n:test (validate \\\"U50378331005\\\") (false)\\n:test (validate \\\"US03378331005\\\") (false)\\n:test (validate \\\"AU0000XVGZA3\\\") (true)\\n:test (validate \\\"AU0000VXGZA3\\\") (true)\\n:test (validate \\\"FR0000988040\\\") (true)\\n\",\n \"language\": \"Bruijn\"\n },\n {\n \"code\": \"#include <stdio.h>\\n\\nint check_isin(char *a) {\\n int i, j, k, v, s[24];\\n\\n j = 0;\\n for(i = 0; i < 12; i++) {\\n k = a[i];\\n if(k >= '0' && k <= '9') {\\n if(i < 2) return 0;\\n s[j++] = k - '0';\\n } else if(k >= 'A' && k <= 'Z') {\\n if(i == 11) return 0;\\n k -= 'A' - 10;\\n s[j++] = k / 10;\\n s[j++] = k % 10;\\n } else {\\n return 0;\\n }\\n }\\n\\n if(a[i]) return 0;\\n\\n v = 0;\\n for(i = j - 2; i >= 0; i -= 2) {\\n k = 2 * s[i];\\n v += k > 9 ? k - 9 : k;\\n }\\n\\n for(i = j - 1; i >= 0; i -= 2) {\\n v += s[i];\\n }\\n\\n return v % 10 == 0;\\n}\\n\\nint main() {\\n char *test[7] = {\\\"US0378331005\\\", \\\"US0373831005\\\", \\\"U50378331005\\\",\\n \\\"US03378331005\\\", \\\"AU0000XVGZA3\\\", \\\"AU0000VXGZA3\\\",\\n \\\"FR0000988040\\\"};\\n int i;\\n for(i = 0; i < 7; i++) printf(\\\"%c%c\\\", check_isin(test[i]) ? 'T' : 'F', i == 6 ? '\\\\n' : ' ');\\n return 0;\\n}\\n\\n/* will print: T F F F T T T */\\n\",\n \"language\": \"C\"\n },\n {\n \"code\": \"#include <string>\\n#include <regex>\\n#include <algorithm>\\n#include <numeric>\\n#include <sstream>\\n\\nbool CheckFormat(const std::string& isin)\\n{\\n\\tstd::regex isinRegEpx(R\\\"([A-Z]{2}[A-Z0-9]{9}[0-9])\\\");\\n\\tstd::smatch match;\\n\\treturn std::regex_match(isin, match, isinRegEpx);\\n}\\n\\nstd::string CodeISIN(const std::string& isin)\\n{\\n\\tstd::string coded;\\n\\tint offset = 'A' - 10;\\n\\tfor (auto ch : isin)\\n\\t{\\n\\t\\tif (ch >= 'A' && ch <= 'Z')\\n\\t\\t{\\n\\t\\t\\tstd::stringstream ss;\\n\\t\\t\\tss << static_cast<int>(ch) - offset;\\n\\t\\t\\tcoded += ss.str();\\n\\t\\t}\\n\\t\\telse\\n\\t\\t{\\n\\t\\t\\tcoded.push_back(ch);\\n\\t\\t}\\n\\t}\\n\\n\\treturn std::move(coded);\\n}\\n\\nbool CkeckISIN(const std::string& isin)\\n{\\n\\tif (!CheckFormat(isin))\\n\\t\\treturn false;\\n\\n\\tstd::string coded = CodeISIN(isin);\\n// from http://rosettacode.org/wiki/Luhn_test_of_credit_card_numbers#C.2B.2B11\\n\\treturn luhn(coded);\\n}\\n\\n\\n#include <iomanip>\\n#include <iostream>\\n\\nint main()\\n{\\n\\tstd::string isins[] = { \\\"US0378331005\\\", \\\"US0373831005\\\", \\\"U50378331005\\\",\\n\\t\\t\\t\\t\\t\\t\\t\\\"US03378331005\\\", \\\"AU0000XVGZA3\\\", \\\"AU0000VXGZA3\\\",\\n\\t\\t\\t\\t\\t\\t\\t\\\"FR0000988040\\\" };\\n\\tfor (const auto& isin : isins)\\n\\t{\\n\\t\\tstd::cout << isin << std::boolalpha << \\\" - \\\" << CkeckISIN(isin) <<std::endl;\\n\\t}\\n\\treturn 0;\\n}\\n\",\n \"language\": \"C++\"\n },\n {\n \"code\": \"using System;\\nusing System.Linq;\\nusing System.Text.RegularExpressions;\\n\\nnamespace ValidateIsin\\n{\\n public static class IsinValidator\\n {\\n public static bool IsValidIsin(string isin) =>\\n IsinRegex.IsMatch(isin) && LuhnTest(Digitize(isin));\\n\\n private static readonly Regex IsinRegex =\\n new Regex(\\\"^[A-Z]{2}[A-Z0-9]{9}\\\\\\\\d$\\\", RegexOptions.Compiled);\\n\\n private static string Digitize(string isin) =>\\n string.Join(\\\"\\\", isin.Select(c => $\\\"{DigitValue(c)}\\\"));\\n\\n private static bool LuhnTest(string number) =>\\n number.Reverse().Select(DigitValue).Select(Summand).Sum() % 10 == 0;\\n\\n private static int Summand(int digit, int i) =>\\n digit + (i % 2) * (digit - digit / 5 * 9);\\n\\n private static int DigitValue(char c) =>\\n c >= '0' && c <= '9'\\n ? c - '0'\\n : c - 'A' + 10;\\n }\\n\\t\\n public class Program\\n {\\n public static void Main()\\n {\\n string[] isins =\\n {\\n \\\"US0378331005\\\",\\n \\\"US0373831005\\\",\\n \\\"U50378331005\\\",\\n \\\"US03378331005\\\",\\n \\\"AU0000XVGZA3\\\",\\n \\\"AU0000VXGZA3\\\",\\n \\\"FR0000988040\\\"\\n };\\n\\n foreach (string isin in isins) {\\n string validOrNot = IsinValidator.IsValidIsin(isin) ? \\\"valid\\\" : \\\"not valid\\\";\\n Console.WriteLine($\\\"{isin} is {validOrNot}\\\");\\n }\\n }\\n }\\n}\\n\",\n \"language\": \"C-sharp\"\n },\n {\n \"code\": \"(defn luhn? [cc]\\n (let [sum (->> cc\\n (map #(Character/digit ^char % 10))\\n reverse\\n (map * (cycle [1 2]))\\n (map #(+ (quot % 10) (mod % 10)))\\n (reduce +))]\\n (zero? (mod sum 10))))\\n\\n(defn is-valid-isin? [isin]\\n (and (re-matches #\\\"^[A-Z]{2}[A-Z0-9]{9}[0-9]$\\\" isin)\\n (->> isin\\n (map #(Character/digit ^char % 36))\\n (apply str)\\n luhn?)))\\n\\n(use 'clojure.pprint)\\n(doseq [isin [\\\"US0378331005\\\" \\\"US0373831005\\\" \\\"U50378331005\\\" \\\"US03378331005\\\"\\n \\\"AU0000XVGZA3\\\" \\\"AU0000VXGZA3\\\" \\\"FR0000988040\\\"]]\\n (cl-format *out* \\\"~A: ~:[invalid~;valid~]~%\\\" isin (is-valid-isin? isin)))\\n\",\n \"language\": \"Clojure\"\n },\n {\n \"code\": \" >>SOURCE FORMAT FREE\\n*> this is gnucobol 2.0\\nidentification division.\\nprogram-id. callISINtest.\\ndata division.\\nworking-storage section.\\n01 ISINtest-result binary-int.\\nprocedure division.\\nstart-callISINtest.\\n display 'should be valid ' with no advancing\\n call 'ISINtest' using 'US0378331005' ISINtest-result\\n perform display-ISINtest-result\\n display 'should not be valid ' with no advancing\\n call 'ISINtest' using 'US0373831005' ISINtest-result\\n perform display-ISINtest-result\\n display 'should not be valid ' with no advancing\\n call 'ISINtest' using 'U50378331005' ISINtest-result\\n perform display-ISINtest-result\\n display 'should not be valid ' with no advancing\\n call 'ISINtest' using 'US03378331005' ISINtest-result\\n perform display-ISINtest-result\\n display 'should be valid ' with no advancing\\n call 'ISINtest' using 'AU0000XVGZA3' ISINtest-result\\n perform display-ISINtest-result\\n display 'should be valid ' with no advancing\\n call 'ISINtest' using 'AU0000VXGZA3' ISINtest-result\\n perform display-ISINtest-result\\n display 'should be valid ' with no advancing\\n call 'ISINtest' using 'FR0000988040' ISINtest-result\\n perform display-ISINtest-result\\n stop run\\n .\\ndisplay-ISINtest-result.\\n evaluate ISINtest-result\\n when 0\\n display ' is valid'\\n when -1\\n display ' invalid length '\\n when -2\\n display ' invalid countrycode '\\n when -3\\n display ' invalid base36 digit '\\n when -4\\n display ' luhn test failed'\\n when other\\n display ' invalid return code ' ISINtest-result\\n end-evaluate\\n .\\nend program callISINtest.\\n\\nidentification division.\\nprogram-id. ISINtest.\\ndata division.\\nworking-storage section.\\n01 country-code-values value\\n 'ADAEAFAGAIALAMAOAQARASATAUAWAXAZBABBBDBEBFBGBHBIBJBLBMBNBOBQBRBS'\\n& 'BTBVBWBYBZCACCCDCFCGCHCICKCLCMCNCOCRCUCVCWCXCYCZDEDJDKDMDODZECEE'\\n& 'EGEHERESETFIFJFKFMFOFRGAGBGDGEGFGGGHGIGLGMGNGPGQGRGSGTGUGWGYHKHM'\\n& 'HNHRHTHUIDIEILIMINIOIQIRISITJEJMJOJPKEKGKHKIKMKNKPKRKWKYKZLALBLC'\\n& 'LILKLRLSLTLULVLYMAMCMDMEMFMGMHMKMLMMMNMOMPMQMRMSMTMUMVMWMXMYMZNA'\\n& 'NCNENFNGNINLNONPNRNUNZOMPAPEPFPGPHPKPLPMPNPRPSPTPWPYQARERORSRURW'\\n& 'SASBSCSDSESGSHSISJSKSLSMSNSOSRSSSTSVSXSYSZTCTDTFTGTHTJTKTLTMTNTO'\\n& 'TRTTTVTWTZUAUGUMUSUYUZVAVCVEVGVIVNVUWFWSYEYTZAZMZW'.\\n 03 country-codes occurs 249\\n ascending key country-code\\n indexed by cc-idx.\\n 05 country-code pic xx.\\n\\n01 b pic 99.\\n01 base36-digits pic x(36) value\\n '0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZ'.\\n\\n01 i pic 99.\\n01 p pic 99.\\n01 luhn-number pic x(20).\\n01 luhntest-result binary-int.\\n\\nlinkage section.\\n01 test-number any length.\\n01 ISINtest-result binary-int.\\n\\nprocedure division using test-number ISINtest-result.\\nstart-ISINtest.\\n display space test-number with no advancing\\n\\n *> format test\\n if function length(test-number) <> 12\\n move -1 to ISINtest-result\\n goback\\n end-if\\n\\n *> countrycode test\\n search all country-codes\\n at end\\n move -2 to ISINtest-result\\n goback\\n when test-number(1:2) = country-code(cc-idx)\\n continue\\n end-search\\n\\n *> convert each character from base 36 to base 10\\n *> and add to the luhn-number\\n move 0 to p\\n perform varying i from 1 by 1 until i > 12\\n if test-number(i:1) >= '0' and <= '9'\\n move test-number(i:1) to luhn-number(p + 1:1)\\n add 1 to p\\n else\\n perform varying b from 9 by 1 until b > 35\\n or base36-digits(b + 1:1) = test-number(i:1)\\n continue\\n end-perform\\n if b > 35\\n move -3 to ISINtest-result\\n goback\\n end-if\\n move b to luhn-number(p + 1:2)\\n add 2 to p\\n end-if\\n end-perform\\n\\n call 'luhntest' using luhn-number(1:p) luhntest-result\\n if luhntest-result <> 0\\n move -4 to ISINtest-result\\n goback\\n end-if\\n\\n move 0 to ISINtest-result\\n goback\\n .\\nend program ISINtest.\\n\\nidentification division.\\nprogram-id. luhntest.\\ndata division.\\nworking-storage section.\\n01 i pic S99.\\n01 check-sum pic 999.\\nlinkage section.\\n01 test-number any length.\\n01 luhntest-result binary-int.\\nprocedure division using test-number luhntest-result.\\nstart-luhntest.\\n display space test-number with no advancing\\n move 0 to check-sum\\n\\n *> right to left sum the odd numbered digits\\n compute i = function length(test-number)\\n perform varying i from i by -2 until i < 1\\n add function numval(test-number(i:1)) to check-sum\\n end-perform\\n display space check-sum with no advancing\\n\\n *> right to left double sum the even numbered digits\\n compute i = function length(test-number) - 1\\n perform varying i from i by -2 until i < 1\\n add function numval(test-number(i:1)) to check-sum\\n add function numval(test-number(i:1)) to check-sum\\n *> convert a two-digit double sum number to a single digit\\n if test-number(i:1) >= '5'\\n subtract 9 from check-sum\\n end-if\\n end-perform\\n display space check-sum with no advancing\\n\\n if function mod(check-sum,10) = 0\\n move 0 to luhntest-result *> success\\n else\\n move -1 to luhntest-result *> failure\\n end-if\\n goback\\n .\\nend program luhntest.\\n\",\n \"language\": \"COBOL\"\n },\n {\n \"code\": \"(defun alphap (char)\\n (char<= #\\\\A char #\\\\Z))\\n\\n(defun alpha-digit-char-p (char)\\n (or (alphap char) (digit-char-p char)))\\n\\n(defun valid-isin-format-p (isin)\\n (and (= (length isin) 12)\\n (alphap (char isin 0))\\n (alphap (char isin 1))\\n (loop for i from 2 to 10\\n always (alpha-digit-char-p (char isin i)))\\n (digit-char-p (char isin 11))))\\n\\n(defun isin->digits (isin)\\n (apply #'concatenate 'string\\n (loop for c across isin\\n collect (princ-to-string (digit-char-p c 36)))))\\n\\n(defun luhn-test (string)\\n (loop for c across (reverse string)\\n for oddp = t then (not oddp)\\n if oddp\\n sum (digit-char-p c) into result\\n else\\n sum (let ((n (* 2 (digit-char-p c))))\\n (if (> n 9) (- n 9) n))\\n into result\\n finally (return (zerop (mod result 10)))))\\n\\n(defun valid-isin-p (isin)\\n (and (valid-isin-format-p isin)\\n (luhn-test (isin->digits isin))))\\n\\n(defun test ()\\n (dolist (isin '(\\\"US0378331005\\\" \\\"US0373831005\\\" \\\"U50378331005\\\" \\\"US03378331005\\\"\\n \\\"AU0000XVGZA3\\\" \\\"AU0000VXGZA3\\\" \\\"FR0000988040\\\"))\\n (format t \\\"~A: ~:[invalid~;valid~]~%\\\" isin (valid-isin-p isin))))\\n\",\n \"language\": \"Common-Lisp\"\n },\n {\n \"code\": \"import std.stdio;\\n\\nvoid main() {\\n auto isins = [\\n \\\"US0378331005\\\",\\n \\\"US0373831005\\\",\\n \\\"U50378331005\\\",\\n \\\"US03378331005\\\",\\n \\\"AU0000XVGZA3\\\",\\n \\\"AU0000VXGZA3\\\",\\n \\\"FR0000988040\\\",\\n ];\\n foreach (isin; isins) {\\n writeln(isin, \\\" is \\\", ISINvalidate(isin) ? \\\"valid\\\" : \\\"not valid\\\");\\n }\\n}\\n\\nbool ISINvalidate(string isin) {\\n import std.array : appender;\\n import std.conv : to;\\n import std.regex : matchFirst;\\n import std.string : strip, toUpper;\\n\\n isin = isin.strip.toUpper;\\n\\n if (isin.matchFirst(`^[A-Z]{2}[A-Z0-9]{9}\\\\d$`).empty) {\\n return false;\\n }\\n\\n auto sb = appender!string;\\n foreach (c; isin[0..12]) {\\n sb.put(\\n [c].to!int(36)\\n .to!string\\n );\\n }\\n\\n import luhn;\\n return luhnTest(sb.data);\\n}\\n\",\n \"language\": \"D\"\n },\n {\n \"code\": \"bool checkISIN(String isin) {\\n int j = 0, v = 0;\\n List<int> s = List.filled(24, 0);\\n\\n for (int i = 0; i < 12; i++) {\\n int k = isin.codeUnitAt(i);\\n if (k >= '0'.codeUnitAt(0) && k <= '9'.codeUnitAt(0)) {\\n if (i < 2) return false;\\n s[j++] = k - '0'.codeUnitAt(0);\\n } else if (k >= 'A'.codeUnitAt(0) && k <= 'Z'.codeUnitAt(0)) {\\n if (i == 11) return false;\\n k -= 'A'.codeUnitAt(0) - 10;\\n s[j++] = k ~/ 10;\\n s[j++] = k % 10;\\n } else {\\n return false;\\n }\\n }\\n\\n if (isin.length > 12) return false;\\n\\n for (int i = j - 2; i >= 0; i -= 2) {\\n int k = 2 * s[i];\\n v += k > 9 ? k - 9 : k;\\n }\\n\\n for (int i = j - 1; i >= 0; i -= 2) {\\n v += s[i];\\n }\\n\\n return v % 10 == 0;\\n}\\n\\nvoid main() {\\n List<String> test = [\\n \\\"US0378331005\\\",\\n \\\"US0373831005\\\",\\n \\\"U50378331005\\\",\\n \\\"US03378331005\\\",\\n \\\"AU0000XVGZA3\\\",\\n \\\"AU0000VXGZA3\\\",\\n \\\"FR0000988040\\\"\\n ];\\n\\n for (String isin in test) {\\n print('$isin - ${checkISIN(isin)}');\\n }\\n}\\n\",\n \"language\": \"Dart\"\n },\n {\n \"code\": \"function StrToBase10(S: string): TByteDynArray;\\n{Convert ASCII string to Base-10}\\n{ASCII Digits converted to integer 0..9 }\\n{ASCII Chars convert to bytes \\\"A\\\"=10, \\\"B\\\"=11, etc }\\nvar I: Integer;\\nvar B: byte;\\n\\n\\tprocedure StoreByte(B: byte);\\n\\tbegin\\n\\tSetLength(Result,Length(Result)+1);\\n\\tResult[High(Result)]:=B;\\n\\tend;\\n\\nbegin\\nSetLength(Result,0);\\nfor I:=1 to Length(S) do\\n\\tbegin\\n\\tif S[I] in ['0'..'9'] then StoreByte(Byte(S[I])-$30)\\n\\telse\\n\\t\\tbegin\\n\\t\\tB:=(Byte(S[I])-$41)+10;\\n\\t\\tStoreByte(B div 10);\\n\\t\\tStoreByte(B mod 10);\\n\\t\\tend;\\n\\tend;\\nend;\\n\\n{Simplifies cases where we have to sum a two digit number}\\n\\nconst DigitSum: array [0..18] of byte = (0,1,2,3,4,5,6,7,8,9,1,2,3,4,5,6,7,8,9);\\n\\nfunction LuhnTest(Nums: array of byte): boolean;\\n{Perform Luhn Test of byte array}\\nvar I,J,Len,Sum,Sum1,Sum2: integer;\\nvar Rev: array of byte;\\nbegin\\nSum1:=0; Sum2:=0;\\nLen:=High(Nums);\\nfor I:=Len downto 0 do\\n if ((I-Len) and 1)=0 then Sum1:=Sum1 + Nums[I]\\n else Sum2:=Sum2 + DigitSum[Nums[I]*2];\\nSum:=Sum1+Sum2;\\nResult:=(Sum mod 10)=0;\\nend;\\n\\n{String error types}\\n\\ntype TStringErrors = (seNone,seLength,seCountry);\\n\\nfunction ValidateStr(IDStr: string): TStringErrors;\\n{Validate string checking for incorrectly length}\\n{And invalid country code}\\nbegin\\nif Length(IDStr)<>12 then Result:=seLength\\nelse if not (IDStr[1] in ['a'..'z','A'..'Z']) or\\n not (IDStr[2] in ['a'..'z','A'..'Z']) then Result:=seCountry\\nelse Result:=seNone;\\nend;\\n\\n\\n\\nprocedure ValidateID(Memo: TMemo; IDStr: string);\\n{Validate and display status of string}\\nvar BA: TByteDynArray;\\nvar LT: boolean;\\nvar SE: TStringErrors;\\nvar S: string;\\nbegin\\nSE:=ValidateStr(IDStr);\\nBA:=StrToBase10(IDStr);\\nLT:=LuhnTest(BA);\\nif LT and (SE=seNone) then Memo.Lines.Add(IDStr+': Valid')\\nelse\\n\\tbegin\\n\\tS:=IDStr+': Invalid';\\n\\tif not LT then S:=S+', Luhn Error';\\n\\tcase SE of\\n\\t seLength: S:=S+', Length Error';\\n\\t seCountry: S:=S+', Country Code Error';\\n\\t end;\\n\\tMemo.Lines.Add(S);\\n\\tend;\\nend;\\n\\n\\n\\nprocedure ValidateSecuritiesID(Memo: TMemo);\\nvar BA: TByteDynArray;\\nvar I: integer;\\nvar S: string;\\nbegin\\nValidateID(Memo,'US0378331005');\\nValidateID(Memo,'US0373831005');\\nValidateID(Memo,'U50378331005');\\nValidateID(Memo,'US03378331005');\\nValidateID(Memo,'AU0000XVGZA3');\\nValidateID(Memo,'AU0000VXGZA3');\\nValidateID(Memo,'FR0000988040');\\nend;\\n\",\n \"language\": \"Delphi\"\n },\n {\n \"code\": \"func isin t$ .\\n if len t$ <> 12\\n return 0\\n .\\n for i to 12\\n k = strcode substr t$ i 1\\n if k >= 48 and k <= 57\\n if i <= 2\\n return 0\\n .\\n s[] &= k - 48\\n elif k >= 65 and k <= 91\\n if (i = 12)\\n return 0\\n .\\n k -= 55\\n s[] &= k div 10\\n s[] &= k mod 10\\n else\\n return 0\\n .\\n .\\n i = len s[] - 1\\n while i >= 1\\n k = 2 * s[i]\\n if k > 9\\n k -= 9\\n .\\n v += k\\n i -= 2\\n .\\n i = len s[]\\n while i >= 1\\n v += s[i]\\n i -= 2\\n .\\n if v mod 10 = 0\\n return 1\\n .\\n.\\ntest$[] = [ \\\"US0378331005\\\" \\\"US0373831005\\\" \\\"U50378331005\\\" \\\"US03378331005\\\" \\\"AU0000XVGZA3\\\" \\\"AU0000VXGZA3\\\" \\\"FR0000988040\\\" ]\\nfor t$ in test$[]\\n if isin t$ = 1\\n print t$ & \\\" is valid\\\"\\n else\\n print t$ & \\\" is invalid\\\"\\n .\\n.\\n\",\n \"language\": \"EasyLang\"\n },\n {\n \"code\": \"isin? = fn str ->\\n if str =~ ~r/\\\\A[A-Z]{2}[A-Z0-9]{9}\\\\d\\\\z/ do\\n String.codepoints(str)\\n |> Enum.map_join(&String.to_integer(&1, 36))\\n |> Luhn.valid?\\n else\\n false\\n end\\n end\\n\\nIO.puts \\\" ISIN Valid?\\\"\\n~w(US0378331005\\n US0373831005\\n U50378331005\\n US03378331005\\n AU0000XVGZA3\\n AU0000VXGZA3\\n FR0000988040)\\n|> Enum.each(&IO.puts \\\"#{&1}\\\\t#{isin?.(&1)}\\\")\\n\",\n \"language\": \"Elixir\"\n },\n {\n \"code\": \"USING: combinators.short-circuit.smart formatting kernel luhn\\nmath math.parser qw sequences strings unicode ;\\nIN: rosetta-code.isin\\n\\nCONSTANT: test-cases qw{\\n US0378331005 US0373831005 U50378331005 US03378331005\\n AU0000XVGZA3 AU0000VXGZA3 FR0000988040\\n}\\n\\n: valid-length? ( str -- ? ) length 12 = ;\\n\\n: valid-country-code? ( str -- ? ) first2 [ Letter? ] both? ;\\n\\n: valid-security-code? ( str -- ? )\\n [ 2 11 ] dip subseq [ alpha? ] all? ;\\n\\n: valid-checksum-digit? ( str -- ? ) last digit? ;\\n\\n: valid-format? ( str -- ? ) {\\n [ valid-length? ]\\n [ valid-country-code? ]\\n [ valid-security-code? ]\\n [ valid-checksum-digit? ]\\n } && ;\\n\\n: base36>base10 ( str -- n )\\n >upper [ dup LETTER? [ 55 - number>string ] [ 1string ] if ]\\n { } map-as concat string>number ;\\n\\n: isin? ( str -- ? )\\n { [ valid-format? ] [ base36>base10 luhn? ] } && ;\\n\\n: main ( -- )\\n test-cases [\\n dup isin? \\\"\\\" \\\" not\\\" ? \\\"%s is%s valid\\\\n\\\" printf\\n ] each ;\\n\\nMAIN: main\\n\",\n \"language\": \"Factor\"\n },\n {\n \"code\": \"program isin\\n use ctype\\n implicit none\\n character(20) :: test(7) = [\\\"US0378331005 \\\", &\\n \\\"US0373831005 \\\", &\\n \\\"U50378331005 \\\", &\\n \\\"US03378331005 \\\", &\\n \\\"AU0000XVGZA3 \\\", &\\n \\\"AU0000VXGZA3 \\\", &\\n \\\"FR0000988040 \\\"]\\n print *, check_isin(test)\\ncontains\\n elemental logical function check_isin(a)\\n character(*), intent(in) :: a\\n integer :: s(24)\\n integer :: i, j, k, n, v\\n\\n check_isin = .false.\\n\\n n = len_trim(a)\\n if (n /= 12) return\\n\\n ! Convert to an array of digits\\n j = 0\\n do i = 1, n\\n k = iachar(a(i:i))\\n if (k >= 48 .and. k <= 57) then\\n if (i < 3) return\\n k = k - 48\\n j = j + 1\\n s(j) = k\\n else if (k >= 65 .and. k <= 90) then\\n if (i == 12) return\\n k = k - 65 + 10\\n j = j + 1\\n s(j) = k / 10\\n j = j + 1\\n s(j) = mod(k, 10)\\n else\\n return\\n end if\\n end do\\n\\n ! Compute checksum\\n v = 0\\n do i = j - 1, 1, -2\\n k = 2 * s(i)\\n if (k > 9) k = k - 9\\n v = v + k\\n end do\\n do i = j, 1, -2\\n v = v + s(i)\\n end do\\n\\n check_isin = 0 == mod(v, 10)\\n end function\\nend program\\n\",\n \"language\": \"Fortran\"\n },\n {\n \"code\": \"' version 27-10-2016\\n' compile with: fbc -s console\\n\\n#Ifndef TRUE ' define true and false for older freebasic versions\\n #Define FALSE 0\\n #Define TRUE Not FALSE\\n#EndIf\\n\\nFunction luhntest(cardnr As String) As Long\\n\\n cardnr = Trim(cardnr) ' remove spaces\\n\\n Dim As String reverse_nr = cardnr\\n Dim As Long i, j, s1, s2, l = Len(cardnr) -1\\n\\n ' reverse string\\n For i = 0 To l\\n reverse_nr[i] = cardnr[l - i]\\n Next\\n ' sum odd numbers\\n For i = 0 To l Step 2\\n s1 = s1 + (reverse_nr[i] - Asc(\\\"0\\\"))\\n Next\\n ' sum even numbers\\n For i = 1 To l Step 2\\n j = reverse_nr[i] - Asc(\\\"0\\\")\\n j = j * 2\\n If j > 9 Then j = j Mod 10 +1\\n s2 = s2 + j\\n Next\\n\\n If (s1 + s2) Mod 10 = 0 Then\\n Return TRUE\\n Else\\n Return FALSE\\n End If\\n\\nEnd Function\\n\\n' ------=< MAIN >=-----\\n\\nDim As String test_str\\nDim As String test_set(1 To ...) = { \\\"US0378331005\\\", \\\"US0373831005\\\", _\\n \\\"U50378331005\\\", \\\"US03378331005\\\", \\\"AU0000XVGZA3\\\", _\\n \\\"AU0000VXGZA3\\\", \\\"FR0000988040\\\" }\\n\\nDim As Long i, l, n, x\\n\\nFor i = 1 To UBound(test_set)\\n test_str = \\\"\\\"\\n l = Len(test_set(i))\\n If l <> 12 Then\\n Print test_set(i), \\\"Invalid, length <> 12 char.\\\"\\n Continue For\\n End If\\n If test_set(i)[0] < Asc(\\\"A\\\") Or test_set(i)[1] < Asc(\\\"A\\\") Then\\n Print test_set(i), \\\"Invalid, number needs to start with 2 characters\\\"\\n Continue For\\n End If\\n For n = 0 To l -1\\n x = test_set(i)[n] - Asc(\\\"0\\\")\\n ' if test_set(i)[i] is a letter we to correct for that\\n If x > 9 Then x = x -7\\n If x < 10 Then\\n test_str = test_str + Str(x)\\n Else ' two digest number\\n test_str = test_str + Str(x \\\\ 10) + Str(x Mod 10)\\n End If\\n Next\\n Print test_set(i), IIf(luhntest(test_str) = TRUE, \\\"Valid\\\",\\\"Invalid, checksum error\\\")\\nNext\\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\": \"package main\\n\\nimport \\\"regexp\\\"\\n\\nvar r = regexp.MustCompile(`^[A-Z]{2}[A-Z0-9]{9}\\\\d$`)\\n\\nvar inc = [2][10]int{\\n\\t{0, 1, 2, 3, 4, 5, 6, 7, 8, 9},\\n\\t{0, 2, 4, 6, 8, 1, 3, 5, 7, 9},\\n}\\n\\nfunc ValidISIN(n string) bool {\\n\\tif !r.MatchString(n) {\\n\\t\\treturn false\\n\\t}\\n\\tvar sum, p int\\n\\tfor i := 10; i >= 0; i-- {\\n\\t\\tp = 1 - p\\n\\t\\tif d := n[i]; d < 'A' {\\n\\t\\t\\tsum += inc[p][d-'0']\\n\\t\\t} else {\\n\\t\\t\\td -= 'A'\\n\\t\\t\\tsum += inc[p][d%10]\\n\\t\\t\\tp = 1 - p\\n\\t\\t\\tsum += inc[p][d/10+1]\\n\\t\\t}\\n\\t}\\n\\tsum += int(n[11] - '0')\\n\\treturn sum%10 == 0\\n}\\n\",\n \"language\": \"Go\"\n },\n {\n \"code\": \"package main\\n\\nimport \\\"testing\\\"\\n\\nfunc TestValidISIN(t *testing.T) {\\n\\ttestcases := []struct {\\n\\t\\tisin string\\n\\t\\tvalid bool\\n\\t}{\\n\\t\\t{\\\"US0378331005\\\", true},\\n\\t\\t{\\\"US0373831005\\\", false},\\n\\t\\t{\\\"U50378331005\\\", false},\\n\\t\\t{\\\"US03378331005\\\", false},\\n\\t\\t{\\\"AU0000XVGZA3\\\", true},\\n\\t\\t{\\\"AU0000VXGZA3\\\", true},\\n\\t\\t{\\\"FR0000988040\\\", true},\\n\\t}\\n\\n\\tfor _, testcase := range testcases {\\n\\t\\tactual := ValidISIN(testcase.isin)\\n\\t\\tif actual != testcase.valid {\\n\\t\\t\\tt.Errorf(\\\"expected %v for %q, got %v\\\",\\n\\t\\t\\t\\ttestcase.valid, testcase.isin, actual)\\n\\t\\t}\\n\\t}\\n}\\n\",\n \"language\": \"Go\"\n },\n {\n \"code\": \"CHARS = '0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZ'\\n\\nint checksum(String prefix) {\\n def digits = prefix.toUpperCase().collect { CHARS.indexOf(it).toString() }.sum()\\n def groups = digits.collect { CHARS.indexOf(it) }.inject([[], []]) { acc, i -> [acc[1], acc[0] + i] }\\n def ds = groups[1].collect { (2 * it).toString() }.sum().collect { CHARS.indexOf(it) } + groups[0]\\n (10 - ds.sum() % 10) % 10\\n}\\n\\nassert checksum('AU0000VXGZA') == 3\\nassert checksum('GB000263494') == 6\\nassert checksum('US037833100') == 5\\nassert checksum('US037833107') == 0\\n\",\n \"language\": \"Groovy\"\n },\n {\n \"code\": \"module ISINVerification2 where\\n\\nimport Data.Char (isUpper, isDigit, digitToInt)\\n\\nverifyISIN :: String -> Bool\\nverifyISIN isin =\\n correctFormat isin && mod (oddsum + multiplied_even_sum) 10 == 0\\n where\\n reverted = reverse $ convertToNumber isin\\n theOdds = fst $ collectOddandEven reverted\\n theEvens = snd $ collectOddandEven reverted\\n oddsum = sum $ map digitToInt theOdds\\n multiplied_even_sum = addUpDigits $ map ((* 2) . digitToInt) theEvens\\n\\ncapitalLetters :: String\\ncapitalLetters = ['A','B' .. 'Z']\\n\\nnumbers :: String\\nnumbers = ['0', '1', '2', '3', '4', '5', '6', '7', '8', '9']\\n\\ncorrectFormat :: String -> Bool\\ncorrectFormat isin =\\n (length isin == 12) &&\\n all (`elem` capitalLetters) (take 2 isin) &&\\n all (\\\\c -> elem c capitalLetters || elem c numbers) (drop 2 $ take 11 isin) &&\\n elem (last isin) numbers\\n\\nconvertToNumber :: String -> String\\nconvertToNumber = concatMap convert\\n where\\n convert :: Char -> String\\n convert c =\\n if isDigit c\\n then show $ digitToInt c\\n else show (fromEnum c - 55)\\n\\ncollectOddandEven :: String -> (String, String)\\ncollectOddandEven term\\n | odd $ length term =\\n ( concat\\n [ take 1 $ drop n term\\n | n <- [0,2 .. length term - 1] ]\\n , concat\\n [ take 1 $ drop d term\\n | d <- [1,3 .. length term - 2] ])\\n | otherwise =\\n ( concat\\n [ take 1 $ drop n term\\n | n <- [0,2 .. length term - 2] ]\\n , concat\\n [ take 1 $ drop d term\\n | d <- [1,3 .. length term - 1] ])\\n\\naddUpDigits :: [Int] -> Int\\naddUpDigits list =\\n sum $\\n map\\n (\\\\d ->\\n if d > 9\\n then sum $ map digitToInt $ show d\\n else d)\\n list\\n\\nprintSolution :: String -> IO ()\\nprintSolution str = do\\n putStr $ str ++ \\\" is\\\"\\n if verifyISIN str\\n then putStrLn \\\" valid\\\"\\n else putStrLn \\\" not valid\\\"\\n\\nmain :: IO ()\\nmain = do\\n let isinnumbers =\\n [ \\\"US0378331005\\\"\\n , \\\"US0373831005\\\"\\n , \\\"U50378331005\\\"\\n , \\\"US03378331005\\\"\\n , \\\"AU0000XVGZA3\\\"\\n , \\\"AU0000VXGZA3\\\"\\n , \\\"FR0000988040\\\"\\n ]\\n mapM_ printSolution isinnumbers\\n\",\n \"language\": \"Haskell\"\n },\n {\n \"code\": \"import Control.Monad ((<=<))\\nimport Data.Bifunctor (first)\\nimport Data.List (foldl') -- '\\nimport qualified Data.Map as M\\nimport Data.Maybe (fromMaybe)\\n\\n-------------------- VALID ISIN STRING -------------------\\n\\nvalidISIN :: String -> Bool\\nvalidISIN =\\n (&&) . isinPattern\\n <*> luhn . (show <=< stringInts)\\n\\nisinPattern :: String -> Bool\\nisinPattern s =\\n 12 == length s\\n && all (`elem` capitals) l\\n && all (`elem` (capitals <> digits)) m\\n && head r `elem` digits\\n where\\n [l, m, r] = bites s [2, 9, 1]\\n\\nluhn :: String -> Bool\\nluhn x = 0 == rem (s1 + s2) 10\\n where\\n odds = [(: []), const []]\\n evens = reverse odds\\n stream f =\\n concat $\\n zipWith ($) (cycle f) (stringInts $ reverse x)\\n s1 = sum (stream odds)\\n s2 =\\n sum $\\n sum . stringInts . show . (2 *) <$> stream evens\\n\\ncharMap :: M.Map Char Int\\ncharMap = M.fromList $ zip (digits <> capitals) [0 ..]\\n\\nstringInts :: String -> [Int]\\nstringInts = fromMaybe [] . traverse (`M.lookup` charMap)\\n\\nbites :: [a] -> [Int] -> [[a]]\\nbites xs =\\n (reverse . fst)\\n . foldl' -- '\\n (\\\\(a, r) x -> first (: a) (splitAt x r))\\n ([], xs)\\n\\ncapitals, digits :: String\\ncapitals = ['A' .. 'Z']\\ndigits = ['0' .. '9']\\n\\n--------------------------- TEST -------------------------\\nmain :: IO ()\\nmain =\\n mapM_\\n (print . ((,) <*> validISIN))\\n [ \\\"US0378331005\\\",\\n \\\"US0373831005\\\",\\n \\\"U50378331005\\\",\\n \\\"US03378331005\\\",\\n \\\"AU0000XVGZA3\\\",\\n \\\"AU0000VXGZA3\\\",\\n \\\"FR0000988040\\\"\\n ]\\n\",\n \"language\": \"Haskell\"\n },\n {\n \"code\": \"require'regex'\\nvalidFmt=: 0 -: '^[A-Z]{2}[A-Z0-9]{9}[0-9]{1}$'&rxindex\\n\\ndf36=: ;@([: <@\\\":\\\"0 '0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZ'&i.) NB. decimal from base 36\\nluhn=: 0 = 10 (| +/@,) 10 #.inv 1 2 *&|: _2 \\\".\\\"0\\\\ |. NB. as per task Luhn_test_of_credit_card_numbers#J\\n\\nvalidISIN=: validFmt *. luhn@df36\\n\",\n \"language\": \"J\"\n },\n {\n \"code\": \" Tests=: 'US0378331005';'US0373831005';'U50378331005';'US03378331005';'AU0000XVGZA3';'AU0000VXGZA3';'FR0000988040'\\n validISIN&> Tests\\n1 0 0 0 1 1 1\\n\",\n \"language\": \"J\"\n },\n {\n \"code\": \"public class ISIN {\\n\\n public static void main(String[] args) {\\n String[] isins = {\\n \\\"US0378331005\\\",\\n \\\"US0373831005\\\",\\n \\\"U50378331005\\\",\\n \\\"US03378331005\\\",\\n \\\"AU0000XVGZA3\\\",\\n \\\"AU0000VXGZA3\\\",\\n \\\"FR0000988040\\\"\\n };\\n for (String isin : isins)\\n System.out.printf(\\\"%s is %s\\\\n\\\", isin, ISINtest(isin) ? \\\"valid\\\" : \\\"not valid\\\");\\n }\\n\\n static boolean ISINtest(String isin) {\\n isin = isin.trim().toUpperCase();\\n\\n if (!isin.matches(\\\"^[A-Z]{2}[A-Z0-9]{9}\\\\\\\\d$\\\"))\\n return false;\\n\\n StringBuilder sb = new StringBuilder();\\n for (char c : isin.substring(0, 12).toCharArray())\\n sb.append(Character.digit(c, 36));\\n\\n return luhnTest(sb.toString());\\n }\\n\\n static boolean luhnTest(String number) {\\n int s1 = 0, s2 = 0;\\n String reverse = new StringBuffer(number).reverse().toString();\\n for (int i = 0; i < reverse.length(); i++){\\n int digit = Character.digit(reverse.charAt(i), 10);\\n //This is for odd digits, they are 1-indexed in the algorithm.\\n if (i % 2 == 0){\\n s1 += digit;\\n } else { // Add 2 * digit for 0-4, add 2 * digit - 9 for 5-9.\\n s2 += 2 * digit;\\n if(digit >= 5){\\n s2 -= 9;\\n }\\n }\\n }\\n return (s1 + s2) % 10 == 0;\\n }\\n}\\n\",\n \"language\": \"Java\"\n },\n {\n \"code\": \"# This filter may be applied to integers or integer-valued strings\\ndef luhntest:\\n def digits: tostring | explode | map([.]|implode|tonumber);\\n (digits | reverse)\\n | ( [.[range(0;length;2)]] | add ) as $sum1\\n | [.[range(1;length;2)]]\\n | (map( (2 * .) | if . > 9 then (digits|add) else . end) | add) as $sum2\\n | ($sum1 + $sum2) % 10 == 0;\\n\\ndef decodeBase36:\\n # decode a single character\\n def d1:\\n explode[0]\\n # \\\"0\\\" is 48; \\\"A\\\" is 65\\n | if . < 65 then . - 48\\n else . - 55\\n end;\\n def chars: explode | map([.]|implode);\\n chars | map(d1) | join(\\\"\\\");\\n\\ndef is_ISIN:\\n type == \\\"string\\\"\\n and test(\\\"^(?<cc>[A-Z][A-Z])(?<sc>[0-9A-Z]{9})(?<cs>[0-9])$\\\")\\n and (decodeBase36 | luhntest);\\n\",\n \"language\": \"Jq\"\n },\n {\n \"code\": \"def task:\\n \\\"US0378331005\\\",\\n \\\"US0373831005\\\",\\n \\\"U50378331005\\\",\\n \\\"US03378331005\\\",\\n \\\"AU0000XVGZA3\\\",\\n \\\"AU0000VXGZA3\\\",\\n \\\"FR0000988040\\\"\\n | . + \\\" => \\\" + (if is_ISIN then \\\"valid\\\" else \\\"invalid\\\" end);\\n\\ntask\\n\",\n \"language\": \"Jq\"\n },\n {\n \"code\": \"using Printf\\n\\nluhntest(x) = luhntest(parse(Int, x))\\n\\nfunction checkISIN(inum::AbstractString)\\n if length(inum) != 12 || !all(isalpha, inum[1:2]) return false end\\n return parse.(Int, collect(inum), 36) |> join |> luhntest\\nend\\n\\nfor inum in [\\\"US0378331005\\\", \\\"US0373831005\\\", \\\"U50378331005\\\",\\n \\\"US03378331005\\\", \\\"AU0000XVGZA3\\\", \\\"AU0000VXGZA3\\\", \\\"FR0000988040\\\"]\\n @printf(\\\"%-15s %5s\\\\n\\\", inum, ifelse(checkISIN(inum), \\\"pass\\\", \\\"fail\\\"))\\nend\\n\",\n \"language\": \"Julia\"\n },\n {\n \"code\": \"// version 1.1\\n\\nobject Isin {\\n val r = Regex(\\\"^[A-Z]{2}[A-Z0-9]{9}[0-9]$\\\")\\n\\n fun isValid(s: String): Boolean {\\n // check format\\n if (!s.matches(r)) return false\\n // validate checksum\\n val sb = StringBuilder()\\n for (c in s) {\\n when (c) {\\n in '0'..'9' -> sb.append(c)\\n in 'A'..'Z' -> sb.append((c.toInt() - 55).toString().padStart(2, '0'))\\n }\\n }\\n return luhn(sb.toString())\\n }\\n\\n private fun luhn(s: String): Boolean {\\n fun sumDigits(n: Int) = n / 10 + n % 10\\n val t = s.reversed()\\n val s1 = t.filterIndexed { i, _ -> i % 2 == 0 }.sumBy { it - '0' }\\n val s2 = t.filterIndexed { i, _ -> i % 2 == 1 }.map { sumDigits((it - '0') * 2) }.sum()\\n return (s1 + s2) % 10 == 0\\n }\\n}\\n\\nfun main(args: Array<String>) {\\n val isins = arrayOf(\\n \\\"US0378331005\\\", \\\"US0373831005\\\", \\\"U50378331005\\\", \\\"US03378331005\\\",\\n \\\"AU0000XVGZA3\\\", \\\"AU0000VXGZA3\\\", \\\"FR0000988040\\\"\\n )\\n for (isin in isins) {\\n println(\\\"$isin\\\\t -> ${if (Isin.isValid(isin)) \\\"valid\\\" else \\\"not valid\\\"}\\\")\\n }\\n}\\n\",\n \"language\": \"Kotlin\"\n },\n {\n \"code\": \"val .luhntest = fn(.s) {\\n val .t = [0, 2, 4, 6, 8, 1, 3, 5, 7, 9]\\n val .numbers = s2n .s\\n val .oddeven = len(.numbers) rem 2\\n\\n for[=0] .i of .numbers {\\n _for += if .i rem 2 == .oddeven {\\n \\t.numbers[.i]\\n } else {\\n \\t.t[.numbers[.i]+1]\\n }\\n } div 10\\n}\\n\\nval .isintest = fn(.s) {\\n .s -> re/^[A-Z][A-Z][0-9A-Z]{9}[0-9]$/ and\\n .luhntest(join s2n .s)\\n}\\n\\nval .tests = h{\\n \\\"US0378331005\\\": true,\\n \\\"US0373831005\\\": false,\\n \\\"U50378331005\\\": false,\\n \\\"AU0000XVGZA3\\\": true,\\n \\\"AU0000VXGZA3\\\": true,\\n \\\"FR0000988040\\\": true,\\n \\\"US03378331005\\\": false,\\n}\\n\\nfor .key in sort(keys .tests) {\\n val .pass = .isintest(.key)\\n write .key, \\\": \\\", .pass\\n writeln if(.pass == .tests[.key]: \\\"\\\"; \\\" (ISIN TEST FAILED)\\\")\\n}\\n\",\n \"language\": \"Langur\"\n },\n {\n \"code\": \"function luhn (n)\\n local revStr, s1, s2, digit, mod = n:reverse(), 0, 0\\n for pos = 1, #revStr do\\n digit = tonumber(revStr:sub(pos, pos))\\n if pos % 2 == 1 then\\n s1 = s1 + digit\\n else\\n digit = digit * 2\\n if digit > 9 then\\n mod = digit % 10\\n digit = mod + ((digit - mod) / 10)\\n end\\n s2 = s2 + digit\\n end\\n end\\n return (s1 + s2) % 10 == 0\\nend\\n\\nfunction checkISIN (inStr)\\n if #inStr ~= 12 then return false end\\n local numStr = \\\"\\\"\\n for pos = 1, #inStr do\\n numStr = numStr .. tonumber(inStr:sub(pos, pos), 36)\\n end\\n return luhn(numStr)\\nend\\n\\nlocal testCases = {\\n \\\"US0378331005\\\",\\n \\\"US0373831005\\\",\\n \\\"US0373831005\\\",\\n \\\"US03378331005\\\",\\n \\\"AU0000XVGZA3\\\",\\n \\\"AU0000VXGZA3\\\",\\n \\\"FR0000988040\\\"\\n}\\nfor _, ISIN in pairs(testCases) do print(ISIN, checkISIN(ISIN)) end\\n\",\n \"language\": \"Lua\"\n },\n {\n \"code\": \"ClearAll[LuhnQ, VakudISINQ]\\nLuhnQ[n_Integer] := Block[{digits = Reverse@IntegerDigits@n}, Mod[Total[{digits[[;; ;; 2]], IntegerDigits[2 #] & /@ digits[[2 ;; ;; 2]]}, -1], 10] == 0]\\nVakudISINQ[sin_String] := Module[{s = ToUpperCase[sin]},\\n If[StringMatchQ[s,\\n LetterCharacter ~~ LetterCharacter ~~\\n Repeated[DigitCharacter | LetterCharacter, {9}] ~~\\n DigitCharacter],\\n s = StringJoin[\\n Characters[s] /.\\n Thread[CharacterRange[\\\"A\\\", \\\"Z\\\"] -> ToString /@ Range[10, 35]]];\\n LuhnQ[ToExpression[s]]\\n ,\\n False\\n ]\\n ]\\nVakudISINQ /@ {\\\"US0378331005\\\", \\\"US0373831005\\\", \\\"U50378331005\\\", \\\"US03378331005\\\", \\\"AU0000XVGZA3\\\", \\\"AU0000VXGZA3\\\", \\\"FR0000988040\\\"}\\n\",\n \"language\": \"Mathematica\"\n },\n {\n \"code\": \"import strformat\\n\\nconst\\n DigitRange = '0'..'9'\\n UpperCaseRange = 'A'..'Z'\\n\\ntype ISINError = object of ValueError\\n\\n\\nproc luhn(s: string): bool =\\n const m = [0, 2, 4, 6, 8, 1, 3, 5, 7, 9]\\n var sum = 0\\n var odd = true\\n for i in countdown(s.high, 0):\\n let digit = ord(s[i]) - ord('0')\\n sum += (if odd: digit else: m[digit])\\n odd = not odd\\n result = sum mod 10 == 0\\n\\n\\nproc validateISIN(s: string) =\\n if s.len != 12:\\n raise newException(ISINError, \\\"wrong length\\\")\\n if s[0] notin UpperCaseRange or s[1] notin UpperCaseRange:\\n raise newException(ISINError, \\\"wrong country code\\\")\\n if s[11] notin DigitRange:\\n raise newException(ISINError, \\\"wrong checksum character\\\")\\n var t: string\\n for ch in s:\\n case ch\\n of '0'..'9': t.add ch\\n of 'A'..'Z': t.addInt ord(ch) - ord('A') + 10\\n else: raise newException(ISINError, \\\"invalid characters in code\\\")\\n if not t.luhn():\\n raise newException(ISINError, \\\"checksum error\\\")\\n\\n\\nwhen isMainModule:\\n\\n for isin in [\\\"US0378331005\\\", \\\"US0373831005\\\", \\\"U50378331005\\\",\\n \\\"US03378331005\\\", \\\"AU0000XVGZA3\\\", \\\"AU0000VXGZA3\\\", \\\"FR0000988040\\\"]:\\n try:\\n isin.validateISIN()\\n echo &\\\"{isin} is valid.\\\"\\n except ISINError:\\n echo &\\\"{isin} is not valid: {getCurrentExceptionMsg()}.\\\"\\n\",\n \"language\": \"Nim\"\n },\n {\n \"code\": \"use strict;\\nuse English;\\nuse POSIX;\\nuse Test::Simple tests => 7;\\n\\nok( validate_isin('US0378331005'), 'Test 1');\\t\\nok( ! validate_isin('US0373831005'), 'Test 2');\\nok( ! validate_isin('U50378331005'), 'Test 3');\\nok( ! validate_isin('US03378331005'), 'Test 4');\\nok( validate_isin('AU0000XVGZA3'), 'Test 5');\\t\\nok( validate_isin('AU0000VXGZA3'), 'Test 6');\\nok( validate_isin('FR0000988040'), 'Test 7');\\t\\nexit 0;\\n\\nsub validate_isin {\\n my $isin = shift;\\n $isin =~ /\\\\A[A-Z]{2}[A-Z\\\\d]{9}\\\\d\\\\z/s or return 0;\\n my $base10 = join(q{}, map {scalar(POSIX::strtol($ARG, 36))}\\n split(//s, $isin));\\n return luhn_test($base10);\\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;\\\">Luhn</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #004080;\\\">string</span> <span style=\\\"color: #000000;\\\">st</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #004080;\\\">integer</span> <span style=\\\"color: #000000;\\\">s</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">0</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">d</span>\\n <span style=\\\"color: #000000;\\\">st</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">reverse</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">st</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;\\\">st</span><span style=\\\"color: #0000FF;\\\">)</span> <span style=\\\"color: #008080;\\\">do</span>\\n <span style=\\\"color: #000000;\\\">d</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">st</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">i</span><span style=\\\"color: #0000FF;\\\">]-</span><span style=\\\"color: #008000;\\\">'0'</span>\\n <span style=\\\"color: #000000;\\\">s</span> <span style=\\\"color: #0000FF;\\\">+=</span> <span style=\\\"color: #008080;\\\">iff</span><span style=\\\"color: #0000FF;\\\">(</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;\\\">2</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: #000000;\\\">2</span><span style=\\\"color: #0000FF;\\\">-(</span><span style=\\\"color: #000000;\\\">d</span><span style=\\\"color: #0000FF;\\\">></span><span style=\\\"color: #000000;\\\">4</span><span style=\\\"color: #0000FF;\\\">)*</span><span style=\\\"color: #000000;\\\">9</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: #7060A8;\\\">remainder</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">s</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">10</span><span style=\\\"color: #0000FF;\\\">)=</span><span style=\\\"color: #000000;\\\">0</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;\\\">valid_ISIN</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #004080;\\\">string</span> <span style=\\\"color: #000000;\\\">st</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #000080;font-style:italic;\\\">-- returns 1 if valid, else 0/2/3/4.\\n -- (feel free to return 0 instead of 2/3/4)</span>\\n <span style=\\\"color: #008080;\\\">if</span> <span style=\\\"color: #7060A8;\\\">length</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">st</span><span style=\\\"color: #0000FF;\\\">)!=</span><span style=\\\"color: #000000;\\\">12</span> <span style=\\\"color: #008080;\\\">then</span> <span style=\\\"color: #008080;\\\">return</span> <span style=\\\"color: #000000;\\\">2</span> <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: #7060A8;\\\">length</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">st</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;\\\">ch</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">st</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;\\\">then</span>\\n <span style=\\\"color: #008080;\\\">if</span> <span style=\\\"color: #000000;\\\">ch</span><span style=\\\"color: #0000FF;\\\">></span><span style=\\\"color: #008000;\\\">'Z'</span> <span style=\\\"color: #008080;\\\">then</span> <span style=\\\"color: #008080;\\\">return</span> <span style=\\\"color: #000000;\\\">3</span> <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">if</span>\\n <span style=\\\"color: #000000;\\\">st</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">i</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;\\\">sprintf</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #008000;\\\">\\\"%d\\\"</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">ch</span><span style=\\\"color: #0000FF;\\\">-</span><span style=\\\"color: #000000;\\\">55</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;\\\">2</span> <span style=\\\"color: #008080;\\\">then</span>\\n <span style=\\\"color: #008080;\\\">return</span> <span style=\\\"color: #000000;\\\">4</span>\\n <span style=\\\"color: #008080;\\\">elsif</span> <span style=\\\"color: #000000;\\\">ch</span><span style=\\\"color: #0000FF;\\\"><</span><span style=\\\"color: #008000;\\\">'0'</span> <span style=\\\"color: #008080;\\\">or</span> <span style=\\\"color: #000000;\\\">ch</span><span style=\\\"color: #0000FF;\\\">></span><span style=\\\"color: #008000;\\\">'9'</span> <span style=\\\"color: #008080;\\\">then</span>\\n <span style=\\\"color: #008080;\\\">return</span> <span style=\\\"color: #000000;\\\">3</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;\\\">Luhn</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">st</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;\\\">tests</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #0000FF;\\\">{</span><span style=\\\"color: #008000;\\\">\\\"US0378331005\\\"</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000080;font-style:italic;\\\">-- valid </span>\\n <span style=\\\"color: #008000;\\\">\\\"US0373831005\\\"</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000080;font-style:italic;\\\">-- not valid The transposition typo is caught by the checksum constraint.</span>\\n <span style=\\\"color: #008000;\\\">\\\"U50378331005\\\"</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000080;font-style:italic;\\\">-- not valid The substitution typo is caught by the format constraint.</span>\\n <span style=\\\"color: #008000;\\\">\\\"US03378331005\\\"</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000080;font-style:italic;\\\">-- not valid The duplication typo is caught by the format constraint.</span>\\n <span style=\\\"color: #008000;\\\">\\\"AU0000XVGZA3\\\"</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000080;font-style:italic;\\\">-- valid </span>\\n <span style=\\\"color: #008000;\\\">\\\"AU0000VXGZA3\\\"</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000080;font-style:italic;\\\">-- valid Unfortunately, not all transposition typos are caught by the checksum constraint.</span>\\n <span style=\\\"color: #008000;\\\">\\\"FR0000988040\\\"</span><span style=\\\"color: #0000FF;\\\">},</span> <span style=\\\"color: #000080;font-style:italic;\\\">-- valid</span>\\n\\n <span style=\\\"color: #000000;\\\">reasons</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #0000FF;\\\">{</span><span style=\\\"color: #008000;\\\">\\\"wrong checksum\\\"</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #008000;\\\">\\\"valid\\\"</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #008000;\\\">\\\"wrong length\\\"</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #008000;\\\">\\\"bad char\\\"</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #008000;\\\">\\\"wrong country\\\"</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 : %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><span style=\\\"color: #000000;\\\">reasons</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">valid_ISIN</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><span style=\\\"color: #000000;\\\">1</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\": \"(de isin (Str)\\n (let Str (mapcar char (chop Str))\\n (and\\n (= 12 (length Str))\\n (<= 65 (car Str) 90)\\n (<= 65 (cadr Str) 90)\\n (luhn\\n (pack\\n (mapcar\\n '((N)\\n (- N (if (<= 48 N 57) 48 55)) )\\n Str ) ) ) ) ) )\\n(println\\n (mapcar\\n isin\\n (quote\\n \\\"US0378331005\\\"\\n \\\"US0373831005\\\"\\n \\\"U50378331005\\\"\\n \\\"US03783310005\\\"\\n \\\"AU0000XVGZA3\\\"\\n \\\"AU0000VXGZA3\\\"\\n \\\"FR0000988040\\\" ) ) )\\n\",\n \"language\": \"PicoLisp\"\n },\n {\n \"code\": \"function Test-ISIN\\n{\\n [CmdletBinding()]\\n [OutputType([bool])]\\n Param\\n (\\n [Parameter(Mandatory=$true, Position=0)]\\n [ValidatePattern(\\\"[A-Z]{2}\\\\w{9}\\\\d\\\")]\\n [ValidateScript({$_.Length -eq 12})]\\n [string]\\n $Number\\n )\\n\\n function Split-Array\\n {\\n $array = @(), @()\\n $input | ForEach-Object {$array[($index = -not $index)] += $_}\\n $array[1], $array[0]\\n }\\n\\n filter ConvertTo-Digit\\n {\\n if ($_ -gt 9)\\n {\\n $_.ToString().ToCharArray() | ForEach-Object -Begin {$n = 0} -Process {$n += [Char]::GetNumericValue($_)} -End {$n}\\n }\\n else\\n {\\n $_\\n }\\n }\\n\\n\\n $checkDigit = $Number[-1]\\n\\n $digits = ($Number -replace \\\".$\\\").ToCharArray() | ForEach-Object {\\n if ([Char]::IsDigit($_))\\n {\\n [Char]::GetNumericValue($_)\\n }\\n else\\n {\\n [int][char]$_ - 55\\n }\\n }\\n\\n $odds, $evens = ($digits -join \\\"\\\").ToCharArray() | Split-Array\\n\\n if ($odds.Count -gt $evens.Count)\\n {\\n $odds = $odds | ForEach-Object {[Char]::GetNumericValue($_) * 2} | ConvertTo-Digit\\n $evens = $evens | ForEach-Object {[Char]::GetNumericValue($_)}\\n }\\n else\\n {\\n $odds = $odds | ForEach-Object {[Char]::GetNumericValue($_)}\\n $evens = $evens | ForEach-Object {[Char]::GetNumericValue($_) * 2} | ConvertTo-Digit\\n }\\n\\n $sum = ($odds | Measure-Object -Sum).Sum + ($evens | Measure-Object -Sum).Sum\\n\\n (10 - ($sum % 10)) % 10 -match $checkDigit\\n}\\n\",\n \"language\": \"PowerShell\"\n },\n {\n \"code\": \"\\\"US0378331005\\\",\\\"US0373831005\\\",\\\"US0337833103\\\",\\\"AU0000XVGZA3\\\",\\\"AU0000VXGZA3\\\",\\\"FR0000988040\\\" | ForEach-Object {\\n [PSCustomObject]@{\\n ISIN = $_\\n IsValid = Test-ISIN -Number $_\\n }\\n}\\n\",\n \"language\": \"PowerShell\"\n },\n {\n \"code\": \"EnableExplicit\\n\\nProcedure.b Check_ISIN(*c.Character)\\n Define count.i=0, Idx.i=1, v.i=0, i.i\\n Dim s.i(24)\\n\\n If MemoryStringLength(*c) > 12 : ProcedureReturn #False : EndIf\\n\\n While *c\\\\c\\n count+1\\n If *c\\\\c>='0' And *c\\\\c<='9'\\n If count<=2 : ProcedureReturn #False : EndIf\\n s(Idx)= *c\\\\c - '0'\\n Idx+1\\n ElseIf *c\\\\c>='A' And *c\\\\c<='Z'\\n s(Idx)= (*c\\\\c - ('A'-10)) / 10\\n Idx+1\\n s(Idx)= (*c\\\\c - ('A'-10)) % 10\\n Idx+1\\n Else\\n ProcedureReturn #False\\n EndIf\\n *c + SizeOf(Character)\\n Wend\\n\\n For i=Idx-2 To 0 Step -2\\n If s(i)*2 > 9\\n v+ s(i)*2 -9\\n Else\\n v+ s(i)*2\\n EndIf\\n v+s(i+1)\\n Next\\n\\n ProcedureReturn Bool(v%10=0)\\nEndProcedure\\n\\nDefine.s s\\nOpenConsole(\\\"Validate_International_Securities_Identification_Number (ISIN)\\\")\\n\\nIf ReadFile(0,\\\"c:\\\\code_pb\\\\rosettacode\\\\data\\\\isin.txt\\\")\\n While Not Eof(0)\\n s=ReadString(0)\\n Print(s+~\\\"\\\\t\\\")\\n If Check_ISIN(@s) : PrintN(\\\"TRUE\\\") : Else : PrintN(\\\"FALSE\\\") : EndIf\\n Wend\\n CloseFile(0)\\nEndIf\\nInput()\\n\",\n \"language\": \"PureBasic\"\n },\n {\n \"code\": \"def check_isin(a):\\n if len(a) != 12 or not all(c.isalpha() for c in a[:2]) or not all(c.isalnum() for c in a[2:]):\\n return False\\n s = \\\"\\\".join(str(int(c, 36)) for c in a)\\n return 0 == (sum(sum(divmod(2 * (ord(c) - 48), 10)) for c in s[-2::-2]) +\\n sum(ord(c) - 48 for c in s[::-2])) % 10\\n\\n# A more readable version\\ndef check_isin_alt(a):\\n if len(a) != 12:\\n return False\\n s = []\\n for i, c in enumerate(a):\\n if c.isdigit():\\n if i < 2:\\n return False\\n s.append(ord(c) - 48)\\n elif c.isupper():\\n if i == 11:\\n return False\\n s += divmod(ord(c) - 55, 10)\\n else:\\n return False\\n v = sum(s[::-2])\\n for k in s[-2::-2]:\\n k = 2 * k\\n v += k - 9 if k > 9 else k\\n return v % 10 == 0\\n\\n[check_isin(s) for s in [\\\"US0378331005\\\", \\\"US0373831005\\\", \\\"U50378331005\\\", \\\"US03378331005\\\",\\n \\\"AU0000XVGZA3\\\", \\\"AU0000VXGZA3\\\", \\\"FR0000988040\\\"]]\\n\\n# [True, False, False, False, True, True, True]\\n\",\n \"language\": \"Python\"\n },\n {\n \"code\": \" [ 2 split drop do\\n char A char z 1+ within\\n swap\\n char A char z 1+ within\\n and ] is 2chars ( $ --> b )\\n\\n [ dup size 12 != iff\\n [ drop false ] done\\n dup 2chars not iff\\n [ drop false ] done\\n [] swap\\n witheach\\n [ 36 base put\\n char->n\\n base release\\n number$ join ]\\n $->n drop luhn ] is isin ( n --> b )\\n\\n [ dup echo$\\n say \\\" is \\\"\\n isin not if\\n [ say \\\"not \\\" ]\\n say \\\"valid.\\\" cr ] is task ( n --> )\\n\\n $ \\\"US0378331005\\\" task\\n $ \\\"US0373831005\\\" task\\n $ \\\"U50378331005\\\" task\\n $ \\\"US03378331005\\\" task\\n $ \\\"AU0000XVGZA3\\\" task\\n $ \\\"AU0000VXGZA3\\\" task\\n $ \\\"FR0000988040\\\" task\\n\",\n \"language\": \"Quackery\"\n },\n {\n \"code\": \"#lang racket\\n\\n;; convert a base36 character (#\\\\0 - #\\\\Z) to its equivalent\\n;; in base 10 as a string (\\\"0\\\" - \\\"35\\\")\\n(define (base36-char->base10-string c)\\n (let ([char-int (char->integer (char-upcase c))]\\n [zero-int (char->integer #\\\\0)]\\n [nine-int (char->integer #\\\\9)]\\n [A-int (char->integer #\\\\A)]\\n [Z-int (char->integer #\\\\Z)])\\n (cond [(and (>= char-int zero-int) (<= char-int nine-int)) (~a c)]\\n [(and (>= char-int A-int) (<= char-int Z-int)) (~a (+ (- char-int A-int) 10))]\\n [else null])))\\n\\n;; substitute equivalent base 10 numbers for base 36 characters in string\\n;; this is a character-by-character substitution not a conversion\\n;; of a base36 number to a base10 number\\n(define (base36-string-characters->base10-string-characters s)\\n (for/fold ([joined \\\"\\\"])\\n ([tenstr (map base36-char->base10-string (string->list (string-upcase s)))])\\n (values (string-append joined tenstr))))\\n\\n;; This uses the Racket Luhn solution\\n(define [isin-test? s]\\n (let ([RE (pregexp \\\"^[A-Z]{2}[A-Z0-9]{9}[0-9]{1}$\\\")])\\n (and\\n (regexp-match? RE s)\\n (luhn-test (string->number (base36-string-characters->base10-string-characters s))))))\\n\\n(define test-cases '(\\\"US0378331005\\\" \\\"US0373831005\\\" \\\"U50378331005\\\" \\\"US03378331005\\\" \\\"AU0000XVGZA3\\\" \\\"AU0000VXGZA3\\\" \\\"FR0000988040\\\"))\\n\\n(map isin-test? test-cases)\\n;; -> '(#t #f #f #f #t #t #t)\\n\",\n \"language\": \"Racket\"\n },\n {\n \"code\": \"my $ISIN = /\\n ^ <[A..Z]>**2 <[A..Z0..9]>**9 <[0..9]> $\\n <?{ luhn-test $/.comb.map({ :36($_) }).join }>\\n/;\\n\\nsub luhn-test ($number --> Bool) {\\n my @digits = $number.comb.reverse;\\n my $sum = @digits[0,2...*].sum\\n + @digits[1,3...*].map({ |($_ * 2).comb }).sum;\\n return $sum %% 10;\\n}\\n\\n# Testing:\\n\\nsay \\\"$_ is { m/$ISIN/ ?? \\\"valid\\\" !! \\\"not valid\\\"}\\\" for <\\nUS0378331005\\nUS0373831005\\nU50378331005\\nUS03378331005\\nAU0000XVGZA3\\nAU0000VXGZA3\\nFR0000988040\\n>;\\n\",\n \"language\": \"Raku\"\n },\n {\n \"code\": \"/*REXX program validates the checksum digit for an International Securities ID number.*/\\nparse arg z /*obtain optional ISINs from the C.L.*/\\nif z='' then z= \\\"US0378331005 US0373831005 U50378331005 US03378331005 AU0000XVGZA3\\\" ,\\n 'AU0000VXGZA3 FR0000988040' /* [↑] use the default list of ISINs.*/\\n /* [↓] process all specified ISINs.*/\\n do n=1 for words(z); x=word(z, n); y= x /*obtain an ISIN from the Z list. */\\n $= /* [↓] construct list of ISIN digits. */\\n do k=1 for length(x); _= substr(x,k,1) /*the ISIN may contain alphabetic chars*/\\n p= pos(_, 0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZ) /*X must contain A──►Z, 0──►9.*/\\n if p==0 then y= /*trigger \\\"not\\\" valid below.*/\\n else $= $ || p-1 /*convert X string (base 36 ──► dec).*/\\n end /*k*/ /* [↑] convert alphabetic ──► digits.*/\\n @= /*placeholder for the \\\"not\\\" in message.*/\\n if length(y)\\\\==12 then @= \\\"not\\\" /*see if the ISIN is exactly 12 chars. */\\n if \\\\datatype( left(x,2),'U') then @= \\\"not\\\" /* \\\" \\\" \\\" \\\" 1st 2 chars cap. let.*/\\n if \\\\datatype(right(x,1),'W') then @= \\\"not\\\" /* \\\" \\\" \\\" \\\" last char not a digit*/\\n if @=='' then if \\\\luhn($) then @= \\\"not\\\" /* \\\" \\\" \\\" \\\" passed the Luhn test.*/\\n say right(x, 30) right(@, 5) \\\"valid\\\" /*display the yea or nay message.*/\\n end /*n*/ /* [↑] 1st 3 IFs could've been combined*/\\nexit /*stick a fork in it, we're all done. */\\n/*──────────────────────────────────────────────────────────────────────────────────────*/\\nLuhn: procedure; parse arg x; $= 0 /*get credit card number; zero $ sum. */\\n y= reverse( left(0, length(x) // 2)x) /*add leading zero if needed, & reverse*/\\n do j=1 to length(y)-1 by 2; _= 2 * substr(y, j+1, 1)\\n $= $ + substr(y, j, 1) + left(_, 1) + substr(_, 2 , 1, 0)\\n end /*j*/ /* [↑] sum the odd and even digits.*/\\n return right($, 1)==0 /*return \\\"1\\\" if number passed Luhn test*/\\n\",\n \"language\": \"REXX\"\n },\n {\n \"code\": \"# Project : Validate International Securities Identification Number\\n\\ndecimals(0)\\n\\ntest = [\\\"US0378331005\\\",\\n \\\"US0373831005\\\",\\n \\\"U50378331005\\\",\\n \\\"US03378331005\\\",\\n \\\"AU0000XVGZA3\\\",\\n \\\"AU0000VXGZA3\\\",\\n \\\"FR0000988040\\\"]\\n\\nfor n = 1 to len(test)\\n testold = test[n]\\n ascii1 = ascii(left(test[n],1))\\n ascii2 = ascii(substr(test[n],2,1))\\n if len(test[n]) != 12 or (ascii1 < 65 or ascii1 > 90) or (ascii2 < 65 or ascii2 > 90)\\n see test[n] + \\\" -> Invalid\\\" + nl\\n loop\\n ok\\n for m = 1 to len(test[n])\\n if ascii(test[n][m]) > 64 and ascii(test[n][m]) < 91\\n asc = ascii(test[n][m]) - 55\\n test[n] = left(test[n],m-1) + string(asc) + right(test[n],len(test[n])-m)\\n ok\\n next\\n see testold + \\\" -> \\\" + cardtest(test[n]) + nl\\nnext\\n\\nfunc cardtest(numstr)\\n revstring = revstr(numstr)\\n s1 = revodd(revstring)\\n s2 = reveven(revstring)\\n s3 =right(string(s1+s2), 1)\\n if s3 = \\\"0\\\"\\n return \\\"Valid\\\"\\n else\\n return \\\"Invalid\\\"\\n ok\\n\\nfunc revstr(str)\\n strnew = \\\"\\\"\\n for nr = len(str) to 1 step -1\\n strnew = strnew + str[nr]\\n next\\n return strnew\\n\\nfunc revodd(str)\\n strnew = \\\"\\\"\\n for nr = 1 to len(str) step 2\\n strnew = strnew + str[nr]\\n next\\n sumodd = 0\\n for p = 1 to len(strnew)\\n sumodd = sumodd + number(strnew[p])\\n next\\n return sumodd\\n\\nfunc reveven(str)\\n strnew = \\\"\\\"\\n for nr = 2 to len(str) step 2\\n strnew = strnew + str[nr]\\n next\\n lsteven = []\\n for p = 1 to len(strnew)\\n add(lsteven, string(2*number(strnew[p])))\\n next\\n arreven = list(len(lsteven))\\n for q = 1 to len(lsteven)\\n sum = 0\\n for w = 1 to len(lsteven[q])\\n sum = sum + lsteven[q][w]\\n next\\n arreven[q] = sum\\n next\\n sumarr = 0\\n for x = 1 to len(arreven)\\n sumarr = sumarr + arreven[x]\\n next\\n return sumarr\\n\",\n \"language\": \"Ring\"\n },\n {\n \"code\": \"RE = /\\\\A[A-Z]{2}[A-Z0-9]{9}[0-9]{1}\\\\z/\\n\\ndef valid_isin?(str)\\n return false unless str =~ RE\\n luhn(str.chars.map{|c| c.to_i(36)}.join)\\nend\\n\\np %w(US0378331005\\nUS0373831005\\nU50378331005\\nUS03378331005\\nAU0000XVGZA3\\nAU0000VXGZA3\\nFR0000988040).map{|tc| valid_isin?(tc) }\\t\\n\\n# => [true, false, false, false, true, true, true]\\n\",\n \"language\": \"Ruby\"\n },\n {\n \"code\": \"extern crate luhn_cc;\\n\\nuse luhn_cc::compute_luhn;\\n\\nfn main() {\\n assert_eq!(validate_isin(\\\"US0378331005\\\"), true);\\n assert_eq!(validate_isin(\\\"US0373831005\\\"), false);\\n assert_eq!(validate_isin(\\\"U50378331005\\\"), false);\\n assert_eq!(validate_isin(\\\"US03378331005\\\"), false);\\n assert_eq!(validate_isin(\\\"AU0000XVGZA3\\\"), true);\\n assert_eq!(validate_isin(\\\"AU0000VXGZA3\\\"), true);\\n assert_eq!(validate_isin(\\\"FR0000988040\\\"), true);\\n}\\n\\nfn validate_isin(isin: &str) -> bool {\\n // Preliminary checks to avoid working on non-ASCII stuff\\n if !isin.chars().all(|x| x.is_alphanumeric()) || isin.len() != 12 {\\n return false;\\n }\\n if !isin[..2].chars().all(|x| x.is_alphabetic())\\n || !isin[2..12].chars().all(|x| x.is_alphanumeric())\\n || !isin.chars().last().unwrap().is_numeric()\\n {\\n return false;\\n }\\n\\n // Converts the alphanumeric string in a numeric-only string\\n let bytes = isin.as_bytes();\\n\\n let s2 = bytes.iter()\\n .flat_map(|&c| {\\n if c.is_ascii_digit() {\\n vec![c]\\n }\\n else {\\n (c + 10 - ('A' as u8)).to_string().into_bytes()\\n }\\n }).collect::<Vec<u8>>();\\n\\n let string = std::str::from_utf8(&s2).unwrap();\\n let number = string.parse::<usize>().unwrap();\\n\\n return compute_luhn(number);\\n}\\n\",\n \"language\": \"Rust\"\n },\n {\n \"code\": \"data test;\\nlength isin $20 ok $1;\\ninput isin;\\nkeep isin ok;\\narray s{24};\\nlink isin;\\nreturn;\\nisin:\\nok=\\\"N\\\";\\nn=length(isin);\\nif n=12 then do;\\n j=0;\\n do i=1 to n;\\n k=rank(substr(isin,i,1));\\n if k>=48 & k<=57 then do;\\n if i<3 then return;\\n j+1;\\n s{j}=k-48;\\n end;\\n else if k>=65 & k<=90 then do;\\n if i=12 then return;\\n k+-55;\\n j+1;\\n s{j}=int(k/10);\\n j+1;\\n s{j}=mod(k,10);\\n end;\\n else return;\\n end;\\n\\n v=sum(of s{*});\\n do i=j-1 to 1 by -2;\\n v+s{i}-9*(s{i}>4);\\n end;\\n\\nif mod(v,10)=0 then ok=\\\"Y\\\";\\nend;\\nreturn;\\ncards;\\nUS0378331005\\nUS0373831005\\nU50378331005\\nUS03378331005\\nAU0000XVGZA3\\nAU0000VXGZA3\\nFR0000988040\\n;\\nrun;\\n\",\n \"language\": \"SAS\"\n },\n {\n \"code\": \"object Isin extends App {\\n val isins = Seq(\\\"US0378331005\\\", \\\"US0373831005\\\", \\\"U50378331005\\\",\\n \\\"US03378331005\\\", \\\"AU0000XVGZA3\\\",\\\"AU0000VXGZA3\\\", \\\"FR0000988040\\\")\\n\\n private def ISINtest(isin: String): Boolean = {\\n val isin0 = isin.trim.toUpperCase\\n\\n def luhnTestS(number: String): Boolean = {\\n\\n def luhnTestN(digits: Seq[Int]): Boolean = {\\n\\n def checksum(digits: Seq[Int]): Int = {\\n digits.reverse.zipWithIndex\\n .foldLeft(0) {\\n case (sum, (digit, i)) =>\\n if (i % 2 == 0) sum + digit\\n else sum + (digit * 2) / 10 + (digit * 2) % 10\\n } % 10\\n }\\n\\n checksum(digits) == 0\\n }\\n\\n luhnTestN(number.map { c =>\\n assert(c.isDigit, s\\\"$number has a non-digit error\\\")\\n c.asDigit\\n })\\n }\\n\\n if (!isin0.matches(\\\"^[A-Z]{2}[A-Z0-9]{9}\\\\\\\\d$\\\")) false\\n else {\\n val sb = new StringBuilder\\n for (c <- isin0.substring(0, 12)) sb.append(Character.digit(c, 36))\\n luhnTestS(sb.toString)\\n }\\n }\\n\\n isins.foreach(isin => println(f\\\"$isin is ${if (ISINtest(isin)) \\\"\\\" else \\\"not\\\"}%s valid\\\"))\\n\\n}\\n\",\n \"language\": \"Scala\"\n },\n {\n \"code\": \"--#SET TERMINATOR @\\n\\nSET SERVEROUTPUT ON @\\n\\nCREATE OR REPLACE FUNCTION VALIDATE_ISIN (\\n IN IDENTIFIER VARCHAR(12)\\n ) RETURNS SMALLINT\\n -- ) RETURNS BOOLEAN\\n BEGIN\\n DECLARE CHECKSUM_FUNC CHAR(1);\\n DECLARE CONVERTED VARCHAR(24);\\n DECLARE I SMALLINT;\\n DECLARE LENGTH SMALLINT;\\n DECLARE RET SMALLINT DEFAULT 1;\\n --DECLARE RET BOOLEAN DEFAULT FALSE;\\n DECLARE CHAR_AT CHAR(1);\\n DECLARE INVALID_CHAR CONDITION FOR SQLSTATE 'ISIN1';\\n\\n SET CHAR_AT = SUBSTR(IDENTIFIER, 1, 1);\\n IF (ASCII(CHAR_AT) < 65 OR 90 < ASCII(CHAR_AT)) THEN\\n SIGNAL INVALID_CHAR SET MESSAGE_TEXT = 'Country code with invalid characters';\\n END IF;\\n SET CHAR_AT = SUBSTR(IDENTIFIER, 2, 1);\\n IF (ASCII(CHAR_AT) < 65 OR 90 < ASCII(CHAR_AT)) THEN\\n SIGNAL INVALID_CHAR SET MESSAGE_TEXT = 'Country code with invalid characters';\\n END IF;\\n\\n -- Convert letters to numbers.\\n SET I = 1;\\n SET CONVERTED = '';\\n SET LENGTH = LENGTH(IDENTIFIER);\\n WHILE (I <= LENGTH) DO\\n SET CHAR_AT = SUBSTR(IDENTIFIER, I, 1);\\n IF (48 <= ASCII(CHAR_AT) AND ASCII(CHAR_AT) <= 57) THEN\\n SET CONVERTED = CONVERTED || CHAR_AT;\\n ELSE\\n SET CONVERTED = CONVERTED || (ASCII(CHAR_AT) - 55);\\n END IF;\\n SET I = I + 1;\\n END WHILE;\\n\\n CALL DBMS_OUTPUT.PUT_LINE(CONVERTED);\\n\\n -- This function is implemented in Rosetta code.\\n SET CHECKSUM_FUNC = LUHN_TEST(CONVERTED);\\n IF (CHECKSUM_FUNC = 0) THEN\\n SET RET = 0;\\n --SET RET = TRUE;\\n END IF;\\n\\n RETURN RET;\\n END @\\n\",\n \"language\": \"SQL-PL\"\n },\n {\n \"code\": \"package require Tcl 8.6 ;# mostly needed for [assert]. Substitute a simpler one or a NOP if required.\\n\",\n \"language\": \"Tcl\"\n },\n {\n \"code\": \"proc assert {expr} { ;# for \\\"static\\\" assertions that throw nice errors\\n if {![uplevel 1 [list expr $expr]]} {\\n set msg \\\"{$expr}\\\"\\n catch {append msg \\\" {[uplevel 1 [list subst -noc $expr]]}\\\"}\\n tailcall throw {ASSERT ERROR} $msg\\n }\\n}\\n\",\n \"language\": \"Tcl\"\n },\n {\n \"code\": \"namespace eval isin {\\n proc _init {} { ;# sets up the map used on every call\\n variable map\\n set alphabet abcdefghijklmnopqrstuvwxyz\\n set n 9\\n lmap c [split $alphabet \\\"\\\"] {\\n lappend map $c [incr n]\\n }\\n }\\n _init\\n\\n proc normalize {isin} {\\n variable map\\n string map $map [string tolower [string trim $isin]]\\n }\\n\\n # copied from \\\"Luhn test of credit card numbers\\\"\\n # included here for ease of testing, and because it is short\\n proc luhn digitString {\\n if {[regexp {[^0-9]} $digitString]} {error \\\"not a number\\\"}\\n set sum 0\\n set flip 1\\n foreach ch [lreverse [split $digitString {}]] {\\n incr sum [lindex {\\n {0 1 2 3 4 5 6 7 8 9}\\n {0 2 4 6 8 1 3 5 7 9}\\n } [expr {[incr flip] & 1}] $ch]\\n }\\n return [expr {($sum % 10) == 0}]\\n }\\n\\n proc validate {isin} {\\n if {![regexp {^[A-Z]{2}[A-Z0-9]{9}[0-9]$} $isin]} {return false}\\n luhn [normalize $isin]\\n }\\n\\n}\\n\",\n \"language\": \"Tcl\"\n },\n {\n \"code\": \"package require tcltest\\n\\ntcltest::test isin-1 \\\"Test isin validation\\\" -body {\\n foreach {isin ok} {\\n US0378331005 yes\\n US0373831005 no\\n U50378331005 no\\n US03378331005 no\\n AU0000XVGZA3 yes\\n AU0000VXGZA3 yes\\n FR0000988040 yes\\n } {\\n if {$ok} {\\n assert {[isin::validate $isin]}\\n } else {\\n assert {![isin::validate $isin]}\\n }\\n }\\n return ok\\n} -result ok\\n\",\n \"language\": \"Tcl\"\n },\n {\n \"code\": \"CREATE FUNCTION dbo._ISINCheck( @strISIN VarChar(40) )\\nRETURNS bit\\nAS\\nBEGIN\\n--*** Test an ISIN code and return 1 if it is valid, 0 if invalid.\\nDECLARE @bValid\\t bit;\\n\\nSET @bValid = CASE WHEN @strISIN LIKE '[A-Z][A-Z][A-Z,0-9][A-Z,0-9][A-Z,0-9][A-Z,0-9][A-Z,0-9][A-Z,0-9][A-Z,0-9][A-Z,0-9][A-Z,0-9][0-9]' THEN 1 ELSE 0 END\\nIF @bValid = 1\\n\\tBEGIN\\n\\t\\tDECLARE @strTest VarChar(40) = '';\\n\\t\\tDECLARE @strAdd VarChar(2);\\n\\t\\tDECLARE @p INT = 0;\\n\\t\\tWHILE @p < LEN(@strISIN)\\n\\t\\t\\tBEGIN\\n\\t\\t\\t\\tSET @p = @p+1;\\n\\t\\t\\t\\tSET @strAdd = SUBSTRING(@strISIN,@p,1);\\n\\t\\t\\t\\tIF @strAdd LIKE '[A-Z]' SET @strAdd = CONVERT(VarChar(2),ASCII(UPPER(@strAdd))-55);\\n\\t\\t\\t\\tSET @strTest = @strTest + @strAdd;\\n\\t\\t\\tEND;\\n\\n\\t\\t-- Proceed with Luhn test\\n\\t\\tDECLARE @strLuhn VarChar(40) = REVERSE(@strTest); -- usage: set once, never changed\\n\\t\\tDECLARE @strS2Values VarChar(10) = '0246813579'; -- constant: maps digits to their S2 summed values\\n\\t\\tSET @p = 0; -- reset loop counter\\n\\t\\tDECLARE @intValue INT;\\n\\t\\tDECLARE @intSum\\tINT = 0;\\n\\t\\t-- loop through the reversed string, get the value (even-positioned digits are mapped) and add it to @intSum\\n\\t\\tWHILE @p < LEN(@strLuhn)\\n\\t\\t\\tBEGIN\\n\\t\\t\\t\\tSET @p = @p+1;\\n\\t\\t\\t\\tSET @intValue = CONVERT(INT, SUBSTRING(@strLuhn,@p,1) ) -- value of the digit at position @p in the string\\n\\t\\t\\t\\tIF @p % 2 = 0\\tSET @intValue = CONVERT(INT,SUBSTRING(@strS2Values,@intValue+1,1))\\n\\t\\t\\t\\tSET @intSum = @intSum + @intValue\\n\\t\\t\\tEND\\n\\t\\t-- If the of the digits' mapped values ends in 0 (modulo 10 = 0) then the Luhn test succeeds\\n\\t\\tSET @bValid = CASE WHEN @intSum % 10 = 0 THEN 1 ELSE 0 END\\n\\tEND;\\n\\nRETURN @bValid\\nEND\\n\",\n \"language\": \"Transact-SQL\"\n },\n {\n \"code\": \"-- Testing. The following tests all pass.\\n;WITH ISIN_Tests AS\\n( SELECT 'US0378331005' AS ISIN, 1 Expected\\n UNION SELECT 'US0373831005',0\\n UNION SELECT 'U50378331005',0\\n UNION SELECT 'US03378331005',0\\n UNION SELECT 'AU0000XVGZA3',1\\n UNION SELECT 'AU0000VXGZA3',1\\n UNION SELECT 'FR0000988040',1\\n UNION SELECT '0___garbage',0\\n UNION SELECT '',0\\n)\\nSELECT ISIN, Expected, dbo._ISINCheck(ISIN) AS TestResult FROM ISIN_Tests ORDER BY ISIN\\n\",\n \"language\": \"Transact-SQL\"\n },\n {\n \"code\": \"import regex\\n\\nconst (\\n inc = [\\n [0, 1, 2, 3, 4, 5, 6, 7, 8, 9],\\n [0, 2, 4, 6, 8, 1, 3, 5, 7, 9],\\n ]\\n)\\n\\nfn valid_isin(n string) bool {\\n mut r,_,_ := regex.regex_base('^[A-Z]{2}[A-Z0-9]{9}\\\\d$')\\n if !r.matches_string(n) {\\n return false\\n }\\n mut sum := 0\\n mut p := 0\\n for i := 10; i >= 0; i-- {\\n p = 1 - p\\n mut d := n[i..i+1].int()\\n if d < 'A'.int() {\\n sum += inc[p][d-'0'.int()]\\n } else {\\n d -= 'A'.int()\\n sum += inc[p][d%10]\\n p = 1 - p\\n sum += inc[p][d/10+1]\\n }\\n }\\n sum += n[11..12].int() - '0'.int()\\n return sum%10 == 0\\n}\\n\\nstruct Testcases {\\n isin string\\n valid bool\\n}\\n\\nfn main(){\\n testcases := [\\n Testcases{\\\"US0378331005\\\", true},\\n Testcases{\\\"US0373831005\\\", false},\\n Testcases{\\\"U50378331005\\\", false},\\n Testcases{\\\"US03378331005\\\", false},\\n Testcases{\\\"AU0000XVGZA3\\\", true},\\n Testcases{\\\"AU0000VXGZA3\\\", true},\\n Testcases{\\\"FR0000988040\\\", true},\\n ]\\n\\n for testcase in testcases {\\n actual := valid_isin(testcase.isin)\\n if actual != testcase.valid {\\n println(\\\"expected ${testcase.valid} for ${testcase.isin}, got $actual\\\")\\n }\\n }\\n}\\n\",\n \"language\": \"V-(Vlang)\"\n },\n {\n \"code\": \"' Validate International Securities Identification Number - 03/03/2019\\n\\nbuf=buf&test(\\\"US0378331005\\\")&vbCrLf\\nbuf=buf&test(\\\"US0373831005\\\")&vbCrLf\\nbuf=buf&test(\\\"U50378331005\\\")&vbCrLf\\nbuf=buf&test(\\\"US03378331005\\\")&vbCrLf\\nbuf=buf&test(\\\"AU0000XVGZA3\\\")&vbCrLf\\nbuf=buf&test(\\\"AU0000VXGZA3\\\")&vbCrLf\\nbuf=buf&test(\\\"FR0000988040\\\")&vbCrLf\\nmsgbox buf,,\\\"Validate International Securities Identification Number\\\"\\n\\nfunction test(cc)\\n\\tdim err,c,r,s,i1,i2\\n\\tif len(cc)=12 then\\n\\t\\tfor i=1 to len(cc)\\n\\t\\t\\tp=instr(\\\"0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZ\\\",mid(cc,i,1))\\n\\t\\t\\tif p<>0 then c=c&(p-1) else err=1\\n\\t\\tnext 'i\\n\\t\\tfor i=1 to 2\\n\\t\\t\\tif instr(\\\"ABCDEFGHIJKLMNOPQRSTUVWXYZ\\\",mid(cc,i,1))=0 then err=1\\n\\t\\tnext 'i\\n\\t\\tif err=0 then\\n\\t\\t\\tfor i=len(c) to 1 step -1\\n\\t\\t\\t\\tr=r&mid(c,i,1)\\n\\t\\t\\tnext 'i\\n\\t\\t\\tfor i=1 to len(r) step 2\\n\\t\\t\\t\\ti1=i1+cint(mid(r,i,1))\\n\\t\\t\\tnext 'i\\n\\t\\t\\tfor i=2 to len(r) step 2\\n\\t\\t\\t\\tii=cint(mid(r,i,1))*2\\n\\t\\t\\t\\tif ii>=10 then ii=ii-9\\n\\t\\t\\t\\ti2=i2+ii\\n\\t\\t\\tnext 'i\\n\\t\\t\\ts=cstr(i1+i2)\\n\\t\\t\\tif mid(s,len(s),1)=\\\"0\\\" then\\n\\t\\t\\t\\tmsg=\\\"valid\\\"\\n\\t\\t\\telse\\n\\t\\t\\t\\tmsg=\\\"invalid ??1\\\"\\n\\t\\t\\tend if\\n\\t\\telse\\n\\t\\t\\tmsg=\\\"invalid ??2\\\"\\n\\t\\tend if\\n\\telse\\n\\t\\tmsg=\\\"invalid ??3\\\"\\n\\tend if\\n\\ttest=cc&\\\" \\\"&msg\\nend function 'test\\n\",\n \"language\": \"VBScript\"\n },\n {\n \"code\": \"Function IsValidISIN(ByVal ISIN As String) As Boolean\\nDim s As String, c As String\\nDim i As Long\\n If Len(ISIN) = 12 Then\\n For i = 1 To Len(ISIN)\\n c = UCase$(Mid(ISIN, i, 1))\\n Select Case c\\n Case \\\"A\\\" To \\\"Z\\\"\\n If i = 12 Then Exit Function\\n s = s & CStr(Asc(c) - 55)\\n Case \\\"0\\\" To \\\"9\\\"\\n If i < 3 Then Exit Function\\n s = s & c\\n Case Else\\n Exit Function\\n End Select\\n Next i\\n IsValidISIN = LuhnCheckPassed(s)\\n End If\\nEnd Function\\n\",\n \"language\": \"Visual-Basic\"\n },\n {\n \"code\": \"Sub Main()\\n Debug.Assert IsValidISIN(\\\"US0378331005\\\")\\n Debug.Assert Not IsValidISIN(\\\"US0373831005\\\")\\n Debug.Assert Not IsValidISIN(\\\"U50378331005\\\")\\n Debug.Assert Not IsValidISIN(\\\"US03378331005\\\")\\n Debug.Assert IsValidISIN(\\\"AU0000XVGZA3\\\")\\n Debug.Assert IsValidISIN(\\\"AU0000VXGZA3\\\")\\n Debug.Assert IsValidISIN(\\\"FR0000988040\\\")\\n Debug.Assert Not IsValidISIN(\\\"FR000098804O\\\")\\nEnd Sub\\n\",\n \"language\": \"Visual-Basic\"\n },\n {\n \"code\": \"Option Strict On\\nImports System.Text.RegularExpressions\\n\\nModule Module1\\n ReadOnly IsinRegex As New Regex(\\\"^[A-Z]{2}[A-Z0-9]{9}\\\\d$\\\", RegexOptions.Compiled)\\n\\n Function DigitValue(c As Char) As Integer\\n Dim temp As Integer\\n If Asc(c) >= Asc(\\\"0\\\"c) AndAlso Asc(c) <= Asc(\\\"9\\\"c) Then\\n temp = Asc(c) - Asc(\\\"0\\\"c)\\n Else\\n temp = Asc(c) - Asc(\\\"A\\\"c) + 10\\n End If\\n Return temp\\n End Function\\n\\n Function LuhnTest(number As String) As Boolean\\n Return number.Select(Function(c, i) (AscW(c) - 48) << ((number.Length - i - 1) And 1)).Sum(Function(n) If(n > 9, n - 9, n)) Mod 10 = 0\\n End Function\\n\\n Function Digitize(isin As String) As String\\n Return String.Join(\\\"\\\", isin.Select(Function(c) $\\\"{DigitValue(c)}\\\"))\\n End Function\\n\\n Function IsValidIsin(isin As String) As Boolean\\n Return IsinRegex.IsMatch(isin) AndAlso LuhnTest(Digitize(isin))\\n End Function\\n\\n Sub Main()\\n Dim isins() = {\\n \\\"US0378331005\\\",\\n \\\"US0373831005\\\",\\n \\\"U50378331005\\\",\\n \\\"US03378331005\\\",\\n \\\"AU0000XVGZA3\\\",\\n \\\"AU0000VXGZA3\\\",\\n \\\"FR0000988040\\\"\\n }\\n\\n For Each isin In isins\\n If IsValidIsin(isin) Then\\n Console.WriteLine(\\\"{0} is valid\\\", isin)\\n Else\\n Console.WriteLine(\\\"{0} is not valid\\\", isin)\\n End If\\n Next\\n End Sub\\n\\nEnd Module\\n\",\n \"language\": \"Visual-Basic-.NET\"\n },\n {\n \"code\": \"import \\\"./str\\\" for Char\\nimport \\\"./iterate\\\" for Stepped\\nimport \\\"./fmt\\\" for Conv, Fmt\\n\\nvar luhn = Fn.new { |s|\\n s = s[-1..0]\\n var s1 = Stepped.new(s, 2).reduce(0) { |sum, d| sum + d.bytes[0] - 48 }\\n var s2 = Stepped.new(s[1..-1], 2).reduce(0) { |sum, d|\\n var d2 = (d.bytes[0] - 48) * 2\\n return sum + ((d2 > 9) ? d2%10 + 1 : d2)\\n }\\n return (s1 + s2)%10 == 0\\n}\\n\\nvar isin = Fn.new { |s|\\n if (!(s is String && s.count == 12)) return false\\n for (i in 0..11) {\\n var c = s[i]\\n if (i <= 1) {\\n if (!Char.isUpper(c)) return false\\n } else if (i >= 2 && i <= 10) {\\n if (!Char.isUpper(c) && !Char.isDigit(c)) return false\\n } else {\\n if (!Char.isDigit(c)) return false\\n }\\n }\\n var dec = \\\"\\\"\\n for (i in 0...s.count) dec = dec + \\\"%(Conv.atoi(s[i], 36))\\\"\\n return luhn.call(dec)\\n}\\n\\nvar tests = [\\n \\\"US0378331005\\\", \\\"US0373831005\\\", \\\"U50378331005\\\", \\\"US03378331005\\\",\\n \\\"AU0000XVGZA3\\\", \\\"AU0000VXGZA3\\\", \\\"FR0000988040\\\"\\n]\\n\\nfor (test in tests) {\\n var ans = (isin.call(test)) ? \\\"valid\\\" : \\\"not valid\\\"\\n System.print(\\\"%(Fmt.s(-13, test)) -> %(ans)\\\")\\n}\\n\",\n \"language\": \"Wren\"\n },\n {\n \"code\": \"string 0; \\\\use zero-terminated strings\\n\\nfunc Luhn(Str); \\\\Return 'true' if digits in Str pass Luhn test\\nchar Str;\\nint Len, Sum, I, Dig;\\n[Len:= 0; \\\\find length of Str\\nwhile Str(Len) do Len:= Len+1;\\nSum:= 0; \\\\sum even and odd digits\\nfor I:= 0 to Len-1 do \\\\(no need to reverse)\\n [if (I xor Len) & 1 then\\n Sum:= Sum + Str(I) - ^0\\n else [Dig:= Str(I) - ^0;\\n Dig:= Dig*2;\\n Sum:= Sum + Dig/10 + rem(0);\\n ];\\n ];\\nreturn rem(Sum/10) = 0;\\n]; \\\\Luhn\\n\\nfunc Valid(Str); \\\\Return 'true' if valid ISIN code\\nchar Str, Str2(100);\\nint Sum, I, J, C, V;\\n[J:= 0;\\nfor I:= 0 to 12-1 do \\\\convert letters in Str to digits in Str2\\n [C:= Str(I);\\n case of\\n C>=^0 & C<=^9: [Str2(J):= C; J:= J+1];\\n C>=^A & C<=^Z: [Str2(J):= (C-^A+10)/10 + ^0; J:= J+1;\\n Str2(J):= rem(0) + ^0; J:= J+1]\\n other return false;\\n if I=1 & J#4 then return false; \\\\first two chars not letters\\n ];\\nif Str(I) # 0 then return false; \\\\too long\\nStr2(J):= 0; \\\\terminate string\\nreturn Luhn(Str2);\\n]; \\\\Valid\\n\\nint ISIN, N;\\n[ISIN:= [\\\"US0378331005\\\",\\n \\\"US0373831005\\\",\\n \\\"U50378331005\\\",\\n \\\"US03378331005\\\",\\n \\\"AU0000XVGZA3\\\",\\n \\\"AU0000VXGZA3\\\",\\n \\\"FR0000988040\\\"];\\nfor N:= 0 to 7-1 do\\n [Text(0, ISIN(N));\\n Text(0, if Valid(ISIN(N))\\n then \\\" is valid\\\"\\n else \\\" is not valid\\\");\\n CrLf(0);\\n ];\\n]\\n\",\n \"language\": \"XPL0\"\n },\n {\n \"code\": \"sub luhntest(cardnr$)\\n local i, j, s1, s2, l\\n\\n cardnr$ = Trim$(cardnr$) // remove spaces\\n\\n l = Len(cardnr$)\\n\\n // sum odd numbers\\n For i = l To 1 Step -2\\n s1 = s1 + (asc(mid$(cardnr$, i, 1)) - Asc(\\\"0\\\"))\\n Next\\n // sum even numbers\\n For i = l-1 To 1 Step -2\\n j = asc(mid$(cardnr$, i, 1)) - Asc(\\\"0\\\")\\n j = j * 2\\n If j > 9 j = mod(j, 10) + 1\\n s2 = s2 + j\\n Next\\n\\n return mod(s1 + s2, 10) = 0\\nEnd sub\\n\\n// ------=< MAIN >=-----\\n\\ndata \\\"US0378331005\\\", \\\"US0373831005\\\", \\\"U50378331005\\\", \\\"US03378331005\\\", \\\"AU0000XVGZA3\\\", \\\"AU0000VXGZA3\\\", \\\"FR0000988040\\\", \\\"\\\"\\n\\ndo\\n read test_item$\\n if test_item$ = \\\"\\\" break\\n\\n l = Len(test_item$)\\n If l <> 12 Then\\n Print test_item$, \\\" Invalid, length <> 12 char.\\\"\\n Continue\\n End If\\n c1$ = mid$(test_item$, 1, 1) : c2$ = mid$(test_item$, 2, 1)\\n If c1$ < \\\"A\\\" Or c1$ > \\\"Z\\\" or c2$ < \\\"A\\\" or c2$ > \\\"Z\\\" Then\\n Print test_item$, \\\" Invalid, number needs to start with 2 characters\\\"\\n Continue\\n End If\\n test_str$ = \\\"\\\"\\n For n = 1 To l\\n x = asc(mid$(test_item$, n, 1)) - Asc(\\\"0\\\")\\n // if is a letter we to correct for that\\n If x > 9 x = x - 7\\n If x < 10 Then\\n test_str$ = test_str$ + Str$(x)\\n Else // two digest number\\n test_str$ = test_str$ + Str$(int(x / 10)) + Str$(mod(x, 10))\\n End If\\n Next\\n Print test_item$;\\n if luhntest(test_str$) then print \\\" Valid\\\" else print \\\" Invalid, checksum error\\\" end if\\nloop\\n\",\n \"language\": \"Yabasic\"\n },\n {\n \"code\": \"fcn validateISIN(isin){\\n RegExp(String(\\\"^\\\",\\\"[A-Z]\\\"*2,\\\"[A-Z0-9]\\\"*9,\\\"[0-9]$\\\")).matches(isin) and\\n luhnTest(isin.split(\\\"\\\").apply(\\\"toInt\\\",36).concat().toInt())\\n}\\nfcn luhnTest(n){\\n 0 == (n.split().reverse().reduce(fcn(s,n,clk){\\n s + if(clk.inc()%2) n else 2*n%10 + n/5 },0,Ref(1)) %10)\\n}\\n\",\n \"language\": \"Zkl\"\n },\n {\n \"code\": \"println(\\\" ISIN Valid?\\\");\\nforeach isin in (T(\\\"US0378331005\\\",\\\"US0373831005\\\",\\\"U50378331005\\\",\\n\\t \\\"US03378331005\\\",\\\"AU0000XVGZA3\\\",\\\"AU0000VXGZA3\\\",\\\"FR0000988040\\\")){\\n println(isin,\\\" --> \\\",validateISIN(isin));\\n}\\n\",\n \"language\": \"Zkl\"\n }\n]","isConversational":false},"task_name":{"kind":"string","value":"Validate-International-Securities-Identification-Number"}}},{"rowIdx":1794,"cells":{"solutions":{"kind":"list like","value":[{"code":"---\nfrom: http://rosettacode.org/wiki/Vampire_number\nnote: Mathematics\n","language":"00-META"},{"code":"A [[wp:Vampire_number|vampire number]] is a natural decimal number with an even number of digits, that can be factored into two integers. \n\nThese two factors are called the ''fangs'', and must have the following properties:\n::* they each contain half the number of the decimal digits of the original number\n::* together they consist of exactly the same decimal digits as the original number\n::* at most one of them has a trailing zero\n\n\nAn example of a vampire number and its fangs: <code> 1260 : (21, 60) </code>\n\n\n;Task:\n# Print the first '''25''' vampire numbers and their fangs. \n# Check if the following numbers are vampire numbers and, if so, print them and their fangs: \n<big><code> 16758243290880, 24959017348650, 14593825548650 </code></big>\n\n\nNote that a vampire number can have more than one pair of fangs.\n\n\n;See also:\n* [http://www.numberphile.com/videos/vampire_numbers.html numberphile.com].\n* [http://users.cybercity.dk/~dsl522332/math/vampires/ vampire search algorithm]\n* [[oeis:A014575|vampire numbers on OEIS]]\n<br><br>\n\n","language":"00-TASK"},{"code":"-V Pow10 = (0..18).map(n -> Int64(10) ^ n)\n\nF isOdd(n)\n R (n [&] 1) != 0\n\nF fangs(n)\n [(Int64, Int64)] r\n\n V nDigits = sorted(String(n))\n I isOdd(nDigits.len)\n R r\n\n V fangLen = nDigits.len I/ 2\n V inf = Pow10[fangLen - 1]\n L(d) inf .< inf * 10\n I n % d != 0\n L.continue\n V q = n I/ d\n I q < d\n R r\n V dDigits = String(d)\n V qDigits = String(q)\n I qDigits.len > fangLen\n L.continue\n I qDigits.len < fangLen\n R r\n I nDigits != sorted(dDigits‘’qDigits)\n L.continue\n I dDigits.last != ‘0’ | qDigits.last != ‘0’\n r.append((d, q))\n\n R r\n\nprint(‘First 25 vampire numbers with their fangs:’)\nV count = 0\nV n = 10\nV limit = 100\nL count != 25\n V fangList = fangs(n)\n I !fangList.empty\n count++\n print((‘#2: #6 =’.format(count, n))‘ ’fangList.map(it -> ‘#3 x #3’.format(it[0], it[1])).join(‘ = ’))\n n++\n I n == limit\n n *= 10\n limit *= 10\n\nprint()\nL(n) [16'758'243'290'880, 24'959'017'348'650, 14'593'825'548'650]\n V fangList = fangs(n)\n I fangList.empty\n print(n‘ is not vampiric.’)\n E\n print(n‘ = ’fangList.map(it -> ‘#. x #.’.format(it[0], it[1])).join(‘ = ’))\n","language":"11l"},{"code":"SetBatchLines -1 ; used to improve performance\n; (you can make it much faster by removing the informative tooltips)\n\n;********************\n; CONFIG\n;********************\nStartingNumber := 10\nNumberLimit := 126030\nCounterLimit := 25 ; calculations stop when one of these limits is reached\nAdditionalNumbers := \"16758243290880,24959017348650,14593825548650\"\n;********************\n\nCurrentCounter := 0, CurrentNumber := StartingNumber\n\nLoop {\n if !Mod(A_Index,75) ; informative tooltip (every 75 calculations, to avoid slowing down)\n ToolTip, % \"Checking numbers...`nNumber: \" CurrentNumber\n . \"/\" NumberLimit \"`nFound: \" CurrentCounter \"/\" CounterLimit\n if ( CurrentCounter >= CounterLimit ) || ( CurrentNumber >= NumberLimit )\n Break\n if Mod(StrLen(CurrentNumber),2)\n CurrentNumber *= 10\n else if ( ( CurrentResult := GetFangs(CurrentNumber) ) <> \"\" )\n Output .= \"`n\" CurrentNumber \":`t\" CurrentResult, CurrentCounter++\n CurrentNumber++\n}\nToolTip ; hide informative tooltip\n\nMsgBox % SubStr(Output,2) ; show output (first part)\n\nOutput := \"\"\nLoop, Parse, AdditionalNumbers, % \",\"\n{\n ToolTip, % \"Getting fangs for \" A_LoopField \" ...\" ; informative tooltip\n Output .= \"`n\" A_LoopField \":`n`t\" GetFangs(A_LoopField) \"`n\"\n}\nToolTip ; hide informative tooltip\n\nMsgBox % SubStr(Output,2) ; show output (second part - additional numbers)\nExitApp\n\n;----------------------------------------------------------------------------------\n\nCharSorter(Input) { ; required by GetFangs()\n Loop, Parse, Input\n Output .= A_LoopField \"`n\"\n Sort, Output\n StringReplace, Output, Output, % \"`n\",, All\n Return Output\n}\n\n;----------------------------------------------------------------------------------\n\nGetFangs(CurrentNumber) { ; requires CharSorter()\n ResultIndex := 1\n Length := StrLen(CurrentNumber)\n Power := (Length//2)-1\n if Mod(Length,2) OR !Power\n Return \"\"\n NumberLimit := Floor(Sqrt(CurrentNumber))\n Lower := 10 ** Power\n Loop, % NumberLimit - Lower {\n if !Mod(CurrentNumber,Lower) {\n FactorTwo := CurrentNumber//Lower\n if ( !Mod(Lower,10) && !Mod(FactorTwo,10) )\n Return \"\"\n Check := CharSorter( Lower . FactorTwo )\n if (CharSorter(CurrentNumber) = Check) && (StrLen(Lower) = StrLen(FactorTwo))\n Output .= \"`n`t[\" Lower \",\" FactorTwo \"]\"\n }\n Lower++\n }\n Return SubStr(Output,3) ; 3 = 1 + length of \"`n`t\"\n}\n","language":"AutoHotkey"},{"code":"( ( vampire\n = N len R fangsList\n . !arg:@(?N:? [?len)\n & 1/2*!len:~/:?len\n & ( R\n = len numpart left right allowed fangs rdigits\n , tried digit untried head tail found\n . !arg:(?len.?left.?numpart.?allowed)\n & :?found\n & ( !len:>0\n & ( @( !numpart\n : ?tried\n ( #%@?digit\n & !allowed:?head !digit ?tail\n & !head !tail:?allowed\n )\n ( ?untried\n & R\n $ ( !len+-1\n . 10*!left+!digit\n . str$(!tried !untried)\n . 0 1 2 3 4 5 6 7 8 9\n )\n : ?fangs\n & !found !fangs:?found\n & ~\n )\n )\n | !found\n )\n | !N*!left^-1:~/?right:~<!left:?rdigits\n & (!left*1/10:/|!right*1/10:/)\n & ( @( !numpart\n : ?\n ( #%@?digit ?\n & @(!rdigits:?head !digit ?tail)\n & str$(!head !tail):?rdigits\n & ~\n )\n )\n | !rdigits:&(!left,!right)\n )\n )\n )\n & R$(!len.0.!N.1 2 3 4 5 6 7 8 9)\n : (\n | ?fangsList\n & out$(!N !fangsList)\n & 1+!count:?count\n )\n )\n& 0:?count\n& 10:?i\n& 16758243290880 24959017348650 14593825548650:?bignums\n& whl\n ' ( ( vampire$!i&1+!i:?i\n | !i*10:?i\n )\n & (!count:<25|!bignums:%?i ?bignums)\n )\n);\n","language":"Bracmat"},{"code":"#include <stdio.h>\n#include <stdlib.h>\n#include <stdint.h>\n#include <math.h>\n\ntypedef uint64_t xint;\ntypedef unsigned long long ull;\n\nxint tens[20];\n\ninline xint max(xint a, xint b) { return a > b ? a : b; }\ninline xint min(xint a, xint b) { return a < b ? a : b; }\ninline int ndigits(xint x)\n{\n\tint n = 0;\n\twhile (x) n++, x /= 10;\n\treturn n;\n}\n\ninline xint dtally(xint x)\n{\n\txint t = 0;\n\twhile (x) t += 1<<((x%10) * 6), x /= 10;\n\n\treturn t;\n}\n\nint fangs(xint x, xint *f)\n{\n\tint n = 0;\n\tint nd = ndigits(x);\n\tif (nd & 1) return 0;\n\tnd /= 2;\n\n\txint lo, hi;\n\tlo = max(tens[nd-1], (x + tens[nd] - 2)/ (tens[nd] - 1));\n\thi = min(x / lo, sqrt(x));\n\n\txint a, b, t = dtally(x);\n\tfor (a = lo; a <= hi; a++) {\n\t\tb = x / a;\n\t\tif (a * b == x && ((a%10) || (b%10)) && t == dtally(a) + dtally(b))\n\t\t\tf[n++] = a;\n\t}\n\n\treturn n;\n}\n\nvoid show_fangs(xint x, xint *f, xint cnt)\n{\n\tprintf(\"%llu\", (ull)x);\n\tint i;\n\tfor (i = 0; i < cnt; i++)\n\t\tprintf(\" = %llu x %llu\", (ull)f[i], (ull)(x / f[i]));\n\tputchar('\\n');\n}\n\nint main(void)\n{\n\tint i, j, n;\n\txint x, f[16], bigs[] = {16758243290880ULL, 24959017348650ULL, 14593825548650ULL, 0};\n\n\ttens[0] = 1;\n\tfor (i = 1; i < 20; i++)\n\t\ttens[i] = tens[i-1] * 10;\n\n\tfor (x = 1, n = 0; n < 25; x++) {\n\t\tif (!(j = fangs(x, f))) continue;\n\t\tprintf(\"%2d: \", ++n);\n\t\tshow_fangs(x, f, j);\n\t}\n\n\tputchar('\\n');\n\tfor (i = 0; bigs[i]; i++) {\n\t\tif ((j = fangs(bigs[i], f)))\n\t\t\tshow_fangs(bigs[i], f, j);\n\t\telse\n\t\t\tprintf(\"%llu is not vampiric\\n\", (ull)bigs[i]);\n\t}\n\n\treturn 0;\n}\n","language":"C"},{"code":"#include <vector>\n#include <utility>\n#include <algorithm>\n#include <iostream>\n#include <sstream>\n#include <string>\n#include <cmath>\n\nbool isVampireNumber( long number, std::vector<std::pair<long, long> > & solution ) {\n std::ostringstream numberstream ;\n numberstream << number ;\n std::string numberstring( numberstream.str( ) ) ;\n std::sort ( numberstring.begin( ) , numberstring.end( ) ) ;\n int fanglength = numberstring.length( ) / 2 ;\n long start = static_cast<long>( std::pow( 10 , fanglength - 1 ) ) ;\n long end = sqrt(number) ;\n for ( long i = start ; i <= end ; i++ ) {\n if ( number % i == 0 ) {\n\t long quotient = number / i ;\n\t if ( ( i % 10 == 0 ) && ( quotient % 10 == 0 ) )\n\t continue ;\n\t numberstream.str( \"\" ) ; //clear the number stream\n\t numberstream << i << quotient ;\n\t std::string divisorstring ( numberstream.str( ) ) ;\n std::sort ( divisorstring.begin( ) , divisorstring.end( ) ) ;\n\t if ( divisorstring == numberstring ) {\n\t std::pair<long , long> divisors = std::make_pair( i, quotient ) ;\n\t solution.push_back( divisors ) ;\n\t }\n }\n }\n return !solution.empty( ) ;\n}\n\nvoid printOut( const std::pair<long, long> & solution ) {\n std::cout << \"[ \" << solution.first << \" , \" << solution.second << \" ]\" ;\n}\n\nint main( ) {\n int vampireNumbersFound = 0 ;\n std::vector<std::pair<long , long> > solutions ;\n double i = 1.0 ;\n while ( vampireNumbersFound < 25 ) {\n long start = static_cast<long>( std::pow( 10 , i ) ) ;\n long end = start * 10 ;\n for ( long num = start ; num < end ; num++ ) {\n\t if ( isVampireNumber( num , solutions ) ) {\n vampireNumbersFound++ ;\n\t std::cout << vampireNumbersFound << \" :\" << num << \" is a vampire number! These are the fangs:\\n\" ;\n\t std::for_each( solutions.begin( ) , solutions.end( ) , printOut ) ;\n\t std::cout << \"\\n_______________\" << std::endl ;\n\t solutions.clear( ) ;\t\n\t if ( vampireNumbersFound == 25 )\n\t break ;\n\t }\n }\n i += 2.0 ;\n }\n std::vector<long> testnumbers ;\n testnumbers.push_back( 16758243290880 ) ;\n testnumbers.push_back( 24959017348650 ) ;\n testnumbers.push_back( 14593825548650 ) ;\n for ( std::vector<long>::const_iterator svl = testnumbers.begin( ) ;\n\t svl != testnumbers.end( ) ; svl++ ) {\n if ( isVampireNumber( *svl , solutions ) ) {\n\t std::cout << *svl << \" is a vampire number! The fangs:\\n\" ;\n\t std::for_each( solutions.begin( ) , solutions.end( ) , printOut ) ;\n\t std::cout << std::endl ;\n\t solutions.clear( ) ;\n } else {\n\t std::cout << *svl << \" is not a vampire number!\" << std::endl ;\n }\n }\n return 0 ;\n}\n","language":"C++"},{"code":"using System;\n\nnamespace RosettaVampireNumber\n{\n class Program\n {\n static void Main(string[] args)\n {\n int i, j, n;\n ulong x;\n var f = new ulong[16];\n var bigs = new ulong[] { 16758243290880UL, 24959017348650UL, 14593825548650UL, 0 };\n ulong[] tens = new ulong[20];\n tens[0] = 1;\n for (i = 1; i < 20; i++)\n tens[i] = tens[i - 1] * 10;\n\n for (x = 1, n = 0; n < 25; x++)\n {\n if ((j = fangs(x, f, tens)) == 0) continue;\n Console.Write(++n + \": \");\n show_fangs(x, f, j);\n }\n\n Console.WriteLine();\n for (i = 0; bigs[i] > 0 ; i++)\n {\n if ((j = fangs(bigs[i], f, tens)) > 0)\n show_fangs(bigs[i], f, j);\n else\n Console.WriteLine(bigs[i] + \" is not vampiric.\");\n }\n Console.ReadLine();\n }\n\n private static void show_fangs(ulong x, ulong[] f, int cnt)\n {\n Console.Write(x);\n int i;\n for (i = 0; i < cnt; i++)\n Console.Write(\" = \" + f[i] + \" * \" + (x / f[i]));\n Console.WriteLine();\n }\n\n private static int fangs(ulong x, ulong[] f, ulong[] tens)\n {\n int n = 0;\n int nd = ndigits(x);\n if ((nd & 1) > 0) return 0;\n nd /= 2;\n\n ulong lo, hi;\n lo = Math.Max(tens[nd - 1], (x + tens[nd] - 2) / (tens[nd] - 1));\n hi = Math.Min(x / lo, (ulong) Math.Sqrt(x));\n\n ulong a, b, t = dtally(x);\n for (a = lo; a <= hi; a++)\n {\n b = x / a;\n if (a * b == x && ((a % 10) > 0 || (b % 10) > 0) && t == dtally(a) + dtally(b))\n f[n++] = a;\n }\n\n return n;\n }\n\n private static ulong dtally(ulong x)\n {\n ulong t = 0;\n while (x > 0)\n {\n t += 1UL << (int)((x % 10) * 6);\n x /= 10;\n }\n\n return t;\n }\n\n private static int ndigits(ulong x)\n {\n int n = 0;\n while (x > 0)\n {\n n++;\n x /= 10;\n }\n return n;\n }\n }\n}\n","language":"C-sharp"},{"code":"(defn factor-pairs [n]\n (for [x (range 2 (Math/sqrt n))\n :when (zero? (mod n x))]\n [x (quot n x)]))\n\n(defn fangs [n]\n (let [dlen (comp count str)\n half (/ (dlen n) 2)\n halves? #(apply = (cons half (map dlen %)))\n digits #(sort (apply str %))]\n (filter #(and (halves? %)\n (= (sort (str n)) (digits %)))\n (factor-pairs n))))\n\n(defn vampiric? [n]\n (let [fangs (fangs n)]\n (if (empty? fangs) nil [n fangs])))\n\n(doseq [n (take 25 (keep vampiric? (range)))]\n (prn n))\n\n(doseq [n [16758243290880, 24959017348650, 14593825548650]]\n (println (or (vampiric? n) (str n \" is not vampiric.\"))))\n","language":"Clojure"},{"code":"(defun trailing-zerop (number)\n \"Is the lowest digit of `number' a 0\"\n (zerop (rem number 10)))\n\n(defun integer-digits (integer)\n \"Return the number of digits of the `integer'\"\n (assert (integerp integer))\n (length (write-to-string integer)))\n\n(defun paired-factors (number)\n \"Return a list of pairs that are factors of `number'\"\n (loop\n :for candidate :from 2 :upto (sqrt number)\n :when (zerop (mod number candidate))\n :collect (list candidate (/ number candidate))))\n\n(defun vampirep (candidate &aux\n (digits-of-candidate (integer-digits candidate))\n (half-the-digits-of-candidate (/ digits-of-candidate\n 2)))\n \"Is the `candidate' a vampire number?\"\n (remove-if #'(lambda (pair)\n (> (length (remove-if #'null (mapcar #'trailing-zerop pair)))\n 1))\n (remove-if-not #'(lambda (pair)\n (string= (sort (copy-seq (write-to-string candidate))\n #'char<)\n (sort (copy-seq (format nil \"~A~A\" (first pair) (second pair)))\n #'char<)))\n (remove-if-not #'(lambda (pair)\n (and (eql (integer-digits (first pair))\n half-the-digits-of-candidate)\n (eql (integer-digits (second pair))\n half-the-digits-of-candidate)))\n (paired-factors candidate)))))\n\n(defun print-vampire (candidate fangs &optional (stream t))\n (format stream\n \"The number ~A is a vampire number with fangs: ~{ ~{~A~^, ~}~^; ~}~%\"\n candidate\n fangs))\n\n;; Print the first 25 vampire numbers\n\n(loop\n :with count := 0\n :for candidate :from 0\n :until (eql count 25)\n :for fangs := (vampirep candidate)\n :do\n (when fangs\n (print-vampire candidate fangs)\n (incf count)))\n\n;; Check if 16758243290880, 24959017348650, 14593825548650 are vampire numbers\n\n(dolist (candidate '(16758243290880 24959017348650 14593825548650))\n (let ((fangs (vampirep candidate)))\n (when fangs\n (print-vampire candidate fangs))))\n","language":"Common-Lisp"},{"code":"import std.stdio, std.range, std.algorithm, std.typecons, std.conv;\n\nauto fangs(in long n) pure nothrow @safe {\n auto pairs = iota(2, cast(int)(n ^^ 0.5)) // n.isqrt\n .filter!(x => !(n % x)).map!(x => [x, n / x]);\n enum dLen = (in long x) => x.text.length;\n immutable half = dLen(n) / 2;\n enum halvesQ = (long[] p) => p.all!(u => dLen(u) == half);\n enum digits = (long[] p) => dtext(p[0], p[1]).dup.sort();\n const dn = n.to!(dchar[]).sort();\n return tuple(n, pairs.filter!(p => halvesQ(p) && dn == digits(p)));\n}\n\nvoid main() {\n foreach (v; int.max.iota.map!fangs.filter!q{ !a[1].empty }\n .take(25).chain([16758243290880, 24959017348650,\n 14593825548650].map!fangs))\n writefln(\"%d: (%(%(%s %)) (%))\", v[]);\n}\n","language":"D"},{"code":"import std.stdio, std.math, std.algorithm, std.array, std.traits;\n\nT[N] pows(T, size_t N)() pure nothrow @safe @nogc {\n typeof(return) result;\n result[0] = 1;\n foreach (immutable i, ref r; result[1 .. $])\n r = result[i] * 10;\n return result;\n}\n\n__gshared immutable tenPowsU = pows!(uint, 10);\n__gshared immutable tenPowsUL = pows!(ulong, 20);\n\nsize_t nDigits(T)(in T x) pure nothrow @safe @nogc {\n Unqual!T y = x;\n size_t n = 0;\n while (y) {\n n++;\n y /= 10;\n }\n return n;\n}\n\nT dTally(T)(in T x) pure nothrow @safe @nogc {\n Unqual!T y = x;\n T t = 0;\n while (y) {\n t += 1 << ((y % 10) * 6);\n y /= 10;\n }\n return t;\n}\n\nT[] fangs(T)(in T x, T[] f)\npure nothrow @safe @nogc if (is(T == uint) || is(T == ulong)) {\n alias tenPows = Select!(is(T == ulong), tenPowsUL, tenPowsU);\n\n immutable nd0 = nDigits(x);\n if (nd0 & 1)\n return null;\n immutable nd = nd0 / 2;\n\n immutable lo = max(tenPows[nd - 1],\n (x + tenPows[nd] - 2) / (tenPows[nd] - 1));\n immutable hi = min(x / lo, cast(T)sqrt(real(x)));\n immutable t = x.dTally;\n\n size_t n = 0;\n foreach (immutable a; lo .. hi + 1) {\n immutable b = x / a;\n if (a * b == x\n && (a % 10 || b % 10)\n && t == (a.dTally + b.dTally)) {\n f[n] = a;\n n++;\n }\n }\n\n return f[0 .. n];\n}\n\nvoid showFangs(T)(in T x, in T[] fs) {\n x.write;\n foreach (immutable fi; fs)\n writef(\" = %d x %d\", fi, x / fi);\n writeln;\n}\n\nvoid main() {\n uint[16] fu;\n for (uint x = 1, n = 0; n < 25; x++) {\n const fs = fangs(x, fu);\n if (fs.empty)\n continue;\n n++;\n writef(\"%2d: \", n);\n showFangs(x, fs);\n }\n writeln;\n\n static immutable ulong[3] bigs = [16_758_243_290_880UL,\n 24_959_017_348_650UL,\n 14_593_825_548_650UL];\n ulong[fu.length] ful;\n foreach (immutable bi; bigs) {\n const fs = fangs(bi, ful);\n if (fs.empty)\n writeln(bi, \" is not vampiric\");\n else\n showFangs(bi, fs);\n }\n}\n","language":"D"},{"code":"func dtally x .\n while x > 0\n t += bitshift 1 (x mod 10 * 6)\n x = x div 10\n .\n return t\n.\nproc fangs x . f[] .\n f[] = [ ]\n nd = floor log10 x + 1\n if nd mod 2 = 1\n return\n .\n nd = nd div 2\n lo = higher pow 10 (nd - 1) (x + pow 10 nd - 2) div (pow 10 nd - 1)\n hi = lower (x / lo) sqrt x\n t = dtally x\n for a = lo to hi\n b = x div a\n if a * b = x and (a mod 10 > 0 or b mod 10 > 0) and t = dtally a + dtally b\n f[] &= a\n .\n .\n.\nproc show_fangs x f[] . .\n write x & \" \"\n for f in f[]\n write \" = \" & f & \" x \" & x div f\n .\n print \"\"\n.\nx = 1\nwhile n < 25\n fangs x f[]\n if len f[] > 0\n n += 1\n write n & \": \"\n show_fangs x f[]\n .\n x += 1\n.\nbigs[] = [ 16758243290880 24959017348650 14593825548650 ]\nfor x in bigs[]\n fangs x f[]\n if len f[] > 0\n show_fangs x f[]\n else\n print x & \" is not vampiric\"\n .\n.\n","language":"EasyLang"},{"code":"class\n\tAPPLICATION\n\ncreate\n\tmake\n\nfeature\n\n\tfang_check (original, fang1, fang2: INTEGER_64): BOOLEAN\n\t\t\t-- Are 'fang1' and 'fang2' correct fangs of the 'original' number?\n\t\trequire\n\t\t\toriginal_positive: original > 0\n\t\t\tfangs_positive: fang1 > 0 and fang2 > 0\n\t\tlocal\n\t\t\toriginal_length: INTEGER\n\t\t\tfang, ori: STRING\n\t\t\tsort_ori, sort_fang: SORTED_TWO_WAY_LIST [CHARACTER]\n\t\tdo\n\t\t\tcreate sort_ori.make\n\t\t\tcreate sort_fang.make\n\t\t\tcreate ori.make_empty\n\t\t\tcreate fang.make_empty\n\t\t\toriginal_length := original.out.count // 2\n\t\t\tif fang1.out.count /= original_length or fang2.out.count /= (original_length) then\n\t\t\t\tResult := False\n\t\t\telseif fang1.out.ends_with (\"0\") and fang2.out.ends_with (\"0\") then\n\t\t\t\tResult := False\n\t\t\telse\n\t\t\t\tacross\n\t\t\t\t\t1 |..| original.out.count as c\n\t\t\t\tloop\n\t\t\t\t\tsort_ori.extend (original.out [c.item])\n\t\t\t\tend\n\t\t\t\tacross\n\t\t\t\t\tsort_ori as o\n\t\t\t\tloop\n\t\t\t\t\tori.extend (o.item)\n\t\t\t\tend\n\t\t\t\tacross\n\t\t\t\t\t1 |..| fang1.out.count as c\n\t\t\t\tloop\n\t\t\t\t\tsort_fang.extend (fang1.out [c.item])\n\t\t\t\t\tsort_fang.extend (fang2.out [c.item])\n\t\t\t\tend\n\t\t\t\tacross\n\t\t\t\t\tsort_fang as f\n\t\t\t\tloop\n\t\t\t\t\tfang.extend (f.item)\n\t\t\t\tend\n\t\t\t\tResult := fang.same_string (ori)\n\t\t\tend\n\t\tensure\n\t\t\tfangs_right_length: Result implies original.out.count = fang1.out.count + fang2.out.count\n\t\tend\n\n\tmake\n -- Uses fang_check to find vampire nubmers.\n\t\tlocal\n\t\t\ti, numbers: INTEGER\n\t\t\tfang1, fang2: INTEGER_64\n\t\t\tnum: ARRAY [INTEGER_64]\n\t\t\tmath: DOUBLE_MATH\n\t\tdo\n\t\t\tcreate math\n\t\t\tfrom\n\t\t\t\ti := 1000\n\t\t\tuntil\n\t\t\t\tnumbers > 25\n\t\t\tloop\n\t\t\t\tif i.out.count \\\\ 2 = 0 then\n\t\t\t\t\tfrom\n\t\t\t\t\t\tfang1 := 10\n\t\t\t\t\tuntil\n\t\t\t\t\t\tfang1 >= math.sqrt (i)\n\t\t\t\t\tloop\n\t\t\t\t\t\tif (i \\\\ fang1 = 0) then\n\t\t\t\t\t\t\tfang2 := i // fang1\n\t\t\t\t\t\t\tif i \\\\ 9 = (fang1 + fang2) \\\\ 9 then\n\t\t\t\t\t\t\t\tif fang1 * fang2 = i and fang1 <= fang2 and then fang_check (i, fang1, fang2) then\n\t\t\t\t\t\t\t\t\tnumbers := numbers + 1\n\t\t\t\t\t\t\t\t\tio.put_string (i.out + \": \" + fang1.out + \" \" + fang2.out)\n\t\t\t\t\t\t\t\t\tio.new_line\n\t\t\t\t\t\t\t\tend\n\t\t\t\t\t\t\tend\n\t\t\t\t\t\tend\n\t\t\t\t\t\tfang1 := fang1 + 1\n\t\t\t\t\tend\n\t\t\t\tend\n\t\t\t\ti := i + 1\n\t\t\tend\n\t\t\tnum := <<16758243290880, 24959017348650, 14593825548650>>\n\t\t\tacross\n\t\t\t\tnum as n\n\t\t\tloop\n\t\t\t\tfrom\n\t\t\t\t\tfang1 := 1000000\n\t\t\t\tuntil\n\t\t\t\t\tfang1 >= math.sqrt (n.item) + 1\n\t\t\t\tloop\n\t\t\t\t\tif (n.item \\\\ fang1 = 0) then\n\t\t\t\t\t\tfang2 := (n.item // fang1)\n\t\t\t\t\t\tif fang1 * fang2 = n.item and fang1 <= fang2 and then fang_check (n.item, fang1, fang2) then\n\t\t\t\t\t\t\tio.put_string (n.item.out + \": \" + fang1.out + \" \" + fang2.out + \"%N\")\n\t\t\t\t\t\tend\n\t\t\t\t\tend\n\t\t\t\t\tfang1 := fang1 + 1\n\t\t\t\tend\n\t\t\tend\n\t\tend\n\nend\n","language":"Eiffel"},{"code":"defmodule Vampire do\n def factor_pairs(n) do\n first = trunc(n / :math.pow(10, div(char_len(n), 2)))\n last = :math.sqrt(n) |> round\n for i <- first .. last, rem(n, i) == 0, do: {i, div(n, i)}\n end\n\n def vampire_factors(n) do\n if rem(char_len(n), 2) == 1 do\n []\n else\n half = div(length(to_char_list(n)), 2)\n sorted = Enum.sort(String.codepoints(\"#{n}\"))\n Enum.filter(factor_pairs(n), fn {a, b} ->\n char_len(a) == half && char_len(b) == half &&\n Enum.count([a, b], fn x -> rem(x, 10) == 0 end) != 2 &&\n Enum.sort(String.codepoints(\"#{a}#{b}\")) == sorted\n end)\n end\n end\n\n defp char_len(n), do: length(to_char_list(n))\n\n def task do\n Enum.reduce_while(Stream.iterate(1, &(&1+1)), 1, fn n, acc ->\n case vampire_factors(n) do\n [] -> {:cont, acc}\n vf -> IO.puts \"#{n}:\\t#{inspect vf}\"\n if acc < 25, do: {:cont, acc+1}, else: {:halt, acc+1}\n end\n end)\n IO.puts \"\"\n Enum.each([16758243290880, 24959017348650, 14593825548650], fn n ->\n case vampire_factors(n) do\n [] -> IO.puts \"#{n} is not a vampire number!\"\n vf -> IO.puts \"#{n}:\\t#{inspect vf}\"\n end\n end)\n end\nend\n\nVampire.task\n","language":"Elixir"},{"code":"USING: combinators.short-circuit fry io kernel lists lists.lazy math\nmath.combinatorics math.functions math.primes.factors math.statistics\nmath.text.utils prettyprint sequences sets ;\nIN: rosetta-code.vampire-number\n\n: digits ( n -- m )\n log10 floor >integer 1 + ;\n\n: same-digits? ( n n1 n2 -- ? )\n [ 1 digit-groups ] tri@ append [ histogram ] bi@ = ;\n\n: half-len-factors ( n -- seq )\n [ divisors ] [ digits ] bi 2/ '[ digits _ = ] filter ;\n\n: same-digit-factors ( n -- seq )\n dup half-len-factors 2 <combinations> [ first2 same-digits? ] with filter ;\n\n: under-two-trailing-zeros? ( seq -- ? )\n [ 10 mod ] map [ 0 = ] count 2 < ;\n\n: tentative-fangs ( n -- seq )\n same-digit-factors [ under-two-trailing-zeros? ] filter ;\n\n: fangs ( n -- seq )\n [ tentative-fangs ] [ ] bi '[ product _ = ] filter ;\n\n: vampire? ( n -- ? )\n { [ digits even? ] [ fangs empty? not ] } 1&& ;\n\n: first25 ( -- seq )\n 25 0 lfrom [ vampire? ] lfilter ltake list>array ;\n\n: .vamp-with-fangs ( n -- )\n [ pprint bl ] [ fangs [ pprint bl ] each ] bi nl ;\n\n: part1 ( -- )\n first25 [ .vamp-with-fangs ] each ;\n\n: part2 ( -- ) { 16758243290880 24959017348650 14593825548650 }\n [ dup vampire? [ .vamp-with-fangs ] [ drop ] if ] each ;\n\n: main ( -- ) part1 part2 ;\n\nMAIN: main\n","language":"Factor"},{"code":": sqrt ( u -- sqrt ) ( Babylonian method )\n dup 2/ ( first square root guess is half )\n dup 0= if drop exit then ( sqrt[0]=0, sqrt[1]=1 )\n begin dup >r 2dup / r> + 2/ ( stack: square old-guess new-guess )\n 2dup > while ( as long as guess is decreasing )\n nip repeat ( forget old-guess and repeat )\n drop nip ;\n\n: ndigits ( n -- n ) 10 / dup 0<> if recurse then 1+ ;\n\n: dtally ( n -- n )\n 10 /mod\n dup 0<> if recurse then\n swap 6 * 1 swap lshift + ;\n\n: ?product ( x a b -- f ) * = ;\n: ?dtally ( x a b -- f ) dtally rot dtally rot dtally rot + = ;\n: ?ndigits ( a b -- f ) ndigits swap ndigits = ;\n: ?0trail ( a b -- f ) 10 mod 0= swap 10 mod 0= and invert ;\n\n: ?fang ( x a -- f )\n 2dup / 2>r\n dup 2r@ ?product\n swap 2r@ ?dtally and\n 2r@ ?ndigits and\n 2r> ?0trail and ;\n\n: next-fang ( n a -- false | a true )\n over sqrt swap 1+ ?do\n dup i ?fang if drop i true unloop exit then\n loop drop false ;\n\n: ?vampire ( n -- false | a true ) 0 next-fang ;\n\n: next-vampire ( n -- n a ) begin 1+ dup ?vampire until ;\n\n: .product ( n a -- ) dup . .\" x \" / . .\" = \" ;\n\n: .vampire ( n a -- )\n cr\n begin 2dup .product\n over swap next-fang\n while repeat\n . ;\n\n: .fangs ( n -- ) dup ?vampire if .vampire else cr . .\" is not vampiric.\" then ;\n\n: vampires ( n -- )\n 1 swap\n 0 do next-vampire over swap .vampire loop drop ;\n\n25 vampires\n16758243290880 .fangs\n24959017348650 .fangs\n14593825548650 .fangs\n","language":"Forth"},{"code":"'Vampire numbers.\n'FreeBASIC version 24. Windows\n'Vampire.bas\nFunction WithinString(n As Ulongint,f As Ulongint) As Integer\n var m=Str(n),p=Str(f)\n For z As Integer=0 To Len(p)-1\n var i=Instr(m,Chr(p[z]))\n If i Then\n m=Mid(m,1,i-1)+Mid(m,i+1)\n Else\n Return 0\n End If\n Next z\n Return -1\nEnd Function\n\nSub AllFactors(N As Ulongint,factors() As Ulongint)\n Dim As String Sn=Str(n)\n Dim As Integer half=Len(sn)\\2\n Redim factors(1 To 1)\n #macro bsort(array)\n For p1 As Integer = 1 To Ubound(array) - 1\n For p2 As Integer = p1 + 1 To Ubound(array)\n If array(p1)>array(p2) Then Swap array(p1),array(p2)\n Next p2\n Next p1\n #endmacro\n\n Dim As Ulongint c\n For i As Ulongint = 1 To Sqr(N)\n If N Mod i=0 Then\n If Len(Str(i))=half Then\n If WithinString(N,i) Then\n c=c+1\n Redim Preserve factors(1 To c)\n factors(c)=i\n End If\n End If\n If N <> i*i Then\n If Len(Str(n\\i))=half Then\n If WithinString(N,n\\i) Then\n c=c+1\n Redim Preserve factors(1 To c)\n factors(c)=n\\i\n End If\n End If\n End If\n End If\n Next i\n bsort(factors)\nEnd Sub\n\nFunction VampireNumbers(N As Ulongint) As Integer\n Dim As Integer flag\n Dim As Ulongint LastFactor\n Redim As Ulongint Factor()\n AllFactors(N,Factor())\n For p1 As Integer = 1 To Ubound(Factor)\n For p2 As Integer=1 To Ubound(Factor)\n If Factor(p1)*Factor(p2)=n Then\n If Factor(p1) Mod 10<>0 Or Factor(p2) Mod 10 <>0 Then\n If WithinString(n,valulng(Str(Factor(p1))+Str(Factor(p2)))) Then\n If LastFactor=Factor(p2) Then Exit For,For\n flag=1\n Print n;\": [\";Factor(p1);\",\";Factor(p2);\"]\"\n LastFactor=Factor(p1)\n End If\n End If\n End If\n Next p2\n Next p1\n If flag Then Return -1\nEnd Function\n\n'============== IMPLEMENT ==============================\nprint \"First 28 Vampire numbers\"\nprint\nPrint \"Number: [fangs]\"\nPrint\nDim As Ulongint n=1000\nDim As Integer count\nDim As Double t1,t2\nt1=Timer\nDo\n n=n+1\n Var s=Str(n)\n If Len(s) Mod 2<>0 Then n=n*10\n If vampireNumbers(n) Then count=count+1\nLoop Until count=27\nPrint\nprint \"Individual tests:\"\nprint\n'individual tests\nn=16758243290880ull\nIf Not vampirenumbers(n) Then Print n;\": [returns no fangs]\"\nPrint\nn=24959017348650ull\nIf Not vampirenumbers(n) Then Print n;\": [returns no fangs]\"\nprint\nn=14593825548650ull\nIf Not vampirenumbers(n) then print n;\": [returns no fangs]\"\nt2=Timer\nprint\nPrint \"Completed in \";\nPrint t2-t1;\" Seconds\"\nSleep\n","language":"FreeBASIC"},{"code":"package main\n\nimport (\n \"fmt\"\n \"math\"\n)\n\nfunc max(a, b uint64) uint64 {\n if a > b {\n return a\n }\n return b\n}\n\nfunc min(a, b uint64) uint64 {\n if a < b {\n return a\n }\n return b\n}\n\nfunc ndigits(x uint64) (n int) {\n for ; x > 0; x /= 10 {\n n++\n }\n return\n}\n\nfunc dtally(x uint64) (t uint64) {\n for ; x > 0; x /= 10 {\n t += 1 << (x % 10 * 6)\n }\n return\n}\n\nvar tens [20]uint64\n\nfunc init() {\n tens[0] = 1\n for i := 1; i < 20; i++ {\n tens[i] = tens[i-1] * 10\n }\n}\n\nfunc fangs(x uint64) (f []uint64) {\n nd := ndigits(x)\n if nd&1 == 1 {\n return\n }\n nd /= 2\n lo := max(tens[nd-1], (x+tens[nd]-2)/(tens[nd]-1))\n hi := min(x/lo, uint64(math.Sqrt(float64(x))))\n t := dtally(x)\n for a := lo; a <= hi; a++ {\n b := x / a\n if a*b == x &&\n (a%10 > 0 || b%10 > 0) &&\n t == dtally(a)+dtally(b) {\n f = append(f, a)\n }\n }\n return\n}\n\nfunc showFangs(x uint64, f []uint64) {\n fmt.Print(x)\n if len(f) > 1 {\n fmt.Println()\n }\n for _, a := range f {\n fmt.Println(\" =\", a, \"×\", x/a)\n }\n}\n\nfunc main() {\n for x, n := uint64(1), 0; n < 26; x++ {\n if f := fangs(x); len(f) > 0 {\n n++\n fmt.Printf(\"%2d: \", n)\n showFangs(x, f)\n }\n }\n fmt.Println()\n for _, x := range []uint64{16758243290880, 24959017348650, 14593825548650} {\n if f := fangs(x); len(f) > 0 {\n showFangs(x, f)\n } else {\n fmt.Println(x, \"is not vampiric\")\n }\n }\n}\n","language":"Go"},{"code":"import Data.List (sort)\nimport Control.Arrow ((&&&))\n\n-- VAMPIRE NUMBERS ------------------------------------------------------------\nvampires :: [Int]\nvampires = filter (not . null . fangs) [1 ..]\n\nfangs :: Int -> [(Int, Int)]\nfangs n\n | odd w = []\n | otherwise = ((,) <*> quot n) <$> filter isfang (integerFactors n)\n where\n ndigit :: Int -> Int\n ndigit 0 = 0\n ndigit n = 1 + ndigit (quot n 10)\n w = ndigit n\n xmin = 10 ^ (quot w 2 - 1)\n xmax = xmin * 10\n isfang x =\n x > xmin &&\n x < y &&\n y < xmax && -- same length\n (quot x 10 /= 0 || quot y 10 /= 0) && -- not zero-ended\n sort (show n) == sort (show x ++ show y)\n where\n y = quot n x\n\n-- FACTORS --------------------------------------------------------------------\nintegerFactors :: Int -> [Int]\nintegerFactors n\n | n < 1 = []\n | otherwise =\n lows ++\n (quot n <$>\n (if intSquared == n -- A perfect square,\n then tail -- and cofactor of square root would be redundant.\n else id)\n (reverse lows))\n where\n (intSquared, lows) =\n (^ 2) &&& (filter ((0 ==) . rem n) . enumFromTo 1) $\n floor (sqrt $ fromIntegral n)\n\n-- TEST -----------------------------------------------------------------------\nmain :: IO [()]\nmain =\n mapM\n (print . ((,) <*>) fangs)\n (take 25 vampires ++ [16758243290880, 24959017348650, 14593825548650])\n","language":"Haskell"},{"code":"procedure main()\n write(\"First 25 vampire numbers and their fangs:\")\n every fangs := vampire(n := seq())\\25 do write(right(n,20),\":\",fangs)\n write(\"\\nOther numbers:\")\n every n := 16758243290880 | 24959017348650 | 14593825548650 do\n write(right(n,20),\": \",vampire(n)|\"toothless\")\nend\n\nprocedure vampire(n)\n ns := string(n)\n if *ns % 2 = 1 then fail\n every (fangs := \"\") ||:= \" \"||fangCheck(n, *ns/2, f1 := 2 to integer(sqrt(n)), n/f1)\n if *fangs > 0 then return fangs\nend\n\nprocedure fangCheck(n, n2, f1, f2)\n if f1*f2 ~= n then fail\n if n2 ~= *(f1|f2) then fail\n if (f1|f2) % 10 ~= 0 then\n if csort(f1||f2) == csort(n) then return \"(\"||f1||\",\"||f2||\")\"\nend\n\nprocedure csort(s) # Adapted from csort(s) in Icon IPL\n every (s1 := \"\", c := !cset(s)) do every find(c, s) do s1 ||:= c\n return s1\nend\n","language":"Icon"},{"code":"Filter=: (#~`)(`:6)\nodd =: 2&|\neven =: -.@:odd\nfactors =: [: ([: /:~ [: */\"1 ([: x: [) ^\"1 [: > [: , [: { [: <@:i.@>: ])/ __ q: ]\ndigits =: 10&(#.inv)\ntally =: # : [:\nhalf =: -: : [:\neven_number_of_digits =: even@:tally@:digits\nsame_digits =: digits@:[ -:&(/:~) ,&digits/@:]\nassert 1 -: 1234 same_digits 23 14\nassert 0 -: 1234 same_digits 23 140\nhalf_the_digits =: (half@:tally@:digits@:[ = tally@:digits&>@:]) # ]\nfactors_with_half_the_digits =: half_the_digits factors\nlarge =: (> <.@:%:)~ # ]\ncandidates =: large factors_with_half_the_digits\none_trailing_zero_permitted =: (0 < [: tally 0 -.~ 10&|)\"1 Filter\npairs =: (% ,. ]) one_trailing_zero_permitted@:candidates\nfangs =: (same_digits\"0 1 # ]) pairs\n\n A=:(0 2 -.@:-: $)&>Filter<@fangs\"0]1000+i.1e4\n B=:(0 2 -.@:-: $)&>Filter<@fangs\"0]100000+i.25501\n (,: */@:{.&.>)A,B\n┌─────┬─────┬─────┬─────┬─────┬─────┬─────┬───────┬───────┬───────┬───────┬───────┬───────┬───────┬───────┬───────┬───────┬───────┬───────┬───────┬───────┬───────┬───────┬───────┬───────┐\n│21 60│15 93│35 41│30 51│21 87│27 81│80 86│201 510│260 401│210 501│204 516│150 705│135 801│158 701│152 761│161 725│167 701│141 840│201 600│231 534│281 443│152 824│231 543│246 510│251 500│\n│ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │204 615│ │\n├─────┼─────┼─────┼─────┼─────┼─────┼─────┼───────┼───────┼───────┼───────┼───────┼───────┼───────┼───────┼───────┼───────┼───────┼───────┼───────┼───────┼───────┼───────┼───────┼───────┤\n│1260 │1395 │1435 │1530 │1827 │2187 │6880 │102510 │104260 │105210 │105264 │105750 │108135 │110758 │115672 │116725 │117067 │118440 │120600 │123354 │124483 │125248 │125433 │125460 │125500 │\n└─────┴─────┴─────┴─────┴─────┴─────┴─────┴───────┴───────┴───────┴───────┴───────┴───────┴───────┴───────┴───────┴───────┴───────┴───────┴───────┴───────┴───────┴───────┴───────┴───────┘\n\n <@fangs\"0[] 16758243290880 24959017348650 14593825548650\n┌───────────────┬───────────────┬──┐\n│2817360 5948208│4230765 5899410│ │\n│2751840 6089832│4129587 6043950│ │\n│2123856 7890480│4125870 6049395│ │\n│1982736 8452080│2949705 8461530│ │\n│ │2947050 8469153│ │\n└───────────────┴───────────────┴──┘\n\n fangs f. NB. <laugh>\n((10&(#.^:_1)@:[ -:&(/:~) ,&(10&(#.^:_1))/@:])\"0 1 # ]) ((% ,. ]) (#~ (0 < [: # :[: 0 -.~ 10&|)\"1)@:(((> <.@:%:)~ # ]) (((-: :[:@:(# :[:)@:(10&(#.^:_1))@:[ = # :[:@:(10&(#.^:_1))&>@:]) # ]) ([: ([: /:~ [: */\"1 ([: x: [) ^\"1 [: > [: , [: { [: <@:i.@>: ])/ __ q: ]))))\n","language":"J"},{"code":"import java.util.Arrays;\nimport java.util.HashSet;\n\npublic class VampireNumbers{\n private static int numDigits(long num){\n return Long.toString(Math.abs(num)).length();\n }\n\n private static boolean fangCheck(long orig, long fang1, long fang2){\n if(Long.toString(fang1).endsWith(\"0\") && Long.toString(fang2).endsWith(\"0\")) return false;\n\n int origLen = numDigits(orig);\n if(numDigits(fang1) != origLen / 2 || numDigits(fang2) != origLen / 2) return false;\n\n byte[] origBytes = Long.toString(orig).getBytes();\n byte[] fangBytes = (Long.toString(fang1) + Long.toString(fang2)).getBytes();\n Arrays.sort(origBytes);\n Arrays.sort(fangBytes);\n return Arrays.equals(origBytes, fangBytes);\n }\n\n public static void main(String[] args){\n HashSet<Long> vamps = new HashSet<Long>();\n for(long i = 10; vamps.size() <= 25; i++ ){\n if((numDigits(i) % 2) != 0) {i = i * 10 - 1; continue;}\n for(long fang1 = 2; fang1 <= Math.sqrt(i) + 1; fang1++){\n if(i % fang1 == 0){\n long fang2 = i / fang1;\n if(fangCheck(i, fang1, fang2) && fang1 <= fang2){\n vamps.add(i);\n System.out.println(i + \": [\" + fang1 + \", \" + fang2 +\"]\");\n }\n }\n }\n }\n Long[] nums = {16758243290880L, 24959017348650L, 14593825548650L};\n for(Long i : nums){\n for(long fang1 = 2; fang1 <= Math.sqrt(i) + 1; fang1++){\n if(i % fang1 == 0){\n long fang2 = i / fang1;\n if(fangCheck(i, fang1, fang2) && fang1 <= fang2){\n System.out.println(i + \": [\" + fang1 + \", \" + fang2 +\"]\");\n }\n }\n }\n }\n }\n}\n","language":"Java"},{"code":"public class VampireNumber {\n\n public static void main(String args[]) {\n\n // scan only the ranges that have an even number of digits\n // for instance: 10 .. 99, 1000 .. 9999 etc\n long countVamps = 0, start = 10, tens = 10;\n outer:\n for (int numDigits = 2; numDigits <= 18; numDigits += 2) {\n long end = start * 10;\n for (long i = start; i < end; i++) {\n if (countFangs(i, tens) > 0) {\n if (++countVamps >= 26)\n break outer;\n }\n }\n start *= 100;\n tens *= 10;\n }\n System.out.println();\n\n long[] bigs = {16758243290880L, 24959017348650L,\n 14593825548650L};\n\n for (long b : bigs)\n countFangs(b, 10000000L);\n }\n\n private static int countFangs(long n, long tens) {\n int countFangs = 0;\n\n // limit the search space for factors (as in C example)\n long lo = Math.max(tens / 10, (n + tens - 2) / (tens - 1));\n long hi = Math.min(n / lo, (long) Math.sqrt(n));\n\n long nTally = tallyDigits(n);\n\n for (long a = lo; a <= hi; a++) {\n long b = n / a;\n\n if (a * b != n)\n continue;\n\n // check for mod 9 congruence\n if (n % 9 != (a + b) % 9)\n continue;\n\n if (a % 10 == 0 && b % 10 == 0)\n continue;\n\n if (nTally == tallyDigits(a) + tallyDigits(b)) {\n if (countFangs == 0)\n System.out.printf(\"\\n%d : \", n);\n System.out.printf(\"[%d, %d]\", a, b);\n countFangs++;\n }\n }\n return countFangs;\n }\n\n // sum to a unique number to represent set of digits (as in C example)\n private static long tallyDigits(long n) {\n long total = 0;\n while (n > 0) {\n total += 1L << ((n % 10) * 6);\n n /= 10;\n }\n return total;\n }\n}\n","language":"Java"},{"code":"def count(s): reduce s as $x (0; .+1);\n\n# To take advantage of gojq's arbitrary-precision integer arithmetic:\ndef power($b): . as $in | reduce range(0;$b) as $i (1; . * $in);\n\n# Output: a possibly empty array of pairs\ndef factor_pairs:\n . as $n\n | ($n / (10 | power($n|tostring|length / 2) - 1)) as $first\n | [range($first|floor; 1 + ($n | sqrt)) | select(($n % .) == 0) | [., $n / .] ] ;\n\n# Output: a stream\ndef vampire_factors:\n def es: tostring|explode;\n . as $n\n | tostring as $s\n | ($s|length) as $nlen\n | if ($nlen % 2) == 1 then []\n else ($nlen / 2 ) as $half\n | [factor_pairs[]\n | select(. as [$a, $b]\n | ($a|tostring|length) == $half and ($b|tostring|length) == $half\n and count($a, $b | select(.%10 == 0)) != 2\n and ((($a|es) + ($b|es)) | sort) == ($n|es|sort) ) ]\n end ;\n\ndef task1($n):\n limit($n; range(1; infinite)\n | . as $i\n | vampire_factors\n | select(length>0)\n | \"\\($i):\\t\\(.)\" );\n\ndef task2:\n 16758243290880, 24959017348650, 14593825548650\n | vampire_factors as $vf\n | if $vf|length == 0\n then \"\\(.) is not a vampire number!\"\n else \"\\(.):\\t\\($vf)\"\n end;\n\ntask1(25),\n\"\",\ntask2\n","language":"Jq"},{"code":"function divisors{T<:Integer}(n::T)\n !isprime(n) || return [one(T), n]\n d = [one(T)]\n for (k, v) in factor(n)\n e = T[k^i for i in 1:v]\n append!(d, vec([i*j for i in d, j in e]))\n end\n sort(d)\nend\n\nfunction vampirefangs{T<:Integer}(n::T)\n fangs = T[]\n isvampire = false\n vdcnt = ndigits(n)\n fdcnt = vdcnt>>1\n iseven(vdcnt) || return (isvampire, fangs)\n !isprime(n) || return (isvampire, fangs)\n vdigs = sort(digits(n))\n d = divisors(n)\n len = length(d)\n len = iseven(len) ? len>>1 : len>>1 + 1\n for f in d[1:len]\n ndigits(f) == fdcnt || continue\n g = div(n, f)\n f%10!=0 || g%10!=0 || continue\n sort([digits(f), digits(g)]) == vdigs || continue\n isvampire = true\n append!(fangs, [f, g])\n end\n if isvampire\n fangs = reshape(fangs, (2,length(fangs)>>1))'\n end\n return (isvampire, fangs)\nend\n","language":"Julia"},{"code":"using Printf\n\nfunction showvampire{T<:Integer}(i::T, n::T, fangs::Array{T,2})\n s = @sprintf \"%6d %14d %s\\n\" i n join(fangs[1,:], \"\\u00d7\")\n for i in 2:size(fangs)[1]\n s *= \" \"^23*join(fangs[i,:], \"\\u00d7\")*\"\\n\"\n end\n return s\nend\n\nvgoal = 25\nvcnt = 0\ndcnt = 0\nprintln(\"Finding the first \", vgoal, \" vampire numbers.\")\nprintln(\" N Vampire Fangs\")\nwhile vcnt < vgoal\n dcnt += 2\n for i in (10^(dcnt-1)):(10^dcnt-1)\n (isvampire, fangs) = vampirefangs(i)\n isvampire || continue\n vcnt += 1\n print(showvampire(vcnt, i, fangs))\n vcnt < vgoal || break\n end\nend\n\ntest = [16758243290880, 24959017348650, 14593825548650]\nprintln()\nprintln(\"Checking a few numbers.\")\nprintln(\" N Vampire Fangs\")\nfor (i, v) in enumerate(test)\n (isvampire, fangs) = vampirefangs(v)\n if isvampire\n print(showvampire(i, v, fangs))\n else\n println(@sprintf \"%6d %14d is not a vampire\" i v)\n end\nend\n","language":"Julia"},{"code":"// version 1.1\n\ndata class Fangs(val fang1: Long = 0L, val fang2: Long = 0L)\n\nfun pow10(n: Int): Long = when {\n n < 0 -> throw IllegalArgumentException(\"Can't be negative\")\n else -> {\n var pow = 1L\n for (i in 1..n) pow *= 10L\n pow\n }\n}\n\nfun countDigits(n: Long): Int = when {\n n < 0L -> throw IllegalArgumentException(\"Can't be negative\")\n n == 0L -> 1\n else -> {\n var count = 0\n var nn = n\n while (nn > 0L) {\n count++\n nn /= 10L\n }\n count\n }\n}\n\nfun hasTrailingZero(n: Long): Boolean = when {\n n < 0L -> throw IllegalArgumentException(\"Can't be negative\")\n else -> n % 10L == 0L\n}\n\nfun sortedString(s: String): String {\n val ca = s.toCharArray()\n ca.sort()\n return String(ca)\n}\n\nfun isVampiric(n: Long, fl: MutableList<Fangs>): Boolean {\n if (n < 0L) return false\n val len = countDigits(n)\n if (len % 2L == 1L) return false\n val hlen = len / 2\n val first = pow10(hlen - 1)\n val last = 10L * first\n var j: Long\n var cd: Int\n val ss = sortedString(n.toString())\n for (i in first until last) {\n if (n % i != 0L) continue\n j = n / i\n if (j < i) return fl.size > 0\n cd = countDigits(j)\n if (cd > hlen) continue\n if (cd < hlen) return fl.size > 0\n if (ss != sortedString(i.toString() + j.toString())) continue\n if (!(hasTrailingZero(i) && hasTrailingZero(j))) {\n fl.add(Fangs(i, j))\n }\n }\n return fl.size > 0\n}\n\nfun showFangs(fangsList: MutableList<Fangs>): String {\n var s = \"\"\n for ((fang1, fang2) in fangsList) {\n s += \" = $fang1 x $fang2\"\n }\n return s\n}\n\nfun main(args: Array<String>) {\n println(\"The first 25 vampire numbers and their fangs are:\")\n var count = 0\n var n: Long = 0\n val fl = mutableListOf<Fangs>()\n while (true) {\n if (isVampiric(n, fl)) {\n count++\n println(\"${\"%2d\".format(count)} : $n\\t${showFangs(fl)}\")\n fl.clear()\n if (count == 25) break\n }\n n++\n }\n println()\n val va = longArrayOf(16758243290880L, 24959017348650L, 14593825548650L)\n for (v in va) {\n if (isVampiric(v, fl)) {\n println(\"$v\\t${showFangs(fl)}\")\n fl.clear()\n } else {\n println(\"$v\\t = not vampiric\")\n }\n }\n}\n","language":"Kotlin"},{"code":"ClearAll[VampireQ]\nVampireQ[num_Integer] := Module[{poss, divs},\n divs = Select[Divisors[num], # <= Sqrt[num] &];\n poss = {#, num/#} & /@ divs;\n If[Length[poss] > 0,\n poss = Select[poss, Mod[#, 10] =!= {0, 0} &];\n If[Length[poss] > 0,\n poss = Select[poss, Length[IntegerDigits[First[#]]] == Length[IntegerDigits[Last[#]]] &];\n If[Length[poss] > 0,\n poss = Select[poss, Sort[IntegerDigits[num]] == Sort[Join @@ (IntegerDigits /@ #)] &];\n If[Length[poss] > 0\n ,\n Sow[{num, poss}];\n True\n ,\n False\n ]\n ,\n False\n ]\n ,\n False\n ]\n ,\n False\n ]\n]\n","language":"Mathematica"},{"code":"Reap[Scan[VampireQ,Range[126027]]][[2,1]]//Grid\nReap[VampireQ[#]] & /@ {16758243290880, 24959017348650, 14593825548650} // Grid\n","language":"Mathematica"},{"code":"import algorithm, math, sequtils, strformat, strutils, sugar\n\nconst Pow10 = collect(newSeq, for n in 0..18: 10 ^ n)\n\ntemplate isOdd(n: int): bool = (n and 1) != 0\n\nproc fangs(n: Positive): seq[(int, int)] =\n ## Return the list fo fangs of \"n\" (empty if \"n\" is not vampiric).\n let nDigits = sorted($n)\n if nDigits.len.isOdd: return @[]\n let fangLen = nDigits.len div 2\n let inf = Pow10[fangLen - 1]\n let sup = inf * 10 - 1\n for d in inf..sup:\n if n mod d != 0: continue\n let q = n div d\n if q < d: return\n let dDigits = $d\n let qDigits = $q\n if qDigits.len > fangLen: continue\n if qDigits.len < fangLen: return\n if nDigits != sorted(dDigits & qDigits): continue\n if dDigits[^1] != '0' or qDigits[^1] != '0':\n # Finally, \"n\" is vampiric. Add the fangs to the result.\n result.add (d, q)\n\n\necho \"First 25 vampire numbers with their fangs:\"\nvar count = 0\nvar n = 10\nvar limit = 100\nwhile count != 25:\n let fangList = n.fangs\n if fangList.len != 0:\n inc count\n echo &\"{count:2}: {n:>6} = \", fangList.mapIt(&\"{it[0]:3} × {it[1]:3}\").join(\" = \")\n inc n\n if n == limit:\n n *= 10\n limit *= 10\n\necho()\nfor n in [16_758_243_290_880, 24_959_017_348_650, 14_593_825_548_650]:\n let fangList = n.fangs\n if fangList.len == 0:\n echo &\"{n} is not vampiric.\"\n else:\n echo &\"{n} = \", fangList.mapIt(&\"{it[0]} × {it[1]}\").join(\" = \")\n","language":"Nim"},{"code":"fang(n)=my(v=digits(n),u=List());if(#v%2,return([]));fordiv(n,d,if(#Str(d)==#v/2 && #Str(n/d)==#v/2 && vecsort(v)==vecsort(concat(digits(d),digits(n/d))) && (d%10 || (n/d)%10), if(d^2>n,return(Vec(u))); listput(u, d))); Vec(u)\nk=25;forstep(d=4,6,2,for(n=10^(d-1),10^d-1,f=fang(n); for(i=1,#f,print(n\" \"f[i]\" \"n/f[i]); if(i==#f && k--==0,return))))\nprint();v=[16758243290880, 24959017348650, 14593825548650];\nfor(i=1,#v,f=fang(v[i]); for(j=1,#f, print(v[i]\" \"f[j]\" \"v[i]/f[j])))\n","language":"PARI-GP"},{"code":"#!/usr/bin/perl\nuse warnings;\nuse strict;\nuse feature qw(say);\n\nsub fangs {\n my $vampire = shift;\n my $length = length 0 + $vampire;\n return if $length % 2;\n my $fang_length = $length / 2;\n my $from = '1' . '0' x ($fang_length - 1);\n my $to = '9' x $fang_length;\n my $sorted = join q(), sort split //, $vampire;\n my @fangs;\n for my $f1 ($from .. 1 + sqrt $vampire) {\n next if $vampire % $f1;\n my $f2 = $vampire / $f1;\n next if $sorted ne join q(), sort split //, $f1 . $f2;\n next if 2 == grep '0' eq substr($_, -1 , 1), $f1, $f2; # Needed for the 26th number.\n push @fangs, [$f1, $f2];\n }\n return @fangs;\n}\n\nmy $count = 0;\nmy $i = 9;\nwhile ($count < 25) {\n $i++;\n my @f = fangs($i);\n $count++, say join ' ', \"$count. $i:\", map \"[@$_]\", @f if @f;\n}\n\nsay join ' ', $_, map \"[@$_]\", fangs($_) for 16758243290880, 24959017348650, 14593825548650;\n","language":"Perl"},{"code":"use ntheory qw(sqrtint logint divisors);\n\nsub is_vampire {\n my ($n) = @_;\n\n return if (length($n) % 2 or $n < 0);\n\n my $l1 = 10**logint(sqrtint($n), 10);\n my $l2 = sqrtint($n);\n\n my $s = join('', sort split(//, $n));\n\n my @fangs;\n\n foreach my $d (divisors($n)) {\n\n $d < $l1 and next;\n $d > $l2 and last;\n\n my $t = $n / $d;\n\n next if ($d % 10 == 0 and $t % 10 == 0);\n next if (join('', sort split(//, \"$d$t\")) ne $s);\n\n push @fangs, [$d, $t];\n }\n\n return @fangs;\n}\n\nprint \"First 25 Vampire Numbers:\\n\";\n\nfor (my ($n, $i) = (1, 1) ; $i <= 25 ; ++$n) {\n if (my @fangs = is_vampire($n)) {\n printf(\"%2d. %6s : %s\\n\", $i++, $n, join(' ', map { \"[@$_]\" } @fangs));\n }\n}\n\nprint \"\\nIndividual tests:\\n\";\n\nforeach my $n (16758243290880, 24959017348650, 14593825548650) {\n my @fangs = is_vampire($n);\n print(\"$n: \", (@fangs ? join(' ', map { \"[@$_]\" } @fangs)\n : \"is not a vampire number\"), \"\\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: #7060A8;\">requires</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #008000;\">\"1.0.2\"</span><span style=\"color: #0000FF;\">)</span> <span style=\"color: #000080;font-style:italic;\">-- (for in)</span>\n <span style=\"color: #008080;\">function</span> <span style=\"color: #000000;\">vampire</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #004080;\">atom</span> <span style=\"color: #000000;\">v</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #004080;\">sequence</span> <span style=\"color: #000000;\">res</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #0000FF;\">{}</span>\n <span style=\"color: #008080;\">if</span> <span style=\"color: #000000;\">v</span><span style=\"color: #0000FF;\">>=</span><span style=\"color: #000000;\">0</span> <span style=\"color: #008080;\">then</span>\n <span style=\"color: #004080;\">string</span> <span style=\"color: #000000;\">vs</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;\">v</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #008080;\">if</span> <span style=\"color: #7060A8;\">mod</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #7060A8;\">length</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">vs</span><span style=\"color: #0000FF;\">),</span><span style=\"color: #000000;\">2</span><span style=\"color: #0000FF;\">)=</span><span style=\"color: #000000;\">0</span> <span style=\"color: #008080;\">then</span> <span style=\"color: #000080;font-style:italic;\">-- even length</span>\n <span style=\"color: #000000;\">vs</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">sort</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">vs</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;\">power</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">10</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #7060A8;\">length</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">vs</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: #008080;\">to</span> <span style=\"color: #7060A8;\">floor</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #7060A8;\">sqrt</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">v</span><span style=\"color: #0000FF;\">))</span> <span style=\"color: #008080;\">do</span>\n <span style=\"color: #008080;\">if</span> <span style=\"color: #7060A8;\">remainder</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">v</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">i</span><span style=\"color: #0000FF;\">)=</span><span style=\"color: #000000;\">0</span> <span style=\"color: #008080;\">then</span>\n <span style=\"color: #004080;\">integer</span> <span style=\"color: #000000;\">i2</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">v</span><span style=\"color: #0000FF;\">/</span><span style=\"color: #000000;\">i</span>\n <span style=\"color: #004080;\">string</span> <span style=\"color: #000000;\">si</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;\">i</span><span style=\"color: #0000FF;\">),</span>\n <span style=\"color: #000000;\">s2</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;\">i2</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #008080;\">if</span> <span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">si</span><span style=\"color: #0000FF;\">[$]!=</span><span style=\"color: #008000;\">'0'</span> <span style=\"color: #008080;\">or</span> <span style=\"color: #000000;\">s2</span><span style=\"color: #0000FF;\">[$]!=</span><span style=\"color: #008000;\">'0'</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #008080;\">and</span> <span style=\"color: #7060A8;\">sort</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">si</span><span style=\"color: #0000FF;\">&</span><span style=\"color: #000000;\">s2</span><span style=\"color: #0000FF;\">)=</span><span style=\"color: #000000;\">vs</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;\">i</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">i2</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;\">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;\">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: #004080;\">integer</span> <span style=\"color: #000000;\">found</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">0</span>\n <span style=\"color: #004080;\">atom</span> <span style=\"color: #000000;\">i</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">0</span>\n <span style=\"color: #004080;\">sequence</span> <span style=\"color: #000000;\">res</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;\">\"The first 26 vampire numbers and their fangs:\\n\"</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #008080;\">while</span> <span style=\"color: #000000;\">found</span><span style=\"color: #0000FF;\"><</span><span style=\"color: #000000;\">26</span> <span style=\"color: #008080;\">do</span>\n <span style=\"color: #000000;\">res</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">vampire</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;\">res</span><span style=\"color: #0000FF;\">)</span> <span style=\"color: #008080;\">then</span>\n <span style=\"color: #000000;\">found</span> <span style=\"color: #0000FF;\">+=</span> <span style=\"color: #000000;\">1</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: %d: %v\\n\"</span><span style=\"color: #0000FF;\">,{</span><span style=\"color: #000000;\">found</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>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">if</span>\n <span style=\"color: #000000;\">i</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;\">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\n <span style=\"color: #008080;\">for</span> <span style=\"color: #000000;\">i</span> <span style=\"color: #7060A8;\">in</span> <span style=\"color: #0000FF;\">{</span><span style=\"color: #000000;\">16758243290880</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">24959017348650</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">14593825548650</span><span style=\"color: #0000FF;\">}</span> <span style=\"color: #008080;\">do</span>\n <span style=\"color: #000000;\">res</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">vampire</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;\">\"%d: %s\\n\"</span><span style=\"color: #0000FF;\">,{</span><span style=\"color: #000000;\">i</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;\">\"not a vampire number\"</span><span style=\"color: #0000FF;\">:</span><span style=\"color: #7060A8;\">sprint</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;\">for</span>\n<!--\n","language":"Phix"},{"code":"EnableExplicit\nDisableDebugger\n\nMacro CheckVamp(CheckNum)\n c=0 : i=CheckNum : Print(~\"\\nCheck number: \"+Str(i)+~\"\\n\")\n Gosub VampireLoop : If c=0 : Print(Str(i)+\" is not vampiric.\") : EndIf : PrintN(\"\")\nEndMacro\n\nProcedure.i Factor(number.i,counter.i)\n If number>0 And number>=counter*counter And number%counter=0\n ProcedureReturn counter\n EndIf\n ProcedureReturn 0\nEndProcedure\n\nProcedure.b IsVampire(f1.i,f2.i)\n Define a.s=Str(f1*f2),\n b.s=Str(f1),\n c.s=Str(f2),\n d.s=b+c,\n i.i\n If Len(a)=Len(d) And Len(b)=Len(c)\n While Len(a)\n i=FindString(d,Left(a,1))\n If i\n a=Mid(a,2)\n d=RemoveString(d,Mid(d,i,1),#PB_String_NoCase,i,1)\n Else\n ProcedureReturn #False\n EndIf\n Wend\n ProcedureReturn Bool(Len(d)=0)\n EndIf\n ProcedureReturn #False\nEndProcedure\n\nOpenConsole(\"Vampire number\")\nDefine i.i,\n j.i,\n m.i,\n c.i=0\n\nPrintN(\"The first 25 Vampire numbers...\")\nWhile c<25 : i+1 : Gosub VampireLoop : Wend\nPrintN(\"\")\nCheckVamp(16758243290880) : CheckVamp(24959017348650) : CheckVamp(14593825548650)\nInput()\nEnd\n\nVampireLoop:\n For j=1 To Int(Sqr(i))\n If Factor(i,j)>0\n m=i/j\n Else\n Continue\n EndIf\n If IsVampire(m,j)\n c+1\n PrintN(RSet(Str(c),3,\" \")+\". \"+RSet(Str(i),10,\" \")+\": [\"+Str(j)+\", \"+Str(m)+\"]\")\n EndIf\n Next\nReturn\n","language":"PureBasic"},{"code":"from __future__ import division\n\nimport math\nfrom operator import mul\nfrom itertools import product\nfrom functools import reduce\n\n\ndef fac(n):\n '''\\\n return the prime factors for n\n >>> fac(600)\n [5, 5, 3, 2, 2, 2]\n >>> fac(1000)\n [5, 5, 5, 2, 2, 2]\n >>>\n '''\n step = lambda x: 1 + x*4 - (x//2)*2\n maxq = int(math.floor(math.sqrt(n)))\n d = 1\n q = n % 2 == 0 and 2 or 3\n while q <= maxq and n % q != 0:\n q = step(d)\n d += 1\n res = []\n if q <= maxq:\n res.extend(fac(n//q))\n res.extend(fac(q))\n else: res=[n]\n return res\n\ndef fact(n):\n '''\\\n return the prime factors and their multiplicities for n\n >>> fact(600)\n [(2, 3), (3, 1), (5, 2)]\n >>> fact(1000)\n [(2, 3), (5, 3)]\n >>>\n '''\n res = fac(n)\n return [(c, res.count(c)) for c in set(res)]\n\ndef divisors(n):\n 'Returns all the divisors of n'\n factors = fact(n) # [(primefactor, multiplicity), ...]\n primes, maxpowers = zip(*factors)\n powerranges = (range(m+1) for m in maxpowers)\n powers = product(*powerranges)\n return (\n reduce(mul,\n (prime**power for prime, power in zip(primes, powergroup)),\n 1)\n for powergroup in powers)\n\ndef vampire(n):\n fangsets = set( frozenset([d, n//d])\n for d in divisors(n)\n if (len(str(d)) == len(str(n))/2.\n and sorted(str(d) + str(n//d)) == sorted(str(n))\n and (str(d)[-1] == 0) + (str(n//d)[-1] == 0) <=1) )\n return sorted(tuple(sorted(fangs)) for fangs in fangsets)\n\n\nif __name__ == '__main__':\n print('First 25 vampire numbers')\n count = n = 0\n while count <25:\n n += 1\n fangpairs = vampire(n)\n if fangpairs:\n count += 1\n print('%i: %r' % (n, fangpairs))\n print('\\nSpecific checks for fangpairs')\n for n in (16758243290880, 24959017348650, 14593825548650):\n fangpairs = vampire(n)\n print('%i: %r' % (n, fangpairs))\n","language":"Python"},{"code":"from math import sqrt\nfrom itertools import imap, ifilter, islice, count\n\ndef factor_pairs(n):\n return ((x, n // x) for x in xrange(2, int(sqrt(n))) if n % x == 0)\n\ndef fangs(n):\n dlen = lambda x: len(str(x))\n half = dlen(n) // 2\n digits = lambda (x, y): sorted(str(x) + str(y))\n halvesQ = lambda xs: all(y == half for y in imap(dlen, xs))\n dn = sorted(str(n))\n return [p for p in factor_pairs(n) if halvesQ(p) and dn==digits(p)]\n\ndef vampiricQ(n):\n fn = fangs(n)\n return (n, fn) if fn else None\n\nfor v in islice(ifilter(None, imap(vampiricQ, count())), 0, 25):\n print v\n\nfor n in [16758243290880, 24959017348650, 14593825548650]:\n print vampiricQ(n) or str(n) + \" is not vampiric.\"\n","language":"Python"},{"code":"#lang racket\n\n;; chock full of fun... including divisors\n(require math/number-theory)\n\n;; predicate to tell if n is a vampire number\n(define (sub-vampire?-and-fangs n)\n (define digit-count-n (add1 (order-of-magnitude n)))\n (define (string-sort-characters s) (sort (string->list s) char<?))\n (define digits-in-order-n (string-sort-characters (number->string n)))\n (define (fangs-of-n? d e)\n (and (<= d e) ; avoid duplication\n (= (add1 (order-of-magnitude d)) (add1 (order-of-magnitude e)) (/ digit-count-n 2))\n (not (= 0 (modulo d 10) (modulo e 10)))\n (equal? digits-in-order-n\n (string-sort-characters (string-append (number->string d) (number->string e))))))\n\n (let* ((fangses (for*/list ((d (in-list (divisors n))) #:when (fangs-of-n? d (/ n d)))\n (list d (/ n d)))))\n (and (not (null? fangses)) (cons n fangses))))\n\n(define (vampire?-and-fangs n)\n (and (odd? (order-of-magnitude n)) ; even number of digits - else not even worth looking!\n (sub-vampire?-and-fangs n)))\n\n(displayln \"First 25 vampire numbers:\")\n(for ((vmp (sequence-filter identity (sequence-map vampire?-and-fangs (in-naturals 1))))\n (cnt (in-range 1 (add1 25))))\n (printf \"#~a ~a~%\" cnt vmp))\n\n(displayln \"Test the big numbers:\")\n(displayln (vampire?-and-fangs 16758243290880))\n(displayln (vampire?-and-fangs 24959017348650))\n(displayln (vampire?-and-fangs 14593825548650))\n","language":"Racket"},{"code":"sub is_vampire (Int $num) {\n my $digits = $num.comb.sort;\n my @fangs;\n (10**$num.sqrt.log(10).floor .. $num.sqrt.ceiling).map: -> $this {\n next if $num % $this;\n my $that = $num div $this;\n next if $this %% 10 && $that %% 10;\n @fangs.push(\"$this x $that\") if ($this ~ $that).comb.sort eq $digits;\n }\n @fangs\n}\n\nconstant @vampires = flat (3..*).map: -> $s, $e {\n (10**$s .. 10**$e).hyper.map: -> $n {\n next unless my @fangs = is_vampire($n);\n \"$n: { @fangs.join(', ') }\"\n }\n}\n\nsay \"\\nFirst 25 Vampire Numbers:\\n\";\n\n.say for @vampires[^25];\n\nsay \"\\nIndividual tests:\\n\";\n\n.say for (16758243290880, 24959017348650, 14593825548650).hyper(:1batch).map: {\n \"$_: \" ~ (is_vampire($_).join(', ') || 'is not a vampire number.')\n}\n","language":"Raku"},{"code":"/*REXX program displays N vampire numbers, or verifies if a number is vampiric. */\nparse arg N . /*obtain optional argument from the CL.*/\nif N=='' | N==\",\" then N= 25 /*Not specified? Then use the default.*/\n!.0= 1260; !.1= 11453481; !.2= 115672; !.3= 124483; !.4= 105264 /*lowest #, dig*/\n!.5= 1395; !.6= 126846; !.7= 1827; !.8= 110758; !.9= 156289 /* \" \" \" */\nL= length(N); aN= abs(N) /*L: length of N; aN: absolute value*/\nnumeric digits max(9, length(aN) ) /*be able to handle ginormus numbers. */\n# = 0 /*#: count of vampire numbers (so far)*/\nif N>0 then do j=1260 until # >= N /*search until N vampire numbers found.*/\n if length(j) // 2 then do; j= j*10 - 1; iterate /*bump J to even length*/\n end /* [↑] check if odd. */\n parse var j '' -1 _ /*obtain the last decimal digit of J. */\n if j<!._ then iterate /*is number tenable based on last dig? */\n f= vampire(j) /*obtain the fangs of J. */\n if f=='' then iterate /*Are fangs null? Yes, not vampire. */\n #= # + 1 /*bump the vampire count, Vlad. */\n say right('vampire number', 20) right(#, L) \"is: \" right(j, 9)', fangs=' f\n end /*j*/ /* [↑] process a range of numbers. */\n else do; f= vampire(aN) /* [↓] process a number; obtain fangs.*/\n if f=='' then say aN \" isn't a vampire number.\"\n else say aN \" is a vampire number, fangs=\" f\n end\nexit 0 /*stick a fork in it, we're all done. */\n/*──────────────────────────────────────────────────────────────────────────────────────*/\nvampire: procedure; parse arg x,, $. a bot; L= length(x) /*get arg; compute len of X*/\n if L//2 then return '' /*is L odd? Then ¬vampire.*/\n do k=1 for L; _= substr(x, k, 1); $._= $._ || _\n end /*k*/\n w= L % 2 /*%: is REXX's integer ÷ */\n do m=0 for 10; bot= bot || $.m\n end /*m*/\n top= left( reverse(bot), w)\n bot= left(bot, w) /*determine limits of search*/\n inc= x // 2 + 1 /*X is odd? INC=2. No? INC=1*/\n beg= max(bot, 10 ** (w-1) ) /*calculate where to begin.*/\n if inc==2 then if beg//2==0 then beg= beg + 1 /*possibly adjust the begin.*/\n /* [↑] odd BEG if odd INC*/\n do d=beg to min(top, 10**w - 1) by inc /*use smart BEG, END, INC. */\n if x // d \\==0 then iterate /*X not ÷ by D? Then skip,*/\n q= x % d; if d>q then iterate /*is D > Q \" \" */\n if length(q) \\== w then iterate /*Len of Q ¬= W? Then skip.*/\n if q*d//9 \\== (q+d)//9 then iterate /*modulo 9 congruence test. */\n parse var q '' -1 _ /*get last decimal dig. of Q*/\n if _== 0 then if right(d, 1) == 0 then iterate\n dq= d || q\n t= x; do i=1 for L; p= pos( substr(dq, i, 1), t)\n if p==0 then iterate d; t= delstr(t, p, 1)\n end /*i*/\n a= a '['d\"∙\"q'] ' /*construct formatted fangs.*/\n end /*d*/ /* [↑] ∙ is a round bullet*/\n return a /*return formatted fangs.*/\n","language":"REXX"},{"code":"# Project : Vampire number\n\nfor p = 10 to 127000\n vampire(p)\nnext\n\nfunc vampire(listnum)\n sum = 0\n flag = 1\n list = list(len(string(listnum)))\n total = newlist(len(list),2)\n for n = 1 to len(string(listnum))\n liststr = string(listnum)\n list[n] = liststr[n]\n next\n\n for perm = 1 to fact(len(list))\n numstr = substr(list2str(list), nl, \"\")\n num1 = number(left(numstr,len(numstr)/2))\n num2 = number(right(numstr,len(numstr)/2))\n if (listnum = num1 * num2)\n for n = 1 to len(total)\n if (num1 = total[n][2] and num2 = total[n][1]) or\n (num1 = total[n][1] and num2 = total[n][2])\n flag = 0\n ok\n next\n if flag = 1\n sum = sum + 1\n total[sum][1] = num1\n total[sum][2] = num2\n see \"\" + listnum + \": [\" + num1 + \",\" + num2 + \"]\" + nl\n ok\n ok\n nextPermutation(list)\n next\n\nfunc nextPermutation(a)\n elementcount = len(a)\n if elementcount < 1 then return ok\n pos = elementcount-1\n while a[pos] >= a[pos+1]\n pos -= 1\n if pos <= 0 permutationReverse(a, 1, elementcount)\n return ok\n end\n last = elementcount\n while a[last] <= a[pos]\n last -= 1\n end\n temp = a[pos]\n a[pos] = a[last]\n a[last] = temp\n permutationReverse(a, pos+1, elementcount)\n\n func permutationReverse a, first, last\n while first < last\n temp = a[first]\n a[first] = a[last]\n a[last] = temp\n first += 1\n last -= 1\n end\n\nfunc fact(nr)\n if nr = 1\n return 1\n else\n return nr * fact(nr-1)\n ok\n\nfunc newlist(x,y)\n if isstring(x) x=0+x ok\n if isstring(y) y=0+y ok\n alist = list(x)\n for t in alist\n t = list(y)\n next\n return alist\n","language":"Ring"},{"code":"def factor_pairs n\n first = n / (10 ** (n.to_s.size / 2) - 1)\n (first .. n ** 0.5).map { |i| [i, n / i] if n % i == 0 }.compact\nend\n\ndef vampire_factors n\n return [] if n.to_s.size.odd?\n half = n.to_s.size / 2\n factor_pairs(n).select do |a, b|\n a.to_s.size == half && b.to_s.size == half &&\n [a, b].count {|x| x%10 == 0} != 2 &&\n \"#{a}#{b}\".chars.sort == n.to_s.chars.sort\n end\nend\n\ni = vamps = 0\nuntil vamps == 25\n vf = vampire_factors(i += 1)\n unless vf.empty?\n puts \"#{i}:\\t#{vf}\"\n vamps += 1\n end\nend\n\n[16758243290880, 24959017348650, 14593825548650].each do |n|\n if (vf = vampire_factors n).empty?\n puts \"#{n} is not a vampire number!\"\n else\n puts \"#{n}:\\t#{vf}\"\n end\nend\n","language":"Ruby"},{"code":"use std::cmp::{max, min};\n\nstatic TENS: [u64; 20] = [\n 1,\n 10,\n 100,\n 1000,\n 10000,\n 100000,\n 1000000,\n 10000000,\n 100000000,\n 1000000000,\n 10000000000,\n 100000000000,\n 1000000000000,\n 10000000000000,\n 100000000000000,\n 1000000000000000,\n 10000000000000000,\n 100000000000000000,\n 1000000000000000000,\n 10000000000000000000,\n];\n\n/// Get the number of digits present in x\nfn ndigits(mut x: u64) -> u64 {\n let mut n = 0;\n\n while x != 0 {\n n += 1;\n x /= 10;\n }\n\n n\n}\n\nfn dtally(mut x: u64) -> u64 {\n let mut t = 0;\n\n while x != 0 {\n t += 1 << ((x % 10) * 6);\n x /= 10;\n }\n\n t\n}\n\n/// Get a list of all fangs of x. Get only the first divider of each fang. The second one can be found simply with x / fang.\nfn fangs(x: u64) -> Vec<u64> {\n let mut nd = ndigits(x) as usize;\n\n let mut fangs = vec![];\n\n if nd & 1 != 1 {\n nd /= 2;\n\n let lo = max(TENS[nd - 1], (x + TENS[nd] - 2) / (TENS[nd] - 1));\n let hi = min(x / lo, (x as f64).sqrt() as u64);\n\n let t = dtally(x);\n\n for a in lo..(hi + 1) {\n let b = x / a;\n if a * b == x && ((a % 10) > 0 || b % 10 > 0) && t == dtally(a) + dtally(b) {\n fangs.push(a);\n }\n }\n }\n\n fangs\n}\n\n/// Pretty print the fangs of x\nfn print_fangs(x: u64, fangs: Vec<u64>) {\n print!(\"{} = \", x);\n\n if fangs.is_empty() {\n print!(\"is not vampiric\");\n } else {\n for fang in fangs {\n print!(\"{} x {}, \", fang, x / fang);\n }\n }\n print!(\"\\n\");\n}\n\nfn main() {\n println!(\"The first 25 vampire numbers are :\");\n\n let mut nfangs = 0;\n let mut x = 1;\n\n while nfangs < 25 {\n let fangs = fangs(x);\n if !fangs.is_empty() {\n nfangs += 1;\n print_fangs(x, fangs);\n }\n\n x += 1;\n }\n\n println!(\"\\nSpecial requests :\");\n\n print_fangs(16758243290880, fangs(16758243290880));\n print_fangs(24959017348650, fangs(24959017348650));\n print_fangs(14593825548650, fangs(14593825548650));\n}\n\n#[test]\nfn test() {\n assert_eq!(\n fangs(16758243290880),\n vec![1982736, 2123856, 2751840, 2817360]\n );\n\n assert_eq!(\n fangs(24959017348650),\n vec![2947050, 2949705, 4125870, 4129587, 4230765]\n );\n\n assert_eq!(fangs(14593825548650), vec![]);\n}\n","language":"Rust"},{"code":"import Stream._\nimport math._\nimport scala.collection.mutable.ListBuffer\n\nobject VampireNumbers extends App {\n val elapsed: (=> Unit) => Long = f => {val s = System.currentTimeMillis; f; (System.currentTimeMillis - s)/1000}\n\n val sexp = from(1, 2) // stream of integer: 1,3,5,7, ...\n val rs: Stream[Int] => Stream[Pair[Long,Long]] = exps => Pair(pow(10,exps.head).toLong,(pow(10,exps.head)*10-1).toLong)#::rs(exps.tail)\n val srs = rs(sexp) // stream of ranges: [10..99], [1000..9999], [100000..999999], ...\n val cs: Stream[Pair[Long,Long]] => Stream[Long] = rs => (rs.head._1 to rs.head._2).toStream#:::cs(rs.tail)\n val scs = cs(srs) // stream of candidates: 10,11,..,99,1000,1001,..,9999, ...\n val it = scs.iterator\n\n val checkVN: Long => Pair[Long,Seq[Pair[Long,Long]]] = n => {\n val check: Pair[Long,Long] => Pair[Long,Long] = p => {\n val len: Long => Int = n => n.toString.size\n val (a,b) = p\n if ((a%10==0)&&(b%10==0)) Pair(0,0) else\n if (len(a) != len(b)) Pair(0,0) else\n if (n.toString.toList.diff(a.toString.toList++b.toString.toList)!=Nil) Pair(0,0) else p\n }\n Pair(n,(pow(10,log10(sqrt(n).toLong).toLong).toLong+1 to sqrt(n).toLong).filter{i=>n%i==0}\n .map {fac =>Pair(fac,n/fac)}.map {p => check(p)}.filter {p => p._1 != 0})\n }\n\n val et = elapsed {\n val lb = new ListBuffer[Pair[Long,Seq[Pair[Long,Long]]]]\n while ((lb.size<25)&&(it.hasNext)) {\n checkVN(it.next) match {\n case (n, Seq()) =>\n case p => lb += p\n }\n }\n\n lb.toList.zipWithIndex.foreach {p =>\n println(p._2+1+\": \"+p._1._1+(p._1._2:\\\"\")((x,y)=>\" = \"+x._1+\" x \"+x._2+y))\n }\n println\n\n List(16758243290880L, 24959017348650L, 14593825548650L)\n .map {checkVN(_)}\n .foreach {\n case (n, Seq()) => println(n+\" is not vampiric\")\n case p => println(p._1+(p._2:\\\"\")((x,y)=>\" = \"+x._1+\" x \"+x._2+y))\n }\n }\n\n println(\"\\n\"+\"elapsed time: \"+et+\" seconds\")\n}\n","language":"Scala"},{"code":"func is_vampire (n) {\n return [] if n.ilog10.is_even\n\n var l1 = n.isqrt.ilog10.ipow10\n var l2 = n.isqrt\n\n var s = n.digits.sort.join\n\n gather {\n n.divisors.each { |d|\n\n d < l1 && next\n d > l2 && break\n\n var t = n/d\n\n next if (d%%10 && t%%10)\n next if (\"#{d}#{t}\".sort != s)\n\n take([d, t])\n }\n }\n}\n\nsay \"First 25 Vampire Numbers:\"\n\nwith (1) { |i|\n for (var n = 1; i <= 25; ++n) {\n var fangs = is_vampire(n)\n printf(\"%2d. %6s : %s\\n\", i++, n, fangs.join(' ')) if fangs\n }\n}\n\nsay \"\\nIndividual tests:\"\n\n[16758243290880, 24959017348650, 14593825548650].each { |n|\n var fangs = is_vampire(n)\n say \"#{n}: #{fangs ? fangs.join(', ') : 'is not a vampire number'}\"\n}\n","language":"Sidef"},{"code":"import Foundation\n\nfunc vampire<T>(n: T) -> [(T, T)] where T: BinaryInteger, T.Stride: SignedInteger {\n let strN = String(n).sorted()\n let fangLength = strN.count / 2\n let start = T(pow(10, Double(fangLength - 1)))\n let end = T(Double(n).squareRoot())\n\n var fangs = [(T, T)]()\n\n for i in start...end where n % i == 0 {\n let quot = n / i\n\n guard i % 10 != 0 || quot % 10 != 0 else {\n continue\n }\n\n if \"\\(i)\\(quot)\".sorted() == strN {\n fangs.append((i, quot))\n }\n }\n\n return fangs\n}\n\nvar count = 0\nvar i = 1.0\n\nwhile count < 25 {\n let start = Int(pow(10, i))\n let end = start * 10\n\n for num in start...end {\n let fangs = vampire(n: num)\n\n guard !fangs.isEmpty else { continue }\n\n count += 1\n\n print(\"\\(num) is a vampire number with fangs: \\(fangs)\")\n\n guard count != 25 else { break }\n }\n\n i += 2\n}\n\nfor (vamp, fangs) in [16758243290880, 24959017348650, 14593825548650].lazy.map({ ($0, vampire(n: $0)) }) {\n if fangs.isEmpty {\n print(\"\\(vamp) is not a vampire number\")\n } else {\n print(\"\\(vamp) is a vampire number with fangs: \\(fangs)\")\n }\n}\n","language":"Swift"},{"code":"proc factorPairs {n {from 2}} {\n set result [list 1 $n]\n if {$from<=1} {set from 2}\n for {set i $from} {$i<=sqrt($n)} {incr i} {\n\tif {$n%$i} {} {lappend result $i [expr {$n/$i}]}\n }\n return $result\n}\n\nproc vampireFactors {n} {\n if {[string length $n]%2} return\n set half [expr {[string length $n]/2}]\n set digits [lsort [split $n \"\"]]\n set result {}\n foreach {a b} [factorPairs $n [expr {10**$half/10}]] {\n\tif {\n\t [string length $a]==$half && [string length $b]==$half &&\n\t ($a%10 || $b%10) && $digits eq [lsort [split $a$b \"\"]]\n\t} then {\n\t lappend result [list $a $b]\n\t}\n }\n return $result\n}\n","language":"Tcl"},{"code":"# A nicer way to print the evidence of vampire-ness\nproc printVampire {n pairs} {\n set out \"${n}:\"\n foreach p $pairs {\n\tappend out \" \\[[join $p {, }]\\]\"\n }\n puts $out\n}\nset n 0\nfor {set i 0} {$i < 25} {incr i} {\n while 1 {\n\tif {[llength [set vamps [vampireFactors [incr n]]]]} {\n\t printVampire $n $vamps\n\t break\n\t}\n }\n}\nputs \"\"\nforeach n {16758243290880 24959017348650 14593825548650} {\n if {[llength [set vamps [vampireFactors $n]]]} {\n\tprintVampire $n $vamps\n } else {\n\tputs \"$n is not a vampire number\"\n }\n}\n","language":"Tcl"},{"code":"import math\nfn max(a u64, b u64) u64 {\n if a > b {\n return a\n }\n return b\n}\n\nfn min(a u64, b u64) u64 {\n if a < b {\n return a\n }\n return b\n}\n\nfn ndigits(xx u64) int {\n mut n:=0\n mut x := xx\n for ; x > 0; x /= 10 {\n n++\n }\n return n\n}\n\nfn dtally(xx u64) u64 {\n mut t := u64(0)\n mut x := xx\n for ; x > 0; x /= 10 {\n t += 1 << (x % 10 * 6)\n }\n return t\n}\n\n__global (\n tens [20]u64\n)\n\nfn init() {\n tens[0] = 1\n for i := 1; i < 20; i++ {\n tens[i] = tens[i-1] * 10\n }\n}\n\nfn fangs(x u64) []u64 {\n mut f := []u64{}\n mut nd := ndigits(x)\n if nd&1 == 1 {\n return f\n }\n nd /= 2\n lo := max(tens[nd-1], (x+tens[nd]-2)/(tens[nd]-1))\n hi := min(x/lo, u64(math.sqrt(f64(x))))\n t := dtally(x)\n for a := lo; a <= hi; a++ {\n b := x / a\n if a*b == x &&\n (a%10 > 0 || b%10 > 0) &&\n t == dtally(a)+dtally(b) {\n f << a\n }\n }\n return f\n}\n\nfn show_fangs(x u64, f []u64) {\n print(x)\n if f.len > 1 {\n println('')\n }\n for a in f {\n println(\" = $a × ${x/a}\")\n }\n}\n\nfn main() {\n for x, n := u64(1), 0; n < 26; x++ {\n f := fangs(x)\n if f.len > 0 {\n n++\n print(\"${n:2}: \")\n show_fangs(x, f)\n }\n }\n println('')\n for x in [u64(16758243290880), 24959017348650, 14593825548650] {\n f := fangs(x)\n if f.len > 0 {\n show_fangs(x, f)\n } else {\n println(\"$x is not vampiric\")\n }\n }\n}\n","language":"V-(Vlang)"},{"code":"import \"./fmt\" for Fmt\n\nvar ndigits = Fn.new { |x|\n var n = 0\n while (x > 0) {\n n = n + 1\n x = (x/10).floor\n }\n return n\n}\n\nvar dtally = Fn.new { |x|\n var t = 0\n while (x > 0) {\n t = t + 2.pow((x%10) * 6)\n x = (x/10).floor\n }\n return t\n}\n\nvar tens = List.filled(15, 0)\n\nvar init = Fn.new {\n tens[0] = 1\n for (i in 1..14) tens[i] = tens[i-1] * 10\n}\n\nvar fangs = Fn.new { |x|\n var f = []\n var nd = ndigits.call(x)\n if ((nd&1) == 1) return f\n nd = (nd/2).floor\n var lo = tens[nd-1].max(((x + tens[nd] - 2) / (tens[nd] - 1)).floor)\n var hi = (x/lo).floor.min(x.sqrt.floor)\n var t = dtally.call(x)\n var a = lo\n while (a <= hi) {\n var b = (x/a).floor\n if (a*b == x && ((a%10) > 0 || (b%10) > 0) && t == dtally.call(a) + dtally.call(b)) {\n f.add(a)\n }\n a = a + 1\n }\n return f\n}\n\nvar showFangs = Fn.new { |x, f|\n Fmt.write(\"$6d\", x)\n if (f.count > 1) System.print()\n for (a in f) Fmt.print(\" = $3d x $3d\", a, (x/a).floor)\n}\n\ninit.call()\nvar x = 1\nvar n = 0\nwhile (n < 25) {\n var f = fangs.call(x)\n if (f.count > 0) {\n n = n + 1\n Fmt.write(\"$2d: \", n)\n showFangs.call(x, f)\n }\n x = x + 1\n}\nSystem.print()\nfor (x in [16758243290880, 24959017348650, 14593825548650]) {\n var f = fangs.call(x)\n if (f.count > 0) {\n showFangs.call(x, f)\n } else {\n Fmt.print(\"$d is not vampiric\", x)\n }\n}\n","language":"Wren"},{"code":"fcn fangs(N){ //-->if Vampire number: (N,(a,b,c,...)), where a*x==N\n var [const] tens=[0 .. 18].pump(List,(10.0).pow,\"toInt\");\n\n (half:=N.numDigits) : if (_.isOdd) return(T);;\n half/=2; digits:=N.toString().sort();\n lo:=tens[half-1].max((N+tens[half])/(tens[half]));\n hi:=(N/lo).min(N.toFloat().sqrt());\n fs:=[lo .. hi].filter('wrap(n){\n N%n==0 and (n%10!=0 or (N/n)%10!=0) and\n (n.toString()+(N/n).toString()).sort()==digits\n });\n fs and T(N,fs) or T;\n}\n","language":"Zkl"},{"code":"fcn vampiric(fangs,n=Void){\n if(not fangs) return(n,\"Not a Vampire number\");\n v:=fangs[0]; T(v,fangs[1].apply('wrap(n){T(n,v/n)})) }\n\nT(16758243290880, 24959017348650, 14593825548650)\n.pump(Console.println,fcn(n){\"%d: %s\".fmt(vampiric(fangs(n),n).xplode())});\n\n(0).walker(*).tweak(fangs).filter(26)\n.pump(Console.println,vampiric);\n","language":"Zkl"}],"string":"[\n {\n \"code\": \"---\\nfrom: http://rosettacode.org/wiki/Vampire_number\\nnote: Mathematics\\n\",\n \"language\": \"00-META\"\n },\n {\n \"code\": \"A [[wp:Vampire_number|vampire number]] is a natural decimal number with an even number of digits, that can be factored into two integers. \\n\\nThese two factors are called the ''fangs'', and must have the following properties:\\n::* they each contain half the number of the decimal digits of the original number\\n::* together they consist of exactly the same decimal digits as the original number\\n::* at most one of them has a trailing zero\\n\\n\\nAn example of a vampire number and its fangs: <code> 1260 : (21, 60) </code>\\n\\n\\n;Task:\\n# Print the first '''25''' vampire numbers and their fangs. \\n# Check if the following numbers are vampire numbers and, if so, print them and their fangs: \\n<big><code> 16758243290880, 24959017348650, 14593825548650 </code></big>\\n\\n\\nNote that a vampire number can have more than one pair of fangs.\\n\\n\\n;See also:\\n* [http://www.numberphile.com/videos/vampire_numbers.html numberphile.com].\\n* [http://users.cybercity.dk/~dsl522332/math/vampires/ vampire search algorithm]\\n* [[oeis:A014575|vampire numbers on OEIS]]\\n<br><br>\\n\\n\",\n \"language\": \"00-TASK\"\n },\n {\n \"code\": \"-V Pow10 = (0..18).map(n -> Int64(10) ^ n)\\n\\nF isOdd(n)\\n R (n [&] 1) != 0\\n\\nF fangs(n)\\n [(Int64, Int64)] r\\n\\n V nDigits = sorted(String(n))\\n I isOdd(nDigits.len)\\n R r\\n\\n V fangLen = nDigits.len I/ 2\\n V inf = Pow10[fangLen - 1]\\n L(d) inf .< inf * 10\\n I n % d != 0\\n L.continue\\n V q = n I/ d\\n I q < d\\n R r\\n V dDigits = String(d)\\n V qDigits = String(q)\\n I qDigits.len > fangLen\\n L.continue\\n I qDigits.len < fangLen\\n R r\\n I nDigits != sorted(dDigits‘’qDigits)\\n L.continue\\n I dDigits.last != ‘0’ | qDigits.last != ‘0’\\n r.append((d, q))\\n\\n R r\\n\\nprint(‘First 25 vampire numbers with their fangs:’)\\nV count = 0\\nV n = 10\\nV limit = 100\\nL count != 25\\n V fangList = fangs(n)\\n I !fangList.empty\\n count++\\n print((‘#2: #6 =’.format(count, n))‘ ’fangList.map(it -> ‘#3 x #3’.format(it[0], it[1])).join(‘ = ’))\\n n++\\n I n == limit\\n n *= 10\\n limit *= 10\\n\\nprint()\\nL(n) [16'758'243'290'880, 24'959'017'348'650, 14'593'825'548'650]\\n V fangList = fangs(n)\\n I fangList.empty\\n print(n‘ is not vampiric.’)\\n E\\n print(n‘ = ’fangList.map(it -> ‘#. x #.’.format(it[0], it[1])).join(‘ = ’))\\n\",\n \"language\": \"11l\"\n },\n {\n \"code\": \"SetBatchLines -1 ; used to improve performance\\n; (you can make it much faster by removing the informative tooltips)\\n\\n;********************\\n; CONFIG\\n;********************\\nStartingNumber := 10\\nNumberLimit := 126030\\nCounterLimit := 25 ; calculations stop when one of these limits is reached\\nAdditionalNumbers := \\\"16758243290880,24959017348650,14593825548650\\\"\\n;********************\\n\\nCurrentCounter := 0, CurrentNumber := StartingNumber\\n\\nLoop {\\n if !Mod(A_Index,75) ; informative tooltip (every 75 calculations, to avoid slowing down)\\n ToolTip, % \\\"Checking numbers...`nNumber: \\\" CurrentNumber\\n . \\\"/\\\" NumberLimit \\\"`nFound: \\\" CurrentCounter \\\"/\\\" CounterLimit\\n if ( CurrentCounter >= CounterLimit ) || ( CurrentNumber >= NumberLimit )\\n Break\\n if Mod(StrLen(CurrentNumber),2)\\n CurrentNumber *= 10\\n else if ( ( CurrentResult := GetFangs(CurrentNumber) ) <> \\\"\\\" )\\n Output .= \\\"`n\\\" CurrentNumber \\\":`t\\\" CurrentResult, CurrentCounter++\\n CurrentNumber++\\n}\\nToolTip ; hide informative tooltip\\n\\nMsgBox % SubStr(Output,2) ; show output (first part)\\n\\nOutput := \\\"\\\"\\nLoop, Parse, AdditionalNumbers, % \\\",\\\"\\n{\\n ToolTip, % \\\"Getting fangs for \\\" A_LoopField \\\" ...\\\" ; informative tooltip\\n Output .= \\\"`n\\\" A_LoopField \\\":`n`t\\\" GetFangs(A_LoopField) \\\"`n\\\"\\n}\\nToolTip ; hide informative tooltip\\n\\nMsgBox % SubStr(Output,2) ; show output (second part - additional numbers)\\nExitApp\\n\\n;----------------------------------------------------------------------------------\\n\\nCharSorter(Input) { ; required by GetFangs()\\n Loop, Parse, Input\\n Output .= A_LoopField \\\"`n\\\"\\n Sort, Output\\n StringReplace, Output, Output, % \\\"`n\\\",, All\\n Return Output\\n}\\n\\n;----------------------------------------------------------------------------------\\n\\nGetFangs(CurrentNumber) { ; requires CharSorter()\\n ResultIndex := 1\\n Length := StrLen(CurrentNumber)\\n Power := (Length//2)-1\\n if Mod(Length,2) OR !Power\\n Return \\\"\\\"\\n NumberLimit := Floor(Sqrt(CurrentNumber))\\n Lower := 10 ** Power\\n Loop, % NumberLimit - Lower {\\n if !Mod(CurrentNumber,Lower) {\\n FactorTwo := CurrentNumber//Lower\\n if ( !Mod(Lower,10) && !Mod(FactorTwo,10) )\\n Return \\\"\\\"\\n Check := CharSorter( Lower . FactorTwo )\\n if (CharSorter(CurrentNumber) = Check) && (StrLen(Lower) = StrLen(FactorTwo))\\n Output .= \\\"`n`t[\\\" Lower \\\",\\\" FactorTwo \\\"]\\\"\\n }\\n Lower++\\n }\\n Return SubStr(Output,3) ; 3 = 1 + length of \\\"`n`t\\\"\\n}\\n\",\n \"language\": \"AutoHotkey\"\n },\n {\n \"code\": \"( ( vampire\\n = N len R fangsList\\n . !arg:@(?N:? [?len)\\n & 1/2*!len:~/:?len\\n & ( R\\n = len numpart left right allowed fangs rdigits\\n , tried digit untried head tail found\\n . !arg:(?len.?left.?numpart.?allowed)\\n & :?found\\n & ( !len:>0\\n & ( @( !numpart\\n : ?tried\\n ( #%@?digit\\n & !allowed:?head !digit ?tail\\n & !head !tail:?allowed\\n )\\n ( ?untried\\n & R\\n $ ( !len+-1\\n . 10*!left+!digit\\n . str$(!tried !untried)\\n . 0 1 2 3 4 5 6 7 8 9\\n )\\n : ?fangs\\n & !found !fangs:?found\\n & ~\\n )\\n )\\n | !found\\n )\\n | !N*!left^-1:~/?right:~<!left:?rdigits\\n & (!left*1/10:/|!right*1/10:/)\\n & ( @( !numpart\\n : ?\\n ( #%@?digit ?\\n & @(!rdigits:?head !digit ?tail)\\n & str$(!head !tail):?rdigits\\n & ~\\n )\\n )\\n | !rdigits:&(!left,!right)\\n )\\n )\\n )\\n & R$(!len.0.!N.1 2 3 4 5 6 7 8 9)\\n : (\\n | ?fangsList\\n & out$(!N !fangsList)\\n & 1+!count:?count\\n )\\n )\\n& 0:?count\\n& 10:?i\\n& 16758243290880 24959017348650 14593825548650:?bignums\\n& whl\\n ' ( ( vampire$!i&1+!i:?i\\n | !i*10:?i\\n )\\n & (!count:<25|!bignums:%?i ?bignums)\\n )\\n);\\n\",\n \"language\": \"Bracmat\"\n },\n {\n \"code\": \"#include <stdio.h>\\n#include <stdlib.h>\\n#include <stdint.h>\\n#include <math.h>\\n\\ntypedef uint64_t xint;\\ntypedef unsigned long long ull;\\n\\nxint tens[20];\\n\\ninline xint max(xint a, xint b) { return a > b ? a : b; }\\ninline xint min(xint a, xint b) { return a < b ? a : b; }\\ninline int ndigits(xint x)\\n{\\n\\tint n = 0;\\n\\twhile (x) n++, x /= 10;\\n\\treturn n;\\n}\\n\\ninline xint dtally(xint x)\\n{\\n\\txint t = 0;\\n\\twhile (x) t += 1<<((x%10) * 6), x /= 10;\\n\\n\\treturn t;\\n}\\n\\nint fangs(xint x, xint *f)\\n{\\n\\tint n = 0;\\n\\tint nd = ndigits(x);\\n\\tif (nd & 1) return 0;\\n\\tnd /= 2;\\n\\n\\txint lo, hi;\\n\\tlo = max(tens[nd-1], (x + tens[nd] - 2)/ (tens[nd] - 1));\\n\\thi = min(x / lo, sqrt(x));\\n\\n\\txint a, b, t = dtally(x);\\n\\tfor (a = lo; a <= hi; a++) {\\n\\t\\tb = x / a;\\n\\t\\tif (a * b == x && ((a%10) || (b%10)) && t == dtally(a) + dtally(b))\\n\\t\\t\\tf[n++] = a;\\n\\t}\\n\\n\\treturn n;\\n}\\n\\nvoid show_fangs(xint x, xint *f, xint cnt)\\n{\\n\\tprintf(\\\"%llu\\\", (ull)x);\\n\\tint i;\\n\\tfor (i = 0; i < cnt; i++)\\n\\t\\tprintf(\\\" = %llu x %llu\\\", (ull)f[i], (ull)(x / f[i]));\\n\\tputchar('\\\\n');\\n}\\n\\nint main(void)\\n{\\n\\tint i, j, n;\\n\\txint x, f[16], bigs[] = {16758243290880ULL, 24959017348650ULL, 14593825548650ULL, 0};\\n\\n\\ttens[0] = 1;\\n\\tfor (i = 1; i < 20; i++)\\n\\t\\ttens[i] = tens[i-1] * 10;\\n\\n\\tfor (x = 1, n = 0; n < 25; x++) {\\n\\t\\tif (!(j = fangs(x, f))) continue;\\n\\t\\tprintf(\\\"%2d: \\\", ++n);\\n\\t\\tshow_fangs(x, f, j);\\n\\t}\\n\\n\\tputchar('\\\\n');\\n\\tfor (i = 0; bigs[i]; i++) {\\n\\t\\tif ((j = fangs(bigs[i], f)))\\n\\t\\t\\tshow_fangs(bigs[i], f, j);\\n\\t\\telse\\n\\t\\t\\tprintf(\\\"%llu is not vampiric\\\\n\\\", (ull)bigs[i]);\\n\\t}\\n\\n\\treturn 0;\\n}\\n\",\n \"language\": \"C\"\n },\n {\n \"code\": \"#include <vector>\\n#include <utility>\\n#include <algorithm>\\n#include <iostream>\\n#include <sstream>\\n#include <string>\\n#include <cmath>\\n\\nbool isVampireNumber( long number, std::vector<std::pair<long, long> > & solution ) {\\n std::ostringstream numberstream ;\\n numberstream << number ;\\n std::string numberstring( numberstream.str( ) ) ;\\n std::sort ( numberstring.begin( ) , numberstring.end( ) ) ;\\n int fanglength = numberstring.length( ) / 2 ;\\n long start = static_cast<long>( std::pow( 10 , fanglength - 1 ) ) ;\\n long end = sqrt(number) ;\\n for ( long i = start ; i <= end ; i++ ) {\\n if ( number % i == 0 ) {\\n\\t long quotient = number / i ;\\n\\t if ( ( i % 10 == 0 ) && ( quotient % 10 == 0 ) )\\n\\t continue ;\\n\\t numberstream.str( \\\"\\\" ) ; //clear the number stream\\n\\t numberstream << i << quotient ;\\n\\t std::string divisorstring ( numberstream.str( ) ) ;\\n std::sort ( divisorstring.begin( ) , divisorstring.end( ) ) ;\\n\\t if ( divisorstring == numberstring ) {\\n\\t std::pair<long , long> divisors = std::make_pair( i, quotient ) ;\\n\\t solution.push_back( divisors ) ;\\n\\t }\\n }\\n }\\n return !solution.empty( ) ;\\n}\\n\\nvoid printOut( const std::pair<long, long> & solution ) {\\n std::cout << \\\"[ \\\" << solution.first << \\\" , \\\" << solution.second << \\\" ]\\\" ;\\n}\\n\\nint main( ) {\\n int vampireNumbersFound = 0 ;\\n std::vector<std::pair<long , long> > solutions ;\\n double i = 1.0 ;\\n while ( vampireNumbersFound < 25 ) {\\n long start = static_cast<long>( std::pow( 10 , i ) ) ;\\n long end = start * 10 ;\\n for ( long num = start ; num < end ; num++ ) {\\n\\t if ( isVampireNumber( num , solutions ) ) {\\n vampireNumbersFound++ ;\\n\\t std::cout << vampireNumbersFound << \\\" :\\\" << num << \\\" is a vampire number! These are the fangs:\\\\n\\\" ;\\n\\t std::for_each( solutions.begin( ) , solutions.end( ) , printOut ) ;\\n\\t std::cout << \\\"\\\\n_______________\\\" << std::endl ;\\n\\t solutions.clear( ) ;\\t\\n\\t if ( vampireNumbersFound == 25 )\\n\\t break ;\\n\\t }\\n }\\n i += 2.0 ;\\n }\\n std::vector<long> testnumbers ;\\n testnumbers.push_back( 16758243290880 ) ;\\n testnumbers.push_back( 24959017348650 ) ;\\n testnumbers.push_back( 14593825548650 ) ;\\n for ( std::vector<long>::const_iterator svl = testnumbers.begin( ) ;\\n\\t svl != testnumbers.end( ) ; svl++ ) {\\n if ( isVampireNumber( *svl , solutions ) ) {\\n\\t std::cout << *svl << \\\" is a vampire number! The fangs:\\\\n\\\" ;\\n\\t std::for_each( solutions.begin( ) , solutions.end( ) , printOut ) ;\\n\\t std::cout << std::endl ;\\n\\t solutions.clear( ) ;\\n } else {\\n\\t std::cout << *svl << \\\" is not a vampire number!\\\" << std::endl ;\\n }\\n }\\n return 0 ;\\n}\\n\",\n \"language\": \"C++\"\n },\n {\n \"code\": \"using System;\\n\\nnamespace RosettaVampireNumber\\n{\\n class Program\\n {\\n static void Main(string[] args)\\n {\\n int i, j, n;\\n ulong x;\\n var f = new ulong[16];\\n var bigs = new ulong[] { 16758243290880UL, 24959017348650UL, 14593825548650UL, 0 };\\n ulong[] tens = new ulong[20];\\n tens[0] = 1;\\n for (i = 1; i < 20; i++)\\n tens[i] = tens[i - 1] * 10;\\n\\n for (x = 1, n = 0; n < 25; x++)\\n {\\n if ((j = fangs(x, f, tens)) == 0) continue;\\n Console.Write(++n + \\\": \\\");\\n show_fangs(x, f, j);\\n }\\n\\n Console.WriteLine();\\n for (i = 0; bigs[i] > 0 ; i++)\\n {\\n if ((j = fangs(bigs[i], f, tens)) > 0)\\n show_fangs(bigs[i], f, j);\\n else\\n Console.WriteLine(bigs[i] + \\\" is not vampiric.\\\");\\n }\\n Console.ReadLine();\\n }\\n\\n private static void show_fangs(ulong x, ulong[] f, int cnt)\\n {\\n Console.Write(x);\\n int i;\\n for (i = 0; i < cnt; i++)\\n Console.Write(\\\" = \\\" + f[i] + \\\" * \\\" + (x / f[i]));\\n Console.WriteLine();\\n }\\n\\n private static int fangs(ulong x, ulong[] f, ulong[] tens)\\n {\\n int n = 0;\\n int nd = ndigits(x);\\n if ((nd & 1) > 0) return 0;\\n nd /= 2;\\n\\n ulong lo, hi;\\n lo = Math.Max(tens[nd - 1], (x + tens[nd] - 2) / (tens[nd] - 1));\\n hi = Math.Min(x / lo, (ulong) Math.Sqrt(x));\\n\\n ulong a, b, t = dtally(x);\\n for (a = lo; a <= hi; a++)\\n {\\n b = x / a;\\n if (a * b == x && ((a % 10) > 0 || (b % 10) > 0) && t == dtally(a) + dtally(b))\\n f[n++] = a;\\n }\\n\\n return n;\\n }\\n\\n private static ulong dtally(ulong x)\\n {\\n ulong t = 0;\\n while (x > 0)\\n {\\n t += 1UL << (int)((x % 10) * 6);\\n x /= 10;\\n }\\n\\n return t;\\n }\\n\\n private static int ndigits(ulong x)\\n {\\n int n = 0;\\n while (x > 0)\\n {\\n n++;\\n x /= 10;\\n }\\n return n;\\n }\\n }\\n}\\n\",\n \"language\": \"C-sharp\"\n },\n {\n \"code\": \"(defn factor-pairs [n]\\n (for [x (range 2 (Math/sqrt n))\\n :when (zero? (mod n x))]\\n [x (quot n x)]))\\n\\n(defn fangs [n]\\n (let [dlen (comp count str)\\n half (/ (dlen n) 2)\\n halves? #(apply = (cons half (map dlen %)))\\n digits #(sort (apply str %))]\\n (filter #(and (halves? %)\\n (= (sort (str n)) (digits %)))\\n (factor-pairs n))))\\n\\n(defn vampiric? [n]\\n (let [fangs (fangs n)]\\n (if (empty? fangs) nil [n fangs])))\\n\\n(doseq [n (take 25 (keep vampiric? (range)))]\\n (prn n))\\n\\n(doseq [n [16758243290880, 24959017348650, 14593825548650]]\\n (println (or (vampiric? n) (str n \\\" is not vampiric.\\\"))))\\n\",\n \"language\": \"Clojure\"\n },\n {\n \"code\": \"(defun trailing-zerop (number)\\n \\\"Is the lowest digit of `number' a 0\\\"\\n (zerop (rem number 10)))\\n\\n(defun integer-digits (integer)\\n \\\"Return the number of digits of the `integer'\\\"\\n (assert (integerp integer))\\n (length (write-to-string integer)))\\n\\n(defun paired-factors (number)\\n \\\"Return a list of pairs that are factors of `number'\\\"\\n (loop\\n :for candidate :from 2 :upto (sqrt number)\\n :when (zerop (mod number candidate))\\n :collect (list candidate (/ number candidate))))\\n\\n(defun vampirep (candidate &aux\\n (digits-of-candidate (integer-digits candidate))\\n (half-the-digits-of-candidate (/ digits-of-candidate\\n 2)))\\n \\\"Is the `candidate' a vampire number?\\\"\\n (remove-if #'(lambda (pair)\\n (> (length (remove-if #'null (mapcar #'trailing-zerop pair)))\\n 1))\\n (remove-if-not #'(lambda (pair)\\n (string= (sort (copy-seq (write-to-string candidate))\\n #'char<)\\n (sort (copy-seq (format nil \\\"~A~A\\\" (first pair) (second pair)))\\n #'char<)))\\n (remove-if-not #'(lambda (pair)\\n (and (eql (integer-digits (first pair))\\n half-the-digits-of-candidate)\\n (eql (integer-digits (second pair))\\n half-the-digits-of-candidate)))\\n (paired-factors candidate)))))\\n\\n(defun print-vampire (candidate fangs &optional (stream t))\\n (format stream\\n \\\"The number ~A is a vampire number with fangs: ~{ ~{~A~^, ~}~^; ~}~%\\\"\\n candidate\\n fangs))\\n\\n;; Print the first 25 vampire numbers\\n\\n(loop\\n :with count := 0\\n :for candidate :from 0\\n :until (eql count 25)\\n :for fangs := (vampirep candidate)\\n :do\\n (when fangs\\n (print-vampire candidate fangs)\\n (incf count)))\\n\\n;; Check if 16758243290880, 24959017348650, 14593825548650 are vampire numbers\\n\\n(dolist (candidate '(16758243290880 24959017348650 14593825548650))\\n (let ((fangs (vampirep candidate)))\\n (when fangs\\n (print-vampire candidate fangs))))\\n\",\n \"language\": \"Common-Lisp\"\n },\n {\n \"code\": \"import std.stdio, std.range, std.algorithm, std.typecons, std.conv;\\n\\nauto fangs(in long n) pure nothrow @safe {\\n auto pairs = iota(2, cast(int)(n ^^ 0.5)) // n.isqrt\\n .filter!(x => !(n % x)).map!(x => [x, n / x]);\\n enum dLen = (in long x) => x.text.length;\\n immutable half = dLen(n) / 2;\\n enum halvesQ = (long[] p) => p.all!(u => dLen(u) == half);\\n enum digits = (long[] p) => dtext(p[0], p[1]).dup.sort();\\n const dn = n.to!(dchar[]).sort();\\n return tuple(n, pairs.filter!(p => halvesQ(p) && dn == digits(p)));\\n}\\n\\nvoid main() {\\n foreach (v; int.max.iota.map!fangs.filter!q{ !a[1].empty }\\n .take(25).chain([16758243290880, 24959017348650,\\n 14593825548650].map!fangs))\\n writefln(\\\"%d: (%(%(%s %)) (%))\\\", v[]);\\n}\\n\",\n \"language\": \"D\"\n },\n {\n \"code\": \"import std.stdio, std.math, std.algorithm, std.array, std.traits;\\n\\nT[N] pows(T, size_t N)() pure nothrow @safe @nogc {\\n typeof(return) result;\\n result[0] = 1;\\n foreach (immutable i, ref r; result[1 .. $])\\n r = result[i] * 10;\\n return result;\\n}\\n\\n__gshared immutable tenPowsU = pows!(uint, 10);\\n__gshared immutable tenPowsUL = pows!(ulong, 20);\\n\\nsize_t nDigits(T)(in T x) pure nothrow @safe @nogc {\\n Unqual!T y = x;\\n size_t n = 0;\\n while (y) {\\n n++;\\n y /= 10;\\n }\\n return n;\\n}\\n\\nT dTally(T)(in T x) pure nothrow @safe @nogc {\\n Unqual!T y = x;\\n T t = 0;\\n while (y) {\\n t += 1 << ((y % 10) * 6);\\n y /= 10;\\n }\\n return t;\\n}\\n\\nT[] fangs(T)(in T x, T[] f)\\npure nothrow @safe @nogc if (is(T == uint) || is(T == ulong)) {\\n alias tenPows = Select!(is(T == ulong), tenPowsUL, tenPowsU);\\n\\n immutable nd0 = nDigits(x);\\n if (nd0 & 1)\\n return null;\\n immutable nd = nd0 / 2;\\n\\n immutable lo = max(tenPows[nd - 1],\\n (x + tenPows[nd] - 2) / (tenPows[nd] - 1));\\n immutable hi = min(x / lo, cast(T)sqrt(real(x)));\\n immutable t = x.dTally;\\n\\n size_t n = 0;\\n foreach (immutable a; lo .. hi + 1) {\\n immutable b = x / a;\\n if (a * b == x\\n && (a % 10 || b % 10)\\n && t == (a.dTally + b.dTally)) {\\n f[n] = a;\\n n++;\\n }\\n }\\n\\n return f[0 .. n];\\n}\\n\\nvoid showFangs(T)(in T x, in T[] fs) {\\n x.write;\\n foreach (immutable fi; fs)\\n writef(\\\" = %d x %d\\\", fi, x / fi);\\n writeln;\\n}\\n\\nvoid main() {\\n uint[16] fu;\\n for (uint x = 1, n = 0; n < 25; x++) {\\n const fs = fangs(x, fu);\\n if (fs.empty)\\n continue;\\n n++;\\n writef(\\\"%2d: \\\", n);\\n showFangs(x, fs);\\n }\\n writeln;\\n\\n static immutable ulong[3] bigs = [16_758_243_290_880UL,\\n 24_959_017_348_650UL,\\n 14_593_825_548_650UL];\\n ulong[fu.length] ful;\\n foreach (immutable bi; bigs) {\\n const fs = fangs(bi, ful);\\n if (fs.empty)\\n writeln(bi, \\\" is not vampiric\\\");\\n else\\n showFangs(bi, fs);\\n }\\n}\\n\",\n \"language\": \"D\"\n },\n {\n \"code\": \"func dtally x .\\n while x > 0\\n t += bitshift 1 (x mod 10 * 6)\\n x = x div 10\\n .\\n return t\\n.\\nproc fangs x . f[] .\\n f[] = [ ]\\n nd = floor log10 x + 1\\n if nd mod 2 = 1\\n return\\n .\\n nd = nd div 2\\n lo = higher pow 10 (nd - 1) (x + pow 10 nd - 2) div (pow 10 nd - 1)\\n hi = lower (x / lo) sqrt x\\n t = dtally x\\n for a = lo to hi\\n b = x div a\\n if a * b = x and (a mod 10 > 0 or b mod 10 > 0) and t = dtally a + dtally b\\n f[] &= a\\n .\\n .\\n.\\nproc show_fangs x f[] . .\\n write x & \\\" \\\"\\n for f in f[]\\n write \\\" = \\\" & f & \\\" x \\\" & x div f\\n .\\n print \\\"\\\"\\n.\\nx = 1\\nwhile n < 25\\n fangs x f[]\\n if len f[] > 0\\n n += 1\\n write n & \\\": \\\"\\n show_fangs x f[]\\n .\\n x += 1\\n.\\nbigs[] = [ 16758243290880 24959017348650 14593825548650 ]\\nfor x in bigs[]\\n fangs x f[]\\n if len f[] > 0\\n show_fangs x f[]\\n else\\n print x & \\\" is not vampiric\\\"\\n .\\n.\\n\",\n \"language\": \"EasyLang\"\n },\n {\n \"code\": \"class\\n\\tAPPLICATION\\n\\ncreate\\n\\tmake\\n\\nfeature\\n\\n\\tfang_check (original, fang1, fang2: INTEGER_64): BOOLEAN\\n\\t\\t\\t-- Are 'fang1' and 'fang2' correct fangs of the 'original' number?\\n\\t\\trequire\\n\\t\\t\\toriginal_positive: original > 0\\n\\t\\t\\tfangs_positive: fang1 > 0 and fang2 > 0\\n\\t\\tlocal\\n\\t\\t\\toriginal_length: INTEGER\\n\\t\\t\\tfang, ori: STRING\\n\\t\\t\\tsort_ori, sort_fang: SORTED_TWO_WAY_LIST [CHARACTER]\\n\\t\\tdo\\n\\t\\t\\tcreate sort_ori.make\\n\\t\\t\\tcreate sort_fang.make\\n\\t\\t\\tcreate ori.make_empty\\n\\t\\t\\tcreate fang.make_empty\\n\\t\\t\\toriginal_length := original.out.count // 2\\n\\t\\t\\tif fang1.out.count /= original_length or fang2.out.count /= (original_length) then\\n\\t\\t\\t\\tResult := False\\n\\t\\t\\telseif fang1.out.ends_with (\\\"0\\\") and fang2.out.ends_with (\\\"0\\\") then\\n\\t\\t\\t\\tResult := False\\n\\t\\t\\telse\\n\\t\\t\\t\\tacross\\n\\t\\t\\t\\t\\t1 |..| original.out.count as c\\n\\t\\t\\t\\tloop\\n\\t\\t\\t\\t\\tsort_ori.extend (original.out [c.item])\\n\\t\\t\\t\\tend\\n\\t\\t\\t\\tacross\\n\\t\\t\\t\\t\\tsort_ori as o\\n\\t\\t\\t\\tloop\\n\\t\\t\\t\\t\\tori.extend (o.item)\\n\\t\\t\\t\\tend\\n\\t\\t\\t\\tacross\\n\\t\\t\\t\\t\\t1 |..| fang1.out.count as c\\n\\t\\t\\t\\tloop\\n\\t\\t\\t\\t\\tsort_fang.extend (fang1.out [c.item])\\n\\t\\t\\t\\t\\tsort_fang.extend (fang2.out [c.item])\\n\\t\\t\\t\\tend\\n\\t\\t\\t\\tacross\\n\\t\\t\\t\\t\\tsort_fang as f\\n\\t\\t\\t\\tloop\\n\\t\\t\\t\\t\\tfang.extend (f.item)\\n\\t\\t\\t\\tend\\n\\t\\t\\t\\tResult := fang.same_string (ori)\\n\\t\\t\\tend\\n\\t\\tensure\\n\\t\\t\\tfangs_right_length: Result implies original.out.count = fang1.out.count + fang2.out.count\\n\\t\\tend\\n\\n\\tmake\\n -- Uses fang_check to find vampire nubmers.\\n\\t\\tlocal\\n\\t\\t\\ti, numbers: INTEGER\\n\\t\\t\\tfang1, fang2: INTEGER_64\\n\\t\\t\\tnum: ARRAY [INTEGER_64]\\n\\t\\t\\tmath: DOUBLE_MATH\\n\\t\\tdo\\n\\t\\t\\tcreate math\\n\\t\\t\\tfrom\\n\\t\\t\\t\\ti := 1000\\n\\t\\t\\tuntil\\n\\t\\t\\t\\tnumbers > 25\\n\\t\\t\\tloop\\n\\t\\t\\t\\tif i.out.count \\\\\\\\ 2 = 0 then\\n\\t\\t\\t\\t\\tfrom\\n\\t\\t\\t\\t\\t\\tfang1 := 10\\n\\t\\t\\t\\t\\tuntil\\n\\t\\t\\t\\t\\t\\tfang1 >= math.sqrt (i)\\n\\t\\t\\t\\t\\tloop\\n\\t\\t\\t\\t\\t\\tif (i \\\\\\\\ fang1 = 0) then\\n\\t\\t\\t\\t\\t\\t\\tfang2 := i // fang1\\n\\t\\t\\t\\t\\t\\t\\tif i \\\\\\\\ 9 = (fang1 + fang2) \\\\\\\\ 9 then\\n\\t\\t\\t\\t\\t\\t\\t\\tif fang1 * fang2 = i and fang1 <= fang2 and then fang_check (i, fang1, fang2) then\\n\\t\\t\\t\\t\\t\\t\\t\\t\\tnumbers := numbers + 1\\n\\t\\t\\t\\t\\t\\t\\t\\t\\tio.put_string (i.out + \\\": \\\" + fang1.out + \\\" \\\" + fang2.out)\\n\\t\\t\\t\\t\\t\\t\\t\\t\\tio.new_line\\n\\t\\t\\t\\t\\t\\t\\t\\tend\\n\\t\\t\\t\\t\\t\\t\\tend\\n\\t\\t\\t\\t\\t\\tend\\n\\t\\t\\t\\t\\t\\tfang1 := fang1 + 1\\n\\t\\t\\t\\t\\tend\\n\\t\\t\\t\\tend\\n\\t\\t\\t\\ti := i + 1\\n\\t\\t\\tend\\n\\t\\t\\tnum := <<16758243290880, 24959017348650, 14593825548650>>\\n\\t\\t\\tacross\\n\\t\\t\\t\\tnum as n\\n\\t\\t\\tloop\\n\\t\\t\\t\\tfrom\\n\\t\\t\\t\\t\\tfang1 := 1000000\\n\\t\\t\\t\\tuntil\\n\\t\\t\\t\\t\\tfang1 >= math.sqrt (n.item) + 1\\n\\t\\t\\t\\tloop\\n\\t\\t\\t\\t\\tif (n.item \\\\\\\\ fang1 = 0) then\\n\\t\\t\\t\\t\\t\\tfang2 := (n.item // fang1)\\n\\t\\t\\t\\t\\t\\tif fang1 * fang2 = n.item and fang1 <= fang2 and then fang_check (n.item, fang1, fang2) then\\n\\t\\t\\t\\t\\t\\t\\tio.put_string (n.item.out + \\\": \\\" + fang1.out + \\\" \\\" + fang2.out + \\\"%N\\\")\\n\\t\\t\\t\\t\\t\\tend\\n\\t\\t\\t\\t\\tend\\n\\t\\t\\t\\t\\tfang1 := fang1 + 1\\n\\t\\t\\t\\tend\\n\\t\\t\\tend\\n\\t\\tend\\n\\nend\\n\",\n \"language\": \"Eiffel\"\n },\n {\n \"code\": \"defmodule Vampire do\\n def factor_pairs(n) do\\n first = trunc(n / :math.pow(10, div(char_len(n), 2)))\\n last = :math.sqrt(n) |> round\\n for i <- first .. last, rem(n, i) == 0, do: {i, div(n, i)}\\n end\\n\\n def vampire_factors(n) do\\n if rem(char_len(n), 2) == 1 do\\n []\\n else\\n half = div(length(to_char_list(n)), 2)\\n sorted = Enum.sort(String.codepoints(\\\"#{n}\\\"))\\n Enum.filter(factor_pairs(n), fn {a, b} ->\\n char_len(a) == half && char_len(b) == half &&\\n Enum.count([a, b], fn x -> rem(x, 10) == 0 end) != 2 &&\\n Enum.sort(String.codepoints(\\\"#{a}#{b}\\\")) == sorted\\n end)\\n end\\n end\\n\\n defp char_len(n), do: length(to_char_list(n))\\n\\n def task do\\n Enum.reduce_while(Stream.iterate(1, &(&1+1)), 1, fn n, acc ->\\n case vampire_factors(n) do\\n [] -> {:cont, acc}\\n vf -> IO.puts \\\"#{n}:\\\\t#{inspect vf}\\\"\\n if acc < 25, do: {:cont, acc+1}, else: {:halt, acc+1}\\n end\\n end)\\n IO.puts \\\"\\\"\\n Enum.each([16758243290880, 24959017348650, 14593825548650], fn n ->\\n case vampire_factors(n) do\\n [] -> IO.puts \\\"#{n} is not a vampire number!\\\"\\n vf -> IO.puts \\\"#{n}:\\\\t#{inspect vf}\\\"\\n end\\n end)\\n end\\nend\\n\\nVampire.task\\n\",\n \"language\": \"Elixir\"\n },\n {\n \"code\": \"USING: combinators.short-circuit fry io kernel lists lists.lazy math\\nmath.combinatorics math.functions math.primes.factors math.statistics\\nmath.text.utils prettyprint sequences sets ;\\nIN: rosetta-code.vampire-number\\n\\n: digits ( n -- m )\\n log10 floor >integer 1 + ;\\n\\n: same-digits? ( n n1 n2 -- ? )\\n [ 1 digit-groups ] tri@ append [ histogram ] bi@ = ;\\n\\n: half-len-factors ( n -- seq )\\n [ divisors ] [ digits ] bi 2/ '[ digits _ = ] filter ;\\n\\n: same-digit-factors ( n -- seq )\\n dup half-len-factors 2 <combinations> [ first2 same-digits? ] with filter ;\\n\\n: under-two-trailing-zeros? ( seq -- ? )\\n [ 10 mod ] map [ 0 = ] count 2 < ;\\n\\n: tentative-fangs ( n -- seq )\\n same-digit-factors [ under-two-trailing-zeros? ] filter ;\\n\\n: fangs ( n -- seq )\\n [ tentative-fangs ] [ ] bi '[ product _ = ] filter ;\\n\\n: vampire? ( n -- ? )\\n { [ digits even? ] [ fangs empty? not ] } 1&& ;\\n\\n: first25 ( -- seq )\\n 25 0 lfrom [ vampire? ] lfilter ltake list>array ;\\n\\n: .vamp-with-fangs ( n -- )\\n [ pprint bl ] [ fangs [ pprint bl ] each ] bi nl ;\\n\\n: part1 ( -- )\\n first25 [ .vamp-with-fangs ] each ;\\n\\n: part2 ( -- ) { 16758243290880 24959017348650 14593825548650 }\\n [ dup vampire? [ .vamp-with-fangs ] [ drop ] if ] each ;\\n\\n: main ( -- ) part1 part2 ;\\n\\nMAIN: main\\n\",\n \"language\": \"Factor\"\n },\n {\n \"code\": \": sqrt ( u -- sqrt ) ( Babylonian method )\\n dup 2/ ( first square root guess is half )\\n dup 0= if drop exit then ( sqrt[0]=0, sqrt[1]=1 )\\n begin dup >r 2dup / r> + 2/ ( stack: square old-guess new-guess )\\n 2dup > while ( as long as guess is decreasing )\\n nip repeat ( forget old-guess and repeat )\\n drop nip ;\\n\\n: ndigits ( n -- n ) 10 / dup 0<> if recurse then 1+ ;\\n\\n: dtally ( n -- n )\\n 10 /mod\\n dup 0<> if recurse then\\n swap 6 * 1 swap lshift + ;\\n\\n: ?product ( x a b -- f ) * = ;\\n: ?dtally ( x a b -- f ) dtally rot dtally rot dtally rot + = ;\\n: ?ndigits ( a b -- f ) ndigits swap ndigits = ;\\n: ?0trail ( a b -- f ) 10 mod 0= swap 10 mod 0= and invert ;\\n\\n: ?fang ( x a -- f )\\n 2dup / 2>r\\n dup 2r@ ?product\\n swap 2r@ ?dtally and\\n 2r@ ?ndigits and\\n 2r> ?0trail and ;\\n\\n: next-fang ( n a -- false | a true )\\n over sqrt swap 1+ ?do\\n dup i ?fang if drop i true unloop exit then\\n loop drop false ;\\n\\n: ?vampire ( n -- false | a true ) 0 next-fang ;\\n\\n: next-vampire ( n -- n a ) begin 1+ dup ?vampire until ;\\n\\n: .product ( n a -- ) dup . .\\\" x \\\" / . .\\\" = \\\" ;\\n\\n: .vampire ( n a -- )\\n cr\\n begin 2dup .product\\n over swap next-fang\\n while repeat\\n . ;\\n\\n: .fangs ( n -- ) dup ?vampire if .vampire else cr . .\\\" is not vampiric.\\\" then ;\\n\\n: vampires ( n -- )\\n 1 swap\\n 0 do next-vampire over swap .vampire loop drop ;\\n\\n25 vampires\\n16758243290880 .fangs\\n24959017348650 .fangs\\n14593825548650 .fangs\\n\",\n \"language\": \"Forth\"\n },\n {\n \"code\": \"'Vampire numbers.\\n'FreeBASIC version 24. Windows\\n'Vampire.bas\\nFunction WithinString(n As Ulongint,f As Ulongint) As Integer\\n var m=Str(n),p=Str(f)\\n For z As Integer=0 To Len(p)-1\\n var i=Instr(m,Chr(p[z]))\\n If i Then\\n m=Mid(m,1,i-1)+Mid(m,i+1)\\n Else\\n Return 0\\n End If\\n Next z\\n Return -1\\nEnd Function\\n\\nSub AllFactors(N As Ulongint,factors() As Ulongint)\\n Dim As String Sn=Str(n)\\n Dim As Integer half=Len(sn)\\\\2\\n Redim factors(1 To 1)\\n #macro bsort(array)\\n For p1 As Integer = 1 To Ubound(array) - 1\\n For p2 As Integer = p1 + 1 To Ubound(array)\\n If array(p1)>array(p2) Then Swap array(p1),array(p2)\\n Next p2\\n Next p1\\n #endmacro\\n\\n Dim As Ulongint c\\n For i As Ulongint = 1 To Sqr(N)\\n If N Mod i=0 Then\\n If Len(Str(i))=half Then\\n If WithinString(N,i) Then\\n c=c+1\\n Redim Preserve factors(1 To c)\\n factors(c)=i\\n End If\\n End If\\n If N <> i*i Then\\n If Len(Str(n\\\\i))=half Then\\n If WithinString(N,n\\\\i) Then\\n c=c+1\\n Redim Preserve factors(1 To c)\\n factors(c)=n\\\\i\\n End If\\n End If\\n End If\\n End If\\n Next i\\n bsort(factors)\\nEnd Sub\\n\\nFunction VampireNumbers(N As Ulongint) As Integer\\n Dim As Integer flag\\n Dim As Ulongint LastFactor\\n Redim As Ulongint Factor()\\n AllFactors(N,Factor())\\n For p1 As Integer = 1 To Ubound(Factor)\\n For p2 As Integer=1 To Ubound(Factor)\\n If Factor(p1)*Factor(p2)=n Then\\n If Factor(p1) Mod 10<>0 Or Factor(p2) Mod 10 <>0 Then\\n If WithinString(n,valulng(Str(Factor(p1))+Str(Factor(p2)))) Then\\n If LastFactor=Factor(p2) Then Exit For,For\\n flag=1\\n Print n;\\\": [\\\";Factor(p1);\\\",\\\";Factor(p2);\\\"]\\\"\\n LastFactor=Factor(p1)\\n End If\\n End If\\n End If\\n Next p2\\n Next p1\\n If flag Then Return -1\\nEnd Function\\n\\n'============== IMPLEMENT ==============================\\nprint \\\"First 28 Vampire numbers\\\"\\nprint\\nPrint \\\"Number: [fangs]\\\"\\nPrint\\nDim As Ulongint n=1000\\nDim As Integer count\\nDim As Double t1,t2\\nt1=Timer\\nDo\\n n=n+1\\n Var s=Str(n)\\n If Len(s) Mod 2<>0 Then n=n*10\\n If vampireNumbers(n) Then count=count+1\\nLoop Until count=27\\nPrint\\nprint \\\"Individual tests:\\\"\\nprint\\n'individual tests\\nn=16758243290880ull\\nIf Not vampirenumbers(n) Then Print n;\\\": [returns no fangs]\\\"\\nPrint\\nn=24959017348650ull\\nIf Not vampirenumbers(n) Then Print n;\\\": [returns no fangs]\\\"\\nprint\\nn=14593825548650ull\\nIf Not vampirenumbers(n) then print n;\\\": [returns no fangs]\\\"\\nt2=Timer\\nprint\\nPrint \\\"Completed in \\\";\\nPrint t2-t1;\\\" Seconds\\\"\\nSleep\\n\",\n \"language\": \"FreeBASIC\"\n },\n {\n \"code\": \"package main\\n\\nimport (\\n \\\"fmt\\\"\\n \\\"math\\\"\\n)\\n\\nfunc max(a, b uint64) uint64 {\\n if a > b {\\n return a\\n }\\n return b\\n}\\n\\nfunc min(a, b uint64) uint64 {\\n if a < b {\\n return a\\n }\\n return b\\n}\\n\\nfunc ndigits(x uint64) (n int) {\\n for ; x > 0; x /= 10 {\\n n++\\n }\\n return\\n}\\n\\nfunc dtally(x uint64) (t uint64) {\\n for ; x > 0; x /= 10 {\\n t += 1 << (x % 10 * 6)\\n }\\n return\\n}\\n\\nvar tens [20]uint64\\n\\nfunc init() {\\n tens[0] = 1\\n for i := 1; i < 20; i++ {\\n tens[i] = tens[i-1] * 10\\n }\\n}\\n\\nfunc fangs(x uint64) (f []uint64) {\\n nd := ndigits(x)\\n if nd&1 == 1 {\\n return\\n }\\n nd /= 2\\n lo := max(tens[nd-1], (x+tens[nd]-2)/(tens[nd]-1))\\n hi := min(x/lo, uint64(math.Sqrt(float64(x))))\\n t := dtally(x)\\n for a := lo; a <= hi; a++ {\\n b := x / a\\n if a*b == x &&\\n (a%10 > 0 || b%10 > 0) &&\\n t == dtally(a)+dtally(b) {\\n f = append(f, a)\\n }\\n }\\n return\\n}\\n\\nfunc showFangs(x uint64, f []uint64) {\\n fmt.Print(x)\\n if len(f) > 1 {\\n fmt.Println()\\n }\\n for _, a := range f {\\n fmt.Println(\\\" =\\\", a, \\\"×\\\", x/a)\\n }\\n}\\n\\nfunc main() {\\n for x, n := uint64(1), 0; n < 26; x++ {\\n if f := fangs(x); len(f) > 0 {\\n n++\\n fmt.Printf(\\\"%2d: \\\", n)\\n showFangs(x, f)\\n }\\n }\\n fmt.Println()\\n for _, x := range []uint64{16758243290880, 24959017348650, 14593825548650} {\\n if f := fangs(x); len(f) > 0 {\\n showFangs(x, f)\\n } else {\\n fmt.Println(x, \\\"is not vampiric\\\")\\n }\\n }\\n}\\n\",\n \"language\": \"Go\"\n },\n {\n \"code\": \"import Data.List (sort)\\nimport Control.Arrow ((&&&))\\n\\n-- VAMPIRE NUMBERS ------------------------------------------------------------\\nvampires :: [Int]\\nvampires = filter (not . null . fangs) [1 ..]\\n\\nfangs :: Int -> [(Int, Int)]\\nfangs n\\n | odd w = []\\n | otherwise = ((,) <*> quot n) <$> filter isfang (integerFactors n)\\n where\\n ndigit :: Int -> Int\\n ndigit 0 = 0\\n ndigit n = 1 + ndigit (quot n 10)\\n w = ndigit n\\n xmin = 10 ^ (quot w 2 - 1)\\n xmax = xmin * 10\\n isfang x =\\n x > xmin &&\\n x < y &&\\n y < xmax && -- same length\\n (quot x 10 /= 0 || quot y 10 /= 0) && -- not zero-ended\\n sort (show n) == sort (show x ++ show y)\\n where\\n y = quot n x\\n\\n-- FACTORS --------------------------------------------------------------------\\nintegerFactors :: Int -> [Int]\\nintegerFactors n\\n | n < 1 = []\\n | otherwise =\\n lows ++\\n (quot n <$>\\n (if intSquared == n -- A perfect square,\\n then tail -- and cofactor of square root would be redundant.\\n else id)\\n (reverse lows))\\n where\\n (intSquared, lows) =\\n (^ 2) &&& (filter ((0 ==) . rem n) . enumFromTo 1) $\\n floor (sqrt $ fromIntegral n)\\n\\n-- TEST -----------------------------------------------------------------------\\nmain :: IO [()]\\nmain =\\n mapM\\n (print . ((,) <*>) fangs)\\n (take 25 vampires ++ [16758243290880, 24959017348650, 14593825548650])\\n\",\n \"language\": \"Haskell\"\n },\n {\n \"code\": \"procedure main()\\n write(\\\"First 25 vampire numbers and their fangs:\\\")\\n every fangs := vampire(n := seq())\\\\25 do write(right(n,20),\\\":\\\",fangs)\\n write(\\\"\\\\nOther numbers:\\\")\\n every n := 16758243290880 | 24959017348650 | 14593825548650 do\\n write(right(n,20),\\\": \\\",vampire(n)|\\\"toothless\\\")\\nend\\n\\nprocedure vampire(n)\\n ns := string(n)\\n if *ns % 2 = 1 then fail\\n every (fangs := \\\"\\\") ||:= \\\" \\\"||fangCheck(n, *ns/2, f1 := 2 to integer(sqrt(n)), n/f1)\\n if *fangs > 0 then return fangs\\nend\\n\\nprocedure fangCheck(n, n2, f1, f2)\\n if f1*f2 ~= n then fail\\n if n2 ~= *(f1|f2) then fail\\n if (f1|f2) % 10 ~= 0 then\\n if csort(f1||f2) == csort(n) then return \\\"(\\\"||f1||\\\",\\\"||f2||\\\")\\\"\\nend\\n\\nprocedure csort(s) # Adapted from csort(s) in Icon IPL\\n every (s1 := \\\"\\\", c := !cset(s)) do every find(c, s) do s1 ||:= c\\n return s1\\nend\\n\",\n \"language\": \"Icon\"\n },\n {\n \"code\": \"Filter=: (#~`)(`:6)\\nodd =: 2&|\\neven =: -.@:odd\\nfactors =: [: ([: /:~ [: */\\\"1 ([: x: [) ^\\\"1 [: > [: , [: { [: <@:i.@>: ])/ __ q: ]\\ndigits =: 10&(#.inv)\\ntally =: # : [:\\nhalf =: -: : [:\\neven_number_of_digits =: even@:tally@:digits\\nsame_digits =: digits@:[ -:&(/:~) ,&digits/@:]\\nassert 1 -: 1234 same_digits 23 14\\nassert 0 -: 1234 same_digits 23 140\\nhalf_the_digits =: (half@:tally@:digits@:[ = tally@:digits&>@:]) # ]\\nfactors_with_half_the_digits =: half_the_digits factors\\nlarge =: (> <.@:%:)~ # ]\\ncandidates =: large factors_with_half_the_digits\\none_trailing_zero_permitted =: (0 < [: tally 0 -.~ 10&|)\\\"1 Filter\\npairs =: (% ,. ]) one_trailing_zero_permitted@:candidates\\nfangs =: (same_digits\\\"0 1 # ]) pairs\\n\\n A=:(0 2 -.@:-: $)&>Filter<@fangs\\\"0]1000+i.1e4\\n B=:(0 2 -.@:-: $)&>Filter<@fangs\\\"0]100000+i.25501\\n (,: */@:{.&.>)A,B\\n┌─────┬─────┬─────┬─────┬─────┬─────┬─────┬───────┬───────┬───────┬───────┬───────┬───────┬───────┬───────┬───────┬───────┬───────┬───────┬───────┬───────┬───────┬───────┬───────┬───────┐\\n│21 60│15 93│35 41│30 51│21 87│27 81│80 86│201 510│260 401│210 501│204 516│150 705│135 801│158 701│152 761│161 725│167 701│141 840│201 600│231 534│281 443│152 824│231 543│246 510│251 500│\\n│ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │204 615│ │\\n├─────┼─────┼─────┼─────┼─────┼─────┼─────┼───────┼───────┼───────┼───────┼───────┼───────┼───────┼───────┼───────┼───────┼───────┼───────┼───────┼───────┼───────┼───────┼───────┼───────┤\\n│1260 │1395 │1435 │1530 │1827 │2187 │6880 │102510 │104260 │105210 │105264 │105750 │108135 │110758 │115672 │116725 │117067 │118440 │120600 │123354 │124483 │125248 │125433 │125460 │125500 │\\n└─────┴─────┴─────┴─────┴─────┴─────┴─────┴───────┴───────┴───────┴───────┴───────┴───────┴───────┴───────┴───────┴───────┴───────┴───────┴───────┴───────┴───────┴───────┴───────┴───────┘\\n\\n <@fangs\\\"0[] 16758243290880 24959017348650 14593825548650\\n┌───────────────┬───────────────┬──┐\\n│2817360 5948208│4230765 5899410│ │\\n│2751840 6089832│4129587 6043950│ │\\n│2123856 7890480│4125870 6049395│ │\\n│1982736 8452080│2949705 8461530│ │\\n│ │2947050 8469153│ │\\n└───────────────┴───────────────┴──┘\\n\\n fangs f. NB. <laugh>\\n((10&(#.^:_1)@:[ -:&(/:~) ,&(10&(#.^:_1))/@:])\\\"0 1 # ]) ((% ,. ]) (#~ (0 < [: # :[: 0 -.~ 10&|)\\\"1)@:(((> <.@:%:)~ # ]) (((-: :[:@:(# :[:)@:(10&(#.^:_1))@:[ = # :[:@:(10&(#.^:_1))&>@:]) # ]) ([: ([: /:~ [: */\\\"1 ([: x: [) ^\\\"1 [: > [: , [: { [: <@:i.@>: ])/ __ q: ]))))\\n\",\n \"language\": \"J\"\n },\n {\n \"code\": \"import java.util.Arrays;\\nimport java.util.HashSet;\\n\\npublic class VampireNumbers{\\n private static int numDigits(long num){\\n return Long.toString(Math.abs(num)).length();\\n }\\n\\n private static boolean fangCheck(long orig, long fang1, long fang2){\\n if(Long.toString(fang1).endsWith(\\\"0\\\") && Long.toString(fang2).endsWith(\\\"0\\\")) return false;\\n\\n int origLen = numDigits(orig);\\n if(numDigits(fang1) != origLen / 2 || numDigits(fang2) != origLen / 2) return false;\\n\\n byte[] origBytes = Long.toString(orig).getBytes();\\n byte[] fangBytes = (Long.toString(fang1) + Long.toString(fang2)).getBytes();\\n Arrays.sort(origBytes);\\n Arrays.sort(fangBytes);\\n return Arrays.equals(origBytes, fangBytes);\\n }\\n\\n public static void main(String[] args){\\n HashSet<Long> vamps = new HashSet<Long>();\\n for(long i = 10; vamps.size() <= 25; i++ ){\\n if((numDigits(i) % 2) != 0) {i = i * 10 - 1; continue;}\\n for(long fang1 = 2; fang1 <= Math.sqrt(i) + 1; fang1++){\\n if(i % fang1 == 0){\\n long fang2 = i / fang1;\\n if(fangCheck(i, fang1, fang2) && fang1 <= fang2){\\n vamps.add(i);\\n System.out.println(i + \\\": [\\\" + fang1 + \\\", \\\" + fang2 +\\\"]\\\");\\n }\\n }\\n }\\n }\\n Long[] nums = {16758243290880L, 24959017348650L, 14593825548650L};\\n for(Long i : nums){\\n for(long fang1 = 2; fang1 <= Math.sqrt(i) + 1; fang1++){\\n if(i % fang1 == 0){\\n long fang2 = i / fang1;\\n if(fangCheck(i, fang1, fang2) && fang1 <= fang2){\\n System.out.println(i + \\\": [\\\" + fang1 + \\\", \\\" + fang2 +\\\"]\\\");\\n }\\n }\\n }\\n }\\n }\\n}\\n\",\n \"language\": \"Java\"\n },\n {\n \"code\": \"public class VampireNumber {\\n\\n public static void main(String args[]) {\\n\\n // scan only the ranges that have an even number of digits\\n // for instance: 10 .. 99, 1000 .. 9999 etc\\n long countVamps = 0, start = 10, tens = 10;\\n outer:\\n for (int numDigits = 2; numDigits <= 18; numDigits += 2) {\\n long end = start * 10;\\n for (long i = start; i < end; i++) {\\n if (countFangs(i, tens) > 0) {\\n if (++countVamps >= 26)\\n break outer;\\n }\\n }\\n start *= 100;\\n tens *= 10;\\n }\\n System.out.println();\\n\\n long[] bigs = {16758243290880L, 24959017348650L,\\n 14593825548650L};\\n\\n for (long b : bigs)\\n countFangs(b, 10000000L);\\n }\\n\\n private static int countFangs(long n, long tens) {\\n int countFangs = 0;\\n\\n // limit the search space for factors (as in C example)\\n long lo = Math.max(tens / 10, (n + tens - 2) / (tens - 1));\\n long hi = Math.min(n / lo, (long) Math.sqrt(n));\\n\\n long nTally = tallyDigits(n);\\n\\n for (long a = lo; a <= hi; a++) {\\n long b = n / a;\\n\\n if (a * b != n)\\n continue;\\n\\n // check for mod 9 congruence\\n if (n % 9 != (a + b) % 9)\\n continue;\\n\\n if (a % 10 == 0 && b % 10 == 0)\\n continue;\\n\\n if (nTally == tallyDigits(a) + tallyDigits(b)) {\\n if (countFangs == 0)\\n System.out.printf(\\\"\\\\n%d : \\\", n);\\n System.out.printf(\\\"[%d, %d]\\\", a, b);\\n countFangs++;\\n }\\n }\\n return countFangs;\\n }\\n\\n // sum to a unique number to represent set of digits (as in C example)\\n private static long tallyDigits(long n) {\\n long total = 0;\\n while (n > 0) {\\n total += 1L << ((n % 10) * 6);\\n n /= 10;\\n }\\n return total;\\n }\\n}\\n\",\n \"language\": \"Java\"\n },\n {\n \"code\": \"def count(s): reduce s as $x (0; .+1);\\n\\n# To take advantage of gojq's arbitrary-precision integer arithmetic:\\ndef power($b): . as $in | reduce range(0;$b) as $i (1; . * $in);\\n\\n# Output: a possibly empty array of pairs\\ndef factor_pairs:\\n . as $n\\n | ($n / (10 | power($n|tostring|length / 2) - 1)) as $first\\n | [range($first|floor; 1 + ($n | sqrt)) | select(($n % .) == 0) | [., $n / .] ] ;\\n\\n# Output: a stream\\ndef vampire_factors:\\n def es: tostring|explode;\\n . as $n\\n | tostring as $s\\n | ($s|length) as $nlen\\n | if ($nlen % 2) == 1 then []\\n else ($nlen / 2 ) as $half\\n | [factor_pairs[]\\n | select(. as [$a, $b]\\n | ($a|tostring|length) == $half and ($b|tostring|length) == $half\\n and count($a, $b | select(.%10 == 0)) != 2\\n and ((($a|es) + ($b|es)) | sort) == ($n|es|sort) ) ]\\n end ;\\n\\ndef task1($n):\\n limit($n; range(1; infinite)\\n | . as $i\\n | vampire_factors\\n | select(length>0)\\n | \\\"\\\\($i):\\\\t\\\\(.)\\\" );\\n\\ndef task2:\\n 16758243290880, 24959017348650, 14593825548650\\n | vampire_factors as $vf\\n | if $vf|length == 0\\n then \\\"\\\\(.) is not a vampire number!\\\"\\n else \\\"\\\\(.):\\\\t\\\\($vf)\\\"\\n end;\\n\\ntask1(25),\\n\\\"\\\",\\ntask2\\n\",\n \"language\": \"Jq\"\n },\n {\n \"code\": \"function divisors{T<:Integer}(n::T)\\n !isprime(n) || return [one(T), n]\\n d = [one(T)]\\n for (k, v) in factor(n)\\n e = T[k^i for i in 1:v]\\n append!(d, vec([i*j for i in d, j in e]))\\n end\\n sort(d)\\nend\\n\\nfunction vampirefangs{T<:Integer}(n::T)\\n fangs = T[]\\n isvampire = false\\n vdcnt = ndigits(n)\\n fdcnt = vdcnt>>1\\n iseven(vdcnt) || return (isvampire, fangs)\\n !isprime(n) || return (isvampire, fangs)\\n vdigs = sort(digits(n))\\n d = divisors(n)\\n len = length(d)\\n len = iseven(len) ? len>>1 : len>>1 + 1\\n for f in d[1:len]\\n ndigits(f) == fdcnt || continue\\n g = div(n, f)\\n f%10!=0 || g%10!=0 || continue\\n sort([digits(f), digits(g)]) == vdigs || continue\\n isvampire = true\\n append!(fangs, [f, g])\\n end\\n if isvampire\\n fangs = reshape(fangs, (2,length(fangs)>>1))'\\n end\\n return (isvampire, fangs)\\nend\\n\",\n \"language\": \"Julia\"\n },\n {\n \"code\": \"using Printf\\n\\nfunction showvampire{T<:Integer}(i::T, n::T, fangs::Array{T,2})\\n s = @sprintf \\\"%6d %14d %s\\\\n\\\" i n join(fangs[1,:], \\\"\\\\u00d7\\\")\\n for i in 2:size(fangs)[1]\\n s *= \\\" \\\"^23*join(fangs[i,:], \\\"\\\\u00d7\\\")*\\\"\\\\n\\\"\\n end\\n return s\\nend\\n\\nvgoal = 25\\nvcnt = 0\\ndcnt = 0\\nprintln(\\\"Finding the first \\\", vgoal, \\\" vampire numbers.\\\")\\nprintln(\\\" N Vampire Fangs\\\")\\nwhile vcnt < vgoal\\n dcnt += 2\\n for i in (10^(dcnt-1)):(10^dcnt-1)\\n (isvampire, fangs) = vampirefangs(i)\\n isvampire || continue\\n vcnt += 1\\n print(showvampire(vcnt, i, fangs))\\n vcnt < vgoal || break\\n end\\nend\\n\\ntest = [16758243290880, 24959017348650, 14593825548650]\\nprintln()\\nprintln(\\\"Checking a few numbers.\\\")\\nprintln(\\\" N Vampire Fangs\\\")\\nfor (i, v) in enumerate(test)\\n (isvampire, fangs) = vampirefangs(v)\\n if isvampire\\n print(showvampire(i, v, fangs))\\n else\\n println(@sprintf \\\"%6d %14d is not a vampire\\\" i v)\\n end\\nend\\n\",\n \"language\": \"Julia\"\n },\n {\n \"code\": \"// version 1.1\\n\\ndata class Fangs(val fang1: Long = 0L, val fang2: Long = 0L)\\n\\nfun pow10(n: Int): Long = when {\\n n < 0 -> throw IllegalArgumentException(\\\"Can't be negative\\\")\\n else -> {\\n var pow = 1L\\n for (i in 1..n) pow *= 10L\\n pow\\n }\\n}\\n\\nfun countDigits(n: Long): Int = when {\\n n < 0L -> throw IllegalArgumentException(\\\"Can't be negative\\\")\\n n == 0L -> 1\\n else -> {\\n var count = 0\\n var nn = n\\n while (nn > 0L) {\\n count++\\n nn /= 10L\\n }\\n count\\n }\\n}\\n\\nfun hasTrailingZero(n: Long): Boolean = when {\\n n < 0L -> throw IllegalArgumentException(\\\"Can't be negative\\\")\\n else -> n % 10L == 0L\\n}\\n\\nfun sortedString(s: String): String {\\n val ca = s.toCharArray()\\n ca.sort()\\n return String(ca)\\n}\\n\\nfun isVampiric(n: Long, fl: MutableList<Fangs>): Boolean {\\n if (n < 0L) return false\\n val len = countDigits(n)\\n if (len % 2L == 1L) return false\\n val hlen = len / 2\\n val first = pow10(hlen - 1)\\n val last = 10L * first\\n var j: Long\\n var cd: Int\\n val ss = sortedString(n.toString())\\n for (i in first until last) {\\n if (n % i != 0L) continue\\n j = n / i\\n if (j < i) return fl.size > 0\\n cd = countDigits(j)\\n if (cd > hlen) continue\\n if (cd < hlen) return fl.size > 0\\n if (ss != sortedString(i.toString() + j.toString())) continue\\n if (!(hasTrailingZero(i) && hasTrailingZero(j))) {\\n fl.add(Fangs(i, j))\\n }\\n }\\n return fl.size > 0\\n}\\n\\nfun showFangs(fangsList: MutableList<Fangs>): String {\\n var s = \\\"\\\"\\n for ((fang1, fang2) in fangsList) {\\n s += \\\" = $fang1 x $fang2\\\"\\n }\\n return s\\n}\\n\\nfun main(args: Array<String>) {\\n println(\\\"The first 25 vampire numbers and their fangs are:\\\")\\n var count = 0\\n var n: Long = 0\\n val fl = mutableListOf<Fangs>()\\n while (true) {\\n if (isVampiric(n, fl)) {\\n count++\\n println(\\\"${\\\"%2d\\\".format(count)} : $n\\\\t${showFangs(fl)}\\\")\\n fl.clear()\\n if (count == 25) break\\n }\\n n++\\n }\\n println()\\n val va = longArrayOf(16758243290880L, 24959017348650L, 14593825548650L)\\n for (v in va) {\\n if (isVampiric(v, fl)) {\\n println(\\\"$v\\\\t${showFangs(fl)}\\\")\\n fl.clear()\\n } else {\\n println(\\\"$v\\\\t = not vampiric\\\")\\n }\\n }\\n}\\n\",\n \"language\": \"Kotlin\"\n },\n {\n \"code\": \"ClearAll[VampireQ]\\nVampireQ[num_Integer] := Module[{poss, divs},\\n divs = Select[Divisors[num], # <= Sqrt[num] &];\\n poss = {#, num/#} & /@ divs;\\n If[Length[poss] > 0,\\n poss = Select[poss, Mod[#, 10] =!= {0, 0} &];\\n If[Length[poss] > 0,\\n poss = Select[poss, Length[IntegerDigits[First[#]]] == Length[IntegerDigits[Last[#]]] &];\\n If[Length[poss] > 0,\\n poss = Select[poss, Sort[IntegerDigits[num]] == Sort[Join @@ (IntegerDigits /@ #)] &];\\n If[Length[poss] > 0\\n ,\\n Sow[{num, poss}];\\n True\\n ,\\n False\\n ]\\n ,\\n False\\n ]\\n ,\\n False\\n ]\\n ,\\n False\\n ]\\n]\\n\",\n \"language\": \"Mathematica\"\n },\n {\n \"code\": \"Reap[Scan[VampireQ,Range[126027]]][[2,1]]//Grid\\nReap[VampireQ[#]] & /@ {16758243290880, 24959017348650, 14593825548650} // Grid\\n\",\n \"language\": \"Mathematica\"\n },\n {\n \"code\": \"import algorithm, math, sequtils, strformat, strutils, sugar\\n\\nconst Pow10 = collect(newSeq, for n in 0..18: 10 ^ n)\\n\\ntemplate isOdd(n: int): bool = (n and 1) != 0\\n\\nproc fangs(n: Positive): seq[(int, int)] =\\n ## Return the list fo fangs of \\\"n\\\" (empty if \\\"n\\\" is not vampiric).\\n let nDigits = sorted($n)\\n if nDigits.len.isOdd: return @[]\\n let fangLen = nDigits.len div 2\\n let inf = Pow10[fangLen - 1]\\n let sup = inf * 10 - 1\\n for d in inf..sup:\\n if n mod d != 0: continue\\n let q = n div d\\n if q < d: return\\n let dDigits = $d\\n let qDigits = $q\\n if qDigits.len > fangLen: continue\\n if qDigits.len < fangLen: return\\n if nDigits != sorted(dDigits & qDigits): continue\\n if dDigits[^1] != '0' or qDigits[^1] != '0':\\n # Finally, \\\"n\\\" is vampiric. Add the fangs to the result.\\n result.add (d, q)\\n\\n\\necho \\\"First 25 vampire numbers with their fangs:\\\"\\nvar count = 0\\nvar n = 10\\nvar limit = 100\\nwhile count != 25:\\n let fangList = n.fangs\\n if fangList.len != 0:\\n inc count\\n echo &\\\"{count:2}: {n:>6} = \\\", fangList.mapIt(&\\\"{it[0]:3} × {it[1]:3}\\\").join(\\\" = \\\")\\n inc n\\n if n == limit:\\n n *= 10\\n limit *= 10\\n\\necho()\\nfor n in [16_758_243_290_880, 24_959_017_348_650, 14_593_825_548_650]:\\n let fangList = n.fangs\\n if fangList.len == 0:\\n echo &\\\"{n} is not vampiric.\\\"\\n else:\\n echo &\\\"{n} = \\\", fangList.mapIt(&\\\"{it[0]} × {it[1]}\\\").join(\\\" = \\\")\\n\",\n \"language\": \"Nim\"\n },\n {\n \"code\": \"fang(n)=my(v=digits(n),u=List());if(#v%2,return([]));fordiv(n,d,if(#Str(d)==#v/2 && #Str(n/d)==#v/2 && vecsort(v)==vecsort(concat(digits(d),digits(n/d))) && (d%10 || (n/d)%10), if(d^2>n,return(Vec(u))); listput(u, d))); Vec(u)\\nk=25;forstep(d=4,6,2,for(n=10^(d-1),10^d-1,f=fang(n); for(i=1,#f,print(n\\\" \\\"f[i]\\\" \\\"n/f[i]); if(i==#f && k--==0,return))))\\nprint();v=[16758243290880, 24959017348650, 14593825548650];\\nfor(i=1,#v,f=fang(v[i]); for(j=1,#f, print(v[i]\\\" \\\"f[j]\\\" \\\"v[i]/f[j])))\\n\",\n \"language\": \"PARI-GP\"\n },\n {\n \"code\": \"#!/usr/bin/perl\\nuse warnings;\\nuse strict;\\nuse feature qw(say);\\n\\nsub fangs {\\n my $vampire = shift;\\n my $length = length 0 + $vampire;\\n return if $length % 2;\\n my $fang_length = $length / 2;\\n my $from = '1' . '0' x ($fang_length - 1);\\n my $to = '9' x $fang_length;\\n my $sorted = join q(), sort split //, $vampire;\\n my @fangs;\\n for my $f1 ($from .. 1 + sqrt $vampire) {\\n next if $vampire % $f1;\\n my $f2 = $vampire / $f1;\\n next if $sorted ne join q(), sort split //, $f1 . $f2;\\n next if 2 == grep '0' eq substr($_, -1 , 1), $f1, $f2; # Needed for the 26th number.\\n push @fangs, [$f1, $f2];\\n }\\n return @fangs;\\n}\\n\\nmy $count = 0;\\nmy $i = 9;\\nwhile ($count < 25) {\\n $i++;\\n my @f = fangs($i);\\n $count++, say join ' ', \\\"$count. $i:\\\", map \\\"[@$_]\\\", @f if @f;\\n}\\n\\nsay join ' ', $_, map \\\"[@$_]\\\", fangs($_) for 16758243290880, 24959017348650, 14593825548650;\\n\",\n \"language\": \"Perl\"\n },\n {\n \"code\": \"use ntheory qw(sqrtint logint divisors);\\n\\nsub is_vampire {\\n my ($n) = @_;\\n\\n return if (length($n) % 2 or $n < 0);\\n\\n my $l1 = 10**logint(sqrtint($n), 10);\\n my $l2 = sqrtint($n);\\n\\n my $s = join('', sort split(//, $n));\\n\\n my @fangs;\\n\\n foreach my $d (divisors($n)) {\\n\\n $d < $l1 and next;\\n $d > $l2 and last;\\n\\n my $t = $n / $d;\\n\\n next if ($d % 10 == 0 and $t % 10 == 0);\\n next if (join('', sort split(//, \\\"$d$t\\\")) ne $s);\\n\\n push @fangs, [$d, $t];\\n }\\n\\n return @fangs;\\n}\\n\\nprint \\\"First 25 Vampire Numbers:\\\\n\\\";\\n\\nfor (my ($n, $i) = (1, 1) ; $i <= 25 ; ++$n) {\\n if (my @fangs = is_vampire($n)) {\\n printf(\\\"%2d. %6s : %s\\\\n\\\", $i++, $n, join(' ', map { \\\"[@$_]\\\" } @fangs));\\n }\\n}\\n\\nprint \\\"\\\\nIndividual tests:\\\\n\\\";\\n\\nforeach my $n (16758243290880, 24959017348650, 14593825548650) {\\n my @fangs = is_vampire($n);\\n print(\\\"$n: \\\", (@fangs ? join(' ', map { \\\"[@$_]\\\" } @fangs)\\n : \\\"is not a vampire number\\\"), \\\"\\\\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: #7060A8;\\\">requires</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #008000;\\\">\\\"1.0.2\\\"</span><span style=\\\"color: #0000FF;\\\">)</span> <span style=\\\"color: #000080;font-style:italic;\\\">-- (for in)</span>\\n <span style=\\\"color: #008080;\\\">function</span> <span style=\\\"color: #000000;\\\">vampire</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #004080;\\\">atom</span> <span style=\\\"color: #000000;\\\">v</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #004080;\\\">sequence</span> <span style=\\\"color: #000000;\\\">res</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #0000FF;\\\">{}</span>\\n <span style=\\\"color: #008080;\\\">if</span> <span style=\\\"color: #000000;\\\">v</span><span style=\\\"color: #0000FF;\\\">>=</span><span style=\\\"color: #000000;\\\">0</span> <span style=\\\"color: #008080;\\\">then</span>\\n <span style=\\\"color: #004080;\\\">string</span> <span style=\\\"color: #000000;\\\">vs</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;\\\">v</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #008080;\\\">if</span> <span style=\\\"color: #7060A8;\\\">mod</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #7060A8;\\\">length</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">vs</span><span style=\\\"color: #0000FF;\\\">),</span><span style=\\\"color: #000000;\\\">2</span><span style=\\\"color: #0000FF;\\\">)=</span><span style=\\\"color: #000000;\\\">0</span> <span style=\\\"color: #008080;\\\">then</span> <span style=\\\"color: #000080;font-style:italic;\\\">-- even length</span>\\n <span style=\\\"color: #000000;\\\">vs</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">sort</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">vs</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;\\\">power</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">10</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #7060A8;\\\">length</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">vs</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: #008080;\\\">to</span> <span style=\\\"color: #7060A8;\\\">floor</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #7060A8;\\\">sqrt</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">v</span><span style=\\\"color: #0000FF;\\\">))</span> <span style=\\\"color: #008080;\\\">do</span>\\n <span style=\\\"color: #008080;\\\">if</span> <span style=\\\"color: #7060A8;\\\">remainder</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">v</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">i</span><span style=\\\"color: #0000FF;\\\">)=</span><span style=\\\"color: #000000;\\\">0</span> <span style=\\\"color: #008080;\\\">then</span>\\n <span style=\\\"color: #004080;\\\">integer</span> <span style=\\\"color: #000000;\\\">i2</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">v</span><span style=\\\"color: #0000FF;\\\">/</span><span style=\\\"color: #000000;\\\">i</span>\\n <span style=\\\"color: #004080;\\\">string</span> <span style=\\\"color: #000000;\\\">si</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;\\\">i</span><span style=\\\"color: #0000FF;\\\">),</span>\\n <span style=\\\"color: #000000;\\\">s2</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;\\\">i2</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #008080;\\\">if</span> <span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">si</span><span style=\\\"color: #0000FF;\\\">[$]!=</span><span style=\\\"color: #008000;\\\">'0'</span> <span style=\\\"color: #008080;\\\">or</span> <span style=\\\"color: #000000;\\\">s2</span><span style=\\\"color: #0000FF;\\\">[$]!=</span><span style=\\\"color: #008000;\\\">'0'</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #008080;\\\">and</span> <span style=\\\"color: #7060A8;\\\">sort</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">si</span><span style=\\\"color: #0000FF;\\\">&</span><span style=\\\"color: #000000;\\\">s2</span><span style=\\\"color: #0000FF;\\\">)=</span><span style=\\\"color: #000000;\\\">vs</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;\\\">i</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">i2</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;\\\">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;\\\">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: #004080;\\\">integer</span> <span style=\\\"color: #000000;\\\">found</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">0</span>\\n <span style=\\\"color: #004080;\\\">atom</span> <span style=\\\"color: #000000;\\\">i</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">0</span>\\n <span style=\\\"color: #004080;\\\">sequence</span> <span style=\\\"color: #000000;\\\">res</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;\\\">\\\"The first 26 vampire numbers and their fangs:\\\\n\\\"</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #008080;\\\">while</span> <span style=\\\"color: #000000;\\\">found</span><span style=\\\"color: #0000FF;\\\"><</span><span style=\\\"color: #000000;\\\">26</span> <span style=\\\"color: #008080;\\\">do</span>\\n <span style=\\\"color: #000000;\\\">res</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">vampire</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;\\\">res</span><span style=\\\"color: #0000FF;\\\">)</span> <span style=\\\"color: #008080;\\\">then</span>\\n <span style=\\\"color: #000000;\\\">found</span> <span style=\\\"color: #0000FF;\\\">+=</span> <span style=\\\"color: #000000;\\\">1</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: %d: %v\\\\n\\\"</span><span style=\\\"color: #0000FF;\\\">,{</span><span style=\\\"color: #000000;\\\">found</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>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">if</span>\\n <span style=\\\"color: #000000;\\\">i</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;\\\">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\\n <span style=\\\"color: #008080;\\\">for</span> <span style=\\\"color: #000000;\\\">i</span> <span style=\\\"color: #7060A8;\\\">in</span> <span style=\\\"color: #0000FF;\\\">{</span><span style=\\\"color: #000000;\\\">16758243290880</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">24959017348650</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">14593825548650</span><span style=\\\"color: #0000FF;\\\">}</span> <span style=\\\"color: #008080;\\\">do</span>\\n <span style=\\\"color: #000000;\\\">res</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">vampire</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;\\\">\\\"%d: %s\\\\n\\\"</span><span style=\\\"color: #0000FF;\\\">,{</span><span style=\\\"color: #000000;\\\">i</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;\\\">\\\"not a vampire number\\\"</span><span style=\\\"color: #0000FF;\\\">:</span><span style=\\\"color: #7060A8;\\\">sprint</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;\\\">for</span>\\n<!--\\n\",\n \"language\": \"Phix\"\n },\n {\n \"code\": \"EnableExplicit\\nDisableDebugger\\n\\nMacro CheckVamp(CheckNum)\\n c=0 : i=CheckNum : Print(~\\\"\\\\nCheck number: \\\"+Str(i)+~\\\"\\\\n\\\")\\n Gosub VampireLoop : If c=0 : Print(Str(i)+\\\" is not vampiric.\\\") : EndIf : PrintN(\\\"\\\")\\nEndMacro\\n\\nProcedure.i Factor(number.i,counter.i)\\n If number>0 And number>=counter*counter And number%counter=0\\n ProcedureReturn counter\\n EndIf\\n ProcedureReturn 0\\nEndProcedure\\n\\nProcedure.b IsVampire(f1.i,f2.i)\\n Define a.s=Str(f1*f2),\\n b.s=Str(f1),\\n c.s=Str(f2),\\n d.s=b+c,\\n i.i\\n If Len(a)=Len(d) And Len(b)=Len(c)\\n While Len(a)\\n i=FindString(d,Left(a,1))\\n If i\\n a=Mid(a,2)\\n d=RemoveString(d,Mid(d,i,1),#PB_String_NoCase,i,1)\\n Else\\n ProcedureReturn #False\\n EndIf\\n Wend\\n ProcedureReturn Bool(Len(d)=0)\\n EndIf\\n ProcedureReturn #False\\nEndProcedure\\n\\nOpenConsole(\\\"Vampire number\\\")\\nDefine i.i,\\n j.i,\\n m.i,\\n c.i=0\\n\\nPrintN(\\\"The first 25 Vampire numbers...\\\")\\nWhile c<25 : i+1 : Gosub VampireLoop : Wend\\nPrintN(\\\"\\\")\\nCheckVamp(16758243290880) : CheckVamp(24959017348650) : CheckVamp(14593825548650)\\nInput()\\nEnd\\n\\nVampireLoop:\\n For j=1 To Int(Sqr(i))\\n If Factor(i,j)>0\\n m=i/j\\n Else\\n Continue\\n EndIf\\n If IsVampire(m,j)\\n c+1\\n PrintN(RSet(Str(c),3,\\\" \\\")+\\\". \\\"+RSet(Str(i),10,\\\" \\\")+\\\": [\\\"+Str(j)+\\\", \\\"+Str(m)+\\\"]\\\")\\n EndIf\\n Next\\nReturn\\n\",\n \"language\": \"PureBasic\"\n },\n {\n \"code\": \"from __future__ import division\\n\\nimport math\\nfrom operator import mul\\nfrom itertools import product\\nfrom functools import reduce\\n\\n\\ndef fac(n):\\n '''\\\\\\n return the prime factors for n\\n >>> fac(600)\\n [5, 5, 3, 2, 2, 2]\\n >>> fac(1000)\\n [5, 5, 5, 2, 2, 2]\\n >>>\\n '''\\n step = lambda x: 1 + x*4 - (x//2)*2\\n maxq = int(math.floor(math.sqrt(n)))\\n d = 1\\n q = n % 2 == 0 and 2 or 3\\n while q <= maxq and n % q != 0:\\n q = step(d)\\n d += 1\\n res = []\\n if q <= maxq:\\n res.extend(fac(n//q))\\n res.extend(fac(q))\\n else: res=[n]\\n return res\\n\\ndef fact(n):\\n '''\\\\\\n return the prime factors and their multiplicities for n\\n >>> fact(600)\\n [(2, 3), (3, 1), (5, 2)]\\n >>> fact(1000)\\n [(2, 3), (5, 3)]\\n >>>\\n '''\\n res = fac(n)\\n return [(c, res.count(c)) for c in set(res)]\\n\\ndef divisors(n):\\n 'Returns all the divisors of n'\\n factors = fact(n) # [(primefactor, multiplicity), ...]\\n primes, maxpowers = zip(*factors)\\n powerranges = (range(m+1) for m in maxpowers)\\n powers = product(*powerranges)\\n return (\\n reduce(mul,\\n (prime**power for prime, power in zip(primes, powergroup)),\\n 1)\\n for powergroup in powers)\\n\\ndef vampire(n):\\n fangsets = set( frozenset([d, n//d])\\n for d in divisors(n)\\n if (len(str(d)) == len(str(n))/2.\\n and sorted(str(d) + str(n//d)) == sorted(str(n))\\n and (str(d)[-1] == 0) + (str(n//d)[-1] == 0) <=1) )\\n return sorted(tuple(sorted(fangs)) for fangs in fangsets)\\n\\n\\nif __name__ == '__main__':\\n print('First 25 vampire numbers')\\n count = n = 0\\n while count <25:\\n n += 1\\n fangpairs = vampire(n)\\n if fangpairs:\\n count += 1\\n print('%i: %r' % (n, fangpairs))\\n print('\\\\nSpecific checks for fangpairs')\\n for n in (16758243290880, 24959017348650, 14593825548650):\\n fangpairs = vampire(n)\\n print('%i: %r' % (n, fangpairs))\\n\",\n \"language\": \"Python\"\n },\n {\n \"code\": \"from math import sqrt\\nfrom itertools import imap, ifilter, islice, count\\n\\ndef factor_pairs(n):\\n return ((x, n // x) for x in xrange(2, int(sqrt(n))) if n % x == 0)\\n\\ndef fangs(n):\\n dlen = lambda x: len(str(x))\\n half = dlen(n) // 2\\n digits = lambda (x, y): sorted(str(x) + str(y))\\n halvesQ = lambda xs: all(y == half for y in imap(dlen, xs))\\n dn = sorted(str(n))\\n return [p for p in factor_pairs(n) if halvesQ(p) and dn==digits(p)]\\n\\ndef vampiricQ(n):\\n fn = fangs(n)\\n return (n, fn) if fn else None\\n\\nfor v in islice(ifilter(None, imap(vampiricQ, count())), 0, 25):\\n print v\\n\\nfor n in [16758243290880, 24959017348650, 14593825548650]:\\n print vampiricQ(n) or str(n) + \\\" is not vampiric.\\\"\\n\",\n \"language\": \"Python\"\n },\n {\n \"code\": \"#lang racket\\n\\n;; chock full of fun... including divisors\\n(require math/number-theory)\\n\\n;; predicate to tell if n is a vampire number\\n(define (sub-vampire?-and-fangs n)\\n (define digit-count-n (add1 (order-of-magnitude n)))\\n (define (string-sort-characters s) (sort (string->list s) char<?))\\n (define digits-in-order-n (string-sort-characters (number->string n)))\\n (define (fangs-of-n? d e)\\n (and (<= d e) ; avoid duplication\\n (= (add1 (order-of-magnitude d)) (add1 (order-of-magnitude e)) (/ digit-count-n 2))\\n (not (= 0 (modulo d 10) (modulo e 10)))\\n (equal? digits-in-order-n\\n (string-sort-characters (string-append (number->string d) (number->string e))))))\\n\\n (let* ((fangses (for*/list ((d (in-list (divisors n))) #:when (fangs-of-n? d (/ n d)))\\n (list d (/ n d)))))\\n (and (not (null? fangses)) (cons n fangses))))\\n\\n(define (vampire?-and-fangs n)\\n (and (odd? (order-of-magnitude n)) ; even number of digits - else not even worth looking!\\n (sub-vampire?-and-fangs n)))\\n\\n(displayln \\\"First 25 vampire numbers:\\\")\\n(for ((vmp (sequence-filter identity (sequence-map vampire?-and-fangs (in-naturals 1))))\\n (cnt (in-range 1 (add1 25))))\\n (printf \\\"#~a ~a~%\\\" cnt vmp))\\n\\n(displayln \\\"Test the big numbers:\\\")\\n(displayln (vampire?-and-fangs 16758243290880))\\n(displayln (vampire?-and-fangs 24959017348650))\\n(displayln (vampire?-and-fangs 14593825548650))\\n\",\n \"language\": \"Racket\"\n },\n {\n \"code\": \"sub is_vampire (Int $num) {\\n my $digits = $num.comb.sort;\\n my @fangs;\\n (10**$num.sqrt.log(10).floor .. $num.sqrt.ceiling).map: -> $this {\\n next if $num % $this;\\n my $that = $num div $this;\\n next if $this %% 10 && $that %% 10;\\n @fangs.push(\\\"$this x $that\\\") if ($this ~ $that).comb.sort eq $digits;\\n }\\n @fangs\\n}\\n\\nconstant @vampires = flat (3..*).map: -> $s, $e {\\n (10**$s .. 10**$e).hyper.map: -> $n {\\n next unless my @fangs = is_vampire($n);\\n \\\"$n: { @fangs.join(', ') }\\\"\\n }\\n}\\n\\nsay \\\"\\\\nFirst 25 Vampire Numbers:\\\\n\\\";\\n\\n.say for @vampires[^25];\\n\\nsay \\\"\\\\nIndividual tests:\\\\n\\\";\\n\\n.say for (16758243290880, 24959017348650, 14593825548650).hyper(:1batch).map: {\\n \\\"$_: \\\" ~ (is_vampire($_).join(', ') || 'is not a vampire number.')\\n}\\n\",\n \"language\": \"Raku\"\n },\n {\n \"code\": \"/*REXX program displays N vampire numbers, or verifies if a number is vampiric. */\\nparse arg N . /*obtain optional argument from the CL.*/\\nif N=='' | N==\\\",\\\" then N= 25 /*Not specified? Then use the default.*/\\n!.0= 1260; !.1= 11453481; !.2= 115672; !.3= 124483; !.4= 105264 /*lowest #, dig*/\\n!.5= 1395; !.6= 126846; !.7= 1827; !.8= 110758; !.9= 156289 /* \\\" \\\" \\\" */\\nL= length(N); aN= abs(N) /*L: length of N; aN: absolute value*/\\nnumeric digits max(9, length(aN) ) /*be able to handle ginormus numbers. */\\n# = 0 /*#: count of vampire numbers (so far)*/\\nif N>0 then do j=1260 until # >= N /*search until N vampire numbers found.*/\\n if length(j) // 2 then do; j= j*10 - 1; iterate /*bump J to even length*/\\n end /* [↑] check if odd. */\\n parse var j '' -1 _ /*obtain the last decimal digit of J. */\\n if j<!._ then iterate /*is number tenable based on last dig? */\\n f= vampire(j) /*obtain the fangs of J. */\\n if f=='' then iterate /*Are fangs null? Yes, not vampire. */\\n #= # + 1 /*bump the vampire count, Vlad. */\\n say right('vampire number', 20) right(#, L) \\\"is: \\\" right(j, 9)', fangs=' f\\n end /*j*/ /* [↑] process a range of numbers. */\\n else do; f= vampire(aN) /* [↓] process a number; obtain fangs.*/\\n if f=='' then say aN \\\" isn't a vampire number.\\\"\\n else say aN \\\" is a vampire number, fangs=\\\" f\\n end\\nexit 0 /*stick a fork in it, we're all done. */\\n/*──────────────────────────────────────────────────────────────────────────────────────*/\\nvampire: procedure; parse arg x,, $. a bot; L= length(x) /*get arg; compute len of X*/\\n if L//2 then return '' /*is L odd? Then ¬vampire.*/\\n do k=1 for L; _= substr(x, k, 1); $._= $._ || _\\n end /*k*/\\n w= L % 2 /*%: is REXX's integer ÷ */\\n do m=0 for 10; bot= bot || $.m\\n end /*m*/\\n top= left( reverse(bot), w)\\n bot= left(bot, w) /*determine limits of search*/\\n inc= x // 2 + 1 /*X is odd? INC=2. No? INC=1*/\\n beg= max(bot, 10 ** (w-1) ) /*calculate where to begin.*/\\n if inc==2 then if beg//2==0 then beg= beg + 1 /*possibly adjust the begin.*/\\n /* [↑] odd BEG if odd INC*/\\n do d=beg to min(top, 10**w - 1) by inc /*use smart BEG, END, INC. */\\n if x // d \\\\==0 then iterate /*X not ÷ by D? Then skip,*/\\n q= x % d; if d>q then iterate /*is D > Q \\\" \\\" */\\n if length(q) \\\\== w then iterate /*Len of Q ¬= W? Then skip.*/\\n if q*d//9 \\\\== (q+d)//9 then iterate /*modulo 9 congruence test. */\\n parse var q '' -1 _ /*get last decimal dig. of Q*/\\n if _== 0 then if right(d, 1) == 0 then iterate\\n dq= d || q\\n t= x; do i=1 for L; p= pos( substr(dq, i, 1), t)\\n if p==0 then iterate d; t= delstr(t, p, 1)\\n end /*i*/\\n a= a '['d\\\"∙\\\"q'] ' /*construct formatted fangs.*/\\n end /*d*/ /* [↑] ∙ is a round bullet*/\\n return a /*return formatted fangs.*/\\n\",\n \"language\": \"REXX\"\n },\n {\n \"code\": \"# Project : Vampire number\\n\\nfor p = 10 to 127000\\n vampire(p)\\nnext\\n\\nfunc vampire(listnum)\\n sum = 0\\n flag = 1\\n list = list(len(string(listnum)))\\n total = newlist(len(list),2)\\n for n = 1 to len(string(listnum))\\n liststr = string(listnum)\\n list[n] = liststr[n]\\n next\\n\\n for perm = 1 to fact(len(list))\\n numstr = substr(list2str(list), nl, \\\"\\\")\\n num1 = number(left(numstr,len(numstr)/2))\\n num2 = number(right(numstr,len(numstr)/2))\\n if (listnum = num1 * num2)\\n for n = 1 to len(total)\\n if (num1 = total[n][2] and num2 = total[n][1]) or\\n (num1 = total[n][1] and num2 = total[n][2])\\n flag = 0\\n ok\\n next\\n if flag = 1\\n sum = sum + 1\\n total[sum][1] = num1\\n total[sum][2] = num2\\n see \\\"\\\" + listnum + \\\": [\\\" + num1 + \\\",\\\" + num2 + \\\"]\\\" + nl\\n ok\\n ok\\n nextPermutation(list)\\n next\\n\\nfunc nextPermutation(a)\\n elementcount = len(a)\\n if elementcount < 1 then return ok\\n pos = elementcount-1\\n while a[pos] >= a[pos+1]\\n pos -= 1\\n if pos <= 0 permutationReverse(a, 1, elementcount)\\n return ok\\n end\\n last = elementcount\\n while a[last] <= a[pos]\\n last -= 1\\n end\\n temp = a[pos]\\n a[pos] = a[last]\\n a[last] = temp\\n permutationReverse(a, pos+1, elementcount)\\n\\n func permutationReverse a, first, last\\n while first < last\\n temp = a[first]\\n a[first] = a[last]\\n a[last] = temp\\n first += 1\\n last -= 1\\n end\\n\\nfunc fact(nr)\\n if nr = 1\\n return 1\\n else\\n return nr * fact(nr-1)\\n ok\\n\\nfunc newlist(x,y)\\n if isstring(x) x=0+x ok\\n if isstring(y) y=0+y ok\\n alist = list(x)\\n for t in alist\\n t = list(y)\\n next\\n return alist\\n\",\n \"language\": \"Ring\"\n },\n {\n \"code\": \"def factor_pairs n\\n first = n / (10 ** (n.to_s.size / 2) - 1)\\n (first .. n ** 0.5).map { |i| [i, n / i] if n % i == 0 }.compact\\nend\\n\\ndef vampire_factors n\\n return [] if n.to_s.size.odd?\\n half = n.to_s.size / 2\\n factor_pairs(n).select do |a, b|\\n a.to_s.size == half && b.to_s.size == half &&\\n [a, b].count {|x| x%10 == 0} != 2 &&\\n \\\"#{a}#{b}\\\".chars.sort == n.to_s.chars.sort\\n end\\nend\\n\\ni = vamps = 0\\nuntil vamps == 25\\n vf = vampire_factors(i += 1)\\n unless vf.empty?\\n puts \\\"#{i}:\\\\t#{vf}\\\"\\n vamps += 1\\n end\\nend\\n\\n[16758243290880, 24959017348650, 14593825548650].each do |n|\\n if (vf = vampire_factors n).empty?\\n puts \\\"#{n} is not a vampire number!\\\"\\n else\\n puts \\\"#{n}:\\\\t#{vf}\\\"\\n end\\nend\\n\",\n \"language\": \"Ruby\"\n },\n {\n \"code\": \"use std::cmp::{max, min};\\n\\nstatic TENS: [u64; 20] = [\\n 1,\\n 10,\\n 100,\\n 1000,\\n 10000,\\n 100000,\\n 1000000,\\n 10000000,\\n 100000000,\\n 1000000000,\\n 10000000000,\\n 100000000000,\\n 1000000000000,\\n 10000000000000,\\n 100000000000000,\\n 1000000000000000,\\n 10000000000000000,\\n 100000000000000000,\\n 1000000000000000000,\\n 10000000000000000000,\\n];\\n\\n/// Get the number of digits present in x\\nfn ndigits(mut x: u64) -> u64 {\\n let mut n = 0;\\n\\n while x != 0 {\\n n += 1;\\n x /= 10;\\n }\\n\\n n\\n}\\n\\nfn dtally(mut x: u64) -> u64 {\\n let mut t = 0;\\n\\n while x != 0 {\\n t += 1 << ((x % 10) * 6);\\n x /= 10;\\n }\\n\\n t\\n}\\n\\n/// Get a list of all fangs of x. Get only the first divider of each fang. The second one can be found simply with x / fang.\\nfn fangs(x: u64) -> Vec<u64> {\\n let mut nd = ndigits(x) as usize;\\n\\n let mut fangs = vec![];\\n\\n if nd & 1 != 1 {\\n nd /= 2;\\n\\n let lo = max(TENS[nd - 1], (x + TENS[nd] - 2) / (TENS[nd] - 1));\\n let hi = min(x / lo, (x as f64).sqrt() as u64);\\n\\n let t = dtally(x);\\n\\n for a in lo..(hi + 1) {\\n let b = x / a;\\n if a * b == x && ((a % 10) > 0 || b % 10 > 0) && t == dtally(a) + dtally(b) {\\n fangs.push(a);\\n }\\n }\\n }\\n\\n fangs\\n}\\n\\n/// Pretty print the fangs of x\\nfn print_fangs(x: u64, fangs: Vec<u64>) {\\n print!(\\\"{} = \\\", x);\\n\\n if fangs.is_empty() {\\n print!(\\\"is not vampiric\\\");\\n } else {\\n for fang in fangs {\\n print!(\\\"{} x {}, \\\", fang, x / fang);\\n }\\n }\\n print!(\\\"\\\\n\\\");\\n}\\n\\nfn main() {\\n println!(\\\"The first 25 vampire numbers are :\\\");\\n\\n let mut nfangs = 0;\\n let mut x = 1;\\n\\n while nfangs < 25 {\\n let fangs = fangs(x);\\n if !fangs.is_empty() {\\n nfangs += 1;\\n print_fangs(x, fangs);\\n }\\n\\n x += 1;\\n }\\n\\n println!(\\\"\\\\nSpecial requests :\\\");\\n\\n print_fangs(16758243290880, fangs(16758243290880));\\n print_fangs(24959017348650, fangs(24959017348650));\\n print_fangs(14593825548650, fangs(14593825548650));\\n}\\n\\n#[test]\\nfn test() {\\n assert_eq!(\\n fangs(16758243290880),\\n vec![1982736, 2123856, 2751840, 2817360]\\n );\\n\\n assert_eq!(\\n fangs(24959017348650),\\n vec![2947050, 2949705, 4125870, 4129587, 4230765]\\n );\\n\\n assert_eq!(fangs(14593825548650), vec![]);\\n}\\n\",\n \"language\": \"Rust\"\n },\n {\n \"code\": \"import Stream._\\nimport math._\\nimport scala.collection.mutable.ListBuffer\\n\\nobject VampireNumbers extends App {\\n val elapsed: (=> Unit) => Long = f => {val s = System.currentTimeMillis; f; (System.currentTimeMillis - s)/1000}\\n\\n val sexp = from(1, 2) // stream of integer: 1,3,5,7, ...\\n val rs: Stream[Int] => Stream[Pair[Long,Long]] = exps => Pair(pow(10,exps.head).toLong,(pow(10,exps.head)*10-1).toLong)#::rs(exps.tail)\\n val srs = rs(sexp) // stream of ranges: [10..99], [1000..9999], [100000..999999], ...\\n val cs: Stream[Pair[Long,Long]] => Stream[Long] = rs => (rs.head._1 to rs.head._2).toStream#:::cs(rs.tail)\\n val scs = cs(srs) // stream of candidates: 10,11,..,99,1000,1001,..,9999, ...\\n val it = scs.iterator\\n\\n val checkVN: Long => Pair[Long,Seq[Pair[Long,Long]]] = n => {\\n val check: Pair[Long,Long] => Pair[Long,Long] = p => {\\n val len: Long => Int = n => n.toString.size\\n val (a,b) = p\\n if ((a%10==0)&&(b%10==0)) Pair(0,0) else\\n if (len(a) != len(b)) Pair(0,0) else\\n if (n.toString.toList.diff(a.toString.toList++b.toString.toList)!=Nil) Pair(0,0) else p\\n }\\n Pair(n,(pow(10,log10(sqrt(n).toLong).toLong).toLong+1 to sqrt(n).toLong).filter{i=>n%i==0}\\n .map {fac =>Pair(fac,n/fac)}.map {p => check(p)}.filter {p => p._1 != 0})\\n }\\n\\n val et = elapsed {\\n val lb = new ListBuffer[Pair[Long,Seq[Pair[Long,Long]]]]\\n while ((lb.size<25)&&(it.hasNext)) {\\n checkVN(it.next) match {\\n case (n, Seq()) =>\\n case p => lb += p\\n }\\n }\\n\\n lb.toList.zipWithIndex.foreach {p =>\\n println(p._2+1+\\\": \\\"+p._1._1+(p._1._2:\\\\\\\"\\\")((x,y)=>\\\" = \\\"+x._1+\\\" x \\\"+x._2+y))\\n }\\n println\\n\\n List(16758243290880L, 24959017348650L, 14593825548650L)\\n .map {checkVN(_)}\\n .foreach {\\n case (n, Seq()) => println(n+\\\" is not vampiric\\\")\\n case p => println(p._1+(p._2:\\\\\\\"\\\")((x,y)=>\\\" = \\\"+x._1+\\\" x \\\"+x._2+y))\\n }\\n }\\n\\n println(\\\"\\\\n\\\"+\\\"elapsed time: \\\"+et+\\\" seconds\\\")\\n}\\n\",\n \"language\": \"Scala\"\n },\n {\n \"code\": \"func is_vampire (n) {\\n return [] if n.ilog10.is_even\\n\\n var l1 = n.isqrt.ilog10.ipow10\\n var l2 = n.isqrt\\n\\n var s = n.digits.sort.join\\n\\n gather {\\n n.divisors.each { |d|\\n\\n d < l1 && next\\n d > l2 && break\\n\\n var t = n/d\\n\\n next if (d%%10 && t%%10)\\n next if (\\\"#{d}#{t}\\\".sort != s)\\n\\n take([d, t])\\n }\\n }\\n}\\n\\nsay \\\"First 25 Vampire Numbers:\\\"\\n\\nwith (1) { |i|\\n for (var n = 1; i <= 25; ++n) {\\n var fangs = is_vampire(n)\\n printf(\\\"%2d. %6s : %s\\\\n\\\", i++, n, fangs.join(' ')) if fangs\\n }\\n}\\n\\nsay \\\"\\\\nIndividual tests:\\\"\\n\\n[16758243290880, 24959017348650, 14593825548650].each { |n|\\n var fangs = is_vampire(n)\\n say \\\"#{n}: #{fangs ? fangs.join(', ') : 'is not a vampire number'}\\\"\\n}\\n\",\n \"language\": \"Sidef\"\n },\n {\n \"code\": \"import Foundation\\n\\nfunc vampire<T>(n: T) -> [(T, T)] where T: BinaryInteger, T.Stride: SignedInteger {\\n let strN = String(n).sorted()\\n let fangLength = strN.count / 2\\n let start = T(pow(10, Double(fangLength - 1)))\\n let end = T(Double(n).squareRoot())\\n\\n var fangs = [(T, T)]()\\n\\n for i in start...end where n % i == 0 {\\n let quot = n / i\\n\\n guard i % 10 != 0 || quot % 10 != 0 else {\\n continue\\n }\\n\\n if \\\"\\\\(i)\\\\(quot)\\\".sorted() == strN {\\n fangs.append((i, quot))\\n }\\n }\\n\\n return fangs\\n}\\n\\nvar count = 0\\nvar i = 1.0\\n\\nwhile count < 25 {\\n let start = Int(pow(10, i))\\n let end = start * 10\\n\\n for num in start...end {\\n let fangs = vampire(n: num)\\n\\n guard !fangs.isEmpty else { continue }\\n\\n count += 1\\n\\n print(\\\"\\\\(num) is a vampire number with fangs: \\\\(fangs)\\\")\\n\\n guard count != 25 else { break }\\n }\\n\\n i += 2\\n}\\n\\nfor (vamp, fangs) in [16758243290880, 24959017348650, 14593825548650].lazy.map({ ($0, vampire(n: $0)) }) {\\n if fangs.isEmpty {\\n print(\\\"\\\\(vamp) is not a vampire number\\\")\\n } else {\\n print(\\\"\\\\(vamp) is a vampire number with fangs: \\\\(fangs)\\\")\\n }\\n}\\n\",\n \"language\": \"Swift\"\n },\n {\n \"code\": \"proc factorPairs {n {from 2}} {\\n set result [list 1 $n]\\n if {$from<=1} {set from 2}\\n for {set i $from} {$i<=sqrt($n)} {incr i} {\\n\\tif {$n%$i} {} {lappend result $i [expr {$n/$i}]}\\n }\\n return $result\\n}\\n\\nproc vampireFactors {n} {\\n if {[string length $n]%2} return\\n set half [expr {[string length $n]/2}]\\n set digits [lsort [split $n \\\"\\\"]]\\n set result {}\\n foreach {a b} [factorPairs $n [expr {10**$half/10}]] {\\n\\tif {\\n\\t [string length $a]==$half && [string length $b]==$half &&\\n\\t ($a%10 || $b%10) && $digits eq [lsort [split $a$b \\\"\\\"]]\\n\\t} then {\\n\\t lappend result [list $a $b]\\n\\t}\\n }\\n return $result\\n}\\n\",\n \"language\": \"Tcl\"\n },\n {\n \"code\": \"# A nicer way to print the evidence of vampire-ness\\nproc printVampire {n pairs} {\\n set out \\\"${n}:\\\"\\n foreach p $pairs {\\n\\tappend out \\\" \\\\[[join $p {, }]\\\\]\\\"\\n }\\n puts $out\\n}\\nset n 0\\nfor {set i 0} {$i < 25} {incr i} {\\n while 1 {\\n\\tif {[llength [set vamps [vampireFactors [incr n]]]]} {\\n\\t printVampire $n $vamps\\n\\t break\\n\\t}\\n }\\n}\\nputs \\\"\\\"\\nforeach n {16758243290880 24959017348650 14593825548650} {\\n if {[llength [set vamps [vampireFactors $n]]]} {\\n\\tprintVampire $n $vamps\\n } else {\\n\\tputs \\\"$n is not a vampire number\\\"\\n }\\n}\\n\",\n \"language\": \"Tcl\"\n },\n {\n \"code\": \"import math\\nfn max(a u64, b u64) u64 {\\n if a > b {\\n return a\\n }\\n return b\\n}\\n\\nfn min(a u64, b u64) u64 {\\n if a < b {\\n return a\\n }\\n return b\\n}\\n\\nfn ndigits(xx u64) int {\\n mut n:=0\\n mut x := xx\\n for ; x > 0; x /= 10 {\\n n++\\n }\\n return n\\n}\\n\\nfn dtally(xx u64) u64 {\\n mut t := u64(0)\\n mut x := xx\\n for ; x > 0; x /= 10 {\\n t += 1 << (x % 10 * 6)\\n }\\n return t\\n}\\n\\n__global (\\n tens [20]u64\\n)\\n\\nfn init() {\\n tens[0] = 1\\n for i := 1; i < 20; i++ {\\n tens[i] = tens[i-1] * 10\\n }\\n}\\n\\nfn fangs(x u64) []u64 {\\n mut f := []u64{}\\n mut nd := ndigits(x)\\n if nd&1 == 1 {\\n return f\\n }\\n nd /= 2\\n lo := max(tens[nd-1], (x+tens[nd]-2)/(tens[nd]-1))\\n hi := min(x/lo, u64(math.sqrt(f64(x))))\\n t := dtally(x)\\n for a := lo; a <= hi; a++ {\\n b := x / a\\n if a*b == x &&\\n (a%10 > 0 || b%10 > 0) &&\\n t == dtally(a)+dtally(b) {\\n f << a\\n }\\n }\\n return f\\n}\\n\\nfn show_fangs(x u64, f []u64) {\\n print(x)\\n if f.len > 1 {\\n println('')\\n }\\n for a in f {\\n println(\\\" = $a × ${x/a}\\\")\\n }\\n}\\n\\nfn main() {\\n for x, n := u64(1), 0; n < 26; x++ {\\n f := fangs(x)\\n if f.len > 0 {\\n n++\\n print(\\\"${n:2}: \\\")\\n show_fangs(x, f)\\n }\\n }\\n println('')\\n for x in [u64(16758243290880), 24959017348650, 14593825548650] {\\n f := fangs(x)\\n if f.len > 0 {\\n show_fangs(x, f)\\n } else {\\n println(\\\"$x is not vampiric\\\")\\n }\\n }\\n}\\n\",\n \"language\": \"V-(Vlang)\"\n },\n {\n \"code\": \"import \\\"./fmt\\\" for Fmt\\n\\nvar ndigits = Fn.new { |x|\\n var n = 0\\n while (x > 0) {\\n n = n + 1\\n x = (x/10).floor\\n }\\n return n\\n}\\n\\nvar dtally = Fn.new { |x|\\n var t = 0\\n while (x > 0) {\\n t = t + 2.pow((x%10) * 6)\\n x = (x/10).floor\\n }\\n return t\\n}\\n\\nvar tens = List.filled(15, 0)\\n\\nvar init = Fn.new {\\n tens[0] = 1\\n for (i in 1..14) tens[i] = tens[i-1] * 10\\n}\\n\\nvar fangs = Fn.new { |x|\\n var f = []\\n var nd = ndigits.call(x)\\n if ((nd&1) == 1) return f\\n nd = (nd/2).floor\\n var lo = tens[nd-1].max(((x + tens[nd] - 2) / (tens[nd] - 1)).floor)\\n var hi = (x/lo).floor.min(x.sqrt.floor)\\n var t = dtally.call(x)\\n var a = lo\\n while (a <= hi) {\\n var b = (x/a).floor\\n if (a*b == x && ((a%10) > 0 || (b%10) > 0) && t == dtally.call(a) + dtally.call(b)) {\\n f.add(a)\\n }\\n a = a + 1\\n }\\n return f\\n}\\n\\nvar showFangs = Fn.new { |x, f|\\n Fmt.write(\\\"$6d\\\", x)\\n if (f.count > 1) System.print()\\n for (a in f) Fmt.print(\\\" = $3d x $3d\\\", a, (x/a).floor)\\n}\\n\\ninit.call()\\nvar x = 1\\nvar n = 0\\nwhile (n < 25) {\\n var f = fangs.call(x)\\n if (f.count > 0) {\\n n = n + 1\\n Fmt.write(\\\"$2d: \\\", n)\\n showFangs.call(x, f)\\n }\\n x = x + 1\\n}\\nSystem.print()\\nfor (x in [16758243290880, 24959017348650, 14593825548650]) {\\n var f = fangs.call(x)\\n if (f.count > 0) {\\n showFangs.call(x, f)\\n } else {\\n Fmt.print(\\\"$d is not vampiric\\\", x)\\n }\\n}\\n\",\n \"language\": \"Wren\"\n },\n {\n \"code\": \"fcn fangs(N){ //-->if Vampire number: (N,(a,b,c,...)), where a*x==N\\n var [const] tens=[0 .. 18].pump(List,(10.0).pow,\\\"toInt\\\");\\n\\n (half:=N.numDigits) : if (_.isOdd) return(T);;\\n half/=2; digits:=N.toString().sort();\\n lo:=tens[half-1].max((N+tens[half])/(tens[half]));\\n hi:=(N/lo).min(N.toFloat().sqrt());\\n fs:=[lo .. hi].filter('wrap(n){\\n N%n==0 and (n%10!=0 or (N/n)%10!=0) and\\n (n.toString()+(N/n).toString()).sort()==digits\\n });\\n fs and T(N,fs) or T;\\n}\\n\",\n \"language\": \"Zkl\"\n },\n {\n \"code\": \"fcn vampiric(fangs,n=Void){\\n if(not fangs) return(n,\\\"Not a Vampire number\\\");\\n v:=fangs[0]; T(v,fangs[1].apply('wrap(n){T(n,v/n)})) }\\n\\nT(16758243290880, 24959017348650, 14593825548650)\\n.pump(Console.println,fcn(n){\\\"%d: %s\\\".fmt(vampiric(fangs(n),n).xplode())});\\n\\n(0).walker(*).tweak(fangs).filter(26)\\n.pump(Console.println,vampiric);\\n\",\n \"language\": \"Zkl\"\n }\n]","isConversational":false},"task_name":{"kind":"string","value":"Vampire-number"}}},{"rowIdx":1795,"cells":{"solutions":{"kind":"list like","value":[{"code":"---\nfrom: http://rosettacode.org/wiki/Van_der_Corput_sequence\n","language":"00-META"},{"code":"When counting integers in binary, if you put a (binary) point to the right of the count then the column immediately to the left denotes a digit with a multiplier of <math>2^0</math>; the digit in the next column to the left has a multiplier of <math>2^1</math>; and so on.\n\nSo in the following table:\n<pre> 0.\n 1.\n 10.\n 11.\n ...</pre>\nthe binary number \"<code>10</code>\" is <math>1 \\times 2^1 + 0 \\times 2^0</math>.\n\nYou can also have binary digits to the right of the “point”, just as in the decimal number system. In that case, the digit in the place immediately to the right of the point has a weight of <math>2^{-1}</math>, or <math>1/2</math>. \nThe weight for the second column to the right of the point is <math>2^{-2}</math> or <math>1/4</math>. And so on.\n\nIf you take the integer binary count of the first table, and ''reflect'' the digits about the binary point, you end up with '''the van der Corput sequence of numbers in base 2'''.\n\n<pre> .0\n .1\n .01\n .11\n ...</pre>\n\nThe third member of the sequence, binary <code>0.01</code>, is therefore <math>0 \\times 2^{-1} + 1 \\times 2^{-2}</math> or <math>1/4</math>.\n\n<br> [[File:Van der corput distribution.png|400|thumb|right|Distribution of 2500 points each: Van der Corput (top) vs pseudorandom]] Members of the sequence lie within the interval <math>0 \\leq x < 1</math>. Points within the sequence tend to be evenly distributed which is a useful trait to have for [[wp:Monte Carlo method|Monte Carlo simulations]]. \nThis sequence is also a superset of the numbers representable by the \"fraction\" field of [[wp:IEEE 754-1985|an old IEEE floating point standard]]. In that standard, the \"fraction\" field represented the fractional part of a binary number beginning with \"1.\" e.g. 1.101001101.\n\n'''Hint'''\n\nA ''hint'' at a way to generate members of the sequence is to modify a routine used to change the base of an integer:\n<syntaxhighlight lang=\"python\">>>> def base10change(n, base):\n\tdigits = []\n\twhile n:\n\t\tn,remainder = divmod(n, base)\n\t\tdigits.insert(0, remainder)\n\treturn digits\n\n>>> base10change(11, 2)\n[1, 0, 1, 1]</syntaxhighlight>\nthe above showing that <code>11</code> in decimal is <math>1\\times 2^3 + 0\\times 2^2 + 1\\times 2^1 + 1\\times 2^0</math>.<br>\nReflected this would become <code>.1101</code> or <math>1\\times 2^{-1} + 1\\times 2^{-2} + 0\\times 2^{-3} + 1\\times 2^{-4}</math>\n\n\n;Task description:\n* Create a function/method/routine that given ''n'', generates the ''n'''th term of the van der Corput sequence in base 2.\n* Use the function to compute ''and display'' the first ten members of the sequence. (The first member of the sequence is for ''n''=0).\n\n* As a stretch goal/extra credit, compute and show members of the sequence for bases other than 2.\n\n\n\n;See also:\n* [http://www.puc-rio.br/marco.ind/quasi_mc.html#low_discrep The Basic Low Discrepancy Sequences]\n* [[Non-decimal radices/Convert]]\n* [[wp:Van der Corput sequence|Van der Corput sequence]]\n<br><br>\n\n","language":"00-TASK"},{"code":"F vdc(=n, base = 2)\n V (vdc, denom) = (0.0, 1)\n L n != 0\n denom *= base\n (n, V remainder) = divmod(n, base)\n vdc += Float(remainder) / denom\n R vdc\n\nprint((0.<10).map(i -> vdc(i)))\nprint((0.<10).map(i -> vdc(i, 3)))\n","language":"11l"},{"code":"* Van der Corput sequence 31/01/2017\nVDCS CSECT\n USING VDCS,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 \" addressability\n ZAP B,=P'2' b=2 (base)\n ZAP M,=P'-1' m=-1\n SR R6,R6 i=0\nLOOPI CH R6,=H'10' do i=0 to 10\n BH ELOOPI\n AP M,=P'1' w=m+1\n ZAP V,=P'0' v=0\n ZAP S,=P'1' s=1\n ZAP N,M n=m\nWHILE CP N,=P'0' do while n<>0\n BE EWHILE\n MP S,B s=s*b\n ZAP PL16,N n\n DP PL16,B n/b\n ZAP W,PL16+8(8) w=n mod b\n MP W,=P'100000' *100000\n ZAP PL16,W w\n DP PL16,S w/s\n ZAP W,PL16(8) w=w/s\n AP V,W v=v+(n mod b)*100000/s\n ZAP PL16,N n\n DP PL16,B n/b\n ZAP N,PL16(8) n=n/b\n B WHILE\nEWHILE XDECO R6,XDEC edit i\n MVC PG+0(3),XDEC+9 output i\n MVC PG+3(3),=C' 0.'\n UNPK Z,V unpack v\n OI Z+L'Z-1,X'F0' edit v\n MVC PG+6(5),Z+11 output v (v/100000)\n XPRNT PG,L'PG print buffer\n LA R6,1(R6) i=i+1\n B LOOPI\nELOOPI L R13,4(0,R13) epilog\n LM R14,R12,12(R13) \" restore\n XR R15,R15 \" rc=0\n BR R14 exit\nB DS PL8\nM DS PL8\nV DS PL8\nS DS PL8\nN DS PL8\nW DS PL8 packed\nZ DS ZL16 zoned\nPL16 DS PL16 packed max\nPG DC CL80' ' buffer\nXDEC DS CL12 work area for xdeco\n YREGS\n END VDCS\n","language":"360-Assembly"},{"code":"INCLUDE \"D2:REAL.ACT\" ;from the Action! Tool Kit\n\nPROC Generate(INT value,base REAL POINTER res)\n REAL denom,rbase,r1,r2\n\n IntToReal(0,res)\n IntToReal(1,denom)\n IntToReal(base,rbase)\n WHILE value#0\n DO\n RealMult(denom,rbase,r1)\n RealAssign(r1,denom)\n IntToReal(value MOD base,r1)\n RealDiv(r1,denom,r2)\n RealAdd(res,r2,r1)\n RealAssign(r1,res)\n value==/base\n OD\nRETURN\n\nPROC Main()\n INT value,base\n REAL res\n\n Put(125) PutE() ;clear the screen\n FOR base=2 TO 5\n DO\n PrintF(\"Base %I:%E\",base)\n FOR value=0 TO 9\n DO\n Generate(value,base,res)\n PrintR(res) Put(32)\n OD\n PutE() PutE()\n OD\nRETURN\n","language":"Action-"},{"code":"package {\n\t\n import flash.display.Sprite;\n import flash.events.Event;\n\n public class VanDerCorput extends Sprite {\n\n public function VanDerCorput():void {\n if (stage) init();\n else addEventListener(Event.ADDED_TO_STAGE, init);\n }\n\n private function init(e:Event = null):void {\n\n removeEventListener(Event.ADDED_TO_STAGE, init);\n\n var base2:Vector.<Number> = new Vector.<Number>(10, true);\n var base3:Vector.<Number> = new Vector.<Number>(10, true);\n var base4:Vector.<Number> = new Vector.<Number>(10, true);\n var base5:Vector.<Number> = new Vector.<Number>(10, true);\n var base6:Vector.<Number> = new Vector.<Number>(10, true);\n var base7:Vector.<Number> = new Vector.<Number>(10, true);\n var base8:Vector.<Number> = new Vector.<Number>(10, true);\n\n var i:uint;\n\n for ( i = 0; i < 10; i++ ) {\n base2[i] = Math.round( _getTerm(i, 2) * 1000000 ) / 1000000;\n base3[i] = Math.round( _getTerm(i, 3) * 1000000 ) / 1000000;\n base4[i] = Math.round( _getTerm(i, 4) * 1000000 ) / 1000000;\n base5[i] = Math.round( _getTerm(i, 5) * 1000000 ) / 1000000;\n base6[i] = Math.round( _getTerm(i, 6) * 1000000 ) / 1000000;\n base7[i] = Math.round( _getTerm(i, 7) * 1000000 ) / 1000000;\n base8[i] = Math.round( _getTerm(i, 8) * 1000000 ) / 1000000;\n }\n\n trace(\"Base 2: \" + base2.join(', '));\n trace(\"Base 3: \" + base3.join(', '));\n trace(\"Base 4: \" + base4.join(', '));\n trace(\"Base 5: \" + base5.join(', '));\n trace(\"Base 6: \" + base6.join(', '));\n trace(\"Base 7: \" + base7.join(', '));\n trace(\"Base 8: \" + base8.join(', '));\n\n }\n\n private function _getTerm(n:uint, base:uint = 2):Number {\n\n var r:Number = 0, p:uint, digit:uint;\n var baseLog:Number = Math.log(base);\n\n while ( n > 0 ) {\n p = Math.pow( base, uint(Math.log(n) / baseLog) );\n\n digit = n / p;\n n %= p;\n r += digit / (p * base);\n }\n\n return r;\n\n }\n\n }\n\n}\n","language":"ActionScript"},{"code":"with Ada.Text_IO;\n\nprocedure Main is\n package Float_IO is new Ada.Text_IO.Float_IO (Float);\n function Van_Der_Corput (N : Natural; Base : Positive := 2) return Float is\n Value : Natural := N;\n Result : Float := 0.0;\n Exponent : Positive := 1;\n begin\n while Value > 0 loop\n Result := Result +\n Float (Value mod Base) / Float (Base ** Exponent);\n Value := Value / Base;\n Exponent := Exponent + 1;\n end loop;\n return Result;\n end Van_Der_Corput;\nbegin\n for Base in 2 .. 5 loop\n Ada.Text_IO.Put (\"Base\" & Integer'Image (Base) & \":\");\n for N in 1 .. 10 loop\n Ada.Text_IO.Put (' ');\n Float_IO.Put (Item => Van_Der_Corput (N, Base), Exp => 0);\n end loop;\n Ada.Text_IO.New_Line;\n end loop;\nend Main;\n","language":"Ada"},{"code":"BEGIN # show members of the van der Corput sequence in various bases #\n # translated from the C sample #\n\n # sets num and denom to the numerator and denominator of the nth member #\n # of the van der Corput sequence in the specified base #\n PROC vc = ( INT nth, base, REF INT num, denom )VOID:\n BEGIN\n INT p := 0, q := 1, n := nth;\n\n WHILE n /= 0 DO\n p *:= base +:= n MOD base;\n q *:= base;\n n OVERAB base\n OD;\n\n num := p;\n denom := q;\n\n # reduce the numerrator and denominator by their gcd #\n WHILE p /= 0 DO n := p; p := q MOD p; q := n OD;\n num OVERAB q;\n denom OVERAB q\n END # vc # ;\n\n # task #\n FOR b FROM 2 TO 5 DO\n print( ( \"base \", whole( b, 0 ), \":\" ) );\n FOR i FROM 0 TO 9 DO\n INT d, n;\n vc( i, b, n, d );\n IF n /= 0\n THEN print( ( \" \", whole( n, 0 ), \"/\", whole( d, 0 ) ) )\n ELSE print( ( \" 0\" ) )\n FI\n OD;\n print( ( newline ) )\n OD\nEND\n","language":"ALGOL-68"},{"code":"corput: function [num, base][\n result: to :rational 0\n b: 1 // base\n n: num\n while [not? zero? n][\n result: result + b * n % base\n n: n / base\n b: b // base\n ]\n return result\n]\n\nloop 2..5 'bs ->\n print [\"Base\" bs \":\" join.with:\", \" to [:string] map 1..10 'z -> corput z bs]\n","language":"Arturo"},{"code":"SetFormat, FloatFast, 0.5\nfor i, v in [2, 3, 4, 5, 6] {\n seq .= \"Base \" v \": \"\n Loop, 10\n seq .= VanDerCorput(A_Index - 1, v) (A_Index = 10 ? \"`n\" : \", \")\n}\nMsgBox, % seq\n\nVanDerCorput(n, b, r=0) {\n while n\n r += Mod(n, b) * b ** -A_Index, n := n // b\n return, r\n}\n","language":"AutoHotkey"},{"code":"# syntax: GAWK -f VAN_DER_CORPUT_SEQUENCE.AWK\n# converted from BBC BASIC\nBEGIN {\n printf(\"base\")\n for (i=0; i<=9; i++) {\n printf(\" %7d\",i)\n }\n printf(\"\\n\")\n for (base=2; base<=5; base++) {\n printf(\"%-4s\",base)\n for (i=0; i<=9; i++) {\n printf(\" %7.5f\",vdc(i,base))\n }\n printf(\"\\n\")\n }\n exit(0)\n}\nfunction vdc(n,b, s,v) {\n s = 1\n while (n) {\n s *= b\n v += (n % b) / s\n n /= b\n n = int(n)\n }\n return(v)\n}\n","language":"AWK"},{"code":"10 DEFINT A-Z\n20 FOR B=2 TO 5\n30 PRINT USING \"BASE #:\";B;\n40 FOR I=0 TO 9\n50 P=0: Q=1: N=I\n60 IF N=0 GOTO 110\n70 P=P*B+N MOD B\n80 Q=Q*B\n90 N=N\\B\n100 GOTO 60\n110 X=P: Y=Q\n120 IF P=0 GOTO 150\n130 N=P: P=Q MOD P: Q=N\n140 GOTO 120\n150 X=X\\Q\n160 Y=Y\\Q\n170 IF X=0 THEN PRINT \" 0\"; ELSE PRINT USING \" ##/##\";X;Y;\n180 NEXT I\n190 PRINT\n200 NEXT B\n","language":"BASIC"},{"code":"function num_base$(number, base)\n\tif base > 9 then\n\t\tprint \"base not handled by function\"\n\t\tpause 5\n\t\treturn \"\"\n\tend if\n\n\tans$ = \"\"\n\n\twhile number <> 0\n\t\tn = (number mod base)\n\t\tans$ = string(n) + ans$\n\t\tnumber = number \\ base\n\tend while\n\n\tif ans$ = \"\" then ans$ = \"0\"\n\n\treturn \".\" + ans$\nend function\n\nfor k = 2 to 5\n\tprint \"Base = \"; k\n\tfor l = 0 to 12\n\t\tprint ljust(num_base$(l, k), 6);\n\tnext l\n\tprint : print\nnext k\nend\n","language":"BASIC256"},{"code":" @% = &20509\n FOR base% = 2 TO 5\n PRINT \"Base \" ; STR$(base%) \":\"\n FOR number% = 0 TO 9\n PRINT FNvdc(number%, base%);\n NEXT\n PRINT\n NEXT\n END\n\n DEF FNvdc(n%, b%)\n LOCAL v, s%\n s% = 1\n WHILE n%\n s% *= b%\n v += (n% MOD b%) / s%\n n% DIV= b%\n ENDWHILE\n = v\n","language":"BBC-BASIC"},{"code":"/*\n * Return the _n_th term of the van der Corput sequence.\n * Uses the current _ibase_.\n */\ndefine v(n) {\n\tauto c, r, s\n\n\ts = scale\n\tscale = 0 /* to use integer division */\n\n\t/*\n\t * c = count digits of n\n\t * r = reverse the digits of n\n\t */\n\tfor (0; n != 0; n /= 10) {\n\t\tc += 1\n\t\tr = (10 * r) + (n % 10)\n\t}\n\n\t/* move radix point to left of digits */\n\tscale = length(r) + 6\n\tr /= 10 ^ c\n\n\tscale = s\n\treturn r\n}\n\nt = 10\nfor (b = 2; b <= 4; b++) {\n\t\"base \"; b\n\tobase = b\n\tfor (i = 0; i < 10; i++) {\n\t\tibase = b\n\t\t\" \"; v(i)\n\t\tibase = t\n\t}\n\tobase = t\n}\nquit\n","language":"Bc"},{"code":"get \"libhdr\"\n\nlet corput(n, base, num, denom) be\n$( let p = 0 and q = 1\n until n=0\n $( p := p * base + n rem base\n q := q * base\n n := n / base\n $)\n\n !num := p\n !denom := q\n\n until p=0\n $( n := p\n p := q rem p\n q := n\n $)\n\n !num := !num / q\n !denom := !denom / q\n$)\n\nlet writefrac(num, denom) be\n test num=0\n do writes(\" 0\")\n or writef(\" %N/%N\", num, denom)\n\nlet start() be\n$( let num = ? and denom = ?\n for base=2 to 5\n $( writef(\"base %N:\", base)\n for i=0 to 9\n $( corput(i, base, @num, @denom)\n writefrac(num, denom)\n $)\n wrch('*N')\n $)\n$)\n","language":"BCPL"},{"code":"#include <stdio.h>\n\nvoid vc(int n, int base, int *num, int *denom)\n{\n int p = 0, q = 1;\n\n while (n) {\n p = p * base + (n % base);\n q *= base;\n n /= base;\n }\n\n *num = p;\n *denom = q;\n\n while (p) { n = p; p = q % p; q = n; }\n *num /= q;\n *denom /= q;\n}\n\nint main()\n{\n int d, n, i, b;\n for (b = 2; b < 6; b++) {\n printf(\"base %d:\", b);\n for (i = 0; i < 10; i++) {\n vc(i, b, &n, &d);\n if (n) printf(\" %d/%d\", n, d);\n else printf(\" 0\");\n }\n printf(\"\\n\");\n }\n\n return 0;\n}\n","language":"C"},{"code":"#include <cmath>\n#include <iostream>\n\ndouble vdc(int n, double base = 2)\n{\n double vdc = 0, denom = 1;\n while (n)\n {\n vdc += fmod(n, base) / (denom *= base);\n n /= base; // note: conversion from 'double' to 'int'\n }\n return vdc;\n}\n\nint main()\n{\n for (double base = 2; base < 6; ++base)\n {\n std::cout << \"Base \" << base << \"\\n\";\n for (int n = 0; n < 10; ++n)\n {\n std::cout << vdc(n, base) << \" \";\n }\n std::cout << \"\\n\\n\";\n }\n}\n","language":"C++"},{"code":"using System;\nusing System.Collections.Generic;\nusing System.Linq;\nusing System.Text;\n\nnamespace VanDerCorput\n{\n /// <summary>\n /// Computes the Van der Corput sequence for any number base.\n /// The numbers in the sequence vary from zero to one, including zero but excluding one.\n /// The sequence possesses low discrepancy.\n /// Here are the first ten terms for bases 2 to 5:\n ///\n /// base 2: 0 1/2 1/4 3/4 1/8 5/8 3/8 7/8 1/16 9/16\n /// base 3: 0 1/3 2/3 1/9 4/9 7/9 2/9 5/9 8/9 1/27\n /// base 4: 0 1/4 1/2 3/4 1/16 5/16 9/16 13/16 1/8 3/8\n /// base 5: 0 1/5 2/5 3/5 4/5 1/25 6/25 11/25 16/25 21/25\n /// </summary>\n /// <see cref=\"http://rosettacode.org/wiki/Van_der_Corput_sequence\"/>\n public class VanDerCorputSequence: IEnumerable<Tuple<long,long>>\n {\n /// <summary>\n /// Number base for the sequence, which must bwe two or more.\n /// </summary>\n public int Base { get; private set; }\n\n /// <summary>\n /// Maximum number of terms to be returned by iterator.\n /// </summary>\n public long Count { get; private set; }\n\n /// <summary>\n /// Construct a sequence for the given base.\n /// </summary>\n /// <param name=\"iBase\">Number base for the sequence.</param>\n /// <param name=\"count\">Maximum number of items to be returned by the iterator.</param>\n public VanDerCorputSequence(int iBase, long count = long.MaxValue) {\n if (iBase < 2)\n throw new ArgumentOutOfRangeException(\"iBase\", \"must be two or greater, not the given value of \" + iBase);\n Base = iBase;\n Count = count;\n }\n\n /// <summary>\n /// Compute nth term in the Van der Corput sequence for the base specified in the constructor.\n /// </summary>\n /// <param name=\"n\">The position in the sequence, which may be zero or any positive number.</param>\n /// This number is always an integral power of the base.</param>\n /// <returns>The Van der Corput sequence value expressed as a Tuple containing a numerator and a denominator.</returns>\n public Tuple<long,long> Compute(long n)\n {\n long p = 0, q = 1;\n long numerator, denominator;\n while (n != 0)\n {\n p = p * Base + (n % Base);\n q *= Base;\n n /= Base;\n }\n numerator = p;\n denominator = q;\n while (p != 0)\n {\n n = p;\n p = q % p;\n q = n;\n }\n numerator /= q;\n denominator /= q;\n return new Tuple<long,long>(numerator, denominator);\n }\n\n /// <summary>\n /// Compute nth term in the Van der Corput sequence for the given base.\n /// </summary>\n /// <param name=\"iBase\">Base to use for the sequence.</param>\n /// <param name=\"n\">The position in the sequence, which may be zero or any positive number.</param>\n /// <returns>The Van der Corput sequence value expressed as a Tuple containing a numerator and a denominator.</returns>\n public static Tuple<long, long> Compute(int iBase, long n)\n {\n var seq = new VanDerCorputSequence(iBase);\n return seq.Compute(n);\n }\n\n /// <summary>\n /// Iterate over the Van Der Corput sequence.\n /// The first value in the sequence is always zero, regardless of the base.\n /// </summary>\n /// <returns>A tuple whose items are the Van der Corput value given as a numerator and denominator.</returns>\n public IEnumerator<Tuple<long, long>> GetEnumerator()\n {\n long iSequenceIndex = 0L;\n while (iSequenceIndex < Count)\n {\n yield return Compute(iSequenceIndex);\n iSequenceIndex++;\n }\n }\n\n System.Collections.IEnumerator System.Collections.IEnumerable.GetEnumerator()\n {\n return GetEnumerator();\n }\n }\n\n class Program\n {\n static void Main(string[] args)\n {\n TestBasesTwoThroughFive();\n\n Console.WriteLine(\"Type return to continue...\");\n Console.ReadLine();\n }\n\n static void TestBasesTwoThroughFive()\n {\n foreach (var seq in Enumerable.Range(2, 5).Select(x => new VanDerCorputSequence(x, 10))) // Just the first 10 elements of the each sequence\n {\n Console.Write(\"base \" + seq.Base + \":\");\n foreach(var vc in seq)\n Console.Write(\" \" + vc.Item1 + \"/\" + vc.Item2);\n Console.WriteLine();\n }\n }\n }\n}\n","language":"C-sharp"},{"code":"(defn van-der-corput\n \"Get the nth element of the van der Corput sequence.\"\n ([n]\n ;; Default base = 2\n (van-der-corput n 2))\n ([n base]\n (let [s (/ 1 base)] ;; A multiplicand to shift to the right of the decimal.\n ;; We essentially want to reverse the digits of n and put them after the\n ;; decimal point. So, we repeatedly pull off the lowest digit of n, scale\n ;; it to the right of the decimal point, and accumulate that.\n (loop [sum 0\n n n\n scale s]\n (if (zero? n)\n sum ;; Base case: no digits left, so we're done.\n (recur (+ sum (* (rem n base) scale)) ;; Accumulate the least digit\n (quot n base) ;; Drop a digit of n\n (* scale s))))))) ;; Move farther past the decimal\n\n(clojure.pprint/print-table\n (cons :base (range 10)) ;; column headings\n (for [base (range 2 6)] ;; rows\n (into {:base base}\n (for [n (range 10)] ;; table entries\n [n (van-der-corput n base)]))))\n","language":"Clojure"},{"code":"vc = proc (n, base: int) returns (int, int)\n p: int := 0\n q: int := 1\n while n ~= 0 do\n p := p * base + n // base\n q := q * base\n n := n / base\n end\n num: int := p\n denom: int := q\n while p ~= 0 do\n p, q := q // p, p\n end\n return(num/q, denom/q)\nend vc\n\nprint_frac = proc (po: stream, num, denom: int)\n if num=0 then\n stream$puts(po, \" 0\")\n else\n stream$puts(po, \" \")\n stream$putright(po, int$unparse(num), 2)\n stream$puts(po, \"/\")\n stream$putright(po, int$unparse(denom), 2)\n end\nend print_frac\n\nstart_up = proc ()\n po: stream := stream$primary_output()\n for base: int in int$from_to(2,5) do\n stream$puts(po, \"base \" || int$unparse(base) || \":\")\n for i: int in int$from_to(0, 9) do\n n, d: int := vc(i, base)\n print_frac(po, n, d)\n end\n stream$putl(po, \"\")\n end\nend start_up\n","language":"CLU"},{"code":"(defun van-der-Corput (n base)\n (loop for d = 1 then (* d base) while (<= d n)\n\tfinally\n\t(return (/ (parse-integer\n\t\t (reverse (write-to-string n :base base))\n\t\t :radix base)\n\t\t d))))\n\n(loop for base from 2 to 5 do\n (format t \"Base ~a: ~{~6a~^~}~%\" base\n\t (loop for i to 10 collect (van-der-Corput i base))))\n","language":"Common-Lisp"},{"code":"include \"cowgol.coh\";\n\nsub vc(n: uint16, base: uint16): (num: uint16, denom: uint16) is\n var p: uint16 := 0;\n var q: uint16 := 1;\n\n while n != 0 loop\n p := p * base + n % base;\n q := q * base;\n n := n / base;\n end loop;\n\n num := p;\n denom := q;\n\n while p != 0 loop\n n := p;\n p := q % p;\n q := n;\n end loop;\n\n num := num / q;\n denom := denom / q;\nend sub;\n\nsub printfrac(num: uint16, denom: uint16) is\n if num == 0 then\n print(\" 0\");\n else\n print(\" \");\n print_i16(num);\n print(\"/\");\n print_i16(denom);\n end if;\nend sub;\n\nvar i: uint16;\nvar base: uint16;\nvar num: uint16;\nvar denom: uint16;\n\nbase := 2;\nwhile base < 6 loop\n print(\"base \");\n print_i16(base);\n print(\":\");\n i := 0;\n while i < 10 loop\n (num, denom) := vc(i, base);\n printfrac(num, denom);\n i := i + 1;\n end loop;\n print_nl();\n base := base + 1;\nend loop;\n","language":"Cowgol"},{"code":"double vdc(int n, in double base=2.0) pure nothrow @safe @nogc {\n double vdc = 0.0, denom = 1.0;\n while (n) {\n denom *= base;\n vdc += (n % base) / denom;\n n /= base;\n }\n return vdc;\n}\n\nvoid main() {\n import std.stdio, std.algorithm, std.range;\n\n foreach (immutable b; 2 .. 6)\n writeln(\"\\nBase \", b, \": \", 10.iota.map!(n => vdc(n, b)));\n}\n","language":"D"},{"code":"function VanDerCorput(N,Base: integer): double;\n{Calculate binary value for numbers right of decimal}\nvar Value,Exponent,Digit: integer;\nbegin\nValue:= N; Result:= 0; Exponent:= -1;\n{D1 * Base^-1 + D2 * Base^-2 + D3 * Base^-3}\nwhile Value > 0 do\n\tbegin\n\t{Get digit in specified base}\n\tDigit:=Value mod Base;\n\t{Digit * Base^-Exponent}\n\tResult:=Result + Digit * Power(Base,Exponent);\n\t{Divide by base to put next digit in place}\n\tValue:= Value div Base;\n\t{Next exponent}\n\tDec(Exponent);\n\tend;\nend;\n\n\nprocedure ShowVanDerCorput(Memo: TMemo);\n{Show Vander Coput numbers for bases 2..8 and items 1..9 }\nvar Base,N: integer;\nvar V: double;\nvar S: string;\nbegin\nS:='';\nfor Base:=2 to 8 do\n\tbegin\n\tS:=S+Format('Base %D:',[Base]);\n\tfor N:=1 to 10 do\n\t\tbegin\n\t\tV:=VanDerCorput(N,Base);\n\t\tS:=S+Format(' %1.5f',[V]);\n\t\tend;\n\tS:=S+CRLF;\n\tend;\nMemo.Lines.Add(S);\nend;\n","language":"Delphi"},{"code":"func vdc b n .\n s = 1\n while n > 0\n s *= b\n m = n mod b\n v += m / s\n n = n div b\n .\n return v\n.\nfor b = 2 to 5\n write \"base \" & b & \":\"\n for n range0 10\n write \" \" & vdc b n\n .\n print \"\"\n.\n","language":"EasyLang"},{"code":"[Van der Corput sequence for Rosetta Code.\n EDSAC solution, Initial Orders 2.]\n\n[Library subroutine M3 - prints header at load time and is then overwritten.\n Here, the last character sets the teleprinter to figures.]\n PFGKIFAFRDLFUFOFE@A6FG@E8FEZPF\n *VAN!DER!CORPUT!SEQUENCE@A*BIT!!!#35A*BIT@&#\n ..PZ [blank tape then re-sync]\n\n[Define load addresses]\n T55K P100F [V parameter: van der Corput subroutines]\n T51K P64F [G parameter: print subroutine]\n T47K P400F [M parameter: main routine]\n\n[Subroutines to return n'th element of van der Corput sequence.\n 17-bit version: Call by GV, pass n in 0F (not preserved), result in 4F.\n 35-bit version: Call by G1V, pass n in 0D (not preserved), result in 4D.]\n E25K TV GK\n G2@ [jump to 17-bit version]\n G25@ [jump to 35-bit version]\n[17-bit version.\n On EDSAC, it's a matter of reversing the bits after the binary point\n To save time, we use a table to reverse the 16 bits in groups of 4.]\n [2] A3F T24@ [plant return link as usual]\n H5 6@ [set mult reg to 0...01111 binary]\n A55@ T4F [set marker bit 0...01 in result]\n [7] A4F L4F T4F [shift result 4 left]\n CF [acc := next 4 bits of n]\n LD [shift into address field]\n A58@ T14@ [plant A order to load from table]\n [14] AF [{planted) load bits from table]\n A4F [add to result]\n G22@ [jump out if marker bit has reached sign bit]\n T4F [update result]\n AF R4F TF [shift n 4 right]\n E7@ [always loop back]\n [22] S57@ [done, remove marker bit]\n T4F [store final result]\n [24] ZF [(planted) jump to return to caller]\n\n[35-bit version. Very similar to the 17-bit version, except that\n after reversing 8 groups of 4, there are 2 bits left over,\n which require separate treatment.]\n [25] A3F T54@ [plant return link as usual]\n H56@ [set mult reg to 0...01111 binary]\n YF L2F [set marker bit 0...0100 in result]\n [30] L4F T4D [shift result 4 left]\n CF LD A58@ T36@ AF A4F T4F [update from table as in 17-bit version]\n ADR4FTD [shift n 4 right]\n A4D [load result]\n E30@ [if marker bit hasn't reached sign bit, loop back]\n[Last 2 bits]\n [44] L1FT4D [shift result 2 right]\n CF LD A58@ T50@ [plant A order as in 17-bit version]\n [50] AF [Planted) load bits from table]\n R1F A4F T4F [shift table entry 2 right and add to result]\n [54] ZF [(planted) jump to return to caller]\n[Constants]\n [55] PD [17-bit 1]\n [56] P7D [17-bit 15]\n [57] K4096F [17-bit 10...0 binary]\n [58] A59@ [order to load from table{0}]\n[Table to reverse group of 4 bits, e.g. table{0010b} = 0100b]\n [59] PFP4FP2FP6FP1FP5FP3FP7FPDP4DP2DP6DP1DP5DP3DP7D\n\n[Library subroutine P1 to print number in range 0 <= x < 1.\n Caller must print leading '0.' if required. 21 storage locations.]\n E25K TG\n GKA18@U17@S20@T5@H19@PFT5@VDUFOFFFSFL4FTDA5@A2FG6@EFU3FJFM1F\n\n[Main routine]\n E25K TM GK\n [0] PF PF [n, 35 bits, must be at even address]\n [2] PF [negative count of terms]\n [3] P10F [<=== EDIT number of terms, in address field]\n [4] PD [17-bit integer 1]\n [5] MF [dot (in figures mode)]\n [6] @F [carriage return]\n [7] &F [line feed]\n [8] !F [space character]\n [9] K4096F [null character]\n\n[Enter with acc = 0]\n [10] T#@ [n := 0]\n S3@ T2@ [initialize negative count]\n [13] A@ TF [pass 17-bit n in 0F]\n [15] A15@ GV [call 17-bit van der Corput routine]\n TD [clear 0D, including sandwich bit]\n A4F T1F [extend 17-bit result to 35 bits in 0D]\n O4@ O5@ [print '0.']\n [22] A22@ GG P5F [print result to 5 decimals]\n O8@ O8@ [print 2 spaces]\n A#@ TD [pass 35-bit n in 0D]\n [29] A29@ G1V [call 35-bit van der Corput routine]\n A4D TD [pass result in 0D]\n O4@ O5@ [print '0.']\n [35] A35@ GG P10F [print result to 10 decimals]\n O6@ O7@ [print CR LF]\n A2@ A2F [inc negative count]\n E48@ [jump out if count = 0]\n T2@ [update count]\n A@ A4@ T@ [inc n]\n E13@ [loop back]\n [48] O9@ [print null to flush teleprinter buffer]\n ZF [stop]\n\n E10Z [define entry point]\n PF [acc = 0 on entry]\n[end]\n","language":"EDSAC-order-code"},{"code":"open random number list\n\nvdc bs n = vdc' 0.0 1.0 n\n where vdc' v d n\n | n > 0 = vdc' v' d' n'\n | else = v\n where\n d' = d * bs\n rem = n % bs\n n' = truncate (n / bs)\n v' = v + rem / d'\n","language":"Ela"},{"code":"take 10 <| map' (vdc 2.0) [1..]\n","language":"Ela"},{"code":"defmodule Van_der_corput do\n def sequence( n, base \\\\ 2 ) do\n \"0.\" <> (Integer.to_string(n, base) |> String.reverse )\n end\n\n def float( n, base \\\\ 2 ) do\n Integer.digits(n, base) |> Enum.reduce(0, fn i,acc -> (i + acc) / base end)\n end\n\n def fraction( n, base \\\\ 2 ) do\n str = Integer.to_string(n, base) |> String.reverse\n denominator = Enum.reduce(1..String.length(str), 1, fn _,acc -> acc*base end)\n reduction( String.to_integer(str, base), denominator )\n end\n\n defp reduction( 0, _ ), do: \"0\"\n defp reduction( numerator, denominator ) do\n gcd = gcd( numerator, denominator )\n \"#{ div(numerator, gcd) }/#{ div(denominator, gcd) }\"\n end\n\n defp gcd( a, 0 ), do: a\n defp gcd( a, b ), do: gcd( b, rem(a, b) )\nend\n\nfuns = [ {\"Float(Base):\", &Van_der_corput.sequence/2},\n {\"Float(Decimal):\", &Van_der_corput.float/2 },\n {\"Fraction:\", &Van_der_corput.fraction/2} ]\nEnum.each(funs, fn {title, fun} ->\n IO.puts title\n Enum.each(2..5, fn base ->\n IO.puts \" Base #{ base }: #{ Enum.map_join(0..9, \", \", &fun.(&1, base)) }\"\n end)\nend)\n","language":"Elixir"},{"code":"-module( van_der_corput ).\n\n-export( [sequence/1, sequence/2, task/0] ).\n\nsequence( N ) -> sequence( N, 2 ).\n\nsequence( 0, _Base ) -> 0.0;\nsequence( N, Base ) -> erlang:list_to_float( \"0.\" ++ lists:flatten([erlang:integer_to_list(X) || X <- sequence_loop(N, Base)]) ).\n\ntask() -> [task(X) || X <- lists:seq(2, 5)].\n\n\n\nsequence_loop( 0, _Base ) -> [];\nsequence_loop( N, Base ) ->\n\tNew_n = N div Base,\n\tDigit = N rem Base,\n\t[Digit | sequence_loop( New_n, Base )].\n\ntask( Base ) ->\n\tio:fwrite( \"Base ~p:\", [Base] ),\n\t[io:fwrite( \" ~p\", [sequence(X, Base)] ) || X <- lists:seq(0, 9)],\n\tio:fwrite( \"~n\" ).\n","language":"Erlang"},{"code":"PROGRAM VAN_DER_CORPUT\n\n!\n! for rosettacode.org\n!\n\nPROCEDURE VDC(N%,B%->RES)\n LOCAL V,S%\n S%=1\n WHILE N%>0 DO\n S%*=B%\n V+=(N% MOD B%)/S%\n N%=N% DIV B%\n END WHILE\n RES=V\nEND PROCEDURE\n\nBEGIN\n FOR BASE%=2 TO 5 DO\n PRINT(\"Base\";STR$(BASE%);\":\")\n FOR NUMBER%=0 TO 9 DO\n VDC(NUMBER%,BASE%->RES)\n WRITE(\"#.##### \";RES;)\n END FOR\n PRINT\n END FOR\nEND PROGRAM\n","language":"ERRE"},{"code":"function vdc(integer n, atom base)\n atom vdc, denom, rem\n vdc = 0\n denom = 1\n while n do\n denom *= base\n rem = remainder(n,base)\n n = floor(n/base)\n vdc += rem / denom\n end while\n return vdc\nend function\n\nfor i = 2 to 5 do\n printf(1,\"Base %d\\n\",i)\n for j = 0 to 9 do\n printf(1,\"%g \",vdc(j,i))\n end for\n puts(1,\"\\n\\n\")\nend for\n","language":"Euphoria"},{"code":"open System\n\nlet vdc n b =\n let rec loop n denom acc =\n if n > 0l then\n let m, remainder = Math.DivRem(n, b)\n loop m (denom * b) (acc + (float remainder) / (float (denom * b)))\n else acc\n loop n 1 0.0\n\n\n[<EntryPoint>]\nlet main argv =\n printfn \"%A\" [ for n in 0 .. 9 -> (vdc n 2) ]\n printfn \"%A\" [ for n in 0 .. 9 -> (vdc n 5) ]\n 0\n","language":"F-Sharp"},{"code":"USING: formatting fry io kernel math math.functions math.parser\nmath.ranges sequences ;\nIN: rosetta-code.van-der-corput\n\n: vdc ( n base -- x )\n [ >base string>digits <reversed> ]\n [ nip '[ 1 + neg _ swap ^ * ] ] 2bi map-index sum ;\n\n: vdc-demo ( -- )\n 2 5 [a,b] [\n dup \"Base %d: \" printf 10 <iota>\n [ swap vdc \"%-5u \" printf ] with each nl\n ] each ;\n\nMAIN: vdc-demo\n","language":"Factor"},{"code":": fvdc ( base n -- f )\n 0e 1e ( F: vdc denominator )\n begin dup while\n over s>d d>f f*\n over /mod ( base rem n )\n swap s>d d>f fover f/\n frot f+ fswap\n repeat 2drop fdrop ;\n\n: test 10 0 do 2 i fvdc cr f. loop ;\n","language":"Forth"},{"code":" FUNCTION VDC(N,BASE)\t!Calculates a Van der Corput number...\nConverts 1234 in decimal to 4321 in V, and P = 10000.\n INTEGER N\t!For this integer,\n INTEGER BASE\t!In this base.\n INTEGER I\t!A copy of N that can be damaged.\n INTEGER P\t!Successive powers of BASE.\n INTEGER V\t!Accumulates digits.\n P = 1\t\t! = BASE**0\n V = 0\t\t!Start with no digits, as if N = 0.\n I = N\t\t!Here we go.\n DO WHILE (I .NE. 0)\t!While something remains,\n V = V*BASE + MOD(I,BASE)\t!Extract its low-order digit.\n I = I/BASE\t\t\t!Reduce it by a power.\n P = P*BASE\t\t\t!And track the power.\n END DO\t\t\t!Thus extract the digits in reverse order: right-to-left.\n VDC = V/FLOAT(P)\t!The power is one above the highest digit.\n END FUNCTION VDC\t!Numerology is weird.\n\n PROGRAM POKE\n INTEGER FIRST,LAST\t!Might as well document some constants.\n PARAMETER (FIRST = 0,LAST = 9)\t!Thus, the first ten values.\n INTEGER I,BASE\t\t!Steppers.\n REAL VDC\t\t\t!Stop the compiler moaning about undeclared items.\n\n WRITE (6,1) FIRST,LAST,(I, I = FIRST,LAST)\t!Announce.\n 1 FORMAT (\"Calculates values \",I0,\" to \",I0,\" of the \",\n 1 \"Van der Corput sequence, in various bases.\"/\n 2 \"Base\",666I9)\n\n DO BASE = 2,13\t!A selection of bases.\n WRITE (6,2) BASE,(VDC(I,BASE), I = FIRST,LAST)\t!Show the specified span.\n 2 FORMAT (I4,666F9.6)\t!Aligns with FORMAT 1.\n END DO\t\t!On to the next base.\n\n END\n","language":"Fortran"},{"code":"' version 03-12-2016\n' compile with: fbc -s console\n\nFunction num_base(number As ULongInt, _base_ As UInteger) As String\n\n If _base_ > 9 Then\n Print \"base not handled by function\"\n Sleep 5000\n Return \"\"\n End If\n\n Dim As ULongInt n\n Dim As String ans\n\n While number <> 0\n n = number Mod _base_\n ans = Str(n) + ans\n number = number \\ _base_\n Wend\n\n If ans = \"\" Then ans = \"0\"\n\n Return \".\" + ans\n\nEnd Function\n\n' ------=< MAIN >=------\n\nDim As ULong k, l\nFor k = 2 To 5\n Print \"Base = \"; k\n For l = 0 To 12\n Print left(num_base(l, k) + \" \",6);\n Next\n Print : print\nNext\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 v2(n uint) (r float64) {\n p := .5\n for n > 0 {\n if n&1 == 1 {\n r += p\n }\n p *= .5\n n >>= 1\n }\n return\n}\n\nfunc newV(base uint) func(uint) float64 {\n invb := 1 / float64(base)\n return func(n uint) (r float64) {\n p := invb\n for n > 0 {\n r += p * float64(n%base)\n p *= invb\n n /= base\n }\n return\n }\n}\n\nfunc main() {\n fmt.Println(\"Base 2:\")\n for i := uint(0); i < 10; i++ {\n fmt.Println(i, v2(i))\n }\n fmt.Println(\"Base 3:\")\n v3 := newV(3)\n for i := uint(0); i < 10; i++ {\n fmt.Println(i, v3(i))\n }\n}\n","language":"Go"},{"code":"import Data.Ratio (Rational(..), (%), numerator, denominator)\nimport Data.List (unfoldr)\nimport Text.Printf (printf)\n\n-- A wrapper type for Rationals to make them look nicer when we print them.\nnewtype Rat =\n Rat Rational\n\ninstance Show Rat where\n show (Rat n) = show (numerator n) <> ('/' : show (denominator n))\n\n-- Convert a list of base b digits to its corresponding number.\n-- We assume the digits are valid base b numbers and that\n-- their order is from least to most significant.\ndigitsToNum :: Integer -> [Integer] -> Integer\ndigitsToNum b = foldr1 (\\d acc -> b * acc + d)\n\n-- Convert a number to the list of its base b digits.\n-- The order will be from least to most significant.\nnumToDigits :: Integer -> Integer -> [Integer]\nnumToDigits _ 0 = [0]\nnumToDigits b n = unfoldr step n\n where\n step 0 = Nothing\n step m =\n let (q, r) = m `quotRem` b\n in Just (r, q)\n\n-- Return the n'th element in the base b van der Corput sequence.\n-- The base must be ≥ 2.\nvdc :: Integer -> Integer -> Rat\nvdc b n\n | b < 2 = error \"vdc: base must be ≥ 2\"\n | otherwise =\n let ds = reverse $ numToDigits b n\n in Rat (digitsToNum b ds % b ^ length ds)\n\n-- Each base followed by a specified range of van der Corput numbers.\nprintVdcRanges :: ([Integer], [Integer]) -> IO ()\nprintVdcRanges (bases, nums) =\n mapM_\n putStrLn\n [ printf \"Base %d:\" b <> concatMap (printf \" %5s\" . show) rs\n | b <- bases\n , let rs = map (vdc b) nums ]\n\nmain :: IO ()\nmain = do\n -- Small bases:\n printVdcRanges ([2, 3, 4, 5], [0 .. 9])\n putStrLn []\n\n -- Base 123:\n printVdcRanges ([123], [50,100 .. 300])\n","language":"Haskell"},{"code":"procedure main(A)\n base := integer(get(A)) | 2\n every writes(round(vdc(0 to 9,base),10),\" \")\n write()\nend\n\nprocedure vdc(n, base)\n e := 1.0\n x := 0.0\n while x +:= 1(((0 < n) % base) / (e *:= base), n /:= base)\n return x\nend\n\nprocedure round(n,d)\n places := 10 ^ d\n return real(integer(n*places + 0.5)) / places\nend\n","language":"Icon"},{"code":"procedure vdc(n, base)\n s1 := create |((0 < 1(.n, n /:= base)) % base)\n s2 := create 2(e := 1.0, |(e *:= base))\n every (result := 0) +:= |s1() / s2()\n return result\nend\n","language":"Icon"},{"code":"vdc=: ([ %~ %@[ #. #.inv)\"0 _\n","language":"J"},{"code":" 2 vdc i.10 NB. 1st 10 nums of Van der Corput sequence in base 2\n0 0.5 0.25 0.75 0.125 0.625 0.375 0.875 0.0625 0.5625\n 2x vdc i.10 NB. as above but using rational nums\n0 1r2 1r4 3r4 1r8 5r8 3r8 7r8 1r16 9r16\n 2 3 4 5x vdc i.10 NB. 1st 10 nums of Van der Corput sequence in bases 2 3 4 5\n0 1r2 1r4 3r4 1r8 5r8 3r8 7r8 1r16 9r16\n0 1r3 2r3 1r9 4r9 7r9 2r9 5r9 8r9 1r27\n0 1r4 1r2 3r4 1r16 5r16 9r16 13r16 1r8 3r8\n0 1r5 2r5 3r5 4r5 1r25 6r25 11r25 16r25 21r25\n","language":"J"},{"code":"public class VanDerCorput{\n\tpublic static double vdc(int n){\n\t\tdouble vdc = 0;\n\t\tint denom = 1;\n\t\twhile(n != 0){\n\t\t\tvdc += n % 2.0 / (denom *= 2);\n\t\t\tn /= 2;\n\t\t}\n\t\treturn vdc;\n\t}\n\t\n\tpublic static void main(String[] args){\n\t\tfor(int i = 0; i <= 10; i++){\n\t\t\tSystem.out.println(vdc(i));\n\t\t}\n\t}\n}\n","language":"Java"},{"code":"# vdc(base) converts an input decimal integer to a decimal number based on the van der\n# Corput sequence using base 'base', e.g. (4 | vdc(2)) is 0.125.\n#\ndef vdc(base):\n\n # The helper function converts a stream of residuals to a decimal,\n # e.g. if base is 2, then decimalize( (0,0,1) ) yields 0.125\n def decimalize(stream):\n reduce stream as $d # state: [accumulator, power]\n ( [0, 1/base];\n .[1] as $power | [ .[0] + ($d * $power), $power / base] )\n | .[0];\n\n if . == 0 then 0\n else decimalize(recurse( if . == 0 then empty else ./base | floor end ) % base)\n end ;\n","language":"Jq"},{"code":"def 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\nrange(2;6) | . as $base | \"Base \\(.): \\( [ range(0;11) | vdc($base)|round(1000) ] )\"\n","language":"Jq"},{"code":"$ jq -n -f -c -r van_der_corput_sequence.jq\nBase 2: [0,0.5,0.25,0.75,0.125,0.625,0.375,0.875,0.063,0.563,0.313]\nBase 3: [0,0.333,0.667,0.111,0.444,0.778,0.222,0.556,0.889,0.037,0.37]\nBase 4: [0,0.25,0.5,0.75,0.063,0.313,0.563,0.813,0.125,0.375,0.625]\nBase 5: [0,0.2,0.4,0.6,0.8,0.04,0.24,0.44,0.64,0.84,0.08]\n","language":"Jq"},{"code":"using Printf\n\nvandercorput(num::Integer, base::Integer) = sum(d * Float64(base) ^ -ex for (ex, d) in enumerate(digits(num, base = base)))\n\nfor base in 2:9\n @printf(\"%10s %i:\", \"Base\", base)\n for num in 0:9 @printf(\"%7.3f\", vandercorput(num, base)) end\n println(\" [...]\")\nend\n","language":"Julia"},{"code":"// version 1.1.2\n\ndata class Rational(val num: Int, val denom: Int)\n\nfun vdc(n: Int, base: Int): Rational {\n var p = 0\n var q = 1\n var nn = n\n while (nn != 0) {\n p = p * base + nn % base\n q *= base\n nn /= base\n }\n val num = p\n val denom = q\n while (p != 0) {\n nn = p\n p = q % p\n q = nn\n }\n return Rational(num / q, denom / q)\n}\n\nfun main(args: Array<String>) {\n for (b in 2..5) {\n print(\"base $b:\")\n for (i in 0..9) {\n val(num, denom) = vdc(i, b)\n if (num != 0) print(\" $num/$denom\")\n else print(\" 0\")\n }\n println()\n }\n}\n","language":"Kotlin"},{"code":"function vdc(n, base)\n local digits = {}\n while n ~= 0 do\n local m = math.floor(n / base)\n table.insert(digits, n - m * base)\n n = m\n end\n m = 0\n for p, d in pairs(digits) do\n m = m + math.pow(base, -p) * d\n end\n return m\nend\n","language":"Lua"},{"code":"function vdc( nth, base ) -- returns the numerator & denominator of the sequence element n in base\n local p, q, n = 0, 1, nth\n while n ~= 0 do\n p = p * base\n p = p + n % base;\n q = q * base;\n n = math.floor( n / base )\n end\n local num, denom = p, q;\n -- reduce the numerator and denominator by their gcd\n while p ~= 0 do\n n = p\n p = q % p\n q = n\n end\n num = math.floor( num / q )\n denom = math.floor( denom / q )\n return num, denom\nend\nfor b = 2,5 do\n io.write( \"base \", b, \": \" )\n for n = 0,9 do\n local num, denom = vdc( n, b )\n io.write( \" \", num ) if num ~= 0 then io.write( \"/\", denom ) end\n end\n io.write( \"\\n\" )\nend\n","language":"Lua"},{"code":"Halton:=proc(n,b)\n local i:=n,k:=1,s:=0,r;\n while i>0 do\n k/=b;\n i:=iquo(i,b,'r');\n s+=k*r\n od;\n s\nend;\n\nmap(Halton,[$1..10],2);\n# [1/2, 1/4, 3/4, 1/8, 5/8, 3/8, 7/8, 1/16, 9/16, 5/16]\n\nmap(Halton,[$1..10],3);\n# [1/3, 2/3, 1/9, 4/9, 7/9, 2/9, 5/9, 8/9, 1/27, 10/27]\n\nmap(Halton,[$1..10],4);\n# [1/4, 1/2, 3/4, 1/16, 5/16, 9/16, 13/16, 1/8, 3/8, 5/8]\n\nmap(Halton,[$1..10],5);\n[1/5, 2/5, 3/5, 4/5, 1/25, 6/25, 11/25, 16/25, 21/25, 2/25]\n","language":"Maple"},{"code":"VanDerCorput[n_,base_:2]:=Table[\n FromDigits[{Reverse[IntegerDigits[k,base]],0},base],\n{k,n}]\nVanDerCorput[10,2]\nVanDerCorput[10,3]\nVanDerCorput[10,4]\nVanDerCorput[10,5]\n","language":"Mathematica"},{"code":" function x = corput (n)\n b = dec2bin(1:n)-'0'; % generate sequence of binary numbers from 1 to n\n l = size(b,2); % get number of binary digits\n w = (1:l)-l-1; % 2.^w are the weights\n x = b * ( 2.^w'); % matrix times vector multiplication for\n end;\n","language":"MATLAB"},{"code":"/* convert a decimal integer to a list of digits in base `base' */\ndec2digits(d, base):= block([digits: []],\n while (d>0) do block([newdi: mod(d, base)],\n digits: cons(newdi, digits),\n d: round( (d - newdi) / base)),\n digits)$\n\ndec2digits(123, 10);\n/* [1, 2, 3] */\ndec2digits( 8, 2);\n/* [1, 0, 0, 0] */\n","language":"Maxima"},{"code":"/* convert a list of digits in base `base' to a decimal integer */\ndigits2dec(l, base):= block([s: 0, po: 1],\n for di in reverse(l) do (s: di*po + s, po: po*base),\n s)$\n\ndigits2dec([1, 2, 3], 10);\n/* 123 */\ndigits2dec([1, 0, 0, 0], 2);\n/* 8 */\n","language":"Maxima"},{"code":"vdc(n, base):= makelist(\n digits2dec(\n dec2digits(k, base),\n 1/base) / base,\n k, n);\n\nvdc(10, 2);\n/*\n 1 1 3 1 5 3 7 1 9 5\n(%o123) [-, -, -, -, -, -, -, --, --, --]\n 2 4 4 8 8 8 8 16 16 16\n*/\n\nvdc(10, 5);\n/*\n 1 2 3 4 1 6 11 16 21 2\n(%o124) [-, -, -, -, --, --, --, --, --, --]\n 5 5 5 5 25 25 25 25 25 25\n*/\n","language":"Maxima"},{"code":"/* 11 in decimal is */\ndigits: digits2dec([box(1), box(0), box(1), box(1)], box(2));\naux: expand(digits2dec(digits, 1/base) / base)$\nsimp: false$\n/* reflected this would become ... */\nsubst(box(2), base, aux);\nsimp: true$\n\n/*\n\n 3 2\n \"\"\" \"\"\" \"\"\" \"\"\" \"\"\" \"\"\" \"\"\"\n(%o126) \"2\" \"1\" + \"2\" \"0\" + \"2\" \"1\" + \"1\"\n \"\"\" \"\"\" \"\"\" \"\"\" \"\"\" \"\"\" \"\"\"\n\n - 4 - 3 - 2 - 1\n \"\"\" \"\"\" \"\"\" \"\"\" \"\"\" \"\"\" \"\"\" \"\"\"\n(%o129) \"1\" \"2\" + \"0\" \"2\" + \"1\" \"2\" + \"1\" \"2\"\n \"\"\" \"\"\" \"\"\" \"\"\" \"\"\" \"\"\" \"\"\" \"\"\"\n\n*/\n","language":"Maxima"},{"code":"MODULE Sequence;\nFROM FormatString IMPORT FormatString;\nFROM Terminal IMPORT WriteString,WriteLn,ReadChar;\n\nPROCEDURE vc(n,base : INTEGER; VAR num,denom : INTEGER);\nVAR p,q : INTEGER;\nBEGIN\n p := 0;\n q := 1;\n\n WHILE n#0 DO\n p := p * base + (n MOD base);\n q := q * base;\n n := n DIV base\n END;\n\n num := p;\n denom := q;\n\n WHILE p#0 DO\n n := p;\n p := q MOD p;\n q := n\n END;\n\n num := num DIV q;\n denom := denom DIV q\nEND vc;\n\nVAR\n buf : ARRAY[0..31] OF CHAR;\n d,n,i,b : INTEGER;\nBEGIN\n FOR b:=2 TO 5 DO\n FormatString(\"base %i:\", buf, b);\n WriteString(buf);\n FOR i:=0 TO 9 DO\n vc(i,b,n,d);\n IF n#0 THEN\n FormatString(\" %i/%i\", buf, n, d);\n WriteString(buf)\n ELSE\n WriteString(\" 0\")\n END\n END;\n WriteLn\n END;\n\n ReadChar\nEND Sequence.\n","language":"Modula-2"},{"code":"import rationals, strutils, sugar\n\ntype Fract = Rational[int]\n\nproc corput(n: int; base: Positive): Fract =\n result = 0.toRational\n var b = 1 // base\n var n = n\n while n != 0:\n result += n mod base * b\n n = n div base\n b /= base\n\nfor base in 2..5:\n let list = collect(newSeq, for n in 1..10: corput(n, base))\n echo \"Base $#: \".format(base), list.join(\" \")\n","language":"Nim"},{"code":"VdC(n)=n=binary(n);sum(i=1,#n,if(n[i],1.>>(#n+1-i)));\nVdC(n)=sum(i=1,#binary(n),if(bittest(n,i-1),1.>>i)); \\\\ Alternate approach\nvector(10,n,VdC(n))\n","language":"PARI-GP"},{"code":"Program VanDerCorput;\n{$IFDEF FPC}\n {$MODE DELPHI}\n{$ELSE}\n {$APPTYPE CONSOLE}\n{$ENDIF}\n\ntype\n tvdrCallback = procedure (nom,denom: NativeInt);\n\n{ Base=2\nfunction rev2(n,Pot:NativeUint):NativeUint;\nvar\n r : Nativeint;\nbegin\n r := 0;\n while Pot > 0 do\n Begin\n r := r shl 1 OR (n AND 1);\n n := n shr 1;\n dec(Pot);\n end;\n rev2 := r;\nend;\n}\n\nfunction reverse(n,base,Pot:NativeUint):NativeUint;\nvar\n r,c : Nativeint;\nbegin\n r := 0;\n//No need to test n> 0 in this special case, n starting in upper half\n while Pot > 0 do\n Begin\n c := n div base;\n r := n+(r-c)*base;\n n := c;\n dec(Pot);\n end;\n reverse := r;\nend;\n\nprocedure VanDerCorput(base,count:NativeUint;f:tvdrCallback);\n//calculates count nominater and denominater of Van der Corput sequence\n// to base\nvar\n Pot,\n denom,nom,\n i : NativeUint;\nBegin\n denom := 1;\n Pot := 0;\n while count > 0 do\n Begin\n IF Pot = 0 then\n f(0,1);\n //start in upper half\n i := denom;\n inc(Pot);\n denom := denom *base;\n\n repeat\n nom := reverse(i,base,Pot);\n IF count > 0 then\n f(nom,denom)\n else\n break;\n inc(i);\n dec(count);\n until i >= denom;\n end;\nend;\n\nprocedure vdrOutPut(nom,denom: NativeInt);\nBegin\n write(nom,'/',denom,' ');\nend;\n\nvar\n i : NativeUint;\nBegin\n For i := 2 to 5 do\n Begin\n write(' Base ',i:2,' :');\n VanDerCorput(i,9,@vdrOutPut);\n writeln;\n end;\nend.\n","language":"Pascal"},{"code":"sub vdc {\n my @value = shift;\n my $base = shift // 2;\n use integer;\n push @value, $value[-1] / $base while $value[-1] > 0;\n my ($x, $sum) = (1, 0);\n no integer;\n $sum += ($_ % $base) / ($x *= $base) for @value;\n return $sum;\n}\n\nfor my $base ( 2 .. 5 ) {\n print \"base $base: \", join ' ', map { vdc($_, $base) } 0 .. 10;\n print \"\\n\";\n}\n","language":"Perl"},{"code":"(phixonline)-->\n <span style=\"color: #008080;\">enum</span> <span style=\"color: #000000;\">BASE</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">FRAC</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">DECIMAL</span>\n <span style=\"color: #008080;\">constant</span> <span style=\"color: #000000;\">DESC</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #0000FF;\">{</span><span style=\"color: #008000;\">\"Base\"</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #008000;\">\"Fraction\"</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #008000;\">\"Decimal\"</span><span style=\"color: #0000FF;\">}</span>\n\n <span style=\"color: #008080;\">function</span> <span style=\"color: #000000;\">vdc</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #004080;\">integer</span> <span style=\"color: #000000;\">n</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #004080;\">atom</span> <span style=\"color: #000000;\">base</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: #004080;\">object</span> <span style=\"color: #000000;\">res</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #008000;\">\"\"</span>\n <span style=\"color: #004080;\">atom</span> <span style=\"color: #000000;\">num</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">0</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">denom</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">digit</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">g</span>\n <span style=\"color: #008080;\">while</span> <span style=\"color: #000000;\">n</span> <span style=\"color: #008080;\">do</span>\n <span style=\"color: #000000;\">denom</span> <span style=\"color: #0000FF;\">*=</span> <span style=\"color: #000000;\">base</span>\n <span style=\"color: #000000;\">digit</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">remainder</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">n</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">base</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #000000;\">n</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;\">base</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;\">BASE</span> <span style=\"color: #008080;\">then</span>\n <span style=\"color: #000000;\">res</span> <span style=\"color: #0000FF;\">&=</span> <span style=\"color: #000000;\">digit</span><span style=\"color: #0000FF;\">+</span><span style=\"color: #008000;\">'0'</span>\n <span style=\"color: #008080;\">else</span>\n <span style=\"color: #000000;\">num</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">num</span><span style=\"color: #0000FF;\">*</span><span style=\"color: #000000;\">base</span><span style=\"color: #0000FF;\">+</span><span style=\"color: #000000;\">digit</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;\">if</span> <span style=\"color: #000000;\">flag</span><span style=\"color: #0000FF;\">=</span><span style=\"color: #000000;\">FRAC</span> <span style=\"color: #008080;\">then</span>\n <span style=\"color: #000000;\">g</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">gcd</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">num</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">denom</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #008080;\">return</span> <span style=\"color: #0000FF;\">{</span><span style=\"color: #000000;\">num</span><span style=\"color: #0000FF;\">/</span><span style=\"color: #000000;\">g</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">denom</span><span style=\"color: #0000FF;\">/</span><span style=\"color: #000000;\">g</span><span style=\"color: #0000FF;\">}</span>\n <span style=\"color: #008080;\">elsif</span> <span style=\"color: #000000;\">flag</span><span style=\"color: #0000FF;\">=</span><span style=\"color: #000000;\">DECIMAL</span> <span style=\"color: #008080;\">then</span>\n <span style=\"color: #008080;\">return</span> <span style=\"color: #000000;\">num</span><span style=\"color: #0000FF;\">/</span><span style=\"color: #000000;\">denom</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: #008080;\">iff</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><span style=\"color: #000000;\">0</span><span style=\"color: #0000FF;\">?</span><span style=\"color: #008000;\">\"0\"</span><span style=\"color: #0000FF;\">:</span><span style=\"color: #008000;\">\"0.\"</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;\">function</span>\n\n <span style=\"color: #008080;\">procedure</span> <span style=\"color: #000000;\">show_vdc</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;\">string</span> <span style=\"color: #000000;\">fmt</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #004080;\">object</span> <span style=\"color: #000000;\">v</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;\">5</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 %d: \"</span><span style=\"color: #0000FF;\">,{</span><span style=\"color: #000000;\">DESC</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">flag</span><span style=\"color: #0000FF;\">],</span><span style=\"color: #000000;\">i</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;\">0</span> <span style=\"color: #008080;\">to</span> <span style=\"color: #000000;\">9</span> <span style=\"color: #008080;\">do</span>\n <span style=\"color: #000000;\">v</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">vdc</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">j</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">i</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;\">FRAC</span> <span style=\"color: #008080;\">and</span> <span style=\"color: #000000;\">v</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: #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;\">\"0 \"</span><span style=\"color: #0000FF;\">)</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: #000000;\">fmt</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 <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 <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">procedure</span>\n\n <span style=\"color: #000000;\">show_vdc</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">BASE</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #008000;\">\"%s \"</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #000000;\">show_vdc</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">FRAC</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #008000;\">\"%d/%d \"</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #000000;\">show_vdc</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">DECIMAL</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #008000;\">\"%g \"</span><span style=\"color: #0000FF;\">)</span>\n<!--\n","language":"Phix"},{"code":"(scl 6)\n\n(de vdc (N B)\n (default B 2)\n (let (R 0 A 1.0)\n (until (=0 N)\n (inc 'R (* (setq A (/ A B)) (% N B)))\n (setq N (/ N B)) )\n R ) )\n\n(for B (2 3 4)\n (prinl \"Base: \" B)\n (for N (range 0 9)\n (prinl N \": \" (round (vdc N B) 4)) ) )\n","language":"PicoLisp"},{"code":"vdcb: procedure (an) returns (bit (31)); /* 6 July 2012 */\n declare an fixed binary (31);\n declare (n, i) fixed binary (31);\n declare v bit (31) varying;\n\n n = an; v = ''b;\n do i = 1 by 1 while (n > 0);\n if iand(n, 1) = 1 then v = v || '1'b; else v = v || '0'b;\n n = isrl(n, 1);\n end;\n return (v);\nend vdcb;\n\n declare i fixed binary (31);\n\n do i = 0 to 10;\n put skip list ('0.' || vdcb(i));\n end;\n","language":"PL-I"},{"code":"% vdc( N, Base, Out )\n% Out = the Van der Corput representation of N in given Base\nvdc( 0, _, [] ).\nvdc( N, Base, Out ) :-\n Nr is mod(N, Base),\n Nq is N // Base,\n vdc( Nq, Base, Tmp ),\n Out = [Nr|Tmp].\n\n% Writes every element of a list to stdout; no newlines\nwrite_list( [] ).\nwrite_list( [H|T] ) :-\n write( H ),\n write_list( T ).\n\n% Writes the Nth Van der Corput item.\nprint_vdc( N, Base ) :-\n vdc( N, Base, Lst ),\n write('0.'),\n write_list( Lst ).\nprint_vdc( N ) :-\n print_vdc( N, 2 ).\n\n% Prints the first N+1 elements of the Van der Corput\n% sequence, each to its own line\nprint_some( 0, _ ) :-\n write( '0.0' ).\nprint_some( N, Base ) :-\n M is N - 1,\n print_some( M, Base ),\n nl,\n print_vdc( N, Base ).\nprint_some( N ) :-\n print_some( N, 2 ).\n\ntest :-\n writeln('First 10 members in base 2:'),\n print_some( 9 ),\n nl,\n write('7th member in base 4 (stretch goal) => '),\n print_vdc( 7, 4 ).\n","language":"Prolog"},{"code":"% g(B,N,X):- consecutively generate in X the first N elements of the sequence based on {0, 1, ..., B}\n\ng(_,N,[L|_]-_,X):- N > 1, atomic_list_concat(['0.'|L],X).\ng(B,N,[L|Ls]-Xs,X):- N > 2, M is N-1, findall([I|L], between(0,B,I), T), append(T,Ys,Xs), g(B,M,Ls-Ys,X).\ng(_,N,'0.0'):- N > 0.\ng(B,N,X):- N > 0, findall([I], between(1,B,I), T), T \\= [], append(T,Ys,Xs), g(B,N,Xs-Ys,X).\n","language":"Prolog"},{"code":"Procedure.d nBase(n.i,b.i)\n Define r.d,s.i=1\n While n\n s*b\n r+(Mod(n,b)/s)\n n=Int(n/b)\n Wend\n ProcedureReturn r\nEndProcedure\n\nDefine.i b,c\nOpenConsole(\"van der Corput - Sequence\")\nFor b=2 To 5\n Print(\"Base \"+Str(b)+\": \")\n For c=0 To 9\n Print(StrD(nBase(c,b),5)+~\"\\t\")\n Next\n PrintN(\"\")\nNext\nInput()\n","language":"PureBasic"},{"code":"def vdc(n, base=2):\n vdc, denom = 0,1\n while n:\n denom *= base\n n, remainder = divmod(n, base)\n vdc += remainder / denom\n return vdc\n","language":"Python"},{"code":">>> [vdc(i) for i in range(10)]\n[0, 0.5, 0.25, 0.75, 0.125, 0.625, 0.375, 0.875, 0.0625, 0.5625]\n>>> [vdc(i, 3) for i in range(10)]\n[0, 0.3333333333333333, 0.6666666666666666, 0.1111111111111111, 0.4444444444444444, 0.7777777777777777, 0.2222222222222222, 0.5555555555555556, 0.8888888888888888, 0.037037037037037035]\n>>>\n","language":"Python"},{"code":">>> from fractions import Fraction\n>>> Fraction.__repr__ = lambda x: '%i/%i' % (x.numerator, x.denominator)\n>>> [vdc(i, base=Fraction(2)) for i in range(10)]\n[0, 1/2, 1/4, 3/4, 1/8, 5/8, 3/8, 7/8, 1/16, 9/16]\n","language":"Python"},{"code":">>> for b in range(3,6):\n\tprint('\\nBase', b)\n\tprint([vdc(i, base=Fraction(b)) for i in range(10)])\n\nBase 3\n[0, 1/3, 2/3, 1/9, 4/9, 7/9, 2/9, 5/9, 8/9, 1/27]\n\nBase 4\n[0, 1/4, 1/2, 3/4, 1/16, 5/16, 9/16, 13/16, 1/8, 3/8]\n\nBase 5\n[0, 1/5, 2/5, 3/5, 4/5, 1/25, 6/25, 11/25, 16/25, 21/25]\n","language":"Python"},{"code":" [ $ \"bigrat.qky\" loadfile ] now!\n\n [ [] swap\n [ dup while\n base share /mod\n rot join swap\n again ]\n drop ] is digits ( n --> [ )\n\n [ base put\n digits reverse\n dup 0 swap\n witheach\n [ base share rot * + ]\n base take rot size **\n reduce ] is corput ( n n --> n/d )\n\n\n 5 times\n [ say \"base \"\n i^ 2 + dup echo\n say \": \"\n 10 times\n [ i^ over corput\n vulgar$ echo$ sp sp ]\n cr drop ]\n","language":"Quackery"},{"code":"#lang racket\n(define (van-der-Corput n base)\n (if (zero? n)\n 0\n (let-values ([(q r) (quotient/remainder n base)])\n (/ (+ r (van-der-Corput q base))\n base))))\n","language":"Racket"},{"code":"#lang racket\n(define (digit-length n base)\n (if (< n base) 1 (add1 (digit-length (quotient n base) base))))\n(define (digit n i base)\n (remainder (quotient n (expt base i)) base))\n(define (van-der-Corput n base)\n (for/sum ([i (digit-length n base)]) (/ (digit n i base) (expt base (+ i 1)))))\n","language":"Racket"},{"code":"(for ([base (in-range 2 (add1 5))])\n (printf \"Base ~a: \" base)\n (for ([n (in-range 0 10)])\n (printf \"~a \" (van-der-Corput n base)))\n (newline))\n\n#| Base 2: 0 1/2 1/4 3/4 1/8 5/8 3/8 7/8 1/16 9/16\n Base 3: 0 1/3 2/3 1/9 4/9 7/9 2/9 5/9 8/9 1/27\n Base 4: 0 1/4 1/2 3/4 1/16 5/16 9/16 13/16 1/8 3/8\n Base 5: 0 1/5 2/5 3/5 4/5 1/25 6/25 11/25 16/25 21/25 |#\n","language":"Racket"},{"code":"constant VdC = map { :2(\"0.\" ~ .base(2).flip) }, ^Inf;\n.say for VdC[^16];\n","language":"Raku"},{"code":"sub VdC($base = 2) {\n map {\n [+] $_ && .polymod($base xx *) Z/ [\\*] $base xx *\n }, ^Inf\n}\n\n.say for VdC[^10];\n","language":"Raku"},{"code":"sub vdc($num, $base = 2) {\n my $n = $num;\n my $vdc = 0;\n my $denom = 1;\n while $n {\n $vdc += $n mod $base / ($denom *= $base);\n $n div= $base;\n }\n $vdc;\n}\n\nfor 2..5 -> $b {\n say \"Base $b\";\n say ( vdc($_,$b).Rat.nude.join('/') for ^10 ).join(', ');\n say '';\n}\n","language":"Raku"},{"code":"sub vdc($value, $base = 2) {\n my @values = $value, { $_ div $base } ... 0;\n my @denoms = $base, { $_ * $base } ... *;\n [+] do for (flat @values Z @denoms) -> $v, $d {\n $v mod $base / $d;\n }\n}\n","language":"Raku"},{"code":"/*REXX program converts an integer (or a range) ──► a Van der Corput number in base 2.*/\nnumeric digits 1000 /*handle almost anything the user wants*/\nparse arg a b . /*obtain the optional arguments from CL*/\nif a=='' then parse value 0 10 with a b /*Not specified? Then use the defaults*/\nif b=='' then b= a /*assume a range for a single number.*/\n\n do j=a to b /*traipse through the range of numbers.*/\n _= VdC( abs(j) ) /*convert absolute value of an integer.*/\n leading= substr('-', 2 + sign(j) ) /*if needed, elide the leading sign. */\n say leading || _ /*show number, with leading minus sign?*/\n end /*j*/\nexit /*stick a fork in it, we're all done. */\n/*──────────────────────────────────────────────────────────────────────────────────────*/\nVdC: procedure; y= x2b( d2x( arg(1) ) ) + 0 /*convert to hexadecimal, then binary.*/\n if y==0 then return 0 /*handle the special case of zero. */\n return '.'reverse(y) /*heavy lifting is performed by REXX. */\n","language":"REXX"},{"code":"/*REXX pgm converts an integer (or a range) ──► a Van der Corput number, in base 2, or */\n/*────────────────────────────── optionally, any other base up to and including base 90.*/\nnumeric digits 1000 /*handle almost anything the user wants*/\nparse arg a b r . /*obtain optional arguments from the CL*/\nif a=='' | a==\",\" then parse value 0 10 with a b /*Not specified? Then use the defaults*/\nif b=='' | b==\",\" then b= a /* \" \" \" \" \" \" */\nif r=='' | r==\",\" then r= 2 /* \" \" \" \" \" \" */\nz= /*a placeholder for a list of numbers. */\n do j=a to b /*traipse through the range of integers*/\n _= VdC( abs(j), abs(r) ) /*convert the ABSolute value of integer*/\n _= substr('-', 2 + sign(j) )_ /*if needed, keep the leading - sign.*/\n if r>0 then say _ /*if positive base, then just show it. */\n else z=z _ /* ··· else append (build) a list. */\n end /*j*/\n\nif z\\=='' then say strip(z) /*if a list is wanted, then display it.*/\nexit /*stick a fork in it, we're all done. */\n/*──────────────────────────────────────────────────────────────────────────────────────*/\nbase: procedure; parse arg x, toB, inB /*get a number, toBase, and inBase. */\n /*╔══════════════════════════════════════════════════════════════════════════════════╗\n ║ Input to this function: x (X is required and it must be an integer). ║\n ║ toBase the base to convert X to (default=10). ║\n ║ inBase the base X is expressed in (default=10). ║\n ║ ║\n ║ toBase & inBase have a limit of: 2 ──► 90 ║\n ╚══════════════════════════════════════════════════════════════════════════════════╝*/\n @abc= 'abcdefghijklmnopqrstuvwxyz' /*the lowercase Latin alphabet letters.*/\n @abcU= @abc; upper @abcU /*go whole hog & extend with uppercase.*/\n @@@= 0123456789 || @abc || @abcU /*prefix them with the decimal digits. */\n @@@= @@@'<>[]{}()?~!@#$%^&*_+-=|\\/;:`' /*add some special characters as well, */\n /*──those chars should all be viewable.*/\n numeric digits 1000 /*what the hey, support bigun' numbers.*/\n maxB= length(@@@) /*maximum base (radix) supported here. */\n if toB=='' then toB= 10 /*if omitted, then assume default (10)*/\n if inB=='' then inB= 10 /* \" \" \" \" \" \" */\n #=0 /* [↓] convert base inB X ──► base 10*/\n do j=1 for length(x) /*process each \"numeral\" in the string.*/\n _= substr(x, j, 1) /*pick off a \"digit\" (numeral) from X.*/\n v= pos(_, @@@) /*get the value of this \"digit\"/numeral*/\n if v==0 | v>inB then call erd /*is it an illegal \"digit\" (numeral) ? */\n #= # * inB + v - 1 /*construct new number, digit by digit.*/\n end /*j*/\n y= /* [↓] convert base 10 # ──► base toB.*/\n do while #>=toB /*deconstruct the new number (#). */\n y= substr(@@@, # // toB + 1, 1)y /* construct the output number, ··· */\n #= # % toB /* ··· and also whittle down #. */\n end /*while*/\n\n return substr(@@@, # + 1, 1)y /*return a constructed \"numeric\" string*/\n/*──────────────────────────────────────────────────────────────────────────────────────*/\nerd: say 'the character ' v \" isn't a legal numeral for base \" inB'.'; exit 13\nVdC: return '.'reverse( base( arg(1), arg(2) )) /*convert the #, reverse the #, append.*/\n","language":"REXX"},{"code":"decimals(4)\nfor base = 2 to 5\n see \"base \" + string(base) + \" : \"\n for number = 0 to 9\n see \"\" + corput(number, base) + \" \"\n next\n see nl\nnext\n\nfunc corput n, b\n vdc = 0\n denom = 1\n while n\n denom *= b\n rem = n % b\n n = floor(n/b)\n vdc += rem / denom\n end\n return vdc\n","language":"Ring"},{"code":"def vdc(n, base=2)\n str = n.to_s(base).reverse\n str.to_i(base).quo(base ** str.length)\nend\n\n(2..5).each do |base|\n puts \"Base #{base}: \" + Array.new(10){|i| vdc(i,base)}.join(\", \")\nend\n","language":"Ruby"},{"code":"/// Van der Corput sequence for any base, based on C languange example from Wikipedia.\npub fn corput(nth: usize, base: usize) -> f64 {\n let mut n = nth;\n let mut q: f64 = 0.0;\n let mut bk: f64 = 1.0 / (base as f64);\n\n while n > 0_usize {\n q += ((n % base) as f64)*bk;\n n /= base;\n bk /= base as f64;\n }\n q\n}\n\nfn main() {\n for base in 2_usize..=5_usize {\n print!(\"Base {}:\", base);\n for i in 1_usize..=10_usize {\n let c = corput(i, base);\n print!(\" {:.6}\", c)\n }\n println!(\"\");\n }\n}\n","language":"Rust"},{"code":"object VanDerCorput extends App {\n def compute(n: Int, base: Int = 2) =\n Iterator.from(0).\n scanLeft(1)((a, _) => a * base).\n map(b => (n - 1) / b -> b).\n takeWhile(_._1 != 0).\n foldLeft(0d)((a, b) => a + (b._1 % base).toDouble / b._2 / base)\n\n val n = scala.io.StdIn.readInt\n val b = scala.io.StdIn.readInt\n (1 to n).foreach(x => println(compute(x, b)))\n}\n","language":"Scala"},{"code":"$ include \"seed7_05.s7i\";\n include \"float.s7i\";\n\nconst func float: vdc (in var integer: number, in integer: base) is func\n result\n var float: vdc is 0.0;\n local\n var integer: denom is 1;\n var integer: remainder is 0;\n begin\n while number <> 0 do\n denom *:= base;\n remainder := number rem base;\n number := number div base;\n vdc +:= flt(remainder) / flt(denom);\n end while;\n end func;\n\nconst proc: main is func\n local\n var integer: base is 0;\n var integer: number is 0;\n begin\n for base range 2 to 5 do\n writeln;\n writeln(\"Base \" <& base);\n for number range 0 to 9 do\n write(vdc(number, base) digits 6 <& \" \");\n end for;\n writeln;\n end for;\n end func;\n","language":"Seed7"},{"code":"func vdc(value, base=2) {\n while (value[-1] > 0) {\n value.append(value[-1] / base -> int)\n }\n var (x, sum) = (1, 0)\n value.each { |i|\n sum += ((i % base) / (x *= base))\n }\n return sum\n}\n \nfor base in (2..5) {\n var seq = 10.of {|i| vdc([i], base) }\n \"base %d: %s\\n\".printf(base, seq.map{|n| \"%.4f\" % n}.join(', '))\n}\n","language":"Sidef"},{"code":"mata\n// 5th term of Van der Corput sequence\nhalton(1,1,5)\n .625\n\n// the first 10 terms of Van der Corput sequence\nhalton(10,1)\n 1\n +---------+\n 1 | .5 |\n 2 | .25 |\n 3 | .75 |\n 4 | .125 |\n 5 | .625 |\n 6 | .375 |\n 7 | .875 |\n 8 | .0625 |\n 9 | .5625 |\n 10 | .3125 |\n +---------+\n\n// the first 10 terms of Van der Corput sequence in base 3\nghalton(10,3,0)\n 1\n +---------------+\n 1 | .3333333333 |\n 2 | .6666666667 |\n 3 | .1111111111 |\n 4 | .4444444444 |\n 5 | .7777777778 |\n 6 | .2222222222 |\n 7 | .5555555556 |\n 8 | .8888888889 |\n 9 | .037037037 |\n 10 | .3703703704 |\n +---------------+\n\nend\n","language":"Stata"},{"code":"clear\nmata\nst_addobs(2500)\nst_addvar(\"double\",\"x\")\nst_addvar(\"double\",\"y\")\nst_addvar(\"double\",\"z\")\nk=1::2500\nst_store(k,1,k)\nst_store(k,2,0.5*runiform(2500,1))\nst_store(k,3,0.5:+0.5*halton(2500,1))\nend\ntwoway scatter y x, msize(tiny) color(blue) ///\n || scatter z x, msize(tiny) color(green) legend(off) xtitle(\"\") ///\n\ttitle(Distribution: Van der Corput (top) vs pseudorandom) ///\n\tylabel(, angle(0) format(%3.1f))\n","language":"Stata"},{"code":"func vanDerCorput(n: Int, base: Int, num: inout Int, denom: inout Int) {\n var n = n, p = 0, q = 1\n\n while n != 0 {\n p = p * base + (n % base)\n q *= base\n n /= base\n }\n\n num = p\n denom = q\n\n while p != 0 {\n n = p\n p = q % p\n q = n\n }\n\n num /= q\n denom /= q\n}\n\nvar num = 0\nvar denom = 0\n\nfor base in 2...5 {\n print(\"base \\(base): 0 \", terminator: \"\")\n\n for n in 1..<10 {\n vanDerCorput(n: n, base: base, num: &num, denom: &denom)\n\n print(\"\\(num)/\\(denom) \", terminator: \"\")\n }\n\n print()\n}\n","language":"Swift"},{"code":"proc digitReverse {n {base 2}} {\n set n [expr {[set neg [expr {$n < 0}]] ? -$n : $n}]\n set result 0.0\n set bit [expr {1.0 / $base}]\n for {} {$n > 0} {set n [expr {$n / $base}]} {\n\tset result [expr {$result + $bit * ($n % $base)}]\n\tset bit [expr {$bit / $base}]\n }\n return [expr {$neg ? -$result : $result}]\n}\n","language":"Tcl"},{"code":"# Print the first 10 terms of the Van der Corput sequence\nfor {set i 1} {$i <= 10} {incr i} {\n puts \"vanDerCorput($i) = [digitReverse $i]\"\n}\n\n# In other bases\nforeach base {3 4 5} {\n set seq {}\n for {set i 1} {$i <= 10} {incr i} {\n\tlappend seq [format %.5f [digitReverse $i $base]]\n }\n puts \"${base}: [join $seq {, }]\"\n}\n","language":"Tcl"},{"code":"fn v2(nn u32) f64 {\n mut n:=nn\n mut r := f64(0)\n mut p := .5\n for n > 0 {\n if n&1 == 1 {\n r += p\n }\n p *= .5\n n >>= 1\n }\n return r\n}\n\nfn new_v(base u32) fn(u32) f64 {\n invb := 1 / f64(base)\n return fn[base,invb](nn u32) f64 {\n mut n:=nn\n mut r := f64(0)\n mut p := invb\n for n > 0 {\n r += p * f64(n%base)\n p *= invb\n n /= base\n }\n return r\n }\n}\n\nfn main() {\n println(\"Base 2:\")\n for i := u32(0); i < 10; i++ {\n println('$i ${v2(i)}')\n }\n println(\"Base 3:\")\n v3 := new_v(3)\n for i := u32(0); i < 10; i++ {\n println('$i ${v3(i)}')\n }\n}\n","language":"V-(Vlang)"},{"code":"Private Function vdc(ByVal n As Integer, BASE As Variant) As Variant\n Dim res As String\n Dim digit As Integer, g As Integer, denom As Integer\n denom = 1\n Do While n\n denom = denom * BASE\n digit = n Mod BASE\n n = n \\ BASE\n res = res & CStr(digit) '+ \"0\"\n Loop\n vdc = IIf(Len(res) = 0, \"0\", \"0.\" & res)\nEnd Function\n\nPublic Sub show_vdc()\n Dim v As Variant, j As Integer\n For i = 2 To 5\n Debug.Print \"Base \"; i; \": \";\n For j = 0 To 9\n v = vdc(j, i)\n Debug.Print v; \" \";\n Next j\n Debug.Print\n Next i\nEnd Sub\n","language":"VBA"},{"code":"'http://rosettacode.org/wiki/Van_der_Corput_sequence\n'Van der Corput Sequence fucntion call = VanVanDerCorput(number,base)\n\nBase2 = \"0\" : Base3 = \"0\" : Base4 = \"0\" : Base5 = \"0\"\nBase6 = \"0\" : Base7 = \"0\" : Base8 = \"0\" : Base9 = \"0\"\n\nl = 1\nh = 1\nDo Until l = 9\n\t'Set h to the value of l after each function call\n\t'as it sets it to 0 - see lines 37 to 40.\n\tBase2 = Base2 & \", \" & VanDerCorput(h,2) : h = l\n\tBase3 = Base3 & \", \" & VanDerCorput(h,3) : h = l\n\tBase4 = Base4 & \", \" & VanDerCorput(h,4) : h = l\n\tBase5 = Base5 & \", \" & VanDerCorput(h,5) : h = l\n\tBase6 = Base6 & \", \" & VanDerCorput(h,6) : h = l\n\tl = l + 1\nLoop\n\nWScript.Echo \"Base 2: \" & Base2\nWScript.Echo \"Base 3: \" & Base3\nWScript.Echo \"Base 4: \" & Base4\nWScript.Echo \"Base 5: \" & Base5\nWScript.Echo \"Base 6: \" & Base6\n\n'Van der Corput Sequence\nFunction VanDerCorput(n,b)\n\tk = RevString(Dec2BaseN(n,b))\n\tFor i = 1 To Len(k)\n\t\tVanDerCorput = VanDerCorput + (CLng(Mid(k,i,1)) * b^-i)\n\tNext\nEnd Function\n\n'Decimal to Base N Conversion\nFunction Dec2BaseN(q,c)\n\tDec2BaseN = \"\"\n\tDo Until q = 0\n\t\tDec2BaseN = CStr(q Mod c) & Dec2BaseN\n\t\tq = Int(q / c)\n\tLoop\nEnd Function\n\n'Reverse String\nFunction RevString(s)\n\tFor j = Len(s) To 1 Step -1\n\t\tRevString = RevString & Mid(s,j,1)\n\tNext\nEnd Function\n","language":"VBScript"},{"code":"Module Module1\n\n Function ToBase(n As Integer, b As Integer) As String\n Dim result = \"\"\n If b < 2 Or b > 16 Then\n Throw New ArgumentException(\"The base is out of range\")\n End If\n\n Do\n Dim remainder = n Mod b\n result = \"0123456789ABCDEF\"(remainder) + result\n n = n \\ b\n Loop While n > 0\n\n Return result\n End Function\n\n Sub Main()\n For b = 2 To 5\n Console.WriteLine(\"Base = {0}\", b)\n For i = 0 To 12\n Dim s = \".\" + ToBase(i, b)\n Console.Write(\"{0,6} \", s)\n Next\n Console.WriteLine()\n Console.WriteLine()\n Next\n End Sub\n\nEnd Module\n","language":"Visual-Basic-.NET"},{"code":"var v2 = Fn.new { |n|\n var p = 0.5\n var r = 0\n while (n > 0) {\n if (n%2 == 1) r = r + p\n p = p / 2\n n = (n/2).floor\n }\n return r\n}\n\nvar newV = Fn.new { |base|\n var invb = 1 / base\n return Fn.new { |n|\n var p = invb\n var r = 0\n while (n > 0) {\n r = r + p*(n%base)\n p = p * invb\n n = (n/base).floor\n }\n return r\n }\n}\n\nSystem.print(\"Base 2:\")\nfor (i in 0..9) System.print(\"%(i) -> %(v2.call(i))\")\n\nSystem.print(\"\\nBase 3:\")\nvar v3 = newV.call(3)\nfor (i in 0..9) System.print(\"%(i) -> %(v3.call(i))\")\n","language":"Wren"},{"code":"include c:\\cxpl\\codes; \\intrinsic 'code' declarations\n\nfunc real VdC(N); \\Return Nth term of van der Corput sequence in base 2\nint N;\nreal V, U;\n[V:= 0.0; U:= 0.5;\nrepeat N:= N/2;\n if rem(0) then V:= V+U;\n U:= U/2.0;\nuntil N=0;\nreturn V;\n];\n\nint N;\nfor N:= 0 to 10-1 do\n [IntOut(0, N); RlOut(0, VdC(N)); CrLf(0)]\n","language":"XPL0"},{"code":"sub num_base$(number, base)\n if _base_ > 9 then\n print \"base not handled by function\"\n sleep 5000\n return \"\"\n end if\n\n while number <> 0\n n = mod(number, base)\n ans$ = str$(n) + ans$\n number = int(number / base)\n wend\n\n if ans$ = \"\" then ans$ = \"0\" : fi\n\n return \".\" + ans$\nend sub\n\nfor k = 2 to 5\n print \"Base = \", k\n for l = 0 to 12\n print left$(num_base$(l, k), 7), \" \";\n next l\n print : print\nnext k\nend\n","language":"Yabasic"},{"code":"fcn vdc(n,base=2){\n vdc:=0.0; denom:=1;\n while(n){ reg remainder;\n denom *= base;\n n, remainder = n.divr(base);\n vdc += (remainder.toFloat() / denom);\n }\n vdc\n}\n","language":"Zkl"},{"code":"fcn vdc(n,base=2){\n str:=n.toString(base).reverse();\n str.toInt(base).toFloat()/(base.toFloat().pow(str.len()))\n}\n","language":"Zkl"}],"string":"[\n {\n \"code\": \"---\\nfrom: http://rosettacode.org/wiki/Van_der_Corput_sequence\\n\",\n \"language\": \"00-META\"\n },\n {\n \"code\": \"When counting integers in binary, if you put a (binary) point to the right of the count then the column immediately to the left denotes a digit with a multiplier of <math>2^0</math>; the digit in the next column to the left has a multiplier of <math>2^1</math>; and so on.\\n\\nSo in the following table:\\n<pre> 0.\\n 1.\\n 10.\\n 11.\\n ...</pre>\\nthe binary number \\\"<code>10</code>\\\" is <math>1 \\\\times 2^1 + 0 \\\\times 2^0</math>.\\n\\nYou can also have binary digits to the right of the “point”, just as in the decimal number system. In that case, the digit in the place immediately to the right of the point has a weight of <math>2^{-1}</math>, or <math>1/2</math>. \\nThe weight for the second column to the right of the point is <math>2^{-2}</math> or <math>1/4</math>. And so on.\\n\\nIf you take the integer binary count of the first table, and ''reflect'' the digits about the binary point, you end up with '''the van der Corput sequence of numbers in base 2'''.\\n\\n<pre> .0\\n .1\\n .01\\n .11\\n ...</pre>\\n\\nThe third member of the sequence, binary <code>0.01</code>, is therefore <math>0 \\\\times 2^{-1} + 1 \\\\times 2^{-2}</math> or <math>1/4</math>.\\n\\n<br> [[File:Van der corput distribution.png|400|thumb|right|Distribution of 2500 points each: Van der Corput (top) vs pseudorandom]] Members of the sequence lie within the interval <math>0 \\\\leq x < 1</math>. Points within the sequence tend to be evenly distributed which is a useful trait to have for [[wp:Monte Carlo method|Monte Carlo simulations]]. \\nThis sequence is also a superset of the numbers representable by the \\\"fraction\\\" field of [[wp:IEEE 754-1985|an old IEEE floating point standard]]. In that standard, the \\\"fraction\\\" field represented the fractional part of a binary number beginning with \\\"1.\\\" e.g. 1.101001101.\\n\\n'''Hint'''\\n\\nA ''hint'' at a way to generate members of the sequence is to modify a routine used to change the base of an integer:\\n<syntaxhighlight lang=\\\"python\\\">>>> def base10change(n, base):\\n\\tdigits = []\\n\\twhile n:\\n\\t\\tn,remainder = divmod(n, base)\\n\\t\\tdigits.insert(0, remainder)\\n\\treturn digits\\n\\n>>> base10change(11, 2)\\n[1, 0, 1, 1]</syntaxhighlight>\\nthe above showing that <code>11</code> in decimal is <math>1\\\\times 2^3 + 0\\\\times 2^2 + 1\\\\times 2^1 + 1\\\\times 2^0</math>.<br>\\nReflected this would become <code>.1101</code> or <math>1\\\\times 2^{-1} + 1\\\\times 2^{-2} + 0\\\\times 2^{-3} + 1\\\\times 2^{-4}</math>\\n\\n\\n;Task description:\\n* Create a function/method/routine that given ''n'', generates the ''n'''th term of the van der Corput sequence in base 2.\\n* Use the function to compute ''and display'' the first ten members of the sequence. (The first member of the sequence is for ''n''=0).\\n\\n* As a stretch goal/extra credit, compute and show members of the sequence for bases other than 2.\\n\\n\\n\\n;See also:\\n* [http://www.puc-rio.br/marco.ind/quasi_mc.html#low_discrep The Basic Low Discrepancy Sequences]\\n* [[Non-decimal radices/Convert]]\\n* [[wp:Van der Corput sequence|Van der Corput sequence]]\\n<br><br>\\n\\n\",\n \"language\": \"00-TASK\"\n },\n {\n \"code\": \"F vdc(=n, base = 2)\\n V (vdc, denom) = (0.0, 1)\\n L n != 0\\n denom *= base\\n (n, V remainder) = divmod(n, base)\\n vdc += Float(remainder) / denom\\n R vdc\\n\\nprint((0.<10).map(i -> vdc(i)))\\nprint((0.<10).map(i -> vdc(i, 3)))\\n\",\n \"language\": \"11l\"\n },\n {\n \"code\": \"* Van der Corput sequence 31/01/2017\\nVDCS CSECT\\n USING VDCS,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 \\\" addressability\\n ZAP B,=P'2' b=2 (base)\\n ZAP M,=P'-1' m=-1\\n SR R6,R6 i=0\\nLOOPI CH R6,=H'10' do i=0 to 10\\n BH ELOOPI\\n AP M,=P'1' w=m+1\\n ZAP V,=P'0' v=0\\n ZAP S,=P'1' s=1\\n ZAP N,M n=m\\nWHILE CP N,=P'0' do while n<>0\\n BE EWHILE\\n MP S,B s=s*b\\n ZAP PL16,N n\\n DP PL16,B n/b\\n ZAP W,PL16+8(8) w=n mod b\\n MP W,=P'100000' *100000\\n ZAP PL16,W w\\n DP PL16,S w/s\\n ZAP W,PL16(8) w=w/s\\n AP V,W v=v+(n mod b)*100000/s\\n ZAP PL16,N n\\n DP PL16,B n/b\\n ZAP N,PL16(8) n=n/b\\n B WHILE\\nEWHILE XDECO R6,XDEC edit i\\n MVC PG+0(3),XDEC+9 output i\\n MVC PG+3(3),=C' 0.'\\n UNPK Z,V unpack v\\n OI Z+L'Z-1,X'F0' edit v\\n MVC PG+6(5),Z+11 output v (v/100000)\\n XPRNT PG,L'PG print buffer\\n LA R6,1(R6) i=i+1\\n B LOOPI\\nELOOPI L R13,4(0,R13) epilog\\n LM R14,R12,12(R13) \\\" restore\\n XR R15,R15 \\\" rc=0\\n BR R14 exit\\nB DS PL8\\nM DS PL8\\nV DS PL8\\nS DS PL8\\nN DS PL8\\nW DS PL8 packed\\nZ DS ZL16 zoned\\nPL16 DS PL16 packed max\\nPG DC CL80' ' buffer\\nXDEC DS CL12 work area for xdeco\\n YREGS\\n END VDCS\\n\",\n \"language\": \"360-Assembly\"\n },\n {\n \"code\": \"INCLUDE \\\"D2:REAL.ACT\\\" ;from the Action! Tool Kit\\n\\nPROC Generate(INT value,base REAL POINTER res)\\n REAL denom,rbase,r1,r2\\n\\n IntToReal(0,res)\\n IntToReal(1,denom)\\n IntToReal(base,rbase)\\n WHILE value#0\\n DO\\n RealMult(denom,rbase,r1)\\n RealAssign(r1,denom)\\n IntToReal(value MOD base,r1)\\n RealDiv(r1,denom,r2)\\n RealAdd(res,r2,r1)\\n RealAssign(r1,res)\\n value==/base\\n OD\\nRETURN\\n\\nPROC Main()\\n INT value,base\\n REAL res\\n\\n Put(125) PutE() ;clear the screen\\n FOR base=2 TO 5\\n DO\\n PrintF(\\\"Base %I:%E\\\",base)\\n FOR value=0 TO 9\\n DO\\n Generate(value,base,res)\\n PrintR(res) Put(32)\\n OD\\n PutE() PutE()\\n OD\\nRETURN\\n\",\n \"language\": \"Action-\"\n },\n {\n \"code\": \"package {\\n\\t\\n import flash.display.Sprite;\\n import flash.events.Event;\\n\\n public class VanDerCorput extends Sprite {\\n\\n public function VanDerCorput():void {\\n if (stage) init();\\n else addEventListener(Event.ADDED_TO_STAGE, init);\\n }\\n\\n private function init(e:Event = null):void {\\n\\n removeEventListener(Event.ADDED_TO_STAGE, init);\\n\\n var base2:Vector.<Number> = new Vector.<Number>(10, true);\\n var base3:Vector.<Number> = new Vector.<Number>(10, true);\\n var base4:Vector.<Number> = new Vector.<Number>(10, true);\\n var base5:Vector.<Number> = new Vector.<Number>(10, true);\\n var base6:Vector.<Number> = new Vector.<Number>(10, true);\\n var base7:Vector.<Number> = new Vector.<Number>(10, true);\\n var base8:Vector.<Number> = new Vector.<Number>(10, true);\\n\\n var i:uint;\\n\\n for ( i = 0; i < 10; i++ ) {\\n base2[i] = Math.round( _getTerm(i, 2) * 1000000 ) / 1000000;\\n base3[i] = Math.round( _getTerm(i, 3) * 1000000 ) / 1000000;\\n base4[i] = Math.round( _getTerm(i, 4) * 1000000 ) / 1000000;\\n base5[i] = Math.round( _getTerm(i, 5) * 1000000 ) / 1000000;\\n base6[i] = Math.round( _getTerm(i, 6) * 1000000 ) / 1000000;\\n base7[i] = Math.round( _getTerm(i, 7) * 1000000 ) / 1000000;\\n base8[i] = Math.round( _getTerm(i, 8) * 1000000 ) / 1000000;\\n }\\n\\n trace(\\\"Base 2: \\\" + base2.join(', '));\\n trace(\\\"Base 3: \\\" + base3.join(', '));\\n trace(\\\"Base 4: \\\" + base4.join(', '));\\n trace(\\\"Base 5: \\\" + base5.join(', '));\\n trace(\\\"Base 6: \\\" + base6.join(', '));\\n trace(\\\"Base 7: \\\" + base7.join(', '));\\n trace(\\\"Base 8: \\\" + base8.join(', '));\\n\\n }\\n\\n private function _getTerm(n:uint, base:uint = 2):Number {\\n\\n var r:Number = 0, p:uint, digit:uint;\\n var baseLog:Number = Math.log(base);\\n\\n while ( n > 0 ) {\\n p = Math.pow( base, uint(Math.log(n) / baseLog) );\\n\\n digit = n / p;\\n n %= p;\\n r += digit / (p * base);\\n }\\n\\n return r;\\n\\n }\\n\\n }\\n\\n}\\n\",\n \"language\": \"ActionScript\"\n },\n {\n \"code\": \"with Ada.Text_IO;\\n\\nprocedure Main is\\n package Float_IO is new Ada.Text_IO.Float_IO (Float);\\n function Van_Der_Corput (N : Natural; Base : Positive := 2) return Float is\\n Value : Natural := N;\\n Result : Float := 0.0;\\n Exponent : Positive := 1;\\n begin\\n while Value > 0 loop\\n Result := Result +\\n Float (Value mod Base) / Float (Base ** Exponent);\\n Value := Value / Base;\\n Exponent := Exponent + 1;\\n end loop;\\n return Result;\\n end Van_Der_Corput;\\nbegin\\n for Base in 2 .. 5 loop\\n Ada.Text_IO.Put (\\\"Base\\\" & Integer'Image (Base) & \\\":\\\");\\n for N in 1 .. 10 loop\\n Ada.Text_IO.Put (' ');\\n Float_IO.Put (Item => Van_Der_Corput (N, Base), Exp => 0);\\n end loop;\\n Ada.Text_IO.New_Line;\\n end loop;\\nend Main;\\n\",\n \"language\": \"Ada\"\n },\n {\n \"code\": \"BEGIN # show members of the van der Corput sequence in various bases #\\n # translated from the C sample #\\n\\n # sets num and denom to the numerator and denominator of the nth member #\\n # of the van der Corput sequence in the specified base #\\n PROC vc = ( INT nth, base, REF INT num, denom )VOID:\\n BEGIN\\n INT p := 0, q := 1, n := nth;\\n\\n WHILE n /= 0 DO\\n p *:= base +:= n MOD base;\\n q *:= base;\\n n OVERAB base\\n OD;\\n\\n num := p;\\n denom := q;\\n\\n # reduce the numerrator and denominator by their gcd #\\n WHILE p /= 0 DO n := p; p := q MOD p; q := n OD;\\n num OVERAB q;\\n denom OVERAB q\\n END # vc # ;\\n\\n # task #\\n FOR b FROM 2 TO 5 DO\\n print( ( \\\"base \\\", whole( b, 0 ), \\\":\\\" ) );\\n FOR i FROM 0 TO 9 DO\\n INT d, n;\\n vc( i, b, n, d );\\n IF n /= 0\\n THEN print( ( \\\" \\\", whole( n, 0 ), \\\"/\\\", whole( d, 0 ) ) )\\n ELSE print( ( \\\" 0\\\" ) )\\n FI\\n OD;\\n print( ( newline ) )\\n OD\\nEND\\n\",\n \"language\": \"ALGOL-68\"\n },\n {\n \"code\": \"corput: function [num, base][\\n result: to :rational 0\\n b: 1 // base\\n n: num\\n while [not? zero? n][\\n result: result + b * n % base\\n n: n / base\\n b: b // base\\n ]\\n return result\\n]\\n\\nloop 2..5 'bs ->\\n print [\\\"Base\\\" bs \\\":\\\" join.with:\\\", \\\" to [:string] map 1..10 'z -> corput z bs]\\n\",\n \"language\": \"Arturo\"\n },\n {\n \"code\": \"SetFormat, FloatFast, 0.5\\nfor i, v in [2, 3, 4, 5, 6] {\\n seq .= \\\"Base \\\" v \\\": \\\"\\n Loop, 10\\n seq .= VanDerCorput(A_Index - 1, v) (A_Index = 10 ? \\\"`n\\\" : \\\", \\\")\\n}\\nMsgBox, % seq\\n\\nVanDerCorput(n, b, r=0) {\\n while n\\n r += Mod(n, b) * b ** -A_Index, n := n // b\\n return, r\\n}\\n\",\n \"language\": \"AutoHotkey\"\n },\n {\n \"code\": \"# syntax: GAWK -f VAN_DER_CORPUT_SEQUENCE.AWK\\n# converted from BBC BASIC\\nBEGIN {\\n printf(\\\"base\\\")\\n for (i=0; i<=9; i++) {\\n printf(\\\" %7d\\\",i)\\n }\\n printf(\\\"\\\\n\\\")\\n for (base=2; base<=5; base++) {\\n printf(\\\"%-4s\\\",base)\\n for (i=0; i<=9; i++) {\\n printf(\\\" %7.5f\\\",vdc(i,base))\\n }\\n printf(\\\"\\\\n\\\")\\n }\\n exit(0)\\n}\\nfunction vdc(n,b, s,v) {\\n s = 1\\n while (n) {\\n s *= b\\n v += (n % b) / s\\n n /= b\\n n = int(n)\\n }\\n return(v)\\n}\\n\",\n \"language\": \"AWK\"\n },\n {\n \"code\": \"10 DEFINT A-Z\\n20 FOR B=2 TO 5\\n30 PRINT USING \\\"BASE #:\\\";B;\\n40 FOR I=0 TO 9\\n50 P=0: Q=1: N=I\\n60 IF N=0 GOTO 110\\n70 P=P*B+N MOD B\\n80 Q=Q*B\\n90 N=N\\\\B\\n100 GOTO 60\\n110 X=P: Y=Q\\n120 IF P=0 GOTO 150\\n130 N=P: P=Q MOD P: Q=N\\n140 GOTO 120\\n150 X=X\\\\Q\\n160 Y=Y\\\\Q\\n170 IF X=0 THEN PRINT \\\" 0\\\"; ELSE PRINT USING \\\" ##/##\\\";X;Y;\\n180 NEXT I\\n190 PRINT\\n200 NEXT B\\n\",\n \"language\": \"BASIC\"\n },\n {\n \"code\": \"function num_base$(number, base)\\n\\tif base > 9 then\\n\\t\\tprint \\\"base not handled by function\\\"\\n\\t\\tpause 5\\n\\t\\treturn \\\"\\\"\\n\\tend if\\n\\n\\tans$ = \\\"\\\"\\n\\n\\twhile number <> 0\\n\\t\\tn = (number mod base)\\n\\t\\tans$ = string(n) + ans$\\n\\t\\tnumber = number \\\\ base\\n\\tend while\\n\\n\\tif ans$ = \\\"\\\" then ans$ = \\\"0\\\"\\n\\n\\treturn \\\".\\\" + ans$\\nend function\\n\\nfor k = 2 to 5\\n\\tprint \\\"Base = \\\"; k\\n\\tfor l = 0 to 12\\n\\t\\tprint ljust(num_base$(l, k), 6);\\n\\tnext l\\n\\tprint : print\\nnext k\\nend\\n\",\n \"language\": \"BASIC256\"\n },\n {\n \"code\": \" @% = &20509\\n FOR base% = 2 TO 5\\n PRINT \\\"Base \\\" ; STR$(base%) \\\":\\\"\\n FOR number% = 0 TO 9\\n PRINT FNvdc(number%, base%);\\n NEXT\\n PRINT\\n NEXT\\n END\\n\\n DEF FNvdc(n%, b%)\\n LOCAL v, s%\\n s% = 1\\n WHILE n%\\n s% *= b%\\n v += (n% MOD b%) / s%\\n n% DIV= b%\\n ENDWHILE\\n = v\\n\",\n \"language\": \"BBC-BASIC\"\n },\n {\n \"code\": \"/*\\n * Return the _n_th term of the van der Corput sequence.\\n * Uses the current _ibase_.\\n */\\ndefine v(n) {\\n\\tauto c, r, s\\n\\n\\ts = scale\\n\\tscale = 0 /* to use integer division */\\n\\n\\t/*\\n\\t * c = count digits of n\\n\\t * r = reverse the digits of n\\n\\t */\\n\\tfor (0; n != 0; n /= 10) {\\n\\t\\tc += 1\\n\\t\\tr = (10 * r) + (n % 10)\\n\\t}\\n\\n\\t/* move radix point to left of digits */\\n\\tscale = length(r) + 6\\n\\tr /= 10 ^ c\\n\\n\\tscale = s\\n\\treturn r\\n}\\n\\nt = 10\\nfor (b = 2; b <= 4; b++) {\\n\\t\\\"base \\\"; b\\n\\tobase = b\\n\\tfor (i = 0; i < 10; i++) {\\n\\t\\tibase = b\\n\\t\\t\\\" \\\"; v(i)\\n\\t\\tibase = t\\n\\t}\\n\\tobase = t\\n}\\nquit\\n\",\n \"language\": \"Bc\"\n },\n {\n \"code\": \"get \\\"libhdr\\\"\\n\\nlet corput(n, base, num, denom) be\\n$( let p = 0 and q = 1\\n until n=0\\n $( p := p * base + n rem base\\n q := q * base\\n n := n / base\\n $)\\n\\n !num := p\\n !denom := q\\n\\n until p=0\\n $( n := p\\n p := q rem p\\n q := n\\n $)\\n\\n !num := !num / q\\n !denom := !denom / q\\n$)\\n\\nlet writefrac(num, denom) be\\n test num=0\\n do writes(\\\" 0\\\")\\n or writef(\\\" %N/%N\\\", num, denom)\\n\\nlet start() be\\n$( let num = ? and denom = ?\\n for base=2 to 5\\n $( writef(\\\"base %N:\\\", base)\\n for i=0 to 9\\n $( corput(i, base, @num, @denom)\\n writefrac(num, denom)\\n $)\\n wrch('*N')\\n $)\\n$)\\n\",\n \"language\": \"BCPL\"\n },\n {\n \"code\": \"#include <stdio.h>\\n\\nvoid vc(int n, int base, int *num, int *denom)\\n{\\n int p = 0, q = 1;\\n\\n while (n) {\\n p = p * base + (n % base);\\n q *= base;\\n n /= base;\\n }\\n\\n *num = p;\\n *denom = q;\\n\\n while (p) { n = p; p = q % p; q = n; }\\n *num /= q;\\n *denom /= q;\\n}\\n\\nint main()\\n{\\n int d, n, i, b;\\n for (b = 2; b < 6; b++) {\\n printf(\\\"base %d:\\\", b);\\n for (i = 0; i < 10; i++) {\\n vc(i, b, &n, &d);\\n if (n) printf(\\\" %d/%d\\\", n, d);\\n else printf(\\\" 0\\\");\\n }\\n printf(\\\"\\\\n\\\");\\n }\\n\\n return 0;\\n}\\n\",\n \"language\": \"C\"\n },\n {\n \"code\": \"#include <cmath>\\n#include <iostream>\\n\\ndouble vdc(int n, double base = 2)\\n{\\n double vdc = 0, denom = 1;\\n while (n)\\n {\\n vdc += fmod(n, base) / (denom *= base);\\n n /= base; // note: conversion from 'double' to 'int'\\n }\\n return vdc;\\n}\\n\\nint main()\\n{\\n for (double base = 2; base < 6; ++base)\\n {\\n std::cout << \\\"Base \\\" << base << \\\"\\\\n\\\";\\n for (int n = 0; n < 10; ++n)\\n {\\n std::cout << vdc(n, base) << \\\" \\\";\\n }\\n std::cout << \\\"\\\\n\\\\n\\\";\\n }\\n}\\n\",\n \"language\": \"C++\"\n },\n {\n \"code\": \"using System;\\nusing System.Collections.Generic;\\nusing System.Linq;\\nusing System.Text;\\n\\nnamespace VanDerCorput\\n{\\n /// <summary>\\n /// Computes the Van der Corput sequence for any number base.\\n /// The numbers in the sequence vary from zero to one, including zero but excluding one.\\n /// The sequence possesses low discrepancy.\\n /// Here are the first ten terms for bases 2 to 5:\\n ///\\n /// base 2: 0 1/2 1/4 3/4 1/8 5/8 3/8 7/8 1/16 9/16\\n /// base 3: 0 1/3 2/3 1/9 4/9 7/9 2/9 5/9 8/9 1/27\\n /// base 4: 0 1/4 1/2 3/4 1/16 5/16 9/16 13/16 1/8 3/8\\n /// base 5: 0 1/5 2/5 3/5 4/5 1/25 6/25 11/25 16/25 21/25\\n /// </summary>\\n /// <see cref=\\\"http://rosettacode.org/wiki/Van_der_Corput_sequence\\\"/>\\n public class VanDerCorputSequence: IEnumerable<Tuple<long,long>>\\n {\\n /// <summary>\\n /// Number base for the sequence, which must bwe two or more.\\n /// </summary>\\n public int Base { get; private set; }\\n\\n /// <summary>\\n /// Maximum number of terms to be returned by iterator.\\n /// </summary>\\n public long Count { get; private set; }\\n\\n /// <summary>\\n /// Construct a sequence for the given base.\\n /// </summary>\\n /// <param name=\\\"iBase\\\">Number base for the sequence.</param>\\n /// <param name=\\\"count\\\">Maximum number of items to be returned by the iterator.</param>\\n public VanDerCorputSequence(int iBase, long count = long.MaxValue) {\\n if (iBase < 2)\\n throw new ArgumentOutOfRangeException(\\\"iBase\\\", \\\"must be two or greater, not the given value of \\\" + iBase);\\n Base = iBase;\\n Count = count;\\n }\\n\\n /// <summary>\\n /// Compute nth term in the Van der Corput sequence for the base specified in the constructor.\\n /// </summary>\\n /// <param name=\\\"n\\\">The position in the sequence, which may be zero or any positive number.</param>\\n /// This number is always an integral power of the base.</param>\\n /// <returns>The Van der Corput sequence value expressed as a Tuple containing a numerator and a denominator.</returns>\\n public Tuple<long,long> Compute(long n)\\n {\\n long p = 0, q = 1;\\n long numerator, denominator;\\n while (n != 0)\\n {\\n p = p * Base + (n % Base);\\n q *= Base;\\n n /= Base;\\n }\\n numerator = p;\\n denominator = q;\\n while (p != 0)\\n {\\n n = p;\\n p = q % p;\\n q = n;\\n }\\n numerator /= q;\\n denominator /= q;\\n return new Tuple<long,long>(numerator, denominator);\\n }\\n\\n /// <summary>\\n /// Compute nth term in the Van der Corput sequence for the given base.\\n /// </summary>\\n /// <param name=\\\"iBase\\\">Base to use for the sequence.</param>\\n /// <param name=\\\"n\\\">The position in the sequence, which may be zero or any positive number.</param>\\n /// <returns>The Van der Corput sequence value expressed as a Tuple containing a numerator and a denominator.</returns>\\n public static Tuple<long, long> Compute(int iBase, long n)\\n {\\n var seq = new VanDerCorputSequence(iBase);\\n return seq.Compute(n);\\n }\\n\\n /// <summary>\\n /// Iterate over the Van Der Corput sequence.\\n /// The first value in the sequence is always zero, regardless of the base.\\n /// </summary>\\n /// <returns>A tuple whose items are the Van der Corput value given as a numerator and denominator.</returns>\\n public IEnumerator<Tuple<long, long>> GetEnumerator()\\n {\\n long iSequenceIndex = 0L;\\n while (iSequenceIndex < Count)\\n {\\n yield return Compute(iSequenceIndex);\\n iSequenceIndex++;\\n }\\n }\\n\\n System.Collections.IEnumerator System.Collections.IEnumerable.GetEnumerator()\\n {\\n return GetEnumerator();\\n }\\n }\\n\\n class Program\\n {\\n static void Main(string[] args)\\n {\\n TestBasesTwoThroughFive();\\n\\n Console.WriteLine(\\\"Type return to continue...\\\");\\n Console.ReadLine();\\n }\\n\\n static void TestBasesTwoThroughFive()\\n {\\n foreach (var seq in Enumerable.Range(2, 5).Select(x => new VanDerCorputSequence(x, 10))) // Just the first 10 elements of the each sequence\\n {\\n Console.Write(\\\"base \\\" + seq.Base + \\\":\\\");\\n foreach(var vc in seq)\\n Console.Write(\\\" \\\" + vc.Item1 + \\\"/\\\" + vc.Item2);\\n Console.WriteLine();\\n }\\n }\\n }\\n}\\n\",\n \"language\": \"C-sharp\"\n },\n {\n \"code\": \"(defn van-der-corput\\n \\\"Get the nth element of the van der Corput sequence.\\\"\\n ([n]\\n ;; Default base = 2\\n (van-der-corput n 2))\\n ([n base]\\n (let [s (/ 1 base)] ;; A multiplicand to shift to the right of the decimal.\\n ;; We essentially want to reverse the digits of n and put them after the\\n ;; decimal point. So, we repeatedly pull off the lowest digit of n, scale\\n ;; it to the right of the decimal point, and accumulate that.\\n (loop [sum 0\\n n n\\n scale s]\\n (if (zero? n)\\n sum ;; Base case: no digits left, so we're done.\\n (recur (+ sum (* (rem n base) scale)) ;; Accumulate the least digit\\n (quot n base) ;; Drop a digit of n\\n (* scale s))))))) ;; Move farther past the decimal\\n\\n(clojure.pprint/print-table\\n (cons :base (range 10)) ;; column headings\\n (for [base (range 2 6)] ;; rows\\n (into {:base base}\\n (for [n (range 10)] ;; table entries\\n [n (van-der-corput n base)]))))\\n\",\n \"language\": \"Clojure\"\n },\n {\n \"code\": \"vc = proc (n, base: int) returns (int, int)\\n p: int := 0\\n q: int := 1\\n while n ~= 0 do\\n p := p * base + n // base\\n q := q * base\\n n := n / base\\n end\\n num: int := p\\n denom: int := q\\n while p ~= 0 do\\n p, q := q // p, p\\n end\\n return(num/q, denom/q)\\nend vc\\n\\nprint_frac = proc (po: stream, num, denom: int)\\n if num=0 then\\n stream$puts(po, \\\" 0\\\")\\n else\\n stream$puts(po, \\\" \\\")\\n stream$putright(po, int$unparse(num), 2)\\n stream$puts(po, \\\"/\\\")\\n stream$putright(po, int$unparse(denom), 2)\\n end\\nend print_frac\\n\\nstart_up = proc ()\\n po: stream := stream$primary_output()\\n for base: int in int$from_to(2,5) do\\n stream$puts(po, \\\"base \\\" || int$unparse(base) || \\\":\\\")\\n for i: int in int$from_to(0, 9) do\\n n, d: int := vc(i, base)\\n print_frac(po, n, d)\\n end\\n stream$putl(po, \\\"\\\")\\n end\\nend start_up\\n\",\n \"language\": \"CLU\"\n },\n {\n \"code\": \"(defun van-der-Corput (n base)\\n (loop for d = 1 then (* d base) while (<= d n)\\n\\tfinally\\n\\t(return (/ (parse-integer\\n\\t\\t (reverse (write-to-string n :base base))\\n\\t\\t :radix base)\\n\\t\\t d))))\\n\\n(loop for base from 2 to 5 do\\n (format t \\\"Base ~a: ~{~6a~^~}~%\\\" base\\n\\t (loop for i to 10 collect (van-der-Corput i base))))\\n\",\n \"language\": \"Common-Lisp\"\n },\n {\n \"code\": \"include \\\"cowgol.coh\\\";\\n\\nsub vc(n: uint16, base: uint16): (num: uint16, denom: uint16) is\\n var p: uint16 := 0;\\n var q: uint16 := 1;\\n\\n while n != 0 loop\\n p := p * base + n % base;\\n q := q * base;\\n n := n / base;\\n end loop;\\n\\n num := p;\\n denom := q;\\n\\n while p != 0 loop\\n n := p;\\n p := q % p;\\n q := n;\\n end loop;\\n\\n num := num / q;\\n denom := denom / q;\\nend sub;\\n\\nsub printfrac(num: uint16, denom: uint16) is\\n if num == 0 then\\n print(\\\" 0\\\");\\n else\\n print(\\\" \\\");\\n print_i16(num);\\n print(\\\"/\\\");\\n print_i16(denom);\\n end if;\\nend sub;\\n\\nvar i: uint16;\\nvar base: uint16;\\nvar num: uint16;\\nvar denom: uint16;\\n\\nbase := 2;\\nwhile base < 6 loop\\n print(\\\"base \\\");\\n print_i16(base);\\n print(\\\":\\\");\\n i := 0;\\n while i < 10 loop\\n (num, denom) := vc(i, base);\\n printfrac(num, denom);\\n i := i + 1;\\n end loop;\\n print_nl();\\n base := base + 1;\\nend loop;\\n\",\n \"language\": \"Cowgol\"\n },\n {\n \"code\": \"double vdc(int n, in double base=2.0) pure nothrow @safe @nogc {\\n double vdc = 0.0, denom = 1.0;\\n while (n) {\\n denom *= base;\\n vdc += (n % base) / denom;\\n n /= base;\\n }\\n return vdc;\\n}\\n\\nvoid main() {\\n import std.stdio, std.algorithm, std.range;\\n\\n foreach (immutable b; 2 .. 6)\\n writeln(\\\"\\\\nBase \\\", b, \\\": \\\", 10.iota.map!(n => vdc(n, b)));\\n}\\n\",\n \"language\": \"D\"\n },\n {\n \"code\": \"function VanDerCorput(N,Base: integer): double;\\n{Calculate binary value for numbers right of decimal}\\nvar Value,Exponent,Digit: integer;\\nbegin\\nValue:= N; Result:= 0; Exponent:= -1;\\n{D1 * Base^-1 + D2 * Base^-2 + D3 * Base^-3}\\nwhile Value > 0 do\\n\\tbegin\\n\\t{Get digit in specified base}\\n\\tDigit:=Value mod Base;\\n\\t{Digit * Base^-Exponent}\\n\\tResult:=Result + Digit * Power(Base,Exponent);\\n\\t{Divide by base to put next digit in place}\\n\\tValue:= Value div Base;\\n\\t{Next exponent}\\n\\tDec(Exponent);\\n\\tend;\\nend;\\n\\n\\nprocedure ShowVanDerCorput(Memo: TMemo);\\n{Show Vander Coput numbers for bases 2..8 and items 1..9 }\\nvar Base,N: integer;\\nvar V: double;\\nvar S: string;\\nbegin\\nS:='';\\nfor Base:=2 to 8 do\\n\\tbegin\\n\\tS:=S+Format('Base %D:',[Base]);\\n\\tfor N:=1 to 10 do\\n\\t\\tbegin\\n\\t\\tV:=VanDerCorput(N,Base);\\n\\t\\tS:=S+Format(' %1.5f',[V]);\\n\\t\\tend;\\n\\tS:=S+CRLF;\\n\\tend;\\nMemo.Lines.Add(S);\\nend;\\n\",\n \"language\": \"Delphi\"\n },\n {\n \"code\": \"func vdc b n .\\n s = 1\\n while n > 0\\n s *= b\\n m = n mod b\\n v += m / s\\n n = n div b\\n .\\n return v\\n.\\nfor b = 2 to 5\\n write \\\"base \\\" & b & \\\":\\\"\\n for n range0 10\\n write \\\" \\\" & vdc b n\\n .\\n print \\\"\\\"\\n.\\n\",\n \"language\": \"EasyLang\"\n },\n {\n \"code\": \"[Van der Corput sequence for Rosetta Code.\\n EDSAC solution, Initial Orders 2.]\\n\\n[Library subroutine M3 - prints header at load time and is then overwritten.\\n Here, the last character sets the teleprinter to figures.]\\n PFGKIFAFRDLFUFOFE@A6FG@E8FEZPF\\n *VAN!DER!CORPUT!SEQUENCE@A*BIT!!!#35A*BIT@&#\\n ..PZ [blank tape then re-sync]\\n\\n[Define load addresses]\\n T55K P100F [V parameter: van der Corput subroutines]\\n T51K P64F [G parameter: print subroutine]\\n T47K P400F [M parameter: main routine]\\n\\n[Subroutines to return n'th element of van der Corput sequence.\\n 17-bit version: Call by GV, pass n in 0F (not preserved), result in 4F.\\n 35-bit version: Call by G1V, pass n in 0D (not preserved), result in 4D.]\\n E25K TV GK\\n G2@ [jump to 17-bit version]\\n G25@ [jump to 35-bit version]\\n[17-bit version.\\n On EDSAC, it's a matter of reversing the bits after the binary point\\n To save time, we use a table to reverse the 16 bits in groups of 4.]\\n [2] A3F T24@ [plant return link as usual]\\n H5 6@ [set mult reg to 0...01111 binary]\\n A55@ T4F [set marker bit 0...01 in result]\\n [7] A4F L4F T4F [shift result 4 left]\\n CF [acc := next 4 bits of n]\\n LD [shift into address field]\\n A58@ T14@ [plant A order to load from table]\\n [14] AF [{planted) load bits from table]\\n A4F [add to result]\\n G22@ [jump out if marker bit has reached sign bit]\\n T4F [update result]\\n AF R4F TF [shift n 4 right]\\n E7@ [always loop back]\\n [22] S57@ [done, remove marker bit]\\n T4F [store final result]\\n [24] ZF [(planted) jump to return to caller]\\n\\n[35-bit version. Very similar to the 17-bit version, except that\\n after reversing 8 groups of 4, there are 2 bits left over,\\n which require separate treatment.]\\n [25] A3F T54@ [plant return link as usual]\\n H56@ [set mult reg to 0...01111 binary]\\n YF L2F [set marker bit 0...0100 in result]\\n [30] L4F T4D [shift result 4 left]\\n CF LD A58@ T36@ AF A4F T4F [update from table as in 17-bit version]\\n ADR4FTD [shift n 4 right]\\n A4D [load result]\\n E30@ [if marker bit hasn't reached sign bit, loop back]\\n[Last 2 bits]\\n [44] L1FT4D [shift result 2 right]\\n CF LD A58@ T50@ [plant A order as in 17-bit version]\\n [50] AF [Planted) load bits from table]\\n R1F A4F T4F [shift table entry 2 right and add to result]\\n [54] ZF [(planted) jump to return to caller]\\n[Constants]\\n [55] PD [17-bit 1]\\n [56] P7D [17-bit 15]\\n [57] K4096F [17-bit 10...0 binary]\\n [58] A59@ [order to load from table{0}]\\n[Table to reverse group of 4 bits, e.g. table{0010b} = 0100b]\\n [59] PFP4FP2FP6FP1FP5FP3FP7FPDP4DP2DP6DP1DP5DP3DP7D\\n\\n[Library subroutine P1 to print number in range 0 <= x < 1.\\n Caller must print leading '0.' if required. 21 storage locations.]\\n E25K TG\\n GKA18@U17@S20@T5@H19@PFT5@VDUFOFFFSFL4FTDA5@A2FG6@EFU3FJFM1F\\n\\n[Main routine]\\n E25K TM GK\\n [0] PF PF [n, 35 bits, must be at even address]\\n [2] PF [negative count of terms]\\n [3] P10F [<=== EDIT number of terms, in address field]\\n [4] PD [17-bit integer 1]\\n [5] MF [dot (in figures mode)]\\n [6] @F [carriage return]\\n [7] &F [line feed]\\n [8] !F [space character]\\n [9] K4096F [null character]\\n\\n[Enter with acc = 0]\\n [10] T#@ [n := 0]\\n S3@ T2@ [initialize negative count]\\n [13] A@ TF [pass 17-bit n in 0F]\\n [15] A15@ GV [call 17-bit van der Corput routine]\\n TD [clear 0D, including sandwich bit]\\n A4F T1F [extend 17-bit result to 35 bits in 0D]\\n O4@ O5@ [print '0.']\\n [22] A22@ GG P5F [print result to 5 decimals]\\n O8@ O8@ [print 2 spaces]\\n A#@ TD [pass 35-bit n in 0D]\\n [29] A29@ G1V [call 35-bit van der Corput routine]\\n A4D TD [pass result in 0D]\\n O4@ O5@ [print '0.']\\n [35] A35@ GG P10F [print result to 10 decimals]\\n O6@ O7@ [print CR LF]\\n A2@ A2F [inc negative count]\\n E48@ [jump out if count = 0]\\n T2@ [update count]\\n A@ A4@ T@ [inc n]\\n E13@ [loop back]\\n [48] O9@ [print null to flush teleprinter buffer]\\n ZF [stop]\\n\\n E10Z [define entry point]\\n PF [acc = 0 on entry]\\n[end]\\n\",\n \"language\": \"EDSAC-order-code\"\n },\n {\n \"code\": \"open random number list\\n\\nvdc bs n = vdc' 0.0 1.0 n\\n where vdc' v d n\\n | n > 0 = vdc' v' d' n'\\n | else = v\\n where\\n d' = d * bs\\n rem = n % bs\\n n' = truncate (n / bs)\\n v' = v + rem / d'\\n\",\n \"language\": \"Ela\"\n },\n {\n \"code\": \"take 10 <| map' (vdc 2.0) [1..]\\n\",\n \"language\": \"Ela\"\n },\n {\n \"code\": \"defmodule Van_der_corput do\\n def sequence( n, base \\\\\\\\ 2 ) do\\n \\\"0.\\\" <> (Integer.to_string(n, base) |> String.reverse )\\n end\\n\\n def float( n, base \\\\\\\\ 2 ) do\\n Integer.digits(n, base) |> Enum.reduce(0, fn i,acc -> (i + acc) / base end)\\n end\\n\\n def fraction( n, base \\\\\\\\ 2 ) do\\n str = Integer.to_string(n, base) |> String.reverse\\n denominator = Enum.reduce(1..String.length(str), 1, fn _,acc -> acc*base end)\\n reduction( String.to_integer(str, base), denominator )\\n end\\n\\n defp reduction( 0, _ ), do: \\\"0\\\"\\n defp reduction( numerator, denominator ) do\\n gcd = gcd( numerator, denominator )\\n \\\"#{ div(numerator, gcd) }/#{ div(denominator, gcd) }\\\"\\n end\\n\\n defp gcd( a, 0 ), do: a\\n defp gcd( a, b ), do: gcd( b, rem(a, b) )\\nend\\n\\nfuns = [ {\\\"Float(Base):\\\", &Van_der_corput.sequence/2},\\n {\\\"Float(Decimal):\\\", &Van_der_corput.float/2 },\\n {\\\"Fraction:\\\", &Van_der_corput.fraction/2} ]\\nEnum.each(funs, fn {title, fun} ->\\n IO.puts title\\n Enum.each(2..5, fn base ->\\n IO.puts \\\" Base #{ base }: #{ Enum.map_join(0..9, \\\", \\\", &fun.(&1, base)) }\\\"\\n end)\\nend)\\n\",\n \"language\": \"Elixir\"\n },\n {\n \"code\": \"-module( van_der_corput ).\\n\\n-export( [sequence/1, sequence/2, task/0] ).\\n\\nsequence( N ) -> sequence( N, 2 ).\\n\\nsequence( 0, _Base ) -> 0.0;\\nsequence( N, Base ) -> erlang:list_to_float( \\\"0.\\\" ++ lists:flatten([erlang:integer_to_list(X) || X <- sequence_loop(N, Base)]) ).\\n\\ntask() -> [task(X) || X <- lists:seq(2, 5)].\\n\\n\\n\\nsequence_loop( 0, _Base ) -> [];\\nsequence_loop( N, Base ) ->\\n\\tNew_n = N div Base,\\n\\tDigit = N rem Base,\\n\\t[Digit | sequence_loop( New_n, Base )].\\n\\ntask( Base ) ->\\n\\tio:fwrite( \\\"Base ~p:\\\", [Base] ),\\n\\t[io:fwrite( \\\" ~p\\\", [sequence(X, Base)] ) || X <- lists:seq(0, 9)],\\n\\tio:fwrite( \\\"~n\\\" ).\\n\",\n \"language\": \"Erlang\"\n },\n {\n \"code\": \"PROGRAM VAN_DER_CORPUT\\n\\n!\\n! for rosettacode.org\\n!\\n\\nPROCEDURE VDC(N%,B%->RES)\\n LOCAL V,S%\\n S%=1\\n WHILE N%>0 DO\\n S%*=B%\\n V+=(N% MOD B%)/S%\\n N%=N% DIV B%\\n END WHILE\\n RES=V\\nEND PROCEDURE\\n\\nBEGIN\\n FOR BASE%=2 TO 5 DO\\n PRINT(\\\"Base\\\";STR$(BASE%);\\\":\\\")\\n FOR NUMBER%=0 TO 9 DO\\n VDC(NUMBER%,BASE%->RES)\\n WRITE(\\\"#.##### \\\";RES;)\\n END FOR\\n PRINT\\n END FOR\\nEND PROGRAM\\n\",\n \"language\": \"ERRE\"\n },\n {\n \"code\": \"function vdc(integer n, atom base)\\n atom vdc, denom, rem\\n vdc = 0\\n denom = 1\\n while n do\\n denom *= base\\n rem = remainder(n,base)\\n n = floor(n/base)\\n vdc += rem / denom\\n end while\\n return vdc\\nend function\\n\\nfor i = 2 to 5 do\\n printf(1,\\\"Base %d\\\\n\\\",i)\\n for j = 0 to 9 do\\n printf(1,\\\"%g \\\",vdc(j,i))\\n end for\\n puts(1,\\\"\\\\n\\\\n\\\")\\nend for\\n\",\n \"language\": \"Euphoria\"\n },\n {\n \"code\": \"open System\\n\\nlet vdc n b =\\n let rec loop n denom acc =\\n if n > 0l then\\n let m, remainder = Math.DivRem(n, b)\\n loop m (denom * b) (acc + (float remainder) / (float (denom * b)))\\n else acc\\n loop n 1 0.0\\n\\n\\n[<EntryPoint>]\\nlet main argv =\\n printfn \\\"%A\\\" [ for n in 0 .. 9 -> (vdc n 2) ]\\n printfn \\\"%A\\\" [ for n in 0 .. 9 -> (vdc n 5) ]\\n 0\\n\",\n \"language\": \"F-Sharp\"\n },\n {\n \"code\": \"USING: formatting fry io kernel math math.functions math.parser\\nmath.ranges sequences ;\\nIN: rosetta-code.van-der-corput\\n\\n: vdc ( n base -- x )\\n [ >base string>digits <reversed> ]\\n [ nip '[ 1 + neg _ swap ^ * ] ] 2bi map-index sum ;\\n\\n: vdc-demo ( -- )\\n 2 5 [a,b] [\\n dup \\\"Base %d: \\\" printf 10 <iota>\\n [ swap vdc \\\"%-5u \\\" printf ] with each nl\\n ] each ;\\n\\nMAIN: vdc-demo\\n\",\n \"language\": \"Factor\"\n },\n {\n \"code\": \": fvdc ( base n -- f )\\n 0e 1e ( F: vdc denominator )\\n begin dup while\\n over s>d d>f f*\\n over /mod ( base rem n )\\n swap s>d d>f fover f/\\n frot f+ fswap\\n repeat 2drop fdrop ;\\n\\n: test 10 0 do 2 i fvdc cr f. loop ;\\n\",\n \"language\": \"Forth\"\n },\n {\n \"code\": \" FUNCTION VDC(N,BASE)\\t!Calculates a Van der Corput number...\\nConverts 1234 in decimal to 4321 in V, and P = 10000.\\n INTEGER N\\t!For this integer,\\n INTEGER BASE\\t!In this base.\\n INTEGER I\\t!A copy of N that can be damaged.\\n INTEGER P\\t!Successive powers of BASE.\\n INTEGER V\\t!Accumulates digits.\\n P = 1\\t\\t! = BASE**0\\n V = 0\\t\\t!Start with no digits, as if N = 0.\\n I = N\\t\\t!Here we go.\\n DO WHILE (I .NE. 0)\\t!While something remains,\\n V = V*BASE + MOD(I,BASE)\\t!Extract its low-order digit.\\n I = I/BASE\\t\\t\\t!Reduce it by a power.\\n P = P*BASE\\t\\t\\t!And track the power.\\n END DO\\t\\t\\t!Thus extract the digits in reverse order: right-to-left.\\n VDC = V/FLOAT(P)\\t!The power is one above the highest digit.\\n END FUNCTION VDC\\t!Numerology is weird.\\n\\n PROGRAM POKE\\n INTEGER FIRST,LAST\\t!Might as well document some constants.\\n PARAMETER (FIRST = 0,LAST = 9)\\t!Thus, the first ten values.\\n INTEGER I,BASE\\t\\t!Steppers.\\n REAL VDC\\t\\t\\t!Stop the compiler moaning about undeclared items.\\n\\n WRITE (6,1) FIRST,LAST,(I, I = FIRST,LAST)\\t!Announce.\\n 1 FORMAT (\\\"Calculates values \\\",I0,\\\" to \\\",I0,\\\" of the \\\",\\n 1 \\\"Van der Corput sequence, in various bases.\\\"/\\n 2 \\\"Base\\\",666I9)\\n\\n DO BASE = 2,13\\t!A selection of bases.\\n WRITE (6,2) BASE,(VDC(I,BASE), I = FIRST,LAST)\\t!Show the specified span.\\n 2 FORMAT (I4,666F9.6)\\t!Aligns with FORMAT 1.\\n END DO\\t\\t!On to the next base.\\n\\n END\\n\",\n \"language\": \"Fortran\"\n },\n {\n \"code\": \"' version 03-12-2016\\n' compile with: fbc -s console\\n\\nFunction num_base(number As ULongInt, _base_ As UInteger) As String\\n\\n If _base_ > 9 Then\\n Print \\\"base not handled by function\\\"\\n Sleep 5000\\n Return \\\"\\\"\\n End If\\n\\n Dim As ULongInt n\\n Dim As String ans\\n\\n While number <> 0\\n n = number Mod _base_\\n ans = Str(n) + ans\\n number = number \\\\ _base_\\n Wend\\n\\n If ans = \\\"\\\" Then ans = \\\"0\\\"\\n\\n Return \\\".\\\" + ans\\n\\nEnd Function\\n\\n' ------=< MAIN >=------\\n\\nDim As ULong k, l\\nFor k = 2 To 5\\n Print \\\"Base = \\\"; k\\n For l = 0 To 12\\n Print left(num_base(l, k) + \\\" \\\",6);\\n Next\\n Print : print\\nNext\\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 v2(n uint) (r float64) {\\n p := .5\\n for n > 0 {\\n if n&1 == 1 {\\n r += p\\n }\\n p *= .5\\n n >>= 1\\n }\\n return\\n}\\n\\nfunc newV(base uint) func(uint) float64 {\\n invb := 1 / float64(base)\\n return func(n uint) (r float64) {\\n p := invb\\n for n > 0 {\\n r += p * float64(n%base)\\n p *= invb\\n n /= base\\n }\\n return\\n }\\n}\\n\\nfunc main() {\\n fmt.Println(\\\"Base 2:\\\")\\n for i := uint(0); i < 10; i++ {\\n fmt.Println(i, v2(i))\\n }\\n fmt.Println(\\\"Base 3:\\\")\\n v3 := newV(3)\\n for i := uint(0); i < 10; i++ {\\n fmt.Println(i, v3(i))\\n }\\n}\\n\",\n \"language\": \"Go\"\n },\n {\n \"code\": \"import Data.Ratio (Rational(..), (%), numerator, denominator)\\nimport Data.List (unfoldr)\\nimport Text.Printf (printf)\\n\\n-- A wrapper type for Rationals to make them look nicer when we print them.\\nnewtype Rat =\\n Rat Rational\\n\\ninstance Show Rat where\\n show (Rat n) = show (numerator n) <> ('/' : show (denominator n))\\n\\n-- Convert a list of base b digits to its corresponding number.\\n-- We assume the digits are valid base b numbers and that\\n-- their order is from least to most significant.\\ndigitsToNum :: Integer -> [Integer] -> Integer\\ndigitsToNum b = foldr1 (\\\\d acc -> b * acc + d)\\n\\n-- Convert a number to the list of its base b digits.\\n-- The order will be from least to most significant.\\nnumToDigits :: Integer -> Integer -> [Integer]\\nnumToDigits _ 0 = [0]\\nnumToDigits b n = unfoldr step n\\n where\\n step 0 = Nothing\\n step m =\\n let (q, r) = m `quotRem` b\\n in Just (r, q)\\n\\n-- Return the n'th element in the base b van der Corput sequence.\\n-- The base must be ≥ 2.\\nvdc :: Integer -> Integer -> Rat\\nvdc b n\\n | b < 2 = error \\\"vdc: base must be ≥ 2\\\"\\n | otherwise =\\n let ds = reverse $ numToDigits b n\\n in Rat (digitsToNum b ds % b ^ length ds)\\n\\n-- Each base followed by a specified range of van der Corput numbers.\\nprintVdcRanges :: ([Integer], [Integer]) -> IO ()\\nprintVdcRanges (bases, nums) =\\n mapM_\\n putStrLn\\n [ printf \\\"Base %d:\\\" b <> concatMap (printf \\\" %5s\\\" . show) rs\\n | b <- bases\\n , let rs = map (vdc b) nums ]\\n\\nmain :: IO ()\\nmain = do\\n -- Small bases:\\n printVdcRanges ([2, 3, 4, 5], [0 .. 9])\\n putStrLn []\\n\\n -- Base 123:\\n printVdcRanges ([123], [50,100 .. 300])\\n\",\n \"language\": \"Haskell\"\n },\n {\n \"code\": \"procedure main(A)\\n base := integer(get(A)) | 2\\n every writes(round(vdc(0 to 9,base),10),\\\" \\\")\\n write()\\nend\\n\\nprocedure vdc(n, base)\\n e := 1.0\\n x := 0.0\\n while x +:= 1(((0 < n) % base) / (e *:= base), n /:= base)\\n return x\\nend\\n\\nprocedure round(n,d)\\n places := 10 ^ d\\n return real(integer(n*places + 0.5)) / places\\nend\\n\",\n \"language\": \"Icon\"\n },\n {\n \"code\": \"procedure vdc(n, base)\\n s1 := create |((0 < 1(.n, n /:= base)) % base)\\n s2 := create 2(e := 1.0, |(e *:= base))\\n every (result := 0) +:= |s1() / s2()\\n return result\\nend\\n\",\n \"language\": \"Icon\"\n },\n {\n \"code\": \"vdc=: ([ %~ %@[ #. #.inv)\\\"0 _\\n\",\n \"language\": \"J\"\n },\n {\n \"code\": \" 2 vdc i.10 NB. 1st 10 nums of Van der Corput sequence in base 2\\n0 0.5 0.25 0.75 0.125 0.625 0.375 0.875 0.0625 0.5625\\n 2x vdc i.10 NB. as above but using rational nums\\n0 1r2 1r4 3r4 1r8 5r8 3r8 7r8 1r16 9r16\\n 2 3 4 5x vdc i.10 NB. 1st 10 nums of Van der Corput sequence in bases 2 3 4 5\\n0 1r2 1r4 3r4 1r8 5r8 3r8 7r8 1r16 9r16\\n0 1r3 2r3 1r9 4r9 7r9 2r9 5r9 8r9 1r27\\n0 1r4 1r2 3r4 1r16 5r16 9r16 13r16 1r8 3r8\\n0 1r5 2r5 3r5 4r5 1r25 6r25 11r25 16r25 21r25\\n\",\n \"language\": \"J\"\n },\n {\n \"code\": \"public class VanDerCorput{\\n\\tpublic static double vdc(int n){\\n\\t\\tdouble vdc = 0;\\n\\t\\tint denom = 1;\\n\\t\\twhile(n != 0){\\n\\t\\t\\tvdc += n % 2.0 / (denom *= 2);\\n\\t\\t\\tn /= 2;\\n\\t\\t}\\n\\t\\treturn vdc;\\n\\t}\\n\\t\\n\\tpublic static void main(String[] args){\\n\\t\\tfor(int i = 0; i <= 10; i++){\\n\\t\\t\\tSystem.out.println(vdc(i));\\n\\t\\t}\\n\\t}\\n}\\n\",\n \"language\": \"Java\"\n },\n {\n \"code\": \"# vdc(base) converts an input decimal integer to a decimal number based on the van der\\n# Corput sequence using base 'base', e.g. (4 | vdc(2)) is 0.125.\\n#\\ndef vdc(base):\\n\\n # The helper function converts a stream of residuals to a decimal,\\n # e.g. if base is 2, then decimalize( (0,0,1) ) yields 0.125\\n def decimalize(stream):\\n reduce stream as $d # state: [accumulator, power]\\n ( [0, 1/base];\\n .[1] as $power | [ .[0] + ($d * $power), $power / base] )\\n | .[0];\\n\\n if . == 0 then 0\\n else decimalize(recurse( if . == 0 then empty else ./base | floor end ) % base)\\n end ;\\n\",\n \"language\": \"Jq\"\n },\n {\n \"code\": \"def 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\\nrange(2;6) | . as $base | \\\"Base \\\\(.): \\\\( [ range(0;11) | vdc($base)|round(1000) ] )\\\"\\n\",\n \"language\": \"Jq\"\n },\n {\n \"code\": \"$ jq -n -f -c -r van_der_corput_sequence.jq\\nBase 2: [0,0.5,0.25,0.75,0.125,0.625,0.375,0.875,0.063,0.563,0.313]\\nBase 3: [0,0.333,0.667,0.111,0.444,0.778,0.222,0.556,0.889,0.037,0.37]\\nBase 4: [0,0.25,0.5,0.75,0.063,0.313,0.563,0.813,0.125,0.375,0.625]\\nBase 5: [0,0.2,0.4,0.6,0.8,0.04,0.24,0.44,0.64,0.84,0.08]\\n\",\n \"language\": \"Jq\"\n },\n {\n \"code\": \"using Printf\\n\\nvandercorput(num::Integer, base::Integer) = sum(d * Float64(base) ^ -ex for (ex, d) in enumerate(digits(num, base = base)))\\n\\nfor base in 2:9\\n @printf(\\\"%10s %i:\\\", \\\"Base\\\", base)\\n for num in 0:9 @printf(\\\"%7.3f\\\", vandercorput(num, base)) end\\n println(\\\" [...]\\\")\\nend\\n\",\n \"language\": \"Julia\"\n },\n {\n \"code\": \"// version 1.1.2\\n\\ndata class Rational(val num: Int, val denom: Int)\\n\\nfun vdc(n: Int, base: Int): Rational {\\n var p = 0\\n var q = 1\\n var nn = n\\n while (nn != 0) {\\n p = p * base + nn % base\\n q *= base\\n nn /= base\\n }\\n val num = p\\n val denom = q\\n while (p != 0) {\\n nn = p\\n p = q % p\\n q = nn\\n }\\n return Rational(num / q, denom / q)\\n}\\n\\nfun main(args: Array<String>) {\\n for (b in 2..5) {\\n print(\\\"base $b:\\\")\\n for (i in 0..9) {\\n val(num, denom) = vdc(i, b)\\n if (num != 0) print(\\\" $num/$denom\\\")\\n else print(\\\" 0\\\")\\n }\\n println()\\n }\\n}\\n\",\n \"language\": \"Kotlin\"\n },\n {\n \"code\": \"function vdc(n, base)\\n local digits = {}\\n while n ~= 0 do\\n local m = math.floor(n / base)\\n table.insert(digits, n - m * base)\\n n = m\\n end\\n m = 0\\n for p, d in pairs(digits) do\\n m = m + math.pow(base, -p) * d\\n end\\n return m\\nend\\n\",\n \"language\": \"Lua\"\n },\n {\n \"code\": \"function vdc( nth, base ) -- returns the numerator & denominator of the sequence element n in base\\n local p, q, n = 0, 1, nth\\n while n ~= 0 do\\n p = p * base\\n p = p + n % base;\\n q = q * base;\\n n = math.floor( n / base )\\n end\\n local num, denom = p, q;\\n -- reduce the numerator and denominator by their gcd\\n while p ~= 0 do\\n n = p\\n p = q % p\\n q = n\\n end\\n num = math.floor( num / q )\\n denom = math.floor( denom / q )\\n return num, denom\\nend\\nfor b = 2,5 do\\n io.write( \\\"base \\\", b, \\\": \\\" )\\n for n = 0,9 do\\n local num, denom = vdc( n, b )\\n io.write( \\\" \\\", num ) if num ~= 0 then io.write( \\\"/\\\", denom ) end\\n end\\n io.write( \\\"\\\\n\\\" )\\nend\\n\",\n \"language\": \"Lua\"\n },\n {\n \"code\": \"Halton:=proc(n,b)\\n local i:=n,k:=1,s:=0,r;\\n while i>0 do\\n k/=b;\\n i:=iquo(i,b,'r');\\n s+=k*r\\n od;\\n s\\nend;\\n\\nmap(Halton,[$1..10],2);\\n# [1/2, 1/4, 3/4, 1/8, 5/8, 3/8, 7/8, 1/16, 9/16, 5/16]\\n\\nmap(Halton,[$1..10],3);\\n# [1/3, 2/3, 1/9, 4/9, 7/9, 2/9, 5/9, 8/9, 1/27, 10/27]\\n\\nmap(Halton,[$1..10],4);\\n# [1/4, 1/2, 3/4, 1/16, 5/16, 9/16, 13/16, 1/8, 3/8, 5/8]\\n\\nmap(Halton,[$1..10],5);\\n[1/5, 2/5, 3/5, 4/5, 1/25, 6/25, 11/25, 16/25, 21/25, 2/25]\\n\",\n \"language\": \"Maple\"\n },\n {\n \"code\": \"VanDerCorput[n_,base_:2]:=Table[\\n FromDigits[{Reverse[IntegerDigits[k,base]],0},base],\\n{k,n}]\\nVanDerCorput[10,2]\\nVanDerCorput[10,3]\\nVanDerCorput[10,4]\\nVanDerCorput[10,5]\\n\",\n \"language\": \"Mathematica\"\n },\n {\n \"code\": \" function x = corput (n)\\n b = dec2bin(1:n)-'0'; % generate sequence of binary numbers from 1 to n\\n l = size(b,2); % get number of binary digits\\n w = (1:l)-l-1; % 2.^w are the weights\\n x = b * ( 2.^w'); % matrix times vector multiplication for\\n end;\\n\",\n \"language\": \"MATLAB\"\n },\n {\n \"code\": \"/* convert a decimal integer to a list of digits in base `base' */\\ndec2digits(d, base):= block([digits: []],\\n while (d>0) do block([newdi: mod(d, base)],\\n digits: cons(newdi, digits),\\n d: round( (d - newdi) / base)),\\n digits)$\\n\\ndec2digits(123, 10);\\n/* [1, 2, 3] */\\ndec2digits( 8, 2);\\n/* [1, 0, 0, 0] */\\n\",\n \"language\": \"Maxima\"\n },\n {\n \"code\": \"/* convert a list of digits in base `base' to a decimal integer */\\ndigits2dec(l, base):= block([s: 0, po: 1],\\n for di in reverse(l) do (s: di*po + s, po: po*base),\\n s)$\\n\\ndigits2dec([1, 2, 3], 10);\\n/* 123 */\\ndigits2dec([1, 0, 0, 0], 2);\\n/* 8 */\\n\",\n \"language\": \"Maxima\"\n },\n {\n \"code\": \"vdc(n, base):= makelist(\\n digits2dec(\\n dec2digits(k, base),\\n 1/base) / base,\\n k, n);\\n\\nvdc(10, 2);\\n/*\\n 1 1 3 1 5 3 7 1 9 5\\n(%o123) [-, -, -, -, -, -, -, --, --, --]\\n 2 4 4 8 8 8 8 16 16 16\\n*/\\n\\nvdc(10, 5);\\n/*\\n 1 2 3 4 1 6 11 16 21 2\\n(%o124) [-, -, -, -, --, --, --, --, --, --]\\n 5 5 5 5 25 25 25 25 25 25\\n*/\\n\",\n \"language\": \"Maxima\"\n },\n {\n \"code\": \"/* 11 in decimal is */\\ndigits: digits2dec([box(1), box(0), box(1), box(1)], box(2));\\naux: expand(digits2dec(digits, 1/base) / base)$\\nsimp: false$\\n/* reflected this would become ... */\\nsubst(box(2), base, aux);\\nsimp: true$\\n\\n/*\\n\\n 3 2\\n \\\"\\\"\\\" \\\"\\\"\\\" \\\"\\\"\\\" \\\"\\\"\\\" \\\"\\\"\\\" \\\"\\\"\\\" \\\"\\\"\\\"\\n(%o126) \\\"2\\\" \\\"1\\\" + \\\"2\\\" \\\"0\\\" + \\\"2\\\" \\\"1\\\" + \\\"1\\\"\\n \\\"\\\"\\\" \\\"\\\"\\\" \\\"\\\"\\\" \\\"\\\"\\\" \\\"\\\"\\\" \\\"\\\"\\\" \\\"\\\"\\\"\\n\\n - 4 - 3 - 2 - 1\\n \\\"\\\"\\\" \\\"\\\"\\\" \\\"\\\"\\\" \\\"\\\"\\\" \\\"\\\"\\\" \\\"\\\"\\\" \\\"\\\"\\\" \\\"\\\"\\\"\\n(%o129) \\\"1\\\" \\\"2\\\" + \\\"0\\\" \\\"2\\\" + \\\"1\\\" \\\"2\\\" + \\\"1\\\" \\\"2\\\"\\n \\\"\\\"\\\" \\\"\\\"\\\" \\\"\\\"\\\" \\\"\\\"\\\" \\\"\\\"\\\" \\\"\\\"\\\" \\\"\\\"\\\" \\\"\\\"\\\"\\n\\n*/\\n\",\n \"language\": \"Maxima\"\n },\n {\n \"code\": \"MODULE Sequence;\\nFROM FormatString IMPORT FormatString;\\nFROM Terminal IMPORT WriteString,WriteLn,ReadChar;\\n\\nPROCEDURE vc(n,base : INTEGER; VAR num,denom : INTEGER);\\nVAR p,q : INTEGER;\\nBEGIN\\n p := 0;\\n q := 1;\\n\\n WHILE n#0 DO\\n p := p * base + (n MOD base);\\n q := q * base;\\n n := n DIV base\\n END;\\n\\n num := p;\\n denom := q;\\n\\n WHILE p#0 DO\\n n := p;\\n p := q MOD p;\\n q := n\\n END;\\n\\n num := num DIV q;\\n denom := denom DIV q\\nEND vc;\\n\\nVAR\\n buf : ARRAY[0..31] OF CHAR;\\n d,n,i,b : INTEGER;\\nBEGIN\\n FOR b:=2 TO 5 DO\\n FormatString(\\\"base %i:\\\", buf, b);\\n WriteString(buf);\\n FOR i:=0 TO 9 DO\\n vc(i,b,n,d);\\n IF n#0 THEN\\n FormatString(\\\" %i/%i\\\", buf, n, d);\\n WriteString(buf)\\n ELSE\\n WriteString(\\\" 0\\\")\\n END\\n END;\\n WriteLn\\n END;\\n\\n ReadChar\\nEND Sequence.\\n\",\n \"language\": \"Modula-2\"\n },\n {\n \"code\": \"import rationals, strutils, sugar\\n\\ntype Fract = Rational[int]\\n\\nproc corput(n: int; base: Positive): Fract =\\n result = 0.toRational\\n var b = 1 // base\\n var n = n\\n while n != 0:\\n result += n mod base * b\\n n = n div base\\n b /= base\\n\\nfor base in 2..5:\\n let list = collect(newSeq, for n in 1..10: corput(n, base))\\n echo \\\"Base $#: \\\".format(base), list.join(\\\" \\\")\\n\",\n \"language\": \"Nim\"\n },\n {\n \"code\": \"VdC(n)=n=binary(n);sum(i=1,#n,if(n[i],1.>>(#n+1-i)));\\nVdC(n)=sum(i=1,#binary(n),if(bittest(n,i-1),1.>>i)); \\\\\\\\ Alternate approach\\nvector(10,n,VdC(n))\\n\",\n \"language\": \"PARI-GP\"\n },\n {\n \"code\": \"Program VanDerCorput;\\n{$IFDEF FPC}\\n {$MODE DELPHI}\\n{$ELSE}\\n {$APPTYPE CONSOLE}\\n{$ENDIF}\\n\\ntype\\n tvdrCallback = procedure (nom,denom: NativeInt);\\n\\n{ Base=2\\nfunction rev2(n,Pot:NativeUint):NativeUint;\\nvar\\n r : Nativeint;\\nbegin\\n r := 0;\\n while Pot > 0 do\\n Begin\\n r := r shl 1 OR (n AND 1);\\n n := n shr 1;\\n dec(Pot);\\n end;\\n rev2 := r;\\nend;\\n}\\n\\nfunction reverse(n,base,Pot:NativeUint):NativeUint;\\nvar\\n r,c : Nativeint;\\nbegin\\n r := 0;\\n//No need to test n> 0 in this special case, n starting in upper half\\n while Pot > 0 do\\n Begin\\n c := n div base;\\n r := n+(r-c)*base;\\n n := c;\\n dec(Pot);\\n end;\\n reverse := r;\\nend;\\n\\nprocedure VanDerCorput(base,count:NativeUint;f:tvdrCallback);\\n//calculates count nominater and denominater of Van der Corput sequence\\n// to base\\nvar\\n Pot,\\n denom,nom,\\n i : NativeUint;\\nBegin\\n denom := 1;\\n Pot := 0;\\n while count > 0 do\\n Begin\\n IF Pot = 0 then\\n f(0,1);\\n //start in upper half\\n i := denom;\\n inc(Pot);\\n denom := denom *base;\\n\\n repeat\\n nom := reverse(i,base,Pot);\\n IF count > 0 then\\n f(nom,denom)\\n else\\n break;\\n inc(i);\\n dec(count);\\n until i >= denom;\\n end;\\nend;\\n\\nprocedure vdrOutPut(nom,denom: NativeInt);\\nBegin\\n write(nom,'/',denom,' ');\\nend;\\n\\nvar\\n i : NativeUint;\\nBegin\\n For i := 2 to 5 do\\n Begin\\n write(' Base ',i:2,' :');\\n VanDerCorput(i,9,@vdrOutPut);\\n writeln;\\n end;\\nend.\\n\",\n \"language\": \"Pascal\"\n },\n {\n \"code\": \"sub vdc {\\n my @value = shift;\\n my $base = shift // 2;\\n use integer;\\n push @value, $value[-1] / $base while $value[-1] > 0;\\n my ($x, $sum) = (1, 0);\\n no integer;\\n $sum += ($_ % $base) / ($x *= $base) for @value;\\n return $sum;\\n}\\n\\nfor my $base ( 2 .. 5 ) {\\n print \\\"base $base: \\\", join ' ', map { vdc($_, $base) } 0 .. 10;\\n print \\\"\\\\n\\\";\\n}\\n\",\n \"language\": \"Perl\"\n },\n {\n \"code\": \"(phixonline)-->\\n <span style=\\\"color: #008080;\\\">enum</span> <span style=\\\"color: #000000;\\\">BASE</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">FRAC</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">DECIMAL</span>\\n <span style=\\\"color: #008080;\\\">constant</span> <span style=\\\"color: #000000;\\\">DESC</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #0000FF;\\\">{</span><span style=\\\"color: #008000;\\\">\\\"Base\\\"</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #008000;\\\">\\\"Fraction\\\"</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #008000;\\\">\\\"Decimal\\\"</span><span style=\\\"color: #0000FF;\\\">}</span>\\n\\n <span style=\\\"color: #008080;\\\">function</span> <span style=\\\"color: #000000;\\\">vdc</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #004080;\\\">integer</span> <span style=\\\"color: #000000;\\\">n</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #004080;\\\">atom</span> <span style=\\\"color: #000000;\\\">base</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: #004080;\\\">object</span> <span style=\\\"color: #000000;\\\">res</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #008000;\\\">\\\"\\\"</span>\\n <span style=\\\"color: #004080;\\\">atom</span> <span style=\\\"color: #000000;\\\">num</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">0</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">denom</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">digit</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">g</span>\\n <span style=\\\"color: #008080;\\\">while</span> <span style=\\\"color: #000000;\\\">n</span> <span style=\\\"color: #008080;\\\">do</span>\\n <span style=\\\"color: #000000;\\\">denom</span> <span style=\\\"color: #0000FF;\\\">*=</span> <span style=\\\"color: #000000;\\\">base</span>\\n <span style=\\\"color: #000000;\\\">digit</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">remainder</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">n</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">base</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #000000;\\\">n</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;\\\">base</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;\\\">BASE</span> <span style=\\\"color: #008080;\\\">then</span>\\n <span style=\\\"color: #000000;\\\">res</span> <span style=\\\"color: #0000FF;\\\">&=</span> <span style=\\\"color: #000000;\\\">digit</span><span style=\\\"color: #0000FF;\\\">+</span><span style=\\\"color: #008000;\\\">'0'</span>\\n <span style=\\\"color: #008080;\\\">else</span>\\n <span style=\\\"color: #000000;\\\">num</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">num</span><span style=\\\"color: #0000FF;\\\">*</span><span style=\\\"color: #000000;\\\">base</span><span style=\\\"color: #0000FF;\\\">+</span><span style=\\\"color: #000000;\\\">digit</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;\\\">if</span> <span style=\\\"color: #000000;\\\">flag</span><span style=\\\"color: #0000FF;\\\">=</span><span style=\\\"color: #000000;\\\">FRAC</span> <span style=\\\"color: #008080;\\\">then</span>\\n <span style=\\\"color: #000000;\\\">g</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">gcd</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">num</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">denom</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #008080;\\\">return</span> <span style=\\\"color: #0000FF;\\\">{</span><span style=\\\"color: #000000;\\\">num</span><span style=\\\"color: #0000FF;\\\">/</span><span style=\\\"color: #000000;\\\">g</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">denom</span><span style=\\\"color: #0000FF;\\\">/</span><span style=\\\"color: #000000;\\\">g</span><span style=\\\"color: #0000FF;\\\">}</span>\\n <span style=\\\"color: #008080;\\\">elsif</span> <span style=\\\"color: #000000;\\\">flag</span><span style=\\\"color: #0000FF;\\\">=</span><span style=\\\"color: #000000;\\\">DECIMAL</span> <span style=\\\"color: #008080;\\\">then</span>\\n <span style=\\\"color: #008080;\\\">return</span> <span style=\\\"color: #000000;\\\">num</span><span style=\\\"color: #0000FF;\\\">/</span><span style=\\\"color: #000000;\\\">denom</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: #008080;\\\">iff</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><span style=\\\"color: #000000;\\\">0</span><span style=\\\"color: #0000FF;\\\">?</span><span style=\\\"color: #008000;\\\">\\\"0\\\"</span><span style=\\\"color: #0000FF;\\\">:</span><span style=\\\"color: #008000;\\\">\\\"0.\\\"</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;\\\">function</span>\\n\\n <span style=\\\"color: #008080;\\\">procedure</span> <span style=\\\"color: #000000;\\\">show_vdc</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;\\\">string</span> <span style=\\\"color: #000000;\\\">fmt</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #004080;\\\">object</span> <span style=\\\"color: #000000;\\\">v</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;\\\">5</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 %d: \\\"</span><span style=\\\"color: #0000FF;\\\">,{</span><span style=\\\"color: #000000;\\\">DESC</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">flag</span><span style=\\\"color: #0000FF;\\\">],</span><span style=\\\"color: #000000;\\\">i</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;\\\">0</span> <span style=\\\"color: #008080;\\\">to</span> <span style=\\\"color: #000000;\\\">9</span> <span style=\\\"color: #008080;\\\">do</span>\\n <span style=\\\"color: #000000;\\\">v</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">vdc</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">j</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">i</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;\\\">FRAC</span> <span style=\\\"color: #008080;\\\">and</span> <span style=\\\"color: #000000;\\\">v</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: #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;\\\">\\\"0 \\\"</span><span style=\\\"color: #0000FF;\\\">)</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: #000000;\\\">fmt</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 <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 <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">procedure</span>\\n\\n <span style=\\\"color: #000000;\\\">show_vdc</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">BASE</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #008000;\\\">\\\"%s \\\"</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #000000;\\\">show_vdc</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">FRAC</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #008000;\\\">\\\"%d/%d \\\"</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #000000;\\\">show_vdc</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">DECIMAL</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #008000;\\\">\\\"%g \\\"</span><span style=\\\"color: #0000FF;\\\">)</span>\\n<!--\\n\",\n \"language\": \"Phix\"\n },\n {\n \"code\": \"(scl 6)\\n\\n(de vdc (N B)\\n (default B 2)\\n (let (R 0 A 1.0)\\n (until (=0 N)\\n (inc 'R (* (setq A (/ A B)) (% N B)))\\n (setq N (/ N B)) )\\n R ) )\\n\\n(for B (2 3 4)\\n (prinl \\\"Base: \\\" B)\\n (for N (range 0 9)\\n (prinl N \\\": \\\" (round (vdc N B) 4)) ) )\\n\",\n \"language\": \"PicoLisp\"\n },\n {\n \"code\": \"vdcb: procedure (an) returns (bit (31)); /* 6 July 2012 */\\n declare an fixed binary (31);\\n declare (n, i) fixed binary (31);\\n declare v bit (31) varying;\\n\\n n = an; v = ''b;\\n do i = 1 by 1 while (n > 0);\\n if iand(n, 1) = 1 then v = v || '1'b; else v = v || '0'b;\\n n = isrl(n, 1);\\n end;\\n return (v);\\nend vdcb;\\n\\n declare i fixed binary (31);\\n\\n do i = 0 to 10;\\n put skip list ('0.' || vdcb(i));\\n end;\\n\",\n \"language\": \"PL-I\"\n },\n {\n \"code\": \"% vdc( N, Base, Out )\\n% Out = the Van der Corput representation of N in given Base\\nvdc( 0, _, [] ).\\nvdc( N, Base, Out ) :-\\n Nr is mod(N, Base),\\n Nq is N // Base,\\n vdc( Nq, Base, Tmp ),\\n Out = [Nr|Tmp].\\n\\n% Writes every element of a list to stdout; no newlines\\nwrite_list( [] ).\\nwrite_list( [H|T] ) :-\\n write( H ),\\n write_list( T ).\\n\\n% Writes the Nth Van der Corput item.\\nprint_vdc( N, Base ) :-\\n vdc( N, Base, Lst ),\\n write('0.'),\\n write_list( Lst ).\\nprint_vdc( N ) :-\\n print_vdc( N, 2 ).\\n\\n% Prints the first N+1 elements of the Van der Corput\\n% sequence, each to its own line\\nprint_some( 0, _ ) :-\\n write( '0.0' ).\\nprint_some( N, Base ) :-\\n M is N - 1,\\n print_some( M, Base ),\\n nl,\\n print_vdc( N, Base ).\\nprint_some( N ) :-\\n print_some( N, 2 ).\\n\\ntest :-\\n writeln('First 10 members in base 2:'),\\n print_some( 9 ),\\n nl,\\n write('7th member in base 4 (stretch goal) => '),\\n print_vdc( 7, 4 ).\\n\",\n \"language\": \"Prolog\"\n },\n {\n \"code\": \"% g(B,N,X):- consecutively generate in X the first N elements of the sequence based on {0, 1, ..., B}\\n\\ng(_,N,[L|_]-_,X):- N > 1, atomic_list_concat(['0.'|L],X).\\ng(B,N,[L|Ls]-Xs,X):- N > 2, M is N-1, findall([I|L], between(0,B,I), T), append(T,Ys,Xs), g(B,M,Ls-Ys,X).\\ng(_,N,'0.0'):- N > 0.\\ng(B,N,X):- N > 0, findall([I], between(1,B,I), T), T \\\\= [], append(T,Ys,Xs), g(B,N,Xs-Ys,X).\\n\",\n \"language\": \"Prolog\"\n },\n {\n \"code\": \"Procedure.d nBase(n.i,b.i)\\n Define r.d,s.i=1\\n While n\\n s*b\\n r+(Mod(n,b)/s)\\n n=Int(n/b)\\n Wend\\n ProcedureReturn r\\nEndProcedure\\n\\nDefine.i b,c\\nOpenConsole(\\\"van der Corput - Sequence\\\")\\nFor b=2 To 5\\n Print(\\\"Base \\\"+Str(b)+\\\": \\\")\\n For c=0 To 9\\n Print(StrD(nBase(c,b),5)+~\\\"\\\\t\\\")\\n Next\\n PrintN(\\\"\\\")\\nNext\\nInput()\\n\",\n \"language\": \"PureBasic\"\n },\n {\n \"code\": \"def vdc(n, base=2):\\n vdc, denom = 0,1\\n while n:\\n denom *= base\\n n, remainder = divmod(n, base)\\n vdc += remainder / denom\\n return vdc\\n\",\n \"language\": \"Python\"\n },\n {\n \"code\": \">>> [vdc(i) for i in range(10)]\\n[0, 0.5, 0.25, 0.75, 0.125, 0.625, 0.375, 0.875, 0.0625, 0.5625]\\n>>> [vdc(i, 3) for i in range(10)]\\n[0, 0.3333333333333333, 0.6666666666666666, 0.1111111111111111, 0.4444444444444444, 0.7777777777777777, 0.2222222222222222, 0.5555555555555556, 0.8888888888888888, 0.037037037037037035]\\n>>>\\n\",\n \"language\": \"Python\"\n },\n {\n \"code\": \">>> from fractions import Fraction\\n>>> Fraction.__repr__ = lambda x: '%i/%i' % (x.numerator, x.denominator)\\n>>> [vdc(i, base=Fraction(2)) for i in range(10)]\\n[0, 1/2, 1/4, 3/4, 1/8, 5/8, 3/8, 7/8, 1/16, 9/16]\\n\",\n \"language\": \"Python\"\n },\n {\n \"code\": \">>> for b in range(3,6):\\n\\tprint('\\\\nBase', b)\\n\\tprint([vdc(i, base=Fraction(b)) for i in range(10)])\\n\\nBase 3\\n[0, 1/3, 2/3, 1/9, 4/9, 7/9, 2/9, 5/9, 8/9, 1/27]\\n\\nBase 4\\n[0, 1/4, 1/2, 3/4, 1/16, 5/16, 9/16, 13/16, 1/8, 3/8]\\n\\nBase 5\\n[0, 1/5, 2/5, 3/5, 4/5, 1/25, 6/25, 11/25, 16/25, 21/25]\\n\",\n \"language\": \"Python\"\n },\n {\n \"code\": \" [ $ \\\"bigrat.qky\\\" loadfile ] now!\\n\\n [ [] swap\\n [ dup while\\n base share /mod\\n rot join swap\\n again ]\\n drop ] is digits ( n --> [ )\\n\\n [ base put\\n digits reverse\\n dup 0 swap\\n witheach\\n [ base share rot * + ]\\n base take rot size **\\n reduce ] is corput ( n n --> n/d )\\n\\n\\n 5 times\\n [ say \\\"base \\\"\\n i^ 2 + dup echo\\n say \\\": \\\"\\n 10 times\\n [ i^ over corput\\n vulgar$ echo$ sp sp ]\\n cr drop ]\\n\",\n \"language\": \"Quackery\"\n },\n {\n \"code\": \"#lang racket\\n(define (van-der-Corput n base)\\n (if (zero? n)\\n 0\\n (let-values ([(q r) (quotient/remainder n base)])\\n (/ (+ r (van-der-Corput q base))\\n base))))\\n\",\n \"language\": \"Racket\"\n },\n {\n \"code\": \"#lang racket\\n(define (digit-length n base)\\n (if (< n base) 1 (add1 (digit-length (quotient n base) base))))\\n(define (digit n i base)\\n (remainder (quotient n (expt base i)) base))\\n(define (van-der-Corput n base)\\n (for/sum ([i (digit-length n base)]) (/ (digit n i base) (expt base (+ i 1)))))\\n\",\n \"language\": \"Racket\"\n },\n {\n \"code\": \"(for ([base (in-range 2 (add1 5))])\\n (printf \\\"Base ~a: \\\" base)\\n (for ([n (in-range 0 10)])\\n (printf \\\"~a \\\" (van-der-Corput n base)))\\n (newline))\\n\\n#| Base 2: 0 1/2 1/4 3/4 1/8 5/8 3/8 7/8 1/16 9/16\\n Base 3: 0 1/3 2/3 1/9 4/9 7/9 2/9 5/9 8/9 1/27\\n Base 4: 0 1/4 1/2 3/4 1/16 5/16 9/16 13/16 1/8 3/8\\n Base 5: 0 1/5 2/5 3/5 4/5 1/25 6/25 11/25 16/25 21/25 |#\\n\",\n \"language\": \"Racket\"\n },\n {\n \"code\": \"constant VdC = map { :2(\\\"0.\\\" ~ .base(2).flip) }, ^Inf;\\n.say for VdC[^16];\\n\",\n \"language\": \"Raku\"\n },\n {\n \"code\": \"sub VdC($base = 2) {\\n map {\\n [+] $_ && .polymod($base xx *) Z/ [\\\\*] $base xx *\\n }, ^Inf\\n}\\n\\n.say for VdC[^10];\\n\",\n \"language\": \"Raku\"\n },\n {\n \"code\": \"sub vdc($num, $base = 2) {\\n my $n = $num;\\n my $vdc = 0;\\n my $denom = 1;\\n while $n {\\n $vdc += $n mod $base / ($denom *= $base);\\n $n div= $base;\\n }\\n $vdc;\\n}\\n\\nfor 2..5 -> $b {\\n say \\\"Base $b\\\";\\n say ( vdc($_,$b).Rat.nude.join('/') for ^10 ).join(', ');\\n say '';\\n}\\n\",\n \"language\": \"Raku\"\n },\n {\n \"code\": \"sub vdc($value, $base = 2) {\\n my @values = $value, { $_ div $base } ... 0;\\n my @denoms = $base, { $_ * $base } ... *;\\n [+] do for (flat @values Z @denoms) -> $v, $d {\\n $v mod $base / $d;\\n }\\n}\\n\",\n \"language\": \"Raku\"\n },\n {\n \"code\": \"/*REXX program converts an integer (or a range) ──► a Van der Corput number in base 2.*/\\nnumeric digits 1000 /*handle almost anything the user wants*/\\nparse arg a b . /*obtain the optional arguments from CL*/\\nif a=='' then parse value 0 10 with a b /*Not specified? Then use the defaults*/\\nif b=='' then b= a /*assume a range for a single number.*/\\n\\n do j=a to b /*traipse through the range of numbers.*/\\n _= VdC( abs(j) ) /*convert absolute value of an integer.*/\\n leading= substr('-', 2 + sign(j) ) /*if needed, elide the leading sign. */\\n say leading || _ /*show number, with leading minus sign?*/\\n end /*j*/\\nexit /*stick a fork in it, we're all done. */\\n/*──────────────────────────────────────────────────────────────────────────────────────*/\\nVdC: procedure; y= x2b( d2x( arg(1) ) ) + 0 /*convert to hexadecimal, then binary.*/\\n if y==0 then return 0 /*handle the special case of zero. */\\n return '.'reverse(y) /*heavy lifting is performed by REXX. */\\n\",\n \"language\": \"REXX\"\n },\n {\n \"code\": \"/*REXX pgm converts an integer (or a range) ──► a Van der Corput number, in base 2, or */\\n/*────────────────────────────── optionally, any other base up to and including base 90.*/\\nnumeric digits 1000 /*handle almost anything the user wants*/\\nparse arg a b r . /*obtain optional arguments from the CL*/\\nif a=='' | a==\\\",\\\" then parse value 0 10 with a b /*Not specified? Then use the defaults*/\\nif b=='' | b==\\\",\\\" then b= a /* \\\" \\\" \\\" \\\" \\\" \\\" */\\nif r=='' | r==\\\",\\\" then r= 2 /* \\\" \\\" \\\" \\\" \\\" \\\" */\\nz= /*a placeholder for a list of numbers. */\\n do j=a to b /*traipse through the range of integers*/\\n _= VdC( abs(j), abs(r) ) /*convert the ABSolute value of integer*/\\n _= substr('-', 2 + sign(j) )_ /*if needed, keep the leading - sign.*/\\n if r>0 then say _ /*if positive base, then just show it. */\\n else z=z _ /* ··· else append (build) a list. */\\n end /*j*/\\n\\nif z\\\\=='' then say strip(z) /*if a list is wanted, then display it.*/\\nexit /*stick a fork in it, we're all done. */\\n/*──────────────────────────────────────────────────────────────────────────────────────*/\\nbase: procedure; parse arg x, toB, inB /*get a number, toBase, and inBase. */\\n /*╔══════════════════════════════════════════════════════════════════════════════════╗\\n ║ Input to this function: x (X is required and it must be an integer). ║\\n ║ toBase the base to convert X to (default=10). ║\\n ║ inBase the base X is expressed in (default=10). ║\\n ║ ║\\n ║ toBase & inBase have a limit of: 2 ──► 90 ║\\n ╚══════════════════════════════════════════════════════════════════════════════════╝*/\\n @abc= 'abcdefghijklmnopqrstuvwxyz' /*the lowercase Latin alphabet letters.*/\\n @abcU= @abc; upper @abcU /*go whole hog & extend with uppercase.*/\\n @@@= 0123456789 || @abc || @abcU /*prefix them with the decimal digits. */\\n @@@= @@@'<>[]{}()?~!@#$%^&*_+-=|\\\\/;:`' /*add some special characters as well, */\\n /*──those chars should all be viewable.*/\\n numeric digits 1000 /*what the hey, support bigun' numbers.*/\\n maxB= length(@@@) /*maximum base (radix) supported here. */\\n if toB=='' then toB= 10 /*if omitted, then assume default (10)*/\\n if inB=='' then inB= 10 /* \\\" \\\" \\\" \\\" \\\" \\\" */\\n #=0 /* [↓] convert base inB X ──► base 10*/\\n do j=1 for length(x) /*process each \\\"numeral\\\" in the string.*/\\n _= substr(x, j, 1) /*pick off a \\\"digit\\\" (numeral) from X.*/\\n v= pos(_, @@@) /*get the value of this \\\"digit\\\"/numeral*/\\n if v==0 | v>inB then call erd /*is it an illegal \\\"digit\\\" (numeral) ? */\\n #= # * inB + v - 1 /*construct new number, digit by digit.*/\\n end /*j*/\\n y= /* [↓] convert base 10 # ──► base toB.*/\\n do while #>=toB /*deconstruct the new number (#). */\\n y= substr(@@@, # // toB + 1, 1)y /* construct the output number, ··· */\\n #= # % toB /* ··· and also whittle down #. */\\n end /*while*/\\n\\n return substr(@@@, # + 1, 1)y /*return a constructed \\\"numeric\\\" string*/\\n/*──────────────────────────────────────────────────────────────────────────────────────*/\\nerd: say 'the character ' v \\\" isn't a legal numeral for base \\\" inB'.'; exit 13\\nVdC: return '.'reverse( base( arg(1), arg(2) )) /*convert the #, reverse the #, append.*/\\n\",\n \"language\": \"REXX\"\n },\n {\n \"code\": \"decimals(4)\\nfor base = 2 to 5\\n see \\\"base \\\" + string(base) + \\\" : \\\"\\n for number = 0 to 9\\n see \\\"\\\" + corput(number, base) + \\\" \\\"\\n next\\n see nl\\nnext\\n\\nfunc corput n, b\\n vdc = 0\\n denom = 1\\n while n\\n denom *= b\\n rem = n % b\\n n = floor(n/b)\\n vdc += rem / denom\\n end\\n return vdc\\n\",\n \"language\": \"Ring\"\n },\n {\n \"code\": \"def vdc(n, base=2)\\n str = n.to_s(base).reverse\\n str.to_i(base).quo(base ** str.length)\\nend\\n\\n(2..5).each do |base|\\n puts \\\"Base #{base}: \\\" + Array.new(10){|i| vdc(i,base)}.join(\\\", \\\")\\nend\\n\",\n \"language\": \"Ruby\"\n },\n {\n \"code\": \"/// Van der Corput sequence for any base, based on C languange example from Wikipedia.\\npub fn corput(nth: usize, base: usize) -> f64 {\\n let mut n = nth;\\n let mut q: f64 = 0.0;\\n let mut bk: f64 = 1.0 / (base as f64);\\n\\n while n > 0_usize {\\n q += ((n % base) as f64)*bk;\\n n /= base;\\n bk /= base as f64;\\n }\\n q\\n}\\n\\nfn main() {\\n for base in 2_usize..=5_usize {\\n print!(\\\"Base {}:\\\", base);\\n for i in 1_usize..=10_usize {\\n let c = corput(i, base);\\n print!(\\\" {:.6}\\\", c)\\n }\\n println!(\\\"\\\");\\n }\\n}\\n\",\n \"language\": \"Rust\"\n },\n {\n \"code\": \"object VanDerCorput extends App {\\n def compute(n: Int, base: Int = 2) =\\n Iterator.from(0).\\n scanLeft(1)((a, _) => a * base).\\n map(b => (n - 1) / b -> b).\\n takeWhile(_._1 != 0).\\n foldLeft(0d)((a, b) => a + (b._1 % base).toDouble / b._2 / base)\\n\\n val n = scala.io.StdIn.readInt\\n val b = scala.io.StdIn.readInt\\n (1 to n).foreach(x => println(compute(x, b)))\\n}\\n\",\n \"language\": \"Scala\"\n },\n {\n \"code\": \"$ include \\\"seed7_05.s7i\\\";\\n include \\\"float.s7i\\\";\\n\\nconst func float: vdc (in var integer: number, in integer: base) is func\\n result\\n var float: vdc is 0.0;\\n local\\n var integer: denom is 1;\\n var integer: remainder is 0;\\n begin\\n while number <> 0 do\\n denom *:= base;\\n remainder := number rem base;\\n number := number div base;\\n vdc +:= flt(remainder) / flt(denom);\\n end while;\\n end func;\\n\\nconst proc: main is func\\n local\\n var integer: base is 0;\\n var integer: number is 0;\\n begin\\n for base range 2 to 5 do\\n writeln;\\n writeln(\\\"Base \\\" <& base);\\n for number range 0 to 9 do\\n write(vdc(number, base) digits 6 <& \\\" \\\");\\n end for;\\n writeln;\\n end for;\\n end func;\\n\",\n \"language\": \"Seed7\"\n },\n {\n \"code\": \"func vdc(value, base=2) {\\n while (value[-1] > 0) {\\n value.append(value[-1] / base -> int)\\n }\\n var (x, sum) = (1, 0)\\n value.each { |i|\\n sum += ((i % base) / (x *= base))\\n }\\n return sum\\n}\\n \\nfor base in (2..5) {\\n var seq = 10.of {|i| vdc([i], base) }\\n \\\"base %d: %s\\\\n\\\".printf(base, seq.map{|n| \\\"%.4f\\\" % n}.join(', '))\\n}\\n\",\n \"language\": \"Sidef\"\n },\n {\n \"code\": \"mata\\n// 5th term of Van der Corput sequence\\nhalton(1,1,5)\\n .625\\n\\n// the first 10 terms of Van der Corput sequence\\nhalton(10,1)\\n 1\\n +---------+\\n 1 | .5 |\\n 2 | .25 |\\n 3 | .75 |\\n 4 | .125 |\\n 5 | .625 |\\n 6 | .375 |\\n 7 | .875 |\\n 8 | .0625 |\\n 9 | .5625 |\\n 10 | .3125 |\\n +---------+\\n\\n// the first 10 terms of Van der Corput sequence in base 3\\nghalton(10,3,0)\\n 1\\n +---------------+\\n 1 | .3333333333 |\\n 2 | .6666666667 |\\n 3 | .1111111111 |\\n 4 | .4444444444 |\\n 5 | .7777777778 |\\n 6 | .2222222222 |\\n 7 | .5555555556 |\\n 8 | .8888888889 |\\n 9 | .037037037 |\\n 10 | .3703703704 |\\n +---------------+\\n\\nend\\n\",\n \"language\": \"Stata\"\n },\n {\n \"code\": \"clear\\nmata\\nst_addobs(2500)\\nst_addvar(\\\"double\\\",\\\"x\\\")\\nst_addvar(\\\"double\\\",\\\"y\\\")\\nst_addvar(\\\"double\\\",\\\"z\\\")\\nk=1::2500\\nst_store(k,1,k)\\nst_store(k,2,0.5*runiform(2500,1))\\nst_store(k,3,0.5:+0.5*halton(2500,1))\\nend\\ntwoway scatter y x, msize(tiny) color(blue) ///\\n || scatter z x, msize(tiny) color(green) legend(off) xtitle(\\\"\\\") ///\\n\\ttitle(Distribution: Van der Corput (top) vs pseudorandom) ///\\n\\tylabel(, angle(0) format(%3.1f))\\n\",\n \"language\": \"Stata\"\n },\n {\n \"code\": \"func vanDerCorput(n: Int, base: Int, num: inout Int, denom: inout Int) {\\n var n = n, p = 0, q = 1\\n\\n while n != 0 {\\n p = p * base + (n % base)\\n q *= base\\n n /= base\\n }\\n\\n num = p\\n denom = q\\n\\n while p != 0 {\\n n = p\\n p = q % p\\n q = n\\n }\\n\\n num /= q\\n denom /= q\\n}\\n\\nvar num = 0\\nvar denom = 0\\n\\nfor base in 2...5 {\\n print(\\\"base \\\\(base): 0 \\\", terminator: \\\"\\\")\\n\\n for n in 1..<10 {\\n vanDerCorput(n: n, base: base, num: &num, denom: &denom)\\n\\n print(\\\"\\\\(num)/\\\\(denom) \\\", terminator: \\\"\\\")\\n }\\n\\n print()\\n}\\n\",\n \"language\": \"Swift\"\n },\n {\n \"code\": \"proc digitReverse {n {base 2}} {\\n set n [expr {[set neg [expr {$n < 0}]] ? -$n : $n}]\\n set result 0.0\\n set bit [expr {1.0 / $base}]\\n for {} {$n > 0} {set n [expr {$n / $base}]} {\\n\\tset result [expr {$result + $bit * ($n % $base)}]\\n\\tset bit [expr {$bit / $base}]\\n }\\n return [expr {$neg ? -$result : $result}]\\n}\\n\",\n \"language\": \"Tcl\"\n },\n {\n \"code\": \"# Print the first 10 terms of the Van der Corput sequence\\nfor {set i 1} {$i <= 10} {incr i} {\\n puts \\\"vanDerCorput($i) = [digitReverse $i]\\\"\\n}\\n\\n# In other bases\\nforeach base {3 4 5} {\\n set seq {}\\n for {set i 1} {$i <= 10} {incr i} {\\n\\tlappend seq [format %.5f [digitReverse $i $base]]\\n }\\n puts \\\"${base}: [join $seq {, }]\\\"\\n}\\n\",\n \"language\": \"Tcl\"\n },\n {\n \"code\": \"fn v2(nn u32) f64 {\\n mut n:=nn\\n mut r := f64(0)\\n mut p := .5\\n for n > 0 {\\n if n&1 == 1 {\\n r += p\\n }\\n p *= .5\\n n >>= 1\\n }\\n return r\\n}\\n\\nfn new_v(base u32) fn(u32) f64 {\\n invb := 1 / f64(base)\\n return fn[base,invb](nn u32) f64 {\\n mut n:=nn\\n mut r := f64(0)\\n mut p := invb\\n for n > 0 {\\n r += p * f64(n%base)\\n p *= invb\\n n /= base\\n }\\n return r\\n }\\n}\\n\\nfn main() {\\n println(\\\"Base 2:\\\")\\n for i := u32(0); i < 10; i++ {\\n println('$i ${v2(i)}')\\n }\\n println(\\\"Base 3:\\\")\\n v3 := new_v(3)\\n for i := u32(0); i < 10; i++ {\\n println('$i ${v3(i)}')\\n }\\n}\\n\",\n \"language\": \"V-(Vlang)\"\n },\n {\n \"code\": \"Private Function vdc(ByVal n As Integer, BASE As Variant) As Variant\\n Dim res As String\\n Dim digit As Integer, g As Integer, denom As Integer\\n denom = 1\\n Do While n\\n denom = denom * BASE\\n digit = n Mod BASE\\n n = n \\\\ BASE\\n res = res & CStr(digit) '+ \\\"0\\\"\\n Loop\\n vdc = IIf(Len(res) = 0, \\\"0\\\", \\\"0.\\\" & res)\\nEnd Function\\n\\nPublic Sub show_vdc()\\n Dim v As Variant, j As Integer\\n For i = 2 To 5\\n Debug.Print \\\"Base \\\"; i; \\\": \\\";\\n For j = 0 To 9\\n v = vdc(j, i)\\n Debug.Print v; \\\" \\\";\\n Next j\\n Debug.Print\\n Next i\\nEnd Sub\\n\",\n \"language\": \"VBA\"\n },\n {\n \"code\": \"'http://rosettacode.org/wiki/Van_der_Corput_sequence\\n'Van der Corput Sequence fucntion call = VanVanDerCorput(number,base)\\n\\nBase2 = \\\"0\\\" : Base3 = \\\"0\\\" : Base4 = \\\"0\\\" : Base5 = \\\"0\\\"\\nBase6 = \\\"0\\\" : Base7 = \\\"0\\\" : Base8 = \\\"0\\\" : Base9 = \\\"0\\\"\\n\\nl = 1\\nh = 1\\nDo Until l = 9\\n\\t'Set h to the value of l after each function call\\n\\t'as it sets it to 0 - see lines 37 to 40.\\n\\tBase2 = Base2 & \\\", \\\" & VanDerCorput(h,2) : h = l\\n\\tBase3 = Base3 & \\\", \\\" & VanDerCorput(h,3) : h = l\\n\\tBase4 = Base4 & \\\", \\\" & VanDerCorput(h,4) : h = l\\n\\tBase5 = Base5 & \\\", \\\" & VanDerCorput(h,5) : h = l\\n\\tBase6 = Base6 & \\\", \\\" & VanDerCorput(h,6) : h = l\\n\\tl = l + 1\\nLoop\\n\\nWScript.Echo \\\"Base 2: \\\" & Base2\\nWScript.Echo \\\"Base 3: \\\" & Base3\\nWScript.Echo \\\"Base 4: \\\" & Base4\\nWScript.Echo \\\"Base 5: \\\" & Base5\\nWScript.Echo \\\"Base 6: \\\" & Base6\\n\\n'Van der Corput Sequence\\nFunction VanDerCorput(n,b)\\n\\tk = RevString(Dec2BaseN(n,b))\\n\\tFor i = 1 To Len(k)\\n\\t\\tVanDerCorput = VanDerCorput + (CLng(Mid(k,i,1)) * b^-i)\\n\\tNext\\nEnd Function\\n\\n'Decimal to Base N Conversion\\nFunction Dec2BaseN(q,c)\\n\\tDec2BaseN = \\\"\\\"\\n\\tDo Until q = 0\\n\\t\\tDec2BaseN = CStr(q Mod c) & Dec2BaseN\\n\\t\\tq = Int(q / c)\\n\\tLoop\\nEnd Function\\n\\n'Reverse String\\nFunction RevString(s)\\n\\tFor j = Len(s) To 1 Step -1\\n\\t\\tRevString = RevString & Mid(s,j,1)\\n\\tNext\\nEnd Function\\n\",\n \"language\": \"VBScript\"\n },\n {\n \"code\": \"Module Module1\\n\\n Function ToBase(n As Integer, b As Integer) As String\\n Dim result = \\\"\\\"\\n If b < 2 Or b > 16 Then\\n Throw New ArgumentException(\\\"The base is out of range\\\")\\n End If\\n\\n Do\\n Dim remainder = n Mod b\\n result = \\\"0123456789ABCDEF\\\"(remainder) + result\\n n = n \\\\ b\\n Loop While n > 0\\n\\n Return result\\n End Function\\n\\n Sub Main()\\n For b = 2 To 5\\n Console.WriteLine(\\\"Base = {0}\\\", b)\\n For i = 0 To 12\\n Dim s = \\\".\\\" + ToBase(i, b)\\n Console.Write(\\\"{0,6} \\\", s)\\n Next\\n Console.WriteLine()\\n Console.WriteLine()\\n Next\\n End Sub\\n\\nEnd Module\\n\",\n \"language\": \"Visual-Basic-.NET\"\n },\n {\n \"code\": \"var v2 = Fn.new { |n|\\n var p = 0.5\\n var r = 0\\n while (n > 0) {\\n if (n%2 == 1) r = r + p\\n p = p / 2\\n n = (n/2).floor\\n }\\n return r\\n}\\n\\nvar newV = Fn.new { |base|\\n var invb = 1 / base\\n return Fn.new { |n|\\n var p = invb\\n var r = 0\\n while (n > 0) {\\n r = r + p*(n%base)\\n p = p * invb\\n n = (n/base).floor\\n }\\n return r\\n }\\n}\\n\\nSystem.print(\\\"Base 2:\\\")\\nfor (i in 0..9) System.print(\\\"%(i) -> %(v2.call(i))\\\")\\n\\nSystem.print(\\\"\\\\nBase 3:\\\")\\nvar v3 = newV.call(3)\\nfor (i in 0..9) System.print(\\\"%(i) -> %(v3.call(i))\\\")\\n\",\n \"language\": \"Wren\"\n },\n {\n \"code\": \"include c:\\\\cxpl\\\\codes; \\\\intrinsic 'code' declarations\\n\\nfunc real VdC(N); \\\\Return Nth term of van der Corput sequence in base 2\\nint N;\\nreal V, U;\\n[V:= 0.0; U:= 0.5;\\nrepeat N:= N/2;\\n if rem(0) then V:= V+U;\\n U:= U/2.0;\\nuntil N=0;\\nreturn V;\\n];\\n\\nint N;\\nfor N:= 0 to 10-1 do\\n [IntOut(0, N); RlOut(0, VdC(N)); CrLf(0)]\\n\",\n \"language\": \"XPL0\"\n },\n {\n \"code\": \"sub num_base$(number, base)\\n if _base_ > 9 then\\n print \\\"base not handled by function\\\"\\n sleep 5000\\n return \\\"\\\"\\n end if\\n\\n while number <> 0\\n n = mod(number, base)\\n ans$ = str$(n) + ans$\\n number = int(number / base)\\n wend\\n\\n if ans$ = \\\"\\\" then ans$ = \\\"0\\\" : fi\\n\\n return \\\".\\\" + ans$\\nend sub\\n\\nfor k = 2 to 5\\n print \\\"Base = \\\", k\\n for l = 0 to 12\\n print left$(num_base$(l, k), 7), \\\" \\\";\\n next l\\n print : print\\nnext k\\nend\\n\",\n \"language\": \"Yabasic\"\n },\n {\n \"code\": \"fcn vdc(n,base=2){\\n vdc:=0.0; denom:=1;\\n while(n){ reg remainder;\\n denom *= base;\\n n, remainder = n.divr(base);\\n vdc += (remainder.toFloat() / denom);\\n }\\n vdc\\n}\\n\",\n \"language\": \"Zkl\"\n },\n {\n \"code\": \"fcn vdc(n,base=2){\\n str:=n.toString(base).reverse();\\n str.toInt(base).toFloat()/(base.toFloat().pow(str.len()))\\n}\\n\",\n \"language\": \"Zkl\"\n }\n]","isConversational":false},"task_name":{"kind":"string","value":"Van-der-Corput-sequence"}}},{"rowIdx":1796,"cells":{"solutions":{"kind":"list like","value":[{"code":"---\nfrom: http://rosettacode.org/wiki/Variable_declaration_reset\n","language":"00-META"},{"code":"A decidely non-challenging task to highlight a potential difference between programming languages.\n\nUsing a straightforward longhand loop as in the JavaScript and Phix examples below, show the locations of elements which are identical to the immediately preceding element in {1,2,2,3,4,4,5}. The (non-blank) results may be 2,5 for zero-based or 3,6 if one-based. <br>\nThe purpose is to determine whether variable declaration (in block scope) resets the contents on every iteration.<br>\nThere is no particular judgement of right or wrong here, just a plain-speaking statement of subtle differences.<br>\nShould your first attempt bomb with \"unassigned variable\" exceptions, feel free to code it as (say)\n // int prev // crashes with unassigned variable\n int prev = -1 // predictably no output\nIf your programming language does not support block scope (eg assembly) it should be omitted from this task.\n\n","language":"00-TASK"},{"code":"BEGIN\n []INT s = ( 1, 2, 2, 3, 4, 4, 5 );\n FOR i FROM LWB s TO UPB s DO\n INT curr := s[ i ], prev;\n IF IF i > LWB s THEN curr = prev ELSE FALSE FI THEN\n print( ( i, newline ) )\n FI;\n prev := curr\n OD\nEND\n","language":"ALGOL-68"},{"code":"# syntax: GAWK -f VARIABLE_DECLARATION_RESET.AWK\nBEGIN {\n n = split(\"1,2,2,3,4,4,5\",arr,\",\")\n for (i=1; i<=n; i++) {\n curr = arr[i]\n if (i > 1 && prev == curr) {\n printf(\"%s\\n\",i)\n }\n prev = curr\n }\n exit(0)\n}\n","language":"AWK"},{"code":"#include <stdio.h>\n\nint main() {\n int i, gprev = 0;\n int s[7] = {1, 2, 2, 3, 4, 4, 5};\n\n /* There is no output as 'prev' is created anew each time\n around the loop and set explicitly to zero. */\n for (i = 0; i < 7; ++i) {\n// for (int i = 0, prev; i < 7; ++i) { // as below, see note\n int curr = s[i];\n int prev = 0;\n// int prev; // produces same output as second loop\n if (i > 0 && curr == prev) printf(\"%d\\n\", i);\n prev = curr;\n }\n\n /* Now 'gprev' is used and reassigned\n each time around the loop producing the desired output. */\n for (i = 0; i < 7; ++i) {\n int curr = s[i];\n if (i > 0 && curr == gprev) printf(\"%d\\n\", i);\n gprev = curr;\n }\n\n return 0;\n}\n","language":"C"},{"code":"#include <array>\n#include <iostream>\n\nint main()\n{\n constexpr std::array s {1,2,2,3,4,4,5};\n\n if(!s.empty())\n {\n int previousValue = s[0];\n\n for(size_t i = 1; i < s.size(); ++i)\n {\n // in C++, variables in block scope are reset at each iteration\n const int currentValue = s[i];\n\n if(i > 0 && previousValue == currentValue)\n {\n std::cout << i << \"\\n\";\n }\n\n previousValue = currentValue;\n }\n }\n}\n","language":"C++"},{"code":"// Variable declaration reset. Nigel Galloway: June 21st 2022\nlet s=[1;2;2;3;4;4;5]\n// First let me write this in real F#, which rather avoids the whole issue\nprintfn \"Real F#\"\ns|>List.pairwise|>List.iteri(fun i (n,g)->if n=g then printfn \"%d\" (i+1))\n// Now let me take the opportunity to write some awful F# by translating the C++\nprintfn \"C++ like awful F#\"\nlet mutable previousValue = -1\nfor i in 0..s.Length-1 do\n let currentValue=s.[i]\n if previousValue = currentValue then printfn \"%d\" i\n previousValue <- currentValue\n","language":"F-Sharp"},{"code":"USING: kernel math prettyprint sequences ;\n\n[let\n { 1 2 2 3 4 4 5 } :> s\n s length <iota> [| i |\n i s nth -1 :> ( curr prev! )\n i 0 > curr prev = and\n [ i . ] when\n curr prev!\n ] each\n]\n","language":"Factor"},{"code":"USING: kernel math prettyprint sequences ;\n\n[let\n { 1 2 2 3 4 4 5 } -1 :> ( s prev! )\n s length <iota> [| i |\n i s nth :> curr\n i 0 > curr prev = and\n [ i . ] when\n curr prev!\n ] each\n]\n","language":"Factor"},{"code":"USING: grouping math.vectors prettyprint sequences.extras ;\n\n{ 1 2 2 3 4 4 5 } 2 <clumps> [ all-eq? ] arg-where 1 v+n .\n","language":"Factor"},{"code":"Dim As Integer s(1 To 7) => {1,2,2,3,4,4,5}\nFor i As Integer = 1 To Ubound(s)\n Dim As Integer curr = s(i), prev\n If i > 1 And curr = prev Then Print i\n prev = curr\nNext i\nSleep\n","language":"FreeBASIC"},{"code":"package main\n\nimport \"fmt\"\n\nfunc main() {\n s := []int{1, 2, 2, 3, 4, 4, 5}\n\n // There is no output as 'prev' is created anew each time\n // around the loop and set implicitly to zero.\n for i := 0; i < len(s); i++ {\n curr := s[i]\n var prev int\n if i > 0 && curr == prev {\n fmt.Println(i)\n }\n prev = curr\n }\n\n // Now 'prev' is created only once and reassigned\n // each time around the loop producing the desired output.\n var prev int\n for i := 0; i < len(s); i++ {\n curr := s[i]\n if i > 0 && curr == prev {\n fmt.Println(i)\n }\n prev = curr\n }\n}\n","language":"Go"},{"code":" 1+I.(}:=}.) 1 2 2 3 4 4 5\n2 5\n","language":"J"},{"code":"same2=: {{\n i=. 0\n r=. ,EMPTY\n while. i < #y do.\n curr=. i{y\n if. i>0 do.\n if. curr=prev do.\n r=. r,i\n end.\n end.\n prev=. curr\n i=. i+1\n end.\n r\n}}\n","language":"J"},{"code":" same2 1,2,2,3,4,4,5\n2 5\n","language":"J"},{"code":"same3=: {{\n i=. 0\n r=. ,EMPTY\n prev=. 99\n while. i < #y do.\n curr=. i{y\n if. i>0 do.\n if. curr=prev do.\n r=. r,i\n end.\n end.\n prev=. curr\n i=. i+1\n end.\n r\n}}\n","language":"J"},{"code":"public class VariableDeclarationReset {\n public static void main(String[] args) {\n int[] s = {1, 2, 2, 3, 4, 4, 5};\n\n // There is no output as 'prev' is created anew each time\n // around the loop and set to zero.\n for (int i = 0; i < s.length; ++i) {\n int curr = s[i];\n int prev = 0;\n// int prev; // triggers \"error: variable prev might not have been initialized\"\n if (i > 0 && curr == prev) System.out.println(i);\n prev = curr;\n }\n\n int gprev = 0;\n\n // Now 'gprev' is used and reassigned\n // each time around the loop producing the desired output.\n for (int i = 0; i < s.length; ++i) {\n int curr = s[i];\n if (i > 0 && curr == gprev) System.out.println(i);\n gprev = curr;\n }\n }\n}\n","language":"Java"},{"code":"<!DOCTYPE html>\n<html lang=\"en\" >\n <head>\n <meta charset=\"utf-8\"/>\n <meta name=\"viewport\" content=\"width=device-width, initial-scale=1\"/>\n <title>variable declaration reset</title>\n </head>\n <body>\n <script>\n\"use strict\";\nlet s = [1, 2, 2, 3, 4, 4, 5];\nfor (let i=0; i<7; i+=1) {\n let curr = s[i], prev;\n if (i>0 && (curr===prev)) {\n console.log(i);\n }\n prev = curr;\n}\n </script>\n </body>\n</html>\n","language":"JavaScript"},{"code":"[1,2,2,3,4,4,5]\n| . as $array\n| range(1;length)\n| select( $array[.] == $array[.-1])\n","language":"Jq"},{"code":"s = [1, 2, 2, 3, 4, 4, 5]\n\nfor i in eachindex(s)\n curr = s[i]\n i > 1 && curr == prev && println(i)\n prev = curr\nend\n","language":"Julia"},{"code":"s = [1, 2, 2, 3, 4, 4, 5]\nprev = -1\n\nfor i in eachindex(s)\n global prev\n curr = s[i]\n i > 1 && curr == prev && println(i)\n prev = curr\nend\n","language":"Julia"},{"code":"s = [1, 2, 2, 3, 4, 4, 5]\n\nfor i in eachindex(s)[begin+1:end] # or 2:length(s)\n s[i] == s[i - 1] && println(i)\nend\n","language":"Julia"},{"code":"&=/'2':1 2 2 3 4 4 5\n1 4\n","language":"K"},{"code":"let s = [1, 2, 2, 3, 4, 4, 5]\nfor i in 0..s.high:\n let curr = s[i]\n if i > 0 and curr == prev:\n echo i\n var prev = curr\n","language":"Nim"},{"code":"let s = [1, 2, 2, 3, 4, 4, 5]\nfor i in 0..s.high:\n let curr = s[i]\n var prev: int\n if i > 0 and curr == prev:\n echo i\n prev = curr\n","language":"Nim"},{"code":"let s = [1, 2, 2, 3, 4, 4, 5]\nvar prev: int\nfor i in 0..s.high:\n let curr = s[i]\n if i > 0 and curr == prev:\n echo i\n prev = curr\n","language":"Nim"},{"code":"@s = <1 2 2 3 4 4 5>;\nfor ($i = 0; $i < 7; $i++) {\n $curr = $s[$i];\n if ($i > 1 and $curr == $prev) { print \"$i\\n\" }\n $prev = $curr;\n}\n","language":"Perl"},{"code":"use strict;\nuse warnings;\nuse feature 'state';\n\nmy @s = <1 2 2 3 4 4 5>;\nfor (my $i = 0; $i < 7; $i++) {\n my $curr = $s[$i];\n state $prev;\n if ($i > 1 and $curr == $prev) { print \"$i\\n\" }\n $prev = $curr;\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;\">sequence</span> <span style=\"color: #000000;\">s</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;\">2</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: #000000;\">4</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">5</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;\">integer</span> <span style=\"color: #000000;\">curr</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;\">prev</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;\">and</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: #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: #000000;\">prev</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<!--\n","language":"Phix"},{"code":"100H:\n\n /* CP/M BDOS SYSTEM CALL */\n BDOS: PROCEDURE( FN, ARG ); DECLARE FN BYTE, ARG ADDRESS; GOTO 5;END;\n /* CONSOLE OUTPUT ROUTINES */\n PR$CHAR: PROCEDURE( C ); DECLARE C BYTE; CALL BDOS( 2, C ); END;\n PR$STRING: PROCEDURE( S ); DECLARE S ADDRESS; CALL BDOS( 9, S ); END;\n PR$NL: PROCEDURE; CALL PR$STRING( .( 0DH, 0AH, '$' ) ); END;\n PR$NUMBER: PROCEDURE( N );\n DECLARE N ADDRESS;\n DECLARE V ADDRESS, N$STR( 6 ) BYTE INITIAL( '.....$' ), W BYTE;\n N$STR( W := LAST( N$STR ) - 1 ) = '0' + ( ( V := N ) 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\n /* TASK */\n DECLARE S( 6 ) BYTE INITIAL( 1, 2, 2, 3, 4, 4, 5 );\n DECLARE I BYTE;\n DO I = 0 TO LAST( S );\n DO;\n DECLARE ( CURR, PREV ) BYTE;\n CURR = S( I );\n IF I > 1 AND CURR = PREV THEN DO;\n CALL PR$NUMBER( I );\n CALL PR$NL;\n END;\n PREV = CURR;\n END;\n END;\n\nEOF\n","language":"PL-M"},{"code":"s = [1, 2, 2, 3, 4, 4, 5]\n\nfor i in range(len(s)):\n curr = s[i]\n if i > 0 and curr == prev:\n print(i)\n prev = curr\n","language":"Python"},{"code":"my @s = 1, 2, 2, 3, 4, 4, 5;\nloop (my $i = 0; $i < 7; $i += 1) {\n my $curr = @s[$i];\n my $prev;\n if $i > 1 and $curr == $prev {\n say $i;\n }\n $prev = $curr;\n}\n","language":"Raku"},{"code":"my @s = 1, 2, 2, 3, 4, 4, 5;\nquietly loop (my $i = 0; $i < 7; $i += 1) {\n my $curr = @s[$i];\n my $prev;\n if $i > 1 and $curr == $prev {\n say $i;\n }\n $prev = $curr;\n}\n","language":"Raku"},{"code":"my @s = 1, 2, 2, 3, 4, 4, 5;\nloop (my $i = 0; $i < 7; $i += 1) {\n my $curr = @s[$i];\n our $prev;\n if $i > 1 and $curr == $prev {\n say $i;\n }\n $prev = $curr;\n}\n","language":"Raku"},{"code":"my @s = 1, 2, 2, 3, 4, 4, 5;\nloop (my $i = 0; $i < 7; $i += 1) {\n my $curr = @s[$i];\n state $prev;\n if $i > 1 and $curr == $prev {\n say $i;\n }\n $prev = $curr;\n}\n","language":"Raku"},{"code":"no strict;\n@s = 1, 2, 2, 3, 4, 4, 5;\nloop ($i = 0; $i < 7; $i += 1) {\n $curr = @s[$i];\n if $i > 1 and $curr == $prev {\n say $i;\n }\n $prev = $curr;\n}\n","language":"Raku"},{"code":"Red[]\ns: [1 2 2 3 4 4 5]\nrepeat i length? s [\n curr: s/:i\n if all [i > 1 curr = prev][\n print i\n ]\n prev: curr\n]\n","language":"Red"},{"code":"$ include \"seed7_05.s7i\";\n\nconst proc: main is func\n local\n const array integer: s is [] (1, 2, 2, 3, 4, 4, 5);\n var integer: i is 0;\n var integer: curr is 0;\n var integer: prev is 0;\n begin\n for i range 1 to length(s) do\n curr := s[i];\n if i > 1 and curr = prev then\n writeln(i);\n end if;\n prev := curr;\n end for;\n end func;\n","language":"Seed7"},{"code":"fn main() {\n s := [1, 2, 2, 3, 4, 4, 5]\n\n // There is no output as 'prev' is created anew each time\n // around the loop and set implicitly to zero.\n for i := 0; i < s.len; i++ {\n curr := s[i]\n mut prev := 0\n if i > 0 && curr == prev {\n println(i)\n }\n prev = curr\n }\n\n // Now 'prev' is created only once and reassigned\n // each time around the loop producing the desired output.\n mut prev := 0\n for i := 0; i < s.len; i++ {\n curr := s[i]\n if i > 0 && curr == prev {\n println(i)\n }\n prev = curr\n }\n}\n","language":"V-(Vlang)"},{"code":"Option Strict On\nOption Explicit On\n\nImports System.IO\n\nModule vMain\n\n Public Sub Main\n Dim s As Integer() = New Integer(){1, 2, 2, 3, 4, 4, 5}\n For i As Integer = 0 To Ubound(s)\n Dim curr As Integer = s(i)\n Dim prev As Integer\n If i > 1 AndAlso curr = prev Then\n Console.Out.WriteLine(i)\n End If\n prev = curr\n Next i\n End Sub\n\nEnd Module\n","language":"Visual-Basic-.NET"},{"code":"var s = [1, 2, 2, 3, 4, 4, 5]\n\n// There is no output as 'prev' is created anew each time\n// around the loop and set implicitly to null.\nfor (i in 0...s.count) {\n var curr = s[i]\n var prev\n if (i > 0 && curr == prev) System.print(i)\n prev = curr\n}\n\n// Now 'prev' is created only once and reassigned\n// each time around the loop producing the desired output.\nvar prev\nfor (i in 0...s.count) {\n var curr = s[i]\n if (i > 0 && curr == prev) System.print(i)\n prev = curr\n}\n","language":"Wren"}],"string":"[\n {\n \"code\": \"---\\nfrom: http://rosettacode.org/wiki/Variable_declaration_reset\\n\",\n \"language\": \"00-META\"\n },\n {\n \"code\": \"A decidely non-challenging task to highlight a potential difference between programming languages.\\n\\nUsing a straightforward longhand loop as in the JavaScript and Phix examples below, show the locations of elements which are identical to the immediately preceding element in {1,2,2,3,4,4,5}. The (non-blank) results may be 2,5 for zero-based or 3,6 if one-based. <br>\\nThe purpose is to determine whether variable declaration (in block scope) resets the contents on every iteration.<br>\\nThere is no particular judgement of right or wrong here, just a plain-speaking statement of subtle differences.<br>\\nShould your first attempt bomb with \\\"unassigned variable\\\" exceptions, feel free to code it as (say)\\n // int prev // crashes with unassigned variable\\n int prev = -1 // predictably no output\\nIf your programming language does not support block scope (eg assembly) it should be omitted from this task.\\n\\n\",\n \"language\": \"00-TASK\"\n },\n {\n \"code\": \"BEGIN\\n []INT s = ( 1, 2, 2, 3, 4, 4, 5 );\\n FOR i FROM LWB s TO UPB s DO\\n INT curr := s[ i ], prev;\\n IF IF i > LWB s THEN curr = prev ELSE FALSE FI THEN\\n print( ( i, newline ) )\\n FI;\\n prev := curr\\n OD\\nEND\\n\",\n \"language\": \"ALGOL-68\"\n },\n {\n \"code\": \"# syntax: GAWK -f VARIABLE_DECLARATION_RESET.AWK\\nBEGIN {\\n n = split(\\\"1,2,2,3,4,4,5\\\",arr,\\\",\\\")\\n for (i=1; i<=n; i++) {\\n curr = arr[i]\\n if (i > 1 && prev == curr) {\\n printf(\\\"%s\\\\n\\\",i)\\n }\\n prev = curr\\n }\\n exit(0)\\n}\\n\",\n \"language\": \"AWK\"\n },\n {\n \"code\": \"#include <stdio.h>\\n\\nint main() {\\n int i, gprev = 0;\\n int s[7] = {1, 2, 2, 3, 4, 4, 5};\\n\\n /* There is no output as 'prev' is created anew each time\\n around the loop and set explicitly to zero. */\\n for (i = 0; i < 7; ++i) {\\n// for (int i = 0, prev; i < 7; ++i) { // as below, see note\\n int curr = s[i];\\n int prev = 0;\\n// int prev; // produces same output as second loop\\n if (i > 0 && curr == prev) printf(\\\"%d\\\\n\\\", i);\\n prev = curr;\\n }\\n\\n /* Now 'gprev' is used and reassigned\\n each time around the loop producing the desired output. */\\n for (i = 0; i < 7; ++i) {\\n int curr = s[i];\\n if (i > 0 && curr == gprev) printf(\\\"%d\\\\n\\\", i);\\n gprev = curr;\\n }\\n\\n return 0;\\n}\\n\",\n \"language\": \"C\"\n },\n {\n \"code\": \"#include <array>\\n#include <iostream>\\n\\nint main()\\n{\\n constexpr std::array s {1,2,2,3,4,4,5};\\n\\n if(!s.empty())\\n {\\n int previousValue = s[0];\\n\\n for(size_t i = 1; i < s.size(); ++i)\\n {\\n // in C++, variables in block scope are reset at each iteration\\n const int currentValue = s[i];\\n\\n if(i > 0 && previousValue == currentValue)\\n {\\n std::cout << i << \\\"\\\\n\\\";\\n }\\n\\n previousValue = currentValue;\\n }\\n }\\n}\\n\",\n \"language\": \"C++\"\n },\n {\n \"code\": \"// Variable declaration reset. Nigel Galloway: June 21st 2022\\nlet s=[1;2;2;3;4;4;5]\\n// First let me write this in real F#, which rather avoids the whole issue\\nprintfn \\\"Real F#\\\"\\ns|>List.pairwise|>List.iteri(fun i (n,g)->if n=g then printfn \\\"%d\\\" (i+1))\\n// Now let me take the opportunity to write some awful F# by translating the C++\\nprintfn \\\"C++ like awful F#\\\"\\nlet mutable previousValue = -1\\nfor i in 0..s.Length-1 do\\n let currentValue=s.[i]\\n if previousValue = currentValue then printfn \\\"%d\\\" i\\n previousValue <- currentValue\\n\",\n \"language\": \"F-Sharp\"\n },\n {\n \"code\": \"USING: kernel math prettyprint sequences ;\\n\\n[let\\n { 1 2 2 3 4 4 5 } :> s\\n s length <iota> [| i |\\n i s nth -1 :> ( curr prev! )\\n i 0 > curr prev = and\\n [ i . ] when\\n curr prev!\\n ] each\\n]\\n\",\n \"language\": \"Factor\"\n },\n {\n \"code\": \"USING: kernel math prettyprint sequences ;\\n\\n[let\\n { 1 2 2 3 4 4 5 } -1 :> ( s prev! )\\n s length <iota> [| i |\\n i s nth :> curr\\n i 0 > curr prev = and\\n [ i . ] when\\n curr prev!\\n ] each\\n]\\n\",\n \"language\": \"Factor\"\n },\n {\n \"code\": \"USING: grouping math.vectors prettyprint sequences.extras ;\\n\\n{ 1 2 2 3 4 4 5 } 2 <clumps> [ all-eq? ] arg-where 1 v+n .\\n\",\n \"language\": \"Factor\"\n },\n {\n \"code\": \"Dim As Integer s(1 To 7) => {1,2,2,3,4,4,5}\\nFor i As Integer = 1 To Ubound(s)\\n Dim As Integer curr = s(i), prev\\n If i > 1 And curr = prev Then Print i\\n prev = curr\\nNext i\\nSleep\\n\",\n \"language\": \"FreeBASIC\"\n },\n {\n \"code\": \"package main\\n\\nimport \\\"fmt\\\"\\n\\nfunc main() {\\n s := []int{1, 2, 2, 3, 4, 4, 5}\\n\\n // There is no output as 'prev' is created anew each time\\n // around the loop and set implicitly to zero.\\n for i := 0; i < len(s); i++ {\\n curr := s[i]\\n var prev int\\n if i > 0 && curr == prev {\\n fmt.Println(i)\\n }\\n prev = curr\\n }\\n\\n // Now 'prev' is created only once and reassigned\\n // each time around the loop producing the desired output.\\n var prev int\\n for i := 0; i < len(s); i++ {\\n curr := s[i]\\n if i > 0 && curr == prev {\\n fmt.Println(i)\\n }\\n prev = curr\\n }\\n}\\n\",\n \"language\": \"Go\"\n },\n {\n \"code\": \" 1+I.(}:=}.) 1 2 2 3 4 4 5\\n2 5\\n\",\n \"language\": \"J\"\n },\n {\n \"code\": \"same2=: {{\\n i=. 0\\n r=. ,EMPTY\\n while. i < #y do.\\n curr=. i{y\\n if. i>0 do.\\n if. curr=prev do.\\n r=. r,i\\n end.\\n end.\\n prev=. curr\\n i=. i+1\\n end.\\n r\\n}}\\n\",\n \"language\": \"J\"\n },\n {\n \"code\": \" same2 1,2,2,3,4,4,5\\n2 5\\n\",\n \"language\": \"J\"\n },\n {\n \"code\": \"same3=: {{\\n i=. 0\\n r=. ,EMPTY\\n prev=. 99\\n while. i < #y do.\\n curr=. i{y\\n if. i>0 do.\\n if. curr=prev do.\\n r=. r,i\\n end.\\n end.\\n prev=. curr\\n i=. i+1\\n end.\\n r\\n}}\\n\",\n \"language\": \"J\"\n },\n {\n \"code\": \"public class VariableDeclarationReset {\\n public static void main(String[] args) {\\n int[] s = {1, 2, 2, 3, 4, 4, 5};\\n\\n // There is no output as 'prev' is created anew each time\\n // around the loop and set to zero.\\n for (int i = 0; i < s.length; ++i) {\\n int curr = s[i];\\n int prev = 0;\\n// int prev; // triggers \\\"error: variable prev might not have been initialized\\\"\\n if (i > 0 && curr == prev) System.out.println(i);\\n prev = curr;\\n }\\n\\n int gprev = 0;\\n\\n // Now 'gprev' is used and reassigned\\n // each time around the loop producing the desired output.\\n for (int i = 0; i < s.length; ++i) {\\n int curr = s[i];\\n if (i > 0 && curr == gprev) System.out.println(i);\\n gprev = curr;\\n }\\n }\\n}\\n\",\n \"language\": \"Java\"\n },\n {\n \"code\": \"<!DOCTYPE html>\\n<html lang=\\\"en\\\" >\\n <head>\\n <meta charset=\\\"utf-8\\\"/>\\n <meta name=\\\"viewport\\\" content=\\\"width=device-width, initial-scale=1\\\"/>\\n <title>variable declaration reset</title>\\n </head>\\n <body>\\n <script>\\n\\\"use strict\\\";\\nlet s = [1, 2, 2, 3, 4, 4, 5];\\nfor (let i=0; i<7; i+=1) {\\n let curr = s[i], prev;\\n if (i>0 && (curr===prev)) {\\n console.log(i);\\n }\\n prev = curr;\\n}\\n </script>\\n </body>\\n</html>\\n\",\n \"language\": \"JavaScript\"\n },\n {\n \"code\": \"[1,2,2,3,4,4,5]\\n| . as $array\\n| range(1;length)\\n| select( $array[.] == $array[.-1])\\n\",\n \"language\": \"Jq\"\n },\n {\n \"code\": \"s = [1, 2, 2, 3, 4, 4, 5]\\n\\nfor i in eachindex(s)\\n curr = s[i]\\n i > 1 && curr == prev && println(i)\\n prev = curr\\nend\\n\",\n \"language\": \"Julia\"\n },\n {\n \"code\": \"s = [1, 2, 2, 3, 4, 4, 5]\\nprev = -1\\n\\nfor i in eachindex(s)\\n global prev\\n curr = s[i]\\n i > 1 && curr == prev && println(i)\\n prev = curr\\nend\\n\",\n \"language\": \"Julia\"\n },\n {\n \"code\": \"s = [1, 2, 2, 3, 4, 4, 5]\\n\\nfor i in eachindex(s)[begin+1:end] # or 2:length(s)\\n s[i] == s[i - 1] && println(i)\\nend\\n\",\n \"language\": \"Julia\"\n },\n {\n \"code\": \"&=/'2':1 2 2 3 4 4 5\\n1 4\\n\",\n \"language\": \"K\"\n },\n {\n \"code\": \"let s = [1, 2, 2, 3, 4, 4, 5]\\nfor i in 0..s.high:\\n let curr = s[i]\\n if i > 0 and curr == prev:\\n echo i\\n var prev = curr\\n\",\n \"language\": \"Nim\"\n },\n {\n \"code\": \"let s = [1, 2, 2, 3, 4, 4, 5]\\nfor i in 0..s.high:\\n let curr = s[i]\\n var prev: int\\n if i > 0 and curr == prev:\\n echo i\\n prev = curr\\n\",\n \"language\": \"Nim\"\n },\n {\n \"code\": \"let s = [1, 2, 2, 3, 4, 4, 5]\\nvar prev: int\\nfor i in 0..s.high:\\n let curr = s[i]\\n if i > 0 and curr == prev:\\n echo i\\n prev = curr\\n\",\n \"language\": \"Nim\"\n },\n {\n \"code\": \"@s = <1 2 2 3 4 4 5>;\\nfor ($i = 0; $i < 7; $i++) {\\n $curr = $s[$i];\\n if ($i > 1 and $curr == $prev) { print \\\"$i\\\\n\\\" }\\n $prev = $curr;\\n}\\n\",\n \"language\": \"Perl\"\n },\n {\n \"code\": \"use strict;\\nuse warnings;\\nuse feature 'state';\\n\\nmy @s = <1 2 2 3 4 4 5>;\\nfor (my $i = 0; $i < 7; $i++) {\\n my $curr = $s[$i];\\n state $prev;\\n if ($i > 1 and $curr == $prev) { print \\\"$i\\\\n\\\" }\\n $prev = $curr;\\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;\\\">sequence</span> <span style=\\\"color: #000000;\\\">s</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;\\\">2</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: #000000;\\\">4</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">5</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;\\\">integer</span> <span style=\\\"color: #000000;\\\">curr</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;\\\">prev</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;\\\">and</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: #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: #000000;\\\">prev</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<!--\\n\",\n \"language\": \"Phix\"\n },\n {\n \"code\": \"100H:\\n\\n /* CP/M BDOS SYSTEM CALL */\\n BDOS: PROCEDURE( FN, ARG ); DECLARE FN BYTE, ARG ADDRESS; GOTO 5;END;\\n /* CONSOLE OUTPUT ROUTINES */\\n PR$CHAR: PROCEDURE( C ); DECLARE C BYTE; CALL BDOS( 2, C ); END;\\n PR$STRING: PROCEDURE( S ); DECLARE S ADDRESS; CALL BDOS( 9, S ); END;\\n PR$NL: PROCEDURE; CALL PR$STRING( .( 0DH, 0AH, '$' ) ); END;\\n PR$NUMBER: PROCEDURE( N );\\n DECLARE N ADDRESS;\\n DECLARE V ADDRESS, N$STR( 6 ) BYTE INITIAL( '.....$' ), W BYTE;\\n N$STR( W := LAST( N$STR ) - 1 ) = '0' + ( ( V := N ) 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\\n /* TASK */\\n DECLARE S( 6 ) BYTE INITIAL( 1, 2, 2, 3, 4, 4, 5 );\\n DECLARE I BYTE;\\n DO I = 0 TO LAST( S );\\n DO;\\n DECLARE ( CURR, PREV ) BYTE;\\n CURR = S( I );\\n IF I > 1 AND CURR = PREV THEN DO;\\n CALL PR$NUMBER( I );\\n CALL PR$NL;\\n END;\\n PREV = CURR;\\n END;\\n END;\\n\\nEOF\\n\",\n \"language\": \"PL-M\"\n },\n {\n \"code\": \"s = [1, 2, 2, 3, 4, 4, 5]\\n\\nfor i in range(len(s)):\\n curr = s[i]\\n if i > 0 and curr == prev:\\n print(i)\\n prev = curr\\n\",\n \"language\": \"Python\"\n },\n {\n \"code\": \"my @s = 1, 2, 2, 3, 4, 4, 5;\\nloop (my $i = 0; $i < 7; $i += 1) {\\n my $curr = @s[$i];\\n my $prev;\\n if $i > 1 and $curr == $prev {\\n say $i;\\n }\\n $prev = $curr;\\n}\\n\",\n \"language\": \"Raku\"\n },\n {\n \"code\": \"my @s = 1, 2, 2, 3, 4, 4, 5;\\nquietly loop (my $i = 0; $i < 7; $i += 1) {\\n my $curr = @s[$i];\\n my $prev;\\n if $i > 1 and $curr == $prev {\\n say $i;\\n }\\n $prev = $curr;\\n}\\n\",\n \"language\": \"Raku\"\n },\n {\n \"code\": \"my @s = 1, 2, 2, 3, 4, 4, 5;\\nloop (my $i = 0; $i < 7; $i += 1) {\\n my $curr = @s[$i];\\n our $prev;\\n if $i > 1 and $curr == $prev {\\n say $i;\\n }\\n $prev = $curr;\\n}\\n\",\n \"language\": \"Raku\"\n },\n {\n \"code\": \"my @s = 1, 2, 2, 3, 4, 4, 5;\\nloop (my $i = 0; $i < 7; $i += 1) {\\n my $curr = @s[$i];\\n state $prev;\\n if $i > 1 and $curr == $prev {\\n say $i;\\n }\\n $prev = $curr;\\n}\\n\",\n \"language\": \"Raku\"\n },\n {\n \"code\": \"no strict;\\n@s = 1, 2, 2, 3, 4, 4, 5;\\nloop ($i = 0; $i < 7; $i += 1) {\\n $curr = @s[$i];\\n if $i > 1 and $curr == $prev {\\n say $i;\\n }\\n $prev = $curr;\\n}\\n\",\n \"language\": \"Raku\"\n },\n {\n \"code\": \"Red[]\\ns: [1 2 2 3 4 4 5]\\nrepeat i length? s [\\n curr: s/:i\\n if all [i > 1 curr = prev][\\n print i\\n ]\\n prev: curr\\n]\\n\",\n \"language\": \"Red\"\n },\n {\n \"code\": \"$ include \\\"seed7_05.s7i\\\";\\n\\nconst proc: main is func\\n local\\n const array integer: s is [] (1, 2, 2, 3, 4, 4, 5);\\n var integer: i is 0;\\n var integer: curr is 0;\\n var integer: prev is 0;\\n begin\\n for i range 1 to length(s) do\\n curr := s[i];\\n if i > 1 and curr = prev then\\n writeln(i);\\n end if;\\n prev := curr;\\n end for;\\n end func;\\n\",\n \"language\": \"Seed7\"\n },\n {\n \"code\": \"fn main() {\\n s := [1, 2, 2, 3, 4, 4, 5]\\n\\n // There is no output as 'prev' is created anew each time\\n // around the loop and set implicitly to zero.\\n for i := 0; i < s.len; i++ {\\n curr := s[i]\\n mut prev := 0\\n if i > 0 && curr == prev {\\n println(i)\\n }\\n prev = curr\\n }\\n\\n // Now 'prev' is created only once and reassigned\\n // each time around the loop producing the desired output.\\n mut prev := 0\\n for i := 0; i < s.len; i++ {\\n curr := s[i]\\n if i > 0 && curr == prev {\\n println(i)\\n }\\n prev = curr\\n }\\n}\\n\",\n \"language\": \"V-(Vlang)\"\n },\n {\n \"code\": \"Option Strict On\\nOption Explicit On\\n\\nImports System.IO\\n\\nModule vMain\\n\\n Public Sub Main\\n Dim s As Integer() = New Integer(){1, 2, 2, 3, 4, 4, 5}\\n For i As Integer = 0 To Ubound(s)\\n Dim curr As Integer = s(i)\\n Dim prev As Integer\\n If i > 1 AndAlso curr = prev Then\\n Console.Out.WriteLine(i)\\n End If\\n prev = curr\\n Next i\\n End Sub\\n\\nEnd Module\\n\",\n \"language\": \"Visual-Basic-.NET\"\n },\n {\n \"code\": \"var s = [1, 2, 2, 3, 4, 4, 5]\\n\\n// There is no output as 'prev' is created anew each time\\n// around the loop and set implicitly to null.\\nfor (i in 0...s.count) {\\n var curr = s[i]\\n var prev\\n if (i > 0 && curr == prev) System.print(i)\\n prev = curr\\n}\\n\\n// Now 'prev' is created only once and reassigned\\n// each time around the loop producing the desired output.\\nvar prev\\nfor (i in 0...s.count) {\\n var curr = s[i]\\n if (i > 0 && curr == prev) System.print(i)\\n prev = curr\\n}\\n\",\n \"language\": \"Wren\"\n }\n]","isConversational":false},"task_name":{"kind":"string","value":"Variable-declaration-reset"}}},{"rowIdx":1797,"cells":{"solutions":{"kind":"list like","value":[{"code":"---\nfrom: http://rosettacode.org/wiki/Variable-length_quantity\nnote: Data Structures\n","language":"00-META"},{"code":"Implement some operations on [[wp:Variable-length quantity|variable-length quantities]], at least including conversions from a normal number in the language to the binary representation of the variable-length quantity for that number, and ''vice versa''. Any variants are acceptable.\n\n\n;Task:\nWith above operations, \n*convert these two numbers 0x200000 (2097152 in decimal) and 0x1fffff (2097151 in decimal) into sequences of octets (an eight-bit byte); \n*display these sequences of octets;\n*convert these sequences of octets back to numbers, and check that they are equal to original numbers.\n<br><br>\n\n","language":"00-TASK"},{"code":"F to_str(v)\n R ‘[ ’v.map(n -> hex(n).lowercase().zfill(2)).join(‘ ’)‘ ]’\n\nF to_seq(UInt64 x)\n V i = 0\n L(ii) (9.<0).step(-1)\n I x [&] (UInt64(127) << ii * 7) != 0\n i = ii\n L.break\n\n [Byte] out\n L(j) 0 .. i\n out [+]= ((x >> ((i - j) * 7)) [&] 127) [|] 128\n\n out[i] (+)= 128\n R out\n\nF from_seq(seq)\n UInt64 r = 0\n\n L(b) seq\n r = (r << 7) [|] (b [&] 127)\n\n R r\n\nL(x) [UInt64(7'F), 40'00, 0, 003F'FFFE, 001F'FFFF, 0020'0000, 3311'A123'4DF3'1413]\n V s = to_seq(x)\n print(‘seq from ’hex(x).lowercase()‘ ’to_str(s)‘ back: ’hex(from_seq(s)).lowercase())\n","language":"11l"},{"code":"with Ada.Containers.Vectors;\nwith Ada.Text_IO;\nwith Ada.Unchecked_Conversion;\n\nprocedure VLQ is\n\n package Nat_IO is new Ada.Text_IO.Integer_IO (Natural);\n\n type Byte is mod 2**8;\n\n package Byte_IO is new Ada.Text_IO.Modular_IO (Byte);\n\n type Int7 is mod 2**7;\n\n package Int7_IO is new Ada.Text_IO.Modular_IO (Int7);\n\n type VLQ_Octet is record\n Value : Int7 := 0;\n Next : Boolean := True;\n end record;\n pragma Pack (VLQ_Octet);\n for VLQ_Octet'Size use 8;\n\n function VLQ_To_Byte is new Ada.Unchecked_Conversion (VLQ_Octet, Byte);\n function Byte_To_VLQ is new Ada.Unchecked_Conversion (Byte, VLQ_Octet);\n\n package VLQ_Vectors is new Ada.Containers.Vectors (Natural, VLQ_Octet);\n\n procedure Hex_Print (Position : in VLQ_Vectors.Cursor) is\n Value : Byte := VLQ_To_Byte (VLQ_Vectors.Element (Position));\n begin\n Ada.Text_IO.Put (':');\n Byte_IO.Put (Item => Value, Width => 6, Base => 16);\n end Hex_Print;\n\n procedure Print (X : VLQ_Vectors.Vector) is\n begin\n X.Iterate (Hex_Print'Access);\n Ada.Text_IO.New_Line;\n end Print;\n\n function To_VLQ (From : Natural) return VLQ_Vectors.Vector is\n Result : VLQ_Vectors.Vector;\n Current : Natural := From;\n Element : VLQ_Octet;\n begin\n loop\n Element.Value := Int7 (Current mod 2**7);\n Result.Prepend (Element);\n Current := Current / 2**7;\n exit when Current = 0;\n end loop;\n Element := Result.Last_Element;\n Element.Next := False;\n VLQ_Vectors.Replace_Element (Result, Result.Last, Element);\n return Result;\n end To_VLQ;\n\n function To_Int (From : VLQ_Vectors.Vector) return Natural is\n use type VLQ_Vectors.Cursor;\n Result : Natural := 0;\n Iterator : VLQ_Vectors.Cursor := From.First;\n begin\n while Iterator /= VLQ_Vectors.No_Element loop\n Result := Result * 2**7;\n Result := Result + Natural(VLQ_Vectors.Element (Iterator).Value);\n VLQ_Vectors.Next (Iterator);\n end loop;\n return Result;\n end To_Int;\n\n Test : VLQ_Vectors.Vector;\nbegin\n Test := To_VLQ (16#7f#);\n Nat_IO.Put (To_Int (Test), 10, 16); Ada.Text_IO.Put (\" = \");\n Print (Test);\n Test := To_VLQ (16#4000#);\n Nat_IO.Put (To_Int (Test), 10, 16); Ada.Text_IO.Put (\" = \");\n Print (Test);\n Test := To_VLQ (16#0#);\n Nat_IO.Put (To_Int (Test), 10, 16); Ada.Text_IO.Put (\" = \");\n Print (Test);\n Test := To_VLQ (16#3FFFFE#);\n Nat_IO.Put (To_Int (Test), 10, 16); Ada.Text_IO.Put (\" = \");\n Print (Test);\n Test := To_VLQ (16#1FFFFF#);\n Nat_IO.Put (To_Int (Test), 10, 16); Ada.Text_IO.Put (\" = \");\n Print (Test);\n Test := To_VLQ (16#200000#);\n Nat_IO.Put (To_Int (Test), 10, 16); Ada.Text_IO.Put (\" = \");\n Print (Test);\nend VLQ;\n","language":"Ada"},{"code":"INPUT s$\nLET s$ = LTRIM$(RTRIM$(s$))\nLET v = 0\nFOR i = 1 TO LEN(s$)\n LET c$ = s$(i:i)\n LET k = POS(\"0123456789abcdef\", c$)\n IF k > 0 THEN LET v = v*16 + k - 1\nNEXT i\nPRINT \"S= \";s$, \"V=\";v\n\n! Convert back to hex\nLET hex$ =\"0123456789abcdef\"\nLET hs$=\" \"\n\nFOR i = LEN(hs$) TO 1 STEP -1\n IF v = 0 THEN EXIT FOR\n LET d = MOD(v, 16) + 1\n LET hs$(i:i) = hex$(d:d)\n LET v = INT(v/16)\nNEXT i\nPRINT hs$\nEND\n","language":"ANSI-BASIC"},{"code":"( ( VLQ\n = b07 b8 vlq\n . 0:?b8\n & :?vlq\n & whl\n ' ( !arg:>0\n & mod$(!arg.128):?b07\n & (chr$(!b8+!b07)|) !vlq:?vlq\n & 128:?b8\n & div$(!arg.128):?arg\n )\n & str$!vlq\n )\n& ( NUM\n = c num d\n . 0:?num:?d\n & whl\n ' ( @(!arg:%@?c ?arg)\n & asc$!c:?c:~<128\n & 128*(!c+-128+!num):?num\n & 1+!d:?d\n )\n & (!c:<128&!c+!num:?num|)\n & !num\n )\n& ( printVLQ\n = c h\n . :?h\n & whl\n ' ( @(!arg:%@?c ?arg)\n & d2x$(asc$!c):?x\n & !h (@(!x:? [1)&0|) !x\n : ?h\n )\n & ( asc$!c:~<128&!h 00:?h\n |\n )\n & out$(\"VLQ :\" str$!h)\n )\n& ( test\n = vlq num\n . out$(\"input:\" !arg)\n & VLQ$(x2d$!arg):?vlq\n & printVLQ$!vlq\n & NUM$!vlq:?num\n & out$(\"back :\" d2x$!num \\n)\n )\n& test$200000\n& test$1fffff\n& test$00\n& test$7f\n& test$80\n& test$81\n& test$82\n& test$894E410E0A\n);\n","language":"Bracmat"},{"code":"#include <stdio.h>\n#include <stdint.h>\n\nvoid to_seq(uint64_t x, uint8_t *out)\n{\n\tint i, j;\n\tfor (i = 9; i > 0; i--) {\n\t\tif (x & 127ULL << i * 7) break;\n\t}\n\tfor (j = 0; j <= i; j++)\n\t\tout[j] = ((x >> ((i - j) * 7)) & 127) | 128;\n\n\tout[i] ^= 128;\n}\n\nuint64_t from_seq(uint8_t *in)\n{\n\tuint64_t r = 0;\n\n\tdo {\n\t\tr = (r << 7) | (uint64_t)(*in & 127);\n\t} while (*in++ & 128);\n\n\treturn r;\n}\n\nint main()\n{\n\tuint8_t s[10];\n\tuint64_t x[] = { 0x7f, 0x4000, 0, 0x3ffffe, 0x1fffff, 0x200000, 0x3311a1234df31413ULL};\n\n\tint i, j;\n\tfor (j = 0; j < sizeof(x)/8; j++) {\n\t\tto_seq(x[j], s);\n\t\tprintf(\"seq from %llx: [ \", x[j]);\n\n\t\ti = 0;\n\t\tdo { printf(\"%02x \", s[i]); } while ((s[i++] & 128));\n\t\tprintf(\"] back: %llx\\n\", from_seq(s));\n\t}\n\n\treturn 0;\n}\n","language":"C"},{"code":"seq from 7f: [ 7f ] back: 7f\nseq from 4000: [ 81 80 00 ] back: 4000\nseq from 0: [ 00 ] back: 0\nseq from 3ffffe: [ 81 ff ff 7e ] back: 3ffffe\nseq from 1fffff: [ ff ff 7f ] back: 1fffff\nseq from 200000: [ 81 80 80 00 ] back: 200000\nseq from 3311a1234df31413: [ b3 88 e8 a4 b4 ef cc a8 13 ] back: 3311a1234df31413\n","language":"C"},{"code":"#include <iomanip>\n#include <iostream>\n#include <vector>\n\nstd::ostream &operator<<(std::ostream &os, const std::vector<uint8_t> &v) {\n auto it = v.cbegin();\n auto end = v.cend();\n\n os << \"[ \";\n if (it != end) {\n os << std::setfill('0') << std::setw(2) << (uint32_t)*it;\n it = std::next(it);\n }\n while (it != end) {\n os << ' ' << std::setfill('0') << std::setw(2) << (uint32_t)*it;\n it = std::next(it);\n }\n return os << \" ]\";\n}\n\nstd::vector<uint8_t> to_seq(uint64_t x) {\n int i;\n for (i = 9; i > 0; i--) {\n if (x & 127ULL << i * 7) {\n break;\n }\n }\n\n std::vector<uint8_t> out;\n for (int j = 0; j <= i; j++) {\n out.push_back(((x >> ((i - j) * 7)) & 127) | 128);\n }\n out[i] ^= 128;\n return out;\n}\n\nuint64_t from_seq(const std::vector<uint8_t> &seq) {\n uint64_t r = 0;\n\n for (auto b : seq) {\n r = (r << 7) | (b & 127);\n }\n\n return r;\n}\n\nint main() {\n std::vector<uint64_t> src{ 0x7f, 0x4000, 0, 0x3ffffe, 0x1fffff, 0x200000, 0x3311a1234df31413ULL };\n\n for (auto x : src) {\n auto s = to_seq(x);\n std::cout << std::hex;\n std::cout << \"seq from \" << x << ' ' << s << \" back: \" << from_seq(s) << '\\n';\n std::cout << std::dec;\n }\n\n return 0;\n}\n","language":"C++"},{"code":"namespace Vlq\n{\n using System;\n using System.Collections.Generic;\n using System.Linq;\n\n public static class VarLenQuantity\n {\n public static ulong ToVlq(ulong integer)\n {\n var array = new byte[8];\n var buffer = ToVlqCollection(integer)\n .SkipWhile(b => b == 0)\n .Reverse()\n .ToArray();\n Array.Copy(buffer, array, buffer.Length);\n return BitConverter.ToUInt64(array, 0);\n }\n\n public static ulong FromVlq(ulong integer)\n {\n var collection = BitConverter.GetBytes(integer).Reverse();\n return FromVlqCollection(collection);\n }\n\n public static IEnumerable<byte> ToVlqCollection(ulong integer)\n {\n if (integer > Math.Pow(2, 56))\n throw new OverflowException(\"Integer exceeds max value.\");\n\n var index = 7;\n var significantBitReached = false;\n var mask = 0x7fUL << (index * 7);\n while (index >= 0)\n {\n var buffer = (mask & integer);\n if (buffer > 0 || significantBitReached)\n {\n significantBitReached = true;\n buffer >>= index * 7;\n if (index > 0)\n buffer |= 0x80;\n yield return (byte)buffer;\n }\n mask >>= 7;\n index--;\n }\n }\n\n\n public static ulong FromVlqCollection(IEnumerable<byte> vlq)\n {\n ulong integer = 0;\n var significantBitReached = false;\n\n using (var enumerator = vlq.GetEnumerator())\n {\n int index = 0;\n while (enumerator.MoveNext())\n {\n var buffer = enumerator.Current;\n if (buffer > 0 || significantBitReached)\n {\n significantBitReached = true;\n integer <<= 7;\n integer |= (buffer & 0x7fUL);\n }\n\n if (++index == 8 || (significantBitReached && (buffer & 0x80) != 0x80))\n break;\n }\n }\n return integer;\n }\n\n public static void Main()\n {\n var integers = new ulong[] { 0x7fUL << 7 * 7, 0x80, 0x2000, 0x3FFF, 0x4000, 0x200000, 0x1fffff };\n\n foreach (var original in integers)\n {\n Console.WriteLine(\"Original: 0x{0:X}\", original);\n\n //collection\n var seq = ToVlqCollection(original);\n Console.WriteLine(\"Sequence: 0x{0}\", seq.Select(b => b.ToString(\"X2\")).Aggregate(string.Concat));\n\n var decoded = FromVlqCollection(seq);\n Console.WriteLine(\"Decoded: 0x{0:X}\", decoded);\n\n //ints\n var encoded = ToVlq(original);\n Console.WriteLine(\"Encoded: 0x{0:X}\", encoded);\n\n decoded = FromVlq(encoded);\n Console.WriteLine(\"Decoded: 0x{0:X}\", decoded);\n\n Console.WriteLine();\n }\n Console.WriteLine(\"Press any key to continue...\");\n Console.ReadKey();\n }\n }\n}\n","language":"C-sharp"},{"code":"Original: 0xFE000000000000\nSequence: 0xFF80808080808000\nDecoded: 0xFE000000000000\nEncoded: 0xFF80808080808000\nDecoded: 0xFE000000000000\n\nOriginal: 0x80\nSequence: 0x8100\nDecoded: 0x80\nEncoded: 0x8100\nDecoded: 0x80\n\nOriginal: 0x2000\nSequence: 0xC000\nDecoded: 0x2000\nEncoded: 0xC000\nDecoded: 0x2000\n\nOriginal: 0x3FFF\nSequence: 0xFF7F\nDecoded: 0x3FFF\nEncoded: 0xFF7F\nDecoded: 0x3FFF\n\nOriginal: 0x4000\nSequence: 0x818000\nDecoded: 0x4000\nEncoded: 0x818000\nDecoded: 0x4000\n\nOriginal: 0x200000\nSequence: 0x81808000\nDecoded: 0x200000\nEncoded: 0x81808000\nDecoded: 0x200000\n\nOriginal: 0x1FFFFF\nSequence: 0xFFFF7F\nDecoded: 0x1FFFFF\nEncoded: 0xFFFF7F\nDecoded: 0x1FFFFF\n\nPress any key to continue...\n","language":"C-sharp"},{"code":"include \"cowgol.coh\";\n\nsub VLQEncode(number: uint32, buf: [uint8]) is\n var step := number;\n while step > 0 loop\n step := step >> 7;\n buf := @next buf;\n end loop;\n\n var mark: uint8 := 0;\n while number > 0 loop\n buf := @prev buf;\n [buf] := mark | (number as uint8 & 0x7F);\n mark := 0x80;\n number := number >> 7;\n end loop;\nend sub;\n\nsub VLQDecode(buf: [uint8]): (result: uint32) is\n result := 0;\n loop\n var byte := [buf];\n buf := @next buf;\n result := (result << 7) | (byte & 0x7F) as uint32;\n\n if byte & 0x80 == 0 then\n return;\n end if;\n end loop;\nend sub;\n\nsub VLQPrint(buf: [uint8]) is\n loop\n print_hex_i8([buf]);\n if [buf] & 0x80 == 0 then\n break;\n end if;\n buf := @next buf;\n end loop;\nend sub;\n\nsub VLQTest(value: uint32) is\n var buf: uint8[8];\n\n print(\"Input: \");\n print_hex_i32(value);\n print_nl();\n\n print(\"Encoded: \");\n VLQEncode(value, &buf[0]);\n VLQPrint(&buf[0]);\n print_nl();\n\n print(\"Decoded: \");\n value := VLQDecode(&buf[0]);\n print_hex_i32(value);\n print_nl();\nend sub;\n\nVLQTest(0x200000);\nprint_nl();\nVLQTest(0x1FFFFF);\nprint_nl();\n","language":"Cowgol"},{"code":"import std.stdio, std.string, std.file, std.algorithm;\n\n/// Variable length quantity (unsigned long, max 63-bit).\nstruct VLQ {\n ulong value;\n\n // This allows VLQ to work like an ulong.\n alias value this;\n\n uint extract(in ubyte[] v) pure\n in {\n assert(v.length > 0);\n } body {\n immutable limit = min(v.length - 1, 8);\n ulong t = 0;\n size_t idx = 0;\n while ((idx < limit) && ((v[idx] & 0x80) > 0))\n t = (t << 7) | (0x7f & v[idx++]);\n if (idx > limit)\n throw new Exception(\n \"Too large for ulong or invalid format.\");\n else\n value = (t << 7) | v[idx];\n return idx + 1;\n }\n\n VLQ from(in ubyte[] v) pure {\n extract(v);\n return this;\n }\n\n @property ubyte[] toVLQ() const pure {\n ubyte[] v = [0x7f & value];\n for (ulong k = value >>> 7; k > 0; k >>>= 7)\n v ~= (k & 0x7f) | 0x80;\n if (v.length > 9)\n throw new Exception(\"Too large value.\");\n v.reverse();\n return v;\n }\n\n static ulong[] split(in ubyte[] b) pure {\n ulong[] res;\n VLQ v;\n for (size_t i = 0; i < b.length; ) {\n i += v.extract(b[i .. $]);\n res ~= v.value;\n }\n return res;\n }\n\n string toString() const pure /*nothrow*/ {\n return format(\"(%(%02X:%))\", this.toVLQ);\n }\n}\n\n\nvoid main() { // VLQ demo code.\n VLQ a = VLQ(0x7f),\n b = VLQ(0x4000),\n c;\n writefln(\"a:%8x = %s\\nb:%8x = %s\\nc:%8x = %s\",\n a.value, a, b.value, b, c.value, c);\n\n // Some operations.\n c = (a + 1) * b;\n a = c - 1;\n b = VLQ().from(a.toVLQ);\n a <<= 1;\n\n // Convert ulong to octet sequence.\n writefln(\"\\na:%8x = %s\\nb:%8x = %s\\nc:%8x = %s\",\n a.value, a, b.value, b, c.value, c);\n\n // Write them to a binary file.\n std.file.write(\"vlqtest.bin\", a.toVLQ ~ b.toVLQ ~ c.toVLQ);\n\n // Read them back.\n const buf = cast(ubyte[])std.file.read(\"vlqtest.bin\");\n writefln(\"\\nFile length: %d bytes.\", buf.length);\n\n // Convert octet sequence to ulongs.\n foreach (immutable i, immutable v; VLQ.split(buf))\n writefln(\"%d:%8x = %s\", i + 1, v, VLQ(v));\n}\n","language":"D"},{"code":"function NumberToVLQ(Num: int64): string;\n{Convert Num to Variable-Length Quantity VLQ Octets (bytes)}\n{Octet = 7-bit data and MSB indicating the last data item = 0 }\n{Note: String are being used as byte-array because they are easy}\nvar I: integer;\nvar T: byte;\nvar BA: string;\nbegin\nResult:='';\nBA:='';\n{Get array of octets}\nwhile Num>0 do\n\tbegin\n\tBA:=BA+char($7F and Num);\n\tNum:=Num shr 7;\n\tend;\n{Reverse data and flag more data is coming}\nResult:='';\nfor I:=Length(BA) downto 1 do\n\tbegin\n\tT:=Byte(BA[I]);\n\tif I<>1 then T:=T or $80;\n\tResult:=Result+char(T);\n\tend;\nend;\n\n\nfunction VLQToNumber(VLQ: string): int64;\n{Convert Variable-Length Quantity VLQ Octets (bytes) to numbers}\n{Octet = 7-bit data and MSB indicating the last data item = 0 }\n{Note: String are being used as byte-array because they are easy}\nvar I: integer;\nvar T: byte;\nvar BA: string;\nbegin\nResult:=0;\nfor I:=1 to Length(VLQ) do\nResult:=(Result shl 7) or (Byte(VLQ[I]) and $7F);\nend;\n\n\n\nfunction VLQToString(VLQ: string): string;\n{Convert VLQ to string of hex numbers}\nvar I: integer;\nbegin\nResult:='(';\nfor I:=1 to Length(VLQ) do\n\tbegin\n\tif I>1 then Result:=Result+', ';\n\tResult:=Result+IntToHex(byte(VLQ[I]),2);\n\tend;\nResult:=Result+')';\nend;\n\n\n\nprocedure ShowVLQ(Memo: TMemo; Num: int64);\nvar VLQ: string;\nvar I: int64;\nvar S: string;\nbegin\nVLQ:=NumberToVLQ(Num);\nS:=VLQToString(VLQ);\nI:=VLQToNumber(VLQ);\nMemo.Lines.Add('Original Number: '+Format('%x',[Num]));\nMemo.Lines.Add('Converted to VLQ: '+Format('%s',[S]));\nMemo.Lines.Add('Back to Original: '+Format('%x',[I]));\nMemo.Lines.Add('');\nend;\n\nconst Num1 = $0;\nconst Num2 = $7F;\nconst Num3 = $4000;\nconst Num4 = $1FFFFF;\nconst Num5 = $200000;\nconst Num6 = $3FFFFE;\nconst Num7 = $3311A1234DF31413;\n\n\n\nprocedure VariableLengthOctets(Memo: TMemo);\nbegin\nShowVLQ(Memo, Num1);\nShowVLQ(Memo, Num2);\nShowVLQ(Memo, Num3);\nShowVLQ(Memo, Num4);\nShowVLQ(Memo, Num5);\nShowVLQ(Memo, Num6);\nShowVLQ(Memo, Num7);\nend;\n","language":"Delphi"},{"code":"function vlq_encode(integer n)\n sequence s\n s = {}\n while n > 0 do\n s = prepend(s, #80 * (length(s) > 0) + and_bits(n, #7F))\n n = floor(n / #80)\n end while\n if length(s) = 0 then\n s = {0}\n end if\n return s\nend function\n\nfunction vlq_decode(sequence s)\n integer n\n n = 0\n for i = 1 to length(s) do\n n *= #80\n n += and_bits(s[i], #7F)\n if not and_bits(s[i], #80) then\n exit\n end if\n end for\n return n\nend function\n\nfunction svlg(sequence s)\n sequence out\n out = \"\"\n for i = 1 to length(s) do\n out &= sprintf(\"#%02x:\", {s[i]})\n end for\n return out[1..$-1]\nend function\n\nconstant testNumbers = { #200000, #1FFFFF, 1, 127, 128 }\nsequence s\nfor i = 1 to length(testNumbers) do\n s = vlq_encode(testNumbers[i])\n printf(1, \"#%02x -> %s -> #%02x\\n\", {testNumbers[i], svlg(s), vlq_decode(s)})\nend for\n","language":"Euphoria"},{"code":"Sub toOctets(n As Integer, octets() As Integer)\n Dim As String s = Bin(n)\n Dim As Integer le = Len(s)\n Dim As Integer r = le Mod 7\n Dim As Integer d = le \\ 7\n If (r > 0) Then\n d += 1\n s = Right(\"0000000\" & s, 7 * d)\n End If\n For i As Integer = 0 To d - 2\n Redim Preserve octets(i+1) As Integer\n octets(i) = Val(\"&B1\" & Mid(s, i * 7 + 1, 7))\n Next i\n octets(d - 1) = Val(\"&B0\" & Mid(s, (d - 1) * 7 + 1, 7))\nEnd Sub\n\nFunction fromOctets(octets() As Integer) As Integer\n Dim As String s = \"\"\n For i As Integer = 0 To Ubound(octets)\n s &= Right(\"0000000\" & Bin(octets(i)), 7)\n Next i\n Return Val(\"&B\" & s)\nEnd Function\n\nDim As Integer tests(1) = {2097152, 2097151}\nDim As Integer i\nFor i = 0 To Ubound(tests)\n Dim As Integer octets()\n toOctets(tests(i), octets())\n Dim As String display = \"\"\n For j As Integer = 0 To Ubound(octets)\n display &= \"0x\" & Hex(octets(j), 2) & \" \"\n Next j\n Print tests(i); \" -> \"; display; \"-> \"; fromOctets(octets())\nNext i\n\nSleep\n","language":"FreeBASIC"},{"code":"package main\n\nimport (\n \"fmt\"\n \"encoding/binary\"\n)\n\nfunc main() {\n buf := make([]byte, binary.MaxVarintLen64)\n for _, x := range []int64{0x200000, 0x1fffff} {\n v := buf[:binary.PutVarint(buf, x)]\n fmt.Printf(\"%d encodes into %d bytes: %x\\n\", x, len(v), v)\n x, _ = binary.Varint(v)\n fmt.Println(x, \"decoded\")\n }\n}\n","language":"Go"},{"code":"final RADIX = 7\nfinal MASK = 2**RADIX - 1\n\ndef octetify = { n ->\n def octets = []\n for (def i = n; i != 0; i >>>= RADIX) {\n octets << ((byte)((i & MASK) + (octets.empty ? 0 : MASK + 1)))\n }\n octets.reverse()\n}\n\ndef deoctetify = { octets ->\n octets.inject(0) { long n, octet ->\n (n << RADIX) + ((int)(octet) & MASK)\n }\n}\n","language":"Groovy"},{"code":"def testNumbers = [ 0x200000, 0x1fffff, 1, 127, 128, 589723405834L ]\n\ntestNumbers.each { a ->\n def octets = octetify(a)\n octets.each { printf \"0x%02x \", it }; println ()\n def a1 = deoctetify(octets)\n assert a1 == a\n}\n","language":"Groovy"},{"code":"import Numeric (readOct, showOct)\nimport Data.List (intercalate)\n\nto :: Int -> String\nto = flip showOct \"\"\n\nfrom :: String -> Int\nfrom = fst . head . readOct\n\nmain :: IO ()\nmain =\n mapM_\n (putStrLn .\n intercalate \" <-> \" . (pure (:) <*> to <*> (return . show . from . to)))\n [2097152, 2097151]\n","language":"Haskell"},{"code":"import Data.List (intercalate)\n\nto :: Int -> Int -> [Int]\nto _ 0 = []\nto base i = to base q <> [r]\n where\n (q, r) = quotRem i base\n\nfrom :: Int -> [Int] -> Int\nfrom base = foldl1 ((+) . (base *))\n\n\n--------------------------- TEST ---------------------------\nmain :: IO ()\nmain =\n mapM_\n (putStrLn .\n intercalate \" <-> \" .\n (((:) . (=<<) show . toBase) <*> (return . show . fromBase . toBase)))\n [2097152, 2097151]\n where\n b = 8\n fromBase = from b\n toBase = to b\n","language":"Haskell"},{"code":"procedure main()\nevery i := 2097152 | 2097151 | 1 | 127 | 128 | 589723405834 | 165 | 256 do\n write(image(i),\" = \",string2hex(v := uint2vlq(i)),\" = \",vlq2uint(v))\nend\n\nprocedure vlq2uint(s) #: decode a variable length quantity\n if *s > 0 then {\n i := 0\n s ? while h := ord(move(1)) do {\n if (pos(0) & h > 128) | (not pos(0) & h < 128) then fail\n i := 128 * i + h % 128\n }\n return i\n }\nend\n\nprocedure uint2vlq(i,c) #: encode a whole number as a variable length quantity\n if \"integer\" == type(-1 < i) then\n return if i = 0 then\n char((/c := 0)) | \"\"\n else\n uint2vlq(i/128,1) || char((i % 128) + ((/c := 0) | 128) )\nend\n\nprocedure string2hex(s) #: convert a string to hex\n h := \"\"\n every i := ord(!s) do\n h ||:= \"0123456789abcdef\"[i/16+1] || \"0123456789abcdef\"[i%16+1]\n return h\nend\n","language":"Icon"},{"code":"N=: 128x\nv2i=: (N&| N&#./.~ [: +/\\ _1 |. N&>)@i.~&a.\ni2v=: a. {~ [:;}.@(N+//.@,:N&#.inv)&.>\nifv=: v2i :. i2v\nvfi=: i2v :. v2i\nav=: 3 u: ]\n","language":"J"},{"code":" numbers=: 16b7f 16b4000 0 16b3ffffe 16b1fffff 200000\n av vlq=: vfi numbers\n127 129 128 0 0 129 255 255 126 255 255 127 140 154 64\n av (vfi 1 2 3 4 5 6) +&.ifv vlq\n129 0 129 128 2 3 130 128 128 2 129 128 128 4 140 154 70\n","language":"J"},{"code":"public class VLQCode\n{\n public static byte[] encode(long n)\n {\n int numRelevantBits = 64 - Long.numberOfLeadingZeros(n);\n int numBytes = (numRelevantBits + 6) / 7;\n if (numBytes == 0)\n numBytes = 1;\n byte[] output = new byte[numBytes];\n for (int i = numBytes - 1; i >= 0; i--)\n {\n int curByte = (int)(n & 0x7F);\n if (i != (numBytes - 1))\n curByte |= 0x80;\n output[i] = (byte)curByte;\n n >>>= 7;\n }\n return output;\n }\n\n public static long decode(byte[] b)\n {\n long n = 0;\n for (int i = 0; i < b.length; i++)\n {\n int curByte = b[i] & 0xFF;\n n = (n << 7) | (curByte & 0x7F);\n if ((curByte & 0x80) == 0)\n break;\n }\n return n;\n }\n\n public static String byteArrayToString(byte[] b)\n {\n StringBuilder sb = new StringBuilder();\n for (int i = 0; i < b.length; i++)\n {\n if (i > 0)\n sb.append(\", \");\n String s = Integer.toHexString(b[i] & 0xFF);\n if (s.length() < 2)\n s = \"0\" + s;\n sb.append(s);\n }\n return sb.toString();\n }\n\n public static void main(String[] args)\n {\n long[] testNumbers = { 2097152, 2097151, 1, 127, 128, 589723405834L };\n for (long n : testNumbers)\n {\n byte[] encoded = encode(n);\n long decoded = decode(encoded);\n System.out.println(\"Original input=\" + n + \", encoded = [\" + byteArrayToString(encoded) + \"], decoded=\" + decoded + \", \" + ((n == decoded) ? \"OK\" : \"FAIL\"));\n }\n }\n}\n","language":"Java"},{"code":"const RADIX = 7;\nconst MASK = 2**RADIX - 1;\n\nconst octetify = (n)=> {\n\tif (n >= 2147483648) {\n\t\tthrow new RangeError(\"Variable Length Quantity not supported for numbers >= 2147483648\");\n\t}\n\tconst octets = [];\n\tfor (let i = n; i != 0; i >>>= RADIX) {\n\t\toctets.push((((i & MASK) + (octets.empty ? 0 : (MASK + 1)))));\n\t}\n\toctets.reverse();\n\treturn octets;\n};\n\nconst deoctetify = (octets)=>\n\toctets.reduce((n, octet)=>\n\t\t(n << RADIX) + (octet & MASK)\n\t, 0);\n\n// Test (assuming Node.js)\n\nconst assert = require(\"assert\");\nconst testNumbers = [ 0x200000, 0x1fffff, 1, 127, 128, 2147483647 /*, 589723405834*/ ]\n\ntestNumbers.forEach((number)=> {\n\tconst octets = octetify(number)\n\tconsole.log(octets);\n\tconst got_back_number = deoctetify(octets)\n\tassert.strictEqual(got_back_number, number);\n});\n","language":"JavaScript"},{"code":"# \"VARIABLE-LENGTH QUANTITY\"\n# A VLQ is a variable-length encoding of a number into a sequence of octets,\n# with the most-significant octet first, and with the most significant bit first in each octet.\n# The first (left-most) bit in each octet is a continuation bit: all octets except the last have the left-most bit set.\n# The bits of the original number are taken 7 at a time from the right to form the octets.\n# Thus, if the number is between 0 and 127, it is represented exactly as one byte.\n\n# Produce a stream of the base $b \"digits\" of the input number,\n# least significant first, with a final 0\ndef digits($b):\n def mod: . % $b;\n def div: ((. - mod) / $b);\n recurse( select(. > 0) | div) | mod ;\n\n# 2 <= $b <= 36\ndef tobase($b):\n def digit: \"0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZ\"[.:.+1];\n if . == 0 then \"0\"\n else [digits($b) | digit] | reverse[1:] | add\n end;\n\n# input: a decimal integer\n# output: the corresponding variable-length quantity expressed as an array of strings of length 2,\n# each representing an octet in hexadecimal notation, with most-significant octet first.\ndef vlq:\n def lpad: if length == 2 then . else \"0\" + . end;\n [digits(128) + 128] | reverse[1:] | .[-1] -=128 | map(tobase(16) | lpad);\n\n# Input: a VLQ as produced by vlq/0\n# Output: the corresponding decimal\ndef vlq2dec:\n def x2d: # convert the character interpreted as a hex digit to a decimal\n explode[0] as $x\n | if $x < 65 then $x - 48 elif $x < 97 then $x - 55 else $x - 87 end;\n map( ((.[0:1] | x2d) * 16) + (.[1:] | x2d) - 128)\n | .[-1] += 128 # the most significant bit of the least significant octet\n | reduce reverse[] as $x ({x: 0, m: 1}; .x += ($x * .m) | .m *= 128)\n | .x ;\n\n# The task\n\ndef lpad($len): tostring | ($len - length) as $l | (\" \" * $l)[:$l] + .;\n\n2097152, 2097151\n| vlq as $vlq\n| \"\\(lpad(8)) => \\($vlq|join(\",\")|lpad(12)) => \\($vlq | vlq2dec | lpad(8))\"\n","language":"Jq"},{"code":"using Printf\n\nmutable struct VLQ\n quant::Vector{UInt8}\nend\n\nfunction VLQ(n::T) where T <: Integer\n quant = UInt8.(digits(n, 128))\n @inbounds for i in 2:length(quant) quant[i] |= 0x80 end\n VLQ(reverse(quant))\nend\n\nimport Base.UInt64\nfunction Base.UInt64(vlq::VLQ)\n quant = reverse(vlq.quant)\n n = shift!(quant)\n p = one(UInt64)\n for i in quant\n p *= 0x80\n n += p * ( i & 0x7f)\n end\n return n\nend\n\nconst test = [0x00200000, 0x001fffff, 0x00000000, 0x0000007f,\n 0x00000080, 0x00002000, 0x00003fff, 0x00004000,\n 0x08000000, 0x0fffffff]\n\nfor i in test\n vlq = VLQ(i)\n j = UInt(vlq)\n @printf \"0x%-8x => [%-25s] => 0x%x\\n\" i join((\"0x\" * hex(r, 2) for r in vlq.quant), \", \") j\nend\n","language":"Julia"},{"code":"// version 1.0.6\n\nfun Int.toOctets(): ByteArray {\n var s = Integer.toBinaryString(this)\n val r = s.length % 7\n var z = s.length / 7\n if (r > 0) {\n z++\n s = s.padStart(z * 7, '0')\n }\n s = Array(z) { \"1\" + s.slice(it * 7 until (it + 1) * 7) }.joinToString(\"\")\n s = s.take(s.length - 8) + \"0\" + s.takeLast(7)\n return ByteArray(z) { Integer.parseInt(s.slice(it * 8 until (it + 1) * 8), 2).toByte() }\n}\n\nfun ByteArray.fromOctets(): Int {\n var s = \"\"\n for (b in this) s += Integer.toBinaryString(b.toInt()).padStart(7, '0').takeLast(7)\n return Integer.parseInt(s, 2)\n}\n\nfun main(args: Array<String>) {\n val tests = intArrayOf(0x7f, 0x3fff, 0x200000, 0x1fffff)\n for (test in tests) {\n val ba = test.toOctets()\n print(\"${\"0x%x\".format(test).padEnd(8)} -> \")\n var s = \"\"\n ba.forEach { s += \"0x%02x \".format(it) }\n println(\"${s.padEnd(20)} <- ${\"0x%x\".format(ba.fromOctets())}\")\n }\n}\n","language":"Kotlin"},{"code":"toOctets[n_Integer] :=\n StringJoin @@@\n Partition[\n PadLeft[Characters@IntegerString[n, 16],\n 2 Ceiling[Plus @@ DigitCount[n, 16]/2], {\"0\"}], 2]\nfromOctets[octets_List] := FromDigits[StringJoin @@ octets, 16]\nGrid[{#, toOctets@#, fromOctets[toOctets@#]} & /@ {16^^3ffffe, 16^^1fffff, 16^^200000}]\n","language":"Mathematica"},{"code":"import strformat\n\nproc toSeq(x: uint64): seq[uint8] =\n var x = x\n var f = 0u64\n for i in countdown(9u64, 1):\n if (x and 127'u64 shl (i * 7)) > 0:\n f = i\n break\n for j in 0u64..f:\n result.add uint8((x shr ((f - j) * 7)) and 127) or 128\n\n result[f] = result[f] xor 128'u8\n\nproc fromSeq(xs: openArray[uint8]): uint64 =\n for x in xs:\n result = (result shl 7) or (x and 127)\n\nfor x in [0x7f'u64, 0x4000'u64, 0'u64, 0x3ffffe'u64, 0x1fffff'u64,\n 0x200000'u64, 0x3311a1234df31413'u64]:\n let c = toSeq(x)\n echo &\"seq from {x}: {c} back: {fromSeq(c)}\"\n","language":"Nim"},{"code":"let to_vlq n =\n let a, b = n lsr 7, n land 0x7F in\n let rec aux n acc =\n let x = (n land 0x7F) lor 0x80\n and xs = n lsr 7 in\n if xs > 0\n then aux xs (x::acc)\n else x::acc\n in\n aux a [b]\n\nlet to_num = List.fold_left (fun n x -> n lsl 7 + (x land 0x7F)) 0\n\nlet v_rep n =\n Printf.printf \"%d ->\" n;\n let seq = to_vlq n in\n List.iter (Printf.printf \" 0x%02X\") seq;\n let num = to_num seq in\n Printf.printf \"-> %d\\n%!\" num;\n assert (n = num)\n\nlet _ =\n v_rep 0x200000;\n v_rep 0x1FFFFF\n","language":"OCaml"},{"code":"hex(s)=my(a=10,b=11,c=12,d=13,e=14,f=15);subst(Pol(eval(Vec(s))),'x,16);\nn1=hex(\"200000\");n2=hex(\"1fffff\");\nv1=digits(n1,256)\nv2=digits(n2,256)\nsubst(Pol(v1),'x,256)==n1\nsubst(Pol(v2),'x,256)==n2\n","language":"PARI-GP"},{"code":"use warnings;\nuse strict;\n\nfor my $testcase (\n 0, 0xa, 123, 254, 255, 256,\n 257, 65534, 65535, 65536, 65537, 0x1fffff,\n 0x200000\n )\n{\n my @vlq = vlq_encode($testcase);\n printf \"%8s %12s %8s\\n\", $testcase, ( join ':', @vlq ), vlq_decode(@vlq);\n}\n\nsub vlq_encode {\n my @vlq;\n my $binary = sprintf \"%s%b\", 0 x 7, shift;\n $binary =~ s/(.{7})$//;\n @vlq = ( unpack 'H2', ( pack 'B8', '0' . $1 ) );\n while ( 0 + $binary ) {\n $binary =~ s/(.{7})$//;\n unshift @vlq, ( unpack 'H2', pack 'B8', '1' . $1 );\n }\n return @vlq;\n}\n\nsub vlq_decode {\n my $num;\n $num .= sprintf \"%07b\", hex(shift @_) & 0x7f while @_;\n return oct '0b' . $num;\n}\n","language":"Perl"},{"code":"-->\n <span style=\"color: #008080;\">function</span> <span style=\"color: #000000;\">vlq_encode</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;\">sequence</span> <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: #7060A8;\">length</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">s</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;\">n</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;\">msb</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">0</span>\n <span style=\"color: #008080;\">if</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: #7060A8;\">crash</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #008000;\">\"unsigned integers only!\"</span><span style=\"color: #0000FF;\">)</span> <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">if</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;\">res</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">prepend</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">res</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">msb</span><span style=\"color: #0000FF;\">+</span><span style=\"color: #7060A8;\">and_bits</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">n</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">#7F</span><span style=\"color: #0000FF;\">))</span>\n <span style=\"color: #000000;\">n</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;\">#80</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;\">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;\">msb</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">#80</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: #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;\">vlq_decode</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;\">sequence</span> <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;\">integer</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: #000000;\">n</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">n</span><span style=\"color: #0000FF;\">*</span><span style=\"color: #000000;\">#80</span><span style=\"color: #0000FF;\">+</span><span style=\"color: #7060A8;\">and_bits</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #004080;\">byte</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">#7F</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;\">si</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">#80</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;\">n</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #000000;\">n</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">0</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;\">svlg</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> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #008000;\">\"\"</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;\">res</span> <span style=\"color: #0000FF;\">&=</span> <span style=\"color: #7060A8;\">sprintf</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #008000;\">\"#%02x:\"</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;\">end</span> <span style=\"color: #008080;\">for</span>\n <span style=\"color: #008080;\">return</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: #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: #008080;\">constant</span> <span style=\"color: #000000;\">testNumbers</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #0000FF;\">{</span> <span style=\"color: #000000;\">#200000</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">#1FFFFF</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">127</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">128</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: #000000;\">vlq_encode</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">testNumbers</span><span style=\"color: #0000FF;\">),</span>\n <span style=\"color: #000000;\">decoded</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">vlq_decode</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">s</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 -> %s\\n\"</span><span style=\"color: #0000FF;\">,{</span><span style=\"color: #000000;\">svlg</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">testNumbers</span><span style=\"color: #0000FF;\">),</span><span style=\"color: #000000;\">svlg</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">s</span><span style=\"color: #0000FF;\">),</span><span style=\"color: #000000;\">svlg</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">decoded</span><span style=\"color: #0000FF;\">)})</span>\n <span style=\"color: #008080;\">if</span> <span style=\"color: #000000;\">decoded</span><span style=\"color: #0000FF;\">!=</span><span style=\"color: #000000;\">testNumbers</span> <span style=\"color: #008080;\">then</span> <span style=\"color: #7060A8;\">crash</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #008000;\">\"something wrong\"</span><span style=\"color: #0000FF;\">)</span> <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">if</span>\n<!--\n","language":"Phix"},{"code":"(de numToVlq (Num)\n (let Res (cons (& Num 127))\n (while (gt0 (setq Num (>> 7 Num)))\n (push 'Res (| 128 (& Num 127))) )\n Res ) )\n\n(de vlqToNum (Vlq)\n (let Res 0\n (for N Vlq\n (setq Res (| (>> -7 Res) (& N 127))) ) ) )\n\n(for Num (0 15 16 127 128 255 2097151 2097152)\n (let Vlq (numToVlq Num)\n (tab (12 12 12) Num (glue \":\" (mapcar hex Vlq)) (vlqToNum Vlq)) ) )\n","language":"PicoLisp"},{"code":"test: procedure options(main);\n declare s character (20) varying;\n declare c character (1);\n declare v fixed binary (31);\n declare (i, k) fixed binary;\n\n get edit (s) (L);\n s = trim (s);\n v = 0;\n do i = 1 to length(s);\n c = substr(s, i, 1);\n k = index('0123456789abcdef', c);\n if k > 0 then v = v*16 + k - 1;\n end;\n put skip data (s, v);\n\n /* Convert back to hex */\n declare hex character(16) initial ('0123456789abcdef');\n declare hs character (20) initial ('');\n declare d fixed binary;\n\n do i = length(hs) to 1 by -1 until (v = 0);\n d = mod(v, 16) + 1;\n substr(hs, i, 1) = substr(hex, d, 1);\n v = v/16;\n end;\n put skip list (hs);\nend test;\n","language":"PL-I"},{"code":"def tobits(n, _group=8, _sep='_', _pad=False):\n 'Express n as binary bits with separator'\n bits = '{0:b}'.format(n)[::-1]\n if _pad:\n bits = '{0:0{1}b}'.format(n,\n ((_group+len(bits)-1)//_group)*_group)[::-1]\n answer = _sep.join(bits[i:i+_group]\n for i in range(0, len(bits), _group))[::-1]\n answer = '0'*(len(_sep)-1) + answer\n else:\n answer = _sep.join(bits[i:i+_group]\n for i in range(0, len(bits), _group))[::-1]\n return answer\n\ndef tovlq(n):\n return tobits(n, _group=7, _sep='1_', _pad=True)\n\ndef toint(vlq):\n return int(''.join(vlq.split('_1')), 2)\n\ndef vlqsend(vlq):\n for i, byte in enumerate(vlq.split('_')[::-1]):\n print('Sent byte {0:3}: {1:#04x}'.format(i, int(byte,2)))\n","language":"Python"},{"code":">>> for n in (254, 255, 256, 257, -2+(1<<16), -1+(1<<16), 1<<16, 1+(1<<16), 0x200000, 0x1fffff ):\n print('int: %7i bin: %26s vlq: %35s vlq->int: %7i' % (n, tobits(n,_pad=True), tovlq(n), toint(tovlq(n))))\n\n\nint: 254 bin: 11111110 vlq: 00000001_11111110 vlq->int: 254\nint: 255 bin: 11111111 vlq: 00000001_11111111 vlq->int: 255\nint: 256 bin: 00000001_00000000 vlq: 00000010_10000000 vlq->int: 256\nint: 257 bin: 00000001_00000001 vlq: 00000010_10000001 vlq->int: 257\nint: 65534 bin: 11111111_11111110 vlq: 00000011_11111111_11111110 vlq->int: 65534\nint: 65535 bin: 11111111_11111111 vlq: 00000011_11111111_11111111 vlq->int: 65535\nint: 65536 bin: 00000001_00000000_00000000 vlq: 00000100_10000000_10000000 vlq->int: 65536\nint: 65537 bin: 00000001_00000000_00000001 vlq: 00000100_10000000_10000001 vlq->int: 65537\nint: 2097152 bin: 00100000_00000000_00000000 vlq: 00000001_10000000_10000000_10000000 vlq->int: 2097152\nint: 2097151 bin: 00011111_11111111_11111111 vlq: 01111111_11111111_11111111 vlq->int: 2097151\n>>> vlqsend(tovlq(0x200000))\nSent byte 0: 0x80\nSent byte 1: 0x80\nSent byte 2: 0x80\nSent byte 3: 0x01\n>>> vlqsend(tovlq(0x1fffff))\nSent byte 0: 0xff\nSent byte 1: 0xff\nSent byte 2: 0x7f\n>>>\n","language":"Python"},{"code":"#lang racket\n\n(define (try n)\n (printf \"Original number: ~s (0x~x)\\n\" n n)\n (define 4octets (integer->integer-bytes n 4 #f))\n (printf \"Octets: ~a (byte-string: ~s)\\n\"\n (string-join (map (λ(o) (~r o #:base 16))\n (bytes->list 4octets))\n \":\")\n 4octets)\n (define m (integer-bytes->integer 4octets #f))\n (printf \"Back to a number: ~s (~a)\\n\"\n m (if (= m n) \"OK\" \"BAD\")))\n\n(for-each try '(#x200000 #x1fffff))\n","language":"Racket"},{"code":"sub vlq_encode ($number is copy) {\n my @vlq = (127 +& $number).fmt(\"%02X\");\n $number +>= 7;\n while ($number) {\n @vlq.push: (128 +| (127 +& $number)).fmt(\"%02X\");\n $number +>= 7;\n }\n @vlq.reverse.join: ':';\n}\n\nsub vlq_decode ($string) {\n sum $string.split(':').reverse.map: {(:16($_) +& 127) +< (7 × $++)}\n}\n\n#test encoding and decoding\nfor (\n 0, 0xa, 123, 254, 255, 256,\n 257, 65534, 65535, 65536, 65537, 0x1fffff,\n 0x200000\n ) -> $testcase {\n printf \"%8s %12s %8s\\n\", $testcase,\n my $encoded = vlq_encode($testcase),\n vlq_decode($encoded);\n}\n","language":"Raku"},{"code":"/*REXX program displays (and also tests/verifies) some numbers as octets. */\nnums = x2d(200000) x2d(1fffff) 2097172 2097151\n#=words(nums)\nsay ' number hex octet original'\nsay '══════════ ══════════ ══════════ ══════════'\nok=1\n do j=1 for #; @.j= word(nums,j)\n onum.j=octet(@.j)\n orig.j= x2d( space(onum.j, 0) )\n w=10\n say center(@.j, w) center(d2x(@.j), w) center(onum.j, w) center(orig.j, w)\n if @.j\\==orig.j then ok=0\n end /*j*/\nsay\nif ok then say 'All ' # \" numbers are OK.\" /*all of the numbers are good. */\n else say \"Some numbers are not OK.\" /*some of the numbers are ¬good. */\nexit /*stick a fork in it, we're all done. */\n/*──────────────────────────────────────────────────────────────────────────────────────*/\noctet: procedure; parse arg z,$ /*obtain Z from the passed arguments.*/\n x=d2x(z) /*convert Z to a hexadecimal octet. */\n do j=length(x) by -2 to 1 /*process the \"little\" end first. */\n $= substr(x, j-1, 2, 0) $ /*pad odd hexadecimal characters with */\n end /*j*/ /* ··· a zero on the left. */\n return strip($)\n","language":"REXX"},{"code":"[0x200000, 0x1fffff].each do |i|\n # Encode i => BER\n ber = [i].pack(\"w\")\n hex = ber.unpack(\"C*\").collect {|c| \"%02x\" % c}.join(\":\")\n printf \"%s => %s\\n\", i, hex\n\n # Decode BER => j\n j = ber.unpack(\"w\").first\n i == j or fail \"BER not preserve integer\"\nend\n","language":"Ruby"},{"code":"object VlqCode {\n def encode(x:Long)={\n val result=scala.collection.mutable.Stack[Byte]()\n result push (x&0x7f).toByte\n var l = x >>> 7\n while(l>0){\n result push ((l&0x7f)|0x80).toByte\n l >>>= 7\n }\n result.toArray\n }\n\n def decode(a:Array[Byte])=a.foldLeft(0L)((r, b) => r<<7|b&0x7f)\n\n def toString(a:Array[Byte])=a map(\"%02x\".format(_)) mkString(\"[\", \", \", \"]\")\n\n def test(x:Long)={\n val enc=encode(x)\n println(\"0x%x => %s => 0x%x\".format(x, toString(enc), decode(enc)))\n }\n\n def main(args: Array[String]): Unit = {\n val xs=Seq(0, 0x7f, 0x80, 0x2000, 0x3fff, 0x4000, 0x1FFFFF, 0x200000, 0x8000000,\n 0xFFFFFFF, 0xFFFFFFFFL, 0x842FFFFFFFFL, 0x0FFFFFFFFFFFFFFFL)\n xs foreach test\n }\n}\n","language":"Scala"},{"code":"$ include \"seed7_05.s7i\";\n include \"bigint.s7i\";\n\nconst func string: toSequence (in var bigInteger: number) is func\n result\n var string: sequence is \"\";\n begin\n sequence := str(chr(ord(number mod 128_)));\n number >>:= 7;\n while number <> 0_ do\n sequence := str(chr(ord(number mod 128_) + 128)) & sequence;\n number >>:= 7;\n end while;\n end func;\n\nconst func bigInteger: fromSequence (in string: sequence) is func\n result\n var bigInteger: number is 0_;\n local\n var integer: index is 1;\n begin\n while ord(sequence[index]) >= 128 do\n number <<:= 7;\n number +:= bigInteger conv (ord(sequence[index]) - 128);\n incr(index);\n end while;\n number <<:= 7;\n number +:= bigInteger conv ord(sequence[index]);\n end func;\n\nconst proc: main is func\n local\n const array bigInteger: testValues is [] (\n 0_, 10_, 123_, 254_, 255_, 256_, 257_, 65534_, 65535_, 65536_, 65537_, 2097151_, 2097152_);\n var string: sequence is \"\";\n var bigInteger: testValue is 0_;\n var char: element is ' ';\n begin\n for testValue range testValues do\n sequence := toSequence(testValue);\n write(\"sequence from \" <& testValue <& \": [ \");\n for element range sequence do\n write(ord(element) radix 16 lpad0 2 <& \" \");\n end for;\n writeln(\"] back: \" <& fromSequence(sequence));\n end for;\n end func;\n","language":"Seed7"},{"code":"func vlq_encode(num) {\n var t = (0x7F & num)\n var str = t.chr\n while (num >>= 7) {\n t = (0x7F & num)\n str += chr(0x80 | t)\n }\n str.reverse\n}\n\nfunc vlq_decode(str) {\n var num = ''\n str.each_byte { |b|\n num += ('%07b' % (b & 0x7F))\n }\n Num(num, 2)\n}\n\nvar tests = [0, 0xa, 123, 254, 255, 256,\n 257, 65534, 65535, 65536, 65537, 0x1fffff,\n 0x200000]\n\ntests.each { |t|\n var vlq = vlq_encode(t)\n printf(\"%8s %12s %8s\\n\", t,\n vlq.bytes.join(':', { \"%02X\" % _ }), vlq_decode(vlq))\n}\n","language":"Sidef"},{"code":"package require Tcl 8.5\n\nproc vlqEncode number {\n if {$number < 0} {error \"negative not supported\"}\n while 1 {\n\tlappend digits [expr {$number & 0x7f}]\n\tif {[set number [expr {$number >> 7}]] == 0} break\n }\n set out [format %c [lindex $digits 0]]\n foreach digit [lrange $digits 1 end] {\n\tset out [format %c%s [expr {0x80+$digit}] $out]\n }\n return $out\n}\nproc vlqDecode chars {\n set n 0\n foreach c [split $chars \"\"] {\n\tscan $c %c c\n\tset n [expr {($n<<7) | ($c&0x7f)}]\n\tif {!($c&0x80)} break\n }\n return $n\n}\n","language":"Tcl"},{"code":"proc numtohex {num} {\n binary scan [string trimleft [binary format W $num] \\0] H* hexEncoded\n regsub -all \"..(?=.)\" $hexEncoded \"&:\"\n}\nproc strtohex {string} {\n binary scan $string H* hexEncoded\n regsub -all \"..(?=.)\" $hexEncoded \"&:\"\n}\nforeach testcase {\n 123\n 254 255 256 257\n 65534 65535 65536 65537\n 2097152 2097151\n 12345678901234566789\n} {\n set encoded [vlqEncode $testcase]\n binary scan $encoded H* hexEncoded\n regsub -all {..(?=.)} $hexEncoded &: hexEncoded\n set decoded [vlqDecode $encoded]\n puts \"$testcase ([numtohex $testcase]) ==>\\\n\t[strtohex $encoded] ([string length $encoded] bytes) ==>\\\n\t$decoded\"\n}\n","language":"Tcl"},{"code":"Module Module1\n\n Function ToVlq(v As ULong) As ULong\n Dim array(8) As Byte\n Dim buffer = ToVlqCollection(v).SkipWhile(Function(b) b = 0).Reverse().ToArray\n buffer.CopyTo(array, 0)\n Return BitConverter.ToUInt64(array, 0)\n End Function\n\n Function FromVlq(v As ULong) As ULong\n Dim collection = BitConverter.GetBytes(v).Reverse()\n Return FromVlqCollection(collection)\n End Function\n\n Iterator Function ToVlqCollection(v As ULong) As IEnumerable(Of Byte)\n If v > Math.Pow(2, 56) Then\n Throw New OverflowException(\"Integer exceeds max value.\")\n End If\n\n Dim index = 7\n Dim significantBitReached = False\n Dim mask = &H7FUL << (index * 7)\n While index >= 0\n Dim buffer = mask And v\n If buffer > 0 OrElse significantBitReached Then\n significantBitReached = True\n buffer >>= index * 7\n If index > 0 Then\n buffer = buffer Or &H80\n End If\n Yield buffer\n End If\n mask >>= 7\n index -= 1\n End While\n End Function\n\n Function FromVlqCollection(vlq As IEnumerable(Of Byte)) As ULong\n Dim v = 0UL\n Dim significantBitReached = False\n\n Using enumerator = vlq.GetEnumerator\n Dim index = 0\n While enumerator.MoveNext\n Dim buffer = enumerator.Current\n If buffer > 0 OrElse significantBitReached Then\n significantBitReached = True\n v <<= 7\n v = v Or (buffer And &H7FUL)\n End If\n\n index += 1\n If index = 8 OrElse (significantBitReached AndAlso (buffer And &H80) <> &H80) Then\n Exit While\n End If\n End While\n End Using\n\n Return v\n End Function\n\n Sub Main()\n Dim values = {&H7FUL << 7 * 7, &H80, &H2000, &H3FFF, &H4000, &H200000, &H1FFFFF}\n For Each original In values\n Console.WriteLine(\"Original: 0x{0:X}\", original)\n\n REM collection\n Dim seq = ToVlqCollection(original)\n Console.WriteLine(\"Sequence: 0x{0}\", seq.Select(Function(b) b.ToString(\"X2\")).Aggregate(Function(a, b) String.Concat(a, b)))\n\n Dim decoded = FromVlqCollection(seq)\n Console.WriteLine(\"Decoded: 0x{0:X}\", decoded)\n\n REM ints\n Dim encoded = ToVlq(original)\n Console.WriteLine(\"Encoded: 0x{0:X}\", encoded)\n\n decoded = FromVlq(encoded)\n Console.WriteLine(\"Decoded: 0x{0:X}\", decoded)\n\n Console.WriteLine()\n Next\n End Sub\n\nEnd Module\n","language":"Visual-Basic-.NET"},{"code":"import \"./fmt\" for Fmt, Conv\nimport \"./str\" for Str\n\nvar toOctets = Fn.new { |n|\n var s = Conv.itoa(n, 2)\n var le = s.count\n var r = le % 7\n var d = (le/7).floor\n if (r > 0) {\n d = d + 1\n s = Fmt.zfill(7 * d, s)\n }\n var chunks = Str.chunks(s, 7)\n var last = \"0\" + chunks[-1]\n s = chunks[0..-2].map { |ch| \"1\" + ch }.join() + last\n return Str.chunks(s, 8).map { |ch| Conv.atoi(ch, 2) }.toList\n}\n\nvar fromOctets = Fn.new { |octets|\n var s = \"\"\n for (oct in octets) {\n var bin = Conv.itoa(oct, 2)\n bin = Fmt.zfill(7, bin)\n s = s + bin[-7..-1]\n }\n return Conv.atoi(s, 2)\n}\n\nvar tests = [2097152, 2097151]\nfor (test in tests) {\n var octets = toOctets.call(test)\n var display = octets.map { |oct| \"Ox\" + Fmt.xz(2, oct) }.toList\n System.write(\"%(test) -> %(Fmt.v(\"s\", 4, display, 0, \" \", \"\")) -> \")\n System.print(fromOctets.call(octets))\n}\n","language":"Wren"},{"code":"func OctIn(Dev); \\Input from device value of sequence of octets\nint Dev, N, Oct;\n[N:= 0;\nrepeat Oct:= HexIn(Dev);\n N:= N<<7 + (Oct&$7F);\nuntil (Oct&$80) = 0;\nreturn N;\n];\n\nproc OctOut(Dev, Num, Lev); \\Output value to device as sequence of octets\nint Dev, Num, Lev, Rem;\n[Rem:= Num & $7F;\nNum:= Num >> 7;\nif Num # 0 then OctOut(Dev, Num, Lev+1);\nif Lev > 0 then Rem:= Rem + $80;\nSetHexDigits(2);\nHexOut(Dev, Rem);\nChOut(Dev, ^ );\n];\n\n\\Device 8 is a circular buffer that can be written and read back.\nint N;\n[for N:= 0 to $40_0000 do\n [OctOut(8, N, 0);\n if N # OctIn(8) then\n [Text(0, \"Error!\"); exit];\n ];\nOctOut(0, $1F_FFFF, 0); CrLf(0);\nOctOut(0, $20_0000, 0); CrLf(0);\nOctOut(0, $7F, 0); CrLf(0);\nOctOut(0, $4000, 0); CrLf(0);\nOctOut(0, 0, 0); CrLf(0);\nOctOut(0, $3F_FFFE, 0); CrLf(0);\nOctOut(0, $FFFF_FFFF, 0); CrLf(0);\n]\n","language":"XPL0"},{"code":"on DecToVLQ\n Ask \"Enter base 10 value:\" -- input dialog box\n if it is not empty then\n if it is a number then\n put it into theString\n if isWholeNumString(theString) is false then -- I think there is built in equivalent for this but I rolled my own!\n answer \"Only Whole Decimal Numbers Are Allowed!\"\n exit DecToVLQ\n end if\n if theString>4294967295 then\n answer \"This function fails with whole numbers over 4294967295!\"&cr\\\n & \"4294967295 is the maximum allowed value for 32bits (4 bytes)\"\n exit DecToVLQ\n end if\n if theString>268435455 then\n answer \"This function is not accurate with whole numbers over 268435455!\"&cr\\\n & \"268435455 is the maximum allowed value for 28bit (7bits per byte) MIDI delta-time VLQ\"\n end if\n put \"Original Whole Number=\"& theString & cr & \\\n \"Original Whole Number in Hex=\"& baseConvert(theString,10,16) & cr & \\ --- LC's built in baseConvert function\n \"Variable Length Quantity in Hex=\" & wholeNumToVLQ(theString) into fld \"Output\"\n else\n answer \"Only Whole Decimal Numbers Are Allowed!\"\n end if\n end if\nend DecToVLQ\n\nfunction wholeNumToVLQ theWholeNum\n -- baseConvert(number,originalBase,destinationBase) -- there is also bitwise operations in LC but I took the long road\n if theWholeNum < 127 then -- if it fits into a single 7bit byte value and theres no need to process it\n put baseConvert(theWholeNum,10,16) into VQLinHex\n if the number of chars in VQLinHex=1 then put \"0\" before VQLinHex\n return VQLinHex\n exit wholeNumToVLQ\n end if\n put baseConvert(theWholeNum,10,2) into theBits\n put number of chars in theBits into x\n put 0 into bitCounter\n put empty into the7bitBytes\n repeat\n if char x of theBits is not empty then\n put char x theBits before the7bitBytes\n delete char x of theBits\n if theBits is empty then exit repeat\n put number of chars in theBits into x\n add 1 to bitCounter\n if bitCounter=7 then\n put \",\" before the7bitBytes\n put 0 into bitCounter\n next repeat\n end if\n else\n exit repeat\n end if\n end repeat\n get the number of chars in item 1 of the7bitBytes\n if it<7 then\n put 7 - it into x\n repeat x\n put \"0\" before item 1 of the7bitBytes\n end repeat\n end if\n put the number of items in the7bitBytes into y\n repeat with x = 1 to y\n if x is not y then\n put \"1\" before item x of the7bitBytes\n else\n put \"0\" before item x of the7bitBytes\n end if\n put baseConvert(item x of the7bitBytes,2,16) into item x of the7bitBytes\n if the number of chars in item x of the7bitBytes<2 then put \"0\" before item x of the7bitBytes\n put item x of the7bitBytes after VQLinHex\n end repeat\n return VQLinHex\nend wholeNumToVLQ\n\nfunction isWholeNumString theString\n put the number of chars in theString into y\n repeat with x = 1 to y\n if char x of theString is not in \"0123456789\" then\n return false\n exit isWholeNumString\n end if\n end repeat\n return true\nend isWholeNumString\n","language":"XTalk"},{"code":"function VLQtoWholeNum theHexVLQ\n -- The number must be an integer between zero and 4,294,967,295\n put baseConvert(theHexVLQ,16,2) into theBits\n put 0 into bitCounter\n put empty into the8bitBytes\n repeat\n if char 1 of theBits is not empty then\n put char 1 theBits after the8bitBytes\n delete char 1 of theBits\n if theBits is empty then exit repeat\n add 1 to bitCounter\n if bitCounter=8 then\n put \",\" after the8bitBytes\n put 0 into bitCounter\n next repeat\n end if\n else\n exit repeat\n end if\n end repeat\n put the number of items in the8bitBytes into y\n repeat with x = 1 to y\n put char 1 of item x of the8bitBytes into lengthCntrlBit\n delete char 1 of item x of the8bitBytes\n if the number of chars in item x of the8bitBytes < 7 then\n repeat 7 - (the number of chars in item x of the8bitBytes)\n put \"0\" before item x of the8bitBytes\n end repeat\n end if\n put item x of the8bitBytes after WholeNumInBinary\n switch lengthCntrlBit\n case \"1\"\n next repeat\n break\n case \"0\"\n exit repeat\n break\n end switch\n end repeat\n return baseConvert(WholeNumInBinary,2,10)\nend VLQtoWholeNum\n\nfunction isHexString theString\n ---again there is probably an easier way to do this:\n if char 1 to 2 of theString is \"0x\" then delete char 1 to 2 of theString\n put the number of chars in theString into y\n repeat with x = 1 to y\n if char x of theString is not in \"abcdefABCDEF0123456789\" then\n return false\n end if\n end repeat\nend isHexString\n\non VLQHexToWholeNum\n Ask \"Enter Variable Length Quantity Hex Value:\" -- input dialog\n if it is not empty then\n if char 1 to 2 of it is \"0x\" then delete char 1 to 2 of it\n put it into hexString\n if isHexString(hexString) is false then\n answer \"Only Valid Hex Digits Are Allowed!\"\n exit VLQHexToWholeNum\n else\n put \"Original Variable Length Quantity in Hex=\"& hexString & cr & \\\n \"Whole Number=\" & VLQtoWholeNum(hexString) into fld \"Output\"\n end if\n end if\nend VLQHexToWholeNum\n","language":"XTalk"},{"code":"fcn to_seq(x){ //--> list of ints\n z:=(x.log2()/7);\n (0).pump(z+1,List,'wrap(j){\n x.shiftRight((z-j)*7).bitAnd(0x7f).bitOr((j!=z) and 0x80 or 0)\n });\n}\n\nfcn from_seq(in){ in.reduce(fcn(p,n){ p.shiftLeft(7).bitOr(n.bitAnd(0x7f)) },0) }\n","language":"Zkl"},{"code":"ns:=T(0x7f, 0x4000, 0, 0x3ffffe, 0x1fffff, 0x200000, 0x3311a1234df31413);\nms:=ns.apply(to_seq);\nns.zipWith(fcn{\"%8,x --> %s --> %,x\".fmt(vm.arglist.xplode()).println()},\n ms.apply(\"apply\",\"%,x\".fmt),\n ms.apply(from_seq));\n","language":"Zkl"}],"string":"[\n {\n \"code\": \"---\\nfrom: http://rosettacode.org/wiki/Variable-length_quantity\\nnote: Data Structures\\n\",\n \"language\": \"00-META\"\n },\n {\n \"code\": \"Implement some operations on [[wp:Variable-length quantity|variable-length quantities]], at least including conversions from a normal number in the language to the binary representation of the variable-length quantity for that number, and ''vice versa''. Any variants are acceptable.\\n\\n\\n;Task:\\nWith above operations, \\n*convert these two numbers 0x200000 (2097152 in decimal) and 0x1fffff (2097151 in decimal) into sequences of octets (an eight-bit byte); \\n*display these sequences of octets;\\n*convert these sequences of octets back to numbers, and check that they are equal to original numbers.\\n<br><br>\\n\\n\",\n \"language\": \"00-TASK\"\n },\n {\n \"code\": \"F to_str(v)\\n R ‘[ ’v.map(n -> hex(n).lowercase().zfill(2)).join(‘ ’)‘ ]’\\n\\nF to_seq(UInt64 x)\\n V i = 0\\n L(ii) (9.<0).step(-1)\\n I x [&] (UInt64(127) << ii * 7) != 0\\n i = ii\\n L.break\\n\\n [Byte] out\\n L(j) 0 .. i\\n out [+]= ((x >> ((i - j) * 7)) [&] 127) [|] 128\\n\\n out[i] (+)= 128\\n R out\\n\\nF from_seq(seq)\\n UInt64 r = 0\\n\\n L(b) seq\\n r = (r << 7) [|] (b [&] 127)\\n\\n R r\\n\\nL(x) [UInt64(7'F), 40'00, 0, 003F'FFFE, 001F'FFFF, 0020'0000, 3311'A123'4DF3'1413]\\n V s = to_seq(x)\\n print(‘seq from ’hex(x).lowercase()‘ ’to_str(s)‘ back: ’hex(from_seq(s)).lowercase())\\n\",\n \"language\": \"11l\"\n },\n {\n \"code\": \"with Ada.Containers.Vectors;\\nwith Ada.Text_IO;\\nwith Ada.Unchecked_Conversion;\\n\\nprocedure VLQ is\\n\\n package Nat_IO is new Ada.Text_IO.Integer_IO (Natural);\\n\\n type Byte is mod 2**8;\\n\\n package Byte_IO is new Ada.Text_IO.Modular_IO (Byte);\\n\\n type Int7 is mod 2**7;\\n\\n package Int7_IO is new Ada.Text_IO.Modular_IO (Int7);\\n\\n type VLQ_Octet is record\\n Value : Int7 := 0;\\n Next : Boolean := True;\\n end record;\\n pragma Pack (VLQ_Octet);\\n for VLQ_Octet'Size use 8;\\n\\n function VLQ_To_Byte is new Ada.Unchecked_Conversion (VLQ_Octet, Byte);\\n function Byte_To_VLQ is new Ada.Unchecked_Conversion (Byte, VLQ_Octet);\\n\\n package VLQ_Vectors is new Ada.Containers.Vectors (Natural, VLQ_Octet);\\n\\n procedure Hex_Print (Position : in VLQ_Vectors.Cursor) is\\n Value : Byte := VLQ_To_Byte (VLQ_Vectors.Element (Position));\\n begin\\n Ada.Text_IO.Put (':');\\n Byte_IO.Put (Item => Value, Width => 6, Base => 16);\\n end Hex_Print;\\n\\n procedure Print (X : VLQ_Vectors.Vector) is\\n begin\\n X.Iterate (Hex_Print'Access);\\n Ada.Text_IO.New_Line;\\n end Print;\\n\\n function To_VLQ (From : Natural) return VLQ_Vectors.Vector is\\n Result : VLQ_Vectors.Vector;\\n Current : Natural := From;\\n Element : VLQ_Octet;\\n begin\\n loop\\n Element.Value := Int7 (Current mod 2**7);\\n Result.Prepend (Element);\\n Current := Current / 2**7;\\n exit when Current = 0;\\n end loop;\\n Element := Result.Last_Element;\\n Element.Next := False;\\n VLQ_Vectors.Replace_Element (Result, Result.Last, Element);\\n return Result;\\n end To_VLQ;\\n\\n function To_Int (From : VLQ_Vectors.Vector) return Natural is\\n use type VLQ_Vectors.Cursor;\\n Result : Natural := 0;\\n Iterator : VLQ_Vectors.Cursor := From.First;\\n begin\\n while Iterator /= VLQ_Vectors.No_Element loop\\n Result := Result * 2**7;\\n Result := Result + Natural(VLQ_Vectors.Element (Iterator).Value);\\n VLQ_Vectors.Next (Iterator);\\n end loop;\\n return Result;\\n end To_Int;\\n\\n Test : VLQ_Vectors.Vector;\\nbegin\\n Test := To_VLQ (16#7f#);\\n Nat_IO.Put (To_Int (Test), 10, 16); Ada.Text_IO.Put (\\\" = \\\");\\n Print (Test);\\n Test := To_VLQ (16#4000#);\\n Nat_IO.Put (To_Int (Test), 10, 16); Ada.Text_IO.Put (\\\" = \\\");\\n Print (Test);\\n Test := To_VLQ (16#0#);\\n Nat_IO.Put (To_Int (Test), 10, 16); Ada.Text_IO.Put (\\\" = \\\");\\n Print (Test);\\n Test := To_VLQ (16#3FFFFE#);\\n Nat_IO.Put (To_Int (Test), 10, 16); Ada.Text_IO.Put (\\\" = \\\");\\n Print (Test);\\n Test := To_VLQ (16#1FFFFF#);\\n Nat_IO.Put (To_Int (Test), 10, 16); Ada.Text_IO.Put (\\\" = \\\");\\n Print (Test);\\n Test := To_VLQ (16#200000#);\\n Nat_IO.Put (To_Int (Test), 10, 16); Ada.Text_IO.Put (\\\" = \\\");\\n Print (Test);\\nend VLQ;\\n\",\n \"language\": \"Ada\"\n },\n {\n \"code\": \"INPUT s$\\nLET s$ = LTRIM$(RTRIM$(s$))\\nLET v = 0\\nFOR i = 1 TO LEN(s$)\\n LET c$ = s$(i:i)\\n LET k = POS(\\\"0123456789abcdef\\\", c$)\\n IF k > 0 THEN LET v = v*16 + k - 1\\nNEXT i\\nPRINT \\\"S= \\\";s$, \\\"V=\\\";v\\n\\n! Convert back to hex\\nLET hex$ =\\\"0123456789abcdef\\\"\\nLET hs$=\\\" \\\"\\n\\nFOR i = LEN(hs$) TO 1 STEP -1\\n IF v = 0 THEN EXIT FOR\\n LET d = MOD(v, 16) + 1\\n LET hs$(i:i) = hex$(d:d)\\n LET v = INT(v/16)\\nNEXT i\\nPRINT hs$\\nEND\\n\",\n \"language\": \"ANSI-BASIC\"\n },\n {\n \"code\": \"( ( VLQ\\n = b07 b8 vlq\\n . 0:?b8\\n & :?vlq\\n & whl\\n ' ( !arg:>0\\n & mod$(!arg.128):?b07\\n & (chr$(!b8+!b07)|) !vlq:?vlq\\n & 128:?b8\\n & div$(!arg.128):?arg\\n )\\n & str$!vlq\\n )\\n& ( NUM\\n = c num d\\n . 0:?num:?d\\n & whl\\n ' ( @(!arg:%@?c ?arg)\\n & asc$!c:?c:~<128\\n & 128*(!c+-128+!num):?num\\n & 1+!d:?d\\n )\\n & (!c:<128&!c+!num:?num|)\\n & !num\\n )\\n& ( printVLQ\\n = c h\\n . :?h\\n & whl\\n ' ( @(!arg:%@?c ?arg)\\n & d2x$(asc$!c):?x\\n & !h (@(!x:? [1)&0|) !x\\n : ?h\\n )\\n & ( asc$!c:~<128&!h 00:?h\\n |\\n )\\n & out$(\\\"VLQ :\\\" str$!h)\\n )\\n& ( test\\n = vlq num\\n . out$(\\\"input:\\\" !arg)\\n & VLQ$(x2d$!arg):?vlq\\n & printVLQ$!vlq\\n & NUM$!vlq:?num\\n & out$(\\\"back :\\\" d2x$!num \\\\n)\\n )\\n& test$200000\\n& test$1fffff\\n& test$00\\n& test$7f\\n& test$80\\n& test$81\\n& test$82\\n& test$894E410E0A\\n);\\n\",\n \"language\": \"Bracmat\"\n },\n {\n \"code\": \"#include <stdio.h>\\n#include <stdint.h>\\n\\nvoid to_seq(uint64_t x, uint8_t *out)\\n{\\n\\tint i, j;\\n\\tfor (i = 9; i > 0; i--) {\\n\\t\\tif (x & 127ULL << i * 7) break;\\n\\t}\\n\\tfor (j = 0; j <= i; j++)\\n\\t\\tout[j] = ((x >> ((i - j) * 7)) & 127) | 128;\\n\\n\\tout[i] ^= 128;\\n}\\n\\nuint64_t from_seq(uint8_t *in)\\n{\\n\\tuint64_t r = 0;\\n\\n\\tdo {\\n\\t\\tr = (r << 7) | (uint64_t)(*in & 127);\\n\\t} while (*in++ & 128);\\n\\n\\treturn r;\\n}\\n\\nint main()\\n{\\n\\tuint8_t s[10];\\n\\tuint64_t x[] = { 0x7f, 0x4000, 0, 0x3ffffe, 0x1fffff, 0x200000, 0x3311a1234df31413ULL};\\n\\n\\tint i, j;\\n\\tfor (j = 0; j < sizeof(x)/8; j++) {\\n\\t\\tto_seq(x[j], s);\\n\\t\\tprintf(\\\"seq from %llx: [ \\\", x[j]);\\n\\n\\t\\ti = 0;\\n\\t\\tdo { printf(\\\"%02x \\\", s[i]); } while ((s[i++] & 128));\\n\\t\\tprintf(\\\"] back: %llx\\\\n\\\", from_seq(s));\\n\\t}\\n\\n\\treturn 0;\\n}\\n\",\n \"language\": \"C\"\n },\n {\n \"code\": \"seq from 7f: [ 7f ] back: 7f\\nseq from 4000: [ 81 80 00 ] back: 4000\\nseq from 0: [ 00 ] back: 0\\nseq from 3ffffe: [ 81 ff ff 7e ] back: 3ffffe\\nseq from 1fffff: [ ff ff 7f ] back: 1fffff\\nseq from 200000: [ 81 80 80 00 ] back: 200000\\nseq from 3311a1234df31413: [ b3 88 e8 a4 b4 ef cc a8 13 ] back: 3311a1234df31413\\n\",\n \"language\": \"C\"\n },\n {\n \"code\": \"#include <iomanip>\\n#include <iostream>\\n#include <vector>\\n\\nstd::ostream &operator<<(std::ostream &os, const std::vector<uint8_t> &v) {\\n auto it = v.cbegin();\\n auto end = v.cend();\\n\\n os << \\\"[ \\\";\\n if (it != end) {\\n os << std::setfill('0') << std::setw(2) << (uint32_t)*it;\\n it = std::next(it);\\n }\\n while (it != end) {\\n os << ' ' << std::setfill('0') << std::setw(2) << (uint32_t)*it;\\n it = std::next(it);\\n }\\n return os << \\\" ]\\\";\\n}\\n\\nstd::vector<uint8_t> to_seq(uint64_t x) {\\n int i;\\n for (i = 9; i > 0; i--) {\\n if (x & 127ULL << i * 7) {\\n break;\\n }\\n }\\n\\n std::vector<uint8_t> out;\\n for (int j = 0; j <= i; j++) {\\n out.push_back(((x >> ((i - j) * 7)) & 127) | 128);\\n }\\n out[i] ^= 128;\\n return out;\\n}\\n\\nuint64_t from_seq(const std::vector<uint8_t> &seq) {\\n uint64_t r = 0;\\n\\n for (auto b : seq) {\\n r = (r << 7) | (b & 127);\\n }\\n\\n return r;\\n}\\n\\nint main() {\\n std::vector<uint64_t> src{ 0x7f, 0x4000, 0, 0x3ffffe, 0x1fffff, 0x200000, 0x3311a1234df31413ULL };\\n\\n for (auto x : src) {\\n auto s = to_seq(x);\\n std::cout << std::hex;\\n std::cout << \\\"seq from \\\" << x << ' ' << s << \\\" back: \\\" << from_seq(s) << '\\\\n';\\n std::cout << std::dec;\\n }\\n\\n return 0;\\n}\\n\",\n \"language\": \"C++\"\n },\n {\n \"code\": \"namespace Vlq\\n{\\n using System;\\n using System.Collections.Generic;\\n using System.Linq;\\n\\n public static class VarLenQuantity\\n {\\n public static ulong ToVlq(ulong integer)\\n {\\n var array = new byte[8];\\n var buffer = ToVlqCollection(integer)\\n .SkipWhile(b => b == 0)\\n .Reverse()\\n .ToArray();\\n Array.Copy(buffer, array, buffer.Length);\\n return BitConverter.ToUInt64(array, 0);\\n }\\n\\n public static ulong FromVlq(ulong integer)\\n {\\n var collection = BitConverter.GetBytes(integer).Reverse();\\n return FromVlqCollection(collection);\\n }\\n\\n public static IEnumerable<byte> ToVlqCollection(ulong integer)\\n {\\n if (integer > Math.Pow(2, 56))\\n throw new OverflowException(\\\"Integer exceeds max value.\\\");\\n\\n var index = 7;\\n var significantBitReached = false;\\n var mask = 0x7fUL << (index * 7);\\n while (index >= 0)\\n {\\n var buffer = (mask & integer);\\n if (buffer > 0 || significantBitReached)\\n {\\n significantBitReached = true;\\n buffer >>= index * 7;\\n if (index > 0)\\n buffer |= 0x80;\\n yield return (byte)buffer;\\n }\\n mask >>= 7;\\n index--;\\n }\\n }\\n\\n\\n public static ulong FromVlqCollection(IEnumerable<byte> vlq)\\n {\\n ulong integer = 0;\\n var significantBitReached = false;\\n\\n using (var enumerator = vlq.GetEnumerator())\\n {\\n int index = 0;\\n while (enumerator.MoveNext())\\n {\\n var buffer = enumerator.Current;\\n if (buffer > 0 || significantBitReached)\\n {\\n significantBitReached = true;\\n integer <<= 7;\\n integer |= (buffer & 0x7fUL);\\n }\\n\\n if (++index == 8 || (significantBitReached && (buffer & 0x80) != 0x80))\\n break;\\n }\\n }\\n return integer;\\n }\\n\\n public static void Main()\\n {\\n var integers = new ulong[] { 0x7fUL << 7 * 7, 0x80, 0x2000, 0x3FFF, 0x4000, 0x200000, 0x1fffff };\\n\\n foreach (var original in integers)\\n {\\n Console.WriteLine(\\\"Original: 0x{0:X}\\\", original);\\n\\n //collection\\n var seq = ToVlqCollection(original);\\n Console.WriteLine(\\\"Sequence: 0x{0}\\\", seq.Select(b => b.ToString(\\\"X2\\\")).Aggregate(string.Concat));\\n\\n var decoded = FromVlqCollection(seq);\\n Console.WriteLine(\\\"Decoded: 0x{0:X}\\\", decoded);\\n\\n //ints\\n var encoded = ToVlq(original);\\n Console.WriteLine(\\\"Encoded: 0x{0:X}\\\", encoded);\\n\\n decoded = FromVlq(encoded);\\n Console.WriteLine(\\\"Decoded: 0x{0:X}\\\", decoded);\\n\\n Console.WriteLine();\\n }\\n Console.WriteLine(\\\"Press any key to continue...\\\");\\n Console.ReadKey();\\n }\\n }\\n}\\n\",\n \"language\": \"C-sharp\"\n },\n {\n \"code\": \"Original: 0xFE000000000000\\nSequence: 0xFF80808080808000\\nDecoded: 0xFE000000000000\\nEncoded: 0xFF80808080808000\\nDecoded: 0xFE000000000000\\n\\nOriginal: 0x80\\nSequence: 0x8100\\nDecoded: 0x80\\nEncoded: 0x8100\\nDecoded: 0x80\\n\\nOriginal: 0x2000\\nSequence: 0xC000\\nDecoded: 0x2000\\nEncoded: 0xC000\\nDecoded: 0x2000\\n\\nOriginal: 0x3FFF\\nSequence: 0xFF7F\\nDecoded: 0x3FFF\\nEncoded: 0xFF7F\\nDecoded: 0x3FFF\\n\\nOriginal: 0x4000\\nSequence: 0x818000\\nDecoded: 0x4000\\nEncoded: 0x818000\\nDecoded: 0x4000\\n\\nOriginal: 0x200000\\nSequence: 0x81808000\\nDecoded: 0x200000\\nEncoded: 0x81808000\\nDecoded: 0x200000\\n\\nOriginal: 0x1FFFFF\\nSequence: 0xFFFF7F\\nDecoded: 0x1FFFFF\\nEncoded: 0xFFFF7F\\nDecoded: 0x1FFFFF\\n\\nPress any key to continue...\\n\",\n \"language\": \"C-sharp\"\n },\n {\n \"code\": \"include \\\"cowgol.coh\\\";\\n\\nsub VLQEncode(number: uint32, buf: [uint8]) is\\n var step := number;\\n while step > 0 loop\\n step := step >> 7;\\n buf := @next buf;\\n end loop;\\n\\n var mark: uint8 := 0;\\n while number > 0 loop\\n buf := @prev buf;\\n [buf] := mark | (number as uint8 & 0x7F);\\n mark := 0x80;\\n number := number >> 7;\\n end loop;\\nend sub;\\n\\nsub VLQDecode(buf: [uint8]): (result: uint32) is\\n result := 0;\\n loop\\n var byte := [buf];\\n buf := @next buf;\\n result := (result << 7) | (byte & 0x7F) as uint32;\\n\\n if byte & 0x80 == 0 then\\n return;\\n end if;\\n end loop;\\nend sub;\\n\\nsub VLQPrint(buf: [uint8]) is\\n loop\\n print_hex_i8([buf]);\\n if [buf] & 0x80 == 0 then\\n break;\\n end if;\\n buf := @next buf;\\n end loop;\\nend sub;\\n\\nsub VLQTest(value: uint32) is\\n var buf: uint8[8];\\n\\n print(\\\"Input: \\\");\\n print_hex_i32(value);\\n print_nl();\\n\\n print(\\\"Encoded: \\\");\\n VLQEncode(value, &buf[0]);\\n VLQPrint(&buf[0]);\\n print_nl();\\n\\n print(\\\"Decoded: \\\");\\n value := VLQDecode(&buf[0]);\\n print_hex_i32(value);\\n print_nl();\\nend sub;\\n\\nVLQTest(0x200000);\\nprint_nl();\\nVLQTest(0x1FFFFF);\\nprint_nl();\\n\",\n \"language\": \"Cowgol\"\n },\n {\n \"code\": \"import std.stdio, std.string, std.file, std.algorithm;\\n\\n/// Variable length quantity (unsigned long, max 63-bit).\\nstruct VLQ {\\n ulong value;\\n\\n // This allows VLQ to work like an ulong.\\n alias value this;\\n\\n uint extract(in ubyte[] v) pure\\n in {\\n assert(v.length > 0);\\n } body {\\n immutable limit = min(v.length - 1, 8);\\n ulong t = 0;\\n size_t idx = 0;\\n while ((idx < limit) && ((v[idx] & 0x80) > 0))\\n t = (t << 7) | (0x7f & v[idx++]);\\n if (idx > limit)\\n throw new Exception(\\n \\\"Too large for ulong or invalid format.\\\");\\n else\\n value = (t << 7) | v[idx];\\n return idx + 1;\\n }\\n\\n VLQ from(in ubyte[] v) pure {\\n extract(v);\\n return this;\\n }\\n\\n @property ubyte[] toVLQ() const pure {\\n ubyte[] v = [0x7f & value];\\n for (ulong k = value >>> 7; k > 0; k >>>= 7)\\n v ~= (k & 0x7f) | 0x80;\\n if (v.length > 9)\\n throw new Exception(\\\"Too large value.\\\");\\n v.reverse();\\n return v;\\n }\\n\\n static ulong[] split(in ubyte[] b) pure {\\n ulong[] res;\\n VLQ v;\\n for (size_t i = 0; i < b.length; ) {\\n i += v.extract(b[i .. $]);\\n res ~= v.value;\\n }\\n return res;\\n }\\n\\n string toString() const pure /*nothrow*/ {\\n return format(\\\"(%(%02X:%))\\\", this.toVLQ);\\n }\\n}\\n\\n\\nvoid main() { // VLQ demo code.\\n VLQ a = VLQ(0x7f),\\n b = VLQ(0x4000),\\n c;\\n writefln(\\\"a:%8x = %s\\\\nb:%8x = %s\\\\nc:%8x = %s\\\",\\n a.value, a, b.value, b, c.value, c);\\n\\n // Some operations.\\n c = (a + 1) * b;\\n a = c - 1;\\n b = VLQ().from(a.toVLQ);\\n a <<= 1;\\n\\n // Convert ulong to octet sequence.\\n writefln(\\\"\\\\na:%8x = %s\\\\nb:%8x = %s\\\\nc:%8x = %s\\\",\\n a.value, a, b.value, b, c.value, c);\\n\\n // Write them to a binary file.\\n std.file.write(\\\"vlqtest.bin\\\", a.toVLQ ~ b.toVLQ ~ c.toVLQ);\\n\\n // Read them back.\\n const buf = cast(ubyte[])std.file.read(\\\"vlqtest.bin\\\");\\n writefln(\\\"\\\\nFile length: %d bytes.\\\", buf.length);\\n\\n // Convert octet sequence to ulongs.\\n foreach (immutable i, immutable v; VLQ.split(buf))\\n writefln(\\\"%d:%8x = %s\\\", i + 1, v, VLQ(v));\\n}\\n\",\n \"language\": \"D\"\n },\n {\n \"code\": \"function NumberToVLQ(Num: int64): string;\\n{Convert Num to Variable-Length Quantity VLQ Octets (bytes)}\\n{Octet = 7-bit data and MSB indicating the last data item = 0 }\\n{Note: String are being used as byte-array because they are easy}\\nvar I: integer;\\nvar T: byte;\\nvar BA: string;\\nbegin\\nResult:='';\\nBA:='';\\n{Get array of octets}\\nwhile Num>0 do\\n\\tbegin\\n\\tBA:=BA+char($7F and Num);\\n\\tNum:=Num shr 7;\\n\\tend;\\n{Reverse data and flag more data is coming}\\nResult:='';\\nfor I:=Length(BA) downto 1 do\\n\\tbegin\\n\\tT:=Byte(BA[I]);\\n\\tif I<>1 then T:=T or $80;\\n\\tResult:=Result+char(T);\\n\\tend;\\nend;\\n\\n\\nfunction VLQToNumber(VLQ: string): int64;\\n{Convert Variable-Length Quantity VLQ Octets (bytes) to numbers}\\n{Octet = 7-bit data and MSB indicating the last data item = 0 }\\n{Note: String are being used as byte-array because they are easy}\\nvar I: integer;\\nvar T: byte;\\nvar BA: string;\\nbegin\\nResult:=0;\\nfor I:=1 to Length(VLQ) do\\nResult:=(Result shl 7) or (Byte(VLQ[I]) and $7F);\\nend;\\n\\n\\n\\nfunction VLQToString(VLQ: string): string;\\n{Convert VLQ to string of hex numbers}\\nvar I: integer;\\nbegin\\nResult:='(';\\nfor I:=1 to Length(VLQ) do\\n\\tbegin\\n\\tif I>1 then Result:=Result+', ';\\n\\tResult:=Result+IntToHex(byte(VLQ[I]),2);\\n\\tend;\\nResult:=Result+')';\\nend;\\n\\n\\n\\nprocedure ShowVLQ(Memo: TMemo; Num: int64);\\nvar VLQ: string;\\nvar I: int64;\\nvar S: string;\\nbegin\\nVLQ:=NumberToVLQ(Num);\\nS:=VLQToString(VLQ);\\nI:=VLQToNumber(VLQ);\\nMemo.Lines.Add('Original Number: '+Format('%x',[Num]));\\nMemo.Lines.Add('Converted to VLQ: '+Format('%s',[S]));\\nMemo.Lines.Add('Back to Original: '+Format('%x',[I]));\\nMemo.Lines.Add('');\\nend;\\n\\nconst Num1 = $0;\\nconst Num2 = $7F;\\nconst Num3 = $4000;\\nconst Num4 = $1FFFFF;\\nconst Num5 = $200000;\\nconst Num6 = $3FFFFE;\\nconst Num7 = $3311A1234DF31413;\\n\\n\\n\\nprocedure VariableLengthOctets(Memo: TMemo);\\nbegin\\nShowVLQ(Memo, Num1);\\nShowVLQ(Memo, Num2);\\nShowVLQ(Memo, Num3);\\nShowVLQ(Memo, Num4);\\nShowVLQ(Memo, Num5);\\nShowVLQ(Memo, Num6);\\nShowVLQ(Memo, Num7);\\nend;\\n\",\n \"language\": \"Delphi\"\n },\n {\n \"code\": \"function vlq_encode(integer n)\\n sequence s\\n s = {}\\n while n > 0 do\\n s = prepend(s, #80 * (length(s) > 0) + and_bits(n, #7F))\\n n = floor(n / #80)\\n end while\\n if length(s) = 0 then\\n s = {0}\\n end if\\n return s\\nend function\\n\\nfunction vlq_decode(sequence s)\\n integer n\\n n = 0\\n for i = 1 to length(s) do\\n n *= #80\\n n += and_bits(s[i], #7F)\\n if not and_bits(s[i], #80) then\\n exit\\n end if\\n end for\\n return n\\nend function\\n\\nfunction svlg(sequence s)\\n sequence out\\n out = \\\"\\\"\\n for i = 1 to length(s) do\\n out &= sprintf(\\\"#%02x:\\\", {s[i]})\\n end for\\n return out[1..$-1]\\nend function\\n\\nconstant testNumbers = { #200000, #1FFFFF, 1, 127, 128 }\\nsequence s\\nfor i = 1 to length(testNumbers) do\\n s = vlq_encode(testNumbers[i])\\n printf(1, \\\"#%02x -> %s -> #%02x\\\\n\\\", {testNumbers[i], svlg(s), vlq_decode(s)})\\nend for\\n\",\n \"language\": \"Euphoria\"\n },\n {\n \"code\": \"Sub toOctets(n As Integer, octets() As Integer)\\n Dim As String s = Bin(n)\\n Dim As Integer le = Len(s)\\n Dim As Integer r = le Mod 7\\n Dim As Integer d = le \\\\ 7\\n If (r > 0) Then\\n d += 1\\n s = Right(\\\"0000000\\\" & s, 7 * d)\\n End If\\n For i As Integer = 0 To d - 2\\n Redim Preserve octets(i+1) As Integer\\n octets(i) = Val(\\\"&B1\\\" & Mid(s, i * 7 + 1, 7))\\n Next i\\n octets(d - 1) = Val(\\\"&B0\\\" & Mid(s, (d - 1) * 7 + 1, 7))\\nEnd Sub\\n\\nFunction fromOctets(octets() As Integer) As Integer\\n Dim As String s = \\\"\\\"\\n For i As Integer = 0 To Ubound(octets)\\n s &= Right(\\\"0000000\\\" & Bin(octets(i)), 7)\\n Next i\\n Return Val(\\\"&B\\\" & s)\\nEnd Function\\n\\nDim As Integer tests(1) = {2097152, 2097151}\\nDim As Integer i\\nFor i = 0 To Ubound(tests)\\n Dim As Integer octets()\\n toOctets(tests(i), octets())\\n Dim As String display = \\\"\\\"\\n For j As Integer = 0 To Ubound(octets)\\n display &= \\\"0x\\\" & Hex(octets(j), 2) & \\\" \\\"\\n Next j\\n Print tests(i); \\\" -> \\\"; display; \\\"-> \\\"; fromOctets(octets())\\nNext i\\n\\nSleep\\n\",\n \"language\": \"FreeBASIC\"\n },\n {\n \"code\": \"package main\\n\\nimport (\\n \\\"fmt\\\"\\n \\\"encoding/binary\\\"\\n)\\n\\nfunc main() {\\n buf := make([]byte, binary.MaxVarintLen64)\\n for _, x := range []int64{0x200000, 0x1fffff} {\\n v := buf[:binary.PutVarint(buf, x)]\\n fmt.Printf(\\\"%d encodes into %d bytes: %x\\\\n\\\", x, len(v), v)\\n x, _ = binary.Varint(v)\\n fmt.Println(x, \\\"decoded\\\")\\n }\\n}\\n\",\n \"language\": \"Go\"\n },\n {\n \"code\": \"final RADIX = 7\\nfinal MASK = 2**RADIX - 1\\n\\ndef octetify = { n ->\\n def octets = []\\n for (def i = n; i != 0; i >>>= RADIX) {\\n octets << ((byte)((i & MASK) + (octets.empty ? 0 : MASK + 1)))\\n }\\n octets.reverse()\\n}\\n\\ndef deoctetify = { octets ->\\n octets.inject(0) { long n, octet ->\\n (n << RADIX) + ((int)(octet) & MASK)\\n }\\n}\\n\",\n \"language\": \"Groovy\"\n },\n {\n \"code\": \"def testNumbers = [ 0x200000, 0x1fffff, 1, 127, 128, 589723405834L ]\\n\\ntestNumbers.each { a ->\\n def octets = octetify(a)\\n octets.each { printf \\\"0x%02x \\\", it }; println ()\\n def a1 = deoctetify(octets)\\n assert a1 == a\\n}\\n\",\n \"language\": \"Groovy\"\n },\n {\n \"code\": \"import Numeric (readOct, showOct)\\nimport Data.List (intercalate)\\n\\nto :: Int -> String\\nto = flip showOct \\\"\\\"\\n\\nfrom :: String -> Int\\nfrom = fst . head . readOct\\n\\nmain :: IO ()\\nmain =\\n mapM_\\n (putStrLn .\\n intercalate \\\" <-> \\\" . (pure (:) <*> to <*> (return . show . from . to)))\\n [2097152, 2097151]\\n\",\n \"language\": \"Haskell\"\n },\n {\n \"code\": \"import Data.List (intercalate)\\n\\nto :: Int -> Int -> [Int]\\nto _ 0 = []\\nto base i = to base q <> [r]\\n where\\n (q, r) = quotRem i base\\n\\nfrom :: Int -> [Int] -> Int\\nfrom base = foldl1 ((+) . (base *))\\n\\n\\n--------------------------- TEST ---------------------------\\nmain :: IO ()\\nmain =\\n mapM_\\n (putStrLn .\\n intercalate \\\" <-> \\\" .\\n (((:) . (=<<) show . toBase) <*> (return . show . fromBase . toBase)))\\n [2097152, 2097151]\\n where\\n b = 8\\n fromBase = from b\\n toBase = to b\\n\",\n \"language\": \"Haskell\"\n },\n {\n \"code\": \"procedure main()\\nevery i := 2097152 | 2097151 | 1 | 127 | 128 | 589723405834 | 165 | 256 do\\n write(image(i),\\\" = \\\",string2hex(v := uint2vlq(i)),\\\" = \\\",vlq2uint(v))\\nend\\n\\nprocedure vlq2uint(s) #: decode a variable length quantity\\n if *s > 0 then {\\n i := 0\\n s ? while h := ord(move(1)) do {\\n if (pos(0) & h > 128) | (not pos(0) & h < 128) then fail\\n i := 128 * i + h % 128\\n }\\n return i\\n }\\nend\\n\\nprocedure uint2vlq(i,c) #: encode a whole number as a variable length quantity\\n if \\\"integer\\\" == type(-1 < i) then\\n return if i = 0 then\\n char((/c := 0)) | \\\"\\\"\\n else\\n uint2vlq(i/128,1) || char((i % 128) + ((/c := 0) | 128) )\\nend\\n\\nprocedure string2hex(s) #: convert a string to hex\\n h := \\\"\\\"\\n every i := ord(!s) do\\n h ||:= \\\"0123456789abcdef\\\"[i/16+1] || \\\"0123456789abcdef\\\"[i%16+1]\\n return h\\nend\\n\",\n \"language\": \"Icon\"\n },\n {\n \"code\": \"N=: 128x\\nv2i=: (N&| N&#./.~ [: +/\\\\ _1 |. N&>)@i.~&a.\\ni2v=: a. {~ [:;}.@(N+//.@,:N&#.inv)&.>\\nifv=: v2i :. i2v\\nvfi=: i2v :. v2i\\nav=: 3 u: ]\\n\",\n \"language\": \"J\"\n },\n {\n \"code\": \" numbers=: 16b7f 16b4000 0 16b3ffffe 16b1fffff 200000\\n av vlq=: vfi numbers\\n127 129 128 0 0 129 255 255 126 255 255 127 140 154 64\\n av (vfi 1 2 3 4 5 6) +&.ifv vlq\\n129 0 129 128 2 3 130 128 128 2 129 128 128 4 140 154 70\\n\",\n \"language\": \"J\"\n },\n {\n \"code\": \"public class VLQCode\\n{\\n public static byte[] encode(long n)\\n {\\n int numRelevantBits = 64 - Long.numberOfLeadingZeros(n);\\n int numBytes = (numRelevantBits + 6) / 7;\\n if (numBytes == 0)\\n numBytes = 1;\\n byte[] output = new byte[numBytes];\\n for (int i = numBytes - 1; i >= 0; i--)\\n {\\n int curByte = (int)(n & 0x7F);\\n if (i != (numBytes - 1))\\n curByte |= 0x80;\\n output[i] = (byte)curByte;\\n n >>>= 7;\\n }\\n return output;\\n }\\n\\n public static long decode(byte[] b)\\n {\\n long n = 0;\\n for (int i = 0; i < b.length; i++)\\n {\\n int curByte = b[i] & 0xFF;\\n n = (n << 7) | (curByte & 0x7F);\\n if ((curByte & 0x80) == 0)\\n break;\\n }\\n return n;\\n }\\n\\n public static String byteArrayToString(byte[] b)\\n {\\n StringBuilder sb = new StringBuilder();\\n for (int i = 0; i < b.length; i++)\\n {\\n if (i > 0)\\n sb.append(\\\", \\\");\\n String s = Integer.toHexString(b[i] & 0xFF);\\n if (s.length() < 2)\\n s = \\\"0\\\" + s;\\n sb.append(s);\\n }\\n return sb.toString();\\n }\\n\\n public static void main(String[] args)\\n {\\n long[] testNumbers = { 2097152, 2097151, 1, 127, 128, 589723405834L };\\n for (long n : testNumbers)\\n {\\n byte[] encoded = encode(n);\\n long decoded = decode(encoded);\\n System.out.println(\\\"Original input=\\\" + n + \\\", encoded = [\\\" + byteArrayToString(encoded) + \\\"], decoded=\\\" + decoded + \\\", \\\" + ((n == decoded) ? \\\"OK\\\" : \\\"FAIL\\\"));\\n }\\n }\\n}\\n\",\n \"language\": \"Java\"\n },\n {\n \"code\": \"const RADIX = 7;\\nconst MASK = 2**RADIX - 1;\\n\\nconst octetify = (n)=> {\\n\\tif (n >= 2147483648) {\\n\\t\\tthrow new RangeError(\\\"Variable Length Quantity not supported for numbers >= 2147483648\\\");\\n\\t}\\n\\tconst octets = [];\\n\\tfor (let i = n; i != 0; i >>>= RADIX) {\\n\\t\\toctets.push((((i & MASK) + (octets.empty ? 0 : (MASK + 1)))));\\n\\t}\\n\\toctets.reverse();\\n\\treturn octets;\\n};\\n\\nconst deoctetify = (octets)=>\\n\\toctets.reduce((n, octet)=>\\n\\t\\t(n << RADIX) + (octet & MASK)\\n\\t, 0);\\n\\n// Test (assuming Node.js)\\n\\nconst assert = require(\\\"assert\\\");\\nconst testNumbers = [ 0x200000, 0x1fffff, 1, 127, 128, 2147483647 /*, 589723405834*/ ]\\n\\ntestNumbers.forEach((number)=> {\\n\\tconst octets = octetify(number)\\n\\tconsole.log(octets);\\n\\tconst got_back_number = deoctetify(octets)\\n\\tassert.strictEqual(got_back_number, number);\\n});\\n\",\n \"language\": \"JavaScript\"\n },\n {\n \"code\": \"# \\\"VARIABLE-LENGTH QUANTITY\\\"\\n# A VLQ is a variable-length encoding of a number into a sequence of octets,\\n# with the most-significant octet first, and with the most significant bit first in each octet.\\n# The first (left-most) bit in each octet is a continuation bit: all octets except the last have the left-most bit set.\\n# The bits of the original number are taken 7 at a time from the right to form the octets.\\n# Thus, if the number is between 0 and 127, it is represented exactly as one byte.\\n\\n# Produce a stream of the base $b \\\"digits\\\" of the input number,\\n# least significant first, with a final 0\\ndef digits($b):\\n def mod: . % $b;\\n def div: ((. - mod) / $b);\\n recurse( select(. > 0) | div) | mod ;\\n\\n# 2 <= $b <= 36\\ndef tobase($b):\\n def digit: \\\"0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZ\\\"[.:.+1];\\n if . == 0 then \\\"0\\\"\\n else [digits($b) | digit] | reverse[1:] | add\\n end;\\n\\n# input: a decimal integer\\n# output: the corresponding variable-length quantity expressed as an array of strings of length 2,\\n# each representing an octet in hexadecimal notation, with most-significant octet first.\\ndef vlq:\\n def lpad: if length == 2 then . else \\\"0\\\" + . end;\\n [digits(128) + 128] | reverse[1:] | .[-1] -=128 | map(tobase(16) | lpad);\\n\\n# Input: a VLQ as produced by vlq/0\\n# Output: the corresponding decimal\\ndef vlq2dec:\\n def x2d: # convert the character interpreted as a hex digit to a decimal\\n explode[0] as $x\\n | if $x < 65 then $x - 48 elif $x < 97 then $x - 55 else $x - 87 end;\\n map( ((.[0:1] | x2d) * 16) + (.[1:] | x2d) - 128)\\n | .[-1] += 128 # the most significant bit of the least significant octet\\n | reduce reverse[] as $x ({x: 0, m: 1}; .x += ($x * .m) | .m *= 128)\\n | .x ;\\n\\n# The task\\n\\ndef lpad($len): tostring | ($len - length) as $l | (\\\" \\\" * $l)[:$l] + .;\\n\\n2097152, 2097151\\n| vlq as $vlq\\n| \\\"\\\\(lpad(8)) => \\\\($vlq|join(\\\",\\\")|lpad(12)) => \\\\($vlq | vlq2dec | lpad(8))\\\"\\n\",\n \"language\": \"Jq\"\n },\n {\n \"code\": \"using Printf\\n\\nmutable struct VLQ\\n quant::Vector{UInt8}\\nend\\n\\nfunction VLQ(n::T) where T <: Integer\\n quant = UInt8.(digits(n, 128))\\n @inbounds for i in 2:length(quant) quant[i] |= 0x80 end\\n VLQ(reverse(quant))\\nend\\n\\nimport Base.UInt64\\nfunction Base.UInt64(vlq::VLQ)\\n quant = reverse(vlq.quant)\\n n = shift!(quant)\\n p = one(UInt64)\\n for i in quant\\n p *= 0x80\\n n += p * ( i & 0x7f)\\n end\\n return n\\nend\\n\\nconst test = [0x00200000, 0x001fffff, 0x00000000, 0x0000007f,\\n 0x00000080, 0x00002000, 0x00003fff, 0x00004000,\\n 0x08000000, 0x0fffffff]\\n\\nfor i in test\\n vlq = VLQ(i)\\n j = UInt(vlq)\\n @printf \\\"0x%-8x => [%-25s] => 0x%x\\\\n\\\" i join((\\\"0x\\\" * hex(r, 2) for r in vlq.quant), \\\", \\\") j\\nend\\n\",\n \"language\": \"Julia\"\n },\n {\n \"code\": \"// version 1.0.6\\n\\nfun Int.toOctets(): ByteArray {\\n var s = Integer.toBinaryString(this)\\n val r = s.length % 7\\n var z = s.length / 7\\n if (r > 0) {\\n z++\\n s = s.padStart(z * 7, '0')\\n }\\n s = Array(z) { \\\"1\\\" + s.slice(it * 7 until (it + 1) * 7) }.joinToString(\\\"\\\")\\n s = s.take(s.length - 8) + \\\"0\\\" + s.takeLast(7)\\n return ByteArray(z) { Integer.parseInt(s.slice(it * 8 until (it + 1) * 8), 2).toByte() }\\n}\\n\\nfun ByteArray.fromOctets(): Int {\\n var s = \\\"\\\"\\n for (b in this) s += Integer.toBinaryString(b.toInt()).padStart(7, '0').takeLast(7)\\n return Integer.parseInt(s, 2)\\n}\\n\\nfun main(args: Array<String>) {\\n val tests = intArrayOf(0x7f, 0x3fff, 0x200000, 0x1fffff)\\n for (test in tests) {\\n val ba = test.toOctets()\\n print(\\\"${\\\"0x%x\\\".format(test).padEnd(8)} -> \\\")\\n var s = \\\"\\\"\\n ba.forEach { s += \\\"0x%02x \\\".format(it) }\\n println(\\\"${s.padEnd(20)} <- ${\\\"0x%x\\\".format(ba.fromOctets())}\\\")\\n }\\n}\\n\",\n \"language\": \"Kotlin\"\n },\n {\n \"code\": \"toOctets[n_Integer] :=\\n StringJoin @@@\\n Partition[\\n PadLeft[Characters@IntegerString[n, 16],\\n 2 Ceiling[Plus @@ DigitCount[n, 16]/2], {\\\"0\\\"}], 2]\\nfromOctets[octets_List] := FromDigits[StringJoin @@ octets, 16]\\nGrid[{#, toOctets@#, fromOctets[toOctets@#]} & /@ {16^^3ffffe, 16^^1fffff, 16^^200000}]\\n\",\n \"language\": \"Mathematica\"\n },\n {\n \"code\": \"import strformat\\n\\nproc toSeq(x: uint64): seq[uint8] =\\n var x = x\\n var f = 0u64\\n for i in countdown(9u64, 1):\\n if (x and 127'u64 shl (i * 7)) > 0:\\n f = i\\n break\\n for j in 0u64..f:\\n result.add uint8((x shr ((f - j) * 7)) and 127) or 128\\n\\n result[f] = result[f] xor 128'u8\\n\\nproc fromSeq(xs: openArray[uint8]): uint64 =\\n for x in xs:\\n result = (result shl 7) or (x and 127)\\n\\nfor x in [0x7f'u64, 0x4000'u64, 0'u64, 0x3ffffe'u64, 0x1fffff'u64,\\n 0x200000'u64, 0x3311a1234df31413'u64]:\\n let c = toSeq(x)\\n echo &\\\"seq from {x}: {c} back: {fromSeq(c)}\\\"\\n\",\n \"language\": \"Nim\"\n },\n {\n \"code\": \"let to_vlq n =\\n let a, b = n lsr 7, n land 0x7F in\\n let rec aux n acc =\\n let x = (n land 0x7F) lor 0x80\\n and xs = n lsr 7 in\\n if xs > 0\\n then aux xs (x::acc)\\n else x::acc\\n in\\n aux a [b]\\n\\nlet to_num = List.fold_left (fun n x -> n lsl 7 + (x land 0x7F)) 0\\n\\nlet v_rep n =\\n Printf.printf \\\"%d ->\\\" n;\\n let seq = to_vlq n in\\n List.iter (Printf.printf \\\" 0x%02X\\\") seq;\\n let num = to_num seq in\\n Printf.printf \\\"-> %d\\\\n%!\\\" num;\\n assert (n = num)\\n\\nlet _ =\\n v_rep 0x200000;\\n v_rep 0x1FFFFF\\n\",\n \"language\": \"OCaml\"\n },\n {\n \"code\": \"hex(s)=my(a=10,b=11,c=12,d=13,e=14,f=15);subst(Pol(eval(Vec(s))),'x,16);\\nn1=hex(\\\"200000\\\");n2=hex(\\\"1fffff\\\");\\nv1=digits(n1,256)\\nv2=digits(n2,256)\\nsubst(Pol(v1),'x,256)==n1\\nsubst(Pol(v2),'x,256)==n2\\n\",\n \"language\": \"PARI-GP\"\n },\n {\n \"code\": \"use warnings;\\nuse strict;\\n\\nfor my $testcase (\\n 0, 0xa, 123, 254, 255, 256,\\n 257, 65534, 65535, 65536, 65537, 0x1fffff,\\n 0x200000\\n )\\n{\\n my @vlq = vlq_encode($testcase);\\n printf \\\"%8s %12s %8s\\\\n\\\", $testcase, ( join ':', @vlq ), vlq_decode(@vlq);\\n}\\n\\nsub vlq_encode {\\n my @vlq;\\n my $binary = sprintf \\\"%s%b\\\", 0 x 7, shift;\\n $binary =~ s/(.{7})$//;\\n @vlq = ( unpack 'H2', ( pack 'B8', '0' . $1 ) );\\n while ( 0 + $binary ) {\\n $binary =~ s/(.{7})$//;\\n unshift @vlq, ( unpack 'H2', pack 'B8', '1' . $1 );\\n }\\n return @vlq;\\n}\\n\\nsub vlq_decode {\\n my $num;\\n $num .= sprintf \\\"%07b\\\", hex(shift @_) & 0x7f while @_;\\n return oct '0b' . $num;\\n}\\n\",\n \"language\": \"Perl\"\n },\n {\n \"code\": \"-->\\n <span style=\\\"color: #008080;\\\">function</span> <span style=\\\"color: #000000;\\\">vlq_encode</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;\\\">sequence</span> <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: #7060A8;\\\">length</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">s</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;\\\">n</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;\\\">msb</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">0</span>\\n <span style=\\\"color: #008080;\\\">if</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: #7060A8;\\\">crash</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #008000;\\\">\\\"unsigned integers only!\\\"</span><span style=\\\"color: #0000FF;\\\">)</span> <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">if</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;\\\">res</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">prepend</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">res</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">msb</span><span style=\\\"color: #0000FF;\\\">+</span><span style=\\\"color: #7060A8;\\\">and_bits</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">n</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">#7F</span><span style=\\\"color: #0000FF;\\\">))</span>\\n <span style=\\\"color: #000000;\\\">n</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;\\\">#80</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;\\\">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;\\\">msb</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">#80</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: #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;\\\">vlq_decode</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;\\\">sequence</span> <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;\\\">integer</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: #000000;\\\">n</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">n</span><span style=\\\"color: #0000FF;\\\">*</span><span style=\\\"color: #000000;\\\">#80</span><span style=\\\"color: #0000FF;\\\">+</span><span style=\\\"color: #7060A8;\\\">and_bits</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #004080;\\\">byte</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">#7F</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;\\\">si</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">#80</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;\\\">n</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #000000;\\\">n</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">0</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;\\\">svlg</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> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #008000;\\\">\\\"\\\"</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;\\\">res</span> <span style=\\\"color: #0000FF;\\\">&=</span> <span style=\\\"color: #7060A8;\\\">sprintf</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #008000;\\\">\\\"#%02x:\\\"</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;\\\">end</span> <span style=\\\"color: #008080;\\\">for</span>\\n <span style=\\\"color: #008080;\\\">return</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: #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: #008080;\\\">constant</span> <span style=\\\"color: #000000;\\\">testNumbers</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #0000FF;\\\">{</span> <span style=\\\"color: #000000;\\\">#200000</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">#1FFFFF</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">127</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">128</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: #000000;\\\">vlq_encode</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">testNumbers</span><span style=\\\"color: #0000FF;\\\">),</span>\\n <span style=\\\"color: #000000;\\\">decoded</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">vlq_decode</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">s</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 -> %s\\\\n\\\"</span><span style=\\\"color: #0000FF;\\\">,{</span><span style=\\\"color: #000000;\\\">svlg</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">testNumbers</span><span style=\\\"color: #0000FF;\\\">),</span><span style=\\\"color: #000000;\\\">svlg</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">s</span><span style=\\\"color: #0000FF;\\\">),</span><span style=\\\"color: #000000;\\\">svlg</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">decoded</span><span style=\\\"color: #0000FF;\\\">)})</span>\\n <span style=\\\"color: #008080;\\\">if</span> <span style=\\\"color: #000000;\\\">decoded</span><span style=\\\"color: #0000FF;\\\">!=</span><span style=\\\"color: #000000;\\\">testNumbers</span> <span style=\\\"color: #008080;\\\">then</span> <span style=\\\"color: #7060A8;\\\">crash</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #008000;\\\">\\\"something wrong\\\"</span><span style=\\\"color: #0000FF;\\\">)</span> <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">if</span>\\n<!--\\n\",\n \"language\": \"Phix\"\n },\n {\n \"code\": \"(de numToVlq (Num)\\n (let Res (cons (& Num 127))\\n (while (gt0 (setq Num (>> 7 Num)))\\n (push 'Res (| 128 (& Num 127))) )\\n Res ) )\\n\\n(de vlqToNum (Vlq)\\n (let Res 0\\n (for N Vlq\\n (setq Res (| (>> -7 Res) (& N 127))) ) ) )\\n\\n(for Num (0 15 16 127 128 255 2097151 2097152)\\n (let Vlq (numToVlq Num)\\n (tab (12 12 12) Num (glue \\\":\\\" (mapcar hex Vlq)) (vlqToNum Vlq)) ) )\\n\",\n \"language\": \"PicoLisp\"\n },\n {\n \"code\": \"test: procedure options(main);\\n declare s character (20) varying;\\n declare c character (1);\\n declare v fixed binary (31);\\n declare (i, k) fixed binary;\\n\\n get edit (s) (L);\\n s = trim (s);\\n v = 0;\\n do i = 1 to length(s);\\n c = substr(s, i, 1);\\n k = index('0123456789abcdef', c);\\n if k > 0 then v = v*16 + k - 1;\\n end;\\n put skip data (s, v);\\n\\n /* Convert back to hex */\\n declare hex character(16) initial ('0123456789abcdef');\\n declare hs character (20) initial ('');\\n declare d fixed binary;\\n\\n do i = length(hs) to 1 by -1 until (v = 0);\\n d = mod(v, 16) + 1;\\n substr(hs, i, 1) = substr(hex, d, 1);\\n v = v/16;\\n end;\\n put skip list (hs);\\nend test;\\n\",\n \"language\": \"PL-I\"\n },\n {\n \"code\": \"def tobits(n, _group=8, _sep='_', _pad=False):\\n 'Express n as binary bits with separator'\\n bits = '{0:b}'.format(n)[::-1]\\n if _pad:\\n bits = '{0:0{1}b}'.format(n,\\n ((_group+len(bits)-1)//_group)*_group)[::-1]\\n answer = _sep.join(bits[i:i+_group]\\n for i in range(0, len(bits), _group))[::-1]\\n answer = '0'*(len(_sep)-1) + answer\\n else:\\n answer = _sep.join(bits[i:i+_group]\\n for i in range(0, len(bits), _group))[::-1]\\n return answer\\n\\ndef tovlq(n):\\n return tobits(n, _group=7, _sep='1_', _pad=True)\\n\\ndef toint(vlq):\\n return int(''.join(vlq.split('_1')), 2)\\n\\ndef vlqsend(vlq):\\n for i, byte in enumerate(vlq.split('_')[::-1]):\\n print('Sent byte {0:3}: {1:#04x}'.format(i, int(byte,2)))\\n\",\n \"language\": \"Python\"\n },\n {\n \"code\": \">>> for n in (254, 255, 256, 257, -2+(1<<16), -1+(1<<16), 1<<16, 1+(1<<16), 0x200000, 0x1fffff ):\\n print('int: %7i bin: %26s vlq: %35s vlq->int: %7i' % (n, tobits(n,_pad=True), tovlq(n), toint(tovlq(n))))\\n\\n\\nint: 254 bin: 11111110 vlq: 00000001_11111110 vlq->int: 254\\nint: 255 bin: 11111111 vlq: 00000001_11111111 vlq->int: 255\\nint: 256 bin: 00000001_00000000 vlq: 00000010_10000000 vlq->int: 256\\nint: 257 bin: 00000001_00000001 vlq: 00000010_10000001 vlq->int: 257\\nint: 65534 bin: 11111111_11111110 vlq: 00000011_11111111_11111110 vlq->int: 65534\\nint: 65535 bin: 11111111_11111111 vlq: 00000011_11111111_11111111 vlq->int: 65535\\nint: 65536 bin: 00000001_00000000_00000000 vlq: 00000100_10000000_10000000 vlq->int: 65536\\nint: 65537 bin: 00000001_00000000_00000001 vlq: 00000100_10000000_10000001 vlq->int: 65537\\nint: 2097152 bin: 00100000_00000000_00000000 vlq: 00000001_10000000_10000000_10000000 vlq->int: 2097152\\nint: 2097151 bin: 00011111_11111111_11111111 vlq: 01111111_11111111_11111111 vlq->int: 2097151\\n>>> vlqsend(tovlq(0x200000))\\nSent byte 0: 0x80\\nSent byte 1: 0x80\\nSent byte 2: 0x80\\nSent byte 3: 0x01\\n>>> vlqsend(tovlq(0x1fffff))\\nSent byte 0: 0xff\\nSent byte 1: 0xff\\nSent byte 2: 0x7f\\n>>>\\n\",\n \"language\": \"Python\"\n },\n {\n \"code\": \"#lang racket\\n\\n(define (try n)\\n (printf \\\"Original number: ~s (0x~x)\\\\n\\\" n n)\\n (define 4octets (integer->integer-bytes n 4 #f))\\n (printf \\\"Octets: ~a (byte-string: ~s)\\\\n\\\"\\n (string-join (map (λ(o) (~r o #:base 16))\\n (bytes->list 4octets))\\n \\\":\\\")\\n 4octets)\\n (define m (integer-bytes->integer 4octets #f))\\n (printf \\\"Back to a number: ~s (~a)\\\\n\\\"\\n m (if (= m n) \\\"OK\\\" \\\"BAD\\\")))\\n\\n(for-each try '(#x200000 #x1fffff))\\n\",\n \"language\": \"Racket\"\n },\n {\n \"code\": \"sub vlq_encode ($number is copy) {\\n my @vlq = (127 +& $number).fmt(\\\"%02X\\\");\\n $number +>= 7;\\n while ($number) {\\n @vlq.push: (128 +| (127 +& $number)).fmt(\\\"%02X\\\");\\n $number +>= 7;\\n }\\n @vlq.reverse.join: ':';\\n}\\n\\nsub vlq_decode ($string) {\\n sum $string.split(':').reverse.map: {(:16($_) +& 127) +< (7 × $++)}\\n}\\n\\n#test encoding and decoding\\nfor (\\n 0, 0xa, 123, 254, 255, 256,\\n 257, 65534, 65535, 65536, 65537, 0x1fffff,\\n 0x200000\\n ) -> $testcase {\\n printf \\\"%8s %12s %8s\\\\n\\\", $testcase,\\n my $encoded = vlq_encode($testcase),\\n vlq_decode($encoded);\\n}\\n\",\n \"language\": \"Raku\"\n },\n {\n \"code\": \"/*REXX program displays (and also tests/verifies) some numbers as octets. */\\nnums = x2d(200000) x2d(1fffff) 2097172 2097151\\n#=words(nums)\\nsay ' number hex octet original'\\nsay '══════════ ══════════ ══════════ ══════════'\\nok=1\\n do j=1 for #; @.j= word(nums,j)\\n onum.j=octet(@.j)\\n orig.j= x2d( space(onum.j, 0) )\\n w=10\\n say center(@.j, w) center(d2x(@.j), w) center(onum.j, w) center(orig.j, w)\\n if @.j\\\\==orig.j then ok=0\\n end /*j*/\\nsay\\nif ok then say 'All ' # \\\" numbers are OK.\\\" /*all of the numbers are good. */\\n else say \\\"Some numbers are not OK.\\\" /*some of the numbers are ¬good. */\\nexit /*stick a fork in it, we're all done. */\\n/*──────────────────────────────────────────────────────────────────────────────────────*/\\noctet: procedure; parse arg z,$ /*obtain Z from the passed arguments.*/\\n x=d2x(z) /*convert Z to a hexadecimal octet. */\\n do j=length(x) by -2 to 1 /*process the \\\"little\\\" end first. */\\n $= substr(x, j-1, 2, 0) $ /*pad odd hexadecimal characters with */\\n end /*j*/ /* ··· a zero on the left. */\\n return strip($)\\n\",\n \"language\": \"REXX\"\n },\n {\n \"code\": \"[0x200000, 0x1fffff].each do |i|\\n # Encode i => BER\\n ber = [i].pack(\\\"w\\\")\\n hex = ber.unpack(\\\"C*\\\").collect {|c| \\\"%02x\\\" % c}.join(\\\":\\\")\\n printf \\\"%s => %s\\\\n\\\", i, hex\\n\\n # Decode BER => j\\n j = ber.unpack(\\\"w\\\").first\\n i == j or fail \\\"BER not preserve integer\\\"\\nend\\n\",\n \"language\": \"Ruby\"\n },\n {\n \"code\": \"object VlqCode {\\n def encode(x:Long)={\\n val result=scala.collection.mutable.Stack[Byte]()\\n result push (x&0x7f).toByte\\n var l = x >>> 7\\n while(l>0){\\n result push ((l&0x7f)|0x80).toByte\\n l >>>= 7\\n }\\n result.toArray\\n }\\n\\n def decode(a:Array[Byte])=a.foldLeft(0L)((r, b) => r<<7|b&0x7f)\\n\\n def toString(a:Array[Byte])=a map(\\\"%02x\\\".format(_)) mkString(\\\"[\\\", \\\", \\\", \\\"]\\\")\\n\\n def test(x:Long)={\\n val enc=encode(x)\\n println(\\\"0x%x => %s => 0x%x\\\".format(x, toString(enc), decode(enc)))\\n }\\n\\n def main(args: Array[String]): Unit = {\\n val xs=Seq(0, 0x7f, 0x80, 0x2000, 0x3fff, 0x4000, 0x1FFFFF, 0x200000, 0x8000000,\\n 0xFFFFFFF, 0xFFFFFFFFL, 0x842FFFFFFFFL, 0x0FFFFFFFFFFFFFFFL)\\n xs foreach test\\n }\\n}\\n\",\n \"language\": \"Scala\"\n },\n {\n \"code\": \"$ include \\\"seed7_05.s7i\\\";\\n include \\\"bigint.s7i\\\";\\n\\nconst func string: toSequence (in var bigInteger: number) is func\\n result\\n var string: sequence is \\\"\\\";\\n begin\\n sequence := str(chr(ord(number mod 128_)));\\n number >>:= 7;\\n while number <> 0_ do\\n sequence := str(chr(ord(number mod 128_) + 128)) & sequence;\\n number >>:= 7;\\n end while;\\n end func;\\n\\nconst func bigInteger: fromSequence (in string: sequence) is func\\n result\\n var bigInteger: number is 0_;\\n local\\n var integer: index is 1;\\n begin\\n while ord(sequence[index]) >= 128 do\\n number <<:= 7;\\n number +:= bigInteger conv (ord(sequence[index]) - 128);\\n incr(index);\\n end while;\\n number <<:= 7;\\n number +:= bigInteger conv ord(sequence[index]);\\n end func;\\n\\nconst proc: main is func\\n local\\n const array bigInteger: testValues is [] (\\n 0_, 10_, 123_, 254_, 255_, 256_, 257_, 65534_, 65535_, 65536_, 65537_, 2097151_, 2097152_);\\n var string: sequence is \\\"\\\";\\n var bigInteger: testValue is 0_;\\n var char: element is ' ';\\n begin\\n for testValue range testValues do\\n sequence := toSequence(testValue);\\n write(\\\"sequence from \\\" <& testValue <& \\\": [ \\\");\\n for element range sequence do\\n write(ord(element) radix 16 lpad0 2 <& \\\" \\\");\\n end for;\\n writeln(\\\"] back: \\\" <& fromSequence(sequence));\\n end for;\\n end func;\\n\",\n \"language\": \"Seed7\"\n },\n {\n \"code\": \"func vlq_encode(num) {\\n var t = (0x7F & num)\\n var str = t.chr\\n while (num >>= 7) {\\n t = (0x7F & num)\\n str += chr(0x80 | t)\\n }\\n str.reverse\\n}\\n\\nfunc vlq_decode(str) {\\n var num = ''\\n str.each_byte { |b|\\n num += ('%07b' % (b & 0x7F))\\n }\\n Num(num, 2)\\n}\\n\\nvar tests = [0, 0xa, 123, 254, 255, 256,\\n 257, 65534, 65535, 65536, 65537, 0x1fffff,\\n 0x200000]\\n\\ntests.each { |t|\\n var vlq = vlq_encode(t)\\n printf(\\\"%8s %12s %8s\\\\n\\\", t,\\n vlq.bytes.join(':', { \\\"%02X\\\" % _ }), vlq_decode(vlq))\\n}\\n\",\n \"language\": \"Sidef\"\n },\n {\n \"code\": \"package require Tcl 8.5\\n\\nproc vlqEncode number {\\n if {$number < 0} {error \\\"negative not supported\\\"}\\n while 1 {\\n\\tlappend digits [expr {$number & 0x7f}]\\n\\tif {[set number [expr {$number >> 7}]] == 0} break\\n }\\n set out [format %c [lindex $digits 0]]\\n foreach digit [lrange $digits 1 end] {\\n\\tset out [format %c%s [expr {0x80+$digit}] $out]\\n }\\n return $out\\n}\\nproc vlqDecode chars {\\n set n 0\\n foreach c [split $chars \\\"\\\"] {\\n\\tscan $c %c c\\n\\tset n [expr {($n<<7) | ($c&0x7f)}]\\n\\tif {!($c&0x80)} break\\n }\\n return $n\\n}\\n\",\n \"language\": \"Tcl\"\n },\n {\n \"code\": \"proc numtohex {num} {\\n binary scan [string trimleft [binary format W $num] \\\\0] H* hexEncoded\\n regsub -all \\\"..(?=.)\\\" $hexEncoded \\\"&:\\\"\\n}\\nproc strtohex {string} {\\n binary scan $string H* hexEncoded\\n regsub -all \\\"..(?=.)\\\" $hexEncoded \\\"&:\\\"\\n}\\nforeach testcase {\\n 123\\n 254 255 256 257\\n 65534 65535 65536 65537\\n 2097152 2097151\\n 12345678901234566789\\n} {\\n set encoded [vlqEncode $testcase]\\n binary scan $encoded H* hexEncoded\\n regsub -all {..(?=.)} $hexEncoded &: hexEncoded\\n set decoded [vlqDecode $encoded]\\n puts \\\"$testcase ([numtohex $testcase]) ==>\\\\\\n\\t[strtohex $encoded] ([string length $encoded] bytes) ==>\\\\\\n\\t$decoded\\\"\\n}\\n\",\n \"language\": \"Tcl\"\n },\n {\n \"code\": \"Module Module1\\n\\n Function ToVlq(v As ULong) As ULong\\n Dim array(8) As Byte\\n Dim buffer = ToVlqCollection(v).SkipWhile(Function(b) b = 0).Reverse().ToArray\\n buffer.CopyTo(array, 0)\\n Return BitConverter.ToUInt64(array, 0)\\n End Function\\n\\n Function FromVlq(v As ULong) As ULong\\n Dim collection = BitConverter.GetBytes(v).Reverse()\\n Return FromVlqCollection(collection)\\n End Function\\n\\n Iterator Function ToVlqCollection(v As ULong) As IEnumerable(Of Byte)\\n If v > Math.Pow(2, 56) Then\\n Throw New OverflowException(\\\"Integer exceeds max value.\\\")\\n End If\\n\\n Dim index = 7\\n Dim significantBitReached = False\\n Dim mask = &H7FUL << (index * 7)\\n While index >= 0\\n Dim buffer = mask And v\\n If buffer > 0 OrElse significantBitReached Then\\n significantBitReached = True\\n buffer >>= index * 7\\n If index > 0 Then\\n buffer = buffer Or &H80\\n End If\\n Yield buffer\\n End If\\n mask >>= 7\\n index -= 1\\n End While\\n End Function\\n\\n Function FromVlqCollection(vlq As IEnumerable(Of Byte)) As ULong\\n Dim v = 0UL\\n Dim significantBitReached = False\\n\\n Using enumerator = vlq.GetEnumerator\\n Dim index = 0\\n While enumerator.MoveNext\\n Dim buffer = enumerator.Current\\n If buffer > 0 OrElse significantBitReached Then\\n significantBitReached = True\\n v <<= 7\\n v = v Or (buffer And &H7FUL)\\n End If\\n\\n index += 1\\n If index = 8 OrElse (significantBitReached AndAlso (buffer And &H80) <> &H80) Then\\n Exit While\\n End If\\n End While\\n End Using\\n\\n Return v\\n End Function\\n\\n Sub Main()\\n Dim values = {&H7FUL << 7 * 7, &H80, &H2000, &H3FFF, &H4000, &H200000, &H1FFFFF}\\n For Each original In values\\n Console.WriteLine(\\\"Original: 0x{0:X}\\\", original)\\n\\n REM collection\\n Dim seq = ToVlqCollection(original)\\n Console.WriteLine(\\\"Sequence: 0x{0}\\\", seq.Select(Function(b) b.ToString(\\\"X2\\\")).Aggregate(Function(a, b) String.Concat(a, b)))\\n\\n Dim decoded = FromVlqCollection(seq)\\n Console.WriteLine(\\\"Decoded: 0x{0:X}\\\", decoded)\\n\\n REM ints\\n Dim encoded = ToVlq(original)\\n Console.WriteLine(\\\"Encoded: 0x{0:X}\\\", encoded)\\n\\n decoded = FromVlq(encoded)\\n Console.WriteLine(\\\"Decoded: 0x{0:X}\\\", decoded)\\n\\n Console.WriteLine()\\n Next\\n End Sub\\n\\nEnd Module\\n\",\n \"language\": \"Visual-Basic-.NET\"\n },\n {\n \"code\": \"import \\\"./fmt\\\" for Fmt, Conv\\nimport \\\"./str\\\" for Str\\n\\nvar toOctets = Fn.new { |n|\\n var s = Conv.itoa(n, 2)\\n var le = s.count\\n var r = le % 7\\n var d = (le/7).floor\\n if (r > 0) {\\n d = d + 1\\n s = Fmt.zfill(7 * d, s)\\n }\\n var chunks = Str.chunks(s, 7)\\n var last = \\\"0\\\" + chunks[-1]\\n s = chunks[0..-2].map { |ch| \\\"1\\\" + ch }.join() + last\\n return Str.chunks(s, 8).map { |ch| Conv.atoi(ch, 2) }.toList\\n}\\n\\nvar fromOctets = Fn.new { |octets|\\n var s = \\\"\\\"\\n for (oct in octets) {\\n var bin = Conv.itoa(oct, 2)\\n bin = Fmt.zfill(7, bin)\\n s = s + bin[-7..-1]\\n }\\n return Conv.atoi(s, 2)\\n}\\n\\nvar tests = [2097152, 2097151]\\nfor (test in tests) {\\n var octets = toOctets.call(test)\\n var display = octets.map { |oct| \\\"Ox\\\" + Fmt.xz(2, oct) }.toList\\n System.write(\\\"%(test) -> %(Fmt.v(\\\"s\\\", 4, display, 0, \\\" \\\", \\\"\\\")) -> \\\")\\n System.print(fromOctets.call(octets))\\n}\\n\",\n \"language\": \"Wren\"\n },\n {\n \"code\": \"func OctIn(Dev); \\\\Input from device value of sequence of octets\\nint Dev, N, Oct;\\n[N:= 0;\\nrepeat Oct:= HexIn(Dev);\\n N:= N<<7 + (Oct&$7F);\\nuntil (Oct&$80) = 0;\\nreturn N;\\n];\\n\\nproc OctOut(Dev, Num, Lev); \\\\Output value to device as sequence of octets\\nint Dev, Num, Lev, Rem;\\n[Rem:= Num & $7F;\\nNum:= Num >> 7;\\nif Num # 0 then OctOut(Dev, Num, Lev+1);\\nif Lev > 0 then Rem:= Rem + $80;\\nSetHexDigits(2);\\nHexOut(Dev, Rem);\\nChOut(Dev, ^ );\\n];\\n\\n\\\\Device 8 is a circular buffer that can be written and read back.\\nint N;\\n[for N:= 0 to $40_0000 do\\n [OctOut(8, N, 0);\\n if N # OctIn(8) then\\n [Text(0, \\\"Error!\\\"); exit];\\n ];\\nOctOut(0, $1F_FFFF, 0); CrLf(0);\\nOctOut(0, $20_0000, 0); CrLf(0);\\nOctOut(0, $7F, 0); CrLf(0);\\nOctOut(0, $4000, 0); CrLf(0);\\nOctOut(0, 0, 0); CrLf(0);\\nOctOut(0, $3F_FFFE, 0); CrLf(0);\\nOctOut(0, $FFFF_FFFF, 0); CrLf(0);\\n]\\n\",\n \"language\": \"XPL0\"\n },\n {\n \"code\": \"on DecToVLQ\\n Ask \\\"Enter base 10 value:\\\" -- input dialog box\\n if it is not empty then\\n if it is a number then\\n put it into theString\\n if isWholeNumString(theString) is false then -- I think there is built in equivalent for this but I rolled my own!\\n answer \\\"Only Whole Decimal Numbers Are Allowed!\\\"\\n exit DecToVLQ\\n end if\\n if theString>4294967295 then\\n answer \\\"This function fails with whole numbers over 4294967295!\\\"&cr\\\\\\n & \\\"4294967295 is the maximum allowed value for 32bits (4 bytes)\\\"\\n exit DecToVLQ\\n end if\\n if theString>268435455 then\\n answer \\\"This function is not accurate with whole numbers over 268435455!\\\"&cr\\\\\\n & \\\"268435455 is the maximum allowed value for 28bit (7bits per byte) MIDI delta-time VLQ\\\"\\n end if\\n put \\\"Original Whole Number=\\\"& theString & cr & \\\\\\n \\\"Original Whole Number in Hex=\\\"& baseConvert(theString,10,16) & cr & \\\\ --- LC's built in baseConvert function\\n \\\"Variable Length Quantity in Hex=\\\" & wholeNumToVLQ(theString) into fld \\\"Output\\\"\\n else\\n answer \\\"Only Whole Decimal Numbers Are Allowed!\\\"\\n end if\\n end if\\nend DecToVLQ\\n\\nfunction wholeNumToVLQ theWholeNum\\n -- baseConvert(number,originalBase,destinationBase) -- there is also bitwise operations in LC but I took the long road\\n if theWholeNum < 127 then -- if it fits into a single 7bit byte value and theres no need to process it\\n put baseConvert(theWholeNum,10,16) into VQLinHex\\n if the number of chars in VQLinHex=1 then put \\\"0\\\" before VQLinHex\\n return VQLinHex\\n exit wholeNumToVLQ\\n end if\\n put baseConvert(theWholeNum,10,2) into theBits\\n put number of chars in theBits into x\\n put 0 into bitCounter\\n put empty into the7bitBytes\\n repeat\\n if char x of theBits is not empty then\\n put char x theBits before the7bitBytes\\n delete char x of theBits\\n if theBits is empty then exit repeat\\n put number of chars in theBits into x\\n add 1 to bitCounter\\n if bitCounter=7 then\\n put \\\",\\\" before the7bitBytes\\n put 0 into bitCounter\\n next repeat\\n end if\\n else\\n exit repeat\\n end if\\n end repeat\\n get the number of chars in item 1 of the7bitBytes\\n if it<7 then\\n put 7 - it into x\\n repeat x\\n put \\\"0\\\" before item 1 of the7bitBytes\\n end repeat\\n end if\\n put the number of items in the7bitBytes into y\\n repeat with x = 1 to y\\n if x is not y then\\n put \\\"1\\\" before item x of the7bitBytes\\n else\\n put \\\"0\\\" before item x of the7bitBytes\\n end if\\n put baseConvert(item x of the7bitBytes,2,16) into item x of the7bitBytes\\n if the number of chars in item x of the7bitBytes<2 then put \\\"0\\\" before item x of the7bitBytes\\n put item x of the7bitBytes after VQLinHex\\n end repeat\\n return VQLinHex\\nend wholeNumToVLQ\\n\\nfunction isWholeNumString theString\\n put the number of chars in theString into y\\n repeat with x = 1 to y\\n if char x of theString is not in \\\"0123456789\\\" then\\n return false\\n exit isWholeNumString\\n end if\\n end repeat\\n return true\\nend isWholeNumString\\n\",\n \"language\": \"XTalk\"\n },\n {\n \"code\": \"function VLQtoWholeNum theHexVLQ\\n -- The number must be an integer between zero and 4,294,967,295\\n put baseConvert(theHexVLQ,16,2) into theBits\\n put 0 into bitCounter\\n put empty into the8bitBytes\\n repeat\\n if char 1 of theBits is not empty then\\n put char 1 theBits after the8bitBytes\\n delete char 1 of theBits\\n if theBits is empty then exit repeat\\n add 1 to bitCounter\\n if bitCounter=8 then\\n put \\\",\\\" after the8bitBytes\\n put 0 into bitCounter\\n next repeat\\n end if\\n else\\n exit repeat\\n end if\\n end repeat\\n put the number of items in the8bitBytes into y\\n repeat with x = 1 to y\\n put char 1 of item x of the8bitBytes into lengthCntrlBit\\n delete char 1 of item x of the8bitBytes\\n if the number of chars in item x of the8bitBytes < 7 then\\n repeat 7 - (the number of chars in item x of the8bitBytes)\\n put \\\"0\\\" before item x of the8bitBytes\\n end repeat\\n end if\\n put item x of the8bitBytes after WholeNumInBinary\\n switch lengthCntrlBit\\n case \\\"1\\\"\\n next repeat\\n break\\n case \\\"0\\\"\\n exit repeat\\n break\\n end switch\\n end repeat\\n return baseConvert(WholeNumInBinary,2,10)\\nend VLQtoWholeNum\\n\\nfunction isHexString theString\\n ---again there is probably an easier way to do this:\\n if char 1 to 2 of theString is \\\"0x\\\" then delete char 1 to 2 of theString\\n put the number of chars in theString into y\\n repeat with x = 1 to y\\n if char x of theString is not in \\\"abcdefABCDEF0123456789\\\" then\\n return false\\n end if\\n end repeat\\nend isHexString\\n\\non VLQHexToWholeNum\\n Ask \\\"Enter Variable Length Quantity Hex Value:\\\" -- input dialog\\n if it is not empty then\\n if char 1 to 2 of it is \\\"0x\\\" then delete char 1 to 2 of it\\n put it into hexString\\n if isHexString(hexString) is false then\\n answer \\\"Only Valid Hex Digits Are Allowed!\\\"\\n exit VLQHexToWholeNum\\n else\\n put \\\"Original Variable Length Quantity in Hex=\\\"& hexString & cr & \\\\\\n \\\"Whole Number=\\\" & VLQtoWholeNum(hexString) into fld \\\"Output\\\"\\n end if\\n end if\\nend VLQHexToWholeNum\\n\",\n \"language\": \"XTalk\"\n },\n {\n \"code\": \"fcn to_seq(x){ //--> list of ints\\n z:=(x.log2()/7);\\n (0).pump(z+1,List,'wrap(j){\\n x.shiftRight((z-j)*7).bitAnd(0x7f).bitOr((j!=z) and 0x80 or 0)\\n });\\n}\\n\\nfcn from_seq(in){ in.reduce(fcn(p,n){ p.shiftLeft(7).bitOr(n.bitAnd(0x7f)) },0) }\\n\",\n \"language\": \"Zkl\"\n },\n {\n \"code\": \"ns:=T(0x7f, 0x4000, 0, 0x3ffffe, 0x1fffff, 0x200000, 0x3311a1234df31413);\\nms:=ns.apply(to_seq);\\nns.zipWith(fcn{\\\"%8,x --> %s --> %,x\\\".fmt(vm.arglist.xplode()).println()},\\n ms.apply(\\\"apply\\\",\\\"%,x\\\".fmt),\\n ms.apply(from_seq));\\n\",\n \"language\": \"Zkl\"\n }\n]","isConversational":false},"task_name":{"kind":"string","value":"Variable-length-quantity"}}},{"rowIdx":1798,"cells":{"solutions":{"kind":"list like","value":[{"code":"---\nfrom: http://rosettacode.org/wiki/Variable_size/Get\nnote: Type System\n","language":"00-META"},{"code":"Demonstrate how to get the size of a variable.\n\nSee also: [[Host introspection]]\n\n","language":"00-TASK"},{"code":"Int64 i\nprint(T(i).size)\nprint(Int64.size)\n","language":"11l"},{"code":"package {\n\n import flash.display.Sprite;\n import flash.events.Event;\n import flash.sampler.getSize;\n\n public class VariableSizeGet extends Sprite {\n\n public function VariableSizeGet() {\n if ( stage ) _init();\n else addEventListener(Event.ADDED_TO_STAGE, _init);\n }\n\n private function _init(e:Event = null):void {\n\n var i:int = 1;\n var n:Number = 0.5;\n var s:String = \"abc\";\n var b:Boolean = true;\n var date:Date = new Date();\n\n trace(\"An int contains \" + getSize(i) + \" bytes.\"); // 4\n trace(\"A Number contains \" + getSize(n) + \" bytes.\"); // 8\n trace(\"The string 'abc' contains \" + getSize(s) + \" bytes.\"); // 24\n trace(\"A Boolean contains \" + getSize(b) + \" bytes.\"); // 4\n trace(\"A Date object contains \" + getSize(date) + \" bytes.\"); // 48\n\n }\n\n }\n\n}\n","language":"ActionScript"},{"code":"Int_Bits : constant Integer := Integer'size;\nWhole_Bytes : constant Integer := Int_Bits / Storage_Unit; -- Storage_Unit is the number of bits per storage element\n","language":"Ada"},{"code":"INT i; BYTES b; # typically INT and BYTES are the same size #\nSTRING s:=\"DCLXVI\", [666]CHAR c;\nprint((\n \"sizeof INT i =\",bytes width, new line,\n \"UPB STRING s =\",UPB s, new line,\n \"UPB []CHAR c =\",UPB c, new line\n))\n","language":"ALGOL-68"},{"code":" 100 PRINT \"SIZE OF INTEGER I% IS \";:I% = I%: GOSUB 240\n 110 PRINT \"SIZE OF FLOAT I IS \";:I = I: GOSUB 240\n 120 PRINT \"SIZE OF STRING I$ IS \";:I$ = I$: GOSUB 240\n 130 PRINT \" LEN OF STRING I$ IS \" LEN (I$)\n 140 PRINT \"SIZE OF FLOAT ARG N IS \";: DEF FN I(N) = 0: GOSUB 240\n 150 PRINT \"SIZE OF FUNCTION FN I IS \";: PRINT MID$ ( STR$ ( FN I(0)),1,0);: GOSUB 240\n 160 PRINT \"ARRAYS:\"\n 170 PRINT \"SIZE OF FLOAT I(1) IS \";:I(1) = I(1): GOSUB 240\n 180 PRINT \"SIZE OF INTEGER I%(2) IS \";:I%(2) = I%(2): GOSUB 240\n 190 PRINT \"SIZE OF STRING I$(3) IS \";:I$(3) = I$(3): GOSUB 240\n 200 PRINT \" LEN OF STRING I$(3) IS \" LEN (I$(3))\n 210 PRINT \"SIZE OF STRING I$(4) IS \";:I$(4) = \"HELLO, WORLD!\": GOSUB 240\n 220 PRINT \" LEN OF STRING I$(4) IS \" LEN (I$(4))\n 230 END\n 240 GOSUB 250: PRINT PEEK (236) + PEEK (237) * 256: RETURN\n 250 POKE 236,12: POKE 237,0: IF PEEK (129) > 127 AND PEEK (130) < 128 THEN RETURN\n 260 POKE 236,5\n 270 IF PEEK (129) < 128 AND PEEK (130) > 127 GOTO 310STR\n 280 IF PEEK (131) + PEEK (132) * 256 < PEEK (107) + PEEK (108) * 256 THEN RETURN\n 290 IF PEEK (129) < 128 AND PEEK (130) < 128 THEN RETURN\n 300 POKE 236,2: IF PEEK (129) > 127 AND PEEK (130) > 127 THEN RETURN\n 310 IF PEEK (131) + PEEK (132) * 256 > = PEEK (107) + PEEK (108) * 256 THEN POKE 236,3\n 320 IF PEEK ( PEEK (131) + PEEK (132) * 256) + PEEK (236) > 255 THEN POKE 237,1: POKE 236, PEEK ( PEEK (131) + PEEK (132) * 256) + PEEK (236) - 256: RETURN\n 330 POKE 236, PEEK ( PEEK (131) + PEEK (132) * 256) + PEEK (236)\n 340 RETURN\n","language":"Applesoft-BASIC"},{"code":"VarSetCapacity(Var, 10240000) ; allocate 10 megabytes\nMsgBox % size := VarSetCapacity(Var) ; 10240000\n","language":"AutoHotkey"},{"code":"main:\n { (1 2 (3 4) 5 6)\n dup mu disp\n dup nva disp\n dup npt disp\n dup nlf disp\n dup nin disp\n dup nhref disp\n dup nhword disp }\n\ndisp! : { %d cr << }\n","language":"Babel"},{"code":"main : { (1 2 (3 4) 5 6) unload size %d << }\n","language":"Babel"},{"code":"10 REM this only works with strings\n20 PRINT LEN(variable$)\n","language":"BASIC"},{"code":"DIM a AS INTEGER, b AS LONG, c AS SINGLE, d AS DOUBLE, e AS STRING\nPRINT LEN(a), LEN(b), LEN(c), LEN(d), LEN(e)\n","language":"BASIC"},{"code":"i = 1\t\t\t#Integer\nf = 1.0\t\t\t#Float\ns$ = \"cad\"\t\t#String\ndim a(99)\t\t#Array\nA = {1, 2, 3}\t \t#Anonymous array\nm = {\"key\" -> 1} \t#Map\n\nprint typeof(i)\t\t# 1\nprint typeof(f)\t\t# 2\nprint typeof(s$)\t# 3\nprint typeof(A)\t\t# 4\nprint typeof(m)\t\t# 6\n","language":"BASIC256"},{"code":" DIM bstruct{b&}\n DIM istruct{i%}\n DIM fstruct{f}\n DIM dstruct{d#}\n DIM sstruct{s$}\n\n PRINT \"Size of b& is \";DIM(bstruct{})\n PRINT \"Size of i% is \";DIM(istruct{})\n PRINT \"Size of f is \";DIM(fstruct{})\n PRINT \"Size of d# is \";DIM(dstruct{})\n PRINT \"Size of s$ is \";DIM(sstruct{})\n","language":"BBC-BASIC"},{"code":"printf(\"An int contains %u bytes.\\n\", sizeof(int));\n","language":"C"},{"code":"#include <cstdlib>\nstd::size_t intsize = sizeof(int);\n","language":"C++"},{"code":"#include <climits>\n#include <cstdlib>\nstd::size_t intbits = CHAR_BITS*sizeof(int);\n","language":"C++"},{"code":"#include <cstdlib>\nint a = 1;\nstd::size_t a_size = sizeof a;\n","language":"C++"},{"code":"#include <cstdlib>\nstd::size_t size = sizeof (3*6 + 7.5);\n","language":"C++"},{"code":"class Program\n{\n static void Main(string[] args)\n {\n int i = sizeof(int);\n Console.WriteLine(i);\n Console.ReadLine();\n }\n}\n","language":"C-sharp"},{"code":" identification division.\n program-id. variable-size-get.\n\n environment division.\n configuration section.\n repository.\n function all intrinsic.\n\n data division.\n working-storage section.\n 01 bc-len constant as length of binary-char.\n 01 fd-34-len constant as length of float-decimal-34.\n\n 77 fixed-character pic x(13).\n 77 fixed-national pic n(13).\n 77 fixed-nine pic s9(5).\n 77 fixed-separate pic s9(5) sign trailing separate.\n 77 computable-field pic s9(5) usage computational-5.\n 77 formatted-field pic +z(4),9.\n\n 77 binary-field usage binary-double.\n 01 pointer-item usage pointer.\n\n 01 group-item.\n 05 first-inner pic x occurs 0 to 3 times depending on odo.\n 05 second-inner pic x occurs 0 to 5 times depending on odo-2.\n 01 odo usage index value 2.\n 01 odo-2 usage index value 4.\n\n procedure division.\n sample-main.\n display \"Size of:\"\n display \"BINARY-CHAR : \" bc-len\n display \" bc-len constant : \" byte-length(bc-len)\n display \"FLOAT-DECIMAL-34 : \" fd-34-len\n display \" fd-34-len constant : \" byte-length(fd-34-len)\n\n display \"PIC X(13) field : \" length of fixed-character\n display \"PIC N(13) field : \" length of fixed-national\n\n display \"PIC S9(5) field : \" length of fixed-nine\n display \"PIC S9(5) sign separate : \" length of fixed-separate\n display \"PIC S9(5) COMP-5 : \" length of computable-field\n\n display \"ALPHANUMERIC-EDITED : \" length(formatted-field)\n\n display \"BINARY-DOUBLE field : \" byte-length(binary-field)\n display \"POINTER field : \" length(pointer-item)\n >>IF P64 IS SET\n display \" sizeof(char *) > 4\"\n >>ELSE\n display \" sizeof(char *) = 4\"\n >>END-IF\n\n display \"Complex ODO at 2 and 4 : \" length of group-item\n set odo down by 1.\n set odo-2 up by 1.\n display \"Complex ODO at 1 and 5 : \" length(group-item)\n\n goback.\n end program variable-size-get.\n","language":"COBOL"},{"code":"(let ((a (cons 1 2))\n (b (make-array 10))\n (c \"a string\"))\n (list (hcl:find-object-size a)\n (hcl:find-object-size b)\n (hcl:find-object-size c)))\n","language":"Common-Lisp"},{"code":"(12 48 24)\n","language":"Common-Lisp"},{"code":"(let (items)\n (gc) ; name varies by implementation\n (room)\n (dotimes (x 512)\n (push (allocate-something-of-interest) items))\n (gc)\n (room))\n","language":"Common-Lisp"},{"code":"int i ;\nwritefln(i.sizeof) ; // print 4\nint[13] ints1 ; // static integer array of length 13\nwritefln(ints1.sizeof) ; // print 52\nint[] ints2 = new int[13] ; // dynamic integer array, variable length, currently 13\nwritefln(ints2.sizeof) ; // print 8, all dynamic array has this size\nwritefln(ints2.length) ; // print 13, length is the number of allocated element in aggregated type\n","language":"D"},{"code":"i := sizeof({any variable or data type identifier});\n","language":"Delphi"},{"code":"list = [1,2,3]\nIO.puts length(list) #=> 3\n\ntuple = {1,2,3,4}\nIO.puts tuple_size(tuple) #=> 4\n\nstring = \"Elixir\"\nIO.puts String.length(string) #=> 6\nIO.puts byte_size(string) #=> 6\nIO.puts bit_size(string) #=> 48\n\nutf8 = \"○×△\"\nIO.puts String.length(utf8) #=> 3\nIO.puts byte_size(utf8) #=> 8\nIO.puts bit_size(utf8) #=> 64\n\nbitstring = <<3 :: 2>>\nIO.puts byte_size(bitstring) #=> 1\nIO.puts bit_size(bitstring) #=> 2\n\nmap = Map.new([{:b, 1}, {:a, 2}])\nIO.puts map_size(map) #=> 2\n","language":"Elixir"},{"code":"USING: layouts memory prettyprint ;\n\n! Show size in bytes\n{ 1 2 3 } size . ! 48\n1231298302914891021239102 size . ! 48\n\n! Doesn't work on fixnums and other immediate objects\n10 size . ! 0\n\n! Show number of bits in a fixnum\nfixnum-bits . ! 60\n","language":"Factor"},{"code":": .CELLSIZE ( -- ) CR 1 CELLS . .\" Bytes\" ;\nVARIABLE X ( creates a variable 1 cell wide)\n","language":"Forth"},{"code":".CELLSIZE\n4 Bytes ok\n-1 X ! ok\nHEX X @ U. FFFFFFFF ok\n","language":"Forth"},{"code":"INTEGER, PARAMETER :: i8 = SELECTED_INT_KIND(2)\nINTEGER, PARAMETER :: i16 = SELECTED_INT_KIND(4)\nINTEGER, PARAMETER :: i32 = SELECTED_INT_KIND(8)\nINTEGER, PARAMETER :: i64 = SELECTED_INT_KIND(16)\nINTEGER(i8) :: onebyte = 0\nINTEGER(i16) :: twobytes = 0\nINTEGER(i32) :: fourbytes = 0\nINTEGER(i64) :: eightbytes = 0\n\nWRITE (*,*) BIT_SIZE(onebyte), DIGITS(onebyte) ! prints 8 and 7\nWRITE (*,*) BIT_SIZE(twobytes), DIGITS(twobytes) ! prints 16 and 15\nWRITE (*,*) BIT_SIZE(fourbytes), DIGITS(fourbytes) ! prints 32 and 31\nWRITE (*,*) BIT_SIZE(eightbytes), DIGITS(eightbytes) ! prints 64 and 63\nWRITE (*,*) DIGITS(0.0), DIGITS(0d0) ! prints 24 and 53\n","language":"Fortran"},{"code":"' FB 1.05.0 Win64\n\nDim i As Integer\nDim l As Long\nDim s As Short\nDim b As Byte\nPrint \"An integer occupies \"; SizeOf(i); \" bytes\"\nPrint \"A long occupies \"; SizeOf(l); \" bytes\"\nPrint \"A short occupies \"; SizeOf(s); \" bytes\"\nPrint \"A byte occupies \"; SizeOf(b); \" byte\"\n\n' or use type directly rather than a variable\n\nPrint \"A boolean occupies \"; SizeOf(Boolean); \" byte\"\nPrint \"A single occupies \"; SizeOf(Single); \" bytes\"\nPrint \"A double occupies \"; SizeOf(Double); \" bytes\"\n\nPrint\nPrint \"Press any key to quit\"\nSleep\n","language":"FreeBASIC"},{"code":"include \"NSLog.incl\"\n\nvoid local fn Doit\n NSLog(@\"%ld\",sizeof(long))\nend fn\n\nfn DoIt\n\nHandleEvents\n","language":"FutureBasic"},{"code":"Public Sub Main()\n\nPrint \"Boolean =\\t \" & SizeOf(gb.Boolean)\nPrint \"Byte =\\t\\t \" & SizeOf(gb.Byte)\nPrint \"Short =\\t\\t \" & SizeOf(gb.Short)\nPrint \"Integer =\\t \" & SizeOf(gb.Integer)\nPrint \"Single =\\t \" & SizeOf(gb.Single)\nPrint \"Long =\\t\\t \" & SizeOf(gb.Long)\nPrint \"Float =\\t\\t \" & SizeOf(gb.Float)\nPrint \"Date =\\t\\t \" & SizeOf(gb.Date)\nPrint \"String =\\t \" & SizeOf(gb.String)\nPrint \"Object =\\t \" & SizeOf(gb.Object)\nPrint \"Pointer =\\t \" & SizeOf(gb.Pointer)\nPrint \"Variant =\\t \" & SizeOf(gb.Variant)\n\nEnd\n","language":"Gambas"},{"code":"import \"unsafe\"\n\nunsafe.Sizeof(x)\n","language":"Go"},{"code":"package main\n\nimport (\n \"fmt\"\n \"reflect\"\n \"runtime\"\n \"unsafe\"\n)\n\nfunc main() {\n // unsafe.Sizeof returns the size in bytes.\n var i int\n fmt.Println(unsafe.Sizeof(i))\n // The size returned is that of the top level object and does not\n // include any referenced data. A type like string always returns\n // the same number, the size of the string header.\n fmt.Println(unsafe.Sizeof(\"Rosetta\"))\n fmt.Println(unsafe.Sizeof(\"Code\"))\n // For some untrusted environments, package unsafe is not available\n // but reflect is. The Size method of a type will return the same value\n // as unsafe.Sizeof.\n fmt.Println(reflect.TypeOf(\"Cod\").Size())\n // Some sizes are implementation dependent.\n fmt.Println(runtime.Version(), runtime.GOARCH)\n}\n","language":"Go"},{"code":"import Foreign\n\nsizeOf (undefined :: Int) -- size of Int in bytes (4 on mine)\nsizeOf (undefined :: Double) -- size of Double in bytes (8 on mine)\nsizeOf (undefined :: Bool) -- size of Bool in bytes (4 on mine)\nsizeOf (undefined :: Ptr a) -- size of Ptr in bytes (4 on mine)\n","language":"Haskell"},{"code":"record rec0()\nrecord rec4(a,b,c,d)\n\nprocedure main() # get size\n\nevery i := seq(1) do {\n a0 := &allocated\n x := case i of {\n 1 : \"ABCDEFGH\"\n 2 : reverse(x)\n 10 : &digits\n 11 : x--x\n 20 : []\n 21 : [1,2]\n 22 : [1,2,3]\n 30 : set()\n 31 : set(\"X\")\n 32 : set(\"A\",\"B\")\n 40 : table(1)\n 50 : rec0()\n 51 : rec4()\n 60 : create seq(1)\n 99 : break\n default : next\n }\n a1 := &allocated\n write(\"type=\",type(x),\" *x=\",*x,\" bytes allocated=\",a1-a0)\n }\nend\n","language":"Icon"},{"code":"arr = intarr(3,4)\nprint,size(arr)\n;=> prints this:\n 2 3 4 2 12\n","language":"IDL"},{"code":"some_variable =: 42\n7!:5<'some_variable'\n","language":"J"},{"code":"some_function =: +/ % #\n7!:5<'some_function'\n","language":"J"},{"code":"public final class VariableSize {\n\n\tpublic static void main(String[] aArgs) {\t\t\n\t\tSystem.out.println(\"A Byte variable occupies: \" + Byte.SIZE / 8 + \" byte\");\n\t\tSystem.out.println(\"A Char variable occupies: \" + Character.SIZE / 8 + \" bytes\");\n\t\tSystem.out.println(\"A Short variable occupies: \" + Short.SIZE / 8 + \" bytes\");\n\t\tSystem.out.println(\"A Float variable occupies: \" + Float.SIZE / 8 + \" bytes\");\n\t\tSystem.out.println(\"An Integer variable occupies: \" + Integer.SIZE / 8 + \" bytes\");\n\t\tSystem.out.println(\"A Double variable occupies: \" + Double.SIZE / 8 + \" bytes\");\t\t\n\t\tSystem.out.println(\"A Long variable occupies: \" + Long.SIZE / 8 + \" bytes\");\n\t}\n\n}\n","language":"Java"},{"code":"julia> sizeof(Int8)\n1\n\njulia> t = 1\n1\n\njulia> sizeof(t)\n8\n","language":"Julia"},{"code":"// version 1.1.2\n\nfun main(args: Array<String>) {\n /* sizes for variables of the primitive types (except Boolean which is JVM dependent) */\n println(\"A Byte variable occupies: ${java.lang.Byte.SIZE / 8} byte\")\n println(\"A Short variable occupies: ${java.lang.Short.SIZE / 8} bytes\")\n println(\"An Int variable occupies: ${java.lang.Integer.SIZE / 8} bytes\")\n println(\"A Long variable occupies: ${java.lang.Long.SIZE / 8} bytes\")\n println(\"A Float variable occupies: ${java.lang.Float.SIZE / 8} bytes\")\n println(\"A Double variable occupies: ${java.lang.Double.SIZE / 8} bytes\")\n println(\"A Char variable occupies: ${java.lang.Character.SIZE / 8} bytes\")\n}\n","language":"Kotlin"},{"code":"local(\n\tmystring\t= 'Hello World',\n\tmyarray\t\t= array('one', 'two', 3),\n\tmyinteger\t= 1234\n)\n\n// size of a string will be a character count\n#mystring -> size\n'<br />'\n\n// size of an array or map will be a count of elements\n#myarray -> size\n'<br />'\n\n// elements within an array can report size\n#myarray -> get(2) -> size\n'<br />'\n\n// integers or decimals does not have sizes\n//#myinteger -> size // will fail\n// an integer can however be converted to a string first\nstring(#myinteger) -> size\n","language":"Lasso"},{"code":"> s = \"hello\"\n> print(#s)\n5\n> t = { 1,2,3,4,5 }\n> print(#t)\n5\n","language":"Lua"},{"code":"ByteCount[\"somerandomstring\"]\n","language":"Mathematica"},{"code":"MODULE Size EXPORTS Main;\n\nFROM IO IMPORT Put;\nFROM Fmt IMPORT Int;\n\nBEGIN\n Put(\"Integer in bits: \" & Int(BITSIZE(INTEGER)) & \"\\n\");\n Put(\"Integer in bytes: \" & Int(BYTESIZE(INTEGER)) & \"\\n\");\nEND Size.\n","language":"Modula-3"},{"code":"echo \"An int contains \", sizeof(int), \" bytes.\"\n","language":"Nim"},{"code":"10 PRINT LEN(VARIABLE$)\n","language":"NS-HUBASIC"},{"code":"(** The result is the size given in word.\n The word size in octet can be found with (Sys.word_size / 8).\n (The size of all the datas in OCaml is at least one word, even chars and bools.)\n*)\nlet sizeof v =\n let rec rec_size d r =\n if List.memq r d then (1, d) else\n if not(Obj.is_block r) then (1, r::d) else\n if (Obj.tag r) = (Obj.double_tag) then (2, r::d) else\n if (Obj.tag r) = (Obj.string_tag) then (Obj.size r, r::d) else\n if (Obj.tag r) = (Obj.object_tag) ||\n (Obj.tag r) = (Obj.closure_tag)\n then invalid_arg \"please only provide datas\"\n else\n let len = Obj.size r in\n let rec aux d sum i =\n if i >= len then (sum, r::d) else\n let this = Obj.field r i in\n let this_size, d = rec_size d this in\n aux d (sum + this_size) (i+1)\n in\n aux d (1) 0\n in\n fst(rec_size [] (Obj.repr v))\n;;\n","language":"OCaml"},{"code":"# sizeof 234 ;;\n- : int = 1\n\n# sizeof 23.4 ;;\n- : int = 2\n\n# sizeof (1,2);;\n- : int = 3\n\n# sizeof (2, 3.4) ;;\n- : int = 4\n\n# sizeof (1,2,3,4,5) ;;\n- : int = 6\n\n# sizeof [| 1;2;3;4;5 |] ;;\n- : int = 6\n\n# sizeof [1;2;3;4;5] ;;\n- : int = 11\n\n(* because a list is equivalent to *)\n\n# sizeof (1,(2,(3,(4,(5,0))))) ;;\n- : int = 11\n\n# type foo = A | B of int | C of int * int ;;\ntype foo = A | B of int | C of int * int\n\n# sizeof A ;;\n- : int = 1\n\n# sizeof (B 3) ;;\n- : int = 2\n\n# sizeof (C(1,2)) ;;\n- : int = 3\n\n# sizeof true ;;\n- : int = 1\n\n# sizeof 'A' ;;\n- : int = 1\n\n# sizeof `some_pvar ;;\n- : int = 1\n\n# sizeof \"\" ;;\n- : int = 1\n\n# sizeof \"Hello!\" ;;\n- : int = 2\n(* remember the size is given in words\n (so 4 octets on 32 bits machines) *)\n\n# for i=0 to 16 do\n Printf.printf \"%d -> %d\\n\" i (sizeof(String.create i))\n done;;\n0 -> 1\n1 -> 1\n2 -> 1\n3 -> 1\n4 -> 2\n5 -> 2\n6 -> 2\n7 -> 2\n8 -> 3\n9 -> 3\n10 -> 3\n11 -> 3\n12 -> 4\n13 -> 4\n14 -> 4\n15 -> 4\n16 -> 5\n- : unit = ()\n\n# sizeof(Array.create 10 0) ;;\n- : int = 11\n\n# sizeof(Array.create 10 (String.create 20)) ;;\n- : int = 16\n\n# sizeof(Array.init 10 (fun _ -> String.create 20)) ;;\n- : int = 61\n","language":"OCaml"},{"code":"package main\n\nimport \"core:fmt\"\n\nmain :: proc() {\n fmt.println(\"An int contains\", size_of(int), \"bytes.\")\n}\n","language":"Odin"},{"code":"sizebyte(x)\n","language":"PARI-GP"},{"code":"lg(x)\n","language":"PARI-GP"},{"code":"use Devel::Size qw(size total_size);\n\nmy $var = 9384752;\nmy @arr = (1, 2, 3, 4, 5, 6);\nprint size($var); # 24\nprint total_size(\\@arr); # 256\n","language":"Perl"},{"code":"(phixonline)-->\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;\">\"An integer contains %d bytes.\\n\"</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #7060A8;\">machine_word</span><span style=\"color: #0000FF;\">())</span>\n<!--\n","language":"Phix"},{"code":"put skip list (SIZE(x)); /* gives the number of bytes occupied by X */\n /* whatever data type or structure it is. */\n\nput skip list (CURRENTSIZE(x));\n /* gives the current number of bytes of X */\n /* actually used by such things as a */\n /* varying-length string, including its */\n /* length field. */\n","language":"PL-I"},{"code":";;; Prints 0 because small integers need no heap storage\ndatasize(12) =>\n;;; Prints 3: 3 character fits into single machine word, 1 word\n;;; for tag, 1 for length\ndatasize('str') =>\n;;; 3 element vector takes 5 words: 3 for values, 1 for tag, 1 for\n;;; length\ndatasize({1 2 3}) =>\n;;; Prints 3 because only first node counts\ndatasize([1 2 3]) =>\n","language":"Pop11"},{"code":"Define a\nDebug SizeOf(a)\n; This also works for structured variables\n","language":"PureBasic"},{"code":">>> from array import array\n>>> argslist = [('l', []), ('c', 'hello world'), ('u', u'hello \\u2641'),\n\t('l', [1, 2, 3, 4, 5]), ('d', [1.0, 2.0, 3.14])]\n>>> for typecode, initializer in argslist:\n\ta = array(typecode, initializer)\n\tprint a, '\\tSize =', a.buffer_info()[1] * a.itemsize\n\tdel a\n\n\t\narray('l') \tSize = 0\narray('c', 'hello world') \tSize = 11\narray('u', u'hello \\u2641') \tSize = 14\narray('l', [1, 2, 3, 4, 5]) \tSize = 20\narray('d', [1.0, 2.0, 3.1400000000000001]) \tSize = 24\n>>>\n","language":"Python"},{"code":"import sys\nsys.getsizeof(obj)\n","language":"Python"},{"code":"# Results are system dependent\nnum <- c(1, 3, 6, 10)\nobject.size(num) # e.g. 56 bytes\n\n#Allocating vectors using ':' results in less memory being (reportedly) used\nnum2 <- 1:4\nobject.size(num2) # e.g. 40 bytes\n\n#Memory shared by objects isn't always counted\nl <- list(a=c(1, 3, 6, 10), b=1:4)\nobject.size(l) # e.g. 280 bytes\n\nl2 <- list(num, num2)\nobject.size(l2) # e.g. 128 bytes\n","language":"R"},{"code":"#lang racket\n(require ffi/unsafe)\n(define-syntax-rule (sizes t ...)\n (begin (printf \"sizeof(~a) = ~a\\n\" 't (ctype-sizeof t)) ...))\n(sizes _byte _short _int _long _llong _float _double)\n","language":"Racket"},{"code":"# Textual strings are measured in characters (graphemes)\nmy $string = \"abc\";\n\n# Arrays are measured in elements.\nsay $string.chars; # 3\nmy @array = 1..5;\nsay @array.elems; # 5\n\n# Buffers may be viewed either as a byte-string or as an array of elements.\nmy $buffer = '#56997; means \"four dragons\".'.encode('utf8');\nsay $buffer.bytes; # 26\nsay $buffer.elems; # 26\n","language":"Raku"},{"code":"/*REXX program demonstrates (see the penultimate statement) how to */\n/* to find the size (length) of the value of a REXX variable. */\n\n/*REXX doesn't reserve any storage for any variables, as all variables */\n/*are stored as character strings, including boolean. Storage is */\n/*obtained as necessary when REXX variables are assigned (or reassigned)*/\n\na = 456 /*length of A is 3 */\nb = \"heptathlon\" /*length of B is 10 */\nc = \"heptathlon (7 events)\" /*length of C is 21 */\nd = '' /*length of D is 0 */\nd = \"\" /*same as above. */\nd = left('space junk' ,0) /*same as above. */\nd = /*same as above. */\ne = 99-9 /*length of E is 2 (e=90) */\nf = copies(a,100) /*length of F is 300 (a=456)*/\ng.1 = -1 /*length of G.1 is 2 */\ng.2 = -1.0000 /*length of G.2 is 7 */\n /*length of HHH is 3 */\n\n /*Note that when a REXX variable */\n /*isn't SET, then the value of it*/\n /*is the uppercased name itself, */\n /*so in this case (upper): HHH */\n\nsomething = copies(a, random(100)) /*length is something, all right,*/\n /*could be 3 to 300 bytes, by gum*/\nthingLen = length(something) /*use LENGTH bif to find its len.*/\nsay 'length of SOMETHING =' thingLen /*display the length of SOMETHING*/\n\n/*┌────────────────────────────────────────────────────────────────────┐\n │ Note that the variable's data (value) isn't the true cost of the │\n │ size of the variable's value. REXX also keeps the name of │\n │ the (fully qualified) variable as well. │\n │ │\n │ Most REXX interpreters keep (at a miminum): │\n │ │\n │ ∙ a four-byte field which contains the length of the value │\n │ ∙ a four-byte field which contains the length of the var name │\n │ ∙ an N-byte field which contains the name of the variable │\n │ ∙ an X-byte field which contains the variable's value │\n │ ∙ a one-byte field which contains the status of the variable │\n │ │\n │ [Note that PC/REXX uses a two-byte field for the first two fields] │\n │ │\n │ │\n │ Consider the following two DO loops assigning a million variables: │\n │ │\n │ do j=1 to 1000000 │\n │ integer_numbers.j=j │\n │ end │\n │ ════════ and ════════ │\n │ do k=1 to 1000000 │\n │ #.k=k │\n │ end │\n │ │\n │ The \"j\" loop uses 35,777,792 bytes for the compound variables, │\n │ The \"k\" loop uses 21,777,792 bytes for the compound variables, │\n │ (excluding the DO loop indices [j and k] themselves). │\n └────────────────────────────────────────────────────────────────────┘*/\n","language":"REXX"},{"code":"list1 = list(2)\nlist2 = list(4)\nlist3 = list(6)\nlist4 = list(7)\nlist5 = list(5)\n\nsee \"Size of list1 is : \" + len(list1) + nl\nsee \"Size of list2 is : \" + len(list2) + nl\nsee \"Size of list3 is : \" + len(list3) + nl\nsee \"Size of list4 is : \" + len(list4) + nl\nsee \"Size of list5 is : \" + len(list5) + nl\n","language":"Ring"},{"code":"require 'objspace'\n\np ObjectSpace.memsize_of(\"a\"*23) #=> 0\np ObjectSpace.memsize_of(\"a\"*24) #=> 25\np ObjectSpace.memsize_of(\"a\"*1000) #=> 1001\n","language":"Ruby"},{"code":"use std::mem;\n\nfn main() {\n // Specify type\n assert_eq!(4, mem::size_of::<i32>());\n\n // Provide a value\n let arr: [u16; 3] = [1, 2, 3];\n assert_eq!(6, mem::size_of_val(&arr));\n}\n","language":"Rust"},{"code":" def nBytes(x: Double) = ((Math.log(x) / Math.log(2) + 1e-10).round + 1) / 8\n\n val primitives: List[(Any, Long)] =\n List((Byte, Byte.MaxValue),\n (Short, Short.MaxValue),\n (Int, Int.MaxValue),\n (Long, Long.MaxValue))\n\n primitives.foreach(t => println(f\"A Scala ${t._1.toString.drop(13)}%-5s has ${nBytes(t._2)} bytes\"))\n","language":"Scala"},{"code":"sizeofValue(x)\n","language":"Swift"},{"code":"// sizeof and sizeofValue return the size in bytes.\nprintln(sizeof(Int))\nvar i: Int = 42\nprintln(sizeofValue(i))\n// The size returned is that of the top level value and does not\n// include any referenced data. A type like String always returns\n// the same number, the size of the String struct.\nprintln(sizeofValue(\"Rosetta\"))\nprintln(sizeofValue(\"Code\"))}\n","language":"Swift"},{"code":"string bytelength $var\n","language":"Tcl"},{"code":"char-size .\ncell-size .\n","language":"Toka"},{"code":"needs floats\nfloat-size .\n","language":"Toka"},{"code":"$$ MODE TUSCRIPT,{}\nstring=\"somerandomstring\"\nsize=SIZE(string)\nlength=LENGTH(string)\n\nPRINT \"string: \",string\nPRINT \"has size: \",size\nPRINT \"and length: \",length\n","language":"TUSCRIPT"},{"code":"struct foo {\n uint32_t x : 17;\n uint8_t y : 3;\n char z[16];\n};\n","language":"TXR"},{"code":"# In the shell all variables are stored as strings, so we use the same technique\n# as for finding the length of a string:\ngreeting='Hello, world!'\ngreetinglength=`printf '%s' \"$greeting\" | wc -c`\necho \"The greeting is $greetinglength characters in length\"\n","language":"UNIX-Shell"},{"code":"#import std\n\n#cast %nL\n\nexamples = <weight 'hello',mpfr..prec 1.0E+0>\n","language":"Ursala"},{"code":"sizeof(i64)\n","language":"V-(Vlang)"},{"code":"void main(){\n /* you can replace the int below with any of the vala supported datatypes\n see the vala documentation for valid datatypes.\n */\n print(@\"$(sizeof(int))\\n\");\n}\n","language":"Vala"},{"code":"include c:\\cxpl\\codes;\nint Size;\nint A, B;\nreal X, Y;\n[Size:= addr B - addr A;\nIntOut(0, Size); CrLf(0);\nSize:= addr Y - addr X;\nIntOut(0, Size); CrLf(0);\n]\n","language":"XPL0"},{"code":"print frnfn_size(\"uint8\")\t\t//1\nprint frnfn_size(\"int8\")\t\t//1\nprint frnfn_size(\"uint16\")\t\t//2\nprint frnfn_size(\"int16\")\t\t//2\nprint frnfn_size(\"uint32\")\t\t//4\nprint frnfn_size(\"int32\")\t\t//4\nprint frnfn_size(\"uint64\")\t\t//8\nprint frnfn_size(\"int64\")\t\t//8\nprint frnfn_size(\"float\")\t\t//4\nprint frnfn_size(\"double\")\t\t//8\nprint frnfn_size(\"char\")\t\t//1\nprint frnfn_size(\"int\")\t\t\t//4\nprint frnfn_size(\"short\")\t\t//2\n","language":"Yabasic"},{"code":"(123).len() //-->1 (byte)\n(0).MAX.len() //-->8 (bytes), ie the max number of bytes in an int\n(1.0).MAX.len() //-->8 (bytes), ie the max number of bytes in an float\n\"this is a test\".len() //-->14\nL(1,2,3,4).len() //-->4\nDictionary(\"1\",1, \"2\",2).len() //-->2 (keys)\nData(0,Int,1,2,3,4).len() //-->4 (bytes)\nData(0,String,\"1\",\"2\",\"3\",\"4\").len() //-->8 bytes (ASCIIZ)\n","language":"Zkl"}],"string":"[\n {\n \"code\": \"---\\nfrom: http://rosettacode.org/wiki/Variable_size/Get\\nnote: Type System\\n\",\n \"language\": \"00-META\"\n },\n {\n \"code\": \"Demonstrate how to get the size of a variable.\\n\\nSee also: [[Host introspection]]\\n\\n\",\n \"language\": \"00-TASK\"\n },\n {\n \"code\": \"Int64 i\\nprint(T(i).size)\\nprint(Int64.size)\\n\",\n \"language\": \"11l\"\n },\n {\n \"code\": \"package {\\n\\n import flash.display.Sprite;\\n import flash.events.Event;\\n import flash.sampler.getSize;\\n\\n public class VariableSizeGet extends Sprite {\\n\\n public function VariableSizeGet() {\\n if ( stage ) _init();\\n else addEventListener(Event.ADDED_TO_STAGE, _init);\\n }\\n\\n private function _init(e:Event = null):void {\\n\\n var i:int = 1;\\n var n:Number = 0.5;\\n var s:String = \\\"abc\\\";\\n var b:Boolean = true;\\n var date:Date = new Date();\\n\\n trace(\\\"An int contains \\\" + getSize(i) + \\\" bytes.\\\"); // 4\\n trace(\\\"A Number contains \\\" + getSize(n) + \\\" bytes.\\\"); // 8\\n trace(\\\"The string 'abc' contains \\\" + getSize(s) + \\\" bytes.\\\"); // 24\\n trace(\\\"A Boolean contains \\\" + getSize(b) + \\\" bytes.\\\"); // 4\\n trace(\\\"A Date object contains \\\" + getSize(date) + \\\" bytes.\\\"); // 48\\n\\n }\\n\\n }\\n\\n}\\n\",\n \"language\": \"ActionScript\"\n },\n {\n \"code\": \"Int_Bits : constant Integer := Integer'size;\\nWhole_Bytes : constant Integer := Int_Bits / Storage_Unit; -- Storage_Unit is the number of bits per storage element\\n\",\n \"language\": \"Ada\"\n },\n {\n \"code\": \"INT i; BYTES b; # typically INT and BYTES are the same size #\\nSTRING s:=\\\"DCLXVI\\\", [666]CHAR c;\\nprint((\\n \\\"sizeof INT i =\\\",bytes width, new line,\\n \\\"UPB STRING s =\\\",UPB s, new line,\\n \\\"UPB []CHAR c =\\\",UPB c, new line\\n))\\n\",\n \"language\": \"ALGOL-68\"\n },\n {\n \"code\": \" 100 PRINT \\\"SIZE OF INTEGER I% IS \\\";:I% = I%: GOSUB 240\\n 110 PRINT \\\"SIZE OF FLOAT I IS \\\";:I = I: GOSUB 240\\n 120 PRINT \\\"SIZE OF STRING I$ IS \\\";:I$ = I$: GOSUB 240\\n 130 PRINT \\\" LEN OF STRING I$ IS \\\" LEN (I$)\\n 140 PRINT \\\"SIZE OF FLOAT ARG N IS \\\";: DEF FN I(N) = 0: GOSUB 240\\n 150 PRINT \\\"SIZE OF FUNCTION FN I IS \\\";: PRINT MID$ ( STR$ ( FN I(0)),1,0);: GOSUB 240\\n 160 PRINT \\\"ARRAYS:\\\"\\n 170 PRINT \\\"SIZE OF FLOAT I(1) IS \\\";:I(1) = I(1): GOSUB 240\\n 180 PRINT \\\"SIZE OF INTEGER I%(2) IS \\\";:I%(2) = I%(2): GOSUB 240\\n 190 PRINT \\\"SIZE OF STRING I$(3) IS \\\";:I$(3) = I$(3): GOSUB 240\\n 200 PRINT \\\" LEN OF STRING I$(3) IS \\\" LEN (I$(3))\\n 210 PRINT \\\"SIZE OF STRING I$(4) IS \\\";:I$(4) = \\\"HELLO, WORLD!\\\": GOSUB 240\\n 220 PRINT \\\" LEN OF STRING I$(4) IS \\\" LEN (I$(4))\\n 230 END\\n 240 GOSUB 250: PRINT PEEK (236) + PEEK (237) * 256: RETURN\\n 250 POKE 236,12: POKE 237,0: IF PEEK (129) > 127 AND PEEK (130) < 128 THEN RETURN\\n 260 POKE 236,5\\n 270 IF PEEK (129) < 128 AND PEEK (130) > 127 GOTO 310STR\\n 280 IF PEEK (131) + PEEK (132) * 256 < PEEK (107) + PEEK (108) * 256 THEN RETURN\\n 290 IF PEEK (129) < 128 AND PEEK (130) < 128 THEN RETURN\\n 300 POKE 236,2: IF PEEK (129) > 127 AND PEEK (130) > 127 THEN RETURN\\n 310 IF PEEK (131) + PEEK (132) * 256 > = PEEK (107) + PEEK (108) * 256 THEN POKE 236,3\\n 320 IF PEEK ( PEEK (131) + PEEK (132) * 256) + PEEK (236) > 255 THEN POKE 237,1: POKE 236, PEEK ( PEEK (131) + PEEK (132) * 256) + PEEK (236) - 256: RETURN\\n 330 POKE 236, PEEK ( PEEK (131) + PEEK (132) * 256) + PEEK (236)\\n 340 RETURN\\n\",\n \"language\": \"Applesoft-BASIC\"\n },\n {\n \"code\": \"VarSetCapacity(Var, 10240000) ; allocate 10 megabytes\\nMsgBox % size := VarSetCapacity(Var) ; 10240000\\n\",\n \"language\": \"AutoHotkey\"\n },\n {\n \"code\": \"main:\\n { (1 2 (3 4) 5 6)\\n dup mu disp\\n dup nva disp\\n dup npt disp\\n dup nlf disp\\n dup nin disp\\n dup nhref disp\\n dup nhword disp }\\n\\ndisp! : { %d cr << }\\n\",\n \"language\": \"Babel\"\n },\n {\n \"code\": \"main : { (1 2 (3 4) 5 6) unload size %d << }\\n\",\n \"language\": \"Babel\"\n },\n {\n \"code\": \"10 REM this only works with strings\\n20 PRINT LEN(variable$)\\n\",\n \"language\": \"BASIC\"\n },\n {\n \"code\": \"DIM a AS INTEGER, b AS LONG, c AS SINGLE, d AS DOUBLE, e AS STRING\\nPRINT LEN(a), LEN(b), LEN(c), LEN(d), LEN(e)\\n\",\n \"language\": \"BASIC\"\n },\n {\n \"code\": \"i = 1\\t\\t\\t#Integer\\nf = 1.0\\t\\t\\t#Float\\ns$ = \\\"cad\\\"\\t\\t#String\\ndim a(99)\\t\\t#Array\\nA = {1, 2, 3}\\t \\t#Anonymous array\\nm = {\\\"key\\\" -> 1} \\t#Map\\n\\nprint typeof(i)\\t\\t# 1\\nprint typeof(f)\\t\\t# 2\\nprint typeof(s$)\\t# 3\\nprint typeof(A)\\t\\t# 4\\nprint typeof(m)\\t\\t# 6\\n\",\n \"language\": \"BASIC256\"\n },\n {\n \"code\": \" DIM bstruct{b&}\\n DIM istruct{i%}\\n DIM fstruct{f}\\n DIM dstruct{d#}\\n DIM sstruct{s$}\\n\\n PRINT \\\"Size of b& is \\\";DIM(bstruct{})\\n PRINT \\\"Size of i% is \\\";DIM(istruct{})\\n PRINT \\\"Size of f is \\\";DIM(fstruct{})\\n PRINT \\\"Size of d# is \\\";DIM(dstruct{})\\n PRINT \\\"Size of s$ is \\\";DIM(sstruct{})\\n\",\n \"language\": \"BBC-BASIC\"\n },\n {\n \"code\": \"printf(\\\"An int contains %u bytes.\\\\n\\\", sizeof(int));\\n\",\n \"language\": \"C\"\n },\n {\n \"code\": \"#include <cstdlib>\\nstd::size_t intsize = sizeof(int);\\n\",\n \"language\": \"C++\"\n },\n {\n \"code\": \"#include <climits>\\n#include <cstdlib>\\nstd::size_t intbits = CHAR_BITS*sizeof(int);\\n\",\n \"language\": \"C++\"\n },\n {\n \"code\": \"#include <cstdlib>\\nint a = 1;\\nstd::size_t a_size = sizeof a;\\n\",\n \"language\": \"C++\"\n },\n {\n \"code\": \"#include <cstdlib>\\nstd::size_t size = sizeof (3*6 + 7.5);\\n\",\n \"language\": \"C++\"\n },\n {\n \"code\": \"class Program\\n{\\n static void Main(string[] args)\\n {\\n int i = sizeof(int);\\n Console.WriteLine(i);\\n Console.ReadLine();\\n }\\n}\\n\",\n \"language\": \"C-sharp\"\n },\n {\n \"code\": \" identification division.\\n program-id. variable-size-get.\\n\\n environment division.\\n configuration section.\\n repository.\\n function all intrinsic.\\n\\n data division.\\n working-storage section.\\n 01 bc-len constant as length of binary-char.\\n 01 fd-34-len constant as length of float-decimal-34.\\n\\n 77 fixed-character pic x(13).\\n 77 fixed-national pic n(13).\\n 77 fixed-nine pic s9(5).\\n 77 fixed-separate pic s9(5) sign trailing separate.\\n 77 computable-field pic s9(5) usage computational-5.\\n 77 formatted-field pic +z(4),9.\\n\\n 77 binary-field usage binary-double.\\n 01 pointer-item usage pointer.\\n\\n 01 group-item.\\n 05 first-inner pic x occurs 0 to 3 times depending on odo.\\n 05 second-inner pic x occurs 0 to 5 times depending on odo-2.\\n 01 odo usage index value 2.\\n 01 odo-2 usage index value 4.\\n\\n procedure division.\\n sample-main.\\n display \\\"Size of:\\\"\\n display \\\"BINARY-CHAR : \\\" bc-len\\n display \\\" bc-len constant : \\\" byte-length(bc-len)\\n display \\\"FLOAT-DECIMAL-34 : \\\" fd-34-len\\n display \\\" fd-34-len constant : \\\" byte-length(fd-34-len)\\n\\n display \\\"PIC X(13) field : \\\" length of fixed-character\\n display \\\"PIC N(13) field : \\\" length of fixed-national\\n\\n display \\\"PIC S9(5) field : \\\" length of fixed-nine\\n display \\\"PIC S9(5) sign separate : \\\" length of fixed-separate\\n display \\\"PIC S9(5) COMP-5 : \\\" length of computable-field\\n\\n display \\\"ALPHANUMERIC-EDITED : \\\" length(formatted-field)\\n\\n display \\\"BINARY-DOUBLE field : \\\" byte-length(binary-field)\\n display \\\"POINTER field : \\\" length(pointer-item)\\n >>IF P64 IS SET\\n display \\\" sizeof(char *) > 4\\\"\\n >>ELSE\\n display \\\" sizeof(char *) = 4\\\"\\n >>END-IF\\n\\n display \\\"Complex ODO at 2 and 4 : \\\" length of group-item\\n set odo down by 1.\\n set odo-2 up by 1.\\n display \\\"Complex ODO at 1 and 5 : \\\" length(group-item)\\n\\n goback.\\n end program variable-size-get.\\n\",\n \"language\": \"COBOL\"\n },\n {\n \"code\": \"(let ((a (cons 1 2))\\n (b (make-array 10))\\n (c \\\"a string\\\"))\\n (list (hcl:find-object-size a)\\n (hcl:find-object-size b)\\n (hcl:find-object-size c)))\\n\",\n \"language\": \"Common-Lisp\"\n },\n {\n \"code\": \"(12 48 24)\\n\",\n \"language\": \"Common-Lisp\"\n },\n {\n \"code\": \"(let (items)\\n (gc) ; name varies by implementation\\n (room)\\n (dotimes (x 512)\\n (push (allocate-something-of-interest) items))\\n (gc)\\n (room))\\n\",\n \"language\": \"Common-Lisp\"\n },\n {\n \"code\": \"int i ;\\nwritefln(i.sizeof) ; // print 4\\nint[13] ints1 ; // static integer array of length 13\\nwritefln(ints1.sizeof) ; // print 52\\nint[] ints2 = new int[13] ; // dynamic integer array, variable length, currently 13\\nwritefln(ints2.sizeof) ; // print 8, all dynamic array has this size\\nwritefln(ints2.length) ; // print 13, length is the number of allocated element in aggregated type\\n\",\n \"language\": \"D\"\n },\n {\n \"code\": \"i := sizeof({any variable or data type identifier});\\n\",\n \"language\": \"Delphi\"\n },\n {\n \"code\": \"list = [1,2,3]\\nIO.puts length(list) #=> 3\\n\\ntuple = {1,2,3,4}\\nIO.puts tuple_size(tuple) #=> 4\\n\\nstring = \\\"Elixir\\\"\\nIO.puts String.length(string) #=> 6\\nIO.puts byte_size(string) #=> 6\\nIO.puts bit_size(string) #=> 48\\n\\nutf8 = \\\"○×△\\\"\\nIO.puts String.length(utf8) #=> 3\\nIO.puts byte_size(utf8) #=> 8\\nIO.puts bit_size(utf8) #=> 64\\n\\nbitstring = <<3 :: 2>>\\nIO.puts byte_size(bitstring) #=> 1\\nIO.puts bit_size(bitstring) #=> 2\\n\\nmap = Map.new([{:b, 1}, {:a, 2}])\\nIO.puts map_size(map) #=> 2\\n\",\n \"language\": \"Elixir\"\n },\n {\n \"code\": \"USING: layouts memory prettyprint ;\\n\\n! Show size in bytes\\n{ 1 2 3 } size . ! 48\\n1231298302914891021239102 size . ! 48\\n\\n! Doesn't work on fixnums and other immediate objects\\n10 size . ! 0\\n\\n! Show number of bits in a fixnum\\nfixnum-bits . ! 60\\n\",\n \"language\": \"Factor\"\n },\n {\n \"code\": \": .CELLSIZE ( -- ) CR 1 CELLS . .\\\" Bytes\\\" ;\\nVARIABLE X ( creates a variable 1 cell wide)\\n\",\n \"language\": \"Forth\"\n },\n {\n \"code\": \".CELLSIZE\\n4 Bytes ok\\n-1 X ! ok\\nHEX X @ U. FFFFFFFF ok\\n\",\n \"language\": \"Forth\"\n },\n {\n \"code\": \"INTEGER, PARAMETER :: i8 = SELECTED_INT_KIND(2)\\nINTEGER, PARAMETER :: i16 = SELECTED_INT_KIND(4)\\nINTEGER, PARAMETER :: i32 = SELECTED_INT_KIND(8)\\nINTEGER, PARAMETER :: i64 = SELECTED_INT_KIND(16)\\nINTEGER(i8) :: onebyte = 0\\nINTEGER(i16) :: twobytes = 0\\nINTEGER(i32) :: fourbytes = 0\\nINTEGER(i64) :: eightbytes = 0\\n\\nWRITE (*,*) BIT_SIZE(onebyte), DIGITS(onebyte) ! prints 8 and 7\\nWRITE (*,*) BIT_SIZE(twobytes), DIGITS(twobytes) ! prints 16 and 15\\nWRITE (*,*) BIT_SIZE(fourbytes), DIGITS(fourbytes) ! prints 32 and 31\\nWRITE (*,*) BIT_SIZE(eightbytes), DIGITS(eightbytes) ! prints 64 and 63\\nWRITE (*,*) DIGITS(0.0), DIGITS(0d0) ! prints 24 and 53\\n\",\n \"language\": \"Fortran\"\n },\n {\n \"code\": \"' FB 1.05.0 Win64\\n\\nDim i As Integer\\nDim l As Long\\nDim s As Short\\nDim b As Byte\\nPrint \\\"An integer occupies \\\"; SizeOf(i); \\\" bytes\\\"\\nPrint \\\"A long occupies \\\"; SizeOf(l); \\\" bytes\\\"\\nPrint \\\"A short occupies \\\"; SizeOf(s); \\\" bytes\\\"\\nPrint \\\"A byte occupies \\\"; SizeOf(b); \\\" byte\\\"\\n\\n' or use type directly rather than a variable\\n\\nPrint \\\"A boolean occupies \\\"; SizeOf(Boolean); \\\" byte\\\"\\nPrint \\\"A single occupies \\\"; SizeOf(Single); \\\" bytes\\\"\\nPrint \\\"A double occupies \\\"; SizeOf(Double); \\\" bytes\\\"\\n\\nPrint\\nPrint \\\"Press any key to quit\\\"\\nSleep\\n\",\n \"language\": \"FreeBASIC\"\n },\n {\n \"code\": \"include \\\"NSLog.incl\\\"\\n\\nvoid local fn Doit\\n NSLog(@\\\"%ld\\\",sizeof(long))\\nend fn\\n\\nfn DoIt\\n\\nHandleEvents\\n\",\n \"language\": \"FutureBasic\"\n },\n {\n \"code\": \"Public Sub Main()\\n\\nPrint \\\"Boolean =\\\\t \\\" & SizeOf(gb.Boolean)\\nPrint \\\"Byte =\\\\t\\\\t \\\" & SizeOf(gb.Byte)\\nPrint \\\"Short =\\\\t\\\\t \\\" & SizeOf(gb.Short)\\nPrint \\\"Integer =\\\\t \\\" & SizeOf(gb.Integer)\\nPrint \\\"Single =\\\\t \\\" & SizeOf(gb.Single)\\nPrint \\\"Long =\\\\t\\\\t \\\" & SizeOf(gb.Long)\\nPrint \\\"Float =\\\\t\\\\t \\\" & SizeOf(gb.Float)\\nPrint \\\"Date =\\\\t\\\\t \\\" & SizeOf(gb.Date)\\nPrint \\\"String =\\\\t \\\" & SizeOf(gb.String)\\nPrint \\\"Object =\\\\t \\\" & SizeOf(gb.Object)\\nPrint \\\"Pointer =\\\\t \\\" & SizeOf(gb.Pointer)\\nPrint \\\"Variant =\\\\t \\\" & SizeOf(gb.Variant)\\n\\nEnd\\n\",\n \"language\": \"Gambas\"\n },\n {\n \"code\": \"import \\\"unsafe\\\"\\n\\nunsafe.Sizeof(x)\\n\",\n \"language\": \"Go\"\n },\n {\n \"code\": \"package main\\n\\nimport (\\n \\\"fmt\\\"\\n \\\"reflect\\\"\\n \\\"runtime\\\"\\n \\\"unsafe\\\"\\n)\\n\\nfunc main() {\\n // unsafe.Sizeof returns the size in bytes.\\n var i int\\n fmt.Println(unsafe.Sizeof(i))\\n // The size returned is that of the top level object and does not\\n // include any referenced data. A type like string always returns\\n // the same number, the size of the string header.\\n fmt.Println(unsafe.Sizeof(\\\"Rosetta\\\"))\\n fmt.Println(unsafe.Sizeof(\\\"Code\\\"))\\n // For some untrusted environments, package unsafe is not available\\n // but reflect is. The Size method of a type will return the same value\\n // as unsafe.Sizeof.\\n fmt.Println(reflect.TypeOf(\\\"Cod\\\").Size())\\n // Some sizes are implementation dependent.\\n fmt.Println(runtime.Version(), runtime.GOARCH)\\n}\\n\",\n \"language\": \"Go\"\n },\n {\n \"code\": \"import Foreign\\n\\nsizeOf (undefined :: Int) -- size of Int in bytes (4 on mine)\\nsizeOf (undefined :: Double) -- size of Double in bytes (8 on mine)\\nsizeOf (undefined :: Bool) -- size of Bool in bytes (4 on mine)\\nsizeOf (undefined :: Ptr a) -- size of Ptr in bytes (4 on mine)\\n\",\n \"language\": \"Haskell\"\n },\n {\n \"code\": \"record rec0()\\nrecord rec4(a,b,c,d)\\n\\nprocedure main() # get size\\n\\nevery i := seq(1) do {\\n a0 := &allocated\\n x := case i of {\\n 1 : \\\"ABCDEFGH\\\"\\n 2 : reverse(x)\\n 10 : &digits\\n 11 : x--x\\n 20 : []\\n 21 : [1,2]\\n 22 : [1,2,3]\\n 30 : set()\\n 31 : set(\\\"X\\\")\\n 32 : set(\\\"A\\\",\\\"B\\\")\\n 40 : table(1)\\n 50 : rec0()\\n 51 : rec4()\\n 60 : create seq(1)\\n 99 : break\\n default : next\\n }\\n a1 := &allocated\\n write(\\\"type=\\\",type(x),\\\" *x=\\\",*x,\\\" bytes allocated=\\\",a1-a0)\\n }\\nend\\n\",\n \"language\": \"Icon\"\n },\n {\n \"code\": \"arr = intarr(3,4)\\nprint,size(arr)\\n;=> prints this:\\n 2 3 4 2 12\\n\",\n \"language\": \"IDL\"\n },\n {\n \"code\": \"some_variable =: 42\\n7!:5<'some_variable'\\n\",\n \"language\": \"J\"\n },\n {\n \"code\": \"some_function =: +/ % #\\n7!:5<'some_function'\\n\",\n \"language\": \"J\"\n },\n {\n \"code\": \"public final class VariableSize {\\n\\n\\tpublic static void main(String[] aArgs) {\\t\\t\\n\\t\\tSystem.out.println(\\\"A Byte variable occupies: \\\" + Byte.SIZE / 8 + \\\" byte\\\");\\n\\t\\tSystem.out.println(\\\"A Char variable occupies: \\\" + Character.SIZE / 8 + \\\" bytes\\\");\\n\\t\\tSystem.out.println(\\\"A Short variable occupies: \\\" + Short.SIZE / 8 + \\\" bytes\\\");\\n\\t\\tSystem.out.println(\\\"A Float variable occupies: \\\" + Float.SIZE / 8 + \\\" bytes\\\");\\n\\t\\tSystem.out.println(\\\"An Integer variable occupies: \\\" + Integer.SIZE / 8 + \\\" bytes\\\");\\n\\t\\tSystem.out.println(\\\"A Double variable occupies: \\\" + Double.SIZE / 8 + \\\" bytes\\\");\\t\\t\\n\\t\\tSystem.out.println(\\\"A Long variable occupies: \\\" + Long.SIZE / 8 + \\\" bytes\\\");\\n\\t}\\n\\n}\\n\",\n \"language\": \"Java\"\n },\n {\n \"code\": \"julia> sizeof(Int8)\\n1\\n\\njulia> t = 1\\n1\\n\\njulia> sizeof(t)\\n8\\n\",\n \"language\": \"Julia\"\n },\n {\n \"code\": \"// version 1.1.2\\n\\nfun main(args: Array<String>) {\\n /* sizes for variables of the primitive types (except Boolean which is JVM dependent) */\\n println(\\\"A Byte variable occupies: ${java.lang.Byte.SIZE / 8} byte\\\")\\n println(\\\"A Short variable occupies: ${java.lang.Short.SIZE / 8} bytes\\\")\\n println(\\\"An Int variable occupies: ${java.lang.Integer.SIZE / 8} bytes\\\")\\n println(\\\"A Long variable occupies: ${java.lang.Long.SIZE / 8} bytes\\\")\\n println(\\\"A Float variable occupies: ${java.lang.Float.SIZE / 8} bytes\\\")\\n println(\\\"A Double variable occupies: ${java.lang.Double.SIZE / 8} bytes\\\")\\n println(\\\"A Char variable occupies: ${java.lang.Character.SIZE / 8} bytes\\\")\\n}\\n\",\n \"language\": \"Kotlin\"\n },\n {\n \"code\": \"local(\\n\\tmystring\\t= 'Hello World',\\n\\tmyarray\\t\\t= array('one', 'two', 3),\\n\\tmyinteger\\t= 1234\\n)\\n\\n// size of a string will be a character count\\n#mystring -> size\\n'<br />'\\n\\n// size of an array or map will be a count of elements\\n#myarray -> size\\n'<br />'\\n\\n// elements within an array can report size\\n#myarray -> get(2) -> size\\n'<br />'\\n\\n// integers or decimals does not have sizes\\n//#myinteger -> size // will fail\\n// an integer can however be converted to a string first\\nstring(#myinteger) -> size\\n\",\n \"language\": \"Lasso\"\n },\n {\n \"code\": \"> s = \\\"hello\\\"\\n> print(#s)\\n5\\n> t = { 1,2,3,4,5 }\\n> print(#t)\\n5\\n\",\n \"language\": \"Lua\"\n },\n {\n \"code\": \"ByteCount[\\\"somerandomstring\\\"]\\n\",\n \"language\": \"Mathematica\"\n },\n {\n \"code\": \"MODULE Size EXPORTS Main;\\n\\nFROM IO IMPORT Put;\\nFROM Fmt IMPORT Int;\\n\\nBEGIN\\n Put(\\\"Integer in bits: \\\" & Int(BITSIZE(INTEGER)) & \\\"\\\\n\\\");\\n Put(\\\"Integer in bytes: \\\" & Int(BYTESIZE(INTEGER)) & \\\"\\\\n\\\");\\nEND Size.\\n\",\n \"language\": \"Modula-3\"\n },\n {\n \"code\": \"echo \\\"An int contains \\\", sizeof(int), \\\" bytes.\\\"\\n\",\n \"language\": \"Nim\"\n },\n {\n \"code\": \"10 PRINT LEN(VARIABLE$)\\n\",\n \"language\": \"NS-HUBASIC\"\n },\n {\n \"code\": \"(** The result is the size given in word.\\n The word size in octet can be found with (Sys.word_size / 8).\\n (The size of all the datas in OCaml is at least one word, even chars and bools.)\\n*)\\nlet sizeof v =\\n let rec rec_size d r =\\n if List.memq r d then (1, d) else\\n if not(Obj.is_block r) then (1, r::d) else\\n if (Obj.tag r) = (Obj.double_tag) then (2, r::d) else\\n if (Obj.tag r) = (Obj.string_tag) then (Obj.size r, r::d) else\\n if (Obj.tag r) = (Obj.object_tag) ||\\n (Obj.tag r) = (Obj.closure_tag)\\n then invalid_arg \\\"please only provide datas\\\"\\n else\\n let len = Obj.size r in\\n let rec aux d sum i =\\n if i >= len then (sum, r::d) else\\n let this = Obj.field r i in\\n let this_size, d = rec_size d this in\\n aux d (sum + this_size) (i+1)\\n in\\n aux d (1) 0\\n in\\n fst(rec_size [] (Obj.repr v))\\n;;\\n\",\n \"language\": \"OCaml\"\n },\n {\n \"code\": \"# sizeof 234 ;;\\n- : int = 1\\n\\n# sizeof 23.4 ;;\\n- : int = 2\\n\\n# sizeof (1,2);;\\n- : int = 3\\n\\n# sizeof (2, 3.4) ;;\\n- : int = 4\\n\\n# sizeof (1,2,3,4,5) ;;\\n- : int = 6\\n\\n# sizeof [| 1;2;3;4;5 |] ;;\\n- : int = 6\\n\\n# sizeof [1;2;3;4;5] ;;\\n- : int = 11\\n\\n(* because a list is equivalent to *)\\n\\n# sizeof (1,(2,(3,(4,(5,0))))) ;;\\n- : int = 11\\n\\n# type foo = A | B of int | C of int * int ;;\\ntype foo = A | B of int | C of int * int\\n\\n# sizeof A ;;\\n- : int = 1\\n\\n# sizeof (B 3) ;;\\n- : int = 2\\n\\n# sizeof (C(1,2)) ;;\\n- : int = 3\\n\\n# sizeof true ;;\\n- : int = 1\\n\\n# sizeof 'A' ;;\\n- : int = 1\\n\\n# sizeof `some_pvar ;;\\n- : int = 1\\n\\n# sizeof \\\"\\\" ;;\\n- : int = 1\\n\\n# sizeof \\\"Hello!\\\" ;;\\n- : int = 2\\n(* remember the size is given in words\\n (so 4 octets on 32 bits machines) *)\\n\\n# for i=0 to 16 do\\n Printf.printf \\\"%d -> %d\\\\n\\\" i (sizeof(String.create i))\\n done;;\\n0 -> 1\\n1 -> 1\\n2 -> 1\\n3 -> 1\\n4 -> 2\\n5 -> 2\\n6 -> 2\\n7 -> 2\\n8 -> 3\\n9 -> 3\\n10 -> 3\\n11 -> 3\\n12 -> 4\\n13 -> 4\\n14 -> 4\\n15 -> 4\\n16 -> 5\\n- : unit = ()\\n\\n# sizeof(Array.create 10 0) ;;\\n- : int = 11\\n\\n# sizeof(Array.create 10 (String.create 20)) ;;\\n- : int = 16\\n\\n# sizeof(Array.init 10 (fun _ -> String.create 20)) ;;\\n- : int = 61\\n\",\n \"language\": \"OCaml\"\n },\n {\n \"code\": \"package main\\n\\nimport \\\"core:fmt\\\"\\n\\nmain :: proc() {\\n fmt.println(\\\"An int contains\\\", size_of(int), \\\"bytes.\\\")\\n}\\n\",\n \"language\": \"Odin\"\n },\n {\n \"code\": \"sizebyte(x)\\n\",\n \"language\": \"PARI-GP\"\n },\n {\n \"code\": \"lg(x)\\n\",\n \"language\": \"PARI-GP\"\n },\n {\n \"code\": \"use Devel::Size qw(size total_size);\\n\\nmy $var = 9384752;\\nmy @arr = (1, 2, 3, 4, 5, 6);\\nprint size($var); # 24\\nprint total_size(\\\\@arr); # 256\\n\",\n \"language\": \"Perl\"\n },\n {\n \"code\": \"(phixonline)-->\\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;\\\">\\\"An integer contains %d bytes.\\\\n\\\"</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #7060A8;\\\">machine_word</span><span style=\\\"color: #0000FF;\\\">())</span>\\n<!--\\n\",\n \"language\": \"Phix\"\n },\n {\n \"code\": \"put skip list (SIZE(x)); /* gives the number of bytes occupied by X */\\n /* whatever data type or structure it is. */\\n\\nput skip list (CURRENTSIZE(x));\\n /* gives the current number of bytes of X */\\n /* actually used by such things as a */\\n /* varying-length string, including its */\\n /* length field. */\\n\",\n \"language\": \"PL-I\"\n },\n {\n \"code\": \";;; Prints 0 because small integers need no heap storage\\ndatasize(12) =>\\n;;; Prints 3: 3 character fits into single machine word, 1 word\\n;;; for tag, 1 for length\\ndatasize('str') =>\\n;;; 3 element vector takes 5 words: 3 for values, 1 for tag, 1 for\\n;;; length\\ndatasize({1 2 3}) =>\\n;;; Prints 3 because only first node counts\\ndatasize([1 2 3]) =>\\n\",\n \"language\": \"Pop11\"\n },\n {\n \"code\": \"Define a\\nDebug SizeOf(a)\\n; This also works for structured variables\\n\",\n \"language\": \"PureBasic\"\n },\n {\n \"code\": \">>> from array import array\\n>>> argslist = [('l', []), ('c', 'hello world'), ('u', u'hello \\\\u2641'),\\n\\t('l', [1, 2, 3, 4, 5]), ('d', [1.0, 2.0, 3.14])]\\n>>> for typecode, initializer in argslist:\\n\\ta = array(typecode, initializer)\\n\\tprint a, '\\\\tSize =', a.buffer_info()[1] * a.itemsize\\n\\tdel a\\n\\n\\t\\narray('l') \\tSize = 0\\narray('c', 'hello world') \\tSize = 11\\narray('u', u'hello \\\\u2641') \\tSize = 14\\narray('l', [1, 2, 3, 4, 5]) \\tSize = 20\\narray('d', [1.0, 2.0, 3.1400000000000001]) \\tSize = 24\\n>>>\\n\",\n \"language\": \"Python\"\n },\n {\n \"code\": \"import sys\\nsys.getsizeof(obj)\\n\",\n \"language\": \"Python\"\n },\n {\n \"code\": \"# Results are system dependent\\nnum <- c(1, 3, 6, 10)\\nobject.size(num) # e.g. 56 bytes\\n\\n#Allocating vectors using ':' results in less memory being (reportedly) used\\nnum2 <- 1:4\\nobject.size(num2) # e.g. 40 bytes\\n\\n#Memory shared by objects isn't always counted\\nl <- list(a=c(1, 3, 6, 10), b=1:4)\\nobject.size(l) # e.g. 280 bytes\\n\\nl2 <- list(num, num2)\\nobject.size(l2) # e.g. 128 bytes\\n\",\n \"language\": \"R\"\n },\n {\n \"code\": \"#lang racket\\n(require ffi/unsafe)\\n(define-syntax-rule (sizes t ...)\\n (begin (printf \\\"sizeof(~a) = ~a\\\\n\\\" 't (ctype-sizeof t)) ...))\\n(sizes _byte _short _int _long _llong _float _double)\\n\",\n \"language\": \"Racket\"\n },\n {\n \"code\": \"# Textual strings are measured in characters (graphemes)\\nmy $string = \\\"abc\\\";\\n\\n# Arrays are measured in elements.\\nsay $string.chars; # 3\\nmy @array = 1..5;\\nsay @array.elems; # 5\\n\\n# Buffers may be viewed either as a byte-string or as an array of elements.\\nmy $buffer = '#56997; means \\\"four dragons\\\".'.encode('utf8');\\nsay $buffer.bytes; # 26\\nsay $buffer.elems; # 26\\n\",\n \"language\": \"Raku\"\n },\n {\n \"code\": \"/*REXX program demonstrates (see the penultimate statement) how to */\\n/* to find the size (length) of the value of a REXX variable. */\\n\\n/*REXX doesn't reserve any storage for any variables, as all variables */\\n/*are stored as character strings, including boolean. Storage is */\\n/*obtained as necessary when REXX variables are assigned (or reassigned)*/\\n\\na = 456 /*length of A is 3 */\\nb = \\\"heptathlon\\\" /*length of B is 10 */\\nc = \\\"heptathlon (7 events)\\\" /*length of C is 21 */\\nd = '' /*length of D is 0 */\\nd = \\\"\\\" /*same as above. */\\nd = left('space junk' ,0) /*same as above. */\\nd = /*same as above. */\\ne = 99-9 /*length of E is 2 (e=90) */\\nf = copies(a,100) /*length of F is 300 (a=456)*/\\ng.1 = -1 /*length of G.1 is 2 */\\ng.2 = -1.0000 /*length of G.2 is 7 */\\n /*length of HHH is 3 */\\n\\n /*Note that when a REXX variable */\\n /*isn't SET, then the value of it*/\\n /*is the uppercased name itself, */\\n /*so in this case (upper): HHH */\\n\\nsomething = copies(a, random(100)) /*length is something, all right,*/\\n /*could be 3 to 300 bytes, by gum*/\\nthingLen = length(something) /*use LENGTH bif to find its len.*/\\nsay 'length of SOMETHING =' thingLen /*display the length of SOMETHING*/\\n\\n/*┌────────────────────────────────────────────────────────────────────┐\\n │ Note that the variable's data (value) isn't the true cost of the │\\n │ size of the variable's value. REXX also keeps the name of │\\n │ the (fully qualified) variable as well. │\\n │ │\\n │ Most REXX interpreters keep (at a miminum): │\\n │ │\\n │ ∙ a four-byte field which contains the length of the value │\\n │ ∙ a four-byte field which contains the length of the var name │\\n │ ∙ an N-byte field which contains the name of the variable │\\n │ ∙ an X-byte field which contains the variable's value │\\n │ ∙ a one-byte field which contains the status of the variable │\\n │ │\\n │ [Note that PC/REXX uses a two-byte field for the first two fields] │\\n │ │\\n │ │\\n │ Consider the following two DO loops assigning a million variables: │\\n │ │\\n │ do j=1 to 1000000 │\\n │ integer_numbers.j=j │\\n │ end │\\n │ ════════ and ════════ │\\n │ do k=1 to 1000000 │\\n │ #.k=k │\\n │ end │\\n │ │\\n │ The \\\"j\\\" loop uses 35,777,792 bytes for the compound variables, │\\n │ The \\\"k\\\" loop uses 21,777,792 bytes for the compound variables, │\\n │ (excluding the DO loop indices [j and k] themselves). │\\n └────────────────────────────────────────────────────────────────────┘*/\\n\",\n \"language\": \"REXX\"\n },\n {\n \"code\": \"list1 = list(2)\\nlist2 = list(4)\\nlist3 = list(6)\\nlist4 = list(7)\\nlist5 = list(5)\\n\\nsee \\\"Size of list1 is : \\\" + len(list1) + nl\\nsee \\\"Size of list2 is : \\\" + len(list2) + nl\\nsee \\\"Size of list3 is : \\\" + len(list3) + nl\\nsee \\\"Size of list4 is : \\\" + len(list4) + nl\\nsee \\\"Size of list5 is : \\\" + len(list5) + nl\\n\",\n \"language\": \"Ring\"\n },\n {\n \"code\": \"require 'objspace'\\n\\np ObjectSpace.memsize_of(\\\"a\\\"*23) #=> 0\\np ObjectSpace.memsize_of(\\\"a\\\"*24) #=> 25\\np ObjectSpace.memsize_of(\\\"a\\\"*1000) #=> 1001\\n\",\n \"language\": \"Ruby\"\n },\n {\n \"code\": \"use std::mem;\\n\\nfn main() {\\n // Specify type\\n assert_eq!(4, mem::size_of::<i32>());\\n\\n // Provide a value\\n let arr: [u16; 3] = [1, 2, 3];\\n assert_eq!(6, mem::size_of_val(&arr));\\n}\\n\",\n \"language\": \"Rust\"\n },\n {\n \"code\": \" def nBytes(x: Double) = ((Math.log(x) / Math.log(2) + 1e-10).round + 1) / 8\\n\\n val primitives: List[(Any, Long)] =\\n List((Byte, Byte.MaxValue),\\n (Short, Short.MaxValue),\\n (Int, Int.MaxValue),\\n (Long, Long.MaxValue))\\n\\n primitives.foreach(t => println(f\\\"A Scala ${t._1.toString.drop(13)}%-5s has ${nBytes(t._2)} bytes\\\"))\\n\",\n \"language\": \"Scala\"\n },\n {\n \"code\": \"sizeofValue(x)\\n\",\n \"language\": \"Swift\"\n },\n {\n \"code\": \"// sizeof and sizeofValue return the size in bytes.\\nprintln(sizeof(Int))\\nvar i: Int = 42\\nprintln(sizeofValue(i))\\n// The size returned is that of the top level value and does not\\n// include any referenced data. A type like String always returns\\n// the same number, the size of the String struct.\\nprintln(sizeofValue(\\\"Rosetta\\\"))\\nprintln(sizeofValue(\\\"Code\\\"))}\\n\",\n \"language\": \"Swift\"\n },\n {\n \"code\": \"string bytelength $var\\n\",\n \"language\": \"Tcl\"\n },\n {\n \"code\": \"char-size .\\ncell-size .\\n\",\n \"language\": \"Toka\"\n },\n {\n \"code\": \"needs floats\\nfloat-size .\\n\",\n \"language\": \"Toka\"\n },\n {\n \"code\": \"$$ MODE TUSCRIPT,{}\\nstring=\\\"somerandomstring\\\"\\nsize=SIZE(string)\\nlength=LENGTH(string)\\n\\nPRINT \\\"string: \\\",string\\nPRINT \\\"has size: \\\",size\\nPRINT \\\"and length: \\\",length\\n\",\n \"language\": \"TUSCRIPT\"\n },\n {\n \"code\": \"struct foo {\\n uint32_t x : 17;\\n uint8_t y : 3;\\n char z[16];\\n};\\n\",\n \"language\": \"TXR\"\n },\n {\n \"code\": \"# In the shell all variables are stored as strings, so we use the same technique\\n# as for finding the length of a string:\\ngreeting='Hello, world!'\\ngreetinglength=`printf '%s' \\\"$greeting\\\" | wc -c`\\necho \\\"The greeting is $greetinglength characters in length\\\"\\n\",\n \"language\": \"UNIX-Shell\"\n },\n {\n \"code\": \"#import std\\n\\n#cast %nL\\n\\nexamples = <weight 'hello',mpfr..prec 1.0E+0>\\n\",\n \"language\": \"Ursala\"\n },\n {\n \"code\": \"sizeof(i64)\\n\",\n \"language\": \"V-(Vlang)\"\n },\n {\n \"code\": \"void main(){\\n /* you can replace the int below with any of the vala supported datatypes\\n see the vala documentation for valid datatypes.\\n */\\n print(@\\\"$(sizeof(int))\\\\n\\\");\\n}\\n\",\n \"language\": \"Vala\"\n },\n {\n \"code\": \"include c:\\\\cxpl\\\\codes;\\nint Size;\\nint A, B;\\nreal X, Y;\\n[Size:= addr B - addr A;\\nIntOut(0, Size); CrLf(0);\\nSize:= addr Y - addr X;\\nIntOut(0, Size); CrLf(0);\\n]\\n\",\n \"language\": \"XPL0\"\n },\n {\n \"code\": \"print frnfn_size(\\\"uint8\\\")\\t\\t//1\\nprint frnfn_size(\\\"int8\\\")\\t\\t//1\\nprint frnfn_size(\\\"uint16\\\")\\t\\t//2\\nprint frnfn_size(\\\"int16\\\")\\t\\t//2\\nprint frnfn_size(\\\"uint32\\\")\\t\\t//4\\nprint frnfn_size(\\\"int32\\\")\\t\\t//4\\nprint frnfn_size(\\\"uint64\\\")\\t\\t//8\\nprint frnfn_size(\\\"int64\\\")\\t\\t//8\\nprint frnfn_size(\\\"float\\\")\\t\\t//4\\nprint frnfn_size(\\\"double\\\")\\t\\t//8\\nprint frnfn_size(\\\"char\\\")\\t\\t//1\\nprint frnfn_size(\\\"int\\\")\\t\\t\\t//4\\nprint frnfn_size(\\\"short\\\")\\t\\t//2\\n\",\n \"language\": \"Yabasic\"\n },\n {\n \"code\": \"(123).len() //-->1 (byte)\\n(0).MAX.len() //-->8 (bytes), ie the max number of bytes in an int\\n(1.0).MAX.len() //-->8 (bytes), ie the max number of bytes in an float\\n\\\"this is a test\\\".len() //-->14\\nL(1,2,3,4).len() //-->4\\nDictionary(\\\"1\\\",1, \\\"2\\\",2).len() //-->2 (keys)\\nData(0,Int,1,2,3,4).len() //-->4 (bytes)\\nData(0,String,\\\"1\\\",\\\"2\\\",\\\"3\\\",\\\"4\\\").len() //-->8 bytes (ASCIIZ)\\n\",\n \"language\": \"Zkl\"\n }\n]","isConversational":false},"task_name":{"kind":"string","value":"Variable-size-Get"}}},{"rowIdx":1799,"cells":{"solutions":{"kind":"list like","value":[{"code":"---\ncategory:\n- Simple\nfrom: http://rosettacode.org/wiki/Variables\nnote: Basic language learning\n","language":"00-META"},{"code":";Task:\nDemonstrate a language's methods of:\n:::* variable declaration\n:::* initialization\n:::* assignment\n:::* datatypes\n:::* scope \n:::* referencing, and \n:::* other variable related facilities\n<br><br>\n\n","language":"00-TASK"},{"code":"Int a\n","language":"11l"},{"code":"V a = 1\n","language":"11l"},{"code":"Int p, a, d\n","language":"11l"},{"code":"* value of F\n L 2,F assigment r2=f\n* reference (or address) of F\n LA 3,F reference r3=@f\n* referencing (or indexing) of reg3 (r3->f)\n L 4,0(3) referencing r4=%r3=%@f=f\n","language":"360-Assembly"},{"code":"* declarations length\nC DS C character 1\nX DS X character hexa 1\nB DS B character bin 1\nH DS H half word 2\nF DS F full word 4\nE DS F single float 4\nD DS D double float 8\nL DS L extended float 16\nS DS CL12 string 12\nP DS PL16 packed decimal 16\nZ DS ZL32 zoned decimal 32\n* declarations + initialization\nCI DC C'7' character 1\nXI DC X'F7' character hexa 1\nBI DC B'11110111' character bin 1\nHI DC H'7' half word 2\nFI DC F'7' full word 4\nEI DC F'7.8E3' single float 4\nDI DC D'7.8E3' double float 8\nLI DC L'7.8E3' extended float 16\nSI DC CL12'789' string 12\nPI DC PL16'7' packed decimal 16\nZI DC ZL32'7' zoned decimal 32\n","language":"360-Assembly"},{"code":" org $1200\nSoundRam equ $1200 ;some assemblers require equ directives to not be indented.\nSoundChannel_One equ $1200\nSoundChannel_Two equ $1201\nSoundChannel_Three equ $1202\n LDA #$FF ;this still gets assembled starting at $1200, since equ directives don't take up space!\n","language":"6502-Assembly"},{"code":"joystick equ $00 ;this variable is located at zero page memory address $00\nPlayer_Xpos equ $01 ;this variable is located at $01\nPlayer_Ypos equ $02\npointer equ $03 ;intended to take up 2 bytes\nsound_on equ $05\n","language":"6502-Assembly"},{"code":"enum $0000\n;these will be defined starting at $0000 and increasing in the order listed, incremented by the amount after DSB.\njoystick dsb 1 ;this takes up 1 byte\nPlayer_Xpos dsb 1\nPlayer_Ypos dsb 1\npointer dsb 2 ;this takes up 2 bytes\nsound_on dsb 1\nende ;end enumeration\n","language":"6502-Assembly"},{"code":".rsset $0000\njoystick .rs 1\nPlayer_Xpos .rs 1\nPlayer_Ypos .rs 1\npointer .rs 2\nsound_on .rs 1\n;no closer needed for this method\n","language":"6502-Assembly"},{"code":"LDA #$05\nSTA Player1_Lives ;equivalent C code: Player1_Lives = 5;\n\nLDA #$05\nSTA pointer+1\nLDA #$40\nSTA pointer\n;loads the variable pointer with the value $0540\n","language":"6502-Assembly"},{"code":"NametableBase equ $20 ;label referring to a constant\nVRAM_ADDR equ $2006 ;label referring to a memory address\nVRAM_DATA equ $2007 ;label referring to a memory address\n\nLDA #NametableBase ;without a # this is interpreted as a memory address like any other number would be.\nSTA VRAM_ADDR\nLDA #$00\nSTA VRAM_ADDR\n\nLDA #$03\nSTA VRAM_DATA\n","language":"6502-Assembly"},{"code":"MyVar:\nDC.L 0 ;reserves 4 bytes of storage. The label MyVar represents the address of the four 0 bytes shown here.\n\nMyOtherVar:\nDC.L $C0 ;reserves 8 bytes of storage. The first four bytes are initialized to 00 00 00 C0 and the second four to $00 $00 $01 $F4.\nDC.L 500 ;MyOtherVar points to the first four bytes, you'll need pointer arithmetic to get to the second four.\n","language":"68000-Assembly"},{"code":".data\nMyVar word 0FFFFh ;the leading zero is just to help the assembler tell that this is a number, it's not actually part of the variable.\n\n.code\n\nmov ax, word ptr [ds:MyVar]\n","language":"8086-Assembly"},{"code":"Player1_Lives equ 0100h\nmov al,3\nmov byte ptr [Player1_Lives],al ;give the player 3 lives to start the game with\n","language":"8086-Assembly"},{"code":" mov ax, seg MyData ;the assembler replaces this with the segment MyData is located in prior to assembling the program.\nmov ds,ax ;load this segment into the data segment register.\n","language":"8086-Assembly"},{"code":"\\ declare a variable which is initialized to the number '0'\nvar x\n\n\\ declare a variable which is initialized to a string \"cat\"\n\"cat\" var, y\n\n\\ Get the value in x, add 20 and store it:\nx @ 20 n:+ x !\n\n\\ Change the cat to a dog:\n\"dog\" y !\n","language":"8th"},{"code":"/* ARM assembly AARCH64 Raspberry PI 3B */\n/* program variable64.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/* Initialized data */\n/*********************************/\n.data\nszString: .asciz \"String définition\"\nsArea1: .fill 11, 1, ' ' // 11 spaces\n // or\nsArea2: .space 11,' ' // 11 spaces\n\ncCharac: .byte '\\n' // character\ncByte1: .byte 0b10101 // 1 byte binary value\n\nhHalfWord1: .hword 0xFF // 2 bytes value hexa\n.align 4\niInteger1: .int 123456 // 4 bytes value decimal\niInteger3: .short 0500 // 4 bytes value octal\niInteger5: .int 0x4000 // 4 bytes value hexa\n\niInteger7: .word 0x4000 // 4 bytes value hexa\niInteger6: .int 04000 // 4 bytes value octal\n\nTabInteger4: .int 5,4,3,2 // Area of 4 integers = 4 * 4 = 16 bytes\n\ndDoubleInt1: .quad 0xFFFFFFFFFFFFFFFF // 8 bytes value hexa\n\ndfFLOAT1: .double 0f-31415926535897932384626433832795028841971.693993751E-40 // Float 8 bytes\nsfFLOAT2: .float 0f-31415926535897932384626433832795028841971.693993751E-40 // Float 4 bytes (or use .single)\n\n/*********************************/\n/* UnInitialized data */\n/*********************************/\n.bss\nsBuffer: .skip 500 // 500 bytes values zero\niInteger2: .skip 4 // 4 bytes value zero\ndDoubleint2: .skip 8 // 8 bytes value zero\n/*********************************/\n/* code section */\n/*********************************/\n.text\n.global main\nmain: // entry of program\n ldr x0,qAdriInteger2 // load variable address\n mov x1,#100\n str x1,[x0] // init variable iInteger2\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\nqAdriInteger2: .quad iInteger2 // variable address iInteger2\n","language":"AArch64-Assembly"},{"code":"Name: declare -- a local declaration block has an optional name\n A : constant Integer := 42; -- Create a constant\n X : String := \"Hello\"; -- Create and initialize a local variable\n Y : Integer; -- Create an uninitialized variable\n Z : Integer renames Y: -- Rename Y (creates a view)\n function F (X: Integer) return Integer is\n -- Inside, all declarations outside are visible when not hidden: X, Y, Z are global with respect to F.\n X: Integer := Z; -- hides the outer X which however can be referred to by Name.X\n begin\n ...\n end F; -- locally declared variables stop to exist here\nbegin\n Y := 1; -- Assign variable\n declare\n X: Float := -42.0E-10; -- hides the outer X (can be referred to Name.X like in F)\n begin\n ...\n end;\nend Name; -- End of the scope\n","language":"Ada"},{"code":"int j;\n","language":"ALGOL-68"},{"code":"LONG REAL double1, double2, double3;\n","language":"ALGOL-68"},{"code":"SHORT INT b1 := 2500;\nLONG INT elwood = 3*bsize, jake = bsize -2;\n","language":"ALGOL-68"},{"code":"FLEX[20]CHAR mystring;\n","language":"ALGOL-68"},{"code":"[]CHAR mytext = \"The ALGOL 68 Language\";\n","language":"ALGOL-68"},{"code":"% declare some variables %\ninteger a1, a2; real b; long real c; complex d; long complex f;\nlogical g; bits h; string(32) j;\n\n% assign \"initial values\" %\nf := d := c := b := a2 := a1 := 0; % multiple assignment %\ng := false; h := #a0; j := \"Hello, World!\";\n","language":"ALGOL-W"},{"code":"record R1 ( integer length; string(256) text );\nreference(R1) ref1, ref2;\n","language":"ALGOL-W"},{"code":"record person( string(32) name; integer age );\nrecord date( integer day, month, year );\nreference(person, date) ref3;\n","language":"ALGOL-W"},{"code":"reference(integer) refInt; % an illegal declaration %\n","language":"ALGOL-W"},{"code":"record INT_VALUE ( integer val );\nreference(INT_VALUE) refInt;\n","language":"ALGOL-W"},{"code":"% using the person record defined above...%\n reference (person) someone;\n someone := person % create a new person structure with uninitialised fields %\n name(someone) := \"Fred\"; % initialise the fields %\n age(someone) := 27;\n % could also initialise the fields when the record is created: %\n someone := person( \"Harry\", 32 );\n","language":"ALGOL-W"},{"code":"// If not initialized at class/member level, it will be set to null\nInteger x = 0;\nInteger y; // y is null here\nInteger p,q,r; // declare multiple variables\nInteger i=1,j=2,k=3; // declare and initialize\n\n/*\n * Similar to Integer, below variables can be initialized together separated by ','.\n*/\nString s = 'a string';\nDecimal d = 0.0;\nDouble dbl = 0.0;\nBlob blb = Blob.valueOf('Any String');\nBoolean b = true;\nAClassName cls = new AClassName();\n","language":"Apex"},{"code":"set x to 1\n","language":"AppleScript"},{"code":"global x\nset x to 1\nlocal y\nset y to 2\n","language":"AppleScript"},{"code":"on localx()\n\tset x to 0 -- implicit local\n\treturn x\nend localx\n\non globalx()\n\tset x to 0 -- implicit local\n\treturn my x\nend globalx\n\non run\n\tset x to 1 -- top-level implicit global\n\treturn {localx(), globalx()}\nend run\n--> RETURNS: {0, 1}\n","language":"AppleScript"},{"code":"property x : 1\n","language":"AppleScript"},{"code":" 10 A = 1.7: REM LET IS NOT REQUIRED\n 20 LET B% = 1.7: REM THE PERCENT SIGN INDICATES AN INTEGER; THIS GETS TRUNCATED DOWN\n 30 LET C$ = \"0121\": REM THE DOLLAR SIGN INDICATES A STRING DATA TYPE. THE LEADING ZERO IS NOT TRUNCATED\n 40 DIM D(20): REM CREATE AN ARRAY OF 21 FLOATING POINT NUMBERS\n 50 DIM E$(5,10): REM CREATE A TWO DIMENSIONAL ARRAY OF 66 STRINGS\n 60 LET D(1) = 1.3: REM ASSIGN THE SECOND ELEMENT OF D\n 70 Y$(3) = \"ROSE\": REM ASSIGN A VALUE TO THE FOURTH STRING\n 80 PRINT X: REM UNASSIGNED FLOATING POINT AND INTEGER VARIABLES HAVE A DEFAULT VALUE OF ZERO\n 90 PRINT Y$(2): REM UNASSIGNED STRING VARIABLES ARE EMPTY\n 100 PRINT Y$(3);\"TTA CODE\": REM THERE WON'T BE SPACES BETWEEN ROSE AND ETTA\n 110 F%(10) = 0: REM IF ARRAYS ARE NOT DECLARED THEY HAVE 11 ELEMENTS BY DEFAULT; IE. DIM F%(10)\n 120 PRINT G: REM THIS PRINTS 0 AND IS NOT AN ERROR EVEN THOUGH G HAS NOT BEEN DEFINED\n 130 PRINT D(0): REM THIS IS NOT AN ERROR BECAUSE ELEMENTS ARE NUMBERED FROM ZERO.\n 140 PRINT F%: REM THIS PRINTS 0 BECAUSE F% IS A DIFFERENT VARIABLE THAN THE ARRAY F%(10)\n 150 LET D(21) = 6: REM THIS IS AN ERROR BECAUSE D ONLY HAS 21 ELEMENTS INDEXED FROM 0 TO 20.\n","language":"Applesoft-BASIC"},{"code":"/* ARM assembly Raspberry PI */\n/* program variable.s */\n\n/************************************/\n/* Constantes Définition */\n/************************************/\n.equ STDOUT, 1 @ Linux output console\n.equ EXIT, 1 @ Linux syscall\n.equ WRITE, 4 @ Linux syscall\n/*********************************/\n/* Initialized data */\n/*********************************/\n.data\nszString: .asciz \"String définition\"\nsArea1: .fill 11, 1, ' ' @ 11 spaces\n @ or\nsArea2: .space 11,' ' @ 11 spaces\n\ncCharac: .byte '\\n' @ character\ncByte1: .byte 0b10101 @ 1 byte binary value\n\nhHalfWord1: .hword 0xFF @ 2 bytes value hexa\n.align 4\niInteger1: .int 123456 @ 4 bytes value decimal\niInteger3: .short 0500 @ 4 bytes value octal\niPointer1: .int 0x4000 @ 4 bytes value hexa\n @ or\niPointer2: .word 0x4000 @ 4 bytes value hexa\niPointer3: .int 04000 @ 4 bytes value octal\n\nTabInteger4: .int 5,4,3,2 @ Area of 4 integers = 4 * 4 = 16 bytes\n\niDoubleInt1: .quad 0xFFFFFFFFFFFFFFFF @ 8 bytes\n\ndfFLOAT1: .double 0f-31415926535897932384626433832795028841971.693993751E-40 @ Float 8 bytes\nsfFLOAT2: .float 0f-31415926535897932384626433832795028841971.693993751E-40 @ Float 4 bytes (or use .single)\n\n/*********************************/\n/* UnInitialized data */\n/*********************************/\n.bss\nsBuffer: .skip 500 @ 500 bytes values zero\niInteger2: .skip 4 @ 4 bytes value zero\n/*********************************/\n/* code section */\n/*********************************/\n.text\n.global main\nmain: @ entry of program\n ldr r0,iAdriInteger2 @ load variable address\n mov r1,#100\n str r1,[r0] @ init variable iInteger2\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\niAdriInteger2: .int iInteger2 @ variable address iInteger2\n","language":"ARM-Assembly"},{"code":"num: 10\nstr: \"hello world\"\n\narrA: [1 2 3]\narrB: [\"one\" \"two\" \"three\"]\narrC: [1 \"two\" [3 4 5]]\narrD: [\"one\" true [ print \"something\" ]]\n\ndict: [\n\tname: \"john\"\n\tsurname: \"doe\"\n\tfunction: $[][\n\t\tprint \"do sth\"\n\t]\n]\n\ninspect symbols\n","language":"Arturo"},{"code":"x = hello ; assign verbatim as a string\nz := 3 + 4 ; assign an expression\nif !y ; uninitialized variables are assumed to be 0 or \"\" (blank string)\nMsgbox %x% ; variable dereferencing is done by surrounding '%' signs\nfx()\n{\nlocal x ; variable default scope in a function is local anyways\nglobal y ;\nstatic z=4 ; initialized once, then value is remembered between function calls\n}\n","language":"AutoHotkey"},{"code":"BEGIN {\n# Variables are dynamically typecast, and do not need declaration prior to use:\n fruit = \"banana\" # create a variable, and fill it with a string\n a = 1 # create a variable, and fill it with a numeric value\n a = \"apple\" # re-use the above variable for a string\n print a, fruit\n\n# Multiple assignments are possible from within a single statement:\n x = y = z = 3\n print \"x,y,z:\", x,y,z\n\n# \"dynamically typecast\" means the content of a variable is used\n# as needed by the current operation, e.g. for a calculation:\n a = \"1\"\n b = \"2banana\"\n c = \"3*4\"\n\n print \"a,b,c=\",a,b,c, \"c+0=\", c+0, 0+c\n print \"a+b=\", a+b, \"b+c=\", b+c\n}\n","language":"AWK"},{"code":"# usage: awk -v x=9 -f test.awk\nBEGIN {\n y = 3\n z = x+y\n print \"x,y,z:\", x,y,z\n printf( \"x=%d,y=%d,z=%d:\", x,y,z )\n}\n","language":"AWK"},{"code":"function foo(s, k) {\n # s is an argument passed from caller\n # k is a dummy not passed by caller, but because it is\n # in the argument list, it will have a scope local to the function\n k = length(s)\n print \"'\" s \"' contains\", k, \"characters\"\n}\nBEGIN {\n k = 42\n s = \"Test\"\n foo(\"Demo\")\n print \"k is still\", k\n foo(s,k)\n print \"k still is\", k\n}\n","language":"AWK"},{"code":"# Feeding standard-input with echo:\necho -e \"2 apples 0.44$ \\n 3 banana 0.33$\" | awk '{p=$1*$NF; sum+=p; print $2,\":\",p; }; END{print \"Sum=\",sum}'\n","language":"AWK"},{"code":"1→A\n","language":"Axe"},{"code":"#Realloc(L₂)\n","language":"Axe"},{"code":"10 LET A=1.3\n20 LET B%=1.3: REM The sigil indicates an integer, so this will be rounded down\n30 LET C$=\"0121\": REM The sigil indicates a string data type. the leading zero is not truncated\n40 DIM D(10): REM Create an array of 10 digits\n50 DIM E$(5.10): REM Create an array of 5 strings, with a maximum length of 10 characters\n60 LET D(1)=1.3: REM Assign the first element of d\n70 LET E$(3)=\"ROSE\": REM Assign a value to the third string\n80 PRINT D(3): REM Unassigned array elements have a default value of zero\n90 PRINT E$(3): REM Ten spaces because string arrays are not dynamic\n100 PRINT E$(3);\"TTA CODE\": REM There will be spaces between rose and etta\n110 DIM F%(10): REM Integers use less space than floating point values\n120 PRINT G: REM This is an error because f has not been defined\n130 PRINT D(0): REM This is an error because elements are numbered from one\n140 LET D(11)=6: REM This is an error because d only has 10 elements\n150 PRINT F%: REM This is an error because we have not provided an element number\n160 END\n","language":"BASIC"},{"code":"@echo off\n\n::setting variables in defferent ways\nset myInt1=5\nset myString1=Rosetta Code\nset \"myInt2=5\"\nset \"myString2=Rosetta Code\"\n\n::Arithmetic\nset /a myInt1=%myInt1%+1\nset /a myInt2+=1\nset /a myInt3=myInt2+ 5\n\nset myInt\nset myString\npause>nul\n","language":"Batch-File"},{"code":" REM BBC BASIC (for Windows) has the following scalar variable types;\n REM the type is explicitly indicated by means of a suffix character.\n REM Variable names must start with A-Z, a-z, _ or `, and may contain\n REM any of those characters plus 0-9 and @; they are case-sensitive.\n\n A& = 123 : REM Unsigned 8-bit byte (0 to 255)\n A% = 12345678 : REM Signed 32-bit integer (-2147483648 to +2147483647)\n A = 123.45E6 : REM Variant 40-bit float or 32-bit integer (no suffix)\n A# = 123.45E6 : REM Variant 64-bit double or 32-bit integer\n A$ = \"Abcdef\" : REM String (0 to 65535 bytes)\n\n REM Scalar variables do not need to be declared but must be initialised\n REM before being read, otherwise a 'No such variable' error is reported\n REM The static integer variables A% to Z% are permanently defined.\n\n REM BBC BASIC also has indirection operators which allow variable-like\n REM entities to be created in memory:\n\n DIM addr 7 : REM Allocate 8 bytes of heap\n ?addr = 123 : REM Unsigned 8-bit byte (0 to 255)\n !addr = 12345 : REM Signed 32-bit integer (-2147483648 to +2147483647)\n |addr = 12.34 : REM Variant 40-bit or 64-bit float or 32-bit integer\n $addr = \"Abc\" : REM String terminated by CR (0 to 65535 bytes)\n $$addr = \"Abc\": REM String terminated by NUL (0 to 65535 bytes)\n\n REM The integer indirection operators may be used in a dyadic form:\n offset = 4\n addr?offset = 12345678 : REM Unsigned 8-bit byte at addr+offset\n addr!offset = 12345678 : REM Signed 32-bit integer at addr+offset\n\n REM All variables in BBC BASIC have global scope unless they are used\n REM as a formal parameter of a function or procedure, or are declared\n REM as LOCAL or PRIVATE. This is different from most other BASICs.\n","language":"BBC-BASIC"},{"code":"a ← 10\n","language":"BQN"},{"code":"(myfunc=i j.!arg:(?i.?j)&!i+!j)\n","language":"Bracmat"},{"code":"int j;\n","language":"C"},{"code":"double double1, double2, double3;\n","language":"C"},{"code":"short b1 = 2500;\nlong elwood = 3*BSIZE, jake = BSIZE -2;\n","language":"C"},{"code":"char mystring[21];\n","language":"C"},{"code":"const char * mytext = \"The C Language\";\n","language":"C"},{"code":"int a;\n","language":"C++"},{"code":"auto a = 1; // int a = 1\n","language":"C++"},{"code":"std::vector<int> intVec;\n","language":"C++"},{"code":"int j;\n","language":"C-sharp"},{"code":"int p, a, d;\n","language":"C-sharp"},{"code":"int a = 4;\nint b;\nint c = Func(a);\n\nb = 5;\n","language":"C-sharp"},{"code":" int a;\n","language":"ChucK"},{"code":"int b,c,d;\n","language":"ChucK"},{"code":"0 => int e;\n","language":"ChucK"},{"code":"(declare foo)\n","language":"Clojure"},{"code":"(def foo (atom 42))\n","language":"Clojure"},{"code":"(def bar (ref 42))\n","language":"Clojure"},{"code":"(def baz (agent 42))\n","language":"Clojure"},{"code":"(def bar)\n","language":"Clojure"},{"code":"(def foo 42)\n","language":"Clojure"},{"code":"(defonce bar 42)\n","language":"Clojure"},{"code":"(defn baz [x] 42)\n","language":"Clojure"},{"code":"(defmacro qux [x] 42)\n","language":"Clojure"},{"code":"(let [foo 42] ...)\n","language":"Clojure"},{"code":"(def ^:dynamic foo 10)\n(binding [foo 20] ...)\n","language":"Clojure"},{"code":"(defn len [^String x]\n (.length x))\n","language":"Clojure"},{"code":"MOVE 5 TO x\nMOVE FUNCTION SOME-FUNC(x) TO y\nMOVE \"foo\" TO z\nMOVE \"values 1234\" TO group-item\nSET some-index TO 5\n","language":"COBOL"},{"code":"01 normal-date.\n 03 year PIC 9(4).\n 03 FILLER PIC X VALUE \"-\".\n 03 month PIC 99.\n 03 FILLER PIC X VALUE \"-\".\n 03 dday PIC 99. *> Misspelling is intentional; day is a reserved word.\n\n01 reversed-date.\n 03 dday PIC 99.\n 03 FILLER PIC X VALUE \"-\".\n 03 month PIC 99.\n 03 FILLER PIC X VALUE \"-\".\n 03 year PIC 9(4).\n...\nPROCEDURE DIVISION.\n MOVE \"2012-11-10\" TO normal-date\n MOVE CORR normal-date TO reversed-date\n DISPLAY reversed-date *> Shows '10-11-2012'\n","language":"COBOL"},{"code":"01 a PIC X(20). *> a is a string of 20 characters.\n01 b PIC 9(10). *> b is a 10-digit integer.\n01 c PIC 9(10)V9(5). *> c is a decimal number with a 10-digit integral part and a 5-digit fractional part.\n01 d PIC 99/99/99. *> d is an edited number, with a slash between each pair of digits in a 6-digit integer.\n","language":"COBOL"},{"code":"*> Group data items do not have a picture clause.\n01 group-item.\n 03 sub-data PIC X(10).\n 03 more-sub-data PIC X(10).\n","language":"COBOL"},{"code":"DATA DIVISION.\nWORKING-STORAGE SECTION.\n01 initialized-data PIC X(15) VALUE \"Hello, World!\".\n01 other-data PIC X(15).\n...\nPROCEDURE DIVISION.\n DISPLAY initialized-data *> Shows 'Hello, World!'\n DISPLAY other-data *> Will probably show 15 spaces.\n","language":"COBOL"},{"code":"01 group-item VALUE \"Hello!12345\".\n 03 a-string PIC X(6). *> Contains \"Hello!\"\n 03 a-number PIC 9(5). *> Contains '12345'.\n","language":"COBOL"},{"code":"some-str (1:1) *> Gets the first character from the string\nsome-num (1:3) *> Get the first three digits from the number\nanother-string (5:) *> Get everything from the 5th character/digit onwards.\n\n*> To reference modify an array element\nsome-table (1) (5:1) *> Get the 5th character from the 1st element in the table\n","language":"COBOL"},{"code":"1 rem rosetta code\n5 rem commodore basic variable demonstration\n10 print chr$(147);chr$(14);:ti$=\"000000\":rem see lines 420-460\n15 rem numeric variables default to 0; strings default to empty\n20 print a:print b%:print c$:print\n25 :\n30 rem no symbol after variable defaults to float.\n35 let a=1.7\n40 rem \"let\" is not required and rarely used.\n45 b=2.42\n50 print a:print b\n55 rem % means integer type; digits after decimal are truncated\n60 b%=1.7\n65 print b%\n70 rem $ means string type\n75 c$=\"Commodore\"\n80 print c$:print\n85 :\n90 rem each type is unique, even when name is \"same\"\n95 a=5.0\n100 a%=9\n105 a$=\"twenty-five\"\n110 print a:print a%:print a$:print\n115 :\n120 rem names unique only to two characters; extra ignored\n125 li=10:lives=8:lights=64\n130 print li:print lives:print lights:print\n135 rem second character can be alphanumeric, but is not array\n140 s1=100 : s2=200 : s3=300\n145 print s1:print s2:print s3:print\n150 gosub 5000\n155 :\n160 rem strings preserve all literal characters\n165 rem numerics drop leading zeros and trailing zeros after decimal\n170 n$=\"01276\":print n$:rem 01276\n175 o%=01276:print n%: rem 1276\n180 p=4.900:print p: print: rem 4.9\n185 :\n190 rem string-numeric conversion functions\n195 c$=\"05034\"\n200 c%=val(c$) : rem converts to the numeric value of 5034 (first zero dropped)\n205 d=123.45600 : rem define a float\n210 d$=str$(d) : rem converts above into a string\n215 print c$:print c%:print d:print d$:print\n218 :\n220 rem strings can be ordered/compared > or < like numbers\n225 input \"Enter a string\";x$:print\n230 input \"Enter another string\";y$:print\n235 if x$>y$ then print x$;\" comes after \";y$\n240 if x$<y$ then print x$;\" comes before \";y$\n245 if x$=y$ then print \"You entered the same string twice!\"\n250 gosub 5000\n255 :\n260 rem numbers have a leading character for pos/neg sign\n265 rem \" \" means positive\n270 a=-52:b=124\n275 print a:print b:print\n280 :\n285 rem variable operations\n290 e$=\"endothermic\":print e$\n295 print left$(e$,3) : rem \"end\"\n300 print right$(e$,3) : rem \"mic\"\n305 print mid$(e$,4,5) : rem \"other\"\n310 print\n315 a=5:b=20:c=a+b:print a;\"+\";b;\"=\";c : rem addition\n320 q=90:r=60:s=q-r:print s : rem subtraction\n325 x=3:y=4:z=x*y:print x;\"*\";y;\"=\";z : rem 12 multiplication\n330 l=12:m=16:n=l/m:print l;\"/\";m;\"=\";n :rem division\n335 rem string concatenation\n340 print\n345 f$=\"John\":l$=\"Jones\":n$=l$+\", \"+f$:print f$:print l$:print n$\n350 gosub 5000\n355 :\n360 rem arrays can be single or multidimensional\n365 rem array index starts at 0\n370 rem single dimenstion arrays of 11 elements or less\n375 rem do not need to be DIMensioned\n380 a$(0)=\"first\":a$(1)=\"second\":a$(3)=\"third\":rem we skipped index 2\n385 for i=0 to 3:print a$(i):next\n390 gosub 5000\n395 dim b(1,20) : rem 42 elements\n400 for i=0 to 1:for j=0 to 20:b(i,j)=(i+1)*j:next j,i\n405 for i=0 to 1:print chr$(19):for j=0 to 20:print tab(i*6);b(i,j):next j,i\n410 gosub 5000\n415 :\n420 rem special variables - ti and st are technically functions,\n425 rem but ti$ can be assigned a value similar to a string variable\n430 t$=left$(ti$,2)+\":\"+mid$(ti$,3,2)+\":\"+right$(ti$,2)\n435 print \"Ticks since program started:\":print ti\n440 print \"Elapsed time since program started:\":print t$\n445 print \"I/O Status:\";st : rem i/o status\n450 print:print \"Enter new time (HHMMSS): \";:gosub 5200\n455 ti$=t$:gosub 5500\n460 print\n465 :\n470 rem all variables can be cleared with the \"clr\" statement\n475 rem however, this also clears the return address stack for subroutines\n480 rem making \"return\" not possible.\n485 print \"Before CLR:\":print a:print a$:print a$(0):print b:print c\n490 clr:print:print \"After CLR:\"\n495 print a:print a$:print a$(0):print b:print c\n500 print\n505 end\n600 :\n700 rem supporting subroutines\n800 :\n5000 rem screen pause routine\n5005 print:print \"press a key to continue\"\n5010 get k$:if k$=\"\" then 5010\n5015 print chr$(147):return\n5020 :\n5200 rem custom time input routine\n5205 t$=\"\":for d=1 to 6\n5210 get k$:if k$<\"0\" or k$>\"9\" then 5210\n5215 t$=t$+k$:print k$;:next\n5220 return\n5230 :\n5500 rem display live clock\n5505 print chr$(147):print:print \"Press a key to continue.\"\n5510 print chr$(19);\"Time: \"left$(ti$,2)\":\"mid$(ti$,3,2)\":\"right$(ti$,2);\n5515 get k$:if k$=\"\" then 5510\n5520 print chr$(147);:return\n","language":"Commodore-BASIC"},{"code":"10 print chr$(147);chr$(14);:ti$=\"0000000\":rem see lines 420-460\n\n430 t$=left$(ti$,2)+\":\"+mid$(ti$,3,2)+\":\"+mid$(ti$,5,2)+\".\"+right$(ti$,1)\n\n5205 t$=\"\":for d=1 to 7\n\n5500 rem display live clock\n5505 print chr$(147):print:print \"Press a key to continue.\"\n5510 t$=left$(ti$,2)+\":\"+mid$(ti$,3,2)+\":\"+mid$(ti$,5,2)+\".\"+right$(ti$,1)\n5515 print chr$(19);\"Time: \"t$\n5520 get k$:if k$=\"\" then 5510\n5525 print chr$(147);:return\n","language":"Commodore-BASIC"},{"code":"REM Tiny Basic has exactly 26 variables.\nREM They start off initialised to zero.\n PRINT A\n\nREM The only data type is sixteen-bit signed integer.\nREM They are assigned using the LET statement.\nREM Their scope is the whole program.\n LET B = -12345\nREM The integer arithmetic operations of + - * and / can be used\nREM and so can the unary negative and positive operators - +\n LET C = 1 + B - B/5\n LET A = -B\n PRINT \"B is \", B\n PRINT \"C is \", C\n GOSUB 10\n\nREM The comparison operators = < > <= >= <> are available,\nREM but their results are not expressions and can only be used in an\nREM if statement.\n LET D = 3\n IF D <> 7 THEN LET D = 7\n GOTO D-2\n PRINT \"Skip this\"\n 5 PRINT \"Gotos and gosubs can be computed. Beware of moving spaghetti.\"\n END\n10 PRINT \"B is now \", B\n RETURN\n\nREM Tiny Basic does not support arrays or pointers. Strings can\nREM be used, but only as string constants within a PRINT statement.\n","language":"Commodore-BASIC"},{"code":"(defparameter *x* nil \"nothing\")\n","language":"Common-Lisp"},{"code":"(defun frobnicate (x)\n (declare (type fixnum x))\n (the fixnum (+ x 128)))\n","language":"Common-Lisp"},{"code":"(defvar *x* 42 \"The answer.\")\n","language":"Common-Lisp"},{"code":"(documentation '*x* 'variable)\n","language":"Common-Lisp"},{"code":"(let ((jenny (list 8 6 7 5 3 0 9))\n hobo-joe)\n (apply #'+ jenny))\n","language":"Common-Lisp"},{"code":"(progn\n (let ((*x* 43))\n (print *x*)\n (print *x*))\n","language":"Common-Lisp"},{"code":"(setf *x* 625)\n","language":"Common-Lisp"},{"code":"(setf *x* 42 *y* (1+ *x*))\n=>43\n","language":"Common-Lisp"},{"code":"(setf *x* 625)\n(psetf *x* 42 *y* (1+ *x*)\n=>NIL\n","language":"Common-Lisp"},{"code":"(declaim (ftype (function (fixnum) fixnum) frobnicate))\n(defun frobnicate (x)\n (+ x 42))\n","language":"Common-Lisp"},{"code":"float bite = 36.321;\t///_Defines a floating-point number (float), \"bite\", with a value of 36.321\nfloat[3] bites;\t\t///_Defines a static array of 3 floats\nfloat[] more_bites;\t///_Defines a dynamic array of floats\n","language":"D"},{"code":";\n; Variables examples for DBL version 4 by Dario B.\n;\n\n.DEFINE NR,10 ;const\n.DEFINE AP,\"PIPPO\" ;const\n\n\n RECORD CUSTOM\nCOD, D5\nNAME, A80\nZIP, D6\nCITY, A80\n;-----------------------\n\n RECORD\n\nALPHA, A5 ;alphanumeric\nNUMBR, D5 ;number\nDECML, F5.2 ;float\nNUMVE, 10D5 ;array of number\nNUMAR, [10,2]D5 ;array of number\nALPV1, 10A8 ;array of alphanumeric\nALPV2, [NR]A8 ;array of alphanumeric\nALPA1, [10,2]A8 ;array of alphanumeric\n\nNUMV, 3D3,100,200,300\nALPV, 2A3,'ABC','FGH','KLM'\nMSX, A9,\"VARIABLES\"\nMSG, A*,'Esempio di variabile autodimensionante'\n\n PROC\n;-----------------------------------------------------------------------\n\n CLEAR ALPHA,NUMBR,DEML,NUMVE(1:10*5),NUMAR(1:10*2*5),ALPV1(1:10*8)\n CLEAR ALPV2(1:10*8),ALPA1(1:10*2*8)\n\n ALPHA=\"PIPPO\"\n NUMBR=10\n DECML=20.55\n\n CLEAR CUSTOM\n COD=1050\n NAME='Dario Benenati'\n ZIP=27100\n CITY=\"PAVIA\"\n\n NUMVE(1:10*5)=\n NUMVE(1)=1\n SET NUMVE(2),NUMVE(3),NUMVE(4)=2\n\n NUMAR(1:10*2*5)=\n NUMAR[1,1]=11\n NUMAR[1,2]=12\n NUMAR[2,1]=21\n NUMAR[2,2]=22\n\n ALPV1(1:10*8)=\n ALPV1(1)=\"PIPPO\"\n APLV1(2)=\"PLUTO\"\n APLV1(2)=\"ABCDEFGHIJKLMNOP\" ;ALPV(3)='IJKLMNOP'\n\n ALPV2(1:10*8)=\" \"\n ALPV2[1]=\"PIPPO\"\n ALPV2(2)=\"PLUTO\"\n ALPV2[3](3:2)=\"FO\"\n ALPV2[4](3,4)=\"FO\"\n\n SET ALPA1[1,1],ALPA1[1,2]=\"PLUTO\"\n ALPA1[2,1](3:2)=\"FO\"\n ALPA1[2,1](3,4)=\"FO\"\n ;.....................\n","language":"DBL"},{"code":"var\n i: Integer;\n s: string;\n o: TObject;\nbegin\n i := 123;\n s := 'abc';\n o := TObject.Create;\n try\n // ...\n finally\n o.Free;\n end;\nend;\n","language":"Delphi"},{"code":"add_var(v1);\ndim(v1);\nadd_var(v1, v2, v3, v4);\ndim(v1, v2, v3, v4);\nadd_var(isRaining)_datatype(boolean);\ndim(isRaining)_datatype(boolean);\nadd_var(greeting)_dt(string);\ndim(greeting)_dt(string);\nadd_var({date}, birthdate);\ndim({date}, birthdate);\n","language":"Diego"},{"code":"add_str(bobName)_value(Bob);\nalert_human(bob)_msg(Hi [bobName]); // Hi Bob\n\nalert_human(fred)_msg(Hi [fredName])_str(fredName)_value(Freddy); // Hi Freddy\n","language":"Diego"},{"code":"add_var(greeting)_value(Hello World)_me();\n","language":"Diego"},{"code":"with_me()_var(greeting)_value(Hello World);\n","language":"Diego"},{"code":"add_var(greeting)_value(Hello World);\n","language":"Diego"},{"code":"add_var(greeting)_value(Hello World)_for()_computer(cmp1);\n","language":"Diego"},{"code":"with_robot(alif)_msg(Hello World);\n","language":"Diego"},{"code":"with_robot()_msg(Hello World);\n","language":"Diego"},{"code":"with_computer()_msg(Hello World);\n","language":"Diego"},{"code":"with_computer()_os(windows)_msg(Hello World);\n","language":"Diego"},{"code":"add_var(a); // a = undefined variant\nadd_var({int},b); // b = undefined integer\n\nwith_var(a)_value(0); // a = 0 variant\nwith_var({int},a)_v(1); // a = 1 integer\nwith_var([a])_v(2); // a = 2 integer\n\nwith_var[a]_v(3);\n// same as `with_var(3)_v(3);`\n// callee will ask `with_var(3)_askdec();`\n\n(a)_v(3); // a = 3 integer // same as `add_var(a)_v(3);`\n([a])_v(4); // a = 4 integer // same as `add_var([a])_v(4);`\n\n[a]_v(5);\n// same as `with_var(3)_v(5);`\n// callee will ask `with_var(3)_askdec();`\n\n(a)_calc([a]+1); // a = 5\n\nadd_var({str},varname)_v(a);\nwith_var[varname]_v(6); // a = 6 integer\n[varname]_inc(); // a = 7 integer // same as `with_var(a)_inc();`\n\nwith_var([a]+1); // a = 6 integer\nwith_var([a]+1)_v(7); // a = 8 integer\n\nwith_var([[varname]]+1); // a = 9 integer\nwith_var[[varname]]_inc(); // a = 10 integer\nwith_var([varname]+1); // varname = \"a1\"\n\nwith_var({double},a)_v(11); // a = 11.0 double\n\n(varname)_v(a)_inc(2); // varname = \"c\" // same as `with_var(a)_v(a)_inc(2);`\nwith_var(varname)_v(b); // varname = \"b\"\nwith_var[varname]_v(0); // b = 0\n([varname])_v(1); // b = 1 // same as `with_var(b)_v(1);`\n","language":"Diego"},{"code":"go_robot(alif)_waypoint(waypoint1)_addvar({bool},alifArriveWaypoint1);\ngo_robot(beh)_waypoint(waypoint1)_var({bool},behArriveWaypoint1);\ngo_robot(teh)_waypoint(waypoint1)_dim({bool},tehArriveWaypoint1);\n","language":"Diego"},{"code":"alert_human(jo)_msg(Hi [])_str(joeName)_v(Joe); // Hi Joe\n\nalert_human(gab)_msg(Hi [])_str()_v(Gabriella); // Hi Gabriella\n\nalert_human(annamarie)_msg(Hi [])_str([a]+'-'[m])_str(a)_v(Anna)_str(m)_v(Marie); // Hi Anna-Marie\nalert_human(annamarie)_msg(Hi []+'-'+[])_str()_v(Anna)_str()_v(Marie); // Hi Anna-Marie\nalert_human(annamarie)_msg(Hi [])_str([]+'-'[])_str()_v(Anna)_str()_v(Marie); // Hi Anna-Marie\n","language":"Diego"},{"code":"alert_human(jill)_msg(Hi [jillName] Daniels)_var(jillName)_value(Jill); // Hi Jill Daniels\nalert_human(jill)_msg('Hi '+[jillName]+' Daniels')_var(jillName)_value(Jill); // Hi Jill Daniels\nadd_var(jillFullName)_calc([jillName]+\" Daniels\");\n","language":"Diego"},{"code":"add_var({integer},wholeNumber1,wholeNumber2)_value(3);\ndim({double},realNumber)_v(3.0);\nadd_var({boolean},isRaining)_v(false);\nadd_var(greeting)_datatype(string)_value(Hello, this is World speaking.);\n","language":"Diego"},{"code":"with_var(birthdate)_value(24-Jun-1963);\n[myinteger]_value(33);\n","language":"Diego"},{"code":"[myYearVar]_v(1963);\n[datename]_v(24-Jun-[myYearVar]);\n","language":"Diego"},{"code":"with_var(d)_calc([b]^2-4*[a]*[c]);\nwith_var(E)_calc([m]*[c]^2);\nwith_var(d)_calc([b]^2-4*[a]*[c]);\n","language":"Diego"},{"code":"with_var(E)_equals(m)_multipl(c)_sq(); // E=mc²\nwith_var(c)_inc(); // increment by one\nwith_var(c)_inc(a); // same as with_var(c)_exp(+=[a]);\n","language":"Diego"},{"code":"(E)_equals(m)_multipl(c)_sq(); // E=mc²\n(c)_inc(); // increment by one\n(c)_inc(a); // same as [c]_exp(+=[a]);\n","language":"Diego"},{"code":"add_var(wholeNumber)_datatype(integer);\ndim({double},myNumber)_v(3.0);\nwith_var(wholenumber)_datatype(integer);\nwith_var({boolean},isRaining)_value(false); // cast/converting datatype\n","language":"Diego"},{"code":"// Both of the following declarations can be seen as a tree,\n// var -> <varname>\nvar/x\nvar y\n\n// They can also be defined like this.\n// This is once again a tree structure, but this time the \"var\" only appears once, and the x and y are children.\nvar\n x\n y\n// And like this, still a tree structure.\nvar/x, y\n","language":"DM"},{"code":"// Here, \"/obj\" is the type, a /obj being a simple game object.\nvar/obj/x\n// It can also be defined like this, because of the tree structure:\nvar\n obj\n x\n// Or this\nvar/obj\n x\n\n// ...\n// You get the idea\n","language":"DM"},{"code":"var/x = 0\nx = 10\nvar/y\ny = \"hi!\"\n","language":"DM"},{"code":"var i := 123; // inferred type of i is Integer\nvar s := 'abc'; // inferred type of s is String\nvar o := TObject.Create; // inferred type of o is TObject\nvar s2 := o.ClassName; // inferred type of s2 is String as that's the type returned by ClassName\n","language":"DWScript"},{"code":"//A constant declaration\nlet pi = 3.14\n\nprivate {\n //private constant, not visible outside of a module\n let privateConst = 3.3\n}\n\n//Variable declaration\nvar x = 42\n\n//Assignment\nx = 42.42\n\n//Dyalect is a dynamic language, so types are attached\n//to values, not to the names\nvar foo = (x: 2, y: 4) //foo is of type Tuple\nvar bar = \"Hello!\" //bar is of type String\n\n//Global variable\nvar g = 1.1\n\n{\n //local variable (not visible outside of { } brackets)\n var loc = 2.2\n}\n\nfunc fun() {\n //Local variables, not visible outside of function\n var x = 1\n var y = 2\n}\n\nfunc parent() {\n //A local variable inside a parent function\n var x = 1\n func child() {\n //A local variable inside a nested function\n //It shadows a parent's variable\n var x = 2\n\n //But this is how we can reference a variable from\n //a parent function\n base.x\n }\n}\n","language":"Dyalect"},{"code":"def x := 1\nx + x # returns 2\n","language":"E"},{"code":"def var x := 1\nx := 2\nx # returns 2\n","language":"E"},{"code":"def var x := 1\nx += 1 # equivalent to x := x + 1, or x := x.add(1)\nx # returns 2\n\ndef var list := [\"x\"]\nlist with= \"y\" # equivalent to list := list.with(\"y\")\nlist # returns [\"x\", \"y\"]\n","language":"E"},{"code":"def [hair, eyes, var shirt, var pants] := [\"black\", \"brown\", \"plaid\", \"jeans\"]\n","language":"E"},{"code":"[shirt, pants] := [\"white\", \"black\"] # This does not do anything useful.\n","language":"E"},{"code":"def list := [def x := timer.now(), x] # two copies of the current time\nlist[0] == x # x is still visible here; returns true\n","language":"E"},{"code":"def makeSum() {\n var a := 0\n var b := 0\n return [&a, &b, fn { a + b }]\n}\n\ndef [&x, &y, sum] := makeSum()\nx := 3\ny := 4\nsum() # returns 7\n","language":"E"},{"code":"def getUniqueId(&counter) {\n counter += 1\n return counter\n}\n\nvar idc := 0\ngetUniqueId(&idc) # returns 1\ngetUniqueId(&idc) # returns 2\n","language":"E"},{"code":"# it is statically typed\n#\n# global number variable\nn = 99\nprint n\n# global array of numbers\na[] = [ 2.1 3.14 3 ]\n#\nproc foo . .\n # i is local, because it is first used in the function\n for i = 1 to len a[]\n print a[i]\n .\n.\nfoo\n#\n# string\ndomain$ = \"easylang.dev\"\nprint domain$\n#\n# array of strings\nfruits$[] = [ \"apple\" \"banana\" \"orange\" ]\nprint fruits$[]\n","language":"EasyLang"},{"code":"class\n\tAPPLICATION\ninherit\n\tARGUMENTS\ncreate\n\tmake\n\nfeature {NONE} -- Initialization\n\n\tmake\n\t\t\t-- Run application.\n\t\tlocal\n\t\t\ti: INTEGER\n\t\t\ts: STRING\n\t\tdo\n\t\t\ti := 100\n\t\t\ts := \"Some string\"\n\t\t\tcreate a.make_empty\n\t\tend\n\nfeature {NONE} -- Class Features\n\na: ARRAY[INTEGER]\n","language":"Eiffel"},{"code":"-- assume A and B are of the same datatype\nB := A\nA.some_modification_feature\n","language":"Eiffel"},{"code":"x = 42\n\nsum x y = x + y\n","language":"Ela"},{"code":"sum x y = let z = x + y in z\n\nsum x y = z\n where z = x + y\n","language":"Ela"},{"code":"import system'collections;\n\npublic program()\n{\n var c := nil; // declaring variable.\n var a := 3; // declaring and initializing variables\n var b := \"my string\".Length;\n long l := 200l; // declaring strongly typed variable\n auto lst := new List<int>();\n\n c := b + a; // assigning variable\n}\n","language":"Elena"},{"code":"two() ->\n\tA_variable = 1,\n\tA_variable + 1.\n","language":"Erlang"},{"code":"let x = 5 // Int\nlet mutable y = \"mutable\" // Mutable string\nlet recordType = { foo : 6; bar : 6 } // Record\nlet intWidget = new Widget<int>() // Generic class\nlet add2 x = 2 + x // Function value\n","language":"F-Sharp"},{"code":"let intEqual (x : int) (y : int) = x = y\nlet genericEqual x y : 'a = x = y\n","language":"F-Sharp"},{"code":"sum <- sum + 1\n","language":"F-Sharp"},{"code":"SYMBOL: foo\n\n: use-foo ( -- )\n 1 foo set\n foo get 2 + foo set ! foo now = 3\n foo get number>string print ;\n\n:: named-param-example ( a b -- )\n a b + number>string print ;\n\n: local-example ( -- str ) [let \"a\" :> b \"c\" :> a a \" \" b 3append ] ;\n","language":"Factor"},{"code":"/* partially created by Aykayayciti Earl Lamont Montgomery\nApril 9th, 2018 */\n\n/* global and local scrope\n from the Falcon survival\n guide book */\n// global scope\nsqr = 1.41\n\nfunction square( x )\n\t// local scope\n sqr = x * x\n return sqr\nend\n\n\nnumber = square( 8 ) * sqr\n\n\na = [1, 2, 3] \t// array\nb = 1\t\t\t// variable declaration\ne = 1.0 \t\t// float\nf = \"string\"\t// string\n\n/* There are plenty more\ndata types in Falcon */\n","language":"Falcon"},{"code":": hypot ( a b -- a^2 + b^2 )\n LOCALS| b a | \\ note: reverse order from the conventional stack comment\n b b * a a * + ;\n","language":"Forth"},{"code":": hypot { a b -- a^2 + b^2 } \\ text between \"--\" and \"}\" remains commentary\n a a * b b * + ;\n","language":"Forth"},{"code":": length { F: a F: b F: c -- len } \\ floating point locals\n a a F* b b F* F+ c c F* F+ FSQRT ;\n","language":"Forth"},{"code":"VARIABLE X 999 X ! \\ create variable x, store 999 in X\nVARIABLE Y -999 Y ! \\ create variable y, store -999 in Y\n2VARIABLE W 140569874. W 2! \\ create and assign a double precision variable\n","language":"Forth"},{"code":" program test\n implicit none\n\n integer :: i !scalar integer\n integer,dimension(10) :: ivec !integer vector\n real :: r !scalar real\n real,dimension(10) :: rvec !real vector\n character(len=:),allocatable :: char1, char2 !fortran 2003 allocatable strings\n\n!assignments:\n\n!-- scalars:\n i = 1\n r = 3.14\n\n!-- vectors:\n ivec = 1 !(all elements set to 1)\n ivec(1:5) = 2\n\n rvec(1:9) = 0.0\n rvec(10) = 1.0\n\n!-- strings:\n char1 = 'hello world!'\n char2 = char1 !copy from one string to another\n char2(1:1) = 'H' !change first character\n\nend program test\n","language":"Fortran"},{"code":"Dim [Shared] As DataType <i>vble1</i> [, <i>vble2</i>, ...]\n","language":"FreeBASIC"},{"code":"Common [Shared] <i>symbolname</i>[()] [AS DataType] [, ...]\n","language":"FreeBASIC"},{"code":"Var [Shared] variable = expression\n\nVar variable As datatype\nVar var1,var2,... As datatype\n","language":"FreeBASIC"},{"code":"Var s2 = \"hello\" '' var-len string\nVar ii = 6728 '' implicit integer\nVar id = 6728.0 '' implicit double\n","language":"FreeBASIC"},{"code":"Dim [Shared] <i>vble1</i> As DataType [, <i>vble2</i> As DataType, ...]\n","language":"FreeBASIC"},{"code":"Dim As Integer n1, n2\nDim x As Double\nDim isRaining As Boolean\nDim As String greeting\n","language":"FreeBASIC"},{"code":"Dim variable As datatype = value\nDim var1,var2,... As datatype\n","language":"FreeBASIC"},{"code":"Dim wholeNumber1,wholeNumber2 as Integer = 3\nDim realNumber as Double = 3.0\nDim isRaining as Boolean = False\nDim greeting as String = \"Hello, this is World speaking.\"\nDim longArray() As Long = {0, 1, 2, 3}\nDim twoDimensions (1 To 2, 1 To 5) As Integer => {{1, 2, 3, 4, 5}, {1, 2, 3, 4, 5}}\n","language":"FreeBASIC"},{"code":"variable = expression\n","language":"FreeBASIC"},{"code":" v = a or v => a\n d = b^2 - 4*a*c\n s3 = s1 & mid(s2,3,2)\n","language":"FreeBASIC"},{"code":"variable <operator>= expression2\n","language":"FreeBASIC"},{"code":" c += a\n c -= a\n c *= a\n c /= a\n c \\= a\n c ^= a\n c Mod= a\n c Shl= n\n c Shr= n\n c &= a\n c And= n\n c Eqv= n\n c Imp= n\n c Or= n\n c Xor= n\n","language":"FreeBASIC"},{"code":"void local fn Variables\n dim a as long // dim var as type\n dim as long b // dim as type var\n long c // 'dim as' is optional\n long x, y, z // declarate multiple vars in one line\n CFStringRef s1 = @\"Alpha\", s2 = @\"Bravo\" // declare and assign in same statement\n CFArrayRef array = @[s1,s2] // declare and assign an array\n c = 123 // assign\n CGRect r = {20,20,120,32} // declare and assign record (struct)\nend fn\n\nfn Variables\n\nHandleEvents\n","language":"FutureBasic"},{"code":"# At top level, global variables are declared when they are assigned, so one only writes\nglobal_var := 1;\n\n# In a function, local variables are declared like this\nfunc := function(n)\n local a;\n a := n*n;\n return n + a;\nend;\n\n# One can test whether a variable is assigned\nIsBound(global_var);\n# true;\n\n# And destroy a variable\nUnbind(global_var);\n\n# This works with list elements too\nu := [11, 12, , 14];\nIsBound(u[4]);\n# true\nIsBound(u[3]);\n# false\nUnbind(u[4]);\n","language":"GAP"},{"code":"if var.end=0 then // Without the code being in this if statement, the code would keep executing until it were to stop.\nvar.end=1\n// These variables, respectively, refer to an integer, a boolean, and a string.\nvar.variable1=3\nvar.variable2=True\nvar.variable3=\"Hi!\"\n// var.example1 now refers to a string object instead.\nvar.variable1=\"Bye!\"\nendif\n","language":"GlovePIE"},{"code":"x := 3\n","language":"Go"},{"code":"var x int // declaration\nx = 3 // assignment\n","language":"Go"},{"code":"y := x+1 // y is int, assuming declaration above\nsame := x == y // same declared as bool\np := &same // type of p is pointer to bool\npi := math.Floor(math.Pi) // math.Floor returns float64, so that is the type of pi\n","language":"Go"},{"code":"var x, y int // two variables, initialized to zero.\nvar p *int // initialized to nil\n","language":"Go"},{"code":"var (\n x, y int\n s string\n)\n","language":"Go"},{"code":"x, y = y, x // swap x and y\nsinX, cosX = math.Sincos(x) // Sincos function returns two values\n// map lookup optionally returns a second value indicating if the key was found.\nvalue, ok = mapObject[key]\n","language":"Go"},{"code":"func increase (x int) (more int) {\n x++\n more = x+x\n return\n}\n","language":"Go"},{"code":"x, y := 3, 4\n","language":"Go"},{"code":"foobar = 15\n\nf x = x + foobar\n where foobar = 15\n\nf x = let foobar = 15\n in x + foobar\n\nf x = do\n let foobar = 15\n return $ x + foobar\n","language":"Haskell"},{"code":"main = do\n s <- getLine\n print (s, s)\n\n-- The above is equivalent to:\n\nmain = getLine >>= \\s -> print (s, s)\n","language":"Haskell"},{"code":"funkshun True x = x + 1\nfunkshun False x = x - 1\n\nfoobar = funkshun True 5 + funkshun False 5 -- 6 + 4\n","language":"Haskell"},{"code":"funkshun m = case foo m of\n [a, b] -> a - b\n a : b : c : rest -> a + b - c + sum rest\n a -> sum a\n","language":"Haskell"},{"code":"signum x | x > 0 = 1\n | x < 0 = -1\n | otherwise = 0\n","language":"Haskell"},{"code":"dotProduct :: [Int] -> [Int] -> Int\ndotProduct ns ms = sum $ zipWith (+) ns ms\n-- Without the type signature, dotProduct would\n-- have a more general type.\n\nfoobar :: Num a => a\nfoobar = 15\n-- Without the type signature, the monomorphism\n-- restriction would cause foobar to have a less\n-- general type.\n","language":"Haskell"},{"code":"! Strings and arrays must be declared.\n! Everything else is 8-byte float, READ/WRITE converts\n CHARACTER str=\"abcdef\", str2*345, str3*1E6/\"xyz\"/\n REAL, PARAMETER :: named_constant = 3.1415\n REAL :: n=2, cols=4, vec(cols), mtx(n, cols)\n DATA vec/2,3,4,5/, mtx/1,2,3.1415,4, 5,6,7,8/\n\n named = ALIAS(alpha, beta, gamma) ! gamma == named(3)\n ALIAS(vec,n, subvec,2) ! share subvec and vec(n...n+1)\n ALIAS(str,3, substr,n) ! share substr and str(3:3+n-1)\n\n a = EXP(b + c) ! assign/initialze a=1, b=0, c=0\n str = \"blahblah\" ! truncate/expand if needed\n beta = \"blahblah\" ! illegal\n\n CALL noArguments_noUSE ! global scope SUBROUTINE\n CALL Arguments_or_USE(a) ! local scope SUBROUTINE\n t = func() ! local scope FUNCTION\n\nSUBROUTINE noArguments_noUSE() ! all global\n vec2 = $ ! 1,2,3,...\nEND\n\nSUBROUTINE Arguments_or_USE(var) ! all local\n USE : vec ! use global object\n var = SUM(vec)\n t = TIME() ! local, static, USEd by func()\nEND\n\nFUNCTION func() ! all local\n USE Arguments_or_USE : t ! use local object\n func = t\nEND\n","language":"HicEst"},{"code":"U8 i;\n","language":"HolyC"},{"code":"U8 b1 = 8;\nU8 b2 = b1 * 10;\n","language":"HolyC"},{"code":"U8 uint1, uint2, uint3;\n","language":"HolyC"},{"code":"U8 *str = \"The HolyC Language\";\n","language":"HolyC"},{"code":"global gvar # a global\n\nprocedure main(arglist) # arglist is a parameter of main\nlocal a,b,i,x # a, b, i, x are locals withing main\nstatic y # a static (silly in main)\n\nx := arglist[1]\na := 1.0\ni := 10\nb := [x,a,i,b]\n\n# ... rest of program\nend\n","language":"HolyC"},{"code":"val=. 0\n","language":"J"},{"code":"fun =: 3 :0\n val1 =: 0\n val1 =. 2\n val2 =. 3\n val1, val2\n)\n fun''\n2 3\n val1\n0\n val2\n|value error\n","language":"J"},{"code":"fun1 =: 3 :0\n val3=. 0\n val3=: 0\n)\n fun1''\n|domain error\n","language":"J"},{"code":"fun2 =: 3 :0\n val4=. 0\n 3 :'val4=:y' y\n)\n fun2 ''\n","language":"J"},{"code":"int a;\ndouble b;\nAClassNameHere c;\n","language":"Java"},{"code":"int a, b, c;\n","language":"Java"},{"code":"int a = 5;\ndouble b;\nint c = 5, d = 6, e, f;\nString x = \"test\";\nString y = x;\nb = 3.14;\n","language":"Java"},{"code":"final String x = \"blah\";\nfinal String y;\nfinal double[] nums = new double[15];\ny = \"test\";\nx = \"blahblah\"; //not legal\nnums[5] = 2.5; //legal\nnums = new double[10]; //not legal\nfinal Date now = new java.util.Date();\nnow.setTime(1234567890); //legal\nnow = new Date(1234567890); //not legal\n","language":"Java"},{"code":"// a globally-scoped variable\nvar a=1;\n\n// global scope\nfunction one(){\n alert(a);\n}\n\n// local scope\nfunction two(a){\n alert(a);\n}\n\n// local scope again\nfunction three(){\n var a = 3;\n alert(a);\n}\n\n// Intermediate: no such thing as block scope in javascript\nfunction four(){\n if(true){\n var a=4;\n }\n\n alert(a); // alerts '4', not the global value of '1'\n}\n\n\n// Intermediate: object properties\nfunction Five(){\n this.a = 5;\n}\n\n\n// Advanced: closure\nvar six = function(){\n var foo = 6;\n\n return function(){\n // javascript \"closure\" means I have access to foo in here,\n // because it is defined in the function in which I was defined.\n alert(foo);\n }\n}()\n\n\n// Advanced: prototype-based scope resolution\nfunction Seven(){\n this.a = 7;\n}\n\n// [object].prototype.property loses to [object].property in the scope chain\nSeven.prototype.a = -1; // won't get reached, because 'a' is set in the constructor above.\nSeven.prototype.b = 8; // Will get reached, even though 'b' is NOT set in the constructor.\n\n\n\n// These will print 1-8\none();\ntwo(2);\nthree();\nfour();\nalert(new Five().a);\nsix();\nalert(new Seven().a);\nalert(new Seven().b);\n","language":"JavaScript"},{"code":"[] unstack\n","language":"Joy"},{"code":"42\n","language":"Joy"},{"code":"stack\n","language":"Joy"},{"code":"jq -n '1 as $x | (2 as $x | $x) | $x'\n","language":"Jq"},{"code":"EXPRESSION as $NAME\n","language":"Jq"},{"code":"def test: $x;\ntest\n","language":"Jq"},{"code":"jq --arg x 123 -n -f test.jq\n","language":"Jq"},{"code":"#declaration/assignment, declaration is optional\nx::Int32 = 1\n#datatypes are inferred dynamically, but can also be set thru convert functions and datatype literals\nx = 1 #x is inferred as Int, which is Int32 for 32-bit machines, Int64 for 64-bit machines\n#variable reference\njulia>x\n1\n\nx = int8(1) #x is of type Int8\nx = 1.0 #x is Float64\nx = y = 1 #assign both x and y to 1\nglobal x = 1 #assigns 1 to global variable x (used inside scope blocks)\nlocal x = 1 #assigns 1 to local variable x (used inside scope blocks)\nx = 'a' #x is a 'Char' type, designated by single quotes\nx = \"a\" #x is a 1-element string, designated by double quotes\n","language":"Julia"},{"code":"const e = 2.71828182845904523536\nconst pi = 3.14159265358979323846\n","language":"Julia"},{"code":"// version 1.0.6\n\nfun main(args: Array<String>) {\n /* read-only variables */\n val i = 3 // type inferred to be Int\n val d = 2.4 // type inferred to be double\n val sh: Short = 2 // type specified as Short\n val ch = 'A' // type inferred to be Char\n val bt: Byte = 1 // type specified as Byte\n\n /* mutable variables */\n var s = \"Hey\" // type inferred to be String\n var l = 4L // type inferred to be Long\n var b: Boolean // type specified as Boolean, not initialized immediately\n var f = 4.4f // type inferred to be Float\n\n b = true // now initialized\n println(\"$i, $d, $sh, $ch, $bt, $s, $l, $b, $f\")\n\n s = \"Bye\" // OK as mutable\n l = 5L // OK as mutable\n b = false // OK as mutable\n f = 5.6f // OK as mutable\n\n println(\"$i, $d, $sh, $ch, $bt, $s, $l, $b, $f\")\n}\n","language":"Kotlin"},{"code":"1) working in a global scope\n\n{def A 3}\n-> A // A is in the global scope\n{def B 4}\n-> B // B is in the global scopel\n{def MUL {lambda {:x :y} {* :x :y}}}\n-> MUL // MUL is a global function\n{MUL {A} {B}} // using global variables\n-> 12\n\n2) working in a local scope\n\n{let // open local scope\n { // begin defining and assigning local variables\n {:a 3} // :a is local\n {:b 4} // :b is local\n {:mul {lambda {:x :y} {* :x :y}}} // :mul is a local function\n } // end defining and assigning local variables\n {:mul :a :b} // computing with local variables\n} // closing local scope\n-> 12\n","language":"Lambdatalk"},{"code":"// declare thread variable, default type null\nvar(x)\n$x->type // null\n\n// declare local variable, default type null\nlocal(x)\n#x->type // null\n\n// declare thread variable, initialize with a type, in this case integer\nvar(x = integer)\n\n// declare local variable, initialize with a type, in this case integer\nlocal(x = integer)\n\n// assign a value to the thread var x\n$x = 12\n\n// assign a value to the local var x\n$x = 177\n\n// a var always has a data type, even if not declared - then it's null\n// a var can either be assigned a type using the name of the type, or a value that is by itself the type\nlocal(y = string)\nlocal(y = 'hello')\n\n'\\r'\n// demonstrating asCopyDeep and relationship between variables:\nlocal(original) = array('radish', 'carrot', 'cucumber', 'olive')\nlocal(originalaswell) = #original\nlocal(copy) = #original->asCopyDeep\niterate(#original) => {\n loop_value->uppercase\n}\n#original\t\t// modified\n//array(RADISH, CARROT, CUCUMBER, OLIVE)\n'\\r'\n#originalaswell // modified as well as it was not a deep copy\n//array(RADISH, CARROT, CUCUMBER, OLIVE)\n'\\r'\n#copy\t\t\t// unmodified as it used ascopydeep\n//array(RADISH, CARROT, CUCUMBER, OLIVE)\n","language":"Lasso"},{"code":"'In Liberty BASIC variables are either string or numeric.\n'A variable name can start with any letter and it can contain both letters and numerals, as well as dots (for example: user.firstname).\n'There is no practical limit to the length of a variable name... up to ~2M characters.\n'The variable names are case sensitive.\n\n'assignments: -numeric variables. LB assumes integers unless assigned or calculated otherwise.\n'Because of its Smalltalk heritage, LB integers are of arbitrarily long precision.\n'They lose this if a calculation yields a non-integer, switching to floating point.\n i = 1\n r = 3.14\n\n'assignments -string variables. Any string-length, from zero to ~2M.\n t$ =\"21:12:45\"\n flag$ =\"TRUE\"\n\n'assignments -1D or 2D arrays\n'A default array size of 10 is available. Larger arrays need pre-'DIM'ming.\n height( 3) =1.87\n dim height( 50)\n height( 23) =123.5\n potential( 3, 5) =4.5\n name$( 4) =\"John\"\n\n'There are no Boolean /bit variables as such.\n\n'Arrays in a main program are global.\n'However variables used in the main program code are not visible inside functions and subroutines.\n'They can be declared 'global' if such visibility is desired.\n'Functions can receive variables by name or by reference.\n","language":"Liberty-BASIC"},{"code":"x = 23\ny = \"Hello world!\"\nz = TRUE -- same effect as z = 1\n","language":"Lingo"},{"code":"on foo\n put x\nend\n","language":"Lingo"},{"code":"put value(\"x\")\n-- <Void> -- means: undefined\n","language":"Lingo"},{"code":"on foo\n x = VOID\n put x\nend\n","language":"Lingo"},{"code":"global x\non foo\n put x\nend\n","language":"Lingo"},{"code":"on foo\n global x\n put x\nend\n","language":"Lingo"},{"code":"_global.x = 23\n","language":"Lingo"},{"code":"put _global.x\n","language":"Lingo"},{"code":"make \"g1 0\nname 2 \"g2 ; same as make with parameters reversed\nglobal \"g3 ; no initial value\nto func :x\n make \"g4 4 ; still global\n localmake \"L1 6\n local [\"L2 \"L3] ; local variables, collection syntax\n func2 :g4\n print :L2 ; 9, modified by func2\n print :L3 ; L3 has no value, was not modified by func2\nend\nto func2 :y\n make \"g3 :y\n make \"L2 :L1 + 3 ; dynamic scope: can see variables of callers\n localmake \"L3 5 ; locally override L3 from caller\n (print :y :L1 :L2 :L3) ; 4 6 9 5\nend\nprint :g4 ; 4\nprint :L1 ; L1 has no value\nprint name? \"L1 ; false, L1 is not bound in the current scope\n","language":"Logo"},{"code":"Sub Click()\n'a few declarations as example\nDim s as New NotesSession ' declaring a New NotesSession actually returns the current, active NotesSession\nDim i as Integer ' i = 0\nDim s as String ' s= \"\"\nDim v as Variant ' v is nothing\nDim l as Long ' l = 0\nDim doc as NotesDocument 'doc is EMTPY\n\n'...\n\nEnd Sub\n","language":"LotusScript"},{"code":"a = 1 -- Here we declare a numeric variable\nfruit = \"banana\" -- Here we declare a string datatype\nneedspeeling = True -- This is a boolean\nlocal b = 2 -- This variable declaration is prefixed with a scope modifier\n","language":"Lua"},{"code":"A, B, C, D, E = 2, 4, 6, 8, \"It's never too late\"\n","language":"Lua"},{"code":"\\\\ M2000 use inference to state the type of a new variable, at run time\n\\\\ We can use literals of a numeric type\n\\\\ @ for Decimal\n\\\\ # for Currency\n\\\\ ~ for Single\n\\\\ & for Long (32bit)\n\\\\ % for Integer (16bit)\n\\\\ Double and Boolean have no symboles\nModule TopA {\n Module Alfa {\n Print A=10000, Type$(A)=\"Double\"\n \\\\ A is local, we use =\n A=10@\n Print A=10, Type$(A)\n \\\\ Or we can state the type before\n Def Currency K, Z=500, M\n K=1000\n \\\\ Currency Currency Currency\n Print Type$(K), Type$(Z), Type$(M)\n Def Double K1, K2 as Integer=10, K3=1\n \\\\ double integer double\n Print Type$(K1), Type$(K2), Type$(K3)\n Mb=1=1\n \\\\ We get a boolean\n Print Type$(Mb)\n Def boolean Mb1=True\n Print Type$(Mb1)\n \\\\ True and False are Double -1 and 0 not Boolean\n Mb3=True\n Print Type$(Mb3)=\"Double\"\n \\\\ For strings we have to use $ (like in old Basic)\n A$=\"This is a String\"\n Global G1 as boolean = True\n \\\\ To change a global variable we have to use <=\n G1<=1=0\n \\\\ If we do this: G1=1=0 we make a local variable, and shadow global\n \\\\ In a For Object {} we can make temporary variables\n For This {\n Local G1=122.1212\n Print G1, Type$(G1)=\"Double\"\n }\n Print G1, Type$(G1)=\"Boolean\"\n }\n \\\\ shadow A for this module only\n A=100\n \\\\ Now we call Alfa\n Alfa\n Print (A=100)=True\n}\nGlobal A=10000\nTopA\nPrint A=10000\nModule CheckStatic {\n \\\\ clear static variables and variables (for this module)\n Clear\n Module K {\n \\\\ if no A exist created with value 100@\n \\\\ Static variables can't be referenced\n Static A=100@\n Print A, Type$(A)=\"Decimal\"\n A++\n }\n For i=1 to 10 : K : Next i\n Print A=10000\n}\nCheckStatic\nPrint A=10000\n\n\\\\ reference and use of stack of values\nC=100&\nModule ChangeC {\n \\\\ we leave arguments in stack of values\n Module HereChangeC (&f) {\n \\\\ interpreter execute a Read &f\n f++\n }\n \\\\ now we call HereChangeC passing current stack of values\n HereChangeC\n}\n\\\\ Calling a module done without checking for what parameters a module take\nChangeC &C\nPrint C, Type$(C)=\"Long\"\nK=10010001001@\nChangeC &K\nPrint K, Type$(K)=\"Decimal\"\nModule TypeRef (&x as Double) {\n Print x\n x++\n}\nD=100\nTypeRef &D\nTry ok {\n TypeRef &K\n}\nIf Error or Not Ok then Print Error$ ' we get wrong data type\n","language":"M2000-Interpreter"},{"code":"a := 1:\nprint (\"a is \"||a);\n \"a is 1\"\n","language":"Maple"},{"code":"b;\nf := proc()\n local b := 3;\n print(\"b is \"||b);\nend proc:\nf();\nprint(\"b is \"||b);\n b\n \"b is 3\"\n \"b is b\"\n","language":"Maple"},{"code":"f := proc()\n global c;\n c := 3;\n print(\"a is \"||a);\n print(\"c is \"||c);\nend proc:\nf();\nprint(\"c is \"||c);\n \"a is 1\"\n \"c is 3\"\n \"c is 3\"\n","language":"Maple"},{"code":"print (\"a is \"||a);\na := 4:\nprint (\"a is \"||a);\n \"a is 1\"\n \"a is 4\"\n","language":"Maple"},{"code":"print (\"a is \"||a);\ntype(a, integer);\na := \"Hello World\":\nprint (\"a is \"||a);\ntype(a, integer);\ntype(a, string);\n \"a is 4\"\n true\n \"a is Hello World\"\n false\n true\n","language":"Maple"},{"code":"`This is a variable` := 1:\nprint(`This is a variable`);\n 1\n","language":"Maple"},{"code":"print (\"a is \"||a);\ntype(a, string);\nprint(\"c is \"||c);\na := 'a':\nprint (\"a is \"||a);\ntype(a, symbol);\nunassign('c');\nprint(\"c is \"||c);\n \"a is Hello World\"\n true\n \"c is 3\"\n \"a is a\"\n true\n \"c is c\"\n","language":"Maple"},{"code":"\ta = 4; % declare variable and initialize double value,\n s = 'abc'; % string\n i8 = int8(5);\t% signed byte\n u8 = uint8(5);\t% unsigned byte\n i16 = int16(5);\t% signed 2 byte\n u16 = uint16(5); % unsigned 2 byte integer\n i32 = int32(5);\t% signed 4 byte integer\n u32 = uint32(5);% unsigned 4 byte integers\n i64 = int64(5);\t% signed 8 byte integer\n u64 = uint64(5);% unsigned 8 byte integer\n\tf32 = float32(5); % single precision floating point number\n\tf64 = float64(5); % double precision floating point number , float 64 is the default data type.\n\n\tc = 4+5i; %\tcomplex number\n colvec = [1;2;4]; % column vector\n crowvec = [1,2,4]; % row vector\n m = [1,2,3;4,5,6]; % matrix with size 2x3\n","language":"MATLAB"},{"code":" global b\n","language":"MATLAB"},{"code":":- func name = string.\nname = Name :-\n Name = Title ++ \" \" ++ Given,\n Title = \"Dr.\",\n Given = \"Bob\".\n","language":"Mercury"},{"code":":- pred greet(string::in, io::di, io::uo) is det.\ngreet(Who, !IO) :-\n io.write_string(\"Hello\", !IO),\n io.format(\", %s!\\n\", [s(Who)], !IO).\n","language":"Mercury"},{"code":":- pred greet(string::in, io::di, io::uo) is det.\ngreet(Who, !.IO, !:IO) :-\n io.write_string(\"Hello\", !.IO, !:IO),\n io.format(\", %s!\\n\", [s(Who)], !.IO, !:IO).\n","language":"Mercury"},{"code":":- pred greet(string::in, io::di, io::uo) is det.\ngreet(Who, IO0, IO) :-\n io.write_string(\"Hello\", IO0, IO1),\n io.format(\", %s!\\n\", [s(Who)], IO1, IO).\n","language":"Mercury"},{"code":":- func dr(string) = string.\ndr(Name) = Titled :-\n some [!SB] (\n !:SB = string.builder.init,\n put_char(handle, 'D', !SB),\n put_char(handle, 'r', !SB),\n format(handle, \" %s\", [s(Name)], !SB),\n Titled = to_string(!.SB)\n ).\n","language":"Mercury"},{"code":" % all_under(N, L)\n % True if every member of L is less than N\n %\n:- pred all_under(int::in, list(int)::in) is semidet.\nall_under(Limit, L) :-\n all [N] (member(N, L) => N < Limit).\n","language":"Mercury"},{"code":":- type accumulator == (pred(int, int, io, io)).\n:- inst accumulator == (pred(in, out, di, uo) is det).\n\n:- func accumulator >> accumulator = accumulator.\n:- mode in(accumulator) >> in(accumulator) = out(accumulator).\nA >> B = C :-\n C = (pred(!.N::in, !:N::out, !.IO::di, !:IO::uo) is det :-\n A(!N, !IO),\n B(!N, !IO)).\n\n:- pred add(int::in, int::in, int::out, io::di, io::uo) is det.\nadd(N, !Acc, !IO) :-\n io.format(\"adding %d to accumulator (current value: %d)\\n\",\n [i(N), i(!.Acc)], !IO),\n !:Acc = !.Acc + N.\n\n:- pred example2(io::di, io::uo) is det.\nexample2(!IO) :-\n F = add(5)\n >> add(5)\n >> add(-10),\n F(0, X, !IO),\n io.print_line(X, !IO).\n","language":"Mercury"},{"code":":- module evenodd.\n:- interface.\n:- import_module io.\n:- pred main(io::di, io::uo) is det.\n:- implementation.\n:- import_module list, string.\n\n:- type coin\n ---> heads\n ; tails.\n\n:- inst heads for coin/0\n ---> heads.\n:- inst tails for coin/0\n ---> tails.\n\nmain(!IO) :-\n (if heads(heads, N) then\n print_heads(N, !IO)\n else true).\n\n:- pred print_heads(coin::in(heads), io::di, io::uo) is det.\nprint_heads(_, !IO) :-\n io.write_string(\"heads\\n\", !IO).\n\n:- pred print_tails(coin::in(tails), io::di, io::uo) is det.\nprint_tails(_, !IO) :-\n io.write_string(\"tails\\n\", !IO).\n\n:- pragma foreign_export_enum(\"C\", coin/0, [prefix(\"COIN_\"), uppercase]).\n\n:- pred heads(coin::in, coin::out(heads)) is semidet.\n:- pragma foreign_proc(\"C\",\n heads(N::in, M::out(heads)),\n [promise_pure, will_not_call_mercury],\n\"\n M = N;\n SUCCESS_INDICATOR = N == COIN_HEADS;\n\").\n","language":"Mercury"},{"code":"foo equ 0x100\nbar equ foo+1\n;it's heavily implied that \"foo\" is one byte, otherwise, why would you label this? But you should always comment your variables.\n","language":"MIPS-Assembly"},{"code":"li $t0,5 ;load the register $t0 with the value 5.\n","language":"MIPS-Assembly"},{"code":".definelabel USER_RAM,0xA0000000\nfoo equ 0x100 ;represents an offset from USER_RAM. Indexed offsetting can only be done at compile time in MIPS.\n\nla $t0,USER_RAM\nnop ;load delay slot ($t0 might not be ready by the time the load occurs)\nlbu $t1,foo($t0) ;load the unsigned byte from memory address 0xA0000100\n","language":"MIPS-Assembly"},{"code":"MODULE Foo EXPORTS Main;\n\nIMPORT IO, Fmt;\n\nVAR foo: INTEGER := 5; (* foo is global (to the module). *)\n\nPROCEDURE Foo() =\n VAR bar: INTEGER := 10; (* bar is local to the procedure Foo. *)\n BEGIN\n IO.Put(\"foo + bar = \" & Fmt.Int(foo + bar) & \"\\n\");\n END Foo;\n\nBEGIN\n Foo();\nEND Foo.\n","language":"Modula-3"},{"code":"PROCEDURE Foo(n: INTEGER) =\n","language":"Modula-3"},{"code":"PROCEDURE Foo(VAR n: INTEGER) =\n","language":"Modula-3"},{"code":"// variable definition and initialization/assignment\n//\n// variables are initialized when they are defined\na = 1\nb = 2\nc = null\n\n// datatypes\n//\n// variables may contain any datatype, and this can be\n// changed at any time by assigning a new value. they may\n// also contain native java types\nvar = \"a string\"\nvar = 123\nvar = new(Nanoquery.Util.Random)\nvar = new(java.lang.Object)\n\n// scope\n//\n// all classes, functions, and control blocks have their\n// own scope\nx = 5\nfor i in range(1, 2)\n // we can reference 'x' within this loop without issue\n println x\n\n // we can also define variables that have this loop as their\n // scope\n y = 5\nend\n// trying to reference the variable 'y' outside of its scope would result\n// in a null reference exception\nprintln y\n//%null reference exception: variable object 'y' has not been defined\n// at <global>:33\n\n\n// referencing\n//\n// as already demonstrated, variables are referenced by using their\n// name\npart1 = \"this is \"\npart2 = \"a test sentence\"\nprintln part1 + part2\n\n// other facilities\n//\n// variables may be marked for garbage collection in their current\n// scope using the 'delete' command\ntest_var = \"pretend this is a really large object we want to free up\"\ndelete test_var\n","language":"Nanoquery"},{"code":"var x: int = 3 # Declaration with type specification and initialization.\n\nvar y = 3 # Declaration with type inferred to \"int\".\n\nvar z: int # Variable is initialized to 0.\n\nlet a = 13 # Immutable variable.\n\n# Using a var block to initialize.\nvar\n b, c: int = 10 # Two variables initialized to 10\n s* = \"foobar\" # This one is exported.\n\ntype Obj = ref object\n i: int\n s: string\n\nvar obj = Obj(i: 3, s: \"abc\") # Initialization with an implicit allocation by \"new\".\necho obj.a, \" \", obj.s # Equivalent to obj[].a and obj[].s.\n\nproc p =\n var xloc = 3\n echo x # Referencing a global variable.\n\n proc q =\n echo xloc # Referencing a variable in the enclosing scope.\n","language":"Nim"},{"code":"a : Int;\nb : Int := 13;\nc := 7;\n","language":"Objeck"},{"code":"let x = 28\n","language":"OCaml"},{"code":"let y = ref 28\n","language":"OCaml"},{"code":" !y (* access *)\n y := 34 (* modification *)\n","language":"OCaml"},{"code":"let sum = (* sum is bound to 181 *)\n let a = 31\n and b = 150 in\n (a + b)\n\nlet sum () = (* sum is a function which returns 181 *)\n let a = 31\n and b = 150 in\n (a + b)\n","language":"OCaml"},{"code":"import: date\n\n: testVariable\n| a b c |\n Date now ->a\n a println ;\n","language":"Oforth"},{"code":"; Declare the symbol 'var1' and associate number 123 with it.\n(define var1 123)\n(print var1)\n; ==> 123\n\n; Reassociate number 321 with var1.\n(define var1 321)\n(print var1)\n\n; Create function that prints value of var1 ...\n(define (show)\n (print var1))\n; ... and eassociate number 42 with var1.\n(define var1 42)\n\n(print var1)\n; ==> 42\n; var1 prints as 42, but...\n(show)\n; ==> 321\n; ... function 'show' still print old associated value\n","language":"Ol"},{"code":"a.=4711\nSay 'before sub a.3='a.3\nCall sub a.\nSay ' after sub a.3='a.3\nExit\nsub: Procedure\nuse Arg a.\na.3=3\nReturn\n","language":"OoRexx"},{"code":"mynumber=5+4; // This gives a value of nine\n","language":"Openscad"},{"code":"'WAYS OF DECLARING VARIABLES\n'AND ASSIGNING VALUES\nvar int a,b,c,d\nint a=1,b=2,c=3,d=4\ndim int a=1,b=2, c=3, d=4\ndim as int a=1,b=2, c=3, d=4\ndim a=1,b=2, c=3, d=4 as int\nprint c '3\n\n'CREATING ARRAY VARIABLES\nint array[100]\ndim int a={10,20,30,40} 'implicit array\nprint a[3] '30\n\n'COMMONLY USED TYPES:\n'byte word int sys float char string\n\n'LIMITING SCOPE\ndim int a=10\nscope\n dim int a=100\n dim int b=1000\n print a '100\nend scope\nprint a 'prior a: 10\nprint b 'error b is out of scope\n\n'REFERENCING VARIABLES\ndim int*p 'p is a pointer variable\ndim int a={2,4,6,8}\n@p=@a[3] 'address of p is assigned address of a[3]\nprint @p 'the address\nprint p '6\nprint p[1] '6\nprint p[2] '8\n","language":"OxygenBasic"},{"code":"declare\nVar %% new variable Var, initially free\n{Show Var}\nVar = 42 %% now Var has the value 42\n{Show Var}\nVar = 42 %% the same value is assigned again: ok\nVar = 43 %% a different value is assigned: exception\n","language":"Oz"},{"code":"declare\n V = 42\nin\n {Wait V} %% explicitly wait for V to become determined\n\n if {IsDet V} then %% check whether V is determined; not recommended\n {Show determined}\n elseif {IsFree V} then %% check whether V is free; not recommended\n {Show free}\n end\n","language":"Oz"},{"code":"declare\n A = {NewCell 42}\n OldVal\nin\n {Show @A} %% read a cell with @\n A := 43 %% change its value\n OldVal = A := 44 %% read and write at the same time (atomically)\n","language":"Oz"},{"code":"declare\n A = 3\n B\nin\n A = B\n {Show B}\n","language":"Oz"},{"code":"declare\n A = 3\n A = B %% Error: variable B not introduced\nin\n {Show B}\n","language":"Oz"},{"code":"declare\n [A B C D] = [1 2 3 4] %% unification of two lists\n","language":"Oz"},{"code":"functor\nexport Function\ndefine\n ToplevelVariable = 42\n\n fun {Function}\n 42\n end\nend\n","language":"Oz"},{"code":"fun {Function Arg}\n LocalVar1\nin\n LocalVar1 = if Arg == 42 then\n\t\t LocalVar2\n\t in\n\t\t LocalVar2 = yes\n\t\t LocalVar2\n\t else\n\t\t LocalVar3 = no %% variables can be initialized when declared\n\t in\n\t\t LocalVar3\n\t end\n LocalVar1\nend\n","language":"Oz"},{"code":"if {IsEven 42} then\n {System.showInfo \"Here, LocalVar is not visible.\"}\n local\n LocalVar = \"Here, LocalVar IS visible\"\n in\n {System.showInfo LocalVar}\n end\nend\n","language":"Oz"},{"code":"case \"Rosetta code\" of First|_ then {Show First} end %% prints \"R\"\n","language":"Oz"},{"code":"declare\n A\n B = !!A %% B is a read-only view of A\nin\n thread\n B = 43 %% this blocks until A is known; then it fails because 43 \\= 42\n end\n A = 42\n","language":"Oz"},{"code":"'x\n","language":"PARI-GP"},{"code":"'x^3+7\n","language":"PARI-GP"},{"code":"sub dofruit {\n $fruit='apple';\n}\n\ndofruit;\nprint \"The fruit is $fruit\";\n","language":"Perl"},{"code":"my $x = @a; # Scalar assignment; $x is set to the\n # number of elements in @a.\nmy ($x) = @a; # List assignment; $x is set to the first\n # element of @a.\nmy @b = @a; # List assignment; @b becomes the same length\n # as @a and each element becomes the same.\nmy ($x, $y, @b) = @a; # List assignment; $x and $y get the first\n # two elements of @a, and @b the rest.\nmy ($x, $y, @b, @c, $z) = @a; # Same thing, and also @c becomes empty\n # and $z undefined.\n","language":"Perl"},{"code":"use strict;\nour $fruit; # declare a variable as global\nour $veg = \"carrot\"; # declare a global variable and define its value\n","language":"Perl"},{"code":"$fruit=\"apple\"; # this will be global by default\n\nsub dofruit {\n print \"My global fruit was $fruit,\"; # use the global variable\n my $fruit=\"banana\"; # declare a new local variable\n print \"and the local fruit is $fruit.\\n\";\n}\n\ndofruit;\nprint \"The global fruit is still $fruit\";\n","language":"Perl"},{"code":"-->\n <span style=\"color: #004080;\">integer</span> <span style=\"color: #000000;\">x</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">25</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">y</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">25</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">z</span>\n <span style=\"color: #004080;\">object</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: #0000FF;\">{{},</span> <span style=\"color: #000000;\">5</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #008000;\">\"string\"</span><span style=\"color: #0000FF;\">}</span>\n<!--\n","language":"Phix"},{"code":"-->\n <span style=\"color: #008080;\">type</span> <span style=\"color: #000000;\">hour</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #004080;\">integer</span> <span style=\"color: #000000;\">x</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #008080;\">return</span> <span style=\"color: #000000;\">x</span> <span style=\"color: #0000FF;\">>=</span> <span style=\"color: #000000;\">0</span> <span style=\"color: #008080;\">and</span> <span style=\"color: #000000;\">x</span> <span style=\"color: #0000FF;\"><=</span> <span style=\"color: #000000;\">23</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">type</span>\n <span style=\"color: #000000;\">hour</span> <span style=\"color: #000000;\">h1</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">h2</span>\n <span style=\"color: #000000;\">h1</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">10</span> <span style=\"color: #000080;font-style:italic;\">-- ok</span>\n <span style=\"color: #000000;\">h2</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">25</span> <span style=\"color: #000080;font-style:italic;\">-- error! program aborts with a message</span>\n<!--\n","language":"Phix"},{"code":"<?php\n/**\n * @author Elad Yosifon\n */\n\n\n/*\n * PHP is a weak typed language,\n * no separation between variable declaration, initialization and assignment.\n *\n * variable type is defined by the value that is assigned to it.\n * a variable name must start with a \"$\" sign (called \"sigil\", not a dollar sign).\n * variable naming rules:\n * + case-sensitive.\n * + first character after $ must not be a number.\n * + after the first character all alphanumeric chars and _(underscore) sign is allowed, e.g. $i_am_a_new_var_with_the_number_0\n *\n */\n\n# NULL typed variable\n$null = NULL;\t\t\t\tvar_dump($null);\t// output: null\n\n# defining a boolean\n$boolean = true;\t\t\tvar_dump($boolean);\t// output: boolean true\n$boolean = false;\t\t\tvar_dump($boolean);\t// output: boolean false\n\n/*\n * casting is made using (TYPE) as a prefix\n */\n# bool and boolean is the same\n$boolean = (bool)1;\t\t\tvar_dump($boolean);\t// output: boolean true\n$boolean = (boolean)1;\t\t\tvar_dump($boolean);\t// output: boolean true\n\n$boolean = (bool)0;\t\t\tvar_dump($boolean);\t// output: boolean false\n$boolean = (boolean)0;\t\t\tvar_dump($boolean);\t// output: boolean false\n\n# defining an integer\n$int = 0;\t\t\t\tvar_dump($int);\t\t// output: int 0\n\n# defining a float,\n$float = 0.01;\t\t\t\tvar_dump($float);\t// output: float 0.01\n\n# which is also identical to \"real\" and \"double\"\nvar_dump((double)$float);\t\t\t\t\t// output: float 0.01\nvar_dump((real)$float);\t\t\t\t\t\t// output: float 0.01\n\n# casting back to int (auto flooring the value)\nvar_dump((int)$float);\t\t\t\t\t\t// output: int 0\nvar_dump((int)($float+1));\t\t\t\t\t// output: int 1\nvar_dump((int)($float+1.9));\t\t\t\t\t// output: int 1\n\n# defining a string\n$string = 'string';\nvar_dump($string);\t\t\t\t\t\t// output: string 'string' (length=6)\n\n# referencing a variable (there are no pointers in PHP).\n$another_string = &$string;\nvar_dump($another_string);\n\t\t\t\t\t\t\t\t// output: string 'string' (length=6)\n\n$string = \"I'm the same string!\";\nvar_dump($another_string);\n\t\t\t\t\t\t\t\t// output: string 'I'm the same string!' (length=20)\n# \"deleting\" a variable from memory\nunset($another_string);\n\n$string = 'string';\n/*\n * a string can also be defined with double-quotes, HEREDOC and NOWDOC operators.\n * content inside double-quotes is being parsed before assignment.\n * concatenation operator is .=\n */\n$parsed_string = \"This is a $string\";\nvar_dump($parsed_string);\n\t\t\t\t\t\t\t\t// output: string 'This is a string' (length=16)\n$parsed_string .= \" with another {$string}\";\nvar_dump($parsed_string);\n\t\t\t\t\t\t\t\t// output: string 'This is a string with another string' (length=36)\n\n# with string parsing\n$heredoc = <<<HEREDOC\nThis is the content of \\$string: {$string}\nHEREDOC;\nvar_dump($heredoc);\n\t\t\t\t\t\t\t\t// output: string 'This is the content of $string: string' (length=38)\n\n# without string parsing (notice the single quotes surrounding NOWDOC)\n$nowdoc = <<<'NOWDOC'\nThis is the content of \\$string: {$string}\nNOWDOC;\nvar_dump($nowdoc);\n\t\t\t\t\t\t\t\t// output: string 'This is the content of \\$string: {$string}' (length=42)\n\n# as of PHP5, defining an object typed stdClass => standard class\n$stdObject = new stdClass();\tvar_dump($stdObject);\n\t\t\t\t\t\t\t\t// output: object(stdClass)[1]\n# defining an object typed Foo\nclass Foo {}\n$foo = new Foo();\t\tvar_dump($foo);\n\t\t\t\t\t\t\t\t// output: object(Foo)[2]\n# defining an empty array\n$array = array();\t\tvar_dump($array);\n\t\t\t\t\t\t\t\t// output: array {empty}\n\n/*\n * an array with non-integer key is also considered as an associative array(i.e. hash table)\n * can contain mixed variable types, can contain integer based keys and non-integer keys\n */\n$assoc = array(\n\t0 => $int,\n\t'integer' => $int,\n\t1 => $float,\n\t'float' => $float,\n\t2 => $string,\n\t'string' => $string,\n\t3 => NULL, // <=== key 3 is NULL\n\t3, // <=== this is a value, not a key (key is 4)\n\t5 => $stdObject,\n\t'Foo' => $foo,\n);\nvar_dump($assoc);\n\n// output:\n// =======\n//\tarray\n//\t 0 => int 0\n//\t 'integer' => int 0\n//\t 1 => float 0.01\n//\t 'float' => float 0.01\n//\t 2 => string 'string' (length=6)\n//\t 'string' => string 'string' (length=6)\n//\t 3 => null\n//\t 4 => int 3\n//\t 5 =>\n//\t \tobject(stdClass)[1]\n//\t 'Foo' =>\n//\t\t object(Foo)[2]\n\n\n\n/*\n * all variables are \"global\" but not reachable inside functions(unless specifically \"globalized\" inside)\n */\n\nfunction a_function()\n{\n\t# not reachable\n\tvar_dump(isset($foo));\t\t\t\t// output: boolean false\n\n\tglobal $foo;\n\t# \"global\" (reachable) inside a_function()'s scope\n\tvar_dump(isset($foo));\t\t\t\t// output: boolean true\n}\n\na_function();\n\n/**\n * there is another special type of variable called (Resource).\n * for more info regarding Resources:\n * @url http://php.net/manual/en/language.types.resource.php\n * @url http://php.net/manual/en/resource.php\n */\n","language":"PHP"},{"code":"(use (A B C)\n (setq A 1 B 2 C 3)\n ... )\n","language":"PicoLisp"},{"code":"(let (A 1 B 2 C 3)\n ... )\n","language":"PicoLisp"},{"code":"(use A\n (setq A ..)\n ... )\n\n(let A 1\n ...)\n","language":"PicoLisp"},{"code":"/* The PROCEDURE block and BEGIN block are used to delimit scopes. */\n\ndeclare i float; /* external, global variable, excluded from the */\n /* local area (BEGIN block) below. */\nbegin;\n declare (i, j) fixed binary; /* local variable */\n get list (i, j);\n put list (i,j);\nend;\n\n/* Examples of initialization. */\n\ndeclare p fixed initial (25);\ndeclare q(7) fixed initial (9, 3, 5, 1, 2, 8, 15);\n /* sets all elements of array Q at run time, on block entry. */\ndeclare r(7) fixed initial (9, 3, 5, 1, 2, 8, 15);\n /* sets all elements of array R at compile time. */\n\np = 44; /* run-time assignment. */\nq = 0; /* run-time initialization of all elements of Q to zero. */\nq = r; /* run-time assignment of all elements of array R to */\n /* corresponding elemets of S. */\n","language":"PL-I"},{"code":"var counter: I32 = 10 // mutable variable 'counter' with value 10\nlet temp: F64 = 36.6 // immutable variable 'temp'\nlet str: String // immutable variable 'str' with no initial value\nstr = \"i am a string\" // variables must be initialized before use\nlet another_str = \"i am another string\" // type of variable 'another_str' infered from assigned value\n\nlet b = true\nlet b' = false // variable names can contain ' to make a distinct variable with almost the same name\n","language":"Pony"},{"code":"var x: I32 = 10\nvar y: I32 = x = 20\ntry\n Fact(x == 20) // x gets the new value of 20\n Fact(y == 10) // y gets the old value of x which is 10\nend\n","language":"Pony"},{"code":"$s = \"abc\"\n$i = 123\n","language":"PowerShell"},{"code":"4 + $foo # yields 4\n\"abc\" + $foo + \"def\" # yields \"abcdef\"\n","language":"PowerShell"},{"code":"Get-ChildItem Variable:\n","language":"PowerShell"},{"code":"Remove-Item Variable:foo\n","language":"PowerShell"},{"code":"Get-Variable # retrieves the value of a variable\nNew-Variable # creates a new variable\nSet-Variable # sets the value of a variable\nClear-Variable # deletes the value of a variable, but not the variable itself\nRemove-Variable # deletes a variable completely\n","language":"PowerShell"},{"code":"mortal(X) :- man(X).\nman(socrates).\n","language":"Prolog"},{"code":"student(X,Y) :- taught(Y,X).\ntaught(socrates,plato).\n","language":"Prolog"},{"code":"?- mortal(socrates).\nyes\n?- student(X,socrates).\nX=plato\n?- student(socrates,X).\nno\n","language":"Prolog"},{"code":"?- mortal(zeus).\nno\n","language":"Prolog"},{"code":"mortal(X) :- man(Y).\n","language":"Prolog"},{"code":"; Variables are initialized when they appear in sourcecode with default value of 0 and type int\nDebug a\n; or value \"\" for a string, they are not case sensitive\nDebug b$\n; This initializes a double precision float, if type is following the dot\nDebug c.d\n; They can be initialized with define (double precision float, string, integer)\nDefine d.d = 3.5, e$ = \"Test\", f.i = a + 2\n; Define can have a default type (all bytes except j which is long):\nDefine.b g, h, j.l\n; Define without following variables sets default type. In this case to single precision float\nDefine.f\n; So this will be an single precision float and no integer\nDebug k\n; EnableExplicit forces declaration of used variables with define\nEnableExplicit\n; Will throw an error because L isn't initialized\nDebug L\nDisableExplicit\n; Global Variables are available in Procedures and Threads too\nGlobal M = 3, N = 2\nProcedure Dummy(parameter1, parameter2 = 20)\n ; Parameter contain values which where used when calling the function,\n ; their types have to be specified in the above Procedure header.\n ; The last ones can have default values which get applied if this parameter is not given.\n\n ; Variables in Procedures are separate from those outside,\n ; so d can be initialized again with another type\n ; which would otherwise lead to an error\n d.i\n ; Protected makes a variable local even if another one with same name is declared as global (see above)\n Protected M = 2\n ; Shares a variable with main program like it was declared by global\n Shared a\n ; prevents a variable to be initialized with default value again when procedure is called a second time,\n ; could be used for example as a counter, which contains the number of times a function was called\n Static a\n ; N here also would have a value of 2, while for example\n ; f would, when named, initialize a new variable, and so have a value of 0\nEndProcedure\n; finally there are constants which are prefixed by an #:\n#Test = 1\n; Their value cannot be changed while program is running\n#String_Constant = \"blubb\"\n; In constrast to variables, a constant has no types except an (optional) $ sign to mark it as string constant\n#Float_Constant = 2.3\n; Maps, LinkedLists , Arrays and Structures are not handled here, because they are no elemental variables\n","language":"PureBasic"},{"code":"# these examples, respectively, refer to integer, float, boolean, and string objects\nexample1 = 3\nexample2 = 3.0\nexample3 = True\nexample4 = \"hello\"\n\n# example1 now refers to a string object.\nexample1 = \"goodbye\"\n","language":"Python"},{"code":"foo <- 3.4\nbar = \"abc\"\n","language":"R"},{"code":"baz <- quux <- 1:10\nTRUE -> quuux\n","language":"R"},{"code":"a <- 3\n\nassignmentdemo <- function()\n{\n message(\"assign 'a' locally, i.e. within the scope of the function\")\n a <- 5\n message(paste(\"inside assignmentdemo, a = \", a))\n message(paste(\"in the global environment, a = \", get(\"a\", envir=globalenv())))\n\n message(\"assign 'a' globally\")\n a <<- 7\n message(paste(\"inside assignmentdemo, a = \", a))\n message(paste(\"in the global environment, a = \", get(\"a\", envir=globalenv())))\n}\nassignmentdemo()\n","language":"R"},{"code":"assign(\"b\", TRUE) #equivalent to b <- TRUE\nassign(\"c\", runif(10), envir=globalenv()) #equivalent to c <<- runif(10)\n","language":"R"},{"code":"#lang racket\n\n;; define a variable and initialize it\n(define foo 0)\n;; increment it\n(set! foo (add1 foo))\n\n;; Racket is lexically scoped, which makes local variables work:\n(define (bar)\n (define foo 100)\n (set! foo (add1 foo))\n foo)\n(bar) ; -> 101\n\n;; and it also makes it possible to have variables with a global value\n;; that are accessible only in a specific local lexical scope:\n(define baz\n (let () ; used to create a new scope\n (define foo 0)\n (define (bar)\n (set! foo (add1 foo))\n foo)\n bar)) ; this is the value that gets bound to `baz'\n(list (baz) (baz) (baz)) ; -> '(1 2 3)\n\n;; define a new type, and initialize a variable with an instance\n(struct pos (x y))\n(define p (pos 1 2))\n(list (pos-x p) (pos-y p)) ; -> '(1 2)\n\n;; for a mutable reference, a struct (or some specific fields in a\n;; struct) can be declared mutable\n(struct mpos (x y) #:mutable)\n(define mp (mpos 1 2))\n(set-mpos-x! mp 11)\n(set-mpos-y! mp 22)\n(list (mpos-x mp) (mpos-y mp)) ; -> '(11 22)\n\n;; but for just a mutable value, we have boxes as a builtin type\n(define b (box 10))\n(set-box! b (add1 (unbox b)))\n(unbox b) ; -> 11\n\n;; (Racket has many more related features: static typing in typed\n;; racket, structs that are extensions of other structs,\n;; pattern-matching on structs, classes, and much more)\n","language":"Racket"},{"code":"my @y = <A B C D>; # Array of strings 'A', 'B', 'C', and 'D'\nsay @y[2]; # the @-sigil requires the container to implement the role Positional\n@y[1,2] = 'x','y'; # that's where subscripts and many other things come from\nsay @y; # OUTPUT«[A x y D]» # we start to count at 0 btw.\n\nmy $x = @y; # $x is now a reference for the array @y\n\nsay $x[1]; # prints 'x' followed by a newline character\n\nmy Int $with-type-check; # type checks are enforced by the compiler\n\nmy Int:D $defined-i = 10; # definedness can also be asked for and default values are required in that case\n\nmy Int:D $after-midnight where * > 24 = 25; # SQL is fun and so is Raku\n\nmy \\bad = 'good'; # if you don't like sigils\nsay bad; # you don't have to use them\nsay \"this is quite bad\"; # but then string interpolation\nsay \"this is quite {bad}\" # becomes more wordy\n","language":"Raku"},{"code":"say ++$; # this is an anonymous state variable\nsay ++$; # this is a different anonymous state variable, prefix:<++> forces it into numerical context and defaults it to 0\nsay $+=2 for 1..10; # here we do something useful with another anonymous variable\n\nsub foo { $^a * $^b } # for positional arguments we often can't be bothered to declare them or to give them fancy names\nsay foo 3, 4;\n","language":"Raku"},{"code":" Type Name = Exp;\n","language":"Rascal"},{"code":"Type Name;\n","language":"Rascal"},{"code":"rascal>int max = 100;\nint: 100\nrascal>min = 0;\nint: 0\n","language":"Rascal"},{"code":"rascal>day = {<\"mon\", 1>, <\"tue\", 2>, <\"wed\",3>,\n>>>>>>> <\"thu\", 4>, <\"fri\", 5>, <\"sat\",6>, <\"sun\",7>};\nrel[str, int]: {\n <\"thu\",4>,\n <\"mon\",1>,\n <\"sat\",6>,\n <\"wed\",3>,\n <\"tue\",2>,\n <\"fri\",5>,\n <\"sun\",7>\n}\n","language":"Rascal"},{"code":"rascal>int month = 12;\nint: 12\nrascal>month =\"December\";\n|stdin:///|(7,10,<1,7>,<1,17>): Expected int, but got str\n","language":"Rascal"},{"code":"rascal>if( 4 > 3){ x = \"abc\"; } else { x = \"def\";}\nstr: \"abc\"\nrascal>x;\n|stdin:///|(0,1,<1,0>,<1,1>): Undeclared variable, function or constructor: x\n","language":"Rascal"},{"code":"aa = 10 /*assigns chars 10 ───► AA */\nbb = '' /*assigns a null value ───► BB */\ncc = 2*10 /*assigns chars 20 ───► CC */\ndd = 'Adam' /*assigns chars Adam ───► DD */\nee = \"Adam\" /*same as above ───► EE */\nff = 10. /*assigns chars 10. ───► FF */\ngg = '10.' /*same as above ───► GG */\nhh = \"+10\" /*assigns chars +10 ───► hh */\nii = 1e1 /*assigns chars 1e1 ───► ii */\njj = +.1e+2 /*assigns chars .1e+2 ───► jj */\n","language":"REXX"},{"code":"kk = '123'x /*assigns hex 00000123 ───► KK */\nkk = 'dead beaf'X /*assigns hex deadbeaf ───► KK */\nll = '0000 0010'b /*assigns blank ───► LL (ASCII) */\nmm = '0000 0100'B /*assigns blank ───► MM (EBCDIC)*/\n\nxxx = '11 2. 333 -5'\nparse var xxx nn oo pp qq rr\n /*assigns 11 ───► NN */\n /*assigns 2. ───► OO */\n /*assigns 333 ───► PP */\n /*assigns ─5 ───► QQ */\n /*assigns \"null\" ───► RR */\n\n /*a \"null\" is a string of length zero (0), */\n /*and is not to be confused with a null char.*/\n\ncat = 'A cat is a lion in a jungle of small bushes.'\n /*assigns a literal ───► CAT */\n","language":"REXX"},{"code":"call value 'CAT', \"When the cat's away, the mice will play.\"\n /*assigns a literal ───► CAT */\nyyy='CA'\ncall value yyy'T', \"Honest as the Cat when the meat's out of reach.\"\n /*assigns a literal ───► CAT */\nyyy = 'CA'\ncall value yyy || 'T', \"Honest as the Cat when the meat's out of reach.\"\n /*assigns a literal ───► CAT */\n","language":"REXX"},{"code":"/*REXX pgm to do a \"bad\" assignment (with an unassigned REXX variable).*/\n\nsignal on noValue /*usually, placed at pgm start. */\n\nxxx=aaaaa /*tries to assign aaaaa ───► xxx */\n\nsay xxx 'or somesuch'\nexit\n\nnoValue: /*this can be dressed up better. */\nbadLine =sigl /*REXX line number that failed. */\nbadSource=sourceline(badLine) /*REXX source line ··· */\nbadVar =condition('D') /*REXX var name that's ¬ defined.*/\nsay\nsay '*** error! ***'\nsay 'undefined variable' badvar \"at REXX line number\" badLine\nsay\nsay badSource\nsay\nexit 13\n","language":"REXX"},{"code":"/*REXX pgm shows different scopes of a variable: \"global\" and \"local\".*/\nq = 55 ; say ' 1st q=' q /*assign a value ───► \"main\" Q.*/\ncall sub ; say ' 2nd q=' q /*call a procedure subroutine. */\ncall gyro ; say ' 3rd q=' q /*call a procedure with EXPOSE. */\ncall sand ; say ' 4th q=' q /*call a subroutine or function. */\nexit /*stick a fork in it, we're done.*/\n/*──────────────────────────────────SUB subroutine──────────────────────*/\nsub: procedure /*use PROCEDURE to use local vars*/\nq = -777 ; say ' sub q=' q /*assign a value ───► \"local\" Q. */\nreturn\n/*──────────────────────────────────GYRO subroutine─────────────────────*/\ngyro: procedure expose q /*use EXPOSE to use global var Q.*/\nq = \"yuppers\" ; say 'gyro q=' q /*assign a value ───► \"exposed\" Q*/\nreturn\n/*──────────────────────────────────SAND subroutine─────────────────────*/\nsand: /*all REXX variables are exposed.*/\nq = \"Monty\" ; say 'sand q=' q /*assign a value ───► \"global\" Q*/\nreturn\n","language":"REXX"},{"code":"aaa. = '───────nope.' /*assign this string as a default*/\naaa.1=1 /*assign 1 to first element.*/\naaa.4=4. /* \" 4 \" fourth \" */\naaa.7='lucky' /* \" 7 \" seventh \" */\n do j=0 to 8 /*go through a bunch of elements.*/\n say 'aaa.'||j '=' aaa.j /*display element # and its value*/\n end /*we could've started J at -100.*/\n","language":"REXX"},{"code":"radius=6.28 /*assign a value to a variable. */\n say 'radius =' radius\ndrop radius /*now, \"undefine\" the variable. */\n say 'radius =' radius\n","language":"REXX"},{"code":"var.='something' /* sets all possible compound variables of stem var. */\nx='3 '\nvar.x.x.4='something else'\nDo i=1 To 5\n a=left(i,2)\n Say i var.a.a.4 \"(tail is '\"a||'.'||a||'.'||'4'\"')\"\n End\n","language":"REXX"},{"code":"<Variable Name> = <Value>\n","language":"Ring"},{"code":"x = \"Hello\" # x is a string\nsee x + nl\nx = 5 # x is a number (int)\nsee x + nl\nx = 1.2 # x is a number (double)\nsee x + nl\nx = [1,2,3,4] # x is a list\nsee x # print list items\nx = date() # x is a string contains date\nsee x + nl\nx = time() # x is a string contains time\nsee x + nl\nx = true # x is a number (logical value = 1)\nsee x + nl\nx = false # x is a number (logical value = 0)\nsee x + nl\n","language":"Ring"},{"code":"list = [1,2,3,\"four\",\"five\"]\nlist2 = list\nlist = []\nSee list # print the first list - no items to print\nSee \"********\" + nl\nSee list2 # print the second list - contains 5 items\n","language":"Ring"},{"code":"<NUMBER> + <STRING> --> <NUMBER>\n<STRING> + <NUMBER> --> <STRING>\n","language":"Ring"},{"code":"x = 10 # x is a number\ny = \"20\" # y is a string\nsum = x + y # sum is a number (y will be converted to a number)\nMsg = \"Sum = \" + sum # Msg is a string (sum will be converted to a string)\nsee Msg + nl\n","language":"Ring"},{"code":"$a_global_var = 5\nclass Demo\n @@a_class_var = 6\n A_CONSTANT = 8\n def initialize\n @an_instance_var = 7\n end\n def incr(a_local_var)\n @an_instance_var += a_local_var\n end\nend\n","language":"Ruby"},{"code":"let var01; // The compiler will infer the type or the compiler will ask for type annotations if the type can't be inferred\nlet var02: u32; // The compiler will check if a value is assigned to var02 before being used\nlet var03 = 5; // The compiler will infer the type or it will fallback to i32\nlet var04 = 5u8; // Initialization to unsigned 8 bit (u8) number 5\nlet var05: i8 = 5; // Type annotation + Initialization\nlet var06: u8 = 5u8; // Type annotation + Initialization\nvar01 = var05; // This line makes the compiler infer var01 should be a signed 8 bit number (i8).\nvar02 = 9u32; // Assigning to var02 after declaration\n","language":"Rust"},{"code":"let mut var07;\nlet mut var08: f32;\nlet mut var09 = 1.5;\nlet mut var10 = 2.5f32;\nlet mut var11: f32 = 5.0;\nlet mut var12: f64 = 5.0f64;\nvar07 = var11; // This line makes the compiler infer var07 should be a f32.\nvar08 = 3.1416f32; // Assigning to var08 after declaration\nvar08 = 2.7183f32; // Reassigning var08 since it can be reassigned since it is mutable.\n","language":"Rust"},{"code":"let _notused = 10;\nlet mut _mutnotused = 42;\n","language":"Rust"},{"code":"$ include \"seed7_05.s7i\";\n\nvar integer: foo is 5; # foo is global\n\nconst proc: aFunc is func\n local\n var integer: bar is 10; # bar is local to aFunc\n begin\n writeln(\"foo + bar = \" <& foo + bar);\n end func;\n\nconst proc: main is func\n begin\n aFunc;\n end func;\n","language":"Seed7"},{"code":"set a 0 > Useless intialization - All lowercase variables have an initial value of 0\nset b 66 > Simple variable assignment - ''b'' is now the ASCII value of 66, or the character 'B'\n[c=0] set c 5 > Conditional variable assignment - If ''c'' is 0, then set ''c'' to 5\nset ? 6 > A \"goto\" command; Setting the ''?'' variable defines the line of code to be executed next\nset z 1 > This line of code will never be executed, because the previous skipped it\nset c 10 > Line #5 skipped to here\nset d A > Assigning a variable to another variable - ''d'' is now ASCII 65, or the character 'A'\nset b ! > The ''!'' deals with I/O. Setting a variable to it receives an input character and assigns it to the variable\nset ! a > Setting the exclamation point to a variable outputs that variable\nset e (d+1) > Combiners are defined inside round brackets - () - and have an addition and a subtraction function\nset f (e-1) > Variable ''e'' was assigned to ''d'' + 1 (65 + 1 = 66, character B), and ''f'' was assigned to ''e'' - 1 (66 - 1 = 65, character A)\n","language":"Set-lang"},{"code":"x = 14\ny = 0.4E3\nz = 3-2i\n","language":"Smart-BASIC"},{"code":"t$ = \"Name\"\n","language":"Smart-BASIC"},{"code":"n$ = \"\"\"This is a quoted text\"\"\"\n","language":"Smart-BASIC"},{"code":"n = 4\na$ = \"6 feet\"\nPRINT n * a$\n","language":"Smart-BASIC"},{"code":"DIM name$(100)\n","language":"Smart-BASIC"},{"code":"DEF MyFunction(x)\nMyF2 = x^2\nMyF3 = x^3\nMyFunction = MyF2 + MyF3\nEND DEF\n","language":"Smart-BASIC"},{"code":"x = MyFunction(3)\nPRINT x; MyFunction.MyF2; MyFunction.MyF3\n","language":"Smart-BASIC"},{"code":"DEF num=123\n","language":"Smart-BASIC"},{"code":" define('foo(x,y)a,b,c') :(foo_end)\nfoo a = 1; b = 2; c = 3\n foo = a * ( x * x ) + b * y + c :(return)\nfoo_end\n","language":"SNOBOL4"},{"code":"a += 1\n","language":"SPL"},{"code":"a = a+1\n","language":"SPL"},{"code":"a = 1\nb,c,d = 0\n","language":"SPL"},{"code":"r = ~a\na = 3\n#.output(r)\nr = 5\n#.output(a)\n","language":"SPL"},{"code":"// variable declaration\nvar table, chair;\n\n// assignment\nvar table = 10, chair = -10;\n\n// multiple assignment to the same value\ntable = chair = 0;\n\n// multiple assignment to an array\n(\nvar table, chair;\n#table, chair = [10, -10];\n#table ... chair = [10, -10, 2, 3]; // with ellipsis: now chair is [-10, 2, 3]\n)\n\n// the letters a-z are predeclared in the interpreter for interactive programming\na = 10; x = a - 8;\n\n// variables are type-neutral and mutable: reassign to different objects\na = 10; a = [1, 2, 3]; a = nil;\n\n// immutable variables (only in class definitions)\nconst z = 42;\n\n// lexical scope\n// the closures g and h refer to different values of their c\n(\nf = {\n\tvar c = 0;\n\t{ c = c + 1 }\n};\ng = f.value;\nh = f.value;\nc = 100; // this doesn't change it.\n)\n\n// dynamic scope: environments\nf = { ~table = ~table + 1 };\nEnvironment.use { ~table = 100; f.value }; // 101.\nEnvironment.use { ~table = -1; f.value }; // 0.\n\n// there is a default environment\n~table = 7;\nf.value;\n\n// lexical scope in environments:\n(\nEnvironment.use {\n\t~table = 100;\n\tf = { ~table = ~table + 1 }.inEnvir;\n};\n)\nf.value; // 101.\n\n// because objects keep reference to other objects, references are not needed:\n// objects can take the role of variables. But there is a Ref object, that just holds a value\n\na = Ref([1, 2, 3]); // a reference to an array, can also be written as a quote `[1, 2, 3];\nf = { |x| x.value = x.value.squared }; // a function that operates on a ref\nf.(a); // `[ 1, 4, 9 ]\n\n// proxy objects serve as delegators in environments. This can be called line by line:\nProxySpace.push;\n~z // returns a NodeProxy\n~z.play; // play a silent sound\n~z = ~x + ~y; // make it the sum of two silent sounds\n~x = { PinkNoise.ar(0.1) }; // … which now are noise,\n~y = { SinOsc.ar(440, 0, 0.1) }; // and a sine tone\n","language":"SuperCollider"},{"code":"import Foundation\n\n// All variables declared outside of a struct/class/etc are global\n\n// Swift is a typed language\n// Swift can infer the type of variables\nvar str = \"Hello, playground\" // String\nlet letStr:String = \"This is a constant\"\n\n// However, all variables must be initialized\n// Intialize variable of type String to nil\nvar str1:String! // str1 is nil\n\n// Assign value to str1\nstr1 = \"foo bar\" // str1 is foo bar\n\n// Swift also has optional types\n// Declare optional with type of String\nvar optionalString = Optional<String>(\"foo bar\") // (Some \"foo bar\")\n\nprintln(optionalString) // Optional(\"foo bar\")\n\n// Optionals can also be declared with the shorthand ?\nvar optionalString1:String? = \"foo bar\"\n\n// ! can be used to force unwrap but will throw a runtime error if trying to unwrap a nil value\nprintln(optionalString1!)\n\noptionalString1 = nil // Is now nil\n// println(optionalString1!) would now throw a runtime error\n\n// Optional chaining can be used to gracefully fail if there is a nil value\nif let value = optionalString1?.lowercaseString {\n // Is never executed\n} else {\n println(\"optionalString1 is nil\")\n}\n\n// Swift also has type aliasing\ntypealias MyNewType = String // MyNewType is an alias of String\nvar myNewTypeString = MyNewType(\"foo bar\")\n\n// Swift also has special types Any and AnyObject\n// Any can hold any type\n// AnyObject can hold any object type\nlet myAnyObjectString:AnyObject = \"foo bar\"\n\n// Downcast myAnyObjectString to String\nif let myString = myAnyObjectString as? String {\n println(myString) // foo bar\n} else {\n println(\"myString is not a string\")\n}\n\n// Swift treats functions as first-class\n// Declare a variable with a type of a function that takes no args\n// and returns Void\nvar myFunc:(() -> Void)\nfunc showScopes() {\n // Variable is scoped to function\n let myFunctionVariable = \"foo bar function\"\n\n // Nested functions inherit variables declared in enclosing scope\n func nestFunc() {\n println(myFunctionVariable)\n }\n nestFunc()\n}\n\nmyFunc = showScopes // myFunc is now showScopes\nmyFunc() // foo bar function\n","language":"Swift"},{"code":"namespace eval foo {\n # Define a procedure with two formal arguments; they are local variables\n proc bar {callerVarName argumentVar} {\n ### Associate some non-local variables with the procedure\n global globalVar; # Variable in global namespace\n variable namespaceVar; # Variable in local (::foo) namespace\n # Access to variable in caller's context; may be local or global\n upvar 1 callerVarName callerVar\n\n ### Reading a variable uses the same syntax in all cases\n puts \"caller's var has $callerVar\"\n # But global and namespace vars can be accessed by using qualified names\n puts \"global var has $globalVar which is $::globalVar\"\n\n ### Writing a variable has no special syntax\n ### but [set] is by far the most common command for writing\n set namespaceVar $globalVar\n incr globalVar\n\n ### Destroying a variable is done like this\n unset argumentVar\n }\n}\n","language":"Tcl"},{"code":":1→A\n","language":"TI-83-BASIC"},{"code":"Local mynum, myfunc\n","language":"TI-89-BASIC"},{"code":"Define mynum = 1 © Two ways to assign a number\n1 → mynum\n\nDefine myfunc(x) = (sin(x))^2 © Two ways to assign a function\n(sin(x))^2 → myfunc(x)\n\nDefine myfunc(x) = Func © Multi-statement function\n If x < 0 Then\n Return –x\n Else\n Return x\n EndIf\nEndFunc\n","language":"TI-89-BASIC"},{"code":"$$ MODE TUSCRIPT,{}\nvar1=1, var2=\"b\"\nPRINT \"var1=\",var1\nPRINT \"var2=\",var2\n\nbasket=*\nDATA apples\nDATA bananas\nDATA cherry\n\nLOOP n,letter=\"a'b'c\",fruit=basket\nvar=CONCAT (letter,n)\nSET @var=VALUE(fruit)\nPRINT var,\"=\",@var\nENDLOOP\n","language":"TUSCRIPT"},{"code":"@(cases)\nhey @a\nhow are you\n@(or)\nhey @b\nlong time no see\n@(end)\n","language":"TXR"},{"code":"@(maybe)\n@a bar\n@(or)\nfoo @b\n@(end)\n","language":"TXR"},{"code":"#!/bin/sh\n# The unix shell uses typeless variables\napples=6\n# pears=5+4 # Some shells cannot perform addition this way\npears = `expr 5+4` # We use the external expr to perform the calculation\nmyfavourite=\"raspberries\"\n","language":"UNIX-Shell"},{"code":"# variable declaration\n#\n# declare [type] [name]\n# \t-or-\n# decl [type] [name]\ndecl int test\n\n# initialization / assignment\n#\n# the set statement can be used to init variables and\n# assign values to them\nset test 10\n\n# datatypes\n#\n# ursa currently has 10 built-in types, but\n# more may be added in the future.\n# boolean\n# double\n# file\n# function\n# int\n# iodevice\n# port\n# serverport\n# string\n# task\n#\n# also, java classes may be used as data types\n# cygnus/x ursa\n\n# scope\n#\n# there is a global variable space, and functions\n# have their own scope. control statements (for,\n# if, try, while) don't have their own scope yet,\n# but this will be implemented in the near future\n\n# referencing\n#\n# variables are referenced by their name\ndecl port p\nout p endl console\n","language":"Ursa"},{"code":"name := 'Bob'\nage := 20\nlarge_number := i64(9999999999)\n","language":"V-(Vlang)"},{"code":"mut age := 20\nprintln(age) // 20\nage = 21\nprintln(age) // 21\n","language":"V-(Vlang)"},{"code":"mut a := 0\nmut b := 1\nprintln('$a, $b') // 0, 1\na, b = b, a\nprintln('$a, $b') // 1, 0\n","language":"V-(Vlang)"},{"code":"fn main() {\n\ta := 10\n\tif true {\n\t\ta := 20 // error: redefinition of `a`\n\t}\n\t// warning: unused variable `a`\n}\n","language":"V-(Vlang)"},{"code":"Dim variable As datatype\nDim var1,var2,... As datatype\n","language":"Visual-Basic-.NET"},{"code":"Dim n1,n2 as Integer\nDim x as Double\nDim isRaining as Boolean\nDim greeting as String\n","language":"Visual-Basic-.NET"},{"code":"Dim variable As datatype = value\nDim var1,var2,... As datatype\n","language":"Visual-Basic-.NET"},{"code":"Dim wholeNumber1,wholeNumber2 as Integer = 3\nDim realNumber as Double = 3.0\nDim isRaining as Boolean = False\nDim greeting as String = \"Hello, this is World speaking.\"\nDim longArray() As Long = {0, 1, 2, 3}\nDim twoDimensions(,) As Integer = {{0, 1, 2}, {10, 11, 12}}\n","language":"Visual-Basic-.NET"},{"code":"variable = expression\n","language":"Visual-Basic-.NET"},{"code":" v = a\n d = b^2 - 4*a*c\n s3 = s1 & mid(s2,3,2)\n","language":"Visual-Basic-.NET"},{"code":"variable <operator>= expression2\n","language":"Visual-Basic-.NET"},{"code":" c += a\n c -= a\n c *= a\n c /= a\n c ^= a\n c <<= n\n c >>= n\n c &= a\n","language":"Visual-Basic-.NET"},{"code":"let example t => io.writeln io.stdout t;\n","language":"WDTE"},{"code":"let example t => 3 -> (@ s n => * t n);\n","language":"WDTE"},{"code":"let writeToFile name data =>\n file.open name : f\n -> str.format '{}' data\n -> io.writeln f\n -- io.close f\n ;\n","language":"WDTE"},{"code":"let a => 3;\nio.writeln io.stdout a;\n","language":"WDTE"},{"code":"var a // declares the variable 'a' with the default value of 'null'\na = 1 // initializes 'a'\na = \"a\" // assigns a different value to 'a'\nvar b = 2 // declares and initializes 'b' at the same time\nb = true // assigns a different value to 'b'\nvar c = [3, 4] // 'c' is assigned a List which is a reference type\nc = false // 'c' is reassigned a Bool which is a value type\n\nvar d = 1 // declaration at top level\n{\n var d = 2 // declaration within a nested scope, hides top level 'd'\n var e = 3 // not visible outside its scope i.e this block\n}\nSystem.print(d) // prints the value of the top level 'd'\nSystem.print(e) // compiler error : Variable is used but not defined\n","language":"Wren"},{"code":"<xsl:variable name=\"foo\" select=\"XPath expression\" />\n<xsl:if test=\"$foo = 4\">... </xsl:if> <!-- prepend '$' to reference a variable or parameter-->\n","language":"XSLT"},{"code":"UserRam equ &C000\n\nld a,&50 ;load hexadecimal 50 into A\nld (UserRam),a ;initialize UserRam with a value of &50\n\nld a,&40 ;load hexadecimal 40 into A\nld (UserRam),a ;assign UserRam a new value of &40\n","language":"Z80-Assembly"},{"code":"byte &EF,&BE\nword &BEEF\n","language":"Z80-Assembly"},{"code":"org &8000\n\nld hl,TestData ;H = &90, L = &00\n\nld hl,(TestData) ;H = &BE, L = &EF\n\n;In a real program you would need something here to stop the program counter from executing the data below as instructions.\n;For simplicity this was left out.\n\norg &9000\nTestData:\nbyte &EF,&BE\n","language":"Z80-Assembly"},{"code":"var v; // global to the class that encloses this file\nclass C{ var v } // global to class C, each instance gets a new v\nclass C{fcn f{var v=123;}} // v can only be seen by f, initialized when C is\nclass C{fcn init{var [const] v=5;}} // init is part of the constructor,\n so vars are promoted yo class scope. This allows const vars to be created at\n construction time\nvar v=123; v=\"hoho\"; //not typed\nclass C{var v} // C.v OK, but just v is not found\nclass C{var[const]v=4} // C.v=3 illegal (compile or run time, depending)\nclass C{var[mixin]v=4} // the compiler treats v as an int for type checking\nclass C{var[proxy]v=f; fcn f{println(\"my name is \",self.fcn.name)} }\n v acts like a property to run f so C.v is the same as C.f()\nclass C{reg r} // C.r is compile time error\nr:=5; // := syntax is same as \"reg r=5\", convenience\n","language":"Zkl"},{"code":"program: variables\n# The concept of variables is completely alien in zoea:\n# there is no support for variables and no way of defining or using them.\n# Instead programs are described by giving examples of input and output values.\n","language":"Zoea"}],"string":"[\n {\n \"code\": \"---\\ncategory:\\n- Simple\\nfrom: http://rosettacode.org/wiki/Variables\\nnote: Basic language learning\\n\",\n \"language\": \"00-META\"\n },\n {\n \"code\": \";Task:\\nDemonstrate a language's methods of:\\n:::* variable declaration\\n:::* initialization\\n:::* assignment\\n:::* datatypes\\n:::* scope \\n:::* referencing, and \\n:::* other variable related facilities\\n<br><br>\\n\\n\",\n \"language\": \"00-TASK\"\n },\n {\n \"code\": \"Int a\\n\",\n \"language\": \"11l\"\n },\n {\n \"code\": \"V a = 1\\n\",\n \"language\": \"11l\"\n },\n {\n \"code\": \"Int p, a, d\\n\",\n \"language\": \"11l\"\n },\n {\n \"code\": \"* value of F\\n L 2,F assigment r2=f\\n* reference (or address) of F\\n LA 3,F reference r3=@f\\n* referencing (or indexing) of reg3 (r3->f)\\n L 4,0(3) referencing r4=%r3=%@f=f\\n\",\n \"language\": \"360-Assembly\"\n },\n {\n \"code\": \"* declarations length\\nC DS C character 1\\nX DS X character hexa 1\\nB DS B character bin 1\\nH DS H half word 2\\nF DS F full word 4\\nE DS F single float 4\\nD DS D double float 8\\nL DS L extended float 16\\nS DS CL12 string 12\\nP DS PL16 packed decimal 16\\nZ DS ZL32 zoned decimal 32\\n* declarations + initialization\\nCI DC C'7' character 1\\nXI DC X'F7' character hexa 1\\nBI DC B'11110111' character bin 1\\nHI DC H'7' half word 2\\nFI DC F'7' full word 4\\nEI DC F'7.8E3' single float 4\\nDI DC D'7.8E3' double float 8\\nLI DC L'7.8E3' extended float 16\\nSI DC CL12'789' string 12\\nPI DC PL16'7' packed decimal 16\\nZI DC ZL32'7' zoned decimal 32\\n\",\n \"language\": \"360-Assembly\"\n },\n {\n \"code\": \" org $1200\\nSoundRam equ $1200 ;some assemblers require equ directives to not be indented.\\nSoundChannel_One equ $1200\\nSoundChannel_Two equ $1201\\nSoundChannel_Three equ $1202\\n LDA #$FF ;this still gets assembled starting at $1200, since equ directives don't take up space!\\n\",\n \"language\": \"6502-Assembly\"\n },\n {\n \"code\": \"joystick equ $00 ;this variable is located at zero page memory address $00\\nPlayer_Xpos equ $01 ;this variable is located at $01\\nPlayer_Ypos equ $02\\npointer equ $03 ;intended to take up 2 bytes\\nsound_on equ $05\\n\",\n \"language\": \"6502-Assembly\"\n },\n {\n \"code\": \"enum $0000\\n;these will be defined starting at $0000 and increasing in the order listed, incremented by the amount after DSB.\\njoystick dsb 1 ;this takes up 1 byte\\nPlayer_Xpos dsb 1\\nPlayer_Ypos dsb 1\\npointer dsb 2 ;this takes up 2 bytes\\nsound_on dsb 1\\nende ;end enumeration\\n\",\n \"language\": \"6502-Assembly\"\n },\n {\n \"code\": \".rsset $0000\\njoystick .rs 1\\nPlayer_Xpos .rs 1\\nPlayer_Ypos .rs 1\\npointer .rs 2\\nsound_on .rs 1\\n;no closer needed for this method\\n\",\n \"language\": \"6502-Assembly\"\n },\n {\n \"code\": \"LDA #$05\\nSTA Player1_Lives ;equivalent C code: Player1_Lives = 5;\\n\\nLDA #$05\\nSTA pointer+1\\nLDA #$40\\nSTA pointer\\n;loads the variable pointer with the value $0540\\n\",\n \"language\": \"6502-Assembly\"\n },\n {\n \"code\": \"NametableBase equ $20 ;label referring to a constant\\nVRAM_ADDR equ $2006 ;label referring to a memory address\\nVRAM_DATA equ $2007 ;label referring to a memory address\\n\\nLDA #NametableBase ;without a # this is interpreted as a memory address like any other number would be.\\nSTA VRAM_ADDR\\nLDA #$00\\nSTA VRAM_ADDR\\n\\nLDA #$03\\nSTA VRAM_DATA\\n\",\n \"language\": \"6502-Assembly\"\n },\n {\n \"code\": \"MyVar:\\nDC.L 0 ;reserves 4 bytes of storage. The label MyVar represents the address of the four 0 bytes shown here.\\n\\nMyOtherVar:\\nDC.L $C0 ;reserves 8 bytes of storage. The first four bytes are initialized to 00 00 00 C0 and the second four to $00 $00 $01 $F4.\\nDC.L 500 ;MyOtherVar points to the first four bytes, you'll need pointer arithmetic to get to the second four.\\n\",\n \"language\": \"68000-Assembly\"\n },\n {\n \"code\": \".data\\nMyVar word 0FFFFh ;the leading zero is just to help the assembler tell that this is a number, it's not actually part of the variable.\\n\\n.code\\n\\nmov ax, word ptr [ds:MyVar]\\n\",\n \"language\": \"8086-Assembly\"\n },\n {\n \"code\": \"Player1_Lives equ 0100h\\nmov al,3\\nmov byte ptr [Player1_Lives],al ;give the player 3 lives to start the game with\\n\",\n \"language\": \"8086-Assembly\"\n },\n {\n \"code\": \" mov ax, seg MyData ;the assembler replaces this with the segment MyData is located in prior to assembling the program.\\nmov ds,ax ;load this segment into the data segment register.\\n\",\n \"language\": \"8086-Assembly\"\n },\n {\n \"code\": \"\\\\ declare a variable which is initialized to the number '0'\\nvar x\\n\\n\\\\ declare a variable which is initialized to a string \\\"cat\\\"\\n\\\"cat\\\" var, y\\n\\n\\\\ Get the value in x, add 20 and store it:\\nx @ 20 n:+ x !\\n\\n\\\\ Change the cat to a dog:\\n\\\"dog\\\" y !\\n\",\n \"language\": \"8th\"\n },\n {\n \"code\": \"/* ARM assembly AARCH64 Raspberry PI 3B */\\n/* program variable64.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/* Initialized data */\\n/*********************************/\\n.data\\nszString: .asciz \\\"String définition\\\"\\nsArea1: .fill 11, 1, ' ' // 11 spaces\\n // or\\nsArea2: .space 11,' ' // 11 spaces\\n\\ncCharac: .byte '\\\\n' // character\\ncByte1: .byte 0b10101 // 1 byte binary value\\n\\nhHalfWord1: .hword 0xFF // 2 bytes value hexa\\n.align 4\\niInteger1: .int 123456 // 4 bytes value decimal\\niInteger3: .short 0500 // 4 bytes value octal\\niInteger5: .int 0x4000 // 4 bytes value hexa\\n\\niInteger7: .word 0x4000 // 4 bytes value hexa\\niInteger6: .int 04000 // 4 bytes value octal\\n\\nTabInteger4: .int 5,4,3,2 // Area of 4 integers = 4 * 4 = 16 bytes\\n\\ndDoubleInt1: .quad 0xFFFFFFFFFFFFFFFF // 8 bytes value hexa\\n\\ndfFLOAT1: .double 0f-31415926535897932384626433832795028841971.693993751E-40 // Float 8 bytes\\nsfFLOAT2: .float 0f-31415926535897932384626433832795028841971.693993751E-40 // Float 4 bytes (or use .single)\\n\\n/*********************************/\\n/* UnInitialized data */\\n/*********************************/\\n.bss\\nsBuffer: .skip 500 // 500 bytes values zero\\niInteger2: .skip 4 // 4 bytes value zero\\ndDoubleint2: .skip 8 // 8 bytes value zero\\n/*********************************/\\n/* code section */\\n/*********************************/\\n.text\\n.global main\\nmain: // entry of program\\n ldr x0,qAdriInteger2 // load variable address\\n mov x1,#100\\n str x1,[x0] // init variable iInteger2\\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\\nqAdriInteger2: .quad iInteger2 // variable address iInteger2\\n\",\n \"language\": \"AArch64-Assembly\"\n },\n {\n \"code\": \"Name: declare -- a local declaration block has an optional name\\n A : constant Integer := 42; -- Create a constant\\n X : String := \\\"Hello\\\"; -- Create and initialize a local variable\\n Y : Integer; -- Create an uninitialized variable\\n Z : Integer renames Y: -- Rename Y (creates a view)\\n function F (X: Integer) return Integer is\\n -- Inside, all declarations outside are visible when not hidden: X, Y, Z are global with respect to F.\\n X: Integer := Z; -- hides the outer X which however can be referred to by Name.X\\n begin\\n ...\\n end F; -- locally declared variables stop to exist here\\nbegin\\n Y := 1; -- Assign variable\\n declare\\n X: Float := -42.0E-10; -- hides the outer X (can be referred to Name.X like in F)\\n begin\\n ...\\n end;\\nend Name; -- End of the scope\\n\",\n \"language\": \"Ada\"\n },\n {\n \"code\": \"int j;\\n\",\n \"language\": \"ALGOL-68\"\n },\n {\n \"code\": \"LONG REAL double1, double2, double3;\\n\",\n \"language\": \"ALGOL-68\"\n },\n {\n \"code\": \"SHORT INT b1 := 2500;\\nLONG INT elwood = 3*bsize, jake = bsize -2;\\n\",\n \"language\": \"ALGOL-68\"\n },\n {\n \"code\": \"FLEX[20]CHAR mystring;\\n\",\n \"language\": \"ALGOL-68\"\n },\n {\n \"code\": \"[]CHAR mytext = \\\"The ALGOL 68 Language\\\";\\n\",\n \"language\": \"ALGOL-68\"\n },\n {\n \"code\": \"% declare some variables %\\ninteger a1, a2; real b; long real c; complex d; long complex f;\\nlogical g; bits h; string(32) j;\\n\\n% assign \\\"initial values\\\" %\\nf := d := c := b := a2 := a1 := 0; % multiple assignment %\\ng := false; h := #a0; j := \\\"Hello, World!\\\";\\n\",\n \"language\": \"ALGOL-W\"\n },\n {\n \"code\": \"record R1 ( integer length; string(256) text );\\nreference(R1) ref1, ref2;\\n\",\n \"language\": \"ALGOL-W\"\n },\n {\n \"code\": \"record person( string(32) name; integer age );\\nrecord date( integer day, month, year );\\nreference(person, date) ref3;\\n\",\n \"language\": \"ALGOL-W\"\n },\n {\n \"code\": \"reference(integer) refInt; % an illegal declaration %\\n\",\n \"language\": \"ALGOL-W\"\n },\n {\n \"code\": \"record INT_VALUE ( integer val );\\nreference(INT_VALUE) refInt;\\n\",\n \"language\": \"ALGOL-W\"\n },\n {\n \"code\": \"% using the person record defined above...%\\n reference (person) someone;\\n someone := person % create a new person structure with uninitialised fields %\\n name(someone) := \\\"Fred\\\"; % initialise the fields %\\n age(someone) := 27;\\n % could also initialise the fields when the record is created: %\\n someone := person( \\\"Harry\\\", 32 );\\n\",\n \"language\": \"ALGOL-W\"\n },\n {\n \"code\": \"// If not initialized at class/member level, it will be set to null\\nInteger x = 0;\\nInteger y; // y is null here\\nInteger p,q,r; // declare multiple variables\\nInteger i=1,j=2,k=3; // declare and initialize\\n\\n/*\\n * Similar to Integer, below variables can be initialized together separated by ','.\\n*/\\nString s = 'a string';\\nDecimal d = 0.0;\\nDouble dbl = 0.0;\\nBlob blb = Blob.valueOf('Any String');\\nBoolean b = true;\\nAClassName cls = new AClassName();\\n\",\n \"language\": \"Apex\"\n },\n {\n \"code\": \"set x to 1\\n\",\n \"language\": \"AppleScript\"\n },\n {\n \"code\": \"global x\\nset x to 1\\nlocal y\\nset y to 2\\n\",\n \"language\": \"AppleScript\"\n },\n {\n \"code\": \"on localx()\\n\\tset x to 0 -- implicit local\\n\\treturn x\\nend localx\\n\\non globalx()\\n\\tset x to 0 -- implicit local\\n\\treturn my x\\nend globalx\\n\\non run\\n\\tset x to 1 -- top-level implicit global\\n\\treturn {localx(), globalx()}\\nend run\\n--> RETURNS: {0, 1}\\n\",\n \"language\": \"AppleScript\"\n },\n {\n \"code\": \"property x : 1\\n\",\n \"language\": \"AppleScript\"\n },\n {\n \"code\": \" 10 A = 1.7: REM LET IS NOT REQUIRED\\n 20 LET B% = 1.7: REM THE PERCENT SIGN INDICATES AN INTEGER; THIS GETS TRUNCATED DOWN\\n 30 LET C$ = \\\"0121\\\": REM THE DOLLAR SIGN INDICATES A STRING DATA TYPE. THE LEADING ZERO IS NOT TRUNCATED\\n 40 DIM D(20): REM CREATE AN ARRAY OF 21 FLOATING POINT NUMBERS\\n 50 DIM E$(5,10): REM CREATE A TWO DIMENSIONAL ARRAY OF 66 STRINGS\\n 60 LET D(1) = 1.3: REM ASSIGN THE SECOND ELEMENT OF D\\n 70 Y$(3) = \\\"ROSE\\\": REM ASSIGN A VALUE TO THE FOURTH STRING\\n 80 PRINT X: REM UNASSIGNED FLOATING POINT AND INTEGER VARIABLES HAVE A DEFAULT VALUE OF ZERO\\n 90 PRINT Y$(2): REM UNASSIGNED STRING VARIABLES ARE EMPTY\\n 100 PRINT Y$(3);\\\"TTA CODE\\\": REM THERE WON'T BE SPACES BETWEEN ROSE AND ETTA\\n 110 F%(10) = 0: REM IF ARRAYS ARE NOT DECLARED THEY HAVE 11 ELEMENTS BY DEFAULT; IE. DIM F%(10)\\n 120 PRINT G: REM THIS PRINTS 0 AND IS NOT AN ERROR EVEN THOUGH G HAS NOT BEEN DEFINED\\n 130 PRINT D(0): REM THIS IS NOT AN ERROR BECAUSE ELEMENTS ARE NUMBERED FROM ZERO.\\n 140 PRINT F%: REM THIS PRINTS 0 BECAUSE F% IS A DIFFERENT VARIABLE THAN THE ARRAY F%(10)\\n 150 LET D(21) = 6: REM THIS IS AN ERROR BECAUSE D ONLY HAS 21 ELEMENTS INDEXED FROM 0 TO 20.\\n\",\n \"language\": \"Applesoft-BASIC\"\n },\n {\n \"code\": \"/* ARM assembly Raspberry PI */\\n/* program variable.s */\\n\\n/************************************/\\n/* Constantes Définition */\\n/************************************/\\n.equ STDOUT, 1 @ Linux output console\\n.equ EXIT, 1 @ Linux syscall\\n.equ WRITE, 4 @ Linux syscall\\n/*********************************/\\n/* Initialized data */\\n/*********************************/\\n.data\\nszString: .asciz \\\"String définition\\\"\\nsArea1: .fill 11, 1, ' ' @ 11 spaces\\n @ or\\nsArea2: .space 11,' ' @ 11 spaces\\n\\ncCharac: .byte '\\\\n' @ character\\ncByte1: .byte 0b10101 @ 1 byte binary value\\n\\nhHalfWord1: .hword 0xFF @ 2 bytes value hexa\\n.align 4\\niInteger1: .int 123456 @ 4 bytes value decimal\\niInteger3: .short 0500 @ 4 bytes value octal\\niPointer1: .int 0x4000 @ 4 bytes value hexa\\n @ or\\niPointer2: .word 0x4000 @ 4 bytes value hexa\\niPointer3: .int 04000 @ 4 bytes value octal\\n\\nTabInteger4: .int 5,4,3,2 @ Area of 4 integers = 4 * 4 = 16 bytes\\n\\niDoubleInt1: .quad 0xFFFFFFFFFFFFFFFF @ 8 bytes\\n\\ndfFLOAT1: .double 0f-31415926535897932384626433832795028841971.693993751E-40 @ Float 8 bytes\\nsfFLOAT2: .float 0f-31415926535897932384626433832795028841971.693993751E-40 @ Float 4 bytes (or use .single)\\n\\n/*********************************/\\n/* UnInitialized data */\\n/*********************************/\\n.bss\\nsBuffer: .skip 500 @ 500 bytes values zero\\niInteger2: .skip 4 @ 4 bytes value zero\\n/*********************************/\\n/* code section */\\n/*********************************/\\n.text\\n.global main\\nmain: @ entry of program\\n ldr r0,iAdriInteger2 @ load variable address\\n mov r1,#100\\n str r1,[r0] @ init variable iInteger2\\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\\niAdriInteger2: .int iInteger2 @ variable address iInteger2\\n\",\n \"language\": \"ARM-Assembly\"\n },\n {\n \"code\": \"num: 10\\nstr: \\\"hello world\\\"\\n\\narrA: [1 2 3]\\narrB: [\\\"one\\\" \\\"two\\\" \\\"three\\\"]\\narrC: [1 \\\"two\\\" [3 4 5]]\\narrD: [\\\"one\\\" true [ print \\\"something\\\" ]]\\n\\ndict: [\\n\\tname: \\\"john\\\"\\n\\tsurname: \\\"doe\\\"\\n\\tfunction: $[][\\n\\t\\tprint \\\"do sth\\\"\\n\\t]\\n]\\n\\ninspect symbols\\n\",\n \"language\": \"Arturo\"\n },\n {\n \"code\": \"x = hello ; assign verbatim as a string\\nz := 3 + 4 ; assign an expression\\nif !y ; uninitialized variables are assumed to be 0 or \\\"\\\" (blank string)\\nMsgbox %x% ; variable dereferencing is done by surrounding '%' signs\\nfx()\\n{\\nlocal x ; variable default scope in a function is local anyways\\nglobal y ;\\nstatic z=4 ; initialized once, then value is remembered between function calls\\n}\\n\",\n \"language\": \"AutoHotkey\"\n },\n {\n \"code\": \"BEGIN {\\n# Variables are dynamically typecast, and do not need declaration prior to use:\\n fruit = \\\"banana\\\" # create a variable, and fill it with a string\\n a = 1 # create a variable, and fill it with a numeric value\\n a = \\\"apple\\\" # re-use the above variable for a string\\n print a, fruit\\n\\n# Multiple assignments are possible from within a single statement:\\n x = y = z = 3\\n print \\\"x,y,z:\\\", x,y,z\\n\\n# \\\"dynamically typecast\\\" means the content of a variable is used\\n# as needed by the current operation, e.g. for a calculation:\\n a = \\\"1\\\"\\n b = \\\"2banana\\\"\\n c = \\\"3*4\\\"\\n\\n print \\\"a,b,c=\\\",a,b,c, \\\"c+0=\\\", c+0, 0+c\\n print \\\"a+b=\\\", a+b, \\\"b+c=\\\", b+c\\n}\\n\",\n \"language\": \"AWK\"\n },\n {\n \"code\": \"# usage: awk -v x=9 -f test.awk\\nBEGIN {\\n y = 3\\n z = x+y\\n print \\\"x,y,z:\\\", x,y,z\\n printf( \\\"x=%d,y=%d,z=%d:\\\", x,y,z )\\n}\\n\",\n \"language\": \"AWK\"\n },\n {\n \"code\": \"function foo(s, k) {\\n # s is an argument passed from caller\\n # k is a dummy not passed by caller, but because it is\\n # in the argument list, it will have a scope local to the function\\n k = length(s)\\n print \\\"'\\\" s \\\"' contains\\\", k, \\\"characters\\\"\\n}\\nBEGIN {\\n k = 42\\n s = \\\"Test\\\"\\n foo(\\\"Demo\\\")\\n print \\\"k is still\\\", k\\n foo(s,k)\\n print \\\"k still is\\\", k\\n}\\n\",\n \"language\": \"AWK\"\n },\n {\n \"code\": \"# Feeding standard-input with echo:\\necho -e \\\"2 apples 0.44$ \\\\n 3 banana 0.33$\\\" | awk '{p=$1*$NF; sum+=p; print $2,\\\":\\\",p; }; END{print \\\"Sum=\\\",sum}'\\n\",\n \"language\": \"AWK\"\n },\n {\n \"code\": \"1→A\\n\",\n \"language\": \"Axe\"\n },\n {\n \"code\": \"#Realloc(L₂)\\n\",\n \"language\": \"Axe\"\n },\n {\n \"code\": \"10 LET A=1.3\\n20 LET B%=1.3: REM The sigil indicates an integer, so this will be rounded down\\n30 LET C$=\\\"0121\\\": REM The sigil indicates a string data type. the leading zero is not truncated\\n40 DIM D(10): REM Create an array of 10 digits\\n50 DIM E$(5.10): REM Create an array of 5 strings, with a maximum length of 10 characters\\n60 LET D(1)=1.3: REM Assign the first element of d\\n70 LET E$(3)=\\\"ROSE\\\": REM Assign a value to the third string\\n80 PRINT D(3): REM Unassigned array elements have a default value of zero\\n90 PRINT E$(3): REM Ten spaces because string arrays are not dynamic\\n100 PRINT E$(3);\\\"TTA CODE\\\": REM There will be spaces between rose and etta\\n110 DIM F%(10): REM Integers use less space than floating point values\\n120 PRINT G: REM This is an error because f has not been defined\\n130 PRINT D(0): REM This is an error because elements are numbered from one\\n140 LET D(11)=6: REM This is an error because d only has 10 elements\\n150 PRINT F%: REM This is an error because we have not provided an element number\\n160 END\\n\",\n \"language\": \"BASIC\"\n },\n {\n \"code\": \"@echo off\\n\\n::setting variables in defferent ways\\nset myInt1=5\\nset myString1=Rosetta Code\\nset \\\"myInt2=5\\\"\\nset \\\"myString2=Rosetta Code\\\"\\n\\n::Arithmetic\\nset /a myInt1=%myInt1%+1\\nset /a myInt2+=1\\nset /a myInt3=myInt2+ 5\\n\\nset myInt\\nset myString\\npause>nul\\n\",\n \"language\": \"Batch-File\"\n },\n {\n \"code\": \" REM BBC BASIC (for Windows) has the following scalar variable types;\\n REM the type is explicitly indicated by means of a suffix character.\\n REM Variable names must start with A-Z, a-z, _ or `, and may contain\\n REM any of those characters plus 0-9 and @; they are case-sensitive.\\n\\n A& = 123 : REM Unsigned 8-bit byte (0 to 255)\\n A% = 12345678 : REM Signed 32-bit integer (-2147483648 to +2147483647)\\n A = 123.45E6 : REM Variant 40-bit float or 32-bit integer (no suffix)\\n A# = 123.45E6 : REM Variant 64-bit double or 32-bit integer\\n A$ = \\\"Abcdef\\\" : REM String (0 to 65535 bytes)\\n\\n REM Scalar variables do not need to be declared but must be initialised\\n REM before being read, otherwise a 'No such variable' error is reported\\n REM The static integer variables A% to Z% are permanently defined.\\n\\n REM BBC BASIC also has indirection operators which allow variable-like\\n REM entities to be created in memory:\\n\\n DIM addr 7 : REM Allocate 8 bytes of heap\\n ?addr = 123 : REM Unsigned 8-bit byte (0 to 255)\\n !addr = 12345 : REM Signed 32-bit integer (-2147483648 to +2147483647)\\n |addr = 12.34 : REM Variant 40-bit or 64-bit float or 32-bit integer\\n $addr = \\\"Abc\\\" : REM String terminated by CR (0 to 65535 bytes)\\n $$addr = \\\"Abc\\\": REM String terminated by NUL (0 to 65535 bytes)\\n\\n REM The integer indirection operators may be used in a dyadic form:\\n offset = 4\\n addr?offset = 12345678 : REM Unsigned 8-bit byte at addr+offset\\n addr!offset = 12345678 : REM Signed 32-bit integer at addr+offset\\n\\n REM All variables in BBC BASIC have global scope unless they are used\\n REM as a formal parameter of a function or procedure, or are declared\\n REM as LOCAL or PRIVATE. This is different from most other BASICs.\\n\",\n \"language\": \"BBC-BASIC\"\n },\n {\n \"code\": \"a ← 10\\n\",\n \"language\": \"BQN\"\n },\n {\n \"code\": \"(myfunc=i j.!arg:(?i.?j)&!i+!j)\\n\",\n \"language\": \"Bracmat\"\n },\n {\n \"code\": \"int j;\\n\",\n \"language\": \"C\"\n },\n {\n \"code\": \"double double1, double2, double3;\\n\",\n \"language\": \"C\"\n },\n {\n \"code\": \"short b1 = 2500;\\nlong elwood = 3*BSIZE, jake = BSIZE -2;\\n\",\n \"language\": \"C\"\n },\n {\n \"code\": \"char mystring[21];\\n\",\n \"language\": \"C\"\n },\n {\n \"code\": \"const char * mytext = \\\"The C Language\\\";\\n\",\n \"language\": \"C\"\n },\n {\n \"code\": \"int a;\\n\",\n \"language\": \"C++\"\n },\n {\n \"code\": \"auto a = 1; // int a = 1\\n\",\n \"language\": \"C++\"\n },\n {\n \"code\": \"std::vector<int> intVec;\\n\",\n \"language\": \"C++\"\n },\n {\n \"code\": \"int j;\\n\",\n \"language\": \"C-sharp\"\n },\n {\n \"code\": \"int p, a, d;\\n\",\n \"language\": \"C-sharp\"\n },\n {\n \"code\": \"int a = 4;\\nint b;\\nint c = Func(a);\\n\\nb = 5;\\n\",\n \"language\": \"C-sharp\"\n },\n {\n \"code\": \" int a;\\n\",\n \"language\": \"ChucK\"\n },\n {\n \"code\": \"int b,c,d;\\n\",\n \"language\": \"ChucK\"\n },\n {\n \"code\": \"0 => int e;\\n\",\n \"language\": \"ChucK\"\n },\n {\n \"code\": \"(declare foo)\\n\",\n \"language\": \"Clojure\"\n },\n {\n \"code\": \"(def foo (atom 42))\\n\",\n \"language\": \"Clojure\"\n },\n {\n \"code\": \"(def bar (ref 42))\\n\",\n \"language\": \"Clojure\"\n },\n {\n \"code\": \"(def baz (agent 42))\\n\",\n \"language\": \"Clojure\"\n },\n {\n \"code\": \"(def bar)\\n\",\n \"language\": \"Clojure\"\n },\n {\n \"code\": \"(def foo 42)\\n\",\n \"language\": \"Clojure\"\n },\n {\n \"code\": \"(defonce bar 42)\\n\",\n \"language\": \"Clojure\"\n },\n {\n \"code\": \"(defn baz [x] 42)\\n\",\n \"language\": \"Clojure\"\n },\n {\n \"code\": \"(defmacro qux [x] 42)\\n\",\n \"language\": \"Clojure\"\n },\n {\n \"code\": \"(let [foo 42] ...)\\n\",\n \"language\": \"Clojure\"\n },\n {\n \"code\": \"(def ^:dynamic foo 10)\\n(binding [foo 20] ...)\\n\",\n \"language\": \"Clojure\"\n },\n {\n \"code\": \"(defn len [^String x]\\n (.length x))\\n\",\n \"language\": \"Clojure\"\n },\n {\n \"code\": \"MOVE 5 TO x\\nMOVE FUNCTION SOME-FUNC(x) TO y\\nMOVE \\\"foo\\\" TO z\\nMOVE \\\"values 1234\\\" TO group-item\\nSET some-index TO 5\\n\",\n \"language\": \"COBOL\"\n },\n {\n \"code\": \"01 normal-date.\\n 03 year PIC 9(4).\\n 03 FILLER PIC X VALUE \\\"-\\\".\\n 03 month PIC 99.\\n 03 FILLER PIC X VALUE \\\"-\\\".\\n 03 dday PIC 99. *> Misspelling is intentional; day is a reserved word.\\n\\n01 reversed-date.\\n 03 dday PIC 99.\\n 03 FILLER PIC X VALUE \\\"-\\\".\\n 03 month PIC 99.\\n 03 FILLER PIC X VALUE \\\"-\\\".\\n 03 year PIC 9(4).\\n...\\nPROCEDURE DIVISION.\\n MOVE \\\"2012-11-10\\\" TO normal-date\\n MOVE CORR normal-date TO reversed-date\\n DISPLAY reversed-date *> Shows '10-11-2012'\\n\",\n \"language\": \"COBOL\"\n },\n {\n \"code\": \"01 a PIC X(20). *> a is a string of 20 characters.\\n01 b PIC 9(10). *> b is a 10-digit integer.\\n01 c PIC 9(10)V9(5). *> c is a decimal number with a 10-digit integral part and a 5-digit fractional part.\\n01 d PIC 99/99/99. *> d is an edited number, with a slash between each pair of digits in a 6-digit integer.\\n\",\n \"language\": \"COBOL\"\n },\n {\n \"code\": \"*> Group data items do not have a picture clause.\\n01 group-item.\\n 03 sub-data PIC X(10).\\n 03 more-sub-data PIC X(10).\\n\",\n \"language\": \"COBOL\"\n },\n {\n \"code\": \"DATA DIVISION.\\nWORKING-STORAGE SECTION.\\n01 initialized-data PIC X(15) VALUE \\\"Hello, World!\\\".\\n01 other-data PIC X(15).\\n...\\nPROCEDURE DIVISION.\\n DISPLAY initialized-data *> Shows 'Hello, World!'\\n DISPLAY other-data *> Will probably show 15 spaces.\\n\",\n \"language\": \"COBOL\"\n },\n {\n \"code\": \"01 group-item VALUE \\\"Hello!12345\\\".\\n 03 a-string PIC X(6). *> Contains \\\"Hello!\\\"\\n 03 a-number PIC 9(5). *> Contains '12345'.\\n\",\n \"language\": \"COBOL\"\n },\n {\n \"code\": \"some-str (1:1) *> Gets the first character from the string\\nsome-num (1:3) *> Get the first three digits from the number\\nanother-string (5:) *> Get everything from the 5th character/digit onwards.\\n\\n*> To reference modify an array element\\nsome-table (1) (5:1) *> Get the 5th character from the 1st element in the table\\n\",\n \"language\": \"COBOL\"\n },\n {\n \"code\": \"1 rem rosetta code\\n5 rem commodore basic variable demonstration\\n10 print chr$(147);chr$(14);:ti$=\\\"000000\\\":rem see lines 420-460\\n15 rem numeric variables default to 0; strings default to empty\\n20 print a:print b%:print c$:print\\n25 :\\n30 rem no symbol after variable defaults to float.\\n35 let a=1.7\\n40 rem \\\"let\\\" is not required and rarely used.\\n45 b=2.42\\n50 print a:print b\\n55 rem % means integer type; digits after decimal are truncated\\n60 b%=1.7\\n65 print b%\\n70 rem $ means string type\\n75 c$=\\\"Commodore\\\"\\n80 print c$:print\\n85 :\\n90 rem each type is unique, even when name is \\\"same\\\"\\n95 a=5.0\\n100 a%=9\\n105 a$=\\\"twenty-five\\\"\\n110 print a:print a%:print a$:print\\n115 :\\n120 rem names unique only to two characters; extra ignored\\n125 li=10:lives=8:lights=64\\n130 print li:print lives:print lights:print\\n135 rem second character can be alphanumeric, but is not array\\n140 s1=100 : s2=200 : s3=300\\n145 print s1:print s2:print s3:print\\n150 gosub 5000\\n155 :\\n160 rem strings preserve all literal characters\\n165 rem numerics drop leading zeros and trailing zeros after decimal\\n170 n$=\\\"01276\\\":print n$:rem 01276\\n175 o%=01276:print n%: rem 1276\\n180 p=4.900:print p: print: rem 4.9\\n185 :\\n190 rem string-numeric conversion functions\\n195 c$=\\\"05034\\\"\\n200 c%=val(c$) : rem converts to the numeric value of 5034 (first zero dropped)\\n205 d=123.45600 : rem define a float\\n210 d$=str$(d) : rem converts above into a string\\n215 print c$:print c%:print d:print d$:print\\n218 :\\n220 rem strings can be ordered/compared > or < like numbers\\n225 input \\\"Enter a string\\\";x$:print\\n230 input \\\"Enter another string\\\";y$:print\\n235 if x$>y$ then print x$;\\\" comes after \\\";y$\\n240 if x$<y$ then print x$;\\\" comes before \\\";y$\\n245 if x$=y$ then print \\\"You entered the same string twice!\\\"\\n250 gosub 5000\\n255 :\\n260 rem numbers have a leading character for pos/neg sign\\n265 rem \\\" \\\" means positive\\n270 a=-52:b=124\\n275 print a:print b:print\\n280 :\\n285 rem variable operations\\n290 e$=\\\"endothermic\\\":print e$\\n295 print left$(e$,3) : rem \\\"end\\\"\\n300 print right$(e$,3) : rem \\\"mic\\\"\\n305 print mid$(e$,4,5) : rem \\\"other\\\"\\n310 print\\n315 a=5:b=20:c=a+b:print a;\\\"+\\\";b;\\\"=\\\";c : rem addition\\n320 q=90:r=60:s=q-r:print s : rem subtraction\\n325 x=3:y=4:z=x*y:print x;\\\"*\\\";y;\\\"=\\\";z : rem 12 multiplication\\n330 l=12:m=16:n=l/m:print l;\\\"/\\\";m;\\\"=\\\";n :rem division\\n335 rem string concatenation\\n340 print\\n345 f$=\\\"John\\\":l$=\\\"Jones\\\":n$=l$+\\\", \\\"+f$:print f$:print l$:print n$\\n350 gosub 5000\\n355 :\\n360 rem arrays can be single or multidimensional\\n365 rem array index starts at 0\\n370 rem single dimenstion arrays of 11 elements or less\\n375 rem do not need to be DIMensioned\\n380 a$(0)=\\\"first\\\":a$(1)=\\\"second\\\":a$(3)=\\\"third\\\":rem we skipped index 2\\n385 for i=0 to 3:print a$(i):next\\n390 gosub 5000\\n395 dim b(1,20) : rem 42 elements\\n400 for i=0 to 1:for j=0 to 20:b(i,j)=(i+1)*j:next j,i\\n405 for i=0 to 1:print chr$(19):for j=0 to 20:print tab(i*6);b(i,j):next j,i\\n410 gosub 5000\\n415 :\\n420 rem special variables - ti and st are technically functions,\\n425 rem but ti$ can be assigned a value similar to a string variable\\n430 t$=left$(ti$,2)+\\\":\\\"+mid$(ti$,3,2)+\\\":\\\"+right$(ti$,2)\\n435 print \\\"Ticks since program started:\\\":print ti\\n440 print \\\"Elapsed time since program started:\\\":print t$\\n445 print \\\"I/O Status:\\\";st : rem i/o status\\n450 print:print \\\"Enter new time (HHMMSS): \\\";:gosub 5200\\n455 ti$=t$:gosub 5500\\n460 print\\n465 :\\n470 rem all variables can be cleared with the \\\"clr\\\" statement\\n475 rem however, this also clears the return address stack for subroutines\\n480 rem making \\\"return\\\" not possible.\\n485 print \\\"Before CLR:\\\":print a:print a$:print a$(0):print b:print c\\n490 clr:print:print \\\"After CLR:\\\"\\n495 print a:print a$:print a$(0):print b:print c\\n500 print\\n505 end\\n600 :\\n700 rem supporting subroutines\\n800 :\\n5000 rem screen pause routine\\n5005 print:print \\\"press a key to continue\\\"\\n5010 get k$:if k$=\\\"\\\" then 5010\\n5015 print chr$(147):return\\n5020 :\\n5200 rem custom time input routine\\n5205 t$=\\\"\\\":for d=1 to 6\\n5210 get k$:if k$<\\\"0\\\" or k$>\\\"9\\\" then 5210\\n5215 t$=t$+k$:print k$;:next\\n5220 return\\n5230 :\\n5500 rem display live clock\\n5505 print chr$(147):print:print \\\"Press a key to continue.\\\"\\n5510 print chr$(19);\\\"Time: \\\"left$(ti$,2)\\\":\\\"mid$(ti$,3,2)\\\":\\\"right$(ti$,2);\\n5515 get k$:if k$=\\\"\\\" then 5510\\n5520 print chr$(147);:return\\n\",\n \"language\": \"Commodore-BASIC\"\n },\n {\n \"code\": \"10 print chr$(147);chr$(14);:ti$=\\\"0000000\\\":rem see lines 420-460\\n\\n430 t$=left$(ti$,2)+\\\":\\\"+mid$(ti$,3,2)+\\\":\\\"+mid$(ti$,5,2)+\\\".\\\"+right$(ti$,1)\\n\\n5205 t$=\\\"\\\":for d=1 to 7\\n\\n5500 rem display live clock\\n5505 print chr$(147):print:print \\\"Press a key to continue.\\\"\\n5510 t$=left$(ti$,2)+\\\":\\\"+mid$(ti$,3,2)+\\\":\\\"+mid$(ti$,5,2)+\\\".\\\"+right$(ti$,1)\\n5515 print chr$(19);\\\"Time: \\\"t$\\n5520 get k$:if k$=\\\"\\\" then 5510\\n5525 print chr$(147);:return\\n\",\n \"language\": \"Commodore-BASIC\"\n },\n {\n \"code\": \"REM Tiny Basic has exactly 26 variables.\\nREM They start off initialised to zero.\\n PRINT A\\n\\nREM The only data type is sixteen-bit signed integer.\\nREM They are assigned using the LET statement.\\nREM Their scope is the whole program.\\n LET B = -12345\\nREM The integer arithmetic operations of + - * and / can be used\\nREM and so can the unary negative and positive operators - +\\n LET C = 1 + B - B/5\\n LET A = -B\\n PRINT \\\"B is \\\", B\\n PRINT \\\"C is \\\", C\\n GOSUB 10\\n\\nREM The comparison operators = < > <= >= <> are available,\\nREM but their results are not expressions and can only be used in an\\nREM if statement.\\n LET D = 3\\n IF D <> 7 THEN LET D = 7\\n GOTO D-2\\n PRINT \\\"Skip this\\\"\\n 5 PRINT \\\"Gotos and gosubs can be computed. Beware of moving spaghetti.\\\"\\n END\\n10 PRINT \\\"B is now \\\", B\\n RETURN\\n\\nREM Tiny Basic does not support arrays or pointers. Strings can\\nREM be used, but only as string constants within a PRINT statement.\\n\",\n \"language\": \"Commodore-BASIC\"\n },\n {\n \"code\": \"(defparameter *x* nil \\\"nothing\\\")\\n\",\n \"language\": \"Common-Lisp\"\n },\n {\n \"code\": \"(defun frobnicate (x)\\n (declare (type fixnum x))\\n (the fixnum (+ x 128)))\\n\",\n \"language\": \"Common-Lisp\"\n },\n {\n \"code\": \"(defvar *x* 42 \\\"The answer.\\\")\\n\",\n \"language\": \"Common-Lisp\"\n },\n {\n \"code\": \"(documentation '*x* 'variable)\\n\",\n \"language\": \"Common-Lisp\"\n },\n {\n \"code\": \"(let ((jenny (list 8 6 7 5 3 0 9))\\n hobo-joe)\\n (apply #'+ jenny))\\n\",\n \"language\": \"Common-Lisp\"\n },\n {\n \"code\": \"(progn\\n (let ((*x* 43))\\n (print *x*)\\n (print *x*))\\n\",\n \"language\": \"Common-Lisp\"\n },\n {\n \"code\": \"(setf *x* 625)\\n\",\n \"language\": \"Common-Lisp\"\n },\n {\n \"code\": \"(setf *x* 42 *y* (1+ *x*))\\n=>43\\n\",\n \"language\": \"Common-Lisp\"\n },\n {\n \"code\": \"(setf *x* 625)\\n(psetf *x* 42 *y* (1+ *x*)\\n=>NIL\\n\",\n \"language\": \"Common-Lisp\"\n },\n {\n \"code\": \"(declaim (ftype (function (fixnum) fixnum) frobnicate))\\n(defun frobnicate (x)\\n (+ x 42))\\n\",\n \"language\": \"Common-Lisp\"\n },\n {\n \"code\": \"float bite = 36.321;\\t///_Defines a floating-point number (float), \\\"bite\\\", with a value of 36.321\\nfloat[3] bites;\\t\\t///_Defines a static array of 3 floats\\nfloat[] more_bites;\\t///_Defines a dynamic array of floats\\n\",\n \"language\": \"D\"\n },\n {\n \"code\": \";\\n; Variables examples for DBL version 4 by Dario B.\\n;\\n\\n.DEFINE NR,10 ;const\\n.DEFINE AP,\\\"PIPPO\\\" ;const\\n\\n\\n RECORD CUSTOM\\nCOD, D5\\nNAME, A80\\nZIP, D6\\nCITY, A80\\n;-----------------------\\n\\n RECORD\\n\\nALPHA, A5 ;alphanumeric\\nNUMBR, D5 ;number\\nDECML, F5.2 ;float\\nNUMVE, 10D5 ;array of number\\nNUMAR, [10,2]D5 ;array of number\\nALPV1, 10A8 ;array of alphanumeric\\nALPV2, [NR]A8 ;array of alphanumeric\\nALPA1, [10,2]A8 ;array of alphanumeric\\n\\nNUMV, 3D3,100,200,300\\nALPV, 2A3,'ABC','FGH','KLM'\\nMSX, A9,\\\"VARIABLES\\\"\\nMSG, A*,'Esempio di variabile autodimensionante'\\n\\n PROC\\n;-----------------------------------------------------------------------\\n\\n CLEAR ALPHA,NUMBR,DEML,NUMVE(1:10*5),NUMAR(1:10*2*5),ALPV1(1:10*8)\\n CLEAR ALPV2(1:10*8),ALPA1(1:10*2*8)\\n\\n ALPHA=\\\"PIPPO\\\"\\n NUMBR=10\\n DECML=20.55\\n\\n CLEAR CUSTOM\\n COD=1050\\n NAME='Dario Benenati'\\n ZIP=27100\\n CITY=\\\"PAVIA\\\"\\n\\n NUMVE(1:10*5)=\\n NUMVE(1)=1\\n SET NUMVE(2),NUMVE(3),NUMVE(4)=2\\n\\n NUMAR(1:10*2*5)=\\n NUMAR[1,1]=11\\n NUMAR[1,2]=12\\n NUMAR[2,1]=21\\n NUMAR[2,2]=22\\n\\n ALPV1(1:10*8)=\\n ALPV1(1)=\\\"PIPPO\\\"\\n APLV1(2)=\\\"PLUTO\\\"\\n APLV1(2)=\\\"ABCDEFGHIJKLMNOP\\\" ;ALPV(3)='IJKLMNOP'\\n\\n ALPV2(1:10*8)=\\\" \\\"\\n ALPV2[1]=\\\"PIPPO\\\"\\n ALPV2(2)=\\\"PLUTO\\\"\\n ALPV2[3](3:2)=\\\"FO\\\"\\n ALPV2[4](3,4)=\\\"FO\\\"\\n\\n SET ALPA1[1,1],ALPA1[1,2]=\\\"PLUTO\\\"\\n ALPA1[2,1](3:2)=\\\"FO\\\"\\n ALPA1[2,1](3,4)=\\\"FO\\\"\\n ;.....................\\n\",\n \"language\": \"DBL\"\n },\n {\n \"code\": \"var\\n i: Integer;\\n s: string;\\n o: TObject;\\nbegin\\n i := 123;\\n s := 'abc';\\n o := TObject.Create;\\n try\\n // ...\\n finally\\n o.Free;\\n end;\\nend;\\n\",\n \"language\": \"Delphi\"\n },\n {\n \"code\": \"add_var(v1);\\ndim(v1);\\nadd_var(v1, v2, v3, v4);\\ndim(v1, v2, v3, v4);\\nadd_var(isRaining)_datatype(boolean);\\ndim(isRaining)_datatype(boolean);\\nadd_var(greeting)_dt(string);\\ndim(greeting)_dt(string);\\nadd_var({date}, birthdate);\\ndim({date}, birthdate);\\n\",\n \"language\": \"Diego\"\n },\n {\n \"code\": \"add_str(bobName)_value(Bob);\\nalert_human(bob)_msg(Hi [bobName]); // Hi Bob\\n\\nalert_human(fred)_msg(Hi [fredName])_str(fredName)_value(Freddy); // Hi Freddy\\n\",\n \"language\": \"Diego\"\n },\n {\n \"code\": \"add_var(greeting)_value(Hello World)_me();\\n\",\n \"language\": \"Diego\"\n },\n {\n \"code\": \"with_me()_var(greeting)_value(Hello World);\\n\",\n \"language\": \"Diego\"\n },\n {\n \"code\": \"add_var(greeting)_value(Hello World);\\n\",\n \"language\": \"Diego\"\n },\n {\n \"code\": \"add_var(greeting)_value(Hello World)_for()_computer(cmp1);\\n\",\n \"language\": \"Diego\"\n },\n {\n \"code\": \"with_robot(alif)_msg(Hello World);\\n\",\n \"language\": \"Diego\"\n },\n {\n \"code\": \"with_robot()_msg(Hello World);\\n\",\n \"language\": \"Diego\"\n },\n {\n \"code\": \"with_computer()_msg(Hello World);\\n\",\n \"language\": \"Diego\"\n },\n {\n \"code\": \"with_computer()_os(windows)_msg(Hello World);\\n\",\n \"language\": \"Diego\"\n },\n {\n \"code\": \"add_var(a); // a = undefined variant\\nadd_var({int},b); // b = undefined integer\\n\\nwith_var(a)_value(0); // a = 0 variant\\nwith_var({int},a)_v(1); // a = 1 integer\\nwith_var([a])_v(2); // a = 2 integer\\n\\nwith_var[a]_v(3);\\n// same as `with_var(3)_v(3);`\\n// callee will ask `with_var(3)_askdec();`\\n\\n(a)_v(3); // a = 3 integer // same as `add_var(a)_v(3);`\\n([a])_v(4); // a = 4 integer // same as `add_var([a])_v(4);`\\n\\n[a]_v(5);\\n// same as `with_var(3)_v(5);`\\n// callee will ask `with_var(3)_askdec();`\\n\\n(a)_calc([a]+1); // a = 5\\n\\nadd_var({str},varname)_v(a);\\nwith_var[varname]_v(6); // a = 6 integer\\n[varname]_inc(); // a = 7 integer // same as `with_var(a)_inc();`\\n\\nwith_var([a]+1); // a = 6 integer\\nwith_var([a]+1)_v(7); // a = 8 integer\\n\\nwith_var([[varname]]+1); // a = 9 integer\\nwith_var[[varname]]_inc(); // a = 10 integer\\nwith_var([varname]+1); // varname = \\\"a1\\\"\\n\\nwith_var({double},a)_v(11); // a = 11.0 double\\n\\n(varname)_v(a)_inc(2); // varname = \\\"c\\\" // same as `with_var(a)_v(a)_inc(2);`\\nwith_var(varname)_v(b); // varname = \\\"b\\\"\\nwith_var[varname]_v(0); // b = 0\\n([varname])_v(1); // b = 1 // same as `with_var(b)_v(1);`\\n\",\n \"language\": \"Diego\"\n },\n {\n \"code\": \"go_robot(alif)_waypoint(waypoint1)_addvar({bool},alifArriveWaypoint1);\\ngo_robot(beh)_waypoint(waypoint1)_var({bool},behArriveWaypoint1);\\ngo_robot(teh)_waypoint(waypoint1)_dim({bool},tehArriveWaypoint1);\\n\",\n \"language\": \"Diego\"\n },\n {\n \"code\": \"alert_human(jo)_msg(Hi [])_str(joeName)_v(Joe); // Hi Joe\\n\\nalert_human(gab)_msg(Hi [])_str()_v(Gabriella); // Hi Gabriella\\n\\nalert_human(annamarie)_msg(Hi [])_str([a]+'-'[m])_str(a)_v(Anna)_str(m)_v(Marie); // Hi Anna-Marie\\nalert_human(annamarie)_msg(Hi []+'-'+[])_str()_v(Anna)_str()_v(Marie); // Hi Anna-Marie\\nalert_human(annamarie)_msg(Hi [])_str([]+'-'[])_str()_v(Anna)_str()_v(Marie); // Hi Anna-Marie\\n\",\n \"language\": \"Diego\"\n },\n {\n \"code\": \"alert_human(jill)_msg(Hi [jillName] Daniels)_var(jillName)_value(Jill); // Hi Jill Daniels\\nalert_human(jill)_msg('Hi '+[jillName]+' Daniels')_var(jillName)_value(Jill); // Hi Jill Daniels\\nadd_var(jillFullName)_calc([jillName]+\\\" Daniels\\\");\\n\",\n \"language\": \"Diego\"\n },\n {\n \"code\": \"add_var({integer},wholeNumber1,wholeNumber2)_value(3);\\ndim({double},realNumber)_v(3.0);\\nadd_var({boolean},isRaining)_v(false);\\nadd_var(greeting)_datatype(string)_value(Hello, this is World speaking.);\\n\",\n \"language\": \"Diego\"\n },\n {\n \"code\": \"with_var(birthdate)_value(24-Jun-1963);\\n[myinteger]_value(33);\\n\",\n \"language\": \"Diego\"\n },\n {\n \"code\": \"[myYearVar]_v(1963);\\n[datename]_v(24-Jun-[myYearVar]);\\n\",\n \"language\": \"Diego\"\n },\n {\n \"code\": \"with_var(d)_calc([b]^2-4*[a]*[c]);\\nwith_var(E)_calc([m]*[c]^2);\\nwith_var(d)_calc([b]^2-4*[a]*[c]);\\n\",\n \"language\": \"Diego\"\n },\n {\n \"code\": \"with_var(E)_equals(m)_multipl(c)_sq(); // E=mc²\\nwith_var(c)_inc(); // increment by one\\nwith_var(c)_inc(a); // same as with_var(c)_exp(+=[a]);\\n\",\n \"language\": \"Diego\"\n },\n {\n \"code\": \"(E)_equals(m)_multipl(c)_sq(); // E=mc²\\n(c)_inc(); // increment by one\\n(c)_inc(a); // same as [c]_exp(+=[a]);\\n\",\n \"language\": \"Diego\"\n },\n {\n \"code\": \"add_var(wholeNumber)_datatype(integer);\\ndim({double},myNumber)_v(3.0);\\nwith_var(wholenumber)_datatype(integer);\\nwith_var({boolean},isRaining)_value(false); // cast/converting datatype\\n\",\n \"language\": \"Diego\"\n },\n {\n \"code\": \"// Both of the following declarations can be seen as a tree,\\n// var -> <varname>\\nvar/x\\nvar y\\n\\n// They can also be defined like this.\\n// This is once again a tree structure, but this time the \\\"var\\\" only appears once, and the x and y are children.\\nvar\\n x\\n y\\n// And like this, still a tree structure.\\nvar/x, y\\n\",\n \"language\": \"DM\"\n },\n {\n \"code\": \"// Here, \\\"/obj\\\" is the type, a /obj being a simple game object.\\nvar/obj/x\\n// It can also be defined like this, because of the tree structure:\\nvar\\n obj\\n x\\n// Or this\\nvar/obj\\n x\\n\\n// ...\\n// You get the idea\\n\",\n \"language\": \"DM\"\n },\n {\n \"code\": \"var/x = 0\\nx = 10\\nvar/y\\ny = \\\"hi!\\\"\\n\",\n \"language\": \"DM\"\n },\n {\n \"code\": \"var i := 123; // inferred type of i is Integer\\nvar s := 'abc'; // inferred type of s is String\\nvar o := TObject.Create; // inferred type of o is TObject\\nvar s2 := o.ClassName; // inferred type of s2 is String as that's the type returned by ClassName\\n\",\n \"language\": \"DWScript\"\n },\n {\n \"code\": \"//A constant declaration\\nlet pi = 3.14\\n\\nprivate {\\n //private constant, not visible outside of a module\\n let privateConst = 3.3\\n}\\n\\n//Variable declaration\\nvar x = 42\\n\\n//Assignment\\nx = 42.42\\n\\n//Dyalect is a dynamic language, so types are attached\\n//to values, not to the names\\nvar foo = (x: 2, y: 4) //foo is of type Tuple\\nvar bar = \\\"Hello!\\\" //bar is of type String\\n\\n//Global variable\\nvar g = 1.1\\n\\n{\\n //local variable (not visible outside of { } brackets)\\n var loc = 2.2\\n}\\n\\nfunc fun() {\\n //Local variables, not visible outside of function\\n var x = 1\\n var y = 2\\n}\\n\\nfunc parent() {\\n //A local variable inside a parent function\\n var x = 1\\n func child() {\\n //A local variable inside a nested function\\n //It shadows a parent's variable\\n var x = 2\\n\\n //But this is how we can reference a variable from\\n //a parent function\\n base.x\\n }\\n}\\n\",\n \"language\": \"Dyalect\"\n },\n {\n \"code\": \"def x := 1\\nx + x # returns 2\\n\",\n \"language\": \"E\"\n },\n {\n \"code\": \"def var x := 1\\nx := 2\\nx # returns 2\\n\",\n \"language\": \"E\"\n },\n {\n \"code\": \"def var x := 1\\nx += 1 # equivalent to x := x + 1, or x := x.add(1)\\nx # returns 2\\n\\ndef var list := [\\\"x\\\"]\\nlist with= \\\"y\\\" # equivalent to list := list.with(\\\"y\\\")\\nlist # returns [\\\"x\\\", \\\"y\\\"]\\n\",\n \"language\": \"E\"\n },\n {\n \"code\": \"def [hair, eyes, var shirt, var pants] := [\\\"black\\\", \\\"brown\\\", \\\"plaid\\\", \\\"jeans\\\"]\\n\",\n \"language\": \"E\"\n },\n {\n \"code\": \"[shirt, pants] := [\\\"white\\\", \\\"black\\\"] # This does not do anything useful.\\n\",\n \"language\": \"E\"\n },\n {\n \"code\": \"def list := [def x := timer.now(), x] # two copies of the current time\\nlist[0] == x # x is still visible here; returns true\\n\",\n \"language\": \"E\"\n },\n {\n \"code\": \"def makeSum() {\\n var a := 0\\n var b := 0\\n return [&a, &b, fn { a + b }]\\n}\\n\\ndef [&x, &y, sum] := makeSum()\\nx := 3\\ny := 4\\nsum() # returns 7\\n\",\n \"language\": \"E\"\n },\n {\n \"code\": \"def getUniqueId(&counter) {\\n counter += 1\\n return counter\\n}\\n\\nvar idc := 0\\ngetUniqueId(&idc) # returns 1\\ngetUniqueId(&idc) # returns 2\\n\",\n \"language\": \"E\"\n },\n {\n \"code\": \"# it is statically typed\\n#\\n# global number variable\\nn = 99\\nprint n\\n# global array of numbers\\na[] = [ 2.1 3.14 3 ]\\n#\\nproc foo . .\\n # i is local, because it is first used in the function\\n for i = 1 to len a[]\\n print a[i]\\n .\\n.\\nfoo\\n#\\n# string\\ndomain$ = \\\"easylang.dev\\\"\\nprint domain$\\n#\\n# array of strings\\nfruits$[] = [ \\\"apple\\\" \\\"banana\\\" \\\"orange\\\" ]\\nprint fruits$[]\\n\",\n \"language\": \"EasyLang\"\n },\n {\n \"code\": \"class\\n\\tAPPLICATION\\ninherit\\n\\tARGUMENTS\\ncreate\\n\\tmake\\n\\nfeature {NONE} -- Initialization\\n\\n\\tmake\\n\\t\\t\\t-- Run application.\\n\\t\\tlocal\\n\\t\\t\\ti: INTEGER\\n\\t\\t\\ts: STRING\\n\\t\\tdo\\n\\t\\t\\ti := 100\\n\\t\\t\\ts := \\\"Some string\\\"\\n\\t\\t\\tcreate a.make_empty\\n\\t\\tend\\n\\nfeature {NONE} -- Class Features\\n\\na: ARRAY[INTEGER]\\n\",\n \"language\": \"Eiffel\"\n },\n {\n \"code\": \"-- assume A and B are of the same datatype\\nB := A\\nA.some_modification_feature\\n\",\n \"language\": \"Eiffel\"\n },\n {\n \"code\": \"x = 42\\n\\nsum x y = x + y\\n\",\n \"language\": \"Ela\"\n },\n {\n \"code\": \"sum x y = let z = x + y in z\\n\\nsum x y = z\\n where z = x + y\\n\",\n \"language\": \"Ela\"\n },\n {\n \"code\": \"import system'collections;\\n\\npublic program()\\n{\\n var c := nil; // declaring variable.\\n var a := 3; // declaring and initializing variables\\n var b := \\\"my string\\\".Length;\\n long l := 200l; // declaring strongly typed variable\\n auto lst := new List<int>();\\n\\n c := b + a; // assigning variable\\n}\\n\",\n \"language\": \"Elena\"\n },\n {\n \"code\": \"two() ->\\n\\tA_variable = 1,\\n\\tA_variable + 1.\\n\",\n \"language\": \"Erlang\"\n },\n {\n \"code\": \"let x = 5 // Int\\nlet mutable y = \\\"mutable\\\" // Mutable string\\nlet recordType = { foo : 6; bar : 6 } // Record\\nlet intWidget = new Widget<int>() // Generic class\\nlet add2 x = 2 + x // Function value\\n\",\n \"language\": \"F-Sharp\"\n },\n {\n \"code\": \"let intEqual (x : int) (y : int) = x = y\\nlet genericEqual x y : 'a = x = y\\n\",\n \"language\": \"F-Sharp\"\n },\n {\n \"code\": \"sum <- sum + 1\\n\",\n \"language\": \"F-Sharp\"\n },\n {\n \"code\": \"SYMBOL: foo\\n\\n: use-foo ( -- )\\n 1 foo set\\n foo get 2 + foo set ! foo now = 3\\n foo get number>string print ;\\n\\n:: named-param-example ( a b -- )\\n a b + number>string print ;\\n\\n: local-example ( -- str ) [let \\\"a\\\" :> b \\\"c\\\" :> a a \\\" \\\" b 3append ] ;\\n\",\n \"language\": \"Factor\"\n },\n {\n \"code\": \"/* partially created by Aykayayciti Earl Lamont Montgomery\\nApril 9th, 2018 */\\n\\n/* global and local scrope\\n from the Falcon survival\\n guide book */\\n// global scope\\nsqr = 1.41\\n\\nfunction square( x )\\n\\t// local scope\\n sqr = x * x\\n return sqr\\nend\\n\\n\\nnumber = square( 8 ) * sqr\\n\\n\\na = [1, 2, 3] \\t// array\\nb = 1\\t\\t\\t// variable declaration\\ne = 1.0 \\t\\t// float\\nf = \\\"string\\\"\\t// string\\n\\n/* There are plenty more\\ndata types in Falcon */\\n\",\n \"language\": \"Falcon\"\n },\n {\n \"code\": \": hypot ( a b -- a^2 + b^2 )\\n LOCALS| b a | \\\\ note: reverse order from the conventional stack comment\\n b b * a a * + ;\\n\",\n \"language\": \"Forth\"\n },\n {\n \"code\": \": hypot { a b -- a^2 + b^2 } \\\\ text between \\\"--\\\" and \\\"}\\\" remains commentary\\n a a * b b * + ;\\n\",\n \"language\": \"Forth\"\n },\n {\n \"code\": \": length { F: a F: b F: c -- len } \\\\ floating point locals\\n a a F* b b F* F+ c c F* F+ FSQRT ;\\n\",\n \"language\": \"Forth\"\n },\n {\n \"code\": \"VARIABLE X 999 X ! \\\\ create variable x, store 999 in X\\nVARIABLE Y -999 Y ! \\\\ create variable y, store -999 in Y\\n2VARIABLE W 140569874. W 2! \\\\ create and assign a double precision variable\\n\",\n \"language\": \"Forth\"\n },\n {\n \"code\": \" program test\\n implicit none\\n\\n integer :: i !scalar integer\\n integer,dimension(10) :: ivec !integer vector\\n real :: r !scalar real\\n real,dimension(10) :: rvec !real vector\\n character(len=:),allocatable :: char1, char2 !fortran 2003 allocatable strings\\n\\n!assignments:\\n\\n!-- scalars:\\n i = 1\\n r = 3.14\\n\\n!-- vectors:\\n ivec = 1 !(all elements set to 1)\\n ivec(1:5) = 2\\n\\n rvec(1:9) = 0.0\\n rvec(10) = 1.0\\n\\n!-- strings:\\n char1 = 'hello world!'\\n char2 = char1 !copy from one string to another\\n char2(1:1) = 'H' !change first character\\n\\nend program test\\n\",\n \"language\": \"Fortran\"\n },\n {\n \"code\": \"Dim [Shared] As DataType <i>vble1</i> [, <i>vble2</i>, ...]\\n\",\n \"language\": \"FreeBASIC\"\n },\n {\n \"code\": \"Common [Shared] <i>symbolname</i>[()] [AS DataType] [, ...]\\n\",\n \"language\": \"FreeBASIC\"\n },\n {\n \"code\": \"Var [Shared] variable = expression\\n\\nVar variable As datatype\\nVar var1,var2,... As datatype\\n\",\n \"language\": \"FreeBASIC\"\n },\n {\n \"code\": \"Var s2 = \\\"hello\\\" '' var-len string\\nVar ii = 6728 '' implicit integer\\nVar id = 6728.0 '' implicit double\\n\",\n \"language\": \"FreeBASIC\"\n },\n {\n \"code\": \"Dim [Shared] <i>vble1</i> As DataType [, <i>vble2</i> As DataType, ...]\\n\",\n \"language\": \"FreeBASIC\"\n },\n {\n \"code\": \"Dim As Integer n1, n2\\nDim x As Double\\nDim isRaining As Boolean\\nDim As String greeting\\n\",\n \"language\": \"FreeBASIC\"\n },\n {\n \"code\": \"Dim variable As datatype = value\\nDim var1,var2,... As datatype\\n\",\n \"language\": \"FreeBASIC\"\n },\n {\n \"code\": \"Dim wholeNumber1,wholeNumber2 as Integer = 3\\nDim realNumber as Double = 3.0\\nDim isRaining as Boolean = False\\nDim greeting as String = \\\"Hello, this is World speaking.\\\"\\nDim longArray() As Long = {0, 1, 2, 3}\\nDim twoDimensions (1 To 2, 1 To 5) As Integer => {{1, 2, 3, 4, 5}, {1, 2, 3, 4, 5}}\\n\",\n \"language\": \"FreeBASIC\"\n },\n {\n \"code\": \"variable = expression\\n\",\n \"language\": \"FreeBASIC\"\n },\n {\n \"code\": \" v = a or v => a\\n d = b^2 - 4*a*c\\n s3 = s1 & mid(s2,3,2)\\n\",\n \"language\": \"FreeBASIC\"\n },\n {\n \"code\": \"variable <operator>= expression2\\n\",\n \"language\": \"FreeBASIC\"\n },\n {\n \"code\": \" c += a\\n c -= a\\n c *= a\\n c /= a\\n c \\\\= a\\n c ^= a\\n c Mod= a\\n c Shl= n\\n c Shr= n\\n c &= a\\n c And= n\\n c Eqv= n\\n c Imp= n\\n c Or= n\\n c Xor= n\\n\",\n \"language\": \"FreeBASIC\"\n },\n {\n \"code\": \"void local fn Variables\\n dim a as long // dim var as type\\n dim as long b // dim as type var\\n long c // 'dim as' is optional\\n long x, y, z // declarate multiple vars in one line\\n CFStringRef s1 = @\\\"Alpha\\\", s2 = @\\\"Bravo\\\" // declare and assign in same statement\\n CFArrayRef array = @[s1,s2] // declare and assign an array\\n c = 123 // assign\\n CGRect r = {20,20,120,32} // declare and assign record (struct)\\nend fn\\n\\nfn Variables\\n\\nHandleEvents\\n\",\n \"language\": \"FutureBasic\"\n },\n {\n \"code\": \"# At top level, global variables are declared when they are assigned, so one only writes\\nglobal_var := 1;\\n\\n# In a function, local variables are declared like this\\nfunc := function(n)\\n local a;\\n a := n*n;\\n return n + a;\\nend;\\n\\n# One can test whether a variable is assigned\\nIsBound(global_var);\\n# true;\\n\\n# And destroy a variable\\nUnbind(global_var);\\n\\n# This works with list elements too\\nu := [11, 12, , 14];\\nIsBound(u[4]);\\n# true\\nIsBound(u[3]);\\n# false\\nUnbind(u[4]);\\n\",\n \"language\": \"GAP\"\n },\n {\n \"code\": \"if var.end=0 then // Without the code being in this if statement, the code would keep executing until it were to stop.\\nvar.end=1\\n// These variables, respectively, refer to an integer, a boolean, and a string.\\nvar.variable1=3\\nvar.variable2=True\\nvar.variable3=\\\"Hi!\\\"\\n// var.example1 now refers to a string object instead.\\nvar.variable1=\\\"Bye!\\\"\\nendif\\n\",\n \"language\": \"GlovePIE\"\n },\n {\n \"code\": \"x := 3\\n\",\n \"language\": \"Go\"\n },\n {\n \"code\": \"var x int // declaration\\nx = 3 // assignment\\n\",\n \"language\": \"Go\"\n },\n {\n \"code\": \"y := x+1 // y is int, assuming declaration above\\nsame := x == y // same declared as bool\\np := &same // type of p is pointer to bool\\npi := math.Floor(math.Pi) // math.Floor returns float64, so that is the type of pi\\n\",\n \"language\": \"Go\"\n },\n {\n \"code\": \"var x, y int // two variables, initialized to zero.\\nvar p *int // initialized to nil\\n\",\n \"language\": \"Go\"\n },\n {\n \"code\": \"var (\\n x, y int\\n s string\\n)\\n\",\n \"language\": \"Go\"\n },\n {\n \"code\": \"x, y = y, x // swap x and y\\nsinX, cosX = math.Sincos(x) // Sincos function returns two values\\n// map lookup optionally returns a second value indicating if the key was found.\\nvalue, ok = mapObject[key]\\n\",\n \"language\": \"Go\"\n },\n {\n \"code\": \"func increase (x int) (more int) {\\n x++\\n more = x+x\\n return\\n}\\n\",\n \"language\": \"Go\"\n },\n {\n \"code\": \"x, y := 3, 4\\n\",\n \"language\": \"Go\"\n },\n {\n \"code\": \"foobar = 15\\n\\nf x = x + foobar\\n where foobar = 15\\n\\nf x = let foobar = 15\\n in x + foobar\\n\\nf x = do\\n let foobar = 15\\n return $ x + foobar\\n\",\n \"language\": \"Haskell\"\n },\n {\n \"code\": \"main = do\\n s <- getLine\\n print (s, s)\\n\\n-- The above is equivalent to:\\n\\nmain = getLine >>= \\\\s -> print (s, s)\\n\",\n \"language\": \"Haskell\"\n },\n {\n \"code\": \"funkshun True x = x + 1\\nfunkshun False x = x - 1\\n\\nfoobar = funkshun True 5 + funkshun False 5 -- 6 + 4\\n\",\n \"language\": \"Haskell\"\n },\n {\n \"code\": \"funkshun m = case foo m of\\n [a, b] -> a - b\\n a : b : c : rest -> a + b - c + sum rest\\n a -> sum a\\n\",\n \"language\": \"Haskell\"\n },\n {\n \"code\": \"signum x | x > 0 = 1\\n | x < 0 = -1\\n | otherwise = 0\\n\",\n \"language\": \"Haskell\"\n },\n {\n \"code\": \"dotProduct :: [Int] -> [Int] -> Int\\ndotProduct ns ms = sum $ zipWith (+) ns ms\\n-- Without the type signature, dotProduct would\\n-- have a more general type.\\n\\nfoobar :: Num a => a\\nfoobar = 15\\n-- Without the type signature, the monomorphism\\n-- restriction would cause foobar to have a less\\n-- general type.\\n\",\n \"language\": \"Haskell\"\n },\n {\n \"code\": \"! Strings and arrays must be declared.\\n! Everything else is 8-byte float, READ/WRITE converts\\n CHARACTER str=\\\"abcdef\\\", str2*345, str3*1E6/\\\"xyz\\\"/\\n REAL, PARAMETER :: named_constant = 3.1415\\n REAL :: n=2, cols=4, vec(cols), mtx(n, cols)\\n DATA vec/2,3,4,5/, mtx/1,2,3.1415,4, 5,6,7,8/\\n\\n named = ALIAS(alpha, beta, gamma) ! gamma == named(3)\\n ALIAS(vec,n, subvec,2) ! share subvec and vec(n...n+1)\\n ALIAS(str,3, substr,n) ! share substr and str(3:3+n-1)\\n\\n a = EXP(b + c) ! assign/initialze a=1, b=0, c=0\\n str = \\\"blahblah\\\" ! truncate/expand if needed\\n beta = \\\"blahblah\\\" ! illegal\\n\\n CALL noArguments_noUSE ! global scope SUBROUTINE\\n CALL Arguments_or_USE(a) ! local scope SUBROUTINE\\n t = func() ! local scope FUNCTION\\n\\nSUBROUTINE noArguments_noUSE() ! all global\\n vec2 = $ ! 1,2,3,...\\nEND\\n\\nSUBROUTINE Arguments_or_USE(var) ! all local\\n USE : vec ! use global object\\n var = SUM(vec)\\n t = TIME() ! local, static, USEd by func()\\nEND\\n\\nFUNCTION func() ! all local\\n USE Arguments_or_USE : t ! use local object\\n func = t\\nEND\\n\",\n \"language\": \"HicEst\"\n },\n {\n \"code\": \"U8 i;\\n\",\n \"language\": \"HolyC\"\n },\n {\n \"code\": \"U8 b1 = 8;\\nU8 b2 = b1 * 10;\\n\",\n \"language\": \"HolyC\"\n },\n {\n \"code\": \"U8 uint1, uint2, uint3;\\n\",\n \"language\": \"HolyC\"\n },\n {\n \"code\": \"U8 *str = \\\"The HolyC Language\\\";\\n\",\n \"language\": \"HolyC\"\n },\n {\n \"code\": \"global gvar # a global\\n\\nprocedure main(arglist) # arglist is a parameter of main\\nlocal a,b,i,x # a, b, i, x are locals withing main\\nstatic y # a static (silly in main)\\n\\nx := arglist[1]\\na := 1.0\\ni := 10\\nb := [x,a,i,b]\\n\\n# ... rest of program\\nend\\n\",\n \"language\": \"HolyC\"\n },\n {\n \"code\": \"val=. 0\\n\",\n \"language\": \"J\"\n },\n {\n \"code\": \"fun =: 3 :0\\n val1 =: 0\\n val1 =. 2\\n val2 =. 3\\n val1, val2\\n)\\n fun''\\n2 3\\n val1\\n0\\n val2\\n|value error\\n\",\n \"language\": \"J\"\n },\n {\n \"code\": \"fun1 =: 3 :0\\n val3=. 0\\n val3=: 0\\n)\\n fun1''\\n|domain error\\n\",\n \"language\": \"J\"\n },\n {\n \"code\": \"fun2 =: 3 :0\\n val4=. 0\\n 3 :'val4=:y' y\\n)\\n fun2 ''\\n\",\n \"language\": \"J\"\n },\n {\n \"code\": \"int a;\\ndouble b;\\nAClassNameHere c;\\n\",\n \"language\": \"Java\"\n },\n {\n \"code\": \"int a, b, c;\\n\",\n \"language\": \"Java\"\n },\n {\n \"code\": \"int a = 5;\\ndouble b;\\nint c = 5, d = 6, e, f;\\nString x = \\\"test\\\";\\nString y = x;\\nb = 3.14;\\n\",\n \"language\": \"Java\"\n },\n {\n \"code\": \"final String x = \\\"blah\\\";\\nfinal String y;\\nfinal double[] nums = new double[15];\\ny = \\\"test\\\";\\nx = \\\"blahblah\\\"; //not legal\\nnums[5] = 2.5; //legal\\nnums = new double[10]; //not legal\\nfinal Date now = new java.util.Date();\\nnow.setTime(1234567890); //legal\\nnow = new Date(1234567890); //not legal\\n\",\n \"language\": \"Java\"\n },\n {\n \"code\": \"// a globally-scoped variable\\nvar a=1;\\n\\n// global scope\\nfunction one(){\\n alert(a);\\n}\\n\\n// local scope\\nfunction two(a){\\n alert(a);\\n}\\n\\n// local scope again\\nfunction three(){\\n var a = 3;\\n alert(a);\\n}\\n\\n// Intermediate: no such thing as block scope in javascript\\nfunction four(){\\n if(true){\\n var a=4;\\n }\\n\\n alert(a); // alerts '4', not the global value of '1'\\n}\\n\\n\\n// Intermediate: object properties\\nfunction Five(){\\n this.a = 5;\\n}\\n\\n\\n// Advanced: closure\\nvar six = function(){\\n var foo = 6;\\n\\n return function(){\\n // javascript \\\"closure\\\" means I have access to foo in here,\\n // because it is defined in the function in which I was defined.\\n alert(foo);\\n }\\n}()\\n\\n\\n// Advanced: prototype-based scope resolution\\nfunction Seven(){\\n this.a = 7;\\n}\\n\\n// [object].prototype.property loses to [object].property in the scope chain\\nSeven.prototype.a = -1; // won't get reached, because 'a' is set in the constructor above.\\nSeven.prototype.b = 8; // Will get reached, even though 'b' is NOT set in the constructor.\\n\\n\\n\\n// These will print 1-8\\none();\\ntwo(2);\\nthree();\\nfour();\\nalert(new Five().a);\\nsix();\\nalert(new Seven().a);\\nalert(new Seven().b);\\n\",\n \"language\": \"JavaScript\"\n },\n {\n \"code\": \"[] unstack\\n\",\n \"language\": \"Joy\"\n },\n {\n \"code\": \"42\\n\",\n \"language\": \"Joy\"\n },\n {\n \"code\": \"stack\\n\",\n \"language\": \"Joy\"\n },\n {\n \"code\": \"jq -n '1 as $x | (2 as $x | $x) | $x'\\n\",\n \"language\": \"Jq\"\n },\n {\n \"code\": \"EXPRESSION as $NAME\\n\",\n \"language\": \"Jq\"\n },\n {\n \"code\": \"def test: $x;\\ntest\\n\",\n \"language\": \"Jq\"\n },\n {\n \"code\": \"jq --arg x 123 -n -f test.jq\\n\",\n \"language\": \"Jq\"\n },\n {\n \"code\": \"#declaration/assignment, declaration is optional\\nx::Int32 = 1\\n#datatypes are inferred dynamically, but can also be set thru convert functions and datatype literals\\nx = 1 #x is inferred as Int, which is Int32 for 32-bit machines, Int64 for 64-bit machines\\n#variable reference\\njulia>x\\n1\\n\\nx = int8(1) #x is of type Int8\\nx = 1.0 #x is Float64\\nx = y = 1 #assign both x and y to 1\\nglobal x = 1 #assigns 1 to global variable x (used inside scope blocks)\\nlocal x = 1 #assigns 1 to local variable x (used inside scope blocks)\\nx = 'a' #x is a 'Char' type, designated by single quotes\\nx = \\\"a\\\" #x is a 1-element string, designated by double quotes\\n\",\n \"language\": \"Julia\"\n },\n {\n \"code\": \"const e = 2.71828182845904523536\\nconst pi = 3.14159265358979323846\\n\",\n \"language\": \"Julia\"\n },\n {\n \"code\": \"// version 1.0.6\\n\\nfun main(args: Array<String>) {\\n /* read-only variables */\\n val i = 3 // type inferred to be Int\\n val d = 2.4 // type inferred to be double\\n val sh: Short = 2 // type specified as Short\\n val ch = 'A' // type inferred to be Char\\n val bt: Byte = 1 // type specified as Byte\\n\\n /* mutable variables */\\n var s = \\\"Hey\\\" // type inferred to be String\\n var l = 4L // type inferred to be Long\\n var b: Boolean // type specified as Boolean, not initialized immediately\\n var f = 4.4f // type inferred to be Float\\n\\n b = true // now initialized\\n println(\\\"$i, $d, $sh, $ch, $bt, $s, $l, $b, $f\\\")\\n\\n s = \\\"Bye\\\" // OK as mutable\\n l = 5L // OK as mutable\\n b = false // OK as mutable\\n f = 5.6f // OK as mutable\\n\\n println(\\\"$i, $d, $sh, $ch, $bt, $s, $l, $b, $f\\\")\\n}\\n\",\n \"language\": \"Kotlin\"\n },\n {\n \"code\": \"1) working in a global scope\\n\\n{def A 3}\\n-> A // A is in the global scope\\n{def B 4}\\n-> B // B is in the global scopel\\n{def MUL {lambda {:x :y} {* :x :y}}}\\n-> MUL // MUL is a global function\\n{MUL {A} {B}} // using global variables\\n-> 12\\n\\n2) working in a local scope\\n\\n{let // open local scope\\n { // begin defining and assigning local variables\\n {:a 3} // :a is local\\n {:b 4} // :b is local\\n {:mul {lambda {:x :y} {* :x :y}}} // :mul is a local function\\n } // end defining and assigning local variables\\n {:mul :a :b} // computing with local variables\\n} // closing local scope\\n-> 12\\n\",\n \"language\": \"Lambdatalk\"\n },\n {\n \"code\": \"// declare thread variable, default type null\\nvar(x)\\n$x->type // null\\n\\n// declare local variable, default type null\\nlocal(x)\\n#x->type // null\\n\\n// declare thread variable, initialize with a type, in this case integer\\nvar(x = integer)\\n\\n// declare local variable, initialize with a type, in this case integer\\nlocal(x = integer)\\n\\n// assign a value to the thread var x\\n$x = 12\\n\\n// assign a value to the local var x\\n$x = 177\\n\\n// a var always has a data type, even if not declared - then it's null\\n// a var can either be assigned a type using the name of the type, or a value that is by itself the type\\nlocal(y = string)\\nlocal(y = 'hello')\\n\\n'\\\\r'\\n// demonstrating asCopyDeep and relationship between variables:\\nlocal(original) = array('radish', 'carrot', 'cucumber', 'olive')\\nlocal(originalaswell) = #original\\nlocal(copy) = #original->asCopyDeep\\niterate(#original) => {\\n loop_value->uppercase\\n}\\n#original\\t\\t// modified\\n//array(RADISH, CARROT, CUCUMBER, OLIVE)\\n'\\\\r'\\n#originalaswell // modified as well as it was not a deep copy\\n//array(RADISH, CARROT, CUCUMBER, OLIVE)\\n'\\\\r'\\n#copy\\t\\t\\t// unmodified as it used ascopydeep\\n//array(RADISH, CARROT, CUCUMBER, OLIVE)\\n\",\n \"language\": \"Lasso\"\n },\n {\n \"code\": \"'In Liberty BASIC variables are either string or numeric.\\n'A variable name can start with any letter and it can contain both letters and numerals, as well as dots (for example: user.firstname).\\n'There is no practical limit to the length of a variable name... up to ~2M characters.\\n'The variable names are case sensitive.\\n\\n'assignments: -numeric variables. LB assumes integers unless assigned or calculated otherwise.\\n'Because of its Smalltalk heritage, LB integers are of arbitrarily long precision.\\n'They lose this if a calculation yields a non-integer, switching to floating point.\\n i = 1\\n r = 3.14\\n\\n'assignments -string variables. Any string-length, from zero to ~2M.\\n t$ =\\\"21:12:45\\\"\\n flag$ =\\\"TRUE\\\"\\n\\n'assignments -1D or 2D arrays\\n'A default array size of 10 is available. Larger arrays need pre-'DIM'ming.\\n height( 3) =1.87\\n dim height( 50)\\n height( 23) =123.5\\n potential( 3, 5) =4.5\\n name$( 4) =\\\"John\\\"\\n\\n'There are no Boolean /bit variables as such.\\n\\n'Arrays in a main program are global.\\n'However variables used in the main program code are not visible inside functions and subroutines.\\n'They can be declared 'global' if such visibility is desired.\\n'Functions can receive variables by name or by reference.\\n\",\n \"language\": \"Liberty-BASIC\"\n },\n {\n \"code\": \"x = 23\\ny = \\\"Hello world!\\\"\\nz = TRUE -- same effect as z = 1\\n\",\n \"language\": \"Lingo\"\n },\n {\n \"code\": \"on foo\\n put x\\nend\\n\",\n \"language\": \"Lingo\"\n },\n {\n \"code\": \"put value(\\\"x\\\")\\n-- <Void> -- means: undefined\\n\",\n \"language\": \"Lingo\"\n },\n {\n \"code\": \"on foo\\n x = VOID\\n put x\\nend\\n\",\n \"language\": \"Lingo\"\n },\n {\n \"code\": \"global x\\non foo\\n put x\\nend\\n\",\n \"language\": \"Lingo\"\n },\n {\n \"code\": \"on foo\\n global x\\n put x\\nend\\n\",\n \"language\": \"Lingo\"\n },\n {\n \"code\": \"_global.x = 23\\n\",\n \"language\": \"Lingo\"\n },\n {\n \"code\": \"put _global.x\\n\",\n \"language\": \"Lingo\"\n },\n {\n \"code\": \"make \\\"g1 0\\nname 2 \\\"g2 ; same as make with parameters reversed\\nglobal \\\"g3 ; no initial value\\nto func :x\\n make \\\"g4 4 ; still global\\n localmake \\\"L1 6\\n local [\\\"L2 \\\"L3] ; local variables, collection syntax\\n func2 :g4\\n print :L2 ; 9, modified by func2\\n print :L3 ; L3 has no value, was not modified by func2\\nend\\nto func2 :y\\n make \\\"g3 :y\\n make \\\"L2 :L1 + 3 ; dynamic scope: can see variables of callers\\n localmake \\\"L3 5 ; locally override L3 from caller\\n (print :y :L1 :L2 :L3) ; 4 6 9 5\\nend\\nprint :g4 ; 4\\nprint :L1 ; L1 has no value\\nprint name? \\\"L1 ; false, L1 is not bound in the current scope\\n\",\n \"language\": \"Logo\"\n },\n {\n \"code\": \"Sub Click()\\n'a few declarations as example\\nDim s as New NotesSession ' declaring a New NotesSession actually returns the current, active NotesSession\\nDim i as Integer ' i = 0\\nDim s as String ' s= \\\"\\\"\\nDim v as Variant ' v is nothing\\nDim l as Long ' l = 0\\nDim doc as NotesDocument 'doc is EMTPY\\n\\n'...\\n\\nEnd Sub\\n\",\n \"language\": \"LotusScript\"\n },\n {\n \"code\": \"a = 1 -- Here we declare a numeric variable\\nfruit = \\\"banana\\\" -- Here we declare a string datatype\\nneedspeeling = True -- This is a boolean\\nlocal b = 2 -- This variable declaration is prefixed with a scope modifier\\n\",\n \"language\": \"Lua\"\n },\n {\n \"code\": \"A, B, C, D, E = 2, 4, 6, 8, \\\"It's never too late\\\"\\n\",\n \"language\": \"Lua\"\n },\n {\n \"code\": \"\\\\\\\\ M2000 use inference to state the type of a new variable, at run time\\n\\\\\\\\ We can use literals of a numeric type\\n\\\\\\\\ @ for Decimal\\n\\\\\\\\ # for Currency\\n\\\\\\\\ ~ for Single\\n\\\\\\\\ & for Long (32bit)\\n\\\\\\\\ % for Integer (16bit)\\n\\\\\\\\ Double and Boolean have no symboles\\nModule TopA {\\n Module Alfa {\\n Print A=10000, Type$(A)=\\\"Double\\\"\\n \\\\\\\\ A is local, we use =\\n A=10@\\n Print A=10, Type$(A)\\n \\\\\\\\ Or we can state the type before\\n Def Currency K, Z=500, M\\n K=1000\\n \\\\\\\\ Currency Currency Currency\\n Print Type$(K), Type$(Z), Type$(M)\\n Def Double K1, K2 as Integer=10, K3=1\\n \\\\\\\\ double integer double\\n Print Type$(K1), Type$(K2), Type$(K3)\\n Mb=1=1\\n \\\\\\\\ We get a boolean\\n Print Type$(Mb)\\n Def boolean Mb1=True\\n Print Type$(Mb1)\\n \\\\\\\\ True and False are Double -1 and 0 not Boolean\\n Mb3=True\\n Print Type$(Mb3)=\\\"Double\\\"\\n \\\\\\\\ For strings we have to use $ (like in old Basic)\\n A$=\\\"This is a String\\\"\\n Global G1 as boolean = True\\n \\\\\\\\ To change a global variable we have to use <=\\n G1<=1=0\\n \\\\\\\\ If we do this: G1=1=0 we make a local variable, and shadow global\\n \\\\\\\\ In a For Object {} we can make temporary variables\\n For This {\\n Local G1=122.1212\\n Print G1, Type$(G1)=\\\"Double\\\"\\n }\\n Print G1, Type$(G1)=\\\"Boolean\\\"\\n }\\n \\\\\\\\ shadow A for this module only\\n A=100\\n \\\\\\\\ Now we call Alfa\\n Alfa\\n Print (A=100)=True\\n}\\nGlobal A=10000\\nTopA\\nPrint A=10000\\nModule CheckStatic {\\n \\\\\\\\ clear static variables and variables (for this module)\\n Clear\\n Module K {\\n \\\\\\\\ if no A exist created with value 100@\\n \\\\\\\\ Static variables can't be referenced\\n Static A=100@\\n Print A, Type$(A)=\\\"Decimal\\\"\\n A++\\n }\\n For i=1 to 10 : K : Next i\\n Print A=10000\\n}\\nCheckStatic\\nPrint A=10000\\n\\n\\\\\\\\ reference and use of stack of values\\nC=100&\\nModule ChangeC {\\n \\\\\\\\ we leave arguments in stack of values\\n Module HereChangeC (&f) {\\n \\\\\\\\ interpreter execute a Read &f\\n f++\\n }\\n \\\\\\\\ now we call HereChangeC passing current stack of values\\n HereChangeC\\n}\\n\\\\\\\\ Calling a module done without checking for what parameters a module take\\nChangeC &C\\nPrint C, Type$(C)=\\\"Long\\\"\\nK=10010001001@\\nChangeC &K\\nPrint K, Type$(K)=\\\"Decimal\\\"\\nModule TypeRef (&x as Double) {\\n Print x\\n x++\\n}\\nD=100\\nTypeRef &D\\nTry ok {\\n TypeRef &K\\n}\\nIf Error or Not Ok then Print Error$ ' we get wrong data type\\n\",\n \"language\": \"M2000-Interpreter\"\n },\n {\n \"code\": \"a := 1:\\nprint (\\\"a is \\\"||a);\\n \\\"a is 1\\\"\\n\",\n \"language\": \"Maple\"\n },\n {\n \"code\": \"b;\\nf := proc()\\n local b := 3;\\n print(\\\"b is \\\"||b);\\nend proc:\\nf();\\nprint(\\\"b is \\\"||b);\\n b\\n \\\"b is 3\\\"\\n \\\"b is b\\\"\\n\",\n \"language\": \"Maple\"\n },\n {\n \"code\": \"f := proc()\\n global c;\\n c := 3;\\n print(\\\"a is \\\"||a);\\n print(\\\"c is \\\"||c);\\nend proc:\\nf();\\nprint(\\\"c is \\\"||c);\\n \\\"a is 1\\\"\\n \\\"c is 3\\\"\\n \\\"c is 3\\\"\\n\",\n \"language\": \"Maple\"\n },\n {\n \"code\": \"print (\\\"a is \\\"||a);\\na := 4:\\nprint (\\\"a is \\\"||a);\\n \\\"a is 1\\\"\\n \\\"a is 4\\\"\\n\",\n \"language\": \"Maple\"\n },\n {\n \"code\": \"print (\\\"a is \\\"||a);\\ntype(a, integer);\\na := \\\"Hello World\\\":\\nprint (\\\"a is \\\"||a);\\ntype(a, integer);\\ntype(a, string);\\n \\\"a is 4\\\"\\n true\\n \\\"a is Hello World\\\"\\n false\\n true\\n\",\n \"language\": \"Maple\"\n },\n {\n \"code\": \"`This is a variable` := 1:\\nprint(`This is a variable`);\\n 1\\n\",\n \"language\": \"Maple\"\n },\n {\n \"code\": \"print (\\\"a is \\\"||a);\\ntype(a, string);\\nprint(\\\"c is \\\"||c);\\na := 'a':\\nprint (\\\"a is \\\"||a);\\ntype(a, symbol);\\nunassign('c');\\nprint(\\\"c is \\\"||c);\\n \\\"a is Hello World\\\"\\n true\\n \\\"c is 3\\\"\\n \\\"a is a\\\"\\n true\\n \\\"c is c\\\"\\n\",\n \"language\": \"Maple\"\n },\n {\n \"code\": \"\\ta = 4; % declare variable and initialize double value,\\n s = 'abc'; % string\\n i8 = int8(5);\\t% signed byte\\n u8 = uint8(5);\\t% unsigned byte\\n i16 = int16(5);\\t% signed 2 byte\\n u16 = uint16(5); % unsigned 2 byte integer\\n i32 = int32(5);\\t% signed 4 byte integer\\n u32 = uint32(5);% unsigned 4 byte integers\\n i64 = int64(5);\\t% signed 8 byte integer\\n u64 = uint64(5);% unsigned 8 byte integer\\n\\tf32 = float32(5); % single precision floating point number\\n\\tf64 = float64(5); % double precision floating point number , float 64 is the default data type.\\n\\n\\tc = 4+5i; %\\tcomplex number\\n colvec = [1;2;4]; % column vector\\n crowvec = [1,2,4]; % row vector\\n m = [1,2,3;4,5,6]; % matrix with size 2x3\\n\",\n \"language\": \"MATLAB\"\n },\n {\n \"code\": \" global b\\n\",\n \"language\": \"MATLAB\"\n },\n {\n \"code\": \":- func name = string.\\nname = Name :-\\n Name = Title ++ \\\" \\\" ++ Given,\\n Title = \\\"Dr.\\\",\\n Given = \\\"Bob\\\".\\n\",\n \"language\": \"Mercury\"\n },\n {\n \"code\": \":- pred greet(string::in, io::di, io::uo) is det.\\ngreet(Who, !IO) :-\\n io.write_string(\\\"Hello\\\", !IO),\\n io.format(\\\", %s!\\\\n\\\", [s(Who)], !IO).\\n\",\n \"language\": \"Mercury\"\n },\n {\n \"code\": \":- pred greet(string::in, io::di, io::uo) is det.\\ngreet(Who, !.IO, !:IO) :-\\n io.write_string(\\\"Hello\\\", !.IO, !:IO),\\n io.format(\\\", %s!\\\\n\\\", [s(Who)], !.IO, !:IO).\\n\",\n \"language\": \"Mercury\"\n },\n {\n \"code\": \":- pred greet(string::in, io::di, io::uo) is det.\\ngreet(Who, IO0, IO) :-\\n io.write_string(\\\"Hello\\\", IO0, IO1),\\n io.format(\\\", %s!\\\\n\\\", [s(Who)], IO1, IO).\\n\",\n \"language\": \"Mercury\"\n },\n {\n \"code\": \":- func dr(string) = string.\\ndr(Name) = Titled :-\\n some [!SB] (\\n !:SB = string.builder.init,\\n put_char(handle, 'D', !SB),\\n put_char(handle, 'r', !SB),\\n format(handle, \\\" %s\\\", [s(Name)], !SB),\\n Titled = to_string(!.SB)\\n ).\\n\",\n \"language\": \"Mercury\"\n },\n {\n \"code\": \" % all_under(N, L)\\n % True if every member of L is less than N\\n %\\n:- pred all_under(int::in, list(int)::in) is semidet.\\nall_under(Limit, L) :-\\n all [N] (member(N, L) => N < Limit).\\n\",\n \"language\": \"Mercury\"\n },\n {\n \"code\": \":- type accumulator == (pred(int, int, io, io)).\\n:- inst accumulator == (pred(in, out, di, uo) is det).\\n\\n:- func accumulator >> accumulator = accumulator.\\n:- mode in(accumulator) >> in(accumulator) = out(accumulator).\\nA >> B = C :-\\n C = (pred(!.N::in, !:N::out, !.IO::di, !:IO::uo) is det :-\\n A(!N, !IO),\\n B(!N, !IO)).\\n\\n:- pred add(int::in, int::in, int::out, io::di, io::uo) is det.\\nadd(N, !Acc, !IO) :-\\n io.format(\\\"adding %d to accumulator (current value: %d)\\\\n\\\",\\n [i(N), i(!.Acc)], !IO),\\n !:Acc = !.Acc + N.\\n\\n:- pred example2(io::di, io::uo) is det.\\nexample2(!IO) :-\\n F = add(5)\\n >> add(5)\\n >> add(-10),\\n F(0, X, !IO),\\n io.print_line(X, !IO).\\n\",\n \"language\": \"Mercury\"\n },\n {\n \"code\": \":- module evenodd.\\n:- interface.\\n:- import_module io.\\n:- pred main(io::di, io::uo) is det.\\n:- implementation.\\n:- import_module list, string.\\n\\n:- type coin\\n ---> heads\\n ; tails.\\n\\n:- inst heads for coin/0\\n ---> heads.\\n:- inst tails for coin/0\\n ---> tails.\\n\\nmain(!IO) :-\\n (if heads(heads, N) then\\n print_heads(N, !IO)\\n else true).\\n\\n:- pred print_heads(coin::in(heads), io::di, io::uo) is det.\\nprint_heads(_, !IO) :-\\n io.write_string(\\\"heads\\\\n\\\", !IO).\\n\\n:- pred print_tails(coin::in(tails), io::di, io::uo) is det.\\nprint_tails(_, !IO) :-\\n io.write_string(\\\"tails\\\\n\\\", !IO).\\n\\n:- pragma foreign_export_enum(\\\"C\\\", coin/0, [prefix(\\\"COIN_\\\"), uppercase]).\\n\\n:- pred heads(coin::in, coin::out(heads)) is semidet.\\n:- pragma foreign_proc(\\\"C\\\",\\n heads(N::in, M::out(heads)),\\n [promise_pure, will_not_call_mercury],\\n\\\"\\n M = N;\\n SUCCESS_INDICATOR = N == COIN_HEADS;\\n\\\").\\n\",\n \"language\": \"Mercury\"\n },\n {\n \"code\": \"foo equ 0x100\\nbar equ foo+1\\n;it's heavily implied that \\\"foo\\\" is one byte, otherwise, why would you label this? But you should always comment your variables.\\n\",\n \"language\": \"MIPS-Assembly\"\n },\n {\n \"code\": \"li $t0,5 ;load the register $t0 with the value 5.\\n\",\n \"language\": \"MIPS-Assembly\"\n },\n {\n \"code\": \".definelabel USER_RAM,0xA0000000\\nfoo equ 0x100 ;represents an offset from USER_RAM. Indexed offsetting can only be done at compile time in MIPS.\\n\\nla $t0,USER_RAM\\nnop ;load delay slot ($t0 might not be ready by the time the load occurs)\\nlbu $t1,foo($t0) ;load the unsigned byte from memory address 0xA0000100\\n\",\n \"language\": \"MIPS-Assembly\"\n },\n {\n \"code\": \"MODULE Foo EXPORTS Main;\\n\\nIMPORT IO, Fmt;\\n\\nVAR foo: INTEGER := 5; (* foo is global (to the module). *)\\n\\nPROCEDURE Foo() =\\n VAR bar: INTEGER := 10; (* bar is local to the procedure Foo. *)\\n BEGIN\\n IO.Put(\\\"foo + bar = \\\" & Fmt.Int(foo + bar) & \\\"\\\\n\\\");\\n END Foo;\\n\\nBEGIN\\n Foo();\\nEND Foo.\\n\",\n \"language\": \"Modula-3\"\n },\n {\n \"code\": \"PROCEDURE Foo(n: INTEGER) =\\n\",\n \"language\": \"Modula-3\"\n },\n {\n \"code\": \"PROCEDURE Foo(VAR n: INTEGER) =\\n\",\n \"language\": \"Modula-3\"\n },\n {\n \"code\": \"// variable definition and initialization/assignment\\n//\\n// variables are initialized when they are defined\\na = 1\\nb = 2\\nc = null\\n\\n// datatypes\\n//\\n// variables may contain any datatype, and this can be\\n// changed at any time by assigning a new value. they may\\n// also contain native java types\\nvar = \\\"a string\\\"\\nvar = 123\\nvar = new(Nanoquery.Util.Random)\\nvar = new(java.lang.Object)\\n\\n// scope\\n//\\n// all classes, functions, and control blocks have their\\n// own scope\\nx = 5\\nfor i in range(1, 2)\\n // we can reference 'x' within this loop without issue\\n println x\\n\\n // we can also define variables that have this loop as their\\n // scope\\n y = 5\\nend\\n// trying to reference the variable 'y' outside of its scope would result\\n// in a null reference exception\\nprintln y\\n//%null reference exception: variable object 'y' has not been defined\\n// at <global>:33\\n\\n\\n// referencing\\n//\\n// as already demonstrated, variables are referenced by using their\\n// name\\npart1 = \\\"this is \\\"\\npart2 = \\\"a test sentence\\\"\\nprintln part1 + part2\\n\\n// other facilities\\n//\\n// variables may be marked for garbage collection in their current\\n// scope using the 'delete' command\\ntest_var = \\\"pretend this is a really large object we want to free up\\\"\\ndelete test_var\\n\",\n \"language\": \"Nanoquery\"\n },\n {\n \"code\": \"var x: int = 3 # Declaration with type specification and initialization.\\n\\nvar y = 3 # Declaration with type inferred to \\\"int\\\".\\n\\nvar z: int # Variable is initialized to 0.\\n\\nlet a = 13 # Immutable variable.\\n\\n# Using a var block to initialize.\\nvar\\n b, c: int = 10 # Two variables initialized to 10\\n s* = \\\"foobar\\\" # This one is exported.\\n\\ntype Obj = ref object\\n i: int\\n s: string\\n\\nvar obj = Obj(i: 3, s: \\\"abc\\\") # Initialization with an implicit allocation by \\\"new\\\".\\necho obj.a, \\\" \\\", obj.s # Equivalent to obj[].a and obj[].s.\\n\\nproc p =\\n var xloc = 3\\n echo x # Referencing a global variable.\\n\\n proc q =\\n echo xloc # Referencing a variable in the enclosing scope.\\n\",\n \"language\": \"Nim\"\n },\n {\n \"code\": \"a : Int;\\nb : Int := 13;\\nc := 7;\\n\",\n \"language\": \"Objeck\"\n },\n {\n \"code\": \"let x = 28\\n\",\n \"language\": \"OCaml\"\n },\n {\n \"code\": \"let y = ref 28\\n\",\n \"language\": \"OCaml\"\n },\n {\n \"code\": \" !y (* access *)\\n y := 34 (* modification *)\\n\",\n \"language\": \"OCaml\"\n },\n {\n \"code\": \"let sum = (* sum is bound to 181 *)\\n let a = 31\\n and b = 150 in\\n (a + b)\\n\\nlet sum () = (* sum is a function which returns 181 *)\\n let a = 31\\n and b = 150 in\\n (a + b)\\n\",\n \"language\": \"OCaml\"\n },\n {\n \"code\": \"import: date\\n\\n: testVariable\\n| a b c |\\n Date now ->a\\n a println ;\\n\",\n \"language\": \"Oforth\"\n },\n {\n \"code\": \"; Declare the symbol 'var1' and associate number 123 with it.\\n(define var1 123)\\n(print var1)\\n; ==> 123\\n\\n; Reassociate number 321 with var1.\\n(define var1 321)\\n(print var1)\\n\\n; Create function that prints value of var1 ...\\n(define (show)\\n (print var1))\\n; ... and eassociate number 42 with var1.\\n(define var1 42)\\n\\n(print var1)\\n; ==> 42\\n; var1 prints as 42, but...\\n(show)\\n; ==> 321\\n; ... function 'show' still print old associated value\\n\",\n \"language\": \"Ol\"\n },\n {\n \"code\": \"a.=4711\\nSay 'before sub a.3='a.3\\nCall sub a.\\nSay ' after sub a.3='a.3\\nExit\\nsub: Procedure\\nuse Arg a.\\na.3=3\\nReturn\\n\",\n \"language\": \"OoRexx\"\n },\n {\n \"code\": \"mynumber=5+4; // This gives a value of nine\\n\",\n \"language\": \"Openscad\"\n },\n {\n \"code\": \"'WAYS OF DECLARING VARIABLES\\n'AND ASSIGNING VALUES\\nvar int a,b,c,d\\nint a=1,b=2,c=3,d=4\\ndim int a=1,b=2, c=3, d=4\\ndim as int a=1,b=2, c=3, d=4\\ndim a=1,b=2, c=3, d=4 as int\\nprint c '3\\n\\n'CREATING ARRAY VARIABLES\\nint array[100]\\ndim int a={10,20,30,40} 'implicit array\\nprint a[3] '30\\n\\n'COMMONLY USED TYPES:\\n'byte word int sys float char string\\n\\n'LIMITING SCOPE\\ndim int a=10\\nscope\\n dim int a=100\\n dim int b=1000\\n print a '100\\nend scope\\nprint a 'prior a: 10\\nprint b 'error b is out of scope\\n\\n'REFERENCING VARIABLES\\ndim int*p 'p is a pointer variable\\ndim int a={2,4,6,8}\\n@p=@a[3] 'address of p is assigned address of a[3]\\nprint @p 'the address\\nprint p '6\\nprint p[1] '6\\nprint p[2] '8\\n\",\n \"language\": \"OxygenBasic\"\n },\n {\n \"code\": \"declare\\nVar %% new variable Var, initially free\\n{Show Var}\\nVar = 42 %% now Var has the value 42\\n{Show Var}\\nVar = 42 %% the same value is assigned again: ok\\nVar = 43 %% a different value is assigned: exception\\n\",\n \"language\": \"Oz\"\n },\n {\n \"code\": \"declare\\n V = 42\\nin\\n {Wait V} %% explicitly wait for V to become determined\\n\\n if {IsDet V} then %% check whether V is determined; not recommended\\n {Show determined}\\n elseif {IsFree V} then %% check whether V is free; not recommended\\n {Show free}\\n end\\n\",\n \"language\": \"Oz\"\n },\n {\n \"code\": \"declare\\n A = {NewCell 42}\\n OldVal\\nin\\n {Show @A} %% read a cell with @\\n A := 43 %% change its value\\n OldVal = A := 44 %% read and write at the same time (atomically)\\n\",\n \"language\": \"Oz\"\n },\n {\n \"code\": \"declare\\n A = 3\\n B\\nin\\n A = B\\n {Show B}\\n\",\n \"language\": \"Oz\"\n },\n {\n \"code\": \"declare\\n A = 3\\n A = B %% Error: variable B not introduced\\nin\\n {Show B}\\n\",\n \"language\": \"Oz\"\n },\n {\n \"code\": \"declare\\n [A B C D] = [1 2 3 4] %% unification of two lists\\n\",\n \"language\": \"Oz\"\n },\n {\n \"code\": \"functor\\nexport Function\\ndefine\\n ToplevelVariable = 42\\n\\n fun {Function}\\n 42\\n end\\nend\\n\",\n \"language\": \"Oz\"\n },\n {\n \"code\": \"fun {Function Arg}\\n LocalVar1\\nin\\n LocalVar1 = if Arg == 42 then\\n\\t\\t LocalVar2\\n\\t in\\n\\t\\t LocalVar2 = yes\\n\\t\\t LocalVar2\\n\\t else\\n\\t\\t LocalVar3 = no %% variables can be initialized when declared\\n\\t in\\n\\t\\t LocalVar3\\n\\t end\\n LocalVar1\\nend\\n\",\n \"language\": \"Oz\"\n },\n {\n \"code\": \"if {IsEven 42} then\\n {System.showInfo \\\"Here, LocalVar is not visible.\\\"}\\n local\\n LocalVar = \\\"Here, LocalVar IS visible\\\"\\n in\\n {System.showInfo LocalVar}\\n end\\nend\\n\",\n \"language\": \"Oz\"\n },\n {\n \"code\": \"case \\\"Rosetta code\\\" of First|_ then {Show First} end %% prints \\\"R\\\"\\n\",\n \"language\": \"Oz\"\n },\n {\n \"code\": \"declare\\n A\\n B = !!A %% B is a read-only view of A\\nin\\n thread\\n B = 43 %% this blocks until A is known; then it fails because 43 \\\\= 42\\n end\\n A = 42\\n\",\n \"language\": \"Oz\"\n },\n {\n \"code\": \"'x\\n\",\n \"language\": \"PARI-GP\"\n },\n {\n \"code\": \"'x^3+7\\n\",\n \"language\": \"PARI-GP\"\n },\n {\n \"code\": \"sub dofruit {\\n $fruit='apple';\\n}\\n\\ndofruit;\\nprint \\\"The fruit is $fruit\\\";\\n\",\n \"language\": \"Perl\"\n },\n {\n \"code\": \"my $x = @a; # Scalar assignment; $x is set to the\\n # number of elements in @a.\\nmy ($x) = @a; # List assignment; $x is set to the first\\n # element of @a.\\nmy @b = @a; # List assignment; @b becomes the same length\\n # as @a and each element becomes the same.\\nmy ($x, $y, @b) = @a; # List assignment; $x and $y get the first\\n # two elements of @a, and @b the rest.\\nmy ($x, $y, @b, @c, $z) = @a; # Same thing, and also @c becomes empty\\n # and $z undefined.\\n\",\n \"language\": \"Perl\"\n },\n {\n \"code\": \"use strict;\\nour $fruit; # declare a variable as global\\nour $veg = \\\"carrot\\\"; # declare a global variable and define its value\\n\",\n \"language\": \"Perl\"\n },\n {\n \"code\": \"$fruit=\\\"apple\\\"; # this will be global by default\\n\\nsub dofruit {\\n print \\\"My global fruit was $fruit,\\\"; # use the global variable\\n my $fruit=\\\"banana\\\"; # declare a new local variable\\n print \\\"and the local fruit is $fruit.\\\\n\\\";\\n}\\n\\ndofruit;\\nprint \\\"The global fruit is still $fruit\\\";\\n\",\n \"language\": \"Perl\"\n },\n {\n \"code\": \"-->\\n <span style=\\\"color: #004080;\\\">integer</span> <span style=\\\"color: #000000;\\\">x</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">25</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">y</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">25</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">z</span>\\n <span style=\\\"color: #004080;\\\">object</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: #0000FF;\\\">{{},</span> <span style=\\\"color: #000000;\\\">5</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #008000;\\\">\\\"string\\\"</span><span style=\\\"color: #0000FF;\\\">}</span>\\n<!--\\n\",\n \"language\": \"Phix\"\n },\n {\n \"code\": \"-->\\n <span style=\\\"color: #008080;\\\">type</span> <span style=\\\"color: #000000;\\\">hour</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #004080;\\\">integer</span> <span style=\\\"color: #000000;\\\">x</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #008080;\\\">return</span> <span style=\\\"color: #000000;\\\">x</span> <span style=\\\"color: #0000FF;\\\">>=</span> <span style=\\\"color: #000000;\\\">0</span> <span style=\\\"color: #008080;\\\">and</span> <span style=\\\"color: #000000;\\\">x</span> <span style=\\\"color: #0000FF;\\\"><=</span> <span style=\\\"color: #000000;\\\">23</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">type</span>\\n <span style=\\\"color: #000000;\\\">hour</span> <span style=\\\"color: #000000;\\\">h1</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">h2</span>\\n <span style=\\\"color: #000000;\\\">h1</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">10</span> <span style=\\\"color: #000080;font-style:italic;\\\">-- ok</span>\\n <span style=\\\"color: #000000;\\\">h2</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">25</span> <span style=\\\"color: #000080;font-style:italic;\\\">-- error! program aborts with a message</span>\\n<!--\\n\",\n \"language\": \"Phix\"\n },\n {\n \"code\": \"<?php\\n/**\\n * @author Elad Yosifon\\n */\\n\\n\\n/*\\n * PHP is a weak typed language,\\n * no separation between variable declaration, initialization and assignment.\\n *\\n * variable type is defined by the value that is assigned to it.\\n * a variable name must start with a \\\"$\\\" sign (called \\\"sigil\\\", not a dollar sign).\\n * variable naming rules:\\n * + case-sensitive.\\n * + first character after $ must not be a number.\\n * + after the first character all alphanumeric chars and _(underscore) sign is allowed, e.g. $i_am_a_new_var_with_the_number_0\\n *\\n */\\n\\n# NULL typed variable\\n$null = NULL;\\t\\t\\t\\tvar_dump($null);\\t// output: null\\n\\n# defining a boolean\\n$boolean = true;\\t\\t\\tvar_dump($boolean);\\t// output: boolean true\\n$boolean = false;\\t\\t\\tvar_dump($boolean);\\t// output: boolean false\\n\\n/*\\n * casting is made using (TYPE) as a prefix\\n */\\n# bool and boolean is the same\\n$boolean = (bool)1;\\t\\t\\tvar_dump($boolean);\\t// output: boolean true\\n$boolean = (boolean)1;\\t\\t\\tvar_dump($boolean);\\t// output: boolean true\\n\\n$boolean = (bool)0;\\t\\t\\tvar_dump($boolean);\\t// output: boolean false\\n$boolean = (boolean)0;\\t\\t\\tvar_dump($boolean);\\t// output: boolean false\\n\\n# defining an integer\\n$int = 0;\\t\\t\\t\\tvar_dump($int);\\t\\t// output: int 0\\n\\n# defining a float,\\n$float = 0.01;\\t\\t\\t\\tvar_dump($float);\\t// output: float 0.01\\n\\n# which is also identical to \\\"real\\\" and \\\"double\\\"\\nvar_dump((double)$float);\\t\\t\\t\\t\\t// output: float 0.01\\nvar_dump((real)$float);\\t\\t\\t\\t\\t\\t// output: float 0.01\\n\\n# casting back to int (auto flooring the value)\\nvar_dump((int)$float);\\t\\t\\t\\t\\t\\t// output: int 0\\nvar_dump((int)($float+1));\\t\\t\\t\\t\\t// output: int 1\\nvar_dump((int)($float+1.9));\\t\\t\\t\\t\\t// output: int 1\\n\\n# defining a string\\n$string = 'string';\\nvar_dump($string);\\t\\t\\t\\t\\t\\t// output: string 'string' (length=6)\\n\\n# referencing a variable (there are no pointers in PHP).\\n$another_string = &$string;\\nvar_dump($another_string);\\n\\t\\t\\t\\t\\t\\t\\t\\t// output: string 'string' (length=6)\\n\\n$string = \\\"I'm the same string!\\\";\\nvar_dump($another_string);\\n\\t\\t\\t\\t\\t\\t\\t\\t// output: string 'I'm the same string!' (length=20)\\n# \\\"deleting\\\" a variable from memory\\nunset($another_string);\\n\\n$string = 'string';\\n/*\\n * a string can also be defined with double-quotes, HEREDOC and NOWDOC operators.\\n * content inside double-quotes is being parsed before assignment.\\n * concatenation operator is .=\\n */\\n$parsed_string = \\\"This is a $string\\\";\\nvar_dump($parsed_string);\\n\\t\\t\\t\\t\\t\\t\\t\\t// output: string 'This is a string' (length=16)\\n$parsed_string .= \\\" with another {$string}\\\";\\nvar_dump($parsed_string);\\n\\t\\t\\t\\t\\t\\t\\t\\t// output: string 'This is a string with another string' (length=36)\\n\\n# with string parsing\\n$heredoc = <<<HEREDOC\\nThis is the content of \\\\$string: {$string}\\nHEREDOC;\\nvar_dump($heredoc);\\n\\t\\t\\t\\t\\t\\t\\t\\t// output: string 'This is the content of $string: string' (length=38)\\n\\n# without string parsing (notice the single quotes surrounding NOWDOC)\\n$nowdoc = <<<'NOWDOC'\\nThis is the content of \\\\$string: {$string}\\nNOWDOC;\\nvar_dump($nowdoc);\\n\\t\\t\\t\\t\\t\\t\\t\\t// output: string 'This is the content of \\\\$string: {$string}' (length=42)\\n\\n# as of PHP5, defining an object typed stdClass => standard class\\n$stdObject = new stdClass();\\tvar_dump($stdObject);\\n\\t\\t\\t\\t\\t\\t\\t\\t// output: object(stdClass)[1]\\n# defining an object typed Foo\\nclass Foo {}\\n$foo = new Foo();\\t\\tvar_dump($foo);\\n\\t\\t\\t\\t\\t\\t\\t\\t// output: object(Foo)[2]\\n# defining an empty array\\n$array = array();\\t\\tvar_dump($array);\\n\\t\\t\\t\\t\\t\\t\\t\\t// output: array {empty}\\n\\n/*\\n * an array with non-integer key is also considered as an associative array(i.e. hash table)\\n * can contain mixed variable types, can contain integer based keys and non-integer keys\\n */\\n$assoc = array(\\n\\t0 => $int,\\n\\t'integer' => $int,\\n\\t1 => $float,\\n\\t'float' => $float,\\n\\t2 => $string,\\n\\t'string' => $string,\\n\\t3 => NULL, // <=== key 3 is NULL\\n\\t3, // <=== this is a value, not a key (key is 4)\\n\\t5 => $stdObject,\\n\\t'Foo' => $foo,\\n);\\nvar_dump($assoc);\\n\\n// output:\\n// =======\\n//\\tarray\\n//\\t 0 => int 0\\n//\\t 'integer' => int 0\\n//\\t 1 => float 0.01\\n//\\t 'float' => float 0.01\\n//\\t 2 => string 'string' (length=6)\\n//\\t 'string' => string 'string' (length=6)\\n//\\t 3 => null\\n//\\t 4 => int 3\\n//\\t 5 =>\\n//\\t \\tobject(stdClass)[1]\\n//\\t 'Foo' =>\\n//\\t\\t object(Foo)[2]\\n\\n\\n\\n/*\\n * all variables are \\\"global\\\" but not reachable inside functions(unless specifically \\\"globalized\\\" inside)\\n */\\n\\nfunction a_function()\\n{\\n\\t# not reachable\\n\\tvar_dump(isset($foo));\\t\\t\\t\\t// output: boolean false\\n\\n\\tglobal $foo;\\n\\t# \\\"global\\\" (reachable) inside a_function()'s scope\\n\\tvar_dump(isset($foo));\\t\\t\\t\\t// output: boolean true\\n}\\n\\na_function();\\n\\n/**\\n * there is another special type of variable called (Resource).\\n * for more info regarding Resources:\\n * @url http://php.net/manual/en/language.types.resource.php\\n * @url http://php.net/manual/en/resource.php\\n */\\n\",\n \"language\": \"PHP\"\n },\n {\n \"code\": \"(use (A B C)\\n (setq A 1 B 2 C 3)\\n ... )\\n\",\n \"language\": \"PicoLisp\"\n },\n {\n \"code\": \"(let (A 1 B 2 C 3)\\n ... )\\n\",\n \"language\": \"PicoLisp\"\n },\n {\n \"code\": \"(use A\\n (setq A ..)\\n ... )\\n\\n(let A 1\\n ...)\\n\",\n \"language\": \"PicoLisp\"\n },\n {\n \"code\": \"/* The PROCEDURE block and BEGIN block are used to delimit scopes. */\\n\\ndeclare i float; /* external, global variable, excluded from the */\\n /* local area (BEGIN block) below. */\\nbegin;\\n declare (i, j) fixed binary; /* local variable */\\n get list (i, j);\\n put list (i,j);\\nend;\\n\\n/* Examples of initialization. */\\n\\ndeclare p fixed initial (25);\\ndeclare q(7) fixed initial (9, 3, 5, 1, 2, 8, 15);\\n /* sets all elements of array Q at run time, on block entry. */\\ndeclare r(7) fixed initial (9, 3, 5, 1, 2, 8, 15);\\n /* sets all elements of array R at compile time. */\\n\\np = 44; /* run-time assignment. */\\nq = 0; /* run-time initialization of all elements of Q to zero. */\\nq = r; /* run-time assignment of all elements of array R to */\\n /* corresponding elemets of S. */\\n\",\n \"language\": \"PL-I\"\n },\n {\n \"code\": \"var counter: I32 = 10 // mutable variable 'counter' with value 10\\nlet temp: F64 = 36.6 // immutable variable 'temp'\\nlet str: String // immutable variable 'str' with no initial value\\nstr = \\\"i am a string\\\" // variables must be initialized before use\\nlet another_str = \\\"i am another string\\\" // type of variable 'another_str' infered from assigned value\\n\\nlet b = true\\nlet b' = false // variable names can contain ' to make a distinct variable with almost the same name\\n\",\n \"language\": \"Pony\"\n },\n {\n \"code\": \"var x: I32 = 10\\nvar y: I32 = x = 20\\ntry\\n Fact(x == 20) // x gets the new value of 20\\n Fact(y == 10) // y gets the old value of x which is 10\\nend\\n\",\n \"language\": \"Pony\"\n },\n {\n \"code\": \"$s = \\\"abc\\\"\\n$i = 123\\n\",\n \"language\": \"PowerShell\"\n },\n {\n \"code\": \"4 + $foo # yields 4\\n\\\"abc\\\" + $foo + \\\"def\\\" # yields \\\"abcdef\\\"\\n\",\n \"language\": \"PowerShell\"\n },\n {\n \"code\": \"Get-ChildItem Variable:\\n\",\n \"language\": \"PowerShell\"\n },\n {\n \"code\": \"Remove-Item Variable:foo\\n\",\n \"language\": \"PowerShell\"\n },\n {\n \"code\": \"Get-Variable # retrieves the value of a variable\\nNew-Variable # creates a new variable\\nSet-Variable # sets the value of a variable\\nClear-Variable # deletes the value of a variable, but not the variable itself\\nRemove-Variable # deletes a variable completely\\n\",\n \"language\": \"PowerShell\"\n },\n {\n \"code\": \"mortal(X) :- man(X).\\nman(socrates).\\n\",\n \"language\": \"Prolog\"\n },\n {\n \"code\": \"student(X,Y) :- taught(Y,X).\\ntaught(socrates,plato).\\n\",\n \"language\": \"Prolog\"\n },\n {\n \"code\": \"?- mortal(socrates).\\nyes\\n?- student(X,socrates).\\nX=plato\\n?- student(socrates,X).\\nno\\n\",\n \"language\": \"Prolog\"\n },\n {\n \"code\": \"?- mortal(zeus).\\nno\\n\",\n \"language\": \"Prolog\"\n },\n {\n \"code\": \"mortal(X) :- man(Y).\\n\",\n \"language\": \"Prolog\"\n },\n {\n \"code\": \"; Variables are initialized when they appear in sourcecode with default value of 0 and type int\\nDebug a\\n; or value \\\"\\\" for a string, they are not case sensitive\\nDebug b$\\n; This initializes a double precision float, if type is following the dot\\nDebug c.d\\n; They can be initialized with define (double precision float, string, integer)\\nDefine d.d = 3.5, e$ = \\\"Test\\\", f.i = a + 2\\n; Define can have a default type (all bytes except j which is long):\\nDefine.b g, h, j.l\\n; Define without following variables sets default type. In this case to single precision float\\nDefine.f\\n; So this will be an single precision float and no integer\\nDebug k\\n; EnableExplicit forces declaration of used variables with define\\nEnableExplicit\\n; Will throw an error because L isn't initialized\\nDebug L\\nDisableExplicit\\n; Global Variables are available in Procedures and Threads too\\nGlobal M = 3, N = 2\\nProcedure Dummy(parameter1, parameter2 = 20)\\n ; Parameter contain values which where used when calling the function,\\n ; their types have to be specified in the above Procedure header.\\n ; The last ones can have default values which get applied if this parameter is not given.\\n\\n ; Variables in Procedures are separate from those outside,\\n ; so d can be initialized again with another type\\n ; which would otherwise lead to an error\\n d.i\\n ; Protected makes a variable local even if another one with same name is declared as global (see above)\\n Protected M = 2\\n ; Shares a variable with main program like it was declared by global\\n Shared a\\n ; prevents a variable to be initialized with default value again when procedure is called a second time,\\n ; could be used for example as a counter, which contains the number of times a function was called\\n Static a\\n ; N here also would have a value of 2, while for example\\n ; f would, when named, initialize a new variable, and so have a value of 0\\nEndProcedure\\n; finally there are constants which are prefixed by an #:\\n#Test = 1\\n; Their value cannot be changed while program is running\\n#String_Constant = \\\"blubb\\\"\\n; In constrast to variables, a constant has no types except an (optional) $ sign to mark it as string constant\\n#Float_Constant = 2.3\\n; Maps, LinkedLists , Arrays and Structures are not handled here, because they are no elemental variables\\n\",\n \"language\": \"PureBasic\"\n },\n {\n \"code\": \"# these examples, respectively, refer to integer, float, boolean, and string objects\\nexample1 = 3\\nexample2 = 3.0\\nexample3 = True\\nexample4 = \\\"hello\\\"\\n\\n# example1 now refers to a string object.\\nexample1 = \\\"goodbye\\\"\\n\",\n \"language\": \"Python\"\n },\n {\n \"code\": \"foo <- 3.4\\nbar = \\\"abc\\\"\\n\",\n \"language\": \"R\"\n },\n {\n \"code\": \"baz <- quux <- 1:10\\nTRUE -> quuux\\n\",\n \"language\": \"R\"\n },\n {\n \"code\": \"a <- 3\\n\\nassignmentdemo <- function()\\n{\\n message(\\\"assign 'a' locally, i.e. within the scope of the function\\\")\\n a <- 5\\n message(paste(\\\"inside assignmentdemo, a = \\\", a))\\n message(paste(\\\"in the global environment, a = \\\", get(\\\"a\\\", envir=globalenv())))\\n\\n message(\\\"assign 'a' globally\\\")\\n a <<- 7\\n message(paste(\\\"inside assignmentdemo, a = \\\", a))\\n message(paste(\\\"in the global environment, a = \\\", get(\\\"a\\\", envir=globalenv())))\\n}\\nassignmentdemo()\\n\",\n \"language\": \"R\"\n },\n {\n \"code\": \"assign(\\\"b\\\", TRUE) #equivalent to b <- TRUE\\nassign(\\\"c\\\", runif(10), envir=globalenv()) #equivalent to c <<- runif(10)\\n\",\n \"language\": \"R\"\n },\n {\n \"code\": \"#lang racket\\n\\n;; define a variable and initialize it\\n(define foo 0)\\n;; increment it\\n(set! foo (add1 foo))\\n\\n;; Racket is lexically scoped, which makes local variables work:\\n(define (bar)\\n (define foo 100)\\n (set! foo (add1 foo))\\n foo)\\n(bar) ; -> 101\\n\\n;; and it also makes it possible to have variables with a global value\\n;; that are accessible only in a specific local lexical scope:\\n(define baz\\n (let () ; used to create a new scope\\n (define foo 0)\\n (define (bar)\\n (set! foo (add1 foo))\\n foo)\\n bar)) ; this is the value that gets bound to `baz'\\n(list (baz) (baz) (baz)) ; -> '(1 2 3)\\n\\n;; define a new type, and initialize a variable with an instance\\n(struct pos (x y))\\n(define p (pos 1 2))\\n(list (pos-x p) (pos-y p)) ; -> '(1 2)\\n\\n;; for a mutable reference, a struct (or some specific fields in a\\n;; struct) can be declared mutable\\n(struct mpos (x y) #:mutable)\\n(define mp (mpos 1 2))\\n(set-mpos-x! mp 11)\\n(set-mpos-y! mp 22)\\n(list (mpos-x mp) (mpos-y mp)) ; -> '(11 22)\\n\\n;; but for just a mutable value, we have boxes as a builtin type\\n(define b (box 10))\\n(set-box! b (add1 (unbox b)))\\n(unbox b) ; -> 11\\n\\n;; (Racket has many more related features: static typing in typed\\n;; racket, structs that are extensions of other structs,\\n;; pattern-matching on structs, classes, and much more)\\n\",\n \"language\": \"Racket\"\n },\n {\n \"code\": \"my @y = <A B C D>; # Array of strings 'A', 'B', 'C', and 'D'\\nsay @y[2]; # the @-sigil requires the container to implement the role Positional\\n@y[1,2] = 'x','y'; # that's where subscripts and many other things come from\\nsay @y; # OUTPUT«[A x y D]» # we start to count at 0 btw.\\n\\nmy $x = @y; # $x is now a reference for the array @y\\n\\nsay $x[1]; # prints 'x' followed by a newline character\\n\\nmy Int $with-type-check; # type checks are enforced by the compiler\\n\\nmy Int:D $defined-i = 10; # definedness can also be asked for and default values are required in that case\\n\\nmy Int:D $after-midnight where * > 24 = 25; # SQL is fun and so is Raku\\n\\nmy \\\\bad = 'good'; # if you don't like sigils\\nsay bad; # you don't have to use them\\nsay \\\"this is quite bad\\\"; # but then string interpolation\\nsay \\\"this is quite {bad}\\\" # becomes more wordy\\n\",\n \"language\": \"Raku\"\n },\n {\n \"code\": \"say ++$; # this is an anonymous state variable\\nsay ++$; # this is a different anonymous state variable, prefix:<++> forces it into numerical context and defaults it to 0\\nsay $+=2 for 1..10; # here we do something useful with another anonymous variable\\n\\nsub foo { $^a * $^b } # for positional arguments we often can't be bothered to declare them or to give them fancy names\\nsay foo 3, 4;\\n\",\n \"language\": \"Raku\"\n },\n {\n \"code\": \" Type Name = Exp;\\n\",\n \"language\": \"Rascal\"\n },\n {\n \"code\": \"Type Name;\\n\",\n \"language\": \"Rascal\"\n },\n {\n \"code\": \"rascal>int max = 100;\\nint: 100\\nrascal>min = 0;\\nint: 0\\n\",\n \"language\": \"Rascal\"\n },\n {\n \"code\": \"rascal>day = {<\\\"mon\\\", 1>, <\\\"tue\\\", 2>, <\\\"wed\\\",3>,\\n>>>>>>> <\\\"thu\\\", 4>, <\\\"fri\\\", 5>, <\\\"sat\\\",6>, <\\\"sun\\\",7>};\\nrel[str, int]: {\\n <\\\"thu\\\",4>,\\n <\\\"mon\\\",1>,\\n <\\\"sat\\\",6>,\\n <\\\"wed\\\",3>,\\n <\\\"tue\\\",2>,\\n <\\\"fri\\\",5>,\\n <\\\"sun\\\",7>\\n}\\n\",\n \"language\": \"Rascal\"\n },\n {\n \"code\": \"rascal>int month = 12;\\nint: 12\\nrascal>month =\\\"December\\\";\\n|stdin:///|(7,10,<1,7>,<1,17>): Expected int, but got str\\n\",\n \"language\": \"Rascal\"\n },\n {\n \"code\": \"rascal>if( 4 > 3){ x = \\\"abc\\\"; } else { x = \\\"def\\\";}\\nstr: \\\"abc\\\"\\nrascal>x;\\n|stdin:///|(0,1,<1,0>,<1,1>): Undeclared variable, function or constructor: x\\n\",\n \"language\": \"Rascal\"\n },\n {\n \"code\": \"aa = 10 /*assigns chars 10 ───► AA */\\nbb = '' /*assigns a null value ───► BB */\\ncc = 2*10 /*assigns chars 20 ───► CC */\\ndd = 'Adam' /*assigns chars Adam ───► DD */\\nee = \\\"Adam\\\" /*same as above ───► EE */\\nff = 10. /*assigns chars 10. ───► FF */\\ngg = '10.' /*same as above ───► GG */\\nhh = \\\"+10\\\" /*assigns chars +10 ───► hh */\\nii = 1e1 /*assigns chars 1e1 ───► ii */\\njj = +.1e+2 /*assigns chars .1e+2 ───► jj */\\n\",\n \"language\": \"REXX\"\n },\n {\n \"code\": \"kk = '123'x /*assigns hex 00000123 ───► KK */\\nkk = 'dead beaf'X /*assigns hex deadbeaf ───► KK */\\nll = '0000 0010'b /*assigns blank ───► LL (ASCII) */\\nmm = '0000 0100'B /*assigns blank ───► MM (EBCDIC)*/\\n\\nxxx = '11 2. 333 -5'\\nparse var xxx nn oo pp qq rr\\n /*assigns 11 ───► NN */\\n /*assigns 2. ───► OO */\\n /*assigns 333 ───► PP */\\n /*assigns ─5 ───► QQ */\\n /*assigns \\\"null\\\" ───► RR */\\n\\n /*a \\\"null\\\" is a string of length zero (0), */\\n /*and is not to be confused with a null char.*/\\n\\ncat = 'A cat is a lion in a jungle of small bushes.'\\n /*assigns a literal ───► CAT */\\n\",\n \"language\": \"REXX\"\n },\n {\n \"code\": \"call value 'CAT', \\\"When the cat's away, the mice will play.\\\"\\n /*assigns a literal ───► CAT */\\nyyy='CA'\\ncall value yyy'T', \\\"Honest as the Cat when the meat's out of reach.\\\"\\n /*assigns a literal ───► CAT */\\nyyy = 'CA'\\ncall value yyy || 'T', \\\"Honest as the Cat when the meat's out of reach.\\\"\\n /*assigns a literal ───► CAT */\\n\",\n \"language\": \"REXX\"\n },\n {\n \"code\": \"/*REXX pgm to do a \\\"bad\\\" assignment (with an unassigned REXX variable).*/\\n\\nsignal on noValue /*usually, placed at pgm start. */\\n\\nxxx=aaaaa /*tries to assign aaaaa ───► xxx */\\n\\nsay xxx 'or somesuch'\\nexit\\n\\nnoValue: /*this can be dressed up better. */\\nbadLine =sigl /*REXX line number that failed. */\\nbadSource=sourceline(badLine) /*REXX source line ··· */\\nbadVar =condition('D') /*REXX var name that's ¬ defined.*/\\nsay\\nsay '*** error! ***'\\nsay 'undefined variable' badvar \\\"at REXX line number\\\" badLine\\nsay\\nsay badSource\\nsay\\nexit 13\\n\",\n \"language\": \"REXX\"\n },\n {\n \"code\": \"/*REXX pgm shows different scopes of a variable: \\\"global\\\" and \\\"local\\\".*/\\nq = 55 ; say ' 1st q=' q /*assign a value ───► \\\"main\\\" Q.*/\\ncall sub ; say ' 2nd q=' q /*call a procedure subroutine. */\\ncall gyro ; say ' 3rd q=' q /*call a procedure with EXPOSE. */\\ncall sand ; say ' 4th q=' q /*call a subroutine or function. */\\nexit /*stick a fork in it, we're done.*/\\n/*──────────────────────────────────SUB subroutine──────────────────────*/\\nsub: procedure /*use PROCEDURE to use local vars*/\\nq = -777 ; say ' sub q=' q /*assign a value ───► \\\"local\\\" Q. */\\nreturn\\n/*──────────────────────────────────GYRO subroutine─────────────────────*/\\ngyro: procedure expose q /*use EXPOSE to use global var Q.*/\\nq = \\\"yuppers\\\" ; say 'gyro q=' q /*assign a value ───► \\\"exposed\\\" Q*/\\nreturn\\n/*──────────────────────────────────SAND subroutine─────────────────────*/\\nsand: /*all REXX variables are exposed.*/\\nq = \\\"Monty\\\" ; say 'sand q=' q /*assign a value ───► \\\"global\\\" Q*/\\nreturn\\n\",\n \"language\": \"REXX\"\n },\n {\n \"code\": \"aaa. = '───────nope.' /*assign this string as a default*/\\naaa.1=1 /*assign 1 to first element.*/\\naaa.4=4. /* \\\" 4 \\\" fourth \\\" */\\naaa.7='lucky' /* \\\" 7 \\\" seventh \\\" */\\n do j=0 to 8 /*go through a bunch of elements.*/\\n say 'aaa.'||j '=' aaa.j /*display element # and its value*/\\n end /*we could've started J at -100.*/\\n\",\n \"language\": \"REXX\"\n },\n {\n \"code\": \"radius=6.28 /*assign a value to a variable. */\\n say 'radius =' radius\\ndrop radius /*now, \\\"undefine\\\" the variable. */\\n say 'radius =' radius\\n\",\n \"language\": \"REXX\"\n },\n {\n \"code\": \"var.='something' /* sets all possible compound variables of stem var. */\\nx='3 '\\nvar.x.x.4='something else'\\nDo i=1 To 5\\n a=left(i,2)\\n Say i var.a.a.4 \\\"(tail is '\\\"a||'.'||a||'.'||'4'\\\"')\\\"\\n End\\n\",\n \"language\": \"REXX\"\n },\n {\n \"code\": \"<Variable Name> = <Value>\\n\",\n \"language\": \"Ring\"\n },\n {\n \"code\": \"x = \\\"Hello\\\" # x is a string\\nsee x + nl\\nx = 5 # x is a number (int)\\nsee x + nl\\nx = 1.2 # x is a number (double)\\nsee x + nl\\nx = [1,2,3,4] # x is a list\\nsee x # print list items\\nx = date() # x is a string contains date\\nsee x + nl\\nx = time() # x is a string contains time\\nsee x + nl\\nx = true # x is a number (logical value = 1)\\nsee x + nl\\nx = false # x is a number (logical value = 0)\\nsee x + nl\\n\",\n \"language\": \"Ring\"\n },\n {\n \"code\": \"list = [1,2,3,\\\"four\\\",\\\"five\\\"]\\nlist2 = list\\nlist = []\\nSee list # print the first list - no items to print\\nSee \\\"********\\\" + nl\\nSee list2 # print the second list - contains 5 items\\n\",\n \"language\": \"Ring\"\n },\n {\n \"code\": \"<NUMBER> + <STRING> --> <NUMBER>\\n<STRING> + <NUMBER> --> <STRING>\\n\",\n \"language\": \"Ring\"\n },\n {\n \"code\": \"x = 10 # x is a number\\ny = \\\"20\\\" # y is a string\\nsum = x + y # sum is a number (y will be converted to a number)\\nMsg = \\\"Sum = \\\" + sum # Msg is a string (sum will be converted to a string)\\nsee Msg + nl\\n\",\n \"language\": \"Ring\"\n },\n {\n \"code\": \"$a_global_var = 5\\nclass Demo\\n @@a_class_var = 6\\n A_CONSTANT = 8\\n def initialize\\n @an_instance_var = 7\\n end\\n def incr(a_local_var)\\n @an_instance_var += a_local_var\\n end\\nend\\n\",\n \"language\": \"Ruby\"\n },\n {\n \"code\": \"let var01; // The compiler will infer the type or the compiler will ask for type annotations if the type can't be inferred\\nlet var02: u32; // The compiler will check if a value is assigned to var02 before being used\\nlet var03 = 5; // The compiler will infer the type or it will fallback to i32\\nlet var04 = 5u8; // Initialization to unsigned 8 bit (u8) number 5\\nlet var05: i8 = 5; // Type annotation + Initialization\\nlet var06: u8 = 5u8; // Type annotation + Initialization\\nvar01 = var05; // This line makes the compiler infer var01 should be a signed 8 bit number (i8).\\nvar02 = 9u32; // Assigning to var02 after declaration\\n\",\n \"language\": \"Rust\"\n },\n {\n \"code\": \"let mut var07;\\nlet mut var08: f32;\\nlet mut var09 = 1.5;\\nlet mut var10 = 2.5f32;\\nlet mut var11: f32 = 5.0;\\nlet mut var12: f64 = 5.0f64;\\nvar07 = var11; // This line makes the compiler infer var07 should be a f32.\\nvar08 = 3.1416f32; // Assigning to var08 after declaration\\nvar08 = 2.7183f32; // Reassigning var08 since it can be reassigned since it is mutable.\\n\",\n \"language\": \"Rust\"\n },\n {\n \"code\": \"let _notused = 10;\\nlet mut _mutnotused = 42;\\n\",\n \"language\": \"Rust\"\n },\n {\n \"code\": \"$ include \\\"seed7_05.s7i\\\";\\n\\nvar integer: foo is 5; # foo is global\\n\\nconst proc: aFunc is func\\n local\\n var integer: bar is 10; # bar is local to aFunc\\n begin\\n writeln(\\\"foo + bar = \\\" <& foo + bar);\\n end func;\\n\\nconst proc: main is func\\n begin\\n aFunc;\\n end func;\\n\",\n \"language\": \"Seed7\"\n },\n {\n \"code\": \"set a 0 > Useless intialization - All lowercase variables have an initial value of 0\\nset b 66 > Simple variable assignment - ''b'' is now the ASCII value of 66, or the character 'B'\\n[c=0] set c 5 > Conditional variable assignment - If ''c'' is 0, then set ''c'' to 5\\nset ? 6 > A \\\"goto\\\" command; Setting the ''?'' variable defines the line of code to be executed next\\nset z 1 > This line of code will never be executed, because the previous skipped it\\nset c 10 > Line #5 skipped to here\\nset d A > Assigning a variable to another variable - ''d'' is now ASCII 65, or the character 'A'\\nset b ! > The ''!'' deals with I/O. Setting a variable to it receives an input character and assigns it to the variable\\nset ! a > Setting the exclamation point to a variable outputs that variable\\nset e (d+1) > Combiners are defined inside round brackets - () - and have an addition and a subtraction function\\nset f (e-1) > Variable ''e'' was assigned to ''d'' + 1 (65 + 1 = 66, character B), and ''f'' was assigned to ''e'' - 1 (66 - 1 = 65, character A)\\n\",\n \"language\": \"Set-lang\"\n },\n {\n \"code\": \"x = 14\\ny = 0.4E3\\nz = 3-2i\\n\",\n \"language\": \"Smart-BASIC\"\n },\n {\n \"code\": \"t$ = \\\"Name\\\"\\n\",\n \"language\": \"Smart-BASIC\"\n },\n {\n \"code\": \"n$ = \\\"\\\"\\\"This is a quoted text\\\"\\\"\\\"\\n\",\n \"language\": \"Smart-BASIC\"\n },\n {\n \"code\": \"n = 4\\na$ = \\\"6 feet\\\"\\nPRINT n * a$\\n\",\n \"language\": \"Smart-BASIC\"\n },\n {\n \"code\": \"DIM name$(100)\\n\",\n \"language\": \"Smart-BASIC\"\n },\n {\n \"code\": \"DEF MyFunction(x)\\nMyF2 = x^2\\nMyF3 = x^3\\nMyFunction = MyF2 + MyF3\\nEND DEF\\n\",\n \"language\": \"Smart-BASIC\"\n },\n {\n \"code\": \"x = MyFunction(3)\\nPRINT x; MyFunction.MyF2; MyFunction.MyF3\\n\",\n \"language\": \"Smart-BASIC\"\n },\n {\n \"code\": \"DEF num=123\\n\",\n \"language\": \"Smart-BASIC\"\n },\n {\n \"code\": \" define('foo(x,y)a,b,c') :(foo_end)\\nfoo a = 1; b = 2; c = 3\\n foo = a * ( x * x ) + b * y + c :(return)\\nfoo_end\\n\",\n \"language\": \"SNOBOL4\"\n },\n {\n \"code\": \"a += 1\\n\",\n \"language\": \"SPL\"\n },\n {\n \"code\": \"a = a+1\\n\",\n \"language\": \"SPL\"\n },\n {\n \"code\": \"a = 1\\nb,c,d = 0\\n\",\n \"language\": \"SPL\"\n },\n {\n \"code\": \"r = ~a\\na = 3\\n#.output(r)\\nr = 5\\n#.output(a)\\n\",\n \"language\": \"SPL\"\n },\n {\n \"code\": \"// variable declaration\\nvar table, chair;\\n\\n// assignment\\nvar table = 10, chair = -10;\\n\\n// multiple assignment to the same value\\ntable = chair = 0;\\n\\n// multiple assignment to an array\\n(\\nvar table, chair;\\n#table, chair = [10, -10];\\n#table ... chair = [10, -10, 2, 3]; // with ellipsis: now chair is [-10, 2, 3]\\n)\\n\\n// the letters a-z are predeclared in the interpreter for interactive programming\\na = 10; x = a - 8;\\n\\n// variables are type-neutral and mutable: reassign to different objects\\na = 10; a = [1, 2, 3]; a = nil;\\n\\n// immutable variables (only in class definitions)\\nconst z = 42;\\n\\n// lexical scope\\n// the closures g and h refer to different values of their c\\n(\\nf = {\\n\\tvar c = 0;\\n\\t{ c = c + 1 }\\n};\\ng = f.value;\\nh = f.value;\\nc = 100; // this doesn't change it.\\n)\\n\\n// dynamic scope: environments\\nf = { ~table = ~table + 1 };\\nEnvironment.use { ~table = 100; f.value }; // 101.\\nEnvironment.use { ~table = -1; f.value }; // 0.\\n\\n// there is a default environment\\n~table = 7;\\nf.value;\\n\\n// lexical scope in environments:\\n(\\nEnvironment.use {\\n\\t~table = 100;\\n\\tf = { ~table = ~table + 1 }.inEnvir;\\n};\\n)\\nf.value; // 101.\\n\\n// because objects keep reference to other objects, references are not needed:\\n// objects can take the role of variables. But there is a Ref object, that just holds a value\\n\\na = Ref([1, 2, 3]); // a reference to an array, can also be written as a quote `[1, 2, 3];\\nf = { |x| x.value = x.value.squared }; // a function that operates on a ref\\nf.(a); // `[ 1, 4, 9 ]\\n\\n// proxy objects serve as delegators in environments. This can be called line by line:\\nProxySpace.push;\\n~z // returns a NodeProxy\\n~z.play; // play a silent sound\\n~z = ~x + ~y; // make it the sum of two silent sounds\\n~x = { PinkNoise.ar(0.1) }; // … which now are noise,\\n~y = { SinOsc.ar(440, 0, 0.1) }; // and a sine tone\\n\",\n \"language\": \"SuperCollider\"\n },\n {\n \"code\": \"import Foundation\\n\\n// All variables declared outside of a struct/class/etc are global\\n\\n// Swift is a typed language\\n// Swift can infer the type of variables\\nvar str = \\\"Hello, playground\\\" // String\\nlet letStr:String = \\\"This is a constant\\\"\\n\\n// However, all variables must be initialized\\n// Intialize variable of type String to nil\\nvar str1:String! // str1 is nil\\n\\n// Assign value to str1\\nstr1 = \\\"foo bar\\\" // str1 is foo bar\\n\\n// Swift also has optional types\\n// Declare optional with type of String\\nvar optionalString = Optional<String>(\\\"foo bar\\\") // (Some \\\"foo bar\\\")\\n\\nprintln(optionalString) // Optional(\\\"foo bar\\\")\\n\\n// Optionals can also be declared with the shorthand ?\\nvar optionalString1:String? = \\\"foo bar\\\"\\n\\n// ! can be used to force unwrap but will throw a runtime error if trying to unwrap a nil value\\nprintln(optionalString1!)\\n\\noptionalString1 = nil // Is now nil\\n// println(optionalString1!) would now throw a runtime error\\n\\n// Optional chaining can be used to gracefully fail if there is a nil value\\nif let value = optionalString1?.lowercaseString {\\n // Is never executed\\n} else {\\n println(\\\"optionalString1 is nil\\\")\\n}\\n\\n// Swift also has type aliasing\\ntypealias MyNewType = String // MyNewType is an alias of String\\nvar myNewTypeString = MyNewType(\\\"foo bar\\\")\\n\\n// Swift also has special types Any and AnyObject\\n// Any can hold any type\\n// AnyObject can hold any object type\\nlet myAnyObjectString:AnyObject = \\\"foo bar\\\"\\n\\n// Downcast myAnyObjectString to String\\nif let myString = myAnyObjectString as? String {\\n println(myString) // foo bar\\n} else {\\n println(\\\"myString is not a string\\\")\\n}\\n\\n// Swift treats functions as first-class\\n// Declare a variable with a type of a function that takes no args\\n// and returns Void\\nvar myFunc:(() -> Void)\\nfunc showScopes() {\\n // Variable is scoped to function\\n let myFunctionVariable = \\\"foo bar function\\\"\\n\\n // Nested functions inherit variables declared in enclosing scope\\n func nestFunc() {\\n println(myFunctionVariable)\\n }\\n nestFunc()\\n}\\n\\nmyFunc = showScopes // myFunc is now showScopes\\nmyFunc() // foo bar function\\n\",\n \"language\": \"Swift\"\n },\n {\n \"code\": \"namespace eval foo {\\n # Define a procedure with two formal arguments; they are local variables\\n proc bar {callerVarName argumentVar} {\\n ### Associate some non-local variables with the procedure\\n global globalVar; # Variable in global namespace\\n variable namespaceVar; # Variable in local (::foo) namespace\\n # Access to variable in caller's context; may be local or global\\n upvar 1 callerVarName callerVar\\n\\n ### Reading a variable uses the same syntax in all cases\\n puts \\\"caller's var has $callerVar\\\"\\n # But global and namespace vars can be accessed by using qualified names\\n puts \\\"global var has $globalVar which is $::globalVar\\\"\\n\\n ### Writing a variable has no special syntax\\n ### but [set] is by far the most common command for writing\\n set namespaceVar $globalVar\\n incr globalVar\\n\\n ### Destroying a variable is done like this\\n unset argumentVar\\n }\\n}\\n\",\n \"language\": \"Tcl\"\n },\n {\n \"code\": \":1→A\\n\",\n \"language\": \"TI-83-BASIC\"\n },\n {\n \"code\": \"Local mynum, myfunc\\n\",\n \"language\": \"TI-89-BASIC\"\n },\n {\n \"code\": \"Define mynum = 1 © Two ways to assign a number\\n1 → mynum\\n\\nDefine myfunc(x) = (sin(x))^2 © Two ways to assign a function\\n(sin(x))^2 → myfunc(x)\\n\\nDefine myfunc(x) = Func © Multi-statement function\\n If x < 0 Then\\n Return –x\\n Else\\n Return x\\n EndIf\\nEndFunc\\n\",\n \"language\": \"TI-89-BASIC\"\n },\n {\n \"code\": \"$$ MODE TUSCRIPT,{}\\nvar1=1, var2=\\\"b\\\"\\nPRINT \\\"var1=\\\",var1\\nPRINT \\\"var2=\\\",var2\\n\\nbasket=*\\nDATA apples\\nDATA bananas\\nDATA cherry\\n\\nLOOP n,letter=\\\"a'b'c\\\",fruit=basket\\nvar=CONCAT (letter,n)\\nSET @var=VALUE(fruit)\\nPRINT var,\\\"=\\\",@var\\nENDLOOP\\n\",\n \"language\": \"TUSCRIPT\"\n },\n {\n \"code\": \"@(cases)\\nhey @a\\nhow are you\\n@(or)\\nhey @b\\nlong time no see\\n@(end)\\n\",\n \"language\": \"TXR\"\n },\n {\n \"code\": \"@(maybe)\\n@a bar\\n@(or)\\nfoo @b\\n@(end)\\n\",\n \"language\": \"TXR\"\n },\n {\n \"code\": \"#!/bin/sh\\n# The unix shell uses typeless variables\\napples=6\\n# pears=5+4 # Some shells cannot perform addition this way\\npears = `expr 5+4` # We use the external expr to perform the calculation\\nmyfavourite=\\\"raspberries\\\"\\n\",\n \"language\": \"UNIX-Shell\"\n },\n {\n \"code\": \"# variable declaration\\n#\\n# declare [type] [name]\\n# \\t-or-\\n# decl [type] [name]\\ndecl int test\\n\\n# initialization / assignment\\n#\\n# the set statement can be used to init variables and\\n# assign values to them\\nset test 10\\n\\n# datatypes\\n#\\n# ursa currently has 10 built-in types, but\\n# more may be added in the future.\\n# boolean\\n# double\\n# file\\n# function\\n# int\\n# iodevice\\n# port\\n# serverport\\n# string\\n# task\\n#\\n# also, java classes may be used as data types\\n# cygnus/x ursa\\n\\n# scope\\n#\\n# there is a global variable space, and functions\\n# have their own scope. control statements (for,\\n# if, try, while) don't have their own scope yet,\\n# but this will be implemented in the near future\\n\\n# referencing\\n#\\n# variables are referenced by their name\\ndecl port p\\nout p endl console\\n\",\n \"language\": \"Ursa\"\n },\n {\n \"code\": \"name := 'Bob'\\nage := 20\\nlarge_number := i64(9999999999)\\n\",\n \"language\": \"V-(Vlang)\"\n },\n {\n \"code\": \"mut age := 20\\nprintln(age) // 20\\nage = 21\\nprintln(age) // 21\\n\",\n \"language\": \"V-(Vlang)\"\n },\n {\n \"code\": \"mut a := 0\\nmut b := 1\\nprintln('$a, $b') // 0, 1\\na, b = b, a\\nprintln('$a, $b') // 1, 0\\n\",\n \"language\": \"V-(Vlang)\"\n },\n {\n \"code\": \"fn main() {\\n\\ta := 10\\n\\tif true {\\n\\t\\ta := 20 // error: redefinition of `a`\\n\\t}\\n\\t// warning: unused variable `a`\\n}\\n\",\n \"language\": \"V-(Vlang)\"\n },\n {\n \"code\": \"Dim variable As datatype\\nDim var1,var2,... As datatype\\n\",\n \"language\": \"Visual-Basic-.NET\"\n },\n {\n \"code\": \"Dim n1,n2 as Integer\\nDim x as Double\\nDim isRaining as Boolean\\nDim greeting as String\\n\",\n \"language\": \"Visual-Basic-.NET\"\n },\n {\n \"code\": \"Dim variable As datatype = value\\nDim var1,var2,... As datatype\\n\",\n \"language\": \"Visual-Basic-.NET\"\n },\n {\n \"code\": \"Dim wholeNumber1,wholeNumber2 as Integer = 3\\nDim realNumber as Double = 3.0\\nDim isRaining as Boolean = False\\nDim greeting as String = \\\"Hello, this is World speaking.\\\"\\nDim longArray() As Long = {0, 1, 2, 3}\\nDim twoDimensions(,) As Integer = {{0, 1, 2}, {10, 11, 12}}\\n\",\n \"language\": \"Visual-Basic-.NET\"\n },\n {\n \"code\": \"variable = expression\\n\",\n \"language\": \"Visual-Basic-.NET\"\n },\n {\n \"code\": \" v = a\\n d = b^2 - 4*a*c\\n s3 = s1 & mid(s2,3,2)\\n\",\n \"language\": \"Visual-Basic-.NET\"\n },\n {\n \"code\": \"variable <operator>= expression2\\n\",\n \"language\": \"Visual-Basic-.NET\"\n },\n {\n \"code\": \" c += a\\n c -= a\\n c *= a\\n c /= a\\n c ^= a\\n c <<= n\\n c >>= n\\n c &= a\\n\",\n \"language\": \"Visual-Basic-.NET\"\n },\n {\n \"code\": \"let example t => io.writeln io.stdout t;\\n\",\n \"language\": \"WDTE\"\n },\n {\n \"code\": \"let example t => 3 -> (@ s n => * t n);\\n\",\n \"language\": \"WDTE\"\n },\n {\n \"code\": \"let writeToFile name data =>\\n file.open name : f\\n -> str.format '{}' data\\n -> io.writeln f\\n -- io.close f\\n ;\\n\",\n \"language\": \"WDTE\"\n },\n {\n \"code\": \"let a => 3;\\nio.writeln io.stdout a;\\n\",\n \"language\": \"WDTE\"\n },\n {\n \"code\": \"var a // declares the variable 'a' with the default value of 'null'\\na = 1 // initializes 'a'\\na = \\\"a\\\" // assigns a different value to 'a'\\nvar b = 2 // declares and initializes 'b' at the same time\\nb = true // assigns a different value to 'b'\\nvar c = [3, 4] // 'c' is assigned a List which is a reference type\\nc = false // 'c' is reassigned a Bool which is a value type\\n\\nvar d = 1 // declaration at top level\\n{\\n var d = 2 // declaration within a nested scope, hides top level 'd'\\n var e = 3 // not visible outside its scope i.e this block\\n}\\nSystem.print(d) // prints the value of the top level 'd'\\nSystem.print(e) // compiler error : Variable is used but not defined\\n\",\n \"language\": \"Wren\"\n },\n {\n \"code\": \"<xsl:variable name=\\\"foo\\\" select=\\\"XPath expression\\\" />\\n<xsl:if test=\\\"$foo = 4\\\">... </xsl:if> <!-- prepend '$' to reference a variable or parameter-->\\n\",\n \"language\": \"XSLT\"\n },\n {\n \"code\": \"UserRam equ &C000\\n\\nld a,&50 ;load hexadecimal 50 into A\\nld (UserRam),a ;initialize UserRam with a value of &50\\n\\nld a,&40 ;load hexadecimal 40 into A\\nld (UserRam),a ;assign UserRam a new value of &40\\n\",\n \"language\": \"Z80-Assembly\"\n },\n {\n \"code\": \"byte &EF,&BE\\nword &BEEF\\n\",\n \"language\": \"Z80-Assembly\"\n },\n {\n \"code\": \"org &8000\\n\\nld hl,TestData ;H = &90, L = &00\\n\\nld hl,(TestData) ;H = &BE, L = &EF\\n\\n;In a real program you would need something here to stop the program counter from executing the data below as instructions.\\n;For simplicity this was left out.\\n\\norg &9000\\nTestData:\\nbyte &EF,&BE\\n\",\n \"language\": \"Z80-Assembly\"\n },\n {\n \"code\": \"var v; // global to the class that encloses this file\\nclass C{ var v } // global to class C, each instance gets a new v\\nclass C{fcn f{var v=123;}} // v can only be seen by f, initialized when C is\\nclass C{fcn init{var [const] v=5;}} // init is part of the constructor,\\n so vars are promoted yo class scope. This allows const vars to be created at\\n construction time\\nvar v=123; v=\\\"hoho\\\"; //not typed\\nclass C{var v} // C.v OK, but just v is not found\\nclass C{var[const]v=4} // C.v=3 illegal (compile or run time, depending)\\nclass C{var[mixin]v=4} // the compiler treats v as an int for type checking\\nclass C{var[proxy]v=f; fcn f{println(\\\"my name is \\\",self.fcn.name)} }\\n v acts like a property to run f so C.v is the same as C.f()\\nclass C{reg r} // C.r is compile time error\\nr:=5; // := syntax is same as \\\"reg r=5\\\", convenience\\n\",\n \"language\": \"Zkl\"\n },\n {\n \"code\": \"program: variables\\n# The concept of variables is completely alien in zoea:\\n# there is no support for variables and no way of defining or using them.\\n# Instead programs are described by giving examples of input and output values.\\n\",\n \"language\": \"Zoea\"\n }\n]","isConversational":false},"task_name":{"kind":"string","value":"Variables"}}}],"truncated":false,"partial":false},"paginationData":{"pageIndex":17,"numItemsPerPage":100,"numTotalItems":1840,"offset":1700,"length":100}},"jwt":"eyJhbGciOiJFZERTQSIsImtpZCI6IjVHZDBvd0g5MTM2eDZjc1FvbE1zcktNWUZoRVFoUm5PVVVybEpjOUhaUEEifQ.eyJyZWFkIjp0cnVlLCJwZXJtaXNzaW9ucyI6eyJyZXBvLmNvbnRlbnQucmVhZCI6dHJ1ZX0sImlhdCI6MTc4OTYzMzI5NiwianRpIjoiM2I0NTM2OGMtOGNiYy00NTA2LTliMDEtMTcwNjUyZTMxYTE1Iiwic3ViIjoiL2RhdGFzZXRzL0d1eXRyb24vUm9zZXR0YUNvZGVEYXRhU2V0MSIsImV4cCI6MTc4OTYzNjg5NiwiaXNzIjoiaHR0cHM6Ly9odWdnaW5nZmFjZS5jbyJ9.kf9e4oiwEBz6xxgfgvCrjO12X5FKXvsS95DtZKDMiFhsHnaDR4eKr_wjD-OWZzAlq5H_qypJvBM5GUwB8icnDw","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/Stirling_numbers_of_the_first_kind\n",
"language": "00-META"
},
{
"code": "Stirling numbers of the first kind, or Stirling cycle numbers, count permutations according to their number\nof cycles (counting fixed points as cycles of length one).\n\nThey... | Stirling-numbers-of-the-first-kind |
[
{
"code": "---\nfrom: http://rosettacode.org/wiki/Stirling_numbers_of_the_second_kind\n",
"language": "00-META"
},
{
"code": "Stirling numbers of the second kind, or Stirling partition numbers, are the\nnumber of ways to partition a set of n objects into k non-empty subsets. They are\nclosely relate... | Stirling-numbers-of-the-second-kind |
[
{
"code": "---\nfrom: http://rosettacode.org/wiki/Straddling_checkerboard\nnote: Encryption\n",
"language": "00-META"
},
{
"code": ";Task:\nImplement functions to encrypt and decrypt a message using the [[wp:Straddling_checkerboard|straddling checkerboard]] method. The checkerboard should take a 28 ... | Straddling-checkerboard |
[
{
"code": "---\nfrom: http://rosettacode.org/wiki/Stream_merge\n",
"language": "00-META"
},
{
"code": "; 2-stream merge\n: Read two sorted streams of items from external source (e.g. disk, or network), and write one stream of sorted items to external sink.\n: Common algorithm: keep 1 buffered item f... | Stream-merge |
[
{
"code": "---\ncategory:\n- String manipulation\n- String manipulation\nfrom: http://rosettacode.org/wiki/String_append\nnote: Basic language learning\n",
"language": "00-META"
},
{
"code": "{{basic data operation}} \n[[Category:Simple]]\n\nMost languages provide a way to concatenate two string val... | String-append |
[
{
"code": "---\nfrom: http://rosettacode.org/wiki/String_case\nnote: String manipulation\n",
"language": "00-META"
},
{
"code": ";Task:\nTake the string '''alphaBETA''' and demonstrate how to convert it to:\n:::* upper-case and \n:::* lower-cas... | String-case |
[
{
"code": "---\ncategory:\n- String manipulation\n- String manipulation\nfrom: http://rosettacode.org/wiki/String_concatenation\n",
"language": "00-META"
},
{
"code": "{{basic data operation}}\n[[Category:Simple]]\n\n{{task|Basic language learning}}\n\n;Task:\nCreate a string variable equal to any t... | String-concatenation |
[
{
"code": "---\ncategory:\n- String manipulation\n- Simple\n- Strings\nfrom: http://rosettacode.org/wiki/String_interpolation_(included)\nnote: Basic language learning\n",
"language": "00-META"
},
{
"code": "{{basic data operation}}\n{{omit from|NSIS}}\n{{omit from|BBC BASIC}}\n\nGiven a string and ... | String-interpolation-included- |
[
{
"code": "---\ncategory:\n- String manipulation\nfrom: http://rosettacode.org/wiki/String_length\nnote: Basic language learning\n",
"language": "00-META"
},
{
"code": ";Task:\nFind the <em>character</em> and <em>byte</em> length of a string.\n \nThis means encodings like [[UTF-8]] need to be handle... | String-length |
[
{
"code": "---\nfrom: http://rosettacode.org/wiki/String_prepend\nnote: Basic language learning\n",
"language": "00-META"
},
{
"code": "{{basic data operation}}\n[[Category:String manipulation]] \n[[Category: String manipulation]] \n[[Category:Simple]] \n{{omit from|bc|No string operations in bc}}\n... | String-prepend |
[
{
"code": "---\ncategory:\n- Strings\nfrom: http://rosettacode.org/wiki/Strip_a_set_of_characters_from_a_string\nnote: String manipulation\n",
"language": "00-META"
},
{
"code": ";Task:\nCreate a function that strips a set of characters from a string. \n\n\nThe function should take two arguments: \n... | Strip-a-set-of-characters-from-a-string |
[
{
"code": "---\ncategory:\n- String manipulation\n- Strings\nfrom: http://rosettacode.org/wiki/Strip_block_comments\nnote: Text processing\n",
"language": "00-META"
},
{
"code": "A block comment begins with a ''beginning delimiter'' and ends with a ''ending delimiter'', i... | Strip-block-comments |
[
{
"code": "---\nfrom: http://rosettacode.org/wiki/Strip_control_codes_and_extended_characters_from_a_string\n",
"language": "00-META"
},
{
"code": ";Task:\nStrip control codes and extended characters from a string. \n\n\nThe solution should demonstrate how to achieve each of the following results:\n... | Strip-control-codes-and-extended-characters-from-a-string |
[
{
"code": "---\nfrom: http://rosettacode.org/wiki/Strip_whitespace_from_a_string/Top_and_tail\nnote: String manipulation\n",
"language": "00-META"
},
{
"code": ";Task:\nDemonstrate how to strip leading and trailing whitespace from a string. \n\nThe solution should demonstrate how to achieve the foll... | Strip-whitespace-from-a-string-Top-and-tail |
[
{
"code": "---\nfrom: http://rosettacode.org/wiki/Strong_and_weak_primes\nnote: Prime Numbers\n",
"language": "00-META"
},
{
"code": ";Definitions (as per number theory):\n::* The '''prime(''p'')''' is the ''' ''p''<sup>th</sup> prime.\n:::::* '''prim... | Strong-and-weak-primes |
[
{
"code": "---\ncategory:\n- String manipulation\nfrom: http://rosettacode.org/wiki/Substitution_cipher\nnote: Encryption\n",
"language": "00-META"
},
{
"code": "Substitution Cipher Implementation - File Encryption/Decryption\n\n\n;Task:\nEncrypt an input/source file by replacing every upper/lower c... | Substitution-cipher |
[
{
"code": "---\nfrom: http://rosettacode.org/wiki/Substring\nnote: Basic language learning\n",
"language": "00-META"
},
{
"code": "{{basic data operation}} \n[[Category:String manipulation]]\n[[Category:Simple]]\n[[Category:Strings]]\n\n\n;Task:\nDisplay a substring:\n:* starting from ... | Substring |
[
{
"code": "---\ncategory:\n- String manipulation\nfrom: http://rosettacode.org/wiki/Substring/Top_and_tail\n",
"language": "00-META"
},
{
"code": "The task is to demonstrate how to remove the first and last characters from a string. \n\nThe solution should demonstrate how to obtain the following res... | Substring-Top-and-tail |
[
{
"code": "---\nfrom: http://rosettacode.org/wiki/Successive_prime_differences\nnote: Prime Numbers\n",
"language": "00-META"
},
{
"code": "The series of increasing prime numbers begins: <code>2, 3, 5, 7, 11, 13, 17, 19, 23, 29, ...</code>\n\nThe task applies a filter to the series returning groups ... | Successive-prime-differences |
[
{
"code": "---\ncategory:\n- Memoization\n- Classic CS problems and programs\nfrom: http://rosettacode.org/wiki/Sudan_function\nnote: Recursion\n",
"language": "00-META"
},
{
"code": "The '''[[wp:Sudan function|Sudan function]]''' is a classic example of a recursive function, notable especially beca... | Sudan-function |
[
{
"code": "---\nfrom: http://rosettacode.org/wiki/Sudoku\nnote: Games\n",
"language": "00-META"
},
{
"code": ";Task:\nSolve a partially filled-in normal 9x9 [[wp:Sudoku|Sudoku]] grid and display the result in a human-readable format. \n\n;references:\n* [[wp:Algorithmics_of_sudo... | Sudoku |
[
{
"code": "---\ncategory:\n- Iteration\nfrom: http://rosettacode.org/wiki/Sum_and_product_of_an_array\nnote: Arithmetic operations\n",
"language": "00-META"
},
{
"code": ";Task:\nCompute the sum and product of an array of integers.\n<br><br>\n\n",
"language": "00-TASK"
},
{
"code": "V ar... | Sum-and-product-of-an-array |
[
{
"code": "---\nfrom: http://rosettacode.org/wiki/Sum_and_product_puzzle\n",
"language": "00-META"
},
{
"code": ";Task:\nSolve the \"<i>Impossible Puzzle</i>\":\n\n{{quote|\nX and Y are two different whole numbers greater than 1. Their sum is no greater than 100, and Y is greater than X. S and P are... | Sum-and-product-puzzle |
[
{
"code": "---\nfrom: http://rosettacode.org/wiki/Sum_digits_of_an_integer\n",
"language": "00-META"
},
{
"code": ";Task:\nTake a [[wp:Natural_number|Natural Number]] in a given base and return the sum of its digits:\n:* '''1'''<sub>10</sub> ... | Sum-digits-of-an-integer |
[
{
"code": "---\nfrom: http://rosettacode.org/wiki/Sum_of_a_series\nnote: Arithmetic operations\n",
"language": "00-META"
},
{
"code": "Compute the '''n'''<sup>th</sup> term of a [[wp:Series (mathematics)|series]], i.e. the sum of the '''n''' first terms of the cor... | Sum-of-a-series |
[
{
"code": "---\nfrom: http://rosettacode.org/wiki/Sum_of_elements_below_main_diagonal_of_matrix\n",
"language": "00-META"
},
{
"code": ";Task:\nFind and display the sum of elements that are below the main diagonal of a matrix.\n\nThe matrix should be a square matrix.\n\n\n::: ─── Matrix to be... | Sum-of-elements-below-main-diagonal-of-matrix |
[
{
"code": "---\nfrom: http://rosettacode.org/wiki/Sum_of_squares\nnote: Arithmetic operations\n",
"language": "00-META"
},
{
"code": ";Task:\nWrite a program to find the sum of squares of a numeric vector. \n\nThe program should work on a zero-length vector (with an answer of '''0''').\n\n\n;... | Sum-of-squares |
[
{
"code": "---\nfrom: http://rosettacode.org/wiki/Summarize_and_say_sequence\n",
"language": "00-META"
},
{
"code": "There are several ways to generate a self-referential sequence. One very common one (the [[Look-and-say sequence]]) is to start with a positive integer, then generate the next term by... | Summarize-and-say-sequence |
[
{
"code": "---\nfrom: http://rosettacode.org/wiki/Summarize_primes\n",
"language": "00-META"
},
{
"code": ";Task:\n\nConsidering in order of length, n, all sequences of consecutive\nprimes, p, from 2 onwards, where p < 1000 and n>0, select those\nsequences whose sum is prime, and for these display t... | Summarize-primes |
[
{
"code": "---\nfrom: http://rosettacode.org/wiki/Super-d_numbers\n",
"language": "00-META"
},
{
"code": "A super-d number is a positive, decimal (base ten) integer '''n''' such that '''d × n<sup>d</sup>''' has at least '''d''' consecutive digits '''d... | Super-d-numbers |
[
{
"code": "---\nfrom: http://rosettacode.org/wiki/Superpermutation_minimisation\n",
"language": "00-META"
},
{
"code": "A superpermutation of N different characters is a string consisting of an arrangement of multiple copies of those N different characters in which every permutation of those charact... | Superpermutation-minimisation |
[
{
"code": "---\nfrom: http://rosettacode.org/wiki/Sutherland-Hodgman_polygon_clipping\nnote: Graphics algorithms\n",
"language": "00-META"
},
{
"code": "The [[wp:Sutherland-Hodgman clipping algorithm|Sutherland-Hodgman clipping algorithm]] finds the polygon that is the intersection bet... | Sutherland-Hodgman-polygon-clipping |
[
{
"code": "---\nfrom: http://rosettacode.org/wiki/Sylvester's_sequence\n",
"language": "00-META"
},
{
"code": "In number theory, '''Sylvester's sequence''' is an integer sequence in which each term of the sequence is the product of the previous terms, plus one.\n\nIts values grow doubly exponential... | Sylvesters-sequence |
[
{
"code": "---\nfrom: http://rosettacode.org/wiki/Synchronous_concurrency\nnote: Concurrency\nrequires:\n- Concurrency\n",
"language": "00-META"
},
{
"code": "The goal of this task is to create two concurrent activities (\"[[Thread|Threads]]\" or \"Tasks\", not [[Process|processes]].) that share dat... | Synchronous-concurrency |
[
{
"code": "---\ncategory:\n- Date and time\n- Simple\nfrom: http://rosettacode.org/wiki/System_time\nnote: Programming environment operations\n",
"language": "00-META"
},
{
"code": ";Task:\nOutput the system '''time''' (any units will do as long as they are noted) either by a [[Execute a Syst... | System-time |
[
{
"code": "---\nfrom: http://rosettacode.org/wiki/Table_creation/Postal_addresses\nnote: Database operations\n",
"language": "00-META"
},
{
"code": ";Task:\nCreate a table to store addresses. \n\nYou may assume that all the addresses to be stored will be located in the USA. As such, you will ... | Table-creation-Postal-addresses |
[
{
"code": "---\ncategory:\n- Algorithm\nfrom: http://rosettacode.org/wiki/Tarjan\n",
"language": "00-META"
},
{
"code": "Tarjan's algorithm is an algorithm in graph theory for finding the strongly connected components of a graph. \n\nIt runs in linear time, matching the time bound for alternative me... | Tarjan |
[
{
"code": "---\ncategory:\n- Mathematics\nfrom: http://rosettacode.org/wiki/Tau_function\n",
"language": "00-META"
},
{
"code": "Given a positive integer, count the number of its positive divisors.\n\n\n;Task\nShow the result for the first '''100''' positive integers.\n\n\n;Related tas... | Tau-function |
[
{
"code": "---\ncategory:\n- Mathematics\nfrom: http://rosettacode.org/wiki/Tau_number\nnote: Prime Numbers\n",
"language": "00-META"
},
{
"code": "A [[wp:Refactorable_number|Tau number]] is a positive integer divisible by the count of its positive divisors.\n\n\n;Task\nShow the first '''100'... | Tau-number |
[
{
"code": "---\nfrom: http://rosettacode.org/wiki/Teacup_rim_text\n",
"language": "00-META"
},
{
"code": "On a set of coasters we have, there's a picture of a teacup. On the rim of the teacup the word '''TEA''' appears a number of times separated by bullet characters (&bu... | Teacup-rim-text |
[
{
"code": "---\nfrom: http://rosettacode.org/wiki/Temperature_conversion\n",
"language": "00-META"
},
{
"code": "There are quite a number of temperature scales. For this task we will concentrate on four of the perhaps best-known ones: \n[[wp:Kelvin|Kelvin]], [[wp:Degree Celsius|Celsius]], [[wp:Fahre... | Temperature-conversion |
[
{
"code": "---\ncategory:\n- Initialization\nfrom: http://rosettacode.org/wiki/Terminal_control/Clear_the_screen\nnote: Terminal control\n",
"language": "00-META"
},
{
"code": ";Task:\nClear the terminal window.\n<br><br>\n\n",
"language": "00-TASK"
},
{
"code": "os:(‘clear’)\n",
"la... | Terminal-control-Clear-the-screen |
[
{
"code": "---\nfrom: http://rosettacode.org/wiki/Terminal_control/Cursor_movement\nnote: Terminal control\n",
"language": "00-META"
},
{
"code": ";Task:\nDemonstrate how to achieve movement of the terminal cursor:\n:* how to move the cursor one position to the left\n:* how to move the cursor one po... | Terminal-control-Cursor-movement |
[
{
"code": "---\nfrom: http://rosettacode.org/wiki/Terminal_control/Cursor_positioning\nnote: Terminal control\n",
"language": "00-META"
},
{
"code": "[[Terminal Control::task| ]]\n\n;Task:\nMove the cursor to column '''3''', row '''6''', and display the word \"Hell... | Terminal-control-Cursor-positioning |
[
{
"code": "---\ncategory:\n- Initialization\nfrom: http://rosettacode.org/wiki/Terminal_control/Dimensions\nnote: Terminal control\n",
"language": "00-META"
},
{
"code": "Determine the height and width of the terminal, and store this information into variables for subsequent use.\n[[Terminal Control... | Terminal-control-Dimensions |
[
{
"code": "---\ncategory:\n- Terminal control\nfrom: http://rosettacode.org/wiki/Terminal_control/Hiding_the_cursor\nnote: Terminal control\n",
"language": "00-META"
},
{
"code": "The task is to hide the cursor and show it again.\n<br><br>\n\n",
"language": "00-TASK"
},
{
"code": "PROC W... | Terminal-control-Hiding-the-cursor |
[
{
"code": "---\ncategory:\n- Terminal control\nfrom: http://rosettacode.org/wiki/Terminal_control/Inverse_video\nnote: Terminal control\n",
"language": "00-META"
},
{
"code": ";Task:\nDisplay a word in inverse video (or reverse video) followed by a word in normal video.\n<br><br>\n\n",... | Terminal-control-Inverse-video |
[
{
"code": "---\nfrom: http://rosettacode.org/wiki/Terminal_control/Positional_read\nnote: Terminal control\n",
"language": "00-META"
},
{
"code": "[[Terminal Control::task| ]]\nDetermine the character displayed on the screen at column 3, row 6 and store that character in a variable. Note that it is ... | Terminal-control-Positional-read |
[
{
"code": "---\nfrom: http://rosettacode.org/wiki/Terminal_control/Ringing_the_terminal_bell\nnote: Terminal control\n",
"language": "00-META"
},
{
"code": "[[Terminal Control::task| ]]\n\n;Task:\nMake the terminal running the program ring its \"bell\". \n\n\nOn modern terminal emulators, this may b... | Terminal-control-Ringing-the-terminal-bell |
[
{
"code": "---\ncategory:\n- Terminal control\n- Unicode\nfrom: http://rosettacode.org/wiki/Terminal_control/Unicode_output\n",
"language": "00-META"
},
{
"code": "The task is to check that the terminal supports Unicode output, before outputting a Unicode character. If the terminal supports Unicode,... | Terminal-control-Unicode-output |
[
{
"code": "---\nfrom: http://rosettacode.org/wiki/Ternary_logic\nnote: Logic\n",
"language": "00-META"
},
{
"code": "<br>\nIn [[wp:logic|logic]], a '''three-valued logic''' (also '''trivalent''', '''ternary''', or '''trinary logic''', sometimes abbreviated '''3VL''') is any of several [[wp:many-val... | Ternary-logic |
[
{
"code": "---\nfrom: http://rosettacode.org/wiki/Test_integerness\n",
"language": "00-META"
},
{
"code": "Mathematically,\n* the [[wp:Integer|integers]] '''Z''' are included in the [[wp:Rational number|rational numbers]] '''Q''',\n* which are included in the [[wp:Real number|real numbers]] '''R''',... | Test-integerness |
[
{
"code": "---\nfrom: http://rosettacode.org/wiki/Text_processing/1\nnote: Text processing\n",
"language": "00-META"
},
{
"code": "{{Template:clarify task}}\nOften data is produced by one program, in the wrong format for later use by another program or person. In these situations another program can... | Text-processing-1 |
[
{
"code": "---\nfrom: http://rosettacode.org/wiki/Text_processing/2\nnote: Text processing\n",
"language": "00-META"
},
{
"code": "The following task concerns data that came from a pollution monitoring station with twenty-four instruments monitoring twenty-four aspects of pollution in the air. Perio... | Text-processing-2 |
[
{
"code": "---\nfrom: http://rosettacode.org/wiki/Textonyms\n",
"language": "00-META"
},
{
"code": "When entering text on a phone's digital pad it is possible that a particular combination of digits corresponds to more than one word. Such are called textonyms.\n\nAssuming the digit keys are mapped t... | Textonyms |
[
{
"code": "---\nfrom: http://rosettacode.org/wiki/The_Name_Game\n",
"language": "00-META"
},
{
"code": "Write a program that accepts a name as input and outputs the lyrics to the Shirley Ellis song \"The Name Game\".\n\n\nThe regular verse\n\nUnless your name begins with a vowel (A, E, I, O, U), 'B'... | The-Name-Game |
[
{
"code": "---\nfrom: http://rosettacode.org/wiki/The_sieve_of_Sundaram\nnote: Prime Numbers\n",
"language": "00-META"
},
{
"code": "The sieve of Eratosthenes: you've been there; done that; have the T-shirt. The sieve of Eratosthenes was ancient history when Euclid was a schoolboy. You are ready for... | The-sieve-of-Sundaram |
[
{
"code": "---\nfrom: http://rosettacode.org/wiki/Thiele's_interpolation_formula\nnote: Arithmetic operations\n",
"language": "00-META"
},
{
"code": "<br>\n'''[[wp:Thiele's_interpolation_formula|Thiele's interpolation formula]]''' is an interpolation formula for a function ''f''(•) of a single varia... | Thieles-interpolation-formula |
[
{
"code": "---\nfrom: http://rosettacode.org/wiki/Thue-Morse\n",
"language": "00-META"
},
{
"code": ";Task:\nCreate a [http://en.wikipedia.org/wiki/Thue%E2%80%93Morse_sequence Thue-Morse sequence].\n\n\n;See also\n* YouTube entry: [https://www.youtube.com/watch?v=prh72BLNjIk The Fairest Shari... | Thue-Morse |
[
{
"code": "---\ncategory:\n- Games\nfrom: http://rosettacode.org/wiki/Tic-tac-toe\nnote: Games\n",
"language": "00-META"
},
{
"code": ";Task:\nPlay a game of [[wp:Tic-tac-toe|tic-tac-toe]]. \n\nEnsure that legal moves are played and that a winning position is notified.\n\n\n''Tic-tac-toe'' is... | Tic-tac-toe |
[
{
"code": "---\ncategory:\n- Simple\nfrom: http://rosettacode.org/wiki/Tokenize_a_string\nnote: String manipulation\n",
"language": "00-META"
},
{
"code": "Separate the string \"Hello,How,Are,You,Today\" by commas into an array (or list) so that each element of it stores a different word. \n\nDispla... | Tokenize-a-string |
[
{
"code": "---\nfrom: http://rosettacode.org/wiki/Tokenize_a_string_with_escaping\nnote: String manipulation\n",
"language": "00-META"
},
{
"code": "{{task heading}}\nWrite a function or program that can split a string at each non-escaped occurrence of a separator character.\n\nIt should accept thre... | Tokenize-a-string-with-escaping |
[
{
"code": "---\nfrom: http://rosettacode.org/wiki/Tonelli-Shanks_algorithm\n",
"language": "00-META"
},
{
"code": "In computational number theory, the [[wp:Tonelli–Shanks algorithm|Tonelli–Shanks algorithm]] is a technique for solving for '''x''' in a congruence of the form:\n<big>\n:: x<sup>2</sup>... | Tonelli-Shanks-algorithm |
[
{
"code": "---\nfrom: http://rosettacode.org/wiki/Topic_variable\n",
"language": "00-META"
},
{
"code": "Several programming languages offer syntax shortcuts to deal with the notion of \"current\" or \"topic\" variable.\n\nA topic variable is a [[Special variables|special variable]] with a very shor... | Topic-variable |
[
{
"code": "---\ncategory:\n- Sorting\nfrom: http://rosettacode.org/wiki/Topological_sort\nnote: Sorting Algorithms\n",
"language": "00-META"
},
{
"code": "{{Sorting Algorithm}}\n\n\nGiven a mapping between items, and items they depend on, a [[wp:Topological sorting|topological sort]] orders items so... | Topological-sort |
[
{
"code": "---\nfrom: http://rosettacode.org/wiki/Topswops\n",
"language": "00-META"
},
{
"code": "Topswops is a card game created by John Conway in the 1970's.\n\n\nAssume you have a particular permutation of a set of n cards numbered 1..n on both of their faces, for exa... | Topswops |
[
{
"code": "---\nfrom: http://rosettacode.org/wiki/Totient_function\nnote: Prime Numbers\n",
"language": "00-META"
},
{
"code": "The '''totient''' function is also known as:\n::* Euler's totient function\n::* Euler's phi totient function\n::* phi totient function\n:... | Totient-function |
[
{
"code": "---\ncategory:\n- Recursion\n- Games\nfrom: http://rosettacode.org/wiki/Towers_of_Hanoi\nnote: Classic CS problems and programs\n",
"language": "00-META"
},
{
"code": ";Task:\nSolve the [[wp:Towers_of_Hanoi|Towers of Hanoi]] problem with recursion.\n<br><br>\n\n",
"langu... | Towers-of-Hanoi |
[
{
"code": "---\nfrom: http://rosettacode.org/wiki/Trabb_Pardo–Knuth_algorithm\n",
"language": "00-META"
},
{
"code": "The TPK algorithm is an early example of a programming chrestomathy. \nIt was used in Donald Knuth and Luis Trabb Pardo's Stanford tech report [http://bitsavers.org/pdf/stanford/cs_t... | Trabb-Pardo-Knuth-algorithm |
[
{
"code": "---\nfrom: http://rosettacode.org/wiki/Tree_datastructures\n",
"language": "00-META"
},
{
"code": "The following shows a tree of data with nesting denoted by visual levels of indentation:\n<pre>RosettaCode\n rocks\n code\n comparison\n wiki\n mocks\n trol... | Tree-datastructures |
[
{
"code": "---\nfrom: http://rosettacode.org/wiki/Tree_from_nesting_levels\n",
"language": "00-META"
},
{
"code": "Given a flat list of integers greater than zero, representing object nesting\nlevels, e.g. <code>[1, 2, 4]</code>,\ngenerate a tree formed from nested lists of those nesting level integ... | Tree-from-nesting-levels |
[
{
"code": "---\ncategory:\n- Recursion\nfrom: http://rosettacode.org/wiki/Tree_traversal\nnote: Data Structures\n",
"language": "00-META"
},
{
"code": ";Task:\nImplement a binary tree where each node carries an integer, and implement:\n:::* pre-order,\n:::* in-order, \n:::* &nbs... | Tree-traversal |
[
{
"code": "---\nfrom: http://rosettacode.org/wiki/Tropical_algebra_overloading\n",
"language": "00-META"
},
{
"code": "In algebra, a max tropical semiring (also called a max-plus algebra) is the semiring\n(ℝ ∪ -Inf, ⊕, ⊗) containing the ring of real numbers ℝ augmented by negative infinity,\nthe max... | Tropical-algebra-overloading |
[
{
"code": "---\nfrom: http://rosettacode.org/wiki/Truncatable_primes\nnote: Prime Numbers\n",
"language": "00-META"
},
{
"code": "A truncatable prime is a prime number that when you successively remove digits from one end of the prime, you are left with a new prime number.\n\n\n;Examples:\nThe numbe... | Truncatable-primes |
[
{
"code": "---\ncategory:\n- File System Operations\nfrom: http://rosettacode.org/wiki/Truncate_a_file\n",
"language": "00-META"
},
{
"code": ";Task:\nTruncate a file to a specific length. This should be implemented as a routine that takes two parameters: the filename and the required file le... | Truncate-a-file |
[
{
"code": "---\ncategory:\n- CHR\nfrom: http://rosettacode.org/wiki/Twelve_statements\nnote: Puzzles\n",
"language": "00-META"
},
{
"code": "This puzzle is borrowed from [http://math-frolic.blogspot.co.uk/2012/08/mind-wrenching.html math-frolic.blogspot].\n\n\nGiven the following twelve state... | Twelve-statements |
[
{
"code": "---\nfrom: http://rosettacode.org/wiki/Twin_primes\nnote: Prime Numbers\n",
"language": "00-META"
},
{
"code": "Twin primes are pairs of natural numbers (P<sub>1</sub> and P<sub>2</sub>) that satisfy the following:\n\n::# P<sub>1</sub> and &n... | Twin-primes |
[
{
"code": "---\nfrom: http://rosettacode.org/wiki/Two_bullet_roulette\n",
"language": "00-META"
},
{
"code": "The following is supposedly a question given to mathematics graduates seeking jobs on Wall Street:\n<blockquote>\n A revolver handgun has a revolving cylinder with six chambers for bullets.... | Two-bullet-roulette |
[
{
"code": "---\ncategory:\n- String algorithms\nfrom: http://rosettacode.org/wiki/Ukkonen’s_suffix_tree_construction\n",
"language": "00-META"
},
{
"code": "Suffix Trees are very useful in numerous string processing and computational biology problems.\n\nThe task is to create a function which implem... | Ukkonen-s-suffix-tree-construction |
[
{
"code": "---\nfrom: http://rosettacode.org/wiki/Ulam_spiral_(for_primes)\nnote: Prime Numbers\n",
"language": "00-META"
},
{
"code": "An Ulam spiral (of primes) is a method of visualizing primes when expressed in a (normally counter-clockwise) outward spiral (usually starting at <big>'''1'''</big>... | Ulam-spiral-for-primes- |
[
{
"code": "---\nfrom: http://rosettacode.org/wiki/Ultra_useful_primes\n",
"language": "00-META"
},
{
"code": "An '''ultra-useful prime''' is a member of the sequence where each <span style=\"font-size:125%;\">'''a(n)'''</span> is the smallest positive integer <span style=\"font-size:125%;\">'''k'''<... | Ultra-useful-primes |
[
{
"code": "---\nfrom: http://rosettacode.org/wiki/Undefined_values\nnote: Programming language concepts\n",
"language": "00-META"
},
{
"code": "For languages which have an explicit notion of an undefined value, identify and exercise those language's mechanisms for identifying and manipulating a vari... | Undefined-values |
[
{
"code": "---\nfrom: http://rosettacode.org/wiki/Unicode_strings\n",
"language": "00-META"
},
{
"code": "As the world gets smaller each day, internationalization becomes more and more important. For handling multiple languages, [[Unicode]] is your best friend. \n\nIt is a very capable and [h... | Unicode-strings |
[
{
"code": "---\nfrom: http://rosettacode.org/wiki/Unicode_variable_names\nnote: Unicode\n",
"language": "00-META"
},
{
"code": ";Task:\n# Describe, and give a pointer to documentation on your languages use of characters ''beyond'' those of the ASCII character set in the naming of variables.\n# Show ... | Unicode-variable-names |
[
{
"code": "---\nfrom: http://rosettacode.org/wiki/Unix/ls\n",
"language": "00-META"
},
{
"code": ";Task:\nWrite a program that will list everything in the current folder, similar to:\n:::* the Unix utility “<tt>ls</tt>” [http://man7.org/linux/man-pages/man1/ls.1.html] &nb... | Unix-ls |
[
{
"code": "---\nfrom: http://rosettacode.org/wiki/Unprimeable_numbers\nnote: Prime Numbers\n",
"language": "00-META"
},
{
"code": ";Definitions:\nAs used here, all unprimeable numbers (positive integers) are always expressed in base ten.\n\n\n───── Definition from OEIS ─────:\n<br>Unpr... | Unprimeable-numbers |
[
{
"code": "---\nfrom: http://rosettacode.org/wiki/Untouchable_numbers\nnote: Prime Numbers\n",
"language": "00-META"
},
{
"code": ";Definitions:\n:* ''Untouchable numbers'' are also known as ''nonaliquot numbers''.\n\n:* An untouchable number is a positive i... | Untouchable-numbers |
[
{
"code": "---\nfrom: http://rosettacode.org/wiki/Update_a_configuration_file\nnote: File handling\n",
"language": "00-META"
},
{
"code": "We have a configuration file as follows:\n\n # This is a configuration file in standard configuration file format\n #\n # Lines begininning with a hash or a semi... | Update-a-configuration-file |
[
{
"code": "---\ncategory:\n- String manipulation\nfrom: http://rosettacode.org/wiki/URL_decoding\n",
"language": "00-META"
},
{
"code": "This task (the reverse of [[URL encoding]] and distinct from [[URL parser]]) is to provide a function \nor mechanism to convert ... | URL-decoding |
[
{
"code": "---\ncategory:\n- String manipulation\n- Encodings\nfrom: http://rosettacode.org/wiki/URL_encoding\n",
"language": "00-META"
},
{
"code": ";Task:\nProvide a function or mechanism to convert a provided string into URL encoding representation.\n\nIn URL encoding, special characters, control... | URL-encoding |
[
{
"code": "---\nfrom: http://rosettacode.org/wiki/Use_another_language_to_call_a_function\nnote: Programming environment operations\n",
"language": "00-META"
},
{
"code": "This task is inverse to the task [[Call foreign language function]]. Consider the following [[C]] program:\n<syntaxhighlight lan... | Use-another-language-to-call-a-function |
[
{
"code": "---\ncategory:\n- GUI\n- Basic language learning\nfrom: http://rosettacode.org/wiki/User_input/Graphical\nnote: Text processing\nrequires:\n- Graphics\n",
"language": "00-META"
},
{
"code": "In this task, the goal is to input a string and the integer 75000, from [[graphical user interface... | User-input-Graphical |
[
{
"code": "---\nfrom: http://rosettacode.org/wiki/User_input/Text\nnote: Text processing\n",
"language": "00-META"
},
{
"code": "{{selection|Short Circuit|Console Program Basics}}\n[[Category:Basic language learning]]\n[[Category:Keyboard input]] \n[[Category:Simple]]\n\n;Task: \nInput a string and ... | User-input-Text |
[
{
"code": "---\nfrom: http://rosettacode.org/wiki/Validate_International_Securities_Identification_Number\n",
"language": "00-META"
},
{
"code": "An [[wp:International_Securities_Identification_Number|International Securities Identification Number]] (ISIN) is a unique international identifier for a ... | Validate-International-Securities-Identification-Number |
[
{
"code": "---\nfrom: http://rosettacode.org/wiki/Vampire_number\nnote: Mathematics\n",
"language": "00-META"
},
{
"code": "A [[wp:Vampire_number|vampire number]] is a natural decimal number with an even number of digits, that can be factored into two integers. \n\nThese two factors are calle... | Vampire-number |
[
{
"code": "---\nfrom: http://rosettacode.org/wiki/Van_der_Corput_sequence\n",
"language": "00-META"
},
{
"code": "When counting integers in binary, if you put a (binary) point to the right of the count then the column immediately to the left denotes a digit with a multiplier of <math>2^0</math>; the... | Van-der-Corput-sequence |
[
{
"code": "---\nfrom: http://rosettacode.org/wiki/Variable_declaration_reset\n",
"language": "00-META"
},
{
"code": "A decidely non-challenging task to highlight a potential difference between programming languages.\n\nUsing a straightforward longhand loop as in the JavaScript and Phix examples belo... | Variable-declaration-reset |
[
{
"code": "---\nfrom: http://rosettacode.org/wiki/Variable-length_quantity\nnote: Data Structures\n",
"language": "00-META"
},
{
"code": "Implement some operations on [[wp:Variable-length quantity|variable-length quantities]], at least including conversions from a normal number in the language to th... | Variable-length-quantity |
[
{
"code": "---\nfrom: http://rosettacode.org/wiki/Variable_size/Get\nnote: Type System\n",
"language": "00-META"
},
{
"code": "Demonstrate how to get the size of a variable.\n\nSee also: [[Host introspection]]\n\n",
"language": "00-TASK"
},
{
"code": "Int64 i\nprint(T(i).size)\nprint(Int... | Variable-size-Get |
[
{
"code": "---\ncategory:\n- Simple\nfrom: http://rosettacode.org/wiki/Variables\nnote: Basic language learning\n",
"language": "00-META"
},
{
"code": ";Task:\nDemonstrate a language's methods of:\n:::* variable declaration\n:::* initialization\n:::* assignment\n:::* data... | Variables |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.