1 files changed, 145 insertions, 145 deletions
diff --git a/sdk/common/NvBlastIndexFns.h b/sdk/common/NvBlastIndexFns.h
index b83c84d..98070f4 100644..100755
--- a/sdk/common/NvBlastIndexFns.h
+++ b/sdk/common/NvBlastIndexFns.h
@@ -1,145 +1,145 @@
-// 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-2018 NVIDIA Corporation. All rights reserved.
-
-
-#ifndef NVBLASTINDEXFNS_H
-#define NVBLASTINDEXFNS_H
-
-
-#include "NvBlastTypes.h"
-
-#include <cstring>
-
-
-namespace Nv
-{
-namespace Blast
-{
-
-/**
-Set to invalid index.
-*/
-template<typename T>
-NV_INLINE T invalidIndex()
-{
-	return ~(T)0;
-}
-
-
-/**
-Test for invalid index (max representable integer).
-*/
-template<typename T>
-NV_INLINE bool isInvalidIndex(T index)
-{
-	return index == invalidIndex<T>();
-}
-
-
-/**
-	Create a lookup table for data sorted by a templated index type.
-
-	Note: when using this function with unsigned integer index types invalidIndex<T>() is treated as a value less than zero.
-
-	On input:
-
-		The indices must lie in the interval [indexBase, indexBase+indexRange].
-	
-		indexSource must point to the first index in the data.
-
-		indexCount must be set to the number of indices in the data.
-
-		indexByteStride must be set to the distance, in bytes, between subequent indices.
-
-		lookup must point to a T array of size indexRange+2.
-
-	On return:
-
-		lookup will be filled such that:
-
-			lookup[i] = the position of first data element with index (i + indexBase)
-
-			lookup[indexRange+1] = indexCount
-
-		The last (indexRange+1) element is used so that one may always determine the number of data elements with the given index using:
-
-			count = lookup[i+1] - lookup[i]
-
-		Note, if an index (i + indexBase) is not present in the data then, lookup[i+1] = lookup[i], so the count (above) will correctly be zero.
-		In this case, the actual value of lookup[i] is irrelevant.
-*/
-template<typename T>
-void createIndexStartLookup(T* lookup, T indexBase, T indexRange, T* indexSource, T indexCount, T indexByteStride)
-{
-	++indexBase;	// Ordering invalidIndex<T>() as lowest value
-	T indexPos = 0;
-	for (T i = 0; i <= indexRange; ++i)
-	{
-		for (; indexPos < indexCount; ++indexPos, indexSource = (T*)((uintptr_t)indexSource + indexByteStride))
-		{
-			if (*indexSource + 1 >= i + indexBase)	// +1 to order invalidIndex<T>() as lowest value
-			{
-				lookup[i] = indexPos;
-				break;
-			}
-		}
-		if (indexPos == indexCount)
-		{
-			lookup[i] = indexPos;
-		}
-	}
-	lookup[indexRange + 1] = indexCount;
-}
-
-
-/**
-Creates the inverse of a map, such that inverseMap[map[i]] = i.
-Unmapped indices are set to invalidIndex<T>.
-
-\param[out]		inverseMap		inverse map space of given size
-\param[in]		map				original map of given size, unmapped entries must contain invalidIndex<T>
-\param[in]		size			size of the involved maps
-*/
-template<typename T>
-void invertMap(T* inverseMap, const T* map, const T size)
-{
-	memset(inverseMap, invalidIndex<T>(), size*sizeof(T));
-
-	for (T i = 0; i < size; i++)
-	{
-		if (!isInvalidIndex(map[i]))
-		{
-			inverseMap[map[i]] = i;
-		}
-	}
-}
-
-} // end namespace Blast
-} // end namespace Nv
-
-
-#endif // #ifndef NVBLASTINDEXFNS_H
+// 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-2018 NVIDIA Corporation. All rights reserved.
+
+
+#ifndef NVBLASTINDEXFNS_H
+#define NVBLASTINDEXFNS_H
+
+
+#include "NvBlastTypes.h"
+
+#include <cstring>
+
+
+namespace Nv
+{
+namespace Blast
+{
+
+/**
+Set to invalid index.
+*/
+template<typename T>
+NV_INLINE T invalidIndex()
+{
+	return ~(T)0;
+}
+
+
+/**
+Test for invalid index (max representable integer).
+*/
+template<typename T>
+NV_INLINE bool isInvalidIndex(T index)
+{
+	return index == invalidIndex<T>();
+}
+
+
+/**
+	Create a lookup table for data sorted by a templated index type.
+
+	Note: when using this function with unsigned integer index types invalidIndex<T>() is treated as a value less than zero.
+
+	On input:
+
+		The indices must lie in the interval [indexBase, indexBase+indexRange].
+	
+		indexSource must point to the first index in the data.
+
+		indexCount must be set to the number of indices in the data.
+
+		indexByteStride must be set to the distance, in bytes, between subequent indices.
+
+		lookup must point to a T array of size indexRange+2.
+
+	On return:
+
+		lookup will be filled such that:
+
+			lookup[i] = the position of first data element with index (i + indexBase)
+
+			lookup[indexRange+1] = indexCount
+
+		The last (indexRange+1) element is used so that one may always determine the number of data elements with the given index using:
+
+			count = lookup[i+1] - lookup[i]
+
+		Note, if an index (i + indexBase) is not present in the data then, lookup[i+1] = lookup[i], so the count (above) will correctly be zero.
+		In this case, the actual value of lookup[i] is irrelevant.
+*/
+template<typename T>
+void createIndexStartLookup(T* lookup, T indexBase, T indexRange, T* indexSource, T indexCount, T indexByteStride)
+{
+	++indexBase;	// Ordering invalidIndex<T>() as lowest value
+	T indexPos = 0;
+	for (T i = 0; i <= indexRange; ++i)
+	{
+		for (; indexPos < indexCount; ++indexPos, indexSource = (T*)((uintptr_t)indexSource + indexByteStride))
+		{
+			if (*indexSource + 1 >= i + indexBase)	// +1 to order invalidIndex<T>() as lowest value
+			{
+				lookup[i] = indexPos;
+				break;
+			}
+		}
+		if (indexPos == indexCount)
+		{
+			lookup[i] = indexPos;
+		}
+	}
+	lookup[indexRange + 1] = indexCount;
+}
+
+
+/**
+Creates the inverse of a map, such that inverseMap[map[i]] = i.
+Unmapped indices are set to invalidIndex<T>.
+
+\param[out]		inverseMap		inverse map space of given size
+\param[in]		map				original map of given size, unmapped entries must contain invalidIndex<T>
+\param[in]		size			size of the involved maps
+*/
+template<typename T>
+void invertMap(T* inverseMap, const T* map, const T size)
+{
+	memset(inverseMap, invalidIndex<T>(), size*sizeof(T));
+
+	for (T i = 0; i < size; i++)
+	{
+		if (!isInvalidIndex(map[i]))
+		{
+			inverseMap[map[i]] = i;
+		}
+	}
+}
+
+} // end namespace Blast
+} // end namespace Nv
+
+
+#endif // #ifndef NVBLASTINDEXFNS_H