fluencelabs/assemblyscript
1
0
Fork 0
mirror of https://github.com/fluencelabs/assemblyscript synced 2025-06-15 16:01:30 +00:00
Code Issues Projects Releases Wiki Activity

Implement Array#map, Array#forEach, Array#filter, Array#reduceRight (#81)

Browse Source
This commit is contained in:
Max Graey
2018-04-22 23:15:38 +03:00
committed by Daniel Wirtz
parent 05117f9ee3
commit fac0fc59b5
6 changed files with 3648 additions and 400 deletions
Download Patch File Download Diff File Expand all files Collapse all files

6
std/assembly.d.ts vendored
View File

@ -337,14 +337,18 @@ declare class Array<T> {
lastIndexOf(searchElement: T, fromIndex?: i32): i32;
push(element: T): void;
pop(): T;
forEach(callbackfn: (value: T, index: i32, array: Array<T>) => void): void;
map<U>(callbackfn: (value: T, index: i32, array: Array<T>) => U): Array<U>;
filter(callbackfn: (value: T, index: i32, array: Array<T>) => bool): Array<T>;
reduce<U>(callbackfn: (previousValue: U, currentValue: T, currentIndex: i32, array: Array<T>) => U, initialValue: U): U;
reduceRight<U>(callbackfn: (previousValue: U, currentValue: T, currentIndex: i32, array: Array<T>) => U, initialValue: U): U;
shift(): T;
some(callbackfn: (element: T, index: i32, array?: Array<T>) => bool): bool;
unshift(element: T): i32;
slice(from: i32, to?: i32): T[];
splice(start: i32, deleteCount?: i32): void;
reverse(): T[];
sort(comparator?: (a: T, b: T) => i32): T[];
sort(comparator?: (a: T, b: T) => i32): this;
}
/** Class representing a C-like array of values of type `T` with limited capabilities. */

43
std/assembly/array.ts
View File

@ -142,6 +142,35 @@ export class Array<T> {
return element;
}
forEach(callbackfn: (value: T, index: i32, array: Array<T>) => void): void {
var buffer = this.buffer_;
for (let index = 0, toIndex = this.length_; index < toIndex && index < this.length_; ++index) {
callbackfn(loadUnsafe<T>(buffer, index), index, this);
}
}
map<U>(callbackfn: (value: T, index: i32, array: Array<T>) => U): Array<U> {
var buffer = this.buffer_;
var length = this.length_;
var result = new Array<U>(length);
var resultBuffer = result.buffer_;
for (let index = 0; index < length && index < this.length_; ++index) {
storeUnsafe<U>(resultBuffer, index, callbackfn(loadUnsafe<T>(buffer, index), index, this));
}
return result;
}
filter(callbackfn: (value: T, index: i32, array: Array<T>) => bool): Array<T> {
var buffer = this.buffer_;
var length = this.length_;
var result = new Array<T>();
for (let index = 0; index < length && index < this.length_; ++index) {
let value = loadUnsafe<T>(buffer, index);
if (callbackfn(value, index, this)) result.push(value);
}
return result;
}
reduce<U>(
callbackfn: (previousValue: U, currentValue: T, currentIndex: i32, array: Array<T>) => U,
initialValue: U
@ -154,6 +183,18 @@ export class Array<T> {
return accum;
}
reduceRight<U>(
callbackfn: (previousValue: U, currentValue: T, currentIndex: i32, array: Array<T>) => U,
initialValue: U
): U {
var accum = initialValue;
var buffer = this.buffer_;
for (let index: i32 = this.length_ - 1; index >= 0; --index) {
accum = callbackfn(accum, loadUnsafe<T>(buffer, index), index, this);
}
return accum;
}
shift(): T {
var length = this.length_;
if (length < 1) throw new RangeError("Array is empty");
@ -245,7 +286,7 @@ export class Array<T> {
return this;
}
sort(comparator: (a: T, b: T) => i32 = defaultComparator<T>()): Array<T> {
sort(comparator: (a: T, b: T) => i32 = defaultComparator<T>()): this {
var length = this.length_;
if (length <= 1) return this;
var buffer = this.buffer_;

6
std/portable.d.ts vendored
View File

@ -237,14 +237,18 @@ declare class Array<T> {
lastIndexOf(searchElement: T, fromIndex?: i32): i32;
push(element: T): void;
pop(): T;
forEach(callbackfn: (value: T, index: i32, array: Array<T>) => void): void;
map<U>(callbackfn: (value: T, index: i32, array: Array<T>) => U): Array<U>;
filter(callbackfn: (value: T, index: i32, array: Array<T>) => bool): Array<T>;
reduce<U>(callbackfn: (previousValue: U, currentValue: T, currentIndex: i32, array: Array<T>) => U, initialValue: U): U;
reduceRight<U>(callbackfn: (previousValue: U, currentValue: T, currentIndex: i32, array: Array<T>) => U, initialValue: U): U;
shift(): T;
some(callbackfn: (element: T, index: i32, array?: Array<T>) => bool): bool;
unshift(element: T): i32;
slice(from: i32, to?: i32): T[];
splice(start: i32, deleteCount?: i32): void;
reverse(): T[];
sort(comparator?: (a: T, b: T) => i32): T[];
sort(comparator?: (a: T, b: T) => i32): this;
join(delim: string): string;
}