-#else // if wxUSE_OLD_HASH_TABLE
-
-class WXDLLIMPEXP_BASE wxHashTable : public wxObject
-{
-public:
- typedef wxNode Node;
- typedef wxNode* compatibility_iterator;
-
- int n;
- int current_position;
- wxNode *current_node;
-
- unsigned int key_type;
- wxList **hash_table;
-
- wxHashTable(int the_key_type = wxKEY_INTEGER,
- int size = wxHASH_SIZE_DEFAULT);
- virtual ~wxHashTable();
-
- // copy ctor and assignment operator
- wxHashTable(const wxHashTable& table) : wxObject()
- { DoCopy(table); }
- wxHashTable& operator=(const wxHashTable& table)
- { Clear(); DoCopy(table); return *this; }
-
- void DoCopy(const wxHashTable& table);
-
- void Destroy();
-
- bool Create(int the_key_type = wxKEY_INTEGER,
- int size = wxHASH_SIZE_DEFAULT);
-
- // Note that there are 2 forms of Put, Get.
- // With a key and a value, the *value* will be checked
- // when a collision is detected. Otherwise, if there are
- // 2 items with a different value but the same key,
- // we'll retrieve the WRONG ONE. So where possible,
- // supply the required value along with the key.
- // In fact, the value-only versions make a key, and still store
- // the value. The use of an explicit key might be required
- // e.g. when combining several values into one key.
- // When doing that, it's highly likely we'll get a collision,
- // e.g. 1 + 2 = 3, 2 + 1 = 3.
-
- // key and value are NOT necessarily the same
- void Put(long key, long value, wxObject *object);
- void Put(long key, const wxChar *value, wxObject *object);
-
- // key and value are the same
- void Put(long value, wxObject *object);
- void Put(const wxChar *value, wxObject *object);
-
- // key and value not the same
- wxObject *Get(long key, long value) const;
- wxObject *Get(long key, const wxChar *value) const;
-
- // key and value are the same
- wxObject *Get(long value) const;
- wxObject *Get(const wxChar *value) const;
-
- // Deletes entry and returns data if found
- wxObject *Delete(long key);
- wxObject *Delete(const wxChar *key);
-
- wxObject *Delete(long key, int value);
- wxObject *Delete(long key, const wxChar *value);
-
- // Construct your own integer key from a string, e.g. in case
- // you need to combine it with something
- long MakeKey(const wxChar *string) const;
-
- // Way of iterating through whole hash table (e.g. to delete everything)
- // Not necessary, of course, if you're only storing pointers to
- // objects maintained separately
-
- void BeginFind();
- Node* Next();
-
- void DeleteContents(bool flag);
- void Clear();
-
- // Returns number of nodes
- size_t GetCount() const { return m_count; }
-
-private:
- size_t m_count; // number of elements in the hashtable
- bool m_deleteContents;
-
- DECLARE_DYNAMIC_CLASS(wxHashTable)
-};
-
-#endif // wxUSE_OLD_HASH_TABLE
-
-#if !wxUSE_OLD_HASH_TABLE
-
projects / wxWidgets.git / blobdiff