/*
 * (C) Copyright Neal D. Becker (2004)
 * Permission to copy, use, modify, sell and distribute this software
 * is granted provided this copyright notice appears in all copies.
 * This software is provided "as is" without express or implied
 * warranty, and with no claim as to its suitability for any purpose.
*/

#include <boost/iterator/iterator_facade.hpp>
#include <vector>
#include <algorithm>
#include <iostream>
#include <boost/array.hpp>
#include "zippy_iterator.H"

using namespace boost;
using namespace std;

template<class Iter>
class noop_iterator
  : public iterator_facade<noop_iterator<Iter>,
			   typename iterator_traits<Iter>::value_type,
			   forward_traversal_tag>
{
public:

  typedef typename iterator_traits<Iter>::value_type value_t;

  explicit noop_iterator (Iter i) : iter (i) {}

private:

  friend class iterator_core_access;

  void increment() { iter++; }

  value_t& dereference() const { return *iter; }

  Iter iter;

  bool equal (noop_iterator const& other) const {
    return other.iter == iter;
  }
};



template<typename T>
inline array<T,2> make_array_2 (T t1, T t2) {
  array<T,2> a;
  a[0] = t1;
  a[1] = t2;
  return a;
}

using namespace std;

void TestNoop () {
  vector<int> v (10);
  typedef vector<int>::iterator vit;

  copy (noop_iterator<vit> (v.begin()), noop_iterator<vit> (v.end()), ostream_iterator<int> (cout, "\n"));
}

void TestZip () {
  vector<int> v0 (10, 1);
  vector<int> v1 (10);

  copy (make_zippy_iterator (make_array_2 (v0.begin(), v1.begin())), make_zippy_iterator (make_array_2 (v0.end(), v1.end())), ostream_iterator<int> (cerr, "\n"));

}

int main () {
  TestNoop();
  TestZip();
}