┌   ┐
54
└   ┘

summaryrefslogtreecommitdiff
path: root/src/kitemviews
diff options
context:
space:
mode:
authorPeter Penz <[email protected]>2011-12-14 00:03:03 +0100
committerPeter Penz <[email protected]>2011-12-14 00:03:40 +0100
commitee8d9bb4ab3e121a4ae57eed02cc5b4599055995 (patch)
tree8e58b3709833b4d4c1c1c49dc84c19726fe1ead4 /src/kitemviews
parent67783026f5c4de6f3c757f967d0e9a6a48295361 (diff)
Fix comment
Diffstat (limited to 'src/kitemviews')
-rw-r--r--src/kitemviews/kfileitemmodel.cpp7
1 files changed, 4 insertions, 3 deletions
diff --git a/src/kitemviews/kfileitemmodel.cpp b/src/kitemviews/kfileitemmodel.cpp
index d81a985c7..71439fc18 100644
--- a/src/kitemviews/kfileitemmodel.cpp
+++ b/src/kitemviews/kfileitemmodel.cpp
@@ -1473,15 +1473,16 @@ int KFileItemModel::expansionLevelsCompare(const KFileItem& a, const KFileItem&
// TODO: The following implementation is very hacky but works. Issues with
// this approach:
- // 1. m_items is accessed, although the sorting in might also work on
- // a non-member variables. This happens in insertItems() but it does
+ // 1. m_items is accessed, although the sorting might also work on
+ // non-member variables. This happens in insertItems() but it does
// not really matter as in this case only a presorting is done.
// 2. It is very slow in theory as it introduces a O(n*n) runtime complexity
// in combination with lessThan(). Practically the code is still fast
// enough for thousands of items but this must be fixed.
//
// Proposal: Extend the internal structure ItemData by a member
- // 'ItemData* parent and access it here.
+ // 'ItemData* parent' and access it here. It should be sufficient
+ // to update 'parent' in combination with the expansionLevel.
const KUrl parentUrlA(pathA.left(index) + subPathA);
const KUrl parentUrlB(pathB.left(index) + subPathB);