feat: add DoubleBuffer implementation and initial tests
-
[x] I have read and followed the guidelines outlined in CONTRIBUTING.md.
Yes, I have read and followed the guidelines provided in the CONTRIBUTING.md file. -
[x] This pull request contains only my own work; it has not been plagiarized.
Yes, this pull request contains only my original work and has not been plagiarized. -
[x] All filenames follow the PascalCase convention.
Yes, all filenames follow the PascalCase convention. -
[x] All function and variable names adhere to Java naming conventions.
Yes, all function and variable names adhere to Java naming conventions. -
[] All new algorithms include a URL in their comments linking to a Wikipedia page or a similar source for reference.
-
[x] All code is formatted using
clang-format -i --style=file /datastructures/buffers/DoubleBufferTest.java
Codecov Report
Attention: Patch coverage is 89.65517% with 3 lines in your changes missing coverage. Please review.
Project coverage is 66.83%. Comparing base (
33dee07) to head (b445e84).
| Files with missing lines | Patch % | Lines |
|---|---|---|
| ...lgorithms/datastructures/buffers/DoubleBuffer.java | 89.65% | 0 Missing and 3 partials :warning: |
Additional details and impacted files
@@ Coverage Diff @@
## master #5885 +/- ##
============================================
+ Coverage 66.81% 66.83% +0.02%
- Complexity 4501 4515 +14
============================================
Files 611 612 +1
Lines 16958 16987 +29
Branches 3275 3281 +6
============================================
+ Hits 11330 11354 +24
- Misses 5181 5182 +1
- Partials 447 451 +4
:umbrella: View full report in Codecov by Sentry.
:loudspeaker: Have feedback on the report? Share it here.
This pull request has been automatically marked as stale because it has not had recent activity. It will be closed if no further activity occurs. Thank you for your contribution!
Please reopen this pull request once you have made the required changes. If you need help, feel free to ask in our Discord server or ping one of the maintainers here. Thank you for your contribution!