Further text simplification #2
Merged
Conversation
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Thank you!Thank you for your pull request 😃 🤖 This automated message can help you check the rendered files in your submission for clarity. If you have any questions, please feel free to open an issue in {sandpaper}. If you have files that automatically render output (e.g. R Markdown), then you should check for the following:
Rendered Changes🔍 Inspect the changes: https://github.com/ICR-RSE-Group/carpentry-pando-python/compare/md-outputs..md-outputs-PR-2 The following changes were observed in the rendered markdown documents: What does this mean?If you have source files that require output and figures to be generated (e.g. R Markdown), then it is important to make sure the generated figures and output are reproducible. This output provides a way for you to inspect the output in a diff-friendly manner so that it's easy to see the changes that occur due to new software versions or randomisation. ⏱️ Updated at 2025-01-29 16:43:21 +0000 |
stacyrse
approved these changes
Jan 29, 2025
stacyrse
left a comment
stacyrse
left a comment
There was a problem hiding this comment.
The rest is much better than the original!
| To retrieve or check for the existence of a key within a hashing data structure, the key is hashed again and a process equivalent to insertion is repeated. However, now the key at each index is checked for equality with the one provided. If any empty index is found before an equivalent key, then the key must not be present in the ata structure. | ||
|
|
||
| When a dictionary or hash table in Python grows, the underlying storage is resized, which necessitates re-inserting every existing item into the new structure. This process can be computationally expensive but is essential for maintaining efficient average probe times when searching for keys. | ||
| {alt="A iagram showing how keys (hashes) 37, 64, 14, 94, 67 are inserted into a hash table with 11 indices. The insertion of 59, 80, and 39 demonstrates linear probing to resolve collisions."} |
| To retrieve or check for the existence of a key within a hashing data structure, the key is hashed again and a process equivalent to insertion is repeated. However, now the key at each index is checked for equality with the one provided. If any empty index is found before an equivalent key, then the key must not be present in the ata structure. | ||
|
|
||
| When a dictionary or hash table in Python grows, the underlying storage is resized, which necessitates re-inserting every existing item into the new structure. This process can be computationally expensive but is essential for maintaining efficient average probe times when searching for keys. | ||
| {alt="A iagram showing how keys (hashes) 37, 64, 14, 94, 67 are inserted into a hash table with 11 indices. The insertion of 59, 80, and 39 demonstrates linear probing to resolve collisions."} |
msarkis-icr
force-pushed
the
fix_issue_21_bis
branch
from
d130a0f to
ee341e0
Compare
github-actions bot
pushed a commit
that referenced
this pull request
Jan 29, 2025
Auto-generated via `{sandpaper}`
Source : bbfb7be
Branch : main
Author : msarkis-icr <[email protected]>
Time : 2025-01-29 16:46:35 +0000
Message : Merge pull request #2 from ICR-RSE-Group/fix_issue_21_bis
Simplifying text in different sections
github-actions bot
pushed a commit
that referenced
this pull request
Jan 29, 2025
Auto-generated via `{sandpaper}`
Source : 3fbb41c
Branch : md-outputs
Author : GitHub Actions <[email protected]>
Time : 2025-01-29 16:47:28 +0000
Message : markdown source builds
Auto-generated via `{sandpaper}`
Source : bbfb7be
Branch : main
Author : msarkis-icr <[email protected]>
Time : 2025-01-29 16:46:35 +0000
Message : Merge pull request #2 from ICR-RSE-Group/fix_issue_21_bis
Simplifying text in different sections
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
Add this suggestion to a batch that can be applied as a single commit.
This suggestion is invalid because no changes were made to the code.
Suggestions cannot be applied while the pull request is closed.
Suggestions cannot be applied while viewing a subset of changes.
Only one suggestion per line can be applied in a batch.
Add this suggestion to a batch that can be applied as a single commit.
Applying suggestions on deleted lines is not supported.
You must change the existing code in this line in order to create a valid suggestion.
Outdated suggestions cannot be applied.
This suggestion has been applied or marked resolved.
Suggestions cannot be applied from pending reviews.
Suggestions cannot be applied on multi-line comments.
Suggestions cannot be applied while the pull request is queued to merge.
Suggestion cannot be applied right now. Please check back later.
No description provided.