124 lines
4.8 KiB
C++
124 lines
4.8 KiB
C++
// This code contains NVIDIA Confidential Information and is disclosed to you
|
|
// under a form of NVIDIA software license agreement provided separately to you.
|
|
//
|
|
// Notice
|
|
// NVIDIA Corporation and its licensors retain all intellectual property and
|
|
// proprietary rights in and to this software and related documentation and
|
|
// any modifications thereto. Any use, reproduction, disclosure, or
|
|
// distribution of this software and related documentation without an express
|
|
// license agreement from NVIDIA Corporation is strictly prohibited.
|
|
//
|
|
// ALL NVIDIA DESIGN SPECIFICATIONS, CODE ARE PROVIDED "AS IS.". NVIDIA MAKES
|
|
// NO WARRANTIES, EXPRESSED, IMPLIED, STATUTORY, OR OTHERWISE WITH RESPECT TO
|
|
// THE MATERIALS, AND EXPRESSLY DISCLAIMS ALL IMPLIED WARRANTIES OF NONINFRINGEMENT,
|
|
// MERCHANTABILITY, AND FITNESS FOR A PARTICULAR PURPOSE.
|
|
//
|
|
// Information and code furnished is believed to be accurate and reliable.
|
|
// However, NVIDIA Corporation assumes no responsibility for the consequences of use of such
|
|
// information or for any infringement of patents or other rights of third parties that may
|
|
// result from its use. No license is granted by implication or otherwise under any patent
|
|
// or patent rights of NVIDIA Corporation. Details are subject to change without notice.
|
|
// This code supersedes and replaces all information previously supplied.
|
|
// NVIDIA Corporation products are not authorized for use as critical
|
|
// components in life support devices or systems without express written approval of
|
|
// NVIDIA Corporation.
|
|
//
|
|
// Copyright (c) 2008-2020 NVIDIA Corporation. All rights reserved.
|
|
// Copyright (c) 2004-2008 AGEIA Technologies, Inc. All rights reserved.
|
|
// Copyright (c) 2001-2004 NovodeX AG. All rights reserved.
|
|
|
|
#ifndef PSFOUNDATION_PSHASHMAP_H
|
|
#define PSFOUNDATION_PSHASHMAP_H
|
|
|
|
#include "PsHashInternals.h"
|
|
|
|
// TODO: make this doxy-format
|
|
//
|
|
// This header defines two hash maps. Hash maps
|
|
// * support custom initial table sizes (rounded up internally to power-of-2)
|
|
// * support custom static allocator objects
|
|
// * auto-resize, based on a load factor (i.e. a 64-entry .75 load factor hash will resize
|
|
// when the 49th element is inserted)
|
|
// * are based on open hashing
|
|
// * have O(1) contains, erase
|
|
//
|
|
// Maps have STL-like copying semantics, and properly initialize and destruct copies of objects
|
|
//
|
|
// There are two forms of map: coalesced and uncoalesced. Coalesced maps keep the entries in the
|
|
// initial segment of an array, so are fast to iterate over; however deletion is approximately
|
|
// twice as expensive.
|
|
//
|
|
// HashMap<T>:
|
|
// bool insert(const Key& k, const Value& v) O(1) amortized (exponential resize policy)
|
|
// Value & operator[](const Key& k) O(1) for existing objects, else O(1) amortized
|
|
// const Entry * find(const Key& k); O(1)
|
|
// bool erase(const T& k); O(1)
|
|
// uint32_t size(); constant
|
|
// void reserve(uint32_t size); O(MAX(currentOccupancy,size))
|
|
// void clear(); O(currentOccupancy) (with zero constant for objects
|
|
// without
|
|
// destructors)
|
|
// Iterator getIterator();
|
|
//
|
|
// operator[] creates an entry if one does not exist, initializing with the default constructor.
|
|
// CoalescedHashMap<T> does not support getIterator, but instead supports
|
|
// const Key *getEntries();
|
|
//
|
|
// Use of iterators:
|
|
//
|
|
// for(HashMap::Iterator iter = test.getIterator(); !iter.done(); ++iter)
|
|
// myFunction(iter->first, iter->second);
|
|
|
|
/** \brief NVidia namespace */
|
|
namespace nv
|
|
{
|
|
/** \brief nvcloth namespace */
|
|
namespace cloth
|
|
{
|
|
namespace ps
|
|
{
|
|
template <class Key, class Value, class HashFn = Hash<Key>, class Allocator = NonTrackingAllocator>
|
|
class HashMap : public internal::HashMapBase<Key, Value, HashFn, Allocator>
|
|
{
|
|
public:
|
|
typedef internal::HashMapBase<Key, Value, HashFn, Allocator> HashMapBase;
|
|
typedef typename HashMapBase::Iterator Iterator;
|
|
|
|
HashMap(uint32_t initialTableSize = 64, float loadFactor = 0.75f) : HashMapBase(initialTableSize, loadFactor)
|
|
{
|
|
}
|
|
HashMap(uint32_t initialTableSize, float loadFactor, const Allocator& alloc)
|
|
: HashMapBase(initialTableSize, loadFactor, alloc)
|
|
{
|
|
}
|
|
HashMap(const Allocator& alloc) : HashMapBase(64, 0.75f, alloc)
|
|
{
|
|
}
|
|
Iterator getIterator()
|
|
{
|
|
return Iterator(HashMapBase::mBase);
|
|
}
|
|
};
|
|
|
|
template <class Key, class Value, class HashFn = Hash<Key>, class Allocator = NonTrackingAllocator>
|
|
class CoalescedHashMap : public internal::HashMapBase<Key, Value, HashFn, Allocator>
|
|
{
|
|
public:
|
|
typedef internal::HashMapBase<Key, Value, HashFn, Allocator> HashMapBase;
|
|
|
|
CoalescedHashMap(uint32_t initialTableSize = 64, float loadFactor = 0.75f)
|
|
: HashMapBase(initialTableSize, loadFactor)
|
|
{
|
|
}
|
|
const Pair<const Key, Value>* getEntries() const
|
|
{
|
|
return HashMapBase::mBase.getEntries();
|
|
}
|
|
};
|
|
|
|
} // namespace ps
|
|
} // namespace cloth
|
|
} // namespace nv
|
|
|
|
#endif // #ifndef PSFOUNDATION_PSHASHMAP_H
|