Skip to content

Loading entry points can be much faster #1631

Open
@ShabbyX

Description

As @tycho demonstrates in this repo loading entry points can be made much faster with this patch.

The basic principle is to hash the entry point names (offline) and the name being looked up, and then do a numerical lookup instead of strcmp compares. One could take this a step further and sort the pre-generated list of hashes sorted and do a binary search look up.

Activity

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

Metadata

Assignees

No one assigned

    Labels

    enhancementNew feature or request

    Type

    No type

    Projects

    No projects

    Milestone

    No milestone

    Relationships

    None yet

    Development

    No branches or pull requests

    Issue actions