search for: misstate

...llvm-dev <llvm-dev at lists.llvm.org> wrote: > That's what I said. The cmake based build system needs it. LIT is > optional. It is entirely feasible to have a custom build system and no > Python at all. It would be quite painful to break that. To be explicit (and correct me if I misstate facts), NetBSD wants to build Clang with minimal dependencies because it's the system compiler. And so it completely replaces our build system with something not far removed from a hard-coded set of build steps to eliminate CMake/make/ninja (maybe you allow make?). Tests are not run (at that st...

...t help change that. I couldn't agree with you more - I've said it *many* times myself. :) Look, people seem to be getting the impression that I'm entirely satisfied with the current situation, or opposed to a new metadata format. That's not the case. I was just correcting some misstatements re: vorbis comments. -- -:-:- David K. Gasaway -:-:- Email: dave@gasaway.org -:-:- Web : dave.gasaway.org

> Hello syslinux, > > Merry Christmas! These patches will make extlinux work with umounted > ext2/3/4 filesystem, for example: > > $ extlinux -i /dev/sdXN > or > $ extlinux -i file_block > > Also it can work with something like: > $ extlinux /dev/sdXN --reset-adv > or > $ extlinux file_block --reset-adv > Thank you. The 'extlinux' command

On Fri, 16 Nov 2018 at 00:35, Bruce Hoult <brucehoult at sifive.com> wrote: > Yes, I'd expect only a tiny fraction of commits to change the interface between say, clang and llvm in an incompatible way, but where they do it's essential to get both sides at the same time if you want to to have every commit buildable for things such as bisection or incremental rebasing (as I think

...is that, because C ABI changes are painful, and processors may introduce larger atomic operations in the future, we should try to design the atomics implementation in such a way that it can take advantage of future instruction sets without needing an ABI change. The other argument (apologies if I misstate this) is that atomics larger than 2 pointers aren't useful, so we shouldn't make anything more expensive than today's implementation needs, just to support hypothetical instructions that processors may never implement. If any of the processor designers on this list want to chime in, t...

...become addrspace(1) SSA values and be handled correctly by the relocation logic. I can't answer the merging question above. There are entirely sane semantics which could be assigned to stack allocation merging, but I'm not sure what expectations the CLR GCs have. Swaroop - If I've misstated anything above, please correct me. > > Ultimately, to make this change, you'll also need to change a decent > amount of code in the optimizer that will blindly create stack > allocations in address space zero. > > Without a better understanding of both the motivation and t...

Rowland, thank you for the reply. I must have misstated. We have successfully setup our first DC. It works great with DHCP and BIND9_DLZ and updates nicely as it is designed to, kerberos and all. The question is about the second server. Perhaps MY understanding of what I have read on the samba wiki, and others, is different than actual reality. ht...

On 10 Sep 2007 at 18:42, Ian Malone wrote: > Classical music is a rich source of examples; works are > most often associated with a composer but you may still > care who the performers or conductors were. A piece may > be split across several movements which may be even further > broken down into tracks on the source. This things are easily solved with vorbis comments ...

...oral science to 86%, far more than the 30% to 70% reported in some analyses. ?Editors no longer have confidence in the reliability of the findings and conclusions reported in this article,? the journal said in a retraction note published yesterday. ?The concerns relate to lack of transparency and misstatement of the hypotheses and predictions the reported metastudy was designed to test; lack of preregistration for measures and analyses supporting the titular claim (against statements asserting preregistration in the published article); selection of outcome measures and analyses with knowledge of the...

On Thursday 01 May 2008 19:14, Jonathan S. Shapiro wrote: > On Thu, 2008-05-01 at 12:00 -0500, David Greene wrote: > > On Wednesday 30 April 2008 21:21, Chris Lattner wrote: > > > > > If LLVM is able to eliminate all users of the malloc assuming the > > > malloc succeeded (as in this case), then it is safe to assume the malloc > > > returned success. >

Dear R-helpers, I'm trying to selectively swap labels between two factors, depending on an indicator variable i. Can you point me to a solution, and perhaps how I could have found it? labels(fact1) is a character vector of r row numbers levels(fact1) is a character vector of the n < r unique levels How do I then get the character vector of length r of the levels of fact1? Once I have

Hello I want to predict the future values of time series with Garch When I specified my model like this: library(fGarch) ret <- diff(log(x))*100 fit = garchFit(~arma(1,0,0)+garch(1, 1), data =ret) predict(fit, n.ahead = 10) meanForecast meanError standardDeviation 1 0.01371299 0.03086350 0.03305819 2 0.01211893 0.03094519 0.03350248

If one makes the reasonable assumption that Pct is much larger than Cutoff, sorting Cutoff is the expensive part e.g O(nlog2(n) for Quicksort (n = length Cutoff). I believe looping is O(n^2). Jeff's approach using findInterval may be faster. Of course implementation details matter. -- Bert On Mon, Oct 16, 2023 at 4:41?AM Leonard Mada <leo.mada at syonic.eu> wrote: > > Dear

Since rsync can now be configured with a different default remote shell than "rsh", I think the docs should be updated a bit. Anyone object to these changes? (Note that I also fixed the misstatement that ssh prefers blocking IO.) ..wayne.. ---8<------8<------8<------8<---cut here--->8------>8------>8------>8--- Index: options.c --- options.c 2002/05/03 22:59:17 1.93 +++ options.c 2002/05/03 23:28:47 @@ -230,7 +230,7 @@ rprintf(F," --no-whole-file...

Hello everybody, In order to predict income for different time points, I fitted a linear model with polynomial effects using BMA (bicreg(...)). It works fine, the results are consistent with what we are looking for. Now, we would like to predict income for a future time point t_next and of course draw the prediction interval around the estimated value for this point t_next. I've found the

Am Fr., 5. Juli 2019 um 07:01 Uhr schrieb Joerg Sonnenberger via llvm-dev <llvm-dev at lists.llvm.org>: > > On Fri, Jul 05, 2019 at 10:43:12AM +0000, Simon Tatham via llvm-dev wrote: > > But before I do that, I wanted to check whether there would be any > > objection on grounds of build dependencies. Is it acceptable to require Python > > as part of the normal build

In trying to use as.Date(), I've come across the conversion of POSIXlt to POSIXct when a POSIXlt variable is included in a data frame: my_POSIX <- strptime(c("11-09-2006", "11-10-2006", "11-11-2006", "11-12-2006", "11-13-2006"), "%m-%d-%Y") str(my_POSIX) my_Date <- as.Date(my_POSIX) str(my_Date) data <- format(my_Date)

Dear R-help, I am looking for ideas and presentations of new and advanced data visualization methods. As an example of what I am searching for, the 'Many Eyes' pages at http://manyeyes.alphaworks.ibm.com/manyeyes/ may provide a good paradigm. I would be interested even if it will not be easy to implement such examples in R, e.g. because of the interactive nature of these graphical

Dear group, I am trying to prepare a NONMEM friendly dataset for population PK analysis. My patient IDs are 10 digit long and NONMEM is losing precison and rouding the last couple of digits. I need to generate unique Patient IDs fromt he current 10-digit IDs. Ihave total 250 subjects so I appreciate if anybody can suggest me a way to code this in R. Regards, Ayyappa [[alternative HTML

Dear R-helpers, I have a huge data-set so need to avoid for loops as much as possible. Can someone think how I can compute the result in the following example (that uses a for-loop) using some version of apply instead (or any other similarly super-efficient function)? example: #Suppose a matrix: m1=cbind(1:5,1:5,1:5) #The aim is to create a new matrix with every column containing the