#ifdef __GNUG__ #pragma implementation #endif #include "math_gridinset.h" #include "support/LOstream.h" #include "debug.h" namespace { /// int const MATH_COLSEP = 10; /// int const MATH_ROWSEP = 10; /// int const MATH_BORDER = 2; } ////////////////////////////////////////////////////////////// MathGridInset::RowInfo::RowInfo() : upperline_(false), lowerline_(false) {} int MathGridInset::RowInfo::skipPixels() const { #ifdef WITH_WARNINGS #warning fix this once the interface to LyXLength has improved #endif return int(skip_.value()); } ////////////////////////////////////////////////////////////// MathGridInset::ColInfo::ColInfo() : align_('c'), leftline_(false), rightline_(false), skip_(MATH_COLSEP) {} ////////////////////////////////////////////////////////////// MathGridInset::MathGridInset(col_type m, row_type n) : MathNestInset(m * n), rowinfo_(n), colinfo_(m), v_align_('c') { setDefaults(); } MathGridInset::MathGridInset(int m, int n, char v, string const & h) : MathNestInset(m * n), rowinfo_(n), colinfo_(m), v_align_(v) { setDefaults(); valign(v); halign(h); } MathInset::idx_type MathGridInset::index(row_type row, col_type col) const { return col + ncols() * row; } void MathGridInset::setDefaults() { if (ncols() <= 0) lyxerr << "positve number of columns expected\n"; if (nrows() <= 0) lyxerr << "positve number of rows expected\n"; for (col_type col = 0; col < ncols(); ++col) { colinfo_[col].align_ = defaultColAlign(col); colinfo_[col].skip_ = defaultColSpace(col); } } void MathGridInset::halign(string const & hh) { col_type n = hh.size(); if (n > ncols()) n = ncols(); for (col_type col = 0; col < n; ++col) colinfo_[col].align_ = hh[col]; } void MathGridInset::halign(char h, col_type col) { colinfo_[col].align_ = h; } char MathGridInset::halign(col_type col) const { return colinfo_[col].align_; } void MathGridInset::valign(char c) { v_align_ = c; } char MathGridInset::valign() const { return v_align_; } void MathGridInset::vskip(LyXLength const & skip, row_type row) { rowinfo_[row].skip_ = skip; } LyXLength MathGridInset::vskip(row_type row) const { return rowinfo_[row].skip_; } void MathGridInset::metrics(MathMetricsInfo const & st) const { // let the cells adjust themselves MathNestInset::metrics(st); size_ = st; // adjust vertical structure for (row_type row = 0; row < nrows(); ++row) { int asc = 0; int desc = 0; for (col_type col = 0; col < ncols(); ++col) { MathXArray const & c = xcell(index(row, col)); asc = std::max(asc, c.ascent()); desc = std::max(desc, c.descent()); } rowinfo_[row].ascent_ = asc; rowinfo_[row].descent_ = desc; if (row) rowinfo_[row].offset_ = rowinfo_[row - 1].offset_ + rowinfo_[row - 1].descent_ + rowinfo_[row - 1].skipPixels() + MATH_ROWSEP + rowinfo_[row].ascent_; else rowinfo_[row].offset_ = 0; } // adjust vertical offset int h = 0; switch (v_align_) { case 't': h = 0; break; case 'b': h = rowinfo_.back().offset_; break; default: h = rowinfo_.back().offset_ / 2; } for (row_type row = 0; row < nrows(); ++row) { rowinfo_[row].offset_ -= h; rowinfo_[row].offset_ += MATH_BORDER; } // adjust horizontal structure for (col_type col = 0; col < ncols(); ++col) { int wid = 0; for (row_type row = 0; row < nrows(); ++row) wid = std::max(wid, xcell(index(row, col)).width()); colinfo_[col].width_ = wid; colinfo_[col].offset_ = colinfo_[col].width_; if (col) colinfo_[col].offset_ = colinfo_[col - 1].offset_ + colinfo_[col - 1].width_ + colinfo_[col - 1].skip_; else colinfo_[col].offset_ = 0; colinfo_[col].offset_ += MATH_BORDER; } width_ = colinfo_.back().offset_ + colinfo_.back().width_; ascent_ = - rowinfo_.front().offset_ + rowinfo_.front().ascent_; descent_ = rowinfo_.back().offset_ + rowinfo_.back().descent_; /* // Increase ws_[i] for 'R' columns (except the first one) for (int i = 1; i < nc_; ++i) if (align_[i] == 'R') ws_[i] += 10 * df_width; // Increase ws_[i] for 'C' column if (align_[0] == 'C') if (ws_[0] < 7 * workwidth / 8) ws_[0] = 7 * workwidth / 8; // Adjust local tabs width = MATH_COLSEP; for (cxrow = row_.begin(); cxrow; ++cxrow) { int rg = MATH_COLSEP; int lf = 0; for (int i = 0; i < nc_; ++i) { bool isvoid = false; if (cxrow->getTab(i) <= 0) { cxrow->setTab(i, df_width); isvoid = true; } switch (align_[i]) { case 'l': lf = 0; break; case 'c': lf = (ws_[i] - cxrow->getTab(i))/2; break; case 'r': case 'R': lf = ws_[i] - cxrow->getTab(i); break; case 'C': if (cxrow == row_.begin()) lf = 0; else if (cxrow.is_last()) lf = ws_[i] - cxrow->getTab(i); else lf = (ws_[i] - cxrow->getTab(i))/2; break; } int const ww = (isvoid) ? lf : lf + cxrow->getTab(i); cxrow->setTab(i, lf + rg); rg = ws_[i] - ww + MATH_COLSEP; if (cxrow == row_.begin()) width += ws_[i] + MATH_COLSEP; } cxrow->setBaseline(cxrow->getBaseline() - ascent); } */ } void MathGridInset::draw(Painter & pain, int x, int y) const { xo(x); yo(y); for (idx_type idx = 0; idx < nargs(); ++idx) xcell(idx).draw(pain, x + cellXOffset(idx), y + cellYOffset(idx)); } void MathGridInset::write(MathWriteInfo & os) const { for (row_type row = 0; row < nrows(); ++row) { for (col_type col = 0; col < ncols(); ++col) os << cell(index(row, col)) << eocString(col); os << eolString(row); } } void MathGridInset::writeNormal(std::ostream & os) const { os << "[grid "; for (row_type row = 0; row < nrows(); ++row) { os << "[row "; for (col_type col = 0; col < ncols(); ++col) { os << "[cell "; cell(index(row, col)).writeNormal(os); os << "]"; } os << "]"; } os << "]"; } string MathGridInset::eolString(row_type row) const { if (row + 1 == nrows()) return ""; if (rowinfo_[row].skip_.value() != 0) return "\\\\[" + rowinfo_[row].skip_.asLatexString() + "]\n"; // make sure an upcoming '[' does not break anything MathArray const & c = cell(index(row + 1, 0)); if (c.size() && (*c.begin())->getChar() == '[') return "\\\\[0pt]\n"; return "\\\\\n"; } string MathGridInset::eocString(col_type col) const { if (col + 1 == ncols()) return ""; return " & "; } void MathGridInset::addRow(row_type row) { rowinfo_.insert(rowinfo_.begin() + row + 1, RowInfo()); cells_.insert(cells_.begin() + (row + 1) * ncols(), ncols(), MathXArray()); } void MathGridInset::appendRow() { rowinfo_.push_back(RowInfo()); for (col_type col = 0; col < ncols(); ++col) cells_.push_back(cells_type::value_type()); } void MathGridInset::delRow(row_type row) { if (nrows() == 1) return; cells_type::iterator it = cells_.begin() + row * ncols(); cells_.erase(it, it + ncols()); rowinfo_.erase(rowinfo_.begin() + row); } void MathGridInset::addCol(col_type newcol) { const col_type nc = ncols(); const row_type nr = nrows(); cells_type new_cells((nc + 1) * nr); for (row_type row = 0; row < nr; ++row) for (col_type col = 0; col < nc; ++col) new_cells[row * (nc + 1) + col + (col > newcol)] = cells_[row * nc + col]; std::swap(cells_, new_cells); ColInfo inf; inf.skip_ = defaultColSpace(newcol); inf.align_ = defaultColAlign(newcol); colinfo_.insert(colinfo_.begin() + newcol, inf); } void MathGridInset::delCol(col_type col) { if (ncols() == 1) return; cells_type tmpcells; for (col_type i = 0; i < nargs(); ++i) if (i % ncols() != col) tmpcells.push_back(cells_[i]); std::swap(cells_, tmpcells); colinfo_.erase(colinfo_.begin() + col); } int MathGridInset::cellXOffset(idx_type idx) const { col_type c = col(idx); int x = colinfo_[c].offset_; char align = colinfo_[c].align_; if (align == 'r' || align == 'R') x += colinfo_[c].width_ - xcell(idx).width(); if (align == 'c' || align == 'C') x += (colinfo_[c].width_ - xcell(idx).width()) / 2; return x; } int MathGridInset::cellYOffset(idx_type idx) const { return rowinfo_[row(idx)].offset_; } bool MathGridInset::idxUp(idx_type & idx, pos_type & pos) const { if (idx < ncols()) return false; int x = cellXOffset(idx) + xcell(idx).pos2x(pos); idx -= ncols(); pos = xcell(idx).x2pos(x - cellXOffset(idx)); return true; } bool MathGridInset::idxDown(idx_type & idx, pos_type & pos) const { if (idx >= ncols() * (nrows() - 1)) return false; int x = cellXOffset(idx) + xcell(idx).pos2x(pos); idx += ncols(); pos = xcell(idx).x2pos(x - cellXOffset(idx)); return true; } bool MathGridInset::idxLeft(idx_type & idx, pos_type & pos) const { // leave matrix if on the left hand edge if (col(idx) == 0) return false; idx--; pos = cell(idx).size(); return true; } bool MathGridInset::idxRight(idx_type & idx, pos_type & pos) const { // leave matrix if on the right hand edge if (col(idx) == ncols() - 1) return false; idx++; pos = 0; return true; } bool MathGridInset::idxFirst(idx_type & idx, pos_type & pos) const { switch (v_align_) { case 't': idx = 0; break; case 'b': idx = (nrows() - 1) * ncols(); break; default: idx = (nrows() / 2) * ncols(); } pos = 0; return true; } bool MathGridInset::idxLast(idx_type & idx, pos_type & pos) const { switch (v_align_) { case 't': idx = ncols() - 1; break; case 'b': idx = nargs() - 1; break; default: idx = (nrows() / 2 + 1) * ncols() - 1; } pos = cell(idx).size(); return true; } void MathGridInset::idxDelete(idx_type & idx, bool & popit, bool & deleteit) { popit = false; deleteit = false; // delete entire sequence of ncols() empty cells if possible if (idx <= index(nrows() - 1, 0)) { bool deleterow = true; for (idx_type i = idx; i < idx + ncols(); ++i) if (cell(i).size()) { deleterow = false; break; } if (deleterow) { // move cells if necessary for (idx_type i = index(row(idx), 0); i < idx; ++i) cell(i).swap(cell(i + ncols())); delRow(row(idx)); if (idx >= nargs()) idx = nargs() - 1; return; } } // undo effect of Ctrl-Tab (i.e. pull next cell) //if (idx != nargs() - 1) // cell(idx).swap(cell(idx + 1)); } void MathGridInset::idxDeleteRange(idx_type /*from*/, idx_type /*to*/) { // leave this unimplemented unless someone wants to have it. /* int n = (to - from) / ncols(); int r = from / ncols(); if (n >= 1) { cells_type::iterator it = cells_.begin() + from; cells_.erase(it, it + n * ncols()); rowinfo_.erase(rowinfo_.begin() + r, rowinfo_.begin() + r + n); } */ } MathGridInset::RowInfo const & MathGridInset::rowinfo(row_type row) const { return rowinfo_[row]; } MathGridInset::RowInfo & MathGridInset::rowinfo(row_type row) { return rowinfo_[row]; } std::vector MathGridInset::idxBetween(idx_type from, idx_type to) const { row_type r1 = std::min(row(from), row(to)); row_type r2 = std::max(row(from), row(to)); col_type c1 = std::min(col(from), col(to)); col_type c2 = std::max(col(from), col(to)); std::vector res; for (row_type i = r1; i <= r2; ++i) for (col_type j = c1; j <= c2; ++j) res.push_back(index(i, j)); return res; }