diff options
| author |  bsalomon@google.com <bsalomon@google.com@2bbb7eff-a529-9590-31e7-b0007b416f81> | 2011-04-12 15:40:00 +0000 |
|---|---|---|
| committer | bsalomon@google.com <bsalomon@google.com@2bbb7eff-a529-9590-31e7-b0007b416f81> | 2011-04-12 15:40:00 +0000 |
| commit | bcdbbe61e1a3f89545b2c1461164f0f8bf5f0797 (patch) | |
| tree | f21dd8fb5f51e41ed8f0fa7881f275e907492bf7 /gpu/src/GrRedBlackTree.h | |
| parent | 13a950ae4e250f1a6a7074eb696591cafbfa71e6 (diff) | |
rename XHelper members to onX
Review URL: http://codereview.appspot.com/4380056/
git-svn-id: http://skia.googlecode.com/svn/trunk@1113 2bbb7eff-a529-9590-31e7-b0007b416f81
Diffstat (limited to 'gpu/src/GrRedBlackTree.h')
| -rw-r--r-- | gpu/src/GrRedBlackTree.h | 10 |
1 files changed, 5 insertions, 5 deletions
diff --git a/gpu/src/GrRedBlackTree.h b/gpu/src/GrRedBlackTree.h index 7ba326ff8a..b57ce9e3ed 100644 --- a/gpu/src/GrRedBlackTree.h +++ b/gpu/src/GrRedBlackTree.h @@ -163,7 +163,7 @@ private: void deleteAtNode(Node* x); static void RecursiveDelete(Node* x); - int countOfHelper(const Node* n, const T& t) const; + int onCountOf(const Node* n, const T& t) const; #if GR_DEBUG void validate() const; @@ -312,11 +312,11 @@ typename GrRedBlackTree<T,C>::Iter GrRedBlackTree<T,C>::findLast(const T& t) { template <typename T, typename C> int GrRedBlackTree<T,C>::countOf(const T& t) const { - return countOfHelper(fRoot, t); + return onCountOf(fRoot, t); } template <typename T, typename C> -int GrRedBlackTree<T,C>::countOfHelper(const Node* n, const T& t) const { +int GrRedBlackTree<T,C>::onCountOf(const Node* n, const T& t) const { // this is count*log(n) :( while (NULL != n) { if (fComp(t, n->fItem)) { @@ -324,8 +324,8 @@ int GrRedBlackTree<T,C>::countOfHelper(const Node* n, const T& t) const { } else { if (!fComp(n->fItem, t)) { int count = 1; - count += countOfHelper(n->fChildren[kLeft_Child], t); - count += countOfHelper(n->fChildren[kRight_Child], t); + count += onCountOf(n->fChildren[kLeft_Child], t); + count += onCountOf(n->fChildren[kRight_Child], t); return count; } n = n->fChildren[kRight_Child]; |