-
Notifications
You must be signed in to change notification settings - Fork 0
Commit
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
- Loading branch information
Showing
2 changed files
with
9 additions
and
9 deletions.
There are no files selected for viewing
This file contains 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
This file contains 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
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -1,7 +1,7 @@ | ||
// Package adaptivepool provides a free list based on [sync.Pool] that can | ||
// stochastically define which items should be reused, based on a measure of | ||
// choice called cost. It also provides a bufferer for io.Reader and | ||
// io.ReadCloser based on this free list. Unless stated otherwise, the | ||
// documentation of sync.Pool is also valid for the implementation in this | ||
// package. | ||
// determine which items should be reused and how they should be pre-allocated | ||
// based on a set of online stats of a measure of choice called cost. It also | ||
// provides a bufferer for io.Reader and io.ReadCloser based on this free list. | ||
// Unless stated otherwise, the documentation of sync.Pool is also valid for the | ||
// implementation in this package. | ||
package adaptivepool |