search for: htlatex

...added type='integral' * summaryP: fixed bug with sort=FALSE using mfreq when shouldn't * summaryP: stored levels(val) in original levels order * summaryM: removed observations added by addMarginal when computing N in left column of tables * html.latex: added method for htlatex, added where argument, cleaned up code, implemented file='' for knitr when using html/Rmarkdown * summaryM, summary.formula: changed calls to translate to gsub() * summaryP: corrected but in exclude1 logic, moved exclude1 to methods that operate on summaryP objects and out of summ...

...added type='integral' * summaryP: fixed bug with sort=FALSE using mfreq when shouldn't * summaryP: stored levels(val) in original levels order * summaryM: removed observations added by addMarginal when computing N in left column of tables * html.latex: added method for htlatex, added where argument, cleaned up code, implemented file='' for knitr when using html/Rmarkdown * summaryM, summary.formula: changed calls to translate to gsub() * summaryP: corrected but in exclude1 logic, moved exclude1 to methods that operate on summaryP objects and out of summ...

Hi all, I have a large dataset that has >10k entries. The dataset is stored in a dataframe with the headers: SubID Condition1 Condition2 Result1 Result2 There are multiple entries for a given SubID(Subject ID). Condition 1 has 3 levels and condition2 has 2 levels (therefore there are 6 possible combinations all together e.g. Cond1 Level1 x Cond2 Level 1 etc.) and i need to compute for 1. The