5 #include "math_gridinset.h"
6 #include "support/LOstream.h"
13 int const MATH_COLSEP = 10;
15 int const MATH_ROWSEP = 10;
17 int const MATH_BORDER = 2;
22 //////////////////////////////////////////////////////////////
25 MathGridInset::RowInfo::RowInfo()
26 : upperline_(false), lowerline_(false)
31 int MathGridInset::RowInfo::skipPixels() const
34 #warning fix this once the interface to LyXLength has improved
36 return int(skip_.value());
41 //////////////////////////////////////////////////////////////
44 MathGridInset::ColInfo::ColInfo()
45 : align_('c'), leftline_(false), rightline_(false), skip_(MATH_COLSEP)
49 //////////////////////////////////////////////////////////////
52 MathGridInset::MathGridInset(col_type m, row_type n)
53 : MathNestInset(m * n), rowinfo_(n), colinfo_(m), v_align_('c')
59 MathGridInset::MathGridInset(int m, int n, char v, string const & h)
60 : MathNestInset(m * n), rowinfo_(n), colinfo_(m), v_align_(v)
68 MathInset::idx_type MathGridInset::index(row_type row, col_type col) const
70 return col + ncols() * row;
74 void MathGridInset::setDefaults()
77 lyxerr << "positve number of columns expected\n";
79 lyxerr << "positve number of rows expected\n";
80 for (col_type col = 0; col < ncols(); ++col) {
81 colinfo_[col].align_ = defaultColAlign(col);
82 colinfo_[col].skip_ = defaultColSpace(col);
87 void MathGridInset::halign(string const & hh)
89 col_type n = hh.size();
92 for (col_type col = 0; col < n; ++col)
93 colinfo_[col].align_ = hh[col];
97 void MathGridInset::halign(char h, col_type col)
99 colinfo_[col].align_ = h;
103 char MathGridInset::halign(col_type col) const
105 return colinfo_[col].align_;
110 void MathGridInset::valign(char c)
116 char MathGridInset::valign() const
123 void MathGridInset::vskip(LyXLength const & skip, row_type row)
125 rowinfo_[row].skip_ = skip;
129 LyXLength MathGridInset::vskip(row_type row) const
131 return rowinfo_[row].skip_;
135 void MathGridInset::metrics(MathStyles st) const
137 // let the cells adjust themselves
138 MathNestInset::metrics(st);
141 // adjust vertical structure
142 for (row_type row = 0; row < nrows(); ++row) {
145 for (col_type col = 0; col < ncols(); ++col) {
146 MathXArray const & c = xcell(index(row, col));
147 asc = std::max(asc, c.ascent());
148 desc = std::max(desc, c.descent());
150 rowinfo_[row].ascent_ = asc;
151 rowinfo_[row].descent_ = desc;
154 rowinfo_[row].offset_ =
155 rowinfo_[row - 1].offset_ +
156 rowinfo_[row - 1].descent_ +
157 rowinfo_[row - 1].skipPixels() +
159 rowinfo_[row].ascent_;
161 rowinfo_[row].offset_ = 0;
164 // adjust vertical offset
171 h = rowinfo_.back().offset_;
174 h = rowinfo_.back().offset_ / 2;
177 for (row_type row = 0; row < nrows(); ++row) {
178 rowinfo_[row].offset_ -= h;
179 rowinfo_[row].offset_ += MATH_BORDER;
182 // adjust horizontal structure
183 for (col_type col = 0; col < ncols(); ++col) {
185 for (row_type row = 0; row < nrows(); ++row)
186 wid = std::max(wid, xcell(index(row, col)).width());
187 colinfo_[col].width_ = wid;
188 colinfo_[col].offset_ = colinfo_[col].width_;
191 colinfo_[col].offset_ =
192 colinfo_[col - 1].offset_ +
193 colinfo_[col - 1].width_ +
194 colinfo_[col - 1].skip_;
196 colinfo_[col].offset_ = 0;
198 colinfo_[col].offset_ += MATH_BORDER;
201 width_ = colinfo_.back().offset_ + colinfo_.back().width_;
202 ascent_ = - rowinfo_.front().offset_ + rowinfo_.front().ascent_;
203 descent_ = rowinfo_.back().offset_ + rowinfo_.back().descent_;
206 // Increase ws_[i] for 'R' columns (except the first one)
207 for (int i = 1; i < nc_; ++i)
208 if (align_[i] == 'R')
209 ws_[i] += 10 * df_width;
210 // Increase ws_[i] for 'C' column
211 if (align_[0] == 'C')
212 if (ws_[0] < 7 * workwidth / 8)
213 ws_[0] = 7 * workwidth / 8;
217 for (cxrow = row_.begin(); cxrow; ++cxrow) {
218 int rg = MATH_COLSEP;
220 for (int i = 0; i < nc_; ++i) {
222 if (cxrow->getTab(i) <= 0) {
223 cxrow->setTab(i, df_width);
231 lf = (ws_[i] - cxrow->getTab(i))/2;
235 lf = ws_[i] - cxrow->getTab(i);
238 if (cxrow == row_.begin())
240 else if (cxrow.is_last())
241 lf = ws_[i] - cxrow->getTab(i);
243 lf = (ws_[i] - cxrow->getTab(i))/2;
246 int const ww = (isvoid) ? lf : lf + cxrow->getTab(i);
247 cxrow->setTab(i, lf + rg);
248 rg = ws_[i] - ww + MATH_COLSEP;
249 if (cxrow == row_.begin())
250 width += ws_[i] + MATH_COLSEP;
252 cxrow->setBaseline(cxrow->getBaseline() - ascent);
258 void MathGridInset::draw(Painter & pain, int x, int y) const
262 for (idx_type idx = 0; idx < nargs(); ++idx)
263 xcell(idx).draw(pain, x + cellXOffset(idx), y + cellYOffset(idx));
267 void MathGridInset::write(std::ostream & os, bool fragile) const
269 for (row_type row = 0; row < nrows(); ++row) {
270 for (col_type col = 0; col < ncols(); ++col) {
271 cell(index(row, col)).write(os, fragile);
272 os << eocString(col);
274 os << eolString(row);
279 void MathGridInset::writeNormal(std::ostream & os) const
282 for (row_type row = 0; row < nrows(); ++row) {
284 for (col_type col = 0; col < ncols(); ++col) {
286 cell(index(row, col)).writeNormal(os);
295 string MathGridInset::eolString(row_type row) const
297 if (row + 1 == nrows())
300 if (rowinfo_[row].skip_.value() != 0)
301 return "\\\\[" + rowinfo_[row].skip_.asLatexString() + "]\n";
303 // make sure an upcoming '[' does not break anything
304 MathArray const & c = cell(index(row + 1, 0));
305 if (c.size() && (*c.begin())->getChar() == '[')
306 return "\\\\[0pt]\n";
312 string MathGridInset::eocString(col_type col) const
314 if (col + 1 == ncols())
320 void MathGridInset::addRow(row_type row)
322 rowinfo_.insert(rowinfo_.begin() + row + 1, RowInfo());
323 cells_.insert(cells_.begin() + (row + 1) * ncols(), ncols(), MathXArray());
327 void MathGridInset::appendRow()
329 rowinfo_.push_back(RowInfo());
330 for (col_type col = 0; col < ncols(); ++col)
331 cells_.push_back(cells_type::value_type());
335 void MathGridInset::delRow(row_type row)
340 cells_type::iterator it = cells_.begin() + row * ncols();
341 cells_.erase(it, it + ncols());
343 rowinfo_.erase(rowinfo_.begin() + row);
347 void MathGridInset::addCol(col_type newcol)
349 const col_type nc = ncols();
350 const row_type nr = nrows();
351 cells_type new_cells((nc + 1) * nr);
353 for (row_type row = 0; row < nr; ++row)
354 for (col_type col = 0; col < nc; ++col)
355 new_cells[row * (nc + 1) + col + (col > newcol)]
356 = cells_[row * nc + col];
357 std::swap(cells_, new_cells);
360 inf.skip_ = defaultColSpace(newcol);
361 inf.align_ = defaultColAlign(newcol);
362 colinfo_.insert(colinfo_.begin() + newcol, inf);
366 void MathGridInset::delCol(col_type col)
372 for (col_type i = 0; i < nargs(); ++i)
373 if (i % ncols() != col)
374 tmpcells.push_back(cells_[i]);
375 std::swap(cells_, tmpcells);
377 colinfo_.erase(colinfo_.begin() + col);
381 int MathGridInset::cellXOffset(idx_type idx) const
383 col_type c = col(idx);
384 int x = colinfo_[c].offset_;
385 char align = colinfo_[c].align_;
386 if (align == 'r' || align == 'R')
387 x += colinfo_[c].width_ - xcell(idx).width();
388 if (align == 'c' || align == 'C')
389 x += (colinfo_[c].width_ - xcell(idx).width()) / 2;
394 int MathGridInset::cellYOffset(idx_type idx) const
396 return rowinfo_[row(idx)].offset_;
400 bool MathGridInset::idxUp(idx_type & idx, pos_type & pos) const
404 int x = cellXOffset(idx) + xcell(idx).pos2x(pos);
406 pos = xcell(idx).x2pos(x - cellXOffset(idx));
411 bool MathGridInset::idxDown(idx_type & idx, pos_type & pos) const
413 if (idx >= ncols() * (nrows() - 1))
415 int x = cellXOffset(idx) + xcell(idx).pos2x(pos);
417 pos = xcell(idx).x2pos(x - cellXOffset(idx));
422 bool MathGridInset::idxLeft(idx_type & idx, pos_type & pos) const
424 // leave matrix if on the left hand edge
428 pos = cell(idx).size();
433 bool MathGridInset::idxRight(idx_type & idx, pos_type & pos) const
435 // leave matrix if on the right hand edge
436 if (col(idx) == ncols() - 1)
444 bool MathGridInset::idxFirst(idx_type & idx, pos_type & pos) const
451 idx = (nrows() - 1) * ncols();
454 idx = (nrows() / 2) * ncols();
461 bool MathGridInset::idxLast(idx_type & idx, pos_type & pos) const
471 idx = (nrows() / 2 + 1) * ncols() - 1;
473 pos = cell(idx).size();
478 void MathGridInset::idxDelete(idx_type & idx, bool & popit, bool & deleteit)
483 // delete entire sequence of ncols() empty cells if possible
484 if (idx <= index(nrows() - 1, 0)) {
485 bool deleterow = true;
486 for (idx_type i = idx; i < idx + ncols(); ++i)
487 if (cell(i).size()) {
493 // move cells if necessary
494 for (idx_type i = index(row(idx), 0); i < idx; ++i)
495 cell(i).swap(cell(i + ncols()));
505 // undo effect of Ctrl-Tab (i.e. pull next cell)
506 //if (idx != nargs() - 1)
507 // cell(idx).swap(cell(idx + 1));
511 void MathGridInset::idxDeleteRange(idx_type /*from*/, idx_type /*to*/)
513 // leave this unimplemented unless someone wants to have it.
515 int n = (to - from) / ncols();
516 int r = from / ncols();
519 cells_type::iterator it = cells_.begin() + from;
520 cells_.erase(it, it + n * ncols());
521 rowinfo_.erase(rowinfo_.begin() + r, rowinfo_.begin() + r + n);
527 MathGridInset::RowInfo const & MathGridInset::rowinfo(row_type row) const
529 return rowinfo_[row];
533 MathGridInset::RowInfo & MathGridInset::rowinfo(row_type row)
535 return rowinfo_[row];
539 std::vector<MathInset::idx_type>
540 MathGridInset::idxBetween(idx_type from, idx_type to) const
542 row_type r1 = std::min(row(from), row(to));
543 row_type r2 = std::max(row(from), row(to));
544 col_type c1 = std::min(col(from), col(to));
545 col_type c2 = std::max(col(from), col(to));
546 std::vector<idx_type> res;
547 for (row_type i = r1; i <= r2; ++i)
548 for (col_type j = c1; j <= c2; ++j)
549 res.push_back(index(i, j));