search for: statenum

Hi Guys, I would like to weight column entries in a data frame by the population of each state. For example, here is some data: state statenum year income popul ALABAMA 1 1 9.703193 3973.00 ALABAMA 1 2 9.745950 3992.00 ALABAMA 1 3 9.762092 4015.00 ALASKA 2 1 10.221640 532.00 ALASKA 2 2 10.169600 544.00 ALASKA 2 3 10.101300 539.00...

Committed in r159281. -Anshu On 6/26/2012 3:04 AM, Ivan Llopard wrote: > Hi Anshu, > > I don't have commit access. It applies correctly on trunk, I've just > checked it. Could you please commit it? > > Ivan > > On 26/06/2012 04:44, adasgupt at codeaurora.org wrote: >> Hi Ivan, >> >> Sorry, I should have been more explicit in my last email. The

Hi Anshu, I don't have commit access. It applies correctly on trunk, I've just checked it. Could you please commit it? Ivan On 26/06/2012 04:44, adasgupt at codeaurora.org wrote: > Hi Ivan, > > Sorry, I should have been more explicit in my last email. The patch looks > good to me. Please check that it applies on trunk and go ahead and commit. > > Thanks > -Anshu

...x: DFAPacketizerEmitter.cpp =================================================================== --- DFAPacketizerEmitter.cpp (révision 159340) +++ DFAPacketizerEmitter.cpp (copie de travail) @@ -76,15 +76,19 @@ // // namespace { +struct Transition; + class State { public: static int currentStateNum; int stateNum; bool isInitial; std::set<unsigned> stateInfo; + std::map<unsigned, Transition *> inputToTrans; State(); State(const State &S); + ~State(); // // canAddInsnClass - Returns true if an instruction of type InsnClass is a @@ -100,6 +104,15 @@...

...please remove the > Transition mechanism for the DFA class (stateTransitions). Done! > > For transitions being folded into State: > > std::map<unsigned, Transition *> inputToTrans; > > We don't need a map to Transition* here; we can directly map from input > to stateNum. You should be able to use a LLVM data structure. In that case, (1) Should I completely remove Transition and create a map structure in State (input, state) to replace them? (2) Or are you proposing to go though DFA in order look for valid transitions? After doing some cleanup to match the new...

...ant speedup in DFA generation. But then please remove the Transition mechanism for the DFA class (stateTransitions). For transitions being folded into State: > std::map<unsigned, Transition *> inputToTrans; We don't need a map to Transition* here; we can directly map from input to stateNum. You should be able to use a LLVM data structure. -Anshu

...chanism for the DFA class (stateTransitions). > > Done! > >> >> For transitions being folded into State: >> > std::map<unsigned, Transition *> inputToTrans; >> >> We don't need a map to Transition* here; we can directly map from input >> to stateNum. You should be able to use a LLVM data structure. > > In that case, > (1) Should I completely remove Transition and create a map structure > in State (input, state) to replace them? > (2) Or are you proposing to go though DFA in order look for valid > transitions? > > Afte...

...sitions). >> >> Done! >> >>> >>> For transitions being folded into State: >>> > std::map<unsigned, Transition *> inputToTrans; >>> >>> We don't need a map to Transition* here; we can directly map from input >>> to stateNum. You should be able to use a LLVM data structure. >> >> In that case, >> (1) Should I completely remove Transition and create a map structure >> in State (input, state) to replace them? >> (2) Or are you proposing to go though DFA in order look for valid >> trans...

I have a new problem: Register RBP is used in a function foo. (I am not allocating RBP to any virtual register, the instances of RBP in function foo are in the machine code when my register allocator starts.) Function foo calls function bar. Register RBP is not saved across the call, though it is live after the call. Function bar includes a virtual register. The code that I'm using to

...sceof[lastsc] = 0; } int sclookup( str ) char str[]; { return findsym( str, sctbl, 101 )->int_val; } void mkentry (register int*, int, int, int, int); void mkprot (int[], int, int); void mktemplate (int[], int, int); void mv2front (int); int tbldiff (int[], int, int[]); void bldtbl( state, statenum, totaltrans, comstate, comfreq ) int state[], statenum, totaltrans, comstate, comfreq; { int extptr, extrct[2][256 + 1]; int mindiff, minprot, i, d; extptr = 0; if ( (totaltrans * 100) < (numecs * 15) ) mkentry( state, numecs, statenum, -32766, totaltrans ); else { int checkcom =...