Method refreshPosition

Gui/Edge.cpp:875–962

}

void
LinkArrow::refreshPosition()
{
    NodeGuiPtr slave = _slave.lock();
    NodeGuiPtr master = _master.lock();
    QRectF bboxSlave;

    if (slave) {
        bboxSlave = mapFromItem( slave.get(), slave->boundingRect() ).boundingRect();
    }

    ///like the box master in kfc! was bound to name it so I'm hungry atm
    QRectF boxMaster;
    if (master) {
        boxMaster = mapFromItem( master.get(), master->boundingRect() ).boundingRect();
    }
    QPointF dst = boxMaster.center();
    QPointF src = bboxSlave.center();

    setLine( QLineF(src, dst) );

    ///Get the intersections of the line with the nodes
    std::vector<QLineF> masterEdges;
    std::vector<QLineF> slaveEdges;
    makeEdges(bboxSlave, slaveEdges);
    makeEdges(boxMaster, masterEdges);


    QPointF masterIntersect;
    QPointF slaveIntersect;
    bool foundIntersection = false;
    for (int i = 0; i < 4; ++i) {
#if QT_VERSION >= QT_VERSION_CHECK(5, 14, 0)
        QLineF::IntersectionType type = slaveEdges[i].intersects(line(), &slaveIntersect);
#else
        QLineF::IntersectType type = slaveEdges[i].intersect(line(), &slaveIntersect);
#endif
        if (type == QLineF::BoundedIntersection) {
            foundIntersection = true;
            break;
        }
    }

    if (!foundIntersection) {
        ///Don't bother continuing, there's no intersection that means the line is contained in the node bbox

        ///hence that the 2 nodes are overlapping on the nodegraph so probably we wouldn't see the link anyway.
        return;
    }

    foundIntersection = false;
    for (int i = 0; i < 4; ++i) {
#if QT_VERSION >= QT_VERSION_CHECK(5, 14, 0)
        QLineF::IntersectionType type = masterEdges[i].intersects(line(), &masterIntersect);
#else
        QLineF::IntersectType type = masterEdges[i].intersect(line(), &masterIntersect);
#endif
        if (type == QLineF::BoundedIntersection) {