2
/// This file is part of Rheolef.
4
/// Copyright (C) 2000-2009 Pierre Saramito <Pierre.Saramito@imag.fr>
6
/// Rheolef is free software; you can redistribute it and/or modify
7
/// it under the terms of the GNU General Public License as published by
8
/// the Free Software Foundation; either version 2 of the License, or
9
/// (at your option) any later version.
11
/// Rheolef is distributed in the hope that it will be useful,
12
/// but WITHOUT ANY WARRANTY; without even the implied warranty of
13
/// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
14
/// GNU General Public License for more details.
16
/// You should have received a copy of the GNU General Public License
17
/// along with Rheolef; if not, write to the Free Software
18
/// Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
20
/// =========================================================================
22
// draft-1 version of the geo_element class with arbitrarily order
23
// solution with std::vector inside each geo_element
26
// - souplesse : gere la memoire en tas dans geo (efficace)
27
// mais aussi peut creer des elements temporaires, si besoin
28
// - inconvenient : tableau de geo_element, qui contiennent des tableaux
29
// alloues dynamiquement => la memoire n'est pas contigue globalement
31
#include "rheolef/config.h"
32
#ifndef _RHEOLEF_HAVE_MPI
33
int main() { return 0; }
34
#else // _RHEOLEF_HAVE_MPI
36
#include "rheolef/hack_array.h"
37
#include "rheolef/geo_element.h"
38
using namespace rheolef;
41
int main(int argc, char**argv)
43
environment distributed (argc, argv);
44
check_macro (communicator().size() == 2, "expect nproc = 2");
45
size_t iproc = (argc > 1) ? atoi(argv[1]) : 0;
48
distributor ownership (n, communicator(), distributor::decide);
49
geo_element::parameter_type param (reference_element::e, order); // edge, order=read
50
hack_array<geo_element_hack> ge_e (ownership, param);
52
set<size_t> set_ext_idx;
53
size_t jproc = (communicator().rank() == 0) ? 1 : 0;
54
for (size_t dis_i = ownership.first_index(jproc), dis_n = ownership.last_index(jproc); dis_i < dis_n; dis_i++) {
55
set_ext_idx.insert (dis_i);
57
ge_e.set_dis_indexes (set_ext_idx);
58
if (size_t(communicator().rank()) == iproc) {
59
cout << ge_e.dis_size() << " " << order << endl;
60
for (size_t dis_i = 0, dis_n = ge_e.dis_size(); dis_i < dis_n; dis_i++) {
61
cout << ge_e.dis_at (dis_i) << endl;
65
#endif // _RHEOLEF_HAVE_MPI