mirror of
https://gitlab.com/kicad/code/kicad.git
synced 2024-11-28 00:31:20 +00:00
b2be0d39bd
This is a pretty major rework of the snapping system. The GRID_HELPERs now have a separate CONSTRUCTION_MANAGER which handles some of the state involving "construction geometry". This is fed with 'extended' geometry (e.g. "infinite" lines from segments) for use in generating things like intersection points. It also handles adding this geoemtry to a GAL view item (CONSTRUCTION_GEOM) for display to the user. The process is: * A TOOL creates a GRID_HELPER * Optionally, it pre-loads a "persistent" batch of construction geometry (e.g. for an item's original position) * The grid helper finds useful snap 'anchors' as before, including those involving the construction items. * Other items on the board can be 'activated' by snapping to one of their main points. Then, if it has construction geometry, it will be added to the display. At most 2 items of this kind of geometry are shown, plus the original item, to reduce avoid too much clutter. The dashed snap lines state machine is also handled in the CONSTRUCTION_MANAGER and displayed in the CONSTRUCTION_GEOM item.
78 lines
2.7 KiB
C++
78 lines
2.7 KiB
C++
/*
|
|
* This program source code file is part of KiCad, a free EDA CAD application.
|
|
*
|
|
* Copyright (C) 2024 KiCad Developers, see AUTHORS.txt for contributors.
|
|
*
|
|
* This program is free software; you can redistribute it and/or
|
|
* modify it under the terms of the GNU General Public License
|
|
* as published by the Free Software Foundation; either version 2
|
|
* of the License, or (at your option) any later version.
|
|
*
|
|
* This program is distributed in the hope that it will be useful,
|
|
* but WITHOUT ANY WARRANTY; without even the implied warranty of
|
|
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
|
* GNU General Public License for more details.
|
|
*
|
|
* You should have received a copy of the GNU General Public License
|
|
* along with this program; if not, you may find one here:
|
|
* http://www.gnu.org/licenses/old-licenses/gpl-2.0.html
|
|
* or you may search the http://www.gnu.org website for the version 2 license,
|
|
* or you may write to the Free Software Foundation, Inc.,
|
|
* 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA
|
|
*/
|
|
|
|
#pragma once
|
|
|
|
#include <variant>
|
|
#include <vector>
|
|
|
|
#include <math/vector2d.h>
|
|
#include <math/box2.h>
|
|
|
|
#include <geometry/circle.h>
|
|
#include <geometry/half_line.h>
|
|
#include <geometry/line.h>
|
|
#include <geometry/seg.h>
|
|
#include <geometry/shape_arc.h>
|
|
#include <geometry/shape_rect.h>
|
|
|
|
/**
|
|
* A variant type that can hold any of the supported geometry types
|
|
* for intersection calculations.
|
|
*/
|
|
using INTERSECTABLE_GEOM = std::variant<LINE, HALF_LINE, SEG, CIRCLE, SHAPE_ARC, BOX2I>;
|
|
|
|
/**
|
|
* A visitor that visits INTERSECTABLE_GEOM variant objects with another
|
|
* (which is held as state: m_otherGeometry).
|
|
*
|
|
* This provides a unified way to intersect any supported geometry with
|
|
* any other supported geometry.
|
|
*/
|
|
struct INTERSECTION_VISITOR
|
|
{
|
|
public:
|
|
/**
|
|
* @param aOtherGeometry The other geometry to intersect the visited geometry with.
|
|
* @param aIntersections A vector to store the intersections in. Does not have to
|
|
* be empty, the visitor will append to it.
|
|
*/
|
|
INTERSECTION_VISITOR( const INTERSECTABLE_GEOM& aOtherGeometry,
|
|
std::vector<VECTOR2I>& aIntersections );
|
|
|
|
/*
|
|
* One of these operator() overloads will be called by std::visit
|
|
* as needed to visit (i.e. intersect) the geometry with the (stored)
|
|
* other geometry.
|
|
*/
|
|
void operator()( const SEG& aSeg ) const;
|
|
void operator()( const LINE& aLine ) const;
|
|
void operator()( const HALF_LINE& aLine ) const;
|
|
void operator()( const CIRCLE& aCircle ) const;
|
|
void operator()( const SHAPE_ARC& aArc ) const;
|
|
void operator()( const BOX2I& aArc ) const;
|
|
|
|
private:
|
|
const INTERSECTABLE_GEOM& m_otherGeometry;
|
|
std::vector<VECTOR2I>& m_intersections;
|
|
}; |