Browse Source

DEC-9661 fix: ztree bug, 把数组当map用,如果id和数组原型上方法重名的话就出错了

77a0c96d20 (diff-0ad2864be9738792b02ec0cd4eb22253)
es6
Dailer 5 years ago
parent
commit
2466ddcd04
  1. 2
      dist/2.0/fineui.ie.js
  2. 32
      dist/2.0/fineui.ie.min.js
  3. 2
      dist/2.0/fineui.js
  4. 14
      dist/2.0/fineui.min.js
  5. 2
      dist/base.js
  6. 2
      dist/bundle.ie.js
  7. 32
      dist/bundle.ie.min.js
  8. 2
      dist/bundle.js
  9. 14
      dist/bundle.min.js
  10. 2
      dist/fineui.ie.js
  11. 32
      dist/fineui.ie.min.js
  12. 2
      dist/fineui.js
  13. 30
      dist/fineui.min.js
  14. 2
      dist/utils.min.js
  15. 2
      src/base/tree/ztree/jquery.ztree.core-3.5.js

2
dist/2.0/fineui.ie.js vendored

@ -50283,7 +50283,7 @@ BI.shortcut("bi.custom_tree", BI.CustomTree);/*
if (tools.isArray(sNodes)) { if (tools.isArray(sNodes)) {
var r = []; var r = [];
var tmpMap = []; var tmpMap = {};
for (i=0, l=sNodes.length; i<l; i++) { for (i=0, l=sNodes.length; i<l; i++) {
tmpMap[sNodes[i][key]] = sNodes[i]; tmpMap[sNodes[i][key]] = sNodes[i];
} }

32
dist/2.0/fineui.ie.min.js vendored

File diff suppressed because one or more lines are too long

2
dist/2.0/fineui.js vendored

@ -50687,7 +50687,7 @@ BI.shortcut("bi.custom_tree", BI.CustomTree);/*
if (tools.isArray(sNodes)) { if (tools.isArray(sNodes)) {
var r = []; var r = [];
var tmpMap = []; var tmpMap = {};
for (i=0, l=sNodes.length; i<l; i++) { for (i=0, l=sNodes.length; i<l; i++) {
tmpMap[sNodes[i][key]] = sNodes[i]; tmpMap[sNodes[i][key]] = sNodes[i];
} }

14
dist/2.0/fineui.min.js vendored

File diff suppressed because one or more lines are too long

2
dist/base.js vendored

@ -12414,7 +12414,7 @@ BI.shortcut("bi.custom_tree", BI.CustomTree);/*
if (tools.isArray(sNodes)) { if (tools.isArray(sNodes)) {
var r = []; var r = [];
var tmpMap = []; var tmpMap = {};
for (i=0, l=sNodes.length; i<l; i++) { for (i=0, l=sNodes.length; i<l; i++) {
tmpMap[sNodes[i][key]] = sNodes[i]; tmpMap[sNodes[i][key]] = sNodes[i];
} }

2
dist/bundle.ie.js vendored

@ -50283,7 +50283,7 @@ BI.shortcut("bi.custom_tree", BI.CustomTree);/*
if (tools.isArray(sNodes)) { if (tools.isArray(sNodes)) {
var r = []; var r = [];
var tmpMap = []; var tmpMap = {};
for (i=0, l=sNodes.length; i<l; i++) { for (i=0, l=sNodes.length; i<l; i++) {
tmpMap[sNodes[i][key]] = sNodes[i]; tmpMap[sNodes[i][key]] = sNodes[i];
} }

32
dist/bundle.ie.min.js vendored

File diff suppressed because one or more lines are too long

2
dist/bundle.js vendored

@ -50687,7 +50687,7 @@ BI.shortcut("bi.custom_tree", BI.CustomTree);/*
if (tools.isArray(sNodes)) { if (tools.isArray(sNodes)) {
var r = []; var r = [];
var tmpMap = []; var tmpMap = {};
for (i=0, l=sNodes.length; i<l; i++) { for (i=0, l=sNodes.length; i<l; i++) {
tmpMap[sNodes[i][key]] = sNodes[i]; tmpMap[sNodes[i][key]] = sNodes[i];
} }

14
dist/bundle.min.js vendored

File diff suppressed because one or more lines are too long

2
dist/fineui.ie.js vendored

@ -50528,7 +50528,7 @@ BI.shortcut("bi.custom_tree", BI.CustomTree);/*
if (tools.isArray(sNodes)) { if (tools.isArray(sNodes)) {
var r = []; var r = [];
var tmpMap = []; var tmpMap = {};
for (i=0, l=sNodes.length; i<l; i++) { for (i=0, l=sNodes.length; i<l; i++) {
tmpMap[sNodes[i][key]] = sNodes[i]; tmpMap[sNodes[i][key]] = sNodes[i];
} }

32
dist/fineui.ie.min.js vendored

File diff suppressed because one or more lines are too long

2
dist/fineui.js vendored

@ -50932,7 +50932,7 @@ BI.shortcut("bi.custom_tree", BI.CustomTree);/*
if (tools.isArray(sNodes)) { if (tools.isArray(sNodes)) {
var r = []; var r = [];
var tmpMap = []; var tmpMap = {};
for (i=0, l=sNodes.length; i<l; i++) { for (i=0, l=sNodes.length; i<l; i++) {
tmpMap[sNodes[i][key]] = sNodes[i]; tmpMap[sNodes[i][key]] = sNodes[i];
} }

30
dist/fineui.min.js vendored

File diff suppressed because one or more lines are too long

2
dist/utils.min.js vendored

File diff suppressed because one or more lines are too long

2
src/base/tree/ztree/jquery.ztree.core-3.5.js

@ -603,7 +603,7 @@
if (tools.isArray(sNodes)) { if (tools.isArray(sNodes)) {
var r = []; var r = [];
var tmpMap = []; var tmpMap = {};
for (i=0, l=sNodes.length; i<l; i++) { for (i=0, l=sNodes.length; i<l; i++) {
tmpMap[sNodes[i][key]] = sNodes[i]; tmpMap[sNodes[i][key]] = sNodes[i];
} }

Loading…
Cancel
Save