Skip to content
GitLab
Explore
Sign in
Primary navigation
Search or go to…
Project
SWIFTsim
Manage
Activity
Members
Labels
Plan
Issues
Issue boards
Milestones
Wiki
Code
Merge requests
Repository
Branches
Commits
Tags
Repository graph
Compare revisions
Snippets
Deploy
Releases
Model registry
Monitor
Incidents
Analyze
Value stream analytics
Contributor analytics
Repository analytics
Model experiments
Help
Help
Support
GitLab documentation
Compare GitLab plans
Community forum
Contribute to GitLab
Provide feedback
Keyboard shortcuts
?
Snippets
Groups
Projects
Show more breadcrumbs
SWIFT
SWIFTsim
Commits
9ec7dc24
Commit
9ec7dc24
authored
6 years ago
by
Matthieu Schaller
Browse files
Options
Downloads
Patches
Plain Diff
Use dx_max_sort_old and not dx_max_sort when deciding what direction to sort in the recursion.
parent
2dffd911
No related branches found
No related tags found
1 merge request
!676
Sorts bug fix
Changes
1
Hide whitespace changes
Inline
Side-by-side
Showing
1 changed file
src/runner.c
+1
-1
1 addition, 1 deletion
src/runner.c
with
1 addition
and
1 deletion
src/runner.c
+
1
−
1
View file @
9ec7dc24
...
...
@@ -702,7 +702,7 @@ void runner_do_sort(struct runner *r, struct cell *c, int flags, int cleanup,
if
(
c
->
progeny
[
k
]
!=
NULL
&&
c
->
progeny
[
k
]
->
hydro
.
count
>
0
)
{
/* Only propagate cleanup if the progeny is stale. */
runner_do_sort
(
r
,
c
->
progeny
[
k
],
flags
,
cleanup
&&
(
c
->
progeny
[
k
]
->
hydro
.
dx_max_sort
>
cleanup
&&
(
c
->
progeny
[
k
]
->
hydro
.
dx_max_sort
_old
>
space_maxreldx
*
c
->
progeny
[
k
]
->
dmin
),
0
);
dx_max_sort
=
max
(
dx_max_sort
,
c
->
progeny
[
k
]
->
hydro
.
dx_max_sort
);
...
...
This diff is collapsed.
Click to expand it.
Preview
0%
Loading
Try again
or
attach a new file
.
Cancel
You are about to add
0
people
to the discussion. Proceed with caution.
Finish editing this message first!
Save comment
Cancel
Please
register
or
sign in
to comment