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

lfn serial ticket/834-toolchain-update topic/msim-upgrade topic/simplify-dev-export
Last change on this file since b888d5f was b888d5f, checked in by Martin Decky <martin@…>, 16 years ago

cleanup and extend string functions according to agreed conventions

  • Property mode set to 100644
File size: 16.8 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
[74c8da2c]112char invalch = '?';
113
[b888d5f]114/** Byte mask consisting of lowest @n bits (out of 8) */
115#define LO_MASK_8(n) ((uint8_t) ((1 << (n)) - 1))
[0dd1d444]116
[b888d5f]117/** Byte mask consisting of lowest @n bits (out of 32) */
118#define LO_MASK_32(n) ((uint32_t) ((1 << (n)) - 1))
[32704cb]119
[b888d5f]120/** Byte mask consisting of highest @n bits (out of 8) */
121#define HI_MASK_8(n) (~LO_MASK_8(8 - (n)))
[32704cb]122
[b888d5f]123/** Number of data bits in a UTF-8 continuation byte */
124#define CONT_BITS 6
[0dd1d444]125
[b888d5f]126/** Decode a single character from a string.
[21a639b7]127 *
[b888d5f]128 * Decode a single character from a string of size @a size. Decoding starts
[e1813cf]129 * at @a offset and this offset is moved to the beginning of the next
130 * character. In case of decoding error, offset generally advances at least
[b888d5f]131 * by one. However, offset is never moved beyond size.
[21a639b7]132 *
[b888d5f]133 * @param str String (not necessarily NULL-terminated).
134 * @param offset Byte offset in string where to start decoding.
135 * @param size Size of the string (in bytes).
136 *
137 * @return Value of decoded character, invalch on decoding error or
138 * NULL if attempt to decode beyond @a size.
[21a639b7]139 *
140 */
[b888d5f]141wchar_t str_decode(const char *str, size_t *offset, size_t size)
[21a639b7]142{
[b888d5f]143 if (*offset + 1 > size)
144 return 0;
145
146 /* First byte read from string */
147 uint8_t b0 = (uint8_t) str[(*offset)++];
148
149 /* Determine code length */
150
151 unsigned int b0_bits; /* Data bits in first byte */
152 unsigned int cbytes; /* Number of continuation bytes */
153
[0dd1d444]154 if ((b0 & 0x80) == 0) {
155 /* 0xxxxxxx (Plain ASCII) */
156 b0_bits = 7;
157 cbytes = 0;
158 } else if ((b0 & 0xe0) == 0xc0) {
159 /* 110xxxxx 10xxxxxx */
160 b0_bits = 5;
161 cbytes = 1;
162 } else if ((b0 & 0xf0) == 0xe0) {
163 /* 1110xxxx 10xxxxxx 10xxxxxx */
164 b0_bits = 4;
165 cbytes = 2;
166 } else if ((b0 & 0xf8) == 0xf0) {
167 /* 11110xxx 10xxxxxx 10xxxxxx 10xxxxxx */
168 b0_bits = 3;
169 cbytes = 3;
170 } else {
[b888d5f]171 /* 10xxxxxx -- unexpected continuation byte */
[0dd1d444]172 return invalch;
[74c8da2c]173 }
[b888d5f]174
175 if (*offset + cbytes > size)
[0dd1d444]176 return invalch;
[b888d5f]177
178 wchar_t ch = b0 & LO_MASK_8(b0_bits);
179
180 /* Decode continuation bytes */
[0dd1d444]181 while (cbytes > 0) {
[b888d5f]182 uint8_t b = (uint8_t) str[(*offset)++];
183
184 /* Must be 10xxxxxx */
185 if ((b & 0xc0) != 0x80)
[74c8da2c]186 return invalch;
[b888d5f]187
188 /* Shift data bits to ch */
[0dd1d444]189 ch = (ch << CONT_BITS) | (wchar_t) (b & LO_MASK_8(CONT_BITS));
[b888d5f]190 cbytes--;
[74c8da2c]191 }
[b888d5f]192
[0dd1d444]193 return ch;
[74c8da2c]194}
195
[e1813cf]196/** Encode a single character to string representation.
[74c8da2c]197 *
[e1813cf]198 * Encode a single character to string representation (i.e. UTF-8) and store
199 * it into a buffer at @a offset. Encoding starts at @a offset and this offset
200 * is moved to the position where the next character can be written to.
[74c8da2c]201 *
[b888d5f]202 * @param ch Input character.
203 * @param str Output buffer.
204 * @param offset Byte offset where to start writing.
205 * @param size Size of the output buffer (in bytes).
[74c8da2c]206 *
[d09f84e6]207 * @return EOK if the character was encoded successfully, EOVERFLOW if there
208 * was not enough space in the output buffer or EINVAL if the character
209 * code was invalid.
[74c8da2c]210 */
[b888d5f]211int chr_encode(const wchar_t ch, char *str, size_t *offset, size_t size)
[74c8da2c]212{
[b888d5f]213 if (*offset >= size)
[d09f84e6]214 return EOVERFLOW;
[b888d5f]215
216 if (!chr_check(ch))
[d09f84e6]217 return EINVAL;
[b888d5f]218
219 /* Unsigned version of ch (bit operations should only be done
220 on unsigned types). */
221 uint32_t cc = (uint32_t) ch;
222
223 /* Determine how many continuation bytes are needed */
224
225 unsigned int b0_bits; /* Data bits in first byte */
226 unsigned int cbytes; /* Number of continuation bytes */
227
[32704cb]228 if ((cc & ~LO_MASK_32(7)) == 0) {
229 b0_bits = 7;
230 cbytes = 0;
231 } else if ((cc & ~LO_MASK_32(11)) == 0) {
232 b0_bits = 5;
233 cbytes = 1;
234 } else if ((cc & ~LO_MASK_32(16)) == 0) {
235 b0_bits = 4;
236 cbytes = 2;
237 } else if ((cc & ~LO_MASK_32(21)) == 0) {
238 b0_bits = 3;
239 cbytes = 3;
240 } else {
[b888d5f]241 /* Codes longer than 21 bits are not supported */
[d09f84e6]242 return EINVAL;
[74c8da2c]243 }
[b888d5f]244
245 /* Check for available space in buffer */
246 if (*offset + cbytes >= size)
[d09f84e6]247 return EOVERFLOW;
[b888d5f]248
249 /* Encode continuation bytes */
250 unsigned int i;
251 for (i = cbytes; i > 0; i--) {
[e1813cf]252 str[*offset + i] = 0x80 | (cc & LO_MASK_32(CONT_BITS));
[32704cb]253 cc = cc >> CONT_BITS;
[74c8da2c]254 }
[b888d5f]255
256 /* Encode first byte */
[e1813cf]257 str[*offset] = (cc & LO_MASK_32(b0_bits)) | HI_MASK_8(8 - b0_bits - 1);
[b888d5f]258
259 /* Advance offset */
260 *offset += cbytes + 1;
[74c8da2c]261
[d09f84e6]262 return EOK;
[74c8da2c]263}
264
[b888d5f]265/** Get size of string.
266 *
267 * Get the number of bytes which are used by the string @a str (excluding the
268 * NULL-terminator).
269 *
270 * @param str String to consider.
271 *
272 * @return Number of bytes used by the string
[82bb9c1]273 *
274 */
[b888d5f]275size_t str_size(const char *str)
[82bb9c1]276{
[b888d5f]277 size_t size = 0;
278
279 while (*str++ != 0)
280 size++;
281
282 return size;
[82bb9c1]283}
284
[b888d5f]285/** Get size of wide string.
286 *
287 * Get the number of bytes which are used by the wide string @a str (excluding the
288 * NULL-terminator).
289 *
290 * @param str Wide string to consider.
291 *
292 * @return Number of bytes used by the wide string
293 *
294 */
295size_t wstr_size(const wchar_t *str)
296{
297 return (wstr_length(str) * sizeof(wchar_t));
298}
299
300/** Get size of string with length limit.
[74c8da2c]301 *
[f25b2819]302 * Get the number of bytes which are used by up to @a max_len first
303 * characters in the string @a str. If @a max_len is greater than
[b888d5f]304 * the length of @a str, the entire string is measured (excluding the
305 * NULL-terminator).
306 *
307 * @param str String to consider.
308 * @param max_len Maximum number of characters to measure.
[74c8da2c]309 *
[b888d5f]310 * @return Number of bytes used by the characters.
[74c8da2c]311 *
312 */
[f25b2819]313size_t str_lsize(const char *str, count_t max_len)
[74c8da2c]314{
[f25b2819]315 count_t len = 0;
[b888d5f]316 size_t offset = 0;
317
318 while (len < max_len) {
319 if (str_decode(str, &offset, STR_NO_LIMIT) == 0)
[b54d2f1]320 break;
[b888d5f]321
[f25b2819]322 len++;
[21a639b7]323 }
[b888d5f]324
325 return offset;
[74c8da2c]326}
327
[b888d5f]328/** Get size of wide string with length limit.
[82bb9c1]329 *
[b888d5f]330 * Get the number of bytes which are used by up to @a max_len first
331 * wide characters in the wide string @a str. If @a max_len is greater than
332 * the length of @a str, the entire wide string is measured (excluding the
333 * NULL-terminator).
334 *
335 * @param str Wide string to consider.
336 * @param max_len Maximum number of wide characters to measure.
[82bb9c1]337 *
[b888d5f]338 * @return Number of bytes used by the wide characters.
[82bb9c1]339 *
340 */
[b888d5f]341size_t wstr_lsize(const wchar_t *str, count_t max_len)
[82bb9c1]342{
[b888d5f]343 return (wstr_nlength(str, max_len * sizeof(wchar_t)) * sizeof(wchar_t));
[82bb9c1]344}
345
[b888d5f]346/** Get number of characters in a string.
[82bb9c1]347 *
[b888d5f]348 * @param str NULL-terminated string.
[82bb9c1]349 *
[b888d5f]350 * @return Number of characters in string.
[82bb9c1]351 *
352 */
[b888d5f]353count_t str_length(const char *str)
[82bb9c1]354{
[b888d5f]355 count_t len = 0;
356 size_t offset = 0;
357
358 while (str_decode(str, &offset, STR_NO_LIMIT) != 0)
359 len++;
360
361 return len;
[82bb9c1]362}
363
[b888d5f]364/** Get number of characters in a wide string.
[74c8da2c]365 *
[b888d5f]366 * @param str NULL-terminated wide string.
367 *
368 * @return Number of characters in @a str.
[74c8da2c]369 *
370 */
[b888d5f]371count_t wstr_length(const wchar_t *wstr)
[74c8da2c]372{
[b888d5f]373 count_t len = 0;
[74c8da2c]374
[b888d5f]375 while (*wstr++ != 0)
376 len++;
377
378 return len;
[74c8da2c]379}
380
[b888d5f]381/** Get number of characters in a string with size limit.
382 *
383 * @param str NULL-terminated string.
384 * @param size Maximum number of bytes to consider.
385 *
386 * @return Number of characters in string.
[74c8da2c]387 *
388 */
[b888d5f]389count_t str_nlength(const char *str, size_t size)
[74c8da2c]390{
[b888d5f]391 count_t len = 0;
392 size_t offset = 0;
[74c8da2c]393
[b888d5f]394 while (str_decode(str, &offset, size) != 0)
395 len++;
396
397 return len;
[21a639b7]398}
399
[b888d5f]400/** Get number of characters in a string with size limit.
[2f57690]401 *
[b888d5f]402 * @param str NULL-terminated string.
403 * @param size Maximum number of bytes to consider.
[74c8da2c]404 *
[f25b2819]405 * @return Number of characters in string.
[b888d5f]406 *
[74c8da2c]407 */
[b888d5f]408count_t wstr_nlength(const wchar_t *str, size_t size)
[74c8da2c]409{
[f25b2819]410 count_t len = 0;
[b888d5f]411 count_t limit = ALIGN_DOWN(size, sizeof(wchar_t));
412 count_t offset = 0;
413
414 while ((offset < limit) && (*str++ != 0)) {
[f25b2819]415 len++;
[b888d5f]416 offset += sizeof(wchar_t);
[74c8da2c]417 }
[b888d5f]418
[f25b2819]419 return len;
[74c8da2c]420}
421
[b888d5f]422/** Check whether character is plain ASCII.
423 *
424 * @return True if character is plain ASCII.
[74c8da2c]425 *
426 */
[b888d5f]427bool ascii_check(const wchar_t ch)
[74c8da2c]428{
[b888d5f]429 if ((ch >= 0) && (ch <= 127))
430 return true;
431
432 return false;
433}
[f25b2819]434
[b888d5f]435/** Check whether character is valid
436 *
437 * @return True if character is a valid Unicode code point.
438 *
439 */
440bool chr_check(const wchar_t ch)
441{
442 if ((ch >= 0) && (ch <= 1114111))
443 return true;
444
445 return false;
[16da5f8e]446}
447
[b888d5f]448/** Compare two NULL terminated strings.
[16da5f8e]449 *
[b888d5f]450 * Do a char-by-char comparison of two NULL-terminated strings.
[16da5f8e]451 * The strings are considered equal iff they consist of the same
452 * characters on the minimum of their lengths.
453 *
[b888d5f]454 * @param s1 First string to compare.
455 * @param s2 Second string to compare.
[16da5f8e]456 *
[b888d5f]457 * @return 0 if the strings are equal, -1 if first is smaller,
458 * 1 if second smaller.
[16da5f8e]459 *
460 */
[b888d5f]461int str_cmp(const char *s1, const char *s2)
[16da5f8e]462{
[b888d5f]463 wchar_t c1;
464 wchar_t c2;
465
466 size_t off1 = 0;
467 size_t off2 = 0;
468
469 while ((c1 = str_decode(s1, &off1, STR_NO_LIMIT) != 0)
470 && (c2 = str_decode(s2, &off2, STR_NO_LIMIT) != 0)) {
471
472 if (off1 != off2)
473 break;
474
475 if (c1 < c2)
[16da5f8e]476 return -1;
[b888d5f]477
478 if (c1 > c2)
[16da5f8e]479 return 1;
480 }
[b888d5f]481
482 if ((off1 == off2) && (c1 == c2))
[16da5f8e]483 return 0;
[2f57690]484
[b888d5f]485 if ((c1 == 0) || (off1 < off2))
[16da5f8e]486 return -1;
[2f57690]487
[16da5f8e]488 return 1;
489}
490
[b888d5f]491/** Compare two NULL terminated strings with length limit.
[16da5f8e]492 *
[b888d5f]493 * Do a char-by-char comparison of two NULL-terminated strings.
[16da5f8e]494 * The strings are considered equal iff they consist of the same
[b888d5f]495 * characters on the minimum of their lengths and the length limit.
[16da5f8e]496 *
[b888d5f]497 * @param s1 First string to compare.
498 * @param s2 Second string to compare.
499 * @param max_len Maximum number of characters to consider.
500 *
501 * @return 0 if the strings are equal, -1 if first is smaller,
502 * 1 if second smaller.
[16da5f8e]503 *
504 */
[b888d5f]505int str_lcmp(const char *s1, const char *s2, count_t max_len)
[16da5f8e]506{
[b888d5f]507 wchar_t c1 = 0;
508 wchar_t c2 = 0;
[16da5f8e]509
[b888d5f]510 size_t off1 = 0;
511 size_t off2 = 0;
512
513 count_t len = 0;
514
515 while ((len < max_len)
516 && ((c1 = str_decode(s1, &off1, STR_NO_LIMIT)) != 0)
517 && ((c2 = str_decode(s2, &off2, STR_NO_LIMIT)) != 0)) {
518
519 if (off1 != off2)
520 break;
521
522 if (c1 < c2)
[16da5f8e]523 return -1;
[2f57690]524
[b888d5f]525 if (c1 > c2)
[16da5f8e]526 return 1;
[b888d5f]527
528 len++;
[16da5f8e]529 }
[2f57690]530
[b888d5f]531 if ((off1 == off2) && (len == max_len) && (c1 == c2))
[16da5f8e]532 return 0;
[2f57690]533
[b888d5f]534 if ((c1 == 0) || (off1 < off2))
[16da5f8e]535 return -1;
[2f57690]536
[16da5f8e]537 return 1;
538}
539
[b888d5f]540/** Copy NULL-terminated string.
541 *
542 * Copy source string @a src to destination buffer @a dst.
543 * No more than @a size bytes are written. NULL-terminator is always
544 * written after the last succesfully copied character (i.e. if the
545 * destination buffer is has at least 1 byte, it will be always
546 * NULL-terminated).
547 *
548 * @param src Source string.
549 * @param dst Destination buffer.
550 * @param count Size of the destination buffer.
551 *
552 */
553void str_ncpy(char *dst, const char *src, size_t size)
554{
555 /* No space for the NULL-terminator in the buffer */
556 if (size == 0)
557 return;
558
559 wchar_t ch;
560 size_t str_off = 0;
561 size_t dst_off = 0;
562
563 while ((ch = str_decode(src, &str_off, STR_NO_LIMIT) != 0)) {
564 if (chr_encode(ch, dst, &dst_off, size) != EOK)
565 break;
566 }
567
568 if (dst_off >= size)
569 dst[size - 1] = 0;
570 else
571 dst[dst_off] = 0;
572}
[16da5f8e]573
[b888d5f]574/** Copy NULL-terminated wide string to string
575 *
576 * Copy source wide string @a src to destination buffer @a dst.
577 * No more than @a size bytes are written. NULL-terminator is always
578 * written after the last succesfully copied character (i.e. if the
579 * destination buffer is has at least 1 byte, it will be always
580 * NULL-terminated).
[16da5f8e]581 *
[b888d5f]582 * @param src Source wide string.
583 * @param dst Destination buffer.
584 * @param count Size of the destination buffer.
[16da5f8e]585 *
586 */
[b888d5f]587void wstr_nstr(char *dst, const wchar_t *src, size_t size)
[16da5f8e]588{
[b888d5f]589 /* No space for the NULL-terminator in the buffer */
590 if (size == 0)
591 return;
[2f57690]592
[b888d5f]593 wchar_t ch;
594 count_t src_idx = 0;
595 size_t dst_off = 0;
596
597 while ((ch = src[src_idx++]) != 0) {
598 if (chr_encode(ch, dst, &dst_off, size) != EOK)
599 break;
[16da5f8e]600 }
[2f57690]601
[b888d5f]602 if (dst_off >= size)
603 dst[size - 1] = 0;
604 else
605 dst[dst_off] = 0;
[16da5f8e]606}
607
[20f1597]608/** Find first occurence of character in string.
609 *
[b888d5f]610 * @param str String to search.
611 * @param ch Character to look for.
612 *
613 * @return Pointer to character in @a str or NULL if not found.
[20f1597]614 *
615 */
[b888d5f]616const char *str_chr(const char *str, wchar_t ch)
[20f1597]617{
[b888d5f]618 wchar_t acc;
619 size_t off = 0;
620
621 while ((acc = str_decode(str, &off, STR_NO_LIMIT) != 0)) {
622 if (acc == ch)
623 return (str + off);
[20f1597]624 }
[2f57690]625
[20f1597]626 return NULL;
627}
628
[b888d5f]629/** Insert a wide character into a wide string.
630 *
631 * Insert a wide character into a wide string at position
632 * @a pos. The characters after the position are shifted.
633 *
634 * @param str String to insert to.
635 * @param ch Character to insert to.
636 * @param pos Character index where to insert.
637 @ @param max_pos Characters in the buffer.
638 *
639 * @return True if the insertion was sucessful, false if the position
640 * is out of bounds.
641 *
642 */
643bool wstr_linsert(wchar_t *str, wchar_t ch, count_t pos, count_t max_pos)
644{
645 count_t len = wstr_length(str);
646
647 if ((pos > len) || (pos + 1 > max_pos))
648 return false;
649
650 count_t i;
651 for (i = len; i + 1 > pos; i--)
652 str[i + 1] = str[i];
653
654 str[pos] = ch;
655
656 return true;
657}
658
659/** Remove a wide character from a wide string.
660 *
661 * Remove a wide character from a wide string at position
662 * @a pos. The characters after the position are shifted.
663 *
664 * @param str String to remove from.
665 * @param pos Character index to remove.
666 *
667 * @return True if the removal was sucessful, false if the position
668 * is out of bounds.
669 *
670 */
671bool wstr_remove(wchar_t *str, count_t pos)
672{
673 count_t len = wstr_length(str);
674
675 if (pos >= len)
676 return false;
677
678 count_t i;
679 for (i = pos + 1; i <= len; i++)
680 str[i - 1] = str[i];
681
682 return true;
683}
684
[16da5f8e]685/** @}
686 */
Note: See TracBrowser for help on using the repository browser.