Open
Conversation
Also, utility methods to sort it.
Convert static method to instance method
Author
|
If preferred, it would also be easy enough to use a proper map here (indexmap would preserve the on-disk order; btreemap would enforce lexicographic order). This would obviously have much better lookup characteristics for larger archives and negligible creation cost compared to IO. I just went for ordering the Toc as it was minimally invasive. |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
2 participants
Add this suggestion to a batch that can be applied as a single commit.This suggestion is invalid because no changes were made to the code.Suggestions cannot be applied while the pull request is closed.Suggestions cannot be applied while viewing a subset of changes.Only one suggestion per line can be applied in a batch.Add this suggestion to a batch that can be applied as a single commit.Applying suggestions on deleted lines is not supported.You must change the existing code in this line in order to create a valid suggestion.Outdated suggestions cannot be applied.This suggestion has been applied or marked resolved.Suggestions cannot be applied from pending reviews.Suggestions cannot be applied on multi-line comments.Suggestions cannot be applied while the pull request is queued to merge.Suggestion cannot be applied right now. Please check back later.
Allow the table of contents to be sorted by name so that section lookups can use a binary search. Only switches to binary search when the table length reaches a threshold length.
Unsorted usage is unchanged.