diff options
Diffstat (limited to 'apps/JAWS/PROTOTYPE/JAWS/Hash_Bucket_T.h')
| -rw-r--r-- | apps/JAWS/PROTOTYPE/JAWS/Hash_Bucket_T.h | 86 |
1 files changed, 43 insertions, 43 deletions
diff --git a/apps/JAWS/PROTOTYPE/JAWS/Hash_Bucket_T.h b/apps/JAWS/PROTOTYPE/JAWS/Hash_Bucket_T.h index 9a394a2b42d..d12c11db2e4 100644 --- a/apps/JAWS/PROTOTYPE/JAWS/Hash_Bucket_T.h +++ b/apps/JAWS/PROTOTYPE/JAWS/Hash_Bucket_T.h @@ -2,15 +2,15 @@ // Hey Emacs! This is a C++ file! // $Id$ -#ifndef JAWS_HASH_BUCKET_T_H -#define JAWS_HASH_BUCKET_T_H +#ifndef ACE_HASH_BUCKET_T_H +#define ACE_HASH_BUCKET_T_H #include "ace/Containers.h" -#define JAWS_HASH_BUCKET_ITEM JAWS_Hash_Bucket_Item<EXT_ID, INT_ID> -#define JAWS_HASH_BUCKET_DLCSTACK JAWS_Hash_Bucket_DLCStack<EXT_ID, INT_ID> -#define JAWS_HASH_BUCKET_DLCSTACK_ITERATOR \ - JAWS_Hash_Bucket_DLCStack_Iterator<EXT_ID, INT_ID> +#define ACE_HASH_BUCKET_ITEM ACE_Hash_Bucket_Item<EXT_ID, INT_ID> +#define ACE_HASH_BUCKET_DLCSTACK ACE_Hash_Bucket_DLCStack<EXT_ID, INT_ID> +#define ACE_HASH_BUCKET_DLCSTACK_ITERATOR \ + ACE_Hash_Bucket_DLCStack_Iterator<EXT_ID, INT_ID> // Why Hash_Bucket? @@ -22,16 +22,16 @@ // exclusion. template <class EXT_ID, class INT_ID> -class JAWS_Hash_Bucket_Item +class ACE_Hash_Bucket_Item { public: - JAWS_Hash_Bucket_Item (const EXT_ID &ext_id, const INT_ID &int_id, - JAWS_Hash_Bucket_Item<EXT_ID, INT_ID> *next = 0, - JAWS_Hash_Bucket_Item<EXT_ID, INT_ID> *prev = 0); - JAWS_Hash_Bucket_Item (JAWS_Hash_Bucket_Item<EXT_ID, INT_ID> *next = 0, - JAWS_Hash_Bucket_Item<EXT_ID, INT_ID> *prev = 0); + ACE_Hash_Bucket_Item (const EXT_ID &ext_id, const INT_ID &int_id, + ACE_Hash_Bucket_Item<EXT_ID, INT_ID> *next = 0, + ACE_Hash_Bucket_Item<EXT_ID, INT_ID> *prev = 0); + ACE_Hash_Bucket_Item (ACE_Hash_Bucket_Item<EXT_ID, INT_ID> *next = 0, + ACE_Hash_Bucket_Item<EXT_ID, INT_ID> *prev = 0); - ~JAWS_Hash_Bucket_Item (void); + ~ACE_Hash_Bucket_Item (void); // Destructor. EXT_ID ext_id_; @@ -40,51 +40,51 @@ public: INT_ID int_id_; // The contents of the entry itself. - JAWS_Hash_Bucket_Item<EXT_ID, INT_ID> *next_; + ACE_Hash_Bucket_Item<EXT_ID, INT_ID> *next_; // Pointer to the next item in the bucket of overflow nodes. - JAWS_Hash_Bucket_Item<EXT_ID, INT_ID> *prev_; + ACE_Hash_Bucket_Item<EXT_ID, INT_ID> *prev_; // Pointer to the prev item in the bucket of overflow nodes. }; -template <class EXT_ID, class INT_ID> class JAWS_Hash_Bucket_DLCStack_Iterator; +template <class EXT_ID, class INT_ID> class ACE_Hash_Bucket_DLCStack_Iterator; template <class EXT_ID, class INT_ID, class EQ_FUNC> -class JAWS_Hash_Bucket_Manager; +class ACE_Hash_Bucket_Manager; template <class EXT_ID, class INT_ID> -class JAWS_Hash_Bucket_DLCStack +class ACE_Hash_Bucket_DLCStack // Create a doubly linked circular stack to be managed by the // Hash_Bucket_Manager { - friend JAWS_Hash_Bucket_DLCStack_Iterator<EXT_ID, INT_ID>; + friend ACE_Hash_Bucket_DLCStack_Iterator<EXT_ID, INT_ID>; public: - JAWS_Hash_Bucket_DLCStack (ACE_Allocator *alloc = 0); - ~JAWS_Hash_Bucket_DLCStack (void); + ACE_Hash_Bucket_DLCStack (ACE_Allocator *alloc = 0); + ~ACE_Hash_Bucket_DLCStack (void); int is_empty (void) const; // Returns 1 if the container is empty, otherwise returns 0. - JAWS_Hash_Bucket_Item<EXT_ID, INT_ID> *push (const EXT_ID &ext_id, + ACE_Hash_Bucket_Item<EXT_ID, INT_ID> *push (const EXT_ID &ext_id, const INT_ID &int_id); // Adds <new_item> to the head of the list. // Returns the new item that was inserted. - JAWS_Hash_Bucket_Item<EXT_ID, INT_ID> *pop (void); + ACE_Hash_Bucket_Item<EXT_ID, INT_ID> *pop (void); // Removes and returns the first <item> in the list. Returns // internal node's address on success, 0 if the queue was empty. // This method will *not* free the internal node. void reset (void); - // Reset the <JAWS_Hash_Bucket_DLCStack> to be empty. + // Reset the <ACE_Hash_Bucket_DLCStack> to be empty. // Notice that since no one is interested in the items within, // This operation will delete all items. - int remove (JAWS_Hash_Bucket_Item<EXT_ID, INT_ID> *item); + int remove (ACE_Hash_Bucket_Item<EXT_ID, INT_ID> *item); // If item is still part of the CStack, it is removed. // In anycase, if there is no error, item is freed. // Returns 0 if ok, -1 on error. @@ -93,18 +93,18 @@ public: private: - JAWS_Hash_Bucket_Item<EXT_ID, INT_ID> *head_; - JAWS_Hash_Bucket_Item<EXT_ID, INT_ID> *tail_; + ACE_Hash_Bucket_Item<EXT_ID, INT_ID> *head_; + ACE_Hash_Bucket_Item<EXT_ID, INT_ID> *tail_; }; template <class EXT_ID, class INT_ID> -class JAWS_Hash_Bucket_DLCStack_Iterator +class ACE_Hash_Bucket_DLCStack_Iterator { public: - JAWS_Hash_Bucket_DLCStack_Iterator (const JAWS_HASH_BUCKET_DLCSTACK &dlcstack); + ACE_Hash_Bucket_DLCStack_Iterator (const ACE_HASH_BUCKET_DLCSTACK &dlcstack); int first (void); // Moves to first element in the set, clears done flag. Returns 0 @@ -124,12 +124,12 @@ public: // end up being the last element in the set, 1 otherwise. If revert // takes us to the last element, done is set to true. - int next (JAWS_HASH_BUCKET_ITEM *&item); - int next (JAWS_HASH_BUCKET_ITEM *&item) const; + int next (ACE_HASH_BUCKET_ITEM *&item); + int next (ACE_HASH_BUCKET_ITEM *&item) const; // Pass back the next item. Returns 0 if done is true, 1 otherwise. - int prev (JAWS_HASH_BUCKET_ITEM *&item); - int prev (JAWS_HASH_BUCKET_ITEM *&item) const; + int prev (ACE_HASH_BUCKET_ITEM *&item); + int prev (ACE_HASH_BUCKET_ITEM *&item) const; // Pass back the previous item. Returns 0 if done is true, 1 // otherwise. @@ -139,21 +139,21 @@ public: // element. private: - const JAWS_HASH_BUCKET_DLCSTACK &dlcstack_; - JAWS_HASH_BUCKET_ITEM *next_; - JAWS_HASH_BUCKET_ITEM *prev_; + const ACE_HASH_BUCKET_DLCSTACK &dlcstack_; + ACE_HASH_BUCKET_ITEM *next_; + ACE_HASH_BUCKET_ITEM *prev_; int done_; }; template <class EXT_ID, class INT_ID, class EQ_FUNC> -class JAWS_Hash_Bucket_Manager +class ACE_Hash_Bucket_Manager { public: - JAWS_Hash_Bucket_Manager (ACE_Allocator *alloc = 0); + ACE_Hash_Bucket_Manager (ACE_Allocator *alloc = 0); int open (ACE_Allocator *alloc = 0); - ~JAWS_Hash_Bucket_Manager (void); + ~ACE_Hash_Bucket_Manager (void); int close (void); int find (const EXT_ID &ext_id) const; @@ -175,7 +175,7 @@ public: // 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 <JAWS_Hash_Map_Entrys> and you also need full + // 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. @@ -188,13 +188,13 @@ public: protected: - JAWS_Hash_Bucket_Item<EXT_ID, INT_ID> *find_i (const EXT_ID &ext_id) const; + ACE_Hash_Bucket_Item<EXT_ID, INT_ID> *find_i (const EXT_ID &ext_id) const; // Returns the item associated with ext_id if found in list. // Returns NULL if not found. private: - JAWS_Hash_Bucket_DLCStack<EXT_ID, INT_ID> dlcstack_; + ACE_Hash_Bucket_DLCStack<EXT_ID, INT_ID> dlcstack_; }; @@ -203,4 +203,4 @@ private: #include "JAWS/Hash_Bucket_T.cpp" #endif /* ACE_TEMPLATES_REQUIRE_SOURCE */ -#endif /* JAWS_HASH_BUCKET_T_H */ +#endif /* ACE_HASH_BUCKET_T_H */ |