/usr/include/Bpp/PopGen/PolymorphismSequenceContainer.h is in libbpp-popgen-dev 2.2.0-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 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 | //
// File: PolymorphismSequenceContainer.h
// Authors: Eric Bazin
// Sylvain Gaillard
// Created on: Wednesday August 04 2004
//
/*
Copyright or © or Copr. Bio++ Development Team, (November 17, 2004)
This software is a computer program whose purpose is to provide classes
for population genetics analysis.
This software is governed by the CeCILL license under French law and
abiding by the rules of distribution of free software. You can use,
modify and/ or redistribute the software under the terms of the CeCILL
license as circulated by CEA, CNRS and INRIA at the following URL
"http://www.cecill.info".
As a counterpart to the access to the source code and rights to copy,
modify and redistribute granted by the license, users are provided only
with a limited warranty and the software's author, the holder of the
economic rights, and the successive licensors have only limited
liability.
In this respect, the user's attention is drawn to the risks associated
with loading, using, modifying and/or developing or reproducing the
software by the user in light of its specific status of free software,
that may mean that it is complicated to manipulate, and that also
therefore means that it is reserved for developers and experienced
professionals having in-depth computer knowledge. Users are therefore
encouraged to load and test the software's suitability as regards their
requirements in conditions enabling the security of their systems and/or
data to be ensured and, more generally, to use and operate it in the
same conditions as regards security.
The fact that you are presently reading this means that you have had
knowledge of the CeCILL license and that you accept its terms.
*/
#ifndef _POLYMORPHISMSEQUENCECONTAINER_H_
#define _POLYMORPHISMSEQUENCECONTAINER_H_
#include <set>
#include <string>
#include <Bpp/Clonable.h>
#include <Bpp/Text/StringTokenizer.h>
#include <Bpp/Text/TextTools.h>
#include <Bpp/Seq/Container/VectorSiteContainer.h>
#include <Bpp/Seq/Container/SequenceContainerTools.h>
/**
* @mainpage
*
* @par
* The PopGenLib library provides classes for population genetics analysis.
* It makes intensive use of the SeqLib library, and adds a dedicated container
* named bpp::PolymorphismSequenceContainer, which associates frequencies to the
* sequences in the set. The bpp::PolymorphismSequenceContainerTools and
* bpp::SequenceStatistics static classes provide several tools for data analysis,
* including diversity indices and positive selection tests.
*
* @section dataset Population and sample data storage and manipulation
*
* @par
* PopGenLib library provides data structure for handling sample and data sets
* for population genetics.
* These objects are embedded in the bpp::DataSet object which is a container of bpp::Group
* of bpp::Individual.
* Each bpp::Individual can store bpp::Sequence data or allelic data with the dedicated
* classes bpp::MultilocusGenotype.
*
* @section genetics Population genetics data and statistics
*
* @par
* To compute statistics on data, two containers families are provided, one for sequences
* (bpp::PolymorphismSequenceContainer) and the other for allelic data (bpp::PolymorphismMultiGContainer).
* Static tools class for both families are provided to compute several common or less
* common statistics.
*
* @section statistics Statistics overview
*
* @par heterozygosity
* @par watterson75 Diversity estimator Theta of Watterson
* @par tajima83 Diversity estimator Theta of Tajima
* @par DVH Haplotype diversity of Depaulis and Veuille
* @par D Tajima's D test
*/
namespace bpp
{
/**
* @brief The PolymorphismSequenceContainer class.
*
* This is a VectorSiteContainer with effectif for each sequence.
* It also has flag for ingroup and outgroup.
*
* @author Sylvain Gaillard
*/
class PolymorphismSequenceContainer :
public VectorSiteContainer
{
private:
std::vector<bool> ingroup_;
std::vector<unsigned int> count_;
std::vector<size_t> group_;
public:
// Constructors and destructor
/**
* @brief Build a new empty PolymorphismSequenceContainer.
*/
PolymorphismSequenceContainer(const Alphabet* alpha);
/**
* @brief Build a new empty PolymorphismSequenceContainer of given size.
*/
PolymorphismSequenceContainer(size_t size, const Alphabet* alpha);
/**
* @brief Build a PolymorphismSequenceContainer by copying data from an OrderedSequenceContainer.
*/
PolymorphismSequenceContainer(const OrderedSequenceContainer& sc);
/**
* @brief Build a PolymorphismSequenceContainer by copying data from a SiteContainer.
*/
PolymorphismSequenceContainer(const SiteContainer& sc);
/**
* @brief Copy constructor.
*/
PolymorphismSequenceContainer(const PolymorphismSequenceContainer& psc);
/**
* @brief Operator= : copy operator.
*/
PolymorphismSequenceContainer& operator=(const PolymorphismSequenceContainer& psc);
/**
* @brief Destroy a PolymorphismSequenceContainer.
*/
virtual ~PolymorphismSequenceContainer();
/**
* @brief Clone a PolymorphismSequenceContainer.
*/
PolymorphismSequenceContainer* clone() const
{
return new PolymorphismSequenceContainer(*this);
}
public:
// Other methods
/**
* @brief Remove a sequence by index and return a pointer to this removed sequence.
*
* @throw IndexOutOfBoundsException if index excedes the number of sequences.
*/
Sequence* removeSequence(size_t index) throw (IndexOutOfBoundsException);
/**
* @brief Remove a sequence by name and return a pointer to this removed sequence.
*
* @throw SequenceNotFoundException if name is not found among the sequences' names.
*/
Sequence* removeSequence(const std::string& name) throw (SequenceNotFoundException);
/**
* @brief Delete a sequence by index.
*
* @throw IndexOutOfBoundsException if index excedes the number of sequences.
*/
void deleteSequence(size_t index) throw (IndexOutOfBoundsException);
/**
* @brief Delete a sequence by name.
*
* @throw SequenceNotFoundException if name is not found among the sequences' names.
*/
void deleteSequence(const std::string& name) throw (SequenceNotFoundException);
/**
* @brief Add a sequence to the container.
*
* @throw AlphabetMismatchException if the sequence's alphabet doesn't match the container's alphabet.
* @throw SequenceException if the sequence's size doesn't match the sequence's size of the container.
* @throw SequenceException if the sequence's name already exists in the container.
*/
void addSequenceWithFrequency(const Sequence& sequence, unsigned int frequency, bool checkName = true) throw (Exception);
void addSequenceWithFrequency(const Sequence& sequence, size_t sequenceIndex, unsigned int frequency, bool checkName = true) throw (Exception);
void addSequence(const Sequence& sequence, bool checkName = true) throw (Exception) {
addSequenceWithFrequency(sequence, 1, checkName);
}
void addSequence(const Sequence& sequence, size_t sequenceIndex, bool checkName = true) throw (Exception) {
addSequenceWithFrequency(sequence, sequenceIndex, 1, checkName);
}
/**
* @brief Clear the container of all its sequences.
*/
void clear();
/**
* @brief Get the group identifier of the sequence.
*
* @throw IndexOutOfBoundsException if index excedes the number of sequences in the container.
*/
size_t getGroupId(size_t index) const throw (IndexOutOfBoundsException);
/**
* @brief Get the group identifier of a sequence.
*
* @throw SequenceNotFoundException if name is not found among the sequences' names.
*/
size_t getGroupId(const std::string& name) const throw (SequenceNotFoundException);
/**
* @brief Get all the groups identifiers.
*/
std::set<size_t> getAllGroupsIds() const;
/**
* @brief Set the group identifier of a sequence.
*
* @throw IndexOutOfBoundsException if index excedes the number of sequences in the container.
*/
void setGroupId(size_t index, size_t group_id) throw (IndexOutOfBoundsException);
/**
* @brief Set the group identifier of a sequence.
*
* @throw SequenceNotFoundException if name is not found among the sequences' names.
*/
void setGroupId(const std::string& name, size_t group_id) throw (SequenceNotFoundException);
/**
* @brief Get the number of groups.
*/
size_t getNumberOfGroups() const;
/**
* @brief Tell if the sequence is ingroup by index.
*
* @throw IndexOutOfBoundsException if index excedes the number of sequences in the container.
*/
bool isIngroupMember(size_t index) const throw (IndexOutOfBoundsException);
/**
* @brief Tell if a sequence is ingroup by name.
*
* @throw SequenceNotFoundException if name is not found among the sequences' names.
*/
bool isIngroupMember(const std::string& name) const throw (SequenceNotFoundException);
/**
* @brief Set a sequence as ingroup member by index.
*
* @throw IndexOutOfBoundsException if index excedes the number of sequences in the container.
*/
void setAsIngroupMember(size_t index) throw (IndexOutOfBoundsException);
/**
* @brief Set a sequence as ingroup member by name.
*
* @throw SequenceNotFoundException if name is not found among the sequences' names.
*/
void setAsIngroupMember(const std::string& name) throw (SequenceNotFoundException);
/**
* @brief Set a sequence as outgroup member by index.
*
* @throw IndexOutOfBoundsException if index excedes the number of sequences in the container.
*/
void setAsOutgroupMember(size_t index) throw (IndexOutOfBoundsException);
/**
* @brief Set a sequence as outgroup member by name.
*
* @throw SequenceNotFoundException if name is not found among the sequences' names.
*/
void setAsOutgroupMember(const std::string& name) throw (SequenceNotFoundException);
/**
* @brief Set the count of a sequence by index.
*
* @throw IndexOutOfBoundsException if index excedes the number of sequences in the container.
* @throw BadIntegerException if count < 1 ... use deleteSequence instead of setting the count to 0.
*/
void setSequenceCount(size_t index, unsigned int count) throw (Exception);
/**
* @brief Set the count of a sequence by name.
*
* @throw throw SequenceNotFoundException if name is not found among the sequences' names.
* @throw BadIntegerException if count < 1 ... use deleteSequence instead of setting the count to 0.
*/
void setSequenceCount(const std::string& name, unsigned int count) throw (Exception);
/**
* @brief Add 1 to the sequence count.
*
* @throw IndexOutOfBoundsException if index excedes the number of sequences in the container.
*/
void incrementSequenceCount(size_t index) throw (IndexOutOfBoundsException);
/**
* @brief Add 1 to the sequence count.
*
* @throw SequenceNotFoundException if name is not found among the sequences' names.
*/
void incrementSequenceCount(const std::string& name) throw (SequenceNotFoundException);
/**
* @brief Removz 1 to the sequence count.
*
* @throw IndexOutOfBoundsException if index excedes the number of sequences in the container.
* @throw BadIntegerException if count < 1 ... use deleteSequence instead of setting the count to 0.
*/
void decrementSequenceCount(size_t index) throw(IndexOutOfBoundsException, BadIntegerException);
/**
* @brief Remove 1 to the sequence count.
*
* @throw SequenceNotFoundException if name is not found among the sequences' names.
* @throw BadIntegerException if count < 1 ... use deleteSequence instead of setting the count to 0.
*/
void decrementSequenceCount(const std::string& name) throw (SequenceNotFoundException, BadIntegerException);
/**
* @brief Get the count of a sequence by index.
*
* @throw IndexOutOfBoundsException if index excedes the number of sequences in the container.
*/
unsigned int getSequenceCount(size_t index) const throw (IndexOutOfBoundsException);
/**
* @brief Get the count of a sequence by name.
*
* @throw SequenceNotFoundException if name is not found among the sequences' names.
*/
unsigned int getSequenceCount(const std::string& name) const throw (SequenceNotFoundException);
};
} // end of namespace bpp;
#endif // _POLYMORPHISMSEQUENCECONTAINER_H_
|