js Map的使用
2024-09-03 15:38:08
setExpenseAndAmountSum: function() { var detailList = vehicleVueObj.vehicleData;
var expenseAmountSum = "";//报销金额
var expenseAmountMap = new Map();//存放key为币种符号,value为报销某一币种的合计
var invoiceCountSum = 0;
// var expenseAmountTotalMap = new Map();
if (detailList != undefined && detailList.length > 0){
for (var i = 0;i < detailList.length;i++) {
if(detailList[i]!=null){
//报销金额总和
var currencyNo = detailList[i]["currencySymbol"];//币别符号
var expenseAmount = detailList[i]["expenseAmount"];//报销金额
if(!detailList[i]["ifSettlement"]){ //去掉 统一结算的情况
var travelExpenseAmountTotal = Supp.Util.add(Number(expenseAmountMap.get(currencyNo) || 0) , Number(expenseAmount));
if(currencyNo!=null){
expenseAmountMap.set(currencyNo,travelExpenseAmountTotal);
}
} //票据的总数量
var invoiceCount = detailList[i]["invoiceCount"];
if(!isNaN(invoiceCount) && invoiceCount != "") {
invoiceCountSum = Supp.Util.add(invoiceCountSum,invoiceCount);
}
vehicleVueObj.titleSumData["invoiceCountSum"] = invoiceCountSum;
}
}
} //报销金额总和
if (expenseAmountMap != undefined && expenseAmountMap.size > 0) {
var varEntries = expenseAmountMap.entries();
var keyPairList = [];
for (var k = 0;k < 50;k++) {
keyPairList.push(varEntries.next().value);
} for (var indexPair = 0;indexPair < keyPairList.length; indexPair++) {
if(keyPairList[indexPair] != undefined){
var keyPair = keyPairList[indexPair];
var bibie = keyPair[0];
var money = keyPair[1];
expenseAmountSum += bibie + money + " ";
} } vehicleVueObj.titleSumData["expenseAmountSum"] = expenseAmountSum;
}
}
最新文章
- JS-slider.js实现鼠标拖动滑块控制取值特效
- git中使用.gitignore文件
- hibernate的dao中参数的传递取值
- iOS高性能图片架构与设计
- Python魔术师--self
- async: false的应用.
- 设置应用中出现NFC服务,去掉
- 关于cvAdsDiffS的那些事
- Debian 使用杂记(一)
- 《OS X Mountain Lion》 读书杂记
- 去掉CI框架默认url中的index.php
- 7.28.2 static关键字(静态和成员)
- nginx部署静态网站
- XSS绕过<;>;进行测试
- 使用nc传输文件和目录【转】
- 微信小程序开发---逻辑层(App Service)
- CodeForces - 375A Divisible by Seven(数学)
- 【AGC005F】简单的问题 Many Easy Problems
- CentOS 7 下 RabbitMQ 集群搭建
- [LeetCode] Network Delay Time 网络延迟时间——最短路算法 Bellman-Ford(DP) 和 dijkstra(本质上就是BFS的迭代变种)