a8a064d11c
Change-Id: I9b706c9bcc2925f72cc024142ffe72af5ddea82a Reviewed-on: https://gerrit.libreoffice.org/82419 Tested-by: Jenkins Reviewed-by: Noel Grandin <noel.grandin@collabora.co.uk>
93 lines
3.1 KiB
C++
93 lines
3.1 KiB
C++
/* -*- Mode: C++; tab-width: 4; indent-tabs-mode: nil; c-basic-offset: 4 -*- */
|
|
/*
|
|
* This file is part of the LibreOffice project.
|
|
*
|
|
* This Source Code Form is subject to the terms of the Mozilla Public
|
|
* License, v. 2.0. If a copy of the MPL was not distributed with this
|
|
* file, You can obtain one at http://mozilla.org/MPL/2.0/.
|
|
*
|
|
* This file incorporates work covered by the following license notice:
|
|
*
|
|
* 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 .
|
|
*/
|
|
|
|
#ifndef INCLUDED_SC_INC_MARKARR_HXX
|
|
#define INCLUDED_SC_INC_MARKARR_HXX
|
|
|
|
#include "address.hxx"
|
|
#include <memory>
|
|
|
|
class ScRangeList;
|
|
|
|
#define SC_MARKARRAY_DELTA 4
|
|
|
|
struct ScMarkEntry
|
|
{
|
|
SCROW nRow;
|
|
bool bMarked;
|
|
};
|
|
|
|
/**
|
|
This is a rather odd datastructure. We store alternating marked/not-marked entries,
|
|
and for each entry the range is defined as :
|
|
[previousEntry.nRow+1, currentEntry.nRow]
|
|
*/
|
|
class ScMarkArray
|
|
{
|
|
SCSIZE nCount;
|
|
SCSIZE nLimit;
|
|
std::unique_ptr<ScMarkEntry[]> pData;
|
|
SCROW mnMaxRow;
|
|
|
|
friend class ScMarkArrayIter;
|
|
friend class ScDocument; // for FillInfo
|
|
|
|
public:
|
|
ScMarkArray(SCROW nMaxRow);
|
|
ScMarkArray( ScMarkArray&& rArray ) noexcept;
|
|
ScMarkArray( const ScMarkArray& rArray );
|
|
~ScMarkArray();
|
|
void Reset( bool bMarked = false, SCSIZE nNeeded = 1 );
|
|
bool GetMark( SCROW nRow ) const;
|
|
void SetMarkArea( SCROW nStartRow, SCROW nEndRow, bool bMarked );
|
|
void Set( std::vector<ScMarkEntry> const & );
|
|
bool IsAllMarked( SCROW nStartRow, SCROW nEndRow ) const;
|
|
bool HasOneMark( SCROW& rStartRow, SCROW& rEndRow ) const;
|
|
|
|
bool HasMarks() const { return ( nCount > 1 || ( nCount == 1 && pData[0].bMarked ) ); }
|
|
|
|
ScMarkArray& operator=( ScMarkArray const & rSource );
|
|
ScMarkArray& operator=(ScMarkArray&& rSource) noexcept;
|
|
bool operator==(ScMarkArray const & rOther ) const;
|
|
|
|
bool Search( SCROW nRow, SCSIZE& nIndex ) const;
|
|
|
|
/// Including current row, may return -1 if bUp and not found
|
|
SCROW GetNextMarked( SCROW nRow, bool bUp ) const;
|
|
SCROW GetMarkEnd( SCROW nRow, bool bUp ) const;
|
|
|
|
void Shift( SCROW nStartRow, long nOffset );
|
|
void Intersect( const ScMarkArray& rOther );
|
|
};
|
|
|
|
class ScMarkArrayIter // iterate over selected range
|
|
{
|
|
const ScMarkArray* pArray;
|
|
SCSIZE nPos;
|
|
public:
|
|
ScMarkArrayIter( const ScMarkArray* pNewArray );
|
|
~ScMarkArrayIter();
|
|
|
|
bool Next( SCROW& rTop, SCROW& rBottom );
|
|
void reset( const ScMarkArray* pNewArray );
|
|
};
|
|
|
|
#endif
|
|
|
|
/* vim:set shiftwidth=4 softtabstop=4 expandtab: */
|