← Back to branch summary

~ubuntu-branches/debian/stretch/cgal/stretch

« back to all changes in this revision

Viewing changes to include/CGAL/Polyhedron_incremental_builder_3.h

  • Committer: Package Import Robot
  • Author(s): Joachim Reichel
  • Date: 2014-04-05 10:56:43 UTC
  • mfrom: (1.2.4)
  • Revision ID: package-import@ubuntu.com-20140405105643-jgnrpu2thtx23zfs
Tags: 4.4-1
* New upstream release.
* Remove patches do-not-link-example-with-qt4-support-library.patch and
  fix_jet_fitting_3.patch (applied upstream).

Show diffs side-by-side

added added

removed removed

Lines of Context:
include/CGAL/Polyhedron_incremental_builder_3.h
456
456
                        return Halfedge_handle();
457
457
                    }
458
458
                    decorator.set_face( e->next(), current_face);
 
459
                    // The following line prevents e->next() to be picked
 
460
                    // by get_vertex_to_edge_map(v) in an upcoming call
 
461
                    // of lookup_halfedge(v, *)
 
462
                    set_vertex_to_edge_map( v, e->next()->next()->opposite());
459
463
                    return e;
460
464
                }
461
465
                e = e->next()->opposite();
742
746
    typedef typename HDS::Supports_halfedge_vertex Supports_halfedge_vertex;
743
747
    Assert_compile_time_tag( Supports_halfedge_vertex(), Tag_true());
744
748
    // tests if the facet described by the vertex indices can be inserted 
745
 
    // without creating a a non-manifold (and therefore invalid) situation.
 
749
    // without creating a non-manifold (and therefore invalid) situation.
746
750
    // indices are cyclically closed once.
747
751
    std::size_t n = indices.size() - 1;
748
752
    // Test if a vertex is not twice in the indices
749
753
    for ( std::size_t i = 0; i < n; ++i) {
750
754
        CGAL_precondition( indices[i] < new_vertices);
751
755
        // check if vertex indices[i] is already in the sequence [0..i-1]
752
 
        for ( std::size_t k = 0; k+1 < i; ++k) {
 
756
        for ( std::size_t k = 0; k < i; ++k) {
753
757
            if ( indices[k] == indices[i])
754
758
                return false;
755
759
        }