search for: hash

Hello folks, TL;DR: This is my proposed hashing interface based on a proposed standard hashing interface. It also is implemented with a much faster and higher quality algorithm than the current one. This is an *early draft* of the code, looking for initial feedback. There has been recent interest in improving the quality and consistency of...

Hi folks, here is a short RFC regarding hashing for the implementation of switch statements and my preliminary patch. I posted this patch on 2014-01-16 21:58 at llvm-commits at cs.uiuc.edu. You can find a copy e.g. on http://lists.cs.uiuc.edu/pipermail/llvm-commits/Week-of-Mon-20140113/201782.html. Best regards Jasper === Preliminary: S...

For learning purposes mainly I attempted to implement hashes/maps/dictionaries (Python lingua) as S4 classes, see the coding below. I came across some rough S4 edges, but in the end it worked (for one dictionary). When testing ones sees that the dictionaries D1 and D2 share their environments D1 at hash and D2 at hash, though I thought a new and empty env...

...variables, it uses symbol variable instead. I read the example of view spec provided in the website. But the example is using instance variable. So I am looking for a way of assigning my test data to the partial to be tested. I would like to show an my code below: class MyController def index hash = {...#data provided here} render :partial=>''index'', :layout=>false, :locals=>{:hash=>hash} end end _index.rhtml ......#unrelated code omitted <script> var data = <%= hash %>; <!-- process data here --> </script> In my spec...

I have a database of bookmarks and tags, and want to count the number of bookmarks each tag is assigned to, for example: user "tyler" has the tag "concerts" on 15 out of his 30 bookmarks. This code: hash = Hash.new("0"); @user.tags.each do |t| @user.bookmarks.each do |b| x = 0 if b.tags.include?(t) then hash[b.id] =+ 1 puts "hash is #{hash} & #{t.name} is on bkmk #{b.name}" end end end ...results in this output: hash is 195=>1 (80s is on bkmk 80s Video C...

Hi ! During linking LLD and other linkers builds a static hash table for dynamic symbols, so that in runtime dynamic linker can use this table and find symbols faster. --hash-style=style linker option is used to select the hash type: "Set the type of linker's hash table(s). style can be either "sysv" for classic ELF ".hash" sectio...

...ffee000}, {0xffff0000}, {0xffff2000}, {0xffff4000}, {0xffff6000}, {0xffff8000}, {0xffffa000}, {0xffffc000}, {0xffffe000}, }; The module has over 16K lines, so that's about 64K entries (1<<16). There is no executable code in this testcase. The cause seems to be the APInt::getHashValue() function (near line 626 of .../lib/Support/APInt.cpp). Some investigation using the debugger suggests that every value was hashing into about three buckets, and the DenseMap code was looping excessively over the extremely long chains in those three buckets. Since I'm not an exp...

...39;s place, the system is >> down and offline, but if it rejoins, it will not get the SID entry it >> had before? >> > > > Samba-tool domain demote --remove-other-dead-server=DEAD_SERVER > > Rowland > tdb> open /var/lib/samba/private/secrets.tdb tdb> list hash=31 rec: hash=31 offset=0x0000ccc8 next=0x00000000 rec_len=116 key_len=20 data_len=68 full_hash=0x6344070e magic=0x26011999 hash=40 rec: hash=40 offset=0x0000cc48 next=0x00000000 rec_len=104 key_len=12 data_len=68 full_hash=0x2a4c7c2e magic=0x26011999 hash=81 rec: hash=81 offset=0x0000cb48 next=0x...

Here's my latest version of Hashing.h, which I propose to add to llvm/ADT. Comments welcome and encouraged. On Thu, Feb 9, 2012 at 11:23 AM, Talin <viridia at gmail.com> wrote: > By the way, the reason I'm bringing this up is that a number of folks are > currently working on optimizing the use of hash tables with...

On Fri, Feb 17, 2012 at 1:53 AM, Chandler Carruth <chandlerc at google.com>wrote: > Jeffrey and I are working on future standard library functionality for > hashing user defined types: > > http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2012/n3333.html > > I would much rather have an interface that is close to or mirrors this > one. We already have some field experience with it, and using it in LLVM > and Clang would provide more. Also,...

Hi, I’ve been looking at Chandler Carruth talks about internal data structures for LLVM in order to implement my own library. That’s how I ended up looking at the internals of DenseMap and the default hash functions defined in DenseMapInfo. I have been very surprised by the hash function used for integers which is hash(k) = 37 * k. This kind of hashing function does not change the lowest bits of k, and if your keys happen to all be a multiple of 8, you end up not using about 90% of the slot as a dir...

LLVM currently has a bunch of different hashing algorithms scattered throughout the code base. There's also a number of places in the code where a FoldingSetNodeID is created for the purpose of calculating a hash, and then discarded. From an efficiency standpoint, this isn't all that bad unless the number of individual items being ha...

...nly evidence of any problem from the vampire command is the > events logged on the PDC, and the invalid passwords. I tried > deleting the trust account on the PDC and rejoining several times, > with Samba on, off, and nmbd on and off. The result is always the > same. The bad password hashes are always the same for each account. > If I change a password on the PDC then run vampire again, the NT > hash changes on the Samba box. It just seems like the NT hash is > somehow being scrambled, but in a consistent way. I believe I have found two bugs in the 3.2 code and one bug th...

...tly set up a Postfix 2.9.6/Dovecot 2.0.19 IMAPS/SMTPS setup on Ubuntu 12.04.2 (Mysql backend). I'm new to all this, so I apologize if this is fairly basic. I've attempted to the best of my ability to search for an answer, but no luck so far. What I'm trying to do is generate a password hash that I can inject directly into my Mysql database (disaster recovery sort of situation). Towards that goal, I'm trying to use 'doveadm pw' to generate a hash that matches a known password in my database. Unfortunately, I'm coming up empty. My default_pass_scheme in dovecot-sql.conf...

...am not sure if this is the right place to post, please redirect me if there is a mailinglist more specifically dealing with prototype.js. After playing around with the very inspiring prototype library I have found a rather annoying thing, that makes the usefulness of the Enumerable mixin for Hashes questionable, if I am not totally wrong (again :-). Here an example: var a = $H({a:1, b:2, c:1, d:3}); document.writeln(a.inspect().escapeHTML()); // yields: #<Hash:{''a'': 1, ''b'': 2, ''c'': 1, ''d'': 3}> var b = a.rejec...

Jeffrey and I are working on future standard library functionality for hashing user defined types: http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2012/n3333.html I would much rather have an interface that is close to or mirrors this one. We already have some field experience with it, and using it in LLVM and Clang would provide more. Also, it would be possible to ess...

...refute_nil (h) root = h.root() - assert (root) + refute_nil (root) h.node_add_child(root, "B") b = h.node_get_child(root, "B") @@ -42,21 +42,21 @@ class TestSetValue < MiniTest::Unit::TestCase val = h.node_get_value(b, "Key1") hash = h.value_value(val) - assert (hash[:type] == 3) - assert (hash[:value] == "JKL") - assert (hash[:len] == 3) + assert_equal(3, hash[:type]) + assert_equal("JKL", hash[:value]) + assert_equal(3, hash[:len]) val = h.node_get_value(b, "Key2")...

...OW_VAL (3U << _Q_LOCKED_OFFSET) > + > +enum vcpu_state { > + vcpu_running = 0, > + vcpu_halted, > +}; > + > +struct pv_node { > + struct mcs_spinlock mcs; > + struct mcs_spinlock __res[3]; > + > + int cpu; > + u8 state; > +}; > + > +/* > + * Hash table using open addressing with an LFSR probe sequence. > + * > + * Since we should not be holding locks from NMI context (very rare indeed) the > + * max load factor is 0.75, which is around the point where open addressing > + * breaks down. > + * > + * Instead of probing just t...

...OW_VAL (3U << _Q_LOCKED_OFFSET) > + > +enum vcpu_state { > + vcpu_running = 0, > + vcpu_halted, > +}; > + > +struct pv_node { > + struct mcs_spinlock mcs; > + struct mcs_spinlock __res[3]; > + > + int cpu; > + u8 state; > +}; > + > +/* > + * Hash table using open addressing with an LFSR probe sequence. > + * > + * Since we should not be holding locks from NMI context (very rare indeed) the > + * max load factor is 0.75, which is around the point where open addressing > + * breaks down. > + * > + * Instead of probing just t...

On Fri, Feb 17, 2012 at 10:58 PM, Talin <viridia at gmail.com> wrote: > However, I really do need an incremental hash for the various uniquing > maps which I'm attempting to optimize. Take for example the case of > uniquing a constant array - the key consists of a type* pointer and an > array of constant*. Those data fields are not stored contiguously in > memory, so I need to hash them separately...