namespace {
-typedef InsetList::InsetTable Table;
+typedef InsetList::Element Table;
-struct InsetTablePosLess
+struct ElementPosLess
{
bool operator()(Table const & t1, Table const & t2) const
{
InsetList::iterator InsetList::insetIterator(pos_type pos)
{
- InsetTable search_elem(pos, 0);
+ Element search_elem(pos, 0);
return lower_bound(list_.begin(), list_.end(), search_elem,
- InsetTablePosLess());
+ ElementPosLess());
}
InsetList::const_iterator InsetList::insetIterator(pos_type pos) const
{
- InsetTable search_elem(pos, 0);
+ Element search_elem(pos, 0);
return lower_bound(list_.begin(), list_.end(), search_elem,
- InsetTablePosLess());
+ ElementPosLess());
}
LYXERR0("ERROR (InsetList::insert): "
<< "There is an inset in position: " << pos);
} else {
- list_.insert(it, InsetTable(pos, inset));
+ list_.insert(it, Element(pos, inset));
}
}