#define MATHEDARRAY_H
#include <vector>
+#include <iosfwd>
#include "mathed/support.h"
class MathedArray {
public:
///
- typedef std::vector<byte> buffer_type;
- typedef byte value_type;
- typedef buffer_type::size_type size_type;
- typedef buffer_type::iterator iterator;
+ typedef std::vector<byte> buffer_type;
+ typedef byte value_type;
+ typedef buffer_type::size_type size_type;
+ typedef buffer_type::iterator iterator;
typedef buffer_type::const_iterator const_iterator;
///
- enum {
- ///
- ARRAY_STEP = 16,
- ///
- ARRAY_MIN_SIZE = 4
- };
-
+ MathedArray();
+ ///
+ MathedArray(MathedArray const &);
+ ///
+ MathedArray & operator=(MathedArray const &);
///
- explicit
- MathedArray(int size = ARRAY_STEP);
+ ~MathedArray();
///
iterator begin();
///
int empty() const;
+ ///
+ void clear();
///
int last() const;
///
void last(int l);
+ ///
+ void swap(MathedArray &);
+ ///
+ void shrink(int pos1, int pos2);
+
#if 0
///
void insert(iterator pos, const_iterator beg, const_iterator end);
#else
/// Merge \a dx elements from array \a a at \apos.
/// This doesn't changes the size (dangerous)
- void mergeF(MathedArray * a, int pos, int dx);
+ void merge(MathedArray const & a, int pos);
#endif
///
void raw_pointer_copy(MathedInset ** p, int pos) const;
+#if 0
+ ///
+ void insertInset(int pos, MathedInset * p, int type);
+ ///
+ MathedInset * getInset(int pos);
+#else
///
void raw_pointer_insert(void * p, int pos, int len);
+#endif
///
void strange_copy(MathedArray * dest, int dpos, int spos, int len);
///
void resize(int newsize);
/// Make sure we can access at least \a needed elements
void need_size(int needed);
+ ///
+ void dump(std::ostream &) const;
private:
/// Buffer
buffer_type bf_;
+#if 0
+ ///
+ struct InsetTable {
+ ///
+ int pos;
+ ///
+ MathedInset * inset;
+ ///
+ InsetTable(int p, MathedInset * i)
+ : pos(p), inset(i) {}
+
+ };
+ ///
+ typedef std::vector<InsetTable> InsetList;
+ /// The list of insets in this array.
+ InsetList insetList_;
+#endif
/// Last position inserted.
int last_;
};