mirror of https://github.com/CGAL/cgal
fixed test-program license statement, by removing it:
now it only says, that it's part of the internal release and should not be distributed (similar to other packages)
This commit is contained in:
Andreas Meyer
parent
f4bf455c8f
commit
f575392469
|
|
@ -1,26 +1,12 @@
|
|||
// ============================================================================
|
||||
//
|
||||
// Copyright (c) 2001-2006 Max-Planck-Institut Saarbruecken (Germany).
|
||||
// All rights reserved.
|
||||
//
|
||||
// This file is part of EXACUS (http://www.mpi-inf.mpg.de/projects/EXACUS/);
|
||||
// you may redistribute it under the terms of the Q Public License version 1.0.
|
||||
// See the file LICENSE.QPL distributed with EXACUS.
|
||||
//
|
||||
// Licensees holding a valid commercial license may use this file in
|
||||
// accordance with the commercial license agreement provided with the software.
|
||||
//
|
||||
// This file is provided AS IS with NO WARRANTY OF ANY KIND, INCLUDING THE
|
||||
// WARRANTY OF DESIGN, MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE.
|
||||
// This software and related documentation is part of an INTERNAL release
|
||||
// of the Computational Geometry Algorithms Library (CGAL). It is not
|
||||
// intended for general use.
|
||||
//
|
||||
// ----------------------------------------------------------------------------
|
||||
//
|
||||
// Library : Support
|
||||
// File : test/Cache.C
|
||||
// SoX_release : $Name: $
|
||||
// Revision : $Revision$
|
||||
// Revision_date : $Date$
|
||||
//
|
||||
// $URL$
|
||||
// $Id$
|
||||
// Author(s) : Michael Hemmer <hemmer@informatik.uni-mainz.de>
|
||||
//
|
||||
// ============================================================================
|
||||
|
|
@ -51,8 +37,8 @@ struct Int_t : public CGAL::Handle_with_policy< Int_rep, Unify > {
|
|||
// test initialize_with
|
||||
this->initialize_with( i, j + k);
|
||||
}
|
||||
|
||||
// This is needed to prevent VC7.1 and VC8 to call
|
||||
|
||||
// This is needed to prevent VC7.1 and VC8 to call
|
||||
// the explicit templated constructor in Base instead of its copy-ctor.
|
||||
Int_t( Int_t const& rhs ) : Base( static_cast<Base const&>(rhs) ) {}
|
||||
|
||||
|
|
@ -73,16 +59,16 @@ void test_typedefs(){
|
|||
typedef CGAL::Cache<int,double> Cache;
|
||||
BOOST_STATIC_ASSERT(( ::boost::is_same< Cache::Input, int >::value ));
|
||||
BOOST_STATIC_ASSERT(( ::boost::is_same< Cache::Output,double>::value ));
|
||||
typedef CGAL::Creator_1<int,double> Creator_double;
|
||||
typedef CGAL::Creator_1<int,double> Creator_double;
|
||||
BOOST_STATIC_ASSERT(( ::boost::is_same<Cache::Creator,Creator_double>::value ));
|
||||
typedef CGAL::Creator_1<int,int> Creator_int;
|
||||
typedef CGAL::Creator_1<int,int> Creator_int;
|
||||
BOOST_STATIC_ASSERT(( ::boost::is_same<Cache::Canonicalizer,Creator_int>::value ));
|
||||
BOOST_STATIC_ASSERT(( ::boost::is_same<Cache::Compare,std::less<int> >::value ));
|
||||
BOOST_STATIC_ASSERT(( ::boost::is_same<Cache::Self,CGAL::Cache<int,double> >::value ));
|
||||
}
|
||||
int main(){
|
||||
{
|
||||
test_typedefs();
|
||||
test_typedefs();
|
||||
{
|
||||
typedef CGAL::Cache<int,double> Cache;
|
||||
double d;
|
||||
|
|
@ -107,7 +93,7 @@ int main(){
|
|||
typedef Cache::Reverse_iterator Reverse_iterator;
|
||||
typedef Cache::Const_reverse_iterator Const_reverse_iterator;
|
||||
typedef Cache::Size_type Size_type;
|
||||
|
||||
|
||||
Iterator it;
|
||||
d=0;
|
||||
for(it=cache.begin();it!=cache.end();it++){
|
||||
|
|
@ -131,7 +117,7 @@ int main(){
|
|||
CGAL_test_assert(hi2==Int(4));
|
||||
CGAL_test_assert(cache.size()==2);
|
||||
hi2=cache(3);
|
||||
CGAL_test_assert(hi.id()==hi2.id());
|
||||
CGAL_test_assert(hi.id()==hi2.id());
|
||||
}
|
||||
}
|
||||
|
||||
|
|
|
|||
|
|
@ -1,29 +1,13 @@
|
|||
// ============================================================================
|
||||
//
|
||||
// Copyright (c) 2001-2006 Max-Planck-Institut Saarbruecken (Germany).
|
||||
// All rights reserved.
|
||||
//
|
||||
// This file is part of EXACUS (http://www.mpi-inf.mpg.de/projects/EXACUS/);
|
||||
// you may redistribute it under the terms of the Q Public License version 1.0.
|
||||
// See the file LICENSE.QPL distributed with EXACUS.
|
||||
//
|
||||
// Licensees holding a valid commercial license may use this file in
|
||||
// accordance with the commercial license agreement provided with the software.
|
||||
//
|
||||
// This file is provided AS IS with NO WARRANTY OF ANY KIND, INCLUDING THE
|
||||
// WARRANTY OF DESIGN, MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE.
|
||||
// This software and related documentation is part of an INTERNAL release
|
||||
// of the Computational Geometry Algorithms Library (CGAL). It is not
|
||||
// intended for general use.
|
||||
//
|
||||
// ----------------------------------------------------------------------------
|
||||
//
|
||||
// Library : LiS
|
||||
// File : test/Flattening_iterator.C
|
||||
// LiS_release : $Name: $
|
||||
// Revision : $Revision$
|
||||
// Revision_date : $Date$
|
||||
//
|
||||
// Author(s) : Arno Eigenwillig <arno@mpi-inf.mpg.de>
|
||||
//
|
||||
// ============================================================================
|
||||
// $URL$
|
||||
// $Id$
|
||||
// author(s) : Arno Eigenwillig <arno@mpi-inf.mpg.de>
|
||||
|
||||
#include <CGAL/Flattening_iterator.h>
|
||||
#include <CGAL/Testsuite/assert.h>
|
||||
|
|
|
|||
|
|
@ -1,26 +1,12 @@
|
|||
// ============================================================================
|
||||
//
|
||||
// Copyright (c) 2001-2006 Max-Planck-Institut Saarbruecken (Germany).
|
||||
// All rights reserved.
|
||||
//
|
||||
// This file is part of EXACUS (http://www.mpi-inf.mpg.de/projects/EXACUS/);
|
||||
// you may redistribute it under the terms of the Q Public License version 1.0.
|
||||
// See the file LICENSE.QPL distributed with EXACUS.
|
||||
//
|
||||
// Licensees holding a valid commercial license may use this file in
|
||||
// accordance with the commercial license agreement provided with the software.
|
||||
//
|
||||
// This file is provided AS IS with NO WARRANTY OF ANY KIND, INCLUDING THE
|
||||
// WARRANTY OF DESIGN, MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE.
|
||||
// This software and related documentation is part of an INTERNAL release
|
||||
// of the Computational Geometry Algorithms Library (CGAL). It is not
|
||||
// intended for general use.
|
||||
//
|
||||
// ----------------------------------------------------------------------------
|
||||
//
|
||||
// Library : LiS
|
||||
// File : test/Handle.C
|
||||
// LiS_release : $Name: $
|
||||
// Revision : $Revision$
|
||||
// Revision_date : $Date$
|
||||
//
|
||||
// $URL$
|
||||
// $Id$
|
||||
// Author(s) : Michael Seel <seel@mpi-inf.mpg.de>
|
||||
// Arno Eigenwillig <arno@mpi-inf.mpg.de>
|
||||
// Lutz Kettner <kettner@mpi-inf.mpg.de>
|
||||
|
|
@ -52,11 +38,11 @@ struct Int_t : public ::CGAL::Handle_with_policy< Int_rep, Unify > {
|
|||
// test initialize_with
|
||||
this->initialize_with( i, j + k);
|
||||
}
|
||||
|
||||
// This is needed to prevent VC7.1 and VC8 to call
|
||||
|
||||
// This is needed to prevent VC7.1 and VC8 to call
|
||||
// the explicit templated constructor in Base instead of its copy-ctor.
|
||||
Int_t( Int_t const& rhs ) : Base( static_cast<Base const&>(rhs) ) {}
|
||||
|
||||
|
||||
int value() const { return this->ptr()->val; }
|
||||
void set_value( int i) {
|
||||
this->copy_on_write();
|
||||
|
|
@ -268,8 +254,8 @@ void test_handle() {
|
|||
template <class Policy, class Alloc>
|
||||
struct Int_vrep : public Policy::template Hierarchy_base< Alloc>::Type {
|
||||
int val;
|
||||
virtual CGAL::Reference_counted_hierarchy<Alloc>* clone() {
|
||||
return new Int_vrep( *this);
|
||||
virtual CGAL::Reference_counted_hierarchy<Alloc>* clone() {
|
||||
return new Int_vrep( *this);
|
||||
}
|
||||
virtual int get_val() const { return val; }
|
||||
virtual void set_val( int i) { val = i; }
|
||||
|
|
@ -279,7 +265,7 @@ struct Int_vrep : public Policy::template Hierarchy_base< Alloc>::Type {
|
|||
template <class Policy, class Alloc>
|
||||
struct Int_vrep2 : public Int_vrep<Policy,Alloc> {
|
||||
int val2;
|
||||
virtual ::CGAL::Reference_counted_hierarchy<Alloc>* clone() {
|
||||
virtual ::CGAL::Reference_counted_hierarchy<Alloc>* clone() {
|
||||
return new Int_vrep2( *this);
|
||||
}
|
||||
virtual int get_val() const { return this->val + val2; }
|
||||
|
|
@ -305,7 +291,7 @@ struct Int_vt : public ::CGAL::Handle_with_policy< Int_vrep<Unify,Alloc>, Unify
|
|||
Int_vt( int i, int j) : Base( new Int_vrep2<Unify,Alloc>(i,j)) {}
|
||||
Int_vt( int i, int j, int k) : Base( new Int_vrep3<Unify,Alloc>(i,j,k)) {}
|
||||
|
||||
// This is needed to prevent VC7.1 and VC8 to call
|
||||
// This is needed to prevent VC7.1 and VC8 to call
|
||||
// the explicit templated constructor in Base instead of its copy-ctor.
|
||||
Int_vt( Int_vt const& rhs ) : Base( static_cast<Base const&>(rhs) ) {}
|
||||
|
||||
|
|
@ -326,7 +312,7 @@ struct Int_vt : public ::CGAL::Handle_with_policy< Int_vrep<Unify,Alloc>, Unify
|
|||
|
||||
void test_handle_with_class_hierarchy() {
|
||||
{ // test template constructor and initialize_with
|
||||
typedef Int_vt< ::CGAL::Handle_policy_no_union> Int;
|
||||
typedef Int_vt< ::CGAL::Handle_policy_no_union> Int;
|
||||
Int i(5,6);
|
||||
CGAL_test_assert( i == Int(11));
|
||||
Int j(5,6,7);
|
||||
|
|
|
|||
|
|
@ -1,26 +1,12 @@
|
|||
// ============================================================================
|
||||
//
|
||||
// Copyright (c) 2001-2006 Max-Planck-Institut Saarbruecken (Germany).
|
||||
// All rights reserved.
|
||||
//
|
||||
// This file is part of EXACUS (http://www.mpi-inf.mpg.de/projects/EXACUS/);
|
||||
// you may redistribute it under the terms of the Q Public License version 1.0.
|
||||
// See the file LICENSE.QPL distributed with EXACUS.
|
||||
//
|
||||
// Licensees holding a valid commercial license may use this file in
|
||||
// accordance with the commercial license agreement provided with the software.
|
||||
//
|
||||
// This file is provided AS IS with NO WARRANTY OF ANY KIND, INCLUDING THE
|
||||
// WARRANTY OF DESIGN, MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE.
|
||||
// This software and related documentation is part of an INTERNAL release
|
||||
// of the Computational Geometry Algorithms Library (CGAL). It is not
|
||||
// intended for general use.
|
||||
//
|
||||
// ----------------------------------------------------------------------------
|
||||
//
|
||||
// Library : LiS
|
||||
// File : test/algorithm_test.C
|
||||
// LiS_release : $Name: $
|
||||
// Revision : $Revision$
|
||||
// Revision_date : $Date$
|
||||
//
|
||||
// $URL$
|
||||
// $Id$
|
||||
// Author(s) : Lutz Kettner <kettner@mpi-inf.mpg.de>
|
||||
// Arno Eigenwillig <arno@mpi-inf.mpg.de>
|
||||
//
|
||||
|
|
@ -67,7 +53,7 @@ void test_output_range() {
|
|||
CGAL_test_assert(os.str() == "");
|
||||
CGAL_test_assert(sp == &os);
|
||||
os.str("");
|
||||
|
||||
|
||||
sp = &(CGAL::output_range(os, A, A+1, ":", "(", ")"));
|
||||
CGAL_test_assert(os.str() == "(1)");
|
||||
CGAL_test_assert(sp == &os);
|
||||
|
|
@ -88,7 +74,7 @@ void test_output_range() {
|
|||
int main() {
|
||||
test_lex_compare();
|
||||
test_output_range();
|
||||
|
||||
|
||||
return EXIT_SUCCESS;
|
||||
}
|
||||
|
||||
|
|
|
|||
Loading…
Reference in New Issue