|  |  | 
 |  |  |          long l = 0; | 
 |  |  |          long[] ls = new long[len] ; | 
 |  |  |          for(int i = 0 ; i < len; i++){ | 
 |  |  |             ls[i] = bs[i] ; | 
 |  |  |             ls[i] = bs[i] & 0xFF ; | 
 |  |  |          } | 
 |  |  |          for(int i = len-1 ; i >= 0; i--){ | 
 |  |  |             ls[(len - 1) - i] <<= 8 * i ; | 
 |  |  | 
 |  |  |       boolean b = isOutOfArrLength(bs.length, (from - 1) + 8); | 
 |  |  |       if (b) { | 
 |  |  |          long s = 0; | 
 |  |  |          long s0 = bs[from + 0] ;// 最低位 | 
 |  |  |          long s1 = bs[from + 1] ; | 
 |  |  |          long s2 = bs[from + 2] ; | 
 |  |  |          long s3 = bs[from + 3] ; | 
 |  |  |          long s4 = bs[from + 4] ; | 
 |  |  |          long s5 = bs[from + 5] ; | 
 |  |  |          long s6 = bs[from + 6] ; | 
 |  |  |          long s7 = bs[from + 7] ; | 
 |  |  |          long s0 = bs[from + 0] & 0xFF ;// 最低位 | 
 |  |  |          long s1 = bs[from + 1] & 0xFF ; | 
 |  |  |          long s2 = bs[from + 2] & 0xFF ; | 
 |  |  |          long s3 = bs[from + 3] & 0xFF ; | 
 |  |  |          long s4 = bs[from + 4] & 0xFF ; | 
 |  |  |          long s5 = bs[from + 5] & 0xFF ; | 
 |  |  |          long s6 = bs[from + 6] & 0xFF ; | 
 |  |  |          long s7 = bs[from + 7] & 0xFF ; | 
 |  |  |  | 
 |  |  |          // s7不变 | 
 |  |  |          s6 <<= 8; | 
 |  |  | 
 |  |  |          short len = (short)(end - from + 1) ; | 
 |  |  |          long[] ls = new long[len] ; | 
 |  |  |          for(short i = 0 ; i < len; i++){ | 
 |  |  |             ls[i] = bs[from + i] ; | 
 |  |  |             ls[i] = bs[from + i] & 0xFF ; | 
 |  |  |          } | 
 |  |  |          for(short i = (short)(len-1) ; i >= 0; i--){ | 
 |  |  |             ls[i] <<= 8 * (len - (i + 1)) ; | 
 |  |  | 
 |  |  |          long l = 0; | 
 |  |  |          long[] ls = new long[len] ; | 
 |  |  |          for(int i = 0 ; i < len; i++){ | 
 |  |  |             ls[i] = bs[i] ; | 
 |  |  |             ls[i] = bs[i] & 0xFF ; | 
 |  |  |          } | 
 |  |  |          for(int i = 0 ; i < len; i++){ | 
 |  |  |             ls[(len - 1) - i] <<= 8 * i ; | 
 |  |  | 
 |  |  |       boolean b = isOutOfArrLength(bs.length, (from - 1) + 8); | 
 |  |  |       if (b) { | 
 |  |  |          long s = 0; | 
 |  |  |          long s0 = bs[from] ;// 最低位 | 
 |  |  |          long s1 = bs[from + 1] ; | 
 |  |  |          long s2 = bs[from + 2] ; | 
 |  |  |          long s3 = bs[from + 3] ; | 
 |  |  |          long s4 = bs[from + 4] ; | 
 |  |  |          long s5 = bs[from + 5] ; | 
 |  |  |          long s6 = bs[from + 6] ; | 
 |  |  |          long s7 = bs[from + 7] ; | 
 |  |  |          long s0 = bs[from] & 0xFF ;// 最低位 | 
 |  |  |          long s1 = bs[from + 1] & 0xFF ; | 
 |  |  |          long s2 = bs[from + 2] & 0xFF ; | 
 |  |  |          long s3 = bs[from + 3] & 0xFF ; | 
 |  |  |          long s4 = bs[from + 4] & 0xFF ; | 
 |  |  |          long s5 = bs[from + 5] & 0xFF ; | 
 |  |  |          long s6 = bs[from + 6] & 0xFF ; | 
 |  |  |          long s7 = bs[from + 7] & 0xFF ; | 
 |  |  |  | 
 |  |  |          // s0不变 | 
 |  |  |          s1 <<= 8; | 
 |  |  | 
 |  |  |          short len = (short)(end - from + 1) ; | 
 |  |  |          long[] ls = new long[len] ; | 
 |  |  |          for(short i = 0 ; i < len; i++){ | 
 |  |  |             ls[i] = bs[from + i] ; | 
 |  |  |             ls[i] = bs[from + i] & 0xFF ; | 
 |  |  |          } | 
 |  |  |          for(short i = 0 ; i < len; i++){ | 
 |  |  |             ls[i] <<= 8 * i ; | 
 |  |  | 
 |  |  |       boolean b = isOutOfArrLength(bs.length, (from - 1) + 4); | 
 |  |  |       if (b) { | 
 |  |  |          int s = 0; | 
 |  |  |          int s0 = bs[from + 0] ;// 最低位 | 
 |  |  |          int s1 = bs[from + 1] ; | 
 |  |  |          int s2 = bs[from + 2] ; | 
 |  |  |          int s3 = bs[from + 3] ; | 
 |  |  |          int s0 = bs[from + 0] & 0xFF ;// 最低位 | 
 |  |  |          int s1 = bs[from + 1] & 0xFF ; | 
 |  |  |          int s2 = bs[from + 2] & 0xFF ; | 
 |  |  |          int s3 = bs[from + 3] & 0xFF ; | 
 |  |  |  | 
 |  |  |          // s3不变 | 
 |  |  |          s2 <<= 8; | 
 |  |  | 
 |  |  |       boolean b = isOutOfArrLength(bs.length, (from - 1) + 4); | 
 |  |  |       if (b) { | 
 |  |  |          int s = 0; | 
 |  |  |          int s0 = bs[from + 0] ;// 最低位 | 
 |  |  |          int s1 = bs[from + 1] ; | 
 |  |  |          int s2 = bs[from + 2] ; | 
 |  |  |          int s3 = bs[from + 3] ; | 
 |  |  |          int s0 = bs[from + 0] & 0xFF ;// 最低位 | 
 |  |  |          int s1 = bs[from + 1] & 0xFF ; | 
 |  |  |          int s2 = bs[from + 2] & 0xFF ; | 
 |  |  |          int s3 = bs[from + 3] & 0xFF ; | 
 |  |  |  | 
 |  |  |          // s0不变 | 
 |  |  |          s1 <<= 8; | 
 |  |  | 
 |  |  |       boolean b = isOutOfArrLength(bs.length, (from - 1) + 2); | 
 |  |  |       if (b) { | 
 |  |  |          int s = 0; | 
 |  |  |          int s0 = bs[from + 0] ; | 
 |  |  |          int s1 = bs[from + 1] ; | 
 |  |  |          int s0 = bs[from + 0] & 0xFF ; | 
 |  |  |          int s1 = bs[from + 1] & 0xFF ; | 
 |  |  |  | 
 |  |  |          // s1不变 | 
 |  |  |          s0 <<= 8; | 
 |  |  | 
 |  |  |       boolean b = isOutOfArrLength(bs.length, (from - 1) + 2); | 
 |  |  |       if (b) { | 
 |  |  |          int s = 0; | 
 |  |  |          int s0 = bs[from + 0] ; | 
 |  |  |          int s1 = bs[from + 1] ; | 
 |  |  |          int s0 = bs[from + 0] & 0xFF ; | 
 |  |  |          int s1 = bs[from + 1] & 0xFF ; | 
 |  |  |  | 
 |  |  |          // s0不变 | 
 |  |  |          s1 <<= 8; |