sc/source/core/tool/rangelst.cxx | 15 +-------------- 1 file changed, 1 insertion(+), 14 deletions(-)
New commits: commit 309f0f882b34c13d970677c2564f088c36c9691b Author: Luboš Luňák <l.lu...@collabora.com> AuthorDate: Wed Feb 16 01:11:47 2022 +0100 Commit: Luboš Luňák <l.lu...@collabora.com> CommitDate: Wed Feb 16 08:19:14 2022 +0100 simplify code Change-Id: I5e5c419f2888d0f305f6b83445c66c187f3e0e8d Reviewed-on: https://gerrit.libreoffice.org/c/core/+/129979 Tested-by: Jenkins Reviewed-by: Luboš Luňák <l.lu...@collabora.com> diff --git a/sc/source/core/tool/rangelst.cxx b/sc/source/core/tool/rangelst.cxx index ab6033dfa3de..4d6bf06f155d 100644 --- a/sc/source/core/tool/rangelst.cxx +++ b/sc/source/core/tool/rangelst.cxx @@ -48,19 +48,6 @@ private: const T& mrTest; }; -template<typename T> -class FindRangeIn -{ -public: - FindRangeIn(const T& rTest) : mrTest(rTest) {} - bool operator() (const ScRange& rRange) const - { - return mrTest.Contains(rRange); - } -private: - const T& mrTest; -}; - template<typename T> class FindIntersectingRange { @@ -967,7 +954,7 @@ bool ScRangeList::DeleteArea( SCCOL nCol1, SCROW nRow1, SCTAB nTab1, ScRange aRange( nCol1, nRow1, nTab1, nCol2, nRow2, nTab2 ); for(size_t i = 0; i < maRanges.size();) { - if(FindRangeIn< ScRange >(aRange)(maRanges[i])) + if(aRange.Contains(maRanges[i])) { Remove(i); bChanged = true;