:m_table(), m_masters(), m_cdRowIndexMap()
44 for(
unsigned int i= 0;
i< rows.size();
i++)
47pair<RowSourceMap::iterator, RowSourceMap::iterator> range =
m_table.
equal_range(rows[
i]);
87vector<RowSource> rss;
89 for(
unsigned int i= 0;
i< rss.size();
i++)
91 if(rss[
i].cd == cd)
99pair<RowSourceMap::const_iterator, RowSourceMap::const_iterator> range =
m_table.
equal_range(
row);
105src.push_back(rit->second);
108src.push_back(rit->second);
123 returnemptyRowSource;
152masters.push_back(*sit);
190cdVec.push_back(*sit);
208 for(
unsigned int i= 0;
i< cdRows.size();
i++)
212colRows.
insert(rowIt->second);
220 returnrowIt->second;
227 for(
unsigned int i= 0;
i< colRows.size();
i++)
231 for(
unsigned intj = 0; j <
entries.size(); j++)
234cdRows[
entries[j].cd].push_back(uniRow);
string GetAccession(int &Version) const
string makeCDRowKey(CCdCore *cd, int row) const
int getCDs(vector< CCdCore * > &cds)
void removeEntriesForCD(vector< int > &colRows, CCdCore *cd)
int getCDsOutofScope(vector< CCdCore * > &cds)
void convertToCDRows(const vector< int > &colRows, CDRowsMap &cdRows) const
void transferCDs(const set< CCdCore * > &cdSet, vector< CCdCore * > &cdVec)
CDRowIndexMap m_cdRowIndexMap
set< CCdCore * > m_cdsInScope
int findEntries(int row, vector< RowSource > &src, bool scopedOnly=false) const
int convertFromCDRow(CCdCore *cd, int cdRows) const
bool isCDInScope(CCdCore *cd) const
void addEntry(int row, CCdCore *cd, int rowInCD, bool normal=true, bool scoped=true)
void convertFromCDRows(CCdCore *cd, const vector< int > &cdRows, set< int > &colRows) const
bool isEntryInScope(const RowSource &rs) const
int getCDsInScope(vector< CCdCore * > &cds)
bool isRowInCD(int row, CCdCore *cd) const
const RowSource & findEntry(int row) const
set< CCdCore * > m_cdsOutofScope
bool isPending(int row) const
void getMasterRows(vector< int > &masters)
container_type::const_iterator const_iterator
const_iterator end() const
iterator_bool insert(const value_type &val)
container_type::value_type value_type
const_iterator find(const key_type &key) const
const_iterator_pair equal_range(const key_type &key) const
container_type::const_iterator const_iterator
const_iterator find(const key_type &key) const
const_iterator end() const
iterator insert(const value_type &val)
container_type::iterator iterator
container_type::value_type value_type
iterator_bool insert(const value_type &val)
const_iterator begin() const
const_iterator find(const key_type &key) const
const_iterator end() const
const int PENDING_ROW_START
#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.
static string IntToString(int value, TNumToStringFlags flags=0, int base=10)
Convert int to string.
#define row(bind, expected)
static wxAcceleratorEntry entries[3]
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