// Created by: Peter KURNEV // Copyright (c) 2010-2012 OPEN CASCADE SAS // Copyright (c) 2007-2010 CEA/DEN, EDF R&D, OPEN CASCADE // Copyright (c) 2003-2007 OPEN CASCADE, EADS/CCR, LIP6, CEA/DEN, CEDRAT, // EDF R&D, LEG, PRINCIPIA R&D, BUREAU VERITAS // // // This file is part of Open CASCADE Technology software library. // // This library is free software; you can redistribute it and/or modify it under // the terms of the GNU Lesser General Public License version 2.1 as published // by the Free Software Foundation, with special exception defined in the file // OCCT_LGPL_EXCEPTION.txt. Consult the file LICENSE_LGPL_21.txt included in OCCT // distribution for complete text of the license and disclaimer of any warranty. // // Alternatively, this file may be used under the terms of Open CASCADE // commercial license or contractual agreement. #ifndef BOPCol_Box2DBndTree_HeaderFile #define BOPCol_Box2DBndTree_HeaderFile #include #include #include /** * The instantiation of the algorithm of unbalanced binary tree * of overlapped bounding boxes 2D. * */ typedef NCollection_UBTree BOPCol_Box2DBndTree; class BOPCol_Box2DBndTreeSelector : public BOPCol_Box2DBndTree::Selector { public: Standard_EXPORT BOPCol_Box2DBndTreeSelector(); Standard_EXPORT virtual Standard_Boolean Reject(const Bnd_Box2d&) const; Standard_EXPORT virtual Standard_Boolean Accept(const Standard_Integer &); Standard_EXPORT virtual ~BOPCol_Box2DBndTreeSelector(); Standard_EXPORT void Clear(); Standard_EXPORT void SetBox(const Bnd_Box2d&); Standard_EXPORT const BOPCol_ListOfInteger& Indices() const; protected: Bnd_Box2d myBox2D; BOPCol_ListOfInteger myIndices; }; #endif