Go to the SVN repository for this file.
84it !=
m_Map.
end() && it->first == priority; ++it ) {
85 if( it->second.IsLeaf() &&
86&it->second.GetLeaf().GetDataSource() == &
leaf.GetDataSource() ) {
99 if( mit->second.IsEmpty() ) {
119 returniter && ++iter;
148 else if( node.
IsLeaf() ) {
161new_entry =
const_cast<CSeq_entry*
>(&*src_entry);
220: m_Map(0), m_Node(0)
226: m_Map(&
tree.GetTree()), m_Node(0)
CDataSource & GetDataSource(void)
bool CanBeEdited(void) const
TTSE_Lock AddStaticTSE(CSeq_entry &se)
const CTSE_LockSet & GetStaticBlobs(void) const
void SetLeaf(TLeaf &leaf)
CPriorityTree & SetTree(void)
CPriorityTree & GetTree(void)
size_t Erase(const TLeaf &leaf)
CRef< CPriorityTree > m_SubTree
CPriorityNode::TPriority TPriority
bool Insert(const CPriorityNode &node, TPriority priority)
size_t Erase(const TLeaf &leaf)
bool HasSeveralNodes(void)
const CPriority_I & operator++(void)
const CPriority_I & InsertBefore(TLeaf &leaf)
unique_ptr< CPriority_I > m_Sub_I
CRef< CDataSource_ScopeInfo > x_GetDSInfo(CDataSource &ds)
container_type::const_iterator const_iterator
const_iterator lower_bound(const key_type &key) const
const_iterator end() const
iterator insert(const value_type &val)
const_iterator begin() const
container_type::iterator iterator
container_type::value_type value_type
#define ITERATE(Type, Var, Cont)
ITERATE macro to sequence through container elements.
C * SerialClone(const C &src)
Create on heap a clone of the source object.
void Reset(void)
Reset reference object.
#define END_NCBI_SCOPE
End previously defined NCBI scope.
#define END_SCOPE(ns)
End the previously defined scope.
#define BEGIN_NCBI_SCOPE
Define ncbi namespace.
#define BEGIN_SCOPE(ns)
Define a new scope.
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