You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
It was proposed during the work on #333 to implement TreeFs like this:
dataTreeFs=Dir (MapFilePathTreeFs)
| FileText
This structure has some benefits:
Automatic sorting of the tree by filepath.
Eliminating duplicate FilePath cases.
The new implementation can make code more maintainable. Or can make it less maintainable. Hard to tell now. This is just a question, whether it's worth it and how should we deal with duplicate and unsorted paths. Alternative proposals are accepted as well!
The text was updated successfully, but these errors were encountered:
It was proposed during the work on #333 to implement
TreeFs
like this:This structure has some benefits:
FilePath
cases.The new implementation can make code more maintainable. Or can make it less maintainable. Hard to tell now. This is just a question, whether it's worth it and how should we deal with duplicate and unsorted paths. Alternative proposals are accepted as well!
The text was updated successfully, but these errors were encountered: