mirror of
https://github.com/aicodix/code.git
synced 2026-04-27 14:30:36 +00:00
oops
This commit is contained in:
parent
9e32042df8
commit
e96e4abe0e
2 changed files with 2 additions and 2 deletions
|
|
@ -16,7 +16,7 @@ public:
|
||||||
int operator()(const int8_t *code)
|
int operator()(const int8_t *code)
|
||||||
{
|
{
|
||||||
int sum[N];
|
int sum[N];
|
||||||
for (int i = 0; i < N; i += 2) {
|
for (int i = 0; i < N-1; i += 2) {
|
||||||
sum[i] = code[i] + code[i+1];
|
sum[i] = code[i] + code[i+1];
|
||||||
sum[i+1] = code[i] - code[i+1];
|
sum[i+1] = code[i] - code[i+1];
|
||||||
}
|
}
|
||||||
|
|
|
||||||
|
|
@ -18,7 +18,7 @@ public:
|
||||||
int sum[W];
|
int sum[W];
|
||||||
sum[0] = code[0];
|
sum[0] = code[0];
|
||||||
sum[1] = -code[0];
|
sum[1] = -code[0];
|
||||||
for (int i = 1; i < W; i += 2) {
|
for (int i = 1; i < W-2; i += 2) {
|
||||||
sum[i+1] = code[i] + code[i+1];
|
sum[i+1] = code[i] + code[i+1];
|
||||||
sum[i+2] = code[i] - code[i+1];
|
sum[i+2] = code[i] - code[i+1];
|
||||||
}
|
}
|
||||||
|
|
|
||||||
Loading…
Add table
Add a link
Reference in a new issue