- The snippets are under the CC-BY-SA license.
- Please consider keeping a bookmark
- (instead of printing)
Scala | |||
---|---|---|---|
1 |
Print a literal string on standard output
|
||
2 |
Loop to execute some code a constant number of times
|
|
|
3 |
Like a function which doesn't return any value, thus has only side effects (e.g. Print to standard output)
|
||
4 |
Create a function which returns the square of an integer
|
||
5 |
Declare a container type for two floating-point numbers x and y
|
||
6 |
Do something with each item x of the list (or array) items, regardless indexes.
|
||
7 |
Print each index i with its value x from an array-like collection items
|
||
8 |
Create a new map object x, and provide some (key, value) pairs as initial content.
|
||
9 |
The structure must be recursive because left child and right child are binary trees too. A node has access to children nodes, but not to its parent.
|
Alternative implementation:
|
|
10 |
Generate a random permutation of the elements of list x
|
||
11 |
The list x must be non-empty.
|
||
12 |
Check if the list contains the value x.
list is an iterable finite container. |
||
13 |
Access each key k with its value x from an associative array mymap, and print them.
|
|
|
14 |
Pick a random number greater than or equals to a, strictly inferior to b. Precondition : a < b.
|
||
15 |
Pick a random integer greater than or equals to a, inferior or equals to b. Precondition : a < b.
|
||
17 |
The structure must be recursive. A node may have zero or more children. A node has access to its children nodes, but not to its parent.
|
||
19 |
Reverse the order of the elements of the list x.
This may reverse "in-place" and destroy the original ordering. |
||
20 |
Implement a function search which looks for item x in a 2D matrix m.
Return indices i, j of the matching cell. Think of the most idiomatic way in the language to return the two values at the same time. |
||
21 |
Swap the values of the variables a and b
|
||
22 |
Extract the integer value i from its string representation s (in radix 10)
|
||
24 |
Declare a new string s and initialize it with the literal value "ネコ" (which means "cat" in japanese)
|
||
26 |
Declare and initialize a matrix x having m rows and n columns, containing real numbers.
|
||
28 |
Sort the elements of the list (or array-like collection) items in ascending order of x.p, where p is a field of the type Item of the objects in items.
|
||
29 |
Remove i-th item from list items.
This will alter the original list or return a new list, depending on which is more idiomatic. Note that in most languages, the smallest valid value for i is 0. |
||
31 |
Create the recursive function f which returns the factorial of the non-negative integer i, calculated from f(i-1)
|
||
32 |
Create function exp which calculates (fast) the value x power n.
x and n are non-negative integers. |
||
34 |
Declare and initialize a set x containing unique objects of type T.
|
||
37 |
Transform a function that takes multiple arguments into a function for which some of the arguments are preset.
|
||
38 |
Find substring t consisting in characters i (included) to j (excluded) of string s.
Character indices start at 0 unless specified otherwise. Make sure that multibyte characters are properly handled. |
||
39 |
Set the boolean ok to true if the string word is contained in string s as a substring, or to false otherwise.
|
||
41 |
Create the string t containing the same characters as the string s, in reverse order.
The original string s must remain unaltered. Each character must be handled correctly regardless its number of bytes in memory. |
||
45 |
Sleep for 5 seconds in current thread, before proceeding with the next instructions.
|
|
|
46 |
Create the string t consisting of the 5 first characters of the string s.
Make sure that multibyte characters are properly handled. |
||
48 |
Assign to variable s a string literal consisting in several lines of text, including newlines.
|
||
49 |
Build list chunks consisting in substrings of the string s, separated by one or more space characters.
|
||
50 |
Write a loop that has no end clause.
|
||
51 |
Determine whether the map m contains an entry for the key k
|
||
52 |
Determine whether the map m contains an entry with the value v, for some key.
|
||
53 |
Concatenate elements of string list x joined by the separator ", " to create a single string y.
|
||
54 |
Calculate the sum s of the integer list or array x.
|
||
55 |
Create the string representation s (in radix 10) of the integer value i.
|
||
57 |
Create the list y containing the items from the list x that satisfy the predicate p. Respect the original ordering. Don't modify x in-place.
|
||
58 |
Create the string lines from the content of the file with filename f.
|
||
59 |
Print the message "x is negative" to standard error (stderr), with integer x value substitution (e.g. "-2 is negative").
|
||
71 |
Basic implementation of the Echo program: Print all arguments except the program name, separated by space, followed by newline.
The idiom demonstrates how to skip the first argument if necessary, concatenate arguments as strings, append newline and print it to stdout. |
||
76 |
Create the string s of integer x written in base 2.
E.g. 13 -> "1101" |
||
78 |
Execute a block once, then execute it again as long as boolean condition c is true.
|
||
96 |
Set the boolean b to true if string s starts with prefix prefix, false otherwise.
|
||
97 |
Set boolean b to true if string s ends with string suffix, false otherwise.
|
||
100 |
Sort elements of array-like collection items, using a comparator c.
|
||
101 |
Make an HTTP request with method GET to the URL u, then store the body of the response in the string s.
|
||
103 |
Read from the file data.xml and write its contents into the object x.
Assume the XML data is suitable for the type of x. |
||
110 |
Set the boolean blank to true if the string s is empty, or null, or contains only whitespace ; false otherwise.
|
|
|
112 |
Print each key k with its value x from an associative array mymap, in ascending order of k.
|
||
114 |
Set boolean b to true if objects x and y contain the same values, recursively comparing all referenced elements in x and y.
Tell if the code correctly handles recursive types. |
||
117 |
Set n to the number of elements of the list x.
|
||
118 |
Create the set y from the list x.
x may contain duplicates. y is unordered and has no repeated values. |
||
119 |
Remove duplicates from the list x.
Explain if the original order is preserved. |
||
120 |
Read an integer value from the standard input into the variable n
|
||
122 |
Create an enumerated type Suit with 4 possible values SPADES, HEARTS, DIAMONDS, CLUBS.
|
||
126 |
Write a function foo that returns a string and a boolean value.
|
||
131 |
Execute f1 if condition c1 is true, or else f2 if condition c2 is true, or else f3 if condition c3 is true.
Don't evaluate a condition when a previous condition was true. |
||
134 |
Declare and initialize a new list items, containing 3 elements a, b, c.
|
||
136 |
Remove all occurrences of the value x from list items.
This will alter the original list or return a new list, depending on which is more idiomatic. |
||
137 |
Set the boolean b to true if the string s contains only characters in the range '0'..'9', false otherwise.
|
||
140 |
Delete from map m the entry having key k.
Explain what happens if k is not an existing key in m. |
||
142 |
Assign to string s the hexadecimal representation (base 16) of integer x.
E.g. 999 -> "3e7" |
||
150 |
Remove the last character from the string p, if this character is a forward slash /
|
|
|
153 |
Create the string t as the concatenation of the string s and the integer i.
|
||
157 |
Initialize a constant planet with string value "Earth".
|
||
161 |
Multiply all the elements of the list elements by a constant c
|
||
163 |
Print all the list elements, two by two, assuming list length is even.
|
||
165 |
Assign to the variable x the last element of the list items.
|
||
166 |
Create the list ab containing all the elements of the list a, followed by all the elements of the list b.
|
||
169 |
Assign to the integer n the number of characters of the string s.
Make sure that multibyte characters are properly handled. n can be different from the number of bytes of s. |
||
170 |
Set n to the number of elements stored in mymap.
This is not always equal to the map capacity. |
||
173 |
Number will be formatted with a comma separator between every group of thousands.
|
||
182 |
Output the source of the current program. A quine is a computer program that takes no input and produces a copy of its own source code as its only output.
Reading the source file from disk is cheating. |
||
186 |
Exit a program cleanly indicating no error to OS
|
||
189 |
Produce a new list y containing the result of the function T applied to all elements e of the list x that match the predicate P.
|
||
205 |
Read an environment variable with the name "FOO" and assign it to the string variable foo. If it does not exist or if the system does not support environment variables, assign a value of "none".
|
||
224 |
Insert the element x at the beginning of the list items.
|
||
252 |
Assign to the variable x the string value "a" if calling the function condition returns true, or the value "b" otherwise.
|