Lines Matching refs:mLength
252 mLength = 0; in DwString()
258 assert(aPos <= aStr.mLength); in DwString()
265 size_t pos = DW_MIN(aPos, aStr.mLength); in DwString()
266 size_t len = DW_MIN(aLen, aStr.mLength - pos); in DwString()
270 mLength = len; in DwString()
275 mLength = 0; in DwString()
293 mLength = 0; in DwString()
294 _replace(0, mLength, aBuf, aLen); in DwString()
309 mLength = 0; in DwString()
311 if (aCstr) _replace(0, mLength, aCstr, len); in DwString()
327 mLength = 0; in DwString()
328 _replace(0, mLength, aLen, aChar); in DwString()
347 mLength = 0; in DwString()
353 mLength = aLen; in DwString()
378 if (aLen < mLength) { in resize()
379 mLength = aLen; in resize()
385 else if (aLen > mLength) { in resize()
386 _replace(mLength, 0, aLen-mLength, aChar); in resize()
408 mem_copy(from, mLength, to); in reserve()
409 to[mLength] = 0; in reserve()
432 return append(aStr, 0, aStr.mLength); in append()
439 assert(aPos <= aStr.mLength); in append()
440 size_t pos = DW_MIN(aPos, aStr.mLength); in append()
441 size_t len = DW_MIN(aLen, aStr.mLength - pos); in append()
444 _replace(mLength, 0, &temp.mRep->mBuffer[temp.mStart+pos], len); in append()
447 _replace(mLength, 0, &aStr.mRep->mBuffer[aStr.mStart+pos], len); in append()
457 _replace(mLength, 0, aBuf, aLen); in append()
467 _replace(mLength, 0, aCstr, len); in append()
474 _replace(mLength, 0, aLen, aChar); in append()
482 assign(aStr, 0, aStr.mLength); in assign()
490 assert(aPos <= aStr.mLength); in assign()
491 size_t pos = DW_MIN(aPos, aStr.mLength); in assign()
492 size_t len = DW_MIN(aLen, aStr.mLength - pos); in assign()
495 mLength = len; in assign()
501 mLength = len; in assign()
511 _replace(0, mLength, aBuf, aLen); in assign()
520 _replace(0, mLength, aCstr, len); in assign()
528 _replace(0, mLength, aLen, aChar); in assign()
535 return insert(aPos, aStr, 0, aStr.mLength); in insert()
542 assert(aPos1 <= mLength); in insert()
543 assert(aPos2 <= aStr.mLength); in insert()
544 size_t pos2 = DW_MIN(aPos2, aStr.mLength); in insert()
545 size_t len2 = DW_MIN(aLen2, aStr.mLength - pos2); in insert()
583 assert(aPos <= mLength); in erase()
584 size_t pos = DW_MIN(aPos, mLength); in erase()
585 size_t len = DW_MIN(aLen, mLength - pos); in erase()
593 return replace(aPos1, aLen1, aStr, 0, aStr.mLength); in replace()
600 assert(aPos2 <= aStr.mLength); in replace()
601 size_t pos2 = DW_MIN(aPos2, aStr.mLength); in replace()
602 size_t len2 = DW_MIN(aLen2, aStr.mLength - pos2); in replace()
640 assert(aPos <= mLength); in copy()
642 size_t pos = DW_MIN(aPos, mLength); in copy()
643 size_t len = DW_MIN(aLen, mLength - pos); in copy()
659 n = mLength; in swap()
660 mLength = aStr.mLength; in swap()
661 aStr.mLength = n; in swap()
667 return find(&aStr.mRep->mBuffer[aStr.mStart], aPos, aStr.mLength); in find()
675 if (aLen > mLength) return (size_t)-1; in find()
676 if (aPos > mLength-aLen) return (size_t)-1; in find()
679 for (size_t i=aPos; i <= mLength-aLen; ++i) { in find()
702 if (aPos >= mLength) return (size_t)-1; in find()
704 for (size_t i=aPos; i < mLength; ++i) { in find()
713 return rfind(&aStr.mRep->mBuffer[aStr.mStart], aPos, aStr.mLength); in rfind()
721 if (aLen > mLength) return (size_t)-1; in rfind()
722 size_t pos = DW_MIN(aPos, mLength - aLen); in rfind()
747 size_t pos = DW_MIN(aPos, mLength - 1); in rfind()
759 return find_first_of(&aStr.mRep->mBuffer[aStr.mStart], aPos, aStr.mLength); in find_first_of()
767 if (aPos >= mLength) return (size_t)-1; in find_first_of()
775 for (size_t i=aPos; i < mLength; ++i) { in find_first_of()
793 return find_last_of(&aStr.mRep->mBuffer[aStr.mStart], aPos, aStr.mLength); in find_last_of()
801 if (mLength == 0) return (size_t)-1; in find_last_of()
802 size_t pos = DW_MIN(aPos, mLength - 1); in find_last_of()
829 return find_first_not_of(&aStr.mRep->mBuffer[aStr.mStart], aPos, aStr.mLength); in find_first_not_of()
837 if (aPos >= mLength) return (size_t)-1; in find_first_not_of()
845 for (size_t i=aPos; i < mLength; ++i) { in find_first_not_of()
863 return find_last_not_of(&aStr.mRep->mBuffer[aStr.mStart], aPos, aStr.mLength); in find_last_not_of()
871 if (mLength == 0) return (size_t)-1; in find_last_not_of()
872 size_t pos = DW_MIN(aPos, mLength - 1); in find_last_not_of()
899 assert(aPos <= mLength); in substr()
900 size_t pos = DW_MIN(aPos, mLength); in substr()
901 size_t len = DW_MIN(aLen, mLength - pos); in substr()
908 return compare(0, mLength, aStr, 0, aStr.mLength); in compare()
914 return compare(aPos1, aLen1, aStr, 0, aStr.mLength); in compare()
921 assert(aPos1 <= mLength); in compare()
922 assert(aPos2 <= aStr.mLength); in compare()
923 size_t pos1 = DW_MIN(aPos1, mLength); in compare()
925 size_t len1 = DW_MIN(aLen1, mLength - pos1); in compare()
926 size_t pos2 = DW_MIN(aPos2, aStr.mLength); in compare()
928 size_t len2 = DW_MIN(aLen2, aStr.mLength - pos2); in compare()
946 return compare(0, mLength, aCstr, len); in compare()
954 assert(aPos1 <= mLength); in compare()
958 size_t pos1 = DW_MIN(aPos1, mLength); in compare()
960 size_t len1 = DW_MIN(aLen1, mLength - pos1); in compare()
994 for (size_t i=0; i < mLength; ++i) { in ConvertToLowerCase()
1006 for (size_t i=0; i < mLength; ++i) { in ConvertToUpperCase()
1016 while (mLength > 0) { in Trim()
1019 --mLength; in Trim()
1027 i = mLength - 1; in Trim()
1028 while (mLength > 0) { in Trim()
1030 --mLength; in Trim()
1037 if (mLength == 0) { in Trim()
1046 for (size_t i=0; i < mLength; ++i) { in WriteTo()
1061 mLength = aLen; in TakeBuffer()
1091 *aLen = mLength = 0; in ReleaseBuffer()
1096 *aLen = mLength; in ReleaseBuffer()
1099 mLength = 0; in ReleaseBuffer()
1107 size_t len = mLength; in CopyTo()
1120 aStr->mLength = len; in CopyTo()
1129 size_t size = mLength + 1; in _copy()
1135 mem_copy(from, mLength, to); in _copy()
1136 to[mLength] = 0; in _copy()
1146 mLength = 0; in _copy()
1150 mLength = 0; in _copy()
1158 assert(aPos1 <= mLength); in _replace()
1160 size_t pos1 = DW_MIN(aPos1, mLength); in _replace()
1161 size_t len1 = DW_MIN(aLen1, mLength - pos1); in _replace()
1162 assert(mStart + mLength - len1 < ((size_t)-1) - aLen2); in _replace()
1163 size_t len2 = DW_MIN(aLen2, ((size_t)-1) - (mStart + mLength - len1)); in _replace()
1167 size_t newLen = (mLength - len1) + len2; in _replace()
1174 mLength = 0; in _replace()
1189 for (i=0; i < mLength - pos1 - len1; ++i) *to++ = *from++; in _replace()
1197 mLength = newLen; in _replace()
1207 for (i=0; i < mLength - pos1 - len1; ++i) *to++ = *from++; in _replace()
1209 mLength = newLen; in _replace()
1214 from = mRep->mBuffer + mStart + mLength - 1; in _replace()
1216 for (i=0; i < mLength-pos1-len1; ++i) *to-- = *from--; in _replace()
1219 mLength = newLen; in _replace()
1229 mLength = newLen; in _replace()
1234 from = mRep->mBuffer + mStart + mLength - 1; in _replace()
1236 for (i=0; i < mLength-pos1-len1; ++i) *to-- = *from--; in _replace()
1243 mLength = newLen; in _replace()
1250 assert(aPos1 <= mLength); in _replace()
1251 size_t pos1 = DW_MIN(aPos1, mLength); in _replace()
1252 size_t len1 = DW_MIN(aLen1, mLength - pos1); in _replace()
1253 assert(mStart + mLength - len1 < ((size_t)-1) - aLen2); in _replace()
1254 size_t len2 = DW_MIN(aLen2, ((size_t)-1) - (mStart + mLength - len1)); in _replace()
1258 size_t newLen = mLength - len1 + len2; in _replace()
1265 mLength = 0; in _replace()
1279 for (i=0; i < mLength - pos1 - len1; ++i) *to++ = *from++; in _replace()
1287 mLength = newLen; in _replace()
1296 for (i=0; i < mLength - pos1 - len1; ++i) *to++ = *from++; in _replace()
1298 mLength = newLen; in _replace()
1303 from = mRep->mBuffer + mStart + mLength - 1; in _replace()
1305 for (i=0; i < mLength-pos1-len1; ++i) *to-- = *from--; in _replace()
1307 mLength = newLen; in _replace()
1316 mLength = newLen; in _replace()
1321 from = mRep->mBuffer + mStart + mLength - 1; in _replace()
1323 for (i=0; i < mLength-pos1-len1; ++i) *to-- = *from--; in _replace()
1329 mLength = newLen; in _replace()
1344 aStrm << "Length: " << mLength << "\n"; in PrintDebugInfo()
1346 for (size_t i=0; i < mLength && i < 64; ++i) { in PrintDebugInfo()