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
|
/*
//
// Copyright 1997-2009 Torsten Rohlfing
//
// Copyright 2004-2014 SRI International
//
// This file is part of the Computational Morphometry Toolkit.
//
// http://www.nitrc.org/projects/cmtk/
//
// The Computational Morphometry Toolkit is free software: you can
// redistribute it and/or modify it under the terms of the GNU General Public
// License as published by the Free Software Foundation, either version 3 of
// the License, or (at your option) any later version.
//
// The Computational Morphometry Toolkit is distributed in the hope that it
// will be useful, but WITHOUT ANY WARRANTY; without even the implied
// warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
// GNU General Public License for more details.
//
// You should have received a copy of the GNU General Public License along
// with the Computational Morphometry Toolkit. If not, see
// <http://www.gnu.org/licenses/>.
//
// $Revision: 5436 $
//
// $LastChangedDate: 2018-12-10 19:01:20 -0800 (Mon, 10 Dec 2018) $
//
// $LastChangedBy: torstenrohlfing $
//
*/
#include "cmtkStrUtility.h"
#include <string.h>
namespace
cmtk
{
/** \addtogroup System */
//@{
int
StrCmp( const char* s1, const char* s2 )
{
if ( s1 == NULL )
{
if ( s2 == NULL ) return 0;
else return -1;
}
else
{
if ( s2 == NULL ) return 1;
else return strcmp( s1, s2 );
}
}
const char*
StrNStr( const char* haystack, const size_t nBytes, const char* needle )
{
for ( size_t hofs = 0; hofs < nBytes; ++hofs )
{
size_t hidx = hofs;
const char* nchr = needle;
while ( (*nchr!=0) && (hidx<nBytes) && (*nchr==haystack[hidx]) )
{
++nchr;
++hidx;
}
// found?
if ( *nchr == 0 )
return haystack+hofs;
}
return NULL;
}
std::string
StrReplaceByRules
( const std::string& str, const std::map<std::string,std::string>& rules, const bool multiple )
{
std::string result = str;
std::map<std::string,std::string>::const_iterator it = rules.begin();
while ( it != rules.end() )
{
bool replaced = true;
while ( replaced )
{
replaced = false;
std::string::size_type pos = result.find( it->first );
while ( pos != std::string::npos )
{
result.replace( pos, it->first.length(), it->second );
replaced = true;
pos = result.find( it->first );
if ( ! multiple ) break;
}
if ( ! multiple ) break;
}
++it;
}
return result;
}
std::string
StrReplace( const std::string& str, const std::string& search, const std::string& replace )
{
std::string result = str;
if ( ! search.empty() )
{
for ( size_t b = result.find(search, 0); b != result.npos; b = result.find(search, b) )
{
result.replace( b, search.size(), replace );
b += (replace.size() - search.size());
}
}
return result;
}
std::string
StrMakeLegalInPath( const std::string& s )
{
std::string result = s;
result = StrReplace( result, " ", "_" );
result = StrReplace( result, ":", "_" );
return result;
}
std::vector<std::string>
StrSplit( const std::string& s, const std::string separators )
{
std::vector<std::string> result;
if ( ! s.empty() )
{
size_t prev = 0;
while ( prev != std::string::npos )
{
size_t next = s.find_first_of( separators, prev );
if ( next != std::string::npos )
{
result.push_back( s.substr( prev, next-prev ) );
prev = next+1;
}
else
{
result.push_back( s.substr( prev ) );
prev = next;
}
}
}
return result;
}
} // namespace cmtk
|
