Home | History | Annotate | Download | only in common

Lines Matching refs:rows

31     int32_t rows;
67 pv->rows=2+(UPVEC_MAX_CP-UPVEC_FIRST_SPECIAL_CP);
69 /* set the all-Unicode row and the special-value rows */
71 uprv_memset(row, 0, pv->rows*columns*4);
94 int32_t columns, i, start, limit, prevRow, rows;
97 rows=limit=pv->rows;
183 /* find the rows whose ranges overlap with the input range */
185 /* find the first and last rows, always successful */
190 * Rows need to be split if they partially overlap with the
191 * input range (only possible for the first and last rows)
197 /* split first/last rows if necessary */
199 int32_t count, rows;
201 rows=pv->rows;
202 if((rows+splitFirstRow+splitLastRow)>pv->maxRows) {
220 uprv_memcpy(newVectors, pv->v, rows*columns*4);
229 count = (int32_t)((pv->v+rows*columns)-(lastRow+columns));
236 pv->rows=rows+splitFirstRow+splitLastRow;
240 /* copy all affected rows up one and move the lastRow pointer */
263 /* set the input value in all remaining rows */
295 if(pv->isCompacted || rowIndex<0 || rowIndex>=pv->rows) {
335 int32_t i, columns, valueColumns, rows, count;
353 rows=pv->rows;
358 uprv_sortArray(pv->v, rows, columns*4,
367 * to find the indexes where the special-value rows will move.
371 for(i=0; i<rows; ++i) {
408 for(i=0; i<rows; ++i) {
430 pv->rows=count/valueColumns+1;
439 *pRows=pv->rows;
460 byteLength=pv->rows*(pv->columns-2)*4;
468 *pRows=pv->rows;
489 * TODO(markus): Add upvec_16BitsToUTrie2() function that enumerates all rows, extracts
510 /* too many rows for a 16-bit trie */
546 /* too many rows for a 16-bit trie */