class ts 扩展方法_TypeScript扩展类方法

if (!Array.prototype.firstOrDefault) { Array.prototype.firstOrDefault= function (predicate: (item: any) => boolean) {for (var i = 0; i < (>this).length; i++) { let item= (>this)[i];if(predicate(item)) {returnitem; } }return null; } }if (!Array.prototype.where) { Array.prototype.where= function (predicate: (item: any) => boolean) { let result=[];for (var i = 0; i < (>this).length; i++) { let item= (>this)[i];if(predicate(item)) { result.push(item); } }returnresult; } }if (!Array.prototype.remove) { Array.prototype.remove= function (item: any): boolean{ let index= (>this).indexOf(item);if (index >= 0) { (>this).splice(index, 1);return true; }return false; } }if (!Array.prototype.removeRange) { Array.prototype.removeRange= function (items: any[]): void{for (var i = 0; i < items.length; i++) { (>this).remove(items[i]); } } }if (!Array.prototype.add) { Array.prototype.add= function (item: any): void{ (>this).push(item); } }if (!Array.prototype.addRange) { Array.prototype.addRange= function (items: any[]): void{for (var i = 0; i < items.length; i++) { (>this).push(items[i]); } } }if (!Array.prototype.orderBy) { Array.prototype.orderBy= function (propertyExpression: (item: any) =>any) { let result=[];var compareFunction = (item1: any, item2: any): number =>{if (propertyExpression(item1) > propertyExpression(item2)) return 1;if (propertyExpression(item2) > propertyExpression(item1)) return -1;return 0; }for (var i = 0; i < (>this).length; i++) {return (>this).sort(compareFunction); }returnresult; } }if (!Array.prototype.orderByDescending) { Array.prototype.orderByDescending= function (propertyExpression: (item: any) =>any) { let result=[];var compareFunction = (item1: any, item2: any): number =>{if (propertyExpression(item1) > propertyExpression(item2)) return -1;if (propertyExpression(item2) > propertyExpression(item1)) return 1;return 0; }for (var i = 0; i < (>this).length; i++) {return (>this).sort(compareFunction); }returnresult; } }if (!Array.prototype.orderByMany) { Array.prototype.orderByMany= function (propertyExpressions: [(item: any) =>any]) { let result=[];var compareFunction = (item1: any, item2: any): number =>{for (var i = 0; i < propertyExpressions.length; i++) { let propertyExpression=propertyExpressions[i];if (propertyExpression(item1) > propertyExpression(item2)) return 1;if (propertyExpression(item2) > propertyExpression(item1)) return -1; }return 0; }for (var i = 0; i < (>this).length; i++) {return (>this).sort(compareFunction); }returnresult; } }if (!Array.prototype.orderByManyDescending) { Array.prototype.orderByManyDescending= function (propertyExpressions: [(item: any) =>any]) { let result=[];var compareFunction = (item1: any, item2: any): number =>{for (var i = 0; i < propertyExpressions.length; i++) { let propertyExpression=propertyExpressions[i];if (propertyExpression(item1) > propertyExpression(item2)) return -1;if (propertyExpression(item2) > propertyExpression(item1)) return 1; }return 0; }for (var i = 0; i < (>this).length; i++) {return (>this).sort(compareFunction); }returnresult; } } })();

  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值