update

QFD/CCanvas/CMind.cpp

@@ -54,12 +54,12 @@ CNodeData CMind::node(int number) const
     return m_nodeList[i];
 }
 
-bool CMind::containsNode(int n) const
+bool CMind::containsNode(int number) const
 {
-    return numberList().contains(n);
+    return numberList().contains(number);
 }
 
-CNodeData CMind::createNode(int pNumber)
+CNodeData CMind::createNode(int pNumber) const
 {
     CNodeData n;
     if (containsNode(pNumber) || (pNumber < 0 && m_nodeList.count() <= 0)) {
@@ -104,9 +104,9 @@ void CMind::removeNode(int number)
     }
 }
 
-bool CMind::hasAncestor(int childId, int ancestorNumber) const
+bool CMind::hasAncestor(int childNumber, int ancestorNumber) const
 {
-    CNodeData c = node(childId);
+    CNodeData c = node(childNumber);
     if (c.isValid()) {
         if (c.hasParent() && c.pNumber == ancestorNumber) {
             return true;

QFD/CCanvas/CMind.h

@@ -36,15 +36,15 @@ public:
 
     CNodeData node(int number) const;
 
-    bool containsNode(int n) const;
+    bool containsNode(int number) const;
 
     /// 指定父节点, 创建节点
-    CNodeData createNode(int pNumber = -1);
+    CNodeData createNode(int pNumber = -1) const;
 
     void addNode(CNodeData n);
     void removeNode(int number);
 
-    bool hasAncestor(int childId, int ancestorNumber) const;
+    bool hasAncestor(int childNumber, int ancestorNumber) const;
 
 private:
     QList<int> numberList() const;  // 节点编号列表