diff options
author | tpearson <tpearson@283d02a7-25f6-0310-bc7c-ecb5cbfe19da> | 2011-08-10 22:19:39 +0000 |
---|---|---|
committer | tpearson <tpearson@283d02a7-25f6-0310-bc7c-ecb5cbfe19da> | 2011-08-10 22:19:39 +0000 |
commit | 27edf28be2772229a7974a007313ea30d92c3ffd (patch) | |
tree | 14b9842bbd90c801d89ad5ddb38831fdf8aec1a4 /juk/sortedstringlist.cpp | |
parent | 7ef01c0f34d9c6732d258154bcd3ba5a88280db9 (diff) | |
download | tdemultimedia-27edf28be2772229a7974a007313ea30d92c3ffd.tar.gz tdemultimedia-27edf28be2772229a7974a007313ea30d92c3ffd.zip |
rename the following methods:
tqparent parent
tqmask mask
git-svn-id: svn://anonsvn.kde.org/home/kde/branches/trinity/kdemultimedia@1246260 283d02a7-25f6-0310-bc7c-ecb5cbfe19da
Diffstat (limited to 'juk/sortedstringlist.cpp')
-rw-r--r-- | juk/sortedstringlist.cpp | 20 |
1 files changed, 10 insertions, 10 deletions
diff --git a/juk/sortedstringlist.cpp b/juk/sortedstringlist.cpp index b952067b..0886a88d 100644 --- a/juk/sortedstringlist.cpp +++ b/juk/sortedstringlist.cpp @@ -20,11 +20,11 @@ class SortedStringList::Node { public: - Node(const TQString &value) : key(value), tqparent(0), left(0), right(0) {} + Node(const TQString &value) : key(value), parent(0), left(0), right(0) {} ~Node() {} TQString key; - Node *tqparent; + Node *parent; Node *left; Node *right; }; @@ -61,11 +61,11 @@ SortedStringList::Node *SortedStringList::treeSuccessor(Node *n) const if(n->right) return treeMinimum(n->right); - Node *p = n->tqparent; + Node *p = n->parent; while(p && n == p->right) { n = p; - p = p->tqparent; + p = p->parent; } return p; @@ -92,15 +92,15 @@ bool SortedStringList::remove(const TQString &value) x = y->right; if(x) - x->tqparent = y->tqparent; + x->parent = y->parent; - if(!y->tqparent) + if(!y->parent) m_root = x; else { - if(y == y->tqparent->left) - y->tqparent->left = x; + if(y == y->parent->left) + y->parent->left = x; else - y->tqparent->right = x; + y->parent->right = x; } if(y != x) @@ -155,7 +155,7 @@ bool SortedStringList::BSTInsert(const TQString &value) Node *n = new Node(value); - n->tqparent = previousNode; + n->parent = previousNode; if(!m_root) m_root = n; |