similar to: [LLVMdev] Named metadata to represent language specific logic

dear R experts: has someone written a function that returns the results of by() as a data frame? ??of course, this can work only if the output of the function that is an argument to by() is a numerical vector. presumably, what is now names(byobject) would become a column in the data frame, and the by object's list elements would become columns. it's a little bit like flattening the by()

Hi. I get this error: ** ActiveRecord::ReadOnlyRecord ** When i try to update a table called characters_learning_abls that is a habtm relation between characters and learning_abls. The characters_learning_abls table looks like this: ** character_id int(11) unsigned learning_abls_id int(11) unsigned amount double ** Why cant i update this table though the **

I have some security alert log data that I'm parsing and doing some stats on. One of the fields is the "Classtype" which is the enumerated value of the type of alert found. classtypes = factor( alerts$Classtype ) fclass_types = table( classtypes ) fclass_types gives me a frequency table of the intrusion types: fclass_types classtypes

To Whom It May Concern: My name is Daniel DaCosta. I am a first year PhD Student at the University of Minnesota. I am working with the Programming Languages group at UMN. I am interested in type theory and logic based languages, including both practical and theoretical applications. I am inquiring about a proposal that would involve either toolchain extensions or proof of concept implementation

In this story from Dan''s Game of Life: Scenario: the grid has three cells Given 3 x 3 grid When I create a cell at 0, 0 And I create a cell at 0, 1 And I create a cell at 2, 2 Then the grid should look like: XX. ... ..X How do you set up matchers for the grid at the end. Are all the indented lines after a Then passed to the Then matcher as separate

Dear Jari Oksanen, I am Trinadh Kumar, a student of Biotechnology from Texas Tech University. I have a question for you regarding constrained ordination graphs. I had previously plotted constrained ordination graphs using distance based redundancy analysis for species data on patients. The species matrix consists of 70 patients and 274 species of bacteria.The metadata matrix consists of 10

I only concern about the boundary of the shape and I don¡¯t concern gray level. U[m] = x[m] + jy[m] m= 0,1,¡­,N-1 is the N points on the boundary. It is easy to express U as a discrete Fourier series. But it seems like that wd in the wavethresh package cannot deal with complex values. And it is not interesting to transfer U to a matrix. Thanks a lot Qin

Hello, I need to calculate the centroids of some spatial polygons that I have placed into a Polygons-class object. Is the labeling point in the Polygons-class the centroid of the polygon? Thank you for your help.

Greetings, I implemented a proof of concept of something I'm calling "error return traces" in my frontend (screenshot and explanation at this link): https://github.com/zig-lang/zig/pull/684 Now I'm trying to minimize the runtime size. Here's some example IR that I generate: define internal fastcc i16 @baz1(%StackTrace* nonnull) unnamed_addr #2 !dbg !69 { Entry: %1 =

On 2018-05-11 02:28, Andrew Kelley via llvm-dev wrote: > In the Zig frontend, we know at compile-time the entire call graph. > This means we know stack size for all functions and therefore the > upper bound stack usage. > > [snip] > 1. Is there a way to accomplish this with existing LLVM API? You should use the @llvm.stacksave and @llvm.stackrestore intrinsic. It is only legal

On Thu, May 10, 2018 at 10:35 PM, whitequark <whitequark at whitequark.org> wrote: > On 2018-05-11 02:28, Andrew Kelley via llvm-dev wrote: > >> In the Zig frontend, we know at compile-time the entire call graph. >> This means we know stack size for all functions and therefore the >> upper bound stack usage. >> >> [snip] >> 1. Is there a way to

On 05/30/13 17:33, vonNieda, Adam (USMS) wrote:> Hi folks, first post J > > I’m running Redhat 6 x64 with ibvirt-0.10.2-18 and > qemu-img-rhev-0.12.1.2-2.355 > > My question is, if I do something like the following.. > > [root@testbox ~]# virsh snapshot-list STIGtest > > Name Creation Time State > >

On Fri, Jan 9, 2009 at 5:40 PM, Evan Cheng <evan.cheng at apple.com> wrote: > The difference seems innocent enough. However, in objc if the zero- > sized string is part of a cfstring, it causes a problem. The linker > expects it in the readonly __cstring section, but llvm puts it in the > read / write bss section. That seems extremely weird... what sort of magic is objc using

Hi Sohail, > Is LLVM expressive enough to represent asynchronous exceptions? not currently. The first step in this direction is to get rid of the invoke instruction and attach exception handling information to basic blocks. See http://nondot.org/sabre/LLVMNotes/ExceptionHandlingChanges.txt for a discussion. Ciao, Duncan.

On 11-06-12 8:53 PM, John McCall wrote: >> > The CFG point is a valid point. In what I've read on the topic so far >> > (yay Internet), it seems like the CFG would have to represent the fact >> > that control can jump to a handler after nearly every instruction in the >> > presence of async exceptions. The Hotspot compiler probably does this. >> >

On Jun 13, 2011, at 10:50 AM, John McCall wrote: > On Jun 13, 2011, at 10:30 AM, Jakob Stoklund Olesen wrote: >> The try block would look something like: >> >> call _malloc >> movq %rax, p(%rpb) >> >> If you take an exception between those two instructions, you are leaking memory. > > This is primarily an argument that C is not a good language to

On 13 June 2011 22:27, John McCall <rjmccall at apple.com> wrote: > But yes, I am not inclined to support asynchronous exceptions from signals. Ah, ok. I was beginning to wonder... ;) --renato

On Jun 13, 2011, at 3:15 PM, Jakob Stoklund Olesen wrote: > > On Jun 13, 2011, at 2:52 PM, Chris Lattner wrote: > >> Synchronous exceptions like divide by zero or null pointer derefs are another thing entirely though. > > When runtimes support this, do they preserve all registers or just the non-volatile registers, like a normal unwinder? How is information about the

On Jun 13, 2011, at 2:37 PM, Renato Golin wrote: > On 13 June 2011 22:27, John McCall <rjmccall at apple.com> wrote: >> But yes, I am not inclined to support asynchronous exceptions from signals. > > Ah, ok. I was beginning to wonder... ;) > You laugh, but we support it (or at least we did at one point with gcc-4.2). -bw

On 14 June 2011 02:03, Bill Wendling <wendling at apple.com> wrote: > You laugh, but we support it (or at least we did at one point with gcc-4.2). In IR? In the form of synchronous exceptions? How can you possible represent a "signal cfg" in IR? Is there a need for unwinding information at all? cheers, --renato