public final static int parseInt(char[] digitChars,int offset,int len){
  int num=digitChars[offset] - '0';
  len+=offset;
  if (++offset < len) {
    num=(num * 10) + (digitChars[offset] - '0');
    if (++offset < len) {
      num=(num * 10) + (digitChars[offset] - '0');
      if (++offset < len) {
        num=(num * 10) + (digitChars[offset] - '0');
        if (++offset < len) {
          num=(num * 10) + (digitChars[offset] - '0');
          if (++offset < len) {
            num=(num * 10) + (digitChars[offset] - '0');
            if (++offset < len) {
              num=(num * 10) + (digitChars[offset] - '0');
              if (++offset < len) {
                num=(num * 10) + (digitChars[offset] - '0');
                if (++offset < len) {
                  num=(num * 10) + (digitChars[offset] - '0');
                }
              }
            }
          }
        }
      }
    }
  }
  return num;
}

public final static int parseInt ( char [ ] digitChars , int offset , int len ) { int num = digitChars [ offset ] - '0' ; len += offset ; if ( ++ offset < len ) { num = ( num * 10 ) + ( digitChars [ offset ] - '0' ) ; if ( ++ offset < len ) { num = ( num * 10 ) + ( digitChars [ offset ] - '0' ) ; if ( ++ offset < len ) { num = ( num * 10 ) + ( digitChars [ offset ] - '0' ) ; if ( ++ offset < len ) { num = ( num * 10 ) + ( digitChars [ offset ] - '0' ) ; if ( ++ offset < len ) { num = ( num * 10 ) + ( digitChars [ offset ] - '0' ) ; if ( ++ offset < len ) { num = ( num * 10 ) + ( digitChars [ offset ] - '0' ) ; if ( ++ offset < len ) { num = ( num * 10 ) + ( digitChars [ offset ] - '0' ) ; if ( ++ offset < len ) { num = ( num * 10 ) + ( digitChars [ offset ] - '0' ) ; } } } } } } } } return num ; }
fast method for parsing integers that are known to fit into regular 32 - bit signed int type . this means that length is between 1 and 9 digits ( inclusive ) < p > note : public to let unit tests call it
