Skip to content
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

Jump to bottom

Mention a source that gives a solution for the assignment in testcase_mapreduce.md #1786

Open
wants to merge 1 commit into
base: master
Choose a base branch
from
Open

Mention a source that gives a solution for the assignment in testcase_mapreduce.md #1786

Changes from all commits
Commits
Show all changes
1 commit
Select commit
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
4 changes: 4 additions & 0 deletions src/std_misc/threads/testcase_mapreduce.md
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -124,6 +124,9 @@ It is not wise to let our number of threads depend on user inputted data.
What if the user decides to insert a lot of spaces? Do we _really_ want to spawn 2,000 threads?
Modify the program so that the data is always chunked into a limited number of chunks,
defined by a static constant at the beginning of the program.
#### Answer
You can find a solution for this assignment
[here][assignment_solution].

### See also:
* [Threads][thread]
Expand All @@ -144,3 +147,4 @@ defined by a static constant at the beginning of the program.
[turbofish]: https://doc.rust-lang.org/book/appendix-02-operators.html?highlight=turbofish
[unwrap]: ../../error/option_unwrap.md
[enumerate]: https://doc.rust-lang.org/book/loops.html#enumerate
[assignment_solution]: https://github.com/HosseinAssaran/Testcase-map-reduce-assignment.git