microsoft / microsoft/VFSForGit
Use a faster algorithm for path matching in 'gvfs sparse'
Open
Nobody has claimed this yet.
domain: sparse
pri2
- Dominant language
- C#
- Stars
- 6.1k
- Forks
- 474
- Avg merge
- 2d 4h
- Merged PRs (30d)
- 8
Description
Follow up to #1607
See discussions here:
https://github.com/microsoft/VFSForGit/pull/1607#discussion_r350958963
And here:
https://github.com/microsoft/VFSForGit/pull/1607#discussion_r350960647
On how we can improve the performance of gvfs sparse by using the same algorithms as git.
Contributor guide
First steps
- Read the whole issue, then the project's contributing guide.
- Comment on the issue to say you are picking it up — it saves two people doing the same work.
- Fork the repository and make your change on a branch.
- Open a pull request that references the issue number.
Research direction
Start by reading issue #1607 and the two linked pull-request discussions about gvfs sparse path matching. Compare the current approach with the algorithms used by Git; done means gvfs sparse uses the agreed faster algorithm and its path-matching performance improves.
Written by the indexing model from the issue text.
Assessment
- Tech stack
- csharp
- Domain
- cli, performance
- Issue type
- Refactor
- Difficulty
- 5/5
- Estimated time
- Over a week
- Activity status
- Stale
- Clarity
- Needs clarification
- Newbie friendliness
- 25/100