Added Memory Clean-up #1
Open
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
Added .Close() methods to PeekCh and PeekChHeap Combining these with close(channel) A cascading closing effect can be utilized to clean up memory. primes := Sieve() Gives you a prime number generator. close(primes) Starts the cascading effect that cleans the memory.
Owner
|
sorry for late response, for some reason I didn't see this coming thru my email. I wrote this as a toy example to play with goroutines and didn't quite envision this to be used in production, mainly due to the fact that it spawns a lot of goroutines. I'm sure there are better ways to generate prime faster with lower memory usage! |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
2 participants
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.
Added a cascading memory clean-up effect based on panics caused by writing to closed channels.
Usage:
primes := Sieve()
close(primes)
This allows you to create multiple fast prime-number generators without suffering from massive memory problems.
Thanks for writing this in the first place.