Go to the documentation of this file.00001
00002
00003
00004
00005
00006
00007
00008
00009
00010
00011
00012
00013
00014
00015
00016
00017
00018
00019
00020 #ifndef __CSUTIL_ALGORITHMS_H__
00021 #define __CSUTIL_ALGORITHMS_H__
00022
00027 namespace CS
00028 {
00029
00033 template <typename T>
00034 CS_FORCEINLINE_TEMPLATEMETHOD void Swap (T& a, T& b)
00035 {
00036 T tmp = a;
00037 a = b;
00038 b = tmp;
00039 }
00040
00051 template <typename T, typename Fn>
00052 CS_FORCEINLINE_TEMPLATEMETHOD Fn& ForEach (T it, Fn& Func)
00053 {
00054 while (it.HasNext ())
00055 {
00056 Func (it.Next ());
00057 }
00058 return Func;
00059 }
00060
00065 template <typename T, typename Fn>
00066 CS_FORCEINLINE_TEMPLATEMETHOD Fn& ForEach (T* start, T* end, Fn& Func)
00067 {
00068 while (start != end)
00069 {
00070 Func (*start);
00071 start++;
00072 }
00073 return Func;
00074 }
00075
00080 template <typename T, typename Fn, typename P>
00081 CS_FORCEINLINE_TEMPLATEMETHOD Fn& ForEach (T it, Fn& Func, P& p)
00082 {
00083 while (it.HasNext ())
00084 {
00085 Func (it.Next (), p);
00086 }
00087 return Func;
00088 }
00089
00094 template <typename T, typename Fn, typename P1, typename P2>
00095 CS_FORCEINLINE_TEMPLATEMETHOD Fn& ForEach (T it, Fn& Func, P1& p1, P2& p2)
00096 {
00097 while (it.HasNext ())
00098 {
00099 Func (it.Next (), p1, p2);
00100 }
00101 return Func;
00102 }
00103
00108 template <typename T, typename Fn, typename P1, typename P2, typename P3>
00109 CS_FORCEINLINE_TEMPLATEMETHOD Fn& ForEach (T it, Fn& Func, P1& p1, P2& p2, P3& p3)
00110 {
00111 while (it.HasNext ())
00112 {
00113 Func (it.Next (), p1, p2, p3);
00114 }
00115 return Func;
00116 }
00117
00118
00119 }
00120
00121 #endif // __CSUTIL_ALGORITHMS_H__