#include "ShoppingTreeItem.h"\r
\r
\r
-DomItem::DomItem(QDomNode &node, int row, DomItem *parent)\r
+ShoppingTreeItem::ShoppingTreeItem(QDomNode &node, int row, ShoppingTreeItem *parent)\r
{\r
domNode = node;\r
rowNumber = row;\r
}\r
\r
/*******************************************************************/\r
-DomItem::~DomItem()\r
+ShoppingTreeItem::~ShoppingTreeItem()\r
{\r
- QHash<int,DomItem*>::iterator it;\r
+ QHash<int,ShoppingTreeItem*>::iterator it;\r
for (it = childItems.begin(); it != childItems.end(); ++it)\r
delete it.value();\r
}\r
\r
/*******************************************************************/\r
-QDomNode DomItem::node() const\r
+QDomNode ShoppingTreeItem::node() const\r
{\r
return domNode;\r
}\r
\r
/*******************************************************************/\r
-DomItem *DomItem::parent()\r
+ShoppingTreeItem *ShoppingTreeItem::parent()\r
{\r
return parentItem;\r
}\r
\r
/*******************************************************************/\r
-DomItem *DomItem::child(int i)\r
+ShoppingTreeItem *ShoppingTreeItem::child(int i)\r
{\r
if (childItems.contains(i))\r
return childItems[i];\r
}\r
if (i >= 0 && i < childElementsList.count()) {\r
childNode = childElementsList.at(i);\r
- DomItem *childItem = new DomItem(childNode, i, this);\r
+ ShoppingTreeItem *childItem = new ShoppingTreeItem(childNode, i, this);\r
childItems[i] = childItem;\r
return childItem;\r
}\r
}\r
\r
/*******************************************************************/\r
-int DomItem::row()\r
+int ShoppingTreeItem::row()\r
{\r
return rowNumber;\r
}\r