Subversion Repositories scarts

// 2001-06-21  Benjamin Kosnik  <bkoz@redhat.com>

// Copyright (C) 2001, 2002, 2004, 2005 Free Software Foundation, Inc.

//

// This file is part of the GNU ISO C++ Library.  This library is free

// software; you can redistribute it and/or modify it under the

// terms of the GNU General Public License as published by the

// Free Software Foundation; either version 2, or (at your option)

// any later version.

// This library is distributed in the hope that it will be useful,

// but WITHOUT ANY WARRANTY; without even the implied warranty of

// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the

// GNU General Public License for more details.

// You should have received a copy of the GNU General Public License along

// with this library; see the file COPYING.  If not, write to the Free

// Software Foundation, 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301,

// USA.

// 24.4.2.1 Template class back_insert_iterator

#include <iterator>

#include <list>

void test01()

{

  using namespace std;

  // Check for required base class.

  list<int> l;

  typedef back_insert_iterator<list<int> > test_iterator;

  typedef iterator<output_iterator_tag, void, void, void, void> base_iterator;

  test_iterator  r_it(l);

  base_iterator* base __attribute__((unused)) = &r_it;

  // Check for required typedefs

  typedef test_iterator::value_type value_type;

  typedef test_iterator::difference_type difference_type;

  typedef test_iterator::pointer pointer;

  typedef test_iterator::reference reference;

  typedef test_iterator::iterator_category iteratory_category;

  typedef test_iterator::container_type container_type;

}

// Make sure iterator can be instantiated.

template class std::back_insert_iterator<std::list<int> >;

void test02()

{

  typedef std::back_insert_iterator<std::list<int> > iterator_type;

  std::list<int> li;

  iterator_type it = std::back_inserter(li);

}

// Check data member 'container' accessible.

class test_dm : public std::back_insert_iterator<std::list<int> >

{

  container_type l;

  container_type* p;

public:

  test_dm():  std::back_insert_iterator<std::list<int> >(l), p(container) { }

};

int main()

{

  test01();

  test02();

  return 0;

}