tAlgorithm.h

Engine/source/core/tAlgorithm.h

More...

Classes:

Namespaces:

Detailed Description

 1
 2//-----------------------------------------------------------------------------
 3// Copyright (c) 2012 GarageGames, LLC
 4//
 5// Permission is hereby granted, free of charge, to any person obtaining a copy
 6// of this software and associated documentation files (the "Software"), to
 7// deal in the Software without restriction, including without limitation the
 8// rights to use, copy, modify, merge, publish, distribute, sublicense, and/or
 9// sell copies of the Software, and to permit persons to whom the Software is
10// furnished to do so, subject to the following conditions:
11//
12// The above copyright notice and this permission notice shall be included in
13// all copies or substantial portions of the Software.
14//
15// THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
16// IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
17// FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
18// AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
19// LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING
20// FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS
21// IN THE SOFTWARE.
22//-----------------------------------------------------------------------------
23
24#ifndef _TALGORITHM_H_
25#define _TALGORITHM_H_
26
27namespace T3D
28{
29   /// Finds the first matching value within the container
30   /// returning the the element or last if its not found.
31   template <class Iterator, class Value>
32   Iterator find(Iterator first, Iterator last, Value value)
33   {
34      while (first != last && *first != value)
35         ++first;
36      return first;
37   }
38
39   /// Exchanges the values of the two elements.
40   template <typename T>
41   inline void swap(T &left, T &right)
42   {
43      T temp = right;
44      right = left;
45      left = temp;
46   }
47
48   /// Steps thru the elements of an array calling detete for each.
49   template <class Iterator, class Functor>
50   void for_each(Iterator first, Iterator last, Functor func)
51   {
52      for (; first != last; first++)
53         func(*first);
54   }
55
56   /// Functor for deleting a pointer.
57   /// @see for_each
58   struct delete_pointer
59   {
60      template <typename T>
61      void operator()(T *ptr) { delete ptr; }
62   };
63}
64#endif //_TALGORITHM_H_
65