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/First_perfect_square_in_base_n_with_n_unique_digits	First perfect square in base n with n unique digits	Find the first perfect square in a given base N that has at least N digits and exactly N significant unique digits when expressed in base N. E.G. In base 10, the first perfect square with at least 10 unique digits is 1026753849 (32043²). You may use analytical methods to reduce the search space, but the code must do ...	#Go	Go	package main import ( "fmt" "math/big" "strconv" "time" ) const maxBase = 27 const minSq36 = "1023456789abcdefghijklmnopqrstuvwxyz" const minSq36x = "10123456789abcdefghijklmnopqrstuvwxyz" var bigZero = new(big.Int) var bigOne = new(big.Int).SetUint64(1) func containsAll(sq string, base int) boo...	Give a code snippet in #Go Find the first perfect square in a given base N that has at least N digits and exactly N significant unique digits when expressed in base N. E.G. In base 10, the first perfect square with at least 10 unique digits is 1026753849 (32043²). You may use analytical methods to reduce the search ...	christopher/rosetta-code
http://rosettacode.org/wiki/Arithmetic_evaluation	Arithmetic evaluation	Create a program which parses and evaluates arithmetic expressions. Requirements An abstract-syntax tree (AST) for the expression must be created from parsing the input. The AST must be used in evaluation, also, so the input may not be directly evaluated (e.g. by calling eval or a similar language feature.) The ...	#PicoLisp	PicoLisp	(de ast (Str) (let L (str Str "") (aggregate) ) ) (de aggregate () (let X (product) (while (member (car L) '("+" "-")) (setq X (list (intern (pop 'L)) X (product))) ) X ) ) (de product () (let X (term) (while (member (car L) '("*" "/")) (setq X (list (intern (p...	Give a code snippet in #PicoLisp Create a program which parses and evaluates arithmetic expressions. Requirements An abstract-syntax tree (AST) for the expression must be created from parsing the input. The AST must be used in evaluation, also, so the input may not be directly evaluated (e.g. by calling eval or a...	christopher/rosetta-code
http://rosettacode.org/wiki/Combinations_and_permutations	Combinations and permutations	This page uses content from Wikipedia. The original article was at Combination. 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) This page uses content from Wikipedia. The original article was at P...	#J	J	C=: ! P=: (%&!&x:~ * <:)"0	Give a code snippet in #J This page uses content from Wikipedia. The original article was at Combination. 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) This page uses content from Wikipedia. Th...	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 ...	#Ring	Ring	v = "see substr(`v = ` + char(34) + `@` + char(34) + nl + `@` ,`@`,v)" see substr(`v = ` + char(34) + `@` + char(34) + nl + `@` ,`@`,v)	Give a code snippet in #Ring 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/S-expressions	S-expressions	S-Expressions are one convenient way to parse and store data. Task Write a simple reader and writer for S-Expressions that handles quoted and unquoted strings, integers and floats. The reader should read a single but nested S-Expression from a string and store it in a suitable datastructure (list, array, etc). ...	#APL	APL	pretty⊂(0((3 'Hi')(3 'Bye')(1 'A string')(0((3 'Depth')(2 42))))) ( Hi Bye "A string" ( Depth ...	Give a code snippet in #APL S-Expressions are one convenient way to parse and store data. Task Write a simple reader and writer for S-Expressions that handles quoted and unquoted strings, integers and floats. The reader should read a single but nested S-Expression from a string and store it in a suitable datast...	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...	#Microsoft_Small_Basic	Microsoft Small Basic	TextWindow.Write("Number of rows? ") r = TextWindow.ReadNumber() For i = 0 To r - 1 c = 1 For k = 0 To i TextWindow.CursorLeft = (k + 1) * 4 - Text.GetLength(c) TextWindow.Write(c) c = c * (i - k) / (k + 1) EndFor TextWindow.WriteLine("") EndFor	Give a code snippet in #Microsoft_Small_Basic 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 ea...	christopher/rosetta-code
http://rosettacode.org/wiki/Partial_function_application	Partial function application	Partial function application is the ability to take a function of many parameters and apply arguments to some of the parameters to create a new function that needs only the application of the remaining arguments to produce the equivalent of applying all arguments to the original function. E.g: Given values v1, v2 ...	#ALGOL_68	ALGOL 68	MODE SET = FLEX[0]INT; MODE F = PROC(INT)INT, FS = PROC(SET)SET; PROC fs = (F f, SET set)SET: ( [LWB set:UPB set]INT out; FOR i FROM LWB set TO UPB set DO out[i]:=f(set[i]) OD; out ); PROC f1 = (INT value)INT: value * 2, f2 = (INT value)INT: value ** 2; FS fsf1 = fs(f1,), fsf2 = fs(f2,); [4...	Give a code snippet in #ALGOL_68 Partial function application is the ability to take a function of many parameters and apply arguments to some of the parameters to create a new function that needs only the application of the remaining arguments to produce the equivalent of applying all arguments to the original func...	christopher/rosetta-code
http://rosettacode.org/wiki/The_ISAAC_Cipher	The ISAAC Cipher	ISAAC is a cryptographically secure pseudo-random number generator (CSPRNG) and stream cipher. It was developed by Bob Jenkins from 1993 (http://burtleburtle.net/bob/rand/isaac.html) and placed in the Public Domain. ISAAC is fast - especially when optimised - and portable to most architectures in nearly all programming...	#Nim	Nim	import strutils type IMode = enum iEncrypt, iDecrypt State = object # Internal. mm: array[256, uint32] aa, bb, cc: uint32 # External. randrsl: array[256, uint32] randcnt: uint32 proc isaac(s: var State) = inc s.cc # "cc" just gets incremented once per 256 results s.bb ...	Give a code snippet in #Nim ISAAC is a cryptographically secure pseudo-random number generator (CSPRNG) and stream cipher. It was developed by Bob Jenkins from 1993 (http://burtleburtle.net/bob/rand/isaac.html) and placed in the Public Domain. ISAAC is fast - especially when optimised - and portable to most architectu...	christopher/rosetta-code
http://rosettacode.org/wiki/File_size	File size	Verify the size of a file called input.txt for a file in the current working directory, and another one in the file system root.	#X86_Assembly	X86 Assembly	; x86_64 linux nasm section .data localFileName: db "input.txt", 0 rootFileName: db "/initrd.img", 0 section .text global _start _start: ; open file in current dir mov rax, 2 mov rdi, localFileName xor rsi, rsi mov rdx, 0 syscall push rax mov rdi, rax ; file descriptior mov rsi, 0 ; offs...	Give a code snippet in #X86_Assembly Verify the size of a file called input.txt for a file in the current working directory, and another one in the file system root.	christopher/rosetta-code
http://rosettacode.org/wiki/Deconvolution/2D%2B	Deconvolution/2D+	This task is a straightforward generalization of Deconvolution/1D to higher dimensions. For example, the one dimensional case would be applicable to audio signals, whereas two dimensions would pertain to images. Define the discrete convolution in d {\displaystyle {\mathit {d}}} dimensions of two functions ...	#Python	Python	""" https://rosettacode.org/wiki/Deconvolution/2D%2B Working on 3 dimensional example using test data from the RC task. Python fft: https://docs.scipy.org/doc/numpy/reference/routines.fft.html """ import numpy import pprint h = [ [[-6, -8, -5, 9], [-7, 9, -6, -8], [2, -7, 9, 8]], [[7, 4, 4...	Give a code snippet in #Python This task is a straightforward generalization of Deconvolution/1D to higher dimensions. For example, the one dimensional case would be applicable to audio signals, whereas two dimensions would pertain to images. Define the discrete convolution in d {\displaystyle {\mathit {d}}}...	christopher/rosetta-code
http://rosettacode.org/wiki/Four_bit_adder	Four bit adder	Task "Simulate" a four-bit adder. This design can be realized using four 1-bit full adders. Each of these 1-bit full adders can be built with two half adders and an or gate. ; Finally a half adder can be made using an xor gate and an and gate. The xor gate can be made using two nots, two ands ...	#Fortran	Fortran	module logic implicit none contains function xor(a, b) logical :: xor logical, intent(in) :: a, b xor = (a .and. .not. b) .or. (b .and. .not. a) end function xor function halfadder(a, b, c) logical :: halfadder logical, intent(in) :: a, b logical, intent(out) :: c halfadder = xor(a, b) c = ...	Give a code snippet in #Fortran Task "Simulate" a four-bit adder. This design can be realized using four 1-bit full adders. Each of these 1-bit full adders can be built with two half adders and an or gate. ; Finally a half adder can be made using an xor gate and an and gate. The xor gate can be mad...	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.	#REXX	REXX	/REXX program stresses various REXX functions (BIFs), many BIFs are used as variables. / signal=(interpret=value); value=(interpret<parse); do upper=value to value; end exit=upperupperupper*upper-value-upper; say=' '; return=say say say; with.=signal do then=value to exit; pull=''; do otherwise= upper to then-, val...	Give a code snippet in #REXX 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/Parse_an_IP_Address	Parse an IP Address	The purpose of this task is to demonstrate parsing of text-format IP addresses, using IPv4 and IPv6. Taking the following as inputs: 127.0.0.1 The "localhost" IPv4 address 127.0.0.1:80 The "localhost" IPv4 address, with a specified port (80) ::1 The "localhost" IPv6 address [::1]:80 The "localhost" IPv6...	#Raku	Raku	grammar IP_Addr { token TOP { ^ [ <IPv4> \| <IPv6> ] $ } token IPv4 { [ <d8> +% '.' ] <?{ $<d8> == 4 }> <port>? { @*by8 = @$<d8> } } token IPv6 { \| <ipv6> \| '[' <ipv6> ']' <port> } token ipv6 { \| <h16> +% ':' <?{ $<h16> == 8 }> ...	Give a code snippet in #Raku The purpose of this task is to demonstrate parsing of text-format IP addresses, using IPv4 and IPv6. Taking the following as inputs: 127.0.0.1 The "localhost" IPv4 address 127.0.0.1:80 The "localhost" IPv4 address, with a specified port (80) ::1 The "localhost" IPv6 address ...	christopher/rosetta-code
http://rosettacode.org/wiki/Strong_and_weak_primes	Strong and weak primes	Definitions (as per number theory) The prime(p) is the pth prime. prime(1) is 2 prime(4) is 7 A strong prime is when prime(p) is > [prime(p-1) + prime(p+1)] ÷ 2 A weak prime is when prime(p) is < [prime(p-1) + prime(p+1)] ÷ 2 Note that the defin...	#Ring	Ring	load "stdlib.ring" see "working..." + nl p = 0 num = 0 pr1 = 37 pr2 = 38 limit1 = 457 limit2 = 1000000 limit3 = 10000000 primes = [] see "first 36 strong primes:" + nl while true p = p + 1 if isprime(p) if p < limit1 add(primes,p) else exit ok ...	Give a code snippet in #Ring Definitions (as per number theory) The prime(p) is the pth prime. prime(1) is 2 prime(4) is 7 A strong prime is when prime(p) is > [prime(p-1) + prime(p+1)] ÷ 2 A weak prime is when prime(p) is < [prime(p-1) + prime(p...	christopher/rosetta-code
http://rosettacode.org/wiki/Iterated_digits_squaring	Iterated digits squaring	If you add the square of the digits of a Natural number (an integer bigger than zero), you always end with either 1 or 89: 15 -> 26 -> 40 -> 16 -> 37 -> 58 -> 89 7 -> 49 -> 97 -> 130 -> 10 -> 1 An example in Python: >>> step = lambda x: sum(int(d) ** 2 for d in str(x)) >>> iterate = lambda x: x if x in [1, 89] else i...	#Wren	Wren	var endsWith89 = Fn.new { \|n\| var digit = 0 var sum = 0 while (true) { while (n > 0) { digit = n % 10 sum = sum + digit*digit n = (n/10).floor } if (sum == 89) return true if (sum == 1) return false n = sum sum = 0 } } ...	Give a code snippet in #Wren If you add the square of the digits of a Natural number (an integer bigger than zero), you always end with either 1 or 89: 15 -> 26 -> 40 -> 16 -> 37 -> 58 -> 89 7 -> 49 -> 97 -> 130 -> 10 -> 1 An example in Python: >>> step = lambda x: sum(int(d) ** 2 for d in str(x)) >>> iterate = lamb...	christopher/rosetta-code
http://rosettacode.org/wiki/String_case	String case	Task Take the string alphaBETA and demonstrate how to convert it to: upper-case and lower-case Use the default encoding of a string literal or plain ASCII if there is no string literal in your language. Note: In some languages alphabets toLower and toUpper is not reversable. Show any additional...	#Swift	Swift	import Foundation println("alphaBETA".uppercaseString) println("alphaBETA".lowercaseString) println("foO BAr".capitalizedString)	Give a code snippet in #Swift Task Take the string alphaBETA and demonstrate how to convert it to: upper-case and lower-case Use the default encoding of a string literal or plain ASCII if there is no string literal in your language. Note: In some languages alphabets toLower and toUpper is not r...	christopher/rosetta-code
http://rosettacode.org/wiki/Matrix_multiplication	Matrix multiplication	Task Multiply two matrices together. They can be of any dimensions, so long as the number of columns of the first matrix is equal to the number of rows of the second matrix.	#M2000_Interpreter	M2000 Interpreter	Module CheckMatMult { \\ Matrix Multiplication \\ we use array pointers so we pass arrays byvalue but change this by reference \\ this can be done because always arrays passed by reference, \\ and Read statement decide if this goes to a pointer of array or copied to a local array \\ the first line of code for Ma...	Give a code snippet in #M2000_Interpreter Task Multiply two matrices together. They can be of any dimensions, so long as the number of columns of the first matrix is equal to the number of rows of the second matrix.	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...	#Vedit_macro_language	Vedit macro language	File_Open("example.txt", BROWSE) Goto_Line(7) if (Cur_Line < 7) { Statline_Message("File contains too few lines") } else { if (At_EOL) { Statline_Message("Empty line") } Reg_Copy(10, 1) } Buf_Close(NOMSG)	Give a code snippet in #Vedit_macro_language 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, ...	christopher/rosetta-code
http://rosettacode.org/wiki/Empty_program	Empty program	Task Create the simplest possible program that is still considered "correct."	#Computer.2Fzero_Assembly	Computer/zero Assembly	STP	Give a code snippet in #Computer.2Fzero_Assembly Task Create the simplest possible program that is still considered "correct."	christopher/rosetta-code
http://rosettacode.org/wiki/Singly-linked_list/Element_definition	Singly-linked list/Element definition	singly-linked list See also Array Associative array: Creation, Iteration Collections Compound data type Doubly-linked list: Definition, Element definition, Element insertion, List Traversal, Element Removal Linked list Queue: Definition, Usage Set Singly-linked list: Element definition, Element insertion, Lis...	#Fortran	Fortran	type node real :: data type( node ), pointer :: next => null() end type node ! !. . . . ! type( node ) :: head	Give a code snippet in #Fortran singly-linked list See also Array Associative array: Creation, Iteration Collections Compound data type Doubly-linked list: Definition, Element definition, Element insertion, List Traversal, Element Removal Linked list Queue: Definition, Usage Set Singly-linked list: Element d...	christopher/rosetta-code
http://rosettacode.org/wiki/Old_lady_swallowed_a_fly	Old lady swallowed a fly	Task Present a program which emits the lyrics to the song I Knew an Old Lady Who Swallowed a Fly, taking advantage of the repetitive structure of the song's lyrics. This song has multiple versions with slightly different lyrics, so all these programs might not emit identical output. Other tasks related to st...	#Phix	Phix	with javascript_semantics sequence lines = {"Perhaps she'll die!\n"}, animals = {} procedure swallow(string animal, second_line, integer permanent_second_line=TRUE) printf(1,"There was an old lady who swallowed a %s,\n%s\n",{animal,second_line}) if length(animals)!=0 then lines = prepend(lines,sprint...	Give a code snippet in #Phix Task Present a program which emits the lyrics to the song I Knew an Old Lady Who Swallowed a Fly, taking advantage of the repetitive structure of the song's lyrics. This song has multiple versions with slightly different lyrics, so all these programs might not emit identical output....	christopher/rosetta-code
http://rosettacode.org/wiki/Next_highest_int_from_digits	Next highest int from digits	Given a zero or positive integer, the task is to generate the next largest integer using only the given digits*1. Numbers will not be padded to the left with zeroes. Use all given digits, with their given multiplicity. (If a digit appears twice in the input number, it should appear twice in the result). If th...	#J	J	permutations=: A.&i.~ ! ordered_numbers_from_digits=: [: /:~ ({~ permutations@#)&.": next_highest=: (>:@i:~ { 0 ,~ ]) ordered_numbers_from_digits (,. next_highest)&>0 9 12 21 12453 738440 45072010 95322020 0 0 9 0 12 21 21 0 12453 12534 738440 ...	Give a code snippet in #J Given a zero or positive integer, the task is to generate the next largest integer using only the given digits*1. Numbers will not be padded to the left with zeroes. Use all given digits, with their given multiplicity. (If a digit appears twice in the input number, it should appear twi...	christopher/rosetta-code
http://rosettacode.org/wiki/Hailstone_sequence	Hailstone sequence	The Hailstone sequence of numbers can be generated from a starting positive integer, n by: If n is 1 then the sequence ends. If n is even then the next n of the sequence = n/2 If n is odd then the next n of the sequence = (3 * n) + 1 The (unproven) Collatz conje...	#FALSE	FALSE	[$1&$[%3*1+0~]?~[2/]?]n: [[$." "$1>][n;!]#%]s: [1\[$1>][\1+\n;!]#%]c: 27s;! 27c;!." " 0m:0f: 1[$100000\>][$c;!$m;>[m:$f:0]?%1+]#% f;." has hailstone sequence length "m;.	Give a code snippet in #FALSE The Hailstone sequence of numbers can be generated from a starting positive integer, n by: If n is 1 then the sequence ends. If n is even then the next n of the sequence = n/2 If n is odd then the next n of the sequence = (3 * n) + 1 ...	christopher/rosetta-code
http://rosettacode.org/wiki/Odd_word_problem	Odd word problem	Task Write a program that solves the odd word problem with the restrictions given below. Description You are promised an input stream consisting of English letters and punctuations. It is guaranteed that: the words (sequence of consecutive letters) are delimited by one and only one punctuation, the stream will...	#Ring	Ring	# Project : Odd word problem test = "what,is,the;meaning,of:life." n1 = 1 testarr = [] testorigin = test test = substr(test, ",", " ") test = substr(test, ";", " ") test = substr(test, ":", " ") test = substr(test, ".", " ") while true n2 = substring(test, " ", n1) n3 = substring(test, " ", n2 + 1) ...	Give a code snippet in #Ring Task Write a program that solves the odd word problem with the restrictions given below. Description You are promised an input stream consisting of English letters and punctuations. It is guaranteed that: the words (sequence of consecutive letters) are delimited by one and only one...	christopher/rosetta-code
http://rosettacode.org/wiki/Loops/Infinite	Loops/Infinite	Task Print out SPAM followed by a newline in an infinite loop. Related tasks Loop over multiple arrays simultaneously Loops/Break Loops/Continue Loops/Do-while Loops/Downward for Loops/For Loops/For with a specified step Loops/Foreach Loops/Increment loop index within l...	#Draco	Draco	proc nonrec main() void: while true do writeln("SPAM") od corp	Give a code snippet in #Draco Task Print out SPAM followed by a newline in an infinite loop. Related tasks Loop over multiple arrays simultaneously Loops/Break Loops/Continue Loops/Do-while Loops/Downward for Loops/For Loops/For with a specified step Loops/Foreach Loop...	christopher/rosetta-code
http://rosettacode.org/wiki/Smallest_number_k_such_that_k%2B2%5Em_is_composite_for_all_m_less_than_k	Smallest number k such that k+2^m is composite for all m less than k	Generate the sequence of numbers a(k), where each k is the smallest positive integer such that k + 2m is composite for every positive integer m less than k. For example Suppose k == 7; test m == 1 through m == 6. If any are prime, the test fails. Is 7 + 21 (9) prime? False Is 7 + 22 (11) prime? True So 7 is not a...	#Raku	Raku	put (1..∞).hyper(:250batch).map(* × 2 + 1).grep( -> $k { !(1 ..^ $k).first: ($k + 1 +< *).is-prime } )[^5]	Give a code snippet in #Raku Generate the sequence of numbers a(k), where each k is the smallest positive integer such that k + 2m is composite for every positive integer m less than k. For example Suppose k == 7; test m == 1 through m == 6. If any are prime, the test fails. Is 7 + 21 (9) prime? False Is 7 + 22 (...	christopher/rosetta-code
http://rosettacode.org/wiki/Entropy	Entropy	Task Calculate the Shannon entropy H of a given input string. Given the discrete random variable X {\displaystyle X} that is a string of N {\displaystyle N} "symbols" (total characters) consisting of n {\displaystyle n} different characters (n=2 for binary), the Shannon entropy of X in bit...	#OCaml	OCaml	(* generic OCaml, using a mutable Hashtbl ) ( pre-bake & return an inner-loop function to bin & assemble a character frequency map *) let get_fproc (m: (char, int) Hashtbl.t) :(char -> unit) = (fun (c:char) -> try Hashtbl.replace m c ( (Hashtbl.find m c) + 1) with Not_fou...	Give a code snippet in #OCaml Task Calculate the Shannon entropy H of a given input string. Given the discrete random variable X {\displaystyle X} that is a string of N {\displaystyle N} "symbols" (total characters) consisting of n {\displaystyle n} different characters (n=2 for binary), ...	christopher/rosetta-code
http://rosettacode.org/wiki/Averages/Arithmetic_mean	Averages/Arithmetic mean	Task[edit] Write a program to find the mean (arithmetic average) of a numeric vector. In case of a zero-length input, since the mean of an empty set of numbers is ill-defined, the program may choose to behave in any way it deems appropriate, though if the programming language has an established convention for conveyin...	#0815	0815	{x{+=<:2:x/%<:d:~$<:01:~><:02:~><:03:~><:04:~><:05:~><:06:~><:07:~><:08: ~><:09:~><:0a:~><:0b:~><:0c:~><:0d:~><:0e:~><:0f:~><:10:~><:11:~><:12:~> <:13:~><:14:~><:15:~><:16:~><:17:~><:18:~><:19:~><:ffffffffffffffff:~>{x {+>}:8f:{&={+>{~>&=x<:ffffffffffffffff:/#:8f:{{=<:19:x/%	Give a code snippet in #0815 Task[edit] Write a program to find the mean (arithmetic average) of a numeric vector. In case of a zero-length input, since the mean of an empty set of numbers is ill-defined, the program may choose to behave in any way it deems appropriate, though if the programming language has an estab...	christopher/rosetta-code
http://rosettacode.org/wiki/Here_document	Here document	A here document (or "heredoc") is a way of specifying a text block, preserving the line breaks, indentation and other whitespace within the text. Depending on the language being used, a here document is constructed using a command followed by "<<" (or some other symbol) followed by a token string. The text ...	#CoffeeScript	CoffeeScript	myDoc = ''' Single-quoted heredocs allows no '#{foo}' interpolation. This behavior is similar to single-quoted strings. ''' doc2 = """ However, double-quoted heredocs do allow these. See it in action: Content: "#{myDoc}" """ console.log doc2	Give a code snippet in #CoffeeScript A here document (or "heredoc") is a way of specifying a text block, preserving the line breaks, indentation and other whitespace within the text. Depending on the language being used, a here document is constructed using a command followed by "<<" (or some other symbol) ...	christopher/rosetta-code
http://rosettacode.org/wiki/Determine_if_only_one_instance_is_running	Determine if only one instance is running	This task is to determine if there is only one instance of an application running. If the program discovers that an instance of it is already running, then it should display a message indicating that it is already running and exit.	#Bash_Shell	Bash Shell	local fd=${2:-200} # create lock file eval "exec $fd>/tmp/my_lock.lock" # acquire the lock, or fail flock -nx $fd \ && # do something if you got the lock \ \|\| # do something if you did not get the lock	Give a code snippet in #Bash_Shell This task is to determine if there is only one instance of an application running. If the program discovers that an instance of it is already running, then it should display a message indicating that it is already running and exit.	christopher/rosetta-code
http://rosettacode.org/wiki/Strip_comments_from_a_string	Strip comments from a string	Strip comments from a string You are encouraged to solve this task according to the task description, using any language you may know. The task is to remove text that follow any of a set of comment markers, (in these examples either a hash or a semicolon) from a string or input line. Whitespace debacle: There is s...	#AutoIt	AutoIt	Dim $Line1 = "apples, pears # and bananas" Dim $Line2 = "apples, pears ; and bananas" _StripAtMarker($Line1) _StripAtMarker($Line2) Func _StripAtMarker($_Line, $sMarker='# ;') Local $aMarker = StringSplit($sMarker, ' ') Local $iPos For $i = 1 To $aMarker[0] $iPos = StringInStr($_Line, $aMarker[$i]) If $iPo...	Give a code snippet in #AutoIt Strip comments from a string You are encouraged to solve this task according to the task description, using any language you may know. The task is to remove text that follow any of a set of comment markers, (in these examples either a hash or a semicolon) from a string or input line. ...	christopher/rosetta-code
http://rosettacode.org/wiki/Brownian_tree	Brownian tree	Brownian tree You are encouraged to solve this task according to the task description, using any language you may know. Task Generate and draw a Brownian Tree. A Brownian Tree is generated as a result of an initial seed, followed by the interaction of two processes. The initial "seed" is placed somewhere wi...	#PicoLisp	PicoLisp	(load "@lib/simul.l") (de brownianTree (File Size Cnt) (let Img (grid Size Size) (put Img (/ Size 2) (/ Size 2) 'pix T) (use (P Q) (do Cnt (setq P (get Img (rand 1 Size) (rand 1 Size))) (loop (setq Q ((if2 (rand T) (rand T) north east south west) P)) ...	Give a code snippet in #PicoLisp Brownian tree You are encouraged to solve this task according to the task description, using any language you may know. Task Generate and draw a Brownian Tree. A Brownian Tree is generated as a result of an initial seed, followed by the interaction of two processes. The ini...	christopher/rosetta-code
http://rosettacode.org/wiki/Generate_lower_case_ASCII_alphabet	Generate lower case ASCII alphabet	Task Generate an array, list, lazy sequence, or even an indexable string of all the lower case ASCII characters, from a to z. If the standard library contains such a sequence, show how to access it, but don't fail to show how to generate a similar sequence. For this basic task use a reliable style of coding, a sty...	#PHP	PHP	<?php $lower = range('a', 'z'); var_dump($lower); ?>	Give a code snippet in #PHP Task Generate an array, list, lazy sequence, or even an indexable string of all the lower case ASCII characters, from a to z. If the standard library contains such a sequence, show how to access it, but don't fail to show how to generate a similar sequence. For this basic task use a re...	christopher/rosetta-code
http://rosettacode.org/wiki/Hello_world/Text	Hello world/Text	Hello world/Text is part of Short Circuit's Console Program Basics selection. Task Display the string Hello world! on a text console. Related tasks Hello world/Graphical Hello world/Line Printer Hello world/Newbie Hello world/Newline omission Hello world/Standard error Hello world/Web server	#Morfa	Morfa	import morfa.io.print; func main(): void { println("Hello world!"); }	Give a code snippet in #Morfa Hello world/Text is part of Short Circuit's Console Program Basics selection. Task Display the string Hello world! on a text console. Related tasks Hello world/Graphical Hello world/Line Printer Hello world/Newbie Hello world/Newline omission Hello world/Standard error ...	christopher/rosetta-code
http://rosettacode.org/wiki/Convex_hull	Convex hull	Find the points which form a convex hull from a set of arbitrary two dimensional points. For example, given the points (16,3), (12,17), (0,6), (-4,-6), (16,6), (16,-7), (16,-3), (17,-4), (5,19), (19,-8), (3,16), (12,13), (3,-4), (17,5), (-3,15), (-3,-9), (0,11), (-9,-3), (-4,-2) and (12,10) the convex hull would be (-...	#Julia	Julia	# v1.0.4 # https://github.com/JuliaPolyhedra/Polyhedra.jl/blob/master/examples/operations.ipynb using Polyhedra, CDDLib A = vrep([[16,3], [12,17], [0,6], [-4,-6], [16,6], [16,-7], [16,-3], [17,-4], [5,19], [19,-8], [3,16], [12,13], [3,-4], [17,5], [-3,15], [-3,-9], [0,11], [-9,-3], [-4,-2], [12,10]]) P = polyhedron(...	Give a code snippet in #Julia Find the points which form a convex hull from a set of arbitrary two dimensional points. For example, given the points (16,3), (12,17), (0,6), (-4,-6), (16,6), (16,-7), (16,-3), (17,-4), (5,19), (19,-8), (3,16), (12,13), (3,-4), (17,5), (-3,15), (-3,-9), (0,11), (-9,-3), (-4,-2) and (12,...	christopher/rosetta-code
http://rosettacode.org/wiki/Terminal_control/Display_an_extended_character	Terminal control/Display an extended character	Task Display an extended (non ASCII) character onto the terminal. Specifically, display a £ (GBP currency sign).	#Scala	Scala	object ExtendedCharacter extends App { println("£") println("札幌") }	Give a code snippet in #Scala Task Display an extended (non ASCII) character onto the terminal. Specifically, display a £ (GBP currency sign).	christopher/rosetta-code
http://rosettacode.org/wiki/Fibonacci_sequence	Fibonacci sequence	The Fibonacci sequence is a sequence Fn of natural numbers defined recursively: F0 = 0 F1 = 1 Fn = Fn-1 + Fn-2, if n>1 Task Write a function to generate the nth Fibonacci number. Solutions can be iterative or recursive (though recursive solutions are generally considered too slow ...	#E	E	def fib(n) { var s := [0, 1] for _ in 0..!n { def [a, b] := s s := [b, a+b] } return s[0] }	Give a code snippet in #E The Fibonacci sequence is a sequence Fn of natural numbers defined recursively: F0 = 0 F1 = 1 Fn = Fn-1 + Fn-2, if n>1 Task Write a function to generate the nth Fibonacci number. Solutions can be iterative or recursive (though recursive solutions are gen...	christopher/rosetta-code
http://rosettacode.org/wiki/Associative_array/Creation	Associative array/Creation	Task The goal is to create an associative array (also known as a dictionary, map, or hash). Related tasks: Associative arrays/Iteration Hash from two arrays See also Array Associative array: Creation, Iteration Collections Compound data type Doubly-linked list: Definition, Element definition, Element ins...	#AutoIt	AutoIt	; Associative arrays in AutoIt. ; All the required functions are below the examples. ; Initialize an error handler to deal with any COM errors.. global $oMyError = ObjEvent("AutoIt.Error", "AAError") ; first example, simple. global $simple ; Initialize your array ... AAInit($simple) AAAdd($simple, "Appple", "fr...	Give a code snippet in #AutoIt Task The goal is to create an associative array (also known as a dictionary, map, or hash). Related tasks: Associative arrays/Iteration Hash from two arrays See also Array Associative array: Creation, Iteration Collections Compound data type Doubly-linked list: Definition,...	christopher/rosetta-code
http://rosettacode.org/wiki/Roman_numerals/Decode	Roman numerals/Decode	Task Create a function that takes a Roman numeral as its argument and returns its value as a numeric decimal integer. You don't need to validate the form of the Roman numeral. Modern Roman numerals are written by expressing each decimal digit of the number to be encoded separately, starting with the leftmost decima...	#jq	jq	def fromRoman: def addRoman(n): if length == 0 then n elif startswith("M") then .[1:] \| addRoman(1000 + n) elif startswith("CM") then .[2:] \| addRoman(900 + n) elif startswith("D") then .[1:] \| addRoman(500 + n) elif startswith("CD") then .[2:] \| addRoman(400 + n) elif startswith("C") then ...	Give a code snippet in #jq Task Create a function that takes a Roman numeral as its argument and returns its value as a numeric decimal integer. You don't need to validate the form of the Roman numeral. Modern Roman numerals are written by expressing each decimal digit of the number to be encoded separately, start...	christopher/rosetta-code
http://rosettacode.org/wiki/State_name_puzzle	State name puzzle	Background This task is inspired by Mark Nelson's DDJ Column "Wordplay" and one of the weekly puzzle challenges from Will Shortz on NPR Weekend Edition [1] and originally attributed to David Edelheit. The challenge was to take the names of two U.S. States, mix them all together, then rearrange the letters to form the...	#Racket	Racket	#lang racket (define states (list->set (map string-downcase '("Alabama" "Alaska" "Arizona" "Arkansas" "California" "Colorado" "Connecticut" "Delaware" "Florida" "Georgia" "Hawaii" "Idaho" "Illinois" "Indiana" "Iowa" "Kansas" "Kentucky" "Loui...	Give a code snippet in #Racket Background This task is inspired by Mark Nelson's DDJ Column "Wordplay" and one of the weekly puzzle challenges from Will Shortz on NPR Weekend Edition [1] and originally attributed to David Edelheit. The challenge was to take the names of two U.S. States, mix them all together, then r...	christopher/rosetta-code
http://rosettacode.org/wiki/HTTPS/Authenticated	HTTPS/Authenticated	The goal of this task is to demonstrate HTTPS requests with authentication. Implementations of this task should not use client certificates for this: that is the subject of another task.	#Rust	Rust	extern crate reqwest; use reqwest::blocking::Client; use reqwest::header::CONNECTION; fn main() { let client = Client::new(); // reqwest uses strongly-typed structs for creating headers let res = client .get("https://www.example.com") .basic_auth("user", Some("password")) .he...	Give a code snippet in #Rust The goal of this task is to demonstrate HTTPS requests with authentication. Implementations of this task should not use client certificates for this: that is the subject of another task.	christopher/rosetta-code
http://rosettacode.org/wiki/Permutations/Derangements	Permutations/Derangements	A derangement is a permutation of the order of distinct items in which no item appears in its original place. For example, the only two derangements of the three items (0, 1, 2) are (1, 2, 0), and (2, 0, 1). The number of derangements of n distinct items is known as the subfactorial of n, sometimes written as !n. The...	#Phix	Phix	with javascript_semantics function deranged(sequence s1, sequence s2) for i=1 to length(s1) do if s1[i]==s2[i] then return 0 end if end for return 1 end function function derangements(integer n) sequence ts = tagset(n) sequence res = {} for i=1 to factorial(n) do sequence s = p...	Give a code snippet in #Phix A derangement is a permutation of the order of distinct items in which no item appears in its original place. For example, the only two derangements of the three items (0, 1, 2) are (1, 2, 0), and (2, 0, 1). The number of derangements of n distinct items is known as the subfactorial of n...	christopher/rosetta-code
http://rosettacode.org/wiki/Send_email	Send email	Task Write a function to send an email. The function should have parameters for setting From, To and Cc addresses; the Subject, and the message text, and optionally fields for the server name and login details. If appropriate, explain what notifications of problems/success are given. Solutions using libraries or f...	#Delphi	Delphi	procedure SendEmail; var msg: TIdMessage; smtp: TIdSMTP; begin smtp := TIdSMTP.Create; try smtp.Host := 'smtp.server.com'; smtp.Port := 587; smtp.Username := 'login'; smtp.Password := 'password'; smtp.AuthType := satNone; smtp.Connect; msg := TIdMessage.Create(nil); try w...	Give a code snippet in #Delphi Task Write a function to send an email. The function should have parameters for setting From, To and Cc addresses; the Subject, and the message text, and optionally fields for the server name and login details. If appropriate, explain what notifications of problems/success are given....	christopher/rosetta-code
http://rosettacode.org/wiki/File_extension_is_in_extensions_list	File extension is in extensions list	File extension is in extensions list You are encouraged to solve this task according to the task description, using any language you may know. Filename extensions are a rudimentary but commonly used way of identifying files types. Task Given an arbitrary filename and a list of extensions, tell whether the filename...	#Lua	Lua	-- Data declarations local extentions = {"zip", "rar", "7z", "gz", "archive", "A##", "tar.bz2"} local testCases = { "MyData.a##", "MyData.tar.Gz", "MyData.gzip", "MyData.7z.backup", "MyData...", "MyData", "MyData_v1.0.tar.bz2", "MyData_v1.0.bz2" } -- Return boolean of whether example has a file extens...	Give a code snippet in #Lua File extension is in extensions list You are encouraged to solve this task according to the task description, using any language you may know. Filename extensions are a rudimentary but commonly used way of identifying files types. Task Given an arbitrary filename and a list of extensio...	christopher/rosetta-code
http://rosettacode.org/wiki/Collections	Collections	This task has been clarified. Its programming examples are in need of review to ensure that they still fit the requirements of the task. Collections are abstractions to represent sets of values. In statically-typed languages, the values are typically of a common data type. Task Create a collection, and add a fe...	#Ursala	Ursala	x = <1,5,6> y = <'foo','bar'> z = 3:<6,8>	Give a code snippet in #Ursala This task has been clarified. Its programming examples are in need of review to ensure that they still fit the requirements of the task. Collections are abstractions to represent sets of values. In statically-typed languages, the values are typically of a common data type. Task C...	christopher/rosetta-code
http://rosettacode.org/wiki/Date_format	Date format	This task has been clarified. Its programming examples are in need of review to ensure that they still fit the requirements of the task. Task Display the current date in the formats of: 2007-11-23 and Friday, November 23, 2007	#Icon_and_Unicon	Icon and Unicon	procedure main() write(map(&date,"/","-")) write(&dateline ? tab(find(&date[1:5])+4)) end	Give a code snippet in #Icon_and_Unicon This task has been clarified. Its programming examples are in need of review to ensure that they still fit the requirements of the task. Task Display the current date in the formats of: 2007-11-23 and Friday, November 23, 2007	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 ...	#Quackery	Quackery	[ ' [ ' unbuild dup 4 split rot space rot 3 times join echo$ ] unbuild dup 4 split rot space rot 3 times join echo$ ]	Give a code snippet in #Quackery 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/Generator/Exponential	Generator/Exponential	A generator is an executable entity (like a function or procedure) that contains code that yields a sequence of values, one at a time, so that each time you call the generator, the next value in the sequence is provided. Generators are often built on top of coroutines or objects so that the internal state of the objec...	#Perl	Perl	# gen_pow($m) creates and returns an anonymous subroutine that will # generate and return the powers 0m, 1m, 2m, ... sub gen_pow { my $m = shift; my $e = 0; return sub { return $e++ $m; }; } # gen_filter($g1, $g2) generates everything returned from $g1 that # is not also returned from $g2. Both $...	Give a code snippet in #Perl A generator is an executable entity (like a function or procedure) that contains code that yields a sequence of values, one at a time, so that each time you call the generator, the next value in the sequence is provided. Generators are often built on top of coroutines or objects so that t...	christopher/rosetta-code
http://rosettacode.org/wiki/Greatest_element_of_a_list	Greatest element of a list	Task Create a function that returns the maximum value in a provided set of values, where the number of values may not be known until run-time.	#Amazing_Hopper	Amazing Hopper	#include <hopper.h> main: lst=0 max=0 file="datos.txt" {","} toksep {file} statsfile {file} load mov (lst) {0} reshape (lst) {lst} array (SORT) [end] get (lst) mov ...	Give a code snippet in #Amazing_Hopper Task Create a function that returns the maximum value in a provided set of values, where the number of values may not be known until run-time.	christopher/rosetta-code
http://rosettacode.org/wiki/Constrained_genericity	Constrained genericity	Constrained genericity or bounded quantification means that a parametrized type or function (see parametric polymorphism) can only be instantiated on types fulfilling some conditions, even if those conditions are not used in that function. Say a type is called "eatable" if you can call the function eat on it. Write a ...	#Sidef	Sidef	class FoodBox(*food { .all { .respond_to(:eat) } }) { } class Fruit { method eat { ... } } class Apple < Fruit { } say FoodBox(Fruit(), Apple()).dump #=> FoodBox(food: [Fruit(), Apple()]) say FoodBox(Apple(), "foo") #!> ERROR: class `FoodBox` !~ (Apple, String)	Give a code snippet in #Sidef Constrained genericity or bounded quantification means that a parametrized type or function (see parametric polymorphism) can only be instantiated on types fulfilling some conditions, even if those conditions are not used in that function. Say a type is called "eatable" if you can call t...	christopher/rosetta-code
http://rosettacode.org/wiki/Inheritance/Single	Inheritance/Single	This task is about derived types; for implementation inheritance, see Polymorphism. Inheritance is an operation of type algebra that creates a new type from one or several parent types. The obtained type is called derived type. It inherits some of the properties of its parent types. Usually inherited properties...	#PureBasic	PureBasic	Interface Animal Eat() Sleep() EndInterface Interface Cat Extends Animal ChaseMouse() EndInterface Interface Dog Extends Animal Bark() WagTail() EndInterface Interface Lab Extends Dog Swim() EndInterface Interface Collie Extends Dog HeardSheep() EndInterface	Give a code snippet in #PureBasic This task is about derived types; for implementation inheritance, see Polymorphism. Inheritance is an operation of type algebra that creates a new type from one or several parent types. The obtained type is called derived type. It inherits some of the properties of its parent t...	christopher/rosetta-code
http://rosettacode.org/wiki/Totient_function	Totient function	The totient function is also known as: Euler's totient function Euler's phi totient function phi totient function Φ function (uppercase Greek phi) φ function (lowercase Greek phi) Definitions (as per number theory) The totient function: counts the integers up to a given positiv...	#Java	Java	public class TotientFunction { public static void main(String[] args) { computePhi(); System.out.println("Compute and display phi for the first 25 integers."); System.out.printf("n Phi IsPrime%n"); for ( int n = 1 ; n <= 25 ; n++ ) { System.out.printf("%2d %2d %b%...	Give a code snippet in #Java The totient function is also known as: Euler's totient function Euler's phi totient function phi totient function Φ function (uppercase Greek phi) φ function (lowercase Greek phi) Definitions (as per number theory) The totient function: counts the ...	christopher/rosetta-code
http://rosettacode.org/wiki/Align_columns	Align columns	Given a text file of many lines, where fields within a line are delineated by a single 'dollar' character, write a program that aligns each column of fields by ensuring that words in each column are separated by at least one space. Further, allow for each word in a column to be either left justified, right justified, o...	#Snobol	Snobol	* Since we don't know how much text we'll be reading in, * we store the words and field widths in tables Words = TABLE() Widths = TABLE() * Match text from start of string to the first dollar sign WordPat = POS(0) BREAK('$') . Word LE...	Give a code snippet in #Snobol Given a text file of many lines, where fields within a line are delineated by a single 'dollar' character, write a program that aligns each column of fields by ensuring that words in each column are separated by at least one space. Further, allow for each word in a column to be either le...	christopher/rosetta-code
http://rosettacode.org/wiki/Determine_if_a_string_has_all_unique_characters	Determine if a string has all unique characters	Task Given a character string (which may be empty, or have a length of zero characters): create a function/procedure/routine to: determine if all the characters in the string are unique indicate if or which character is duplicated and where display each string and its length (as the strings are being ...	#Ada	Ada	with Ada.Integer_Text_IO; use Ada.Integer_Text_IO; with Ada.Text_IO; use Ada.Text_IO; procedure Test_All_Chars_Unique is procedure All_Chars_Unique (S : in String) is begin Put_Line ("Input = """ & S & """, length =" & S'Length'Image); for I in S'First .. S'Last - 1 loop for J in I + 1 .. S'L...	Give a code snippet in #Ada Task Given a character string (which may be empty, or have a length of zero characters): create a function/procedure/routine to: determine if all the characters in the string are unique indicate if or which character is duplicated and where display each string and its length...	christopher/rosetta-code
http://rosettacode.org/wiki/Loops/Infinite	Loops/Infinite	Task Print out SPAM followed by a newline in an infinite loop. Related tasks Loop over multiple arrays simultaneously Loops/Break Loops/Continue Loops/Do-while Loops/Downward for Loops/For Loops/For with a specified step Loops/Foreach Loops/Increment loop index within l...	#Pixilang	Pixilang	start: fputs("SPAM\n") go start	Give a code snippet in #Pixilang Task Print out SPAM followed by a newline in an infinite loop. Related tasks Loop over multiple arrays simultaneously Loops/Break Loops/Continue Loops/Do-while Loops/Downward for Loops/For Loops/For with a specified step Loops/Foreach L...	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...	#Action.21	Action!	DEFINE SYMBOL_TABLE_SIZE="26" PROC InitSymbolTable(BYTE ARRAY table BYTE len) BYTE i FOR i=0 TO len-1 DO table(i)=i+'a OD RETURN BYTE FUNC Find(BYTE ARRAY table BYTE len,c) BYTE i FOR i=0 TO len-1 DO IF table(i)=c THEN RETURN (i) FI OD Break() RETURN (0) PROC MoveToFront(BY...	Give a code snippet in #Action.21 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 us...	christopher/rosetta-code
http://rosettacode.org/wiki/Boolean_values	Boolean values	Task Show how to represent the boolean states "true" and "false" in a language. If other objects represent "true" or "false" in conditionals, note it. Related tasks Logical operations	#PostScript	PostScript	true false	Give a code snippet in #PostScript Task Show how to represent the boolean states "true" and "false" in a language. If other objects represent "true" or "false" in conditionals, note it. Related tasks Logical operations	christopher/rosetta-code
http://rosettacode.org/wiki/Formatted_numeric_output	Formatted numeric output	Task Express a number in decimal as a fixed-length string with leading zeros. For example, the number 7.125 could be expressed as 00007.125.	#Liberty_BASIC	Liberty BASIC	for i =1 to 10 n =rnd( 1) 10^( int( 10 rnd(1)) -2) print "Raw number ="; n; "Using custom function ="; FormattedPrint$( n, 16, 5) next i end function FormattedPrint$( n, length, decPlaces) format$ ="#." for i =1 to decPlaces format$ =format$ +"#" next i n$ =using( format$, n) ...	Give a code snippet in #Liberty_BASIC Task Express a number in decimal as a fixed-length string with leading zeros. For example, the number 7.125 could be expressed as 00007.125.	christopher/rosetta-code
http://rosettacode.org/wiki/Look-and-say_sequence	Look-and-say sequence	The Look and say sequence is a recursively defined sequence of numbers studied most notably by John Conway. The look-and-say sequence is also known as the Morris Number Sequence, after cryptographer Robert Morris, and the puzzle What is the next number in the sequence 1, 11, 21, 1211, 11122...	#Erlang	Erlang	-module(str). -export([look_and_say/1, look_and_say/2]). %% converts a single number look_and_say([H\|T]) -> lists:reverse(look_and_say(T,H,1,"")). %% converts and accumulates as a loop look_and_say(_, 0) -> []; look_and_say(Start, Times) when Times > 0 -> [Start \| look_and_say(look_and_say(Start), Times-1)]. ...	Give a code snippet in #Erlang The Look and say sequence is a recursively defined sequence of numbers studied most notably by John Conway. The look-and-say sequence is also known as the Morris Number Sequence, after cryptographer Robert Morris, and the puzzle What is the next number in the sequenc...	christopher/rosetta-code
http://rosettacode.org/wiki/Assertions	Assertions	Assertions are a way of breaking out of code when there is an error or an unexpected input. Some languages throw exceptions and some treat it as a break point. Task Show an assertion in your language by asserting that an integer variable is equal to 42.	#Vlang	Vlang	fn main(){ x := 43 assert x == 43 // Fine assert x > 42 // Fine assert x == 42 // Fails }	Give a code snippet in #Vlang Assertions are a way of breaking out of code when there is an error or an unexpected input. Some languages throw exceptions and some treat it as a break point. Task Show an assertion in your language by asserting that an integer variable is equal to 42.	christopher/rosetta-code
http://rosettacode.org/wiki/One_of_n_lines_in_a_file	One of n lines in a file	A method of choosing a line randomly from a file: Without reading the file more than once When substantial parts of the file cannot be held in memory Without knowing how many lines are in the file Is to: keep the first line of the file as a possible choice, then Read the second line of the file if possible and m...	#Mathematica.2FWolfram_Language	Mathematica/Wolfram Language	chooseLine[file_] := Block[{strm = OpenRead[file], n = 1, rec, selected}, rec = selected = Read[strm]; While[rec =!= EndOfFile, rec=Read[strm]; n++; ...	Give a code snippet in #Mathematica.2FWolfram_Language A method of choosing a line randomly from a file: Without reading the file more than once When substantial parts of the file cannot be held in memory Without knowing how many lines are in the file Is to: keep the first line of the file as a possible choice, ...	christopher/rosetta-code
http://rosettacode.org/wiki/Doubly-linked_list/Traversal	Doubly-linked list/Traversal	Traverse from the beginning of a doubly-linked list to the end, and from the end to the beginning. See also Array Associative array: Creation, Iteration Collections Compound data type Doubly-linked list: Definition, Element definition, Element insertion, List Traversal, Element Removal Linked list Queue: Def...	#Groovy	Groovy	class DoubleLinkedListTraversing { static void main(args) { def linkedList = (1..9).collect() as LinkedList linkedList.each { print it } println() linkedList.reverseEach { print it } } }	Give a code snippet in #Groovy Traverse from the beginning of a doubly-linked list to the end, and from the end to the beginning. See also Array Associative array: Creation, Iteration Collections Compound data type Doubly-linked list: Definition, Element definition, Element insertion, List Traversal, Element ...	christopher/rosetta-code
http://rosettacode.org/wiki/Lucas-Lehmer_test	Lucas-Lehmer test	Lucas-Lehmer Test: for p {\displaystyle p} an odd prime, the Mersenne number 2 p − 1 {\displaystyle 2^{p}-1} is prime if and only if 2 p − 1 {\displaystyle 2^{p}-1} divides S ( p − 1 ) {\displaystyle S(p-1)} where S ( n + 1 ) = ( S ( n ) ) 2 − 2 {\displaystyle S(n+1)=(...	#PureBasic	PureBasic	Procedure Lucas_Lehmer_Test(p) Protected mp.q = (1 << p) - 1, sn.q = 4, i For i = 3 To p sn = (sn * sn - 2) % mp Next If sn = 0 ProcedureReturn #True EndIf ProcedureReturn #False EndProcedure #upperBound = SizeOf(Quad) * 8 - 1 ;equivalent to significant bits in a signed quad integer If OpenConsole...	Give a code snippet in #PureBasic Lucas-Lehmer Test: for p {\displaystyle p} an odd prime, the Mersenne number 2 p − 1 {\displaystyle 2^{p}-1} is prime if and only if 2 p − 1 {\displaystyle 2^{p}-1} divides S ( p − 1 ) {\displaystyle S(p-1)} where S ( n + 1 ) = ( S ( n ) )...	christopher/rosetta-code
http://rosettacode.org/wiki/Knapsack_problem/0-1	Knapsack problem/0-1	A tourist wants to make a good trip at the weekend with his friends. They will go to the mountains to see the wonders of nature, so he needs to pack well for the trip. He has a good knapsack for carrying things, but knows that he can carry a maximum of only 4kg in it, and it will have to last the whole day. He cre...	#PHP	PHP	######################################################### # 0-1 Knapsack Problem Solve with memoization optimize and index returns # $w = weight of item # $v = value of item # $i = index # $aW = Available Weight # $m = Memo items array # PHP Translation from Python, Memoization, # and index return functionality added b...	Give a code snippet in #PHP A tourist wants to make a good trip at the weekend with his friends. They will go to the mountains to see the wonders of nature, so he needs to pack well for the trip. He has a good knapsack for carrying things, but knows that he can carry a maximum of only 4kg in it, and it will have t...	christopher/rosetta-code
http://rosettacode.org/wiki/Parsing/Shunting-yard_algorithm	Parsing/Shunting-yard algorithm	Task Given the operator characteristics and input from the Shunting-yard algorithm page and tables, use the algorithm to show the changes in the operator stack and RPN output as each individual token is processed. Assume an input of a correct, space separated, string of tokens representing an infix expression Gener...	#zkl	zkl	var input="3 + 4 * 2 / ( 1 - 5 ) ^ 2 ^ 3"; var opa=Dictionary("^",T(4,True), "*",T(3,False), // op:(prec,rAssoc) "/",T(3,False), "+",T(2,False), "-",T(2,False), ); "infix: ".println(input); "postfix:".println(parseInfix(input)); fcn parseInfix(e){ stack:=List(); // holds operators and left parenthesi...	Give a code snippet in #zkl Task Given the operator characteristics and input from the Shunting-yard algorithm page and tables, use the algorithm to show the changes in the operator stack and RPN output as each individual token is processed. Assume an input of a correct, space separated, string of tokens representi...	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 ...	#IS-BASIC	IS-BASIC	100 PROGRAM "Combinat.bas" 110 LET MMAX=3:LET NMAX=5 120 NUMERIC COMB(0 TO MMAX) 130 CALL GENERATE(1) 140 DEF GENERATE(M) 150 NUMERIC N,I 160 IF M>MMAX THEN 170 FOR I=1 TO MMAX 180 PRINT COMB(I); 190 NEXT 200 PRINT 220 ELSE 230 FOR N=0 TO NMAX-1 240 IF M=1 OR N>COMB(M-1) THEN 250 ...	Give a code snippet in #IS-BASIC 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 ...	christopher/rosetta-code
http://rosettacode.org/wiki/Sequence:_smallest_number_greater_than_previous_term_with_exactly_n_divisors	Sequence: smallest number greater than previous term with exactly n divisors	Calculate the sequence where each term an is the smallest natural number greater than the previous term, that has exactly n divisors. Task Show here, on this page, at least the first 15 terms of the sequence. See also OEIS:A069654 Related tasks Sequence: smallest number with exactly n divisors Sequence: nth ...	#Go	Go	package main import "fmt" func countDivisors(n int) int { count := 0 for i := 1; i*i <= n; i++ { if n%i == 0 { if i == n/i { count++ } else { count += 2 } } } return count } func main() { const max = 15 fmt...	Give a code snippet in #Go Calculate the sequence where each term an is the smallest natural number greater than the previous term, that has exactly n divisors. Task Show here, on this page, at least the first 15 terms of the sequence. See also OEIS:A069654 Related tasks Sequence: smallest number with exactl...	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 ...	#Wren	Wren	import "/fmt" for Fmt import "/big" for BigInt var p = BigInt.three.pow(BigInt.two) p = BigInt.four.pow(p) p = BigInt.five.pow(p) var s = p.toString Fmt.print("5 ^ 4 ^ 3 ^ 2 has $,d digits.\n", s.count) System.print("The first twenty are : %(s[0..19])") System.print("and the last twenty are : %(s[-20..-1])")	Give a code snippet in #Wren Using the in-built capabilities of your language, calculate the integer value of: 5 4 3 2 ...	christopher/rosetta-code
http://rosettacode.org/wiki/Send_email	Send email	Task Write a function to send an email. The function should have parameters for setting From, To and Cc addresses; the Subject, and the message text, and optionally fields for the server name and login details. If appropriate, explain what notifications of problems/success are given. Solutions using libraries or f...	#Haskell	Haskell	{-# LANGUAGE OverloadedStrings #-} module Main (main) where import Network.Mail.SMTP ( Address(..) , htmlPart , plainTextPart , sendMailWithLogin' , simpleMail ) main :: IO () main = ...	Give a code snippet in #Haskell Task Write a function to send an email. The function should have parameters for setting From, To and Cc addresses; the Subject, and the message text, and optionally fields for the server name and login details. If appropriate, explain what notifications of problems/success are given...	christopher/rosetta-code
http://rosettacode.org/wiki/Averages/Root_mean_square	Averages/Root mean square	Task[edit] Compute the Root mean square of the numbers 1..10. The root mean square is also known by its initials RMS (or rms), and as the quadratic mean. The RMS is calculated as the mean of the squares of the numbers, square-rooted: x r m s = x 1 2 + x 2 2 + ⋯ + x ...	#Perl	Perl	use v5.10.0; sub rms { my $r = 0; $r += $_**2 for @_; sqrt( $r/@_ ); } say rms(1..10);	Give a code snippet in #Perl Task[edit] Compute the Root mean square of the numbers 1..10. The root mean square is also known by its initials RMS (or rms), and as the quadratic mean. The RMS is calculated as the mean of the squares of the numbers, square-rooted: x r m s = x 1 2 ...	christopher/rosetta-code
http://rosettacode.org/wiki/Roots_of_a_quadratic_function	Roots of a quadratic function	This task has been clarified. Its programming examples are in need of review to ensure that they still fit the requirements of the task. Write a program to find the roots of a quadratic equation, i.e., solve the equation a x 2 + b x + c = 0 {\displaystyle ax^{2}+bx+c=0} . Your program must correctly handle n...	#Factor	Factor	:: quadratic-equation ( a b c -- x1 x2 ) b sq a c * 4 * - sqrt :> sd b 0 < [ b neg sd + a 2 * / ] [ b neg sd - a 2 * / ] if :> x x c a x * / ;	Give a code snippet in #Factor This task has been clarified. Its programming examples are in need of review to ensure that they still fit the requirements of the task. Write a program to find the roots of a quadratic equation, i.e., solve the equation a x 2 + b x + c = 0 {\displaystyle ax^{2}+bx+c=0} . Your...	christopher/rosetta-code
http://rosettacode.org/wiki/Galton_box_animation	Galton box animation	Example of a Galton Box at the end of animation. A Galton device Sir Francis Galton's device is also known as a bean machine, a Galton Board, or a quincunx. Description of operation In a Galton box, there are a set of pins arranged in a triangular pattern. A number of balls are dropped so that ...	#Yabasic	Yabasic	bola$ = "0000ff" obst$ = "000000" maxBalls = 10 cx = 1 cy = 2 dim Balls(maxBalls, 2) open window 600,600 window origin "ct" maxh = peek("winheight") REM Draw the pins: FOR row = 1 TO 7 FOR col = 1 TO row FILL circle 40col - 20row, 40*row+80, 10 NEXT col NEXT row REM Animate tick = 0 bolas = 0 colo...	Give a code snippet in #Yabasic Example of a Galton Box at the end of animation. A Galton device Sir Francis Galton's device is also known as a bean machine, a Galton Board, or a quincunx. Description of operation In a Galton box, there are a set of pins arranged in a triangular pattern. A num...	christopher/rosetta-code
http://rosettacode.org/wiki/Continued_fraction	Continued fraction	continued fraction Mathworld a 0 + b 1 a 1 + b 2 a 2 + b 3 a 3 + ⋱ {\displaystyle a_{0}+{\cfrac {b_{1}}{a_{1}+{\cfrac {b_{2}}{a_{2}+{\cfrac {b_{3}}{a_{3}+\ddots }}}}}}} The task is to write a program which generates su...	#Ada	Ada	generic type Scalar is digits <>; with function A (N : in Natural) return Natural; with function B (N : in Positive) return Natural; function Continued_Fraction (Steps : in Natural) return Scalar;	Give a code snippet in #Ada continued fraction Mathworld a 0 + b 1 a 1 + b 2 a 2 + b 3 a 3 + ⋱ {\displaystyle a_{0}+{\cfrac {b_{1}}{a_{1}+{\cfrac {b_{2}}{a_{2}+{\cfrac {b_{3}}{a_{3}+\ddots }}}}}}} The task is to write...	christopher/rosetta-code
http://rosettacode.org/wiki/Magic_squares_of_doubly_even_order	Magic squares of doubly even order	A magic square is an N×N square matrix whose numbers consist of consecutive numbers arranged so that the sum of each row and column, and both diagonals are equal to the same sum (which is called the magic number or magic constant). A magic square of doubly even order has a size that is a multiple of four (e...	#Elixir	Elixir	defmodule Magic_square do def doubly_even(n) when rem(n,4)!=0, do: raise ArgumentError, "must be even, but not divisible by 4." def doubly_even(n) do n2 = n * n Enum.zip(1..n2, make_pattern(n)) \|> Enum.map(fn {i,p} -> if p, do: i, else: n2 - i + 1 end) \|> Enum.chunk(n) \|> to_string(n) \|> IO....	Give a code snippet in #Elixir A magic square is an N×N square matrix whose numbers consist of consecutive numbers arranged so that the sum of each row and column, and both diagonals are equal to the same sum (which is called the magic number or magic constant). A magic square of doubly even order has a size...	christopher/rosetta-code
http://rosettacode.org/wiki/Deepcopy	Deepcopy	Task Demonstrate how to copy data structures containing complex heterogeneous and cyclic semantics. This is often referred to as deep copying, and is normally required where structures are mutable and to ensure that independent copies can be manipulated without side-effects. If this facility is not built into the la...	#Lingo	Lingo	-- Supports lists, property lists, images, script instances and scalar values (integer, float, string, symbol). on deepcopy (var, cycleCheck) case ilk(var) of #list, #propList, #image: return var.duplicate() #instance: if string(var) starts "<Xtra " then return var -- deep copy makes no sense for Xtra...	Give a code snippet in #Lingo Task Demonstrate how to copy data structures containing complex heterogeneous and cyclic semantics. This is often referred to as deep copying, and is normally required where structures are mutable and to ensure that independent copies can be manipulated without side-effects. If this fa...	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 ...	#CLU	CLU	% Sort an array in place using heap-sort. The contained type % may be any type that can be compared. heapsort = cluster [T: type] is sort where T has lt: proctype (T,T) returns (bool) rep = null aT = array[T] sort = proc (a: aT) % CLU arrays may start at any index. % For simpli...	Give a code snippet in #CLU 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...	christopher/rosetta-code
http://rosettacode.org/wiki/Create_an_HTML_table	Create an HTML table	Create an HTML table. The table body should have at least three rows of three columns. Each of these three columns should be labelled "X", "Y", and "Z". An extra column should be added at either the extreme left or the extreme right of the table that has no heading, but is filled with sequential row numbers. The...	#F.23	F#	open System.Xml type XmlDocument with member this.Add element = this.AppendChild element member this.Element name = this.CreateElement(name) :> XmlNode member this.Element (name, (attr : (string * string) list)) = let node = this.CreateElement(name) for a in attr do ...	Give a code snippet in #F.23 Create an HTML table. The table body should have at least three rows of three columns. Each of these three columns should be labelled "X", "Y", and "Z". An extra column should be added at either the extreme left or the extreme right of the table that has no heading, but is filled with...	christopher/rosetta-code
http://rosettacode.org/wiki/Catalan_numbers/Pascal%27s_triangle	Catalan numbers/Pascal's triangle	Task Print out the first 15 Catalan numbers by extracting them from Pascal's triangle. See Catalan Numbers and the Pascal Triangle. This method enables calculation of Catalan Numbers using only addition and subtraction. Catalan's Triangle for a Number Triangle that generates Catalan Numbers using onl...	#EchoLisp	EchoLisp	(define dim 100) (define-syntax-rule (Tidx i j) (+ i (* dim j))) ;; generates Catalan's triangle ;; T (i , j) = T(i-1,j) + T (i, j-1) (define (T n) (define i (modulo n dim)) (define j (quotient n dim)) (cond ((zero? i) 1) ;; left column = 1 ((= i j) (T (Tidx (1- i) j))) ;; diagonal value = left value ...	Give a code snippet in #EchoLisp Task Print out the first 15 Catalan numbers by extracting them from Pascal's triangle. See Catalan Numbers and the Pascal Triangle. This method enables calculation of Catalan Numbers using only addition and subtraction. Catalan's Triangle for a Number Triangle that g...	christopher/rosetta-code
http://rosettacode.org/wiki/Queue/Usage	Queue/Usage	Data Structure This illustrates a data structure, a means of storing data within a program. You may see other such structures in the Data Structures category. Illustration of FIFO behavior Task Create a queue data structure and demonstrate its operations. (For implementations of queues, see the FIFO task.) Ope...	#Maple	Maple	q := queue[new](); queue[enqueue](q,1); queue[enqueue](q,2); queue[enqueue](q,3); queue[empty](q); >>>false queue[dequeue](q); >>>1 queue[dequeue](q); >>>2 queue[dequeue](q); >>>3 queue[empty](q); >>>true	Give a code snippet in #Maple Data Structure This illustrates a data structure, a means of storing data within a program. You may see other such structures in the Data Structures category. Illustration of FIFO behavior Task Create a queue data structure and demonstrate its operations. (For implementations of que...	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 ...	#DCL	DCL	$ limit = p1 $ $ n = 0 $ h_'n = 1 $ x2 = 2 $ x3 = 3 $ x5 = 5 $ i = 0 $ j = 0 $ k = 0 $ $ n = 1 $ loop: $ x = x2 $ if x3 .lt. x then $ x = x3 $ if x5 .lt. x then $ x = x5 $ h_'n = x $ if x2 .eq. h_'n $ then $ i = i + 1 $ x2 = 2 * h_'i $ endif $ if x3 .eq. h_'n $ then $ j = j + 1 $ x3 = 3 * h_'j $ endif...	Give a code snippet in #DCL 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 number...	christopher/rosetta-code
http://rosettacode.org/wiki/Comma_quibbling	Comma quibbling	Comma quibbling is a task originally set by Eric Lippert in his blog. Task Write a function to generate a string output which is the concatenation of input words from a list/sequence where: An input of no words produces the output string of just the two brace characters "{}". An input of just one word, e.g. ["AB...	#EchoLisp	EchoLisp	(lib 'match) (define (quibble words) (match words [ null "{}"] [ (a) (format "{ %a }" a)] [ (a b) (format "{ %a and %a }" a b)] [( a ... b c) (format "{ %a %a and %a }" (for/string ([w a]) (string-append w ", ")) b c)] [else 'bad-input])) ;; output (for ([t ...	Give a code snippet in #EchoLisp Comma quibbling is a task originally set by Eric Lippert in his blog. Task Write a function to generate a string output which is the concatenation of input words from a list/sequence where: An input of no words produces the output string of just the two brace characters "{}". An...	christopher/rosetta-code
http://rosettacode.org/wiki/Conditional_structures	Conditional structures	Control Structures These are examples of control structures. You may also be interested in: Conditional structures Exceptions Flow-control structures Loops Task List the conditional structures offered by a programming language. See Wikipedia: conditionals for descriptions. Common conditional structures include ...	#TXR	TXR	@(choose :shortest x) @x:@y @(or) @x<--@y @(or) @x+@y @(end)	Give a code snippet in #TXR Control Structures These are examples of control structures. You may also be interested in: Conditional structures Exceptions Flow-control structures Loops Task List the conditional structures offered by a programming language. See Wikipedia: conditionals for descriptions. Common co...	christopher/rosetta-code
http://rosettacode.org/wiki/Arithmetic-geometric_mean/Calculate_Pi	Arithmetic-geometric mean/Calculate Pi	Almkvist Berndt 1988 begins with an investigation of why the agm is such an efficient algorithm, and proves that it converges quadratically. This is an efficient method to calculate π {\displaystyle \pi } . With the same notations used in Arithmetic-geometric mean, we can summarize the paper by writing: π ...	#C.2B.2B	C++	#include <gmpxx.h> #include <chrono> using namespace std; using namespace chrono; void agm(mpf_class& rop1, mpf_class& rop2, const mpf_class& op1, const mpf_class& op2) { rop1 = (op1 + op2) / 2; rop2 = op1 * op2; mpf_sqrt(rop2.get_mpf_t(), rop2.get_mpf_t()); } int main(void) { auto st = st...	Give a code snippet in #C.2B.2B Almkvist Berndt 1988 begins with an investigation of why the agm is such an efficient algorithm, and proves that it converges quadratically. This is an efficient method to calculate π {\displaystyle \pi } . With the same notations used in Arithmetic-geometric mean, we can summar...	christopher/rosetta-code
http://rosettacode.org/wiki/15_puzzle_game	15 puzzle game	Task Implement the Fifteen Puzzle Game. The 15-puzzle is also known as: Fifteen Puzzle Gem Puzzle Boss Puzzle Game of Fifteen Mystic Square 14-15 Puzzle and some others. Related Tasks 15 Puzzle Solver 16 Puzzle Game	#Haskell	Haskell	import Data.Array import System.Random type Puzzle = Array (Int, Int) Int main :: IO () main = do putStrLn "Please enter the difficulty level: 0, 1 or 2" userInput <- getLine let diffLevel = read userInput if userInput == "" \|\| any (\c -> c < '0' \|\| c > '9') userInput \|\| diffLevel > 2 \|\| diffLevel <...	Give a code snippet in #Haskell Task Implement the Fifteen Puzzle Game. The 15-puzzle is also known as: Fifteen Puzzle Gem Puzzle Boss Puzzle Game of Fifteen Mystic Square 14-15 Puzzle and some others. Related Tasks 15 Puzzle Solver 16 Puzzle Game	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...	#SuperCollider	SuperCollider	f = { \|x\| x + 1 }; g = { \|x\| x * 2 }; h = g <> f; h.(8); // returns 18	Give a code snippet in #SuperCollider 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 functio...	christopher/rosetta-code
http://rosettacode.org/wiki/Ackermann_function	Ackermann function	The Ackermann function is a classic example of a recursive function, notable especially because it is not a primitive recursive function. It grows very quickly in value, as does the size of its call tree. The Ackermann function is usually defined as follows: A ( m , n ) = { n + 1 if m = 0 A ( m ...	#.D0.9C.D0.9A-61.2F52	МК-61/52	П1 <-> П0 ПП 06 С/П ИП0 x=0 13 ИП1 1 + В/О ИП1 x=0 24 ИП0 1 П1 - П0 ПП 06 В/О ИП0 П2 ИП1 1 - П1 ПП 06 П1 ИП2 1 - П0 ПП 06 В/О	Give a code snippet in #.D0.9C.D0.9A-61.2F52 The Ackermann function is a classic example of a recursive function, notable especially because it is not a primitive recursive function. It grows very quickly in value, as does the size of its call tree. The Ackermann function is usually defined as follows: A ( m...	christopher/rosetta-code
http://rosettacode.org/wiki/Web_scraping	Web scraping	Task Create a program that downloads the time from this URL: http://tycho.usno.navy.mil/cgi-bin/timer.pl and then prints the current UTC time by extracting just the UTC time from the web page's HTML. Alternatively, if the above url is not working, grab the first date/time off this page's talk page. If possible,...	#Maple	Maple	text := URL:-Get("http://tycho.usno.navy.mil/cgi-bin/timer.pl"): printf(StringTools:-StringSplit(text,"<BR>")[2]);	Give a code snippet in #Maple Task Create a program that downloads the time from this URL: http://tycho.usno.navy.mil/cgi-bin/timer.pl and then prints the current UTC time by extracting just the UTC time from the web page's HTML. Alternatively, if the above url is not working, grab the first date/time off this pa...	christopher/rosetta-code
http://rosettacode.org/wiki/Equilibrium_index	Equilibrium index	An equilibrium index of a sequence is an index into the sequence such that the sum of elements at lower indices is equal to the sum of elements at higher indices. For example, in a sequence A {\displaystyle A} : A 0 = − 7 {\displaystyle A_{0}=-7} A 1 = 1 {\displaystyle A_{1}=1} ...	#Objeck	Objeck	class Rosetta { function : Main(args : String[]) ~ Nil { sequence := [-7, 1, 5, 2, -4, 3, 0]; EqulibriumIndices(sequence); } function : EqulibriumIndices(sequence : Int[]) ~ Nil { # find total sum totalSum := 0; each(i : sequence) { totalSum += sequence[i]; }; # compare runni...	Give a code snippet in #Objeck An equilibrium index of a sequence is an index into the sequence such that the sum of elements at lower indices is equal to the sum of elements at higher indices. For example, in a sequence A {\displaystyle A} : A 0 = − 7 {\displaystyle A_{0}=-7} A 1 ...	christopher/rosetta-code
http://rosettacode.org/wiki/Palindrome_detection	Palindrome detection	A palindrome is a phrase which reads the same backward and forward. Task[edit] Write a function or program that checks whether a given sequence of characters (or, if you prefer, bytes) is a palindrome. For extra credit: Support Unicode characters. Write a second function (possibly as a wrapper to the first) which ...	#NewLISP	NewLISP	(define (palindrome? s) (setq r s) (reverse r) ; Reverse is destructive. (= s r)) ;; Make ‘reverse’ non-destructive and avoid a global variable (define (palindrome? s) (= s (reverse (copy s))))	Give a code snippet in #NewLISP A palindrome is a phrase which reads the same backward and forward. Task[edit] Write a function or program that checks whether a given sequence of characters (or, if you prefer, bytes) is a palindrome. For extra credit: Support Unicode characters. Write a second function (possibly ...	christopher/rosetta-code
http://rosettacode.org/wiki/Convex_hull	Convex hull	Find the points which form a convex hull from a set of arbitrary two dimensional points. For example, given the points (16,3), (12,17), (0,6), (-4,-6), (16,6), (16,-7), (16,-3), (17,-4), (5,19), (19,-8), (3,16), (12,13), (3,-4), (17,5), (-3,15), (-3,-9), (0,11), (-9,-3), (-4,-2) and (12,10) the convex hull would be (-...	#Raku	Raku	class Point { has Real $.x is rw; has Real $.y is rw; method gist { [~] '(', self.x,', ', self.y, ')' }; } sub ccw (Point $a, Point $b, Point $c) { ($b.x - $a.x)($c.y - $a.y) - ($b.y - $a.y)($c.x - $a.x); } sub tangent (Point $a, Point $b) { my $opp = $b.x - $a.x; my $adj = $b.y - $a.y; ...	Give a code snippet in #Raku Find the points which form a convex hull from a set of arbitrary two dimensional points. For example, given the points (16,3), (12,17), (0,6), (-4,-6), (16,6), (16,-7), (16,-3), (17,-4), (5,19), (19,-8), (3,16), (12,13), (3,-4), (17,5), (-3,15), (-3,-9), (0,11), (-9,-3), (-4,-2) and (12,1...	christopher/rosetta-code
http://rosettacode.org/wiki/Arithmetic-geometric_mean	Arithmetic-geometric mean	This page uses content from Wikipedia. The original article was at Arithmetic-geometric mean. 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) Task Write a function to compute the arithmetic-geomet...	#Ring	Ring	decimals(9) see agm(1, 1/sqrt(2)) + nl see agm(1,1/pow(2,0.5)) + nl func agm agm,g while agm an = (agm + g)/2 gn = sqrt(agm*g) if fabs(agm-g) <= fabs(an-gn) exit ok agm = an g = gn end return gn	Give a code snippet in #Ring This page uses content from Wikipedia. The original article was at Arithmetic-geometric mean. 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) Task Write a function to...	christopher/rosetta-code
http://rosettacode.org/wiki/Summarize_primes	Summarize primes	Task Considering in order of length, n, all sequences of consecutive primes, p, from 2 onwards, where p < 1000 and n>0, select those sequences whose sum is prime, and for these display the length of the sequence, the last item in the sequence, and the sum.	#C.2B.2B	C++	#include <iostream> bool is_prime(int n) { if (n < 2) { return false; } if (n % 2 == 0) { return n == 2; } if (n % 3 == 0) { return n == 3; } int i = 5; while (i * i <= n) { if (n % i == 0) { return false; } i += 2; ...	Give a code snippet in #C.2B.2B Task Considering in order of length, n, all sequences of consecutive primes, p, from 2 onwards, where p < 1000 and n>0, select those sequences whose sum is prime, and for these display the length of the sequence, the last item in the sequence, and the sum.	christopher/rosetta-code
http://rosettacode.org/wiki/OpenGL	OpenGL	Task Display a smooth shaded triangle with OpenGL. Triangle created using C example compiled with GCC 4.1.2 and freeglut3.	#MAXScript	MAXScript	newMesh = mesh numVerts:3 numFaces:1 setMesh newMesh vertices:#([-100, -100, 0], [100, -100, 0], [-100, 100, 0]) faces:#([1, 2, 3]) defaultVCFaces newMesh setVertColor newMesh 1 red setVertColor newMesh 2 green setVertColor newMesh 3 blue setCVertMode newMesh true update newMesh viewport.setType #view_top max tool maxi...	Give a code snippet in #MAXScript Task Display a smooth shaded triangle with OpenGL. Triangle created using C example compiled with GCC 4.1.2 and freeglut3.	christopher/rosetta-code
http://rosettacode.org/wiki/URL_parser	URL parser	URLs are strings with a simple syntax: scheme://[username:password@]domain[:port]/path?query_string#fragment_id Task Parse a well-formed URL to retrieve the relevant information: scheme, domain, path, ... Note: this task has nothing to do with URL encoding or URL decoding. According to the standards, t...	#VBScript	VBScript	Function parse_url(url) parse_url = "URL: " & url If InStr(url,"//") Then 'parse the scheme scheme = Split(url,"//") parse_url = parse_url & vbcrlf & "Scheme: " & Mid(scheme(0),1,Len(scheme(0))-1) 'parse the domain domain = Split(scheme(1),"/") 'check if the domain includes a username, password, and por...	Give a code snippet in #VBScript URLs are strings with a simple syntax: scheme://[username:password@]domain[:port]/path?query_string#fragment_id Task Parse a well-formed URL to retrieve the relevant information: scheme, domain, path, ... Note: this task has nothing to do with URL encoding or URL decoding...	christopher/rosetta-code
http://rosettacode.org/wiki/Sorting_algorithms/Comb_sort	Sorting algorithms/Comb sort	Sorting algorithms/Comb sort You are encouraged to solve this task according to the task description, using any language you may know. 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 algor...	#PicoLisp	PicoLisp	(de combSort (Lst) (let (Gap (length Lst) Swaps NIL) (while (or (> Gap 1) Swaps) (setq Gap (max 1 (/ (* Gap 4) 5))) (off Swaps) (use Lst (for (G (cdr (nth Lst Gap)) G (cdr G)) (when (> (car Lst) (car G)) (xchg Lst G) (...	Give a code snippet in #PicoLisp Sorting algorithms/Comb sort You are encouraged to solve this task according to the task description, using any language you may know. 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 compar...	christopher/rosetta-code
http://rosettacode.org/wiki/Musical_scale	Musical scale	Task Output the 8 notes of the C major diatonic scale to the default musical sound device on the system. Specifically, pitch must be tuned to 12-tone equal temperament (12TET) with the modern standard A=440Hz. These are the notes "C, D, E, F, G, A, B, C(1 octave higher)", or "Do, Re, Mi, Fa, Sol, La, Si/Ti, Do(1 octa...	#XPL0	XPL0	\Square waves on the beeper speaker: code Sound=39; real Period; int I; [Period:= 1190000.0/261.625565; \middle C for I:= 2 to 9 do [Sound(1, 4, fix(Period)); \times 2^(-1/6) else 2^(-1/12) Period:= Period * (if I&3 then 0.890898719 else 0.943874313); ]; ] \MIDI grand piano (requires 32-bit Wind...	Give a code snippet in #XPL0 Task Output the 8 notes of the C major diatonic scale to the default musical sound device on the system. Specifically, pitch must be tuned to 12-tone equal temperament (12TET) with the modern standard A=440Hz. These are the notes "C, D, E, F, G, A, B, C(1 octave higher)", or "Do, Re, Mi,...	christopher/rosetta-code
http://rosettacode.org/wiki/Temperature_conversion	Temperature conversion	There are quite a number of temperature scales. For this task we will concentrate on four of the perhaps best-known ones: Kelvin, Celsius, Fahrenheit, and Rankine. The Celsius and Kelvin scales have the same magnitude, but different null points. 0 degrees Celsius corresponds to 273.15 kelvin. 0 kelvin is absolute z...	#Ruby	Ruby	module TempConvert FROM_TEMP_SCALE_TO_K = {'kelvin' => lambda{\|t\| t}, 'celsius' => lambda{\|t\| t + 273.15}, 'fahrenheit' => lambda{\|t\| (t + 459.67) * 5/9.0}, 'rankine' => lambda{\|t\| t * 5/9.0}, 'delisle' => lambda{\|t\| 373.15 - t * 2/3.0}, 'newton' => lambda{\|t\| t * 100/33.0 + 273.1...	Give a code snippet in #Ruby There are quite a number of temperature scales. For this task we will concentrate on four of the perhaps best-known ones: Kelvin, Celsius, Fahrenheit, and Rankine. The Celsius and Kelvin scales have the same magnitude, but different null points. 0 degrees Celsius corresponds to 273.15 k...	christopher/rosetta-code
http://rosettacode.org/wiki/Quaternion_type	Quaternion type	Quaternions are an extension of the idea of complex numbers. A complex number has a real and complex part, sometimes written as a + bi, where a and b stand for real numbers, and i stands for the square root of minus 1. An example of a complex number might be -3 + 2i, wher...	#Scala	Scala	case class Quaternion(re: Double = 0.0, i: Double = 0.0, j: Double = 0.0, k: Double = 0.0) { lazy val im = (i, j, k) private lazy val norm2 = rere + ii + jj + kk lazy val norm = math.sqrt(norm2) def negative = Quaternion(-re, -i, -j, -k) def conjugate = Quaternion(re, -i, -j, -k) def reciprocal = Quat...	Give a code snippet in #Scala Quaternions are an extension of the idea of complex numbers. A complex number has a real and complex part, sometimes written as a + bi, where a and b stand for real numbers, and i stands for the square root of minus 1. An example of a complex number ...	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...	#PureBasic	PureBasic	Procedure.s CC_encrypt(plainText.s, key, reverse = 0) ;if reverse <> 0 then reverse the encryption (decrypt) If reverse: reverse = 26: key = 26 - key: EndIf Static alphabet$ = "ABCEFGHIJKLMNOPQRSTUVWXYZABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyz" Protected result.s, i, len...	Give a code snippet in #PureBasic 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 ...	christopher/rosetta-code
http://rosettacode.org/wiki/Tau_number	Tau number	A Tau number is a positive integer divisible by the count of its positive divisors. Task Show the first 100 Tau numbers. The numbers shall be generated during run-time (i.e. the code may not contain string literals, sets/arrays of integers, or alike). Related task Tau function	#Go	Go	package main import "fmt" func countDivisors(n int) int { count := 0 i := 1 k := 2 if n%2 == 0 { k = 1 } for i*i <= n { if n%i == 0 { count++ j := n / i if j != i { count++ } } i += k } re...	Give a code snippet in #Go A Tau number is a positive integer divisible by the count of its positive divisors. Task Show the first 100 Tau numbers. The numbers shall be generated during run-time (i.e. the code may not contain string literals, sets/arrays of integers, or alike). Related task Tau function	christopher/rosetta-code

http://rosettacode.org/wiki/First_perfect_square_in_base_n_with_n_unique_digits

First perfect square in base n with n unique digits

Find the first perfect square in a given base N that has at least N digits and exactly N significant unique digits when expressed in base N. E.G. In base 10, the first perfect square with at least 10 unique digits is 1026753849 (32043²). You may use analytical methods to reduce the search space, but the code must do ...

#Go

Go

package main import ( "fmt" "math/big" "strconv" "time" ) const maxBase = 27 const minSq36 = "1023456789abcdefghijklmnopqrstuvwxyz" const minSq36x = "10123456789abcdefghijklmnopqrstuvwxyz" var bigZero = new(big.Int) var bigOne = new(big.Int).SetUint64(1) func containsAll(sq string, base int) boo...

Give a code snippet in #Go Find the first perfect square in a given base N that has at least N digits and exactly N significant unique digits when expressed in base N. E.G. In base 10, the first perfect square with at least 10 unique digits is 1026753849 (32043²). You may use analytical methods to reduce the search ...

christopher/rosetta-code

http://rosettacode.org/wiki/Arithmetic_evaluation

Arithmetic evaluation

Create a program which parses and evaluates arithmetic expressions. Requirements An abstract-syntax tree (AST) for the expression must be created from parsing the input. The AST must be used in evaluation, also, so the input may not be directly evaluated (e.g. by calling eval or a similar language feature.) The ...

#PicoLisp

PicoLisp

(de ast (Str) (let *L (str Str "") (aggregate) ) ) (de aggregate () (let X (product) (while (member (car *L) '("+" "-")) (setq X (list (intern (pop '*L)) X (product))) ) X ) ) (de product () (let X (term) (while (member (car *L) '("*" "/")) (setq X (list (intern (p...

Give a code snippet in #PicoLisp Create a program which parses and evaluates arithmetic expressions. Requirements An abstract-syntax tree (AST) for the expression must be created from parsing the input. The AST must be used in evaluation, also, so the input may not be directly evaluated (e.g. by calling eval or a...

christopher/rosetta-code

http://rosettacode.org/wiki/Combinations_and_permutations

Combinations and permutations

This page uses content from Wikipedia. The original article was at Combination. 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) This page uses content from Wikipedia. The original article was at P...

#J

J

C=: ! P=: (%&!&x:~ * <:)"0

Give a code snippet in #J This page uses content from Wikipedia. The original article was at Combination. 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) This page uses content from Wikipedia. Th...

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

#Ring

Ring

v = "see substr(`v = ` + char(34) + `@` + char(34) + nl + `@` ,`@`,v)" see substr(`v = ` + char(34) + `@` + char(34) + nl + `@` ,`@`,v)

Give a code snippet in #Ring 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/S-expressions

S-expressions

S-Expressions are one convenient way to parse and store data. Task Write a simple reader and writer for S-Expressions that handles quoted and unquoted strings, integers and floats. The reader should read a single but nested S-Expression from a string and store it in a suitable datastructure (list, array, etc). ...

#APL

APL

pretty⊂(0((3 'Hi')(3 'Bye')(1 'A string')(0((3 'Depth')(2 42))))) ( Hi Bye "A string" ( Depth ...

Give a code snippet in #APL S-Expressions are one convenient way to parse and store data. Task Write a simple reader and writer for S-Expressions that handles quoted and unquoted strings, integers and floats. The reader should read a single but nested S-Expression from a string and store it in a suitable datast...

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

#Microsoft_Small_Basic

Microsoft Small Basic

TextWindow.Write("Number of rows? ") r = TextWindow.ReadNumber() For i = 0 To r - 1 c = 1 For k = 0 To i TextWindow.CursorLeft = (k + 1) * 4 - Text.GetLength(c) TextWindow.Write(c) c = c * (i - k) / (k + 1) EndFor TextWindow.WriteLine("") EndFor

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

christopher/rosetta-code

http://rosettacode.org/wiki/Partial_function_application

Partial function application

Partial function application is the ability to take a function of many parameters and apply arguments to some of the parameters to create a new function that needs only the application of the remaining arguments to produce the equivalent of applying all arguments to the original function. E.g: Given values v1, v2 ...

#ALGOL_68

ALGOL 68

MODE SET = FLEX[0]INT; MODE F = PROC(INT)INT, FS = PROC(SET)SET; PROC fs = (F f, SET set)SET: ( [LWB set:UPB set]INT out; FOR i FROM LWB set TO UPB set DO out[i]:=f(set[i]) OD; out ); PROC f1 = (INT value)INT: value * 2, f2 = (INT value)INT: value ** 2; FS fsf1 = fs(f1,), fsf2 = fs(f2,); [4...

Give a code snippet in #ALGOL_68 Partial function application is the ability to take a function of many parameters and apply arguments to some of the parameters to create a new function that needs only the application of the remaining arguments to produce the equivalent of applying all arguments to the original func...

christopher/rosetta-code

http://rosettacode.org/wiki/The_ISAAC_Cipher

The ISAAC Cipher

ISAAC is a cryptographically secure pseudo-random number generator (CSPRNG) and stream cipher. It was developed by Bob Jenkins from 1993 (http://burtleburtle.net/bob/rand/isaac.html) and placed in the Public Domain. ISAAC is fast - especially when optimised - and portable to most architectures in nearly all programming...

#Nim

Nim

import strutils type IMode = enum iEncrypt, iDecrypt State = object # Internal. mm: array[256, uint32] aa, bb, cc: uint32 # External. randrsl: array[256, uint32] randcnt: uint32 proc isaac(s: var State) = inc s.cc # "cc" just gets incremented once per 256 results s.bb ...

Give a code snippet in #Nim ISAAC is a cryptographically secure pseudo-random number generator (CSPRNG) and stream cipher. It was developed by Bob Jenkins from 1993 (http://burtleburtle.net/bob/rand/isaac.html) and placed in the Public Domain. ISAAC is fast - especially when optimised - and portable to most architectu...

christopher/rosetta-code

http://rosettacode.org/wiki/File_size

File size

Verify the size of a file called input.txt for a file in the current working directory, and another one in the file system root.

#X86_Assembly

X86 Assembly

; x86_64 linux nasm section .data localFileName: db "input.txt", 0 rootFileName: db "/initrd.img", 0 section .text global _start _start: ; open file in current dir mov rax, 2 mov rdi, localFileName xor rsi, rsi mov rdx, 0 syscall push rax mov rdi, rax ; file descriptior mov rsi, 0 ; offs...

Give a code snippet in #X86_Assembly Verify the size of a file called input.txt for a file in the current working directory, and another one in the file system root.

christopher/rosetta-code

http://rosettacode.org/wiki/Deconvolution/2D%2B

Deconvolution/2D+

This task is a straightforward generalization of Deconvolution/1D to higher dimensions. For example, the one dimensional case would be applicable to audio signals, whereas two dimensions would pertain to images. Define the discrete convolution in d {\displaystyle {\mathit {d}}} dimensions of two functions ...

#Python

Python

""" https://rosettacode.org/wiki/Deconvolution/2D%2B Working on 3 dimensional example using test data from the RC task. Python fft: https://docs.scipy.org/doc/numpy/reference/routines.fft.html """ import numpy import pprint h = [ [[-6, -8, -5, 9], [-7, 9, -6, -8], [2, -7, 9, 8]], [[7, 4, 4...

Give a code snippet in #Python This task is a straightforward generalization of Deconvolution/1D to higher dimensions. For example, the one dimensional case would be applicable to audio signals, whereas two dimensions would pertain to images. Define the discrete convolution in d {\displaystyle {\mathit {d}}}...

christopher/rosetta-code

http://rosettacode.org/wiki/Four_bit_adder

Four bit adder

Task "Simulate" a four-bit adder. This design can be realized using four 1-bit full adders. Each of these 1-bit full adders can be built with two half adders and an or gate. ; Finally a half adder can be made using an xor gate and an and gate. The xor gate can be made using two nots, two ands ...

#Fortran

Fortran

module logic implicit none contains function xor(a, b) logical :: xor logical, intent(in) :: a, b xor = (a .and. .not. b) .or. (b .and. .not. a) end function xor function halfadder(a, b, c) logical :: halfadder logical, intent(in) :: a, b logical, intent(out) :: c halfadder = xor(a, b) c = ...

Give a code snippet in #Fortran Task "Simulate" a four-bit adder. This design can be realized using four 1-bit full adders. Each of these 1-bit full adders can be built with two half adders and an or gate. ; Finally a half adder can be made using an xor gate and an and gate. The xor gate can be mad...

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.

#REXX

REXX

/*REXX program stresses various REXX functions (BIFs), many BIFs are used as variables. */ signal=(interpret=value); value=(interpret<parse); do upper=value to value; end exit=upper*upper*upper*upper-value-upper; say=' '; return=say say say; with.=signal do then=value to exit; pull=''; do otherwise= upper to then-, val...

Give a code snippet in #REXX 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/Parse_an_IP_Address

Parse an IP Address

The purpose of this task is to demonstrate parsing of text-format IP addresses, using IPv4 and IPv6. Taking the following as inputs: 127.0.0.1 The "localhost" IPv4 address 127.0.0.1:80 The "localhost" IPv4 address, with a specified port (80) ::1 The "localhost" IPv6 address [::1]:80 The "localhost" IPv6...

#Raku

Raku

grammar IP_Addr { token TOP { ^ [ <IPv4> | <IPv6> ] $ } token IPv4 { [ <d8> +% '.' ] <?{ $<d8> == 4 }> <port>? { @*by8 = @$<d8> } } token IPv6 { | <ipv6> | '[' <ipv6> ']' <port> } token ipv6 { | <h16> +% ':' <?{ $<h16> == 8 }> ...

Give a code snippet in #Raku The purpose of this task is to demonstrate parsing of text-format IP addresses, using IPv4 and IPv6. Taking the following as inputs: 127.0.0.1 The "localhost" IPv4 address 127.0.0.1:80 The "localhost" IPv4 address, with a specified port (80) ::1 The "localhost" IPv6 address ...

christopher/rosetta-code

http://rosettacode.org/wiki/Strong_and_weak_primes

Strong and weak primes

Definitions (as per number theory) The prime(p) is the pth prime. prime(1) is 2 prime(4) is 7 A strong prime is when prime(p) is > [prime(p-1) + prime(p+1)] ÷ 2 A weak prime is when prime(p) is < [prime(p-1) + prime(p+1)] ÷ 2 Note that the defin...

#Ring

Ring

load "stdlib.ring" see "working..." + nl p = 0 num = 0 pr1 = 37 pr2 = 38 limit1 = 457 limit2 = 1000000 limit3 = 10000000 primes = [] see "first 36 strong primes:" + nl while true p = p + 1 if isprime(p) if p < limit1 add(primes,p) else exit ok ...

Give a code snippet in #Ring Definitions (as per number theory) The prime(p) is the pth prime. prime(1) is 2 prime(4) is 7 A strong prime is when prime(p) is > [prime(p-1) + prime(p+1)] ÷ 2 A weak prime is when prime(p) is < [prime(p-1) + prime(p...

christopher/rosetta-code

http://rosettacode.org/wiki/Iterated_digits_squaring

Iterated digits squaring

If you add the square of the digits of a Natural number (an integer bigger than zero), you always end with either 1 or 89: 15 -> 26 -> 40 -> 16 -> 37 -> 58 -> 89 7 -> 49 -> 97 -> 130 -> 10 -> 1 An example in Python: >>> step = lambda x: sum(int(d) ** 2 for d in str(x)) >>> iterate = lambda x: x if x in [1, 89] else i...

#Wren

Wren

var endsWith89 = Fn.new { |n| var digit = 0 var sum = 0 while (true) { while (n > 0) { digit = n % 10 sum = sum + digit*digit n = (n/10).floor } if (sum == 89) return true if (sum == 1) return false n = sum sum = 0 } } ...

Give a code snippet in #Wren If you add the square of the digits of a Natural number (an integer bigger than zero), you always end with either 1 or 89: 15 -> 26 -> 40 -> 16 -> 37 -> 58 -> 89 7 -> 49 -> 97 -> 130 -> 10 -> 1 An example in Python: >>> step = lambda x: sum(int(d) ** 2 for d in str(x)) >>> iterate = lamb...

christopher/rosetta-code

http://rosettacode.org/wiki/String_case

String case

Task Take the string alphaBETA and demonstrate how to convert it to: upper-case and lower-case Use the default encoding of a string literal or plain ASCII if there is no string literal in your language. Note: In some languages alphabets toLower and toUpper is not reversable. Show any additional...

#Swift

Swift

import Foundation println("alphaBETA".uppercaseString) println("alphaBETA".lowercaseString) println("foO BAr".capitalizedString)

Give a code snippet in #Swift Task Take the string alphaBETA and demonstrate how to convert it to: upper-case and lower-case Use the default encoding of a string literal or plain ASCII if there is no string literal in your language. Note: In some languages alphabets toLower and toUpper is not r...

christopher/rosetta-code

http://rosettacode.org/wiki/Matrix_multiplication

Matrix multiplication

Task Multiply two matrices together. They can be of any dimensions, so long as the number of columns of the first matrix is equal to the number of rows of the second matrix.

#M2000_Interpreter

M2000 Interpreter

Module CheckMatMult { \\ Matrix Multiplication \\ we use array pointers so we pass arrays byvalue but change this by reference \\ this can be done because always arrays passed by reference, \\ and Read statement decide if this goes to a pointer of array or copied to a local array \\ the first line of code for Ma...

Give a code snippet in #M2000_Interpreter Task Multiply two matrices together. They can be of any dimensions, so long as the number of columns of the first matrix is equal to the number of rows of the second matrix.

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

#Vedit_macro_language

Vedit macro language

File_Open("example.txt", BROWSE) Goto_Line(7) if (Cur_Line < 7) { Statline_Message("File contains too few lines") } else { if (At_EOL) { Statline_Message("Empty line") } Reg_Copy(10, 1) } Buf_Close(NOMSG)

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

christopher/rosetta-code

http://rosettacode.org/wiki/Empty_program

Empty program

Task Create the simplest possible program that is still considered "correct."

#Computer.2Fzero_Assembly

Computer/zero Assembly

STP

Give a code snippet in #Computer.2Fzero_Assembly Task Create the simplest possible program that is still considered "correct."

christopher/rosetta-code

http://rosettacode.org/wiki/Singly-linked_list/Element_definition

Singly-linked list/Element definition

singly-linked list See also Array Associative array: Creation, Iteration Collections Compound data type Doubly-linked list: Definition, Element definition, Element insertion, List Traversal, Element Removal Linked list Queue: Definition, Usage Set Singly-linked list: Element definition, Element insertion, Lis...

#Fortran

Fortran

type node real :: data type( node ), pointer :: next => null() end type node ! !. . . . ! type( node ) :: head

Give a code snippet in #Fortran singly-linked list See also Array Associative array: Creation, Iteration Collections Compound data type Doubly-linked list: Definition, Element definition, Element insertion, List Traversal, Element Removal Linked list Queue: Definition, Usage Set Singly-linked list: Element d...

christopher/rosetta-code

http://rosettacode.org/wiki/Old_lady_swallowed_a_fly

Old lady swallowed a fly

Task Present a program which emits the lyrics to the song I Knew an Old Lady Who Swallowed a Fly, taking advantage of the repetitive structure of the song's lyrics. This song has multiple versions with slightly different lyrics, so all these programs might not emit identical output. Other tasks related to st...

#Phix

Phix

with javascript_semantics sequence lines = {"Perhaps she'll die!\n"}, animals = {} procedure swallow(string animal, second_line, integer permanent_second_line=TRUE) printf(1,"There was an old lady who swallowed a %s,\n%s\n",{animal,second_line}) if length(animals)!=0 then lines = prepend(lines,sprint...

Give a code snippet in #Phix Task Present a program which emits the lyrics to the song I Knew an Old Lady Who Swallowed a Fly, taking advantage of the repetitive structure of the song's lyrics. This song has multiple versions with slightly different lyrics, so all these programs might not emit identical output....

christopher/rosetta-code

http://rosettacode.org/wiki/Next_highest_int_from_digits

Next highest int from digits

Given a zero or positive integer, the task is to generate the next largest integer using only the given digits*1. Numbers will not be padded to the left with zeroes. Use all given digits, with their given multiplicity. (If a digit appears twice in the input number, it should appear twice in the result). If th...

#J

J

permutations=: A.&i.~ ! ordered_numbers_from_digits=: [: /:~ ({~ permutations@#)&.": next_highest=: (>:@i:~ { 0 ,~ ]) ordered_numbers_from_digits (,. next_highest)&>0 9 12 21 12453 738440 45072010 95322020 0 0 9 0 12 21 21 0 12453 12534 738440 ...

Give a code snippet in #J Given a zero or positive integer, the task is to generate the next largest integer using only the given digits*1. Numbers will not be padded to the left with zeroes. Use all given digits, with their given multiplicity. (If a digit appears twice in the input number, it should appear twi...

christopher/rosetta-code

http://rosettacode.org/wiki/Hailstone_sequence

Hailstone sequence

The Hailstone sequence of numbers can be generated from a starting positive integer, n by: If n is 1 then the sequence ends. If n is even then the next n of the sequence = n/2 If n is odd then the next n of the sequence = (3 * n) + 1 The (unproven) Collatz conje...

#FALSE

FALSE

[$1&$[%3*1+0~]?~[2/]?]n: [[$." "$1>][n;!]#%]s: [1\[$1>][\1+\n;!]#%]c: 27s;! 27c;!." " 0m:0f: 1[$100000\>][$c;!$m;>[m:$f:0]?%1+]#% f;." has hailstone sequence length "m;.

Give a code snippet in #FALSE The Hailstone sequence of numbers can be generated from a starting positive integer, n by: If n is 1 then the sequence ends. If n is even then the next n of the sequence = n/2 If n is odd then the next n of the sequence = (3 * n) + 1 ...

christopher/rosetta-code

http://rosettacode.org/wiki/Odd_word_problem

Odd word problem

Task Write a program that solves the odd word problem with the restrictions given below. Description You are promised an input stream consisting of English letters and punctuations. It is guaranteed that: the words (sequence of consecutive letters) are delimited by one and only one punctuation, the stream will...

#Ring

Ring

# Project : Odd word problem test = "what,is,the;meaning,of:life." n1 = 1 testarr = [] testorigin = test test = substr(test, ",", " ") test = substr(test, ";", " ") test = substr(test, ":", " ") test = substr(test, ".", " ") while true n2 = substring(test, " ", n1) n3 = substring(test, " ", n2 + 1) ...

Give a code snippet in #Ring Task Write a program that solves the odd word problem with the restrictions given below. Description You are promised an input stream consisting of English letters and punctuations. It is guaranteed that: the words (sequence of consecutive letters) are delimited by one and only one...

christopher/rosetta-code

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

Loops/Infinite

Task Print out SPAM followed by a newline in an infinite loop. Related tasks Loop over multiple arrays simultaneously Loops/Break Loops/Continue Loops/Do-while Loops/Downward for Loops/For Loops/For with a specified step Loops/Foreach Loops/Increment loop index within l...

#Draco

Draco

proc nonrec main() void: while true do writeln("SPAM") od corp

Give a code snippet in #Draco Task Print out SPAM followed by a newline in an infinite loop. Related tasks Loop over multiple arrays simultaneously Loops/Break Loops/Continue Loops/Do-while Loops/Downward for Loops/For Loops/For with a specified step Loops/Foreach Loop...

christopher/rosetta-code

http://rosettacode.org/wiki/Smallest_number_k_such_that_k%2B2%5Em_is_composite_for_all_m_less_than_k

Smallest number k such that k+2^m is composite for all m less than k

Generate the sequence of numbers a(k), where each k is the smallest positive integer such that k + 2m is composite for every positive integer m less than k. For example Suppose k == 7; test m == 1 through m == 6. If any are prime, the test fails. Is 7 + 21 (9) prime? False Is 7 + 22 (11) prime? True So 7 is not a...

#Raku

Raku

put (1..∞).hyper(:250batch).map(* × 2 + 1).grep( -> $k { !(1 ..^ $k).first: ($k + 1 +< *).is-prime } )[^5]

Give a code snippet in #Raku Generate the sequence of numbers a(k), where each k is the smallest positive integer such that k + 2m is composite for every positive integer m less than k. For example Suppose k == 7; test m == 1 through m == 6. If any are prime, the test fails. Is 7 + 21 (9) prime? False Is 7 + 22 (...

christopher/rosetta-code

http://rosettacode.org/wiki/Entropy

Entropy

Task Calculate the Shannon entropy H of a given input string. Given the discrete random variable X {\displaystyle X} that is a string of N {\displaystyle N} "symbols" (total characters) consisting of n {\displaystyle n} different characters (n=2 for binary), the Shannon entropy of X in bit...

#OCaml

OCaml

(* generic OCaml, using a mutable Hashtbl *) (* pre-bake & return an inner-loop function to bin & assemble a character frequency map *) let get_fproc (m: (char, int) Hashtbl.t) :(char -> unit) = (fun (c:char) -> try Hashtbl.replace m c ( (Hashtbl.find m c) + 1) with Not_fou...

Give a code snippet in #OCaml Task Calculate the Shannon entropy H of a given input string. Given the discrete random variable X {\displaystyle X} that is a string of N {\displaystyle N} "symbols" (total characters) consisting of n {\displaystyle n} different characters (n=2 for binary), ...

christopher/rosetta-code

http://rosettacode.org/wiki/Averages/Arithmetic_mean

Averages/Arithmetic mean

Task[edit] Write a program to find the mean (arithmetic average) of a numeric vector. In case of a zero-length input, since the mean of an empty set of numbers is ill-defined, the program may choose to behave in any way it deems appropriate, though if the programming language has an established convention for conveyin...

#0815

0815

{x{+=<:2:x/%<:d:~$<:01:~><:02:~><:03:~><:04:~><:05:~><:06:~><:07:~><:08: ~><:09:~><:0a:~><:0b:~><:0c:~><:0d:~><:0e:~><:0f:~><:10:~><:11:~><:12:~> <:13:~><:14:~><:15:~><:16:~><:17:~><:18:~><:19:~><:ffffffffffffffff:~>{x {+>}:8f:{&={+>{~>&=x<:ffffffffffffffff:/#:8f:{{=<:19:x/%

Give a code snippet in #0815 Task[edit] Write a program to find the mean (arithmetic average) of a numeric vector. In case of a zero-length input, since the mean of an empty set of numbers is ill-defined, the program may choose to behave in any way it deems appropriate, though if the programming language has an estab...

christopher/rosetta-code

http://rosettacode.org/wiki/Here_document

Here document

A here document (or "heredoc") is a way of specifying a text block, preserving the line breaks, indentation and other whitespace within the text. Depending on the language being used, a here document is constructed using a command followed by "<<" (or some other symbol) followed by a token string. The text ...

#CoffeeScript

CoffeeScript

myDoc = ''' Single-quoted heredocs allows no '#{foo}' interpolation. This behavior is similar to single-quoted strings. ''' doc2 = """ However, double-quoted heredocs *do* allow these. See it in action: Content: "#{myDoc}" """ console.log doc2

Give a code snippet in #CoffeeScript A here document (or "heredoc") is a way of specifying a text block, preserving the line breaks, indentation and other whitespace within the text. Depending on the language being used, a here document is constructed using a command followed by "<<" (or some other symbol) ...

christopher/rosetta-code

http://rosettacode.org/wiki/Determine_if_only_one_instance_is_running

Determine if only one instance is running

This task is to determine if there is only one instance of an application running. If the program discovers that an instance of it is already running, then it should display a message indicating that it is already running and exit.

#Bash_Shell

Bash Shell

local fd=${2:-200} # create lock file eval "exec $fd>/tmp/my_lock.lock" # acquire the lock, or fail flock -nx $fd \ && # do something if you got the lock \ || # do something if you did not get the lock

Give a code snippet in #Bash_Shell This task is to determine if there is only one instance of an application running. If the program discovers that an instance of it is already running, then it should display a message indicating that it is already running and exit.

christopher/rosetta-code

http://rosettacode.org/wiki/Strip_comments_from_a_string

Strip comments from a string

Strip comments from a string You are encouraged to solve this task according to the task description, using any language you may know. The task is to remove text that follow any of a set of comment markers, (in these examples either a hash or a semicolon) from a string or input line. Whitespace debacle: There is s...

#AutoIt

AutoIt

Dim $Line1 = "apples, pears # and bananas" Dim $Line2 = "apples, pears ; and bananas" _StripAtMarker($Line1) _StripAtMarker($Line2) Func _StripAtMarker($_Line, $sMarker='# ;') Local $aMarker = StringSplit($sMarker, ' ') Local $iPos For $i = 1 To $aMarker[0] $iPos = StringInStr($_Line, $aMarker[$i]) If $iPo...

Give a code snippet in #AutoIt Strip comments from a string You are encouraged to solve this task according to the task description, using any language you may know. The task is to remove text that follow any of a set of comment markers, (in these examples either a hash or a semicolon) from a string or input line. ...

christopher/rosetta-code

http://rosettacode.org/wiki/Brownian_tree

Brownian tree

Brownian tree You are encouraged to solve this task according to the task description, using any language you may know. Task Generate and draw a Brownian Tree. A Brownian Tree is generated as a result of an initial seed, followed by the interaction of two processes. The initial "seed" is placed somewhere wi...

#PicoLisp

PicoLisp

(load "@lib/simul.l") (de brownianTree (File Size Cnt) (let Img (grid Size Size) (put Img (/ Size 2) (/ Size 2) 'pix T) (use (P Q) (do Cnt (setq P (get Img (rand 1 Size) (rand 1 Size))) (loop (setq Q ((if2 (rand T) (rand T) north east south west) P)) ...

Give a code snippet in #PicoLisp Brownian tree You are encouraged to solve this task according to the task description, using any language you may know. Task Generate and draw a Brownian Tree. A Brownian Tree is generated as a result of an initial seed, followed by the interaction of two processes. The ini...

christopher/rosetta-code

http://rosettacode.org/wiki/Generate_lower_case_ASCII_alphabet

Generate lower case ASCII alphabet

Task Generate an array, list, lazy sequence, or even an indexable string of all the lower case ASCII characters, from a to z. If the standard library contains such a sequence, show how to access it, but don't fail to show how to generate a similar sequence. For this basic task use a reliable style of coding, a sty...

#PHP

PHP

<?php $lower = range('a', 'z'); var_dump($lower); ?>

Give a code snippet in #PHP Task Generate an array, list, lazy sequence, or even an indexable string of all the lower case ASCII characters, from a to z. If the standard library contains such a sequence, show how to access it, but don't fail to show how to generate a similar sequence. For this basic task use a re...

christopher/rosetta-code

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

Hello world/Text

Hello world/Text is part of Short Circuit's Console Program Basics selection. Task Display the string Hello world! on a text console. Related tasks Hello world/Graphical Hello world/Line Printer Hello world/Newbie Hello world/Newline omission Hello world/Standard error Hello world/Web server

#Morfa

Morfa

import morfa.io.print; func main(): void { println("Hello world!"); }

Give a code snippet in #Morfa Hello world/Text is part of Short Circuit's Console Program Basics selection. Task Display the string Hello world! on a text console. Related tasks Hello world/Graphical Hello world/Line Printer Hello world/Newbie Hello world/Newline omission Hello world/Standard error ...

christopher/rosetta-code

http://rosettacode.org/wiki/Convex_hull

Convex hull

Find the points which form a convex hull from a set of arbitrary two dimensional points. For example, given the points (16,3), (12,17), (0,6), (-4,-6), (16,6), (16,-7), (16,-3), (17,-4), (5,19), (19,-8), (3,16), (12,13), (3,-4), (17,5), (-3,15), (-3,-9), (0,11), (-9,-3), (-4,-2) and (12,10) the convex hull would be (-...

#Julia

Julia

# v1.0.4 # https://github.com/JuliaPolyhedra/Polyhedra.jl/blob/master/examples/operations.ipynb using Polyhedra, CDDLib A = vrep([[16,3], [12,17], [0,6], [-4,-6], [16,6], [16,-7], [16,-3], [17,-4], [5,19], [19,-8], [3,16], [12,13], [3,-4], [17,5], [-3,15], [-3,-9], [0,11], [-9,-3], [-4,-2], [12,10]]) P = polyhedron(...

Give a code snippet in #Julia Find the points which form a convex hull from a set of arbitrary two dimensional points. For example, given the points (16,3), (12,17), (0,6), (-4,-6), (16,6), (16,-7), (16,-3), (17,-4), (5,19), (19,-8), (3,16), (12,13), (3,-4), (17,5), (-3,15), (-3,-9), (0,11), (-9,-3), (-4,-2) and (12,...

christopher/rosetta-code

http://rosettacode.org/wiki/Terminal_control/Display_an_extended_character

Terminal control/Display an extended character

Task Display an extended (non ASCII) character onto the terminal. Specifically, display a £ (GBP currency sign).

#Scala

Scala

object ExtendedCharacter extends App { println("£") println("札幌") }

Give a code snippet in #Scala Task Display an extended (non ASCII) character onto the terminal. Specifically, display a £ (GBP currency sign).

christopher/rosetta-code

http://rosettacode.org/wiki/Fibonacci_sequence

Fibonacci sequence

The Fibonacci sequence is a sequence Fn of natural numbers defined recursively: F0 = 0 F1 = 1 Fn = Fn-1 + Fn-2, if n>1 Task Write a function to generate the nth Fibonacci number. Solutions can be iterative or recursive (though recursive solutions are generally considered too slow ...

#E

E

def fib(n) { var s := [0, 1] for _ in 0..!n { def [a, b] := s s := [b, a+b] } return s[0] }

Give a code snippet in #E The Fibonacci sequence is a sequence Fn of natural numbers defined recursively: F0 = 0 F1 = 1 Fn = Fn-1 + Fn-2, if n>1 Task Write a function to generate the nth Fibonacci number. Solutions can be iterative or recursive (though recursive solutions are gen...

christopher/rosetta-code

http://rosettacode.org/wiki/Associative_array/Creation

Associative array/Creation

Task The goal is to create an associative array (also known as a dictionary, map, or hash). Related tasks: Associative arrays/Iteration Hash from two arrays See also Array Associative array: Creation, Iteration Collections Compound data type Doubly-linked list: Definition, Element definition, Element ins...

#AutoIt

AutoIt

; Associative arrays in AutoIt. ; All the required functions are below the examples. ; Initialize an error handler to deal with any COM errors.. global $oMyError = ObjEvent("AutoIt.Error", "AAError") ; first example, simple. global $simple ; Initialize your array ... AAInit($simple) AAAdd($simple, "Appple", "fr...

Give a code snippet in #AutoIt Task The goal is to create an associative array (also known as a dictionary, map, or hash). Related tasks: Associative arrays/Iteration Hash from two arrays See also Array Associative array: Creation, Iteration Collections Compound data type Doubly-linked list: Definition,...

christopher/rosetta-code

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

Roman numerals/Decode

Task Create a function that takes a Roman numeral as its argument and returns its value as a numeric decimal integer. You don't need to validate the form of the Roman numeral. Modern Roman numerals are written by expressing each decimal digit of the number to be encoded separately, starting with the leftmost decima...

#jq

jq

def fromRoman: def addRoman(n): if length == 0 then n elif startswith("M") then .[1:] | addRoman(1000 + n) elif startswith("CM") then .[2:] | addRoman(900 + n) elif startswith("D") then .[1:] | addRoman(500 + n) elif startswith("CD") then .[2:] | addRoman(400 + n) elif startswith("C") then ...

Give a code snippet in #jq Task Create a function that takes a Roman numeral as its argument and returns its value as a numeric decimal integer. You don't need to validate the form of the Roman numeral. Modern Roman numerals are written by expressing each decimal digit of the number to be encoded separately, start...

christopher/rosetta-code

http://rosettacode.org/wiki/State_name_puzzle

State name puzzle

Background This task is inspired by Mark Nelson's DDJ Column "Wordplay" and one of the weekly puzzle challenges from Will Shortz on NPR Weekend Edition [1] and originally attributed to David Edelheit. The challenge was to take the names of two U.S. States, mix them all together, then rearrange the letters to form the...

#Racket

Racket

#lang racket (define states (list->set (map string-downcase '("Alabama" "Alaska" "Arizona" "Arkansas" "California" "Colorado" "Connecticut" "Delaware" "Florida" "Georgia" "Hawaii" "Idaho" "Illinois" "Indiana" "Iowa" "Kansas" "Kentucky" "Loui...

Give a code snippet in #Racket Background This task is inspired by Mark Nelson's DDJ Column "Wordplay" and one of the weekly puzzle challenges from Will Shortz on NPR Weekend Edition [1] and originally attributed to David Edelheit. The challenge was to take the names of two U.S. States, mix them all together, then r...

christopher/rosetta-code

http://rosettacode.org/wiki/HTTPS/Authenticated

HTTPS/Authenticated

The goal of this task is to demonstrate HTTPS requests with authentication. Implementations of this task should not use client certificates for this: that is the subject of another task.

#Rust

Rust

extern crate reqwest; use reqwest::blocking::Client; use reqwest::header::CONNECTION; fn main() { let client = Client::new(); // reqwest uses strongly-typed structs for creating headers let res = client .get("https://www.example.com") .basic_auth("user", Some("password")) .he...

Give a code snippet in #Rust The goal of this task is to demonstrate HTTPS requests with authentication. Implementations of this task should not use client certificates for this: that is the subject of another task.

christopher/rosetta-code

http://rosettacode.org/wiki/Permutations/Derangements

Permutations/Derangements

A derangement is a permutation of the order of distinct items in which no item appears in its original place. For example, the only two derangements of the three items (0, 1, 2) are (1, 2, 0), and (2, 0, 1). The number of derangements of n distinct items is known as the subfactorial of n, sometimes written as !n. The...

#Phix

Phix

with javascript_semantics function deranged(sequence s1, sequence s2) for i=1 to length(s1) do if s1[i]==s2[i] then return 0 end if end for return 1 end function function derangements(integer n) sequence ts = tagset(n) sequence res = {} for i=1 to factorial(n) do sequence s = p...

Give a code snippet in #Phix A derangement is a permutation of the order of distinct items in which no item appears in its original place. For example, the only two derangements of the three items (0, 1, 2) are (1, 2, 0), and (2, 0, 1). The number of derangements of n distinct items is known as the subfactorial of n...

christopher/rosetta-code

http://rosettacode.org/wiki/Send_email

Send email

Task Write a function to send an email. The function should have parameters for setting From, To and Cc addresses; the Subject, and the message text, and optionally fields for the server name and login details. If appropriate, explain what notifications of problems/success are given. Solutions using libraries or f...

#Delphi

Delphi

procedure SendEmail; var msg: TIdMessage; smtp: TIdSMTP; begin smtp := TIdSMTP.Create; try smtp.Host := 'smtp.server.com'; smtp.Port := 587; smtp.Username := 'login'; smtp.Password := 'password'; smtp.AuthType := satNone; smtp.Connect; msg := TIdMessage.Create(nil); try w...

Give a code snippet in #Delphi Task Write a function to send an email. The function should have parameters for setting From, To and Cc addresses; the Subject, and the message text, and optionally fields for the server name and login details. If appropriate, explain what notifications of problems/success are given....

christopher/rosetta-code

http://rosettacode.org/wiki/File_extension_is_in_extensions_list

File extension is in extensions list

File extension is in extensions list You are encouraged to solve this task according to the task description, using any language you may know. Filename extensions are a rudimentary but commonly used way of identifying files types. Task Given an arbitrary filename and a list of extensions, tell whether the filename...

#Lua

Lua

-- Data declarations local extentions = {"zip", "rar", "7z", "gz", "archive", "A##", "tar.bz2"} local testCases = { "MyData.a##", "MyData.tar.Gz", "MyData.gzip", "MyData.7z.backup", "MyData...", "MyData", "MyData_v1.0.tar.bz2", "MyData_v1.0.bz2" } -- Return boolean of whether example has a file extens...

Give a code snippet in #Lua File extension is in extensions list You are encouraged to solve this task according to the task description, using any language you may know. Filename extensions are a rudimentary but commonly used way of identifying files types. Task Given an arbitrary filename and a list of extensio...

christopher/rosetta-code

http://rosettacode.org/wiki/Collections

Collections

This task has been clarified. Its programming examples are in need of review to ensure that they still fit the requirements of the task. Collections are abstractions to represent sets of values. In statically-typed languages, the values are typically of a common data type. Task Create a collection, and add a fe...

#Ursala

Ursala

x = <1,5,6> y = <'foo','bar'> z = 3:<6,8>

Give a code snippet in #Ursala This task has been clarified. Its programming examples are in need of review to ensure that they still fit the requirements of the task. Collections are abstractions to represent sets of values. In statically-typed languages, the values are typically of a common data type. Task C...

christopher/rosetta-code

http://rosettacode.org/wiki/Date_format

Date format

This task has been clarified. Its programming examples are in need of review to ensure that they still fit the requirements of the task. Task Display the current date in the formats of: 2007-11-23 and Friday, November 23, 2007

#Icon_and_Unicon

Icon and Unicon

procedure main() write(map(&date,"/","-")) write(&dateline ? tab(find(&date[1:5])+4)) end

Give a code snippet in #Icon_and_Unicon This task has been clarified. Its programming examples are in need of review to ensure that they still fit the requirements of the task. Task Display the current date in the formats of: 2007-11-23 and Friday, November 23, 2007

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

#Quackery

Quackery

[ ' [ ' unbuild dup 4 split rot space rot 3 times join echo$ ] unbuild dup 4 split rot space rot 3 times join echo$ ]

Give a code snippet in #Quackery 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/Generator/Exponential

Generator/Exponential

A generator is an executable entity (like a function or procedure) that contains code that yields a sequence of values, one at a time, so that each time you call the generator, the next value in the sequence is provided. Generators are often built on top of coroutines or objects so that the internal state of the objec...

#Perl

Perl

# gen_pow($m) creates and returns an anonymous subroutine that will # generate and return the powers 0**m, 1**m, 2**m, ... sub gen_pow { my $m = shift; my $e = 0; return sub { return $e++ ** $m; }; } # gen_filter($g1, $g2) generates everything returned from $g1 that # is not also returned from $g2. Both $...

Give a code snippet in #Perl A generator is an executable entity (like a function or procedure) that contains code that yields a sequence of values, one at a time, so that each time you call the generator, the next value in the sequence is provided. Generators are often built on top of coroutines or objects so that t...

christopher/rosetta-code

http://rosettacode.org/wiki/Greatest_element_of_a_list

Greatest element of a list

Task Create a function that returns the maximum value in a provided set of values, where the number of values may not be known until run-time.

#Amazing_Hopper

Amazing Hopper

#include <hopper.h> main: lst=0 max=0 file="datos.txt" {","} toksep {file} statsfile {file} load mov (lst) {0} reshape (lst) {lst} array (SORT) [end] get (lst) mov ...

Give a code snippet in #Amazing_Hopper Task Create a function that returns the maximum value in a provided set of values, where the number of values may not be known until run-time.

christopher/rosetta-code

http://rosettacode.org/wiki/Constrained_genericity

Constrained genericity

Constrained genericity or bounded quantification means that a parametrized type or function (see parametric polymorphism) can only be instantiated on types fulfilling some conditions, even if those conditions are not used in that function. Say a type is called "eatable" if you can call the function eat on it. Write a ...

#Sidef

Sidef

class FoodBox(*food { .all { .respond_to(:eat) } }) { } class Fruit { method eat { ... } } class Apple < Fruit { } say FoodBox(Fruit(), Apple()).dump #=> FoodBox(food: [Fruit(), Apple()]) say FoodBox(Apple(), "foo") #!> ERROR: class `FoodBox` !~ (Apple, String)

Give a code snippet in #Sidef Constrained genericity or bounded quantification means that a parametrized type or function (see parametric polymorphism) can only be instantiated on types fulfilling some conditions, even if those conditions are not used in that function. Say a type is called "eatable" if you can call t...

christopher/rosetta-code

http://rosettacode.org/wiki/Inheritance/Single

Inheritance/Single

This task is about derived types; for implementation inheritance, see Polymorphism. Inheritance is an operation of type algebra that creates a new type from one or several parent types. The obtained type is called derived type. It inherits some of the properties of its parent types. Usually inherited properties...

#PureBasic

PureBasic

Interface Animal Eat() Sleep() EndInterface Interface Cat Extends Animal ChaseMouse() EndInterface Interface Dog Extends Animal Bark() WagTail() EndInterface Interface Lab Extends Dog Swim() EndInterface Interface Collie Extends Dog HeardSheep() EndInterface

Give a code snippet in #PureBasic This task is about derived types; for implementation inheritance, see Polymorphism. Inheritance is an operation of type algebra that creates a new type from one or several parent types. The obtained type is called derived type. It inherits some of the properties of its parent t...

christopher/rosetta-code

http://rosettacode.org/wiki/Totient_function

Totient function

The totient function is also known as: Euler's totient function Euler's phi totient function phi totient function Φ function (uppercase Greek phi) φ function (lowercase Greek phi) Definitions (as per number theory) The totient function: counts the integers up to a given positiv...

#Java

Java

public class TotientFunction { public static void main(String[] args) { computePhi(); System.out.println("Compute and display phi for the first 25 integers."); System.out.printf("n Phi IsPrime%n"); for ( int n = 1 ; n <= 25 ; n++ ) { System.out.printf("%2d %2d %b%...

Give a code snippet in #Java The totient function is also known as: Euler's totient function Euler's phi totient function phi totient function Φ function (uppercase Greek phi) φ function (lowercase Greek phi) Definitions (as per number theory) The totient function: counts the ...

christopher/rosetta-code

http://rosettacode.org/wiki/Align_columns

Align columns

Given a text file of many lines, where fields within a line are delineated by a single 'dollar' character, write a program that aligns each column of fields by ensuring that words in each column are separated by at least one space. Further, allow for each word in a column to be either left justified, right justified, o...

#Snobol

Snobol

* Since we don't know how much text we'll be reading in, * we store the words and field widths in tables Words = TABLE() Widths = TABLE() * Match text from start of string to the first dollar sign WordPat = POS(0) BREAK('$') . Word LE...

Give a code snippet in #Snobol Given a text file of many lines, where fields within a line are delineated by a single 'dollar' character, write a program that aligns each column of fields by ensuring that words in each column are separated by at least one space. Further, allow for each word in a column to be either le...

christopher/rosetta-code

http://rosettacode.org/wiki/Determine_if_a_string_has_all_unique_characters

Determine if a string has all unique characters

Task Given a character string (which may be empty, or have a length of zero characters): create a function/procedure/routine to: determine if all the characters in the string are unique indicate if or which character is duplicated and where display each string and its length (as the strings are being ...

#Ada

Ada

with Ada.Integer_Text_IO; use Ada.Integer_Text_IO; with Ada.Text_IO; use Ada.Text_IO; procedure Test_All_Chars_Unique is procedure All_Chars_Unique (S : in String) is begin Put_Line ("Input = """ & S & """, length =" & S'Length'Image); for I in S'First .. S'Last - 1 loop for J in I + 1 .. S'L...

Give a code snippet in #Ada Task Given a character string (which may be empty, or have a length of zero characters): create a function/procedure/routine to: determine if all the characters in the string are unique indicate if or which character is duplicated and where display each string and its length...

christopher/rosetta-code

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

Loops/Infinite

Task Print out SPAM followed by a newline in an infinite loop. Related tasks Loop over multiple arrays simultaneously Loops/Break Loops/Continue Loops/Do-while Loops/Downward for Loops/For Loops/For with a specified step Loops/Foreach Loops/Increment loop index within l...

#Pixilang

Pixilang

start: fputs("SPAM\n") go start

Give a code snippet in #Pixilang Task Print out SPAM followed by a newline in an infinite loop. Related tasks Loop over multiple arrays simultaneously Loops/Break Loops/Continue Loops/Do-while Loops/Downward for Loops/For Loops/For with a specified step Loops/Foreach L...

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

#Action.21

Action!

DEFINE SYMBOL_TABLE_SIZE="26" PROC InitSymbolTable(BYTE ARRAY table BYTE len) BYTE i FOR i=0 TO len-1 DO table(i)=i+'a OD RETURN BYTE FUNC Find(BYTE ARRAY table BYTE len,c) BYTE i FOR i=0 TO len-1 DO IF table(i)=c THEN RETURN (i) FI OD Break() RETURN (0) PROC MoveToFront(BY...

Give a code snippet in #Action.21 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 us...

christopher/rosetta-code

http://rosettacode.org/wiki/Boolean_values

Boolean values

Task Show how to represent the boolean states "true" and "false" in a language. If other objects represent "true" or "false" in conditionals, note it. Related tasks Logical operations

#PostScript

PostScript

true false

Give a code snippet in #PostScript Task Show how to represent the boolean states "true" and "false" in a language. If other objects represent "true" or "false" in conditionals, note it. Related tasks Logical operations

christopher/rosetta-code

http://rosettacode.org/wiki/Formatted_numeric_output

Formatted numeric output

Task Express a number in decimal as a fixed-length string with leading zeros. For example, the number 7.125 could be expressed as 00007.125.

#Liberty_BASIC

Liberty BASIC

for i =1 to 10 n =rnd( 1) *10^( int( 10 *rnd(1)) -2) print "Raw number ="; n; "Using custom function ="; FormattedPrint$( n, 16, 5) next i end function FormattedPrint$( n, length, decPlaces) format$ ="#." for i =1 to decPlaces format$ =format$ +"#" next i n$ =using( format$, n) ...

Give a code snippet in #Liberty_BASIC Task Express a number in decimal as a fixed-length string with leading zeros. For example, the number 7.125 could be expressed as 00007.125.

christopher/rosetta-code

http://rosettacode.org/wiki/Look-and-say_sequence

Look-and-say sequence

The Look and say sequence is a recursively defined sequence of numbers studied most notably by John Conway. The look-and-say sequence is also known as the Morris Number Sequence, after cryptographer Robert Morris, and the puzzle What is the next number in the sequence 1, 11, 21, 1211, 11122...

#Erlang

Erlang

-module(str). -export([look_and_say/1, look_and_say/2]). %% converts a single number look_and_say([H|T]) -> lists:reverse(look_and_say(T,H,1,"")). %% converts and accumulates as a loop look_and_say(_, 0) -> []; look_and_say(Start, Times) when Times > 0 -> [Start | look_and_say(look_and_say(Start), Times-1)]. ...

Give a code snippet in #Erlang The Look and say sequence is a recursively defined sequence of numbers studied most notably by John Conway. The look-and-say sequence is also known as the Morris Number Sequence, after cryptographer Robert Morris, and the puzzle What is the next number in the sequenc...

christopher/rosetta-code

http://rosettacode.org/wiki/Assertions

Assertions

Assertions are a way of breaking out of code when there is an error or an unexpected input. Some languages throw exceptions and some treat it as a break point. Task Show an assertion in your language by asserting that an integer variable is equal to 42.

#Vlang

Vlang

fn main(){ x := 43 assert x == 43 // Fine assert x > 42 // Fine assert x == 42 // Fails }

Give a code snippet in #Vlang Assertions are a way of breaking out of code when there is an error or an unexpected input. Some languages throw exceptions and some treat it as a break point. Task Show an assertion in your language by asserting that an integer variable is equal to 42.

christopher/rosetta-code

http://rosettacode.org/wiki/One_of_n_lines_in_a_file

One of n lines in a file

A method of choosing a line randomly from a file: Without reading the file more than once When substantial parts of the file cannot be held in memory Without knowing how many lines are in the file Is to: keep the first line of the file as a possible choice, then Read the second line of the file if possible and m...

#Mathematica.2FWolfram_Language

Mathematica/Wolfram Language

chooseLine[file_] := Block[{strm = OpenRead[file], n = 1, rec, selected}, rec = selected = Read[strm]; While[rec =!= EndOfFile, rec=Read[strm]; n++; ...

Give a code snippet in #Mathematica.2FWolfram_Language A method of choosing a line randomly from a file: Without reading the file more than once When substantial parts of the file cannot be held in memory Without knowing how many lines are in the file Is to: keep the first line of the file as a possible choice, ...

christopher/rosetta-code

http://rosettacode.org/wiki/Doubly-linked_list/Traversal

Doubly-linked list/Traversal

Traverse from the beginning of a doubly-linked list to the end, and from the end to the beginning. See also Array Associative array: Creation, Iteration Collections Compound data type Doubly-linked list: Definition, Element definition, Element insertion, List Traversal, Element Removal Linked list Queue: Def...

#Groovy

Groovy

class DoubleLinkedListTraversing { static void main(args) { def linkedList = (1..9).collect() as LinkedList linkedList.each { print it } println() linkedList.reverseEach { print it } } }

Give a code snippet in #Groovy Traverse from the beginning of a doubly-linked list to the end, and from the end to the beginning. See also Array Associative array: Creation, Iteration Collections Compound data type Doubly-linked list: Definition, Element definition, Element insertion, List Traversal, Element ...

christopher/rosetta-code

http://rosettacode.org/wiki/Lucas-Lehmer_test

Lucas-Lehmer test

Lucas-Lehmer Test: for p {\displaystyle p} an odd prime, the Mersenne number 2 p − 1 {\displaystyle 2^{p}-1} is prime if and only if 2 p − 1 {\displaystyle 2^{p}-1} divides S ( p − 1 ) {\displaystyle S(p-1)} where S ( n + 1 ) = ( S ( n ) ) 2 − 2 {\displaystyle S(n+1)=(...

#PureBasic

PureBasic

Procedure Lucas_Lehmer_Test(p) Protected mp.q = (1 << p) - 1, sn.q = 4, i For i = 3 To p sn = (sn * sn - 2) % mp Next If sn = 0 ProcedureReturn #True EndIf ProcedureReturn #False EndProcedure #upperBound = SizeOf(Quad) * 8 - 1 ;equivalent to significant bits in a signed quad integer If OpenConsole...

Give a code snippet in #PureBasic Lucas-Lehmer Test: for p {\displaystyle p} an odd prime, the Mersenne number 2 p − 1 {\displaystyle 2^{p}-1} is prime if and only if 2 p − 1 {\displaystyle 2^{p}-1} divides S ( p − 1 ) {\displaystyle S(p-1)} where S ( n + 1 ) = ( S ( n ) )...

christopher/rosetta-code

http://rosettacode.org/wiki/Knapsack_problem/0-1

Knapsack problem/0-1

A tourist wants to make a good trip at the weekend with his friends. They will go to the mountains to see the wonders of nature, so he needs to pack well for the trip. He has a good knapsack for carrying things, but knows that he can carry a maximum of only 4kg in it, and it will have to last the whole day. He cre...

#PHP

PHP

######################################################### # 0-1 Knapsack Problem Solve with memoization optimize and index returns # $w = weight of item # $v = value of item # $i = index # $aW = Available Weight # $m = Memo items array # PHP Translation from Python, Memoization, # and index return functionality added b...

Give a code snippet in #PHP A tourist wants to make a good trip at the weekend with his friends. They will go to the mountains to see the wonders of nature, so he needs to pack well for the trip. He has a good knapsack for carrying things, but knows that he can carry a maximum of only 4kg in it, and it will have t...

christopher/rosetta-code

http://rosettacode.org/wiki/Parsing/Shunting-yard_algorithm

Parsing/Shunting-yard algorithm

Task Given the operator characteristics and input from the Shunting-yard algorithm page and tables, use the algorithm to show the changes in the operator stack and RPN output as each individual token is processed. Assume an input of a correct, space separated, string of tokens representing an infix expression Gener...

#zkl

zkl

var input="3 + 4 * 2 / ( 1 - 5 ) ^ 2 ^ 3"; var opa=Dictionary("^",T(4,True), "*",T(3,False), // op:(prec,rAssoc) "/",T(3,False), "+",T(2,False), "-",T(2,False), ); "infix: ".println(input); "postfix:".println(parseInfix(input)); fcn parseInfix(e){ stack:=List(); // holds operators and left parenthesi...

Give a code snippet in #zkl Task Given the operator characteristics and input from the Shunting-yard algorithm page and tables, use the algorithm to show the changes in the operator stack and RPN output as each individual token is processed. Assume an input of a correct, space separated, string of tokens representi...

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

#IS-BASIC

IS-BASIC

100 PROGRAM "Combinat.bas" 110 LET MMAX=3:LET NMAX=5 120 NUMERIC COMB(0 TO MMAX) 130 CALL GENERATE(1) 140 DEF GENERATE(M) 150 NUMERIC N,I 160 IF M>MMAX THEN 170 FOR I=1 TO MMAX 180 PRINT COMB(I); 190 NEXT 200 PRINT 220 ELSE 230 FOR N=0 TO NMAX-1 240 IF M=1 OR N>COMB(M-1) THEN 250 ...

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

christopher/rosetta-code

http://rosettacode.org/wiki/Sequence:_smallest_number_greater_than_previous_term_with_exactly_n_divisors

Sequence: smallest number greater than previous term with exactly n divisors

Calculate the sequence where each term an is the smallest natural number greater than the previous term, that has exactly n divisors. Task Show here, on this page, at least the first 15 terms of the sequence. See also OEIS:A069654 Related tasks Sequence: smallest number with exactly n divisors Sequence: nth ...

#Go

Go

package main import "fmt" func countDivisors(n int) int { count := 0 for i := 1; i*i <= n; i++ { if n%i == 0 { if i == n/i { count++ } else { count += 2 } } } return count } func main() { const max = 15 fmt...

Give a code snippet in #Go Calculate the sequence where each term an is the smallest natural number greater than the previous term, that has exactly n divisors. Task Show here, on this page, at least the first 15 terms of the sequence. See also OEIS:A069654 Related tasks Sequence: smallest number with exactl...

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

#Wren

Wren

import "/fmt" for Fmt import "/big" for BigInt var p = BigInt.three.pow(BigInt.two) p = BigInt.four.pow(p) p = BigInt.five.pow(p) var s = p.toString Fmt.print("5 ^ 4 ^ 3 ^ 2 has $,d digits.\n", s.count) System.print("The first twenty are : %(s[0..19])") System.print("and the last twenty are : %(s[-20..-1])")

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

christopher/rosetta-code

http://rosettacode.org/wiki/Send_email

Send email

Task Write a function to send an email. The function should have parameters for setting From, To and Cc addresses; the Subject, and the message text, and optionally fields for the server name and login details. If appropriate, explain what notifications of problems/success are given. Solutions using libraries or f...

#Haskell

Haskell

{-# LANGUAGE OverloadedStrings #-} module Main (main) where import Network.Mail.SMTP ( Address(..) , htmlPart , plainTextPart , sendMailWithLogin' , simpleMail ) main :: IO () main = ...

Give a code snippet in #Haskell Task Write a function to send an email. The function should have parameters for setting From, To and Cc addresses; the Subject, and the message text, and optionally fields for the server name and login details. If appropriate, explain what notifications of problems/success are given...

christopher/rosetta-code

http://rosettacode.org/wiki/Averages/Root_mean_square

Averages/Root mean square

Task[edit] Compute the Root mean square of the numbers 1..10. The root mean square is also known by its initials RMS (or rms), and as the quadratic mean. The RMS is calculated as the mean of the squares of the numbers, square-rooted: x r m s = x 1 2 + x 2 2 + ⋯ + x ...

#Perl

Perl

use v5.10.0; sub rms { my $r = 0; $r += $_**2 for @_; sqrt( $r/@_ ); } say rms(1..10);

Give a code snippet in #Perl Task[edit] Compute the Root mean square of the numbers 1..10. The root mean square is also known by its initials RMS (or rms), and as the quadratic mean. The RMS is calculated as the mean of the squares of the numbers, square-rooted: x r m s = x 1 2 ...

christopher/rosetta-code

http://rosettacode.org/wiki/Roots_of_a_quadratic_function

Roots of a quadratic function

This task has been clarified. Its programming examples are in need of review to ensure that they still fit the requirements of the task. Write a program to find the roots of a quadratic equation, i.e., solve the equation a x 2 + b x + c = 0 {\displaystyle ax^{2}+bx+c=0} . Your program must correctly handle n...

#Factor

Factor

:: quadratic-equation ( a b c -- x1 x2 ) b sq a c * 4 * - sqrt :> sd b 0 < [ b neg sd + a 2 * / ] [ b neg sd - a 2 * / ] if :> x x c a x * / ;

Give a code snippet in #Factor This task has been clarified. Its programming examples are in need of review to ensure that they still fit the requirements of the task. Write a program to find the roots of a quadratic equation, i.e., solve the equation a x 2 + b x + c = 0 {\displaystyle ax^{2}+bx+c=0} . Your...

christopher/rosetta-code

http://rosettacode.org/wiki/Galton_box_animation

Galton box animation

Example of a Galton Box at the end of animation. A Galton device Sir Francis Galton's device is also known as a bean machine, a Galton Board, or a quincunx. Description of operation In a Galton box, there are a set of pins arranged in a triangular pattern. A number of balls are dropped so that ...

#Yabasic

Yabasic

bola$ = "0000ff" obst$ = "000000" maxBalls = 10 cx = 1 cy = 2 dim Balls(maxBalls, 2) open window 600,600 window origin "ct" maxh = peek("winheight") REM Draw the pins: FOR row = 1 TO 7 FOR col = 1 TO row FILL circle 40*col - 20*row, 40*row+80, 10 NEXT col NEXT row REM Animate tick = 0 bolas = 0 colo...

Give a code snippet in #Yabasic Example of a Galton Box at the end of animation. A Galton device Sir Francis Galton's device is also known as a bean machine, a Galton Board, or a quincunx. Description of operation In a Galton box, there are a set of pins arranged in a triangular pattern. A num...

christopher/rosetta-code

http://rosettacode.org/wiki/Continued_fraction

Continued fraction

continued fraction Mathworld a 0 + b 1 a 1 + b 2 a 2 + b 3 a 3 + ⋱ {\displaystyle a_{0}+{\cfrac {b_{1}}{a_{1}+{\cfrac {b_{2}}{a_{2}+{\cfrac {b_{3}}{a_{3}+\ddots }}}}}}} The task is to write a program which generates su...

#Ada

Ada

generic type Scalar is digits <>; with function A (N : in Natural) return Natural; with function B (N : in Positive) return Natural; function Continued_Fraction (Steps : in Natural) return Scalar;

Give a code snippet in #Ada continued fraction Mathworld a 0 + b 1 a 1 + b 2 a 2 + b 3 a 3 + ⋱ {\displaystyle a_{0}+{\cfrac {b_{1}}{a_{1}+{\cfrac {b_{2}}{a_{2}+{\cfrac {b_{3}}{a_{3}+\ddots }}}}}}} The task is to write...

christopher/rosetta-code

http://rosettacode.org/wiki/Magic_squares_of_doubly_even_order

Magic squares of doubly even order

A magic square is an N×N square matrix whose numbers consist of consecutive numbers arranged so that the sum of each row and column, and both diagonals are equal to the same sum (which is called the magic number or magic constant). A magic square of doubly even order has a size that is a multiple of four (e...

#Elixir

Elixir

defmodule Magic_square do def doubly_even(n) when rem(n,4)!=0, do: raise ArgumentError, "must be even, but not divisible by 4." def doubly_even(n) do n2 = n * n Enum.zip(1..n2, make_pattern(n)) |> Enum.map(fn {i,p} -> if p, do: i, else: n2 - i + 1 end) |> Enum.chunk(n) |> to_string(n) |> IO....

Give a code snippet in #Elixir A magic square is an N×N square matrix whose numbers consist of consecutive numbers arranged so that the sum of each row and column, and both diagonals are equal to the same sum (which is called the magic number or magic constant). A magic square of doubly even order has a size...

christopher/rosetta-code

http://rosettacode.org/wiki/Deepcopy

Deepcopy

Task Demonstrate how to copy data structures containing complex heterogeneous and cyclic semantics. This is often referred to as deep copying, and is normally required where structures are mutable and to ensure that independent copies can be manipulated without side-effects. If this facility is not built into the la...

#Lingo

Lingo

-- Supports lists, property lists, images, script instances and scalar values (integer, float, string, symbol). on deepcopy (var, cycleCheck) case ilk(var) of #list, #propList, #image: return var.duplicate() #instance: if string(var) starts "<Xtra " then return var -- deep copy makes no sense for Xtra...

Give a code snippet in #Lingo Task Demonstrate how to copy data structures containing complex heterogeneous and cyclic semantics. This is often referred to as deep copying, and is normally required where structures are mutable and to ensure that independent copies can be manipulated without side-effects. If this fa...

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

#CLU

CLU

% Sort an array in place using heap-sort. The contained type % may be any type that can be compared. heapsort = cluster [T: type] is sort where T has lt: proctype (T,T) returns (bool) rep = null aT = array[T] sort = proc (a: aT) % CLU arrays may start at any index. % For simpli...

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

christopher/rosetta-code

http://rosettacode.org/wiki/Create_an_HTML_table

Create an HTML table

Create an HTML table. The table body should have at least three rows of three columns. Each of these three columns should be labelled "X", "Y", and "Z". An extra column should be added at either the extreme left or the extreme right of the table that has no heading, but is filled with sequential row numbers. The...

#F.23

F#

open System.Xml type XmlDocument with member this.Add element = this.AppendChild element member this.Element name = this.CreateElement(name) :> XmlNode member this.Element (name, (attr : (string * string) list)) = let node = this.CreateElement(name) for a in attr do ...

Give a code snippet in #F.23 Create an HTML table. The table body should have at least three rows of three columns. Each of these three columns should be labelled "X", "Y", and "Z". An extra column should be added at either the extreme left or the extreme right of the table that has no heading, but is filled with...

christopher/rosetta-code

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

Catalan numbers/Pascal's triangle

Task Print out the first 15 Catalan numbers by extracting them from Pascal's triangle. See Catalan Numbers and the Pascal Triangle. This method enables calculation of Catalan Numbers using only addition and subtraction. Catalan's Triangle for a Number Triangle that generates Catalan Numbers using onl...

#EchoLisp

EchoLisp

(define dim 100) (define-syntax-rule (Tidx i j) (+ i (* dim j))) ;; generates Catalan's triangle ;; T (i , j) = T(i-1,j) + T (i, j-1) (define (T n) (define i (modulo n dim)) (define j (quotient n dim)) (cond ((zero? i) 1) ;; left column = 1 ((= i j) (T (Tidx (1- i) j))) ;; diagonal value = left value ...

Give a code snippet in #EchoLisp Task Print out the first 15 Catalan numbers by extracting them from Pascal's triangle. See Catalan Numbers and the Pascal Triangle. This method enables calculation of Catalan Numbers using only addition and subtraction. Catalan's Triangle for a Number Triangle that g...

christopher/rosetta-code

http://rosettacode.org/wiki/Queue/Usage

Queue/Usage

Data Structure This illustrates a data structure, a means of storing data within a program. You may see other such structures in the Data Structures category. Illustration of FIFO behavior Task Create a queue data structure and demonstrate its operations. (For implementations of queues, see the FIFO task.) Ope...

#Maple

Maple

q := queue[new](); queue[enqueue](q,1); queue[enqueue](q,2); queue[enqueue](q,3); queue[empty](q); >>>false queue[dequeue](q); >>>1 queue[dequeue](q); >>>2 queue[dequeue](q); >>>3 queue[empty](q); >>>true

Give a code snippet in #Maple Data Structure This illustrates a data structure, a means of storing data within a program. You may see other such structures in the Data Structures category. Illustration of FIFO behavior Task Create a queue data structure and demonstrate its operations. (For implementations of que...

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

#DCL

DCL

$ limit = p1 $ $ n = 0 $ h_'n = 1 $ x2 = 2 $ x3 = 3 $ x5 = 5 $ i = 0 $ j = 0 $ k = 0 $ $ n = 1 $ loop: $ x = x2 $ if x3 .lt. x then $ x = x3 $ if x5 .lt. x then $ x = x5 $ h_'n = x $ if x2 .eq. h_'n $ then $ i = i + 1 $ x2 = 2 * h_'i $ endif $ if x3 .eq. h_'n $ then $ j = j + 1 $ x3 = 3 * h_'j $ endif...

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

christopher/rosetta-code

http://rosettacode.org/wiki/Comma_quibbling

Comma quibbling

Comma quibbling is a task originally set by Eric Lippert in his blog. Task Write a function to generate a string output which is the concatenation of input words from a list/sequence where: An input of no words produces the output string of just the two brace characters "{}". An input of just one word, e.g. ["AB...

#EchoLisp

EchoLisp

(lib 'match) (define (quibble words) (match words [ null "{}"] [ (a) (format "{ %a }" a)] [ (a b) (format "{ %a and %a }" a b)] [( a ... b c) (format "{ %a %a and %a }" (for/string ([w a]) (string-append w ", ")) b c)] [else 'bad-input])) ;; output (for ([t ...

Give a code snippet in #EchoLisp Comma quibbling is a task originally set by Eric Lippert in his blog. Task Write a function to generate a string output which is the concatenation of input words from a list/sequence where: An input of no words produces the output string of just the two brace characters "{}". An...

christopher/rosetta-code

http://rosettacode.org/wiki/Conditional_structures

Conditional structures

Control Structures These are examples of control structures. You may also be interested in: Conditional structures Exceptions Flow-control structures Loops Task List the conditional structures offered by a programming language. See Wikipedia: conditionals for descriptions. Common conditional structures include ...

#TXR

TXR

@(choose :shortest x) @x:@y @(or) @x<--@y @(or) @x+@y @(end)

Give a code snippet in #TXR Control Structures These are examples of control structures. You may also be interested in: Conditional structures Exceptions Flow-control structures Loops Task List the conditional structures offered by a programming language. See Wikipedia: conditionals for descriptions. Common co...

christopher/rosetta-code

http://rosettacode.org/wiki/Arithmetic-geometric_mean/Calculate_Pi

Arithmetic-geometric mean/Calculate Pi

Almkvist Berndt 1988 begins with an investigation of why the agm is such an efficient algorithm, and proves that it converges quadratically. This is an efficient method to calculate π {\displaystyle \pi } . With the same notations used in Arithmetic-geometric mean, we can summarize the paper by writing: π ...

#C.2B.2B

C++

#include <gmpxx.h> #include <chrono> using namespace std; using namespace chrono; void agm(mpf_class& rop1, mpf_class& rop2, const mpf_class& op1, const mpf_class& op2) { rop1 = (op1 + op2) / 2; rop2 = op1 * op2; mpf_sqrt(rop2.get_mpf_t(), rop2.get_mpf_t()); } int main(void) { auto st = st...

Give a code snippet in #C.2B.2B Almkvist Berndt 1988 begins with an investigation of why the agm is such an efficient algorithm, and proves that it converges quadratically. This is an efficient method to calculate π {\displaystyle \pi } . With the same notations used in Arithmetic-geometric mean, we can summar...

christopher/rosetta-code

http://rosettacode.org/wiki/15_puzzle_game

15 puzzle game

Task Implement the Fifteen Puzzle Game. The 15-puzzle is also known as: Fifteen Puzzle Gem Puzzle Boss Puzzle Game of Fifteen Mystic Square 14-15 Puzzle and some others. Related Tasks 15 Puzzle Solver 16 Puzzle Game

#Haskell

Haskell

import Data.Array import System.Random type Puzzle = Array (Int, Int) Int main :: IO () main = do putStrLn "Please enter the difficulty level: 0, 1 or 2" userInput <- getLine let diffLevel = read userInput if userInput == "" || any (\c -> c < '0' || c > '9') userInput || diffLevel > 2 || diffLevel <...

Give a code snippet in #Haskell Task Implement the Fifteen Puzzle Game. The 15-puzzle is also known as: Fifteen Puzzle Gem Puzzle Boss Puzzle Game of Fifteen Mystic Square 14-15 Puzzle and some others. Related Tasks 15 Puzzle Solver 16 Puzzle Game

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

#SuperCollider

SuperCollider

f = { |x| x + 1 }; g = { |x| x * 2 }; h = g <> f; h.(8); // returns 18

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

christopher/rosetta-code

http://rosettacode.org/wiki/Ackermann_function

Ackermann function

The Ackermann function is a classic example of a recursive function, notable especially because it is not a primitive recursive function. It grows very quickly in value, as does the size of its call tree. The Ackermann function is usually defined as follows: A ( m , n ) = { n + 1 if m = 0 A ( m ...

#.D0.9C.D0.9A-61.2F52

МК-61/52

П1 <-> П0 ПП 06 С/П ИП0 x=0 13 ИП1 1 + В/О ИП1 x=0 24 ИП0 1 П1 - П0 ПП 06 В/О ИП0 П2 ИП1 1 - П1 ПП 06 П1 ИП2 1 - П0 ПП 06 В/О

Give a code snippet in #.D0.9C.D0.9A-61.2F52 The Ackermann function is a classic example of a recursive function, notable especially because it is not a primitive recursive function. It grows very quickly in value, as does the size of its call tree. The Ackermann function is usually defined as follows: A ( m...

christopher/rosetta-code

http://rosettacode.org/wiki/Web_scraping

Web scraping

Task Create a program that downloads the time from this URL: http://tycho.usno.navy.mil/cgi-bin/timer.pl and then prints the current UTC time by extracting just the UTC time from the web page's HTML. Alternatively, if the above url is not working, grab the first date/time off this page's talk page. If possible,...

#Maple

Maple

text := URL:-Get("http://tycho.usno.navy.mil/cgi-bin/timer.pl"): printf(StringTools:-StringSplit(text,"<BR>")[2]);

Give a code snippet in #Maple Task Create a program that downloads the time from this URL: http://tycho.usno.navy.mil/cgi-bin/timer.pl and then prints the current UTC time by extracting just the UTC time from the web page's HTML. Alternatively, if the above url is not working, grab the first date/time off this pa...

christopher/rosetta-code

http://rosettacode.org/wiki/Equilibrium_index

Equilibrium index

An equilibrium index of a sequence is an index into the sequence such that the sum of elements at lower indices is equal to the sum of elements at higher indices. For example, in a sequence A {\displaystyle A} : A 0 = − 7 {\displaystyle A_{0}=-7} A 1 = 1 {\displaystyle A_{1}=1} ...

#Objeck

Objeck

class Rosetta { function : Main(args : String[]) ~ Nil { sequence := [-7, 1, 5, 2, -4, 3, 0]; EqulibriumIndices(sequence); } function : EqulibriumIndices(sequence : Int[]) ~ Nil { # find total sum totalSum := 0; each(i : sequence) { totalSum += sequence[i]; }; # compare runni...

Give a code snippet in #Objeck An equilibrium index of a sequence is an index into the sequence such that the sum of elements at lower indices is equal to the sum of elements at higher indices. For example, in a sequence A {\displaystyle A} : A 0 = − 7 {\displaystyle A_{0}=-7} A 1 ...

christopher/rosetta-code

http://rosettacode.org/wiki/Palindrome_detection

Palindrome detection

A palindrome is a phrase which reads the same backward and forward. Task[edit] Write a function or program that checks whether a given sequence of characters (or, if you prefer, bytes) is a palindrome. For extra credit: Support Unicode characters. Write a second function (possibly as a wrapper to the first) which ...

#NewLISP

NewLISP

(define (palindrome? s) (setq r s) (reverse r) ; Reverse is destructive. (= s r)) ;; Make ‘reverse’ non-destructive and avoid a global variable (define (palindrome? s) (= s (reverse (copy s))))

Give a code snippet in #NewLISP A palindrome is a phrase which reads the same backward and forward. Task[edit] Write a function or program that checks whether a given sequence of characters (or, if you prefer, bytes) is a palindrome. For extra credit: Support Unicode characters. Write a second function (possibly ...

christopher/rosetta-code

http://rosettacode.org/wiki/Convex_hull

Convex hull

Find the points which form a convex hull from a set of arbitrary two dimensional points. For example, given the points (16,3), (12,17), (0,6), (-4,-6), (16,6), (16,-7), (16,-3), (17,-4), (5,19), (19,-8), (3,16), (12,13), (3,-4), (17,5), (-3,15), (-3,-9), (0,11), (-9,-3), (-4,-2) and (12,10) the convex hull would be (-...

#Raku

Raku

class Point { has Real $.x is rw; has Real $.y is rw; method gist { [~] '(', self.x,', ', self.y, ')' }; } sub ccw (Point $a, Point $b, Point $c) { ($b.x - $a.x)*($c.y - $a.y) - ($b.y - $a.y)*($c.x - $a.x); } sub tangent (Point $a, Point $b) { my $opp = $b.x - $a.x; my $adj = $b.y - $a.y; ...

Give a code snippet in #Raku Find the points which form a convex hull from a set of arbitrary two dimensional points. For example, given the points (16,3), (12,17), (0,6), (-4,-6), (16,6), (16,-7), (16,-3), (17,-4), (5,19), (19,-8), (3,16), (12,13), (3,-4), (17,5), (-3,15), (-3,-9), (0,11), (-9,-3), (-4,-2) and (12,1...

christopher/rosetta-code

http://rosettacode.org/wiki/Arithmetic-geometric_mean

Arithmetic-geometric mean

This page uses content from Wikipedia. The original article was at Arithmetic-geometric mean. 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) Task Write a function to compute the arithmetic-geomet...

#Ring

Ring

decimals(9) see agm(1, 1/sqrt(2)) + nl see agm(1,1/pow(2,0.5)) + nl func agm agm,g while agm an = (agm + g)/2 gn = sqrt(agm*g) if fabs(agm-g) <= fabs(an-gn) exit ok agm = an g = gn end return gn

Give a code snippet in #Ring This page uses content from Wikipedia. The original article was at Arithmetic-geometric mean. 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) Task Write a function to...

christopher/rosetta-code

http://rosettacode.org/wiki/Summarize_primes

Summarize primes

Task Considering in order of length, n, all sequences of consecutive primes, p, from 2 onwards, where p < 1000 and n>0, select those sequences whose sum is prime, and for these display the length of the sequence, the last item in the sequence, and the sum.

#C.2B.2B

C++

#include <iostream> bool is_prime(int n) { if (n < 2) { return false; } if (n % 2 == 0) { return n == 2; } if (n % 3 == 0) { return n == 3; } int i = 5; while (i * i <= n) { if (n % i == 0) { return false; } i += 2; ...

Give a code snippet in #C.2B.2B Task Considering in order of length, n, all sequences of consecutive primes, p, from 2 onwards, where p < 1000 and n>0, select those sequences whose sum is prime, and for these display the length of the sequence, the last item in the sequence, and the sum.

christopher/rosetta-code

http://rosettacode.org/wiki/OpenGL

OpenGL

Task Display a smooth shaded triangle with OpenGL. Triangle created using C example compiled with GCC 4.1.2 and freeglut3.

#MAXScript

MAXScript

newMesh = mesh numVerts:3 numFaces:1 setMesh newMesh vertices:#([-100, -100, 0], [100, -100, 0], [-100, 100, 0]) faces:#([1, 2, 3]) defaultVCFaces newMesh setVertColor newMesh 1 red setVertColor newMesh 2 green setVertColor newMesh 3 blue setCVertMode newMesh true update newMesh viewport.setType #view_top max tool maxi...

Give a code snippet in #MAXScript Task Display a smooth shaded triangle with OpenGL. Triangle created using C example compiled with GCC 4.1.2 and freeglut3.

christopher/rosetta-code

http://rosettacode.org/wiki/URL_parser

URL parser

URLs are strings with a simple syntax: scheme://[username:password@]domain[:port]/path?query_string#fragment_id Task Parse a well-formed URL to retrieve the relevant information: scheme, domain, path, ... Note: this task has nothing to do with URL encoding or URL decoding. According to the standards, t...

#VBScript

VBScript

Function parse_url(url) parse_url = "URL: " & url If InStr(url,"//") Then 'parse the scheme scheme = Split(url,"//") parse_url = parse_url & vbcrlf & "Scheme: " & Mid(scheme(0),1,Len(scheme(0))-1) 'parse the domain domain = Split(scheme(1),"/") 'check if the domain includes a username, password, and por...

Give a code snippet in #VBScript URLs are strings with a simple syntax: scheme://[username:password@]domain[:port]/path?query_string#fragment_id Task Parse a well-formed URL to retrieve the relevant information: scheme, domain, path, ... Note: this task has nothing to do with URL encoding or URL decoding...

christopher/rosetta-code

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

Sorting algorithms/Comb sort

Sorting algorithms/Comb sort You are encouraged to solve this task according to the task description, using any language you may know. 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 algor...

#PicoLisp

PicoLisp

(de combSort (Lst) (let (Gap (length Lst) Swaps NIL) (while (or (> Gap 1) Swaps) (setq Gap (max 1 (/ (* Gap 4) 5))) (off Swaps) (use Lst (for (G (cdr (nth Lst Gap)) G (cdr G)) (when (> (car Lst) (car G)) (xchg Lst G) (...

Give a code snippet in #PicoLisp Sorting algorithms/Comb sort You are encouraged to solve this task according to the task description, using any language you may know. 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 compar...

christopher/rosetta-code

http://rosettacode.org/wiki/Musical_scale

Musical scale

Task Output the 8 notes of the C major diatonic scale to the default musical sound device on the system. Specifically, pitch must be tuned to 12-tone equal temperament (12TET) with the modern standard A=440Hz. These are the notes "C, D, E, F, G, A, B, C(1 octave higher)", or "Do, Re, Mi, Fa, Sol, La, Si/Ti, Do(1 octa...

#XPL0

XPL0

\Square waves on the beeper speaker: code Sound=39; real Period; int I; [Period:= 1190000.0/261.625565; \middle C for I:= 2 to 9 do [Sound(1, 4, fix(Period)); \times 2^(-1/6) else 2^(-1/12) Period:= Period * (if I&3 then 0.890898719 else 0.943874313); ]; ] \MIDI grand piano (requires 32-bit Wind...

Give a code snippet in #XPL0 Task Output the 8 notes of the C major diatonic scale to the default musical sound device on the system. Specifically, pitch must be tuned to 12-tone equal temperament (12TET) with the modern standard A=440Hz. These are the notes "C, D, E, F, G, A, B, C(1 octave higher)", or "Do, Re, Mi,...

christopher/rosetta-code

http://rosettacode.org/wiki/Temperature_conversion

Temperature conversion

There are quite a number of temperature scales. For this task we will concentrate on four of the perhaps best-known ones: Kelvin, Celsius, Fahrenheit, and Rankine. The Celsius and Kelvin scales have the same magnitude, but different null points. 0 degrees Celsius corresponds to 273.15 kelvin. 0 kelvin is absolute z...

#Ruby

Ruby

module TempConvert FROM_TEMP_SCALE_TO_K = {'kelvin' => lambda{|t| t}, 'celsius' => lambda{|t| t + 273.15}, 'fahrenheit' => lambda{|t| (t + 459.67) * 5/9.0}, 'rankine' => lambda{|t| t * 5/9.0}, 'delisle' => lambda{|t| 373.15 - t * 2/3.0}, 'newton' => lambda{|t| t * 100/33.0 + 273.1...

Give a code snippet in #Ruby There are quite a number of temperature scales. For this task we will concentrate on four of the perhaps best-known ones: Kelvin, Celsius, Fahrenheit, and Rankine. The Celsius and Kelvin scales have the same magnitude, but different null points. 0 degrees Celsius corresponds to 273.15 k...

christopher/rosetta-code

http://rosettacode.org/wiki/Quaternion_type

Quaternion type

Quaternions are an extension of the idea of complex numbers. A complex number has a real and complex part, sometimes written as a + bi, where a and b stand for real numbers, and i stands for the square root of minus 1. An example of a complex number might be -3 + 2i, wher...

#Scala

Scala

case class Quaternion(re: Double = 0.0, i: Double = 0.0, j: Double = 0.0, k: Double = 0.0) { lazy val im = (i, j, k) private lazy val norm2 = re*re + i*i + j*j + k*k lazy val norm = math.sqrt(norm2) def negative = Quaternion(-re, -i, -j, -k) def conjugate = Quaternion(re, -i, -j, -k) def reciprocal = Quat...

Give a code snippet in #Scala Quaternions are an extension of the idea of complex numbers. A complex number has a real and complex part, sometimes written as a + bi, where a and b stand for real numbers, and i stands for the square root of minus 1. An example of a complex number ...

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

#PureBasic

PureBasic

Procedure.s CC_encrypt(plainText.s, key, reverse = 0) ;if reverse <> 0 then reverse the encryption (decrypt) If reverse: reverse = 26: key = 26 - key: EndIf Static alphabet$ = "ABCEFGHIJKLMNOPQRSTUVWXYZABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyz" Protected result.s, i, len...

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

christopher/rosetta-code

http://rosettacode.org/wiki/Tau_number

Tau number

A Tau number is a positive integer divisible by the count of its positive divisors. Task Show the first 100 Tau numbers. The numbers shall be generated during run-time (i.e. the code may not contain string literals, sets/arrays of integers, or alike). Related task Tau function

#Go

Go

package main import "fmt" func countDivisors(n int) int { count := 0 i := 1 k := 2 if n%2 == 0 { k = 1 } for i*i <= n { if n%i == 0 { count++ j := n / i if j != i { count++ } } i += k } re...

Give a code snippet in #Go A Tau number is a positive integer divisible by the count of its positive divisors. Task Show the first 100 Tau numbers. The numbers shall be generated during run-time (i.e. the code may not contain string literals, sets/arrays of integers, or alike). Related task Tau function

christopher/rosetta-code