source: mainline/kernel/generic/src/lib/string.c@ 4527fb5

lfn serial ticket/834-toolchain-update topic/msim-upgrade topic/simplify-dev-export
Last change on this file since 4527fb5 was a7b1071, checked in by Jiri Svoboda <jirik.svoboda@…>, 16 years ago

Fix bugs in kconsole, simplify string comparisons.

  • Property mode set to 100644
File size: 16.6 KB
RevLine 
[16da5f8e]1/*
2 * Copyright (c) 2001-2004 Jakub Jermar
3 * All rights reserved.
4 *
5 * Redistribution and use in source and binary forms, with or without
6 * modification, are permitted provided that the following conditions
7 * are met:
8 *
9 * - Redistributions of source code must retain the above copyright
10 * notice, this list of conditions and the following disclaimer.
11 * - Redistributions in binary form must reproduce the above copyright
12 * notice, this list of conditions and the following disclaimer in the
13 * documentation and/or other materials provided with the distribution.
14 * - The name of the author may not be used to endorse or promote products
15 * derived from this software without specific prior written permission.
16 *
17 * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR
18 * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
19 * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
20 * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT,
21 * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
22 * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
23 * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
24 * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
25 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF
26 * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
27 */
28
[2f57690]29/** @addtogroup generic
[16da5f8e]30 * @{
31 */
32
33/**
34 * @file
[82bb9c1]35 * @brief String functions.
36 *
37 * Strings and characters use the Universal Character Set (UCS). The standard
38 * strings, called just strings are encoded in UTF-8. Wide strings (encoded
39 * in UTF-32) are supported to a limited degree. A single character is
[b888d5f]40 * represented as wchar_t.@n
[82bb9c1]41 *
[b888d5f]42 * Overview of the terminology:@n
[82bb9c1]43 *
[b888d5f]44 * Term Meaning
45 * -------------------- ----------------------------------------------------
46 * byte 8 bits stored in uint8_t (unsigned 8 bit integer)
[82bb9c1]47 *
[b888d5f]48 * character UTF-32 encoded Unicode character, stored in wchar_t
49 * (signed 32 bit integer), code points 0 .. 1114111
50 * are valid
[82bb9c1]51 *
[b888d5f]52 * ASCII character 7 bit encoded ASCII character, stored in char
53 * (usually signed 8 bit integer), code points 0 .. 127
54 * are valid
55 *
56 * string UTF-8 encoded NULL-terminated Unicode string, char *
57 *
58 * wide string UTF-32 encoded NULL-terminated Unicode string,
59 * wchar_t *
60 *
61 * [wide] string size number of BYTES in a [wide] string (excluding
62 * the NULL-terminator), size_t
63 *
64 * [wide] string length number of CHARACTERS in a [wide] string (excluding
65 * the NULL-terminator), count_t
66 *
67 * [wide] string width number of display cells on a monospace display taken
68 * by a [wide] string, count_t
69 *
70 *
71 * Overview of string metrics:@n
72 *
73 * Metric Abbrev. Type Meaning
74 * ------ ------ ------ -------------------------------------------------
75 * size n size_t number of BYTES in a string (excluding the
76 * NULL-terminator)
77 *
78 * length l count_t number of CHARACTERS in a string (excluding the
79 * null terminator)
80 *
81 * width w count_t number of display cells on a monospace display
82 * taken by a string
83 *
84 *
85 * Function naming prefixes:@n
86 *
87 * chr_ operate on characters
88 * ascii_ operate on ASCII characters
89 * str_ operate on strings
90 * wstr_ operate on wide strings
91 *
92 * [w]str_[n|l|w] operate on a prefix limited by size, length
93 * or width
94 *
95 *
96 * A specific character inside a [wide] string can be referred to by:@n
97 *
98 * pointer (char *, wchar_t *)
99 * byte offset (size_t)
100 * character index (count_t)
[82bb9c1]101 *
[16da5f8e]102 */
103
104#include <string.h>
105#include <print.h>
106#include <cpu.h>
107#include <arch/asm.h>
108#include <arch.h>
[d09f84e6]109#include <errno.h>
[b888d5f]110#include <align.h>
[16da5f8e]111
[b888d5f]112/** Byte mask consisting of lowest @n bits (out of 8) */
113#define LO_MASK_8(n) ((uint8_t) ((1 << (n)) - 1))
[0dd1d444]114
[b888d5f]115/** Byte mask consisting of lowest @n bits (out of 32) */
116#define LO_MASK_32(n) ((uint32_t) ((1 << (n)) - 1))
[32704cb]117
[b888d5f]118/** Byte mask consisting of highest @n bits (out of 8) */
119#define HI_MASK_8(n) (~LO_MASK_8(8 - (n)))
[32704cb]120
[b888d5f]121/** Number of data bits in a UTF-8 continuation byte */
122#define CONT_BITS 6
[0dd1d444]123
[b888d5f]124/** Decode a single character from a string.
[21a639b7]125 *
[b888d5f]126 * Decode a single character from a string of size @a size. Decoding starts
[e1813cf]127 * at @a offset and this offset is moved to the beginning of the next
128 * character. In case of decoding error, offset generally advances at least
[b888d5f]129 * by one. However, offset is never moved beyond size.
[21a639b7]130 *
[b888d5f]131 * @param str String (not necessarily NULL-terminated).
132 * @param offset Byte offset in string where to start decoding.
133 * @param size Size of the string (in bytes).
134 *
[c8bf88d]135 * @return Value of decoded character, U_SPECIAL on decoding error or
[b888d5f]136 * NULL if attempt to decode beyond @a size.
[21a639b7]137 *
138 */
[b888d5f]139wchar_t str_decode(const char *str, size_t *offset, size_t size)
[21a639b7]140{
[b888d5f]141 if (*offset + 1 > size)
142 return 0;
143
144 /* First byte read from string */
145 uint8_t b0 = (uint8_t) str[(*offset)++];
146
147 /* Determine code length */
148
149 unsigned int b0_bits; /* Data bits in first byte */
150 unsigned int cbytes; /* Number of continuation bytes */
151
[0dd1d444]152 if ((b0 & 0x80) == 0) {
153 /* 0xxxxxxx (Plain ASCII) */
154 b0_bits = 7;
155 cbytes = 0;
156 } else if ((b0 & 0xe0) == 0xc0) {
157 /* 110xxxxx 10xxxxxx */
158 b0_bits = 5;
159 cbytes = 1;
160 } else if ((b0 & 0xf0) == 0xe0) {
161 /* 1110xxxx 10xxxxxx 10xxxxxx */
162 b0_bits = 4;
163 cbytes = 2;
164 } else if ((b0 & 0xf8) == 0xf0) {
165 /* 11110xxx 10xxxxxx 10xxxxxx 10xxxxxx */
166 b0_bits = 3;
167 cbytes = 3;
168 } else {
[b888d5f]169 /* 10xxxxxx -- unexpected continuation byte */
[c8bf88d]170 return U_SPECIAL;
[74c8da2c]171 }
[b888d5f]172
173 if (*offset + cbytes > size)
[c8bf88d]174 return U_SPECIAL;
[b888d5f]175
176 wchar_t ch = b0 & LO_MASK_8(b0_bits);
177
178 /* Decode continuation bytes */
[0dd1d444]179 while (cbytes > 0) {
[b888d5f]180 uint8_t b = (uint8_t) str[(*offset)++];
181
182 /* Must be 10xxxxxx */
183 if ((b & 0xc0) != 0x80)
[c8bf88d]184 return U_SPECIAL;
[b888d5f]185
186 /* Shift data bits to ch */
[0dd1d444]187 ch = (ch << CONT_BITS) | (wchar_t) (b & LO_MASK_8(CONT_BITS));
[b888d5f]188 cbytes--;
[74c8da2c]189 }
[b888d5f]190
[0dd1d444]191 return ch;
[74c8da2c]192}
193
[e1813cf]194/** Encode a single character to string representation.
[74c8da2c]195 *
[e1813cf]196 * Encode a single character to string representation (i.e. UTF-8) and store
197 * it into a buffer at @a offset. Encoding starts at @a offset and this offset
198 * is moved to the position where the next character can be written to.
[74c8da2c]199 *
[b888d5f]200 * @param ch Input character.
201 * @param str Output buffer.
202 * @param offset Byte offset where to start writing.
203 * @param size Size of the output buffer (in bytes).
[74c8da2c]204 *
[d09f84e6]205 * @return EOK if the character was encoded successfully, EOVERFLOW if there
206 * was not enough space in the output buffer or EINVAL if the character
207 * code was invalid.
[74c8da2c]208 */
[b888d5f]209int chr_encode(const wchar_t ch, char *str, size_t *offset, size_t size)
[74c8da2c]210{
[b888d5f]211 if (*offset >= size)
[d09f84e6]212 return EOVERFLOW;
[b888d5f]213
214 if (!chr_check(ch))
[d09f84e6]215 return EINVAL;
[b888d5f]216
217 /* Unsigned version of ch (bit operations should only be done
218 on unsigned types). */
219 uint32_t cc = (uint32_t) ch;
220
221 /* Determine how many continuation bytes are needed */
222
223 unsigned int b0_bits; /* Data bits in first byte */
224 unsigned int cbytes; /* Number of continuation bytes */
225
[32704cb]226 if ((cc & ~LO_MASK_32(7)) == 0) {
227 b0_bits = 7;
228 cbytes = 0;
229 } else if ((cc & ~LO_MASK_32(11)) == 0) {
230 b0_bits = 5;
231 cbytes = 1;
232 } else if ((cc & ~LO_MASK_32(16)) == 0) {
233 b0_bits = 4;
234 cbytes = 2;
235 } else if ((cc & ~LO_MASK_32(21)) == 0) {
236 b0_bits = 3;
237 cbytes = 3;
238 } else {
[b888d5f]239 /* Codes longer than 21 bits are not supported */
[d09f84e6]240 return EINVAL;
[74c8da2c]241 }
[b888d5f]242
243 /* Check for available space in buffer */
244 if (*offset + cbytes >= size)
[d09f84e6]245 return EOVERFLOW;
[b888d5f]246
247 /* Encode continuation bytes */
248 unsigned int i;
249 for (i = cbytes; i > 0; i--) {
[e1813cf]250 str[*offset + i] = 0x80 | (cc & LO_MASK_32(CONT_BITS));
[32704cb]251 cc = cc >> CONT_BITS;
[74c8da2c]252 }
[b888d5f]253
254 /* Encode first byte */
[e1813cf]255 str[*offset] = (cc & LO_MASK_32(b0_bits)) | HI_MASK_8(8 - b0_bits - 1);
[b888d5f]256
257 /* Advance offset */
258 *offset += cbytes + 1;
[74c8da2c]259
[d09f84e6]260 return EOK;
[74c8da2c]261}
262
[b888d5f]263/** Get size of string.
264 *
265 * Get the number of bytes which are used by the string @a str (excluding the
266 * NULL-terminator).
267 *
268 * @param str String to consider.
269 *
270 * @return Number of bytes used by the string
[82bb9c1]271 *
272 */
[b888d5f]273size_t str_size(const char *str)
[82bb9c1]274{
[b888d5f]275 size_t size = 0;
276
277 while (*str++ != 0)
278 size++;
279
280 return size;
[82bb9c1]281}
282
[b888d5f]283/** Get size of wide string.
284 *
285 * Get the number of bytes which are used by the wide string @a str (excluding the
286 * NULL-terminator).
287 *
288 * @param str Wide string to consider.
289 *
290 * @return Number of bytes used by the wide string
291 *
292 */
293size_t wstr_size(const wchar_t *str)
294{
295 return (wstr_length(str) * sizeof(wchar_t));
296}
297
298/** Get size of string with length limit.
[74c8da2c]299 *
[f25b2819]300 * Get the number of bytes which are used by up to @a max_len first
301 * characters in the string @a str. If @a max_len is greater than
[b888d5f]302 * the length of @a str, the entire string is measured (excluding the
303 * NULL-terminator).
304 *
305 * @param str String to consider.
306 * @param max_len Maximum number of characters to measure.
[74c8da2c]307 *
[b888d5f]308 * @return Number of bytes used by the characters.
[74c8da2c]309 *
310 */
[f25b2819]311size_t str_lsize(const char *str, count_t max_len)
[74c8da2c]312{
[f25b2819]313 count_t len = 0;
[b888d5f]314 size_t offset = 0;
315
316 while (len < max_len) {
317 if (str_decode(str, &offset, STR_NO_LIMIT) == 0)
[b54d2f1]318 break;
[b888d5f]319
[f25b2819]320 len++;
[21a639b7]321 }
[b888d5f]322
323 return offset;
[74c8da2c]324}
325
[b888d5f]326/** Get size of wide string with length limit.
[82bb9c1]327 *
[b888d5f]328 * Get the number of bytes which are used by up to @a max_len first
329 * wide characters in the wide string @a str. If @a max_len is greater than
330 * the length of @a str, the entire wide string is measured (excluding the
331 * NULL-terminator).
332 *
333 * @param str Wide string to consider.
334 * @param max_len Maximum number of wide characters to measure.
[82bb9c1]335 *
[b888d5f]336 * @return Number of bytes used by the wide characters.
[82bb9c1]337 *
338 */
[b888d5f]339size_t wstr_lsize(const wchar_t *str, count_t max_len)
[82bb9c1]340{
[b888d5f]341 return (wstr_nlength(str, max_len * sizeof(wchar_t)) * sizeof(wchar_t));
[82bb9c1]342}
343
[b888d5f]344/** Get number of characters in a string.
[82bb9c1]345 *
[b888d5f]346 * @param str NULL-terminated string.
[82bb9c1]347 *
[b888d5f]348 * @return Number of characters in string.
[82bb9c1]349 *
350 */
[b888d5f]351count_t str_length(const char *str)
[82bb9c1]352{
[b888d5f]353 count_t len = 0;
354 size_t offset = 0;
355
356 while (str_decode(str, &offset, STR_NO_LIMIT) != 0)
357 len++;
358
359 return len;
[82bb9c1]360}
361
[b888d5f]362/** Get number of characters in a wide string.
[74c8da2c]363 *
[b888d5f]364 * @param str NULL-terminated wide string.
365 *
366 * @return Number of characters in @a str.
[74c8da2c]367 *
368 */
[b888d5f]369count_t wstr_length(const wchar_t *wstr)
[74c8da2c]370{
[b888d5f]371 count_t len = 0;
[74c8da2c]372
[b888d5f]373 while (*wstr++ != 0)
374 len++;
375
376 return len;
[74c8da2c]377}
378
[b888d5f]379/** Get number of characters in a string with size limit.
380 *
381 * @param str NULL-terminated string.
382 * @param size Maximum number of bytes to consider.
383 *
384 * @return Number of characters in string.
[74c8da2c]385 *
386 */
[b888d5f]387count_t str_nlength(const char *str, size_t size)
[74c8da2c]388{
[b888d5f]389 count_t len = 0;
390 size_t offset = 0;
[74c8da2c]391
[b888d5f]392 while (str_decode(str, &offset, size) != 0)
393 len++;
394
395 return len;
[21a639b7]396}
397
[b888d5f]398/** Get number of characters in a string with size limit.
[2f57690]399 *
[b888d5f]400 * @param str NULL-terminated string.
401 * @param size Maximum number of bytes to consider.
[74c8da2c]402 *
[f25b2819]403 * @return Number of characters in string.
[b888d5f]404 *
[74c8da2c]405 */
[b888d5f]406count_t wstr_nlength(const wchar_t *str, size_t size)
[74c8da2c]407{
[f25b2819]408 count_t len = 0;
[b888d5f]409 count_t limit = ALIGN_DOWN(size, sizeof(wchar_t));
410 count_t offset = 0;
411
412 while ((offset < limit) && (*str++ != 0)) {
[f25b2819]413 len++;
[b888d5f]414 offset += sizeof(wchar_t);
[74c8da2c]415 }
[b888d5f]416
[f25b2819]417 return len;
[74c8da2c]418}
419
[b888d5f]420/** Check whether character is plain ASCII.
421 *
422 * @return True if character is plain ASCII.
[74c8da2c]423 *
424 */
[b888d5f]425bool ascii_check(const wchar_t ch)
[74c8da2c]426{
[b888d5f]427 if ((ch >= 0) && (ch <= 127))
428 return true;
429
430 return false;
431}
[f25b2819]432
[b888d5f]433/** Check whether character is valid
434 *
435 * @return True if character is a valid Unicode code point.
436 *
437 */
438bool chr_check(const wchar_t ch)
439{
440 if ((ch >= 0) && (ch <= 1114111))
441 return true;
442
443 return false;
[16da5f8e]444}
445
[b888d5f]446/** Compare two NULL terminated strings.
[16da5f8e]447 *
[b888d5f]448 * Do a char-by-char comparison of two NULL-terminated strings.
[16da5f8e]449 * The strings are considered equal iff they consist of the same
450 * characters on the minimum of their lengths.
451 *
[b888d5f]452 * @param s1 First string to compare.
453 * @param s2 Second string to compare.
[16da5f8e]454 *
[b888d5f]455 * @return 0 if the strings are equal, -1 if first is smaller,
456 * 1 if second smaller.
[16da5f8e]457 *
458 */
[b888d5f]459int str_cmp(const char *s1, const char *s2)
[16da5f8e]460{
[a7b1071]461 wchar_t c1 = 0;
462 wchar_t c2 = 0;
[b888d5f]463
464 size_t off1 = 0;
465 size_t off2 = 0;
[a7b1071]466
467 while (true) {
468 c1 = str_decode(s1, &off1, STR_NO_LIMIT);
469 c2 = str_decode(s2, &off2, STR_NO_LIMIT);
470
[b888d5f]471 if (c1 < c2)
[16da5f8e]472 return -1;
[b888d5f]473
474 if (c1 > c2)
[16da5f8e]475 return 1;
[a7b1071]476
477 if (c1 == 0 || c2 == 0)
478 break;
[16da5f8e]479 }
[a7b1071]480
481 return 0;
[16da5f8e]482}
483
[b888d5f]484/** Compare two NULL terminated strings with length limit.
[16da5f8e]485 *
[b888d5f]486 * Do a char-by-char comparison of two NULL-terminated strings.
[16da5f8e]487 * The strings are considered equal iff they consist of the same
[b888d5f]488 * characters on the minimum of their lengths and the length limit.
[16da5f8e]489 *
[b888d5f]490 * @param s1 First string to compare.
491 * @param s2 Second string to compare.
492 * @param max_len Maximum number of characters to consider.
493 *
494 * @return 0 if the strings are equal, -1 if first is smaller,
495 * 1 if second smaller.
[16da5f8e]496 *
497 */
[b888d5f]498int str_lcmp(const char *s1, const char *s2, count_t max_len)
[16da5f8e]499{
[b888d5f]500 wchar_t c1 = 0;
501 wchar_t c2 = 0;
[16da5f8e]502
[b888d5f]503 size_t off1 = 0;
504 size_t off2 = 0;
505
506 count_t len = 0;
[a7b1071]507
508 while (true) {
509 if (len >= max_len)
[b888d5f]510 break;
[a7b1071]511
512 c1 = str_decode(s1, &off1, STR_NO_LIMIT);
513 c2 = str_decode(s2, &off2, STR_NO_LIMIT);
514
[b888d5f]515 if (c1 < c2)
[16da5f8e]516 return -1;
[a7b1071]517
[b888d5f]518 if (c1 > c2)
[16da5f8e]519 return 1;
[a7b1071]520
521 if (c1 == 0 || c2 == 0)
522 break;
523
524 ++len;
[16da5f8e]525 }
[a7b1071]526
527 return 0;
528
[16da5f8e]529}
530
[b888d5f]531/** Copy NULL-terminated string.
532 *
533 * Copy source string @a src to destination buffer @a dst.
534 * No more than @a size bytes are written. NULL-terminator is always
535 * written after the last succesfully copied character (i.e. if the
536 * destination buffer is has at least 1 byte, it will be always
537 * NULL-terminated).
538 *
539 * @param src Source string.
540 * @param dst Destination buffer.
541 * @param count Size of the destination buffer.
542 *
543 */
544void str_ncpy(char *dst, const char *src, size_t size)
545{
546 /* No space for the NULL-terminator in the buffer */
547 if (size == 0)
548 return;
549
550 wchar_t ch;
551 size_t str_off = 0;
552 size_t dst_off = 0;
553
[a7b1071]554 while ((ch = str_decode(src, &str_off, STR_NO_LIMIT)) != 0) {
[b888d5f]555 if (chr_encode(ch, dst, &dst_off, size) != EOK)
556 break;
557 }
558
559 if (dst_off >= size)
560 dst[size - 1] = 0;
561 else
562 dst[dst_off] = 0;
563}
[16da5f8e]564
[b888d5f]565/** Copy NULL-terminated wide string to string
566 *
567 * Copy source wide string @a src to destination buffer @a dst.
568 * No more than @a size bytes are written. NULL-terminator is always
569 * written after the last succesfully copied character (i.e. if the
570 * destination buffer is has at least 1 byte, it will be always
571 * NULL-terminated).
[16da5f8e]572 *
[b888d5f]573 * @param src Source wide string.
574 * @param dst Destination buffer.
575 * @param count Size of the destination buffer.
[16da5f8e]576 *
577 */
[b888d5f]578void wstr_nstr(char *dst, const wchar_t *src, size_t size)
[16da5f8e]579{
[b888d5f]580 /* No space for the NULL-terminator in the buffer */
581 if (size == 0)
582 return;
[2f57690]583
[b888d5f]584 wchar_t ch;
585 count_t src_idx = 0;
586 size_t dst_off = 0;
587
588 while ((ch = src[src_idx++]) != 0) {
589 if (chr_encode(ch, dst, &dst_off, size) != EOK)
590 break;
[16da5f8e]591 }
[2f57690]592
[b888d5f]593 if (dst_off >= size)
594 dst[size - 1] = 0;
595 else
596 dst[dst_off] = 0;
[16da5f8e]597}
598
[20f1597]599/** Find first occurence of character in string.
600 *
[b888d5f]601 * @param str String to search.
602 * @param ch Character to look for.
603 *
604 * @return Pointer to character in @a str or NULL if not found.
[20f1597]605 *
606 */
[b888d5f]607const char *str_chr(const char *str, wchar_t ch)
[20f1597]608{
[b888d5f]609 wchar_t acc;
610 size_t off = 0;
611
[a7b1071]612 while ((acc = str_decode(str, &off, STR_NO_LIMIT)) != 0) {
[b888d5f]613 if (acc == ch)
614 return (str + off);
[20f1597]615 }
[2f57690]616
[20f1597]617 return NULL;
618}
619
[b888d5f]620/** Insert a wide character into a wide string.
621 *
622 * Insert a wide character into a wide string at position
623 * @a pos. The characters after the position are shifted.
624 *
625 * @param str String to insert to.
626 * @param ch Character to insert to.
627 * @param pos Character index where to insert.
628 @ @param max_pos Characters in the buffer.
629 *
630 * @return True if the insertion was sucessful, false if the position
631 * is out of bounds.
632 *
633 */
634bool wstr_linsert(wchar_t *str, wchar_t ch, count_t pos, count_t max_pos)
635{
636 count_t len = wstr_length(str);
637
638 if ((pos > len) || (pos + 1 > max_pos))
639 return false;
640
641 count_t i;
642 for (i = len; i + 1 > pos; i--)
643 str[i + 1] = str[i];
644
645 str[pos] = ch;
646
647 return true;
648}
649
650/** Remove a wide character from a wide string.
651 *
652 * Remove a wide character from a wide string at position
653 * @a pos. The characters after the position are shifted.
654 *
655 * @param str String to remove from.
656 * @param pos Character index to remove.
657 *
658 * @return True if the removal was sucessful, false if the position
659 * is out of bounds.
660 *
661 */
662bool wstr_remove(wchar_t *str, count_t pos)
663{
664 count_t len = wstr_length(str);
665
666 if (pos >= len)
667 return false;
668
669 count_t i;
670 for (i = pos + 1; i <= len; i++)
671 str[i - 1] = str[i];
672
673 return true;
674}
675
[16da5f8e]676/** @}
677 */
Note: See TracBrowser for help on using the repository browser.