Refactor ContainerPool to use slices instead of linked lists #17
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.
Changes
Replaced
listwith slices for busy and idle pools to enhance performance, leveraging memory locality of slices. Consequently, refactored operations for adding, removing, and searching containers.This change reduces overhead associated with linked lists, improving efficiency in container pool management. Implemented "swap-and-pop" and in-place filtering for container removal and expiration to make these operations efficient with slices.
Benchmark
(made with
go test -bench=. -benchmem ...andbenchstat):goos: linux
goarch: amd64
cpu: 12th Gen Intel(R) Core(TM) i7-12700H
Execution Time (sec/op)
Memory Allocations (allocs/op)