30 for (
int n_bord=0; n_bord<nb_bord; n_bord++)
36 int num2 = num1 + nb_faces;
41 IntVect fait(nb_faces);
44 for (face=num1; face<num2; face++)
46 if (fait(face-num1) == 0)
50 fait(face_associee) = 1;
51 for (
int comp=0; comp<nb_comp; comp++)
54 bilan[comp]+=dudt(face);
56 bilan[comp]+=dudt(face,comp);
61 else if ( (sub_type(
Dirichlet,la_cl.valeur())) ||
79 for (face=num1; face<num2; face++)
81 for (
int comp=0; comp<nb_comp; comp++)
84 bilan[comp]+=dudt(face);
86 bilan[comp]+=dudt(face,comp);
95 for(face=prems; face<nb_faces; face++)
97 for (
int comp=0; comp<nb_comp; comp++)
100 bilan[comp]+=dudt(face);
102 bilan[comp]+=dudt(face,comp);
116 for (
int n_bord=0; n_bord<nb_bord; n_bord++)
122 int num2 = num1 + nb_faces;
127 IntVect fait(nb_faces);
130 for (face=num1; face<num2; face++)
132 if (fait(face-num1) == 0)
136 fait(face_associee) = 1;
137 for (
int comp=0; comp<nb_comp; comp++)
140 bilan[comp]+=dudt(face)*u(face);
142 bilan[comp]+=dudt(face,comp)*u(face,comp);
147 else if ( (sub_type(
Dirichlet,la_cl.valeur())) ||
165 for (face=num1; face<num2; face++)
167 for (
int comp=0; comp<nb_comp; comp++)
170 bilan[comp]+=dudt(face)*u(face);
172 bilan[comp]+=dudt(face,comp)*u(face,comp);
181 for(face=prems; face<nb_faces; face++)
183 for (
int comp=0; comp<nb_comp; comp++)
186 bilan[comp]+=dudt(face)*u(face);
188 bilan[comp]+=dudt(face,comp)*u(face,comp);
int nb_cond_lim() const
Returns the number of boundary conditions.
Domaine_dis_base & domaine_dis()
Returns a reference to the discretized domain associated with the boundary conditions.
const Cond_lim & les_conditions_limites(int) const
Returns the i-th boundary condition.
int nb_faces_tot() const
Returns the total number of faces.
int premiere_face_int() const
A face is internal if and only if it separates two elements.