BST and RSA doctest#8693

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

Merged
tianyizheng02 merged 13 commits into from
Aug 15, 2023
Merged

BST and RSA doctest #8693

Show file tree
Hide file tree
Changes from all commits
Commits
Show all changes
13 commits
Select commit Hold shift + click to select a range
55844f5
rsa key doctest
isidroas Apr 26, 2023
9294347
move doctest to module docstring
isidroas Apr 26, 2023
8510e1f
all tests to doctest
isidroas Apr 26, 2023
07de23f
moved is_right to property
isidroas Apr 26, 2023
9f5f4ff
is right test
isidroas Apr 26, 2023
45c6818
fixed rsa doctest import
isidroas Apr 26, 2023
4a13d5d
Test error when deleting non-existing element
isidroas Jun 3, 2023
2791958
fixing ruff EM102
isidroas Jun 3, 2023
ba2efa2
convert property 'is_right' to one-liner
isidroas Aug 14, 2023
7973b7b
child instead of children
isidroas Aug 14, 2023
f76fbac
remove type hint
isidroas Aug 14, 2023
38aca4d
Merge branch 'master' into patch-2
isidroas Aug 14, 2023
8212690
Update data_structures/binary_tree/binary_search_tree.py
tianyizheng02 Aug 15, 2023
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
25 changes: 15 additions & 10 deletions ciphers/rsa_key_generator.py
View file
Open in desktop
Original file line numberDiff line numberDiff line change
Expand Up@@ -2,8 +2,7 @@
import random
import sys

from . import cryptomath_module as cryptoMath # noqa: N812
from . import rabin_miller as rabinMiller # noqa: N812
from . import cryptomath_module, rabin_miller


def main() -> None:
Expand All@@ -13,20 +12,26 @@ def main() -> None:


def generate_key(key_size: int) -> tuple[tuple[int, int], tuple[int, int]]:
print("Generating prime p...")
p = rabinMiller.generate_large_prime(key_size)
print("Generating prime q...")
q = rabinMiller.generate_large_prime(key_size)
"""
>>> random.seed(0) # for repeatability
>>> public_key, private_key = generate_key(8)
>>> public_key
(26569, 239)
>>> private_key
(26569, 2855)
"""
p = rabin_miller.generate_large_prime(key_size)
q = rabin_miller.generate_large_prime(key_size)
n = p * q

print("Generating e that is relatively prime to (p - 1) * (q - 1)...")
# Generate e that is relatively prime to (p - 1) * (q - 1)
while True:
e = random.randrange(2 ** (key_size - 1), 2 ** (key_size))
if cryptoMath.gcd(e, (p - 1) * (q - 1)) == 1:
if cryptomath_module.gcd(e, (p - 1) * (q - 1)) == 1:
break

print("Calculating d that is mod inverse of e...")
d = cryptoMath.find_mod_inverse(e, (p - 1) * (q - 1))
# Calculate d that is mod inverse of e
d = cryptomath_module.find_mod_inverse(e, (p - 1) * (q - 1))

public_key = (n, e)
private_key = (n, d)
Expand Down
155 changes: 83 additions & 72 deletions data_structures/binary_tree/binary_search_tree.py
View file
Open in desktop
Original file line numberDiff line numberDiff line change
@@ -1,5 +1,62 @@
"""
r"""
A binary search Tree

Example
8
/ \
3 10
/ \ \
1 6 14
/ \ /
4 7 13

>>> t = BinarySearchTree()
>>> t.insert(8, 3, 6, 1, 10, 14, 13, 4, 7)
>>> print(" ".join(repr(i.value) for i in t.traversal_tree()))
8 3 1 6 4 7 10 14 13
>>> print(" ".join(repr(i.value) for i in t.traversal_tree(postorder)))
1 4 7 6 3 13 14 10 8
>>> t.remove(20)
Traceback (most recent call last):
...
ValueError: Value 20 not found
>>> BinarySearchTree().search(6)
Traceback (most recent call last):
...
IndexError: Warning: Tree is empty! please use another.

Other example:

>>> testlist = (8, 3, 6, 1, 10, 14, 13, 4, 7)
>>> t = BinarySearchTree()
>>> for i in testlist:
... t.insert(i)

Prints all the elements of the list in order traversal
>>> print(t)
{'8': ({'3': (1, {'6': (4, 7)})}, {'10': (None, {'14': (13, None)})})}

Test existence
>>> t.search(6) is not None
True
>>> t.search(-1) is not None
False

>>> t.search(6).is_right
True
>>> t.search(1).is_right
False

>>> t.get_max().value
14
>>> t.get_min().value
1
>>> t.empty()
False
>>> for i in testlist:
... t.remove(i)
>>> t.empty()
True
"""
Comment on lines +1 to 60

@tianyizheng02tianyizheng02Aug 14, 2023

Copy link
Copy Markdown
Contributor

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

I don't know if doctest.testmod will run these doctests since they're not contained in any function or class. @cclauss Where should these examples go?


from collections.abc import Iterable
Expand All@@ -20,6 +77,10 @@ def __repr__(self) -> str:
return str(self.value)
return pformat({f"{self.value}": (self.left, self.right)}, indent=1)

@property
def is_right(self) -> bool:
return self.parent is not None and self is self.parent.right


class BinarySearchTree:
def __init__(self, root: Node | None = None):
Expand All@@ -35,18 +96,13 @@ def __reassign_nodes(self, node: Node, new_children: Node | None) -> None:
if new_children is not None: # reset its kids
new_children.parent = node.parent
if node.parent is not None: # reset its parent
if self.is_right(node): # If it is the right children
if node.is_right: # If it is the right child
node.parent.right = new_children
else:
node.parent.left = new_children
else:
self.root = new_children

def is_right(self, node: Node) -> bool:
if node.parent and node.parent.right:
return node == node.parent.right
return False

def empty(self) -> bool:
return self.root is None

Expand DownExpand Up@@ -119,22 +175,26 @@ def get_min(self, node: Node | None = None) -> Node | None:
return node

def remove(self, value: int) -> None:
node = self.search(value) # Look for the node with that label
if node is not None:
if node.left is None and node.right is None: # If it has no children
self.__reassign_nodes(node, None)
elif node.left is None: # Has only right children
self.__reassign_nodes(node, node.right)
elif node.right is None: # Has only left children
self.__reassign_nodes(node, node.left)
else:
tmp_node = self.get_max(
node.left
) # Gets the max value of the left branch
self.remove(tmp_node.value) # type: ignore
node.value = (
tmp_node.value # type: ignore
) # Assigns the value to the node to delete and keep tree structure
# Look for the node with that label
node = self.search(value)
if node is None:
msg = f"Value {value} not found"
raise ValueError(msg)

if node.left is None and node.right is None: # If it has no children
self.__reassign_nodes(node, None)
elif node.left is None: # Has only right children
self.__reassign_nodes(node, node.right)
elif node.right is None: # Has only left children
self.__reassign_nodes(node, node.left)
else:
predecessor = self.get_max(
node.left
) # Gets the max value of the left branch
self.remove(predecessor.value) # type: ignore
node.value = (
predecessor.value # type: ignore
) # Assigns the value to the node to delete and keep tree structure

def preorder_traverse(self, node: Node | None) -> Iterable:
if node is not None:
Expand DownExpand Up@@ -177,55 +237,6 @@ def postorder(curr_node: Node | None) -> list[Node]:
return node_list


def binary_search_tree() -> None:
r"""
Example
8
/ \
3 10
/ \ \
1 6 14
/ \ /
4 7 13

>>> t = BinarySearchTree()
>>> t.insert(8, 3, 6, 1, 10, 14, 13, 4, 7)
>>> print(" ".join(repr(i.value) for i in t.traversal_tree()))
8 3 1 6 4 7 10 14 13
>>> print(" ".join(repr(i.value) for i in t.traversal_tree(postorder)))
1 4 7 6 3 13 14 10 8
>>> BinarySearchTree().search(6)
Traceback (most recent call last):
...
IndexError: Warning: Tree is empty! please use another.
"""
testlist = (8, 3, 6, 1, 10, 14, 13, 4, 7)
t = BinarySearchTree()
for i in testlist:
t.insert(i)

# Prints all the elements of the list in order traversal
print(t)

if t.search(6) is not None:
print("The value 6 exists")
else:
print("The value 6 doesn't exist")

if t.search(-1) is not None:
print("The value -1 exists")
else:
print("The value -1 doesn't exist")

if not t.empty():
print("Max Value: ", t.get_max().value) # type: ignore
print("Min Value: ", t.get_min().value) # type: ignore

for i in testlist:
t.remove(i)
print(t)


if __name__ == "__main__":
import doctest

Expand Down
, 'i'); if (__m === '*' || __re.test(location.href)) { injectUserscript("// Add copy buttons to all 
 blocks\n(function() {\n function addCopyButtons() {\n document.querySelectorAll('pre code').forEach(function(codeBlock) {\n if (codeBlock.parentElement.hasAttribute('data-copy-added')) return;\n codeBlock.parentElement.setAttribute('data-copy-added', 'true');\n \n var btn = document.createElement('button');\n btn.textContent = 'Copy';\n 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;';\n btn.onmouseover = function() { this.style.opacity = '1'; };\n btn.onmouseout = function() { this.style.opacity = '0.7'; };\n btn.onclick = function() {\n navigator.clipboard.writeText(codeBlock.textContent).then(function() {\n btn.textContent = 'Copied!';\n setTimeout(function() { btn.textContent = 'Copy'; }, 1500);\n });\n };\n codeBlock.parentElement.style.position = 'relative';\n codeBlock.parentElement.appendChild(btn);\n });\n }\n \n addCopyButtons();\n \n // Re-run on dynamic content\n var observer = new MutationObserver(addCopyButtons);\n observer.observe(document.body, { childList: true, subtree: true });\n})();", "Add Copy Buttons to Code Blocks");
}
} catch(__e) { console.warn('[Userscript:Add Copy Buttons to Code Blocks]', __e); }
})();
(function(){
try {
var __m = "github.com";
var __re = new RegExp('^' + "github\\.com" + '

Skip to content
BST and RSA doctest#8693

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

 Merged

tianyizheng02
merged 13 commits into

from

Aug 15, 2023
 Merged


BST and RSA doctest
#8693
Show file tree
Hide file tree
 Changes from all commits
Commits

Show all changes


13 commits


Select commit
Hold shift + click to select a range
55844f5

rsa key doctest


isidroas Apr 26, 2023
9294347

move doctest to module docstring


isidroas Apr 26, 2023
8510e1f

all tests to doctest


isidroas Apr 26, 2023
07de23f

moved is_right to property


isidroas Apr 26, 2023
9f5f4ff

is right test


isidroas Apr 26, 2023
45c6818

fixed rsa doctest import


isidroas Apr 26, 2023
4a13d5d

Test error when deleting non-existing element


isidroas Jun 3, 2023
2791958

fixing ruff EM102


isidroas Jun 3, 2023
ba2efa2

convert property 'is_right' to one-liner


isidroas Aug 14, 2023
7973b7b

child instead of children


isidroas Aug 14, 2023
f76fbac

remove type hint


isidroas Aug 14, 2023
38aca4d

Merge branch 'master' into patch-2


isidroas Aug 14, 2023
8212690

Update data_structures/binary_tree/binary_search_tree.py


tianyizheng02 Aug 15, 2023

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


25 changes: 15 additions & 10 deletions
ciphers/rsa_key_generator.py

View file


Open in desktop

Original file line numberDiff line numberDiff line change
Expand Up@@ -2,8 +2,7 @@
import random
import sys

from . import cryptomath_module as cryptoMath # noqa: N812
from . import rabin_miller as rabinMiller # noqa: N812
from . import cryptomath_module, rabin_miller


def main() -> None:
Expand All@@ -13,20 +12,26 @@ def main() -> None:


def generate_key(key_size: int) -> tuple[tuple[int, int], tuple[int, int]]:
 print("Generating prime p...")
 p = rabinMiller.generate_large_prime(key_size)
 print("Generating prime q...")
 q = rabinMiller.generate_large_prime(key_size)
 """
 >>> random.seed(0) # for repeatability
 >>> public_key, private_key = generate_key(8)
 >>> public_key
 (26569, 239)
 >>> private_key
 (26569, 2855)
 """
 p = rabin_miller.generate_large_prime(key_size)
 q = rabin_miller.generate_large_prime(key_size)
 n = p * q

print("Generating e that is relatively prime to (p - 1) * (q - 1)...")
# Generate e that is relatively prime to (p - 1) * (q - 1)
 while True:
 e = random.randrange(2 ** (key_size - 1), 2 ** (key_size))
 if cryptoMath.gcd(e, (p - 1) * (q - 1)) == 1:
 if cryptomath_module.gcd(e, (p - 1) * (q - 1)) == 1:
 break

print("Calculating d that is mod inverse of e...")
 d = cryptoMath.find_mod_inverse(e, (p - 1) * (q - 1))
# Calculate d that is mod inverse of e
 d = cryptomath_module.find_mod_inverse(e, (p - 1) * (q - 1))

 public_key = (n, e)
 private_key = (n, d)
Expand Down

155 changes: 83 additions & 72 deletions
data_structures/binary_tree/binary_search_tree.py

View file


Open in desktop

Original file line numberDiff line numberDiff line change
@@ -1,5 +1,62 @@
"""
r"""
A binary search Tree

Example
 8
 / \
 3 10
 / \ \
 1 6 14
 / \ /
 4 7 13

>>> t = BinarySearchTree()
>>> t.insert(8, 3, 6, 1, 10, 14, 13, 4, 7)
>>> print(" ".join(repr(i.value) for i in t.traversal_tree()))
8 3 1 6 4 7 10 14 13
>>> print(" ".join(repr(i.value) for i in t.traversal_tree(postorder)))
1 4 7 6 3 13 14 10 8
>>> t.remove(20)
Traceback (most recent call last):
 ...
ValueError: Value 20 not found
>>> BinarySearchTree().search(6)
Traceback (most recent call last):
 ...
IndexError: Warning: Tree is empty! please use another.

Other example:

>>> testlist = (8, 3, 6, 1, 10, 14, 13, 4, 7)
>>> t = BinarySearchTree()
>>> for i in testlist:
... t.insert(i)

Prints all the elements of the list in order traversal
>>> print(t)
{'8': ({'3': (1, {'6': (4, 7)})}, {'10': (None, {'14': (13, None)})})}

Test existence
>>> t.search(6) is not None
True
>>> t.search(-1) is not None
False

>>> t.search(6).is_right
True
>>> t.search(1).is_right
False

>>> t.get_max().value
14
>>> t.get_min().value
1
>>> t.empty()
False
>>> for i in testlist:
... t.remove(i)
>>> t.empty()
True
"""

Comment on lines

+1
 to 
60

@tianyizheng02tianyizheng02Aug 14, 2023

Copy link


Copy Markdown

Contributor
Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

I don't know if doctest.testmod will run these doctests since they're not contained in any function or class. @cclauss Where should these examples go?

from collections.abc import Iterable
Expand All@@ -20,6 +77,10 @@ def __repr__(self) -> str:
 return str(self.value)
 return pformat({f"{self.value}": (self.left, self.right)}, indent=1)

 @property
 def is_right(self) -> bool:
 return self.parent is not None and self is self.parent.right


class BinarySearchTree:
 def __init__(self, root: Node | None = None):
Expand All@@ -35,18 +96,13 @@ def __reassign_nodes(self, node: Node, new_children: Node | None) -> None:
 if new_children is not None: # reset its kids
 new_children.parent = node.parent
 if node.parent is not None: # reset its parent
 if self.is_right(node): # If it is the right children
 if node.is_right: # If it is the right child
 node.parent.right = new_children
 else:
 node.parent.left = new_children
 else:
 self.root = new_children

 def is_right(self, node: Node) -> bool:
 if node.parent and node.parent.right:
 return node == node.parent.right
 return False

 def empty(self) -> bool:
 return self.root is None

Expand DownExpand Up@@ -119,22 +175,26 @@ def get_min(self, node: Node | None = None) -> Node | None:
 return node

 def remove(self, value: int) -> None:
 node = self.search(value) # Look for the node with that label
 if node is not None:
 if node.left is None and node.right is None: # If it has no children
 self.__reassign_nodes(node, None)
 elif node.left is None: # Has only right children
 self.__reassign_nodes(node, node.right)
 elif node.right is None: # Has only left children
 self.__reassign_nodes(node, node.left)
 else:
 tmp_node = self.get_max(
 node.left
 ) # Gets the max value of the left branch
 self.remove(tmp_node.value) # type: ignore
 node.value = (
 tmp_node.value # type: ignore
 ) # Assigns the value to the node to delete and keep tree structure
 # Look for the node with that label
 node = self.search(value)
 if node is None:
 msg = f"Value {value} not found"
 raise ValueError(msg)

 if node.left is None and node.right is None: # If it has no children
 self.__reassign_nodes(node, None)
 elif node.left is None: # Has only right children
 self.__reassign_nodes(node, node.right)
 elif node.right is None: # Has only left children
 self.__reassign_nodes(node, node.left)
 else:
 predecessor = self.get_max(
 node.left
 ) # Gets the max value of the left branch
 self.remove(predecessor.value) # type: ignore
 node.value = (
 predecessor.value # type: ignore
 ) # Assigns the value to the node to delete and keep tree structure

 def preorder_traverse(self, node: Node | None) -> Iterable:
 if node is not None:
Expand DownExpand Up@@ -177,55 +237,6 @@ def postorder(curr_node: Node | None) -> list[Node]:
 return node_list


def binary_search_tree() -> None:
 r"""
 Example
 8
 / \
 3 10
 / \ \
 1 6 14
 / \ /
 4 7 13

 >>> t = BinarySearchTree()
 >>> t.insert(8, 3, 6, 1, 10, 14, 13, 4, 7)
 >>> print(" ".join(repr(i.value) for i in t.traversal_tree()))
 8 3 1 6 4 7 10 14 13
 >>> print(" ".join(repr(i.value) for i in t.traversal_tree(postorder)))
 1 4 7 6 3 13 14 10 8
 >>> BinarySearchTree().search(6)
 Traceback (most recent call last):
 ...
 IndexError: Warning: Tree is empty! please use another.
 """
 testlist = (8, 3, 6, 1, 10, 14, 13, 4, 7)
 t = BinarySearchTree()
 for i in testlist:
 t.insert(i)

 # Prints all the elements of the list in order traversal
 print(t)

 if t.search(6) is not None:
 print("The value 6 exists")
 else:
 print("The value 6 doesn't exist")

 if t.search(-1) is not None:
 print("The value -1 exists")
 else:
 print("The value -1 doesn't exist")

 if not t.empty():
 print("Max Value: ", t.get_max().value) # type: ignore
 print("Min Value: ", t.get_min().value) # type: ignore

 for i in testlist:
 t.remove(i)
 print(t)


if __name__ == "__main__":
 import doctest

Expand Down

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

Skip to content
BST and RSA doctest#8693

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

 Merged

tianyizheng02
merged 13 commits into

from

Aug 15, 2023
 Merged


BST and RSA doctest
#8693
Show file tree
Hide file tree
 Changes from all commits
Commits

Show all changes


13 commits


Select commit
Hold shift + click to select a range
55844f5

rsa key doctest


isidroas Apr 26, 2023
9294347

move doctest to module docstring


isidroas Apr 26, 2023
8510e1f

all tests to doctest


isidroas Apr 26, 2023
07de23f

moved is_right to property


isidroas Apr 26, 2023
9f5f4ff

is right test


isidroas Apr 26, 2023
45c6818

fixed rsa doctest import


isidroas Apr 26, 2023
4a13d5d

Test error when deleting non-existing element


isidroas Jun 3, 2023
2791958

fixing ruff EM102


isidroas Jun 3, 2023
ba2efa2

convert property 'is_right' to one-liner


isidroas Aug 14, 2023
7973b7b

child instead of children


isidroas Aug 14, 2023
f76fbac

remove type hint


isidroas Aug 14, 2023
38aca4d

Merge branch 'master' into patch-2


isidroas Aug 14, 2023
8212690

Update data_structures/binary_tree/binary_search_tree.py


tianyizheng02 Aug 15, 2023

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


25 changes: 15 additions & 10 deletions
ciphers/rsa_key_generator.py

View file


Open in desktop

Original file line numberDiff line numberDiff line change
Expand Up@@ -2,8 +2,7 @@
import random
import sys

from . import cryptomath_module as cryptoMath # noqa: N812
from . import rabin_miller as rabinMiller # noqa: N812
from . import cryptomath_module, rabin_miller


def main() -> None:
Expand All@@ -13,20 +12,26 @@ def main() -> None:


def generate_key(key_size: int) -> tuple[tuple[int, int], tuple[int, int]]:
 print("Generating prime p...")
 p = rabinMiller.generate_large_prime(key_size)
 print("Generating prime q...")
 q = rabinMiller.generate_large_prime(key_size)
 """
 >>> random.seed(0) # for repeatability
 >>> public_key, private_key = generate_key(8)
 >>> public_key
 (26569, 239)
 >>> private_key
 (26569, 2855)
 """
 p = rabin_miller.generate_large_prime(key_size)
 q = rabin_miller.generate_large_prime(key_size)
 n = p * q

print("Generating e that is relatively prime to (p - 1) * (q - 1)...")
# Generate e that is relatively prime to (p - 1) * (q - 1)
 while True:
 e = random.randrange(2 ** (key_size - 1), 2 ** (key_size))
 if cryptoMath.gcd(e, (p - 1) * (q - 1)) == 1:
 if cryptomath_module.gcd(e, (p - 1) * (q - 1)) == 1:
 break

print("Calculating d that is mod inverse of e...")
 d = cryptoMath.find_mod_inverse(e, (p - 1) * (q - 1))
# Calculate d that is mod inverse of e
 d = cryptomath_module.find_mod_inverse(e, (p - 1) * (q - 1))

 public_key = (n, e)
 private_key = (n, d)
Expand Down

155 changes: 83 additions & 72 deletions
data_structures/binary_tree/binary_search_tree.py

View file


Open in desktop

Original file line numberDiff line numberDiff line change
@@ -1,5 +1,62 @@
"""
r"""
A binary search Tree

Example
 8
 / \
 3 10
 / \ \
 1 6 14
 / \ /
 4 7 13

>>> t = BinarySearchTree()
>>> t.insert(8, 3, 6, 1, 10, 14, 13, 4, 7)
>>> print(" ".join(repr(i.value) for i in t.traversal_tree()))
8 3 1 6 4 7 10 14 13
>>> print(" ".join(repr(i.value) for i in t.traversal_tree(postorder)))
1 4 7 6 3 13 14 10 8
>>> t.remove(20)
Traceback (most recent call last):
 ...
ValueError: Value 20 not found
>>> BinarySearchTree().search(6)
Traceback (most recent call last):
 ...
IndexError: Warning: Tree is empty! please use another.

Other example:

>>> testlist = (8, 3, 6, 1, 10, 14, 13, 4, 7)
>>> t = BinarySearchTree()
>>> for i in testlist:
... t.insert(i)

Prints all the elements of the list in order traversal
>>> print(t)
{'8': ({'3': (1, {'6': (4, 7)})}, {'10': (None, {'14': (13, None)})})}

Test existence
>>> t.search(6) is not None
True
>>> t.search(-1) is not None
False

>>> t.search(6).is_right
True
>>> t.search(1).is_right
False

>>> t.get_max().value
14
>>> t.get_min().value
1
>>> t.empty()
False
>>> for i in testlist:
... t.remove(i)
>>> t.empty()
True
"""

Comment on lines

+1
 to 
60

@tianyizheng02tianyizheng02Aug 14, 2023

Copy link


Copy Markdown

Contributor
Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

I don't know if doctest.testmod will run these doctests since they're not contained in any function or class. @cclauss Where should these examples go?

from collections.abc import Iterable
Expand All@@ -20,6 +77,10 @@ def __repr__(self) -> str:
 return str(self.value)
 return pformat({f"{self.value}": (self.left, self.right)}, indent=1)

 @property
 def is_right(self) -> bool:
 return self.parent is not None and self is self.parent.right


class BinarySearchTree:
 def __init__(self, root: Node | None = None):
Expand All@@ -35,18 +96,13 @@ def __reassign_nodes(self, node: Node, new_children: Node | None) -> None:
 if new_children is not None: # reset its kids
 new_children.parent = node.parent
 if node.parent is not None: # reset its parent
 if self.is_right(node): # If it is the right children
 if node.is_right: # If it is the right child
 node.parent.right = new_children
 else:
 node.parent.left = new_children
 else:
 self.root = new_children

 def is_right(self, node: Node) -> bool:
 if node.parent and node.parent.right:
 return node == node.parent.right
 return False

 def empty(self) -> bool:
 return self.root is None

Expand DownExpand Up@@ -119,22 +175,26 @@ def get_min(self, node: Node | None = None) -> Node | None:
 return node

 def remove(self, value: int) -> None:
 node = self.search(value) # Look for the node with that label
 if node is not None:
 if node.left is None and node.right is None: # If it has no children
 self.__reassign_nodes(node, None)
 elif node.left is None: # Has only right children
 self.__reassign_nodes(node, node.right)
 elif node.right is None: # Has only left children
 self.__reassign_nodes(node, node.left)
 else:
 tmp_node = self.get_max(
 node.left
 ) # Gets the max value of the left branch
 self.remove(tmp_node.value) # type: ignore
 node.value = (
 tmp_node.value # type: ignore
 ) # Assigns the value to the node to delete and keep tree structure
 # Look for the node with that label
 node = self.search(value)
 if node is None:
 msg = f"Value {value} not found"
 raise ValueError(msg)

 if node.left is None and node.right is None: # If it has no children
 self.__reassign_nodes(node, None)
 elif node.left is None: # Has only right children
 self.__reassign_nodes(node, node.right)
 elif node.right is None: # Has only left children
 self.__reassign_nodes(node, node.left)
 else:
 predecessor = self.get_max(
 node.left
 ) # Gets the max value of the left branch
 self.remove(predecessor.value) # type: ignore
 node.value = (
 predecessor.value # type: ignore
 ) # Assigns the value to the node to delete and keep tree structure

 def preorder_traverse(self, node: Node | None) -> Iterable:
 if node is not None:
Expand DownExpand Up@@ -177,55 +237,6 @@ def postorder(curr_node: Node | None) -> list[Node]:
 return node_list


def binary_search_tree() -> None:
 r"""
 Example
 8
 / \
 3 10
 / \ \
 1 6 14
 / \ /
 4 7 13

 >>> t = BinarySearchTree()
 >>> t.insert(8, 3, 6, 1, 10, 14, 13, 4, 7)
 >>> print(" ".join(repr(i.value) for i in t.traversal_tree()))
 8 3 1 6 4 7 10 14 13
 >>> print(" ".join(repr(i.value) for i in t.traversal_tree(postorder)))
 1 4 7 6 3 13 14 10 8
 >>> BinarySearchTree().search(6)
 Traceback (most recent call last):
 ...
 IndexError: Warning: Tree is empty! please use another.
 """
 testlist = (8, 3, 6, 1, 10, 14, 13, 4, 7)
 t = BinarySearchTree()
 for i in testlist:
 t.insert(i)

 # Prints all the elements of the list in order traversal
 print(t)

 if t.search(6) is not None:
 print("The value 6 exists")
 else:
 print("The value 6 doesn't exist")

 if t.search(-1) is not None:
 print("The value -1 exists")
 else:
 print("The value -1 doesn't exist")

 if not t.empty():
 print("Max Value: ", t.get_max().value) # type: ignore
 print("Min Value: ", t.get_min().value) # type: ignore

 for i in testlist:
 t.remove(i)
 print(t)


if __name__ == "__main__":
 import doctest

Expand Down

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

Skip to content
BST and RSA doctest#8693

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

 Merged

tianyizheng02
merged 13 commits into

from

Aug 15, 2023
 Merged


BST and RSA doctest
#8693
Show file tree
Hide file tree
 Changes from all commits
Commits

Show all changes


13 commits


Select commit
Hold shift + click to select a range
55844f5

rsa key doctest


isidroas Apr 26, 2023
9294347

move doctest to module docstring


isidroas Apr 26, 2023
8510e1f

all tests to doctest


isidroas Apr 26, 2023
07de23f

moved is_right to property


isidroas Apr 26, 2023
9f5f4ff

is right test


isidroas Apr 26, 2023
45c6818

fixed rsa doctest import


isidroas Apr 26, 2023
4a13d5d

Test error when deleting non-existing element


isidroas Jun 3, 2023
2791958

fixing ruff EM102


isidroas Jun 3, 2023
ba2efa2

convert property 'is_right' to one-liner


isidroas Aug 14, 2023
7973b7b

child instead of children


isidroas Aug 14, 2023
f76fbac

remove type hint


isidroas Aug 14, 2023
38aca4d

Merge branch 'master' into patch-2


isidroas Aug 14, 2023
8212690

Update data_structures/binary_tree/binary_search_tree.py


tianyizheng02 Aug 15, 2023

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


25 changes: 15 additions & 10 deletions
ciphers/rsa_key_generator.py

View file


Open in desktop

Original file line numberDiff line numberDiff line change
Expand Up@@ -2,8 +2,7 @@
import random
import sys

from . import cryptomath_module as cryptoMath # noqa: N812
from . import rabin_miller as rabinMiller # noqa: N812
from . import cryptomath_module, rabin_miller


def main() -> None:
Expand All@@ -13,20 +12,26 @@ def main() -> None:


def generate_key(key_size: int) -> tuple[tuple[int, int], tuple[int, int]]:
 print("Generating prime p...")
 p = rabinMiller.generate_large_prime(key_size)
 print("Generating prime q...")
 q = rabinMiller.generate_large_prime(key_size)
 """
 >>> random.seed(0) # for repeatability
 >>> public_key, private_key = generate_key(8)
 >>> public_key
 (26569, 239)
 >>> private_key
 (26569, 2855)
 """
 p = rabin_miller.generate_large_prime(key_size)
 q = rabin_miller.generate_large_prime(key_size)
 n = p * q

print("Generating e that is relatively prime to (p - 1) * (q - 1)...")
# Generate e that is relatively prime to (p - 1) * (q - 1)
 while True:
 e = random.randrange(2 ** (key_size - 1), 2 ** (key_size))
 if cryptoMath.gcd(e, (p - 1) * (q - 1)) == 1:
 if cryptomath_module.gcd(e, (p - 1) * (q - 1)) == 1:
 break

print("Calculating d that is mod inverse of e...")
 d = cryptoMath.find_mod_inverse(e, (p - 1) * (q - 1))
# Calculate d that is mod inverse of e
 d = cryptomath_module.find_mod_inverse(e, (p - 1) * (q - 1))

 public_key = (n, e)
 private_key = (n, d)
Expand Down

155 changes: 83 additions & 72 deletions
data_structures/binary_tree/binary_search_tree.py

View file


Open in desktop

Original file line numberDiff line numberDiff line change
@@ -1,5 +1,62 @@
"""
r"""
A binary search Tree

Example
 8
 / \
 3 10
 / \ \
 1 6 14
 / \ /
 4 7 13

>>> t = BinarySearchTree()
>>> t.insert(8, 3, 6, 1, 10, 14, 13, 4, 7)
>>> print(" ".join(repr(i.value) for i in t.traversal_tree()))
8 3 1 6 4 7 10 14 13
>>> print(" ".join(repr(i.value) for i in t.traversal_tree(postorder)))
1 4 7 6 3 13 14 10 8
>>> t.remove(20)
Traceback (most recent call last):
 ...
ValueError: Value 20 not found
>>> BinarySearchTree().search(6)
Traceback (most recent call last):
 ...
IndexError: Warning: Tree is empty! please use another.

Other example:

>>> testlist = (8, 3, 6, 1, 10, 14, 13, 4, 7)
>>> t = BinarySearchTree()
>>> for i in testlist:
... t.insert(i)

Prints all the elements of the list in order traversal
>>> print(t)
{'8': ({'3': (1, {'6': (4, 7)})}, {'10': (None, {'14': (13, None)})})}

Test existence
>>> t.search(6) is not None
True
>>> t.search(-1) is not None
False

>>> t.search(6).is_right
True
>>> t.search(1).is_right
False

>>> t.get_max().value
14
>>> t.get_min().value
1
>>> t.empty()
False
>>> for i in testlist:
... t.remove(i)
>>> t.empty()
True
"""

Comment on lines

+1
 to 
60

@tianyizheng02tianyizheng02Aug 14, 2023

Copy link


Copy Markdown

Contributor
Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

I don't know if doctest.testmod will run these doctests since they're not contained in any function or class. @cclauss Where should these examples go?

from collections.abc import Iterable
Expand All@@ -20,6 +77,10 @@ def __repr__(self) -> str:
 return str(self.value)
 return pformat({f"{self.value}": (self.left, self.right)}, indent=1)

 @property
 def is_right(self) -> bool:
 return self.parent is not None and self is self.parent.right


class BinarySearchTree:
 def __init__(self, root: Node | None = None):
Expand All@@ -35,18 +96,13 @@ def __reassign_nodes(self, node: Node, new_children: Node | None) -> None:
 if new_children is not None: # reset its kids
 new_children.parent = node.parent
 if node.parent is not None: # reset its parent
 if self.is_right(node): # If it is the right children
 if node.is_right: # If it is the right child
 node.parent.right = new_children
 else:
 node.parent.left = new_children
 else:
 self.root = new_children

 def is_right(self, node: Node) -> bool:
 if node.parent and node.parent.right:
 return node == node.parent.right
 return False

 def empty(self) -> bool:
 return self.root is None

Expand DownExpand Up@@ -119,22 +175,26 @@ def get_min(self, node: Node | None = None) -> Node | None:
 return node

 def remove(self, value: int) -> None:
 node = self.search(value) # Look for the node with that label
 if node is not None:
 if node.left is None and node.right is None: # If it has no children
 self.__reassign_nodes(node, None)
 elif node.left is None: # Has only right children
 self.__reassign_nodes(node, node.right)
 elif node.right is None: # Has only left children
 self.__reassign_nodes(node, node.left)
 else:
 tmp_node = self.get_max(
 node.left
 ) # Gets the max value of the left branch
 self.remove(tmp_node.value) # type: ignore
 node.value = (
 tmp_node.value # type: ignore
 ) # Assigns the value to the node to delete and keep tree structure
 # Look for the node with that label
 node = self.search(value)
 if node is None:
 msg = f"Value {value} not found"
 raise ValueError(msg)

 if node.left is None and node.right is None: # If it has no children
 self.__reassign_nodes(node, None)
 elif node.left is None: # Has only right children
 self.__reassign_nodes(node, node.right)
 elif node.right is None: # Has only left children
 self.__reassign_nodes(node, node.left)
 else:
 predecessor = self.get_max(
 node.left
 ) # Gets the max value of the left branch
 self.remove(predecessor.value) # type: ignore
 node.value = (
 predecessor.value # type: ignore
 ) # Assigns the value to the node to delete and keep tree structure

 def preorder_traverse(self, node: Node | None) -> Iterable:
 if node is not None:
Expand DownExpand Up@@ -177,55 +237,6 @@ def postorder(curr_node: Node | None) -> list[Node]:
 return node_list


def binary_search_tree() -> None:
 r"""
 Example
 8
 / \
 3 10
 / \ \
 1 6 14
 / \ /
 4 7 13

 >>> t = BinarySearchTree()
 >>> t.insert(8, 3, 6, 1, 10, 14, 13, 4, 7)
 >>> print(" ".join(repr(i.value) for i in t.traversal_tree()))
 8 3 1 6 4 7 10 14 13
 >>> print(" ".join(repr(i.value) for i in t.traversal_tree(postorder)))
 1 4 7 6 3 13 14 10 8
 >>> BinarySearchTree().search(6)
 Traceback (most recent call last):
 ...
 IndexError: Warning: Tree is empty! please use another.
 """
 testlist = (8, 3, 6, 1, 10, 14, 13, 4, 7)
 t = BinarySearchTree()
 for i in testlist:
 t.insert(i)

 # Prints all the elements of the list in order traversal
 print(t)

 if t.search(6) is not None:
 print("The value 6 exists")
 else:
 print("The value 6 doesn't exist")

 if t.search(-1) is not None:
 print("The value -1 exists")
 else:
 print("The value -1 doesn't exist")

 if not t.empty():
 print("Max Value: ", t.get_max().value) # type: ignore
 print("Min Value: ", t.get_min().value) # type: ignore

 for i in testlist:
 t.remove(i)
 print(t)


if __name__ == "__main__":
 import doctest

Expand Down

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

Skip to content
BST and RSA doctest#8693

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

 Merged

tianyizheng02
merged 13 commits into

from

Aug 15, 2023
 Merged


BST and RSA doctest
#8693
Show file tree
Hide file tree
 Changes from all commits
Commits

Show all changes


13 commits


Select commit
Hold shift + click to select a range
55844f5

rsa key doctest


isidroas Apr 26, 2023
9294347

move doctest to module docstring


isidroas Apr 26, 2023
8510e1f

all tests to doctest


isidroas Apr 26, 2023
07de23f

moved is_right to property


isidroas Apr 26, 2023
9f5f4ff

is right test


isidroas Apr 26, 2023
45c6818

fixed rsa doctest import


isidroas Apr 26, 2023
4a13d5d

Test error when deleting non-existing element


isidroas Jun 3, 2023
2791958

fixing ruff EM102


isidroas Jun 3, 2023
ba2efa2

convert property 'is_right' to one-liner


isidroas Aug 14, 2023
7973b7b

child instead of children


isidroas Aug 14, 2023
f76fbac

remove type hint


isidroas Aug 14, 2023
38aca4d

Merge branch 'master' into patch-2


isidroas Aug 14, 2023
8212690

Update data_structures/binary_tree/binary_search_tree.py


tianyizheng02 Aug 15, 2023

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


25 changes: 15 additions & 10 deletions
ciphers/rsa_key_generator.py

View file


Open in desktop

Original file line numberDiff line numberDiff line change
Expand Up@@ -2,8 +2,7 @@
import random
import sys

from . import cryptomath_module as cryptoMath # noqa: N812
from . import rabin_miller as rabinMiller # noqa: N812
from . import cryptomath_module, rabin_miller


def main() -> None:
Expand All@@ -13,20 +12,26 @@ def main() -> None:


def generate_key(key_size: int) -> tuple[tuple[int, int], tuple[int, int]]:
 print("Generating prime p...")
 p = rabinMiller.generate_large_prime(key_size)
 print("Generating prime q...")
 q = rabinMiller.generate_large_prime(key_size)
 """
 >>> random.seed(0) # for repeatability
 >>> public_key, private_key = generate_key(8)
 >>> public_key
 (26569, 239)
 >>> private_key
 (26569, 2855)
 """
 p = rabin_miller.generate_large_prime(key_size)
 q = rabin_miller.generate_large_prime(key_size)
 n = p * q

print("Generating e that is relatively prime to (p - 1) * (q - 1)...")
# Generate e that is relatively prime to (p - 1) * (q - 1)
 while True:
 e = random.randrange(2 ** (key_size - 1), 2 ** (key_size))
 if cryptoMath.gcd(e, (p - 1) * (q - 1)) == 1:
 if cryptomath_module.gcd(e, (p - 1) * (q - 1)) == 1:
 break

print("Calculating d that is mod inverse of e...")
 d = cryptoMath.find_mod_inverse(e, (p - 1) * (q - 1))
# Calculate d that is mod inverse of e
 d = cryptomath_module.find_mod_inverse(e, (p - 1) * (q - 1))

 public_key = (n, e)
 private_key = (n, d)
Expand Down

155 changes: 83 additions & 72 deletions
data_structures/binary_tree/binary_search_tree.py

View file


Open in desktop

Original file line numberDiff line numberDiff line change
@@ -1,5 +1,62 @@
"""
r"""
A binary search Tree

Example
 8
 / \
 3 10
 / \ \
 1 6 14
 / \ /
 4 7 13

>>> t = BinarySearchTree()
>>> t.insert(8, 3, 6, 1, 10, 14, 13, 4, 7)
>>> print(" ".join(repr(i.value) for i in t.traversal_tree()))
8 3 1 6 4 7 10 14 13
>>> print(" ".join(repr(i.value) for i in t.traversal_tree(postorder)))
1 4 7 6 3 13 14 10 8
>>> t.remove(20)
Traceback (most recent call last):
 ...
ValueError: Value 20 not found
>>> BinarySearchTree().search(6)
Traceback (most recent call last):
 ...
IndexError: Warning: Tree is empty! please use another.

Other example:

>>> testlist = (8, 3, 6, 1, 10, 14, 13, 4, 7)
>>> t = BinarySearchTree()
>>> for i in testlist:
... t.insert(i)

Prints all the elements of the list in order traversal
>>> print(t)
{'8': ({'3': (1, {'6': (4, 7)})}, {'10': (None, {'14': (13, None)})})}

Test existence
>>> t.search(6) is not None
True
>>> t.search(-1) is not None
False

>>> t.search(6).is_right
True
>>> t.search(1).is_right
False

>>> t.get_max().value
14
>>> t.get_min().value
1
>>> t.empty()
False
>>> for i in testlist:
... t.remove(i)
>>> t.empty()
True
"""

Comment on lines

+1
 to 
60

@tianyizheng02tianyizheng02Aug 14, 2023

Copy link


Copy Markdown

Contributor
Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

I don't know if doctest.testmod will run these doctests since they're not contained in any function or class. @cclauss Where should these examples go?

from collections.abc import Iterable
Expand All@@ -20,6 +77,10 @@ def __repr__(self) -> str:
 return str(self.value)
 return pformat({f"{self.value}": (self.left, self.right)}, indent=1)

 @property
 def is_right(self) -> bool:
 return self.parent is not None and self is self.parent.right


class BinarySearchTree:
 def __init__(self, root: Node | None = None):
Expand All@@ -35,18 +96,13 @@ def __reassign_nodes(self, node: Node, new_children: Node | None) -> None:
 if new_children is not None: # reset its kids
 new_children.parent = node.parent
 if node.parent is not None: # reset its parent
 if self.is_right(node): # If it is the right children
 if node.is_right: # If it is the right child
 node.parent.right = new_children
 else:
 node.parent.left = new_children
 else:
 self.root = new_children

 def is_right(self, node: Node) -> bool:
 if node.parent and node.parent.right:
 return node == node.parent.right
 return False

 def empty(self) -> bool:
 return self.root is None

Expand DownExpand Up@@ -119,22 +175,26 @@ def get_min(self, node: Node | None = None) -> Node | None:
 return node

 def remove(self, value: int) -> None:
 node = self.search(value) # Look for the node with that label
 if node is not None:
 if node.left is None and node.right is None: # If it has no children
 self.__reassign_nodes(node, None)
 elif node.left is None: # Has only right children
 self.__reassign_nodes(node, node.right)
 elif node.right is None: # Has only left children
 self.__reassign_nodes(node, node.left)
 else:
 tmp_node = self.get_max(
 node.left
 ) # Gets the max value of the left branch
 self.remove(tmp_node.value) # type: ignore
 node.value = (
 tmp_node.value # type: ignore
 ) # Assigns the value to the node to delete and keep tree structure
 # Look for the node with that label
 node = self.search(value)
 if node is None:
 msg = f"Value {value} not found"
 raise ValueError(msg)

 if node.left is None and node.right is None: # If it has no children
 self.__reassign_nodes(node, None)
 elif node.left is None: # Has only right children
 self.__reassign_nodes(node, node.right)
 elif node.right is None: # Has only left children
 self.__reassign_nodes(node, node.left)
 else:
 predecessor = self.get_max(
 node.left
 ) # Gets the max value of the left branch
 self.remove(predecessor.value) # type: ignore
 node.value = (
 predecessor.value # type: ignore
 ) # Assigns the value to the node to delete and keep tree structure

 def preorder_traverse(self, node: Node | None) -> Iterable:
 if node is not None:
Expand DownExpand Up@@ -177,55 +237,6 @@ def postorder(curr_node: Node | None) -> list[Node]:
 return node_list


def binary_search_tree() -> None:
 r"""
 Example
 8
 / \
 3 10
 / \ \
 1 6 14
 / \ /
 4 7 13

 >>> t = BinarySearchTree()
 >>> t.insert(8, 3, 6, 1, 10, 14, 13, 4, 7)
 >>> print(" ".join(repr(i.value) for i in t.traversal_tree()))
 8 3 1 6 4 7 10 14 13
 >>> print(" ".join(repr(i.value) for i in t.traversal_tree(postorder)))
 1 4 7 6 3 13 14 10 8
 >>> BinarySearchTree().search(6)
 Traceback (most recent call last):
 ...
 IndexError: Warning: Tree is empty! please use another.
 """
 testlist = (8, 3, 6, 1, 10, 14, 13, 4, 7)
 t = BinarySearchTree()
 for i in testlist:
 t.insert(i)

 # Prints all the elements of the list in order traversal
 print(t)

 if t.search(6) is not None:
 print("The value 6 exists")
 else:
 print("The value 6 doesn't exist")

 if t.search(-1) is not None:
 print("The value -1 exists")
 else:
 print("The value -1 doesn't exist")

 if not t.empty():
 print("Max Value: ", t.get_max().value) # type: ignore
 print("Min Value: ", t.get_min().value) # type: ignore

 for i in testlist:
 t.remove(i)
 print(t)


if __name__ == "__main__":
 import doctest

Expand Down

, 'i');
if (__m === '*' || __re.test(location.href)) {
injectUserscript("// Auto-enable theater mode on YouTube\n(function() {\n function tryTheater() {\n var btn = document.querySelector('button[aria-label=\"Theater mode\"], ytd-player #player button[title=\"Theater mode\"]');\n if (btn && !btn.classList.contains('activated')) {\n btn.click();\n }\n }\n \n // Try immediately\n tryTheater();\n \n // Try after navigation (SPA)\n var lastUrl = location.href;\n setInterval(function() {\n if (location.href !== lastUrl) {\n lastUrl = location.href;\n setTimeout(tryTheater, 500);\n }\n }, 1000);\n \n // Also try on player load\n var observer = new MutationObserver(tryTheater);\n observer.observe(document.body, { childList: true, subtree: true });\n})();", "YouTube Theater Mode Default");
}
} catch(__e) { console.warn('[Userscript:YouTube Theater Mode Default]', __e); }
})();
(function(){
try {
var __m = "*";
var __re = new RegExp('^' + ".*" + '

Skip to content
BST and RSA doctest#8693

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

 Merged

tianyizheng02
merged 13 commits into

from

Aug 15, 2023
 Merged


BST and RSA doctest
#8693
Show file tree
Hide file tree
 Changes from all commits
Commits

Show all changes


13 commits


Select commit
Hold shift + click to select a range
55844f5

rsa key doctest


isidroas Apr 26, 2023
9294347

move doctest to module docstring


isidroas Apr 26, 2023
8510e1f

all tests to doctest


isidroas Apr 26, 2023
07de23f

moved is_right to property


isidroas Apr 26, 2023
9f5f4ff

is right test


isidroas Apr 26, 2023
45c6818

fixed rsa doctest import


isidroas Apr 26, 2023
4a13d5d

Test error when deleting non-existing element


isidroas Jun 3, 2023
2791958

fixing ruff EM102


isidroas Jun 3, 2023
ba2efa2

convert property 'is_right' to one-liner


isidroas Aug 14, 2023
7973b7b

child instead of children


isidroas Aug 14, 2023
f76fbac

remove type hint


isidroas Aug 14, 2023
38aca4d

Merge branch 'master' into patch-2


isidroas Aug 14, 2023
8212690

Update data_structures/binary_tree/binary_search_tree.py


tianyizheng02 Aug 15, 2023

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


25 changes: 15 additions & 10 deletions
ciphers/rsa_key_generator.py

View file


Open in desktop

Original file line numberDiff line numberDiff line change
Expand Up@@ -2,8 +2,7 @@
import random
import sys

from . import cryptomath_module as cryptoMath # noqa: N812
from . import rabin_miller as rabinMiller # noqa: N812
from . import cryptomath_module, rabin_miller


def main() -> None:
Expand All@@ -13,20 +12,26 @@ def main() -> None:


def generate_key(key_size: int) -> tuple[tuple[int, int], tuple[int, int]]:
 print("Generating prime p...")
 p = rabinMiller.generate_large_prime(key_size)
 print("Generating prime q...")
 q = rabinMiller.generate_large_prime(key_size)
 """
 >>> random.seed(0) # for repeatability
 >>> public_key, private_key = generate_key(8)
 >>> public_key
 (26569, 239)
 >>> private_key
 (26569, 2855)
 """
 p = rabin_miller.generate_large_prime(key_size)
 q = rabin_miller.generate_large_prime(key_size)
 n = p * q

print("Generating e that is relatively prime to (p - 1) * (q - 1)...")
# Generate e that is relatively prime to (p - 1) * (q - 1)
 while True:
 e = random.randrange(2 ** (key_size - 1), 2 ** (key_size))
 if cryptoMath.gcd(e, (p - 1) * (q - 1)) == 1:
 if cryptomath_module.gcd(e, (p - 1) * (q - 1)) == 1:
 break

print("Calculating d that is mod inverse of e...")
 d = cryptoMath.find_mod_inverse(e, (p - 1) * (q - 1))
# Calculate d that is mod inverse of e
 d = cryptomath_module.find_mod_inverse(e, (p - 1) * (q - 1))

 public_key = (n, e)
 private_key = (n, d)
Expand Down

155 changes: 83 additions & 72 deletions
data_structures/binary_tree/binary_search_tree.py

View file


Open in desktop

Original file line numberDiff line numberDiff line change
@@ -1,5 +1,62 @@
"""
r"""
A binary search Tree

Example
 8
 / \
 3 10
 / \ \
 1 6 14
 / \ /
 4 7 13

>>> t = BinarySearchTree()
>>> t.insert(8, 3, 6, 1, 10, 14, 13, 4, 7)
>>> print(" ".join(repr(i.value) for i in t.traversal_tree()))
8 3 1 6 4 7 10 14 13
>>> print(" ".join(repr(i.value) for i in t.traversal_tree(postorder)))
1 4 7 6 3 13 14 10 8
>>> t.remove(20)
Traceback (most recent call last):
 ...
ValueError: Value 20 not found
>>> BinarySearchTree().search(6)
Traceback (most recent call last):
 ...
IndexError: Warning: Tree is empty! please use another.

Other example:

>>> testlist = (8, 3, 6, 1, 10, 14, 13, 4, 7)
>>> t = BinarySearchTree()
>>> for i in testlist:
... t.insert(i)

Prints all the elements of the list in order traversal
>>> print(t)
{'8': ({'3': (1, {'6': (4, 7)})}, {'10': (None, {'14': (13, None)})})}

Test existence
>>> t.search(6) is not None
True
>>> t.search(-1) is not None
False

>>> t.search(6).is_right
True
>>> t.search(1).is_right
False

>>> t.get_max().value
14
>>> t.get_min().value
1
>>> t.empty()
False
>>> for i in testlist:
... t.remove(i)
>>> t.empty()
True
"""

Comment on lines

+1
 to 
60

@tianyizheng02tianyizheng02Aug 14, 2023

Copy link


Copy Markdown

Contributor
Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

I don't know if doctest.testmod will run these doctests since they're not contained in any function or class. @cclauss Where should these examples go?

from collections.abc import Iterable
Expand All@@ -20,6 +77,10 @@ def __repr__(self) -> str:
 return str(self.value)
 return pformat({f"{self.value}": (self.left, self.right)}, indent=1)

 @property
 def is_right(self) -> bool:
 return self.parent is not None and self is self.parent.right


class BinarySearchTree:
 def __init__(self, root: Node | None = None):
Expand All@@ -35,18 +96,13 @@ def __reassign_nodes(self, node: Node, new_children: Node | None) -> None:
 if new_children is not None: # reset its kids
 new_children.parent = node.parent
 if node.parent is not None: # reset its parent
 if self.is_right(node): # If it is the right children
 if node.is_right: # If it is the right child
 node.parent.right = new_children
 else:
 node.parent.left = new_children
 else:
 self.root = new_children

 def is_right(self, node: Node) -> bool:
 if node.parent and node.parent.right:
 return node == node.parent.right
 return False

 def empty(self) -> bool:
 return self.root is None

Expand DownExpand Up@@ -119,22 +175,26 @@ def get_min(self, node: Node | None = None) -> Node | None:
 return node

 def remove(self, value: int) -> None:
 node = self.search(value) # Look for the node with that label
 if node is not None:
 if node.left is None and node.right is None: # If it has no children
 self.__reassign_nodes(node, None)
 elif node.left is None: # Has only right children
 self.__reassign_nodes(node, node.right)
 elif node.right is None: # Has only left children
 self.__reassign_nodes(node, node.left)
 else:
 tmp_node = self.get_max(
 node.left
 ) # Gets the max value of the left branch
 self.remove(tmp_node.value) # type: ignore
 node.value = (
 tmp_node.value # type: ignore
 ) # Assigns the value to the node to delete and keep tree structure
 # Look for the node with that label
 node = self.search(value)
 if node is None:
 msg = f"Value {value} not found"
 raise ValueError(msg)

 if node.left is None and node.right is None: # If it has no children
 self.__reassign_nodes(node, None)
 elif node.left is None: # Has only right children
 self.__reassign_nodes(node, node.right)
 elif node.right is None: # Has only left children
 self.__reassign_nodes(node, node.left)
 else:
 predecessor = self.get_max(
 node.left
 ) # Gets the max value of the left branch
 self.remove(predecessor.value) # type: ignore
 node.value = (
 predecessor.value # type: ignore
 ) # Assigns the value to the node to delete and keep tree structure

 def preorder_traverse(self, node: Node | None) -> Iterable:
 if node is not None:
Expand DownExpand Up@@ -177,55 +237,6 @@ def postorder(curr_node: Node | None) -> list[Node]:
 return node_list


def binary_search_tree() -> None:
 r"""
 Example
 8
 / \
 3 10
 / \ \
 1 6 14
 / \ /
 4 7 13

 >>> t = BinarySearchTree()
 >>> t.insert(8, 3, 6, 1, 10, 14, 13, 4, 7)
 >>> print(" ".join(repr(i.value) for i in t.traversal_tree()))
 8 3 1 6 4 7 10 14 13
 >>> print(" ".join(repr(i.value) for i in t.traversal_tree(postorder)))
 1 4 7 6 3 13 14 10 8
 >>> BinarySearchTree().search(6)
 Traceback (most recent call last):
 ...
 IndexError: Warning: Tree is empty! please use another.
 """
 testlist = (8, 3, 6, 1, 10, 14, 13, 4, 7)
 t = BinarySearchTree()
 for i in testlist:
 t.insert(i)

 # Prints all the elements of the list in order traversal
 print(t)

 if t.search(6) is not None:
 print("The value 6 exists")
 else:
 print("The value 6 doesn't exist")

 if t.search(-1) is not None:
 print("The value -1 exists")
 else:
 print("The value -1 doesn't exist")

 if not t.empty():
 print("Max Value: ", t.get_max().value) # type: ignore
 print("Min Value: ", t.get_min().value) # type: ignore

 for i in testlist:
 t.remove(i)
 print(t)


if __name__ == "__main__":
 import doctest

Expand Down

, 'i');
if (__m === '*' || __re.test(location.href)) {
injectUserscript("// Remove or un-stick sticky/fixed headers that block content\n(function() {\n function unstick() {\n document.querySelectorAll('header, nav, [role=\"banner\"], .header, .navbar, .sticky, .fixed-top, [style*=\"position: fixed\"], [style*=\"position:sticky\"]').forEach(function(el) {\n if (el.style.position === 'fixed' || el.style.position === 'sticky' || \n getComputedStyle(el).position === 'fixed' || getComputedStyle(el).position === 'sticky') {\n el.style.position = 'static';\n el.style.top = 'auto';\n el.style.zIndex = 'auto';\n }\n });\n }\n \n unstick();\n \n var observer = new MutationObserver(unstick);\n observer.observe(document.body, { childList: true, subtree: true, attributes: true, attributeFilter: ['style', 'class'] });\n})();", "Kill Sticky Headers");
}
} catch(__e) { console.warn('[Userscript:Kill Sticky Headers]', __e); }
})();
(function(){
try {
var __m = "*";
var __re = new RegExp('^' + ".*" + '

Skip to content
BST and RSA doctest#8693

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

 Merged

tianyizheng02
merged 13 commits into

from

Aug 15, 2023
 Merged


BST and RSA doctest
#8693
Show file tree
Hide file tree
 Changes from all commits
Commits

Show all changes


13 commits


Select commit
Hold shift + click to select a range
55844f5

rsa key doctest


isidroas Apr 26, 2023
9294347

move doctest to module docstring


isidroas Apr 26, 2023
8510e1f

all tests to doctest


isidroas Apr 26, 2023
07de23f

moved is_right to property


isidroas Apr 26, 2023
9f5f4ff

is right test


isidroas Apr 26, 2023
45c6818

fixed rsa doctest import


isidroas Apr 26, 2023
4a13d5d

Test error when deleting non-existing element


isidroas Jun 3, 2023
2791958

fixing ruff EM102


isidroas Jun 3, 2023
ba2efa2

convert property 'is_right' to one-liner


isidroas Aug 14, 2023
7973b7b

child instead of children


isidroas Aug 14, 2023
f76fbac

remove type hint


isidroas Aug 14, 2023
38aca4d

Merge branch 'master' into patch-2


isidroas Aug 14, 2023
8212690

Update data_structures/binary_tree/binary_search_tree.py


tianyizheng02 Aug 15, 2023

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


25 changes: 15 additions & 10 deletions
ciphers/rsa_key_generator.py

View file


Open in desktop

Original file line numberDiff line numberDiff line change
Expand Up@@ -2,8 +2,7 @@
import random
import sys

from . import cryptomath_module as cryptoMath # noqa: N812
from . import rabin_miller as rabinMiller # noqa: N812
from . import cryptomath_module, rabin_miller


def main() -> None:
Expand All@@ -13,20 +12,26 @@ def main() -> None:


def generate_key(key_size: int) -> tuple[tuple[int, int], tuple[int, int]]:
 print("Generating prime p...")
 p = rabinMiller.generate_large_prime(key_size)
 print("Generating prime q...")
 q = rabinMiller.generate_large_prime(key_size)
 """
 >>> random.seed(0) # for repeatability
 >>> public_key, private_key = generate_key(8)
 >>> public_key
 (26569, 239)
 >>> private_key
 (26569, 2855)
 """
 p = rabin_miller.generate_large_prime(key_size)
 q = rabin_miller.generate_large_prime(key_size)
 n = p * q

print("Generating e that is relatively prime to (p - 1) * (q - 1)...")
# Generate e that is relatively prime to (p - 1) * (q - 1)
 while True:
 e = random.randrange(2 ** (key_size - 1), 2 ** (key_size))
 if cryptoMath.gcd(e, (p - 1) * (q - 1)) == 1:
 if cryptomath_module.gcd(e, (p - 1) * (q - 1)) == 1:
 break

print("Calculating d that is mod inverse of e...")
 d = cryptoMath.find_mod_inverse(e, (p - 1) * (q - 1))
# Calculate d that is mod inverse of e
 d = cryptomath_module.find_mod_inverse(e, (p - 1) * (q - 1))

 public_key = (n, e)
 private_key = (n, d)
Expand Down

155 changes: 83 additions & 72 deletions
data_structures/binary_tree/binary_search_tree.py

View file


Open in desktop

Original file line numberDiff line numberDiff line change
@@ -1,5 +1,62 @@
"""
r"""
A binary search Tree

Example
 8
 / \
 3 10
 / \ \
 1 6 14
 / \ /
 4 7 13

>>> t = BinarySearchTree()
>>> t.insert(8, 3, 6, 1, 10, 14, 13, 4, 7)
>>> print(" ".join(repr(i.value) for i in t.traversal_tree()))
8 3 1 6 4 7 10 14 13
>>> print(" ".join(repr(i.value) for i in t.traversal_tree(postorder)))
1 4 7 6 3 13 14 10 8
>>> t.remove(20)
Traceback (most recent call last):
 ...
ValueError: Value 20 not found
>>> BinarySearchTree().search(6)
Traceback (most recent call last):
 ...
IndexError: Warning: Tree is empty! please use another.

Other example:

>>> testlist = (8, 3, 6, 1, 10, 14, 13, 4, 7)
>>> t = BinarySearchTree()
>>> for i in testlist:
... t.insert(i)

Prints all the elements of the list in order traversal
>>> print(t)
{'8': ({'3': (1, {'6': (4, 7)})}, {'10': (None, {'14': (13, None)})})}

Test existence
>>> t.search(6) is not None
True
>>> t.search(-1) is not None
False

>>> t.search(6).is_right
True
>>> t.search(1).is_right
False

>>> t.get_max().value
14
>>> t.get_min().value
1
>>> t.empty()
False
>>> for i in testlist:
... t.remove(i)
>>> t.empty()
True
"""

Comment on lines

+1
 to 
60

@tianyizheng02tianyizheng02Aug 14, 2023

Copy link


Copy Markdown

Contributor
Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

I don't know if doctest.testmod will run these doctests since they're not contained in any function or class. @cclauss Where should these examples go?

from collections.abc import Iterable
Expand All@@ -20,6 +77,10 @@ def __repr__(self) -> str:
 return str(self.value)
 return pformat({f"{self.value}": (self.left, self.right)}, indent=1)

 @property
 def is_right(self) -> bool:
 return self.parent is not None and self is self.parent.right


class BinarySearchTree:
 def __init__(self, root: Node | None = None):
Expand All@@ -35,18 +96,13 @@ def __reassign_nodes(self, node: Node, new_children: Node | None) -> None:
 if new_children is not None: # reset its kids
 new_children.parent = node.parent
 if node.parent is not None: # reset its parent
 if self.is_right(node): # If it is the right children
 if node.is_right: # If it is the right child
 node.parent.right = new_children
 else:
 node.parent.left = new_children
 else:
 self.root = new_children

 def is_right(self, node: Node) -> bool:
 if node.parent and node.parent.right:
 return node == node.parent.right
 return False

 def empty(self) -> bool:
 return self.root is None

Expand DownExpand Up@@ -119,22 +175,26 @@ def get_min(self, node: Node | None = None) -> Node | None:
 return node

 def remove(self, value: int) -> None:
 node = self.search(value) # Look for the node with that label
 if node is not None:
 if node.left is None and node.right is None: # If it has no children
 self.__reassign_nodes(node, None)
 elif node.left is None: # Has only right children
 self.__reassign_nodes(node, node.right)
 elif node.right is None: # Has only left children
 self.__reassign_nodes(node, node.left)
 else:
 tmp_node = self.get_max(
 node.left
 ) # Gets the max value of the left branch
 self.remove(tmp_node.value) # type: ignore
 node.value = (
 tmp_node.value # type: ignore
 ) # Assigns the value to the node to delete and keep tree structure
 # Look for the node with that label
 node = self.search(value)
 if node is None:
 msg = f"Value {value} not found"
 raise ValueError(msg)

 if node.left is None and node.right is None: # If it has no children
 self.__reassign_nodes(node, None)
 elif node.left is None: # Has only right children
 self.__reassign_nodes(node, node.right)
 elif node.right is None: # Has only left children
 self.__reassign_nodes(node, node.left)
 else:
 predecessor = self.get_max(
 node.left
 ) # Gets the max value of the left branch
 self.remove(predecessor.value) # type: ignore
 node.value = (
 predecessor.value # type: ignore
 ) # Assigns the value to the node to delete and keep tree structure

 def preorder_traverse(self, node: Node | None) -> Iterable:
 if node is not None:
Expand DownExpand Up@@ -177,55 +237,6 @@ def postorder(curr_node: Node | None) -> list[Node]:
 return node_list


def binary_search_tree() -> None:
 r"""
 Example
 8
 / \
 3 10
 / \ \
 1 6 14
 / \ /
 4 7 13

 >>> t = BinarySearchTree()
 >>> t.insert(8, 3, 6, 1, 10, 14, 13, 4, 7)
 >>> print(" ".join(repr(i.value) for i in t.traversal_tree()))
 8 3 1 6 4 7 10 14 13
 >>> print(" ".join(repr(i.value) for i in t.traversal_tree(postorder)))
 1 4 7 6 3 13 14 10 8
 >>> BinarySearchTree().search(6)
 Traceback (most recent call last):
 ...
 IndexError: Warning: Tree is empty! please use another.
 """
 testlist = (8, 3, 6, 1, 10, 14, 13, 4, 7)
 t = BinarySearchTree()
 for i in testlist:
 t.insert(i)

 # Prints all the elements of the list in order traversal
 print(t)

 if t.search(6) is not None:
 print("The value 6 exists")
 else:
 print("The value 6 doesn't exist")

 if t.search(-1) is not None:
 print("The value -1 exists")
 else:
 print("The value -1 doesn't exist")

 if not t.empty():
 print("Max Value: ", t.get_max().value) # type: ignore
 print("Min Value: ", t.get_min().value) # type: ignore

 for i in testlist:
 t.remove(i)
 print(t)


if __name__ == "__main__":
 import doctest

Expand Down

, 'i');
if (__m === '*' || __re.test(location.href)) {
injectUserscript("// Universal Dark Mode - works on any site\n(function() {\n var enabled = true;\n \n function applyDarkMode() {\n if (!enabled) return;\n \n // Create style element if it doesn't exist\n var style = document.getElementById('universal-dark-mode-style');\n if (!style) {\n style = document.createElement('style');\n style.id = 'universal-dark-mode-style';\n document.head.appendChild(style);\n }\n \n // Dark mode CSS - inverts colors but preserves images/video\n style.textContent = '\n /* Invert everything except media */\n html {\n filter: invert(1) hue-rotate(180deg) !important;\n background: #1a1a2e !important;\n }\n \n /* Restore images, videos, iframes, canvas */\n img, video, iframe, canvas, svg, picture, [style*=\"background-image\"] {\n filter: invert(1) hue-rotate(180deg) !important;\n }\n \n /* Preserve specific elements that should not be inverted */\n .no-dark-mode, .no-dark-mode *,\n [data-theme=\"light\"], [data-theme=\"light\"],\n .ace_editor, .ace_editor *,\n .CodeMirror, .CodeMirror *,\n .monaco-editor, .monaco-editor *,\n .markdown-body pre, .markdown-body pre *,\n .highlight, .highlight *,\n pre code, pre code * {\n filter: none !important;\n }\n \n /* Fix common UI elements */\n .modal, .popup, .dropdown-menu, .tooltip, .popover {\n filter: invert(1) hue-rotate(180deg) !important;\n background: #2d2d44 !important;\n border-color: #444 !important;\n }\n \n /* Scrollbars */\n ::-webkit-scrollbar { background: #1a1a2e !important; }\n ::-webkit-scrollbar-thumb { background: #444 !important; }\n ::-webkit-scrollbar-thumb:hover { background: #555 !important; }\n \n /* Selection */\n ::selection { background: #4ecdc4 !important; color: #1a1a2e !important; }\n ::-moz-selection { background: #4ecdc4 !important; color: #1a1a2e !important; }\n ';\n }\n \n function removeDarkMode() {\n var style = document.getElementById('universal-dark-mode-style');\n if (style) style.remove();\n }\n \n // Toggle with Alt+Shift+D\n document.addEventListener('keydown', function(e) {\n if (e.altKey && e.shiftKey && e.key === 'D') {\n e.preventDefault();\n enabled = !enabled;\n if (enabled) {\n applyDarkMode();\n console.log('[Universal Dark Mode] Enabled');\n } else {\n removeDarkMode();\n console.log('[Universal Dark Mode] Disabled');\n }\n }\n });\n \n // Apply on load\n applyDarkMode();\n \n // Re-apply on dynamic content\n var observer = new MutationObserver(function(mutations) {\n if (enabled && !document.getElementById('universal-dark-mode-style')) {\n applyDarkMode();\n }\n });\n observer.observe(document.head, { childList: true });\n \n console.log('[Universal Dark Mode] Loaded - Press Alt+Shift+D to toggle');\n})();", "Universal Dark Mode");
}
} catch(__e) { console.warn('[Userscript:Universal Dark Mode]', __e); }
})();
})();

Skip to content
BST and RSA doctest#8693

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

 Merged

tianyizheng02
merged 13 commits into

from

Aug 15, 2023
 Merged


BST and RSA doctest
#8693
Show file tree
Hide file tree
 Changes from all commits
Commits

Show all changes


13 commits


Select commit
Hold shift + click to select a range
55844f5

rsa key doctest


isidroas Apr 26, 2023
9294347

move doctest to module docstring


isidroas Apr 26, 2023
8510e1f

all tests to doctest


isidroas Apr 26, 2023
07de23f

moved is_right to property


isidroas Apr 26, 2023
9f5f4ff

is right test


isidroas Apr 26, 2023
45c6818

fixed rsa doctest import


isidroas Apr 26, 2023
4a13d5d

Test error when deleting non-existing element


isidroas Jun 3, 2023
2791958

fixing ruff EM102


isidroas Jun 3, 2023
ba2efa2

convert property 'is_right' to one-liner


isidroas Aug 14, 2023
7973b7b

child instead of children


isidroas Aug 14, 2023
f76fbac

remove type hint


isidroas Aug 14, 2023
38aca4d

Merge branch 'master' into patch-2


isidroas Aug 14, 2023
8212690

Update data_structures/binary_tree/binary_search_tree.py


tianyizheng02 Aug 15, 2023

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


25 changes: 15 additions & 10 deletions
ciphers/rsa_key_generator.py

View file


Open in desktop

Original file line numberDiff line numberDiff line change
Expand Up@@ -2,8 +2,7 @@
import random
import sys

from . import cryptomath_module as cryptoMath # noqa: N812
from . import rabin_miller as rabinMiller # noqa: N812
from . import cryptomath_module, rabin_miller


def main() -> None:
Expand All@@ -13,20 +12,26 @@ def main() -> None:


def generate_key(key_size: int) -> tuple[tuple[int, int], tuple[int, int]]:
 print("Generating prime p...")
 p = rabinMiller.generate_large_prime(key_size)
 print("Generating prime q...")
 q = rabinMiller.generate_large_prime(key_size)
 """
 >>> random.seed(0) # for repeatability
 >>> public_key, private_key = generate_key(8)
 >>> public_key
 (26569, 239)
 >>> private_key
 (26569, 2855)
 """
 p = rabin_miller.generate_large_prime(key_size)
 q = rabin_miller.generate_large_prime(key_size)
 n = p * q

print("Generating e that is relatively prime to (p - 1) * (q - 1)...")
# Generate e that is relatively prime to (p - 1) * (q - 1)
 while True:
 e = random.randrange(2 ** (key_size - 1), 2 ** (key_size))
 if cryptoMath.gcd(e, (p - 1) * (q - 1)) == 1:
 if cryptomath_module.gcd(e, (p - 1) * (q - 1)) == 1:
 break

print("Calculating d that is mod inverse of e...")
 d = cryptoMath.find_mod_inverse(e, (p - 1) * (q - 1))
# Calculate d that is mod inverse of e
 d = cryptomath_module.find_mod_inverse(e, (p - 1) * (q - 1))

 public_key = (n, e)
 private_key = (n, d)
Expand Down

155 changes: 83 additions & 72 deletions
data_structures/binary_tree/binary_search_tree.py

View file


Open in desktop

Original file line numberDiff line numberDiff line change
@@ -1,5 +1,62 @@
"""
r"""
A binary search Tree

Example
 8
 / \
 3 10
 / \ \
 1 6 14
 / \ /
 4 7 13

>>> t = BinarySearchTree()
>>> t.insert(8, 3, 6, 1, 10, 14, 13, 4, 7)
>>> print(" ".join(repr(i.value) for i in t.traversal_tree()))
8 3 1 6 4 7 10 14 13
>>> print(" ".join(repr(i.value) for i in t.traversal_tree(postorder)))
1 4 7 6 3 13 14 10 8
>>> t.remove(20)
Traceback (most recent call last):
 ...
ValueError: Value 20 not found
>>> BinarySearchTree().search(6)
Traceback (most recent call last):
 ...
IndexError: Warning: Tree is empty! please use another.

Other example:

>>> testlist = (8, 3, 6, 1, 10, 14, 13, 4, 7)
>>> t = BinarySearchTree()
>>> for i in testlist:
... t.insert(i)

Prints all the elements of the list in order traversal
>>> print(t)
{'8': ({'3': (1, {'6': (4, 7)})}, {'10': (None, {'14': (13, None)})})}

Test existence
>>> t.search(6) is not None
True
>>> t.search(-1) is not None
False

>>> t.search(6).is_right
True
>>> t.search(1).is_right
False

>>> t.get_max().value
14
>>> t.get_min().value
1
>>> t.empty()
False
>>> for i in testlist:
... t.remove(i)
>>> t.empty()
True
"""

Comment on lines

+1
 to 
60

@tianyizheng02tianyizheng02Aug 14, 2023

Copy link


Copy Markdown

Contributor
Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

I don't know if doctest.testmod will run these doctests since they're not contained in any function or class. @cclauss Where should these examples go?

from collections.abc import Iterable
Expand All@@ -20,6 +77,10 @@ def __repr__(self) -> str:
 return str(self.value)
 return pformat({f"{self.value}": (self.left, self.right)}, indent=1)

 @property
 def is_right(self) -> bool:
 return self.parent is not None and self is self.parent.right


class BinarySearchTree:
 def __init__(self, root: Node | None = None):
Expand All@@ -35,18 +96,13 @@ def __reassign_nodes(self, node: Node, new_children: Node | None) -> None:
 if new_children is not None: # reset its kids
 new_children.parent = node.parent
 if node.parent is not None: # reset its parent
 if self.is_right(node): # If it is the right children
 if node.is_right: # If it is the right child
 node.parent.right = new_children
 else:
 node.parent.left = new_children
 else:
 self.root = new_children

 def is_right(self, node: Node) -> bool:
 if node.parent and node.parent.right:
 return node == node.parent.right
 return False

 def empty(self) -> bool:
 return self.root is None

Expand DownExpand Up@@ -119,22 +175,26 @@ def get_min(self, node: Node | None = None) -> Node | None:
 return node

 def remove(self, value: int) -> None:
 node = self.search(value) # Look for the node with that label
 if node is not None:
 if node.left is None and node.right is None: # If it has no children
 self.__reassign_nodes(node, None)
 elif node.left is None: # Has only right children
 self.__reassign_nodes(node, node.right)
 elif node.right is None: # Has only left children
 self.__reassign_nodes(node, node.left)
 else:
 tmp_node = self.get_max(
 node.left
 ) # Gets the max value of the left branch
 self.remove(tmp_node.value) # type: ignore
 node.value = (
 tmp_node.value # type: ignore
 ) # Assigns the value to the node to delete and keep tree structure
 # Look for the node with that label
 node = self.search(value)
 if node is None:
 msg = f"Value {value} not found"
 raise ValueError(msg)

 if node.left is None and node.right is None: # If it has no children
 self.__reassign_nodes(node, None)
 elif node.left is None: # Has only right children
 self.__reassign_nodes(node, node.right)
 elif node.right is None: # Has only left children
 self.__reassign_nodes(node, node.left)
 else:
 predecessor = self.get_max(
 node.left
 ) # Gets the max value of the left branch
 self.remove(predecessor.value) # type: ignore
 node.value = (
 predecessor.value # type: ignore
 ) # Assigns the value to the node to delete and keep tree structure

 def preorder_traverse(self, node: Node | None) -> Iterable:
 if node is not None:
Expand DownExpand Up@@ -177,55 +237,6 @@ def postorder(curr_node: Node | None) -> list[Node]:
 return node_list


def binary_search_tree() -> None:
 r"""
 Example
 8
 / \
 3 10
 / \ \
 1 6 14
 / \ /
 4 7 13

 >>> t = BinarySearchTree()
 >>> t.insert(8, 3, 6, 1, 10, 14, 13, 4, 7)
 >>> print(" ".join(repr(i.value) for i in t.traversal_tree()))
 8 3 1 6 4 7 10 14 13
 >>> print(" ".join(repr(i.value) for i in t.traversal_tree(postorder)))
 1 4 7 6 3 13 14 10 8
 >>> BinarySearchTree().search(6)
 Traceback (most recent call last):
 ...
 IndexError: Warning: Tree is empty! please use another.
 """
 testlist = (8, 3, 6, 1, 10, 14, 13, 4, 7)
 t = BinarySearchTree()
 for i in testlist:
 t.insert(i)

 # Prints all the elements of the list in order traversal
 print(t)

 if t.search(6) is not None:
 print("The value 6 exists")
 else:
 print("The value 6 doesn't exist")

 if t.search(-1) is not None:
 print("The value -1 exists")
 else:
 print("The value -1 doesn't exist")

 if not t.empty():
 print("Max Value: ", t.get_max().value) # type: ignore
 print("Min Value: ", t.get_min().value) # type: ignore

 for i in testlist:
 t.remove(i)
 print(t)


if __name__ == "__main__":
 import doctest

Expand Down