}
*/
-
+/*
/// moves position closest to (x, y) in given box
bool bruteFind3(Cursor & cur, int x, int y, bool up)
{
cur.setCursor(best_cursor);
return true;
}
-
+*/
} // namespace anon
BufferView & Cursor::bv() const
{
- LBUFERR(bv_, _("Cursor has no BufferView!"));
+ LBUFERR(bv_);
return *bv_;
}
void Cursor::pop()
{
- LBUFERR(depth() >= 1, _("Attempt to pop empty cursor!"));
+ LBUFERR(depth() >= 1);
pop_back();
}
{
if (!selection())
return top();
- if (anchor_.depth() >= depth()) {
- // LASSERT: There have been several bugs around this code, that seem
- // to involve failures to reset the anchor. We can at least not crash
- // in release mode by resetting it ourselves.
- LASSERT(false, /* */);
- DocIterator & di = const_cast<DocIterator &>(anchor_);
- di = *this;
- }
+ // LASSERT: There have been several bugs around this code, that seem
+ // to involve failures to reset the anchor. We can at least not crash
+ // in release mode by resetting it ourselves.
+ LASSERT(anchor_.depth() >= depth(),
+ const_cast<DocIterator &>(anchor_) = *this);
+
CursorSlice normal = anchor_[depth() - 1];
if (depth() < anchor_.depth() && top() <= normal) {
// anchor is behind cursor -> move anchor behind the inset