// (C) Copyright 2008-2009 SDML (www.sdml.info)
//
// Use, modification and distribution is subject to the Boost Software
// License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at
// http://www.boost.org/LICENSE_1_0.txt)

#include <iostream>
#include <vector>
#include <list>
#include <forward_list>

#include <origin/utility/typestr.hpp>
#include <origin/utility/enable.hpp>
#include <origin/concepts.hpp>
#include <origin/iterator/concepts.hpp>

using namespace origin;
using std::cout;

// Requires InputIterator
template <
    typename Iter,
    typename = typename concept_assert<InputIterator<Iter>>::type>
typename InputIterator<Iter>::difference_type
my_dist(Iter f, Iter l,
    typename concept_enable<
        InputIterator<Iter>, Not<RandomAccessIterator<Iter>>
    >::type* = 0)
{
    cout << typestr<Iter>() << ": " << "distance: InputIterator\n";
    return 0;
}

// Requires RandomAccessIterator
template <
    typename Iter,
    typename = typename concept_assert<InputIterator<Iter>>::type>
typename InputIterator<Iter>::difference_type
my_dist(Iter f, Iter l,
    typename concept_enable<RandomAccessIterator<Iter>>::type* = 0)
{
    cout << typestr<Iter>() << ": " << "distance: RandomAccessIterator\n";
    return 0;
}


// Requires InputIterator
template <typename Iter>
size_t my_adv(Iter f, Iter l, int n,
    typename concept_enable<
        InputIterator<Iter>, Not<BidirectionalIterator<Iter>>
    >::type* = 0)
{
    cout << typestr<Iter>() << ": " << "advance: InputIterator\n";
    return 0;
}

// Requires BidirectionalIterator
template <typename Iter>
size_t my_adv(Iter f, Iter l, int n,
    typename concept_enable<
        BidirectionalIterator<Iter>, Not<RandomAccessIterator<Iter>>
    >::type* = 0)
{
    cout << typestr<Iter>() << ": " << "advance: BidirectionalIterator\n";
    return 0;
}

// Requires RandomAccessIterator
template <typename Iter>
size_t my_adv(Iter f, Iter l, int n,
    typename concept_enable<RandomAccessIterator<Iter>>::type* = 0)
{
    cout << typestr<Iter>() << ": " << "advance: RandomAccessIterator\n";
    return 0;
}

int main() {
    {
        int* p = 0, *q = 0;
        my_dist(p, q);
        my_adv(p, q , 0);
    }
    {
        std::forward_list<int>::iterator p, q;
        my_dist(p, q);
        my_adv(p, q , 0);
    }
    {
        std::list<int>::iterator p, q;
        my_dist(p, q);
        my_adv(p, q , 0);
    }
    {
        std::vector<int>::iterator p, q;
        my_dist(p, q);
        my_adv(p, q , 0);
    }

}