1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
|
/* Starshatter OpenSource Distribution
Copyright (c) 1997-2004, Destroyer Studios LLC.
All Rights Reserved.
Redistribution and use in source and binary forms, with or without
modification, are permitted provided that the following conditions are met:
* Redistributions of source code must retain the above copyright notice,
this list of conditions and the following disclaimer.
* Redistributions in binary form must reproduce the above copyright notice,
this list of conditions and the following disclaimer in the documentation
and/or other materials provided with the distribution.
* Neither the name "Destroyer Studios" nor the names of its contributors
may be used to endorse or promote products derived from this software
without specific prior written permission.
THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE
LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
POSSIBILITY OF SUCH DAMAGE.
SUBSYSTEM: FoundationEx
FILE: Text.h
AUTHOR: John DiCamillo
OVERVIEW
========
Declaration of the Text class
*/
#ifndef Text_h
#define Text_h
#include <string.h>
#include <windows.h>
#include "ThreadSync.h"
// +-------------------------------------------------------------------+
class TextRep
{
friend class Text;
public:
TextRep();
~TextRep();
private:
TextRep(const char* s);
TextRep(const char* s, int len);
TextRep(char c, int len);
TextRep(const TextRep* rep);
void addref();
long deref();
void dohash();
char* data;
long ref;
int length;
unsigned hash;
bool sensitive;
static ThreadSync sync;
static TextRep nullrep;
};
// +-------------------------------------------------------------------+
class Text
{
public:
static const char* TYPENAME() { return "Text"; }
Text();
Text(char c);
Text(const char* s);
Text(const char* s, int len);
Text(char c, int len);
Text(const Text& s);
~Text();
// case sensitivity
bool isSensitive() const;
void setSensitive(bool s);
// comparison
int compare(const char* s) const;
int compare(const Text& s) const;
// assignment
Text& operator=(const char* s);
Text& operator=(const Text& s);
// catenation
Text& append(char c);
Text& append(const char* s);
Text& append(const Text& s);
Text operator+(char c);
Text operator+(const char* s);
Text operator+(const Text& s);
Text& operator+=(char c) { return append(c); }
Text& operator+=(const char* s) { return append(s); }
Text& operator+=(const Text& s) { return append(s); }
// indexing
char operator[](int index) const;
char operator()(int index) const;
char& operator[](int index);
char& operator()(int index);
Text operator()(int start, int len) const;
// access
int length() const { return rep->length; }
unsigned hash() const { return rep->hash; }
const char* data() const { return sym; }
operator const char* () const { return sym; }
bool contains(char c) const;
bool contains(const char* s) const;
bool containsAnyOf(const char* charSet) const;
int indexOf(char c) const;
int indexOf(const char* s) const;
// mutation
void toLower();
void toUpper();
// substring
Text substring(int start, int length);
Text trim();
Text replace(const char* pattern, const char* substitution);
private:
void clone();
const char* sym;
TextRep* rep;
};
// +-------------------------------------------------------------------+
inline int Text::compare(const char* s) const
{
if (rep->sensitive)
return strcmp(sym, s);
else
return _stricmp(sym, s);
}
inline int Text::compare(const Text& s) const
{
if (rep->sensitive && s.rep->sensitive)
return strcmp(sym, s.sym);
else
return _stricmp(sym, s.sym);
}
// +-------------------------------------------------------------------+
inline int operator==(const Text& l, const Text& r) {
return (l.length() == r.length()) && (l.compare(r) == 0); }
inline int operator!=(const Text& l, const Text& r) { return l.compare(r) != 0; }
inline int operator< (const Text& l, const Text& r) { return l.compare(r) < 0; }
inline int operator<=(const Text& l, const Text& r) { return l.compare(r) <= 0; }
inline int operator> (const Text& l, const Text& r) { return l.compare(r) > 0; }
inline int operator>=(const Text& l, const Text& r) { return l.compare(r) >= 0; }
inline int operator==(const char* l, const Text& r) { return r.compare(l) == 0; }
inline int operator!=(const char* l, const Text& r) { return r.compare(l) != 0; }
inline int operator< (const char* l, const Text& r) { return r.compare(l) < 0; }
inline int operator<=(const char* l, const Text& r) { return r.compare(l) <= 0; }
inline int operator> (const char* l, const Text& r) { return r.compare(l) > 0; }
inline int operator>=(const char* l, const Text& r) { return r.compare(l) >= 0; }
inline int operator==( char* l, const Text& r) { return r.compare(l) == 0; }
inline int operator!=( char* l, const Text& r) { return r.compare(l) != 0; }
inline int operator< ( char* l, const Text& r) { return r.compare(l) < 0; }
inline int operator<=( char* l, const Text& r) { return r.compare(l) <= 0; }
inline int operator> ( char* l, const Text& r) { return r.compare(l) > 0; }
inline int operator>=( char* l, const Text& r) { return r.compare(l) >= 0; }
inline int operator==(const Text& l, const char* r) { return l.compare(r) == 0; }
inline int operator!=(const Text& l, const char* r) { return l.compare(r) != 0; }
inline int operator< (const Text& l, const char* r) { return l.compare(r) < 0; }
inline int operator<=(const Text& l, const char* r) { return l.compare(r) <= 0; }
inline int operator> (const Text& l, const char* r) { return l.compare(r) > 0; }
inline int operator>=(const Text& l, const char* r) { return l.compare(r) >= 0; }
inline int operator==(const Text& l, char* r) { return l.compare(r) == 0; }
inline int operator!=(const Text& l, char* r) { return l.compare(r) != 0; }
inline int operator< (const Text& l, char* r) { return l.compare(r) < 0; }
inline int operator<=(const Text& l, char* r) { return l.compare(r) <= 0; }
inline int operator> (const Text& l, char* r) { return l.compare(r) > 0; }
inline int operator>=(const Text& l, char* r) { return l.compare(r) >= 0; }
inline Text operator+(const char* l, const Text& r) { return Text(l) + r; }
inline Text operator+( char* l, const Text& r) { return Text(l) + r; }
// +-------------------------------------------------------------------+
#endif Text_h
|
