mlfoundations-dev/load_in_code_rosetta · Data Studio

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/Day_of_the_week	Day of the week	A company decides that whenever Xmas falls on a Sunday they will give their workers all extra paid holidays so that, together with any public holidays, workers will not have to work the following week (between the 25th of December and the first of January). Task In what years between 2008 and 2121 will the 25th of ...	#REBOL	REBOL	rebol [ Title: "Yuletide Holiday" URL: http://rosettacode.org/wiki/Yuletide_Holiday ] for y 2008 2121 1 [ d: to-date reduce [y 12 25] if 7 = d/weekday [prin [y ""]] ]	Give a code snippet in #REBOL A company decides that whenever Xmas falls on a Sunday they will give their workers all extra paid holidays so that, together with any public holidays, workers will not have to work the following week (between the 25th of December and the first of January). Task In what years between ...	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 ...	#E	E	def bubbleSort(target) { __loop(fn { var changed := false for i in 0..(target.size() - 2) { def [a, b] := target(i, i + 2) if (a > b) { target(i, i + 2) := [b, a] changed := true } } changed }) }	Give a code snippet in #E 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...	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, ...	#Sidef	Sidef	[0, Complex(0, 0)].each {\|n\| say n**n }	Give a code snippet in #Sidef 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/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 ...	#PHP	PHP	echo levenshtein('kitten','sitting'); echo levenshtein('rosettacode', 'raisethysword');	Give a code snippet in #PHP 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 compu...	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...	#Lua	Lua	function gcd(a,b) return a == 0 and b or gcd(b % a, a) end do local function coerce(a, b) if type(a) == "number" then return rational(a, 1), b end if type(b) == "number" then return a, rational(b, 1) end return a, b end rational = setmetatable({ __add = function(a, b) local a, b = coerce(a, ...	Give a code snippet in #Lua 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...	christopher/rosetta-code
http://rosettacode.org/wiki/Towers_of_Hanoi	Towers of Hanoi	Task Solve the Towers of Hanoi problem with recursion.	#Scala	Scala	def move(n: Int, from: Int, to: Int, via: Int) : Unit = { if (n == 1) { Console.println("Move disk from pole " + from + " to pole " + to) } else { move(n - 1, from, via, to) move(1, from, to, via) move(n - 1, via, to, from) } }	Give a code snippet in #Scala Task Solve the Towers of Hanoi problem with recursion.	christopher/rosetta-code
http://rosettacode.org/wiki/Function_composition	Function composition	Task Create a function, compose, whose two arguments f and g, are both functions with one argument. The result of compose is to be a function of one argument, (lets call the argument x), which works like applying function f to the result of applying function g to x. Example compose...	#Emacs_Lisp	Emacs Lisp	;; lexical-binding: t (defun compose (f g) (lambda (x) (funcall f (funcall g x)))) (let ((func (compose '1+ '1+))) (funcall func 5)) ;=> 7	Give a code snippet in #Emacs_Lisp Task Create a function, compose, whose two arguments f and g, are both functions with one argument. The result of compose is to be a function of one argument, (lets call the argument x), which works like applying function f to the result of applying function ...	christopher/rosetta-code
http://rosettacode.org/wiki/Pascal%27s_triangle	Pascal's triangle	Pascal's triangle is an arithmetic and geometric figure often associated with the name of Blaise Pascal, but also studied centuries earlier in India, Persia, China and elsewhere. Its first few rows look like this: 1 1 1 1 2 1 1 3 3 1 where each element of each row is either 1 or the sum of the two elemen...	#Mathematica.2FWolfram_Language	Mathematica/Wolfram Language	n=7; Column[StringReplace[ToString /@ Replace[MatrixExp[SparseArray[ {Band[{2,1}] -> Range[n-1]},{n,n}]],{x__,0..}->{x},2] ,{"{"\|"}"\|","->" "}], Center]	Give a code snippet in #Mathematica.2FWolfram_Language Pascal's triangle is an arithmetic and geometric figure often associated with the name of Blaise Pascal, but also studied centuries earlier in India, Persia, China and elsewhere. Its first few rows look like this: 1 1 1 1 2 1 1 3 3 1 where each elem...	christopher/rosetta-code
http://rosettacode.org/wiki/Phrase_reversals	Phrase reversals	Task Given a string of space separated words containing the following phrase: rosetta code phrase reversal Reverse the characters of the string. Reverse the characters of each individual word in the string, maintaining original word order within the string. Reverse the order of each word of the string, maintaini...	#Groovy	Groovy	def phaseReverse = { text, closure -> closure(text.split(/ /)).join(' ')} def text = 'rosetta code phrase reversal' println "Original: $text" println "Reversed: ${phaseReverse(text) { it.reverse().collect { it.reverse() } } }" println "Reversed Words: ${phaseReverse(text) { it.collect { it.reverse() } } }...	Give a code snippet in #Groovy Task Given a string of space separated words containing the following phrase: rosetta code phrase reversal Reverse the characters of the string. Reverse the characters of each individual word in the string, maintaining original word order within the string. Reverse the order of ea...	christopher/rosetta-code
http://rosettacode.org/wiki/Loops/For_with_a_specified_step	Loops/For with a specified step	Task Demonstrate a for-loop where the step-value is greater than one. 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 loop b...	#Frink	Frink	for a = 1 to 100 step 5 println[a]	Give a code snippet in #Frink Task Demonstrate a for-loop where the step-value is greater than one. 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/Inc...	christopher/rosetta-code
http://rosettacode.org/wiki/Palindrome_dates	Palindrome dates	Today (2020-02-02, at the time of this writing) happens to be a palindrome, without the hyphens, not only for those countries which express their dates in the yyyy-mm-dd format but, unusually, also for countries which use the dd-mm-yyyy format. Task Write a program which calculates and shows th...	#AWK	AWK	# syntax: GAWK -f PALINDROME_DATES.AWK BEGIN { show = 15 year_b = 2020 year_e = 9999 split("31,28,31,30,31,30,31,31,30,31,30,31",daynum_array,",") # days per month in non leap year for (y=year_b; y<=year_e; y++) { daynum_array[2] = (y % 400 == 0 \|\| (y % 4 == 0 && y % 100)) ? 29 : 28 fo...	Give a code snippet in #AWK Today (2020-02-02, at the time of this writing) happens to be a palindrome, without the hyphens, not only for those countries which express their dates in the yyyy-mm-dd format but, unusually, also for countries which use the dd-mm-yyyy format. Task Write a program ...	christopher/rosetta-code
http://rosettacode.org/wiki/Quine	Quine	A quine is a self-referential program that can, without any external access, output its own source. A quine (named after Willard Van Orman Quine) is also known as: self-reproducing automata (1972) self-replicating program or self-replicating computer program self-reproducing program ...	#ERRE	ERRE	PROGRAM QUINE BEGIN READ(D$,Y$) LOOP READ(X$) EXIT IF LEN(X$)<1 PRINT(X$) END LOOP RESTORE LOOP READ(X$) EXIT IF LEN(X$)<1 PRINT(D$;CHR$(34);X$;CHR$(34);CHR$(41)) END LOOP PRINT(D$;CHR$(34);CHR$(34);CHR$(41)) PRINT(Y$) DATA("DATA(") DATA("END PROGRAM") DATA("PROGRAM QUINE") DATA("BEGIN") DATA("R...	Give a code snippet in #ERRE A quine is a self-referential program that can, without any external access, output its own source. A quine (named after Willard Van Orman Quine) is also known as: self-reproducing automata (1972) self-replicating program or self-replicating computer program ...	christopher/rosetta-code
http://rosettacode.org/wiki/Globally_replace_text_in_several_files	Globally replace text in several files	Task Replace every occurring instance of a piece of text in a group of text files with another one. For this task we want to replace the text "Goodbye London!" with "Hello New York!" for a list of files.	#AutoHotkey	AutoHotkey	SetWorkingDir %A_ScriptDir% ; Change the working directory to the script's location listFiles := "a.txt\|b.txt\|c.txt" ; Define a list of files in the current working directory loop, Parse, listFiles, \| { ; The above parses the list based on the \| character fileread, contents, %A_LoopField% ; Read the file fileDe...	Give a code snippet in #AutoHotkey Task Replace every occurring instance of a piece of text in a group of text files with another one. For this task we want to replace the text "Goodbye London!" with "Hello New York!" for a list of files.	christopher/rosetta-code
http://rosettacode.org/wiki/Factors_of_an_integer	Factors of an 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 \|...	#Nanoquery	Nanoquery	n = int(input()) for i in range(1, n / 2) if (n % i = 0) print i + " " end end println n	Give a code snippet in #Nanoquery 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 Operati...	christopher/rosetta-code
http://rosettacode.org/wiki/Write_language_name_in_3D_ASCII	Write language name in 3D ASCII	Task Write/display a language's name in 3D ASCII. (We can leave the definition of "3D ASCII" fuzzy, so long as the result is interesting or amusing, not a cheap hack to satisfy the task.) Related tasks draw a sphere draw a cuboid draw a rotating cube draw a Deathstar	#Common_Lisp	Common Lisp	(ql:quickload :cl-ppcre) (defvar txt " xxxx xxxx x x x x xxxx x x x x xxxx xxxxx x x x x xx xx xx xx x x xx x x x x x x x x x x xx x x xx x x x x x x x x xxx x x x x x x x x x x x x...	Give a code snippet in #Common_Lisp Task Write/display a language's name in 3D ASCII. (We can leave the definition of "3D ASCII" fuzzy, so long as the result is interesting or amusing, not a cheap hack to satisfy the task.) Related tasks draw a sphere draw a cuboid draw a rotating cube draw a Deathstar	christopher/rosetta-code
http://rosettacode.org/wiki/Function_composition	Function composition	Task Create a function, compose, whose two arguments f and g, are both functions with one argument. The result of compose is to be a function of one argument, (lets call the argument x), which works like applying function f to the result of applying function g to x. Example compose...	#REBOL	REBOL	rebol [ Title: "Functional Composition" URL: http://rosettacode.org/wiki/Functional_Composition ] ; "compose" means something else in REBOL, therefore I use a 'compose-functions name. compose-functions: func [ {compose the given functions F and G} f [any-function!] g [any-function!] ] [ func [x] ...	Give a code snippet in #REBOL Task Create a function, compose, whose two arguments f and g, are both functions with one argument. The result of compose is to be a function of one argument, (lets call the argument x), which works like applying function f to the result of applying function g ...	christopher/rosetta-code
http://rosettacode.org/wiki/Read_a_specific_line_from_a_file	Read a specific line from a file	Some languages have special semantics for obtaining a known line number from a file. Task Demonstrate how to obtain the contents of a specific line within a file. For the purpose of this task demonstrate how the contents of the seventh line of a file can be obtained, and store it in a variable or in memory (fo...	#PL.2FI	PL/I	declare text character (1000) varying, line_no fixed; get (line_no); on endfile (f) begin; put skip list ('the specified line does not exist'); go to next; end; get file (f) edit ((text do i = 1 to line_no)) (L); put skip list (text); next: ;	Give a code snippet in #PL.2FI Some languages have special semantics for obtaining a known line number from a file. Task Demonstrate how to obtain the contents of a specific line within a file. For the purpose of this task demonstrate how the contents of the seventh line of a file can be obtained, and store it ...	christopher/rosetta-code
http://rosettacode.org/wiki/Unix/ls	Unix/ls	Task Write a program that will list everything in the current folder, similar to: the Unix utility “ls” [1] or the Windows terminal command “DIR” The output must be sorted, but printing extended details and producing multi-column output is not required. Example output For the list of paths:...	#JavaScript	JavaScript	const fs = require('fs'); fs.readdir('.', (err, names) => names.sort().map( name => console.log(name) ));	Give a code snippet in #JavaScript Task Write a program that will list everything in the current folder, similar to: the Unix utility “ls” [1] or the Windows terminal command “DIR” The output must be sorted, but printing extended details and producing multi-column output is not required. E...	christopher/rosetta-code
http://rosettacode.org/wiki/Comments	Comments	Task Show all ways to include text in a language source file that's completely ignored by the compiler or interpreter. Related tasks Documentation Here_document See also Wikipedia xkcd (Humor: hand gesture denoting // for "commenting out" people.)	#LOLCODE	LOLCODE	OBTW This is a multi line comment TLDR	Give a code snippet in #LOLCODE Task Show all ways to include text in a language source file that's completely ignored by the compiler or interpreter. Related tasks Documentation Here_document See also Wikipedia xkcd (Humor: hand gesture denoting // for "commenting out" people.)	christopher/rosetta-code
http://rosettacode.org/wiki/Hello_world/Newline_omission	Hello world/Newline omission	Some languages automatically insert a newline after outputting a string, unless measures are taken to prevent its output. Task Display the string Goodbye, World! without a trailing newline. Related tasks Hello world/Graphical Hello world/Line Printer Hello world/Standard error Hello world/Text	#Julia	Julia	print("Goodbye, World!")	Give a code snippet in #Julia Some languages automatically insert a newline after outputting a string, unless measures are taken to prevent its output. Task Display the string Goodbye, World! without a trailing newline. Related tasks Hello world/Graphical Hello world/Line Printer Hello world/Stand...	christopher/rosetta-code
http://rosettacode.org/wiki/Arithmetic/Complex	Arithmetic/Complex	A complex number is a number which can be written as: a + b × i {\displaystyle a+b\times i} (sometimes shown as: b + a × i {\displaystyle b+a\times i} where a {\displaystyle a} and b {\displaystyle b} are real numbers, and i {\displaystyle i} is √ -1 Typica...	#Groovy	Groovy	class Complex { final Number real, imag static final Complex i = [0,1] as Complex Complex(Number r, Number i = 0) { (real, imag) = [r, i] } Complex(Map that) { (real, imag) = [that.real ?: 0, that.imag ?: 0] } Complex plus (Complex c) { [real + c.real, imag + c.imag] as Complex } Complex...	Give a code snippet in #Groovy A complex number is a number which can be written as: a + b × i {\displaystyle a+b\times i} (sometimes shown as: b + a × i {\displaystyle b+a\times i} where a {\displaystyle a} and b {\displaystyle b} are real numbers, and i {\displays...	christopher/rosetta-code
http://rosettacode.org/wiki/Kaprekar_numbers	Kaprekar numbers	A positive integer is a Kaprekar number if: It is 1 (unity) The decimal representation of its square may be split once into two parts consisting of positive integers which sum to the original number. Note that a split resulting in a part consisting purely of 0s is not valid, as 0 is not considered positive. ...	#Racket	Racket	#lang racket (define (kaprekar? n) (or (= n 1) (let ([q (sqr n)]) (let loop ((p 10)) (and (<= p q) (or (let-values ([(b a) (quotient/remainder q p)]) (and (> a 0) (= n (+ a b)))) (loop (* p 10)))))))) (filter kaprekar? (range 1 10000)...	Give a code snippet in #Racket A positive integer is a Kaprekar number if: It is 1 (unity) The decimal representation of its square may be split once into two parts consisting of positive integers which sum to the original number. Note that a split resulting in a part consisting purely of 0s is not valid, a...	christopher/rosetta-code
http://rosettacode.org/wiki/Move-to-front_algorithm	Move-to-front algorithm	Given a symbol table of a zero-indexed array of all possible input symbols this algorithm reversibly transforms a sequence of input symbols into an array of output numbers (indices). The transform in many cases acts to give frequently repeated input symbols lower indices which is useful in some compression algorithms...	#zkl	zkl	fcn encode(text){ //-->List st:=["a".."z"].pump(Data); //"abcd..z" as byte array text.reduce(fcn(st,c,sink){ n:=st.index(c); sink.write(n); st.del(n).insert(0,c); },st,sink:=L()); sink; }	Give a code snippet in #zkl Given a symbol table of a zero-indexed array of all possible input symbols this algorithm reversibly transforms a sequence of input symbols into an array of output numbers (indices). The transform in many cases acts to give frequently repeated input symbols lower indices which is useful i...	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...	#AutoHotkey	AutoHotkey	i = 1024 While (i > 0) { output = %output%`n%i% i := Floor(i / 2) } MsgBox % output	Give a code snippet in #AutoHotkey 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/Do...	christopher/rosetta-code
http://rosettacode.org/wiki/Primes_-_allocate_descendants_to_their_ancestors	Primes - allocate descendants to their ancestors	The concept, is to add the decomposition into prime factors of a number to get its 'ancestors'. The objective is to demonstrate that the choice of the algorithm can be crucial in term of performance. This solution could be compared to the solution that would use the decomposition into primes for all the numbers betw...	#C	C	#include <math.h> #include <stdio.h> #include <stdlib.h> #include <string.h> #define MAXPRIME 99 // upper bound for the prime factors #define MAXPARENT 99 // greatest parent number #define NBRPRIMES 30 // max number of prime factors #define NBRANCESTORS 10 // max number of parent's ancestors FILE *...	Give a code snippet in #C The concept, is to add the decomposition into prime factors of a number to get its 'ancestors'. The objective is to demonstrate that the choice of the algorithm can be crucial in term of performance. This solution could be compared to the solution that would use the decomposition into prim...	christopher/rosetta-code
http://rosettacode.org/wiki/Generate_Chess960_starting_position	Generate Chess960 starting position	Chess960 is a variant of chess created by world champion Bobby Fischer. Unlike other variants of the game, Chess960 does not require a different material, but instead relies on a random initial position, with a few constraints: as in the standard chess game, all eight white pawns must be placed on the second rank. W...	#Phix	Phix	with javascript_semantics sequence solutions = {} --integer d = new_dict() for i=1 to factorial(8) do sequence s = permute(i,"RNBQKBNR") -- sequence s = permute(rand(factorial(8),"RNBQKBNR") integer b1 = find('B',s), b2 = find('B',s,b1+1) if and_bits(b2-b1,1)=1 then integer k = find('...	Give a code snippet in #Phix Chess960 is a variant of chess created by world champion Bobby Fischer. Unlike other variants of the game, Chess960 does not require a different material, but instead relies on a random initial position, with a few constraints: as in the standard chess game, all eight white pawns must be...	christopher/rosetta-code
http://rosettacode.org/wiki/Bitmap	Bitmap	Show a basic storage type to handle a simple RGB raster graphics image, and some primitive associated functions. If possible provide a function to allocate an uninitialised image, given its width and height, and provide 3 additional functions: one to fill an image with a plain RGB color, one to set a given pixe...	#Axe	Axe	Buff(768)→Pic1 Fill(Pic1,768,255) Pxl-Off(45,30,Pic1) .Display the bitmap to demonstrate Copy(Pic1) DispGraph Pause 4500 Disp pxl-Test(50,50,Pic1)▶Dec,i	Give a code snippet in #Axe Show a basic storage type to handle a simple RGB raster graphics image, and some primitive associated functions. If possible provide a function to allocate an uninitialised image, given its width and height, and provide 3 additional functions: one to fill an image with a plain RGB colo...	christopher/rosetta-code
http://rosettacode.org/wiki/Password_generator	Password generator	Create a password generation program which will generate passwords containing random ASCII characters from the following groups: lower-case letters: a ──► z upper-case letters: A ──► Z digits: 0 ──► 9 other printable characters: !"#$%&'()*+,-./:;<=>?@[]^_{\|}~ (the above ch...	#Prolog	Prolog	:- set_prolog_flag(double_quotes, chars). :- initialization(main, main). main( Argv ) :- opt_spec( Spec ), opt_parse( Spec, Argv, Opts, _ ), ( member( help(true), Opts ) -> show_help ; member( length( Len ), Opts ), member( number( Num ), Opts ), print_set_of_p...	Give a code snippet in #Prolog Create a password generation program which will generate passwords containing random ASCII characters from the following groups: lower-case letters: a ──► z upper-case letters: A ──► Z digits: 0 ──► 9 other printable characters: !"#$%&'()*+,-....	christopher/rosetta-code
http://rosettacode.org/wiki/Munchausen_numbers	Munchausen numbers	A Munchausen number is a natural number n the sum of whose digits (in base 10), each raised to the power of itself, equals n. (Munchausen is also spelled: Münchhausen.) For instance: 3435 = 33 + 44 + 33 + 55 Task Find all Munchausen numbers between 1 and 5000. Also see The OEIS entry: A046253 The ...	#MAD	MAD	NORMAL MODE IS INTEGER DIMENSION P(5) THROUGH CLCPOW, FOR D=0, 1, D.G.5 P(D) = D THROUGH CLCPOW, FOR X=1, 1, X.GE.D CLCPOW P(D) = P(D) * D THROUGH TEST, FOR D1=0, 1, D1.G.5 THROUGH TEST, FOR D2=0, 1, D2.G.5 THROUGH ...	Give a code snippet in #MAD A Munchausen number is a natural number n the sum of whose digits (in base 10), each raised to the power of itself, equals n. (Munchausen is also spelled: Münchhausen.) For instance: 3435 = 33 + 44 + 33 + 55 Task Find all Munchausen numbers between 1 and 5000. Also see T...	christopher/rosetta-code
http://rosettacode.org/wiki/Superellipse	Superellipse	A superellipse is a geometric figure defined as the set of all points (x, y) with \| x a \| n + \| y b \| n = 1 , {\displaystyle \left\|{\frac {x}{a}}\right\|^{n}\!+\left\|{\frac {y}{b}}\right\|^{n}\!=1,} where n, a, and b are positive numbers. Task Draw a superellipse with n = 2.5, and a...	#EchoLisp	EchoLisp	(lib 'plot) (define (eaxpt x n) (expt (abs x) n)) (define (Ellie x y) (+ (eaxpt (// x 200) 2.5) (eaxpt (// y 200) 2.5) -1)) (plot-xy Ellie -400 -400) → (("x:auto" -400 400) ("y:auto" -400 400))	Give a code snippet in #EchoLisp A superellipse is a geometric figure defined as the set of all points (x, y) with \| x a \| n + \| y b \| n = 1 , {\displaystyle \left\|{\frac {x}{a}}\right\|^{n}\!+\left\|{\frac {y}{b}}\right\|^{n}\!=1,} where n, a, and b are positive numbers. Task Draw ...	christopher/rosetta-code
http://rosettacode.org/wiki/String_concatenation	String concatenation	String concatenation You are encouraged to solve this task according to the task description, using any language you may know. Task Create a string variable equal to any text value. Create another string variable whose value is the original variable concatenated with another string literal. To illustrate the operat...	#Sparkling	Sparkling	let s1 = "Hello"; let s2 = " world!"; print(s1 .. s2); // prints "Hello world!"	Give a code snippet in #Sparkling String concatenation You are encouraged to solve this task according to the task description, using any language you may know. Task Create a string variable equal to any text value. Create another string variable whose value is the original variable concatenated with another string...	christopher/rosetta-code
http://rosettacode.org/wiki/Call_a_function	Call a function	Task Demonstrate the different syntax and semantics provided for calling a function. This may include: Calling a function that requires no arguments Calling a function with a fixed number of arguments Calling a function with optional arguments Calling a function with a variable number of arguments C...	#Smalltalk	Smalltalk	f valueWithArguments: arguments.	Give a code snippet in #Smalltalk Task Demonstrate the different syntax and semantics provided for calling a function. This may include: Calling a function that requires no arguments Calling a function with a fixed number of arguments Calling a function with optional arguments Calling a function with ...	christopher/rosetta-code
http://rosettacode.org/wiki/Factorial	Factorial	Definitions The factorial of 0 (zero) is defined as being 1 (unity). The Factorial Function of a positive integer, n, is defined as the product of the sequence: n, n-1, n-2, ... 1 Task Write a function to return the factorial of a number. Solutions can be iterat...	#MiniZinc	MiniZinc	var int: factorial(int: n) = let { array[0..n] of var int: factorial; constraint forall(a in 0..n)( factorial[a] == if (a == 0) then 1 else a*factorial[a-1] endif )} in factorial[n]; var int: fac = factorial(6); solve satisfy; output [show(fac),"\n"];	Give a code snippet in #MiniZinc Definitions The factorial of 0 (zero) is defined as being 1 (unity). The Factorial Function of a positive integer, n, is defined as the product of the sequence: n, n-1, n-2, ... 1 Task Write a function to return the factorial of ...	christopher/rosetta-code
http://rosettacode.org/wiki/Increasing_gaps_between_consecutive_Niven_numbers	Increasing gaps between consecutive Niven numbers	Note: Niven numbers are also called Harshad numbers. They are also called multidigital numbers. Niven numbers are positive integers which are evenly divisible by the sum of its digits (expressed in base ten). Evenly divisible means divisible with no remainder. Task find the gap (differen...	#Nim	Nim	import strformat func digitsSum(n, sum: uint64): uint64 = ## Returns the sum of the digits of n given the sum of the digits of n - 1. result = sum + 1 var n = n while n > 0 and n mod 10 == 0: dec result, 9 n = n div 10 func divisible(n, d: uint64): bool {.inline.} = if (d and 1) == 0 and (n and 1)...	Give a code snippet in #Nim Note: Niven numbers are also called Harshad numbers. They are also called multidigital numbers. Niven numbers are positive integers which are evenly divisible by the sum of its digits (expressed in base ten). Evenly divisible means divisible with no remainder. Ta...	christopher/rosetta-code
http://rosettacode.org/wiki/Test_a_function	Test a function	Task Using a well-known testing-specific library/module/suite for your language, write some tests for your language's entry in Palindrome. If your language does not have a testing specific library well known to the language's community then state this or omit the language.	#Pascal	Pascal	# ptest.t use strict; use warnings; use Test; my %tests; BEGIN { # plan tests before loading Palindrome.pm %tests = ( 'A man, a plan, a canal: Panama.' => 1, 'My dog has fleas' => 0, "Madam, I'm Adam." => 1, '1 on 1'...	Give a code snippet in #Pascal Task Using a well-known testing-specific library/module/suite for your language, write some tests for your language's entry in Palindrome. If your language does not have a testing specific library well known to the language's community then state this or omit the language.	christopher/rosetta-code
http://rosettacode.org/wiki/Named_parameters	Named parameters	Create a function which takes in a number of arguments which are specified by name rather than (necessarily) position, and show how to call the function. If the language supports reordering the arguments or optionally omitting some of them, note this. Note: Named parameters relies on being able to use the names give...	#AppleScript	AppleScript	on getName(x) set {firstName, lastName} to {"?", "?"} try set firstName to x's firstName end try try set lastName to x's lastName end try return firstName & ", " & lastName end getName	Give a code snippet in #AppleScript Create a function which takes in a number of arguments which are specified by name rather than (necessarily) position, and show how to call the function. If the language supports reordering the arguments or optionally omitting some of them, note this. Note: Named parameters relie...	christopher/rosetta-code
http://rosettacode.org/wiki/Mouse_position	Mouse position	Task Get the current location of the mouse cursor relative to the active window. Please specify if the window may be externally created.	#Raku	Raku	use java::awt::MouseInfo:from<java>; given MouseInfo.getPointerInfo.getLocation { say .getX, 'x', .getY; }	Give a code snippet in #Raku Task Get the current location of the mouse cursor relative to the active window. Please specify if the window may be externally created.	christopher/rosetta-code
http://rosettacode.org/wiki/N-smooth_numbers	N-smooth numbers	n-smooth numbers are positive integers which have no prime factors > n. The n (when using it in the expression) n-smooth is always prime, there are no 9-smooth numbers. 1 (unity) is always included in n-smooth numbers. 2-smooth numbers are non-negative powers of two. 5-smooth numbers are...	#Sidef	Sidef	func smooth_generator(primes) { var s = primes.len.of { [1] } { var n = s.map { .first }.min { \|i\| s[i].shift if (s[i][0] == n) s[i] << (n * primes[i]) } * primes.len n } } for p in (primes(2,29)) { var g = smooth_generator(p.primes) say ("Fi...	Give a code snippet in #Sidef n-smooth numbers are positive integers which have no prime factors > n. The n (when using it in the expression) n-smooth is always prime, there are no 9-smooth numbers. 1 (unity) is always included in n-smooth numbers. 2-smooth numbers are non-negative powers ...	christopher/rosetta-code
http://rosettacode.org/wiki/String_concatenation	String concatenation	String concatenation You are encouraged to solve this task according to the task description, using any language you may know. Task Create a string variable equal to any text value. Create another string variable whose value is the original variable concatenated with another string literal. To illustrate the operat...	#Pascal	Pascal	Program StringConcat; Var s, s1 : String; Begin s := 'hello'; writeln(s + ' literal'); s1 := concat(s, ' literal'); { s1 := s + ' literal'; works too, with FreePascal } writeln(s1); End.	Give a code snippet in #Pascal String concatenation You are encouraged to solve this task according to the task description, using any language you may know. Task Create a string variable equal to any text value. Create another string variable whose value is the original variable concatenated with another string li...	christopher/rosetta-code
http://rosettacode.org/wiki/Copy_stdin_to_stdout	Copy stdin to stdout	Create an executable file that copies stdin to stdout, or else a script that does so through the invocation of an interpreter at the command line.	#REXX	REXX	/REXX pgm copies data from STDIN──►STDOUT (default input stream──►default output stream/ do while chars()\==0 /repeat loop until no more characters./ call charin , x /read a char from the input stream. / call charout , x ...	Give a code snippet in #REXX Create an executable file that copies stdin to stdout, or else a script that does so through the invocation of an interpreter at the command line.	christopher/rosetta-code
http://rosettacode.org/wiki/Split_a_character_string_based_on_change_of_character	Split a character string based on change of character	Task Split a (character) string into comma (plus a blank) delimited strings based on a change of character (left to right). Show the output here (use the 1st example below). Blanks should be treated as any other character (except they are problematic to display clearly). The same applies to commas. Fo...	#8080_Assembly	8080 Assembly	org 100h jmp demo ;;; Split the string under DE on changing characters, ;;; and store the result at HL. split: ldax d ; Load character from string spcopy: mov m,a ; Store in output cpi '$' ; CP/M string terminator rz ; Stop when the end is reached mov b,a ; Store previous character in B inx d ; Increment input...	Give a code snippet in #8080_Assembly Task Split a (character) string into comma (plus a blank) delimited strings based on a change of character (left to right). Show the output here (use the 1st example below). Blanks should be treated as any other character (except they are problematic to display clearl...	christopher/rosetta-code
http://rosettacode.org/wiki/Spinning_rod_animation/Text	Spinning rod animation/Text	Task An animation with the following frames in the following order (if certain characters aren't available or can't be used correctly in the programming language, alternate characters can replace any of these frames) must animate with a delay of 0.25 seconds between each frame, with the previous frame being cleared be...	#M2000_Interpreter	M2000 Interpreter	Module Checkit { n$=lambda$ n=1, a$="\|/-\" -> { =mid$(a$, n, 1) n++ if n>4 then n=1 } \\ 1000 is 1 second Every 250 { \\ Print Over: erase line before print. No new line append. Print Over n$() } } CheckIt	Give a code snippet in #M2000_Interpreter Task An animation with the following frames in the following order (if certain characters aren't available or can't be used correctly in the programming language, alternate characters can replace any of these frames) must animate with a delay of 0.25 seconds between each fram...	christopher/rosetta-code
http://rosettacode.org/wiki/GUI_enabling/disabling_of_controls	GUI enabling/disabling of controls	In addition to fundamental GUI component interaction, an application should dynamically enable and disable GUI components, to give some guidance to the user, and prohibit (inter)actions which are inappropriate in the current state of the application. Task Similar to the task GUI component interaction, write a progr...	#NewLISP	NewLISP	; file: gui-enable.lsp ; url: http://rosettacode.org/wiki/GUI_enabling/disabling_of_controls ; author: oofoe 2012-02-02 ; Load library and initialize GUI server: (load (append (env "NEWLISPDIR") "/guiserver.lsp")) (gs:init) ; The "interlock" function maintains GUI consistency by disabling all ; controls, then ...	Give a code snippet in #NewLISP In addition to fundamental GUI component interaction, an application should dynamically enable and disable GUI components, to give some guidance to the user, and prohibit (inter)actions which are inappropriate in the current state of the application. Task Similar to the task GUI com...	christopher/rosetta-code
http://rosettacode.org/wiki/Detect_division_by_zero	Detect division by zero	Task Write a function to detect a divide by zero error without checking if the denominator is zero.	#TXR	TXR	@(do (defun div-check (x y) (catch (/ x y) (numeric_error (msg) 'div-check-failed)))) @(bind good @(div-check 32 8)) @(bind bad @(div-check 42 0))	Give a code snippet in #TXR Task Write a function to detect a divide by zero error without checking if the denominator is zero.	christopher/rosetta-code
http://rosettacode.org/wiki/String_append	String append	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 \|...	#MontiLang	MontiLang	\|Hello \| \|world!\| swap + print	Give a code snippet in #MontiLang 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 Operati...	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...	#PARI.2FGP	PARI/GP	horner(v,x)={ my(s=0); forstep(i=#v,1,-1,s=s*x+v[i]); s };	Give a code snippet in #PARI.2FGP 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 ) ...	christopher/rosetta-code
http://rosettacode.org/wiki/Abundant_odd_numbers	Abundant odd numbers	An Abundant number is a number n for which the sum of divisors σ(n) > 2n, or, equivalently, the sum of proper divisors (or aliquot sum) s(n) > n. E.G. 12 is abundant, it has the proper divisors 1,2,3,4 & 6 which sum to 16 ( > 12 or n); or alternately, has the sigma sum of ...	#BASIC256	BASIC256	numimpar = 1 contar = 0 sumaDiv = 0 function SumaDivisores(n) # Devuelve la suma de los divisores propios de n suma = 1 i = int(sqr(n)) for d = 2 to i if n % d = 0 then suma += d otroD = n \ d if otroD <> d Then suma += otroD end if Next d Return suma End Function # Encontrar los números requ...	Give a code snippet in #BASIC256 An Abundant number is a number n for which the sum of divisors σ(n) > 2n, or, equivalently, the sum of proper divisors (or aliquot sum) s(n) > n. E.G. 12 is abundant, it has the proper divisors 1,2,3,4 & 6 which sum to 16 ( > 12 or n); or al...	christopher/rosetta-code
http://rosettacode.org/wiki/Smith_numbers	Smith numbers	Smith numbers are numbers such that the sum of the decimal digits of the integers that make up that number is the same as the sum of the decimal digits of its prime factors excluding 1. By definition, all primes are excluded as they (naturally) satisfy this condition! Smith numbers are also known as joke numbers....	#Modula-2	Modula-2	MODULE SmithNumbers; FROM FormatString IMPORT FormatString; FROM Terminal IMPORT WriteString,WriteLn,ReadChar; PROCEDURE SumDigits(n : INTEGER) : INTEGER; VAR sum : INTEGER; BEGIN sum := 0; WHILE n > 0 DO sum := sum + (n MOD 10); n := n DIV 10; END; RETURN sum; END SumDigits; VAR ...	Give a code snippet in #Modula-2 Smith numbers are numbers such that the sum of the decimal digits of the integers that make up that number is the same as the sum of the decimal digits of its prime factors excluding 1. By definition, all primes are excluded as they (naturally) satisfy this condition! Smith numbers a...	christopher/rosetta-code
http://rosettacode.org/wiki/String_matching	String matching	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 \|...	#FreeBASIC	FreeBASIC	' FB 1.05.0 Win64 Dim As String s1 = "abracadabra" Dim As String s2 = "abra" Print "First string : "; s1 Print "Second string : "; s2 Print Print "First string begins with second string : "; CBool(s2 = Left(s1, Len(s2))) Dim As Integer i1 = Instr(s1, s2) Dim As Integer i2 Print "First string contains second string...	Give a code snippet in #FreeBASIC 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 Operati...	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...	#D	D	import std.stdio, std.traits; S rot(S)(in S s, in int key) pure nothrow @safe if (isSomeString!S) { auto res = s.dup; foreach (immutable i, ref c; res) { if ('a' <= c && c <= 'z') c = ((c - 'a' + key) % 26 + 'a'); else if ('A' <= c && c <= 'Z') c = ((c - 'A' + key) % ...	Give a code snippet in #D 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)....	christopher/rosetta-code
http://rosettacode.org/wiki/Sum_to_100	Sum to 100	Task Find solutions to the sum to one hundred puzzle. Add (insert) the mathematical operators + or - (plus or minus) before any of the digits in the decimal numeric string 123456789 such that the resulting mathematical expression adds up to a particular sum (in this iconic case, ...	#D	D	import std.stdio; void main() { import std.algorithm : each, max, reduce, sort; import std.range : take; Stat stat = new Stat(); comment("Show all solutions that sum to 100"); immutable givenSum = 100; print(givenSum); comment("Show the sum that has the maximum number of solutions");...	Give a code snippet in #D Task Find solutions to the sum to one hundred puzzle. Add (insert) the mathematical operators + or - (plus or minus) before any of the digits in the decimal numeric string 123456789 such that the resulting mathematical expression adds up to a particular sum...	christopher/rosetta-code
http://rosettacode.org/wiki/Anagrams	Anagrams	When two or more words are composed of the same characters, but in a different order, they are called anagrams. Task[edit] Using the word list at http://wiki.puzzlers.org/pub/wordlists/unixdict.txt, find the sets of words that share the same characters that contain the most words in them. Related tasks Word plays ...	#ABAP	ABAP	report zz_anagrams no standard page heading. define update_progress. call function 'SAPGUI_PROGRESS_INDICATOR' exporting text = &1. end-of-definition. " Selection screen segment allowing the person to choose which file will act as input. selection-screen begin of block file_choice. parameters p_file typ...	Give a code snippet in #ABAP When two or more words are composed of the same characters, but in a different order, they are called anagrams. Task[edit] Using the word list at http://wiki.puzzlers.org/pub/wordlists/unixdict.txt, find the sets of words that share the same characters that contain the most words in th...	christopher/rosetta-code
http://rosettacode.org/wiki/Sort_an_integer_array	Sort an integer array	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 ...	#MUMPS	MUMPS	SORTARRAY(X,SEP) ;X is the list of items to sort ;X1 is the temporary array ;SEP is the separator string between items in the list X ;Y is the returned list ;This routine uses the inherent sorting of the arrays NEW I,X1,Y SET Y="" FOR I=1:1:$LENGTH(X,SEP) SET X1($PIECE(X,SEP,I))="" SET I="" FOR SET I=$O(X1(I)...	Give a code snippet in #MUMPS 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 so...	christopher/rosetta-code
http://rosettacode.org/wiki/Convert_seconds_to_compound_duration	Convert seconds to compound duration	Task Write a function or program which: takes a positive integer representing a duration in seconds as input (e.g., 100), and returns a string which shows the same duration decomposed into: weeks, days, hours, minutes, and seconds. This is detailed below (e.g., "2 hr, 59 sec"). Demonstrat...	#Erlang	Erlang	-module(convert_seconds). -export([test/0]). test() -> lists:map(fun convert/1, [7259, 86400, 6000000]), ok. convert(Seconds) -> io:format( "~7s seconds = ~s\n", [integer_to_list(Seconds), compoundDuration(Seconds)] ). % Compound duration of t seconds. The argument is assumed to be positive. compound...	Give a code snippet in #Erlang Task Write a function or program which: takes a positive integer representing a duration in seconds as input (e.g., 100), and returns a string which shows the same duration decomposed into: weeks, days, hours, minutes, and seconds. This is detailed below (e.g....	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...	#Diego	Diego	with_computer(comp1)_printer(lp1)_text(Hello World!);	Give a code snippet in #Diego 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...	christopher/rosetta-code
http://rosettacode.org/wiki/Loops/For_with_a_specified_step	Loops/For with a specified step	Task Demonstrate a for-loop where the step-value is greater than one. 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 loop b...	#Vim_Script	Vim Script	for i in range(2, 10, 2) echo i endfor	Give a code snippet in #Vim_Script Task Demonstrate a for-loop where the step-value is greater than one. 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 Loop...	christopher/rosetta-code
http://rosettacode.org/wiki/Guess_the_number/With_feedback	Guess the number/With feedback	Task Write a game (computer program) that follows the following rules: The computer chooses a number between given set limits. The player is asked for repeated guesses until the the target number is guessed correctly At each guess, the computer responds with whether the guess is: higher than the target, equal to...	#NewLISP	NewLISP	; guess-number-feedback.lsp ; oofoe 2012-01-19 ; http://rosettacode.org/wiki/Guess_the_number/With_feedback (seed (time-of-day)) ; Initialize random number generator from clock. (setq low -5 high 62 number (+ low (rand (- high low))) found nil ) (print "I'm thinking of a number between " low " a...	Give a code snippet in #NewLISP Task Write a game (computer program) that follows the following rules: The computer chooses a number between given set limits. The player is asked for repeated guesses until the the target number is guessed correctly At each guess, the computer responds with whether the guess is: ...	christopher/rosetta-code
http://rosettacode.org/wiki/Sum_digits_of_an_integer	Sum digits of an integer	Task Take a Natural Number in a given base and return the sum of its digits: 110 sums to 1 123410 sums to 10 fe16 sums to 29 f0e16 sums to 29	#AWK	AWK	#!/usr/bin/awk -f BEGIN { print sumDigits("1") print sumDigits("12") print sumDigits("fe") print sumDigits("f0e") } function sumDigits(num, nDigs, digits, sum, d, dig, val, sum) { nDigs = split(num, digits, "") sum = 0 for (d = 1; d <= nDigs; d++) { dig = digits[d] val...	Give a code snippet in #AWK Task Take a Natural Number in a given base and return the sum of its digits: 110 sums to 1 123410 sums to 10 fe16 sums to 29 f0e16 sums to 29	christopher/rosetta-code
http://rosettacode.org/wiki/DNS_query	DNS query	DNS is an internet service that maps domain names, like rosettacode.org, to IP addresses, like 66.220.0.231. Use DNS to resolve www.kame.net to both IPv4 and IPv6 addresses. Print these addresses.	#D	D	import std.stdio, std.socket; void main() { auto domain = "www.kame.net", port = "80"; auto a = getAddressInfo(domain, port, AddressFamily.INET); writefln("IPv4 address for %s: %s", domain, a[0].address); a = getAddressInfo(domain, port, AddressFamily.INET6); writefln("IPv6 address for %s: %s"...	Give a code snippet in #D DNS is an internet service that maps domain names, like rosettacode.org, to IP addresses, like 66.220.0.231. Use DNS to resolve www.kame.net to both IPv4 and IPv6 addresses. Print these addresses.	christopher/rosetta-code
http://rosettacode.org/wiki/Trigonometric_functions	Trigonometric functions	Task If your language has a library or built-in functions for trigonometry, show examples of: sine cosine tangent inverses (of the above) using the same angle in radians and degrees. For the non-inverse functions, each radian/degree pair should use arguments that evaluate to the same angle (that i...	#Python	Python	Python 3.2.2 (default, Sep 4 2011, 09:51:08) [MSC v.1500 32 bit (Intel)] on win32 Type "copyright", "credits" or "license()" for more information. >>> from math import degrees, radians, sin, cos, tan, asin, acos, atan, pi >>> rad, deg = pi/4, 45.0 >>> print("Sine:", sin(rad), sin(radians(deg))) Sine: 0.707106781186547...	Give a code snippet in #Python Task If your language has a library or built-in functions for trigonometry, show examples of: sine cosine tangent inverses (of the above) using the same angle in radians and degrees. For the non-inverse functions, each radian/degree pair should use arguments that eval...	christopher/rosetta-code
http://rosettacode.org/wiki/Roman_numerals/Encode	Roman numerals/Encode	Task Create a function taking a positive integer as its parameter and returning a string containing the Roman numeral representation of that integer. Modern Roman numerals are written by expressing each digit separately, starting with the left most digit and skipping any digit with a value of zero. In Roman numeral...	#Lua	Lua	romans = { {1000, "M"}, {900, "CM"}, {500, "D"}, {400, "CD"}, {100, "C"}, {90, "XC"}, {50, "L"}, {40, "XL"}, {10, "X"}, {9, "IX"}, {5, "V"}, {4, "IV"}, {1, "I"} } k = io.read() + 0 for _, v in ipairs(romans) do --note that this is -not- ipairs. val, let = unpack(v) while k >= val do k = k - val io.write(let)...	Give a code snippet in #Lua Task Create a function taking a positive integer as its parameter and returning a string containing the Roman numeral representation of that integer. Modern Roman numerals are written by expressing each digit separately, starting with the left most digit and skipping any digit with a value...	christopher/rosetta-code
http://rosettacode.org/wiki/Strassen%27s_algorithm	Strassen's algorithm	Description In linear algebra, the Strassen algorithm (named after Volker Strassen), is an algorithm for matrix multiplication. It is faster than the standard matrix multiplication algorithm and is useful in practice for large matrices, but would be slower than the fastest known algorithms for extremely large ma...	#Julia	Julia	""" Strassen's matrix multiplication algorithm. Use dynamic padding in order to reduce required auxiliary memory. """ function strassen(x::Matrix, y::Matrix) # Check that the sizes of these matrices match. (r1, c1) = size(x) (r2, c2) = size(y) if c1 != r2 error("Multiplying $r1 x $c1 and $r2 x $...	Give a code snippet in #Julia Description In linear algebra, the Strassen algorithm (named after Volker Strassen), is an algorithm for matrix multiplication. It is faster than the standard matrix multiplication algorithm and is useful in practice for large matrices, but would be slower than the fastest known al...	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 \|...	#C.2B.2B	C++	#include <iostream> int main() { int a, b; std::cin >> a >> b; std::cout << "a+b = " << a+b << "\n"; std::cout << "a-b = " << a-b << "\n"; std::cout << "ab = " << ab << "\n"; std::cout << "a/b = " << a/b << ", remainder " << a%b << "\n"; return 0; }	Give a code snippet in #C.2B.2B 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 Operation...	christopher/rosetta-code
http://rosettacode.org/wiki/Loops/For	Loops/For	“For” loops are used to make some block of code be iterated a number of times, setting a variable or parameter to a monotonically increasing integer value for each execution of the block of code. Common extensions of this allow other counting patterns or iterating over abstract structures other than the integers. ...	#FALSE	FALSE	1[$6-][$[$]["*"1-]#%" "1+]#%	Give a code snippet in #FALSE “For” loops are used to make some block of code be iterated a number of times, setting a variable or parameter to a monotonically increasing integer value for each execution of the block of code. Common extensions of this allow other counting patterns or iterating over abstract structu...	christopher/rosetta-code
http://rosettacode.org/wiki/N-queens_problem	N-queens problem	Solve the eight queens puzzle. You can extend the problem to solve the puzzle with a board of size NxN. For the number of solutions for small values of N, see OEIS: A000170. Related tasks A* search algorithm Solve a Hidato puzzle Solve a Holy Knight's tour Knight's tour Peaceful chess queen armie...	#UNIX_Shell	UNIX Shell	#!/bin/bash # variable declaration typeset -i BoardSize=8 typeset -i p=0 typeset -i total=0 typeset -i board # initialization function init { for (( i=0;i<$BoardSize;i++ )) do (( board[$i]=-1 )) done } # check if queen can be placed function place { typeset -i flag=1 for (( i=...	Give a code snippet in #UNIX_Shell Solve the eight queens puzzle. You can extend the problem to solve the puzzle with a board of size NxN. For the number of solutions for small values of N, see OEIS: A000170. Related tasks A* search algorithm Solve a Hidato puzzle Solve a Holy Knight's tour Knigh...	christopher/rosetta-code
http://rosettacode.org/wiki/Sleep	Sleep	Task Write a program that does the following in this order: Input an amount of time to sleep in whatever units are most natural for your language (milliseconds, seconds, ticks, etc.). This unit should be noted in comments or in a description. Print "Sleeping..." Sleep the main thread for the given amount of time. ...	#LabVIEW	LabVIEW	stdoutnl('Sleeping...') sleep(5000) // Sleep 5 seconds stdoutnl('Awake!')	Give a code snippet in #LabVIEW Task Write a program that does the following in this order: Input an amount of time to sleep in whatever units are most natural for your language (milliseconds, seconds, ticks, etc.). This unit should be noted in comments or in a description. Print "Sleeping..." Sleep the main thre...	christopher/rosetta-code
http://rosettacode.org/wiki/String_interpolation_(included)	String interpolation (included)	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 \|...	#Kotlin	Kotlin	// version 1.0.6 fun main(args: Array<String>) { val s = "little" // String interpolation using a simple variable println("Mary had a $s lamb") // String interpolation using an expression (need to wrap it in braces) println("Mary had a ${s.toUpperCase()} lamb") // However if a simple variab...	Give a code snippet in #Kotlin 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/Letter_frequency	Letter frequency	Task Open a text file and count the occurrences of each letter. Some of these programs count all characters (including punctuation), but some only count letters A to Z. Other tasks related to string operations: Metrics Array length String length Copy a string Empty string (assignment) Counting Word frequen...	#PL.2FI	PL/I	frequencies: procedure options (main); declare tallies(26) fixed binary static initial ((26) 0); declare alphabet character (26) static initial ('ABCDEFGHIJKLMNOPQRSTUVWXYZ'); declare c character (1), i fixed binary; declare in file; open file (in) title ('/LETTER.DAT,type(text),recsize(200)') ...	Give a code snippet in #PL.2FI Task Open a text file and count the occurrences of each letter. Some of these programs count all characters (including punctuation), but some only count letters A to Z. Other tasks related to string operations: Metrics Array length String length Copy a string Empty string (as...	christopher/rosetta-code
http://rosettacode.org/wiki/Resistor_mesh	Resistor mesh	Task Given 10×10 grid nodes (as shown in the image) interconnected by 1Ω resistors as shown, find the resistance between points A and B. See also (humor, nerd sniping) xkcd.com cartoon	#Nim	Nim	const S = 10 type NodeKind = enum nodeFree, nodeA, nodeB Node = object v: float fixed: NodeKind Mesh[H, W: static int] = array[H, array[W, Node]] func setBoundary(m: var Mesh) = m[1][1].v = 1.0 m[1][1].fixed = nodeA m[6][7].v = -1.0 m[6][7].fixed = nodeB func calcDiff[H, W: static...	Give a code snippet in #Nim Task Given 10×10 grid nodes (as shown in the image) interconnected by 1Ω resistors as shown, find the resistance between points A and B. See also (humor, nerd sniping) xkcd.com cartoon	christopher/rosetta-code
http://rosettacode.org/wiki/Loops/Wrong_ranges	Loops/Wrong ranges	Loops/Wrong ranges You are encouraged to solve this task according to the task description, using any language you may know. Some languages have syntax or function(s) to generate a range of numeric values from a start value, a stop value, and an increment. The purpose of this task is to select the range syntax/functi...	#C	C	#include <stdio.h> #define TRUE 1 #define FALSE 0 typedef int bool; typedef struct { int start, stop, incr; const char *comment; } S; S examples[9] = { {-2, 2, 1, "Normal"}, {-2, 2, 0, "Zero increment"}, {-2, 2, -1, "Increments away from stop value"}, {-2, 2, 10, "First increment is beyo...	Give a code snippet in #C Loops/Wrong ranges You are encouraged to solve this task according to the task description, using any language you may know. Some languages have syntax or function(s) to generate a range of numeric values from a start value, a stop value, and an increment. The purpose of this task is to sel...	christopher/rosetta-code
http://rosettacode.org/wiki/Sorting_algorithms/Heapsort	Sorting algorithms/Heapsort	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 ...	#Vala	Vala	void swap(int[] array, int i1, int i2) { if (array[i1] == array[i2]) return; var tmp = array[i1]; array[i1] = array[i2]; array[i2] = tmp; } void shift_down(int[] heap, int i, int max) { int i_big, c1, c2; while (i < max) { i_big = i; c1 = (2 * i) + 1; c2 = c1 + 1; if (c1 < max && heap...	Give a code snippet in #Vala 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/Hello_world/Web_server	Hello world/Web server	The browser is the new GUI ! Task Serve our standard text Goodbye, World! to http://localhost:8080/ so that it can be viewed with a web browser. The provided solution must start or implement a server that accepts multiple client connections and serves text as requested. Note that starting a web browser or...	#Modula-2	Modula-2	MODULE access; FROM InOut IMPORT WriteString, WriteLn; BEGIN WriteString ("Content-Type : text/plain"); WriteLn; WriteLn; WriteString ("Hello web wide world."); WriteLn END access.	Give a code snippet in #Modula-2 The browser is the new GUI ! Task Serve our standard text Goodbye, World! to http://localhost:8080/ so that it can be viewed with a web browser. The provided solution must start or implement a server that accepts multiple client connections and serves text as requested. N...	christopher/rosetta-code
http://rosettacode.org/wiki/Accumulator_factory	Accumulator factory	A problem posed by Paul Graham is that of creating a function that takes a single (numeric) argument and which returns another function that is an accumulator. The returned accumulator function in turn also takes a single numeric argument, and returns the sum of all the numeric values passed in so far to that accumulat...	#ActionScript	ActionScript	//Throw an error if a non-number argument is used. (typeof evaluates to // "number" for both integers and reals) function checkType(obj:Object):void { if(typeof obj != "number") throw new ArgumentError("Expected integer or float argument. Recieved " + typeof obj); } function accumulator(sum:Object):Function { ...	Give a code snippet in #ActionScript A problem posed by Paul Graham is that of creating a function that takes a single (numeric) argument and which returns another function that is an accumulator. The returned accumulator function in turn also takes a single numeric argument, and returns the sum of all the numeric val...	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 ...	#Logo	Logo	to comb :n :list if :n = 0 [output [[]]] if empty? :list [output []] output sentence map [sentence first :list ?] comb :n-1 bf :list ~ comb :n bf :list end print comb 3 [0 1 2 3 4]	Give a code snippet in #Logo 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 ...	christopher/rosetta-code
http://rosettacode.org/wiki/Five_weekends	Five weekends	The month of October in 2010 has five Fridays, five Saturdays, and five Sundays. Task Write a program to show all months that have this same characteristic of five full weekends from the year 1900 through 2100 (Gregorian calendar). Show the number of months with this property (there should be 201). Show at leas...	#ERRE	ERRE	PROGRAM FIVE_WEEKENDS DIM M$[12] PROCEDURE MODULO(X,Y->MD) IF Y=0 THEN MD=X ELSE MD=X-YINT(X/Y) END IF END PROCEDURE PROCEDURE WD(M,D,Y->RES%) IF M=1 OR M=2 THEN M+=12 Y-=1 END IF MODULO(365Y+INT(Y/4)-INT(Y/100)+INT(Y/400)+D+INT((153*M+8)/5),7->RES) RES%=RES+1.0 END PROCEDUR...	Give a code snippet in #ERRE The month of October in 2010 has five Fridays, five Saturdays, and five Sundays. Task Write a program to show all months that have this same characteristic of five full weekends from the year 1900 through 2100 (Gregorian calendar). Show the number of months with this property (there...	christopher/rosetta-code
http://rosettacode.org/wiki/FTP	FTP	Task Connect to a server, change directory, list its contents and download a file as binary using the FTP protocol. Use passive mode if available.	#zkl	zkl	zkl: var cURL=Import("zklCurl") zkl: var d=cURL().get("ftp.hq.nasa.gov/pub/issoutreach/Living in Space Stories (MP3 Files)/") L(Data(2,567),1630,23) // downloaded listing, 1630 bytes of header, 23 bytes of trailer zkl: d[0][1630,-23].text -rw-rw-r-- 1 109 space-station 2327118 May 9 2005 09sept_spacepropulsio...	Give a code snippet in #zkl Task Connect to a server, change directory, list its contents and download a file as binary using the FTP protocol. Use passive mode if available.	christopher/rosetta-code
http://rosettacode.org/wiki/Draw_a_sphere	Draw a sphere	Task Draw a sphere. The sphere can be represented graphically, or in ASCII art, depending on the language capabilities. Either static or rotational projection is acceptable for this task. Related tasks draw a cuboid draw a rotating cube write language name in 3D ASCII draw a Deathstar	#XPL0	XPL0	include c:\cxpl\codes; \intrinsic 'code' declarations def R=100, R2=R*R; \radius, in pixels; radius squared def X0=640/2, Y0=480/2; \coordinates of center of screen int X, Y, Z, C, D2; \coords, color, distance from center squared [SetVid($112); \set 640x480x24 ...	Give a code snippet in #XPL0 Task Draw a sphere. The sphere can be represented graphically, or in ASCII art, depending on the language capabilities. Either static or rotational projection is acceptable for this task. Related tasks draw a cuboid draw a rotating cube write language name in 3D ASCII draw a Dea...	christopher/rosetta-code
http://rosettacode.org/wiki/Ordered_partitions	Ordered partitions	In this task we want to find the ordered partitions into fixed-size blocks. This task is related to Combinations in that it has to do with discrete mathematics and moreover a helper function to compute combinations is (probably) needed to solve this task. p a r t i t i o n s ( a r g 1 , a r g 2 , ...	#J	J	require'stats' partitions=: ([,] {L:0 (i.@#@, -. [)&;)/"1@>@,@{@({@comb&.> +/\.)	Give a code snippet in #J In this task we want to find the ordered partitions into fixed-size blocks. This task is related to Combinations in that it has to do with discrete mathematics and moreover a helper function to compute combinations is (probably) needed to solve this task. p a r t i t i o n s ( a r g ...	christopher/rosetta-code
http://rosettacode.org/wiki/Faulhaber%27s_formula	Faulhaber's formula	In mathematics, Faulhaber's formula, named after Johann Faulhaber, expresses the sum of the p-th powers of the first n positive integers as a (p + 1)th-degree polynomial function of n, the coefficients involving Bernoulli numbers. Task Generate the first 10 closed-form expressions, starting with p = 0. R...	#Julia	Julia	module Faulhaber function bernoulli(n::Integer) n ≥ 0 \|\| throw(DomainError(n, "n must be a positive-or-0 number")) a = fill(0 // 1, n + 1) for m in 1:n a[m] = 1 // (m + 1) for j in m:-1:2 a[j - 1] = (a[j - 1] - a[j]) * j end end return ifelse(n != 1, a[1], -a[1]...	Give a code snippet in #Julia In mathematics, Faulhaber's formula, named after Johann Faulhaber, expresses the sum of the p-th powers of the first n positive integers as a (p + 1)th-degree polynomial function of n, the coefficients involving Bernoulli numbers. Task Generate the first 10 closed-form express...	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...	#PL.2FI	PL/I	process source attributes xref or(!); hencode: Proc Options(main); /-------------------------------------------------------------------- * 28.12.013 Walter Pachl translated from REXX -------------------------------------------------------------------/ Dcl debug Bit(1) Init('0'b); Dcl (i,j,k) Bin Fixed(15); ...	Give a code snippet in #PL.2FI 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/Program_termination	Program termination	Task Show the syntax for a complete stoppage of a program inside a conditional. This includes all threads/processes which are part of your program. Explain the cleanup (or lack thereof) caused by the termination (allocated memory, database connections, open files, object finalizers/destructors, run-on-exit hooks...	#Neko	Neko	/* Program termination, in Neko */ var sys_exit = $loader.loadprim("std@sys_exit", 1) var return_code = 42 if true sys_exit(return_code) $print("Control flow does not make it this far")	Give a code snippet in #Neko Task Show the syntax for a complete stoppage of a program inside a conditional. This includes all threads/processes which are part of your program. Explain the cleanup (or lack thereof) caused by the termination (allocated memory, database connections, open files, object finalizers/...	christopher/rosetta-code
http://rosettacode.org/wiki/Pick_random_element	Pick random element	Demonstrate how to pick a random element from a list.	#zkl	zkl	list:=T("hydrogen", "helium", "lithium", "beryllium", "boron"); list[(0).random(list.len())]	Give a code snippet in #zkl Demonstrate how to pick a random element from a list.	christopher/rosetta-code
http://rosettacode.org/wiki/Stair-climbing_puzzle	Stair-climbing puzzle	From Chung-Chieh Shan (LtU): Your stair-climbing robot has a very simple low-level API: the "step" function takes no argument and attempts to climb one step as a side effect. Unfortunately, sometimes the attempt fails and the robot clumsily falls one step instead. The "step" function detects what happens and returns a...	#Tcl	Tcl	set level 41 set prob 0.5001 proc step {} { global level prob steps incr steps if {rand() < $prob} { incr level 1 return 1 } else { incr level -1 return 0 } }	Give a code snippet in #Tcl From Chung-Chieh Shan (LtU): Your stair-climbing robot has a very simple low-level API: the "step" function takes no argument and attempts to climb one step as a side effect. Unfortunately, sometimes the attempt fails and the robot clumsily falls one step instead. The "step" function detec...	christopher/rosetta-code
http://rosettacode.org/wiki/Faulhaber%27s_formula	Faulhaber's formula	In mathematics, Faulhaber's formula, named after Johann Faulhaber, expresses the sum of the p-th powers of the first n positive integers as a (p + 1)th-degree polynomial function of n, the coefficients involving Bernoulli numbers. Task Generate the first 10 closed-form expressions, starting with p = 0. R...	#Nim	Nim	import math, rationals type Fraction = Rational[int] FaulhaberSequence = seq[Fraction] const Zero = 0 // 1 One = 1 // 1 MinusOne = -1 // 1 Powers = ["⁰", "¹", "²", "³", "⁴", "⁵", "⁶", "⁷", "⁸", "⁹"] #--------------------------------------------------------------------------------------------------- ...	Give a code snippet in #Nim In mathematics, Faulhaber's formula, named after Johann Faulhaber, expresses the sum of the p-th powers of the first n positive integers as a (p + 1)th-degree polynomial function of n, the coefficients involving Bernoulli numbers. Task Generate the first 10 closed-form expressio...	christopher/rosetta-code
http://rosettacode.org/wiki/Death_Star	Death Star	Task Display a region that consists of a large sphere with part of a smaller sphere removed from it as a result of geometric subtraction. (This will basically produce a shape like a "death star".) Related tasks draw a sphere draw a cuboid draw a rotating cube write language name in 3D ASCII	#Lua	Lua	function V3(x,y,z) return {x=x,y=y,z=z} end function dot(v,w) return v.xw.x + v.yw.y + v.z*w.z end function norm(v) local m=math.sqrt(dot(v,v)) return V3(v.x/m, v.y/m, v.z/m) end function clamp(n,lo,hi) return math.floor(math.min(math.max(lo,n),hi)) end function hittest(s, x, y) local z = s.r^2 - (x-s.x)^2 - (y-s.y...	Give a code snippet in #Lua Task Display a region that consists of a large sphere with part of a smaller sphere removed from it as a result of geometric subtraction. (This will basically produce a shape like a "death star".) Related tasks draw a sphere draw a cuboid draw a rotating cube write language name...	christopher/rosetta-code
http://rosettacode.org/wiki/Word_ladder	Word ladder	Yet another shortest path problem. Given two words of equal length the task is to transpose the first into the second. Only one letter may be changed at a time and the change must result in a word in unixdict, the minimum number of intermediate words should be used. Demonstrate the following: A boy can be made into ...	#Nim	Nim	import sets, strformat, strutils func isOneAway(word1, word2: string): bool = ## Return true if "word1" and "word2" has only one letter of difference. for i in 0..word1.high: if word1[i] != word2[i]: if result: return false # More than one letter of difference. else: result = true # One ...	Give a code snippet in #Nim Yet another shortest path problem. Given two words of equal length the task is to transpose the first into the second. Only one letter may be changed at a time and the change must result in a word in unixdict, the minimum number of intermediate words should be used. Demonstrate the follow...	christopher/rosetta-code
http://rosettacode.org/wiki/DNS_query	DNS query	DNS is an internet service that maps domain names, like rosettacode.org, to IP addresses, like 66.220.0.231. Use DNS to resolve www.kame.net to both IPv4 and IPv6 addresses. Print these addresses.	#C.2B.2B	C++	#include <boost/asio.hpp> #include <iostream> int main() { int rc {EXIT_SUCCESS}; try { boost::asio::io_service io_service; boost::asio::ip::tcp::resolver resolver {io_service}; auto entries = resolver.resolve({"www.kame.net", ""}); boost::asio::ip::tcp::resolver::iterator entries_end; for (...	Give a code snippet in #C.2B.2B DNS is an internet service that maps domain names, like rosettacode.org, to IP addresses, like 66.220.0.231. Use DNS to resolve www.kame.net to both IPv4 and IPv6 addresses. Print these addresses.	christopher/rosetta-code
http://rosettacode.org/wiki/Evaluate_binomial_coefficients	Evaluate binomial coefficients	This programming task, is to calculate ANY binomial coefficient. However, it has to be able to output ( 5 3 ) {\displaystyle {\binom {5}{3}}} , which is 10. This formula is recommended: ( n k ) = n ! ( n − k ) ! k ! = n ( n − 1 ) ( n − 2 ) … ( n − k + 1 ) k ( k − 1...	#SequenceL	SequenceL	choose(n, k) := product(k + 1 ... n) / product(1 ... n - k);	Give a code snippet in #SequenceL This programming task, is to calculate ANY binomial coefficient. However, it has to be able to output ( 5 3 ) {\displaystyle {\binom {5}{3}}} , which is 10. This formula is recommended: ( n k ) = n ! ( n − k ) ! k ! = n ( n − 1 ) ( ...	christopher/rosetta-code
http://rosettacode.org/wiki/Letter_frequency	Letter frequency	Task Open a text file and count the occurrences of each letter. Some of these programs count all characters (including punctuation), but some only count letters A to Z. Other tasks related to string operations: Metrics Array length String length Copy a string Empty string (assignment) Counting Word frequen...	#Vedit_macro_language	Vedit macro language	File_Open("c:\txt\a_text_file.txt") Update() for (#1='A'; #1<='Z'; #1++) { Out_Reg(103) Char_Dump(#1,NOCR) Out_Reg(CLEAR) #2 = Search(@103, BEGIN+ALL+NOERR) Message(@103) Num_Type(#2) }	Give a code snippet in #Vedit_macro_language Task Open a text file and count the occurrences of each letter. Some of these programs count all characters (including punctuation), but some only count letters A to Z. Other tasks related to string operations: Metrics Array length String length Copy a string Emp...	christopher/rosetta-code
http://rosettacode.org/wiki/Send_an_unknown_method_call	Send an unknown method call	Task Invoke an object method where the name of the method to be invoked can be generated at run time. Related tasks Respond to an unknown method call. Runtime evaluation	#Perl	Perl	package Example; sub new { bless {} } sub foo { my ($self, $x) = @_; return 42 + $x; } package main; my $name = "foo"; print Example->new->$name(5), "\n"; # prints "47"	Give a code snippet in #Perl Task Invoke an object method where the name of the method to be invoked can be generated at run time. Related tasks Respond to an unknown method call. Runtime evaluation	christopher/rosetta-code
http://rosettacode.org/wiki/Hamming_numbers	Hamming numbers	Hamming numbers are numbers of the form H = 2i × 3j × 5k where i, j, k ≥ 0 Hamming numbers are also known as ugly numbers and also 5-smooth numbers (numbers whose prime divisors are less or equal to 5). Task Generate the sequence of Hamming numbers, in increasing order. In ...	#MATLAB_.2F_Octave	MATLAB / Octave	n = 40; powers_2 = 2.^[0:n-1]; powers_3 = 3.^[0:n-1]; powers_5 = 5.^[0:n-1]; matrix = powers_2' * powers_3; powers_23 = sort(reshape(matrix,nn,1)); matrix = powers_23 powers_5; powers_235 = sort(reshape(matrix,nnn,1)); % % Remove the integer overflow values. % powers_235 = powers_235(powers_235 > 0); d...	Give a code snippet in #MATLAB_.2F_Octave Hamming numbers are numbers of the form H = 2i × 3j × 5k where i, j, k ≥ 0 Hamming numbers are also known as ugly numbers and also 5-smooth numbers (numbers whose prime divisors are less or equal to 5). Task Generate the sequence of ...	christopher/rosetta-code
http://rosettacode.org/wiki/Map_range	Map range	Given two ranges: [ a 1 , a 2 ] {\displaystyle [a_{1},a_{2}]} and [ b 1 , b 2 ] {\displaystyle [b_{1},b_{2}]} ; then a value s {\displaystyle s} in range [ a 1 , a 2 ] {\displaystyle [a_{1},a_{2}]} is linearly mapped to a value t {\di...	#Maxima	Maxima	maprange(a, b, c, d) := buildq([e: ratsimp(('x - a)*(d - c)/(b - a) + c)], lambda([x], e))$ f: maprange(0, 10, -1, 0);	Give a code snippet in #Maxima Given two ranges: [ a 1 , a 2 ] {\displaystyle [a_{1},a_{2}]} and [ b 1 , b 2 ] {\displaystyle [b_{1},b_{2}]} ; then a value s {\displaystyle s} in range [ a 1 , a 2 ] {\displaystyle [a_{1},a_{2}]} is linearly ...	christopher/rosetta-code
http://rosettacode.org/wiki/Sum_of_a_series	Sum of a series	Compute the nth term of a series, i.e. the sum of the n first terms of the corresponding sequence. Informally this value, or its limit when n tends to infinity, is also called the sum of the series, thus the title of this task. For this task, use: S n = ∑ k = 1 n 1 k 2 {\displa...	#Ada	Ada	with Ada.Text_Io; use Ada.Text_Io; procedure Sum_Series is function F(X : Long_Float) return Long_Float is begin return 1.0 / X**2; end F; package Lf_Io is new Ada.Text_Io.Float_Io(Long_Float); use Lf_Io; Sum : Long_Float := 0.0; subtype Param_Range is Integer range 1..1000; begin for I ...	Give a code snippet in #Ada Compute the nth term of a series, i.e. the sum of the n first terms of the corresponding sequence. Informally this value, or its limit when n tends to infinity, is also called the sum of the series, thus the title of this task. For this task, use: S n = ∑ k = 1 ...	christopher/rosetta-code
http://rosettacode.org/wiki/Arbitrary-precision_integers_(included)	Arbitrary-precision integers (included)	Using the in-built capabilities of your language, calculate the integer value of: 5 4 3 2 ...	#Seed7	Seed7	$ include "seed7_05.s7i"; include "bigint.s7i"; const proc: main is func local var bigInteger: fiveToThePowerOf262144 is 5_ 4 3 2; var string: numberAsString is str(fiveToThePowerOf262144); begin writeln("5432 = " <& numberAsString[..20] <& "..." <& numberAsString[length(n...	Give a code snippet in #Seed7 Using the in-built capabilities of your language, calculate the integer value of: 5 4 3 2 ...	christopher/rosetta-code
http://rosettacode.org/wiki/Mind_boggling_card_trick	Mind boggling card trick	Mind boggling card trick You are encouraged to solve this task according to the task description, using any language you may know. Matt Parker of the "Stand Up Maths channel" has a YouTube video of a card trick that creates a semblance of order from chaos. The task is to simulate the trick in a way that mimics th...	#Raku	Raku	# Generate a shuffled deck my @deck = shuffle; put 'Shuffled deck: ', @deck; my (@discard, @red, @black); # Deal cards following task description deal(@deck, @discard, @red, @black); put 'Discard pile: ', @discard; put '"Red" pile: ', @red; put '"Black" pile: ', @black; # ...	Give a code snippet in #Raku Mind boggling card trick You are encouraged to solve this task according to the task description, using any language you may know. Matt Parker of the "Stand Up Maths channel" has a YouTube video of a card trick that creates a semblance of order from chaos. The task is to simulate the...	christopher/rosetta-code
http://rosettacode.org/wiki/Create_a_file	Create a file	In this task, the job is to create a new empty file called "output.txt" of size 0 bytes and an empty directory called "docs". This should be done twice: once "here", i.e. in the current working directory and once in the filesystem root.	#Wren	Wren	import "io" for File // file is closed automatically after creation File.create("output.txt") {} // check size System.print("%(File.size("output.txt")) bytes")	Give a code snippet in #Wren In this task, the job is to create a new empty file called "output.txt" of size 0 bytes and an empty directory called "docs". This should be done twice: once "here", i.e. in the current working directory and once in the filesystem root.	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 ...	#SenseTalk	SenseTalk	put ("apple", "banana", "cranberry" ,"durian", "eggplant", "grape", "banana", "appl", "blackberry") into fruitList put findInList(fruitList,"banana") // 2 put findInList(fruitList,"banana", true) // 7 put findInList(fruitList,"tomato") // throws an exception function findInList paramList, paramItem, findLast ...	Give a code snippet in #SenseTalk 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/Factorial	Factorial	Definitions The factorial of 0 (zero) is defined as being 1 (unity). The Factorial Function of a positive integer, n, is defined as the product of the sequence: n, n-1, n-2, ... 1 Task Write a function to return the factorial of a number. Solutions can be iterat...	#x86_Assembly	x86 Assembly	global factorial section .text ; Input in ECX register (greater than 0!) ; Output in EAX register factorial: mov eax, 1 .factor: mul ecx loop .factor ret	Give a code snippet in #x86_Assembly Definitions The factorial of 0 (zero) is defined as being 1 (unity). The Factorial Function of a positive integer, n, is defined as the product of the sequence: n, n-1, n-2, ... 1 Task Write a function to return the factorial...	christopher/rosetta-code
http://rosettacode.org/wiki/Copy_a_string	Copy a string	This task is about copying a string. Task Where it is relevant, distinguish between copying the contents of a string versus making an additional reference to an existing string. Other tasks related to string operations: Metrics Array length String length Copy a string Empty string (assignment) Counting W...	#FreeBASIC	FreeBASIC	' FB 1.05.0 Win64 Dim s As String = "This is a string" Dim t As String = s ' a separate copy of the string contents has been made as can be seen from the addresses Print s, StrPtr(s) Print t, StrPtr(t) ' to refer to the same string a pointer needs to be used Dim u As String Ptr = @s Print Print u, StrPtr(u) Sleep	Give a code snippet in #FreeBASIC This task is about copying a string. Task Where it is relevant, distinguish between copying the contents of a string versus making an additional reference to an existing string. Other tasks related to string operations: Metrics Array length String length Copy a string Emp...	christopher/rosetta-code
http://rosettacode.org/wiki/Catalan_numbers	Catalan numbers	Catalan numbers You are encouraged to solve this task according to the task description, using any language you may know. Catalan numbers are a sequence of numbers which can be defined directly: C n = 1 n + 1 ( 2 n n ) = ( 2 n ) ! ( n + 1 ) ! n ! for n ≥ 0. {\displaystyle C...	#FreeBASIC	FreeBASIC	' FB 1.05.0 Win64 Function factorial(n As UInteger) As UInteger If n = 0 Then Return 1 Return n * factorial(n - 1) End Function Function catalan1(n As UInteger) As UInteger Dim prod As UInteger = 1 For i As UInteger = n + 2 To 2 * n prod *= i Next Return prod / factorial(n) End Function Function ...	Give a code snippet in #FreeBASIC Catalan numbers You are encouraged to solve this task according to the task description, using any language you may know. Catalan numbers are a sequence of numbers which can be defined directly: C n = 1 n + 1 ( 2 n n ) = ( 2 n ) ! ( n + 1 ) ! n ! ...	christopher/rosetta-code

http://rosettacode.org/wiki/Day_of_the_week

Day of the week

A company decides that whenever Xmas falls on a Sunday they will give their workers all extra paid holidays so that, together with any public holidays, workers will not have to work the following week (between the 25th of December and the first of January). Task In what years between 2008 and 2121 will the 25th of ...

#REBOL

REBOL

rebol [ Title: "Yuletide Holiday" URL: http://rosettacode.org/wiki/Yuletide_Holiday ] for y 2008 2121 1 [ d: to-date reduce [y 12 25] if 7 = d/weekday [prin [y ""]] ]

Give a code snippet in #REBOL A company decides that whenever Xmas falls on a Sunday they will give their workers all extra paid holidays so that, together with any public holidays, workers will not have to work the following week (between the 25th of December and the first of January). Task In what years between ...

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 ...

#E

E

def bubbleSort(target) { __loop(fn { var changed := false for i in 0..(target.size() - 2) { def [a, b] := target(i, i + 2) if (a > b) { target(i, i + 2) := [b, a] changed := true } } changed }) }

Give a code snippet in #E 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...

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, ...

#Sidef

Sidef

[0, Complex(0, 0)].each {|n| say n**n }

Give a code snippet in #Sidef 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/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 ...

#PHP

PHP

echo levenshtein('kitten','sitting'); echo levenshtein('rosettacode', 'raisethysword');

Give a code snippet in #PHP 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 compu...

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...

#Lua

Lua

function gcd(a,b) return a == 0 and b or gcd(b % a, a) end do local function coerce(a, b) if type(a) == "number" then return rational(a, 1), b end if type(b) == "number" then return a, rational(b, 1) end return a, b end rational = setmetatable({ __add = function(a, b) local a, b = coerce(a, ...

Give a code snippet in #Lua 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...

christopher/rosetta-code

http://rosettacode.org/wiki/Towers_of_Hanoi

Towers of Hanoi

Task Solve the Towers of Hanoi problem with recursion.

#Scala

Scala

def move(n: Int, from: Int, to: Int, via: Int) : Unit = { if (n == 1) { Console.println("Move disk from pole " + from + " to pole " + to) } else { move(n - 1, from, via, to) move(1, from, to, via) move(n - 1, via, to, from) } }

Give a code snippet in #Scala Task Solve the Towers of Hanoi problem with recursion.

christopher/rosetta-code

http://rosettacode.org/wiki/Function_composition

Function composition

Task Create a function, compose, whose two arguments f and g, are both functions with one argument. The result of compose is to be a function of one argument, (lets call the argument x), which works like applying function f to the result of applying function g to x. Example compose...

#Emacs_Lisp

Emacs Lisp

;; lexical-binding: t (defun compose (f g) (lambda (x) (funcall f (funcall g x)))) (let ((func (compose '1+ '1+))) (funcall func 5)) ;=> 7

Give a code snippet in #Emacs_Lisp Task Create a function, compose, whose two arguments f and g, are both functions with one argument. The result of compose is to be a function of one argument, (lets call the argument x), which works like applying function f to the result of applying function ...

christopher/rosetta-code

http://rosettacode.org/wiki/Pascal%27s_triangle

Pascal's triangle

Pascal's triangle is an arithmetic and geometric figure often associated with the name of Blaise Pascal, but also studied centuries earlier in India, Persia, China and elsewhere. Its first few rows look like this: 1 1 1 1 2 1 1 3 3 1 where each element of each row is either 1 or the sum of the two elemen...

#Mathematica.2FWolfram_Language

Mathematica/Wolfram Language

n=7; Column[StringReplace[ToString /@ Replace[MatrixExp[SparseArray[ {Band[{2,1}] -> Range[n-1]},{n,n}]],{x__,0..}->{x},2] ,{"{"|"}"|","->" "}], Center]

Give a code snippet in #Mathematica.2FWolfram_Language Pascal's triangle is an arithmetic and geometric figure often associated with the name of Blaise Pascal, but also studied centuries earlier in India, Persia, China and elsewhere. Its first few rows look like this: 1 1 1 1 2 1 1 3 3 1 where each elem...

christopher/rosetta-code

http://rosettacode.org/wiki/Phrase_reversals

Phrase reversals

Task Given a string of space separated words containing the following phrase: rosetta code phrase reversal Reverse the characters of the string. Reverse the characters of each individual word in the string, maintaining original word order within the string. Reverse the order of each word of the string, maintaini...

#Groovy

Groovy

def phaseReverse = { text, closure -> closure(text.split(/ /)).join(' ')} def text = 'rosetta code phrase reversal' println "Original: $text" println "Reversed: ${phaseReverse(text) { it.reverse().collect { it.reverse() } } }" println "Reversed Words: ${phaseReverse(text) { it.collect { it.reverse() } } }...

Give a code snippet in #Groovy Task Given a string of space separated words containing the following phrase: rosetta code phrase reversal Reverse the characters of the string. Reverse the characters of each individual word in the string, maintaining original word order within the string. Reverse the order of ea...

christopher/rosetta-code

http://rosettacode.org/wiki/Loops/For_with_a_specified_step

Loops/For with a specified step

Task Demonstrate a for-loop where the step-value is greater than one. 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 loop b...

#Frink

Frink

for a = 1 to 100 step 5 println[a]

Give a code snippet in #Frink Task Demonstrate a for-loop where the step-value is greater than one. 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/Inc...

christopher/rosetta-code

http://rosettacode.org/wiki/Palindrome_dates

Palindrome dates

Today (2020-02-02, at the time of this writing) happens to be a palindrome, without the hyphens, not only for those countries which express their dates in the yyyy-mm-dd format but, unusually, also for countries which use the dd-mm-yyyy format. Task Write a program which calculates and shows th...

#AWK

AWK

# syntax: GAWK -f PALINDROME_DATES.AWK BEGIN { show = 15 year_b = 2020 year_e = 9999 split("31,28,31,30,31,30,31,31,30,31,30,31",daynum_array,",") # days per month in non leap year for (y=year_b; y<=year_e; y++) { daynum_array[2] = (y % 400 == 0 || (y % 4 == 0 && y % 100)) ? 29 : 28 fo...

Give a code snippet in #AWK Today (2020-02-02, at the time of this writing) happens to be a palindrome, without the hyphens, not only for those countries which express their dates in the yyyy-mm-dd format but, unusually, also for countries which use the dd-mm-yyyy format. Task Write a program ...

christopher/rosetta-code

http://rosettacode.org/wiki/Quine

Quine

A quine is a self-referential program that can, without any external access, output its own source. A quine (named after Willard Van Orman Quine) is also known as: self-reproducing automata (1972) self-replicating program or self-replicating computer program self-reproducing program ...

#ERRE

ERRE

PROGRAM QUINE BEGIN READ(D$,Y$) LOOP READ(X$) EXIT IF LEN(X$)<1 PRINT(X$) END LOOP RESTORE LOOP READ(X$) EXIT IF LEN(X$)<1 PRINT(D$;CHR$(34);X$;CHR$(34);CHR$(41)) END LOOP PRINT(D$;CHR$(34);CHR$(34);CHR$(41)) PRINT(Y$) DATA("DATA(") DATA("END PROGRAM") DATA("PROGRAM QUINE") DATA("BEGIN") DATA("R...

Give a code snippet in #ERRE A quine is a self-referential program that can, without any external access, output its own source. A quine (named after Willard Van Orman Quine) is also known as: self-reproducing automata (1972) self-replicating program or self-replicating computer program ...

christopher/rosetta-code

http://rosettacode.org/wiki/Globally_replace_text_in_several_files

Globally replace text in several files

Task Replace every occurring instance of a piece of text in a group of text files with another one. For this task we want to replace the text "Goodbye London!" with "Hello New York!" for a list of files.

#AutoHotkey

AutoHotkey

SetWorkingDir %A_ScriptDir% ; Change the working directory to the script's location listFiles := "a.txt|b.txt|c.txt" ; Define a list of files in the current working directory loop, Parse, listFiles, | { ; The above parses the list based on the | character fileread, contents, %A_LoopField% ; Read the file fileDe...

Give a code snippet in #AutoHotkey Task Replace every occurring instance of a piece of text in a group of text files with another one. For this task we want to replace the text "Goodbye London!" with "Hello New York!" for a list of files.

christopher/rosetta-code

http://rosettacode.org/wiki/Factors_of_an_integer

Factors of an 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 |...

#Nanoquery

Nanoquery

n = int(input()) for i in range(1, n / 2) if (n % i = 0) print i + " " end end println n

Give a code snippet in #Nanoquery 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 Operati...

christopher/rosetta-code

http://rosettacode.org/wiki/Write_language_name_in_3D_ASCII

Write language name in 3D ASCII

Task Write/display a language's name in 3D ASCII. (We can leave the definition of "3D ASCII" fuzzy, so long as the result is interesting or amusing, not a cheap hack to satisfy the task.) Related tasks draw a sphere draw a cuboid draw a rotating cube draw a Deathstar

#Common_Lisp

Common Lisp

(ql:quickload :cl-ppcre) (defvar txt " xxxx xxxx x x x x xxxx x x x x xxxx xxxxx x x x x xx xx xx xx x x xx x x x x x x x x x x xx x x xx x x x x x x x x xxx x x x x x x x x x x x x...

Give a code snippet in #Common_Lisp Task Write/display a language's name in 3D ASCII. (We can leave the definition of "3D ASCII" fuzzy, so long as the result is interesting or amusing, not a cheap hack to satisfy the task.) Related tasks draw a sphere draw a cuboid draw a rotating cube draw a Deathstar

christopher/rosetta-code

http://rosettacode.org/wiki/Function_composition

Function composition

Task Create a function, compose, whose two arguments f and g, are both functions with one argument. The result of compose is to be a function of one argument, (lets call the argument x), which works like applying function f to the result of applying function g to x. Example compose...

#REBOL

REBOL

rebol [ Title: "Functional Composition" URL: http://rosettacode.org/wiki/Functional_Composition ] ; "compose" means something else in REBOL, therefore I use a 'compose-functions name. compose-functions: func [ {compose the given functions F and G} f [any-function!] g [any-function!] ] [ func [x] ...

Give a code snippet in #REBOL Task Create a function, compose, whose two arguments f and g, are both functions with one argument. The result of compose is to be a function of one argument, (lets call the argument x), which works like applying function f to the result of applying function g ...

christopher/rosetta-code

http://rosettacode.org/wiki/Read_a_specific_line_from_a_file

Read a specific line from a file

Some languages have special semantics for obtaining a known line number from a file. Task Demonstrate how to obtain the contents of a specific line within a file. For the purpose of this task demonstrate how the contents of the seventh line of a file can be obtained, and store it in a variable or in memory (fo...

#PL.2FI

PL/I

declare text character (1000) varying, line_no fixed; get (line_no); on endfile (f) begin; put skip list ('the specified line does not exist'); go to next; end; get file (f) edit ((text do i = 1 to line_no)) (L); put skip list (text); next: ;

Give a code snippet in #PL.2FI Some languages have special semantics for obtaining a known line number from a file. Task Demonstrate how to obtain the contents of a specific line within a file. For the purpose of this task demonstrate how the contents of the seventh line of a file can be obtained, and store it ...

christopher/rosetta-code

http://rosettacode.org/wiki/Unix/ls

Unix/ls

Task Write a program that will list everything in the current folder, similar to: the Unix utility “ls” [1] or the Windows terminal command “DIR” The output must be sorted, but printing extended details and producing multi-column output is not required. Example output For the list of paths:...

#JavaScript

JavaScript

const fs = require('fs'); fs.readdir('.', (err, names) => names.sort().map( name => console.log(name) ));

Give a code snippet in #JavaScript Task Write a program that will list everything in the current folder, similar to: the Unix utility “ls” [1] or the Windows terminal command “DIR” The output must be sorted, but printing extended details and producing multi-column output is not required. E...

christopher/rosetta-code

http://rosettacode.org/wiki/Comments

Comments

Task Show all ways to include text in a language source file that's completely ignored by the compiler or interpreter. Related tasks Documentation Here_document See also Wikipedia xkcd (Humor: hand gesture denoting // for "commenting out" people.)

#LOLCODE

LOLCODE

OBTW This is a multi line comment TLDR

Give a code snippet in #LOLCODE Task Show all ways to include text in a language source file that's completely ignored by the compiler or interpreter. Related tasks Documentation Here_document See also Wikipedia xkcd (Humor: hand gesture denoting // for "commenting out" people.)

christopher/rosetta-code

http://rosettacode.org/wiki/Hello_world/Newline_omission

Hello world/Newline omission

Some languages automatically insert a newline after outputting a string, unless measures are taken to prevent its output. Task Display the string Goodbye, World! without a trailing newline. Related tasks Hello world/Graphical Hello world/Line Printer Hello world/Standard error Hello world/Text

#Julia

Julia

print("Goodbye, World!")

Give a code snippet in #Julia Some languages automatically insert a newline after outputting a string, unless measures are taken to prevent its output. Task Display the string Goodbye, World! without a trailing newline. Related tasks Hello world/Graphical Hello world/Line Printer Hello world/Stand...

christopher/rosetta-code

http://rosettacode.org/wiki/Arithmetic/Complex

Arithmetic/Complex

A complex number is a number which can be written as: a + b × i {\displaystyle a+b\times i} (sometimes shown as: b + a × i {\displaystyle b+a\times i} where a {\displaystyle a} and b {\displaystyle b} are real numbers, and i {\displaystyle i} is √ -1 Typica...

#Groovy

Groovy

class Complex { final Number real, imag static final Complex i = [0,1] as Complex Complex(Number r, Number i = 0) { (real, imag) = [r, i] } Complex(Map that) { (real, imag) = [that.real ?: 0, that.imag ?: 0] } Complex plus (Complex c) { [real + c.real, imag + c.imag] as Complex } Complex...

Give a code snippet in #Groovy A complex number is a number which can be written as: a + b × i {\displaystyle a+b\times i} (sometimes shown as: b + a × i {\displaystyle b+a\times i} where a {\displaystyle a} and b {\displaystyle b} are real numbers, and i {\displays...

christopher/rosetta-code

http://rosettacode.org/wiki/Kaprekar_numbers

Kaprekar numbers

A positive integer is a Kaprekar number if: It is 1 (unity) The decimal representation of its square may be split once into two parts consisting of positive integers which sum to the original number. Note that a split resulting in a part consisting purely of 0s is not valid, as 0 is not considered positive. ...

#Racket

Racket

#lang racket (define (kaprekar? n) (or (= n 1) (let ([q (sqr n)]) (let loop ((p 10)) (and (<= p q) (or (let-values ([(b a) (quotient/remainder q p)]) (and (> a 0) (= n (+ a b)))) (loop (* p 10)))))))) (filter kaprekar? (range 1 10000)...

Give a code snippet in #Racket A positive integer is a Kaprekar number if: It is 1 (unity) The decimal representation of its square may be split once into two parts consisting of positive integers which sum to the original number. Note that a split resulting in a part consisting purely of 0s is not valid, a...

christopher/rosetta-code

http://rosettacode.org/wiki/Move-to-front_algorithm

Move-to-front algorithm

Given a symbol table of a zero-indexed array of all possible input symbols this algorithm reversibly transforms a sequence of input symbols into an array of output numbers (indices). The transform in many cases acts to give frequently repeated input symbols lower indices which is useful in some compression algorithms...

#zkl

zkl

fcn encode(text){ //-->List st:=["a".."z"].pump(Data); //"abcd..z" as byte array text.reduce(fcn(st,c,sink){ n:=st.index(c); sink.write(n); st.del(n).insert(0,c); },st,sink:=L()); sink; }

Give a code snippet in #zkl Given a symbol table of a zero-indexed array of all possible input symbols this algorithm reversibly transforms a sequence of input symbols into an array of output numbers (indices). The transform in many cases acts to give frequently repeated input symbols lower indices which is useful i...

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...

#AutoHotkey

AutoHotkey

i = 1024 While (i > 0) { output = %output%`n%i% i := Floor(i / 2) } MsgBox % output

Give a code snippet in #AutoHotkey 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/Do...

christopher/rosetta-code

http://rosettacode.org/wiki/Primes_-_allocate_descendants_to_their_ancestors

Primes - allocate descendants to their ancestors

The concept, is to add the decomposition into prime factors of a number to get its 'ancestors'. The objective is to demonstrate that the choice of the algorithm can be crucial in term of performance. This solution could be compared to the solution that would use the decomposition into primes for all the numbers betw...

#C

C

#include <math.h> #include <stdio.h> #include <stdlib.h> #include <string.h> #define MAXPRIME 99 // upper bound for the prime factors #define MAXPARENT 99 // greatest parent number #define NBRPRIMES 30 // max number of prime factors #define NBRANCESTORS 10 // max number of parent's ancestors FILE *...

Give a code snippet in #C The concept, is to add the decomposition into prime factors of a number to get its 'ancestors'. The objective is to demonstrate that the choice of the algorithm can be crucial in term of performance. This solution could be compared to the solution that would use the decomposition into prim...

christopher/rosetta-code

http://rosettacode.org/wiki/Generate_Chess960_starting_position

Generate Chess960 starting position

Chess960 is a variant of chess created by world champion Bobby Fischer. Unlike other variants of the game, Chess960 does not require a different material, but instead relies on a random initial position, with a few constraints: as in the standard chess game, all eight white pawns must be placed on the second rank. W...

#Phix

Phix

with javascript_semantics sequence solutions = {} --integer d = new_dict() for i=1 to factorial(8) do sequence s = permute(i,"RNBQKBNR") -- sequence s = permute(rand(factorial(8),"RNBQKBNR") integer b1 = find('B',s), b2 = find('B',s,b1+1) if and_bits(b2-b1,1)=1 then integer k = find('...

Give a code snippet in #Phix Chess960 is a variant of chess created by world champion Bobby Fischer. Unlike other variants of the game, Chess960 does not require a different material, but instead relies on a random initial position, with a few constraints: as in the standard chess game, all eight white pawns must be...

christopher/rosetta-code

http://rosettacode.org/wiki/Bitmap

Bitmap

Show a basic storage type to handle a simple RGB raster graphics image, and some primitive associated functions. If possible provide a function to allocate an uninitialised image, given its width and height, and provide 3 additional functions: one to fill an image with a plain RGB color, one to set a given pixe...

#Axe

Axe

Buff(768)→Pic1 Fill(Pic1,768,255) Pxl-Off(45,30,Pic1) .Display the bitmap to demonstrate Copy(Pic1) DispGraph Pause 4500 Disp pxl-Test(50,50,Pic1)▶Dec,i

Give a code snippet in #Axe Show a basic storage type to handle a simple RGB raster graphics image, and some primitive associated functions. If possible provide a function to allocate an uninitialised image, given its width and height, and provide 3 additional functions: one to fill an image with a plain RGB colo...

christopher/rosetta-code

http://rosettacode.org/wiki/Password_generator

Password generator

Create a password generation program which will generate passwords containing random ASCII characters from the following groups: lower-case letters: a ──► z upper-case letters: A ──► Z digits: 0 ──► 9 other printable characters: !"#$%&'()*+,-./:;<=>?@[]^_{|}~ (the above ch...

#Prolog

Prolog

:- set_prolog_flag(double_quotes, chars). :- initialization(main, main). main( Argv ) :- opt_spec( Spec ), opt_parse( Spec, Argv, Opts, _ ), ( member( help(true), Opts ) -> show_help ; member( length( Len ), Opts ), member( number( Num ), Opts ), print_set_of_p...

Give a code snippet in #Prolog Create a password generation program which will generate passwords containing random ASCII characters from the following groups: lower-case letters: a ──► z upper-case letters: A ──► Z digits: 0 ──► 9 other printable characters: !"#$%&'()*+,-....

christopher/rosetta-code

http://rosettacode.org/wiki/Munchausen_numbers

Munchausen numbers

A Munchausen number is a natural number n the sum of whose digits (in base 10), each raised to the power of itself, equals n. (Munchausen is also spelled: Münchhausen.) For instance: 3435 = 33 + 44 + 33 + 55 Task Find all Munchausen numbers between 1 and 5000. Also see The OEIS entry: A046253 The ...

#MAD

MAD

NORMAL MODE IS INTEGER DIMENSION P(5) THROUGH CLCPOW, FOR D=0, 1, D.G.5 P(D) = D THROUGH CLCPOW, FOR X=1, 1, X.GE.D CLCPOW P(D) = P(D) * D THROUGH TEST, FOR D1=0, 1, D1.G.5 THROUGH TEST, FOR D2=0, 1, D2.G.5 THROUGH ...

Give a code snippet in #MAD A Munchausen number is a natural number n the sum of whose digits (in base 10), each raised to the power of itself, equals n. (Munchausen is also spelled: Münchhausen.) For instance: 3435 = 33 + 44 + 33 + 55 Task Find all Munchausen numbers between 1 and 5000. Also see T...

christopher/rosetta-code

http://rosettacode.org/wiki/Superellipse

Superellipse

A superellipse is a geometric figure defined as the set of all points (x, y) with | x a | n + | y b | n = 1 , {\displaystyle \left|{\frac {x}{a}}\right|^{n}\!+\left|{\frac {y}{b}}\right|^{n}\!=1,} where n, a, and b are positive numbers. Task Draw a superellipse with n = 2.5, and a...

#EchoLisp

EchoLisp

(lib 'plot) (define (eaxpt x n) (expt (abs x) n)) (define (Ellie x y) (+ (eaxpt (// x 200) 2.5) (eaxpt (// y 200) 2.5) -1)) (plot-xy Ellie -400 -400) → (("x:auto" -400 400) ("y:auto" -400 400))

Give a code snippet in #EchoLisp A superellipse is a geometric figure defined as the set of all points (x, y) with | x a | n + | y b | n = 1 , {\displaystyle \left|{\frac {x}{a}}\right|^{n}\!+\left|{\frac {y}{b}}\right|^{n}\!=1,} where n, a, and b are positive numbers. Task Draw ...

christopher/rosetta-code

http://rosettacode.org/wiki/String_concatenation

String concatenation

String concatenation You are encouraged to solve this task according to the task description, using any language you may know. Task Create a string variable equal to any text value. Create another string variable whose value is the original variable concatenated with another string literal. To illustrate the operat...

#Sparkling

Sparkling

let s1 = "Hello"; let s2 = " world!"; print(s1 .. s2); // prints "Hello world!"

Give a code snippet in #Sparkling String concatenation You are encouraged to solve this task according to the task description, using any language you may know. Task Create a string variable equal to any text value. Create another string variable whose value is the original variable concatenated with another string...

christopher/rosetta-code

http://rosettacode.org/wiki/Call_a_function

Call a function

Task Demonstrate the different syntax and semantics provided for calling a function. This may include: Calling a function that requires no arguments Calling a function with a fixed number of arguments Calling a function with optional arguments Calling a function with a variable number of arguments C...

#Smalltalk

Smalltalk

f valueWithArguments: arguments.

Give a code snippet in #Smalltalk Task Demonstrate the different syntax and semantics provided for calling a function. This may include: Calling a function that requires no arguments Calling a function with a fixed number of arguments Calling a function with optional arguments Calling a function with ...

christopher/rosetta-code

http://rosettacode.org/wiki/Factorial

Factorial

Definitions The factorial of 0 (zero) is defined as being 1 (unity). The Factorial Function of a positive integer, n, is defined as the product of the sequence: n, n-1, n-2, ... 1 Task Write a function to return the factorial of a number. Solutions can be iterat...

#MiniZinc

MiniZinc

var int: factorial(int: n) = let { array[0..n] of var int: factorial; constraint forall(a in 0..n)( factorial[a] == if (a == 0) then 1 else a*factorial[a-1] endif )} in factorial[n]; var int: fac = factorial(6); solve satisfy; output [show(fac),"\n"];

Give a code snippet in #MiniZinc Definitions The factorial of 0 (zero) is defined as being 1 (unity). The Factorial Function of a positive integer, n, is defined as the product of the sequence: n, n-1, n-2, ... 1 Task Write a function to return the factorial of ...

christopher/rosetta-code

http://rosettacode.org/wiki/Increasing_gaps_between_consecutive_Niven_numbers

Increasing gaps between consecutive Niven numbers

Note: Niven numbers are also called Harshad numbers. They are also called multidigital numbers. Niven numbers are positive integers which are evenly divisible by the sum of its digits (expressed in base ten). Evenly divisible means divisible with no remainder. Task find the gap (differen...

#Nim

Nim

import strformat func digitsSum(n, sum: uint64): uint64 = ## Returns the sum of the digits of n given the sum of the digits of n - 1. result = sum + 1 var n = n while n > 0 and n mod 10 == 0: dec result, 9 n = n div 10 func divisible(n, d: uint64): bool {.inline.} = if (d and 1) == 0 and (n and 1)...

Give a code snippet in #Nim Note: Niven numbers are also called Harshad numbers. They are also called multidigital numbers. Niven numbers are positive integers which are evenly divisible by the sum of its digits (expressed in base ten). Evenly divisible means divisible with no remainder. Ta...

christopher/rosetta-code

http://rosettacode.org/wiki/Test_a_function

Test a function

Task Using a well-known testing-specific library/module/suite for your language, write some tests for your language's entry in Palindrome. If your language does not have a testing specific library well known to the language's community then state this or omit the language.

#Pascal

Pascal

# ptest.t use strict; use warnings; use Test; my %tests; BEGIN { # plan tests before loading Palindrome.pm %tests = ( 'A man, a plan, a canal: Panama.' => 1, 'My dog has fleas' => 0, "Madam, I'm Adam." => 1, '1 on 1'...

Give a code snippet in #Pascal Task Using a well-known testing-specific library/module/suite for your language, write some tests for your language's entry in Palindrome. If your language does not have a testing specific library well known to the language's community then state this or omit the language.

christopher/rosetta-code

http://rosettacode.org/wiki/Named_parameters

Named parameters

Create a function which takes in a number of arguments which are specified by name rather than (necessarily) position, and show how to call the function. If the language supports reordering the arguments or optionally omitting some of them, note this. Note: Named parameters relies on being able to use the names give...

#AppleScript

AppleScript

on getName(x) set {firstName, lastName} to {"?", "?"} try set firstName to x's firstName end try try set lastName to x's lastName end try return firstName & ", " & lastName end getName

Give a code snippet in #AppleScript Create a function which takes in a number of arguments which are specified by name rather than (necessarily) position, and show how to call the function. If the language supports reordering the arguments or optionally omitting some of them, note this. Note: Named parameters relie...

christopher/rosetta-code

http://rosettacode.org/wiki/Mouse_position

Mouse position

Task Get the current location of the mouse cursor relative to the active window. Please specify if the window may be externally created.

#Raku

Raku

use java::awt::MouseInfo:from<java>; given MouseInfo.getPointerInfo.getLocation { say .getX, 'x', .getY; }

Give a code snippet in #Raku Task Get the current location of the mouse cursor relative to the active window. Please specify if the window may be externally created.

christopher/rosetta-code

http://rosettacode.org/wiki/N-smooth_numbers

N-smooth numbers

n-smooth numbers are positive integers which have no prime factors > n. The n (when using it in the expression) n-smooth is always prime, there are no 9-smooth numbers. 1 (unity) is always included in n-smooth numbers. 2-smooth numbers are non-negative powers of two. 5-smooth numbers are...

#Sidef

Sidef

func smooth_generator(primes) { var s = primes.len.of { [1] } { var n = s.map { .first }.min { |i| s[i].shift if (s[i][0] == n) s[i] << (n * primes[i]) } * primes.len n } } for p in (primes(2,29)) { var g = smooth_generator(p.primes) say ("Fi...

Give a code snippet in #Sidef n-smooth numbers are positive integers which have no prime factors > n. The n (when using it in the expression) n-smooth is always prime, there are no 9-smooth numbers. 1 (unity) is always included in n-smooth numbers. 2-smooth numbers are non-negative powers ...

christopher/rosetta-code

http://rosettacode.org/wiki/String_concatenation

String concatenation

String concatenation You are encouraged to solve this task according to the task description, using any language you may know. Task Create a string variable equal to any text value. Create another string variable whose value is the original variable concatenated with another string literal. To illustrate the operat...

#Pascal

Pascal

Program StringConcat; Var s, s1 : String; Begin s := 'hello'; writeln(s + ' literal'); s1 := concat(s, ' literal'); { s1 := s + ' literal'; works too, with FreePascal } writeln(s1); End.

Give a code snippet in #Pascal String concatenation You are encouraged to solve this task according to the task description, using any language you may know. Task Create a string variable equal to any text value. Create another string variable whose value is the original variable concatenated with another string li...

christopher/rosetta-code

http://rosettacode.org/wiki/Copy_stdin_to_stdout

Copy stdin to stdout

Create an executable file that copies stdin to stdout, or else a script that does so through the invocation of an interpreter at the command line.

#REXX

REXX

/*REXX pgm copies data from STDIN──►STDOUT (default input stream──►default output stream*/ do while chars()\==0 /*repeat loop until no more characters.*/ call charin , x /*read a char from the input stream. */ call charout , x ...

Give a code snippet in #REXX Create an executable file that copies stdin to stdout, or else a script that does so through the invocation of an interpreter at the command line.

christopher/rosetta-code

http://rosettacode.org/wiki/Split_a_character_string_based_on_change_of_character

Split a character string based on change of character

Task Split a (character) string into comma (plus a blank) delimited strings based on a change of character (left to right). Show the output here (use the 1st example below). Blanks should be treated as any other character (except they are problematic to display clearly). The same applies to commas. Fo...

#8080_Assembly

8080 Assembly

org 100h jmp demo ;;; Split the string under DE on changing characters, ;;; and store the result at HL. split: ldax d ; Load character from string spcopy: mov m,a ; Store in output cpi '$' ; CP/M string terminator rz ; Stop when the end is reached mov b,a ; Store previous character in B inx d ; Increment input...

Give a code snippet in #8080_Assembly Task Split a (character) string into comma (plus a blank) delimited strings based on a change of character (left to right). Show the output here (use the 1st example below). Blanks should be treated as any other character (except they are problematic to display clearl...

christopher/rosetta-code

http://rosettacode.org/wiki/Spinning_rod_animation/Text

Spinning rod animation/Text

Task An animation with the following frames in the following order (if certain characters aren't available or can't be used correctly in the programming language, alternate characters can replace any of these frames) must animate with a delay of 0.25 seconds between each frame, with the previous frame being cleared be...

#M2000_Interpreter

M2000 Interpreter

Module Checkit { n$=lambda$ n=1, a$="|/-\" -> { =mid$(a$, n, 1) n++ if n>4 then n=1 } \\ 1000 is 1 second Every 250 { \\ Print Over: erase line before print. No new line append. Print Over n$() } } CheckIt

Give a code snippet in #M2000_Interpreter Task An animation with the following frames in the following order (if certain characters aren't available or can't be used correctly in the programming language, alternate characters can replace any of these frames) must animate with a delay of 0.25 seconds between each fram...

christopher/rosetta-code

http://rosettacode.org/wiki/GUI_enabling/disabling_of_controls

GUI enabling/disabling of controls

In addition to fundamental GUI component interaction, an application should dynamically enable and disable GUI components, to give some guidance to the user, and prohibit (inter)actions which are inappropriate in the current state of the application. Task Similar to the task GUI component interaction, write a progr...

#NewLISP

NewLISP

; file: gui-enable.lsp ; url: http://rosettacode.org/wiki/GUI_enabling/disabling_of_controls ; author: oofoe 2012-02-02 ; Load library and initialize GUI server: (load (append (env "NEWLISPDIR") "/guiserver.lsp")) (gs:init) ; The "interlock" function maintains GUI consistency by disabling all ; controls, then ...

Give a code snippet in #NewLISP In addition to fundamental GUI component interaction, an application should dynamically enable and disable GUI components, to give some guidance to the user, and prohibit (inter)actions which are inappropriate in the current state of the application. Task Similar to the task GUI com...

christopher/rosetta-code

http://rosettacode.org/wiki/Detect_division_by_zero

Detect division by zero

Task Write a function to detect a divide by zero error without checking if the denominator is zero.

#TXR

TXR

@(do (defun div-check (x y) (catch (/ x y) (numeric_error (msg) 'div-check-failed)))) @(bind good @(div-check 32 8)) @(bind bad @(div-check 42 0))

Give a code snippet in #TXR Task Write a function to detect a divide by zero error without checking if the denominator is zero.

christopher/rosetta-code

http://rosettacode.org/wiki/String_append

String append

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 |...

#MontiLang

MontiLang

|Hello | |world!| swap + print

Give a code snippet in #MontiLang 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 Operati...

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...

#PARI.2FGP

PARI/GP

horner(v,x)={ my(s=0); forstep(i=#v,1,-1,s=s*x+v[i]); s };

Give a code snippet in #PARI.2FGP 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 ) ...

christopher/rosetta-code

http://rosettacode.org/wiki/Abundant_odd_numbers

Abundant odd numbers

An Abundant number is a number n for which the sum of divisors σ(n) > 2n, or, equivalently, the sum of proper divisors (or aliquot sum) s(n) > n. E.G. 12 is abundant, it has the proper divisors 1,2,3,4 & 6 which sum to 16 ( > 12 or n); or alternately, has the sigma sum of ...

#BASIC256

BASIC256

numimpar = 1 contar = 0 sumaDiv = 0 function SumaDivisores(n) # Devuelve la suma de los divisores propios de n suma = 1 i = int(sqr(n)) for d = 2 to i if n % d = 0 then suma += d otroD = n \ d if otroD <> d Then suma += otroD end if Next d Return suma End Function # Encontrar los números requ...

Give a code snippet in #BASIC256 An Abundant number is a number n for which the sum of divisors σ(n) > 2n, or, equivalently, the sum of proper divisors (or aliquot sum) s(n) > n. E.G. 12 is abundant, it has the proper divisors 1,2,3,4 & 6 which sum to 16 ( > 12 or n); or al...

christopher/rosetta-code

http://rosettacode.org/wiki/Smith_numbers

Smith numbers

Smith numbers are numbers such that the sum of the decimal digits of the integers that make up that number is the same as the sum of the decimal digits of its prime factors excluding 1. By definition, all primes are excluded as they (naturally) satisfy this condition! Smith numbers are also known as joke numbers....

#Modula-2

Modula-2

MODULE SmithNumbers; FROM FormatString IMPORT FormatString; FROM Terminal IMPORT WriteString,WriteLn,ReadChar; PROCEDURE SumDigits(n : INTEGER) : INTEGER; VAR sum : INTEGER; BEGIN sum := 0; WHILE n > 0 DO sum := sum + (n MOD 10); n := n DIV 10; END; RETURN sum; END SumDigits; VAR ...

Give a code snippet in #Modula-2 Smith numbers are numbers such that the sum of the decimal digits of the integers that make up that number is the same as the sum of the decimal digits of its prime factors excluding 1. By definition, all primes are excluded as they (naturally) satisfy this condition! Smith numbers a...

christopher/rosetta-code

http://rosettacode.org/wiki/String_matching

String matching

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 |...

#FreeBASIC

FreeBASIC

' FB 1.05.0 Win64 Dim As String s1 = "abracadabra" Dim As String s2 = "abra" Print "First string : "; s1 Print "Second string : "; s2 Print Print "First string begins with second string : "; CBool(s2 = Left(s1, Len(s2))) Dim As Integer i1 = Instr(s1, s2) Dim As Integer i2 Print "First string contains second string...

Give a code snippet in #FreeBASIC 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 Operati...

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...

#D

D

import std.stdio, std.traits; S rot(S)(in S s, in int key) pure nothrow @safe if (isSomeString!S) { auto res = s.dup; foreach (immutable i, ref c; res) { if ('a' <= c && c <= 'z') c = ((c - 'a' + key) % 26 + 'a'); else if ('A' <= c && c <= 'Z') c = ((c - 'A' + key) % ...

Give a code snippet in #D 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)....

christopher/rosetta-code

http://rosettacode.org/wiki/Sum_to_100

Sum to 100

Task Find solutions to the sum to one hundred puzzle. Add (insert) the mathematical operators + or - (plus or minus) before any of the digits in the decimal numeric string 123456789 such that the resulting mathematical expression adds up to a particular sum (in this iconic case, ...

#D

D

import std.stdio; void main() { import std.algorithm : each, max, reduce, sort; import std.range : take; Stat stat = new Stat(); comment("Show all solutions that sum to 100"); immutable givenSum = 100; print(givenSum); comment("Show the sum that has the maximum number of solutions");...

Give a code snippet in #D Task Find solutions to the sum to one hundred puzzle. Add (insert) the mathematical operators + or - (plus or minus) before any of the digits in the decimal numeric string 123456789 such that the resulting mathematical expression adds up to a particular sum...

christopher/rosetta-code

http://rosettacode.org/wiki/Anagrams

Anagrams

When two or more words are composed of the same characters, but in a different order, they are called anagrams. Task[edit] Using the word list at http://wiki.puzzlers.org/pub/wordlists/unixdict.txt, find the sets of words that share the same characters that contain the most words in them. Related tasks Word plays ...

#ABAP

ABAP

report zz_anagrams no standard page heading. define update_progress. call function 'SAPGUI_PROGRESS_INDICATOR' exporting text = &1. end-of-definition. " Selection screen segment allowing the person to choose which file will act as input. selection-screen begin of block file_choice. parameters p_file typ...

Give a code snippet in #ABAP When two or more words are composed of the same characters, but in a different order, they are called anagrams. Task[edit] Using the word list at http://wiki.puzzlers.org/pub/wordlists/unixdict.txt, find the sets of words that share the same characters that contain the most words in th...

christopher/rosetta-code

http://rosettacode.org/wiki/Sort_an_integer_array

Sort an integer array

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 ...

#MUMPS

MUMPS

SORTARRAY(X,SEP) ;X is the list of items to sort ;X1 is the temporary array ;SEP is the separator string between items in the list X ;Y is the returned list ;This routine uses the inherent sorting of the arrays NEW I,X1,Y SET Y="" FOR I=1:1:$LENGTH(X,SEP) SET X1($PIECE(X,SEP,I))="" SET I="" FOR SET I=$O(X1(I)...

Give a code snippet in #MUMPS 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 so...

christopher/rosetta-code

http://rosettacode.org/wiki/Convert_seconds_to_compound_duration

Convert seconds to compound duration

Task Write a function or program which: takes a positive integer representing a duration in seconds as input (e.g., 100), and returns a string which shows the same duration decomposed into: weeks, days, hours, minutes, and seconds. This is detailed below (e.g., "2 hr, 59 sec"). Demonstrat...

#Erlang

Erlang

-module(convert_seconds). -export([test/0]). test() -> lists:map(fun convert/1, [7259, 86400, 6000000]), ok. convert(Seconds) -> io:format( "~7s seconds = ~s\n", [integer_to_list(Seconds), compoundDuration(Seconds)] ). % Compound duration of t seconds. The argument is assumed to be positive. compound...

Give a code snippet in #Erlang Task Write a function or program which: takes a positive integer representing a duration in seconds as input (e.g., 100), and returns a string which shows the same duration decomposed into: weeks, days, hours, minutes, and seconds. This is detailed below (e.g....

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...

#Diego

Diego

with_computer(comp1)_printer(lp1)_text(Hello World!);

Give a code snippet in #Diego 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...

christopher/rosetta-code

http://rosettacode.org/wiki/Loops/For_with_a_specified_step

Loops/For with a specified step

Task Demonstrate a for-loop where the step-value is greater than one. 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 loop b...

#Vim_Script

Vim Script

for i in range(2, 10, 2) echo i endfor

Give a code snippet in #Vim_Script Task Demonstrate a for-loop where the step-value is greater than one. 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 Loop...

christopher/rosetta-code

http://rosettacode.org/wiki/Guess_the_number/With_feedback

Guess the number/With feedback

Task Write a game (computer program) that follows the following rules: The computer chooses a number between given set limits. The player is asked for repeated guesses until the the target number is guessed correctly At each guess, the computer responds with whether the guess is: higher than the target, equal to...

#NewLISP

NewLISP

; guess-number-feedback.lsp ; oofoe 2012-01-19 ; http://rosettacode.org/wiki/Guess_the_number/With_feedback (seed (time-of-day)) ; Initialize random number generator from clock. (setq low -5 high 62 number (+ low (rand (- high low))) found nil ) (print "I'm thinking of a number between " low " a...

Give a code snippet in #NewLISP Task Write a game (computer program) that follows the following rules: The computer chooses a number between given set limits. The player is asked for repeated guesses until the the target number is guessed correctly At each guess, the computer responds with whether the guess is: ...

christopher/rosetta-code

http://rosettacode.org/wiki/Sum_digits_of_an_integer

Sum digits of an integer

Task Take a Natural Number in a given base and return the sum of its digits: 110 sums to 1 123410 sums to 10 fe16 sums to 29 f0e16 sums to 29

#AWK

AWK

#!/usr/bin/awk -f BEGIN { print sumDigits("1") print sumDigits("12") print sumDigits("fe") print sumDigits("f0e") } function sumDigits(num, nDigs, digits, sum, d, dig, val, sum) { nDigs = split(num, digits, "") sum = 0 for (d = 1; d <= nDigs; d++) { dig = digits[d] val...

Give a code snippet in #AWK Task Take a Natural Number in a given base and return the sum of its digits: 110 sums to 1 123410 sums to 10 fe16 sums to 29 f0e16 sums to 29

christopher/rosetta-code

http://rosettacode.org/wiki/DNS_query

DNS query

DNS is an internet service that maps domain names, like rosettacode.org, to IP addresses, like 66.220.0.231. Use DNS to resolve www.kame.net to both IPv4 and IPv6 addresses. Print these addresses.

#D

D

import std.stdio, std.socket; void main() { auto domain = "www.kame.net", port = "80"; auto a = getAddressInfo(domain, port, AddressFamily.INET); writefln("IPv4 address for %s: %s", domain, a[0].address); a = getAddressInfo(domain, port, AddressFamily.INET6); writefln("IPv6 address for %s: %s"...

Give a code snippet in #D DNS is an internet service that maps domain names, like rosettacode.org, to IP addresses, like 66.220.0.231. Use DNS to resolve www.kame.net to both IPv4 and IPv6 addresses. Print these addresses.

christopher/rosetta-code

http://rosettacode.org/wiki/Trigonometric_functions

Trigonometric functions

Task If your language has a library or built-in functions for trigonometry, show examples of: sine cosine tangent inverses (of the above) using the same angle in radians and degrees. For the non-inverse functions, each radian/degree pair should use arguments that evaluate to the same angle (that i...

#Python

Python

Python 3.2.2 (default, Sep 4 2011, 09:51:08) [MSC v.1500 32 bit (Intel)] on win32 Type "copyright", "credits" or "license()" for more information. >>> from math import degrees, radians, sin, cos, tan, asin, acos, atan, pi >>> rad, deg = pi/4, 45.0 >>> print("Sine:", sin(rad), sin(radians(deg))) Sine: 0.707106781186547...

Give a code snippet in #Python Task If your language has a library or built-in functions for trigonometry, show examples of: sine cosine tangent inverses (of the above) using the same angle in radians and degrees. For the non-inverse functions, each radian/degree pair should use arguments that eval...

christopher/rosetta-code

http://rosettacode.org/wiki/Roman_numerals/Encode

Roman numerals/Encode

Task Create a function taking a positive integer as its parameter and returning a string containing the Roman numeral representation of that integer. Modern Roman numerals are written by expressing each digit separately, starting with the left most digit and skipping any digit with a value of zero. In Roman numeral...

#Lua

Lua

romans = { {1000, "M"}, {900, "CM"}, {500, "D"}, {400, "CD"}, {100, "C"}, {90, "XC"}, {50, "L"}, {40, "XL"}, {10, "X"}, {9, "IX"}, {5, "V"}, {4, "IV"}, {1, "I"} } k = io.read() + 0 for _, v in ipairs(romans) do --note that this is -not- ipairs. val, let = unpack(v) while k >= val do k = k - val io.write(let)...

Give a code snippet in #Lua Task Create a function taking a positive integer as its parameter and returning a string containing the Roman numeral representation of that integer. Modern Roman numerals are written by expressing each digit separately, starting with the left most digit and skipping any digit with a value...

christopher/rosetta-code

http://rosettacode.org/wiki/Strassen%27s_algorithm

Strassen's algorithm

Description In linear algebra, the Strassen algorithm (named after Volker Strassen), is an algorithm for matrix multiplication. It is faster than the standard matrix multiplication algorithm and is useful in practice for large matrices, but would be slower than the fastest known algorithms for extremely large ma...

#Julia

Julia

""" Strassen's matrix multiplication algorithm. Use dynamic padding in order to reduce required auxiliary memory. """ function strassen(x::Matrix, y::Matrix) # Check that the sizes of these matrices match. (r1, c1) = size(x) (r2, c2) = size(y) if c1 != r2 error("Multiplying $r1 x $c1 and $r2 x $...

Give a code snippet in #Julia Description In linear algebra, the Strassen algorithm (named after Volker Strassen), is an algorithm for matrix multiplication. It is faster than the standard matrix multiplication algorithm and is useful in practice for large matrices, but would be slower than the fastest known al...

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 |...

#C.2B.2B

C++

#include <iostream> int main() { int a, b; std::cin >> a >> b; std::cout << "a+b = " << a+b << "\n"; std::cout << "a-b = " << a-b << "\n"; std::cout << "a*b = " << a*b << "\n"; std::cout << "a/b = " << a/b << ", remainder " << a%b << "\n"; return 0; }

Give a code snippet in #C.2B.2B 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 Operation...

christopher/rosetta-code

http://rosettacode.org/wiki/Loops/For

Loops/For

“For” loops are used to make some block of code be iterated a number of times, setting a variable or parameter to a monotonically increasing integer value for each execution of the block of code. Common extensions of this allow other counting patterns or iterating over abstract structures other than the integers. ...

#FALSE

FALSE

1[$6-][$[$]["*"1-]#%" "1+]#%

Give a code snippet in #FALSE “For” loops are used to make some block of code be iterated a number of times, setting a variable or parameter to a monotonically increasing integer value for each execution of the block of code. Common extensions of this allow other counting patterns or iterating over abstract structu...

christopher/rosetta-code

http://rosettacode.org/wiki/N-queens_problem

N-queens problem

Solve the eight queens puzzle. You can extend the problem to solve the puzzle with a board of size NxN. For the number of solutions for small values of N, see OEIS: A000170. Related tasks A* search algorithm Solve a Hidato puzzle Solve a Holy Knight's tour Knight's tour Peaceful chess queen armie...

#UNIX_Shell

UNIX Shell

#!/bin/bash # variable declaration typeset -i BoardSize=8 typeset -i p=0 typeset -i total=0 typeset -i board # initialization function init { for (( i=0;i<$BoardSize;i++ )) do (( board[$i]=-1 )) done } # check if queen can be placed function place { typeset -i flag=1 for (( i=...

Give a code snippet in #UNIX_Shell Solve the eight queens puzzle. You can extend the problem to solve the puzzle with a board of size NxN. For the number of solutions for small values of N, see OEIS: A000170. Related tasks A* search algorithm Solve a Hidato puzzle Solve a Holy Knight's tour Knigh...

christopher/rosetta-code

http://rosettacode.org/wiki/Sleep

Sleep

Task Write a program that does the following in this order: Input an amount of time to sleep in whatever units are most natural for your language (milliseconds, seconds, ticks, etc.). This unit should be noted in comments or in a description. Print "Sleeping..." Sleep the main thread for the given amount of time. ...

#LabVIEW

LabVIEW

stdoutnl('Sleeping...') sleep(5000) // Sleep 5 seconds stdoutnl('Awake!')

Give a code snippet in #LabVIEW Task Write a program that does the following in this order: Input an amount of time to sleep in whatever units are most natural for your language (milliseconds, seconds, ticks, etc.). This unit should be noted in comments or in a description. Print "Sleeping..." Sleep the main thre...

christopher/rosetta-code

http://rosettacode.org/wiki/String_interpolation_(included)

String interpolation (included)

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 |...

#Kotlin

Kotlin

// version 1.0.6 fun main(args: Array<String>) { val s = "little" // String interpolation using a simple variable println("Mary had a $s lamb") // String interpolation using an expression (need to wrap it in braces) println("Mary had a ${s.toUpperCase()} lamb") // However if a simple variab...

Give a code snippet in #Kotlin 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/Letter_frequency

Letter frequency

Task Open a text file and count the occurrences of each letter. Some of these programs count all characters (including punctuation), but some only count letters A to Z. Other tasks related to string operations: Metrics Array length String length Copy a string Empty string (assignment) Counting Word frequen...

#PL.2FI

PL/I

frequencies: procedure options (main); declare tallies(26) fixed binary static initial ((26) 0); declare alphabet character (26) static initial ('ABCDEFGHIJKLMNOPQRSTUVWXYZ'); declare c character (1), i fixed binary; declare in file; open file (in) title ('/LETTER.DAT,type(text),recsize(200)') ...

Give a code snippet in #PL.2FI Task Open a text file and count the occurrences of each letter. Some of these programs count all characters (including punctuation), but some only count letters A to Z. Other tasks related to string operations: Metrics Array length String length Copy a string Empty string (as...

christopher/rosetta-code

http://rosettacode.org/wiki/Resistor_mesh

Resistor mesh

Task Given 10×10 grid nodes (as shown in the image) interconnected by 1Ω resistors as shown, find the resistance between points A and B. See also (humor, nerd sniping) xkcd.com cartoon

#Nim

Nim

const S = 10 type NodeKind = enum nodeFree, nodeA, nodeB Node = object v: float fixed: NodeKind Mesh[H, W: static int] = array[H, array[W, Node]] func setBoundary(m: var Mesh) = m[1][1].v = 1.0 m[1][1].fixed = nodeA m[6][7].v = -1.0 m[6][7].fixed = nodeB func calcDiff[H, W: static...

Give a code snippet in #Nim Task Given 10×10 grid nodes (as shown in the image) interconnected by 1Ω resistors as shown, find the resistance between points A and B. See also (humor, nerd sniping) xkcd.com cartoon

christopher/rosetta-code

http://rosettacode.org/wiki/Loops/Wrong_ranges

Loops/Wrong ranges

Loops/Wrong ranges You are encouraged to solve this task according to the task description, using any language you may know. Some languages have syntax or function(s) to generate a range of numeric values from a start value, a stop value, and an increment. The purpose of this task is to select the range syntax/functi...

#C

C

#include <stdio.h> #define TRUE 1 #define FALSE 0 typedef int bool; typedef struct { int start, stop, incr; const char *comment; } S; S examples[9] = { {-2, 2, 1, "Normal"}, {-2, 2, 0, "Zero increment"}, {-2, 2, -1, "Increments away from stop value"}, {-2, 2, 10, "First increment is beyo...

Give a code snippet in #C Loops/Wrong ranges You are encouraged to solve this task according to the task description, using any language you may know. Some languages have syntax or function(s) to generate a range of numeric values from a start value, a stop value, and an increment. The purpose of this task is to sel...

christopher/rosetta-code

http://rosettacode.org/wiki/Sorting_algorithms/Heapsort

Sorting algorithms/Heapsort

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 ...

#Vala

Vala

void swap(int[] array, int i1, int i2) { if (array[i1] == array[i2]) return; var tmp = array[i1]; array[i1] = array[i2]; array[i2] = tmp; } void shift_down(int[] heap, int i, int max) { int i_big, c1, c2; while (i < max) { i_big = i; c1 = (2 * i) + 1; c2 = c1 + 1; if (c1 < max && heap...

Give a code snippet in #Vala 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/Hello_world/Web_server

Hello world/Web server

The browser is the new GUI ! Task Serve our standard text Goodbye, World! to http://localhost:8080/ so that it can be viewed with a web browser. The provided solution must start or implement a server that accepts multiple client connections and serves text as requested. Note that starting a web browser or...

#Modula-2

Modula-2

MODULE access; FROM InOut IMPORT WriteString, WriteLn; BEGIN WriteString ("Content-Type : text/plain"); WriteLn; WriteLn; WriteString ("Hello web wide world."); WriteLn END access.

Give a code snippet in #Modula-2 The browser is the new GUI ! Task Serve our standard text Goodbye, World! to http://localhost:8080/ so that it can be viewed with a web browser. The provided solution must start or implement a server that accepts multiple client connections and serves text as requested. N...

christopher/rosetta-code

http://rosettacode.org/wiki/Accumulator_factory

Accumulator factory

A problem posed by Paul Graham is that of creating a function that takes a single (numeric) argument and which returns another function that is an accumulator. The returned accumulator function in turn also takes a single numeric argument, and returns the sum of all the numeric values passed in so far to that accumulat...

#ActionScript

ActionScript

//Throw an error if a non-number argument is used. (typeof evaluates to // "number" for both integers and reals) function checkType(obj:Object):void { if(typeof obj != "number") throw new ArgumentError("Expected integer or float argument. Recieved " + typeof obj); } function accumulator(sum:Object):Function { ...

Give a code snippet in #ActionScript A problem posed by Paul Graham is that of creating a function that takes a single (numeric) argument and which returns another function that is an accumulator. The returned accumulator function in turn also takes a single numeric argument, and returns the sum of all the numeric val...

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 ...

#Logo

Logo

to comb :n :list if :n = 0 [output [[]]] if empty? :list [output []] output sentence map [sentence first :list ?] comb :n-1 bf :list ~ comb :n bf :list end print comb 3 [0 1 2 3 4]

Give a code snippet in #Logo 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 ...

christopher/rosetta-code

http://rosettacode.org/wiki/Five_weekends

Five weekends

The month of October in 2010 has five Fridays, five Saturdays, and five Sundays. Task Write a program to show all months that have this same characteristic of five full weekends from the year 1900 through 2100 (Gregorian calendar). Show the number of months with this property (there should be 201). Show at leas...

#ERRE

ERRE

PROGRAM FIVE_WEEKENDS DIM M$[12] PROCEDURE MODULO(X,Y->MD) IF Y=0 THEN MD=X ELSE MD=X-Y*INT(X/Y) END IF END PROCEDURE PROCEDURE WD(M,D,Y->RES%) IF M=1 OR M=2 THEN M+=12 Y-=1 END IF MODULO(365*Y+INT(Y/4)-INT(Y/100)+INT(Y/400)+D+INT((153*M+8)/5),7->RES) RES%=RES+1.0 END PROCEDUR...

Give a code snippet in #ERRE The month of October in 2010 has five Fridays, five Saturdays, and five Sundays. Task Write a program to show all months that have this same characteristic of five full weekends from the year 1900 through 2100 (Gregorian calendar). Show the number of months with this property (there...

christopher/rosetta-code

http://rosettacode.org/wiki/FTP

FTP

Task Connect to a server, change directory, list its contents and download a file as binary using the FTP protocol. Use passive mode if available.

#zkl

zkl

zkl: var cURL=Import("zklCurl") zkl: var d=cURL().get("ftp.hq.nasa.gov/pub/issoutreach/Living in Space Stories (MP3 Files)/") L(Data(2,567),1630,23) // downloaded listing, 1630 bytes of header, 23 bytes of trailer zkl: d[0][1630,-23].text -rw-rw-r-- 1 109 space-station 2327118 May 9 2005 09sept_spacepropulsio...

Give a code snippet in #zkl Task Connect to a server, change directory, list its contents and download a file as binary using the FTP protocol. Use passive mode if available.

christopher/rosetta-code

http://rosettacode.org/wiki/Draw_a_sphere

Draw a sphere

Task Draw a sphere. The sphere can be represented graphically, or in ASCII art, depending on the language capabilities. Either static or rotational projection is acceptable for this task. Related tasks draw a cuboid draw a rotating cube write language name in 3D ASCII draw a Deathstar

#XPL0

XPL0

include c:\cxpl\codes; \intrinsic 'code' declarations def R=100, R2=R*R; \radius, in pixels; radius squared def X0=640/2, Y0=480/2; \coordinates of center of screen int X, Y, Z, C, D2; \coords, color, distance from center squared [SetVid($112); \set 640x480x24 ...

Give a code snippet in #XPL0 Task Draw a sphere. The sphere can be represented graphically, or in ASCII art, depending on the language capabilities. Either static or rotational projection is acceptable for this task. Related tasks draw a cuboid draw a rotating cube write language name in 3D ASCII draw a Dea...

christopher/rosetta-code

http://rosettacode.org/wiki/Ordered_partitions

Ordered partitions

In this task we want to find the ordered partitions into fixed-size blocks. This task is related to Combinations in that it has to do with discrete mathematics and moreover a helper function to compute combinations is (probably) needed to solve this task. p a r t i t i o n s ( a r g 1 , a r g 2 , ...

#J

J

require'stats' partitions=: ([,] {L:0 (i.@#@, -. [)&;)/"1@>@,@{@({@comb&.> +/\.)

Give a code snippet in #J In this task we want to find the ordered partitions into fixed-size blocks. This task is related to Combinations in that it has to do with discrete mathematics and moreover a helper function to compute combinations is (probably) needed to solve this task. p a r t i t i o n s ( a r g ...

christopher/rosetta-code

http://rosettacode.org/wiki/Faulhaber%27s_formula

Faulhaber's formula

In mathematics, Faulhaber's formula, named after Johann Faulhaber, expresses the sum of the p-th powers of the first n positive integers as a (p + 1)th-degree polynomial function of n, the coefficients involving Bernoulli numbers. Task Generate the first 10 closed-form expressions, starting with p = 0. R...

#Julia

Julia

module Faulhaber function bernoulli(n::Integer) n ≥ 0 || throw(DomainError(n, "n must be a positive-or-0 number")) a = fill(0 // 1, n + 1) for m in 1:n a[m] = 1 // (m + 1) for j in m:-1:2 a[j - 1] = (a[j - 1] - a[j]) * j end end return ifelse(n != 1, a[1], -a[1]...

Give a code snippet in #Julia In mathematics, Faulhaber's formula, named after Johann Faulhaber, expresses the sum of the p-th powers of the first n positive integers as a (p + 1)th-degree polynomial function of n, the coefficients involving Bernoulli numbers. Task Generate the first 10 closed-form express...

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...

#PL.2FI

PL/I

*process source attributes xref or(!); hencode: Proc Options(main); /*-------------------------------------------------------------------- * 28.12.013 Walter Pachl translated from REXX *-------------------------------------------------------------------*/ Dcl debug Bit(1) Init('0'b); Dcl (i,j,k) Bin Fixed(15); ...

Give a code snippet in #PL.2FI 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/Program_termination

Program termination

Task Show the syntax for a complete stoppage of a program inside a conditional. This includes all threads/processes which are part of your program. Explain the cleanup (or lack thereof) caused by the termination (allocated memory, database connections, open files, object finalizers/destructors, run-on-exit hooks...

#Neko

Neko

/* Program termination, in Neko */ var sys_exit = $loader.loadprim("std@sys_exit", 1) var return_code = 42 if true sys_exit(return_code) $print("Control flow does not make it this far")

Give a code snippet in #Neko Task Show the syntax for a complete stoppage of a program inside a conditional. This includes all threads/processes which are part of your program. Explain the cleanup (or lack thereof) caused by the termination (allocated memory, database connections, open files, object finalizers/...

christopher/rosetta-code

http://rosettacode.org/wiki/Pick_random_element

Pick random element

Demonstrate how to pick a random element from a list.

#zkl

zkl

list:=T("hydrogen", "helium", "lithium", "beryllium", "boron"); list[(0).random(list.len())]

Give a code snippet in #zkl Demonstrate how to pick a random element from a list.

christopher/rosetta-code

http://rosettacode.org/wiki/Stair-climbing_puzzle

Stair-climbing puzzle

From Chung-Chieh Shan (LtU): Your stair-climbing robot has a very simple low-level API: the "step" function takes no argument and attempts to climb one step as a side effect. Unfortunately, sometimes the attempt fails and the robot clumsily falls one step instead. The "step" function detects what happens and returns a...

#Tcl

Tcl

set level 41 set prob 0.5001 proc step {} { global level prob steps incr steps if {rand() < $prob} { incr level 1 return 1 } else { incr level -1 return 0 } }

Give a code snippet in #Tcl From Chung-Chieh Shan (LtU): Your stair-climbing robot has a very simple low-level API: the "step" function takes no argument and attempts to climb one step as a side effect. Unfortunately, sometimes the attempt fails and the robot clumsily falls one step instead. The "step" function detec...

christopher/rosetta-code

http://rosettacode.org/wiki/Faulhaber%27s_formula

Faulhaber's formula

In mathematics, Faulhaber's formula, named after Johann Faulhaber, expresses the sum of the p-th powers of the first n positive integers as a (p + 1)th-degree polynomial function of n, the coefficients involving Bernoulli numbers. Task Generate the first 10 closed-form expressions, starting with p = 0. R...

#Nim

Nim

import math, rationals type Fraction = Rational[int] FaulhaberSequence = seq[Fraction] const Zero = 0 // 1 One = 1 // 1 MinusOne = -1 // 1 Powers = ["⁰", "¹", "²", "³", "⁴", "⁵", "⁶", "⁷", "⁸", "⁹"] #--------------------------------------------------------------------------------------------------- ...

Give a code snippet in #Nim In mathematics, Faulhaber's formula, named after Johann Faulhaber, expresses the sum of the p-th powers of the first n positive integers as a (p + 1)th-degree polynomial function of n, the coefficients involving Bernoulli numbers. Task Generate the first 10 closed-form expressio...

christopher/rosetta-code

http://rosettacode.org/wiki/Death_Star

Death Star

Task Display a region that consists of a large sphere with part of a smaller sphere removed from it as a result of geometric subtraction. (This will basically produce a shape like a "death star".) Related tasks draw a sphere draw a cuboid draw a rotating cube write language name in 3D ASCII

#Lua

Lua

function V3(x,y,z) return {x=x,y=y,z=z} end function dot(v,w) return v.x*w.x + v.y*w.y + v.z*w.z end function norm(v) local m=math.sqrt(dot(v,v)) return V3(v.x/m, v.y/m, v.z/m) end function clamp(n,lo,hi) return math.floor(math.min(math.max(lo,n),hi)) end function hittest(s, x, y) local z = s.r^2 - (x-s.x)^2 - (y-s.y...

Give a code snippet in #Lua Task Display a region that consists of a large sphere with part of a smaller sphere removed from it as a result of geometric subtraction. (This will basically produce a shape like a "death star".) Related tasks draw a sphere draw a cuboid draw a rotating cube write language name...

christopher/rosetta-code

http://rosettacode.org/wiki/Word_ladder

Word ladder

Yet another shortest path problem. Given two words of equal length the task is to transpose the first into the second. Only one letter may be changed at a time and the change must result in a word in unixdict, the minimum number of intermediate words should be used. Demonstrate the following: A boy can be made into ...

#Nim

Nim

import sets, strformat, strutils func isOneAway(word1, word2: string): bool = ## Return true if "word1" and "word2" has only one letter of difference. for i in 0..word1.high: if word1[i] != word2[i]: if result: return false # More than one letter of difference. else: result = true # One ...

Give a code snippet in #Nim Yet another shortest path problem. Given two words of equal length the task is to transpose the first into the second. Only one letter may be changed at a time and the change must result in a word in unixdict, the minimum number of intermediate words should be used. Demonstrate the follow...

christopher/rosetta-code

http://rosettacode.org/wiki/DNS_query

DNS query

DNS is an internet service that maps domain names, like rosettacode.org, to IP addresses, like 66.220.0.231. Use DNS to resolve www.kame.net to both IPv4 and IPv6 addresses. Print these addresses.

#C.2B.2B

C++

#include <boost/asio.hpp> #include <iostream> int main() { int rc {EXIT_SUCCESS}; try { boost::asio::io_service io_service; boost::asio::ip::tcp::resolver resolver {io_service}; auto entries = resolver.resolve({"www.kame.net", ""}); boost::asio::ip::tcp::resolver::iterator entries_end; for (...

Give a code snippet in #C.2B.2B DNS is an internet service that maps domain names, like rosettacode.org, to IP addresses, like 66.220.0.231. Use DNS to resolve www.kame.net to both IPv4 and IPv6 addresses. Print these addresses.

christopher/rosetta-code

http://rosettacode.org/wiki/Evaluate_binomial_coefficients

Evaluate binomial coefficients

This programming task, is to calculate ANY binomial coefficient. However, it has to be able to output ( 5 3 ) {\displaystyle {\binom {5}{3}}} , which is 10. This formula is recommended: ( n k ) = n ! ( n − k ) ! k ! = n ( n − 1 ) ( n − 2 ) … ( n − k + 1 ) k ( k − 1...

#SequenceL

SequenceL

choose(n, k) := product(k + 1 ... n) / product(1 ... n - k);

Give a code snippet in #SequenceL This programming task, is to calculate ANY binomial coefficient. However, it has to be able to output ( 5 3 ) {\displaystyle {\binom {5}{3}}} , which is 10. This formula is recommended: ( n k ) = n ! ( n − k ) ! k ! = n ( n − 1 ) ( ...

christopher/rosetta-code

http://rosettacode.org/wiki/Letter_frequency

Letter frequency

Task Open a text file and count the occurrences of each letter. Some of these programs count all characters (including punctuation), but some only count letters A to Z. Other tasks related to string operations: Metrics Array length String length Copy a string Empty string (assignment) Counting Word frequen...

#Vedit_macro_language

Vedit macro language

File_Open("c:\txt\a_text_file.txt") Update() for (#1='A'; #1<='Z'; #1++) { Out_Reg(103) Char_Dump(#1,NOCR) Out_Reg(CLEAR) #2 = Search(@103, BEGIN+ALL+NOERR) Message(@103) Num_Type(#2) }

Give a code snippet in #Vedit_macro_language Task Open a text file and count the occurrences of each letter. Some of these programs count all characters (including punctuation), but some only count letters A to Z. Other tasks related to string operations: Metrics Array length String length Copy a string Emp...

christopher/rosetta-code

http://rosettacode.org/wiki/Send_an_unknown_method_call

Send an unknown method call

Task Invoke an object method where the name of the method to be invoked can be generated at run time. Related tasks Respond to an unknown method call. Runtime evaluation

#Perl

Perl

package Example; sub new { bless {} } sub foo { my ($self, $x) = @_; return 42 + $x; } package main; my $name = "foo"; print Example->new->$name(5), "\n"; # prints "47"

Give a code snippet in #Perl Task Invoke an object method where the name of the method to be invoked can be generated at run time. Related tasks Respond to an unknown method call. Runtime evaluation

christopher/rosetta-code

http://rosettacode.org/wiki/Hamming_numbers

Hamming numbers

Hamming numbers are numbers of the form H = 2i × 3j × 5k where i, j, k ≥ 0 Hamming numbers are also known as ugly numbers and also 5-smooth numbers (numbers whose prime divisors are less or equal to 5). Task Generate the sequence of Hamming numbers, in increasing order. In ...

#MATLAB_.2F_Octave

MATLAB / Octave

n = 40; powers_2 = 2.^[0:n-1]; powers_3 = 3.^[0:n-1]; powers_5 = 5.^[0:n-1]; matrix = powers_2' * powers_3; powers_23 = sort(reshape(matrix,n*n,1)); matrix = powers_23 * powers_5; powers_235 = sort(reshape(matrix,n*n*n,1)); % % Remove the integer overflow values. % powers_235 = powers_235(powers_235 > 0); d...

Give a code snippet in #MATLAB_.2F_Octave Hamming numbers are numbers of the form H = 2i × 3j × 5k where i, j, k ≥ 0 Hamming numbers are also known as ugly numbers and also 5-smooth numbers (numbers whose prime divisors are less or equal to 5). Task Generate the sequence of ...

christopher/rosetta-code

http://rosettacode.org/wiki/Map_range

Map range

Given two ranges: [ a 1 , a 2 ] {\displaystyle [a_{1},a_{2}]} and [ b 1 , b 2 ] {\displaystyle [b_{1},b_{2}]} ; then a value s {\displaystyle s} in range [ a 1 , a 2 ] {\displaystyle [a_{1},a_{2}]} is linearly mapped to a value t {\di...

#Maxima

Maxima

maprange(a, b, c, d) := buildq([e: ratsimp(('x - a)*(d - c)/(b - a) + c)], lambda([x], e))$ f: maprange(0, 10, -1, 0);

Give a code snippet in #Maxima Given two ranges: [ a 1 , a 2 ] {\displaystyle [a_{1},a_{2}]} and [ b 1 , b 2 ] {\displaystyle [b_{1},b_{2}]} ; then a value s {\displaystyle s} in range [ a 1 , a 2 ] {\displaystyle [a_{1},a_{2}]} is linearly ...

christopher/rosetta-code

http://rosettacode.org/wiki/Sum_of_a_series

Sum of a series

Compute the nth term of a series, i.e. the sum of the n first terms of the corresponding sequence. Informally this value, or its limit when n tends to infinity, is also called the sum of the series, thus the title of this task. For this task, use: S n = ∑ k = 1 n 1 k 2 {\displa...

#Ada

Ada

with Ada.Text_Io; use Ada.Text_Io; procedure Sum_Series is function F(X : Long_Float) return Long_Float is begin return 1.0 / X**2; end F; package Lf_Io is new Ada.Text_Io.Float_Io(Long_Float); use Lf_Io; Sum : Long_Float := 0.0; subtype Param_Range is Integer range 1..1000; begin for I ...

Give a code snippet in #Ada Compute the nth term of a series, i.e. the sum of the n first terms of the corresponding sequence. Informally this value, or its limit when n tends to infinity, is also called the sum of the series, thus the title of this task. For this task, use: S n = ∑ k = 1 ...

christopher/rosetta-code

http://rosettacode.org/wiki/Arbitrary-precision_integers_(included)

Arbitrary-precision integers (included)

Using the in-built capabilities of your language, calculate the integer value of: 5 4 3 2 ...

#Seed7

Seed7

$ include "seed7_05.s7i"; include "bigint.s7i"; const proc: main is func local var bigInteger: fiveToThePowerOf262144 is 5_ ** 4 ** 3 ** 2; var string: numberAsString is str(fiveToThePowerOf262144); begin writeln("5**4**3**2 = " <& numberAsString[..20] <& "..." <& numberAsString[length(n...

Give a code snippet in #Seed7 Using the in-built capabilities of your language, calculate the integer value of: 5 4 3 2 ...

christopher/rosetta-code

http://rosettacode.org/wiki/Mind_boggling_card_trick

Mind boggling card trick

Mind boggling card trick You are encouraged to solve this task according to the task description, using any language you may know. Matt Parker of the "Stand Up Maths channel" has a YouTube video of a card trick that creates a semblance of order from chaos. The task is to simulate the trick in a way that mimics th...

#Raku

Raku

# Generate a shuffled deck my @deck = shuffle; put 'Shuffled deck: ', @deck; my (@discard, @red, @black); # Deal cards following task description deal(@deck, @discard, @red, @black); put 'Discard pile: ', @discard; put '"Red" pile: ', @red; put '"Black" pile: ', @black; # ...

Give a code snippet in #Raku Mind boggling card trick You are encouraged to solve this task according to the task description, using any language you may know. Matt Parker of the "Stand Up Maths channel" has a YouTube video of a card trick that creates a semblance of order from chaos. The task is to simulate the...

christopher/rosetta-code

http://rosettacode.org/wiki/Create_a_file

Create a file

In this task, the job is to create a new empty file called "output.txt" of size 0 bytes and an empty directory called "docs". This should be done twice: once "here", i.e. in the current working directory and once in the filesystem root.

#Wren

Wren

import "io" for File // file is closed automatically after creation File.create("output.txt") {} // check size System.print("%(File.size("output.txt")) bytes")

Give a code snippet in #Wren In this task, the job is to create a new empty file called "output.txt" of size 0 bytes and an empty directory called "docs". This should be done twice: once "here", i.e. in the current working directory and once in the filesystem root.

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 ...

#SenseTalk

SenseTalk

put ("apple", "banana", "cranberry" ,"durian", "eggplant", "grape", "banana", "appl", "blackberry") into fruitList put findInList(fruitList,"banana") // 2 put findInList(fruitList,"banana", true) // 7 put findInList(fruitList,"tomato") // throws an exception function findInList paramList, paramItem, findLast ...

Give a code snippet in #SenseTalk 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/Factorial

Factorial

Definitions The factorial of 0 (zero) is defined as being 1 (unity). The Factorial Function of a positive integer, n, is defined as the product of the sequence: n, n-1, n-2, ... 1 Task Write a function to return the factorial of a number. Solutions can be iterat...

#x86_Assembly

x86 Assembly

global factorial section .text ; Input in ECX register (greater than 0!) ; Output in EAX register factorial: mov eax, 1 .factor: mul ecx loop .factor ret

Give a code snippet in #x86_Assembly Definitions The factorial of 0 (zero) is defined as being 1 (unity). The Factorial Function of a positive integer, n, is defined as the product of the sequence: n, n-1, n-2, ... 1 Task Write a function to return the factorial...

christopher/rosetta-code

http://rosettacode.org/wiki/Copy_a_string

Copy a string

This task is about copying a string. Task Where it is relevant, distinguish between copying the contents of a string versus making an additional reference to an existing string. Other tasks related to string operations: Metrics Array length String length Copy a string Empty string (assignment) Counting W...

#FreeBASIC

FreeBASIC

' FB 1.05.0 Win64 Dim s As String = "This is a string" Dim t As String = s ' a separate copy of the string contents has been made as can be seen from the addresses Print s, StrPtr(s) Print t, StrPtr(t) ' to refer to the same string a pointer needs to be used Dim u As String Ptr = @s Print Print *u, StrPtr(*u) Sleep

Give a code snippet in #FreeBASIC This task is about copying a string. Task Where it is relevant, distinguish between copying the contents of a string versus making an additional reference to an existing string. Other tasks related to string operations: Metrics Array length String length Copy a string Emp...

christopher/rosetta-code

http://rosettacode.org/wiki/Catalan_numbers

Catalan numbers

Catalan numbers You are encouraged to solve this task according to the task description, using any language you may know. Catalan numbers are a sequence of numbers which can be defined directly: C n = 1 n + 1 ( 2 n n ) = ( 2 n ) ! ( n + 1 ) ! n ! for n ≥ 0. {\displaystyle C...

#FreeBASIC

FreeBASIC

' FB 1.05.0 Win64 Function factorial(n As UInteger) As UInteger If n = 0 Then Return 1 Return n * factorial(n - 1) End Function Function catalan1(n As UInteger) As UInteger Dim prod As UInteger = 1 For i As UInteger = n + 2 To 2 * n prod *= i Next Return prod / factorial(n) End Function Function ...

Give a code snippet in #FreeBASIC Catalan numbers You are encouraged to solve this task according to the task description, using any language you may know. Catalan numbers are a sequence of numbers which can be defined directly: C n = 1 n + 1 ( 2 n n ) = ( 2 n ) ! ( n + 1 ) ! n ! ...

christopher/rosetta-code