-
Notifications
You must be signed in to change notification settings - Fork 4
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
[NEAT-487] Aggegated view of issues #693
Conversation
doctrino
commented
Oct 31, 2024
•
edited
Loading
edited
☂️ Python Coverage
Overall Coverage
New FilesNo new covered files... Modified Files
|
6f9ed93
to
023e726
Compare
@overload | ||
def __call__( | ||
self, | ||
search: str | None = None, |
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
nice feature,
|
||
if issues and search is not None: | ||
unique_types = {type(issue).__name__ for issue in issues} | ||
closest_match = set(difflib.get_close_matches(search, unique_types)) |
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
will this return partial matches ? what about fuzzy instead ? https://github.com/seatgeek/thefuzz or using cognite sdk entity matching ?
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
This is a very simple way of using the standard library without any extra dependencies to get a slightly better search experience. Suggest we avoid any extra dependency