You can not select more than 25 topics
Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
419 lines
14 KiB
419 lines
14 KiB
1 week ago
|
|
||
|
|
declare global {
|
||
|
|
interface Array<T> {
|
||
|
|
/** 删除指定条件的数据 */
|
||
|
|
remove(filter: (v: T, i: number, arr: Array<T>) => boolean): Array<T>;
|
||
|
|
remove(filter: T): Array<T>;
|
||
|
|
|
||
|
|
/** 找到第一个满足回调条件的元素并将其移除 */
|
||
|
|
removeOne(filter: (v: T, i: number, arr: Array<T>) => boolean): Array<T>;
|
||
|
|
removeOne(filter: T): Array<T>;
|
||
|
|
|
||
|
|
random(): T;
|
||
|
|
|
||
|
|
/** 获取数组中第一条数据 */
|
||
|
|
first(): T;
|
||
|
|
/** 获取数组中最后条数据 */
|
||
|
|
last(): T;
|
||
|
|
|
||
|
|
/** 获取数组中最大数据 */
|
||
|
|
max(): T;
|
||
|
|
max<P>(mapper: (v: T, i: number, arr: this) => P): P | null;
|
||
|
|
|
||
|
|
/** 获取数组中最小数据 */
|
||
|
|
min(): T;
|
||
|
|
min<P>(mapper: (v: T, i: number, arr: this) => P): P | null;
|
||
|
|
|
||
|
|
/** 返回没有重复数据的新数组 */
|
||
|
|
distinct(): Array<T>;
|
||
|
|
filterIndex(filter: (v: T, i: number, arr: this) => boolean): Array<number>;
|
||
|
|
|
||
|
|
/** 过滤出有效记录数量 */
|
||
|
|
count(filter: (v: T, i: number, arr: this) => boolean): number;
|
||
|
|
/** 数组求和 */
|
||
|
|
sum(mapper?: (v: T, i: number, arr: this) => number): number;
|
||
|
|
/** 数组平均值 */
|
||
|
|
average(mapper?: (v: T, i: number, arr: this) => number): number;
|
||
|
|
|
||
|
|
/** 移除指定位置的元素 返回移除的元素 */
|
||
|
|
fastRemoveAt(index: number): T;
|
||
|
|
/** 移除数组中指定数据 */
|
||
|
|
fastRemove(value: T): boolean;
|
||
|
|
|
||
|
|
/** 同find，但返回整个Array<T>中最后一个匹配元素 */
|
||
|
|
findLast(predicate: (value: T, index: number, obj: Array<T>) => boolean): T | undefined;
|
||
|
|
/** 同find，但返回整个Array<T>中最后一个匹配元素的index */
|
||
|
|
findLastIndex(predicate: (value: T, index: number, obj: Array<T>) => boolean): number;
|
||
|
|
|
||
|
|
/** 排序升序，返回新的数组 */
|
||
|
|
orderBy(...mappers: ((v: T) => any)[]): Array<T>;
|
||
|
|
/** 排序降序，返回新的数组 */
|
||
|
|
orderByDesc(...mappers: ((v: T) => any)[]): Array<T>;
|
||
|
|
|
||
|
|
/**
|
||
|
|
* 二分查找 前提是数组一定是有序的
|
||
|
|
* @param value 要查找的值
|
||
|
|
* @param keyMapper 要查找的值的mapper方法（默认为查找数组元素本身）
|
||
|
|
* @return 查找到的index，查不到返回-1
|
||
|
|
*/
|
||
|
|
binarySearch(value: number | string, keyMapper?: (v: T) => (number | string)): number;
|
||
|
|
/**
|
||
|
|
* 二分插入 前提是数组一定是有序的
|
||
|
|
* @param item 要插入的值
|
||
|
|
* @param keyMapper 二分查找时要查找的值的mapper方法（默认为查找数组元素本身）
|
||
|
|
* @param unique 是否去重，如果为true，则如果数组内已经有值时不插入，返回已有值的number
|
||
|
|
* @return 返回插入的index位置
|
||
|
|
*/
|
||
|
|
binaryInsert(item: T, unique?: boolean): number;
|
||
|
|
binaryInsert(item: T, keyMapper: (v: T) => (number | string), unique?: boolean): number;
|
||
|
|
/**
|
||
|
|
* 二分去重 前提是数组一定是有序的
|
||
|
|
* @param keyMapper 二分查找时要查找的值的mapper方法（默认为查找数组元素本身）
|
||
|
|
*/
|
||
|
|
binaryDistinct(keyMapper?: (v: T) => (number | string)): Array<T>;
|
||
|
|
/** 指定字段分组 */
|
||
|
|
groupBy(grouper: (v: T) => any): (T[] & { key: any })[];
|
||
|
|
/**分组整理（不排序，只将相同元素整理在一起） */
|
||
|
|
group();
|
||
|
|
/**打乱(洗牌) */
|
||
|
|
shuffle();
|
||
|
|
}
|
||
|
|
}
|
||
|
|
|
||
|
|
// @ts-ignore
|
||
|
|
!Array.prototype.__cc_extended && Object.defineProperties(Array.prototype, {
|
||
|
|
remove: {
|
||
|
|
value: function (filter: any) {
|
||
|
|
if (typeof (filter) == 'function') {
|
||
|
|
for (let i = this.length - 1; i > -1; --i) {
|
||
|
|
filter(this[i], i, this) && this.splice(i, 1);
|
||
|
|
}
|
||
|
|
}
|
||
|
|
else {
|
||
|
|
for (let i = this.length - 1; i > -1; --i) {
|
||
|
|
this[i] === filter && this.splice(i, 1);
|
||
|
|
}
|
||
|
|
}
|
||
|
|
return this;
|
||
|
|
}
|
||
|
|
},
|
||
|
|
removeOne: {
|
||
|
|
value: function (filter: any) {
|
||
|
|
if (typeof (filter) == 'function') {
|
||
|
|
for (let i = 0; i < this.length; ++i) {
|
||
|
|
if (filter(this[i], i, this)) {
|
||
|
|
this.splice(i, 1);
|
||
|
|
return this;
|
||
|
|
}
|
||
|
|
}
|
||
|
|
}
|
||
|
|
else {
|
||
|
|
for (let i = 0; i < this.length; ++i) {
|
||
|
|
if (this[i] === filter) {
|
||
|
|
this.splice(i, 1);
|
||
|
|
return this;
|
||
|
|
}
|
||
|
|
}
|
||
|
|
}
|
||
|
|
return this;
|
||
|
|
}
|
||
|
|
},
|
||
|
|
random: {
|
||
|
|
value: function () {
|
||
|
|
let element = this[Math.floor(Math.random() * this.length)];
|
||
|
|
return element;
|
||
|
|
}
|
||
|
|
},
|
||
|
|
fastRemoveAt: {
|
||
|
|
value: function (index: number) {
|
||
|
|
const length = this.length;
|
||
|
|
if (index < 0 || index >= length) {
|
||
|
|
return null;
|
||
|
|
}
|
||
|
|
let res = this[index];
|
||
|
|
this[index] = this[length - 1];
|
||
|
|
this.length = length - 1;
|
||
|
|
return res;
|
||
|
|
}
|
||
|
|
},
|
||
|
|
fastRemove: {
|
||
|
|
value: function (value: any) {
|
||
|
|
const index = this.indexOf(value);
|
||
|
|
if (index >= 0) {
|
||
|
|
this[index] = this[this.length - 1];
|
||
|
|
--this.length;
|
||
|
|
return true;
|
||
|
|
}
|
||
|
|
return false;
|
||
|
|
}
|
||
|
|
},
|
||
|
|
first: {
|
||
|
|
value: function () {
|
||
|
|
return this.length ? this[0] : null;
|
||
|
|
}
|
||
|
|
},
|
||
|
|
last: {
|
||
|
|
value: function () {
|
||
|
|
return this.length ? this[this.length - 1] : null;
|
||
|
|
}
|
||
|
|
},
|
||
|
|
max: {
|
||
|
|
value: function (mapper: any) {
|
||
|
|
if (!this.length) {
|
||
|
|
return null;
|
||
|
|
}
|
||
|
|
function _max(a: number, b: number) {
|
||
|
|
return a > b ? a : b;
|
||
|
|
}
|
||
|
|
if (typeof (mapper) == 'function') {
|
||
|
|
let max = mapper(this[0], 0, this);
|
||
|
|
for (let i = 1; i < this.length; ++i) {
|
||
|
|
let temp = mapper(this[i], i, this);
|
||
|
|
max = temp > max ? temp : max;
|
||
|
|
}
|
||
|
|
return max;
|
||
|
|
}
|
||
|
|
else {
|
||
|
|
return this.reduce(function (prev: any, cur: any) { return _max(prev, cur); });
|
||
|
|
}
|
||
|
|
}
|
||
|
|
},
|
||
|
|
min: {
|
||
|
|
value: function (mapper: any) {
|
||
|
|
if (!this.length) {
|
||
|
|
return null;
|
||
|
|
}
|
||
|
|
function _min(a: number, b: number) {
|
||
|
|
return a < b ? a : b;
|
||
|
|
}
|
||
|
|
if (typeof (mapper) == 'function') {
|
||
|
|
let min = mapper(this[0], 0, this);
|
||
|
|
for (let i = 1; i < this.length; ++i) {
|
||
|
|
let temp = mapper(this[i], i, this);
|
||
|
|
min = temp < min ? temp : min;
|
||
|
|
}
|
||
|
|
return min;
|
||
|
|
}
|
||
|
|
else {
|
||
|
|
return this.reduce(function (prev: any, cur: any) { return _min(prev, cur); });
|
||
|
|
}
|
||
|
|
}
|
||
|
|
},
|
||
|
|
distinct: {
|
||
|
|
value: function () {
|
||
|
|
return this.filter(function (v: any, i: number, arr: any[]) { return arr.indexOf(v) === i; });
|
||
|
|
}
|
||
|
|
},
|
||
|
|
filterIndex: {
|
||
|
|
value: function (filter: any) {
|
||
|
|
let output = [];
|
||
|
|
for (let i = 0; i < this.length; ++i) {
|
||
|
|
if (filter(this[i], i, this)) {
|
||
|
|
output.push(i);
|
||
|
|
}
|
||
|
|
}
|
||
|
|
return output;
|
||
|
|
}
|
||
|
|
},
|
||
|
|
count: {
|
||
|
|
value: function (filter: any) {
|
||
|
|
let result = 0;
|
||
|
|
for (let i = 0; i < this.length; ++i) {
|
||
|
|
if (filter(this[i], i, this)) {
|
||
|
|
++result;
|
||
|
|
}
|
||
|
|
}
|
||
|
|
return result;
|
||
|
|
}
|
||
|
|
},
|
||
|
|
sum: {
|
||
|
|
value: function (mapper: any) {
|
||
|
|
let result = 0;
|
||
|
|
for (let i = 0; i < this.length; ++i) {
|
||
|
|
result += mapper ? mapper(this[i], i, this) : this[i];
|
||
|
|
}
|
||
|
|
return result;
|
||
|
|
}
|
||
|
|
},
|
||
|
|
average: {
|
||
|
|
value: function (mapper: any) {
|
||
|
|
return this.sum(mapper) / this.length;
|
||
|
|
}
|
||
|
|
},
|
||
|
|
orderBy: {
|
||
|
|
value: function () {
|
||
|
|
let mappers = [];
|
||
|
|
for (let _i = 0; _i < arguments.length; _i++) {
|
||
|
|
mappers[_i] = arguments[_i];
|
||
|
|
}
|
||
|
|
return this.slice().sort(function (a: any, b: any) {
|
||
|
|
for (let i = 0; i < mappers.length; ++i) {
|
||
|
|
let va = mappers[i](a);
|
||
|
|
let vb = mappers[i](b);
|
||
|
|
if (va > vb) {
|
||
|
|
return 1;
|
||
|
|
}
|
||
|
|
else if (va < vb) {
|
||
|
|
return -1;
|
||
|
|
}
|
||
|
|
}
|
||
|
|
return 0;
|
||
|
|
});
|
||
|
|
}
|
||
|
|
},
|
||
|
|
orderByDesc: {
|
||
|
|
value: function () {
|
||
|
|
let mappers = [];
|
||
|
|
for (let _i = 0; _i < arguments.length; _i++) {
|
||
|
|
mappers[_i] = arguments[_i];
|
||
|
|
}
|
||
|
|
return this.slice().sort(function (a: any, b: any) {
|
||
|
|
for (let i = 0; i < mappers.length; ++i) {
|
||
|
|
let va = mappers[i](a);
|
||
|
|
let vb = mappers[i](b);
|
||
|
|
if (va > vb) {
|
||
|
|
return -1;
|
||
|
|
}
|
||
|
|
else if (va < vb) {
|
||
|
|
return 1;
|
||
|
|
}
|
||
|
|
}
|
||
|
|
return 0;
|
||
|
|
});
|
||
|
|
}
|
||
|
|
},
|
||
|
|
binarySearch: {
|
||
|
|
value: function (value: any, keyMapper: any) {
|
||
|
|
let low = 0, high = this.length - 1;
|
||
|
|
while (low <= high) {
|
||
|
|
let mid = ((high + low) / 2) | 0;
|
||
|
|
let midValue = keyMapper ? keyMapper(this[mid]) : this[mid];
|
||
|
|
if (value === midValue) {
|
||
|
|
return mid;
|
||
|
|
}
|
||
|
|
else if (value > midValue) {
|
||
|
|
low = mid + 1;
|
||
|
|
}
|
||
|
|
else if (value < midValue) {
|
||
|
|
high = mid - 1;
|
||
|
|
}
|
||
|
|
}
|
||
|
|
return -1;
|
||
|
|
}
|
||
|
|
},
|
||
|
|
binaryInsert: {
|
||
|
|
value: function (item: any, keyMapper: any, unique: any) {
|
||
|
|
if (typeof (keyMapper) == 'boolean') {
|
||
|
|
unique = keyMapper;
|
||
|
|
keyMapper = undefined;
|
||
|
|
}
|
||
|
|
let low = 0, high = this.length - 1;
|
||
|
|
let mid = NaN;
|
||
|
|
let itemValue = keyMapper ? keyMapper(item) : item;
|
||
|
|
while (low <= high) {
|
||
|
|
mid = ((high + low) / 2) | 0;
|
||
|
|
let midValue = keyMapper ? keyMapper(this[mid]) : this[mid];
|
||
|
|
if (itemValue === midValue) {
|
||
|
|
if (unique) {
|
||
|
|
return mid;
|
||
|
|
}
|
||
|
|
else {
|
||
|
|
break;
|
||
|
|
}
|
||
|
|
}
|
||
|
|
else if (itemValue > midValue) {
|
||
|
|
low = mid + 1;
|
||
|
|
}
|
||
|
|
else if (itemValue < midValue) {
|
||
|
|
high = mid - 1;
|
||
|
|
}
|
||
|
|
}
|
||
|
|
let index = low > mid ? mid + 1 : mid;
|
||
|
|
this.splice(index, 0, item);
|
||
|
|
return index;
|
||
|
|
}
|
||
|
|
},
|
||
|
|
binaryDistinct: {
|
||
|
|
value: function (keyMapper: any) {
|
||
|
|
return this.filter(function (v: any, i: number, arr: any[]) { return arr.binarySearch(v, keyMapper) === i; });
|
||
|
|
}
|
||
|
|
},
|
||
|
|
findLast: {
|
||
|
|
value: function (predicate: any) {
|
||
|
|
for (let i = this.length - 1; i > -1; --i) {
|
||
|
|
if (predicate(this[i], i, this)) {
|
||
|
|
return this[i];
|
||
|
|
}
|
||
|
|
}
|
||
|
|
return undefined;
|
||
|
|
}
|
||
|
|
},
|
||
|
|
findLastIndex: {
|
||
|
|
value: function (predicate: any) {
|
||
|
|
for (let i = this.length - 1; i > -1; --i) {
|
||
|
|
if (predicate(this[i], i, this)) {
|
||
|
|
return i;
|
||
|
|
}
|
||
|
|
}
|
||
|
|
return -1;
|
||
|
|
}
|
||
|
|
},
|
||
|
|
groupBy: {
|
||
|
|
value: function (grouper: any) {
|
||
|
|
let group = this.reduce(function (prev: any, next: any) {
|
||
|
|
let groupKey = grouper(next);
|
||
|
|
if (!prev[groupKey]) {
|
||
|
|
prev[groupKey] = [];
|
||
|
|
}
|
||
|
|
prev[groupKey].push(next);
|
||
|
|
return prev;
|
||
|
|
}, {});
|
||
|
|
return Object.keys(group).map(function (key) {
|
||
|
|
let arr = group[key];
|
||
|
|
arr.key = key;
|
||
|
|
return arr;
|
||
|
|
});
|
||
|
|
}
|
||
|
|
},
|
||
|
|
group: {
|
||
|
|
value: function () {
|
||
|
|
let countMap: { [key: string]: any[] } = {};
|
||
|
|
let keyArr = [];
|
||
|
|
for (let element of this) {
|
||
|
|
const key = JSON.stringify(element);
|
||
|
|
if (countMap[key]) {
|
||
|
|
countMap[key].push(element);
|
||
|
|
} else {
|
||
|
|
countMap[key] = [element];
|
||
|
|
keyArr.push(key);
|
||
|
|
}
|
||
|
|
}
|
||
|
|
|
||
|
|
let index = 0;
|
||
|
|
for (let k = 0; k < keyArr.length; k++) {
|
||
|
|
const arr = countMap[keyArr[k]];
|
||
|
|
for (let i = 0; i < arr.length; i++) {
|
||
|
|
this[index++] = arr[i];
|
||
|
|
}
|
||
|
|
}
|
||
|
|
return this;
|
||
|
|
}
|
||
|
|
},
|
||
|
|
shuffle: {
|
||
|
|
value: function () {
|
||
|
|
for (let i = this.length - 1; i > 0; i--) {
|
||
|
|
// 生成一个从 0 到 i 的随机索引
|
||
|
|
const j = Math.floor(Math.random() * (i + 1));
|
||
|
|
// 交换元素
|
||
|
|
[this[i], this[j]] = [this[j], this[i]];
|
||
|
|
}
|
||
|
|
}
|
||
|
|
},
|
||
|
|
__cc_extended: {
|
||
|
|
value: true
|
||
|
|
}
|
||
|
|
});
|
||
|
|
|
||
|
|
export { };
|
||
|
|
|