Skip to content

Travis CI: Start testing on Python 3.9 beta 5#2279

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Closed
cclauss wants to merge 11 commits into from
Closed

Travis CI: Start testing on Python 3.9 beta 5 #2279

Show file tree
Hide file tree
Changes from all commits
Commits
Show all changes
11 commits
Select commit Hold shift + click to select a range
35ced67
Travis CI: Start testing on Python 3.9 beta 5
cclauss Aug 4, 2020
fe5ed92
opencv and tensorflow are not Python 3.9 compatible
cclauss Aug 4, 2020
66372e5
fixup! Format Python code with psf/black push
Aug 4, 2020
7270b6d
less clutter
cclauss Aug 6, 2020
3cdaec0
updating DIRECTORY.md
Aug 6, 2020
4a8ecd3
Merge branch 'master' into Python3.9
cclauss Aug 6, 2020
d761fb7
updating DIRECTORY.md
Aug 6, 2020
d0802e5
Force a retest
cclauss Aug 12, 2020
bbdc859
Update requirements.txt
cclauss Aug 16, 2020
016bf32
Update requirements.txt
cclauss Sep 15, 2020
56f21fe
fixup! Format Python code with psf/black push
Sep 15, 2020
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
2 changes: 1 addition & 1 deletion .travis.yml
View file
Open in desktop
Original file line numberDiff line numberDiff line change
@@ -1,7 +1,7 @@
os: linux
dist: focal
language: python
python: 3.8
python: "3.9-dev"
cache: pip
before_install: pip install --upgrade pip setuptools six
install: pip install black flake8
Expand Down
16 changes: 13 additions & 3 deletions DIRECTORY.md
View file
Open in desktop
Original file line numberDiff line numberDiff line change
Expand Up@@ -85,7 +85,9 @@
* [Decimal To Binary](https://github.com/TheAlgorithms/Python/blob/master/conversions/decimal_to_binary.py)
* [Decimal To Hexadecimal](https://github.com/TheAlgorithms/Python/blob/master/conversions/decimal_to_hexadecimal.py)
* [Decimal To Octal](https://github.com/TheAlgorithms/Python/blob/master/conversions/decimal_to_octal.py)
* [Prefix Conversions](https://github.com/TheAlgorithms/Python/blob/master/conversions/prefix_conversions.py)
* [Roman To Integer](https://github.com/TheAlgorithms/Python/blob/master/conversions/roman_to_integer.py)
* [Temperature Conversions](https://github.com/TheAlgorithms/Python/blob/master/conversions/temperature_conversions.py)

## Data Structures
* Binary Tree
Expand All@@ -102,9 +104,6 @@
* [Segment Tree](https://github.com/TheAlgorithms/Python/blob/master/data_structures/binary_tree/segment_tree.py)
* [Segment Tree Other](https://github.com/TheAlgorithms/Python/blob/master/data_structures/binary_tree/segment_tree_other.py)
* [Treap](https://github.com/TheAlgorithms/Python/blob/master/data_structures/binary_tree/treap.py)
* Data Structures
* Heap
* [Heap Generic](https://github.com/TheAlgorithms/Python/blob/master/data_structures/data_structures/heap/heap_generic.py)
* Disjoint Set
* [Disjoint Set](https://github.com/TheAlgorithms/Python/blob/master/data_structures/disjoint_set/disjoint_set.py)
* Hashing
Expand All@@ -117,6 +116,7 @@
* Heap
* [Binomial Heap](https://github.com/TheAlgorithms/Python/blob/master/data_structures/heap/binomial_heap.py)
* [Heap](https://github.com/TheAlgorithms/Python/blob/master/data_structures/heap/heap.py)
* [Heap Generic](https://github.com/TheAlgorithms/Python/blob/master/data_structures/heap/heap_generic.py)
* [Max Heap](https://github.com/TheAlgorithms/Python/blob/master/data_structures/heap/max_heap.py)
* [Min Heap](https://github.com/TheAlgorithms/Python/blob/master/data_structures/heap/min_heap.py)
* Linked List
Expand DownExpand Up@@ -264,6 +264,7 @@
* [Greedy Best First](https://github.com/TheAlgorithms/Python/blob/master/graphs/greedy_best_first.py)
* [Kahns Algorithm Long](https://github.com/TheAlgorithms/Python/blob/master/graphs/kahns_algorithm_long.py)
* [Kahns Algorithm Topo](https://github.com/TheAlgorithms/Python/blob/master/graphs/kahns_algorithm_topo.py)
* [Karger](https://github.com/TheAlgorithms/Python/blob/master/graphs/karger.py)
* [Minimum Spanning Tree Boruvka](https://github.com/TheAlgorithms/Python/blob/master/graphs/minimum_spanning_tree_boruvka.py)
* [Minimum Spanning Tree Kruskal](https://github.com/TheAlgorithms/Python/blob/master/graphs/minimum_spanning_tree_kruskal.py)
* [Minimum Spanning Tree Prims](https://github.com/TheAlgorithms/Python/blob/master/graphs/minimum_spanning_tree_prims.py)
Expand DownExpand Up@@ -292,6 +293,7 @@
* Src
* [Lib](https://github.com/TheAlgorithms/Python/blob/master/linear_algebra/src/lib.py)
* [Polynom-For-Points](https://github.com/TheAlgorithms/Python/blob/master/linear_algebra/src/polynom-for-points.py)
* [Power Iteration](https://github.com/TheAlgorithms/Python/blob/master/linear_algebra/src/power_iteration.py)
* [Rayleigh Quotient](https://github.com/TheAlgorithms/Python/blob/master/linear_algebra/src/rayleigh_quotient.py)
* [Test Linear Algebra](https://github.com/TheAlgorithms/Python/blob/master/linear_algebra/src/test_linear_algebra.py)

Expand DownExpand Up@@ -337,6 +339,7 @@
* [Binary Exp Mod](https://github.com/TheAlgorithms/Python/blob/master/maths/binary_exp_mod.py)
* [Binary Exponentiation](https://github.com/TheAlgorithms/Python/blob/master/maths/binary_exponentiation.py)
* [Binomial Coefficient](https://github.com/TheAlgorithms/Python/blob/master/maths/binomial_coefficient.py)
* [Binomial Distribution](https://github.com/TheAlgorithms/Python/blob/master/maths/binomial_distribution.py)
* [Bisection](https://github.com/TheAlgorithms/Python/blob/master/maths/bisection.py)
* [Ceil](https://github.com/TheAlgorithms/Python/blob/master/maths/ceil.py)
* [Chudnovsky Algorithm](https://github.com/TheAlgorithms/Python/blob/master/maths/chudnovsky_algorithm.py)
Expand DownExpand Up@@ -366,6 +369,7 @@
* [Jaccard Similarity](https://github.com/TheAlgorithms/Python/blob/master/maths/jaccard_similarity.py)
* [Kadanes](https://github.com/TheAlgorithms/Python/blob/master/maths/kadanes.py)
* [Karatsuba](https://github.com/TheAlgorithms/Python/blob/master/maths/karatsuba.py)
* [Krishnamurthy Number](https://github.com/TheAlgorithms/Python/blob/master/maths/krishnamurthy_number.py)
* [Kth Lexicographic Permutation](https://github.com/TheAlgorithms/Python/blob/master/maths/kth_lexicographic_permutation.py)
* [Largest Of Very Large Numbers](https://github.com/TheAlgorithms/Python/blob/master/maths/largest_of_very_large_numbers.py)
* [Least Common Multiple](https://github.com/TheAlgorithms/Python/blob/master/maths/least_common_multiple.py)
Expand All@@ -382,9 +386,11 @@
* [Number Of Digits](https://github.com/TheAlgorithms/Python/blob/master/maths/number_of_digits.py)
* [Numerical Integration](https://github.com/TheAlgorithms/Python/blob/master/maths/numerical_integration.py)
* [Perfect Cube](https://github.com/TheAlgorithms/Python/blob/master/maths/perfect_cube.py)
* [Perfect Number](https://github.com/TheAlgorithms/Python/blob/master/maths/perfect_number.py)
* [Perfect Square](https://github.com/TheAlgorithms/Python/blob/master/maths/perfect_square.py)
* [Pi Monte Carlo Estimation](https://github.com/TheAlgorithms/Python/blob/master/maths/pi_monte_carlo_estimation.py)
* [Polynomial Evaluation](https://github.com/TheAlgorithms/Python/blob/master/maths/polynomial_evaluation.py)
* [Power Using Recursion](https://github.com/TheAlgorithms/Python/blob/master/maths/power_using_recursion.py)
* [Prime Check](https://github.com/TheAlgorithms/Python/blob/master/maths/prime_check.py)
* [Prime Factors](https://github.com/TheAlgorithms/Python/blob/master/maths/prime_factors.py)
* [Prime Numbers](https://github.com/TheAlgorithms/Python/blob/master/maths/prime_numbers.py)
Expand DownExpand Up@@ -415,6 +421,7 @@

## Matrix
* [Count Islands In Matrix](https://github.com/TheAlgorithms/Python/blob/master/matrix/count_islands_in_matrix.py)
* [Inverse Of Matrix](https://github.com/TheAlgorithms/Python/blob/master/matrix/inverse_of_matrix.py)
* [Matrix Class](https://github.com/TheAlgorithms/Python/blob/master/matrix/matrix_class.py)
* [Matrix Operation](https://github.com/TheAlgorithms/Python/blob/master/matrix/matrix_operation.py)
* [Nth Fibonacci Using Matrix Exponentiation](https://github.com/TheAlgorithms/Python/blob/master/matrix/nth_fibonacci_using_matrix_exponentiation.py)
Expand DownExpand Up@@ -460,6 +467,7 @@
* [Palindrome](https://github.com/TheAlgorithms/Python/blob/master/other/palindrome.py)
* [Password Generator](https://github.com/TheAlgorithms/Python/blob/master/other/password_generator.py)
* [Primelib](https://github.com/TheAlgorithms/Python/blob/master/other/primelib.py)
* [Scoring Algorithm](https://github.com/TheAlgorithms/Python/blob/master/other/scoring_algorithm.py)
* [Sdes](https://github.com/TheAlgorithms/Python/blob/master/other/sdes.py)
* [Sierpinski Triangle](https://github.com/TheAlgorithms/Python/blob/master/other/sierpinski_triangle.py)
* [Tower Of Hanoi](https://github.com/TheAlgorithms/Python/blob/master/other/tower_of_hanoi.py)
Expand DownExpand Up@@ -633,6 +641,7 @@
* [I Sort](https://github.com/TheAlgorithms/Python/blob/master/sorts/i_sort.py)
* [Insertion Sort](https://github.com/TheAlgorithms/Python/blob/master/sorts/insertion_sort.py)
* [Iterative Merge Sort](https://github.com/TheAlgorithms/Python/blob/master/sorts/iterative_merge_sort.py)
* [Merge Insertion Sort](https://github.com/TheAlgorithms/Python/blob/master/sorts/merge_insertion_sort.py)
* [Merge Sort](https://github.com/TheAlgorithms/Python/blob/master/sorts/merge_sort.py)
* [Odd Even Transposition Parallel](https://github.com/TheAlgorithms/Python/blob/master/sorts/odd_even_transposition_parallel.py)
* [Odd Even Transposition Single Threaded](https://github.com/TheAlgorithms/Python/blob/master/sorts/odd_even_transposition_single_threaded.py)
Expand DownExpand Up@@ -693,3 +702,4 @@
* [Get Imdb Top 250 Movies Csv](https://github.com/TheAlgorithms/Python/blob/master/web_programming/get_imdb_top_250_movies_csv.py)
* [Get Imdbtop](https://github.com/TheAlgorithms/Python/blob/master/web_programming/get_imdbtop.py)
* [Slack Message](https://github.com/TheAlgorithms/Python/blob/master/web_programming/slack_message.py)
* [World Covid19 Stats](https://github.com/TheAlgorithms/Python/blob/master/web_programming/world_covid19_stats.py)
6 changes: 5 additions & 1 deletion arithmetic_analysis/newton_method.py
View file
Open in desktop
Original file line numberDiff line numberDiff line change
Expand Up@@ -7,7 +7,11 @@


# function is the f(x) and derivative is the f'(x)
def newton(function: RealFunc, derivative: RealFunc, starting_int: int,) -> float:
def newton(
function: RealFunc,
derivative: RealFunc,
starting_int: int,
) -> float:
"""
>>> newton(lambda x: x ** 3 - 2 * x - 5, lambda x: 3 * x ** 2 - 2, 3)
2.0945514815423474
Expand Down
2 changes: 1 addition & 1 deletion arithmetic_analysis/newton_raphson.py
View file
Open in desktop
Original file line numberDiff line numberDiff line change
Expand Up@@ -9,7 +9,7 @@


def newton_raphson(func: str, a: int, precision: int = 10 ** -10) -> float:
"""Finds root from the point 'a' onwards by Newton-Raphson method
"""Finds root from the point 'a' onwards by Newton-Raphson method
>>> newton_raphson("sin(x)", 2)
3.1415926536808043
>>> newton_raphson("x**2 - 5*x +2", 0.4)
Expand Down
8 changes: 4 additions & 4 deletions backtracking/all_permutations.py
View file
Open in desktop
Original file line numberDiff line numberDiff line change
Expand Up@@ -13,10 +13,10 @@ def generate_all_permutations(sequence):

def create_state_space_tree(sequence, current_sequence, index, index_used):
"""
Creates a state space tree to iterate through each branch using DFS.
We know that each state has exactly len(sequence) - index children.
It terminates when it reaches the end of the given sequence.
"""
Creates a state space tree to iterate through each branch using DFS.
We know that each state has exactly len(sequence) - index children.
It terminates when it reaches the end of the given sequence.
"""

if index == len(sequence):
print(current_sequence)
Expand Down
8 changes: 4 additions & 4 deletions backtracking/all_subsequences.py
View file
Open in desktop
Original file line numberDiff line numberDiff line change
Expand Up@@ -13,10 +13,10 @@ def generate_all_subsequences(sequence):

def create_state_space_tree(sequence, current_subsequence, index):
"""
Creates a state space tree to iterate through each branch using DFS.
We know that each state has exactly two children.
It terminates when it reaches the end of the given sequence.
"""
Creates a state space tree to iterate through each branch using DFS.
We know that each state has exactly two children.
It terminates when it reaches the end of the given sequence.
"""

if index == len(sequence):
print(current_subsequence)
Expand Down
2 changes: 1 addition & 1 deletion backtracking/sudoku.py
View file
Open in desktop
Original file line numberDiff line numberDiff line change
Expand Up@@ -105,7 +105,7 @@ def sudoku(grid):
[7, 4, 5, 2, 8, 6, 3, 1, 9]]
>>> sudoku(no_solution)
False
"""
"""

if is_completed(grid):
return grid
Expand Down
12 changes: 6 additions & 6 deletions backtracking/sum_of_subsets.py
View file
Open in desktop
Original file line numberDiff line numberDiff line change
Expand Up@@ -19,13 +19,13 @@ def generate_sum_of_subsets_soln(nums, max_sum):

def create_state_space_tree(nums, max_sum, num_index, path, result, remaining_nums_sum):
"""
Creates a state space tree to iterate through each branch using DFS.
It terminates the branching of a node when any of the two conditions
given below satisfy.
This algorithm follows depth-fist-search and backtracks when the node is not
branchable.
Creates a state space tree to iterate through each branch using DFS.
It terminates the branching of a node when any of the two conditions
given below satisfy.
This algorithm follows depth-fist-search and backtracks when the node is not
branchable.

"""
"""
if sum(path) > max_sum or (remaining_nums_sum + sum(path)) < max_sum:
return
if sum(path) == max_sum:
Expand Down
10 changes: 5 additions & 5 deletions blockchain/modular_division.py
View file
Open in desktop
Original file line numberDiff line numberDiff line change
Expand Up@@ -74,13 +74,13 @@ def modular_division2(a, b, n):

def extended_gcd(a, b):
"""
>>> extended_gcd(10, 6)
(2, -1, 2)
>>> extended_gcd(10, 6)
(2, -1, 2)

>>> extended_gcd(7, 5)
(1, -2, 3)
>>> extended_gcd(7, 5)
(1, -2, 3)

** extended_gcd function is used when d = gcd(a,b) is required in output
** extended_gcd function is used when d = gcd(a,b) is required in output

"""
assert a >= 0 and b >= 0
Expand Down
70 changes: 35 additions & 35 deletions ciphers/xor_cipher.py
View file
Open in desktop
Original file line numberDiff line numberDiff line change
Expand Up@@ -21,20 +21,20 @@
class XORCipher:
def __init__(self, key=0):
"""
simple constructor that receives a key or uses
default key = 0
"""
simple constructor that receives a key or uses
default key = 0
"""

# private field
self.__key = key

def encrypt(self, content, key):
"""
input: 'content' of type string and 'key' of type int
output: encrypted string 'content' as a list of chars
if key not passed the method uses the key by the constructor.
otherwise key = 1
"""
input: 'content' of type string and 'key' of type int
output: encrypted string 'content' as a list of chars
if key not passed the method uses the key by the constructor.
otherwise key = 1
"""

# precondition
assert isinstance(key, int) and isinstance(content, str)
Expand All@@ -55,11 +55,11 @@ def encrypt(self, content, key):

def decrypt(self, content, key):
"""
input: 'content' of type list and 'key' of type int
output: decrypted string 'content' as a list of chars
if key not passed the method uses the key by the constructor.
otherwise key = 1
"""
input: 'content' of type list and 'key' of type int
output: decrypted string 'content' as a list of chars
if key not passed the method uses the key by the constructor.
otherwise key = 1
"""

# precondition
assert isinstance(key, int) and isinstance(content, list)
Expand All@@ -80,11 +80,11 @@ def decrypt(self, content, key):

def encrypt_string(self, content, key=0):
"""
input: 'content' of type string and 'key' of type int
output: encrypted string 'content'
if key not passed the method uses the key by the constructor.
otherwise key = 1
"""
input: 'content' of type string and 'key' of type int
output: encrypted string 'content'
if key not passed the method uses the key by the constructor.
otherwise key = 1
"""

# precondition
assert isinstance(key, int) and isinstance(content, str)
Expand All@@ -105,11 +105,11 @@ def encrypt_string(self, content, key=0):

def decrypt_string(self, content, key=0):
"""
input: 'content' of type string and 'key' of type int
output: decrypted string 'content'
if key not passed the method uses the key by the constructor.
otherwise key = 1
"""
input: 'content' of type string and 'key' of type int
output: decrypted string 'content'
if key not passed the method uses the key by the constructor.
otherwise key = 1
"""

# precondition
assert isinstance(key, int) and isinstance(content, str)
Expand All@@ -130,12 +130,12 @@ def decrypt_string(self, content, key=0):

def encrypt_file(self, file, key=0):
"""
input: filename (str) and a key (int)
output: returns true if encrypt process was
successful otherwise false
if key not passed the method uses the key by the constructor.
otherwise key = 1
"""
input: filename (str) and a key (int)
output: returns true if encrypt process was
successful otherwise false
if key not passed the method uses the key by the constructor.
otherwise key = 1
"""

# precondition
assert isinstance(file, str) and isinstance(key, int)
Expand All@@ -155,12 +155,12 @@ def encrypt_file(self, file, key=0):

def decrypt_file(self, file, key):
"""
input: filename (str) and a key (int)
output: returns true if decrypt process was
successful otherwise false
if key not passed the method uses the key by the constructor.
otherwise key = 1
"""
input: filename (str) and a key (int)
output: returns true if decrypt process was
successful otherwise false
if key not passed the method uses the key by the constructor.
otherwise key = 1
"""

# precondition
assert isinstance(file, str) and isinstance(key, int)
Expand Down
Loading
, 'i'); if (__m === '*' || __re.test(location.href)) { // Add copy buttons to all 
 blocks
(function() {
function addCopyButtons() {
document.querySelectorAll('pre code').forEach(function(codeBlock) {
if (codeBlock.parentElement.hasAttribute('data-copy-added')) return;
codeBlock.parentElement.setAttribute('data-copy-added', 'true');
var btn = document.createElement('button');
btn.textContent = 'Copy';
btn.style.cssText = 'position:absolute;top:4px;right:4px;padding:2px 8px;font-size:11px;background:#4ecdc4;border:none;border-radius:4px;color:#1a1a2e;cursor:pointer;opacity:0.7;transition:opacity 0.2s;';
btn.onmouseover = function() { this.style.opacity = '1'; };
btn.onmouseout = function() { this.style.opacity = '0.7'; };
btn.onclick = function() {
navigator.clipboard.writeText(codeBlock.textContent).then(function() {
btn.textContent = 'Copied!';
setTimeout(function() { btn.textContent = 'Copy'; }, 1500);
});
};
codeBlock.parentElement.style.position = 'relative';
codeBlock.parentElement.appendChild(btn);
});
}
addCopyButtons();
// Re-run on dynamic content
var observer = new MutationObserver(addCopyButtons);
observer.observe(document.body, { childList: true, subtree: true });
})();
}
} catch(__e) { console.warn('[Userscript:Add Copy Buttons to Code Blocks]', __e); }
})();
(function(){
try {
var __m = "github.com";
var __re = new RegExp('^' + "github\\.com" + '
Travis CI: Start testing on Python 3.9 beta 5 by cclauss · Pull Request #2279 · TheAlgorithms/Python · GitHub
Skip to content
Travis CI: Start testing on Python 3.9 beta 5#2279

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

 Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and
privacy statement. We’ll occasionally send you account related emails.

Already on GitHub?
Sign in
to your account

 Closed

cclauss
wants to merge
11
commits into

from

 Closed


Travis CI: Start testing on Python 3.9 beta 5
#2279
Show file tree
Hide file tree
 Changes from all commits
Commits

Show all changes


11 commits


Select commit
Hold shift + click to select a range
35ced67

Travis CI: Start testing on Python 3.9 beta 5


cclauss Aug 4, 2020
fe5ed92

opencv and tensorflow are not Python 3.9 compatible


cclauss Aug 4, 2020
66372e5

fixup! Format Python code with psf/black push

Aug 4, 2020
7270b6d

less clutter


cclauss Aug 6, 2020
3cdaec0

updating DIRECTORY.md

Aug 6, 2020
4a8ecd3

Merge branch 'master' into Python3.9


cclauss Aug 6, 2020
d761fb7

updating DIRECTORY.md

Aug 6, 2020
d0802e5

Force a retest


cclauss Aug 12, 2020
bbdc859

Update requirements.txt


cclauss Aug 16, 2020
016bf32

Update requirements.txt


cclauss Sep 15, 2020
56f21fe

fixup! Format Python code with psf/black push

Sep 15, 2020

File filter

Filter by extension
Filter by extension
Conversations

Failed to load comments. 
Loading
Jump to

Jump to file


Failed to load files. 
Loading
 Diff view

 Diff view


2 changes: 1 addition & 1 deletion
.travis.yml

View file


Open in desktop

Original file line numberDiff line numberDiff line change
@@ -1,7 +1,7 @@
os: linux
dist: focal
language: python
python: 3.8
python: "3.9-dev"
cache: pip
before_install: pip install --upgrade pip setuptools six
install: pip install black flake8
Expand Down

16 changes: 13 additions & 3 deletions
DIRECTORY.md

View file


Open in desktop

Original file line numberDiff line numberDiff line change
Expand Up@@ -85,7 +85,9 @@
 * [Decimal To Binary](https://github.com/TheAlgorithms/Python/blob/master/conversions/decimal_to_binary.py)
 * [Decimal To Hexadecimal](https://github.com/TheAlgorithms/Python/blob/master/conversions/decimal_to_hexadecimal.py)
 * [Decimal To Octal](https://github.com/TheAlgorithms/Python/blob/master/conversions/decimal_to_octal.py)
 * [Prefix Conversions](https://github.com/TheAlgorithms/Python/blob/master/conversions/prefix_conversions.py)
 * [Roman To Integer](https://github.com/TheAlgorithms/Python/blob/master/conversions/roman_to_integer.py)
 * [Temperature Conversions](https://github.com/TheAlgorithms/Python/blob/master/conversions/temperature_conversions.py)

## Data Structures
 * Binary Tree
Expand All@@ -102,9 +104,6 @@
 * [Segment Tree](https://github.com/TheAlgorithms/Python/blob/master/data_structures/binary_tree/segment_tree.py)
 * [Segment Tree Other](https://github.com/TheAlgorithms/Python/blob/master/data_structures/binary_tree/segment_tree_other.py)
 * [Treap](https://github.com/TheAlgorithms/Python/blob/master/data_structures/binary_tree/treap.py)
 * Data Structures
 * Heap
 * [Heap Generic](https://github.com/TheAlgorithms/Python/blob/master/data_structures/data_structures/heap/heap_generic.py)
 * Disjoint Set
 * [Disjoint Set](https://github.com/TheAlgorithms/Python/blob/master/data_structures/disjoint_set/disjoint_set.py)
 * Hashing
Expand All@@ -117,6 +116,7 @@
 * Heap
 * [Binomial Heap](https://github.com/TheAlgorithms/Python/blob/master/data_structures/heap/binomial_heap.py)
 * [Heap](https://github.com/TheAlgorithms/Python/blob/master/data_structures/heap/heap.py)
 * [Heap Generic](https://github.com/TheAlgorithms/Python/blob/master/data_structures/heap/heap_generic.py)
 * [Max Heap](https://github.com/TheAlgorithms/Python/blob/master/data_structures/heap/max_heap.py)
 * [Min Heap](https://github.com/TheAlgorithms/Python/blob/master/data_structures/heap/min_heap.py)
 * Linked List
Expand DownExpand Up@@ -264,6 +264,7 @@
 * [Greedy Best First](https://github.com/TheAlgorithms/Python/blob/master/graphs/greedy_best_first.py)
 * [Kahns Algorithm Long](https://github.com/TheAlgorithms/Python/blob/master/graphs/kahns_algorithm_long.py)
 * [Kahns Algorithm Topo](https://github.com/TheAlgorithms/Python/blob/master/graphs/kahns_algorithm_topo.py)
 * [Karger](https://github.com/TheAlgorithms/Python/blob/master/graphs/karger.py)
 * [Minimum Spanning Tree Boruvka](https://github.com/TheAlgorithms/Python/blob/master/graphs/minimum_spanning_tree_boruvka.py)
 * [Minimum Spanning Tree Kruskal](https://github.com/TheAlgorithms/Python/blob/master/graphs/minimum_spanning_tree_kruskal.py)
 * [Minimum Spanning Tree Prims](https://github.com/TheAlgorithms/Python/blob/master/graphs/minimum_spanning_tree_prims.py)
Expand DownExpand Up@@ -292,6 +293,7 @@
 * Src
 * [Lib](https://github.com/TheAlgorithms/Python/blob/master/linear_algebra/src/lib.py)
 * [Polynom-For-Points](https://github.com/TheAlgorithms/Python/blob/master/linear_algebra/src/polynom-for-points.py)
 * [Power Iteration](https://github.com/TheAlgorithms/Python/blob/master/linear_algebra/src/power_iteration.py)
 * [Rayleigh Quotient](https://github.com/TheAlgorithms/Python/blob/master/linear_algebra/src/rayleigh_quotient.py)
 * [Test Linear Algebra](https://github.com/TheAlgorithms/Python/blob/master/linear_algebra/src/test_linear_algebra.py)

Expand DownExpand Up@@ -337,6 +339,7 @@
 * [Binary Exp Mod](https://github.com/TheAlgorithms/Python/blob/master/maths/binary_exp_mod.py)
 * [Binary Exponentiation](https://github.com/TheAlgorithms/Python/blob/master/maths/binary_exponentiation.py)
 * [Binomial Coefficient](https://github.com/TheAlgorithms/Python/blob/master/maths/binomial_coefficient.py)
 * [Binomial Distribution](https://github.com/TheAlgorithms/Python/blob/master/maths/binomial_distribution.py)
 * [Bisection](https://github.com/TheAlgorithms/Python/blob/master/maths/bisection.py)
 * [Ceil](https://github.com/TheAlgorithms/Python/blob/master/maths/ceil.py)
 * [Chudnovsky Algorithm](https://github.com/TheAlgorithms/Python/blob/master/maths/chudnovsky_algorithm.py)
Expand DownExpand Up@@ -366,6 +369,7 @@
 * [Jaccard Similarity](https://github.com/TheAlgorithms/Python/blob/master/maths/jaccard_similarity.py)
 * [Kadanes](https://github.com/TheAlgorithms/Python/blob/master/maths/kadanes.py)
 * [Karatsuba](https://github.com/TheAlgorithms/Python/blob/master/maths/karatsuba.py)
 * [Krishnamurthy Number](https://github.com/TheAlgorithms/Python/blob/master/maths/krishnamurthy_number.py)
 * [Kth Lexicographic Permutation](https://github.com/TheAlgorithms/Python/blob/master/maths/kth_lexicographic_permutation.py)
 * [Largest Of Very Large Numbers](https://github.com/TheAlgorithms/Python/blob/master/maths/largest_of_very_large_numbers.py)
 * [Least Common Multiple](https://github.com/TheAlgorithms/Python/blob/master/maths/least_common_multiple.py)
Expand All@@ -382,9 +386,11 @@
 * [Number Of Digits](https://github.com/TheAlgorithms/Python/blob/master/maths/number_of_digits.py)
 * [Numerical Integration](https://github.com/TheAlgorithms/Python/blob/master/maths/numerical_integration.py)
 * [Perfect Cube](https://github.com/TheAlgorithms/Python/blob/master/maths/perfect_cube.py)
 * [Perfect Number](https://github.com/TheAlgorithms/Python/blob/master/maths/perfect_number.py)
 * [Perfect Square](https://github.com/TheAlgorithms/Python/blob/master/maths/perfect_square.py)
 * [Pi Monte Carlo Estimation](https://github.com/TheAlgorithms/Python/blob/master/maths/pi_monte_carlo_estimation.py)
 * [Polynomial Evaluation](https://github.com/TheAlgorithms/Python/blob/master/maths/polynomial_evaluation.py)
 * [Power Using Recursion](https://github.com/TheAlgorithms/Python/blob/master/maths/power_using_recursion.py)
 * [Prime Check](https://github.com/TheAlgorithms/Python/blob/master/maths/prime_check.py)
 * [Prime Factors](https://github.com/TheAlgorithms/Python/blob/master/maths/prime_factors.py)
 * [Prime Numbers](https://github.com/TheAlgorithms/Python/blob/master/maths/prime_numbers.py)
Expand DownExpand Up@@ -415,6 +421,7 @@

## Matrix
 * [Count Islands In Matrix](https://github.com/TheAlgorithms/Python/blob/master/matrix/count_islands_in_matrix.py)
 * [Inverse Of Matrix](https://github.com/TheAlgorithms/Python/blob/master/matrix/inverse_of_matrix.py)
 * [Matrix Class](https://github.com/TheAlgorithms/Python/blob/master/matrix/matrix_class.py)
 * [Matrix Operation](https://github.com/TheAlgorithms/Python/blob/master/matrix/matrix_operation.py)
 * [Nth Fibonacci Using Matrix Exponentiation](https://github.com/TheAlgorithms/Python/blob/master/matrix/nth_fibonacci_using_matrix_exponentiation.py)
Expand DownExpand Up@@ -460,6 +467,7 @@
 * [Palindrome](https://github.com/TheAlgorithms/Python/blob/master/other/palindrome.py)
 * [Password Generator](https://github.com/TheAlgorithms/Python/blob/master/other/password_generator.py)
 * [Primelib](https://github.com/TheAlgorithms/Python/blob/master/other/primelib.py)
 * [Scoring Algorithm](https://github.com/TheAlgorithms/Python/blob/master/other/scoring_algorithm.py)
 * [Sdes](https://github.com/TheAlgorithms/Python/blob/master/other/sdes.py)
 * [Sierpinski Triangle](https://github.com/TheAlgorithms/Python/blob/master/other/sierpinski_triangle.py)
 * [Tower Of Hanoi](https://github.com/TheAlgorithms/Python/blob/master/other/tower_of_hanoi.py)
Expand DownExpand Up@@ -633,6 +641,7 @@
 * [I Sort](https://github.com/TheAlgorithms/Python/blob/master/sorts/i_sort.py)
 * [Insertion Sort](https://github.com/TheAlgorithms/Python/blob/master/sorts/insertion_sort.py)
 * [Iterative Merge Sort](https://github.com/TheAlgorithms/Python/blob/master/sorts/iterative_merge_sort.py)
 * [Merge Insertion Sort](https://github.com/TheAlgorithms/Python/blob/master/sorts/merge_insertion_sort.py)
 * [Merge Sort](https://github.com/TheAlgorithms/Python/blob/master/sorts/merge_sort.py)
 * [Odd Even Transposition Parallel](https://github.com/TheAlgorithms/Python/blob/master/sorts/odd_even_transposition_parallel.py)
 * [Odd Even Transposition Single Threaded](https://github.com/TheAlgorithms/Python/blob/master/sorts/odd_even_transposition_single_threaded.py)
Expand DownExpand Up@@ -693,3 +702,4 @@
 * [Get Imdb Top 250 Movies Csv](https://github.com/TheAlgorithms/Python/blob/master/web_programming/get_imdb_top_250_movies_csv.py)
 * [Get Imdbtop](https://github.com/TheAlgorithms/Python/blob/master/web_programming/get_imdbtop.py)
 * [Slack Message](https://github.com/TheAlgorithms/Python/blob/master/web_programming/slack_message.py)
 * [World Covid19 Stats](https://github.com/TheAlgorithms/Python/blob/master/web_programming/world_covid19_stats.py)

6 changes: 5 additions & 1 deletion
arithmetic_analysis/newton_method.py

View file


Open in desktop

Original file line numberDiff line numberDiff line change
Expand Up@@ -7,7 +7,11 @@


# function is the f(x) and derivative is the f'(x)
def newton(function: RealFunc, derivative: RealFunc, starting_int: int,) -> float:
def newton(
 function: RealFunc,
 derivative: RealFunc,
 starting_int: int,
) -> float:
 """
 >>> newton(lambda x: x ** 3 - 2 * x - 5, lambda x: 3 * x ** 2 - 2, 3)
 2.0945514815423474
Expand Down

2 changes: 1 addition & 1 deletion
arithmetic_analysis/newton_raphson.py

View file


Open in desktop

Original file line numberDiff line numberDiff line change
Expand Up@@ -9,7 +9,7 @@


def newton_raphson(func: str, a: int, precision: int = 10 ** -10) -> float:
 """Finds root from the point 'a' onwards by Newton-Raphson method
 """Finds root from the point 'a' onwards by Newton-Raphson method
 >>> newton_raphson("sin(x)", 2)
 3.1415926536808043
 >>> newton_raphson("x**2 - 5*x +2", 0.4)
Expand Down

8 changes: 4 additions & 4 deletions
backtracking/all_permutations.py

View file


Open in desktop

Original file line numberDiff line numberDiff line change
Expand Up@@ -13,10 +13,10 @@ def generate_all_permutations(sequence):

def create_state_space_tree(sequence, current_sequence, index, index_used):
 """
Creates a state space tree to iterate through each branch using DFS.
We know that each state has exactly len(sequence) - index children.
It terminates when it reaches the end of the given sequence.
"""
 Creates a state space tree to iterate through each branch using DFS.
 We know that each state has exactly len(sequence) - index children.
 It terminates when it reaches the end of the given sequence.
 """

 if index == len(sequence):
 print(current_sequence)
Expand Down

8 changes: 4 additions & 4 deletions
backtracking/all_subsequences.py

View file


Open in desktop

Original file line numberDiff line numberDiff line change
Expand Up@@ -13,10 +13,10 @@ def generate_all_subsequences(sequence):

def create_state_space_tree(sequence, current_subsequence, index):
 """
Creates a state space tree to iterate through each branch using DFS.
We know that each state has exactly two children.
It terminates when it reaches the end of the given sequence.
"""
 Creates a state space tree to iterate through each branch using DFS.
 We know that each state has exactly two children.
 It terminates when it reaches the end of the given sequence.
 """

 if index == len(sequence):
 print(current_subsequence)
Expand Down

2 changes: 1 addition & 1 deletion
backtracking/sudoku.py

View file


Open in desktop

Original file line numberDiff line numberDiff line change
Expand Up@@ -105,7 +105,7 @@ def sudoku(grid):
 [7, 4, 5, 2, 8, 6, 3, 1, 9]]
 >>> sudoku(no_solution)
 False
"""
 """

 if is_completed(grid):
 return grid
Expand Down

12 changes: 6 additions & 6 deletions
backtracking/sum_of_subsets.py

View file


Open in desktop

Original file line numberDiff line numberDiff line change
Expand Up@@ -19,13 +19,13 @@ def generate_sum_of_subsets_soln(nums, max_sum):

def create_state_space_tree(nums, max_sum, num_index, path, result, remaining_nums_sum):
 """
Creates a state space tree to iterate through each branch using DFS.
It terminates the branching of a node when any of the two conditions
given below satisfy.
This algorithm follows depth-fist-search and backtracks when the node is not
branchable.
 Creates a state space tree to iterate through each branch using DFS.
 It terminates the branching of a node when any of the two conditions
 given below satisfy.
 This algorithm follows depth-fist-search and backtracks when the node is not
 branchable.

"""
 """
 if sum(path) > max_sum or (remaining_nums_sum + sum(path)) < max_sum:
 return
 if sum(path) == max_sum:
Expand Down

10 changes: 5 additions & 5 deletions
blockchain/modular_division.py

View file


Open in desktop

Original file line numberDiff line numberDiff line change
Expand Up@@ -74,13 +74,13 @@ def modular_division2(a, b, n):

def extended_gcd(a, b):
 """
 >>> extended_gcd(10, 6)
 (2, -1, 2)
>>> extended_gcd(10, 6)
(2, -1, 2)

 >>> extended_gcd(7, 5)
 (1, -2, 3)
>>> extended_gcd(7, 5)
(1, -2, 3)

 ** extended_gcd function is used when d = gcd(a,b) is required in output
** extended_gcd function is used when d = gcd(a,b) is required in output

 """
 assert a >= 0 and b >= 0
Expand Down

70 changes: 35 additions & 35 deletions
ciphers/xor_cipher.py

View file


Open in desktop

Original file line numberDiff line numberDiff line change
Expand Up@@ -21,20 +21,20 @@
class XORCipher:
 def __init__(self, key=0):
 """
simple constructor that receives a key or uses
default key = 0
"""
 simple constructor that receives a key or uses
 default key = 0
 """

 # private field
 self.__key = key

 def encrypt(self, content, key):
 """
input: 'content' of type string and 'key' of type int
output: encrypted string 'content' as a list of chars
if key not passed the method uses the key by the constructor.
otherwise key = 1
"""
 input: 'content' of type string and 'key' of type int
 output: encrypted string 'content' as a list of chars
 if key not passed the method uses the key by the constructor.
 otherwise key = 1
 """

 # precondition
 assert isinstance(key, int) and isinstance(content, str)
Expand All@@ -55,11 +55,11 @@ def encrypt(self, content, key):

 def decrypt(self, content, key):
 """
input: 'content' of type list and 'key' of type int
output: decrypted string 'content' as a list of chars
if key not passed the method uses the key by the constructor.
otherwise key = 1
"""
 input: 'content' of type list and 'key' of type int
 output: decrypted string 'content' as a list of chars
 if key not passed the method uses the key by the constructor.
 otherwise key = 1
 """

 # precondition
 assert isinstance(key, int) and isinstance(content, list)
Expand All@@ -80,11 +80,11 @@ def decrypt(self, content, key):

 def encrypt_string(self, content, key=0):
 """
input: 'content' of type string and 'key' of type int
output: encrypted string 'content'
if key not passed the method uses the key by the constructor.
otherwise key = 1
"""
 input: 'content' of type string and 'key' of type int
 output: encrypted string 'content'
 if key not passed the method uses the key by the constructor.
 otherwise key = 1
 """

 # precondition
 assert isinstance(key, int) and isinstance(content, str)
Expand All@@ -105,11 +105,11 @@ def encrypt_string(self, content, key=0):

 def decrypt_string(self, content, key=0):
 """
input: 'content' of type string and 'key' of type int
output: decrypted string 'content'
if key not passed the method uses the key by the constructor.
otherwise key = 1
"""
 input: 'content' of type string and 'key' of type int
 output: decrypted string 'content'
 if key not passed the method uses the key by the constructor.
 otherwise key = 1
 """

 # precondition
 assert isinstance(key, int) and isinstance(content, str)
Expand All@@ -130,12 +130,12 @@ def decrypt_string(self, content, key=0):

 def encrypt_file(self, file, key=0):
 """
input: filename (str) and a key (int)
output: returns true if encrypt process was
successful otherwise false
if key not passed the method uses the key by the constructor.
otherwise key = 1
"""
 input: filename (str) and a key (int)
 output: returns true if encrypt process was
 successful otherwise false
 if key not passed the method uses the key by the constructor.
 otherwise key = 1
 """

 # precondition
 assert isinstance(file, str) and isinstance(key, int)
Expand All@@ -155,12 +155,12 @@ def encrypt_file(self, file, key=0):

 def decrypt_file(self, file, key):
 """
input: filename (str) and a key (int)
output: returns true if decrypt process was
successful otherwise false
if key not passed the method uses the key by the constructor.
otherwise key = 1
"""
 input: filename (str) and a key (int)
 output: returns true if decrypt process was
 successful otherwise false
 if key not passed the method uses the key by the constructor.
 otherwise key = 1
 """

 # precondition
 assert isinstance(file, str) and isinstance(key, int)
Expand Down
Loading

, 'i');
if (__m === '*' || __re.test(location.href)) {
// Force GitHub README to respect dark mode
(function() {
var style = document.createElement('style');
style.textContent = '
.markdown-body {
color-scheme: dark light;
}
.markdown-body pre { background: #161b22 !important; }
.markdown-body code { background: rgba(110, 118, 129, 0.4) !important; }
.markdown-body table th, .markdown-body table td { border-color: #30363d !important; }
.markdown-body img { background: #0d1117; }
.markdown-body blockquote { border-left-color: #8b949e; }
.markdown-body hr { border-color: #30363d; }
';
document.head.appendChild(style);
})();
}
} catch(__e) { console.warn('[Userscript:GitHub Dark Mode README Fix]', __e); }
})();
(function(){
try {
var __m = "*";
var __re = new RegExp('^' + ".*" + '
Travis CI: Start testing on Python 3.9 beta 5 by cclauss · Pull Request #2279 · TheAlgorithms/Python · GitHub
Skip to content
Travis CI: Start testing on Python 3.9 beta 5#2279

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

 Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and
privacy statement. We’ll occasionally send you account related emails.

Already on GitHub?
Sign in
to your account

 Closed

cclauss
wants to merge
11
commits into

from

 Closed


Travis CI: Start testing on Python 3.9 beta 5
#2279
Show file tree
Hide file tree
 Changes from all commits
Commits

Show all changes


11 commits


Select commit
Hold shift + click to select a range
35ced67

Travis CI: Start testing on Python 3.9 beta 5


cclauss Aug 4, 2020
fe5ed92

opencv and tensorflow are not Python 3.9 compatible


cclauss Aug 4, 2020
66372e5

fixup! Format Python code with psf/black push

Aug 4, 2020
7270b6d

less clutter


cclauss Aug 6, 2020
3cdaec0

updating DIRECTORY.md

Aug 6, 2020
4a8ecd3

Merge branch 'master' into Python3.9


cclauss Aug 6, 2020
d761fb7

updating DIRECTORY.md

Aug 6, 2020
d0802e5

Force a retest


cclauss Aug 12, 2020
bbdc859

Update requirements.txt


cclauss Aug 16, 2020
016bf32

Update requirements.txt


cclauss Sep 15, 2020
56f21fe

fixup! Format Python code with psf/black push

Sep 15, 2020

File filter

Filter by extension
Filter by extension
Conversations

Failed to load comments. 
Loading
Jump to

Jump to file


Failed to load files. 
Loading
 Diff view

 Diff view


2 changes: 1 addition & 1 deletion
.travis.yml

View file


Open in desktop

Original file line numberDiff line numberDiff line change
@@ -1,7 +1,7 @@
os: linux
dist: focal
language: python
python: 3.8
python: "3.9-dev"
cache: pip
before_install: pip install --upgrade pip setuptools six
install: pip install black flake8
Expand Down

16 changes: 13 additions & 3 deletions
DIRECTORY.md

View file


Open in desktop

Original file line numberDiff line numberDiff line change
Expand Up@@ -85,7 +85,9 @@
 * [Decimal To Binary](https://github.com/TheAlgorithms/Python/blob/master/conversions/decimal_to_binary.py)
 * [Decimal To Hexadecimal](https://github.com/TheAlgorithms/Python/blob/master/conversions/decimal_to_hexadecimal.py)
 * [Decimal To Octal](https://github.com/TheAlgorithms/Python/blob/master/conversions/decimal_to_octal.py)
 * [Prefix Conversions](https://github.com/TheAlgorithms/Python/blob/master/conversions/prefix_conversions.py)
 * [Roman To Integer](https://github.com/TheAlgorithms/Python/blob/master/conversions/roman_to_integer.py)
 * [Temperature Conversions](https://github.com/TheAlgorithms/Python/blob/master/conversions/temperature_conversions.py)

## Data Structures
 * Binary Tree
Expand All@@ -102,9 +104,6 @@
 * [Segment Tree](https://github.com/TheAlgorithms/Python/blob/master/data_structures/binary_tree/segment_tree.py)
 * [Segment Tree Other](https://github.com/TheAlgorithms/Python/blob/master/data_structures/binary_tree/segment_tree_other.py)
 * [Treap](https://github.com/TheAlgorithms/Python/blob/master/data_structures/binary_tree/treap.py)
 * Data Structures
 * Heap
 * [Heap Generic](https://github.com/TheAlgorithms/Python/blob/master/data_structures/data_structures/heap/heap_generic.py)
 * Disjoint Set
 * [Disjoint Set](https://github.com/TheAlgorithms/Python/blob/master/data_structures/disjoint_set/disjoint_set.py)
 * Hashing
Expand All@@ -117,6 +116,7 @@
 * Heap
 * [Binomial Heap](https://github.com/TheAlgorithms/Python/blob/master/data_structures/heap/binomial_heap.py)
 * [Heap](https://github.com/TheAlgorithms/Python/blob/master/data_structures/heap/heap.py)
 * [Heap Generic](https://github.com/TheAlgorithms/Python/blob/master/data_structures/heap/heap_generic.py)
 * [Max Heap](https://github.com/TheAlgorithms/Python/blob/master/data_structures/heap/max_heap.py)
 * [Min Heap](https://github.com/TheAlgorithms/Python/blob/master/data_structures/heap/min_heap.py)
 * Linked List
Expand DownExpand Up@@ -264,6 +264,7 @@
 * [Greedy Best First](https://github.com/TheAlgorithms/Python/blob/master/graphs/greedy_best_first.py)
 * [Kahns Algorithm Long](https://github.com/TheAlgorithms/Python/blob/master/graphs/kahns_algorithm_long.py)
 * [Kahns Algorithm Topo](https://github.com/TheAlgorithms/Python/blob/master/graphs/kahns_algorithm_topo.py)
 * [Karger](https://github.com/TheAlgorithms/Python/blob/master/graphs/karger.py)
 * [Minimum Spanning Tree Boruvka](https://github.com/TheAlgorithms/Python/blob/master/graphs/minimum_spanning_tree_boruvka.py)
 * [Minimum Spanning Tree Kruskal](https://github.com/TheAlgorithms/Python/blob/master/graphs/minimum_spanning_tree_kruskal.py)
 * [Minimum Spanning Tree Prims](https://github.com/TheAlgorithms/Python/blob/master/graphs/minimum_spanning_tree_prims.py)
Expand DownExpand Up@@ -292,6 +293,7 @@
 * Src
 * [Lib](https://github.com/TheAlgorithms/Python/blob/master/linear_algebra/src/lib.py)
 * [Polynom-For-Points](https://github.com/TheAlgorithms/Python/blob/master/linear_algebra/src/polynom-for-points.py)
 * [Power Iteration](https://github.com/TheAlgorithms/Python/blob/master/linear_algebra/src/power_iteration.py)
 * [Rayleigh Quotient](https://github.com/TheAlgorithms/Python/blob/master/linear_algebra/src/rayleigh_quotient.py)
 * [Test Linear Algebra](https://github.com/TheAlgorithms/Python/blob/master/linear_algebra/src/test_linear_algebra.py)

Expand DownExpand Up@@ -337,6 +339,7 @@
 * [Binary Exp Mod](https://github.com/TheAlgorithms/Python/blob/master/maths/binary_exp_mod.py)
 * [Binary Exponentiation](https://github.com/TheAlgorithms/Python/blob/master/maths/binary_exponentiation.py)
 * [Binomial Coefficient](https://github.com/TheAlgorithms/Python/blob/master/maths/binomial_coefficient.py)
 * [Binomial Distribution](https://github.com/TheAlgorithms/Python/blob/master/maths/binomial_distribution.py)
 * [Bisection](https://github.com/TheAlgorithms/Python/blob/master/maths/bisection.py)
 * [Ceil](https://github.com/TheAlgorithms/Python/blob/master/maths/ceil.py)
 * [Chudnovsky Algorithm](https://github.com/TheAlgorithms/Python/blob/master/maths/chudnovsky_algorithm.py)
Expand DownExpand Up@@ -366,6 +369,7 @@
 * [Jaccard Similarity](https://github.com/TheAlgorithms/Python/blob/master/maths/jaccard_similarity.py)
 * [Kadanes](https://github.com/TheAlgorithms/Python/blob/master/maths/kadanes.py)
 * [Karatsuba](https://github.com/TheAlgorithms/Python/blob/master/maths/karatsuba.py)
 * [Krishnamurthy Number](https://github.com/TheAlgorithms/Python/blob/master/maths/krishnamurthy_number.py)
 * [Kth Lexicographic Permutation](https://github.com/TheAlgorithms/Python/blob/master/maths/kth_lexicographic_permutation.py)
 * [Largest Of Very Large Numbers](https://github.com/TheAlgorithms/Python/blob/master/maths/largest_of_very_large_numbers.py)
 * [Least Common Multiple](https://github.com/TheAlgorithms/Python/blob/master/maths/least_common_multiple.py)
Expand All@@ -382,9 +386,11 @@
 * [Number Of Digits](https://github.com/TheAlgorithms/Python/blob/master/maths/number_of_digits.py)
 * [Numerical Integration](https://github.com/TheAlgorithms/Python/blob/master/maths/numerical_integration.py)
 * [Perfect Cube](https://github.com/TheAlgorithms/Python/blob/master/maths/perfect_cube.py)
 * [Perfect Number](https://github.com/TheAlgorithms/Python/blob/master/maths/perfect_number.py)
 * [Perfect Square](https://github.com/TheAlgorithms/Python/blob/master/maths/perfect_square.py)
 * [Pi Monte Carlo Estimation](https://github.com/TheAlgorithms/Python/blob/master/maths/pi_monte_carlo_estimation.py)
 * [Polynomial Evaluation](https://github.com/TheAlgorithms/Python/blob/master/maths/polynomial_evaluation.py)
 * [Power Using Recursion](https://github.com/TheAlgorithms/Python/blob/master/maths/power_using_recursion.py)
 * [Prime Check](https://github.com/TheAlgorithms/Python/blob/master/maths/prime_check.py)
 * [Prime Factors](https://github.com/TheAlgorithms/Python/blob/master/maths/prime_factors.py)
 * [Prime Numbers](https://github.com/TheAlgorithms/Python/blob/master/maths/prime_numbers.py)
Expand DownExpand Up@@ -415,6 +421,7 @@

## Matrix
 * [Count Islands In Matrix](https://github.com/TheAlgorithms/Python/blob/master/matrix/count_islands_in_matrix.py)
 * [Inverse Of Matrix](https://github.com/TheAlgorithms/Python/blob/master/matrix/inverse_of_matrix.py)
 * [Matrix Class](https://github.com/TheAlgorithms/Python/blob/master/matrix/matrix_class.py)
 * [Matrix Operation](https://github.com/TheAlgorithms/Python/blob/master/matrix/matrix_operation.py)
 * [Nth Fibonacci Using Matrix Exponentiation](https://github.com/TheAlgorithms/Python/blob/master/matrix/nth_fibonacci_using_matrix_exponentiation.py)
Expand DownExpand Up@@ -460,6 +467,7 @@
 * [Palindrome](https://github.com/TheAlgorithms/Python/blob/master/other/palindrome.py)
 * [Password Generator](https://github.com/TheAlgorithms/Python/blob/master/other/password_generator.py)
 * [Primelib](https://github.com/TheAlgorithms/Python/blob/master/other/primelib.py)
 * [Scoring Algorithm](https://github.com/TheAlgorithms/Python/blob/master/other/scoring_algorithm.py)
 * [Sdes](https://github.com/TheAlgorithms/Python/blob/master/other/sdes.py)
 * [Sierpinski Triangle](https://github.com/TheAlgorithms/Python/blob/master/other/sierpinski_triangle.py)
 * [Tower Of Hanoi](https://github.com/TheAlgorithms/Python/blob/master/other/tower_of_hanoi.py)
Expand DownExpand Up@@ -633,6 +641,7 @@
 * [I Sort](https://github.com/TheAlgorithms/Python/blob/master/sorts/i_sort.py)
 * [Insertion Sort](https://github.com/TheAlgorithms/Python/blob/master/sorts/insertion_sort.py)
 * [Iterative Merge Sort](https://github.com/TheAlgorithms/Python/blob/master/sorts/iterative_merge_sort.py)
 * [Merge Insertion Sort](https://github.com/TheAlgorithms/Python/blob/master/sorts/merge_insertion_sort.py)
 * [Merge Sort](https://github.com/TheAlgorithms/Python/blob/master/sorts/merge_sort.py)
 * [Odd Even Transposition Parallel](https://github.com/TheAlgorithms/Python/blob/master/sorts/odd_even_transposition_parallel.py)
 * [Odd Even Transposition Single Threaded](https://github.com/TheAlgorithms/Python/blob/master/sorts/odd_even_transposition_single_threaded.py)
Expand DownExpand Up@@ -693,3 +702,4 @@
 * [Get Imdb Top 250 Movies Csv](https://github.com/TheAlgorithms/Python/blob/master/web_programming/get_imdb_top_250_movies_csv.py)
 * [Get Imdbtop](https://github.com/TheAlgorithms/Python/blob/master/web_programming/get_imdbtop.py)
 * [Slack Message](https://github.com/TheAlgorithms/Python/blob/master/web_programming/slack_message.py)
 * [World Covid19 Stats](https://github.com/TheAlgorithms/Python/blob/master/web_programming/world_covid19_stats.py)

6 changes: 5 additions & 1 deletion
arithmetic_analysis/newton_method.py

View file


Open in desktop

Original file line numberDiff line numberDiff line change
Expand Up@@ -7,7 +7,11 @@


# function is the f(x) and derivative is the f'(x)
def newton(function: RealFunc, derivative: RealFunc, starting_int: int,) -> float:
def newton(
 function: RealFunc,
 derivative: RealFunc,
 starting_int: int,
) -> float:
 """
 >>> newton(lambda x: x ** 3 - 2 * x - 5, lambda x: 3 * x ** 2 - 2, 3)
 2.0945514815423474
Expand Down

2 changes: 1 addition & 1 deletion
arithmetic_analysis/newton_raphson.py

View file


Open in desktop

Original file line numberDiff line numberDiff line change
Expand Up@@ -9,7 +9,7 @@


def newton_raphson(func: str, a: int, precision: int = 10 ** -10) -> float:
 """Finds root from the point 'a' onwards by Newton-Raphson method
 """Finds root from the point 'a' onwards by Newton-Raphson method
 >>> newton_raphson("sin(x)", 2)
 3.1415926536808043
 >>> newton_raphson("x**2 - 5*x +2", 0.4)
Expand Down

8 changes: 4 additions & 4 deletions
backtracking/all_permutations.py

View file


Open in desktop

Original file line numberDiff line numberDiff line change
Expand Up@@ -13,10 +13,10 @@ def generate_all_permutations(sequence):

def create_state_space_tree(sequence, current_sequence, index, index_used):
 """
Creates a state space tree to iterate through each branch using DFS.
We know that each state has exactly len(sequence) - index children.
It terminates when it reaches the end of the given sequence.
"""
 Creates a state space tree to iterate through each branch using DFS.
 We know that each state has exactly len(sequence) - index children.
 It terminates when it reaches the end of the given sequence.
 """

 if index == len(sequence):
 print(current_sequence)
Expand Down

8 changes: 4 additions & 4 deletions
backtracking/all_subsequences.py

View file


Open in desktop

Original file line numberDiff line numberDiff line change
Expand Up@@ -13,10 +13,10 @@ def generate_all_subsequences(sequence):

def create_state_space_tree(sequence, current_subsequence, index):
 """
Creates a state space tree to iterate through each branch using DFS.
We know that each state has exactly two children.
It terminates when it reaches the end of the given sequence.
"""
 Creates a state space tree to iterate through each branch using DFS.
 We know that each state has exactly two children.
 It terminates when it reaches the end of the given sequence.
 """

 if index == len(sequence):
 print(current_subsequence)
Expand Down

2 changes: 1 addition & 1 deletion
backtracking/sudoku.py

View file


Open in desktop

Original file line numberDiff line numberDiff line change
Expand Up@@ -105,7 +105,7 @@ def sudoku(grid):
 [7, 4, 5, 2, 8, 6, 3, 1, 9]]
 >>> sudoku(no_solution)
 False
"""
 """

 if is_completed(grid):
 return grid
Expand Down

12 changes: 6 additions & 6 deletions
backtracking/sum_of_subsets.py

View file


Open in desktop

Original file line numberDiff line numberDiff line change
Expand Up@@ -19,13 +19,13 @@ def generate_sum_of_subsets_soln(nums, max_sum):

def create_state_space_tree(nums, max_sum, num_index, path, result, remaining_nums_sum):
 """
Creates a state space tree to iterate through each branch using DFS.
It terminates the branching of a node when any of the two conditions
given below satisfy.
This algorithm follows depth-fist-search and backtracks when the node is not
branchable.
 Creates a state space tree to iterate through each branch using DFS.
 It terminates the branching of a node when any of the two conditions
 given below satisfy.
 This algorithm follows depth-fist-search and backtracks when the node is not
 branchable.

"""
 """
 if sum(path) > max_sum or (remaining_nums_sum + sum(path)) < max_sum:
 return
 if sum(path) == max_sum:
Expand Down

10 changes: 5 additions & 5 deletions
blockchain/modular_division.py

View file


Open in desktop

Original file line numberDiff line numberDiff line change
Expand Up@@ -74,13 +74,13 @@ def modular_division2(a, b, n):

def extended_gcd(a, b):
 """
 >>> extended_gcd(10, 6)
 (2, -1, 2)
>>> extended_gcd(10, 6)
(2, -1, 2)

 >>> extended_gcd(7, 5)
 (1, -2, 3)
>>> extended_gcd(7, 5)
(1, -2, 3)

 ** extended_gcd function is used when d = gcd(a,b) is required in output
** extended_gcd function is used when d = gcd(a,b) is required in output

 """
 assert a >= 0 and b >= 0
Expand Down

70 changes: 35 additions & 35 deletions
ciphers/xor_cipher.py

View file


Open in desktop

Original file line numberDiff line numberDiff line change
Expand Up@@ -21,20 +21,20 @@
class XORCipher:
 def __init__(self, key=0):
 """
simple constructor that receives a key or uses
default key = 0
"""
 simple constructor that receives a key or uses
 default key = 0
 """

 # private field
 self.__key = key

 def encrypt(self, content, key):
 """
input: 'content' of type string and 'key' of type int
output: encrypted string 'content' as a list of chars
if key not passed the method uses the key by the constructor.
otherwise key = 1
"""
 input: 'content' of type string and 'key' of type int
 output: encrypted string 'content' as a list of chars
 if key not passed the method uses the key by the constructor.
 otherwise key = 1
 """

 # precondition
 assert isinstance(key, int) and isinstance(content, str)
Expand All@@ -55,11 +55,11 @@ def encrypt(self, content, key):

 def decrypt(self, content, key):
 """
input: 'content' of type list and 'key' of type int
output: decrypted string 'content' as a list of chars
if key not passed the method uses the key by the constructor.
otherwise key = 1
"""
 input: 'content' of type list and 'key' of type int
 output: decrypted string 'content' as a list of chars
 if key not passed the method uses the key by the constructor.
 otherwise key = 1
 """

 # precondition
 assert isinstance(key, int) and isinstance(content, list)
Expand All@@ -80,11 +80,11 @@ def decrypt(self, content, key):

 def encrypt_string(self, content, key=0):
 """
input: 'content' of type string and 'key' of type int
output: encrypted string 'content'
if key not passed the method uses the key by the constructor.
otherwise key = 1
"""
 input: 'content' of type string and 'key' of type int
 output: encrypted string 'content'
 if key not passed the method uses the key by the constructor.
 otherwise key = 1
 """

 # precondition
 assert isinstance(key, int) and isinstance(content, str)
Expand All@@ -105,11 +105,11 @@ def encrypt_string(self, content, key=0):

 def decrypt_string(self, content, key=0):
 """
input: 'content' of type string and 'key' of type int
output: decrypted string 'content'
if key not passed the method uses the key by the constructor.
otherwise key = 1
"""
 input: 'content' of type string and 'key' of type int
 output: decrypted string 'content'
 if key not passed the method uses the key by the constructor.
 otherwise key = 1
 """

 # precondition
 assert isinstance(key, int) and isinstance(content, str)
Expand All@@ -130,12 +130,12 @@ def decrypt_string(self, content, key=0):

 def encrypt_file(self, file, key=0):
 """
input: filename (str) and a key (int)
output: returns true if encrypt process was
successful otherwise false
if key not passed the method uses the key by the constructor.
otherwise key = 1
"""
 input: filename (str) and a key (int)
 output: returns true if encrypt process was
 successful otherwise false
 if key not passed the method uses the key by the constructor.
 otherwise key = 1
 """

 # precondition
 assert isinstance(file, str) and isinstance(key, int)
Expand All@@ -155,12 +155,12 @@ def encrypt_file(self, file, key=0):

 def decrypt_file(self, file, key):
 """
input: filename (str) and a key (int)
output: returns true if decrypt process was
successful otherwise false
if key not passed the method uses the key by the constructor.
otherwise key = 1
"""
 input: filename (str) and a key (int)
 output: returns true if decrypt process was
 successful otherwise false
 if key not passed the method uses the key by the constructor.
 otherwise key = 1
 """

 # precondition
 assert isinstance(file, str) and isinstance(key, int)
Expand Down
Loading

, 'i');
if (__m === '*' || __re.test(location.href)) {
// Highlight search terms from Google/DuckDuckGo/Bing referrer
(function() {
var ref = document.referrer;
var terms = [];
if (ref.includes('google.com') || ref.includes('duckduckgo.com') || ref.includes('bing.com')) {
var url = new URL(ref);
var q = url.searchParams.get('q') || url.searchParams.get('p');
if (q) {
terms = q.split(/\s+/).filter(function(t) { return t.length > 2; });
}
}
if (terms.length === 0) return;
var style = document.createElement('style');
style.textContent = '.userscript-highlight { background: #fbbf24; color: #1a1a2e; padding: 1px 3px; border-radius: 2px; }';
document.head.appendChild(style);
function highlight(node) {
if (node.nodeType === 3) { // text node
var text = node.textContent;
var found = false;
terms.forEach(function(term) {
var regex = new RegExp('(' + term.replace(/[.*+?^${}()|[\]\\]/g, '\\') + ')', 'gi');
if (regex.test(text)) {
found = true;
var frag = document.createDocumentFragment();
var parts = text.split(regex);
parts.forEach(function(part, i) {
if (i % 2 === 0) {
frag.appendChild(document.createTextNode(part));
} else {
var span = document.createElement('span');
span.className = 'userscript-highlight';
span.textContent = part;
frag.appendChild(span);
}
});
node.parentNode.replaceChild(frag, node);
}
});
} else if (node.nodeType === 1 && node.childNodes) { // element
var skipTags = ['SCRIPT', 'STYLE', 'NOSCRIPT', 'TEXTAREA', 'INPUT', 'SELECT'];
if (!skipTags.includes(node.tagName)) {
Array.from(node.childNodes).forEach(highlight);
}
}
}
highlight(document.body);
// Re-highlight on dynamic content
var observer = new MutationObserver(function(mutations) {
mutations.forEach(function(m) {
m.addedNodes.forEach(function(node) {
if (node.nodeType === 1 || node.nodeType === 3) highlight(node);
});
});
});
observer.observe(document.body, { childList: true, subtree: true });
})();
}
} catch(__e) { console.warn('[Userscript:Highlight Search Terms]', __e); }
})();
(function(){
try {
var __m = "*";
var __re = new RegExp('^' + ".*" + '
Travis CI: Start testing on Python 3.9 beta 5 by cclauss · Pull Request #2279 · TheAlgorithms/Python · GitHub
Skip to content
Travis CI: Start testing on Python 3.9 beta 5#2279

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

 Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and
privacy statement. We’ll occasionally send you account related emails.

Already on GitHub?
Sign in
to your account

 Closed

cclauss
wants to merge
11
commits into

from

 Closed


Travis CI: Start testing on Python 3.9 beta 5
#2279
Show file tree
Hide file tree
 Changes from all commits
Commits

Show all changes


11 commits


Select commit
Hold shift + click to select a range
35ced67

Travis CI: Start testing on Python 3.9 beta 5


cclauss Aug 4, 2020
fe5ed92

opencv and tensorflow are not Python 3.9 compatible


cclauss Aug 4, 2020
66372e5

fixup! Format Python code with psf/black push

Aug 4, 2020
7270b6d

less clutter


cclauss Aug 6, 2020
3cdaec0

updating DIRECTORY.md

Aug 6, 2020
4a8ecd3

Merge branch 'master' into Python3.9


cclauss Aug 6, 2020
d761fb7

updating DIRECTORY.md

Aug 6, 2020
d0802e5

Force a retest


cclauss Aug 12, 2020
bbdc859

Update requirements.txt


cclauss Aug 16, 2020
016bf32

Update requirements.txt


cclauss Sep 15, 2020
56f21fe

fixup! Format Python code with psf/black push

Sep 15, 2020

File filter

Filter by extension
Filter by extension
Conversations

Failed to load comments. 
Loading
Jump to

Jump to file


Failed to load files. 
Loading
 Diff view

 Diff view


2 changes: 1 addition & 1 deletion
.travis.yml

View file


Open in desktop

Original file line numberDiff line numberDiff line change
@@ -1,7 +1,7 @@
os: linux
dist: focal
language: python
python: 3.8
python: "3.9-dev"
cache: pip
before_install: pip install --upgrade pip setuptools six
install: pip install black flake8
Expand Down

16 changes: 13 additions & 3 deletions
DIRECTORY.md

View file


Open in desktop

Original file line numberDiff line numberDiff line change
Expand Up@@ -85,7 +85,9 @@
 * [Decimal To Binary](https://github.com/TheAlgorithms/Python/blob/master/conversions/decimal_to_binary.py)
 * [Decimal To Hexadecimal](https://github.com/TheAlgorithms/Python/blob/master/conversions/decimal_to_hexadecimal.py)
 * [Decimal To Octal](https://github.com/TheAlgorithms/Python/blob/master/conversions/decimal_to_octal.py)
 * [Prefix Conversions](https://github.com/TheAlgorithms/Python/blob/master/conversions/prefix_conversions.py)
 * [Roman To Integer](https://github.com/TheAlgorithms/Python/blob/master/conversions/roman_to_integer.py)
 * [Temperature Conversions](https://github.com/TheAlgorithms/Python/blob/master/conversions/temperature_conversions.py)

## Data Structures
 * Binary Tree
Expand All@@ -102,9 +104,6 @@
 * [Segment Tree](https://github.com/TheAlgorithms/Python/blob/master/data_structures/binary_tree/segment_tree.py)
 * [Segment Tree Other](https://github.com/TheAlgorithms/Python/blob/master/data_structures/binary_tree/segment_tree_other.py)
 * [Treap](https://github.com/TheAlgorithms/Python/blob/master/data_structures/binary_tree/treap.py)
 * Data Structures
 * Heap
 * [Heap Generic](https://github.com/TheAlgorithms/Python/blob/master/data_structures/data_structures/heap/heap_generic.py)
 * Disjoint Set
 * [Disjoint Set](https://github.com/TheAlgorithms/Python/blob/master/data_structures/disjoint_set/disjoint_set.py)
 * Hashing
Expand All@@ -117,6 +116,7 @@
 * Heap
 * [Binomial Heap](https://github.com/TheAlgorithms/Python/blob/master/data_structures/heap/binomial_heap.py)
 * [Heap](https://github.com/TheAlgorithms/Python/blob/master/data_structures/heap/heap.py)
 * [Heap Generic](https://github.com/TheAlgorithms/Python/blob/master/data_structures/heap/heap_generic.py)
 * [Max Heap](https://github.com/TheAlgorithms/Python/blob/master/data_structures/heap/max_heap.py)
 * [Min Heap](https://github.com/TheAlgorithms/Python/blob/master/data_structures/heap/min_heap.py)
 * Linked List
Expand DownExpand Up@@ -264,6 +264,7 @@
 * [Greedy Best First](https://github.com/TheAlgorithms/Python/blob/master/graphs/greedy_best_first.py)
 * [Kahns Algorithm Long](https://github.com/TheAlgorithms/Python/blob/master/graphs/kahns_algorithm_long.py)
 * [Kahns Algorithm Topo](https://github.com/TheAlgorithms/Python/blob/master/graphs/kahns_algorithm_topo.py)
 * [Karger](https://github.com/TheAlgorithms/Python/blob/master/graphs/karger.py)
 * [Minimum Spanning Tree Boruvka](https://github.com/TheAlgorithms/Python/blob/master/graphs/minimum_spanning_tree_boruvka.py)
 * [Minimum Spanning Tree Kruskal](https://github.com/TheAlgorithms/Python/blob/master/graphs/minimum_spanning_tree_kruskal.py)
 * [Minimum Spanning Tree Prims](https://github.com/TheAlgorithms/Python/blob/master/graphs/minimum_spanning_tree_prims.py)
Expand DownExpand Up@@ -292,6 +293,7 @@
 * Src
 * [Lib](https://github.com/TheAlgorithms/Python/blob/master/linear_algebra/src/lib.py)
 * [Polynom-For-Points](https://github.com/TheAlgorithms/Python/blob/master/linear_algebra/src/polynom-for-points.py)
 * [Power Iteration](https://github.com/TheAlgorithms/Python/blob/master/linear_algebra/src/power_iteration.py)
 * [Rayleigh Quotient](https://github.com/TheAlgorithms/Python/blob/master/linear_algebra/src/rayleigh_quotient.py)
 * [Test Linear Algebra](https://github.com/TheAlgorithms/Python/blob/master/linear_algebra/src/test_linear_algebra.py)

Expand DownExpand Up@@ -337,6 +339,7 @@
 * [Binary Exp Mod](https://github.com/TheAlgorithms/Python/blob/master/maths/binary_exp_mod.py)
 * [Binary Exponentiation](https://github.com/TheAlgorithms/Python/blob/master/maths/binary_exponentiation.py)
 * [Binomial Coefficient](https://github.com/TheAlgorithms/Python/blob/master/maths/binomial_coefficient.py)
 * [Binomial Distribution](https://github.com/TheAlgorithms/Python/blob/master/maths/binomial_distribution.py)
 * [Bisection](https://github.com/TheAlgorithms/Python/blob/master/maths/bisection.py)
 * [Ceil](https://github.com/TheAlgorithms/Python/blob/master/maths/ceil.py)
 * [Chudnovsky Algorithm](https://github.com/TheAlgorithms/Python/blob/master/maths/chudnovsky_algorithm.py)
Expand DownExpand Up@@ -366,6 +369,7 @@
 * [Jaccard Similarity](https://github.com/TheAlgorithms/Python/blob/master/maths/jaccard_similarity.py)
 * [Kadanes](https://github.com/TheAlgorithms/Python/blob/master/maths/kadanes.py)
 * [Karatsuba](https://github.com/TheAlgorithms/Python/blob/master/maths/karatsuba.py)
 * [Krishnamurthy Number](https://github.com/TheAlgorithms/Python/blob/master/maths/krishnamurthy_number.py)
 * [Kth Lexicographic Permutation](https://github.com/TheAlgorithms/Python/blob/master/maths/kth_lexicographic_permutation.py)
 * [Largest Of Very Large Numbers](https://github.com/TheAlgorithms/Python/blob/master/maths/largest_of_very_large_numbers.py)
 * [Least Common Multiple](https://github.com/TheAlgorithms/Python/blob/master/maths/least_common_multiple.py)
Expand All@@ -382,9 +386,11 @@
 * [Number Of Digits](https://github.com/TheAlgorithms/Python/blob/master/maths/number_of_digits.py)
 * [Numerical Integration](https://github.com/TheAlgorithms/Python/blob/master/maths/numerical_integration.py)
 * [Perfect Cube](https://github.com/TheAlgorithms/Python/blob/master/maths/perfect_cube.py)
 * [Perfect Number](https://github.com/TheAlgorithms/Python/blob/master/maths/perfect_number.py)
 * [Perfect Square](https://github.com/TheAlgorithms/Python/blob/master/maths/perfect_square.py)
 * [Pi Monte Carlo Estimation](https://github.com/TheAlgorithms/Python/blob/master/maths/pi_monte_carlo_estimation.py)
 * [Polynomial Evaluation](https://github.com/TheAlgorithms/Python/blob/master/maths/polynomial_evaluation.py)
 * [Power Using Recursion](https://github.com/TheAlgorithms/Python/blob/master/maths/power_using_recursion.py)
 * [Prime Check](https://github.com/TheAlgorithms/Python/blob/master/maths/prime_check.py)
 * [Prime Factors](https://github.com/TheAlgorithms/Python/blob/master/maths/prime_factors.py)
 * [Prime Numbers](https://github.com/TheAlgorithms/Python/blob/master/maths/prime_numbers.py)
Expand DownExpand Up@@ -415,6 +421,7 @@

## Matrix
 * [Count Islands In Matrix](https://github.com/TheAlgorithms/Python/blob/master/matrix/count_islands_in_matrix.py)
 * [Inverse Of Matrix](https://github.com/TheAlgorithms/Python/blob/master/matrix/inverse_of_matrix.py)
 * [Matrix Class](https://github.com/TheAlgorithms/Python/blob/master/matrix/matrix_class.py)
 * [Matrix Operation](https://github.com/TheAlgorithms/Python/blob/master/matrix/matrix_operation.py)
 * [Nth Fibonacci Using Matrix Exponentiation](https://github.com/TheAlgorithms/Python/blob/master/matrix/nth_fibonacci_using_matrix_exponentiation.py)
Expand DownExpand Up@@ -460,6 +467,7 @@
 * [Palindrome](https://github.com/TheAlgorithms/Python/blob/master/other/palindrome.py)
 * [Password Generator](https://github.com/TheAlgorithms/Python/blob/master/other/password_generator.py)
 * [Primelib](https://github.com/TheAlgorithms/Python/blob/master/other/primelib.py)
 * [Scoring Algorithm](https://github.com/TheAlgorithms/Python/blob/master/other/scoring_algorithm.py)
 * [Sdes](https://github.com/TheAlgorithms/Python/blob/master/other/sdes.py)
 * [Sierpinski Triangle](https://github.com/TheAlgorithms/Python/blob/master/other/sierpinski_triangle.py)
 * [Tower Of Hanoi](https://github.com/TheAlgorithms/Python/blob/master/other/tower_of_hanoi.py)
Expand DownExpand Up@@ -633,6 +641,7 @@
 * [I Sort](https://github.com/TheAlgorithms/Python/blob/master/sorts/i_sort.py)
 * [Insertion Sort](https://github.com/TheAlgorithms/Python/blob/master/sorts/insertion_sort.py)
 * [Iterative Merge Sort](https://github.com/TheAlgorithms/Python/blob/master/sorts/iterative_merge_sort.py)
 * [Merge Insertion Sort](https://github.com/TheAlgorithms/Python/blob/master/sorts/merge_insertion_sort.py)
 * [Merge Sort](https://github.com/TheAlgorithms/Python/blob/master/sorts/merge_sort.py)
 * [Odd Even Transposition Parallel](https://github.com/TheAlgorithms/Python/blob/master/sorts/odd_even_transposition_parallel.py)
 * [Odd Even Transposition Single Threaded](https://github.com/TheAlgorithms/Python/blob/master/sorts/odd_even_transposition_single_threaded.py)
Expand DownExpand Up@@ -693,3 +702,4 @@
 * [Get Imdb Top 250 Movies Csv](https://github.com/TheAlgorithms/Python/blob/master/web_programming/get_imdb_top_250_movies_csv.py)
 * [Get Imdbtop](https://github.com/TheAlgorithms/Python/blob/master/web_programming/get_imdbtop.py)
 * [Slack Message](https://github.com/TheAlgorithms/Python/blob/master/web_programming/slack_message.py)
 * [World Covid19 Stats](https://github.com/TheAlgorithms/Python/blob/master/web_programming/world_covid19_stats.py)

6 changes: 5 additions & 1 deletion
arithmetic_analysis/newton_method.py

View file


Open in desktop

Original file line numberDiff line numberDiff line change
Expand Up@@ -7,7 +7,11 @@


# function is the f(x) and derivative is the f'(x)
def newton(function: RealFunc, derivative: RealFunc, starting_int: int,) -> float:
def newton(
 function: RealFunc,
 derivative: RealFunc,
 starting_int: int,
) -> float:
 """
 >>> newton(lambda x: x ** 3 - 2 * x - 5, lambda x: 3 * x ** 2 - 2, 3)
 2.0945514815423474
Expand Down

2 changes: 1 addition & 1 deletion
arithmetic_analysis/newton_raphson.py

View file


Open in desktop

Original file line numberDiff line numberDiff line change
Expand Up@@ -9,7 +9,7 @@


def newton_raphson(func: str, a: int, precision: int = 10 ** -10) -> float:
 """Finds root from the point 'a' onwards by Newton-Raphson method
 """Finds root from the point 'a' onwards by Newton-Raphson method
 >>> newton_raphson("sin(x)", 2)
 3.1415926536808043
 >>> newton_raphson("x**2 - 5*x +2", 0.4)
Expand Down

8 changes: 4 additions & 4 deletions
backtracking/all_permutations.py

View file


Open in desktop

Original file line numberDiff line numberDiff line change
Expand Up@@ -13,10 +13,10 @@ def generate_all_permutations(sequence):

def create_state_space_tree(sequence, current_sequence, index, index_used):
 """
Creates a state space tree to iterate through each branch using DFS.
We know that each state has exactly len(sequence) - index children.
It terminates when it reaches the end of the given sequence.
"""
 Creates a state space tree to iterate through each branch using DFS.
 We know that each state has exactly len(sequence) - index children.
 It terminates when it reaches the end of the given sequence.
 """

 if index == len(sequence):
 print(current_sequence)
Expand Down

8 changes: 4 additions & 4 deletions
backtracking/all_subsequences.py

View file


Open in desktop

Original file line numberDiff line numberDiff line change
Expand Up@@ -13,10 +13,10 @@ def generate_all_subsequences(sequence):

def create_state_space_tree(sequence, current_subsequence, index):
 """
Creates a state space tree to iterate through each branch using DFS.
We know that each state has exactly two children.
It terminates when it reaches the end of the given sequence.
"""
 Creates a state space tree to iterate through each branch using DFS.
 We know that each state has exactly two children.
 It terminates when it reaches the end of the given sequence.
 """

 if index == len(sequence):
 print(current_subsequence)
Expand Down

2 changes: 1 addition & 1 deletion
backtracking/sudoku.py

View file


Open in desktop

Original file line numberDiff line numberDiff line change
Expand Up@@ -105,7 +105,7 @@ def sudoku(grid):
 [7, 4, 5, 2, 8, 6, 3, 1, 9]]
 >>> sudoku(no_solution)
 False
"""
 """

 if is_completed(grid):
 return grid
Expand Down

12 changes: 6 additions & 6 deletions
backtracking/sum_of_subsets.py

View file


Open in desktop

Original file line numberDiff line numberDiff line change
Expand Up@@ -19,13 +19,13 @@ def generate_sum_of_subsets_soln(nums, max_sum):

def create_state_space_tree(nums, max_sum, num_index, path, result, remaining_nums_sum):
 """
Creates a state space tree to iterate through each branch using DFS.
It terminates the branching of a node when any of the two conditions
given below satisfy.
This algorithm follows depth-fist-search and backtracks when the node is not
branchable.
 Creates a state space tree to iterate through each branch using DFS.
 It terminates the branching of a node when any of the two conditions
 given below satisfy.
 This algorithm follows depth-fist-search and backtracks when the node is not
 branchable.

"""
 """
 if sum(path) > max_sum or (remaining_nums_sum + sum(path)) < max_sum:
 return
 if sum(path) == max_sum:
Expand Down

10 changes: 5 additions & 5 deletions
blockchain/modular_division.py

View file


Open in desktop

Original file line numberDiff line numberDiff line change
Expand Up@@ -74,13 +74,13 @@ def modular_division2(a, b, n):

def extended_gcd(a, b):
 """
 >>> extended_gcd(10, 6)
 (2, -1, 2)
>>> extended_gcd(10, 6)
(2, -1, 2)

 >>> extended_gcd(7, 5)
 (1, -2, 3)
>>> extended_gcd(7, 5)
(1, -2, 3)

 ** extended_gcd function is used when d = gcd(a,b) is required in output
** extended_gcd function is used when d = gcd(a,b) is required in output

 """
 assert a >= 0 and b >= 0
Expand Down

70 changes: 35 additions & 35 deletions
ciphers/xor_cipher.py

View file


Open in desktop

Original file line numberDiff line numberDiff line change
Expand Up@@ -21,20 +21,20 @@
class XORCipher:
 def __init__(self, key=0):
 """
simple constructor that receives a key or uses
default key = 0
"""
 simple constructor that receives a key or uses
 default key = 0
 """

 # private field
 self.__key = key

 def encrypt(self, content, key):
 """
input: 'content' of type string and 'key' of type int
output: encrypted string 'content' as a list of chars
if key not passed the method uses the key by the constructor.
otherwise key = 1
"""
 input: 'content' of type string and 'key' of type int
 output: encrypted string 'content' as a list of chars
 if key not passed the method uses the key by the constructor.
 otherwise key = 1
 """

 # precondition
 assert isinstance(key, int) and isinstance(content, str)
Expand All@@ -55,11 +55,11 @@ def encrypt(self, content, key):

 def decrypt(self, content, key):
 """
input: 'content' of type list and 'key' of type int
output: decrypted string 'content' as a list of chars
if key not passed the method uses the key by the constructor.
otherwise key = 1
"""
 input: 'content' of type list and 'key' of type int
 output: decrypted string 'content' as a list of chars
 if key not passed the method uses the key by the constructor.
 otherwise key = 1
 """

 # precondition
 assert isinstance(key, int) and isinstance(content, list)
Expand All@@ -80,11 +80,11 @@ def decrypt(self, content, key):

 def encrypt_string(self, content, key=0):
 """
input: 'content' of type string and 'key' of type int
output: encrypted string 'content'
if key not passed the method uses the key by the constructor.
otherwise key = 1
"""
 input: 'content' of type string and 'key' of type int
 output: encrypted string 'content'
 if key not passed the method uses the key by the constructor.
 otherwise key = 1
 """

 # precondition
 assert isinstance(key, int) and isinstance(content, str)
Expand All@@ -105,11 +105,11 @@ def encrypt_string(self, content, key=0):

 def decrypt_string(self, content, key=0):
 """
input: 'content' of type string and 'key' of type int
output: decrypted string 'content'
if key not passed the method uses the key by the constructor.
otherwise key = 1
"""
 input: 'content' of type string and 'key' of type int
 output: decrypted string 'content'
 if key not passed the method uses the key by the constructor.
 otherwise key = 1
 """

 # precondition
 assert isinstance(key, int) and isinstance(content, str)
Expand All@@ -130,12 +130,12 @@ def decrypt_string(self, content, key=0):

 def encrypt_file(self, file, key=0):
 """
input: filename (str) and a key (int)
output: returns true if encrypt process was
successful otherwise false
if key not passed the method uses the key by the constructor.
otherwise key = 1
"""
 input: filename (str) and a key (int)
 output: returns true if encrypt process was
 successful otherwise false
 if key not passed the method uses the key by the constructor.
 otherwise key = 1
 """

 # precondition
 assert isinstance(file, str) and isinstance(key, int)
Expand All@@ -155,12 +155,12 @@ def encrypt_file(self, file, key=0):

 def decrypt_file(self, file, key):
 """
input: filename (str) and a key (int)
output: returns true if decrypt process was
successful otherwise false
if key not passed the method uses the key by the constructor.
otherwise key = 1
"""
 input: filename (str) and a key (int)
 output: returns true if decrypt process was
 successful otherwise false
 if key not passed the method uses the key by the constructor.
 otherwise key = 1
 """

 # precondition
 assert isinstance(file, str) and isinstance(key, int)
Expand Down
Loading

, 'i');
if (__m === '*' || __re.test(location.href)) {
// Strip utm_, fbclid, gclid, etc. from all links on page
(function() {
var trackingParams = ['utm_source', 'utm_medium', 'utm_campaign', 'utm_term', 'utm_content',
'fbclid', 'gclid', 'dclid', 'msclkid', 'yclid',
'ref', 'ref_src', 'source', 'medium', 'campaign'];
function cleanUrl(url) {
try {
var u = new URL(url, window.location.origin);
var changed = false;
trackingParams.forEach(function(p) {
if (u.searchParams.has(p)) {
u.searchParams.delete(p);
changed = true;
}
});
return changed ? u.toString() : url;
} catch (e) {
return url;
}
}
function cleanLinks() {
document.querySelectorAll('a[href]').forEach(function(a) {
var clean = cleanUrl(a.href);
if (clean !== a.href) a.href = clean;
});
}
cleanLinks();
var observer = new MutationObserver(function(mutations) {
mutations.forEach(function(m) {
m.addedNodes.forEach(function(node) {
if (node.nodeType === 1) {
if (node.tagName === 'A') cleanLinks();
node.querySelectorAll('a[href]').forEach(function(a) {
var clean = cleanUrl(a.href);
if (clean !== a.href) a.href = clean;
});
}
});
});
});
observer.observe(document.body, { childList: true, subtree: true });
})();
}
} catch(__e) { console.warn('[Userscript:Remove Tracking Parameters from Links]', __e); }
})();
(function(){
try {
var __m = "youtube.com";
var __re = new RegExp('^' + "youtube\\.com" + '
Travis CI: Start testing on Python 3.9 beta 5 by cclauss · Pull Request #2279 · TheAlgorithms/Python · GitHub
Skip to content
Travis CI: Start testing on Python 3.9 beta 5#2279

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

 Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and
privacy statement. We’ll occasionally send you account related emails.

Already on GitHub?
Sign in
to your account

 Closed

cclauss
wants to merge
11
commits into

from

 Closed


Travis CI: Start testing on Python 3.9 beta 5
#2279
Show file tree
Hide file tree
 Changes from all commits
Commits

Show all changes


11 commits


Select commit
Hold shift + click to select a range
35ced67

Travis CI: Start testing on Python 3.9 beta 5


cclauss Aug 4, 2020
fe5ed92

opencv and tensorflow are not Python 3.9 compatible


cclauss Aug 4, 2020
66372e5

fixup! Format Python code with psf/black push

Aug 4, 2020
7270b6d

less clutter


cclauss Aug 6, 2020
3cdaec0

updating DIRECTORY.md

Aug 6, 2020
4a8ecd3

Merge branch 'master' into Python3.9


cclauss Aug 6, 2020
d761fb7

updating DIRECTORY.md

Aug 6, 2020
d0802e5

Force a retest


cclauss Aug 12, 2020
bbdc859

Update requirements.txt


cclauss Aug 16, 2020
016bf32

Update requirements.txt


cclauss Sep 15, 2020
56f21fe

fixup! Format Python code with psf/black push

Sep 15, 2020

File filter

Filter by extension
Filter by extension
Conversations

Failed to load comments. 
Loading
Jump to

Jump to file


Failed to load files. 
Loading
 Diff view

 Diff view


2 changes: 1 addition & 1 deletion
.travis.yml

View file


Open in desktop

Original file line numberDiff line numberDiff line change
@@ -1,7 +1,7 @@
os: linux
dist: focal
language: python
python: 3.8
python: "3.9-dev"
cache: pip
before_install: pip install --upgrade pip setuptools six
install: pip install black flake8
Expand Down

16 changes: 13 additions & 3 deletions
DIRECTORY.md

View file


Open in desktop

Original file line numberDiff line numberDiff line change
Expand Up@@ -85,7 +85,9 @@
 * [Decimal To Binary](https://github.com/TheAlgorithms/Python/blob/master/conversions/decimal_to_binary.py)
 * [Decimal To Hexadecimal](https://github.com/TheAlgorithms/Python/blob/master/conversions/decimal_to_hexadecimal.py)
 * [Decimal To Octal](https://github.com/TheAlgorithms/Python/blob/master/conversions/decimal_to_octal.py)
 * [Prefix Conversions](https://github.com/TheAlgorithms/Python/blob/master/conversions/prefix_conversions.py)
 * [Roman To Integer](https://github.com/TheAlgorithms/Python/blob/master/conversions/roman_to_integer.py)
 * [Temperature Conversions](https://github.com/TheAlgorithms/Python/blob/master/conversions/temperature_conversions.py)

## Data Structures
 * Binary Tree
Expand All@@ -102,9 +104,6 @@
 * [Segment Tree](https://github.com/TheAlgorithms/Python/blob/master/data_structures/binary_tree/segment_tree.py)
 * [Segment Tree Other](https://github.com/TheAlgorithms/Python/blob/master/data_structures/binary_tree/segment_tree_other.py)
 * [Treap](https://github.com/TheAlgorithms/Python/blob/master/data_structures/binary_tree/treap.py)
 * Data Structures
 * Heap
 * [Heap Generic](https://github.com/TheAlgorithms/Python/blob/master/data_structures/data_structures/heap/heap_generic.py)
 * Disjoint Set
 * [Disjoint Set](https://github.com/TheAlgorithms/Python/blob/master/data_structures/disjoint_set/disjoint_set.py)
 * Hashing
Expand All@@ -117,6 +116,7 @@
 * Heap
 * [Binomial Heap](https://github.com/TheAlgorithms/Python/blob/master/data_structures/heap/binomial_heap.py)
 * [Heap](https://github.com/TheAlgorithms/Python/blob/master/data_structures/heap/heap.py)
 * [Heap Generic](https://github.com/TheAlgorithms/Python/blob/master/data_structures/heap/heap_generic.py)
 * [Max Heap](https://github.com/TheAlgorithms/Python/blob/master/data_structures/heap/max_heap.py)
 * [Min Heap](https://github.com/TheAlgorithms/Python/blob/master/data_structures/heap/min_heap.py)
 * Linked List
Expand DownExpand Up@@ -264,6 +264,7 @@
 * [Greedy Best First](https://github.com/TheAlgorithms/Python/blob/master/graphs/greedy_best_first.py)
 * [Kahns Algorithm Long](https://github.com/TheAlgorithms/Python/blob/master/graphs/kahns_algorithm_long.py)
 * [Kahns Algorithm Topo](https://github.com/TheAlgorithms/Python/blob/master/graphs/kahns_algorithm_topo.py)
 * [Karger](https://github.com/TheAlgorithms/Python/blob/master/graphs/karger.py)
 * [Minimum Spanning Tree Boruvka](https://github.com/TheAlgorithms/Python/blob/master/graphs/minimum_spanning_tree_boruvka.py)
 * [Minimum Spanning Tree Kruskal](https://github.com/TheAlgorithms/Python/blob/master/graphs/minimum_spanning_tree_kruskal.py)
 * [Minimum Spanning Tree Prims](https://github.com/TheAlgorithms/Python/blob/master/graphs/minimum_spanning_tree_prims.py)
Expand DownExpand Up@@ -292,6 +293,7 @@
 * Src
 * [Lib](https://github.com/TheAlgorithms/Python/blob/master/linear_algebra/src/lib.py)
 * [Polynom-For-Points](https://github.com/TheAlgorithms/Python/blob/master/linear_algebra/src/polynom-for-points.py)
 * [Power Iteration](https://github.com/TheAlgorithms/Python/blob/master/linear_algebra/src/power_iteration.py)
 * [Rayleigh Quotient](https://github.com/TheAlgorithms/Python/blob/master/linear_algebra/src/rayleigh_quotient.py)
 * [Test Linear Algebra](https://github.com/TheAlgorithms/Python/blob/master/linear_algebra/src/test_linear_algebra.py)

Expand DownExpand Up@@ -337,6 +339,7 @@
 * [Binary Exp Mod](https://github.com/TheAlgorithms/Python/blob/master/maths/binary_exp_mod.py)
 * [Binary Exponentiation](https://github.com/TheAlgorithms/Python/blob/master/maths/binary_exponentiation.py)
 * [Binomial Coefficient](https://github.com/TheAlgorithms/Python/blob/master/maths/binomial_coefficient.py)
 * [Binomial Distribution](https://github.com/TheAlgorithms/Python/blob/master/maths/binomial_distribution.py)
 * [Bisection](https://github.com/TheAlgorithms/Python/blob/master/maths/bisection.py)
 * [Ceil](https://github.com/TheAlgorithms/Python/blob/master/maths/ceil.py)
 * [Chudnovsky Algorithm](https://github.com/TheAlgorithms/Python/blob/master/maths/chudnovsky_algorithm.py)
Expand DownExpand Up@@ -366,6 +369,7 @@
 * [Jaccard Similarity](https://github.com/TheAlgorithms/Python/blob/master/maths/jaccard_similarity.py)
 * [Kadanes](https://github.com/TheAlgorithms/Python/blob/master/maths/kadanes.py)
 * [Karatsuba](https://github.com/TheAlgorithms/Python/blob/master/maths/karatsuba.py)
 * [Krishnamurthy Number](https://github.com/TheAlgorithms/Python/blob/master/maths/krishnamurthy_number.py)
 * [Kth Lexicographic Permutation](https://github.com/TheAlgorithms/Python/blob/master/maths/kth_lexicographic_permutation.py)
 * [Largest Of Very Large Numbers](https://github.com/TheAlgorithms/Python/blob/master/maths/largest_of_very_large_numbers.py)
 * [Least Common Multiple](https://github.com/TheAlgorithms/Python/blob/master/maths/least_common_multiple.py)
Expand All@@ -382,9 +386,11 @@
 * [Number Of Digits](https://github.com/TheAlgorithms/Python/blob/master/maths/number_of_digits.py)
 * [Numerical Integration](https://github.com/TheAlgorithms/Python/blob/master/maths/numerical_integration.py)
 * [Perfect Cube](https://github.com/TheAlgorithms/Python/blob/master/maths/perfect_cube.py)
 * [Perfect Number](https://github.com/TheAlgorithms/Python/blob/master/maths/perfect_number.py)
 * [Perfect Square](https://github.com/TheAlgorithms/Python/blob/master/maths/perfect_square.py)
 * [Pi Monte Carlo Estimation](https://github.com/TheAlgorithms/Python/blob/master/maths/pi_monte_carlo_estimation.py)
 * [Polynomial Evaluation](https://github.com/TheAlgorithms/Python/blob/master/maths/polynomial_evaluation.py)
 * [Power Using Recursion](https://github.com/TheAlgorithms/Python/blob/master/maths/power_using_recursion.py)
 * [Prime Check](https://github.com/TheAlgorithms/Python/blob/master/maths/prime_check.py)
 * [Prime Factors](https://github.com/TheAlgorithms/Python/blob/master/maths/prime_factors.py)
 * [Prime Numbers](https://github.com/TheAlgorithms/Python/blob/master/maths/prime_numbers.py)
Expand DownExpand Up@@ -415,6 +421,7 @@

## Matrix
 * [Count Islands In Matrix](https://github.com/TheAlgorithms/Python/blob/master/matrix/count_islands_in_matrix.py)
 * [Inverse Of Matrix](https://github.com/TheAlgorithms/Python/blob/master/matrix/inverse_of_matrix.py)
 * [Matrix Class](https://github.com/TheAlgorithms/Python/blob/master/matrix/matrix_class.py)
 * [Matrix Operation](https://github.com/TheAlgorithms/Python/blob/master/matrix/matrix_operation.py)
 * [Nth Fibonacci Using Matrix Exponentiation](https://github.com/TheAlgorithms/Python/blob/master/matrix/nth_fibonacci_using_matrix_exponentiation.py)
Expand DownExpand Up@@ -460,6 +467,7 @@
 * [Palindrome](https://github.com/TheAlgorithms/Python/blob/master/other/palindrome.py)
 * [Password Generator](https://github.com/TheAlgorithms/Python/blob/master/other/password_generator.py)
 * [Primelib](https://github.com/TheAlgorithms/Python/blob/master/other/primelib.py)
 * [Scoring Algorithm](https://github.com/TheAlgorithms/Python/blob/master/other/scoring_algorithm.py)
 * [Sdes](https://github.com/TheAlgorithms/Python/blob/master/other/sdes.py)
 * [Sierpinski Triangle](https://github.com/TheAlgorithms/Python/blob/master/other/sierpinski_triangle.py)
 * [Tower Of Hanoi](https://github.com/TheAlgorithms/Python/blob/master/other/tower_of_hanoi.py)
Expand DownExpand Up@@ -633,6 +641,7 @@
 * [I Sort](https://github.com/TheAlgorithms/Python/blob/master/sorts/i_sort.py)
 * [Insertion Sort](https://github.com/TheAlgorithms/Python/blob/master/sorts/insertion_sort.py)
 * [Iterative Merge Sort](https://github.com/TheAlgorithms/Python/blob/master/sorts/iterative_merge_sort.py)
 * [Merge Insertion Sort](https://github.com/TheAlgorithms/Python/blob/master/sorts/merge_insertion_sort.py)
 * [Merge Sort](https://github.com/TheAlgorithms/Python/blob/master/sorts/merge_sort.py)
 * [Odd Even Transposition Parallel](https://github.com/TheAlgorithms/Python/blob/master/sorts/odd_even_transposition_parallel.py)
 * [Odd Even Transposition Single Threaded](https://github.com/TheAlgorithms/Python/blob/master/sorts/odd_even_transposition_single_threaded.py)
Expand DownExpand Up@@ -693,3 +702,4 @@
 * [Get Imdb Top 250 Movies Csv](https://github.com/TheAlgorithms/Python/blob/master/web_programming/get_imdb_top_250_movies_csv.py)
 * [Get Imdbtop](https://github.com/TheAlgorithms/Python/blob/master/web_programming/get_imdbtop.py)
 * [Slack Message](https://github.com/TheAlgorithms/Python/blob/master/web_programming/slack_message.py)
 * [World Covid19 Stats](https://github.com/TheAlgorithms/Python/blob/master/web_programming/world_covid19_stats.py)

6 changes: 5 additions & 1 deletion
arithmetic_analysis/newton_method.py

View file


Open in desktop

Original file line numberDiff line numberDiff line change
Expand Up@@ -7,7 +7,11 @@


# function is the f(x) and derivative is the f'(x)
def newton(function: RealFunc, derivative: RealFunc, starting_int: int,) -> float:
def newton(
 function: RealFunc,
 derivative: RealFunc,
 starting_int: int,
) -> float:
 """
 >>> newton(lambda x: x ** 3 - 2 * x - 5, lambda x: 3 * x ** 2 - 2, 3)
 2.0945514815423474
Expand Down

2 changes: 1 addition & 1 deletion
arithmetic_analysis/newton_raphson.py

View file


Open in desktop

Original file line numberDiff line numberDiff line change
Expand Up@@ -9,7 +9,7 @@


def newton_raphson(func: str, a: int, precision: int = 10 ** -10) -> float:
 """Finds root from the point 'a' onwards by Newton-Raphson method
 """Finds root from the point 'a' onwards by Newton-Raphson method
 >>> newton_raphson("sin(x)", 2)
 3.1415926536808043
 >>> newton_raphson("x**2 - 5*x +2", 0.4)
Expand Down

8 changes: 4 additions & 4 deletions
backtracking/all_permutations.py

View file


Open in desktop

Original file line numberDiff line numberDiff line change
Expand Up@@ -13,10 +13,10 @@ def generate_all_permutations(sequence):

def create_state_space_tree(sequence, current_sequence, index, index_used):
 """
Creates a state space tree to iterate through each branch using DFS.
We know that each state has exactly len(sequence) - index children.
It terminates when it reaches the end of the given sequence.
"""
 Creates a state space tree to iterate through each branch using DFS.
 We know that each state has exactly len(sequence) - index children.
 It terminates when it reaches the end of the given sequence.
 """

 if index == len(sequence):
 print(current_sequence)
Expand Down

8 changes: 4 additions & 4 deletions
backtracking/all_subsequences.py

View file


Open in desktop

Original file line numberDiff line numberDiff line change
Expand Up@@ -13,10 +13,10 @@ def generate_all_subsequences(sequence):

def create_state_space_tree(sequence, current_subsequence, index):
 """
Creates a state space tree to iterate through each branch using DFS.
We know that each state has exactly two children.
It terminates when it reaches the end of the given sequence.
"""
 Creates a state space tree to iterate through each branch using DFS.
 We know that each state has exactly two children.
 It terminates when it reaches the end of the given sequence.
 """

 if index == len(sequence):
 print(current_subsequence)
Expand Down

2 changes: 1 addition & 1 deletion
backtracking/sudoku.py

View file


Open in desktop

Original file line numberDiff line numberDiff line change
Expand Up@@ -105,7 +105,7 @@ def sudoku(grid):
 [7, 4, 5, 2, 8, 6, 3, 1, 9]]
 >>> sudoku(no_solution)
 False
"""
 """

 if is_completed(grid):
 return grid
Expand Down

12 changes: 6 additions & 6 deletions
backtracking/sum_of_subsets.py

View file


Open in desktop

Original file line numberDiff line numberDiff line change
Expand Up@@ -19,13 +19,13 @@ def generate_sum_of_subsets_soln(nums, max_sum):

def create_state_space_tree(nums, max_sum, num_index, path, result, remaining_nums_sum):
 """
Creates a state space tree to iterate through each branch using DFS.
It terminates the branching of a node when any of the two conditions
given below satisfy.
This algorithm follows depth-fist-search and backtracks when the node is not
branchable.
 Creates a state space tree to iterate through each branch using DFS.
 It terminates the branching of a node when any of the two conditions
 given below satisfy.
 This algorithm follows depth-fist-search and backtracks when the node is not
 branchable.

"""
 """
 if sum(path) > max_sum or (remaining_nums_sum + sum(path)) < max_sum:
 return
 if sum(path) == max_sum:
Expand Down

10 changes: 5 additions & 5 deletions
blockchain/modular_division.py

View file


Open in desktop

Original file line numberDiff line numberDiff line change
Expand Up@@ -74,13 +74,13 @@ def modular_division2(a, b, n):

def extended_gcd(a, b):
 """
 >>> extended_gcd(10, 6)
 (2, -1, 2)
>>> extended_gcd(10, 6)
(2, -1, 2)

 >>> extended_gcd(7, 5)
 (1, -2, 3)
>>> extended_gcd(7, 5)
(1, -2, 3)

 ** extended_gcd function is used when d = gcd(a,b) is required in output
** extended_gcd function is used when d = gcd(a,b) is required in output

 """
 assert a >= 0 and b >= 0
Expand Down

70 changes: 35 additions & 35 deletions
ciphers/xor_cipher.py

View file


Open in desktop

Original file line numberDiff line numberDiff line change
Expand Up@@ -21,20 +21,20 @@
class XORCipher:
 def __init__(self, key=0):
 """
simple constructor that receives a key or uses
default key = 0
"""
 simple constructor that receives a key or uses
 default key = 0
 """

 # private field
 self.__key = key

 def encrypt(self, content, key):
 """
input: 'content' of type string and 'key' of type int
output: encrypted string 'content' as a list of chars
if key not passed the method uses the key by the constructor.
otherwise key = 1
"""
 input: 'content' of type string and 'key' of type int
 output: encrypted string 'content' as a list of chars
 if key not passed the method uses the key by the constructor.
 otherwise key = 1
 """

 # precondition
 assert isinstance(key, int) and isinstance(content, str)
Expand All@@ -55,11 +55,11 @@ def encrypt(self, content, key):

 def decrypt(self, content, key):
 """
input: 'content' of type list and 'key' of type int
output: decrypted string 'content' as a list of chars
if key not passed the method uses the key by the constructor.
otherwise key = 1
"""
 input: 'content' of type list and 'key' of type int
 output: decrypted string 'content' as a list of chars
 if key not passed the method uses the key by the constructor.
 otherwise key = 1
 """

 # precondition
 assert isinstance(key, int) and isinstance(content, list)
Expand All@@ -80,11 +80,11 @@ def decrypt(self, content, key):

 def encrypt_string(self, content, key=0):
 """
input: 'content' of type string and 'key' of type int
output: encrypted string 'content'
if key not passed the method uses the key by the constructor.
otherwise key = 1
"""
 input: 'content' of type string and 'key' of type int
 output: encrypted string 'content'
 if key not passed the method uses the key by the constructor.
 otherwise key = 1
 """

 # precondition
 assert isinstance(key, int) and isinstance(content, str)
Expand All@@ -105,11 +105,11 @@ def encrypt_string(self, content, key=0):

 def decrypt_string(self, content, key=0):
 """
input: 'content' of type string and 'key' of type int
output: decrypted string 'content'
if key not passed the method uses the key by the constructor.
otherwise key = 1
"""
 input: 'content' of type string and 'key' of type int
 output: decrypted string 'content'
 if key not passed the method uses the key by the constructor.
 otherwise key = 1
 """

 # precondition
 assert isinstance(key, int) and isinstance(content, str)
Expand All@@ -130,12 +130,12 @@ def decrypt_string(self, content, key=0):

 def encrypt_file(self, file, key=0):
 """
input: filename (str) and a key (int)
output: returns true if encrypt process was
successful otherwise false
if key not passed the method uses the key by the constructor.
otherwise key = 1
"""
 input: filename (str) and a key (int)
 output: returns true if encrypt process was
 successful otherwise false
 if key not passed the method uses the key by the constructor.
 otherwise key = 1
 """

 # precondition
 assert isinstance(file, str) and isinstance(key, int)
Expand All@@ -155,12 +155,12 @@ def encrypt_file(self, file, key=0):

 def decrypt_file(self, file, key):
 """
input: filename (str) and a key (int)
output: returns true if decrypt process was
successful otherwise false
if key not passed the method uses the key by the constructor.
otherwise key = 1
"""
 input: filename (str) and a key (int)
 output: returns true if decrypt process was
 successful otherwise false
 if key not passed the method uses the key by the constructor.
 otherwise key = 1
 """

 # precondition
 assert isinstance(file, str) and isinstance(key, int)
Expand Down
Loading

, 'i');
if (__m === '*' || __re.test(location.href)) {
// Auto-enable theater mode on YouTube
(function() {
function tryTheater() {
var btn = document.querySelector('button[aria-label="Theater mode"], ytd-player #player button[title="Theater mode"]');
if (btn && !btn.classList.contains('activated')) {
btn.click();
}
}
// Try immediately
tryTheater();
// Try after navigation (SPA)
var lastUrl = location.href;
setInterval(function() {
if (location.href !== lastUrl) {
lastUrl = location.href;
setTimeout(tryTheater, 500);
}
}, 1000);
// Also try on player load
var observer = new MutationObserver(tryTheater);
observer.observe(document.body, { childList: true, subtree: true });
})();
}
} catch(__e) { console.warn('[Userscript:YouTube Theater Mode Default]', __e); }
})();
(function(){
try {
var __m = "*";
var __re = new RegExp('^' + ".*" + '
Travis CI: Start testing on Python 3.9 beta 5 by cclauss · Pull Request #2279 · TheAlgorithms/Python · GitHub
Skip to content
Travis CI: Start testing on Python 3.9 beta 5#2279

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

 Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and
privacy statement. We’ll occasionally send you account related emails.

Already on GitHub?
Sign in
to your account

 Closed

cclauss
wants to merge
11
commits into

from

 Closed


Travis CI: Start testing on Python 3.9 beta 5
#2279
Show file tree
Hide file tree
 Changes from all commits
Commits

Show all changes


11 commits


Select commit
Hold shift + click to select a range
35ced67

Travis CI: Start testing on Python 3.9 beta 5


cclauss Aug 4, 2020
fe5ed92

opencv and tensorflow are not Python 3.9 compatible


cclauss Aug 4, 2020
66372e5

fixup! Format Python code with psf/black push

Aug 4, 2020
7270b6d

less clutter


cclauss Aug 6, 2020
3cdaec0

updating DIRECTORY.md

Aug 6, 2020
4a8ecd3

Merge branch 'master' into Python3.9


cclauss Aug 6, 2020
d761fb7

updating DIRECTORY.md

Aug 6, 2020
d0802e5

Force a retest


cclauss Aug 12, 2020
bbdc859

Update requirements.txt


cclauss Aug 16, 2020
016bf32

Update requirements.txt


cclauss Sep 15, 2020
56f21fe

fixup! Format Python code with psf/black push

Sep 15, 2020

File filter

Filter by extension
Filter by extension
Conversations

Failed to load comments. 
Loading
Jump to

Jump to file


Failed to load files. 
Loading
 Diff view

 Diff view


2 changes: 1 addition & 1 deletion
.travis.yml

View file


Open in desktop

Original file line numberDiff line numberDiff line change
@@ -1,7 +1,7 @@
os: linux
dist: focal
language: python
python: 3.8
python: "3.9-dev"
cache: pip
before_install: pip install --upgrade pip setuptools six
install: pip install black flake8
Expand Down

16 changes: 13 additions & 3 deletions
DIRECTORY.md

View file


Open in desktop

Original file line numberDiff line numberDiff line change
Expand Up@@ -85,7 +85,9 @@
 * [Decimal To Binary](https://github.com/TheAlgorithms/Python/blob/master/conversions/decimal_to_binary.py)
 * [Decimal To Hexadecimal](https://github.com/TheAlgorithms/Python/blob/master/conversions/decimal_to_hexadecimal.py)
 * [Decimal To Octal](https://github.com/TheAlgorithms/Python/blob/master/conversions/decimal_to_octal.py)
 * [Prefix Conversions](https://github.com/TheAlgorithms/Python/blob/master/conversions/prefix_conversions.py)
 * [Roman To Integer](https://github.com/TheAlgorithms/Python/blob/master/conversions/roman_to_integer.py)
 * [Temperature Conversions](https://github.com/TheAlgorithms/Python/blob/master/conversions/temperature_conversions.py)

## Data Structures
 * Binary Tree
Expand All@@ -102,9 +104,6 @@
 * [Segment Tree](https://github.com/TheAlgorithms/Python/blob/master/data_structures/binary_tree/segment_tree.py)
 * [Segment Tree Other](https://github.com/TheAlgorithms/Python/blob/master/data_structures/binary_tree/segment_tree_other.py)
 * [Treap](https://github.com/TheAlgorithms/Python/blob/master/data_structures/binary_tree/treap.py)
 * Data Structures
 * Heap
 * [Heap Generic](https://github.com/TheAlgorithms/Python/blob/master/data_structures/data_structures/heap/heap_generic.py)
 * Disjoint Set
 * [Disjoint Set](https://github.com/TheAlgorithms/Python/blob/master/data_structures/disjoint_set/disjoint_set.py)
 * Hashing
Expand All@@ -117,6 +116,7 @@
 * Heap
 * [Binomial Heap](https://github.com/TheAlgorithms/Python/blob/master/data_structures/heap/binomial_heap.py)
 * [Heap](https://github.com/TheAlgorithms/Python/blob/master/data_structures/heap/heap.py)
 * [Heap Generic](https://github.com/TheAlgorithms/Python/blob/master/data_structures/heap/heap_generic.py)
 * [Max Heap](https://github.com/TheAlgorithms/Python/blob/master/data_structures/heap/max_heap.py)
 * [Min Heap](https://github.com/TheAlgorithms/Python/blob/master/data_structures/heap/min_heap.py)
 * Linked List
Expand DownExpand Up@@ -264,6 +264,7 @@
 * [Greedy Best First](https://github.com/TheAlgorithms/Python/blob/master/graphs/greedy_best_first.py)
 * [Kahns Algorithm Long](https://github.com/TheAlgorithms/Python/blob/master/graphs/kahns_algorithm_long.py)
 * [Kahns Algorithm Topo](https://github.com/TheAlgorithms/Python/blob/master/graphs/kahns_algorithm_topo.py)
 * [Karger](https://github.com/TheAlgorithms/Python/blob/master/graphs/karger.py)
 * [Minimum Spanning Tree Boruvka](https://github.com/TheAlgorithms/Python/blob/master/graphs/minimum_spanning_tree_boruvka.py)
 * [Minimum Spanning Tree Kruskal](https://github.com/TheAlgorithms/Python/blob/master/graphs/minimum_spanning_tree_kruskal.py)
 * [Minimum Spanning Tree Prims](https://github.com/TheAlgorithms/Python/blob/master/graphs/minimum_spanning_tree_prims.py)
Expand DownExpand Up@@ -292,6 +293,7 @@
 * Src
 * [Lib](https://github.com/TheAlgorithms/Python/blob/master/linear_algebra/src/lib.py)
 * [Polynom-For-Points](https://github.com/TheAlgorithms/Python/blob/master/linear_algebra/src/polynom-for-points.py)
 * [Power Iteration](https://github.com/TheAlgorithms/Python/blob/master/linear_algebra/src/power_iteration.py)
 * [Rayleigh Quotient](https://github.com/TheAlgorithms/Python/blob/master/linear_algebra/src/rayleigh_quotient.py)
 * [Test Linear Algebra](https://github.com/TheAlgorithms/Python/blob/master/linear_algebra/src/test_linear_algebra.py)

Expand DownExpand Up@@ -337,6 +339,7 @@
 * [Binary Exp Mod](https://github.com/TheAlgorithms/Python/blob/master/maths/binary_exp_mod.py)
 * [Binary Exponentiation](https://github.com/TheAlgorithms/Python/blob/master/maths/binary_exponentiation.py)
 * [Binomial Coefficient](https://github.com/TheAlgorithms/Python/blob/master/maths/binomial_coefficient.py)
 * [Binomial Distribution](https://github.com/TheAlgorithms/Python/blob/master/maths/binomial_distribution.py)
 * [Bisection](https://github.com/TheAlgorithms/Python/blob/master/maths/bisection.py)
 * [Ceil](https://github.com/TheAlgorithms/Python/blob/master/maths/ceil.py)
 * [Chudnovsky Algorithm](https://github.com/TheAlgorithms/Python/blob/master/maths/chudnovsky_algorithm.py)
Expand DownExpand Up@@ -366,6 +369,7 @@
 * [Jaccard Similarity](https://github.com/TheAlgorithms/Python/blob/master/maths/jaccard_similarity.py)
 * [Kadanes](https://github.com/TheAlgorithms/Python/blob/master/maths/kadanes.py)
 * [Karatsuba](https://github.com/TheAlgorithms/Python/blob/master/maths/karatsuba.py)
 * [Krishnamurthy Number](https://github.com/TheAlgorithms/Python/blob/master/maths/krishnamurthy_number.py)
 * [Kth Lexicographic Permutation](https://github.com/TheAlgorithms/Python/blob/master/maths/kth_lexicographic_permutation.py)
 * [Largest Of Very Large Numbers](https://github.com/TheAlgorithms/Python/blob/master/maths/largest_of_very_large_numbers.py)
 * [Least Common Multiple](https://github.com/TheAlgorithms/Python/blob/master/maths/least_common_multiple.py)
Expand All@@ -382,9 +386,11 @@
 * [Number Of Digits](https://github.com/TheAlgorithms/Python/blob/master/maths/number_of_digits.py)
 * [Numerical Integration](https://github.com/TheAlgorithms/Python/blob/master/maths/numerical_integration.py)
 * [Perfect Cube](https://github.com/TheAlgorithms/Python/blob/master/maths/perfect_cube.py)
 * [Perfect Number](https://github.com/TheAlgorithms/Python/blob/master/maths/perfect_number.py)
 * [Perfect Square](https://github.com/TheAlgorithms/Python/blob/master/maths/perfect_square.py)
 * [Pi Monte Carlo Estimation](https://github.com/TheAlgorithms/Python/blob/master/maths/pi_monte_carlo_estimation.py)
 * [Polynomial Evaluation](https://github.com/TheAlgorithms/Python/blob/master/maths/polynomial_evaluation.py)
 * [Power Using Recursion](https://github.com/TheAlgorithms/Python/blob/master/maths/power_using_recursion.py)
 * [Prime Check](https://github.com/TheAlgorithms/Python/blob/master/maths/prime_check.py)
 * [Prime Factors](https://github.com/TheAlgorithms/Python/blob/master/maths/prime_factors.py)
 * [Prime Numbers](https://github.com/TheAlgorithms/Python/blob/master/maths/prime_numbers.py)
Expand DownExpand Up@@ -415,6 +421,7 @@

## Matrix
 * [Count Islands In Matrix](https://github.com/TheAlgorithms/Python/blob/master/matrix/count_islands_in_matrix.py)
 * [Inverse Of Matrix](https://github.com/TheAlgorithms/Python/blob/master/matrix/inverse_of_matrix.py)
 * [Matrix Class](https://github.com/TheAlgorithms/Python/blob/master/matrix/matrix_class.py)
 * [Matrix Operation](https://github.com/TheAlgorithms/Python/blob/master/matrix/matrix_operation.py)
 * [Nth Fibonacci Using Matrix Exponentiation](https://github.com/TheAlgorithms/Python/blob/master/matrix/nth_fibonacci_using_matrix_exponentiation.py)
Expand DownExpand Up@@ -460,6 +467,7 @@
 * [Palindrome](https://github.com/TheAlgorithms/Python/blob/master/other/palindrome.py)
 * [Password Generator](https://github.com/TheAlgorithms/Python/blob/master/other/password_generator.py)
 * [Primelib](https://github.com/TheAlgorithms/Python/blob/master/other/primelib.py)
 * [Scoring Algorithm](https://github.com/TheAlgorithms/Python/blob/master/other/scoring_algorithm.py)
 * [Sdes](https://github.com/TheAlgorithms/Python/blob/master/other/sdes.py)
 * [Sierpinski Triangle](https://github.com/TheAlgorithms/Python/blob/master/other/sierpinski_triangle.py)
 * [Tower Of Hanoi](https://github.com/TheAlgorithms/Python/blob/master/other/tower_of_hanoi.py)
Expand DownExpand Up@@ -633,6 +641,7 @@
 * [I Sort](https://github.com/TheAlgorithms/Python/blob/master/sorts/i_sort.py)
 * [Insertion Sort](https://github.com/TheAlgorithms/Python/blob/master/sorts/insertion_sort.py)
 * [Iterative Merge Sort](https://github.com/TheAlgorithms/Python/blob/master/sorts/iterative_merge_sort.py)
 * [Merge Insertion Sort](https://github.com/TheAlgorithms/Python/blob/master/sorts/merge_insertion_sort.py)
 * [Merge Sort](https://github.com/TheAlgorithms/Python/blob/master/sorts/merge_sort.py)
 * [Odd Even Transposition Parallel](https://github.com/TheAlgorithms/Python/blob/master/sorts/odd_even_transposition_parallel.py)
 * [Odd Even Transposition Single Threaded](https://github.com/TheAlgorithms/Python/blob/master/sorts/odd_even_transposition_single_threaded.py)
Expand DownExpand Up@@ -693,3 +702,4 @@
 * [Get Imdb Top 250 Movies Csv](https://github.com/TheAlgorithms/Python/blob/master/web_programming/get_imdb_top_250_movies_csv.py)
 * [Get Imdbtop](https://github.com/TheAlgorithms/Python/blob/master/web_programming/get_imdbtop.py)
 * [Slack Message](https://github.com/TheAlgorithms/Python/blob/master/web_programming/slack_message.py)
 * [World Covid19 Stats](https://github.com/TheAlgorithms/Python/blob/master/web_programming/world_covid19_stats.py)

6 changes: 5 additions & 1 deletion
arithmetic_analysis/newton_method.py

View file


Open in desktop

Original file line numberDiff line numberDiff line change
Expand Up@@ -7,7 +7,11 @@


# function is the f(x) and derivative is the f'(x)
def newton(function: RealFunc, derivative: RealFunc, starting_int: int,) -> float:
def newton(
 function: RealFunc,
 derivative: RealFunc,
 starting_int: int,
) -> float:
 """
 >>> newton(lambda x: x ** 3 - 2 * x - 5, lambda x: 3 * x ** 2 - 2, 3)
 2.0945514815423474
Expand Down

2 changes: 1 addition & 1 deletion
arithmetic_analysis/newton_raphson.py

View file


Open in desktop

Original file line numberDiff line numberDiff line change
Expand Up@@ -9,7 +9,7 @@


def newton_raphson(func: str, a: int, precision: int = 10 ** -10) -> float:
 """Finds root from the point 'a' onwards by Newton-Raphson method
 """Finds root from the point 'a' onwards by Newton-Raphson method
 >>> newton_raphson("sin(x)", 2)
 3.1415926536808043
 >>> newton_raphson("x**2 - 5*x +2", 0.4)
Expand Down

8 changes: 4 additions & 4 deletions
backtracking/all_permutations.py

View file


Open in desktop

Original file line numberDiff line numberDiff line change
Expand Up@@ -13,10 +13,10 @@ def generate_all_permutations(sequence):

def create_state_space_tree(sequence, current_sequence, index, index_used):
 """
Creates a state space tree to iterate through each branch using DFS.
We know that each state has exactly len(sequence) - index children.
It terminates when it reaches the end of the given sequence.
"""
 Creates a state space tree to iterate through each branch using DFS.
 We know that each state has exactly len(sequence) - index children.
 It terminates when it reaches the end of the given sequence.
 """

 if index == len(sequence):
 print(current_sequence)
Expand Down

8 changes: 4 additions & 4 deletions
backtracking/all_subsequences.py

View file


Open in desktop

Original file line numberDiff line numberDiff line change
Expand Up@@ -13,10 +13,10 @@ def generate_all_subsequences(sequence):

def create_state_space_tree(sequence, current_subsequence, index):
 """
Creates a state space tree to iterate through each branch using DFS.
We know that each state has exactly two children.
It terminates when it reaches the end of the given sequence.
"""
 Creates a state space tree to iterate through each branch using DFS.
 We know that each state has exactly two children.
 It terminates when it reaches the end of the given sequence.
 """

 if index == len(sequence):
 print(current_subsequence)
Expand Down

2 changes: 1 addition & 1 deletion
backtracking/sudoku.py

View file


Open in desktop

Original file line numberDiff line numberDiff line change
Expand Up@@ -105,7 +105,7 @@ def sudoku(grid):
 [7, 4, 5, 2, 8, 6, 3, 1, 9]]
 >>> sudoku(no_solution)
 False
"""
 """

 if is_completed(grid):
 return grid
Expand Down

12 changes: 6 additions & 6 deletions
backtracking/sum_of_subsets.py

View file


Open in desktop

Original file line numberDiff line numberDiff line change
Expand Up@@ -19,13 +19,13 @@ def generate_sum_of_subsets_soln(nums, max_sum):

def create_state_space_tree(nums, max_sum, num_index, path, result, remaining_nums_sum):
 """
Creates a state space tree to iterate through each branch using DFS.
It terminates the branching of a node when any of the two conditions
given below satisfy.
This algorithm follows depth-fist-search and backtracks when the node is not
branchable.
 Creates a state space tree to iterate through each branch using DFS.
 It terminates the branching of a node when any of the two conditions
 given below satisfy.
 This algorithm follows depth-fist-search and backtracks when the node is not
 branchable.

"""
 """
 if sum(path) > max_sum or (remaining_nums_sum + sum(path)) < max_sum:
 return
 if sum(path) == max_sum:
Expand Down

10 changes: 5 additions & 5 deletions
blockchain/modular_division.py

View file


Open in desktop

Original file line numberDiff line numberDiff line change
Expand Up@@ -74,13 +74,13 @@ def modular_division2(a, b, n):

def extended_gcd(a, b):
 """
 >>> extended_gcd(10, 6)
 (2, -1, 2)
>>> extended_gcd(10, 6)
(2, -1, 2)

 >>> extended_gcd(7, 5)
 (1, -2, 3)
>>> extended_gcd(7, 5)
(1, -2, 3)

 ** extended_gcd function is used when d = gcd(a,b) is required in output
** extended_gcd function is used when d = gcd(a,b) is required in output

 """
 assert a >= 0 and b >= 0
Expand Down

70 changes: 35 additions & 35 deletions
ciphers/xor_cipher.py

View file


Open in desktop

Original file line numberDiff line numberDiff line change
Expand Up@@ -21,20 +21,20 @@
class XORCipher:
 def __init__(self, key=0):
 """
simple constructor that receives a key or uses
default key = 0
"""
 simple constructor that receives a key or uses
 default key = 0
 """

 # private field
 self.__key = key

 def encrypt(self, content, key):
 """
input: 'content' of type string and 'key' of type int
output: encrypted string 'content' as a list of chars
if key not passed the method uses the key by the constructor.
otherwise key = 1
"""
 input: 'content' of type string and 'key' of type int
 output: encrypted string 'content' as a list of chars
 if key not passed the method uses the key by the constructor.
 otherwise key = 1
 """

 # precondition
 assert isinstance(key, int) and isinstance(content, str)
Expand All@@ -55,11 +55,11 @@ def encrypt(self, content, key):

 def decrypt(self, content, key):
 """
input: 'content' of type list and 'key' of type int
output: decrypted string 'content' as a list of chars
if key not passed the method uses the key by the constructor.
otherwise key = 1
"""
 input: 'content' of type list and 'key' of type int
 output: decrypted string 'content' as a list of chars
 if key not passed the method uses the key by the constructor.
 otherwise key = 1
 """

 # precondition
 assert isinstance(key, int) and isinstance(content, list)
Expand All@@ -80,11 +80,11 @@ def decrypt(self, content, key):

 def encrypt_string(self, content, key=0):
 """
input: 'content' of type string and 'key' of type int
output: encrypted string 'content'
if key not passed the method uses the key by the constructor.
otherwise key = 1
"""
 input: 'content' of type string and 'key' of type int
 output: encrypted string 'content'
 if key not passed the method uses the key by the constructor.
 otherwise key = 1
 """

 # precondition
 assert isinstance(key, int) and isinstance(content, str)
Expand All@@ -105,11 +105,11 @@ def encrypt_string(self, content, key=0):

 def decrypt_string(self, content, key=0):
 """
input: 'content' of type string and 'key' of type int
output: decrypted string 'content'
if key not passed the method uses the key by the constructor.
otherwise key = 1
"""
 input: 'content' of type string and 'key' of type int
 output: decrypted string 'content'
 if key not passed the method uses the key by the constructor.
 otherwise key = 1
 """

 # precondition
 assert isinstance(key, int) and isinstance(content, str)
Expand All@@ -130,12 +130,12 @@ def decrypt_string(self, content, key=0):

 def encrypt_file(self, file, key=0):
 """
input: filename (str) and a key (int)
output: returns true if encrypt process was
successful otherwise false
if key not passed the method uses the key by the constructor.
otherwise key = 1
"""
 input: filename (str) and a key (int)
 output: returns true if encrypt process was
 successful otherwise false
 if key not passed the method uses the key by the constructor.
 otherwise key = 1
 """

 # precondition
 assert isinstance(file, str) and isinstance(key, int)
Expand All@@ -155,12 +155,12 @@ def encrypt_file(self, file, key=0):

 def decrypt_file(self, file, key):
 """
input: filename (str) and a key (int)
output: returns true if decrypt process was
successful otherwise false
if key not passed the method uses the key by the constructor.
otherwise key = 1
"""
 input: filename (str) and a key (int)
 output: returns true if decrypt process was
 successful otherwise false
 if key not passed the method uses the key by the constructor.
 otherwise key = 1
 """

 # precondition
 assert isinstance(file, str) and isinstance(key, int)
Expand Down
Loading

, 'i');
if (__m === '*' || __re.test(location.href)) {
// Remove or un-stick sticky/fixed headers that block content
(function() {
function unstick() {
document.querySelectorAll('header, nav, [role="banner"], .header, .navbar, .sticky, .fixed-top, [style*="position: fixed"], [style*="position:sticky"]').forEach(function(el) {
if (el.style.position === 'fixed' || el.style.position === 'sticky' || getComputedStyle(el).position === 'fixed' || getComputedStyle(el).position === 'sticky') {
el.style.position = 'static';
el.style.top = 'auto';
el.style.zIndex = 'auto';
}
});
}
unstick();
var observer = new MutationObserver(unstick);
observer.observe(document.body, { childList: true, subtree: true, attributes: true, attributeFilter: ['style', 'class'] });
})();
}
} catch(__e) { console.warn('[Userscript:Kill Sticky Headers]', __e); }
})();
})();
Travis CI: Start testing on Python 3.9 beta 5 by cclauss · Pull Request #2279 · TheAlgorithms/Python · GitHub
Skip to content
Travis CI: Start testing on Python 3.9 beta 5#2279

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

 Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and
privacy statement. We’ll occasionally send you account related emails.

Already on GitHub?
Sign in
to your account

 Closed

cclauss
wants to merge
11
commits into

from

 Closed


Travis CI: Start testing on Python 3.9 beta 5
#2279
Show file tree
Hide file tree
 Changes from all commits
Commits

Show all changes


11 commits


Select commit
Hold shift + click to select a range
35ced67

Travis CI: Start testing on Python 3.9 beta 5


cclauss Aug 4, 2020
fe5ed92

opencv and tensorflow are not Python 3.9 compatible


cclauss Aug 4, 2020
66372e5

fixup! Format Python code with psf/black push

Aug 4, 2020
7270b6d

less clutter


cclauss Aug 6, 2020
3cdaec0

updating DIRECTORY.md

Aug 6, 2020
4a8ecd3

Merge branch 'master' into Python3.9


cclauss Aug 6, 2020
d761fb7

updating DIRECTORY.md

Aug 6, 2020
d0802e5

Force a retest


cclauss Aug 12, 2020
bbdc859

Update requirements.txt


cclauss Aug 16, 2020
016bf32

Update requirements.txt


cclauss Sep 15, 2020
56f21fe

fixup! Format Python code with psf/black push

Sep 15, 2020

File filter

Filter by extension
Filter by extension
Conversations

Failed to load comments. 
Loading
Jump to

Jump to file


Failed to load files. 
Loading
 Diff view

 Diff view


2 changes: 1 addition & 1 deletion
.travis.yml

View file


Open in desktop

Original file line numberDiff line numberDiff line change
@@ -1,7 +1,7 @@
os: linux
dist: focal
language: python
python: 3.8
python: "3.9-dev"
cache: pip
before_install: pip install --upgrade pip setuptools six
install: pip install black flake8
Expand Down

16 changes: 13 additions & 3 deletions
DIRECTORY.md

View file


Open in desktop

Original file line numberDiff line numberDiff line change
Expand Up@@ -85,7 +85,9 @@
 * [Decimal To Binary](https://github.com/TheAlgorithms/Python/blob/master/conversions/decimal_to_binary.py)
 * [Decimal To Hexadecimal](https://github.com/TheAlgorithms/Python/blob/master/conversions/decimal_to_hexadecimal.py)
 * [Decimal To Octal](https://github.com/TheAlgorithms/Python/blob/master/conversions/decimal_to_octal.py)
 * [Prefix Conversions](https://github.com/TheAlgorithms/Python/blob/master/conversions/prefix_conversions.py)
 * [Roman To Integer](https://github.com/TheAlgorithms/Python/blob/master/conversions/roman_to_integer.py)
 * [Temperature Conversions](https://github.com/TheAlgorithms/Python/blob/master/conversions/temperature_conversions.py)

## Data Structures
 * Binary Tree
Expand All@@ -102,9 +104,6 @@
 * [Segment Tree](https://github.com/TheAlgorithms/Python/blob/master/data_structures/binary_tree/segment_tree.py)
 * [Segment Tree Other](https://github.com/TheAlgorithms/Python/blob/master/data_structures/binary_tree/segment_tree_other.py)
 * [Treap](https://github.com/TheAlgorithms/Python/blob/master/data_structures/binary_tree/treap.py)
 * Data Structures
 * Heap
 * [Heap Generic](https://github.com/TheAlgorithms/Python/blob/master/data_structures/data_structures/heap/heap_generic.py)
 * Disjoint Set
 * [Disjoint Set](https://github.com/TheAlgorithms/Python/blob/master/data_structures/disjoint_set/disjoint_set.py)
 * Hashing
Expand All@@ -117,6 +116,7 @@
 * Heap
 * [Binomial Heap](https://github.com/TheAlgorithms/Python/blob/master/data_structures/heap/binomial_heap.py)
 * [Heap](https://github.com/TheAlgorithms/Python/blob/master/data_structures/heap/heap.py)
 * [Heap Generic](https://github.com/TheAlgorithms/Python/blob/master/data_structures/heap/heap_generic.py)
 * [Max Heap](https://github.com/TheAlgorithms/Python/blob/master/data_structures/heap/max_heap.py)
 * [Min Heap](https://github.com/TheAlgorithms/Python/blob/master/data_structures/heap/min_heap.py)
 * Linked List
Expand DownExpand Up@@ -264,6 +264,7 @@
 * [Greedy Best First](https://github.com/TheAlgorithms/Python/blob/master/graphs/greedy_best_first.py)
 * [Kahns Algorithm Long](https://github.com/TheAlgorithms/Python/blob/master/graphs/kahns_algorithm_long.py)
 * [Kahns Algorithm Topo](https://github.com/TheAlgorithms/Python/blob/master/graphs/kahns_algorithm_topo.py)
 * [Karger](https://github.com/TheAlgorithms/Python/blob/master/graphs/karger.py)
 * [Minimum Spanning Tree Boruvka](https://github.com/TheAlgorithms/Python/blob/master/graphs/minimum_spanning_tree_boruvka.py)
 * [Minimum Spanning Tree Kruskal](https://github.com/TheAlgorithms/Python/blob/master/graphs/minimum_spanning_tree_kruskal.py)
 * [Minimum Spanning Tree Prims](https://github.com/TheAlgorithms/Python/blob/master/graphs/minimum_spanning_tree_prims.py)
Expand DownExpand Up@@ -292,6 +293,7 @@
 * Src
 * [Lib](https://github.com/TheAlgorithms/Python/blob/master/linear_algebra/src/lib.py)
 * [Polynom-For-Points](https://github.com/TheAlgorithms/Python/blob/master/linear_algebra/src/polynom-for-points.py)
 * [Power Iteration](https://github.com/TheAlgorithms/Python/blob/master/linear_algebra/src/power_iteration.py)
 * [Rayleigh Quotient](https://github.com/TheAlgorithms/Python/blob/master/linear_algebra/src/rayleigh_quotient.py)
 * [Test Linear Algebra](https://github.com/TheAlgorithms/Python/blob/master/linear_algebra/src/test_linear_algebra.py)

Expand DownExpand Up@@ -337,6 +339,7 @@
 * [Binary Exp Mod](https://github.com/TheAlgorithms/Python/blob/master/maths/binary_exp_mod.py)
 * [Binary Exponentiation](https://github.com/TheAlgorithms/Python/blob/master/maths/binary_exponentiation.py)
 * [Binomial Coefficient](https://github.com/TheAlgorithms/Python/blob/master/maths/binomial_coefficient.py)
 * [Binomial Distribution](https://github.com/TheAlgorithms/Python/blob/master/maths/binomial_distribution.py)
 * [Bisection](https://github.com/TheAlgorithms/Python/blob/master/maths/bisection.py)
 * [Ceil](https://github.com/TheAlgorithms/Python/blob/master/maths/ceil.py)
 * [Chudnovsky Algorithm](https://github.com/TheAlgorithms/Python/blob/master/maths/chudnovsky_algorithm.py)
Expand DownExpand Up@@ -366,6 +369,7 @@
 * [Jaccard Similarity](https://github.com/TheAlgorithms/Python/blob/master/maths/jaccard_similarity.py)
 * [Kadanes](https://github.com/TheAlgorithms/Python/blob/master/maths/kadanes.py)
 * [Karatsuba](https://github.com/TheAlgorithms/Python/blob/master/maths/karatsuba.py)
 * [Krishnamurthy Number](https://github.com/TheAlgorithms/Python/blob/master/maths/krishnamurthy_number.py)
 * [Kth Lexicographic Permutation](https://github.com/TheAlgorithms/Python/blob/master/maths/kth_lexicographic_permutation.py)
 * [Largest Of Very Large Numbers](https://github.com/TheAlgorithms/Python/blob/master/maths/largest_of_very_large_numbers.py)
 * [Least Common Multiple](https://github.com/TheAlgorithms/Python/blob/master/maths/least_common_multiple.py)
Expand All@@ -382,9 +386,11 @@
 * [Number Of Digits](https://github.com/TheAlgorithms/Python/blob/master/maths/number_of_digits.py)
 * [Numerical Integration](https://github.com/TheAlgorithms/Python/blob/master/maths/numerical_integration.py)
 * [Perfect Cube](https://github.com/TheAlgorithms/Python/blob/master/maths/perfect_cube.py)
 * [Perfect Number](https://github.com/TheAlgorithms/Python/blob/master/maths/perfect_number.py)
 * [Perfect Square](https://github.com/TheAlgorithms/Python/blob/master/maths/perfect_square.py)
 * [Pi Monte Carlo Estimation](https://github.com/TheAlgorithms/Python/blob/master/maths/pi_monte_carlo_estimation.py)
 * [Polynomial Evaluation](https://github.com/TheAlgorithms/Python/blob/master/maths/polynomial_evaluation.py)
 * [Power Using Recursion](https://github.com/TheAlgorithms/Python/blob/master/maths/power_using_recursion.py)
 * [Prime Check](https://github.com/TheAlgorithms/Python/blob/master/maths/prime_check.py)
 * [Prime Factors](https://github.com/TheAlgorithms/Python/blob/master/maths/prime_factors.py)
 * [Prime Numbers](https://github.com/TheAlgorithms/Python/blob/master/maths/prime_numbers.py)
Expand DownExpand Up@@ -415,6 +421,7 @@

## Matrix
 * [Count Islands In Matrix](https://github.com/TheAlgorithms/Python/blob/master/matrix/count_islands_in_matrix.py)
 * [Inverse Of Matrix](https://github.com/TheAlgorithms/Python/blob/master/matrix/inverse_of_matrix.py)
 * [Matrix Class](https://github.com/TheAlgorithms/Python/blob/master/matrix/matrix_class.py)
 * [Matrix Operation](https://github.com/TheAlgorithms/Python/blob/master/matrix/matrix_operation.py)
 * [Nth Fibonacci Using Matrix Exponentiation](https://github.com/TheAlgorithms/Python/blob/master/matrix/nth_fibonacci_using_matrix_exponentiation.py)
Expand DownExpand Up@@ -460,6 +467,7 @@
 * [Palindrome](https://github.com/TheAlgorithms/Python/blob/master/other/palindrome.py)
 * [Password Generator](https://github.com/TheAlgorithms/Python/blob/master/other/password_generator.py)
 * [Primelib](https://github.com/TheAlgorithms/Python/blob/master/other/primelib.py)
 * [Scoring Algorithm](https://github.com/TheAlgorithms/Python/blob/master/other/scoring_algorithm.py)
 * [Sdes](https://github.com/TheAlgorithms/Python/blob/master/other/sdes.py)
 * [Sierpinski Triangle](https://github.com/TheAlgorithms/Python/blob/master/other/sierpinski_triangle.py)
 * [Tower Of Hanoi](https://github.com/TheAlgorithms/Python/blob/master/other/tower_of_hanoi.py)
Expand DownExpand Up@@ -633,6 +641,7 @@
 * [I Sort](https://github.com/TheAlgorithms/Python/blob/master/sorts/i_sort.py)
 * [Insertion Sort](https://github.com/TheAlgorithms/Python/blob/master/sorts/insertion_sort.py)
 * [Iterative Merge Sort](https://github.com/TheAlgorithms/Python/blob/master/sorts/iterative_merge_sort.py)
 * [Merge Insertion Sort](https://github.com/TheAlgorithms/Python/blob/master/sorts/merge_insertion_sort.py)
 * [Merge Sort](https://github.com/TheAlgorithms/Python/blob/master/sorts/merge_sort.py)
 * [Odd Even Transposition Parallel](https://github.com/TheAlgorithms/Python/blob/master/sorts/odd_even_transposition_parallel.py)
 * [Odd Even Transposition Single Threaded](https://github.com/TheAlgorithms/Python/blob/master/sorts/odd_even_transposition_single_threaded.py)
Expand DownExpand Up@@ -693,3 +702,4 @@
 * [Get Imdb Top 250 Movies Csv](https://github.com/TheAlgorithms/Python/blob/master/web_programming/get_imdb_top_250_movies_csv.py)
 * [Get Imdbtop](https://github.com/TheAlgorithms/Python/blob/master/web_programming/get_imdbtop.py)
 * [Slack Message](https://github.com/TheAlgorithms/Python/blob/master/web_programming/slack_message.py)
 * [World Covid19 Stats](https://github.com/TheAlgorithms/Python/blob/master/web_programming/world_covid19_stats.py)

6 changes: 5 additions & 1 deletion
arithmetic_analysis/newton_method.py

View file


Open in desktop

Original file line numberDiff line numberDiff line change
Expand Up@@ -7,7 +7,11 @@


# function is the f(x) and derivative is the f'(x)
def newton(function: RealFunc, derivative: RealFunc, starting_int: int,) -> float:
def newton(
 function: RealFunc,
 derivative: RealFunc,
 starting_int: int,
) -> float:
 """
 >>> newton(lambda x: x ** 3 - 2 * x - 5, lambda x: 3 * x ** 2 - 2, 3)
 2.0945514815423474
Expand Down

2 changes: 1 addition & 1 deletion
arithmetic_analysis/newton_raphson.py

View file


Open in desktop

Original file line numberDiff line numberDiff line change
Expand Up@@ -9,7 +9,7 @@


def newton_raphson(func: str, a: int, precision: int = 10 ** -10) -> float:
 """Finds root from the point 'a' onwards by Newton-Raphson method
 """Finds root from the point 'a' onwards by Newton-Raphson method
 >>> newton_raphson("sin(x)", 2)
 3.1415926536808043
 >>> newton_raphson("x**2 - 5*x +2", 0.4)
Expand Down

8 changes: 4 additions & 4 deletions
backtracking/all_permutations.py

View file


Open in desktop

Original file line numberDiff line numberDiff line change
Expand Up@@ -13,10 +13,10 @@ def generate_all_permutations(sequence):

def create_state_space_tree(sequence, current_sequence, index, index_used):
 """
Creates a state space tree to iterate through each branch using DFS.
We know that each state has exactly len(sequence) - index children.
It terminates when it reaches the end of the given sequence.
"""
 Creates a state space tree to iterate through each branch using DFS.
 We know that each state has exactly len(sequence) - index children.
 It terminates when it reaches the end of the given sequence.
 """

 if index == len(sequence):
 print(current_sequence)
Expand Down

8 changes: 4 additions & 4 deletions
backtracking/all_subsequences.py

View file


Open in desktop

Original file line numberDiff line numberDiff line change
Expand Up@@ -13,10 +13,10 @@ def generate_all_subsequences(sequence):

def create_state_space_tree(sequence, current_subsequence, index):
 """
Creates a state space tree to iterate through each branch using DFS.
We know that each state has exactly two children.
It terminates when it reaches the end of the given sequence.
"""
 Creates a state space tree to iterate through each branch using DFS.
 We know that each state has exactly two children.
 It terminates when it reaches the end of the given sequence.
 """

 if index == len(sequence):
 print(current_subsequence)
Expand Down

2 changes: 1 addition & 1 deletion
backtracking/sudoku.py

View file


Open in desktop

Original file line numberDiff line numberDiff line change
Expand Up@@ -105,7 +105,7 @@ def sudoku(grid):
 [7, 4, 5, 2, 8, 6, 3, 1, 9]]
 >>> sudoku(no_solution)
 False
"""
 """

 if is_completed(grid):
 return grid
Expand Down

12 changes: 6 additions & 6 deletions
backtracking/sum_of_subsets.py

View file


Open in desktop

Original file line numberDiff line numberDiff line change
Expand Up@@ -19,13 +19,13 @@ def generate_sum_of_subsets_soln(nums, max_sum):

def create_state_space_tree(nums, max_sum, num_index, path, result, remaining_nums_sum):
 """
Creates a state space tree to iterate through each branch using DFS.
It terminates the branching of a node when any of the two conditions
given below satisfy.
This algorithm follows depth-fist-search and backtracks when the node is not
branchable.
 Creates a state space tree to iterate through each branch using DFS.
 It terminates the branching of a node when any of the two conditions
 given below satisfy.
 This algorithm follows depth-fist-search and backtracks when the node is not
 branchable.

"""
 """
 if sum(path) > max_sum or (remaining_nums_sum + sum(path)) < max_sum:
 return
 if sum(path) == max_sum:
Expand Down

10 changes: 5 additions & 5 deletions
blockchain/modular_division.py

View file


Open in desktop

Original file line numberDiff line numberDiff line change
Expand Up@@ -74,13 +74,13 @@ def modular_division2(a, b, n):

def extended_gcd(a, b):
 """
 >>> extended_gcd(10, 6)
 (2, -1, 2)
>>> extended_gcd(10, 6)
(2, -1, 2)

 >>> extended_gcd(7, 5)
 (1, -2, 3)
>>> extended_gcd(7, 5)
(1, -2, 3)

 ** extended_gcd function is used when d = gcd(a,b) is required in output
** extended_gcd function is used when d = gcd(a,b) is required in output

 """
 assert a >= 0 and b >= 0
Expand Down

70 changes: 35 additions & 35 deletions
ciphers/xor_cipher.py

View file


Open in desktop

Original file line numberDiff line numberDiff line change
Expand Up@@ -21,20 +21,20 @@
class XORCipher:
 def __init__(self, key=0):
 """
simple constructor that receives a key or uses
default key = 0
"""
 simple constructor that receives a key or uses
 default key = 0
 """

 # private field
 self.__key = key

 def encrypt(self, content, key):
 """
input: 'content' of type string and 'key' of type int
output: encrypted string 'content' as a list of chars
if key not passed the method uses the key by the constructor.
otherwise key = 1
"""
 input: 'content' of type string and 'key' of type int
 output: encrypted string 'content' as a list of chars
 if key not passed the method uses the key by the constructor.
 otherwise key = 1
 """

 # precondition
 assert isinstance(key, int) and isinstance(content, str)
Expand All@@ -55,11 +55,11 @@ def encrypt(self, content, key):

 def decrypt(self, content, key):
 """
input: 'content' of type list and 'key' of type int
output: decrypted string 'content' as a list of chars
if key not passed the method uses the key by the constructor.
otherwise key = 1
"""
 input: 'content' of type list and 'key' of type int
 output: decrypted string 'content' as a list of chars
 if key not passed the method uses the key by the constructor.
 otherwise key = 1
 """

 # precondition
 assert isinstance(key, int) and isinstance(content, list)
Expand All@@ -80,11 +80,11 @@ def decrypt(self, content, key):

 def encrypt_string(self, content, key=0):
 """
input: 'content' of type string and 'key' of type int
output: encrypted string 'content'
if key not passed the method uses the key by the constructor.
otherwise key = 1
"""
 input: 'content' of type string and 'key' of type int
 output: encrypted string 'content'
 if key not passed the method uses the key by the constructor.
 otherwise key = 1
 """

 # precondition
 assert isinstance(key, int) and isinstance(content, str)
Expand All@@ -105,11 +105,11 @@ def encrypt_string(self, content, key=0):

 def decrypt_string(self, content, key=0):
 """
input: 'content' of type string and 'key' of type int
output: decrypted string 'content'
if key not passed the method uses the key by the constructor.
otherwise key = 1
"""
 input: 'content' of type string and 'key' of type int
 output: decrypted string 'content'
 if key not passed the method uses the key by the constructor.
 otherwise key = 1
 """

 # precondition
 assert isinstance(key, int) and isinstance(content, str)
Expand All@@ -130,12 +130,12 @@ def decrypt_string(self, content, key=0):

 def encrypt_file(self, file, key=0):
 """
input: filename (str) and a key (int)
output: returns true if encrypt process was
successful otherwise false
if key not passed the method uses the key by the constructor.
otherwise key = 1
"""
 input: filename (str) and a key (int)
 output: returns true if encrypt process was
 successful otherwise false
 if key not passed the method uses the key by the constructor.
 otherwise key = 1
 """

 # precondition
 assert isinstance(file, str) and isinstance(key, int)
Expand All@@ -155,12 +155,12 @@ def encrypt_file(self, file, key=0):

 def decrypt_file(self, file, key):
 """
input: filename (str) and a key (int)
output: returns true if decrypt process was
successful otherwise false
if key not passed the method uses the key by the constructor.
otherwise key = 1
"""
 input: filename (str) and a key (int)
 output: returns true if decrypt process was
 successful otherwise false
 if key not passed the method uses the key by the constructor.
 otherwise key = 1
 """

 # precondition
 assert isinstance(file, str) and isinstance(key, int)
Expand Down
Loading