|
|
1 | /* |
|
|
2 | * This file is part of Deliantra, the Roguelike Realtime MMORPG. |
|
|
3 | * |
|
|
4 | * Copyright (©) 2005,2006,2007 Marc Alexander Lehmann / Robin Redeker / the Deliantra team |
|
|
5 | * |
|
|
6 | * Deliantra is free software: you can redistribute it and/or modify |
|
|
7 | * it under the terms of the GNU General Public License as published by |
|
|
8 | * the Free Software Foundation, either version 3 of the License, or |
|
|
9 | * (at your option) any later version. |
|
|
10 | * |
|
|
11 | * This program is distributed in the hope that it will be useful, |
|
|
12 | * but WITHOUT ANY WARRANTY; without even the implied warranty of |
|
|
13 | * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the |
|
|
14 | * GNU General Public License for more details. |
|
|
15 | * |
|
|
16 | * You should have received a copy of the GNU General Public License |
|
|
17 | * along with this program. If not, see <http://www.gnu.org/licenses/>. |
|
|
18 | * |
|
|
19 | * The authors can be reached via e-mail to <support@deliantra.net> |
|
|
20 | */ |
|
|
21 | |
| 1 | #ifndef SHSTR_H__ |
22 | #ifndef SHSTR_H__ |
| 2 | #define SHSTR_H__ |
23 | #define SHSTR_H__ |
| 3 | |
24 | |
|
|
25 | #include <sstream> |
|
|
26 | |
| 4 | #include "util.h" |
27 | #include "util.h" |
|
|
28 | |
|
|
29 | extern size_t shstr_alloc; |
| 5 | |
30 | |
| 6 | extern int buf_overflow (const char *buf1, const char *buf2, int bufsize); |
31 | extern int buf_overflow (const char *buf1, const char *buf2, int bufsize); |
| 7 | |
32 | |
| 8 | struct shstr |
33 | struct shstr |
| 9 | { |
34 | { |
| … | |
… | |
| 27 | } |
52 | } |
| 28 | |
53 | |
| 29 | int length () const |
54 | int length () const |
| 30 | { |
55 | { |
| 31 | return length (s); |
56 | return length (s); |
|
|
57 | } |
|
|
58 | |
|
|
59 | // returns wether this shared string begins with the given prefix, |
|
|
60 | // used mainly for searched when users give only the start of a name. |
|
|
61 | bool begins_with (const char *prefix) const |
|
|
62 | { |
|
|
63 | int plen = strlen (prefix); |
|
|
64 | return !strncasecmp (s, prefix, plen) && length () >= plen; |
| 32 | } |
65 | } |
| 33 | |
66 | |
| 34 | static const char *find (const char *s); |
67 | static const char *find (const char *s); |
| 35 | static const char *intern (const char *s); |
68 | static const char *intern (const char *s); |
| 36 | |
69 | |
| … | |
… | |
| 99 | inline int strlen (const shstr &sh) |
132 | inline int strlen (const shstr &sh) |
| 100 | { |
133 | { |
| 101 | return sh.length (); |
134 | return sh.length (); |
| 102 | } |
135 | } |
| 103 | |
136 | |
|
|
137 | inline int strcmp (const shstr &a, const shstr &b) |
|
|
138 | { |
|
|
139 | // TODO: use this to find all the occurences of people using strcmp |
|
|
140 | // all uses should be bogus, as we should be never interested in |
|
|
141 | // comparing shstr's alphabetically |
|
|
142 | #if 0 |
|
|
143 | extern void do_not_use_strcmp_to_compare_shstr_values (); |
|
|
144 | do_not_use_strcmp_to_compare_shstr_values (); |
|
|
145 | #endif |
|
|
146 | return a != b; |
|
|
147 | } |
|
|
148 | |
|
|
149 | static std::ostream &operator <<(std::ostream &o, const shstr &sh) |
|
|
150 | { |
|
|
151 | o.write (sh.s, sh.length ()); |
|
|
152 | return o; |
|
|
153 | } |
|
|
154 | |
| 104 | // only good for mass comparisons to shstr objects |
155 | // only good for mass comparisons to shstr objects |
| 105 | struct shstr_cmp |
156 | struct shstr_cmp |
| 106 | { |
157 | { |
| 107 | const char *s; |
158 | const char *s; |
| 108 | |
159 | |
| … | |
… | |
| 128 | inline bool operator ==(const shstr &a, const shstr_cmp &b) |
179 | inline bool operator ==(const shstr &a, const shstr_cmp &b) |
| 129 | { |
180 | { |
| 130 | return b == a; |
181 | return b == a; |
| 131 | } |
182 | } |
| 132 | |
183 | |
| 133 | extern const shstr undead_name; /* Used in hit_player() in main.c */ |
184 | extern const shstr shstr_null; |
|
|
185 | |
|
|
186 | #define def(str) extern const shstr shstr_ ## str; |
|
|
187 | # include "shstrinc.h" |
|
|
188 | #undef def |
| 134 | |
189 | |
| 135 | #endif |
190 | #endif |
| 136 | |
191 | |
