/**************************************************************
 * 
 * Licensed to the Apache Software Foundation (ASF) under one
 * or more contributor license agreements.  See the NOTICE file
 * distributed with this work for additional information
 * regarding copyright ownership.  The ASF licenses this file
 * to you under the Apache License, Version 2.0 (the
 * "License"); you may not use this file except in compliance
 * with the License.  You may obtain a copy of the License at
 * 
 *   http://www.apache.org/licenses/LICENSE-2.0
 * 
 * Unless required by applicable law or agreed to in writing,
 * software distributed under the License is distributed on an
 * "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY
 * KIND, either express or implied.  See the License for the
 * specific language governing permissions and limitations
 * under the License.
 * 
 *************************************************************/



#ifndef _SVX_CELLTYPES_HXX_
#define _SVX_CELLTYPES_HXX_

#include <rtl/ref.hxx>
#include <vector>

namespace sdr { namespace table {

class Cell;
class TableModel;
class TableRow;
class TableColumn;
class TableRows;
class TableColumns;
typedef rtl::Reference< Cell > CellRef;
typedef rtl::Reference< TableModel > TableModelRef;
typedef rtl::Reference< TableRow > TableRowRef;
typedef rtl::Reference< TableColumn > TableColumnRef;
typedef rtl::Reference< TableRows > TableRowsRef;
typedef rtl::Reference< TableColumns > TableColumnsRef;
typedef std::vector< CellRef > CellVector;
typedef std::vector< TableRowRef > RowVector;
typedef std::vector< TableColumnRef > ColumnVector;

class TableDesignUser
{
public:
	virtual bool isInUse() = 0;
};

template< typename T >
class RangeIterator
{
public:
	/** creates an iterator from rStart (including) to rEnd (excluding) if
		bForeward is true or from nEnd (excluding to nStart (including).
		rStart must be <= rEnd.
	*/
	RangeIterator( const T& rStart, const T& rEnd, bool bForeward = true )
	{
		if( bForeward )
		{
			maIter = rStart;
			maEnd = rEnd;
		}
		else
		{
			maIter = rEnd-1;
			maEnd = rStart-1;
		}
	}

	/* returns true if the next call to next() will return true also. */
	bool hasNext() const
	{
		return maIter != maEnd;
	}

	/* iterates in the configured direction and returns true if rValue
	   now contains a valid positon in the range of this iterator */
	bool next( T& rValue )
	{
		if( maIter == maEnd )
			return false;

		rValue = maIter;
		if( maIter < maEnd )
			maIter++;
		else
			maIter--;
		return true;
	}

private:
	T maEnd;
	T maIter;
};

} }

#endif