Package org.apache.poi.hssf.record.formula.functions.LookupUtils

Examples of org.apache.poi.hssf.record.formula.functions.LookupUtils.LookupValueComparer.compareTo()


    LookupValueComparer lookupComparer = createLookupComparer(lookupValue, matchExact);

    int size = lookupRange.getSize();
    if(matchExact) {
      for (int i = 0; i < size; i++) {
        if(lookupComparer.compareTo(lookupRange.getItem(i)).isEqual()) {
          return i;
        }
      }
      throw new EvaluationException(ErrorEval.NA);
    }
View Full Code Here


    }

    if(findLargestLessThanOrEqual) {
      // Note - backward iteration
      for (int i = size - 1; i>=0;  i--) {
        CompareResult cmp = lookupComparer.compareTo(lookupRange.getItem(i));
        if(cmp.isTypeMismatch()) {
          continue;
        }
        if(!cmp.isLessThan()) {
          return i;
View Full Code Here

    }

    // else - find smallest greater than or equal to
    // TODO - is binary search used for (match_type==+1) ?
    for (int i = 0; i<size; i++) {
      CompareResult cmp = lookupComparer.compareTo(lookupRange.getItem(i));
      if(cmp.isEqual()) {
        return i;
      }
      if(cmp.isGreaterThan()) {
        if(i<1) {
View Full Code Here

    LookupValueComparer lookupComparer = createLookupComparer(lookupValue, matchExact);

    int size = lookupRange.getSize();
    if(matchExact) {
      for (int i = 0; i < size; i++) {
        if(lookupComparer.compareTo(lookupRange.getItem(i)).isEqual()) {
          return i;
        }
      }
      throw new EvaluationException(ErrorEval.NA);
    }
View Full Code Here

    }

    if(findLargestLessThanOrEqual) {
      // Note - backward iteration
      for (int i = size - 1; i>=0;  i--) {
        CompareResult cmp = lookupComparer.compareTo(lookupRange.getItem(i));
        if(cmp.isTypeMismatch()) {
          continue;
        }
        if(!cmp.isLessThan()) {
          return i;
View Full Code Here

    }

    // else - find smallest greater than or equal to
    // TODO - is binary search used for (match_type==+1) ?
    for (int i = 0; i<size; i++) {
      CompareResult cmp = lookupComparer.compareTo(lookupRange.getItem(i));
      if(cmp.isEqual()) {
        return i;
      }
      if(cmp.isGreaterThan()) {
        if(i<1) {
View Full Code Here

    LookupValueComparer lookupComparer = createLookupComparer(lookupValue, matchExact);
   
    if(matchExact) {
      for (int i = 0; i < lookupRange.length; i++) {
        if(lookupComparer.compareTo(lookupRange[i]).isEqual()) {
          return i;
        }
      }
      throw new EvaluationException(ErrorEval.NA);
    }
View Full Code Here

    }
   
    if(findLargestLessThanOrEqual) {
      // Note - backward iteration
      for (int i = lookupRange.length - 1; i>=0;  i--) {
        CompareResult cmp = lookupComparer.compareTo(lookupRange[i]);
        if(cmp.isTypeMismatch()) {
          continue;
        }
        if(!cmp.isLessThan()) {
          return i;
View Full Code Here

    }
   
    // else - find smallest greater than or equal to
    // TODO - is binary search used for (match_type==+1) ?
    for (int i = 0; i<lookupRange.length; i++) {
      CompareResult cmp = lookupComparer.compareTo(lookupRange[i]);
      if(cmp.isEqual()) {
        return i;
      }
      if(cmp.isGreaterThan()) {
        if(i<1) {
View Full Code Here

    LookupValueComparer lookupComparer = createLookupComparer(lookupValue, matchExact);

    int size = lookupRange.getSize();
    if(matchExact) {
      for (int i = 0; i < size; i++) {
        if(lookupComparer.compareTo(lookupRange.getItem(i)).isEqual()) {
          return i;
        }
      }
      throw new EvaluationException(ErrorEval.NA);
    }
View Full Code Here

TOP
Copyright © 2018 www.massapi.com. All rights reserved.
All source code are property of their respective owners. Java is a trademark of Sun Microsystems, Inc and owned by ORACLE Inc. Contact coftware#gmail.com.