mirror of https://github.com/CGAL/cgal
code bugfix after test; doc bug fix: SequenceContainer -> RandomAccessContainer (also in Stream_support)
This commit is contained in:
parent
7648fd473b
commit
197c0a2471
|
|
@ -108,8 +108,8 @@ in a vector of points and a vector of index triples.
|
||||||
|
|
||||||
\tparam InputIterator must be an input iterator with a value type equivalent to `Traits::Point_3`.
|
\tparam InputIterator must be an input iterator with a value type equivalent to `Traits::Point_3`.
|
||||||
\tparam PointRange a model of the concept `RandomAccessContainer` whose value type is the point type.
|
\tparam PointRange a model of the concept `RandomAccessContainer` whose value type is the point type.
|
||||||
\tparam PolygonRange a model of the concepts `SequenceContainer` and `BackInsertionSequence`
|
\tparam PolygonRange a model of the concepts `RandomAccessContainer` and `BackInsertionSequence`
|
||||||
whose `value_type` is itself a model of the concepts `SequenceContainer`
|
whose `value_type` is itself a model of the concepts `RandomAccessContainer`
|
||||||
and `BackInsertionSequence` whose `value_type` is an unsigned integer type
|
and `BackInsertionSequence` whose `value_type` is an unsigned integer type
|
||||||
convertible to `std::size_t`
|
convertible to `std::size_t`
|
||||||
\tparam Traits must be model of the concept `ConvexHullTraits_3`.
|
\tparam Traits must be model of the concept `ConvexHullTraits_3`.
|
||||||
|
|
|
||||||
|
|
@ -56,6 +56,7 @@ void copy_ch2_to_face_graph(const std::list<P>& CH_2,
|
||||||
}
|
}
|
||||||
|
|
||||||
for(std::size_t i = 1; i < CH_2.size()-1; ++i){
|
for(std::size_t i = 1; i < CH_2.size()-1; ++i){
|
||||||
|
CGAL::internal::resize(its.faces[i-1], 3);
|
||||||
its.faces[i-1][0] = i;
|
its.faces[i-1][0] = i;
|
||||||
its.faces[i-1][1] = i + 1;
|
its.faces[i-1][1] = i + 1;
|
||||||
its.faces[i-1][2] = i + 2;
|
its.faces[i-1][2] = i + 2;
|
||||||
|
|
|
||||||
|
|
@ -2,6 +2,7 @@
|
||||||
#include <CGAL/convex_hull_3.h>
|
#include <CGAL/convex_hull_3.h>
|
||||||
|
|
||||||
#include <vector>
|
#include <vector>
|
||||||
|
#include <deque>
|
||||||
#include <array>
|
#include <array>
|
||||||
#include <algorithm>
|
#include <algorithm>
|
||||||
|
|
||||||
|
|
@ -67,7 +68,7 @@ int main()
|
||||||
|
|
||||||
{
|
{
|
||||||
typedef std::vector<Point_3> Vertices;
|
typedef std::vector<Point_3> Vertices;
|
||||||
typedef std::vector<std::list<int> > Faces;
|
typedef std::deque<std::vector<int> > Faces;
|
||||||
test<Vertices,Faces>();
|
test<Vertices,Faces>();
|
||||||
}
|
}
|
||||||
|
|
||||||
|
|
|
||||||
|
|
@ -52,8 +52,8 @@ namespace IO {
|
||||||
* The format is detected from the filename extension (letter case is not important).
|
* The format is detected from the filename extension (letter case is not important).
|
||||||
*
|
*
|
||||||
* \tparam PointRange a model of the concept `RandomAccessContainer` whose value type is the point type.
|
* \tparam PointRange a model of the concept `RandomAccessContainer` whose value type is the point type.
|
||||||
* \tparam PolygonRange a model of the concepts `SequenceContainer` and `BackInsertionSequence`
|
* \tparam PolygonRange a model of the concepts `RandomAccessContainer` and `BackInsertionSequence`
|
||||||
* whose `value_type` is itself a model of the concepts `SequenceContainer`
|
* whose `value_type` is itself a model of the concepts `RandomAccessContainer`
|
||||||
* and `BackInsertionSequence` whose `value_type` is an unsigned integer type
|
* and `BackInsertionSequence` whose `value_type` is an unsigned integer type
|
||||||
* convertible to `std::size_t`
|
* convertible to `std::size_t`
|
||||||
* \tparam NamedParameters a sequence of \ref bgl_namedparameters "Named Parameters"
|
* \tparam NamedParameters a sequence of \ref bgl_namedparameters "Named Parameters"
|
||||||
|
|
|
||||||
Loading…
Reference in New Issue