Lines Matching refs:len

42          len = 0;  in Simstr()
48 len = strlen(s_); in Simstr()
49 sz = new char[len+1]; in Simstr()
50 memcpy(sz,s_,len+1); in Simstr()
58 len = 0; in Simstr()
66 len = slen < nrOfBytes in Simstr()
69 sz = new char[len+1]; in Simstr()
70 memcpy( sz, anybytes, len ); in Simstr()
71 *( sz + len ) = 0; in Simstr()
78 len = 0; in Simstr()
84 len = anzahl; in Simstr()
85 sz = new char[len+1]; in Simstr()
87 sz[len] = 0; in Simstr()
98 len = 0; in Simstr()
105 len = maxLen < nrOfBytes in Simstr()
108 sz = new char[len+1]; in Simstr()
109 memcpy(sz,anybytes+firstBytesPos,len); in Simstr()
110 *(sz+len) = 0; in Simstr()
117 len = S.len; in Simstr()
118 sz = new char[len+1]; in Simstr()
119 memcpy(sz,S.sz,len+1); in Simstr()
129 len = S.len; in operator =()
130 sz = new char[len+1]; in operator =()
131 memcpy(sz,S.sz,len+1); in operator =()
146 if (n >= long(len) || n < 0) in ch()
219 Simstr::get(int n) const { return (n >= len || n < 0) ? 0 : sz[n]; } in get()
225 Simstr::get_back() const { return len ? sz[len-1] : 0; } in get_back()
230 if (startPos >= len || startPos < 0 || anzahl < 1) in get()
233 int anz = len - startPos < anzahl ? len - startPos : anzahl; in get()
243 int anz = len < anzahl ? len : anzahl; in get_front()
255 int anz = len < anzahl ? len : anzahl; in get_back()
258 int start = len-anz; in get_back()
280 return get_back(len-posc-1); in get_last_token()
292 if (pos < 0 || pos > len) in insert()
295 char * result = new char[len+2]; in insert()
299 memcpy(result+pos+1,sz+pos,len-pos+1); in insert()
303 len++; in insert()
309 char * result = new char[len+2]; in push_front()
312 memcpy(result+1,sz,len+1); in push_front()
316 len++; in push_front()
322 char * result = new char[len+2]; in push_back()
324 memcpy(result,sz,len); in push_back()
325 result[len] = c; in push_back()
326 result[len+1] = 0; in push_back()
330 len++; in push_back()
336 if (pos < 0 || pos > len) in insert()
339 char * result = new char[len+1+S.len]; in insert()
342 memcpy(result+pos,S.sz,S.len); in insert()
343 memcpy(result+pos+S.len,sz+pos,len-pos+1); in insert()
347 len += S.len; in insert()
353 char * result = new char[len+1+S.len]; in push_front()
355 memcpy(result,S.sz,S.len); in push_front()
356 memcpy(result+S.len,sz,len+1); in push_front()
360 len += S.len; in push_front()
366 char * result = new char[len+1+S.len]; in push_back()
368 memcpy(result,sz,len); in push_back()
369 memcpy(result+len,S.sz,S.len+1); in push_back()
373 len += S.len; in push_back()
382 if (pos >= len || pos < 0 || anzahl < 1) in remove()
385 int anz = len - pos < anzahl ? len - pos : anzahl; in remove()
387 char * result = new char[len-anz+1]; in remove()
390 memcpy(result+pos,sz+pos+anz,len-pos-anz+1); in remove()
394 len -= anz; in remove()
400 int newlen = len-1; in remove_trailing_blanks()
403 if (newlen < len-1) in remove_trailing_blanks()
404 remove ( newlen+1, len-newlen); in remove_trailing_blanks()
412 int anz = len < anzahl ? len : anzahl; in pop_front()
414 char * result = new char[len-anz+1]; in pop_front()
416 memcpy(result,sz+anz,len-anz+1); in pop_front()
420 len -= anz; in pop_front()
429 int anz = len < anzahl ? len : anzahl; in pop_back()
431 char * result = new char[len-anz+1]; in pop_back()
433 memcpy(result,sz,len-anz); in pop_back()
434 result[len-anz] = 0; in pop_back()
438 len -= anz; in pop_back()
445 pop_back(len-removeStartPos); in rem_back_from()
451 if (!len) in remove_all()
453 char * result = new char[len]; in remove_all()
455 for (i = 0; i < len; i++) in remove_all()
463 len = j; in remove_all()
472 remove(pos,S.len); in remove_all()
481 while ( start < len in strip()
489 while (start < len && sz[start] == c) in strip()
493 int ende = len-1; in strip()
513 if (len > 0) in empty()
518 len = 0; in empty()
538 len = 0; in take_first_token()
551 ret = get_back(len-pos-1); in take_last_token()
552 pop_back(len-pos); in take_last_token()
560 len = 0; in take_last_token()
574 for (i = 0; i < len ? sz[i] != c : false; i++) ; in pos_first()
575 if (i >= len) in pos_first()
588 for (; i < len ? sz[i] != c : false; i++) ; in pos_first_after()
589 if (i >= len) in pos_first_after()
600 for (i = len-1; i >= 0 ? sz[i] != c : false; i--) ; in pos_last()
622 for (i = len-S.len; i >= 0 ; i--) in pos_last()
624 vgl = get(i,S.len); in pos_last()
638 for (int i =0; i < len; i++) in count()
647 if (!len) in is_no_text()
651 for (i = 0; sz[i] <= 32 && i < len; i++) ; in is_no_text()
652 if (i < len) in is_no_text()
662 if (pos < 0 || pos >= len) in replace()
671 if (startPos >= len || startPos < 0 || anzahl < 1) in replace()
674 int anz = len - startPos < anzahl ? len - startPos : anzahl; in replace()
676 char * result = new char[len-anz+S.len+1]; in replace()
679 memcpy(result+startPos, S.sz, S.len); in replace()
680 memcpy(result+startPos+S.len, sz+startPos+anz, len-startPos-anz+1); in replace()
684 len = len-anz+S.len; in replace()
690 for (int i=0; i < len; i++) in replace_all()
700 while (i <= len-oldS.len) in replace_all()
702 vgl = get(i,oldS.len); in replace_all()
705 replace(i,oldS.len,newS); in replace_all()
706 i += newS.len; in replace_all()
716 for (int i = 0; i < len; i++) in to_lower()