-
Notifications
You must be signed in to change notification settings - Fork 0
/
treedatapoint.cpp
152 lines (139 loc) · 3.75 KB
/
treedatapoint.cpp
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
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
//---------------------------------------------------------------------------
/*
RosindellEtAl2008, refactoring an extension of Rosindel at al., 2008 [1]
Copyright (C) 2015 Richel Bilderbeek
Original version by James Rosindell
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/>.
*/
//---------------------------------------------------------------------------
//From http://www.richelbilderbeek.nl/ToolRosindellEtAl2008.htm
//
//Article with original code:
//
// [1] Rosindell, James, Yan Wong, and Rampal S. Etienne.
// "A coalescence approach to spatial neutral ecology."
// Ecological Informatics 3.3 (2008): 259-271.
//---------------------------------------------------------------------------
#include "treedatapoint.h"
#include <cassert>
#include <ostream>
#include "tree.h"
TreeDataPoint::TreeDataPoint(
const int x,
const int y,
TreeNode * const node
)
:
m_xpos{x},
m_ypos{y},
m_xindex{0},
m_yindex{0},
m_node{node},
m_probability{1.0}
{
static_assert(TreeDataPoint::sm_gridsize == Tree::sm_gridsize,"");
}
TreeDataPoint::TreeDataPoint(
const TreeDataPoint& other
)
:
m_xpos{other.GetXpos()},
m_ypos{other.GetYpos()},
m_xindex{other.GetTileX()},
m_yindex{other.GetTileY()},
m_node{other.GetNode()},
m_probability{other.GetProbability()}
{
static_assert(TreeDataPoint::sm_gridsize == Tree::sm_gridsize,"");
}
TreeDataPoint& TreeDataPoint::operator=(
const TreeDataPoint& other
)
{
this->m_xpos = other.GetXpos();
this->m_ypos = other.GetYpos();
this->m_xindex = other.GetTileX();
this->m_yindex = other.GetTileY();
this->m_node = other.GetNode();
this->m_probability = other.GetProbability();
return *this;
}
int TreeDataPoint::GetAbsoluteXpos() const noexcept
{
return GetXpos() + (GetTileX() * sm_gridsize);
}
int TreeDataPoint::GetAbsoluteYpos() const noexcept
{
return GetYpos() + (GetTileY() * sm_gridsize);
}
void TreeDataPoint::Move(
const int dx,
const int dy,
const double p
)
{
int newxpos = m_xpos + dx;
int newypos = m_ypos + dy;
while (newxpos < 0)
{
newxpos += sm_gridsize;
--m_xindex;
}
while (newxpos >= sm_gridsize)
{
newxpos -= sm_gridsize;
++m_xindex;
}
while (newypos < 0)
{
newypos += sm_gridsize;
--m_yindex;
}
while (newypos >= sm_gridsize)
{
newypos -= sm_gridsize;
++m_yindex;
}
m_xpos = newxpos;
m_ypos = newypos;
//1.0-p : chance not to speciate
m_probability = m_probability*(1.0-p);
assert(m_xpos >= 0);
assert(m_xpos < sm_gridsize);
assert(m_ypos >= 0);
assert(m_ypos < sm_gridsize);
assert(m_probability >= 0.0);
assert(m_probability <= 1.0);
}
bool operator==(const TreeDataPoint& lhs, const TreeDataPoint& rhs) noexcept
{
return
lhs.GetXpos() == rhs.GetXpos()
&& lhs.GetYpos() == rhs.GetYpos()
&& lhs.GetTileX() == rhs.GetTileX()
&& lhs.GetTileY() == rhs.GetTileY()
&& lhs.GetNode() == rhs.GetNode()
&& lhs.GetProbability() == rhs.GetProbability()
;
}
std::ostream& operator<<(std::ostream& os, const TreeDataPoint& point) noexcept
{
os
<< point.GetXpos() << " "
<< point.GetYpos() << " "
<< point.GetTileX() << " "
<< point.GetTileY() << " "
<< point.GetNode() << " "
<< point.GetProbability()
;
return os;
}