19 #if !defined(XALANMAP_HEADER_GUARD_1357924680)
20 #define XALANMAP_HEADER_GUARD_1357924680
39 XALAN_CPP_NAMESPACE_BEGIN
43 #pragma warning(disable: 4189)
49 class XalanHasher :
public XALAN_STD_QUALIFIER unary_function<Key, size_type>
54 const char *byteArray =
reinterpret_cast<const char*
>(&key);
58 for (
size_type i = 0; i <
sizeof(Key); ++i)
60 result = (result << 1) ^ byteArray[i];
98 template <
class Value>
106 template <
class Value>
114 template <
class XalanMapTraits,
class BaseIterator>
119 typedef typename XalanMapTraits::pointer
pointer;
168 return !(theRhs == *
this);
201 typedef XALAN_STD_QUALIFIER pair<const key_type, data_type>
value_type;
243 MemoryManager& theMemoryManager,
244 double loadFactor = 0.75,
261 MemoryManager& theMemoryManager) :
275 const_iterator entry = theRhs.
begin();
277 while(entry != theRhs.
end())
345 const_iterator
end()
const
350 iterator
find(
const key_type& key)
356 const size_type index =
doHash(key);
360 BucketIterator pos = bucket.
begin();
362 while (pos != bucket.end())
364 if (!(*pos)->erased &&
m_equals(key, (*pos)->value->first))
375 const_iterator
find(
const key_type& key)
const
382 iterator pos =
find(key);
389 return (*pos).second;
395 insert(value.first, value.second);
398 void insert(
const key_type& key,
const data_type& data)
400 const const_iterator pos =
find(key);
416 size_type
erase(
const key_type& key)
418 const iterator pos =
find(key);
452 const size_type tempSize =
m_size;
492 const size_type index =
doHash(key);
501 newEntry.erased =
false;
503 FirstConstructor::construct(
504 const_cast<key_type*>(&newEntry.value->first),
510 SecondConstructor::construct(
511 &newEntry.value->second,
517 SecondConstructor::construct(
518 &newEntry.value->second,
533 value_type& toRemove = *toRemovePos;
534 #if defined(_MSC_VER) && _MSC_VER <= 1300
535 toRemove.value_type::~value_type();
537 toRemove.~value_type();
561 assert(pos !=
end());
578 size_type modulus)
const
580 assert(modulus != 0);
582 return m_hash(key) % modulus;
594 assert(theNewSize != 0);
596 BucketTableType temp(
606 const size_type index =
608 entryPos->value->first,
624 const size_type theBytesNeeded = size *
sizeof(
value_type);
630 assert(pointer != 0);
632 return reinterpret_cast<value_type*
>(pointer);
645 size_type theCurrentSize,
646 size_type theExtraCapacity)
648 assert(theExtraCapacity > theCurrentSize);
655 return theCurrentSize == 0 ?
667 BucketType& theCurrentBucket = *i;
669 BucketIterator j = theCurrentBucket.
begin();
671 while(j != theCurrentBucket.
end())
673 if ((*j)->erased ==
true)
675 j = theCurrentBucket.
erase(j);
686 const size_type theCurrentSize =
687 theCurrentBucket.
size();
689 const size_type theExtraCapacity =
690 theCurrentBucket.
capacity() - theCurrentSize;
692 if (theExtraCapacity > theCurrentSize)
694 const size_type theNewCapacity =
702 BucketType theTempBucket(
707 theCurrentBucket.
swap(theTempBucket);
745 #if defined(_MSC_VER)
751 XALAN_CPP_NAMESPACE_END
755 #endif // XALANMAP_HEADER_GUARD_1357924680
size_type m_eraseThreshold
reference operator*() const
size_type operator()(const Key *key) const
XalanMap & operator=(const XalanMap &theRhs)
const_iterator find(const key_type &key) const
ptrdiff_t difference_type
iterator doCreateEntry(const key_type &key, const data_type *data=0)
void doErase(iterator pos)
XalanMapTraits::pointer pointer
XalanMap(const XalanMap &theRhs, MemoryManager &theMemoryManager)
pointer operator->() const
BucketTableType m_buckets
XalanMapTraits::value_type value_type
size_type doHash(const Key &key) const
XalanMapIterator(const Iterator &theRhs)
size_type erase(const key_type &key)
static size_type calculateNewBucketCapacity(size_type theCurrentSize, size_type theExtraCapacity)
data_type & operator[](const key_type &key)
const_iterator begin() const
MemoryManager * m_memoryManager
size_type capacity() const
XalanMapIterator< XalanMapIteratorTraits< value_type >, typename EntryListType::iterator > iterator
BucketTableType::iterator TableIterator
size_type operator()(const Key &key) const
void doRemoveEntry(const iterator &toRemovePos)
XalanList< Entry > EntryListType
value_type * allocate(size_type size)
iterator find(const key_type &key)
void push_back(const value_type &data)
XalanHasher< Key > Hasher
XalanMapIterator & operator++()
void splice(iterator pos, ThisType &list, iterator toInsert)
XalanMapIterator operator++(int)
void insert(iterator thePosition, const_iterator theFirst, const_iterator theLast)
XalanVector< typename EntryListType::iterator > BucketType
size_type operator()(const Key &key) const
XalanMapTraits::reference reference
const size_type m_minBuckets
KeyConstructionTraits::Constructor FirstConstructor
BaseIterator baseIterator
XALAN_CPP_NAMESPACE_BEGIN typedef size_t size_type
ValueConstructionTraits::Constructor SecondConstructor
EntryListType m_freeEntries
bool operator!=(const XalanMapIterator &theRhs) const
void insert(const value_type &value)
void deallocate(value_type *pointer)
iterator erase(iterator theFirst, iterator theLast)
bool operator==(const XalanMapIterator &theRhs) const
void push_back(const value_type &data)
XalanMapIterator< XalanMapIteratorTraits< value_type >, BaseIterator > Iterator
void swap(ThisType &theRHS)
void swap(XalanMap &theRhs)
void insert(const key_type &key, const data_type &data)
XALAN_STD_QUALIFIER equal_to< Key > Comparator
XalanMapIterator< XalanMapConstIteratorTraits< value_type >, typename EntryListType::iterator > const_iterator
void swap(ThisType &theOther)
Key key_type
Each map entry is stored in a linked list where an entry consists of a pointer to the key/value pair ...
size_type doHash(const Key &key, size_type modulus) const
BucketType::iterator BucketIterator
XALAN_STD_QUALIFIER pair< const key_type, data_type > value_type
const_iterator end() const
KeyTraits::Comparator m_equals
Xalan implementation of a hashtable.
MemoryManager & getMemoryManager()
XalanMapIterator(const BaseIterator &theRhs)
XALAN_STD_QUALIFIER bidirectional_iterator_tag iterator_category
XalanVector< BucketType, ConstructWithMemoryManagerTraits< BucketType > > BucketTableType
EntryListType::iterator EntryListIterator
Entry(value_type *theValue)
XalanMap(MemoryManager &theMemoryManager, double loadFactor=0.75, size_type minBuckets=eDefaultMinBuckets, size_type eraseThreshold=eDefaultEraseThreshold)