X-Git-Url: https://git.lyx.org/gitweb/?a=blobdiff_plain;f=src%2Fmathed%2Farray.C;h=48deaf73ab7066e3b125c9b91b8cb0d7bb11a3bb;hb=dff2911bda426ad439e6475f62183cedd7044801;hp=c520fa99ad7f422fa2fef3ebfd2c0ba299485d63;hpb=8d7fe83bf5f6a7650668adaf2999ab934e05a89a;p=features.git diff --git a/src/mathed/array.C b/src/mathed/array.C index c520fa99ad..48deaf73ab 100644 --- a/src/mathed/array.C +++ b/src/mathed/array.C @@ -1,227 +1,270 @@ - -#include - #ifdef __GNUG__ #pragma implementation #endif -#include "array.h" -#include "math_iter.h" #include "math_inset.h" +#include "math_charinset.h" +#include "math_scriptinset.h" +#include "math_stringinset.h" +#include "debug.h" +#include "array.h" +#include "mathed/support.h" +#include "support/LAssert.h" + +using std::ostream; +using std::endl; + + +MathArray::MathArray() +{} -// Is this still needed? (Lgb) -static inline -void * my_memcpy(void * ps_in, void const * pt_in, size_t n) + +MathArray::MathArray(MathArray const & array, size_type from, size_type to) + : bf_(array.begin() + from, array.begin() + to) +{} + + +void MathArray::substitute(MathMacro const & m) { - char * ps = static_cast(ps_in); - char const * pt = static_cast(pt_in); - while (n--) *ps++ = *pt++; - return ps_in; + for (iterator it = begin(); it != end(); ++it) + it->nucleus()->substitute(m); } -MathedArray::MathedArray() - : bf_(1, '\0'), last_(0) -{} +MathScriptInset const * MathArray::asScript(const_iterator it) const +{ + if (it->nucleus()->asScriptInset()) + return 0; + const_iterator jt = it + 1; + if (jt == end()) + return 0; + return jt->nucleus()->asScriptInset(); +} -MathedArray::~MathedArray() +MathAtom & MathArray::at(size_type pos) { - // deep destruction - // let's leak for a while... -/* - MathedIter it; - it.SetData(this); - while (it.OK()) { - if (it.IsInset()) { - MathedInset * inset = it.GetInset(); - delete inset; - } - it.Next(); - } -*/ + lyx::Assert(pos < size()); + return bf_[pos]; } -MathedArray::MathedArray(MathedArray const & array) +MathAtom const & MathArray::at(size_type pos) const { - // this "implementation" is obviously wrong: MathedIter should be - // implemented by MathedArray (not the other way round) but I think - // getting the _interface_ of MathedArray right is more important right - // now (Andre') + lyx::Assert(pos < size()); + return bf_[pos]; +} - // shallow copy - bf_ = array.bf_; - last_ = array.last_; - // deep copy - // we'll not yet get exeption safety - MathedIter it(this); - while (it.OK()) { - if (it.IsInset()) { - MathedInset * inset = it.GetInset(); - inset = inset->Clone(); - raw_pointer_insert(inset, it.getPos() + 1, sizeof(inset)); - } - it.Next(); - } +void MathArray::insert(size_type pos, MathAtom const & t) +{ + bf_.insert(begin() + pos, t); +} + + +void MathArray::insert(size_type pos, MathArray const & array) +{ + bf_.insert(begin() + pos, array.begin(), array.end()); } -MathedArray & MathedArray::operator=(MathedArray const & array) +void MathArray::push_back(MathAtom const & t) +{ + bf_.push_back(t); +} + + +void MathArray::push_back(MathArray const & array) { - MathedArray tmp(array); - swap(tmp); - return *this; + insert(size(), array); } -void MathedArray::swap(MathedArray & array) + +void MathArray::clear() { - if (this != &array) { + erase(); +} + + +void MathArray::swap(MathArray & array) +{ + if (this != &array) bf_.swap(array.bf_); - std::swap(last_, array.last_); - } } -MathedArray::iterator MathedArray::begin() +bool MathArray::empty() const { - return bf_.begin(); + return bf_.empty(); } -MathedArray::iterator MathedArray::end() +MathArray::size_type MathArray::size() const { - return bf_.end(); + return bf_.size(); } -MathedArray::const_iterator MathedArray::begin() const +void MathArray::erase() { - return bf_.begin(); + erase(0, size()); } -MathedArray::const_iterator MathedArray::end() const +void MathArray::erase(size_type pos) { - return bf_.end(); + if (pos < size()) + erase(pos, pos + 1); } -int MathedArray::empty() const +void MathArray::erase(size_type pos1, size_type pos2) { - return (last_ == 0); + bf_.erase(begin() + pos1, begin() + pos2); } - -int MathedArray::last() const + +MathAtom & MathArray::back() { - return last_; + return bf_.back(); } -void MathedArray::last(int l) +void MathArray::dump2(ostream & os) const { - last_ = l; + for (const_iterator it = begin(); it != end(); ++it) + os << it->nucleus() << ' '; } -void MathedArray::need_size(int needed) +void MathArray::dump(ostream & os) const { - if (needed >= static_cast(bf_.size())) - resize(needed); + for (const_iterator it = begin(); it != end(); ++it) + os << "<" << it->nucleus() << ">"; } -void MathedArray::resize(int newsize) +std::ostream & operator<<(std::ostream & os, MathArray const & ar) { - // still a bit smelly... - ++newsize; - bf_.resize(newsize + 1); - if (last_ >= newsize) - last_ = newsize - 1; - bf_[last_] = 0; + ar.dump2(os); + return os; } -void MathedArray::move(int p, int shift) +// returns sequence of char with same code starting at it up to end +// it might be less, though... +string charSequence(MathArray::const_iterator it, MathArray::const_iterator end) { - if (p <= last_) { - need_size(last_ + shift); - memmove(&bf_[p + shift], &bf_[p], last_ - p); - last_ += shift; - bf_[last_] = 0; + string s; + MathCharInset const * p = it->nucleus()->asCharInset(); + if (!p) + return s; + + for (MathTextCodes c = p->code(); it != end; ++it) { + if (!it->nucleus()) + break; + p = it->nucleus()->asCharInset(); + if (!p || p->code() != c) + break; + s += p->getChar(); } + return s; } -#if 0 -void MathedArray::insert(MathedArray::iterator pos, - MathedArray::const_iterator beg, - MathedArray::const_iterator end) +MathArray MathArray::glueChars() const { - bf_.insert(pos, beg, end); - last_ = bf_.size() - 1; + MathArray ar; + const_iterator it = begin(); + while (it != end()) { + if (it->nucleus() && it->nucleus()->asCharInset()) { + string s = charSequence(it, end()); + MathTextCodes c = it->nucleus()->asCharInset()->code(); + ar.push_back(MathAtom(new MathStringInset(s, c))); + it += s.size(); + } else { + ar.push_back(*it); + ++it; + } + } + return ar; } -#else -void MathedArray::mergeF(MathedArray * a, int p, int dx) + + +void MathArray::write(MathWriteInfo & wi) const { - my_memcpy(&bf_[p], &a->bf_[0], dx); + glueChars().write1(wi); } -#endif -void MathedArray::raw_pointer_copy(MathedInset ** p, int pos) const +void MathArray::write1(MathWriteInfo & wi) const { - my_memcpy(p, &bf_[pos], sizeof(MathedInset*)); + for (const_iterator it = begin(); it != end(); ++it) { + MathInset * p = it->nucleus(); + if (!p) + continue; + if (MathScriptInset const * q = asScript(it)) { + q->write(p, wi); + ++it; + } else { + p->write(wi); + } + } } -#if 0 -void MathedArray::insertInset(int pos, MathedInset * p, int type) +void MathArray::writeNormal(ostream & os) const { - //bf_.insert(pos, type); - InsetTable tmp(pos, p); - insetList_.push_back(tmp); + for (const_iterator it = begin(); it != end(); ++it) { + MathInset * p = it->nucleus(); + if (!p) + continue; + if (MathScriptInset const * q = asScript(it)) { + q->writeNormal(p, os); + ++it; + } else { + p->writeNormal(os); + } + } } -MathedInset * MathedArray::getInset(int pos) +void MathArray::validate(LaTeXFeatures & features) const { - InsetList::const_iterator cit = insetList_.begin(); - InsetList::const_iterator end = insetList_.end(); - for (; cit != end; ++cit) { - if ((*cit).pos == pos) - return (*cit).inset; + for (const_iterator it = begin(); it != end(); ++it) + it->nucleus()->validate(features); +} + + +void MathArray::pop_back() +{ + if (!size()) { + lyxerr << "pop_back from empty array!\n"; + return; } - // not found - return 0; - // We would really like to throw an exception instead... (Lgb) - // throw inset_not_found(); + bf_.pop_back(); } -#else -void MathedArray::raw_pointer_insert(void * p, int pos, int len) + +MathArray::const_iterator MathArray::begin() const { - my_memcpy(&bf_[pos], &p, len); + return bf_.begin(); } -#endif -void MathedArray::strange_copy(MathedArray * dest, int dpos, - int spos, int len) +MathArray::const_iterator MathArray::end() const { - my_memcpy(&dest->bf_[dpos], &bf_[spos], len); + return bf_.end(); } -byte MathedArray::operator[](int i) const +MathArray::iterator MathArray::begin() { - return bf_[i]; + return bf_.begin(); } -byte & MathedArray::operator[](int i) +MathArray::iterator MathArray::end() { - return bf_[i]; + return bf_.end(); }