similar to: Data manipulation in columns (with apply?)

I've run into a use case where I'd like to use a mapped_iterator to iterator the 1st (or 2nd) items in a sequence of std::pairs. Does select1st/select2nd exist somewhere within LLVM or is there some equivalent? If not, I'll add it. -Dave

On Jul 15, 2011, at 12:35 PM, David Greene wrote: > I've run into a use case where I'd like to use a mapped_iterator to > iterator the 1st (or 2nd) items in a sequence of std::pairs. Does > select1st/select2nd exist somewhere within LLVM or is there some > equivalent? If not, I'll add it. Is this making the resultant loop simpler? C++ without lambda's isn't

I believe he's referring to this: http://www.sgi.com/tech/stl/select1st.html On Fri, Jul 15, 2011 at 1:29 PM, Chris Lattner <clattner at apple.com> wrote: > > On Jul 15, 2011, at 12:35 PM, David Greene wrote: > >> I've run into a use case where I'd like to use a mapped_iterator to >> iterator the 1st (or 2nd) items in a sequence of std::pairs.  Does

Chris Lattner <clattner at apple.com> writes: > On Jul 15, 2011, at 12:35 PM, David Greene wrote: > >> I've run into a use case where I'd like to use a mapped_iterator to >> iterator the 1st (or 2nd) items in a sequence of std::pairs. Does >> select1st/select2nd exist somewhere within LLVM or is there some >> equivalent? If not, I'll add it. >

On Jul 15, 2011, at 1:57 PM, David A. Greene wrote: > Chris Lattner <clattner at apple.com> writes: > >> On Jul 15, 2011, at 12:35 PM, David Greene wrote: >> >>> I've run into a use case where I'd like to use a mapped_iterator to >>> iterator the 1st (or 2nd) items in a sequence of std::pairs. Does >>> select1st/select2nd exist

Greetings, I have seen a few postings in the past regarding the interop of Asterisk and the Cisco 7920 WiFi phone. To date, I have not seen a definitive method to getting the phone working. Assuming someone has this actually working, can that person step up and answer these questions. 1) What Channel is it working with (chan_skinny or chan_sccp)? 2) If code was used that is not a part of a

Thanks to all who response my problem. Here are my summary : 1. from Dirk Eddelbuettel <edd at debian.org> We could try a mixture of normals -- ie flip a coin (use a uniform with some cutoff c where 0 < c < 1 ) to choose between N(0, sigma_1) and N(0, sigma_2). 2. from Michaell Taylor <michaell.taylor at reis.com> We could use the gld library to specify the lambdas of

Thanks to all who response my problem. Here are my summary : 1. from Dirk Eddelbuettel <edd at debian.org> We could try a mixture of normals -- ie flip a coin (use a uniform with some cutoff c where 0 < c < 1 ) to choose between N(0, sigma_1) and N(0, sigma_2). 2. from Michaell Taylor <michaell.taylor at reis.com> We could use the gld library to specify the lambdas of

Hi everyone. There's been several threads on baseline hazard in Cox model but I think they were all on cumulative baseline hazard, for instance http://tolstoy.newcastle.edu.au/R/help/01a/0464.html http://tolstoy.newcastle.edu.au/R/help/01a/0436.html "basehaz" in package survival seems to do a cumulative hazard. extract from the basehaz function: sfit <- survfit(fit) H

Hello all, The itanium demangler in libcxxabi (and also, llvm/lib/Demangle) is really slow. This is largely because the textual representation of the symbol that is being demangled is held in a std::string, and manipulations done during parsing are done on that string. The demangler is always concatenating strings and inserting into the middle of strings, which is terrible. The fact that the