forked from ecell/ecell3-spatiocyte
/
MoleculePopulateProcess.cpp
228 lines (219 loc) · 8.13 KB
/
MoleculePopulateProcess.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
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
//::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::
//
// This file is part of E-Cell Simulation Environment package
//
// Copyright (C) 2006-2009 Keio University
//
//::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::
//
//
// E-Cell 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 2 of the License, or (at your option) any later version.
//
// E-Cell 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 E-Cell -- see the file COPYING.
// If not, write to the Free Software Foundation, Inc.,
// 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA.
//
//END_HEADER
//
// written by Satya Arjunan <satya.arjunan@gmail.com>
// E-Cell Project, Institute for Advanced Biosciences, Keio University.
//
#include <algorithm>
#include <gsl/gsl_randist.h>
#include <boost/lexical_cast.hpp>
#include "MoleculePopulateProcess.hpp"
#include "SpatiocyteSpecies.hpp"
LIBECS_DM_INIT(MoleculePopulateProcess, Process);
void MoleculePopulateProcess::initializeSecond()
{
SpatiocyteProcess::initializeSecond();
for(std::vector<Species*>::const_iterator i(theProcessSpecies.begin());
i != theProcessSpecies.end(); ++i)
{
(*i)->setPopulateProcess(this, GaussianSigma);
}
}
void MoleculePopulateProcess::fire()
{
for(std::vector<Species*>::const_iterator i(theProcessSpecies.begin());
i != theProcessSpecies.end(); ++i)
{
(*i)->removeMolecules();
populateUniformSparse(*i);
}
theStepInterval = ResetTime;
theTime += theStepInterval;
thePriorityQueue->move(theQueueID);
}
void MoleculePopulateProcess::populateGaussian(Species* aSpecies)
{
}
void MoleculePopulateProcess::populateUniformOnDiffuseVacant(Species* aSpecies)
{
std::cout << " Populating:" << getIDString(aSpecies) << std::endl;
if(!aSpecies->getIsPopulated())
{
if(UniformRadiusX == 1 && UniformRadiusY == 1 && UniformRadiusZ == 1 &&
!OriginX && !OriginY && !OriginZ)
{
Species* aVacantSpecies(aSpecies->getVacantSpecies());
aVacantSpecies->updateDiffuseVacantMolecules();
unsigned int aSize(aSpecies->getPopulateMoleculeSize());
if(aVacantSpecies->size() < aSize)
{
THROW_EXCEPTION(ValueError, String(
getPropertyInterface().getClassName()) +
"[" + getFullID().asString() + "]: There are " +
int2str(aSize) + " " + getIDString(aSpecies) +
" molecules that must be uniformly populated," +
"\nbut there are only " +
int2str(aVacantSpecies->size()) +
" diffuse vacant voxels of " +
getIDString(aSpecies->getVacantSpecies()) +
" that can be populated on.");
}
for(unsigned int i(0); i != aSize; ++i)
{
Voxel* aMolecule(aVacantSpecies->getRandomMolecule());
aVacantSpecies->softRemoveMolecule(aMolecule);
aSpecies->addMolecule(aMolecule);
}
}
else
{
populateUniformRanged(aSpecies);
}
aSpecies->setIsPopulated();
}
}
void MoleculePopulateProcess::populateUniformDense(Species* aSpecies,
unsigned int aList[],
unsigned int* aCount)
{
std::cout << " Populating:" << getIDString(aSpecies) << std::endl;
Comp* aComp(aSpecies->getComp());
if(!aSpecies->getIsPopulated())
{
if(UniformRadiusX == 1 && UniformRadiusY == 1 && UniformRadiusZ == 1 &&
!OriginX && !OriginY && !OriginZ)
{
unsigned int aSize(aSpecies->getPopulateMoleculeSize());
for(unsigned int j(0); j != aSize; ++j)
{
Voxel* aVoxel;
do
{
aVoxel = theSpatiocyteStepper->coord2voxel(
aComp->coords[aList[(*aCount)++]]);
}
while(aVoxel->id != aComp->vacantID);
aSpecies->addMolecule(aVoxel);
}
}
else
{
populateUniformRanged(aSpecies);
}
aSpecies->setIsPopulated();
}
}
void MoleculePopulateProcess::populateUniformSparse(Species* aSpecies)
{
Comp* aComp(aSpecies->getComp());
if(!aSpecies->getIsPopulated())
{
if(UniformRadiusX == 1 && UniformRadiusY == 1 && UniformRadiusZ == 1 &&
!OriginX && !OriginY && !OriginZ)
{
unsigned int aSize(aSpecies->getPopulateMoleculeSize());
int availableVoxelSize(aComp->coords.size());
for(unsigned int j(0); j != aSize; ++j)
{
Voxel* aVoxel;
do
{
aVoxel = theSpatiocyteStepper->coord2voxel(
aComp->coords[gsl_rng_uniform_int(
getStepper()->getRng(), availableVoxelSize)]);
}
while(aVoxel->id != aComp->vacantID);
aSpecies->addMolecule(aVoxel);
}
}
else
{
populateUniformRanged(aSpecies);
}
aSpecies->setIsPopulated();
}
}
void MoleculePopulateProcess::populateUniformRanged(Species* aSpecies)
{
Comp* aComp(aSpecies->getComp());
double delta(0);
// Increase the compartment dimensions by delta if it is a surface
// compartment:
if(aComp->dimension == 2)
{
delta = 0.1;
}
double maxX(std::min(1.0, OriginX+UniformRadiusX));
double minX(std::max(-1.0, OriginX-UniformRadiusX));
double maxY(std::min(1.0, OriginY+UniformRadiusY));
double minY(std::max(-1.0, OriginY-UniformRadiusY));
double maxZ(std::min(1.0, OriginZ+UniformRadiusZ));
double minZ(std::max(-1.0, OriginZ-UniformRadiusZ));
maxX = aComp->centerPoint.x + maxX*aComp->lengthX/2*(1+delta);
minX = aComp->centerPoint.x + minX*aComp->lengthX/2*(1+delta);
maxY = aComp->centerPoint.y + maxY*aComp->lengthY/2*(1+delta);
minY = aComp->centerPoint.y + minY*aComp->lengthY/2*(1+delta);
maxZ = aComp->centerPoint.z + maxZ*aComp->lengthZ/2*(1+delta);
minZ = aComp->centerPoint.z + minZ*aComp->lengthZ/2*(1+delta);
std::vector<unsigned int> aCoords;
for(std::vector<unsigned int>::iterator i(aComp->coords.begin());
i != aComp->coords.end(); ++i)
{
Voxel* aVoxel(theSpatiocyteStepper->coord2voxel(*i));
Point aPoint(theSpatiocyteStepper->coord2point(aVoxel->coord));
if(aVoxel->id == aSpecies->getVacantID() &&
aPoint.x < maxX && aPoint.x > minX &&
aPoint.y < maxY && aPoint.y > minY &&
aPoint.z < maxZ && aPoint.z > minZ)
{
aCoords.push_back(*i);
}
}
unsigned int aSize(aSpecies->getPopulateMoleculeSize());
if(aCoords.size() < aSize)
{
THROW_EXCEPTION(ValueError, String(
getPropertyInterface().getClassName()) +
"[" + getFullID().asString() + "]: There are " +
int2str(aSize) + " " + getIDString(aSpecies) +
" molecules that must be uniformly populated in a " +
"given range,\n but there are only " +
int2str(aCoords.size()) + " vacant voxels of " +
getIDString(aSpecies->getVacantSpecies()) +
" that can be populated.");
}
unsigned int aCoordsArray[aCoords.size()];
for(unsigned int i(0); i != aCoords.size(); ++i)
{
aCoordsArray[i] = aCoords[i];
}
gsl_ran_shuffle(getStepper()->getRng(), aCoordsArray, aCoords.size(),
sizeof(unsigned int));
for(unsigned int i(0); i != aSize; ++i)
{
aSpecies->addMolecule(theSpatiocyteStepper->coord2voxel(aCoordsArray[i]));
}
}