- The snippets are under the CC-BY-SA license.
- Consider printing in landscape mode
- or not printing at all, and keeping a bookmark.
Python | Rust | |||
---|---|---|---|---|
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 |
|
|
||
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 |
List x must be non-empty.
|
|||
12 |
Check if list contains a 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.
|
fn pick(a: i32, b: i32) -> i32 { let between = Range::new(a, b); let mut rng = rand::thread_rng(); between.ind_sample(&mut rng) } |
||
16 |
Call a function f on every node of binary tree bt, in depth-first infix order
|
|||
17 |
The structure must be recursive. A node may have zero or more children. A node has access to children nodes, but not to its parent.
|
|
||
18 |
Call a function f on every node of a tree, in depth-first prefix order
|
pub struct Tree<V> { children: Vec<Tree<V>>, value: V } impl<V> Tree<V> { pub fn dfs<F: Fn(&V)>(&self, f: F) { self.dfs_helper(&f); } fn dfs_helper<F: Fn(&V)>(&self, f: &F) { (f)(&self.value); for child in &self.children { child.dfs_helper(f) } } // ... } |
||
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 values of variables a and b
|
|||
22 |
Extract integer value i from its string representation s (in radix 10)
|
|
||
23 |
Given real number x, create its string representation s with 2 decimal digits following the dot.
|
|
||
24 |
Declare a new string s and initialize it with the literal value "ネコ" (which means "cat" in japanese)
|
|||
25 |
Share the string value "Alan" with an existing running process which will then display "Hello, Alan"
|
|
||
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 elements of 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. |
|||
30 |
Launch the concurrent execution of procedure f with parameter i from 1 to 1000.
Tasks are independent and f(i) doesn't return any value. Tasks need not run all at the same time, so you may use a pool. |
let threads: Vec<_> = (0..1000).map(|i| { thread::spawn(move || f(i)) }).collect(); for thread in threads { thread.join(); } |
||
31 |
Create recursive function f which returns the factorial of 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. |
fn exp(x: u64, n: u64) -> u64 { match n { 0 => 1, 1 => x, i if i % 2 == 0 => exp(x * x, n / 2), _ => x * exp(x * x, (n - 1) / 2), } } |
||
33 |
Assign variable x the new value f(x), making sure that no other thread may modify x between the read and the write.
|
|
||
34 |
Declare and initialize a set x containing objects of type T.
|
|||
35 |
Implement a function compose (A -> C) with parameters f (A -> B) and g (B -> C), which returns composition function g ∘ f
|
fn compose<'a, A, B, C, G, F>(f: F, g: G) -> Box<Fn(A) -> C + 'a> where F: 'a + Fn(A) -> B, G: 'a + Fn(B) -> C { Box::new(move |x| g(f(x))) } Alternative implementation:
|
||
36 |
Implement a function compose which returns composition function g ∘ f for any functions f and g having exactly 1 parameter.
|
fn compose<'a, A, B, C, G, F>(f: F, g: G) -> Box<Fn(A) -> C + 'a> where F: 'a + Fn(A) -> B, G: 'a + Fn(B) -> C { Box::new(move |x| g(f(x))) } Alternative implementation:
|
||
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 boolean ok to true if string word is contained in string s as a substring, or to false otherwise.
|
|
||
40 |
Declare a Graph data structure in which each Vertex has a collection of its neighbouring vertices.
|
|||
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. |
|
||
42 |
Print each item v of list a which in not contained in list b.
For this, write an outer loop to iterate on a and an inner loop to iterate on b. |
|||
43 |
Look for a negative value v in 2D integer matrix m. Print it and stop searching.
|
class BreakOuterLoop (Exception): pass try: position = None for row in m: for column in m[row]: if m[row][column] == v: position = (row, column) raise BreakOuterLoop except BreakOuterLoop: pass Alternative implementation:
def loop_breaking(m, v): for i, row in enumerate(m): for j, value in enumerate(row): if value == v: return (i, j) return None print(loop_breaking(([1,2,3],[4,5,6],[7,8,9]), 6)) Alternative implementation:
matrix = [[1,2,3],[4,-5,6],[7,8,9]] try: print(next(i for i in chain.from_iterable(matrix) if i < 0)) except StopIteration: pass |
||
44 |
Insert element x at position i in list s. Further elements must be shifted to the right.
|
|||
45 |
Sleep for 5 seconds in current thread, before proceeding with 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 which has no end clause.
|
|||
51 |
Determine whether map m contains an entry for key k
|
|||
52 |
Determine whether map m contains an entry with 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 integer list x.
|
|
||
55 |
Create the string representation s (in radix 10) of integer value i.
|
|||
56 |
Fork-join : launch the concurrent execution of procedure f with parameter i from 1 to 1000.
Tasks are independent and f(i) doesn't return any value. Tasks need not run all at the same time, so you may use a pool. Wait for the completion of the 1000 tasks and then print "Finished". |
|
let threads: Vec<_> = (0..1000).map(|i| thread::spawn(move || f(i))).collect(); for t in threads { t.join(); } |
|
57 |
Create list y containing items from list x satisfying predicate p. Respect 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").
|
|||
60 |
Assign to x the string value of the first command line parameter, after the program name.
|
|
let first_arg = env::args().skip(1).next(); let fallback = "".to_owned(); let x = first_arg.unwrap_or(fallback); |
|
61 |
Assign to variable d the current date/time value, in the most standard type.
|
|||
62 |
Set i to the position of string y inside string x, if exists.
|
|
||
63 |
Assign to x2 the value of string x with all occurrences of y replaced by z.
Assume occurrences of y are not overlapping. |
|
||
64 |
Assign to x the value 3^247
|
|||
65 |
From real value x in [0,1], create its percentage string representation s with one digit after decimal point. E.g. 0.15625 -> "15.6%"
|
|
||
66 |
Calculate the result z of x power n, where x is a big integer and n is a positive integer.
|
|||
67 |
Calculate binom(n, k) = n! / (k! * (n-k)!). Use an integer type able to handle huge numbers.
|
fn binom(n: u64, k: u64) -> BigInt { let mut res = BigInt::one(); for i in 0..k { res = (res * (n - i).to_bigint().unwrap()) / (i + 1).to_bigint().unwrap(); } res } |
||
68 |
Create an object x to store n bits (n being potentially large).
|
|||
69 |
Use seed s to initialize a random generator.
If s is constant, the generator output will be the same each time the program runs. If s is based on the current value of the system clock, the generator output will be different each time. |
|
||
70 |
Get the current datetime and provide it as a seed to a random generator. The generator sequence will be different at each run.
|
|
||
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. |
|||
73 |
Create a factory named fact for any sub class of Parent and taking exactly one string str as constructor parameter.
|
|||
74 |
Compute the greatest common divisor x of big integers a and b. Use an integer type able to handle huge numbers.
|
|
||
75 |
Compute the least common multiple x of big integers a and b. Use an integer type able to handle huge numbers.
|
|
||
76 |
Create the string s of integer x written in base 2.
E.g. 13 -> "1101" |
|||
77 |
Declare a complex x and initialize it with value (3i - 2). Then multiply it by i.
|
|
||
78 |
Execute a block once, then execute it again as long as boolean condition c is true.
|
|||
79 |
Declare floating point number y and initialize it with the value of integer x .
|
|
||
80 |
Declare integer y and initialize it with the value of floating point number x . Ignore non-integer digits of x .
Make sure to truncate towards zero: a negative x must yield the closest greater integer (not lesser). |
|
||
81 |
Declare integer y and initialize it with the rounded value of floating point number x .
Ties (when the fractional part of x is exactly .5) must be rounded up (to positive infinity). |
|||
82 |
Find how many times string s contains substring t.
Specify if overlapping occurrences are counted. |
|
||
83 |
Declare regular expression r matching strings "http", "htttp", "httttp", etc.
|
|||
84 |
Count number c of 1s in the integer i in base 2.
E.g. i=6 → c=2 |
|
||
85 |
Write boolean function addingWillOverflow which takes two integers x, y and return true if (x+y) overflows.
An overflow may be above the max positive value, or below the min negative value. |
|||
86 |
Write boolean function multiplyWillOverflow which takes two integers x, y and return true if (x*y) overflows.
An overflow may be above the max positive value, or below the min negative value. |
|||
87 |
Exit immediatly.
If some extra cleanup work is executed by the program runtime (not by the OS itself), describe it. |
|
||
88 |
Create a new bytes buffer buf of size 1,000,000.
|
|||
89 |
You've detected that the integer value of argument x passed to the current function is invalid. Write the idiomatic way to abort the function execution and signal the problem.
|
|
||
90 |
Expose a read-only integer x to the outside world while being writable inside a structure or a class Foo.
|
class Foo(object): def __init__(self): self._x = 0 @property def x(self): """ Doc for x """ return self._x |
struct Foo { x: usize } impl Foo { pub fn new(x: usize) -> Self { Foo { x } } pub fn x<'a>(&'a self) -> &'a usize { &self.x } pub fn bar(&mut self) { self.x += 1; } } |
|
91 |
Read from file data.json and write its content into object x.
Assume the JSON data is suitable for the type of x. |
|
|
|
92 |
Write content of object x into file data.json.
|
|
|
|
93 |
Implement procedure control which receives one parameter f, and runs f.
|
|||
94 |
Print the name of the type of x. Explain if it is a static type or dynamic type.
This may not make sense in all languages. |
|||
95 |
Assign to variable x the length (number of bytes) of the local file at path.
|
|||
96 |
Set 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.
|
|
||
98 |
Convert a timestamp ts (number of seconds in epoch-time) to a date with time d. E.g. 0 -> 1970-01-01 00:00:00
|
|||
99 |
Assign to string x the value of fields (year, month, day) of date d, in format YYYY-MM-DD.
|
|
||
100 |
Sort elements of array-like collection items, using a comparator c.
|
|||
101 |
Make an HTTP request with method GET to URL u, then store the body of the response in string s.
|
|
Alternative implementation:
let mut response = reqwest::blocking::get(u)?; let mut s = String::new(); response.read_to_string(&mut s)?; |
|
102 |
Make an HTTP request with method GET to URL u, then store the body of the response in file result.txt. Try to save the data as it arrives if possible, without having all its content in memory at once.
|
|
let client = Client::new(); match client.get(&u).send() { Ok(res) => { let file = File::create("result.txt")?; ::std::io::copy(res, file)?; }, Err(e) => eprintln!("failed to send request: {}", e), }; |
|
103 |
Read from file data.xml and write its content into object x.
Assume the XML data is suitable for the type of x. |
|||
104 |
Write content of object x into file data.xml.
|
# Python 2.5 to 2.7 # Use pickle or marshall module class TestClass(object): a = None b = None c = None def __init__(self, a, b, c): self.a = a self.b = b self.c = c tst = TestClass("var_a", "var_b", "var_c") ser = pyx.serialize(obj=tst, enc="utf-8") print(ser) |
||
105 |
Assign to string s the name of the currently executing program (but not its full path).
|
fn get_exec_name() -> Option<String> { std::env::current_exe() .ok() .and_then(|pb| pb.file_name().map(|s| s.to_os_string())) .and_then(|s| s.into_string().ok()) } fn main() -> () { let s = get_exec_name().unwrap(); println!("{}", s); } |
||
106 |
Assign to string dir the path of the working directory.
(This is not necessarily the folder containing the executable itself) |
|
||
107 |
Assign to string dir the path of the folder containing the currently running executable.
(This is not necessarily the working directory, though.) |
let dir = std::env::current_exe()? .canonicalize() .expect("the current exe should exist") .parent() .expect("the current exe should be a file") .to_string_lossy() .to_owned(); |
||
108 |
Print the value of variable x, but only if x has been declared in this program.
This makes sense in some languages, not all of them. (Null values are not the point, rather the very existence of the variable.) |
|
||
109 |
Set n to the number of bytes of a variable t (of type T).
|
|
||
110 |
Set boolean blank to true if string s is empty, or null, or contains only whitespace ; false otherwise.
|
|
||
111 |
From current process, run program x with command-line parameters "a", "b".
|
|
|
|
112 |
Print each key k with its value x from an associative array mymap, in ascending order of k.
|
|||
113 |
Print each key k with its value x from an associative array mymap, in ascending order of x.
Note that multiple entries may exist for the same value x. |
|||
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. |
|
||
115 |
Set boolean b to true if date d1 is strictly before date d2 ; false otherwise.
|
|
||
116 |
Remove all occurrences of string w from string s1, and store the result in s2.
|
|||
117 |
Set n to the number of elements of list x.
|
|
||
118 |
Create set y from list x.
x may contain duplicates. y is unordered and has no repeated values. |
|||
119 |
Remove duplicates from list x.
Explain if original order is preserved. |
|||
120 |
Read an integer value from the standard input into variable n
|
|
fn get_input() -> String { let mut buffer = String::new(); std::io::stdin().read_line(&mut buffer).expect("Failed"); buffer } let n = get_input().trim().parse::<i64>().unwrap(); Alternative implementation:
let mut input = String::new(); io::stdin().read_line(&mut input).unwrap(); let n: i32 = input.trim().parse().unwrap(); |
|
121 |
Listen UDP traffic on port p and read 1024 bytes into buffer b.
|
let mut b = [0 as u8; 1024]; let sock = UdpSocket::bind(("localhost", p)).unwrap(); sock.recv_from(&mut b).unwrap(); |
||
122 |
Create an enumerated type Suit with 4 possible values SPADES, HEARTS, DIAMONDS, CLUBS.
|
|||
123 |
Verify that predicate isConsistent returns true, otherwise report assertion violation.
Explain if the assertion is executed even in production environment or not. |
|||
124 |
Write function binarySearch which returns the index of an element having value x in sorted array a, or -1 if no such element.
|
|
||
125 |
measure the duration t, in nano seconds, of a call to the function foo. Print this duration.
|
|
|
|
126 |
Write a function foo that returns a string and a boolean value.
|
|
||
127 |
Import the source code for the function foo body from a file "foobody.txt" . The declaration must not reside in the external file.
|
|||
128 |
Call a function f on every node of a tree, in breadth-first prefix order
|
struct Tree<V> { children: Vec<Tree<V>>, value: V } impl<V> Tree<V> { fn bfs(&self, f: impl Fn(&V)) { let mut q = VecDeque::new(); q.push_back(self); while let Some(t) = q.pop_front() { (f)(&t.value); for child in &t.children { q.push_back(child); } } } } |
||
129 |
Call a function f on every vertex accessible from vertex start, in breadth-first prefix order
|
struct Vertex<V> { value: V, neighbours: Vec<Weak<RefCell<Vertex<V>>>>, } // ... fn bft(start: Rc<RefCell<Vertex<V>>>, f: impl Fn(&V)) { let mut q = vec![start]; let mut i = 0; while i < q.len() { let v = Rc::clone(&q[i]); i += 1; (f)(&v.borrow().value); for n in &v.borrow().neighbours { let n = n.upgrade().expect("Invalid neighbour"); if q.iter().all(|v| v.as_ptr() != n.as_ptr()) { q.push(n); } } } } |
||
130 |
Call a function f on every vertex accessible for vertex v, in depth-first prefix order
|
struct Vertex<V> { value: V, neighbours: Vec<Weak<RefCell<Vertex<V>>>>, } // ... fn dft_helper(start: Rc<RefCell<Vertex<V>>>, f: &impl Fn(&V), s: &mut Vec<*const Vertex<V>>) { s.push(start.as_ptr()); (f)(&start.borrow().value); for n in &start.borrow().neighbours { let n = n.upgrade().expect("Invalid neighbor"); if s.iter().all(|&p| p != n.as_ptr()) { Self::dft_helper(n, f, s); } } } |
||
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. |
|||
132 |
Run procedure f, and return the duration of the execution of f.
|
|
||
133 |
Set boolean ok to true if string word is contained in string s as a substring, even if the case doesn't match, or to false otherwise.
|
Alternative implementation:
let re = RegexBuilder::new(®ex::escape(word)) .case_insensitive(true) .build().unwrap(); let ok = re.is_match(s); |
||
134 |
Declare and initialize a new list items, containing 3 elements a, b, c.
|
|||
135 |
Remove at most 1 item from list items, having value x.
This will alter the original list or return a new list, depending on which is more idiomatic. If there are several occurrences of x in items, remove only one of them. If x is absent, keep items unchanged. |
|
|
|
136 |
Remove all occurrences of value x from list items.
This will alter the original list or return a new list, depending on which is more idiomatic. |
|
||
137 |
Set boolean b to true if string s contains only characters in range '0'..'9', false otherwise.
|
let chars_are_numeric: Vec<bool> = s.chars() .map(|c|c.is_numeric()) .collect(); let b = !chars_are_numeric.contains(&false); |
||
138 |
Create a new temporary file on filesystem.
|
|
let temp_dir = TempDir::new("prefix")?; let temp_file = File::open(temp_dir.path().join("file_name"))?; |
|
139 |
Create a new temporary folder on filesystem, for writing.
|
|
|
|
140 |
Delete from map m the entry having key k.
Explain what happens if k is not an existing key in m. |
|||
141 |
Iterate in sequence over the elements of the list items1 then items2. For each iteration print the element.
|
|||
142 |
Assign to string s the hexadecimal representation (base 16) of integer x.
E.g. 999 -> "3e7" |
|||
143 |
Iterate alternatively over the elements of the list items1 and items2. For each iteration, print the element.
Explain what happens if items1 and items2 have different size. |
|||
144 |
Set boolean b to true if file at path fp exists on filesystem; false otherwise.
Beware that you should never do this and then in the next instruction assume the result is still valid, this is a race condition on any multitasking OS. |
|||
145 |
Print message msg, prepended by current date and time.
Explain what behavior is idiomatic: to stdout or stderr, and what the date format is. |
logging.basicConfig(stream=sys.stdout, level=logging.DEBUG, format="%(asctime)-15s %(message)s") logger = logging.getLogger('NAME OF LOGGER') logger.info(msg) |
||
146 |
Extract floating point value f from its string representation s
|
|
||
147 |
Create string t from string s, keeping only ASCII characters
|
|||
148 |
Read a list of integer numbers from the standard input, until EOF.
|
|||
150 |
Remove last character from string p, if this character is a slash /.
|
|||
151 |
Remove last character from string p, if this character is the file path separator of current platform.
Note that this also transforms unix root path "/" into the empty string! |
|
||
152 |
Create string s containing only the character c.
|
|||
153 |
Create string t as the concatenation of string s and integer i.
|
|
||
154 |
Find color c, the average between colors c1, c2.
c, c1, c2 are strings of hex color codes: 7 chars, beginning with a number sign # . Assume linear computations, ignore gamma corrections. |
r1, g1, b1 = [int(c1[p:p+2], 16) for p in range(1,6,2)] r2, g2, b2 = [int(c2[p:p+2], 16) for p in range(1,6,2)] c = '#{:02x}{:02x}{:02x}'.format((r1+r2) // 2, (g1+g2) //2, (b1+b2)// 2) Alternative implementation:
class RGB(numpy.ndarray): @classmethod def from_str(cls, rgbstr): return numpy.array([ int(rgbstr[i:i+2], 16) for i in range(1, len(rgbstr), 2) ]).view(cls) def __str__(self): self = self.astype(numpy.uint8) return '#' + ''.join(format(n, 'x') for n in self) c1 = RGB.from_str('#a1b1c1') print(c1) c2 = RGB.from_str('#1A1B1C') print(c2) print((c1 + c2) / 2) |
|
|
155 |
Delete from filesystem the file having path filepath.
|
|||
156 |
Assign to string s the value of integer i in 3 decimal digits. Pad with zeros if i < 100. Keep all digits if i ≥ 1000.
|
|||
157 |
Initialize a constant planet with string value "Earth".
|
|||
158 |
Create a new list y from randomly picking exactly k elements from list x.
It is assumed that x has at least k elements. Each element must have same probability to be picked. Each element from x must be picked at most once. Explain if the original ordering is preserved or not. |
let mut rng = &mut rand::thread_rng(); let y = x.choose_multiple(&mut rng, k).cloned().collect::<Vec<_>>(); |
||
159 |
Define a Trie data structure, where entries have an associated value.
(Not all nodes are entries) |
|||
160 |
Execute f32() if platform is 32-bit, or f64() if platform is 64-bit.
This can be either a compile-time condition (depending on target) or a runtime detection. |
|
||
161 |
Multiply all the elements of the list elements by a constant c
|
|
||
162 |
execute bat if b is a program option and fox if f is a program option.
|
if let Some(arg) = ::std::env::args().nth(1) { if &arg == "f" { fox(); } else if &arg = "b" { bat(); } else { eprintln!("invalid argument: {}", arg), } } else { eprintln!("missing argument"); } |
||
163 |
Print all the list elements, two by two, assuming list length is even.
|
Alternative implementation:
def pairwise(iterable): "s -> (s0,s1), (s1,s2), (s2, s3), ..." a, b = tee(iterable) next(b, None) return zip(a, b) for a, b in pairwise(list): print(a, b) |
||
164 |
Open the URL s in the default browser.
Set boolean b to indicate whether the operation was successful. |
|
|
|
165 |
Assign to variable x the last element of list items.
|
|||
166 |
Create list ab containing all the elements of list a, followed by all elements of list b.
|
|||
167 |
Create string t consisting of string s with its prefix p removed (if s starts with p).
|
|||
168 |
Create string t consisting of string s with its suffix w removed (if s ends with w).
|
|||
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. |
|||
170 |
Set n to the number of elements stored in mymap.
This is not always equal to the map capacity. |
|||
171 |
Append element x to the list s.
|
|||
172 |
Insert value v for key k in map m.
|
|
||
173 |
Number will be formatted with a comma separator between every group of thousands.
|
|
|
|
174 |
Make a HTTP request with method POST to URL u
|
data = parse.urlencode(<your data dict>).encode() req = request.Request(u, data=data, method="POST") resp = request.urlopen(req) |
let client = reqwest::blocking::Client::new(); let mut response = client.post(u).body("abc").send()?; |
|
175 |
From array a of n bytes, build the equivalent hex string s of 2n digits.
Each byte (256 possible values) is encoded as two hexadecimal characters (16 possible values per digit). |
|
|
|
176 |
From hex string s of 2n digits, build the equivalent array a of n bytes.
Each pair of hexadecimal characters (16 possible values per digit) is decoded into one byte (256 possible values). |
|
|
|
177 |
Construct a list L that contains all filenames that have the extension ".jpg" , ".jpeg" or ".png" in directory D and all it's subdirectories.
|
extensions = [".jpg", ".jpeg", ".png"] L = [f for f in os.listdir(D) if os.path.splitext(f)[1] in extensions] Alternative implementation:
filtered_files = ["{}/{}".format(dirpath, filename) for dirpath, _, filenames in os.walk(D) for filename in filenames if re.match(r'^.*\.(?:jpg|jpeg|png)$', filename)] |
||
178 |
Set boolean b to true if if the point with coordinates (x,y) is inside the rectangle with coordinates (x1,y1,x2,y2) , or to false otherwise.
Describe if the edges are considered to be inside the rectangle. |
|
||
179 |
Return the center c of the rectangle with coördinates(x1,y1,x2,y2)
|
Alternative implementation:
|
struct Rectangle { x1: f64, y1: f64, x2: f64, y2: f64, } impl Rectangle { pub fn center(&self) -> (f64, f64) { ((self.x1 + self.x2) / 2.0, (self.y1 + self.y2) / 2.0) } } |
|
180 |
Create list x containing the contents of directory d.
x may contain files and subfolders. No recursive subfolder listing. |
|