#include <kis_node_shapes_graph.h>

Public Member Functions
KisNodeShape *	addNode (KisNodeSP node, KisNodeSP parent, KisNodeSP aboveThis)

bool	containsNode (KisNodeSP node) const

void	moveNode (KisNodeSP node, KisNodeSP parent, KisNodeSP aboveThis)

KisNodeDummy *	nodeToDummy (KisNodeSP node)

KisNodeShape *	nodeToShape (KisNodeSP node)

void	removeNode (KisNodeSP node)

KisNodeDummy *	rootDummy () const

int	shapesCount () const

Private Member Functions
void	unmapDummyRecursively (KisNodeDummy *dummy)

Private Attributes
KisNodeDummiesGraph	m_dummiesGraph

Detailed Description

KisNodeShapesGraph is a highlevel simplified representation of nodes in the node stack. It stores hierarchy information about graph without accessing real node graph.

Takes ownership on both dummies and node shapes.

See also: KisNodeDummy, KisNodeDummyGraph

Definition at line 29 of file kis_node_shapes_graph.h.

Member Function Documentation

◆ addNode()

KisNodeShape * KisNodeShapesGraph::addNode	(	KisNodeSP	node,
		KisNodeSP	parent,
		KisNodeSP	aboveThis )

Adds a node to the graph

WARNING: this method does not add all the children recursively because the shapes graph has no right to access the hierarchy information from the UI thread, so you should do it manually.

Definition at line 12 of file kis_node_shapes_graph.cpp.

{
    KisNodeDummy *parentDummy = 0;
    KisNodeDummy *aboveThisDummy = 0;
 
    KisNodeShape *parentShape = 0;
 
    if(parent) {
        parentDummy = nodeToDummy(parent);
        parentShape = parentDummy->nodeShape();
    }
 
    if(aboveThis) {
        aboveThisDummy = nodeToDummy(aboveThis);
    }
 
    KisNodeShape *newShape = new KisNodeShape(node);
    ((KoShapeLayer*)newShape)->setParent(parentShape);
 
    KisNodeDummy *newDummy = new KisNodeDummy(newShape, newShape->node());
 
    m_dummiesGraph.addNode(newDummy, parentDummy, aboveThisDummy);
    return newShape;
}

References KisNodeDummiesGraph::addNode(), m_dummiesGraph, KisNodeShape::node(), KisNodeDummy::nodeShape(), and nodeToDummy().

◆ containsNode()

bool KisNodeShapesGraph::containsNode ( KisNodeSP node ) const

Definition at line 82 of file kis_node_shapes_graph.cpp.

{
    return m_dummiesGraph.containsNode(node);
}

References KisNodeDummiesGraph::containsNode(), and m_dummiesGraph.

◆ moveNode()

void KisNodeShapesGraph::moveNode	(	KisNodeSP	node,
		KisNodeSP	parent,
		KisNodeSP	aboveThis )

Moves a node inside the graph. It is supposed that the node has previously been added to the graph using addNode().

The node is moved together with all its children.

Definition at line 37 of file kis_node_shapes_graph.cpp.

{
    KisNodeDummy *nodeDummy = nodeToDummy(node);
    KisNodeDummy *parentDummy = parent ? nodeToDummy(parent) : 0;
    KisNodeDummy *aboveThisDummy = aboveThis ? nodeToDummy(aboveThis) : 0;
 
    m_dummiesGraph.moveNode(nodeDummy, parentDummy, aboveThisDummy);
}

References m_dummiesGraph, KisNodeDummiesGraph::moveNode(), and nodeToDummy().

◆ nodeToDummy()

KisNodeDummy * KisNodeShapesGraph::nodeToDummy ( KisNodeSP node )

Definition at line 68 of file kis_node_shapes_graph.cpp.

{
    return m_dummiesGraph.nodeToDummy(node);
}

References m_dummiesGraph, and KisNodeDummiesGraph::nodeToDummy().

◆ nodeToShape()

KisNodeShape * KisNodeShapesGraph::nodeToShape ( KisNodeSP node )

Definition at line 73 of file kis_node_shapes_graph.cpp.

{
    KisNodeDummy *dummy = nodeToDummy(node);
    if (dummy) {
        return dummy->nodeShape();
    }
    return 0;
}

References KisNodeDummy::nodeShape(), and nodeToDummy().

◆ removeNode()

void KisNodeShapesGraph::removeNode ( KisNodeSP node )

Removes the node from the graph

Removing the node from the graph removes both the node itself and all its children, because all this information is accessible to the shapes graph without referring to the node's hierarchy information owned by the image.

The shapes remove their children automatically, so the dummies do not own them. Delete them manually.

Definition at line 46 of file kis_node_shapes_graph.cpp.

{
    KisNodeDummy *nodeDummy = nodeToDummy(node);
 
    m_dummiesGraph.removeNode(nodeDummy);
 
    KisNodeShape *tempShape = nodeDummy->nodeShape();
    ((KoShapeLayer*)tempShape)->setParent(0);
 
    delete nodeDummy;
    delete tempShape;
}

References m_dummiesGraph, KisNodeDummy::nodeShape(), nodeToDummy(), KisNodeDummiesGraph::removeNode(), and KoShape::setParent().

◆ rootDummy()

KisNodeDummy * KisNodeShapesGraph::rootDummy ( ) const

Definition at line 63 of file kis_node_shapes_graph.cpp.

{
    return m_dummiesGraph.rootDummy();
}

References m_dummiesGraph, and KisNodeDummiesGraph::rootDummy().

◆ shapesCount()

int KisNodeShapesGraph::shapesCount ( ) const

Definition at line 87 of file kis_node_shapes_graph.cpp.

{
    return m_dummiesGraph.dummiesCount();
}

References KisNodeDummiesGraph::dummiesCount(), and m_dummiesGraph.

◆ unmapDummyRecursively()

void KisNodeShapesGraph::unmapDummyRecursively ( KisNodeDummy * dummy )

private

Member Data Documentation

◆ m_dummiesGraph

KisNodeDummiesGraph KisNodeShapesGraph::m_dummiesGraph