C++ (Cpp) boost::end Examples

Example #1

File: equal_range_test.cpp Project: BobArcher/adobe_source_libraries

void equal_range_test() {
    using std::pair;
    using adobe::less;
    using adobe::equal_range;
    using adobe::equal_range_n;
    using adobe::aggregate_pair;
    using boost::begin;
    using boost::end;
    using boost::size;

    aggregate_pair<int> a[] = {{0, 0}, {0, 1}, {1, 2}, {1, 3}, {3, 4}, {3, 5}};
    const aggregate_pair<int> c[] = {{0, 0}, {0, 1}, {1, 2}, {1, 3}, {3, 4}, {3, 5}};

    BOOST_CHECK_EQUAL(equal_range_n(begin(a), size(a), a[0]).first, &a[0]);
    BOOST_CHECK_EQUAL(equal_range_n(begin(a), size(a), a[1], less()).first, &a[1]);
    BOOST_CHECK_EQUAL(
        equal_range_n(begin(a), size(a), 1, less(), &aggregate_pair<int>::first).first, &a[2]);

    BOOST_CHECK_EQUAL(equal_range(begin(a), end(a), a[0]).first, &a[0]);
    BOOST_CHECK_EQUAL(adobe::equal_range(begin(a), end(a), a[1], less()).first, &a[1]);
    BOOST_CHECK_EQUAL(equal_range(begin(a), end(a), 1, less(), &aggregate_pair<int>::first).first,
                      &a[2]);

    BOOST_CHECK_EQUAL(equal_range(a, a[2]).first, &a[2]);
    BOOST_CHECK_EQUAL(equal_range(c, c[3]).first, &c[3]);

    BOOST_CHECK_EQUAL(equal_range(a, a[4], less()).first, &a[4]);
    BOOST_CHECK_EQUAL(equal_range(c, c[5], less()).first, &c[5]);

    BOOST_CHECK_EQUAL(equal_range(a, 1, less(), &aggregate_pair<int>::first).first, &a[2]);
    BOOST_CHECK_EQUAL(equal_range(c, 1, less(), &aggregate_pair<int>::first).first, &c[2]);
}

Example #2

File: iterator_range.hpp Project: DCMF/Dawn-of-Civilization

 inline std::basic_ostream<Elem,Traits>& operator<<( 
             std::basic_ostream<Elem, Traits>& Os,
             const iterator_range<IteratorT>& r )
 {
     std::copy( begin(r), end(r), std::ostream_iterator<Elem>(Os));
     return Os;
 }

Example #3

File: iterator_range.hpp Project: DCMF/Dawn-of-Civilization

 iterator adl_end( ForwardRange& r )
 {
     #if BOOST_WORKAROUND(__BORLANDC__, BOOST_TESTED_AT(0x564))  
     return boost::end( r );
     #else
     using boost::end;
     return iterator( end( r ) );
     #endif
 }

Example #4

File: iterator_range.hpp Project: DCMF/Dawn-of-Civilization

 inline SeqT transform_range( const Range& r, FuncT Func )
 {
     SeqT Seq;
     std::transform( begin( r ), end( r ), std::back_inserter(Seq), Func );
     return Seq;
 }

Example #5

File: iterator_range.hpp Project: DCMF/Dawn-of-Civilization

 inline SeqT copy_range( const Range& r )
 {
     return SeqT( begin( r ), end( r ) );
 }

Example #6

File: iterator_range.hpp Project: DCMF/Dawn-of-Civilization

 inline iterator_range< BOOST_DEDUCED_TYPENAME range_result_iterator<Range>::type >
 make_iterator_range( Range& r ) 
 {   
     return iterator_range< BOOST_DEDUCED_TYPENAME range_result_iterator<Range>::type >
         ( begin( r ), end( r ) );
 }

Example #7

File: main.cpp Project: CCJY/coliru

auto diffs(BidiRange&& in)
{
    using std::next;
    using std::prev;
    using boost::begin;
    using boost::end;
    using boost::empty;
    using boost::get;
    assert( !empty(in) );
    auto offset = [](auto&& in) { return boost::make_iterator_range(std::next(begin(in)), end(in)); };
    auto shave = [](auto&& in) { return boost::make_iterator_range(begin(in), std::prev(end(in))); };
    return R::transform(range::combine(R::stride(shave(in), 2), R::stride(offset(in), 2))
                        , [](auto const& elems) { return get<0>(elems) < get<1>(elems); } );
}