Improve std::map by using a SplayTree container.

Originally std::map was implemented as a linked list.  Some of the maps
in PORE and PRD code will be big enough that this is very inefficient.
Converted std::map to a binary search tree implementation based on the
Splay-Tree algorithm.

RTC: 34071

Change-Id: If77c017f5d95920f8010991e7f087cbe571ca2e9
Reviewed-on: http://gfw160.austin.ibm.com:8080/gerrit/790
Tested-by: Jenkins Server
Reviewed-by: MIKE J. JONES <mjjones@us.ibm.com>
Reviewed-by: Douglas R. Gilbert <dgilbert@us.ibm.com>
Reviewed-by: Bradley W. Bishop <bradleyb@us.ibm.com>
Reviewed-by: A. Patrick Williams III <iawillia@us.ibm.com>

1 files changed, 57 insertions, 0 deletions

diff --git a/src/include/util/algorithm.H b/src/include/util/algorithm.H
new file mode 100644
index 000000000..1ad7358ea
--- /dev/null
+++ b/src/include/util/algorithm.H
@@ -0,0 +1,57 @@
+//  IBM_PROLOG_BEGIN_TAG
+//  This is an automatically generated prolog.
+//
+//  $Source: src/include/util/algorithm.H $
+//
+//  IBM CONFIDENTIAL
+//
+//  COPYRIGHT International Business Machines Corp. 2012
+//
+//  p1
+//
+//  Object Code Only (OCO) source materials
+//  Licensed Internal Code Source Materials
+//  IBM HostBoot Licensed Internal Code
+//
+//  The source code for this program is not published or other-
+//  wise divested of its trade secrets, irrespective of what has
+//  been deposited with the U.S. Copyright Office.
+//
+//  Origin: 30
+//
+//  IBM_PROLOG_END
+#ifndef __UTIL_ALGORITHM_H
+#define __UTIL_ALGORITHM_H
+
+namespace Util
+{
+    namespace Algorithm
+    {
+
+        /** @struct static_min
+         *  @brief Template class to perform a compile-time min calculation.
+         *
+         *  Example:
+         *      static_min<size_t, 5, 7>::value == 5
+         */
+        template <typename T, T a, T b>
+        struct static_min
+        {
+            static const T value = (a < b) ? a : b;
+        };
+
+        /** @struct static_max
+         *  @brief Template class to perform a compile-time max calculation.
+         *
+         *  Example:
+         *      static_max<size_t, 5, 7>::value == 7
+         */
+        template <typename T, T a, T b>
+        struct static_max
+        {
+            static const T value = (a > b) ? a : b;
+        };
+
+    };
+};
+#endif