libcutils

libcutils/src/dyn_string.c
dyn_string.c
⎇
Raw
1#include <cutils/dyn_string.h>
2
3String* string_with_capacity(size_t capacity)
4{
5 String* string = malloc(sizeof(*string));
6 if(!string)
7 return NULL;
8 string->chars = calloc(capacity,sizeof(*string->chars));
9 if(!string->chars)
10 {
11 free(string);
12 return NULL;
13 }
14 string->length = 0;
15 string->capacity = capacity;
16
17 return string;
18}
19
20void string_remove(String* string, size_t index)
21{
22 if(index < string->length)
23 {
24 memmove(string->chars+index, string->chars+index+1, (string->length-index-1)*sizeof(*string->chars));
25 string->length--;
26 }
27}
28/* TODO: optimize */
29void string_remove_range(String* string, size_t index, size_t length)
30{
31 size_t i;
32 for(i = 0; i < length; i++)
33 {
34 string_remove(string, index+i);
35 }
36}
37
38bool string_insert(String* string, size_t index, char character)
39{
40 if(index > string->length || string->length == SIZE_MAX || !string_adjust_size(string, string->length))
41 return false;
42
43 memmove(string->chars+index+1, string->chars+index, (string->length-index)*sizeof(*string->chars));
44 string->chars[index] = character;
45 string->length++;
46 return true;
47}
48
49char string_at(const String* string, size_t index)
50{
51 if(index >= string->length)
52 return '\0';
53 else
54 return string->chars[index];
55}
56
57char string_pop_at(String* string, size_t index)
58{
59 char tmp = string_at(string, index);
60 if(!tmp)
61 {
62 return '\0';
63 } else {
64 string_remove(string, index);
65 return tmp;
66 }
67}
68
69bool string_concat(String* string, const String* other)
70{
71 if(!string_adjust_size(string,string->length+other->length-1))
72 return false;
73 memcpy(string->chars+string->length,other->chars,other->length);
74 string->length += other->length;
75 return true;
76}
77
78bool string_find_char(const String* haystack, const char needle, size_t* pos)
79{
80 size_t i;
81
82 for(i = 0; i < haystack->length; i++)
83 {
84 if(haystack->chars[i] == needle)
85 {
86 *pos = i;
87 return true;
88 }
89 }
90 return false;
91}
92
93bool string_find_str(const String* haystack, const String* needle, size_t* pos)
94{
95 size_t i, j, tmp;
96
97 for(i = 0; i < haystack->length; i++)
98 {
99 for(j = 0, tmp = i; j < needle->length && i < haystack->length; j++, i++)
100 {
101 if(haystack->chars[i] != needle->chars[j])
102 {
103 break;
104 } else if(j == needle->length-1){
105 *pos = tmp;
106 return true;
107 }
108 }
109 }
110 return false;
111}
112
113bool string_adjust_size(String* string, size_t size)
114{
115 while(string->capacity < size)
116 {
117 char* tmp = string->chars;
118 string->chars = cutil_reallocarray_inc(string->chars, sizeof(*string->chars), string->capacity, string->capacity);
119 if(!string->chars)
120 {
121 string->chars = tmp;
122 return false;
123 }
124 string->capacity *= 2;
125 }
126 return true;
127}
128
129
130void delete_string(String* string)
131{
132 free(string->chars);
133 free(string);
134}
135
136String* from_cstring(const char* cstring)
137{
138 String* string = string_with_capacity(strlen(cstring));
139 if(!string)
140 {
141 return NULL;
142 } else {
143 memcpy(string->chars, cstring, strlen(cstring));
144 string->length = strlen(cstring);
145 return string;
146 }
147
148}
149
150String* from_cstring_del(char* cstring)
151{
152 String* ret = from_cstring(cstring);
153 free(cstring);
154 return ret;
155}
156
157char* to_cstring(const String* string)
158{
159 char* cstring = malloc(string->length+1);
160 memcpy(cstring, string->chars, string->length);
161 cstring[string->length] = '\0';
162
163 return cstring;
164}
165
166char* to_cstring_del(String* string)
167{
168 char* ret = to_cstring(string);
169 delete_string(string);
170 return ret;
171}
172