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 440 441 442 443 444 445 446 447 448 449 450 451 452 453 454 455 456 457 458 459 460 461 462 463 464 465 466 467 468 469 470 471 472 473 474 475 476 477 478 479 480 481 482 483 484 485 486 487 488 489 490 491 492 493 494 495 496 497 498 499 500 501 502 503 504 505 506 507 508 509 510 511 512 513 514 515 516 517 518 519 520 521 522 523 524 525 526 527 528 529 530 531 532 533 534 535 536 537 538 539 540 541 542 543 544 545 546 547 548 549 550 551 552 553 554 555 556 557 558 559 560 561 562 563 564 565 566 567
|
/****************************************************************************
#
# VSTRING Library
#
# Copyright (c) 1996-2023 Vladi Belperchinov-Shabanski "Cade"
# http://cade.noxrun.com/ <cade@noxrun.com> <cade@bis.bg> <cade@cpan.org>
#
# Distributed under the GPL license, you should receive copy of GPLv2!
#
# SEE 'README', 'LICENSE' OR 'COPYING' FILE FOR LICENSE AND OTHER DETAILS!
#
# VSTRING library provides wide set of string manipulation features
# including dynamic string object that can be freely exchanged with
# standard char* (or wchar_t*) type, so there is no need to change
# function calls nor the implementation when you change from
# char* to VString (and from wchar_t* to WString).
#
***************************************************************************/
#include <stdio.h>
#include "vstring.h"
#include "vstrlib.h"
void test1()
{
VString str = "Hello";
str += " World"; // str is `Hello World' now
str_reverse( str ); // str is `dlroW olleH' now
str_low( str ); // lower case
VArray va = str_split( " +", str ); // array contains `dlroW' at pos 0 and `olleH' at 1
va.reverse(); // array reversed: `dlroW' at pos 1 and `olleH' at 0
int z;
for( z = 0; z < va.count(); z++ )
{
str_reverse( va[z] ); // reverses each string element
}
str = str_join( va, " " ); // joins into temporary string
printf( "************************ test 1 result is: %s\n", str.data() ); // this should print `hello world'
}
void test2()
{
VArray va;
va.push( "hello" ); // pos 0
va.push( "world" ); // pos 1
va.ins( 1, "your" ); // pos 1 shifted
va[1] = "my"; // replaces `your'
va[3] = "!"; // set outside the size, array is extended
VString str = va.pop(); // pops last element, str is now `!'
str = str_join( va, "-" ); // joins to given string
str_tr( str, "-", " " ); // replaces dashes with spaces
str_replace( str, " my ", " " ); // removes ` my '
printf( "************************ test 2 result is: %s\n", str.data() ); // this should print `hello world'
}
void test3()
{
VTrie tr; // hash-like
VArray va;
// inserting keys and values
tr[ "tralala" ] = "data1";
tr[ "opala" ] = "data2";
tr[ "keynext" ] = "data3";
printf( "VTrie items count = %d\n", tr.count() );
ASSERT( tr.count() == 3 );
// inserting elements into the array
va.push( "this" );
va.push( "just" );
va.push( "test" );
va.push( "simple" );
VString zzss = va[1];
// adding string to the first element of the array
va[1] += " x2";
// the array is converted to trie (hash) and merged into `tr'
tr += va; // same as: tr.merge( &va );
ASSERT( tr.count() == 5 );
// clear the array--remove all elements
va.undef();
// take keys from `tr' as array and store them into va, returns count
// i.e. i = tr.count();
int i;
va = tr.keys();
printf( "keys count = %d\n", va.count() );
tr.del( "test" );
ASSERT( tr.count() == 4 );
tr.del( "t", 1 );
printf( "--------------------\n" );
tr.print();
printf( "--------------------\n" );
ASSERT( tr.count() == 2 );
tr["thisistest"] = "123";
tr["thisisnottest"] = "456";
ASSERT( tr.count( "this" ) == 2 );
ASSERT( tr.count( "that" ) == 0 );
ASSERT( tr.count( "opa" ) == 1 );
ASSERT( tr.count( ) == 4 );
tr.undef();
tr["thisisnottest"] = "456";
tr["thisistest"] = "456";
tr.del("thisistest");
int vc = tr.vacuum();
printf( "vacuum count = %d\n", vc );
// printing the array and trie data
for( i = 0; i < va.count(); i++ )
{
printf( "%d -> %s (%s)\n", i, va[i].data(), tr[ va[i] ].data() );
}
VArray v1;
printf( "--------------------\n" );
v1 = tr; // same as: v1.undef; v1.push( &tr );
v1.print(); // print array data
VRegexp re( "a([0-9]+)" ); // compiling new regexp
printf( "regexp error: %s\n", re.error_str() );
if( re.m( "tralala85.zz" ) ) // match against regexp
{
printf( "sub 0 = %s\n", re[0].data() ); // re[1] returns `85'
printf( "sub 1 = %s\n", re[1].data() ); // re[1] returns `85'
}
VString vs;
if( re.m( "tralala85.", "a(la)+" ) ) // match against regexp
{
printf( "sub 0 = %s\n", re[0].data() ); // `lala'
printf( "sub 1 = %s\n", re[1].data() ); // `la'
}
printf( "--------------------\n" );
v1 = str_split( ",", "*.tralala,opala and another one" ); // splits on spaces
v1.print();
printf( "joined: %s\n", (const char*)str_join( v1, "---" ) ); // join the same data back
VString m1 = v1[0];
VString m2 = v1[1];
printf( "1[%s] 2[%s]\n", m1.data(), m2.data() );
printf( "--------------------\n" );
v1 = str_split( " +", "tralala opala and another one", 3 ); // splits data on spaces up to 3 elements
v1.print();
//exit(1);
printf( "--------------------\n" );
v1[1] = "hack this one here"; // set (overwrite) element 1
str_sleft( v1[2], 11 ); // reset element 2 to the left 11 chars only
v1[0] = 12345; // convert integer into string
v1.print();
printf( "--------------------\n" );
VArray aa[3]; // array of arrays
aa[0] = str_split( " ", "this is just a simple test" );
aa[1] = str_split( " ", "never ending story" );
aa[2] = str_split( " ", "star-wars rulez" );
aa[0][1] = "was"; // first array, second element, replaces `is' with `was'
aa[2][0] = "slackware"; // third array, first element, `star-wars' is now `slackware'
// expands the array from 3 to 11 elements
aa[1][10] = "king of the hill";
for( i = 0; i < 3; i++ )
{
printf("---\n");
aa[i].print();
}
printf( "---box test-----------------------------\n" );
i = 20;
while( i-- )
{
v1.push( "this" );
v1.push( "just" );
v1.push( "test" );
v1.push( "simple" );
}
v1.print();
VArray vv = v1; // this makes vv data aliased to the data of v1
vv.print(); // actually print the v1's data which is shared right now
vv.set( 0, "---" ); // vv makes own copy of the array data
vv.print(); // vv's data is no more aliased to v1's
VRegexp re_see( "^\\s*see\\s*=\\s*([^, \011]*)\\s*,(.*)$", "i" );
if( re_see.m( "see=*.tgz,tralala" ) )
{
VString str;
str = str + re_see[1] + re_see[2];
printf( "VRegexp[1+2]=[%s]\n", str.data() );
}
printf( "************************ test 3 ends here\n" );
}
void test4()
{
// this is regression test, please ignore it...
int i;
int ii;
VArray va;
ii = 20;
i = ii;
while( i-- )
{
va = str_split( ",", "this is, just a simple. but fixed, nonsense test, voila :)" );
printf( "%d%% va count = %d\n", (100*i)/ii, va.count() );
}
VString set;
VString cat;
VString setn;
VString catn;
VString sete;
VString setp;
i = 2000;
while( i-- )
{
set.set( "this is, just a simple. but fixed, nonsense test, voila :)" );
cat.cat( "this is, just a simple. but fixed, nonsense test, voila :)" );
setn.setn( "this is, just a simple. but fixed, nonsense test, voila :)", 20 );
catn.catn( "this is, just a simple. but fixed, nonsense test, voila :)", 20 );
sete = "this is, just a simple. but fixed, nonsense test, voila :)";
setp += "this is, just a simple. but fixed, nonsense test, voila :)";
}
printf( "set = %d\n", (int)str_len( set ) );
printf( "cat = %d\n", (int)str_len( cat ) );
printf( "setn = %d\n", (int)str_len( setn ) );
printf( "catn = %d\n", (int)str_len( catn ) );
printf( "sete = %d\n", (int)str_len( sete ) );
printf( "setp = %d\n", (int)str_len( setp ) );
printf( "--------------------\n" );
i = 2000;
while( i-- )
{
set = "this is, just a simple. but fixed, nonsense test, voila :)";
setn = set;
str_del( set, 20, 10 );
str_ins( set, 30, "***opa***" );
str_replace( setn, "i", "[I]" );
}
printf( "set = %s\n", set.data() );
printf( "setn = %s\n", setn.data() );
printf( "---array sort-------\n" );
va.undef();
va = str_split( "[, \t]+", "this is, just a simple. but fixed, nonsense test, voila :)" );
va.sort();
va.print();
printf( "--------------------\n" );
va.sort( 1 );
va.print();
printf( "--------------------\n" );
}
void test5()
{
VTrie tr; // hash-like
VArray va;
// inserting keys and values
tr[ "key1" ] = "data1";
tr[ "key2" ] = "data2";
tr[ "key3" ] = "data3";
tr.print();
tr.reverse();
tr.print();
tr.reverse();
tr.print();
VCharSet cs;
cs.push( 'a' );
printf( "char_set: %d, %d\n", cs.in( 'a' ), cs.in( 'z' ) );
cs.undef( 'a' );
printf( "char_set: %d, %d\n", cs.in( 'a' ), cs.in( 'z' ) );
cs.undef();
int i = 2000;
while( i-- )
{
cs.push( i );
}
cs.undef();
printf( "************************ test 5 ends here\n" );
}
void test6()
{
VRegexp re;
VArray va;
re.comp( "^([^!]+)!(.+)=apquxz(.+)$" );
int i = re.m( "abc!pqr=apquxz.ixr.zzz.ac.uk" );
i--;
while( i >= 0 )
{
va.push( re[i] );
i--;
}
va.print();
va.undef();
va += "/this/is/samle/file.tail";
va += "/file.tail";
va += "/this/is/./samle/file.tail/";
va += "/this/..../is/../samle/.file.tail";
va += "/.file.tail";
va += "/";
const char* ps;
va.reset();
while( ( ps = va.next() ) )
{
printf( "------------------------------------\n" );
printf( "file is: %s\n", ps );
printf( "path is: %s\n", (const char*)str_file_path( ps ) );
printf( "name is: %s\n", (const char*)str_file_name( ps ) );
printf( "ext is: %s\n", (const char*)str_file_ext( ps ) );
printf( "n+ex is: %s\n", (const char*)str_file_name_ext( ps ) );
printf( "reduced path is: %s\n", (const char*)str_reduce_path( ps ) );
printf( "dot reduce sample is: %s\n", (const char*)str_dot_reduce( ps, 10 ) );
}
va.fsave( "/tmp/a.aaa" );
va.fload( "/tmp/a.aaa" );
va.print();
}
void test7()
{
VTrie tr; // hash-like
VTrie tr2; // hash-like
VArray va;
// inserting keys and values
tr[ "key1" ] = "data1";
tr[ "key2" ] = "data2";
tr[ "key3" ] = "data3";
tr.print();
printf( "---------------------------------1---\n" );
tr.reverse();
tr.print();
printf( "---------------------------------2---\n" );
tr.reverse();
tr.print();
printf( "---------------------------------3---\n" );
tr2 = str_split( " ", "this is simple one way test" );
tr2.print();
printf( "---------------------------------4---\n" );
tr2 += tr;
tr2.print();
printf( "---------------------------------5---\n" );
va = tr2;
va.print();
printf( "---------------------------------6---\n" );
}
void test8()
{
VString v1;
VString v2;
v1 = "this is simple test ";
v1 *= 1024;
printf( "v1 len: %d\n", (int)str_len( v1 ) );
v2.compact( 1 ); // makes v2 compact, i.e. it will get as much memory as it
// needs. otherwise it will get fixed amount of blocks
v2 = v1; // data is shared between v1 and v2. any change to v1 or v2 will
// detach this data and both will get own copy
v2[0] = ' '; // this will create own data for v2
str_tr( v2, "ti", "TI" ); // capitalize T and I
v2 = ""; // this will free all data allocated by v2
printf( "copy 7,6: [%s]", (const char*)str_copy( v2, v1, 8, 6 ) );
printf( "copy 10: [%s]", (const char*)str_copy( v2, v1, -10 ) );
printf( "************************ test 5 ends here\n" );
}
void test9()
{
VArray va;
VTrie tr;
printf( "---9---------------------------------------------------\n" );
va.push( "one" );
va.push( "two" );
va.push( "tri" );
va.push( "pet" );
tr = va;
tr.print();
va.push( &tr );
va.print();
VArray va2;
va2.push( "1" );
va2.push( "2" );
va2.push( "3" );
va2.push( "4" );
va2.unshift( "0" );
va2.unshift( &va );
va2.push( &va );
va2.print();
}
void test0()
{
VTrie tr;
tr["testone"] = "1";
tr["testwo"] = "2";
tr["tree"] = "3";
tr.print_trace();
printf( "\n-------------------------------------------------------------------\n\n" );
tr.del( "test", 1 );
tr.print();
printf( "\n-------------------------------------------------------------------\n\n" );
tr.print_trace();
}
int main( void )
{
test0();
#if 0
char t[256] = "123456----------------------------------------9999999999999";
char T[256] = "123456----------------------------------------9999999999999";
str_trim_left( t, 3 );
printf( "%s\n", t );
for( long z; z < 300000000; z++ )
{
//str_copy( t+10, t, 0, 15 ); // check for overlapping borders, begin of str
//str_copy( t+10, t+20, 0, 15 ); // check for overlapping borders, end of str
//memmove( T, t, 222 );
//memcpy( T, t, 222 );
//str_copy( T, t, 0, 222 ); // check for overlapping borders, begin of str
}
#endif
/*
VString nu = "is not null";
nu = NULL;
ASSERT( nu == "" );
*/
char t[92] = "this is simple test";
char r[92] = "1111111111111111111";
str_word( t, " ", r );
ASSERT( strcmp( t, "is simple test" ) == 0 );
ASSERT( strcmp( r, "this" ) == 0 );
strcpy( t, " opa" );
str_cut_left( t, " " );
ASSERT( strcmp( t, "opa" ) == 0 );
strcpy( t, "opa " );
str_cut_right( t, " " );
ASSERT( strcmp( t, "opa" ) == 0 );
strcpy( t, "this is good" );
str_ins( t, 8, "not " );
ASSERT( strcmp( t, "this is not good" ) == 0 );
str_del( t, 8, 4 );
ASSERT( strcmp( t, "this is good" ) == 0 );
strcpy( t, "more" );
str_mul( t, 3 );
ASSERT( strcmp( t, "moremoremore" ) == 0 );
str_copy( t+10, t, 0, 15 ); // check for overlapping borders, begin of str
str_copy( t+10, t+20, 0, 15 ); // check for overlapping borders, end of str
strcpy( t, "despicable me" );
str_word( t, " ", r );
ASSERT( strcmp( r, "despicable" ) == 0 );
str_word( t, " ", r );
ASSERT( strcmp( r, "me" ) == 0 );
ASSERT( t[0] == 0 );
/**/
test1();
test2();
test3();
test4();
test5();
test6();
test7();
test8();
test9();
//*/
return 0;
}
|