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
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
|
/*
* 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: miterd.cc
*
* MODULE: raslib
* CLASS: r_Miter
*
*/
#include <iostream>
#include "raslib/miterd.hh"
#include "raslib/minterval.hh"
r_MiterDirect::r_MiterDirect(void *data, const r_Minterval &total, const r_Minterval &iter, unsigned int tlen, unsigned int step)
: done(false),
dim(total.dimension()),
length(step),
id(NULL),
baseAddress(data)
{
int i = 0;
r_Range s = tlen;
r_Range offset = 0;
id=new r_miter_direct_data[dim];
for (i=(int)dim-1; i>=0; i--)
{
id[i].low = iter[i].low();
id[i].high = iter[i].high();
id[i].pos = id[i].low;
id[i].origin = total[i].low();
id[i].extent = (total[i].high() - total[i].low() + 1);
id[i].baseStep = s;
id[i].step = s * step;
offset += s * (id[i].pos - id[i].origin);
s *= id[i].extent;
}
for (i=0; i<(int)dim; i++)
{
id[i].data = (void*)(((r_Octet*)data) + offset);
}
}
r_MiterDirect::~r_MiterDirect(void)
{
delete [] id;
}
void r_MiterDirect::reset(void)
{
r_Dimension i = 0;
r_ULong offset = 0;
for (i=0; i<dim; i++)
{
id[i].pos = id[i].low;
offset += id[i].step * (id[i].low - id[i].origin);
}
for (i=0; i<dim; i++)
{
id[i].data = (void*)(((r_Octet*)baseAddress) + offset);
}
done = false;
}
void
r_MiterDirect::print_pos(std::ostream &str) const
{
str << '[' << id[0].pos;
for (r_Dimension i=1; i<dim; i++) str << ',' << id[i].pos;
str << ']';
}
std::ostream &operator<<(std::ostream &str, const r_MiterDirect &iter)
{
iter.print_pos(str);
return str;
}
r_miter_direct_data::r_miter_direct_data()
:data(NULL), pos(0), low(0), high(0),
step(0), baseStep(0), extent(0), origin(0)
{
}
r_miter_direct_data::~r_miter_direct_data()
{
}
|
