search for: inefficient

In do_matrix in src/array.c there is a type switch containing : case LGLSXP : for (i = 0; i < nr; i++) for (j = 0; j < nc; j++) LOGICAL(ans)[i + j * NR] = NA_LOGICAL; That seems page inefficient, iiuc. Think it should be : case LGLSXP : for (j = 0; j < nc; j++) for (i = 0; i < nr; i++) LOGICAL(ans)[i + j * NR] = NA_LOGICAL; or more simply : case LGLSXP : for (i = 0; i < nc*nr; i++) LOGICAL(ans)[i] = NA_LOGICAL; ( with some fine tuning required since...

...list(result) p_1<-cbind(p,result_1) ------------------------------------------------------------------------------------------------------- is there any efficient way to shorten the time and make same output? -- View this message in context: http://r.789695.n4.nabble.com/how-to-speed-up-the-inefficient-code-tp4478046p4478046.html Sent from the R help mailing list archive at Nabble.com.

Hi, Consider ConstantUniqueMap::getOrCreate() (in lib/VMCore/ConstantsContext.h): /// getOrCreate - Return the specified constant from the map, creating it if /// necessary. ConstantClass *getOrCreate(const TypeClass *Ty, ValRefType V) { MapKey Lookup(Ty, V); ConstantClass* Result = 0; ... For array (or struct or vector) constants, typically: ValType = vector<Constant*>

...hole vector? It seems like this > should not be necessary, just to look something up in the map. > > Further, if we don't find it in the map, we call Create(), which > constructs *another* copy of MapKey(Ty, V), which will be expensive > all over again. Yes, this is all grossly inefficient. I'm currently working on revamping the LLVM IR type system (see the type-system-rewrite branch): http://llvm.org/viewvc/llvm-project/llvm/branches/type-system-rewrite/ I'm hoping to land it in the next week or two. The remaining pieces todo on the branch are: 1. the IR linker needs to r...

Hi, Can someone technically explain, why does it take so long with loops in R? Thanks, Vehbi Sinan Tunalioglu

https://bugzilla.mindrot.org/show_bug.cgi?id=1665 Summary: prefix_pton is inefficient Product: py-radix Version: -current Platform: ix86 OS/Version: Linux Status: NEW Severity: enhancement Priority: P2 Component: Default AssignedTo: unassigned-bugs at mindrot.org ReportedBy: weinholt at...

...pened at 2007-12-26 21:13 You can respond by visiting: http://rubyforge.org/tracker/?func=detail&atid=413&aid=16627&group_id=85 Category: win32-service Group: Code Cleanup Status: Open Resolution: None Priority: 3 Submitted By: Nobody (None) Assigned to: Nobody (None) Summary: Replace inefficient busy wait loop with UDP/IP loopback socket. Initial Comment: Here are some patches for win32-service which eliminate the messy busy loop that polls the hStopEvent with a zero timeout. Instead of using a Windows event, these patches create a UDP/IP socket bound to the loopback interface which can...

If anyone wants to see a prime example of how inefficient it is to program in SAS, take a look at the SAS programs provided by the US Agency for Healthcare Research and Quality for risk adjusting and reporting for hospital outcomes at http://www.qualityindicators.ahrq.gov/software.htm . The PSSASP3.SAS program is a prime example. Look at how you do...

...haved back end do with a load or store with alignment less than the natural alignment of the type? I believe C++ considers such access to be UB. I'm not sure what the IR semantics are. I think my options are: - Delete the operation / use undef - Lower as if it is naturally aligned - Lower via inefficient code that assumes align 1 Thanks, Jon -------------- next part -------------- An HTML attachment was scrubbed... URL: <http://lists.llvm.org/pipermail/llvm-dev/attachments/20180711/26bb4c9f/attachment.html>

...now, and I just did a netstat and the only connections to a DC are to the off-site one, the PDC. Thanks. Sven -----Original Message----- From: Gerald (Jerry) Carter [mailto:jerry@samba.org] Sent: Thursday, May 22, 2003 10:19 PM To: SRuth@LANDAM.com Cc: samba@lists.samba.org Subject: Re: [Samba] Inefficient Winbind behavior? Not sure if it posted 1st time. -----BEGIN PGP SIGNED MESSAGE----- Hash: SHA1 On Wed, 14 May 2003 SRuth@LANDAM.com wrote: > Shouldn't winbindd use the local DC? Can I configure it to do so? I'm > fairly convinced that authenticating over the WAN link is causing...

While doing some performance testing with the new version of pqR (see pqR-project.org), I've encountered an extreme, and quite unnecessary, inefficiency in the current R Core implementation of R, which I think you might want to correct. The inefficiency is in access to columns of a data frame, as in expressions such as df$col[i], which I think are very common (the alternatives of

dear R experts--- t <- 1:30 f <- function(t) { cat("f for", t, "\n"); return(2*t) } g <- function(t) { cat("g for", t, "\n"); return(3*t) } s <- ifelse( t%%2==0, g(t), f(t)) shows that the ifelse function actually evaluates both f() and g() for all values first, and presumably then just picks left or right results based on t%%2.

..., 02:07:55 Uhr Betreff: Re: [LLVMdev] FoldingSetNodeID operations inefficiency On Wed, 23 Apr 2008, Roman Levenstein wrote: > Hi, > > While profiling LLVM using my test-cases with huge MBBs, I noticed that > FoldingSetNodeID operations (ComputeHash,insertion,etc) may become > really inefficient for the nodes, which have very many operands. Here is a stupid idea, which is simple and probably really effective: This only affects you because you have 3200 operands to your TF node. This only affects TF because TF can take an arbitrary number of operands, and we fold TFs together arbitraril...

The current vsock code for removal of socket from the list is both subject to race and inefficient. It takes the lock, checks whether the socket is in the list, drops the lock and if the socket was on the list, deletes it from the list. This is subject to race because as soon as the lock is dropped once it is checked for presence, that condition cannot be relied upon for any decision. It is also...

The current vsock code for removal of socket from the list is both subject to race and inefficient. It takes the lock, checks whether the socket is in the list, drops the lock and if the socket was on the list, deletes it from the list. This is subject to race because as soon as the lock is dropped once it is checked for presence, that condition cannot be relied upon for any decision. It is also...

...2 secs per call (so that would make roughly 0.00012*channels*frames extra encoding time for an audio file). Despite I've re-re-rechecked my code and I haven't found anything strange, I don't discard at all that may be there are some algorithmic errors left that may make my code be a bit inefficient, but making 2 secs go to 2 mins is quite alarming and far away from permissible. Supposing I have no important algorithmic errors, could this excessive overload be caused by a compiling issue? (that wouldn't surprise me, as my knowledge about autoconf/automake/make scripts is quite basic...)....

Hello Ralph, many thanks for your fast reply and help with this issue! :-) Am 31.08.2017 um 15:43 schrieb Ralph Böhme: > On Thu, Aug 24, 2017 at 03:37:07PM +0200, awl1 via samba wrote: >> Before I follow your advice to move this whole issue/topic to the >> samba-technical alias and start over there with a clean description of the >> scenario and the findings, I have two

Dear all, I am relatively new to R. I would like to know how can we write the realizations (for example generated through rnorm or runif) in to a data file. It would be very inefficient to first generate values and then write them in to file using "write" function. Instead, is there a way to generate 1 value at a time and append them in to the file. The question might be trivial to many experts. I appreciate your help. Thank you -- View this message in context: http:/...

Hi, Recently added to doc/NEWS.Rd: 'R CMD check' now gives a warning rather than a note if it finds inefficiently compressed datasets. With 'bzip2' and 'xz' compression having been available since R 2.10.0, there is no excuse for not using them. Why isn't a note enough for this? Generally speaking, warnings are for things that are dangerous, or unsafe, or unportable, or for anyth...

https://bugzilla.netfilter.org/show_bug.cgi?id=1426 Bug ID: 1426 Summary: Inefficient command lookup on errors Product: nftables Version: unspecified Hardware: x86_64 OS: All Status: NEW Severity: enhancement Priority: P5 Component: nft Assignee: pablo at netfilter.org Report...