Browse Source

build

master
qcc 6 years ago
parent
commit
0411f51fa7
  1. 10
      dist/bundle.js
  2. 46
      dist/bundle.min.js
  3. 10
      dist/core.js
  4. 10
      dist/fineui.js
  5. 46
      dist/fineui.min.js
  6. 10
      dist/fineui_without_jquery_polyfill.js
  7. 4
      dist/utils.min.js

10
dist/bundle.js vendored

@ -13185,17 +13185,21 @@ BI.ScalingCellSizeAndPositionManager.prototype = {
}; };
var _mkPYRslt = function (arr) { var _mkPYRslt = function (arr) {
var arrRslt = [""], k; var arrRslt = [""], k, multiLen = 0;
for (var i = 0, len = arr.length; i < len; i++) { for (var i = 0, len = arr.length; i < len; i++) {
var str = arr[i]; var str = arr[i];
var strlen = str.length; var strlen = str.length;
if (strlen == 1) { // 多音字过多的情况下,指数增长会造成浏览器卡死,超过20完全卡死,18勉强能用,考虑到不同性能最好是16或者14
// 超过14个多音字之后,后面的都用第一个拼音
if (strlen == 1 || multiLen > 14) {
var tmpStr = str.substring(0, 1);
for (k = 0; k < arrRslt.length; k++) { for (k = 0; k < arrRslt.length; k++) {
arrRslt[k] += str; arrRslt[k] += tmpStr;
} }
} else { } else {
var tmpArr = arrRslt.slice(0); var tmpArr = arrRslt.slice(0);
arrRslt = []; arrRslt = [];
multiLen ++;
for (k = 0; k < strlen; k++) { for (k = 0; k < strlen; k++) {
// 复制一个相同的arrRslt // 复制一个相同的arrRslt
var tmp = tmpArr.slice(0); var tmp = tmpArr.slice(0);

46
dist/bundle.min.js vendored

File diff suppressed because one or more lines are too long

10
dist/core.js vendored

@ -13185,17 +13185,21 @@ BI.ScalingCellSizeAndPositionManager.prototype = {
}; };
var _mkPYRslt = function (arr) { var _mkPYRslt = function (arr) {
var arrRslt = [""], k; var arrRslt = [""], k, multiLen = 0;
for (var i = 0, len = arr.length; i < len; i++) { for (var i = 0, len = arr.length; i < len; i++) {
var str = arr[i]; var str = arr[i];
var strlen = str.length; var strlen = str.length;
if (strlen == 1) { // 多音字过多的情况下,指数增长会造成浏览器卡死,超过20完全卡死,18勉强能用,考虑到不同性能最好是16或者14
// 超过14个多音字之后,后面的都用第一个拼音
if (strlen == 1 || multiLen > 14) {
var tmpStr = str.substring(0, 1);
for (k = 0; k < arrRslt.length; k++) { for (k = 0; k < arrRslt.length; k++) {
arrRslt[k] += str; arrRslt[k] += tmpStr;
} }
} else { } else {
var tmpArr = arrRslt.slice(0); var tmpArr = arrRslt.slice(0);
arrRslt = []; arrRslt = [];
multiLen ++;
for (k = 0; k < strlen; k++) { for (k = 0; k < strlen; k++) {
// 复制一个相同的arrRslt // 复制一个相同的arrRslt
var tmp = tmpArr.slice(0); var tmp = tmpArr.slice(0);

10
dist/fineui.js vendored

@ -13427,17 +13427,21 @@ BI.ScalingCellSizeAndPositionManager.prototype = {
}; };
var _mkPYRslt = function (arr) { var _mkPYRslt = function (arr) {
var arrRslt = [""], k; var arrRslt = [""], k, multiLen = 0;
for (var i = 0, len = arr.length; i < len; i++) { for (var i = 0, len = arr.length; i < len; i++) {
var str = arr[i]; var str = arr[i];
var strlen = str.length; var strlen = str.length;
if (strlen == 1) { // 多音字过多的情况下,指数增长会造成浏览器卡死,超过20完全卡死,18勉强能用,考虑到不同性能最好是16或者14
// 超过14个多音字之后,后面的都用第一个拼音
if (strlen == 1 || multiLen > 14) {
var tmpStr = str.substring(0, 1);
for (k = 0; k < arrRslt.length; k++) { for (k = 0; k < arrRslt.length; k++) {
arrRslt[k] += str; arrRslt[k] += tmpStr;
} }
} else { } else {
var tmpArr = arrRslt.slice(0); var tmpArr = arrRslt.slice(0);
arrRslt = []; arrRslt = [];
multiLen ++;
for (k = 0; k < strlen; k++) { for (k = 0; k < strlen; k++) {
// 复制一个相同的arrRslt // 复制一个相同的arrRslt
var tmp = tmpArr.slice(0); var tmp = tmpArr.slice(0);

46
dist/fineui.min.js vendored

File diff suppressed because one or more lines are too long

10
dist/fineui_without_jquery_polyfill.js vendored

@ -13185,17 +13185,21 @@ BI.ScalingCellSizeAndPositionManager.prototype = {
}; };
var _mkPYRslt = function (arr) { var _mkPYRslt = function (arr) {
var arrRslt = [""], k; var arrRslt = [""], k, multiLen = 0;
for (var i = 0, len = arr.length; i < len; i++) { for (var i = 0, len = arr.length; i < len; i++) {
var str = arr[i]; var str = arr[i];
var strlen = str.length; var strlen = str.length;
if (strlen == 1) { // 多音字过多的情况下,指数增长会造成浏览器卡死,超过20完全卡死,18勉强能用,考虑到不同性能最好是16或者14
// 超过14个多音字之后,后面的都用第一个拼音
if (strlen == 1 || multiLen > 14) {
var tmpStr = str.substring(0, 1);
for (k = 0; k < arrRslt.length; k++) { for (k = 0; k < arrRslt.length; k++) {
arrRslt[k] += str; arrRslt[k] += tmpStr;
} }
} else { } else {
var tmpArr = arrRslt.slice(0); var tmpArr = arrRslt.slice(0);
arrRslt = []; arrRslt = [];
multiLen ++;
for (k = 0; k < strlen; k++) { for (k = 0; k < strlen; k++) {
// 复制一个相同的arrRslt // 复制一个相同的arrRslt
var tmp = tmpArr.slice(0); var tmp = tmpArr.slice(0);

4
dist/utils.min.js vendored

File diff suppressed because one or more lines are too long
Loading…
Cancel
Save