boost_mirror/utility
1
0
Fork 0
mirror of https://github.com/boostorg/utility.git synced 2025-05-09 15:04:00 +00:00
Code Issues Packages Projects Releases Wiki Activity

Workarounds for MSVC

Browse Source 
[SVN r12246]
This commit is contained in:
Dave Abrahams 2002-01-07 19:24:45 +00:00
parent bc9d8b13d0
commit 8a81d8b16c
2 changed files with 26 additions and 9 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

18
filter_iterator_example.cpp
View File

@ -7,7 +7,6 @@
// "as is" without express or implied warranty, and with no claim as // "as is" without express or implied warranty, and with no claim as
// to its suitability for any purpose. // to its suitability for any purpose.
#include <boost/config.hpp> #include <boost/config.hpp>
#include <algorithm> #include <algorithm>
#include <functional> #include <functional>
@ -20,9 +19,18 @@ struct is_positive_number {
int main() int main()
{ {
int numbers[] = { 0, -1, 4, -3, 5, 8, -2 }; int numbers_[] = { 0, -1, 4, -3, 5, 8, -2 };
const int N = sizeof(numbers)/sizeof(int); const int N = sizeof(numbers_)/sizeof(int);
#ifdef BOOST_NO_TEMPLATE_PARTIAL_SPECIALIZATION
// Assume there won't be proper iterator traits for pointers. This
// is just a wrapper for int* which has the right traits.
typedef boost::iterator_adaptor<int*, boost::default_iterator_policies, int> base_iterator;
#else
typedef int* base_iterator;
#endif
base_iterator numbers(numbers_);
// Example using make_filter_iterator() // Example using make_filter_iterator()
std::copy(boost::make_filter_iterator<is_positive_number>(numbers, numbers + N), std::copy(boost::make_filter_iterator<is_positive_number>(numbers, numbers + N),
boost::make_filter_iterator<is_positive_number>(numbers + N, numbers + N), boost::make_filter_iterator<is_positive_number>(numbers + N, numbers + N),
@ -30,7 +38,7 @@ int main()
std::cout << std::endl; std::cout << std::endl;
// Example using filter_iterator_generator // Example using filter_iterator_generator
typedef boost::filter_iterator_generator<is_positive_number, int*, int>::type typedef boost::filter_iterator_generator<is_positive_number, base_iterator, int>::type
FilterIter; FilterIter;
is_positive_number predicate; is_positive_number predicate;
FilterIter::policies_type policies(predicate, numbers + N); FilterIter::policies_type policies(predicate, numbers + N);

17
reverse_iterator_example.cpp
View File

@ -10,17 +10,26 @@
int main(int, char*[]) int main(int, char*[])
{ {
char letters[] = "hello world!"; char letters_[] = "hello world!";
const int N = sizeof(letters)/sizeof(char) - 1; const int N = sizeof(letters_)/sizeof(char) - 1;
#ifdef BOOST_NO_TEMPLATE_PARTIAL_SPECIALIZATION
// Assume there won't be proper iterator traits for pointers. This
// is just a wrapper for char* which has the right traits.
typedef boost::iterator_adaptor<char*, boost::default_iterator_policies, char> base_iterator;
#else
typedef char* base_iterator;
#endif
base_iterator letters(letters_);
std::cout << "original sequence of letters:\t" std::cout << "original sequence of letters:\t"
<< letters << std::endl; << letters_ << std::endl;
std::sort(letters, letters + N); std::sort(letters, letters + N);
// Use reverse_iterator_generator to print a sequence // Use reverse_iterator_generator to print a sequence
// of letters in reverse order. // of letters in reverse order.
boost::reverse_iterator_generator<char*>::type boost::reverse_iterator_generator<base_iterator>::type
reverse_letters_first(letters + N), reverse_letters_first(letters + N),
reverse_letters_last(letters); reverse_letters_last(letters);