- The snippets are under the CC-BY-SA license.
- Please consider keeping a bookmark
- (instead of printing)
Obj-C | |||
---|---|---|---|
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 an array-like collection 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.
|
||
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.
|
float pick(float a,float b) { id<GKRandom> rnd=GKMersenneTwisterRandomSource.sharedRandom; float ru; while ((ru=rnd.nextUniform)==1); return a+ru*(b-a); } |
|
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.
|
@interface Node:NSObject @property id value; // id means any object value @property NSMutableArray *children; @end // usage like Node *n=[Node new]; n.value=@1; [n.children addObject:otherNode]; [n.children removeLastObject]; // somewhere needed also @implementation Node -(instancetype)init { if (!(self=[super init])) return nil; _children=[NSMutableArray array]; return self; } @end |
|
19 |
Reverse the order of the elements of 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.
|
||
27 |
Declare and initialize a 3D array x, having dimensions boundaries m, n, p, and 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. |
||
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 boolean ok to true if string word is contained in string s as a substring, or to false otherwise.
|
||
41 |
Create string t containing the same characters as string s, in reverse order.
Original string s must remain unaltered. Each character must be handled correctly regardless its number of bytes in memory. |
||
43 |
Look for a negative value v in 2D integer matrix m. Print it and stop searching.
|
||
45 |
Sleep for 5 seconds in current thread, before proceeding with the next instructions.
|
||
46 |
Create string t consisting of the 5 first characters of string s.
Make sure that multibyte characters are properly handled. |
||
47 |
Create string t consisting in the 5 last characters of 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 input 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
|
||
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 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").
|
||
61 |
Assign to variable d the current date/time value, in the most standard type.
|
||
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. |
int main(int argc, char *argv[]) { while (*++argv) { printf("%s", *argv); if (argv[1]) printf(" "); } printf("\n"); return EXIT_SUCCESS; } |
|
78 |
Execute a block once, then execute it again as long as boolean condition c is true.
|
||
96 |
Set boolean b to true if string s starts with prefix prefix, false otherwise.
|
|
|
99 |
Assign to the string x the value of the fields (year, month, day) of the date d, in format YYYY-MM-DD.
|
// once static NSDateFormatter *df; static dispatch_once_t onceToken; dispatch_once(&onceToken, ^{ df=[[NSDateFormatter alloc] init]; df.locale=[[NSLocale alloc] initWithLocaleIdentifier:@"en_US_POSIX"]; df.timeZone=[NSTimeZone timeZoneForSecondsFromGMT:0]; df.dateFormat=@"yyyy-MM-dd"; }); // then, wherever needed NSString *x=[df stringFromDate:d]; |
|
100 |
Sort elements of array-like collection items, using a comparator c.
|
|
|
110 |
Set the boolean blank to true if the string s is empty, or null, or contains only whitespace ; false otherwise.
|
||
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.
|
||
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.
|
||
137 |
Set the boolean b to true if the string s contains only characters in the range '0'..'9', false otherwise.
|
||
157 |
Initialize a constant planet with string value "Earth".
|
||
165 |
Assign to variable x the last element of 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 integer n the number of characters of string s.
Make sure that multibyte characters are properly handled. n can be different from the number of bytes of s. |