@wycats In Rust terminology, [u8, ..256], c.f. std::ascii::ASCII_LOWER_MAP.
What's a good efficient Map data structure with character keys (let's assume ASCII if it helps)
-
-
-
@__chrismorgan yeah it just seems crazy to use that as the base for a trie. Huge memory consumption for relatively small tries.
End of conversation
New conversation -
-
-
@wycats if you can read Haskell you might find some inspiration in here http://hackage.haskell.org/package/charset (sets, not maps, but similar enough) -
@etrepum Sets are easy... 128-bit bitmask, done! -
@wycats which is really the same thing as using an array, with 1 bit values instead of pointer sized. constant factor difference (only size)
End of conversation
New conversation -
-
-
@wycats an array of length 256? -
@nikomatsakis memory usage seems huge. Want to build a true out of it. - End of conversation
New conversation -
-
-
@wycats a pointer array? Char=int=positionThanks. Twitter will use this to make your timeline better. UndoUndo
-
-
-
@wycats T x[] = new T[255];Thanks. Twitter will use this to make your timeline better. UndoUndo
-
-
-
@wycats I think this cache friendly hash table is pretty efficient: http://goanna.cs.rmit.edu.au/~jz/fulltext/spire05.pdf …Thanks. Twitter will use this to make your timeline better. UndoUndo
-
-
-
@wycats HAT tries?Thanks. Twitter will use this to make your timeline better. UndoUndo
-
Loading seems to be taking a while.
Twitter may be over capacity or experiencing a momentary hiccup. Try again or visit Twitter Status for more information.