tAlgorithm.h

Public Functions

Iterator

find(Iterator first, Iterator last, Value value)

void

for_each(Iterator first, Iterator last, Functor func)

void

swap(T & left, T & right)

Public Functions

find(Iterator first, Iterator last, Value value)

Finds the first matching value within the container returning the the element or last if its not found.

for_each(Iterator first, Iterator last, Functor func)

Steps thru the elements of an array calling detete for each.

swap(T & left, T & right)

Exchanges the values of the two elements.

 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
27
28/// Finds the first matching value within the container
29/// returning the the element or last if its not found.
30template <class Iterator, class Value>
31Iterator find(Iterator first, Iterator last, Value value)
32{
33   while (first != last && *first != value)
34      ++first;
35   return first;
36}
37
38/// Exchanges the values of the two elements.
39template <typename T> 
40inline void swap( T &left, T &right )
41{
42   T temp = right;
43   right = left;
44   left = temp;
45}
46
47/// Steps thru the elements of an array calling detete for each.
48template <class Iterator, class Functor>
49void for_each( Iterator first, Iterator last, Functor func )
50{
51   for ( ; first != last; first++ )
52      func( *first );
53}
54
55/// Functor for deleting a pointer.
56/// @see for_each
57struct delete_pointer
58{
59  template <typename T>
60  void operator()(T *ptr){ delete ptr;}
61};
62
63#endif //_TALGORITHM_H_
64