|
BWAPI
|
#include <CGAL/basic.h>#include <CGAL/memory.h>#include <CGAL/type_traits.h>#include <boost/static_assert.hpp>#include <boost/mpl/if.hpp>#include <cstddef>

Go to the source code of this file.
Classes | |
| class | Reference_counted< T > |
the base class for bodies of reference counted representations T. More... | |
| class | Reference_counted_with_forwarding< T > |
Base class for bodies of reference counted representations T with a forwarding pointer for identical representations. More... | |
| struct | Reference_counted_hierarchy_base |
| class | Reference_counted_hierarchy< Allocator_ > |
Base class for reference counted representations with a class hierarchy of different representations. Needs an allocator for char's as parameter. More... | |
| class | Reference_counted_hierarchy_with_union< Allocator_ > |
Base class for reference counted representations with a class hierarchy of different representations. Needs an allocator for char's as parameter. More... | |
| struct | Intern::Rep_bind_reference_counted< T, HandleHierarchyPolicy > |
| struct | Intern::Rep_bind_reference_counted< T, true > |
| struct | Intern::Rep_bind_reference_counted_with_forwarding< T, HandleHierarchyPolicy > |
| struct | Intern::Rep_bind_reference_counted_with_forwarding< T, true > |
| class | Handle_policy_in_place |
Policy class for Handle_with_policy that stores the representation directly without reference counting and without dynamic memory allocation, is actually not a model of the HandlePolicy concept, but can be used instead of one. It selects a different specialized implementation of Handle_with_policy. It works only with the single representation type, not with a class hierarchy of representation types since they need the pointer in the handle for the polymorphy. More... | |
| class | Handle_policy_no_union |
Policy class for Handle_with_policy<T> that ignores unifying of identical representations T, is a model of the HandlePolicy concept. More... | |
| struct | Handle_policy_no_union::Rep_bind< T, hierarchy > |
| A rebind mechanism to create the representation type. More... | |
| struct | Handle_policy_no_union::Hierarchy_base< Alloc > |
| A rebind mechanism to access the base class for class hierarchies of representations. More... | |
| class | Handle_policy_union |
Policy class for Handle_with_policy that implements unifying of identical representations T with trees and path compression, is a model of the HandlePolicy concept. More... | |
| struct | Handle_policy_union::Rep_bind< T, hierarchy > |
| A rebind mechanism to create the representation type. More... | |
| struct | Handle_policy_union::Hierarchy_base< Alloc > |
| A rebind mechanism to access the base class for class hierarchies of representations. More... | |
| class | Handle_policy_union_and_reset |
Policy class for Handle_with_policy that implements unifying of identical representations T with trees and path compression. More... | |
| struct | Handle_policy_union_and_reset::Rep_bind< T, hierarchy > |
| A rebind mechanism to create the representation type. More... | |
| struct | Handle_policy_union_and_reset::Hierarchy_base< Alloc > |
| A rebind mechanism to access the base class for class hierarchies of representations. More... | |
| class | Handle_with_policy< T, HandlePolicy, Allocator_ > |
the base class for handles of reference counted representations of T. More... | |
| class | Handle_with_policy< T, Handle_policy_in_place, Allocator_ > |
specialization of the base class for handles for non-reference counted representations. Uses LEDA_MEMORY if available. More... | |
| class | Handle_id_less_than< Handle, Less > |
Namespaces | |
| namespace | Intern |
Functions | |
| template<class T , class A > | |
| unsigned long | ID_Number (const Handle_with_policy< T, Handle_policy_no_union, A > &h) |
alternative syntax for h.id() to allow use with LEDA | |
| unsigned long ID_Number | ( | const Handle_with_policy< T, Handle_policy_no_union, A > & | h | ) |
alternative syntax for h.id() to allow use with LEDA
This is only provided for Handle_policy_no_union because ID numbers have to be fixed throughout an object's lifetime.

1.7.6.1