search for: reframer

I think Robin knows about FAQ 7.31/floating point (author of 'Brobdingnag', among other numerical packages). I agree that this is surprising (to me). To reframe this question: is there way to get an *exact* ASCII representation of a numeric value (i.e., guaranteeing the restored value is identical() to the original) ? .deparseOpts has ?"digits17"?: Real and finite complex

Reframing and Reposting my earlier query: My target has 16-bit registers for indirect address of data. All other registers are 8-bit. Therefore I have added regclasses for i8 and i16 types. All arithmetic operations (including pointer arithmetic ) are 8-bit operations. The problem is that LLVM does not expand i16 operations to i8 operations in presence of i16 regclass. What is the best way to

Devang, Let me reframe my question.I require to keep this extra information as a structure so as to pass it around to other functions which require it. Specifically I am working on CellBE and wish to DMA this information to the SPEs The way of adding the information by PHI nodes will not suffise since the information may be very large in some cases which will need to be transfered by a DMA rather

On Sat, 11 Mar 2023 11:11:06 -0500 Duncan Murdoch <murdoch.duncan at gmail.com> wrote: > That's clear, but your proposal violates a very basic property of the > language, i.e. that all statements are expressions and have a value. How about reframing this feature request from multiple assignment (which does go contrary to "everything has only one value, even if it's

I have a problem that surfaced in my attempt to upgrade my application to Rails 1.1. We have a STI model on the "belongs_to" side of a has_many/belongs_to relationship. All my unit tests for this model pass, and the relationships all seem to work fine. But in my functional tests, I''m getting errors. I''ve traced it back into the call to the has_many

Hello all, Ive got Mac OS X Leopard (10.5.8), ruby 1.8.6 (2009-06-08 patchlevel 369) [universal-darwin9.0] and mysql 5.0.67 installed and working fine with Rails 2.1.0. "which ruby" outputs /usr/bin/ruby. I can see the mysql symlink in / usr/local/mysql. I can also see the mysql-5.0.67-osx10.5-x86 folder in /usr/local . Im trying to upgrade my Rails apps to 2.3.5 but when i try to

----- Forwarded Message ----- From: vramaiah at neo.tamu.edu To: "bernhard pfaff" <bernhard.pfaff at pfaffikus.de> Sent: Friday, November 11, 2011 9:03:11 AM GMT -06:00 US/Canada Central Subject: Use of R for VECM Hello Fellow R'ers I am a new user of R and I am applying it for solving Bi-Variate (Consumption and Output) VECM with Co-Integration (I(1)) with three lags on

Thanks guys, I guess I should have referred to FAQ 7.31 (which I am indeed very familiar with) to avoid misunderstanding. I have always used dput() to clarify 7.31-type issues. The description in ?dput implies [to me at any rate] that there will be no floating-point roundoff in its output. I hadn't realised that 'deparsing' as discussed in dput.Rd includes precision roundoff issues.

On Tue, Oct 13, 2015 at 2:45 PM Philip Reames <listmail at philipreames.com> wrote: > +1 to the general idea of a CoC > > A couple of specific thoughts: > > 1) It would have been nice for this not to appeared out of thin air. In > an ideal world, a previous update would have mentioned ongoing thought and > research in this area. > Well, water and bridge and all. =/

On 11/03/2023 11:57 a.m., Ivan Krylov wrote: > On Sat, 11 Mar 2023 11:11:06 -0500 > Duncan Murdoch <murdoch.duncan at gmail.com> wrote: > >> That's clear, but your proposal violates a very basic property of the >> language, i.e. that all statements are expressions and have a value. > > How about reframing this feature request from multiple assignment >

On 02/03/2020 3:24 a.m., Martin Maechler wrote: >>>>>> robin hankin >>>>>> on Sun, 1 Mar 2020 09:26:24 +1300 writes: > > > Thanks guys, I guess I should have referred to FAQ 7.31 > > (which I am indeed very familiar with) to avoid > > misunderstanding. I have always used dput() to clarify > > 7.31-type

I'm having a issue with build libThusnelda 20081201,video is blocky, you can clearly see video is blocky in some parts of the video. the Bit rate is high so what is the problem is, on x264 this type of Bit rate will make the video very smooth. can anybody tell me how to get that smooth video and what settings can i use, I'm interested in the advanced usage of Thusnelda with two pass

Thanks Duncan and Ivan for the careful thoughts. I'm not sure I can follow all aspects you raised, but to give my limited take on a few: > your proposal violates a very basic property of the language, i.e. that all statements are expressions and have a value. > What's the value of 1 + (A, C = init_matrices()). I'm not sure I see the point here. I evaluated 1 + (d =

sorry about the delay... this it the first I'm seeing the message, maybe it got stuck in moderation because of the cross posting. --- Christian HJ Wiesner <chris@matroska.org> wrote > I was wondering how suitable both are with respect to video editing, > especially if it comes to sample precise cutting. What is the > absolute minimal number of samples per frame in a FLAC

On 29/02/2020 4:19 a.m., Ben Bolker wrote: > > I think Robin knows about FAQ 7.31/floating point (author of > 'Brobdingnag', among other numerical packages). I agree that this is > surprising (to me). > > To reframe this question: is there way to get an *exact* ASCII > representation of a numeric value (i.e., guaranteeing the restored value > is identical()

Hi R Gurus: Here is some code that I was experimenting with, please: > f1 <- function(x) { + e1 <- new.env(parent=.GlobalEnv) + environment(e1) + print(environment()) + return(mean(x)) + } > f1(1:15) <environment: 0x02525444> [1] 8 > My question: why isn't the environment within the function set to e1, please? Thanks, Edna Bell

Has anyone figured out a way to instantaneously swing over PRIs bearing calls in progress to another media gateway without dropping them? Obviously, this would require a DACS of some sort. But I am thinking that it is possible to swing T1s over in a DACS without actually causing the endpoint to reframe as long as the other endpoint is kept in sync. So, it'd be nice, for example, to bring

After reading the recent thread [http://www.xiph.org/archives/vorbis/200211/0057.html] on the vorbis list about bitrate peeling, I was wondering if it would be possible for xiph.org to post a specification, outline, flowchart, or a drawing on a napkin of what the basic operations of bit peeling would entail. If there was some sort of starting point, then it may be a little more inviting for

Hi, I'm trying to put together an * system with extremely high up time. The system as it stands now is 1 dual p4 with raid, redundant power, etc.. and a T100P card. I would like to get a second similar or identical box with another T100P card. I have 1 PRI, how do I get the second box to take over communication with the PRI should the first box fail? Of course I'd like this to be

On Wed, Apr 22, 2009 at 12:10 AM, Kshitiz Garg <ksh.cseiitk at gmail.com> wrote: > Hello, >     I wanted to do some speculative execution on a loop for which I > require some data storage structure for book keeping. The exact > structure of this storage buffer can only be determined after loop > analysis. Is there a clean way to add this new structure to the > module. Since