- ThreadManagement::spawn.
- Threads::ThreadCondition and Threads::ThreadMutex.
- GridGenerator::laplace_transformation.
+ - The version of GridGenerator::parallelogram where the corners are given
+ as a rank-2 tensor rather than as an array of points.
</ol>
<li> Removed: The config.h file no longer exports HAVE_* definitions.
const Point<dim> (&corners)[dim],
const bool colorize=false);
- /**
- * @deprecated Use the other function of same name.
- */
- template <int dim>
- void
- parallelogram (Triangulation<dim> &tria,
- const Tensor<2,dim> &corners,
- const bool colorize=false) DEAL_II_DEPRECATED;
-
/**
* A parallelepiped. The first corner point is the origin. The @p dim
* adjacent points are vectors describing the edges of the parallelepiped
}
- template<>
- void
- parallelogram (Triangulation<1> &tria,
- const Tensor<2,1> &corners,
- const bool colorize)
- {
- Assert (false, ExcNotImplemented());
- }
-
- template<>
- void
- parallelogram (Triangulation<3> &tria,
- const Tensor<2,3> &corners,
- const bool colorize)
- {
- Assert (false, ExcNotImplemented());
- }
-
-
- template<>
- void
- parallelogram (Triangulation<2> &tria,
- const Tensor<2,2> &corners,
- const bool colorize)
- {
- // simply pass everything to the other function of same name
- const Point<2> x[2] = { corners[0], corners[1] };
- parallelogram (tria, x, colorize);
- }
-
-
// Parallelepiped implementation in 1d, 2d, and 3d. @note The
// implementation in 1d is similar to hyper_rectangle(), and in 2d is
// ---------------------------------------------------------------------
//
-// Copyright (C) 2005 - 2013 by the deal.II authors
+// Copyright (C) 2005 - 2014 by the deal.II authors
//
// This file is part of the deal.II library.
//
{
deallog << "parallelogram" << std::endl;
Triangulation<dim> tr;
- Tensor<2,dim> corners;
+ Point<dim> corners[dim];
corners[0] = p1;
if (dim>1) corners[1] = p2;
if (dim>2) corners[2] = p3;