#include <source/hierarchy/boxes/BoxGraphUtilities.h>
Static Public Member Functions | |
static void | makeBoxesPlusPeriodicBoxes (BoxArray< DIM > &out_boxes, const BoxArray< DIM > &in_boxes, const tbox::Array< tbox::List< IntVector< DIM > > > &shifts) |
Returns an array of boxes that includes entries for each box that touches a periodic boundary. | |
static void | makeBoxesPlusPeriodicBoxes (BoxArray< DIM > &out_boxes, tbox::Array< int > &out_indices, const BoxArray< DIM > &in_boxes, const tbox::Array< tbox::List< IntVector< DIM > > > &shifts) |
Returns an array of boxes that includes entries for each box that touches a periodic boundary. | |
static int | countPeriodicBoxes (const tbox::Array< tbox::List< IntVector< DIM > > > &shifts) |
Returns the sum of shifts[j].getNumberItems(). | |
static int | qsortIntCompare (const void *v, const void *w) |
Compare function for use with qsort when sorting integers in ascending order. |
* * --------------------------- * | | * | | * | | * |------------- |------------- * | this | | the virtual| * | box touches| | wrap around| * | a periodic | | box | * | boundary | | | * |------------- |------------- * | | * | domain | * | box | * --------------------------- * *
The BoxTop, BoxGraph, and possibly other classes require as input arrays of boxes in which the "virtual" boxes are explicitly represented.
|
Returns an array of boxes that includes entries for each box that touches a periodic boundary. The shift array must either have zero length, or have the same length as in_boxes, otherwise an unrecoverable error will be thrown.
|
|
Returns an array of boxes that includes entries for each box that touches a periodic boundary. The shift array must either have zero length, or have the same length as in_boxes, otherwise an unrecoverable error will be thrown.
|
|
Returns the sum of shifts[j].getNumberItems(). This function is called by makeBoxesPlusPeriodicBoxes().
|
|
Compare function for use with qsort when sorting integers in ascending order. Sample usage:
* intarray[len]; * ... * qsort(array, len, sizeof(int), qsortIntCompare); * |