Displaying 5 results from an estimated 5 matches for "trichotomy".
Did you mean:
dichotomy
2012 Apr 16
3
[LLVMdev] Representing -ffast-math at the IR level
Hi Duncan,
I like the changes to IRBuilder and how the operator can't change it.
Looks a lot safer (mistake-wise) and more convenient.
This function won't to remove a previously set tag, which could be
used by optimisations or inlining.
+ Instruction *AddFPMathTag(Instruction *I, MDNode *FPMathTag) const {
+ if (!FPMathTag)
+ FPMathTag = DefaultFPMathTag;
+ if (FPMathTag)
+
2012 Apr 16
0
[LLVMdev] Representing -ffast-math at the IR level
Btw, the assert in MDNode *CreateFPMath(float Accuracy) is
unnecessary. Trichotomy guarantees it will be right. ;)
--
cheers,
--renato
http://systemcall.org/
2012 Apr 16
1
[LLVMdev] Representing -ffast-math at the IR level
Hi Renato,
> Btw, the assert in MDNode *CreateFPMath(float Accuracy) is
> unnecessary. Trichotomy guarantees it will be right. ;)
what if Accuracy is NaN?
Ciao, Duncan.
2008 Jan 09
1
pairwise cross tabulation tables
Hi,
I have a huge number of categorical variables, say at least 10000, and I put
them into a matrix, each column is one variable. The question is: how can I
make all of the pairwise cross tabulation tables efficiently? The
straightforward solution is to use for-loops by looping two indexes on the
table() function, but it was just too slow. Is there a more efficient way to
do that? Any guidance
2006 Jan 17
30
MVC design good/bad
I am curious what you find is good and bad MVC design.
Let''s use the find and find_by_sql methods as examples.
Currently I have these spread out all over the place...
View: here I have some find methods when I am for example populating a
select list with choices in a form.
Controller: here I have the simpler find methods.
Model: here I have the more complicated find methods (usually