From df3648d7cd33ee146de3041d3f0d93a713075e26 Mon Sep 17 00:00:00 2001
From: Patrick Williams <iawillia@us.ibm.com>
Date: Tue, 6 Mar 2012 14:46:28 -0600
Subject: 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>
---
 src/include/functional | 7 +++++++
 1 file changed, 7 insertions(+)

(limited to 'src/include/functional')

diff --git a/src/include/functional b/src/include/functional
index 5ef81bf49..ac0b070f4 100644
--- a/src/include/functional
+++ b/src/include/functional
@@ -35,6 +35,13 @@ namespace std
             typedef R result_type;            ///< type of the return type
         };
 
+    template<typename A, typename R>
+        struct unary_function
+        {
+            typedef A argument_type;
+            typedef R result_type;
+        };
+
     /**
      * less template
      */
-- 
cgit v1.2.1