PPL Java Language Interface
1.2
|
A powerset of C_Polyhedron objects. More...
Public Member Functions | |
Ad Hoc Functions for Pointset_Powerset domains | |
native void | omega_reduce () |
Drops from the sequence of disjuncts in this all the non-maximal elements, so that a non-redundant powerset if obtained. More... | |
native long | size () |
Returns the number of disjuncts. More... | |
native boolean | geometrically_covers (Pointset_Powerset_C_Polyhedron y) |
Returns true if and only if this geometrically covers y . More... | |
native boolean | geometrically_equals (Pointset_Powerset_C_Polyhedron y) |
Returns true if and only if this is geometrically equal to y . More... | |
native Pointset_Powerset_C_Polyhedron_Iterator | begin_iterator () |
Returns an iterator referring to the beginning of the sequence of disjuncts of this . More... | |
native Pointset_Powerset_C_Polyhedron_Iterator | end_iterator () |
Returns an iterator referring to past the end of the sequence of disjuncts of this . More... | |
native void | add_disjunct (C_Polyhedron d) |
Adds to this a copy of disjunct d . More... | |
native void | drop_disjunct (Pointset_Powerset_C_Polyhedron_Iterator iter) |
Drops from this the disjunct referred by iter ; returns an iterator referring to the disjunct following the dropped one. More... | |
native void | drop_disjuncts (Pointset_Powerset_C_Polyhedron_Iterator first, Pointset_Powerset_C_Polyhedron_Iterator last) |
Drops from this all the disjuncts from first to last (excluded). More... | |
native void | pairwise_reduce () |
Modifies this by (recursively) merging together the pairs of disjuncts whose upper-bound is the same as their set-theoretical union. More... | |
Additional Inherited Members | |
![]() | |
PPL_Object () | |
Builds an object that points to `null'. More... | |
A powerset of C_Polyhedron objects.
The powerset domains can be instantiated by taking as a base domain any fixed semantic geometric description (C and NNC polyhedra, BD and octagonal shapes, boxes and grids). An element of the powerset domain represents a disjunctive collection of base objects (its disjuncts), all having the same space dimension.
Besides the methods that are available in all semantic geometric descriptions (whose documentation is not repeated here), the powerset domain also provides several ad hoc methods. In particular, the iterator types allow for the examination and manipulation of the collection of disjuncts.
Definition at line 1186 of file Fake_Class_for_Doxygen.java.
native void parma_polyhedra_library.Pointset_Powerset_C_Polyhedron.add_disjunct | ( | C_Polyhedron | d | ) |
Adds to this
a copy of disjunct d
.
native Pointset_Powerset_C_Polyhedron_Iterator parma_polyhedra_library.Pointset_Powerset_C_Polyhedron.begin_iterator | ( | ) |
Returns an iterator referring to the beginning of the sequence of disjuncts of this
.
native void parma_polyhedra_library.Pointset_Powerset_C_Polyhedron.drop_disjunct | ( | Pointset_Powerset_C_Polyhedron_Iterator | iter | ) |
Drops from this
the disjunct referred by iter
; returns an iterator referring to the disjunct following the dropped one.
native void parma_polyhedra_library.Pointset_Powerset_C_Polyhedron.drop_disjuncts | ( | Pointset_Powerset_C_Polyhedron_Iterator | first, |
Pointset_Powerset_C_Polyhedron_Iterator | last | ||
) |
Drops from this
all the disjuncts from first
to last
(excluded).
native Pointset_Powerset_C_Polyhedron_Iterator parma_polyhedra_library.Pointset_Powerset_C_Polyhedron.end_iterator | ( | ) |
Returns an iterator referring to past the end of the sequence of disjuncts of this
.
native boolean parma_polyhedra_library.Pointset_Powerset_C_Polyhedron.geometrically_covers | ( | Pointset_Powerset_C_Polyhedron | y | ) |
Returns true
if and only if this
geometrically covers y
.
native boolean parma_polyhedra_library.Pointset_Powerset_C_Polyhedron.geometrically_equals | ( | Pointset_Powerset_C_Polyhedron | y | ) |
Returns true
if and only if this
is geometrically equal to y
.
native void parma_polyhedra_library.Pointset_Powerset_C_Polyhedron.omega_reduce | ( | ) |
Drops from the sequence of disjuncts in this
all the non-maximal elements, so that a non-redundant powerset if obtained.
native void parma_polyhedra_library.Pointset_Powerset_C_Polyhedron.pairwise_reduce | ( | ) |
Modifies this
by (recursively) merging together the pairs of disjuncts whose upper-bound is the same as their set-theoretical union.
native long parma_polyhedra_library.Pointset_Powerset_C_Polyhedron.size | ( | ) |
Returns the number of disjuncts.
If present, Omega-redundant elements will be counted too.