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
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
869
870
871
872
873
874
875
876
877
878
879
880
881
882
883
884
885
886
887
888
889
890
891
892
893
894
895
896
897
898
899
900
901
902
903
904
905
906
907
908
909
910
911
912
913
914
915
916
917
918
919
920
921
922
923
924
925
926
927
928
929
930
931
932
933
934
935
936
937
938
939
940
941
942
943
944
945
946
947
948
949
950
951
952
953
954
955
956
957
958
959
960
961
962
963
964
965
966
967
968
969
970
971
972
973
974
975
976
977
978
979
980
981
982
983
984
985
986
987
988
989
990
991
992
993
994
995
996
997
998
999
1000
1001
1002
1003
1004
1005
1006
1007
1008
1009
1010
1011
1012
1013
1014
1015
1016
1017
1018
1019
1020
1021
1022
1023
1024
1025
1026
1027
1028
1029
1030
1031
1032
1033
1034
1035
1036
1037
1038
1039
1040
1041
1042
1043
1044
1045
1046
1047
1048
1049
1050
1051
1052
1053
1054
1055
1056
1057
1058
1059
1060
1061
1062
1063
1064
1065
1066
1067
1068
1069
1070
1071
1072
1073
1074
1075
1076
1077
1078
1079
1080
1081
1082
1083
1084
1085
1086
1087
1088
1089
1090
1091
1092
1093
1094
1095
1096
1097
1098
1099
1100
1101
1102
1103
1104
1105
1106
1107
1108
1109
1110
1111
1112
1113
1114
1115
1116
1117
1118
1119
1120
1121
1122
1123
1124
1125
1126
1127
1128
1129
1130
1131
1132
1133
1134
1135
1136
1137
1138
1139
1140
1141
1142
1143
1144
1145
1146
1147
1148
1149
1150
1151
|
/****************************************************************************
**
** Implementation of TQGDict and TQGDictIterator classes
**
** Created : 920529
**
** Copyright (C) 1992-2008 Trolltech ASA. All rights reserved.
**
** This file is part of the tools module of the TQt GUI Toolkit.
**
** This file may be used under the terms of the GNU General
** Public License versions 2.0 or 3.0 as published by the Free
** Software Foundation and appearing in the files LICENSE.GPL2
** and LICENSE.GPL3 included in the packaging of this file.
** Alternatively you may (at your option) use any later version
** of the GNU General Public License if such license has been
** publicly approved by Trolltech ASA (or its successors, if any)
** and the KDE Free TQt Foundation.
**
** Please review the following information to ensure GNU General
** Public Licensing requirements will be met:
** http://trolltech.com/products/qt/licenses/licensing/opensource/.
** If you are unsure which license is appropriate for your use, please
** review the following information:
** http://trolltech.com/products/qt/licenses/licensing/licensingoverview
** or contact the sales department at [email protected].
**
** This file may be used under the terms of the Q Public License as
** defined by Trolltech ASA and appearing in the file LICENSE.TQPL
** included in the packaging of this file. Licensees holding valid TQt
** Commercial licenses may use this file in accordance with the TQt
** Commercial License Agreement provided with the Software.
**
** This file is provided "AS IS" with NO WARRANTY OF ANY KIND,
** INCLUDING THE WARRANTIES OF DESIGN, MERCHANTABILITY AND FITNESS FOR
** A PARTICULAR PURPOSE. Trolltech reserves all rights not granted
** herein.
**
**********************************************************************/
#include "ntqgdict.h"
#include "ntqptrlist.h"
#include "ntqstring.h"
#include "ntqdatastream.h"
#include <ctype.h>
/*!
\class TQGDict
\reentrant
\ingroup collection
\brief The TQGDict class is an internal class for implementing TQDict template classes.
\internal
TQGDict is a strictly internal class that acts as a base class for the
\link collection.html collection classes\endlink TQDict and TQIntDict.
TQGDict has some virtual functions that can be reimplemented to customize
the subclasses.
\list
\i read() reads a collection/dictionary item from a TQDataStream.
\i write() writes a collection/dictionary item to a TQDataStream.
\endlist
Normally, you do not have to reimplement any of these functions.
*/
static const int op_find = 0;
static const int op_insert = 1;
static const int op_replace = 2;
class TQGDItList : public TQPtrList<TQGDictIterator>
{
public:
TQGDItList() : TQPtrList<TQGDictIterator>() {}
TQGDItList( const TQGDItList &list ) : TQPtrList<TQGDictIterator>(list) {}
~TQGDItList() { clear(); }
TQGDItList &operator=(const TQGDItList &list)
{ return (TQGDItList&)TQPtrList<TQGDictIterator>::operator=(list); }
};
/*****************************************************************************
Default implementation of special and virtual functions
*****************************************************************************/
/*!
Returns the hash key for \a key, when key is a string.
*/
int TQGDict::hashKeyString( const TQString &key )
{
#if defined(QT_CHECK_NULL)
if ( key.isNull() )
tqWarning( "TQGDict::hashKeyString: Invalid null key" );
#endif
int i;
register uint h=0;
uint g;
const TQChar *p = key.unicode();
if ( cases ) { // case sensitive
for ( i=0; i<(int)key.length(); i++ ) {
h = (h<<4) + p[i].cell();
if ( (g = h & 0xf0000000) )
h ^= g >> 24;
h &= ~g;
}
} else { // case insensitive
for ( i=0; i<(int)key.length(); i++ ) {
h = (h<<4) + p[i].lower().cell();
if ( (g = h & 0xf0000000) )
h ^= g >> 24;
h &= ~g;
}
}
int index = h;
if ( index < 0 ) // adjust index to table size
index = -index;
return index;
}
/*!
Returns the hash key for \a key, which is a C string.
*/
int TQGDict::hashKeyAscii( const char *key )
{
#if defined(QT_CHECK_NULL)
if ( key == 0 )
tqWarning( "TQGDict::hashAsciiKey: Invalid null key" );
#endif
register const char *k = key;
register uint h=0;
uint g;
if ( cases ) { // case sensitive
while ( *k ) {
h = (h<<4) + *k++;
if ( (g = h & 0xf0000000) )
h ^= g >> 24;
h &= ~g;
}
} else { // case insensitive
while ( *k ) {
h = (h<<4) + tolower((uchar) *k);
if ( (g = h & 0xf0000000) )
h ^= g >> 24;
h &= ~g;
k++;
}
}
int index = h;
if ( index < 0 ) // adjust index to table size
index = -index;
return index;
}
#ifndef TQT_NO_DATASTREAM
/*!
\overload
Reads a collection/dictionary item from the stream \a s and returns a
reference to the stream.
The default implementation sets \a item to 0.
\sa write()
*/
TQDataStream& TQGDict::read( TQDataStream &s, TQPtrCollection::Item &item )
{
item = 0;
return s;
}
/*!
\overload
Writes a collection/dictionary item to the stream \a s and returns a
reference to the stream.
\sa read()
*/
TQDataStream& TQGDict::write( TQDataStream &s, TQPtrCollection::Item ) const
{
return s;
}
#endif //TQT_NO_DATASTREAM
/*****************************************************************************
TQGDict member functions
*****************************************************************************/
/*!
Constructs a dictionary.
\a len is the initial size of the dictionary.
The key type is \a kt which may be \c StringKey, \c AsciiKey,
\c IntKey or \c PtrKey. The case-sensitivity of lookups is set with
\a caseSensitive. Keys are copied if \a copyKeys is TRUE.
*/
TQGDict::TQGDict( uint len, KeyType kt, bool caseSensitive, bool copyKeys )
{
init( len, kt, caseSensitive, copyKeys );
}
void TQGDict::init( uint len, KeyType kt, bool caseSensitive, bool copyKeys )
{
vlen = len ? len : 17;
vec = new TQBaseBucket *[ vlen ];
TQ_CHECK_PTR( vec );
memset( (char*)vec, 0, vlen*sizeof(TQBaseBucket*) );
numItems = 0;
iterators = 0;
// The caseSensitive and copyKey options don't make sense for
// all dict types.
switch ( (keytype = (uint)kt) ) {
case StringKey:
cases = caseSensitive;
copyk = FALSE;
break;
case AsciiKey:
cases = caseSensitive;
copyk = copyKeys;
break;
default:
cases = FALSE;
copyk = FALSE;
break;
}
}
/*!
Constructs a copy of \a dict.
*/
TQGDict::TQGDict( const TQGDict & dict )
: TQPtrCollection( dict )
{
init( dict.vlen, (KeyType)dict.keytype, dict.cases, dict.copyk );
TQGDictIterator it( dict );
while ( it.get() ) { // copy from other dict
switch ( keytype ) {
case StringKey:
look_string( it.getKeyString(), it.get(), op_insert );
break;
case AsciiKey:
look_ascii( it.getKeyAscii(), it.get(), op_insert );
break;
case IntKey:
look_int( it.getKeyInt(), it.get(), op_insert );
break;
case PtrKey:
look_ptr( it.getKeyPtr(), it.get(), op_insert );
break;
}
++it;
}
}
/*!
Removes all items from the dictionary and destroys it.
*/
TQGDict::~TQGDict()
{
clear(); // delete everything
delete [] vec;
if ( !iterators ) // no iterators for this dict
return;
TQGDictIterator *i = iterators->first();
while ( i ) { // notify all iterators that
i->dict = 0; // this dict is deleted
i = iterators->next();
}
delete iterators;
}
/*!
Assigns \a dict to this dictionary.
*/
TQGDict &TQGDict::operator=( const TQGDict &dict )
{
if ( &dict == this )
return *this;
clear();
TQGDictIterator it( dict );
while ( it.get() ) { // copy from other dict
switch ( keytype ) {
case StringKey:
look_string( it.getKeyString(), it.get(), op_insert );
break;
case AsciiKey:
look_ascii( it.getKeyAscii(), it.get(), op_insert );
break;
case IntKey:
look_int( it.getKeyInt(), it.get(), op_insert );
break;
case PtrKey:
look_ptr( it.getKeyPtr(), it.get(), op_insert );
break;
}
++it;
}
return *this;
}
/*!
\fn uint TQGDict::count() const
Returns the number of items in the dictionary.
*/
/*!
\fn uint TQGDict::size() const
Returns the size of the hash array.
*/
/*!
The do-it-all function; \a op is one of op_find, op_insert, op_replace.
The key is \a key and the item is \a d.
*/
TQPtrCollection::Item TQGDict::look_string( const TQString &key, TQPtrCollection::Item d,
int op )
{
TQStringBucket *n = 0;
int index = hashKeyString(key) % vlen;
if ( op == op_find ) { // find
if ( cases ) {
n = (TQStringBucket*)vec[index];
while( n != 0 ) {
if ( key == n->getKey() )
return n->getData(); // item found
n = (TQStringBucket*)n->getNext();
}
} else {
TQString k = key.lower();
n = (TQStringBucket*)vec[index];
while( n != 0 ) {
if ( k == n->getKey().lower() )
return n->getData(); // item found
n = (TQStringBucket*)n->getNext();
}
}
return 0; // not found
}
if ( op == op_replace ) { // replace
if ( vec[index] != 0 ) // maybe something there
remove_string( key );
}
// op_insert or op_replace
n = new TQStringBucket(key,newItem(d),vec[index]);
TQ_CHECK_PTR( n );
#if defined(QT_CHECK_NULL)
if ( n->getData() == 0 )
tqWarning( "TQDict: Cannot insert null item" );
#endif
vec[index] = n;
numItems++;
return n->getData();
}
TQPtrCollection::Item TQGDict::look_ascii( const char *key, TQPtrCollection::Item d, int op )
{
TQAsciiBucket *n;
int index = hashKeyAscii(key) % vlen;
if ( op == op_find ) { // find
if ( cases ) {
for ( n=(TQAsciiBucket*)vec[index]; n;
n=(TQAsciiBucket*)n->getNext() ) {
if ( qstrcmp(n->getKey(),key) == 0 )
return n->getData(); // item found
}
} else {
for ( n=(TQAsciiBucket*)vec[index]; n;
n=(TQAsciiBucket*)n->getNext() ) {
if ( tqstricmp(n->getKey(),key) == 0 )
return n->getData(); // item found
}
}
return 0; // not found
}
if ( op == op_replace ) { // replace
if ( vec[index] != 0 ) // maybe something there
remove_ascii( key );
}
// op_insert or op_replace
n = new TQAsciiBucket(copyk ? tqstrdup(key) : key,newItem(d),vec[index]);
TQ_CHECK_PTR( n );
#if defined(QT_CHECK_NULL)
if ( n->getData() == 0 )
tqWarning( "TQAsciiDict: Cannot insert null item" );
#endif
vec[index] = n;
numItems++;
return n->getData();
}
TQPtrCollection::Item TQGDict::look_int( long key, TQPtrCollection::Item d, int op )
{
TQIntBucket *n;
int index = (int)((ulong)key % vlen); // simple hash
if ( op == op_find ) { // find
for ( n=(TQIntBucket*)vec[index]; n;
n=(TQIntBucket*)n->getNext() ) {
if ( n->getKey() == key )
return n->getData(); // item found
}
return 0; // not found
}
if ( op == op_replace ) { // replace
if ( vec[index] != 0 ) // maybe something there
remove_int( key );
}
// op_insert or op_replace
n = new TQIntBucket(key,newItem(d),vec[index]);
TQ_CHECK_PTR( n );
#if defined(QT_CHECK_NULL)
if ( n->getData() == 0 )
tqWarning( "TQIntDict: Cannot insert null item" );
#endif
vec[index] = n;
numItems++;
return n->getData();
}
TQPtrCollection::Item TQGDict::look_ptr( void *key, TQPtrCollection::Item d, int op )
{
TQPtrBucket *n;
int index = (int)((ulong)key % vlen); // simple hash
if ( op == op_find ) { // find
for ( n=(TQPtrBucket*)vec[index]; n;
n=(TQPtrBucket*)n->getNext() ) {
if ( n->getKey() == key )
return n->getData(); // item found
}
return 0; // not found
}
if ( op == op_replace ) { // replace
if ( vec[index] != 0 ) // maybe something there
remove_ptr( key );
}
// op_insert or op_replace
n = new TQPtrBucket(key,newItem(d),vec[index]);
TQ_CHECK_PTR( n );
#if defined(QT_CHECK_NULL)
if ( n->getData() == 0 )
tqWarning( "TQPtrDict: Cannot insert null item" );
#endif
vec[index] = n;
numItems++;
return n->getData();
}
/*!
Changes the size of the hashtable to \a newsize.
The contents of the dictionary are preserved,
but all iterators on the dictionary become invalid.
*/
void TQGDict::resize( uint newsize )
{
// Save old information
TQBaseBucket **old_vec = vec;
uint old_vlen = vlen;
bool old_copyk = copyk;
vec = new TQBaseBucket *[vlen = newsize];
TQ_CHECK_PTR( vec );
memset( (char*)vec, 0, vlen*sizeof(TQBaseBucket*) );
numItems = 0;
copyk = FALSE;
// Reinsert every item from vec, deleting vec as we go
for ( uint index = 0; index < old_vlen; index++ ) {
switch ( keytype ) {
case StringKey:
{
TQStringBucket *n=(TQStringBucket *)old_vec[index];
while ( n ) {
look_string( n->getKey(), n->getData(), op_insert );
TQStringBucket *t=(TQStringBucket *)n->getNext();
delete n;
n = t;
}
}
break;
case AsciiKey:
{
TQAsciiBucket *n=(TQAsciiBucket *)old_vec[index];
while ( n ) {
look_ascii( n->getKey(), n->getData(), op_insert );
TQAsciiBucket *t=(TQAsciiBucket *)n->getNext();
delete n;
n = t;
}
}
break;
case IntKey:
{
TQIntBucket *n=(TQIntBucket *)old_vec[index];
while ( n ) {
look_int( n->getKey(), n->getData(), op_insert );
TQIntBucket *t=(TQIntBucket *)n->getNext();
delete n;
n = t;
}
}
break;
case PtrKey:
{
TQPtrBucket *n=(TQPtrBucket *)old_vec[index];
while ( n ) {
look_ptr( n->getKey(), n->getData(), op_insert );
TQPtrBucket *t=(TQPtrBucket *)n->getNext();
delete n;
n = t;
}
}
break;
}
}
delete [] old_vec;
// Restore state
copyk = old_copyk;
// Invalidate all iterators, since order is lost
if ( iterators && iterators->count() ) {
TQGDictIterator *i = iterators->first();
while ( i ) {
i->toFirst();
i = iterators->next();
}
}
}
/*!
Unlinks the bucket with the specified key (and specified data pointer,
if it is set).
*/
void TQGDict::unlink_common( int index, TQBaseBucket *node, TQBaseBucket *prev )
{
if ( iterators && iterators->count() ) { // update iterators
TQGDictIterator *i = iterators->first();
while ( i ) { // invalidate all iterators
if ( i->curNode == node ) // referring to pending node
i->operator++();
i = iterators->next();
}
}
if ( prev ) // unlink node
prev->setNext( node->getNext() );
else
vec[index] = node->getNext();
numItems--;
}
TQStringBucket *TQGDict::unlink_string( const TQString &key, TQPtrCollection::Item d )
{
if ( numItems == 0 ) // nothing in dictionary
return 0;
TQStringBucket *n;
TQStringBucket *prev = 0;
int index = hashKeyString(key) % vlen;
if ( cases ) {
for ( n=(TQStringBucket*)vec[index]; n;
n=(TQStringBucket*)n->getNext() ) {
bool found = (key == n->getKey());
if ( found && d )
found = (n->getData() == d);
if ( found ) {
unlink_common(index,n,prev);
return n;
}
prev = n;
}
} else {
TQString k = key.lower();
for ( n=(TQStringBucket*)vec[index]; n;
n=(TQStringBucket*)n->getNext() ) {
bool found = (k == n->getKey().lower());
if ( found && d )
found = (n->getData() == d);
if ( found ) {
unlink_common(index,n,prev);
return n;
}
prev = n;
}
}
return 0;
}
TQAsciiBucket *TQGDict::unlink_ascii( const char *key, TQPtrCollection::Item d )
{
if ( numItems == 0 ) // nothing in dictionary
return 0;
TQAsciiBucket *n;
TQAsciiBucket *prev = 0;
int index = hashKeyAscii(key) % vlen;
for ( n=(TQAsciiBucket *)vec[index]; n; n=(TQAsciiBucket *)n->getNext() ) {
bool found = (cases ? qstrcmp(n->getKey(),key)
: tqstricmp(n->getKey(),key)) == 0;
if ( found && d )
found = (n->getData() == d);
if ( found ) {
unlink_common(index,n,prev);
return n;
}
prev = n;
}
return 0;
}
TQIntBucket *TQGDict::unlink_int( long key, TQPtrCollection::Item d )
{
if ( numItems == 0 ) // nothing in dictionary
return 0;
TQIntBucket *n;
TQIntBucket *prev = 0;
int index = (int)((ulong)key % vlen);
for ( n=(TQIntBucket *)vec[index]; n; n=(TQIntBucket *)n->getNext() ) {
bool found = (n->getKey() == key);
if ( found && d )
found = (n->getData() == d);
if ( found ) {
unlink_common(index,n,prev);
return n;
}
prev = n;
}
return 0;
}
TQPtrBucket *TQGDict::unlink_ptr( void *key, TQPtrCollection::Item d )
{
if ( numItems == 0 ) // nothing in dictionary
return 0;
TQPtrBucket *n;
TQPtrBucket *prev = 0;
int index = (int)((ulong)key % vlen);
for ( n=(TQPtrBucket *)vec[index]; n; n=(TQPtrBucket *)n->getNext() ) {
bool found = (n->getKey() == key);
if ( found && d )
found = (n->getData() == d);
if ( found ) {
unlink_common(index,n,prev);
return n;
}
prev = n;
}
return 0;
}
/*!
Removes the item with the specified \a key. If \a item is not null,
the remove will match the \a item as well (used to remove an
item when several items have the same key).
*/
bool TQGDict::remove_string( const TQString &key, TQPtrCollection::Item item )
{
TQStringBucket *n = unlink_string( key, item );
if ( n ) {
deleteItem( n->getData() );
delete n;
return TRUE;
} else {
return FALSE;
}
}
bool TQGDict::remove_ascii( const char *key, TQPtrCollection::Item item )
{
TQAsciiBucket *n = unlink_ascii( key, item );
if ( n ) {
if ( copyk )
delete [] (char *)n->getKey();
deleteItem( n->getData() );
delete n;
}
return n != 0;
}
bool TQGDict::remove_int( long key, TQPtrCollection::Item item )
{
TQIntBucket *n = unlink_int( key, item );
if ( n ) {
deleteItem( n->getData() );
delete n;
}
return n != 0;
}
bool TQGDict::remove_ptr( void *key, TQPtrCollection::Item item )
{
TQPtrBucket *n = unlink_ptr( key, item );
if ( n ) {
deleteItem( n->getData() );
delete n;
}
return n != 0;
}
TQPtrCollection::Item TQGDict::take_string( const TQString &key )
{
TQStringBucket *n = unlink_string( key );
Item d;
if ( n ) {
d = n->getData();
delete n;
} else {
d = 0;
}
return d;
}
TQPtrCollection::Item TQGDict::take_ascii( const char *key )
{
TQAsciiBucket *n = unlink_ascii( key );
Item d;
if ( n ) {
if ( copyk )
delete [] (char *)n->getKey();
d = n->getData();
delete n;
} else {
d = 0;
}
return d;
}
TQPtrCollection::Item TQGDict::take_int( long key )
{
TQIntBucket *n = unlink_int( key );
Item d;
if ( n ) {
d = n->getData();
delete n;
} else {
d = 0;
}
return d;
}
TQPtrCollection::Item TQGDict::take_ptr( void *key )
{
TQPtrBucket *n = unlink_ptr( key );
Item d;
if ( n ) {
d = n->getData();
delete n;
} else {
d = 0;
}
return d;
}
/*!
Removes all items from the dictionary.
*/
void TQGDict::clear()
{
if ( !numItems )
return;
numItems = 0; // disable remove() function
for ( uint j=0; j<vlen; j++ ) { // destroy hash table
if ( vec[j] ) {
switch ( keytype ) {
case StringKey:
{
TQStringBucket *n=(TQStringBucket *)vec[j];
while ( n ) {
TQStringBucket *next = (TQStringBucket*)n->getNext();
deleteItem( n->getData() );
delete n;
n = next;
}
}
break;
case AsciiKey:
{
TQAsciiBucket *n=(TQAsciiBucket *)vec[j];
while ( n ) {
TQAsciiBucket *next = (TQAsciiBucket*)n->getNext();
if ( copyk )
delete [] (char *)n->getKey();
deleteItem( n->getData() );
delete n;
n = next;
}
}
break;
case IntKey:
{
TQIntBucket *n=(TQIntBucket *)vec[j];
while ( n ) {
TQIntBucket *next = (TQIntBucket*)n->getNext();
deleteItem( n->getData() );
delete n;
n = next;
}
}
break;
case PtrKey:
{
TQPtrBucket *n=(TQPtrBucket *)vec[j];
while ( n ) {
TQPtrBucket *next = (TQPtrBucket*)n->getNext();
deleteItem( n->getData() );
delete n;
n = next;
}
}
break;
}
vec[j] = 0; // detach list of buckets
}
}
if ( iterators && iterators->count() ) { // invalidate all iterators
TQGDictIterator *i = iterators->first();
while ( i ) {
i->curNode = 0;
i = iterators->next();
}
}
}
/*!
Outputs debug statistics.
*/
void TQGDict::statistics() const
{
#if defined(QT_DEBUG)
TQString line;
line.fill( '-', 60 );
double real, ideal;
tqDebug( "%s", line.ascii() );
tqDebug( "DICTIONARY STATISTICS:" );
if ( count() == 0 ) {
tqDebug( "Empty!" );
tqDebug( "%s", line.ascii() );
return;
}
real = 0.0;
ideal = (float)count()/(2.0*size())*(count()+2.0*size()-1);
uint i = 0;
while ( i<size() ) {
TQBaseBucket *n = vec[i];
int b = 0;
while ( n ) { // count number of buckets
b++;
n = n->getNext();
}
real = real + (double)b * ((double)b+1.0)/2.0;
char buf[80], *pbuf;
if ( b > 78 )
b = 78;
pbuf = buf;
while ( b-- )
*pbuf++ = '*';
*pbuf = '\0';
tqDebug( "%s", buf );
i++;
}
tqDebug( "Array size = %d", size() );
tqDebug( "# items = %d", count() );
tqDebug( "Real dist = %g", real );
tqDebug( "Rand dist = %g", ideal );
tqDebug( "Real/Rand = %g", real/ideal );
tqDebug( "%s", line.ascii() );
#endif // QT_DEBUG
}
/*****************************************************************************
TQGDict stream functions
*****************************************************************************/
#ifndef TQT_NO_DATASTREAM
TQDataStream &operator>>( TQDataStream &s, TQGDict &dict )
{
return dict.read( s );
}
TQDataStream &operator<<( TQDataStream &s, const TQGDict &dict )
{
return dict.write( s );
}
#if defined(Q_CC_DEC) && defined(__alpha) && (__DECCXX_VER-0 >= 50190001)
#pragma message disable narrowptr
#endif
/*!
Reads a dictionary from the stream \a s.
*/
TQDataStream &TQGDict::read( TQDataStream &s )
{
uint num;
s >> num; // read number of items
clear(); // clear dict
while ( num-- ) { // read all items
Item d;
switch ( keytype ) {
case StringKey:
{
TQString k;
s >> k;
read( s, d );
look_string( k, d, op_insert );
}
break;
case AsciiKey:
{
char *k;
s >> k;
read( s, d );
look_ascii( k, d, op_insert );
if ( copyk )
delete [] k;
}
break;
case IntKey:
{
TQ_UINT32 k;
s >> k;
read( s, d );
look_int( k, d, op_insert );
}
break;
case PtrKey:
{
TQ_UINT32 k;
s >> k;
read( s, d );
// ### cannot insert 0 - this renders the thing
// useless since all pointers are written as 0,
// but hey, serializing pointers? can it be done
// at all, ever?
if ( k )
look_ptr( (void *)k, d, op_insert );
}
break;
}
}
return s;
}
/*!
Writes the dictionary to the stream \a s.
*/
TQDataStream& TQGDict::write( TQDataStream &s ) const
{
s << count(); // write number of items
uint i = 0;
while ( i<size() ) {
TQBaseBucket *n = vec[i];
while ( n ) { // write all buckets
switch ( keytype ) {
case StringKey:
s << ((TQStringBucket*)n)->getKey();
break;
case AsciiKey:
s << ((TQAsciiBucket*)n)->getKey();
break;
case IntKey:
s << (TQ_UINT32)((TQIntBucket*)n)->getKey();
break;
case PtrKey:
s << (TQ_UINT32)0; // ### cannot serialize a pointer
break;
}
write( s, n->getData() ); // write data
n = n->getNext();
}
i++;
}
return s;
}
#endif //TQT_NO_DATASTREAM
/*****************************************************************************
TQGDictIterator member functions
*****************************************************************************/
/*!
\class TQGDictIterator ntqgdict.h
\reentrant
\ingroup collection
\brief The TQGDictIterator class is an internal class for implementing TQDictIterator and TQIntDictIterator.
\internal
TQGDictIterator is a strictly internal class that does the heavy work for
TQDictIterator and TQIntDictIterator.
*/
/*!
Constructs an iterator that operates on the dictionary \a d.
*/
TQGDictIterator::TQGDictIterator( const TQGDict &d )
{
dict = (TQGDict *)&d; // get reference to dict
toFirst(); // set to first noe
if ( !dict->iterators ) {
dict->iterators = new TQGDItList; // create iterator list
TQ_CHECK_PTR( dict->iterators );
}
dict->iterators->append( this ); // attach iterator to dict
}
/*!
Constructs a copy of the iterator \a it.
*/
TQGDictIterator::TQGDictIterator( const TQGDictIterator &it )
{
dict = it.dict;
curNode = it.curNode;
curIndex = it.curIndex;
if ( dict )
dict->iterators->append( this ); // attach iterator to dict
}
/*!
Assigns a copy of the iterator \a it and returns a reference to this
iterator.
*/
TQGDictIterator &TQGDictIterator::operator=( const TQGDictIterator &it )
{
if ( dict ) // detach from old dict
dict->iterators->removeRef( this );
dict = it.dict;
curNode = it.curNode;
curIndex = it.curIndex;
if ( dict )
dict->iterators->append( this ); // attach to new list
return *this;
}
/*!
Destroys the iterator.
*/
TQGDictIterator::~TQGDictIterator()
{
if ( dict ) // detach iterator from dict
dict->iterators->removeRef( this );
}
/*!
Sets the iterator to point to the first item in the dictionary.
*/
TQPtrCollection::Item TQGDictIterator::toFirst()
{
if ( !dict ) {
#if defined(QT_CHECK_NULL)
tqWarning( "TQGDictIterator::toFirst: Dictionary has been deleted" );
#endif
return 0;
}
if ( dict->count() == 0 ) { // empty dictionary
curNode = 0;
return 0;
}
register uint i = 0;
register TQBaseBucket **v = dict->vec;
while ( !(*v++) )
i++;
curNode = dict->vec[i];
curIndex = i;
return curNode->getData();
}
/*!
Moves to the next item (postfix).
*/
TQPtrCollection::Item TQGDictIterator::operator()()
{
if ( !dict ) {
#if defined(QT_CHECK_NULL)
tqWarning( "TQGDictIterator::operator(): Dictionary has been deleted" );
#endif
return 0;
}
if ( !curNode )
return 0;
TQPtrCollection::Item d = curNode->getData();
this->operator++();
return d;
}
/*!
Moves to the next item (prefix).
*/
TQPtrCollection::Item TQGDictIterator::operator++()
{
if ( !dict ) {
#if defined(QT_CHECK_NULL)
tqWarning( "TQGDictIterator::operator++: Dictionary has been deleted" );
#endif
return 0;
}
if ( !curNode )
return 0;
curNode = curNode->getNext();
if ( !curNode ) { // no next bucket
register uint i = curIndex + 1; // look from next vec element
register TQBaseBucket **v = &dict->vec[i];
while ( i < dict->size() && !(*v++) )
i++;
if ( i == dict->size() ) { // nothing found
curNode = 0;
return 0;
}
curNode = dict->vec[i];
curIndex = i;
}
return curNode->getData();
}
/*!
Moves \a jumps positions forward.
*/
TQPtrCollection::Item TQGDictIterator::operator+=( uint jumps )
{
while ( curNode && jumps-- )
operator++();
return curNode ? curNode->getData() : 0;
}
|