docstring & operator[](docstring const & f)
{ return bimap_[f]; }
///
docstring & operator[](docstring const & f)
{ return bimap_[f]; }
///
- docstring allData() const { return allData_; }
+ docstring const & allData() const { return allData_; }
- void allData(docstring const & d) { allData_ = d; }
+ void setAllData(docstring const & d) { allData_ = d; }
///
docstring entryType() const { return entryType_; }
private:
///
docstring entryType() const { return entryType_; }
private:
//"All Entry Types" is first.
index = entriesCO->currentIndex() - 1;
vector<docstring> const & entries = availableEntries();
//"All Entry Types" is first.
index = entriesCO->currentIndex() - 1;
vector<docstring> const & entries = availableEntries();
if (index < 0 || index >= int(entries.size()))
if (index < 0 || index >= int(entries.size()))
- entryType = from_ascii("");
+ entry_type = from_ascii("");
- entryType = entries[index];
+ entry_type = entries[index];
bool const case_sentitive = caseCB->checkState();
bool const reg_exp = regexCB->checkState();
bool const case_sentitive = caseCB->checkState();
bool const reg_exp = regexCB->checkState();
- findKey(text, onlyKeys, field, entryType,
+ findKey(text, onlyKeys, field, entry_type,
case_sentitive, reg_exp, reset);
//FIXME
//It'd be nice to save and restore the current selection in
case_sentitive, reg_exp, reset);
//FIXME
//It'd be nice to save and restore the current selection in
void GuiCitation::findKey(QString const & str, bool only_keys,
void GuiCitation::findKey(QString const & str, bool only_keys,
- docstring field, docstring entryType,
+ docstring field, docstring entry_type,
bool case_sensitive, bool reg_exp, bool reset)
{
// Used for optimisation: store last searched string.
bool case_sensitive, bool reg_exp, bool reset)
{
// Used for optimisation: store last searched string.
- // First, filter by entryType, which will be faster than
+ // First, filter by entry_type, which will be faster than
// what follows, so we may get to do that on less.
vector<docstring> keyVector = to_docstring_vector(keys);
// what follows, so we may get to do that on less.
vector<docstring> keyVector = to_docstring_vector(keys);
- filterByEntryType(keyVector, entryType);
+ filterByEntryType(keyVector, entry_type);
if (str.isEmpty())
result = to_qstring_list(keyVector);
if (str.isEmpty())
result = to_qstring_list(keyVector);
void GuiCitation::filterByEntryType(
void GuiCitation::filterByEntryType(
- vector<docstring> & keyVector, docstring entryType)
+ vector<docstring> & keyVector, docstring entry_type)
+ if (entry_type.empty())
return;
vector<docstring>::iterator it = keyVector.begin();
return;
vector<docstring>::iterator it = keyVector.begin();
BiblioInfo::const_iterator cit = bibkeysInfo_.find(key);
if (cit == bibkeysInfo_.end())
continue;
BiblioInfo::const_iterator cit = bibkeysInfo_.find(key);
if (cit == bibkeysInfo_.end())
continue;
- if (cit->second.entryType() == entryType)
+ if (cit->second.entryType() == entry_type)
result.push_back(key);
}
keyVector = result;
result.push_back(key);
}
keyVector = result;
// add the new entry
keylist.addEntryType(entryType);
// add the new entry
keylist.addEntryType(entryType);
- keyvalmap.allData(data);
+ keyvalmap.setAllData(data);
keylist[key] = keyvalmap;
}
} //< searching '@'
keylist[key] = keyvalmap;
}
} //< searching '@'