| 63 | 
  | 
    if (!evaluator1_.isDynamic() && !evaluator2_.isDynamic()) { | 
| 64 | 
  | 
        //if all selections are static,  we can precompute the number of real pairs     | 
| 65 | 
  | 
 | 
| 66 | 
< | 
        int nSelected1 = seleMan1_->getSelectionCount(); | 
| 67 | 
< | 
        int nSelected2 = seleMan2_->getSelectionCount(); | 
| 66 | 
> | 
        int nSelected1 = seleMan1_.getSelectionCount(); | 
| 67 | 
> | 
        int nSelected2 = seleMan2_.getSelectionCount(); | 
| 68 | 
  | 
 | 
| 69 | 
  | 
        BitSet bs = seleMan1_.getSelectionSet(); | 
| 70 | 
  | 
        bs &= seleMan2_.getSelectionSet(); | 
| 133 | 
  | 
    if (evaluator1_.isDynamic() || evaluator2_.isDynamic()) { | 
| 134 | 
  | 
        //if one of the selection is static,  need to recompute it     | 
| 135 | 
  | 
 | 
| 136 | 
< | 
        int nSelected1 = seleMan1_->getSelectionCount(); | 
| 137 | 
< | 
        int nSelected2 = seleMan2_->getSelectionCount(); | 
| 136 | 
> | 
        int nSelected1 = seleMan1_.getSelectionCount(); | 
| 137 | 
> | 
        int nSelected2 = seleMan2_.getSelectionCount(); | 
| 138 | 
  | 
 | 
| 139 | 
  | 
        BitSet bs = seleMan1_.getSelectionSet(); | 
| 140 | 
  | 
        bs &= seleMan2_.getSelectionSet(); | 
| 143 | 
  | 
        nRealPairs_ = nSelected1 * nSelected2 - (nIntersect +1) * nIntersect/2; | 
| 144 | 
  | 
    } | 
| 145 | 
  | 
 | 
| 146 | 
< | 
    return nRealPairs_ | 
| 146 | 
> | 
    return nRealPairs_; | 
| 147 | 
  | 
} | 
| 148 | 
  | 
 | 
| 149 | 
  | 
} |