StackOverflow Questions for Tag: perfect-hash

Bri Bri

Reputation: 2208

What kind of implementation can I use for a static associative array on a vintage system with very limited resources?

cdata-structuresassociative-arrayperfect-hash

Score: 3

Answers: 2

Lance Pollard

Reputation: 79440

How to create perfect hash with ASCII symbols as input, where output hash is always the same for each ASCII sequence, even after adding more later?

javascriptalgorithmhashperfect-hash

Score: 0

Answers: 3

nowox

Reputation: 29126

Seeking an Efficient Perfect Hashing Function integer keys running on a small MCU?

pythonhashperfect-hash

Score: 1

Answers: 1

Anteru

Reputation: 19424

How to create an efficient static hash table?

statichashtabledata-oriented-designperfect-hashstatic-allocation

Score: 8

Answers: 5

jeffreyveon

Reputation: 13830

Minimal perfect hash function that retains mapping of existing keys on expansion

hashperfect-hash

Score: 0

Answers: 2

user2708149

Reputation: 485

How to use gperf to create hash for a range of values?

chexperfect-hashgperf

Score: 3

Answers: 3

Minh Do

Reputation: 21

Data structure for storing classification of billions of 64-bit integers

data-structurespermutationmembershipperfect-hash

Score: 2

Answers: 0

mxmxlwlw

Reputation: 31

perfect hash function for random integer

algorithmmathhashnumber-theoryperfect-hash

Score: 1

Answers: 2

tin_coder

Reputation: 163

Minimal Perfect Hash Function

perfect-hash

Score: 16

Answers: 2

Kevin Meier

Reputation: 2582

Very fast hash table lookup in C (e.g. by MPH)

chashtableperfect-hash

Score: 2

Answers: 1

Oleks

Reputation: 32343

How to generate an unique identifier for the address structure?

c#algorithmhashperfect-hash

Score: 1

Answers: 3

Carlo Wood

Reputation: 6821

Ultra fast lookup in small sized container of 64-bit integer values using dynamic perfect hashing

c++algorithmlookupperfect-hashuniversal-hashing

Score: 5

Answers: 2

Anton Lahti

Reputation: 472

Is it possible to create a Minimal Perfect Hash function without a separate lookup table for a small (<64) set of keys?

calgorithmhashperfect-hash

Score: 15

Answers: 2

help_seeker

Reputation: 49

Is golang's native string hash function a perfect one?

gohashperfect-hash

Score: 0

Answers: 1

Lisa

Reputation: 53

Representation of graphs in a hash table

graphhashhashtablerepresentationperfect-hash

Score: 0

Answers: 1

Touisteur EmporteUneVache

Reputation: 121

Create a 'perfect hash function' for contiguous ranges

algorithmrangelookup-tablesperfect-hash

Score: 0

Answers: 1

bambi kirkayak

Reputation: 51

Perfect hash function for strings known in advance

c++stringhashperfect-hash

Score: 5

Answers: 4

HukeLau_DABA

Reputation: 2528

No such thing as a perfect hash function?

mathhashperfect-hash

Score: 0

Answers: 1

Thomas Johnson

Reputation: 11718

How to use null bytes in gperf?

hashgnuperfect-hashgperf

Score: 0

Answers: 1

Xeoncross

Reputation: 57274

Convert a string to number and back to string?

phpstringencodingperfect-hash

Score: 8

Answers: 3

PreviousPage 1Next

StackOverflow Questions for Tag: perfect-hash

What kind of implementation can I use for a static associative array on a vintage system with very limited resources?

How to create perfect hash with ASCII symbols as input, where output hash is always the same for each ASCII sequence, even after adding more later?

Seeking an Efficient Perfect Hashing Function integer keys running on a small MCU?

How to create an efficient static hash table?

Minimal perfect hash function that retains mapping of existing keys on expansion

How to use gperf to create hash for a range of values?

Data structure for storing classification of billions of 64-bit integers

perfect hash function for random integer

Minimal Perfect Hash Function

Very fast hash table lookup in C (e.g. by MPH)

How to generate an unique identifier for the address structure?

Ultra fast lookup in small sized container of 64-bit integer values using dynamic perfect hashing

Is it possible to create a Minimal Perfect Hash function without a separate lookup table for a small (&lt;64) set of keys?

Is golang&#39;s native string hash function a perfect one?

Representation of graphs in a hash table

Create a &#39;perfect hash function&#39; for contiguous ranges

Perfect hash function for strings known in advance

No such thing as a perfect hash function?

How to use null bytes in gperf?

Convert a string to number and back to string?

Is it possible to create a Minimal Perfect Hash function without a separate lookup table for a small (<64) set of keys?

Is golang's native string hash function a perfect one?

Create a 'perfect hash function' for contiguous ranges