#include "Buffer.h"
#include "BufferParams.h"
#include "BranchList.h"
-#include "debug.h"
+#include "support/debug.h"
#include "insets/InsetBranch.h"
-using std::endl;
-using std::lower_bound;
-
+using namespace std;
namespace lyx {
typedef InsetList::InsetTable Table;
-class InsetTablePosLess : public std::binary_function<Table, Table, bool> {
-public:
+struct InsetTablePosLess
+{
bool operator()(Table const & t1, Table const & t2) const
{
return t1.pos < t2.pos;
List::iterator end = list_.end();
List::iterator it = insetIterator(pos);
if (it != end && it->pos == pos) {
- lyxerr << "ERROR (InsetList::insert): "
- << "There is an inset in position: " << pos << endl;
+ LYXERR0("ERROR (InsetList::insert): "
+ << "There is an inset in position: " << pos);
} else {
list_.insert(it, InsetTable(pos, inset));
}
}
-void InsetList::clone()
+InsetList::InsetList(InsetList const & il)
{
+ list_ = il.list_;
List::iterator it = list_.begin();
List::iterator end = list_.end();
for (; it != end; ++it)
it->inset = it->inset->clone();
}
+
+pos_type InsetList::find(InsetCode code, pos_type startpos) const
+{
+ List::const_iterator it = insetIterator(startpos);
+ List::const_iterator end = list_.end();
+ for (; it != end ; ++it) {
+ if (it->inset->lyxCode() == code)
+ return it->pos;
+ }
+ return -1;
+}
+
+
+int InsetList::count(InsetCode code, pos_type startpos) const
+{
+ int num = 0;
+ List::const_iterator it = insetIterator(startpos);
+ List::const_iterator end = list_.end();
+ for (; it != end ; ++it) {
+ if (it->inset->lyxCode() == code)
+ ++num;
+ }
+ return num;
+}
+
} // namespace lyx