/
Swept2DUtils.h
62 lines (56 loc) · 1.79 KB
/
Swept2DUtils.h
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
// This file is part of Swept2D
// Copyright (C) 2015 Qiqi Wang, qiqi@mit.edu AND Maitham Alhubail, hubailmm@mit.edu
//
// This program is free software: you can redistribute it and/or modify
// it under the terms of the GNU Affero General Public License as
// published by the Free Software Foundation, either version 3 of the
// License, or (at your option) an later version.
//
// This program is distributed in the hope that it will be useful,
// but WITHOUT An WARRANTY; without even the implied warranty of
// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
// GNU Affero General Public License for more details.
//
// You should have received a copy of the GNU Affero General Public License
// along with this program. If not, see <http://www.gnu.org/licenses/>.
#ifndef H_SWEPT2DUTILS
#define H_SWEPT2DUTILS
class Swept2DUtils
{
public:
static inline int ijToIndex(int n,int i,int j,int substeps,int dataPointSize,int constants)
{
int index = j * n + i;
int constToAdd = (index * constants);
index = index * substeps * dataPointSize;
index += constToAdd;
return index;
}
static inline int getShrinkingIndex(int n,int level,int substeps,int dataPointSize,int constants)
{
int indexStart = 0;
for(int c=0;c<level;c++)
{
indexStart += (n-2) - (2*c);
}
indexStart *= 2;
int constantsToAdd = indexStart * constants;
indexStart *= (substeps * dataPointSize);
indexStart += constantsToAdd;
return indexStart;
}
static inline int getGrowingIndex(int n,int level,int substeps,int dataPointSize,int constants)
{
int indexStart = 0;
for(int c=0;c<=level;c++)
{
indexStart += (2*c);
}
indexStart *= 2;
int constantsToAdd = indexStart * constants;
indexStart *= (substeps * dataPointSize);
indexStart += constantsToAdd;
return indexStart;
}
};
#endif