steven/TinySTL
1
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity

完成find

Browse Source
This commit is contained in:
邹晓航
2014-10-12 12:49:51 +08:00
parent 3f8cc6cbcf
commit bc6ff339d9
1 changed files with 11 additions and 2 deletions
Download Patch File Download Diff File Expand all files Collapse all files

13
TinySTL/Algorithm.h
View File

@@ -4,7 +4,7 @@
#include <cstring> #include <cstring>
namespace TinySTL{ namespace TinySTL{
//********* fill ******************** //********* [fill] ********************
template<class ForwardIterator, class T> template<class ForwardIterator, class T>
void fill(ForwardIterator first, ForwardIterator last, const T& value) void fill(ForwardIterator first, ForwardIterator last, const T& value)
{ {
@@ -19,7 +19,7 @@ namespace TinySTL{
{ {
memset(first, static_cast<unsigned char>(value), (last - first) * sizeof(wchar_t)); memset(first, static_cast<unsigned char>(value), (last - first) * sizeof(wchar_t));
} }
//********* fill_n ******************** //********* [fill_n] ********************
template<class OutputIterator, class Size, class T> template<class OutputIterator, class Size, class T>
OutputIterator fill_n(OutputIterator first, Size n, const T& value) OutputIterator fill_n(OutputIterator first, Size n, const T& value)
{ {
@@ -39,6 +39,15 @@ namespace TinySTL{
memset(first, static_cast<unsigned char>(value), n * sizeof(wchar_t)); memset(first, static_cast<unsigned char>(value), n * sizeof(wchar_t));
return first + n; return first + n;
} }
//************ [find] ****************
template<class InputIterator, class T>
InputIterator find(InputIterator first, InputIterator last, const T& val){
for (; first != last; ++first){
if (*first == val)
break;
}
return first;
}
} }
#endif #endif