search for: beauteful

Hi, Given a simple example, test <- matrix(c(0.1, 0.2, 0.1, 0.2, 0.1, 0.1, 0.3, 0.1, 0.1), 3, 3) How to generate row indexes for which their corresponding row values are less than or equal to 0.2 ? For this example, row 2 and 3 are the correct ones. Thanks [[alternative HTML version deleted]]

...rame cp.table) can be produced with the following commands: > n<-132 > cpt<-data.frame(x=runif(n, min=0, max=100), y=runif(n, min=0, max=100), > la=runif(n, min=0, max=360), phi=runif(n, min=-90, max=90)) Any random data will do. The second variant seems to me much more readable and beauteful. However, the first ugly variant runs much faster. Why?? Here are the profiles: -- View this message in context: http://r.789695.n4.nabble.com/More-simple-implementation-is-slow-tp4632872.html Sent from the R help mailing list archive at Nabble.com.

Dear Zheng Wang, You have a few options: 1) You can add your pass to the set of passes that llvm-gcc runs when it optimizes code. This requires re-compiling llvm-gcc; it also means that your pass must be able to run on incomplete programs and be run multiple times over the same code (i.e., it cannot do whole-program analysis). 2) You can change the build system of the program you're

Hi John, Are there any documents about how to add a pass into LTO? Cheers, Zheng On 19 April 2010 15:11, John Criswell <criswell at uiuc.edu> wrote: > Dear Zheng Wang, > > You have a few options: > > 1) You can add your pass to the set of passes that llvm-gcc runs when it > optimizes code.  This requires re-compiling llvm-gcc; it also means that > your pass must be

Hello, As far as I know, the LLVM pass manager only perform at the llvm bytecode level. This means for each program, I have to convert it to a LLVM bytecode by: llvm-gcc -c -emit-llvm test.c then, I can issue the llvm pass manager to invoke my own pass and produce an output as LLVM bytecode, such as: opt -my-pass < test.o > test.new.o After this point, I need to convert it to assembly

http://bugzilla.mindrot.org/show_bug.cgi?id=1358 Summary: closefromtest fails, differently, sometimes Product: Portable OpenSSH Version: 4.7p1 Platform: Sparc OS/Version: Solaris Status: NEW Severity: normal Priority: P2 Component: Miscellaneous AssignedTo: bitbucket at mindrot.org

Hi All, I have a site using Polycom 501 phones and for some reason the caller ID of the phone number is coming up as sip:<number>@<ip of server> Does anyone know why? It seems to be a Polycom thing as a Linksys phone displays the CID number as just the number. -------------- next part -------------- An HTML attachment was scrubbed... URL:

Hello everyone, I just showed a friend a prototype of a site offering a service I''m trying to sell (sorry, not on the Internet yet - he saw it at my house). His comment: "Looks like it does everything, but also looks pretty ugly. You''re not going to wow anybody with that". Sitting back and thinking about it, he''s dead right - it needs some bling to make it

Hi, I just came across this box [0] (McKay Creek). Seems to be exceptional building material for ZFS based NAS/iSCSI unit. I especially liked the two extra system disks hidden inside the box ! Any one have an experience with these ? [0] http://www.intel.com/design/servers/storage/ssr212mc2 -- Regards, Cyril

Hi guys, i'm not going to have time to work on this for a month or two, so i figured i'd post it. This patch 1. reworks the andersen's implementation to support field sensitivity (though field-sensitive constraints are not generated directly yet), and uses it to do indirect function call support. 2. Rewrites the solver to be state of the art in terms of speed. kimwitu++ used to take

Is there another way of doing the bindings so that the Windows share doesn't run on TCP/IP but will still work with SAMBA? If so, where in the docs should I be looking, and if not - maybe this should be something discussed by the SAMBA dev people.. Regards, Marc. Return-Path: <twunder@iwmail.com> Delivered-To: samba@lists.samba.org Received: from femail14.sdc1.sfba.home.com