similar to: Pluralization of non-noun names

People, I didn''t get an answer to this before so I am trying again: I could change an existing "policy" table to "policies" with no drama but the are a number of related tables ie: p_2quot p_addr p_cc p_cs p_direct p_div p_exss

Wow. I wasn't expecting such a voluminous reply -- some I agree with and some I don't. My apologies for an equally voluminous reply. On Wed, 19 Dec 2007, Tony Plack wrote: > > We're not discussing code or the inner workings of Asterisk or even > > changing the functionality of Asterisk, just what the proper order of > > the words should be. > > > >

Hi all, I know this is a long shot, but could renaming the "Journey" module please be considered by those in a position to support it? I''ve written an issue on this in the journey repo also: https://github.com/rails/journey/issues/49 Essentially our project has a model named Journey, the same as Rails 3.2''s new routing driver. As a consequence we can no longer

Hi All I was wondering if anyone had a solution for the following problem. I user QueryParser to stem my documents before adding them to a database. During the stemming process I would like to find a way of keeping proper nouns that span two or more words together as a phrase. For example "New York" or "Gordon Brown" or "Prime Minister" get spilt up. I see

Luke, I thought about what you said about nouns, but having trouble coming up with an example of what you mean. Would you be willing to rework my example into the words your talking about? I''m not asking for a solution here...this is more about how to think about the problem being solved. Mike B. ---------------------------------------------------------------- This message was sent

I have a model called Aircraft, inflected as uncountable, and it''s driving me nuts. What is the correct way to handle this in Rails 3 beta 4? resources :aircraft do member do get :flights end end # Of course these work for some actions and not others. match ''aircraft'', :to => ''aircraft#index'', :as =>

> How is c's const keyword translated when compiling c into > llvm bytecode. It isn't. You can verify this quite simply with the following test program: void a(const void *p) { } void b(void *p) { } $ clang --emit-llvm test.c ; ModuleID = 'foo' define void @a(i8* %p) { entry: %p.addr = alloca i8* ; <i8**> [#uses=1] %allocapt = bitcast

How is c's const keyword translated when compiling c into llvm bytecode. I'm specifically interested in const pointer function arguments. Consider a function declared as follows in c: void f(const int* arg); When I examine f in llvm bytecode, how can I tell that arg is a pointer, whose contents can only be read, not written. Regards, Ryan

Hi, all, We are working on a static analysis phase on LLVM's IR, we want to do a backforward phase through the use-def chain, I knew that LLVM had a built-in SSA form which provide the use-def chain for virtual register variables, however, I want to know if you also provide some kinds of use-def chain for memory operations? for example, I have the following source code int foo(int *q, int

On Dec 5, 2009, at 4:02 AM, Tianwei wrote: > Hi, all, > We are working on a static analysis phase on LLVM's IR, we want to do a backforward phase through the use-def chain, I knew that LLVM > had a built-in SSA form which provide the use-def chain for virtual register variables, however, I want to know if you also provide some kinds of use-def chain for memory operations? for

On Mon, 21 Feb 2005, Jeff Cohen wrote: > I noticed that fourinarow is one of the programs in which LLVM is much slower > than GCC, so I decided to take a look and see why that is so. The program > has many loops that look like this: > > #define ROWS 6 > #define COLS 7 > > void init_board(char b[COLS][ROWS+1]) > { > int i,j; > > for

I''m testing the http module in console. BUt I got the following error. Anyone knows why? >> Net::HTTP.get_print ''www.google.com'', ''index.html'' SystemStackError: stack level too deep from C:/InstantRails/ruby/lib/ruby/1.8/net/http.rb:451:in `newobj'' from C:/InstantRails/ruby/lib/ruby/1.8/net/http.rb:451:in

Sorry, I thought I was running selection dag isel but I screwed up when trying out the really big array. You're right, it does clean it up except for the multiplication. So LoopStrengthReduce is not ready for prime time and doesn't actually get used? I might consider whipping it into shape. Does it still have to handle getelementptr in its full generality? Chris Lattner wrote:

On Mon, 21 Feb 2005, Jeff Cohen wrote: > Sorry, I thought I was running selection dag isel but I screwed up when > trying out the really big array. You're right, it does clean it up except > for the multiplication. > > So LoopStrengthReduce is not ready for prime time and doesn't actually get > used? I don't know what the status of it is. You could try it out,

If you're one of the people who has cvsup'd to 4.8-stable since August 8th and you've since begun to experience panics on a previously stable system, please apply the attached patch and see if your previous stability has been restored. Please tell me your results. Thanks, Mike "Silby" Silbersack -------------- next part -------------- diff -u -r

I noticed that fourinarow is one of the programs in which LLVM is much slower than GCC, so I decided to take a look and see why that is so. The program has many loops that look like this: #define ROWS 6 #define COLS 7 void init_board(char b[COLS][ROWS+1]) { int i,j; for (i=0;i<COLS;i++) for (j=0;j<ROWS;j++) b[i][j]='.';

My wife got the following from a system running (effectively) 4.8-RELEASE (I built/installed world just before the kernel version was updated from 4.8-RC to 4.8-RELEASE). I gather she made a few attempts to get mozilla to start and then the system panic'd. According to the crashdump, p->p_leader is NULL but according to the code, this can never happen. This is a UP Athlon XP-1800 with