Module ppm_module_tree_divcheck

This module provides the routine that checks if a box is subdivisible.

Defined Types

name description

no types

Defined Module Interfaces

name description

ppm_tree_divcheck

Defined Module Subroutines

name description

no subroutines

Interface ppm_tree_divcheck

Subroutines contained in this interface:

name description

ppm_tree_divcheck_s

This routine checks how many dimensions of a box are divisible.

ppm_tree_divcheck_d

This routine checks how many dimensions of a box are divisible.

Subroutine ppm_tree_divcheck_d

This routine checks how many dimensions of a box are divisible.

[Note]Note

A box with cost 0 is counted as non-divisible.

Arguments

name type dimension intent optional description

min_box

real array

(:,:)

(IN)

Lower coordinates of the boxes.

max_box

real array

(:,:)

(IN)

Upper coordinates of the boxes.

nbox

integer

(IN)

Number of boxes to check

minboxsize

real array

(:)

(IN)

Minimum box size in all dimensions.

fixed

logical array

(:)

(IN)

Flags telling which dimensions are fixed (i.e. must not be divided).

boxcost

real array

(:)

(IN)

Costs associated with boxes

ndiv

integer array

(:)

Number of divisible directions of each box (1..nbox).

info

integer

(OUT)

Return status, 0 on success

min_box

real array, (:,:), (IN)

Lower coordinates of the boxes.

1st index: x,y[,z] 2nd: box ID

max_box

real array, (:,:), (IN)

Upper coordinates of the boxes.

1st index: x,y[,z] 2nd: box ID

nbox

integer, , (IN)

Number of boxes to check

minboxsize

real array, (:), (IN)

Minimum box size in all dimensions.

fixed

logical array, (:), (IN)

Flags telling which dimensions are fixed (i.e. must not be divided).

boxcost

real array, (:), (IN)

Costs associated with boxes

ndiv

integer array, (:), no intent declared

Number of divisible directions of each box (1..nbox).

info

integer, , (OUT)

Return status, 0 on success

Used Modules

ppm_module_data, ppm_module_error, ppm_module_write, ppm_module_substop, ppm_module_substart

Subroutine ppm_tree_divcheck_s

This routine checks how many dimensions of a box are divisible.

[Note]Note

A box with cost 0 is counted as non-divisible.

Arguments

name type dimension intent optional description

min_box

real array

(:,:)

(IN)

Lower coordinates of the boxes.

max_box

real array

(:,:)

(IN)

Upper coordinates of the boxes.

nbox

integer

(IN)

Number of boxes to check

minboxsize

real array

(:)

(IN)

Minimum box size in all dimensions.

fixed

logical array

(:)

(IN)

Flags telling which dimensions are fixed (i.e. must not be divided).

boxcost

real array

(:)

(IN)

Costs associated with boxes

ndiv

integer array

(:)

Number of divisible directions of each box (1..nbox).

info

integer

(OUT)

Return status, 0 on success

min_box

real array, (:,:), (IN)

Lower coordinates of the boxes.

1st index: x,y[,z] 2nd: box ID

max_box

real array, (:,:), (IN)

Upper coordinates of the boxes.

1st index: x,y[,z] 2nd: box ID

nbox

integer, , (IN)

Number of boxes to check

minboxsize

real array, (:), (IN)

Minimum box size in all dimensions.

fixed

logical array, (:), (IN)

Flags telling which dimensions are fixed (i.e. must not be divided).

boxcost

real array, (:), (IN)

Costs associated with boxes

ndiv

integer array, (:), no intent declared

Number of divisible directions of each box (1..nbox).

info

integer, , (OUT)

Return status, 0 on success

Used Modules

ppm_module_data, ppm_module_error, ppm_module_write, ppm_module_substop, ppm_module_substart

Defined Module Variables

name type dimension description

no variables

Used Modules

has no uses