Merge pull request #3018 from enkidevs/utilities-ii

Utilities ii

CHANGELOG.md

@@ -62,6 +62,7 @@ Types of change:
 ### Changed
 - [Html - Link Relative Paths - Change part of PQ as it wasn't worder properly](https://github.com/enkidevs/curriculum/pull/2985)
 - [Python - Format Text Paragraphs With Textwrap - Make the fill method more clear](https://github.com/enkidevs/curriculum/pull/2981)
+- [Python - Utilities II - Move single-line commands to a single line, update indentation in codeblocks from 4 to 2 spaces](https://github.com/enkidevs/curriculum/pull/3018)
 - [Python - Working With Strings - Move single-line commands to a single line, update indentation in codeblocks from 4 to 2 spaces](https://github.com/enkidevs/curriculum/pull/3019)
 - [Python - Arrays I - Move single-line commands to a single line, update indentation in codeblocks from 4 to 2 spaces](https://github.com/enkidevs/curriculum/pull/3020)
 - [Python - Arrays II - Move single-line commands to a single line, update indentation in codeblocks from 4 to 2 spaces](https://github.com/enkidevs/curriculum/pull/3021)

python/python-core/utilities-ii/coroutine-utility-function.md

@@ -63,7 +63,7 @@ Convert `my_generator` to a coroutine function:
 import types
 
 def my_generator():
-   yield 1
+  yield 1
 
 my_coroutine = ???.???(my_generator)
 ```

python/python-core/utilities-ii/get-the-similarity-ratio-of-two-sequences.md

@@ -21,7 +21,7 @@ revisionQuestion:
 
 ## Content
 
-`difflib`'s `SequenceMatcher` class and its ratio method makes it easy to compute the "similarity" of two sequences.
+`difflib`'s `SequenceMatcher` class and its ratio method make it easy to compute the "similarity" of two sequences.
 
 ```python
 import difflib
@@ -42,7 +42,7 @@ With the output:
 40.0
 ```
 
-*Junk* sequences (such as whitespace or blank lines) can be passed as the first argument of the function, for them not to be taken into account. The default value is `None`, when nothing is ignored.
+*Junk* sequences (such as whitespace or blank lines) can be passed as the first argument of the function, for them not to be taken into account. The default value is `None` when nothing is ignored.
 
 It can be used to compare sequences of characters as well, i.e. strings.
 

python/python-core/utilities-ii/use-struct-to-work-with-binary-data.md

@@ -29,7 +29,7 @@ revisionQuestion:
 
 ## Content
 
-Python's `struct` module has routines for converting between binary and text data, in both directions.
+Python's `struct` module has routines for converting between binary and text data in both directions.
 
 Import the module:
 

python/python-core/utilities-ii/working-with-junk-data.md

@@ -29,8 +29,7 @@ For the sake of the argument we will work with this class' function called `find
 ```python
 from difflib import SequenceMatcher
 
-s = SequenceMatcher(None, \
-   " abcd", "abcd abcd")
+s = SequenceMatcher(None, " abcd", "abcd abcd")
 print(s.find_longest_match(0, 5, 0, 9))
 
 # prints Match(a=0, b=4, size=5)
@@ -51,8 +50,7 @@ See how in the first scenario we searched for the longest match between the two
 But if we treat white spaces as **Junk** the output will be different:
 
 ```python
-s = SequenceMatcher(lambda x: x == " ",
-                    " abcd", "abcd abcd")
+s = SequenceMatcher(lambda x: x == " ", " abcd", "abcd abcd")
 print(s.find_longest_match(0, 5, 0, 9))
 # prints Match(a=1, b=0, size=4)
 ```
@@ -65,8 +63,7 @@ print(s.find_longest_match(0, 5, 0, 9))
 Complete the `SequenceMatcher`  constructor such that empty spaces are treated as junk:
 
 ```python
-s = SequenceMatcher(??? x: x == ???,
-    “ abcd”, “abcd abcd”)
+s = SequenceMatcher(??? x: x == ???, “ abcd”, “abcd abcd”)
 ```
 
 - `lambda`