Lines Matching refs:length
42 * Only if the length of the text is zero, then levels==dirProps==NULL.
62 * length is <2, then this uses more memory.
67 * if it is less than length, then there is an implicit trailing run
99 int32_t start=pBiDi->length;
104 Setting trailingWSStart to pBidi->length will avoid changing the
109 pBiDi->trailingWSStart=start; /* currently == pBiDi->length */
132 int32_t length;
138 RETURN_VOID_IF_BAD_RANGE(limit, 0, pParaBiDi->length+1, *pErrorCode);
153 length=pLineBiDi->length=limit-start;
154 pLineBiDi->resultLength=pLineBiDi->originalLength=length;
190 pLineBiDi->trailingWSStart=length;
209 if(trailingWSStart<length && (pLineBiDi->paraLevel&1)!=level) {
255 if(!IS_VALID_PARA_OR_LINE(pBiDi) || charIndex<0 || pBiDi->length<=charIndex) {
266 int32_t start, length;
270 if((length=pBiDi->length)<=0) {
274 if((start=pBiDi->trailingWSStart)==length) {
286 if(getLevelsMemory(pBiDi, length)) {
294 uprv_memset(levels+start, pBiDi->paraLevel, length-start);
297 pBiDi->trailingWSStart=length;
314 RETURN_VOID_IF_BAD_RANGE(logicalPosition, 0, pBiDi->length, errorCode);
401 pBiDi->runs[0].visualLimit=pBiDi->length;
461 if(pBiDi->trailingWSStart<pBiDi->length) {
505 if(pBiDi->trailingWSStart==pBiDi->length) {
524 int32_t runCount=pBiDi->runCount, visualStart=0, i, length, logicalStart;
527 length=runs[i].visualLimit-visualStart;
529 if((logicalIndex>=logicalStart) && (logicalIndex<(logicalStart+length))) {
532 visualStart+=length;
555 * includes the case of length==0 (handled in setPara)..
562 /* simple, single-run case - this covers length==0 */
565 } else /* UBIDI_MIXED, length>0 */ {
567 int32_t length=pBiDi->length, limit;
597 if(runCount==1 && limit==length) {
600 } else /* runCount>1 || limit<length */ {
607 if(limit<length) {
649 if(limit<length) {
652 runs[runIndex].visualLimit=length-limit;
701 const UChar *start=pBiDi->text, *limit=start+pBiDi->length, *pu;
714 prepareReorder(const UBiDiLevel *levels, int32_t length,
720 if(levels==NULL || length<=0) {
727 for(start=length; start>0;) {
743 for(start=length; start>0;) {
754 ubidi_reorderLogical(const UBiDiLevel *levels, int32_t length, int32_t *indexMap) {
758 if(indexMap==NULL || !prepareReorder(levels, length, indexMap, &minLevel, &maxLevel)) {
778 while(start<length && levels[start]<maxLevel) {
781 if(start>=length) {
786 for(limit=start; ++limit<length && levels[limit]>=maxLevel;) {}
807 if(limit==length) {
817 ubidi_reorderVisual(const UBiDiLevel *levels, int32_t length, int32_t *indexMap) {
821 if(indexMap==NULL || !prepareReorder(levels, length, indexMap, &minLevel, &maxLevel)) {
841 while(start<length && levels[start]<maxLevel) {
844 if(start>=length) {
849 for(limit=start; ++limit<length && levels[limit]>=maxLevel;) {}
867 if(limit==length) {
883 RETURN_IF_BAD_RANGE(logicalIndex, 0, pBiDi->length, *pErrorCode, -1);
891 visualIndex=pBiDi->length-logicalIndex-1;
899 int32_t i, visualStart=0, offset, length;
903 length=runs[i].visualLimit-visualStart;
905 if(offset>=0 && offset<length) {
911 visualIndex=visualStart+length-offset-1;
915 visualStart+=length;
926 int32_t i, length, insertRemove;
928 for(i=0; ; i++, visualStart+=length) {
929 length=runs[i].visualLimit-visualStart;
946 int32_t i, j, start, limit, length, insertRemove;
954 for(i=0; ; i++, visualStart+=length) {
955 length=runs[i].visualLimit-visualStart;
973 limit=GET_INDEX(runs[i].logicalStart)+length;
1001 return pBiDi->length-visualIndex-1;
1014 int32_t visualStart=0, length;
1017 for(i=0; ; i++, visualStart+=length) {
1018 length=runs[i].visualLimit-visualStart;
1032 if(visualIndex==(visualStart+length+markFound)) {
1041 int32_t controlFound=0, insertRemove, length;
1046 for(i=0; ; i++, visualStart+=length) {
1047 length=runs[i].visualLimit-visualStart;
1063 logicalEnd=logicalStart+length-1;
1064 for(j=0; j<length; j++) {
1127 if (pBiDi->length<=0) {
1130 if (pBiDi->length>pBiDi->resultLength) {
1131 uprv_memset(indexMap, 0xFF, pBiDi->length*sizeof(int32_t));
1153 int32_t length, insertRemove;
1156 for(i=0; i<runCount; i++, visualStart+=length) {
1157 length=runs[i].visualLimit-visualStart;
1164 logicalLimit=logicalStart+length;
1176 int32_t length, insertRemove;
1181 for(i=0; i<runCount; i++, visualStart+=length) {
1182 length=runs[i].visualLimit-visualStart;
1191 logicalLimit=logicalStart+length;
1199 for(j=0; j<length; j++) {
1283 int32_t insertRemove, length, i, j, k, m;
1290 for(i=0; i<runCount; i++, visualStart+=length) {
1291 length=runs[i].visualLimit-visualStart;
1295 k+=length;
1309 logicalEnd=logicalStart+length-1;
1310 for(j=0; j<length; j++) {
1323 ubidi_invertMap(const int32_t *srcMap, int32_t *destMap, int32_t length) {
1324 if(srcMap!=NULL && destMap!=NULL && length>0) {
1328 pi=srcMap+length;
1342 pi=srcMap+length;
1343 while(length>0) {
1345 destMap[*pi]=--length;
1347 --length;