Lines Matching defs:areas
66 std::vector<double> areas(Np);
68 for (std::size_t i = 0; i < areas.size(); ++i)
70 areas[i] = (p[i]+p[i+1])*(b[i+1]-b[i])/2;
71 S += areas[i];
73 for (std::size_t i = 0; i < areas.size(); ++i)
74 areas[i] /= S;
83 a += areas[j];
117 std::vector<double> areas(Np);
119 for (std::size_t i = 0; i < areas.size(); ++i)
121 areas[i] = (p[i]+p[i+1])*(b[i+1]-b[i])/2;
122 S += areas[i];
124 for (std::size_t i = 0; i < areas.size(); ++i)
125 areas[i] /= S;
134 a += areas[j];
168 std::vector<double> areas(Np);
170 for (std::size_t i = 0; i < areas.size(); ++i)
172 areas[i] = (p[i]+p[i+1])*(b[i+1]-b[i])/2;
173 S += areas[i];
175 for (std::size_t i = 0; i < areas.size(); ++i)
176 areas[i] /= S;
185 a += areas[j];
219 std::vector<double> areas(Np);
221 for (std::size_t i = 0; i < areas.size(); ++i)
223 areas[i] = (p[i]+p[i+1])*(b[i+1]-b[i])/2;
224 S += areas[i];
226 for (std::size_t i = 0; i < areas.size(); ++i)
227 areas[i] /= S;
236 a += areas[j];
271 std::vector<double> areas(Np);
273 for (std::size_t i = 0; i < areas.size(); ++i)
276 areas[i] = (p[i]+p[i+1])*(b[i+1]-b[i])/2;
277 S += areas[i];
279 for (std::size_t i = 0; i < areas.size(); ++i)
280 areas[i] /= S;
289 a += areas[j];
324 std::vector<double> areas(Np);
326 for (std::size_t i = 0; i < areas.size(); ++i)
328 areas[i] = (p[i]+p[i+1])*(b[i+1]-b[i])/2;
329 S += areas[i];
331 for (std::size_t i = 0; i < areas.size(); ++i)
332 areas[i] /= S;
341 a += areas[j];