| FazBrowse GitHub Viewer | Trending | | Home |
| Tools: [Download Repo ZIP] [Original HTTPS Page] |
Co-authored-by: Daniel Hollas <danekhollas@gmail.com>
| generations. The main idea behind this concept is the assumption that most | ||
| objects have a very short lifespan and can thus be collected soon after their | ||
| creation. This has proven to be very close to the reality of many Python | ||
| In order to limit the time each garbage collection takes, the GC implementation |
There was a problem hiding this comment.
| In order to limit the time each garbage collection takes, the GC implementation | |
| In order to bound the length of each garbage collection pause, the GC implementation |
Sorry, something went wrong.
| The time taken to scan the young generation can be controlled by controlling the | ||
| size of the young, but the size of the old generation cannot be controlled. |
There was a problem hiding this comment.
| The time taken to scan the young generation can be controlled by controlling the | |
| size of the young, but the size of the old generation cannot be controlled. | |
| The time taken to scan the young generation can be controlled by controlling its | |
| size, but the size of the old generation cannot be controlled. |
Sorry, something went wrong.
| Each full scavenge is performed in a series of increments. | ||
| For each full scavenge, the combined increments will cover the whole heap. | ||
|
|
||
| For each increment, the portion of the heap scanned by a single collection is |
There was a problem hiding this comment.
what does "by a single collection" mean here?
Sorry, something went wrong.
| Back | FazBrowse Home | New Git URL |
Uh oh!
There was an error while loading. Please reload this page.
Sorry, something went wrong.
Uh oh!
There was an error while loading. Please reload this page.