#include <CGAL/basic.h>
#include <CGAL/Handle.h>
#include <CGAL/Object.h>
#include <CGAL/Kernel/Type_mapper.h>
#include <CGAL/Profile_counter.h>
#include <CGAL/Kernel/Return_base_tag.h>
#include <CGAL/min_max_n.h>
#include <CGAL/Origin.h>
#include <vector>
#include <CGAL/Default.h>
#include <CGAL/Kernel/interface_macros.h>

Include dependency graph for Lazy.h:

This graph shows which files directly or indirectly include this file:

Go to the source code of this file.

Classes
struct	Depth_base
class	Lazy_rep< AT_, ET, E2A >
class	Lazy_rep_0< AT, ET, E2A >
class	Lazy_rep_1< AC, EC, E2A, L1 >
class	Lazy_rep_2< AC, EC, E2A, L1, L2 >
class	Lazy_rep_3< AC, EC, E2A, L1, L2, L3 >
class	Lazy_rep_4< AC, EC, E2A, L1, L2, L3, L4 >
class	Lazy_rep_5< AC, EC, E2A, L1, L2, L3, L4, L5 >
class	Lazy_rep_6< AC, EC, E2A, L1, L2, L3, L4, L5, L6 >
class	Lazy_rep_7< AC, EC, E2A, L1, L2, L3, L4, L5, L6, L7 >
class	Lazy_rep_8< AC, EC, E2A, L1, L2, L3, L4, L5, L6, L7, L8 >
struct	Approx_converter< K1, K2 >
struct	Exact_converter< K1, K2 >
class	Lazy_rep_with_vector_1< AC, EC, E2A, L1 >
class	Lazy_rep_with_vector_2< AC, EC, E2A, L1, L2 >
class	Lazy_rep_2_1< AC, EC, E2A, L1, L2, R1 >
class	Lazy_rep_2_2< AC, EC, E2A, L1, L2, R1, R2 >
class	Lazy< AT_, ET_, EFT, E2A >
struct	Lazy_construction_bbox< LK, AC, EC >
struct	Lazy_construction_nt< LK, AC, EC >
struct	Ith< T2 >
struct	Lazy_cartesian_const_iterator_2< LK, AC, EC >
struct	Lazy_cartesian_const_iterator_3< LK, AC, EC >
struct	Lazy_functor_2_1< LK, AK, EK, AC, EC, EFT, E2A >
struct	First< T >
struct	Second< T >
struct	Lazy_functor_2_2< LK, AC, EC >
struct	Lazy_intersect_with_iterators< LK, AC, EC >
struct	Object_cast< T >
struct	Lazy_construction_object< LK, AC, EC >
struct	Lazy_construction< LK, AC, EC, E2A_ >
Defines
#define	CGAL_LAZY_FORWARD(T)
#define	CGAL_Kernel_obj(X)
#define	CGAL_Kernel_obj(X)
#define	CGAL_Kernel_obj(X)
#define	CGAL_Kernel_obj(X)
Functions
template<typename AT , typename ET , typename EFT , typename E2A >
const AT &	approx (const Lazy< AT, ET, EFT, E2A > &l)
template<typename AT , typename ET , typename EFT , typename E2A >
AT &	approx (Lazy< AT, ET, EFT, E2A > &l)
template<typename AT , typename ET , typename EFT , typename E2A >
const ET &	exact (const Lazy< AT, ET, EFT, E2A > &l)
template<typename AT , typename ET , typename EFT , typename E2A >
unsigned	depth (const Lazy< AT, ET, EFT, E2A > &l)
template<typename LK >
Object	make_lazy (const Object &eto)

Define Documentation

#define CGAL_Kernel_obj ( X )

Value:

if (const typename EK::X* ptr = object_cast<typename EK::X>(&eto)) \
    return make_object(typename LK::X(new Lazy_rep_0<typename AK::X, typename EK::X, E2A>(*ptr)));

#define CGAL_Kernel_obj ( X )

Value:

if (object_cast<typename AK::X>(& (lv.approx()[i]))) { \
          *it++ = make_object(typename LK::X(new Lazy_rep_1<Ith<typename AK::X>, \
                                                                      Ith<typename EK::X>, E2A, Lazy_vector> \
                                                 (Ith<typename AK::X>(i), Ith<typename EK::X>(i), lv))); \
          continue; \
        }

#define CGAL_Kernel_obj ( X )

Value:

if (object_cast<typename AK::X>(& (lo.approx()))) { \
        typedef Lazy_rep_1<Object_cast<typename AK::X>, Object_cast<typename EK::X>, E2A, Lazy_object> Lcr; \
        Lcr * lcr = new Lcr(Object_cast<typename AK::X>(), Object_cast<typename EK::X>(), lo); \
        return make_object(typename LK::X(lcr)); \
      }

#define CGAL_Kernel_obj ( X )

Value:

if (object_cast<typename AK::X>(& (lo.approx()))) { \
        typedef Lazy_rep_1<Object_cast<typename AK::X>, Object_cast<typename EK::X>, E2A, Lazy_object> Lcr; \
        Lcr * lcr = new Lcr(Object_cast<typename AK::X>(), Object_cast<typename EK::X>(), lo); \
        return make_object(typename LK::X(lcr)); \
      }

#define CGAL_LAZY_FORWARD ( T )

Value:

inline const T & approx(const T& d) { return d; } \
  inline const T & exact (const T& d) { return d; } \
  inline unsigned  depth (const T&  ) { return 0; }