Files
2023-07-03 09:51:42 +02:00

156 lines
3.6 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.
#pragma once
#include "NvCloth/Callbacks.h"
namespace nv
{
namespace cloth
{
template <class T>
struct Range
{
/** \brief Construct an empty range.
*/
Range();
/** \brief Construct a range (array like container) using existing memory.
Range doesn't take ownership of this memory.
Interface works similar to std::vector.
@param begin start of the memory
@param end end of the memory range, point to one element past the last valid element.
*/
Range(T* begin, T* end);
template <typename S>
Range(const Range<S>& other);
uint32_t size() const;
bool empty() const;
void popFront();
void popBack();
T* begin() const;
T* end() const;
T& front() const;
T& back() const;
T& operator[](uint32_t i) const;
private:
T* mBegin;
T* mEnd; // past last element (like std::vector::end())
};
template <typename T>
Range<T>::Range()
: mBegin(0), mEnd(0)
{
}
template <typename T>
Range<T>::Range(T* begin, T* end)
: mBegin(begin), mEnd(end)
{
}
template <typename T>
template <typename S>
Range<T>::Range(const Range<S>& other)
: mBegin(other.begin()), mEnd(other.end())
{
}
template <typename T>
uint32_t Range<T>::size() const
{
return uint32_t(mEnd - mBegin);
}
template <typename T>
bool Range<T>::empty() const
{
return mBegin >= mEnd;
}
template <typename T>
void Range<T>::popFront()
{
NV_CLOTH_ASSERT(mBegin < mEnd);
++mBegin;
}
template <typename T>
void Range<T>::popBack()
{
NV_CLOTH_ASSERT(mBegin < mEnd);
--mEnd;
}
template <typename T>
T* Range<T>::begin() const
{
return mBegin;
}
template <typename T>
T* Range<T>::end() const
{
return mEnd;
}
template <typename T>
T& Range<T>::front() const
{
NV_CLOTH_ASSERT(mBegin < mEnd);
return *mBegin;
}
template <typename T>
T& Range<T>::back() const
{
NV_CLOTH_ASSERT(mBegin < mEnd);
return mEnd[-1];
}
template <typename T>
T& Range<T>::operator[](uint32_t i) const
{
NV_CLOTH_ASSERT(mBegin + i < mEnd);
return mBegin[i];
}
} // namespace cloth
} // namespace nv