Displaying 20 results from an estimated 2000 matches similar to: "creating chron object aggregates (e.g. sums by day)"
2007 Nov 06
0
[LLVMdev] Passing and returning aggregates (who is responsible for the ABI?)
> I'm trying to port the XL compiler (http://xlr.sf.net) to use the
> LLVM back-end. So far, little trouble doing so. But there is one
> aspect of the semantics of the LLVM IR that surprises me. Why are the
> call, declare and define "halfway through" ABI conventions?
Hrm?
> I think it's the right thing to have a single high level node for
> each call, as
2012 Jan 19
8
sumarizar
*Hola!!! resulta que tengo unos datos de divisas ordenados por fechas
(días) los que he convertido a formato tipo YYYY-MM-DD donde DD siempre es
01:*
*
*
*
EUR.resto$date<-as.Date(EUR.resto$date)
EUR.resto$mo <- substr(EUR.resto$date,6,7)
EUR.resto$yr <- substr(EUR.resto$date, 1,4)
2007 Nov 06
1
[LLVMdev] Passing and returning aggregates (who is responsible for the ABI?)
On 6 nov. 07, at 06:17, Chris Lattner wrote:
>> But then, why refuse aggregates as input or output of a call? What is
>> the rationale?
>
> Because LLVM has no notion of aggregates as "values" that can be
> passed around as atomic units. This is a very important design point,
> and has many useful values.
I see. You explained one of them in a message on the XL
2007 Nov 06
4
[LLVMdev] Passing and returning aggregates (who is responsible for the ABI?)
Hello,
I'm trying to port the XL compiler (http://xlr.sf.net) to use the
LLVM back-end. So far, little trouble doing so. But there is one
aspect of the semantics of the LLVM IR that surprises me. Why are the
call, declare and define "halfway through" ABI conventions?
I think it's the right thing to have a single high level node for
each call, as opposed to separate
2003 Mar 06
0
loop avoiding on time interval intersects
I am trying to optimize some code to take advantage of R loop-avoiding
capabilities when working on vectors/arrays that contain time intervals.
The calculation involves adding (for each time interval) the time portion
(of events defined by their start and end times) that elapsed during time
intervals.
Any advice on how to improve this code. I searched the email archive and
looked at the MASS
2013 Nov 07
1
problem with interaction in lmer even after creating an "interaction variable"
Dear all,
I have a problem with interactions in lmer. I have 2 factors (garden and
gebiet) which interact, plus one other variable (home), dataframe arr. When
I put:
/
lmer (biomass ~ home + garden:gebiet + ( 1|Block), data = arr)/
it writes:
/Error in lme4::lFormula(formula = biomass ~ home + garden:gebiet + (1 | :
rank of X = 28 < ncol(X) = 30/
In the lmer help I found out that if not
2008 Jul 23
3
[LLVMdev] Structs as first class values.
On Tuesday 22 July 2008 01:23, Chris Lattner wrote:
> David, I'm not sure I follow. It is, of course, very important for us
> that llvm-gcc generate ABI compliant code on x86-64. I'm just saying
> that if struct-return does not provide the ABI required for a specific
> source construct that another lowering would be needed.
Ah, ok. I misunderstood your statement.
> In
2008 Jul 23
0
[LLVMdev] Structs as first class values.
On Jul 23, 2008, at 9:05 AM, David Greene wrote:
>> In the case of X86-64, llvm-gcc does use aggregate return (for the
>> interesting cases which return things in registers) and it does do
>> the
>
> I don't follow. By "aggregate return" do you mean "structs as first
> class
> values?" That is, llvm-gcc generates a return of a struct by
2004 Jun 28
1
R client connection OLAP cube (SQL Analysis Services / PivotTable Service)
I have been doing data analysis/modeling in R, connecting to SQL databases
with RODBC (winXP client with R1.9.0 and win2k SQL server 2000).
I am now trying to leverage some of the OLAP features to keep the data
intensive tasks on the DB server side and only keep the analytical tasks
within R (optimize use of memory). Is there any package that would allow to
connect to OLAP cubes (as a client
2003 Feb 14
3
Change array size
Hi,
I would like to know if there is a way to change a vector of arbitrary size
to make it fits the nearest upper size multiple of a power of 2.
--
Cordialy
----------------------------------------
Emmanuel POIZOT
Cnam/Intechmer
Digue de Collignon
50110 Tourlaville
T?l : (33)(0)2 33 88 73 42
Fax : (33)(0)2 33 88 73 39
-----------------------------------------
2003 Nov 19
5
ISOdate returns incorrect date?
Dear all,
I have found the following (for me) incomprehensible behaviour of
ISOdate (POSIXct):
> ISOdate(1900,6,16)
[1] "1900-06-15 14:00:00 Westeurop?ische Sommerzeit"
> ISOdate(1950,6,16)
[1] "1950-06-16 14:00:00 Westeurop?ische Sommerzeit"
Note that in the first case I get the 15th of June back, not the 16th as
I would have expected!
This happened under R-1.7.1 on
2012 Jun 08
3
day of the year for chron objects
Hi!
Is not there an standard R function to retrieve the day of the year
(since 1st Jan of the same year)?
I know I can make my own using julian, but find it weird that having
days(), months() etc doy() does not exist as an standard function.
Also, is the following not a bit inconsistent?
> a <- chron("20100506",format="ymd")
> a
[1] 100506
> years(a)
[1] 2010
2003 Nov 14
5
ISOdate() and strptime()
Dear R-people!
I am using R 1.8.0, under Windows XP.
While using ISOdate() and strptime(), I noticed the following behaviour when
"wrong" arguments (e.g., months>12) are given to these functions:
> ISOdate(year=2003,month=2,day=20) #ok
[1] "2003-02-20 13:00:00 Westeurop?ische Normalzeit"
> ISOdate(year=2003,month=2,day=30) #wrong day, but returns a value
[1]
2007 Mar 22
2
difftime / RBloomberg
hi,
I've troubles with some difftime objects. e.g.
ISOdate(2001, 4, 26) - ISOdate(2001, 2, 26) - 2
works, telling me "Time difference of 57 days". But when I'd like to add
days, such as
ISOdate(2001, 4, 26) - ISOdate(2001, 2, 26) + 2
the function gives me an error. Function "as.COMDate.chron" of the
Rbloomberg package doesn't work for that reason.
I'm
2015 Mar 08
2
[LLVMdev] Optimizing out redundant alloca involving byval params
errata: I am on 3.6 full stop. I *thought* there was a 3.7 available, based
on the title of http://llvm.org/docs/ ("LLVM 3.7 documentation"). I suppose
the docs are ahead of the release schedule?
On Sun, Mar 8, 2015 at 9:44 AM Mircea Trofin <mtrofin at google.com> wrote:
> Sorry, that phase is part of the PNaCl toolchain. This would be LLVM 3.6,
> would your comments still
2012 May 08
2
How to deal with a dataframe within a dataframe?
Hello all,
I am doing an aggregation where the aggregating function returns not a
single numeric value but a vector of two elements using return(c(val1,
val2)). I don't know how to access the individual columns of that
vector in the resulting dataframe though. How is this done correctly?
Thanks, robert
> agg <- aggregate(formula=df$value ~ df$quarter + df$tool,
+ FUN=cp.cpk,
2009 Mar 30
3
Calculating First Occurance by a factor
I'm having difficulty finding a solution to my problem that without using a
for loop. For the amount of data I (will) have, the for loop will probably
be too slow. I tried searching around before posting and couldn't find
anything, hopefully it's not embarrassingly easy.
Consider the data.frame, Data, below
Data
Sub Tr IA FixInx FixTime
p1 t1 1 1 200
p1 t1 2
2008 Aug 12
2
perl expression question
I have a string such as
fileName<-"Agg.20.20.20-all-01".
All I want to do is pull the "20.20.20" and the "all" as strings.
Obviously, they aren't always those values.
The "20.20.20" can be "30.30.30" but it's always after the . which is
next to the second g in Agg and it's always the same length. The all
might not always be
2008 Jul 16
3
[LLVMdev] GEP::getIndexValid() with other iterators
Hi all,
currently, GetElementPtrInst has a method getIndexedType, which has a
templated variant. You pass in a begin and an end iterator, and it will find
the indexed type for those. However, both iterators must iterate over Value*.
For some argpromotion code, I would like to pass in iterators that iterate
over unsigneds instead of Value*. I currently solve this by transforming my
2011 Oct 06
2
[LLVMdev] A potential bug
Hi all,
There might be a bug in DeadStoreElimination.cpp. This pass eliminates
stores backwards aggressively in an end BB. It does not check dependencies
on stores in an end BB though. For example, in this code snippet:
...
1. %sum.safe_r47.pre-phi = phi i64* [ %sum.safe_r47.pre,
%entry.for.end_crit_edge ], [ %sum.safe_r42, %for.body ]
2. %call9 = call i32 @gettimeofday(%struct.timeval* %end,