search for: burtleburtl

I'm working on a bug where LLVM takes over six minutes to compile a module. After some hand-editing, the module looks like this: class half { private: union uif { unsigned int i; float f; }; static const uif _toFloat[1 << 16]; }; const half::uif half::_toFloat[1 << 16] = { {0x00000000}, {0x33800000}, {0x34000000}, {0x34400000}, {0x34800000},

Stuart Hastings a écrit : > > { > {0x00000000}, {0x33800000}, {0x34000000}, {0x34400000}, > {0x34800000}, {0x34a00000}, {0x34c00000}, {0x34e00000}, > {0x35000000}, {0x35100000}, {0x35200000}, {0x35300000}, > {0x35400000}, {0x35500000}, {0x35600000}, {0x35700000}, > ... > {0xfffd8000}, {0xfffda000}, {0xfffdc000}, {0xfffde000}, > {0xfffe0000},

...tch statements with much more than 1000 labels are almost never present in practice. Jenkins' hashing usually is sufficiently fast. By the way: You will find the following remark in lib/Target/README.txt: ==> Investigate lowering of sparse switch statements into perfect hash tables: http://burtleburtle.net/bob/hash/perfect.html <== Why not Jenkins' hashing? The search time of Jenkins' hashing might become unacceptably long for extraordinary large label sets. In practice this should never happen, however in this case the label set will be split in two parts are the process of lowe...

CRAN (and crantastic) updates this week New packages ------------ * disclapmix (0.1) Maintainer: Mikkel Meyer Andersen Author(s): Mikkel Meyer Andersen and Poul Svante Eriksen License: GPL-2 http://crantastic.org/packages/disclapmix disclapmix makes inference in a mixture of Discrete Laplace distributions using the EM algorithm. * EstSimPDMP (1.1) Maintainer: Unknown Author(s):