in reply to Re^4: Bidirectional lookup algorithm? (Judy)
in thread Bidirectional lookup algorithm? (Updated: further info.)
From the Judy Arrays web page:
The Judy family of functions supports fully dynamic arrays. These arrays may be indexed by a 32- or 64-bit word (depending on processor word size), a null terminated string or an array-of-bytes plus length. A dynamic array (sparsely populated) can also be thought of as a mapping function or associative memory.
A Word_t is a typedef unsigned long int in Judy.h and must be the same size as sizeof(void *) I.E. a pointer.
unsigned long int is a 4-byte integer on 64-bit Windows.
This seems to be the 64-bit data model difference between Windows (LLP64) and *nix (LP64) raising its ugly head.
Word_t should be typedef'd as long long in order to ensure that sizeof(Word_t) == sizeof(void*) on both platforms.
|
|---|
| Replies are listed 'Best First'. | |
|---|---|
|
Re^6: Bidirectional lookup algorithm? (Judy)
by syphilis (Archbishop) on Jan 12, 2015 at 12:40 UTC | |
by BrowserUk (Patriarch) on Jan 12, 2015 at 13:32 UTC | |
|
Re^6: Bidirectional lookup algorithm? (Judy)
by oiskuu (Hermit) on Jan 13, 2015 at 01:44 UTC | |
by BrowserUk (Patriarch) on Jan 13, 2015 at 04:36 UTC | |
by syphilis (Archbishop) on Jan 13, 2015 at 02:26 UTC |