Skip to content
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

Dictionary.Compare Can be made more efficient if you use sorted dictionary #5

Closed
wallymathieu opened this issue Apr 21, 2019 · 1 comment

Comments

@wallymathieu
Copy link
Owner

See System.Collections.Generic

  • SortedDictionary<TKey,TValue>
  • SortedList<TKey,TValue>
  • SortedSet<T>
@wallymathieu wallymathieu changed the title Can be made more efficient if you use sorted lists Dictionary.Compare Can be made more efficient if you use sorted lists Jun 12, 2019
@wallymathieu wallymathieu changed the title Dictionary.Compare Can be made more efficient if you use sorted lists Dictionary.Compare Can be made more efficient if you use sorted dictionary Jun 12, 2019
@wallymathieu
Copy link
Owner Author

You cannot assume anything about the ordering, it's merely a hint

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Projects
None yet
Development

No branches or pull requests

1 participant