kspread_cluster.h

/* This file is part of the KDE project
   Copyright (C) 2000 Torben Weis <weis@kde.org>
 
   This library is free software; you can redistribute it and/or
   modify it under the terms of the GNU Library General Public
   License as published by the Free Software Foundation; either
   version 2 of the License, or (at your option) any later version.
 
   This library is distributed in the hope that it will be useful,
   but WITHOUT ANY WARRANTY; without even the implied warranty of
   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
   Library General Public License for more details.
 
   You should have received a copy of the GNU Library General Public License
   along with this library; see the file COPYING.LIB.  If not, write to
   the Free Software Foundation, Inc., 51 Franklin Street, Fifth Floor,
 * Boston, MA 02110-1301, USA.
*/
 
#ifndef kspread_cluster_h
#define kspread_cluster_h
 
#include "kspread_value.h"
 
#define KSPREAD_CLUSTER_LEVEL1 128
#define KSPREAD_CLUSTER_LEVEL2 256
#define KSPREAD_CLUSTER_MAX (128*256)
 
class TQPoint;
 
namespace KSpread
{
class Cell;
class ColumnFormat;
class RowFormat;
 
class Cluster
{
public:
    Cluster();
    ~Cluster();
 
    Cell* lookup( int x, int y ) const;
 
    void clear();
 
    void insert( Cell* cell, int x, int y );
    void remove( int x, int y );
 
    void setAutoDelete( bool );
    bool autoDelete() const;
 
    Cell* firstCell() const;
 
    bool shiftRow( const TQPoint& marker );
    bool shiftColumn( const TQPoint& marker );
 
    void unshiftColumn( const TQPoint& marker );
    void unshiftRow( const TQPoint& marker );
 
    bool insertColumn( int col );
    bool insertRow( int row );
 
    void removeColumn( int col );
    void removeRow( int row );
 
    void clearColumn( int col );
    void clearRow( int row );
 
  Value valueRange (int col1, int row1, int col2, int row2) const;
 
  Cell* getFirstCellColumn(int col) const;
 
  Cell* getLastCellColumn(int col) const;
 
  Cell* getFirstCellRow(int row) const;
 
  Cell* getLastCellRow(int row) const;
 
  Cell* getNextCellUp(int col, int row) const;
 
  Cell* getNextCellDown(int col, int row) const;
 
  Cell* getNextCellRight(int col, int row) const;
 
  Cell* getNextCellLeft(int col, int row) const;
 
private:
    bool shiftRow( const TQPoint& marker, bool& work );
    bool shiftColumn( const TQPoint& marker, bool& work );
 
    void unshiftColumn( const TQPoint& marker, bool& work );
    void unshiftRow( const TQPoint& marker, bool& work );
 
    Value makeArray (int col1, int row1, int col2, int row2) const;
 
    Cell*** m_cluster;
    Cell* m_first;
    bool m_autoDelete;
    int m_biggestX, m_biggestY;
};
 
class ColumnCluster
{
public:
    ColumnCluster();
    ~ColumnCluster();
 
    const ColumnFormat* lookup( int col ) const;
    ColumnFormat* lookup( int col );
 
    void clear();
 
    void insertElement( ColumnFormat*, int col );
    void removeElement( int col );
 
    bool insertColumn( int col );
    bool removeColumn( int col );
 
    void setAutoDelete( bool );
    bool autoDelete() const;
 
    ColumnFormat* first() const { return m_first; }
    ColumnFormat* next( int col ) const;
 
private:
    ColumnFormat*** m_cluster;
    ColumnFormat* m_first;
    bool m_autoDelete;
};
 
class RowCluster
{
public:
    RowCluster();
    ~RowCluster();
 
    const RowFormat* lookup( int col ) const;
    RowFormat* lookup( int col );
 
    void clear();
 
    void insertElement( RowFormat*, int row );
    void removeElement( int row );
 
    bool insertRow( int row );
    bool removeRow( int row );
 
    void setAutoDelete( bool );
    bool autoDelete() const;
 
    RowFormat* first()const { return m_first; }
 
private:
    RowFormat*** m_cluster;
    RowFormat* m_first;
    bool m_autoDelete;
};
 
} // namespace KSpread;
 
#endif