Skip to content
GitLab
Projects
Groups
Snippets
Help
Loading...
Help
Help
Support
Community forum
Keyboard shortcuts
?
Submit feedback
Contribute to GitLab
Sign in / Register
Toggle navigation
F
flatpak-qt-creator
Project overview
Project overview
Details
Activity
Releases
Repository
Repository
Files
Commits
Branches
Tags
Contributors
Graph
Compare
Issues
0
Issues
0
List
Boards
Labels
Service Desk
Milestones
Merge Requests
0
Merge Requests
0
CI / CD
CI / CD
Pipelines
Jobs
Schedules
Operations
Operations
Environments
Packages & Registries
Packages & Registries
Container Registry
Analytics
Analytics
CI / CD
Repository
Value Stream
Wiki
Wiki
Snippets
Snippets
Members
Members
Collapse sidebar
Close sidebar
Activity
Graph
Create a new issue
Jobs
Commits
Issue Boards
Open sidebar
Marco Bubke
flatpak-qt-creator
Commits
d2c7aad8
Commit
d2c7aad8
authored
Dec 09, 2010
by
dt
Committed by
con
Dec 10, 2010
Browse files
Options
Browse Files
Download
Email Patches
Plain Diff
FlatModel: Fix sorting
Mea culpa
parent
216bdca7
Changes
1
Hide whitespace changes
Inline
Side-by-side
Showing
1 changed file
with
5 additions
and
5 deletions
+5
-5
src/plugins/projectexplorer/projectmodels.cpp
src/plugins/projectexplorer/projectmodels.cpp
+5
-5
No files found.
src/plugins/projectexplorer/projectmodels.cpp
View file @
d2c7aad8
...
...
@@ -78,7 +78,7 @@ bool sortNodes(Node *n1, Node *n2)
int
result
=
fileNameCompare
(
fileName1
,
fileName2
);
if
(
result
!=
0
)
return
result
;
return
result
<
0
;
else
return
file1
<
file2
;
}
else
{
...
...
@@ -98,7 +98,7 @@ bool sortNodes(Node *n1, Node *n2)
int
result
=
fileNameCompare
(
project1
->
displayName
(),
project2
->
displayName
());
if
(
result
!=
0
)
return
result
;
return
result
<
0
;
else
return
project1
<
project2
;
// sort by pointer value
}
else
{
...
...
@@ -115,7 +115,7 @@ bool sortNodes(Node *n1, Node *n2)
int
result
=
fileNameCompare
(
folder1
->
path
(),
folder2
->
path
());
if
(
result
!=
0
)
return
result
;
return
result
<
0
;
else
return
folder1
<
folder2
;
}
else
{
...
...
@@ -135,11 +135,11 @@ bool sortNodes(Node *n1, Node *n2)
int
result
=
fileNameCompare
(
fileName1
,
fileName2
);
if
(
result
!=
0
)
{
return
result
;
// sort by filename
return
result
<
0
;
// sort by filename
}
else
{
result
=
fileNameCompare
(
filePath1
,
filePath2
);
if
(
result
!=
0
)
{
return
result
;
// sort by filepath
return
result
<
0
;
// sort by filepath
}
else
{
return
n1
<
n2
;
// sort by pointer value
}
...
...
Write
Preview
Markdown
is supported
0%
Try again
or
attach a new file
Attach a file
Cancel
You are about to add
0
people
to the discussion. Proceed with caution.
Finish editing this message first!
Cancel
Please
register
or
sign in
to comment