diff options
| author | Edward Thomson <ethomson@edwardthomson.com> | 2017-07-26 23:24:28 +0100 |
|---|---|---|
| committer | GitHub <noreply@github.com> | 2017-07-26 23:24:28 +0100 |
| commit | ed00ac06049b05992b677ef970071fe4129b2781 (patch) | |
| tree | fb9368e566209d4ad8d382d8e22f361eaf026b43 | |
| parent | 8f9d2bbf8384d1b8dbcb18d4c4f095da6ed85c80 (diff) | |
| parent | fdbb40fdd8b3a7337b9a354ca59039b19a50328a (diff) | |
| download | libgit2-ed00ac06049b05992b677ef970071fe4129b2781.tar.gz | |
Merge pull request #4314 from pks-t/pks/timsort
tsort: remove idempotent conditional assignment
| -rw-r--r-- | src/tsort.c | 1 |
1 files changed, 0 insertions, 1 deletions
diff --git a/src/tsort.c b/src/tsort.c index e59819204..8d1ed9787 100644 --- a/src/tsort.c +++ b/src/tsort.c @@ -310,7 +310,6 @@ static ssize_t collapse(void **dst, struct tsort_run *stack, ssize_t stack_curr, #define PUSH_NEXT() do {\ len = count_run(dst, curr, size, store);\ run = minrun;\ - if (run < minrun) run = minrun;\ if (run > (ssize_t)size - curr) run = size - curr;\ if (run > len) {\ bisort(&dst[curr], len, run, cmp, payload);\ |