source: libcfa/src/collections/string.cfa@ 11f65b3

Last change on this file since 11f65b3 was e891349, checked in by Michael Brooks <mlbrooks@…>, 2 years ago

Tweak string assignment-strcpy-strncpy and concatenate-strcat-strncat declarations.

Implement -n- versions correctly.

Refactor to include string_res layer.

Add missing tests.

  • Property mode set to 100644
File size: 10.3 KB
Line 
1//
2// Cforall Version 1.0.0 Copyright (C) 2016 University of Waterloo
3//
4// The contents of this file are covered under the licence agreement in the
5// file "LICENCE" distributed with Cforall.
6//
7// string -- variable-length, mutable run of text, with value semantics
8//
9// Author : Michael L. Brooks
10// Created On : Fri Sep 03 11:00:00 2021
11// Last Modified By : Peter A. Buhr
12// Last Modified On : Sun Jan 14 12:03:47 2024
13// Update Count : 240
14//
15
16#include "string.hfa"
17#include "string_res.hfa"
18#include <stdlib.hfa>
19
20#pragma GCC visibility push(default)
21
22/*
23Implementation Principle: typical operation translates to the equivalent
24operation on `inner`. Exceptions are implementing new RAII pattern for value
25semantics and some const-hell handling.
26*/
27
28////////////////////////////////////////////////////////
29// string RAII
30
31// private (not in header)
32static void ?{}( string & s, string_res & src, size_t start, size_t end ) {
33 (s.inner) { malloc() };
34 ?{}( *s.inner, src, SHARE_EDITS, start, end );
35}
36
37void ?{}( string & s ) {
38 (s.inner) { malloc() };
39 ?{}( *s.inner );
40}
41
42void ?{}( string & s, const string & c ) {
43 (s.inner) { malloc() };
44 ?{}( *s.inner, *c.inner, COPY_VALUE );
45}
46
47void ?{}( string & s, string & c ) {
48 ?{}( s, (const string &) c );
49}
50
51void ?{}( string & s, const char c ) {
52 (s.inner) { malloc() };
53 char cs[2] = { c, '\0' };
54 ?{}( *s.inner, cs );
55}
56
57void ?{}( string & s, const char * c ) {
58 (s.inner) { malloc() };
59 ?{}( *s.inner, c );
60}
61
62void ?{}( string & s, const char * c, size_t size) {
63 (s.inner) { malloc() };
64 ?{}( *s.inner, c, size );
65}
66
67void ^?{}( string & s ) {
68 ^(*s.inner){};
69 free( s.inner );
70 s.inner = 0p;
71}
72
73////////////////////////////////////////////////////////
74// Alternate construction: request shared edits
75
76string_WithSharedEdits ?`shareEdits( string & s ) {
77 string_WithSharedEdits ret = { &s };
78 return ret;
79}
80
81void ?{}( string & s, string_WithSharedEdits src ) {
82 ?{}( s, *src.s->inner, 0, src.s->inner->Handle.lnth);
83}
84
85////////////////////////////////////////////////////////
86// Assignment
87
88void ?=?( string & s, const char * val ) {
89 (*s.inner) = val;
90}
91
92void ?=?(string & s, const string & c) {
93 (*s.inner) = (*c.inner);
94}
95
96void ?=?( string & s, char val ) {
97 (*s.inner) = val;
98}
99
100string & ?=?(string & s, string & c) { //// <---- straw man change
101 (*s.inner) = (*c.inner);
102 return s;
103}
104
105void assign(string & s, const string & c, size_t n) {
106 assign(*s.inner, *c.inner, n);
107}
108void assign(string & s, const char * c, size_t n) {
109 assign(*s.inner, c, n);
110}
111
112
113////////////////////////////////////////////////////////
114// Input-Output
115
116ofstream & ?|?( ofstream & out, const string & s ) {
117 return out | (*s.inner); // print internal string_res
118}
119
120void ?|?( ofstream & out, const string & s ) {
121 (ofstream &)(out | (*s.inner)); ends( out );
122}
123
124ofstream & ?|?( ofstream & os, _Ostream_Manip(string) f ) {
125 size_t len = size( f.val );
126 char cstr[len + 1]; // room for null terminator
127 for ( i; len ) cstr[i] = f.val[i]; // copy string
128 cstr[len] = '\0'; // terminate
129 _Ostream_Manip(const char *) cf @= { cstr, f.wd, f.pc, f.base, {f.all} };
130 os | cf | nonl;
131 return os;
132} // ?|?
133
134void ?|?( ofstream & os, _Ostream_Manip(string) f ) {
135 (ofstream &)(os | f); ends( os );
136}
137
138ifstream & ?|?(ifstream & in, string & s) {
139 return in | (*s.inner); // read to internal string_res
140}
141
142void ?|?( ifstream & in, string & s ) {
143 in | (*s.inner);
144}
145
146ifstream & ?|?( ifstream & is, _Istream_Sstr f ) {
147 _Istream_Rstr f2 = {f.s.inner, (_Istream_str_base)f};
148 return is | f2;
149} // ?|?
150
151void ?|?( ifstream & in, _Istream_Sstr f ) {
152 (ifstream &)(in | f);
153}
154
155////////////////////////////////////////////////////////
156// Slicing
157
158string ?()( string & s, size_t start, size_t end ) {
159 string ret = { *s.inner, start, end };
160 return ret`shareEdits;
161}
162
163string ?()( string & s, size_t start ) {
164 string ret = { *s.inner, start, size( s ) };
165 return ret`shareEdits;
166}
167
168////////////////////////////////////////////////////////
169// Comparison
170
171int strcmp(const string & s1, const string & s2) { return strcmp(*s1.inner, *s2.inner); }
172bool ?==?(const string & s1, const string & s2) { return *s1.inner == *s2.inner; }
173bool ?!=?(const string & s1, const string & s2) { return *s1.inner != *s2.inner; }
174bool ?>? (const string & s1, const string & s2) { return *s1.inner > *s2.inner; }
175bool ?>=?(const string & s1, const string & s2) { return *s1.inner >= *s2.inner; }
176bool ?<=?(const string & s1, const string & s2) { return *s1.inner <= *s2.inner; }
177bool ?<? (const string & s1, const string & s2) { return *s1.inner < *s2.inner; }
178
179int strcmp(const string & s1, const char * s2) { return strcmp(*s1.inner, s2 ); }
180bool ?==?(const string & s1, const char * s2) { return *s1.inner == s2; }
181bool ?!=?(const string & s1, const char * s2) { return *s1.inner != s2; }
182bool ?>? (const string & s1, const char * s2) { return *s1.inner > s2; }
183bool ?>=?(const string & s1, const char * s2) { return *s1.inner >= s2; }
184bool ?<=?(const string & s1, const char * s2) { return *s1.inner <= s2; }
185bool ?<? (const string & s1, const char * s2) { return *s1.inner < s2; }
186
187int strcmp(const char * s1, const string & s2) { return strcmp( s1, *s2.inner); }
188bool ?==?(const char * s1, const string & s2) { return s1 == *s2.inner; }
189bool ?!=?(const char * s1, const string & s2) { return s1 != *s2.inner; }
190bool ?>? (const char * s1, const string & s2) { return s1 > *s2.inner; }
191bool ?>=?(const char * s1, const string & s2) { return s1 >= *s2.inner; }
192bool ?<=?(const char * s1, const string & s2) { return s1 <= *s2.inner; }
193bool ?<? (const char * s1, const string & s2) { return s1 < *s2.inner; }
194
195
196////////////////////////////////////////////////////////
197// Getter
198
199size_t size(const string & s) {
200 return size( *s.inner );
201}
202
203////////////////////////////////////////////////////////
204// Concatenation
205
206void ?+=?(string & s, char c) {
207 (*s.inner) += c;
208}
209
210void ?+=?(string & s, const string & s2) {
211 (*s.inner) += (*s2.inner);
212}
213
214void append(string & s, const string & s2, size_t maxlen) {
215 append( (*s.inner), (*s2.inner), maxlen );
216}
217
218void ?+=?(string & s, const char * c) {
219 (*s.inner) += c;
220}
221
222void append(string & s, const char * buffer, size_t bsize) {
223 append( (*s.inner), buffer, bsize );
224}
225
226string ?+?(const string & s, char c) {
227 string ret = s;
228 ret += c;
229 return ret;
230}
231
232string ?+?(const string & s, const string & s2) {
233 string ret = s;
234 ret += s2;
235 return ret;
236}
237
238string ?+?(const char * s1, const char * s2) {
239 string ret = s1;
240 ret += s2;
241 return ret;
242}
243
244string ?+?(const string & s, const char * c) {
245 string ret = s;
246 ret += c;
247 return ret;
248}
249
250////////////////////////////////////////////////////////
251// Repetition
252
253void ?*=?(string & s, size_t factor) {
254 (*s.inner) *= factor;
255}
256
257string ?*?(const string & s, size_t factor) {
258 string ret = s;
259 ret *= factor;
260 return ret;
261}
262
263string ?*?(char c, size_t factor) {
264 string ret = c;
265 ret *= factor;
266 return ret;
267}
268
269string ?*?(const char * s, size_t factor) {
270 string ret = s;
271 ret *= factor;
272 return ret;
273}
274
275////////////////////////////////////////////////////////
276// Character access
277
278char ?[?](const string & s, size_t index) {
279 return (*s.inner)[index];
280}
281
282string ?[?](string & s, size_t index) {
283 string ret = { *s.inner, index, index + 1 };
284 return ret`shareEdits;
285}
286
287////////////////////////////////////////////////////////
288// Search
289
290bool contains(const string & s, char ch) {
291 return contains( *s.inner, ch );
292}
293
294int find(const string & s, char search) {
295 return find( *s.inner, search );
296}
297
298int find(const string & s, const string & search) {
299 return find( *s.inner, *search.inner );
300}
301
302int find(const string & s, const char * search) {
303 return find( *s.inner, search);
304}
305
306int find(const string & s, const char * search, size_t searchsize) {
307 return find( *s.inner, search, searchsize);
308}
309
310int findFrom(const string & s, size_t fromPos, char search) {
311 return findFrom( *s.inner, fromPos, search );
312}
313
314int findFrom(const string & s, size_t fromPos, const string & search) {
315 return findFrom( *s.inner, fromPos, *search.inner );
316}
317
318int findFrom(const string & s, size_t fromPos, const char * search) {
319 return findFrom( *s.inner, fromPos, search );
320}
321
322int findFrom(const string & s, size_t fromPos, const char * search, size_t searchsize) {
323 return findFrom( *s.inner, fromPos, search, searchsize );
324}
325
326bool includes(const string & s, const string & search) {
327 return includes( *s.inner, *search.inner );
328}
329
330bool includes(const string & s, const char * search) {
331 return includes( *s.inner, search );
332}
333
334bool includes(const string & s, const char * search, size_t searchsize) {
335 return includes( *s.inner, search, searchsize );
336}
337
338bool startsWith(const string & s, const string & prefix) {
339 return startsWith( *s.inner, *prefix.inner );
340}
341
342bool startsWith(const string & s, const char * prefix) {
343 return startsWith( *s.inner, prefix );
344}
345
346bool startsWith(const string & s, const char * prefix, size_t prefixsize) {
347 return startsWith( *s.inner, prefix, prefixsize );
348}
349
350bool endsWith(const string & s, const string & suffix) {
351 return endsWith( *s.inner, *suffix.inner );
352}
353
354bool endsWith(const string & s, const char * suffix) {
355 return endsWith( *s.inner, suffix );
356}
357
358bool endsWith(const string & s, const char * suffix, size_t suffixsize) {
359 return endsWith( *s.inner, suffix, suffixsize );
360}
361
362
363///////////////////////////////////////////////////////////////////////////
364// charclass, include, exclude
365
366void ?{}( charclass & s, const string & chars) {
367 (s.inner) { malloc() };
368 ?{}( *s.inner, *(const string_res *)chars.inner );
369}
370
371void ?{}( charclass & s, const char * chars ) {
372 (s.inner) { malloc() };
373 ?{}( *s.inner, chars );
374}
375
376void ?{}( charclass & s, const char * chars, size_t charssize ) {
377 (s.inner) { malloc() };
378 ?{}( *s.inner, chars, charssize );
379}
380
381void ^?{}( charclass & s ) {
382 ^(*s.inner){};
383 free( s.inner );
384 s.inner = 0p;
385}
386
387
388int exclude(const string & s, const charclass & mask) {
389 return exclude( *s.inner, *mask.inner );
390}
391/*
392StrSlice exclude(string & s, const charclass & mask) {
393}
394*/
395
396int include(const string & s, const charclass & mask) {
397 return include( *s.inner, *mask.inner );
398}
399
400/*
401StrSlice include(string & s, const charclass & mask) {
402}
403*/
404
Note: See TracBrowser for help on using the repository browser.