/usr/include/Bpp/Seq/Container/SequenceContainer.h is in libbpp-seq-dev 2.0.3-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 | //
// File: SequenceContainer.h
// Created by: Guillaume Deuchst
// Julien Dutheil
// Created on: Fri Jul 25 2003
//
/*
Copyright or © or Copr. Bio++ Development Tools, (November 17, 2004)
This software is a computer program whose purpose is to provide classes
for sequences 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 _SEQUENCECONTAINER_H_
#define _SEQUENCECONTAINER_H_
#include "../Alphabet/Alphabet.h"
#include "../Sequence.h"
#include "SequenceContainerExceptions.h"
#include <Bpp/Clonable.h>
// From the STL:
#include <string>
namespace bpp
{
/**
* @brief The SequenceContainer interface.
*
* This interface is the most general one in the container hierarchy.
* No assumption is made on the sequences in the container (no ordering, no alignment).
* Sequences may be retrieved using their names, which must be unique.
*
* The container is the only one responsible for the allocation/destruction of sequences it
* contains. This means that any sequence passed to it will be <strong>copied</strong> into the container.
* The container also provides methods that send const pointers towards these sequences
* (without performing any copy of the underlying objects).
*
* Notes :
* 1. methods for adding sequences to the container are not declared here
* (so they can't be used throught this interface),
* because these methods take sequence container's type specific parameters
* (i.e. a key for map sequence containers);
* 2. to delete a sequence from a container, one must use the appropriate method
* (removeSequence() and deleteSequence()).
* These methods performs a few check, and properly update pointers.
* You should never delete a sequence from a container by yourself.
*
* @see Sequence
*/
class SequenceContainer:
public virtual Clonable
{
public:
SequenceContainer() {}
virtual ~SequenceContainer() {}
public:
/**
* @brief Get sequence container's alphabet.
*
* @return The alphabet associated to this container.
*/
virtual const Alphabet* getAlphabet() const = 0;
/**
* @brief Get the content of a sequence.
*
* @param name The name of the sequence.
* @return The content of the sequence as a vector of integers.
* @throw SequenceNotFoundException If the name does not match any sequence in the container.
*/
virtual const std::vector<int>& getContent(const std::string& name) const throw (SequenceNotFoundException) = 0;
/**
* @brief Convert a particular sequence to a string.
*
* @param name The name of the sequence.
* @return A string describing the content of the sequence.
* @throw SequenceNotFoundException If the name does not match any sequence in the container.
*/
virtual std::string toString(const std::string& name) const throw (SequenceNotFoundException) = 0;
/**
* @brief Retrieve a sequence object from the container.
*
* @param name The name of the sequence.
* @return A reference toward the Sequence with corresponding name.
* @throw SequenceNotFoundException If the name does not match any sequence in the container.
*/
virtual const Sequence& getSequence(const std::string& name) const throw (SequenceNotFoundException) = 0;
/**
* @brief Check if a sequence with a given name is present in the container.
*
* @param name The name of the sequence.
* @return True if a sequence with the given name is present in the container.
*/
virtual bool hasSequence(const std::string& name) const = 0;
/**
* @brief Add a sequence to the container.
*
* @param sequence The sequence to add.
* @param checkName Tell if the container must check if the name of the sequence
* is already used in the container before adding it.
* @throw Exception Any other kind of exception, if the name of the sequence is
* already used, are whatever else depending on the implementation.
*/
virtual void addSequence(const Sequence& sequence, bool checkName) throw (Exception) = 0;
/**
* @brief Replace a sequence in the container.
*
* @param name The name of the sequence.
* @param sequence The sequence to add.
* @param checkName Tell if the container must check if the name of the sequence
* is already used in the container before adding it.
* @throw SequenceNotFoundException If the name does not match any sequence in
* the container.
* @throw Exception Any other kind of exception, if the name of the sequence is
* already used, are whatever else depending on the implementation.
*/
virtual void setSequence(const std::string& name, const Sequence& sequence, bool checkName) throw (Exception) = 0;
/**
* @brief Extract (and remove) a sequence from the container.
*
* @param name The name of the sequence.
* @throw SequenceNotFoundException If the name does not match any sequence in
* the container.
*/
virtual Sequence* removeSequence(const std::string& name) throw (SequenceNotFoundException, Exception) = 0;
/**
* @brief Delete a sequence of the container.
*
* @param name The name of the sequence.
* @throw SequenceNotFoundException If the name does not match any sequence in
* the container.
*/
virtual void deleteSequence(const std::string& name) throw (SequenceNotFoundException, Exception) = 0;
/**
* @brief Get the number of sequences in the container.
*
* @return The number of sequences in the container.
*/
virtual unsigned int getNumberOfSequences() const = 0;
/**
* @brief Get all the names of the sequences in the container.
*
* @return A vector of strings with all sequence names.
*/
virtual std::vector<std::string> getSequencesNames() const = 0;
/**
* @brief Set all sequence names.
*
* @param names A vector of strings with all sequence names.
* Its size must be strictly equal to the the size of the container (the number of
* sequences).
* @param checkNames Tell if the container must check if the name of the sequence
* is already used in the container before adding it.
* @throw Exception If there are redundant names in the input vector.
*/
virtual void setSequencesNames(const std::vector<std::string>& names, bool checkNames) throw (Exception) = 0;
/**
* @brief Get comments of a particular sequence.
*
* @param name The name of the sequence.
* @return The comments associated to sequence with name 'name'.
* @throw SequenceNotFoundException If the name does not match any sequence in
* the container.
*/
virtual const Comments& getComments(const std::string& name) const throw (SequenceNotFoundException) = 0;
/**
* @brief Set the comments of a particular sequence.
*
* @param name The name of the sequence.
* @param comments The comments to set to sequence with name 'name'.
* @throw SequenceNotFoundException If the name does not match any sequence in
* the container.
*/
virtual void setComments(const std::string& name, const Comments& comments) throw (SequenceNotFoundException) = 0;
/**
* @brief Get the comments of this container.
*
* @return The comments associated to this container.
*/
virtual const Comments& getGeneralComments() const = 0;
/**
* @brief Set the comments of this container.
*
* @param comments The comments to be associated to this container.
*/
virtual void setGeneralComments(const Comments& comments) = 0;
/**
* @brief Delete the comments associated to this container.
*/
virtual void deleteGeneralComments() = 0;
/**
* @brief Delete all sequences in the container.
*/
virtual void clear() = 0;
/**
* @brief Return a copy of this container, but with no sequence inside.
*
* This method creates a new SequenceContainer objet.
* The class of this container depends on the derivative class.
*
* @return A new empty container, with the same alphabet as this one.
*/
virtual SequenceContainer* createEmptyContainer() const = 0;
/**
* @name Provide direct access to sequences content.
*
* @warning These operators allow you to modifiy the content of the sequences.
* No checking is performed for your modifications, so use with care, or
* consider using the setContent() methods.
*
* @{
*/
/**
* @brief Element access function.
*
* Allows direct access to the data stored in the container.
*
* @param sequenceName The sequence name.
* @param elementIndex The element position within the sequence.
* @throw SequenceNotFoundException If no corresponding sequence is found in the container.
* @throw IndexOutOfBoundsException If the element position is not valid.
*/
virtual int& valueAt(const std::string& sequenceName, unsigned int elementIndex) throw (SequenceNotFoundException, IndexOutOfBoundsException) = 0;
/**
* @brief Element access function.
*
* Allows direct access to the data stored in the container.
*
* @param sequenceName The sequence name.
* @param elementIndex The element position within the sequence.
* @throw SequenceNotFoundException If no corresponding sequence is found in the container.
* @throw IndexOutOfBoundsException If the element position is not valid.
*/
virtual const int& valueAt(const std::string& sequenceName, unsigned int elementIndex) const throw (SequenceNotFoundException, IndexOutOfBoundsException) = 0;
/**
* @brief Element access operator.
*
* Allows direct access to the data stored in the container.
* This method is faster then the valueAt function, but input
* parameters are not checked!
*
* @param sequenceName The sequence name.
* @param elementIndex The element position within the sequence.
*/
virtual int& operator()(const std::string& sequenceName, unsigned int elementIndex) = 0;
/**
* @brief Element access operator.
*
* Allows direct access to the data stored in the container.
* This method is faster then the valueAt function, but input
* parameters are not checked!
*
* @param sequenceName The sequence name.
* @param elementIndex The element position within the sequence.
*/
virtual const int& operator()(const std::string& sequenceName, unsigned int elementIndex) const = 0;
/** @} */
};
} //end of namespace bpp.
#endif // _SEQUENCECONTAINER_H_
|