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.

Sign up for GitHub

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

Jump to bottom

Speed up removal from a set #127

Open
wants to merge 2 commits into
base: master
Choose a base branch
from
Open

Speed up removal from a set #127

wants to merge 2 commits into from

Commits on Nov 22, 2019

  1. Add a Filter method to doublylinkedlist.List 

    The method removes all elements that do not satisfy the hook, in one go.
This is often faster than calling IndexOf then Remove multiple times.
    Julien "_FrnchFrgg_" Rivaud committed Nov 22, 2019
    Configuration menu
    Copy the full SHA
    8dffdef View commit details
    Browse the repository at this point in the history

  2. Make linkedhashset.Set.Remove() worst-case O(n) 

    Instead of using O(n) times an O(n) List.Remove(), use the new
List.Filter() method to keep items that were not deleted.
    Julien "_FrnchFrgg_" RIVAUD committed Nov 22, 2019
    Configuration menu
    Copy the full SHA
    940ffaf View commit details
    Browse the repository at this point in the history