/*! time: 2020-11-13 18:30:22 */
/******/ ( function ( modules ) { // webpackBootstrap
/******/ // The module cache
/******/ var installedModules = { } ;
/******/
/******/ // The require function
/******/ function _ _webpack _require _ _ ( moduleId ) {
/******/
/******/ // Check if module is in cache
/******/ if ( installedModules [ moduleId ] ) {
/******/ return installedModules [ moduleId ] . exports ;
/******/ }
/******/ // Create a new module (and put it into the cache)
/******/ var module = installedModules [ moduleId ] = {
/******/ i : moduleId ,
/******/ l : false ,
/******/ exports : { }
/******/ } ;
/******/
/******/ // Execute the module function
/******/ modules [ moduleId ] . call ( module . exports , module , module . exports , _ _webpack _require _ _ ) ;
/******/
/******/ // Flag the module as loaded
/******/ module . l = true ;
/******/
/******/ // Return the exports of the module
/******/ return module . exports ;
/******/ }
/******/
/******/
/******/ // expose the modules object (__webpack_modules__)
/******/ _ _webpack _require _ _ . m = modules ;
/******/
/******/ // expose the module cache
/******/ _ _webpack _require _ _ . c = installedModules ;
/******/
/******/ // define getter function for harmony exports
/******/ _ _webpack _require _ _ . d = function ( exports , name , getter ) {
/******/ if ( ! _ _webpack _require _ _ . o ( exports , name ) ) {
/******/ Object . defineProperty ( exports , name , { enumerable : true , get : getter } ) ;
/******/ }
/******/ } ;
/******/
/******/ // define __esModule on exports
/******/ _ _webpack _require _ _ . r = function ( exports ) {
/******/ if ( typeof Symbol !== 'undefined' && Symbol . toStringTag ) {
/******/ Object . defineProperty ( exports , Symbol . toStringTag , { value : 'Module' } ) ;
/******/ }
/******/ Object . defineProperty ( exports , '__esModule' , { value : true } ) ;
/******/ } ;
/******/
/******/ // create a fake namespace object
/******/ // mode & 1: value is a module id, require it
/******/ // mode & 2: merge all properties of value into the ns
/******/ // mode & 4: return value when already ns object
/******/ // mode & 8|1: behave like require
/******/ _ _webpack _require _ _ . t = function ( value , mode ) {
/******/ if ( mode & 1 ) value = _ _webpack _require _ _ ( value ) ;
/******/ if ( mode & 8 ) return value ;
/******/ if ( ( mode & 4 ) && typeof value === 'object' && value && value . _ _esModule ) return value ;
/******/ var ns = Object . create ( null ) ;
/******/ _ _webpack _require _ _ . r ( ns ) ;
/******/ Object . defineProperty ( ns , 'default' , { enumerable : true , value : value } ) ;
/******/ if ( mode & 2 && typeof value != 'string' ) for ( var key in value ) _ _webpack _require _ _ . d ( ns , key , function ( key ) { return value [ key ] ; } . bind ( null , key ) ) ;
/******/ return ns ;
/******/ } ;
/******/
/******/ // getDefaultExport function for compatibility with non-harmony modules
/******/ _ _webpack _require _ _ . n = function ( module ) {
/******/ var getter = module && module . _ _esModule ?
/******/ function getDefault ( ) { return module [ 'default' ] ; } :
/******/ function getModuleExports ( ) { return module ; } ;
/******/ _ _webpack _require _ _ . d ( getter , 'a' , getter ) ;
/******/ return getter ;
/******/ } ;
/******/
/******/ // Object.prototype.hasOwnProperty.call
/******/ _ _webpack _require _ _ . o = function ( object , property ) { return Object . prototype . hasOwnProperty . call ( object , property ) ; } ;
/******/
/******/ // __webpack_public_path__
/******/ _ _webpack _require _ _ . p = "" ;
/******/
/******/
/******/ // Load entry module and return exports
/******/ return _ _webpack _require _ _ ( _ _webpack _require _ _ . s = 1089 ) ;
/******/ } )
/************************************************************************/
/******/ ( {
/***/ 101 :
/***/ ( function ( module , exports , _ _webpack _require _ _ ) {
/* WEBPACK VAR INJECTION */ ( function ( global ) { / * *
* Created by richie on 15 / 7 / 8.
* /
/ * *
* 初始化BI对象
* /
_global = undefined ;
if ( typeof window !== "undefined" ) {
_global = window ;
} else if ( typeof global !== "undefined" ) {
_global = global ;
} else if ( typeof self !== "undefined" ) {
_global = self ;
} else {
_global = this ;
}
if ( _global . BI == null ) {
_global . BI = { prepares : [ ] } ;
}
if ( _global . BI . prepares == null ) {
_global . BI . prepares = [ ] ;
}
/* WEBPACK VAR INJECTION */ } . call ( this , _ _webpack _require _ _ ( 13 ) ) )
/***/ } ) ,
/***/ 102 :
/***/ ( function ( module , exports , _ _webpack _require _ _ ) {
_ _webpack _require _ _ ( 103 ) ( _ _webpack _require _ _ ( 104 ) )
/***/ } ) ,
/***/ 103 :
/***/ ( function ( module , exports ) {
/ *
MIT License http : //www.opensource.org/licenses/mit-license.php
Author Tobias Koppers @ sokra
* /
module . exports = function ( src ) {
function log ( error ) {
( typeof console !== "undefined" )
&& ( console . error || console . log ) ( "[Script Loader]" , error ) ;
}
// Check for IE =< 8
function isIE ( ) {
return typeof attachEvent !== "undefined" && typeof addEventListener === "undefined" ;
}
try {
if ( typeof execScript !== "undefined" && isIE ( ) ) {
execScript ( src ) ;
} else if ( typeof eval !== "undefined" ) {
eval . call ( null , src ) ;
} else {
log ( "EvalError: No eval function available" ) ;
}
} catch ( error ) {
log ( error ) ;
}
}
/***/ } ) ,
/***/ 104 :
/***/ ( function ( module , exports ) {
module . exports = "/**\r\n * @license\r\n * Lodash (Custom Build) <https://lodash.com/>\r\n * Build: `lodash core plus=\"debounce,throttle,get,set,findIndex,findLastIndex,findKey,findLastKey,isArrayLike,invert,invertBy,uniq,uniqBy,omit,omitBy,zip,unzip,rest,range,random,reject,intersection,drop,countBy,union,zipObject,initial,cloneDeep,clamp,isPlainObject,take,takeRight,without,difference,defaultsDeep,trim,merge,groupBy,uniqBy,before,after\" ` \r \n * Copyright JS Foundation and other contributors <https://js.foundation/> \r \n * Released under MIT license <https://lodash.com/license> \r \n * Based on Underscore.js 1.8.3 <http://underscorejs.org/LICENSE> \r \n * Copyright Jeremy Ashkenas, DocumentCloud and Investigative Reporters & Editors \r \n */ \r \n ;(function() { \r \n \r \n /** Used as a safe reference for ` undefined ` in pre-ES5 environments. */ \r \n var undefined; \r \n \r \n /** Used as the semantic version number. */ \r \n var VERSION = '4.17.5'; \r \n \r \n /** Used as the size to enable large array optimizations. */ \r \n var LARGE_ARRAY_SIZE = 200; \r \n \r \n /** Error message constants. */ \r \n var FUNC_ERROR_TEXT = 'Expected a function'; \r \n \r \n /** Used to stand-in for ` undefined ` hash values. */ \r \n var HASH_UNDEFINED = '__lodash_hash_undefined__'; \r \n \r \n /** Used as the maximum memoize cache size. */ \r \n var MAX_MEMOIZE_SIZE = 500; \r \n \r \n /** Used as the internal argument placeholder. */ \r \n var PLACEHOLDER = '__lodash_placeholder__'; \r \n \r \n /** Used to compose bitmasks for cloning. */ \r \n var CLONE_DEEP_FLAG = 1, \r \n CLONE_FLAT_FLAG = 2, \r \n CLONE_SYMBOLS_FLAG = 4; \r \n \r \n /** Used to compose bitmasks for value comparisons. */ \r \n var COMPARE_PARTIAL_FLAG = 1, \r \n COMPARE_UNORDERED_FLAG = 2; \r \n \r \n /** Used to compose bitmasks for function metadata. */ \r \n var WRAP_BIND_FLAG = 1, \r \n WRAP_BIND_KEY_FLAG = 2, \r \n WRAP_CURRY_BOUND_FLAG = 4, \r \n WRAP_CURRY_FLAG = 8, \r \n WRAP_CURRY_RIGHT_FLAG = 16, \r \n WRAP_PARTIAL_FLAG = 32, \r \n WRAP_PARTIAL_RIGHT_FLAG = 64, \r \n WRAP_ARY_FLAG = 128, \r \n WRAP_REARG_FLAG = 256, \r \n WRAP_FLIP_FLAG = 512; \r \n \r \n /** Used to detect hot functions by number of calls within a span of milliseconds. */ \r \n var HOT_COUNT = 800, \r \n HOT_SPAN = 16; \r \n \r \n /** Used to indicate the type of lazy iteratees. */ \r \n var LAZY_FILTER_FLAG = 1, \r \n LAZY_MAP_FLAG = 2, \r \n LAZY_WHILE_FLAG = 3; \r \n \r \n /** Used as references for various ` Number ` constants. */ \r \n var INFINITY = 1 / 0, \r \n MAX_SAFE_INTEGER = 9007199254740991, \r \n MAX_INTEGER = 1.7976931348623157e+308, \r \n NAN = 0 / 0; \r \n \r \n /** Used as references for the maximum length and index of an array. */ \r \n var MAX_ARRAY_LENGTH = 4294967295; \r \n \r \n /** Used to associate wrap methods with their bit flags. */ \r \n var wrapFlags = [ \r \n ['ary', WRAP_ARY_FLAG], \r \n ['bind', WRAP_BIND_FLAG], \r \n ['bindKey', WRAP_BIND_KEY_FLAG], \r \n ['curry', WRAP_CURRY_FLAG], \r \n ['curryRight', WRAP_CURRY_RIGHT_FLAG], \r \n ['flip', WRAP_FLIP_FLAG], \r \n ['partial', WRAP_PARTIAL_FLAG], \r \n ['partialRight', WRAP_PARTIAL_RIGHT_FLAG], \r \n ['rearg', WRAP_REARG_FLAG] \r \n ]; \r \n \r \n /** ` Object # toString ` result references. */ \r \n var argsTag = '[object Arguments]', \r \n arrayTag = '[object Array]', \r \n asyncTag = '[object AsyncFunction]', \r \n boolTag = '[object Boolean]', \r \n dateTag = '[object Date]', \r \n errorTag = '[object Error]', \r \n funcTag = '[object Function]', \r \n genTag = '[object GeneratorFunction]', \r \n mapTag = '[object Map]', \r \n numberTag = '[object Number]', \r \n nullTag = '[object Null]', \r \n objectTag = '[object Object]', \r \n promiseTag = '[object Promise]', \r \n proxyTag = '[object Proxy]', \r \n regexpTag = '[object RegExp]', \r \n setTag = '[object Set]', \r \n stringTag = '[object String]', \r \n symbolTag = '[object Symbol]', \r \n undefinedTag = '[object Undefined]', \r \n weakMapTag = '[object WeakMap]'; \r \n \r \n var arrayBufferTag = '[object Arra
/***/ } ) ,
/***/ 105 :
/***/ ( function ( module , exports , _ _webpack _require _ _ ) {
/* WEBPACK VAR INJECTION */ ( function ( global , setImmediate ) { / * *
* 基本函数
* Create By GUY 2014 \ 11 \ 17
*
* /
_global = undefined ;
if ( typeof window !== "undefined" ) {
_global = window ;
} else if ( typeof global !== "undefined" ) {
_global = global ;
} else if ( typeof self !== "undefined" ) {
_global = self ;
} else {
_global = this ;
}
if ( ! _global . BI ) {
_global . BI = { } ;
}
! ( function ( undefined ) {
var traverse = function ( func , context ) {
return function ( value , key , obj ) {
return func . call ( context , key , value , obj ) ;
} ;
} ;
var _apply = function ( name ) {
return function ( ) {
return _ [ name ] . apply ( _ , arguments ) ;
} ;
} ;
var _applyFunc = function ( name ) {
return function ( ) {
var args = Array . prototype . slice . call ( arguments , 0 ) ;
args [ 1 ] = _ . isFunction ( args [ 1 ] ) ? traverse ( args [ 1 ] , args [ 2 ] ) : args [ 1 ] ;
return _ [ name ] . apply ( _ , args ) ;
} ;
} ;
// Utility
_ . extend ( BI , {
assert : function ( v , is ) {
if ( this . isFunction ( is ) ) {
if ( ! is ( v ) ) {
throw new Error ( v + " error" ) ;
} else {
return true ;
}
}
if ( ! this . isArray ( is ) ) {
is = [ is ] ;
}
if ( ! this . deepContains ( is , v ) ) {
throw new Error ( v + " error" ) ;
}
return true ;
} ,
warn : function ( message ) {
console . warn ( message ) ;
} ,
UUID : function ( ) {
var f = [ "0" , "1" , "2" , "3" , "4" , "5" , "6" , "7" , "8" , "9" , "a" , "b" , "c" , "d" , "e" , "f" ] ;
var str = "" ;
for ( var i = 0 ; i < 16 ; i ++ ) {
var r = parseInt ( f . length * Math . random ( ) , 10 ) ;
str += f [ r ] ;
}
return str ;
} ,
isWidget : function ( widget ) {
return widget instanceof BI . Widget || ( BI . View && widget instanceof BI . View ) ;
} ,
createWidgets : function ( items , options , context ) {
if ( ! BI . isArray ( items ) ) {
throw new Error ( "cannot create Widgets" ) ;
}
if ( BI . isWidget ( options ) ) {
context = options ;
options = { } ;
} else {
options || ( options = { } ) ;
}
return BI . map ( BI . flatten ( items ) , function ( i , item ) {
return BI . createWidget ( item , BI . deepClone ( options ) ) ;
} ) ;
} ,
createItems : function ( data , innerAttr , outerAttr ) {
innerAttr = BI . isArray ( innerAttr ) ? innerAttr : BI . makeArray ( BI . flatten ( data ) . length , innerAttr || { } ) ;
outerAttr = BI . isArray ( outerAttr ) ? outerAttr : BI . makeArray ( BI . flatten ( data ) . length , outerAttr || { } ) ;
return BI . map ( data , function ( i , item ) {
if ( BI . isArray ( item ) ) {
return BI . createItems ( item , innerAttr , outerAttr ) ;
}
if ( item instanceof BI . Widget ) {
return BI . extend ( { } , innerAttr . shift ( ) , outerAttr . shift ( ) , {
type : null ,
el : item
} ) ;
}
if ( innerAttr [ 0 ] instanceof BI . Widget ) {
outerAttr . shift ( ) ;
return BI . extend ( { } , item , {
el : innerAttr . shift ( )
} ) ;
}
if ( item . el instanceof BI . Widget || ( BI . View && item . el instanceof BI . View ) ) {
innerAttr . shift ( ) ;
return BI . extend ( { } , outerAttr . shift ( ) , { type : null } , item ) ;
}
if ( item . el ) {
return BI . extend ( { } , outerAttr . shift ( ) , item , {
el : BI . extend ( { } , innerAttr . shift ( ) , item . el )
} ) ;
}
return BI . extend ( { } , outerAttr . shift ( ) , {
el : BI . extend ( { } , innerAttr . shift ( ) , item )
} ) ;
} ) ;
} ,
// 用容器包装items
packageItems : function ( items , layouts ) {
for ( var i = layouts . length - 1 ; i >= 0 ; i -- ) {
items = BI . map ( items , function ( k , it ) {
return BI . extend ( { } , layouts [ i ] , {
items : [
BI . extend ( { } , layouts [ i ] . el , {
el : it
} )
]
} ) ;
} ) ;
}
return items ;
} ,
formatEL : function ( obj ) {
if ( obj && ! obj . type && obj . el ) {
return obj ;
}
return {
el : obj
} ;
} ,
// 剥开EL
stripEL : function ( obj ) {
return obj . type && obj || obj . el || obj ;
} ,
trans2Element : function ( widgets ) {
return BI . map ( widgets , function ( i , wi ) {
return wi . element ;
} ) ;
}
} ) ;
// 集合相关方法
_ . each ( [ "where" , "findWhere" , "invoke" , "pluck" , "shuffle" , "sample" , "toArray" , "size" ] , function ( name ) {
BI [ name ] = _apply ( name ) ;
} ) ;
_ . each ( [ "get" , "set" , "each" , "map" , "reduce" , "reduceRight" , "find" , "filter" , "reject" , "every" , "all" , "some" , "any" , "max" , "min" ,
"sortBy" , "groupBy" , "indexBy" , "countBy" , "partition" , "clamp" ] , function ( name ) {
if ( name === "any" ) {
BI [ name ] = _applyFunc ( "some" ) ;
} else {
BI [ name ] = _applyFunc ( name ) ;
}
} ) ;
_ . extend ( BI , {
// 数数
count : function ( from , to , predicate ) {
var t ;
if ( predicate ) {
for ( t = from ; t < to ; t ++ ) {
predicate ( t ) ;
}
}
return to - from ;
} ,
// 倒数
inverse : function ( from , to , predicate ) {
return BI . count ( to , from , predicate ) ;
} ,
firstKey : function ( obj ) {
var res = undefined ;
BI . any ( obj , function ( key , value ) {
res = key ;
return true ;
} ) ;
return res ;
} ,
lastKey : function ( obj ) {
var res = undefined ;
BI . each ( obj , function ( key , value ) {
res = key ;
return true ;
} ) ;
return res ;
} ,
firstObject : function ( obj ) {
var res = undefined ;
BI . any ( obj , function ( key , value ) {
res = value ;
return true ;
} ) ;
return res ;
} ,
lastObject : function ( obj ) {
var res = undefined ;
BI . each ( obj , function ( key , value ) {
res = value ;
return true ;
} ) ;
return res ;
} ,
concat : function ( obj1 , obj2 ) {
if ( BI . isKey ( obj1 ) ) {
return BI . map ( [ ] . slice . apply ( arguments ) , function ( idx , v ) {
return v ;
} ) . join ( "" ) ;
}
if ( BI . isArray ( obj1 ) ) {
return _ . concat . apply ( [ ] , arguments ) ;
}
if ( BI . isObject ( obj1 ) ) {
return _ . extend . apply ( { } , arguments ) ;
}
} ,
backEach : function ( obj , predicate , context ) {
predicate = BI . iteratee ( predicate , context ) ;
for ( var index = obj . length - 1 ; index >= 0 ; index -- ) {
predicate ( index , obj [ index ] , obj ) ;
}
return false ;
} ,
backAny : function ( obj , predicate , context ) {
predicate = BI . iteratee ( predicate , context ) ;
for ( var index = obj . length - 1 ; index >= 0 ; index -- ) {
if ( predicate ( index , obj [ index ] , obj ) ) {
return true ;
}
}
return false ;
} ,
backEvery : function ( obj , predicate , context ) {
predicate = BI . iteratee ( predicate , context ) ;
for ( var index = obj . length - 1 ; index >= 0 ; index -- ) {
if ( ! predicate ( index , obj [ index ] , obj ) ) {
return false ;
}
}
return true ;
} ,
backFindKey : function ( obj , predicate , context ) {
predicate = BI . iteratee ( predicate , context ) ;
var keys = _ . keys ( obj ) , key ;
for ( var i = keys . length - 1 ; i >= 0 ; i -- ) {
key = keys [ i ] ;
if ( predicate ( obj [ key ] , key , obj ) ) {
return key ;
}
}
} ,
backFind : function ( obj , predicate , context ) {
var key ;
if ( BI . isArray ( obj ) ) {
key = BI . findLastIndex ( obj , predicate , context ) ;
} else {
key = BI . backFindKey ( obj , predicate , context ) ;
}
if ( key !== void 0 && key !== - 1 ) {
return obj [ key ] ;
}
} ,
remove : function ( obj , target , context ) {
var isFunction = BI . isFunction ( target ) ;
target = isFunction || BI . isArray ( target ) ? target : [ target ] ;
var i ;
if ( BI . isArray ( obj ) ) {
for ( i = 0 ; i < obj . length ; i ++ ) {
if ( ( isFunction && target . apply ( context , [ i , obj [ i ] ] ) === true ) || ( ! isFunction && BI . contains ( target , obj [ i ] ) ) ) {
obj . splice ( i -- , 1 ) ;
}
}
} else {
BI . each ( obj , function ( i , v ) {
if ( ( isFunction && target . apply ( context , [ i , obj [ i ] ] ) === true ) || ( ! isFunction && BI . contains ( target , obj [ i ] ) ) ) {
delete obj [ i ] ;
}
} ) ;
}
} ,
removeAt : function ( obj , index ) {
index = BI . isArray ( index ) ? index : [ index ] ;
var isArray = BI . isArray ( obj ) , i ;
for ( i = 0 ; i < index . length ; i ++ ) {
if ( isArray ) {
obj [ index [ i ] ] = "$deleteIndex" ;
} else {
delete obj [ index [ i ] ] ;
}
}
if ( isArray ) {
BI . remove ( obj , "$deleteIndex" ) ;
}
} ,
string2Array : function ( str ) {
return str . split ( "&-&" ) ;
} ,
array2String : function ( array ) {
return array . join ( "&-&" ) ;
} ,
abc2Int : function ( str ) {
var idx = 0 , start = "A" , str = str . toUpperCase ( ) ;
for ( var i = 0 , len = str . length ; i < len ; ++ i ) {
idx = str . charAt ( i ) . charCodeAt ( 0 ) - start . charCodeAt ( 0 ) + 26 * idx + 1 ;
if ( idx > ( 2147483646 - str . charAt ( i ) . charCodeAt ( 0 ) + start . charCodeAt ( 0 ) ) / 26 ) {
return 0 ;
}
}
return idx ;
} ,
int2Abc : function ( num ) {
var DIGITS = [ "A" , "B" , "C" , "D" , "E" , "F" , "G" , "H" , "I" , "J" , "K" , "L" , "M" , "N" , "O" , "P" , "Q" , "R" , "S" , "T" , "U" , "V" , "W" , "X" , "Y" , "Z" ] ;
var idx = num , str = "" ;
if ( num === 0 ) {
return "" ;
}
while ( idx !== 0 ) {
var t = idx % 26 ;
if ( t === 0 ) {
t = 26 ;
}
str = DIGITS [ t - 1 ] + str ;
idx = ( idx - t ) / 26 ;
}
return str ;
}
} ) ;
// 数组相关的方法
_ . each ( [ "first" , "initial" , "last" , "rest" , "compact" , "flatten" , "without" , "union" , "intersection" ,
"difference" , "zip" , "unzip" , "object" , "indexOf" , "lastIndexOf" , "sortedIndex" , "range" , "take" , "takeRight" , "uniqBy" ] , function ( name ) {
BI [ name ] = _apply ( name ) ;
} ) ;
_ . each ( [ "findIndex" , "findLastIndex" ] , function ( name ) {
BI [ name ] = _applyFunc ( name ) ;
} ) ;
_ . extend ( BI , {
// 构建一个长度为length的数组
makeArray : function ( length , value ) {
var res = [ ] ;
for ( var i = 0 ; i < length ; i ++ ) {
if ( BI . isNull ( value ) ) {
res . push ( i ) ;
} else {
res . push ( BI . deepClone ( value ) ) ;
}
}
return res ;
} ,
makeObject : function ( array , value ) {
var map = { } ;
for ( var i = 0 ; i < array . length ; i ++ ) {
if ( BI . isNull ( value ) ) {
map [ array [ i ] ] = array [ i ] ;
} else if ( BI . isFunction ( value ) ) {
map [ array [ i ] ] = value ( i , array [ i ] ) ;
} else {
map [ array [ i ] ] = BI . deepClone ( value ) ;
}
}
return map ;
} ,
makeArrayByArray : function ( array , value ) {
var res = [ ] ;
if ( ! array ) {
return res ;
}
for ( var i = 0 , len = array . length ; i < len ; i ++ ) {
if ( BI . isArray ( array [ i ] ) ) {
res . push ( arguments . callee ( array [ i ] , value ) ) ;
} else {
res . push ( BI . deepClone ( value ) ) ;
}
}
return res ;
} ,
uniq : function ( array , isSorted , iteratee , context ) {
if ( array == null ) {
return [ ] ;
}
if ( ! _ . isBoolean ( isSorted ) ) {
context = iteratee ;
iteratee = isSorted ;
isSorted = false ;
}
iteratee && ( iteratee = traverse ( iteratee , context ) ) ;
return _ . uniq . call ( _ , array , isSorted , iteratee , context ) ;
}
} ) ;
// 对象相关方法
_ . each ( [ "keys" , "allKeys" , "values" , "pairs" , "invert" , "create" , "functions" , "extend" , "extendOwn" ,
"defaults" , "clone" , "property" , "propertyOf" , "matcher" , "isEqual" , "isMatch" , "isEmpty" ,
"isElement" , "isNumber" , "isString" , "isArray" , "isObject" , "isPlainObject" , "isArguments" , "isFunction" , "isFinite" ,
"isBoolean" , "isDate" , "isRegExp" , "isError" , "isNaN" , "isUndefined" , "zipObject" , "cloneDeep" ] , function ( name ) {
BI [ name ] = _apply ( name ) ;
} ) ;
_ . each ( [ "mapObject" , "findKey" , "pick" , "omit" , "tap" ] , function ( name ) {
BI [ name ] = _applyFunc ( name ) ;
} ) ;
_ . extend ( BI , {
inherit : function ( sb , sp , overrides ) {
if ( typeof sp === "object" ) {
overrides = sp ;
sp = sb ;
sb = function ( ) {
return sp . apply ( this , arguments ) ;
} ;
}
var F = function ( ) {
} , spp = sp . prototype ;
F . prototype = spp ;
sb . prototype = new F ( ) ;
sb . superclass = spp ;
_ . extend ( sb . prototype , overrides , {
superclass : sp
} ) ;
return sb ;
} ,
init : function ( ) {
// 先把准备环境准备好
while ( BI . prepares && BI . prepares . length > 0 ) {
BI . prepares . shift ( ) ( ) ;
}
while ( _global . _ _ _fineuiExposedFunction && _global . _ _ _fineuiExposedFunction . length > 0 ) {
_global . _ _ _fineuiExposedFunction . shift ( ) ( ) ;
}
BI . initialized = true ;
} ,
has : function ( obj , keys ) {
if ( BI . isArray ( keys ) ) {
if ( keys . length === 0 ) {
return false ;
}
return BI . every ( keys , function ( i , key ) {
return _ . has ( obj , key ) ;
} ) ;
}
return _ . has . apply ( _ , arguments ) ;
} ,
freeze : function ( value ) {
// 在ES5中，如果这个方法的参数不是一个对象（一个原始值），那么它会导致 TypeError
// 在ES2015中，非对象参数将被视为要被冻结的普通对象，并被简单地返回
if ( Object . freeze && BI . isObject ( value ) ) {
return Object . freeze ( value ) ;
}
return value ;
} ,
// 数字和字符串可以作为key
isKey : function ( key ) {
return BI . isNumber ( key ) || ( BI . isString ( key ) && key . length > 0 ) ;
} ,
// 忽略大小写的等于
isCapitalEqual : function ( a , b ) {
a = BI . isNull ( a ) ? a : ( "" + a ) . toLowerCase ( ) ;
b = BI . isNull ( b ) ? b : ( "" + b ) . toLowerCase ( ) ;
return BI . isEqual ( a , b ) ;
} ,
isWidthOrHeight : function ( w ) {
if ( typeof w === "number" ) {
return w >= 0 ;
} else if ( typeof w === "string" ) {
return /^\d{1,3}%$/ . exec ( w ) || w == "auto" || /^\d+px$/ . exec ( w ) ;
}
} ,
isNotNull : function ( obj ) {
return ! BI . isNull ( obj ) ;
} ,
isNull : function ( obj ) {
return typeof obj === "undefined" || obj === null ;
} ,
isEmptyArray : function ( arr ) {
return BI . isArray ( arr ) && BI . isEmpty ( arr ) ;
} ,
isNotEmptyArray : function ( arr ) {
return BI . isArray ( arr ) && ! BI . isEmpty ( arr ) ;
} ,
isEmptyObject : function ( obj ) {
return BI . isEqual ( obj , { } ) ;
} ,
isNotEmptyObject : function ( obj ) {
return BI . isPlainObject ( obj ) && ! BI . isEmptyObject ( obj ) ;
} ,
isEmptyString : function ( obj ) {
return BI . isString ( obj ) && obj . length === 0 ;
} ,
isNotEmptyString : function ( obj ) {
return BI . isString ( obj ) && ! BI . isEmptyString ( obj ) ;
} ,
isWindow : function ( obj ) {
return obj != null && obj == obj . window ;
}
} ) ;
// deep方法
_ . extend ( BI , {
deepClone : _ . cloneDeep ,
deepExtend : _ . merge ,
isDeepMatch : function ( object , attrs ) {
var keys = BI . keys ( attrs ) , length = keys . length ;
if ( object == null ) {
return ! length ;
}
var obj = Object ( object ) ;
for ( var i = 0 ; i < length ; i ++ ) {
var key = keys [ i ] ;
if ( ! BI . isEqual ( attrs [ key ] , obj [ key ] ) || ! ( key in obj ) ) {
return false ;
}
}
return true ;
} ,
contains : function ( obj , target , fromIndex ) {
if ( ! _ . isArrayLike ( obj ) ) obj = _ . values ( obj ) ;
return _ . indexOf ( obj , target , typeof fromIndex === "number" && fromIndex ) >= 0 ;
} ,
deepContains : function ( obj , copy ) {
if ( BI . isObject ( copy ) ) {
return BI . any ( obj , function ( i , v ) {
if ( BI . isEqual ( v , copy ) ) {
return true ;
}
} ) ;
}
return BI . contains ( obj , copy ) ;
} ,
deepIndexOf : function ( obj , target ) {
for ( var i = 0 ; i < obj . length ; i ++ ) {
if ( BI . isEqual ( target , obj [ i ] ) ) {
return i ;
}
}
return - 1 ;
} ,
deepRemove : function ( obj , target ) {
var done = false ;
var i ;
if ( BI . isArray ( obj ) ) {
for ( i = 0 ; i < obj . length ; i ++ ) {
if ( BI . isEqual ( target , obj [ i ] ) ) {
obj . splice ( i -- , 1 ) ;
done = true ;
}
}
} else {
BI . each ( obj , function ( i , v ) {
if ( BI . isEqual ( target , obj [ i ] ) ) {
delete obj [ i ] ;
done = true ;
}
} ) ;
}
return done ;
} ,
deepWithout : function ( obj , target ) {
if ( BI . isArray ( obj ) ) {
var result = [ ] ;
for ( var i = 0 ; i < obj . length ; i ++ ) {
if ( ! BI . isEqual ( target , obj [ i ] ) ) {
result . push ( obj [ i ] ) ;
}
}
return result ;
}
var result = { } ;
BI . each ( obj , function ( i , v ) {
if ( ! BI . isEqual ( target , obj [ i ] ) ) {
result [ i ] = v ;
}
} ) ;
return result ;
} ,
deepUnique : function ( array ) {
var result = [ ] ;
BI . each ( array , function ( i , item ) {
if ( ! BI . deepContains ( result , item ) ) {
result . push ( item ) ;
}
} ) ;
return result ;
} ,
// 比较两个对象得出不一样的key值
deepDiff : function ( object , other ) {
object || ( object = { } ) ;
other || ( other = { } ) ;
var result = [ ] ;
var used = [ ] ;
for ( var b in object ) {
if ( this . has ( object , b ) ) {
if ( ! this . isEqual ( object [ b ] , other [ b ] ) ) {
result . push ( b ) ;
}
used . push ( b ) ;
}
}
for ( var b in other ) {
if ( this . has ( other , b ) && ! BI . contains ( used , b ) ) {
result . push ( b ) ;
}
}
return result ;
}
} ) ;
// 通用方法
_ . each ( [ "uniqueId" , "result" , "chain" , "iteratee" , "escape" , "unescape" , "before" , "after" ] , function ( name ) {
BI [ name ] = function ( ) {
return _ [ name ] . apply ( _ , arguments ) ;
} ;
} ) ;
// 事件相关方法
_ . each ( [ "bind" , "once" , "partial" , "debounce" , "throttle" , "delay" , "defer" , "wrap" ] , function ( name ) {
BI [ name ] = function ( ) {
return _ [ name ] . apply ( _ , arguments ) ;
} ;
} ) ;
_ . extend ( BI , {
nextTick : ( function ( ) {
var callbacks = [ ] ;
var pending = false ;
var timerFunc = void 0 ;
function nextTickHandler ( ) {
pending = false ;
var copies = callbacks . slice ( 0 ) ;
callbacks . length = 0 ;
for ( var i = 0 ; i < copies . length ; i ++ ) {
copies [ i ] ( ) ;
}
}
if ( typeof Promise !== "undefined" ) {
var p = Promise . resolve ( ) ;
timerFunc = function timerFunc ( ) {
p . then ( nextTickHandler ) ;
} ;
} else if ( typeof MutationObserver !== "undefined" ) {
var counter = 1 ;
var observer = new MutationObserver ( nextTickHandler ) ;
var textNode = document . createTextNode ( String ( counter ) ) ;
observer . observe ( textNode , {
characterData : true
} ) ;
timerFunc = function timerFunc ( ) {
counter = ( counter + 1 ) % 2 ;
textNode . data = String ( counter ) ;
} ;
} else if ( typeof setImmediate !== "undefined" ) {
timerFunc = function timerFunc ( ) {
setImmediate ( nextTickHandler ) ;
} ;
} else {
// Fallback to setTimeout.
timerFunc = function timerFunc ( ) {
setTimeout ( nextTickHandler , 0 ) ;
} ;
}
return function queueNextTick ( cb ) {
var _resolve = void 0 ;
var args = [ ] . slice . call ( arguments , 1 ) ;
callbacks . push ( function ( ) {
if ( cb ) {
try {
cb . apply ( null , args ) ;
} catch ( e ) {
console . error ( e ) ;
}
} else if ( _resolve ) {
_resolve . apply ( null , args ) ;
}
} ) ;
if ( ! pending ) {
pending = true ;
timerFunc ( ) ;
}
// $flow-disable-line
if ( ! cb && typeof Promise !== 'undefined' ) {
return new Promise ( function ( resolve , reject ) {
_resolve = resolve ;
} ) ;
}
} ;
} ) ( )
} ) ;
// 数字相关方法
_ . each ( [ "random" ] , function ( name ) {
BI [ name ] = _apply ( name ) ;
} ) ;
_ . extend ( BI , {
getTime : function ( ) {
if ( _global . performance && _global . performance . now ) {
return _global . performance . now ( ) ;
}
if ( _global . performance && _global . performance . webkitNow ) {
return _global . performance . webkitNow ( ) ;
}
if ( Date . now ) {
return Date . now ( ) ;
}
return BI . getDate ( ) . getTime ( ) ;
} ,
parseInt : function ( number ) {
var radix = 10 ;
if ( /^0x/g . test ( number ) ) {
radix = 16 ;
}
try {
return parseInt ( number , radix ) ;
} catch ( e ) {
throw new Error ( number + "parse int error" ) ;
return NaN ;
}
} ,
parseSafeInt : function ( value ) {
var MAX _SAFE _INTEGER = 9007199254740991 ;
return value
? this . clamp ( this . parseInt ( value ) , - MAX _SAFE _INTEGER , MAX _SAFE _INTEGER )
: ( value === 0 ? value : 0 ) ;
} ,
parseFloat : function ( number ) {
try {
return parseFloat ( number ) ;
} catch ( e ) {
throw new Error ( number + "parse float error" ) ;
return NaN ;
}
} ,
isNaturalNumber : function ( number ) {
if ( /^\d+$/ . test ( number ) ) {
return true ;
}
return false ;
} ,
isPositiveInteger : function ( number ) {
if ( /^\+?[1-9][0-9]*$/ . test ( number ) ) {
return true ;
}
return false ;
} ,
isNegativeInteger : function ( number ) {
if ( /^\-[1-9][0-9]*$/ . test ( number ) ) {
return true ;
}
return false ;
} ,
isInteger : function ( number ) {
if ( /^\-?\d+$/ . test ( number ) ) {
return true ;
}
return false ;
} ,
isNumeric : function ( number ) {
return ! isNaN ( parseFloat ( number ) ) && isFinite ( number ) ;
} ,
isFloat : function ( number ) {
if ( /^([+-]?)\d*\.\d+$/ . test ( number ) ) {
return true ;
}
return false ;
} ,
isOdd : function ( number ) {
if ( ! BI . isInteger ( number ) ) {
return false ;
}
return ( number & 1 ) === 1 ;
} ,
isEven : function ( number ) {
if ( ! BI . isInteger ( number ) ) {
return false ;
}
return ( number & 1 ) === 0 ;
} ,
sum : function ( array , iteratee , context ) {
var sum = 0 ;
BI . each ( array , function ( i , item ) {
if ( iteratee ) {
sum += Number ( iteratee . apply ( context , [ i , item ] ) ) ;
} else {
sum += Number ( item ) ;
}
} ) ;
return sum ;
} ,
average : function ( array , iteratee , context ) {
var sum = BI . sum ( array , iteratee , context ) ;
return sum / array . length ;
}
} ) ;
// 字符串相关方法
_ . extend ( BI , {
trim : function ( ) {
return _ . trim . apply ( _ , arguments ) ;
} ,
toUpperCase : function ( string ) {
return ( string + "" ) . toLocaleUpperCase ( ) ;
} ,
toLowerCase : function ( string ) {
return ( string + "" ) . toLocaleLowerCase ( ) ;
} ,
isEndWithBlank : function ( string ) {
return /(\s|\u00A0)$/ . test ( string ) ;
} ,
isLiteral : function ( exp ) {
var literalValueRE = /^\s?(true|false|-?[\d\.]+|'[^']*'|"[^"]*")\s?$/ ;
return literalValueRE . test ( exp ) ;
} ,
stripQuotes : function ( str ) {
var a = str . charCodeAt ( 0 ) ;
var b = str . charCodeAt ( str . length - 1 ) ;
return a === b && ( a === 0x22 || a === 0x27 )
? str . slice ( 1 , - 1 )
: str ;
} ,
// background-color => backgroundColor
camelize : function ( str ) {
return str . replace ( /-(.)/g , function ( _ , character ) {
return character . toUpperCase ( ) ;
} ) ;
} ,
// backgroundColor => background-color
hyphenate : function ( str ) {
return str . replace ( /([A-Z])/g , "-$1" ) . toLowerCase ( ) ;
} ,
isNotEmptyString : function ( str ) {
return BI . isString ( str ) && ! BI . isEmpty ( str ) ;
} ,
isEmptyString : function ( str ) {
return BI . isString ( str ) && BI . isEmpty ( str ) ;
} ,
/ * *
* 通用加密方法
* /
encrypt : function ( type , text , key ) {
switch ( type ) {
case BI . CRYPT _TYPE . AES :
default :
return BI . aesEncrypt ( text , key ) ;
}
} ,
/ * *
* 通用解密方法
* @ param type 解密方式
* @ param text 文本
* @ param key 种子
* @ return { * }
* /
decrypt : function ( type , text , key ) {
switch ( type ) {
case BI . CRYPT _TYPE . AES :
default :
return BI . aesDecrypt ( text , key ) ;
}
} ,
/ * *
* 对字符串中的 ' 和 \ 做编码处理
* @ static
* @ param { String } string 要做编码处理的字符串
* @ return { String } 编码后的字符串
* /
escape : function ( string ) {
return string . replace ( /('|\\)/g , "\\$1" ) ;
} ,
/ * *
* 让字符串通过指定字符做补齐的函数
*
* var s = BI . leftPad ( '123' , 5 , '0' ) ; //s的值为：'00123'
*
* @ static
* @ param { String } val 原始值
* @ param { Number } size 总共需要的位数
* @ param { String } ch 用于补齐的字符
* @ return { String } 补齐后的字符串
* /
leftPad : function ( val , size , ch ) {
var result = String ( val ) ;
if ( ! ch ) {
ch = " " ;
}
while ( result . length < size ) {
result = ch + result ;
}
return result . toString ( ) ;
} ,
/ * *
* 对字符串做替换的函数
*
* var cls = 'my-class' , text = 'Some text' ;
* var res = BI . format ( '<div class="{0}">{1}</div>' , cls , text ) ;
* //res的值为：'<div class="my-class">Some text</div>';
*
* @ static
* @ param { String } format 要做替换的字符串 ， 替换字符串1 ， 替换字符串2 ...
* @ return { String } 做了替换后的字符串
* /
format : function ( format ) {
var args = Array . prototype . slice . call ( arguments , 1 ) ;
return format . replace ( /\{(\d+)\}/g , function ( m , i ) {
return args [ i ] ;
} ) ;
}
} ) ;
// 日期相关方法
_ . extend ( BI , {
/ * *
* 是否是闰年
* @ param year
* @ returns { boolean }
* /
isLeapYear : function ( year ) {
return ( year % 4 === 0 && year % 100 !== 0 ) || year % 400 === 0 ;
} ,
/ * *
* 检测是否在有效期
*
* @ param YY 年
* @ param MM 月
* @ param DD 日
* @ param minDate '1900-01-01'
* @ param maxDate '2099-12-31'
* @ returns { Array } 若无效返回无效状态
* /
checkDateVoid : function ( YY , MM , DD , minDate , maxDate ) {
var back = [ ] ;
YY = YY | 0 ;
MM = MM | 0 ;
DD = DD | 0 ;
minDate = BI . isString ( minDate ) ? minDate . match ( /\d+/g ) : minDate ;
maxDate = BI . isString ( maxDate ) ? maxDate . match ( /\d+/g ) : maxDate ;
if ( YY < minDate [ 0 ] ) {
back = [ "y" ] ;
} else if ( YY > maxDate [ 0 ] ) {
back = [ "y" , 1 ] ;
} else if ( YY >= minDate [ 0 ] && YY <= maxDate [ 0 ] ) {
if ( YY == minDate [ 0 ] ) {
if ( MM < minDate [ 1 ] ) {
back = [ "m" ] ;
} else if ( MM == minDate [ 1 ] ) {
if ( DD < minDate [ 2 ] ) {
back = [ "d" ] ;
}
}
}
if ( YY == maxDate [ 0 ] ) {
if ( MM > maxDate [ 1 ] ) {
back = [ "m" , 1 ] ;
} else if ( MM == maxDate [ 1 ] ) {
if ( DD > maxDate [ 2 ] ) {
back = [ "d" , 1 ] ;
}
}
}
}
return back ;
} ,
checkDateLegal : function ( str ) {
var ar = str . match ( /\d+/g ) ;
var YY = ar [ 0 ] | 0 , MM = ar [ 1 ] | 0 , DD = ar [ 2 ] | 0 ;
if ( ar . length <= 1 ) {
return true ;
}
if ( ar . length <= 2 ) {
return MM >= 1 && MM <= 12 ;
}
var MD = BI . Date . _MD . slice ( 0 ) ;
MD [ 1 ] = BI . isLeapYear ( YY ) ? 29 : 28 ;
return MM >= 1 && MM <= 12 && DD <= MD [ MM - 1 ] ;
} ,
parseDateTime : function ( str , fmt ) {
var today = BI . getDate ( ) ;
var y = 0 ;
var m = 0 ;
var d = 1 ;
// wei : 对于fmt为‘YYYYMM’或者‘YYYYMMdd’的格式，str的值为类似'201111'的形式，因为年月之间没有分隔符，所以正则表达式分割无效，导致bug7376。
var a = str . split ( /\W+/ ) ;
if ( fmt . toLowerCase ( ) == "%y%x" || fmt . toLowerCase ( ) == "%y%x%d" ) {
var yearlength = 4 ;
var otherlength = 2 ;
a [ 0 ] = str . substring ( 0 , yearlength ) ;
a [ 1 ] = str . substring ( yearlength , yearlength + otherlength ) ;
a [ 2 ] = str . substring ( yearlength + otherlength , yearlength + otherlength * 2 ) ;
}
var b = fmt . match ( /%./g ) ;
var i = 0 , j = 0 ;
var hr = 0 ;
var min = 0 ;
var sec = 0 ;
for ( i = 0 ; i < a . length ; ++ i ) {
switch ( b [ i ] ) {
case "%d" :
case "%e" :
d = parseInt ( a [ i ] , 10 ) ;
break ;
case "%X" :
m = parseInt ( a [ i ] , 10 ) - 1 ;
break ;
case "%x" :
m = parseInt ( a [ i ] , 10 ) - 1 ;
break ;
case "%Y" :
case "%y" :
y = parseInt ( a [ i ] , 10 ) ;
( y < 100 ) && ( y += ( y > 29 ) ? 1900 : 2000 ) ;
break ;
case "%b" :
case "%B" :
for ( j = 0 ; j < 12 ; ++ j ) {
if ( BI . Date . _MN [ j ] . substr ( 0 , a [ i ] . length ) . toLowerCase ( ) == a [ i ] . toLowerCase ( ) ) {
m = j ;
break ;
}
}
break ;
case "%H" :
case "%I" :
case "%k" :
case "%l" :
hr = parseInt ( a [ i ] , 10 ) ;
break ;
case "%P" :
case "%p" :
if ( /pm/i . test ( a [ i ] ) && hr < 12 ) {
hr += 12 ;
} else if ( /am/i . test ( a [ i ] ) && hr >= 12 ) {
hr -= 12 ;
}
break ;
case "%M" :
min = parseInt ( a [ i ] , 10 ) ;
break ;
case "%S" :
sec = parseInt ( a [ i ] , 10 ) ;
break ;
}
}
// if (!a[i]) {
// continue;
// }
if ( isNaN ( y ) ) {
y = today . getFullYear ( ) ;
}
if ( isNaN ( m ) ) {
m = today . getMonth ( ) ;
}
if ( isNaN ( d ) ) {
d = today . getDate ( ) ;
}
if ( isNaN ( hr ) ) {
hr = today . getHours ( ) ;
}
if ( isNaN ( min ) ) {
min = today . getMinutes ( ) ;
}
if ( isNaN ( sec ) ) {
sec = today . getSeconds ( ) ;
}
if ( y != 0 ) {
return BI . getDate ( y , m , d , hr , min , sec ) ;
}
y = 0 ;
m = - 1 ;
d = 0 ;
for ( i = 0 ; i < a . length ; ++ i ) {
if ( a [ i ] . search ( /[a-zA-Z]+/ ) != - 1 ) {
var t = - 1 ;
for ( j = 0 ; j < 12 ; ++ j ) {
if ( BI . Date . _MN [ j ] . substr ( 0 , a [ i ] . length ) . toLowerCase ( ) == a [ i ] . toLowerCase ( ) ) {
t = j ;
break ;
}
}
if ( t != - 1 ) {
if ( m != - 1 ) {
d = m + 1 ;
}
m = t ;
}
} else if ( parseInt ( a [ i ] , 10 ) <= 12 && m == - 1 ) {
m = a [ i ] - 1 ;
} else if ( parseInt ( a [ i ] , 10 ) > 31 && y == 0 ) {
y = parseInt ( a [ i ] , 10 ) ;
( y < 100 ) && ( y += ( y > 29 ) ? 1900 : 2000 ) ;
} else if ( d == 0 ) {
d = a [ i ] ;
}
}
if ( y == 0 ) {
y = today . getFullYear ( ) ;
}
if ( m === - 1 ) {
m = today . getMonth ( ) ;
}
if ( m != - 1 && d != 0 ) {
return BI . getDate ( y , m , d , hr , min , sec ) ;
}
return today ;
} ,
getDate : function ( ) {
var length = arguments . length ;
var args = arguments ;
var dt ;
switch ( length ) {
// new Date()
case 0 :
dt = new Date ( ) ;
break ;
// new Date(long)
case 1 :
dt = new Date ( args [ 0 ] ) ;
break ;
// new Date(year, month)
case 2 :
dt = new Date ( args [ 0 ] , args [ 1 ] ) ;
break ;
// new Date(year, month, day)
case 3 :
dt = new Date ( args [ 0 ] , args [ 1 ] , args [ 2 ] ) ;
break ;
// new Date(year, month, day, hour)
case 4 :
dt = new Date ( args [ 0 ] , args [ 1 ] , args [ 2 ] , args [ 3 ] ) ;
break ;
// new Date(year, month, day, hour, minute)
case 5 :
dt = new Date ( args [ 0 ] , args [ 1 ] , args [ 2 ] , args [ 3 ] , args [ 4 ] ) ;
break ;
// new Date(year, month, day, hour, minute, second)
case 6 :
dt = new Date ( args [ 0 ] , args [ 1 ] , args [ 2 ] , args [ 3 ] , args [ 4 ] , args [ 5 ] ) ;
break ;
// new Date(year, month, day, hour, minute, second, millisecond)
case 7 :
dt = new Date ( args [ 0 ] , args [ 1 ] , args [ 2 ] , args [ 3 ] , args [ 4 ] , args [ 5 ] , args [ 6 ] ) ;
break ;
default :
dt = new Date ( ) ;
break ;
}
if ( BI . isNotNull ( BI . timeZone ) && ( arguments . length === 0 || ( arguments . length === 1 && BI . isNumber ( arguments [ 0 ] ) ) ) ) {
var localTime = dt . getTime ( ) ;
// BI-33791 1901年以前的东8区标准是GMT+0805, 统一无论是什么时间，都以整的0800这样的为基准
var localOffset = dt . getTimezoneOffset ( ) * 60000 ; // 获得当地时间偏移的毫秒数
var utc = localTime + localOffset ; // utc即GMT时间标准时区
return new Date ( utc + BI . timeZone ) ; // + Pool.timeZone.offset);
}
return dt ;
} ,
getTime : function ( ) {
var length = arguments . length ;
var args = arguments ;
var dt ;
switch ( length ) {
// new Date()
case 0 :
dt = new Date ( ) ;
break ;
// new Date(long)
case 1 :
dt = new Date ( args [ 0 ] ) ;
break ;
// new Date(year, month)
case 2 :
dt = new Date ( args [ 0 ] , args [ 1 ] ) ;
break ;
// new Date(year, month, day)
case 3 :
dt = new Date ( args [ 0 ] , args [ 1 ] , args [ 2 ] ) ;
break ;
// new Date(year, month, day, hour)
case 4 :
dt = new Date ( args [ 0 ] , args [ 1 ] , args [ 2 ] , args [ 3 ] ) ;
break ;
// new Date(year, month, day, hour, minute)
case 5 :
dt = new Date ( args [ 0 ] , args [ 1 ] , args [ 2 ] , args [ 3 ] , args [ 4 ] ) ;
break ;
// new Date(year, month, day, hour, minute, second)
case 6 :
dt = new Date ( args [ 0 ] , args [ 1 ] , args [ 2 ] , args [ 3 ] , args [ 4 ] , args [ 5 ] ) ;
break ;
// new Date(year, month, day, hour, minute, second, millisecond)
case 7 :
dt = new Date ( args [ 0 ] , args [ 1 ] , args [ 2 ] , args [ 3 ] , args [ 4 ] , args [ 5 ] , args [ 6 ] ) ;
break ;
default :
dt = new Date ( ) ;
break ;
}
if ( BI . isNotNull ( BI . timeZone ) ) {
// BI-33791 1901年以前的东8区标准是GMT+0805, 统一无论是什么时间，都以整的0800这样的为基准
return dt . getTime ( ) - BI . timeZone - new Date ( ) . getTimezoneOffset ( ) * 60000 ;
}
return dt . getTime ( ) ;
}
} ) ;
} ) ( ) ;
/* WEBPACK VAR INJECTION */ } . call ( this , _ _webpack _require _ _ ( 13 ) , _ _webpack _require _ _ ( 52 ) . setImmediate ) )
/***/ } ) ,
/***/ 106 :
/***/ ( function ( module , exports , _ _webpack _require _ _ ) {
"use strict" ;
/* WEBPACK VAR INJECTION */ ( function ( global , process ) {
( function ( global , undefined ) {
"use strict" ;
if ( global . setImmediate ) {
return ;
}
var nextHandle = 1 ; // Spec says greater than zero
var tasksByHandle = { } ;
var currentlyRunningATask = false ;
var doc = global . document ;
var registerImmediate ;
function setImmediate ( callback ) {
// Callback can either be a function or a string
if ( typeof callback !== "function" ) {
callback = new Function ( "" + callback ) ;
} // Copy function arguments
var args = new Array ( arguments . length - 1 ) ;
for ( var i = 0 ; i < args . length ; i ++ ) {
args [ i ] = arguments [ i + 1 ] ;
} // Store and register the task
var task = {
callback : callback ,
args : args
} ;
tasksByHandle [ nextHandle ] = task ;
registerImmediate ( nextHandle ) ;
return nextHandle ++ ;
}
function clearImmediate ( handle ) {
delete tasksByHandle [ handle ] ;
}
function run ( task ) {
var callback = task . callback ;
var args = task . args ;
switch ( args . length ) {
case 0 :
callback ( ) ;
break ;
case 1 :
callback ( args [ 0 ] ) ;
break ;
case 2 :
callback ( args [ 0 ] , args [ 1 ] ) ;
break ;
case 3 :
callback ( args [ 0 ] , args [ 1 ] , args [ 2 ] ) ;
break ;
default :
callback . apply ( undefined , args ) ;
break ;
}
}
function runIfPresent ( handle ) {
// From the spec: "Wait until any invocations of this algorithm started before this one have completed."
// So if we're currently running a task, we'll need to delay this invocation.
if ( currentlyRunningATask ) {
// Delay by doing a setTimeout. setImmediate was tried instead, but in Firefox 7 it generated a
// "too much recursion" error.
setTimeout ( runIfPresent , 0 , handle ) ;
} else {
var task = tasksByHandle [ handle ] ;
if ( task ) {
currentlyRunningATask = true ;
try {
run ( task ) ;
} finally {
clearImmediate ( handle ) ;
currentlyRunningATask = false ;
}
}
}
}
function installNextTickImplementation ( ) {
registerImmediate = function registerImmediate ( handle ) {
process . nextTick ( function ( ) {
runIfPresent ( handle ) ;
} ) ;
} ;
}
function canUsePostMessage ( ) {
// The test against `importScripts` prevents this implementation from being installed inside a web worker,
// where `global.postMessage` means something completely different and can't be used for this purpose.
if ( global . postMessage && ! global . importScripts ) {
var postMessageIsAsynchronous = true ;
var oldOnMessage = global . onmessage ;
global . onmessage = function ( ) {
postMessageIsAsynchronous = false ;
} ;
global . postMessage ( "" , "*" ) ;
global . onmessage = oldOnMessage ;
return postMessageIsAsynchronous ;
}
}
function installPostMessageImplementation ( ) {
// Installs an event handler on `global` for the `message` event: see
// * https://developer.mozilla.org/en/DOM/window.postMessage
// * http://www.whatwg.org/specs/web-apps/current-work/multipage/comms.html#crossDocumentMessages
var messagePrefix = "setImmediate$" + Math . random ( ) + "$" ;
var onGlobalMessage = function onGlobalMessage ( event ) {
if ( event . source === global && typeof event . data === "string" && event . data . indexOf ( messagePrefix ) === 0 ) {
runIfPresent ( + event . data . slice ( messagePrefix . length ) ) ;
}
} ;
if ( global . addEventListener ) {
global . addEventListener ( "message" , onGlobalMessage , false ) ;
} else {
global . attachEvent ( "onmessage" , onGlobalMessage ) ;
}
registerImmediate = function registerImmediate ( handle ) {
global . postMessage ( messagePrefix + handle , "*" ) ;
} ;
}
function installMessageChannelImplementation ( ) {
var channel = new MessageChannel ( ) ;
channel . port1 . onmessage = function ( event ) {
var handle = event . data ;
runIfPresent ( handle ) ;
} ;
registerImmediate = function registerImmediate ( handle ) {
channel . port2 . postMessage ( handle ) ;
} ;
}
function installReadyStateChangeImplementation ( ) {
var html = doc . documentElement ;
registerImmediate = function registerImmediate ( handle ) {
// Create a <script> element; its readystatechange event will be fired asynchronously once it is inserted
// into the document. Do so, thus queuing up the task. Remember to clean up once it's been called.
var script = doc . createElement ( "script" ) ;
script . onreadystatechange = function ( ) {
runIfPresent ( handle ) ;
script . onreadystatechange = null ;
html . removeChild ( script ) ;
script = null ;
} ;
html . appendChild ( script ) ;
} ;
}
function installSetTimeoutImplementation ( ) {
registerImmediate = function registerImmediate ( handle ) {
setTimeout ( runIfPresent , 0 , handle ) ;
} ;
} // If supported, we should attach to the prototype of global, since that is where setTimeout et al. live.
var attachTo = Object . getPrototypeOf && Object . getPrototypeOf ( global ) ;
attachTo = attachTo && attachTo . setTimeout ? attachTo : global ; // Don't get fooled by e.g. browserify environments.
if ( { } . toString . call ( global . process ) === "[object process]" ) {
// For Node.js before 0.9
installNextTickImplementation ( ) ;
} else if ( canUsePostMessage ( ) ) {
// For non-IE10 modern browsers
installPostMessageImplementation ( ) ;
} else if ( global . MessageChannel ) {
// For web workers, where supported
installMessageChannelImplementation ( ) ;
} else if ( doc && "onreadystatechange" in doc . createElement ( "script" ) ) {
// For IE 6–8
installReadyStateChangeImplementation ( ) ;
} else {
// For older browsers
installSetTimeoutImplementation ( ) ;
}
attachTo . setImmediate = setImmediate ;
attachTo . clearImmediate = clearImmediate ;
} ) ( typeof self === "undefined" ? typeof global === "undefined" ? void 0 : global : self ) ;
/* WEBPACK VAR INJECTION */ } . call ( this , _ _webpack _require _ _ ( 13 ) , _ _webpack _require _ _ ( 66 ) ) )
/***/ } ) ,
/***/ 107 :
/***/ ( function ( module , exports ) {
! ( function ( ) {
function extend ( ) {
var target = arguments [ 0 ] || { } , length = arguments . length , i = 1 , options , name , src , copy ;
for ( ; i < length ; i ++ ) {
// Only deal with non-null/undefined values
if ( ( options = arguments [ i ] ) != null ) {
// Extend the base object
for ( name in options ) {
src = target [ name ] ;
copy = options [ name ] ;
// Prevent never-ending loop
if ( target === copy ) {
continue ;
}
if ( copy !== undefined ) {
target [ name ] = copy ;
}
}
}
}
return target ;
}
/ * *
* 客户端观察者 ， 主要处理事件的添加 、 删除 、 执行等
* @ class BI . OB
* @ abstract
* /
var OB = function ( config ) {
this . _constructor ( config ) ;
} ;
_ . extend ( OB . prototype , {
props : { } ,
init : null ,
destroyed : null ,
_constructor : function ( config ) {
this . _initProps ( config ) ;
this . _init ( ) ;
this . _initRef ( ) ;
} ,
_defaultConfig : function ( config ) {
return { } ;
} ,
_initProps : function ( config ) {
var props = this . props ;
if ( BI . isFunction ( this . props ) ) {
props = this . props ( config ) ;
}
this . options = extend ( this . _defaultConfig ( config ) , props , config ) ;
} ,
_init : function ( ) {
this . _initListeners ( ) ;
this . init && this . init ( ) ;
} ,
_initListeners : function ( ) {
var self = this ;
if ( this . options . listeners != null ) {
_ . each ( this . options . listeners , function ( lis ) {
( lis . target ? lis . target : self ) [ lis . once ? "once" : "on" ]
( lis . eventName , _ . bind ( lis . action , self ) ) ;
} ) ;
delete this . options . listeners ;
}
} ,
// 获得一个当前对象的引用
_initRef : function ( ) {
if ( this . options . ref ) {
this . options . ref . call ( this , this ) ;
}
} ,
//释放当前对象
_purgeRef : function ( ) {
if ( this . options . ref ) {
this . options . ref . call ( null ) ;
this . options . ref = null ;
}
} ,
_getEvents : function ( ) {
if ( ! _ . isObject ( this . events ) ) {
this . events = { } ;
}
return this . events ;
} ,
/ * *
* 给观察者绑定一个事件
* @ param { String } eventName 事件的名字
* @ param { Function } fn 事件对应的执行函数
* /
on : function ( eventName , fn ) {
var self = this ;
eventName = eventName . toLowerCase ( ) ;
var fns = this . _getEvents ( ) [ eventName ] ;
if ( ! _ . isArray ( fns ) ) {
fns = [ ] ;
this . _getEvents ( ) [ eventName ] = fns ;
}
fns . push ( fn ) ;
return function ( ) {
self . un ( eventName , fn ) ;
} ;
} ,
/ * *
* 给观察者绑定一个只执行一次的事件
* @ param { String } eventName 事件的名字
* @ param { Function } fn 事件对应的执行函数
* /
once : function ( eventName , fn ) {
var proxy = function ( ) {
fn . apply ( this , arguments ) ;
this . un ( eventName , proxy ) ;
} ;
this . on ( eventName , proxy ) ;
} ,
/ * *
* 解除观察者绑定的指定事件
* @ param { String } eventName 要解除绑定事件的名字
* @ param { Function } fn 事件对应的执行函数 ， 该参数是可选的 ， 没有该参数时 ， 将解除绑定所有同名字的事件
* /
un : function ( eventName , fn ) {
eventName = eventName . toLowerCase ( ) ;
/* alex:如果fn是null,就是把eventName上面所有方法都un掉*/
if ( fn == null ) {
delete this . _getEvents ( ) [ eventName ] ;
} else {
var fns = this . _getEvents ( ) [ eventName ] ;
if ( _ . isArray ( fns ) ) {
var newFns = [ ] ;
_ . each ( fns , function ( ifn ) {
if ( ifn != fn ) {
newFns . push ( ifn ) ;
}
} ) ;
this . _getEvents ( ) [ eventName ] = newFns ;
}
}
} ,
/ * *
* 清除观察者的所有事件绑定
* /
purgeListeners : function ( ) {
/* alex:清空events*/
this . events = { } ;
} ,
/ * *
* 触发绑定过的事件
*
* @ param { String } eventName 要触发的事件的名字
* @ returns { Boolean } 如果事件函数返回false ， 则返回false并中断其他同名事件的执行 ， 否则执行所有的同名事件并返回true
* /
fireEvent : function ( ) {
var eventName = arguments [ 0 ] . toLowerCase ( ) ;
var fns = this . _getEvents ( ) [ eventName ] ;
if ( BI . isArray ( fns ) ) {
if ( BI . isArguments ( arguments [ 1 ] ) ) {
for ( var i = 0 ; i < fns . length ; i ++ ) {
if ( fns [ i ] . apply ( this , arguments [ 1 ] ) === false ) {
return false ;
}
}
} else {
var args = Array . prototype . slice . call ( arguments , 1 ) ;
for ( var i = 0 ; i < fns . length ; i ++ ) {
if ( fns [ i ] . apply ( this , args ) === false ) {
return false ;
}
}
}
}
return true ;
} ,
destroy : function ( ) {
this . destroyed && this . destroyed ( ) ;
this . _purgeRef ( ) ;
this . purgeListeners ( ) ;
}
} ) ;
BI . OB = BI . OB || OB ;
} ) ( ) ;
/***/ } ) ,
/***/ 108 :
/***/ ( function ( module , exports ) {
! ( function ( ) {
/ *
CryptoJS v3 . 1.2
code . google . com / p / crypto - js
( c ) 2009 - 2013 by Jeff Mott . All rights reserved .
code . google . com / p / crypto - js / wiki / License
* /
/ * *
* CryptoJS core components .
* /
BI . CRYPT _TYPE = BI . CRYPT _TYPE || { } ;
BI . CRYPT _TYPE . AES = "aes" ;
var CryptoJS = CryptoJS || ( function ( Math , undefined ) {
/ * *
* CryptoJS namespace .
* /
var C = { } ;
/ * *
* Library namespace .
* /
var C _lib = C . lib = { } ;
/ * *
* Base object for prototypal inheritance .
* /
var Base = C _lib . Base = ( function ( ) {
function F ( ) {
}
return {
/ * *
* Creates a new object that inherits from this object .
*
* @ param { Object } overrides Properties to copy into the new object .
*
* @ return { Object } The new object .
*
* @ static
*
* @ example
*
* var MyType = CryptoJS . lib . Base . extend ( {
* field : 'value' ,
*
* method : function ( ) {
* }
* } ) ;
* /
extend : function ( overrides ) {
// Spawn
F . prototype = this ;
var subtype = new F ( ) ;
// Augment
if ( overrides ) {
subtype . mixIn ( overrides ) ;
}
// Create default initializer
if ( ! subtype . hasOwnProperty ( 'init' ) ) {
subtype . init = function ( ) {
subtype . $super . init . apply ( this , arguments ) ;
} ;
}
// Initializer's prototype is the subtype object
subtype . init . prototype = subtype ;
// Reference supertype
subtype . $super = this ;
return subtype ;
} ,
/ * *
* Extends this object and runs the init method .
* Arguments to create ( ) will be passed to init ( ) .
*
* @ return { Object } The new object .
*
* @ static
*
* @ example
*
* var instance = MyType . create ( ) ;
* /
create : function ( ) {
var instance = this . extend ( ) ;
instance . init . apply ( instance , arguments ) ;
return instance ;
} ,
/ * *
* Initializes a newly created object .
* Override this method to add some logic when your objects are created .
*
* @ example
*
* var MyType = CryptoJS . lib . Base . extend ( {
* init : function ( ) {
* // ...
* }
* } ) ;
* /
init : function ( ) {
} ,
/ * *
* Copies properties into this object .
*
* @ param { Object } properties The properties to mix in .
*
* @ example
*
* MyType . mixIn ( {
* field : 'value'
* } ) ;
* /
mixIn : function ( properties ) {
for ( var propertyName in properties ) {
if ( properties . hasOwnProperty ( propertyName ) ) {
this [ propertyName ] = properties [ propertyName ] ;
}
}
// IE won't copy toString using the loop above
if ( properties . hasOwnProperty ( 'toString' ) ) {
this . toString = properties . toString ;
}
} ,
/ * *
* Creates a copy of this object .
*
* @ return { Object } The clone .
*
* @ example
*
* var clone = instance . clone ( ) ;
* /
clone : function ( ) {
return this . init . prototype . extend ( this ) ;
}
} ;
} ( ) ) ;
/ * *
* An array of 32 - bit words .
*
* @ property { Array } words The array of 32 - bit words .
* @ property { number } sigBytes The number of significant bytes in this word array .
* /
var WordArray = C _lib . WordArray = Base . extend ( {
/ * *
* Initializes a newly created word array .
*
* @ param { Array } words ( Optional ) An array of 32 - bit words .
* @ param { number } sigBytes ( Optional ) The number of significant bytes in the words .
*
* @ example
*
* var wordArray = CryptoJS . lib . WordArray . create ( ) ;
* var wordArray = CryptoJS . lib . WordArray . create ( [ 0x00010203 , 0x04050607 ] ) ;
* var wordArray = CryptoJS . lib . WordArray . create ( [ 0x00010203 , 0x04050607 ] , 6 ) ;
* /
init : function ( words , sigBytes ) {
words = this . words = words || [ ] ;
if ( sigBytes != undefined ) {
this . sigBytes = sigBytes ;
} else {
this . sigBytes = words . length * 4 ;
}
} ,
/ * *
* Converts this word array to a string .
*
* @ param { Encoder } encoder ( Optional ) The encoding strategy to use . Default : CryptoJS . enc . Hex
*
* @ return { string } The stringified word array .
*
* @ example
*
* var string = wordArray + '' ;
* var string = wordArray . toString ( ) ;
* var string = wordArray . toString ( CryptoJS . enc . Utf8 ) ;
* /
toString : function ( encoder ) {
return ( encoder || Hex ) . stringify ( this ) ;
} ,
/ * *
* Concatenates a word array to this word array .
*
* @ param { WordArray } wordArray The word array to append .
*
* @ return { WordArray } This word array .
*
* @ example
*
* wordArray1 . concat ( wordArray2 ) ;
* /
concat : function ( wordArray ) {
// Shortcuts
var thisWords = this . words ;
var thatWords = wordArray . words ;
var thisSigBytes = this . sigBytes ;
var thatSigBytes = wordArray . sigBytes ;
// Clamp excess bits
this . clamp ( ) ;
// Concat
if ( thisSigBytes % 4 ) {
// Copy one byte at a time
for ( var i = 0 ; i < thatSigBytes ; i ++ ) {
var thatByte = ( thatWords [ i >>> 2 ] >>> ( 24 - ( i % 4 ) * 8 ) ) & 0xff ;
thisWords [ ( thisSigBytes + i ) >>> 2 ] |= thatByte << ( 24 - ( ( thisSigBytes + i ) % 4 ) * 8 ) ;
}
} else if ( thatWords . length > 0xffff ) {
// Copy one word at a time
for ( var i = 0 ; i < thatSigBytes ; i += 4 ) {
thisWords [ ( thisSigBytes + i ) >>> 2 ] = thatWords [ i >>> 2 ] ;
}
} else {
// Copy all words at once
thisWords . push . apply ( thisWords , thatWords ) ;
}
this . sigBytes += thatSigBytes ;
// Chainable
return this ;
} ,
/ * *
* Removes insignificant bits .
*
* @ example
*
* wordArray . clamp ( ) ;
* /
clamp : function ( ) {
// Shortcuts
var words = this . words ;
var sigBytes = this . sigBytes ;
// Clamp
words [ sigBytes >>> 2 ] &= 0xffffffff << ( 32 - ( sigBytes % 4 ) * 8 ) ;
words . length = Math . ceil ( sigBytes / 4 ) ;
} ,
/ * *
* Creates a copy of this word array .
*
* @ return { WordArray } The clone .
*
* @ example
*
* var clone = wordArray . clone ( ) ;
* /
clone : function ( ) {
var clone = Base . clone . call ( this ) ;
clone . words = this . words . slice ( 0 ) ;
return clone ;
} ,
/ * *
* Creates a word array filled with random bytes .
*
* @ param { number } nBytes The number of random bytes to generate .
*
* @ return { WordArray } The random word array .
*
* @ static
*
* @ example
*
* var wordArray = CryptoJS . lib . WordArray . random ( 16 ) ;
* /
random : function ( nBytes ) {
var words = [ ] ;
for ( var i = 0 ; i < nBytes ; i += 4 ) {
words . push ( ( Math . random ( ) * 0x100000000 ) | 0 ) ;
}
return new WordArray . init ( words , nBytes ) ;
}
} ) ;
/ * *
* Encoder namespace .
* /
var C _enc = C . enc = { } ;
/ * *
* Hex encoding strategy .
* /
var Hex = C _enc . Hex = {
/ * *
* Converts a word array to a hex string .
*
* @ param { WordArray } wordArray The word array .
*
* @ return { string } The hex string .
*
* @ static
*
* @ example
*
* var hexString = CryptoJS . enc . Hex . stringify ( wordArray ) ;
* /
stringify : function ( wordArray ) {
// Shortcuts
var words = wordArray . words ;
var sigBytes = wordArray . sigBytes ;
// Convert
var hexChars = [ ] ;
for ( var i = 0 ; i < sigBytes ; i ++ ) {
var bite = ( words [ i >>> 2 ] >>> ( 24 - ( i % 4 ) * 8 ) ) & 0xff ;
hexChars . push ( ( bite >>> 4 ) . toString ( 16 ) ) ;
hexChars . push ( ( bite & 0x0f ) . toString ( 16 ) ) ;
}
return hexChars . join ( '' ) ;
} ,
/ * *
* Converts a hex string to a word array .
*
* @ param { string } hexStr The hex string .
*
* @ return { WordArray } The word array .
*
* @ static
*
* @ example
*
* var wordArray = CryptoJS . enc . Hex . parse ( hexString ) ;
* /
parse : function ( hexStr ) {
// Shortcut
var hexStrLength = hexStr . length ;
// Convert
var words = [ ] ;
for ( var i = 0 ; i < hexStrLength ; i += 2 ) {
words [ i >>> 3 ] |= parseInt ( hexStr . substr ( i , 2 ) , 16 ) << ( 24 - ( i % 8 ) * 4 ) ;
}
return new WordArray . init ( words , hexStrLength / 2 ) ;
}
} ;
/ * *
* Latin1 encoding strategy .
* /
var Latin1 = C _enc . Latin1 = {
/ * *
* Converts a word array to a Latin1 string .
*
* @ param { WordArray } wordArray The word array .
*
* @ return { string } The Latin1 string .
*
* @ static
*
* @ example
*
* var latin1String = CryptoJS . enc . Latin1 . stringify ( wordArray ) ;
* /
stringify : function ( wordArray ) {
// Shortcuts
var words = wordArray . words ;
var sigBytes = wordArray . sigBytes ;
// Convert
var latin1Chars = [ ] ;
for ( var i = 0 ; i < sigBytes ; i ++ ) {
var bite = ( words [ i >>> 2 ] >>> ( 24 - ( i % 4 ) * 8 ) ) & 0xff ;
latin1Chars . push ( String . fromCharCode ( bite ) ) ;
}
return latin1Chars . join ( '' ) ;
} ,
/ * *
* Converts a Latin1 string to a word array .
*
* @ param { string } latin1Str The Latin1 string .
*
* @ return { WordArray } The word array .
*
* @ static
*
* @ example
*
* var wordArray = CryptoJS . enc . Latin1 . parse ( latin1String ) ;
* /
parse : function ( latin1Str ) {
// Shortcut
var latin1StrLength = latin1Str . length ;
// Convert
var words = [ ] ;
for ( var i = 0 ; i < latin1StrLength ; i ++ ) {
words [ i >>> 2 ] |= ( latin1Str . charCodeAt ( i ) & 0xff ) << ( 24 - ( i % 4 ) * 8 ) ;
}
return new WordArray . init ( words , latin1StrLength ) ;
}
} ;
/ * *
* UTF - 8 encoding strategy .
* /
var Utf8 = C _enc . Utf8 = {
/ * *
* Converts a word array to a UTF - 8 string .
*
* @ param { WordArray } wordArray The word array .
*
* @ return { string } The UTF - 8 string .
*
* @ static
*
* @ example
*
* var utf8String = CryptoJS . enc . Utf8 . stringify ( wordArray ) ;
* /
stringify : function ( wordArray ) {
try {
return decodeURIComponent ( escape ( Latin1 . stringify ( wordArray ) ) ) ;
} catch ( e ) {
throw new Error ( 'Malformed UTF-8 data' ) ;
}
} ,
/ * *
* Converts a UTF - 8 string to a word array .
*
* @ param { string } utf8Str The UTF - 8 string .
*
* @ return { WordArray } The word array .
*
* @ static
*
* @ example
*
* var wordArray = CryptoJS . enc . Utf8 . parse ( utf8String ) ;
* /
parse : function ( utf8Str ) {
return Latin1 . parse ( unescape ( encodeURIComponent ( utf8Str ) ) ) ;
}
} ;
/ * *
* Abstract buffered block algorithm template .
*
* The property blockSize must be implemented in a concrete subtype .
*
* @ property { number } _minBufferSize The number of blocks that should be kept unprocessed in the buffer . Default : 0
* /
var BufferedBlockAlgorithm = C _lib . BufferedBlockAlgorithm = Base . extend ( {
/ * *
* Resets this block algorithm ' s data buffer to its initial state .
*
* @ example
*
* bufferedBlockAlgorithm . reset ( ) ;
* /
reset : function ( ) {
// Initial values
this . _data = new WordArray . init ( ) ;
this . _nDataBytes = 0 ;
} ,
/ * *
* Adds new data to this block algorithm ' s buffer .
*
* @ param { WordArray | string } data The data to append . Strings are converted to a WordArray using UTF - 8.
*
* @ example
*
* bufferedBlockAlgorithm . _append ( 'data' ) ;
* bufferedBlockAlgorithm . _append ( wordArray ) ;
* /
_append : function ( data ) {
// Convert string to WordArray, else assume WordArray already
if ( typeof data == 'string' ) {
data = Utf8 . parse ( data ) ;
}
// Append
this . _data . concat ( data ) ;
this . _nDataBytes += data . sigBytes ;
} ,
/ * *
* Processes available data blocks .
*
* This method invokes _doProcessBlock ( offset ) , which must be implemented by a concrete subtype .
*
* @ param { boolean } doFlush Whether all blocks and partial blocks should be processed .
*
* @ return { WordArray } The processed data .
*
* @ example
*
* var processedData = bufferedBlockAlgorithm . _process ( ) ;
* var processedData = bufferedBlockAlgorithm . _process ( ! ! 'flush' ) ;
* /
_process : function ( doFlush ) {
// Shortcuts
var data = this . _data ;
var dataWords = data . words ;
var dataSigBytes = data . sigBytes ;
var blockSize = this . blockSize ;
var blockSizeBytes = blockSize * 4 ;
// Count blocks ready
var nBlocksReady = dataSigBytes / blockSizeBytes ;
if ( doFlush ) {
// Round up to include partial blocks
nBlocksReady = Math . ceil ( nBlocksReady ) ;
} else {
// Round down to include only full blocks,
// less the number of blocks that must remain in the buffer
nBlocksReady = Math . max ( ( nBlocksReady | 0 ) - this . _minBufferSize , 0 ) ;
}
// Count words ready
var nWordsReady = nBlocksReady * blockSize ;
// Count bytes ready
var nBytesReady = Math . min ( nWordsReady * 4 , dataSigBytes ) ;
// Process blocks
if ( nWordsReady ) {
for ( var offset = 0 ; offset < nWordsReady ; offset += blockSize ) {
// Perform concrete-algorithm logic
this . _doProcessBlock ( dataWords , offset ) ;
}
// Remove processed words
var processedWords = dataWords . splice ( 0 , nWordsReady ) ;
data . sigBytes -= nBytesReady ;
}
// Return processed words
return new WordArray . init ( processedWords , nBytesReady ) ;
} ,
/ * *
* Creates a copy of this object .
*
* @ return { Object } The clone .
*
* @ example
*
* var clone = bufferedBlockAlgorithm . clone ( ) ;
* /
clone : function ( ) {
var clone = Base . clone . call ( this ) ;
clone . _data = this . _data . clone ( ) ;
return clone ;
} ,
_minBufferSize : 0
} ) ;
/ * *
* Abstract hasher template .
*
* @ property { number } blockSize The number of 32 - bit words this hasher operates on . Default : 16 ( 512 bits )
* /
var Hasher = C _lib . Hasher = BufferedBlockAlgorithm . extend ( {
/ * *
* Configuration options .
* /
cfg : Base . extend ( ) ,
/ * *
* Initializes a newly created hasher .
*
* @ param { Object } cfg ( Optional ) The configuration options to use for this hash computation .
*
* @ example
*
* var hasher = CryptoJS . algo . SHA256 . create ( ) ;
* /
init : function ( cfg ) {
// Apply config defaults
this . cfg = this . cfg . extend ( cfg ) ;
// Set initial values
this . reset ( ) ;
} ,
/ * *
* Resets this hasher to its initial state .
*
* @ example
*
* hasher . reset ( ) ;
* /
reset : function ( ) {
// Reset data buffer
BufferedBlockAlgorithm . reset . call ( this ) ;
// Perform concrete-hasher logic
this . _doReset ( ) ;
} ,
/ * *
* Updates this hasher with a message .
*
* @ param { WordArray | string } messageUpdate The message to append .
*
* @ return { Hasher } This hasher .
*
* @ example
*
* hasher . update ( 'message' ) ;
* hasher . update ( wordArray ) ;
* /
update : function ( messageUpdate ) {
// Append
this . _append ( messageUpdate ) ;
// Update the hash
this . _process ( ) ;
// Chainable
return this ;
} ,
/ * *
* Finalizes the hash computation .
* Note that the finalize operation is effectively a destructive , read - once operation .
*
* @ param { WordArray | string } messageUpdate ( Optional ) A final message update .
*
* @ return { WordArray } The hash .
*
* @ example
*
* var hash = hasher . finalize ( ) ;
* var hash = hasher . finalize ( 'message' ) ;
* var hash = hasher . finalize ( wordArray ) ;
* /
finalize : function ( messageUpdate ) {
// Final message update
if ( messageUpdate ) {
this . _append ( messageUpdate ) ;
}
// Perform concrete-hasher logic
var hash = this . _doFinalize ( ) ;
return hash ;
} ,
blockSize : 512 / 32 ,
/ * *
* Creates a shortcut function to a hasher ' s object interface .
*
* @ param { Hasher } hasher The hasher to create a helper for .
*
* @ return { Function } The shortcut function .
*
* @ static
*
* @ example
*
* var SHA256 = CryptoJS . lib . Hasher . _createHelper ( CryptoJS . algo . SHA256 ) ;
* /
_createHelper : function ( hasher ) {
return function ( message , cfg ) {
return new hasher . init ( cfg ) . finalize ( message ) ;
} ;
} ,
/ * *
* Creates a shortcut function to the HMAC ' s object interface .
*
* @ param { Hasher } hasher The hasher to use in this HMAC helper .
*
* @ return { Function } The shortcut function .
*
* @ static
*
* @ example
*
* var HmacSHA256 = CryptoJS . lib . Hasher . _createHmacHelper ( CryptoJS . algo . SHA256 ) ;
* /
_createHmacHelper : function ( hasher ) {
return function ( message , key ) {
return new C _algo . HMAC . init ( hasher , key ) . finalize ( message ) ;
} ;
}
} ) ;
/ * *
* Algorithm namespace .
* /
var C _algo = C . algo = { } ;
return C ;
} ( Math ) ) ;
/ *
CryptoJS v3 . 1.2
code . google . com / p / crypto - js
( c ) 2009 - 2013 by Jeff Mott . All rights reserved .
code . google . com / p / crypto - js / wiki / License
* /
( function ( ) {
// Shortcuts
var C = CryptoJS ;
var C _lib = C . lib ;
var WordArray = C _lib . WordArray ;
var C _enc = C . enc ;
/ * *
* Base64 encoding strategy .
* /
var Base64 = C _enc . Base64 = {
/ * *
* Converts a word array to a Base64 string .
*
* @ param { WordArray } wordArray The word array .
*
* @ return { string } The Base64 string .
*
* @ static
*
* @ example
*
* var base64String = CryptoJS . enc . Base64 . stringify ( wordArray ) ;
* /
stringify : function ( wordArray ) {
// Shortcuts
var words = wordArray . words ;
var sigBytes = wordArray . sigBytes ;
var map = this . _map ;
// Clamp excess bits
wordArray . clamp ( ) ;
// Convert
var base64Chars = [ ] ;
for ( var i = 0 ; i < sigBytes ; i += 3 ) {
var byte1 = ( words [ i >>> 2 ] >>> ( 24 - ( i % 4 ) * 8 ) ) & 0xff ;
var byte2 = ( words [ ( i + 1 ) >>> 2 ] >>> ( 24 - ( ( i + 1 ) % 4 ) * 8 ) ) & 0xff ;
var byte3 = ( words [ ( i + 2 ) >>> 2 ] >>> ( 24 - ( ( i + 2 ) % 4 ) * 8 ) ) & 0xff ;
var triplet = ( byte1 << 16 ) | ( byte2 << 8 ) | byte3 ;
for ( var j = 0 ; ( j < 4 ) && ( i + j * 0.75 < sigBytes ) ; j ++ ) {
base64Chars . push ( map . charAt ( ( triplet >>> ( 6 * ( 3 - j ) ) ) & 0x3f ) ) ;
}
}
// Add padding
var paddingChar = map . charAt ( 64 ) ;
if ( paddingChar ) {
while ( base64Chars . length % 4 ) {
base64Chars . push ( paddingChar ) ;
}
}
return base64Chars . join ( '' ) ;
} ,
/ * *
* Converts a Base64 string to a word array .
*
* @ param { string } base64Str The Base64 string .
*
* @ return { WordArray } The word array .
*
* @ static
*
* @ example
*
* var wordArray = CryptoJS . enc . Base64 . parse ( base64String ) ;
* /
parse : function ( base64Str ) {
// Shortcuts
var base64StrLength = base64Str . length ;
var map = this . _map ;
// Ignore padding
var paddingChar = map . charAt ( 64 ) ;
if ( paddingChar ) {
var paddingIndex = base64Str . indexOf ( paddingChar ) ;
if ( paddingIndex != - 1 ) {
base64StrLength = paddingIndex ;
}
}
// Convert
var words = [ ] ;
var nBytes = 0 ;
for ( var i = 0 ; i < base64StrLength ; i ++ ) {
if ( i % 4 ) {
var bits1 = map . indexOf ( base64Str . charAt ( i - 1 ) ) << ( ( i % 4 ) * 2 ) ;
var bits2 = map . indexOf ( base64Str . charAt ( i ) ) >>> ( 6 - ( i % 4 ) * 2 ) ;
words [ nBytes >>> 2 ] |= ( bits1 | bits2 ) << ( 24 - ( nBytes % 4 ) * 8 ) ;
nBytes ++ ;
}
}
return WordArray . create ( words , nBytes ) ;
} ,
_map : 'ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/='
} ;
} ( ) ) ;
/ *
CryptoJS v3 . 1.2
code . google . com / p / crypto - js
( c ) 2009 - 2013 by Jeff Mott . All rights reserved .
code . google . com / p / crypto - js / wiki / License
* /
( function ( Math ) {
// Shortcuts
var C = CryptoJS ;
var C _lib = C . lib ;
var WordArray = C _lib . WordArray ;
var Hasher = C _lib . Hasher ;
var C _algo = C . algo ;
// Constants table
var T = [ ] ;
// Compute constants
( function ( ) {
for ( var i = 0 ; i < 64 ; i ++ ) {
T [ i ] = ( Math . abs ( Math . sin ( i + 1 ) ) * 0x100000000 ) | 0 ;
}
} ( ) ) ;
/ * *
* MD5 hash algorithm .
* /
var MD5 = C _algo . MD5 = Hasher . extend ( {
_doReset : function ( ) {
this . _hash = new WordArray . init ( [
0x67452301 , 0xefcdab89 ,
0x98badcfe , 0x10325476
] ) ;
} ,
_doProcessBlock : function ( M , offset ) {
// Swap endian
for ( var i = 0 ; i < 16 ; i ++ ) {
// Shortcuts
var offset _i = offset + i ;
var M _offset _i = M [ offset _i ] ;
M [ offset _i ] = (
( ( ( M _offset _i << 8 ) | ( M _offset _i >>> 24 ) ) & 0x00ff00ff ) |
( ( ( M _offset _i << 24 ) | ( M _offset _i >>> 8 ) ) & 0xff00ff00 )
) ;
}
// Shortcuts
var H = this . _hash . words ;
var M _offset _0 = M [ offset + 0 ] ;
var M _offset _1 = M [ offset + 1 ] ;
var M _offset _2 = M [ offset + 2 ] ;
var M _offset _3 = M [ offset + 3 ] ;
var M _offset _4 = M [ offset + 4 ] ;
var M _offset _5 = M [ offset + 5 ] ;
var M _offset _6 = M [ offset + 6 ] ;
var M _offset _7 = M [ offset + 7 ] ;
var M _offset _8 = M [ offset + 8 ] ;
var M _offset _9 = M [ offset + 9 ] ;
var M _offset _10 = M [ offset + 10 ] ;
var M _offset _11 = M [ offset + 11 ] ;
var M _offset _12 = M [ offset + 12 ] ;
var M _offset _13 = M [ offset + 13 ] ;
var M _offset _14 = M [ offset + 14 ] ;
var M _offset _15 = M [ offset + 15 ] ;
// Working varialbes
var a = H [ 0 ] ;
var b = H [ 1 ] ;
var c = H [ 2 ] ;
var d = H [ 3 ] ;
// Computation
a = FF ( a , b , c , d , M _offset _0 , 7 , T [ 0 ] ) ;
d = FF ( d , a , b , c , M _offset _1 , 12 , T [ 1 ] ) ;
c = FF ( c , d , a , b , M _offset _2 , 17 , T [ 2 ] ) ;
b = FF ( b , c , d , a , M _offset _3 , 22 , T [ 3 ] ) ;
a = FF ( a , b , c , d , M _offset _4 , 7 , T [ 4 ] ) ;
d = FF ( d , a , b , c , M _offset _5 , 12 , T [ 5 ] ) ;
c = FF ( c , d , a , b , M _offset _6 , 17 , T [ 6 ] ) ;
b = FF ( b , c , d , a , M _offset _7 , 22 , T [ 7 ] ) ;
a = FF ( a , b , c , d , M _offset _8 , 7 , T [ 8 ] ) ;
d = FF ( d , a , b , c , M _offset _9 , 12 , T [ 9 ] ) ;
c = FF ( c , d , a , b , M _offset _10 , 17 , T [ 10 ] ) ;
b = FF ( b , c , d , a , M _offset _11 , 22 , T [ 11 ] ) ;
a = FF ( a , b , c , d , M _offset _12 , 7 , T [ 12 ] ) ;
d = FF ( d , a , b , c , M _offset _13 , 12 , T [ 13 ] ) ;
c = FF ( c , d , a , b , M _offset _14 , 17 , T [ 14 ] ) ;
b = FF ( b , c , d , a , M _offset _15 , 22 , T [ 15 ] ) ;
a = GG ( a , b , c , d , M _offset _1 , 5 , T [ 16 ] ) ;
d = GG ( d , a , b , c , M _offset _6 , 9 , T [ 17 ] ) ;
c = GG ( c , d , a , b , M _offset _11 , 14 , T [ 18 ] ) ;
b = GG ( b , c , d , a , M _offset _0 , 20 , T [ 19 ] ) ;
a = GG ( a , b , c , d , M _offset _5 , 5 , T [ 20 ] ) ;
d = GG ( d , a , b , c , M _offset _10 , 9 , T [ 21 ] ) ;
c = GG ( c , d , a , b , M _offset _15 , 14 , T [ 22 ] ) ;
b = GG ( b , c , d , a , M _offset _4 , 20 , T [ 23 ] ) ;
a = GG ( a , b , c , d , M _offset _9 , 5 , T [ 24 ] ) ;
d = GG ( d , a , b , c , M _offset _14 , 9 , T [ 25 ] ) ;
c = GG ( c , d , a , b , M _offset _3 , 14 , T [ 26 ] ) ;
b = GG ( b , c , d , a , M _offset _8 , 20 , T [ 27 ] ) ;
a = GG ( a , b , c , d , M _offset _13 , 5 , T [ 28 ] ) ;
d = GG ( d , a , b , c , M _offset _2 , 9 , T [ 29 ] ) ;
c = GG ( c , d , a , b , M _offset _7 , 14 , T [ 30 ] ) ;
b = GG ( b , c , d , a , M _offset _12 , 20 , T [ 31 ] ) ;
a = HH ( a , b , c , d , M _offset _5 , 4 , T [ 32 ] ) ;
d = HH ( d , a , b , c , M _offset _8 , 11 , T [ 33 ] ) ;
c = HH ( c , d , a , b , M _offset _11 , 16 , T [ 34 ] ) ;
b = HH ( b , c , d , a , M _offset _14 , 23 , T [ 35 ] ) ;
a = HH ( a , b , c , d , M _offset _1 , 4 , T [ 36 ] ) ;
d = HH ( d , a , b , c , M _offset _4 , 11 , T [ 37 ] ) ;
c = HH ( c , d , a , b , M _offset _7 , 16 , T [ 38 ] ) ;
b = HH ( b , c , d , a , M _offset _10 , 23 , T [ 39 ] ) ;
a = HH ( a , b , c , d , M _offset _13 , 4 , T [ 40 ] ) ;
d = HH ( d , a , b , c , M _offset _0 , 11 , T [ 41 ] ) ;
c = HH ( c , d , a , b , M _offset _3 , 16 , T [ 42 ] ) ;
b = HH ( b , c , d , a , M _offset _6 , 23 , T [ 43 ] ) ;
a = HH ( a , b , c , d , M _offset _9 , 4 , T [ 44 ] ) ;
d = HH ( d , a , b , c , M _offset _12 , 11 , T [ 45 ] ) ;
c = HH ( c , d , a , b , M _offset _15 , 16 , T [ 46 ] ) ;
b = HH ( b , c , d , a , M _offset _2 , 23 , T [ 47 ] ) ;
a = II ( a , b , c , d , M _offset _0 , 6 , T [ 48 ] ) ;
d = II ( d , a , b , c , M _offset _7 , 10 , T [ 49 ] ) ;
c = II ( c , d , a , b , M _offset _14 , 15 , T [ 50 ] ) ;
b = II ( b , c , d , a , M _offset _5 , 21 , T [ 51 ] ) ;
a = II ( a , b , c , d , M _offset _12 , 6 , T [ 52 ] ) ;
d = II ( d , a , b , c , M _offset _3 , 10 , T [ 53 ] ) ;
c = II ( c , d , a , b , M _offset _10 , 15 , T [ 54 ] ) ;
b = II ( b , c , d , a , M _offset _1 , 21 , T [ 55 ] ) ;
a = II ( a , b , c , d , M _offset _8 , 6 , T [ 56 ] ) ;
d = II ( d , a , b , c , M _offset _15 , 10 , T [ 57 ] ) ;
c = II ( c , d , a , b , M _offset _6 , 15 , T [ 58 ] ) ;
b = II ( b , c , d , a , M _offset _13 , 21 , T [ 59 ] ) ;
a = II ( a , b , c , d , M _offset _4 , 6 , T [ 60 ] ) ;
d = II ( d , a , b , c , M _offset _11 , 10 , T [ 61 ] ) ;
c = II ( c , d , a , b , M _offset _2 , 15 , T [ 62 ] ) ;
b = II ( b , c , d , a , M _offset _9 , 21 , T [ 63 ] ) ;
// Intermediate hash value
H [ 0 ] = ( H [ 0 ] + a ) | 0 ;
H [ 1 ] = ( H [ 1 ] + b ) | 0 ;
H [ 2 ] = ( H [ 2 ] + c ) | 0 ;
H [ 3 ] = ( H [ 3 ] + d ) | 0 ;
} ,
_doFinalize : function ( ) {
// Shortcuts
var data = this . _data ;
var dataWords = data . words ;
var nBitsTotal = this . _nDataBytes * 8 ;
var nBitsLeft = data . sigBytes * 8 ;
// Add padding
dataWords [ nBitsLeft >>> 5 ] |= 0x80 << ( 24 - nBitsLeft % 32 ) ;
var nBitsTotalH = Math . floor ( nBitsTotal / 0x100000000 ) ;
var nBitsTotalL = nBitsTotal ;
dataWords [ ( ( ( nBitsLeft + 64 ) >>> 9 ) << 4 ) + 15 ] = (
( ( ( nBitsTotalH << 8 ) | ( nBitsTotalH >>> 24 ) ) & 0x00ff00ff ) |
( ( ( nBitsTotalH << 24 ) | ( nBitsTotalH >>> 8 ) ) & 0xff00ff00 )
) ;
dataWords [ ( ( ( nBitsLeft + 64 ) >>> 9 ) << 4 ) + 14 ] = (
( ( ( nBitsTotalL << 8 ) | ( nBitsTotalL >>> 24 ) ) & 0x00ff00ff ) |
( ( ( nBitsTotalL << 24 ) | ( nBitsTotalL >>> 8 ) ) & 0xff00ff00 )
) ;
data . sigBytes = ( dataWords . length + 1 ) * 4 ;
// Hash final blocks
this . _process ( ) ;
// Shortcuts
var hash = this . _hash ;
var H = hash . words ;
// Swap endian
for ( var i = 0 ; i < 4 ; i ++ ) {
// Shortcut
var H _i = H [ i ] ;
H [ i ] = ( ( ( H _i << 8 ) | ( H _i >>> 24 ) ) & 0x00ff00ff ) |
( ( ( H _i << 24 ) | ( H _i >>> 8 ) ) & 0xff00ff00 ) ;
}
// Return final computed hash
return hash ;
} ,
clone : function ( ) {
var clone = Hasher . clone . call ( this ) ;
clone . _hash = this . _hash . clone ( ) ;
return clone ;
}
} ) ;
function FF ( a , b , c , d , x , s , t ) {
var n = a + ( ( b & c ) | ( ~ b & d ) ) + x + t ;
return ( ( n << s ) | ( n >>> ( 32 - s ) ) ) + b ;
}
function GG ( a , b , c , d , x , s , t ) {
var n = a + ( ( b & d ) | ( c & ~ d ) ) + x + t ;
return ( ( n << s ) | ( n >>> ( 32 - s ) ) ) + b ;
}
function HH ( a , b , c , d , x , s , t ) {
var n = a + ( b ^ c ^ d ) + x + t ;
return ( ( n << s ) | ( n >>> ( 32 - s ) ) ) + b ;
}
function II ( a , b , c , d , x , s , t ) {
var n = a + ( c ^ ( b | ~ d ) ) + x + t ;
return ( ( n << s ) | ( n >>> ( 32 - s ) ) ) + b ;
}
/ * *
* Shortcut function to the hasher ' s object interface .
*
* @ param { WordArray | string } message The message to hash .
*
* @ return { WordArray } The hash .
*
* @ static
*
* @ example
*
* var hash = CryptoJS . MD5 ( 'message' ) ;
* var hash = CryptoJS . MD5 ( wordArray ) ;
* /
C . MD5 = Hasher . _createHelper ( MD5 ) ;
/ * *
* Shortcut function to the HMAC ' s object interface .
*
* @ param { WordArray | string } message The message to hash .
* @ param { WordArray | string } key The secret key .
*
* @ return { WordArray } The HMAC .
*
* @ static
*
* @ example
*
* var hmac = CryptoJS . HmacMD5 ( message , key ) ;
* /
C . HmacMD5 = Hasher . _createHmacHelper ( MD5 ) ;
} ( Math ) ) ;
/ *
CryptoJS v3 . 1.2
code . google . com / p / crypto - js
( c ) 2009 - 2013 by Jeff Mott . All rights reserved .
code . google . com / p / crypto - js / wiki / License
* /
( function ( ) {
// Shortcuts
var C = CryptoJS ;
var C _lib = C . lib ;
var Base = C _lib . Base ;
var WordArray = C _lib . WordArray ;
var C _algo = C . algo ;
var MD5 = C _algo . MD5 ;
/ * *
* This key derivation function is meant to conform with EVP _BytesToKey .
* www . openssl . org / docs / crypto / EVP _BytesToKey . html
* /
var EvpKDF = C _algo . EvpKDF = Base . extend ( {
/ * *
* Configuration options .
*
* @ property { number } keySize The key size in words to generate . Default : 4 ( 128 bits )
* @ property { Hasher } hasher The hash algorithm to use . Default : MD5
* @ property { number } iterations The number of iterations to perform . Default : 1
* /
cfg : Base . extend ( {
keySize : 128 / 32 ,
hasher : MD5 ,
iterations : 1
} ) ,
/ * *
* Initializes a newly created key derivation function .
*
* @ param { Object } cfg ( Optional ) The configuration options to use for the derivation .
*
* @ example
*
* var kdf = CryptoJS . algo . EvpKDF . create ( ) ;
* var kdf = CryptoJS . algo . EvpKDF . create ( { keySize : 8 } ) ;
* var kdf = CryptoJS . algo . EvpKDF . create ( { keySize : 8 , iterations : 1000 } ) ;
* /
init : function ( cfg ) {
this . cfg = this . cfg . extend ( cfg ) ;
} ,
/ * *
* Derives a key from a password .
*
* @ param { WordArray | string } password The password .
* @ param { WordArray | string } salt A salt .
*
* @ return { WordArray } The derived key .
*
* @ example
*
* var key = kdf . compute ( password , salt ) ;
* /
compute : function ( password , salt ) {
// Shortcut
var cfg = this . cfg ;
// Init hasher
var hasher = cfg . hasher . create ( ) ;
// Initial values
var derivedKey = WordArray . create ( ) ;
// Shortcuts
var derivedKeyWords = derivedKey . words ;
var keySize = cfg . keySize ;
var iterations = cfg . iterations ;
// Generate key
while ( derivedKeyWords . length < keySize ) {
if ( block ) {
hasher . update ( block ) ;
}
var block = hasher . update ( password ) . finalize ( salt ) ;
hasher . reset ( ) ;
// Iterations
for ( var i = 1 ; i < iterations ; i ++ ) {
block = hasher . finalize ( block ) ;
hasher . reset ( ) ;
}
derivedKey . concat ( block ) ;
}
derivedKey . sigBytes = keySize * 4 ;
return derivedKey ;
}
} ) ;
/ * *
* Derives a key from a password .
*
* @ param { WordArray | string } password The password .
* @ param { WordArray | string } salt A salt .
* @ param { Object } cfg ( Optional ) The configuration options to use for this computation .
*
* @ return { WordArray } The derived key .
*
* @ static
*
* @ example
*
* var key = CryptoJS . EvpKDF ( password , salt ) ;
* var key = CryptoJS . EvpKDF ( password , salt , { keySize : 8 } ) ;
* var key = CryptoJS . EvpKDF ( password , salt , { keySize : 8 , iterations : 1000 } ) ;
* /
C . EvpKDF = function ( password , salt , cfg ) {
return EvpKDF . create ( cfg ) . compute ( password , salt ) ;
} ;
} ( ) ) ;
/ *
CryptoJS v3 . 1.2
code . google . com / p / crypto - js
( c ) 2009 - 2013 by Jeff Mott . All rights reserved .
code . google . com / p / crypto - js / wiki / License
* /
/ * *
* Cipher core components .
* /
CryptoJS . lib . Cipher || ( function ( undefined ) {
// Shortcuts
var C = CryptoJS ;
var C _lib = C . lib ;
var Base = C _lib . Base ;
var WordArray = C _lib . WordArray ;
var BufferedBlockAlgorithm = C _lib . BufferedBlockAlgorithm ;
var C _enc = C . enc ;
var Utf8 = C _enc . Utf8 ;
var Base64 = C _enc . Base64 ;
var C _algo = C . algo ;
var EvpKDF = C _algo . EvpKDF ;
/ * *
* Abstract base cipher template .
*
* @ property { number } keySize This cipher ' s key size . Default : 4 ( 128 bits )
* @ property { number } ivSize This cipher ' s IV size . Default : 4 ( 128 bits )
* @ property { number } _ENC _XFORM _MODE A constant representing encryption mode .
* @ property { number } _DEC _XFORM _MODE A constant representing decryption mode .
* /
var Cipher = C _lib . Cipher = BufferedBlockAlgorithm . extend ( {
/ * *
* Configuration options .
*
* @ property { WordArray } iv The IV to use for this operation .
* /
cfg : Base . extend ( ) ,
/ * *
* Creates this cipher in encryption mode .
*
* @ param { WordArray } key The key .
* @ param { Object } cfg ( Optional ) The configuration options to use for this operation .
*
* @ return { Cipher } A cipher instance .
*
* @ static
*
* @ example
*
* var cipher = CryptoJS . algo . AES . createEncryptor ( keyWordArray , { iv : ivWordArray } ) ;
* /
createEncryptor : function ( key , cfg ) {
return this . create ( this . _ENC _XFORM _MODE , key , cfg ) ;
} ,
/ * *
* Creates this cipher in decryption mode .
*
* @ param { WordArray } key The key .
* @ param { Object } cfg ( Optional ) The configuration options to use for this operation .
*
* @ return { Cipher } A cipher instance .
*
* @ static
*
* @ example
*
* var cipher = CryptoJS . algo . AES . createDecryptor ( keyWordArray , { iv : ivWordArray } ) ;
* /
createDecryptor : function ( key , cfg ) {
return this . create ( this . _DEC _XFORM _MODE , key , cfg ) ;
} ,
/ * *
* Initializes a newly created cipher .
*
* @ param { number } xformMode Either the encryption or decryption transormation mode constant .
* @ param { WordArray } key The key .
* @ param { Object } cfg ( Optional ) The configuration options to use for this operation .
*
* @ example
*
* var cipher = CryptoJS . algo . AES . create ( CryptoJS . algo . AES . _ENC _XFORM _MODE , keyWordArray , { iv : ivWordArray } ) ;
* /
init : function ( xformMode , key , cfg ) {
// Apply config defaults
this . cfg = this . cfg . extend ( cfg ) ;
// Store transform mode and key
this . _xformMode = xformMode ;
this . _key = key ;
// Set initial values
this . reset ( ) ;
} ,
/ * *
* Resets this cipher to its initial state .
*
* @ example
*
* cipher . reset ( ) ;
* /
reset : function ( ) {
// Reset data buffer
BufferedBlockAlgorithm . reset . call ( this ) ;
// Perform concrete-cipher logic
this . _doReset ( ) ;
} ,
/ * *
* Adds data to be encrypted or decrypted .
*
* @ param { WordArray | string } dataUpdate The data to encrypt or decrypt .
*
* @ return { WordArray } The data after processing .
*
* @ example
*
* var encrypted = cipher . process ( 'data' ) ;
* var encrypted = cipher . process ( wordArray ) ;
* /
process : function ( dataUpdate ) {
// Append
this . _append ( dataUpdate ) ;
// Process available blocks
return this . _process ( ) ;
} ,
/ * *
* Finalizes the encryption or decryption process .
* Note that the finalize operation is effectively a destructive , read - once operation .
*
* @ param { WordArray | string } dataUpdate The final data to encrypt or decrypt .
*
* @ return { WordArray } The data after final processing .
*
* @ example
*
* var encrypted = cipher . finalize ( ) ;
* var encrypted = cipher . finalize ( 'data' ) ;
* var encrypted = cipher . finalize ( wordArray ) ;
* /
finalize : function ( dataUpdate ) {
// Final data update
if ( dataUpdate ) {
this . _append ( dataUpdate ) ;
}
// Perform concrete-cipher logic
var finalProcessedData = this . _doFinalize ( ) ;
return finalProcessedData ;
} ,
keySize : 128 / 32 ,
ivSize : 128 / 32 ,
_ENC _XFORM _MODE : 1 ,
_DEC _XFORM _MODE : 2 ,
/ * *
* Creates shortcut functions to a cipher ' s object interface .
*
* @ param { Cipher } cipher The cipher to create a helper for .
*
* @ return { Object } An object with encrypt and decrypt shortcut functions .
*
* @ static
*
* @ example
*
* var AES = CryptoJS . lib . Cipher . _createHelper ( CryptoJS . algo . AES ) ;
* /
_createHelper : ( function ( ) {
function selectCipherStrategy ( key ) {
if ( typeof key == 'string' ) {
return PasswordBasedCipher ;
} else {
return SerializableCipher ;
}
}
return function ( cipher ) {
return {
encrypt : function ( message , key , cfg ) {
return selectCipherStrategy ( key ) . encrypt ( cipher , message , key , cfg ) ;
} ,
decrypt : function ( ciphertext , key , cfg ) {
return selectCipherStrategy ( key ) . decrypt ( cipher , ciphertext , key , cfg ) ;
}
} ;
} ;
} ( ) )
} ) ;
/ * *
* Abstract base stream cipher template .
*
* @ property { number } blockSize The number of 32 - bit words this cipher operates on . Default : 1 ( 32 bits )
* /
var StreamCipher = C _lib . StreamCipher = Cipher . extend ( {
_doFinalize : function ( ) {
// Process partial blocks
var finalProcessedBlocks = this . _process ( ! ! 'flush' ) ;
return finalProcessedBlocks ;
} ,
blockSize : 1
} ) ;
/ * *
* Mode namespace .
* /
var C _mode = C . mode = { } ;
/ * *
* Abstract base block cipher mode template .
* /
var BlockCipherMode = C _lib . BlockCipherMode = Base . extend ( {
/ * *
* Creates this mode for encryption .
*
* @ param { Cipher } cipher A block cipher instance .
* @ param { Array } iv The IV words .
*
* @ static
*
* @ example
*
* var mode = CryptoJS . mode . CBC . createEncryptor ( cipher , iv . words ) ;
* /
createEncryptor : function ( cipher , iv ) {
return this . Encryptor . create ( cipher , iv ) ;
} ,
/ * *
* Creates this mode for decryption .
*
* @ param { Cipher } cipher A block cipher instance .
* @ param { Array } iv The IV words .
*
* @ static
*
* @ example
*
* var mode = CryptoJS . mode . CBC . createDecryptor ( cipher , iv . words ) ;
* /
createDecryptor : function ( cipher , iv ) {
return this . Decryptor . create ( cipher , iv ) ;
} ,
/ * *
* Initializes a newly created mode .
*
* @ param { Cipher } cipher A block cipher instance .
* @ param { Array } iv The IV words .
*
* @ example
*
* var mode = CryptoJS . mode . CBC . Encryptor . create ( cipher , iv . words ) ;
* /
init : function ( cipher , iv ) {
this . _cipher = cipher ;
this . _iv = iv ;
}
} ) ;
/ * *
* Cipher Block Chaining mode .
* /
var CBC = C _mode . CBC = ( function ( ) {
/ * *
* Abstract base CBC mode .
* /
var CBC = BlockCipherMode . extend ( ) ;
/ * *
* CBC encryptor .
* /
CBC . Encryptor = CBC . extend ( {
/ * *
* Processes the data block at offset .
*
* @ param { Array } words The data words to operate on .
* @ param { number } offset The offset where the block starts .
*
* @ example
*
* mode . processBlock ( data . words , offset ) ;
* /
processBlock : function ( words , offset ) {
// Shortcuts
var cipher = this . _cipher ;
var blockSize = cipher . blockSize ;
// XOR and encrypt
xorBlock . call ( this , words , offset , blockSize ) ;
cipher . encryptBlock ( words , offset ) ;
// Remember this block to use with next block
this . _prevBlock = words . slice ( offset , offset + blockSize ) ;
}
} ) ;
/ * *
* CBC decryptor .
* /
CBC . Decryptor = CBC . extend ( {
/ * *
* Processes the data block at offset .
*
* @ param { Array } words The data words to operate on .
* @ param { number } offset The offset where the block starts .
*
* @ example
*
* mode . processBlock ( data . words , offset ) ;
* /
processBlock : function ( words , offset ) {
// Shortcuts
var cipher = this . _cipher ;
var blockSize = cipher . blockSize ;
// Remember this block to use with next block
var thisBlock = words . slice ( offset , offset + blockSize ) ;
// Decrypt and XOR
cipher . decryptBlock ( words , offset ) ;
xorBlock . call ( this , words , offset , blockSize ) ;
// This block becomes the previous block
this . _prevBlock = thisBlock ;
}
} ) ;
function xorBlock ( words , offset , blockSize ) {
// Shortcut
var iv = this . _iv ;
// Choose mixing block
if ( iv ) {
var block = iv ;
// Remove IV for subsequent blocks
this . _iv = undefined ;
} else {
var block = this . _prevBlock ;
}
// XOR blocks
for ( var i = 0 ; i < blockSize ; i ++ ) {
words [ offset + i ] ^= block [ i ] ;
}
}
return CBC ;
} ( ) ) ;
/ * *
* Padding namespace .
* /
var C _pad = C . pad = { } ;
/ * *
* PKCS # 5 / 7 padding strategy .
* /
var Pkcs7 = C _pad . Pkcs7 = {
/ * *
* Pads data using the algorithm defined in PKCS # 5 / 7.
*
* @ param { WordArray } data The data to pad .
* @ param { number } blockSize The multiple that the data should be padded to .
*
* @ static
*
* @ example
*
* CryptoJS . pad . Pkcs7 . pad ( wordArray , 4 ) ;
* /
pad : function ( data , blockSize ) {
// Shortcut
var blockSizeBytes = blockSize * 4 ;
// Count padding bytes
var nPaddingBytes = blockSizeBytes - data . sigBytes % blockSizeBytes ;
// Create padding word
var paddingWord = ( nPaddingBytes << 24 ) | ( nPaddingBytes << 16 ) | ( nPaddingBytes << 8 ) | nPaddingBytes ;
// Create padding
var paddingWords = [ ] ;
for ( var i = 0 ; i < nPaddingBytes ; i += 4 ) {
paddingWords . push ( paddingWord ) ;
}
var padding = WordArray . create ( paddingWords , nPaddingBytes ) ;
// Add padding
data . concat ( padding ) ;
} ,
/ * *
* Unpads data that had been padded using the algorithm defined in PKCS # 5 / 7.
*
* @ param { WordArray } data The data to unpad .
*
* @ static
*
* @ example
*
* CryptoJS . pad . Pkcs7 . unpad ( wordArray ) ;
* /
unpad : function ( data ) {
// Get number of padding bytes from last byte
var nPaddingBytes = data . words [ ( data . sigBytes - 1 ) >>> 2 ] & 0xff ;
// Remove padding
data . sigBytes -= nPaddingBytes ;
}
} ;
/ * *
* Abstract base block cipher template .
*
* @ property { number } blockSize The number of 32 - bit words this cipher operates on . Default : 4 ( 128 bits )
* /
var BlockCipher = C _lib . BlockCipher = Cipher . extend ( {
/ * *
* Configuration options .
*
* @ property { Mode } mode The block mode to use . Default : CBC
* @ property { Padding } padding The padding strategy to use . Default : Pkcs7
* /
cfg : Cipher . cfg . extend ( {
mode : CBC ,
padding : Pkcs7
} ) ,
reset : function ( ) {
// Reset cipher
Cipher . reset . call ( this ) ;
// Shortcuts
var cfg = this . cfg ;
var iv = cfg . iv ;
var mode = cfg . mode ;
// Reset block mode
if ( this . _xformMode == this . _ENC _XFORM _MODE ) {
var modeCreator = mode . createEncryptor ;
} else /* if (this._xformMode == this._DEC_XFORM_MODE) */ {
var modeCreator = mode . createDecryptor ;
// Keep at least one block in the buffer for unpadding
this . _minBufferSize = 1 ;
}
this . _mode = modeCreator . call ( mode , this , iv && iv . words ) ;
} ,
_doProcessBlock : function ( words , offset ) {
this . _mode . processBlock ( words , offset ) ;
} ,
_doFinalize : function ( ) {
// Shortcut
var padding = this . cfg . padding ;
// Finalize
if ( this . _xformMode == this . _ENC _XFORM _MODE ) {
// Pad data
padding . pad ( this . _data , this . blockSize ) ;
// Process final blocks
var finalProcessedBlocks = this . _process ( ! ! 'flush' ) ;
} else /* if (this._xformMode == this._DEC_XFORM_MODE) */ {
// Process final blocks
var finalProcessedBlocks = this . _process ( ! ! 'flush' ) ;
// Unpad data
padding . unpad ( finalProcessedBlocks ) ;
}
return finalProcessedBlocks ;
} ,
blockSize : 128 / 32
} ) ;
/ * *
* A collection of cipher parameters .
*
* @ property { WordArray } ciphertext The raw ciphertext .
* @ property { WordArray } key The key to this ciphertext .
* @ property { WordArray } iv The IV used in the ciphering operation .
* @ property { WordArray } salt The salt used with a key derivation function .
* @ property { Cipher } algorithm The cipher algorithm .
* @ property { Mode } mode The block mode used in the ciphering operation .
* @ property { Padding } padding The padding scheme used in the ciphering operation .
* @ property { number } blockSize The block size of the cipher .
* @ property { Format } formatter The default formatting strategy to convert this cipher params object to a string .
* /
var CipherParams = C _lib . CipherParams = Base . extend ( {
/ * *
* Initializes a newly created cipher params object .
*
* @ param { Object } cipherParams An object with any of the possible cipher parameters .
*
* @ example
*
* var cipherParams = CryptoJS . lib . CipherParams . create ( {
* ciphertext : ciphertextWordArray ,
* key : keyWordArray ,
* iv : ivWordArray ,
* salt : saltWordArray ,
* algorithm : CryptoJS . algo . AES ,
* mode : CryptoJS . mode . CBC ,
* padding : CryptoJS . pad . PKCS7 ,
* blockSize : 4 ,
* formatter : CryptoJS . format . OpenSSL
* } ) ;
* /
init : function ( cipherParams ) {
this . mixIn ( cipherParams ) ;
} ,
/ * *
* Converts this cipher params object to a string .
*
* @ param { Format } formatter ( Optional ) The formatting strategy to use .
*
* @ return { string } The stringified cipher params .
*
* @ throws Error If neither the formatter nor the default formatter is set .
*
* @ example
*
* var string = cipherParams + '' ;
* var string = cipherParams . toString ( ) ;
* var string = cipherParams . toString ( CryptoJS . format . OpenSSL ) ;
* /
toString : function ( formatter ) {
return ( formatter || this . formatter ) . stringify ( this ) ;
}
} ) ;
/ * *
* Format namespace .
* /
var C _format = C . format = { } ;
/ * *
* OpenSSL formatting strategy .
* /
var OpenSSLFormatter = C _format . OpenSSL = {
/ * *
* Converts a cipher params object to an OpenSSL - compatible string .
*
* @ param { CipherParams } cipherParams The cipher params object .
*
* @ return { string } The OpenSSL - compatible string .
*
* @ static
*
* @ example
*
* var openSSLString = CryptoJS . format . OpenSSL . stringify ( cipherParams ) ;
* /
stringify : function ( cipherParams ) {
// Shortcuts
var ciphertext = cipherParams . ciphertext ;
var salt = cipherParams . salt ;
// Format
if ( salt ) {
var wordArray = WordArray . create ( [ 0x53616c74 , 0x65645f5f ] ) . concat ( salt ) . concat ( ciphertext ) ;
} else {
var wordArray = ciphertext ;
}
return wordArray . toString ( Base64 ) ;
} ,
/ * *
* Converts an OpenSSL - compatible string to a cipher params object .
*
* @ param { string } openSSLStr The OpenSSL - compatible string .
*
* @ return { CipherParams } The cipher params object .
*
* @ static
*
* @ example
*
* var cipherParams = CryptoJS . format . OpenSSL . parse ( openSSLString ) ;
* /
parse : function ( openSSLStr ) {
// Parse base64
var ciphertext = Base64 . parse ( openSSLStr ) ;
// Shortcut
var ciphertextWords = ciphertext . words ;
// Test for salt
if ( ciphertextWords [ 0 ] == 0x53616c74 && ciphertextWords [ 1 ] == 0x65645f5f ) {
// Extract salt
var salt = WordArray . create ( ciphertextWords . slice ( 2 , 4 ) ) ;
// Remove salt from ciphertext
ciphertextWords . splice ( 0 , 4 ) ;
ciphertext . sigBytes -= 16 ;
}
return CipherParams . create ( { ciphertext : ciphertext , salt : salt } ) ;
}
} ;
/ * *
* A cipher wrapper that returns ciphertext as a serializable cipher params object .
* /
var SerializableCipher = C _lib . SerializableCipher = Base . extend ( {
/ * *
* Configuration options .
*
* @ property { Formatter } format The formatting strategy to convert cipher param objects to and from a string . Default : OpenSSL
* /
cfg : Base . extend ( {
format : OpenSSLFormatter
} ) ,
/ * *
* Encrypts a message .
*
* @ param { Cipher } cipher The cipher algorithm to use .
* @ param { WordArray | string } message The message to encrypt .
* @ param { WordArray } key The key .
* @ param { Object } cfg ( Optional ) The configuration options to use for this operation .
*
* @ return { CipherParams } A cipher params object .
*
* @ static
*
* @ example
*
* var ciphertextParams = CryptoJS . lib . SerializableCipher . encrypt ( CryptoJS . algo . AES , message , key ) ;
* var ciphertextParams = CryptoJS . lib . SerializableCipher . encrypt ( CryptoJS . algo . AES , message , key , { iv : iv } ) ;
* var ciphertextParams = CryptoJS . lib . SerializableCipher . encrypt ( CryptoJS . algo . AES , message , key , { iv : iv , format : CryptoJS . format . OpenSSL } ) ;
* /
encrypt : function ( cipher , message , key , cfg ) {
// Apply config defaults
cfg = this . cfg . extend ( cfg ) ;
// Encrypt
var encryptor = cipher . createEncryptor ( key , cfg ) ;
var ciphertext = encryptor . finalize ( message ) ;
// Shortcut
var cipherCfg = encryptor . cfg ;
// Create and return serializable cipher params
return CipherParams . create ( {
ciphertext : ciphertext ,
key : key ,
iv : cipherCfg . iv ,
algorithm : cipher ,
mode : cipherCfg . mode ,
padding : cipherCfg . padding ,
blockSize : cipher . blockSize ,
formatter : cfg . format
} ) ;
} ,
/ * *
* Decrypts serialized ciphertext .
*
* @ param { Cipher } cipher The cipher algorithm to use .
* @ param { CipherParams | string } ciphertext The ciphertext to decrypt .
* @ param { WordArray } key The key .
* @ param { Object } cfg ( Optional ) The configuration options to use for this operation .
*
* @ return { WordArray } The plaintext .
*
* @ static
*
* @ example
*
* var plaintext = CryptoJS . lib . SerializableCipher . decrypt ( CryptoJS . algo . AES , formattedCiphertext , key , { iv : iv , format : CryptoJS . format . OpenSSL } ) ;
* var plaintext = CryptoJS . lib . SerializableCipher . decrypt ( CryptoJS . algo . AES , ciphertextParams , key , { iv : iv , format : CryptoJS . format . OpenSSL } ) ;
* /
decrypt : function ( cipher , ciphertext , key , cfg ) {
// Apply config defaults
cfg = this . cfg . extend ( cfg ) ;
// Convert string to CipherParams
ciphertext = this . _parse ( ciphertext , cfg . format ) ;
// Decrypt
var plaintext = cipher . createDecryptor ( key , cfg ) . finalize ( ciphertext . ciphertext ) ;
return plaintext ;
} ,
/ * *
* Converts serialized ciphertext to CipherParams ,
* else assumed CipherParams already and returns ciphertext unchanged .
*
* @ param { CipherParams | string } ciphertext The ciphertext .
* @ param { Formatter } format The formatting strategy to use to parse serialized ciphertext .
*
* @ return { CipherParams } The unserialized ciphertext .
*
* @ static
*
* @ example
*
* var ciphertextParams = CryptoJS . lib . SerializableCipher . _parse ( ciphertextStringOrParams , format ) ;
* /
_parse : function ( ciphertext , format ) {
if ( typeof ciphertext == 'string' ) {
return format . parse ( ciphertext , this ) ;
} else {
return ciphertext ;
}
}
} ) ;
/ * *
* Key derivation function namespace .
* /
var C _kdf = C . kdf = { } ;
/ * *
* OpenSSL key derivation function .
* /
var OpenSSLKdf = C _kdf . OpenSSL = {
/ * *
* Derives a key and IV from a password .
*
* @ param { string } password The password to derive from .
* @ param { number } keySize The size in words of the key to generate .
* @ param { number } ivSize The size in words of the IV to generate .
* @ param { WordArray | string } salt ( Optional ) A 64 - bit salt to use . If omitted , a salt will be generated randomly .
*
* @ return { CipherParams } A cipher params object with the key , IV , and salt .
*
* @ static
*
* @ example
*
* var derivedParams = CryptoJS . kdf . OpenSSL . execute ( 'Password' , 256 / 32 , 128 / 32 ) ;
* var derivedParams = CryptoJS . kdf . OpenSSL . execute ( 'Password' , 256 / 32 , 128 / 32 , 'saltsalt' ) ;
* /
execute : function ( password , keySize , ivSize , salt ) {
// Generate random salt
if ( ! salt ) {
salt = WordArray . random ( 64 / 8 ) ;
}
// Derive key and IV
var key = EvpKDF . create ( { keySize : keySize + ivSize } ) . compute ( password , salt ) ;
// Separate key and IV
var iv = WordArray . create ( key . words . slice ( keySize ) , ivSize * 4 ) ;
key . sigBytes = keySize * 4 ;
// Return params
return CipherParams . create ( { key : key , iv : iv , salt : salt } ) ;
}
} ;
/ * *
* A serializable cipher wrapper that derives the key from a password ,
* and returns ciphertext as a serializable cipher params object .
* /
var PasswordBasedCipher = C _lib . PasswordBasedCipher = SerializableCipher . extend ( {
/ * *
* Configuration options .
*
* @ property { KDF } kdf The key derivation function to use to generate a key and IV from a password . Default : OpenSSL
* /
cfg : SerializableCipher . cfg . extend ( {
kdf : OpenSSLKdf
} ) ,
/ * *
* Encrypts a message using a password .
*
* @ param { Cipher } cipher The cipher algorithm to use .
* @ param { WordArray | string } message The message to encrypt .
* @ param { string } password The password .
* @ param { Object } cfg ( Optional ) The configuration options to use for this operation .
*
* @ return { CipherParams } A cipher params object .
*
* @ static
*
* @ example
*
* var ciphertextParams = CryptoJS . lib . PasswordBasedCipher . encrypt ( CryptoJS . algo . AES , message , 'password' ) ;
* var ciphertextParams = CryptoJS . lib . PasswordBasedCipher . encrypt ( CryptoJS . algo . AES , message , 'password' , { format : CryptoJS . format . OpenSSL } ) ;
* /
encrypt : function ( cipher , message , password , cfg ) {
// Apply config defaults
cfg = this . cfg . extend ( cfg ) ;
// Derive key and other params
var derivedParams = cfg . kdf . execute ( password , cipher . keySize , cipher . ivSize ) ;
// Add IV to config
cfg . iv = derivedParams . iv ;
// Encrypt
var ciphertext = SerializableCipher . encrypt . call ( this , cipher , message , derivedParams . key , cfg ) ;
// Mix in derived params
ciphertext . mixIn ( derivedParams ) ;
return ciphertext ;
} ,
/ * *
* Decrypts serialized ciphertext using a password .
*
* @ param { Cipher } cipher The cipher algorithm to use .
* @ param { CipherParams | string } ciphertext The ciphertext to decrypt .
* @ param { string } password The password .
* @ param { Object } cfg ( Optional ) The configuration options to use for this operation .
*
* @ return { WordArray } The plaintext .
*
* @ static
*
* @ example
*
* var plaintext = CryptoJS . lib . PasswordBasedCipher . decrypt ( CryptoJS . algo . AES , formattedCiphertext , 'password' , { format : CryptoJS . format . OpenSSL } ) ;
* var plaintext = CryptoJS . lib . PasswordBasedCipher . decrypt ( CryptoJS . algo . AES , ciphertextParams , 'password' , { format : CryptoJS . format . OpenSSL } ) ;
* /
decrypt : function ( cipher , ciphertext , password , cfg ) {
// Apply config defaults
cfg = this . cfg . extend ( cfg ) ;
// Convert string to CipherParams
ciphertext = this . _parse ( ciphertext , cfg . format ) ;
// Derive key and other params
var derivedParams = cfg . kdf . execute ( password , cipher . keySize , cipher . ivSize , ciphertext . salt ) ;
// Add IV to config
cfg . iv = derivedParams . iv ;
// Decrypt
var plaintext = SerializableCipher . decrypt . call ( this , cipher , ciphertext , derivedParams . key , cfg ) ;
return plaintext ;
}
} ) ;
} ( ) ) ;
/ *
CryptoJS v3 . 1.2
code . google . com / p / crypto - js
( c ) 2009 - 2013 by Jeff Mott . All rights reserved .
code . google . com / p / crypto - js / wiki / License
* /
/ * *
* Electronic Codebook block mode .
* /
CryptoJS . mode . ECB = ( function ( ) {
var ECB = CryptoJS . lib . BlockCipherMode . extend ( ) ;
ECB . Encryptor = ECB . extend ( {
processBlock : function ( words , offset ) {
this . _cipher . encryptBlock ( words , offset ) ;
}
} ) ;
ECB . Decryptor = ECB . extend ( {
processBlock : function ( words , offset ) {
this . _cipher . decryptBlock ( words , offset ) ;
}
} ) ;
return ECB ;
} ( ) ) ;
/ *
CryptoJS v3 . 1.2
code . google . com / p / crypto - js
( c ) 2009 - 2013 by Jeff Mott . All rights reserved .
code . google . com / p / crypto - js / wiki / License
* /
( function ( ) {
// Shortcuts
var C = CryptoJS ;
var C _lib = C . lib ;
var BlockCipher = C _lib . BlockCipher ;
var C _algo = C . algo ;
// Lookup tables
var SBOX = [ ] ;
var INV _SBOX = [ ] ;
var SUB _MIX _0 = [ ] ;
var SUB _MIX _1 = [ ] ;
var SUB _MIX _2 = [ ] ;
var SUB _MIX _3 = [ ] ;
var INV _SUB _MIX _0 = [ ] ;
var INV _SUB _MIX _1 = [ ] ;
var INV _SUB _MIX _2 = [ ] ;
var INV _SUB _MIX _3 = [ ] ;
// Compute lookup tables
( function ( ) {
// Compute double table
var d = [ ] ;
for ( var i = 0 ; i < 256 ; i ++ ) {
if ( i < 128 ) {
d [ i ] = i << 1 ;
} else {
d [ i ] = ( i << 1 ) ^ 0x11b ;
}
}
// Walk GF(2^8)
var x = 0 ;
var xi = 0 ;
for ( var i = 0 ; i < 256 ; i ++ ) {
// Compute sbox
var sx = xi ^ ( xi << 1 ) ^ ( xi << 2 ) ^ ( xi << 3 ) ^ ( xi << 4 ) ;
sx = ( sx >>> 8 ) ^ ( sx & 0xff ) ^ 0x63 ;
SBOX [ x ] = sx ;
INV _SBOX [ sx ] = x ;
// Compute multiplication
var x2 = d [ x ] ;
var x4 = d [ x2 ] ;
var x8 = d [ x4 ] ;
// Compute sub bytes, mix columns tables
var t = ( d [ sx ] * 0x101 ) ^ ( sx * 0x1010100 ) ;
SUB _MIX _0 [ x ] = ( t << 24 ) | ( t >>> 8 ) ;
SUB _MIX _1 [ x ] = ( t << 16 ) | ( t >>> 16 ) ;
SUB _MIX _2 [ x ] = ( t << 8 ) | ( t >>> 24 ) ;
SUB _MIX _3 [ x ] = t ;
// Compute inv sub bytes, inv mix columns tables
var t = ( x8 * 0x1010101 ) ^ ( x4 * 0x10001 ) ^ ( x2 * 0x101 ) ^ ( x * 0x1010100 ) ;
INV _SUB _MIX _0 [ sx ] = ( t << 24 ) | ( t >>> 8 ) ;
INV _SUB _MIX _1 [ sx ] = ( t << 16 ) | ( t >>> 16 ) ;
INV _SUB _MIX _2 [ sx ] = ( t << 8 ) | ( t >>> 24 ) ;
INV _SUB _MIX _3 [ sx ] = t ;
// Compute next counter
if ( ! x ) {
x = xi = 1 ;
} else {
x = x2 ^ d [ d [ d [ x8 ^ x2 ] ] ] ;
xi ^= d [ d [ xi ] ] ;
}
}
} ( ) ) ;
// Precomputed Rcon lookup
var RCON = [ 0x00 , 0x01 , 0x02 , 0x04 , 0x08 , 0x10 , 0x20 , 0x40 , 0x80 , 0x1b , 0x36 ] ;
/ * *
* AES block cipher algorithm .
* /
var AES = C _algo . AES = BlockCipher . extend ( {
_doReset : function ( ) {
// Shortcuts
var key = this . _key ;
var keyWords = key . words ;
var keySize = key . sigBytes / 4 ;
// Compute number of rounds
var nRounds = this . _nRounds = keySize + 6 ;
// Compute number of key schedule rows
var ksRows = ( nRounds + 1 ) * 4 ;
// Compute key schedule
var keySchedule = this . _keySchedule = [ ] ;
for ( var ksRow = 0 ; ksRow < ksRows ; ksRow ++ ) {
if ( ksRow < keySize ) {
keySchedule [ ksRow ] = keyWords [ ksRow ] ;
} else {
var t = keySchedule [ ksRow - 1 ] ;
if ( ! ( ksRow % keySize ) ) {
// Rot word
t = ( t << 8 ) | ( t >>> 24 ) ;
// Sub word
t = ( SBOX [ t >>> 24 ] << 24 ) | ( SBOX [ ( t >>> 16 ) & 0xff ] << 16 ) | ( SBOX [ ( t >>> 8 ) & 0xff ] << 8 ) | SBOX [ t & 0xff ] ;
// Mix Rcon
t ^= RCON [ ( ksRow / keySize ) | 0 ] << 24 ;
} else if ( keySize > 6 && ksRow % keySize == 4 ) {
// Sub word
t = ( SBOX [ t >>> 24 ] << 24 ) | ( SBOX [ ( t >>> 16 ) & 0xff ] << 16 ) | ( SBOX [ ( t >>> 8 ) & 0xff ] << 8 ) | SBOX [ t & 0xff ] ;
}
keySchedule [ ksRow ] = keySchedule [ ksRow - keySize ] ^ t ;
}
}
// Compute inv key schedule
var invKeySchedule = this . _invKeySchedule = [ ] ;
for ( var invKsRow = 0 ; invKsRow < ksRows ; invKsRow ++ ) {
var ksRow = ksRows - invKsRow ;
if ( invKsRow % 4 ) {
var t = keySchedule [ ksRow ] ;
} else {
var t = keySchedule [ ksRow - 4 ] ;
}
if ( invKsRow < 4 || ksRow <= 4 ) {
invKeySchedule [ invKsRow ] = t ;
} else {
invKeySchedule [ invKsRow ] = INV _SUB _MIX _0 [ SBOX [ t >>> 24 ] ] ^ INV _SUB _MIX _1 [ SBOX [ ( t >>> 16 ) & 0xff ] ] ^
INV _SUB _MIX _2 [ SBOX [ ( t >>> 8 ) & 0xff ] ] ^ INV _SUB _MIX _3 [ SBOX [ t & 0xff ] ] ;
}
}
} ,
encryptBlock : function ( M , offset ) {
this . _doCryptBlock ( M , offset , this . _keySchedule , SUB _MIX _0 , SUB _MIX _1 , SUB _MIX _2 , SUB _MIX _3 , SBOX ) ;
} ,
decryptBlock : function ( M , offset ) {
// Swap 2nd and 4th rows
var t = M [ offset + 1 ] ;
M [ offset + 1 ] = M [ offset + 3 ] ;
M [ offset + 3 ] = t ;
this . _doCryptBlock ( M , offset , this . _invKeySchedule , INV _SUB _MIX _0 , INV _SUB _MIX _1 , INV _SUB _MIX _2 , INV _SUB _MIX _3 , INV _SBOX ) ;
// Inv swap 2nd and 4th rows
var t = M [ offset + 1 ] ;
M [ offset + 1 ] = M [ offset + 3 ] ;
M [ offset + 3 ] = t ;
} ,
_doCryptBlock : function ( M , offset , keySchedule , SUB _MIX _0 , SUB _MIX _1 , SUB _MIX _2 , SUB _MIX _3 , SBOX ) {
// Shortcut
var nRounds = this . _nRounds ;
// Get input, add round key
var s0 = M [ offset ] ^ keySchedule [ 0 ] ;
var s1 = M [ offset + 1 ] ^ keySchedule [ 1 ] ;
var s2 = M [ offset + 2 ] ^ keySchedule [ 2 ] ;
var s3 = M [ offset + 3 ] ^ keySchedule [ 3 ] ;
// Key schedule row counter
var ksRow = 4 ;
// Rounds
for ( var round = 1 ; round < nRounds ; round ++ ) {
// Shift rows, sub bytes, mix columns, add round key
var t0 = SUB _MIX _0 [ s0 >>> 24 ] ^ SUB _MIX _1 [ ( s1 >>> 16 ) & 0xff ] ^ SUB _MIX _2 [ ( s2 >>> 8 ) & 0xff ] ^ SUB _MIX _3 [ s3 & 0xff ] ^ keySchedule [ ksRow ++ ] ;
var t1 = SUB _MIX _0 [ s1 >>> 24 ] ^ SUB _MIX _1 [ ( s2 >>> 16 ) & 0xff ] ^ SUB _MIX _2 [ ( s3 >>> 8 ) & 0xff ] ^ SUB _MIX _3 [ s0 & 0xff ] ^ keySchedule [ ksRow ++ ] ;
var t2 = SUB _MIX _0 [ s2 >>> 24 ] ^ SUB _MIX _1 [ ( s3 >>> 16 ) & 0xff ] ^ SUB _MIX _2 [ ( s0 >>> 8 ) & 0xff ] ^ SUB _MIX _3 [ s1 & 0xff ] ^ keySchedule [ ksRow ++ ] ;
var t3 = SUB _MIX _0 [ s3 >>> 24 ] ^ SUB _MIX _1 [ ( s0 >>> 16 ) & 0xff ] ^ SUB _MIX _2 [ ( s1 >>> 8 ) & 0xff ] ^ SUB _MIX _3 [ s2 & 0xff ] ^ keySchedule [ ksRow ++ ] ;
// Update state
s0 = t0 ;
s1 = t1 ;
s2 = t2 ;
s3 = t3 ;
}
// Shift rows, sub bytes, add round key
var t0 = ( ( SBOX [ s0 >>> 24 ] << 24 ) | ( SBOX [ ( s1 >>> 16 ) & 0xff ] << 16 ) | ( SBOX [ ( s2 >>> 8 ) & 0xff ] << 8 ) | SBOX [ s3 & 0xff ] ) ^ keySchedule [ ksRow ++ ] ;
var t1 = ( ( SBOX [ s1 >>> 24 ] << 24 ) | ( SBOX [ ( s2 >>> 16 ) & 0xff ] << 16 ) | ( SBOX [ ( s3 >>> 8 ) & 0xff ] << 8 ) | SBOX [ s0 & 0xff ] ) ^ keySchedule [ ksRow ++ ] ;
var t2 = ( ( SBOX [ s2 >>> 24 ] << 24 ) | ( SBOX [ ( s3 >>> 16 ) & 0xff ] << 16 ) | ( SBOX [ ( s0 >>> 8 ) & 0xff ] << 8 ) | SBOX [ s1 & 0xff ] ) ^ keySchedule [ ksRow ++ ] ;
var t3 = ( ( SBOX [ s3 >>> 24 ] << 24 ) | ( SBOX [ ( s0 >>> 16 ) & 0xff ] << 16 ) | ( SBOX [ ( s1 >>> 8 ) & 0xff ] << 8 ) | SBOX [ s2 & 0xff ] ) ^ keySchedule [ ksRow ++ ] ;
// Set output
M [ offset ] = t0 ;
M [ offset + 1 ] = t1 ;
M [ offset + 2 ] = t2 ;
M [ offset + 3 ] = t3 ;
} ,
keySize : 256 / 32
} ) ;
/ * *
* Shortcut functions to the cipher ' s object interface .
*
* @ example
*
* var ciphertext = CryptoJS . AES . encrypt ( message , key , cfg ) ;
* var plaintext = CryptoJS . AES . decrypt ( ciphertext , key , cfg ) ;
* /
C . AES = BlockCipher . _createHelper ( AES ) ;
} ( ) ) ;
_ . extend ( BI , {
/ * *
* aes加密方法
* aes - 128 - ecb
*
* @ example
*
* var ciphertext = BI . aesEncrypt ( text , key ) ;
* /
aesEncrypt : function ( text , key ) {
key = CryptoJS . enc . Utf8 . parse ( key ) ;
var cipher = CryptoJS . AES . encrypt ( text , key , {
mode : CryptoJS . mode . ECB ,
padding : CryptoJS . pad . Pkcs7
} ) ;
var base64Cipher = cipher . ciphertext . toString ( CryptoJS . enc . Base64 ) ;
return base64Cipher ;
} ,
/ * *
* aes解密方法
* @ param { String } text
* @ param { String } key
* /
aesDecrypt : function ( text , key ) {
key = CryptoJS . enc . Utf8 . parse ( key ) ;
var decipher = CryptoJS . AES . decrypt ( text , key , {
mode : CryptoJS . mode . ECB ,
padding : CryptoJS . pad . Pkcs7
} ) ;
return CryptoJS . enc . Utf8 . stringify ( decipher ) ;
}
} ) ;
} ( ) ) ;
/***/ } ) ,
/***/ 1089 :
/***/ ( function ( module , exports , _ _webpack _require _ _ ) {
_ _webpack _require _ _ ( 101 ) ;
_ _webpack _require _ _ ( 102 ) ;
_ _webpack _require _ _ ( 130 ) ;
_ _webpack _require _ _ ( 123 ) ;
_ _webpack _require _ _ ( 126 ) ;
_ _webpack _require _ _ ( 127 ) ;
_ _webpack _require _ _ ( 124 ) ;
_ _webpack _require _ _ ( 125 ) ;
_ _webpack _require _ _ ( 105 ) ;
_ _webpack _require _ _ ( 107 ) ;
_ _webpack _require _ _ ( 122 ) ;
_ _webpack _require _ _ ( 129 ) ;
_ _webpack _require _ _ ( 128 ) ;
_ _webpack _require _ _ ( 108 ) ;
_ _webpack _require _ _ ( 109 ) ;
_ _webpack _require _ _ ( 110 ) ;
_ _webpack _require _ _ ( 111 ) ;
_ _webpack _require _ _ ( 112 ) ;
_ _webpack _require _ _ ( 113 ) ;
_ _webpack _require _ _ ( 114 ) ;
_ _webpack _require _ _ ( 115 ) ;
_ _webpack _require _ _ ( 116 ) ;
_ _webpack _require _ _ ( 117 ) ;
_ _webpack _require _ _ ( 118 ) ;
_ _webpack _require _ _ ( 119 ) ;
_ _webpack _require _ _ ( 120 ) ;
_ _webpack _require _ _ ( 121 ) ;
_ _webpack _require _ _ ( 754 ) ;
_ _webpack _require _ _ ( 1090 ) ;
_ _webpack _require _ _ ( 131 ) ;
_ _webpack _require _ _ ( 132 ) ;
module . exports = _ _webpack _require _ _ ( 133 ) ;
/***/ } ) ,
/***/ 109 :
/***/ ( function ( module , exports ) {
! ( function ( ) {
function aspect ( type ) {
return function ( target , methodName , advice ) {
var exist = target [ methodName ] ,
dispatcher ;
if ( ! exist || exist . target != target ) {
dispatcher = target [ methodName ] = function ( ) {
// before methods
var beforeArr = dispatcher . before ;
var args = arguments , next ;
for ( var l = beforeArr . length ; l -- ; ) {
next = beforeArr [ l ] . advice . apply ( this , args ) ;
if ( next === false ) {
return false ;
}
args = next || args ;
}
// target method
var rs = dispatcher . method . apply ( this , args ) ;
// after methods
var afterArr = dispatcher . after ;
for ( var i = 0 , ii = afterArr . length ; i < ii ; i ++ ) {
next = afterArr [ i ] . advice . call ( this , rs , args ) ;
if ( rs === false ) {
return false ;
}
args = next || args ;
}
return rs ;
} ;
dispatcher . before = [ ] ;
dispatcher . after = [ ] ;
if ( exist ) {
dispatcher . method = exist ;
}
dispatcher . target = target ;
}
var aspectArr = ( dispatcher || exist ) [ type ] ;
var obj = {
advice : advice ,
_index : aspectArr . length ,
remove : function ( ) {
aspectArr . splice ( this . _index , 1 ) ;
}
} ;
aspectArr . push ( obj ) ;
return obj ;
} ;
}
BI . aspect = {
before : aspect ( "before" ) ,
after : aspect ( "after" )
} ;
return BI . aspect ;
} ) ( ) ;
/***/ } ) ,
/***/ 1090 :
/***/ ( function ( module , exports ) {
/ * *
* Created by astronaut007 on 2018 / 8 / 8
* /
// 牵扯到国际化这些常量在页面加载后再生效
// full day names
BI . Date = BI . Date || { } ;
BI . Date . _DN = [ "星期日" ,
"星期一" ,
"星期二" ,
"星期三" ,
"星期四" ,
"星期五" ,
"星期六" ,
"星期日" ] ;
// short day names
BI . Date . _SDN = [ "日" ,
"一" ,
"二" ,
"三" ,
"四" ,
"五" ,
"六" ,
"日" ] ;
// Monday first, etc.
BI . Date . _FD = 1 ;
// full month namesdat
BI . Date . _MN = [
"一月" ,
"二月" ,
"三月" ,
"四月" ,
"五月" ,
"六月" ,
"七月" ,
"八月" ,
"九月" ,
"十月" ,
"十一月" ,
"十二月" ] ;
// short month names
BI . Date . _SMN = [ 0 ,
1 ,
2 ,
3 ,
4 ,
5 ,
6 ,
7 ,
8 ,
9 ,
10 ,
11 ] ;
BI . Date . _QN = [ "" , "第1季度" ,
"第2季度" ,
"第3季度" ,
"第4季度" ] ;
/** Adds the number of days array to the Date object. */
BI . Date . _MD = [ 31 , 28 , 31 , 30 , 31 , 30 , 31 , 31 , 30 , 31 , 30 , 31 ] ;
// 实际上无论周几作为一周的第一天，周初周末都是在-6-0间做偏移，用一个数组就可以
BI . Date . _OFFSET = [ 0 , - 1 , - 2 , - 3 , - 4 , - 5 , - 6 ] ;
/***/ } ) ,
/***/ 110 :
/***/ ( function ( module , exports ) {
! ( function ( ) {
var _keyStr = "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/=" ;
// private method for UTF-8 encoding
var _utf8 _encode = function ( string ) {
string = string . replace ( /\r\n/g , "\n" ) ;
var utftext = "" ;
for ( var n = 0 ; n < string . length ; n ++ ) {
var c = string . charCodeAt ( n ) ;
if ( c < 128 ) {
utftext += String . fromCharCode ( c ) ;
} else if ( ( c > 127 ) && ( c < 2048 ) ) {
utftext += String . fromCharCode ( ( c >> 6 ) | 192 ) ;
utftext += String . fromCharCode ( ( c & 63 ) | 128 ) ;
} else {
utftext += String . fromCharCode ( ( c >> 12 ) | 224 ) ;
utftext += String . fromCharCode ( ( ( c >> 6 ) & 63 ) | 128 ) ;
utftext += String . fromCharCode ( ( c & 63 ) | 128 ) ;
}
}
return utftext ;
} ;
// private method for UTF-8 decoding
var _utf8 _decode = function ( utftext ) {
var string = "" ;
var i = 0 ;
var c = 0 , c3 = 0 , c2 = 0 ;
while ( i < utftext . length ) {
c = utftext . charCodeAt ( i ) ;
if ( c < 128 ) {
string += String . fromCharCode ( c ) ;
i ++ ;
} else if ( ( c > 191 ) && ( c < 224 ) ) {
c2 = utftext . charCodeAt ( i + 1 ) ;
string += String . fromCharCode ( ( ( c & 31 ) << 6 ) | ( c2 & 63 ) ) ;
i += 2 ;
} else {
c2 = utftext . charCodeAt ( i + 1 ) ;
c3 = utftext . charCodeAt ( i + 2 ) ;
string += String . fromCharCode ( ( ( c & 15 ) << 12 ) | ( ( c2 & 63 ) << 6 ) | ( c3 & 63 ) ) ;
i += 3 ;
}
}
return string ;
} ;
_ . extend ( BI , {
encode : function ( input ) {
var output = "" ;
var chr1 , chr2 , chr3 , enc1 , enc2 , enc3 , enc4 ;
var i = 0 ;
input = _utf8 _encode ( input ) ;
while ( i < input . length ) {
chr1 = input . charCodeAt ( i ++ ) ;
chr2 = input . charCodeAt ( i ++ ) ;
chr3 = input . charCodeAt ( i ++ ) ;
enc1 = chr1 >> 2 ;
enc2 = ( ( chr1 & 3 ) << 4 ) | ( chr2 >> 4 ) ;
enc3 = ( ( chr2 & 15 ) << 2 ) | ( chr3 >> 6 ) ;
enc4 = chr3 & 63 ;
if ( isNaN ( chr2 ) ) {
enc3 = enc4 = 64 ;
} else if ( isNaN ( chr3 ) ) {
enc4 = 64 ;
}
output = output + _keyStr . charAt ( enc1 ) + _keyStr . charAt ( enc2 ) + _keyStr . charAt ( enc3 ) + _keyStr . charAt ( enc4 ) ;
}
return output ;
} ,
// public method for decoding
decode : function ( input ) {
var output = "" ;
var chr1 , chr2 , chr3 ;
var enc1 , enc2 , enc3 , enc4 ;
var i = 0 ;
input = input . replace ( /[^A-Za-z0-9\+\/\=]/g , "" ) ;
while ( i < input . length ) {
enc1 = _keyStr . indexOf ( input . charAt ( i ++ ) ) ;
enc2 = _keyStr . indexOf ( input . charAt ( i ++ ) ) ;
enc3 = _keyStr . indexOf ( input . charAt ( i ++ ) ) ;
enc4 = _keyStr . indexOf ( input . charAt ( i ++ ) ) ;
chr1 = ( enc1 << 2 ) | ( enc2 >> 4 ) ;
chr2 = ( ( enc2 & 15 ) << 4 ) | ( enc3 >> 2 ) ;
chr3 = ( ( enc3 & 3 ) << 6 ) | enc4 ;
output = output + String . fromCharCode ( chr1 ) ;
if ( enc3 != 64 ) {
output = output + String . fromCharCode ( chr2 ) ;
}
if ( enc4 != 64 ) {
output = output + String . fromCharCode ( chr3 ) ;
}
}
output = _utf8 _decode ( output ) ;
return output ;
}
} ) ;
} ) ( ) ;
/***/ } ) ,
/***/ 111 :
/***/ ( function ( module , exports ) {
BI . Cache = {
_prefix : "bi" ,
setUsername : function ( username ) {
localStorage . setItem ( BI . Cache . _prefix + ".username" , ( username + "" || "" ) . toUpperCase ( ) ) ;
} ,
getUsername : function ( ) {
return localStorage . getItem ( BI . Cache . _prefix + ".username" ) || "" ;
} ,
_getKeyPrefix : function ( ) {
return BI . Cache . getUsername ( ) + "." + BI . Cache . _prefix + "." ;
} ,
_generateKey : function ( key ) {
return BI . Cache . _getKeyPrefix ( ) + ( key || "" ) ;
} ,
getItem : function ( key ) {
return localStorage . getItem ( BI . Cache . _generateKey ( key ) ) ;
} ,
setItem : function ( key , value ) {
localStorage . setItem ( BI . Cache . _generateKey ( key ) , value ) ;
} ,
removeItem : function ( key ) {
localStorage . removeItem ( BI . Cache . _generateKey ( key ) ) ;
} ,
clear : function ( ) {
for ( var i = localStorage . length ; i >= 0 ; i -- ) {
var key = localStorage . key ( i ) ;
if ( key ) {
if ( key . indexOf ( BI . Cache . _getKeyPrefix ( ) ) === 0 ) {
localStorage . removeItem ( key ) ;
}
}
}
} ,
keys : function ( ) {
var result = [ ] ;
for ( var i = localStorage . length ; i >= 0 ; i -- ) {
var key = localStorage . key ( i ) ;
if ( key ) {
var prefix = BI . Cache . _getKeyPrefix ( ) ;
if ( key . indexOf ( prefix ) === 0 ) {
result [ result . length ] = key . substring ( prefix . length ) ;
}
}
}
return result ;
} ,
addCookie : function ( name , value , path , expiresHours ) {
var cookieString = name + "=" + escape ( value ) ;
// 判断是否设置过期时间
if ( expiresHours && expiresHours > 0 ) {
var date = new Date ( ) ;
// expires是标准GMT格式时间，应该使用时间戳作为起始时间
date . setTime ( date . getTime ( ) + expiresHours * 3600 * 1000 ) ;
cookieString = cookieString + "; expires=" + date . toUTCString ( ) ;
}
if ( path ) {
cookieString = cookieString + "; path=" + path ;
}
document . cookie = cookieString ;
} ,
getCookie : function ( name ) {
var arr , reg = new RegExp ( "(^| )" + name + "=([^;]*)(;|$)" ) ;
if ( arr = document . cookie . match ( reg ) ) { return unescape ( arr [ 2 ] ) ; }
return null ;
} ,
deleteCookie : function ( name , path ) {
var date = new Date ( ) ;
date . setTime ( date . getTime ( ) - 10000 ) ;
var cookieString = name + "=v; expires=" + date . toUTCString ( ) ;
if ( path ) {
cookieString = cookieString + "; path=" + path ;
}
document . cookie = cookieString ;
}
} ;
/***/ } ) ,
/***/ 112 :
/***/ ( function ( module , exports ) {
BI . CellSizeAndPositionManager = function ( cellCount , cellSizeGetter , estimatedCellSize ) {
this . _cellSizeGetter = cellSizeGetter ;
this . _cellCount = cellCount ;
this . _estimatedCellSize = estimatedCellSize ;
this . _cellSizeAndPositionData = { } ;
this . _lastMeasuredIndex = - 1 ;
} ;
BI . CellSizeAndPositionManager . prototype = {
constructor : BI . CellSizeAndPositionManager ,
configure : function ( cellCount , estimatedCellSize ) {
this . _cellCount = cellCount ;
this . _estimatedCellSize = estimatedCellSize ;
} ,
getCellCount : function ( ) {
return this . _cellCount ;
} ,
getEstimatedCellSize : function ( ) {
return this . _estimatedCellSize ;
} ,
getLastMeasuredIndex : function ( ) {
return this . _lastMeasuredIndex ;
} ,
getSizeAndPositionOfCell : function ( index ) {
if ( index < 0 || index >= this . _cellCount ) {
return ;
}
if ( index > this . _lastMeasuredIndex ) {
var lastMeasuredCellSizeAndPosition = this . getSizeAndPositionOfLastMeasuredCell ( ) ;
var offset = lastMeasuredCellSizeAndPosition . offset + lastMeasuredCellSizeAndPosition . size ;
for ( var i = this . _lastMeasuredIndex + 1 ; i <= index ; i ++ ) {
var size = this . _cellSizeGetter ( i ) ;
if ( size == null || isNaN ( size ) ) {
continue ;
}
this . _cellSizeAndPositionData [ i ] = {
offset : offset ,
size : size
} ;
offset += size ;
}
this . _lastMeasuredIndex = index ;
}
return this . _cellSizeAndPositionData [ index ] ;
} ,
getSizeAndPositionOfLastMeasuredCell : function ( ) {
return this . _lastMeasuredIndex >= 0
? this . _cellSizeAndPositionData [ this . _lastMeasuredIndex ]
: {
offset : 0 ,
size : 0
} ;
} ,
getTotalSize : function ( ) {
var lastMeasuredCellSizeAndPosition = this . getSizeAndPositionOfLastMeasuredCell ( ) ;
return lastMeasuredCellSizeAndPosition . offset + lastMeasuredCellSizeAndPosition . size + ( this . _cellCount - this . _lastMeasuredIndex - 1 ) * this . _estimatedCellSize ;
} ,
getUpdatedOffsetForIndex : function ( align , containerSize , currentOffset , targetIndex ) {
var datum = this . getSizeAndPositionOfCell ( targetIndex ) ;
var maxOffset = datum . offset ;
var minOffset = maxOffset - containerSize + datum . size ;
var idealOffset ;
switch ( align ) {
case "start" :
idealOffset = maxOffset ;
break ;
case "end" :
idealOffset = minOffset ;
break ;
case "center" :
idealOffset = maxOffset - ( ( containerSize - datum . size ) / 2 ) ;
break ;
default :
idealOffset = Math . max ( minOffset , Math . min ( maxOffset , currentOffset ) ) ;
break ;
}
var totalSize = this . getTotalSize ( ) ;
return Math . max ( 0 , Math . min ( totalSize - containerSize , idealOffset ) ) ;
} ,
getVisibleCellRange : function ( containerSize , offset ) {
var totalSize = this . getTotalSize ( ) ;
if ( totalSize === 0 ) {
return { } ;
}
var maxOffset = offset + containerSize ;
var start = this . _findNearestCell ( offset ) ;
var datum = this . getSizeAndPositionOfCell ( start ) ;
offset = datum . offset + datum . size ;
var stop = start ;
while ( offset < maxOffset && stop < this . _cellCount - 1 ) {
stop ++ ;
offset += this . getSizeAndPositionOfCell ( stop ) . size ;
}
return {
start : start ,
stop : stop
} ;
} ,
resetCell : function ( index ) {
this . _lastMeasuredIndex = Math . min ( this . _lastMeasuredIndex , index - 1 ) ;
} ,
_binarySearch : function ( high , low , offset ) {
var middle ;
var currentOffset ;
while ( low <= high ) {
middle = low + Math . floor ( ( high - low ) / 2 ) ;
currentOffset = this . getSizeAndPositionOfCell ( middle ) . offset ;
if ( currentOffset === offset ) {
return middle ;
} else if ( currentOffset < offset ) {
low = middle + 1 ;
} else if ( currentOffset > offset ) {
high = middle - 1 ;
}
}
if ( low > 0 ) {
return low - 1 ;
}
} ,
_exponentialSearch : function ( index , offset ) {
var interval = 1 ;
while ( index < this . _cellCount && this . getSizeAndPositionOfCell ( index ) . offset < offset ) {
index += interval ;
interval *= 2 ;
}
return this . _binarySearch ( Math . min ( index , this . _cellCount - 1 ) , Math . floor ( index / 2 ) , offset ) ;
} ,
_findNearestCell : function ( offset ) {
if ( isNaN ( offset ) ) {
return ;
}
offset = Math . max ( 0 , offset ) ;
var lastMeasuredCellSizeAndPosition = this . getSizeAndPositionOfLastMeasuredCell ( ) ;
var lastMeasuredIndex = Math . max ( 0 , this . _lastMeasuredIndex ) ;
if ( lastMeasuredCellSizeAndPosition . offset >= offset ) {
return this . _binarySearch ( lastMeasuredIndex , 0 , offset ) ;
}
return this . _exponentialSearch ( lastMeasuredIndex , offset ) ;
}
} ;
BI . ScalingCellSizeAndPositionManager = function ( cellCount , cellSizeGetter , estimatedCellSize , maxScrollSize ) {
this . _cellSizeAndPositionManager = new BI . CellSizeAndPositionManager ( cellCount , cellSizeGetter , estimatedCellSize ) ;
this . _maxScrollSize = maxScrollSize || 10000000 ;
} ;
BI . ScalingCellSizeAndPositionManager . prototype = {
constructor : BI . ScalingCellSizeAndPositionManager ,
configure : function ( ) {
this . _cellSizeAndPositionManager . configure . apply ( this . _cellSizeAndPositionManager , arguments ) ;
} ,
getCellCount : function ( ) {
return this . _cellSizeAndPositionManager . getCellCount ( ) ;
} ,
getEstimatedCellSize : function ( ) {
return this . _cellSizeAndPositionManager . getEstimatedCellSize ( ) ;
} ,
getLastMeasuredIndex : function ( ) {
return this . _cellSizeAndPositionManager . getLastMeasuredIndex ( ) ;
} ,
getOffsetAdjustment : function ( containerSize , offset ) {
var totalSize = this . _cellSizeAndPositionManager . getTotalSize ( ) ;
var safeTotalSize = this . getTotalSize ( ) ;
var offsetPercentage = this . _getOffsetPercentage ( containerSize , offset , safeTotalSize ) ;
return Math . round ( offsetPercentage * ( safeTotalSize - totalSize ) ) ;
} ,
getSizeAndPositionOfCell : function ( index ) {
return this . _cellSizeAndPositionManager . getSizeAndPositionOfCell ( index ) ;
} ,
getSizeAndPositionOfLastMeasuredCell : function ( ) {
return this . _cellSizeAndPositionManager . getSizeAndPositionOfLastMeasuredCell ( ) ;
} ,
getTotalSize : function ( ) {
return Math . min ( this . _maxScrollSize , this . _cellSizeAndPositionManager . getTotalSize ( ) ) ;
} ,
getUpdatedOffsetForIndex : function ( align , containerSize , currentOffset , targetIndex ) {
currentOffset = this . _safeOffsetToOffset ( containerSize , currentOffset ) ;
var offset = this . _cellSizeAndPositionManager . getUpdatedOffsetForIndex ( align , containerSize , currentOffset , targetIndex ) ;
return this . _offsetToSafeOffset ( containerSize , offset ) ;
} ,
getVisibleCellRange : function ( containerSize , offset ) {
offset = this . _safeOffsetToOffset ( containerSize , offset ) ;
return this . _cellSizeAndPositionManager . getVisibleCellRange ( containerSize , offset ) ;
} ,
resetCell : function ( index ) {
this . _cellSizeAndPositionManager . resetCell ( index ) ;
} ,
_getOffsetPercentage : function ( containerSize , offset , totalSize ) {
return totalSize <= containerSize
? 0
: offset / ( totalSize - containerSize ) ;
} ,
_offsetToSafeOffset : function ( containerSize , offset ) {
var totalSize = this . _cellSizeAndPositionManager . getTotalSize ( ) ;
var safeTotalSize = this . getTotalSize ( ) ;
if ( totalSize === safeTotalSize ) {
return offset ;
}
var offsetPercentage = this . _getOffsetPercentage ( containerSize , offset , totalSize ) ;
return Math . round ( offsetPercentage * ( safeTotalSize - containerSize ) ) ;
} ,
_safeOffsetToOffset : function ( containerSize , offset ) {
var totalSize = this . _cellSizeAndPositionManager . getTotalSize ( ) ;
var safeTotalSize = this . getTotalSize ( ) ;
if ( totalSize === safeTotalSize ) {
return offset ;
}
var offsetPercentage = this . _getOffsetPercentage ( containerSize , offset , safeTotalSize ) ;
return Math . round ( offsetPercentage * ( totalSize - containerSize ) ) ;
}
} ;
/***/ } ) ,
/***/ 113 :
/***/ ( function ( module , exports ) {
/ * *
* 汉字拼音索引
* /
! ( function ( ) {
var _ChineseFirstPY = " YDYQSXMWZSSXJBYMGCCZQPSSQBYCDSCDQLDYLYBSSJGYZZJJFKCCLZDHWDWZJLJPFYYNWJJTMYHZWZHFLZPPQHGSCYYYNJQYXXGJHHSDSJNKKTMOMLCRXYPSNQSECCQZGGLLYJLMYZZSECYKYYHQWJSSGGYXYZYJWWKDJHYCHMYXJTLXJYQBYXZLDWRDJRWYSRLDZJPCBZJJBRCFTLECZSTZFXXZHTRQHYBDLYCZSSYMMRFMYQZPWWJJYFCRWFDFZQPYDDWYXKYJAWJFFXYPSFTZYHHYZYSWCJYXSCLCXXWZZXNBGNNXBXLZSZSBSGPYSYZDHMDZBQBZCWDZZYYTZHBTSYYBZGNTNXQYWQSKBPHHLXGYBFMJEBJHHGQTJCYSXSTKZHLYCKGLYSMZXYALMELDCCXGZYRJXSDLTYZCQKCNNJWHJTZZCQLJSTSTBNXBTYXCEQXGKWJYFLZQLYHYXSPSFXLMPBYSXXXYDJCZYLLLSJXFHJXPJBTFFYABYXBHZZBJYZLWLCZGGBTSSMDTJZXPTHYQTGLJSCQFZKJZJQNLZWLSLHDZBWJNCJZYZSQQYCQYRZCJJWYBRTWPYFTWEXCSKDZCTBZHYZZYYJXZCFFZZMJYXXSDZZOTTBZLQWFCKSZSXFYRLNYJMBDTHJXSQQCCSBXYYTSYFBXDZTGBCNSLCYZZPSAZYZZSCJCSHZQYDXLBPJLLMQXTYDZXSQJTZPXLCGLQTZWJBHCTSYJSFXYEJJTLBGXSXJMYJQQPFZASYJNTYDJXKJCDJSZCBARTDCLYJQMWNQNCLLLKBYBZZSYHQQLTWLCCXTXLLZNTYLNEWYZYXCZXXGRKRMTCNDNJTSYYSSDQDGHSDBJGHRWRQLYBGLXHLGTGXBQJDZPYJSJYJCTMRNYMGRZJCZGJMZMGXMPRYXKJNYMSGMZJYMKMFXMLDTGFBHCJHKYLPFMDXLQJJSMTQGZSJLQDLDGJYCALCMZCSDJLLNXDJFFFFJCZFMZFFPFKHKGDPSXKTACJDHHZDDCRRCFQYJKQCCWJDXHWJLYLLZGCFCQDSMLZPBJJPLSBCJGGDCKKDEZSQCCKJGCGKDJTJDLZYCXKLQSCGJCLTFPCQCZGWPJDQYZJJBYJHSJDZWGFSJGZKQCCZLLPSPKJGQJHZZLJPLGJGJJTHJJYJZCZMLZLYQBGJWMLJKXZDZNJQSYZMLJLLJKYWXMKJLHSKJGBMCLYYMKXJQLBMLLKMDXXKWYXYSLMLPSJQQJQXYXFJTJDXMXXLLCXQBSYJBGWYMBGGBCYXPJYGPEPFGDJGBHBNSQJYZJKJKHXQFGQZKFHYGKHDKLLSDJQXPQYKYBNQSXQNSZSWHBSXWHXWBZZXDMNSJBSBKBBZKLYLXGWXDRWYQZMYWSJQLCJXXJXKJEQXSCYETLZHLYYYSDZPAQYZCMTLSHTZCFYZYXYLJSDCJQAGYSLCQLYYYSHMRQQKLDXZSCSSSYDYCJYSFSJBFRSSZQSBXXPXJYSDRCKGJLGDKZJZBDKTCSYQPYHSTCLDJDHMXMCGXYZHJDDTMHLTXZXYLYMOHYJCLTYFBQQXPFBDFHHTKSQHZYYWCNXXCRWHOWGYJLEGWDQCWGFJYCSNTMYTOLBYGWQWESJPWNMLRYDZSZTXYQPZGCWXHNGPYXSHMYQJXZTDPPBFYHZHTJYFDZWKGKZBLDNTSXHQEEGZZYLZMMZYJZGXZXKHKSTXNXXWYLYAPSTHXDWHZYMPXAGKYDXBHNHXKDPJNMYHYLPMGOCSLNZHKXXLPZZLBMLSFBHHGYGYYGGBHSCYAQTYWLXTZQCEZYDQDQMMHTKLLSZHLSJZWFYHQSWSCWLQAZYNYTLSXTHAZNKZZSZZLAXXZWWCTGQQTDDYZTCCHYQZFLXPSLZYGPZSZNGLNDQTBDLXGTCTAJDKYWNSYZLJHHZZCWNYYZYWMHYCHHYXHJKZWSXHZYXLYSKQYSPSLYZWMYPPKBYGLKZHTYXAXQSYSHXASMCHKDSCRSWJPWXSGZJLWWSCHSJHSQNHCSEGNDAQTBAALZZMSSTDQJCJKTSCJAXPLGGXHHGXXZCXPDMMHLDGTYBYSJMXHMRCPXXJZCKZXSHMLQXXTTHXWZFKHCCZDYTCJYXQHLXDHYPJQXYLSYYDZOZJNYXQEZYSQYAYXWYPDGXDDXSPPYZNDLTWRHXYDXZZJHTCXMCZLHPYYYYMHZLLHNXMYLLLMDCPPXHMXDKYCYRDLTXJCHHZZXZLCCLYLNZSHZJZZLNNRLWHYQSNJHXYNTTTKYJPYCHHYEGKCTTWLGQRLGGTGTYGYHPYHYLQYQGCWYQKPYYYTTTTLHYHLLTYTTSPLKYZXGZWGPYDSSZZDQXSKCQNMJJZZBXYQMJRTFFBTKHZKBXLJJKDXJTLBWFZPPTKQTZTGPDGNTPJYFALQMKGXBDCLZFHZCLLLLADPMXDJHLCCLGYHDZFGYDDGCYYFGYDXKSSEBDHYKDKDKHNAXXYBPBYYHXZQGAFFQYJXDMLJCSQZLLPCHBSXGJYNDYBYQSPZWJLZKSDDTACTBXZDYZYPJZQSJNKKTKNJDJGYYPGTLFYQKASDNTCYHBLWDZHBBYDWJRYGKZYHEYYFJMSDTYFZJJHGCXPLXHLDWXXJKYTCYKSSSMTWCTTQZLPBSZDZWZXGZAGYKTYWXLHLSPBCLLOQMMZSSLCMBJCSZZKYDCZJGQQDSMCYTZQQLWZQZXSSFPTTFQMDDZDSHDTDWFHTDYZJYQJQKYPBDJYYXTLJHDRQXXXHAYDHRJLKLYTWHLLRLLRCXYLBWSRSZZSYMKZZHHKYHXKSMDSYDYCJPBZBSQLFCXXXNXKXWYWSDZYQOGGQMMYHCDZTTFJYYBGSTTTYBYKJDHKYXBELHTYPJQNFXFDYKZHQKZBYJTZBXHFDXKDASWTAWAJLDYJSFHBLDNNTNQJTJNCHXFJSRFWHZFMDRYJYJWZPDJKZYJYMPCYZNYNXFBYTFYFWYGDBNZZZDNYTXZEMMQBSQEHXFZMBMFLZZSRXYMJGSXWZJSPRYDJSJGXHJJGLJJYNZZJXHGXKYMLPYYYCXYTWQZSWHWLYRJLPXSLSXMFSWWKLCTNXNYNPSJSZHDZEPTXMYYWXYYSYWLXJQZQXZDCLEEELMCPJPCLWBXSQHFWWTFFJTNQJHJQDXHWLBYZNFJLALKYYJLDXHHYCSTYYWNRJYXYWTRMDRQHWQCMFJDYZMHMYYXJWMYZQZXTLMRSPWWCHAQBXYGZYPXYYRRCLMPYMGKSJSZYSRMYJSNXTPLNBAPPYPYLXYYZKYNLDZYJZCZNNLMZHHARQMPGWQTZMXXMLLHGDZXYHXKYXYCJMFFYYHJFSBSSQLXXNDYCANNMTCJCYPRRNYTYQNYYMBMSXNDLYLYSLJRLXYSXQMLLYZLZJJJKYZZCSFBZXXMSTBJGNXYZHLXNMCWSCYZYFZLXBRNNNYLBNRTGZQYSATSWRYHYJZMZDHZGZDWYBSSCSKXSYHYTXXGCQGXZZSHYXJSCRHMKKBXCZJYJYMKQHZJFNBHMQHYSNJNZYBKNQMCLGQHWLZNZSWXKHLJHYYBQLBFCDSXDLDSPFZPSKJYZWZXZDDXJSMMEGJSCSSMGCLXXKYYYLNYPWWWGYDKZJGGGZGGSYCKNJWNJPCXBJJTQTJWDSSPJXZXNZXUMELPXFSXTLLXCLJXJJLJZXCTPSWXLYDHLYQRWHSYCSQYYBYAYWJJJQFWQCQQCJQGXALDBZZYJGKGXPLTZYFXJLTPADKYQHPMATLCPDCKBMTXYBHKLENXDLEEGQDYMSAWHZMLJTWYGXLYQZLJEEYYBQQFFNLYXRDSCTGJGXYYNKLLYQKCCTLHJLQMKKZGCYYGLLLJDZGYDHZWXPYSJBZKDZGYZZHYWYFQYTYZSZYEZZLYMHJJHTSMQWYZLKYYWZCSRKQYTLTDXWCTYJKLWSQZWBDCQYNCJSRSZJLKCDCDTLZZZACQQZZDDXYPLXZBQJYLZLLLQDDZQJYJYJZYXNYYYNYJXKXDAZWYRDLJYYYRJLXLLDYXJCYWYWNQCCLDDNYYYNYCKCZHXXCC
// 此处收录了375个多音字,数据来自于http://www.51windows.net/pages/pinyin.asp
var oMultiDiff = {
19969 : "DZ" ,
19975 : "WM" ,
19988 : "QJ" ,
20048 : "YL" ,
20056 : "SC" ,
20060 : "NM" ,
20094 : "QG" ,
20127 : "QJ" ,
20167 : "QC" ,
20193 : "YG" ,
20250 : "KH" ,
20256 : "ZC" ,
20282 : "SC" ,
20285 : "QJG" ,
20291 : "TD" ,
20314 : "YD" ,
20315 : "BF" ,
20340 : "NE" ,
20375 : "TD" ,
20389 : "YJ" ,
20391 : "CZ" ,
20415 : "PB" ,
20446 : "YS" ,
20447 : "SQ" ,
20504 : "TC" ,
20608 : "KG" ,
20854 : "QJ" ,
20857 : "ZC" ,
20911 : "PF" ,
20985 : "AW" ,
21032 : "PB" ,
21048 : "XQ" ,
21049 : "SC" ,
21089 : "YS" ,
21119 : "JC" ,
21242 : "SB" ,
21273 : "SC" ,
21305 : "YP" ,
21306 : "QO" ,
21330 : "ZC" ,
21333 : "SDC" ,
21345 : "QK" ,
21378 : "CA" ,
21397 : "SC" ,
21414 : "XS" ,
21442 : "SC" ,
21477 : "JG" ,
21480 : "TD" ,
21484 : "ZS" ,
21494 : "YX" ,
21505 : "YX" ,
21512 : "HG" ,
21523 : "XH" ,
21537 : "PB" ,
21542 : "PF" ,
21549 : "KH" ,
21571 : "E" ,
21574 : "DA" ,
21588 : "TD" ,
21589 : "O" ,
21618 : "ZC" ,
21621 : "KHA" ,
21632 : "ZJ" ,
21654 : "KG" ,
21679 : "LKG" ,
21683 : "KH" ,
21710 : "A" ,
21719 : "YH" ,
21734 : "WOE" ,
21769 : "A" ,
21780 : "WN" ,
21804 : "XH" ,
21834 : "A" ,
21899 : "ZD" ,
21903 : "RN" ,
21908 : "WO" ,
21939 : "ZC" ,
21956 : "SA" ,
21964 : "YA" ,
21970 : "TD" ,
22003 : "A" ,
22031 : "JG" ,
22040 : "XS" ,
22060 : "ZC" ,
22066 : "ZC" ,
22079 : "MH" ,
22129 : "XJ" ,
22179 : "XA" ,
22237 : "NJ" ,
22244 : "TD" ,
22280 : "JQ" ,
22300 : "YH" ,
22313 : "XW" ,
22331 : "YQ" ,
22343 : "YJ" ,
22351 : "PH" ,
22395 : "DC" ,
22412 : "TD" ,
22484 : "PB" ,
22500 : "PB" ,
22534 : "ZD" ,
22549 : "DH" ,
22561 : "PB" ,
22612 : "TD" ,
22771 : "KQ" ,
22831 : "HB" ,
22841 : "JG" ,
22855 : "QJ" ,
22865 : "XQ" ,
23013 : "ML" ,
23081 : "WM" ,
23487 : "SX" ,
23558 : "QJ" ,
23561 : "YW" ,
23586 : "YW" ,
23614 : "YW" ,
23615 : "SN" ,
23631 : "PB" ,
23646 : "ZS" ,
23663 : "ZT" ,
23673 : "YG" ,
23762 : "TD" ,
23769 : "ZS" ,
23780 : "QJ" ,
23884 : "QK" ,
24055 : "XH" ,
24113 : "DC" ,
24162 : "ZC" ,
24191 : "GA" ,
24273 : "QJ" ,
24324 : "NL" ,
24377 : "TD" ,
24378 : "QJ" ,
24439 : "PF" ,
24554 : "ZS" ,
24683 : "TD" ,
24694 : "WE" ,
24733 : "LK" ,
24925 : "TN" ,
25094 : "ZG" ,
25100 : "XQ" ,
25103 : "XH" ,
25153 : "PB" ,
25170 : "PB" ,
25179 : "KG" ,
25203 : "PB" ,
25240 : "ZS" ,
25282 : "FB" ,
25303 : "NA" ,
25324 : "KG" ,
25341 : "ZY" ,
25373 : "WZ" ,
25375 : "XJ" ,
25384 : "A" ,
25457 : "A" ,
25528 : "SD" ,
25530 : "SC" ,
25552 : "TD" ,
25774 : "ZC" ,
25874 : "ZC" ,
26044 : "YW" ,
26080 : "WM" ,
26292 : "PB" ,
26333 : "PB" ,
26355 : "ZY" ,
26366 : "CZ" ,
26397 : "ZC" ,
26399 : "QJ" ,
26415 : "ZS" ,
26451 : "SB" ,
26526 : "ZC" ,
26552 : "JG" ,
26561 : "TD" ,
26588 : "JG" ,
26597 : "CZ" ,
26629 : "ZS" ,
26638 : "YL" ,
26646 : "XQ" ,
26653 : "KG" ,
26657 : "XJ" ,
26727 : "HG" ,
26894 : "ZC" ,
26937 : "ZS" ,
26946 : "ZC" ,
26999 : "KJ" ,
27099 : "KJ" ,
27449 : "YQ" ,
27481 : "XS" ,
27542 : "ZS" ,
27663 : "ZS" ,
27748 : "TS" ,
27784 : "SC" ,
27788 : "ZD" ,
27795 : "TD" ,
27812 : "O" ,
27850 : "PB" ,
27852 : "MB" ,
27895 : "SL" ,
27898 : "PL" ,
27973 : "QJ" ,
27981 : "KH" ,
27986 : "HX" ,
27994 : "XJ" ,
28044 : "YC" ,
28065 : "WG" ,
28177 : "SM" ,
28267 : "QJ" ,
28291 : "KH" ,
28337 : "ZQ" ,
28463 : "TL" ,
28548 : "DC" ,
28601 : "TD" ,
28689 : "PB" ,
28805 : "JG" ,
28820 : "QG" ,
28846 : "PB" ,
28952 : "TD" ,
28975 : "ZC" ,
29100 : "A" ,
29325 : "QJ" ,
29575 : "SL" ,
29602 : "FB" ,
30010 : "TD" ,
30044 : "CX" ,
30058 : "PF" ,
30091 : "YSP" ,
30111 : "YN" ,
30229 : "XJ" ,
30427 : "SC" ,
30465 : "SX" ,
30631 : "YQ" ,
30655 : "QJ" ,
30684 : "QJG" ,
30707 : "SD" ,
30729 : "XH" ,
30796 : "LG" ,
30917 : "PB" ,
31074 : "NM" ,
31085 : "JZ" ,
31109 : "SC" ,
31181 : "ZC" ,
31192 : "MLB" ,
31293 : "JQ" ,
31400 : "YX" ,
31584 : "YJ" ,
31896 : "ZN" ,
31909 : "ZY" ,
31995 : "XJ" ,
32321 : "PF" ,
32327 : "ZY" ,
32418 : "HG" ,
32420 : "XQ" ,
32421 : "HG" ,
32438 : "LG" ,
32473 : "GJ" ,
32488 : "TD" ,
32521 : "QJ" ,
32527 : "PB" ,
32562 : "ZSQ" ,
32564 : "JZ" ,
32735 : "ZD" ,
32793 : "PB" ,
33071 : "PF" ,
33098 : "XL" ,
33100 : "YA" ,
33152 : "PB" ,
33261 : "CX" ,
33324 : "BP" ,
33333 : "TD" ,
33406 : "YA" ,
33426 : "WM" ,
33432 : "PB" ,
33445 : "JG" ,
33486 : "ZN" ,
33493 : "TS" ,
33507 : "QJ" ,
33540 : "QJ" ,
33544 : "ZC" ,
33564 : "XQ" ,
33617 : "YT" ,
33632 : "QJ" ,
33636 : "XH" ,
33637 : "YX" ,
33694 : "WG" ,
33705 : "PF" ,
33728 : "YW" ,
33882 : "SR" ,
34067 : "WM" ,
34074 : "YW" ,
34121 : "QJ" ,
34255 : "ZC" ,
34259 : "XL" ,
34425 : "JH" ,
34430 : "XH" ,
34485 : "KH" ,
34503 : "YS" ,
34532 : "HG" ,
34552 : "XS" ,
34558 : "YE" ,
34593 : "ZL" ,
34660 : "YQ" ,
34892 : "XH" ,
34928 : "SC" ,
34999 : "QJ" ,
35048 : "PB" ,
35059 : "SC" ,
35098 : "ZC" ,
35203 : "TQ" ,
35265 : "JX" ,
35299 : "JX" ,
35782 : "SZ" ,
35828 : "YS" ,
35830 : "E" ,
35843 : "TD" ,
35895 : "YG" ,
35977 : "MH" ,
36158 : "JG" ,
36228 : "QJ" ,
36426 : "XQ" ,
36466 : "DC" ,
36710 : "CJ" ,
36711 : "ZYG" ,
36767 : "PB" ,
36866 : "SK" ,
36951 : "YW" ,
37034 : "YX" ,
37063 : "XH" ,
37218 : "ZC" ,
37325 : "ZC" ,
38063 : "PB" ,
38079 : "TD" ,
38085 : "QY" ,
38107 : "DC" ,
38116 : "TD" ,
38123 : "YD" ,
38224 : "HG" ,
38241 : "XTC" ,
38271 : "ZC" ,
38415 : "YE" ,
38426 : "KH" ,
38461 : "YD" ,
38463 : "AE" ,
38466 : "PB" ,
38477 : "XJ" ,
38518 : "YT" ,
38551 : "WK" ,
38585 : "ZC" ,
38704 : "XS" ,
38739 : "LJ" ,
38761 : "GJ" ,
38808 : "SQ" ,
39048 : "JG" ,
39049 : "XJ" ,
39052 : "HG" ,
39076 : "CZ" ,
39271 : "XT" ,
39534 : "TD" ,
39552 : "TD" ,
39584 : "PB" ,
39647 : "SB" ,
39730 : "LG" ,
39748 : "TPB" ,
40109 : "ZQ" ,
40479 : "ND" ,
40516 : "HG" ,
40536 : "HG" ,
40583 : "QJ" ,
40765 : "YQ" ,
40784 : "QJ" ,
40840 : "YK" ,
40863 : "QJG"
} ;
var _checkPYCh = function ( ch ) {
var uni = ch . charCodeAt ( 0 ) ;
// 如果不在汉字处理范围之内,返回原字符,也可以调用自己的处理函数
if ( uni > 40869 || uni < 19968 ) { return ch ; } // dealWithOthers(ch);
return ( oMultiDiff [ uni ] ? oMultiDiff [ uni ] : ( _ChineseFirstPY . charAt ( uni - 19968 ) ) ) ;
} ;
var _mkPYRslt = function ( arr , options ) {
var ignoreMulti = options . ignoreMulti ;
var splitChar = options . splitChar ;
var arrRslt = [ "" ] , k , multiLen = 0 ;
for ( var i = 0 , len = arr . length ; i < len ; i ++ ) {
var str = arr [ i ] ;
var strlen = str . length ;
// 多音字过多的情况下，指数增长会造成浏览器卡死，超过20完全卡死，18勉强能用，考虑到不同性能最好是16或者14
// 超过14个多音字之后，后面的都用第一个拼音
if ( strlen == 1 || multiLen > 14 || ignoreMulti ) {
var tmpStr = str . substring ( 0 , 1 ) ;
for ( k = 0 ; k < arrRslt . length ; k ++ ) {
arrRslt [ k ] += tmpStr ;
}
} else {
var tmpArr = arrRslt . slice ( 0 ) ;
arrRslt = [ ] ;
multiLen ++ ;
for ( k = 0 ; k < strlen ; k ++ ) {
// 复制一个相同的arrRslt
var tmp = tmpArr . slice ( 0 ) ;
// 把当前字符str[k]添加到每个元素末尾
for ( var j = 0 ; j < tmp . length ; j ++ ) {
tmp [ j ] += str . charAt ( k ) ;
}
// 把复制并修改后的数组连接到arrRslt上
arrRslt = arrRslt . concat ( tmp ) ;
}
}
}
// BI-56386 这边直接将所有多音字组合拼接是有风险的，因为丢失了每一组的起始索引信息, 外部使用indexOf等方法会造成错位
// 一旦错位就可能认为不符合条件， 但实际上还是有可能符合条件的，故此处以一个无法搜索的不可见字符作为连接
return arrRslt . join ( splitChar || "" ) . toLowerCase ( ) ;
} ;
_ . extend ( BI , {
makeFirstPY : function ( str , options ) {
options = options || { } ;
if ( typeof ( str ) !== "string" ) { return "" + str ; }
var arrResult = [ ] ; // 保存中间结果的数组
for ( var i = 0 , len = str . length ; i < len ; i ++ ) {
// 获得unicode码
var ch = str . charAt ( i ) ;
// 检查该unicode码是否在处理范围之内,在则返回该码对映汉字的拼音首字母,不在则调用其它函数处理
arrResult . push ( _checkPYCh ( ch ) ) ;
}
// 处理arrResult,返回所有可能的拼音首字母串数组
return _mkPYRslt ( arrResult , options ) ;
}
} ) ;
} ) ( ) ;
/***/ } ) ,
/***/ 114 :
/***/ ( function ( module , exports ) {
( function ( ) {
function defaultComparator ( a , b ) {
return a < b ;
}
BI . Heap = function ( items , comparator ) {
this . _items = items || [ ] ;
this . _size = this . _items . length ;
this . _comparator = comparator || defaultComparator ;
this . _heapify ( ) ;
} ;
BI . Heap . prototype = {
constructor : BI . Heap ,
empty : function ( ) {
return this . _size === 0 ;
} ,
pop : function ( ) {
if ( this . _size === 0 ) {
return ;
}
var elt = this . _items [ 0 ] ;
var lastElt = this . _items . pop ( ) ;
this . _size -- ;
if ( this . _size > 0 ) {
this . _items [ 0 ] = lastElt ;
this . _sinkDown ( 0 ) ;
}
return elt ;
} ,
push : function ( item ) {
this . _items [ this . _size ++ ] = item ;
this . _bubbleUp ( this . _size - 1 ) ;
} ,
size : function ( ) {
return this . _size ;
} ,
peek : function ( ) {
if ( this . _size === 0 ) {
return ;
}
return this . _items [ 0 ] ;
} ,
_heapify : function ( ) {
for ( var index = Math . floor ( ( this . _size + 1 ) / 2 ) ; index >= 0 ; index -- ) {
this . _sinkDown ( index ) ;
}
} ,
_bubbleUp : function ( index ) {
var elt = this . _items [ index ] ;
while ( index > 0 ) {
var parentIndex = Math . floor ( ( index + 1 ) / 2 ) - 1 ;
var parentElt = this . _items [ parentIndex ] ;
// if parentElt < elt, stop
if ( this . _comparator ( parentElt , elt ) ) {
return ;
}
// swap
this . _items [ parentIndex ] = elt ;
this . _items [ index ] = parentElt ;
index = parentIndex ;
}
} ,
_sinkDown : function ( index ) {
var elt = this . _items [ index ] ;
while ( true ) {
var leftChildIndex = 2 * ( index + 1 ) - 1 ;
var rightChildIndex = 2 * ( index + 1 ) ;
var swapIndex = - 1 ;
if ( leftChildIndex < this . _size ) {
var leftChild = this . _items [ leftChildIndex ] ;
if ( this . _comparator ( leftChild , elt ) ) {
swapIndex = leftChildIndex ;
}
}
if ( rightChildIndex < this . _size ) {
var rightChild = this . _items [ rightChildIndex ] ;
if ( this . _comparator ( rightChild , elt ) ) {
if ( swapIndex === - 1 ||
this . _comparator ( rightChild , this . _items [ swapIndex ] ) ) {
swapIndex = rightChildIndex ;
}
}
}
// if we don't have a swap, stop
if ( swapIndex === - 1 ) {
return ;
}
this . _items [ index ] = this . _items [ swapIndex ] ;
this . _items [ swapIndex ] = elt ;
index = swapIndex ;
}
}
} ;
} ) ( ) ;
/***/ } ) ,
/***/ 115 :
/***/ ( function ( module , exports ) {
! ( function ( ) {
BI . LinkHashMap = function ( ) {
this . array = [ ] ;
this . map = { } ;
} ;
BI . LinkHashMap . prototype = {
constructor : BI . LinkHashMap ,
has : function ( key ) {
if ( key in this . map ) {
return true ;
}
return false ;
} ,
add : function ( key , value ) {
if ( typeof key === "undefined" ) {
return ;
}
if ( key in this . map ) {
this . map [ key ] = value ;
} else {
this . array . push ( key ) ;
this . map [ key ] = value ;
}
} ,
remove : function ( key ) {
if ( key in this . map ) {
delete this . map [ key ] ;
for ( var i = 0 ; i < this . array . length ; i ++ ) {
if ( this . array [ i ] == key ) {
this . array . splice ( i , 1 ) ;
break ;
}
}
}
} ,
size : function ( ) {
return this . array . length ;
} ,
each : function ( fn , scope ) {
var scope = scope || window ;
var fn = fn || null ;
if ( fn == null || typeof ( fn ) !== "function" ) {
return ;
}
for ( var i = 0 ; i < this . array . length ; i ++ ) {
var key = this . array [ i ] ;
var value = this . map [ key ] ;
var re = fn . call ( scope , key , value , i , this . array , this . map ) ;
if ( re == false ) {
break ;
}
}
} ,
get : function ( key ) {
return this . map [ key ] ;
} ,
toArray : function ( ) {
var array = [ ] ;
this . each ( function ( key , value ) {
array . push ( value ) ;
} ) ;
return array ;
}
} ;
} ) ( ) ;
/***/ } ) ,
/***/ 116 :
/***/ ( function ( module , exports ) {
! ( function ( ) {
BI . LRU = function ( limit ) {
this . size = 0 ;
this . limit = limit ;
this . head = this . tail = undefined ;
this . _keymap = { } ;
} ;
var p = BI . LRU . prototype ;
p . put = function ( key , value ) {
var removed ;
if ( this . size === this . limit ) {
removed = this . shift ( ) ;
}
var entry = this . get ( key , true ) ;
if ( ! entry ) {
entry = {
key : key
} ;
this . _keymap [ key ] = entry ;
if ( this . tail ) {
this . tail . newer = entry ;
entry . older = this . tail ;
} else {
this . head = entry ;
}
this . tail = entry ;
this . size ++ ;
}
entry . value = value ;
return removed ;
} ;
p . shift = function ( ) {
var entry = this . head ;
if ( entry ) {
this . head = this . head . newer ;
this . head . older = undefined ;
entry . newer = entry . older = undefined ;
this . _keymap [ entry . key ] = undefined ;
this . size -- ;
}
return entry ;
} ;
p . get = function ( key , returnEntry ) {
var entry = this . _keymap [ key ] ;
if ( entry === undefined ) return ;
if ( entry === this . tail ) {
return returnEntry
? entry
: entry . value ;
}
// HEAD--------------TAIL
// <.older .newer>
// <--- add direction --
// A B C <D> E
if ( entry . newer ) {
if ( entry === this . head ) {
this . head = entry . newer ;
}
entry . newer . older = entry . older ; // C <-- E.
}
if ( entry . older ) {
entry . older . newer = entry . newer ; // C. --> E
}
entry . newer = undefined ; // D --x
entry . older = this . tail ; // D. --> E
if ( this . tail ) {
this . tail . newer = entry ; // E. <-- D
}
this . tail = entry ;
return returnEntry
? entry
: entry . value ;
} ;
p . has = function ( key ) {
return this . _keymap [ key ] != null ;
} ;
} ) ( ) ;
/***/ } ) ,
/***/ 117 :
/***/ ( function ( module , exports ) {
// 线段树
( function ( ) {
var parent = function ( node ) {
return Math . floor ( node / 2 ) ;
} ;
var Int32Array = _global . Int32Array || function ( size ) {
var xs = [ ] ;
for ( var i = size - 1 ; i >= 0 ; -- i ) {
xs [ i ] = 0 ;
}
return xs ;
} ;
var ceilLog2 = function ( x ) {
var y = 1 ;
while ( y < x ) {
y *= 2 ;
}
return y ;
} ;
BI . PrefixIntervalTree = function ( xs ) {
this . _size = xs . length ;
this . _half = ceilLog2 ( this . _size ) ;
// _heap是一个_size两倍以上的堆
this . _heap = new Int32Array ( 2 * this . _half ) ;
var i ;
// 初始化 >= _size 的堆空间, 即叶子节点
for ( i = 0 ; i < this . _size ; ++ i ) {
this . _heap [ this . _half + i ] = xs [ i ] ;
}
// 初始化 < _size 的堆空间, 即非叶子节点，根节点包含整个区间
for ( i = this . _half - 1 ; i > 0 ; -- i ) {
this . _heap [ i ] = this . _heap [ 2 * i ] + this . _heap [ 2 * i + 1 ] ;
}
} ;
BI . PrefixIntervalTree . prototype = {
constructor : BI . PrefixIntervalTree ,
// 往_half之后的空间set值，需要更新其所有祖先节点的值
set : function ( index , value ) {
var node = this . _half + index ;
this . _heap [ node ] = value ;
node = parent ( node ) ;
for ( ; node !== 0 ; node = parent ( node ) ) {
this . _heap [ node ] =
this . _heap [ 2 * node ] + this . _heap [ 2 * node + 1 ] ;
}
} ,
get : function ( index ) {
var node = this . _half + index ;
return this . _heap [ node ] ;
} ,
getSize : function ( ) {
return this . _size ;
} ,
/ * *
* get ( 0 ) + get ( 1 ) + ... + get ( end - 1 ) .
* /
sumUntil : function ( end ) {
if ( end === 0 ) {
return 0 ;
}
var node = this . _half + end - 1 ;
var sum = this . _heap [ node ] ;
for ( ; node !== 1 ; node = parent ( node ) ) {
if ( node % 2 === 1 ) {
sum += this . _heap [ node - 1 ] ;
}
}
return sum ;
} ,
/ * *
* get ( 0 ) + get ( 1 ) + ... + get ( inclusiveEnd ) .
* /
sumTo : function ( inclusiveEnd ) {
return this . sumUntil ( inclusiveEnd + 1 ) ;
} ,
/ * *
* sum get ( begin ) + get ( begin + 1 ) + ... + get ( end - 1 ) .
* /
sum : function ( begin , end ) {
return this . sumUntil ( end ) - this . sumUntil ( begin ) ;
} ,
/ * *
* Returns the smallest i such that 0 <= i <= size and sumUntil ( i ) <= t , or
* - 1 if no such i exists .
* /
greatestLowerBound : function ( t ) {
if ( t < 0 ) {
return - 1 ;
}
var node = 1 ;
if ( this . _heap [ node ] <= t ) {
return this . _size ;
}
while ( node < this . _half ) {
var leftSum = this . _heap [ 2 * node ] ;
if ( t < leftSum ) {
node = 2 * node ;
} else {
node = 2 * node + 1 ;
t -= leftSum ;
}
}
return node - this . _half ;
} ,
/ * *
* Returns the smallest i such that 0 <= i <= size and sumUntil ( i ) < t , or
* - 1 if no such i exists .
* /
greatestStrictLowerBound : function ( t ) {
if ( t <= 0 ) {
return - 1 ;
}
var node = 1 ;
if ( this . _heap [ node ] < t ) {
return this . _size ;
}
while ( node < this . _half ) {
var leftSum = this . _heap [ 2 * node ] ;
if ( t <= leftSum ) {
node = 2 * node ;
} else {
node = 2 * node + 1 ;
t -= leftSum ;
}
}
return node - this . _half ;
} ,
/ * *
* Returns the smallest i such that 0 <= i <= size and t <= sumUntil ( i ) , or
* size + 1 if no such i exists .
* /
leastUpperBound : function ( t ) {
return this . greatestStrictLowerBound ( t ) + 1 ;
} ,
/ * *
* Returns the smallest i such that 0 <= i <= size and t < sumUntil ( i ) , or
* size + 1 if no such i exists .
* /
leastStrictUpperBound : function ( t ) {
return this . greatestLowerBound ( t ) + 1 ;
}
} ;
BI . PrefixIntervalTree . uniform = function ( size , initialValue ) {
var xs = [ ] ;
for ( var i = size - 1 ; i >= 0 ; -- i ) {
xs [ i ] = initialValue ;
}
return new BI . PrefixIntervalTree ( xs ) ;
} ;
BI . PrefixIntervalTree . empty = function ( size ) {
return BI . PrefixIntervalTree . uniform ( size , 0 ) ;
} ;
} ) ( ) ;
/***/ } ) ,
/***/ 118 :
/***/ ( function ( module , exports ) {
! ( function ( ) {
BI . Queue = function ( capacity ) {
this . capacity = capacity ;
this . array = [ ] ;
} ;
BI . Queue . prototype = {
constructor : BI . Queue ,
contains : function ( v ) {
return BI . contains ( this . array , v ) ;
} ,
indexOf : function ( v ) {
return BI . contains ( this . array , v ) ;
} ,
getElementByIndex : function ( index ) {
return this . array [ index ] ;
} ,
push : function ( v ) {
this . array . push ( v ) ;
if ( this . capacity && this . array . length > this . capacity ) {
this . array . shift ( ) ;
}
} ,
pop : function ( ) {
this . array . pop ( ) ;
} ,
shift : function ( ) {
this . array . shift ( ) ;
} ,
unshift : function ( v ) {
this . array . unshift ( v ) ;
if ( this . capacity && this . array . length > this . capacity ) {
this . array . pop ( ) ;
}
} ,
remove : function ( v ) {
BI . remove ( this . array , v ) ;
} ,
splice : function ( ) {
this . array . splice . apply ( this . array , arguments ) ;
} ,
slice : function ( ) {
this . array . slice . apply ( this . array , arguments ) ;
} ,
size : function ( ) {
return this . array . length ;
} ,
each : function ( fn , scope ) {
var scope = scope || window ;
var fn = fn || null ;
if ( fn == null || typeof ( fn ) !== "function" ) {
return ;
}
for ( var i = 0 ; i < this . array . length ; i ++ ) {
var re = fn . call ( scope , i , this . array [ i ] , this . array ) ;
if ( re == false ) {
break ;
}
}
} ,
toArray : function ( ) {
return this . array ;
} ,
fromArray : function ( array ) {
var self = this ;
BI . each ( array , function ( i , v ) {
self . push ( v ) ;
} ) ;
} ,
clear : function ( ) {
this . array . length = 0 ;
}
} ;
} ) ( ) ;
/***/ } ) ,
/***/ 119 :
/***/ ( function ( module , exports ) {
! ( function ( ) {
var Section = function ( height , width , x , y ) {
this . height = height ;
this . width = width ;
this . x = x ;
this . y = y ;
this . _indexMap = { } ;
this . _indices = [ ] ;
} ;
Section . prototype = {
constructor : Section ,
addCellIndex : function ( index ) {
if ( ! this . _indexMap [ index ] ) {
this . _indexMap [ index ] = true ;
this . _indices . push ( index ) ;
}
} ,
getCellIndices : function ( ) {
return this . _indices ;
}
} ;
var SECTION _SIZE = 100 ;
BI . SectionManager = function ( sectionSize ) {
this . _sectionSize = sectionSize || SECTION _SIZE ;
this . _cellMetadata = [ ] ;
this . _sections = { } ;
} ;
BI . SectionManager . prototype = {
constructor : BI . SectionManager ,
getCellIndices : function ( height , width , x , y ) {
var indices = { } ;
BI . each ( this . getSections ( height , width , x , y ) , function ( i , section ) {
BI . each ( section . getCellIndices ( ) , function ( j , index ) {
indices [ index ] = index ;
} ) ;
} ) ;
return BI . map ( BI . keys ( indices ) , function ( i , index ) {
return indices [ index ] ;
} ) ;
} ,
getCellMetadata : function ( index ) {
return this . _cellMetadata [ index ] ;
} ,
getSections : function ( height , width , x , y ) {
var sectionXStart = Math . floor ( x / this . _sectionSize ) ;
var sectionXStop = Math . floor ( ( x + width - 1 ) / this . _sectionSize ) ;
var sectionYStart = Math . floor ( y / this . _sectionSize ) ;
var sectionYStop = Math . floor ( ( y + height - 1 ) / this . _sectionSize ) ;
var sections = [ ] ;
for ( var sectionX = sectionXStart ; sectionX <= sectionXStop ; sectionX ++ ) {
for ( var sectionY = sectionYStart ; sectionY <= sectionYStop ; sectionY ++ ) {
var key = sectionX + "." + sectionY ;
if ( ! this . _sections [ key ] ) {
this . _sections [ key ] = new Section ( this . _sectionSize , this . _sectionSize , sectionX * this . _sectionSize , sectionY * this . _sectionSize ) ;
}
sections . push ( this . _sections [ key ] ) ;
}
}
return sections ;
} ,
getTotalSectionCount : function ( ) {
return BI . size ( this . _sections ) ;
} ,
registerCell : function ( cellMetadatum , index ) {
this . _cellMetadata [ index ] = cellMetadatum ;
BI . each ( this . getSections ( cellMetadatum . height , cellMetadatum . width , cellMetadatum . x , cellMetadatum . y ) , function ( i , section ) {
section . addCellIndex ( index ) ;
} ) ;
}
} ;
} ) ( ) ;
/***/ } ) ,
/***/ 120 :
/***/ ( function ( module , exports ) {
( function ( ) {
BI . Tree = function ( ) {
this . root = new BI . Node ( BI . UUID ( ) ) ;
} ;
BI . Tree . prototype = {
constructor : BI . Tree ,
addNode : function ( node , newNode , index ) {
if ( BI . isNull ( newNode ) ) {
this . root . addChild ( node , index ) ;
} else if ( BI . isNull ( node ) ) {
this . root . addChild ( newNode , index ) ;
} else {
node . addChild ( newNode , index ) ;
}
} ,
isRoot : function ( node ) {
return node === this . root ;
} ,
getRoot : function ( ) {
return this . root ;
} ,
clear : function ( ) {
this . root . clear ( ) ;
} ,
initTree : function ( nodes ) {
var self = this ;
this . clear ( ) ;
var queue = [ ] ;
BI . each ( nodes , function ( i , node ) {
var n = new BI . Node ( node ) ;
n . set ( "data" , node ) ;
self . addNode ( n ) ;
queue . push ( n ) ;
} ) ;
while ( ! BI . isEmpty ( queue ) ) {
var parent = queue . shift ( ) ;
var node = parent . get ( "data" ) ;
BI . each ( node . children , function ( i , child ) {
var n = new BI . Node ( child ) ;
n . set ( "data" , child ) ;
queue . push ( n ) ;
self . addNode ( parent , n ) ;
} ) ;
}
} ,
_toJSON : function ( node ) {
var self = this ;
var children = [ ] ;
BI . each ( node . getChildren ( ) , function ( i , child ) {
children . push ( self . _toJSON ( child ) ) ;
} ) ;
return BI . extend ( {
id : node . id
} , BI . deepClone ( node . get ( "data" ) ) , ( children . length > 0 ? {
children : children
} : { } ) ) ;
} ,
toJSON : function ( node ) {
var self = this , result = [ ] ;
BI . each ( ( node || this . root ) . getChildren ( ) , function ( i , child ) {
result . push ( self . _toJSON ( child ) ) ;
} ) ;
return result ;
} ,
_toJSONWithNode : function ( node ) {
var self = this ;
var children = [ ] ;
BI . each ( node . getChildren ( ) , function ( i , child ) {
children . push ( self . _toJSONWithNode ( child ) ) ;
} ) ;
return BI . extend ( {
id : node . id
} , BI . deepClone ( node . get ( "data" ) ) , {
node : node
} , ( children . length > 0 ? {
children : children
} : { } ) ) ;
} ,
toJSONWithNode : function ( node ) {
var self = this , result = [ ] ;
BI . each ( ( node || this . root ) . getChildren ( ) , function ( i , child ) {
result . push ( self . _toJSONWithNode ( child ) ) ;
} ) ;
return result ;
} ,
search : function ( root , target , param ) {
if ( ! ( root instanceof BI . Node ) ) {
return arguments . callee . apply ( this , [ this . root , root , target ] ) ;
}
var self = this , next = null ;
if ( BI . isNull ( target ) ) {
return null ;
}
if ( BI . isEqual ( root [ param || "id" ] , target ) ) {
return root ;
}
BI . any ( root . getChildren ( ) , function ( i , child ) {
next = self . search ( child , target , param ) ;
if ( null !== next ) {
return true ;
}
} ) ;
return next ;
} ,
_traverse : function ( node , callback ) {
var queue = [ ] ;
queue . push ( node ) ;
while ( ! BI . isEmpty ( queue ) ) {
var temp = queue . shift ( ) ;
var b = callback && callback ( temp ) ;
if ( b === false ) {
break ;
}
if ( b === true ) {
continue ;
}
if ( temp != null ) {
queue = queue . concat ( temp . getChildren ( ) ) ;
}
}
} ,
traverse : function ( callback ) {
this . _traverse ( this . root , callback ) ;
} ,
_recursion : function ( node , route , callback ) {
var self = this ;
return BI . every ( node . getChildren ( ) , function ( i , child ) {
var next = BI . clone ( route ) ;
next . push ( child . id ) ;
var b = callback && callback ( child , next ) ;
if ( b === false ) {
return false ;
}
if ( b === true ) {
return true ;
}
return self . _recursion ( child , next , callback ) ;
} ) ;
} ,
recursion : function ( callback ) {
this . _recursion ( this . root , [ ] , callback ) ;
} ,
inOrderTraverse : function ( callback ) {
this . _inOrderTraverse ( this . root , callback ) ;
} ,
// 中序遍历(递归)
_inOrderTraverse : function ( node , callback ) {
if ( node != null ) {
this . _inOrderTraverse ( node . getLeft ( ) ) ;
callback && callback ( node ) ;
this . _inOrderTraverse ( node . getRight ( ) ) ;
}
} ,
// 中序遍历(非递归)
nrInOrderTraverse : function ( callback ) {
var stack = [ ] ;
var node = this . root ;
while ( node != null || ! BI . isEmpty ( stack ) ) {
while ( node != null ) {
stack . push ( node ) ;
node = node . getLeft ( ) ;
}
node = stack . pop ( ) ;
callback && callback ( node ) ;
node = node . getRight ( ) ;
}
} ,
preOrderTraverse : function ( callback ) {
this . _preOrderTraverse ( this . root , callback ) ;
} ,
// 先序遍历(递归)
_preOrderTraverse : function ( node , callback ) {
if ( node != null ) {
callback && callback ( node ) ;
this . _preOrderTraverse ( node . getLeft ( ) ) ;
this . _preOrderTraverse ( node . getRight ( ) ) ;
}
} ,
// 先序遍历（非递归）
nrPreOrderTraverse : function ( callback ) {
var stack = [ ] ;
var node = this . root ;
while ( node != null || ! BI . isEmpty ( stack ) ) {
while ( node != null ) {
callback && callback ( node ) ;
stack . push ( node ) ;
node = node . getLeft ( ) ;
}
node = stack . pop ( ) ;
node = node . getRight ( ) ;
}
} ,
postOrderTraverse : function ( callback ) {
this . _postOrderTraverse ( this . root , callback ) ;
} ,
// 后序遍历(递归)
_postOrderTraverse : function ( node , callback ) {
if ( node != null ) {
this . _postOrderTraverse ( node . getLeft ( ) ) ;
this . _postOrderTraverse ( node . getRight ( ) ) ;
callback && callback ( node ) ;
}
} ,
// 后续遍历(非递归)
nrPostOrderTraverse : function ( callback ) {
var stack = [ ] ;
var node = this . root ;
var preNode = null ; // 表示最近一次访问的节点
while ( node != null || ! BI . isEmpty ( stack ) ) {
while ( node != null ) {
stack . push ( node ) ;
node = node . getLeft ( ) ;
}
node = BI . last ( stack ) ;
if ( node . getRight ( ) == null || node . getRight ( ) == preNode ) {
callback && callback ( node ) ;
node = stack . pop ( ) ;
preNode = node ;
node = null ;
} else {
node = node . getRight ( ) ;
}
}
}
} ;
BI . Node = function ( id ) {
if ( BI . isObject ( id ) ) {
BI . extend ( this , id ) ;
} else {
this . id = id ;
}
this . clear . apply ( this , arguments ) ;
} ;
BI . Node . prototype = {
constructor : BI . Node ,
set : function ( key , value ) {
if ( BI . isObject ( key ) ) {
BI . extend ( this , key ) ;
return ;
}
this [ key ] = value ;
} ,
get : function ( key ) {
return this [ key ] ;
} ,
isLeaf : function ( ) {
return BI . isEmpty ( this . children ) ;
} ,
getChildren : function ( ) {
return this . children ;
} ,
getChildrenLength : function ( ) {
return this . children . length ;
} ,
getFirstChild : function ( ) {
return BI . first ( this . children ) ;
} ,
getLastChild : function ( ) {
return BI . last ( this . children ) ;
} ,
setLeft : function ( left ) {
this . left = left ;
} ,
getLeft : function ( ) {
return this . left ;
} ,
setRight : function ( right ) {
this . right = right ;
} ,
getRight : function ( ) {
return this . right ;
} ,
setParent : function ( parent ) {
this . parent = parent ;
} ,
getParent : function ( ) {
return this . parent ;
} ,
getChild : function ( index ) {
return this . children [ index ] ;
} ,
getChildIndex : function ( id ) {
return BI . findIndex ( this . children , function ( i , ch ) {
return ch . get ( "id" ) === id ;
} ) ;
} ,
removeChild : function ( id ) {
this . removeChildByIndex ( this . getChildIndex ( id ) ) ;
} ,
removeChildByIndex : function ( index ) {
var before = this . getChild ( index - 1 ) ;
var behind = this . getChild ( index + 1 ) ;
if ( before != null ) {
before . setRight ( behind || null ) ;
}
if ( behind != null ) {
behind . setLeft ( before || null ) ;
}
this . children . splice ( index , 1 ) ;
} ,
removeAllChilds : function ( ) {
this . children = [ ] ;
} ,
addChild : function ( child , index ) {
var cur = null ;
if ( BI . isUndefined ( index ) ) {
cur = this . children . length - 1 ;
} else {
cur = index - 1 ;
}
child . setParent ( this ) ;
if ( cur >= 0 ) {
this . getChild ( cur ) && this . getChild ( cur ) . setRight ( child ) ;
child . setLeft ( this . getChild ( cur ) ) ;
}
if ( BI . isUndefined ( index ) ) {
this . children . push ( child ) ;
} else {
this . children . splice ( index , 0 , child ) ;
}
} ,
equals : function ( obj ) {
return this === obj || this . id === obj . id ;
} ,
clear : function ( ) {
this . parent = null ;
this . left = null ;
this . right = null ;
this . children = [ ] ;
}
} ;
BI . extend ( BI . Tree , {
transformToArrayFormat : function ( nodes , pId ) {
if ( ! nodes ) return [ ] ;
var r = [ ] ;
if ( BI . isArray ( nodes ) ) {
for ( var i = 0 , l = nodes . length ; i < l ; i ++ ) {
var node = BI . clone ( nodes [ i ] ) ;
node . pId = node . pId == null ? pId : node . pId ;
delete node . children ;
r . push ( node ) ;
if ( nodes [ i ] [ "children" ] ) {
r = r . concat ( BI . Tree . transformToArrayFormat ( nodes [ i ] [ "children" ] , node . id ) ) ;
}
}
} else {
var newNodes = BI . clone ( nodes ) ;
newNodes . pId = newNodes . pId == null ? pId : newNodes . pId ;
delete newNodes . children ;
r . push ( newNodes ) ;
if ( nodes [ "children" ] ) {
r = r . concat ( BI . Tree . transformToArrayFormat ( nodes [ "children" ] , newNodes . id ) ) ;
}
}
return r ;
} ,
arrayFormat : function ( nodes , pId ) {
if ( ! nodes ) {
return [ ] ;
}
var r = [ ] ;
if ( BI . isArray ( nodes ) ) {
for ( var i = 0 , l = nodes . length ; i < l ; i ++ ) {
var node = nodes [ i ] ;
node . pId = node . pId == null ? pId : node . pId ;
r . push ( node ) ;
if ( nodes [ i ] [ "children" ] ) {
r = r . concat ( BI . Tree . arrayFormat ( nodes [ i ] [ "children" ] , node . id ) ) ;
}
}
} else {
var newNodes = nodes ;
newNodes . pId = newNodes . pId == null ? pId : newNodes . pId ;
r . push ( newNodes ) ;
if ( nodes [ "children" ] ) {
r = r . concat ( BI . Tree . arrayFormat ( nodes [ "children" ] , newNodes . id ) ) ;
}
}
return r ;
} ,
transformToTreeFormat : function ( sNodes ) {
var i , l ;
if ( ! sNodes ) {
return [ ] ;
}
if ( BI . isArray ( sNodes ) ) {
var r = [ ] ;
var tmpMap = { } ;
for ( i = 0 , l = sNodes . length ; i < l ; i ++ ) {
if ( BI . isNull ( sNodes [ i ] . id ) ) {
return sNodes ;
}
tmpMap [ sNodes [ i ] . id ] = BI . clone ( sNodes [ i ] ) ;
}
for ( i = 0 , l = sNodes . length ; i < l ; i ++ ) {
if ( tmpMap [ sNodes [ i ] . pId ] && sNodes [ i ] . id !== sNodes [ i ] . pId ) {
if ( ! tmpMap [ sNodes [ i ] . pId ] . children ) {
tmpMap [ sNodes [ i ] . pId ] . children = [ ] ;
}
tmpMap [ sNodes [ i ] . pId ] . children . push ( tmpMap [ sNodes [ i ] . id ] ) ;
} else {
r . push ( tmpMap [ sNodes [ i ] . id ] ) ;
}
delete tmpMap [ sNodes [ i ] . id ] . pId ;
}
return r ;
}
return [ sNodes ] ;
} ,
treeFormat : function ( sNodes ) {
var i , l ;
if ( ! sNodes ) {
return [ ] ;
}
if ( BI . isArray ( sNodes ) ) {
var r = [ ] ;
var tmpMap = { } ;
for ( i = 0 , l = sNodes . length ; i < l ; i ++ ) {
if ( BI . isNull ( sNodes [ i ] . id ) ) {
return sNodes ;
}
tmpMap [ sNodes [ i ] . id ] = sNodes [ i ] ;
}
for ( i = 0 , l = sNodes . length ; i < l ; i ++ ) {
if ( tmpMap [ sNodes [ i ] . pId ] && sNodes [ i ] . id !== sNodes [ i ] . pId ) {
if ( ! tmpMap [ sNodes [ i ] . pId ] . children ) {
tmpMap [ sNodes [ i ] . pId ] . children = [ ] ;
}
tmpMap [ sNodes [ i ] . pId ] . children . push ( tmpMap [ sNodes [ i ] . id ] ) ;
} else {
r . push ( tmpMap [ sNodes [ i ] . id ] ) ;
}
}
return r ;
}
return [ sNodes ] ;
} ,
traversal : function ( array , callback , pNode ) {
if ( BI . isNull ( array ) ) {
return ;
}
var self = this ;
BI . some ( array , function ( i , item ) {
if ( callback ( i , item , pNode ) === false ) {
return true ;
}
self . traversal ( item . children , callback , item ) ;
} ) ;
}
} ) ;
} ) ( ) ;
/***/ } ) ,
/***/ 121 :
/***/ ( function ( module , exports ) {
// 向量操作
BI . Vector = function ( x , y ) {
this . x = x ;
this . y = y ;
} ;
BI . Vector . prototype = {
constructor : BI . Vector ,
cross : function ( v ) {
return ( this . x * v . y - this . y * v . x ) ;
} ,
length : function ( v ) {
return ( Math . sqrt ( this . x * v . x + this . y * v . y ) ) ;
}
} ;
BI . Region = function ( x , y , w , h ) {
this . x = x ;
this . y = y ;
this . w = w ;
this . h = h ;
} ;
BI . Region . prototype = {
constructor : BI . Region ,
// 判断两个区域是否相交，若相交，则要么顶点互相包含，要么矩形边界（或对角线）相交
isIntersects : function ( obj ) {
if ( this . isPointInside ( obj . x , obj . y ) ||
this . isPointInside ( obj . x + obj . w , obj . y ) ||
this . isPointInside ( obj . x , obj . y + obj . h ) ||
this . isPointInside ( obj . x + obj . w , obj . y + obj . h ) ) {
return true ;
} else if ( obj . isPointInside ( this . x , this . y ) ||
obj . isPointInside ( this . x + this . w , this . y ) ||
obj . isPointInside ( this . x , this . y + this . h ) ||
obj . isPointInside ( this . x + this . w , this . y + this . h ) ) {
return true ;
} else if ( obj . x != null && obj . y != null ) // 判断矩形对角线相交 |v1 X v2||v1 X v3| < 0
{
var vector1 = new BI . Vector ( this . w , this . h ) ; // 矩形对角线向量
var vector2 = new BI . Vector ( obj . x - this . x , obj . y - this . y ) ;
var vector3 = new BI . Vector ( vector2 . x + obj . w , vector2 . y + obj . h ) ;
if ( ( vector1 . cross ( vector2 ) * vector1 . cross ( vector3 ) ) < 0 ) {
return true ;
}
}
return false ;
} ,
// 判断一个点是否在这个区域内部
isPointInside : function ( x , y ) {
if ( this . x == null || this . y == null ) {
return false ;
}
if ( x >= this . x && x <= this . x + this . w && y >= this . y && y <= this . y + this . h ) {
return true ;
}
return false ;
} ,
// 返回区域的重心，因为是矩形所以返回中点
getPosition : function ( ) {
var pos = [ ] ;
pos . push ( this . x + this . w / 2 ) ;
pos . push ( this . y + this . h / 2 ) ;
return pos ;
}
} ;
/***/ } ) ,
/***/ 122 :
/***/ ( function ( module , exports , _ _webpack _require _ _ ) {
/* WEBPACK VAR INJECTION */ ( function ( global ) { ( function ( ) {
var _global ;
if ( typeof window !== "undefined" ) {
_global = window ;
} else if ( typeof global !== "undefined" ) {
_global = global ;
} else if ( typeof self !== "undefined" ) {
_global = self ;
} else {
_global = this ;
}
if ( ! _global . BI ) {
_global . BI = { } ;
}
function isEmpty ( value ) {
// 判断是否为空值
var result = value === "" || value === null || value === undefined ;
return result ;
}
// 判断是否是无效的日期
function isInvalidDate ( date ) {
return date == "Invalid Date" || date == "NaN" ;
}
/ * *
* CHART - 1400
* 使用数值计算的方式来获取任意数值的科学技术表示值 。
* 科学计数格式
* /
function _eFormat ( text , fmt ) {
text = + text ;
return eFormat ( text , fmt ) ;
/ * *
* 科学计数格式具体计算过程
* @ param num
* @ param format { String } 有两种形式 ，
* 1 、 "0.00E00" 这样的字符串表示正常的科学计数表示 ， 只不过规定了数值精确到百分位 ，
* 而数量级的绝对值如果是10以下的时候在前面补零 。
* 2 、 "##0.0E0" 这样的字符串则规定用科学计数法表示之后的数值的整数部分是三位 ， 精确到十分位 ，
* 数量级没有规定 ， 因为没见过实数里有用科学计数法表示之后E的后面会小于一位的情况 （ 0 无所谓 ） 。
* @ returns { * }
* /
function eFormat ( num , format ) {
var neg = num < 0 ? ( num *= - 1 , "-" ) : "" ,
magnitudeNeg = "" ;
var funcName = num > 0 && num < 1 ? "floor" : "ceil" ; // -0.9999->-1
// 数量级
var magnitude = Math [ funcName ] ( Math . log ( num ) / Math . log ( 10 ) ) ;
if ( ! isFinite ( magnitude ) ) {
return format . replace ( /#/ig , "" ) . replace ( /\.e/ig , "E" ) ;
}
num = num / Math . pow ( 10 , magnitude ) ;
// 让num转化成[1, 10)区间上的数
if ( num > 0 && num < 1 ) {
num *= 10 ;
magnitude -= 1 ;
}
// 计算出format中需要显示的整数部分的位数，然后更新这个数值，也更新数量级
var integerLen = getInteger ( magnitude , format ) ;
integerLen > 1 && ( magnitude -= integerLen - 1 , num *= Math . pow ( 10 , integerLen - 1 ) ) ;
magnitude < 0 && ( magnitudeNeg = "-" , magnitude *= - 1 ) ;
// 获取科学计数法精确到的位数
var precision = getPrecision ( format ) ;
// 判断num经过四舍五入之后是否有进位
var isValueCarry = isValueCarried ( num ) ;
num *= Math . pow ( 10 , precision ) ;
num = Math . round ( num ) ;
// 如果出现进位的情况，将num除以10
isValueCarry && ( num /= 10 , magnitude += magnitudeNeg === "-" ? - 1 : 1 ) ;
num /= Math . pow ( 10 , precision ) ;
// 小数部分保留precision位
num = num . toFixed ( precision ) ;
// 格式化指数的部分
magnitude = formatExponential ( format , magnitude , magnitudeNeg ) ;
return neg + num + "E" + magnitude ;
}
// 获取format格式规定的数量级的形式
function formatExponential ( format , num , magnitudeNeg ) {
num += "" ;
if ( ! /e/ig . test ( format ) ) {
return num ;
}
format = format . split ( /e/ig ) [ 1 ] ;
while ( num . length < format . length ) {
num = "0" + num ;
}
// 如果magnitudeNeg是一个"-"，而且num正好全是0，那么就别显示负号了
var isAllZero = true ;
for ( var i = 0 , len = num . length ; i < len ; i ++ ) {
if ( ! isAllZero ) {
continue ;
}
isAllZero = num . charAt ( i ) === "0" ;
}
magnitudeNeg = isAllZero ? "" : magnitudeNeg ;
return magnitudeNeg + num ;
}
// 获取format规定的科学计数法精确到的位数
function getPrecision ( format ) {
if ( ! /e/ig . test ( format ) ) {
return 0 ;
}
var arr = format . split ( /e/ig ) [ 0 ] . split ( "." ) ;
return arr . length > 1 ? arr [ 1 ] . length : 0 ;
}
// 获取数值科学计数法表示之后整数的位数
// 这边我们还需要考虑#和0的问题
function getInteger ( magnitude , format ) {
if ( ! /e/ig . test ( format ) ) {
return 0 ;
}
// return format.split(/e/ig)[0].split(".")[0].length;
var formatLeft = format . split ( /e/ig ) [ 0 ] . split ( "." ) [ 0 ] , i , f , len = formatLeft . length ;
var valueLeftLen = 0 ;
for ( i = 0 ; i < len ; i ++ ) {
f = formatLeft . charAt ( i ) ;
// "#"所在的位置到末尾长度小于等于值的整数部分长度，那么这个#才可以占位
if ( f == 0 || ( f == "#" && ( len - i <= magnitude + 1 ) ) ) {
valueLeftLen ++ ;
}
}
return valueLeftLen ;
}
// 判断num通过round函数之后是否有进位
function isValueCarried ( num ) {
var roundNum = Math . round ( num ) ;
num = ( num + "" ) . split ( "." ) [ 0 ] ;
roundNum = ( roundNum + "" ) . split ( "." ) [ 0 ] ;
return num . length !== roundNum . length ;
}
}
//'#.##'之类的格式处理 1.324e-18 这种的科学数字
function _dealNumberPrecision ( text , fright ) {
if ( /[eE]/ . test ( text ) ) {
var precision = 0 , i = 0 , ch ;
if ( /[%‰]$/ . test ( fright ) ) {
precision = /[%]$/ . test ( fright ) ? 2 : 3 ;
}
for ( var len = fright . length ; i < len ; i ++ ) {
if ( ( ch = fright . charAt ( i ) ) == "0" || ch == "#" ) {
precision ++ ;
}
}
return Number ( text ) . toFixed ( precision ) ;
}
return text ;
}
/ * *
* 数字格式
* /
function _numberFormat ( text , format ) {
var text = text + "" ;
//在调用数字格式的时候如果text里没有任何数字则不处理
if ( ! ( /[0-9]/ . test ( text ) ) || ! format ) {
return text ;
}
// 数字格式，区分正负数
var numMod = format . indexOf ( ";" ) ;
if ( numMod > - 1 ) {
if ( text >= 0 ) {
return _numberFormat ( text + "" , format . substring ( 0 , numMod ) ) ;
}
return _numberFormat ( ( - text ) + "" , format . substr ( numMod + 1 ) ) ;
} else {
// 兼容格式处理负数的情况(copy:fr-jquery.format.js)
if ( + text < 0 && format . charAt ( 0 ) !== "-" ) {
return _numberFormat ( ( - text ) + "" , "-" + format ) ;
}
}
var fp = format . split ( "." ) , fleft = fp [ 0 ] || "" , fright = fp [ 1 ] || "" ;
text = _dealNumberPrecision ( text , fright ) ;
var tp = text . split ( "." ) , tleft = tp [ 0 ] || "" , tright = tp [ 1 ] || "" ;
// 百分比,千分比的小数点移位处理
if ( /[%‰]$/ . test ( format ) ) {
var paddingZero = /[%]$/ . test ( format ) ? "00" : "000" ;
tright += paddingZero ;
tleft += tright . substr ( 0 , paddingZero . length ) ;
tleft = tleft . replace ( /^0+/gi , "" ) ;
tright = tright . substr ( paddingZero . length ) . replace ( /0+$/gi , "" ) ;
}
var right = _dealWithRight ( tright , fright ) ;
if ( right . leftPlus ) {
// 小数点后有进位
tleft = parseInt ( tleft ) + 1 + "" ;
tleft = isNaN ( tleft ) ? "1" : tleft ;
}
right = right . num ;
var left = _dealWithLeft ( tleft , fleft ) ;
if ( ! ( /[0-9]/ . test ( left ) ) ) {
left = left + "0" ;
}
if ( ! ( /[0-9]/ . test ( right ) ) ) {
return left + right ;
} else {
return left + "." + right ;
}
}
/ * *
* 处理小数点右边小数部分
* @ param tright 右边内容
* @ param fright 右边格式
* @ returns { JSON } 返回处理结果和整数部分是否需要进位
* @ private
* /
function _dealWithRight ( tright , fright ) {
var right = "" , j = 0 , i = 0 ;
for ( var len = fright . length ; i < len ; i ++ ) {
var ch = fright . charAt ( i ) ;
var c = tright . charAt ( j ) ;
switch ( ch ) {
case "0" :
if ( isEmpty ( c ) ) {
c = "0" ;
}
right += c ;
j ++ ;
break ;
case "#" :
right += c ;
j ++ ;
break ;
default :
right += ch ;
break ;
}
}
var rll = tright . substr ( j ) ;
var result = { } ;
if ( ! isEmpty ( rll ) && rll . charAt ( 0 ) > 4 ) {
// 有多余字符，需要四舍五入
result . leftPlus = true ;
var numReg = right . match ( /^[0-9]+/ ) ;
if ( numReg ) {
var num = numReg [ 0 ] ;
var orilen = num . length ;
var newnum = parseInt ( num ) + 1 + "" ;
// 进位到整数部分
if ( newnum . length > orilen ) {
newnum = newnum . substr ( 1 ) ;
} else {
newnum = BI . leftPad ( newnum , orilen , "0" ) ;
result . leftPlus = false ;
}
right = right . replace ( /^[0-9]+/ , newnum ) ;
}
}
result . num = right ;
return result ;
}
/ * *
* 处理小数点左边整数部分
* @ param tleft 左边内容
* @ param fleft 左边格式
* @ returns { string } 返回处理结果
* @ private
* /
function _dealWithLeft ( tleft , fleft ) {
var left = "" ;
var j = tleft . length - 1 ;
var combo = - 1 , last = - 1 ;
var i = fleft . length - 1 ;
for ( ; i >= 0 ; i -- ) {
var ch = fleft . charAt ( i ) ;
var c = tleft . charAt ( j ) ;
switch ( ch ) {
case "0" :
if ( isEmpty ( c ) ) {
c = "0" ;
}
last = - 1 ;
left = c + left ;
j -- ;
break ;
case "#" :
last = i ;
left = c + left ;
j -- ;
break ;
case "," :
if ( ! isEmpty ( c ) ) {
// 计算一个,分隔区间的长度
var com = fleft . match ( /,[#0]+/ ) ;
if ( com ) {
combo = com [ 0 ] . length - 1 ;
}
left = "," + left ;
}
break ;
default :
left = ch + left ;
break ;
}
}
if ( last > - 1 ) {
// 处理剩余字符
var tll = tleft . substr ( 0 , j + 1 ) ;
left = left . substr ( 0 , last ) + tll + left . substr ( last ) ;
}
if ( combo > 0 ) {
// 处理,分隔区间
var res = left . match ( /[0-9]+,/ ) ;
if ( res ) {
res = res [ 0 ] ;
var newstr = "" , n = res . length - 1 - combo ;
for ( ; n >= 0 ; n = n - combo ) {
newstr = res . substr ( n , combo ) + "," + newstr ;
}
var lres = res . substr ( 0 , n + combo ) ;
if ( ! isEmpty ( lres ) ) {
newstr = lres + "," + newstr ;
}
}
left = left . replace ( /[0-9]+,/ , newstr ) ;
}
return left ;
}
BI . cjkEncode = function ( text ) {
// alex:如果非字符串,返回其本身(cjkEncode(234) 返回 ""是不对的)
if ( typeof text !== "string" ) {
return text ;
}
var newText = "" ;
for ( var i = 0 ; i < text . length ; i ++ ) {
var code = text . charCodeAt ( i ) ;
if ( code >= 128 || code === 91 || code === 93 ) { // 91 is "[", 93 is "]".
newText += "[" + code . toString ( 16 ) + "]" ;
} else {
newText += text . charAt ( i ) ;
}
}
return newText ;
} ;
/ * *
* 将cjkEncode处理过的字符串转化为原始字符串
*
* @ static
* @ param text 需要做解码的字符串
* @ return { String } 解码后的字符串
* /
BI . cjkDecode = function ( text ) {
if ( text == null ) {
return "" ;
}
// 查找没有 "[", 直接返回. kunsnat:数字的时候, 不支持indexOf方法, 也是直接返回.
if ( ! isNaN ( text ) || text . indexOf ( "[" ) == - 1 ) {
return text ;
}
var newText = "" ;
for ( var i = 0 ; i < text . length ; i ++ ) {
var ch = text . charAt ( i ) ;
if ( ch == "[" ) {
var rightIdx = text . indexOf ( "]" , i + 1 ) ;
if ( rightIdx > i + 1 ) {
var subText = text . substring ( i + 1 , rightIdx ) ;
// james：主要是考虑[CDATA[]]这样的值的出现
if ( subText . length > 0 ) {
ch = String . fromCharCode ( eval ( "0x" + subText ) ) ;
}
i = rightIdx ;
}
}
newText += ch ;
}
return newText ;
} ;
// replace the html special tags
var SPECIAL _TAGS = {
"&" : "&" ,
"\"" : """ ,
"<" : "<" ,
">" : ">" ,
" " : " "
} ;
BI . htmlEncode = function ( text ) {
return BI . isNull ( text ) ? "" : BI . replaceAll ( text + "" , "&|\"|<|>|\\s" , function ( v ) {
return SPECIAL _TAGS [ v ] ? SPECIAL _TAGS [ v ] : " " ;
} ) ;
} ;
// html decode
BI . htmlDecode = function ( text ) {
return BI . isNull ( text ) ? "" : BI . replaceAll ( text + "" , "&|"|<|>| " , function ( v ) {
switch ( v ) {
case "&" :
return "&" ;
case """ :
return "\"" ;
case "<" :
return "<" ;
case ">" :
return ">" ;
case " " :
default :
return " " ;
}
} ) ;
} ;
BI . cjkEncodeDO = function ( o ) {
if ( BI . isPlainObject ( o ) ) {
var result = { } ;
_ . each ( o , function ( v , k ) {
if ( ! ( typeof v === "string" ) ) {
v = BI . jsonEncode ( v ) ;
}
// wei:bug 43338，如果key是中文，cjkencode后o的长度就加了1，ie9以下版本死循环，所以新建对象result。
k = BI . cjkEncode ( k ) ;
result [ k ] = BI . cjkEncode ( v ) ;
} ) ;
return result ;
}
return o ;
} ;
BI . jsonEncode = function ( o ) {
// james:这个Encode是抄的EXT的
var useHasOwn = ! ! { } . hasOwnProperty ;
// crashes Safari in some instances
// var validRE = /^("(\\.|[^"\\\n\r])*?"|[,:{}\[\]0-9.\-+Eaeflnr-u \n\r\t])+?$/;
var m = {
"\b" : "\\b" ,
"\t" : "\\t" ,
"\n" : "\\n" ,
"\f" : "\\f" ,
"\r" : "\\r" ,
"\"" : "\\\"" ,
"\\" : "\\\\"
} ;
var encodeString = function ( s ) {
if ( /["\\\x00-\x1f]/ . test ( s ) ) {
return "\"" + s . replace ( /([\x00-\x1f\\"])/g , function ( a , b ) {
var c = m [ b ] ;
if ( c ) {
return c ;
}
c = b . charCodeAt ( ) ;
return "\\u00" +
Math . floor ( c / 16 ) . toString ( 16 ) +
( c % 16 ) . toString ( 16 ) ;
} ) + "\"" ;
}
return "\"" + s + "\"" ;
} ;
var encodeArray = function ( o ) {
var a = [ "[" ] , b , i , l = o . length , v ;
for ( i = 0 ; i < l ; i += 1 ) {
v = o [ i ] ;
switch ( typeof v ) {
case "undefined" :
case "function" :
case "unknown" :
break ;
default :
if ( b ) {
a . push ( "," ) ;
}
a . push ( v === null ? "null" : BI . jsonEncode ( v ) ) ;
b = true ;
}
}
a . push ( "]" ) ;
return a . join ( "" ) ;
} ;
if ( typeof o === "undefined" || o === null ) {
return "null" ;
} else if ( BI . isArray ( o ) ) {
return encodeArray ( o ) ;
} else if ( o instanceof Date ) {
/ *
* alex : 原来只是把年月日时分秒简单地拼成一个String , 无法decode
* 现在这么处理就可以decode了 , 但是JS . jsonDecode和Java . JSONObject也要跟着改一下
* /
return BI . jsonEncode ( {
_ _time _ _ : o . getTime ( )
} ) ;
} else if ( typeof o === "string" ) {
return encodeString ( o ) ;
} else if ( typeof o === "number" ) {
return isFinite ( o ) ? String ( o ) : "null" ;
} else if ( typeof o === "boolean" ) {
return String ( o ) ;
} else if ( BI . isFunction ( o ) ) {
return String ( o ) ;
}
var a = [ "{" ] , b , i , v ;
for ( i in o ) {
if ( ! useHasOwn || o . hasOwnProperty ( i ) ) {
v = o [ i ] ;
switch ( typeof v ) {
case "undefined" :
case "unknown" :
break ;
default :
if ( b ) {
a . push ( "," ) ;
}
a . push ( BI . jsonEncode ( i ) , ":" ,
v === null ? "null" : BI . jsonEncode ( v ) ) ;
b = true ;
}
}
}
a . push ( "}" ) ;
return a . join ( "" ) ;
} ;
BI . jsonDecode = function ( text ) {
try {
// 注意0啊
// var jo = $.parseJSON(text) || {};
var jo = BI . $ ? BI . $ . parseJSON ( text ) : _global . JSON . parse ( text ) ;
if ( jo == null ) {
jo = { } ;
}
} catch ( e ) {
/ *
* richie : 浏览器只支持标准的JSON字符串转换 ， 而jQuery会默认调用浏览器的window . JSON . parse ( ) 函数进行解析
* 比如 ： var str = "{'a':'b'}" , 这种形式的字符串转换为JSON就会抛异常
* /
try {
jo = new Function ( "return " + text ) ( ) || { } ;
} catch ( e ) {
// do nothing
}
if ( jo == null ) {
jo = [ ] ;
}
}
if ( ! _hasDateInJson ( text ) ) {
return jo ;
}
function _hasDateInJson ( json ) {
if ( ! json || typeof json !== "string" ) {
return false ;
}
return json . indexOf ( "__time__" ) != - 1 ;
}
return ( function ( o ) {
if ( typeof o === "string" ) {
return o ;
}
if ( o && o . _ _time _ _ != null ) {
return new Date ( o . _ _time _ _ ) ;
}
for ( var a in o ) {
if ( o [ a ] == o || typeof o [ a ] === "object" || _ . isFunction ( o [ a ] ) ) {
break ;
}
o [ a ] = arguments . callee ( o [ a ] ) ;
}
return o ;
} ) ( jo ) ;
} ;
/ * *
* 获取编码后的url
* @ param urlTemplate url模板
* @ param param 参数
* @ returns { * | String }
* @ example
* BI . getEncodeURL ( "design/{tableName}/{fieldName}" , { tableName : "A" , fieldName : "a" } ) // design/A/a
* /
BI . getEncodeURL = function ( urlTemplate , param ) {
return BI . replaceAll ( urlTemplate , "\\{(.*?)\\}" , function ( ori , str ) {
return BI . encodeURIComponent ( BI . isObject ( param ) ? param [ str ] : param ) ;
} ) ;
} ;
BI . encodeURIComponent = function ( url ) {
BI . specialCharsMap = BI . specialCharsMap || { } ;
url = url || "" ;
url = BI . replaceAll ( url + "" , BI . keys ( BI . specialCharsMap || [ ] ) . join ( "|" ) , function ( str ) {
switch ( str ) {
case "\\" :
return BI . specialCharsMap [ "\\\\" ] || str ;
default :
return BI . specialCharsMap [ str ] || str ;
}
} ) ;
return _global . encodeURIComponent ( url ) ;
} ;
BI . decodeURIComponent = function ( url ) {
var reserveSpecialCharsMap = { } ;
BI . each ( BI . specialCharsMap , function ( initialChar , encodeChar ) {
reserveSpecialCharsMap [ encodeChar ] = initialChar === "\\\\" ? "\\" : initialChar ;
} ) ;
url = url || "" ;
url = BI . replaceAll ( url + "" , BI . keys ( reserveSpecialCharsMap || [ ] ) . join ( "|" ) , function ( str ) {
return reserveSpecialCharsMap [ str ] || str ;
} ) ;
return _global . decodeURIComponent ( url ) ;
} ;
BI . contentFormat = function ( cv , fmt ) {
if ( isEmpty ( cv ) ) {
// 原值为空，返回空字符
return "" ;
}
var text = cv . toString ( ) ;
if ( isEmpty ( fmt ) ) {
// 格式为空，返回原字符
return text ;
}
if ( fmt . match ( /^T/ ) ) {
// T - 文本格式
return text ;
} else if ( fmt . match ( /^D/ ) ) {
// D - 日期(时间)格式
if ( ! ( cv instanceof Date ) ) {
if ( typeof cv === "number" ) {
// 毫秒数类型
cv = new Date ( cv ) ;
} else {
//字符串类型转化为date类型
cv = new Date ( Date . parse ( ( "" + cv ) . replace ( /-|\./g , "/" ) ) ) ;
}
}
if ( ! isInvalidDate ( cv ) && ! BI . isNull ( cv ) ) {
var needTrim = fmt . match ( /^DT/ ) ;
text = BI . date2Str ( cv , fmt . substring ( needTrim ? 2 : 1 ) ) ;
}
} else if ( fmt . match ( /E/ ) ) {
// 科学计数格式
text = _eFormat ( text , fmt ) ;
} else {
// 数字格式
text = _numberFormat ( text , fmt ) ;
}
// ¤ - 货币格式
text = text . replace ( /¤/g , "￥" ) ;
return text ;
} ;
/ * *
* 将Java提供的日期格式字符串装换为JS识别的日期格式字符串
* @ class FR . parseFmt
* @ param fmt 日期格式
* @ returns { String }
* /
BI . parseFmt = function ( fmt ) {
if ( ! fmt ) {
return "" ;
}
//日期
fmt = String ( fmt )
//年
. replace ( /y{4,}/g , "%Y" ) //yyyy的时候替换为Y
. replace ( /y{2}/g , "%y" ) //yy的时候替换为y
//月
. replace ( /M{4,}/g , "%b" ) //MMMM的时候替换为b，八
. replace ( /M{3}/g , "%B" ) //MMM的时候替换为M，八月
. replace ( /M{2}/g , "%X" ) //MM的时候替换为X，08
. replace ( /M{1}/g , "%x" ) //M的时候替换为x，8
. replace ( /a{1}/g , "%p" ) ;
//天
if ( new RegExp ( "d{2,}" , "g" ) . test ( fmt ) ) {
fmt = fmt . replace ( /d{2,}/g , "%d" ) ; //dd的时候替换为d
} else {
fmt = fmt . replace ( /d{1}/g , "%e" ) ; //d的时候替换为j
}
//时
if ( new RegExp ( "h{2,}" , "g" ) . test ( fmt ) ) { //12小时制
fmt = fmt . replace ( /h{2,}/g , "%I" ) ;
} else {
fmt = fmt . replace ( /h{1}/g , "%I" ) ;
}
if ( new RegExp ( "H{2,}" , "g" ) . test ( fmt ) ) { //24小时制
fmt = fmt . replace ( /H{2,}/g , "%H" ) ;
} else {
fmt = fmt . replace ( /H{1}/g , "%H" ) ;
}
fmt = fmt . replace ( /m{2,}/g , "%M" ) //分
//秒
. replace ( /s{2,}/g , "%S" ) ;
return fmt ;
} ;
/ * *
* 把字符串按照对应的格式转化成日期对象
*
* @ example
* var result = BI . str2Date ( '2013-12-12' , 'yyyy-MM-dd' ) ; //Thu Dec 12 2013 00:00:00 GMT+0800
*
* @ class BI . str2Date
* @ param str 字符串
* @ param format 日期格式
* @ returns { * }
* /
BI . str2Date = function ( str , format ) {
if ( typeof str != "string" || typeof format != "string" ) {
return null ;
}
var fmt = BI . parseFmt ( format ) ;
return BI . parseDateTime ( str , fmt ) ;
} ;
/ * *
* 把日期对象按照指定格式转化成字符串
*
* @ example
* var date = new Date ( 'Thu Dec 12 2013 00:00:00 GMT+0800' ) ;
* var result = BI . date2Str ( date , 'yyyy-MM-dd' ) ; //2013-12-12
*
* @ class BI . date2Str
* @ param date 日期
* @ param format 日期格式
* @ returns { String }
* /
BI . date2Str = function ( date , format ) {
if ( ! date ) {
return "" ;
}
// O(len(format))
var len = format . length , result = "" ;
if ( len > 0 ) {
var flagch = format . charAt ( 0 ) , start = 0 , str = flagch ;
for ( var i = 1 ; i < len ; i ++ ) {
var ch = format . charAt ( i ) ;
if ( flagch !== ch ) {
result += compileJFmt ( {
char : flagch ,
str : str ,
len : i - start
} , date ) ;
flagch = ch ;
start = i ;
str = flagch ;
} else {
str += ch ;
}
}
result += compileJFmt ( {
char : flagch ,
str : str ,
len : len - start
} , date ) ;
}
return result ;
function compileJFmt ( jfmt , date ) {
var str = jfmt . str , len = jfmt . len , ch = jfmt [ "char" ] ;
switch ( ch ) {
case "E" : // 星期
str = BI . Date . _DN [ date . getDay ( ) ] ;
break ;
case "y" : // 年
if ( len <= 3 ) {
str = ( date . getFullYear ( ) + "" ) . slice ( 2 , 4 ) ;
} else {
str = date . getFullYear ( ) ;
}
break ;
case "M" : // 月
if ( len > 2 ) {
str = BI . Date . _MN [ date . getMonth ( ) ] ;
} else if ( len < 2 ) {
str = date . getMonth ( ) + 1 ;
} else {
str = BI . leftPad ( date . getMonth ( ) + 1 + "" , 2 , "0" ) ;
}
break ;
case "d" : // 日
if ( len > 1 ) {
str = BI . leftPad ( date . getDate ( ) + "" , 2 , "0" ) ;
} else {
str = date . getDate ( ) ;
}
break ;
case "h" : // 时(12)
var hour = date . getHours ( ) % 12 ;
if ( hour === 0 ) {
hour = 12 ;
}
if ( len > 1 ) {
str = BI . leftPad ( hour + "" , 2 , "0" ) ;
} else {
str = hour ;
}
break ;
case "H" : // 时(24)
if ( len > 1 ) {
str = BI . leftPad ( date . getHours ( ) + "" , 2 , "0" ) ;
} else {
str = date . getHours ( ) ;
}
break ;
case "m" :
if ( len > 1 ) {
str = BI . leftPad ( date . getMinutes ( ) + "" , 2 , "0" ) ;
} else {
str = date . getMinutes ( ) ;
}
break ;
case "s" :
if ( len > 1 ) {
str = BI . leftPad ( date . getSeconds ( ) + "" , 2 , "0" ) ;
} else {
str = date . getSeconds ( ) ;
}
break ;
case "a" :
str = date . getHours ( ) < 12 ? "am" : "pm" ;
break ;
case "z" :
str = BI . getTimezone ( date ) ;
break ;
default :
str = jfmt . str ;
break ;
}
return str ;
}
} ;
BI . object2Number = function ( value ) {
if ( value == null ) {
return 0 ;
}
if ( typeof value === "number" ) {
return value ;
}
var str = value + "" ;
if ( str . indexOf ( "." ) === - 1 ) {
return parseInt ( str ) ;
}
return parseFloat ( str ) ;
} ;
BI . object2Date = function ( obj ) {
if ( obj == null ) {
return new Date ( ) ;
}
if ( obj instanceof Date ) {
return obj ;
} else if ( typeof obj === "number" ) {
return new Date ( obj ) ;
}
var str = obj + "" ;
str = str . replace ( /-/g , "/" ) ;
var dt = new Date ( str ) ;
if ( ! isInvalidDate ( dt ) ) {
return dt ;
}
return new Date ( ) ;
} ;
BI . object2Time = function ( obj ) {
if ( obj == null ) {
return new Date ( ) ;
}
if ( obj instanceof Date ) {
return obj ;
}
var str = obj + "" ;
str = str . replace ( /-/g , "/" ) ;
var dt = new Date ( str ) ;
if ( ! isInvalidDate ( dt ) ) {
return dt ;
}
if ( str . indexOf ( "/" ) === - 1 && str . indexOf ( ":" ) !== - 1 ) {
dt = new Date ( "1970/01/01 " + str ) ;
if ( ! isInvalidDate ( dt ) ) {
return dt ;
}
}
dt = BI . parseDateTime ( str , "HH:mm:ss" ) ;
if ( ! isInvalidDate ( dt ) ) {
return dt ;
}
return new Date ( ) ;
} ;
} ) ( ) ;
/* WEBPACK VAR INJECTION */ } . call ( this , _ _webpack _require _ _ ( 13 ) ) )
/***/ } ) ,
/***/ 123 :
/***/ ( function ( module , exports ) {
/ * *
* 对数组对象的扩展
* @ class Array
* /
_ . extend ( BI , {
pushArray : function ( sArray , array ) {
for ( var i = 0 ; i < array . length ; i ++ ) {
sArray . push ( array [ i ] ) ;
}
} ,
pushDistinct : function ( sArray , obj ) {
if ( ! BI . contains ( sArray , obj ) ) {
sArray . push ( obj ) ;
}
} ,
pushDistinctArray : function ( sArray , array ) {
for ( var i = 0 , len = array . length ; i < len ; i ++ ) {
BI . pushDistinct ( sArray , array [ i ] ) ;
}
}
} ) ;
/***/ } ) ,
/***/ 124 :
/***/ ( function ( module , exports ) {
/** Constants used for time computations */
BI . Date = BI . Date || { } ;
BI . Date . SECOND = 1000 ;
BI . Date . MINUTE = 60 * BI . Date . SECOND ;
BI . Date . HOUR = 60 * BI . Date . MINUTE ;
BI . Date . DAY = 24 * BI . Date . HOUR ;
BI . Date . WEEK = 7 * BI . Date . DAY ;
_ . extend ( BI , {
/ * *
* 获取时区
* @ returns { String }
* /
getTimezone : function ( date ) {
return date . toString ( ) . replace ( /^.* (?:\((.*)\)|([A-Z]{1,4})(?:[\-+][0-9]{4})?(?: -?\d+)?)$/ , "$1$2" ) . replace ( /[^A-Z]/g , "" ) ;
} ,
/** Returns the number of days in the current month */
getMonthDays : function ( date , month ) {
var year = date . getFullYear ( ) ;
if ( typeof month === "undefined" ) {
month = date . getMonth ( ) ;
}
if ( ( ( 0 == ( year % 4 ) ) && ( ( 0 != ( year % 100 ) ) || ( 0 == ( year % 400 ) ) ) ) && month == 1 ) {
return 29 ;
}
return BI . Date . _MD [ month ] ;
} ,
/ * *
* 获取每月的最后一天
* @ returns { Date }
* /
getLastDateOfMonth : function ( date ) {
return BI . getDate ( date . getFullYear ( ) , date . getMonth ( ) , BI . getMonthDays ( date ) ) ;
} ,
/** Returns the number of day in the year. */
getDayOfYear : function ( date ) {
var now = BI . getDate ( date . getFullYear ( ) , date . getMonth ( ) , date . getDate ( ) , 0 , 0 , 0 ) ;
var then = BI . getDate ( date . getFullYear ( ) , 0 , 0 , 0 , 0 , 0 ) ;
var time = now - then ;
return Math . floor ( time / BI . Date . DAY ) ;
} ,
/** Returns the number of the week in year, as defined in ISO 8601. */
getWeekNumber : function ( date ) {
var d = BI . getDate ( date . getFullYear ( ) , date . getMonth ( ) , date . getDate ( ) , 0 , 0 , 0 ) ;
var week = d . getDay ( ) ;
var startOfWeek = BI . StartOfWeek % 7 ;
var middleDay = ( startOfWeek + 3 ) % 7 ;
middleDay = middleDay || 7 ;
// 偏移到周周首之前需要多少天
var offsetWeekStartCount = week < startOfWeek ? ( 7 + week - startOfWeek ) : ( week - startOfWeek ) ;
var offsetWeekMiddleCount = middleDay < startOfWeek ? ( 7 + middleDay - startOfWeek ) : ( middleDay - startOfWeek ) ;
d . setDate ( d . getDate ( ) - offsetWeekStartCount + offsetWeekMiddleCount ) ;
var ms = d . valueOf ( ) ;
d . setMonth ( 0 ) ;
d . setDate ( 1 ) ;
return Math . floor ( ( ms - d . valueOf ( ) ) / ( 7 * 864e5 ) ) + 1 ;
} ,
getQuarter : function ( date ) {
return Math . floor ( date . getMonth ( ) / 3 ) + 1 ;
} ,
// 离当前时间多少天的时间
getOffsetDate : function ( date , offset ) {
return BI . getDate ( BI . getTime ( date . getFullYear ( ) , date . getMonth ( ) , date . getDate ( ) , date . getHours ( ) , date . getMinutes ( ) , date . getSeconds ( ) ) + offset * 864e5 ) ;
} ,
getOffsetQuarter : function ( date , n ) {
var dt = BI . getDate ( BI . getTime ( date . getFullYear ( ) , date . getMonth ( ) , date . getDate ( ) , date . getHours ( ) , date . getMinutes ( ) , date . getSeconds ( ) ) ) ;
var day = dt . getDate ( ) ;
var monthDay = BI . getMonthDays ( BI . getDate ( dt . getFullYear ( ) , dt . getMonth ( ) + BI . parseInt ( n ) * 3 , 1 ) ) ;
if ( day > monthDay ) {
day = monthDay ;
}
dt . setDate ( day ) ;
dt . setMonth ( dt . getMonth ( ) + parseInt ( n ) * 3 ) ;
return dt ;
} ,
// 得到本季度的起始月份
getQuarterStartMonth : function ( date ) {
var quarterStartMonth = 0 ;
var nowMonth = date . getMonth ( ) ;
if ( nowMonth < 3 ) {
quarterStartMonth = 0 ;
}
if ( 2 < nowMonth && nowMonth < 6 ) {
quarterStartMonth = 3 ;
}
if ( 5 < nowMonth && nowMonth < 9 ) {
quarterStartMonth = 6 ;
}
if ( nowMonth > 8 ) {
quarterStartMonth = 9 ;
}
return quarterStartMonth ;
} ,
// 获得本季度的起始日期
getQuarterStartDate : function ( date ) {
return BI . getDate ( date . getFullYear ( ) , BI . getQuarterStartMonth ( date ) , 1 ) ;
} ,
// 得到本季度的结束日期
getQuarterEndDate : function ( date ) {
var quarterEndMonth = BI . getQuarterStartMonth ( date ) + 2 ;
return BI . getDate ( date . getFullYear ( ) , quarterEndMonth , BI . getMonthDays ( date , quarterEndMonth ) ) ;
} ,
// 指定日期n个月之前或之后的日期
getOffsetMonth : function ( date , n ) {
var dt = BI . getDate ( BI . getTime ( date . getFullYear ( ) , date . getMonth ( ) , date . getDate ( ) , date . getHours ( ) , date . getMinutes ( ) , date . getSeconds ( ) ) ) ;
var day = dt . getDate ( ) ;
var monthDay = BI . getMonthDays ( BI . getDate ( dt . getFullYear ( ) , dt . getMonth ( ) + parseInt ( n ) , 1 ) ) ;
if ( day > monthDay ) {
day = monthDay ;
}
dt . setDate ( day ) ;
dt . setMonth ( dt . getMonth ( ) + parseInt ( n ) ) ;
return dt ;
} ,
// 获得本周的起始日期
getWeekStartDate : function ( date ) {
var w = date . getDay ( ) ;
var startOfWeek = BI . StartOfWeek % 7 ;
return BI . getOffsetDate ( date , BI . Date . _OFFSET [ w < startOfWeek ? ( 7 + w - startOfWeek ) : ( w - startOfWeek ) ] ) ;
} ,
// 得到本周的结束日期
getWeekEndDate : function ( date ) {
var w = date . getDay ( ) ;
var startOfWeek = BI . StartOfWeek % 7 ;
return BI . getOffsetDate ( date , BI . Date . _OFFSET [ w < startOfWeek ? ( 7 + w - startOfWeek ) : ( w - startOfWeek ) ] + 6 ) ;
} ,
// 格式化打印日期
print : function ( date , str ) {
var m = date . getMonth ( ) ;
var d = date . getDate ( ) ;
var y = date . getFullYear ( ) ;
var yWith4number = y + "" ;
while ( yWith4number . length < 4 ) {
yWith4number = "0" + yWith4number ;
}
var wn = BI . getWeekNumber ( date ) ;
var qr = BI . getQuarter ( date ) ;
var w = date . getDay ( ) ;
var s = { } ;
var hr = date . getHours ( ) ;
var pm = ( hr >= 12 ) ;
var ir = ( pm ) ? ( hr - 12 ) : hr ;
var dy = BI . getDayOfYear ( date ) ;
if ( ir == 0 ) {
ir = 12 ;
}
var min = date . getMinutes ( ) ;
var sec = date . getSeconds ( ) ;
s [ "%a" ] = BI . Date . _SDN [ w ] ; // abbreviated weekday name [FIXME: I18N]
s [ "%A" ] = BI . Date . _DN [ w ] ; // full weekday name
s [ "%b" ] = BI . Date . _SMN [ m ] ; // abbreviated month name [FIXME: I18N]
s [ "%B" ] = BI . Date . _MN [ m ] ; // full month name
// FIXME: %c : preferred date and time representation for the current locale
s [ "%C" ] = 1 + Math . floor ( y / 100 ) ; // the century number
s [ "%d" ] = ( d < 10 ) ? ( "0" + d ) : d ; // the day of the month (range 01 to 31)
s [ "%e" ] = d ; // the day of the month (range 1 to 31)
// FIXME: %D : american date style: %m/%d/%y
// FIXME: %E, %F, %G, %g, %h (man strftime)
s [ "%H" ] = ( hr < 10 ) ? ( "0" + hr ) : hr ; // hour, range 00 to 23 (24h format)
s [ "%I" ] = ( ir < 10 ) ? ( "0" + ir ) : ir ; // hour, range 01 to 12 (12h format)
s [ "%j" ] = ( dy < 100 ) ? ( ( dy < 10 ) ? ( "00" + dy ) : ( "0" + dy ) ) : dy ; // day of the year (range 001 to 366)
s [ "%k" ] = hr + "" ; // hour, range 0 to 23 (24h format)
s [ "%l" ] = ir + "" ; // hour, range 1 to 12 (12h format)
s [ "%X" ] = ( m < 9 ) ? ( "0" + ( 1 + m ) ) : ( 1 + m ) ; // month, range 01 to 12
s [ "%x" ] = m + 1 ; // month, range 1 to 12
s [ "%M" ] = ( min < 10 ) ? ( "0" + min ) : min ; // minute, range 00 to 59
s [ "%n" ] = "\n" ; // a newline character
s [ "%p" ] = pm ? "PM" : "AM" ;
s [ "%P" ] = pm ? "pm" : "am" ;
// FIXME: %r : the time in am/pm notation %I:%M:%S %p
// FIXME: %R : the time in 24-hour notation %H:%M
s [ "%s" ] = Math . floor ( date . getTime ( ) / 1000 ) ;
s [ "%S" ] = ( sec < 10 ) ? ( "0" + sec ) : sec ; // seconds, range 00 to 59
s [ "%t" ] = "\t" ; // a tab character
// FIXME: %T : the time in 24-hour notation (%H:%M:%S)
s [ "%U" ] = s [ "%W" ] = s [ "%V" ] = ( wn < 10 ) ? ( "0" + wn ) : wn ;
s [ "%u" ] = w + 1 ; // the day of the week (range 1 to 7, 1 = MON)
s [ "%w" ] = w ; // the day of the week (range 0 to 6, 0 = SUN)
// FIXME: %x : preferred date representation for the current locale without the time
// FIXME: %X : preferred time representation for the current locale without the date
s [ "%y" ] = yWith4number . substr ( 2 , 2 ) ; // year without the century (range 00 to 99)
s [ "%Y" ] = yWith4number ; // year with the century
s [ "%%" ] = "%" ; // a literal '%' character
s [ "%Q" ] = qr ;
var re = /%./g ;
BI . isKhtml = BI . isKhtml || function ( ) {
if ( ! _global . navigator ) {
return false ;
}
return /Konqueror|Safari|KHTML/i . test ( navigator . userAgent ) ;
} ;
// 包含年周的格式化，ISO8601标准周的计数会影响年
if ( ( str . indexOf ( "%Y" ) !== - 1 || str . indexOf ( "%y" ) !== - 1 ) && ( str . indexOf ( "%W" ) !== - 1 || str . indexOf ( "%U" ) !== - 1 || str . indexOf ( "%V" ) !== - 1 ) ) {
switch ( wn ) {
// 如果周数是1，但是当前却在12月，表示此周数为下一年的
case 1 :
if ( m === 11 ) {
s [ "%y" ] = parseInt ( s [ "%y" ] ) + 1 ;
s [ "%Y" ] = parseInt ( s [ "%Y" ] ) + 1 ;
}
break ;
// 如果周数是53，但是当前却在1月，表示此周数为上一年的
case 53 :
if ( m === 0 ) {
s [ "%y" ] = parseInt ( s [ "%y" ] ) - 1 ;
s [ "%Y" ] = parseInt ( s [ "%Y" ] ) - 1 ;
}
break ;
default :
break ;
}
}
if ( ! BI . isKhtml ( ) ) {
return str . replace ( re , function ( par ) {
return s [ par ] || par ;
} ) ;
}
var a = str . match ( re ) ;
for ( var i = 0 ; i < a . length ; i ++ ) {
var tmp = s [ a [ i ] ] ;
if ( tmp ) {
re = new RegExp ( a [ i ] , "g" ) ;
str = str . replace ( re , tmp ) ;
}
}
return str ;
}
} ) ;
/***/ } ) ,
/***/ 125 :
/***/ ( function ( module , exports ) {
/ * *
* 基本的函数
* Created by GUY on 2015 / 6 / 24.
* /
BI . Func = BI . Func || { } ;
_ . extend ( BI . Func , {
/ * *
* 创建唯一的名字
* @ param array
* @ param name
* @ returns { * }
* /
createDistinctName : function ( array , name ) {
var src = name , idx = 1 ;
name = name || "" ;
while ( true ) {
if ( BI . every ( array , function ( i , item ) {
return BI . isKey ( item ) ? item !== name : item . name !== name ;
} ) ) {
break ;
}
name = src + ( idx ++ ) ;
}
return name ;
} ,
/ * *
* 获取字符宽度
* @ param str
* @ return { number }
* /
getGBWidth : function ( str ) {
str = str + "" ;
str = str . replace ( /[^\x00-\xff]/g , "xx" ) ;
return Math . ceil ( str . length / 2 ) ;
} ,
/ * *
* 获取搜索结果
* @ param items
* @ param keyword
* @ param param 搜索哪个属性
* /
getSearchResult : function ( items , keyword , param ) {
var isArray = BI . isArray ( items ) ;
items = isArray ? BI . flatten ( items ) : items ;
param || ( param = "text" ) ;
if ( ! BI . isKey ( keyword ) ) {
return {
find : BI . deepClone ( items ) ,
match : isArray ? [ ] : { }
} ;
}
var t , text , py ;
keyword = BI . toUpperCase ( keyword ) ;
var matched = isArray ? [ ] : { } , find = isArray ? [ ] : { } ;
BI . each ( items , function ( i , item ) {
// 兼容item为null的处理
if ( BI . isNull ( item ) ) {
return ;
}
item = BI . deepClone ( item ) ;
t = BI . stripEL ( item ) ;
text = BI . find ( [ t [ param ] , t . text , t . value , t . name , t ] , function ( index , val ) {
return BI . isNotNull ( val ) ;
} ) ;
if ( BI . isNull ( text ) || BI . isObject ( text ) ) return ;
py = BI . makeFirstPY ( text , {
splitChar : "\u200b"
} ) ;
text = BI . toUpperCase ( text ) ;
py = BI . toUpperCase ( py ) ;
var pidx ;
if ( text . indexOf ( keyword ) > - 1 ) {
if ( text === keyword ) {
isArray ? matched . push ( item ) : ( matched [ i ] = item ) ;
} else {
isArray ? find . push ( item ) : ( find [ i ] = item ) ;
}
// BI-56386 这边两个pid / text.length是为了防止截取的首字符串不是完整的，但光这样做还不够，即时错位了，也不能说明就不符合条件
} else if ( pidx = py . indexOf ( keyword ) , ( pidx > - 1 ) ) {
if ( text === keyword || keyword . length === text . length ) {
isArray ? matched . push ( item ) : ( matched [ i ] = item ) ;
} else {
isArray ? find . push ( item ) : ( find [ i ] = item ) ;
}
}
} ) ;
return {
match : matched ,
find : find
} ;
} ,
/ * *
* 获取按GB2312排序的结果
* @ param items
* @ param key
* @ return { any [ ] }
* /
getSortedResult : function ( items , key ) {
var getTextOfItem = BI . isFunction ( key ) ? key :
function ( item , key ) {
if ( BI . isNotNull ( key ) ) {
return item [ key ] ;
}
if ( BI . isNotNull ( item . text ) ) {
return item . text ;
}
if ( BI . isNotNull ( item . value ) ) {
return item . value ;
}
return item ;
} ;
return items . sort ( function ( item1 , item2 ) {
var str1 = getTextOfItem ( item1 , key ) ;
var str2 = getTextOfItem ( item2 , key ) ;
if ( BI . isNull ( str1 ) && BI . isNull ( str2 ) ) {
return 0 ;
}
if ( BI . isNull ( str1 ) ) {
return - 1 ;
}
if ( BI . isNull ( str2 ) ) {
return 1 ;
}
if ( str1 === str2 ) {
return 0 ;
}
var len1 = str1 . length , len2 = str2 . length ;
for ( var i = 0 ; i < len1 && i < len2 ; i ++ ) {
var char1 = str1 [ i ] ;
var char2 = str2 [ i ] ;
if ( char1 !== char2 ) {
// 找不到的字符都往后面放
return ( BI . isNull ( BI . CODE _INDEX [ char1 ] ) ? BI . MAX : BI . CODE _INDEX [ char1 ] ) - ( BI . isNull ( BI . CODE _INDEX [ char2 ] ) ? BI . MAX : BI . CODE _INDEX [ char2 ] ) ;
}
}
return len1 - len2 ;
} ) ;
}
} ) ;
_ . extend ( BI , {
beforeFunc : function ( sFunc , func ) {
var _ _self = sFunc ;
return function ( ) {
if ( func . apply ( sFunc , arguments ) === false ) {
return false ;
}
return _ _self . apply ( sFunc , arguments ) ;
} ;
} ,
afterFunc : function ( sFunc , func ) {
var _ _self = sFunc ;
return function ( ) {
var ret = _ _self . apply ( sFunc , arguments ) ;
if ( ret === false ) {
return false ;
}
func . apply ( sFunc , arguments ) ;
return ret ;
} ;
}
} ) ;
/***/ } ) ,
/***/ 126 :
/***/ ( function ( module , exports ) {
_ . extend ( BI , {
// 给Number类型增加一个add方法，调用起来更加方便。
add : function ( num , arg ) {
return accAdd ( arg , num ) ;
/ * *
* * 加法函数 ， 用来得到精确的加法结果
* * 说明 ： javascript的加法结果会有误差 ， 在两个浮点数相加的时候会比较明显 。 这个函数返回较为精确的加法结果 。
* * 调用 ： accAdd ( arg1 , arg2 )
* * 返回值 ： arg1加上arg2的精确结果
* * /
function accAdd ( arg1 , arg2 ) {
var r1 , r2 , m , c ;
try {
r1 = arg1 . toString ( ) . split ( "." ) [ 1 ] . length ;
} catch ( e ) {
r1 = 0 ;
}
try {
r2 = arg2 . toString ( ) . split ( "." ) [ 1 ] . length ;
} catch ( e ) {
r2 = 0 ;
}
c = Math . abs ( r1 - r2 ) ;
m = Math . pow ( 10 , Math . max ( r1 , r2 ) ) ;
if ( c > 0 ) {
var cm = Math . pow ( 10 , c ) ;
if ( r1 > r2 ) {
arg1 = Number ( arg1 . toString ( ) . replace ( "." , "" ) ) ;
arg2 = Number ( arg2 . toString ( ) . replace ( "." , "" ) ) * cm ;
} else {
arg1 = Number ( arg1 . toString ( ) . replace ( "." , "" ) ) * cm ;
arg2 = Number ( arg2 . toString ( ) . replace ( "." , "" ) ) ;
}
} else {
arg1 = Number ( arg1 . toString ( ) . replace ( "." , "" ) ) ;
arg2 = Number ( arg2 . toString ( ) . replace ( "." , "" ) ) ;
}
return ( arg1 + arg2 ) / m ;
}
} ,
// 给Number类型增加一个sub方法，调用起来更加方便。
sub : function ( num , arg ) {
return accSub ( num , arg ) ;
/ * *
* * 减法函数 ， 用来得到精确的减法结果
* * 说明 ： javascript的减法结果会有误差 ， 在两个浮点数相减的时候会比较明显 。 这个函数返回较为精确的减法结果 。
* * 调用 ： accSub ( arg1 , arg2 )
* * 返回值 ： arg1加上arg2的精确结果
* * /
function accSub ( arg1 , arg2 ) {
var r1 , r2 , m , n ;
try {
r1 = arg1 . toString ( ) . split ( "." ) [ 1 ] . length ;
} catch ( e ) {
r1 = 0 ;
}
try {
r2 = arg2 . toString ( ) . split ( "." ) [ 1 ] . length ;
} catch ( e ) {
r2 = 0 ;
}
m = Math . pow ( 10 , Math . max ( r1 , r2 ) ) ; // last modify by deeka //动态控制精度长度
n = ( r1 >= r2 ) ? r1 : r2 ;
return ( ( arg1 * m - arg2 * m ) / m ) . toFixed ( n ) ;
}
} ,
// 给Number类型增加一个mul方法，调用起来更加方便。
mul : function ( num , arg ) {
return accMul ( arg , num ) ;
/ * *
* * 乘法函数 ， 用来得到精确的乘法结果
* * 说明 ： javascript的乘法结果会有误差 ， 在两个浮点数相乘的时候会比较明显 。 这个函数返回较为精确的乘法结果 。
* * 调用 ： accMul ( arg1 , arg2 )
* * 返回值 ： arg1乘以 arg2的精确结果
* * /
function accMul ( arg1 , arg2 ) {
var m = 0 , s1 = arg1 . toString ( ) , s2 = arg2 . toString ( ) ;
try {
m += s1 . split ( "." ) [ 1 ] . length ;
} catch ( e ) {
}
try {
m += s2 . split ( "." ) [ 1 ] . length ;
} catch ( e ) {
}
return Number ( s1 . replace ( "." , "" ) ) * Number ( s2 . replace ( "." , "" ) ) / Math . pow ( 10 , m ) ;
}
} ,
// 给Number类型增加一个div方法，调用起来更加方便。
div : function ( num , arg ) {
return accDivide ( num , arg ) ;
/ * *
* Return digits length of a number
* @ param { * number } num Input number
* /
function digitLength ( num ) {
// Get digit length of e
var eSplit = num . toString ( ) . split ( /[eE]/ ) ;
var len = ( eSplit [ 0 ] . split ( "." ) [ 1 ] || "" ) . length - ( + ( eSplit [ 1 ] || 0 ) ) ;
return len > 0 ? len : 0 ;
}
/ * *
* 把小数转成整数 ， 支持科学计数法 。 如果是小数则放大成整数
* @ param { * number } num 输入数
* /
function float2Fixed ( num ) {
if ( num . toString ( ) . indexOf ( "e" ) === - 1 ) {
return Number ( num . toString ( ) . replace ( "." , "" ) ) ;
}
var dLen = digitLength ( num ) ;
return dLen > 0 ? num * Math . pow ( 10 , dLen ) : num ;
}
/ * *
* 精确乘法
* /
function times ( num1 , num2 ) {
var others = [ ] ;
for ( var _i = 2 ; _i < arguments . length ; _i ++ ) {
others [ _i - 2 ] = arguments [ _i ] ;
}
if ( others . length > 0 ) {
return times . apply ( void 0 , [ times ( num1 , num2 ) , others [ 0 ] ] . concat ( others . slice ( 1 ) ) ) ;
}
var num1Changed = float2Fixed ( num1 ) ;
var num2Changed = float2Fixed ( num2 ) ;
var baseNum = digitLength ( num1 ) + digitLength ( num2 ) ;
var leftValue = num1Changed * num2Changed ;
return leftValue / Math . pow ( 10 , baseNum ) ;
}
/ * *
* 精确除法
* /
function accDivide ( num1 , num2 ) {
var others = [ ] ;
for ( var _i = 2 ; _i < arguments . length ; _i ++ ) {
others [ _i - 2 ] = arguments [ _i ] ;
}
if ( others . length > 0 ) {
return accDivide . apply ( void 0 , [ accDivide ( num1 , num2 ) , others [ 0 ] ] . concat ( others . slice ( 1 ) ) ) ;
}
var num1Changed = float2Fixed ( num1 ) ;
var num2Changed = float2Fixed ( num2 ) ;
return times ( ( num1Changed / num2Changed ) , Math . pow ( 10 , digitLength ( num2 ) - digitLength ( num1 ) ) ) ;
}
}
} ) ;
/***/ } ) ,
/***/ 127 :
/***/ ( function ( module , exports ) {
/ * *
* 对字符串对象的扩展
* @ class String
* /
_ . extend ( BI , {
/ * *
* 判断字符串是否已指定的字符串开始
* @ param str source字符串
* @ param { String } startTag 指定的开始字符串
* @ return { Boolean } 如果字符串以指定字符串开始则返回true ， 否则返回false
* /
startWith : function ( str , startTag ) {
str = str || "" ;
if ( startTag == null || startTag == "" || str . length === 0 || startTag . length > str . length ) {
return false ;
}
return str . substr ( 0 , startTag . length ) == startTag ;
} ,
/ * *
* 判断字符串是否以指定的字符串结束
* @ param str source字符串
* @ param { String } endTag 指定的字符串
* @ return { Boolean } 如果字符串以指定字符串结束则返回true ， 否则返回false
* /
endWith : function ( str , endTag ) {
if ( endTag == null || endTag == "" || str . length === 0 || endTag . length > str . length ) {
return false ;
}
return str . substring ( str . length - endTag . length ) == endTag ;
} ,
/ * *
* 获取url中指定名字的参数
* @ param str source字符串
* @ param { String } name 参数的名字
* @ return { String } 参数的值
* /
getQuery : function ( str , name ) {
var reg = new RegExp ( "(^|&)" + name + "=([^&]*)(&|$)" ) ;
var r = str . substr ( str . indexOf ( "?" ) + 1 ) . match ( reg ) ;
if ( r ) {
return unescape ( r [ 2 ] ) ;
}
return null ;
} ,
/ * *
* 给url加上给定的参数
* @ param str source字符串
* @ param { Object } paras 参数对象 ， 是一个键值对对象
* @ return { String } 添加了给定参数的url
* /
appendQuery : function ( str , paras ) {
if ( ! paras ) {
return str ;
}
var src = str ;
// 没有问号说明还没有参数
if ( src . indexOf ( "?" ) === - 1 ) {
src += "?" ;
}
// 如果以问号结尾，说明没有其他参数
if ( BI . endWith ( src , "?" ) !== false ) {
} else {
src += "&" ;
}
_ . each ( paras , function ( value , name ) {
if ( typeof ( name ) === "string" ) {
src += name + "=" + value + "&" ;
}
} ) ;
src = src . substr ( 0 , src . length - 1 ) ;
return src ;
} ,
/ * *
* 将所有符合第一个字符串所表示的字符串替换成为第二个字符串
* @ param str source字符串
* @ param { String } s1 要替换的字符串的正则表达式
* @ param { String } s2 替换的结果字符串
* @ returns { String } 替换后的字符串
* /
replaceAll : function ( str , s1 , s2 ) {
return BI . isString ( str ) ? str . replace ( new RegExp ( s1 , "gm" ) , s2 ) : str ;
} ,
/ * *
* 总是让字符串以指定的字符开头
* @ param str source字符串
* @ param { String } start 指定的字符
* @ returns { String } 以指定字符开头的字符串
* /
perfectStart : function ( str , start ) {
if ( BI . startWith ( str , start ) ) {
return str ;
}
return start + str ;
} ,
/ * *
* 获取字符串中某字符串的所有项位置数组
* @ param str source字符串
* @ param { String } sub 子字符串
* @ return { Number [ ] } 子字符串在父字符串中出现的所有位置组成的数组
* /
allIndexOf : function ( str , sub ) {
if ( typeof sub !== "string" ) {
return [ ] ;
}
var location = [ ] ;
var offset = 0 ;
while ( str . length > 0 ) {
var loc = str . indexOf ( sub ) ;
if ( loc === - 1 ) {
break ;
}
location . push ( offset + loc ) ;
str = str . substring ( loc + sub . length , str . length ) ;
offset += loc + sub . length ;
}
return location ;
}
} ) ;
/***/ } ) ,
/***/ 128 :
/***/ ( function ( module , exports ) {
! ( function ( ) {
var i18nStore = { } ;
_ . extend ( BI , {
addI18n : function ( i18n ) {
BI . extend ( i18nStore , i18n ) ;
} ,
i18nText : function ( key ) {
var localeText = i18nStore [ key ] || ( BI . i18n && BI . i18n [ key ] ) || "" ;
if ( ! localeText ) {
localeText = key ;
}
var len = arguments . length ;
if ( len > 1 ) {
if ( localeText . indexOf ( "{R1}" ) > - 1 ) {
for ( var i = 1 ; i < len ; i ++ ) {
var key = "{R" + i + "}" ;
localeText = BI . replaceAll ( localeText , key , arguments [ i ] + "" ) ;
}
} else {
var args = Array . prototype . slice . call ( arguments ) ;
var count = 1 ;
return BI . replaceAll ( localeText , "\\{\\s*\\}" , function ( ) {
return args [ count ++ ] + "" ;
} ) ;
}
}
return localeText ;
}
} ) ;
} ) ( ) ;
/***/ } ) ,
/***/ 129 :
/***/ ( function ( module , exports ) {
( function ( ) {
var moduleInjection = { } ;
BI . module = BI . module || function ( xtype , cls ) {
if ( moduleInjection [ xtype ] != null ) {
_global . console && console . error ( "module:[" + xtype + "] has been registed" ) ;
}
moduleInjection [ xtype ] = cls ;
} ;
var constantInjection = { } ;
BI . constant = BI . constant || function ( xtype , cls ) {
if ( constantInjection [ xtype ] != null ) {
_global . console && console . error ( "constant:[" + xtype + "] has been registed" ) ;
}
constantInjection [ xtype ] = cls ;
} ;
var modelInjection = { } ;
BI . model = BI . model || function ( xtype , cls ) {
if ( modelInjection [ xtype ] != null ) {
_global . console && console . error ( "model:[" + xtype + "] has been registed" ) ;
}
modelInjection [ xtype ] = cls ;
} ;
var storeInjection = { } ;
BI . store = BI . store || function ( xtype , cls ) {
if ( storeInjection [ xtype ] != null ) {
_global . console && console . error ( "store:[" + xtype + "] has been registed" ) ;
}
storeInjection [ xtype ] = cls ;
} ;
var serviceInjection = { } ;
BI . service = BI . service || function ( xtype , cls ) {
if ( serviceInjection [ xtype ] != null ) {
_global . console && console . error ( "service:[" + xtype + "] has been registed" ) ;
}
serviceInjection [ xtype ] = cls ;
} ;
var providerInjection = { } ;
BI . provider = BI . provider || function ( xtype , cls ) {
if ( providerInjection [ xtype ] != null ) {
_global . console && console . error ( "provider:[" + xtype + "] has been registed" ) ;
}
providerInjection [ xtype ] = cls ;
} ;
var configFunctions = { } ;
BI . config = BI . config || function ( type , configFn , opt ) {
if ( BI . initialized ) {
if ( constantInjection [ type ] ) {
return ( constantInjection [ type ] = configFn ( constantInjection [ type ] ) ) ;
}
if ( providerInjection [ type ] ) {
if ( ! providers [ type ] ) {
providers [ type ] = new providerInjection [ type ] ( ) ;
}
// 如果config被重新配置的话，需要删除掉之前的实例
if ( providerInstance [ type ] ) {
delete providerInstance [ type ] ;
}
return configFn ( providers [ type ] ) ;
}
return BI . Plugin . configWidget ( type , configFn , opt ) ;
}
if ( ! configFunctions [ type ] ) {
configFunctions [ type ] = [ ] ;
BI . prepares . push ( function ( ) {
var queue = configFunctions [ type ] ;
for ( var i = 0 ; i < queue . length ; i ++ ) {
if ( constantInjection [ type ] ) {
constantInjection [ type ] = queue [ i ] ( constantInjection [ type ] ) ;
continue ;
}
if ( providerInjection [ type ] ) {
if ( ! providers [ type ] ) {
providers [ type ] = new providerInjection [ type ] ( ) ;
}
if ( providerInstance [ type ] ) {
delete providerInstance [ type ] ;
}
queue [ i ] ( providers [ type ] ) ;
continue ;
}
BI . Plugin . configWidget ( type , queue [ i ] ) ;
}
configFunctions [ type ] = null ;
} ) ;
}
configFunctions [ type ] . push ( configFn ) ;
} ;
var actions = { } ;
var globalAction = [ ] ;
BI . action = BI . action || function ( type , actionFn ) {
if ( BI . isFunction ( type ) ) {
globalAction . push ( type ) ;
return function ( ) {
BI . remove ( globalAction , function ( idx ) {
return globalAction . indexOf ( actionFn ) === idx ;
} ) ;
} ;
}
if ( ! actions [ type ] ) {
actions [ type ] = [ ] ;
}
actions [ type ] . push ( actionFn ) ;
return function ( ) {
BI . remove ( actions [ type ] , function ( idx ) {
return actions [ type ] . indexOf ( actionFn ) === idx ;
} ) ;
if ( actions [ type ] . length === 0 ) {
delete actions [ type ] ;
}
} ;
} ;
var points = { } ;
BI . point = BI . point || function ( type , action , pointFn , after ) {
if ( ! points [ type ] ) {
points [ type ] = { } ;
}
if ( ! points [ type ] [ action ] ) {
points [ type ] [ action ] = { } ;
}
if ( ! points [ type ] [ action ] [ after ? "after" : "before" ] ) {
points [ type ] [ action ] [ after ? "after" : "before" ] = [ ] ;
}
points [ type ] [ action ] [ after ? "after" : "before" ] . push ( pointFn ) ;
} ;
BI . Modules = BI . Modules || {
getModule : function ( type ) {
if ( ! moduleInjection [ type ] ) {
_global . console && console . error ( "module:[" + type + "] does not exists" ) ;
return false ;
}
return moduleInjection [ type ] ;
} ,
getAllModules : function ( ) {
return moduleInjection ;
}
} ;
BI . Constants = BI . Constants || {
getConstant : function ( type ) {
return constantInjection [ type ] ;
}
} ;
var callPoint = function ( inst , types ) {
types = BI . isArray ( types ) ? types : [ types ] ;
BI . each ( types , function ( idx , type ) {
if ( points [ type ] ) {
for ( var action in points [ type ] ) {
var bfns = points [ type ] [ action ] . before ;
if ( bfns ) {
BI . aspect . before ( inst , action , function ( bfns ) {
return function ( ) {
for ( var i = 0 , len = bfns . length ; i < len ; i ++ ) {
try {
bfns [ i ] . apply ( inst , arguments ) ;
} catch ( e ) {
_global . console && console . error ( e ) ;
}
}
} ;
} ( bfns ) ) ;
}
var afns = points [ type ] [ action ] . after ;
if ( afns ) {
BI . aspect . after ( inst , action , function ( afns ) {
return function ( ) {
for ( var i = 0 , len = afns . length ; i < len ; i ++ ) {
try {
afns [ i ] . apply ( inst , arguments ) ;
} catch ( e ) {
_global . console && console . error ( e ) ;
}
}
} ;
} ( afns ) ) ;
}
}
}
} ) ;
} ;
BI . Models = BI . Models || {
getModel : function ( type , config ) {
var inst = new modelInjection [ type ] ( config ) ;
inst . _constructor && inst . _constructor ( config ) ;
inst . mixins && callPoint ( inst , inst . mixins ) ;
callPoint ( inst , type ) ;
return inst ;
}
} ;
var stores = { } ;
BI . Stores = BI . Stores || {
getStore : function ( type , config ) {
if ( stores [ type ] ) {
return stores [ type ] ;
}
var inst = stores [ type ] = new storeInjection [ type ] ( config ) ;
inst . _constructor && inst . _constructor ( config , function ( ) {
delete stores [ type ] ;
} ) ;
callPoint ( inst , type ) ;
return inst ;
}
} ;
var services = { } ;
BI . Services = BI . Services || {
getService : function ( type , config ) {
if ( services [ type ] ) {
return services [ type ] ;
}
services [ type ] = new serviceInjection [ type ] ( config ) ;
callPoint ( services [ type ] , type ) ;
return services [ type ] ;
}
} ;
var providers = { } ,
providerInstance = { } ;
BI . Providers = BI . Providers || {
getProvider : function ( type , config ) {
if ( ! providers [ type ] ) {
providers [ type ] = new providerInjection [ type ] ( ) ;
}
if ( ! providerInstance [ type ] ) {
providerInstance [ type ] = new ( providers [ type ] . $get ( ) ) ( config ) ;
}
return providerInstance [ type ] ;
}
} ;
BI . Actions = BI . Actions || {
runAction : function ( type , event , config ) {
BI . each ( actions [ type ] , function ( i , act ) {
try {
act ( event , config ) ;
} catch ( e ) {
_global . console && console . error ( e ) ;
}
} ) ;
} ,
runGlobalAction : function ( ) {
var args = [ ] . slice . call ( arguments ) ;
BI . each ( globalAction , function ( i , act ) {
try {
act . apply ( null , args ) ;
} catch ( e ) {
_global . console && console . error ( e ) ;
}
} ) ;
}
} ;
BI . getContext = BI . getContext || function ( type , config ) {
if ( constantInjection [ type ] ) {
return BI . Constants . getConstant ( type ) ;
}
if ( modelInjection [ type ] ) {
return BI . Models . getModel ( type , config ) ;
}
if ( storeInjection [ type ] ) {
return BI . Stores . getStore ( type , config ) ;
}
if ( serviceInjection [ type ] ) {
return BI . Services . getService ( type , config ) ;
}
if ( providerInjection [ type ] ) {
return BI . Providers . getProvider ( type , config ) ;
}
} ;
} ) ( ) ;
/***/ } ) ,
/***/ 13 :
/***/ ( function ( module , exports , _ _webpack _require _ _ ) {
"use strict" ;
function _typeof ( obj ) { "@babel/helpers - typeof" ; if ( typeof Symbol === "function" && typeof Symbol . iterator === "symbol" ) { _typeof = function _typeof ( obj ) { return typeof obj ; } ; } else { _typeof = function _typeof ( obj ) { return obj && typeof Symbol === "function" && obj . constructor === Symbol && obj !== Symbol . prototype ? "symbol" : typeof obj ; } ; } return _typeof ( obj ) ; }
var g ; // This works in non-strict mode
g = function ( ) {
return this ;
} ( ) ;
try {
// This works if eval is allowed (see CSP)
g = g || new Function ( "return this" ) ( ) ;
} catch ( e ) {
// This works if the window reference is available
if ( ( typeof window === "undefined" ? "undefined" : _typeof ( window ) ) === "object" ) g = window ;
} // g can still be undefined, but nothing to do about it...
// We return undefined, instead of nothing here, so it's
// easier to handle this case. if(!global) { ...}
module . exports = g ;
/***/ } ) ,
/***/ 130 :
/***/ ( function ( module , exports ) {
/ * *
* 常量
* /
_ . extend ( BI , {
MAX : 0xfffffffffffffff ,
MIN : - 0xfffffffffffffff ,
EVENT _RESPONSE _TIME : 200 ,
zIndex _layer : 1e5 ,
zIndex _popover : 1e6 ,
zIndex _popup : 1e7 ,
zIndex _masker : 1e8 ,
zIndex _tip : 1e9 ,
emptyStr : "" ,
emptyFn : function ( ) {
} ,
empty : null ,
Key : {
48 : "0" ,
49 : "1" ,
50 : "2" ,
51 : "3" ,
52 : "4" ,
53 : "5" ,
54 : "6" ,
55 : "7" ,
56 : "8" ,
57 : "9" ,
65 : "a" ,
66 : "b" ,
67 : "c" ,
68 : "d" ,
69 : "e" ,
70 : "f" ,
71 : "g" ,
72 : "h" ,
73 : "i" ,
74 : "j" ,
75 : "k" ,
76 : "l" ,
77 : "m" ,
78 : "n" ,
79 : "o" ,
80 : "p" ,
81 : "q" ,
82 : "r" ,
83 : "s" ,
84 : "t" ,
85 : "u" ,
86 : "v" ,
87 : "w" ,
88 : "x" ,
89 : "y" ,
90 : "z" ,
96 : "0" ,
97 : "1" ,
98 : "2" ,
99 : "3" ,
100 : "4" ,
101 : "5" ,
102 : "6" ,
103 : "7" ,
104 : "8" ,
105 : "9" ,
106 : "*" ,
107 : "+" ,
109 : "-" ,
110 : "." ,
111 : "/"
} ,
KeyCode : {
BACKSPACE : 8 ,
COMMA : 188 ,
DELETE : 46 ,
DOWN : 40 ,
END : 35 ,
ENTER : 13 ,
ESCAPE : 27 ,
HOME : 36 ,
LEFT : 37 ,
NUMPAD _ADD : 107 ,
NUMPAD _DECIMAL : 110 ,
NUMPAD _DIVIDE : 111 ,
NUMPAD _ENTER : 108 ,
NUMPAD _MULTIPLY : 106 ,
NUMPAD _SUBTRACT : 109 ,
PAGE _DOWN : 34 ,
PAGE _UP : 33 ,
PERIOD : 190 ,
RIGHT : 39 ,
SPACE : 32 ,
TAB : 9 ,
UP : 38
} ,
Status : {
SUCCESS : 1 ,
WRONG : 2 ,
START : 3 ,
END : 4 ,
WAITING : 5 ,
READY : 6 ,
RUNNING : 7 ,
OUTOFBOUNDS : 8 ,
NULL : - 1
} ,
Direction : {
Top : "top" ,
Bottom : "bottom" ,
Left : "left" ,
Right : "right" ,
Custom : "custom"
} ,
Axis : {
Vertical : "vertical" ,
Horizontal : "horizontal"
} ,
Selection : {
Default : - 2 ,
None : - 1 ,
Single : 0 ,
Multi : 1 ,
All : 2
} ,
HorizontalAlign : {
Left : "left" ,
Right : "right" ,
Center : "center" ,
Stretch : "stretch"
} ,
VerticalAlign : {
Middle : "middle" ,
Top : "top" ,
Bottom : "bottom" ,
Stretch : "stretch"
} ,
StartOfWeek : 1
} ) ;
/***/ } ) ,
/***/ 131 :
/***/ ( function ( module , exports ) {
/ * *
* 缓冲池
* @ type { { Buffer : { } } }
* /
( function ( ) {
var Buffer = { } ;
var MODE = false ; // 设置缓存模式为关闭
BI . BufferPool = {
put : function ( name , cache ) {
if ( BI . isNotNull ( Buffer [ name ] ) ) {
throw new Error ( "Buffer Pool has the key already!" ) ;
}
Buffer [ name ] = cache ;
} ,
get : function ( name ) {
return Buffer [ name ] ;
}
} ;
} ) ( ) ;
/***/ } ) ,
/***/ 132 :
/***/ ( function ( module , exports ) {
/ * *
* 共享池
* @ type { { Shared : { } } }
* /
( function ( ) {
var _Shared = { } ;
BI . SharingPool = {
_Shared : _Shared ,
put : function ( name , shared ) {
_Shared [ name ] = shared ;
} ,
cat : function ( ) {
var args = Array . prototype . slice . call ( arguments , 0 ) ,
copy = _Shared ;
for ( var i = 0 ; i < args . length ; i ++ ) {
copy = copy && copy [ args [ i ] ] ;
}
return copy ;
} ,
get : function ( ) {
return BI . deepClone ( this . cat . apply ( this , arguments ) ) ;
} ,
remove : function ( key ) {
delete _Shared [ key ] ;
}
} ;
} ) ( ) ;
/***/ } ) ,
/***/ 133 :
/***/ ( function ( module , exports ) {
BI . Req = {
} ;
/***/ } ) ,
/***/ 52 :
/***/ ( function ( module , exports , _ _webpack _require _ _ ) {
"use strict" ;
/* WEBPACK VAR INJECTION */ ( function ( global ) {
var scope = typeof global !== "undefined" && global || typeof self !== "undefined" && self || window ;
var apply = Function . prototype . apply ; // DOM APIs, for completeness
exports . setTimeout = function ( ) {
return new Timeout ( apply . call ( setTimeout , scope , arguments ) , clearTimeout ) ;
} ;
exports . setInterval = function ( ) {
return new Timeout ( apply . call ( setInterval , scope , arguments ) , clearInterval ) ;
} ;
exports . clearTimeout = exports . clearInterval = function ( timeout ) {
if ( timeout ) {
timeout . close ( ) ;
}
} ;
function Timeout ( id , clearFn ) {
this . _id = id ;
this . _clearFn = clearFn ;
}
Timeout . prototype . unref = Timeout . prototype . ref = function ( ) { } ;
Timeout . prototype . close = function ( ) {
this . _clearFn . call ( scope , this . _id ) ;
} ; // Does not start the time, just sets up the members needed.
exports . enroll = function ( item , msecs ) {
clearTimeout ( item . _idleTimeoutId ) ;
item . _idleTimeout = msecs ;
} ;
exports . unenroll = function ( item ) {
clearTimeout ( item . _idleTimeoutId ) ;
item . _idleTimeout = - 1 ;
} ;
exports . _unrefActive = exports . active = function ( item ) {
clearTimeout ( item . _idleTimeoutId ) ;
var msecs = item . _idleTimeout ;
if ( msecs >= 0 ) {
item . _idleTimeoutId = setTimeout ( function onTimeout ( ) {
if ( item . _onTimeout ) item . _onTimeout ( ) ;
} , msecs ) ;
}
} ; // setimmediate attaches itself to the global object
_ _webpack _require _ _ ( 106 ) ; // On some exotic environments, it's not clear which object `setimmediate` was
// able to install onto. Search each possibility in the same order as the
// `setimmediate` library.
exports . setImmediate = typeof self !== "undefined" && self . setImmediate || typeof global !== "undefined" && global . setImmediate || void 0 && ( void 0 ) . setImmediate ;
exports . clearImmediate = typeof self !== "undefined" && self . clearImmediate || typeof global !== "undefined" && global . clearImmediate || void 0 && ( void 0 ) . clearImmediate ;
/* WEBPACK VAR INJECTION */ } . call ( this , _ _webpack _require _ _ ( 13 ) ) )
/***/ } ) ,
/***/ 66 :
/***/ ( function ( module , exports , _ _webpack _require _ _ ) {
"use strict" ;
// shim for using process in browser
var process = module . exports = { } ; // cached from whatever global is present so that test runners that stub it
// don't break things. But we need to wrap it in a try catch in case it is
// wrapped in strict mode code which doesn't define any globals. It's inside a
// function because try/catches deoptimize in certain engines.
var cachedSetTimeout ;
var cachedClearTimeout ;
function defaultSetTimout ( ) {
throw new Error ( 'setTimeout has not been defined' ) ;
}
function defaultClearTimeout ( ) {
throw new Error ( 'clearTimeout has not been defined' ) ;
}
( function ( ) {
try {
if ( typeof setTimeout === 'function' ) {
cachedSetTimeout = setTimeout ;
} else {
cachedSetTimeout = defaultSetTimout ;
}
} catch ( e ) {
cachedSetTimeout = defaultSetTimout ;
}
try {
if ( typeof clearTimeout === 'function' ) {
cachedClearTimeout = clearTimeout ;
} else {
cachedClearTimeout = defaultClearTimeout ;
}
} catch ( e ) {
cachedClearTimeout = defaultClearTimeout ;
}
} ) ( ) ;
function runTimeout ( fun ) {
if ( cachedSetTimeout === setTimeout ) {
//normal enviroments in sane situations
return setTimeout ( fun , 0 ) ;
} // if setTimeout wasn't available but was latter defined
if ( ( cachedSetTimeout === defaultSetTimout || ! cachedSetTimeout ) && setTimeout ) {
cachedSetTimeout = setTimeout ;
return setTimeout ( fun , 0 ) ;
}
try {
// when when somebody has screwed with setTimeout but no I.E. maddness
return cachedSetTimeout ( fun , 0 ) ;
} catch ( e ) {
try {
// When we are in I.E. but the script has been evaled so I.E. doesn't trust the global object when called normally
return cachedSetTimeout . call ( null , fun , 0 ) ;
} catch ( e ) {
// same as above but when it's a version of I.E. that must have the global object for 'this', hopfully our context correct otherwise it will throw a global error
return cachedSetTimeout . call ( this , fun , 0 ) ;
}
}
}
function runClearTimeout ( marker ) {
if ( cachedClearTimeout === clearTimeout ) {
//normal enviroments in sane situations
return clearTimeout ( marker ) ;
} // if clearTimeout wasn't available but was latter defined
if ( ( cachedClearTimeout === defaultClearTimeout || ! cachedClearTimeout ) && clearTimeout ) {
cachedClearTimeout = clearTimeout ;
return clearTimeout ( marker ) ;
}
try {
// when when somebody has screwed with setTimeout but no I.E. maddness
return cachedClearTimeout ( marker ) ;
} catch ( e ) {
try {
// When we are in I.E. but the script has been evaled so I.E. doesn't trust the global object when called normally
return cachedClearTimeout . call ( null , marker ) ;
} catch ( e ) {
// same as above but when it's a version of I.E. that must have the global object for 'this', hopfully our context correct otherwise it will throw a global error.
// Some versions of I.E. have different rules for clearTimeout vs setTimeout
return cachedClearTimeout . call ( this , marker ) ;
}
}
}
var queue = [ ] ;
var draining = false ;
var currentQueue ;
var queueIndex = - 1 ;
function cleanUpNextTick ( ) {
if ( ! draining || ! currentQueue ) {
return ;
}
draining = false ;
if ( currentQueue . length ) {
queue = currentQueue . concat ( queue ) ;
} else {
queueIndex = - 1 ;
}
if ( queue . length ) {
drainQueue ( ) ;
}
}
function drainQueue ( ) {
if ( draining ) {
return ;
}
var timeout = runTimeout ( cleanUpNextTick ) ;
draining = true ;
var len = queue . length ;
while ( len ) {
currentQueue = queue ;
queue = [ ] ;
while ( ++ queueIndex < len ) {
if ( currentQueue ) {
currentQueue [ queueIndex ] . run ( ) ;
}
}
queueIndex = - 1 ;
len = queue . length ;
}
currentQueue = null ;
draining = false ;
runClearTimeout ( timeout ) ;
}
process . nextTick = function ( fun ) {
var args = new Array ( arguments . length - 1 ) ;
if ( arguments . length > 1 ) {
for ( var i = 1 ; i < arguments . length ; i ++ ) {
args [ i - 1 ] = arguments [ i ] ;
}
}
queue . push ( new Item ( fun , args ) ) ;
if ( queue . length === 1 && ! draining ) {
runTimeout ( drainQueue ) ;
}
} ; // v8 likes predictible objects
function Item ( fun , array ) {
this . fun = fun ;
this . array = array ;
}
Item . prototype . run = function ( ) {
this . fun . apply ( null , this . array ) ;
} ;
process . title = 'browser' ;
process . browser = true ;
process . env = { } ;
process . argv = [ ] ;
process . version = '' ; // empty string to avoid regexp issues
process . versions = { } ;
function noop ( ) { }
process . on = noop ;
process . addListener = noop ;
process . once = noop ;
process . off = noop ;
process . removeListener = noop ;
process . removeAllListeners = noop ;
process . emit = noop ;
process . prependListener = noop ;
process . prependOnceListener = noop ;
process . listeners = function ( name ) {
return [ ] ;
} ;
process . binding = function ( name ) {
throw new Error ( 'process.binding is not supported' ) ;
} ;
process . cwd = function ( ) {
return '/' ;
} ;
process . chdir = function ( dir ) {
throw new Error ( 'process.chdir is not supported' ) ;
} ;
process . umask = function ( ) {
return 0 ;
} ;
/***/ } ) ,
/***/ 754 :
/***/ ( function ( module , exports ) {
BI . i18n = {
"BI-Multi_Date_Quarter_End" : "季度末" ,
"BI-Multi_Date_Month_Begin" : "月初" ,
"BI-Multi_Date_YMD" : "年月日" ,
"BI-Custom_Color" : "自定义颜色" ,
"BI-Numerical_Interval_Input_Data" : "请输入数值" ,
"BI-Please_Input_Natural_Number" : "请输入非负整数" ,
"BI-No_More_Data" : "无更多数据" ,
"BI-Basic_Altogether" : "共" ,
"BI-Basic_Sunday" : "星期日" ,
"BI-Widget_Background_Colour" : "组件背景" ,
"BI-Color_Picker_Error_Text" : "请输入0~255的正整数" ,
"BI-Multi_Date_Month" : "月" ,
"BI-No_Selected_Item" : "没有可选项" ,
"BI-Multi_Date_Year_Begin" : "年初" ,
"BI-Quarter_1" : "第1季度" ,
"BI-Quarter_2" : "第2季度" ,
"BI-Quarter_3" : "第3季度" ,
"BI-Quarter_4" : "第4季度" ,
"BI-Multi_Date_Year_Next" : "年后" ,
"BI-Multi_Date_Month_Prev" : "个月前" ,
"BI-Month_Trigger_Error_Text" : "请输入1~12的正整数" ,
"BI-Less_And_Equal" : "小于等于" ,
"BI-Year_Trigger_Invalid_Text" : "请输入有效时间" ,
"BI-Multi_Date_Week_Next" : "周后" ,
"BI-Font_Size" : "字号" ,
"BI-Basic_Total" : "共" ,
"BI-Already_Selected" : "已选择" ,
"BI-Formula_Insert" : "插入" ,
"BI-Select_All" : "全选" ,
"BI-Basic_Tuesday" : "星期二" ,
"BI-Multi_Date_Month_End" : "月末" ,
"BI-Load_More" : "点击加载更多数据" ,
"BI-Basic_September" : "九月" ,
"BI-Current_Is_Last_Page" : "当前已是最后一页" ,
"BI-Basic_Auto" : "自动" ,
"BI-Basic_Count" : "个" ,
"BI-Basic_Value" : "值" ,
"BI-Basic_Unrestricted" : "无限制" ,
"BI-Quarter_Trigger_Error_Text" : "请输入1~4的正整数" ,
"BI-Basic_More" : "更多" ,
"BI-Basic_Wednesday" : "星期三" ,
"BI-Basic_Bold" : "加粗" ,
"BI-Basic_Simple_Saturday" : "六" ,
"BI-Multi_Date_Month_Next" : "个月后" ,
"BI-Basic_March" : "三月" ,
"BI-Current_Is_First_Page" : "当前已是第一页" ,
"BI-Basic_Thursday" : "星期四" ,
"BI-Basic_Prompt" : "提示" ,
"BI-Multi_Date_Today" : "今天" ,
"BI-Multi_Date_Quarter_Prev" : "个季度前" ,
"BI-Row_Header" : "行表头" ,
"BI-Date_Trigger_Error_Text" : "日期格式示例:2015-3-11" ,
"BI-Basic_Cancel" : "取消" ,
"BI-Basic_January" : "一月" ,
"BI-Basic_June" : "六月" ,
"BI-Basic_July" : "七月" ,
"BI-Basic_April" : "四月" ,
"BI-Multi_Date_Quarter_Begin" : "季度初" ,
"BI-Multi_Date_Week" : "周" ,
"BI-Click_Blank_To_Select" : "点击\"空格键\"选中完全匹配项" ,
"BI-Basic_August" : "八月" ,
"BI-Word_Align_Left" : "文字居左" ,
"BI-Basic_November" : "十一月" ,
"BI-Font_Colour" : "字体颜色" ,
"BI-Multi_Date_Day_Prev" : "天前" ,
"BI-Select_Part" : "部分选择" ,
"BI-Multi_Date_Day_Next" : "天后" ,
"BI-Less_Than" : "小于" ,
"BI-Basic_February" : "二月" ,
"BI-Multi_Date_Year" : "年" ,
"BI-Number_Index" : "序号" ,
"BI-Multi_Date_Week_Prev" : "周前" ,
"BI-Next_Page" : "下一页" ,
"BI-Right_Page" : "向右翻页" ,
"BI-Numerical_Interval_Signal_Value" : "前后值相等，请将操作符改为“≤”" ,
"BI-Basic_December" : "十二月" ,
"BI-Basic_Saturday" : "星期六" ,
"BI-Basic_Simple_Wednesday" : "三" ,
"BI-Multi_Date_Quarter_Next" : "个季度后" ,
"BI-Basic_October" : "十月" ,
"BI-Basic_Simple_Friday" : "五" ,
"BI-Basic_Save" : "保存" ,
"BI-Numerical_Interval_Number_Value" : "请保证前面的数值小于/等于后面的数值" ,
"BI-Previous_Page" : "上一页" ,
"BI-No_Select" : "搜索结果为空" ,
"BI-Basic_Clears" : "清空" ,
"BI-Created_By_Me" : "我创建的" ,
"BI-Basic_Simple_Tuesday" : "二" ,
"BI-Word_Align_Right" : "文字居右" ,
"BI-Summary_Values" : "汇总" ,
"BI-Basic_Clear" : "清除" ,
"BI-Upload_File_Size_Error" : "文件大小不支持" ,
"BI-Up_Page" : "向上翻页" ,
"BI-Basic_Simple_Sunday" : "日" ,
"BI-Multi_Date_Relative_Current_Time" : "相对当前时间" ,
"BI-Selected_Data" : "已选数据：" ,
"BI-Multi_Date_Quarter" : "季度" ,
"BI-Check_Selected" : "查看已选" ,
"BI-Basic_Search" : "搜索" ,
"BI-Basic_May" : "五月" ,
"BI-Continue_Select" : "继续选择" ,
"BI-Please_Input_Positive_Integer" : "请输入正整数" ,
"BI-Upload_File_Type_Error" : "文件类型不支持" ,
"BI-Upload_File_Error" : "文件上传失败" ,
"BI-Basic_Friday" : "星期五" ,
"BI-Down_Page" : "向下翻页" ,
"BI-Basic_Monday" : "星期一" ,
"BI-Left_Page" : "向左翻页" ,
"BI-Transparent_Color" : "透明" ,
"BI-Basic_Simple_Monday" : "一" ,
"BI-Multi_Date_Year_End" : "年末" ,
"BI-Time_Interval_Error_Text" : "请保证开始时间早于/等于结束时间" ,
"BI-Basic_Time" : "时间" ,
"BI-Basic_OK" : "确定" ,
"BI-Basic_Sure" : "确定" ,
"BI-Basic_Simple_Thursday" : "四" ,
"BI-Multi_Date_Year_Prev" : "年前" ,
"BI-Tiao_Data" : "条数据" ,
"BI-Basic_Italic" : "斜体" ,
"BI-Basic_Dynamic_Title" : "动态时间" ,
"BI-Basic_Year" : "年" ,
"BI-Basic_Single_Quarter" : "季" ,
"BI-Basic_Month" : "月" ,
"BI-Basic_Week" : "周" ,
"BI-Basic_Day" : "天" ,
"BI-Basic_Work_Day" : "工作日" ,
"BI-Basic_Front" : "前" ,
"BI-Basic_Behind" : "后" ,
"BI-Basic_Empty" : "空" ,
"BI-Basic_Month_End" : "月末" ,
"BI-Basic_Month_Begin" : "月初" ,
"BI-Basic_Year_End" : "年末" ,
"BI-Basic_Year_Begin" : "年初" ,
"BI-Basic_Quarter_End" : "季末" ,
"BI-Basic_Quarter_Begin" : "季初" ,
"BI-Basic_Week_End" : "周末" ,
"BI-Basic_Week_Begin" : "周初" ,
"BI-Basic_Current_Day" : "当天" ,
"BI-Basic_Begin_Start" : "初" ,
"BI-Basic_End_Stop" : "末" ,
"BI-Basic_Current_Year" : "今年" ,
"BI-Basic_Year_Fen" : "年份" ,
"BI-Basic_Current_Month" : "本月" ,
"BI-Basic_Current_Quarter" : "本季度" ,
"BI-Basic_Year_Month" : "年月" ,
"BI-Basic_Year_Quarter" : "年季度" ,
"BI-Basic_Input_Can_Not_Null" : "输入框不能为空" ,
"BI-Basic_Date_Time_Error_Text" : "日期格式示例:2015-3-11 00:00:00" ,
"BI-Basic_Input_From_To_Number" : "请输入{R1}的数值" ,
"BI-Basic_Or" : "或" ,
"BI-Basic_And" : "且" ,
"BI-Conf_Add_Formula" : "添加公式" ,
"BI-Conf_Add_Condition" : "添加条件" ,
"BI-Conf_Formula_And" : "且公式条件" ,
"BI-Conf_Formula_Or" : "或公式条件" ,
"BI-Conf_Condition_And" : "且条件" ,
"BI-Conf_Condition_Or" : "或条件" ,
"BI-Microsoft_YaHei" : "微软雅黑" ,
"BI-Apple_Light" : "苹方-light" ,
"BI-Font_Family" : "字体" ,
"BI-Basic_Please_Input_Content" : "请输入内容" ,
"BI-Word_Align_Center" : "文字居中" ,
"BI-Basic_Please_Enter_Number_Between" : "请输入{R1}-{R2}的值" ,
"BI-More_Than" : "大于" ,
"BI-More_And_Equal" : "大于等于" ,
"BI-Please_Enter_SQL" : "请输入SQL" ,
"BI-Basic_Click_To_Add_Text" : "+点击新增\"{R1}\"" ,
"BI-Basic_Please_Select" : "请选择" ,
"BI-Basic_Font_Color" : "文字颜色" ,
"BI-Basic_Background_Color" : "背景色" ,
"BI-Basic_Underline" : "下划线" ,
"BI-Basic_Param_Month" : "{R1}月" ,
"BI-Basic_Param_Day" : "{R1}日" ,
"BI-Basic_Param_Quarter" : "{R1}季度" ,
"BI-Basic_Param_Week_Count" : "第{R1}周" ,
"BI-Basic_Param_Hour" : "{R1}时" ,
"BI-Basic_Param_Minute" : "{R1}分" ,
"BI-Basic_Param_Second" : "{R1}秒" ,
"BI-Basic_Param_Year" : "{R1}年" ,
"BI-Basic_Date_Day" : "日" ,
"BI-Basic_Hour_Sin" : "时" ,
"BI-Basic_Seconds" : "秒" ,
"BI-Basic_Minute" : "分" ,
"BI-Basic_Wan" : "万" ,
"BI-Basic_Million" : "百万" ,
"BI-Basic_Billion" : "亿" ,
"BI-Basic_Quarter" : "季度" ,
"BI-Basic_No_Select" : "不选" ,
"BI-Basic_Now" : "此刻" ,
"BI-Color_Picker_Error_Text_Hex" : "请输入6位16进制颜色编号"
} ;
/***/ } )
/******/ } ) ;
