search for: dfa

I think the following may provide a clearer explanation: subs <- c(1,3) DFA <- data.frame(id = 1:3) ar <- array(1:12, c(3,2,2)) ## yielding > ar , , 1 [,1] [,2] [1,] 1 4 [2,] 2 5 [3,] 3 6 , , 2 [,1] [,2] [1,] 7 10 [2,] 8 11 [3,] 9 12 ## array subscripting gives > ar[subs,,] , , 1 [,1] [,2] [1,] 1 4 [2,]...

Hi, I am trying to identify duplicate values in a column in a date frame. The duplicated function identifies the duplicate rows in the data frame but it only does this for the second record, not both records. Is there a way to mark both rows in the data frame as TRUE? dfA$dups<-duplicated(dfA$Value) dfA Site State Value dups 929 VA 73 FALSE 929 VA 73 TRUE 930 VA 76 FALSE 930 VA 76 TRUE 931 VA 74 FALSE 932 VA 75 FALSE But I would like this Site State Value dups 929 VA 73 TRUE 929 VA 73 TRUE 930 VA 76 TRUE 930 VA 76 TRUE 931 VA 74 FALSE 932 VA 75 FALSE Thank yo...

...;>> Great. Looks good to me. >>>> >>>>> IMO, it wil be nice to keep it alive for performance comparisons. >>>> Given the overall performance >>>>> is rather determined by transition searches on the current state, >>>> for small DFA tables may not be a win >>>>> and it may still be the case for greater ones. >>>> I agree; let's keep it around for now. >>>> >>>> -Anshu >>>> >>>> --- >>>> Qualcomm Innovation Center, Inc is a member of the...

...rs. >>> >>> Great. Looks good to me. >>> >>>> IMO, it wil be nice to keep it alive for performance comparisons. >>> Given the overall performance >>>> is rather determined by transition searches on the current state, >>> for small DFA tables may not be a win >>>> and it may still be the case for greater ones. >>> I agree; let's keep it around for now. >>> >>> -Anshu >>> >>> --- >>> Qualcomm Innovation Center, Inc is a member of the Code Aurora Forum >>&g...

...ks good to me. >>>>> >>>>>> IMO, it wil be nice to keep it alive for performance comparisons. >>>>> Given the overall performance >>>>>> is rather determined by transition searches on the current state, >>>>> for small DFA tables may not be a win >>>>>> and it may still be the case for greater ones. >>>>> I agree; let's keep it around for now. >>>>> >>>>> -Anshu >>>>> >>>>> --- >>>>> Qualcomm Innovation Cen...

...te> > stateTransitions; > You should be able to use SmallSet here. Also, this line exceeds 80 > columns. I tried but SmallSet is not iterable. SmallSetPtr could be useful here but it doesn't allow custom sorting. > > > On a related note, is the CachedTable mechanism in DFAPacketizer.h > useful for your architecture? Currently the DFA generator generates > one table for a given architecture. I had originally added the > CachedTable mechanism since for a given compilation and subtarget, the > DFA only uses the subset of the states and transitions. Using...

...units to our Schedule.td and the >> generation time became painfully long. In fact, the main problem was >> in writeTableAndAPI(). I propose another patch to fix it: >> - Fixed memory leaks. >> - Transitions are attached to states. >> >> I've regenerated the DFA table of Hexagon and everything is ok. >> Please review it. > > I had a few comments about the design change that you're introducing > with the patch: > > This patch adds multiple points of control for adding a transition: > there's now an addTransition() for DFA and...

Hi, I've refactored the DFA generator in TableGen because it takes too much time to build the table of our BE and I'd like to share it. We have 15 functional units and 13 different itineraries which, in the worst case, can produce 13! states. Fortunately, many of those states are reused :-) but it still takes up to 11m...

...lass > and I fixed the violation of column numbers. > > Great. Looks good to me. > > > IMO, it wil be nice to keep it alive for performance comparisons. > Given the overall performance > > is rather determined by transition searches on the current state, > for small DFA tables may not be a win > > and it may still be the case for greater ones. > > I agree; let's keep it around for now. > > -Anshu > > --- > Qualcomm Innovation Center, Inc is a member of the Code Aurora Forum > > > > On 6/18/2012 3:47 AM, Ivan Llopard wrote...

...ass(unsigned InsnClass, Add a top level comment describing the function + std::map<State*, std::set<Transition*, ltTransition>, ltState> stateTransitions; You should be able to use SmallSet here. Also, this line exceeds 80 columns. On a related note, is the CachedTable mechanism in DFAPacketizer.h useful for your architecture? Currently the DFA generator generates one table for a given architecture. I had originally added the CachedTable mechanism since for a given compilation and subtarget, the DFA only uses the subset of the states and transitions. Using a "cache"...

.... I added a top comment for AddInsnClass and I fixed the violation of column numbers. Great. Looks good to me. > IMO, it wil be nice to keep it alive for performance comparisons. Given the overall performance > is rather determined by transition searches on the current state, for small DFA tables may not be a win > and it may still be the case for greater ones. I agree; let's keep it around for now. -Anshu --- Qualcomm Innovation Center, Inc is a member of the Code Aurora Forum On 6/18/2012 3:47 AM, Ivan Llopard wrote: > Hi Anshu, > > Thanks for reviewing this....

...added more functional units to our Schedule.td and the > generation time became painfully long. In fact, the main problem was > in writeTableAndAPI(). I propose another patch to fix it: > - Fixed memory leaks. > - Transitions are attached to states. > > I've regenerated the DFA table of Hexagon and everything is ok. > Please review it. I had a few comments about the design change that you're introducing with the patch: This patch adds multiple points of control for adding a transition: there's now an addTransition() for DFA and another addTransition() for...

...; An:?"Georg Kindermann" <Georg.Kindermann at gmx.at> Cc:?"Rui Barradas" <ruipbarradas at sapo.pt>, r-help at r-project.org Betreff:?Re: [R] data.frame with a column containing an array ? ? I think the following may provide a clearer explanation: ? subs <- c(1,3) DFA <- data.frame(id = 1:3) ar <- array(1:12, c(3,2,2)) ## yielding > ar , , 1 ? ? ?[,1] [,2] [1,] ? ?1 ? ?4 [2,] ? ?2 ? ?5 [3,] ? ?3 ? ?6 , , 2 ? ? ?[,1] [,2] [1,] ? ?7 ? 10 [2,] ? ?8 ? 11 [3,] ? ?9 ? 12 ? ## array subscripting gives > ar[subs,,] , , 1 ? ? ?[,1] [,2] [1,] ? ?1 ? ?4 [2,...

...violation of column numbers. >> >> Great. Looks good to me. >> >> > IMO, it wil be nice to keep it alive for performance comparisons. >> Given the overall performance >> > is rather determined by transition searches on the current state, >> for small DFA tables may not be a win >> > and it may still be the case for greater ones. >> >> I agree; let's keep it around for now. >> >> -Anshu >> >> --- >> Qualcomm Innovation Center, Inc is a member of the Code Aurora Forum >> >> >> &...

...d and the >>> generation time became painfully long. In fact, the main problem was >>> in writeTableAndAPI(). I propose another patch to fix it: >>> - Fixed memory leaks. >>> - Transitions are attached to states. >>> >>> I've regenerated the DFA table of Hexagon and everything is ok. >>> Please review it. >> >> I had a few comments about the design change that you're introducing >> with the patch: >> >> This patch adds multiple points of control for adding a transition: >> there's now an...

...t; generation time became painfully long. In fact, the main problem was >>>> in writeTableAndAPI(). I propose another patch to fix it: >>>> - Fixed memory leaks. >>>> - Transitions are attached to states. >>>> >>>> I've regenerated the DFA table of Hexagon and everything is ok. >>>> Please review it. >>> >>> I had a few comments about the design change that you're introducing >>> with the patch: >>> >>> This patch adds multiple points of control for adding a transition: &gt...

...subsetting it, like having a matrix in a data.frame. But instead I get only the first element and not all values of the remaining dimensions. Differences are already when creating the data.frame, where I can use `I` in case of a matrix but for an array I am only able to insert it in a second step. DFA <- data.frame(id = 1:2) DFA[["ar"]] <- array(1:8, c(2,2,2)) DFA[1,] # id ar #1 1 1 DFM <- data.frame(id = 1:2, M = I(matrix(1:4, 2))) DFM[1,] # id M.1 M.2 #1 1 1 3 The same when trying to use merge, where only the first value is kept. merge(DFA, data.frame(id = 1))...

...;Georg.Kindermann at gmx.at> > Cc: "Rui Barradas" <ruipbarradas at sapo.pt>, r-help at r-project.org > Betreff: Re: [R] data.frame with a column containing an array > > > > I think the following may provide a clearer explanation: > > subs <- c(1,3) > DFA <- data.frame(id = 1:3) > ar <- array(1:12, c(3,2,2)) > ## yielding > > ar > , , 1 > > [,1] [,2] > [1,] 1 4 > [2,] 2 5 > [3,] 3 6 > > , , 2 > > [,1] [,2] > [1,] 7 10 > [2,] 8 11 > [3,] 9 12 > >...

Ivan, Thanks for working on the DFA generator. I'll take a look at the changes in detail but from your description, I like the general nature of the modifications. -Anshu --- Qualcomm Innovation Center, Inc is a member of the Code Aurora Forum On 6/14/2012 8:22 AM, Ivan Llopard wrote: > Hi, > > I've refactored...

Hal, On 6/11/2012 12:48 PM, Andrew Trick wrote: > Ignoring compile time for a moment, I think an advantage of a DFA is modeling a situation where the hardware can assign resources to best fit the entire group rather then one instruction at a time. For example, if InstA requires either Unit0 or Unit1, and InstB requires Unit0, is {InstA, InstB} a valid group? Depending on your cpu, a DFA could either recognize th...