Lines Matching refs:array
18 * There are functions to efficiently serialize a USet into an array of uint16_t
319 * Important: the code points in the array are in ascending order,
327 * and add the bmpLength between it and the array.
371 fillSet->array=src;
382 fillSet->array=fillSet->staticArray;
411 const uint16_t* array;
417 array=set->array;
422 if (c < array[0]) {
424 } else if (c < array[hi]) {
429 } else if (c < array[i]) {
445 if (high < array[base] || (high==array[base] && low<array[base+1])) {
447 } else if (high < array[base+hi] || (high==array[base+hi] && low<array[base+hi+1])) {
453 } else if (high < array[iabs] || (high==array[iabs] && low<array[iabs+1])) {
479 const uint16_t* array;
486 array=set->array;
492 *pStart=array[rangeIndex++];
494 *pEnd=array[rangeIndex]-1;
496 *pEnd=((((int32_t)array[rangeIndex])<<16)|array[rangeIndex+1])-1;
506 array+=bmpLength;
507 *pStart=(((int32_t)array[rangeIndex])<<16)|array[rangeIndex+1];
510 *pEnd=((((int32_t)array[rangeIndex])<<16)|array[rangeIndex+1])-1;
532 // findChar(const UChar32* array, int32_t length, UChar32 c) {
537 // if(c>=array[length-1]) {
545 // for(i=0; i<length && c>=array[i]; ++i) {}
558 // i=findChar(set->array, length, c);
564 // /* how many more array items do we need? */
565 // if(i<length && (c+1)==set->array[i]) {
567 // set->array[i]=c;
570 // if(c==set->array[i]) {
574 // uprv_memmove(set->array+i, set->array+i+2, (length-i)*4);
579 // } else if(i>0 && c==set->array[i-1]) {
582 // set->array[i-1]=c;
583 // if(i<length && c==set->array[i]) {
588 // uprv_memmove(set->array+i, set->array+i+2, (length-i)*4);
613 // uprv_memcpy(newArray, set->array, length*4);
615 // if(set->array!=set->staticBuffer) {
616 // uprv_free(set->array);
618 // set->array=newArray;
622 // uprv_memmove(set->array+i+more, set->array+i, (length-i)*4);
624 // set->array[i]=c;
626 // set->array[i+1]=c+1;
