--- /dev/null
+// ---------------------------------------------------------------------
+// $Id: table.cc 31349 2013-10-20 19:07:06Z maier $
+//
+// Copyright (C) 1998 - 2013 by the deal.II authors
+//
+// This file is part of the deal.II library.
+//
+// The deal.II library is free software; you can use it, redistribute
+// it, and/or modify it under the terms of the GNU Lesser General
+// Public License as published by the Free Software Foundation; either
+// version 2.1 of the License, or (at your option) any later version.
+// The full text of the license can be found in the file LICENSE at
+// the top level of the deal.II distribution.
+//
+// ---------------------------------------------------------------------
+
+
+// check TableBase::fill using an istream_iterator
+
+
+#include "../tests.h"
+#include <cmath>
+#include <fstream>
+#include <iomanip>
+#include <cstdlib>
+
+#include <deal.II/base/logstream.h>
+#include <deal.II/base/table.h>
+
+
+int
+main ()
+{
+ std::ofstream logfile("output");
+ deallog << std::fixed;
+ deallog << std::setprecision(0);
+ deallog.attach(logfile);
+ deallog.depth_console(0);
+ deallog.threshold_double(1.e-10);
+
+ const std::string elements = "1 2 3 4 5 6";
+ {
+ // create a 2x3 table from this
+ Table<2,double> t (2,3);
+ std::istringstream in1(elements);
+ t.fill (std::istream_iterator<double>(in1),
+ true);
+
+ for (unsigned int i=0; i<t.size()[0]; ++i)
+ {
+ for (unsigned int j=0; j<t.size()[1]; ++j)
+ deallog << t[i][j] << ' ';
+ deallog << std::endl;
+ }
+
+ // same data, same table, but filled in transpose ordering
+ std::istringstream in2(elements);
+ t.fill (std::istream_iterator<double>(in2),
+ false);
+
+ for (unsigned int i=0; i<t.size()[0]; ++i)
+ {
+ for (unsigned int j=0; j<t.size()[1]; ++j)
+ deallog << t[i][j] << ' ';
+ deallog << std::endl;
+ }
+ }
+}
+
+
+