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
|
// -*- C++ -*-
//=============================================================================
/**
* @file Hash_Map_Manager_T.h
*
* $Id$
*
* @author Douglas C. Schmidt <schmidt@cs.wustl.edu>
*/
//=============================================================================
#ifndef ACE_HASH_MAP_MANAGER_T_H
#define ACE_HASH_MAP_MANAGER_T_H
#include /**/ "ace/pre.h"
#include "ace/config-all.h"
#if !defined (ACE_LACKS_PRAGMA_ONCE)
# pragma once
#endif /* ACE_LACKS_PRAGMA_ONCE */
#include "ace/Default_Constants.h"
#include "ace/Functor_T.h"
#include "ace/Log_Msg.h"
ACE_BEGIN_VERSIONED_NAMESPACE_DECL
/**
* @class ACE_Hash_Map_Entry
*
* @brief Define an entry in the hash table.
*/
template <class EXT_ID, class INT_ID>
class ACE_Hash_Map_Entry
{
public:
// = Initialization and termination methods.
/// Constructor.
ACE_Hash_Map_Entry (const EXT_ID &ext_id,
const INT_ID &int_id,
ACE_Hash_Map_Entry<EXT_ID, INT_ID> *next = 0,
ACE_Hash_Map_Entry<EXT_ID, INT_ID> *prev = 0);
/// Constructor.
ACE_Hash_Map_Entry (ACE_Hash_Map_Entry<EXT_ID, INT_ID> *next,
ACE_Hash_Map_Entry<EXT_ID, INT_ID> *prev);
# if ! defined (ACE_HAS_BROKEN_NOOP_DTORS)
/// Destructor.
~ACE_Hash_Map_Entry (void);
#endif /* ! defined (ACE_HAS_BROKEN_NOOP_DTORS) */
/// Key accessor.
EXT_ID& key (void);
/// Item accessor.
INT_ID& item (void);
/// Key used to look up an entry.
/// @deprecated Use key()
EXT_ID ext_id_;
/// The contents of the entry itself.
/// @deprecated Use item()
INT_ID int_id_;
/// Pointer to the next item in the bucket of overflow nodes.
ACE_Hash_Map_Entry<EXT_ID, INT_ID> *next_;
/// Pointer to the prev item in the bucket of overflow nodes.
ACE_Hash_Map_Entry<EXT_ID, INT_ID> *prev_;
/// Dump the state of an object.
void dump (void) const;
};
// Forward decl.
template <class EXT_ID, class INT_ID, class HASH_KEY, class COMPARE_KEYS, class ACE_LOCK>
class ACE_Hash_Map_Iterator_Base_Ex;
// Forward decl.
template <class EXT_ID, class INT_ID, class HASH_KEY, class COMPARE_KEYS, class ACE_LOCK>
class ACE_Hash_Map_Const_Iterator_Base_Ex;
// Forward decl.
template <class EXT_ID, class INT_ID, class HASH_KEY, class COMPARE_KEYS, class ACE_LOCK>
class ACE_Hash_Map_Iterator_Ex;
// Forward decl.
template <class EXT_ID, class INT_ID, class HASH_KEY, class COMPARE_KEYS, class ACE_LOCK>
class ACE_Hash_Map_Const_Iterator_Ex;
// Forward decl.
template <class EXT_ID, class INT_ID, class HASH_KEY, class COMPARE_KEYS, class ACE_LOCK>
class ACE_Hash_Map_Reverse_Iterator_Ex;
// Forward decl.
template <class EXT_ID, class INT_ID, class HASH_KEY, class COMPARE_KEYS, class ACE_LOCK>
class ACE_Hash_Map_Bucket_Iterator;
// Forward decl.
class ACE_Allocator;
/**
* @class ACE_Hash_Map_Manager_Ex
*
* @brief Define a map abstraction that efficiently associates
* <EXT_ID>s with <INT_ID>s.
*
* This implementation of a map uses a hash table. Key hashing
* is achieved through the HASH_KEY object and key comparison is
* achieved through the COMPARE_KEYS object.
* This class uses an ACE_Allocator to allocate memory. The
* user can make this a persistent class by providing an
* ACE_Allocator with a persistable memory pool.
*/
template <class EXT_ID, class INT_ID, class HASH_KEY, class COMPARE_KEYS, class ACE_LOCK>
class ACE_Hash_Map_Manager_Ex
{
public:
friend class ACE_Hash_Map_Iterator_Base_Ex<EXT_ID, INT_ID, HASH_KEY, COMPARE_KEYS, ACE_LOCK>;
friend class ACE_Hash_Map_Iterator_Ex<EXT_ID, INT_ID, HASH_KEY, COMPARE_KEYS, ACE_LOCK>;
friend class ACE_Hash_Map_Const_Iterator_Base_Ex<EXT_ID, INT_ID, HASH_KEY, COMPARE_KEYS, ACE_LOCK>;
friend class ACE_Hash_Map_Const_Iterator_Ex<EXT_ID, INT_ID, HASH_KEY, COMPARE_KEYS, ACE_LOCK>;
friend class ACE_Hash_Map_Reverse_Iterator_Ex<EXT_ID, INT_ID, HASH_KEY, COMPARE_KEYS, ACE_LOCK>;
friend class ACE_Hash_Map_Bucket_Iterator<EXT_ID, INT_ID, HASH_KEY, COMPARE_KEYS, ACE_LOCK>;
typedef EXT_ID
KEY;
typedef INT_ID
VALUE;
typedef ACE_LOCK lock_type;
typedef ACE_Hash_Map_Entry<EXT_ID, INT_ID>
ENTRY;
// = ACE-style iterator typedefs.
typedef ACE_Hash_Map_Iterator_Ex<EXT_ID, INT_ID, HASH_KEY, COMPARE_KEYS, ACE_LOCK>
ITERATOR;
typedef ACE_Hash_Map_Const_Iterator_Ex<EXT_ID, INT_ID, HASH_KEY, COMPARE_KEYS, ACE_LOCK>
CONST_ITERATOR;
typedef ACE_Hash_Map_Reverse_Iterator_Ex<EXT_ID, INT_ID, HASH_KEY, COMPARE_KEYS, ACE_LOCK>
REVERSE_ITERATOR;
// = STL-style iterator typedefs.
typedef ACE_Hash_Map_Iterator_Ex<EXT_ID, INT_ID, HASH_KEY, COMPARE_KEYS, ACE_LOCK>
iterator;
typedef ACE_Hash_Map_Const_Iterator_Ex<EXT_ID, INT_ID, HASH_KEY, COMPARE_KEYS, ACE_LOCK>
const_iterator;
typedef ACE_Hash_Map_Reverse_Iterator_Ex<EXT_ID, INT_ID, HASH_KEY, COMPARE_KEYS, ACE_LOCK>
reverse_iterator;
// = Initialization and termination methods.
/**
* Initialize a @c Hash_Map_Manager_Ex with default size elements.
* @param table_alloc is a pointer to a memory allocator used for
* table_, so it should supply size*sizeof (ACE_Hash_Map_Entry<EXT_ID, INT_ID>).
* @param entry_alloc is a pointer to an additional allocator for
* entries, so it should be able to allocate 'size' / chunks
* of sizeof(ACE_Hash_Map_Entry<EXT_ID, INT_ID>) bytes each.
* If @c table_alloc is 0 it defaults to @c ACE_Allocator::instance().
* If @c entry_alloc is 0 then it defaults to the same allocator as
* @c table_alloc.
*/
ACE_Hash_Map_Manager_Ex (ACE_Allocator *table_alloc = 0,
ACE_Allocator *entry_alloc = 0);
/**
* Initialize a @c Hash_Map_Manager_Ex with @c size elements.
* @param table_alloc is a pointer to a memory allocator used for
* table_, so it should supply size*sizeof (ACE_Hash_Map_Entry<EXT_ID, INT_ID>).
* @param entry_alloc is a pointer to an additional allocator for
* entries, so it should be able to allocate 'size' / chunks
* of sizeof(ACE_Hash_Map_Entry<EXT_ID, INT_ID>) bytes each.
* If @c table_alloc is 0 it defaults to @c ACE_Allocator::instance().
* If @c entry_alloc is 0 then it defaults to the same allocator as
* @c table_alloc.
*/
ACE_Hash_Map_Manager_Ex (size_t size,
ACE_Allocator *table_alloc = 0,
ACE_Allocator *entry_alloc = 0);
/**
* Initialize a @c Hash_Map_Manager_Ex with @c size elements.
* @param table_alloc is a pointer to a memory allocator used for
* table_, so it should supply size*sizeof (ACE_Hash_Map_Entry<EXT_ID, INT_ID>).
* @param entry_alloc is a pointer to an additional allocator for
* entries, so it should be able to allocate 'size' / chunks
* of sizeof(ACE_Hash_Map_Entry<EXT_ID, INT_ID>) bytes each.
* If @c table_alloc is 0 it defaults to @c ACE_Allocator::instance().
* If @c entry_alloc is 0 then it defaults to the same allocator as
* @c table_alloc.
* @return -1 on failure, 0 on success
*/
int open (size_t size = ACE_DEFAULT_MAP_SIZE,
ACE_Allocator *table_alloc = 0,
ACE_Allocator *entry_alloc = 0);
/// Close down a <Hash_Map_Manager_Ex> and release dynamically allocated
/// resources.
int close (void);
/// Removes all the entries in <Map_Manager_Ex>.
int unbind_all (void);
/// Cleanup the <Hash_Map_Manager_Ex>.
~ACE_Hash_Map_Manager_Ex (void);
/**
* Associate <ext_id> with <int_id>. If <ext_id> is already in the
* map then the <ACE_Hash_Map_Entry> is not changed. Returns 0 if a
* new entry is bound successfully, returns 1 if an attempt is made
* to bind an existing entry, and returns -1 if failures occur.
*/
int bind (const EXT_ID &item,
const INT_ID &int_id);
/**
* Same as a normal bind, except the map entry is also passed back
* to the caller. The entry in this case will either be the newly
* created entry, or the existing one.
*/
int bind (const EXT_ID &ext_id,
const INT_ID &int_id,
ACE_Hash_Map_Entry<EXT_ID, INT_ID> *&entry);
/**
* Associate <ext_id> with <int_id> if and only if <ext_id> is not
* in the map. If <ext_id> is already in the map then the <int_id>
* parameter is assigned the existing value in the map. Returns 0
* if a new entry is bound successfully, returns 1 if an attempt is
* made to bind an existing entry, and returns -1 if failures occur.
*/
int trybind (const EXT_ID &ext_id,
INT_ID &int_id);
/**
* Same as a normal trybind, except the map entry is also passed
* back to the caller. The entry in this case will either be the
* newly created entry, or the existing one.
*/
int trybind (const EXT_ID &ext_id,
INT_ID &int_id,
ACE_Hash_Map_Entry<EXT_ID, INT_ID> *&entry);
/**
* Reassociate <ext_id> with <int_id>. If <ext_id> is not in the
* map then behaves just like <bind>. Returns 0 if a new entry is
* bound successfully, returns 1 if an existing entry was rebound,
* and returns -1 if failures occur.
*/
int rebind (const EXT_ID &ext_id,
const INT_ID &int_id);
/**
* Same as a normal rebind, except the map entry is also passed back
* to the caller. The entry in this case will either be the newly
* created entry, or the existing one.
*/
int rebind (const EXT_ID &ext_id,
const INT_ID &int_id,
ACE_Hash_Map_Entry<EXT_ID, INT_ID> *&entry);
/**
* Associate <ext_id> with <int_id>. If <ext_id> is not in the map
* then behaves just like <bind>. Otherwise, store the old value of
* <int_id> into the "out" parameter and rebind the new parameters.
* Returns 0 if a new entry is bound successfully, returns 1 if an
* existing entry was rebound, and returns -1 if failures occur.
*/
int rebind (const EXT_ID &ext_id,
const INT_ID &int_id,
INT_ID &old_int_id);
/**
* Same as a normal rebind, except the map entry is also passed back
* to the caller. The entry in this case will either be the newly
* created entry, or the existing one.
*/
int rebind (const EXT_ID &ext_id,
const INT_ID &int_id,
INT_ID &old_int_id,
ACE_Hash_Map_Entry<EXT_ID, INT_ID> *&entry);
/**
* Associate <ext_id> with <int_id>. If <ext_id> is not in the map
* then behaves just like <bind>. Otherwise, store the old values
* of <ext_id> and <int_id> into the "out" parameters and rebind the
* new parameters. This is very useful if you need to have an
* atomic way of updating <ACE_Hash_Map_Entrys> and you also need
* full control over memory allocation. Returns 0 if a new entry is
* bound successfully, returns 1 if an existing entry was rebound,
* and returns -1 if failures occur.
*/
int rebind (const EXT_ID &ext_id,
const INT_ID &int_id,
EXT_ID &old_ext_id,
INT_ID &old_int_id);
/**
* Same as a normal rebind, except the map entry is also passed back
* to the caller. The entry in this case will either be the newly
* created entry, or the existing one.
*/
int rebind (const EXT_ID &ext_id,
const INT_ID &int_id,
EXT_ID &old_ext_id,
INT_ID &old_int_id,
ACE_Hash_Map_Entry<EXT_ID, INT_ID> *&entry);
/// Locate <ext_id> and pass out parameter via <int_id>.
/// Return 0 if found, returns -1 if not found.
int find (const EXT_ID &ext_id,
INT_ID &int_id) const;
/// Returns 0 if the <ext_id> is in the mapping, otherwise -1.
int find (const EXT_ID &ext_id) const;
/// Locate <ext_id> and pass out parameter via <entry>. If found,
/// return 0, returns -1 if not found.
int find (const EXT_ID &ext_id,
ACE_Hash_Map_Entry<EXT_ID, INT_ID> *&entry) const;
/**
* Unbind (remove) the <ext_id> from the map. Don't return the
* <int_id> to the caller (this is useful for collections where the
* <int_id>s are *not* dynamically allocated...)
*/
int unbind (const EXT_ID &ext_id);
/// Break any association of <ext_id>. Returns the value of <int_id>
/// in case the caller needs to deallocate memory. Return 0 if the
/// unbind was successfully, and returns -1 if failures occur.
int unbind (const EXT_ID &ext_id,
INT_ID &int_id);
/// Remove entry from map. Return 0 if the unbind was successfully,
/// and returns -1 if failures occur.
int unbind (ACE_Hash_Map_Entry<EXT_ID, INT_ID> *entry);
/// Returns the current number of ACE_Hash_Map_Entry objects in the
/// hash table.
size_t current_size (void) const;
/// Return the size of the array that's used to point to the
/// linked lists of ACE_Hash_Map_Entry objects in the hash table.
size_t total_size (void) const;
/**
* Returns a reference to the underlying <ACE_LOCK>. This makes it
* possible to acquire the lock explicitly, which can be useful in
* some cases if you instantiate the ACE_Atomic_Op with an
* ACE_Recursive_Mutex or ACE_Process_Mutex, or if you need to
* guard the state of an iterator.
* @note The right name would be <lock>, but HP/C++ will choke on that!
*/
ACE_LOCK &mutex (void);
/// Dump the state of an object.
void dump (void) const;
// = STL styled iterator factory functions.
/// Return forward iterator.
ACE_Hash_Map_Iterator_Ex<EXT_ID, INT_ID, HASH_KEY, COMPARE_KEYS, ACE_LOCK> begin (void);
ACE_Hash_Map_Iterator_Ex<EXT_ID, INT_ID, HASH_KEY, COMPARE_KEYS, ACE_LOCK> end (void);
/// Return reverse iterator.
ACE_Hash_Map_Reverse_Iterator_Ex<EXT_ID, INT_ID, HASH_KEY, COMPARE_KEYS, ACE_LOCK> rbegin (void);
ACE_Hash_Map_Reverse_Iterator_Ex<EXT_ID, INT_ID, HASH_KEY, COMPARE_KEYS, ACE_LOCK> rend (void);
protected:
// = The following methods do the actual work.
/// Returns 1 if <id1> == <id2>, else 0. This is defined as a
/// separate method to facilitate template specialization.
int equal (const EXT_ID &id1, const EXT_ID &id2);
/// Compute the hash value of the <ext_id>. This is defined as a
/// separate method to facilitate template specialization.
u_long hash (const EXT_ID &ext_id);
// = These methods assume locks are held by private methods.
/// Performs bind. Must be called with locks held.
int bind_i (const EXT_ID &ext_id,
const INT_ID &int_id);
/// Performs bind. Must be called with locks held.
int bind_i (const EXT_ID &ext_id,
const INT_ID &int_id,
ACE_Hash_Map_Entry<EXT_ID, INT_ID> *&entry);
/// Performs trybind. Must be called with locks held.
int trybind_i (const EXT_ID &ext_id,
INT_ID &int_id);
/// Performs trybind. Must be called with locks held.
int trybind_i (const EXT_ID &ext_id,
INT_ID &int_id,
ACE_Hash_Map_Entry<EXT_ID, INT_ID> *&entry);
/// Performs rebind. Must be called with locks held.
int rebind_i (const EXT_ID &ext_id,
const INT_ID &int_id);
/// Performs rebind. Must be called with locks held.
int rebind_i (const EXT_ID &ext_id,
const INT_ID &int_id,
ACE_Hash_Map_Entry<EXT_ID, INT_ID> *&entry);
/// Performs rebind. Must be called with locks held.
int rebind_i (const EXT_ID &ext_id,
const INT_ID &int_id,
INT_ID &old_int_id);
/// Performs rebind. Must be called with locks held.
int rebind_i (const EXT_ID &ext_id,
const INT_ID &int_id,
INT_ID &old_int_id,
ACE_Hash_Map_Entry<EXT_ID, INT_ID> *&entry);
/// Performs rebind. Must be called with locks held.
int rebind_i (const EXT_ID &ext_id,
const INT_ID &int_id,
EXT_ID &old_ext_id,
INT_ID &old_int_id);
/// Performs rebind. Must be called with locks held.
int rebind_i (const EXT_ID &ext_id,
const INT_ID &int_id,
EXT_ID &old_ext_id,
INT_ID &old_int_id,
ACE_Hash_Map_Entry<EXT_ID, INT_ID> *&entry);
/// Performs a find of <int_id> using <ext_id> as the key. Must be
/// called with locks held.
int find_i (const EXT_ID &ext_id,
INT_ID &int_id);
/// Performs a find using <ext_id> as the key. Must be called with
/// locks held.
int find_i (const EXT_ID &ext_id);
/// Performs a find using <ext_id> as the key. Must be called with
/// locks held.
int find_i (const EXT_ID &ext_id,
ACE_Hash_Map_Entry<EXT_ID, INT_ID> *&entry);
/// Performs unbind. Must be called with locks held.
int unbind_i (const EXT_ID &ext_id,
INT_ID &int_id);
/// Performs unbind. Must be called with locks held.
int unbind_i (const EXT_ID &ext_id);
/// Performs unbind. Must be called with locks held.
int unbind_i (ACE_Hash_Map_Entry<EXT_ID, INT_ID> *entry);
/**
* Resize the map. Must be called with locks held.
* @note This method should never be called more than once or else all the
* hashing will get screwed up as the size will change.
*/
int create_buckets (size_t size);
/// Close down a <Map_Manager_Ex>. Must be called with
/// locks held.
int close_i (void);
/// Removes all the entries in <Map_Manager_Ex>. Must be called with
/// locks held.
int unbind_all_i (void);
/// Pointer to a memory allocator used for table_, so it should
/// supply size*sizeof (ACE_Hash_Map_Entry<EXT_ID, INT_ID>),
ACE_Allocator *table_allocator_;
/// Addidtional allocator for entries, so it should be able to
/// allocate 'size' / chunks of sizeof(ACE_Hash_Map_Entry<EXT_ID,
/// INT_ID>) bytes each.
ACE_Allocator *entry_allocator_;
/// Synchronization variable for the MT_SAFE
/// @c ACE_Hash_Map_Manager_Ex.
ACE_LOCK lock_;
/// Function object used for hashing keys.
HASH_KEY hash_key_;
/// Function object used for comparing keys.
COMPARE_KEYS compare_keys_;
protected:
/// Returns the <ACE_Hash_Map_Entry> that corresponds to <ext_id>.
int shared_find (const EXT_ID &ext_id,
ACE_Hash_Map_Entry<EXT_ID, INT_ID> *&entry,
size_t &loc);
/// Accessor of the underlying table
ACE_Hash_Map_Entry<EXT_ID, INT_ID> *table (void);
/// Accessor of the current size attribute
size_t cur_size (void) const;
private:
/**
* Array of <ACE_Hash_Map_Entry> *s, each of which points to an
* <ACE_Hash_Map_Entry> that serves as the beginning of a linked
* list of <EXT_ID>s that hash to that bucket.
*/
ACE_Hash_Map_Entry<EXT_ID, INT_ID> *table_;
/// Total size of the hash table.
size_t total_size_;
/// Current number of entries in the table
/// @note That this can be larger than <total_size_> due to the
/// bucket chaining).
size_t cur_size_;
// = Disallow these operations.
ACE_UNIMPLEMENTED_FUNC (void operator= (const ACE_Hash_Map_Manager_Ex<EXT_ID, INT_ID, HASH_KEY, COMPARE_KEYS, ACE_LOCK> &))
ACE_UNIMPLEMENTED_FUNC (ACE_Hash_Map_Manager_Ex (const ACE_Hash_Map_Manager_Ex<EXT_ID, INT_ID, HASH_KEY, COMPARE_KEYS, ACE_LOCK> &))
};
/**
* @class ACE_Hash_Map_Iterator_Base_Ex
*
* @brief Base iterator for the <ACE_Hash_Map_Manager_Ex>
*
* This class factors out common code from its templatized
* subclasses.
*/
template <class EXT_ID, class INT_ID, class HASH_KEY, class COMPARE_KEYS, class ACE_LOCK>
class ACE_Hash_Map_Iterator_Base_Ex
{
public:
// = Initialization method.
/// Contructor. If head != 0, the iterator constructed is positioned
/// at the head of the map, it is positioned at the end otherwise.
ACE_Hash_Map_Iterator_Base_Ex (ACE_Hash_Map_Manager_Ex<EXT_ID, INT_ID, HASH_KEY, COMPARE_KEYS, ACE_LOCK> &mm,
int head);
// = ITERATION methods.
/// Pass back the next <entry> that hasn't been seen in the Set.
/// Returns 0 when all items have been seen, else 1.
int next (ACE_Hash_Map_Entry<EXT_ID, INT_ID> *&next_entry) const;
/// Returns 1 when all items have been seen, else 0.
int done (void) const;
/// Returns a reference to the interal element <this> is pointing to.
ACE_Hash_Map_Entry<EXT_ID, INT_ID>& operator* (void) const;
/// Returns a pointer to the interal element <this> is pointing to.
ACE_Hash_Map_Entry<EXT_ID, INT_ID>* operator-> (void) const;
/// Returns reference the Hash_Map_Manager_Ex that is being iterated
/// over.
ACE_Hash_Map_Manager_Ex<EXT_ID, INT_ID, HASH_KEY, COMPARE_KEYS, ACE_LOCK>& map (void);
/// Check if two iterators point to the same position
bool operator== (const ACE_Hash_Map_Iterator_Base_Ex<EXT_ID, INT_ID, HASH_KEY, COMPARE_KEYS, ACE_LOCK> &) const;
bool operator!= (const ACE_Hash_Map_Iterator_Base_Ex<EXT_ID, INT_ID, HASH_KEY, COMPARE_KEYS, ACE_LOCK> &) const;
/// Declare the dynamic allocation hooks.
ACE_ALLOC_HOOK_DECLARE;
protected:
/// Move forward by one element in the set. Returns 0 when there's
/// no more item in the set after the current items, else 1.
int forward_i (void);
/// Move backward by one element in the set. Returns 0 when there's
/// no more item in the set before the current item, else 1.
int reverse_i (void);
/// Dump the state of an object.
void dump_i (void) const;
/// Map we are iterating over.
ACE_Hash_Map_Manager_Ex<EXT_ID, INT_ID, HASH_KEY, COMPARE_KEYS, ACE_LOCK> *map_man_;
/// Keeps track of how far we've advanced in the table.
ssize_t index_;
/// Keeps track of how far we've advanced in a linked list in each
/// table slot.
ACE_Hash_Map_Entry<EXT_ID, INT_ID> *next_;
};
/**
* @class ACE_Hash_Map_Const_Iterator_Base_Ex
*
* @brief Base const iterator for the <ACE_Hash_Map_Manager_Ex>
*
* This class factors out common code from its templatized
* subclasses.
*/
template <class EXT_ID, class INT_ID, class HASH_KEY, class COMPARE_KEYS, class ACE_LOCK>
class ACE_Hash_Map_Const_Iterator_Base_Ex
{
public:
// = Initialization method.
/// Contructor. If head != 0, the iterator constructed is positioned
/// at the head of the map, it is positioned at the end otherwise.
ACE_Hash_Map_Const_Iterator_Base_Ex (const ACE_Hash_Map_Manager_Ex<EXT_ID, INT_ID, HASH_KEY, COMPARE_KEYS, ACE_LOCK> &mm,
int head);
// = ITERATION methods.
/// Pass back the next <entry> that hasn't been seen in the Set.
/// Returns 0 when all items have been seen, else 1.
int next (ACE_Hash_Map_Entry<EXT_ID, INT_ID> *&next_entry) const;
/// Returns 1 when all items have been seen, else 0.
int done (void) const;
/// Returns a reference to the interal element <this> is pointing to.
ACE_Hash_Map_Entry<EXT_ID, INT_ID>& operator* (void) const;
/// Returns a pointer to the interal element <this> is pointing to.
ACE_Hash_Map_Entry<EXT_ID, INT_ID>* operator-> (void) const;
/// Returns reference the Hash_Map_Manager_Ex that is being iterated
/// over.
const ACE_Hash_Map_Manager_Ex<EXT_ID, INT_ID, HASH_KEY, COMPARE_KEYS, ACE_LOCK>& map (void);
/// Check if two iterators point to the same position
bool operator== (const ACE_Hash_Map_Const_Iterator_Base_Ex<EXT_ID, INT_ID, HASH_KEY, COMPARE_KEYS, ACE_LOCK> &) const;
bool operator!= (const ACE_Hash_Map_Const_Iterator_Base_Ex<EXT_ID, INT_ID, HASH_KEY, COMPARE_KEYS, ACE_LOCK> &) const;
/// Declare the dynamic allocation hooks.
ACE_ALLOC_HOOK_DECLARE;
protected:
/// Move forward by one element in the set. Returns 0 when there's
/// no more item in the set after the current items, else 1.
int forward_i (void);
/// Move backward by one element in the set. Returns 0 when there's
/// no more item in the set before the current item, else 1.
int reverse_i (void);
/// Dump the state of an object.
void dump_i (void) const;
/// Map we are iterating over.
const ACE_Hash_Map_Manager_Ex<EXT_ID, INT_ID, HASH_KEY, COMPARE_KEYS, ACE_LOCK> *map_man_;
/// Keeps track of how far we've advanced in the table.
ssize_t index_;
/// Keeps track of how far we've advanced in a linked list in each
/// table slot.
ACE_Hash_Map_Entry<EXT_ID, INT_ID> *next_;
};
/**
* @class ACE_Hash_Map_Iterator_Ex
*
* @brief Forward iterator for the <ACE_Hash_Map_Manager_Ex>.
*
* This class does not perform any internal locking of the
* <ACE_Hash_Map_Manager_Ex> it is iterating upon since locking is
* inherently inefficient and/or error-prone within an STL-style
* iterator. If you require locking, you can explicitly use an
* ACE_Guard or ACE_Read_Guard on the <ACE_Hash_Map_Manager_Ex>'s
* internal lock, which is accessible via its <mutex> method.
*/
template <class EXT_ID, class INT_ID, class HASH_KEY, class COMPARE_KEYS, class ACE_LOCK>
class ACE_Hash_Map_Iterator_Ex : public ACE_Hash_Map_Iterator_Base_Ex<EXT_ID, INT_ID, HASH_KEY, COMPARE_KEYS, ACE_LOCK>
{
public:
// = Initialization method.
ACE_Hash_Map_Iterator_Ex (ACE_Hash_Map_Manager_Ex<EXT_ID, INT_ID, HASH_KEY, COMPARE_KEYS, ACE_LOCK> &mm,
int tail = 0);
// = Iteration methods.
/// Move forward by one element in the set. Returns 0 when all the
/// items in the set have been seen, else 1.
int advance (void);
/// Dump the state of an object.
void dump (void) const;
// = STL styled iteration, compare, and reference functions.
/// Prefix advance.
ACE_Hash_Map_Iterator_Ex<EXT_ID, INT_ID, HASH_KEY, COMPARE_KEYS, ACE_LOCK> &operator++ (void);
/// Postfix advance.
ACE_Hash_Map_Iterator_Ex<EXT_ID, INT_ID, HASH_KEY, COMPARE_KEYS, ACE_LOCK> operator++ (int);
/// Prefix reverse.
ACE_Hash_Map_Iterator_Ex<EXT_ID, INT_ID, HASH_KEY, COMPARE_KEYS, ACE_LOCK> &operator-- (void);
/// Postfix reverse.
ACE_Hash_Map_Iterator_Ex<EXT_ID, INT_ID, HASH_KEY, COMPARE_KEYS, ACE_LOCK> operator-- (int);
/// Declare the dynamic allocation hooks.
ACE_ALLOC_HOOK_DECLARE;
};
/**
* @class ACE_Hash_Map_Const_Iterator_Ex
*
* @brief Const forward iterator for the <ACE_Hash_Map_Manager_Ex>.
*
* This class does not perform any internal locking of the
* <ACE_Hash_Map_Manager_Ex> it is iterating upon since locking is
* inherently inefficient and/or error-prone within an STL-style
* iterator. If you require locking, you can explicitly use an
* ACE_Guard or ACE_Read_Guard on the <ACE_Hash_Map_Manager_Ex>'s
* internal lock, which is accessible via its <mutex> method.
*/
template <class EXT_ID, class INT_ID, class HASH_KEY, class COMPARE_KEYS, class ACE_LOCK>
class ACE_Hash_Map_Const_Iterator_Ex : public ACE_Hash_Map_Const_Iterator_Base_Ex<EXT_ID, INT_ID, HASH_KEY, COMPARE_KEYS, ACE_LOCK>
{
public:
// = Initialization method.
ACE_Hash_Map_Const_Iterator_Ex (const ACE_Hash_Map_Manager_Ex<EXT_ID, INT_ID, HASH_KEY, COMPARE_KEYS, ACE_LOCK> &mm,
int tail = 0);
// = Iteration methods.
/// Move forward by one element in the set. Returns 0 when all the
/// items in the set have been seen, else 1.
int advance (void);
/// Dump the state of an object.
void dump (void) const;
// = STL styled iteration, compare, and reference functions.
/// Prefix advance.
ACE_Hash_Map_Const_Iterator_Ex<EXT_ID, INT_ID, HASH_KEY, COMPARE_KEYS, ACE_LOCK> &operator++ (void);
/// Postfix advance.
ACE_Hash_Map_Const_Iterator_Ex<EXT_ID, INT_ID, HASH_KEY, COMPARE_KEYS, ACE_LOCK> operator++ (int);
/// Prefix reverse.
ACE_Hash_Map_Const_Iterator_Ex<EXT_ID, INT_ID, HASH_KEY, COMPARE_KEYS, ACE_LOCK> &operator-- (void);
/// Postfix reverse.
ACE_Hash_Map_Const_Iterator_Ex<EXT_ID, INT_ID, HASH_KEY, COMPARE_KEYS, ACE_LOCK> operator-- (int);
/// Declare the dynamic allocation hooks.
ACE_ALLOC_HOOK_DECLARE;
};
/**
* @class ACE_Hash_Map_Bucket_Iterator
*
* @brief Forward iterator for the <ACE_Hash_Map_Manager_Ex> which
* only traverses a particular bucket. The particular bucket is
* specified by the <EXT_ID> parameter specified in the constructor.
*
* This class does not perform any internal locking of the
* <ACE_Hash_Map_Manager_Ex> it is iterating upon since locking is
* inherently inefficient and/or error-prone within an STL-style
* iterator. If you require locking, you can explicitly use an
* ACE_Guard or ACE_Read_Guard on the <ACE_Hash_Map_Manager_Ex>'s
* internal lock, which is accessible via its <mutex> method.
*
* Note that a creation method for this new iterator cannot be added
* to the hash map, since this would require adding explicit template
* instantiations for bucket iterators on platforms with broken
* templates.
*/
template <class EXT_ID, class INT_ID, class HASH_KEY, class COMPARE_KEYS, class ACE_LOCK>
class ACE_Hash_Map_Bucket_Iterator
{
public:
// = Initialization method.
ACE_Hash_Map_Bucket_Iterator (ACE_Hash_Map_Manager_Ex<EXT_ID, INT_ID, HASH_KEY, COMPARE_KEYS, ACE_LOCK> &mm,
const EXT_ID &ext_id,
int tail = 0);
// = STL styled iteration, compare, and reference functions.
/// Prefix advance.
ACE_Hash_Map_Bucket_Iterator<EXT_ID, INT_ID, HASH_KEY, COMPARE_KEYS, ACE_LOCK> &operator++ (void);
/// Postfix advance.
ACE_Hash_Map_Bucket_Iterator<EXT_ID, INT_ID, HASH_KEY, COMPARE_KEYS, ACE_LOCK> operator++ (int);
/// Prefix reverse.
ACE_Hash_Map_Bucket_Iterator<EXT_ID, INT_ID, HASH_KEY, COMPARE_KEYS, ACE_LOCK> &operator-- (void);
/// Postfix reverse.
ACE_Hash_Map_Bucket_Iterator<EXT_ID, INT_ID, HASH_KEY, COMPARE_KEYS, ACE_LOCK> operator-- (int);
/// Returns a reference to the interal element <this> is pointing to.
ACE_Hash_Map_Entry<EXT_ID, INT_ID>& operator* (void) const;
/// Returns a pointer to the interal element <this> is pointing to.
ACE_Hash_Map_Entry<EXT_ID, INT_ID>* operator-> (void) const;
/// Returns reference the Hash_Map_Manager_Ex that is being iterated
/// over.
ACE_Hash_Map_Manager_Ex<EXT_ID, INT_ID, HASH_KEY, COMPARE_KEYS, ACE_LOCK>& map (void);
/// Check if two iterators point to the same position
bool operator== (const ACE_Hash_Map_Bucket_Iterator<EXT_ID, INT_ID, HASH_KEY, COMPARE_KEYS, ACE_LOCK> &) const;
bool operator!= (const ACE_Hash_Map_Bucket_Iterator<EXT_ID, INT_ID, HASH_KEY, COMPARE_KEYS, ACE_LOCK> &) const;
protected:
/// Move forward by one element in the set. Returns 0 when there's
/// no more item in the set after the current items, else 1.
int forward_i (void);
/// Move backward by one element in the set. Returns 0 when there's
/// no more item in the set before the current item, else 1.
int reverse_i (void);
/// Map we are iterating over.
ACE_Hash_Map_Manager_Ex<EXT_ID, INT_ID, HASH_KEY, COMPARE_KEYS, ACE_LOCK> *map_man_;
/// Keeps track of how far we've advanced in the table.
ssize_t index_;
/// Keeps track of how far we've advanced in a linked list in each
/// table slot.
ACE_Hash_Map_Entry<EXT_ID, INT_ID> *next_;
};
/**
* @class ACE_Hash_Map_Reverse_Iterator_Ex
*
* @brief Reverse iterator for the <ACE_Hash_Map_Manager_Ex>.
*
* This class does not perform any internal locking of the
* <ACE_Hash_Map_Manager_Ex> it is iterating upon since locking is
* inherently inefficient and/or error-prone within an STL-style
* iterator. If you require locking, you can explicitly use an
* ACE_Guard or ACE_Read_Guard on the <ACE_Hash_Map_Manager_Ex>'s
* internal lock, which is accessible via its <mutex> method.
*/
template <class EXT_ID, class INT_ID, class HASH_KEY, class COMPARE_KEYS, class ACE_LOCK>
class ACE_Hash_Map_Reverse_Iterator_Ex : public ACE_Hash_Map_Iterator_Base_Ex<EXT_ID, INT_ID, HASH_KEY, COMPARE_KEYS, ACE_LOCK>
{
public:
// = Initialization method.
ACE_Hash_Map_Reverse_Iterator_Ex (ACE_Hash_Map_Manager_Ex<EXT_ID, INT_ID, HASH_KEY, COMPARE_KEYS, ACE_LOCK> &mm,
int head = 0);
// = Iteration methods.
/// Move forward by one element in the set. Returns 0 when all the
/// items in the set have been seen, else 1.
int advance (void);
/// Dump the state of an object.
void dump (void) const;
// = STL styled iteration, compare, and reference functions.
/// Prefix reverse.
ACE_Hash_Map_Reverse_Iterator_Ex<EXT_ID, INT_ID, HASH_KEY, COMPARE_KEYS, ACE_LOCK> &operator++ (void);
/// Postfix reverse.
ACE_Hash_Map_Reverse_Iterator_Ex<EXT_ID, INT_ID, HASH_KEY, COMPARE_KEYS, ACE_LOCK> operator++ (int);
/// Prefix advance.
ACE_Hash_Map_Reverse_Iterator_Ex<EXT_ID, INT_ID, HASH_KEY, COMPARE_KEYS, ACE_LOCK> &operator-- (void);
/// Postfix advance.
ACE_Hash_Map_Reverse_Iterator_Ex<EXT_ID, INT_ID, HASH_KEY, COMPARE_KEYS, ACE_LOCK> operator-- (int);
/// Declare the dynamic allocation hooks.
ACE_ALLOC_HOOK_DECLARE;
};
/**
* @class ACE_Hash_Map_Manager
*
* @brief Wrapper for backward compatibility.
*
* This implementation of a map uses a hash table. This class
* expects that the <EXT_ID> contains a method called <hash>.
* In addition, the <EXT_ID> must support <operator==>. Both of
* these constraints can be alleviated via template
* specialization, as shown in the $ACE_ROOT/tests/Conn_Test.cpp
* test.
*
* <b> Requirements and Performance Characteristics</b>
* - Internal Structure
* Hash Table
* - Duplicates allowed?
* No
* - Random access allowed?
* Yes
* - Search speed
* O(1)
* - Insert/replace speed
* O(1), can be longer if the hash map has to resize
* - Iterator still valid after change to container?
* Yes
* - Frees memory for removed elements?
* Yes
* - Items inserted by
* Value
* - Requirements for key type
* -# Default constructor
* -# Copy constructor
* -# operator=
* -# operator==
* - Requirements for object type
* -# Default constructor
* -# Copy constructor
* -# operator=
* -# operator<
*/
template <class EXT_ID, class INT_ID, class ACE_LOCK>
class ACE_Hash_Map_Manager : public ACE_Hash_Map_Manager_Ex<EXT_ID, INT_ID, ACE_Hash<EXT_ID>, ACE_Equal_To<EXT_ID>, ACE_LOCK>
{
public:
/**
* Initialize a @c Hash_Map_Manager with default size elements.
* @param table_alloc is a pointer to a memory allocator used for
* table_, so it should supply size*sizeof (ACE_Hash_Map_Entry<EXT_ID, INT_ID>).
* @param entry_alloc is a pointer to an additional allocator for
* entries, so it should be able to allocate 'size' / chunks
* of sizeof(ACE_Hash_Map_Entry<EXT_ID, INT_ID>) bytes each.
* If @c table_alloc is 0 it defaults to @c ACE_Allocator::instance().
* If @c entry_alloc is 0 then it defaults to the same allocator as
* @c table_alloc.
*/
ACE_Hash_Map_Manager (ACE_Allocator *table_alloc = 0,
ACE_Allocator *entry_alloc = 0);
/**
* Initialize a @c Hash_Map_Manager with @c size elements.
* @param table_alloc is a pointer to a memory allocator used for
* table_, so it should supply size*sizeof (ACE_Hash_Map_Entry<EXT_ID, INT_ID>).
* @param entry_alloc is a pointer to an additional allocator for
* entries, so it should be able to allocate 'size' / chunks
* of sizeof(ACE_Hash_Map_Entry<EXT_ID, INT_ID>) bytes each.
* If @c table_alloc is 0 it defaults to @c ACE_Allocator::instance().
* If @c entry_alloc is 0 then it defaults to the same allocator as
* @c table_alloc.
*/
ACE_Hash_Map_Manager (size_t size,
ACE_Allocator *table_alloc = 0,
ACE_Allocator *entry_alloc = 0);
// = The following two are necessary for template specialization of
// ACE_Hash_Map_Manager to work.
int equal (const EXT_ID &id1, const EXT_ID &id2);
u_long hash (const EXT_ID &ext_id);
};
/**
* @class ACE_Hash_Map_Iterator
*
* @brief Wrapper for backward compatibility.
*/
template <class EXT_ID, class INT_ID, class ACE_LOCK>
class ACE_Hash_Map_Iterator : public ACE_Hash_Map_Iterator_Ex<EXT_ID, INT_ID, ACE_Hash<EXT_ID>, ACE_Equal_To<EXT_ID>, ACE_LOCK>
{
public:
// = Initialization method.
/// Construct from map
ACE_Hash_Map_Iterator (ACE_Hash_Map_Manager<EXT_ID, INT_ID, ACE_LOCK> &mm,
int tail = 0);
/// Construct from base
ACE_Hash_Map_Iterator (const ACE_Hash_Map_Iterator_Ex<EXT_ID, INT_ID, ACE_Hash<EXT_ID>, ACE_Equal_To<EXT_ID>, ACE_LOCK> &base);
/// Assignment from base
ACE_Hash_Map_Iterator<EXT_ID, INT_ID, ACE_LOCK> &
operator= (const ACE_Hash_Map_Iterator_Ex<EXT_ID, INT_ID, ACE_Hash<EXT_ID>, ACE_Equal_To<EXT_ID>, ACE_LOCK> &base);
};
/**
* @class ACE_Hash_Map_Const_Iterator
*
* @brief Wrapper for backward compatibility.
*/
template <class EXT_ID, class INT_ID, class ACE_LOCK>
class ACE_Hash_Map_Const_Iterator : public ACE_Hash_Map_Const_Iterator_Ex<EXT_ID, INT_ID, ACE_Hash<EXT_ID>, ACE_Equal_To<EXT_ID>, ACE_LOCK>
{
public:
// = Initialization method.
/// Construct from map
ACE_Hash_Map_Const_Iterator (const ACE_Hash_Map_Manager<EXT_ID, INT_ID, ACE_LOCK> &mm,
int tail = 0);
/// Construct from base
ACE_Hash_Map_Const_Iterator (const ACE_Hash_Map_Const_Iterator_Ex<EXT_ID, INT_ID, ACE_Hash<EXT_ID>, ACE_Equal_To<EXT_ID>, ACE_LOCK> &base);
/// Assignment from base
ACE_Hash_Map_Const_Iterator<EXT_ID, INT_ID, ACE_LOCK> &
operator= (const ACE_Hash_Map_Const_Iterator_Ex<EXT_ID, INT_ID, ACE_Hash<EXT_ID>, ACE_Equal_To<EXT_ID>, ACE_LOCK> &base);
};
/**
* @class ACE_Hash_Map_Reverse_Iterator
*
* @brief Wrapper for backward compatibility.
*/
template <class EXT_ID, class INT_ID, class ACE_LOCK>
class ACE_Hash_Map_Reverse_Iterator : public ACE_Hash_Map_Reverse_Iterator_Ex<EXT_ID, INT_ID, ACE_Hash<EXT_ID>, ACE_Equal_To<EXT_ID>, ACE_LOCK>
{
public:
// = Initialization method.
ACE_Hash_Map_Reverse_Iterator (ACE_Hash_Map_Manager<EXT_ID, INT_ID, ACE_LOCK> &mm,
int head = 0);
/// Construct from base
ACE_Hash_Map_Reverse_Iterator (const ACE_Hash_Map_Reverse_Iterator_Ex<EXT_ID, INT_ID, ACE_Hash<EXT_ID>, ACE_Equal_To<EXT_ID>, ACE_LOCK> &base);
/// Assignment from base
ACE_Hash_Map_Reverse_Iterator<EXT_ID, INT_ID, ACE_LOCK> &
operator= (const ACE_Hash_Map_Reverse_Iterator_Ex<EXT_ID, INT_ID, ACE_Hash<EXT_ID>, ACE_Equal_To<EXT_ID>, ACE_LOCK> &base);
};
ACE_END_VERSIONED_NAMESPACE_DECL
#if defined (__ACE_INLINE__)
# include "ace/Hash_Map_Manager_T.inl"
#endif /* __ACE_INLINE__ */
#if defined (ACE_TEMPLATES_REQUIRE_SOURCE)
#include "ace/Hash_Map_Manager_T.cpp"
#endif /* ACE_TEMPLATES_REQUIRE_SOURCE */
#if defined (ACE_TEMPLATES_REQUIRE_PRAGMA)
#pragma implementation ("Hash_Map_Manager_T.cpp")
#endif /* ACE_TEMPLATES_REQUIRE_PRAGMA */
#include /**/ "ace/post.h"
#endif /* ACE_HASH_MAP_MANAGER_T_H */
|