GNodeArray.i
4.4 KB
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
/***************************************************************************
* GNodeArray.i - Array of nodes class *
* ----------------------------------------------------------------------- *
* copyright (C) 2008-2014 by Juergen Knoedlseder *
* ----------------------------------------------------------------------- *
* *
* This program 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. *
* *
* This program 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 this program. If not, see <http://www.gnu.org/licenses/>. *
* *
***************************************************************************/
/**
* @file GNodeArray.i
* @brief Node array class interface definition
* @author Juergen Knoedlseder
*/
%{
/* Put headers and other declarations here that are needed for compilation */
#include "GNodeArray.hpp"
%}
/***********************************************************************//**
* @class GNodeArray
*
* @brief Node array class
***************************************************************************/
class GNodeArray : public GContainer {
public:
// Constructors and destructors
GNodeArray(void);
explicit GNodeArray(const int& num, const double* array);
explicit GNodeArray(const GVector& vector);
explicit GNodeArray(const std::vector<double>& vector);
GNodeArray(const GNodeArray& array);
virtual ~GNodeArray(void);
// Methods
void clear(void);
GNodeArray* clone(void) const;
double& at(const int& index);
int size(void) const;
bool is_empty(void) const;
void append(const double& node);
void insert(const int& index, const double& node);
void remove(const int& index);
void reserve(const int& num);
void extend(const GNodeArray& nodes);
void nodes(const int& num, const double* array);
void nodes(const GVector& vector);
void nodes(const std::vector<double>& vector);
double interpolate(const double& value,
const std::vector<double>& vector) const;
void set_value(const double& value) const;
const int& inx_left(void) const;
const int& inx_right(void) const;
const double& wgt_left(void) const;
const double& wgt_right(void) const;
void load(const std::string& filename,
const std::string& extname = "NODES");
void save(const std::string& filename, const bool& clobber = false,
const std::string& extname = "NODES") const;
void read(const GFitsTable& table);
void write(GFits& file,
const std::string& extname = "NODES") const;
};
/***********************************************************************//**
* @brief GNodeArray class extension
***************************************************************************/
%extend GNodeArray {
double __getitem__(const int& index) {
if (index >= 0 && index < self->size()) {
return (*self)[index];
}
else {
throw GException::out_of_range("__getitem__(int)", index, self->size());
}
}
void __setitem__(const int& index, const double& val) {
if (index>=0 && index < self->size()) {
(*self)[index] = val;
return;
}
else {
throw GException::out_of_range("__setitem__(int)", index, self->size());
}
}
GNodeArray copy() {
return (*self);
}
};