Open haswanth10 opened 1 month ago
Attention: Patch coverage is 99.56897%
with 1 line
in your changes missing coverage. Please review.
Project coverage is 95.07%. Comparing base (
0b8ba06
) to head (56bd101
).
Files | Patch % | Lines |
---|---|---|
...chine_learning/optimization/k_nearest_neighbors.rs | 99.56% | 1 Missing :warning: |
:umbrella: View full report in Codecov by Sentry.
:loudspeaker: Have feedback on the report? Share it here.
Hi , i made the changes suggested. Let me know if there is anything else that's needed :)
This commit adds K-nearest neighbors Algorithm.
Important points regarding Commit:
Pull Request Template
Description
Please include a summary of the change and which issue (if any) is fixed. A brief description of the algorithm and your implementation method can be helpful too. If the implemented method/algorithm is not so well-known, it would be helpful to add a link to an article explaining it with more details.
Type of change
Please delete options that are not relevant.
Checklist:
cargo clippy --all -- -D warnings
just before my last commit and fixed any issue that was found.cargo fmt
just before my last commit.cargo test
just before my last commit and all tests passed.mod.rs
file within its own folder, and in any parent folder(s).DIRECTORY.md
with the correct link.COUNTRIBUTING.md
and my code follows its guidelines.Please make sure that if there is a test that takes too long to run ( > 300ms), you
#[ignore]
that or try to optimize your code or make the test easier to run. We have this rule because we have hundreds of tests to run; If each one of them took 300ms, we would have to wait for a long time.