Split (1)

train · 75.4k rows

task_url stringlengths 30 116	task_name stringlengths 2 86	task_description stringlengths 0 14.4k	language_url stringlengths 2 53	language_name stringlengths 1 52	code stringlengths 0 61.9k	instruction_seed stringlengths 27 14.4k	_source stringclasses 1 value
http://rosettacode.org/wiki/Caesar_cipher	Caesar cipher	Task Implement a Caesar cipher, both encoding and decoding. The key is an integer from 1 to 25. This cipher rotates (either towards left or right) the letters of the alphabet (A to Z). The encoding replaces each letter with the 1st to 25th next letter in the alphabet (wrapping Z to A). So key 2 encrypts "HI" to...	#Groovy	Groovy	def caesarEncode(cipherKey, text) { def builder = new StringBuilder() text.each { character -> int ch = character[0] as char switch(ch) { case 'a'..'z': ch = ((ch - 97 + cipherKey) % 26 + 97); break case 'A'..'Z': ch = ((ch - 65 + cipherKey) % 26 + 65); break } ...	Give a code snippet in #Groovy Task Implement a Caesar cipher, both encoding and decoding. The key is an integer from 1 to 25. This cipher rotates (either towards left or right) the letters of the alphabet (A to Z). The encoding replaces each letter with the 1st to 25th next letter in the alphabet (wrapping Z t...	christopher/rosetta-code
http://rosettacode.org/wiki/Update_a_configuration_file	Update a configuration file	We have a configuration file as follows: # This is a configuration file in standard configuration file format # # Lines begininning with a hash or a semicolon are ignored by the application # program. Blank lines are also ignored by the application program. # The first word on each non comment line is the configurati...	#Tcl	Tcl	package require Tcl 8.6 oo::class create Config { variable filename contents constructor fileName { set filename $fileName set contents {} try { set f [open $filename] ### Sanitize during input foreach line [split [read $f] \n] { if {[string match "#*" $line]} { lappend contents $line ...	Give a code snippet in #Tcl We have a configuration file as follows: # This is a configuration file in standard configuration file format # # Lines begininning with a hash or a semicolon are ignored by the application # program. Blank lines are also ignored by the application program. # The first word on each non co...	christopher/rosetta-code
http://rosettacode.org/wiki/Taxicab_numbers	Taxicab numbers	A taxicab number (the definition that is being used here) is a positive integer that can be expressed as the sum of two positive cubes in more than one way. The first taxicab number is 1729, which is: 13 + 123 and also 93 + 103. Taxicab numbers are also known as: taxi numbers tax...	#PureBasic	PureBasic	#MAX=1189 Macro q3(a,b) aaa+bbb EndMacro Structure Cap x.i y.i s.i EndStructure NewList Taxi.Cap() For i=1 To #MAX For j=i To #MAX AddElement(Taxi()) : Taxi()\s=q3(i,j) : Taxi()\x=i : Taxi()\y=j Next j Next i SortStructuredList(Taxi(),#PB_Sort_Ascending,OffsetOf(Cap\s),TypeOf(Cap\s))...	Give a code snippet in #PureBasic A taxicab number (the definition that is being used here) is a positive integer that can be expressed as the sum of two positive cubes in more than one way. The first taxicab number is 1729, which is: 13 + 123 and also 93 + 103. Taxicab numbers are als...	christopher/rosetta-code
http://rosettacode.org/wiki/Self-describing_numbers	Self-describing numbers	Self-describing numbers You are encouraged to solve this task according to the task description, using any language you may know. There are several so-called "self-describing" or "self-descriptive" integers. An integer is said to be "self-describing" if it has the property that, when digit positions are labeled 0 to ...	#C.2B.2B	C++	#include <iostream> //-------------------------------------------------------------------------------------------------- typedef unsigned long long bigint; //-------------------------------------------------------------------------------------------------- using namespace std; //--------------------------------...	Give a code snippet in #C.2B.2B Self-describing numbers You are encouraged to solve this task according to the task description, using any language you may know. There are several so-called "self-describing" or "self-descriptive" integers. An integer is said to be "self-describing" if it has the property that, when ...	christopher/rosetta-code
http://rosettacode.org/wiki/Atomic_updates	Atomic updates	Task Define a data type consisting of a fixed number of 'buckets', each containing a nonnegative integer value, which supports operations to: get the current value of any bucket remove a specified amount from one specified bucket and add it to another, preserving the total of all bucket values, and clamping the t...	#Euphoria	Euphoria	function move(sequence s, integer amount, integer src, integer dest) if src < 1 or src > length(s) or dest < 1 or dest > length(s) or amount < 0 then return -1 else if src != dest and amount then if amount > s[src] then amount = s[src] end if s...	Give a code snippet in #Euphoria Task Define a data type consisting of a fixed number of 'buckets', each containing a nonnegative integer value, which supports operations to: get the current value of any bucket remove a specified amount from one specified bucket and add it to another, preserving the total of all...	christopher/rosetta-code
http://rosettacode.org/wiki/Loops/While	Loops/While	Task Start an integer value at 1024. Loop while it is greater than zero. Print the value (with a newline) and divide it by two each time through the loop. Related tasks Loop over multiple arrays simultaneously Loops/Break Loops/Continue Loops/Do-while Loops/Downward for Loops/For Loops/For...	#Panda	Panda	fun half(a) type integer->integer a.divide(2) 1024.trans(func:half).gt(0) nl	Give a code snippet in #Panda Task Start an integer value at 1024. Loop while it is greater than zero. Print the value (with a newline) and divide it by two each time through the loop. Related tasks Loop over multiple arrays simultaneously Loops/Break Loops/Continue Loops/Do-while Loops/Downwar...	christopher/rosetta-code
http://rosettacode.org/wiki/Additive_primes	Additive primes	Definitions In mathematics, additive primes are prime numbers for which the sum of their decimal digits are also primes. Task Write a program to determine (and show here) all additive primes less than 500. Optionally, show the number of additive primes. Also see the OEIS entry: A046704 additive primes. ...	#PicoLisp	PicoLisp	(de prime? (N) (let D 0 (or (= N 2) (and (> N 1) (bit? 1 N) (for (D 3 T (+ D 2)) (T (> D (sqrt N)) T) (T (=0 (% N D)) NIL) ) ) ) ) ) (de additive (N) (and (prime? N) (prime? (sum format (chop N))) ) ) (let C 0 ...	Give a code snippet in #PicoLisp Definitions In mathematics, additive primes are prime numbers for which the sum of their decimal digits are also primes. Task Write a program to determine (and show here) all additive primes less than 500. Optionally, show the number of additive primes. Also see the OEIS ent...	christopher/rosetta-code
http://rosettacode.org/wiki/Substring	Substring	Basic Data Operation This is a basic data operation. It represents a fundamental action on a basic data type. You may see other such operations in the Basic Data Operations category, or: Integer Operations Arithmetic \| Comparison Boolean Operations Bitwise \| Logical String Operations Concatenation \| Interpolation \|...	#Wren	Wren	import "/str" for Str var s = "αβγδεζηθ" var n = 2 var m = 3 var kc = "δ" // known character var ks = "δε" // known string // for reference System.print("Index of characters: 01234567") System.print("Complete string: %(s)") // starting from n characters in and of m length System.print("Start %(n), length %(m)...	Give a code snippet in #Wren Basic Data Operation This is a basic data operation. It represents a fundamental action on a basic data type. You may see other such operations in the Basic Data Operations category, or: Integer Operations Arithmetic \| Comparison Boolean Operations Bitwise \| Logical String Operations C...	christopher/rosetta-code
http://rosettacode.org/wiki/Animation	Animation	Animation is integral to many parts of GUIs, including both the fancy effects when things change used in window managers, and of course games. The core of any animation system is a scheme for periodically changing the display while still remaining responsive to the user. This task demonstrates this. Task Creat...	#Delphi	Delphi	unit Main; interface uses Winapi.Windows, System.SysUtils, System.Classes, Vcl.Controls, Vcl.Forms, Vcl.StdCtrls, Vcl.ExtCtrls; type TForm1 = class(TForm) lblAniText: TLabel; tmrAniFrame: TTimer; procedure lblAniTextClick(Sender: TObject); procedure tmrAniFrameTimer(Sender: TObject); end...	Give a code snippet in #Delphi Animation is integral to many parts of GUIs, including both the fancy effects when things change used in window managers, and of course games. The core of any animation system is a scheme for periodically changing the display while still remaining responsive to the user. This task d...	christopher/rosetta-code
http://rosettacode.org/wiki/Gaussian_elimination	Gaussian elimination	Task Solve Ax=b using Gaussian elimination then backwards substitution. A being an n by n matrix. Also, x and b are n by 1 vectors. To improve accuracy, please use partial pivoting and scaling. See also the Wikipedia entry: Gaussian elimination	#Perl	Perl	use Math::Matrix; my $a = Math::Matrix->new([0,1,0], [0,0,1], [2,0,1]); my $b = Math::Matrix->new([1], [2], [4]); my $x = $a->concat($b)->solve; print $x;	Give a code snippet in #Perl Task Solve Ax=b using Gaussian elimination then backwards substitution. A being an n by n matrix. Also, x and b are n by 1 vectors. To improve accuracy, please use partial pivoting and scaling. See also the Wikipedia entry: Gaussian elimination	christopher/rosetta-code
http://rosettacode.org/wiki/Averages/Simple_moving_average	Averages/Simple moving average	Computing the simple moving average of a series of numbers. Task[edit] Create a stateful function/class/instance that takes a period and returns a routine that takes a number as argument and returns a simple moving average of its arguments so far. Description A simple moving average is a method for computing an avera...	#Erlang	Erlang	main() -> SMA3 = sma(3), SMA5 = sma(5), Ns = [1, 2, 3, 4, 5, 5, 4, 3, 2, 1], lists:foreach( fun (N) -> io:format("Added ~b, sma(3) -> ~f, sma(5) -> ~f~n",[N,next(SMA3,N),next(SMA5,N)]) end, Ns), stop(SMA3), stop(SMA5). sma(W) -> {sma,spawn(?MODULE,loop,[W,[]])}. ...	Give a code snippet in #Erlang Computing the simple moving average of a series of numbers. Task[edit] Create a stateful function/class/instance that takes a period and returns a routine that takes a number as argument and returns a simple moving average of its arguments so far. Description A simple moving average is...	christopher/rosetta-code
http://rosettacode.org/wiki/Determine_if_a_string_has_all_the_same_characters	Determine if a string has all the same characters	Task Given a character string (which may be empty, or have a length of zero characters): create a function/procedure/routine to: determine if all the characters in the string are the same indicate if or which character is different from the previous character display each string and its length (as the...	#VBA	VBA	Sub Main_SameCharacters() Dim arr, i As Integer, respons As Integer arr = Array("", " ", "2", "333", ".55", "tttTTT", "4444 444k", "111111112", " 123") For i = LBound(arr) To UBound(arr) If SameCharacters(arr(i), respons) Then Debug.Print "Analyze : [" & arr(i) & "], lenght " & Len(arr(i...	Give a code snippet in #VBA Task Given a character string (which may be empty, or have a length of zero characters): create a function/procedure/routine to: determine if all the characters in the string are the same indicate if or which character is different from the previous character display each st...	christopher/rosetta-code
http://rosettacode.org/wiki/Playing_cards	Playing cards	Task Create a data structure and the associated methods to define and manipulate a deck of playing cards. The deck should contain 52 unique cards. The methods must include the ability to: make a new deck shuffle (randomize) the deck deal from the deck print the current contents of a deck Each card mu...	#M2000_Interpreter	M2000 Interpreter	Module PlayCards { Font "Arial" ' Ensure characters exist for Suits Cls 15,0 Pen 0 Inventory Suits = "♠":=0, "♥":=4, "♦":=4, "♣":=0 'suit -> color Inventory Cards = "two":=2, "three":=3, "four":=4, "five":=5 Append Cards, "six":=6, "seven":=7, "eight":=8, "nine":=9 Append Ca...	Give a code snippet in #M2000_Interpreter Task Create a data structure and the associated methods to define and manipulate a deck of playing cards. The deck should contain 52 unique cards. The methods must include the ability to: make a new deck shuffle (randomize) the deck deal from the deck print t...	christopher/rosetta-code
http://rosettacode.org/wiki/Caesar_cipher	Caesar cipher	Task Implement a Caesar cipher, both encoding and decoding. The key is an integer from 1 to 25. This cipher rotates (either towards left or right) the letters of the alphabet (A to Z). The encoding replaces each letter with the 1st to 25th next letter in the alphabet (wrapping Z to A). So key 2 encrypts "HI" to...	#Arturo	Arturo	ia: to :integer `a` iA: to :integer `A` lowAZ: `a`..`z` uppAZ: `A`..`Z` caesar: function [s, xx][ k: (not? null? attr 'decode)? -> 26-xx -> xx result: new "" loop s 'i [ (in? i lowAZ)? -> 'result ++ to :char ia + (k + (to :integer i) - ia) % 26 [ (in? i uppAZ)? -> 'result ++ to...	Give a code snippet in #Arturo Task Implement a Caesar cipher, both encoding and decoding. The key is an integer from 1 to 25. This cipher rotates (either towards left or right) the letters of the alphabet (A to Z). The encoding replaces each letter with the 1st to 25th next letter in the alphabet (wrapping Z t...	christopher/rosetta-code
http://rosettacode.org/wiki/Box_the_compass	Box the compass	There be many a land lubber that knows naught of the pirate ways and gives direction by degree! They know not how to box the compass! Task description Create a function that takes a heading in degrees and returns the correct 32-point compass heading. Use the function to print and display a table of Index, Compass...	#Prolog	Prolog	compassangle(1, 'North',n, 0.00). compassangle(2, 'North by east', nbe, 11.25). compassangle(3, 'North-northeast', nne,22.50). compassangle(4, 'Northeast by north', nebn,33.75). compassangle(5, 'Northeast', ne,45.00). compassangle(6, 'Norteast by east', nebe,56.25). compassangle(7, 'East-northeast', ene,67.50). compa...	Give a code snippet in #Prolog There be many a land lubber that knows naught of the pirate ways and gives direction by degree! They know not how to box the compass! Task description Create a function that takes a heading in degrees and returns the correct 32-point compass heading. Use the function to print and d...	christopher/rosetta-code
http://rosettacode.org/wiki/RPG_attributes_generator	RPG attributes generator	RPG = Role Playing Game. You're running a tabletop RPG, and your players are creating characters. Each character has six core attributes: strength, dexterity, constitution, intelligence, wisdom, and charisma. One way of generating values for these attributes is to roll four, 6-sided dice (d6) and sum the three...	#Commodore_BASIC	Commodore BASIC	100 rem rpg character roller 110 rem rosetta code - commodore basic 120 dim di(3):rem dice 130 dim at(5),at$(5):rem attributes as follows: 140 at$(0)="Strength" 150 at$(1)="Dexterity" 160 at$(2)="Constitution" 170 at$(3)="Intelligence" 180 at$(4)="Wisdom" 190 at$(5)="Charisma" 200 pt=0:sa=0:rem points total and number ...	Give a code snippet in #Commodore_BASIC RPG = Role Playing Game. You're running a tabletop RPG, and your players are creating characters. Each character has six core attributes: strength, dexterity, constitution, intelligence, wisdom, and charisma. One way of generating values for these attributes is to roll ...	christopher/rosetta-code
http://rosettacode.org/wiki/Null_object	Null object	Null (or nil) is the computer science concept of an undefined or unbound object. Some languages have an explicit way to access the null object, and some don't. Some languages distinguish the null object from undefined values, and some don't. Task Show how to access null in your language by checking to see if an ob...	#Chapel	Chapel	class C { }; var c:C; // is nil writeln(if c == nil then "nil" else "something");	Give a code snippet in #Chapel Null (or nil) is the computer science concept of an undefined or unbound object. Some languages have an explicit way to access the null object, and some don't. Some languages distinguish the null object from undefined values, and some don't. Task Show how to access null in your lang...	christopher/rosetta-code
http://rosettacode.org/wiki/Langton%27s_ant	Langton's ant	Langton's ant is a cellular automaton that models an ant sitting on a plane of cells, all of which are white initially, the ant facing in one of four directions. Each cell can either be black or white. The ant moves according to the color of the cell it is currently sitting in, with the following rules: If the ce...	#Fantom	Fantom	class World { Int height Int width Bool[] state new make (Int height, Int width) { this.height = height this.width = width state = List(Bool#, height * width) (height*width).times { state.add (false) } } Bool inWorld (Int x, Int y) { x >= 0 && x < width && y >= 0 && y < height ...	Give a code snippet in #Fantom Langton's ant is a cellular automaton that models an ant sitting on a plane of cells, all of which are white initially, the ant facing in one of four directions. Each cell can either be black or white. The ant moves according to the color of the cell it is currently sitting in, with th...	christopher/rosetta-code
http://rosettacode.org/wiki/Associative_array/Creation	Associative array/Creation	Task The goal is to create an associative array (also known as a dictionary, map, or hash). Related tasks: Associative arrays/Iteration Hash from two arrays See also Array Associative array: Creation, Iteration Collections Compound data type Doubly-linked list: Definition, Element definition, Element ins...	#ARM_Assembly	ARM Assembly	/* ARM assembly Raspberry PI or android 32 bits / / program hashmap.s / / / / REMARK 1 : this program use routines in a include file see task Include a file language arm assembly for the routine affichageMess conversion10 see at end of this program the instruction include / / for con...	Give a code snippet in #ARM_Assembly Task The goal is to create an associative array (also known as a dictionary, map, or hash). Related tasks: Associative arrays/Iteration Hash from two arrays See also Array Associative array: Creation, Iteration Collections Compound data type Doubly-linked list: Defin...	christopher/rosetta-code
http://rosettacode.org/wiki/Subleq	Subleq	Subleq is an example of a One-Instruction Set Computer (OISC). It is named after its only instruction, which is SUbtract and Branch if Less than or EQual to zero. Task Your task is to create an interpreter which emulates a SUBLEQ machine. The machine's memory consists of an array of signed integers. These integers...	#Oforth	Oforth	: subleq(program) \| ip a b c newb \| program asListBuffer ->program 0 ->ip while( ip 0 >= ) [ ip 1+ dup program at ->a 1+ dup program at ->b 1+ program at ->c ip 3 + ->ip a -1 = ifTrue: [ b System.In >> nip program put continue ] b -1 = ifTrue: [ System.Out a 1+ program at <<c drop conti...	Give a code snippet in #Oforth Subleq is an example of a One-Instruction Set Computer (OISC). It is named after its only instruction, which is SUbtract and Branch if Less than or EQual to zero. Task Your task is to create an interpreter which emulates a SUBLEQ machine. The machine's memory consists of an array of s...	christopher/rosetta-code
http://rosettacode.org/wiki/The_Name_Game	The Name Game	Write a program that accepts a name as input and outputs the lyrics to the Shirley Ellis song "The Name Game". The regular verse Unless your name begins with a vowel (A, E, I, O, U), 'B', 'F' or 'M' you don't have to care about special rules. The verse for the name 'Gary' would be like this: Gary, Gary, bo-bary...	#D	D	import std.algorithm; import std.array; import std.conv; import std.stdio; import std.uni; void printVerse(string name) { auto sb = name.map!toLower.array; sb[0] = sb[0].toUpper; string x = sb.to!string; string y; switch(sb[0]) { case 'A': case 'E': case 'I': case...	Give a code snippet in #D Write a program that accepts a name as input and outputs the lyrics to the Shirley Ellis song "The Name Game". The regular verse Unless your name begins with a vowel (A, E, I, O, U), 'B', 'F' or 'M' you don't have to care about special rules. The verse for the name 'Gary' would be like th...	christopher/rosetta-code
http://rosettacode.org/wiki/Verify_distribution_uniformity/Naive	Verify distribution uniformity/Naive	This task is an adjunct to Seven-sided dice from five-sided dice. Task Create a function to check that the random integers returned from a small-integer generator function have uniform distribution. The function should take as arguments: The function (or object) producing random integers. The number of times ...	#Vlang	Vlang	import rand import rand.seed import math // "given" fn dice5() int { return rand.intn(5) or {0} + 1 } // fntion specified by task "Seven-sided dice from five-sided dice" fn dice7() int { mut i := 0 for { i = 5*dice5() + dice5() if i < 27 { break } } return (i / ...	Give a code snippet in #Vlang This task is an adjunct to Seven-sided dice from five-sided dice. Task Create a function to check that the random integers returned from a small-integer generator function have uniform distribution. The function should take as arguments: The function (or object) producing random ...	christopher/rosetta-code
http://rosettacode.org/wiki/Hello_world/Text	Hello world/Text	Hello world/Text is part of Short Circuit's Console Program Basics selection. Task Display the string Hello world! on a text console. Related tasks Hello world/Graphical Hello world/Line Printer Hello world/Newbie Hello world/Newline omission Hello world/Standard error Hello world/Web server	#Koka	Koka	fun main() { println("Hello world!") }	Give a code snippet in #Koka Hello world/Text is part of Short Circuit's Console Program Basics selection. Task Display the string Hello world! on a text console. Related tasks Hello world/Graphical Hello world/Line Printer Hello world/Newbie Hello world/Newline omission Hello world/Standard error ...	christopher/rosetta-code
http://rosettacode.org/wiki/Multiplication_tables	Multiplication tables	Task Produce a formatted 12×12 multiplication table of the kind memorized by rote when in primary (or elementary) school. Only print the top half triangle of products.	#.D0.9C.D0.9A-61.2F52	МК-61/52	П0 КИП0 КИП4 КИП5 ИП4 ИП5 * С/П ИП5 ИП0 - x=0 03 ИП4 ИП0 - x#0 22 ИП4 П5 БП 02 С/П	Give a code snippet in #.D0.9C.D0.9A-61.2F52 Task Produce a formatted 12×12 multiplication table of the kind memorized by rote when in primary (or elementary) school. Only print the top half triangle of products.	christopher/rosetta-code
http://rosettacode.org/wiki/Append_a_record_to_the_end_of_a_text_file	Append a record to the end of a text file	Many systems offer the ability to open a file for writing, such that any data written will be appended to the end of the file. Further, the file operations will always adjust the position pointer to guarantee the end of the file, even in a multitasking environment. This feature is most useful in the case of log files,...	#M2000_Interpreter	M2000 Interpreter	Module TestThis { Class passwd { account$, password$ UID, GID group GECOS { fullname$,office$,extension$,homephone$,email$ function Line$() { =format$("{0},{1} {2},{3},{4}", .fullname$,.office$,.extension$,.homephone$,.email$) } } directory$, shell$ Function Line$() { =format$("{0}:{1}:{2}:...	Give a code snippet in #M2000_Interpreter Many systems offer the ability to open a file for writing, such that any data written will be appended to the end of the file. Further, the file operations will always adjust the position pointer to guarantee the end of the file, even in a multitasking environment. This featu...	christopher/rosetta-code
http://rosettacode.org/wiki/100_doors	100 doors	There are 100 doors in a row that are all initially closed. You make 100 passes by the doors. The first time through, visit every door and toggle the door (if the door is closed, open it; if it is open, close it). The second time, only visit every 2nd door (door #2, #4, #6, ...), and toggle it. The third...	#PL.2FI	PL/I	declare door(100) bit (1) aligned; declare closed bit (1) static initial ('0'b), open bit (1) static initial ('1'b); declare (i, inc) fixed binary; door = closed; inc = 1; do until (inc >= 100); do i = inc to 100 by inc; door(i) = ^door(i); /* close door if open; open it if closed. */ end; ...	Give a code snippet in #PL.2FI There are 100 doors in a row that are all initially closed. You make 100 passes by the doors. The first time through, visit every door and toggle the door (if the door is closed, open it; if it is open, close it). The second time, only visit every 2nd door (door #2, #4, #6, ....	christopher/rosetta-code
http://rosettacode.org/wiki/Conditional_structures	Conditional structures	Control Structures These are examples of control structures. You may also be interested in: Conditional structures Exceptions Flow-control structures Loops Task List the conditional structures offered by a programming language. See Wikipedia: conditionals for descriptions. Common conditional structures include ...	#Burlesque	Burlesque	blsq ) 9 2.%{"Odd""Even"}ch "Odd"	Give a code snippet in #Burlesque Control Structures These are examples of control structures. You may also be interested in: Conditional structures Exceptions Flow-control structures Loops Task List the conditional structures offered by a programming language. See Wikipedia: conditionals for descriptions. Com...	christopher/rosetta-code
http://rosettacode.org/wiki/Tokenize_a_string	Tokenize a string	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. Display the words to the 'user', in the simplest manner possible, separated by a period. To simplify, you may display a trailing period. Other tasks related to string operations: Me...	#SNOBOL4	SNOBOL4	define('split(chs,str)i,j,t,w2') :(split_end) split t = table() sp1 str pos(0) (break(chs) \| rem) $ t<i = i + 1> + span(chs) (break(chs) \| '') . w2 = w2 :s(sp1) * t<i> = differ(str,'') str ;* Uncomment for CSnobol split = array(i) sp2 split<j = j + 1> = t<j> :s(sp2)f(return) s...	Give a code snippet in #SNOBOL4 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. Display the words to the 'user', in the simplest manner possible, separated by a period. To simplify, you may display a trailing period. Other tasks ...	christopher/rosetta-code
http://rosettacode.org/wiki/Peaceful_chess_queen_armies	Peaceful chess queen armies	In chess, a queen attacks positions from where it is, in straight lines up-down and left-right as well as on both its diagonals. It attacks only pieces not of its own colour. ⇖ ⇑ ⇗ ⇐ ⇐ ♛ ⇒ ⇒ ⇙ ⇓ ⇘ ⇙ ⇓ ⇘ ⇓ The goal of Peaceful chess queen armies is to arrange m black queens and m white queens ...	#Scheme	Scheme	;;; ;;; Solutions to the Peaceful Chess Queen Armies puzzle, in R7RS ;;; Scheme (using also SRFI-132). ;;; ;;; https://rosettacode.org/wiki/Peaceful_chess_queen_armies ;;; (cond-expand (r7rs) (chicken (import (r7rs)))) (import (scheme process-context)) (import (only (srfi 132) list-sort)) (define-record-type ...	Give a code snippet in #Scheme In chess, a queen attacks positions from where it is, in straight lines up-down and left-right as well as on both its diagonals. It attacks only pieces not of its own colour. ⇖ ⇑ ⇗ ⇐ ⇐ ♛ ⇒ ⇒ ⇙ ⇓ ⇘ ⇙ ⇓ ⇘ ⇓ The goal of Peaceful chess queen armies is to arrange m ...	christopher/rosetta-code
http://rosettacode.org/wiki/Abbreviations,_automatic	Abbreviations, automatic	The use of abbreviations (also sometimes called synonyms, nicknames, AKAs, or aliases) can be an easy way to add flexibility when specifying or using commands, sub─commands, options, etc. It would make a list of words easier to maintain (as words are added, changed, and/or deleted) if the minimum abbrevia...	#Racket	Racket	#lang racket (require racket/set) (define (abbr-length ss) (for*/first ((l (in-range 1 (string-length (argmax string-length ss)))) #:when (equal? (sequence-length (for/set ((s ss)) (substring s 0 (min l (string-length s))))) ...	Give a code snippet in #Racket The use of abbreviations (also sometimes called synonyms, nicknames, AKAs, or aliases) can be an easy way to add flexibility when specifying or using commands, sub─commands, options, etc. It would make a list of words easier to maintain (as words are added, changed, and/or de...	christopher/rosetta-code
http://rosettacode.org/wiki/Huffman_coding	Huffman coding	Huffman encoding is a way to assign binary codes to symbols that reduces the overall number of bits used to encode a typical string of those symbols. For example, if you use letters as symbols and have details of the frequency of occurrence of those letters in typical strings, then you could just encode each letter wi...	#Ursala	Ursala	#import std #import nat #import flo code_table = # takes a training dataset to a table <char: code...> -+ ^ ~&v?\~&iNC @v ~&t?\~&h ~&plrDSLrnPlrmPCAS/'01', ~&itB->h fleq-<&d; ^C\~&tt @hthPX ^V\~&lrNCC plus@bd, ^V(div@rrPlX,~&rlNVNC)^D(plus:-0.@rS,~&)+ *K2 ^/~&h float+ length+- #cast %csAL table = cod...	Give a code snippet in #Ursala Huffman encoding is a way to assign binary codes to symbols that reduces the overall number of bits used to encode a typical string of those symbols. For example, if you use letters as symbols and have details of the frequency of occurrence of those letters in typical strings, then you ...	christopher/rosetta-code
http://rosettacode.org/wiki/Erd%C3%B6s-Selfridge_categorization_of_primes	Erdös-Selfridge categorization of primes	A prime p is in category 1 if the prime factors of p+1 are 2 and or 3. p is in category 2 if all the prime factors of p+1 are in category 1. p is in category g if all the prime factors of p+1 are in categories 1 to g-1. The task is first to display the first 200 primes allocated to their category, then assign the firs...	#Factor	Factor	USING: assocs combinators formatting grouping grouping.extras io kernel math math.primes math.primes.factors math.statistics prettyprint sequences sequences.deep ; PREDICATE: >3 < integer 3 > ; GENERIC: depth ( seq -- n ) M: sequence depth 0 swap [ flatten1 [ 1 + ] dip ] to-fixed-point drop ; M: integer dep...	Give a code snippet in #Factor A prime p is in category 1 if the prime factors of p+1 are 2 and or 3. p is in category 2 if all the prime factors of p+1 are in category 1. p is in category g if all the prime factors of p+1 are in categories 1 to g-1. The task is first to display the first 200 primes allocated to thei...	christopher/rosetta-code
http://rosettacode.org/wiki/Verify_distribution_uniformity/Naive	Verify distribution uniformity/Naive	This task is an adjunct to Seven-sided dice from five-sided dice. Task Create a function to check that the random integers returned from a small-integer generator function have uniform distribution. The function should take as arguments: The function (or object) producing random integers. The number of times ...	#Ada	Ada	with Ada.Numerics.Discrete_Random, Ada.Text_IO; procedure Naive_Random is type M_1000 is mod 1000; package Rand is new Ada.Numerics.Discrete_Random(M_1000); Gen: Rand.Generator; procedure Perform(Modulus: Positive; Expected, Margin: Natural; Passed: out boolean) is Low: Natu...	Give a code snippet in #Ada This task is an adjunct to Seven-sided dice from five-sided dice. Task Create a function to check that the random integers returned from a small-integer generator function have uniform distribution. The function should take as arguments: The function (or object) producing random in...	christopher/rosetta-code
http://rosettacode.org/wiki/Conditional_structures	Conditional structures	Control Structures These are examples of control structures. You may also be interested in: Conditional structures Exceptions Flow-control structures Loops Task List the conditional structures offered by a programming language. See Wikipedia: conditionals for descriptions. Common conditional structures include ...	#Aime	Aime	if (c1) { // first condition is true... } elif (c2) { // second condition is true... } elif (c3) { // third condition is true... } else { // none was true... }	Give a code snippet in #Aime Control Structures These are examples of control structures. You may also be interested in: Conditional structures Exceptions Flow-control structures Loops Task List the conditional structures offered by a programming language. See Wikipedia: conditionals for descriptions. Common c...	christopher/rosetta-code
http://rosettacode.org/wiki/Loops/Do-while	Loops/Do-while	Start with a value at 0. Loop while value mod 6 is not equal to 0. Each time through the loop, add 1 to the value then print it. The loop must execute at least once. Related tasks Loop over multiple arrays simultaneously Loops/Break Loops/Continue Loops/Do-while Loops/Downward for Loops/For Loo...	#ARM_Assembly	ARM Assembly	/* ARM assembly Raspberry PI / / program loopdowhile.s / / Constantes / .equ STDOUT, 1 @ Linux output console .equ EXIT, 1 @ Linux syscall .equ WRITE, 4 @ Linux syscall /*******************************/ / Initialized data / /********************************/ .data sz...	Give a code snippet in #ARM_Assembly Start with a value at 0. Loop while value mod 6 is not equal to 0. Each time through the loop, add 1 to the value then print it. The loop must execute at least once. Related tasks Loop over multiple arrays simultaneously Loops/Break Loops/Continue Loops/Do-while ...	christopher/rosetta-code
http://rosettacode.org/wiki/Ethiopian_multiplication	Ethiopian multiplication	Ethiopian multiplication is a method of multiplying integers using only addition, doubling, and halving. Method: Take two numbers to be multiplied and write them down at the top of two columns. In the left-hand column repeatedly halve the last number, discarding any remainders, and write the result below the last ...	#ActionScript	ActionScript	function Divide(a:Number):Number { return ((a-(a%2))/2); } function Multiply(a:Number):Number { return (a *= 2); } function isEven(a:Number):Boolean { if (a%2 == 0) { return (true); } else { return (false); } } function Ethiopian(left:Number, right:Number) { var r:Number = 0; trace(left+" "+right); whil...	Give a code snippet in #ActionScript Ethiopian multiplication is a method of multiplying integers using only addition, doubling, and halving. Method: Take two numbers to be multiplied and write them down at the top of two columns. In the left-hand column repeatedly halve the last number, discarding any remainders...	christopher/rosetta-code
http://rosettacode.org/wiki/Middle_three_digits	Middle three digits	Task Write a function/procedure/subroutine that is called with an integer value and returns the middle three digits of the integer if possible or a clear indication of an error if this is not possible. Note: The order of the middle digits should be preserved. Your function should be tested with the following values;...	#Racket	Racket	#lang racket (define (middle x) (cond [(negative? x) (middle (- x))] [(< x 100) "error: number too small"] [else (define s (number->string x)) (define l (string-length s)) (cond [(even? l) "error: number has even length"] [else (define i (quotient l 2)) (su...	Give a code snippet in #Racket Task Write a function/procedure/subroutine that is called with an integer value and returns the middle three digits of the integer if possible or a clear indication of an error if this is not possible. Note: The order of the middle digits should be preserved. Your function should be t...	christopher/rosetta-code
http://rosettacode.org/wiki/Runtime_evaluation	Runtime evaluation	Task Demonstrate a language's ability for programs to execute code written in the language provided at runtime. Show what kind of program fragments are permitted (e.g. expressions vs. statements), and how to get values in and out (e.g. environments, arguments, return values), if applicable what lexical/static environ...	#Quackery	Quackery	10 $ "1 swap times [ i 1+ * ]" quackery echo	Give a code snippet in #Quackery Task Demonstrate a language's ability for programs to execute code written in the language provided at runtime. Show what kind of program fragments are permitted (e.g. expressions vs. statements), and how to get values in and out (e.g. environments, arguments, return values), if appl...	christopher/rosetta-code
http://rosettacode.org/wiki/Find_the_missing_permutation	Find the missing permutation	ABCD CABD ACDB DACB BCDA ACBD ADCB CDAB DABC BCAD CADB CDBA ...	#Rust	Rust	const GIVEN_PERMUTATIONS: [&str; 23] = [ "ABCD", "CABD", "ACDB", "DACB", "BCDA", "ACBD", "ADCB", "CDAB", "DABC", "BCAD", "CADB", "CDBA", "CBAD", "ABDC", "ADBC", "BDCA", "DCBA", "BACD", "BADC", "BDAC", "CBDA", "DBCA", "DCAB" ]; ...	Give a code snippet in #Rust ABCD CABD ACDB DACB BCDA ACBD ADCB CDAB DABC BCAD CADB ...	christopher/rosetta-code
http://rosettacode.org/wiki/Literals/Floating_point	Literals/Floating point	Programming languages have different ways of expressing floating-point literals. Task Show how floating-point literals can be expressed in your language: decimal or other bases, exponential notation, and any other special features. You may want to include a regular expression or BNF/ABNF/EBNF defining allowable fo...	#Ursa	Ursa	1. 1.0 2432311.7567374 1.234E-10 1.234e-10 758832d 728832f 1.0f 758832D 728832F 1.0F	Give a code snippet in #Ursa Programming languages have different ways of expressing floating-point literals. Task Show how floating-point literals can be expressed in your language: decimal or other bases, exponential notation, and any other special features. You may want to include a regular expression or BNF/A...	christopher/rosetta-code
http://rosettacode.org/wiki/Combinations	Combinations	Task Given non-negative integers m and n, generate all size m combinations of the integers from 0 (zero) to n-1 in sorted order (each combination is sorted and the entire table is sorted). Example 3 comb 5 is: 0 1 2 0 1 3 0 1 4 0 2 3 0 2 4 0 3 4 1 2 3 1 2 4 1 3 4 2 3 4 ...	#Python	Python	>>> from itertools import combinations >>> list(combinations(range(5),3)) [(0, 1, 2), (0, 1, 3), (0, 1, 4), (0, 2, 3), (0, 2, 4), (0, 3, 4), (1, 2, 3), (1, 2, 4), (1, 3, 4), (2, 3, 4)]	Give a code snippet in #Python Task Given non-negative integers m and n, generate all size m combinations of the integers from 0 (zero) to n-1 in sorted order (each combination is sorted and the entire table is sorted). Example 3 comb 5 is: 0 1 2 0 1 3 0 1 4 0 2 3 0 2 ...	christopher/rosetta-code
http://rosettacode.org/wiki/Terminal_control/Dimensions	Terminal control/Dimensions	Determine the height and width of the terminal, and store this information into variables for subsequent use.	#XPL0	XPL0	include c:\cxpl\codes; int W, H; [W:= Peek($40, $4A); \IBM-PC BIOS data H:= Peek($40, $84) + 1; Text(0, "Terminal width and height = "); IntOut(0, W); ChOut(0, ^x); IntOut(0, H); ]	Give a code snippet in #XPL0 Determine the height and width of the terminal, and store this information into variables for subsequent use.	christopher/rosetta-code
http://rosettacode.org/wiki/Text_processing/1	Text processing/1	This task has been flagged for clarification. Code on this page in its current state may be flagged incorrect once this task has been clarified. See this page's Talk page for discussion. Often data is produced by one program, in the wrong format for later use by another program or person. In these situations another pr...	#Nim	Nim	import os, sequtils, strutils, strformat var nodata = 0 nodataMax = -1 nodataMaxLine: seq[string] totFile = 0.0 numFile = 0 for filename in commandLineParams(): for line in filename.lines: var totLine = 0.0 numLine = 0 data: seq[float] flags: seq[int] let fields = lin...	Give a code snippet in #Nim This task has been flagged for clarification. Code on this page in its current state may be flagged incorrect once this task has been clarified. See this page's Talk page for discussion. Often data is produced by one program, in the wrong format for later use by another program or person. I...	christopher/rosetta-code
http://rosettacode.org/wiki/Numerical_integration	Numerical integration	Write functions to calculate the definite integral of a function ƒ(x) using all five of the following methods: rectangular left right midpoint trapezium Simpson's composite Your functions should take in the upper and lower bounds (a and b), and the number of approximations to make in that range (n). Assume t...	#C	C	#include <stdio.h> #include <stdlib.h> #include <math.h> double int_leftrect(double from, double to, double n, double (func)()) { double h = (to-from)/n; double sum = 0.0, x; for(x=from; x <= (to-h); x += h) sum += func(x); return hsum; } double int_rightrect(double from, double to, double n, do...	Give a code snippet in #C Write functions to calculate the definite integral of a function ƒ(x) using all five of the following methods: rectangular left right midpoint trapezium Simpson's composite Your functions should take in the upper and lower bounds (a and b), and the number of approximations to make i...	christopher/rosetta-code
http://rosettacode.org/wiki/Dragon_curve	Dragon curve	Create and display a dragon curve fractal. (You may either display the curve directly or write it to an image file.) Algorithms Here are some brief notes the algorithms used and how they might suit various languages. Recursively a right curling dragon is a right dragon followed by a left dragon, at 90-degree an...	#SVG	SVG	<?xml version="1.0" standalone="yes"?> <!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 20010904//EN" "http://www.w3.org/TR/2001/REC-SVG-20010904/DTD/svg10.dtd"> <svg xmlns="http://www.w3.org/2000/svg" xmlns:l="http://www.w3.org/1999/xlink" width="400" height="400"> <style type="text/css"><![CDATA[ line { stroke...	Give a code snippet in #SVG Create and display a dragon curve fractal. (You may either display the curve directly or write it to an image file.) Algorithms Here are some brief notes the algorithms used and how they might suit various languages. Recursively a right curling dragon is a right dragon followed by a...	christopher/rosetta-code
http://rosettacode.org/wiki/Ulam_spiral_(for_primes)	Ulam spiral (for primes)	An Ulam spiral (of primes) is a method of visualizing primes when expressed in a (normally counter-clockwise) outward spiral (usually starting at 1), constructed on a square grid, starting at the "center". An Ulam spiral is also known as a prime spiral. The first grid (green) is shown with sequential integers, ...	#EchoLisp	EchoLisp	(lib 'plot) (define red (rgb 1 0 0)) (define (ulam n nmax) (if ( prime? n) red (gray (// n nmax)))) (plot-spiral ulam 1000) ;; range [0...1000]	Give a code snippet in #EchoLisp An Ulam spiral (of primes) is a method of visualizing primes when expressed in a (normally counter-clockwise) outward spiral (usually starting at 1), constructed on a square grid, starting at the "center". An Ulam spiral is also known as a prime spiral. The first grid (green) is ...	christopher/rosetta-code
http://rosettacode.org/wiki/Deepcopy	Deepcopy	Task Demonstrate how to copy data structures containing complex heterogeneous and cyclic semantics. This is often referred to as deep copying, and is normally required where structures are mutable and to ensure that independent copies can be manipulated without side-effects. If this facility is not built into the la...	#OxygenBasic	OxygenBasic	'DEEP COPY FOR A RECURSIVE TREE STRUCTURE uses console class branches ' static int count int level int a,b,c branchesbranch1 branchesbranch2 ' method constructor(int n) ========================= level=n count++ output count tab level cr if level>0 new branches n1(n-1) ...	Give a code snippet in #OxygenBasic Task Demonstrate how to copy data structures containing complex heterogeneous and cyclic semantics. This is often referred to as deep copying, and is normally required where structures are mutable and to ensure that independent copies can be manipulated without side-effects. If t...	christopher/rosetta-code
http://rosettacode.org/wiki/Polymorphic_copy	Polymorphic copy	An object is polymorphic when its specific type may vary. The types a specific value may take, is called class. It is trivial to copy an object if its type is known: int x; int y = x; Here x is not polymorphic, so y is declared of same type (int) as x. But if the specific type of x were unknown, then y could not be d...	#C.23	C#	using System; class T { public virtual string Name() { return "T"; } public virtual T Clone() { return new T(); } } class S : T { public override string Name() { return "S"; } public override T Clone() { return new S(); } } class ...	Give a code snippet in #C.23 An object is polymorphic when its specific type may vary. The types a specific value may take, is called class. It is trivial to copy an object if its type is known: int x; int y = x; Here x is not polymorphic, so y is declared of same type (int) as x. But if the specific type of x were ...	christopher/rosetta-code
http://rosettacode.org/wiki/Pointers_and_references	Pointers and references	Basic Data Operation This is a basic data operation. It represents a fundamental action on a basic data type. You may see other such operations in the Basic Data Operations category, or: Integer Operations Arithmetic \| Comparison Boolean Operations Bitwise \| Logical String Operations Concatenation \| Interpolation \|...	#OCaml	OCaml	let p = ref 1;; (* create a new "reference" data structure with initial value 1 ) let k = !p;; ( "dereference" the reference, returning the value inside ) p := k + 1;; ( set the value inside to a new value *)	Give a code snippet in #OCaml Basic Data Operation This is a basic data operation. It represents a fundamental action on a basic data type. You may see other such operations in the Basic Data Operations category, or: Integer Operations Arithmetic \| Comparison Boolean Operations Bitwise \| Logical String Operations ...	christopher/rosetta-code
http://rosettacode.org/wiki/Abbreviations,_simple	Abbreviations, simple	The use of abbreviations (also sometimes called synonyms, nicknames, AKAs, or aliases) can be an easy way to add flexibility when specifying or using commands, sub─commands, options, etc. For this task, the following command table will be used: add 1 alter 3 backup 2 bottom 1 Cappend 2 change 1 ...	#MiniScript	MiniScript	c = "add 1 alter 3 backup 2 bottom 1 Cappend 2 change 1 Schange Cinsert 2 Clast 3" + " compress 4 copy 2 count 3 Coverlay 3 cursor 3 delete 3 Cdelete 2 down 1 duplicate" + " 3 xEdit 1 expand 3 extract 3 find 1 Nfind 2 Nfindup 6 NfUP 3 Cfind 2 findUP 3 fUP 2" + " forward 2 get help 1 hexType 4 input 1 p...	Give a code snippet in #MiniScript The use of abbreviations (also sometimes called synonyms, nicknames, AKAs, or aliases) can be an easy way to add flexibility when specifying or using commands, sub─commands, options, etc. For this task, the following command table will be used: add 1 alter 3 backu...	christopher/rosetta-code
http://rosettacode.org/wiki/Loops/Infinite	Loops/Infinite	Task Print out SPAM followed by a newline in an infinite loop. Related tasks Loop over multiple arrays simultaneously Loops/Break Loops/Continue Loops/Do-while Loops/Downward for Loops/For Loops/For with a specified step Loops/Foreach Loops/Increment loop index within l...	#ArnoldC	ArnoldC	IT'S SHOWTIME STICK AROUND @NO PROBLEMO TALK TO THE HAND "SPAM" CHILL YOU HAVE BEEN TERMINATED	Give a code snippet in #ArnoldC Task Print out SPAM followed by a newline in an infinite loop. Related tasks Loop over multiple arrays simultaneously Loops/Break Loops/Continue Loops/Do-while Loops/Downward for Loops/For Loops/For with a specified step Loops/Foreach Lo...	christopher/rosetta-code
http://rosettacode.org/wiki/Ackermann_function	Ackermann function	The Ackermann function is a classic example of a recursive function, notable especially because it is not a primitive recursive function. It grows very quickly in value, as does the size of its call tree. The Ackermann function is usually defined as follows: A ( m , n ) = { n + 1 if m = 0 A ( m ...	#Ezhil	Ezhil	நிரல்பாகம் அகெர்மன்(முதலெண், இரண்டாமெண்) @((முதலெண் < 0) \|\| (இரண்டாமெண் < 0)) ஆனால் பின்கொடு -1 முடி @(முதலெண் == 0) ஆனால் பின்கொடு இரண்டாமெண்+1 முடி @((முதலெண் > 0) && (இரண்டாமெண் == 00)) ஆனால் பின்கொடு அகெர்மன்(முதலெண் - 1, 1) முடி பின்கொடு அகெர்மன்(முதலெண் - 1, அகெர்மன...	Give a code snippet in #Ezhil The Ackermann function is a classic example of a recursive function, notable especially because it is not a primitive recursive function. It grows very quickly in value, as does the size of its call tree. The Ackermann function is usually defined as follows: A ( m , n ) = { ...	christopher/rosetta-code
http://rosettacode.org/wiki/Empty_program	Empty program	Task Create the simplest possible program that is still considered "correct."	#Processing	Processing		Give a code snippet in #Processing Task Create the simplest possible program that is still considered "correct."	christopher/rosetta-code
http://rosettacode.org/wiki/Stack	Stack	Data Structure This illustrates a data structure, a means of storing data within a program. You may see other such structures in the Data Structures category. A stack is a container of elements with last in, first out access policy. Sometimes it also called LIFO. The stack is accessed through its top. The ba...	#CoffeeScript	CoffeeScript	stack = [] stack.push 1 stack.push 2 console.log stack console.log stack.pop() console.log stack	Give a code snippet in #CoffeeScript Data Structure This illustrates a data structure, a means of storing data within a program. You may see other such structures in the Data Structures category. A stack is a container of elements with last in, first out access policy. Sometimes it also called LIFO. The stac...	christopher/rosetta-code
http://rosettacode.org/wiki/Rot-13	Rot-13	Task Implement a rot-13 function (or procedure, class, subroutine, or other "callable" object as appropriate to your programming environment). Optionally wrap this function in a utility program (like tr, which acts like a common UNIX utility, performing a line-by-line rot-13 encoding of every line of inpu...	#Seed7	Seed7	$ include "seed7_05.s7i"; const proc: main is func local var char: ch is ' '; begin ch := getc(IN); while not eof(IN) do if (ch >= 'a' and ch <= 'm') or (ch >= 'A' and ch <= 'M') then ch := chr(ord(ch) + 13); elsif (ch >= 'n' and ch <= 'z') or (ch >= 'N' and ch <= 'Z') then ...	Give a code snippet in #Seed7 Task Implement a rot-13 function (or procedure, class, subroutine, or other "callable" object as appropriate to your programming environment). Optionally wrap this function in a utility program (like tr, which acts like a common UNIX utility, performing a line-by-line rot-13...	christopher/rosetta-code
http://rosettacode.org/wiki/Word_wrap	Word wrap	Even today, with proportional fonts and complex layouts, there are still cases where you need to wrap text at a specified column. Basic task The basic task is to wrap a paragraph of text in a simple way in your language. If there is a way to do this that is built-in, trivial, or provided in a standard library, sho...	#XPL0	XPL0	string 0; proc WordWrap(Text, LineWidth); \Display Text string wrapped at LineWidth char Text, LineWidth, Word, SpaceLeft, WordWidth, I; [SpaceLeft:= 0; loop [loop [if Text(0) = 0 then return; \skip whitespace (like CR) if Text(0) > $20 then quit; Text:= Text+1; ...	Give a code snippet in #XPL0 Even today, with proportional fonts and complex layouts, there are still cases where you need to wrap text at a specified column. Basic task The basic task is to wrap a paragraph of text in a simple way in your language. If there is a way to do this that is built-in, trivial, or provi...	christopher/rosetta-code
http://rosettacode.org/wiki/Bitmap/Write_a_PPM_file	Bitmap/Write a PPM file	Using the data storage type defined on this page for raster images, write the image to a PPM file (binary P6 prefered). (Read the definition of PPM file on Wikipedia.)	#Nim	Nim	import bitmap import streams #--------------------------------------------------------------------------------------------------- proc writePPM*(img: Image, stream: Stream) = ## Write an image to a PPM stream. stream.writeLine("P6 ", $img.w, " ", $img.h, " 255") for x, y in img.indices: stream.write(c...	Give a code snippet in #Nim Using the data storage type defined on this page for raster images, write the image to a PPM file (binary P6 prefered). (Read the definition of PPM file on Wikipedia.)	christopher/rosetta-code
http://rosettacode.org/wiki/Ascending_primes	Ascending primes	Generate and show all primes with strictly ascending decimal digits. Aside: Try solving without peeking at existing solutions. I had a weird idea for generating a prime sieve faster, which needless to say didn't pan out. The solution may be p(r)etty trivial but generating them quickly is at least mildly interesting. T...	#Sidef	Sidef	func primes_with_ascending_digits(base = 10) { var list = [] var digits = @(1..^base -> flip) var end_digits = digits.grep { .is_coprime(base) } list << digits.grep { .is_prime && !.is_coprime(base) }... for k in (0 .. digits.end) { digits.combinations(k, {\|*a\| var v = a.di...	Give a code snippet in #Sidef Generate and show all primes with strictly ascending decimal digits. Aside: Try solving without peeking at existing solutions. I had a weird idea for generating a prime sieve faster, which needless to say didn't pan out. The solution may be p(r)etty trivial but generating them quickly is...	christopher/rosetta-code
http://rosettacode.org/wiki/Grayscale_image	Grayscale image	Many image processing algorithms are defined for grayscale (or else monochromatic) images. Task Extend the data storage type defined on this page to support grayscale images. Define two operations, one to convert a color image to a grayscale image and one for the backward conversion. To get luminance of a color u...	#Maple	Maple	with(ImageTools): #conversion forward dimensions:=[upperbound(img)]; gray := Matrix(dimensions[1], dimensions[2]); for i from 1 to dimensions[1] do for j from 1 to dimensions[2] do gray[i,j] := 0.2126 * img[i,j,1] + 0.7152img[i,j,2] + 0.0722img[i,j,3]: end do: end do: #display the result Embed(Create(gray)): #con...	Give a code snippet in #Maple Many image processing algorithms are defined for grayscale (or else monochromatic) images. Task Extend the data storage type defined on this page to support grayscale images. Define two operations, one to convert a color image to a grayscale image and one for the backward conversion....	christopher/rosetta-code
http://rosettacode.org/wiki/Variable_size/Set	Variable size/Set	Task Demonstrate how to specify the minimum size of a variable or a data type.	#FreeBASIC	FreeBASIC	package main import ( "fmt" "unsafe" ) func main() { i := 5 // default type is int r := '5' // default type is rune (which is int32) f := 5. // default type is float64 c := 5i // default type is complex128 fmt.Println("i:", unsafe.Sizeof(i), "bytes") fmt.Println("r:", unsafe.Size...	Give a code snippet in #FreeBASIC Task Demonstrate how to specify the minimum size of a variable or a data type.	christopher/rosetta-code
http://rosettacode.org/wiki/One-dimensional_cellular_automata	One-dimensional cellular automata	Assume an array of cells with an initial distribution of live and dead cells, and imaginary cells off the end of the array having fixed values. Cells in the next generation of the array are calculated based on the value of the cell and its left and right nearest neighbours in the current generation. If, in the follow...	#SequenceL	SequenceL	import <Utilities/Conversion.sl>; main(args(2)) := run(args[1], stringToInt(args[2])) when size(args) = 2 else "Usage error: exec <initialCells> <generations>"; stringToCells(string(1))[i] := 0 when string[i] = '_' else 1; cellsToString(cells(1))[i] := '#' when cells[i] = 1 else '_'; run(cellsString(1),...	Give a code snippet in #SequenceL Assume an array of cells with an initial distribution of live and dead cells, and imaginary cells off the end of the array having fixed values. Cells in the next generation of the array are calculated based on the value of the cell and its left and right nearest neighbours in the cur...	christopher/rosetta-code
http://rosettacode.org/wiki/Hash_from_two_arrays	Hash from two arrays	Task Using two Arrays of equal length, create a Hash object where the elements from one array (the keys) are linked to the elements of the other (the values) Related task Associative arrays/Creation	#AutoHotkey	AutoHotkey	array1 := ["two", "three", "apple"] array2 := [2, 3, "fruit"] hash := {} Loop % array1.maxIndex() hash[array1[A_Index]] := array2[A_Index] MsgBox % hash["apple"] "`n" hash["two"]	Give a code snippet in #AutoHotkey Task Using two Arrays of equal length, create a Hash object where the elements from one array (the keys) are linked to the elements of the other (the values) Related task Associative arrays/Creation	christopher/rosetta-code
http://rosettacode.org/wiki/Random_number_generator_(included)	Random number generator (included)	The task is to: State the type of random number generator algorithm used in a language's built-in random number generator. If the language or its immediate libraries don't provide a random number generator, skip this task. If possible, give a link to a wider explanation of the algorithm used. Note: the task is not t...	#DWScript	DWScript	!print random-int # prints a 32-bit random integer	Give a code snippet in #DWScript The task is to: State the type of random number generator algorithm used in a language's built-in random number generator. If the language or its immediate libraries don't provide a random number generator, skip this task. If possible, give a link to a wider explanation of the algor...	christopher/rosetta-code
http://rosettacode.org/wiki/Sorting_algorithms/Bubble_sort	Sorting algorithms/Bubble sort	Sorting Algorithm This is a sorting algorithm. It may be applied to a set of data in order to sort it. For comparing various sorts, see compare sorts. For other sorting algorithms, see sorting algorithms, or: O(n logn) sorts Heap sort \| Merge sort \| Patience sort \| Quick sort O(n log2n) sorts Shell Sort ...	#MMIX	MMIX	Ja IS $127 LOC Data_Segment DataSeg GREG @ Array IS @-Data_Segment OCTA 999,200,125,1,1020,40,4,5,60,100 ArrayLen IS (@-Array-Data_Segment)/8 NL IS @-Data_Segment BYTE #a,0 LOC @+(8-@)&7 Buffer IS @-Data_Segment LOC #1000 GREG @ sor...	Give a code snippet in #MMIX Sorting Algorithm This is a sorting algorithm. It may be applied to a set of data in order to sort it. For comparing various sorts, see compare sorts. For other sorting algorithms, see sorting algorithms, or: O(n logn) sorts Heap sort \| Merge sort \| Patience sort \| Quick sor...	christopher/rosetta-code
http://rosettacode.org/wiki/Zero_to_the_zero_power	Zero to the zero power	Some computer programming languages are not exactly consistent (with other computer programming languages) when raising zero to the zeroth power: 00 Task Show the results of raising zero to the zeroth power. If your computer language objects to 0**0 or 0^0 at compile time, ...	#Maple	Maple	0^0	Give a code snippet in #Maple Some computer programming languages are not exactly consistent (with other computer programming languages) when raising zero to the zeroth power: 00 Task Show the results of raising zero to the zeroth power. If your computer language objects to 0**0 or ...	christopher/rosetta-code
http://rosettacode.org/wiki/Wireworld	Wireworld	Wireworld Conway's Game of Life It is capable of doing sophisticated computations with appropriate programs (it is actually Turing complete), and is much simpler to program for. A Wireworld arena consists of a Cartesian grid of cells, each of which can be in one of four states. All cell transitions happen simultaneous...	#Ruby	Ruby	use std::str::FromStr; #[derive(Debug, Copy, Clone, PartialEq)] pub enum State { Empty, Conductor, ElectronTail, ElectronHead, } impl State { fn next(&self, e_nearby: usize) -> State { match self { State::Empty => State::Empty, State::Conductor => { ...	Give a code snippet in #Ruby Wireworld Conway's Game of Life It is capable of doing sophisticated computations with appropriate programs (it is actually Turing complete), and is much simpler to program for. A Wireworld arena consists of a Cartesian grid of cells, each of which can be in one of four states. All cell t...	christopher/rosetta-code
http://rosettacode.org/wiki/Array_length	Array length	Task Determine the amount of elements in an array. As an example use an array holding the strings 'apple' and 'orange'. Other tasks related to string operations: Metrics Array length String length Copy a string Empty string (assignment) Counting Word frequency Letter frequency Jewels and stones I befo...	#Emacs_Lisp	Emacs Lisp	(length ["apple" "orange"]) => 2	Give a code snippet in #Emacs_Lisp Task Determine the amount of elements in an array. As an example use an array holding the strings 'apple' and 'orange'. Other tasks related to string operations: Metrics Array length String length Copy a string Empty string (assignment) Counting Word frequency Letter ...	christopher/rosetta-code
http://rosettacode.org/wiki/Arithmetic/Rational	Arithmetic/Rational	Task Create a reasonably complete implementation of rational arithmetic in the particular language using the idioms of the language. Example Define a new type called frac with binary operator "//" of two integers that returns a structure made up of the numerator and the denominator (as per a rational number). Fur...	#Action.21	Action!	INCLUDE "D2:REAL.ACT" ;from the Action! Tool Kit TYPE Frac=[INT num,den] REAL half PROC PrintFrac(Frac POINTER x) PrintI(x.num) Put('/) PrintI(x.den) RETURN INT FUNC Gcd(INT a,b) INT tmp IF a<b THEN tmp=a a=b b=tmp FI WHILE b#0 DO tmp=a MOD b a=b b=tmp OD RETURN (a) PROC Ini...	Give a code snippet in #Action.21 Task Create a reasonably complete implementation of rational arithmetic in the particular language using the idioms of the language. Example Define a new type called frac with binary operator "//" of two integers that returns a structure made up of the numerator and the denominat...	christopher/rosetta-code
http://rosettacode.org/wiki/Null_object	Null object	Null (or nil) is the computer science concept of an undefined or unbound object. Some languages have an explicit way to access the null object, and some don't. Some languages distinguish the null object from undefined values, and some don't. Task Show how to access null in your language by checking to see if an ob...	#Oz	Oz	declare X in {Show X+2} %% blocks	Give a code snippet in #Oz Null (or nil) is the computer science concept of an undefined or unbound object. Some languages have an explicit way to access the null object, and some don't. Some languages distinguish the null object from undefined values, and some don't. Task Show how to access null in your language...	christopher/rosetta-code
http://rosettacode.org/wiki/Hello_world/Text	Hello world/Text	Hello world/Text is part of Short Circuit's Console Program Basics selection. Task Display the string Hello world! on a text console. Related tasks Hello world/Graphical Hello world/Line Printer Hello world/Newbie Hello world/Newline omission Hello world/Standard error Hello world/Web server	#Shen	Shen	(output "Hello world!~%")	Give a code snippet in #Shen Hello world/Text is part of Short Circuit's Console Program Basics selection. Task Display the string Hello world! on a text console. Related tasks Hello world/Graphical Hello world/Line Printer Hello world/Newbie Hello world/Newline omission Hello world/Standard error ...	christopher/rosetta-code
http://rosettacode.org/wiki/Palindrome_detection	Palindrome detection	A palindrome is a phrase which reads the same backward and forward. Task[edit] Write a function or program that checks whether a given sequence of characters (or, if you prefer, bytes) is a palindrome. For extra credit: Support Unicode characters. Write a second function (possibly as a wrapper to the first) which ...	#Jsish	Jsish	/* Palindrome detection, in Jsish */ function isPalindrome(str:string, exact:boolean=true) { if (!exact) { str = str.toLowerCase(); str = str.replace(/[ \t,;:!?.]/g, ''); } return str === str.match(/./g).reverse().join(''); } ;isPalindrome('BUB'); ;isPalindrome('CUB'); ;isPalindrome('Bub'); ;isPalin...	Give a code snippet in #Jsish A palindrome is a phrase which reads the same backward and forward. Task[edit] Write a function or program that checks whether a given sequence of characters (or, if you prefer, bytes) is a palindrome. For extra credit: Support Unicode characters. Write a second function (possibly as...	christopher/rosetta-code
http://rosettacode.org/wiki/Ackermann_function	Ackermann function	The Ackermann function is a classic example of a recursive function, notable especially because it is not a primitive recursive function. It grows very quickly in value, as does the size of its call tree. The Ackermann function is usually defined as follows: A ( m , n ) = { n + 1 if m = 0 A ( m ...	#Ring	Ring	for m = 0 to 3 for n = 0 to 4 see "Ackermann(" + m + ", " + n + ") = " + Ackermann(m, n) + nl next next func Ackermann m, n if m > 0 if n > 0 return Ackermann(m - 1, Ackermann(m, n - 1)) but n = 0 return Ackermann(m - 1, 1...	Give a code snippet in #Ring The Ackermann function is a classic example of a recursive function, notable especially because it is not a primitive recursive function. It grows very quickly in value, as does the size of its call tree. The Ackermann function is usually defined as follows: A ( m , n ) = { ...	christopher/rosetta-code
http://rosettacode.org/wiki/Ethiopian_multiplication	Ethiopian multiplication	Ethiopian multiplication is a method of multiplying integers using only addition, doubling, and halving. Method: Take two numbers to be multiplied and write them down at the top of two columns. In the left-hand column repeatedly halve the last number, discarding any remainders, and write the result below the last ...	#dc	dc	0k [ Make sure we're doing integer division ]sx [ 2 / ] sH [ Define "halve" function in register H ]sx [ 2 * ] sD [ Define "double" function in register D ]sx [ 2 % 1 r - ] sE [ Define "even?" function in register E ]sx [ Entry into the main Ethiopian multiplication...	Give a code snippet in #dc Ethiopian multiplication is a method of multiplying integers using only addition, doubling, and halving. Method: Take two numbers to be multiplied and write them down at the top of two columns. In the left-hand column repeatedly halve the last number, discarding any remainders, and writ...	christopher/rosetta-code
http://rosettacode.org/wiki/Levenshtein_distance	Levenshtein distance	This page uses content from Wikipedia. The original article was at Levenshtein distance. The list of authors can be seen in the page history. As with Rosetta Code, the text of Wikipedia is available under the GNU FDL. (See links for details on variance) In information theory and computer science, the Levenshtein ...	#Turbo-Basic_XL	Turbo-Basic XL	10 DIM Word_1$(20), Word_2$(20), DLDm(21, 21) 11 CLS 20 Word_1$="kitten" : Word_2$="sitting" : ? Word_1$;" - ";Word_2$ : EXEC _DLD_ : ? 30 Word_1$="rosettacode" : Word_2$="raisethysword" : ? Word_1$;" - ";Word_2$ : EXEC _DLD_ : ? 11000 END 11600 REM DamerauLevenshteinDistance INPUT(Word_1$, Word_2$, DLDm[]) USE(I, ...	Give a code snippet in #Turbo-Basic_XL This page uses content from Wikipedia. The original article was at Levenshtein distance. The list of authors can be seen in the page history. As with Rosetta Code, the text of Wikipedia is available under the GNU FDL. (See links for details on variance) In information theor...	christopher/rosetta-code
http://rosettacode.org/wiki/Search_a_list	Search a list	Task[edit] Find the index of a string (needle) in an indexable, ordered collection of strings (haystack). Raise an exception if the needle is missing. If there is more than one occurrence then return the smallest index to the needle. Extra credit Return the largest index to a needle that has multiple occurrences in ...	#PARI.2FGP	PARI/GP	find(v,n)={ my(i=setsearch(v,n)); if(i, while(i>1, if(v[i-1]==n,i--)) , error("Could not find") ); i };	Give a code snippet in #PARI.2FGP Task[edit] Find the index of a string (needle) in an indexable, ordered collection of strings (haystack). Raise an exception if the needle is missing. If there is more than one occurrence then return the smallest index to the needle. Extra credit Return the largest index to a needl...	christopher/rosetta-code
http://rosettacode.org/wiki/Real_constants_and_functions	Real constants and functions	Task Show how to use the following math constants and functions in your language (if not available, note it): e (base of the natural logarithm) π {\displaystyle \pi } square root logarithm (any base allowed) exponential (ex ) absolute value (a.k.a. "magnitude") floor (largest ...	#Clojure	Clojure	(Math/E); //e (Math/PI); //pi (Math/sqrt x); //square root--cube root also available (cbrt) (Math/log x); //natural logarithm--log base 10 also available (log10) (Math/exp x); //exponential (Math/abs x); //absolute value (Math/floor x); //floor (Math/ceil x); //ceiling (Math/pow x y); //power	Give a code snippet in #Clojure Task Show how to use the following math constants and functions in your language (if not available, note it): e (base of the natural logarithm) π {\displaystyle \pi } square root logarithm (any base allowed) exponential (ex ) absolute value (a.k.a. ...	christopher/rosetta-code
http://rosettacode.org/wiki/Modular_inverse	Modular inverse	From Wikipedia: In modular arithmetic, the modular multiplicative inverse of an integer a modulo m is an integer x such that a x ≡ 1 ( mod m ) . {\displaystyle a\,x\equiv 1{\pmod {m}}.} Or in other words, such that: ∃ k ∈ Z , a x = 1 + k m {\displaystyle \exists k\in \math...	#Nim	Nim	proc modInv(a0, b0: int): int = var (a, b, x0) = (a0, b0, 0) result = 1 if b == 1: return while a > 1: result = result - (a div b) * x0 a = a mod b swap a, b swap x0, result if result < 0: result += b0 echo modInv(42, 2017)	Give a code snippet in #Nim From Wikipedia: In modular arithmetic, the modular multiplicative inverse of an integer a modulo m is an integer x such that a x ≡ 1 ( mod m ) . {\displaystyle a\,x\equiv 1{\pmod {m}}.} Or in other words, such that: ∃ k ∈ Z , a x = 1 + k m {\di...	christopher/rosetta-code
http://rosettacode.org/wiki/Soundex	Soundex	Soundex is an algorithm for creating indices for words based on their pronunciation. Task The goal is for homophones to be encoded to the same representation so that they can be matched despite minor differences in spelling (from the soundex Wikipedia article). Caution There is a major issue in many of the ...	#AWK	AWK	#!/usr/bin/awk -f BEGIN { subsep = ", " delete homs } /^[a-zA-Z]/ { sdx = strToSoundex($0) addHom(sdx, $0) } END { showHoms(3) } function strToSoundex(s, sdx, i, ch, cd, lch) { if (length(s) == 0) return "" s = tolower(s) lch = substr(s, 1, 1); sdx = toupper(lch) lch = c...	Give a code snippet in #AWK Soundex is an algorithm for creating indices for words based on their pronunciation. Task The goal is for homophones to be encoded to the same representation so that they can be matched despite minor differences in spelling (from the soundex Wikipedia article). Caution There is ...	christopher/rosetta-code
http://rosettacode.org/wiki/Chinese_remainder_theorem	Chinese remainder theorem	Suppose n 1 {\displaystyle n_{1}} , n 2 {\displaystyle n_{2}} , … {\displaystyle \ldots } , n k {\displaystyle n_{k}} are positive integers that are pairwise co-prime. Then, for any given sequence of integers a 1 {\displaystyle a_{1}} , a 2 ...	#R	R	mul_inv <- function(a, b) { b0 <- b x0 <- 0L x1 <- 1L if (b == 1) return(1L) while(a > 1){ q <- as.integer(a/b) t <- b b <- a %% b a <- t t <- x0 x0 <- x1 - q*x0 x1 <- t } if (x1 < 0) x1 <- x1 + b0 return(x1) } chinese_remainder <- function(n, a) { len <- length(n...	Give a code snippet in #R Suppose n 1 {\displaystyle n_{1}} , n 2 {\displaystyle n_{2}} , … {\displaystyle \ldots } , n k {\displaystyle n_{k}} are positive integers that are pairwise co-prime. Then, for any given sequence of integers a 1 {\displaystyle...	christopher/rosetta-code
http://rosettacode.org/wiki/Fibonacci_word	Fibonacci word	The Fibonacci Word may be created in a manner analogous to the Fibonacci Sequence as described here: Define F_Word1 as 1 Define F_Word2 as 0 Form F_Word3 as F_Word2 concatenated with F_Word1 i.e.: 01 Form F_Wordn as F_Wordn-1 concatenated with F_wordn-...	#Sidef	Sidef	func entropy(s) { [0] + (s.chars.freq.values »/» s.len) -> reduce { \|a,b\| a - bb.log2 } } var n_max = 37 var words = ['1', '0'] { words.append(words[-1] + words[-2]) } (n_max - words.len) say ('%3s %10s %15s %s' % <N Length Entropy Fibword>...) for i in ^words { var word = words[i] ...	Give a code snippet in #Sidef The Fibonacci Word may be created in a manner analogous to the Fibonacci Sequence as described here: Define F_Word1 as 1 Define F_Word2 as 0 Form F_Word3 as F_Word2 concatenated with F_Word1 i.e.: 01 Form F_Wordn as F_Wordn-1...	christopher/rosetta-code
http://rosettacode.org/wiki/Horner%27s_rule_for_polynomial_evaluation	Horner's rule for polynomial evaluation	A fast scheme for evaluating a polynomial such as: − 19 + 7 x − 4 x 2 + 6 x 3 {\displaystyle -19+7x-4x^{2}+6x^{3}\,} when x = 3 {\displaystyle x=3\;} . is to arrange the computation as follows: ( ( ( ( 0 ) x + 6 ) x + ( − 4 ) ) x + 7 ) x + ( − 19 ) {\displaystyle ((((0)x+6)x+(-4))x...	#GAP	GAP	# The idiomatic way to compute with polynomials x := Indeterminate(Rationals, "x"); # This is a value in a polynomial ring, not a function p := 6x^3 - 4x^2 + 7*x - 19; Value(p, 3); # 128 u := CoefficientsOfUnivariatePolynomial(p); # [ -19, 7, -4, 6 ] # One may also create the polynomial from coefficients q ...	Give a code snippet in #GAP A fast scheme for evaluating a polynomial such as: − 19 + 7 x − 4 x 2 + 6 x 3 {\displaystyle -19+7x-4x^{2}+6x^{3}\,} when x = 3 {\displaystyle x=3\;} . is to arrange the computation as follows: ( ( ( ( 0 ) x + 6 ) x + ( − 4 ) ) x + 7 ) x + ( − 19 ) {\di...	christopher/rosetta-code
http://rosettacode.org/wiki/Loops/Do-while	Loops/Do-while	Start with a value at 0. Loop while value mod 6 is not equal to 0. Each time through the loop, add 1 to the value then print it. The loop must execute at least once. Related tasks Loop over multiple arrays simultaneously Loops/Break Loops/Continue Loops/Do-while Loops/Downward for Loops/For Loo...	#PARI.2FGP	PARI/GP	x = 0; while(1, print(x++); if(x % 6 == 0, break) )	Give a code snippet in #PARI.2FGP Start with a value at 0. Loop while value mod 6 is not equal to 0. Each time through the loop, add 1 to the value then print it. The loop must execute at least once. Related tasks Loop over multiple arrays simultaneously Loops/Break Loops/Continue Loops/Do-while Loo...	christopher/rosetta-code
http://rosettacode.org/wiki/Pythagorean_quadruples	Pythagorean quadruples	One form of Pythagorean quadruples is (for positive integers a, b, c, and d): a2 + b2 + c2 = d2 An example: 22 + 32 + 62 = 72 which is: 4 + 9 + 36 = 49 Task For positive integers up 2,200 (inclusive), for all values of ...	#VBA	VBA	Const n = 2200 Public Sub pq() Dim s As Long, s1 As Long, s2 As Long, x As Long, x2 As Long, y As Long: s = 3 Dim l(n) As Boolean, l_add(9680000) As Boolean '9680000=n * n * 2 For x = 1 To n x2 = x * x For y = x To n l_add(x2 + y * y) = True Next y Next x For x = ...	Give a code snippet in #VBA One form of Pythagorean quadruples is (for positive integers a, b, c, and d): a2 + b2 + c2 = d2 An example: 22 + 32 + 62 = 72 which is: 4 + 9 + 36 = 49 Task For positive integers up 2,200 (inclu...	christopher/rosetta-code
http://rosettacode.org/wiki/Call_an_object_method	Call an object method	In object-oriented programming a method is a function associated with a particular class or object. In most forms of object oriented implementations methods can be static, associated with the class itself; or instance, associated with an instance of a class. Show how to call a static or class method, and an instance m...	#OASYS_Assembler	OASYS Assembler	+&GO	Give a code snippet in #OASYS_Assembler In object-oriented programming a method is a function associated with a particular class or object. In most forms of object oriented implementations methods can be static, associated with the class itself; or instance, associated with an instance of a class. Show how to call a ...	christopher/rosetta-code
http://rosettacode.org/wiki/Exponentiation_order	Exponentiation order	This task will demonstrate the order of exponentiation (xy) when there are multiple exponents. (Many programming languages, especially those with extended─precision integer arithmetic, usually support one of **, ^, ↑ or some such for exponentiation.) Task requirements Show the result of a language's eval...	#Scala	Scala	$ include "seed7_05.s7i"; const proc: main is func begin writeln("532 = " <& 532); writeln("(53)2 = " <& (53)2); writeln("5(32) = " <& 5(32)); end func;	Give a code snippet in #Scala This task will demonstrate the order of exponentiation (xy) when there are multiple exponents. (Many programming languages, especially those with extended─precision integer arithmetic, usually support one of **, ^, ↑ or some such for exponentiation.) Task requirements Show ...	christopher/rosetta-code
http://rosettacode.org/wiki/Mertens_function	Mertens function	The Mertens function M(x) is the count of square-free integers up to x that have an even number of prime factors, minus the count of those that have an odd number. It is an extension of the Möbius function. Given the Möbius function μ(n), the Mertens function M(x) is the sum of the Möbius numbers from n == 1 through n...	#Go	Go	package main import "fmt" func mertens(to int) ([]int, int, int) { if to < 1 { to = 1 } merts := make([]int, to+1) primes := []int{2} var sum, zeros, crosses int for i := 1; i <= to; i++ { j := i cp := 0 // counts prime factors spf := false // true if the...	Give a code snippet in #Go The Mertens function M(x) is the count of square-free integers up to x that have an even number of prime factors, minus the count of those that have an odd number. It is an extension of the Möbius function. Given the Möbius function μ(n), the Mertens function M(x) is the sum of the Möbius n...	christopher/rosetta-code
http://rosettacode.org/wiki/Empty_directory	Empty directory	Starting with a path to some directory, determine whether the directory is empty. An empty directory contains no files nor subdirectories. With Unix or Windows systems, every directory contains an entry for “.” and almost every directory contains “..” (except for a root directory); an empty directory contains no other...	#Tcl	Tcl	proc isEmptyDir {dir} { # Get list of _all_ files in directory set filenames [glob -nocomplain -tails -directory $dir * .*] # Check whether list is empty (after filtering specials) expr {![llength [lsearch -all -not -regexp $filenames {^\.\.?$}]]} }	Give a code snippet in #Tcl Starting with a path to some directory, determine whether the directory is empty. An empty directory contains no files nor subdirectories. With Unix or Windows systems, every directory contains an entry for “.” and almost every directory contains “..” (except for a root directory); an empt...	christopher/rosetta-code
http://rosettacode.org/wiki/Hello_world/Line_printer	Hello world/Line printer	Task Cause a line printer attached to the computer to print a line containing the message: Hello World! Note A line printer is not the same as standard output. A line printer was an older-style printer which prints one line at a time to a continuous ream of paper. With some systems, a line printer can be...	#Batch_File	Batch File	ECHO Hello world!>PRN	Give a code snippet in #Batch_File Task Cause a line printer attached to the computer to print a line containing the message: Hello World! Note A line printer is not the same as standard output. A line printer was an older-style printer which prints one line at a time to a continuous ream of paper. With...	christopher/rosetta-code
http://rosettacode.org/wiki/Arithmetic/Integer	Arithmetic/Integer	Basic Data Operation This is a basic data operation. It represents a fundamental action on a basic data type. You may see other such operations in the Basic Data Operations category, or: Integer Operations Arithmetic \| Comparison Boolean Operations Bitwise \| Logical String Operations Concatenation \| Interpolation \|...	#Vim_Script	Vim Script	let a = float2nr(input("Number 1: ") + 0) let b = float2nr(input("Number 2: ") + 0) echo "\nSum: " . (a + b) echo "Difference: " . (a - b) echo "Product: " . (a * b) " The result of an integer division is truncated echo "Quotient: " . (a / b) " The sign of the result of the remainder operation matches the sign of " th...	Give a code snippet in #Vim_Script Basic Data Operation This is a basic data operation. It represents a fundamental action on a basic data type. You may see other such operations in the Basic Data Operations category, or: Integer Operations Arithmetic \| Comparison Boolean Operations Bitwise \| Logical String Operat...	christopher/rosetta-code
http://rosettacode.org/wiki/Knight%27s_tour	Knight's tour	Task Problem: you have a standard 8x8 chessboard, empty but for a single knight on some square. Your task is to emit a series of legal knight moves that result in the knight visiting every square on the chessboard exactly once. Note that it is not a requirement that the tour be "closed"; that is, the knight need not e...	#AutoHotkey	AutoHotkey	#SingleInstance, Force #NoEnv SetBatchLines, -1 ; Uncomment if Gdip.ahk is not in your standard library ;#Include, Gdip.ahk If !pToken := Gdip_Startup(){ MsgBox, 48, Gdiplus error!, Gdiplus failed to start. Please ensure you have Gdiplus on your system. ExitApp } ; I've added a simple new function here, just to e...	Give a code snippet in #AutoHotkey Task Problem: you have a standard 8x8 chessboard, empty but for a single knight on some square. Your task is to emit a series of legal knight moves that result in the knight visiting every square on the chessboard exactly once. Note that it is not a requirement that the tour be "clo...	christopher/rosetta-code
http://rosettacode.org/wiki/Sylvester%27s_sequence	Sylvester's sequence	This page uses content from Wikipedia. The original article was at Sylvester's sequence. The list of authors can be seen in the page history. As with Rosetta Code, the text of Wikipedia is available under the GNU FDL. (See links for details on variance) In number theory, Sylvester's sequence is an integer sequenc...	#Scheme	Scheme	(define sylvester (lambda (x) (if (= x 1) 2 (let ((n (sylvester (- x 1)))) (- (* n n) n -1))))) (define list (map sylvester '(1 2 3 4 5 6 7 8 9 10))) (print list) (newline) (print (apply + (map / list)))	Give a code snippet in #Scheme This page uses content from Wikipedia. The original article was at Sylvester's sequence. The list of authors can be seen in the page history. As with Rosetta Code, the text of Wikipedia is available under the GNU FDL. (See links for details on variance) In number theory, Sylvester'...	christopher/rosetta-code
http://rosettacode.org/wiki/Shortest_common_supersequence	Shortest common supersequence	The shortest common supersequence is a problem closely related to the longest common subsequence, which you can use as an external function for this task. Task Given two strings u {\displaystyle u} and v {\displaystyle v} , find the shortest possible sequence s {\displaystyle s} , whic...	#Nim	Nim	proc lcs(x, y: string): string = if x.len == 0 or y.len == 0: return let x1 = x[0..^2] let y1 = y[0..^2] if x[^1] == y[^1]: return lcs(x1, y1) & x[^1] let x2 = lcs(x, y1) let y2 = lcs(x1, y) result = if x2.len > y2.len: x2 else: y2 proc scs(u, v: string): string = let lcs = lcs(u, v) var ui, vi = 0 ...	Give a code snippet in #Nim The shortest common supersequence is a problem closely related to the longest common subsequence, which you can use as an external function for this task. Task Given two strings u {\displaystyle u} and v {\displaystyle v} , find the shortest possible sequence ...	christopher/rosetta-code
http://rosettacode.org/wiki/Hello_world/Text	Hello world/Text	Hello world/Text is part of Short Circuit's Console Program Basics selection. Task Display the string Hello world! on a text console. Related tasks Hello world/Graphical Hello world/Line Printer Hello world/Newbie Hello world/Newline omission Hello world/Standard error Hello world/Web server	#M4	M4	`Hello world!'	Give a code snippet in #M4 Hello world/Text is part of Short Circuit's Console Program Basics selection. Task Display the string Hello world! on a text console. Related tasks Hello world/Graphical Hello world/Line Printer Hello world/Newbie Hello world/Newline omission Hello world/Standard error H...	christopher/rosetta-code
http://rosettacode.org/wiki/Emirp_primes	Emirp primes	An emirp (prime spelled backwards) are primes that when reversed (in their decimal representation) are a different prime. (This rules out palindromic primes.) Task show the first twenty emirps show all emirps between 7,700 and 8,000 show the 10,000th emirp In each list, the numbe...	#Factor	Factor	USING: io kernel lists lists.lazy math.extras math.parser math.primes sequences ; FROM: prettyprint => . pprint ; IN: rosetta-code.emirp : rev ( n -- n' ) number>string reverse string>number ; : emirp? ( n -- ? ) dup rev [ = not ] [ [ prime? ] bi@ ] 2bi and and ; : nemirps ( n -- seq ) 0 lfrom [ e...	Give a code snippet in #Factor An emirp (prime spelled backwards) are primes that when reversed (in their decimal representation) are a different prime. (This rules out palindromic primes.) Task show the first twenty emirps show all emirps between 7,700 and 8,000 show the 10,000th ...	christopher/rosetta-code
http://rosettacode.org/wiki/Look-and-say_sequence	Look-and-say sequence	The Look and say sequence is a recursively defined sequence of numbers studied most notably by John Conway. The look-and-say sequence is also known as the Morris Number Sequence, after cryptographer Robert Morris, and the puzzle What is the next number in the sequence 1, 11, 21, 1211, 11122...	#Scala	Scala	import scala.annotation.tailrec object LookAndSay extends App { loop(10, "1") @tailrec private def loop(n: Int, num: String): Unit = { println(num) if (n <= 0) () else loop(n - 1, lookandsay(num)) } private def lookandsay(number: String): String = { val result = new StringBuilder @ta...	Give a code snippet in #Scala The Look and say sequence is a recursively defined sequence of numbers studied most notably by John Conway. The look-and-say sequence is also known as the Morris Number Sequence, after cryptographer Robert Morris, and the puzzle What is the next number in the sequence...	christopher/rosetta-code
http://rosettacode.org/wiki/Generic_swap	Generic swap	Task Write a generic swap function or operator which exchanges the values of two variables (or, more generally, any two storage places that can be assigned), regardless of their types. If your solution language is statically typed please describe the way your language provides genericity. If variables are typed in t...	#Chapel	Chapel	a <=> b	Give a code snippet in #Chapel Task Write a generic swap function or operator which exchanges the values of two variables (or, more generally, any two storage places that can be assigned), regardless of their types. If your solution language is statically typed please describe the way your language provides generici...	christopher/rosetta-code
http://rosettacode.org/wiki/Musical_scale	Musical scale	Task Output the 8 notes of the C major diatonic scale to the default musical sound device on the system. Specifically, pitch must be tuned to 12-tone equal temperament (12TET) with the modern standard A=440Hz. These are the notes "C, D, E, F, G, A, B, C(1 octave higher)", or "Do, Re, Mi, Fa, Sol, La, Si/Ti, Do(1 octa...	#AutoHotkey	AutoHotkey	for key, val in [261.63, 293.66, 329.63, 349.23, 392.00, 440.00, 493.88, 523.25] SoundBeep, % val, 500	Give a code snippet in #AutoHotkey Task Output the 8 notes of the C major diatonic scale to the default musical sound device on the system. Specifically, pitch must be tuned to 12-tone equal temperament (12TET) with the modern standard A=440Hz. These are the notes "C, D, E, F, G, A, B, C(1 octave higher)", or "Do, R...	christopher/rosetta-code
http://rosettacode.org/wiki/Josephus_problem	Josephus problem	Josephus problem is a math puzzle with a grim description: n {\displaystyle n} prisoners are standing on a circle, sequentially numbered from 0 {\displaystyle 0} to n − 1 {\displaystyle n-1} . An executioner walks along the circle, starting from prisoner 0 {\displaystyle 0} , removing eve...	#EchoLisp	EchoLisp	;; input (define N 41) (define K 3) (define prisoners (apply circular-list (iota N))) (define last-one prisoners) ; current position ;; kill returns current position = last killed (define (kill lst skip) (cond ((eq? (mark? lst) '🔫 )(kill (cdr lst) skip)) ;; dead ? goto next ((zero? skip) (mark lst '🔫)) ;;...	Give a code snippet in #EchoLisp Josephus problem is a math puzzle with a grim description: n {\displaystyle n} prisoners are standing on a circle, sequentially numbered from 0 {\displaystyle 0} to n − 1 {\displaystyle n-1} . An executioner walks along the circle, starting from prisoner 0 ...	christopher/rosetta-code
http://rosettacode.org/wiki/Nested_templated_data	Nested templated data	A template for data is an arbitrarily nested tree of integer indices. Data payloads are given as a separate mapping, array or other simpler, flat, association of indices to individual items of data, and are strings. The idea is to create a data structure with the templates' nesting, and the payload corresponding to e...	#Wren	Wren	import "/set" for Set import "/sort" for Sort var withPayload // recursive function withPayload = Fn.new { \|template, payload, used\| return template.map { \|item\| if (item is List) { return withPayload.call(item, payload, used) } else { used.add(item) return "'%...	Give a code snippet in #Wren A template for data is an arbitrarily nested tree of integer indices. Data payloads are given as a separate mapping, array or other simpler, flat, association of indices to individual items of data, and are strings. The idea is to create a data structure with the templates' nesting, and ...	christopher/rosetta-code
http://rosettacode.org/wiki/Compound_data_type	Compound data type	Data Structure This illustrates a data structure, a means of storing data within a program. You may see other such structures in the Data Structures category. Task Create a compound data type: Point(x,y) A compound data type is one that holds multiple independent values. Related task Enumeration S...	#OxygenBasic	OxygenBasic	'SHORT FORM type point float x,y 'FULL FORM type point float x float y end type point p 'WITH DEFAULT VALUES type point float x = 1.0 float y = 1.0 end type point p = {} 'assigns the set of default values print p.x " " p.y	Give a code snippet in #OxygenBasic Data Structure This illustrates a data structure, a means of storing data within a program. You may see other such structures in the Data Structures category. Task Create a compound data type: Point(x,y) A compound data type is one that holds multiple independent values...	christopher/rosetta-code

Subsets and Splits

No community queries yet

The top public SQL queries from the community will appear here once available.