Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

DOC: clarify the requirements of the canonical sorting of Graph index #700

Merged
merged 1 commit into from
Apr 10, 2024

Conversation

martinfleis
Copy link
Member

Closes #687

See #687 (comment)

Copy link

codecov bot commented Apr 10, 2024

Codecov Report

All modified and coverable lines are covered by tests ✅

Project coverage is 84.9%. Comparing base (bcabdbc) to head (37a36a4).
Report is 3 commits behind head on main.

Additional details and impacted files

Impacted file tree graph

@@           Coverage Diff           @@
##            main    #700     +/-   ##
=======================================
- Coverage   85.0%   84.9%   -0.1%     
=======================================
  Files        141     141             
  Lines      15203   15204      +1     
=======================================
- Hits       12924   12913     -11     
- Misses      2279    2291     +12     
Files Coverage Δ
libpysal/graph/base.py 97.9% <ø> (ø)

... and 1 file with indirect coverage changes

@jGaboardi jGaboardi merged commit dff5383 into pysal:main Apr 10, 2024
11 checks passed
@martinfleis martinfleis deleted the is_sorted-clarification branch April 10, 2024 15:07
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Projects
None yet
Development

Successfully merging this pull request may close these issues.

Ensure Graph.sparse is robust enough
2 participants