aboutsummaryrefslogtreecommitdiff
path: root/APEX_1.4/common/include/ApexQuickSelectSmallestK.h
diff options
context:
space:
mode:
authorgit perforce import user <a@b>2016-10-25 12:29:14 -0600
committerSheikh Dawood Abdul Ajees <Sheikh Dawood Abdul Ajees>2016-10-25 18:56:37 -0500
commit3dfe2108cfab31ba3ee5527e217d0d8e99a51162 (patch)
treefa6485c169e50d7415a651bf838f5bcd0fd3bfbd /APEX_1.4/common/include/ApexQuickSelectSmallestK.h
downloadphysx-3.4-3dfe2108cfab31ba3ee5527e217d0d8e99a51162.tar.xz
physx-3.4-3dfe2108cfab31ba3ee5527e217d0d8e99a51162.zip
Initial commit:
PhysX 3.4.0 Update @ 21294896 APEX 1.4.0 Update @ 21275617 [CL 21300167]
Diffstat (limited to 'APEX_1.4/common/include/ApexQuickSelectSmallestK.h')
-rw-r--r--APEX_1.4/common/include/ApexQuickSelectSmallestK.h81
1 files changed, 81 insertions, 0 deletions
diff --git a/APEX_1.4/common/include/ApexQuickSelectSmallestK.h b/APEX_1.4/common/include/ApexQuickSelectSmallestK.h
new file mode 100644
index 00000000..fabd8c88
--- /dev/null
+++ b/APEX_1.4/common/include/ApexQuickSelectSmallestK.h
@@ -0,0 +1,81 @@
+/*
+ * Copyright (c) 2008-2015, NVIDIA CORPORATION. All rights reserved.
+ *
+ * NVIDIA CORPORATION and its licensors retain all intellectual property
+ * and proprietary rights in and to this software, 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.
+ */
+
+
+#ifndef APEX_QUICK_SELECT_SMALLEST_K_H
+#define APEX_QUICK_SELECT_SMALLEST_K_H
+
+namespace nvidia
+{
+namespace apex
+{
+//A variant of quick sort to move the smallest k members of a sequence to its start.
+//Does much less work than a full sort.
+
+template<class Sortable, class Predicate>
+PX_INLINE void ApexQuickSelectSmallestK(Sortable* start, Sortable* end, uint32_t k, const Predicate& p = Predicate())
+{
+ Sortable* origStart = start;
+ Sortable* i;
+ Sortable* j;
+ Sortable m;
+
+ for (;;)
+ {
+ i = start;
+ j = end;
+ m = *(i + ((j - i) >> 1));
+
+ while (i <= j)
+ {
+ while (p(*i, m))
+ {
+ i++;
+ }
+ while (p(m, *j))
+ {
+ j--;
+ }
+ if (i <= j)
+ {
+ if (i != j)
+ {
+ nvidia::swap(*i, *j);
+ }
+ i++;
+ j--;
+ }
+ }
+
+
+
+ if (start < j
+ && k + origStart - 1 < j) //we now have found the (j - start+1) smallest. we need to continue sorting these only if k < (j - start+1)
+ //if we sort this we definitely won't need to sort the right hand side.
+ {
+ end = j;
+ }
+ else if (i < end
+ && k + origStart > i) //only continue sorting these if left side is not larger than k.
+ //we do this instead of recursing
+ {
+ start = i;
+ }
+ else
+ {
+ return;
+ }
+ }
+}
+
+} // namespace apex
+} // namespace nvidia
+
+#endif // APEX_QUICK_SELECT_SMALLEST_K_H