tAlgorithm.h 2.1 KB

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