Skip to content

Conversation

Hardvan
Copy link
Contributor

@Hardvan Hardvan commented Oct 14, 2024

  • I have read CONTRIBUTING.md.
  • This pull request is all my own work -- I have not plagiarized it.
  • All filenames are in PascalCase.
  • All functions and variable names follow Java naming conventions.
  • All new algorithms have a URL in their comments that points to Wikipedia or other similar explanations.
  • All new code is formatted with clang-format -i --style=file path/to/your/file.java

@codecov-commenter
Copy link

codecov-commenter commented Oct 14, 2024

Codecov Report

Attention: Patch coverage is 95.23810% with 1 line in your changes missing coverage. Please review.

Project coverage is 69.86%. Comparing base (1d19449) to head (29168e2).

Files with missing lines Patch % Lines
...a/com/thealgorithms/scheduling/GangScheduling.java 95.23% 0 Missing and 1 partial ⚠️
Additional details and impacted files
@@             Coverage Diff              @@
##             master    #5819      +/-   ##
============================================
+ Coverage     69.82%   69.86%   +0.04%     
- Complexity     4730     4735       +5     
============================================
  Files           632      633       +1     
  Lines         17274    17295      +21     
  Branches       3322     3324       +2     
============================================
+ Hits          12061    12083      +22     
+ Misses         4757     4756       -1     
  Partials        456      456              

☔ View full report in Codecov by Sentry.
📢 Have feedback on the report? Share it here.

@Hardvan Hardvan marked this pull request as ready for review October 14, 2024 13:44
@siriak siriak enabled auto-merge (squash) October 26, 2024 06:40
@siriak siriak merged commit f3c2be2 into TheAlgorithms:master Oct 26, 2024
6 checks passed
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment

Labels

None yet

Projects

None yet

Development

Successfully merging this pull request may close these issues.

3 participants