When I am searching for a node in the "Node ID" box, it appears that some text searching is being done as I can search via the long name or short name of a node--seemingly by prefix. However, if a node is named "Tree node #5: Michael's house" and I search "Michael", I don't get results. SQLite has FTS capability that would allow for a lot fuzzier searching for node names, e.g. prefix, substring, singular/plural, synonyms, .etc. It would be nice to allow these types of search for nodes.
When I am searching for a node in the "Node ID" box, it appears that some text searching is being done as I can search via the long name or short name of a node--seemingly by prefix. However, if a node is named "Tree node #5: Michael's house" and I search "Michael", I don't get results. SQLite has FTS capability that would allow for a lot fuzzier searching for node names, e.g. prefix, substring, singular/plural, synonyms, .etc. It would be nice to allow these types of search for nodes.
<!-- github-sync-id:3572110257 -->
Scott, could you check to see if our search now is more complete? I did some testing and it seems to find all convinations.
Scott, could you check to see if our search now is more complete? I did some testing and it seems to find all convinations.
<!-- github-comment-id:3598091214 -->
Blocking a user prevents them from interacting with repositories, such as opening or commenting on pull requests or issues. Learn more about blocking a user.
When I am searching for a node in the "Node ID" box, it appears that some text searching is being done as I can search via the long name or short name of a node--seemingly by prefix. However, if a node is named "Tree node #5: Michael's house" and I search "Michael", I don't get results. SQLite has FTS capability that would allow for a lot fuzzier searching for node names, e.g. prefix, substring, singular/plural, synonyms, .etc. It would be nice to allow these types of search for nodes.
Scott, could you check to see if our search now is more complete? I did some testing and it seems to find all convinations.