/* -*- 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 . */ #include #include #include #include #include #include namespace basegfx { class ImplB2DPolyRange { public: ImplB2DPolyRange() {} bool operator==(const ImplB2DPolyRange& rRHS) const { return maRanges == rRHS.maRanges && maOrient == rRHS.maOrient; } sal_uInt32 count() const { return maRanges.size(); } B2DPolyRange::ElementType getElement(sal_uInt32 nIndex) const { return std::make_tuple(maRanges[nIndex], maOrient[nIndex]); } void appendElement(const B2DRange& rRange, B2VectorOrientation eOrient) { maRanges.push_back(rRange); maOrient.push_back(eOrient); maBounds.expand(rRange); } void clear() { std::vector().swap(maRanges); std::vector().swap(maOrient); maBounds.reset(); } bool overlaps( const B2DRange& rRange ) const { if( !maBounds.overlaps( rRange ) ) return false; const std::vector::const_iterator aEnd( maRanges.end() ); return std::any_of( maRanges.begin(), aEnd, [&rRange](const B2DRange& aRange) { return aRange.overlaps(rRange); } ); } B2DPolyPolygon solveCrossovers() const { return utils::solveCrossovers(maRanges,maOrient); } void transform(const basegfx::B2DHomMatrix& rTranslate) { maBounds.transform(rTranslate); for (auto &a : maRanges) a.transform(rTranslate); } private: B2DRange maBounds; std::vector maRanges; std::vector maOrient; }; B2DPolyRange::B2DPolyRange() = default; B2DPolyRange::~B2DPolyRange() = default; B2DPolyRange::B2DPolyRange( const B2DPolyRange& ) = default; B2DPolyRange& B2DPolyRange::operator=( const B2DPolyRange& ) = default; bool B2DPolyRange::operator==(const B2DPolyRange& rRange) const { if(mpImpl.same_object(rRange.mpImpl)) return true; return ((*mpImpl) == (*rRange.mpImpl)); } sal_uInt32 B2DPolyRange::count() const { return mpImpl->count(); } B2DPolyRange::ElementType B2DPolyRange::getElement(sal_uInt32 nIndex) const { return mpImpl->getElement(nIndex); } void B2DPolyRange::appendElement(const B2DRange& rRange, B2VectorOrientation eOrient) { mpImpl->appendElement(rRange, eOrient); } void B2DPolyRange::clear() { mpImpl->clear(); } bool B2DPolyRange::overlaps( const B2DRange& rRange ) const { return mpImpl->overlaps(rRange); } void B2DPolyRange::transform(const basegfx::B2DHomMatrix& rTranslate) { mpImpl->transform(rTranslate); } B2DPolyPolygon B2DPolyRange::solveCrossovers() const { return mpImpl->solveCrossovers(); } } // end of namespace basegfx /* vim:set shiftwidth=4 softtabstop=4 expandtab: */