zoukankan      html  css  js  c++  java
  • 数组合并组合

    1、俩数组合并组合问题记录

        const initkinditems = copy(this.vo.initkinditems);
        let kindsResult: any = [];
        let isamount050202 = -1;
        items.forEach((ele: any) => {
          //
          if (ele.kindCode === '050202') {
            isamount050202 = ele.amount;
          }
          kindsResult = initkinditems.map((v: any) => ({
            ...v,
            amount: ele.kindCode === v.kindCode ? ele.amount : -1,
            iopStatus: ele.kindCode === v.kindCode ? ele.iopStatus : -1,
            iopPremium: ele.kindCode === v.kindCode ? ele.iopPremium : '0.00',
            premium: ele.kindCode === v.kindCode ? ele.premium : '0.00',
          }));
        });

        // kindsResult只组合了items 最后一次的数组 

     解决

        const { items } = model.bi;
        const initkinditems = copy(this.vo.initkinditems);
        let kindsResult: any = [];
        let isamount050202 = -1;
        items.forEach((ele: any) => {
          //
          if (ele.kindCode === '050202') {
            isamount050202 = ele.amount;
          }
        });
        kindsResult = initkinditems.map((v: any) => ({
          ...v,
          amount: -1,
          iopStatus: -1,
          iopPremium: '0.00',
          premium: '0.00',
        }));
        kindsResult.forEach((v: any, index: number) => {
          items.forEach((item: any) => {
            if (item.kindCode === v.kindCode) {
              // console.log(item.kindCode);
              v.amount = item.amount;
              v.iopStatus = item.iopStatus;
              v.iopPremium = item.iopPremium;
              v.premium = item.premium;
            }
          });
        });
  • 相关阅读:
    英语八大时态
    linux yum被占用
    文件上传ajaxfileupload.js插件
    jquery.qrcode.js生成二维码
    判断手机,pc方式登录
    点击小图轮播,点击显示大图
    图片预览功能
    Java Hash表 数据结构
    Java Tree 树 数据结构
    Java Queue 队列
  • 原文地址:https://www.cnblogs.com/y896926473/p/13307456.html
Copyright © 2011-2022 走看看