summaryrefslogtreecommitdiffstats
path: root/quanta/utility/tagaction.cpp
diff options
context:
space:
mode:
Diffstat (limited to 'quanta/utility/tagaction.cpp')
-rw-r--r--quanta/utility/tagaction.cpp12
1 files changed, 6 insertions, 6 deletions
diff --git a/quanta/utility/tagaction.cpp b/quanta/utility/tagaction.cpp
index a4a58a43..4a559962 100644
--- a/quanta/utility/tagaction.cpp
+++ b/quanta/utility/tagaction.cpp
@@ -1055,11 +1055,11 @@ void TagAction::applyTagInSelection(Node* start_node, int start_offset, Node* en
Node* nodeCursor = start_node;
Node* nodeParent = start_node;
if (nodeParent->tag->type == Tag::Text)
- nodeParent = nodeParent->tqparent;
+ nodeParent = nodeParent->parent;
- //Checking if at least one tqparent of node can have a Text Node as child, otherwise
+ //Checking if at least one parent of node can have a Text Node as child, otherwise
//it is impossible for the
- //user to add this node. In that case, try to insert the Node in the closest tqparent accepting it.
+ //user to add this node. In that case, try to insert the Node in the closest parent accepting it.
//e.g. TR : a normal insertion would require to have the caret in the TABLE Node, but it is
//impossible
TQTag* nodeTQTag = QuantaCommon::tagFromDTD(w->defaultDTD(), node->tag->name);
@@ -1080,7 +1080,7 @@ void TagAction::applyTagInSelection(Node* start_node, int start_offset, Node* en
if (specialTagInsertion) // Attention: not smartTagInsertion
{
- //let's try to insert this node in the closest tqparent accepting it.
+ //let's try to insert this node in the closest parent accepting it.
while (nodeParent)
{
TQTag* nodeParentTQTag = QuantaCommon::tagFromDTD(w->defaultDTD(), nodeParent->tag->name);
@@ -1092,7 +1092,7 @@ void TagAction::applyTagInSelection(Node* start_node, int start_offset, Node* en
nodeTreeModified = true;
break;
}
- nodeParent = nodeParent->tqparent;
+ nodeParent = nodeParent->parent;
}
}
else if(!nodeTQTag->isSingle())
@@ -1248,7 +1248,7 @@ void TagAction::deapplyTagInSelection(Node* start_node, int start_offset, Node*
Node* common_parent_start_child = kafkaCommon::getCommonParentChild(start_node, tag_parent);
Node* common_parent_end_child = kafkaCommon::getCommonParentChild(end_node, tag_parent);
- Node* parent_of_tag_parent = tag_parent->tqparent;
+ Node* parent_of_tag_parent = tag_parent->parent;
if(common_parent_end_child == common_parent_start_child)
common_parent_end_child = 0;
if(!common_parent_start_child)