I have a C-language app where I need to do table lookups. The entries are strings, All are known at the start of runtime. The table is initi开发者_如何学JAVAalized once, and then looked up many time
I\'m looking for a hash function that I can use to give uniform unique IDs to devices that connect to our network either using a GSM modem or an ethernet connection.
I was wondering how I would hash a string value (ex: \"m开发者_Go百科yObjectName\") to int values between 0-19
Does anyone know of a good library (windows) that will allow me to create a static (not runtime) perfect hash for millions of items (probably about 10m)?
I\'m trying to write a开发者_开发技巧 generator that produces Pearson perfect hashes.Note that I don\'t need a minimal perfect hash.Wikipedia says that a Pearson perfect hash can be found in O(|S|) ti
I\'ve been asked to look for a perfect hash/one way function to be able to hash 10^11 numbers. However as we\'ll be using a emb开发者_如何学Pythonedded device it wont have the memory to store the rele
While reading the pigeonhole principle on Wikipedia, I come across - \"collisions are inevitable in a hash table because the number of possible keys exceeds the number of indices in the array. 开发者_
I\'m attempting to hash the values 10, 100, 32, 45, 58, 126, 3, 29, 200, 400, 0 I need a function that will map them to an array that has a siz开发者_开发问答e of 13 without causing any collisions.
I would like to use minimal perfect hash from CMPH. Any idea how can I use it on a VC++ project? I created a new project using VC++ 2008 Express Edition here and add th开发者_如何学Goe header and sou
I have some class C: class C (...) { ... } I want to use it to index an efficient map. The most efficient map is an Array.
加载中,请稍侯......