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 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393 394 395 396 397 398 399 400 401 402 403 404 405 406 407 408 409 410 411 412 413 414 415 416 417 418 419 420 421 422 423 424 425 426 427 428 429 430 431 432 433 434 435 436 437 438 439
|
/*
STRINGLIB
Ulli Meybohm's C++ String Library
Copyright (C) 2000 Ulli Meybohm, www.meybohm.de (ulli@meybohm.de)
This program 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 2 of the License, or
(at your option) any later version.
This program 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 this program; if not, write to the Free Software
Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
*/
#include "stringlist.h"
Stringlist::Stringlist(){
lineSeperator=STRINGLIST_LS;
fieldSeperator=STRINGLIST_FS;
}
Stringlist::Stringlist(Stringlist &s){
lineSeperator=STRINGLIST_LS;
fieldSeperator=STRINGLIST_FS;
add(s);
}
Stringlist::Stringlist(int argc,char *argv[]){
lineSeperator=STRINGLIST_LS;
fieldSeperator=STRINGLIST_FS;
add(argc,argv);
}
Stringlist::Stringlist(Stringlist &s, VectorIndexList& itemsToCopy){
lineSeperator=STRINGLIST_LS;
fieldSeperator=STRINGLIST_FS;
add(s,itemsToCopy);
}
void Stringlist::add(int argc, char *argv[]){
for (int i=0; i<argc; i++){
add(argv[i]);
}
}
bool Stringlist::includes(Bytevector b){
return find(b,0)!=-1;
}
bool Stringlist::option(Bytevector option) {
return find(option,0)>=0;
}
bool Stringlist::option(Bytevector option, Bytevector longoption){
if ( find(option,0)>=0 ) return true;
if ( find(longoption,0)>=0 ) return true;
return false;
}
Bytevector Stringlist::optionvalue(Bytevector option){
int pos=find(option,0);
if ( (pos<0) || ((unsigned int)pos>=size()) )
return Bytevector();
else
return (*this)[pos];
}
Bytevector Stringlist::optionvalue(Bytevector option, Bytevector longoption){
int pos=find(option,0);
if ( (pos>=0) && ((unsigned int)pos<size()) )
return (*this)[pos];
pos=find(longoption,0);
if ( (pos>=0) && ((unsigned int)pos<size()) )
return (*this)[pos];
return Bytevector();
}
#ifdef STRINGLIB_USE_GLIBC
VectorIndexList Stringlist::grep(Bytevector regex){
int index=0;
VectorIndexList vi;
for (Stringlist::iterator i=begin(); i!=end(); i++, index++){
if ( (*i)->regexmatch(regex)) {
vi.push_back(index);
}
}
return VectorIndexList(vi);
}
int Stringlist::wordexpand(Bytevector source){
int err;
wordexp_t *result;
result= new wordexp_t;
if ((err=std::wordexp(source.data, result, 0))==0) {
clear();
add(result->we_wordc,result->we_wordv);
}
wordfree(result);
delete result;
return err;
}
void Stringlist::glob(Bytevector filenamepattern){
clear();
glob_t *result;
result= new glob_t;
std::glob(filenamepattern.data, GLOB_MARK, 0, result);
add(result->gl_pathc,result->gl_pathv);
globfree(result);
delete result;
}
#endif
void Stringlist::readfile(int file){
Bytevector *b;
b=new Bytevector;
while( b->freadln(file) ){
add(b);
b=new Bytevector;
}
}
void Stringlist::writefile(int file){
for (Stringlist::iterator i=begin(); i!=end(); i++) {
(*i)->fwriteln(file);
}
}
void Stringlist::copySplit(Bytevector &source){
copySplit(source, lineSeperator);
}
Stringlist& Stringlist::operator=(Stringlist &s) {
Stringlist::clear();
add(s);
return *this;
}
Bytevector Stringlist::operator()(int line, int field){
if ( line<(int)size() ){
Stringlist s;
s.copySplit( (*this)[line] , fieldSeperator);
if ( field<(int)s.size() ) {
return s[field];
}
};
return Bytevector("");
}
void Stringlist::add(Stringlist &s, VectorIndexList& itemsToAdd){
for ( VectorIndexList::iterator i=itemsToAdd.begin(); i!=itemsToAdd.end(); i++) {
add(s[*i]);
}
}
Stringlist::iterator Stringlist::getID(Bytevector id){
for (Stringlist::iterator i=begin(); i!=end(); i++){
if ( (*i)->id()==id ) {
return i;
}
}
//else
return end();
}
VectorIndexList Stringlist::fgrep(Bytevector searchstring){
int index=0;
VectorIndexList vi;
for (Stringlist::iterator i=begin(); i!=end(); i++, index++){
if ( (*i)->find(searchstring,0)!=-1 ) {
vi.push_back(index);
}
}
return VectorIndexList(vi);
}
VectorIndexList Stringlist::findall(Bytevector b){
int index=0;
VectorIndexList vi;
for (Stringlist::iterator i=begin(); i!=end(); i++, index++){
if ( (*(*i))==b ) {
vi.push_back(index);
}
}
return VectorIndexList(vi);
}
int Stringlist::find(Bytevector b, int startpos){
int index=startpos;
for (Stringlist::iterator i=begin()+startpos; i!=end(); i++, index++){
if ( (*(*i))==b ) {
return index;
}
}
return -1;
}
void Stringlist::set(Bytevector id, Bytevector value){
Stringlist::iterator item;
item=getID(id);
if (item!=end()) {
(*item)->setValue(value);
} else {
Bytevector newItem;
newItem+=id;
newItem+="=";
newItem+=value;
add(Bytevector(newItem));
}
}
void Stringlist::set(Bytevector id, const char *value){
set(id,Bytevector(value));
}
void Stringlist::set(Bytevector id, char *value){
set(id,Bytevector(value));
}
void Stringlist::set(Bytevector id, int value){
set(id, Bytevector(value));
}
void Stringlist::set(Bytevector id, bool value){
set(id, value?1:0 );
}
Bytevector Stringlist::get(Bytevector id){
Stringlist::iterator item;
item=getID(id);
if (item==end()) return Bytevector("");
return (*getID(id))->value();
}
bool Stringlist::getBool(Bytevector id){
Stringlist::iterator item;
item=getID(id);
if (item==end()) return false;//Exception better??
return (*getID(id))->value().toBool();
}
int Stringlist::getInt(Bytevector id){
Stringlist::iterator item;
item=getID(id);
if (item==end()) return 0;//Exception better??
return (*getID(id))->value().toInt();
}
Stringlist::~Stringlist(){
Stringlist::clear();
}
void Stringlist::clear(){
for (Stringlist::iterator i=begin(); i!=end(); i++){
delete *i;
}
vector<Bytevector *>::clear();
}
int Stringlist::totalTextSize(Bytevector seperator){
int result=0;
for (Stringlist::iterator i=begin(); i!=end(); i++){
result+=(*(*i)).size;
}
result+=seperator.size*size();
return result;
}
Bytevector* Stringlist::text(){
return text(Bytevector(lineSeperator));
}
//fast
Bytevector* Stringlist::text(Bytevector Seperator) {
Bytevector *b;
b=new Bytevector;
int s=totalTextSize(Seperator);
b->resize(s);
int overridepos=0;
for (Stringlist::iterator i=begin(); i!=end(); i++) {
b->override( *(*i), overridepos);
overridepos+=(*i)->size;
b->override( Seperator, overridepos);
overridepos+=Seperator.size;
}
return b;
}
//slow
Bytevector Stringlist::toBytevector(){
Bytevector b;
int s=totalTextSize(lineSeperator);
b.resize(s);
int overridepos=0;
for (Stringlist::iterator i=begin(); i!=end(); i++) {
b.override( *(*i), overridepos);
overridepos+=(*i)->size;
b.override( lineSeperator, overridepos);
overridepos+=lineSeperator.size;
}
return Bytevector(b);
}
void Stringlist::add(Stringlist &s) {
for (Stringlist::iterator i=s.begin(); i!=s.end(); i++) {
push_back( (*i)->clone() );
}
}
void Stringlist::add(Bytevector *b){
push_back(b);
}
void Stringlist::add(char *c){
Bytevector *b;
b=new Bytevector;
*b=c;
push_back(b);
}
void Stringlist::add(const char *c){
Bytevector *b;
b=new Bytevector;
*b=c;
push_back(b);
}
void Stringlist::add(Bytevector &b){
add(b.clone());
}
void Stringlist::add(const Bytevector &b){
add(Bytevector(b));
}
void Stringlist::insert(Bytevector *b, int pos){
iterator i=begin()+pos;
vector<Bytevector *>::insert(i,b);
}
void Stringlist::insert(Bytevector &b, int pos){
insert(b.clone(),pos);
}
void Stringlist::del(int pos){
erase(begin()+pos);
}
void Stringlist::println() {
for (int i=0; i<(int)size(); i++) {
printf("%d. -%s-\n",i,(*this)[i].data);
}
}
void Stringlist::copySplit(Bytevector &source, Bytevector lineSeperator){
int startpos=0;
int index;
Bytevector *b;
while( (index=source.find(lineSeperator,startpos)) != -1 ) {
b=new Bytevector;
if (index!=startpos) {
*b=source.copyRange(startpos,index-1);
} else {
*b="";
}
push_back(b);
startpos=index+lineSeperator.size;
}
if (startpos<(source.size-1)){
b=new Bytevector;
*b=source.copyRange(startpos,source.size-1);
push_back(b);
}
}
Bytevector& Stringlist::operator[](int i){
return *(vector<Bytevector *>::operator[](i));
}
// ARGUMENTVECTOR
/*char** Stringlist::argv(){
char** args;
args=(char **) malloc (size()*sizeof(char*));
int index=0;
for (Stringlist::iterator i=begin(); i!=end(); i++, index++) {
args[index]= (*i)->clonePCHAR();
}
return args;
}*/
|