similar to: Default hashing function for integers (DenseMapInfo.h)

> On Jan 10, 2017, at 8:56 AM, Mehdi Amini <mehdi.amini at apple.com> wrote > > Some tests I can suggest is to replace the hash function with your favorite and: Thanks. I’ll give it a try. It will take some time as I need to rewrite DenseMap if I want to use the Knuth multiplicative hash. > ultimately I believe real-world impact is the best way to get a change in. That’s

> On Jan 10, 2017, at 2:31 AM, Chris Lattner <sabre at nondot.org> wrote: > > As others have pointed out, 37 does have some nice properties (by being prime), but we’ve also had it from the very early days. I wouldn’t say that it has been extremely well considered at all. > > -Chris Thanks for your reply. But I am not sure to understand the last sentence. Does it mean that

> It is not clear what the test-case is (what source, what compiler options). My suspicion is that your differences are in the noise, and most of the time is spent doing other things than hashing. Did you profile the a run, and check how much of the total time is spent in the hash-function [you may need to tweak the code a bit to not inline the actual hash function]. Also publishing the RANGE

> On Jan 10, 2017, at 9:36 AM, Bruce Hoult <bruce at hoult.org> wrote: > > Both are not very sophisticated. > You should also look at the different MurmurHash versions, and descendants such as CityHash. I did a few benchmark this morning, trying to tweak the hashing for pointers (as many people seem to use pointers as keys). The hash function in LLVM is quite simple, but it

On 29 February 2012 09:35, Chandler Carruth <chandlerc at google.com> wrote: > I still think we can do more, but it's already much faster than the existing LLVM one except for the issue Tobias pointed out w/ modulo-4 key sizes. I'm going to investigate this OK, but this is a VERY big exception! Almost any non-string data anyone wants to hash will be a multiple of 4 bytes in

Dear all, Recently I am generating large random samples (10M) and any duplicated numbers are not desired. We tried several RNGs in R and found Wichmann-Hill did not produce duplications. The duplication problem is the interesting birthday problem. If there are M possible numbers, randomly draw N numbers from them, the average number of dupilcations D = N(N-1)/2/M. For Knuth-TAOCP and

Hi all, I have happened to work on MS .NET for sometime now, and I found that this language offers RNG what is called as Donald E. Knuth's subtractive random number generator algorithm (found here: http://msdn.microsoft.com/en-us/library/system.random.aspx#Y12). ? Here I was wondering whether R also have same RNG in it's inventory, so looked at ?set.seed. There I found 2 related RNGs

Dear Sir/Madam, I am a beginner in R. Here is my questions. 1. Can you give me one test for randomness (a name and descriptive paragraph is sufficient). 2. I have learned a uniform random number generator [e.g. not the algorithms: i)Wichmann-Hill, ii) Marsaglia-Multicarry, iii) Super-Duper (Marsaglia), iv) Mersenne-Twister, v) TAOCP-1997 (Knuth), or vi) TAOCP-2002 (Knuth)] . Is there any other

This message is in MIME format. The first part should be readable text, while the remaining parts are likely unreadable without MIME-aware tools. Send mail to mime@docserver.cac.washington.edu for more info. ---559023410-1141662977-1014960253=:3119 Content-Type: TEXT/PLAIN; CHARSET=iso-8859-1 Content-Transfer-Encoding: QUOTED-PRINTABLE Content-ID:

Hola: En la versión gratuita no existe límites en el número de usuarios y tampoco existe límites en el número de desarrolladores. Con la versión gratuita para publicar una aplicación debes subirla al servidor, es decir, es necesario acceso a nivel de sistema al servidor y allí se ejecuta con los permisos que tenga el usuario que ejecuta el servidor shiny. Esto supone un riesgo potencial de

Hi, I have the following report after a cron job again? /root/tools/expunge: Zeile 3: 4869 Speicherzugriffsfehler doveadm expunge -A mailbox Spam savedbefore 5d /root/tools/expunge: Zeile 5: 4915 Speicherzugriffsfehler doveadm expunge -A mailbox Papierkorb savedbefore 4d See the attachment. Any ideas greatly appreciated. Thanks -- Mit freundlichen Gr??en, with kind regards, Jim Knuth

Hello, I use V 2.11 and my question is: Is one present Sieve with this version or MUST this specially compiles? # 2.0.11 (31d8d43fa6b5): /etc/dovecot/dovecot.conf # OS: Linux 2.6.29.4 i686 Debian wheezy/sid -- Mit freundlichen Gr??en, Jim Knuth P.S.: Bitte senden Sie KEINE HTML-Mails! ##### Zufallszitat: Der Fanatismus ist die einzige 'Willensst?rke', zu der auch die Schwachen

In the first paragraph of Sweave.Rnw (./src/library/utils/vignettes/Sweave.Rnw), it reads for literate programming \cite{fla:Knuth:1984}. but probably should be for literate programming \citep{fla:Knuth:1984}. ^ kind regards Enrico -- Enrico Schumann Lucerne, Switzerland http://enricoschumann.net

Hi, Let me present myself : I work on High Performance Computing, mainly on number crunching where the languages used are mainly Fortran and C++. This field is moving more and more from pure number crunching where Fortran shines to a mix of numbers, texts and other data that you cannot easily deal with Fortran. Unfortunately, the C++ standard library suffers from its age and the fact that it has

I have spent some time examining the llvm code now, and it seems most of the hash_maps are keyed with pointers, and a few with ints. There is also one place where the keys are std::string. All these are unproblematic with the Visual Studio std_ext::hash_map since it provides hash_value functions for all these types (note, it hashes char * as pointers, not as strings - but char * is not used

Hi, We are encountering occasions where users post twice or more a form, basically we have detected two situations: a) The user push twice enter b) The user push double click on button "save" or "submit" We consider that this becomes a problem when creating (because we duplicate data) and we think that in some context it could become a security issue

Except for the ability to perform circular recalculation, I believe that the closest programming analogy to a spreadsheet is a functional programming language. Check out Haskell (or LISP or Erlang) to do what you describe. -----Original Message----- From: r-help-bounces at stat.math.ethz.ch [mailto:r-help-bounces at stat.math.ethz.ch] On Behalf Of Fran?ois Pinard Sent: Wednesday, August 29, 2007

This message is in MIME format. The first part should be readable text, while the remaining parts are likely unreadable without MIME-aware tools. ---559023410-851401618-1218751024=:15885 Content-Type: TEXT/PLAIN; charset=ISO-8859-1; format=flowed Content-Transfer-Encoding: QUOTED-PRINTABLE I didn't describe the problem clearly. It's about the number of distinct=20 values. So just

Here are two minor patches. The first adds an insert method to DenseSet that takes two iterators representing the beginning and ending of a range of items to insert. I lifted the code verbatim from DenseMap.h. The second patch defines DenseMapInfo for chars. This is useful because DenseSet is implemented as a DenseMap of (Type, char), so anyone who uses DenseSet has to define DenseMapInfo for

Hello, I have here a problem with managesieve. With the login about webmail (roundcube) comes here in the log: --snip dovecot: managesieve-login: Fatal: pool_system_realloc(4294967296): Out of memory dovecot: managesieve-login: Fatal: master: service(managesieve-login): child 10157 returned error 83 (Out of memory (service managesieve-login { vsz_limit=1024 MB }, you may need to increase it))