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
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
|
/////////////////////////////////////////////////////////////
// //
// Copyright (c) 2003-2011 by The University of Queensland //
// Earth Systems Science Computational Centre (ESSCC) //
// http://www.uq.edu.au/esscc //
// //
// Primary Business: Brisbane, Queensland, Australia //
// Licensed under the Open Software License version 3.0 //
// http://www.opensource.org/licenses/osl-3.0.php //
// //
/////////////////////////////////////////////////////////////
#include <boost/version.hpp>
#include <boost/python.hpp>
#include "Python/esys/lsm/ParticleIdPairPy.h"
namespace esys
{
namespace lsm
{
ParticleIdPairPy::ParticleIdPairPy(int id1, int id2)
: Inherited(std::min(id1, id2), std::max(id1,id2))
{
}
ParticleIdPairPy::ParticleIdPairPy(const Inherited &pair)
: Inherited(
std::min(pair.first, pair.second),
std::max(pair.first, pair.second)
)
{
}
bool ParticleIdPairPy::operator<(const ParticleIdPairPy &pair) const
{
bool result = first < pair.first;
if (!result && (first == pair.first))
{
result = second < pair.second;
}
return result;
}
int ParticleIdPairPy::len() const
{
return 2;
}
int ParticleIdPairPy::getItem(int i)
{
const int origI = i;
if (i < 0)
{
i += len();
}
if ((i >= len()) || i < 0)
{
std::stringstream msg;
msg << "Index " << origI << " out of range.";
PyErr_SetString(PyExc_IndexError, msg.str().c_str());
boost::python::throw_error_already_set();
}
int item = INT_MIN;
if (i == 0)
{
item = first;
}
else if (i == 1)
{
item = second;
}
return item;
}
long ParticleIdPairPy::hash() const
{
return first*second;
}
boost::python::tuple
ParticleIdPairPy::PickleSuite::getinitargs(ParticleIdPairPy const& p)
{
return boost::python::make_tuple(p.first, p.second);
}
void exportParticleIdPair()
{
// Check that Boost 1.34.0 or higher is being used.
// If so, disable auto-generation of C++ signatures for Epydoc
// (which stumbles over indentation in the auto-generated strings).
#if ((BOOST_VERSION / 100000 >= 1) \
&& (BOOST_VERSION / 100 % 1000 >= 34)) \
|| (BOOST_VERSION / 100000 >= 2)
boost::python::docstring_options no_autogen(true,false);
#endif
boost::python::class_<ParticleIdPairPy>(
"ParticleIdPair",
"Pair of particle Id's.",
boost::python::init<int,int>(
(
boost::python::arg("id1"),
boost::python::arg("id2")
),
"Construct pair with specified id's.\n"
"@type id1: int\n"
"@kwarg id1: Particle Id.\n"
"@type id2: int\n"
"@kwarg id2: Particle Id.\n"
)
)
.def(
"__getitem__",
&ParticleIdPairPy::getItem,
(boost::python::arg("idx")),
"Returns id of indexed element.\n"
"@type idx: int\n"
"@kwarg idx: index value 0 or 1.\n"
)
.def(
"__len__",
&ParticleIdPairPy::len,
"Returns 2.\n"
"@rtype: int\n"
"@return: length of pair (always 2).\n"
)
.def(boost::python::self < boost::python::self)
.def(boost::python::self == boost::python::self)
.def("__hash__", &ParticleIdPairPy::hash)
.def_pickle(ParticleIdPairPy::PickleSuite())
;
}
}
}
|
