similar to: Recoding -- test whether number begins with a certain number

Displaying 20 results from an estimated 1000 matches similar to: "Recoding -- test whether number begins with a certain number"

2009 Sep 03
5
abind, but on lists?
I'm trying to massage some data from Matlab into R. The matlab file has a "struct array" which when imported into R using the R.matlab package, becomes an R list with 3+ dimensions, the first of which corresponds to the structure fields, with corresponding row names, and the second and third+ dimensions correspond to the dimensions of the original struct array (as matlab
2008 Sep 08
13
list corner case
I'm curious how people think the following *should* be interpreted: - one 2. two http://babelmark.bobtfish.net/?markdown=-++one%0D%0A2.+two%0D%0A%0D%0A As you can see, implementations split into three groups here: (a) treat as an unordered list Markdown.pl, Python markdown, MultiMarkdown, BlueCloth, MarkdownJ, Showdown (b) treat as an unordered list with an ordered
2006 May 02
2
Bug: invalid nesting of inline markup across link labels
Hi John, there?s a bug in Markdown.pl: [foo*bar](#) [baz*quux](#) This expands to the following: <p><a href="#">foo<em>bar</a> <a href="#">baz</em>quux</a></p> Those `*` should either be disregarded or the tags should nest correctly: 1. <p><a href="#">foo*bar</a> <a
2012 Dec 19
4
How to convert xts data into list
Hello, How can I convert Close colume of the below xts time series data into a list of Close values ? I'd like to plot Close values as a list. &gt; head(zc) Close (10/15/12 09:00:00) 252.40 (10/15/12 09:01:00) 253.10 (10/15/12 09:02:00) 253.15 (10/15/12 09:03:00) 253.30 (10/15/12 09:04:00) 253.25 (10/15/12 09:05:00) 253.45 I tried the below command to plot it.
2015 Mar 03
5
[LLVMdev] Inline Assembly: Memory constraints with offsets
Hi, I'm trying to implement the ZC inline assembly constraint for Mips. This constraint is a memory constraint that expands to an address with an offset (the range of the offset varies according to the subtarget), so the inline assembly in: int data[10]; void ZC(void) { asm volatile ("foo %0 %1" : : "ZC"(data[1]), "ZC"(data[2])); } Should expand to
2004 Aug 19
1
The 'test.terms' argument in 'regTermTest' in package 'survey'
This is a question regarding the 'regTermTest' function in the 'survey' package. Imagine Z as a three level factor variable, and code ZB and ZC as the two corresponding dummy variables. X is a continuous variable. In a 'glm' of Y on Z and X, say, how do the two test specifications test.terms = c("ZB:X","ZC:X") # and test.terms = ~ ZB:X + ZC:X in
2013 Apr 02
2
How to remove all characters after comma in R
I have the following list of strings: x <- c("foo, foo2, foo3", "bar", "qux, qux1") what I want to do is to obtain foo, bar qux Namely for each element in the vector obtain only string before the first comma. What's the way to do it? - G.V. [[alternative HTML version deleted]]
2007 May 26
2
polygon error?
Hi.. I'm not sure why polygon returns an area above the standard normal curve. z <- pretty(c(-3,3), 100) ht <- dnorm(z) data <- data.frame(z=z, ht=ht) zc <- 1.645 plot(data, type="l") lines(data) t <- subset(data, z>zc) polygon(t, col="red") Thanks, Lance [[alternative HTML version deleted]]
2008 Sep 09
3
Splitting Data Frame into Two Based on Source Array
Dear all, Suppose I have this data frame: > data_main V1 V2 foo 13.1 bar 12.0 qux 10.4 cho 20.33 pox 8.21 And I want to split the data into two parts first part are the one contain in the source array: > src [1] "bar" "pox" and the other one the complement. In the end we hope to get this two dataframes: > data_child1 V1 V2 bar 13.1 pox
2009 Jan 08
2
Faster Printing Alternatives to 'cat'
Dear all, I found that printing with 'cat' is very slow. For example in my machine this snippet __BEGIN__ # I need to resolve to use this type of loop. # because using write(), I need to create a matrix which # consumes so much memory. Note that "foo, bar, qux" object # is already very large (>2Gb) for ( s in 1:length(x) ) {
2012 Jan 18
7
[LLVMdev] [RFC] Module Flags Metadata
Hello, This is a proposal for implementing "module flags". Please take a look at this and give any feedback you may have. Thanks! -bw Module Flags Metadata Information about the module as a whole is difficult to convey to LLVM's subsystems. The LLVM IR isn't sufficient to transmit this information. One should instead use the llvm.module.flags named
2011 Feb 14
3
help with aggregate()
Hi, I am trying to aggregate some data and I am confused by the results. I load a data frame "all" from a csv file, and then I do: (FOO,BAR,X,Y come from the header line in the csv file, BTW, how do I rename a column?) byFOO <- aggregate(list(all$BAR,all$QUUX,all$X/all$Y), by = list(FOO=all$FOO), FUN = mean); I expect a data frame with 4
2012 Dec 18
1
How to draw frequency domain plot with xts time series data
Hello, I'd like to convert the below time-series data with fft or wavelet related function and plot it. Could you let me know 1. How to convert xts data frame format to list format ? 2. How to plot fft or wavelet diagram ? Here is the data : &gt; class(zc) [1] "xts" "zoo" &gt; str(zc) An ‘xts’ object from (10/15/12 09:00:00) to (10/15/12 15:15:00)
2005 May 21
2
Possible (ab)use of lexical scoping in R ?
Dear list, I wish to define a set of functions *auxilliary* to another set of "main" ones, and I wonder if there is some "clever" way do do this using lexical scoping. Looking for that in the list's archives did not get me easily understood answers. Perusing MASS (1st, 2nd, 3rd and 4th editions!) and "Programming S" wasn't of much help either... R easily
2015 Mar 04
2
[LLVMdev] Inline Assembly: Memory constraints with offsets
> -----Original Message----- > From: llvmdev-bounces at cs.uiuc.edu [mailto:llvmdev-bounces at cs.uiuc.edu] > On Behalf Of Krzysztof Parzyszek > Sent: 03 March 2015 14:35 > To: llvmdev at cs.uiuc.edu > Subject: Re: [LLVMdev] Inline Assembly: Memory constraints with offsets > > On 3/3/2015 6:01 AM, Daniel Sanders wrote: > > Hi, > > > > I'm trying to
2007 Oct 26
2
[LLVMdev] RFC: llvm-convert.cpp Patch
Hi all, The patch below is to fix a problem with unaligned memcpys. This program: void Bork() { int Qux[33] = {0}; } will currently produce this LLVM code on PPC64: @C.0.937 = internal constant [33 x i8] zeroinitializer define void @Bork() { entry: %Qux = alloca [33 x i8] %Qux1 = bitcast [33 x i8]* %Qux to i8* call void @llvm.memcpy.i64( i8* %Qux1, i8* getelementptr ([33 x i8]*
2016 Mar 18
4
Redundant load in llvm's codegen compares to gcc when accessing escaped pointer?
1. Same question as David, why &c - 8 is invalid? Is it related to below statements In C99 standard? 6.5.3.3: "Among the invalid values for dereferencing a pointer by the unary * operator are a null pointer, an address inappropriately aligned for the type of object pointed to, and the address of an object after the end of its lifetime." 2. We are trying to preserve 1st load and
2019 Dec 05
2
Maybe bug? Using non-integer frequencies in stats::ts
On 05/12/2019 11:00 a.m., Johann R. Kleinbub wrote: > It's been three months without an answer, is it ok to thread bump? > Would someone provide a pointer? I agree it's a bug, and agree with your analysis. You should report it on bugs.r-project.org. (If you don't have an account there, let us know, and either someone will give you one, or someone will report it for you.)
2007 Nov 07
7
[LLVMdev] RFC: llvm-convert.cpp Patch
Hi all, This patch is to fix a problem on PPC64 where an unaligned memcpy is generated. The testcase is this: $ cat testcase.c void Qux() { char Bar[11] = {0}; } What happens is that we produce LLVM code like this: call void @llvm.memcpy.i64( i8* %event_list2, i8* getelementptr ([11 x i8]* @C.103.30698, i32 0, i32 0), i64 11, i32 8 ) Notice that it has an 8-byte alignment. However, the Bar
2020 Jul 21
2
DW_OP_implicit_pointer design/implementation in general
Realized I didn't document the original reviews that motivated this thread: A stack of reviews, split off from here: https://reviews.llvm.org/D69787 Alok's posted a new patch (with smaller patches split off from the monolithic one) here: https://reviews.llvm.org/D84112 I haven't had a chance to page in all the old context, nor look at the new ones in detail yet. But probably worth