Memory Methods on Triang1d

 

   

GRAPE(triang1d, "free")()

TRIANG1D *triang1d

The associated memory of the instance variables is freed up and the instance is deleted. For a more detailed description of this method and its usage consult the description of the "delete" method (5.4.4.1).

       

GRAPE(triang1d, "list-alloc")(max_points)

GRAPE(triang1d, "list-growto")(max_points)

GRAPE(triang1d, "list-free")()

TRIANG1D *triang1d
int max_points

"list-alloc" allocates or resizes memory for max_points points for the coordinate lists. "list-growto" assures that at least max_points points are available, by calling "list-alloc" only if triang1d-> max_number_of_points < max_points. "list-free" frees the memory for the coordinate lists and sets triang1d-> max_number_of_points to 0. For a description of the general concept see 5.4.4.2.

   

GRAPE(triang1d, "list-shrink-send")()

TRIANG1D *triang1d

Free unused space of the vertex lists: resize the vertex lists to hold exactly triang1d->number_of_points points. This is done by calling "list-alloc" with this value as max_points argument.

This method is called by

   GRAPE(triang1d, "optimize-mem-send")()

TRIANG1D * triang1d

Free unused space of the vertex lists.

   

GRAPE(triang1d, "hardcopy")()

TRIANG1D *triang1d

Create an identical copy of triang1d which has its own lists (all data is copied). The pointer to the new instance is returned.

   

GRAPE(triang1d, "softcopy")(t1_copy)

TRIANG1D *triang1d, *t1_copy

Make a softcopy of a Triang1d instance: like "hardcopy" but only the used data (up to number_of_points) is copied. If t1_copy is not NULL then this instance is used to store the copy otherwise a new instance is created.

   

(int *)GRAPE(t1_one, "merge")(t1_two)

TRIANG1D *t1_one, *t1_two

Merge two Triang1d instances: append the vertex lists of t1_two to those of t1_one. t1_two is left untouched. If the method fails, it returns NULL. Both z vectors of t1_one and t1_two may be NULL, but only at the same time.

This method is designed to merge curves, it requires the last vertex of t1_one to be equal to the first vertex of t1_two.