Go to the SVN repository for this file.
33 #ifndef SKIP_DOXYGEN_PROCESSING 44algo_iter->offsets.resize(0);
45 intalgo_id = algo_iter->algorithm_id;
56 if(oid_ranges.
Empty()) {
60 for(
CSeq_loc_CIranges(*oid_ranges); ranges; ++ranges) {
64algo_iter->offsets.push_back(pr);
75 if((
int)
m_Values.size() > algo_id) {
80 if(iter != m.
end()) {
98 if((
int)
m_Values.size() <= algo_id) {
vector< TAlgoMap > m_Values
CMaskedRangesVector m_Ranges
static void x_CombineLocs(CConstRef< CSeq_loc > &L1, const CSeq_loc &L2)
void x_FindAndCombine(CConstRef< CSeq_loc > &L1, int algo_id, CSeq_id_Handle &id)
CConstRef< CSeq_loc > & x_Set(int algo_id, CSeq_id_Handle id)
virtual CMaskedRangesVector & GetRanges(const list< CRef< CSeq_id > > &idlist)
Get ranges of masking data for the given Seq-ids.
This represents a set of masks for a given sequence.
Seq-loc iterator class â iterates all intervals from a seq-loc in the correct order.
container_type::const_iterator const_iterator
const_iterator end() const
const_iterator find(const key_type &key) const
#define ITERATE(Type, Var, Cont)
ITERATE macro to sequence through container elements.
#define NON_CONST_ITERATE(Type, Var, Cont)
Non constant version of ITERATE macro.
static CSeq_id_Handle GetHandle(const CSeq_id &id)
Normal way of getting a handle, works for any seq-id.
void Add(const CSeq_loc &other)
Simple adding of seq-locs.
bool Empty(void) const THROWS_NONE
Check if CConstRef is empty â not pointing to any object which means having a null value.
void Reset(void)
Reset reference object.
position_type GetToOpen(void) const
TFrom GetFrom(void) const
Get the From member data.
constexpr bool empty(list< Ts... >) noexcept
RetroSearch is an open source project built by @garambo | Open a GitHub Issue
Search and Browse the WWW like it's 1997 | Search results from DuckDuckGo
HTML:
3.2
| Encoding:
UTF-8
| Version:
0.7.4