similar to: clang error: static_assert failed "Cache the hash code or make functors involved in hash code and bucket index computation default constructible"

Quick Prototype.js hash question. Given: MyHash = {"Alpha" : {name:"Foo",val:3}, "Delta" : {name:"Bar",val:2}, "Beta" : {name:"Baz",val:4} } I want to display this set ordered by key - Alpha,Beta,Delta and by val - 2,3,4 Prototype.js helps with the hash: $H(MyHash).keys().sort() will give me Alpha, Beta, Delta but I''ve not

Hello, My problem is that I cannot figure out how to format data in the http post request using external C++ application, so then I could write in my controller: @myHash = params[:person] print ''Name: '', @myHash[:name] or @name = params[:person][:name] Thanks in advance! -- Jakub P. Nowak

In C++ code for use in a R-3.1.0 package, my specific problem is that I would like to use <unordered_map> if it is available, or <tr1/unordered_map> if not, or <map> if all else fails. I (think I) can accomplish this with configure.ac as AC_INIT("DESCRIPTION") CXX=`"${R_HOME}/bin/R" CMD config CXX` CXXFLAGS=`"${R_HOME}/bin/R" CMD config

Seth, It really depends how often you do that check. If it happens only once or twice in your whole application, that''s just fine. If it happens more than that and in multiple controllers/views then maybe you want to create a helper for it. Something like this: (didn''t test it, but should be working) module ApplicationHelper def current_id_select(controller, action) (

given an Arra tags[] I need to produce a resulting Hash as following .. { "$in" => [tags[0]], "$in" =>[tags[1], ...} in which the key should be always the same and the value being an Array I tried this : myHash = {} tags.each do |tag| h = {"$in" => [tag]} myHash.merge!(h) end but the merge! is only

Hi All, libcxx is fairly well designed to work in a no-exceptions environment, with most of the sources diligently using the _LIBCPP_NO_EXCEPTIONS macro. However, it seems to have bit-rotted a bit and could use some TLC right now. A no-exceptions variety of libcxx would be quite useful when you want to use all of libcxx goodness without the overhead of exceptions (especially in embedded

When using link_to_remote, I''d like to pass along some auxiliary data in the request. It''s a hash of dynamic data that can change with each request. But I get an error when rails trying to "stringify" the hash. For the regular link_to, it works because it turns the hash into a regular GET-like query string. I''m expecting to be able to get my hash as

On Mon, Mar 16, 2015 at 11:00 PM, David Blaikie <dblaikie at gmail.com> wrote: > > > On Mon, Mar 16, 2015 at 10:52 PM, Davide Italiano <davide at freebsd.org> > wrote: >> >> On Mon, Mar 16, 2015 at 1:54 AM, Davide Italiano <davide at freebsd.org> >> wrote: >> > >> > Shankar's parallel for per-se didn't introduce any

Rafael, Your latest benchmark results look great. LLD took 1.38 seconds where gold --threads takes 0.85 seconds. It needs to be faster, but that's not too bad. On Thu, Mar 19, 2015 at 10:13 AM, Rafael Espíndola < rafael.espindola at gmail.com> wrote: > > Here's an update. > > > > After http://reviews.llvm.org/D8372 , I updated the profiling data. > > >

Hello, I've recently finished with an implementation of KMeans with two initialization techniques, random initialization and KMeans++. I would like to share my findings after evaluating the same. I have tested this implementation of KMeans with a BBC news article dataset. I am currently working on evaluating the same with FIRE datasets. Currently, clustering more than 500 documents

On Tue, Mar 14, 2017 at 5:34 PM Dean Michael Berris <dean.berris at gmail.com> wrote: > On 13 Mar 2017, at 15:39, David Blaikie <dblaikie at gmail.com> wrote: > > > > On Sun, Mar 12, 2017, 4:10 PM Dean Michael Berris <dean.berris at gmail.com> > wrote: > > > > On 9 Mar 2017, at 09:32, David Blaikie via llvm-dev < > llvm-dev at

Hello, I'm looking for a good way to apply a custom hash to passwords.? My hope is to add passwords to a (MySQL) database: INSERT INTO users (user='joblo', pass=MYHASH('plain-password').. For SASL authentication, my thought first was to apply the same hash to the issued password and compare it with the hashed password in the database.? I soon discovered the sql driver

On Mon, Mar 16, 2015 at 1:54 AM, Davide Italiano <davide at freebsd.org> wrote: > > Shankar's parallel for per-se didn't introduce any performance benefit > (or regression). > If the change I propose is safe, I would like to see Shankar's change > in (and this on top of it). > I have other related changes coming next, but I would like to tackle > them one at

On Sun, Mar 12, 2017, 4:10 PM Dean Michael Berris <dean.berris at gmail.com> wrote: > > > On 9 Mar 2017, at 09:32, David Blaikie via llvm-dev < > llvm-dev at lists.llvm.org> wrote: > > > > I agree that we should clean up the standard library usage even just for > consistency. > > > > +1 -- now that I think about it, it should be fairly doable

What should we use instead of DenseMap? —escha > On Mar 15, 2016, at 3:30 PM, Xinliang David Li <xinliangli at gmail.com> wrote: > > yes it makes sense. Avoid using DenseMap when the size of the map is expected to be large but can not be pre-determined. > > David > > On Tue, Mar 15, 2016 at 3:07 PM, via llvm-dev <llvm-dev at lists.llvm.org <mailto:llvm-dev at

Hi, Libc++ has been shipping the <ext/hash_set>, <ext/hash_map> and <ext/__hash> headers for a while and they are deprecated. Those headers contain data structures like __gnu_cxx::hash_map that have replacements like std::unordered_map. I would like to remove those headers. I've put up a patch for review but I won't commit it until we have a sort of plan because I know

On Fri, Mar 20, 2015 at 2:56 PM, Rafael Espíndola < rafael.espindola at gmail.com> wrote: > >> > https://people.freebsd.org/~davide/llvm/lld-03162015.svg > >> > It seems now 85% of CPU time is spent inside > >> > FileArchive::buildTableOfContents(). > >> > In particular, 35% of the samples are spent inserting into > >> >

> On Mar 15, 2016, at 4:09 PM, Philip Reames <listmail at philipreames.com> wrote: > > > > On 03/15/2016 03:07 PM, via llvm-dev wrote: >> There’s a few passes in LLVM that make heavy use of a big DenseMap, one that potentially gets filled with up to 1 entry for each instruction in the function. EarlyCSE is the best example, but Reassociate and MachineCSE have this to

Welcome back again to the Puppet release cycle with the long-awaited eleventy times better RC2 release. The 2.6.0 release is a major feature release and includes a huge variety of new features, fixes, updates and enhancements. These include the complete cut-over from XMLRPC to the REST API, numerous language enhancements, a complete rewrite of the events and reporting system, an internal Ruby

I have two questions about the CRAN machines that build binary packages for Mac. When a new version of a package is released, (A) Do the downstream dependencies get re-checked? (B) Do the downstream dependencies get re-built? I have heard (but do not know for sure) that the answer to (A) is no, the downstream dependencies do not get rechecked. >From publicly available information on the