Skip to content

consider perfect hashing for big static data tables #4

Open
@kwantam

Description

@kwantam

Given some implementation of perfect hashing, what is its break-even point versus binary searching in Unicode tables? Consider switching tables larger than this break-even point to perfect hashing for enhanced Unicode processing speed.

Metadata

Metadata

Assignees

No one assigned

    Type

    No type

    Projects

    No projects

    Milestone

    No milestone

    Relationships

    None yet

    Development

    No branches or pull requests

    Issue actions