OilfieldToolsNet/opm-core
4
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity

Re-adjust comment white-space.

Browse Source
This commit is contained in:
Bård Skaflestad 2012-05-21 20:01:55 +02:00
parent b5920a0cce
commit 4f3600bbcc
1 changed files with 16 additions and 14 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

30
opm/core/transport/reorder/reordersequence.h
View File

@ -26,10 +26,11 @@ struct UnstructuredGrid;
* permutation. * permutation.
* *
* \param[in] flux Darcy flux field. One scalar value for each * \param[in] flux Darcy flux field. One scalar value for each
* interface/connection in the grid, including the boundary. We assume that * interface/connection in the grid, including the
* <CODE>flux[f]</CODE> is positive if the flow is * boundary. We assume that <CODE>flux[f]</CODE> is
* from cell <CODE>grid->face_cells[2*f + 0]</CODE> to * positive if the flow is from cell
* cell <CODE>grid->face_cells[2*f + 1]</CODE>. * <CODE>grid->face_cells[2*f + 0]</CODE> to cell
* <CODE>grid->face_cells[2*f + 1]</CODE>.
* *
* \param[out] sequence * \param[out] sequence
* Causal grid cell permutation. Ordered according to * Causal grid cell permutation. Ordered according to
@ -58,9 +59,9 @@ struct UnstructuredGrid;
* Number of strongly connected components. Pointer * Number of strongly connected components. Pointer
* to a single integer. The <CODE>components</CODE> * to a single integer. The <CODE>components</CODE>
* output are valid for all <CODE>i = 0 * output are valid for all <CODE>i = 0
* ... *ncomponents - 1</CODE>. Furhtermore, the number of * ... *ncomponents - 1</CODE>. Furhtermore, the
* components must be in the interval <CODE>[1 * number of components must be in the interval
* .. grid->number_of_cells]</CODE>. * <CODE>[1 .. grid->number_of_cells]</CODE>.
*/ */
void void
compute_sequence(const struct UnstructuredGrid *grid , compute_sequence(const struct UnstructuredGrid *grid ,
@ -78,10 +79,11 @@ compute_sequence(const struct UnstructuredGrid *grid ,
* permutation. * permutation.
* *
* \param[in] flux Darcy flux field. One scalar value for each * \param[in] flux Darcy flux field. One scalar value for each
* interface/connection in the grid, including the boundary. We assume that * interface/connection in the grid, including the
* <CODE>flux[f]</CODE> is positive if the flow is * boundary. We assume that <CODE>flux[f]</CODE> is
* from cell <CODE>grid->face_cells[2*f + 0]</CODE> to * positive if the flow is from cell
* cell <CODE>grid->face_cells[2*f + 1]</CODE>. * <CODE>grid->face_cells[2*f + 0]</CODE> to cell
* <CODE>grid->face_cells[2*f + 1]</CODE>.
* *
* \param[out] sequence * \param[out] sequence
* Causal grid cell permutation. Ordered according to * Causal grid cell permutation. Ordered according to
@ -110,9 +112,9 @@ compute_sequence(const struct UnstructuredGrid *grid ,
* Number of strongly connected components. Pointer * Number of strongly connected components. Pointer
* to a single integer. The <CODE>components</CODE> * to a single integer. The <CODE>components</CODE>
* output are valid for all <CODE>i = 0 * output are valid for all <CODE>i = 0
* ... *ncomponents - 1</CODE>. Furhtermore, the number of * ... *ncomponents - 1</CODE>. Furhtermore, the
* components must be in the interval <CODE>[1 * number of components must be in the interval
* .. grid->number_of_cells]</CODE>. * <CODE>[1 .. grid->number_of_cells]</CODE>.
* *
* \param[out] ia Indirection pointers into <CODE>ja</CODE> that * \param[out] ia Indirection pointers into <CODE>ja</CODE> that
* define the "upwind" cells that influence a * define the "upwind" cells that influence a