summaryrefslogtreecommitdiffstats
path: root/rasodmg/test/test_dirtiling.cc
blob: 3cc57dc9e9d5a239efc4bafb7d293c9288064b71 (plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
/*
* This file is part of rasdaman community.
*
* Rasdaman community is free software: you can redistribute it and/or modify
* it under the terms of the GNU General Public License as published by
* the Free Software Foundation, either version 3 of the License, or
* (at your option) any later version.
*
* Rasdaman community is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
* GNU General Public License for more details.
*
* You should have received a copy of the GNU General Public License
* along with rasdaman community.  If not, see <http://www.gnu.org/licenses/>.
*
* Copyright 2003, 2004, 2005, 2006, 2007, 2008, 2009 Peter Baumann /
rasdaman GmbH.
*
* For more information please see <http://www.rasdaman.org>
* or contact Peter Baumann via <baumann@rasdaman.com>.
/
/**
 * SOURCE: test_dirtiling.cc
 *
 * MODULE: rasodmg
 *
 * PURPOSE: test class r_Dir_Tiling.
 *
 * COMMENTS:
 *			None
*/


#include <iostream>
#include <stdio.h>
#include "rasodmg/marray.hh"
#include "rasodmg/tiling.hh"
#include "rasodmg/dirtiling.hh"
#include "rasodmg/dirdecompose.hh"
#include "raslib/dlist.hh"

int main(int argc, char* argv[])
{
  int tilesize = 10000;

  // Get tile size
  if (argc == 2)
    tilesize = atoi(argv[1]);

  // Create a domain decomposition

  r_Dir_Decompose decomp[2];
  decomp[0] << 0 << 50 << 200 << 600 << 700 << 950 << 999;

  r_Dir_Tiling tiling(2, decomp, tilesize);
  tiling.print_status(cout);

  cout << endl << "----- Domain decomposition -----" << endl;

  // Create a domain and an image

  r_Minterval domain(2);
  domain << r_Sinterval(0L, 999L) << r_Sinterval(0L, 99L);

  r_Marray<char> image(domain);

  // Compute tiles

  DList<r_Minterval>* tiles = tiling.compute_tiles(domain, sizeof(char));

  // Output the information

  cout << "Domain: " << domain << endl << endl;
  cout << "Tiles:  " << endl;

  DListIterator<r_Minterval> it = tiles->create_iterator();
  for (; it.not_done(); it++)
  {
    r_Minterval inter = *it;
    cout << "   " << inter << endl;
  }

  delete tiles;
}