2001-08-03 17:10:22 +00:00
|
|
|
#ifdef __GNUG__
|
|
|
|
#pragma implementation
|
|
|
|
#endif
|
|
|
|
|
|
|
|
#include "math_nestinset.h"
|
2002-02-11 15:55:13 +00:00
|
|
|
#include "math_cursor.h"
|
2001-11-08 12:06:56 +00:00
|
|
|
#include "math_mathmlstream.h"
|
2001-08-03 17:10:22 +00:00
|
|
|
#include "debug.h"
|
|
|
|
|
|
|
|
|
2001-09-26 16:52:34 +00:00
|
|
|
MathNestInset::MathNestInset(idx_type nargs)
|
2001-08-03 17:55:10 +00:00
|
|
|
: MathDimInset(), cells_(nargs)
|
2001-08-08 17:26:30 +00:00
|
|
|
{}
|
2001-08-03 17:10:22 +00:00
|
|
|
|
|
|
|
|
2001-09-26 16:52:34 +00:00
|
|
|
MathInset::idx_type MathNestInset::nargs() const
|
2001-08-03 17:10:22 +00:00
|
|
|
{
|
|
|
|
return cells_.size();
|
|
|
|
}
|
|
|
|
|
|
|
|
|
2001-09-26 16:52:34 +00:00
|
|
|
MathXArray & MathNestInset::xcell(idx_type i)
|
2001-08-03 17:10:22 +00:00
|
|
|
{
|
|
|
|
return cells_[i];
|
|
|
|
}
|
|
|
|
|
|
|
|
|
2001-09-26 16:52:34 +00:00
|
|
|
MathXArray const & MathNestInset::xcell(idx_type i) const
|
2001-08-03 17:10:22 +00:00
|
|
|
{
|
|
|
|
return cells_[i];
|
|
|
|
}
|
|
|
|
|
|
|
|
|
2001-09-26 16:52:34 +00:00
|
|
|
MathArray & MathNestInset::cell(idx_type i)
|
2001-08-03 17:10:22 +00:00
|
|
|
{
|
|
|
|
return cells_[i].data_;
|
|
|
|
}
|
|
|
|
|
|
|
|
|
2001-09-26 16:52:34 +00:00
|
|
|
MathArray const & MathNestInset::cell(idx_type i) const
|
2001-08-03 17:10:22 +00:00
|
|
|
{
|
|
|
|
return cells_[i].data_;
|
|
|
|
}
|
|
|
|
|
|
|
|
|
2001-09-11 15:46:51 +00:00
|
|
|
void MathNestInset::substitute(MathMacro const & m)
|
2001-08-03 17:10:22 +00:00
|
|
|
{
|
2001-09-26 16:52:34 +00:00
|
|
|
for (idx_type i = 0; i < nargs(); ++i)
|
2001-09-11 15:46:51 +00:00
|
|
|
cell(i).substitute(m);
|
2001-08-03 17:10:22 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
|
2001-10-22 15:37:49 +00:00
|
|
|
void MathNestInset::metrics(MathMetricsInfo const & mi) const
|
2001-08-03 17:10:22 +00:00
|
|
|
{
|
2002-02-11 08:19:02 +00:00
|
|
|
MathMetricsInfo m = mi;
|
|
|
|
m.inset = this;
|
|
|
|
for (idx_type i = 0; i < nargs(); ++i) {
|
|
|
|
m.idx = i;
|
|
|
|
xcell(i).metrics(m);
|
|
|
|
}
|
2001-08-03 17:10:22 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
|
2001-09-26 16:52:34 +00:00
|
|
|
bool MathNestInset::idxNext(idx_type & idx, pos_type & pos) const
|
2001-08-03 17:10:22 +00:00
|
|
|
{
|
|
|
|
if (idx + 1 >= nargs())
|
|
|
|
return false;
|
|
|
|
++idx;
|
|
|
|
pos = 0;
|
|
|
|
return true;
|
|
|
|
}
|
|
|
|
|
|
|
|
|
2001-09-26 16:52:34 +00:00
|
|
|
bool MathNestInset::idxRight(idx_type & idx, pos_type & pos) const
|
2001-08-03 17:10:22 +00:00
|
|
|
{
|
|
|
|
return idxNext(idx, pos);
|
|
|
|
}
|
|
|
|
|
|
|
|
|
2001-09-26 16:52:34 +00:00
|
|
|
bool MathNestInset::idxPrev(idx_type & idx, pos_type & pos) const
|
2001-08-03 17:10:22 +00:00
|
|
|
{
|
|
|
|
if (idx == 0)
|
|
|
|
return false;
|
|
|
|
--idx;
|
|
|
|
pos = cell(idx).size();
|
|
|
|
return true;
|
|
|
|
}
|
|
|
|
|
|
|
|
|
2001-09-26 16:52:34 +00:00
|
|
|
bool MathNestInset::idxLeft(idx_type & idx, pos_type & pos) const
|
2001-08-03 17:10:22 +00:00
|
|
|
{
|
|
|
|
return idxPrev(idx, pos);
|
|
|
|
}
|
|
|
|
|
|
|
|
|
2001-09-26 16:52:34 +00:00
|
|
|
bool MathNestInset::idxFirst(idx_type & i, pos_type & pos) const
|
2001-08-03 17:10:22 +00:00
|
|
|
{
|
|
|
|
if (nargs() == 0)
|
|
|
|
return false;
|
|
|
|
i = 0;
|
|
|
|
pos = 0;
|
|
|
|
return true;
|
|
|
|
}
|
|
|
|
|
|
|
|
|
2001-09-26 16:52:34 +00:00
|
|
|
bool MathNestInset::idxLast(idx_type & i, pos_type & pos) const
|
2001-08-03 17:10:22 +00:00
|
|
|
{
|
|
|
|
if (nargs() == 0)
|
|
|
|
return false;
|
|
|
|
i = nargs() - 1;
|
|
|
|
pos = cell(i).size();
|
|
|
|
return true;
|
|
|
|
}
|
|
|
|
|
|
|
|
|
2001-09-26 16:52:34 +00:00
|
|
|
bool MathNestInset::idxHome(idx_type & /* idx */, pos_type & pos) const
|
2001-08-03 17:10:22 +00:00
|
|
|
{
|
|
|
|
if (pos == 0)
|
|
|
|
return false;
|
|
|
|
pos = 0;
|
|
|
|
return true;
|
|
|
|
}
|
|
|
|
|
|
|
|
|
2001-09-26 16:52:34 +00:00
|
|
|
bool MathNestInset::idxEnd(idx_type & idx, pos_type & pos) const
|
2001-08-03 17:10:22 +00:00
|
|
|
{
|
2001-09-26 16:52:34 +00:00
|
|
|
pos_type n = cell(idx).size();
|
2001-09-14 14:05:57 +00:00
|
|
|
if (pos == n)
|
2001-08-03 17:10:22 +00:00
|
|
|
return false;
|
2001-09-14 14:05:57 +00:00
|
|
|
pos = n;
|
2001-08-03 17:10:22 +00:00
|
|
|
return true;
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
void MathNestInset::dump() const
|
|
|
|
{
|
2001-11-09 08:35:57 +00:00
|
|
|
WriteStream os(lyxerr);
|
2001-10-19 11:25:48 +00:00
|
|
|
os << "---------------------------------------------\n";
|
|
|
|
write(os);
|
|
|
|
os << "\n";
|
2001-09-26 16:52:34 +00:00
|
|
|
for (idx_type i = 0; i < nargs(); ++i)
|
2001-10-19 11:25:48 +00:00
|
|
|
os << cell(i) << "\n";
|
|
|
|
os << "---------------------------------------------\n";
|
2001-08-03 17:10:22 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
void MathNestInset::validate(LaTeXFeatures & features) const
|
|
|
|
{
|
2001-09-26 16:52:34 +00:00
|
|
|
for (idx_type i = 0; i < nargs(); ++i)
|
2001-08-03 17:10:22 +00:00
|
|
|
cell(i).validate(features);
|
|
|
|
}
|
2001-10-24 09:16:06 +00:00
|
|
|
|
|
|
|
|
2001-11-16 09:07:40 +00:00
|
|
|
bool MathNestInset::match(MathInset * p) const
|
|
|
|
{
|
|
|
|
if (nargs() != p->nargs())
|
|
|
|
return false;
|
|
|
|
for (idx_type i = 0; i < nargs(); ++i)
|
|
|
|
if (!cell(i).match(p->cell(i)))
|
|
|
|
return false;
|
|
|
|
return true;
|
|
|
|
}
|
2001-11-16 09:55:37 +00:00
|
|
|
|
|
|
|
|
|
|
|
void MathNestInset::replace(ReplaceData & rep)
|
|
|
|
{
|
|
|
|
for (idx_type i = 0; i < nargs(); ++i)
|
|
|
|
cell(i).replace(rep);
|
|
|
|
}
|
2002-02-01 17:01:30 +00:00
|
|
|
|
|
|
|
|
|
|
|
bool MathNestInset::contains(MathArray const & ar)
|
|
|
|
{
|
|
|
|
for (idx_type i = 0; i < nargs(); ++i)
|
|
|
|
if (cell(i).contains(ar))
|
|
|
|
return true;
|
|
|
|
return false;
|
|
|
|
}
|
2002-02-11 15:55:13 +00:00
|
|
|
|
|
|
|
|
|
|
|
bool MathNestInset::editing() const
|
|
|
|
{
|
|
|
|
return mathcursor && mathcursor->isInside(this);
|
|
|
|
}
|