Mirror/aicodix___code
1
0
Fork 0
mirror of https://github.com/aicodix/code.git synced 2026-04-27 14:30:36 +00:00
Code Issues Projects Releases Packages Wiki Activity

use the new sorting functions

Browse source
This commit is contained in:
Ahmet Inan 2024-03-07 22:04:09 +01:00
commit 957eb6f784
5 changed files with 16 additions and 40 deletions
Download patch file Download diff file Expand all files Collapse all files

12
polar_list_decoder.hh
View file

@ -6,6 +6,7 @@ Copyright 2020 Ahmet Inan <inan@aicodix.de>
#pragma once
#include "sort.hh"
#include "polar_helper.hh"
namespace CODE {
@ -61,16 +62,7 @@ struct PolarListNode<TYPE, 0>
else
fork[2*k+1] += sft.v[k];
int perm[2*TYPE::SIZE];
perm[0] = 0;
for (int i = 1, j; i < 2*TYPE::SIZE; ++i) {
PATH t = fork[i];
for (j = i; j > 0 && fork[j-1] > t; --j) {
fork[j] = fork[j-1];
perm[j] = perm[j-1];
}
fork[j] = t;
perm[j] = i;
}
CODE::insertion_sort(perm, fork, 2*TYPE::SIZE);
for (int k = 0; k < TYPE::SIZE; ++k)
metric[k] = fork[k];
MAP map;