Katana_mirror/katie
1
0
Fork 0
mirror of https://bitbucket.org/smil3y/katie.git synced 2025-02-23 18:32:55 +00:00
Code Issues Projects Releases Packages Wiki Activity Actions

mark QSvgStyleSelector reimplementations as final

Browse source 
Signed-off-by: Ivailo Monev <xakepa10@gmail.com>
This commit is contained in:
Ivailo Monev 2021-06-18 00:22:57 +03:00
parent cb43615e77
commit 81b6d699ae
1 changed files with 15 additions and 10 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

25
src/svg/qsvghandler.cpp
View file

@ -359,7 +359,7 @@ public:
return st;
}
virtual bool nodeNameEquals(NodePtr node, const QString& nodeName) const
bool nodeNameEquals(NodePtr node, const QString& nodeName) const final
{
QSvgNode *n = svgNode(node);
if (!n)
@ -367,7 +367,8 @@ public:
QString name = nodeToName(n);
return QString::compare(name, nodeName, Qt::CaseInsensitive) == 0;
}
virtual QString attribute(NodePtr node, const QString &name) const
QString attribute(NodePtr node, const QString &name) const final
{
QSvgNode *n = svgNode(node);
if ((!n->nodeId().isEmpty() && (name == QLatin1String("id") ||
@ -377,14 +378,15 @@ public:
return n->xmlClass();
return QString();
}
virtual bool hasAttributes(NodePtr node) const
bool hasAttributes(NodePtr node) const final
{
QSvgNode *n = svgNode(node);
return (n &&
(!n->nodeId().isEmpty() || !n->xmlClass().isEmpty()));
}
virtual QString nodeId(NodePtr node) const
QString nodeId(NodePtr node) const final
{
QSvgNode *n = svgNode(node);
if (n)
@ -392,7 +394,7 @@ public:
return QString();
}
virtual QStringList nodeNames(NodePtr node) const
QStringList nodeNames(NodePtr node) const final
{
QSvgNode *n = svgNode(node);
if (n)
@ -400,12 +402,12 @@ public:
return QStringList();
}
virtual bool isNullNode(NodePtr node) const
bool isNullNode(NodePtr node) const final
{
return !node.ptr;
}
virtual NodePtr parentNode(NodePtr node) const
NodePtr parentNode(NodePtr node) const final
{
QSvgNode *n = svgNode(node);
NodePtr newNode;
@ -419,7 +421,8 @@ public:
}
return newNode;
}
virtual NodePtr previousSiblingNode(NodePtr node) const
NodePtr previousSiblingNode(NodePtr node) const final
{
NodePtr newNode;
newNode.ptr = 0;
@ -435,14 +438,16 @@ public:
}
return newNode;
}
virtual NodePtr duplicateNode(NodePtr node) const
NodePtr duplicateNode(NodePtr node) const final
{
NodePtr n;
n.ptr = node.ptr;
n.id = node.id;
return n;
}
virtual void freeNode(NodePtr node) const
void freeNode(NodePtr node) const final
{
Q_UNUSED(node);
}