Java: minimum number of operations for conjunctive inequalities?

Posted by HH on Stack Overflow See other posts from Stack Overflow or by HH
Published on 2010-04-29T00:52:50Z Indexed on 2010/04/29 0:57 UTC
Read the original article Hit count: 399

Filed under:
|
|
|
|

I try to simplify conditionals in for (int t=0,size=fo.getPrintViewsPerFile().size();t<size&&t<countPerFile;t++){, more precisely:

t<s&&t<c

You need to compare two times, then calc the boolean value from them. Is there any simpler way to do it? If no, how can you prove it? I can simplify it to some extent, proof tree.

© Stack Overflow or respective owner

Related posts about java

Related posts about predicate