tAlgorithm.h 2.1 KB

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