Skip to content
Open
Show file tree
Hide file tree
Changes from all commits
Commits
File filter

Filter by extension

Filter by extension

Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
16 changes: 8 additions & 8 deletions src/transforms/window.js
Original file line number Diff line number Diff line change
Expand Up @@ -244,7 +244,7 @@ function reduceDifference(k, s, strict) {
return strict
? {
mapIndex(I, S, T) {
for (let i = 0, n = I.length - k; i < n; ++i) {
for (let i = 0, n = I.length - k + 1; i < n; ++i) {
const a = S[I[i]];
const b = S[I[i + k - 1]];
T[I[i + s]] = a === null || b === null ? NaN : b - a;
Expand All @@ -253,7 +253,7 @@ function reduceDifference(k, s, strict) {
}
: {
mapIndex(I, S, T) {
for (let i = -s, n = I.length - k + s + 1; i < n; ++i) {
for (let i = -s, n = I.length - s; i < n; ++i) {
T[I[i + s]] = lastNumber(S, I, i, k) - firstNumber(S, I, i, k);
}
}
Expand All @@ -264,7 +264,7 @@ function reduceRatio(k, s, strict) {
return strict
? {
mapIndex(I, S, T) {
for (let i = 0, n = I.length - k; i < n; ++i) {
for (let i = 0, n = I.length - k + 1; i < n; ++i) {
const a = S[I[i]];
const b = S[I[i + k - 1]];
T[I[i + s]] = a === null || b === null ? NaN : b / a;
Expand All @@ -273,7 +273,7 @@ function reduceRatio(k, s, strict) {
}
: {
mapIndex(I, S, T) {
for (let i = -s, n = I.length - k + s + 1; i < n; ++i) {
for (let i = -s, n = I.length - s; i < n; ++i) {
T[I[i + s]] = lastNumber(S, I, i, k) / firstNumber(S, I, i, k);
}
}
Expand All @@ -284,14 +284,14 @@ function reduceFirst(k, s, strict) {
return strict
? {
mapIndex(I, S, T) {
for (let i = 0, n = I.length - k; i < n; ++i) {
for (let i = 0, n = I.length - k + 1; i < n; ++i) {
T[I[i + s]] = S[I[i]];
}
}
}
: {
mapIndex(I, S, T) {
for (let i = -s, n = I.length - k + s + 1; i < n; ++i) {
for (let i = -s, n = I.length - s; i < n; ++i) {
T[I[i + s]] = firstDefined(S, I, i, k);
}
}
Expand All @@ -302,14 +302,14 @@ function reduceLast(k, s, strict) {
return strict
? {
mapIndex(I, S, T) {
for (let i = 0, n = I.length - k; i < n; ++i) {
for (let i = 0, n = I.length - k + 1; i < n; ++i) {
T[I[i + s]] = S[I[i + k - 1]];
}
}
}
: {
mapIndex(I, S, T) {
for (let i = -s, n = I.length - k + s + 1; i < n; ++i) {
for (let i = -s, n = I.length - s; i < n; ++i) {
T[I[i + s]] = lastDefined(S, I, i, k);
}
}
Expand Down
Loading