/usr/include/siscone/spherical/protocones.h is in libsiscone-spherical-dev 2.0.6-1.
This file is owned by root:root, with mode 0o644.
The actual contents of the file can be viewed below.
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 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 | // -*- C++ -*-
///////////////////////////////////////////////////////////////////////////////
// File: protocones.h //
// Description: header file for stable cones determination (Cstable_cones) //
// This file is part of the SISCone project. //
// WARNING: this is not the main SISCone trunk but //
// an adaptation to spherical coordinates //
// For more details, see http://projects.hepforge.org/siscone //
// //
// Copyright (c) 2006-2008 Gavin Salam and Gregory Soyez //
// //
// 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 2 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, write to the Free Software //
// Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301, USA //
// //
// $Revision:: 255 $//
// $Date:: 2008-07-12 17:40:35 +0200 (Sat, 12 Jul 2008) $//
///////////////////////////////////////////////////////////////////////////////
#ifndef __SPH_PROTOCONES_H__
#define __SPH_PROTOCONES_H__
#include "momentum.h"
#include "vicinity.h"
#include <stdio.h>
#include <vector>
#include <list>
#include "hash.h"
#include <siscone/defines.h>
namespace siscone_spherical{
/**
* \class CSphborder_store
*
* class for storing a border momentum (in context of co-circularity
* checks).
* This class essentially calculates angle of border point w.r.t.
* circle center (eta & phi), and provides a store of information
* about whether we are currently including this point in the
* candidate
*/
class CSphborder_store{
public:
/// default ctor
CSphborder_store(CSphmomentum * momentum, CSph3vector ¢re, CSph3vector &angl_dir1, CSph3vector &angl_dir2) :
mom(momentum), is_in(false) {
CSph3vector diff = (*momentum) - centre;
angle = atan2(dot_product3(diff, angl_dir2), dot_product3(diff, angl_dir1));
#ifdef DEBUG_STABLE_CONES
std::cout << " adding point " << momentum->_theta << ", " << momentum->_phi
<< " at an angle of " << angle << std::endl;
#endif
}
CSphmomentum * mom; ///< particle momentum
double angle; ///< angle w.r.t. circle centre
bool is_in; ///< inclusion status of the particle
};
/// allows easy sorting of CSphborder_store objects (which need to be
/// ordered in angle).
inline bool operator<(const CSphborder_store & a, const CSphborder_store & b) {
return a.angle < b.angle;
}
/**
* \class CSphstable_cones
* \brief Computes the list of stable comes from a particle list.
*
* This class does the first fundamental task of te cone algorithm:
* it is used to compute the list of stable cones given a list
* of particles.
*/
class CSphstable_cones : public CSphvicinity{
public:
/// default ctor
CSphstable_cones();
/// ctor with initialisation (sse init for details)
CSphstable_cones(std::vector<CSphmomentum> &_particle_list);
/// default dtor
~CSphstable_cones();
/**
* initialisation
* \param _particle_list list of particles
*/
void init(std::vector<CSphmomentum> &_particle_list);
/**
* compute stable cones.
* This function really does the job i.e. computes
* the list of stable cones (in a seedless way)
* \param _radius radius of the cones
* \return The number of stable cones found is returned
*/
int get_stable_cones(double _radius);
/// list of stable cones
std::vector<CSphmomentum> protocones;
/// list of candidates
sph_hash_cones *hc;
/// total number of tested cones
int nb_tot;
#ifdef DEBUG_STABLE_CONES
int nb_hash_cones, nb_hash_occupied;
#endif
protected:
/// cone radius
double R;
/// cone radius SQUARED
double R2;
/// squared tangent of the cone radius
double tan2R;
private:
/// cone with a given particle as parent
/// this reduction to a single vector assumes we trust the checksums
CSphmomentum cone;
/// child particle, taken in the 'vicinity' list
CSphmomentum *child;
/// centre of the tested cone
CSphvicinity_elm *centre;
/// index in the particle list;
unsigned int centre_idx;
/// first cone used in the vicinity list
unsigned int first_cone;
/**
* initialise the cone.
* We take the first particle in the angular ordering to compute this one
* \return 0 on success, 1 on error
*/
int init_cone();
/**
* test cones.
* We check if the cone(s) build with the present parent and child
* are stable
* \return 0 on success 1 on error
*/
int test_cone();
/**
* update the cone
* go to the next child for that parent and update 'cone' appropriately
* \return 0 if update candidate found, 1 otherwise
*/
int update_cone();
/*
* run through the vicinity of the current parent and for each child
* indicate which members are cocircular...
*/
void prepare_cocircular_lists();
/**
* check if we are in a situation of cocircularity.
* if it is the case, update and test in the corresponding way
* \return 'false' if no cocircularity detected, 'true' otherwise
* Note that if cocircularity is detected, we need to
* recall 'update' from 'update' !!!
*/
bool cocircular_check();
/**
* Routine for testing cocircular configurations in p^3 time,
* rather than 2^p time;
*/
void test_cone_cocircular(CSphmomentum & borderless_cone,
std::list<CSphmomentum *> & border_list);
/**
* carry out the computations needed for the stability check of the
* candidate, using the border_vect to indicate which particles
* should / should not be in the stable cone; if the cone is stable
* insert it into the hash.
*/
void test_stability(CSphmomentum & candidate,
const std::vector<CSphborder_store> & border_vect);
/**
* compute the cone contents by going once around the full set of
* circles and tracking the entry/exit status each time -- this sets
* up the inclusion information, which can then be directly used to
* calculate the cone momentum.
*/
void compute_cone_contents();
/**
* compute the cone momentum from particle list.
* in this version, we use the 'pincluded' information
* from the CSphvicinity class
*/
void recompute_cone_contents();
/*
* if we have gone beyond the acceptable threshold of change, compute
* the cone momentum from particle list. in this version, we use the
* 'pincluded' information from the CSphvicinity class, but we don't
* change the member cone, only the locally supplied one
*/
void recompute_cone_contents_if_needed(CSphmomentum & this_cone, double & this_dpt);
/**
* compute stability of all enumerated candidates.
* For all candidate cones which are stable w.r.t. their border particles,
* pass the last test: stability with quadtree intersection
*/
int proceed_with_stability();
/*
* circle intersection.
* computes the intersection with a circle of given centre and radius.
* The output takes the form of a checkxor of the intersection's particles
* - cx circle centre x coordinate
* - cy circle centre y coordinate
* return the checkxor for the intersection
******************************************************************/
siscone::Creference circle_intersect(CSph3vector &cone_centre);
/// present candidate cone
CSphmomentum cone_candidate;
/// in case of co-circular points, vector for them
std::vector<CSphmomentum*> child_list;
/// list of cocircular enclusures already studied
/// first element if cone contents, second is cone border
std::vector< std::pair<siscone::Creference,siscone::Creference> > multiple_centre_done;
// information for updating cone contents to avoid rounding errors
double dpt; ///< sums of Delta P_t
};
}
#endif
|