Additional needed utilities for PRD port.

    Implement assorted utilities and STL templates for the
    port of existing PRD code from FSP:
        * strcat / strncat
        * std::generate_n
        * std::transform
        * std::back_inserter

RTC: 44531
Change-Id: I9992f78222cbc2f74da15eea74c9b2cad602ad59
Reviewed-on: http://gfw160.austin.ibm.com:8080/gerrit/1501
Tested-by: Jenkins Server
Reviewed-by: Douglas R. Gilbert <dgilbert@us.ibm.com>
Reviewed-by: Christopher T. Phan <cphan@us.ibm.com>
Reviewed-by: A. Patrick Williams III <iawillia@us.ibm.com>

1 files changed, 93 insertions, 22 deletions

diff --git a/src/include/algorithm b/src/include/algorithm
index 7ee1106e6..b0d4d41c1 100644
--- a/src/include/algorithm
+++ b/src/include/algorithm
@@ -1,25 +1,26 @@
-//  IBM_PROLOG_BEGIN_TAG
-//  This is an automatically generated prolog.
-//
-//  $Source: src/include/algorithm $
-//
-//  IBM CONFIDENTIAL
-//
-//  COPYRIGHT International Business Machines Corp. 2011
-//
-//  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
+/*  IBM_PROLOG_BEGIN_TAG
+ *  This is an automatically generated prolog.
+ *
+ *  $Source: src/include/algorithm $
+ *
+ *  IBM CONFIDENTIAL
+ *
+ *  COPYRIGHT International Business Machines Corp. 2011-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_TAG
+ */
 #ifndef ALGORITHM
 #define ALGORITHM
 
@@ -125,6 +126,24 @@ namespace std
     }
 
     /**
+     * Fill a sequence with a generated value
+     * @param[in] first OutputIterator to the first position in the sequence.
+     * @param[in] n number of elements in the sequence
+     * @param[in] gen functor to create values used to fill the sequence.
+     */
+    template <typename OutputIterator, typename Size, typename Generator>
+    OutputIterator generate_n(OutputIterator first, Size n, Generator gen)
+    {
+        for(; n>0; --n)
+        {
+            *first = gen();
+            ++first;
+        }
+
+        return first;
+    }
+
+    /**
      * Return the lesser of two arguments
      * @param[in] a object reference
      * @param[in] b object reference
@@ -681,6 +700,58 @@ namespace std
         Util::__Util_QSort_Impl::sort(first, last, pred);
     }
 
+    /** Transform one sequence into another. 
+     *
+     *  Executes an operator against all elements in [first, last) and writes
+     *  the result to another sequence.
+     *
+     *  @param first - Beginning of the input range.
+     *  @param last - Ending of the input range.
+     *  @param result - Beginning of the output range.
+     *  @param op - The transformation operator.
+     */
+    template <typename InputIterator, typename OutputIterator, 
+              typename UnaryFunction>
+    OutputIterator transform(InputIterator first, InputIterator last,
+                             OutputIterator result, UnaryFunction op)
+    {
+        while (first != last)
+        {
+            *result = op(*first);
+            ++result;
+            ++first;
+        }
+        return result;
+    }
+
+    /** Transform two sequences into another. 
+     *
+     *  Executes an operator against all elements in [first1, last1) along
+     *  with the peer from [first2, ...) and writes the result to 
+     *  another sequence.
+     *
+     *  @param first1 - Beginning of the first input range.
+     *  @param last1 - Ending of the first input range.
+     *  @param first2 - Beginning of the second input range.
+     *  @param result - Beginning of the output range.
+     *  @param op - The transformation operator.
+     */
+    template <typename InputIterator1, typename InputIterator2,
+              typename OutputIterator, typename BinaryFunction>
+    OutputIterator transform(InputIterator1 first1, InputIterator1 last1,
+                             InputIterator2 first2, OutputIterator result, 
+                             BinaryFunction op)
+    {
+        while (first1 != last1)
+        {
+            *result = op(*first1, *first2);
+            ++result;
+            ++first1; ++first2;
+        }
+        return result;
+    }
+
+
 
 };
 #endif